From 8fb0bf41175fbe61ddace388a620635250c76e4e Mon Sep 17 00:00:00 2001 From: ThaUnknown <6506529+ThaUnknown@users.noreply.github.com> Date: Tue, 8 Mar 2022 20:18:13 +0100 Subject: [PATCH] remove 44 commits across 4 months to remove shit like secrets, api keys etc from private groups and trackers --- README.md | 8 + app/css/misc.css | 12 + app/index.html | 45 +- app/js/anilist.js | 8 +- app/js/anime.js | 24 +- app/js/bundle.js | 84921 +-------------------------------- app/js/bundle.js.LICENSE.txt | 76 + app/js/bundle.js.map | 2 +- app/js/interface.js | 24 +- app/js/keys.js | 6 + app/js/main.js | 10 +- app/js/rss.js | 6 +- app/js/settings.js | 10 +- app/js/util.js | 69 + app/js/webseed.js | 249 + app/lib/cast.html | 2 +- index.html | 2 +- site.webmanifest | 7 +- webpack.config.js | 4 +- 19 files changed, 506 insertions(+), 84979 deletions(-) create mode 100644 app/js/bundle.js.LICENSE.txt create mode 100644 app/js/keys.js create mode 100644 app/js/webseed.js diff --git a/README.md b/README.md index 3cb480f..9c706e2 100644 --- a/README.md +++ b/README.md @@ -1,3 +1,11 @@ +# THIS IS AN ARCHIVE BRANCH, IT WAS PRIVATE FOR A REASON + +This branch is entirely for the sake of "I worked on it, I want the commits", it was private because the code was dogshit and honestly a joke, and it's being re-written from scratch for a good reason!!! +This includes meme commits, testing on production, write your own JS framework and other blantant "don't do you fucking idiot", read the code/commits at your own risk! + +

+ + [![forthebadge](https://forthebadge.com/images/badges/it-works-why.svg)](https://forthebadge.com) [![forthebadge](https://forthebadge.com/images/badges/powered-by-black-magic.svg)](https://forthebadge.com) [![forthebadge](https://forthebadge.com/images/badges/works-on-my-machine.svg)](https://forthebadge.com) # Miru Miru is a simple anime torrent streaming client targetted at normies, meant as a replacement for shitty streaming sites with a lot of extra added functionality. diff --git a/app/css/misc.css b/app/css/misc.css index 6a8644e..bce87c4 100644 --- a/app/css/misc.css +++ b/app/css/misc.css @@ -17,6 +17,18 @@ body { user-select: none; } +noscript { + width: 100%; + height: 100%; + position: absolute; + background: #000; + z-index: 1000; +} + +#gsignin { + background: #000; +} + .badge-color { background-color: var(--color) !important; border-color: var(--color) !important; diff --git a/app/index.html b/app/index.html index e8446fa..ca28b39 100644 --- a/app/index.html +++ b/app/index.html @@ -13,7 +13,7 @@ - + @@ -26,6 +26,16 @@ + +
+
+ Click to sign in with your Google Drive account.
Make sure you grant GDrive access! +
+
Quality
@@ -998,6 +1004,11 @@ wss://peertube.cpy.re:443/tracker/socket +
+ + +
diff --git a/app/js/anilist.js b/app/js/anilist.js index d25bcad..83edb12 100644 --- a/app/js/anilist.js +++ b/app/js/anilist.js @@ -1,4 +1,5 @@ import { alID } from './interface.js' +import { settings } from './settings.js' import halfmoon from 'halfmoon' async function handleRequest (opts) { @@ -71,7 +72,8 @@ export async function alRequest (opts) { perPage: opts.perPage || 30, status_in: opts.status_in || '[CURRENT,PLANNING]', chunk: opts.chunk || 1, - perchunk: opts.perChunk || 30 + perchunk: opts.perChunk || 30, + startDate: (!settings.other3 && (opts.startDate || 20210328)) || 10000000 } const options = { method: 'POST', @@ -260,12 +262,12 @@ query ($page: Int, $perPage: Int, $from: Int, $to: Int) { variables.status = opts.status variables.sort = opts.sort || 'SEARCH_MATCH' query = ` -query ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: MediaStatus, $season: MediaSeason, $year: Int, $genre: String, $format: MediaFormat) { +query ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: MediaStatus, $season: MediaSeason, $year: Int, $genre: String, $format: MediaFormat, $startDate: FuzzyDateInt) { Page (page: $page, perPage: $perPage) { pageInfo { hasNextPage }, - media(type: $type, search: $search, sort: $sort, status: $status, season: $season, seasonYear: $year, genre: $genre, format: $format) { + media(type: $type, search: $search, sort: $sort, status: $status, season: $season, seasonYear: $year, genre: $genre, format: $format, startDate_greater: $startDate) { ${queryObjects} } } diff --git a/app/js/anime.js b/app/js/anime.js index 32fbf74..2a713ba 100644 --- a/app/js/anime.js +++ b/app/js/anime.js @@ -111,14 +111,8 @@ export async function resolveFileMedia (opts) { async function resolveTitle (title) { if (!(title in relations)) { // resolve name and shit - let method, res - if (opts.isRelease) { - method = { name: title, method: 'SearchName', perPage: 1, status: ['RELEASING'], sort: 'SEARCH_MATCH' } - // maybe releases should include this and last season? idfk - } else { - method = { name: title, method: 'SearchName', perPage: 1, status: ['RELEASING', 'FINISHED'], sort: 'SEARCH_MATCH' } - } - res = await alRequest(method) + const method = { name: title, method: 'SearchName', perPage: 1, status: ['RELEASING', 'FINISHED'], sort: 'SEARCH_MATCH', startDate: 10000000 } + let res = await alRequest(method) if (!res.data.Page.media[0]) { const index = method.name.search(/S\d/) method.name = ((index !== -1 && method.name.slice(0, index) + method.name.slice(index + 1, method.name.length)) || method.name).replace('(TV)', '').replace(/ (19[5-9]\d|20[0-6]\d)/, '').replace('-', '') @@ -138,7 +132,11 @@ export async function resolveFileMedia (opts) { const parseObjs = await Promise.all(parsePromises) await Promise.all([...new Set(parseObjs.map(obj => obj.anime_title))].map(title => resolveTitle(title))) const assoc = {} - for (const media of (await alRequest({ method: 'SearchIDS', id: [...new Set(parseObjs.map(obj => relations[obj.anime_title]))], perPage: 50 })).data.Page.media) assoc[media.id] = media + for (let ids = [...new Set(parseObjs.map(obj => relations[obj.anime_title]))]; ids.length; ids = ids.slice(50)) { + for await (const media of (await alRequest({ method: 'SearchIDS', id: ids.slice(0, 50), perPage: 50 })).data.Page.media) { + assoc[media.id] = media + } + } const fileMedias = [] for (const praseObj of parseObjs) { let episode @@ -161,16 +159,16 @@ export async function resolveFileMedia (opts) { tempMedia = opts.media.relations.edges.filter(edge => edge.relationType === 'SEQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))[0].node increment = true } - if (tempMedia?.episodes && epMax - (opts.offset + tempMedia.episodes) > (media.nextAiringEpisode?.episode || media.episodes)) { + if (tempMedia?.episodes && epMax - (opts.offset + media.episodes) > (media.nextAiringEpisode?.episode || media.episodes)) { // episode is still out of bounds const nextEdge = await alRequest({ method: 'SearchIDSingle', id: tempMedia.id }) await resolveSeason({ media: nextEdge.data.Media, episode: opts.episode, offset: opts.offset + nextEdge.data.Media.episodes, increment: increment }) - } else if (tempMedia?.episodes && epMax - (opts.offset + tempMedia.episodes) <= (media.nextAiringEpisode?.episode || media.episodes) && epMin - (opts.offset + tempMedia.episodes) > 0) { + } else if (tempMedia?.episodes && epMax - (opts.offset + media.episodes) <= (media.nextAiringEpisode?.episode || media.episodes) && epMin - (opts.offset + media.episodes) > 0) { // episode is in range, seems good! overwriting media to count up "seasons" if (opts.episode.constructor === Array) { - episode = `${praseObj.episode_number[0] - (opts.offset + tempMedia.episodes)} ~ ${praseObj.episode_number[praseObj.episode_number.length - 1] - (opts.offset + tempMedia.episodes)}` + episode = `${praseObj.episode_number[0] - (opts.offset + media.episodes)} ~ ${praseObj.episode_number[praseObj.episode_number.length - 1] - (opts.offset + media.episodes)}` } else { - episode = opts.episode - (opts.offset + tempMedia.episodes) + episode = opts.episode - (opts.offset + media.episodes) } if (opts.increment || increment) { const nextEdge = await alRequest({ method: 'SearchIDSingle', id: tempMedia.id }) diff --git a/app/js/bundle.js b/app/js/bundle.js index 9c7d65e..ef75ac3 100644 --- a/app/js/bundle.js +++ b/app/js/bundle.js @@ -1,84920 +1,3 @@ -/******/ (() => { // webpackBootstrap -/******/ var __webpack_modules__ = ({ - -/***/ "./app/js/anilist.js": -/*!***************************!*\ - !*** ./app/js/anilist.js ***! - \***************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "alEntry": () => (/* binding */ alEntry), -/* harmony export */ "alRequest": () => (/* binding */ alRequest) -/* harmony export */ }); -/* harmony import */ var _interface_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./interface.js */ "./app/js/interface.js"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! halfmoon */ "halfmoon"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(halfmoon__WEBPACK_IMPORTED_MODULE_1__); -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); - - - -async function handleRequest (opts) { - return await fetch('https://graphql.anilist.co', opts).then(async res => { - const json = await res.json() - if (!res.ok) { - for (const error of json.errors) { - halfmoon__WEBPACK_IMPORTED_MODULE_1___default().initStickyAlert({ - content: `Failed making request to anilist!
${error.status} - ${error.message}`, - title: 'Search Failed', - alertType: 'alert-danger', - fillType: '' - }) - console.error(error) - } - } - return json - }) -} - -function alEntry (filemedia) { - if (filemedia.media && localStorage.getItem('ALtoken')) { - alRequest({ method: 'SearchIDStatus', id: filemedia.media.id }).then(res => { - if ((res.errors && res.errors[0].status === 404) || res.data.MediaList.progress <= filemedia.episodeNumber || filemedia.episodes === 1) { - const query = ` -mutation ($id: Int, $status: MediaListStatus, $episode: Int, $repeat: Int) { - SaveMediaListEntry (mediaId: $id, status: $status, progress: $episode, repeat: $repeat) { - id, - status, - progress, - repeat - } -}` - const variables = { - repeat: 0, - id: filemedia.media.id, - status: 'CURRENT', - episode: filemedia.episodeNumber || 1 - } - if (filemedia.episodeNumber === filemedia.media.episodes || filemedia.episodes === 1) { - variables.status = 'COMPLETED' - if (res.data.MediaList.status === 'COMPLETED') { - variables.repeat = res.data.MediaList.repeat + 1 - } - } - const options = { - method: 'POST', - headers: { - Authorization: 'Bearer ' + localStorage.getItem('ALtoken'), - 'Content-Type': 'application/json', - Accept: 'application/json' - }, - body: JSON.stringify({ - query: query, - variables: variables - }) - } - handleRequest(options) - } - }) - } -} - -async function alRequest (opts) { - let query - const variables = { - type: 'ANIME', - sort: opts.sort || 'TRENDING_DESC', - page: opts.page || 1, - perPage: opts.perPage || 30, - status_in: opts.status_in || '[CURRENT,PLANNING]', - chunk: opts.chunk || 1, - perchunk: opts.perChunk || 30 - } - const options = { - method: 'POST', - headers: { - 'Content-Type': 'application/json', - Accept: 'application/json' - } - } - const queryObjects = ` -id, -title { - romaji, - english, - native, - userPreferred -}, -description( - asHtml: true -), -season, -seasonYear, -format, -status, -episodes, -duration, -averageScore, -genres, -coverImage { - extraLarge, - medium, - color -}, -countryOfOrigin, -isAdult, -bannerImage, -synonyms, -nextAiringEpisode { - timeUntilAiring, - episode -}, -trailer { - id, - site -}, -streamingEpisodes { - title, - thumbnail -}, -mediaListEntry { - progress -}, -source, -studios(isMain: true) { - nodes { - name - } -}, -relations { - edges { - relationType(version:2) - node { - id, - title { - userPreferred - }, - coverImage { - medium - }, - type, - status, - format, - episodes - } - } -}` - if (opts.status) variables.status = opts.status - if (localStorage.getItem('ALtoken')) options.headers.Authorization = localStorage.getItem('ALtoken') - switch (opts.method) { - case 'SearchName': { - variables.search = opts.name - query = ` -query ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: [MediaStatus]) { - Page (page: $page, perPage: $perPage) { - pageInfo { - hasNextPage - }, - media(type: $type, search: $search, sort: $sort, status_in: $status) { - ${queryObjects} - } - } -}` - break - } case 'SearchIDSingle': { - variables.id = opts.id - query = ` -query ($id: Int, $type: MediaType) { - Media (id: $id, type: $type) { - ${queryObjects} - } -}` - break - } case 'SearchIDS': { - variables.id = opts.id - query = ` -query ($id: [Int], $type: MediaType, $page: Int, $perPage: Int) { - Page (page: $page, perPage: $perPage) { - pageInfo { - hasNextPage - }, - media (id_in: $id, type: $type) { - ${queryObjects} - } - } -}` - break - } case 'Viewer': { - query = ` -query { - Viewer { - avatar { - medium - }, - name, - id - } -}` - break - } case 'UserLists': { - variables.id = opts.id - query = ` -query ($page: Int, $perPage: Int, $id: Int, $type: MediaType, $status_in: [MediaListStatus]){ - Page (page: $page, perPage: $perPage) { - pageInfo { - hasNextPage - }, - mediaList (userId: $id, type: $type, status_in: $status_in) { - media { - ${queryObjects} - } - } - } -}` - break - } case 'SearchIDStatus': { - variables.id = _interface_js__WEBPACK_IMPORTED_MODULE_0__.alID - variables.mediaId = opts.id - query = ` -query ($id: Int, $mediaId: Int){ - MediaList(userId: $id, mediaId: $mediaId) { - status, - progress, - repeat - } -}` - break - } case 'AiringSchedule': { - const date = new Date() - const diff = date.getDay() >= 1 ? date.getDay() - 1 : 6 - date.getDay() - date.setDate(date.getDate() - diff) - date.setHours(0, 0, 0, 0) - variables.from = date.getTime() / 1000 - variables.to = (date.getTime() + 7 * 24 * 60 * 60 * 1000) / 1000 - query = ` -query ($page: Int, $perPage: Int, $from: Int, $to: Int) { - Page (page: $page, perPage: $perPage) { - pageInfo { - hasNextPage - }, - airingSchedules(airingAt_greater: $from, airingAt_lesser: $to) { - episode, - timeUntilAiring, - airingAt, - media{ - ${queryObjects} - } - } - } -}` - break - } case 'Search': { - variables.genre = opts.genre - variables.search = opts.search - variables.year = opts.year - variables.season = opts.season - variables.format = opts.format - variables.status = opts.status - variables.sort = opts.sort || 'SEARCH_MATCH' - query = ` -query ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: MediaStatus, $season: MediaSeason, $year: Int, $genre: String, $format: MediaFormat) { - Page (page: $page, perPage: $perPage) { - pageInfo { - hasNextPage - }, - media(type: $type, search: $search, sort: $sort, status: $status, season: $season, seasonYear: $year, genre: $genre, format: $format) { - ${queryObjects} - } - } -}` - } - } - options.body = JSON.stringify({ - query: query.replace(/\s/g, ''), - variables: variables - }) - - return await handleRequest(options) -} - - -/***/ }), - -/***/ "./app/js/anime.js": -/*!*************************!*\ - !*** ./app/js/anime.js ***! - \*************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "episodeRx": () => (/* binding */ episodeRx), -/* harmony export */ "nyaaSearch": () => (/* binding */ nyaaSearch), -/* harmony export */ "resolveFileMedia": () => (/* binding */ resolveFileMedia), -/* harmony export */ "relations": () => (/* binding */ relations) -/* harmony export */ }); -/* harmony import */ var _main_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./main.js */ "./app/js/main.js"); -/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./util.js */ "./app/js/util.js"); -/* harmony import */ var _anilist_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./anilist.js */ "./app/js/anilist.js"); -/* harmony import */ var _rss_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./rss.js */ "./app/js/rss.js"); -/* harmony import */ var _interface_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./interface.js */ "./app/js/interface.js"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! halfmoon */ "halfmoon"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_5___default = /*#__PURE__*/__webpack_require__.n(halfmoon__WEBPACK_IMPORTED_MODULE_5__); -/* harmony import */ var anitomyscript__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! anitomyscript */ "anitomyscript"); -/* harmony import */ var anitomyscript__WEBPACK_IMPORTED_MODULE_6___default = /*#__PURE__*/__webpack_require__.n(anitomyscript__WEBPACK_IMPORTED_MODULE_6__); -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -/* global searchText */ - - - - - - - -const torrentRx = /(^magnet:){1}|(^[A-F\d]{8,40}$){1}|(.*\.torrent$){1}/i -const imageRx = /\.(jpeg|jpg|gif|png|webp)/i -window.addEventListener('paste', async e => { // WAIT image lookup on paste, or add torrent on paste - const item = e.clipboardData.items[0] - if (item && item.type.indexOf('image') === 0) { - e.preventDefault() - const formData = new FormData() - formData.append('image', item.getAsFile()) - traceAnime(formData, 'file') - } else if (item && item.type === 'text/plain') { - item.getAsString(text => { - if (torrentRx.exec(text)) { - e.preventDefault() - searchText.value = '' - _main_js__WEBPACK_IMPORTED_MODULE_0__.client.playTorrent(text) - } else if (imageRx.exec(text)) { - e.preventDefault() - searchText.value = '' - traceAnime(text) - } - }) - } else if (item && item.type === 'text/html') { - item.getAsString(text => { - const img = (0,_util_js__WEBPACK_IMPORTED_MODULE_1__.DOMPARSER)(text, 'text/html').querySelectorAll('img')[0] - if (img) { - e.preventDefault() - searchText.value = '' - traceAnime(img.src) - } - }) - } -}) -if (_util_js__WEBPACK_IMPORTED_MODULE_1__.searchParams.get('link')) { - traceAnime(_util_js__WEBPACK_IMPORTED_MODULE_1__.searchParams.get('link')) - window.location = '/app/#home' -} -function traceAnime (image, type) { // WAIT lookup logic - if (type === 'file') { - const reader = new FileReader() - reader.onload = e => { - halfmoon__WEBPACK_IMPORTED_MODULE_5___default().initStickyAlert({ - content: `Looking up anime for image.
` - }) - } - reader.readAsDataURL(image.get('image')) - } else { - halfmoon__WEBPACK_IMPORTED_MODULE_5___default().initStickyAlert({ - content: `Looking up anime for image.
` - }) - } - let options - let url = `https://api.trace.moe/search?cutBorders&url=${image}` - if (type === 'file') { - options = { - method: 'POST', - body: image - } - url = 'https://api.trace.moe/search' - } - fetch(url, options).then(res => res.json()).then(async ({ result }) => { - if (result && result[0].similarity >= 0.85) { - const res = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_2__.alRequest)({ method: 'SearchIDSingle', id: result[0].anilist }) - ;(0,_interface_js__WEBPACK_IMPORTED_MODULE_4__.viewMedia)(res.data.Media, result[0].episode) - } else { - halfmoon__WEBPACK_IMPORTED_MODULE_5___default().initStickyAlert({ - content: 'Couldn\'t find anime for specified image! Try to remove black bars, or use a more detailed image.', - title: 'Search Failed', - alertType: 'alert-danger', - fillType: '' - }) - } - }) -} -const episodeRx = /Episode (\d+) - (.*)/ - -async function nyaaSearch (media, episode, isOffline) { - if (parseInt(episode) < 10) { - episode = `0${episode}` - } - - const table = document.querySelector('tbody.results') - const results = await (0,_rss_js__WEBPACK_IMPORTED_MODULE_3__.nyaaRss)(media, episode, isOffline) - - if (results.children.length === 0) { - halfmoon__WEBPACK_IMPORTED_MODULE_5___default().initStickyAlert({ - content: `Couldn't find torrent for ${media.title.userPreferred} Episode ${parseInt(episode)}! Try specifying a torrent manually.`, - title: 'Search Failed', - alertType: 'alert-danger', - fillType: '' - }) - } else { - table.innerHTML = '' - table.appendChild(results) - halfmoon__WEBPACK_IMPORTED_MODULE_5___default().toggleModal('tsearch') - } -} - -// resolve anime name based on file name and store it - -async function resolveFileMedia (opts) { - // opts.fileName opts.isRelease - - async function resolveTitle (title) { - if (!(title in relations)) { - // resolve name and shit - let method, res - if (opts.isRelease) { - method = { name: title, method: 'SearchName', perPage: 1, status: ['RELEASING'], sort: 'SEARCH_MATCH' } - // maybe releases should include this and last season? idfk - } else { - method = { name: title, method: 'SearchName', perPage: 1, status: ['RELEASING', 'FINISHED'], sort: 'SEARCH_MATCH' } - } - res = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_2__.alRequest)(method) - if (!res.data.Page.media[0]) { - const index = method.name.search(/S\d/) - method.name = ((index !== -1 && method.name.slice(0, index) + method.name.slice(index + 1, method.name.length)) || method.name).replace('(TV)', '').replace(/ (19[5-9]\d|20[0-6]\d)/, '').replace('-', '') - method.status = ['RELEASING', 'FINISHED'] - res = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_2__.alRequest)(method) - } - if (res.data.Page.media[0]) { - relations[title] = res.data.Page.media[0].id - } else { - relations[title] = null - } - } - } - const parsePromises = opts.fileName.constructor === Array - ? opts.fileName.map(name => anitomyscript__WEBPACK_IMPORTED_MODULE_6___default()(name)) - : [anitomyscript__WEBPACK_IMPORTED_MODULE_6___default()(opts.fileName)] - const parseObjs = await Promise.all(parsePromises) - await Promise.all([...new Set(parseObjs.map(obj => obj.anime_title))].map(title => resolveTitle(title))) - const assoc = {} - for (const media of (await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_2__.alRequest)({ method: 'SearchIDS', id: [...new Set(parseObjs.map(obj => relations[obj.anime_title]))], perPage: 50 })).data.Page.media) assoc[media.id] = media - const fileMedias = [] - for (const praseObj of parseObjs) { - let episode - let media = assoc[relations[praseObj.anime_title]] - async function resolveSeason (opts) { - // opts.media, opts.episode, opts.increment, opts.offset - let epMin, epMax - if (opts.episode.constructor === Array) { // support batch episode ranges - epMin = Number(opts.episode[0]) - epMax = Number(opts.episode[opts.episode.length - 1]) - } else { - epMin = epMax = Number(opts.episode) - } - let tempMedia, increment - if (opts.media.relations.edges.some(edge => edge.relationType === 'PREQUEL' && (edge.node.format === 'TV' || 'TV_SHORT')) && !opts.increment) { - // media has prequel and we dont want to move up in the tree - tempMedia = opts.media.relations.edges.filter(edge => edge.relationType === 'PREQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))[0].node - } else if (opts.media.relations.edges.some(edge => edge.relationType === 'SEQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))) { - // media doesnt have prequel, or we want to move up in the tree - tempMedia = opts.media.relations.edges.filter(edge => edge.relationType === 'SEQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))[0].node - increment = true - } - if (tempMedia?.episodes && epMax - (opts.offset + tempMedia.episodes) > (media.nextAiringEpisode?.episode || media.episodes)) { - // episode is still out of bounds - const nextEdge = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_2__.alRequest)({ method: 'SearchIDSingle', id: tempMedia.id }) - await resolveSeason({ media: nextEdge.data.Media, episode: opts.episode, offset: opts.offset + nextEdge.data.Media.episodes, increment: increment }) - } else if (tempMedia?.episodes && epMax - (opts.offset + tempMedia.episodes) <= (media.nextAiringEpisode?.episode || media.episodes) && epMin - (opts.offset + tempMedia.episodes) > 0) { - // episode is in range, seems good! overwriting media to count up "seasons" - if (opts.episode.constructor === Array) { - episode = `${praseObj.episode_number[0] - (opts.offset + tempMedia.episodes)} ~ ${praseObj.episode_number[praseObj.episode_number.length - 1] - (opts.offset + tempMedia.episodes)}` - } else { - episode = opts.episode - (opts.offset + tempMedia.episodes) - } - if (opts.increment || increment) { - const nextEdge = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_2__.alRequest)({ method: 'SearchIDSingle', id: tempMedia.id }) - media = nextEdge.data.Media - } - } else { - console.log('error in parsing!', opts.media, tempMedia) - halfmoon__WEBPACK_IMPORTED_MODULE_5___default().initStickyAlert({ - content: `Failed resolving anime episode!
${opts.media.title.userPreferred} - ${epMax}`, - title: 'Parsing Error', - alertType: 'alert-secondary', - fillType: '' - }) - // something failed, most likely couldnt find an edge or processing failed, force episode number even if its invalid/out of bounds, better than nothing - if (opts.episode.constructor === Array) { - episode = `${Number(praseObj.episode_number[0])} ~ ${Number(praseObj.episode_number[praseObj.episode_number.length - 1])}` - } else { - episode = Number(opts.episode) - } - } - } - - // resolve episode, if movie, dont. - if ((media?.format !== 'MOVIE' || (media.episodes || media.nextAiringEpisode.episode)) && praseObj.episode_number) { - if (praseObj.episode_number.constructor === Array) { - // is an episode range - if (parseInt(praseObj.episode_number[0]) === 1) { - // if it starts with #1 and overflows then it includes more than 1 season in a batch, cant fix this cleanly, name is parsed per file basis so this shouldnt be an issue - episode = `${praseObj.episode_number[0]} ~ ${praseObj.episode_number[praseObj.episode_number.length - 1]}` - } else { - if ((media?.episodes || media?.nextAiringEpisode?.episode) && parseInt(praseObj.episode_number[praseObj.episode_number.length - 1]) > (media.episodes || media.nextAiringEpisode.episode)) { - // if highest value is bigger than episode count or latest streamed episode +1 for safety, parseint to math.floor a number like 12.5 - specials - in 1 go - await resolveSeason({ media: media, episode: praseObj.episode_number, offset: 0 }) - } else { - // cant find ep count or range seems fine - episode = `${Number(praseObj.episode_number[0])} ~ ${Number(praseObj.episode_number[praseObj.episode_number.length - 1])}` - } - } - } else { - if ((media?.episodes || media?.nextAiringEpisode?.episode) && parseInt(praseObj.episode_number) > (media.episodes || media.nextAiringEpisode.episode)) { - // value bigger than episode count - await resolveSeason({ media: media, episode: praseObj.episode_number, offset: 0 }) - } else { - // cant find ep count or episode seems fine - episode = Number(praseObj.episode_number) - } - } - } - const streamingEpisode = media?.streamingEpisodes.filter(episode => episodeRx.exec(episode.title) && Number(episodeRx.exec(episode.title)[1]) === Number(praseObj.episode_number))[0] - fileMedias.push({ - mediaTitle: media?.title.userPreferred, - episodeNumber: episode, - episodeTitle: streamingEpisode && episodeRx.exec(streamingEpisode.title)[2], - episodeThumbnail: streamingEpisode?.thumbnail, - mediaCover: media?.coverImage.medium, - name: 'Miru', - parseObject: praseObj, - media: media - }) - } - return fileMedias.length === 1 ? fileMedias[0] : fileMedias -} - -const relations = JSON.parse(localStorage.getItem('relations')) || {} - - -/***/ }), - -/***/ "./app/js/interface.js": -/*!*****************************!*\ - !*** ./app/js/interface.js ***! - \*****************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "loadHomePage": () => (/* binding */ loadHomePage), -/* harmony export */ "cardCreator": () => (/* binding */ cardCreator), -/* harmony export */ "viewMedia": () => (/* binding */ viewMedia), -/* harmony export */ "alID": () => (/* binding */ alID), -/* harmony export */ "initMenu": () => (/* binding */ initMenu) -/* harmony export */ }); -/* harmony import */ var _anilist_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./anilist.js */ "./app/js/anilist.js"); -/* harmony import */ var _anime_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./anime.js */ "./app/js/anime.js"); -/* harmony import */ var _rss_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./rss.js */ "./app/js/rss.js"); -/* harmony import */ var _settings_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./settings.js */ "./app/js/settings.js"); -/* harmony import */ var _main_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./main.js */ "./app/js/main.js"); -/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./util.js */ "./app/js/util.js"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! halfmoon */ "halfmoon"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_6___default = /*#__PURE__*/__webpack_require__.n(halfmoon__WEBPACK_IMPORTED_MODULE_6__); -/* global navHome, searchClear, searchWrapper, skeletonCardTemplate, bareCardTemplate, fullCardTemplate, home, searchText, searchGenre, searchYear, searchSeason, searchFormat, searchStatus, searchSort, navSchedule, homeContinueMore, homeReleasesMore, homePlanningMore, homeTrendingMore, homeRomanceMore, homeActionMore, homeContinue, homeReleases, homePlanning, homeTrending, homeRomance, homeAction */ - -// THIS IS WHY YOU FUCKING USE FRAMEWORKS - - - - - - - - -function loadHomePage () { - const homeLoadElements = [navSchedule, homeContinueMore, homeReleasesMore, homePlanningMore, homeTrendingMore, homeRomanceMore, homeActionMore] - const homePreviewElements = [homeContinue, homeReleases, homePlanning, homeTrending, homeRomance, homeAction] - const homeSearchElements = [searchText, searchGenre, searchYear, searchSeason, searchFormat, searchStatus, searchSort] - const browseGallery = document.querySelector('.browse') - const homeLoadFunctions = { - continue: async function (page) { - if (!page) gallerySkeleton(browseGallery) - const res = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'UserLists', status_in: 'CURRENT', id: alID, page: page || 1 }) - const mediaList = res.data.Page.mediaList.map(i => i.media).filter(media => { - return !(media.status === 'RELEASING' && media.mediaListEntry?.progress === media.nextAiringEpisode?.episode - 1) - }) - galleryAppend({ media: mediaList, gallery: browseGallery, method: 'continue', page: page || 1 }) - return res.data.Page.pageInfo.hasNextPage - }, - releases: async function () { - gallerySkeleton(browseGallery) - const cards = await releasesCards((await (0,_rss_js__WEBPACK_IMPORTED_MODULE_2__.getRSSContent)((0,_rss_js__WEBPACK_IMPORTED_MODULE_2__.getRSSurl)())).querySelectorAll('item')) - browseGallery.textContent = '' - browseGallery.append(...cards) - home.classList.remove('loading') - home.onscroll = undefined - return false - }, - planning: async function (page) { - if (!page) gallerySkeleton(browseGallery) - const res = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'UserLists', status_in: 'PLANNING', id: alID, page: page || 1 }) - const mediaList = res.data.Page.mediaList - galleryAppend({ media: mediaList.map(i => i.media), gallery: browseGallery, method: 'planning', page: page || 1 }) - return res.data.Page.pageInfo.hasNextPage - }, - trending: async function () { - gallerySkeleton(browseGallery) - clearSearch() - searchSort.value = 'TRENDING_DESC' - return await homeLoadFunctions.search() - }, - romance: async function () { - gallerySkeleton(browseGallery) - clearSearch() - searchGenre.value = 'romance' - searchSort.value = 'TRENDING_DESC' - return await homeLoadFunctions.search() - }, - action: async function () { - gallerySkeleton(browseGallery) - clearSearch() - searchGenre.value = 'action' - searchSort.value = 'TRENDING_DESC' - return await homeLoadFunctions.search() - }, - schedule: async function (page) { - if (!page) gallerySkeleton(browseGallery) - const res = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'AiringSchedule', page: page || 1 }) - const mediaList = res.data.Page.airingSchedules - galleryAppend({ media: mediaList.filter(entry => entry.media.countryOfOrigin !== 'CN' && entry.media.isAdult === false), gallery: browseGallery, method: 'schedule', page: page || 1, schedule: true }) - return res.data.Page.pageInfo.hasNextPage - }, - search: async function (page) { - const def = { - method: 'Search', - page: page || 1 - } - const opts = {} - Object.assign(opts, def) - for (const element of homeSearchElements) { - if (element.value) opts[element.dataset.option] = element.value - } - if (Object.keys(def).length !== Object.keys(opts).length) { - const res = await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)(opts) - const mediaList = res.data.Page.media - galleryAppend({ media: mediaList, gallery: browseGallery, method: 'search', page: page || 1 }) - return res.data.Page.pageInfo.hasNextPage - } else { - searchClear.classList.remove('text-primary') - home.classList.remove('loading') - reloadHome() - return false - } - } - } - const homePreviewFunctions = { - continue: function () { - ;(0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'UserLists', status_in: 'CURRENT', id: alID, perPage: 50 }).then(res => { - const mediaList = res.data.Page.mediaList.filter(({ media }) => { - return !(media.status === 'RELEASING' && media.mediaListEntry?.progress === media.nextAiringEpisode?.episode - 1) - }).slice(0, 5).map(i => i.media) - galleryAppend({ media: mediaList, gallery: homeContinue }) - }) - }, - releases: async function () { // this could be cleaner, but oh well - const doc = await (0,_rss_js__WEBPACK_IMPORTED_MODULE_2__.getRSSContent)((0,_rss_js__WEBPACK_IMPORTED_MODULE_2__.getRSSurl)()) - if (doc) { - const pubDate = doc.querySelector('pubDate').textContent - if (lastRSSDate !== pubDate) { - if (lastRSSDate) { - homeReleases.textContent = '' - homeReleases.append(...gallerySkeletonFrag(5)) - if (_settings_js__WEBPACK_IMPORTED_MODULE_3__.settings.other1) { - (0,_anime_js__WEBPACK_IMPORTED_MODULE_1__.resolveFileMedia)({ fileName: doc.querySelector('item title').textContent, isRelease: true }).then(mediaInformation => { - const notification = new Notification(mediaInformation.media.title.userPreferred, { - body: `Episode ${mediaInformation.episodeNumber} was just released!`, - icon: mediaInformation.media.coverImage.medium - }) - notification.onclick = async () => { - window.parent.focus() - _anime_js__WEBPACK_IMPORTED_MODULE_1__.relations[mediaInformation.parseObject.anime_title] = (await (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ id: mediaInformation.media.id, method: 'SearchIDSingle' })).data.Media.id - _main_js__WEBPACK_IMPORTED_MODULE_4__.client.playTorrent(doc.querySelector('item link').textContent, { media: mediaInformation, episode: mediaInformation.episode }) - } - }) - } - } - lastRSSDate = pubDate - const cards = await releasesCards(doc.querySelectorAll('item'), 5) - homeReleases.textContent = '' - homeReleases.append(...cards) - } - } - }, - planning: function () { - (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'UserLists', status_in: 'PLANNING', id: alID, perPage: 5 }).then(res => { - galleryAppend({ media: res.data.Page.mediaList.map(i => i.media), gallery: homePlanning }) - }) - }, - trending: function () { - (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'Search', id: alID, perPage: 5, sort: 'TRENDING_DESC' }).then(res => { - galleryAppend({ media: res.data.Page.media, gallery: homeTrending }) - }) - }, - romance: function () { - (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'Search', genre: 'Romance', perPage: 5, sort: 'TRENDING_DESC' }).then(res => { - galleryAppend({ media: res.data.Page.media, gallery: homeRomance }) - }) - }, - action: function () { - (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'Search', genre: 'Action', perPage: 5, sort: 'TRENDING_DESC' }).then(res => { - galleryAppend({ media: res.data.Page.media, gallery: homeAction }) - }) - } - } - const gallerySkeletonFrag = function (limit) { - const cards = [] - while (limit--) { - cards.push(skeletonCard.cloneNode(true)) - } - return cards - } - let loadTimeout - let lastDate - let lastRSSDate - let canScroll = true - - function gallerySkeleton (gallery) { - home.classList.add('loading') - gallery.textContent = '' - gallery.append(...gallerySkeletonFrag(10)) - } - function galleryAppend (opts) { - if (opts.page === 1) { - home.classList.remove('loading') - } - if (opts.method) { - canScroll = false - home.onscroll = function () { - if (this.scrollTop + this.clientHeight > this.scrollHeight - 800 && !loadTimeout && canScroll) { - canScroll = false - loadTimeout = setTimeout(function () { loadTimeout = undefined }, 1000) - homeLoadFunctions[opts.method](opts.page + 1).then((hasNextPage) => { canScroll = hasNextPage }) - } - } - } - if (!opts.page || opts.page === 1) { - opts.gallery.textContent = '' - } - const date = new Date() - const cards = [] - opts.media.forEach(media => { - if (opts.schedule) { - if (media.timeUntilAiring && (!lastDate || (new Date(+date + media.timeUntilAiring * 1000).getDay() !== lastDate.getDay()))) { - const div = document.createElement('div') - lastDate = new Date(+date + media.timeUntilAiring * 1000) - div.classList.add('day-row', 'font-size-24', 'font-weight-bold', 'h-50', 'd-flex', 'align-items-end') - div.textContent = lastDate.toLocaleDateString('en-US', { weekday: 'long' }) - cards.push(div) - } - media = media.media - } - cards.push(cardCreator({ media: media, schedule: opts.schedule, onclick: () => viewMedia(media) })) - }) - opts.gallery.append(...cards) - canScroll = true - } - - for (const item of homePreviewElements) { - homePreviewFunctions[item.dataset.function]() - } - setInterval(homePreviewFunctions.releases, 30000) - for (const item of homeLoadElements) { - item.onclick = function () { - home.scrollTop = 0 - home.classList.add('browsing') - searchClear.classList.add('text-primary') - homeLoadFunctions[item.dataset.function]() - } - } - function reloadHome () { - clearSearch() - searchClear.classList.remove('text-primary') - home.classList.remove('browsing') - lastRSSDate = undefined - home.onscroll = undefined - home.scrollTop = 0 - for (const item of homePreviewElements) { - item.textContent = '' - item.append(...gallerySkeletonFrag(5)) - homePreviewFunctions[item.dataset.function]() - } - document.querySelector('.browse').textContent = '' - } - navHome.onclick = reloadHome - searchClear.onclick = reloadHome - function clearSearch () { - for (const element of homeSearchElements) { - element.value = '' - } - } - let searchTimeout - searchWrapper.oninput = () => { - if (!searchTimeout) { - home.classList.add('browsing') - gallerySkeleton(browseGallery) - home.scrollTop = 0 - } else { - clearTimeout(searchTimeout) - } - searchClear.classList.add('text-primary') - searchTimeout = setTimeout(() => { - homeLoadFunctions.search() - searchTimeout = undefined - }, 500) - } -} - -const skeletonCard = skeletonCardTemplate.cloneNode(true).content -const bareCard = bareCardTemplate.cloneNode(true).content -const fullCard = fullCardTemplate.cloneNode(true).content -function cardCreator (opts) { - if (opts.media) { - const card = fullCard.cloneNode(true) - const nodes = card.querySelectorAll('*') - nodes[0].onclick = opts.onclick - nodes[0].style = `--color:${opts.media.coverImage.color || '#1890ff'};` - nodes[3].src = opts.media.coverImage.extraLarge || '' - nodes[6].textContent = [opts.media.title.userPreferred, opts.episodeNumber].filter(s => s).join(' - ') - if (opts.schedule && opts.media.nextAiringEpisode) nodes[7].textContent = 'EP ' + opts.media.nextAiringEpisode.episode + ' in ' + (0,_util_js__WEBPACK_IMPORTED_MODULE_5__.countdown)(opts.media.nextAiringEpisode.timeUntilAiring) - nodes[8].innerHTML = '' + [ - opts.media.format === 'TV' ? 'TV Show' : opts.media.format?.toLowerCase().replace(/_/g, ' '), - opts.media.episodes ? opts.media.episodes + ' Episodes' : opts.media.duration ? opts.media.duration + ' Minutes' : undefined, - opts.media.status?.toLowerCase().replace(/_/g, ' '), - [opts.media.season?.toLowerCase(), opts.media.seasonYear].filter(s => s).join(' ') - ].filter(s => s).join('') + '' - nodes[13].innerHTML = opts.media.description - nodes[14].innerHTML = opts.media.genres.map(key => (`${key} `)).join('') - return card - } else if (opts.parseObject) { - const card = bareCard.cloneNode(true) - card.querySelector('h5').textContent = [opts.parseObject.anime_title, opts.parseObject.episode_number].filter(s => s).join(' - ') - card.firstElementChild.onclick = opts.onclick - return card - } - return skeletonCard.cloneNode(true) -} - -async function releasesCards (items, limit) { - const cards = [] - const media = await (0,_anime_js__WEBPACK_IMPORTED_MODULE_1__.resolveFileMedia)({ fileName: [...items].map(item => item.querySelector('title').textContent).slice(0, limit), isRelease: true }) - media.forEach((mediaInformation, index) => { - mediaInformation.onclick = () => _main_js__WEBPACK_IMPORTED_MODULE_4__.client.playTorrent(items[index].querySelector('link').textContent, { media: mediaInformation, episode: mediaInformation.episode }) - cards.push(cardCreator(mediaInformation)) - }) - localStorage.setItem('relations', JSON.stringify(_anime_js__WEBPACK_IMPORTED_MODULE_1__.relations)) - return cards -} -const genreBadge = document.createElement('span') -genreBadge.classList.add('badge', 'badge-pill', 'shadow') - -function genreBadges (genres = []) { - const badges = [] - for (const genre of genres) { - const badge = genreBadge.cloneNode(true) - badge.textContent = genre - badges.push(badge) - } - return badges -} -const detailsMap = [ - { property: 'genres', label: 'Genres', icon: 'theater_comedy' }, - { property: 'season', label: 'Season', icon: 'spa', custom: 'property' }, - { property: 'episodes', label: 'Episodes', icon: 'theaters', custom: 'property' }, - { property: 'duration', label: 'Duration', icon: 'timer' }, - { property: 'format', label: 'Format', icon: 'monitor' }, - { property: 'status', label: 'Status', icon: 'live_tv' }, - { property: 'nodes', label: 'Studio', icon: 'business' }, - { property: 'source', label: 'Source', icon: 'source' }, - { property: 'averageScore', label: 'Rating', icon: 'trending_up', custom: 'property' }, - { property: 'english', label: 'English', icon: 'title' }, - { property: 'romaji', label: 'Romaji', icon: 'translate' }, - { property: 'native', label: 'Native', icon: '日本', custom: 'icon' } -] -/* global detailTemplate */ -const detailTemp = detailTemplate.cloneNode(true).content -function mediaDetails (media) { - const details = [] - for (const detail of detailsMap) { - if (media[detail.property]) { - const clone = detailTemp.cloneNode(true) - const nodes = clone.querySelectorAll('*') - switch (media[detail.property].constructor) { - case String: { - nodes[4].textContent = media[detail.property].replace(/_/g, ' ').toLowerCase() - break - } - case Number: { - nodes[4].textContent = media[detail.property] - break - } - case Array: { - if (detail.property === 'nodes') { - nodes[4].textContent = media[detail.property][0] && media[detail.property][0].name - } else { - nodes[4].textContent = media[detail.property].join(', ').replace(/_/g, ' ').toLowerCase() - } - } - } - nodes[1].textContent = detail.icon - nodes[3].textContent = detail.label - switch (detail.custom) { - case 'icon': { - nodes[1].classList.remove('material-icons', 'font-size-24') - nodes[1].classList.add('d-flex', 'align-items-center', 'text-nowrap', 'font-size-12', 'font-weight-bold') - break - } - case 'property': { - if (detail.property === 'episodes' && media.progress) { - nodes[4].innerHTML = `Watched ${media.progress} of ${media.episodes}` - } else if (detail.property === 'averageScore') { - nodes[4].textContent = media.averageScore + '%' - } else if (detail.property === 'season') { - nodes[4].textContent = [media.season?.toLowerCase(), media.seasonYear].filter(f => f).join(' ') - } else { - nodes[4].textContent = media[detail.property] - } - } - } - details.push(clone) - } - } - return details -} - -function trailerPopup (trailer) { - trailerVideo.src = '' - halfmoon__WEBPACK_IMPORTED_MODULE_6___default().toggleModal('trailer') - switch (trailer.site) { // should support the other possible sites too, but i cant find any examples - case 'youtube': - trailerVideo.src = 'https://www.youtube.com/embed/' + trailer.id - break - } -} -trailerClose.onclick = () => { - trailerVideo.src = '' -} - -navNowPlaying.onclick = () => { if (_main_js__WEBPACK_IMPORTED_MODULE_4__.client.nowPlaying.media) viewMedia(_main_js__WEBPACK_IMPORTED_MODULE_4__.client.nowPlaying.media) } -/* global trailerVideo, viewAnime, trailerClose, navNowPlaying */ -const viewNodes = viewAnime.querySelectorAll('*') -function viewMedia (input, episode) { - halfmoon__WEBPACK_IMPORTED_MODULE_6___default().showModal('viewAnime') - const media = (0,_util_js__WEBPACK_IMPORTED_MODULE_5__.flattenObj)(input) - viewNodes[9].src = media.extraLarge || media.medium - viewNodes[13].textContent = media.userPreferred - viewNodes[17].textContent = media.averageScore + '%' - viewNodes[20].textContent = media.format === 'TV' ? media.format : media.format?.toLowerCase() - if (media.episodes === 1 || (!media.episodes && !media.episode)) { - viewNodes[14].classList.add('movie') - viewNodes[31].classList.add('movie') - viewNodes[28].textContent = media.duration + ' min' - } else { - viewNodes[31].classList.remove('movie') - viewNodes[14].classList.remove('movie') - viewNodes[24].textContent = media.episodes - } - viewNodes[29].textContent = '' - viewNodes[29].append(...genreBadges(media.genres)) - - if (media.episodes || media.episode) { - viewNodes[31].classList.remove('hidden') - viewNodes[33].onclick = () => { ;(0,_anime_js__WEBPACK_IMPORTED_MODULE_1__.nyaaSearch)(input, Number(viewNodes[44].value) || 1); halfmoon__WEBPACK_IMPORTED_MODULE_6___default().hideModal('viewAnime') } - viewNodes[44].value = episode || Math.min(Number(media.progress) + 1 || 1, media.episodes) - viewNodes[35].textContent = media.progress && media.progress !== media.episodes ? 'Continue' : 'Play' - - viewNodes[46].onclick = () => { ;(0,_anime_js__WEBPACK_IMPORTED_MODULE_1__.nyaaSearch)(input, Number(viewNodes[56].value) || 1, true); halfmoon__WEBPACK_IMPORTED_MODULE_6___default().hideModal('viewAnime') } - viewNodes[56].value = episode || Math.min(Number(media.progress) + 1 || 1, media.episodes) - } else { - viewNodes[31].classList.add('hidden') - } - if (media.bannerImage) { - viewNodes[4].style = `background-image: linear-gradient(0deg, rgba(17,20,23,1) 0%, rgba(17,20,23,0.80) 25%, rgba(17,20,23,0.40) 50%, rgba(37,40,44,0) 100%), url('${media.bannerImage}') !important` - } else { - viewNodes[4].style = 'background-image: linear-gradient(0deg, rgba(17,20,23,1) 0%, rgba(17,20,23,0.80) 25%, rgba(17,20,23,0.40) 50%, rgba(37,40,44,0) 100%) !important' - } - - viewNodes[57].onclick = () => trailerPopup(input.trailer) - - viewNodes[63].innerHTML = media.description - - viewNodes[68].textContent = '' - viewNodes[68].append(...mediaDetails(media)) -} - -let alID // login icon -/* global oauth */ -function initMenu () { - if (localStorage.getItem('ALtoken')) { - (0,_anilist_js__WEBPACK_IMPORTED_MODULE_0__.alRequest)({ method: 'Viewer' }).then(result => { - oauth.removeAttribute('href') - oauth.setAttribute('data-title', `${result.data.Viewer.name}\nClick To Logout`) - oauth.innerHTML = ` - - - ${result.data.Viewer.name} - logout - ` - oauth.onclick = () => { - localStorage.removeItem('ALtoken') - location.reload() - } - alID = result.data.Viewer.id - loadHomePage() - }) - } else { - loadHomePage() - home.classList.add('noauth') - } -} - - -/***/ }), - -/***/ "./app/js/main.js": -/*!************************!*\ - !*** ./app/js/main.js ***! - \************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "client": () => (/* binding */ client) -/* harmony export */ }); -/* harmony import */ var webtorrent_player__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! webtorrent-player */ "./node_modules/webtorrent-player/index.js"); -/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./util.js */ "./app/js/util.js"); -/* harmony import */ var _anime_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./anime.js */ "./app/js/anime.js"); -/* harmony import */ var _anilist_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./anilist.js */ "./app/js/anilist.js"); -/* harmony import */ var _settings_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./settings.js */ "./app/js/settings.js"); -/* harmony import */ var _interface_js__WEBPACK_IMPORTED_MODULE_5__ = __webpack_require__(/*! ./interface.js */ "./app/js/interface.js"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_6__ = __webpack_require__(/*! halfmoon */ "halfmoon"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_6___default = /*#__PURE__*/__webpack_require__.n(halfmoon__WEBPACK_IMPORTED_MODULE_6__); -/* globals video, player, pageWrapper, subtitle1list */ - - - - - - - - - -const playerControls = {} -for (const item of document.getElementsByClassName('ctrl')) { - if (!playerControls[item.dataset.name]) { - playerControls[item.dataset.name] = item - } else { - playerControls[item.dataset.name] = [playerControls[item.dataset.name], item] - } -} -const client = new webtorrent_player__WEBPACK_IMPORTED_MODULE_0__.default({ - WebTorrentOpts: { - maxConns: 127, - downloadLimit: _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.torrent7 * 1048576, - uploadLimit: _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.torrent7 * 1572864, - tracker: { - announce: _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.torrent10.split('\n') - } - }, - controls: playerControls, - video: video, - player: player, - destroyStore: true, - playerWrapper: pageWrapper, - burnIn: _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.subtitle3, - seekTime: Number(_settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.player3), - immerseTime: Number(_settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.player2), - visibilityLossPause: _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.player10, - autoNext: _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.player6, - streamedDownload: _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.torrent8, - generateThumbnails: _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.player5, - defaultSSAStyles: Object.values(subtitle1list.options).filter(item => item.value === _settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.subtitle1)[0].textContent, - resolveFileMedia: _anime_js__WEBPACK_IMPORTED_MODULE_2__.resolveFileMedia -}) -client.on('download-done', ({ file }) => { - halfmoon__WEBPACK_IMPORTED_MODULE_6___default().initStickyAlert({ - content: `${file.name} has finished downloading. Now seeding.`, - title: 'Download Complete', - alertType: 'alert-success', - fillType: '' - }) -}) -client.on('watched', ({ filemedia }) => { - if (filemedia?.media?.episodes || filemedia?.media?.nextAiringEpisode?.episode) { - if (_settings_js__WEBPACK_IMPORTED_MODULE_4__.settings.other2 && (filemedia.media.episodes || filemedia.media.nextAiringEpisode?.episode > filemedia.episodeNumber)) { - (0,_anilist_js__WEBPACK_IMPORTED_MODULE_3__.alEntry)(filemedia) - } - // halfmoon.initStickyAlert({ - // content: `Do You Want To Mark
${filemedia.mediaTitle}
Episode ${filemedia.episodeNumber} As Completed?
- // - // `, - // title: 'Episode Complete', - // timeShown: 180000 - // }) - // } - } -}) -client.on('playlist', () => { - window.location.hash = '#playlist' -}) -client.on('next', ({ filemedia }) => { - if (filemedia.media) { - (0,_anime_js__WEBPACK_IMPORTED_MODULE_2__.nyaaSearch)(filemedia.media, parseInt(filemedia.episodeNumber) + 1) - } else { - halfmoon__WEBPACK_IMPORTED_MODULE_6___default().initStickyAlert({ - content: 'Couldn\'t find anime name! Try specifying a torrent manually.', - title: 'Search Failed', - alertType: 'alert-danger', - fillType: '' - }) - } -}) -client.on('prev', ({ filemedia }) => { - if (filemedia.media) { - (0,_anime_js__WEBPACK_IMPORTED_MODULE_2__.nyaaSearch)(filemedia.media, filemedia.episodeNumber - 1) - } else { - halfmoon__WEBPACK_IMPORTED_MODULE_6___default().initStickyAlert({ - content: 'Couldn\'t find anime name! Try specifying a torrent manually.', - title: 'Search Failed', - alertType: 'alert-danger', - fillType: '' - }) - } -}) -client.on('offline-torrent', torrent => { - ;(0,_anime_js__WEBPACK_IMPORTED_MODULE_2__.resolveFileMedia)({ fileName: torrent.name }).then(mediaInformation => { - mediaInformation.onclick = () => client.playTorrent(torrent, { media: mediaInformation, episode: mediaInformation.episode }) - const template = (0,_interface_js__WEBPACK_IMPORTED_MODULE_5__.cardCreator)(mediaInformation) - document.querySelector('.downloads').appendChild(template) - }) -}) -client.on('video-files', async ({ files, torrent }) => { - document.querySelector('.playlist').textContent = '' - const cards = [] - for (const file of files) { - const mediaInformation = await (0,_anime_js__WEBPACK_IMPORTED_MODULE_2__.resolveFileMedia)({ fileName: file.name }) - mediaInformation.onclick = () => { - client.buildVideo(torrent, { - media: mediaInformation, - episode: mediaInformation.parseObject.episode, - file: file - }) - } - cards.push((0,_interface_js__WEBPACK_IMPORTED_MODULE_5__.cardCreator)(mediaInformation)) - } - document.querySelector('.playlist').append(...cards) -}) -client.on('no-files', torrent => { - halfmoon__WEBPACK_IMPORTED_MODULE_6___default().initStickyAlert({ - content: `Couldn't find video file for ${torrent.infoHash}!`, - title: 'Search Failed', - alertType: 'alert-danger', - fillType: '' - }) -}) -client.on('no peers', torrent => { - if (torrent.progress !== 1) { - halfmoon__WEBPACK_IMPORTED_MODULE_6___default().initStickyAlert({ - content: `Couldn't find peers for ${torrent.infoHash}! Try a torrent with more seeders.`, - title: 'Search Failed', - alertType: 'alert-danger', - fillType: '' - }) - } -}) -client.nowPlaying = { name: 'Miru' } - -window.client = client - -window.onbeforeunload = () => { return '' } - -if (_util_js__WEBPACK_IMPORTED_MODULE_1__.searchParams.get('file')) client.playTorrent(_util_js__WEBPACK_IMPORTED_MODULE_1__.searchParams.get('file')) - -queueMicrotask(_interface_js__WEBPACK_IMPORTED_MODULE_5__.initMenu) - - -/***/ }), - -/***/ "./app/js/rss.js": -/*!***********************!*\ - !*** ./app/js/rss.js ***! - \***********************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "getRSSContent": () => (/* binding */ getRSSContent), -/* harmony export */ "nyaaRss": () => (/* binding */ nyaaRss), -/* harmony export */ "getRSSurl": () => (/* binding */ getRSSurl) -/* harmony export */ }); -/* harmony import */ var _settings_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./settings.js */ "./app/js/settings.js"); -/* harmony import */ var _util_js__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! ./util.js */ "./app/js/util.js"); -/* harmony import */ var _main_js__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! ./main.js */ "./app/js/main.js"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! halfmoon */ "halfmoon"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(halfmoon__WEBPACK_IMPORTED_MODULE_3__); -/* harmony import */ var _anime_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./anime.js */ "./app/js/anime.js"); -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -/* global torrent4list */ - - - - - - - -const exclusions = { - edge: ['DTS'], - chromium: ['DTS', 'AC3', 'HEVC', 'x265', 'H.265'], - firefox: ['DTS', 'AC3', 'HEVC', 'x265', 'H.265', '.3gp', '.mkv'] -} -if (!('audioTracks' in HTMLVideoElement.prototype)) { - exclusions[_util_js__WEBPACK_IMPORTED_MODULE_1__.userBrowser].push('mutli audio', 'dual audio') -} - -function getRSSContent (url) { - return fetch(url).then(res => { - if (res.ok) { - return res.text().then(xmlTxt => { - return (0,_util_js__WEBPACK_IMPORTED_MODULE_1__.DOMPARSER)(xmlTxt, 'text/xml') - }) - } - throw Error(res.statusText) - }).catch(error => { - halfmoon__WEBPACK_IMPORTED_MODULE_3___default().initStickyAlert({ - content: 'Failed fetching RSS!
' + error, - title: 'Search Failed', - alertType: 'alert-danger', - fillType: '' - }) - console.error(error) - }) -} - -async function nyaaRss (media, episode, isOffline) { - const frag = document.createDocumentFragment() - const titles = [...new Set(Object.values(media.title).concat(media.synonyms).filter(name => name != null))].join(')|(').replace(/&/g, '%26') - const ep = (media.episodes !== 1 && ((media.status === 'FINISHED' && _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent9) ? `"01-${media.episodes}"|"01~${media.episodes}"|"Batch"|"Complete"|"+${episode}+"|"+${episode}v"|"S01"` : `"+${episode}+"|"+${episode}v"`)) || '' - const excl = exclusions[_util_js__WEBPACK_IMPORTED_MODULE_1__.userBrowser].join('|') - const quality = `"${_settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent1}"` || '"1080p"' - const trusted = _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent3 === true ? 2 : 0 - const url = new URL(`https://meowinjapanese.cf/?page=rss&c=1_2&f=${trusted}&s=seeders&o=desc&q=(${titles})${ep}${quality}-(${excl})`) - - const nodes = (await getRSSContent(url)).querySelectorAll('item *') - if (!nodes.length) return frag - const entries = [] - for (let index = Math.floor(nodes.length / 15); index--;) { - const position = index * 15 - entries[index] = { - title: nodes[position].textContent, - hash: nodes[position + 1].textContent, - seeders: nodes[position + 4].textContent, - leechers: nodes[position + 5].textContent, - downloads: nodes[position + 6].textContent, - size: nodes[position + 10].textContent - } - } - entries.sort((a, b) => b.seeders - a.seeders) - const streamingEpisode = media?.streamingEpisodes.filter(episode => _anime_js__WEBPACK_IMPORTED_MODULE_4__.episodeRx.exec(episode.title) && Number(_anime_js__WEBPACK_IMPORTED_MODULE_4__.episodeRx.exec(episode.title)[1]) === Number(episode))[0] - const fileMedia = { - mediaTitle: media?.title.userPreferred, - episodeNumber: Number(episode), - episodeTitle: streamingEpisode ? _anime_js__WEBPACK_IMPORTED_MODULE_4__.episodeRx.exec(streamingEpisode.title)[2] : undefined, - episodeThumbnail: streamingEpisode?.thumbnail, - mediaCover: media?.coverImage.medium, - name: 'Miru', - media: media - } - if (_settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent2) { - if (isOffline) { - _main_js__WEBPACK_IMPORTED_MODULE_2__.client.offlineDownload(entries[0].hash) - } else { - _main_js__WEBPACK_IMPORTED_MODULE_2__.client.playTorrent(entries[0].hash, { media: fileMedia, episode: episode }) - } - halfmoon__WEBPACK_IMPORTED_MODULE_3___default().toggleModal('tsearch') - } - entries.forEach((entry, index) => { - const template = document.createElement('tr') - template.innerHTML += ` -${(index + 1)} -${entry.title} -${entry.size} -${entry.seeders} -${entry.leechers} -${entry.downloads} -Play` - template.onclick = () => { - if (isOffline) { - _main_js__WEBPACK_IMPORTED_MODULE_2__.client.offlineDownload(entry.hash) - } else { - _main_js__WEBPACK_IMPORTED_MODULE_2__.client.playTorrent(entry.hash, { media: fileMedia, episode: episode }) - } - halfmoon__WEBPACK_IMPORTED_MODULE_3___default().hideModal('tsearch') - } - frag.appendChild(template) - }) - return frag -} - -function getRSSurl () { - if (Object.values(torrent4list.options).filter(item => item.value === _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent4)[0]) { - return _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent4 === 'Erai-raws' ? new URL(Object.values(torrent4list.options).filter(item => item.value === _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent4)[0].innerHTML + _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent1 + '-magnet') : new URL(Object.values(torrent4list.options).filter(item => item.value === _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent4)[0].innerHTML + _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent1) - } else { - return _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent4 + _settings_js__WEBPACK_IMPORTED_MODULE_0__.settings.torrent1 // add custom RSS - } -} - - -/***/ }), - -/***/ "./app/js/settings.js": -/*!****************************!*\ - !*** ./app/js/settings.js ***! - \****************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "settingsElements": () => (/* binding */ settingsElements), -/* harmony export */ "settings": () => (/* binding */ settings) -/* harmony export */ }); -/* harmony import */ var idb_keyval__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! idb-keyval */ "./node_modules/idb-keyval/dist/esm/index.js"); -/* global volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent5, torrent5label, torrent7, torrent8, torrent9, torrent10, other1, other2, setRes, settingsTab, regProtButton, clearRelCache */ - -const settingsElements = [ - volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent7, torrent8, torrent9, torrent10, other1, other2 -] -setRes.addEventListener('click', restoreDefaults) -settingsTab.addEventListener('click', applySettingsTimeout) -volume.addEventListener('click', applySettingsTimeout) -regProtButton.addEventListener('click', registerProtocol) -const settings = JSON.parse(localStorage.getItem('settings')) || {} - -let customStore - -if ('showDirectoryPicker' in window) { - customStore = (0,idb_keyval__WEBPACK_IMPORTED_MODULE_0__.createStore)('handle-store', 'handles') - settings.torrent5 = (0,idb_keyval__WEBPACK_IMPORTED_MODULE_0__.get)('directory', customStore).then(handle => { - if (handle) { - torrent5label.value = 'Folder: ' + handle.name - return handle - } - return null - }) - torrent5.classList.remove('d-none') - torrent5.onclick = async () => { - const handle = await window.showDirectoryPicker() - await handle.requestPermission({ mode: 'readwrite' }) - settings.torrent5 = handle - torrent5label.value = 'Folder: ' + handle.name || 0 - } -} - -async function saveSettings () { - for (const element of settingsElements) { - settings[element.id] = element.type === 'checkbox' ? element.checked : element.value - } - localStorage.setItem('settings', JSON.stringify(settings)) - if ('showDirectoryPicker' in window) { - if (settings.torrent5) (0,idb_keyval__WEBPACK_IMPORTED_MODULE_0__.set)('directory', await settings.torrent5, customStore) - } -} - -if (Object.keys(settings).length !== settingsElements.length + 1) { - saveSettings() -} - -let applyTimeout -function applySettingsTimeout () { - clearTimeout(applyTimeout) - applyTimeout = setTimeout(saveSettings, 500) -} - -function registerProtocol () { - if ('registerProtocolHandler' in navigator) { - navigator.registerProtocolHandler( - 'magnet', - `${location.href.replace(location.hash, '')}#home&file=%s`, - 'Miru' - ) - } -} - -function restoreDefaults () { - localStorage.removeItem('settings') - location.reload() -} - -clearRelCache.onclick = () => { - localStorage.removeItem('relations') - location.reload() -} - -for (const setting of Object.entries(settings)) { - const settingElement = settingsElements.filter(e => e.id === setting[0])[0] - if (settingElement) settingElement.type === 'checkbox' ? settingElement.checked = setting[1] : settingElement.value = setting[1] -} - -other1.oninput = () => other1.checked && Notification.requestPermission().then(perm => { perm === 'denied' ? other1.checked = false : other1.checked = true }) - - -/***/ }), - -/***/ "./app/js/util.js": -/*!************************!*\ - !*** ./app/js/util.js ***! - \************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "searchParams": () => (/* binding */ searchParams), -/* harmony export */ "userBrowser": () => (/* binding */ userBrowser), -/* harmony export */ "countdown": () => (/* binding */ countdown), -/* harmony export */ "flattenObj": () => (/* binding */ flattenObj), -/* harmony export */ "DOMPARSER": () => (/* binding */ DOMPARSER) -/* harmony export */ }); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! halfmoon */ "halfmoon"); -/* harmony import */ var halfmoon__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(halfmoon__WEBPACK_IMPORTED_MODULE_0__); - -;(halfmoon__WEBPACK_IMPORTED_MODULE_0___default().showModal) = id => { - const t = document.getElementById(id) - t && t.classList.add('show') -} -;(halfmoon__WEBPACK_IMPORTED_MODULE_0___default().hideModal) = id => { - const t = document.getElementById(id) - t && t.classList.remove('show') -} -const searchParams = new URLSearchParams(location.href) -if (searchParams.get('access_token')) { - localStorage.setItem('ALtoken', searchParams.get('access_token')) - window.location = '/app/#home' -} -const userBrowser = (() => { - if (window.chrome) { - return (navigator.userAgent.indexOf('Edg') !== -1) ? 'edge' : 'chromium' - } - return 'firefox' -})() -function countdown (s) { - const d = Math.floor(s / (3600 * 24)) - s -= d * 3600 * 24 - const h = Math.floor(s / 3600) - s -= h * 3600 - const m = Math.floor(s / 60) - s -= m * 60 - const tmp = [] - if (d) tmp.push(d + 'd') - if (d || h) tmp.push(h + 'h') - if (d || h || m) tmp.push(m + 'm') - return tmp.join(' ') -} - -function flattenObj (obj) { - const result = {} - - for (const key in obj) { - if (obj[key] && obj[key].constructor === Object) { - const childObj = flattenObj(obj[key]) - - for (const childObjKey in childObj) { - result[childObjKey] = childObj[childObjKey] - } - } else { - result[key] = obj[key] - } - } - return result -} - -const DOMPARSER = new DOMParser().parseFromString.bind(new DOMParser()) - - -/***/ }), - -/***/ "./node_modules/addr-to-ip-port/index.js": -/*!***********************************************!*\ - !*** ./node_modules/addr-to-ip-port/index.js ***! - \***********************************************/ -/***/ ((module) => { - -const ADDR_RE = /^\[?([^\]]+)]?:(\d+)$/ // ipv4/ipv6/hostname + port - -let cache = new Map() - -// reset cache when it gets to 100,000 elements (~ 600KB of ipv4 addresses) -// so it will not grow to consume all memory in long-running processes -module.exports = function addrToIPPort (addr) { - if (cache.size === 100000) cache.clear() - if (!cache.has(addr)) { - const m = ADDR_RE.exec(addr) - if (!m) throw new Error(`invalid addr: ${addr}`) - cache.set(addr, [ m[1], Number(m[2]) ]) - } - return cache.get(addr) -} - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1.js": -/*!******************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1.js ***! - \******************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -const asn1 = exports; - -asn1.bignum = __webpack_require__(/*! bn.js */ "./node_modules/asn1.js/node_modules/bn.js/lib/bn.js"); - -asn1.define = __webpack_require__(/*! ./asn1/api */ "./node_modules/asn1.js/lib/asn1/api.js").define; -asn1.base = __webpack_require__(/*! ./asn1/base */ "./node_modules/asn1.js/lib/asn1/base/index.js"); -asn1.constants = __webpack_require__(/*! ./asn1/constants */ "./node_modules/asn1.js/lib/asn1/constants/index.js"); -asn1.decoders = __webpack_require__(/*! ./asn1/decoders */ "./node_modules/asn1.js/lib/asn1/decoders/index.js"); -asn1.encoders = __webpack_require__(/*! ./asn1/encoders */ "./node_modules/asn1.js/lib/asn1/encoders/index.js"); - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/api.js": -/*!**********************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/api.js ***! - \**********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -const encoders = __webpack_require__(/*! ./encoders */ "./node_modules/asn1.js/lib/asn1/encoders/index.js"); -const decoders = __webpack_require__(/*! ./decoders */ "./node_modules/asn1.js/lib/asn1/decoders/index.js"); -const inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -const api = exports; - -api.define = function define(name, body) { - return new Entity(name, body); -}; - -function Entity(name, body) { - this.name = name; - this.body = body; - - this.decoders = {}; - this.encoders = {}; -} - -Entity.prototype._createNamed = function createNamed(Base) { - const name = this.name; - - function Generated(entity) { - this._initNamed(entity, name); - } - inherits(Generated, Base); - Generated.prototype._initNamed = function _initNamed(entity, name) { - Base.call(this, entity, name); - }; - - return new Generated(this); -}; - -Entity.prototype._getDecoder = function _getDecoder(enc) { - enc = enc || 'der'; - // Lazily create decoder - if (!this.decoders.hasOwnProperty(enc)) - this.decoders[enc] = this._createNamed(decoders[enc]); - return this.decoders[enc]; -}; - -Entity.prototype.decode = function decode(data, enc, options) { - return this._getDecoder(enc).decode(data, options); -}; - -Entity.prototype._getEncoder = function _getEncoder(enc) { - enc = enc || 'der'; - // Lazily create encoder - if (!this.encoders.hasOwnProperty(enc)) - this.encoders[enc] = this._createNamed(encoders[enc]); - return this.encoders[enc]; -}; - -Entity.prototype.encode = function encode(data, enc, /* internal */ reporter) { - return this._getEncoder(enc).encode(data, reporter); -}; - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/base/buffer.js": -/*!******************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/base/buffer.js ***! - \******************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -const inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); -const Reporter = __webpack_require__(/*! ../base/reporter */ "./node_modules/asn1.js/lib/asn1/base/reporter.js").Reporter; -const Buffer = __webpack_require__(/*! safer-buffer */ "./node_modules/safer-buffer/safer.js").Buffer; - -function DecoderBuffer(base, options) { - Reporter.call(this, options); - if (!Buffer.isBuffer(base)) { - this.error('Input not Buffer'); - return; - } - - this.base = base; - this.offset = 0; - this.length = base.length; -} -inherits(DecoderBuffer, Reporter); -exports.DecoderBuffer = DecoderBuffer; - -DecoderBuffer.isDecoderBuffer = function isDecoderBuffer(data) { - if (data instanceof DecoderBuffer) { - return true; - } - - // Or accept compatible API - const isCompatible = typeof data === 'object' && - Buffer.isBuffer(data.base) && - data.constructor.name === 'DecoderBuffer' && - typeof data.offset === 'number' && - typeof data.length === 'number' && - typeof data.save === 'function' && - typeof data.restore === 'function' && - typeof data.isEmpty === 'function' && - typeof data.readUInt8 === 'function' && - typeof data.skip === 'function' && - typeof data.raw === 'function'; - - return isCompatible; -}; - -DecoderBuffer.prototype.save = function save() { - return { offset: this.offset, reporter: Reporter.prototype.save.call(this) }; -}; - -DecoderBuffer.prototype.restore = function restore(save) { - // Return skipped data - const res = new DecoderBuffer(this.base); - res.offset = save.offset; - res.length = this.offset; - - this.offset = save.offset; - Reporter.prototype.restore.call(this, save.reporter); - - return res; -}; - -DecoderBuffer.prototype.isEmpty = function isEmpty() { - return this.offset === this.length; -}; - -DecoderBuffer.prototype.readUInt8 = function readUInt8(fail) { - if (this.offset + 1 <= this.length) - return this.base.readUInt8(this.offset++, true); - else - return this.error(fail || 'DecoderBuffer overrun'); -}; - -DecoderBuffer.prototype.skip = function skip(bytes, fail) { - if (!(this.offset + bytes <= this.length)) - return this.error(fail || 'DecoderBuffer overrun'); - - const res = new DecoderBuffer(this.base); - - // Share reporter state - res._reporterState = this._reporterState; - - res.offset = this.offset; - res.length = this.offset + bytes; - this.offset += bytes; - return res; -}; - -DecoderBuffer.prototype.raw = function raw(save) { - return this.base.slice(save ? save.offset : this.offset, this.length); -}; - -function EncoderBuffer(value, reporter) { - if (Array.isArray(value)) { - this.length = 0; - this.value = value.map(function(item) { - if (!EncoderBuffer.isEncoderBuffer(item)) - item = new EncoderBuffer(item, reporter); - this.length += item.length; - return item; - }, this); - } else if (typeof value === 'number') { - if (!(0 <= value && value <= 0xff)) - return reporter.error('non-byte EncoderBuffer value'); - this.value = value; - this.length = 1; - } else if (typeof value === 'string') { - this.value = value; - this.length = Buffer.byteLength(value); - } else if (Buffer.isBuffer(value)) { - this.value = value; - this.length = value.length; - } else { - return reporter.error('Unsupported type: ' + typeof value); - } -} -exports.EncoderBuffer = EncoderBuffer; - -EncoderBuffer.isEncoderBuffer = function isEncoderBuffer(data) { - if (data instanceof EncoderBuffer) { - return true; - } - - // Or accept compatible API - const isCompatible = typeof data === 'object' && - data.constructor.name === 'EncoderBuffer' && - typeof data.length === 'number' && - typeof data.join === 'function'; - - return isCompatible; -}; - -EncoderBuffer.prototype.join = function join(out, offset) { - if (!out) - out = Buffer.alloc(this.length); - if (!offset) - offset = 0; - - if (this.length === 0) - return out; - - if (Array.isArray(this.value)) { - this.value.forEach(function(item) { - item.join(out, offset); - offset += item.length; - }); - } else { - 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); - offset += this.length; - } - - return out; -}; - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/base/index.js": -/*!*****************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/base/index.js ***! - \*****************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -const base = exports; - -base.Reporter = __webpack_require__(/*! ./reporter */ "./node_modules/asn1.js/lib/asn1/base/reporter.js").Reporter; -base.DecoderBuffer = __webpack_require__(/*! ./buffer */ "./node_modules/asn1.js/lib/asn1/base/buffer.js").DecoderBuffer; -base.EncoderBuffer = __webpack_require__(/*! ./buffer */ "./node_modules/asn1.js/lib/asn1/base/buffer.js").EncoderBuffer; -base.Node = __webpack_require__(/*! ./node */ "./node_modules/asn1.js/lib/asn1/base/node.js"); - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/base/node.js": -/*!****************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/base/node.js ***! - \****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -const Reporter = __webpack_require__(/*! ../base/reporter */ "./node_modules/asn1.js/lib/asn1/base/reporter.js").Reporter; -const EncoderBuffer = __webpack_require__(/*! ../base/buffer */ "./node_modules/asn1.js/lib/asn1/base/buffer.js").EncoderBuffer; -const DecoderBuffer = __webpack_require__(/*! ../base/buffer */ "./node_modules/asn1.js/lib/asn1/base/buffer.js").DecoderBuffer; -const assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); - -// Supported tags -const tags = [ - 'seq', 'seqof', 'set', 'setof', 'objid', 'bool', - 'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc', - 'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str', - 'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr' -]; - -// Public methods list -const methods = [ - 'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice', - 'any', 'contains' -].concat(tags); - -// Overrided methods list -const overrided = [ - '_peekTag', '_decodeTag', '_use', - '_decodeStr', '_decodeObjid', '_decodeTime', - '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList', - - '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime', - '_encodeNull', '_encodeInt', '_encodeBool' -]; - -function Node(enc, parent, name) { - const state = {}; - this._baseState = state; - - state.name = name; - state.enc = enc; - - state.parent = parent || null; - state.children = null; - - // State - state.tag = null; - state.args = null; - state.reverseArgs = null; - state.choice = null; - state.optional = false; - state.any = false; - state.obj = false; - state.use = null; - state.useDecoder = null; - state.key = null; - state['default'] = null; - state.explicit = null; - state.implicit = null; - state.contains = null; - - // Should create new instance on each method - if (!state.parent) { - state.children = []; - this._wrap(); - } -} -module.exports = Node; - -const stateProps = [ - 'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice', - 'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit', - 'implicit', 'contains' -]; - -Node.prototype.clone = function clone() { - const state = this._baseState; - const cstate = {}; - stateProps.forEach(function(prop) { - cstate[prop] = state[prop]; - }); - const res = new this.constructor(cstate.parent); - res._baseState = cstate; - return res; -}; - -Node.prototype._wrap = function wrap() { - const state = this._baseState; - methods.forEach(function(method) { - this[method] = function _wrappedMethod() { - const clone = new this.constructor(this); - state.children.push(clone); - return clone[method].apply(clone, arguments); - }; - }, this); -}; - -Node.prototype._init = function init(body) { - const state = this._baseState; - - assert(state.parent === null); - body.call(this); - - // Filter children - state.children = state.children.filter(function(child) { - return child._baseState.parent === this; - }, this); - assert.equal(state.children.length, 1, 'Root node can have only one child'); -}; - -Node.prototype._useArgs = function useArgs(args) { - const state = this._baseState; - - // Filter children and args - const children = args.filter(function(arg) { - return arg instanceof this.constructor; - }, this); - args = args.filter(function(arg) { - return !(arg instanceof this.constructor); - }, this); - - if (children.length !== 0) { - assert(state.children === null); - state.children = children; - - // Replace parent to maintain backward link - children.forEach(function(child) { - child._baseState.parent = this; - }, this); - } - if (args.length !== 0) { - assert(state.args === null); - state.args = args; - state.reverseArgs = args.map(function(arg) { - if (typeof arg !== 'object' || arg.constructor !== Object) - return arg; - - const res = {}; - Object.keys(arg).forEach(function(key) { - if (key == (key | 0)) - key |= 0; - const value = arg[key]; - res[value] = key; - }); - return res; - }); - } -}; - -// -// Overrided methods -// - -overrided.forEach(function(method) { - Node.prototype[method] = function _overrided() { - const state = this._baseState; - throw new Error(method + ' not implemented for encoding: ' + state.enc); - }; -}); - -// -// Public methods -// - -tags.forEach(function(tag) { - Node.prototype[tag] = function _tagMethod() { - const state = this._baseState; - const args = Array.prototype.slice.call(arguments); - - assert(state.tag === null); - state.tag = tag; - - this._useArgs(args); - - return this; - }; -}); - -Node.prototype.use = function use(item) { - assert(item); - const state = this._baseState; - - assert(state.use === null); - state.use = item; - - return this; -}; - -Node.prototype.optional = function optional() { - const state = this._baseState; - - state.optional = true; - - return this; -}; - -Node.prototype.def = function def(val) { - const state = this._baseState; - - assert(state['default'] === null); - state['default'] = val; - state.optional = true; - - return this; -}; - -Node.prototype.explicit = function explicit(num) { - const state = this._baseState; - - assert(state.explicit === null && state.implicit === null); - state.explicit = num; - - return this; -}; - -Node.prototype.implicit = function implicit(num) { - const state = this._baseState; - - assert(state.explicit === null && state.implicit === null); - state.implicit = num; - - return this; -}; - -Node.prototype.obj = function obj() { - const state = this._baseState; - const args = Array.prototype.slice.call(arguments); - - state.obj = true; - - if (args.length !== 0) - this._useArgs(args); - - return this; -}; - -Node.prototype.key = function key(newKey) { - const state = this._baseState; - - assert(state.key === null); - state.key = newKey; - - return this; -}; - -Node.prototype.any = function any() { - const state = this._baseState; - - state.any = true; - - return this; -}; - -Node.prototype.choice = function choice(obj) { - const state = this._baseState; - - assert(state.choice === null); - state.choice = obj; - this._useArgs(Object.keys(obj).map(function(key) { - return obj[key]; - })); - - return this; -}; - -Node.prototype.contains = function contains(item) { - const state = this._baseState; - - assert(state.use === null); - state.contains = item; - - return this; -}; - -// -// Decoding -// - -Node.prototype._decode = function decode(input, options) { - const state = this._baseState; - - // Decode root node - if (state.parent === null) - return input.wrapResult(state.children[0]._decode(input, options)); - - let result = state['default']; - let present = true; - - let prevKey = null; - if (state.key !== null) - prevKey = input.enterKey(state.key); - - // Check if tag is there - if (state.optional) { - let tag = null; - if (state.explicit !== null) - tag = state.explicit; - else if (state.implicit !== null) - tag = state.implicit; - else if (state.tag !== null) - tag = state.tag; - - if (tag === null && !state.any) { - // Trial and Error - const save = input.save(); - try { - if (state.choice === null) - this._decodeGeneric(state.tag, input, options); - else - this._decodeChoice(input, options); - present = true; - } catch (e) { - present = false; - } - input.restore(save); - } else { - present = this._peekTag(input, tag, state.any); - - if (input.isError(present)) - return present; - } - } - - // Push object on stack - let prevObj; - if (state.obj && present) - prevObj = input.enterObject(); - - if (present) { - // Unwrap explicit values - if (state.explicit !== null) { - const explicit = this._decodeTag(input, state.explicit); - if (input.isError(explicit)) - return explicit; - input = explicit; - } - - const start = input.offset; - - // Unwrap implicit and normal values - if (state.use === null && state.choice === null) { - let save; - if (state.any) - save = input.save(); - const body = this._decodeTag( - input, - state.implicit !== null ? state.implicit : state.tag, - state.any - ); - if (input.isError(body)) - return body; - - if (state.any) - result = input.raw(save); - else - input = body; - } - - if (options && options.track && state.tag !== null) - options.track(input.path(), start, input.length, 'tagged'); - - if (options && options.track && state.tag !== null) - options.track(input.path(), input.offset, input.length, 'content'); - - // Select proper method for tag - if (state.any) { - // no-op - } else if (state.choice === null) { - result = this._decodeGeneric(state.tag, input, options); - } else { - result = this._decodeChoice(input, options); - } - - if (input.isError(result)) - return result; - - // Decode children - if (!state.any && state.choice === null && state.children !== null) { - state.children.forEach(function decodeChildren(child) { - // NOTE: We are ignoring errors here, to let parser continue with other - // parts of encoded data - child._decode(input, options); - }); - } - - // Decode contained/encoded by schema, only in bit or octet strings - if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) { - const data = new DecoderBuffer(result); - result = this._getUse(state.contains, input._reporterState.obj) - ._decode(data, options); - } - } - - // Pop object - if (state.obj && present) - result = input.leaveObject(prevObj); - - // Set key - if (state.key !== null && (result !== null || present === true)) - input.leaveKey(prevKey, state.key, result); - else if (prevKey !== null) - input.exitKey(prevKey); - - return result; -}; - -Node.prototype._decodeGeneric = function decodeGeneric(tag, input, options) { - const state = this._baseState; - - if (tag === 'seq' || tag === 'set') - return null; - if (tag === 'seqof' || tag === 'setof') - return this._decodeList(input, tag, state.args[0], options); - else if (/str$/.test(tag)) - return this._decodeStr(input, tag, options); - else if (tag === 'objid' && state.args) - return this._decodeObjid(input, state.args[0], state.args[1], options); - else if (tag === 'objid') - return this._decodeObjid(input, null, null, options); - else if (tag === 'gentime' || tag === 'utctime') - return this._decodeTime(input, tag, options); - else if (tag === 'null_') - return this._decodeNull(input, options); - else if (tag === 'bool') - return this._decodeBool(input, options); - else if (tag === 'objDesc') - return this._decodeStr(input, tag, options); - else if (tag === 'int' || tag === 'enum') - return this._decodeInt(input, state.args && state.args[0], options); - - if (state.use !== null) { - return this._getUse(state.use, input._reporterState.obj) - ._decode(input, options); - } else { - return input.error('unknown tag: ' + tag); - } -}; - -Node.prototype._getUse = function _getUse(entity, obj) { - - const state = this._baseState; - // Create altered use decoder if implicit is set - state.useDecoder = this._use(entity, obj); - assert(state.useDecoder._baseState.parent === null); - state.useDecoder = state.useDecoder._baseState.children[0]; - if (state.implicit !== state.useDecoder._baseState.implicit) { - state.useDecoder = state.useDecoder.clone(); - state.useDecoder._baseState.implicit = state.implicit; - } - return state.useDecoder; -}; - -Node.prototype._decodeChoice = function decodeChoice(input, options) { - const state = this._baseState; - let result = null; - let match = false; - - Object.keys(state.choice).some(function(key) { - const save = input.save(); - const node = state.choice[key]; - try { - const value = node._decode(input, options); - if (input.isError(value)) - return false; - - result = { type: key, value: value }; - match = true; - } catch (e) { - input.restore(save); - return false; - } - return true; - }, this); - - if (!match) - return input.error('Choice not matched'); - - return result; -}; - -// -// Encoding -// - -Node.prototype._createEncoderBuffer = function createEncoderBuffer(data) { - return new EncoderBuffer(data, this.reporter); -}; - -Node.prototype._encode = function encode(data, reporter, parent) { - const state = this._baseState; - if (state['default'] !== null && state['default'] === data) - return; - - const result = this._encodeValue(data, reporter, parent); - if (result === undefined) - return; - - if (this._skipDefault(result, reporter, parent)) - return; - - return result; -}; - -Node.prototype._encodeValue = function encode(data, reporter, parent) { - const state = this._baseState; - - // Decode root node - if (state.parent === null) - return state.children[0]._encode(data, reporter || new Reporter()); - - let result = null; - - // Set reporter to share it with a child class - this.reporter = reporter; - - // Check if data is there - if (state.optional && data === undefined) { - if (state['default'] !== null) - data = state['default']; - else - return; - } - - // Encode children first - let content = null; - let primitive = false; - if (state.any) { - // Anything that was given is translated to buffer - result = this._createEncoderBuffer(data); - } else if (state.choice) { - result = this._encodeChoice(data, reporter); - } else if (state.contains) { - content = this._getUse(state.contains, parent)._encode(data, reporter); - primitive = true; - } else if (state.children) { - content = state.children.map(function(child) { - if (child._baseState.tag === 'null_') - return child._encode(null, reporter, data); - - if (child._baseState.key === null) - return reporter.error('Child should have a key'); - const prevKey = reporter.enterKey(child._baseState.key); - - if (typeof data !== 'object') - return reporter.error('Child expected, but input is not object'); - - const res = child._encode(data[child._baseState.key], reporter, data); - reporter.leaveKey(prevKey); - - return res; - }, this).filter(function(child) { - return child; - }); - content = this._createEncoderBuffer(content); - } else { - if (state.tag === 'seqof' || state.tag === 'setof') { - // TODO(indutny): this should be thrown on DSL level - if (!(state.args && state.args.length === 1)) - return reporter.error('Too many args for : ' + state.tag); - - if (!Array.isArray(data)) - return reporter.error('seqof/setof, but data is not Array'); - - const child = this.clone(); - child._baseState.implicit = null; - content = this._createEncoderBuffer(data.map(function(item) { - const state = this._baseState; - - return this._getUse(state.args[0], data)._encode(item, reporter); - }, child)); - } else if (state.use !== null) { - result = this._getUse(state.use, parent)._encode(data, reporter); - } else { - content = this._encodePrimitive(state.tag, data); - primitive = true; - } - } - - // Encode data itself - if (!state.any && state.choice === null) { - const tag = state.implicit !== null ? state.implicit : state.tag; - const cls = state.implicit === null ? 'universal' : 'context'; - - if (tag === null) { - if (state.use === null) - reporter.error('Tag could be omitted only for .use()'); - } else { - if (state.use === null) - result = this._encodeComposite(tag, primitive, cls, content); - } - } - - // Wrap in explicit - if (state.explicit !== null) - result = this._encodeComposite(state.explicit, false, 'context', result); - - return result; -}; - -Node.prototype._encodeChoice = function encodeChoice(data, reporter) { - const state = this._baseState; - - const node = state.choice[data.type]; - if (!node) { - assert( - false, - data.type + ' not found in ' + - JSON.stringify(Object.keys(state.choice))); - } - return node._encode(data.value, reporter); -}; - -Node.prototype._encodePrimitive = function encodePrimitive(tag, data) { - const state = this._baseState; - - if (/str$/.test(tag)) - return this._encodeStr(data, tag); - else if (tag === 'objid' && state.args) - return this._encodeObjid(data, state.reverseArgs[0], state.args[1]); - else if (tag === 'objid') - return this._encodeObjid(data, null, null); - else if (tag === 'gentime' || tag === 'utctime') - return this._encodeTime(data, tag); - else if (tag === 'null_') - return this._encodeNull(); - else if (tag === 'int' || tag === 'enum') - return this._encodeInt(data, state.args && state.reverseArgs[0]); - else if (tag === 'bool') - return this._encodeBool(data); - else if (tag === 'objDesc') - return this._encodeStr(data, tag); - else - throw new Error('Unsupported tag: ' + tag); -}; - -Node.prototype._isNumstr = function isNumstr(str) { - return /^[0-9 ]*$/.test(str); -}; - -Node.prototype._isPrintstr = function isPrintstr(str) { - return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str); -}; - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/base/reporter.js": -/*!********************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/base/reporter.js ***! - \********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -const inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -function Reporter(options) { - this._reporterState = { - obj: null, - path: [], - options: options || {}, - errors: [] - }; -} -exports.Reporter = Reporter; - -Reporter.prototype.isError = function isError(obj) { - return obj instanceof ReporterError; -}; - -Reporter.prototype.save = function save() { - const state = this._reporterState; - - return { obj: state.obj, pathLen: state.path.length }; -}; - -Reporter.prototype.restore = function restore(data) { - const state = this._reporterState; - - state.obj = data.obj; - state.path = state.path.slice(0, data.pathLen); -}; - -Reporter.prototype.enterKey = function enterKey(key) { - return this._reporterState.path.push(key); -}; - -Reporter.prototype.exitKey = function exitKey(index) { - const state = this._reporterState; - - state.path = state.path.slice(0, index - 1); -}; - -Reporter.prototype.leaveKey = function leaveKey(index, key, value) { - const state = this._reporterState; - - this.exitKey(index); - if (state.obj !== null) - state.obj[key] = value; -}; - -Reporter.prototype.path = function path() { - return this._reporterState.path.join('/'); -}; - -Reporter.prototype.enterObject = function enterObject() { - const state = this._reporterState; - - const prev = state.obj; - state.obj = {}; - return prev; -}; - -Reporter.prototype.leaveObject = function leaveObject(prev) { - const state = this._reporterState; - - const now = state.obj; - state.obj = prev; - return now; -}; - -Reporter.prototype.error = function error(msg) { - let err; - const state = this._reporterState; - - const inherited = msg instanceof ReporterError; - if (inherited) { - err = msg; - } else { - err = new ReporterError(state.path.map(function(elem) { - return '[' + JSON.stringify(elem) + ']'; - }).join(''), msg.message || msg, msg.stack); - } - - if (!state.options.partial) - throw err; - - if (!inherited) - state.errors.push(err); - - return err; -}; - -Reporter.prototype.wrapResult = function wrapResult(result) { - const state = this._reporterState; - if (!state.options.partial) - return result; - - return { - result: this.isError(result) ? null : result, - errors: state.errors - }; -}; - -function ReporterError(path, msg) { - this.path = path; - this.rethrow(msg); -} -inherits(ReporterError, Error); - -ReporterError.prototype.rethrow = function rethrow(msg) { - this.message = msg + ' at: ' + (this.path || '(shallow)'); - if (Error.captureStackTrace) - Error.captureStackTrace(this, ReporterError); - - if (!this.stack) { - try { - // IE only adds stack when thrown - throw new Error(this.message); - } catch (e) { - this.stack = e.stack; - } - } - return this; -}; - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/constants/der.js": -/*!********************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/constants/der.js ***! - \********************************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - -// Helper -function reverse(map) { - const res = {}; - - Object.keys(map).forEach(function(key) { - // Convert key to integer if it is stringified - if ((key | 0) == key) - key = key | 0; - - const value = map[key]; - res[value] = key; - }); - - return res; -} - -exports.tagClass = { - 0: 'universal', - 1: 'application', - 2: 'context', - 3: 'private' -}; -exports.tagClassByName = reverse(exports.tagClass); - -exports.tag = { - 0x00: 'end', - 0x01: 'bool', - 0x02: 'int', - 0x03: 'bitstr', - 0x04: 'octstr', - 0x05: 'null_', - 0x06: 'objid', - 0x07: 'objDesc', - 0x08: 'external', - 0x09: 'real', - 0x0a: 'enum', - 0x0b: 'embed', - 0x0c: 'utf8str', - 0x0d: 'relativeOid', - 0x10: 'seq', - 0x11: 'set', - 0x12: 'numstr', - 0x13: 'printstr', - 0x14: 't61str', - 0x15: 'videostr', - 0x16: 'ia5str', - 0x17: 'utctime', - 0x18: 'gentime', - 0x19: 'graphstr', - 0x1a: 'iso646str', - 0x1b: 'genstr', - 0x1c: 'unistr', - 0x1d: 'charstr', - 0x1e: 'bmpstr' -}; -exports.tagByName = reverse(exports.tag); - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/constants/index.js": -/*!**********************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/constants/index.js ***! - \**********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -const constants = exports; - -// Helper -constants._reverse = function reverse(map) { - const res = {}; - - Object.keys(map).forEach(function(key) { - // Convert key to integer if it is stringified - if ((key | 0) == key) - key = key | 0; - - const value = map[key]; - res[value] = key; - }); - - return res; -}; - -constants.der = __webpack_require__(/*! ./der */ "./node_modules/asn1.js/lib/asn1/constants/der.js"); - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/decoders/der.js": -/*!*******************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/decoders/der.js ***! - \*******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -const inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -const bignum = __webpack_require__(/*! bn.js */ "./node_modules/asn1.js/node_modules/bn.js/lib/bn.js"); -const DecoderBuffer = __webpack_require__(/*! ../base/buffer */ "./node_modules/asn1.js/lib/asn1/base/buffer.js").DecoderBuffer; -const Node = __webpack_require__(/*! ../base/node */ "./node_modules/asn1.js/lib/asn1/base/node.js"); - -// Import DER constants -const der = __webpack_require__(/*! ../constants/der */ "./node_modules/asn1.js/lib/asn1/constants/der.js"); - -function DERDecoder(entity) { - this.enc = 'der'; - this.name = entity.name; - this.entity = entity; - - // Construct base tree - this.tree = new DERNode(); - this.tree._init(entity.body); -} -module.exports = DERDecoder; - -DERDecoder.prototype.decode = function decode(data, options) { - if (!DecoderBuffer.isDecoderBuffer(data)) { - data = new DecoderBuffer(data, options); - } - - return this.tree._decode(data, options); -}; - -// Tree methods - -function DERNode(parent) { - Node.call(this, 'der', parent); -} -inherits(DERNode, Node); - -DERNode.prototype._peekTag = function peekTag(buffer, tag, any) { - if (buffer.isEmpty()) - return false; - - const state = buffer.save(); - const decodedTag = derDecodeTag(buffer, 'Failed to peek tag: "' + tag + '"'); - if (buffer.isError(decodedTag)) - return decodedTag; - - buffer.restore(state); - - return decodedTag.tag === tag || decodedTag.tagStr === tag || - (decodedTag.tagStr + 'of') === tag || any; -}; - -DERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) { - const decodedTag = derDecodeTag(buffer, - 'Failed to decode tag of "' + tag + '"'); - if (buffer.isError(decodedTag)) - return decodedTag; - - let len = derDecodeLen(buffer, - decodedTag.primitive, - 'Failed to get length of "' + tag + '"'); - - // Failure - if (buffer.isError(len)) - return len; - - if (!any && - decodedTag.tag !== tag && - decodedTag.tagStr !== tag && - decodedTag.tagStr + 'of' !== tag) { - return buffer.error('Failed to match tag: "' + tag + '"'); - } - - if (decodedTag.primitive || len !== null) - return buffer.skip(len, 'Failed to match body of: "' + tag + '"'); - - // Indefinite length... find END tag - const state = buffer.save(); - const res = this._skipUntilEnd( - buffer, - 'Failed to skip indefinite length body: "' + this.tag + '"'); - if (buffer.isError(res)) - return res; - - len = buffer.offset - state.offset; - buffer.restore(state); - return buffer.skip(len, 'Failed to match body of: "' + tag + '"'); -}; - -DERNode.prototype._skipUntilEnd = function skipUntilEnd(buffer, fail) { - for (;;) { - const tag = derDecodeTag(buffer, fail); - if (buffer.isError(tag)) - return tag; - const len = derDecodeLen(buffer, tag.primitive, fail); - if (buffer.isError(len)) - return len; - - let res; - if (tag.primitive || len !== null) - res = buffer.skip(len); - else - res = this._skipUntilEnd(buffer, fail); - - // Failure - if (buffer.isError(res)) - return res; - - if (tag.tagStr === 'end') - break; - } -}; - -DERNode.prototype._decodeList = function decodeList(buffer, tag, decoder, - options) { - const result = []; - while (!buffer.isEmpty()) { - const possibleEnd = this._peekTag(buffer, 'end'); - if (buffer.isError(possibleEnd)) - return possibleEnd; - - const res = decoder.decode(buffer, 'der', options); - if (buffer.isError(res) && possibleEnd) - break; - result.push(res); - } - return result; -}; - -DERNode.prototype._decodeStr = function decodeStr(buffer, tag) { - if (tag === 'bitstr') { - const unused = buffer.readUInt8(); - if (buffer.isError(unused)) - return unused; - return { unused: unused, data: buffer.raw() }; - } else if (tag === 'bmpstr') { - const raw = buffer.raw(); - if (raw.length % 2 === 1) - return buffer.error('Decoding of string type: bmpstr length mismatch'); - - let str = ''; - for (let i = 0; i < raw.length / 2; i++) { - str += String.fromCharCode(raw.readUInt16BE(i * 2)); - } - return str; - } else if (tag === 'numstr') { - const numstr = buffer.raw().toString('ascii'); - if (!this._isNumstr(numstr)) { - return buffer.error('Decoding of string type: ' + - 'numstr unsupported characters'); - } - return numstr; - } else if (tag === 'octstr') { - return buffer.raw(); - } else if (tag === 'objDesc') { - return buffer.raw(); - } else if (tag === 'printstr') { - const printstr = buffer.raw().toString('ascii'); - if (!this._isPrintstr(printstr)) { - return buffer.error('Decoding of string type: ' + - 'printstr unsupported characters'); - } - return printstr; - } else if (/str$/.test(tag)) { - return buffer.raw().toString(); - } else { - return buffer.error('Decoding of string type: ' + tag + ' unsupported'); - } -}; - -DERNode.prototype._decodeObjid = function decodeObjid(buffer, values, relative) { - let result; - const identifiers = []; - let ident = 0; - let subident = 0; - while (!buffer.isEmpty()) { - subident = buffer.readUInt8(); - ident <<= 7; - ident |= subident & 0x7f; - if ((subident & 0x80) === 0) { - identifiers.push(ident); - ident = 0; - } - } - if (subident & 0x80) - identifiers.push(ident); - - const first = (identifiers[0] / 40) | 0; - const second = identifiers[0] % 40; - - if (relative) - result = identifiers; - else - result = [first, second].concat(identifiers.slice(1)); - - if (values) { - let tmp = values[result.join(' ')]; - if (tmp === undefined) - tmp = values[result.join('.')]; - if (tmp !== undefined) - result = tmp; - } - - return result; -}; - -DERNode.prototype._decodeTime = function decodeTime(buffer, tag) { - const str = buffer.raw().toString(); - - let year; - let mon; - let day; - let hour; - let min; - let sec; - if (tag === 'gentime') { - year = str.slice(0, 4) | 0; - mon = str.slice(4, 6) | 0; - day = str.slice(6, 8) | 0; - hour = str.slice(8, 10) | 0; - min = str.slice(10, 12) | 0; - sec = str.slice(12, 14) | 0; - } else if (tag === 'utctime') { - year = str.slice(0, 2) | 0; - mon = str.slice(2, 4) | 0; - day = str.slice(4, 6) | 0; - hour = str.slice(6, 8) | 0; - min = str.slice(8, 10) | 0; - sec = str.slice(10, 12) | 0; - if (year < 70) - year = 2000 + year; - else - year = 1900 + year; - } else { - return buffer.error('Decoding ' + tag + ' time is not supported yet'); - } - - return Date.UTC(year, mon - 1, day, hour, min, sec, 0); -}; - -DERNode.prototype._decodeNull = function decodeNull() { - return null; -}; - -DERNode.prototype._decodeBool = function decodeBool(buffer) { - const res = buffer.readUInt8(); - if (buffer.isError(res)) - return res; - else - return res !== 0; -}; - -DERNode.prototype._decodeInt = function decodeInt(buffer, values) { - // Bigint, return as it is (assume big endian) - const raw = buffer.raw(); - let res = new bignum(raw); - - if (values) - res = values[res.toString(10)] || res; - - return res; -}; - -DERNode.prototype._use = function use(entity, obj) { - if (typeof entity === 'function') - entity = entity(obj); - return entity._getDecoder('der').tree; -}; - -// Utility methods - -function derDecodeTag(buf, fail) { - let tag = buf.readUInt8(fail); - if (buf.isError(tag)) - return tag; - - const cls = der.tagClass[tag >> 6]; - const primitive = (tag & 0x20) === 0; - - // Multi-octet tag - load - if ((tag & 0x1f) === 0x1f) { - let oct = tag; - tag = 0; - while ((oct & 0x80) === 0x80) { - oct = buf.readUInt8(fail); - if (buf.isError(oct)) - return oct; - - tag <<= 7; - tag |= oct & 0x7f; - } - } else { - tag &= 0x1f; - } - const tagStr = der.tag[tag]; - - return { - cls: cls, - primitive: primitive, - tag: tag, - tagStr: tagStr - }; -} - -function derDecodeLen(buf, primitive, fail) { - let len = buf.readUInt8(fail); - if (buf.isError(len)) - return len; - - // Indefinite form - if (!primitive && len === 0x80) - return null; - - // Definite form - if ((len & 0x80) === 0) { - // Short form - return len; - } - - // Long form - const num = len & 0x7f; - if (num > 4) - return buf.error('length octect is too long'); - - len = 0; - for (let i = 0; i < num; i++) { - len <<= 8; - const j = buf.readUInt8(fail); - if (buf.isError(j)) - return j; - len |= j; - } - - return len; -} - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/decoders/index.js": -/*!*********************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/decoders/index.js ***! - \*********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -const decoders = exports; - -decoders.der = __webpack_require__(/*! ./der */ "./node_modules/asn1.js/lib/asn1/decoders/der.js"); -decoders.pem = __webpack_require__(/*! ./pem */ "./node_modules/asn1.js/lib/asn1/decoders/pem.js"); - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/decoders/pem.js": -/*!*******************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/decoders/pem.js ***! - \*******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -const inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); -const Buffer = __webpack_require__(/*! safer-buffer */ "./node_modules/safer-buffer/safer.js").Buffer; - -const DERDecoder = __webpack_require__(/*! ./der */ "./node_modules/asn1.js/lib/asn1/decoders/der.js"); - -function PEMDecoder(entity) { - DERDecoder.call(this, entity); - this.enc = 'pem'; -} -inherits(PEMDecoder, DERDecoder); -module.exports = PEMDecoder; - -PEMDecoder.prototype.decode = function decode(data, options) { - const lines = data.toString().split(/[\r\n]+/g); - - const label = options.label.toUpperCase(); - - const re = /^-----(BEGIN|END) ([^-]+)-----$/; - let start = -1; - let end = -1; - for (let i = 0; i < lines.length; i++) { - const match = lines[i].match(re); - if (match === null) - continue; - - if (match[2] !== label) - continue; - - if (start === -1) { - if (match[1] !== 'BEGIN') - break; - start = i; - } else { - if (match[1] !== 'END') - break; - end = i; - break; - } - } - if (start === -1 || end === -1) - throw new Error('PEM section not found for: ' + label); - - const base64 = lines.slice(start + 1, end).join(''); - // Remove excessive symbols - base64.replace(/[^a-z0-9+/=]+/gi, ''); - - const input = Buffer.from(base64, 'base64'); - return DERDecoder.prototype.decode.call(this, input, options); -}; - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/encoders/der.js": -/*!*******************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/encoders/der.js ***! - \*******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -const inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); -const Buffer = __webpack_require__(/*! safer-buffer */ "./node_modules/safer-buffer/safer.js").Buffer; -const Node = __webpack_require__(/*! ../base/node */ "./node_modules/asn1.js/lib/asn1/base/node.js"); - -// Import DER constants -const der = __webpack_require__(/*! ../constants/der */ "./node_modules/asn1.js/lib/asn1/constants/der.js"); - -function DEREncoder(entity) { - this.enc = 'der'; - this.name = entity.name; - this.entity = entity; - - // Construct base tree - this.tree = new DERNode(); - this.tree._init(entity.body); -} -module.exports = DEREncoder; - -DEREncoder.prototype.encode = function encode(data, reporter) { - return this.tree._encode(data, reporter).join(); -}; - -// Tree methods - -function DERNode(parent) { - Node.call(this, 'der', parent); -} -inherits(DERNode, Node); - -DERNode.prototype._encodeComposite = function encodeComposite(tag, - primitive, - cls, - content) { - const encodedTag = encodeTag(tag, primitive, cls, this.reporter); - - // Short form - if (content.length < 0x80) { - const header = Buffer.alloc(2); - header[0] = encodedTag; - header[1] = content.length; - return this._createEncoderBuffer([ header, content ]); - } - - // Long form - // Count octets required to store length - let lenOctets = 1; - for (let i = content.length; i >= 0x100; i >>= 8) - lenOctets++; - - const header = Buffer.alloc(1 + 1 + lenOctets); - header[0] = encodedTag; - header[1] = 0x80 | lenOctets; - - for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8) - header[i] = j & 0xff; - - return this._createEncoderBuffer([ header, content ]); -}; - -DERNode.prototype._encodeStr = function encodeStr(str, tag) { - if (tag === 'bitstr') { - return this._createEncoderBuffer([ str.unused | 0, str.data ]); - } else if (tag === 'bmpstr') { - const buf = Buffer.alloc(str.length * 2); - for (let i = 0; i < str.length; i++) { - buf.writeUInt16BE(str.charCodeAt(i), i * 2); - } - return this._createEncoderBuffer(buf); - } else if (tag === 'numstr') { - if (!this._isNumstr(str)) { - return this.reporter.error('Encoding of string type: numstr supports ' + - 'only digits and space'); - } - return this._createEncoderBuffer(str); - } else if (tag === 'printstr') { - if (!this._isPrintstr(str)) { - 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'); - } - return this._createEncoderBuffer(str); - } else if (/str$/.test(tag)) { - return this._createEncoderBuffer(str); - } else if (tag === 'objDesc') { - return this._createEncoderBuffer(str); - } else { - return this.reporter.error('Encoding of string type: ' + tag + - ' unsupported'); - } -}; - -DERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) { - if (typeof id === 'string') { - if (!values) - return this.reporter.error('string objid given, but no values map found'); - if (!values.hasOwnProperty(id)) - return this.reporter.error('objid not found in values map'); - id = values[id].split(/[\s.]+/g); - for (let i = 0; i < id.length; i++) - id[i] |= 0; - } else if (Array.isArray(id)) { - id = id.slice(); - for (let i = 0; i < id.length; i++) - id[i] |= 0; - } - - if (!Array.isArray(id)) { - return this.reporter.error('objid() should be either array or string, ' + - 'got: ' + JSON.stringify(id)); - } - - if (!relative) { - if (id[1] >= 40) - return this.reporter.error('Second objid identifier OOB'); - id.splice(0, 2, id[0] * 40 + id[1]); - } - - // Count number of octets - let size = 0; - for (let i = 0; i < id.length; i++) { - let ident = id[i]; - for (size++; ident >= 0x80; ident >>= 7) - size++; - } - - const objid = Buffer.alloc(size); - let offset = objid.length - 1; - for (let i = id.length - 1; i >= 0; i--) { - let ident = id[i]; - objid[offset--] = ident & 0x7f; - while ((ident >>= 7) > 0) - objid[offset--] = 0x80 | (ident & 0x7f); - } - - return this._createEncoderBuffer(objid); -}; - -function two(num) { - if (num < 10) - return '0' + num; - else - return num; -} - -DERNode.prototype._encodeTime = function encodeTime(time, tag) { - let str; - const date = new Date(time); - - if (tag === 'gentime') { - str = [ - two(date.getUTCFullYear()), - two(date.getUTCMonth() + 1), - two(date.getUTCDate()), - two(date.getUTCHours()), - two(date.getUTCMinutes()), - two(date.getUTCSeconds()), - 'Z' - ].join(''); - } else if (tag === 'utctime') { - str = [ - two(date.getUTCFullYear() % 100), - two(date.getUTCMonth() + 1), - two(date.getUTCDate()), - two(date.getUTCHours()), - two(date.getUTCMinutes()), - two(date.getUTCSeconds()), - 'Z' - ].join(''); - } else { - this.reporter.error('Encoding ' + tag + ' time is not supported yet'); - } - - return this._encodeStr(str, 'octstr'); -}; - -DERNode.prototype._encodeNull = function encodeNull() { - return this._createEncoderBuffer(''); -}; - -DERNode.prototype._encodeInt = function encodeInt(num, values) { - if (typeof num === 'string') { - if (!values) - return this.reporter.error('String int or enum given, but no values map'); - if (!values.hasOwnProperty(num)) { - return this.reporter.error('Values map doesn\'t contain: ' + - JSON.stringify(num)); - } - num = values[num]; - } - - // Bignum, assume big endian - if (typeof num !== 'number' && !Buffer.isBuffer(num)) { - const numArray = num.toArray(); - if (!num.sign && numArray[0] & 0x80) { - numArray.unshift(0); - } - num = Buffer.from(numArray); - } - - if (Buffer.isBuffer(num)) { - let size = num.length; - if (num.length === 0) - size++; - - const out = Buffer.alloc(size); - num.copy(out); - if (num.length === 0) - out[0] = 0; - return this._createEncoderBuffer(out); - } - - if (num < 0x80) - return this._createEncoderBuffer(num); - - if (num < 0x100) - return this._createEncoderBuffer([0, num]); - - let size = 1; - for (let i = num; i >= 0x100; i >>= 8) - size++; - - const out = new Array(size); - for (let i = out.length - 1; i >= 0; i--) { - out[i] = num & 0xff; - num >>= 8; - } - if(out[0] & 0x80) { - out.unshift(0); - } - - return this._createEncoderBuffer(Buffer.from(out)); -}; - -DERNode.prototype._encodeBool = function encodeBool(value) { - return this._createEncoderBuffer(value ? 0xff : 0); -}; - -DERNode.prototype._use = function use(entity, obj) { - if (typeof entity === 'function') - entity = entity(obj); - return entity._getEncoder('der').tree; -}; - -DERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) { - const state = this._baseState; - let i; - if (state['default'] === null) - return false; - - const data = dataBuffer.join(); - if (state.defaultBuffer === undefined) - state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join(); - - if (data.length !== state.defaultBuffer.length) - return false; - - for (i=0; i < data.length; i++) - if (data[i] !== state.defaultBuffer[i]) - return false; - - return true; -}; - -// Utility methods - -function encodeTag(tag, primitive, cls, reporter) { - let res; - - if (tag === 'seqof') - tag = 'seq'; - else if (tag === 'setof') - tag = 'set'; - - 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); - - if (res >= 0x1f) - return reporter.error('Multi-octet tag encoding unsupported'); - - if (!primitive) - res |= 0x20; - - res |= (der.tagClassByName[cls || 'universal'] << 6); - - return res; -} - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/encoders/index.js": -/*!*********************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/encoders/index.js ***! - \*********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -const encoders = exports; - -encoders.der = __webpack_require__(/*! ./der */ "./node_modules/asn1.js/lib/asn1/encoders/der.js"); -encoders.pem = __webpack_require__(/*! ./pem */ "./node_modules/asn1.js/lib/asn1/encoders/pem.js"); - - -/***/ }), - -/***/ "./node_modules/asn1.js/lib/asn1/encoders/pem.js": -/*!*******************************************************!*\ - !*** ./node_modules/asn1.js/lib/asn1/encoders/pem.js ***! - \*******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -const inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -const DEREncoder = __webpack_require__(/*! ./der */ "./node_modules/asn1.js/lib/asn1/encoders/der.js"); - -function PEMEncoder(entity) { - DEREncoder.call(this, entity); - this.enc = 'pem'; -} -inherits(PEMEncoder, DEREncoder); -module.exports = PEMEncoder; - -PEMEncoder.prototype.encode = function encode(data, options) { - const buf = DEREncoder.prototype.encode.call(this, data); - - const p = buf.toString('base64'); - const out = [ '-----BEGIN ' + options.label + '-----' ]; - for (let i = 0; i < p.length; i += 64) - out.push(p.slice(i, i + 64)); - out.push('-----END ' + options.label + '-----'); - return out.join('\n'); -}; - - -/***/ }), - -/***/ "./node_modules/asn1.js/node_modules/bn.js/lib/bn.js": -/*!***********************************************************!*\ - !*** ./node_modules/asn1.js/node_modules/bn.js/lib/bn.js ***! - \***********************************************************/ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -(function (module, exports) { - 'use strict'; - - // Utils - function assert (val, msg) { - if (!val) throw new Error(msg || 'Assertion failed'); - } - - // Could use `inherits` module, but don't want to move from single file - // architecture yet. - function inherits (ctor, superCtor) { - ctor.super_ = superCtor; - var TempCtor = function () {}; - TempCtor.prototype = superCtor.prototype; - ctor.prototype = new TempCtor(); - ctor.prototype.constructor = ctor; - } - - // BN - - function BN (number, base, endian) { - if (BN.isBN(number)) { - return number; - } - - this.negative = 0; - this.words = null; - this.length = 0; - - // Reduction context - this.red = null; - - if (number !== null) { - if (base === 'le' || base === 'be') { - endian = base; - base = 10; - } - - this._init(number || 0, base || 10, endian || 'be'); - } - } - if (typeof module === 'object') { - module.exports = BN; - } else { - exports.BN = BN; - } - - BN.BN = BN; - BN.wordSize = 26; - - var Buffer; - try { - if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { - Buffer = window.Buffer; - } else { - Buffer = __webpack_require__(/*! buffer */ "?d546").Buffer; - } - } catch (e) { - } - - BN.isBN = function isBN (num) { - if (num instanceof BN) { - return true; - } - - return num !== null && typeof num === 'object' && - num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); - }; - - BN.max = function max (left, right) { - if (left.cmp(right) > 0) return left; - return right; - }; - - BN.min = function min (left, right) { - if (left.cmp(right) < 0) return left; - return right; - }; - - BN.prototype._init = function init (number, base, endian) { - if (typeof number === 'number') { - return this._initNumber(number, base, endian); - } - - if (typeof number === 'object') { - return this._initArray(number, base, endian); - } - - if (base === 'hex') { - base = 16; - } - assert(base === (base | 0) && base >= 2 && base <= 36); - - number = number.toString().replace(/\s+/g, ''); - var start = 0; - if (number[0] === '-') { - start++; - this.negative = 1; - } - - if (start < number.length) { - if (base === 16) { - this._parseHex(number, start, endian); - } else { - this._parseBase(number, base, start); - if (endian === 'le') { - this._initArray(this.toArray(), base, endian); - } - } - } - }; - - BN.prototype._initNumber = function _initNumber (number, base, endian) { - if (number < 0) { - this.negative = 1; - number = -number; - } - if (number < 0x4000000) { - this.words = [ number & 0x3ffffff ]; - this.length = 1; - } else if (number < 0x10000000000000) { - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff - ]; - this.length = 2; - } else { - assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff, - 1 - ]; - this.length = 3; - } - - if (endian !== 'le') return; - - // Reverse the bytes - this._initArray(this.toArray(), base, endian); - }; - - BN.prototype._initArray = function _initArray (number, base, endian) { - // Perhaps a Uint8Array - assert(typeof number.length === 'number'); - if (number.length <= 0) { - this.words = [ 0 ]; - this.length = 1; - return this; - } - - this.length = Math.ceil(number.length / 3); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - var j, w; - var off = 0; - if (endian === 'be') { - for (i = number.length - 1, j = 0; i >= 0; i -= 3) { - w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } else if (endian === 'le') { - for (i = 0, j = 0; i < number.length; i += 3) { - w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } - return this.strip(); - }; - - function parseHex4Bits (string, index) { - var c = string.charCodeAt(index); - // 'A' - 'F' - if (c >= 65 && c <= 70) { - return c - 55; - // 'a' - 'f' - } else if (c >= 97 && c <= 102) { - return c - 87; - // '0' - '9' - } else { - return (c - 48) & 0xf; - } - } - - function parseHexByte (string, lowerBound, index) { - var r = parseHex4Bits(string, index); - if (index - 1 >= lowerBound) { - r |= parseHex4Bits(string, index - 1) << 4; - } - return r; - } - - BN.prototype._parseHex = function _parseHex (number, start, endian) { - // Create possibly bigger array to ensure that it fits the number - this.length = Math.ceil((number.length - start) / 6); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - // 24-bits chunks - var off = 0; - var j = 0; - - var w; - if (endian === 'be') { - for (i = number.length - 1; i >= start; i -= 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } else { - var parseLength = number.length - start; - for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } - - this.strip(); - }; - - function parseBase (str, start, end, mul) { - var r = 0; - var len = Math.min(str.length, end); - for (var i = start; i < len; i++) { - var c = str.charCodeAt(i) - 48; - - r *= mul; - - // 'a' - if (c >= 49) { - r += c - 49 + 0xa; - - // 'A' - } else if (c >= 17) { - r += c - 17 + 0xa; - - // '0' - '9' - } else { - r += c; - } - } - return r; - } - - BN.prototype._parseBase = function _parseBase (number, base, start) { - // Initialize as zero - this.words = [ 0 ]; - this.length = 1; - - // Find length of limb in base - for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { - limbLen++; - } - limbLen--; - limbPow = (limbPow / base) | 0; - - var total = number.length - start; - var mod = total % limbLen; - var end = Math.min(total, total - mod) + start; - - var word = 0; - for (var i = start; i < end; i += limbLen) { - word = parseBase(number, i, i + limbLen, base); - - this.imuln(limbPow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - if (mod !== 0) { - var pow = 1; - word = parseBase(number, i, number.length, base); - - for (i = 0; i < mod; i++) { - pow *= base; - } - - this.imuln(pow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - this.strip(); - }; - - BN.prototype.copy = function copy (dest) { - dest.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - dest.words[i] = this.words[i]; - } - dest.length = this.length; - dest.negative = this.negative; - dest.red = this.red; - }; - - BN.prototype.clone = function clone () { - var r = new BN(null); - this.copy(r); - return r; - }; - - BN.prototype._expand = function _expand (size) { - while (this.length < size) { - this.words[this.length++] = 0; - } - return this; - }; - - // Remove leading `0` from `this` - BN.prototype.strip = function strip () { - while (this.length > 1 && this.words[this.length - 1] === 0) { - this.length--; - } - return this._normSign(); - }; - - BN.prototype._normSign = function _normSign () { - // -0 = 0 - if (this.length === 1 && this.words[0] === 0) { - this.negative = 0; - } - return this; - }; - - BN.prototype.inspect = function inspect () { - return (this.red ? ''; - }; - - /* - - var zeros = []; - var groupSizes = []; - var groupBases = []; - - var s = ''; - var i = -1; - while (++i < BN.wordSize) { - zeros[i] = s; - s += '0'; - } - groupSizes[0] = 0; - groupSizes[1] = 0; - groupBases[0] = 0; - groupBases[1] = 0; - var base = 2 - 1; - while (++base < 36 + 1) { - var groupSize = 0; - var groupBase = 1; - while (groupBase < (1 << BN.wordSize) / base) { - groupBase *= base; - groupSize += 1; - } - groupSizes[base] = groupSize; - groupBases[base] = groupBase; - } - - */ - - 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' - ]; - - 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 - ]; - - 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 - ]; - - BN.prototype.toString = function toString (base, padding) { - base = base || 10; - padding = padding | 0 || 1; - - var out; - if (base === 16 || base === 'hex') { - out = ''; - var off = 0; - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = this.words[i]; - var word = (((w << off) | carry) & 0xffffff).toString(16); - carry = (w >>> (24 - off)) & 0xffffff; - if (carry !== 0 || i !== this.length - 1) { - out = zeros[6 - word.length] + word + out; - } else { - out = word + out; - } - off += 2; - if (off >= 26) { - off -= 26; - i--; - } - } - if (carry !== 0) { - out = carry.toString(16) + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - if (base === (base | 0) && base >= 2 && base <= 36) { - // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); - var groupSize = groupSizes[base]; - // var groupBase = Math.pow(base, groupSize); - var groupBase = groupBases[base]; - out = ''; - var c = this.clone(); - c.negative = 0; - while (!c.isZero()) { - var r = c.modn(groupBase).toString(base); - c = c.idivn(groupBase); - - if (!c.isZero()) { - out = zeros[groupSize - r.length] + r + out; - } else { - out = r + out; - } - } - if (this.isZero()) { - out = '0' + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - assert(false, 'Base should be between 2 and 36'); - }; - - BN.prototype.toNumber = function toNumber () { - var ret = this.words[0]; - if (this.length === 2) { - ret += this.words[1] * 0x4000000; - } else if (this.length === 3 && this.words[2] === 0x01) { - // NOTE: at this stage it is known that the top bit is set - ret += 0x10000000000000 + (this.words[1] * 0x4000000); - } else if (this.length > 2) { - assert(false, 'Number can only safely store up to 53 bits'); - } - return (this.negative !== 0) ? -ret : ret; - }; - - BN.prototype.toJSON = function toJSON () { - return this.toString(16); - }; - - BN.prototype.toBuffer = function toBuffer (endian, length) { - assert(typeof Buffer !== 'undefined'); - return this.toArrayLike(Buffer, endian, length); - }; - - BN.prototype.toArray = function toArray (endian, length) { - return this.toArrayLike(Array, endian, length); - }; - - BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { - var byteLength = this.byteLength(); - var reqLength = length || Math.max(1, byteLength); - assert(byteLength <= reqLength, 'byte array longer than desired length'); - assert(reqLength > 0, 'Requested array length <= 0'); - - this.strip(); - var littleEndian = endian === 'le'; - var res = new ArrayType(reqLength); - - var b, i; - var q = this.clone(); - if (!littleEndian) { - // Assume big-endian - for (i = 0; i < reqLength - byteLength; i++) { - res[i] = 0; - } - - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[reqLength - i - 1] = b; - } - } else { - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[i] = b; - } - - for (; i < reqLength; i++) { - res[i] = 0; - } - } - - return res; - }; - - if (Math.clz32) { - BN.prototype._countBits = function _countBits (w) { - return 32 - Math.clz32(w); - }; - } else { - BN.prototype._countBits = function _countBits (w) { - var t = w; - var r = 0; - if (t >= 0x1000) { - r += 13; - t >>>= 13; - } - if (t >= 0x40) { - r += 7; - t >>>= 7; - } - if (t >= 0x8) { - r += 4; - t >>>= 4; - } - if (t >= 0x02) { - r += 2; - t >>>= 2; - } - return r + t; - }; - } - - BN.prototype._zeroBits = function _zeroBits (w) { - // Short-cut - if (w === 0) return 26; - - var t = w; - var r = 0; - if ((t & 0x1fff) === 0) { - r += 13; - t >>>= 13; - } - if ((t & 0x7f) === 0) { - r += 7; - t >>>= 7; - } - if ((t & 0xf) === 0) { - r += 4; - t >>>= 4; - } - if ((t & 0x3) === 0) { - r += 2; - t >>>= 2; - } - if ((t & 0x1) === 0) { - r++; - } - return r; - }; - - // Return number of used bits in a BN - BN.prototype.bitLength = function bitLength () { - var w = this.words[this.length - 1]; - var hi = this._countBits(w); - return (this.length - 1) * 26 + hi; - }; - - function toBitArray (num) { - var w = new Array(num.bitLength()); - - for (var bit = 0; bit < w.length; bit++) { - var off = (bit / 26) | 0; - var wbit = bit % 26; - - w[bit] = (num.words[off] & (1 << wbit)) >>> wbit; - } - - return w; - } - - // Number of trailing zero bits - BN.prototype.zeroBits = function zeroBits () { - if (this.isZero()) return 0; - - var r = 0; - for (var i = 0; i < this.length; i++) { - var b = this._zeroBits(this.words[i]); - r += b; - if (b !== 26) break; - } - return r; - }; - - BN.prototype.byteLength = function byteLength () { - return Math.ceil(this.bitLength() / 8); - }; - - BN.prototype.toTwos = function toTwos (width) { - if (this.negative !== 0) { - return this.abs().inotn(width).iaddn(1); - } - return this.clone(); - }; - - BN.prototype.fromTwos = function fromTwos (width) { - if (this.testn(width - 1)) { - return this.notn(width).iaddn(1).ineg(); - } - return this.clone(); - }; - - BN.prototype.isNeg = function isNeg () { - return this.negative !== 0; - }; - - // Return negative clone of `this` - BN.prototype.neg = function neg () { - return this.clone().ineg(); - }; - - BN.prototype.ineg = function ineg () { - if (!this.isZero()) { - this.negative ^= 1; - } - - return this; - }; - - // Or `num` with `this` in-place - BN.prototype.iuor = function iuor (num) { - while (this.length < num.length) { - this.words[this.length++] = 0; - } - - for (var i = 0; i < num.length; i++) { - this.words[i] = this.words[i] | num.words[i]; - } - - return this.strip(); - }; - - BN.prototype.ior = function ior (num) { - assert((this.negative | num.negative) === 0); - return this.iuor(num); - }; - - // Or `num` with `this` - BN.prototype.or = function or (num) { - if (this.length > num.length) return this.clone().ior(num); - return num.clone().ior(this); - }; - - BN.prototype.uor = function uor (num) { - if (this.length > num.length) return this.clone().iuor(num); - return num.clone().iuor(this); - }; - - // And `num` with `this` in-place - BN.prototype.iuand = function iuand (num) { - // b = min-length(num, this) - var b; - if (this.length > num.length) { - b = num; - } else { - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = this.words[i] & num.words[i]; - } - - this.length = b.length; - - return this.strip(); - }; - - BN.prototype.iand = function iand (num) { - assert((this.negative | num.negative) === 0); - return this.iuand(num); - }; - - // And `num` with `this` - BN.prototype.and = function and (num) { - if (this.length > num.length) return this.clone().iand(num); - return num.clone().iand(this); - }; - - BN.prototype.uand = function uand (num) { - if (this.length > num.length) return this.clone().iuand(num); - return num.clone().iuand(this); - }; - - // Xor `num` with `this` in-place - BN.prototype.iuxor = function iuxor (num) { - // a.length > b.length - var a; - var b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = a.words[i] ^ b.words[i]; - } - - if (this !== a) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = a.length; - - return this.strip(); - }; - - BN.prototype.ixor = function ixor (num) { - assert((this.negative | num.negative) === 0); - return this.iuxor(num); - }; - - // Xor `num` with `this` - BN.prototype.xor = function xor (num) { - if (this.length > num.length) return this.clone().ixor(num); - return num.clone().ixor(this); - }; - - BN.prototype.uxor = function uxor (num) { - if (this.length > num.length) return this.clone().iuxor(num); - return num.clone().iuxor(this); - }; - - // Not ``this`` with ``width`` bitwidth - BN.prototype.inotn = function inotn (width) { - assert(typeof width === 'number' && width >= 0); - - var bytesNeeded = Math.ceil(width / 26) | 0; - var bitsLeft = width % 26; - - // Extend the buffer with leading zeroes - this._expand(bytesNeeded); - - if (bitsLeft > 0) { - bytesNeeded--; - } - - // Handle complete words - for (var i = 0; i < bytesNeeded; i++) { - this.words[i] = ~this.words[i] & 0x3ffffff; - } - - // Handle the residue - if (bitsLeft > 0) { - this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); - } - - // And remove leading zeroes - return this.strip(); - }; - - BN.prototype.notn = function notn (width) { - return this.clone().inotn(width); - }; - - // Set `bit` of `this` - BN.prototype.setn = function setn (bit, val) { - assert(typeof bit === 'number' && bit >= 0); - - var off = (bit / 26) | 0; - var wbit = bit % 26; - - this._expand(off + 1); - - if (val) { - this.words[off] = this.words[off] | (1 << wbit); - } else { - this.words[off] = this.words[off] & ~(1 << wbit); - } - - return this.strip(); - }; - - // Add `num` to `this` in-place - BN.prototype.iadd = function iadd (num) { - var r; - - // negative + positive - if (this.negative !== 0 && num.negative === 0) { - this.negative = 0; - r = this.isub(num); - this.negative ^= 1; - return this._normSign(); - - // positive + negative - } else if (this.negative === 0 && num.negative !== 0) { - num.negative = 0; - r = this.isub(num); - num.negative = 1; - return r._normSign(); - } - - // a.length > b.length - var a, b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) + (b.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - - this.length = a.length; - if (carry !== 0) { - this.words[this.length] = carry; - this.length++; - // Copy the rest of the words - } else if (a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - return this; - }; - - // Add `num` to `this` - BN.prototype.add = function add (num) { - var res; - if (num.negative !== 0 && this.negative === 0) { - num.negative = 0; - res = this.sub(num); - num.negative ^= 1; - return res; - } else if (num.negative === 0 && this.negative !== 0) { - this.negative = 0; - res = num.sub(this); - this.negative = 1; - return res; - } - - if (this.length > num.length) return this.clone().iadd(num); - - return num.clone().iadd(this); - }; - - // Subtract `num` from `this` in-place - BN.prototype.isub = function isub (num) { - // this - (-num) = this + num - if (num.negative !== 0) { - num.negative = 0; - var r = this.iadd(num); - num.negative = 1; - return r._normSign(); - - // -this - num = -(this + num) - } else if (this.negative !== 0) { - this.negative = 0; - this.iadd(num); - this.negative = 1; - return this._normSign(); - } - - // At this point both numbers are positive - var cmp = this.cmp(num); - - // Optimization - zeroify - if (cmp === 0) { - this.negative = 0; - this.length = 1; - this.words[0] = 0; - return this; - } - - // a > b - var a, b; - if (cmp > 0) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) - (b.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - - // Copy rest of the words - if (carry === 0 && i < a.length && a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = Math.max(this.length, i); - - if (a !== this) { - this.negative = 1; - } - - return this.strip(); - }; - - // Subtract `num` from `this` - BN.prototype.sub = function sub (num) { - return this.clone().isub(num); - }; - - function smallMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - var len = (self.length + num.length) | 0; - out.length = len; - len = (len - 1) | 0; - - // Peel one iteration (compiler can't do it, because of code complexity) - var a = self.words[0] | 0; - var b = num.words[0] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - var carry = (r / 0x4000000) | 0; - out.words[0] = lo; - - for (var k = 1; k < len; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = carry >>> 26; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = (k - j) | 0; - a = self.words[i] | 0; - b = num.words[j] | 0; - r = a * b + rword; - ncarry += (r / 0x4000000) | 0; - rword = r & 0x3ffffff; - } - out.words[k] = rword | 0; - carry = ncarry | 0; - } - if (carry !== 0) { - out.words[k] = carry | 0; - } else { - out.length--; - } - - return out.strip(); - } - - // TODO(indutny): it may be reasonable to omit it for users who don't need - // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit - // multiplication (like elliptic secp256k1). - var comb10MulTo = function comb10MulTo (self, num, out) { - var a = self.words; - var b = num.words; - var o = out.words; - var c = 0; - var lo; - var mid; - var hi; - var a0 = a[0] | 0; - var al0 = a0 & 0x1fff; - var ah0 = a0 >>> 13; - var a1 = a[1] | 0; - var al1 = a1 & 0x1fff; - var ah1 = a1 >>> 13; - var a2 = a[2] | 0; - var al2 = a2 & 0x1fff; - var ah2 = a2 >>> 13; - var a3 = a[3] | 0; - var al3 = a3 & 0x1fff; - var ah3 = a3 >>> 13; - var a4 = a[4] | 0; - var al4 = a4 & 0x1fff; - var ah4 = a4 >>> 13; - var a5 = a[5] | 0; - var al5 = a5 & 0x1fff; - var ah5 = a5 >>> 13; - var a6 = a[6] | 0; - var al6 = a6 & 0x1fff; - var ah6 = a6 >>> 13; - var a7 = a[7] | 0; - var al7 = a7 & 0x1fff; - var ah7 = a7 >>> 13; - var a8 = a[8] | 0; - var al8 = a8 & 0x1fff; - var ah8 = a8 >>> 13; - var a9 = a[9] | 0; - var al9 = a9 & 0x1fff; - var ah9 = a9 >>> 13; - var b0 = b[0] | 0; - var bl0 = b0 & 0x1fff; - var bh0 = b0 >>> 13; - var b1 = b[1] | 0; - var bl1 = b1 & 0x1fff; - var bh1 = b1 >>> 13; - var b2 = b[2] | 0; - var bl2 = b2 & 0x1fff; - var bh2 = b2 >>> 13; - var b3 = b[3] | 0; - var bl3 = b3 & 0x1fff; - var bh3 = b3 >>> 13; - var b4 = b[4] | 0; - var bl4 = b4 & 0x1fff; - var bh4 = b4 >>> 13; - var b5 = b[5] | 0; - var bl5 = b5 & 0x1fff; - var bh5 = b5 >>> 13; - var b6 = b[6] | 0; - var bl6 = b6 & 0x1fff; - var bh6 = b6 >>> 13; - var b7 = b[7] | 0; - var bl7 = b7 & 0x1fff; - var bh7 = b7 >>> 13; - var b8 = b[8] | 0; - var bl8 = b8 & 0x1fff; - var bh8 = b8 >>> 13; - var b9 = b[9] | 0; - var bl9 = b9 & 0x1fff; - var bh9 = b9 >>> 13; - - out.negative = self.negative ^ num.negative; - out.length = 19; - /* k = 0 */ - lo = Math.imul(al0, bl0); - mid = Math.imul(al0, bh0); - mid = (mid + Math.imul(ah0, bl0)) | 0; - hi = Math.imul(ah0, bh0); - var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; - w0 &= 0x3ffffff; - /* k = 1 */ - lo = Math.imul(al1, bl0); - mid = Math.imul(al1, bh0); - mid = (mid + Math.imul(ah1, bl0)) | 0; - hi = Math.imul(ah1, bh0); - lo = (lo + Math.imul(al0, bl1)) | 0; - mid = (mid + Math.imul(al0, bh1)) | 0; - mid = (mid + Math.imul(ah0, bl1)) | 0; - hi = (hi + Math.imul(ah0, bh1)) | 0; - var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; - w1 &= 0x3ffffff; - /* k = 2 */ - lo = Math.imul(al2, bl0); - mid = Math.imul(al2, bh0); - mid = (mid + Math.imul(ah2, bl0)) | 0; - hi = Math.imul(ah2, bh0); - lo = (lo + Math.imul(al1, bl1)) | 0; - mid = (mid + Math.imul(al1, bh1)) | 0; - mid = (mid + Math.imul(ah1, bl1)) | 0; - hi = (hi + Math.imul(ah1, bh1)) | 0; - lo = (lo + Math.imul(al0, bl2)) | 0; - mid = (mid + Math.imul(al0, bh2)) | 0; - mid = (mid + Math.imul(ah0, bl2)) | 0; - hi = (hi + Math.imul(ah0, bh2)) | 0; - var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; - w2 &= 0x3ffffff; - /* k = 3 */ - lo = Math.imul(al3, bl0); - mid = Math.imul(al3, bh0); - mid = (mid + Math.imul(ah3, bl0)) | 0; - hi = Math.imul(ah3, bh0); - lo = (lo + Math.imul(al2, bl1)) | 0; - mid = (mid + Math.imul(al2, bh1)) | 0; - mid = (mid + Math.imul(ah2, bl1)) | 0; - hi = (hi + Math.imul(ah2, bh1)) | 0; - lo = (lo + Math.imul(al1, bl2)) | 0; - mid = (mid + Math.imul(al1, bh2)) | 0; - mid = (mid + Math.imul(ah1, bl2)) | 0; - hi = (hi + Math.imul(ah1, bh2)) | 0; - lo = (lo + Math.imul(al0, bl3)) | 0; - mid = (mid + Math.imul(al0, bh3)) | 0; - mid = (mid + Math.imul(ah0, bl3)) | 0; - hi = (hi + Math.imul(ah0, bh3)) | 0; - var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; - w3 &= 0x3ffffff; - /* k = 4 */ - lo = Math.imul(al4, bl0); - mid = Math.imul(al4, bh0); - mid = (mid + Math.imul(ah4, bl0)) | 0; - hi = Math.imul(ah4, bh0); - lo = (lo + Math.imul(al3, bl1)) | 0; - mid = (mid + Math.imul(al3, bh1)) | 0; - mid = (mid + Math.imul(ah3, bl1)) | 0; - hi = (hi + Math.imul(ah3, bh1)) | 0; - lo = (lo + Math.imul(al2, bl2)) | 0; - mid = (mid + Math.imul(al2, bh2)) | 0; - mid = (mid + Math.imul(ah2, bl2)) | 0; - hi = (hi + Math.imul(ah2, bh2)) | 0; - lo = (lo + Math.imul(al1, bl3)) | 0; - mid = (mid + Math.imul(al1, bh3)) | 0; - mid = (mid + Math.imul(ah1, bl3)) | 0; - hi = (hi + Math.imul(ah1, bh3)) | 0; - lo = (lo + Math.imul(al0, bl4)) | 0; - mid = (mid + Math.imul(al0, bh4)) | 0; - mid = (mid + Math.imul(ah0, bl4)) | 0; - hi = (hi + Math.imul(ah0, bh4)) | 0; - var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; - w4 &= 0x3ffffff; - /* k = 5 */ - lo = Math.imul(al5, bl0); - mid = Math.imul(al5, bh0); - mid = (mid + Math.imul(ah5, bl0)) | 0; - hi = Math.imul(ah5, bh0); - lo = (lo + Math.imul(al4, bl1)) | 0; - mid = (mid + Math.imul(al4, bh1)) | 0; - mid = (mid + Math.imul(ah4, bl1)) | 0; - hi = (hi + Math.imul(ah4, bh1)) | 0; - lo = (lo + Math.imul(al3, bl2)) | 0; - mid = (mid + Math.imul(al3, bh2)) | 0; - mid = (mid + Math.imul(ah3, bl2)) | 0; - hi = (hi + Math.imul(ah3, bh2)) | 0; - lo = (lo + Math.imul(al2, bl3)) | 0; - mid = (mid + Math.imul(al2, bh3)) | 0; - mid = (mid + Math.imul(ah2, bl3)) | 0; - hi = (hi + Math.imul(ah2, bh3)) | 0; - lo = (lo + Math.imul(al1, bl4)) | 0; - mid = (mid + Math.imul(al1, bh4)) | 0; - mid = (mid + Math.imul(ah1, bl4)) | 0; - hi = (hi + Math.imul(ah1, bh4)) | 0; - lo = (lo + Math.imul(al0, bl5)) | 0; - mid = (mid + Math.imul(al0, bh5)) | 0; - mid = (mid + Math.imul(ah0, bl5)) | 0; - hi = (hi + Math.imul(ah0, bh5)) | 0; - var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; - w5 &= 0x3ffffff; - /* k = 6 */ - lo = Math.imul(al6, bl0); - mid = Math.imul(al6, bh0); - mid = (mid + Math.imul(ah6, bl0)) | 0; - hi = Math.imul(ah6, bh0); - lo = (lo + Math.imul(al5, bl1)) | 0; - mid = (mid + Math.imul(al5, bh1)) | 0; - mid = (mid + Math.imul(ah5, bl1)) | 0; - hi = (hi + Math.imul(ah5, bh1)) | 0; - lo = (lo + Math.imul(al4, bl2)) | 0; - mid = (mid + Math.imul(al4, bh2)) | 0; - mid = (mid + Math.imul(ah4, bl2)) | 0; - hi = (hi + Math.imul(ah4, bh2)) | 0; - lo = (lo + Math.imul(al3, bl3)) | 0; - mid = (mid + Math.imul(al3, bh3)) | 0; - mid = (mid + Math.imul(ah3, bl3)) | 0; - hi = (hi + Math.imul(ah3, bh3)) | 0; - lo = (lo + Math.imul(al2, bl4)) | 0; - mid = (mid + Math.imul(al2, bh4)) | 0; - mid = (mid + Math.imul(ah2, bl4)) | 0; - hi = (hi + Math.imul(ah2, bh4)) | 0; - lo = (lo + Math.imul(al1, bl5)) | 0; - mid = (mid + Math.imul(al1, bh5)) | 0; - mid = (mid + Math.imul(ah1, bl5)) | 0; - hi = (hi + Math.imul(ah1, bh5)) | 0; - lo = (lo + Math.imul(al0, bl6)) | 0; - mid = (mid + Math.imul(al0, bh6)) | 0; - mid = (mid + Math.imul(ah0, bl6)) | 0; - hi = (hi + Math.imul(ah0, bh6)) | 0; - var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; - w6 &= 0x3ffffff; - /* k = 7 */ - lo = Math.imul(al7, bl0); - mid = Math.imul(al7, bh0); - mid = (mid + Math.imul(ah7, bl0)) | 0; - hi = Math.imul(ah7, bh0); - lo = (lo + Math.imul(al6, bl1)) | 0; - mid = (mid + Math.imul(al6, bh1)) | 0; - mid = (mid + Math.imul(ah6, bl1)) | 0; - hi = (hi + Math.imul(ah6, bh1)) | 0; - lo = (lo + Math.imul(al5, bl2)) | 0; - mid = (mid + Math.imul(al5, bh2)) | 0; - mid = (mid + Math.imul(ah5, bl2)) | 0; - hi = (hi + Math.imul(ah5, bh2)) | 0; - lo = (lo + Math.imul(al4, bl3)) | 0; - mid = (mid + Math.imul(al4, bh3)) | 0; - mid = (mid + Math.imul(ah4, bl3)) | 0; - hi = (hi + Math.imul(ah4, bh3)) | 0; - lo = (lo + Math.imul(al3, bl4)) | 0; - mid = (mid + Math.imul(al3, bh4)) | 0; - mid = (mid + Math.imul(ah3, bl4)) | 0; - hi = (hi + Math.imul(ah3, bh4)) | 0; - lo = (lo + Math.imul(al2, bl5)) | 0; - mid = (mid + Math.imul(al2, bh5)) | 0; - mid = (mid + Math.imul(ah2, bl5)) | 0; - hi = (hi + Math.imul(ah2, bh5)) | 0; - lo = (lo + Math.imul(al1, bl6)) | 0; - mid = (mid + Math.imul(al1, bh6)) | 0; - mid = (mid + Math.imul(ah1, bl6)) | 0; - hi = (hi + Math.imul(ah1, bh6)) | 0; - lo = (lo + Math.imul(al0, bl7)) | 0; - mid = (mid + Math.imul(al0, bh7)) | 0; - mid = (mid + Math.imul(ah0, bl7)) | 0; - hi = (hi + Math.imul(ah0, bh7)) | 0; - var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; - w7 &= 0x3ffffff; - /* k = 8 */ - lo = Math.imul(al8, bl0); - mid = Math.imul(al8, bh0); - mid = (mid + Math.imul(ah8, bl0)) | 0; - hi = Math.imul(ah8, bh0); - lo = (lo + Math.imul(al7, bl1)) | 0; - mid = (mid + Math.imul(al7, bh1)) | 0; - mid = (mid + Math.imul(ah7, bl1)) | 0; - hi = (hi + Math.imul(ah7, bh1)) | 0; - lo = (lo + Math.imul(al6, bl2)) | 0; - mid = (mid + Math.imul(al6, bh2)) | 0; - mid = (mid + Math.imul(ah6, bl2)) | 0; - hi = (hi + Math.imul(ah6, bh2)) | 0; - lo = (lo + Math.imul(al5, bl3)) | 0; - mid = (mid + Math.imul(al5, bh3)) | 0; - mid = (mid + Math.imul(ah5, bl3)) | 0; - hi = (hi + Math.imul(ah5, bh3)) | 0; - lo = (lo + Math.imul(al4, bl4)) | 0; - mid = (mid + Math.imul(al4, bh4)) | 0; - mid = (mid + Math.imul(ah4, bl4)) | 0; - hi = (hi + Math.imul(ah4, bh4)) | 0; - lo = (lo + Math.imul(al3, bl5)) | 0; - mid = (mid + Math.imul(al3, bh5)) | 0; - mid = (mid + Math.imul(ah3, bl5)) | 0; - hi = (hi + Math.imul(ah3, bh5)) | 0; - lo = (lo + Math.imul(al2, bl6)) | 0; - mid = (mid + Math.imul(al2, bh6)) | 0; - mid = (mid + Math.imul(ah2, bl6)) | 0; - hi = (hi + Math.imul(ah2, bh6)) | 0; - lo = (lo + Math.imul(al1, bl7)) | 0; - mid = (mid + Math.imul(al1, bh7)) | 0; - mid = (mid + Math.imul(ah1, bl7)) | 0; - hi = (hi + Math.imul(ah1, bh7)) | 0; - lo = (lo + Math.imul(al0, bl8)) | 0; - mid = (mid + Math.imul(al0, bh8)) | 0; - mid = (mid + Math.imul(ah0, bl8)) | 0; - hi = (hi + Math.imul(ah0, bh8)) | 0; - var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; - w8 &= 0x3ffffff; - /* k = 9 */ - lo = Math.imul(al9, bl0); - mid = Math.imul(al9, bh0); - mid = (mid + Math.imul(ah9, bl0)) | 0; - hi = Math.imul(ah9, bh0); - lo = (lo + Math.imul(al8, bl1)) | 0; - mid = (mid + Math.imul(al8, bh1)) | 0; - mid = (mid + Math.imul(ah8, bl1)) | 0; - hi = (hi + Math.imul(ah8, bh1)) | 0; - lo = (lo + Math.imul(al7, bl2)) | 0; - mid = (mid + Math.imul(al7, bh2)) | 0; - mid = (mid + Math.imul(ah7, bl2)) | 0; - hi = (hi + Math.imul(ah7, bh2)) | 0; - lo = (lo + Math.imul(al6, bl3)) | 0; - mid = (mid + Math.imul(al6, bh3)) | 0; - mid = (mid + Math.imul(ah6, bl3)) | 0; - hi = (hi + Math.imul(ah6, bh3)) | 0; - lo = (lo + Math.imul(al5, bl4)) | 0; - mid = (mid + Math.imul(al5, bh4)) | 0; - mid = (mid + Math.imul(ah5, bl4)) | 0; - hi = (hi + Math.imul(ah5, bh4)) | 0; - lo = (lo + Math.imul(al4, bl5)) | 0; - mid = (mid + Math.imul(al4, bh5)) | 0; - mid = (mid + Math.imul(ah4, bl5)) | 0; - hi = (hi + Math.imul(ah4, bh5)) | 0; - lo = (lo + Math.imul(al3, bl6)) | 0; - mid = (mid + Math.imul(al3, bh6)) | 0; - mid = (mid + Math.imul(ah3, bl6)) | 0; - hi = (hi + Math.imul(ah3, bh6)) | 0; - lo = (lo + Math.imul(al2, bl7)) | 0; - mid = (mid + Math.imul(al2, bh7)) | 0; - mid = (mid + Math.imul(ah2, bl7)) | 0; - hi = (hi + Math.imul(ah2, bh7)) | 0; - lo = (lo + Math.imul(al1, bl8)) | 0; - mid = (mid + Math.imul(al1, bh8)) | 0; - mid = (mid + Math.imul(ah1, bl8)) | 0; - hi = (hi + Math.imul(ah1, bh8)) | 0; - lo = (lo + Math.imul(al0, bl9)) | 0; - mid = (mid + Math.imul(al0, bh9)) | 0; - mid = (mid + Math.imul(ah0, bl9)) | 0; - hi = (hi + Math.imul(ah0, bh9)) | 0; - var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; - w9 &= 0x3ffffff; - /* k = 10 */ - lo = Math.imul(al9, bl1); - mid = Math.imul(al9, bh1); - mid = (mid + Math.imul(ah9, bl1)) | 0; - hi = Math.imul(ah9, bh1); - lo = (lo + Math.imul(al8, bl2)) | 0; - mid = (mid + Math.imul(al8, bh2)) | 0; - mid = (mid + Math.imul(ah8, bl2)) | 0; - hi = (hi + Math.imul(ah8, bh2)) | 0; - lo = (lo + Math.imul(al7, bl3)) | 0; - mid = (mid + Math.imul(al7, bh3)) | 0; - mid = (mid + Math.imul(ah7, bl3)) | 0; - hi = (hi + Math.imul(ah7, bh3)) | 0; - lo = (lo + Math.imul(al6, bl4)) | 0; - mid = (mid + Math.imul(al6, bh4)) | 0; - mid = (mid + Math.imul(ah6, bl4)) | 0; - hi = (hi + Math.imul(ah6, bh4)) | 0; - lo = (lo + Math.imul(al5, bl5)) | 0; - mid = (mid + Math.imul(al5, bh5)) | 0; - mid = (mid + Math.imul(ah5, bl5)) | 0; - hi = (hi + Math.imul(ah5, bh5)) | 0; - lo = (lo + Math.imul(al4, bl6)) | 0; - mid = (mid + Math.imul(al4, bh6)) | 0; - mid = (mid + Math.imul(ah4, bl6)) | 0; - hi = (hi + Math.imul(ah4, bh6)) | 0; - lo = (lo + Math.imul(al3, bl7)) | 0; - mid = (mid + Math.imul(al3, bh7)) | 0; - mid = (mid + Math.imul(ah3, bl7)) | 0; - hi = (hi + Math.imul(ah3, bh7)) | 0; - lo = (lo + Math.imul(al2, bl8)) | 0; - mid = (mid + Math.imul(al2, bh8)) | 0; - mid = (mid + Math.imul(ah2, bl8)) | 0; - hi = (hi + Math.imul(ah2, bh8)) | 0; - lo = (lo + Math.imul(al1, bl9)) | 0; - mid = (mid + Math.imul(al1, bh9)) | 0; - mid = (mid + Math.imul(ah1, bl9)) | 0; - hi = (hi + Math.imul(ah1, bh9)) | 0; - var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; - w10 &= 0x3ffffff; - /* k = 11 */ - lo = Math.imul(al9, bl2); - mid = Math.imul(al9, bh2); - mid = (mid + Math.imul(ah9, bl2)) | 0; - hi = Math.imul(ah9, bh2); - lo = (lo + Math.imul(al8, bl3)) | 0; - mid = (mid + Math.imul(al8, bh3)) | 0; - mid = (mid + Math.imul(ah8, bl3)) | 0; - hi = (hi + Math.imul(ah8, bh3)) | 0; - lo = (lo + Math.imul(al7, bl4)) | 0; - mid = (mid + Math.imul(al7, bh4)) | 0; - mid = (mid + Math.imul(ah7, bl4)) | 0; - hi = (hi + Math.imul(ah7, bh4)) | 0; - lo = (lo + Math.imul(al6, bl5)) | 0; - mid = (mid + Math.imul(al6, bh5)) | 0; - mid = (mid + Math.imul(ah6, bl5)) | 0; - hi = (hi + Math.imul(ah6, bh5)) | 0; - lo = (lo + Math.imul(al5, bl6)) | 0; - mid = (mid + Math.imul(al5, bh6)) | 0; - mid = (mid + Math.imul(ah5, bl6)) | 0; - hi = (hi + Math.imul(ah5, bh6)) | 0; - lo = (lo + Math.imul(al4, bl7)) | 0; - mid = (mid + Math.imul(al4, bh7)) | 0; - mid = (mid + Math.imul(ah4, bl7)) | 0; - hi = (hi + Math.imul(ah4, bh7)) | 0; - lo = (lo + Math.imul(al3, bl8)) | 0; - mid = (mid + Math.imul(al3, bh8)) | 0; - mid = (mid + Math.imul(ah3, bl8)) | 0; - hi = (hi + Math.imul(ah3, bh8)) | 0; - lo = (lo + Math.imul(al2, bl9)) | 0; - mid = (mid + Math.imul(al2, bh9)) | 0; - mid = (mid + Math.imul(ah2, bl9)) | 0; - hi = (hi + Math.imul(ah2, bh9)) | 0; - var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; - w11 &= 0x3ffffff; - /* k = 12 */ - lo = Math.imul(al9, bl3); - mid = Math.imul(al9, bh3); - mid = (mid + Math.imul(ah9, bl3)) | 0; - hi = Math.imul(ah9, bh3); - lo = (lo + Math.imul(al8, bl4)) | 0; - mid = (mid + Math.imul(al8, bh4)) | 0; - mid = (mid + Math.imul(ah8, bl4)) | 0; - hi = (hi + Math.imul(ah8, bh4)) | 0; - lo = (lo + Math.imul(al7, bl5)) | 0; - mid = (mid + Math.imul(al7, bh5)) | 0; - mid = (mid + Math.imul(ah7, bl5)) | 0; - hi = (hi + Math.imul(ah7, bh5)) | 0; - lo = (lo + Math.imul(al6, bl6)) | 0; - mid = (mid + Math.imul(al6, bh6)) | 0; - mid = (mid + Math.imul(ah6, bl6)) | 0; - hi = (hi + Math.imul(ah6, bh6)) | 0; - lo = (lo + Math.imul(al5, bl7)) | 0; - mid = (mid + Math.imul(al5, bh7)) | 0; - mid = (mid + Math.imul(ah5, bl7)) | 0; - hi = (hi + Math.imul(ah5, bh7)) | 0; - lo = (lo + Math.imul(al4, bl8)) | 0; - mid = (mid + Math.imul(al4, bh8)) | 0; - mid = (mid + Math.imul(ah4, bl8)) | 0; - hi = (hi + Math.imul(ah4, bh8)) | 0; - lo = (lo + Math.imul(al3, bl9)) | 0; - mid = (mid + Math.imul(al3, bh9)) | 0; - mid = (mid + Math.imul(ah3, bl9)) | 0; - hi = (hi + Math.imul(ah3, bh9)) | 0; - var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; - w12 &= 0x3ffffff; - /* k = 13 */ - lo = Math.imul(al9, bl4); - mid = Math.imul(al9, bh4); - mid = (mid + Math.imul(ah9, bl4)) | 0; - hi = Math.imul(ah9, bh4); - lo = (lo + Math.imul(al8, bl5)) | 0; - mid = (mid + Math.imul(al8, bh5)) | 0; - mid = (mid + Math.imul(ah8, bl5)) | 0; - hi = (hi + Math.imul(ah8, bh5)) | 0; - lo = (lo + Math.imul(al7, bl6)) | 0; - mid = (mid + Math.imul(al7, bh6)) | 0; - mid = (mid + Math.imul(ah7, bl6)) | 0; - hi = (hi + Math.imul(ah7, bh6)) | 0; - lo = (lo + Math.imul(al6, bl7)) | 0; - mid = (mid + Math.imul(al6, bh7)) | 0; - mid = (mid + Math.imul(ah6, bl7)) | 0; - hi = (hi + Math.imul(ah6, bh7)) | 0; - lo = (lo + Math.imul(al5, bl8)) | 0; - mid = (mid + Math.imul(al5, bh8)) | 0; - mid = (mid + Math.imul(ah5, bl8)) | 0; - hi = (hi + Math.imul(ah5, bh8)) | 0; - lo = (lo + Math.imul(al4, bl9)) | 0; - mid = (mid + Math.imul(al4, bh9)) | 0; - mid = (mid + Math.imul(ah4, bl9)) | 0; - hi = (hi + Math.imul(ah4, bh9)) | 0; - var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; - w13 &= 0x3ffffff; - /* k = 14 */ - lo = Math.imul(al9, bl5); - mid = Math.imul(al9, bh5); - mid = (mid + Math.imul(ah9, bl5)) | 0; - hi = Math.imul(ah9, bh5); - lo = (lo + Math.imul(al8, bl6)) | 0; - mid = (mid + Math.imul(al8, bh6)) | 0; - mid = (mid + Math.imul(ah8, bl6)) | 0; - hi = (hi + Math.imul(ah8, bh6)) | 0; - lo = (lo + Math.imul(al7, bl7)) | 0; - mid = (mid + Math.imul(al7, bh7)) | 0; - mid = (mid + Math.imul(ah7, bl7)) | 0; - hi = (hi + Math.imul(ah7, bh7)) | 0; - lo = (lo + Math.imul(al6, bl8)) | 0; - mid = (mid + Math.imul(al6, bh8)) | 0; - mid = (mid + Math.imul(ah6, bl8)) | 0; - hi = (hi + Math.imul(ah6, bh8)) | 0; - lo = (lo + Math.imul(al5, bl9)) | 0; - mid = (mid + Math.imul(al5, bh9)) | 0; - mid = (mid + Math.imul(ah5, bl9)) | 0; - hi = (hi + Math.imul(ah5, bh9)) | 0; - var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; - w14 &= 0x3ffffff; - /* k = 15 */ - lo = Math.imul(al9, bl6); - mid = Math.imul(al9, bh6); - mid = (mid + Math.imul(ah9, bl6)) | 0; - hi = Math.imul(ah9, bh6); - lo = (lo + Math.imul(al8, bl7)) | 0; - mid = (mid + Math.imul(al8, bh7)) | 0; - mid = (mid + Math.imul(ah8, bl7)) | 0; - hi = (hi + Math.imul(ah8, bh7)) | 0; - lo = (lo + Math.imul(al7, bl8)) | 0; - mid = (mid + Math.imul(al7, bh8)) | 0; - mid = (mid + Math.imul(ah7, bl8)) | 0; - hi = (hi + Math.imul(ah7, bh8)) | 0; - lo = (lo + Math.imul(al6, bl9)) | 0; - mid = (mid + Math.imul(al6, bh9)) | 0; - mid = (mid + Math.imul(ah6, bl9)) | 0; - hi = (hi + Math.imul(ah6, bh9)) | 0; - var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; - w15 &= 0x3ffffff; - /* k = 16 */ - lo = Math.imul(al9, bl7); - mid = Math.imul(al9, bh7); - mid = (mid + Math.imul(ah9, bl7)) | 0; - hi = Math.imul(ah9, bh7); - lo = (lo + Math.imul(al8, bl8)) | 0; - mid = (mid + Math.imul(al8, bh8)) | 0; - mid = (mid + Math.imul(ah8, bl8)) | 0; - hi = (hi + Math.imul(ah8, bh8)) | 0; - lo = (lo + Math.imul(al7, bl9)) | 0; - mid = (mid + Math.imul(al7, bh9)) | 0; - mid = (mid + Math.imul(ah7, bl9)) | 0; - hi = (hi + Math.imul(ah7, bh9)) | 0; - var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; - w16 &= 0x3ffffff; - /* k = 17 */ - lo = Math.imul(al9, bl8); - mid = Math.imul(al9, bh8); - mid = (mid + Math.imul(ah9, bl8)) | 0; - hi = Math.imul(ah9, bh8); - lo = (lo + Math.imul(al8, bl9)) | 0; - mid = (mid + Math.imul(al8, bh9)) | 0; - mid = (mid + Math.imul(ah8, bl9)) | 0; - hi = (hi + Math.imul(ah8, bh9)) | 0; - var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; - w17 &= 0x3ffffff; - /* k = 18 */ - lo = Math.imul(al9, bl9); - mid = Math.imul(al9, bh9); - mid = (mid + Math.imul(ah9, bl9)) | 0; - hi = Math.imul(ah9, bh9); - var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; - w18 &= 0x3ffffff; - o[0] = w0; - o[1] = w1; - o[2] = w2; - o[3] = w3; - o[4] = w4; - o[5] = w5; - o[6] = w6; - o[7] = w7; - o[8] = w8; - o[9] = w9; - o[10] = w10; - o[11] = w11; - o[12] = w12; - o[13] = w13; - o[14] = w14; - o[15] = w15; - o[16] = w16; - o[17] = w17; - o[18] = w18; - if (c !== 0) { - o[19] = c; - out.length++; - } - return out; - }; - - // Polyfill comb - if (!Math.imul) { - comb10MulTo = smallMulTo; - } - - function bigMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - out.length = self.length + num.length; - - var carry = 0; - var hncarry = 0; - for (var k = 0; k < out.length - 1; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = hncarry; - hncarry = 0; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = k - j; - var a = self.words[i] | 0; - var b = num.words[j] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; - lo = (lo + rword) | 0; - rword = lo & 0x3ffffff; - ncarry = (ncarry + (lo >>> 26)) | 0; - - hncarry += ncarry >>> 26; - ncarry &= 0x3ffffff; - } - out.words[k] = rword; - carry = ncarry; - ncarry = hncarry; - } - if (carry !== 0) { - out.words[k] = carry; - } else { - out.length--; - } - - return out.strip(); - } - - function jumboMulTo (self, num, out) { - var fftm = new FFTM(); - return fftm.mulp(self, num, out); - } - - BN.prototype.mulTo = function mulTo (num, out) { - var res; - var len = this.length + num.length; - if (this.length === 10 && num.length === 10) { - res = comb10MulTo(this, num, out); - } else if (len < 63) { - res = smallMulTo(this, num, out); - } else if (len < 1024) { - res = bigMulTo(this, num, out); - } else { - res = jumboMulTo(this, num, out); - } - - return res; - }; - - // Cooley-Tukey algorithm for FFT - // slightly revisited to rely on looping instead of recursion - - function FFTM (x, y) { - this.x = x; - this.y = y; - } - - FFTM.prototype.makeRBT = function makeRBT (N) { - var t = new Array(N); - var l = BN.prototype._countBits(N) - 1; - for (var i = 0; i < N; i++) { - t[i] = this.revBin(i, l, N); - } - - return t; - }; - - // Returns binary-reversed representation of `x` - FFTM.prototype.revBin = function revBin (x, l, N) { - if (x === 0 || x === N - 1) return x; - - var rb = 0; - for (var i = 0; i < l; i++) { - rb |= (x & 1) << (l - i - 1); - x >>= 1; - } - - return rb; - }; - - // Performs "tweedling" phase, therefore 'emulating' - // behaviour of the recursive algorithm - FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { - for (var i = 0; i < N; i++) { - rtws[i] = rws[rbt[i]]; - itws[i] = iws[rbt[i]]; - } - }; - - FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { - this.permute(rbt, rws, iws, rtws, itws, N); - - for (var s = 1; s < N; s <<= 1) { - var l = s << 1; - - var rtwdf = Math.cos(2 * Math.PI / l); - var itwdf = Math.sin(2 * Math.PI / l); - - for (var p = 0; p < N; p += l) { - var rtwdf_ = rtwdf; - var itwdf_ = itwdf; - - for (var j = 0; j < s; j++) { - var re = rtws[p + j]; - var ie = itws[p + j]; - - var ro = rtws[p + j + s]; - var io = itws[p + j + s]; - - var rx = rtwdf_ * ro - itwdf_ * io; - - io = rtwdf_ * io + itwdf_ * ro; - ro = rx; - - rtws[p + j] = re + ro; - itws[p + j] = ie + io; - - rtws[p + j + s] = re - ro; - itws[p + j + s] = ie - io; - - /* jshint maxdepth : false */ - if (j !== l) { - rx = rtwdf * rtwdf_ - itwdf * itwdf_; - - itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; - rtwdf_ = rx; - } - } - } - } - }; - - FFTM.prototype.guessLen13b = function guessLen13b (n, m) { - var N = Math.max(m, n) | 1; - var odd = N & 1; - var i = 0; - for (N = N / 2 | 0; N; N = N >>> 1) { - i++; - } - - return 1 << i + 1 + odd; - }; - - FFTM.prototype.conjugate = function conjugate (rws, iws, N) { - if (N <= 1) return; - - for (var i = 0; i < N / 2; i++) { - var t = rws[i]; - - rws[i] = rws[N - i - 1]; - rws[N - i - 1] = t; - - t = iws[i]; - - iws[i] = -iws[N - i - 1]; - iws[N - i - 1] = -t; - } - }; - - FFTM.prototype.normalize13b = function normalize13b (ws, N) { - var carry = 0; - for (var i = 0; i < N / 2; i++) { - var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + - Math.round(ws[2 * i] / N) + - carry; - - ws[i] = w & 0x3ffffff; - - if (w < 0x4000000) { - carry = 0; - } else { - carry = w / 0x4000000 | 0; - } - } - - return ws; - }; - - FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { - var carry = 0; - for (var i = 0; i < len; i++) { - carry = carry + (ws[i] | 0); - - rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; - rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; - } - - // Pad with zeroes - for (i = 2 * len; i < N; ++i) { - rws[i] = 0; - } - - assert(carry === 0); - assert((carry & ~0x1fff) === 0); - }; - - FFTM.prototype.stub = function stub (N) { - var ph = new Array(N); - for (var i = 0; i < N; i++) { - ph[i] = 0; - } - - return ph; - }; - - FFTM.prototype.mulp = function mulp (x, y, out) { - var N = 2 * this.guessLen13b(x.length, y.length); - - var rbt = this.makeRBT(N); - - var _ = this.stub(N); - - var rws = new Array(N); - var rwst = new Array(N); - var iwst = new Array(N); - - var nrws = new Array(N); - var nrwst = new Array(N); - var niwst = new Array(N); - - var rmws = out.words; - rmws.length = N; - - this.convert13b(x.words, x.length, rws, N); - this.convert13b(y.words, y.length, nrws, N); - - this.transform(rws, _, rwst, iwst, N, rbt); - this.transform(nrws, _, nrwst, niwst, N, rbt); - - for (var i = 0; i < N; i++) { - var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; - iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; - rwst[i] = rx; - } - - this.conjugate(rwst, iwst, N); - this.transform(rwst, iwst, rmws, _, N, rbt); - this.conjugate(rmws, _, N); - this.normalize13b(rmws, N); - - out.negative = x.negative ^ y.negative; - out.length = x.length + y.length; - return out.strip(); - }; - - // Multiply `this` by `num` - BN.prototype.mul = function mul (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return this.mulTo(num, out); - }; - - // Multiply employing FFT - BN.prototype.mulf = function mulf (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return jumboMulTo(this, num, out); - }; - - // In-place Multiplication - BN.prototype.imul = function imul (num) { - return this.clone().mulTo(num, this); - }; - - BN.prototype.imuln = function imuln (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - - // Carry - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = (this.words[i] | 0) * num; - var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); - carry >>= 26; - carry += (w / 0x4000000) | 0; - // NOTE: lo is 27bit maximum - carry += lo >>> 26; - this.words[i] = lo & 0x3ffffff; - } - - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - - return this; - }; - - BN.prototype.muln = function muln (num) { - return this.clone().imuln(num); - }; - - // `this` * `this` - BN.prototype.sqr = function sqr () { - return this.mul(this); - }; - - // `this` * `this` in-place - BN.prototype.isqr = function isqr () { - return this.imul(this.clone()); - }; - - // Math.pow(`this`, `num`) - BN.prototype.pow = function pow (num) { - var w = toBitArray(num); - if (w.length === 0) return new BN(1); - - // Skip leading zeroes - var res = this; - for (var i = 0; i < w.length; i++, res = res.sqr()) { - if (w[i] !== 0) break; - } - - if (++i < w.length) { - for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { - if (w[i] === 0) continue; - - res = res.mul(q); - } - } - - return res; - }; - - // Shift-left in-place - BN.prototype.iushln = function iushln (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); - var i; - - if (r !== 0) { - var carry = 0; - - for (i = 0; i < this.length; i++) { - var newCarry = this.words[i] & carryMask; - var c = ((this.words[i] | 0) - newCarry) << r; - this.words[i] = c | carry; - carry = newCarry >>> (26 - r); - } - - if (carry) { - this.words[i] = carry; - this.length++; - } - } - - if (s !== 0) { - for (i = this.length - 1; i >= 0; i--) { - this.words[i + s] = this.words[i]; - } - - for (i = 0; i < s; i++) { - this.words[i] = 0; - } - - this.length += s; - } - - return this.strip(); - }; - - BN.prototype.ishln = function ishln (bits) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushln(bits); - }; - - // Shift-right in-place - // NOTE: `hint` is a lowest bit before trailing zeroes - // NOTE: if `extended` is present - it will be filled with destroyed bits - BN.prototype.iushrn = function iushrn (bits, hint, extended) { - assert(typeof bits === 'number' && bits >= 0); - var h; - if (hint) { - h = (hint - (hint % 26)) / 26; - } else { - h = 0; - } - - var r = bits % 26; - var s = Math.min((bits - r) / 26, this.length); - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - var maskedWords = extended; - - h -= s; - h = Math.max(0, h); - - // Extended mode, copy masked part - if (maskedWords) { - for (var i = 0; i < s; i++) { - maskedWords.words[i] = this.words[i]; - } - maskedWords.length = s; - } - - if (s === 0) { - // No-op, we should not move anything at all - } else if (this.length > s) { - this.length -= s; - for (i = 0; i < this.length; i++) { - this.words[i] = this.words[i + s]; - } - } else { - this.words[0] = 0; - this.length = 1; - } - - var carry = 0; - for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { - var word = this.words[i] | 0; - this.words[i] = (carry << (26 - r)) | (word >>> r); - carry = word & mask; - } - - // Push carried bits as a mask - if (maskedWords && carry !== 0) { - maskedWords.words[maskedWords.length++] = carry; - } - - if (this.length === 0) { - this.words[0] = 0; - this.length = 1; - } - - return this.strip(); - }; - - BN.prototype.ishrn = function ishrn (bits, hint, extended) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushrn(bits, hint, extended); - }; - - // Shift-left - BN.prototype.shln = function shln (bits) { - return this.clone().ishln(bits); - }; - - BN.prototype.ushln = function ushln (bits) { - return this.clone().iushln(bits); - }; - - // Shift-right - BN.prototype.shrn = function shrn (bits) { - return this.clone().ishrn(bits); - }; - - BN.prototype.ushrn = function ushrn (bits) { - return this.clone().iushrn(bits); - }; - - // Test if n bit is set - BN.prototype.testn = function testn (bit) { - assert(typeof bit === 'number' && bit >= 0); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) return false; - - // Check bit and return - var w = this.words[s]; - - return !!(w & q); - }; - - // Return only lowers bits of number (in-place) - BN.prototype.imaskn = function imaskn (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - - assert(this.negative === 0, 'imaskn works only with positive numbers'); - - if (this.length <= s) { - return this; - } - - if (r !== 0) { - s++; - } - this.length = Math.min(s, this.length); - - if (r !== 0) { - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - this.words[this.length - 1] &= mask; - } - - return this.strip(); - }; - - // Return only lowers bits of number - BN.prototype.maskn = function maskn (bits) { - return this.clone().imaskn(bits); - }; - - // Add plain number `num` to `this` - BN.prototype.iaddn = function iaddn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.isubn(-num); - - // Possible sign change - if (this.negative !== 0) { - if (this.length === 1 && (this.words[0] | 0) < num) { - this.words[0] = num - (this.words[0] | 0); - this.negative = 0; - return this; - } - - this.negative = 0; - this.isubn(num); - this.negative = 1; - return this; - } - - // Add without checks - return this._iaddn(num); - }; - - BN.prototype._iaddn = function _iaddn (num) { - this.words[0] += num; - - // Carry - for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { - this.words[i] -= 0x4000000; - if (i === this.length - 1) { - this.words[i + 1] = 1; - } else { - this.words[i + 1]++; - } - } - this.length = Math.max(this.length, i + 1); - - return this; - }; - - // Subtract plain number `num` from `this` - BN.prototype.isubn = function isubn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.iaddn(-num); - - if (this.negative !== 0) { - this.negative = 0; - this.iaddn(num); - this.negative = 1; - return this; - } - - this.words[0] -= num; - - if (this.length === 1 && this.words[0] < 0) { - this.words[0] = -this.words[0]; - this.negative = 1; - } else { - // Carry - for (var i = 0; i < this.length && this.words[i] < 0; i++) { - this.words[i] += 0x4000000; - this.words[i + 1] -= 1; - } - } - - return this.strip(); - }; - - BN.prototype.addn = function addn (num) { - return this.clone().iaddn(num); - }; - - BN.prototype.subn = function subn (num) { - return this.clone().isubn(num); - }; - - BN.prototype.iabs = function iabs () { - this.negative = 0; - - return this; - }; - - BN.prototype.abs = function abs () { - return this.clone().iabs(); - }; - - BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { - var len = num.length + shift; - var i; - - this._expand(len); - - var w; - var carry = 0; - for (i = 0; i < num.length; i++) { - w = (this.words[i + shift] | 0) + carry; - var right = (num.words[i] | 0) * mul; - w -= right & 0x3ffffff; - carry = (w >> 26) - ((right / 0x4000000) | 0); - this.words[i + shift] = w & 0x3ffffff; - } - for (; i < this.length - shift; i++) { - w = (this.words[i + shift] | 0) + carry; - carry = w >> 26; - this.words[i + shift] = w & 0x3ffffff; - } - - if (carry === 0) return this.strip(); - - // Subtraction overflow - assert(carry === -1); - carry = 0; - for (i = 0; i < this.length; i++) { - w = -(this.words[i] | 0) + carry; - carry = w >> 26; - this.words[i] = w & 0x3ffffff; - } - this.negative = 1; - - return this.strip(); - }; - - BN.prototype._wordDiv = function _wordDiv (num, mode) { - var shift = this.length - num.length; - - var a = this.clone(); - var b = num; - - // Normalize - var bhi = b.words[b.length - 1] | 0; - var bhiBits = this._countBits(bhi); - shift = 26 - bhiBits; - if (shift !== 0) { - b = b.ushln(shift); - a.iushln(shift); - bhi = b.words[b.length - 1] | 0; - } - - // Initialize quotient - var m = a.length - b.length; - var q; - - if (mode !== 'mod') { - q = new BN(null); - q.length = m + 1; - q.words = new Array(q.length); - for (var i = 0; i < q.length; i++) { - q.words[i] = 0; - } - } - - var diff = a.clone()._ishlnsubmul(b, 1, m); - if (diff.negative === 0) { - a = diff; - if (q) { - q.words[m] = 1; - } - } - - for (var j = m - 1; j >= 0; j--) { - 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 - // (0x7ffffff) - qj = Math.min((qj / bhi) | 0, 0x3ffffff); - - a._ishlnsubmul(b, qj, j); - while (a.negative !== 0) { - qj--; - a.negative = 0; - a._ishlnsubmul(b, 1, j); - if (!a.isZero()) { - a.negative ^= 1; - } - } - if (q) { - q.words[j] = qj; - } - } - if (q) { - q.strip(); - } - a.strip(); - - // Denormalize - if (mode !== 'div' && shift !== 0) { - a.iushrn(shift); - } - - return { - div: q || null, - mod: a - }; - }; - - // NOTE: 1) `mode` can be set to `mod` to request mod only, - // to `div` to request div only, or be absent to - // request both div & mod - // 2) `positive` is true if unsigned mod is requested - BN.prototype.divmod = function divmod (num, mode, positive) { - assert(!num.isZero()); - - if (this.isZero()) { - return { - div: new BN(0), - mod: new BN(0) - }; - } - - var div, mod, res; - if (this.negative !== 0 && num.negative === 0) { - res = this.neg().divmod(num, mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.iadd(num); - } - } - - return { - div: div, - mod: mod - }; - } - - if (this.negative === 0 && num.negative !== 0) { - res = this.divmod(num.neg(), mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - return { - div: div, - mod: res.mod - }; - } - - if ((this.negative & num.negative) !== 0) { - res = this.neg().divmod(num.neg(), mode); - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.isub(num); - } - } - - return { - div: res.div, - mod: mod - }; - } - - // Both numbers are positive at this point - - // Strip both numbers to approximate shift value - if (num.length > this.length || this.cmp(num) < 0) { - return { - div: new BN(0), - mod: this - }; - } - - // Very short reduction - if (num.length === 1) { - if (mode === 'div') { - return { - div: this.divn(num.words[0]), - mod: null - }; - } - - if (mode === 'mod') { - return { - div: null, - mod: new BN(this.modn(num.words[0])) - }; - } - - return { - div: this.divn(num.words[0]), - mod: new BN(this.modn(num.words[0])) - }; - } - - return this._wordDiv(num, mode); - }; - - // Find `this` / `num` - BN.prototype.div = function div (num) { - return this.divmod(num, 'div', false).div; - }; - - // Find `this` % `num` - BN.prototype.mod = function mod (num) { - return this.divmod(num, 'mod', false).mod; - }; - - BN.prototype.umod = function umod (num) { - return this.divmod(num, 'mod', true).mod; - }; - - // Find Round(`this` / `num`) - BN.prototype.divRound = function divRound (num) { - var dm = this.divmod(num); - - // Fast case - exact division - if (dm.mod.isZero()) return dm.div; - - var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; - - var half = num.ushrn(1); - var r2 = num.andln(1); - var cmp = mod.cmp(half); - - // Round down - if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div; - - // Round up - return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); - }; - - BN.prototype.modn = function modn (num) { - assert(num <= 0x3ffffff); - var p = (1 << 26) % num; - - var acc = 0; - for (var i = this.length - 1; i >= 0; i--) { - acc = (p * acc + (this.words[i] | 0)) % num; - } - - return acc; - }; - - // In-place division by number - BN.prototype.idivn = function idivn (num) { - assert(num <= 0x3ffffff); - - var carry = 0; - for (var i = this.length - 1; i >= 0; i--) { - var w = (this.words[i] | 0) + carry * 0x4000000; - this.words[i] = (w / num) | 0; - carry = w % num; - } - - return this.strip(); - }; - - BN.prototype.divn = function divn (num) { - return this.clone().idivn(num); - }; - - BN.prototype.egcd = function egcd (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var x = this; - var y = p.clone(); - - if (x.negative !== 0) { - x = x.umod(p); - } else { - x = x.clone(); - } - - // A * x + B * y = x - var A = new BN(1); - var B = new BN(0); - - // C * x + D * y = y - var C = new BN(0); - var D = new BN(1); - - var g = 0; - - while (x.isEven() && y.isEven()) { - x.iushrn(1); - y.iushrn(1); - ++g; - } - - var yp = y.clone(); - var xp = x.clone(); - - while (!x.isZero()) { - for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - x.iushrn(i); - while (i-- > 0) { - if (A.isOdd() || B.isOdd()) { - A.iadd(yp); - B.isub(xp); - } - - A.iushrn(1); - B.iushrn(1); - } - } - - for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - y.iushrn(j); - while (j-- > 0) { - if (C.isOdd() || D.isOdd()) { - C.iadd(yp); - D.isub(xp); - } - - C.iushrn(1); - D.iushrn(1); - } - } - - if (x.cmp(y) >= 0) { - x.isub(y); - A.isub(C); - B.isub(D); - } else { - y.isub(x); - C.isub(A); - D.isub(B); - } - } - - return { - a: C, - b: D, - gcd: y.iushln(g) - }; - }; - - // This is reduced incarnation of the binary EEA - // above, designated to invert members of the - // _prime_ fields F(p) at a maximal speed - BN.prototype._invmp = function _invmp (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var a = this; - var b = p.clone(); - - if (a.negative !== 0) { - a = a.umod(p); - } else { - a = a.clone(); - } - - var x1 = new BN(1); - var x2 = new BN(0); - - var delta = b.clone(); - - while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { - for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - a.iushrn(i); - while (i-- > 0) { - if (x1.isOdd()) { - x1.iadd(delta); - } - - x1.iushrn(1); - } - } - - for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - b.iushrn(j); - while (j-- > 0) { - if (x2.isOdd()) { - x2.iadd(delta); - } - - x2.iushrn(1); - } - } - - if (a.cmp(b) >= 0) { - a.isub(b); - x1.isub(x2); - } else { - b.isub(a); - x2.isub(x1); - } - } - - var res; - if (a.cmpn(1) === 0) { - res = x1; - } else { - res = x2; - } - - if (res.cmpn(0) < 0) { - res.iadd(p); - } - - return res; - }; - - BN.prototype.gcd = function gcd (num) { - if (this.isZero()) return num.abs(); - if (num.isZero()) return this.abs(); - - var a = this.clone(); - var b = num.clone(); - a.negative = 0; - b.negative = 0; - - // Remove common factor of two - for (var shift = 0; a.isEven() && b.isEven(); shift++) { - a.iushrn(1); - b.iushrn(1); - } - - do { - while (a.isEven()) { - a.iushrn(1); - } - while (b.isEven()) { - b.iushrn(1); - } - - var r = a.cmp(b); - if (r < 0) { - // Swap `a` and `b` to make `a` always bigger than `b` - var t = a; - a = b; - b = t; - } else if (r === 0 || b.cmpn(1) === 0) { - break; - } - - a.isub(b); - } while (true); - - return b.iushln(shift); - }; - - // Invert number in the field F(num) - BN.prototype.invm = function invm (num) { - return this.egcd(num).a.umod(num); - }; - - BN.prototype.isEven = function isEven () { - return (this.words[0] & 1) === 0; - }; - - BN.prototype.isOdd = function isOdd () { - return (this.words[0] & 1) === 1; - }; - - // And first word and num - BN.prototype.andln = function andln (num) { - return this.words[0] & num; - }; - - // Increment at the bit position in-line - BN.prototype.bincn = function bincn (bit) { - assert(typeof bit === 'number'); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) { - this._expand(s + 1); - this.words[s] |= q; - return this; - } - - // Add bit and propagate, if needed - var carry = q; - for (var i = s; carry !== 0 && i < this.length; i++) { - var w = this.words[i] | 0; - w += carry; - carry = w >>> 26; - w &= 0x3ffffff; - this.words[i] = w; - } - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - return this; - }; - - BN.prototype.isZero = function isZero () { - return this.length === 1 && this.words[0] === 0; - }; - - BN.prototype.cmpn = function cmpn (num) { - var negative = num < 0; - - if (this.negative !== 0 && !negative) return -1; - if (this.negative === 0 && negative) return 1; - - this.strip(); - - var res; - if (this.length > 1) { - res = 1; - } else { - if (negative) { - num = -num; - } - - assert(num <= 0x3ffffff, 'Number is too big'); - - var w = this.words[0] | 0; - res = w === num ? 0 : w < num ? -1 : 1; - } - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Compare two numbers and return: - // 1 - if `this` > `num` - // 0 - if `this` == `num` - // -1 - if `this` < `num` - BN.prototype.cmp = function cmp (num) { - if (this.negative !== 0 && num.negative === 0) return -1; - if (this.negative === 0 && num.negative !== 0) return 1; - - var res = this.ucmp(num); - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Unsigned comparison - BN.prototype.ucmp = function ucmp (num) { - // At this point both numbers have the same sign - if (this.length > num.length) return 1; - if (this.length < num.length) return -1; - - var res = 0; - for (var i = this.length - 1; i >= 0; i--) { - var a = this.words[i] | 0; - var b = num.words[i] | 0; - - if (a === b) continue; - if (a < b) { - res = -1; - } else if (a > b) { - res = 1; - } - break; - } - return res; - }; - - BN.prototype.gtn = function gtn (num) { - return this.cmpn(num) === 1; - }; - - BN.prototype.gt = function gt (num) { - return this.cmp(num) === 1; - }; - - BN.prototype.gten = function gten (num) { - return this.cmpn(num) >= 0; - }; - - BN.prototype.gte = function gte (num) { - return this.cmp(num) >= 0; - }; - - BN.prototype.ltn = function ltn (num) { - return this.cmpn(num) === -1; - }; - - BN.prototype.lt = function lt (num) { - return this.cmp(num) === -1; - }; - - BN.prototype.lten = function lten (num) { - return this.cmpn(num) <= 0; - }; - - BN.prototype.lte = function lte (num) { - return this.cmp(num) <= 0; - }; - - BN.prototype.eqn = function eqn (num) { - return this.cmpn(num) === 0; - }; - - BN.prototype.eq = function eq (num) { - return this.cmp(num) === 0; - }; - - // - // A reduce context, could be using montgomery or something better, depending - // on the `m` itself. - // - BN.red = function red (num) { - return new Red(num); - }; - - BN.prototype.toRed = function toRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - assert(this.negative === 0, 'red works only with positives'); - return ctx.convertTo(this)._forceRed(ctx); - }; - - BN.prototype.fromRed = function fromRed () { - assert(this.red, 'fromRed works only with numbers in reduction context'); - return this.red.convertFrom(this); - }; - - BN.prototype._forceRed = function _forceRed (ctx) { - this.red = ctx; - return this; - }; - - BN.prototype.forceRed = function forceRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - return this._forceRed(ctx); - }; - - BN.prototype.redAdd = function redAdd (num) { - assert(this.red, 'redAdd works only with red numbers'); - return this.red.add(this, num); - }; - - BN.prototype.redIAdd = function redIAdd (num) { - assert(this.red, 'redIAdd works only with red numbers'); - return this.red.iadd(this, num); - }; - - BN.prototype.redSub = function redSub (num) { - assert(this.red, 'redSub works only with red numbers'); - return this.red.sub(this, num); - }; - - BN.prototype.redISub = function redISub (num) { - assert(this.red, 'redISub works only with red numbers'); - return this.red.isub(this, num); - }; - - BN.prototype.redShl = function redShl (num) { - assert(this.red, 'redShl works only with red numbers'); - return this.red.shl(this, num); - }; - - BN.prototype.redMul = function redMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.mul(this, num); - }; - - BN.prototype.redIMul = function redIMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.imul(this, num); - }; - - BN.prototype.redSqr = function redSqr () { - assert(this.red, 'redSqr works only with red numbers'); - this.red._verify1(this); - return this.red.sqr(this); - }; - - BN.prototype.redISqr = function redISqr () { - assert(this.red, 'redISqr works only with red numbers'); - this.red._verify1(this); - return this.red.isqr(this); - }; - - // Square root over p - BN.prototype.redSqrt = function redSqrt () { - assert(this.red, 'redSqrt works only with red numbers'); - this.red._verify1(this); - return this.red.sqrt(this); - }; - - BN.prototype.redInvm = function redInvm () { - assert(this.red, 'redInvm works only with red numbers'); - this.red._verify1(this); - return this.red.invm(this); - }; - - // Return negative clone of `this` % `red modulo` - BN.prototype.redNeg = function redNeg () { - assert(this.red, 'redNeg works only with red numbers'); - this.red._verify1(this); - return this.red.neg(this); - }; - - BN.prototype.redPow = function redPow (num) { - assert(this.red && !num.red, 'redPow(normalNum)'); - this.red._verify1(this); - return this.red.pow(this, num); - }; - - // Prime numbers with efficient reduction - var primes = { - k256: null, - p224: null, - p192: null, - p25519: null - }; - - // Pseudo-Mersenne prime - function MPrime (name, p) { - // P = 2 ^ N - K - this.name = name; - this.p = new BN(p, 16); - this.n = this.p.bitLength(); - this.k = new BN(1).iushln(this.n).isub(this.p); - - this.tmp = this._tmp(); - } - - MPrime.prototype._tmp = function _tmp () { - var tmp = new BN(null); - tmp.words = new Array(Math.ceil(this.n / 13)); - return tmp; - }; - - MPrime.prototype.ireduce = function ireduce (num) { - // Assumes that `num` is less than `P^2` - // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) - var r = num; - var rlen; - - do { - this.split(r, this.tmp); - r = this.imulK(r); - r = r.iadd(this.tmp); - rlen = r.bitLength(); - } while (rlen > this.n); - - var cmp = rlen < this.n ? -1 : r.ucmp(this.p); - if (cmp === 0) { - r.words[0] = 0; - r.length = 1; - } else if (cmp > 0) { - r.isub(this.p); - } else { - if (r.strip !== undefined) { - // r is BN v4 instance - r.strip(); - } else { - // r is BN v5 instance - r._strip(); - } - } - - return r; - }; - - MPrime.prototype.split = function split (input, out) { - input.iushrn(this.n, 0, out); - }; - - MPrime.prototype.imulK = function imulK (num) { - return num.imul(this.k); - }; - - function K256 () { - MPrime.call( - this, - 'k256', - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); - } - inherits(K256, MPrime); - - K256.prototype.split = function split (input, output) { - // 256 = 9 * 26 + 22 - var mask = 0x3fffff; - - var outLen = Math.min(input.length, 9); - for (var i = 0; i < outLen; i++) { - output.words[i] = input.words[i]; - } - output.length = outLen; - - if (input.length <= 9) { - input.words[0] = 0; - input.length = 1; - return; - } - - // Shift by 9 limbs - var prev = input.words[9]; - output.words[output.length++] = prev & mask; - - for (i = 10; i < input.length; i++) { - var next = input.words[i] | 0; - input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); - prev = next; - } - prev >>>= 22; - input.words[i - 10] = prev; - if (prev === 0 && input.length > 10) { - input.length -= 10; - } else { - input.length -= 9; - } - }; - - K256.prototype.imulK = function imulK (num) { - // K = 0x1000003d1 = [ 0x40, 0x3d1 ] - num.words[num.length] = 0; - num.words[num.length + 1] = 0; - num.length += 2; - - // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 - var lo = 0; - for (var i = 0; i < num.length; i++) { - var w = num.words[i] | 0; - lo += w * 0x3d1; - num.words[i] = lo & 0x3ffffff; - lo = w * 0x40 + ((lo / 0x4000000) | 0); - } - - // Fast length reduction - if (num.words[num.length - 1] === 0) { - num.length--; - if (num.words[num.length - 1] === 0) { - num.length--; - } - } - return num; - }; - - function P224 () { - MPrime.call( - this, - 'p224', - 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); - } - inherits(P224, MPrime); - - function P192 () { - MPrime.call( - this, - 'p192', - 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); - } - inherits(P192, MPrime); - - function P25519 () { - // 2 ^ 255 - 19 - MPrime.call( - this, - '25519', - '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); - } - inherits(P25519, MPrime); - - P25519.prototype.imulK = function imulK (num) { - // K = 0x13 - var carry = 0; - for (var i = 0; i < num.length; i++) { - var hi = (num.words[i] | 0) * 0x13 + carry; - var lo = hi & 0x3ffffff; - hi >>>= 26; - - num.words[i] = lo; - carry = hi; - } - if (carry !== 0) { - num.words[num.length++] = carry; - } - return num; - }; - - // Exported mostly for testing purposes, use plain name instead - BN._prime = function prime (name) { - // Cached version of prime - if (primes[name]) return primes[name]; - - var prime; - if (name === 'k256') { - prime = new K256(); - } else if (name === 'p224') { - prime = new P224(); - } else if (name === 'p192') { - prime = new P192(); - } else if (name === 'p25519') { - prime = new P25519(); - } else { - throw new Error('Unknown prime ' + name); - } - primes[name] = prime; - - return prime; - }; - - // - // Base reduction engine - // - function Red (m) { - if (typeof m === 'string') { - var prime = BN._prime(m); - this.m = prime.p; - this.prime = prime; - } else { - assert(m.gtn(1), 'modulus must be greater than 1'); - this.m = m; - this.prime = null; - } - } - - Red.prototype._verify1 = function _verify1 (a) { - assert(a.negative === 0, 'red works only with positives'); - assert(a.red, 'red works only with red numbers'); - }; - - Red.prototype._verify2 = function _verify2 (a, b) { - assert((a.negative | b.negative) === 0, 'red works only with positives'); - assert(a.red && a.red === b.red, - 'red works only with red numbers'); - }; - - Red.prototype.imod = function imod (a) { - if (this.prime) return this.prime.ireduce(a)._forceRed(this); - return a.umod(this.m)._forceRed(this); - }; - - Red.prototype.neg = function neg (a) { - if (a.isZero()) { - return a.clone(); - } - - return this.m.sub(a)._forceRed(this); - }; - - Red.prototype.add = function add (a, b) { - this._verify2(a, b); - - var res = a.add(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.iadd = function iadd (a, b) { - this._verify2(a, b); - - var res = a.iadd(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res; - }; - - Red.prototype.sub = function sub (a, b) { - this._verify2(a, b); - - var res = a.sub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.isub = function isub (a, b) { - this._verify2(a, b); - - var res = a.isub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res; - }; - - Red.prototype.shl = function shl (a, num) { - this._verify1(a); - return this.imod(a.ushln(num)); - }; - - Red.prototype.imul = function imul (a, b) { - this._verify2(a, b); - return this.imod(a.imul(b)); - }; - - Red.prototype.mul = function mul (a, b) { - this._verify2(a, b); - return this.imod(a.mul(b)); - }; - - Red.prototype.isqr = function isqr (a) { - return this.imul(a, a.clone()); - }; - - Red.prototype.sqr = function sqr (a) { - return this.mul(a, a); - }; - - Red.prototype.sqrt = function sqrt (a) { - if (a.isZero()) return a.clone(); - - var mod3 = this.m.andln(3); - assert(mod3 % 2 === 1); - - // Fast case - if (mod3 === 3) { - var pow = this.m.add(new BN(1)).iushrn(2); - return this.pow(a, pow); - } - - // Tonelli-Shanks algorithm (Totally unoptimized and slow) - // - // Find Q and S, that Q * 2 ^ S = (P - 1) - var q = this.m.subn(1); - var s = 0; - while (!q.isZero() && q.andln(1) === 0) { - s++; - q.iushrn(1); - } - assert(!q.isZero()); - - var one = new BN(1).toRed(this); - var nOne = one.redNeg(); - - // Find quadratic non-residue - // NOTE: Max is such because of generalized Riemann hypothesis. - var lpow = this.m.subn(1).iushrn(1); - var z = this.m.bitLength(); - z = new BN(2 * z * z).toRed(this); - - while (this.pow(z, lpow).cmp(nOne) !== 0) { - z.redIAdd(nOne); - } - - var c = this.pow(z, q); - var r = this.pow(a, q.addn(1).iushrn(1)); - var t = this.pow(a, q); - var m = s; - while (t.cmp(one) !== 0) { - var tmp = t; - for (var i = 0; tmp.cmp(one) !== 0; i++) { - tmp = tmp.redSqr(); - } - assert(i < m); - var b = this.pow(c, new BN(1).iushln(m - i - 1)); - - r = r.redMul(b); - c = b.redSqr(); - t = t.redMul(c); - m = i; - } - - return r; - }; - - Red.prototype.invm = function invm (a) { - var inv = a._invmp(this.m); - if (inv.negative !== 0) { - inv.negative = 0; - return this.imod(inv).redNeg(); - } else { - return this.imod(inv); - } - }; - - Red.prototype.pow = function pow (a, num) { - if (num.isZero()) return new BN(1).toRed(this); - if (num.cmpn(1) === 0) return a.clone(); - - var windowSize = 4; - var wnd = new Array(1 << windowSize); - wnd[0] = new BN(1).toRed(this); - wnd[1] = a; - for (var i = 2; i < wnd.length; i++) { - wnd[i] = this.mul(wnd[i - 1], a); - } - - var res = wnd[0]; - var current = 0; - var currentLen = 0; - var start = num.bitLength() % 26; - if (start === 0) { - start = 26; - } - - for (i = num.length - 1; i >= 0; i--) { - var word = num.words[i]; - for (var j = start - 1; j >= 0; j--) { - var bit = (word >> j) & 1; - if (res !== wnd[0]) { - res = this.sqr(res); - } - - if (bit === 0 && current === 0) { - currentLen = 0; - continue; - } - - current <<= 1; - current |= bit; - currentLen++; - if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; - - res = this.mul(res, wnd[current]); - currentLen = 0; - current = 0; - } - start = 26; - } - - return res; - }; - - Red.prototype.convertTo = function convertTo (num) { - var r = num.umod(this.m); - - return r === num ? r.clone() : r; - }; - - Red.prototype.convertFrom = function convertFrom (num) { - var res = num.clone(); - res.red = null; - return res; - }; - - // - // Montgomery method engine - // - - BN.mont = function mont (num) { - return new Mont(num); - }; - - function Mont (m) { - Red.call(this, m); - - this.shift = this.m.bitLength(); - if (this.shift % 26 !== 0) { - this.shift += 26 - (this.shift % 26); - } - - this.r = new BN(1).iushln(this.shift); - this.r2 = this.imod(this.r.sqr()); - this.rinv = this.r._invmp(this.m); - - this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); - this.minv = this.minv.umod(this.r); - this.minv = this.r.sub(this.minv); - } - inherits(Mont, Red); - - Mont.prototype.convertTo = function convertTo (num) { - return this.imod(num.ushln(this.shift)); - }; - - Mont.prototype.convertFrom = function convertFrom (num) { - var r = this.imod(num.mul(this.rinv)); - r.red = null; - return r; - }; - - Mont.prototype.imul = function imul (a, b) { - if (a.isZero() || b.isZero()) { - a.words[0] = 0; - a.length = 1; - return a; - } - - var t = a.imul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.mul = function mul (a, b) { - if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); - - var t = a.mul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.invm = function invm (a) { - // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R - var res = this.imod(a._invmp(this.m).mul(this.r2)); - return res._forceRed(this); - }; -})( false || module, this); - - -/***/ }), - -/***/ "./node_modules/assert/build/assert.js": -/*!*********************************************!*\ - !*** ./node_modules/assert/build/assert.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -// Currently in sync with Node.js lib/assert.js -// https://github.com/nodejs/node/commit/2a51ae424a513ec9a6aa3466baa0cc1d55dd4f3b -// Originally from narwhal.js (http://narwhaljs.org) -// Copyright (c) 2009 Thomas Robinson <280north.com> -// -// Permission is hereby granted, free of charge, to any person obtaining a copy -// of this software and associated documentation files (the 'Software'), to -// deal in the Software without restriction, including without limitation the -// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or -// sell copies of the Software, and to permit persons to whom the Software is -// furnished to do so, subject to the following conditions: -// -// The above copyright notice and this permission notice shall be included in -// all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED 'AS IS', WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -// AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN -// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION -// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. - - -function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } - -function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } - -var _require = __webpack_require__(/*! ./internal/errors */ "./node_modules/assert/build/internal/errors.js"), - _require$codes = _require.codes, - ERR_AMBIGUOUS_ARGUMENT = _require$codes.ERR_AMBIGUOUS_ARGUMENT, - ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE, - ERR_INVALID_ARG_VALUE = _require$codes.ERR_INVALID_ARG_VALUE, - ERR_INVALID_RETURN_VALUE = _require$codes.ERR_INVALID_RETURN_VALUE, - ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS; - -var AssertionError = __webpack_require__(/*! ./internal/assert/assertion_error */ "./node_modules/assert/build/internal/assert/assertion_error.js"); - -var _require2 = __webpack_require__(/*! util/ */ "./node_modules/util/util.js"), - inspect = _require2.inspect; - -var _require$types = __webpack_require__(/*! util/ */ "./node_modules/util/util.js").types, - isPromise = _require$types.isPromise, - isRegExp = _require$types.isRegExp; - -var objectAssign = Object.assign ? Object.assign : __webpack_require__(/*! es6-object-assign */ "./node_modules/es6-object-assign/index.js").assign; -var objectIs = Object.is ? Object.is : __webpack_require__(/*! object-is */ "./node_modules/object-is/index.js"); -var errorCache = new Map(); -var isDeepEqual; -var isDeepStrictEqual; -var parseExpressionAt; -var findNodeAround; -var decoder; - -function lazyLoadComparison() { - var comparison = __webpack_require__(/*! ./internal/util/comparisons */ "./node_modules/assert/build/internal/util/comparisons.js"); - - isDeepEqual = comparison.isDeepEqual; - isDeepStrictEqual = comparison.isDeepStrictEqual; -} // Escape control characters but not \n and \t to keep the line breaks and -// indentation intact. -// eslint-disable-next-line no-control-regex - - -var escapeSequencesRegExp = /[\x00-\x08\x0b\x0c\x0e-\x1f]/g; -var meta = ["\\u0000", "\\u0001", "\\u0002", "\\u0003", "\\u0004", "\\u0005", "\\u0006", "\\u0007", '\\b', '', '', "\\u000b", '\\f', '', "\\u000e", "\\u000f", "\\u0010", "\\u0011", "\\u0012", "\\u0013", "\\u0014", "\\u0015", "\\u0016", "\\u0017", "\\u0018", "\\u0019", "\\u001a", "\\u001b", "\\u001c", "\\u001d", "\\u001e", "\\u001f"]; - -var escapeFn = function escapeFn(str) { - return meta[str.charCodeAt(0)]; -}; - -var warned = false; // The assert module provides functions that throw -// AssertionError's when particular conditions are not met. The -// assert module must conform to the following interface. - -var assert = module.exports = ok; -var NO_EXCEPTION_SENTINEL = {}; // All of the following functions must throw an AssertionError -// when a corresponding condition is not met, with a message that -// may be undefined if not provided. All assertion methods provide -// both the actual and expected values to the assertion error for -// display purposes. - -function innerFail(obj) { - if (obj.message instanceof Error) throw obj.message; - throw new AssertionError(obj); -} - -function fail(actual, expected, message, operator, stackStartFn) { - var argsLen = arguments.length; - var internalMessage; - - if (argsLen === 0) { - internalMessage = 'Failed'; - } else if (argsLen === 1) { - message = actual; - actual = undefined; - } else { - if (warned === false) { - warned = true; - var warn = process.emitWarning ? process.emitWarning : console.warn.bind(console); - warn('assert.fail() with more than one argument is deprecated. ' + 'Please use assert.strictEqual() instead or only pass a message.', 'DeprecationWarning', 'DEP0094'); - } - - if (argsLen === 2) operator = '!='; - } - - if (message instanceof Error) throw message; - var errArgs = { - actual: actual, - expected: expected, - operator: operator === undefined ? 'fail' : operator, - stackStartFn: stackStartFn || fail - }; - - if (message !== undefined) { - errArgs.message = message; - } - - var err = new AssertionError(errArgs); - - if (internalMessage) { - err.message = internalMessage; - err.generatedMessage = true; - } - - throw err; -} - -assert.fail = fail; // The AssertionError is defined in internal/error. - -assert.AssertionError = AssertionError; - -function innerOk(fn, argLen, value, message) { - if (!value) { - var generatedMessage = false; - - if (argLen === 0) { - generatedMessage = true; - message = 'No value argument passed to `assert.ok()`'; - } else if (message instanceof Error) { - throw message; - } - - var err = new AssertionError({ - actual: value, - expected: true, - message: message, - operator: '==', - stackStartFn: fn - }); - err.generatedMessage = generatedMessage; - throw err; - } -} // Pure assertion tests whether a value is truthy, as determined -// by !!value. - - -function ok() { - for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { - args[_key] = arguments[_key]; - } - - innerOk.apply(void 0, [ok, args.length].concat(args)); -} - -assert.ok = ok; // The equality assertion tests shallow, coercive equality with ==. - -/* eslint-disable no-restricted-properties */ - -assert.equal = function equal(actual, expected, message) { - if (arguments.length < 2) { - throw new ERR_MISSING_ARGS('actual', 'expected'); - } // eslint-disable-next-line eqeqeq - - - if (actual != expected) { - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: '==', - stackStartFn: equal - }); - } -}; // The non-equality assertion tests for whether two objects are not -// equal with !=. - - -assert.notEqual = function notEqual(actual, expected, message) { - if (arguments.length < 2) { - throw new ERR_MISSING_ARGS('actual', 'expected'); - } // eslint-disable-next-line eqeqeq - - - if (actual == expected) { - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: '!=', - stackStartFn: notEqual - }); - } -}; // The equivalence assertion tests a deep equality relation. - - -assert.deepEqual = function deepEqual(actual, expected, message) { - if (arguments.length < 2) { - throw new ERR_MISSING_ARGS('actual', 'expected'); - } - - if (isDeepEqual === undefined) lazyLoadComparison(); - - if (!isDeepEqual(actual, expected)) { - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: 'deepEqual', - stackStartFn: deepEqual - }); - } -}; // The non-equivalence assertion tests for any deep inequality. - - -assert.notDeepEqual = function notDeepEqual(actual, expected, message) { - if (arguments.length < 2) { - throw new ERR_MISSING_ARGS('actual', 'expected'); - } - - if (isDeepEqual === undefined) lazyLoadComparison(); - - if (isDeepEqual(actual, expected)) { - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: 'notDeepEqual', - stackStartFn: notDeepEqual - }); - } -}; -/* eslint-enable */ - - -assert.deepStrictEqual = function deepStrictEqual(actual, expected, message) { - if (arguments.length < 2) { - throw new ERR_MISSING_ARGS('actual', 'expected'); - } - - if (isDeepEqual === undefined) lazyLoadComparison(); - - if (!isDeepStrictEqual(actual, expected)) { - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: 'deepStrictEqual', - stackStartFn: deepStrictEqual - }); - } -}; - -assert.notDeepStrictEqual = notDeepStrictEqual; - -function notDeepStrictEqual(actual, expected, message) { - if (arguments.length < 2) { - throw new ERR_MISSING_ARGS('actual', 'expected'); - } - - if (isDeepEqual === undefined) lazyLoadComparison(); - - if (isDeepStrictEqual(actual, expected)) { - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: 'notDeepStrictEqual', - stackStartFn: notDeepStrictEqual - }); - } -} - -assert.strictEqual = function strictEqual(actual, expected, message) { - if (arguments.length < 2) { - throw new ERR_MISSING_ARGS('actual', 'expected'); - } - - if (!objectIs(actual, expected)) { - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: 'strictEqual', - stackStartFn: strictEqual - }); - } -}; - -assert.notStrictEqual = function notStrictEqual(actual, expected, message) { - if (arguments.length < 2) { - throw new ERR_MISSING_ARGS('actual', 'expected'); - } - - if (objectIs(actual, expected)) { - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: 'notStrictEqual', - stackStartFn: notStrictEqual - }); - } -}; - -var Comparison = function Comparison(obj, keys, actual) { - var _this = this; - - _classCallCheck(this, Comparison); - - keys.forEach(function (key) { - if (key in obj) { - if (actual !== undefined && typeof actual[key] === 'string' && isRegExp(obj[key]) && obj[key].test(actual[key])) { - _this[key] = actual[key]; - } else { - _this[key] = obj[key]; - } - } - }); -}; - -function compareExceptionKey(actual, expected, key, message, keys, fn) { - if (!(key in actual) || !isDeepStrictEqual(actual[key], expected[key])) { - if (!message) { - // Create placeholder objects to create a nice output. - var a = new Comparison(actual, keys); - var b = new Comparison(expected, keys, actual); - var err = new AssertionError({ - actual: a, - expected: b, - operator: 'deepStrictEqual', - stackStartFn: fn - }); - err.actual = actual; - err.expected = expected; - err.operator = fn.name; - throw err; - } - - innerFail({ - actual: actual, - expected: expected, - message: message, - operator: fn.name, - stackStartFn: fn - }); - } -} - -function expectedException(actual, expected, msg, fn) { - if (typeof expected !== 'function') { - if (isRegExp(expected)) return expected.test(actual); // assert.doesNotThrow does not accept objects. - - if (arguments.length === 2) { - throw new ERR_INVALID_ARG_TYPE('expected', ['Function', 'RegExp'], expected); - } // Handle primitives properly. - - - if (_typeof(actual) !== 'object' || actual === null) { - var err = new AssertionError({ - actual: actual, - expected: expected, - message: msg, - operator: 'deepStrictEqual', - stackStartFn: fn - }); - err.operator = fn.name; - throw err; - } - - var keys = Object.keys(expected); // Special handle errors to make sure the name and the message are compared - // as well. - - if (expected instanceof Error) { - keys.push('name', 'message'); - } else if (keys.length === 0) { - throw new ERR_INVALID_ARG_VALUE('error', expected, 'may not be an empty object'); - } - - if (isDeepEqual === undefined) lazyLoadComparison(); - keys.forEach(function (key) { - if (typeof actual[key] === 'string' && isRegExp(expected[key]) && expected[key].test(actual[key])) { - return; - } - - compareExceptionKey(actual, expected, key, msg, keys, fn); - }); - return true; - } // Guard instanceof against arrow functions as they don't have a prototype. - - - if (expected.prototype !== undefined && actual instanceof expected) { - return true; - } - - if (Error.isPrototypeOf(expected)) { - return false; - } - - return expected.call({}, actual) === true; -} - -function getActual(fn) { - if (typeof fn !== 'function') { - throw new ERR_INVALID_ARG_TYPE('fn', 'Function', fn); - } - - try { - fn(); - } catch (e) { - return e; - } - - return NO_EXCEPTION_SENTINEL; -} - -function checkIsPromise(obj) { - // Accept native ES6 promises and promises that are implemented in a similar - // way. Do not accept thenables that use a function as `obj` and that have no - // `catch` handler. - // TODO: thenables are checked up until they have the correct methods, - // but according to documentation, the `then` method should receive - // the `fulfill` and `reject` arguments as well or it may be never resolved. - return isPromise(obj) || obj !== null && _typeof(obj) === 'object' && typeof obj.then === 'function' && typeof obj.catch === 'function'; -} - -function waitForActual(promiseFn) { - return Promise.resolve().then(function () { - var resultPromise; - - if (typeof promiseFn === 'function') { - // Return a rejected promise if `promiseFn` throws synchronously. - resultPromise = promiseFn(); // Fail in case no promise is returned. - - if (!checkIsPromise(resultPromise)) { - throw new ERR_INVALID_RETURN_VALUE('instance of Promise', 'promiseFn', resultPromise); - } - } else if (checkIsPromise(promiseFn)) { - resultPromise = promiseFn; - } else { - throw new ERR_INVALID_ARG_TYPE('promiseFn', ['Function', 'Promise'], promiseFn); - } - - return Promise.resolve().then(function () { - return resultPromise; - }).then(function () { - return NO_EXCEPTION_SENTINEL; - }).catch(function (e) { - return e; - }); - }); -} - -function expectsError(stackStartFn, actual, error, message) { - if (typeof error === 'string') { - if (arguments.length === 4) { - throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error); - } - - if (_typeof(actual) === 'object' && actual !== null) { - if (actual.message === error) { - throw new ERR_AMBIGUOUS_ARGUMENT('error/message', "The error message \"".concat(actual.message, "\" is identical to the message.")); - } - } else if (actual === error) { - throw new ERR_AMBIGUOUS_ARGUMENT('error/message', "The error \"".concat(actual, "\" is identical to the message.")); - } - - message = error; - error = undefined; - } else if (error != null && _typeof(error) !== 'object' && typeof error !== 'function') { - throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error); - } - - if (actual === NO_EXCEPTION_SENTINEL) { - var details = ''; - - if (error && error.name) { - details += " (".concat(error.name, ")"); - } - - details += message ? ": ".concat(message) : '.'; - var fnType = stackStartFn.name === 'rejects' ? 'rejection' : 'exception'; - innerFail({ - actual: undefined, - expected: error, - operator: stackStartFn.name, - message: "Missing expected ".concat(fnType).concat(details), - stackStartFn: stackStartFn - }); - } - - if (error && !expectedException(actual, error, message, stackStartFn)) { - throw actual; - } -} - -function expectsNoError(stackStartFn, actual, error, message) { - if (actual === NO_EXCEPTION_SENTINEL) return; - - if (typeof error === 'string') { - message = error; - error = undefined; - } - - if (!error || expectedException(actual, error)) { - var details = message ? ": ".concat(message) : '.'; - var fnType = stackStartFn.name === 'doesNotReject' ? 'rejection' : 'exception'; - innerFail({ - actual: actual, - expected: error, - operator: stackStartFn.name, - message: "Got unwanted ".concat(fnType).concat(details, "\n") + "Actual message: \"".concat(actual && actual.message, "\""), - stackStartFn: stackStartFn - }); - } - - throw actual; -} - -assert.throws = function throws(promiseFn) { - for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) { - args[_key2 - 1] = arguments[_key2]; - } - - expectsError.apply(void 0, [throws, getActual(promiseFn)].concat(args)); -}; - -assert.rejects = function rejects(promiseFn) { - for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) { - args[_key3 - 1] = arguments[_key3]; - } - - return waitForActual(promiseFn).then(function (result) { - return expectsError.apply(void 0, [rejects, result].concat(args)); - }); -}; - -assert.doesNotThrow = function doesNotThrow(fn) { - for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) { - args[_key4 - 1] = arguments[_key4]; - } - - expectsNoError.apply(void 0, [doesNotThrow, getActual(fn)].concat(args)); -}; - -assert.doesNotReject = function doesNotReject(fn) { - for (var _len5 = arguments.length, args = new Array(_len5 > 1 ? _len5 - 1 : 0), _key5 = 1; _key5 < _len5; _key5++) { - args[_key5 - 1] = arguments[_key5]; - } - - return waitForActual(fn).then(function (result) { - return expectsNoError.apply(void 0, [doesNotReject, result].concat(args)); - }); -}; - -assert.ifError = function ifError(err) { - if (err !== null && err !== undefined) { - var message = 'ifError got unwanted exception: '; - - if (_typeof(err) === 'object' && typeof err.message === 'string') { - if (err.message.length === 0 && err.constructor) { - message += err.constructor.name; - } else { - message += err.message; - } - } else { - message += inspect(err); - } - - var newErr = new AssertionError({ - actual: err, - expected: null, - operator: 'ifError', - message: message, - stackStartFn: ifError - }); // Make sure we actually have a stack trace! - - var origStack = err.stack; - - if (typeof origStack === 'string') { - // This will remove any duplicated frames from the error frames taken - // from within `ifError` and add the original error frames to the newly - // created ones. - var tmp2 = origStack.split('\n'); - tmp2.shift(); // Filter all frames existing in err.stack. - - var tmp1 = newErr.stack.split('\n'); - - for (var i = 0; i < tmp2.length; i++) { - // Find the first occurrence of the frame. - var pos = tmp1.indexOf(tmp2[i]); - - if (pos !== -1) { - // Only keep new frames. - tmp1 = tmp1.slice(0, pos); - break; - } - } - - newErr.stack = "".concat(tmp1.join('\n'), "\n").concat(tmp2.join('\n')); - } - - throw newErr; - } -}; // Expose a strict only variant of assert - - -function strict() { - for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) { - args[_key6] = arguments[_key6]; - } - - innerOk.apply(void 0, [strict, args.length].concat(args)); -} - -assert.strict = objectAssign(strict, assert, { - equal: assert.strictEqual, - deepEqual: assert.deepStrictEqual, - notEqual: assert.notStrictEqual, - notDeepEqual: assert.notDeepStrictEqual -}); -assert.strict.strict = assert.strict; - -/***/ }), - -/***/ "./node_modules/assert/build/internal/assert/assertion_error.js": -/*!**********************************************************************!*\ - !*** ./node_modules/assert/build/internal/assert/assertion_error.js ***! - \**********************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -// Currently in sync with Node.js lib/internal/assert/assertion_error.js -// https://github.com/nodejs/node/commit/0817840f775032169ddd70c85ac059f18ffcc81c - - -function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; } - -function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } - -function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } - -function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } - -function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } - -function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } return _assertThisInitialized(self); } - -function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; } - -function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); } - -function _wrapNativeSuper(Class) { var _cache = typeof Map === "function" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== "function") { throw new TypeError("Super expression must either be null or a function"); } if (typeof _cache !== "undefined") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); } - -function isNativeReflectConstruct() { if (typeof Reflect === "undefined" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === "function") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } } - -function _construct(Parent, args, Class) { if (isNativeReflectConstruct()) { _construct = Reflect.construct; } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); } - -function _isNativeFunction(fn) { return Function.toString.call(fn).indexOf("[native code]") !== -1; } - -function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); } - -function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); } - -function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } - -var _require = __webpack_require__(/*! util/ */ "./node_modules/util/util.js"), - inspect = _require.inspect; - -var _require2 = __webpack_require__(/*! ../errors */ "./node_modules/assert/build/internal/errors.js"), - ERR_INVALID_ARG_TYPE = _require2.codes.ERR_INVALID_ARG_TYPE; // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith - - -function endsWith(str, search, this_len) { - if (this_len === undefined || this_len > str.length) { - this_len = str.length; - } - - return str.substring(this_len - search.length, this_len) === search; -} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat - - -function repeat(str, count) { - count = Math.floor(count); - if (str.length == 0 || count == 0) return ''; - var maxCount = str.length * count; - count = Math.floor(Math.log(count) / Math.log(2)); - - while (count) { - str += str; - count--; - } - - str += str.substring(0, maxCount - str.length); - return str; -} - -var blue = ''; -var green = ''; -var red = ''; -var white = ''; -var kReadableOperator = { - deepStrictEqual: 'Expected values to be strictly deep-equal:', - strictEqual: 'Expected values to be strictly equal:', - strictEqualObject: 'Expected "actual" to be reference-equal to "expected":', - deepEqual: 'Expected values to be loosely deep-equal:', - equal: 'Expected values to be loosely equal:', - notDeepStrictEqual: 'Expected "actual" not to be strictly deep-equal to:', - notStrictEqual: 'Expected "actual" to be strictly unequal to:', - notStrictEqualObject: 'Expected "actual" not to be reference-equal to "expected":', - notDeepEqual: 'Expected "actual" not to be loosely deep-equal to:', - notEqual: 'Expected "actual" to be loosely unequal to:', - notIdentical: 'Values identical but not reference-equal:' -}; // Comparing short primitives should just show === / !== instead of using the -// diff. - -var kMaxShortLength = 10; - -function copyError(source) { - var keys = Object.keys(source); - var target = Object.create(Object.getPrototypeOf(source)); - keys.forEach(function (key) { - target[key] = source[key]; - }); - Object.defineProperty(target, 'message', { - value: source.message - }); - return target; -} - -function inspectValue(val) { - // The util.inspect default values could be changed. This makes sure the - // error messages contain the necessary information nevertheless. - return inspect(val, { - compact: false, - customInspect: false, - depth: 1000, - maxArrayLength: Infinity, - // Assert compares only enumerable properties (with a few exceptions). - showHidden: false, - // Having a long line as error is better than wrapping the line for - // comparison for now. - // TODO(BridgeAR): `breakLength` should be limited as soon as soon as we - // have meta information about the inspected properties (i.e., know where - // in what line the property starts and ends). - breakLength: Infinity, - // Assert does not detect proxies currently. - showProxy: false, - sorted: true, - // Inspect getters as we also check them when comparing entries. - getters: true - }); -} - -function createErrDiff(actual, expected, operator) { - var other = ''; - var res = ''; - var lastPos = 0; - var end = ''; - var skipped = false; - var actualInspected = inspectValue(actual); - var actualLines = actualInspected.split('\n'); - var expectedLines = inspectValue(expected).split('\n'); - var i = 0; - var indicator = ''; // In case both values are objects explicitly mark them as not reference equal - // for the `strictEqual` operator. - - if (operator === 'strictEqual' && _typeof(actual) === 'object' && _typeof(expected) === 'object' && actual !== null && expected !== null) { - operator = 'strictEqualObject'; - } // If "actual" and "expected" fit on a single line and they are not strictly - // equal, check further special handling. - - - if (actualLines.length === 1 && expectedLines.length === 1 && actualLines[0] !== expectedLines[0]) { - var inputLength = actualLines[0].length + expectedLines[0].length; // If the character length of "actual" and "expected" together is less than - // kMaxShortLength and if neither is an object and at least one of them is - // not `zero`, use the strict equal comparison to visualize the output. - - if (inputLength <= kMaxShortLength) { - if ((_typeof(actual) !== 'object' || actual === null) && (_typeof(expected) !== 'object' || expected === null) && (actual !== 0 || expected !== 0)) { - // -0 === +0 - return "".concat(kReadableOperator[operator], "\n\n") + "".concat(actualLines[0], " !== ").concat(expectedLines[0], "\n"); - } - } else if (operator !== 'strictEqualObject') { - // If the stderr is a tty and the input length is lower than the current - // columns per line, add a mismatch indicator below the output. If it is - // not a tty, use a default value of 80 characters. - var maxLength = process.stderr && process.stderr.isTTY ? process.stderr.columns : 80; - - if (inputLength < maxLength) { - while (actualLines[0][i] === expectedLines[0][i]) { - i++; - } // Ignore the first characters. - - - if (i > 2) { - // Add position indicator for the first mismatch in case it is a - // single line and the input length is less than the column length. - indicator = "\n ".concat(repeat(' ', i), "^"); - i = 0; - } - } - } - } // Remove all ending lines that match (this optimizes the output for - // readability by reducing the number of total changed lines). - - - var a = actualLines[actualLines.length - 1]; - var b = expectedLines[expectedLines.length - 1]; - - while (a === b) { - if (i++ < 2) { - end = "\n ".concat(a).concat(end); - } else { - other = a; - } - - actualLines.pop(); - expectedLines.pop(); - if (actualLines.length === 0 || expectedLines.length === 0) break; - a = actualLines[actualLines.length - 1]; - b = expectedLines[expectedLines.length - 1]; - } - - var maxLines = Math.max(actualLines.length, expectedLines.length); // Strict equal with identical objects that are not identical by reference. - // E.g., assert.deepStrictEqual({ a: Symbol() }, { a: Symbol() }) - - if (maxLines === 0) { - // We have to get the result again. The lines were all removed before. - var _actualLines = actualInspected.split('\n'); // Only remove lines in case it makes sense to collapse those. - // TODO: Accept env to always show the full error. - - - if (_actualLines.length > 30) { - _actualLines[26] = "".concat(blue, "...").concat(white); - - while (_actualLines.length > 27) { - _actualLines.pop(); - } - } - - return "".concat(kReadableOperator.notIdentical, "\n\n").concat(_actualLines.join('\n'), "\n"); - } - - if (i > 3) { - end = "\n".concat(blue, "...").concat(white).concat(end); - skipped = true; - } - - if (other !== '') { - end = "\n ".concat(other).concat(end); - other = ''; - } - - var printedLines = 0; - var msg = kReadableOperator[operator] + "\n".concat(green, "+ actual").concat(white, " ").concat(red, "- expected").concat(white); - var skippedMsg = " ".concat(blue, "...").concat(white, " Lines skipped"); - - for (i = 0; i < maxLines; i++) { - // Only extra expected lines exist - var cur = i - lastPos; - - if (actualLines.length < i + 1) { - // If the last diverging line is more than one line above and the - // current line is at least line three, add some of the former lines and - // also add dots to indicate skipped entries. - if (cur > 1 && i > 2) { - if (cur > 4) { - res += "\n".concat(blue, "...").concat(white); - skipped = true; - } else if (cur > 3) { - res += "\n ".concat(expectedLines[i - 2]); - printedLines++; - } - - res += "\n ".concat(expectedLines[i - 1]); - printedLines++; - } // Mark the current line as the last diverging one. - - - lastPos = i; // Add the expected line to the cache. - - other += "\n".concat(red, "-").concat(white, " ").concat(expectedLines[i]); - printedLines++; // Only extra actual lines exist - } else if (expectedLines.length < i + 1) { - // If the last diverging line is more than one line above and the - // current line is at least line three, add some of the former lines and - // also add dots to indicate skipped entries. - if (cur > 1 && i > 2) { - if (cur > 4) { - res += "\n".concat(blue, "...").concat(white); - skipped = true; - } else if (cur > 3) { - res += "\n ".concat(actualLines[i - 2]); - printedLines++; - } - - res += "\n ".concat(actualLines[i - 1]); - printedLines++; - } // Mark the current line as the last diverging one. - - - lastPos = i; // Add the actual line to the result. - - res += "\n".concat(green, "+").concat(white, " ").concat(actualLines[i]); - printedLines++; // Lines diverge - } else { - var expectedLine = expectedLines[i]; - var actualLine = actualLines[i]; // If the lines diverge, specifically check for lines that only diverge by - // a trailing comma. In that case it is actually identical and we should - // mark it as such. - - var divergingLines = actualLine !== expectedLine && (!endsWith(actualLine, ',') || actualLine.slice(0, -1) !== expectedLine); // If the expected line has a trailing comma but is otherwise identical, - // add a comma at the end of the actual line. Otherwise the output could - // look weird as in: - // - // [ - // 1 // No comma at the end! - // + 2 - // ] - // - - if (divergingLines && endsWith(expectedLine, ',') && expectedLine.slice(0, -1) === actualLine) { - divergingLines = false; - actualLine += ','; - } - - if (divergingLines) { - // If the last diverging line is more than one line above and the - // current line is at least line three, add some of the former lines and - // also add dots to indicate skipped entries. - if (cur > 1 && i > 2) { - if (cur > 4) { - res += "\n".concat(blue, "...").concat(white); - skipped = true; - } else if (cur > 3) { - res += "\n ".concat(actualLines[i - 2]); - printedLines++; - } - - res += "\n ".concat(actualLines[i - 1]); - printedLines++; - } // Mark the current line as the last diverging one. - - - lastPos = i; // Add the actual line to the result and cache the expected diverging - // line so consecutive diverging lines show up as +++--- and not +-+-+-. - - res += "\n".concat(green, "+").concat(white, " ").concat(actualLine); - other += "\n".concat(red, "-").concat(white, " ").concat(expectedLine); - printedLines += 2; // Lines are identical - } else { - // Add all cached information to the result before adding other things - // and reset the cache. - res += other; - other = ''; // If the last diverging line is exactly one line above or if it is the - // very first line, add the line to the result. - - if (cur === 1 || i === 0) { - res += "\n ".concat(actualLine); - printedLines++; - } - } - } // Inspected object to big (Show ~20 rows max) - - - if (printedLines > 20 && i < maxLines - 2) { - return "".concat(msg).concat(skippedMsg, "\n").concat(res, "\n").concat(blue, "...").concat(white).concat(other, "\n") + "".concat(blue, "...").concat(white); - } - } - - return "".concat(msg).concat(skipped ? skippedMsg : '', "\n").concat(res).concat(other).concat(end).concat(indicator); -} - -var AssertionError = -/*#__PURE__*/ -function (_Error) { - _inherits(AssertionError, _Error); - - function AssertionError(options) { - var _this; - - _classCallCheck(this, AssertionError); - - if (_typeof(options) !== 'object' || options === null) { - throw new ERR_INVALID_ARG_TYPE('options', 'Object', options); - } - - var message = options.message, - operator = options.operator, - stackStartFn = options.stackStartFn; - var actual = options.actual, - expected = options.expected; - var limit = Error.stackTraceLimit; - Error.stackTraceLimit = 0; - - if (message != null) { - _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, String(message))); - } else { - if (process.stderr && process.stderr.isTTY) { - // Reset on each call to make sure we handle dynamically set environment - // variables correct. - if (process.stderr && process.stderr.getColorDepth && process.stderr.getColorDepth() !== 1) { - blue = "\x1B[34m"; - green = "\x1B[32m"; - white = "\x1B[39m"; - red = "\x1B[31m"; - } else { - blue = ''; - green = ''; - white = ''; - red = ''; - } - } // Prevent the error stack from being visible by duplicating the error - // in a very close way to the original in case both sides are actually - // instances of Error. - - - if (_typeof(actual) === 'object' && actual !== null && _typeof(expected) === 'object' && expected !== null && 'stack' in actual && actual instanceof Error && 'stack' in expected && expected instanceof Error) { - actual = copyError(actual); - expected = copyError(expected); - } - - if (operator === 'deepStrictEqual' || operator === 'strictEqual') { - _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, createErrDiff(actual, expected, operator))); - } else if (operator === 'notDeepStrictEqual' || operator === 'notStrictEqual') { - // In case the objects are equal but the operator requires unequal, show - // the first object and say A equals B - var base = kReadableOperator[operator]; - var res = inspectValue(actual).split('\n'); // In case "actual" is an object, it should not be reference equal. - - if (operator === 'notStrictEqual' && _typeof(actual) === 'object' && actual !== null) { - base = kReadableOperator.notStrictEqualObject; - } // Only remove lines in case it makes sense to collapse those. - // TODO: Accept env to always show the full error. - - - if (res.length > 30) { - res[26] = "".concat(blue, "...").concat(white); - - while (res.length > 27) { - res.pop(); - } - } // Only print a single input. - - - if (res.length === 1) { - _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, "".concat(base, " ").concat(res[0]))); - } else { - _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, "".concat(base, "\n\n").concat(res.join('\n'), "\n"))); - } - } else { - var _res = inspectValue(actual); - - var other = ''; - var knownOperators = kReadableOperator[operator]; - - if (operator === 'notDeepEqual' || operator === 'notEqual') { - _res = "".concat(kReadableOperator[operator], "\n\n").concat(_res); - - if (_res.length > 1024) { - _res = "".concat(_res.slice(0, 1021), "..."); - } - } else { - other = "".concat(inspectValue(expected)); - - if (_res.length > 512) { - _res = "".concat(_res.slice(0, 509), "..."); - } - - if (other.length > 512) { - other = "".concat(other.slice(0, 509), "..."); - } - - if (operator === 'deepEqual' || operator === 'equal') { - _res = "".concat(knownOperators, "\n\n").concat(_res, "\n\nshould equal\n\n"); - } else { - other = " ".concat(operator, " ").concat(other); - } - } - - _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, "".concat(_res).concat(other))); - } - } - - Error.stackTraceLimit = limit; - _this.generatedMessage = !message; - Object.defineProperty(_assertThisInitialized(_this), 'name', { - value: 'AssertionError [ERR_ASSERTION]', - enumerable: false, - writable: true, - configurable: true - }); - _this.code = 'ERR_ASSERTION'; - _this.actual = actual; - _this.expected = expected; - _this.operator = operator; - - if (Error.captureStackTrace) { - // eslint-disable-next-line no-restricted-syntax - Error.captureStackTrace(_assertThisInitialized(_this), stackStartFn); - } // Create error message including the error code in the name. - - - _this.stack; // Reset the name. - - _this.name = 'AssertionError'; - return _possibleConstructorReturn(_this); - } - - _createClass(AssertionError, [{ - key: "toString", - value: function toString() { - return "".concat(this.name, " [").concat(this.code, "]: ").concat(this.message); - } - }, { - key: inspect.custom, - value: function value(recurseTimes, ctx) { - // This limits the `actual` and `expected` property default inspection to - // the minimum depth. Otherwise those values would be too verbose compared - // to the actual error message which contains a combined view of these two - // input values. - return inspect(this, _objectSpread({}, ctx, { - customInspect: false, - depth: 0 - })); - } - }]); - - return AssertionError; -}(_wrapNativeSuper(Error)); - -module.exports = AssertionError; - -/***/ }), - -/***/ "./node_modules/assert/build/internal/errors.js": -/*!******************************************************!*\ - !*** ./node_modules/assert/build/internal/errors.js ***! - \******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Currently in sync with Node.js lib/internal/errors.js -// https://github.com/nodejs/node/commit/3b044962c48fe313905877a96b5d0894a5404f6f - -/* eslint node-core/documented-errors: "error" */ - -/* eslint node-core/alphabetize-errors: "error" */ - -/* eslint node-core/prefer-util-format-errors: "error" */ - // The whole point behind this internal module is to allow Node.js to no -// longer be forced to treat every error message change as a semver-major -// change. The NodeError classes here all expose a `code` property whose -// value statically and permanently identifies the error. While the error -// message may change, the code should not. - -function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } - -function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } - -function _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === "object" || typeof call === "function")) { return call; } return _assertThisInitialized(self); } - -function _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError("this hasn't been initialised - super() hasn't been called"); } return self; } - -function _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); } - -function _inherits(subClass, superClass) { if (typeof superClass !== "function" && superClass !== null) { throw new TypeError("Super expression must either be null or a function"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); } - -function _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); } - -var codes = {}; // Lazy loaded - -var assert; -var util; - -function createErrorType(code, message, Base) { - if (!Base) { - Base = Error; - } - - function getMessage(arg1, arg2, arg3) { - if (typeof message === 'string') { - return message; - } else { - return message(arg1, arg2, arg3); - } - } - - var NodeError = - /*#__PURE__*/ - function (_Base) { - _inherits(NodeError, _Base); - - function NodeError(arg1, arg2, arg3) { - var _this; - - _classCallCheck(this, NodeError); - - _this = _possibleConstructorReturn(this, _getPrototypeOf(NodeError).call(this, getMessage(arg1, arg2, arg3))); - _this.code = code; - return _this; - } - - return NodeError; - }(Base); - - codes[code] = NodeError; -} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js - - -function oneOf(expected, thing) { - if (Array.isArray(expected)) { - var len = expected.length; - expected = expected.map(function (i) { - return String(i); - }); - - if (len > 2) { - return "one of ".concat(thing, " ").concat(expected.slice(0, len - 1).join(', '), ", or ") + expected[len - 1]; - } else if (len === 2) { - return "one of ".concat(thing, " ").concat(expected[0], " or ").concat(expected[1]); - } else { - return "of ".concat(thing, " ").concat(expected[0]); - } - } else { - return "of ".concat(thing, " ").concat(String(expected)); - } -} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith - - -function startsWith(str, search, pos) { - return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search; -} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith - - -function endsWith(str, search, this_len) { - if (this_len === undefined || this_len > str.length) { - this_len = str.length; - } - - return str.substring(this_len - search.length, this_len) === search; -} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes - - -function includes(str, search, start) { - if (typeof start !== 'number') { - start = 0; - } - - if (start + search.length > str.length) { - return false; - } else { - return str.indexOf(search, start) !== -1; - } -} - -createErrorType('ERR_AMBIGUOUS_ARGUMENT', 'The "%s" argument is ambiguous. %s', TypeError); -createErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) { - if (assert === undefined) assert = __webpack_require__(/*! ../assert */ "./node_modules/assert/build/assert.js"); - assert(typeof name === 'string', "'name' must be a string"); // determiner: 'must be' or 'must not be' - - var determiner; - - if (typeof expected === 'string' && startsWith(expected, 'not ')) { - determiner = 'must not be'; - expected = expected.replace(/^not /, ''); - } else { - determiner = 'must be'; - } - - var msg; - - if (endsWith(name, ' argument')) { - // For cases like 'first argument' - msg = "The ".concat(name, " ").concat(determiner, " ").concat(oneOf(expected, 'type')); - } else { - var type = includes(name, '.') ? 'property' : 'argument'; - msg = "The \"".concat(name, "\" ").concat(type, " ").concat(determiner, " ").concat(oneOf(expected, 'type')); - } // TODO(BridgeAR): Improve the output by showing `null` and similar. - - - msg += ". Received type ".concat(_typeof(actual)); - return msg; -}, TypeError); -createErrorType('ERR_INVALID_ARG_VALUE', function (name, value) { - var reason = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'is invalid'; - if (util === undefined) util = __webpack_require__(/*! util/ */ "./node_modules/util/util.js"); - var inspected = util.inspect(value); - - if (inspected.length > 128) { - inspected = "".concat(inspected.slice(0, 128), "..."); - } - - return "The argument '".concat(name, "' ").concat(reason, ". Received ").concat(inspected); -}, TypeError, RangeError); -createErrorType('ERR_INVALID_RETURN_VALUE', function (input, name, value) { - var type; - - if (value && value.constructor && value.constructor.name) { - type = "instance of ".concat(value.constructor.name); - } else { - type = "type ".concat(_typeof(value)); - } - - return "Expected ".concat(input, " to be returned from the \"").concat(name, "\"") + " function but got ".concat(type, "."); -}, TypeError); -createErrorType('ERR_MISSING_ARGS', function () { - for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { - args[_key] = arguments[_key]; - } - - if (assert === undefined) assert = __webpack_require__(/*! ../assert */ "./node_modules/assert/build/assert.js"); - assert(args.length > 0, 'At least one arg needs to be specified'); - var msg = 'The '; - var len = args.length; - args = args.map(function (a) { - return "\"".concat(a, "\""); - }); - - switch (len) { - case 1: - msg += "".concat(args[0], " argument"); - break; - - case 2: - msg += "".concat(args[0], " and ").concat(args[1], " arguments"); - break; - - default: - msg += args.slice(0, len - 1).join(', '); - msg += ", and ".concat(args[len - 1], " arguments"); - break; - } - - return "".concat(msg, " must be specified"); -}, TypeError); -module.exports.codes = codes; - -/***/ }), - -/***/ "./node_modules/assert/build/internal/util/comparisons.js": -/*!****************************************************************!*\ - !*** ./node_modules/assert/build/internal/util/comparisons.js ***! - \****************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Currently in sync with Node.js lib/internal/util/comparisons.js -// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9 - - -function _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); } - -function _nonIterableRest() { throw new TypeError("Invalid attempt to destructure non-iterable instance"); } - -function _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i["return"] != null) _i["return"](); } finally { if (_d) throw _e; } } return _arr; } - -function _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; } - -function _typeof(obj) { if (typeof Symbol === "function" && typeof Symbol.iterator === "symbol") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === "function" && obj.constructor === Symbol && obj !== Symbol.prototype ? "symbol" : typeof obj; }; } return _typeof(obj); } - -var regexFlagsSupported = /a/g.flags !== undefined; - -var arrayFromSet = function arrayFromSet(set) { - var array = []; - set.forEach(function (value) { - return array.push(value); - }); - return array; -}; - -var arrayFromMap = function arrayFromMap(map) { - var array = []; - map.forEach(function (value, key) { - return array.push([key, value]); - }); - return array; -}; - -var objectIs = Object.is ? Object.is : __webpack_require__(/*! object-is */ "./node_modules/object-is/index.js"); -var objectGetOwnPropertySymbols = Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols : function () { - return []; -}; -var numberIsNaN = Number.isNaN ? Number.isNaN : __webpack_require__(/*! is-nan */ "./node_modules/is-nan/index.js"); - -function uncurryThis(f) { - return f.call.bind(f); -} - -var hasOwnProperty = uncurryThis(Object.prototype.hasOwnProperty); -var propertyIsEnumerable = uncurryThis(Object.prototype.propertyIsEnumerable); -var objectToString = uncurryThis(Object.prototype.toString); - -var _require$types = __webpack_require__(/*! util/ */ "./node_modules/util/util.js").types, - isAnyArrayBuffer = _require$types.isAnyArrayBuffer, - isArrayBufferView = _require$types.isArrayBufferView, - isDate = _require$types.isDate, - isMap = _require$types.isMap, - isRegExp = _require$types.isRegExp, - isSet = _require$types.isSet, - isNativeError = _require$types.isNativeError, - isBoxedPrimitive = _require$types.isBoxedPrimitive, - isNumberObject = _require$types.isNumberObject, - isStringObject = _require$types.isStringObject, - isBooleanObject = _require$types.isBooleanObject, - isBigIntObject = _require$types.isBigIntObject, - isSymbolObject = _require$types.isSymbolObject, - isFloat32Array = _require$types.isFloat32Array, - isFloat64Array = _require$types.isFloat64Array; - -function isNonIndex(key) { - if (key.length === 0 || key.length > 10) return true; - - for (var i = 0; i < key.length; i++) { - var code = key.charCodeAt(i); - if (code < 48 || code > 57) return true; - } // The maximum size for an array is 2 ** 32 -1. - - - return key.length === 10 && key >= Math.pow(2, 32); -} - -function getOwnNonIndexProperties(value) { - return Object.keys(value).filter(isNonIndex).concat(objectGetOwnPropertySymbols(value).filter(Object.prototype.propertyIsEnumerable.bind(value))); -} // Taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js -// original notice: - -/*! - * The buffer module from node.js, for the browser. - * - * @author Feross Aboukhadijeh - * @license MIT - */ - - -function compare(a, b) { - if (a === b) { - return 0; - } - - var x = a.length; - var y = b.length; - - for (var i = 0, len = Math.min(x, y); i < len; ++i) { - if (a[i] !== b[i]) { - x = a[i]; - y = b[i]; - break; - } - } - - if (x < y) { - return -1; - } - - if (y < x) { - return 1; - } - - return 0; -} - -var ONLY_ENUMERABLE = undefined; -var kStrict = true; -var kLoose = false; -var kNoIterator = 0; -var kIsArray = 1; -var kIsSet = 2; -var kIsMap = 3; // Check if they have the same source and flags - -function areSimilarRegExps(a, b) { - return regexFlagsSupported ? a.source === b.source && a.flags === b.flags : RegExp.prototype.toString.call(a) === RegExp.prototype.toString.call(b); -} - -function areSimilarFloatArrays(a, b) { - if (a.byteLength !== b.byteLength) { - return false; - } - - for (var offset = 0; offset < a.byteLength; offset++) { - if (a[offset] !== b[offset]) { - return false; - } - } - - return true; -} - -function areSimilarTypedArrays(a, b) { - if (a.byteLength !== b.byteLength) { - return false; - } - - return compare(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)) === 0; -} - -function areEqualArrayBuffers(buf1, buf2) { - return buf1.byteLength === buf2.byteLength && compare(new Uint8Array(buf1), new Uint8Array(buf2)) === 0; -} - -function isEqualBoxedPrimitive(val1, val2) { - if (isNumberObject(val1)) { - return isNumberObject(val2) && objectIs(Number.prototype.valueOf.call(val1), Number.prototype.valueOf.call(val2)); - } - - if (isStringObject(val1)) { - return isStringObject(val2) && String.prototype.valueOf.call(val1) === String.prototype.valueOf.call(val2); - } - - if (isBooleanObject(val1)) { - return isBooleanObject(val2) && Boolean.prototype.valueOf.call(val1) === Boolean.prototype.valueOf.call(val2); - } - - if (isBigIntObject(val1)) { - return isBigIntObject(val2) && BigInt.prototype.valueOf.call(val1) === BigInt.prototype.valueOf.call(val2); - } - - return isSymbolObject(val2) && Symbol.prototype.valueOf.call(val1) === Symbol.prototype.valueOf.call(val2); -} // Notes: Type tags are historical [[Class]] properties that can be set by -// FunctionTemplate::SetClassName() in C++ or Symbol.toStringTag in JS -// and retrieved using Object.prototype.toString.call(obj) in JS -// See https://tc39.github.io/ecma262/#sec-object.prototype.tostring -// for a list of tags pre-defined in the spec. -// There are some unspecified tags in the wild too (e.g. typed array tags). -// Since tags can be altered, they only serve fast failures -// -// Typed arrays and buffers are checked by comparing the content in their -// underlying ArrayBuffer. This optimization requires that it's -// reasonable to interpret their underlying memory in the same way, -// which is checked by comparing their type tags. -// (e.g. a Uint8Array and a Uint16Array with the same memory content -// could still be different because they will be interpreted differently). -// -// For strict comparison, objects should have -// a) The same built-in type tags -// b) The same prototypes. - - -function innerDeepEqual(val1, val2, strict, memos) { - // All identical values are equivalent, as determined by ===. - if (val1 === val2) { - if (val1 !== 0) return true; - return strict ? objectIs(val1, val2) : true; - } // Check more closely if val1 and val2 are equal. - - - if (strict) { - if (_typeof(val1) !== 'object') { - return typeof val1 === 'number' && numberIsNaN(val1) && numberIsNaN(val2); - } - - if (_typeof(val2) !== 'object' || val1 === null || val2 === null) { - return false; - } - - if (Object.getPrototypeOf(val1) !== Object.getPrototypeOf(val2)) { - return false; - } - } else { - if (val1 === null || _typeof(val1) !== 'object') { - if (val2 === null || _typeof(val2) !== 'object') { - // eslint-disable-next-line eqeqeq - return val1 == val2; - } - - return false; - } - - if (val2 === null || _typeof(val2) !== 'object') { - return false; - } - } - - var val1Tag = objectToString(val1); - var val2Tag = objectToString(val2); - - if (val1Tag !== val2Tag) { - return false; - } - - if (Array.isArray(val1)) { - // Check for sparse arrays and general fast path - if (val1.length !== val2.length) { - return false; - } - - var keys1 = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE); - var keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE); - - if (keys1.length !== keys2.length) { - return false; - } - - return keyCheck(val1, val2, strict, memos, kIsArray, keys1); - } // [browserify] This triggers on certain types in IE (Map/Set) so we don't - // wan't to early return out of the rest of the checks. However we can check - // if the second value is one of these values and the first isn't. - - - if (val1Tag === '[object Object]') { - // return keyCheck(val1, val2, strict, memos, kNoIterator); - if (!isMap(val1) && isMap(val2) || !isSet(val1) && isSet(val2)) { - return false; - } - } - - if (isDate(val1)) { - if (!isDate(val2) || Date.prototype.getTime.call(val1) !== Date.prototype.getTime.call(val2)) { - return false; - } - } else if (isRegExp(val1)) { - if (!isRegExp(val2) || !areSimilarRegExps(val1, val2)) { - return false; - } - } else if (isNativeError(val1) || val1 instanceof Error) { - // Do not compare the stack as it might differ even though the error itself - // is otherwise identical. - if (val1.message !== val2.message || val1.name !== val2.name) { - return false; - } - } else if (isArrayBufferView(val1)) { - if (!strict && (isFloat32Array(val1) || isFloat64Array(val1))) { - if (!areSimilarFloatArrays(val1, val2)) { - return false; - } - } else if (!areSimilarTypedArrays(val1, val2)) { - return false; - } // Buffer.compare returns true, so val1.length === val2.length. If they both - // only contain numeric keys, we don't need to exam further than checking - // the symbols. - - - var _keys = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE); - - var _keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE); - - if (_keys.length !== _keys2.length) { - return false; - } - - return keyCheck(val1, val2, strict, memos, kNoIterator, _keys); - } else if (isSet(val1)) { - if (!isSet(val2) || val1.size !== val2.size) { - return false; - } - - return keyCheck(val1, val2, strict, memos, kIsSet); - } else if (isMap(val1)) { - if (!isMap(val2) || val1.size !== val2.size) { - return false; - } - - return keyCheck(val1, val2, strict, memos, kIsMap); - } else if (isAnyArrayBuffer(val1)) { - if (!areEqualArrayBuffers(val1, val2)) { - return false; - } - } else if (isBoxedPrimitive(val1) && !isEqualBoxedPrimitive(val1, val2)) { - return false; - } - - return keyCheck(val1, val2, strict, memos, kNoIterator); -} - -function getEnumerables(val, keys) { - return keys.filter(function (k) { - return propertyIsEnumerable(val, k); - }); -} - -function keyCheck(val1, val2, strict, memos, iterationType, aKeys) { - // For all remaining Object pairs, including Array, objects and Maps, - // equivalence is determined by having: - // a) The same number of owned enumerable properties - // b) The same set of keys/indexes (although not necessarily the same order) - // c) Equivalent values for every corresponding key/index - // d) For Sets and Maps, equal contents - // Note: this accounts for both named and indexed properties on Arrays. - if (arguments.length === 5) { - aKeys = Object.keys(val1); - var bKeys = Object.keys(val2); // The pair must have the same number of owned properties. - - if (aKeys.length !== bKeys.length) { - return false; - } - } // Cheap key test - - - var i = 0; - - for (; i < aKeys.length; i++) { - if (!hasOwnProperty(val2, aKeys[i])) { - return false; - } - } - - if (strict && arguments.length === 5) { - var symbolKeysA = objectGetOwnPropertySymbols(val1); - - if (symbolKeysA.length !== 0) { - var count = 0; - - for (i = 0; i < symbolKeysA.length; i++) { - var key = symbolKeysA[i]; - - if (propertyIsEnumerable(val1, key)) { - if (!propertyIsEnumerable(val2, key)) { - return false; - } - - aKeys.push(key); - count++; - } else if (propertyIsEnumerable(val2, key)) { - return false; - } - } - - var symbolKeysB = objectGetOwnPropertySymbols(val2); - - if (symbolKeysA.length !== symbolKeysB.length && getEnumerables(val2, symbolKeysB).length !== count) { - return false; - } - } else { - var _symbolKeysB = objectGetOwnPropertySymbols(val2); - - if (_symbolKeysB.length !== 0 && getEnumerables(val2, _symbolKeysB).length !== 0) { - return false; - } - } - } - - if (aKeys.length === 0 && (iterationType === kNoIterator || iterationType === kIsArray && val1.length === 0 || val1.size === 0)) { - return true; - } // Use memos to handle cycles. - - - if (memos === undefined) { - memos = { - val1: new Map(), - val2: new Map(), - position: 0 - }; - } else { - // We prevent up to two map.has(x) calls by directly retrieving the value - // and checking for undefined. The map can only contain numbers, so it is - // safe to check for undefined only. - var val2MemoA = memos.val1.get(val1); - - if (val2MemoA !== undefined) { - var val2MemoB = memos.val2.get(val2); - - if (val2MemoB !== undefined) { - return val2MemoA === val2MemoB; - } - } - - memos.position++; - } - - memos.val1.set(val1, memos.position); - memos.val2.set(val2, memos.position); - var areEq = objEquiv(val1, val2, strict, aKeys, memos, iterationType); - memos.val1.delete(val1); - memos.val2.delete(val2); - return areEq; -} - -function setHasEqualElement(set, val1, strict, memo) { - // Go looking. - var setValues = arrayFromSet(set); - - for (var i = 0; i < setValues.length; i++) { - var val2 = setValues[i]; - - if (innerDeepEqual(val1, val2, strict, memo)) { - // Remove the matching element to make sure we do not check that again. - set.delete(val2); - return true; - } - } - - return false; -} // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Equality_comparisons_and_sameness#Loose_equality_using -// Sadly it is not possible to detect corresponding values properly in case the -// type is a string, number, bigint or boolean. The reason is that those values -// can match lots of different string values (e.g., 1n == '+00001'). - - -function findLooseMatchingPrimitives(prim) { - switch (_typeof(prim)) { - case 'undefined': - return null; - - case 'object': - // Only pass in null as object! - return undefined; - - case 'symbol': - return false; - - case 'string': - prim = +prim; - // Loose equal entries exist only if the string is possible to convert to - // a regular number and not NaN. - // Fall through - - case 'number': - if (numberIsNaN(prim)) { - return false; - } - - } - - return true; -} - -function setMightHaveLoosePrim(a, b, prim) { - var altValue = findLooseMatchingPrimitives(prim); - if (altValue != null) return altValue; - return b.has(altValue) && !a.has(altValue); -} - -function mapMightHaveLoosePrim(a, b, prim, item, memo) { - var altValue = findLooseMatchingPrimitives(prim); - - if (altValue != null) { - return altValue; - } - - var curB = b.get(altValue); - - if (curB === undefined && !b.has(altValue) || !innerDeepEqual(item, curB, false, memo)) { - return false; - } - - return !a.has(altValue) && innerDeepEqual(item, curB, false, memo); -} - -function setEquiv(a, b, strict, memo) { - // This is a lazily initiated Set of entries which have to be compared - // pairwise. - var set = null; - var aValues = arrayFromSet(a); - - for (var i = 0; i < aValues.length; i++) { - var val = aValues[i]; // Note: Checking for the objects first improves the performance for object - // heavy sets but it is a minor slow down for primitives. As they are fast - // to check this improves the worst case scenario instead. - - if (_typeof(val) === 'object' && val !== null) { - if (set === null) { - set = new Set(); - } // If the specified value doesn't exist in the second set its an not null - // object (or non strict only: a not matching primitive) we'll need to go - // hunting for something thats deep-(strict-)equal to it. To make this - // O(n log n) complexity we have to copy these values in a new set first. - - - set.add(val); - } else if (!b.has(val)) { - if (strict) return false; // Fast path to detect missing string, symbol, undefined and null values. - - if (!setMightHaveLoosePrim(a, b, val)) { - return false; - } - - if (set === null) { - set = new Set(); - } - - set.add(val); - } - } - - if (set !== null) { - var bValues = arrayFromSet(b); - - for (var _i = 0; _i < bValues.length; _i++) { - var _val = bValues[_i]; // We have to check if a primitive value is already - // matching and only if it's not, go hunting for it. - - if (_typeof(_val) === 'object' && _val !== null) { - if (!setHasEqualElement(set, _val, strict, memo)) return false; - } else if (!strict && !a.has(_val) && !setHasEqualElement(set, _val, strict, memo)) { - return false; - } - } - - return set.size === 0; - } - - return true; -} - -function mapHasEqualEntry(set, map, key1, item1, strict, memo) { - // To be able to handle cases like: - // Map([[{}, 'a'], [{}, 'b']]) vs Map([[{}, 'b'], [{}, 'a']]) - // ... we need to consider *all* matching keys, not just the first we find. - var setValues = arrayFromSet(set); - - for (var i = 0; i < setValues.length; i++) { - var key2 = setValues[i]; - - if (innerDeepEqual(key1, key2, strict, memo) && innerDeepEqual(item1, map.get(key2), strict, memo)) { - set.delete(key2); - return true; - } - } - - return false; -} - -function mapEquiv(a, b, strict, memo) { - var set = null; - var aEntries = arrayFromMap(a); - - for (var i = 0; i < aEntries.length; i++) { - var _aEntries$i = _slicedToArray(aEntries[i], 2), - key = _aEntries$i[0], - item1 = _aEntries$i[1]; - - if (_typeof(key) === 'object' && key !== null) { - if (set === null) { - set = new Set(); - } - - set.add(key); - } else { - // By directly retrieving the value we prevent another b.has(key) check in - // almost all possible cases. - var item2 = b.get(key); - - if (item2 === undefined && !b.has(key) || !innerDeepEqual(item1, item2, strict, memo)) { - if (strict) return false; // Fast path to detect missing string, symbol, undefined and null - // keys. - - if (!mapMightHaveLoosePrim(a, b, key, item1, memo)) return false; - - if (set === null) { - set = new Set(); - } - - set.add(key); - } - } - } - - if (set !== null) { - var bEntries = arrayFromMap(b); - - for (var _i2 = 0; _i2 < bEntries.length; _i2++) { - var _bEntries$_i = _slicedToArray(bEntries[_i2], 2), - key = _bEntries$_i[0], - item = _bEntries$_i[1]; - - if (_typeof(key) === 'object' && key !== null) { - if (!mapHasEqualEntry(set, a, key, item, strict, memo)) return false; - } else if (!strict && (!a.has(key) || !innerDeepEqual(a.get(key), item, false, memo)) && !mapHasEqualEntry(set, a, key, item, false, memo)) { - return false; - } - } - - return set.size === 0; - } - - return true; -} - -function objEquiv(a, b, strict, keys, memos, iterationType) { - // Sets and maps don't have their entries accessible via normal object - // properties. - var i = 0; - - if (iterationType === kIsSet) { - if (!setEquiv(a, b, strict, memos)) { - return false; - } - } else if (iterationType === kIsMap) { - if (!mapEquiv(a, b, strict, memos)) { - return false; - } - } else if (iterationType === kIsArray) { - for (; i < a.length; i++) { - if (hasOwnProperty(a, i)) { - if (!hasOwnProperty(b, i) || !innerDeepEqual(a[i], b[i], strict, memos)) { - return false; - } - } else if (hasOwnProperty(b, i)) { - return false; - } else { - // Array is sparse. - var keysA = Object.keys(a); - - for (; i < keysA.length; i++) { - var key = keysA[i]; - - if (!hasOwnProperty(b, key) || !innerDeepEqual(a[key], b[key], strict, memos)) { - return false; - } - } - - if (keysA.length !== Object.keys(b).length) { - return false; - } - - return true; - } - } - } // The pair must have equivalent values for every corresponding key. - // Possibly expensive deep test: - - - for (i = 0; i < keys.length; i++) { - var _key = keys[i]; - - if (!innerDeepEqual(a[_key], b[_key], strict, memos)) { - return false; - } - } - - return true; -} - -function isDeepEqual(val1, val2) { - return innerDeepEqual(val1, val2, kLoose); -} - -function isDeepStrictEqual(val1, val2) { - return innerDeepEqual(val1, val2, kStrict); -} - -module.exports = { - isDeepEqual: isDeepEqual, - isDeepStrictEqual: isDeepStrictEqual -}; - -/***/ }), - -/***/ "./node_modules/available-typed-arrays/index.js": -/*!******************************************************!*\ - !*** ./node_modules/available-typed-arrays/index.js ***! - \******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var possibleNames = [ - 'BigInt64Array', - 'BigUint64Array', - 'Float32Array', - 'Float64Array', - 'Int16Array', - 'Int32Array', - 'Int8Array', - 'Uint16Array', - 'Uint32Array', - 'Uint8Array', - 'Uint8ClampedArray' -]; - -module.exports = function availableTypedArrays() { - var out = []; - for (var i = 0; i < possibleNames.length; i++) { - if (typeof __webpack_require__.g[possibleNames[i]] === 'function') { - out[out.length] = possibleNames[i]; - } - } - return out; -}; - - -/***/ }), - -/***/ "./node_modules/base64-js/index.js": -/*!*****************************************!*\ - !*** ./node_modules/base64-js/index.js ***! - \*****************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - -exports.byteLength = byteLength -exports.toByteArray = toByteArray -exports.fromByteArray = fromByteArray - -var lookup = [] -var revLookup = [] -var Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array - -var code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/' -for (var i = 0, len = code.length; i < len; ++i) { - lookup[i] = code[i] - revLookup[code.charCodeAt(i)] = i -} - -// Support decoding URL-safe base64 strings, as Node.js does. -// See: https://en.wikipedia.org/wiki/Base64#URL_applications -revLookup['-'.charCodeAt(0)] = 62 -revLookup['_'.charCodeAt(0)] = 63 - -function getLens (b64) { - var len = b64.length - - if (len % 4 > 0) { - throw new Error('Invalid string. Length must be a multiple of 4') - } - - // Trim off extra bytes after placeholder bytes are found - // See: https://github.com/beatgammit/base64-js/issues/42 - var validLen = b64.indexOf('=') - if (validLen === -1) validLen = len - - var placeHoldersLen = validLen === len - ? 0 - : 4 - (validLen % 4) - - return [validLen, placeHoldersLen] -} - -// base64 is 4/3 + up to two characters of the original data -function byteLength (b64) { - var lens = getLens(b64) - var validLen = lens[0] - var placeHoldersLen = lens[1] - return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen -} - -function _byteLength (b64, validLen, placeHoldersLen) { - return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen -} - -function toByteArray (b64) { - var tmp - var lens = getLens(b64) - var validLen = lens[0] - var placeHoldersLen = lens[1] - - var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen)) - - var curByte = 0 - - // if there are placeholders, only get up to the last complete 4 chars - var len = placeHoldersLen > 0 - ? validLen - 4 - : validLen - - var i - for (i = 0; i < len; i += 4) { - tmp = - (revLookup[b64.charCodeAt(i)] << 18) | - (revLookup[b64.charCodeAt(i + 1)] << 12) | - (revLookup[b64.charCodeAt(i + 2)] << 6) | - revLookup[b64.charCodeAt(i + 3)] - arr[curByte++] = (tmp >> 16) & 0xFF - arr[curByte++] = (tmp >> 8) & 0xFF - arr[curByte++] = tmp & 0xFF - } - - if (placeHoldersLen === 2) { - tmp = - (revLookup[b64.charCodeAt(i)] << 2) | - (revLookup[b64.charCodeAt(i + 1)] >> 4) - arr[curByte++] = tmp & 0xFF - } - - if (placeHoldersLen === 1) { - tmp = - (revLookup[b64.charCodeAt(i)] << 10) | - (revLookup[b64.charCodeAt(i + 1)] << 4) | - (revLookup[b64.charCodeAt(i + 2)] >> 2) - arr[curByte++] = (tmp >> 8) & 0xFF - arr[curByte++] = tmp & 0xFF - } - - return arr -} - -function tripletToBase64 (num) { - return lookup[num >> 18 & 0x3F] + - lookup[num >> 12 & 0x3F] + - lookup[num >> 6 & 0x3F] + - lookup[num & 0x3F] -} - -function encodeChunk (uint8, start, end) { - var tmp - var output = [] - for (var i = start; i < end; i += 3) { - tmp = - ((uint8[i] << 16) & 0xFF0000) + - ((uint8[i + 1] << 8) & 0xFF00) + - (uint8[i + 2] & 0xFF) - output.push(tripletToBase64(tmp)) - } - return output.join('') -} - -function fromByteArray (uint8) { - var tmp - var len = uint8.length - var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes - var parts = [] - var maxChunkLength = 16383 // must be multiple of 3 - - // go through the array every three bytes, we'll deal with trailing stuff later - for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) { - parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength))) - } - - // pad the end with zeros, but make sure to not forget the extra bytes - if (extraBytes === 1) { - tmp = uint8[len - 1] - parts.push( - lookup[tmp >> 2] + - lookup[(tmp << 4) & 0x3F] + - '==' - ) - } else if (extraBytes === 2) { - tmp = (uint8[len - 2] << 8) + uint8[len - 1] - parts.push( - lookup[tmp >> 10] + - lookup[(tmp >> 4) & 0x3F] + - lookup[(tmp << 2) & 0x3F] + - '=' - ) - } - - return parts.join('') -} - - -/***/ }), - -/***/ "./node_modules/bencode/lib/decode.js": -/*!********************************************!*\ - !*** ./node_modules/bencode/lib/decode.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -const INTEGER_START = 0x69 // 'i' -const STRING_DELIM = 0x3A // ':' -const DICTIONARY_START = 0x64 // 'd' -const LIST_START = 0x6C // 'l' -const END_OF_TYPE = 0x65 // 'e' - -/** - * replaces parseInt(buffer.toString('ascii', start, end)). - * For strings with less then ~30 charachters, this is actually a lot faster. - * - * @param {Buffer} data - * @param {Number} start - * @param {Number} end - * @return {Number} calculated number - */ -function getIntFromBuffer (buffer, start, end) { - let sum = 0 - let sign = 1 - - for (let i = start; i < end; i++) { - const num = buffer[i] - - if (num < 58 && num >= 48) { - sum = sum * 10 + (num - 48) - continue - } - - if (i === start && num === 43) { // + - continue - } - - if (i === start && num === 45) { // - - sign = -1 - continue - } - - if (num === 46) { // . - // its a float. break here. - break - } - - throw new Error('not a number: buffer[' + i + '] = ' + num) - } - - return sum * sign -} - -/** - * Decodes bencoded data. - * - * @param {Buffer} data - * @param {Number} start (optional) - * @param {Number} end (optional) - * @param {String} encoding (optional) - * @return {Object|Array|Buffer|String|Number} - */ -function decode (data, start, end, encoding) { - if (data == null || data.length === 0) { - return null - } - - if (typeof start !== 'number' && encoding == null) { - encoding = start - start = undefined - } - - if (typeof end !== 'number' && encoding == null) { - encoding = end - end = undefined - } - - decode.position = 0 - decode.encoding = encoding || null - - decode.data = !(Buffer.isBuffer(data)) - ? Buffer.from(data) - : data.slice(start, end) - - decode.bytes = decode.data.length - - return decode.next() -} - -decode.bytes = 0 -decode.position = 0 -decode.data = null -decode.encoding = null - -decode.next = function () { - switch (decode.data[decode.position]) { - case DICTIONARY_START: - return decode.dictionary() - case LIST_START: - return decode.list() - case INTEGER_START: - return decode.integer() - default: - return decode.buffer() - } -} - -decode.find = function (chr) { - let i = decode.position - const c = decode.data.length - const d = decode.data - - while (i < c) { - if (d[i] === chr) return i - i++ - } - - throw new Error( - 'Invalid data: Missing delimiter "' + - String.fromCharCode(chr) + '" [0x' + - chr.toString(16) + ']' - ) -} - -decode.dictionary = function () { - decode.position++ - - const dict = {} - - while (decode.data[decode.position] !== END_OF_TYPE) { - dict[decode.buffer()] = decode.next() - } - - decode.position++ - - return dict -} - -decode.list = function () { - decode.position++ - - const lst = [] - - while (decode.data[decode.position] !== END_OF_TYPE) { - lst.push(decode.next()) - } - - decode.position++ - - return lst -} - -decode.integer = function () { - const end = decode.find(END_OF_TYPE) - const number = getIntFromBuffer(decode.data, decode.position + 1, end) - - decode.position += end + 1 - decode.position - - return number -} - -decode.buffer = function () { - let sep = decode.find(STRING_DELIM) - const length = getIntFromBuffer(decode.data, decode.position, sep) - const end = ++sep + length - - decode.position = end - - return decode.encoding - ? decode.data.toString(decode.encoding, sep, end) - : decode.data.slice(sep, end) -} - -module.exports = decode - - -/***/ }), - -/***/ "./node_modules/bencode/lib/encode.js": -/*!********************************************!*\ - !*** ./node_modules/bencode/lib/encode.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -const { getType } = __webpack_require__(/*! ./util.js */ "./node_modules/bencode/lib/util.js") - -/** - * Encodes data in bencode. - * - * @param {Buffer|Array|String|Object|Number|Boolean} data - * @return {Buffer} - */ -function encode (data, buffer, offset) { - const buffers = [] - let result = null - - encode._encode(buffers, data) - result = Buffer.concat(buffers) - encode.bytes = result.length - - if (Buffer.isBuffer(buffer)) { - result.copy(buffer, offset) - return buffer - } - - return result -} - -encode.bytes = -1 -encode._floatConversionDetected = false - -encode._encode = function (buffers, data) { - if (data == null) { return } - - switch (getType(data)) { - case 'buffer': encode.buffer(buffers, data); break - case 'object': encode.dict(buffers, data); break - case 'map': encode.dictMap(buffers, data); break - case 'array': encode.list(buffers, data); break - case 'set': encode.listSet(buffers, data); break - case 'string': encode.string(buffers, data); break - case 'number': encode.number(buffers, data); break - case 'boolean': encode.number(buffers, data); break - case 'arraybufferview': encode.buffer(buffers, Buffer.from(data.buffer, data.byteOffset, data.byteLength)); break - case 'arraybuffer': encode.buffer(buffers, Buffer.from(data)); break - } -} - -const buffE = Buffer.from('e') -const buffD = Buffer.from('d') -const buffL = Buffer.from('l') - -encode.buffer = function (buffers, data) { - buffers.push(Buffer.from(data.length + ':'), data) -} - -encode.string = function (buffers, data) { - buffers.push(Buffer.from(Buffer.byteLength(data) + ':' + data)) -} - -encode.number = function (buffers, data) { - const maxLo = 0x80000000 - const hi = (data / maxLo) << 0 - const lo = (data % maxLo) << 0 - const val = hi * maxLo + lo - - buffers.push(Buffer.from('i' + val + 'e')) - - if (val !== data && !encode._floatConversionDetected) { - encode._floatConversionDetected = true - console.warn( - 'WARNING: Possible data corruption detected with value "' + data + '":', - 'Bencoding only defines support for integers, value was converted to "' + val + '"' - ) - console.trace() - } -} - -encode.dict = function (buffers, data) { - buffers.push(buffD) - - let j = 0 - let k - // fix for issue #13 - sorted dicts - const keys = Object.keys(data).sort() - const kl = keys.length - - for (; j < kl; j++) { - k = keys[j] - if (data[k] == null) continue - encode.string(buffers, k) - encode._encode(buffers, data[k]) - } - - buffers.push(buffE) -} - -encode.dictMap = function (buffers, data) { - buffers.push(buffD) - - const keys = Array.from(data.keys()).sort() - - for (const key of keys) { - if (data.get(key) == null) continue - Buffer.isBuffer(key) - ? encode._encode(buffers, key) - : encode.string(buffers, String(key)) - encode._encode(buffers, data.get(key)) - } - - buffers.push(buffE) -} - -encode.list = function (buffers, data) { - let i = 0 - const c = data.length - buffers.push(buffL) - - for (; i < c; i++) { - if (data[i] == null) continue - encode._encode(buffers, data[i]) - } - - buffers.push(buffE) -} - -encode.listSet = function (buffers, data) { - buffers.push(buffL) - - for (const item of data) { - if (item == null) continue - encode._encode(buffers, item) - } - - buffers.push(buffE) -} - -module.exports = encode - - -/***/ }), - -/***/ "./node_modules/bencode/lib/encoding-length.js": -/*!*****************************************************!*\ - !*** ./node_modules/bencode/lib/encoding-length.js ***! - \*****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -const { digitCount, getType } = __webpack_require__(/*! ./util.js */ "./node_modules/bencode/lib/util.js") - -function listLength (list) { - let length = 1 + 1 // type marker + end-of-type marker - - for (const value of list) { - length += encodingLength(value) - } - - return length -} - -function mapLength (map) { - let length = 1 + 1 // type marker + end-of-type marker - - for (const [key, value] of map) { - const keyLength = Buffer.byteLength(key) - length += digitCount(keyLength) + 1 + keyLength - length += encodingLength(value) - } - - return length -} - -function objectLength (value) { - let length = 1 + 1 // type marker + end-of-type marker - const keys = Object.keys(value) - - for (let i = 0; i < keys.length; i++) { - const keyLength = Buffer.byteLength(keys[i]) - length += digitCount(keyLength) + 1 + keyLength - length += encodingLength(value[keys[i]]) - } - - return length -} - -function stringLength (value) { - const length = Buffer.byteLength(value) - return digitCount(length) + 1 + length -} - -function arrayBufferLength (value) { - const length = value.byteLength - value.byteOffset - return digitCount(length) + 1 + length -} - -function encodingLength (value) { - const length = 0 - - if (value == null) return length - - const type = getType(value) - - switch (type) { - case 'buffer': return digitCount(value.length) + 1 + value.length - case 'arraybufferview': return arrayBufferLength(value) - case 'string': return stringLength(value) - case 'array': case 'set': return listLength(value) - case 'number': return 1 + digitCount(Math.floor(value)) + 1 - case 'bigint': return 1 + value.toString().length + 1 - case 'object': return objectLength(value) - case 'map': return mapLength(value) - default: - throw new TypeError(`Unsupported value of type "${type}"`) - } -} - -module.exports = encodingLength - - -/***/ }), - -/***/ "./node_modules/bencode/lib/index.js": -/*!*******************************************!*\ - !*** ./node_modules/bencode/lib/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const bencode = module.exports - -bencode.encode = __webpack_require__(/*! ./encode.js */ "./node_modules/bencode/lib/encode.js") -bencode.decode = __webpack_require__(/*! ./decode.js */ "./node_modules/bencode/lib/decode.js") - -/** - * Determines the amount of bytes - * needed to encode the given value - * @param {Object|Array|Buffer|String|Number|Boolean} value - * @return {Number} byteCount - */ -bencode.byteLength = bencode.encodingLength = __webpack_require__(/*! ./encoding-length.js */ "./node_modules/bencode/lib/encoding-length.js") - - -/***/ }), - -/***/ "./node_modules/bencode/lib/util.js": -/*!******************************************!*\ - !*** ./node_modules/bencode/lib/util.js ***! - \******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -const util = module.exports - -util.digitCount = function digitCount (value) { - // Add a digit for negative numbers, as the sign will be prefixed - const sign = value < 0 ? 1 : 0 - // Guard against negative numbers & zero going into log10(), - // as that would return -Infinity - value = Math.abs(Number(value || 1)) - return Math.floor(Math.log10(value)) + 1 + sign -} - -util.getType = function getType (value) { - if (Buffer.isBuffer(value)) return 'buffer' - if (ArrayBuffer.isView(value)) return 'arraybufferview' - if (Array.isArray(value)) return 'array' - if (value instanceof Number) return 'number' - if (value instanceof Boolean) return 'boolean' - if (value instanceof Set) return 'set' - if (value instanceof Map) return 'map' - if (value instanceof String) return 'string' - if (value instanceof ArrayBuffer) return 'arraybuffer' - return typeof value -} - - -/***/ }), - -/***/ "./node_modules/bep53-range/index.js": -/*!*******************************************!*\ - !*** ./node_modules/bep53-range/index.js ***! - \*******************************************/ -/***/ ((module) => { - -module.exports = parseRange -module.exports.parse = parseRange -module.exports.compose = composeRange - -function composeRange (range) { - return range - .reduce((acc, cur, idx, arr) => { - if (idx === 0 || cur !== arr[idx - 1] + 1) acc.push([]) - acc[acc.length - 1].push(cur) - return acc - }, []) - .map((cur) => { - return cur.length > 1 ? `${cur[0]}-${cur[cur.length - 1]}` : `${cur[0]}` - }) -} - -function parseRange (range) { - const generateRange = (start, end = start) => Array.from({ length: end - start + 1 }, (cur, idx) => idx + start) - - return range - .reduce((acc, cur, idx, arr) => { - const r = cur.split('-').map(cur => parseInt(cur)) - return acc.concat(generateRange(...r)) - }, []) -} - - -/***/ }), - -/***/ "./node_modules/binary-search/index.js": -/*!*********************************************!*\ - !*** ./node_modules/binary-search/index.js ***! - \*********************************************/ -/***/ ((module) => { - -module.exports = function(haystack, needle, comparator, low, high) { - var mid, cmp; - - if(low === undefined) - low = 0; - - else { - low = low|0; - if(low < 0 || low >= haystack.length) - throw new RangeError("invalid lower bound"); - } - - if(high === undefined) - high = haystack.length - 1; - - else { - high = high|0; - if(high < low || high >= haystack.length) - throw new RangeError("invalid upper bound"); - } - - while(low <= high) { - // The naive `low + high >>> 1` could fail for array lengths > 2**31 - // because `>>>` converts its operands to int32. `low + (high - low >>> 1)` - // works for array lengths <= 2**32-1 which is also Javascript's max array - // length. - mid = low + ((high - low) >>> 1); - cmp = +comparator(haystack[mid], needle, mid, haystack); - - // Too low. - if(cmp < 0.0) - low = mid + 1; - - // Too high. - else if(cmp > 0.0) - high = mid - 1; - - // Key found. - else - return mid; - } - - // Key not found. - return ~low; -} - - -/***/ }), - -/***/ "./node_modules/bitfield/lib/index.js": -/*!********************************************!*\ - !*** ./node_modules/bitfield/lib/index.js ***! - \********************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -function getByteSize(num) { - var out = num >> 3; - if (num % 8 !== 0) - out++; - return out; -} -var BitField = /** @class */ (function () { - /** - * - * - * @param data Either a number representing the maximum number of supported bytes, or a Uint8Array. - * @param opts Options for the bitfield. - */ - function BitField(data, opts) { - if (data === void 0) { data = 0; } - var grow = opts === null || opts === void 0 ? void 0 : opts.grow; - this.grow = (grow && isFinite(grow) && getByteSize(grow)) || grow || 0; - this.buffer = - typeof data === "number" ? new Uint8Array(getByteSize(data)) : data; - } - /** - * Get a particular bit. - * - * @param i Bit index to retrieve. - * @returns A boolean indicating whether the `i`th bit is set. - */ - BitField.prototype.get = function (i) { - var j = i >> 3; - return j < this.buffer.length && !!(this.buffer[j] & (128 >> i % 8)); - }; - /** - * Set a particular bit. - * - * Will grow the underlying array if the bit is out of bounds and the `grow` option is set. - * - * @param i Bit index to set. - * @param value Value to set the bit to. Defaults to `true`. - */ - BitField.prototype.set = function (i, value) { - if (value === void 0) { value = true; } - var j = i >> 3; - if (value) { - if (this.buffer.length < j + 1) { - var length_1 = Math.max(j + 1, Math.min(2 * this.buffer.length, this.grow)); - if (length_1 <= this.grow) { - var newBuffer = new Uint8Array(length_1); - newBuffer.set(this.buffer); - this.buffer = newBuffer; - } - } - // Set - this.buffer[j] |= 128 >> i % 8; - } - else if (j < this.buffer.length) { - // Clear - this.buffer[j] &= ~(128 >> i % 8); - } - }; - /** - * Loop through the bits in the bitfield. - * - * @param fn Function to be called with the bit value and index. - * @param start Index of the first bit to look at. - * @param end Index of the first bit that should no longer be considered. - */ - BitField.prototype.forEach = function (fn, start, end) { - if (start === void 0) { start = 0; } - if (end === void 0) { end = this.buffer.length * 8; } - for (var i = start, j = i >> 3, y = 128 >> i % 8, byte = this.buffer[j]; i < end; i++) { - fn(!!(byte & y), i); - y = y === 1 ? ((byte = this.buffer[++j]), 128) : y >> 1; - } - }; - return BitField; -}()); -exports.default = BitField; - - -/***/ }), - -/***/ "./node_modules/bittorrent-protocol/index.js": -/*!***************************************************!*\ - !*** ./node_modules/bittorrent-protocol/index.js ***! - \***************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! bittorrent-protocol. MIT License. WebTorrent LLC */ -const arrayRemove = __webpack_require__(/*! unordered-array-remove */ "./node_modules/unordered-array-remove/index.js") -const bencode = __webpack_require__(/*! bencode */ "./node_modules/bencode/lib/index.js") -const BitField = __webpack_require__(/*! bitfield */ "./node_modules/bitfield/lib/index.js").default -const crypto = __webpack_require__(/*! crypto */ "./node_modules/crypto-browserify/index.js") -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('bittorrent-protocol') -const randombytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") -const sha1 = __webpack_require__(/*! simple-sha1 */ "./node_modules/simple-sha1/browser.js") -const speedometer = __webpack_require__(/*! speedometer */ "./node_modules/speedometer/index.js") -const stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -const RC4 = __webpack_require__(/*! rc4 */ "./node_modules/rc4/rc4.js") - -const BITFIELD_GROW = 400000 -const KEEP_ALIVE_TIMEOUT = 55000 - -const MESSAGE_PROTOCOL = Buffer.from('\u0013BitTorrent protocol') -const MESSAGE_KEEP_ALIVE = Buffer.from([0x00, 0x00, 0x00, 0x00]) -const MESSAGE_CHOKE = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x00]) -const MESSAGE_UNCHOKE = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x01]) -const MESSAGE_INTERESTED = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x02]) -const MESSAGE_UNINTERESTED = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x03]) - -const MESSAGE_RESERVED = [0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00] -const MESSAGE_PORT = [0x00, 0x00, 0x00, 0x03, 0x09, 0x00, 0x00] - -const DH_PRIME = 'ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a36210000000000090563' -const DH_GENERATOR = 2 -const VC = Buffer.from([0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]) -const CRYPTO_PROVIDE = Buffer.from([0x00, 0x00, 0x01, 0x02]) -const CRYPTO_SELECT = Buffer.from([0x00, 0x00, 0x00, 0x02]) // always try to choose RC4 encryption instead of plaintext - -function xor (a, b) { - for (let len = a.length; len--;) a[len] ^= b[len] - return a -} - -class Request { - constructor (piece, offset, length, callback) { - this.piece = piece - this.offset = offset - this.length = length - this.callback = callback - } -} - -class Wire extends stream.Duplex { - constructor (type = null, retries = 0, peEnabled = false) { - super() - - this._debugId = randombytes(4).toString('hex') - this._debug('new wire') - - this.peerId = null // remote peer id (hex string) - this.peerIdBuffer = null // remote peer id (buffer) - this.type = type // connection type ('webrtc', 'tcpIncoming', 'tcpOutgoing', 'webSeed') - - this.amChoking = true // are we choking the peer? - this.amInterested = false // are we interested in the peer? - - this.peerChoking = true // is the peer choking us? - this.peerInterested = false // is the peer interested in us? - - // The largest torrent that I know of (the Geocities archive) is ~641 GB and has - // ~41,000 pieces. Therefore, cap bitfield to 10x larger (400,000 bits) to support all - // possible torrents but prevent malicious peers from growing bitfield to fill memory. - this.peerPieces = new BitField(0, { grow: BITFIELD_GROW }) - - this.peerExtensions = {} - - this.requests = [] // outgoing - this.peerRequests = [] // incoming - - this.extendedMapping = {} // number -> string, ex: 1 -> 'ut_metadata' - this.peerExtendedMapping = {} // string -> number, ex: 9 -> 'ut_metadata' - - // The extended handshake to send, minus the "m" field, which gets automatically - // filled from `this.extendedMapping` - this.extendedHandshake = {} - - this.peerExtendedHandshake = {} // remote peer's extended handshake - - this._ext = {} // string -> function, ex 'ut_metadata' -> ut_metadata() - this._nextExt = 1 - - this.uploaded = 0 - this.downloaded = 0 - this.uploadSpeed = speedometer() - this.downloadSpeed = speedometer() - - this._keepAliveInterval = null - this._timeout = null - this._timeoutMs = 0 - this._timeoutExpiresAt = null - - this.destroyed = false // was the wire ended by calling `destroy`? - this._finished = false - - this._parserSize = 0 // number of needed bytes to parse next message from remote peer - this._parser = null // function to call once `this._parserSize` bytes are available - - this._buffer = [] // incomplete message data - this._bufferSize = 0 // cached total length of buffers in `this._buffer` - - this._peEnabled = peEnabled - if (peEnabled) { - this._dh = crypto.createDiffieHellman(DH_PRIME, 'hex', DH_GENERATOR) // crypto object used to generate keys/secret - this._myPubKey = this._dh.generateKeys('hex') // my DH public key - } else { - this._myPubKey = null - } - this._peerPubKey = null // peer's DH public key - this._sharedSecret = null // shared DH secret - this._peerCryptoProvide = [] // encryption methods provided by peer; we expect this to always contain 0x02 - this._cryptoHandshakeDone = false - - this._cryptoSyncPattern = null // the pattern to search for when resynchronizing after receiving pe1/pe2 - this._waitMaxBytes = null // the maximum number of bytes resynchronization must occur within - this._encryptionMethod = null // 1 for plaintext, 2 for RC4 - this._encryptGenerator = null // RC4 keystream generator for encryption - this._decryptGenerator = null // RC4 keystream generator for decryption - this._setGenerators = false // a flag for whether setEncrypt() has successfully completed - - this.once('finish', () => this._onFinish()) - - this.on('finish', this._onFinish) - this._debug('type:', this.type) - - if (this.type === 'tcpIncoming' && this._peEnabled) { - // If we are not the initiator, we should wait to see if the client begins - // with PE/MSE handshake or the standard bittorrent handshake. - this._determineHandshakeType() - } else if (this.type === 'tcpOutgoing' && this._peEnabled && retries === 0) { - this._parsePe2() - } else { - this._parseHandshake(null) - } - } - - /** - * Set whether to send a "keep-alive" ping (sent every 55s) - * @param {boolean} enable - */ - setKeepAlive (enable) { - this._debug('setKeepAlive %s', enable) - clearInterval(this._keepAliveInterval) - if (enable === false) return - this._keepAliveInterval = setInterval(() => { - this.keepAlive() - }, KEEP_ALIVE_TIMEOUT) - } - - /** - * Set the amount of time to wait before considering a request to be "timed out" - * @param {number} ms - * @param {boolean=} unref (should the timer be unref'd? default: false) - */ - setTimeout (ms, unref) { - this._debug('setTimeout ms=%d unref=%s', ms, unref) - this._timeoutMs = ms - this._timeoutUnref = !!unref - this._resetTimeout(true) - } - - destroy () { - if (this.destroyed) return - this.destroyed = true - this._debug('destroy') - this.emit('close') - this.end() - } - - end (...args) { - this._debug('end') - this._onUninterested() - this._onChoke() - super.end(...args) - } - - /** - * Use the specified protocol extension. - * @param {function} Extension - */ - use (Extension) { - const name = Extension.prototype.name - if (!name) { - throw new Error('Extension class requires a "name" property on the prototype') - } - this._debug('use extension.name=%s', name) - - const ext = this._nextExt - const handler = new Extension(this) - - function noop () {} - - if (typeof handler.onHandshake !== 'function') { - handler.onHandshake = noop - } - if (typeof handler.onExtendedHandshake !== 'function') { - handler.onExtendedHandshake = noop - } - if (typeof handler.onMessage !== 'function') { - handler.onMessage = noop - } - - this.extendedMapping[ext] = name - this._ext[name] = handler - this[name] = handler - - this._nextExt += 1 - } - - // - // OUTGOING MESSAGES - // - - /** - * Message "keep-alive": - */ - keepAlive () { - this._debug('keep-alive') - this._push(MESSAGE_KEEP_ALIVE) - } - - sendPe1 () { - if (this._peEnabled) { - const padALen = Math.floor(Math.random() * 513) - const padA = randombytes(padALen) - this._push(Buffer.concat([Buffer.from(this._myPubKey, 'hex'), padA])) - } - } - - sendPe2 () { - const padBLen = Math.floor(Math.random() * 513) - const padB = randombytes(padBLen) - this._push(Buffer.concat([Buffer.from(this._myPubKey, 'hex'), padB])) - } - - sendPe3 (infoHash) { - this.setEncrypt(this._sharedSecret, infoHash) - - const hash1Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req1') + this._sharedSecret, 'hex')), 'hex') - - const hash2Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req2') + infoHash, 'hex')), 'hex') - const hash3Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req3') + this._sharedSecret, 'hex')), 'hex') - const hashesXorBuffer = xor(hash2Buffer, hash3Buffer) - - const padCLen = randombytes(2).readUInt16BE(0) % 512 - const padCBuffer = randombytes(padCLen) - - let vcAndProvideBuffer = Buffer.alloc(8 + 4 + 2 + padCLen + 2) - VC.copy(vcAndProvideBuffer) - CRYPTO_PROVIDE.copy(vcAndProvideBuffer, 8) - - vcAndProvideBuffer.writeInt16BE(padCLen, 12) // pad C length - padCBuffer.copy(vcAndProvideBuffer, 14) - vcAndProvideBuffer.writeInt16BE(0, 14 + padCLen) // IA length - vcAndProvideBuffer = this._encryptHandshake(vcAndProvideBuffer) - - this._push(Buffer.concat([hash1Buffer, hashesXorBuffer, vcAndProvideBuffer])) - } - - sendPe4 (infoHash) { - this.setEncrypt(this._sharedSecret, infoHash) - - const padDLen = randombytes(2).readUInt16BE(0) % 512 - const padDBuffer = randombytes(padDLen) - let vcAndSelectBuffer = Buffer.alloc(8 + 4 + 2 + padDLen) - VC.copy(vcAndSelectBuffer) - CRYPTO_SELECT.copy(vcAndSelectBuffer, 8) - vcAndSelectBuffer.writeInt16BE(padDLen, 12) // lenD? - padDBuffer.copy(vcAndSelectBuffer, 14) - vcAndSelectBuffer = this._encryptHandshake(vcAndSelectBuffer) - this._push(vcAndSelectBuffer) - this._cryptoHandshakeDone = true - this._debug('completed crypto handshake') - } - - /** - * Message: "handshake" - * @param {Buffer|string} infoHash (as Buffer or *hex* string) - * @param {Buffer|string} peerId - * @param {Object} extensions - */ - handshake (infoHash, peerId, extensions) { - let infoHashBuffer - let peerIdBuffer - if (typeof infoHash === 'string') { - infoHash = infoHash.toLowerCase() - infoHashBuffer = Buffer.from(infoHash, 'hex') - } else { - infoHashBuffer = infoHash - infoHash = infoHashBuffer.toString('hex') - } - if (typeof peerId === 'string') { - peerIdBuffer = Buffer.from(peerId, 'hex') - } else { - peerIdBuffer = peerId - peerId = peerIdBuffer.toString('hex') - } - - this._infoHash = infoHashBuffer - - if (infoHashBuffer.length !== 20 || peerIdBuffer.length !== 20) { - throw new Error('infoHash and peerId MUST have length 20') - } - - this._debug('handshake i=%s p=%s exts=%o', infoHash, peerId, extensions) - - const reserved = Buffer.from(MESSAGE_RESERVED) - - // enable extended message - reserved[5] |= 0x10 - - if (extensions && extensions.dht) reserved[7] |= 1 - - this._push(Buffer.concat([MESSAGE_PROTOCOL, reserved, infoHashBuffer, peerIdBuffer])) - this._handshakeSent = true - - if (this.peerExtensions.extended && !this._extendedHandshakeSent) { - // Peer's handshake indicated support already - // (incoming connection) - this._sendExtendedHandshake() - } - } - - /* Peer supports BEP-0010, send extended handshake. - * - * This comes after the 'handshake' event to give the user a chance to populate - * `this.extendedHandshake` and `this.extendedMapping` before the extended handshake - * is sent to the remote peer. - */ - _sendExtendedHandshake () { - // Create extended message object from registered extensions - const msg = Object.assign({}, this.extendedHandshake) - msg.m = {} - for (const ext in this.extendedMapping) { - const name = this.extendedMapping[ext] - msg.m[name] = Number(ext) - } - - // Send extended handshake - this.extended(0, bencode.encode(msg)) - this._extendedHandshakeSent = true - } - - /** - * Message "choke": - */ - choke () { - if (this.amChoking) return - this.amChoking = true - this._debug('choke') - while (this.peerRequests.length) { - this.peerRequests.pop() - } - this._push(MESSAGE_CHOKE) - } - - /** - * Message "unchoke": - */ - unchoke () { - if (!this.amChoking) return - this.amChoking = false - this._debug('unchoke') - this._push(MESSAGE_UNCHOKE) - } - - /** - * Message "interested": - */ - interested () { - if (this.amInterested) return - this.amInterested = true - this._debug('interested') - this._push(MESSAGE_INTERESTED) - } - - /** - * Message "uninterested": - */ - uninterested () { - if (!this.amInterested) return - this.amInterested = false - this._debug('uninterested') - this._push(MESSAGE_UNINTERESTED) - } - - /** - * Message "have": - * @param {number} index - */ - have (index) { - this._debug('have %d', index) - this._message(4, [index], null) - } - - /** - * Message "bitfield": - * @param {BitField|Buffer} bitfield - */ - bitfield (bitfield) { - this._debug('bitfield') - if (!Buffer.isBuffer(bitfield)) bitfield = bitfield.buffer - this._message(5, [], bitfield) - } - - /** - * Message "request": - * @param {number} index - * @param {number} offset - * @param {number} length - * @param {function} cb - */ - request (index, offset, length, cb) { - if (!cb) cb = () => {} - if (this._finished) return cb(new Error('wire is closed')) - if (this.peerChoking) return cb(new Error('peer is choking')) - - this._debug('request index=%d offset=%d length=%d', index, offset, length) - - this.requests.push(new Request(index, offset, length, cb)) - if (!this._timeout) { - this._resetTimeout(true) - } - this._message(6, [index, offset, length], null) - } - - /** - * Message "piece": - * @param {number} index - * @param {number} offset - * @param {Buffer} buffer - */ - piece (index, offset, buffer) { - this._debug('piece index=%d offset=%d', index, offset) - this._message(7, [index, offset], buffer) - this.uploaded += buffer.length - this.uploadSpeed(buffer.length) - this.emit('upload', buffer.length) - } - - /** - * Message "cancel": - * @param {number} index - * @param {number} offset - * @param {number} length - */ - cancel (index, offset, length) { - this._debug('cancel index=%d offset=%d length=%d', index, offset, length) - this._callback( - this._pull(this.requests, index, offset, length), - new Error('request was cancelled'), - null - ) - this._message(8, [index, offset, length], null) - } - - /** - * Message: "port" - * @param {Number} port - */ - port (port) { - this._debug('port %d', port) - const message = Buffer.from(MESSAGE_PORT) - message.writeUInt16BE(port, 5) - this._push(message) - } - - /** - * Message: "extended" - * @param {number|string} ext - * @param {Object} obj - */ - extended (ext, obj) { - this._debug('extended ext=%s', ext) - if (typeof ext === 'string' && this.peerExtendedMapping[ext]) { - ext = this.peerExtendedMapping[ext] - } - if (typeof ext === 'number') { - const extId = Buffer.from([ext]) - const buf = Buffer.isBuffer(obj) ? obj : bencode.encode(obj) - - this._message(20, [], Buffer.concat([extId, buf])) - } else { - throw new Error(`Unrecognized extension: ${ext}`) - } - } - - /** - * Sets the encryption method for this wire, as per PSE/ME specification - * - * @param {string} sharedSecret: A hex-encoded string, which is the shared secret agreed - * upon from DH key exchange - * @param {string} infoHash: A hex-encoded info hash - * @returns boolean, true if encryption setting succeeds, false if it fails. - */ - setEncrypt (sharedSecret, infoHash) { - let encryptKey - let decryptKey - let encryptKeyBuf - let encryptKeyIntArray - let decryptKeyBuf - let decryptKeyIntArray - switch (this.type) { - case 'tcpIncoming': - encryptKey = sha1.sync(Buffer.from(this._utfToHex('keyB') + sharedSecret + infoHash, 'hex')) - decryptKey = sha1.sync(Buffer.from(this._utfToHex('keyA') + sharedSecret + infoHash, 'hex')) - encryptKeyBuf = Buffer.from(encryptKey, 'hex') - encryptKeyIntArray = [] - for (const value of encryptKeyBuf.values()) { - encryptKeyIntArray.push(value) - } - decryptKeyBuf = Buffer.from(decryptKey, 'hex') - decryptKeyIntArray = [] - for (const value of decryptKeyBuf.values()) { - decryptKeyIntArray.push(value) - } - this._encryptGenerator = new RC4(encryptKeyIntArray) - this._decryptGenerator = new RC4(decryptKeyIntArray) - break - case 'tcpOutgoing': - encryptKey = sha1.sync(Buffer.from(this._utfToHex('keyA') + sharedSecret + infoHash, 'hex')) - decryptKey = sha1.sync(Buffer.from(this._utfToHex('keyB') + sharedSecret + infoHash, 'hex')) - encryptKeyBuf = Buffer.from(encryptKey, 'hex') - encryptKeyIntArray = [] - for (const value of encryptKeyBuf.values()) { - encryptKeyIntArray.push(value) - } - decryptKeyBuf = Buffer.from(decryptKey, 'hex') - decryptKeyIntArray = [] - for (const value of decryptKeyBuf.values()) { - decryptKeyIntArray.push(value) - } - this._encryptGenerator = new RC4(encryptKeyIntArray) - this._decryptGenerator = new RC4(decryptKeyIntArray) - break - default: - return false - } - - // Discard the first 1024 bytes, as per MSE/PE implementation - for (let i = 0; i < 1024; i++) { - this._encryptGenerator.randomByte() - this._decryptGenerator.randomByte() - } - - this._setGenerators = true - return true - } - - /** - * Duplex stream method. Called whenever the remote peer stream wants data. No-op - * since we'll just push data whenever we get it. - */ - _read () {} - - /** - * Send a message to the remote peer. - */ - _message (id, numbers, data) { - const dataLength = data ? data.length : 0 - const buffer = Buffer.allocUnsafe(5 + (4 * numbers.length)) - - buffer.writeUInt32BE(buffer.length + dataLength - 4, 0) - buffer[4] = id - for (let i = 0; i < numbers.length; i++) { - buffer.writeUInt32BE(numbers[i], 5 + (4 * i)) - } - - this._push(buffer) - if (data) this._push(data) - } - - _push (data) { - if (this._finished) return - if (this._encryptionMethod === 2 && this._cryptoHandshakeDone) { - data = this._encrypt(data) - } - return this.push(data) - } - - // - // INCOMING MESSAGES - // - - _onKeepAlive () { - this._debug('got keep-alive') - this.emit('keep-alive') - } - - _onPe1 (pubKeyBuffer) { - this._peerPubKey = pubKeyBuffer.toString('hex') - this._sharedSecret = this._dh.computeSecret(this._peerPubKey, 'hex', 'hex') - this.emit('pe1') - } - - _onPe2 (pubKeyBuffer) { - this._peerPubKey = pubKeyBuffer.toString('hex') - this._sharedSecret = this._dh.computeSecret(this._peerPubKey, 'hex', 'hex') - this.emit('pe2') - } - - _onPe3 (hashesXorBuffer) { - const hash3 = sha1.sync(Buffer.from(this._utfToHex('req3') + this._sharedSecret, 'hex')) - const sKeyHash = xor(Buffer.from(hash3, 'hex'), hashesXorBuffer).toString('hex') - this.emit('pe3', sKeyHash) - } - - _onPe3Encrypted (vcBuffer, peerProvideBuffer) { - if (!vcBuffer.equals(VC)) { - this._debug('Error: verification constant did not match') - this.destroy() - return - } - - for (const provideByte of peerProvideBuffer.values()) { - if (provideByte !== 0) { - this._peerCryptoProvide.push(provideByte) - } - } - if (this._peerCryptoProvide.includes(2)) { - this._encryptionMethod = 2 - } else { - this._debug('Error: RC4 encryption method not provided by peer') - this.destroy() - } - } - - _onPe4 (peerSelectBuffer) { - this._encryptionMethod = peerSelectBuffer.readUInt8(3) - if (!CRYPTO_PROVIDE.includes(this._encryptionMethod)) { - this._debug('Error: peer selected invalid crypto method') - this.destroy() - } - this._cryptoHandshakeDone = true - this._debug('crypto handshake done') - this.emit('pe4') - } - - _onHandshake (infoHashBuffer, peerIdBuffer, extensions) { - const infoHash = infoHashBuffer.toString('hex') - const peerId = peerIdBuffer.toString('hex') - - this._debug('got handshake i=%s p=%s exts=%o', infoHash, peerId, extensions) - - this.peerId = peerId - this.peerIdBuffer = peerIdBuffer - this.peerExtensions = extensions - - this.emit('handshake', infoHash, peerId, extensions) - - for (const name in this._ext) { - this._ext[name].onHandshake(infoHash, peerId, extensions) - } - - if (extensions.extended && this._handshakeSent && - !this._extendedHandshakeSent) { - // outgoing connection - this._sendExtendedHandshake() - } - } - - _onChoke () { - this.peerChoking = true - this._debug('got choke') - this.emit('choke') - while (this.requests.length) { - this._callback(this.requests.pop(), new Error('peer is choking'), null) - } - } - - _onUnchoke () { - this.peerChoking = false - this._debug('got unchoke') - this.emit('unchoke') - } - - _onInterested () { - this.peerInterested = true - this._debug('got interested') - this.emit('interested') - } - - _onUninterested () { - this.peerInterested = false - this._debug('got uninterested') - this.emit('uninterested') - } - - _onHave (index) { - if (this.peerPieces.get(index)) return - this._debug('got have %d', index) - - this.peerPieces.set(index, true) - this.emit('have', index) - } - - _onBitField (buffer) { - this.peerPieces = new BitField(buffer) - this._debug('got bitfield') - this.emit('bitfield', this.peerPieces) - } - - _onRequest (index, offset, length) { - if (this.amChoking) return - this._debug('got request index=%d offset=%d length=%d', index, offset, length) - - const respond = (err, buffer) => { - if (request !== this._pull(this.peerRequests, index, offset, length)) return - if (err) return this._debug('error satisfying request index=%d offset=%d length=%d (%s)', index, offset, length, err.message) - this.piece(index, offset, buffer) - } - - const request = new Request(index, offset, length, respond) - this.peerRequests.push(request) - this.emit('request', index, offset, length, respond) - } - - _onPiece (index, offset, buffer) { - this._debug('got piece index=%d offset=%d', index, offset) - this._callback(this._pull(this.requests, index, offset, buffer.length), null, buffer) - this.downloaded += buffer.length - this.downloadSpeed(buffer.length) - this.emit('download', buffer.length) - this.emit('piece', index, offset, buffer) - } - - _onCancel (index, offset, length) { - this._debug('got cancel index=%d offset=%d length=%d', index, offset, length) - this._pull(this.peerRequests, index, offset, length) - this.emit('cancel', index, offset, length) - } - - _onPort (port) { - this._debug('got port %d', port) - this.emit('port', port) - } - - _onExtended (ext, buf) { - if (ext === 0) { - let info - try { - info = bencode.decode(buf) - } catch (err) { - this._debug('ignoring invalid extended handshake: %s', err.message || err) - } - - if (!info) return - this.peerExtendedHandshake = info - - if (typeof info.m === 'object') { - for (const name in info.m) { - this.peerExtendedMapping[name] = Number(info.m[name].toString()) - } - } - for (const name in this._ext) { - if (this.peerExtendedMapping[name]) { - this._ext[name].onExtendedHandshake(this.peerExtendedHandshake) - } - } - this._debug('got extended handshake') - this.emit('extended', 'handshake', this.peerExtendedHandshake) - } else { - if (this.extendedMapping[ext]) { - ext = this.extendedMapping[ext] // friendly name for extension - if (this._ext[ext]) { - // there is an registered extension handler, so call it - this._ext[ext].onMessage(buf) - } - } - this._debug('got extended message ext=%s', ext) - this.emit('extended', ext, buf) - } - } - - _onTimeout () { - this._debug('request timed out') - this._callback(this.requests.shift(), new Error('request has timed out'), null) - this.emit('timeout') - } - - /** - * Duplex stream method. Called whenever the remote peer has data for us. Data that the - * remote peer sends gets buffered (i.e. not actually processed) until the right number - * of bytes have arrived, determined by the last call to `this._parse(number, callback)`. - * Once enough bytes have arrived to process the message, the callback function - * (i.e. `this._parser`) gets called with the full buffer of data. - * @param {Buffer} data - * @param {string} encoding - * @param {function} cb - */ - _write (data, encoding, cb) { - if (this._encryptionMethod === 2 && this._cryptoHandshakeDone) { - data = this._decrypt(data) - } - this._bufferSize += data.length - this._buffer.push(data) - if (this._buffer.length > 1) { - this._buffer = [Buffer.concat(this._buffer, this._bufferSize)] - } - // now this._buffer is an array containing a single Buffer - if (this._cryptoSyncPattern) { - const index = this._buffer[0].indexOf(this._cryptoSyncPattern) - if (index !== -1) { - this._buffer[0] = this._buffer[0].slice(index + this._cryptoSyncPattern.length) - this._bufferSize -= (index + this._cryptoSyncPattern.length) - this._cryptoSyncPattern = null - } else if (this._bufferSize + data.length > this._waitMaxBytes + this._cryptoSyncPattern.length) { - this._debug('Error: could not resynchronize') - this.destroy() - return - } - } - - while (this._bufferSize >= this._parserSize && !this._cryptoSyncPattern) { - if (this._parserSize === 0) { - this._parser(Buffer.from([])) - } else { - const buffer = this._buffer[0] - // console.log('buffer:', this._buffer) - this._bufferSize -= this._parserSize - this._buffer = this._bufferSize - ? [buffer.slice(this._parserSize)] - : [] - this._parser(buffer.slice(0, this._parserSize)) - } - } - - cb(null) // Signal that we're ready for more data - } - - _callback (request, err, buffer) { - if (!request) return - - this._resetTimeout(!this.peerChoking && !this._finished) - - request.callback(err, buffer) - } - - _resetTimeout (setAgain) { - if (!setAgain || !this._timeoutMs || !this.requests.length) { - clearTimeout(this._timeout) - this._timeout = null - this._timeoutExpiresAt = null - return - } - - const timeoutExpiresAt = Date.now() + this._timeoutMs - - if (this._timeout) { - // If existing expiration is already within 5% of correct, it's close enough - if (timeoutExpiresAt - this._timeoutExpiresAt < this._timeoutMs * 0.05) { - return - } - clearTimeout(this._timeout) - } - - this._timeoutExpiresAt = timeoutExpiresAt - this._timeout = setTimeout(() => this._onTimeout(), this._timeoutMs) - if (this._timeoutUnref && this._timeout.unref) this._timeout.unref() - } - - /** - * Takes a number of bytes that the local peer is waiting to receive from the remote peer - * in order to parse a complete message, and a callback function to be called once enough - * bytes have arrived. - * @param {number} size - * @param {function} parser - */ - _parse (size, parser) { - this._parserSize = size - this._parser = parser - } - - _parseUntil (pattern, maxBytes) { - this._cryptoSyncPattern = pattern - this._waitMaxBytes = maxBytes - } - - /** - * Handle the first 4 bytes of a message, to determine the length of bytes that must be - * waited for in order to have the whole message. - * @param {Buffer} buffer - */ - _onMessageLength (buffer) { - const length = buffer.readUInt32BE(0) - if (length > 0) { - this._parse(length, this._onMessage) - } else { - this._onKeepAlive() - this._parse(4, this._onMessageLength) - } - } - - /** - * Handle a message from the remote peer. - * @param {Buffer} buffer - */ - _onMessage (buffer) { - this._parse(4, this._onMessageLength) - switch (buffer[0]) { - case 0: - return this._onChoke() - case 1: - return this._onUnchoke() - case 2: - return this._onInterested() - case 3: - return this._onUninterested() - case 4: - return this._onHave(buffer.readUInt32BE(1)) - case 5: - return this._onBitField(buffer.slice(1)) - case 6: - return this._onRequest( - buffer.readUInt32BE(1), - buffer.readUInt32BE(5), - buffer.readUInt32BE(9) - ) - case 7: - return this._onPiece( - buffer.readUInt32BE(1), - buffer.readUInt32BE(5), - buffer.slice(9) - ) - case 8: - return this._onCancel( - buffer.readUInt32BE(1), - buffer.readUInt32BE(5), - buffer.readUInt32BE(9) - ) - case 9: - return this._onPort(buffer.readUInt16BE(1)) - case 20: - return this._onExtended(buffer.readUInt8(1), buffer.slice(2)) - default: - this._debug('got unknown message') - return this.emit('unknownmessage', buffer) - } - } - - _determineHandshakeType () { - this._parse(1, pstrLenBuffer => { - const pstrlen = pstrLenBuffer.readUInt8(0) - if (pstrlen === 19) { - this._parse(pstrlen + 48, this._onHandshakeBuffer) - } else { - this._parsePe1(pstrLenBuffer) - } - }) - } - - _parsePe1 (pubKeyPrefix) { - this._parse(95, pubKeySuffix => { - this._onPe1(Buffer.concat([pubKeyPrefix, pubKeySuffix])) - this._parsePe3() - }) - } - - _parsePe2 () { - this._parse(96, pubKey => { - this._onPe2(pubKey) - while (!this._setGenerators) { - // Wait until generators have been set - } - this._parsePe4() - }) - } - - // Handles the unencrypted portion of step 4 - _parsePe3 () { - const hash1Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req1') + this._sharedSecret, 'hex')), 'hex') - // synchronize on HASH('req1', S) - this._parseUntil(hash1Buffer, 512) - this._parse(20, buffer => { - this._onPe3(buffer) - while (!this._setGenerators) { - // Wait until generators have been set - } - this._parsePe3Encrypted() - }) - } - - _parsePe3Encrypted () { - this._parse(14, buffer => { - const vcBuffer = this._decryptHandshake(buffer.slice(0, 8)) - const peerProvideBuffer = this._decryptHandshake(buffer.slice(8, 12)) - const padCLen = this._decryptHandshake(buffer.slice(12, 14)).readUInt16BE(0) - this._parse(padCLen, padCBuffer => { - padCBuffer = this._decryptHandshake(padCBuffer) - this._parse(2, iaLenBuf => { - const iaLen = this._decryptHandshake(iaLenBuf).readUInt16BE(0) - this._parse(iaLen, iaBuffer => { - iaBuffer = this._decryptHandshake(iaBuffer) - this._onPe3Encrypted(vcBuffer, peerProvideBuffer, padCBuffer, iaBuffer) - const pstrlen = iaLen ? iaBuffer.readUInt8(0) : null - const protocol = iaLen ? iaBuffer.slice(1, 20) : null - if (pstrlen === 19 && protocol.toString() === 'BitTorrent protocol') { - this._onHandshakeBuffer(iaBuffer.slice(1)) - } else { - this._parseHandshake() - } - }) - }) - }) - }) - } - - _parsePe4 () { - // synchronize on ENCRYPT(VC). - // since we encrypt using bitwise xor, decryption and encryption are the same operation. - // calling _decryptHandshake here advances the decrypt generator keystream forward 8 bytes - const vcBufferEncrypted = this._decryptHandshake(VC) - this._parseUntil(vcBufferEncrypted, 512) - this._parse(6, buffer => { - const peerSelectBuffer = this._decryptHandshake(buffer.slice(0, 4)) - const padDLen = this._decryptHandshake(buffer.slice(4, 6)).readUInt16BE(0) - this._parse(padDLen, padDBuf => { - this._decryptHandshake(padDBuf) - this._onPe4(peerSelectBuffer) - this._parseHandshake(null) - }) - }) - } - - /** - * Reads the handshake as specified by the bittorrent wire protocol. - */ - _parseHandshake () { - this._parse(1, buffer => { - const pstrlen = buffer.readUInt8(0) - if (pstrlen !== 19) { - this._debug('Error: wire not speaking BitTorrent protocol (%s)', pstrlen.toString()) - this.end() - return - } - this._parse(pstrlen + 48, this._onHandshakeBuffer) - }) - } - - _onHandshakeBuffer (handshake) { - const protocol = handshake.slice(0, 19) - if (protocol.toString() !== 'BitTorrent protocol') { - this._debug('Error: wire not speaking BitTorrent protocol (%s)', protocol.toString()) - this.end() - return - } - handshake = handshake.slice(19) - this._onHandshake(handshake.slice(8, 28), handshake.slice(28, 48), { - dht: !!(handshake[7] & 0x01), // see bep_0005 - extended: !!(handshake[5] & 0x10) // see bep_0010 - }) - this._parse(4, this._onMessageLength) - } - - _onFinish () { - this._finished = true - - this.push(null) // stream cannot be half open, so signal the end of it - while (this.read()) { - // body intentionally empty - // consume and discard the rest of the stream data - } - - clearInterval(this._keepAliveInterval) - this._parse(Number.MAX_VALUE, () => {}) - while (this.peerRequests.length) { - this.peerRequests.pop() - } - while (this.requests.length) { - this._callback(this.requests.pop(), new Error('wire was closed'), null) - } - } - - _debug (...args) { - args[0] = `[${this._debugId}] ${args[0]}` - debug(...args) - } - - _pull (requests, piece, offset, length) { - for (let i = 0; i < requests.length; i++) { - const req = requests[i] - if (req.piece === piece && req.offset === offset && req.length === length) { - arrayRemove(requests, i) - return req - } - } - return null - } - - _encryptHandshake (buf) { - const crypt = Buffer.from(buf) - if (!this._encryptGenerator) { - this._debug('Warning: Encrypting without any generator') - return crypt - } - - for (let i = 0; i < buf.length; i++) { - const keystream = this._encryptGenerator.randomByte() - crypt[i] = crypt[i] ^ keystream - } - - return crypt - } - - _encrypt (buf) { - const crypt = Buffer.from(buf) - - if (!this._encryptGenerator || this._encryptionMethod !== 2) { - return crypt - } - for (let i = 0; i < buf.length; i++) { - const keystream = this._encryptGenerator.randomByte() - crypt[i] = crypt[i] ^ keystream - } - - return crypt - } - - _decryptHandshake (buf) { - const decrypt = Buffer.from(buf) - - if (!this._decryptGenerator) { - this._debug('Warning: Decrypting without any generator') - return decrypt - } - for (let i = 0; i < buf.length; i++) { - const keystream = this._decryptGenerator.randomByte() - decrypt[i] = decrypt[i] ^ keystream - } - - return decrypt - } - - _decrypt (buf) { - const decrypt = Buffer.from(buf) - - if (!this._decryptGenerator || this._encryptionMethod !== 2) { - return decrypt - } - for (let i = 0; i < buf.length; i++) { - const keystream = this._decryptGenerator.randomByte() - decrypt[i] = decrypt[i] ^ keystream - } - - return decrypt - } - - _utfToHex (str) { - return Buffer.from(str, 'utf8').toString('hex') - } -} - -module.exports = Wire - - -/***/ }), - -/***/ "./node_modules/bittorrent-tracker/client.js": -/*!***************************************************!*\ - !*** ./node_modules/bittorrent-tracker/client.js ***! - \***************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('bittorrent-tracker:client') -const EventEmitter = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const once = __webpack_require__(/*! once */ "./node_modules/once/once.js") -const parallel = __webpack_require__(/*! run-parallel */ "./node_modules/run-parallel/index.js") -const Peer = __webpack_require__(/*! simple-peer */ "./node_modules/simple-peer/index.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -const common = __webpack_require__(/*! ./lib/common */ "./node_modules/bittorrent-tracker/lib/common.js") -const HTTPTracker = __webpack_require__(/*! ./lib/client/http-tracker */ "?ed7a") // empty object in browser -const UDPTracker = __webpack_require__(/*! ./lib/client/udp-tracker */ "?5c78") // empty object in browser -const WebSocketTracker = __webpack_require__(/*! ./lib/client/websocket-tracker */ "./node_modules/bittorrent-tracker/lib/client/websocket-tracker.js") - -/** - * BitTorrent tracker client. - * - * Find torrent peers, to help a torrent client participate in a torrent swarm. - * - * @param {Object} opts options object - * @param {string|Buffer} opts.infoHash torrent info hash - * @param {string|Buffer} opts.peerId peer id - * @param {string|Array.} opts.announce announce - * @param {number} opts.port torrent client listening port - * @param {function} opts.getAnnounceOpts callback to provide data to tracker - * @param {number} opts.rtcConfig RTCPeerConnection configuration object - * @param {number} opts.userAgent User-Agent header for http requests - * @param {number} opts.wrtc custom webrtc impl (useful in node.js) - */ -class Client extends EventEmitter { - constructor (opts = {}) { - super() - - if (!opts.peerId) throw new Error('Option `peerId` is required') - if (!opts.infoHash) throw new Error('Option `infoHash` is required') - if (!opts.announce) throw new Error('Option `announce` is required') - if (!process.browser && !opts.port) throw new Error('Option `port` is required') - - this.peerId = typeof opts.peerId === 'string' - ? opts.peerId - : opts.peerId.toString('hex') - this._peerIdBuffer = Buffer.from(this.peerId, 'hex') - this._peerIdBinary = this._peerIdBuffer.toString('binary') - - this.infoHash = typeof opts.infoHash === 'string' - ? opts.infoHash.toLowerCase() - : opts.infoHash.toString('hex') - this._infoHashBuffer = Buffer.from(this.infoHash, 'hex') - this._infoHashBinary = this._infoHashBuffer.toString('binary') - - debug('new client %s', this.infoHash) - - this.destroyed = false - - this._port = opts.port - this._getAnnounceOpts = opts.getAnnounceOpts - this._rtcConfig = opts.rtcConfig - this._userAgent = opts.userAgent - - // Support lazy 'wrtc' module initialization - // See: https://github.com/webtorrent/webtorrent-hybrid/issues/46 - this._wrtc = typeof opts.wrtc === 'function' ? opts.wrtc() : opts.wrtc - - let announce = typeof opts.announce === 'string' - ? [opts.announce] - : opts.announce == null ? [] : opts.announce - - // Remove trailing slash from trackers to catch duplicates - announce = announce.map(announceUrl => { - announceUrl = announceUrl.toString() - if (announceUrl[announceUrl.length - 1] === '/') { - announceUrl = announceUrl.substring(0, announceUrl.length - 1) - } - return announceUrl - }) - // remove duplicates by converting to Set and back - announce = Array.from(new Set(announce)) - - const webrtcSupport = this._wrtc !== false && (!!this._wrtc || Peer.WEBRTC_SUPPORT) - - const nextTickWarn = err => { - queueMicrotask(() => { - this.emit('warning', err) - }) - } - - this._trackers = announce - .map(announceUrl => { - let parsedUrl - try { - parsedUrl = common.parseUrl(announceUrl) - } catch (err) { - nextTickWarn(new Error(`Invalid tracker URL: ${announceUrl}`)) - return null - } - - const port = parsedUrl.port - if (port < 0 || port > 65535) { - nextTickWarn(new Error(`Invalid tracker port: ${announceUrl}`)) - return null - } - - const protocol = parsedUrl.protocol - if ((protocol === 'http:' || protocol === 'https:') && - typeof HTTPTracker === 'function') { - return new HTTPTracker(this, announceUrl) - } else if (protocol === 'udp:' && typeof UDPTracker === 'function') { - return new UDPTracker(this, announceUrl) - } else if ((protocol === 'ws:' || protocol === 'wss:') && webrtcSupport) { - // Skip ws:// trackers on https:// sites because they throw SecurityError - if (protocol === 'ws:' && typeof window !== 'undefined' && - window.location.protocol === 'https:') { - nextTickWarn(new Error(`Unsupported tracker protocol: ${announceUrl}`)) - return null - } - return new WebSocketTracker(this, announceUrl) - } else { - nextTickWarn(new Error(`Unsupported tracker protocol: ${announceUrl}`)) - return null - } - }) - .filter(Boolean) - } - - /** - * Send a `start` announce to the trackers. - * @param {Object} opts - * @param {number=} opts.uploaded - * @param {number=} opts.downloaded - * @param {number=} opts.left (if not set, calculated automatically) - */ - start (opts) { - opts = this._defaultAnnounceOpts(opts) - opts.event = 'started' - debug('send `start` %o', opts) - this._announce(opts) - - // start announcing on intervals - this._trackers.forEach(tracker => { - tracker.setInterval() - }) - } - - /** - * Send a `stop` announce to the trackers. - * @param {Object} opts - * @param {number=} opts.uploaded - * @param {number=} opts.downloaded - * @param {number=} opts.numwant - * @param {number=} opts.left (if not set, calculated automatically) - */ - stop (opts) { - opts = this._defaultAnnounceOpts(opts) - opts.event = 'stopped' - debug('send `stop` %o', opts) - this._announce(opts) - } - - /** - * Send a `complete` announce to the trackers. - * @param {Object} opts - * @param {number=} opts.uploaded - * @param {number=} opts.downloaded - * @param {number=} opts.numwant - * @param {number=} opts.left (if not set, calculated automatically) - */ - complete (opts) { - if (!opts) opts = {} - opts = this._defaultAnnounceOpts(opts) - opts.event = 'completed' - debug('send `complete` %o', opts) - this._announce(opts) - } - - /** - * Send a `update` announce to the trackers. - * @param {Object} opts - * @param {number=} opts.uploaded - * @param {number=} opts.downloaded - * @param {number=} opts.numwant - * @param {number=} opts.left (if not set, calculated automatically) - */ - update (opts) { - opts = this._defaultAnnounceOpts(opts) - if (opts.event) delete opts.event - debug('send `update` %o', opts) - this._announce(opts) - } - - _announce (opts) { - this._trackers.forEach(tracker => { - // tracker should not modify `opts` object, it's passed to all trackers - tracker.announce(opts) - }) - } - - /** - * Send a scrape request to the trackers. - * @param {Object} opts - */ - scrape (opts) { - debug('send `scrape`') - if (!opts) opts = {} - this._trackers.forEach(tracker => { - // tracker should not modify `opts` object, it's passed to all trackers - tracker.scrape(opts) - }) - } - - setInterval (intervalMs) { - debug('setInterval %d', intervalMs) - this._trackers.forEach(tracker => { - tracker.setInterval(intervalMs) - }) - } - - destroy (cb) { - if (this.destroyed) return - this.destroyed = true - debug('destroy') - - const tasks = this._trackers.map(tracker => cb => { - tracker.destroy(cb) - }) - - parallel(tasks, cb) - - this._trackers = [] - this._getAnnounceOpts = null - } - - _defaultAnnounceOpts (opts = {}) { - if (opts.numwant == null) opts.numwant = common.DEFAULT_ANNOUNCE_PEERS - - if (opts.uploaded == null) opts.uploaded = 0 - if (opts.downloaded == null) opts.downloaded = 0 - - if (this._getAnnounceOpts) opts = Object.assign({}, opts, this._getAnnounceOpts()) - - return opts - } -} - -/** - * Simple convenience function to scrape a tracker for an info hash without needing to - * create a Client, pass it a parsed torrent, etc. Support scraping a tracker for multiple - * torrents at the same time. - * @params {Object} opts - * @param {string|Array.} opts.infoHash - * @param {string} opts.announce - * @param {function} cb - */ -Client.scrape = (opts, cb) => { - cb = once(cb) - - if (!opts.infoHash) throw new Error('Option `infoHash` is required') - if (!opts.announce) throw new Error('Option `announce` is required') - - const clientOpts = Object.assign({}, opts, { - infoHash: Array.isArray(opts.infoHash) ? opts.infoHash[0] : opts.infoHash, - peerId: Buffer.from('01234567890123456789'), // dummy value - port: 6881 // dummy value - }) - - const client = new Client(clientOpts) - client.once('error', cb) - client.once('warning', cb) - - let len = Array.isArray(opts.infoHash) ? opts.infoHash.length : 1 - const results = {} - client.on('scrape', data => { - len -= 1 - results[data.infoHash] = data - if (len === 0) { - client.destroy() - const keys = Object.keys(results) - if (keys.length === 1) { - cb(null, results[keys[0]]) - } else { - cb(null, results) - } - } - }) - - opts.infoHash = Array.isArray(opts.infoHash) - ? opts.infoHash.map(infoHash => Buffer.from(infoHash, 'hex')) - : Buffer.from(opts.infoHash, 'hex') - client.scrape({ infoHash: opts.infoHash }) - return client -} - -module.exports = Client - - -/***/ }), - -/***/ "./node_modules/bittorrent-tracker/lib/client/tracker.js": -/*!***************************************************************!*\ - !*** ./node_modules/bittorrent-tracker/lib/client/tracker.js ***! - \***************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const EventEmitter = __webpack_require__(/*! events */ "./node_modules/events/events.js") - -class Tracker extends EventEmitter { - constructor (client, announceUrl) { - super() - - this.client = client - this.announceUrl = announceUrl - - this.interval = null - this.destroyed = false - } - - setInterval (intervalMs) { - if (intervalMs == null) intervalMs = this.DEFAULT_ANNOUNCE_INTERVAL - - clearInterval(this.interval) - - if (intervalMs) { - this.interval = setInterval(() => { - this.announce(this.client._defaultAnnounceOpts()) - }, intervalMs) - if (this.interval.unref) this.interval.unref() - } - } -} - -module.exports = Tracker - - -/***/ }), - -/***/ "./node_modules/bittorrent-tracker/lib/client/websocket-tracker.js": -/*!*************************************************************************!*\ - !*** ./node_modules/bittorrent-tracker/lib/client/websocket-tracker.js ***! - \*************************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('bittorrent-tracker:websocket-tracker') -const Peer = __webpack_require__(/*! simple-peer */ "./node_modules/simple-peer/index.js") -const randombytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") -const Socket = __webpack_require__(/*! simple-websocket */ "./node_modules/simple-websocket/index.js") - -const common = __webpack_require__(/*! ../common */ "./node_modules/bittorrent-tracker/lib/common.js") -const Tracker = __webpack_require__(/*! ./tracker */ "./node_modules/bittorrent-tracker/lib/client/tracker.js") - -// Use a socket pool, so tracker clients share WebSocket objects for the same server. -// In practice, WebSockets are pretty slow to establish, so this gives a nice performance -// boost, and saves browser resources. -const socketPool = {} - -const RECONNECT_MINIMUM = 10 * 1000 -const RECONNECT_MAXIMUM = 60 * 60 * 1000 -const RECONNECT_VARIANCE = 5 * 60 * 1000 -const OFFER_TIMEOUT = 50 * 1000 - -class WebSocketTracker extends Tracker { - constructor (client, announceUrl) { - super(client, announceUrl) - debug('new websocket tracker %s', announceUrl) - - this.peers = {} // peers (offer id -> peer) - this.socket = null - - this.reconnecting = false - this.retries = 0 - this.reconnectTimer = null - - // Simple boolean flag to track whether the socket has received data from - // the websocket server since the last time socket.send() was called. - this.expectingResponse = false - - this._openSocket() - } - - announce (opts) { - if (this.destroyed || this.reconnecting) return - if (!this.socket.connected) { - this.socket.once('connect', () => { - this.announce(opts) - }) - return - } - - const params = Object.assign({}, opts, { - action: 'announce', - info_hash: this.client._infoHashBinary, - peer_id: this.client._peerIdBinary - }) - if (this._trackerId) params.trackerid = this._trackerId - - if (opts.event === 'stopped' || opts.event === 'completed') { - // Don't include offers with 'stopped' or 'completed' event - this._send(params) - } else { - // Limit the number of offers that are generated, since it can be slow - const numwant = Math.min(opts.numwant, 5) - - this._generateOffers(numwant, offers => { - params.numwant = numwant - params.offers = offers - this._send(params) - }) - } - } - - scrape (opts) { - if (this.destroyed || this.reconnecting) return - if (!this.socket.connected) { - this.socket.once('connect', () => { - this.scrape(opts) - }) - return - } - - const infoHashes = (Array.isArray(opts.infoHash) && opts.infoHash.length > 0) - ? opts.infoHash.map(infoHash => infoHash.toString('binary')) - : (opts.infoHash && opts.infoHash.toString('binary')) || this.client._infoHashBinary - const params = { - action: 'scrape', - info_hash: infoHashes - } - - this._send(params) - } - - destroy (cb = noop) { - if (this.destroyed) return cb(null) - - this.destroyed = true - - clearInterval(this.interval) - clearTimeout(this.reconnectTimer) - - // Destroy peers - for (const peerId in this.peers) { - const peer = this.peers[peerId] - clearTimeout(peer.trackerTimeout) - peer.destroy() - } - this.peers = null - - if (this.socket) { - this.socket.removeListener('connect', this._onSocketConnectBound) - this.socket.removeListener('data', this._onSocketDataBound) - this.socket.removeListener('close', this._onSocketCloseBound) - this.socket.removeListener('error', this._onSocketErrorBound) - this.socket = null - } - - this._onSocketConnectBound = null - this._onSocketErrorBound = null - this._onSocketDataBound = null - this._onSocketCloseBound = null - - if (socketPool[this.announceUrl]) { - socketPool[this.announceUrl].consumers -= 1 - } - - // Other instances are using the socket, so there's nothing left to do here - if (socketPool[this.announceUrl].consumers > 0) return cb() - - let socket = socketPool[this.announceUrl] - delete socketPool[this.announceUrl] - socket.on('error', noop) // ignore all future errors - socket.once('close', cb) - - let timeout - - // If there is no data response expected, destroy immediately. - if (!this.expectingResponse) return destroyCleanup() - - // Otherwise, wait a short time for potential responses to come in from the - // server, then force close the socket. - timeout = setTimeout(destroyCleanup, common.DESTROY_TIMEOUT) - - // But, if a response comes from the server before the timeout fires, do cleanup - // right away. - socket.once('data', destroyCleanup) - - function destroyCleanup () { - if (timeout) { - clearTimeout(timeout) - timeout = null - } - socket.removeListener('data', destroyCleanup) - socket.destroy() - socket = null - } - } - - _openSocket () { - this.destroyed = false - - if (!this.peers) this.peers = {} - - this._onSocketConnectBound = () => { - this._onSocketConnect() - } - this._onSocketErrorBound = err => { - this._onSocketError(err) - } - this._onSocketDataBound = data => { - this._onSocketData(data) - } - this._onSocketCloseBound = () => { - this._onSocketClose() - } - - this.socket = socketPool[this.announceUrl] - if (this.socket) { - socketPool[this.announceUrl].consumers += 1 - if (this.socket.connected) { - this._onSocketConnectBound() - } - } else { - this.socket = socketPool[this.announceUrl] = new Socket(this.announceUrl) - this.socket.consumers = 1 - this.socket.once('connect', this._onSocketConnectBound) - } - - this.socket.on('data', this._onSocketDataBound) - this.socket.once('close', this._onSocketCloseBound) - this.socket.once('error', this._onSocketErrorBound) - } - - _onSocketConnect () { - if (this.destroyed) return - - if (this.reconnecting) { - this.reconnecting = false - this.retries = 0 - this.announce(this.client._defaultAnnounceOpts()) - } - } - - _onSocketData (data) { - if (this.destroyed) return - - this.expectingResponse = false - - try { - data = JSON.parse(data) - } catch (err) { - this.client.emit('warning', new Error('Invalid tracker response')) - return - } - - if (data.action === 'announce') { - this._onAnnounceResponse(data) - } else if (data.action === 'scrape') { - this._onScrapeResponse(data) - } else { - this._onSocketError(new Error(`invalid action in WS response: ${data.action}`)) - } - } - - _onAnnounceResponse (data) { - if (data.info_hash !== this.client._infoHashBinary) { - debug( - 'ignoring websocket data from %s for %s (looking for %s: reused socket)', - this.announceUrl, common.binaryToHex(data.info_hash), this.client.infoHash - ) - return - } - - if (data.peer_id && data.peer_id === this.client._peerIdBinary) { - // ignore offers/answers from this client - return - } - - debug( - 'received %s from %s for %s', - JSON.stringify(data), this.announceUrl, this.client.infoHash - ) - - const failure = data['failure reason'] - if (failure) return this.client.emit('warning', new Error(failure)) - - const warning = data['warning message'] - if (warning) this.client.emit('warning', new Error(warning)) - - const interval = data.interval || data['min interval'] - if (interval) this.setInterval(interval * 1000) - - const trackerId = data['tracker id'] - if (trackerId) { - // If absent, do not discard previous trackerId value - this._trackerId = trackerId - } - - if (data.complete != null) { - const response = Object.assign({}, data, { - announce: this.announceUrl, - infoHash: common.binaryToHex(data.info_hash) - }) - this.client.emit('update', response) - } - - let peer - if (data.offer && data.peer_id) { - debug('creating peer (from remote offer)') - peer = this._createPeer() - peer.id = common.binaryToHex(data.peer_id) - peer.once('signal', answer => { - const params = { - action: 'announce', - info_hash: this.client._infoHashBinary, - peer_id: this.client._peerIdBinary, - to_peer_id: data.peer_id, - answer, - offer_id: data.offer_id - } - if (this._trackerId) params.trackerid = this._trackerId - this._send(params) - }) - this.client.emit('peer', peer) - peer.signal(data.offer) - } - - if (data.answer && data.peer_id) { - const offerId = common.binaryToHex(data.offer_id) - peer = this.peers[offerId] - if (peer) { - peer.id = common.binaryToHex(data.peer_id) - this.client.emit('peer', peer) - peer.signal(data.answer) - - clearTimeout(peer.trackerTimeout) - peer.trackerTimeout = null - delete this.peers[offerId] - } else { - debug(`got unexpected answer: ${JSON.stringify(data.answer)}`) - } - } - } - - _onScrapeResponse (data) { - data = data.files || {} - - const keys = Object.keys(data) - if (keys.length === 0) { - this.client.emit('warning', new Error('invalid scrape response')) - return - } - - keys.forEach(infoHash => { - // TODO: optionally handle data.flags.min_request_interval - // (separate from announce interval) - const response = Object.assign(data[infoHash], { - announce: this.announceUrl, - infoHash: common.binaryToHex(infoHash) - }) - this.client.emit('scrape', response) - }) - } - - _onSocketClose () { - if (this.destroyed) return - this.destroy() - this._startReconnectTimer() - } - - _onSocketError (err) { - if (this.destroyed) return - this.destroy() - // errors will often happen if a tracker is offline, so don't treat it as fatal - this.client.emit('warning', err) - this._startReconnectTimer() - } - - _startReconnectTimer () { - const ms = Math.floor(Math.random() * RECONNECT_VARIANCE) + Math.min(Math.pow(2, this.retries) * RECONNECT_MINIMUM, RECONNECT_MAXIMUM) - - this.reconnecting = true - clearTimeout(this.reconnectTimer) - this.reconnectTimer = setTimeout(() => { - this.retries++ - this._openSocket() - }, ms) - if (this.reconnectTimer.unref) this.reconnectTimer.unref() - - debug('reconnecting socket in %s ms', ms) - } - - _send (params) { - if (this.destroyed) return - this.expectingResponse = true - const message = JSON.stringify(params) - debug('send %s', message) - this.socket.send(message) - } - - _generateOffers (numwant, cb) { - const self = this - const offers = [] - debug('generating %s offers', numwant) - - for (let i = 0; i < numwant; ++i) { - generateOffer() - } - checkDone() - - function generateOffer () { - const offerId = randombytes(20).toString('hex') - debug('creating peer (from _generateOffers)') - const peer = self.peers[offerId] = self._createPeer({ initiator: true }) - peer.once('signal', offer => { - offers.push({ - offer, - offer_id: common.hexToBinary(offerId) - }) - checkDone() - }) - peer.trackerTimeout = setTimeout(() => { - debug('tracker timeout: destroying peer') - peer.trackerTimeout = null - delete self.peers[offerId] - peer.destroy() - }, OFFER_TIMEOUT) - if (peer.trackerTimeout.unref) peer.trackerTimeout.unref() - } - - function checkDone () { - if (offers.length === numwant) { - debug('generated %s offers', numwant) - cb(offers) - } - } - } - - _createPeer (opts) { - const self = this - - opts = Object.assign({ - trickle: false, - config: self.client._rtcConfig, - wrtc: self.client._wrtc - }, opts) - - const peer = new Peer(opts) - - peer.once('error', onError) - peer.once('connect', onConnect) - - return peer - - // Handle peer 'error' events that are fired *before* the peer is emitted in - // a 'peer' event. - function onError (err) { - self.client.emit('warning', new Error(`Connection error: ${err.message}`)) - peer.destroy() - } - - // Once the peer is emitted in a 'peer' event, then it's the consumer's - // responsibility to listen for errors, so the listeners are removed here. - function onConnect () { - peer.removeListener('error', onError) - peer.removeListener('connect', onConnect) - } - } -} - -WebSocketTracker.prototype.DEFAULT_ANNOUNCE_INTERVAL = 30 * 1000 // 30 seconds -// Normally this shouldn't be accessed but is occasionally useful -WebSocketTracker._socketPool = socketPool - -function noop () {} - -module.exports = WebSocketTracker - - -/***/ }), - -/***/ "./node_modules/bittorrent-tracker/lib/common.js": -/*!*******************************************************!*\ - !*** ./node_modules/bittorrent-tracker/lib/common.js ***! - \*******************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/** - * Functions/constants needed by both the client and server. - */ - -exports.DEFAULT_ANNOUNCE_PEERS = 50 -exports.MAX_ANNOUNCE_PEERS = 82 - -exports.binaryToHex = str => { - if (typeof str !== 'string') { - str = String(str) - } - return Buffer.from(str, 'binary').toString('hex') -} - -exports.hexToBinary = str => { - if (typeof str !== 'string') { - str = String(str) - } - return Buffer.from(str, 'hex').toString('binary') -} - -// HACK: Fix for WHATWG URL object not parsing non-standard URL schemes like -// 'udp:'. Just replace it with 'http:' since we only need a few properties. -// -// Note: Only affects Chrome and Firefox. Works fine in Node.js, Safari, and -// Edge. -// -// Note: UDP trackers aren't used in the normal browser build, but they are -// used in a Chrome App build (i.e. by Brave Browser). -// -// Bug reports: -// - Chrome: https://bugs.chromium.org/p/chromium/issues/detail?id=734880 -// - Firefox: https://bugzilla.mozilla.org/show_bug.cgi?id=1374505 -exports.parseUrl = str => { - const url = new URL(str.replace(/^udp:/, 'http:')) - - if (str.match(/^udp:/)) { - Object.defineProperties(url, { - href: { value: url.href.replace(/^http/, 'udp') }, - protocol: { value: url.protocol.replace(/^http/, 'udp') }, - origin: { value: url.origin.replace(/^http/, 'udp') } - }) - } - - return url -} - -const config = __webpack_require__(/*! ./common-node */ "?5a06") -Object.assign(exports, config) - - -/***/ }), - -/***/ "./node_modules/blob-to-buffer/index.js": -/*!**********************************************!*\ - !*** ./node_modules/blob-to-buffer/index.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! blob-to-buffer. MIT License. Feross Aboukhadijeh */ -/* global Blob, FileReader */ - -module.exports = function blobToBuffer (blob, cb) { - if (typeof Blob === 'undefined' || !(blob instanceof Blob)) { - throw new Error('first argument must be a Blob') - } - if (typeof cb !== 'function') { - throw new Error('second argument must be a function') - } - - const reader = new FileReader() - - function onLoadEnd (e) { - reader.removeEventListener('loadend', onLoadEnd, false) - if (e.error) cb(e.error) - else cb(null, Buffer.from(reader.result)) - } - - reader.addEventListener('loadend', onLoadEnd, false) - reader.readAsArrayBuffer(blob) -} - - -/***/ }), - -/***/ "./node_modules/block-stream2/index.js": -/*!*********************************************!*\ - !*** ./node_modules/block-stream2/index.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -const { Transform } = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") - -class Block extends Transform { - constructor (size, opts = {}) { - super(opts) - - if (typeof size === 'object') { - opts = size - size = opts.size - } - - this.size = size || 512 - - const { nopad, zeroPadding = true } = opts - - if (nopad) this._zeroPadding = false - else this._zeroPadding = !!zeroPadding - - this._buffered = [] - this._bufferedBytes = 0 - } - - _transform (buf, enc, next) { - this._bufferedBytes += buf.length - this._buffered.push(buf) - - while (this._bufferedBytes >= this.size) { - this._bufferedBytes -= this.size - - // Assemble the buffers that will compose the final block - const blockBufs = [] - let blockBufsBytes = 0 - while (blockBufsBytes < this.size) { - const b = this._buffered.shift() - - if (blockBufsBytes + b.length <= this.size) { - blockBufs.push(b) - blockBufsBytes += b.length - } else { - // If the last buffer is larger than needed for the block, just - // use the needed part - const neededSize = this.size - blockBufsBytes - blockBufs.push(b.slice(0, neededSize)) - blockBufsBytes += neededSize - this._buffered.unshift(b.slice(neededSize)) - } - } - - // Then concat just those buffers, leaving the rest untouched in _buffered - this.push(Buffer.concat(blockBufs, this.size)) - } - next() - } - - _flush () { - if (this._bufferedBytes && this._zeroPadding) { - const zeroes = Buffer.alloc(this.size - this._bufferedBytes) - this._buffered.push(zeroes) - this.push(Buffer.concat(this._buffered)) - this._buffered = null - } else if (this._bufferedBytes) { - this.push(Buffer.concat(this._buffered)) - this._buffered = null - } - this.push(null) - } -} - -module.exports = Block - - -/***/ }), - -/***/ "./node_modules/bn.js/lib/bn.js": -/*!**************************************!*\ - !*** ./node_modules/bn.js/lib/bn.js ***! - \**************************************/ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -(function (module, exports) { - 'use strict'; - - // Utils - function assert (val, msg) { - if (!val) throw new Error(msg || 'Assertion failed'); - } - - // Could use `inherits` module, but don't want to move from single file - // architecture yet. - function inherits (ctor, superCtor) { - ctor.super_ = superCtor; - var TempCtor = function () {}; - TempCtor.prototype = superCtor.prototype; - ctor.prototype = new TempCtor(); - ctor.prototype.constructor = ctor; - } - - // BN - - function BN (number, base, endian) { - if (BN.isBN(number)) { - return number; - } - - this.negative = 0; - this.words = null; - this.length = 0; - - // Reduction context - this.red = null; - - if (number !== null) { - if (base === 'le' || base === 'be') { - endian = base; - base = 10; - } - - this._init(number || 0, base || 10, endian || 'be'); - } - } - if (typeof module === 'object') { - module.exports = BN; - } else { - exports.BN = BN; - } - - BN.BN = BN; - BN.wordSize = 26; - - var Buffer; - try { - if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { - Buffer = window.Buffer; - } else { - Buffer = __webpack_require__(/*! buffer */ "?8131").Buffer; - } - } catch (e) { - } - - BN.isBN = function isBN (num) { - if (num instanceof BN) { - return true; - } - - return num !== null && typeof num === 'object' && - num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); - }; - - BN.max = function max (left, right) { - if (left.cmp(right) > 0) return left; - return right; - }; - - BN.min = function min (left, right) { - if (left.cmp(right) < 0) return left; - return right; - }; - - BN.prototype._init = function init (number, base, endian) { - if (typeof number === 'number') { - return this._initNumber(number, base, endian); - } - - if (typeof number === 'object') { - return this._initArray(number, base, endian); - } - - if (base === 'hex') { - base = 16; - } - assert(base === (base | 0) && base >= 2 && base <= 36); - - number = number.toString().replace(/\s+/g, ''); - var start = 0; - if (number[0] === '-') { - start++; - this.negative = 1; - } - - if (start < number.length) { - if (base === 16) { - this._parseHex(number, start, endian); - } else { - this._parseBase(number, base, start); - if (endian === 'le') { - this._initArray(this.toArray(), base, endian); - } - } - } - }; - - BN.prototype._initNumber = function _initNumber (number, base, endian) { - if (number < 0) { - this.negative = 1; - number = -number; - } - if (number < 0x4000000) { - this.words = [number & 0x3ffffff]; - this.length = 1; - } else if (number < 0x10000000000000) { - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff - ]; - this.length = 2; - } else { - assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff, - 1 - ]; - this.length = 3; - } - - if (endian !== 'le') return; - - // Reverse the bytes - this._initArray(this.toArray(), base, endian); - }; - - BN.prototype._initArray = function _initArray (number, base, endian) { - // Perhaps a Uint8Array - assert(typeof number.length === 'number'); - if (number.length <= 0) { - this.words = [0]; - this.length = 1; - return this; - } - - this.length = Math.ceil(number.length / 3); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - var j, w; - var off = 0; - if (endian === 'be') { - for (i = number.length - 1, j = 0; i >= 0; i -= 3) { - w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } else if (endian === 'le') { - for (i = 0, j = 0; i < number.length; i += 3) { - w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } - return this._strip(); - }; - - function parseHex4Bits (string, index) { - var c = string.charCodeAt(index); - // '0' - '9' - if (c >= 48 && c <= 57) { - return c - 48; - // 'A' - 'F' - } else if (c >= 65 && c <= 70) { - return c - 55; - // 'a' - 'f' - } else if (c >= 97 && c <= 102) { - return c - 87; - } else { - assert(false, 'Invalid character in ' + string); - } - } - - function parseHexByte (string, lowerBound, index) { - var r = parseHex4Bits(string, index); - if (index - 1 >= lowerBound) { - r |= parseHex4Bits(string, index - 1) << 4; - } - return r; - } - - BN.prototype._parseHex = function _parseHex (number, start, endian) { - // Create possibly bigger array to ensure that it fits the number - this.length = Math.ceil((number.length - start) / 6); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - // 24-bits chunks - var off = 0; - var j = 0; - - var w; - if (endian === 'be') { - for (i = number.length - 1; i >= start; i -= 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } else { - var parseLength = number.length - start; - for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } - - this._strip(); - }; - - function parseBase (str, start, end, mul) { - var r = 0; - var b = 0; - var len = Math.min(str.length, end); - for (var i = start; i < len; i++) { - var c = str.charCodeAt(i) - 48; - - r *= mul; - - // 'a' - if (c >= 49) { - b = c - 49 + 0xa; - - // 'A' - } else if (c >= 17) { - b = c - 17 + 0xa; - - // '0' - '9' - } else { - b = c; - } - assert(c >= 0 && b < mul, 'Invalid character'); - r += b; - } - return r; - } - - BN.prototype._parseBase = function _parseBase (number, base, start) { - // Initialize as zero - this.words = [0]; - this.length = 1; - - // Find length of limb in base - for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { - limbLen++; - } - limbLen--; - limbPow = (limbPow / base) | 0; - - var total = number.length - start; - var mod = total % limbLen; - var end = Math.min(total, total - mod) + start; - - var word = 0; - for (var i = start; i < end; i += limbLen) { - word = parseBase(number, i, i + limbLen, base); - - this.imuln(limbPow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - if (mod !== 0) { - var pow = 1; - word = parseBase(number, i, number.length, base); - - for (i = 0; i < mod; i++) { - pow *= base; - } - - this.imuln(pow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - this._strip(); - }; - - BN.prototype.copy = function copy (dest) { - dest.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - dest.words[i] = this.words[i]; - } - dest.length = this.length; - dest.negative = this.negative; - dest.red = this.red; - }; - - function move (dest, src) { - dest.words = src.words; - dest.length = src.length; - dest.negative = src.negative; - dest.red = src.red; - } - - BN.prototype._move = function _move (dest) { - move(dest, this); - }; - - BN.prototype.clone = function clone () { - var r = new BN(null); - this.copy(r); - return r; - }; - - BN.prototype._expand = function _expand (size) { - while (this.length < size) { - this.words[this.length++] = 0; - } - return this; - }; - - // Remove leading `0` from `this` - BN.prototype._strip = function strip () { - while (this.length > 1 && this.words[this.length - 1] === 0) { - this.length--; - } - return this._normSign(); - }; - - BN.prototype._normSign = function _normSign () { - // -0 = 0 - if (this.length === 1 && this.words[0] === 0) { - this.negative = 0; - } - return this; - }; - - // Check Symbol.for because not everywhere where Symbol defined - // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility - if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') { - try { - BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect; - } catch (e) { - BN.prototype.inspect = inspect; - } - } else { - BN.prototype.inspect = inspect; - } - - function inspect () { - return (this.red ? ''; - } - - /* - - var zeros = []; - var groupSizes = []; - var groupBases = []; - - var s = ''; - var i = -1; - while (++i < BN.wordSize) { - zeros[i] = s; - s += '0'; - } - groupSizes[0] = 0; - groupSizes[1] = 0; - groupBases[0] = 0; - groupBases[1] = 0; - var base = 2 - 1; - while (++base < 36 + 1) { - var groupSize = 0; - var groupBase = 1; - while (groupBase < (1 << BN.wordSize) / base) { - groupBase *= base; - groupSize += 1; - } - groupSizes[base] = groupSize; - groupBases[base] = groupBase; - } - - */ - - 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' - ]; - - 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 - ]; - - 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 - ]; - - BN.prototype.toString = function toString (base, padding) { - base = base || 10; - padding = padding | 0 || 1; - - var out; - if (base === 16 || base === 'hex') { - out = ''; - var off = 0; - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = this.words[i]; - var word = (((w << off) | carry) & 0xffffff).toString(16); - carry = (w >>> (24 - off)) & 0xffffff; - if (carry !== 0 || i !== this.length - 1) { - out = zeros[6 - word.length] + word + out; - } else { - out = word + out; - } - off += 2; - if (off >= 26) { - off -= 26; - i--; - } - } - if (carry !== 0) { - out = carry.toString(16) + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - if (base === (base | 0) && base >= 2 && base <= 36) { - // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); - var groupSize = groupSizes[base]; - // var groupBase = Math.pow(base, groupSize); - var groupBase = groupBases[base]; - out = ''; - var c = this.clone(); - c.negative = 0; - while (!c.isZero()) { - var r = c.modrn(groupBase).toString(base); - c = c.idivn(groupBase); - - if (!c.isZero()) { - out = zeros[groupSize - r.length] + r + out; - } else { - out = r + out; - } - } - if (this.isZero()) { - out = '0' + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - assert(false, 'Base should be between 2 and 36'); - }; - - BN.prototype.toNumber = function toNumber () { - var ret = this.words[0]; - if (this.length === 2) { - ret += this.words[1] * 0x4000000; - } else if (this.length === 3 && this.words[2] === 0x01) { - // NOTE: at this stage it is known that the top bit is set - ret += 0x10000000000000 + (this.words[1] * 0x4000000); - } else if (this.length > 2) { - assert(false, 'Number can only safely store up to 53 bits'); - } - return (this.negative !== 0) ? -ret : ret; - }; - - BN.prototype.toJSON = function toJSON () { - return this.toString(16, 2); - }; - - if (Buffer) { - BN.prototype.toBuffer = function toBuffer (endian, length) { - return this.toArrayLike(Buffer, endian, length); - }; - } - - BN.prototype.toArray = function toArray (endian, length) { - return this.toArrayLike(Array, endian, length); - }; - - var allocate = function allocate (ArrayType, size) { - if (ArrayType.allocUnsafe) { - return ArrayType.allocUnsafe(size); - } - return new ArrayType(size); - }; - - BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { - this._strip(); - - var byteLength = this.byteLength(); - var reqLength = length || Math.max(1, byteLength); - assert(byteLength <= reqLength, 'byte array longer than desired length'); - assert(reqLength > 0, 'Requested array length <= 0'); - - var res = allocate(ArrayType, reqLength); - var postfix = endian === 'le' ? 'LE' : 'BE'; - this['_toArrayLike' + postfix](res, byteLength); - return res; - }; - - BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) { - var position = 0; - var carry = 0; - - for (var i = 0, shift = 0; i < this.length; i++) { - var word = (this.words[i] << shift) | carry; - - res[position++] = word & 0xff; - if (position < res.length) { - res[position++] = (word >> 8) & 0xff; - } - if (position < res.length) { - res[position++] = (word >> 16) & 0xff; - } - - if (shift === 6) { - if (position < res.length) { - res[position++] = (word >> 24) & 0xff; - } - carry = 0; - shift = 0; - } else { - carry = word >>> 24; - shift += 2; - } - } - - if (position < res.length) { - res[position++] = carry; - - while (position < res.length) { - res[position++] = 0; - } - } - }; - - BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) { - var position = res.length - 1; - var carry = 0; - - for (var i = 0, shift = 0; i < this.length; i++) { - var word = (this.words[i] << shift) | carry; - - res[position--] = word & 0xff; - if (position >= 0) { - res[position--] = (word >> 8) & 0xff; - } - if (position >= 0) { - res[position--] = (word >> 16) & 0xff; - } - - if (shift === 6) { - if (position >= 0) { - res[position--] = (word >> 24) & 0xff; - } - carry = 0; - shift = 0; - } else { - carry = word >>> 24; - shift += 2; - } - } - - if (position >= 0) { - res[position--] = carry; - - while (position >= 0) { - res[position--] = 0; - } - } - }; - - if (Math.clz32) { - BN.prototype._countBits = function _countBits (w) { - return 32 - Math.clz32(w); - }; - } else { - BN.prototype._countBits = function _countBits (w) { - var t = w; - var r = 0; - if (t >= 0x1000) { - r += 13; - t >>>= 13; - } - if (t >= 0x40) { - r += 7; - t >>>= 7; - } - if (t >= 0x8) { - r += 4; - t >>>= 4; - } - if (t >= 0x02) { - r += 2; - t >>>= 2; - } - return r + t; - }; - } - - BN.prototype._zeroBits = function _zeroBits (w) { - // Short-cut - if (w === 0) return 26; - - var t = w; - var r = 0; - if ((t & 0x1fff) === 0) { - r += 13; - t >>>= 13; - } - if ((t & 0x7f) === 0) { - r += 7; - t >>>= 7; - } - if ((t & 0xf) === 0) { - r += 4; - t >>>= 4; - } - if ((t & 0x3) === 0) { - r += 2; - t >>>= 2; - } - if ((t & 0x1) === 0) { - r++; - } - return r; - }; - - // Return number of used bits in a BN - BN.prototype.bitLength = function bitLength () { - var w = this.words[this.length - 1]; - var hi = this._countBits(w); - return (this.length - 1) * 26 + hi; - }; - - function toBitArray (num) { - var w = new Array(num.bitLength()); - - for (var bit = 0; bit < w.length; bit++) { - var off = (bit / 26) | 0; - var wbit = bit % 26; - - w[bit] = (num.words[off] >>> wbit) & 0x01; - } - - return w; - } - - // Number of trailing zero bits - BN.prototype.zeroBits = function zeroBits () { - if (this.isZero()) return 0; - - var r = 0; - for (var i = 0; i < this.length; i++) { - var b = this._zeroBits(this.words[i]); - r += b; - if (b !== 26) break; - } - return r; - }; - - BN.prototype.byteLength = function byteLength () { - return Math.ceil(this.bitLength() / 8); - }; - - BN.prototype.toTwos = function toTwos (width) { - if (this.negative !== 0) { - return this.abs().inotn(width).iaddn(1); - } - return this.clone(); - }; - - BN.prototype.fromTwos = function fromTwos (width) { - if (this.testn(width - 1)) { - return this.notn(width).iaddn(1).ineg(); - } - return this.clone(); - }; - - BN.prototype.isNeg = function isNeg () { - return this.negative !== 0; - }; - - // Return negative clone of `this` - BN.prototype.neg = function neg () { - return this.clone().ineg(); - }; - - BN.prototype.ineg = function ineg () { - if (!this.isZero()) { - this.negative ^= 1; - } - - return this; - }; - - // Or `num` with `this` in-place - BN.prototype.iuor = function iuor (num) { - while (this.length < num.length) { - this.words[this.length++] = 0; - } - - for (var i = 0; i < num.length; i++) { - this.words[i] = this.words[i] | num.words[i]; - } - - return this._strip(); - }; - - BN.prototype.ior = function ior (num) { - assert((this.negative | num.negative) === 0); - return this.iuor(num); - }; - - // Or `num` with `this` - BN.prototype.or = function or (num) { - if (this.length > num.length) return this.clone().ior(num); - return num.clone().ior(this); - }; - - BN.prototype.uor = function uor (num) { - if (this.length > num.length) return this.clone().iuor(num); - return num.clone().iuor(this); - }; - - // And `num` with `this` in-place - BN.prototype.iuand = function iuand (num) { - // b = min-length(num, this) - var b; - if (this.length > num.length) { - b = num; - } else { - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = this.words[i] & num.words[i]; - } - - this.length = b.length; - - return this._strip(); - }; - - BN.prototype.iand = function iand (num) { - assert((this.negative | num.negative) === 0); - return this.iuand(num); - }; - - // And `num` with `this` - BN.prototype.and = function and (num) { - if (this.length > num.length) return this.clone().iand(num); - return num.clone().iand(this); - }; - - BN.prototype.uand = function uand (num) { - if (this.length > num.length) return this.clone().iuand(num); - return num.clone().iuand(this); - }; - - // Xor `num` with `this` in-place - BN.prototype.iuxor = function iuxor (num) { - // a.length > b.length - var a; - var b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = a.words[i] ^ b.words[i]; - } - - if (this !== a) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = a.length; - - return this._strip(); - }; - - BN.prototype.ixor = function ixor (num) { - assert((this.negative | num.negative) === 0); - return this.iuxor(num); - }; - - // Xor `num` with `this` - BN.prototype.xor = function xor (num) { - if (this.length > num.length) return this.clone().ixor(num); - return num.clone().ixor(this); - }; - - BN.prototype.uxor = function uxor (num) { - if (this.length > num.length) return this.clone().iuxor(num); - return num.clone().iuxor(this); - }; - - // Not ``this`` with ``width`` bitwidth - BN.prototype.inotn = function inotn (width) { - assert(typeof width === 'number' && width >= 0); - - var bytesNeeded = Math.ceil(width / 26) | 0; - var bitsLeft = width % 26; - - // Extend the buffer with leading zeroes - this._expand(bytesNeeded); - - if (bitsLeft > 0) { - bytesNeeded--; - } - - // Handle complete words - for (var i = 0; i < bytesNeeded; i++) { - this.words[i] = ~this.words[i] & 0x3ffffff; - } - - // Handle the residue - if (bitsLeft > 0) { - this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); - } - - // And remove leading zeroes - return this._strip(); - }; - - BN.prototype.notn = function notn (width) { - return this.clone().inotn(width); - }; - - // Set `bit` of `this` - BN.prototype.setn = function setn (bit, val) { - assert(typeof bit === 'number' && bit >= 0); - - var off = (bit / 26) | 0; - var wbit = bit % 26; - - this._expand(off + 1); - - if (val) { - this.words[off] = this.words[off] | (1 << wbit); - } else { - this.words[off] = this.words[off] & ~(1 << wbit); - } - - return this._strip(); - }; - - // Add `num` to `this` in-place - BN.prototype.iadd = function iadd (num) { - var r; - - // negative + positive - if (this.negative !== 0 && num.negative === 0) { - this.negative = 0; - r = this.isub(num); - this.negative ^= 1; - return this._normSign(); - - // positive + negative - } else if (this.negative === 0 && num.negative !== 0) { - num.negative = 0; - r = this.isub(num); - num.negative = 1; - return r._normSign(); - } - - // a.length > b.length - var a, b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) + (b.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - - this.length = a.length; - if (carry !== 0) { - this.words[this.length] = carry; - this.length++; - // Copy the rest of the words - } else if (a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - return this; - }; - - // Add `num` to `this` - BN.prototype.add = function add (num) { - var res; - if (num.negative !== 0 && this.negative === 0) { - num.negative = 0; - res = this.sub(num); - num.negative ^= 1; - return res; - } else if (num.negative === 0 && this.negative !== 0) { - this.negative = 0; - res = num.sub(this); - this.negative = 1; - return res; - } - - if (this.length > num.length) return this.clone().iadd(num); - - return num.clone().iadd(this); - }; - - // Subtract `num` from `this` in-place - BN.prototype.isub = function isub (num) { - // this - (-num) = this + num - if (num.negative !== 0) { - num.negative = 0; - var r = this.iadd(num); - num.negative = 1; - return r._normSign(); - - // -this - num = -(this + num) - } else if (this.negative !== 0) { - this.negative = 0; - this.iadd(num); - this.negative = 1; - return this._normSign(); - } - - // At this point both numbers are positive - var cmp = this.cmp(num); - - // Optimization - zeroify - if (cmp === 0) { - this.negative = 0; - this.length = 1; - this.words[0] = 0; - return this; - } - - // a > b - var a, b; - if (cmp > 0) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) - (b.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - - // Copy rest of the words - if (carry === 0 && i < a.length && a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = Math.max(this.length, i); - - if (a !== this) { - this.negative = 1; - } - - return this._strip(); - }; - - // Subtract `num` from `this` - BN.prototype.sub = function sub (num) { - return this.clone().isub(num); - }; - - function smallMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - var len = (self.length + num.length) | 0; - out.length = len; - len = (len - 1) | 0; - - // Peel one iteration (compiler can't do it, because of code complexity) - var a = self.words[0] | 0; - var b = num.words[0] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - var carry = (r / 0x4000000) | 0; - out.words[0] = lo; - - for (var k = 1; k < len; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = carry >>> 26; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = (k - j) | 0; - a = self.words[i] | 0; - b = num.words[j] | 0; - r = a * b + rword; - ncarry += (r / 0x4000000) | 0; - rword = r & 0x3ffffff; - } - out.words[k] = rword | 0; - carry = ncarry | 0; - } - if (carry !== 0) { - out.words[k] = carry | 0; - } else { - out.length--; - } - - return out._strip(); - } - - // TODO(indutny): it may be reasonable to omit it for users who don't need - // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit - // multiplication (like elliptic secp256k1). - var comb10MulTo = function comb10MulTo (self, num, out) { - var a = self.words; - var b = num.words; - var o = out.words; - var c = 0; - var lo; - var mid; - var hi; - var a0 = a[0] | 0; - var al0 = a0 & 0x1fff; - var ah0 = a0 >>> 13; - var a1 = a[1] | 0; - var al1 = a1 & 0x1fff; - var ah1 = a1 >>> 13; - var a2 = a[2] | 0; - var al2 = a2 & 0x1fff; - var ah2 = a2 >>> 13; - var a3 = a[3] | 0; - var al3 = a3 & 0x1fff; - var ah3 = a3 >>> 13; - var a4 = a[4] | 0; - var al4 = a4 & 0x1fff; - var ah4 = a4 >>> 13; - var a5 = a[5] | 0; - var al5 = a5 & 0x1fff; - var ah5 = a5 >>> 13; - var a6 = a[6] | 0; - var al6 = a6 & 0x1fff; - var ah6 = a6 >>> 13; - var a7 = a[7] | 0; - var al7 = a7 & 0x1fff; - var ah7 = a7 >>> 13; - var a8 = a[8] | 0; - var al8 = a8 & 0x1fff; - var ah8 = a8 >>> 13; - var a9 = a[9] | 0; - var al9 = a9 & 0x1fff; - var ah9 = a9 >>> 13; - var b0 = b[0] | 0; - var bl0 = b0 & 0x1fff; - var bh0 = b0 >>> 13; - var b1 = b[1] | 0; - var bl1 = b1 & 0x1fff; - var bh1 = b1 >>> 13; - var b2 = b[2] | 0; - var bl2 = b2 & 0x1fff; - var bh2 = b2 >>> 13; - var b3 = b[3] | 0; - var bl3 = b3 & 0x1fff; - var bh3 = b3 >>> 13; - var b4 = b[4] | 0; - var bl4 = b4 & 0x1fff; - var bh4 = b4 >>> 13; - var b5 = b[5] | 0; - var bl5 = b5 & 0x1fff; - var bh5 = b5 >>> 13; - var b6 = b[6] | 0; - var bl6 = b6 & 0x1fff; - var bh6 = b6 >>> 13; - var b7 = b[7] | 0; - var bl7 = b7 & 0x1fff; - var bh7 = b7 >>> 13; - var b8 = b[8] | 0; - var bl8 = b8 & 0x1fff; - var bh8 = b8 >>> 13; - var b9 = b[9] | 0; - var bl9 = b9 & 0x1fff; - var bh9 = b9 >>> 13; - - out.negative = self.negative ^ num.negative; - out.length = 19; - /* k = 0 */ - lo = Math.imul(al0, bl0); - mid = Math.imul(al0, bh0); - mid = (mid + Math.imul(ah0, bl0)) | 0; - hi = Math.imul(ah0, bh0); - var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; - w0 &= 0x3ffffff; - /* k = 1 */ - lo = Math.imul(al1, bl0); - mid = Math.imul(al1, bh0); - mid = (mid + Math.imul(ah1, bl0)) | 0; - hi = Math.imul(ah1, bh0); - lo = (lo + Math.imul(al0, bl1)) | 0; - mid = (mid + Math.imul(al0, bh1)) | 0; - mid = (mid + Math.imul(ah0, bl1)) | 0; - hi = (hi + Math.imul(ah0, bh1)) | 0; - var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; - w1 &= 0x3ffffff; - /* k = 2 */ - lo = Math.imul(al2, bl0); - mid = Math.imul(al2, bh0); - mid = (mid + Math.imul(ah2, bl0)) | 0; - hi = Math.imul(ah2, bh0); - lo = (lo + Math.imul(al1, bl1)) | 0; - mid = (mid + Math.imul(al1, bh1)) | 0; - mid = (mid + Math.imul(ah1, bl1)) | 0; - hi = (hi + Math.imul(ah1, bh1)) | 0; - lo = (lo + Math.imul(al0, bl2)) | 0; - mid = (mid + Math.imul(al0, bh2)) | 0; - mid = (mid + Math.imul(ah0, bl2)) | 0; - hi = (hi + Math.imul(ah0, bh2)) | 0; - var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; - w2 &= 0x3ffffff; - /* k = 3 */ - lo = Math.imul(al3, bl0); - mid = Math.imul(al3, bh0); - mid = (mid + Math.imul(ah3, bl0)) | 0; - hi = Math.imul(ah3, bh0); - lo = (lo + Math.imul(al2, bl1)) | 0; - mid = (mid + Math.imul(al2, bh1)) | 0; - mid = (mid + Math.imul(ah2, bl1)) | 0; - hi = (hi + Math.imul(ah2, bh1)) | 0; - lo = (lo + Math.imul(al1, bl2)) | 0; - mid = (mid + Math.imul(al1, bh2)) | 0; - mid = (mid + Math.imul(ah1, bl2)) | 0; - hi = (hi + Math.imul(ah1, bh2)) | 0; - lo = (lo + Math.imul(al0, bl3)) | 0; - mid = (mid + Math.imul(al0, bh3)) | 0; - mid = (mid + Math.imul(ah0, bl3)) | 0; - hi = (hi + Math.imul(ah0, bh3)) | 0; - var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; - w3 &= 0x3ffffff; - /* k = 4 */ - lo = Math.imul(al4, bl0); - mid = Math.imul(al4, bh0); - mid = (mid + Math.imul(ah4, bl0)) | 0; - hi = Math.imul(ah4, bh0); - lo = (lo + Math.imul(al3, bl1)) | 0; - mid = (mid + Math.imul(al3, bh1)) | 0; - mid = (mid + Math.imul(ah3, bl1)) | 0; - hi = (hi + Math.imul(ah3, bh1)) | 0; - lo = (lo + Math.imul(al2, bl2)) | 0; - mid = (mid + Math.imul(al2, bh2)) | 0; - mid = (mid + Math.imul(ah2, bl2)) | 0; - hi = (hi + Math.imul(ah2, bh2)) | 0; - lo = (lo + Math.imul(al1, bl3)) | 0; - mid = (mid + Math.imul(al1, bh3)) | 0; - mid = (mid + Math.imul(ah1, bl3)) | 0; - hi = (hi + Math.imul(ah1, bh3)) | 0; - lo = (lo + Math.imul(al0, bl4)) | 0; - mid = (mid + Math.imul(al0, bh4)) | 0; - mid = (mid + Math.imul(ah0, bl4)) | 0; - hi = (hi + Math.imul(ah0, bh4)) | 0; - var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; - w4 &= 0x3ffffff; - /* k = 5 */ - lo = Math.imul(al5, bl0); - mid = Math.imul(al5, bh0); - mid = (mid + Math.imul(ah5, bl0)) | 0; - hi = Math.imul(ah5, bh0); - lo = (lo + Math.imul(al4, bl1)) | 0; - mid = (mid + Math.imul(al4, bh1)) | 0; - mid = (mid + Math.imul(ah4, bl1)) | 0; - hi = (hi + Math.imul(ah4, bh1)) | 0; - lo = (lo + Math.imul(al3, bl2)) | 0; - mid = (mid + Math.imul(al3, bh2)) | 0; - mid = (mid + Math.imul(ah3, bl2)) | 0; - hi = (hi + Math.imul(ah3, bh2)) | 0; - lo = (lo + Math.imul(al2, bl3)) | 0; - mid = (mid + Math.imul(al2, bh3)) | 0; - mid = (mid + Math.imul(ah2, bl3)) | 0; - hi = (hi + Math.imul(ah2, bh3)) | 0; - lo = (lo + Math.imul(al1, bl4)) | 0; - mid = (mid + Math.imul(al1, bh4)) | 0; - mid = (mid + Math.imul(ah1, bl4)) | 0; - hi = (hi + Math.imul(ah1, bh4)) | 0; - lo = (lo + Math.imul(al0, bl5)) | 0; - mid = (mid + Math.imul(al0, bh5)) | 0; - mid = (mid + Math.imul(ah0, bl5)) | 0; - hi = (hi + Math.imul(ah0, bh5)) | 0; - var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; - w5 &= 0x3ffffff; - /* k = 6 */ - lo = Math.imul(al6, bl0); - mid = Math.imul(al6, bh0); - mid = (mid + Math.imul(ah6, bl0)) | 0; - hi = Math.imul(ah6, bh0); - lo = (lo + Math.imul(al5, bl1)) | 0; - mid = (mid + Math.imul(al5, bh1)) | 0; - mid = (mid + Math.imul(ah5, bl1)) | 0; - hi = (hi + Math.imul(ah5, bh1)) | 0; - lo = (lo + Math.imul(al4, bl2)) | 0; - mid = (mid + Math.imul(al4, bh2)) | 0; - mid = (mid + Math.imul(ah4, bl2)) | 0; - hi = (hi + Math.imul(ah4, bh2)) | 0; - lo = (lo + Math.imul(al3, bl3)) | 0; - mid = (mid + Math.imul(al3, bh3)) | 0; - mid = (mid + Math.imul(ah3, bl3)) | 0; - hi = (hi + Math.imul(ah3, bh3)) | 0; - lo = (lo + Math.imul(al2, bl4)) | 0; - mid = (mid + Math.imul(al2, bh4)) | 0; - mid = (mid + Math.imul(ah2, bl4)) | 0; - hi = (hi + Math.imul(ah2, bh4)) | 0; - lo = (lo + Math.imul(al1, bl5)) | 0; - mid = (mid + Math.imul(al1, bh5)) | 0; - mid = (mid + Math.imul(ah1, bl5)) | 0; - hi = (hi + Math.imul(ah1, bh5)) | 0; - lo = (lo + Math.imul(al0, bl6)) | 0; - mid = (mid + Math.imul(al0, bh6)) | 0; - mid = (mid + Math.imul(ah0, bl6)) | 0; - hi = (hi + Math.imul(ah0, bh6)) | 0; - var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; - w6 &= 0x3ffffff; - /* k = 7 */ - lo = Math.imul(al7, bl0); - mid = Math.imul(al7, bh0); - mid = (mid + Math.imul(ah7, bl0)) | 0; - hi = Math.imul(ah7, bh0); - lo = (lo + Math.imul(al6, bl1)) | 0; - mid = (mid + Math.imul(al6, bh1)) | 0; - mid = (mid + Math.imul(ah6, bl1)) | 0; - hi = (hi + Math.imul(ah6, bh1)) | 0; - lo = (lo + Math.imul(al5, bl2)) | 0; - mid = (mid + Math.imul(al5, bh2)) | 0; - mid = (mid + Math.imul(ah5, bl2)) | 0; - hi = (hi + Math.imul(ah5, bh2)) | 0; - lo = (lo + Math.imul(al4, bl3)) | 0; - mid = (mid + Math.imul(al4, bh3)) | 0; - mid = (mid + Math.imul(ah4, bl3)) | 0; - hi = (hi + Math.imul(ah4, bh3)) | 0; - lo = (lo + Math.imul(al3, bl4)) | 0; - mid = (mid + Math.imul(al3, bh4)) | 0; - mid = (mid + Math.imul(ah3, bl4)) | 0; - hi = (hi + Math.imul(ah3, bh4)) | 0; - lo = (lo + Math.imul(al2, bl5)) | 0; - mid = (mid + Math.imul(al2, bh5)) | 0; - mid = (mid + Math.imul(ah2, bl5)) | 0; - hi = (hi + Math.imul(ah2, bh5)) | 0; - lo = (lo + Math.imul(al1, bl6)) | 0; - mid = (mid + Math.imul(al1, bh6)) | 0; - mid = (mid + Math.imul(ah1, bl6)) | 0; - hi = (hi + Math.imul(ah1, bh6)) | 0; - lo = (lo + Math.imul(al0, bl7)) | 0; - mid = (mid + Math.imul(al0, bh7)) | 0; - mid = (mid + Math.imul(ah0, bl7)) | 0; - hi = (hi + Math.imul(ah0, bh7)) | 0; - var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; - w7 &= 0x3ffffff; - /* k = 8 */ - lo = Math.imul(al8, bl0); - mid = Math.imul(al8, bh0); - mid = (mid + Math.imul(ah8, bl0)) | 0; - hi = Math.imul(ah8, bh0); - lo = (lo + Math.imul(al7, bl1)) | 0; - mid = (mid + Math.imul(al7, bh1)) | 0; - mid = (mid + Math.imul(ah7, bl1)) | 0; - hi = (hi + Math.imul(ah7, bh1)) | 0; - lo = (lo + Math.imul(al6, bl2)) | 0; - mid = (mid + Math.imul(al6, bh2)) | 0; - mid = (mid + Math.imul(ah6, bl2)) | 0; - hi = (hi + Math.imul(ah6, bh2)) | 0; - lo = (lo + Math.imul(al5, bl3)) | 0; - mid = (mid + Math.imul(al5, bh3)) | 0; - mid = (mid + Math.imul(ah5, bl3)) | 0; - hi = (hi + Math.imul(ah5, bh3)) | 0; - lo = (lo + Math.imul(al4, bl4)) | 0; - mid = (mid + Math.imul(al4, bh4)) | 0; - mid = (mid + Math.imul(ah4, bl4)) | 0; - hi = (hi + Math.imul(ah4, bh4)) | 0; - lo = (lo + Math.imul(al3, bl5)) | 0; - mid = (mid + Math.imul(al3, bh5)) | 0; - mid = (mid + Math.imul(ah3, bl5)) | 0; - hi = (hi + Math.imul(ah3, bh5)) | 0; - lo = (lo + Math.imul(al2, bl6)) | 0; - mid = (mid + Math.imul(al2, bh6)) | 0; - mid = (mid + Math.imul(ah2, bl6)) | 0; - hi = (hi + Math.imul(ah2, bh6)) | 0; - lo = (lo + Math.imul(al1, bl7)) | 0; - mid = (mid + Math.imul(al1, bh7)) | 0; - mid = (mid + Math.imul(ah1, bl7)) | 0; - hi = (hi + Math.imul(ah1, bh7)) | 0; - lo = (lo + Math.imul(al0, bl8)) | 0; - mid = (mid + Math.imul(al0, bh8)) | 0; - mid = (mid + Math.imul(ah0, bl8)) | 0; - hi = (hi + Math.imul(ah0, bh8)) | 0; - var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; - w8 &= 0x3ffffff; - /* k = 9 */ - lo = Math.imul(al9, bl0); - mid = Math.imul(al9, bh0); - mid = (mid + Math.imul(ah9, bl0)) | 0; - hi = Math.imul(ah9, bh0); - lo = (lo + Math.imul(al8, bl1)) | 0; - mid = (mid + Math.imul(al8, bh1)) | 0; - mid = (mid + Math.imul(ah8, bl1)) | 0; - hi = (hi + Math.imul(ah8, bh1)) | 0; - lo = (lo + Math.imul(al7, bl2)) | 0; - mid = (mid + Math.imul(al7, bh2)) | 0; - mid = (mid + Math.imul(ah7, bl2)) | 0; - hi = (hi + Math.imul(ah7, bh2)) | 0; - lo = (lo + Math.imul(al6, bl3)) | 0; - mid = (mid + Math.imul(al6, bh3)) | 0; - mid = (mid + Math.imul(ah6, bl3)) | 0; - hi = (hi + Math.imul(ah6, bh3)) | 0; - lo = (lo + Math.imul(al5, bl4)) | 0; - mid = (mid + Math.imul(al5, bh4)) | 0; - mid = (mid + Math.imul(ah5, bl4)) | 0; - hi = (hi + Math.imul(ah5, bh4)) | 0; - lo = (lo + Math.imul(al4, bl5)) | 0; - mid = (mid + Math.imul(al4, bh5)) | 0; - mid = (mid + Math.imul(ah4, bl5)) | 0; - hi = (hi + Math.imul(ah4, bh5)) | 0; - lo = (lo + Math.imul(al3, bl6)) | 0; - mid = (mid + Math.imul(al3, bh6)) | 0; - mid = (mid + Math.imul(ah3, bl6)) | 0; - hi = (hi + Math.imul(ah3, bh6)) | 0; - lo = (lo + Math.imul(al2, bl7)) | 0; - mid = (mid + Math.imul(al2, bh7)) | 0; - mid = (mid + Math.imul(ah2, bl7)) | 0; - hi = (hi + Math.imul(ah2, bh7)) | 0; - lo = (lo + Math.imul(al1, bl8)) | 0; - mid = (mid + Math.imul(al1, bh8)) | 0; - mid = (mid + Math.imul(ah1, bl8)) | 0; - hi = (hi + Math.imul(ah1, bh8)) | 0; - lo = (lo + Math.imul(al0, bl9)) | 0; - mid = (mid + Math.imul(al0, bh9)) | 0; - mid = (mid + Math.imul(ah0, bl9)) | 0; - hi = (hi + Math.imul(ah0, bh9)) | 0; - var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; - w9 &= 0x3ffffff; - /* k = 10 */ - lo = Math.imul(al9, bl1); - mid = Math.imul(al9, bh1); - mid = (mid + Math.imul(ah9, bl1)) | 0; - hi = Math.imul(ah9, bh1); - lo = (lo + Math.imul(al8, bl2)) | 0; - mid = (mid + Math.imul(al8, bh2)) | 0; - mid = (mid + Math.imul(ah8, bl2)) | 0; - hi = (hi + Math.imul(ah8, bh2)) | 0; - lo = (lo + Math.imul(al7, bl3)) | 0; - mid = (mid + Math.imul(al7, bh3)) | 0; - mid = (mid + Math.imul(ah7, bl3)) | 0; - hi = (hi + Math.imul(ah7, bh3)) | 0; - lo = (lo + Math.imul(al6, bl4)) | 0; - mid = (mid + Math.imul(al6, bh4)) | 0; - mid = (mid + Math.imul(ah6, bl4)) | 0; - hi = (hi + Math.imul(ah6, bh4)) | 0; - lo = (lo + Math.imul(al5, bl5)) | 0; - mid = (mid + Math.imul(al5, bh5)) | 0; - mid = (mid + Math.imul(ah5, bl5)) | 0; - hi = (hi + Math.imul(ah5, bh5)) | 0; - lo = (lo + Math.imul(al4, bl6)) | 0; - mid = (mid + Math.imul(al4, bh6)) | 0; - mid = (mid + Math.imul(ah4, bl6)) | 0; - hi = (hi + Math.imul(ah4, bh6)) | 0; - lo = (lo + Math.imul(al3, bl7)) | 0; - mid = (mid + Math.imul(al3, bh7)) | 0; - mid = (mid + Math.imul(ah3, bl7)) | 0; - hi = (hi + Math.imul(ah3, bh7)) | 0; - lo = (lo + Math.imul(al2, bl8)) | 0; - mid = (mid + Math.imul(al2, bh8)) | 0; - mid = (mid + Math.imul(ah2, bl8)) | 0; - hi = (hi + Math.imul(ah2, bh8)) | 0; - lo = (lo + Math.imul(al1, bl9)) | 0; - mid = (mid + Math.imul(al1, bh9)) | 0; - mid = (mid + Math.imul(ah1, bl9)) | 0; - hi = (hi + Math.imul(ah1, bh9)) | 0; - var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; - w10 &= 0x3ffffff; - /* k = 11 */ - lo = Math.imul(al9, bl2); - mid = Math.imul(al9, bh2); - mid = (mid + Math.imul(ah9, bl2)) | 0; - hi = Math.imul(ah9, bh2); - lo = (lo + Math.imul(al8, bl3)) | 0; - mid = (mid + Math.imul(al8, bh3)) | 0; - mid = (mid + Math.imul(ah8, bl3)) | 0; - hi = (hi + Math.imul(ah8, bh3)) | 0; - lo = (lo + Math.imul(al7, bl4)) | 0; - mid = (mid + Math.imul(al7, bh4)) | 0; - mid = (mid + Math.imul(ah7, bl4)) | 0; - hi = (hi + Math.imul(ah7, bh4)) | 0; - lo = (lo + Math.imul(al6, bl5)) | 0; - mid = (mid + Math.imul(al6, bh5)) | 0; - mid = (mid + Math.imul(ah6, bl5)) | 0; - hi = (hi + Math.imul(ah6, bh5)) | 0; - lo = (lo + Math.imul(al5, bl6)) | 0; - mid = (mid + Math.imul(al5, bh6)) | 0; - mid = (mid + Math.imul(ah5, bl6)) | 0; - hi = (hi + Math.imul(ah5, bh6)) | 0; - lo = (lo + Math.imul(al4, bl7)) | 0; - mid = (mid + Math.imul(al4, bh7)) | 0; - mid = (mid + Math.imul(ah4, bl7)) | 0; - hi = (hi + Math.imul(ah4, bh7)) | 0; - lo = (lo + Math.imul(al3, bl8)) | 0; - mid = (mid + Math.imul(al3, bh8)) | 0; - mid = (mid + Math.imul(ah3, bl8)) | 0; - hi = (hi + Math.imul(ah3, bh8)) | 0; - lo = (lo + Math.imul(al2, bl9)) | 0; - mid = (mid + Math.imul(al2, bh9)) | 0; - mid = (mid + Math.imul(ah2, bl9)) | 0; - hi = (hi + Math.imul(ah2, bh9)) | 0; - var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; - w11 &= 0x3ffffff; - /* k = 12 */ - lo = Math.imul(al9, bl3); - mid = Math.imul(al9, bh3); - mid = (mid + Math.imul(ah9, bl3)) | 0; - hi = Math.imul(ah9, bh3); - lo = (lo + Math.imul(al8, bl4)) | 0; - mid = (mid + Math.imul(al8, bh4)) | 0; - mid = (mid + Math.imul(ah8, bl4)) | 0; - hi = (hi + Math.imul(ah8, bh4)) | 0; - lo = (lo + Math.imul(al7, bl5)) | 0; - mid = (mid + Math.imul(al7, bh5)) | 0; - mid = (mid + Math.imul(ah7, bl5)) | 0; - hi = (hi + Math.imul(ah7, bh5)) | 0; - lo = (lo + Math.imul(al6, bl6)) | 0; - mid = (mid + Math.imul(al6, bh6)) | 0; - mid = (mid + Math.imul(ah6, bl6)) | 0; - hi = (hi + Math.imul(ah6, bh6)) | 0; - lo = (lo + Math.imul(al5, bl7)) | 0; - mid = (mid + Math.imul(al5, bh7)) | 0; - mid = (mid + Math.imul(ah5, bl7)) | 0; - hi = (hi + Math.imul(ah5, bh7)) | 0; - lo = (lo + Math.imul(al4, bl8)) | 0; - mid = (mid + Math.imul(al4, bh8)) | 0; - mid = (mid + Math.imul(ah4, bl8)) | 0; - hi = (hi + Math.imul(ah4, bh8)) | 0; - lo = (lo + Math.imul(al3, bl9)) | 0; - mid = (mid + Math.imul(al3, bh9)) | 0; - mid = (mid + Math.imul(ah3, bl9)) | 0; - hi = (hi + Math.imul(ah3, bh9)) | 0; - var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; - w12 &= 0x3ffffff; - /* k = 13 */ - lo = Math.imul(al9, bl4); - mid = Math.imul(al9, bh4); - mid = (mid + Math.imul(ah9, bl4)) | 0; - hi = Math.imul(ah9, bh4); - lo = (lo + Math.imul(al8, bl5)) | 0; - mid = (mid + Math.imul(al8, bh5)) | 0; - mid = (mid + Math.imul(ah8, bl5)) | 0; - hi = (hi + Math.imul(ah8, bh5)) | 0; - lo = (lo + Math.imul(al7, bl6)) | 0; - mid = (mid + Math.imul(al7, bh6)) | 0; - mid = (mid + Math.imul(ah7, bl6)) | 0; - hi = (hi + Math.imul(ah7, bh6)) | 0; - lo = (lo + Math.imul(al6, bl7)) | 0; - mid = (mid + Math.imul(al6, bh7)) | 0; - mid = (mid + Math.imul(ah6, bl7)) | 0; - hi = (hi + Math.imul(ah6, bh7)) | 0; - lo = (lo + Math.imul(al5, bl8)) | 0; - mid = (mid + Math.imul(al5, bh8)) | 0; - mid = (mid + Math.imul(ah5, bl8)) | 0; - hi = (hi + Math.imul(ah5, bh8)) | 0; - lo = (lo + Math.imul(al4, bl9)) | 0; - mid = (mid + Math.imul(al4, bh9)) | 0; - mid = (mid + Math.imul(ah4, bl9)) | 0; - hi = (hi + Math.imul(ah4, bh9)) | 0; - var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; - w13 &= 0x3ffffff; - /* k = 14 */ - lo = Math.imul(al9, bl5); - mid = Math.imul(al9, bh5); - mid = (mid + Math.imul(ah9, bl5)) | 0; - hi = Math.imul(ah9, bh5); - lo = (lo + Math.imul(al8, bl6)) | 0; - mid = (mid + Math.imul(al8, bh6)) | 0; - mid = (mid + Math.imul(ah8, bl6)) | 0; - hi = (hi + Math.imul(ah8, bh6)) | 0; - lo = (lo + Math.imul(al7, bl7)) | 0; - mid = (mid + Math.imul(al7, bh7)) | 0; - mid = (mid + Math.imul(ah7, bl7)) | 0; - hi = (hi + Math.imul(ah7, bh7)) | 0; - lo = (lo + Math.imul(al6, bl8)) | 0; - mid = (mid + Math.imul(al6, bh8)) | 0; - mid = (mid + Math.imul(ah6, bl8)) | 0; - hi = (hi + Math.imul(ah6, bh8)) | 0; - lo = (lo + Math.imul(al5, bl9)) | 0; - mid = (mid + Math.imul(al5, bh9)) | 0; - mid = (mid + Math.imul(ah5, bl9)) | 0; - hi = (hi + Math.imul(ah5, bh9)) | 0; - var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; - w14 &= 0x3ffffff; - /* k = 15 */ - lo = Math.imul(al9, bl6); - mid = Math.imul(al9, bh6); - mid = (mid + Math.imul(ah9, bl6)) | 0; - hi = Math.imul(ah9, bh6); - lo = (lo + Math.imul(al8, bl7)) | 0; - mid = (mid + Math.imul(al8, bh7)) | 0; - mid = (mid + Math.imul(ah8, bl7)) | 0; - hi = (hi + Math.imul(ah8, bh7)) | 0; - lo = (lo + Math.imul(al7, bl8)) | 0; - mid = (mid + Math.imul(al7, bh8)) | 0; - mid = (mid + Math.imul(ah7, bl8)) | 0; - hi = (hi + Math.imul(ah7, bh8)) | 0; - lo = (lo + Math.imul(al6, bl9)) | 0; - mid = (mid + Math.imul(al6, bh9)) | 0; - mid = (mid + Math.imul(ah6, bl9)) | 0; - hi = (hi + Math.imul(ah6, bh9)) | 0; - var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; - w15 &= 0x3ffffff; - /* k = 16 */ - lo = Math.imul(al9, bl7); - mid = Math.imul(al9, bh7); - mid = (mid + Math.imul(ah9, bl7)) | 0; - hi = Math.imul(ah9, bh7); - lo = (lo + Math.imul(al8, bl8)) | 0; - mid = (mid + Math.imul(al8, bh8)) | 0; - mid = (mid + Math.imul(ah8, bl8)) | 0; - hi = (hi + Math.imul(ah8, bh8)) | 0; - lo = (lo + Math.imul(al7, bl9)) | 0; - mid = (mid + Math.imul(al7, bh9)) | 0; - mid = (mid + Math.imul(ah7, bl9)) | 0; - hi = (hi + Math.imul(ah7, bh9)) | 0; - var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; - w16 &= 0x3ffffff; - /* k = 17 */ - lo = Math.imul(al9, bl8); - mid = Math.imul(al9, bh8); - mid = (mid + Math.imul(ah9, bl8)) | 0; - hi = Math.imul(ah9, bh8); - lo = (lo + Math.imul(al8, bl9)) | 0; - mid = (mid + Math.imul(al8, bh9)) | 0; - mid = (mid + Math.imul(ah8, bl9)) | 0; - hi = (hi + Math.imul(ah8, bh9)) | 0; - var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; - w17 &= 0x3ffffff; - /* k = 18 */ - lo = Math.imul(al9, bl9); - mid = Math.imul(al9, bh9); - mid = (mid + Math.imul(ah9, bl9)) | 0; - hi = Math.imul(ah9, bh9); - var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; - w18 &= 0x3ffffff; - o[0] = w0; - o[1] = w1; - o[2] = w2; - o[3] = w3; - o[4] = w4; - o[5] = w5; - o[6] = w6; - o[7] = w7; - o[8] = w8; - o[9] = w9; - o[10] = w10; - o[11] = w11; - o[12] = w12; - o[13] = w13; - o[14] = w14; - o[15] = w15; - o[16] = w16; - o[17] = w17; - o[18] = w18; - if (c !== 0) { - o[19] = c; - out.length++; - } - return out; - }; - - // Polyfill comb - if (!Math.imul) { - comb10MulTo = smallMulTo; - } - - function bigMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - out.length = self.length + num.length; - - var carry = 0; - var hncarry = 0; - for (var k = 0; k < out.length - 1; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = hncarry; - hncarry = 0; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = k - j; - var a = self.words[i] | 0; - var b = num.words[j] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; - lo = (lo + rword) | 0; - rword = lo & 0x3ffffff; - ncarry = (ncarry + (lo >>> 26)) | 0; - - hncarry += ncarry >>> 26; - ncarry &= 0x3ffffff; - } - out.words[k] = rword; - carry = ncarry; - ncarry = hncarry; - } - if (carry !== 0) { - out.words[k] = carry; - } else { - out.length--; - } - - return out._strip(); - } - - function jumboMulTo (self, num, out) { - // Temporary disable, see https://github.com/indutny/bn.js/issues/211 - // var fftm = new FFTM(); - // return fftm.mulp(self, num, out); - return bigMulTo(self, num, out); - } - - BN.prototype.mulTo = function mulTo (num, out) { - var res; - var len = this.length + num.length; - if (this.length === 10 && num.length === 10) { - res = comb10MulTo(this, num, out); - } else if (len < 63) { - res = smallMulTo(this, num, out); - } else if (len < 1024) { - res = bigMulTo(this, num, out); - } else { - res = jumboMulTo(this, num, out); - } - - return res; - }; - - // Cooley-Tukey algorithm for FFT - // slightly revisited to rely on looping instead of recursion - - function FFTM (x, y) { - this.x = x; - this.y = y; - } - - FFTM.prototype.makeRBT = function makeRBT (N) { - var t = new Array(N); - var l = BN.prototype._countBits(N) - 1; - for (var i = 0; i < N; i++) { - t[i] = this.revBin(i, l, N); - } - - return t; - }; - - // Returns binary-reversed representation of `x` - FFTM.prototype.revBin = function revBin (x, l, N) { - if (x === 0 || x === N - 1) return x; - - var rb = 0; - for (var i = 0; i < l; i++) { - rb |= (x & 1) << (l - i - 1); - x >>= 1; - } - - return rb; - }; - - // Performs "tweedling" phase, therefore 'emulating' - // behaviour of the recursive algorithm - FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { - for (var i = 0; i < N; i++) { - rtws[i] = rws[rbt[i]]; - itws[i] = iws[rbt[i]]; - } - }; - - FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { - this.permute(rbt, rws, iws, rtws, itws, N); - - for (var s = 1; s < N; s <<= 1) { - var l = s << 1; - - var rtwdf = Math.cos(2 * Math.PI / l); - var itwdf = Math.sin(2 * Math.PI / l); - - for (var p = 0; p < N; p += l) { - var rtwdf_ = rtwdf; - var itwdf_ = itwdf; - - for (var j = 0; j < s; j++) { - var re = rtws[p + j]; - var ie = itws[p + j]; - - var ro = rtws[p + j + s]; - var io = itws[p + j + s]; - - var rx = rtwdf_ * ro - itwdf_ * io; - - io = rtwdf_ * io + itwdf_ * ro; - ro = rx; - - rtws[p + j] = re + ro; - itws[p + j] = ie + io; - - rtws[p + j + s] = re - ro; - itws[p + j + s] = ie - io; - - /* jshint maxdepth : false */ - if (j !== l) { - rx = rtwdf * rtwdf_ - itwdf * itwdf_; - - itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; - rtwdf_ = rx; - } - } - } - } - }; - - FFTM.prototype.guessLen13b = function guessLen13b (n, m) { - var N = Math.max(m, n) | 1; - var odd = N & 1; - var i = 0; - for (N = N / 2 | 0; N; N = N >>> 1) { - i++; - } - - return 1 << i + 1 + odd; - }; - - FFTM.prototype.conjugate = function conjugate (rws, iws, N) { - if (N <= 1) return; - - for (var i = 0; i < N / 2; i++) { - var t = rws[i]; - - rws[i] = rws[N - i - 1]; - rws[N - i - 1] = t; - - t = iws[i]; - - iws[i] = -iws[N - i - 1]; - iws[N - i - 1] = -t; - } - }; - - FFTM.prototype.normalize13b = function normalize13b (ws, N) { - var carry = 0; - for (var i = 0; i < N / 2; i++) { - var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + - Math.round(ws[2 * i] / N) + - carry; - - ws[i] = w & 0x3ffffff; - - if (w < 0x4000000) { - carry = 0; - } else { - carry = w / 0x4000000 | 0; - } - } - - return ws; - }; - - FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { - var carry = 0; - for (var i = 0; i < len; i++) { - carry = carry + (ws[i] | 0); - - rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; - rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; - } - - // Pad with zeroes - for (i = 2 * len; i < N; ++i) { - rws[i] = 0; - } - - assert(carry === 0); - assert((carry & ~0x1fff) === 0); - }; - - FFTM.prototype.stub = function stub (N) { - var ph = new Array(N); - for (var i = 0; i < N; i++) { - ph[i] = 0; - } - - return ph; - }; - - FFTM.prototype.mulp = function mulp (x, y, out) { - var N = 2 * this.guessLen13b(x.length, y.length); - - var rbt = this.makeRBT(N); - - var _ = this.stub(N); - - var rws = new Array(N); - var rwst = new Array(N); - var iwst = new Array(N); - - var nrws = new Array(N); - var nrwst = new Array(N); - var niwst = new Array(N); - - var rmws = out.words; - rmws.length = N; - - this.convert13b(x.words, x.length, rws, N); - this.convert13b(y.words, y.length, nrws, N); - - this.transform(rws, _, rwst, iwst, N, rbt); - this.transform(nrws, _, nrwst, niwst, N, rbt); - - for (var i = 0; i < N; i++) { - var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; - iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; - rwst[i] = rx; - } - - this.conjugate(rwst, iwst, N); - this.transform(rwst, iwst, rmws, _, N, rbt); - this.conjugate(rmws, _, N); - this.normalize13b(rmws, N); - - out.negative = x.negative ^ y.negative; - out.length = x.length + y.length; - return out._strip(); - }; - - // Multiply `this` by `num` - BN.prototype.mul = function mul (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return this.mulTo(num, out); - }; - - // Multiply employing FFT - BN.prototype.mulf = function mulf (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return jumboMulTo(this, num, out); - }; - - // In-place Multiplication - BN.prototype.imul = function imul (num) { - return this.clone().mulTo(num, this); - }; - - BN.prototype.imuln = function imuln (num) { - var isNegNum = num < 0; - if (isNegNum) num = -num; - - assert(typeof num === 'number'); - assert(num < 0x4000000); - - // Carry - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = (this.words[i] | 0) * num; - var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); - carry >>= 26; - carry += (w / 0x4000000) | 0; - // NOTE: lo is 27bit maximum - carry += lo >>> 26; - this.words[i] = lo & 0x3ffffff; - } - - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - - return isNegNum ? this.ineg() : this; - }; - - BN.prototype.muln = function muln (num) { - return this.clone().imuln(num); - }; - - // `this` * `this` - BN.prototype.sqr = function sqr () { - return this.mul(this); - }; - - // `this` * `this` in-place - BN.prototype.isqr = function isqr () { - return this.imul(this.clone()); - }; - - // Math.pow(`this`, `num`) - BN.prototype.pow = function pow (num) { - var w = toBitArray(num); - if (w.length === 0) return new BN(1); - - // Skip leading zeroes - var res = this; - for (var i = 0; i < w.length; i++, res = res.sqr()) { - if (w[i] !== 0) break; - } - - if (++i < w.length) { - for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { - if (w[i] === 0) continue; - - res = res.mul(q); - } - } - - return res; - }; - - // Shift-left in-place - BN.prototype.iushln = function iushln (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); - var i; - - if (r !== 0) { - var carry = 0; - - for (i = 0; i < this.length; i++) { - var newCarry = this.words[i] & carryMask; - var c = ((this.words[i] | 0) - newCarry) << r; - this.words[i] = c | carry; - carry = newCarry >>> (26 - r); - } - - if (carry) { - this.words[i] = carry; - this.length++; - } - } - - if (s !== 0) { - for (i = this.length - 1; i >= 0; i--) { - this.words[i + s] = this.words[i]; - } - - for (i = 0; i < s; i++) { - this.words[i] = 0; - } - - this.length += s; - } - - return this._strip(); - }; - - BN.prototype.ishln = function ishln (bits) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushln(bits); - }; - - // Shift-right in-place - // NOTE: `hint` is a lowest bit before trailing zeroes - // NOTE: if `extended` is present - it will be filled with destroyed bits - BN.prototype.iushrn = function iushrn (bits, hint, extended) { - assert(typeof bits === 'number' && bits >= 0); - var h; - if (hint) { - h = (hint - (hint % 26)) / 26; - } else { - h = 0; - } - - var r = bits % 26; - var s = Math.min((bits - r) / 26, this.length); - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - var maskedWords = extended; - - h -= s; - h = Math.max(0, h); - - // Extended mode, copy masked part - if (maskedWords) { - for (var i = 0; i < s; i++) { - maskedWords.words[i] = this.words[i]; - } - maskedWords.length = s; - } - - if (s === 0) { - // No-op, we should not move anything at all - } else if (this.length > s) { - this.length -= s; - for (i = 0; i < this.length; i++) { - this.words[i] = this.words[i + s]; - } - } else { - this.words[0] = 0; - this.length = 1; - } - - var carry = 0; - for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { - var word = this.words[i] | 0; - this.words[i] = (carry << (26 - r)) | (word >>> r); - carry = word & mask; - } - - // Push carried bits as a mask - if (maskedWords && carry !== 0) { - maskedWords.words[maskedWords.length++] = carry; - } - - if (this.length === 0) { - this.words[0] = 0; - this.length = 1; - } - - return this._strip(); - }; - - BN.prototype.ishrn = function ishrn (bits, hint, extended) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushrn(bits, hint, extended); - }; - - // Shift-left - BN.prototype.shln = function shln (bits) { - return this.clone().ishln(bits); - }; - - BN.prototype.ushln = function ushln (bits) { - return this.clone().iushln(bits); - }; - - // Shift-right - BN.prototype.shrn = function shrn (bits) { - return this.clone().ishrn(bits); - }; - - BN.prototype.ushrn = function ushrn (bits) { - return this.clone().iushrn(bits); - }; - - // Test if n bit is set - BN.prototype.testn = function testn (bit) { - assert(typeof bit === 'number' && bit >= 0); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) return false; - - // Check bit and return - var w = this.words[s]; - - return !!(w & q); - }; - - // Return only lowers bits of number (in-place) - BN.prototype.imaskn = function imaskn (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - - assert(this.negative === 0, 'imaskn works only with positive numbers'); - - if (this.length <= s) { - return this; - } - - if (r !== 0) { - s++; - } - this.length = Math.min(s, this.length); - - if (r !== 0) { - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - this.words[this.length - 1] &= mask; - } - - return this._strip(); - }; - - // Return only lowers bits of number - BN.prototype.maskn = function maskn (bits) { - return this.clone().imaskn(bits); - }; - - // Add plain number `num` to `this` - BN.prototype.iaddn = function iaddn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.isubn(-num); - - // Possible sign change - if (this.negative !== 0) { - if (this.length === 1 && (this.words[0] | 0) <= num) { - this.words[0] = num - (this.words[0] | 0); - this.negative = 0; - return this; - } - - this.negative = 0; - this.isubn(num); - this.negative = 1; - return this; - } - - // Add without checks - return this._iaddn(num); - }; - - BN.prototype._iaddn = function _iaddn (num) { - this.words[0] += num; - - // Carry - for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { - this.words[i] -= 0x4000000; - if (i === this.length - 1) { - this.words[i + 1] = 1; - } else { - this.words[i + 1]++; - } - } - this.length = Math.max(this.length, i + 1); - - return this; - }; - - // Subtract plain number `num` from `this` - BN.prototype.isubn = function isubn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.iaddn(-num); - - if (this.negative !== 0) { - this.negative = 0; - this.iaddn(num); - this.negative = 1; - return this; - } - - this.words[0] -= num; - - if (this.length === 1 && this.words[0] < 0) { - this.words[0] = -this.words[0]; - this.negative = 1; - } else { - // Carry - for (var i = 0; i < this.length && this.words[i] < 0; i++) { - this.words[i] += 0x4000000; - this.words[i + 1] -= 1; - } - } - - return this._strip(); - }; - - BN.prototype.addn = function addn (num) { - return this.clone().iaddn(num); - }; - - BN.prototype.subn = function subn (num) { - return this.clone().isubn(num); - }; - - BN.prototype.iabs = function iabs () { - this.negative = 0; - - return this; - }; - - BN.prototype.abs = function abs () { - return this.clone().iabs(); - }; - - BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { - var len = num.length + shift; - var i; - - this._expand(len); - - var w; - var carry = 0; - for (i = 0; i < num.length; i++) { - w = (this.words[i + shift] | 0) + carry; - var right = (num.words[i] | 0) * mul; - w -= right & 0x3ffffff; - carry = (w >> 26) - ((right / 0x4000000) | 0); - this.words[i + shift] = w & 0x3ffffff; - } - for (; i < this.length - shift; i++) { - w = (this.words[i + shift] | 0) + carry; - carry = w >> 26; - this.words[i + shift] = w & 0x3ffffff; - } - - if (carry === 0) return this._strip(); - - // Subtraction overflow - assert(carry === -1); - carry = 0; - for (i = 0; i < this.length; i++) { - w = -(this.words[i] | 0) + carry; - carry = w >> 26; - this.words[i] = w & 0x3ffffff; - } - this.negative = 1; - - return this._strip(); - }; - - BN.prototype._wordDiv = function _wordDiv (num, mode) { - var shift = this.length - num.length; - - var a = this.clone(); - var b = num; - - // Normalize - var bhi = b.words[b.length - 1] | 0; - var bhiBits = this._countBits(bhi); - shift = 26 - bhiBits; - if (shift !== 0) { - b = b.ushln(shift); - a.iushln(shift); - bhi = b.words[b.length - 1] | 0; - } - - // Initialize quotient - var m = a.length - b.length; - var q; - - if (mode !== 'mod') { - q = new BN(null); - q.length = m + 1; - q.words = new Array(q.length); - for (var i = 0; i < q.length; i++) { - q.words[i] = 0; - } - } - - var diff = a.clone()._ishlnsubmul(b, 1, m); - if (diff.negative === 0) { - a = diff; - if (q) { - q.words[m] = 1; - } - } - - for (var j = m - 1; j >= 0; j--) { - 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 - // (0x7ffffff) - qj = Math.min((qj / bhi) | 0, 0x3ffffff); - - a._ishlnsubmul(b, qj, j); - while (a.negative !== 0) { - qj--; - a.negative = 0; - a._ishlnsubmul(b, 1, j); - if (!a.isZero()) { - a.negative ^= 1; - } - } - if (q) { - q.words[j] = qj; - } - } - if (q) { - q._strip(); - } - a._strip(); - - // Denormalize - if (mode !== 'div' && shift !== 0) { - a.iushrn(shift); - } - - return { - div: q || null, - mod: a - }; - }; - - // NOTE: 1) `mode` can be set to `mod` to request mod only, - // to `div` to request div only, or be absent to - // request both div & mod - // 2) `positive` is true if unsigned mod is requested - BN.prototype.divmod = function divmod (num, mode, positive) { - assert(!num.isZero()); - - if (this.isZero()) { - return { - div: new BN(0), - mod: new BN(0) - }; - } - - var div, mod, res; - if (this.negative !== 0 && num.negative === 0) { - res = this.neg().divmod(num, mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.iadd(num); - } - } - - return { - div: div, - mod: mod - }; - } - - if (this.negative === 0 && num.negative !== 0) { - res = this.divmod(num.neg(), mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - return { - div: div, - mod: res.mod - }; - } - - if ((this.negative & num.negative) !== 0) { - res = this.neg().divmod(num.neg(), mode); - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.isub(num); - } - } - - return { - div: res.div, - mod: mod - }; - } - - // Both numbers are positive at this point - - // Strip both numbers to approximate shift value - if (num.length > this.length || this.cmp(num) < 0) { - return { - div: new BN(0), - mod: this - }; - } - - // Very short reduction - if (num.length === 1) { - if (mode === 'div') { - return { - div: this.divn(num.words[0]), - mod: null - }; - } - - if (mode === 'mod') { - return { - div: null, - mod: new BN(this.modrn(num.words[0])) - }; - } - - return { - div: this.divn(num.words[0]), - mod: new BN(this.modrn(num.words[0])) - }; - } - - return this._wordDiv(num, mode); - }; - - // Find `this` / `num` - BN.prototype.div = function div (num) { - return this.divmod(num, 'div', false).div; - }; - - // Find `this` % `num` - BN.prototype.mod = function mod (num) { - return this.divmod(num, 'mod', false).mod; - }; - - BN.prototype.umod = function umod (num) { - return this.divmod(num, 'mod', true).mod; - }; - - // Find Round(`this` / `num`) - BN.prototype.divRound = function divRound (num) { - var dm = this.divmod(num); - - // Fast case - exact division - if (dm.mod.isZero()) return dm.div; - - var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; - - var half = num.ushrn(1); - var r2 = num.andln(1); - var cmp = mod.cmp(half); - - // Round down - if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div; - - // Round up - return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); - }; - - BN.prototype.modrn = function modrn (num) { - var isNegNum = num < 0; - if (isNegNum) num = -num; - - assert(num <= 0x3ffffff); - var p = (1 << 26) % num; - - var acc = 0; - for (var i = this.length - 1; i >= 0; i--) { - acc = (p * acc + (this.words[i] | 0)) % num; - } - - return isNegNum ? -acc : acc; - }; - - // WARNING: DEPRECATED - BN.prototype.modn = function modn (num) { - return this.modrn(num); - }; - - // In-place division by number - BN.prototype.idivn = function idivn (num) { - var isNegNum = num < 0; - if (isNegNum) num = -num; - - assert(num <= 0x3ffffff); - - var carry = 0; - for (var i = this.length - 1; i >= 0; i--) { - var w = (this.words[i] | 0) + carry * 0x4000000; - this.words[i] = (w / num) | 0; - carry = w % num; - } - - this._strip(); - return isNegNum ? this.ineg() : this; - }; - - BN.prototype.divn = function divn (num) { - return this.clone().idivn(num); - }; - - BN.prototype.egcd = function egcd (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var x = this; - var y = p.clone(); - - if (x.negative !== 0) { - x = x.umod(p); - } else { - x = x.clone(); - } - - // A * x + B * y = x - var A = new BN(1); - var B = new BN(0); - - // C * x + D * y = y - var C = new BN(0); - var D = new BN(1); - - var g = 0; - - while (x.isEven() && y.isEven()) { - x.iushrn(1); - y.iushrn(1); - ++g; - } - - var yp = y.clone(); - var xp = x.clone(); - - while (!x.isZero()) { - for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - x.iushrn(i); - while (i-- > 0) { - if (A.isOdd() || B.isOdd()) { - A.iadd(yp); - B.isub(xp); - } - - A.iushrn(1); - B.iushrn(1); - } - } - - for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - y.iushrn(j); - while (j-- > 0) { - if (C.isOdd() || D.isOdd()) { - C.iadd(yp); - D.isub(xp); - } - - C.iushrn(1); - D.iushrn(1); - } - } - - if (x.cmp(y) >= 0) { - x.isub(y); - A.isub(C); - B.isub(D); - } else { - y.isub(x); - C.isub(A); - D.isub(B); - } - } - - return { - a: C, - b: D, - gcd: y.iushln(g) - }; - }; - - // This is reduced incarnation of the binary EEA - // above, designated to invert members of the - // _prime_ fields F(p) at a maximal speed - BN.prototype._invmp = function _invmp (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var a = this; - var b = p.clone(); - - if (a.negative !== 0) { - a = a.umod(p); - } else { - a = a.clone(); - } - - var x1 = new BN(1); - var x2 = new BN(0); - - var delta = b.clone(); - - while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { - for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - a.iushrn(i); - while (i-- > 0) { - if (x1.isOdd()) { - x1.iadd(delta); - } - - x1.iushrn(1); - } - } - - for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - b.iushrn(j); - while (j-- > 0) { - if (x2.isOdd()) { - x2.iadd(delta); - } - - x2.iushrn(1); - } - } - - if (a.cmp(b) >= 0) { - a.isub(b); - x1.isub(x2); - } else { - b.isub(a); - x2.isub(x1); - } - } - - var res; - if (a.cmpn(1) === 0) { - res = x1; - } else { - res = x2; - } - - if (res.cmpn(0) < 0) { - res.iadd(p); - } - - return res; - }; - - BN.prototype.gcd = function gcd (num) { - if (this.isZero()) return num.abs(); - if (num.isZero()) return this.abs(); - - var a = this.clone(); - var b = num.clone(); - a.negative = 0; - b.negative = 0; - - // Remove common factor of two - for (var shift = 0; a.isEven() && b.isEven(); shift++) { - a.iushrn(1); - b.iushrn(1); - } - - do { - while (a.isEven()) { - a.iushrn(1); - } - while (b.isEven()) { - b.iushrn(1); - } - - var r = a.cmp(b); - if (r < 0) { - // Swap `a` and `b` to make `a` always bigger than `b` - var t = a; - a = b; - b = t; - } else if (r === 0 || b.cmpn(1) === 0) { - break; - } - - a.isub(b); - } while (true); - - return b.iushln(shift); - }; - - // Invert number in the field F(num) - BN.prototype.invm = function invm (num) { - return this.egcd(num).a.umod(num); - }; - - BN.prototype.isEven = function isEven () { - return (this.words[0] & 1) === 0; - }; - - BN.prototype.isOdd = function isOdd () { - return (this.words[0] & 1) === 1; - }; - - // And first word and num - BN.prototype.andln = function andln (num) { - return this.words[0] & num; - }; - - // Increment at the bit position in-line - BN.prototype.bincn = function bincn (bit) { - assert(typeof bit === 'number'); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) { - this._expand(s + 1); - this.words[s] |= q; - return this; - } - - // Add bit and propagate, if needed - var carry = q; - for (var i = s; carry !== 0 && i < this.length; i++) { - var w = this.words[i] | 0; - w += carry; - carry = w >>> 26; - w &= 0x3ffffff; - this.words[i] = w; - } - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - return this; - }; - - BN.prototype.isZero = function isZero () { - return this.length === 1 && this.words[0] === 0; - }; - - BN.prototype.cmpn = function cmpn (num) { - var negative = num < 0; - - if (this.negative !== 0 && !negative) return -1; - if (this.negative === 0 && negative) return 1; - - this._strip(); - - var res; - if (this.length > 1) { - res = 1; - } else { - if (negative) { - num = -num; - } - - assert(num <= 0x3ffffff, 'Number is too big'); - - var w = this.words[0] | 0; - res = w === num ? 0 : w < num ? -1 : 1; - } - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Compare two numbers and return: - // 1 - if `this` > `num` - // 0 - if `this` == `num` - // -1 - if `this` < `num` - BN.prototype.cmp = function cmp (num) { - if (this.negative !== 0 && num.negative === 0) return -1; - if (this.negative === 0 && num.negative !== 0) return 1; - - var res = this.ucmp(num); - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Unsigned comparison - BN.prototype.ucmp = function ucmp (num) { - // At this point both numbers have the same sign - if (this.length > num.length) return 1; - if (this.length < num.length) return -1; - - var res = 0; - for (var i = this.length - 1; i >= 0; i--) { - var a = this.words[i] | 0; - var b = num.words[i] | 0; - - if (a === b) continue; - if (a < b) { - res = -1; - } else if (a > b) { - res = 1; - } - break; - } - return res; - }; - - BN.prototype.gtn = function gtn (num) { - return this.cmpn(num) === 1; - }; - - BN.prototype.gt = function gt (num) { - return this.cmp(num) === 1; - }; - - BN.prototype.gten = function gten (num) { - return this.cmpn(num) >= 0; - }; - - BN.prototype.gte = function gte (num) { - return this.cmp(num) >= 0; - }; - - BN.prototype.ltn = function ltn (num) { - return this.cmpn(num) === -1; - }; - - BN.prototype.lt = function lt (num) { - return this.cmp(num) === -1; - }; - - BN.prototype.lten = function lten (num) { - return this.cmpn(num) <= 0; - }; - - BN.prototype.lte = function lte (num) { - return this.cmp(num) <= 0; - }; - - BN.prototype.eqn = function eqn (num) { - return this.cmpn(num) === 0; - }; - - BN.prototype.eq = function eq (num) { - return this.cmp(num) === 0; - }; - - // - // A reduce context, could be using montgomery or something better, depending - // on the `m` itself. - // - BN.red = function red (num) { - return new Red(num); - }; - - BN.prototype.toRed = function toRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - assert(this.negative === 0, 'red works only with positives'); - return ctx.convertTo(this)._forceRed(ctx); - }; - - BN.prototype.fromRed = function fromRed () { - assert(this.red, 'fromRed works only with numbers in reduction context'); - return this.red.convertFrom(this); - }; - - BN.prototype._forceRed = function _forceRed (ctx) { - this.red = ctx; - return this; - }; - - BN.prototype.forceRed = function forceRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - return this._forceRed(ctx); - }; - - BN.prototype.redAdd = function redAdd (num) { - assert(this.red, 'redAdd works only with red numbers'); - return this.red.add(this, num); - }; - - BN.prototype.redIAdd = function redIAdd (num) { - assert(this.red, 'redIAdd works only with red numbers'); - return this.red.iadd(this, num); - }; - - BN.prototype.redSub = function redSub (num) { - assert(this.red, 'redSub works only with red numbers'); - return this.red.sub(this, num); - }; - - BN.prototype.redISub = function redISub (num) { - assert(this.red, 'redISub works only with red numbers'); - return this.red.isub(this, num); - }; - - BN.prototype.redShl = function redShl (num) { - assert(this.red, 'redShl works only with red numbers'); - return this.red.shl(this, num); - }; - - BN.prototype.redMul = function redMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.mul(this, num); - }; - - BN.prototype.redIMul = function redIMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.imul(this, num); - }; - - BN.prototype.redSqr = function redSqr () { - assert(this.red, 'redSqr works only with red numbers'); - this.red._verify1(this); - return this.red.sqr(this); - }; - - BN.prototype.redISqr = function redISqr () { - assert(this.red, 'redISqr works only with red numbers'); - this.red._verify1(this); - return this.red.isqr(this); - }; - - // Square root over p - BN.prototype.redSqrt = function redSqrt () { - assert(this.red, 'redSqrt works only with red numbers'); - this.red._verify1(this); - return this.red.sqrt(this); - }; - - BN.prototype.redInvm = function redInvm () { - assert(this.red, 'redInvm works only with red numbers'); - this.red._verify1(this); - return this.red.invm(this); - }; - - // Return negative clone of `this` % `red modulo` - BN.prototype.redNeg = function redNeg () { - assert(this.red, 'redNeg works only with red numbers'); - this.red._verify1(this); - return this.red.neg(this); - }; - - BN.prototype.redPow = function redPow (num) { - assert(this.red && !num.red, 'redPow(normalNum)'); - this.red._verify1(this); - return this.red.pow(this, num); - }; - - // Prime numbers with efficient reduction - var primes = { - k256: null, - p224: null, - p192: null, - p25519: null - }; - - // Pseudo-Mersenne prime - function MPrime (name, p) { - // P = 2 ^ N - K - this.name = name; - this.p = new BN(p, 16); - this.n = this.p.bitLength(); - this.k = new BN(1).iushln(this.n).isub(this.p); - - this.tmp = this._tmp(); - } - - MPrime.prototype._tmp = function _tmp () { - var tmp = new BN(null); - tmp.words = new Array(Math.ceil(this.n / 13)); - return tmp; - }; - - MPrime.prototype.ireduce = function ireduce (num) { - // Assumes that `num` is less than `P^2` - // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) - var r = num; - var rlen; - - do { - this.split(r, this.tmp); - r = this.imulK(r); - r = r.iadd(this.tmp); - rlen = r.bitLength(); - } while (rlen > this.n); - - var cmp = rlen < this.n ? -1 : r.ucmp(this.p); - if (cmp === 0) { - r.words[0] = 0; - r.length = 1; - } else if (cmp > 0) { - r.isub(this.p); - } else { - if (r.strip !== undefined) { - // r is a BN v4 instance - r.strip(); - } else { - // r is a BN v5 instance - r._strip(); - } - } - - return r; - }; - - MPrime.prototype.split = function split (input, out) { - input.iushrn(this.n, 0, out); - }; - - MPrime.prototype.imulK = function imulK (num) { - return num.imul(this.k); - }; - - function K256 () { - MPrime.call( - this, - 'k256', - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); - } - inherits(K256, MPrime); - - K256.prototype.split = function split (input, output) { - // 256 = 9 * 26 + 22 - var mask = 0x3fffff; - - var outLen = Math.min(input.length, 9); - for (var i = 0; i < outLen; i++) { - output.words[i] = input.words[i]; - } - output.length = outLen; - - if (input.length <= 9) { - input.words[0] = 0; - input.length = 1; - return; - } - - // Shift by 9 limbs - var prev = input.words[9]; - output.words[output.length++] = prev & mask; - - for (i = 10; i < input.length; i++) { - var next = input.words[i] | 0; - input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); - prev = next; - } - prev >>>= 22; - input.words[i - 10] = prev; - if (prev === 0 && input.length > 10) { - input.length -= 10; - } else { - input.length -= 9; - } - }; - - K256.prototype.imulK = function imulK (num) { - // K = 0x1000003d1 = [ 0x40, 0x3d1 ] - num.words[num.length] = 0; - num.words[num.length + 1] = 0; - num.length += 2; - - // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 - var lo = 0; - for (var i = 0; i < num.length; i++) { - var w = num.words[i] | 0; - lo += w * 0x3d1; - num.words[i] = lo & 0x3ffffff; - lo = w * 0x40 + ((lo / 0x4000000) | 0); - } - - // Fast length reduction - if (num.words[num.length - 1] === 0) { - num.length--; - if (num.words[num.length - 1] === 0) { - num.length--; - } - } - return num; - }; - - function P224 () { - MPrime.call( - this, - 'p224', - 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); - } - inherits(P224, MPrime); - - function P192 () { - MPrime.call( - this, - 'p192', - 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); - } - inherits(P192, MPrime); - - function P25519 () { - // 2 ^ 255 - 19 - MPrime.call( - this, - '25519', - '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); - } - inherits(P25519, MPrime); - - P25519.prototype.imulK = function imulK (num) { - // K = 0x13 - var carry = 0; - for (var i = 0; i < num.length; i++) { - var hi = (num.words[i] | 0) * 0x13 + carry; - var lo = hi & 0x3ffffff; - hi >>>= 26; - - num.words[i] = lo; - carry = hi; - } - if (carry !== 0) { - num.words[num.length++] = carry; - } - return num; - }; - - // Exported mostly for testing purposes, use plain name instead - BN._prime = function prime (name) { - // Cached version of prime - if (primes[name]) return primes[name]; - - var prime; - if (name === 'k256') { - prime = new K256(); - } else if (name === 'p224') { - prime = new P224(); - } else if (name === 'p192') { - prime = new P192(); - } else if (name === 'p25519') { - prime = new P25519(); - } else { - throw new Error('Unknown prime ' + name); - } - primes[name] = prime; - - return prime; - }; - - // - // Base reduction engine - // - function Red (m) { - if (typeof m === 'string') { - var prime = BN._prime(m); - this.m = prime.p; - this.prime = prime; - } else { - assert(m.gtn(1), 'modulus must be greater than 1'); - this.m = m; - this.prime = null; - } - } - - Red.prototype._verify1 = function _verify1 (a) { - assert(a.negative === 0, 'red works only with positives'); - assert(a.red, 'red works only with red numbers'); - }; - - Red.prototype._verify2 = function _verify2 (a, b) { - assert((a.negative | b.negative) === 0, 'red works only with positives'); - assert(a.red && a.red === b.red, - 'red works only with red numbers'); - }; - - Red.prototype.imod = function imod (a) { - if (this.prime) return this.prime.ireduce(a)._forceRed(this); - - move(a, a.umod(this.m)._forceRed(this)); - return a; - }; - - Red.prototype.neg = function neg (a) { - if (a.isZero()) { - return a.clone(); - } - - return this.m.sub(a)._forceRed(this); - }; - - Red.prototype.add = function add (a, b) { - this._verify2(a, b); - - var res = a.add(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.iadd = function iadd (a, b) { - this._verify2(a, b); - - var res = a.iadd(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res; - }; - - Red.prototype.sub = function sub (a, b) { - this._verify2(a, b); - - var res = a.sub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.isub = function isub (a, b) { - this._verify2(a, b); - - var res = a.isub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res; - }; - - Red.prototype.shl = function shl (a, num) { - this._verify1(a); - return this.imod(a.ushln(num)); - }; - - Red.prototype.imul = function imul (a, b) { - this._verify2(a, b); - return this.imod(a.imul(b)); - }; - - Red.prototype.mul = function mul (a, b) { - this._verify2(a, b); - return this.imod(a.mul(b)); - }; - - Red.prototype.isqr = function isqr (a) { - return this.imul(a, a.clone()); - }; - - Red.prototype.sqr = function sqr (a) { - return this.mul(a, a); - }; - - Red.prototype.sqrt = function sqrt (a) { - if (a.isZero()) return a.clone(); - - var mod3 = this.m.andln(3); - assert(mod3 % 2 === 1); - - // Fast case - if (mod3 === 3) { - var pow = this.m.add(new BN(1)).iushrn(2); - return this.pow(a, pow); - } - - // Tonelli-Shanks algorithm (Totally unoptimized and slow) - // - // Find Q and S, that Q * 2 ^ S = (P - 1) - var q = this.m.subn(1); - var s = 0; - while (!q.isZero() && q.andln(1) === 0) { - s++; - q.iushrn(1); - } - assert(!q.isZero()); - - var one = new BN(1).toRed(this); - var nOne = one.redNeg(); - - // Find quadratic non-residue - // NOTE: Max is such because of generalized Riemann hypothesis. - var lpow = this.m.subn(1).iushrn(1); - var z = this.m.bitLength(); - z = new BN(2 * z * z).toRed(this); - - while (this.pow(z, lpow).cmp(nOne) !== 0) { - z.redIAdd(nOne); - } - - var c = this.pow(z, q); - var r = this.pow(a, q.addn(1).iushrn(1)); - var t = this.pow(a, q); - var m = s; - while (t.cmp(one) !== 0) { - var tmp = t; - for (var i = 0; tmp.cmp(one) !== 0; i++) { - tmp = tmp.redSqr(); - } - assert(i < m); - var b = this.pow(c, new BN(1).iushln(m - i - 1)); - - r = r.redMul(b); - c = b.redSqr(); - t = t.redMul(c); - m = i; - } - - return r; - }; - - Red.prototype.invm = function invm (a) { - var inv = a._invmp(this.m); - if (inv.negative !== 0) { - inv.negative = 0; - return this.imod(inv).redNeg(); - } else { - return this.imod(inv); - } - }; - - Red.prototype.pow = function pow (a, num) { - if (num.isZero()) return new BN(1).toRed(this); - if (num.cmpn(1) === 0) return a.clone(); - - var windowSize = 4; - var wnd = new Array(1 << windowSize); - wnd[0] = new BN(1).toRed(this); - wnd[1] = a; - for (var i = 2; i < wnd.length; i++) { - wnd[i] = this.mul(wnd[i - 1], a); - } - - var res = wnd[0]; - var current = 0; - var currentLen = 0; - var start = num.bitLength() % 26; - if (start === 0) { - start = 26; - } - - for (i = num.length - 1; i >= 0; i--) { - var word = num.words[i]; - for (var j = start - 1; j >= 0; j--) { - var bit = (word >> j) & 1; - if (res !== wnd[0]) { - res = this.sqr(res); - } - - if (bit === 0 && current === 0) { - currentLen = 0; - continue; - } - - current <<= 1; - current |= bit; - currentLen++; - if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; - - res = this.mul(res, wnd[current]); - currentLen = 0; - current = 0; - } - start = 26; - } - - return res; - }; - - Red.prototype.convertTo = function convertTo (num) { - var r = num.umod(this.m); - - return r === num ? r.clone() : r; - }; - - Red.prototype.convertFrom = function convertFrom (num) { - var res = num.clone(); - res.red = null; - return res; - }; - - // - // Montgomery method engine - // - - BN.mont = function mont (num) { - return new Mont(num); - }; - - function Mont (m) { - Red.call(this, m); - - this.shift = this.m.bitLength(); - if (this.shift % 26 !== 0) { - this.shift += 26 - (this.shift % 26); - } - - this.r = new BN(1).iushln(this.shift); - this.r2 = this.imod(this.r.sqr()); - this.rinv = this.r._invmp(this.m); - - this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); - this.minv = this.minv.umod(this.r); - this.minv = this.r.sub(this.minv); - } - inherits(Mont, Red); - - Mont.prototype.convertTo = function convertTo (num) { - return this.imod(num.ushln(this.shift)); - }; - - Mont.prototype.convertFrom = function convertFrom (num) { - var r = this.imod(num.mul(this.rinv)); - r.red = null; - return r; - }; - - Mont.prototype.imul = function imul (a, b) { - if (a.isZero() || b.isZero()) { - a.words[0] = 0; - a.length = 1; - return a; - } - - var t = a.imul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.mul = function mul (a, b) { - if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); - - var t = a.mul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.invm = function invm (a) { - // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R - var res = this.imod(a._invmp(this.m).mul(this.r2)); - return res._forceRed(this); - }; -})( false || module, this); - - -/***/ }), - -/***/ "./node_modules/brorand/index.js": -/*!***************************************!*\ - !*** ./node_modules/brorand/index.js ***! - \***************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var r; - -module.exports = function rand(len) { - if (!r) - r = new Rand(null); - - return r.generate(len); -}; - -function Rand(rand) { - this.rand = rand; -} -module.exports.Rand = Rand; - -Rand.prototype.generate = function generate(len) { - return this._rand(len); -}; - -// Emulate crypto API using randy -Rand.prototype._rand = function _rand(n) { - if (this.rand.getBytes) - return this.rand.getBytes(n); - - var res = new Uint8Array(n); - for (var i = 0; i < res.length; i++) - res[i] = this.rand.getByte(); - return res; -}; - -if (typeof self === 'object') { - if (self.crypto && self.crypto.getRandomValues) { - // Modern browsers - Rand.prototype._rand = function _rand(n) { - var arr = new Uint8Array(n); - self.crypto.getRandomValues(arr); - return arr; - }; - } else if (self.msCrypto && self.msCrypto.getRandomValues) { - // IE - Rand.prototype._rand = function _rand(n) { - var arr = new Uint8Array(n); - self.msCrypto.getRandomValues(arr); - return arr; - }; - - // Safari's WebWorkers do not have `crypto` - } else if (typeof window === 'object') { - // Old junk - Rand.prototype._rand = function() { - throw new Error('Not implemented yet'); - }; - } -} else { - // Node.js or Web worker with no crypto support - try { - var crypto = __webpack_require__(/*! crypto */ "?3fc0"); - if (typeof crypto.randomBytes !== 'function') - throw new Error('Not supported'); - - Rand.prototype._rand = function _rand(n) { - return crypto.randomBytes(n); - }; - } catch (e) { - } -} - - -/***/ }), - -/***/ "./node_modules/browserify-aes/aes.js": -/*!********************************************!*\ - !*** ./node_modules/browserify-aes/aes.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -// based on the aes implimentation in triple sec -// https://github.com/keybase/triplesec -// which is in turn based on the one from crypto-js -// https://code.google.com/p/crypto-js/ - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -function asUInt32Array (buf) { - if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf) - - var len = (buf.length / 4) | 0 - var out = new Array(len) - - for (var i = 0; i < len; i++) { - out[i] = buf.readUInt32BE(i * 4) - } - - return out -} - -function scrubVec (v) { - for (var i = 0; i < v.length; v++) { - v[i] = 0 - } -} - -function cryptBlock (M, keySchedule, SUB_MIX, SBOX, nRounds) { - var SUB_MIX0 = SUB_MIX[0] - var SUB_MIX1 = SUB_MIX[1] - var SUB_MIX2 = SUB_MIX[2] - var SUB_MIX3 = SUB_MIX[3] - - var s0 = M[0] ^ keySchedule[0] - var s1 = M[1] ^ keySchedule[1] - var s2 = M[2] ^ keySchedule[2] - var s3 = M[3] ^ keySchedule[3] - var t0, t1, t2, t3 - var ksRow = 4 - - for (var round = 1; round < nRounds; round++) { - t0 = SUB_MIX0[s0 >>> 24] ^ SUB_MIX1[(s1 >>> 16) & 0xff] ^ SUB_MIX2[(s2 >>> 8) & 0xff] ^ SUB_MIX3[s3 & 0xff] ^ keySchedule[ksRow++] - t1 = SUB_MIX0[s1 >>> 24] ^ SUB_MIX1[(s2 >>> 16) & 0xff] ^ SUB_MIX2[(s3 >>> 8) & 0xff] ^ SUB_MIX3[s0 & 0xff] ^ keySchedule[ksRow++] - t2 = SUB_MIX0[s2 >>> 24] ^ SUB_MIX1[(s3 >>> 16) & 0xff] ^ SUB_MIX2[(s0 >>> 8) & 0xff] ^ SUB_MIX3[s1 & 0xff] ^ keySchedule[ksRow++] - t3 = SUB_MIX0[s3 >>> 24] ^ SUB_MIX1[(s0 >>> 16) & 0xff] ^ SUB_MIX2[(s1 >>> 8) & 0xff] ^ SUB_MIX3[s2 & 0xff] ^ keySchedule[ksRow++] - s0 = t0 - s1 = t1 - s2 = t2 - s3 = t3 - } - - t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++] - t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++] - t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++] - t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++] - t0 = t0 >>> 0 - t1 = t1 >>> 0 - t2 = t2 >>> 0 - t3 = t3 >>> 0 - - return [t0, t1, t2, t3] -} - -// AES constants -var RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36] -var G = (function () { - // Compute double table - var d = new Array(256) - for (var j = 0; j < 256; j++) { - if (j < 128) { - d[j] = j << 1 - } else { - d[j] = (j << 1) ^ 0x11b - } - } - - var SBOX = [] - var INV_SBOX = [] - var SUB_MIX = [[], [], [], []] - var INV_SUB_MIX = [[], [], [], []] - - // Walk GF(2^8) - var x = 0 - var xi = 0 - for (var i = 0; i < 256; ++i) { - // Compute sbox - var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4) - sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63 - SBOX[x] = sx - INV_SBOX[sx] = x - - // Compute multiplication - var x2 = d[x] - var x4 = d[x2] - var x8 = d[x4] - - // Compute sub bytes, mix columns tables - var t = (d[sx] * 0x101) ^ (sx * 0x1010100) - SUB_MIX[0][x] = (t << 24) | (t >>> 8) - SUB_MIX[1][x] = (t << 16) | (t >>> 16) - SUB_MIX[2][x] = (t << 8) | (t >>> 24) - SUB_MIX[3][x] = t - - // Compute inv sub bytes, inv mix columns tables - t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100) - INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8) - INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16) - INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24) - INV_SUB_MIX[3][sx] = t - - if (x === 0) { - x = xi = 1 - } else { - x = x2 ^ d[d[d[x8 ^ x2]]] - xi ^= d[d[xi]] - } - } - - return { - SBOX: SBOX, - INV_SBOX: INV_SBOX, - SUB_MIX: SUB_MIX, - INV_SUB_MIX: INV_SUB_MIX - } -})() - -function AES (key) { - this._key = asUInt32Array(key) - this._reset() -} - -AES.blockSize = 4 * 4 -AES.keySize = 256 / 8 -AES.prototype.blockSize = AES.blockSize -AES.prototype.keySize = AES.keySize -AES.prototype._reset = function () { - var keyWords = this._key - var keySize = keyWords.length - var nRounds = keySize + 6 - var ksRows = (nRounds + 1) * 4 - - var keySchedule = [] - for (var k = 0; k < keySize; k++) { - keySchedule[k] = keyWords[k] - } - - for (k = keySize; k < ksRows; k++) { - var t = keySchedule[k - 1] - - if (k % keySize === 0) { - t = (t << 8) | (t >>> 24) - t = - (G.SBOX[t >>> 24] << 24) | - (G.SBOX[(t >>> 16) & 0xff] << 16) | - (G.SBOX[(t >>> 8) & 0xff] << 8) | - (G.SBOX[t & 0xff]) - - t ^= RCON[(k / keySize) | 0] << 24 - } else if (keySize > 6 && k % keySize === 4) { - t = - (G.SBOX[t >>> 24] << 24) | - (G.SBOX[(t >>> 16) & 0xff] << 16) | - (G.SBOX[(t >>> 8) & 0xff] << 8) | - (G.SBOX[t & 0xff]) - } - - keySchedule[k] = keySchedule[k - keySize] ^ t - } - - var invKeySchedule = [] - for (var ik = 0; ik < ksRows; ik++) { - var ksR = ksRows - ik - var tt = keySchedule[ksR - (ik % 4 ? 0 : 4)] - - if (ik < 4 || ksR <= 4) { - invKeySchedule[ik] = tt - } else { - invKeySchedule[ik] = - G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^ - G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 0xff]] ^ - G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 0xff]] ^ - G.INV_SUB_MIX[3][G.SBOX[tt & 0xff]] - } - } - - this._nRounds = nRounds - this._keySchedule = keySchedule - this._invKeySchedule = invKeySchedule -} - -AES.prototype.encryptBlockRaw = function (M) { - M = asUInt32Array(M) - return cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds) -} - -AES.prototype.encryptBlock = function (M) { - var out = this.encryptBlockRaw(M) - var buf = Buffer.allocUnsafe(16) - buf.writeUInt32BE(out[0], 0) - buf.writeUInt32BE(out[1], 4) - buf.writeUInt32BE(out[2], 8) - buf.writeUInt32BE(out[3], 12) - return buf -} - -AES.prototype.decryptBlock = function (M) { - M = asUInt32Array(M) - - // swap - var m1 = M[1] - M[1] = M[3] - M[3] = m1 - - var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds) - var buf = Buffer.allocUnsafe(16) - buf.writeUInt32BE(out[0], 0) - buf.writeUInt32BE(out[3], 4) - buf.writeUInt32BE(out[2], 8) - buf.writeUInt32BE(out[1], 12) - return buf -} - -AES.prototype.scrub = function () { - scrubVec(this._keySchedule) - scrubVec(this._invKeySchedule) - scrubVec(this._key) -} - -module.exports.AES = AES - - -/***/ }), - -/***/ "./node_modules/browserify-aes/authCipher.js": -/*!***************************************************!*\ - !*** ./node_modules/browserify-aes/authCipher.js ***! - \***************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var aes = __webpack_require__(/*! ./aes */ "./node_modules/browserify-aes/aes.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var Transform = __webpack_require__(/*! cipher-base */ "./node_modules/cipher-base/index.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var GHASH = __webpack_require__(/*! ./ghash */ "./node_modules/browserify-aes/ghash.js") -var xor = __webpack_require__(/*! buffer-xor */ "./node_modules/buffer-xor/index.js") -var incr32 = __webpack_require__(/*! ./incr32 */ "./node_modules/browserify-aes/incr32.js") - -function xorTest (a, b) { - var out = 0 - if (a.length !== b.length) out++ - - var len = Math.min(a.length, b.length) - for (var i = 0; i < len; ++i) { - out += (a[i] ^ b[i]) - } - - return out -} - -function calcIv (self, iv, ck) { - if (iv.length === 12) { - self._finID = Buffer.concat([iv, Buffer.from([0, 0, 0, 1])]) - return Buffer.concat([iv, Buffer.from([0, 0, 0, 2])]) - } - var ghash = new GHASH(ck) - var len = iv.length - var toPad = len % 16 - ghash.update(iv) - if (toPad) { - toPad = 16 - toPad - ghash.update(Buffer.alloc(toPad, 0)) - } - ghash.update(Buffer.alloc(8, 0)) - var ivBits = len * 8 - var tail = Buffer.alloc(8) - tail.writeUIntBE(ivBits, 0, 8) - ghash.update(tail) - self._finID = ghash.state - var out = Buffer.from(self._finID) - incr32(out) - return out -} -function StreamCipher (mode, key, iv, decrypt) { - Transform.call(this) - - var h = Buffer.alloc(4, 0) - - this._cipher = new aes.AES(key) - var ck = this._cipher.encryptBlock(h) - this._ghash = new GHASH(ck) - iv = calcIv(this, iv, ck) - - this._prev = Buffer.from(iv) - this._cache = Buffer.allocUnsafe(0) - this._secCache = Buffer.allocUnsafe(0) - this._decrypt = decrypt - this._alen = 0 - this._len = 0 - this._mode = mode - - this._authTag = null - this._called = false -} - -inherits(StreamCipher, Transform) - -StreamCipher.prototype._update = function (chunk) { - if (!this._called && this._alen) { - var rump = 16 - (this._alen % 16) - if (rump < 16) { - rump = Buffer.alloc(rump, 0) - this._ghash.update(rump) - } - } - - this._called = true - var out = this._mode.encrypt(this, chunk) - if (this._decrypt) { - this._ghash.update(chunk) - } else { - this._ghash.update(out) - } - this._len += chunk.length - return out -} - -StreamCipher.prototype._final = function () { - if (this._decrypt && !this._authTag) throw new Error('Unsupported state or unable to authenticate data') - - var tag = xor(this._ghash.final(this._alen * 8, this._len * 8), this._cipher.encryptBlock(this._finID)) - if (this._decrypt && xorTest(tag, this._authTag)) throw new Error('Unsupported state or unable to authenticate data') - - this._authTag = tag - this._cipher.scrub() -} - -StreamCipher.prototype.getAuthTag = function getAuthTag () { - if (this._decrypt || !Buffer.isBuffer(this._authTag)) throw new Error('Attempting to get auth tag in unsupported state') - - return this._authTag -} - -StreamCipher.prototype.setAuthTag = function setAuthTag (tag) { - if (!this._decrypt) throw new Error('Attempting to set auth tag in unsupported state') - - this._authTag = tag -} - -StreamCipher.prototype.setAAD = function setAAD (buf) { - if (this._called) throw new Error('Attempting to set AAD in unsupported state') - - this._ghash.update(buf) - this._alen += buf.length -} - -module.exports = StreamCipher - - -/***/ }), - -/***/ "./node_modules/browserify-aes/browser.js": -/*!************************************************!*\ - !*** ./node_modules/browserify-aes/browser.js ***! - \************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var ciphers = __webpack_require__(/*! ./encrypter */ "./node_modules/browserify-aes/encrypter.js") -var deciphers = __webpack_require__(/*! ./decrypter */ "./node_modules/browserify-aes/decrypter.js") -var modes = __webpack_require__(/*! ./modes/list.json */ "./node_modules/browserify-aes/modes/list.json") - -function getCiphers () { - return Object.keys(modes) -} - -exports.createCipher = exports.Cipher = ciphers.createCipher -exports.createCipheriv = exports.Cipheriv = ciphers.createCipheriv -exports.createDecipher = exports.Decipher = deciphers.createDecipher -exports.createDecipheriv = exports.Decipheriv = deciphers.createDecipheriv -exports.listCiphers = exports.getCiphers = getCiphers - - -/***/ }), - -/***/ "./node_modules/browserify-aes/decrypter.js": -/*!**************************************************!*\ - !*** ./node_modules/browserify-aes/decrypter.js ***! - \**************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var AuthCipher = __webpack_require__(/*! ./authCipher */ "./node_modules/browserify-aes/authCipher.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var MODES = __webpack_require__(/*! ./modes */ "./node_modules/browserify-aes/modes/index.js") -var StreamCipher = __webpack_require__(/*! ./streamCipher */ "./node_modules/browserify-aes/streamCipher.js") -var Transform = __webpack_require__(/*! cipher-base */ "./node_modules/cipher-base/index.js") -var aes = __webpack_require__(/*! ./aes */ "./node_modules/browserify-aes/aes.js") -var ebtk = __webpack_require__(/*! evp_bytestokey */ "./node_modules/evp_bytestokey/index.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") - -function Decipher (mode, key, iv) { - Transform.call(this) - - this._cache = new Splitter() - this._last = void 0 - this._cipher = new aes.AES(key) - this._prev = Buffer.from(iv) - this._mode = mode - this._autopadding = true -} - -inherits(Decipher, Transform) - -Decipher.prototype._update = function (data) { - this._cache.add(data) - var chunk - var thing - var out = [] - while ((chunk = this._cache.get(this._autopadding))) { - thing = this._mode.decrypt(this, chunk) - out.push(thing) - } - return Buffer.concat(out) -} - -Decipher.prototype._final = function () { - var chunk = this._cache.flush() - if (this._autopadding) { - return unpad(this._mode.decrypt(this, chunk)) - } else if (chunk) { - throw new Error('data not multiple of block length') - } -} - -Decipher.prototype.setAutoPadding = function (setTo) { - this._autopadding = !!setTo - return this -} - -function Splitter () { - this.cache = Buffer.allocUnsafe(0) -} - -Splitter.prototype.add = function (data) { - this.cache = Buffer.concat([this.cache, data]) -} - -Splitter.prototype.get = function (autoPadding) { - var out - if (autoPadding) { - if (this.cache.length > 16) { - out = this.cache.slice(0, 16) - this.cache = this.cache.slice(16) - return out - } - } else { - if (this.cache.length >= 16) { - out = this.cache.slice(0, 16) - this.cache = this.cache.slice(16) - return out - } - } - - return null -} - -Splitter.prototype.flush = function () { - if (this.cache.length) return this.cache -} - -function unpad (last) { - var padded = last[15] - if (padded < 1 || padded > 16) { - throw new Error('unable to decrypt data') - } - var i = -1 - while (++i < padded) { - if (last[(i + (16 - padded))] !== padded) { - throw new Error('unable to decrypt data') - } - } - if (padded === 16) return - - return last.slice(0, 16 - padded) -} - -function createDecipheriv (suite, password, iv) { - var config = MODES[suite.toLowerCase()] - if (!config) throw new TypeError('invalid suite type') - - if (typeof iv === 'string') iv = Buffer.from(iv) - if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length) - - if (typeof password === 'string') password = Buffer.from(password) - if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length) - - if (config.type === 'stream') { - return new StreamCipher(config.module, password, iv, true) - } else if (config.type === 'auth') { - return new AuthCipher(config.module, password, iv, true) - } - - return new Decipher(config.module, password, iv) -} - -function createDecipher (suite, password) { - var config = MODES[suite.toLowerCase()] - if (!config) throw new TypeError('invalid suite type') - - var keys = ebtk(password, false, config.key, config.iv) - return createDecipheriv(suite, keys.key, keys.iv) -} - -exports.createDecipher = createDecipher -exports.createDecipheriv = createDecipheriv - - -/***/ }), - -/***/ "./node_modules/browserify-aes/encrypter.js": -/*!**************************************************!*\ - !*** ./node_modules/browserify-aes/encrypter.js ***! - \**************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var MODES = __webpack_require__(/*! ./modes */ "./node_modules/browserify-aes/modes/index.js") -var AuthCipher = __webpack_require__(/*! ./authCipher */ "./node_modules/browserify-aes/authCipher.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var StreamCipher = __webpack_require__(/*! ./streamCipher */ "./node_modules/browserify-aes/streamCipher.js") -var Transform = __webpack_require__(/*! cipher-base */ "./node_modules/cipher-base/index.js") -var aes = __webpack_require__(/*! ./aes */ "./node_modules/browserify-aes/aes.js") -var ebtk = __webpack_require__(/*! evp_bytestokey */ "./node_modules/evp_bytestokey/index.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") - -function Cipher (mode, key, iv) { - Transform.call(this) - - this._cache = new Splitter() - this._cipher = new aes.AES(key) - this._prev = Buffer.from(iv) - this._mode = mode - this._autopadding = true -} - -inherits(Cipher, Transform) - -Cipher.prototype._update = function (data) { - this._cache.add(data) - var chunk - var thing - var out = [] - - while ((chunk = this._cache.get())) { - thing = this._mode.encrypt(this, chunk) - out.push(thing) - } - - return Buffer.concat(out) -} - -var PADDING = Buffer.alloc(16, 0x10) - -Cipher.prototype._final = function () { - var chunk = this._cache.flush() - if (this._autopadding) { - chunk = this._mode.encrypt(this, chunk) - this._cipher.scrub() - return chunk - } - - if (!chunk.equals(PADDING)) { - this._cipher.scrub() - throw new Error('data not multiple of block length') - } -} - -Cipher.prototype.setAutoPadding = function (setTo) { - this._autopadding = !!setTo - return this -} - -function Splitter () { - this.cache = Buffer.allocUnsafe(0) -} - -Splitter.prototype.add = function (data) { - this.cache = Buffer.concat([this.cache, data]) -} - -Splitter.prototype.get = function () { - if (this.cache.length > 15) { - var out = this.cache.slice(0, 16) - this.cache = this.cache.slice(16) - return out - } - return null -} - -Splitter.prototype.flush = function () { - var len = 16 - this.cache.length - var padBuff = Buffer.allocUnsafe(len) - - var i = -1 - while (++i < len) { - padBuff.writeUInt8(len, i) - } - - return Buffer.concat([this.cache, padBuff]) -} - -function createCipheriv (suite, password, iv) { - var config = MODES[suite.toLowerCase()] - if (!config) throw new TypeError('invalid suite type') - - if (typeof password === 'string') password = Buffer.from(password) - if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length) - - if (typeof iv === 'string') iv = Buffer.from(iv) - if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length) - - if (config.type === 'stream') { - return new StreamCipher(config.module, password, iv) - } else if (config.type === 'auth') { - return new AuthCipher(config.module, password, iv) - } - - return new Cipher(config.module, password, iv) -} - -function createCipher (suite, password) { - var config = MODES[suite.toLowerCase()] - if (!config) throw new TypeError('invalid suite type') - - var keys = ebtk(password, false, config.key, config.iv) - return createCipheriv(suite, keys.key, keys.iv) -} - -exports.createCipheriv = createCipheriv -exports.createCipher = createCipher - - -/***/ }), - -/***/ "./node_modules/browserify-aes/ghash.js": -/*!**********************************************!*\ - !*** ./node_modules/browserify-aes/ghash.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var ZEROES = Buffer.alloc(16, 0) - -function toArray (buf) { - return [ - buf.readUInt32BE(0), - buf.readUInt32BE(4), - buf.readUInt32BE(8), - buf.readUInt32BE(12) - ] -} - -function fromArray (out) { - var buf = Buffer.allocUnsafe(16) - buf.writeUInt32BE(out[0] >>> 0, 0) - buf.writeUInt32BE(out[1] >>> 0, 4) - buf.writeUInt32BE(out[2] >>> 0, 8) - buf.writeUInt32BE(out[3] >>> 0, 12) - return buf -} - -function GHASH (key) { - this.h = key - this.state = Buffer.alloc(16, 0) - this.cache = Buffer.allocUnsafe(0) -} - -// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html -// by Juho Vähä-Herttua -GHASH.prototype.ghash = function (block) { - var i = -1 - while (++i < block.length) { - this.state[i] ^= block[i] - } - this._multiply() -} - -GHASH.prototype._multiply = function () { - var Vi = toArray(this.h) - var Zi = [0, 0, 0, 0] - var j, xi, lsbVi - var i = -1 - while (++i < 128) { - xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0 - if (xi) { - // Z_i+1 = Z_i ^ V_i - Zi[0] ^= Vi[0] - Zi[1] ^= Vi[1] - Zi[2] ^= Vi[2] - Zi[3] ^= Vi[3] - } - - // Store the value of LSB(V_i) - lsbVi = (Vi[3] & 1) !== 0 - - // V_i+1 = V_i >> 1 - for (j = 3; j > 0; j--) { - Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31) - } - Vi[0] = Vi[0] >>> 1 - - // If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R - if (lsbVi) { - Vi[0] = Vi[0] ^ (0xe1 << 24) - } - } - this.state = fromArray(Zi) -} - -GHASH.prototype.update = function (buf) { - this.cache = Buffer.concat([this.cache, buf]) - var chunk - while (this.cache.length >= 16) { - chunk = this.cache.slice(0, 16) - this.cache = this.cache.slice(16) - this.ghash(chunk) - } -} - -GHASH.prototype.final = function (abl, bl) { - if (this.cache.length) { - this.ghash(Buffer.concat([this.cache, ZEROES], 16)) - } - - this.ghash(fromArray([0, abl, 0, bl])) - return this.state -} - -module.exports = GHASH - - -/***/ }), - -/***/ "./node_modules/browserify-aes/incr32.js": -/*!***********************************************!*\ - !*** ./node_modules/browserify-aes/incr32.js ***! - \***********************************************/ -/***/ ((module) => { - -function incr32 (iv) { - var len = iv.length - var item - while (len--) { - item = iv.readUInt8(len) - if (item === 255) { - iv.writeUInt8(0, len) - } else { - item++ - iv.writeUInt8(item, len) - break - } - } -} -module.exports = incr32 - - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/cbc.js": -/*!**************************************************!*\ - !*** ./node_modules/browserify-aes/modes/cbc.js ***! - \**************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var xor = __webpack_require__(/*! buffer-xor */ "./node_modules/buffer-xor/index.js") - -exports.encrypt = function (self, block) { - var data = xor(block, self._prev) - - self._prev = self._cipher.encryptBlock(data) - return self._prev -} - -exports.decrypt = function (self, block) { - var pad = self._prev - - self._prev = block - var out = self._cipher.decryptBlock(block) - - return xor(out, pad) -} - - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/cfb.js": -/*!**************************************************!*\ - !*** ./node_modules/browserify-aes/modes/cfb.js ***! - \**************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var xor = __webpack_require__(/*! buffer-xor */ "./node_modules/buffer-xor/index.js") - -function encryptStart (self, data, decrypt) { - var len = data.length - var out = xor(data, self._cache) - self._cache = self._cache.slice(len) - self._prev = Buffer.concat([self._prev, decrypt ? data : out]) - return out -} - -exports.encrypt = function (self, data, decrypt) { - var out = Buffer.allocUnsafe(0) - var len - - while (data.length) { - if (self._cache.length === 0) { - self._cache = self._cipher.encryptBlock(self._prev) - self._prev = Buffer.allocUnsafe(0) - } - - if (self._cache.length <= data.length) { - len = self._cache.length - out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)]) - data = data.slice(len) - } else { - out = Buffer.concat([out, encryptStart(self, data, decrypt)]) - break - } - } - - return out -} - - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/cfb1.js": -/*!***************************************************!*\ - !*** ./node_modules/browserify-aes/modes/cfb1.js ***! - \***************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -function encryptByte (self, byteParam, decrypt) { - var pad - var i = -1 - var len = 8 - var out = 0 - var bit, value - while (++i < len) { - pad = self._cipher.encryptBlock(self._prev) - bit = (byteParam & (1 << (7 - i))) ? 0x80 : 0 - value = pad[0] ^ bit - out += ((value & 0x80) >> (i % 8)) - self._prev = shiftIn(self._prev, decrypt ? bit : value) - } - return out -} - -function shiftIn (buffer, value) { - var len = buffer.length - var i = -1 - var out = Buffer.allocUnsafe(buffer.length) - buffer = Buffer.concat([buffer, Buffer.from([value])]) - - while (++i < len) { - out[i] = buffer[i] << 1 | buffer[i + 1] >> (7) - } - - return out -} - -exports.encrypt = function (self, chunk, decrypt) { - var len = chunk.length - var out = Buffer.allocUnsafe(len) - var i = -1 - - while (++i < len) { - out[i] = encryptByte(self, chunk[i], decrypt) - } - - return out -} - - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/cfb8.js": -/*!***************************************************!*\ - !*** ./node_modules/browserify-aes/modes/cfb8.js ***! - \***************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -function encryptByte (self, byteParam, decrypt) { - var pad = self._cipher.encryptBlock(self._prev) - var out = pad[0] ^ byteParam - - self._prev = Buffer.concat([ - self._prev.slice(1), - Buffer.from([decrypt ? byteParam : out]) - ]) - - return out -} - -exports.encrypt = function (self, chunk, decrypt) { - var len = chunk.length - var out = Buffer.allocUnsafe(len) - var i = -1 - - while (++i < len) { - out[i] = encryptByte(self, chunk[i], decrypt) - } - - return out -} - - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/ctr.js": -/*!**************************************************!*\ - !*** ./node_modules/browserify-aes/modes/ctr.js ***! - \**************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var xor = __webpack_require__(/*! buffer-xor */ "./node_modules/buffer-xor/index.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var incr32 = __webpack_require__(/*! ../incr32 */ "./node_modules/browserify-aes/incr32.js") - -function getBlock (self) { - var out = self._cipher.encryptBlockRaw(self._prev) - incr32(self._prev) - return out -} - -var blockSize = 16 -exports.encrypt = function (self, chunk) { - var chunkNum = Math.ceil(chunk.length / blockSize) - var start = self._cache.length - self._cache = Buffer.concat([ - self._cache, - Buffer.allocUnsafe(chunkNum * blockSize) - ]) - for (var i = 0; i < chunkNum; i++) { - var out = getBlock(self) - var offset = start + i * blockSize - self._cache.writeUInt32BE(out[0], offset + 0) - self._cache.writeUInt32BE(out[1], offset + 4) - self._cache.writeUInt32BE(out[2], offset + 8) - self._cache.writeUInt32BE(out[3], offset + 12) - } - var pad = self._cache.slice(0, chunk.length) - self._cache = self._cache.slice(chunk.length) - return xor(chunk, pad) -} - - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/ecb.js": -/*!**************************************************!*\ - !*** ./node_modules/browserify-aes/modes/ecb.js ***! - \**************************************************/ -/***/ ((__unused_webpack_module, exports) => { - -exports.encrypt = function (self, block) { - return self._cipher.encryptBlock(block) -} - -exports.decrypt = function (self, block) { - return self._cipher.decryptBlock(block) -} - - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/index.js": -/*!****************************************************!*\ - !*** ./node_modules/browserify-aes/modes/index.js ***! - \****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var modeModules = { - ECB: __webpack_require__(/*! ./ecb */ "./node_modules/browserify-aes/modes/ecb.js"), - CBC: __webpack_require__(/*! ./cbc */ "./node_modules/browserify-aes/modes/cbc.js"), - CFB: __webpack_require__(/*! ./cfb */ "./node_modules/browserify-aes/modes/cfb.js"), - CFB8: __webpack_require__(/*! ./cfb8 */ "./node_modules/browserify-aes/modes/cfb8.js"), - CFB1: __webpack_require__(/*! ./cfb1 */ "./node_modules/browserify-aes/modes/cfb1.js"), - OFB: __webpack_require__(/*! ./ofb */ "./node_modules/browserify-aes/modes/ofb.js"), - CTR: __webpack_require__(/*! ./ctr */ "./node_modules/browserify-aes/modes/ctr.js"), - GCM: __webpack_require__(/*! ./ctr */ "./node_modules/browserify-aes/modes/ctr.js") -} - -var modes = __webpack_require__(/*! ./list.json */ "./node_modules/browserify-aes/modes/list.json") - -for (var key in modes) { - modes[key].module = modeModules[modes[key].mode] -} - -module.exports = modes - - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/list.json": -/*!*****************************************************!*\ - !*** ./node_modules/browserify-aes/modes/list.json ***! - \*****************************************************/ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"aes-128-ecb":{"cipher":"AES","key":128,"iv":0,"mode":"ECB","type":"block"},"aes-192-ecb":{"cipher":"AES","key":192,"iv":0,"mode":"ECB","type":"block"},"aes-256-ecb":{"cipher":"AES","key":256,"iv":0,"mode":"ECB","type":"block"},"aes-128-cbc":{"cipher":"AES","key":128,"iv":16,"mode":"CBC","type":"block"},"aes-192-cbc":{"cipher":"AES","key":192,"iv":16,"mode":"CBC","type":"block"},"aes-256-cbc":{"cipher":"AES","key":256,"iv":16,"mode":"CBC","type":"block"},"aes128":{"cipher":"AES","key":128,"iv":16,"mode":"CBC","type":"block"},"aes192":{"cipher":"AES","key":192,"iv":16,"mode":"CBC","type":"block"},"aes256":{"cipher":"AES","key":256,"iv":16,"mode":"CBC","type":"block"},"aes-128-cfb":{"cipher":"AES","key":128,"iv":16,"mode":"CFB","type":"stream"},"aes-192-cfb":{"cipher":"AES","key":192,"iv":16,"mode":"CFB","type":"stream"},"aes-256-cfb":{"cipher":"AES","key":256,"iv":16,"mode":"CFB","type":"stream"},"aes-128-cfb8":{"cipher":"AES","key":128,"iv":16,"mode":"CFB8","type":"stream"},"aes-192-cfb8":{"cipher":"AES","key":192,"iv":16,"mode":"CFB8","type":"stream"},"aes-256-cfb8":{"cipher":"AES","key":256,"iv":16,"mode":"CFB8","type":"stream"},"aes-128-cfb1":{"cipher":"AES","key":128,"iv":16,"mode":"CFB1","type":"stream"},"aes-192-cfb1":{"cipher":"AES","key":192,"iv":16,"mode":"CFB1","type":"stream"},"aes-256-cfb1":{"cipher":"AES","key":256,"iv":16,"mode":"CFB1","type":"stream"},"aes-128-ofb":{"cipher":"AES","key":128,"iv":16,"mode":"OFB","type":"stream"},"aes-192-ofb":{"cipher":"AES","key":192,"iv":16,"mode":"OFB","type":"stream"},"aes-256-ofb":{"cipher":"AES","key":256,"iv":16,"mode":"OFB","type":"stream"},"aes-128-ctr":{"cipher":"AES","key":128,"iv":16,"mode":"CTR","type":"stream"},"aes-192-ctr":{"cipher":"AES","key":192,"iv":16,"mode":"CTR","type":"stream"},"aes-256-ctr":{"cipher":"AES","key":256,"iv":16,"mode":"CTR","type":"stream"},"aes-128-gcm":{"cipher":"AES","key":128,"iv":12,"mode":"GCM","type":"auth"},"aes-192-gcm":{"cipher":"AES","key":192,"iv":12,"mode":"GCM","type":"auth"},"aes-256-gcm":{"cipher":"AES","key":256,"iv":12,"mode":"GCM","type":"auth"}}'); - -/***/ }), - -/***/ "./node_modules/browserify-aes/modes/ofb.js": -/*!**************************************************!*\ - !*** ./node_modules/browserify-aes/modes/ofb.js ***! - \**************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var xor = __webpack_require__(/*! buffer-xor */ "./node_modules/buffer-xor/index.js") - -function getBlock (self) { - self._prev = self._cipher.encryptBlock(self._prev) - return self._prev -} - -exports.encrypt = function (self, chunk) { - while (self._cache.length < chunk.length) { - self._cache = Buffer.concat([self._cache, getBlock(self)]) - } - - var pad = self._cache.slice(0, chunk.length) - self._cache = self._cache.slice(chunk.length) - return xor(chunk, pad) -} - - -/***/ }), - -/***/ "./node_modules/browserify-aes/streamCipher.js": -/*!*****************************************************!*\ - !*** ./node_modules/browserify-aes/streamCipher.js ***! - \*****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var aes = __webpack_require__(/*! ./aes */ "./node_modules/browserify-aes/aes.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var Transform = __webpack_require__(/*! cipher-base */ "./node_modules/cipher-base/index.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") - -function StreamCipher (mode, key, iv, decrypt) { - Transform.call(this) - - this._cipher = new aes.AES(key) - this._prev = Buffer.from(iv) - this._cache = Buffer.allocUnsafe(0) - this._secCache = Buffer.allocUnsafe(0) - this._decrypt = decrypt - this._mode = mode -} - -inherits(StreamCipher, Transform) - -StreamCipher.prototype._update = function (chunk) { - return this._mode.encrypt(this, chunk, this._decrypt) -} - -StreamCipher.prototype._final = function () { - this._cipher.scrub() -} - -module.exports = StreamCipher - - -/***/ }), - -/***/ "./node_modules/browserify-cipher/browser.js": -/*!***************************************************!*\ - !*** ./node_modules/browserify-cipher/browser.js ***! - \***************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var DES = __webpack_require__(/*! browserify-des */ "./node_modules/browserify-des/index.js") -var aes = __webpack_require__(/*! browserify-aes/browser */ "./node_modules/browserify-aes/browser.js") -var aesModes = __webpack_require__(/*! browserify-aes/modes */ "./node_modules/browserify-aes/modes/index.js") -var desModes = __webpack_require__(/*! browserify-des/modes */ "./node_modules/browserify-des/modes.js") -var ebtk = __webpack_require__(/*! evp_bytestokey */ "./node_modules/evp_bytestokey/index.js") - -function createCipher (suite, password) { - suite = suite.toLowerCase() - - var keyLen, ivLen - if (aesModes[suite]) { - keyLen = aesModes[suite].key - ivLen = aesModes[suite].iv - } else if (desModes[suite]) { - keyLen = desModes[suite].key * 8 - ivLen = desModes[suite].iv - } else { - throw new TypeError('invalid suite type') - } - - var keys = ebtk(password, false, keyLen, ivLen) - return createCipheriv(suite, keys.key, keys.iv) -} - -function createDecipher (suite, password) { - suite = suite.toLowerCase() - - var keyLen, ivLen - if (aesModes[suite]) { - keyLen = aesModes[suite].key - ivLen = aesModes[suite].iv - } else if (desModes[suite]) { - keyLen = desModes[suite].key * 8 - ivLen = desModes[suite].iv - } else { - throw new TypeError('invalid suite type') - } - - var keys = ebtk(password, false, keyLen, ivLen) - return createDecipheriv(suite, keys.key, keys.iv) -} - -function createCipheriv (suite, key, iv) { - suite = suite.toLowerCase() - if (aesModes[suite]) return aes.createCipheriv(suite, key, iv) - if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite }) - - throw new TypeError('invalid suite type') -} - -function createDecipheriv (suite, key, iv) { - suite = suite.toLowerCase() - if (aesModes[suite]) return aes.createDecipheriv(suite, key, iv) - if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite, decrypt: true }) - - throw new TypeError('invalid suite type') -} - -function getCiphers () { - return Object.keys(desModes).concat(aes.getCiphers()) -} - -exports.createCipher = exports.Cipher = createCipher -exports.createCipheriv = exports.Cipheriv = createCipheriv -exports.createDecipher = exports.Decipher = createDecipher -exports.createDecipheriv = exports.Decipheriv = createDecipheriv -exports.listCiphers = exports.getCiphers = getCiphers - - -/***/ }), - -/***/ "./node_modules/browserify-des/index.js": -/*!**********************************************!*\ - !*** ./node_modules/browserify-des/index.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var CipherBase = __webpack_require__(/*! cipher-base */ "./node_modules/cipher-base/index.js") -var des = __webpack_require__(/*! des.js */ "./node_modules/des.js/lib/des.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var modes = { - 'des-ede3-cbc': des.CBC.instantiate(des.EDE), - 'des-ede3': des.EDE, - 'des-ede-cbc': des.CBC.instantiate(des.EDE), - 'des-ede': des.EDE, - 'des-cbc': des.CBC.instantiate(des.DES), - 'des-ecb': des.DES -} -modes.des = modes['des-cbc'] -modes.des3 = modes['des-ede3-cbc'] -module.exports = DES -inherits(DES, CipherBase) -function DES (opts) { - CipherBase.call(this) - var modeName = opts.mode.toLowerCase() - var mode = modes[modeName] - var type - if (opts.decrypt) { - type = 'decrypt' - } else { - type = 'encrypt' - } - var key = opts.key - if (!Buffer.isBuffer(key)) { - key = Buffer.from(key) - } - if (modeName === 'des-ede' || modeName === 'des-ede-cbc') { - key = Buffer.concat([key, key.slice(0, 8)]) - } - var iv = opts.iv - if (!Buffer.isBuffer(iv)) { - iv = Buffer.from(iv) - } - this._des = mode.create({ - key: key, - iv: iv, - type: type - }) -} -DES.prototype._update = function (data) { - return Buffer.from(this._des.update(data)) -} -DES.prototype._final = function () { - return Buffer.from(this._des.final()) -} - - -/***/ }), - -/***/ "./node_modules/browserify-des/modes.js": -/*!**********************************************!*\ - !*** ./node_modules/browserify-des/modes.js ***! - \**********************************************/ -/***/ ((__unused_webpack_module, exports) => { - -exports["des-ecb"] = { - key: 8, - iv: 0 -} -exports["des-cbc"] = exports.des = { - key: 8, - iv: 8 -} -exports["des-ede3-cbc"] = exports.des3 = { - key: 24, - iv: 8 -} -exports["des-ede3"] = { - key: 24, - iv: 0 -} -exports["des-ede-cbc"] = { - key: 16, - iv: 8 -} -exports["des-ede"] = { - key: 16, - iv: 0 -} - - -/***/ }), - -/***/ "./node_modules/browserify-rsa/index.js": -/*!**********************************************!*\ - !*** ./node_modules/browserify-rsa/index.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var BN = __webpack_require__(/*! bn.js */ "./node_modules/bn.js/lib/bn.js") -var randomBytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") - -function blind (priv) { - var r = getr(priv) - var blinder = r.toRed(BN.mont(priv.modulus)).redPow(new BN(priv.publicExponent)).fromRed() - return { blinder: blinder, unblinder: r.invm(priv.modulus) } -} - -function getr (priv) { - var len = priv.modulus.byteLength() - var r - do { - r = new BN(randomBytes(len)) - } while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2)) - return r -} - -function crt (msg, priv) { - var blinds = blind(priv) - var len = priv.modulus.byteLength() - var blinded = new BN(msg).mul(blinds.blinder).umod(priv.modulus) - var c1 = blinded.toRed(BN.mont(priv.prime1)) - var c2 = blinded.toRed(BN.mont(priv.prime2)) - var qinv = priv.coefficient - var p = priv.prime1 - var q = priv.prime2 - var m1 = c1.redPow(priv.exponent1).fromRed() - var m2 = c2.redPow(priv.exponent2).fromRed() - var h = m1.isub(m2).imul(qinv).umod(p).imul(q) - return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, 'be', len) -} -crt.getr = getr - -module.exports = crt - - -/***/ }), - -/***/ "./node_modules/browserify-sign/algos.js": -/*!***********************************************!*\ - !*** ./node_modules/browserify-sign/algos.js ***! - \***********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = __webpack_require__(/*! ./browser/algorithms.json */ "./node_modules/browserify-sign/browser/algorithms.json") - - -/***/ }), - -/***/ "./node_modules/browserify-sign/browser/algorithms.json": -/*!**************************************************************!*\ - !*** ./node_modules/browserify-sign/browser/algorithms.json ***! - \**************************************************************/ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"sha224WithRSAEncryption":{"sign":"rsa","hash":"sha224","id":"302d300d06096086480165030402040500041c"},"RSA-SHA224":{"sign":"ecdsa/rsa","hash":"sha224","id":"302d300d06096086480165030402040500041c"},"sha256WithRSAEncryption":{"sign":"rsa","hash":"sha256","id":"3031300d060960864801650304020105000420"},"RSA-SHA256":{"sign":"ecdsa/rsa","hash":"sha256","id":"3031300d060960864801650304020105000420"},"sha384WithRSAEncryption":{"sign":"rsa","hash":"sha384","id":"3041300d060960864801650304020205000430"},"RSA-SHA384":{"sign":"ecdsa/rsa","hash":"sha384","id":"3041300d060960864801650304020205000430"},"sha512WithRSAEncryption":{"sign":"rsa","hash":"sha512","id":"3051300d060960864801650304020305000440"},"RSA-SHA512":{"sign":"ecdsa/rsa","hash":"sha512","id":"3051300d060960864801650304020305000440"},"RSA-SHA1":{"sign":"rsa","hash":"sha1","id":"3021300906052b0e03021a05000414"},"ecdsa-with-SHA1":{"sign":"ecdsa","hash":"sha1","id":""},"sha256":{"sign":"ecdsa","hash":"sha256","id":""},"sha224":{"sign":"ecdsa","hash":"sha224","id":""},"sha384":{"sign":"ecdsa","hash":"sha384","id":""},"sha512":{"sign":"ecdsa","hash":"sha512","id":""},"DSA-SHA":{"sign":"dsa","hash":"sha1","id":""},"DSA-SHA1":{"sign":"dsa","hash":"sha1","id":""},"DSA":{"sign":"dsa","hash":"sha1","id":""},"DSA-WITH-SHA224":{"sign":"dsa","hash":"sha224","id":""},"DSA-SHA224":{"sign":"dsa","hash":"sha224","id":""},"DSA-WITH-SHA256":{"sign":"dsa","hash":"sha256","id":""},"DSA-SHA256":{"sign":"dsa","hash":"sha256","id":""},"DSA-WITH-SHA384":{"sign":"dsa","hash":"sha384","id":""},"DSA-SHA384":{"sign":"dsa","hash":"sha384","id":""},"DSA-WITH-SHA512":{"sign":"dsa","hash":"sha512","id":""},"DSA-SHA512":{"sign":"dsa","hash":"sha512","id":""},"DSA-RIPEMD160":{"sign":"dsa","hash":"rmd160","id":""},"ripemd160WithRSA":{"sign":"rsa","hash":"rmd160","id":"3021300906052b2403020105000414"},"RSA-RIPEMD160":{"sign":"rsa","hash":"rmd160","id":"3021300906052b2403020105000414"},"md5WithRSAEncryption":{"sign":"rsa","hash":"md5","id":"3020300c06082a864886f70d020505000410"},"RSA-MD5":{"sign":"rsa","hash":"md5","id":"3020300c06082a864886f70d020505000410"}}'); - -/***/ }), - -/***/ "./node_modules/browserify-sign/browser/curves.json": -/*!**********************************************************!*\ - !*** ./node_modules/browserify-sign/browser/curves.json ***! - \**********************************************************/ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"1.3.132.0.10":"secp256k1","1.3.132.0.33":"p224","1.2.840.10045.3.1.1":"p192","1.2.840.10045.3.1.7":"p256","1.3.132.0.34":"p384","1.3.132.0.35":"p521"}'); - -/***/ }), - -/***/ "./node_modules/browserify-sign/browser/index.js": -/*!*******************************************************!*\ - !*** ./node_modules/browserify-sign/browser/index.js ***! - \*******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var createHash = __webpack_require__(/*! create-hash */ "./node_modules/create-hash/browser.js") -var stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var sign = __webpack_require__(/*! ./sign */ "./node_modules/browserify-sign/browser/sign.js") -var verify = __webpack_require__(/*! ./verify */ "./node_modules/browserify-sign/browser/verify.js") - -var algorithms = __webpack_require__(/*! ./algorithms.json */ "./node_modules/browserify-sign/browser/algorithms.json") -Object.keys(algorithms).forEach(function (key) { - algorithms[key].id = Buffer.from(algorithms[key].id, 'hex') - algorithms[key.toLowerCase()] = algorithms[key] -}) - -function Sign (algorithm) { - stream.Writable.call(this) - - var data = algorithms[algorithm] - if (!data) throw new Error('Unknown message digest') - - this._hashType = data.hash - this._hash = createHash(data.hash) - this._tag = data.id - this._signType = data.sign -} -inherits(Sign, stream.Writable) - -Sign.prototype._write = function _write (data, _, done) { - this._hash.update(data) - done() -} - -Sign.prototype.update = function update (data, enc) { - if (typeof data === 'string') data = Buffer.from(data, enc) - - this._hash.update(data) - return this -} - -Sign.prototype.sign = function signMethod (key, enc) { - this.end() - var hash = this._hash.digest() - var sig = sign(hash, key, this._hashType, this._signType, this._tag) - - return enc ? sig.toString(enc) : sig -} - -function Verify (algorithm) { - stream.Writable.call(this) - - var data = algorithms[algorithm] - if (!data) throw new Error('Unknown message digest') - - this._hash = createHash(data.hash) - this._tag = data.id - this._signType = data.sign -} -inherits(Verify, stream.Writable) - -Verify.prototype._write = function _write (data, _, done) { - this._hash.update(data) - done() -} - -Verify.prototype.update = function update (data, enc) { - if (typeof data === 'string') data = Buffer.from(data, enc) - - this._hash.update(data) - return this -} - -Verify.prototype.verify = function verifyMethod (key, sig, enc) { - if (typeof sig === 'string') sig = Buffer.from(sig, enc) - - this.end() - var hash = this._hash.digest() - return verify(sig, hash, key, this._signType, this._tag) -} - -function createSign (algorithm) { - return new Sign(algorithm) -} - -function createVerify (algorithm) { - return new Verify(algorithm) -} - -module.exports = { - Sign: createSign, - Verify: createVerify, - createSign: createSign, - createVerify: createVerify -} - - -/***/ }), - -/***/ "./node_modules/browserify-sign/browser/sign.js": -/*!******************************************************!*\ - !*** ./node_modules/browserify-sign/browser/sign.js ***! - \******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var createHmac = __webpack_require__(/*! create-hmac */ "./node_modules/create-hmac/browser.js") -var crt = __webpack_require__(/*! browserify-rsa */ "./node_modules/browserify-rsa/index.js") -var EC = __webpack_require__(/*! elliptic */ "./node_modules/elliptic/lib/elliptic.js").ec -var BN = __webpack_require__(/*! bn.js */ "./node_modules/bn.js/lib/bn.js") -var parseKeys = __webpack_require__(/*! parse-asn1 */ "./node_modules/parse-asn1/index.js") -var curves = __webpack_require__(/*! ./curves.json */ "./node_modules/browserify-sign/browser/curves.json") - -function sign (hash, key, hashType, signType, tag) { - var priv = parseKeys(key) - if (priv.curve) { - // rsa keys can be interpreted as ecdsa ones in openssl - if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type') - return ecSign(hash, priv) - } else if (priv.type === 'dsa') { - if (signType !== 'dsa') throw new Error('wrong private key type') - return dsaSign(hash, priv, hashType) - } else { - if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type') - } - hash = Buffer.concat([tag, hash]) - var len = priv.modulus.byteLength() - var pad = [0, 1] - while (hash.length + pad.length + 1 < len) pad.push(0xff) - pad.push(0x00) - var i = -1 - while (++i < hash.length) pad.push(hash[i]) - - var out = crt(pad, priv) - return out -} - -function ecSign (hash, priv) { - var curveId = curves[priv.curve.join('.')] - if (!curveId) throw new Error('unknown curve ' + priv.curve.join('.')) - - var curve = new EC(curveId) - var key = curve.keyFromPrivate(priv.privateKey) - var out = key.sign(hash) - - return Buffer.from(out.toDER()) -} - -function dsaSign (hash, priv, algo) { - var x = priv.params.priv_key - var p = priv.params.p - var q = priv.params.q - var g = priv.params.g - var r = new BN(0) - var k - var H = bits2int(hash, q).mod(q) - var s = false - var kv = getKey(x, q, hash, algo) - while (s === false) { - k = makeKey(q, kv, algo) - r = makeR(g, k, p, q) - s = k.invm(q).imul(H.add(x.mul(r))).mod(q) - if (s.cmpn(0) === 0) { - s = false - r = new BN(0) - } - } - return toDER(r, s) -} - -function toDER (r, s) { - r = r.toArray() - s = s.toArray() - - // Pad values - if (r[0] & 0x80) r = [0].concat(r) - if (s[0] & 0x80) s = [0].concat(s) - - var total = r.length + s.length + 4 - var res = [0x30, total, 0x02, r.length] - res = res.concat(r, [0x02, s.length], s) - return Buffer.from(res) -} - -function getKey (x, q, hash, algo) { - x = Buffer.from(x.toArray()) - if (x.length < q.byteLength()) { - var zeros = Buffer.alloc(q.byteLength() - x.length) - x = Buffer.concat([zeros, x]) - } - var hlen = hash.length - var hbits = bits2octets(hash, q) - var v = Buffer.alloc(hlen) - v.fill(1) - var k = Buffer.alloc(hlen) - k = createHmac(algo, k).update(v).update(Buffer.from([0])).update(x).update(hbits).digest() - v = createHmac(algo, k).update(v).digest() - k = createHmac(algo, k).update(v).update(Buffer.from([1])).update(x).update(hbits).digest() - v = createHmac(algo, k).update(v).digest() - return { k: k, v: v } -} - -function bits2int (obits, q) { - var bits = new BN(obits) - var shift = (obits.length << 3) - q.bitLength() - if (shift > 0) bits.ishrn(shift) - return bits -} - -function bits2octets (bits, q) { - bits = bits2int(bits, q) - bits = bits.mod(q) - var out = Buffer.from(bits.toArray()) - if (out.length < q.byteLength()) { - var zeros = Buffer.alloc(q.byteLength() - out.length) - out = Buffer.concat([zeros, out]) - } - return out -} - -function makeKey (q, kv, algo) { - var t - var k - - do { - t = Buffer.alloc(0) - - while (t.length * 8 < q.bitLength()) { - kv.v = createHmac(algo, kv.k).update(kv.v).digest() - t = Buffer.concat([t, kv.v]) - } - - k = bits2int(t, q) - kv.k = createHmac(algo, kv.k).update(kv.v).update(Buffer.from([0])).digest() - kv.v = createHmac(algo, kv.k).update(kv.v).digest() - } while (k.cmp(q) !== -1) - - return k -} - -function makeR (g, k, p, q) { - return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q) -} - -module.exports = sign -module.exports.getKey = getKey -module.exports.makeKey = makeKey - - -/***/ }), - -/***/ "./node_modules/browserify-sign/browser/verify.js": -/*!********************************************************!*\ - !*** ./node_modules/browserify-sign/browser/verify.js ***! - \********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var BN = __webpack_require__(/*! bn.js */ "./node_modules/bn.js/lib/bn.js") -var EC = __webpack_require__(/*! elliptic */ "./node_modules/elliptic/lib/elliptic.js").ec -var parseKeys = __webpack_require__(/*! parse-asn1 */ "./node_modules/parse-asn1/index.js") -var curves = __webpack_require__(/*! ./curves.json */ "./node_modules/browserify-sign/browser/curves.json") - -function verify (sig, hash, key, signType, tag) { - var pub = parseKeys(key) - if (pub.type === 'ec') { - // rsa keys can be interpreted as ecdsa ones in openssl - if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type') - return ecVerify(sig, hash, pub) - } else if (pub.type === 'dsa') { - if (signType !== 'dsa') throw new Error('wrong public key type') - return dsaVerify(sig, hash, pub) - } else { - if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type') - } - hash = Buffer.concat([tag, hash]) - var len = pub.modulus.byteLength() - var pad = [1] - var padNum = 0 - while (hash.length + pad.length + 2 < len) { - pad.push(0xff) - padNum++ - } - pad.push(0x00) - var i = -1 - while (++i < hash.length) { - pad.push(hash[i]) - } - pad = Buffer.from(pad) - var red = BN.mont(pub.modulus) - sig = new BN(sig).toRed(red) - - sig = sig.redPow(new BN(pub.publicExponent)) - sig = Buffer.from(sig.fromRed().toArray()) - var out = padNum < 8 ? 1 : 0 - len = Math.min(sig.length, pad.length) - if (sig.length !== pad.length) out = 1 - - i = -1 - while (++i < len) out |= sig[i] ^ pad[i] - return out === 0 -} - -function ecVerify (sig, hash, pub) { - var curveId = curves[pub.data.algorithm.curve.join('.')] - if (!curveId) throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.')) - - var curve = new EC(curveId) - var pubkey = pub.data.subjectPrivateKey.data - - return curve.verify(hash, sig, pubkey) -} - -function dsaVerify (sig, hash, pub) { - var p = pub.data.p - var q = pub.data.q - var g = pub.data.g - var y = pub.data.pub_key - var unpacked = parseKeys.signature.decode(sig, 'der') - var s = unpacked.s - var r = unpacked.r - checkValue(s, q) - checkValue(r, q) - var montp = BN.mont(p) - var w = s.invm(q) - var v = g.toRed(montp) - .redPow(new BN(hash).mul(w).mod(q)) - .fromRed() - .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed()) - .mod(p) - .mod(q) - return v.cmp(r) === 0 -} - -function checkValue (b, q) { - if (b.cmpn(0) <= 0) throw new Error('invalid sig') - if (b.cmp(q) >= q) throw new Error('invalid sig') -} - -module.exports = verify - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/lib/binding.js": -/*!*****************************************************!*\ - !*** ./node_modules/browserify-zlib/lib/binding.js ***! - \*****************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); - -/* eslint camelcase: "off" */ - -var assert = __webpack_require__(/*! assert */ "./node_modules/assert/build/assert.js"); - -var Zstream = __webpack_require__(/*! pako/lib/zlib/zstream */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/zstream.js"); -var zlib_deflate = __webpack_require__(/*! pako/lib/zlib/deflate.js */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/deflate.js"); -var zlib_inflate = __webpack_require__(/*! pako/lib/zlib/inflate.js */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inflate.js"); -var constants = __webpack_require__(/*! pako/lib/zlib/constants */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/constants.js"); - -for (var key in constants) { - exports[key] = constants[key]; -} - -// zlib modes -exports.NONE = 0; -exports.DEFLATE = 1; -exports.INFLATE = 2; -exports.GZIP = 3; -exports.GUNZIP = 4; -exports.DEFLATERAW = 5; -exports.INFLATERAW = 6; -exports.UNZIP = 7; - -var GZIP_HEADER_ID1 = 0x1f; -var GZIP_HEADER_ID2 = 0x8b; - -/** - * Emulate Node's zlib C++ layer for use by the JS layer in index.js - */ -function Zlib(mode) { - if (typeof mode !== 'number' || mode < exports.DEFLATE || mode > exports.UNZIP) { - throw new TypeError('Bad argument'); - } - - this.dictionary = null; - this.err = 0; - this.flush = 0; - this.init_done = false; - this.level = 0; - this.memLevel = 0; - this.mode = mode; - this.strategy = 0; - this.windowBits = 0; - this.write_in_progress = false; - this.pending_close = false; - this.gzip_id_bytes_read = 0; -} - -Zlib.prototype.close = function () { - if (this.write_in_progress) { - this.pending_close = true; - return; - } - - this.pending_close = false; - - assert(this.init_done, 'close before init'); - assert(this.mode <= exports.UNZIP); - - if (this.mode === exports.DEFLATE || this.mode === exports.GZIP || this.mode === exports.DEFLATERAW) { - zlib_deflate.deflateEnd(this.strm); - } else if (this.mode === exports.INFLATE || this.mode === exports.GUNZIP || this.mode === exports.INFLATERAW || this.mode === exports.UNZIP) { - zlib_inflate.inflateEnd(this.strm); - } - - this.mode = exports.NONE; - - this.dictionary = null; -}; - -Zlib.prototype.write = function (flush, input, in_off, in_len, out, out_off, out_len) { - return this._write(true, flush, input, in_off, in_len, out, out_off, out_len); -}; - -Zlib.prototype.writeSync = function (flush, input, in_off, in_len, out, out_off, out_len) { - return this._write(false, flush, input, in_off, in_len, out, out_off, out_len); -}; - -Zlib.prototype._write = function (async, flush, input, in_off, in_len, out, out_off, out_len) { - assert.equal(arguments.length, 8); - - assert(this.init_done, 'write before init'); - assert(this.mode !== exports.NONE, 'already finalized'); - assert.equal(false, this.write_in_progress, 'write already in progress'); - assert.equal(false, this.pending_close, 'close is pending'); - - this.write_in_progress = true; - - assert.equal(false, flush === undefined, 'must provide flush value'); - - this.write_in_progress = true; - - if (flush !== exports.Z_NO_FLUSH && flush !== exports.Z_PARTIAL_FLUSH && flush !== exports.Z_SYNC_FLUSH && flush !== exports.Z_FULL_FLUSH && flush !== exports.Z_FINISH && flush !== exports.Z_BLOCK) { - throw new Error('Invalid flush value'); - } - - if (input == null) { - input = Buffer.alloc(0); - in_len = 0; - in_off = 0; - } - - this.strm.avail_in = in_len; - this.strm.input = input; - this.strm.next_in = in_off; - this.strm.avail_out = out_len; - this.strm.output = out; - this.strm.next_out = out_off; - this.flush = flush; - - if (!async) { - // sync version - this._process(); - - if (this._checkError()) { - return this._afterSync(); - } - return; - } - - // async version - var self = this; - process.nextTick(function () { - self._process(); - self._after(); - }); - - return this; -}; - -Zlib.prototype._afterSync = function () { - var avail_out = this.strm.avail_out; - var avail_in = this.strm.avail_in; - - this.write_in_progress = false; - - return [avail_in, avail_out]; -}; - -Zlib.prototype._process = function () { - var next_expected_header_byte = null; - - // If the avail_out is left at 0, then it means that it ran out - // of room. If there was avail_out left over, then it means - // that all of the input was consumed. - switch (this.mode) { - case exports.DEFLATE: - case exports.GZIP: - case exports.DEFLATERAW: - this.err = zlib_deflate.deflate(this.strm, this.flush); - break; - case exports.UNZIP: - if (this.strm.avail_in > 0) { - next_expected_header_byte = this.strm.next_in; - } - - switch (this.gzip_id_bytes_read) { - case 0: - if (next_expected_header_byte === null) { - break; - } - - if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID1) { - this.gzip_id_bytes_read = 1; - next_expected_header_byte++; - - if (this.strm.avail_in === 1) { - // The only available byte was already read. - break; - } - } else { - this.mode = exports.INFLATE; - break; - } - - // fallthrough - case 1: - if (next_expected_header_byte === null) { - break; - } - - if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID2) { - this.gzip_id_bytes_read = 2; - this.mode = exports.GUNZIP; - } else { - // There is no actual difference between INFLATE and INFLATERAW - // (after initialization). - this.mode = exports.INFLATE; - } - - break; - default: - throw new Error('invalid number of gzip magic number bytes read'); - } - - // fallthrough - case exports.INFLATE: - case exports.GUNZIP: - case exports.INFLATERAW: - this.err = zlib_inflate.inflate(this.strm, this.flush - - // If data was encoded with dictionary - );if (this.err === exports.Z_NEED_DICT && this.dictionary) { - // Load it - this.err = zlib_inflate.inflateSetDictionary(this.strm, this.dictionary); - if (this.err === exports.Z_OK) { - // And try to decode again - this.err = zlib_inflate.inflate(this.strm, this.flush); - } else if (this.err === exports.Z_DATA_ERROR) { - // Both inflateSetDictionary() and inflate() return Z_DATA_ERROR. - // Make it possible for After() to tell a bad dictionary from bad - // input. - this.err = exports.Z_NEED_DICT; - } - } - while (this.strm.avail_in > 0 && this.mode === exports.GUNZIP && this.err === exports.Z_STREAM_END && this.strm.next_in[0] !== 0x00) { - // Bytes remain in input buffer. Perhaps this is another compressed - // member in the same archive, or just trailing garbage. - // Trailing zero bytes are okay, though, since they are frequently - // used for padding. - - this.reset(); - this.err = zlib_inflate.inflate(this.strm, this.flush); - } - break; - default: - throw new Error('Unknown mode ' + this.mode); - } -}; - -Zlib.prototype._checkError = function () { - // Acceptable error states depend on the type of zlib stream. - switch (this.err) { - case exports.Z_OK: - case exports.Z_BUF_ERROR: - if (this.strm.avail_out !== 0 && this.flush === exports.Z_FINISH) { - this._error('unexpected end of file'); - return false; - } - break; - case exports.Z_STREAM_END: - // normal statuses, not fatal - break; - case exports.Z_NEED_DICT: - if (this.dictionary == null) { - this._error('Missing dictionary'); - } else { - this._error('Bad dictionary'); - } - return false; - default: - // something else. - this._error('Zlib error'); - return false; - } - - return true; -}; - -Zlib.prototype._after = function () { - if (!this._checkError()) { - return; - } - - var avail_out = this.strm.avail_out; - var avail_in = this.strm.avail_in; - - this.write_in_progress = false; - - // call the write() cb - this.callback(avail_in, avail_out); - - if (this.pending_close) { - this.close(); - } -}; - -Zlib.prototype._error = function (message) { - if (this.strm.msg) { - message = this.strm.msg; - } - this.onerror(message, this.err - - // no hope of rescue. - );this.write_in_progress = false; - if (this.pending_close) { - this.close(); - } -}; - -Zlib.prototype.init = function (windowBits, level, memLevel, strategy, dictionary) { - assert(arguments.length === 4 || arguments.length === 5, 'init(windowBits, level, memLevel, strategy, [dictionary])'); - - assert(windowBits >= 8 && windowBits <= 15, 'invalid windowBits'); - assert(level >= -1 && level <= 9, 'invalid compression level'); - - assert(memLevel >= 1 && memLevel <= 9, 'invalid memlevel'); - - assert(strategy === exports.Z_FILTERED || strategy === exports.Z_HUFFMAN_ONLY || strategy === exports.Z_RLE || strategy === exports.Z_FIXED || strategy === exports.Z_DEFAULT_STRATEGY, 'invalid strategy'); - - this._init(level, windowBits, memLevel, strategy, dictionary); - this._setDictionary(); -}; - -Zlib.prototype.params = function () { - throw new Error('deflateParams Not supported'); -}; - -Zlib.prototype.reset = function () { - this._reset(); - this._setDictionary(); -}; - -Zlib.prototype._init = function (level, windowBits, memLevel, strategy, dictionary) { - this.level = level; - this.windowBits = windowBits; - this.memLevel = memLevel; - this.strategy = strategy; - - this.flush = exports.Z_NO_FLUSH; - - this.err = exports.Z_OK; - - if (this.mode === exports.GZIP || this.mode === exports.GUNZIP) { - this.windowBits += 16; - } - - if (this.mode === exports.UNZIP) { - this.windowBits += 32; - } - - if (this.mode === exports.DEFLATERAW || this.mode === exports.INFLATERAW) { - this.windowBits = -1 * this.windowBits; - } - - this.strm = new Zstream(); - - switch (this.mode) { - case exports.DEFLATE: - case exports.GZIP: - case exports.DEFLATERAW: - this.err = zlib_deflate.deflateInit2(this.strm, this.level, exports.Z_DEFLATED, this.windowBits, this.memLevel, this.strategy); - break; - case exports.INFLATE: - case exports.GUNZIP: - case exports.INFLATERAW: - case exports.UNZIP: - this.err = zlib_inflate.inflateInit2(this.strm, this.windowBits); - break; - default: - throw new Error('Unknown mode ' + this.mode); - } - - if (this.err !== exports.Z_OK) { - this._error('Init error'); - } - - this.dictionary = dictionary; - - this.write_in_progress = false; - this.init_done = true; -}; - -Zlib.prototype._setDictionary = function () { - if (this.dictionary == null) { - return; - } - - this.err = exports.Z_OK; - - switch (this.mode) { - case exports.DEFLATE: - case exports.DEFLATERAW: - this.err = zlib_deflate.deflateSetDictionary(this.strm, this.dictionary); - break; - default: - break; - } - - if (this.err !== exports.Z_OK) { - this._error('Failed to set dictionary'); - } -}; - -Zlib.prototype._reset = function () { - this.err = exports.Z_OK; - - switch (this.mode) { - case exports.DEFLATE: - case exports.DEFLATERAW: - case exports.GZIP: - this.err = zlib_deflate.deflateReset(this.strm); - break; - case exports.INFLATE: - case exports.INFLATERAW: - case exports.GUNZIP: - this.err = zlib_inflate.inflateReset(this.strm); - break; - default: - break; - } - - if (this.err !== exports.Z_OK) { - this._error('Failed to reset stream'); - } -}; - -exports.Zlib = Zlib; - -/***/ }), - -/***/ "./node_modules/browserify-zlib/lib/index.js": -/*!***************************************************!*\ - !*** ./node_modules/browserify-zlib/lib/index.js ***! - \***************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); - - -var Buffer = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js").Buffer; -var Transform = __webpack_require__(/*! stream */ "./node_modules/stream-browserify/index.js").Transform; -var binding = __webpack_require__(/*! ./binding */ "./node_modules/browserify-zlib/lib/binding.js"); -var util = __webpack_require__(/*! util */ "./node_modules/util/util.js"); -var assert = __webpack_require__(/*! assert */ "./node_modules/assert/build/assert.js").ok; -var kMaxLength = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js").kMaxLength; -var kRangeErrorMessage = 'Cannot create final Buffer. It would be larger ' + 'than 0x' + kMaxLength.toString(16) + ' bytes'; - -// zlib doesn't provide these, so kludge them in following the same -// const naming scheme zlib uses. -binding.Z_MIN_WINDOWBITS = 8; -binding.Z_MAX_WINDOWBITS = 15; -binding.Z_DEFAULT_WINDOWBITS = 15; - -// fewer than 64 bytes per chunk is stupid. -// technically it could work with as few as 8, but even 64 bytes -// is absurdly low. Usually a MB or more is best. -binding.Z_MIN_CHUNK = 64; -binding.Z_MAX_CHUNK = Infinity; -binding.Z_DEFAULT_CHUNK = 16 * 1024; - -binding.Z_MIN_MEMLEVEL = 1; -binding.Z_MAX_MEMLEVEL = 9; -binding.Z_DEFAULT_MEMLEVEL = 8; - -binding.Z_MIN_LEVEL = -1; -binding.Z_MAX_LEVEL = 9; -binding.Z_DEFAULT_LEVEL = binding.Z_DEFAULT_COMPRESSION; - -// expose all the zlib constants -var bkeys = Object.keys(binding); -for (var bk = 0; bk < bkeys.length; bk++) { - var bkey = bkeys[bk]; - if (bkey.match(/^Z/)) { - Object.defineProperty(exports, bkey, { - enumerable: true, value: binding[bkey], writable: false - }); - } -} - -// translation table for return codes. -var codes = { - Z_OK: binding.Z_OK, - Z_STREAM_END: binding.Z_STREAM_END, - Z_NEED_DICT: binding.Z_NEED_DICT, - Z_ERRNO: binding.Z_ERRNO, - Z_STREAM_ERROR: binding.Z_STREAM_ERROR, - Z_DATA_ERROR: binding.Z_DATA_ERROR, - Z_MEM_ERROR: binding.Z_MEM_ERROR, - Z_BUF_ERROR: binding.Z_BUF_ERROR, - Z_VERSION_ERROR: binding.Z_VERSION_ERROR -}; - -var ckeys = Object.keys(codes); -for (var ck = 0; ck < ckeys.length; ck++) { - var ckey = ckeys[ck]; - codes[codes[ckey]] = ckey; -} - -Object.defineProperty(exports, "codes", ({ - enumerable: true, value: Object.freeze(codes), writable: false -})); - -exports.Deflate = Deflate; -exports.Inflate = Inflate; -exports.Gzip = Gzip; -exports.Gunzip = Gunzip; -exports.DeflateRaw = DeflateRaw; -exports.InflateRaw = InflateRaw; -exports.Unzip = Unzip; - -exports.createDeflate = function (o) { - return new Deflate(o); -}; - -exports.createInflate = function (o) { - return new Inflate(o); -}; - -exports.createDeflateRaw = function (o) { - return new DeflateRaw(o); -}; - -exports.createInflateRaw = function (o) { - return new InflateRaw(o); -}; - -exports.createGzip = function (o) { - return new Gzip(o); -}; - -exports.createGunzip = function (o) { - return new Gunzip(o); -}; - -exports.createUnzip = function (o) { - return new Unzip(o); -}; - -// Convenience methods. -// compress/decompress a string or buffer in one step. -exports.deflate = function (buffer, opts, callback) { - if (typeof opts === 'function') { - callback = opts; - opts = {}; - } - return zlibBuffer(new Deflate(opts), buffer, callback); -}; - -exports.deflateSync = function (buffer, opts) { - return zlibBufferSync(new Deflate(opts), buffer); -}; - -exports.gzip = function (buffer, opts, callback) { - if (typeof opts === 'function') { - callback = opts; - opts = {}; - } - return zlibBuffer(new Gzip(opts), buffer, callback); -}; - -exports.gzipSync = function (buffer, opts) { - return zlibBufferSync(new Gzip(opts), buffer); -}; - -exports.deflateRaw = function (buffer, opts, callback) { - if (typeof opts === 'function') { - callback = opts; - opts = {}; - } - return zlibBuffer(new DeflateRaw(opts), buffer, callback); -}; - -exports.deflateRawSync = function (buffer, opts) { - return zlibBufferSync(new DeflateRaw(opts), buffer); -}; - -exports.unzip = function (buffer, opts, callback) { - if (typeof opts === 'function') { - callback = opts; - opts = {}; - } - return zlibBuffer(new Unzip(opts), buffer, callback); -}; - -exports.unzipSync = function (buffer, opts) { - return zlibBufferSync(new Unzip(opts), buffer); -}; - -exports.inflate = function (buffer, opts, callback) { - if (typeof opts === 'function') { - callback = opts; - opts = {}; - } - return zlibBuffer(new Inflate(opts), buffer, callback); -}; - -exports.inflateSync = function (buffer, opts) { - return zlibBufferSync(new Inflate(opts), buffer); -}; - -exports.gunzip = function (buffer, opts, callback) { - if (typeof opts === 'function') { - callback = opts; - opts = {}; - } - return zlibBuffer(new Gunzip(opts), buffer, callback); -}; - -exports.gunzipSync = function (buffer, opts) { - return zlibBufferSync(new Gunzip(opts), buffer); -}; - -exports.inflateRaw = function (buffer, opts, callback) { - if (typeof opts === 'function') { - callback = opts; - opts = {}; - } - return zlibBuffer(new InflateRaw(opts), buffer, callback); -}; - -exports.inflateRawSync = function (buffer, opts) { - return zlibBufferSync(new InflateRaw(opts), buffer); -}; - -function zlibBuffer(engine, buffer, callback) { - var buffers = []; - var nread = 0; - - engine.on('error', onError); - engine.on('end', onEnd); - - engine.end(buffer); - flow(); - - function flow() { - var chunk; - while (null !== (chunk = engine.read())) { - buffers.push(chunk); - nread += chunk.length; - } - engine.once('readable', flow); - } - - function onError(err) { - engine.removeListener('end', onEnd); - engine.removeListener('readable', flow); - callback(err); - } - - function onEnd() { - var buf; - var err = null; - - if (nread >= kMaxLength) { - err = new RangeError(kRangeErrorMessage); - } else { - buf = Buffer.concat(buffers, nread); - } - - buffers = []; - engine.close(); - callback(err, buf); - } -} - -function zlibBufferSync(engine, buffer) { - if (typeof buffer === 'string') buffer = Buffer.from(buffer); - - if (!Buffer.isBuffer(buffer)) throw new TypeError('Not a string or buffer'); - - var flushFlag = engine._finishFlushFlag; - - return engine._processChunk(buffer, flushFlag); -} - -// generic zlib -// minimal 2-byte header -function Deflate(opts) { - if (!(this instanceof Deflate)) return new Deflate(opts); - Zlib.call(this, opts, binding.DEFLATE); -} - -function Inflate(opts) { - if (!(this instanceof Inflate)) return new Inflate(opts); - Zlib.call(this, opts, binding.INFLATE); -} - -// gzip - bigger header, same deflate compression -function Gzip(opts) { - if (!(this instanceof Gzip)) return new Gzip(opts); - Zlib.call(this, opts, binding.GZIP); -} - -function Gunzip(opts) { - if (!(this instanceof Gunzip)) return new Gunzip(opts); - Zlib.call(this, opts, binding.GUNZIP); -} - -// raw - no header -function DeflateRaw(opts) { - if (!(this instanceof DeflateRaw)) return new DeflateRaw(opts); - Zlib.call(this, opts, binding.DEFLATERAW); -} - -function InflateRaw(opts) { - if (!(this instanceof InflateRaw)) return new InflateRaw(opts); - Zlib.call(this, opts, binding.INFLATERAW); -} - -// auto-detect header. -function Unzip(opts) { - if (!(this instanceof Unzip)) return new Unzip(opts); - Zlib.call(this, opts, binding.UNZIP); -} - -function isValidFlushFlag(flag) { - return flag === binding.Z_NO_FLUSH || flag === binding.Z_PARTIAL_FLUSH || flag === binding.Z_SYNC_FLUSH || flag === binding.Z_FULL_FLUSH || flag === binding.Z_FINISH || flag === binding.Z_BLOCK; -} - -// the Zlib class they all inherit from -// This thing manages the queue of requests, and returns -// true or false if there is anything in the queue when -// you call the .write() method. - -function Zlib(opts, mode) { - var _this = this; - - this._opts = opts = opts || {}; - this._chunkSize = opts.chunkSize || exports.Z_DEFAULT_CHUNK; - - Transform.call(this, opts); - - if (opts.flush && !isValidFlushFlag(opts.flush)) { - throw new Error('Invalid flush flag: ' + opts.flush); - } - if (opts.finishFlush && !isValidFlushFlag(opts.finishFlush)) { - throw new Error('Invalid flush flag: ' + opts.finishFlush); - } - - this._flushFlag = opts.flush || binding.Z_NO_FLUSH; - this._finishFlushFlag = typeof opts.finishFlush !== 'undefined' ? opts.finishFlush : binding.Z_FINISH; - - if (opts.chunkSize) { - if (opts.chunkSize < exports.Z_MIN_CHUNK || opts.chunkSize > exports.Z_MAX_CHUNK) { - throw new Error('Invalid chunk size: ' + opts.chunkSize); - } - } - - if (opts.windowBits) { - if (opts.windowBits < exports.Z_MIN_WINDOWBITS || opts.windowBits > exports.Z_MAX_WINDOWBITS) { - throw new Error('Invalid windowBits: ' + opts.windowBits); - } - } - - if (opts.level) { - if (opts.level < exports.Z_MIN_LEVEL || opts.level > exports.Z_MAX_LEVEL) { - throw new Error('Invalid compression level: ' + opts.level); - } - } - - if (opts.memLevel) { - if (opts.memLevel < exports.Z_MIN_MEMLEVEL || opts.memLevel > exports.Z_MAX_MEMLEVEL) { - throw new Error('Invalid memLevel: ' + opts.memLevel); - } - } - - if (opts.strategy) { - if (opts.strategy != exports.Z_FILTERED && opts.strategy != exports.Z_HUFFMAN_ONLY && opts.strategy != exports.Z_RLE && opts.strategy != exports.Z_FIXED && opts.strategy != exports.Z_DEFAULT_STRATEGY) { - throw new Error('Invalid strategy: ' + opts.strategy); - } - } - - if (opts.dictionary) { - if (!Buffer.isBuffer(opts.dictionary)) { - throw new Error('Invalid dictionary: it should be a Buffer instance'); - } - } - - this._handle = new binding.Zlib(mode); - - var self = this; - this._hadError = false; - this._handle.onerror = function (message, errno) { - // there is no way to cleanly recover. - // continuing only obscures problems. - _close(self); - self._hadError = true; - - var error = new Error(message); - error.errno = errno; - error.code = exports.codes[errno]; - self.emit('error', error); - }; - - var level = exports.Z_DEFAULT_COMPRESSION; - if (typeof opts.level === 'number') level = opts.level; - - var strategy = exports.Z_DEFAULT_STRATEGY; - if (typeof opts.strategy === 'number') strategy = opts.strategy; - - this._handle.init(opts.windowBits || exports.Z_DEFAULT_WINDOWBITS, level, opts.memLevel || exports.Z_DEFAULT_MEMLEVEL, strategy, opts.dictionary); - - this._buffer = Buffer.allocUnsafe(this._chunkSize); - this._offset = 0; - this._level = level; - this._strategy = strategy; - - this.once('end', this.close); - - Object.defineProperty(this, '_closed', { - get: function () { - return !_this._handle; - }, - configurable: true, - enumerable: true - }); -} - -util.inherits(Zlib, Transform); - -Zlib.prototype.params = function (level, strategy, callback) { - if (level < exports.Z_MIN_LEVEL || level > exports.Z_MAX_LEVEL) { - throw new RangeError('Invalid compression level: ' + level); - } - if (strategy != exports.Z_FILTERED && strategy != exports.Z_HUFFMAN_ONLY && strategy != exports.Z_RLE && strategy != exports.Z_FIXED && strategy != exports.Z_DEFAULT_STRATEGY) { - throw new TypeError('Invalid strategy: ' + strategy); - } - - if (this._level !== level || this._strategy !== strategy) { - var self = this; - this.flush(binding.Z_SYNC_FLUSH, function () { - assert(self._handle, 'zlib binding closed'); - self._handle.params(level, strategy); - if (!self._hadError) { - self._level = level; - self._strategy = strategy; - if (callback) callback(); - } - }); - } else { - process.nextTick(callback); - } -}; - -Zlib.prototype.reset = function () { - assert(this._handle, 'zlib binding closed'); - return this._handle.reset(); -}; - -// This is the _flush function called by the transform class, -// internally, when the last chunk has been written. -Zlib.prototype._flush = function (callback) { - this._transform(Buffer.alloc(0), '', callback); -}; - -Zlib.prototype.flush = function (kind, callback) { - var _this2 = this; - - var ws = this._writableState; - - if (typeof kind === 'function' || kind === undefined && !callback) { - callback = kind; - kind = binding.Z_FULL_FLUSH; - } - - if (ws.ended) { - if (callback) process.nextTick(callback); - } else if (ws.ending) { - if (callback) this.once('end', callback); - } else if (ws.needDrain) { - if (callback) { - this.once('drain', function () { - return _this2.flush(kind, callback); - }); - } - } else { - this._flushFlag = kind; - this.write(Buffer.alloc(0), '', callback); - } -}; - -Zlib.prototype.close = function (callback) { - _close(this, callback); - process.nextTick(emitCloseNT, this); -}; - -function _close(engine, callback) { - if (callback) process.nextTick(callback); - - // Caller may invoke .close after a zlib error (which will null _handle). - if (!engine._handle) return; - - engine._handle.close(); - engine._handle = null; -} - -function emitCloseNT(self) { - self.emit('close'); -} - -Zlib.prototype._transform = function (chunk, encoding, cb) { - var flushFlag; - var ws = this._writableState; - var ending = ws.ending || ws.ended; - var last = ending && (!chunk || ws.length === chunk.length); - - if (chunk !== null && !Buffer.isBuffer(chunk)) return cb(new Error('invalid input')); - - if (!this._handle) return cb(new Error('zlib binding closed')); - - // If it's the last chunk, or a final flush, we use the Z_FINISH flush flag - // (or whatever flag was provided using opts.finishFlush). - // If it's explicitly flushing at some other time, then we use - // Z_FULL_FLUSH. Otherwise, use Z_NO_FLUSH for maximum compression - // goodness. - if (last) flushFlag = this._finishFlushFlag;else { - flushFlag = this._flushFlag; - // once we've flushed the last of the queue, stop flushing and - // go back to the normal behavior. - if (chunk.length >= ws.length) { - this._flushFlag = this._opts.flush || binding.Z_NO_FLUSH; - } - } - - this._processChunk(chunk, flushFlag, cb); -}; - -Zlib.prototype._processChunk = function (chunk, flushFlag, cb) { - var availInBefore = chunk && chunk.length; - var availOutBefore = this._chunkSize - this._offset; - var inOff = 0; - - var self = this; - - var async = typeof cb === 'function'; - - if (!async) { - var buffers = []; - var nread = 0; - - var error; - this.on('error', function (er) { - error = er; - }); - - assert(this._handle, 'zlib binding closed'); - do { - var res = this._handle.writeSync(flushFlag, chunk, // in - inOff, // in_off - availInBefore, // in_len - this._buffer, // out - this._offset, //out_off - availOutBefore); // out_len - } while (!this._hadError && callback(res[0], res[1])); - - if (this._hadError) { - throw error; - } - - if (nread >= kMaxLength) { - _close(this); - throw new RangeError(kRangeErrorMessage); - } - - var buf = Buffer.concat(buffers, nread); - _close(this); - - return buf; - } - - assert(this._handle, 'zlib binding closed'); - var req = this._handle.write(flushFlag, chunk, // in - inOff, // in_off - availInBefore, // in_len - this._buffer, // out - this._offset, //out_off - availOutBefore); // out_len - - req.buffer = chunk; - req.callback = callback; - - function callback(availInAfter, availOutAfter) { - // When the callback is used in an async write, the callback's - // context is the `req` object that was created. The req object - // is === this._handle, and that's why it's important to null - // out the values after they are done being used. `this._handle` - // can stay in memory longer than the callback and buffer are needed. - if (this) { - this.buffer = null; - this.callback = null; - } - - if (self._hadError) return; - - var have = availOutBefore - availOutAfter; - assert(have >= 0, 'have should not go down'); - - if (have > 0) { - var out = self._buffer.slice(self._offset, self._offset + have); - self._offset += have; - // serve some output to the consumer. - if (async) { - self.push(out); - } else { - buffers.push(out); - nread += out.length; - } - } - - // exhausted the output buffer, or used all the input create a new one. - if (availOutAfter === 0 || self._offset >= self._chunkSize) { - availOutBefore = self._chunkSize; - self._offset = 0; - self._buffer = Buffer.allocUnsafe(self._chunkSize); - } - - if (availOutAfter === 0) { - // Not actually done. Need to reprocess. - // Also, update the availInBefore to the availInAfter value, - // so that if we have to hit it a third (fourth, etc.) time, - // it'll have the correct byte counts. - inOff += availInBefore - availInAfter; - availInBefore = availInAfter; - - if (!async) return true; - - var newReq = self._handle.write(flushFlag, chunk, inOff, availInBefore, self._buffer, self._offset, self._chunkSize); - newReq.callback = callback; // this same function - newReq.buffer = chunk; - return; - } - - if (!async) return false; - - // finished with the chunk. - cb(); - } -}; - -util.inherits(Deflate, Zlib); -util.inherits(Inflate, Zlib); -util.inherits(Gzip, Zlib); -util.inherits(Gunzip, Zlib); -util.inherits(DeflateRaw, Zlib); -util.inherits(InflateRaw, Zlib); -util.inherits(Unzip, Zlib); - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/utils/common.js": -/*!****************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/utils/common.js ***! - \****************************************************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - - -var TYPED_OK = (typeof Uint8Array !== 'undefined') && - (typeof Uint16Array !== 'undefined') && - (typeof Int32Array !== 'undefined'); - -function _has(obj, key) { - return Object.prototype.hasOwnProperty.call(obj, key); -} - -exports.assign = function (obj /*from1, from2, from3, ...*/) { - var sources = Array.prototype.slice.call(arguments, 1); - while (sources.length) { - var source = sources.shift(); - if (!source) { continue; } - - if (typeof source !== 'object') { - throw new TypeError(source + 'must be non-object'); - } - - for (var p in source) { - if (_has(source, p)) { - obj[p] = source[p]; - } - } - } - - return obj; -}; - - -// reduce buffer size, avoiding mem copy -exports.shrinkBuf = function (buf, size) { - if (buf.length === size) { return buf; } - if (buf.subarray) { return buf.subarray(0, size); } - buf.length = size; - return buf; -}; - - -var fnTyped = { - arraySet: function (dest, src, src_offs, len, dest_offs) { - if (src.subarray && dest.subarray) { - dest.set(src.subarray(src_offs, src_offs + len), dest_offs); - return; - } - // Fallback to ordinary array - for (var i = 0; i < len; i++) { - dest[dest_offs + i] = src[src_offs + i]; - } - }, - // Join array of chunks to single array. - flattenChunks: function (chunks) { - var i, l, len, pos, chunk, result; - - // calculate data length - len = 0; - for (i = 0, l = chunks.length; i < l; i++) { - len += chunks[i].length; - } - - // join chunks - result = new Uint8Array(len); - pos = 0; - for (i = 0, l = chunks.length; i < l; i++) { - chunk = chunks[i]; - result.set(chunk, pos); - pos += chunk.length; - } - - return result; - } -}; - -var fnUntyped = { - arraySet: function (dest, src, src_offs, len, dest_offs) { - for (var i = 0; i < len; i++) { - dest[dest_offs + i] = src[src_offs + i]; - } - }, - // Join array of chunks to single array. - flattenChunks: function (chunks) { - return [].concat.apply([], chunks); - } -}; - - -// Enable/Disable typed arrays use, for testing -// -exports.setTyped = function (on) { - if (on) { - exports.Buf8 = Uint8Array; - exports.Buf16 = Uint16Array; - exports.Buf32 = Int32Array; - exports.assign(exports, fnTyped); - } else { - exports.Buf8 = Array; - exports.Buf16 = Array; - exports.Buf32 = Array; - exports.assign(exports, fnUntyped); - } -}; - -exports.setTyped(TYPED_OK); - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/adler32.js": -/*!****************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/adler32.js ***! - \****************************************************************************/ -/***/ ((module) => { - -"use strict"; - - -// Note: adler32 takes 12% for level 0 and 2% for level 6. -// It isn't worth it to make additional optimizations as in original. -// Small size is preferable. - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -function adler32(adler, buf, len, pos) { - var s1 = (adler & 0xffff) |0, - s2 = ((adler >>> 16) & 0xffff) |0, - n = 0; - - while (len !== 0) { - // Set limit ~ twice less than 5552, to keep - // s2 in 31-bits, because we force signed ints. - // in other case %= will fail. - n = len > 2000 ? 2000 : len; - len -= n; - - do { - s1 = (s1 + buf[pos++]) |0; - s2 = (s2 + s1) |0; - } while (--n); - - s1 %= 65521; - s2 %= 65521; - } - - return (s1 | (s2 << 16)) |0; -} - - -module.exports = adler32; - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/constants.js": -/*!******************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/constants.js ***! - \******************************************************************************/ -/***/ ((module) => { - -"use strict"; - - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -module.exports = { - - /* Allowed flush values; see deflate() and inflate() below for details */ - Z_NO_FLUSH: 0, - Z_PARTIAL_FLUSH: 1, - Z_SYNC_FLUSH: 2, - Z_FULL_FLUSH: 3, - Z_FINISH: 4, - Z_BLOCK: 5, - Z_TREES: 6, - - /* Return codes for the compression/decompression functions. Negative values - * are errors, positive values are used for special but normal events. - */ - Z_OK: 0, - Z_STREAM_END: 1, - Z_NEED_DICT: 2, - Z_ERRNO: -1, - Z_STREAM_ERROR: -2, - Z_DATA_ERROR: -3, - //Z_MEM_ERROR: -4, - Z_BUF_ERROR: -5, - //Z_VERSION_ERROR: -6, - - /* compression levels */ - Z_NO_COMPRESSION: 0, - Z_BEST_SPEED: 1, - Z_BEST_COMPRESSION: 9, - Z_DEFAULT_COMPRESSION: -1, - - - Z_FILTERED: 1, - Z_HUFFMAN_ONLY: 2, - Z_RLE: 3, - Z_FIXED: 4, - Z_DEFAULT_STRATEGY: 0, - - /* Possible values of the data_type field (though see inflate()) */ - Z_BINARY: 0, - Z_TEXT: 1, - //Z_ASCII: 1, // = Z_TEXT (deprecated) - Z_UNKNOWN: 2, - - /* The deflate compression method */ - Z_DEFLATED: 8 - //Z_NULL: null // Use -1 or null inline, depending on var type -}; - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/crc32.js": -/*!**************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/crc32.js ***! - \**************************************************************************/ -/***/ ((module) => { - -"use strict"; - - -// Note: we can't get significant speed boost here. -// So write code to minimize size - no pregenerated tables -// and array tools dependencies. - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -// Use ordinary array, since untyped makes no boost here -function makeTable() { - var c, table = []; - - for (var n = 0; n < 256; n++) { - c = n; - for (var k = 0; k < 8; k++) { - c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1)); - } - table[n] = c; - } - - return table; -} - -// Create table on load. Just 255 signed longs. Not a problem. -var crcTable = makeTable(); - - -function crc32(crc, buf, len, pos) { - var t = crcTable, - end = pos + len; - - crc ^= -1; - - for (var i = pos; i < end; i++) { - crc = (crc >>> 8) ^ t[(crc ^ buf[i]) & 0xFF]; - } - - return (crc ^ (-1)); // >>> 0; -} - - -module.exports = crc32; - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/deflate.js": -/*!****************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/deflate.js ***! - \****************************************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -var utils = __webpack_require__(/*! ../utils/common */ "./node_modules/browserify-zlib/node_modules/pako/lib/utils/common.js"); -var trees = __webpack_require__(/*! ./trees */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/trees.js"); -var adler32 = __webpack_require__(/*! ./adler32 */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/adler32.js"); -var crc32 = __webpack_require__(/*! ./crc32 */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/crc32.js"); -var msg = __webpack_require__(/*! ./messages */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/messages.js"); - -/* Public constants ==========================================================*/ -/* ===========================================================================*/ - - -/* Allowed flush values; see deflate() and inflate() below for details */ -var Z_NO_FLUSH = 0; -var Z_PARTIAL_FLUSH = 1; -//var Z_SYNC_FLUSH = 2; -var Z_FULL_FLUSH = 3; -var Z_FINISH = 4; -var Z_BLOCK = 5; -//var Z_TREES = 6; - - -/* Return codes for the compression/decompression functions. Negative values - * are errors, positive values are used for special but normal events. - */ -var Z_OK = 0; -var Z_STREAM_END = 1; -//var Z_NEED_DICT = 2; -//var Z_ERRNO = -1; -var Z_STREAM_ERROR = -2; -var Z_DATA_ERROR = -3; -//var Z_MEM_ERROR = -4; -var Z_BUF_ERROR = -5; -//var Z_VERSION_ERROR = -6; - - -/* compression levels */ -//var Z_NO_COMPRESSION = 0; -//var Z_BEST_SPEED = 1; -//var Z_BEST_COMPRESSION = 9; -var Z_DEFAULT_COMPRESSION = -1; - - -var Z_FILTERED = 1; -var Z_HUFFMAN_ONLY = 2; -var Z_RLE = 3; -var Z_FIXED = 4; -var Z_DEFAULT_STRATEGY = 0; - -/* Possible values of the data_type field (though see inflate()) */ -//var Z_BINARY = 0; -//var Z_TEXT = 1; -//var Z_ASCII = 1; // = Z_TEXT -var Z_UNKNOWN = 2; - - -/* The deflate compression method */ -var Z_DEFLATED = 8; - -/*============================================================================*/ - - -var MAX_MEM_LEVEL = 9; -/* Maximum value for memLevel in deflateInit2 */ -var MAX_WBITS = 15; -/* 32K LZ77 window */ -var DEF_MEM_LEVEL = 8; - - -var LENGTH_CODES = 29; -/* number of length codes, not counting the special END_BLOCK code */ -var LITERALS = 256; -/* number of literal bytes 0..255 */ -var L_CODES = LITERALS + 1 + LENGTH_CODES; -/* number of Literal or Length codes, including the END_BLOCK code */ -var D_CODES = 30; -/* number of distance codes */ -var BL_CODES = 19; -/* number of codes used to transfer the bit lengths */ -var HEAP_SIZE = 2 * L_CODES + 1; -/* maximum heap size */ -var MAX_BITS = 15; -/* All codes must not exceed MAX_BITS bits */ - -var MIN_MATCH = 3; -var MAX_MATCH = 258; -var MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1); - -var PRESET_DICT = 0x20; - -var INIT_STATE = 42; -var EXTRA_STATE = 69; -var NAME_STATE = 73; -var COMMENT_STATE = 91; -var HCRC_STATE = 103; -var BUSY_STATE = 113; -var FINISH_STATE = 666; - -var BS_NEED_MORE = 1; /* block not completed, need more input or more output */ -var BS_BLOCK_DONE = 2; /* block flush performed */ -var BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */ -var BS_FINISH_DONE = 4; /* finish done, accept no more input or output */ - -var OS_CODE = 0x03; // Unix :) . Don't detect, use this default. - -function err(strm, errorCode) { - strm.msg = msg[errorCode]; - return errorCode; -} - -function rank(f) { - return ((f) << 1) - ((f) > 4 ? 9 : 0); -} - -function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } } - - -/* ========================================================================= - * Flush as much pending output as possible. All deflate() output goes - * through this function so some applications may wish to modify it - * to avoid allocating a large strm->output buffer and copying into it. - * (See also read_buf()). - */ -function flush_pending(strm) { - var s = strm.state; - - //_tr_flush_bits(s); - var len = s.pending; - if (len > strm.avail_out) { - len = strm.avail_out; - } - if (len === 0) { return; } - - utils.arraySet(strm.output, s.pending_buf, s.pending_out, len, strm.next_out); - strm.next_out += len; - s.pending_out += len; - strm.total_out += len; - strm.avail_out -= len; - s.pending -= len; - if (s.pending === 0) { - s.pending_out = 0; - } -} - - -function flush_block_only(s, last) { - trees._tr_flush_block(s, (s.block_start >= 0 ? s.block_start : -1), s.strstart - s.block_start, last); - s.block_start = s.strstart; - flush_pending(s.strm); -} - - -function put_byte(s, b) { - s.pending_buf[s.pending++] = b; -} - - -/* ========================================================================= - * Put a short in the pending buffer. The 16-bit value is put in MSB order. - * IN assertion: the stream state is correct and there is enough room in - * pending_buf. - */ -function putShortMSB(s, b) { -// put_byte(s, (Byte)(b >> 8)); -// put_byte(s, (Byte)(b & 0xff)); - s.pending_buf[s.pending++] = (b >>> 8) & 0xff; - s.pending_buf[s.pending++] = b & 0xff; -} - - -/* =========================================================================== - * Read a new buffer from the current input stream, update the adler32 - * and total number of bytes read. All deflate() input goes through - * this function so some applications may wish to modify it to avoid - * allocating a large strm->input buffer and copying from it. - * (See also flush_pending()). - */ -function read_buf(strm, buf, start, size) { - var len = strm.avail_in; - - if (len > size) { len = size; } - if (len === 0) { return 0; } - - strm.avail_in -= len; - - // zmemcpy(buf, strm->next_in, len); - utils.arraySet(buf, strm.input, strm.next_in, len, start); - if (strm.state.wrap === 1) { - strm.adler = adler32(strm.adler, buf, len, start); - } - - else if (strm.state.wrap === 2) { - strm.adler = crc32(strm.adler, buf, len, start); - } - - strm.next_in += len; - strm.total_in += len; - - return len; -} - - -/* =========================================================================== - * Set match_start to the longest match starting at the given string and - * return its length. Matches shorter or equal to prev_length are discarded, - * in which case the result is equal to prev_length and match_start is - * garbage. - * IN assertions: cur_match is the head of the hash chain for the current - * string (strstart) and its distance is <= MAX_DIST, and prev_length >= 1 - * OUT assertion: the match length is not greater than s->lookahead. - */ -function longest_match(s, cur_match) { - var chain_length = s.max_chain_length; /* max hash chain length */ - var scan = s.strstart; /* current string */ - var match; /* matched string */ - var len; /* length of current match */ - var best_len = s.prev_length; /* best match length so far */ - var nice_match = s.nice_match; /* stop if match long enough */ - var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ? - s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/; - - var _win = s.window; // shortcut - - var wmask = s.w_mask; - var prev = s.prev; - - /* Stop when cur_match becomes <= limit. To simplify the code, - * we prevent matches with the string of window index 0. - */ - - var strend = s.strstart + MAX_MATCH; - var scan_end1 = _win[scan + best_len - 1]; - var scan_end = _win[scan + best_len]; - - /* The code is optimized for HASH_BITS >= 8 and MAX_MATCH-2 multiple of 16. - * It is easy to get rid of this optimization if necessary. - */ - // Assert(s->hash_bits >= 8 && MAX_MATCH == 258, "Code too clever"); - - /* Do not waste too much time if we already have a good match: */ - if (s.prev_length >= s.good_match) { - chain_length >>= 2; - } - /* Do not look for matches beyond the end of the input. This is necessary - * to make deflate deterministic. - */ - if (nice_match > s.lookahead) { nice_match = s.lookahead; } - - // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, "need lookahead"); - - do { - // Assert(cur_match < s->strstart, "no future"); - match = cur_match; - - /* Skip to next match if the match length cannot increase - * or if the match length is less than 2. Note that the checks below - * for insufficient lookahead only occur occasionally for performance - * reasons. Therefore uninitialized memory will be accessed, and - * conditional jumps will be made that depend on those values. - * However the length of the match is limited to the lookahead, so - * the output of deflate is not affected by the uninitialized values. - */ - - if (_win[match + best_len] !== scan_end || - _win[match + best_len - 1] !== scan_end1 || - _win[match] !== _win[scan] || - _win[++match] !== _win[scan + 1]) { - continue; - } - - /* The check at best_len-1 can be removed because it will be made - * again later. (This heuristic is not always a win.) - * It is not necessary to compare scan[2] and match[2] since they - * are always equal when the other bytes match, given that - * the hash keys are equal and that HASH_BITS >= 8. - */ - scan += 2; - match++; - // Assert(*scan == *match, "match[2]?"); - - /* We check for insufficient lookahead only every 8th comparison; - * the 256th check will be made at strstart+258. - */ - do { - /*jshint noempty:false*/ - } 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"); - - len = MAX_MATCH - (strend - scan); - scan = strend - MAX_MATCH; - - if (len > best_len) { - s.match_start = cur_match; - best_len = len; - if (len >= nice_match) { - break; - } - scan_end1 = _win[scan + best_len - 1]; - scan_end = _win[scan + best_len]; - } - } while ((cur_match = prev[cur_match & wmask]) > limit && --chain_length !== 0); - - if (best_len <= s.lookahead) { - return best_len; - } - return s.lookahead; -} - - -/* =========================================================================== - * Fill the window when the lookahead becomes insufficient. - * Updates strstart and lookahead. - * - * IN assertion: lookahead < MIN_LOOKAHEAD - * OUT assertions: strstart <= window_size-MIN_LOOKAHEAD - * At least one byte has been read, or avail_in == 0; reads are - * performed for at least two bytes (required for the zip translate_eol - * option -- not supported here). - */ -function fill_window(s) { - var _w_size = s.w_size; - var p, n, m, more, str; - - //Assert(s->lookahead < MIN_LOOKAHEAD, "already enough lookahead"); - - do { - more = s.window_size - s.lookahead - s.strstart; - - // JS ints have 32 bit, block below not needed - /* Deal with !@#$% 64K limit: */ - //if (sizeof(int) <= 2) { - // if (more == 0 && s->strstart == 0 && s->lookahead == 0) { - // more = wsize; - // - // } else if (more == (unsigned)(-1)) { - // /* Very unlikely, but possible on 16 bit machine if - // * strstart == 0 && lookahead == 1 (input done a byte at time) - // */ - // more--; - // } - //} - - - /* If the window is almost full and there is insufficient lookahead, - * move the upper half to the lower one to make room in the upper half. - */ - if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) { - - utils.arraySet(s.window, s.window, _w_size, _w_size, 0); - s.match_start -= _w_size; - s.strstart -= _w_size; - /* we now have strstart >= MAX_DIST */ - s.block_start -= _w_size; - - /* Slide the hash table (could be avoided with 32 bit values - at the expense of memory usage). We slide even when level == 0 - to keep the hash table consistent if we switch back to level > 0 - later. (Using level 0 permanently is not an optimal usage of - zlib, so we don't care about this pathological case.) - */ - - n = s.hash_size; - p = n; - do { - m = s.head[--p]; - s.head[p] = (m >= _w_size ? m - _w_size : 0); - } while (--n); - - n = _w_size; - p = n; - do { - m = s.prev[--p]; - s.prev[p] = (m >= _w_size ? m - _w_size : 0); - /* If n is not on any hash chain, prev[n] is garbage but - * its value will never be used. - */ - } while (--n); - - more += _w_size; - } - if (s.strm.avail_in === 0) { - break; - } - - /* If there was no sliding: - * strstart <= WSIZE+MAX_DIST-1 && lookahead <= MIN_LOOKAHEAD - 1 && - * more == window_size - lookahead - strstart - * => more >= window_size - (MIN_LOOKAHEAD-1 + WSIZE + MAX_DIST-1) - * => more >= window_size - 2*WSIZE + 2 - * In the BIG_MEM or MMAP case (not yet supported), - * window_size == input_size + MIN_LOOKAHEAD && - * strstart + s->lookahead <= input_size => more >= MIN_LOOKAHEAD. - * Otherwise, window_size == 2*WSIZE so more >= 2. - * If there was sliding, more >= WSIZE. So in all cases, more >= 2. - */ - //Assert(more >= 2, "more < 2"); - n = read_buf(s.strm, s.window, s.strstart + s.lookahead, more); - s.lookahead += n; - - /* Initialize the hash value now that we have some input: */ - if (s.lookahead + s.insert >= MIN_MATCH) { - str = s.strstart - s.insert; - s.ins_h = s.window[str]; - - /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */ - s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask; -//#if MIN_MATCH != 3 -// Call update_hash() MIN_MATCH-3 more times -//#endif - while (s.insert) { - /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ - s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask; - - s.prev[str & s.w_mask] = s.head[s.ins_h]; - s.head[s.ins_h] = str; - str++; - s.insert--; - if (s.lookahead + s.insert < MIN_MATCH) { - break; - } - } - } - /* If the whole input has less than MIN_MATCH bytes, ins_h is garbage, - * but this is not important since only literal bytes will be emitted. - */ - - } while (s.lookahead < MIN_LOOKAHEAD && s.strm.avail_in !== 0); - - /* If the WIN_INIT bytes after the end of the current data have never been - * written, then zero those bytes in order to avoid memory check reports of - * the use of uninitialized (or uninitialised as Julian writes) bytes by - * the longest match routines. Update the high water mark for the next - * time through here. WIN_INIT is set to MAX_MATCH since the longest match - * routines allow scanning to strstart + MAX_MATCH, ignoring lookahead. - */ -// if (s.high_water < s.window_size) { -// var curr = s.strstart + s.lookahead; -// var init = 0; -// -// if (s.high_water < curr) { -// /* Previous high water mark below current data -- zero WIN_INIT -// * bytes or up to end of window, whichever is less. -// */ -// init = s.window_size - curr; -// if (init > WIN_INIT) -// init = WIN_INIT; -// zmemzero(s->window + curr, (unsigned)init); -// s->high_water = curr + init; -// } -// else if (s->high_water < (ulg)curr + WIN_INIT) { -// /* High water mark at or above current data, but below current data -// * plus WIN_INIT -- zero out to current data plus WIN_INIT, or up -// * to end of window, whichever is less. -// */ -// init = (ulg)curr + WIN_INIT - s->high_water; -// if (init > s->window_size - s->high_water) -// init = s->window_size - s->high_water; -// zmemzero(s->window + s->high_water, (unsigned)init); -// s->high_water += init; -// } -// } -// -// Assert((ulg)s->strstart <= s->window_size - MIN_LOOKAHEAD, -// "not enough room for search"); -} - -/* =========================================================================== - * Copy without compression as much as possible from the input stream, return - * the current block state. - * This function does not insert new strings in the dictionary since - * uncompressible data is probably not useful. This function is used - * only for the level=0 compression option. - * NOTE: this function should be optimized to avoid extra copying from - * window to pending_buf. - */ -function deflate_stored(s, flush) { - /* Stored blocks are limited to 0xffff bytes, pending_buf is limited - * to pending_buf_size, and each stored block has a 5 byte header: - */ - var max_block_size = 0xffff; - - if (max_block_size > s.pending_buf_size - 5) { - max_block_size = s.pending_buf_size - 5; - } - - /* Copy as much as possible from input to output: */ - for (;;) { - /* Fill the window as much as possible: */ - if (s.lookahead <= 1) { - - //Assert(s->strstart < s->w_size+MAX_DIST(s) || - // s->block_start >= (long)s->w_size, "slide too late"); -// if (!(s.strstart < s.w_size + (s.w_size - MIN_LOOKAHEAD) || -// s.block_start >= s.w_size)) { -// throw new Error("slide too late"); -// } - - fill_window(s); - if (s.lookahead === 0 && flush === Z_NO_FLUSH) { - return BS_NEED_MORE; - } - - if (s.lookahead === 0) { - break; - } - /* flush the current block */ - } - //Assert(s->block_start >= 0L, "block gone"); -// if (s.block_start < 0) throw new Error("block gone"); - - s.strstart += s.lookahead; - s.lookahead = 0; - - /* Emit a stored block if pending_buf will be full: */ - var max_start = s.block_start + max_block_size; - - if (s.strstart === 0 || s.strstart >= max_start) { - /* strstart == 0 is possible when wraparound on 16-bit machine */ - s.lookahead = s.strstart - max_start; - s.strstart = max_start; - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - - - } - /* Flush if we may have to slide, otherwise block_start may become - * negative and the data will be gone: - */ - if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - } - - s.insert = 0; - - if (flush === Z_FINISH) { - /*** FLUSH_BLOCK(s, 1); ***/ - flush_block_only(s, true); - if (s.strm.avail_out === 0) { - return BS_FINISH_STARTED; - } - /***/ - return BS_FINISH_DONE; - } - - if (s.strstart > s.block_start) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - - return BS_NEED_MORE; -} - -/* =========================================================================== - * Compress as much as possible from the input stream, return the current - * block state. - * This function does not perform lazy evaluation of matches and inserts - * new strings in the dictionary only for unmatched strings or for short - * matches. It is used only for the fast compression options. - */ -function deflate_fast(s, flush) { - var hash_head; /* head of the hash chain */ - var bflush; /* set if current block must be flushed */ - - for (;;) { - /* Make sure that we always have enough lookahead, except - * at the end of the input file. We need MAX_MATCH bytes - * for the next match, plus MIN_MATCH bytes to insert the - * string following the next match. - */ - if (s.lookahead < MIN_LOOKAHEAD) { - fill_window(s); - if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) { - return BS_NEED_MORE; - } - if (s.lookahead === 0) { - break; /* flush the current block */ - } - } - - /* Insert the string window[strstart .. strstart+2] in the - * dictionary, and set hash_head to the head of the hash chain: - */ - hash_head = 0/*NIL*/; - if (s.lookahead >= MIN_MATCH) { - /*** INSERT_STRING(s, s.strstart, hash_head); ***/ - s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; - hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; - s.head[s.ins_h] = s.strstart; - /***/ - } - - /* Find the longest match, discarding those <= prev_length. - * At this point we have always match_length < MIN_MATCH - */ - if (hash_head !== 0/*NIL*/ && ((s.strstart - hash_head) <= (s.w_size - MIN_LOOKAHEAD))) { - /* To simplify the code, we prevent matches with the string - * of window index 0 (in particular we have to avoid a match - * of the string with itself at the start of the input file). - */ - s.match_length = longest_match(s, hash_head); - /* longest_match() sets match_start */ - } - if (s.match_length >= MIN_MATCH) { - // check_match(s, s.strstart, s.match_start, s.match_length); // for debug only - - /*** _tr_tally_dist(s, s.strstart - s.match_start, - s.match_length - MIN_MATCH, bflush); ***/ - bflush = trees._tr_tally(s, s.strstart - s.match_start, s.match_length - MIN_MATCH); - - s.lookahead -= s.match_length; - - /* Insert new strings in the hash table only if the match length - * is not too large. This saves time but degrades compression. - */ - if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) { - s.match_length--; /* string at strstart already in table */ - do { - s.strstart++; - /*** INSERT_STRING(s, s.strstart, hash_head); ***/ - s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; - hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; - s.head[s.ins_h] = s.strstart; - /***/ - /* strstart never exceeds WSIZE-MAX_MATCH, so there are - * always MIN_MATCH bytes ahead. - */ - } while (--s.match_length !== 0); - s.strstart++; - } else - { - s.strstart += s.match_length; - s.match_length = 0; - s.ins_h = s.window[s.strstart]; - /* UPDATE_HASH(s, s.ins_h, s.window[s.strstart+1]); */ - s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask; - -//#if MIN_MATCH != 3 -// Call UPDATE_HASH() MIN_MATCH-3 more times -//#endif - /* If lookahead < MIN_MATCH, ins_h is garbage, but it does not - * matter since it will be recomputed at next deflate call. - */ - } - } else { - /* No match, output a literal byte */ - //Tracevv((stderr,"%c", s.window[s.strstart])); - /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ - bflush = trees._tr_tally(s, 0, s.window[s.strstart]); - - s.lookahead--; - s.strstart++; - } - if (bflush) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - } - s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1); - if (flush === Z_FINISH) { - /*** FLUSH_BLOCK(s, 1); ***/ - flush_block_only(s, true); - if (s.strm.avail_out === 0) { - return BS_FINISH_STARTED; - } - /***/ - return BS_FINISH_DONE; - } - if (s.last_lit) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - return BS_BLOCK_DONE; -} - -/* =========================================================================== - * Same as above, but achieves better compression. We use a lazy - * evaluation for matches: a match is finally adopted only if there is - * no better match at the next window position. - */ -function deflate_slow(s, flush) { - var hash_head; /* head of hash chain */ - var bflush; /* set if current block must be flushed */ - - var max_insert; - - /* Process the input block. */ - for (;;) { - /* Make sure that we always have enough lookahead, except - * at the end of the input file. We need MAX_MATCH bytes - * for the next match, plus MIN_MATCH bytes to insert the - * string following the next match. - */ - if (s.lookahead < MIN_LOOKAHEAD) { - fill_window(s); - if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) { - return BS_NEED_MORE; - } - if (s.lookahead === 0) { break; } /* flush the current block */ - } - - /* Insert the string window[strstart .. strstart+2] in the - * dictionary, and set hash_head to the head of the hash chain: - */ - hash_head = 0/*NIL*/; - if (s.lookahead >= MIN_MATCH) { - /*** INSERT_STRING(s, s.strstart, hash_head); ***/ - s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; - hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; - s.head[s.ins_h] = s.strstart; - /***/ - } - - /* Find the longest match, discarding those <= prev_length. - */ - s.prev_length = s.match_length; - s.prev_match = s.match_start; - s.match_length = MIN_MATCH - 1; - - if (hash_head !== 0/*NIL*/ && s.prev_length < s.max_lazy_match && - s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) { - /* To simplify the code, we prevent matches with the string - * of window index 0 (in particular we have to avoid a match - * of the string with itself at the start of the input file). - */ - s.match_length = longest_match(s, hash_head); - /* longest_match() sets match_start */ - - if (s.match_length <= 5 && - (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*TOO_FAR*/))) { - - /* If prev_match is also MIN_MATCH, match_start is garbage - * but we will ignore the current match anyway. - */ - s.match_length = MIN_MATCH - 1; - } - } - /* If there was a match at the previous step and the current - * match is not better, output the previous match: - */ - if (s.prev_length >= MIN_MATCH && s.match_length <= s.prev_length) { - max_insert = s.strstart + s.lookahead - MIN_MATCH; - /* Do not insert strings in hash table beyond this. */ - - //check_match(s, s.strstart-1, s.prev_match, s.prev_length); - - /***_tr_tally_dist(s, s.strstart - 1 - s.prev_match, - s.prev_length - MIN_MATCH, bflush);***/ - bflush = trees._tr_tally(s, s.strstart - 1 - s.prev_match, s.prev_length - MIN_MATCH); - /* Insert in hash table all strings up to the end of the match. - * strstart-1 and strstart are already inserted. If there is not - * enough lookahead, the last two strings are not inserted in - * the hash table. - */ - s.lookahead -= s.prev_length - 1; - s.prev_length -= 2; - do { - if (++s.strstart <= max_insert) { - /*** INSERT_STRING(s, s.strstart, hash_head); ***/ - s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + MIN_MATCH - 1]) & s.hash_mask; - hash_head = s.prev[s.strstart & s.w_mask] = s.head[s.ins_h]; - s.head[s.ins_h] = s.strstart; - /***/ - } - } while (--s.prev_length !== 0); - s.match_available = 0; - s.match_length = MIN_MATCH - 1; - s.strstart++; - - if (bflush) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - - } else if (s.match_available) { - /* If there was no match at the previous position, output a - * single literal. If there was a match but the current match - * is longer, truncate the previous match to a single literal. - */ - //Tracevv((stderr,"%c", s->window[s->strstart-1])); - /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ - bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]); - - if (bflush) { - /*** FLUSH_BLOCK_ONLY(s, 0) ***/ - flush_block_only(s, false); - /***/ - } - s.strstart++; - s.lookahead--; - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - } else { - /* There is no previous match to compare with, wait for - * the next step to decide. - */ - s.match_available = 1; - s.strstart++; - s.lookahead--; - } - } - //Assert (flush != Z_NO_FLUSH, "no flush?"); - if (s.match_available) { - //Tracevv((stderr,"%c", s->window[s->strstart-1])); - /*** _tr_tally_lit(s, s.window[s.strstart-1], bflush); ***/ - bflush = trees._tr_tally(s, 0, s.window[s.strstart - 1]); - - s.match_available = 0; - } - s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1; - if (flush === Z_FINISH) { - /*** FLUSH_BLOCK(s, 1); ***/ - flush_block_only(s, true); - if (s.strm.avail_out === 0) { - return BS_FINISH_STARTED; - } - /***/ - return BS_FINISH_DONE; - } - if (s.last_lit) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - - return BS_BLOCK_DONE; -} - - -/* =========================================================================== - * For Z_RLE, simply look for runs of bytes, generate matches only of distance - * one. Do not maintain a hash table. (It will be regenerated if this run of - * deflate switches away from Z_RLE.) - */ -function deflate_rle(s, flush) { - var bflush; /* set if current block must be flushed */ - var prev; /* byte at distance one to match */ - var scan, strend; /* scan goes up to strend for length of run */ - - var _win = s.window; - - for (;;) { - /* Make sure that we always have enough lookahead, except - * at the end of the input file. We need MAX_MATCH bytes - * for the longest run, plus one for the unrolled loop. - */ - if (s.lookahead <= MAX_MATCH) { - fill_window(s); - if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) { - return BS_NEED_MORE; - } - if (s.lookahead === 0) { break; } /* flush the current block */ - } - - /* See how many times the previous byte repeats */ - s.match_length = 0; - if (s.lookahead >= MIN_MATCH && s.strstart > 0) { - scan = s.strstart - 1; - prev = _win[scan]; - if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) { - strend = s.strstart + MAX_MATCH; - do { - /*jshint noempty:false*/ - } 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); - s.match_length = MAX_MATCH - (strend - scan); - if (s.match_length > s.lookahead) { - s.match_length = s.lookahead; - } - } - //Assert(scan <= s->window+(uInt)(s->window_size-1), "wild scan"); - } - - /* Emit match if have run of MIN_MATCH or longer, else emit literal */ - if (s.match_length >= MIN_MATCH) { - //check_match(s, s.strstart, s.strstart - 1, s.match_length); - - /*** _tr_tally_dist(s, 1, s.match_length - MIN_MATCH, bflush); ***/ - bflush = trees._tr_tally(s, 1, s.match_length - MIN_MATCH); - - s.lookahead -= s.match_length; - s.strstart += s.match_length; - s.match_length = 0; - } else { - /* No match, output a literal byte */ - //Tracevv((stderr,"%c", s->window[s->strstart])); - /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ - bflush = trees._tr_tally(s, 0, s.window[s.strstart]); - - s.lookahead--; - s.strstart++; - } - if (bflush) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - } - s.insert = 0; - if (flush === Z_FINISH) { - /*** FLUSH_BLOCK(s, 1); ***/ - flush_block_only(s, true); - if (s.strm.avail_out === 0) { - return BS_FINISH_STARTED; - } - /***/ - return BS_FINISH_DONE; - } - if (s.last_lit) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - return BS_BLOCK_DONE; -} - -/* =========================================================================== - * For Z_HUFFMAN_ONLY, do not look for matches. Do not maintain a hash table. - * (It will be regenerated if this run of deflate switches away from Huffman.) - */ -function deflate_huff(s, flush) { - var bflush; /* set if current block must be flushed */ - - for (;;) { - /* Make sure that we have a literal to write. */ - if (s.lookahead === 0) { - fill_window(s); - if (s.lookahead === 0) { - if (flush === Z_NO_FLUSH) { - return BS_NEED_MORE; - } - break; /* flush the current block */ - } - } - - /* Output a literal byte */ - s.match_length = 0; - //Tracevv((stderr,"%c", s->window[s->strstart])); - /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/ - bflush = trees._tr_tally(s, 0, s.window[s.strstart]); - s.lookahead--; - s.strstart++; - if (bflush) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - } - s.insert = 0; - if (flush === Z_FINISH) { - /*** FLUSH_BLOCK(s, 1); ***/ - flush_block_only(s, true); - if (s.strm.avail_out === 0) { - return BS_FINISH_STARTED; - } - /***/ - return BS_FINISH_DONE; - } - if (s.last_lit) { - /*** FLUSH_BLOCK(s, 0); ***/ - flush_block_only(s, false); - if (s.strm.avail_out === 0) { - return BS_NEED_MORE; - } - /***/ - } - return BS_BLOCK_DONE; -} - -/* Values for max_lazy_match, good_match and max_chain_length, depending on - * the desired pack level (0..9). The values given below have been tuned to - * exclude worst case performance for pathological files. Better values may be - * found for specific files. - */ -function Config(good_length, max_lazy, nice_length, max_chain, func) { - this.good_length = good_length; - this.max_lazy = max_lazy; - this.nice_length = nice_length; - this.max_chain = max_chain; - this.func = func; -} - -var configuration_table; - -configuration_table = [ - /* good lazy nice chain */ - new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */ - new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */ - new Config(4, 5, 16, 8, deflate_fast), /* 2 */ - new Config(4, 6, 32, 32, deflate_fast), /* 3 */ - - new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */ - new Config(8, 16, 32, 32, deflate_slow), /* 5 */ - new Config(8, 16, 128, 128, deflate_slow), /* 6 */ - new Config(8, 32, 128, 256, deflate_slow), /* 7 */ - new Config(32, 128, 258, 1024, deflate_slow), /* 8 */ - new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */ -]; - - -/* =========================================================================== - * Initialize the "longest match" routines for a new zlib stream - */ -function lm_init(s) { - s.window_size = 2 * s.w_size; - - /*** CLEAR_HASH(s); ***/ - zero(s.head); // Fill with NIL (= 0); - - /* Set the default configuration parameters: - */ - s.max_lazy_match = configuration_table[s.level].max_lazy; - s.good_match = configuration_table[s.level].good_length; - s.nice_match = configuration_table[s.level].nice_length; - s.max_chain_length = configuration_table[s.level].max_chain; - - s.strstart = 0; - s.block_start = 0; - s.lookahead = 0; - s.insert = 0; - s.match_length = s.prev_length = MIN_MATCH - 1; - s.match_available = 0; - s.ins_h = 0; -} - - -function DeflateState() { - this.strm = null; /* pointer back to this zlib stream */ - this.status = 0; /* as the name implies */ - this.pending_buf = null; /* output still pending */ - this.pending_buf_size = 0; /* size of pending_buf */ - this.pending_out = 0; /* next pending byte to output to the stream */ - this.pending = 0; /* nb of bytes in the pending buffer */ - this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ - this.gzhead = null; /* gzip header information to write */ - this.gzindex = 0; /* where in extra, name, or comment */ - this.method = Z_DEFLATED; /* can only be DEFLATED */ - this.last_flush = -1; /* value of flush param for previous deflate call */ - - this.w_size = 0; /* LZ77 window size (32K by default) */ - this.w_bits = 0; /* log2(w_size) (8..16) */ - this.w_mask = 0; /* w_size - 1 */ - - this.window = null; - /* Sliding window. Input bytes are read into the second half of the window, - * and move to the first half later to keep a dictionary of at least wSize - * bytes. With this organization, matches are limited to a distance of - * wSize-MAX_MATCH bytes, but this ensures that IO is always - * performed with a length multiple of the block size. - */ - - this.window_size = 0; - /* Actual size of window: 2*wSize, except when the user input buffer - * is directly used as sliding window. - */ - - this.prev = null; - /* Link to older string with same hash index. To limit the size of this - * array to 64K, this link is maintained only for the last 32K strings. - * An index in this array is thus a window index modulo 32K. - */ - - this.head = null; /* Heads of the hash chains or NIL. */ - - this.ins_h = 0; /* hash index of string to be inserted */ - this.hash_size = 0; /* number of elements in hash table */ - this.hash_bits = 0; /* log2(hash_size) */ - this.hash_mask = 0; /* hash_size-1 */ - - this.hash_shift = 0; - /* Number of bits by which ins_h must be shifted at each input - * step. It must be such that after MIN_MATCH steps, the oldest - * byte no longer takes part in the hash key, that is: - * hash_shift * MIN_MATCH >= hash_bits - */ - - this.block_start = 0; - /* Window position at the beginning of the current output block. Gets - * negative when the window is moved backwards. - */ - - this.match_length = 0; /* length of best match */ - this.prev_match = 0; /* previous match */ - this.match_available = 0; /* set if previous match exists */ - this.strstart = 0; /* start of string to insert */ - this.match_start = 0; /* start of matching string */ - this.lookahead = 0; /* number of valid bytes ahead in window */ - - this.prev_length = 0; - /* Length of the best match at previous step. Matches not greater than this - * are discarded. This is used in the lazy match evaluation. - */ - - this.max_chain_length = 0; - /* To speed up deflation, hash chains are never searched beyond this - * length. A higher limit improves compression ratio but degrades the - * speed. - */ - - this.max_lazy_match = 0; - /* Attempt to find a better match only when the current match is strictly - * smaller than this value. This mechanism is used only for compression - * levels >= 4. - */ - // That's alias to max_lazy_match, don't use directly - //this.max_insert_length = 0; - /* Insert new strings in the hash table only if the match length is not - * greater than this length. This saves time but degrades compression. - * max_insert_length is used only for compression levels <= 3. - */ - - this.level = 0; /* compression level (1..9) */ - this.strategy = 0; /* favor or force Huffman coding*/ - - this.good_match = 0; - /* Use a faster search when the previous match is longer than this */ - - this.nice_match = 0; /* Stop searching when current match exceeds this */ - - /* used by trees.c: */ - - /* Didn't use ct_data typedef below to suppress compiler warning */ - - // struct ct_data_s dyn_ltree[HEAP_SIZE]; /* literal and length tree */ - // struct ct_data_s dyn_dtree[2*D_CODES+1]; /* distance tree */ - // struct ct_data_s bl_tree[2*BL_CODES+1]; /* Huffman tree for bit lengths */ - - // Use flat array of DOUBLE size, with interleaved fata, - // because JS does not support effective - this.dyn_ltree = new utils.Buf16(HEAP_SIZE * 2); - this.dyn_dtree = new utils.Buf16((2 * D_CODES + 1) * 2); - this.bl_tree = new utils.Buf16((2 * BL_CODES + 1) * 2); - zero(this.dyn_ltree); - zero(this.dyn_dtree); - zero(this.bl_tree); - - this.l_desc = null; /* desc. for literal tree */ - this.d_desc = null; /* desc. for distance tree */ - this.bl_desc = null; /* desc. for bit length tree */ - - //ush bl_count[MAX_BITS+1]; - this.bl_count = new utils.Buf16(MAX_BITS + 1); - /* number of codes at each bit length for an optimal tree */ - - //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */ - this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */ - zero(this.heap); - - this.heap_len = 0; /* number of elements in the heap */ - this.heap_max = 0; /* element of largest frequency */ - /* The sons of heap[n] are heap[2*n] and heap[2*n+1]. heap[0] is not used. - * The same heap array is used to build all trees. - */ - - this.depth = new utils.Buf16(2 * L_CODES + 1); //uch depth[2*L_CODES+1]; - zero(this.depth); - /* Depth of each subtree used as tie breaker for trees of equal frequency - */ - - this.l_buf = 0; /* buffer index for literals or lengths */ - - this.lit_bufsize = 0; - /* Size of match buffer for literals/lengths. There are 4 reasons for - * limiting lit_bufsize to 64K: - * - frequencies can be kept in 16 bit counters - * - if compression is not successful for the first block, all input - * data is still in the window so we can still emit a stored block even - * when input comes from standard input. (This can also be done for - * all blocks if lit_bufsize is not greater than 32K.) - * - if compression is not successful for a file smaller than 64K, we can - * even emit a stored file instead of a stored block (saving 5 bytes). - * This is applicable only for zip (not gzip or zlib). - * - creating new Huffman trees less frequently may not provide fast - * adaptation to changes in the input data statistics. (Take for - * example a binary file with poorly compressible code followed by - * a highly compressible string table.) Smaller buffer sizes give - * fast adaptation but have of course the overhead of transmitting - * trees more frequently. - * - I can't count above 4 - */ - - this.last_lit = 0; /* running index in l_buf */ - - this.d_buf = 0; - /* Buffer index for distances. To simplify the code, d_buf and l_buf have - * the same number of elements. To use different lengths, an extra flag - * array would be necessary. - */ - - this.opt_len = 0; /* bit length of current block with optimal trees */ - this.static_len = 0; /* bit length of current block with static trees */ - this.matches = 0; /* number of string matches in current block */ - this.insert = 0; /* bytes at end of window left to insert */ - - - this.bi_buf = 0; - /* Output buffer. bits are inserted starting at the bottom (least - * significant bits). - */ - this.bi_valid = 0; - /* Number of valid bits in bi_buf. All bits above the last valid bit - * are always zero. - */ - - // Used for window memory init. We safely ignore it for JS. That makes - // sense only for pointers and memory check tools. - //this.high_water = 0; - /* High water mark offset in window for initialized bytes -- bytes above - * this are set to zero in order to avoid memory check warnings when - * longest match routines access bytes past the input. This is then - * updated to the new high water mark. - */ -} - - -function deflateResetKeep(strm) { - var s; - - if (!strm || !strm.state) { - return err(strm, Z_STREAM_ERROR); - } - - strm.total_in = strm.total_out = 0; - strm.data_type = Z_UNKNOWN; - - s = strm.state; - s.pending = 0; - s.pending_out = 0; - - if (s.wrap < 0) { - s.wrap = -s.wrap; - /* was made negative by deflate(..., Z_FINISH); */ - } - s.status = (s.wrap ? INIT_STATE : BUSY_STATE); - strm.adler = (s.wrap === 2) ? - 0 // crc32(0, Z_NULL, 0) - : - 1; // adler32(0, Z_NULL, 0) - s.last_flush = Z_NO_FLUSH; - trees._tr_init(s); - return Z_OK; -} - - -function deflateReset(strm) { - var ret = deflateResetKeep(strm); - if (ret === Z_OK) { - lm_init(strm.state); - } - return ret; -} - - -function deflateSetHeader(strm, head) { - if (!strm || !strm.state) { return Z_STREAM_ERROR; } - if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; } - strm.state.gzhead = head; - return Z_OK; -} - - -function deflateInit2(strm, level, method, windowBits, memLevel, strategy) { - if (!strm) { // === Z_NULL - return Z_STREAM_ERROR; - } - var wrap = 1; - - if (level === Z_DEFAULT_COMPRESSION) { - level = 6; - } - - if (windowBits < 0) { /* suppress zlib wrapper */ - wrap = 0; - windowBits = -windowBits; - } - - else if (windowBits > 15) { - wrap = 2; /* write gzip wrapper instead */ - windowBits -= 16; - } - - - if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED || - windowBits < 8 || windowBits > 15 || level < 0 || level > 9 || - strategy < 0 || strategy > Z_FIXED) { - return err(strm, Z_STREAM_ERROR); - } - - - if (windowBits === 8) { - windowBits = 9; - } - /* until 256-byte window bug fixed */ - - var s = new DeflateState(); - - strm.state = s; - s.strm = strm; - - s.wrap = wrap; - s.gzhead = null; - s.w_bits = windowBits; - s.w_size = 1 << s.w_bits; - s.w_mask = s.w_size - 1; - - s.hash_bits = memLevel + 7; - s.hash_size = 1 << s.hash_bits; - s.hash_mask = s.hash_size - 1; - s.hash_shift = ~~((s.hash_bits + MIN_MATCH - 1) / MIN_MATCH); - - s.window = new utils.Buf8(s.w_size * 2); - s.head = new utils.Buf16(s.hash_size); - s.prev = new utils.Buf16(s.w_size); - - // Don't need mem init magic for JS. - //s.high_water = 0; /* nothing written to s->window yet */ - - s.lit_bufsize = 1 << (memLevel + 6); /* 16K elements by default */ - - s.pending_buf_size = s.lit_bufsize * 4; - - //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2); - //s->pending_buf = (uchf *) overlay; - s.pending_buf = new utils.Buf8(s.pending_buf_size); - - // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`) - //s->d_buf = overlay + s->lit_bufsize/sizeof(ush); - s.d_buf = 1 * s.lit_bufsize; - - //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize; - s.l_buf = (1 + 2) * s.lit_bufsize; - - s.level = level; - s.strategy = strategy; - s.method = method; - - return deflateReset(strm); -} - -function deflateInit(strm, level) { - return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY); -} - - -function deflate(strm, flush) { - var old_flush, s; - var beg, val; // for gzip header write only - - if (!strm || !strm.state || - flush > Z_BLOCK || flush < 0) { - return strm ? err(strm, Z_STREAM_ERROR) : Z_STREAM_ERROR; - } - - s = strm.state; - - if (!strm.output || - (!strm.input && strm.avail_in !== 0) || - (s.status === FINISH_STATE && flush !== Z_FINISH)) { - return err(strm, (strm.avail_out === 0) ? Z_BUF_ERROR : Z_STREAM_ERROR); - } - - s.strm = strm; /* just in case */ - old_flush = s.last_flush; - s.last_flush = flush; - - /* Write the header */ - if (s.status === INIT_STATE) { - - if (s.wrap === 2) { // GZIP header - strm.adler = 0; //crc32(0L, Z_NULL, 0); - put_byte(s, 31); - put_byte(s, 139); - put_byte(s, 8); - if (!s.gzhead) { // s->gzhead == Z_NULL - put_byte(s, 0); - put_byte(s, 0); - put_byte(s, 0); - put_byte(s, 0); - put_byte(s, 0); - put_byte(s, s.level === 9 ? 2 : - (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? - 4 : 0)); - put_byte(s, OS_CODE); - s.status = BUSY_STATE; - } - else { - 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) - ); - put_byte(s, s.gzhead.time & 0xff); - put_byte(s, (s.gzhead.time >> 8) & 0xff); - put_byte(s, (s.gzhead.time >> 16) & 0xff); - put_byte(s, (s.gzhead.time >> 24) & 0xff); - put_byte(s, s.level === 9 ? 2 : - (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ? - 4 : 0)); - put_byte(s, s.gzhead.os & 0xff); - if (s.gzhead.extra && s.gzhead.extra.length) { - put_byte(s, s.gzhead.extra.length & 0xff); - put_byte(s, (s.gzhead.extra.length >> 8) & 0xff); - } - if (s.gzhead.hcrc) { - strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0); - } - s.gzindex = 0; - s.status = EXTRA_STATE; - } - } - else // DEFLATE header - { - var header = (Z_DEFLATED + ((s.w_bits - 8) << 4)) << 8; - var level_flags = -1; - - if (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2) { - level_flags = 0; - } else if (s.level < 6) { - level_flags = 1; - } else if (s.level === 6) { - level_flags = 2; - } else { - level_flags = 3; - } - header |= (level_flags << 6); - if (s.strstart !== 0) { header |= PRESET_DICT; } - header += 31 - (header % 31); - - s.status = BUSY_STATE; - putShortMSB(s, header); - - /* Save the adler32 of the preset dictionary: */ - if (s.strstart !== 0) { - putShortMSB(s, strm.adler >>> 16); - putShortMSB(s, strm.adler & 0xffff); - } - strm.adler = 1; // adler32(0L, Z_NULL, 0); - } - } - -//#ifdef GZIP - if (s.status === EXTRA_STATE) { - if (s.gzhead.extra/* != Z_NULL*/) { - beg = s.pending; /* start of bytes to update crc */ - - while (s.gzindex < (s.gzhead.extra.length & 0xffff)) { - if (s.pending === s.pending_buf_size) { - if (s.gzhead.hcrc && s.pending > beg) { - strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); - } - flush_pending(strm); - beg = s.pending; - if (s.pending === s.pending_buf_size) { - break; - } - } - put_byte(s, s.gzhead.extra[s.gzindex] & 0xff); - s.gzindex++; - } - if (s.gzhead.hcrc && s.pending > beg) { - strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); - } - if (s.gzindex === s.gzhead.extra.length) { - s.gzindex = 0; - s.status = NAME_STATE; - } - } - else { - s.status = NAME_STATE; - } - } - if (s.status === NAME_STATE) { - if (s.gzhead.name/* != Z_NULL*/) { - beg = s.pending; /* start of bytes to update crc */ - //int val; - - do { - if (s.pending === s.pending_buf_size) { - if (s.gzhead.hcrc && s.pending > beg) { - strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); - } - flush_pending(strm); - beg = s.pending; - if (s.pending === s.pending_buf_size) { - val = 1; - break; - } - } - // JS specific: little magic to add zero terminator to end of string - if (s.gzindex < s.gzhead.name.length) { - val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff; - } else { - val = 0; - } - put_byte(s, val); - } while (val !== 0); - - if (s.gzhead.hcrc && s.pending > beg) { - strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); - } - if (val === 0) { - s.gzindex = 0; - s.status = COMMENT_STATE; - } - } - else { - s.status = COMMENT_STATE; - } - } - if (s.status === COMMENT_STATE) { - if (s.gzhead.comment/* != Z_NULL*/) { - beg = s.pending; /* start of bytes to update crc */ - //int val; - - do { - if (s.pending === s.pending_buf_size) { - if (s.gzhead.hcrc && s.pending > beg) { - strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); - } - flush_pending(strm); - beg = s.pending; - if (s.pending === s.pending_buf_size) { - val = 1; - break; - } - } - // JS specific: little magic to add zero terminator to end of string - if (s.gzindex < s.gzhead.comment.length) { - val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff; - } else { - val = 0; - } - put_byte(s, val); - } while (val !== 0); - - if (s.gzhead.hcrc && s.pending > beg) { - strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg); - } - if (val === 0) { - s.status = HCRC_STATE; - } - } - else { - s.status = HCRC_STATE; - } - } - if (s.status === HCRC_STATE) { - if (s.gzhead.hcrc) { - if (s.pending + 2 > s.pending_buf_size) { - flush_pending(strm); - } - if (s.pending + 2 <= s.pending_buf_size) { - put_byte(s, strm.adler & 0xff); - put_byte(s, (strm.adler >> 8) & 0xff); - strm.adler = 0; //crc32(0L, Z_NULL, 0); - s.status = BUSY_STATE; - } - } - else { - s.status = BUSY_STATE; - } - } -//#endif - - /* Flush as much pending output as possible */ - if (s.pending !== 0) { - flush_pending(strm); - if (strm.avail_out === 0) { - /* Since avail_out is 0, deflate will be called again with - * more output space, but possibly with both pending and - * avail_in equal to zero. There won't be anything to do, - * but this is not an error situation so make sure we - * return OK instead of BUF_ERROR at next call of deflate: - */ - s.last_flush = -1; - return Z_OK; - } - - /* Make sure there is something to do and avoid duplicate consecutive - * flushes. For repeated and useless calls with Z_FINISH, we keep - * returning Z_STREAM_END instead of Z_BUF_ERROR. - */ - } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) && - flush !== Z_FINISH) { - return err(strm, Z_BUF_ERROR); - } - - /* User must not provide more input after the first FINISH: */ - if (s.status === FINISH_STATE && strm.avail_in !== 0) { - return err(strm, Z_BUF_ERROR); - } - - /* Start a new block or continue the current one. - */ - if (strm.avail_in !== 0 || s.lookahead !== 0 || - (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) { - 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)); - - if (bstate === BS_FINISH_STARTED || bstate === BS_FINISH_DONE) { - s.status = FINISH_STATE; - } - if (bstate === BS_NEED_MORE || bstate === BS_FINISH_STARTED) { - if (strm.avail_out === 0) { - s.last_flush = -1; - /* avoid BUF_ERROR next call, see above */ - } - return Z_OK; - /* If flush != Z_NO_FLUSH && avail_out == 0, the next call - * of deflate should use the same flush parameter to make sure - * that the flush is complete. So we don't have to output an - * empty block here, this will be done at next call. This also - * ensures that for a very small output buffer, we emit at most - * one empty block. - */ - } - if (bstate === BS_BLOCK_DONE) { - if (flush === Z_PARTIAL_FLUSH) { - trees._tr_align(s); - } - else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */ - - trees._tr_stored_block(s, 0, 0, false); - /* For a full flush, this empty block will be recognized - * as a special marker by inflate_sync(). - */ - if (flush === Z_FULL_FLUSH) { - /*** CLEAR_HASH(s); ***/ /* forget history */ - zero(s.head); // Fill with NIL (= 0); - - if (s.lookahead === 0) { - s.strstart = 0; - s.block_start = 0; - s.insert = 0; - } - } - } - flush_pending(strm); - if (strm.avail_out === 0) { - s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */ - return Z_OK; - } - } - } - //Assert(strm->avail_out > 0, "bug2"); - //if (strm.avail_out <= 0) { throw new Error("bug2");} - - if (flush !== Z_FINISH) { return Z_OK; } - if (s.wrap <= 0) { return Z_STREAM_END; } - - /* Write the trailer */ - if (s.wrap === 2) { - put_byte(s, strm.adler & 0xff); - put_byte(s, (strm.adler >> 8) & 0xff); - put_byte(s, (strm.adler >> 16) & 0xff); - put_byte(s, (strm.adler >> 24) & 0xff); - put_byte(s, strm.total_in & 0xff); - put_byte(s, (strm.total_in >> 8) & 0xff); - put_byte(s, (strm.total_in >> 16) & 0xff); - put_byte(s, (strm.total_in >> 24) & 0xff); - } - else - { - putShortMSB(s, strm.adler >>> 16); - putShortMSB(s, strm.adler & 0xffff); - } - - flush_pending(strm); - /* If avail_out is zero, the application will call deflate again - * to flush the rest. - */ - if (s.wrap > 0) { s.wrap = -s.wrap; } - /* write the trailer only once! */ - return s.pending !== 0 ? Z_OK : Z_STREAM_END; -} - -function deflateEnd(strm) { - var status; - - if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) { - return Z_STREAM_ERROR; - } - - status = strm.state.status; - if (status !== INIT_STATE && - status !== EXTRA_STATE && - status !== NAME_STATE && - status !== COMMENT_STATE && - status !== HCRC_STATE && - status !== BUSY_STATE && - status !== FINISH_STATE - ) { - return err(strm, Z_STREAM_ERROR); - } - - strm.state = null; - - return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK; -} - - -/* ========================================================================= - * Initializes the compression dictionary from the given byte - * sequence without producing any compressed output. - */ -function deflateSetDictionary(strm, dictionary) { - var dictLength = dictionary.length; - - var s; - var str, n; - var wrap; - var avail; - var next; - var input; - var tmpDict; - - if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) { - return Z_STREAM_ERROR; - } - - s = strm.state; - wrap = s.wrap; - - if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) { - return Z_STREAM_ERROR; - } - - /* when using zlib wrappers, compute Adler-32 for provided dictionary */ - if (wrap === 1) { - /* adler32(strm->adler, dictionary, dictLength); */ - strm.adler = adler32(strm.adler, dictionary, dictLength, 0); - } - - s.wrap = 0; /* avoid computing Adler-32 in read_buf */ - - /* if dictionary would fill window, just replace the history */ - if (dictLength >= s.w_size) { - if (wrap === 0) { /* already empty otherwise */ - /*** CLEAR_HASH(s); ***/ - zero(s.head); // Fill with NIL (= 0); - s.strstart = 0; - s.block_start = 0; - s.insert = 0; - } - /* use the tail */ - // dictionary = dictionary.slice(dictLength - s.w_size); - tmpDict = new utils.Buf8(s.w_size); - utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0); - dictionary = tmpDict; - dictLength = s.w_size; - } - /* insert dictionary into window and hash */ - avail = strm.avail_in; - next = strm.next_in; - input = strm.input; - strm.avail_in = dictLength; - strm.next_in = 0; - strm.input = dictionary; - fill_window(s); - while (s.lookahead >= MIN_MATCH) { - str = s.strstart; - n = s.lookahead - (MIN_MATCH - 1); - do { - /* UPDATE_HASH(s, s->ins_h, s->window[str + MIN_MATCH-1]); */ - s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + MIN_MATCH - 1]) & s.hash_mask; - - s.prev[str & s.w_mask] = s.head[s.ins_h]; - - s.head[s.ins_h] = str; - str++; - } while (--n); - s.strstart = str; - s.lookahead = MIN_MATCH - 1; - fill_window(s); - } - s.strstart += s.lookahead; - s.block_start = s.strstart; - s.insert = s.lookahead; - s.lookahead = 0; - s.match_length = s.prev_length = MIN_MATCH - 1; - s.match_available = 0; - strm.next_in = next; - strm.input = input; - strm.avail_in = avail; - s.wrap = wrap; - return Z_OK; -} - - -exports.deflateInit = deflateInit; -exports.deflateInit2 = deflateInit2; -exports.deflateReset = deflateReset; -exports.deflateResetKeep = deflateResetKeep; -exports.deflateSetHeader = deflateSetHeader; -exports.deflate = deflate; -exports.deflateEnd = deflateEnd; -exports.deflateSetDictionary = deflateSetDictionary; -exports.deflateInfo = 'pako deflate (from Nodeca project)'; - -/* Not implemented -exports.deflateBound = deflateBound; -exports.deflateCopy = deflateCopy; -exports.deflateParams = deflateParams; -exports.deflatePending = deflatePending; -exports.deflatePrime = deflatePrime; -exports.deflateTune = deflateTune; -*/ - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inffast.js": -/*!****************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inffast.js ***! - \****************************************************************************/ -/***/ ((module) => { - -"use strict"; - - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -// See state defs from inflate.js -var BAD = 30; /* got a data error -- remain here until reset */ -var TYPE = 12; /* i: waiting for type bits, including last-flag bit */ - -/* - Decode literal, length, and distance codes and write out the resulting - literal and match bytes until either not enough input or output is - available, an end-of-block is encountered, or a data error is encountered. - When large enough input and output buffers are supplied to inflate(), for - example, a 16K input buffer and a 64K output buffer, more than 95% of the - inflate execution time is spent in this routine. - - Entry assumptions: - - state.mode === LEN - strm.avail_in >= 6 - strm.avail_out >= 258 - start >= strm.avail_out - state.bits < 8 - - On return, state.mode is one of: - - LEN -- ran out of enough output space or enough available input - TYPE -- reached end of block code, inflate() to interpret next block - BAD -- error in block data - - Notes: - - - The maximum input bits used by a length/distance pair is 15 bits for the - length code, 5 bits for the length extra, 15 bits for the distance code, - and 13 bits for the distance extra. This totals 48 bits, or six bytes. - Therefore if strm.avail_in >= 6, then there is enough input to avoid - checking for available input while decoding. - - - The maximum bytes that a single length/distance pair can output is 258 - bytes, which is the maximum length that can be coded. inflate_fast() - requires strm.avail_out >= 258 for each loop to avoid checking for - output space. - */ -module.exports = function inflate_fast(strm, start) { - var state; - var _in; /* local strm.input */ - var last; /* have enough input while in < last */ - var _out; /* local strm.output */ - var beg; /* inflate()'s initial strm.output */ - var end; /* while out < end, enough space available */ -//#ifdef INFLATE_STRICT - var dmax; /* maximum distance from zlib header */ -//#endif - var wsize; /* window size or zero if not using window */ - var whave; /* valid bytes in the window */ - var wnext; /* window write index */ - // Use `s_window` instead `window`, avoid conflict with instrumentation tools - var s_window; /* allocated sliding window, if wsize != 0 */ - var hold; /* local strm.hold */ - var bits; /* local strm.bits */ - var lcode; /* local strm.lencode */ - var dcode; /* local strm.distcode */ - var lmask; /* mask for first level of length codes */ - var dmask; /* mask for first level of distance codes */ - var here; /* retrieved table entry */ - var op; /* code bits, operation, extra bits, or */ - /* window position, window bytes to copy */ - var len; /* match length, unused bytes */ - var dist; /* match distance */ - var from; /* where to copy match from */ - var from_source; - - - var input, output; // JS specific, because we have no pointers - - /* copy state to local variables */ - state = strm.state; - //here = state.here; - _in = strm.next_in; - input = strm.input; - last = _in + (strm.avail_in - 5); - _out = strm.next_out; - output = strm.output; - beg = _out - (start - strm.avail_out); - end = _out + (strm.avail_out - 257); -//#ifdef INFLATE_STRICT - dmax = state.dmax; -//#endif - wsize = state.wsize; - whave = state.whave; - wnext = state.wnext; - s_window = state.window; - hold = state.hold; - bits = state.bits; - lcode = state.lencode; - dcode = state.distcode; - lmask = (1 << state.lenbits) - 1; - dmask = (1 << state.distbits) - 1; - - - /* decode literals and length/distances until end-of-block or not enough - input data or output space */ - - top: - do { - if (bits < 15) { - hold += input[_in++] << bits; - bits += 8; - hold += input[_in++] << bits; - bits += 8; - } - - here = lcode[hold & lmask]; - - dolen: - for (;;) { // Goto emulation - op = here >>> 24/*here.bits*/; - hold >>>= op; - bits -= op; - op = (here >>> 16) & 0xff/*here.op*/; - if (op === 0) { /* literal */ - //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? - // "inflate: literal '%c'\n" : - // "inflate: literal 0x%02x\n", here.val)); - output[_out++] = here & 0xffff/*here.val*/; - } - else if (op & 16) { /* length base */ - len = here & 0xffff/*here.val*/; - op &= 15; /* number of extra bits */ - if (op) { - if (bits < op) { - hold += input[_in++] << bits; - bits += 8; - } - len += hold & ((1 << op) - 1); - hold >>>= op; - bits -= op; - } - //Tracevv((stderr, "inflate: length %u\n", len)); - if (bits < 15) { - hold += input[_in++] << bits; - bits += 8; - hold += input[_in++] << bits; - bits += 8; - } - here = dcode[hold & dmask]; - - dodist: - for (;;) { // goto emulation - op = here >>> 24/*here.bits*/; - hold >>>= op; - bits -= op; - op = (here >>> 16) & 0xff/*here.op*/; - - if (op & 16) { /* distance base */ - dist = here & 0xffff/*here.val*/; - op &= 15; /* number of extra bits */ - if (bits < op) { - hold += input[_in++] << bits; - bits += 8; - if (bits < op) { - hold += input[_in++] << bits; - bits += 8; - } - } - dist += hold & ((1 << op) - 1); -//#ifdef INFLATE_STRICT - if (dist > dmax) { - strm.msg = 'invalid distance too far back'; - state.mode = BAD; - break top; - } -//#endif - hold >>>= op; - bits -= op; - //Tracevv((stderr, "inflate: distance %u\n", dist)); - op = _out - beg; /* max distance in output */ - if (dist > op) { /* see if copy from window */ - op = dist - op; /* distance back in window */ - if (op > whave) { - if (state.sane) { - strm.msg = 'invalid distance too far back'; - state.mode = BAD; - break top; - } - -// (!) This block is disabled in zlib defaults, -// don't enable it for binary compatibility -//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR -// if (len <= op - whave) { -// do { -// output[_out++] = 0; -// } while (--len); -// continue top; -// } -// len -= op - whave; -// do { -// output[_out++] = 0; -// } while (--op > whave); -// if (op === 0) { -// from = _out - dist; -// do { -// output[_out++] = output[from++]; -// } while (--len); -// continue top; -// } -//#endif - } - from = 0; // window index - from_source = s_window; - if (wnext === 0) { /* very common case */ - from += wsize - op; - if (op < len) { /* some from window */ - len -= op; - do { - output[_out++] = s_window[from++]; - } while (--op); - from = _out - dist; /* rest from output */ - from_source = output; - } - } - else if (wnext < op) { /* wrap around window */ - from += wsize + wnext - op; - op -= wnext; - if (op < len) { /* some from end of window */ - len -= op; - do { - output[_out++] = s_window[from++]; - } while (--op); - from = 0; - if (wnext < len) { /* some from start of window */ - op = wnext; - len -= op; - do { - output[_out++] = s_window[from++]; - } while (--op); - from = _out - dist; /* rest from output */ - from_source = output; - } - } - } - else { /* contiguous in window */ - from += wnext - op; - if (op < len) { /* some from window */ - len -= op; - do { - output[_out++] = s_window[from++]; - } while (--op); - from = _out - dist; /* rest from output */ - from_source = output; - } - } - while (len > 2) { - output[_out++] = from_source[from++]; - output[_out++] = from_source[from++]; - output[_out++] = from_source[from++]; - len -= 3; - } - if (len) { - output[_out++] = from_source[from++]; - if (len > 1) { - output[_out++] = from_source[from++]; - } - } - } - else { - from = _out - dist; /* copy direct from output */ - do { /* minimum length is three */ - output[_out++] = output[from++]; - output[_out++] = output[from++]; - output[_out++] = output[from++]; - len -= 3; - } while (len > 2); - if (len) { - output[_out++] = output[from++]; - if (len > 1) { - output[_out++] = output[from++]; - } - } - } - } - else if ((op & 64) === 0) { /* 2nd level distance code */ - here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; - continue dodist; - } - else { - strm.msg = 'invalid distance code'; - state.mode = BAD; - break top; - } - - break; // need to emulate goto via "continue" - } - } - else if ((op & 64) === 0) { /* 2nd level length code */ - here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))]; - continue dolen; - } - else if (op & 32) { /* end-of-block */ - //Tracevv((stderr, "inflate: end of block\n")); - state.mode = TYPE; - break top; - } - else { - strm.msg = 'invalid literal/length code'; - state.mode = BAD; - break top; - } - - break; // need to emulate goto via "continue" - } - } while (_in < last && _out < end); - - /* return unused bytes (on entry, bits < 8, so in won't go too far back) */ - len = bits >> 3; - _in -= len; - bits -= len << 3; - hold &= (1 << bits) - 1; - - /* update state and return */ - strm.next_in = _in; - strm.next_out = _out; - strm.avail_in = (_in < last ? 5 + (last - _in) : 5 - (_in - last)); - strm.avail_out = (_out < end ? 257 + (end - _out) : 257 - (_out - end)); - state.hold = hold; - state.bits = bits; - return; -}; - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inflate.js": -/*!****************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inflate.js ***! - \****************************************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -var utils = __webpack_require__(/*! ../utils/common */ "./node_modules/browserify-zlib/node_modules/pako/lib/utils/common.js"); -var adler32 = __webpack_require__(/*! ./adler32 */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/adler32.js"); -var crc32 = __webpack_require__(/*! ./crc32 */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/crc32.js"); -var inflate_fast = __webpack_require__(/*! ./inffast */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inffast.js"); -var inflate_table = __webpack_require__(/*! ./inftrees */ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inftrees.js"); - -var CODES = 0; -var LENS = 1; -var DISTS = 2; - -/* Public constants ==========================================================*/ -/* ===========================================================================*/ - - -/* Allowed flush values; see deflate() and inflate() below for details */ -//var Z_NO_FLUSH = 0; -//var Z_PARTIAL_FLUSH = 1; -//var Z_SYNC_FLUSH = 2; -//var Z_FULL_FLUSH = 3; -var Z_FINISH = 4; -var Z_BLOCK = 5; -var Z_TREES = 6; - - -/* Return codes for the compression/decompression functions. Negative values - * are errors, positive values are used for special but normal events. - */ -var Z_OK = 0; -var Z_STREAM_END = 1; -var Z_NEED_DICT = 2; -//var Z_ERRNO = -1; -var Z_STREAM_ERROR = -2; -var Z_DATA_ERROR = -3; -var Z_MEM_ERROR = -4; -var Z_BUF_ERROR = -5; -//var Z_VERSION_ERROR = -6; - -/* The deflate compression method */ -var Z_DEFLATED = 8; - - -/* STATES ====================================================================*/ -/* ===========================================================================*/ - - -var HEAD = 1; /* i: waiting for magic header */ -var FLAGS = 2; /* i: waiting for method and flags (gzip) */ -var TIME = 3; /* i: waiting for modification time (gzip) */ -var OS = 4; /* i: waiting for extra flags and operating system (gzip) */ -var EXLEN = 5; /* i: waiting for extra length (gzip) */ -var EXTRA = 6; /* i: waiting for extra bytes (gzip) */ -var NAME = 7; /* i: waiting for end of file name (gzip) */ -var COMMENT = 8; /* i: waiting for end of comment (gzip) */ -var HCRC = 9; /* i: waiting for header crc (gzip) */ -var DICTID = 10; /* i: waiting for dictionary check value */ -var DICT = 11; /* waiting for inflateSetDictionary() call */ -var TYPE = 12; /* i: waiting for type bits, including last-flag bit */ -var TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */ -var STORED = 14; /* i: waiting for stored size (length and complement) */ -var COPY_ = 15; /* i/o: same as COPY below, but only first time in */ -var COPY = 16; /* i/o: waiting for input or output to copy stored block */ -var TABLE = 17; /* i: waiting for dynamic block table lengths */ -var LENLENS = 18; /* i: waiting for code length code lengths */ -var CODELENS = 19; /* i: waiting for length/lit and distance code lengths */ -var LEN_ = 20; /* i: same as LEN below, but only first time in */ -var LEN = 21; /* i: waiting for length/lit/eob code */ -var LENEXT = 22; /* i: waiting for length extra bits */ -var DIST = 23; /* i: waiting for distance code */ -var DISTEXT = 24; /* i: waiting for distance extra bits */ -var MATCH = 25; /* o: waiting for output space to copy string */ -var LIT = 26; /* o: waiting for output space to write literal */ -var CHECK = 27; /* i: waiting for 32-bit check value */ -var LENGTH = 28; /* i: waiting for 32-bit length (gzip) */ -var DONE = 29; /* finished check, done -- remain here until reset */ -var BAD = 30; /* got a data error -- remain here until reset */ -var MEM = 31; /* got an inflate() memory error -- remain here until reset */ -var SYNC = 32; /* looking for synchronization bytes to restart inflate() */ - -/* ===========================================================================*/ - - - -var ENOUGH_LENS = 852; -var ENOUGH_DISTS = 592; -//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); - -var MAX_WBITS = 15; -/* 32K LZ77 window */ -var DEF_WBITS = MAX_WBITS; - - -function zswap32(q) { - return (((q >>> 24) & 0xff) + - ((q >>> 8) & 0xff00) + - ((q & 0xff00) << 8) + - ((q & 0xff) << 24)); -} - - -function InflateState() { - this.mode = 0; /* current inflate mode */ - this.last = false; /* true if processing last block */ - this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */ - this.havedict = false; /* true if dictionary provided */ - this.flags = 0; /* gzip header method and flags (0 if zlib) */ - this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */ - this.check = 0; /* protected copy of check value */ - this.total = 0; /* protected copy of output count */ - // TODO: may be {} - this.head = null; /* where to save gzip header information */ - - /* sliding window */ - this.wbits = 0; /* log base 2 of requested window size */ - this.wsize = 0; /* window size or zero if not using window */ - this.whave = 0; /* valid bytes in the window */ - this.wnext = 0; /* window write index */ - this.window = null; /* allocated sliding window, if needed */ - - /* bit accumulator */ - this.hold = 0; /* input bit accumulator */ - this.bits = 0; /* number of bits in "in" */ - - /* for string and stored block copying */ - this.length = 0; /* literal or length of data to copy */ - this.offset = 0; /* distance back to copy string from */ - - /* for table and code decoding */ - this.extra = 0; /* extra bits needed */ - - /* fixed and dynamic code tables */ - this.lencode = null; /* starting table for length/literal codes */ - this.distcode = null; /* starting table for distance codes */ - this.lenbits = 0; /* index bits for lencode */ - this.distbits = 0; /* index bits for distcode */ - - /* dynamic table building */ - this.ncode = 0; /* number of code length code lengths */ - this.nlen = 0; /* number of length code lengths */ - this.ndist = 0; /* number of distance code lengths */ - this.have = 0; /* number of code lengths in lens[] */ - this.next = null; /* next available space in codes[] */ - - this.lens = new utils.Buf16(320); /* temporary storage for code lengths */ - this.work = new utils.Buf16(288); /* work area for code table building */ - - /* - because we don't have pointers in js, we use lencode and distcode directly - as buffers so we don't need codes - */ - //this.codes = new utils.Buf32(ENOUGH); /* space for code tables */ - this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */ - this.distdyn = null; /* dynamic table for distance codes (JS specific) */ - this.sane = 0; /* if false, allow invalid distance too far */ - this.back = 0; /* bits back of last unprocessed length/lit */ - this.was = 0; /* initial length of match */ -} - -function inflateResetKeep(strm) { - var state; - - if (!strm || !strm.state) { return Z_STREAM_ERROR; } - state = strm.state; - strm.total_in = strm.total_out = state.total = 0; - strm.msg = ''; /*Z_NULL*/ - if (state.wrap) { /* to support ill-conceived Java test suite */ - strm.adler = state.wrap & 1; - } - state.mode = HEAD; - state.last = 0; - state.havedict = 0; - state.dmax = 32768; - state.head = null/*Z_NULL*/; - state.hold = 0; - state.bits = 0; - //state.lencode = state.distcode = state.next = state.codes; - state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS); - state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS); - - state.sane = 1; - state.back = -1; - //Tracev((stderr, "inflate: reset\n")); - return Z_OK; -} - -function inflateReset(strm) { - var state; - - if (!strm || !strm.state) { return Z_STREAM_ERROR; } - state = strm.state; - state.wsize = 0; - state.whave = 0; - state.wnext = 0; - return inflateResetKeep(strm); - -} - -function inflateReset2(strm, windowBits) { - var wrap; - var state; - - /* get the state */ - if (!strm || !strm.state) { return Z_STREAM_ERROR; } - state = strm.state; - - /* extract wrap request from windowBits parameter */ - if (windowBits < 0) { - wrap = 0; - windowBits = -windowBits; - } - else { - wrap = (windowBits >> 4) + 1; - if (windowBits < 48) { - windowBits &= 15; - } - } - - /* set number of window bits, free window if different */ - if (windowBits && (windowBits < 8 || windowBits > 15)) { - return Z_STREAM_ERROR; - } - if (state.window !== null && state.wbits !== windowBits) { - state.window = null; - } - - /* update state and reset the rest of it */ - state.wrap = wrap; - state.wbits = windowBits; - return inflateReset(strm); -} - -function inflateInit2(strm, windowBits) { - var ret; - var state; - - if (!strm) { return Z_STREAM_ERROR; } - //strm.msg = Z_NULL; /* in case we return an error */ - - state = new InflateState(); - - //if (state === Z_NULL) return Z_MEM_ERROR; - //Tracev((stderr, "inflate: allocated\n")); - strm.state = state; - state.window = null/*Z_NULL*/; - ret = inflateReset2(strm, windowBits); - if (ret !== Z_OK) { - strm.state = null/*Z_NULL*/; - } - return ret; -} - -function inflateInit(strm) { - return inflateInit2(strm, DEF_WBITS); -} - - -/* - Return state with length and distance decoding tables and index sizes set to - fixed code decoding. Normally this returns fixed tables from inffixed.h. - If BUILDFIXED is defined, then instead this routine builds the tables the - first time it's called, and returns those tables the first time and - thereafter. This reduces the size of the code by about 2K bytes, in - exchange for a little execution time. However, BUILDFIXED should not be - used for threaded applications, since the rewriting of the tables and virgin - may not be thread-safe. - */ -var virgin = true; - -var lenfix, distfix; // We have no pointers in JS, so keep tables separate - -function fixedtables(state) { - /* build fixed huffman tables if first call (may not be thread safe) */ - if (virgin) { - var sym; - - lenfix = new utils.Buf32(512); - distfix = new utils.Buf32(32); - - /* literal/length table */ - sym = 0; - while (sym < 144) { state.lens[sym++] = 8; } - while (sym < 256) { state.lens[sym++] = 9; } - while (sym < 280) { state.lens[sym++] = 7; } - while (sym < 288) { state.lens[sym++] = 8; } - - inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 }); - - /* distance table */ - sym = 0; - while (sym < 32) { state.lens[sym++] = 5; } - - inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 }); - - /* do this just once */ - virgin = false; - } - - state.lencode = lenfix; - state.lenbits = 9; - state.distcode = distfix; - state.distbits = 5; -} - - -/* - Update the window with the last wsize (normally 32K) bytes written before - returning. If window does not exist yet, create it. This is only called - when a window is already in use, or when output has been written during this - inflate call, but the end of the deflate stream has not been reached yet. - It is also called to create a window for dictionary data when a dictionary - is loaded. - - Providing output buffers larger than 32K to inflate() should provide a speed - advantage, since only the last 32K of output is copied to the sliding window - upon return from inflate(), and since all distances after the first 32K of - output will fall in the output data, making match copies simpler and faster. - The advantage may be dependent on the size of the processor's data caches. - */ -function updatewindow(strm, src, end, copy) { - var dist; - var state = strm.state; - - /* if it hasn't been done already, allocate space for the window */ - if (state.window === null) { - state.wsize = 1 << state.wbits; - state.wnext = 0; - state.whave = 0; - - state.window = new utils.Buf8(state.wsize); - } - - /* copy state->wsize or less output bytes into the circular window */ - if (copy >= state.wsize) { - utils.arraySet(state.window, src, end - state.wsize, state.wsize, 0); - state.wnext = 0; - state.whave = state.wsize; - } - else { - dist = state.wsize - state.wnext; - if (dist > copy) { - dist = copy; - } - //zmemcpy(state->window + state->wnext, end - copy, dist); - utils.arraySet(state.window, src, end - copy, dist, state.wnext); - copy -= dist; - if (copy) { - //zmemcpy(state->window, end - copy, copy); - utils.arraySet(state.window, src, end - copy, copy, 0); - state.wnext = copy; - state.whave = state.wsize; - } - else { - state.wnext += dist; - if (state.wnext === state.wsize) { state.wnext = 0; } - if (state.whave < state.wsize) { state.whave += dist; } - } - } - return 0; -} - -function inflate(strm, flush) { - var state; - var input, output; // input/output buffers - var next; /* next input INDEX */ - var put; /* next output INDEX */ - var have, left; /* available input and output */ - var hold; /* bit buffer */ - var bits; /* bits in bit buffer */ - var _in, _out; /* save starting available input and output */ - var copy; /* number of stored or match bytes to copy */ - var from; /* where to copy match bytes from */ - var from_source; - var here = 0; /* current decoding table entry */ - var here_bits, here_op, here_val; // paked "here" denormalized (JS specific) - //var last; /* parent table entry */ - var last_bits, last_op, last_val; // paked "last" denormalized (JS specific) - var len; /* length to copy for repeats, bits to drop */ - var ret; /* return code */ - var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */ - var opts; - - var n; // temporary var for NEED_BITS - - var order = /* permutation of code lengths */ - [ 16, 17, 18, 0, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3, 13, 2, 14, 1, 15 ]; - - - if (!strm || !strm.state || !strm.output || - (!strm.input && strm.avail_in !== 0)) { - return Z_STREAM_ERROR; - } - - state = strm.state; - if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */ - - - //--- LOAD() --- - put = strm.next_out; - output = strm.output; - left = strm.avail_out; - next = strm.next_in; - input = strm.input; - have = strm.avail_in; - hold = state.hold; - bits = state.bits; - //--- - - _in = have; - _out = left; - ret = Z_OK; - - inf_leave: // goto emulation - for (;;) { - switch (state.mode) { - case HEAD: - if (state.wrap === 0) { - state.mode = TYPEDO; - break; - } - //=== NEEDBITS(16); - while (bits < 16) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */ - state.check = 0/*crc32(0L, Z_NULL, 0)*/; - //=== CRC2(state.check, hold); - hbuf[0] = hold & 0xff; - hbuf[1] = (hold >>> 8) & 0xff; - state.check = crc32(state.check, hbuf, 2, 0); - //===// - - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - state.mode = FLAGS; - break; - } - state.flags = 0; /* expect zlib header */ - if (state.head) { - state.head.done = false; - } - if (!(state.wrap & 1) || /* check if zlib header allowed */ - (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) { - strm.msg = 'incorrect header check'; - state.mode = BAD; - break; - } - if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) { - strm.msg = 'unknown compression method'; - state.mode = BAD; - break; - } - //--- DROPBITS(4) ---// - hold >>>= 4; - bits -= 4; - //---// - len = (hold & 0x0f)/*BITS(4)*/ + 8; - if (state.wbits === 0) { - state.wbits = len; - } - else if (len > state.wbits) { - strm.msg = 'invalid window size'; - state.mode = BAD; - break; - } - state.dmax = 1 << len; - //Tracev((stderr, "inflate: zlib header ok\n")); - strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; - state.mode = hold & 0x200 ? DICTID : TYPE; - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - break; - case FLAGS: - //=== NEEDBITS(16); */ - while (bits < 16) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - state.flags = hold; - if ((state.flags & 0xff) !== Z_DEFLATED) { - strm.msg = 'unknown compression method'; - state.mode = BAD; - break; - } - if (state.flags & 0xe000) { - strm.msg = 'unknown header flags set'; - state.mode = BAD; - break; - } - if (state.head) { - state.head.text = ((hold >> 8) & 1); - } - if (state.flags & 0x0200) { - //=== CRC2(state.check, hold); - hbuf[0] = hold & 0xff; - hbuf[1] = (hold >>> 8) & 0xff; - state.check = crc32(state.check, hbuf, 2, 0); - //===// - } - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - state.mode = TIME; - /* falls through */ - case TIME: - //=== NEEDBITS(32); */ - while (bits < 32) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - if (state.head) { - state.head.time = hold; - } - if (state.flags & 0x0200) { - //=== CRC4(state.check, hold) - hbuf[0] = hold & 0xff; - hbuf[1] = (hold >>> 8) & 0xff; - hbuf[2] = (hold >>> 16) & 0xff; - hbuf[3] = (hold >>> 24) & 0xff; - state.check = crc32(state.check, hbuf, 4, 0); - //=== - } - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - state.mode = OS; - /* falls through */ - case OS: - //=== NEEDBITS(16); */ - while (bits < 16) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - if (state.head) { - state.head.xflags = (hold & 0xff); - state.head.os = (hold >> 8); - } - if (state.flags & 0x0200) { - //=== CRC2(state.check, hold); - hbuf[0] = hold & 0xff; - hbuf[1] = (hold >>> 8) & 0xff; - state.check = crc32(state.check, hbuf, 2, 0); - //===// - } - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - state.mode = EXLEN; - /* falls through */ - case EXLEN: - if (state.flags & 0x0400) { - //=== NEEDBITS(16); */ - while (bits < 16) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - state.length = hold; - if (state.head) { - state.head.extra_len = hold; - } - if (state.flags & 0x0200) { - //=== CRC2(state.check, hold); - hbuf[0] = hold & 0xff; - hbuf[1] = (hold >>> 8) & 0xff; - state.check = crc32(state.check, hbuf, 2, 0); - //===// - } - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - } - else if (state.head) { - state.head.extra = null/*Z_NULL*/; - } - state.mode = EXTRA; - /* falls through */ - case EXTRA: - if (state.flags & 0x0400) { - copy = state.length; - if (copy > have) { copy = have; } - if (copy) { - if (state.head) { - len = state.head.extra_len - state.length; - if (!state.head.extra) { - // Use untyped array for more convenient processing later - state.head.extra = new Array(state.head.extra_len); - } - utils.arraySet( - state.head.extra, - input, - next, - // extra field is limited to 65536 bytes - // - no need for additional size check - copy, - /*len + copy > state.head.extra_max - len ? state.head.extra_max : copy,*/ - len - ); - //zmemcpy(state.head.extra + len, next, - // len + copy > state.head.extra_max ? - // state.head.extra_max - len : copy); - } - if (state.flags & 0x0200) { - state.check = crc32(state.check, input, copy, next); - } - have -= copy; - next += copy; - state.length -= copy; - } - if (state.length) { break inf_leave; } - } - state.length = 0; - state.mode = NAME; - /* falls through */ - case NAME: - if (state.flags & 0x0800) { - if (have === 0) { break inf_leave; } - copy = 0; - do { - // TODO: 2 or 1 bytes? - len = input[next + copy++]; - /* use constant limit because in js we should not preallocate memory */ - if (state.head && len && - (state.length < 65536 /*state.head.name_max*/)) { - state.head.name += String.fromCharCode(len); - } - } while (len && copy < have); - - if (state.flags & 0x0200) { - state.check = crc32(state.check, input, copy, next); - } - have -= copy; - next += copy; - if (len) { break inf_leave; } - } - else if (state.head) { - state.head.name = null; - } - state.length = 0; - state.mode = COMMENT; - /* falls through */ - case COMMENT: - if (state.flags & 0x1000) { - if (have === 0) { break inf_leave; } - copy = 0; - do { - len = input[next + copy++]; - /* use constant limit because in js we should not preallocate memory */ - if (state.head && len && - (state.length < 65536 /*state.head.comm_max*/)) { - state.head.comment += String.fromCharCode(len); - } - } while (len && copy < have); - if (state.flags & 0x0200) { - state.check = crc32(state.check, input, copy, next); - } - have -= copy; - next += copy; - if (len) { break inf_leave; } - } - else if (state.head) { - state.head.comment = null; - } - state.mode = HCRC; - /* falls through */ - case HCRC: - if (state.flags & 0x0200) { - //=== NEEDBITS(16); */ - while (bits < 16) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - if (hold !== (state.check & 0xffff)) { - strm.msg = 'header crc mismatch'; - state.mode = BAD; - break; - } - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - } - if (state.head) { - state.head.hcrc = ((state.flags >> 9) & 1); - state.head.done = true; - } - strm.adler = state.check = 0; - state.mode = TYPE; - break; - case DICTID: - //=== NEEDBITS(32); */ - while (bits < 32) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - strm.adler = state.check = zswap32(hold); - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - state.mode = DICT; - /* falls through */ - case DICT: - if (state.havedict === 0) { - //--- RESTORE() --- - strm.next_out = put; - strm.avail_out = left; - strm.next_in = next; - strm.avail_in = have; - state.hold = hold; - state.bits = bits; - //--- - return Z_NEED_DICT; - } - strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/; - state.mode = TYPE; - /* falls through */ - case TYPE: - if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; } - /* falls through */ - case TYPEDO: - if (state.last) { - //--- BYTEBITS() ---// - hold >>>= bits & 7; - bits -= bits & 7; - //---// - state.mode = CHECK; - break; - } - //=== NEEDBITS(3); */ - while (bits < 3) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - state.last = (hold & 0x01)/*BITS(1)*/; - //--- DROPBITS(1) ---// - hold >>>= 1; - bits -= 1; - //---// - - switch ((hold & 0x03)/*BITS(2)*/) { - case 0: /* stored block */ - //Tracev((stderr, "inflate: stored block%s\n", - // state.last ? " (last)" : "")); - state.mode = STORED; - break; - case 1: /* fixed block */ - fixedtables(state); - //Tracev((stderr, "inflate: fixed codes block%s\n", - // state.last ? " (last)" : "")); - state.mode = LEN_; /* decode codes */ - if (flush === Z_TREES) { - //--- DROPBITS(2) ---// - hold >>>= 2; - bits -= 2; - //---// - break inf_leave; - } - break; - case 2: /* dynamic block */ - //Tracev((stderr, "inflate: dynamic codes block%s\n", - // state.last ? " (last)" : "")); - state.mode = TABLE; - break; - case 3: - strm.msg = 'invalid block type'; - state.mode = BAD; - } - //--- DROPBITS(2) ---// - hold >>>= 2; - bits -= 2; - //---// - break; - case STORED: - //--- BYTEBITS() ---// /* go to byte boundary */ - hold >>>= bits & 7; - bits -= bits & 7; - //---// - //=== NEEDBITS(32); */ - while (bits < 32) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) { - strm.msg = 'invalid stored block lengths'; - state.mode = BAD; - break; - } - state.length = hold & 0xffff; - //Tracev((stderr, "inflate: stored length %u\n", - // state.length)); - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - state.mode = COPY_; - if (flush === Z_TREES) { break inf_leave; } - /* falls through */ - case COPY_: - state.mode = COPY; - /* falls through */ - case COPY: - copy = state.length; - if (copy) { - if (copy > have) { copy = have; } - if (copy > left) { copy = left; } - if (copy === 0) { break inf_leave; } - //--- zmemcpy(put, next, copy); --- - utils.arraySet(output, input, next, copy, put); - //---// - have -= copy; - next += copy; - left -= copy; - put += copy; - state.length -= copy; - break; - } - //Tracev((stderr, "inflate: stored end\n")); - state.mode = TYPE; - break; - case TABLE: - //=== NEEDBITS(14); */ - while (bits < 14) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257; - //--- DROPBITS(5) ---// - hold >>>= 5; - bits -= 5; - //---// - state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1; - //--- DROPBITS(5) ---// - hold >>>= 5; - bits -= 5; - //---// - state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4; - //--- DROPBITS(4) ---// - hold >>>= 4; - bits -= 4; - //---// -//#ifndef PKZIP_BUG_WORKAROUND - if (state.nlen > 286 || state.ndist > 30) { - strm.msg = 'too many length or distance symbols'; - state.mode = BAD; - break; - } -//#endif - //Tracev((stderr, "inflate: table sizes ok\n")); - state.have = 0; - state.mode = LENLENS; - /* falls through */ - case LENLENS: - while (state.have < state.ncode) { - //=== NEEDBITS(3); - while (bits < 3) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - state.lens[order[state.have++]] = (hold & 0x07);//BITS(3); - //--- DROPBITS(3) ---// - hold >>>= 3; - bits -= 3; - //---// - } - while (state.have < 19) { - state.lens[order[state.have++]] = 0; - } - // We have separate tables & no pointers. 2 commented lines below not needed. - //state.next = state.codes; - //state.lencode = state.next; - // Switch to use dynamic table - state.lencode = state.lendyn; - state.lenbits = 7; - - opts = { bits: state.lenbits }; - ret = inflate_table(CODES, state.lens, 0, 19, state.lencode, 0, state.work, opts); - state.lenbits = opts.bits; - - if (ret) { - strm.msg = 'invalid code lengths set'; - state.mode = BAD; - break; - } - //Tracev((stderr, "inflate: code lengths ok\n")); - state.have = 0; - state.mode = CODELENS; - /* falls through */ - case CODELENS: - while (state.have < state.nlen + state.ndist) { - for (;;) { - here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/ - here_bits = here >>> 24; - here_op = (here >>> 16) & 0xff; - here_val = here & 0xffff; - - if ((here_bits) <= bits) { break; } - //--- PULLBYTE() ---// - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - //---// - } - if (here_val < 16) { - //--- DROPBITS(here.bits) ---// - hold >>>= here_bits; - bits -= here_bits; - //---// - state.lens[state.have++] = here_val; - } - else { - if (here_val === 16) { - //=== NEEDBITS(here.bits + 2); - n = here_bits + 2; - while (bits < n) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - //--- DROPBITS(here.bits) ---// - hold >>>= here_bits; - bits -= here_bits; - //---// - if (state.have === 0) { - strm.msg = 'invalid bit length repeat'; - state.mode = BAD; - break; - } - len = state.lens[state.have - 1]; - copy = 3 + (hold & 0x03);//BITS(2); - //--- DROPBITS(2) ---// - hold >>>= 2; - bits -= 2; - //---// - } - else if (here_val === 17) { - //=== NEEDBITS(here.bits + 3); - n = here_bits + 3; - while (bits < n) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - //--- DROPBITS(here.bits) ---// - hold >>>= here_bits; - bits -= here_bits; - //---// - len = 0; - copy = 3 + (hold & 0x07);//BITS(3); - //--- DROPBITS(3) ---// - hold >>>= 3; - bits -= 3; - //---// - } - else { - //=== NEEDBITS(here.bits + 7); - n = here_bits + 7; - while (bits < n) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - //--- DROPBITS(here.bits) ---// - hold >>>= here_bits; - bits -= here_bits; - //---// - len = 0; - copy = 11 + (hold & 0x7f);//BITS(7); - //--- DROPBITS(7) ---// - hold >>>= 7; - bits -= 7; - //---// - } - if (state.have + copy > state.nlen + state.ndist) { - strm.msg = 'invalid bit length repeat'; - state.mode = BAD; - break; - } - while (copy--) { - state.lens[state.have++] = len; - } - } - } - - /* handle error breaks in while */ - if (state.mode === BAD) { break; } - - /* check for end-of-block code (better have one) */ - if (state.lens[256] === 0) { - strm.msg = 'invalid code -- missing end-of-block'; - state.mode = BAD; - break; - } - - /* build code tables -- note: do not change the lenbits or distbits - values here (9 and 6) without reading the comments in inftrees.h - concerning the ENOUGH constants, which depend on those values */ - state.lenbits = 9; - - opts = { bits: state.lenbits }; - 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. - // state.next_index = opts.table_index; - state.lenbits = opts.bits; - // state.lencode = state.next; - - if (ret) { - strm.msg = 'invalid literal/lengths set'; - state.mode = BAD; - break; - } - - state.distbits = 6; - //state.distcode.copy(state.codes); - // Switch to use dynamic table - state.distcode = state.distdyn; - opts = { bits: state.distbits }; - 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. - // state.next_index = opts.table_index; - state.distbits = opts.bits; - // state.distcode = state.next; - - if (ret) { - strm.msg = 'invalid distances set'; - state.mode = BAD; - break; - } - //Tracev((stderr, 'inflate: codes ok\n')); - state.mode = LEN_; - if (flush === Z_TREES) { break inf_leave; } - /* falls through */ - case LEN_: - state.mode = LEN; - /* falls through */ - case LEN: - if (have >= 6 && left >= 258) { - //--- RESTORE() --- - strm.next_out = put; - strm.avail_out = left; - strm.next_in = next; - strm.avail_in = have; - state.hold = hold; - state.bits = bits; - //--- - inflate_fast(strm, _out); - //--- LOAD() --- - put = strm.next_out; - output = strm.output; - left = strm.avail_out; - next = strm.next_in; - input = strm.input; - have = strm.avail_in; - hold = state.hold; - bits = state.bits; - //--- - - if (state.mode === TYPE) { - state.back = -1; - } - break; - } - state.back = 0; - for (;;) { - here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/ - here_bits = here >>> 24; - here_op = (here >>> 16) & 0xff; - here_val = here & 0xffff; - - if (here_bits <= bits) { break; } - //--- PULLBYTE() ---// - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - //---// - } - if (here_op && (here_op & 0xf0) === 0) { - last_bits = here_bits; - last_op = here_op; - last_val = here_val; - for (;;) { - here = state.lencode[last_val + - ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; - here_bits = here >>> 24; - here_op = (here >>> 16) & 0xff; - here_val = here & 0xffff; - - if ((last_bits + here_bits) <= bits) { break; } - //--- PULLBYTE() ---// - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - //---// - } - //--- DROPBITS(last.bits) ---// - hold >>>= last_bits; - bits -= last_bits; - //---// - state.back += last_bits; - } - //--- DROPBITS(here.bits) ---// - hold >>>= here_bits; - bits -= here_bits; - //---// - state.back += here_bits; - state.length = here_val; - if (here_op === 0) { - //Tracevv((stderr, here.val >= 0x20 && here.val < 0x7f ? - // "inflate: literal '%c'\n" : - // "inflate: literal 0x%02x\n", here.val)); - state.mode = LIT; - break; - } - if (here_op & 32) { - //Tracevv((stderr, "inflate: end of block\n")); - state.back = -1; - state.mode = TYPE; - break; - } - if (here_op & 64) { - strm.msg = 'invalid literal/length code'; - state.mode = BAD; - break; - } - state.extra = here_op & 15; - state.mode = LENEXT; - /* falls through */ - case LENEXT: - if (state.extra) { - //=== NEEDBITS(state.extra); - n = state.extra; - while (bits < n) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; - //--- DROPBITS(state.extra) ---// - hold >>>= state.extra; - bits -= state.extra; - //---// - state.back += state.extra; - } - //Tracevv((stderr, "inflate: length %u\n", state.length)); - state.was = state.length; - state.mode = DIST; - /* falls through */ - case DIST: - for (;;) { - here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/ - here_bits = here >>> 24; - here_op = (here >>> 16) & 0xff; - here_val = here & 0xffff; - - if ((here_bits) <= bits) { break; } - //--- PULLBYTE() ---// - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - //---// - } - if ((here_op & 0xf0) === 0) { - last_bits = here_bits; - last_op = here_op; - last_val = here_val; - for (;;) { - here = state.distcode[last_val + - ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> last_bits)]; - here_bits = here >>> 24; - here_op = (here >>> 16) & 0xff; - here_val = here & 0xffff; - - if ((last_bits + here_bits) <= bits) { break; } - //--- PULLBYTE() ---// - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - //---// - } - //--- DROPBITS(last.bits) ---// - hold >>>= last_bits; - bits -= last_bits; - //---// - state.back += last_bits; - } - //--- DROPBITS(here.bits) ---// - hold >>>= here_bits; - bits -= here_bits; - //---// - state.back += here_bits; - if (here_op & 64) { - strm.msg = 'invalid distance code'; - state.mode = BAD; - break; - } - state.offset = here_val; - state.extra = (here_op) & 15; - state.mode = DISTEXT; - /* falls through */ - case DISTEXT: - if (state.extra) { - //=== NEEDBITS(state.extra); - n = state.extra; - while (bits < n) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/; - //--- DROPBITS(state.extra) ---// - hold >>>= state.extra; - bits -= state.extra; - //---// - state.back += state.extra; - } -//#ifdef INFLATE_STRICT - if (state.offset > state.dmax) { - strm.msg = 'invalid distance too far back'; - state.mode = BAD; - break; - } -//#endif - //Tracevv((stderr, "inflate: distance %u\n", state.offset)); - state.mode = MATCH; - /* falls through */ - case MATCH: - if (left === 0) { break inf_leave; } - copy = _out - left; - if (state.offset > copy) { /* copy from window */ - copy = state.offset - copy; - if (copy > state.whave) { - if (state.sane) { - strm.msg = 'invalid distance too far back'; - state.mode = BAD; - break; - } -// (!) This block is disabled in zlib defaults, -// don't enable it for binary compatibility -//#ifdef INFLATE_ALLOW_INVALID_DISTANCE_TOOFAR_ARRR -// Trace((stderr, "inflate.c too far\n")); -// copy -= state.whave; -// if (copy > state.length) { copy = state.length; } -// if (copy > left) { copy = left; } -// left -= copy; -// state.length -= copy; -// do { -// output[put++] = 0; -// } while (--copy); -// if (state.length === 0) { state.mode = LEN; } -// break; -//#endif - } - if (copy > state.wnext) { - copy -= state.wnext; - from = state.wsize - copy; - } - else { - from = state.wnext - copy; - } - if (copy > state.length) { copy = state.length; } - from_source = state.window; - } - else { /* copy from output */ - from_source = output; - from = put - state.offset; - copy = state.length; - } - if (copy > left) { copy = left; } - left -= copy; - state.length -= copy; - do { - output[put++] = from_source[from++]; - } while (--copy); - if (state.length === 0) { state.mode = LEN; } - break; - case LIT: - if (left === 0) { break inf_leave; } - output[put++] = state.length; - left--; - state.mode = LEN; - break; - case CHECK: - if (state.wrap) { - //=== NEEDBITS(32); - while (bits < 32) { - if (have === 0) { break inf_leave; } - have--; - // Use '|' instead of '+' to make sure that result is signed - hold |= input[next++] << bits; - bits += 8; - } - //===// - _out -= left; - strm.total_out += _out; - state.total += _out; - if (_out) { - strm.adler = state.check = - /*UPDATE(state.check, put - _out, _out);*/ - (state.flags ? crc32(state.check, output, _out, put - _out) : adler32(state.check, output, _out, put - _out)); - - } - _out = left; - // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too - if ((state.flags ? hold : zswap32(hold)) !== state.check) { - strm.msg = 'incorrect data check'; - state.mode = BAD; - break; - } - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - //Tracev((stderr, "inflate: check matches trailer\n")); - } - state.mode = LENGTH; - /* falls through */ - case LENGTH: - if (state.wrap && state.flags) { - //=== NEEDBITS(32); - while (bits < 32) { - if (have === 0) { break inf_leave; } - have--; - hold += input[next++] << bits; - bits += 8; - } - //===// - if (hold !== (state.total & 0xffffffff)) { - strm.msg = 'incorrect length check'; - state.mode = BAD; - break; - } - //=== INITBITS(); - hold = 0; - bits = 0; - //===// - //Tracev((stderr, "inflate: length matches trailer\n")); - } - state.mode = DONE; - /* falls through */ - case DONE: - ret = Z_STREAM_END; - break inf_leave; - case BAD: - ret = Z_DATA_ERROR; - break inf_leave; - case MEM: - return Z_MEM_ERROR; - case SYNC: - /* falls through */ - default: - return Z_STREAM_ERROR; - } - } - - // inf_leave <- here is real place for "goto inf_leave", emulated via "break inf_leave" - - /* - Return from inflate(), updating the total counts and the check value. - If there was no progress during the inflate() call, return a buffer - error. Call updatewindow() to create and/or update the window state. - Note: a memory error from inflate() is non-recoverable. - */ - - //--- RESTORE() --- - strm.next_out = put; - strm.avail_out = left; - strm.next_in = next; - strm.avail_in = have; - state.hold = hold; - state.bits = bits; - //--- - - if (state.wsize || (_out !== strm.avail_out && state.mode < BAD && - (state.mode < CHECK || flush !== Z_FINISH))) { - if (updatewindow(strm, strm.output, strm.next_out, _out - strm.avail_out)) { - state.mode = MEM; - return Z_MEM_ERROR; - } - } - _in -= strm.avail_in; - _out -= strm.avail_out; - strm.total_in += _in; - strm.total_out += _out; - state.total += _out; - if (state.wrap && _out) { - strm.adler = state.check = /*UPDATE(state.check, strm.next_out - _out, _out);*/ - (state.flags ? crc32(state.check, output, _out, strm.next_out - _out) : adler32(state.check, output, _out, strm.next_out - _out)); - } - strm.data_type = state.bits + (state.last ? 64 : 0) + - (state.mode === TYPE ? 128 : 0) + - (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0); - if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) { - ret = Z_BUF_ERROR; - } - return ret; -} - -function inflateEnd(strm) { - - if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) { - return Z_STREAM_ERROR; - } - - var state = strm.state; - if (state.window) { - state.window = null; - } - strm.state = null; - return Z_OK; -} - -function inflateGetHeader(strm, head) { - var state; - - /* check state */ - if (!strm || !strm.state) { return Z_STREAM_ERROR; } - state = strm.state; - if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; } - - /* save header structure */ - state.head = head; - head.done = false; - return Z_OK; -} - -function inflateSetDictionary(strm, dictionary) { - var dictLength = dictionary.length; - - var state; - var dictid; - var ret; - - /* check state */ - if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; } - state = strm.state; - - if (state.wrap !== 0 && state.mode !== DICT) { - return Z_STREAM_ERROR; - } - - /* check for correct dictionary identifier */ - if (state.mode === DICT) { - dictid = 1; /* adler32(0, null, 0)*/ - /* dictid = adler32(dictid, dictionary, dictLength); */ - dictid = adler32(dictid, dictionary, dictLength, 0); - if (dictid !== state.check) { - return Z_DATA_ERROR; - } - } - /* copy dictionary to window using updatewindow(), which will amend the - existing dictionary if appropriate */ - ret = updatewindow(strm, dictionary, dictLength, dictLength); - if (ret) { - state.mode = MEM; - return Z_MEM_ERROR; - } - state.havedict = 1; - // Tracev((stderr, "inflate: dictionary set\n")); - return Z_OK; -} - -exports.inflateReset = inflateReset; -exports.inflateReset2 = inflateReset2; -exports.inflateResetKeep = inflateResetKeep; -exports.inflateInit = inflateInit; -exports.inflateInit2 = inflateInit2; -exports.inflate = inflate; -exports.inflateEnd = inflateEnd; -exports.inflateGetHeader = inflateGetHeader; -exports.inflateSetDictionary = inflateSetDictionary; -exports.inflateInfo = 'pako inflate (from Nodeca project)'; - -/* Not implemented -exports.inflateCopy = inflateCopy; -exports.inflateGetDictionary = inflateGetDictionary; -exports.inflateMark = inflateMark; -exports.inflatePrime = inflatePrime; -exports.inflateSync = inflateSync; -exports.inflateSyncPoint = inflateSyncPoint; -exports.inflateUndermine = inflateUndermine; -*/ - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inftrees.js": -/*!*****************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inftrees.js ***! - \*****************************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -var utils = __webpack_require__(/*! ../utils/common */ "./node_modules/browserify-zlib/node_modules/pako/lib/utils/common.js"); - -var MAXBITS = 15; -var ENOUGH_LENS = 852; -var ENOUGH_DISTS = 592; -//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS); - -var CODES = 0; -var LENS = 1; -var DISTS = 2; - -var lbase = [ /* Length codes 257..285 base */ - 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 -]; - -var lext = [ /* Length codes 257..285 extra */ - 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 -]; - -var dbase = [ /* Distance codes 0..29 base */ - 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 -]; - -var dext = [ /* Distance codes 0..29 extra */ - 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 -]; - -module.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts) -{ - var bits = opts.bits; - //here = opts.here; /* table entry for duplication */ - - var len = 0; /* a code's length in bits */ - var sym = 0; /* index of code symbols */ - var min = 0, max = 0; /* minimum and maximum code lengths */ - var root = 0; /* number of index bits for root table */ - var curr = 0; /* number of index bits for current table */ - var drop = 0; /* code bits to drop for sub-table */ - var left = 0; /* number of prefix codes available */ - var used = 0; /* code entries in table used */ - var huff = 0; /* Huffman code */ - var incr; /* for incrementing code, index */ - var fill; /* index for replicating entries */ - var low; /* low bits for current root entry */ - var mask; /* mask for low root bits */ - var next; /* next available space in table */ - var base = null; /* base value table to use */ - var base_index = 0; -// var shoextra; /* extra bits table to use */ - var end; /* use base and extra for symbol > end */ - var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */ - var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */ - var extra = null; - var extra_index = 0; - - var here_bits, here_op, here_val; - - /* - Process a set of code lengths to create a canonical Huffman code. The - code lengths are lens[0..codes-1]. Each length corresponds to the - symbols 0..codes-1. The Huffman code is generated by first sorting the - symbols by length from short to long, and retaining the symbol order - for codes with equal lengths. Then the code starts with all zero bits - for the first code of the shortest length, and the codes are integer - increments for the same length, and zeros are appended as the length - increases. For the deflate format, these bits are stored backwards - from their more natural integer increment ordering, and so when the - decoding tables are built in the large loop below, the integer codes - are incremented backwards. - - This routine assumes, but does not check, that all of the entries in - lens[] are in the range 0..MAXBITS. The caller must assure this. - 1..MAXBITS is interpreted as that code length. zero means that that - symbol does not occur in this code. - - The codes are sorted by computing a count of codes for each length, - creating from that a table of starting indices for each length in the - sorted table, and then entering the symbols in order in the sorted - table. The sorted table is work[], with that space being provided by - the caller. - - The length counts are used for other purposes as well, i.e. finding - the minimum and maximum length codes, determining if there are any - codes at all, checking for a valid set of lengths, and looking ahead - at length counts to determine sub-table sizes when building the - decoding tables. - */ - - /* accumulate lengths for codes (assumes lens[] all in 0..MAXBITS) */ - for (len = 0; len <= MAXBITS; len++) { - count[len] = 0; - } - for (sym = 0; sym < codes; sym++) { - count[lens[lens_index + sym]]++; - } - - /* bound code lengths, force root to be within code lengths */ - root = bits; - for (max = MAXBITS; max >= 1; max--) { - if (count[max] !== 0) { break; } - } - if (root > max) { - root = max; - } - if (max === 0) { /* no symbols to code at all */ - //table.op[opts.table_index] = 64; //here.op = (var char)64; /* invalid code marker */ - //table.bits[opts.table_index] = 1; //here.bits = (var char)1; - //table.val[opts.table_index++] = 0; //here.val = (var short)0; - table[table_index++] = (1 << 24) | (64 << 16) | 0; - - - //table.op[opts.table_index] = 64; - //table.bits[opts.table_index] = 1; - //table.val[opts.table_index++] = 0; - table[table_index++] = (1 << 24) | (64 << 16) | 0; - - opts.bits = 1; - return 0; /* no symbols, but wait for decoding to report error */ - } - for (min = 1; min < max; min++) { - if (count[min] !== 0) { break; } - } - if (root < min) { - root = min; - } - - /* check for an over-subscribed or incomplete set of lengths */ - left = 1; - for (len = 1; len <= MAXBITS; len++) { - left <<= 1; - left -= count[len]; - if (left < 0) { - return -1; - } /* over-subscribed */ - } - if (left > 0 && (type === CODES || max !== 1)) { - return -1; /* incomplete set */ - } - - /* generate offsets into symbol table for each length for sorting */ - offs[1] = 0; - for (len = 1; len < MAXBITS; len++) { - offs[len + 1] = offs[len] + count[len]; - } - - /* sort symbols by length, by symbol order within each length */ - for (sym = 0; sym < codes; sym++) { - if (lens[lens_index + sym] !== 0) { - work[offs[lens[lens_index + sym]]++] = sym; - } - } - - /* - Create and fill in decoding tables. In this loop, the table being - filled is at next and has curr index bits. The code being used is huff - with length len. That code is converted to an index by dropping drop - bits off of the bottom. For codes where len is less than drop + curr, - those top drop + curr - len bits are incremented through all values to - fill the table with replicated entries. - - root is the number of index bits for the root table. When len exceeds - root, sub-tables are created pointed to by the root entry with an index - of the low root bits of huff. This is saved in low to check for when a - new sub-table should be started. drop is zero when the root table is - being filled, and drop is root when sub-tables are being filled. - - When a new sub-table is needed, it is necessary to look ahead in the - code lengths to determine what size sub-table is needed. The length - counts are used for this, and so count[] is decremented as codes are - entered in the tables. - - used keeps track of how many table entries have been allocated from the - provided *table space. It is checked for LENS and DIST tables against - the constants ENOUGH_LENS and ENOUGH_DISTS to guard against changes in - the initial root table size constants. See the comments in inftrees.h - for more information. - - sym increments through all symbols, and the loop terminates when - all codes of length max, i.e. all codes, have been processed. This - routine permits incomplete codes, so another loop after this one fills - in the rest of the decoding tables with invalid code markers. - */ - - /* set up for code type */ - // poor man optimization - use if-else instead of switch, - // to avoid deopts in old v8 - if (type === CODES) { - base = extra = work; /* dummy value--not used */ - end = 19; - - } else if (type === LENS) { - base = lbase; - base_index -= 257; - extra = lext; - extra_index -= 257; - end = 256; - - } else { /* DISTS */ - base = dbase; - extra = dext; - end = -1; - } - - /* initialize opts for loop */ - huff = 0; /* starting code */ - sym = 0; /* starting code symbol */ - len = min; /* starting code length */ - next = table_index; /* current table to fill in */ - curr = root; /* current table index bits */ - drop = 0; /* current bits to drop from code for index */ - low = -1; /* trigger new sub-table when len > root */ - used = 1 << root; /* use root table entries */ - mask = used - 1; /* mask for comparing low */ - - /* check available table space */ - if ((type === LENS && used > ENOUGH_LENS) || - (type === DISTS && used > ENOUGH_DISTS)) { - return 1; - } - - /* process all codes and make table entries */ - for (;;) { - /* create table entry */ - here_bits = len - drop; - if (work[sym] < end) { - here_op = 0; - here_val = work[sym]; - } - else if (work[sym] > end) { - here_op = extra[extra_index + work[sym]]; - here_val = base[base_index + work[sym]]; - } - else { - here_op = 32 + 64; /* end of block */ - here_val = 0; - } - - /* replicate for those indices with low len bits equal to huff */ - incr = 1 << (len - drop); - fill = 1 << curr; - min = fill; /* save offset to next table */ - do { - fill -= incr; - table[next + (huff >> drop) + fill] = (here_bits << 24) | (here_op << 16) | here_val |0; - } while (fill !== 0); - - /* backwards increment the len-bit code huff */ - incr = 1 << (len - 1); - while (huff & incr) { - incr >>= 1; - } - if (incr !== 0) { - huff &= incr - 1; - huff += incr; - } else { - huff = 0; - } - - /* go to next symbol, update count, len */ - sym++; - if (--count[len] === 0) { - if (len === max) { break; } - len = lens[lens_index + work[sym]]; - } - - /* create new sub-table if needed */ - if (len > root && (huff & mask) !== low) { - /* if first time, transition to sub-tables */ - if (drop === 0) { - drop = root; - } - - /* increment past last table */ - next += min; /* here min is 1 << curr */ - - /* determine length of next table */ - curr = len - drop; - left = 1 << curr; - while (curr + drop < max) { - left -= count[curr + drop]; - if (left <= 0) { break; } - curr++; - left <<= 1; - } - - /* check for enough space */ - used += 1 << curr; - if ((type === LENS && used > ENOUGH_LENS) || - (type === DISTS && used > ENOUGH_DISTS)) { - return 1; - } - - /* point entry in root table to sub-table */ - low = huff & mask; - /*table.op[low] = curr; - table.bits[low] = root; - table.val[low] = next - opts.table_index;*/ - table[low] = (root << 24) | (curr << 16) | (next - table_index) |0; - } - } - - /* fill in remaining table entry if code is incomplete (guaranteed to have - at most one remaining entry, since if the code is incomplete, the - maximum code length that was allowed to get this far is one bit) */ - if (huff !== 0) { - //table.op[next + huff] = 64; /* invalid code marker */ - //table.bits[next + huff] = len - drop; - //table.val[next + huff] = 0; - table[next + huff] = ((len - drop) << 24) | (64 << 16) |0; - } - - /* set return parameters */ - //opts.table_index += used; - opts.bits = root; - return 0; -}; - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/messages.js": -/*!*****************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/messages.js ***! - \*****************************************************************************/ -/***/ ((module) => { - -"use strict"; - - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -module.exports = { - 2: 'need dictionary', /* Z_NEED_DICT 2 */ - 1: 'stream end', /* Z_STREAM_END 1 */ - 0: '', /* Z_OK 0 */ - '-1': 'file error', /* Z_ERRNO (-1) */ - '-2': 'stream error', /* Z_STREAM_ERROR (-2) */ - '-3': 'data error', /* Z_DATA_ERROR (-3) */ - '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */ - '-5': 'buffer error', /* Z_BUF_ERROR (-5) */ - '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */ -}; - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/trees.js": -/*!**************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/trees.js ***! - \**************************************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -/* eslint-disable space-unary-ops */ - -var utils = __webpack_require__(/*! ../utils/common */ "./node_modules/browserify-zlib/node_modules/pako/lib/utils/common.js"); - -/* Public constants ==========================================================*/ -/* ===========================================================================*/ - - -//var Z_FILTERED = 1; -//var Z_HUFFMAN_ONLY = 2; -//var Z_RLE = 3; -var Z_FIXED = 4; -//var Z_DEFAULT_STRATEGY = 0; - -/* Possible values of the data_type field (though see inflate()) */ -var Z_BINARY = 0; -var Z_TEXT = 1; -//var Z_ASCII = 1; // = Z_TEXT -var Z_UNKNOWN = 2; - -/*============================================================================*/ - - -function zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } } - -// From zutil.h - -var STORED_BLOCK = 0; -var STATIC_TREES = 1; -var DYN_TREES = 2; -/* The three kinds of block type */ - -var MIN_MATCH = 3; -var MAX_MATCH = 258; -/* The minimum and maximum match lengths */ - -// From deflate.h -/* =========================================================================== - * Internal compression state. - */ - -var LENGTH_CODES = 29; -/* number of length codes, not counting the special END_BLOCK code */ - -var LITERALS = 256; -/* number of literal bytes 0..255 */ - -var L_CODES = LITERALS + 1 + LENGTH_CODES; -/* number of Literal or Length codes, including the END_BLOCK code */ - -var D_CODES = 30; -/* number of distance codes */ - -var BL_CODES = 19; -/* number of codes used to transfer the bit lengths */ - -var HEAP_SIZE = 2 * L_CODES + 1; -/* maximum heap size */ - -var MAX_BITS = 15; -/* All codes must not exceed MAX_BITS bits */ - -var Buf_size = 16; -/* size of bit buffer in bi_buf */ - - -/* =========================================================================== - * Constants - */ - -var MAX_BL_BITS = 7; -/* Bit length codes must not exceed MAX_BL_BITS bits */ - -var END_BLOCK = 256; -/* end of block literal code */ - -var REP_3_6 = 16; -/* repeat previous bit length 3-6 times (2 bits of repeat count) */ - -var REPZ_3_10 = 17; -/* repeat a zero length 3-10 times (3 bits of repeat count) */ - -var REPZ_11_138 = 18; -/* repeat a zero length 11-138 times (7 bits of repeat count) */ - -/* eslint-disable comma-spacing,array-bracket-spacing */ -var extra_lbits = /* extra bits for each length code */ - [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]; - -var extra_dbits = /* extra bits for each distance code */ - [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]; - -var extra_blbits = /* extra bits for each bit length code */ - [0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]; - -var bl_order = - [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]; -/* eslint-enable comma-spacing,array-bracket-spacing */ - -/* The lengths of the bit length codes are sent in order of decreasing - * probability, to avoid transmitting the lengths for unused bit length codes. - */ - -/* =========================================================================== - * Local data. These are initialized only once. - */ - -// We pre-fill arrays with 0 to avoid uninitialized gaps - -var DIST_CODE_LEN = 512; /* see definition of array dist_code below */ - -// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1 -var static_ltree = new Array((L_CODES + 2) * 2); -zero(static_ltree); -/* The static literal tree. Since the bit lengths are imposed, there is no - * need for the L_CODES extra codes used during heap construction. However - * The codes 286 and 287 are needed to build a canonical tree (see _tr_init - * below). - */ - -var static_dtree = new Array(D_CODES * 2); -zero(static_dtree); -/* The static distance tree. (Actually a trivial tree since all codes use - * 5 bits.) - */ - -var _dist_code = new Array(DIST_CODE_LEN); -zero(_dist_code); -/* Distance codes. The first 256 values correspond to the distances - * 3 .. 258, the last 256 values correspond to the top 8 bits of - * the 15 bit distances. - */ - -var _length_code = new Array(MAX_MATCH - MIN_MATCH + 1); -zero(_length_code); -/* length code for each normalized match length (0 == MIN_MATCH) */ - -var base_length = new Array(LENGTH_CODES); -zero(base_length); -/* First normalized length for each code (0 = MIN_MATCH) */ - -var base_dist = new Array(D_CODES); -zero(base_dist); -/* First normalized distance for each code (0 = distance of 1) */ - - -function StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) { - - this.static_tree = static_tree; /* static tree or NULL */ - this.extra_bits = extra_bits; /* extra bits for each code or NULL */ - this.extra_base = extra_base; /* base index for extra_bits */ - this.elems = elems; /* max number of elements in the tree */ - this.max_length = max_length; /* max bit length for the codes */ - - // show if `static_tree` has data or dummy - needed for monomorphic objects - this.has_stree = static_tree && static_tree.length; -} - - -var static_l_desc; -var static_d_desc; -var static_bl_desc; - - -function TreeDesc(dyn_tree, stat_desc) { - this.dyn_tree = dyn_tree; /* the dynamic tree */ - this.max_code = 0; /* largest code with non zero frequency */ - this.stat_desc = stat_desc; /* the corresponding static tree */ -} - - - -function d_code(dist) { - return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)]; -} - - -/* =========================================================================== - * Output a short LSB first on the stream. - * IN assertion: there is enough room in pendingBuf. - */ -function put_short(s, w) { -// put_byte(s, (uch)((w) & 0xff)); -// put_byte(s, (uch)((ush)(w) >> 8)); - s.pending_buf[s.pending++] = (w) & 0xff; - s.pending_buf[s.pending++] = (w >>> 8) & 0xff; -} - - -/* =========================================================================== - * Send a value on a given number of bits. - * IN assertion: length <= 16 and value fits in length bits. - */ -function send_bits(s, value, length) { - if (s.bi_valid > (Buf_size - length)) { - s.bi_buf |= (value << s.bi_valid) & 0xffff; - put_short(s, s.bi_buf); - s.bi_buf = value >> (Buf_size - s.bi_valid); - s.bi_valid += length - Buf_size; - } else { - s.bi_buf |= (value << s.bi_valid) & 0xffff; - s.bi_valid += length; - } -} - - -function send_code(s, c, tree) { - send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/); -} - - -/* =========================================================================== - * Reverse the first len bits of a code, using straightforward code (a faster - * method would use a table) - * IN assertion: 1 <= len <= 15 - */ -function bi_reverse(code, len) { - var res = 0; - do { - res |= code & 1; - code >>>= 1; - res <<= 1; - } while (--len > 0); - return res >>> 1; -} - - -/* =========================================================================== - * Flush the bit buffer, keeping at most 7 bits in it. - */ -function bi_flush(s) { - if (s.bi_valid === 16) { - put_short(s, s.bi_buf); - s.bi_buf = 0; - s.bi_valid = 0; - - } else if (s.bi_valid >= 8) { - s.pending_buf[s.pending++] = s.bi_buf & 0xff; - s.bi_buf >>= 8; - s.bi_valid -= 8; - } -} - - -/* =========================================================================== - * Compute the optimal bit lengths for a tree and update the total bit length - * for the current block. - * IN assertion: the fields freq and dad are set, heap[heap_max] and - * above are the tree nodes sorted by increasing frequency. - * OUT assertions: the field len is set to the optimal bit length, the - * array bl_count contains the frequencies for each bit length. - * The length opt_len is updated; static_len is also updated if stree is - * not null. - */ -function gen_bitlen(s, desc) -// deflate_state *s; -// tree_desc *desc; /* the tree descriptor */ -{ - var tree = desc.dyn_tree; - var max_code = desc.max_code; - var stree = desc.stat_desc.static_tree; - var has_stree = desc.stat_desc.has_stree; - var extra = desc.stat_desc.extra_bits; - var base = desc.stat_desc.extra_base; - var max_length = desc.stat_desc.max_length; - var h; /* heap index */ - var n, m; /* iterate over the tree elements */ - var bits; /* bit length */ - var xbits; /* extra bits */ - var f; /* frequency */ - var overflow = 0; /* number of elements with bit length too large */ - - for (bits = 0; bits <= MAX_BITS; bits++) { - s.bl_count[bits] = 0; - } - - /* In a first pass, compute the optimal bit lengths (which may - * overflow in the case of the bit length tree). - */ - tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* root of the heap */ - - for (h = s.heap_max + 1; h < HEAP_SIZE; h++) { - n = s.heap[h]; - bits = tree[tree[n * 2 + 1]/*.Dad*/ * 2 + 1]/*.Len*/ + 1; - if (bits > max_length) { - bits = max_length; - overflow++; - } - tree[n * 2 + 1]/*.Len*/ = bits; - /* We overwrite tree[n].Dad which is no longer needed */ - - if (n > max_code) { continue; } /* not a leaf node */ - - s.bl_count[bits]++; - xbits = 0; - if (n >= base) { - xbits = extra[n - base]; - } - f = tree[n * 2]/*.Freq*/; - s.opt_len += f * (bits + xbits); - if (has_stree) { - s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits); - } - } - if (overflow === 0) { return; } - - // Trace((stderr,"\nbit length overflow\n")); - /* This happens for example on obj2 and pic of the Calgary corpus */ - - /* Find the first bit length which could increase: */ - do { - bits = max_length - 1; - while (s.bl_count[bits] === 0) { bits--; } - s.bl_count[bits]--; /* move one leaf down the tree */ - s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */ - s.bl_count[max_length]--; - /* The brother of the overflow item also moves one step up, - * but this does not affect bl_count[max_length] - */ - overflow -= 2; - } while (overflow > 0); - - /* Now recompute all bit lengths, scanning in increasing frequency. - * h is still equal to HEAP_SIZE. (It is simpler to reconstruct all - * lengths instead of fixing only the wrong ones. This idea is taken - * from 'ar' written by Haruhiko Okumura.) - */ - for (bits = max_length; bits !== 0; bits--) { - n = s.bl_count[bits]; - while (n !== 0) { - m = s.heap[--h]; - if (m > max_code) { continue; } - if (tree[m * 2 + 1]/*.Len*/ !== bits) { - // Trace((stderr,"code %d bits %d->%d\n", m, tree[m].Len, bits)); - s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/; - tree[m * 2 + 1]/*.Len*/ = bits; - } - n--; - } - } -} - - -/* =========================================================================== - * Generate the codes for a given tree and bit counts (which need not be - * optimal). - * IN assertion: the array bl_count contains the bit length statistics for - * the given tree and the field len is set for all tree elements. - * OUT assertion: the field code is set for all tree elements of non - * zero code length. - */ -function gen_codes(tree, max_code, bl_count) -// ct_data *tree; /* the tree to decorate */ -// int max_code; /* largest code with non zero frequency */ -// ushf *bl_count; /* number of codes at each bit length */ -{ - var next_code = new Array(MAX_BITS + 1); /* next code value for each bit length */ - var code = 0; /* running code value */ - var bits; /* bit index */ - var n; /* code index */ - - /* The distribution counts are first used to generate the code values - * without bit reversal. - */ - for (bits = 1; bits <= MAX_BITS; bits++) { - next_code[bits] = code = (code + bl_count[bits - 1]) << 1; - } - /* Check that the bit counts in bl_count are consistent. The last code - * must be all ones. - */ - //Assert (code + bl_count[MAX_BITS]-1 == (1< length code (0..28) */ - length = 0; - for (code = 0; code < LENGTH_CODES - 1; code++) { - base_length[code] = length; - for (n = 0; n < (1 << extra_lbits[code]); n++) { - _length_code[length++] = code; - } - } - //Assert (length == 256, "tr_static_init: length != 256"); - /* Note that the length 255 (match length 258) can be represented - * in two different ways: code 284 + 5 bits or code 285, so we - * overwrite length_code[255] to use the best encoding: - */ - _length_code[length - 1] = code; - - /* Initialize the mapping dist (0..32K) -> dist code (0..29) */ - dist = 0; - for (code = 0; code < 16; code++) { - base_dist[code] = dist; - for (n = 0; n < (1 << extra_dbits[code]); n++) { - _dist_code[dist++] = code; - } - } - //Assert (dist == 256, "tr_static_init: dist != 256"); - dist >>= 7; /* from now on, all distances are divided by 128 */ - for (; code < D_CODES; code++) { - base_dist[code] = dist << 7; - for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) { - _dist_code[256 + dist++] = code; - } - } - //Assert (dist == 256, "tr_static_init: 256+dist != 512"); - - /* Construct the codes of the static literal tree */ - for (bits = 0; bits <= MAX_BITS; bits++) { - bl_count[bits] = 0; - } - - n = 0; - while (n <= 143) { - static_ltree[n * 2 + 1]/*.Len*/ = 8; - n++; - bl_count[8]++; - } - while (n <= 255) { - static_ltree[n * 2 + 1]/*.Len*/ = 9; - n++; - bl_count[9]++; - } - while (n <= 279) { - static_ltree[n * 2 + 1]/*.Len*/ = 7; - n++; - bl_count[7]++; - } - while (n <= 287) { - static_ltree[n * 2 + 1]/*.Len*/ = 8; - n++; - bl_count[8]++; - } - /* Codes 286 and 287 do not exist, but we must include them in the - * tree construction to get a canonical Huffman tree (longest code - * all ones) - */ - gen_codes(static_ltree, L_CODES + 1, bl_count); - - /* The static distance tree is trivial: */ - for (n = 0; n < D_CODES; n++) { - static_dtree[n * 2 + 1]/*.Len*/ = 5; - static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5); - } - - // Now data ready and we can init static trees - static_l_desc = new StaticTreeDesc(static_ltree, extra_lbits, LITERALS + 1, L_CODES, MAX_BITS); - static_d_desc = new StaticTreeDesc(static_dtree, extra_dbits, 0, D_CODES, MAX_BITS); - static_bl_desc = new StaticTreeDesc(new Array(0), extra_blbits, 0, BL_CODES, MAX_BL_BITS); - - //static_init_done = true; -} - - -/* =========================================================================== - * Initialize a new block. - */ -function init_block(s) { - var n; /* iterates over tree elements */ - - /* Initialize the trees. */ - for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; } - for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; } - for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; } - - s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1; - s.opt_len = s.static_len = 0; - s.last_lit = s.matches = 0; -} - - -/* =========================================================================== - * Flush the bit buffer and align the output on a byte boundary - */ -function bi_windup(s) -{ - if (s.bi_valid > 8) { - put_short(s, s.bi_buf); - } else if (s.bi_valid > 0) { - //put_byte(s, (Byte)s->bi_buf); - s.pending_buf[s.pending++] = s.bi_buf; - } - s.bi_buf = 0; - s.bi_valid = 0; -} - -/* =========================================================================== - * Copy a stored block, storing first the length and its - * one's complement if requested. - */ -function copy_block(s, buf, len, header) -//DeflateState *s; -//charf *buf; /* the input data */ -//unsigned len; /* its length */ -//int header; /* true if block header must be written */ -{ - bi_windup(s); /* align on byte boundary */ - - if (header) { - put_short(s, len); - put_short(s, ~len); - } -// while (len--) { -// put_byte(s, *buf++); -// } - utils.arraySet(s.pending_buf, s.window, buf, len, s.pending); - s.pending += len; -} - -/* =========================================================================== - * Compares to subtrees, using the tree depth as tie breaker when - * the subtrees have equal frequency. This minimizes the worst case length. - */ -function smaller(tree, n, m, depth) { - var _n2 = n * 2; - var _m2 = m * 2; - return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ || - (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m])); -} - -/* =========================================================================== - * Restore the heap property by moving down the tree starting at node k, - * exchanging a node with the smallest of its two sons if necessary, stopping - * when the heap property is re-established (each father smaller than its - * two sons). - */ -function pqdownheap(s, tree, k) -// deflate_state *s; -// ct_data *tree; /* the tree to restore */ -// int k; /* node to move down */ -{ - var v = s.heap[k]; - var j = k << 1; /* left son of k */ - while (j <= s.heap_len) { - /* Set j to the smallest of the two sons: */ - if (j < s.heap_len && - smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) { - j++; - } - /* Exit if v is smaller than both sons */ - if (smaller(tree, v, s.heap[j], s.depth)) { break; } - - /* Exchange v with the smallest son */ - s.heap[k] = s.heap[j]; - k = j; - - /* And continue down the tree, setting j to the left son of k */ - j <<= 1; - } - s.heap[k] = v; -} - - -// inlined manually -// var SMALLEST = 1; - -/* =========================================================================== - * Send the block data compressed using the given Huffman trees - */ -function compress_block(s, ltree, dtree) -// deflate_state *s; -// const ct_data *ltree; /* literal tree */ -// const ct_data *dtree; /* distance tree */ -{ - var dist; /* distance of matched string */ - var lc; /* match length or unmatched char (if dist == 0) */ - var lx = 0; /* running index in l_buf */ - var code; /* the code to send */ - var extra; /* number of extra bits to send */ - - if (s.last_lit !== 0) { - do { - dist = (s.pending_buf[s.d_buf + lx * 2] << 8) | (s.pending_buf[s.d_buf + lx * 2 + 1]); - lc = s.pending_buf[s.l_buf + lx]; - lx++; - - if (dist === 0) { - send_code(s, lc, ltree); /* send a literal byte */ - //Tracecv(isgraph(lc), (stderr," '%c' ", lc)); - } else { - /* Here, lc is the match length - MIN_MATCH */ - code = _length_code[lc]; - send_code(s, code + LITERALS + 1, ltree); /* send the length code */ - extra = extra_lbits[code]; - if (extra !== 0) { - lc -= base_length[code]; - send_bits(s, lc, extra); /* send the extra length bits */ - } - dist--; /* dist is now the match distance - 1 */ - code = d_code(dist); - //Assert (code < D_CODES, "bad d_code"); - - send_code(s, code, dtree); /* send the distance code */ - extra = extra_dbits[code]; - if (extra !== 0) { - dist -= base_dist[code]; - send_bits(s, dist, extra); /* send the extra distance bits */ - } - } /* literal or match pair ? */ - - /* Check that the overlay between pending_buf and d_buf+l_buf is ok: */ - //Assert((uInt)(s->pending) < s->lit_bufsize + 2*lx, - // "pendingBuf overflow"); - - } while (lx < s.last_lit); - } - - send_code(s, END_BLOCK, ltree); -} - - -/* =========================================================================== - * Construct one Huffman tree and assigns the code bit strings and lengths. - * Update the total bit length for the current block. - * IN assertion: the field freq is set for all tree elements. - * OUT assertions: the fields len and code are set to the optimal bit length - * and corresponding code. The length opt_len is updated; static_len is - * also updated if stree is not null. The field max_code is set. - */ -function build_tree(s, desc) -// deflate_state *s; -// tree_desc *desc; /* the tree descriptor */ -{ - var tree = desc.dyn_tree; - var stree = desc.stat_desc.static_tree; - var has_stree = desc.stat_desc.has_stree; - var elems = desc.stat_desc.elems; - var n, m; /* iterate over heap elements */ - var max_code = -1; /* largest code with non zero frequency */ - var node; /* new node being created */ - - /* Construct the initial heap, with least frequent element in - * heap[SMALLEST]. The sons of heap[n] are heap[2*n] and heap[2*n+1]. - * heap[0] is not used. - */ - s.heap_len = 0; - s.heap_max = HEAP_SIZE; - - for (n = 0; n < elems; n++) { - if (tree[n * 2]/*.Freq*/ !== 0) { - s.heap[++s.heap_len] = max_code = n; - s.depth[n] = 0; - - } else { - tree[n * 2 + 1]/*.Len*/ = 0; - } - } - - /* The pkzip format requires that at least one distance code exists, - * and that at least one bit should be sent even if there is only one - * possible code. So to avoid special checks later on we force at least - * two codes of non zero frequency. - */ - while (s.heap_len < 2) { - node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0); - tree[node * 2]/*.Freq*/ = 1; - s.depth[node] = 0; - s.opt_len--; - - if (has_stree) { - s.static_len -= stree[node * 2 + 1]/*.Len*/; - } - /* node is 0 or 1 so it does not have extra bits */ - } - desc.max_code = max_code; - - /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree, - * establish sub-heaps of increasing lengths: - */ - for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); } - - /* Construct the Huffman tree by repeatedly combining the least two - * frequent nodes. - */ - node = elems; /* next internal node of the tree */ - do { - //pqremove(s, tree, n); /* n = node of least frequency */ - /*** pqremove ***/ - n = s.heap[1/*SMALLEST*/]; - s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--]; - pqdownheap(s, tree, 1/*SMALLEST*/); - /***/ - - m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */ - - s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */ - s.heap[--s.heap_max] = m; - - /* Create a new node father of n and m */ - tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/; - s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1; - tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node; - - /* and insert the new node in the heap */ - s.heap[1/*SMALLEST*/] = node++; - pqdownheap(s, tree, 1/*SMALLEST*/); - - } while (s.heap_len >= 2); - - s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/]; - - /* At this point, the fields freq and dad are set. We can now - * generate the bit lengths. - */ - gen_bitlen(s, desc); - - /* The field len is now set, we can generate the bit codes */ - gen_codes(tree, max_code, s.bl_count); -} - - -/* =========================================================================== - * Scan a literal or distance tree to determine the frequencies of the codes - * in the bit length tree. - */ -function scan_tree(s, tree, max_code) -// deflate_state *s; -// ct_data *tree; /* the tree to be scanned */ -// int max_code; /* and its largest code of non zero frequency */ -{ - var n; /* iterates over all tree elements */ - var prevlen = -1; /* last emitted length */ - var curlen; /* length of current code */ - - var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ - - var count = 0; /* repeat count of the current code */ - var max_count = 7; /* max repeat count */ - var min_count = 4; /* min repeat count */ - - if (nextlen === 0) { - max_count = 138; - min_count = 3; - } - tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */ - - for (n = 0; n <= max_code; n++) { - curlen = nextlen; - nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; - - if (++count < max_count && curlen === nextlen) { - continue; - - } else if (count < min_count) { - s.bl_tree[curlen * 2]/*.Freq*/ += count; - - } else if (curlen !== 0) { - - if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; } - s.bl_tree[REP_3_6 * 2]/*.Freq*/++; - - } else if (count <= 10) { - s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++; - - } else { - s.bl_tree[REPZ_11_138 * 2]/*.Freq*/++; - } - - count = 0; - prevlen = curlen; - - if (nextlen === 0) { - max_count = 138; - min_count = 3; - - } else if (curlen === nextlen) { - max_count = 6; - min_count = 3; - - } else { - max_count = 7; - min_count = 4; - } - } -} - - -/* =========================================================================== - * Send a literal or distance tree in compressed form, using the codes in - * bl_tree. - */ -function send_tree(s, tree, max_code) -// deflate_state *s; -// ct_data *tree; /* the tree to be scanned */ -// int max_code; /* and its largest code of non zero frequency */ -{ - var n; /* iterates over all tree elements */ - var prevlen = -1; /* last emitted length */ - var curlen; /* length of current code */ - - var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */ - - var count = 0; /* repeat count of the current code */ - var max_count = 7; /* max repeat count */ - var min_count = 4; /* min repeat count */ - - /* tree[max_code+1].Len = -1; */ /* guard already set */ - if (nextlen === 0) { - max_count = 138; - min_count = 3; - } - - for (n = 0; n <= max_code; n++) { - curlen = nextlen; - nextlen = tree[(n + 1) * 2 + 1]/*.Len*/; - - if (++count < max_count && curlen === nextlen) { - continue; - - } else if (count < min_count) { - do { send_code(s, curlen, s.bl_tree); } while (--count !== 0); - - } else if (curlen !== 0) { - if (curlen !== prevlen) { - send_code(s, curlen, s.bl_tree); - count--; - } - //Assert(count >= 3 && count <= 6, " 3_6?"); - send_code(s, REP_3_6, s.bl_tree); - send_bits(s, count - 3, 2); - - } else if (count <= 10) { - send_code(s, REPZ_3_10, s.bl_tree); - send_bits(s, count - 3, 3); - - } else { - send_code(s, REPZ_11_138, s.bl_tree); - send_bits(s, count - 11, 7); - } - - count = 0; - prevlen = curlen; - if (nextlen === 0) { - max_count = 138; - min_count = 3; - - } else if (curlen === nextlen) { - max_count = 6; - min_count = 3; - - } else { - max_count = 7; - min_count = 4; - } - } -} - - -/* =========================================================================== - * Construct the Huffman tree for the bit lengths and return the index in - * bl_order of the last bit length code to send. - */ -function build_bl_tree(s) { - var max_blindex; /* index of last bit length code of non zero freq */ - - /* Determine the bit length frequencies for literal and distance trees */ - scan_tree(s, s.dyn_ltree, s.l_desc.max_code); - scan_tree(s, s.dyn_dtree, s.d_desc.max_code); - - /* Build the bit length tree: */ - build_tree(s, s.bl_desc); - /* opt_len now includes the length of the tree representations, except - * the lengths of the bit lengths codes and the 5+5+4 bits for the counts. - */ - - /* Determine the number of bit length codes to send. The pkzip format - * requires that at least 4 bit length codes be sent. (appnote.txt says - * 3 but the actual value used is 4.) - */ - for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) { - if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) { - break; - } - } - /* Update opt_len to include the bit length tree and counts */ - s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4; - //Tracev((stderr, "\ndyn trees: dyn %ld, stat %ld", - // s->opt_len, s->static_len)); - - return max_blindex; -} - - -/* =========================================================================== - * Send the header for a block using dynamic Huffman trees: the counts, the - * lengths of the bit length codes, the literal tree and the distance tree. - * IN assertion: lcodes >= 257, dcodes >= 1, blcodes >= 4. - */ -function send_all_trees(s, lcodes, dcodes, blcodes) -// deflate_state *s; -// int lcodes, dcodes, blcodes; /* number of codes for each tree */ -{ - var rank; /* index in bl_order */ - - //Assert (lcodes >= 257 && dcodes >= 1 && blcodes >= 4, "not enough codes"); - //Assert (lcodes <= L_CODES && dcodes <= D_CODES && blcodes <= BL_CODES, - // "too many codes"); - //Tracev((stderr, "\nbl counts: ")); - send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */ - send_bits(s, dcodes - 1, 5); - send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */ - for (rank = 0; rank < blcodes; rank++) { - //Tracev((stderr, "\nbl code %2d ", bl_order[rank])); - send_bits(s, s.bl_tree[bl_order[rank] * 2 + 1]/*.Len*/, 3); - } - //Tracev((stderr, "\nbl tree: sent %ld", s->bits_sent)); - - send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */ - //Tracev((stderr, "\nlit tree: sent %ld", s->bits_sent)); - - send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */ - //Tracev((stderr, "\ndist tree: sent %ld", s->bits_sent)); -} - - -/* =========================================================================== - * Check if the data type is TEXT or BINARY, using the following algorithm: - * - TEXT if the two conditions below are satisfied: - * a) There are no non-portable control characters belonging to the - * "black list" (0..6, 14..25, 28..31). - * b) There is at least one printable character belonging to the - * "white list" (9 {TAB}, 10 {LF}, 13 {CR}, 32..255). - * - BINARY otherwise. - * - The following partially-portable control characters form a - * "gray list" that is ignored in this detection algorithm: - * (7 {BEL}, 8 {BS}, 11 {VT}, 12 {FF}, 26 {SUB}, 27 {ESC}). - * IN assertion: the fields Freq of dyn_ltree are set. - */ -function detect_data_type(s) { - /* black_mask is the bit mask of black-listed bytes - * set bits 0..6, 14..25, and 28..31 - * 0xf3ffc07f = binary 11110011111111111100000001111111 - */ - var black_mask = 0xf3ffc07f; - var n; - - /* Check for non-textual ("black-listed") bytes. */ - for (n = 0; n <= 31; n++, black_mask >>>= 1) { - if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) { - return Z_BINARY; - } - } - - /* Check for textual ("white-listed") bytes. */ - if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 || - s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) { - return Z_TEXT; - } - for (n = 32; n < LITERALS; n++) { - if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) { - return Z_TEXT; - } - } - - /* There are no "black-listed" or "white-listed" bytes: - * this stream either is empty or has tolerated ("gray-listed") bytes only. - */ - return Z_BINARY; -} - - -var static_init_done = false; - -/* =========================================================================== - * Initialize the tree data structures for a new zlib stream. - */ -function _tr_init(s) -{ - - if (!static_init_done) { - tr_static_init(); - static_init_done = true; - } - - s.l_desc = new TreeDesc(s.dyn_ltree, static_l_desc); - s.d_desc = new TreeDesc(s.dyn_dtree, static_d_desc); - s.bl_desc = new TreeDesc(s.bl_tree, static_bl_desc); - - s.bi_buf = 0; - s.bi_valid = 0; - - /* Initialize the first block of the first file: */ - init_block(s); -} - - -/* =========================================================================== - * Send a stored block - */ -function _tr_stored_block(s, buf, stored_len, last) -//DeflateState *s; -//charf *buf; /* input block */ -//ulg stored_len; /* length of input block */ -//int last; /* one if this is the last block for a file */ -{ - send_bits(s, (STORED_BLOCK << 1) + (last ? 1 : 0), 3); /* send block type */ - copy_block(s, buf, stored_len, true); /* with header */ -} - - -/* =========================================================================== - * Send one empty static block to give enough lookahead for inflate. - * This takes 10 bits, of which 7 may remain in the bit buffer. - */ -function _tr_align(s) { - send_bits(s, STATIC_TREES << 1, 3); - send_code(s, END_BLOCK, static_ltree); - bi_flush(s); -} - - -/* =========================================================================== - * Determine the best encoding for the current block: dynamic trees, static - * trees or store, and output the encoded block to the zip file. - */ -function _tr_flush_block(s, buf, stored_len, last) -//DeflateState *s; -//charf *buf; /* input block, or NULL if too old */ -//ulg stored_len; /* length of input block */ -//int last; /* one if this is the last block for a file */ -{ - var opt_lenb, static_lenb; /* opt_len and static_len in bytes */ - var max_blindex = 0; /* index of last bit length code of non zero freq */ - - /* Build the Huffman trees unless a stored block is forced */ - if (s.level > 0) { - - /* Check if the file is binary or text */ - if (s.strm.data_type === Z_UNKNOWN) { - s.strm.data_type = detect_data_type(s); - } - - /* Construct the literal and distance trees */ - build_tree(s, s.l_desc); - // Tracev((stderr, "\nlit data: dyn %ld, stat %ld", s->opt_len, - // s->static_len)); - - build_tree(s, s.d_desc); - // Tracev((stderr, "\ndist data: dyn %ld, stat %ld", s->opt_len, - // s->static_len)); - /* At this point, opt_len and static_len are the total bit lengths of - * the compressed block data, excluding the tree representations. - */ - - /* Build the bit length tree for the above two trees, and get the index - * in bl_order of the last bit length code to send. - */ - max_blindex = build_bl_tree(s); - - /* Determine the best encoding. Compute the block lengths in bytes. */ - opt_lenb = (s.opt_len + 3 + 7) >>> 3; - static_lenb = (s.static_len + 3 + 7) >>> 3; - - // Tracev((stderr, "\nopt %lu(%lu) stat %lu(%lu) stored %lu lit %u ", - // opt_lenb, s->opt_len, static_lenb, s->static_len, stored_len, - // s->last_lit)); - - if (static_lenb <= opt_lenb) { opt_lenb = static_lenb; } - - } else { - // Assert(buf != (char*)0, "lost buf"); - opt_lenb = static_lenb = stored_len + 5; /* force a stored block */ - } - - if ((stored_len + 4 <= opt_lenb) && (buf !== -1)) { - /* 4: two words for the lengths */ - - /* The test buf != NULL is only necessary if LIT_BUFSIZE > WSIZE. - * Otherwise we can't have processed more than WSIZE input bytes since - * the last block flush, because compression would have been - * successful. If LIT_BUFSIZE <= WSIZE, it is never too late to - * transform a block into a stored block. - */ - _tr_stored_block(s, buf, stored_len, last); - - } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) { - - send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3); - compress_block(s, static_ltree, static_dtree); - - } else { - send_bits(s, (DYN_TREES << 1) + (last ? 1 : 0), 3); - send_all_trees(s, s.l_desc.max_code + 1, s.d_desc.max_code + 1, max_blindex + 1); - compress_block(s, s.dyn_ltree, s.dyn_dtree); - } - // Assert (s->compressed_len == s->bits_sent, "bad compressed size"); - /* The above check is made mod 2^32, for files larger than 512 MB - * and uLong implemented on 32 bits. - */ - init_block(s); - - if (last) { - bi_windup(s); - } - // Tracev((stderr,"\ncomprlen %lu(%lu) ", s->compressed_len>>3, - // s->compressed_len-7*last)); -} - -/* =========================================================================== - * Save the match info and tally the frequency counts. Return true if - * the current block must be flushed. - */ -function _tr_tally(s, dist, lc) -// deflate_state *s; -// unsigned dist; /* distance of matched string */ -// unsigned lc; /* match length-MIN_MATCH or unmatched char (if dist==0) */ -{ - //var out_length, in_length, dcode; - - s.pending_buf[s.d_buf + s.last_lit * 2] = (dist >>> 8) & 0xff; - s.pending_buf[s.d_buf + s.last_lit * 2 + 1] = dist & 0xff; - - s.pending_buf[s.l_buf + s.last_lit] = lc & 0xff; - s.last_lit++; - - if (dist === 0) { - /* lc is the unmatched char */ - s.dyn_ltree[lc * 2]/*.Freq*/++; - } else { - s.matches++; - /* Here, lc is the match length - MIN_MATCH */ - dist--; /* dist = match distance - 1 */ - //Assert((ush)dist < (ush)MAX_DIST(s) && - // (ush)lc <= (ush)(MAX_MATCH-MIN_MATCH) && - // (ush)d_code(dist) < (ush)D_CODES, "_tr_tally: bad match"); - - s.dyn_ltree[(_length_code[lc] + LITERALS + 1) * 2]/*.Freq*/++; - s.dyn_dtree[d_code(dist) * 2]/*.Freq*/++; - } - -// (!) This block is disabled in zlib defaults, -// don't enable it for binary compatibility - -//#ifdef TRUNCATE_BLOCK -// /* Try to guess if it is profitable to stop the current block here */ -// if ((s.last_lit & 0x1fff) === 0 && s.level > 2) { -// /* Compute an upper bound for the compressed length */ -// out_length = s.last_lit*8; -// in_length = s.strstart - s.block_start; -// -// for (dcode = 0; dcode < D_CODES; dcode++) { -// out_length += s.dyn_dtree[dcode*2]/*.Freq*/ * (5 + extra_dbits[dcode]); -// } -// out_length >>>= 3; -// //Tracev((stderr,"\nlast_lit %u, in %ld, out ~%ld(%ld%%) ", -// // s->last_lit, in_length, out_length, -// // 100L - out_length*100L/in_length)); -// if (s.matches < (s.last_lit>>1)/*int /2*/ && out_length < (in_length>>1)/*int /2*/) { -// return true; -// } -// } -//#endif - - return (s.last_lit === s.lit_bufsize - 1); - /* We avoid equality with lit_bufsize because of wraparound at 64K - * on 16 bit machines and because stored blocks are restricted to - * 64K-1 bytes. - */ -} - -exports._tr_init = _tr_init; -exports._tr_stored_block = _tr_stored_block; -exports._tr_flush_block = _tr_flush_block; -exports._tr_tally = _tr_tally; -exports._tr_align = _tr_align; - - -/***/ }), - -/***/ "./node_modules/browserify-zlib/node_modules/pako/lib/zlib/zstream.js": -/*!****************************************************************************!*\ - !*** ./node_modules/browserify-zlib/node_modules/pako/lib/zlib/zstream.js ***! - \****************************************************************************/ -/***/ ((module) => { - -"use strict"; - - -// (C) 1995-2013 Jean-loup Gailly and Mark Adler -// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin -// -// This software is provided 'as-is', without any express or implied -// warranty. In no event will the authors be held liable for any damages -// arising from the use of this software. -// -// Permission is granted to anyone to use this software for any purpose, -// including commercial applications, and to alter it and redistribute it -// freely, subject to the following restrictions: -// -// 1. The origin of this software must not be misrepresented; you must not -// claim that you wrote the original software. If you use this software -// in a product, an acknowledgment in the product documentation would be -// appreciated but is not required. -// 2. Altered source versions must be plainly marked as such, and must not be -// misrepresented as being the original software. -// 3. This notice may not be removed or altered from any source distribution. - -function ZStream() { - /* next input byte */ - this.input = null; // JS specific, because we have no pointers - this.next_in = 0; - /* number of bytes available at input */ - this.avail_in = 0; - /* total number of input bytes read so far */ - this.total_in = 0; - /* next output byte should be put there */ - this.output = null; // JS specific, because we have no pointers - this.next_out = 0; - /* remaining free space at output */ - this.avail_out = 0; - /* total number of bytes output so far */ - this.total_out = 0; - /* last error message, NULL if no error */ - this.msg = ''/*Z_NULL*/; - /* not visible by applications */ - this.state = null; - /* best guess about the data type: binary or text */ - this.data_type = 2/*Z_UNKNOWN*/; - /* adler32 value of the uncompressed data */ - this.adler = 0; -} - -module.exports = ZStream; - - -/***/ }), - -/***/ "./node_modules/buffer-alloc-unsafe/index.js": -/*!***************************************************!*\ - !*** ./node_modules/buffer-alloc-unsafe/index.js ***! - \***************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -function allocUnsafe (size) { - if (typeof size !== 'number') { - throw new TypeError('"size" argument must be a number') - } - - if (size < 0) { - throw new RangeError('"size" argument must not be negative') - } - - if (Buffer.allocUnsafe) { - return Buffer.allocUnsafe(size) - } else { - return new Buffer(size) - } -} - -module.exports = allocUnsafe - - -/***/ }), - -/***/ "./node_modules/buffer-alloc/index.js": -/*!********************************************!*\ - !*** ./node_modules/buffer-alloc/index.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var bufferFill = __webpack_require__(/*! buffer-fill */ "./node_modules/buffer-fill/index.js") -var allocUnsafe = __webpack_require__(/*! buffer-alloc-unsafe */ "./node_modules/buffer-alloc-unsafe/index.js") - -module.exports = function alloc (size, fill, encoding) { - if (typeof size !== 'number') { - throw new TypeError('"size" argument must be a number') - } - - if (size < 0) { - throw new RangeError('"size" argument must not be negative') - } - - if (Buffer.alloc) { - return Buffer.alloc(size, fill, encoding) - } - - var buffer = allocUnsafe(size) - - if (size === 0) { - return buffer - } - - if (fill === undefined) { - return bufferFill(buffer, 0) - } - - if (typeof encoding !== 'string') { - encoding = undefined - } - - return bufferFill(buffer, fill, encoding) -} - - -/***/ }), - -/***/ "./node_modules/buffer-fill/index.js": -/*!*******************************************!*\ - !*** ./node_modules/buffer-fill/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/* Node.js 6.4.0 and up has full support */ -var hasFullSupport = (function () { - try { - if (!Buffer.isEncoding('latin1')) { - return false - } - - var buf = Buffer.alloc ? Buffer.alloc(4) : new Buffer(4) - - buf.fill('ab', 'ucs2') - - return (buf.toString('hex') === '61006200') - } catch (_) { - return false - } -}()) - -function isSingleByte (val) { - return (val.length === 1 && val.charCodeAt(0) < 256) -} - -function fillWithNumber (buffer, val, start, end) { - if (start < 0 || end > buffer.length) { - throw new RangeError('Out of range index') - } - - start = start >>> 0 - end = end === undefined ? buffer.length : end >>> 0 - - if (end > start) { - buffer.fill(val, start, end) - } - - return buffer -} - -function fillWithBuffer (buffer, val, start, end) { - if (start < 0 || end > buffer.length) { - throw new RangeError('Out of range index') - } - - if (end <= start) { - return buffer - } - - start = start >>> 0 - end = end === undefined ? buffer.length : end >>> 0 - - var pos = start - var len = val.length - while (pos <= (end - len)) { - val.copy(buffer, pos) - pos += len - } - - if (pos !== end) { - val.copy(buffer, pos, 0, end - pos) - } - - return buffer -} - -function fill (buffer, val, start, end, encoding) { - if (hasFullSupport) { - return buffer.fill(val, start, end, encoding) - } - - if (typeof val === 'number') { - return fillWithNumber(buffer, val, start, end) - } - - if (typeof val === 'string') { - if (typeof start === 'string') { - encoding = start - start = 0 - end = buffer.length - } else if (typeof end === 'string') { - encoding = end - end = buffer.length - } - - if (encoding !== undefined && typeof encoding !== 'string') { - throw new TypeError('encoding must be a string') - } - - if (encoding === 'latin1') { - encoding = 'binary' - } - - if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) { - throw new TypeError('Unknown encoding: ' + encoding) - } - - if (val === '') { - return fillWithNumber(buffer, 0, start, end) - } - - if (isSingleByte(val)) { - return fillWithNumber(buffer, val.charCodeAt(0), start, end) - } - - val = new Buffer(val, encoding) - } - - if (Buffer.isBuffer(val)) { - return fillWithBuffer(buffer, val, start, end) - } - - // Other values (e.g. undefined, boolean, object) results in zero-fill - return fillWithNumber(buffer, 0, start, end) -} - -module.exports = fill - - -/***/ }), - -/***/ "./node_modules/buffer-xor/index.js": -/*!******************************************!*\ - !*** ./node_modules/buffer-xor/index.js ***! - \******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -module.exports = function xor (a, b) { - var length = Math.min(a.length, b.length) - var buffer = new Buffer(length) - - for (var i = 0; i < length; ++i) { - buffer[i] = a[i] ^ b[i] - } - - return buffer -} - - -/***/ }), - -/***/ "./node_modules/buffer/index.js": -/*!**************************************!*\ - !*** ./node_modules/buffer/index.js ***! - \**************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -/*! - * The buffer module from node.js, for the browser. - * - * @author Feross Aboukhadijeh - * @license MIT - */ -/* eslint-disable no-proto */ - - - -const base64 = __webpack_require__(/*! base64-js */ "./node_modules/base64-js/index.js") -const ieee754 = __webpack_require__(/*! ieee754 */ "./node_modules/ieee754/index.js") -const customInspectSymbol = - (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation - ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation - : null - -exports.Buffer = Buffer -exports.SlowBuffer = SlowBuffer -exports.INSPECT_MAX_BYTES = 50 - -const K_MAX_LENGTH = 0x7fffffff -exports.kMaxLength = K_MAX_LENGTH - -/** - * If `Buffer.TYPED_ARRAY_SUPPORT`: - * === true Use Uint8Array implementation (fastest) - * === false Print warning and recommend using `buffer` v4.x which has an Object - * implementation (most compatible, even IE6) - * - * Browsers that support typed arrays are IE 10+, Firefox 4+, Chrome 7+, Safari 5.1+, - * Opera 11.6+, iOS 4.2+. - * - * We report that the browser does not support typed arrays if the are not subclassable - * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array` - * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support - * for __proto__ and has a buggy typed array implementation. - */ -Buffer.TYPED_ARRAY_SUPPORT = typedArraySupport() - -if (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' && - typeof console.error === 'function') { - console.error( - 'This browser lacks typed array (Uint8Array) support which is required by ' + - '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.' - ) -} - -function typedArraySupport () { - // Can typed array instances can be augmented? - try { - const arr = new Uint8Array(1) - const proto = { foo: function () { return 42 } } - Object.setPrototypeOf(proto, Uint8Array.prototype) - Object.setPrototypeOf(arr, proto) - return arr.foo() === 42 - } catch (e) { - return false - } -} - -Object.defineProperty(Buffer.prototype, 'parent', { - enumerable: true, - get: function () { - if (!Buffer.isBuffer(this)) return undefined - return this.buffer - } -}) - -Object.defineProperty(Buffer.prototype, 'offset', { - enumerable: true, - get: function () { - if (!Buffer.isBuffer(this)) return undefined - return this.byteOffset - } -}) - -function createBuffer (length) { - if (length > K_MAX_LENGTH) { - throw new RangeError('The value "' + length + '" is invalid for option "size"') - } - // Return an augmented `Uint8Array` instance - const buf = new Uint8Array(length) - Object.setPrototypeOf(buf, Buffer.prototype) - return buf -} - -/** - * The Buffer constructor returns instances of `Uint8Array` that have their - * prototype changed to `Buffer.prototype`. Furthermore, `Buffer` is a subclass of - * `Uint8Array`, so the returned instances will have all the node `Buffer` methods - * and the `Uint8Array` methods. Square bracket notation works as expected -- it - * returns a single octet. - * - * The `Uint8Array` prototype remains unmodified. - */ - -function Buffer (arg, encodingOrOffset, length) { - // Common case. - if (typeof arg === 'number') { - if (typeof encodingOrOffset === 'string') { - throw new TypeError( - 'The "string" argument must be of type string. Received type number' - ) - } - return allocUnsafe(arg) - } - return from(arg, encodingOrOffset, length) -} - -Buffer.poolSize = 8192 // not used by this implementation - -function from (value, encodingOrOffset, length) { - if (typeof value === 'string') { - return fromString(value, encodingOrOffset) - } - - if (ArrayBuffer.isView(value)) { - return fromArrayView(value) - } - - if (value == null) { - throw new TypeError( - 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' + - 'or Array-like Object. Received type ' + (typeof value) - ) - } - - if (isInstance(value, ArrayBuffer) || - (value && isInstance(value.buffer, ArrayBuffer))) { - return fromArrayBuffer(value, encodingOrOffset, length) - } - - if (typeof SharedArrayBuffer !== 'undefined' && - (isInstance(value, SharedArrayBuffer) || - (value && isInstance(value.buffer, SharedArrayBuffer)))) { - return fromArrayBuffer(value, encodingOrOffset, length) - } - - if (typeof value === 'number') { - throw new TypeError( - 'The "value" argument must not be of type number. Received type number' - ) - } - - const valueOf = value.valueOf && value.valueOf() - if (valueOf != null && valueOf !== value) { - return Buffer.from(valueOf, encodingOrOffset, length) - } - - const b = fromObject(value) - if (b) return b - - if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null && - typeof value[Symbol.toPrimitive] === 'function') { - return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length) - } - - throw new TypeError( - 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' + - 'or Array-like Object. Received type ' + (typeof value) - ) -} - -/** - * Functionally equivalent to Buffer(arg, encoding) but throws a TypeError - * if value is a number. - * Buffer.from(str[, encoding]) - * Buffer.from(array) - * Buffer.from(buffer) - * Buffer.from(arrayBuffer[, byteOffset[, length]]) - **/ -Buffer.from = function (value, encodingOrOffset, length) { - return from(value, encodingOrOffset, length) -} - -// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug: -// https://github.com/feross/buffer/pull/148 -Object.setPrototypeOf(Buffer.prototype, Uint8Array.prototype) -Object.setPrototypeOf(Buffer, Uint8Array) - -function assertSize (size) { - if (typeof size !== 'number') { - throw new TypeError('"size" argument must be of type number') - } else if (size < 0) { - throw new RangeError('The value "' + size + '" is invalid for option "size"') - } -} - -function alloc (size, fill, encoding) { - assertSize(size) - if (size <= 0) { - return createBuffer(size) - } - if (fill !== undefined) { - // Only pay attention to encoding if it's a string. This - // prevents accidentally sending in a number that would - // be interpreted as a start offset. - return typeof encoding === 'string' - ? createBuffer(size).fill(fill, encoding) - : createBuffer(size).fill(fill) - } - return createBuffer(size) -} - -/** - * Creates a new filled Buffer instance. - * alloc(size[, fill[, encoding]]) - **/ -Buffer.alloc = function (size, fill, encoding) { - return alloc(size, fill, encoding) -} - -function allocUnsafe (size) { - assertSize(size) - return createBuffer(size < 0 ? 0 : checked(size) | 0) -} - -/** - * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance. - * */ -Buffer.allocUnsafe = function (size) { - return allocUnsafe(size) -} -/** - * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance. - */ -Buffer.allocUnsafeSlow = function (size) { - return allocUnsafe(size) -} - -function fromString (string, encoding) { - if (typeof encoding !== 'string' || encoding === '') { - encoding = 'utf8' - } - - if (!Buffer.isEncoding(encoding)) { - throw new TypeError('Unknown encoding: ' + encoding) - } - - const length = byteLength(string, encoding) | 0 - let buf = createBuffer(length) - - const actual = buf.write(string, encoding) - - if (actual !== length) { - // Writing a hex string, for example, that contains invalid characters will - // cause everything after the first invalid character to be ignored. (e.g. - // 'abxxcd' will be treated as 'ab') - buf = buf.slice(0, actual) - } - - return buf -} - -function fromArrayLike (array) { - const length = array.length < 0 ? 0 : checked(array.length) | 0 - const buf = createBuffer(length) - for (let i = 0; i < length; i += 1) { - buf[i] = array[i] & 255 - } - return buf -} - -function fromArrayView (arrayView) { - if (isInstance(arrayView, Uint8Array)) { - const copy = new Uint8Array(arrayView) - return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength) - } - return fromArrayLike(arrayView) -} - -function fromArrayBuffer (array, byteOffset, length) { - if (byteOffset < 0 || array.byteLength < byteOffset) { - throw new RangeError('"offset" is outside of buffer bounds') - } - - if (array.byteLength < byteOffset + (length || 0)) { - throw new RangeError('"length" is outside of buffer bounds') - } - - let buf - if (byteOffset === undefined && length === undefined) { - buf = new Uint8Array(array) - } else if (length === undefined) { - buf = new Uint8Array(array, byteOffset) - } else { - buf = new Uint8Array(array, byteOffset, length) - } - - // Return an augmented `Uint8Array` instance - Object.setPrototypeOf(buf, Buffer.prototype) - - return buf -} - -function fromObject (obj) { - if (Buffer.isBuffer(obj)) { - const len = checked(obj.length) | 0 - const buf = createBuffer(len) - - if (buf.length === 0) { - return buf - } - - obj.copy(buf, 0, 0, len) - return buf - } - - if (obj.length !== undefined) { - if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) { - return createBuffer(0) - } - return fromArrayLike(obj) - } - - if (obj.type === 'Buffer' && Array.isArray(obj.data)) { - return fromArrayLike(obj.data) - } -} - -function checked (length) { - // Note: cannot use `length < K_MAX_LENGTH` here because that fails when - // length is NaN (which is otherwise coerced to zero.) - if (length >= K_MAX_LENGTH) { - throw new RangeError('Attempt to allocate Buffer larger than maximum ' + - 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes') - } - return length | 0 -} - -function SlowBuffer (length) { - if (+length != length) { // eslint-disable-line eqeqeq - length = 0 - } - return Buffer.alloc(+length) -} - -Buffer.isBuffer = function isBuffer (b) { - return b != null && b._isBuffer === true && - b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false -} - -Buffer.compare = function compare (a, b) { - if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength) - if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength) - if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) { - throw new TypeError( - 'The "buf1", "buf2" arguments must be one of type Buffer or Uint8Array' - ) - } - - if (a === b) return 0 - - let x = a.length - let y = b.length - - for (let i = 0, len = Math.min(x, y); i < len; ++i) { - if (a[i] !== b[i]) { - x = a[i] - y = b[i] - break - } - } - - if (x < y) return -1 - if (y < x) return 1 - return 0 -} - -Buffer.isEncoding = function isEncoding (encoding) { - switch (String(encoding).toLowerCase()) { - case 'hex': - case 'utf8': - case 'utf-8': - case 'ascii': - case 'latin1': - case 'binary': - case 'base64': - case 'ucs2': - case 'ucs-2': - case 'utf16le': - case 'utf-16le': - return true - default: - return false - } -} - -Buffer.concat = function concat (list, length) { - if (!Array.isArray(list)) { - throw new TypeError('"list" argument must be an Array of Buffers') - } - - if (list.length === 0) { - return Buffer.alloc(0) - } - - let i - if (length === undefined) { - length = 0 - for (i = 0; i < list.length; ++i) { - length += list[i].length - } - } - - const buffer = Buffer.allocUnsafe(length) - let pos = 0 - for (i = 0; i < list.length; ++i) { - let buf = list[i] - if (isInstance(buf, Uint8Array)) { - if (pos + buf.length > buffer.length) { - if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf) - buf.copy(buffer, pos) - } else { - Uint8Array.prototype.set.call( - buffer, - buf, - pos - ) - } - } else if (!Buffer.isBuffer(buf)) { - throw new TypeError('"list" argument must be an Array of Buffers') - } else { - buf.copy(buffer, pos) - } - pos += buf.length - } - return buffer -} - -function byteLength (string, encoding) { - if (Buffer.isBuffer(string)) { - return string.length - } - if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) { - return string.byteLength - } - if (typeof string !== 'string') { - throw new TypeError( - 'The "string" argument must be one of type string, Buffer, or ArrayBuffer. ' + - 'Received type ' + typeof string - ) - } - - const len = string.length - const mustMatch = (arguments.length > 2 && arguments[2] === true) - if (!mustMatch && len === 0) return 0 - - // Use a for loop to avoid recursion - let loweredCase = false - for (;;) { - switch (encoding) { - case 'ascii': - case 'latin1': - case 'binary': - return len - case 'utf8': - case 'utf-8': - return utf8ToBytes(string).length - case 'ucs2': - case 'ucs-2': - case 'utf16le': - case 'utf-16le': - return len * 2 - case 'hex': - return len >>> 1 - case 'base64': - return base64ToBytes(string).length - default: - if (loweredCase) { - return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8 - } - encoding = ('' + encoding).toLowerCase() - loweredCase = true - } - } -} -Buffer.byteLength = byteLength - -function slowToString (encoding, start, end) { - let loweredCase = false - - // No need to verify that "this.length <= MAX_UINT32" since it's a read-only - // property of a typed array. - - // This behaves neither like String nor Uint8Array in that we set start/end - // to their upper/lower bounds if the value passed is out of range. - // undefined is handled specially as per ECMA-262 6th Edition, - // Section 13.3.3.7 Runtime Semantics: KeyedBindingInitialization. - if (start === undefined || start < 0) { - start = 0 - } - // Return early if start > this.length. Done here to prevent potential uint32 - // coercion fail below. - if (start > this.length) { - return '' - } - - if (end === undefined || end > this.length) { - end = this.length - } - - if (end <= 0) { - return '' - } - - // Force coercion to uint32. This will also coerce falsey/NaN values to 0. - end >>>= 0 - start >>>= 0 - - if (end <= start) { - return '' - } - - if (!encoding) encoding = 'utf8' - - while (true) { - switch (encoding) { - case 'hex': - return hexSlice(this, start, end) - - case 'utf8': - case 'utf-8': - return utf8Slice(this, start, end) - - case 'ascii': - return asciiSlice(this, start, end) - - case 'latin1': - case 'binary': - return latin1Slice(this, start, end) - - case 'base64': - return base64Slice(this, start, end) - - case 'ucs2': - case 'ucs-2': - case 'utf16le': - case 'utf-16le': - return utf16leSlice(this, start, end) - - default: - if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) - encoding = (encoding + '').toLowerCase() - loweredCase = true - } - } -} - -// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package) -// to detect a Buffer instance. It's not possible to use `instanceof Buffer` -// reliably in a browserify context because there could be multiple different -// copies of the 'buffer' package in use. This method works even for Buffer -// instances that were created from another copy of the `buffer` package. -// See: https://github.com/feross/buffer/issues/154 -Buffer.prototype._isBuffer = true - -function swap (b, n, m) { - const i = b[n] - b[n] = b[m] - b[m] = i -} - -Buffer.prototype.swap16 = function swap16 () { - const len = this.length - if (len % 2 !== 0) { - throw new RangeError('Buffer size must be a multiple of 16-bits') - } - for (let i = 0; i < len; i += 2) { - swap(this, i, i + 1) - } - return this -} - -Buffer.prototype.swap32 = function swap32 () { - const len = this.length - if (len % 4 !== 0) { - throw new RangeError('Buffer size must be a multiple of 32-bits') - } - for (let i = 0; i < len; i += 4) { - swap(this, i, i + 3) - swap(this, i + 1, i + 2) - } - return this -} - -Buffer.prototype.swap64 = function swap64 () { - const len = this.length - if (len % 8 !== 0) { - throw new RangeError('Buffer size must be a multiple of 64-bits') - } - for (let i = 0; i < len; i += 8) { - swap(this, i, i + 7) - swap(this, i + 1, i + 6) - swap(this, i + 2, i + 5) - swap(this, i + 3, i + 4) - } - return this -} - -Buffer.prototype.toString = function toString () { - const length = this.length - if (length === 0) return '' - if (arguments.length === 0) return utf8Slice(this, 0, length) - return slowToString.apply(this, arguments) -} - -Buffer.prototype.toLocaleString = Buffer.prototype.toString - -Buffer.prototype.equals = function equals (b) { - if (!Buffer.isBuffer(b)) throw new TypeError('Argument must be a Buffer') - if (this === b) return true - return Buffer.compare(this, b) === 0 -} - -Buffer.prototype.inspect = function inspect () { - let str = '' - const max = exports.INSPECT_MAX_BYTES - str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim() - if (this.length > max) str += ' ... ' - return '' -} -if (customInspectSymbol) { - Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect -} - -Buffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) { - if (isInstance(target, Uint8Array)) { - target = Buffer.from(target, target.offset, target.byteLength) - } - if (!Buffer.isBuffer(target)) { - throw new TypeError( - 'The "target" argument must be one of type Buffer or Uint8Array. ' + - 'Received type ' + (typeof target) - ) - } - - if (start === undefined) { - start = 0 - } - if (end === undefined) { - end = target ? target.length : 0 - } - if (thisStart === undefined) { - thisStart = 0 - } - if (thisEnd === undefined) { - thisEnd = this.length - } - - if (start < 0 || end > target.length || thisStart < 0 || thisEnd > this.length) { - throw new RangeError('out of range index') - } - - if (thisStart >= thisEnd && start >= end) { - return 0 - } - if (thisStart >= thisEnd) { - return -1 - } - if (start >= end) { - return 1 - } - - start >>>= 0 - end >>>= 0 - thisStart >>>= 0 - thisEnd >>>= 0 - - if (this === target) return 0 - - let x = thisEnd - thisStart - let y = end - start - const len = Math.min(x, y) - - const thisCopy = this.slice(thisStart, thisEnd) - const targetCopy = target.slice(start, end) - - for (let i = 0; i < len; ++i) { - if (thisCopy[i] !== targetCopy[i]) { - x = thisCopy[i] - y = targetCopy[i] - break - } - } - - if (x < y) return -1 - if (y < x) return 1 - return 0 -} - -// Finds either the first index of `val` in `buffer` at offset >= `byteOffset`, -// OR the last index of `val` in `buffer` at offset <= `byteOffset`. -// -// Arguments: -// - buffer - a Buffer to search -// - val - a string, Buffer, or number -// - byteOffset - an index into `buffer`; will be clamped to an int32 -// - encoding - an optional encoding, relevant is val is a string -// - dir - true for indexOf, false for lastIndexOf -function bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) { - // Empty buffer means no match - if (buffer.length === 0) return -1 - - // Normalize byteOffset - if (typeof byteOffset === 'string') { - encoding = byteOffset - byteOffset = 0 - } else if (byteOffset > 0x7fffffff) { - byteOffset = 0x7fffffff - } else if (byteOffset < -0x80000000) { - byteOffset = -0x80000000 - } - byteOffset = +byteOffset // Coerce to Number. - if (numberIsNaN(byteOffset)) { - // byteOffset: it it's undefined, null, NaN, "foo", etc, search whole buffer - byteOffset = dir ? 0 : (buffer.length - 1) - } - - // Normalize byteOffset: negative offsets start from the end of the buffer - if (byteOffset < 0) byteOffset = buffer.length + byteOffset - if (byteOffset >= buffer.length) { - if (dir) return -1 - else byteOffset = buffer.length - 1 - } else if (byteOffset < 0) { - if (dir) byteOffset = 0 - else return -1 - } - - // Normalize val - if (typeof val === 'string') { - val = Buffer.from(val, encoding) - } - - // Finally, search either indexOf (if dir is true) or lastIndexOf - if (Buffer.isBuffer(val)) { - // Special case: looking for empty string/buffer always fails - if (val.length === 0) { - return -1 - } - return arrayIndexOf(buffer, val, byteOffset, encoding, dir) - } else if (typeof val === 'number') { - val = val & 0xFF // Search for a byte value [0-255] - if (typeof Uint8Array.prototype.indexOf === 'function') { - if (dir) { - return Uint8Array.prototype.indexOf.call(buffer, val, byteOffset) - } else { - return Uint8Array.prototype.lastIndexOf.call(buffer, val, byteOffset) - } - } - return arrayIndexOf(buffer, [val], byteOffset, encoding, dir) - } - - throw new TypeError('val must be string, number or Buffer') -} - -function arrayIndexOf (arr, val, byteOffset, encoding, dir) { - let indexSize = 1 - let arrLength = arr.length - let valLength = val.length - - if (encoding !== undefined) { - encoding = String(encoding).toLowerCase() - if (encoding === 'ucs2' || encoding === 'ucs-2' || - encoding === 'utf16le' || encoding === 'utf-16le') { - if (arr.length < 2 || val.length < 2) { - return -1 - } - indexSize = 2 - arrLength /= 2 - valLength /= 2 - byteOffset /= 2 - } - } - - function read (buf, i) { - if (indexSize === 1) { - return buf[i] - } else { - return buf.readUInt16BE(i * indexSize) - } - } - - let i - if (dir) { - let foundIndex = -1 - for (i = byteOffset; i < arrLength; i++) { - if (read(arr, i) === read(val, foundIndex === -1 ? 0 : i - foundIndex)) { - if (foundIndex === -1) foundIndex = i - if (i - foundIndex + 1 === valLength) return foundIndex * indexSize - } else { - if (foundIndex !== -1) i -= i - foundIndex - foundIndex = -1 - } - } - } else { - if (byteOffset + valLength > arrLength) byteOffset = arrLength - valLength - for (i = byteOffset; i >= 0; i--) { - let found = true - for (let j = 0; j < valLength; j++) { - if (read(arr, i + j) !== read(val, j)) { - found = false - break - } - } - if (found) return i - } - } - - return -1 -} - -Buffer.prototype.includes = function includes (val, byteOffset, encoding) { - return this.indexOf(val, byteOffset, encoding) !== -1 -} - -Buffer.prototype.indexOf = function indexOf (val, byteOffset, encoding) { - return bidirectionalIndexOf(this, val, byteOffset, encoding, true) -} - -Buffer.prototype.lastIndexOf = function lastIndexOf (val, byteOffset, encoding) { - return bidirectionalIndexOf(this, val, byteOffset, encoding, false) -} - -function hexWrite (buf, string, offset, length) { - offset = Number(offset) || 0 - const remaining = buf.length - offset - if (!length) { - length = remaining - } else { - length = Number(length) - if (length > remaining) { - length = remaining - } - } - - const strLen = string.length - - if (length > strLen / 2) { - length = strLen / 2 - } - let i - for (i = 0; i < length; ++i) { - const parsed = parseInt(string.substr(i * 2, 2), 16) - if (numberIsNaN(parsed)) return i - buf[offset + i] = parsed - } - return i -} - -function utf8Write (buf, string, offset, length) { - return blitBuffer(utf8ToBytes(string, buf.length - offset), buf, offset, length) -} - -function asciiWrite (buf, string, offset, length) { - return blitBuffer(asciiToBytes(string), buf, offset, length) -} - -function base64Write (buf, string, offset, length) { - return blitBuffer(base64ToBytes(string), buf, offset, length) -} - -function ucs2Write (buf, string, offset, length) { - return blitBuffer(utf16leToBytes(string, buf.length - offset), buf, offset, length) -} - -Buffer.prototype.write = function write (string, offset, length, encoding) { - // Buffer#write(string) - if (offset === undefined) { - encoding = 'utf8' - length = this.length - offset = 0 - // Buffer#write(string, encoding) - } else if (length === undefined && typeof offset === 'string') { - encoding = offset - length = this.length - offset = 0 - // Buffer#write(string, offset[, length][, encoding]) - } else if (isFinite(offset)) { - offset = offset >>> 0 - if (isFinite(length)) { - length = length >>> 0 - if (encoding === undefined) encoding = 'utf8' - } else { - encoding = length - length = undefined - } - } else { - throw new Error( - 'Buffer.write(string, encoding, offset[, length]) is no longer supported' - ) - } - - const remaining = this.length - offset - if (length === undefined || length > remaining) length = remaining - - if ((string.length > 0 && (length < 0 || offset < 0)) || offset > this.length) { - throw new RangeError('Attempt to write outside buffer bounds') - } - - if (!encoding) encoding = 'utf8' - - let loweredCase = false - for (;;) { - switch (encoding) { - case 'hex': - return hexWrite(this, string, offset, length) - - case 'utf8': - case 'utf-8': - return utf8Write(this, string, offset, length) - - case 'ascii': - case 'latin1': - case 'binary': - return asciiWrite(this, string, offset, length) - - case 'base64': - // Warning: maxLength not taken into account in base64Write - return base64Write(this, string, offset, length) - - case 'ucs2': - case 'ucs-2': - case 'utf16le': - case 'utf-16le': - return ucs2Write(this, string, offset, length) - - default: - if (loweredCase) throw new TypeError('Unknown encoding: ' + encoding) - encoding = ('' + encoding).toLowerCase() - loweredCase = true - } - } -} - -Buffer.prototype.toJSON = function toJSON () { - return { - type: 'Buffer', - data: Array.prototype.slice.call(this._arr || this, 0) - } -} - -function base64Slice (buf, start, end) { - if (start === 0 && end === buf.length) { - return base64.fromByteArray(buf) - } else { - return base64.fromByteArray(buf.slice(start, end)) - } -} - -function utf8Slice (buf, start, end) { - end = Math.min(buf.length, end) - const res = [] - - let i = start - while (i < end) { - const firstByte = buf[i] - let codePoint = null - let bytesPerSequence = (firstByte > 0xEF) - ? 4 - : (firstByte > 0xDF) - ? 3 - : (firstByte > 0xBF) - ? 2 - : 1 - - if (i + bytesPerSequence <= end) { - let secondByte, thirdByte, fourthByte, tempCodePoint - - switch (bytesPerSequence) { - case 1: - if (firstByte < 0x80) { - codePoint = firstByte - } - break - case 2: - secondByte = buf[i + 1] - if ((secondByte & 0xC0) === 0x80) { - tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F) - if (tempCodePoint > 0x7F) { - codePoint = tempCodePoint - } - } - break - case 3: - secondByte = buf[i + 1] - thirdByte = buf[i + 2] - if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) { - tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F) - if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) { - codePoint = tempCodePoint - } - } - break - case 4: - secondByte = buf[i + 1] - thirdByte = buf[i + 2] - fourthByte = buf[i + 3] - if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80 && (fourthByte & 0xC0) === 0x80) { - tempCodePoint = (firstByte & 0xF) << 0x12 | (secondByte & 0x3F) << 0xC | (thirdByte & 0x3F) << 0x6 | (fourthByte & 0x3F) - if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) { - codePoint = tempCodePoint - } - } - } - } - - if (codePoint === null) { - // we did not generate a valid codePoint so insert a - // replacement char (U+FFFD) and advance only 1 byte - codePoint = 0xFFFD - bytesPerSequence = 1 - } else if (codePoint > 0xFFFF) { - // encode to utf16 (surrogate pair dance) - codePoint -= 0x10000 - res.push(codePoint >>> 10 & 0x3FF | 0xD800) - codePoint = 0xDC00 | codePoint & 0x3FF - } - - res.push(codePoint) - i += bytesPerSequence - } - - return decodeCodePointsArray(res) -} - -// Based on http://stackoverflow.com/a/22747272/680742, the browser with -// the lowest limit is Chrome, with 0x10000 args. -// We go 1 magnitude less, for safety -const MAX_ARGUMENTS_LENGTH = 0x1000 - -function decodeCodePointsArray (codePoints) { - const len = codePoints.length - if (len <= MAX_ARGUMENTS_LENGTH) { - return String.fromCharCode.apply(String, codePoints) // avoid extra slice() - } - - // Decode in chunks to avoid "call stack size exceeded". - let res = '' - let i = 0 - while (i < len) { - res += String.fromCharCode.apply( - String, - codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH) - ) - } - return res -} - -function asciiSlice (buf, start, end) { - let ret = '' - end = Math.min(buf.length, end) - - for (let i = start; i < end; ++i) { - ret += String.fromCharCode(buf[i] & 0x7F) - } - return ret -} - -function latin1Slice (buf, start, end) { - let ret = '' - end = Math.min(buf.length, end) - - for (let i = start; i < end; ++i) { - ret += String.fromCharCode(buf[i]) - } - return ret -} - -function hexSlice (buf, start, end) { - const len = buf.length - - if (!start || start < 0) start = 0 - if (!end || end < 0 || end > len) end = len - - let out = '' - for (let i = start; i < end; ++i) { - out += hexSliceLookupTable[buf[i]] - } - return out -} - -function utf16leSlice (buf, start, end) { - const bytes = buf.slice(start, end) - let res = '' - // If bytes.length is odd, the last 8 bits must be ignored (same as node.js) - for (let i = 0; i < bytes.length - 1; i += 2) { - res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256)) - } - return res -} - -Buffer.prototype.slice = function slice (start, end) { - const len = this.length - start = ~~start - end = end === undefined ? len : ~~end - - if (start < 0) { - start += len - if (start < 0) start = 0 - } else if (start > len) { - start = len - } - - if (end < 0) { - end += len - if (end < 0) end = 0 - } else if (end > len) { - end = len - } - - if (end < start) end = start - - const newBuf = this.subarray(start, end) - // Return an augmented `Uint8Array` instance - Object.setPrototypeOf(newBuf, Buffer.prototype) - - return newBuf -} - -/* - * Need to make sure that buffer isn't trying to write out of bounds. - */ -function checkOffset (offset, ext, length) { - if ((offset % 1) !== 0 || offset < 0) throw new RangeError('offset is not uint') - if (offset + ext > length) throw new RangeError('Trying to access beyond buffer length') -} - -Buffer.prototype.readUintLE = -Buffer.prototype.readUIntLE = function readUIntLE (offset, byteLength, noAssert) { - offset = offset >>> 0 - byteLength = byteLength >>> 0 - if (!noAssert) checkOffset(offset, byteLength, this.length) - - let val = this[offset] - let mul = 1 - let i = 0 - while (++i < byteLength && (mul *= 0x100)) { - val += this[offset + i] * mul - } - - return val -} - -Buffer.prototype.readUintBE = -Buffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) { - offset = offset >>> 0 - byteLength = byteLength >>> 0 - if (!noAssert) { - checkOffset(offset, byteLength, this.length) - } - - let val = this[offset + --byteLength] - let mul = 1 - while (byteLength > 0 && (mul *= 0x100)) { - val += this[offset + --byteLength] * mul - } - - return val -} - -Buffer.prototype.readUint8 = -Buffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 1, this.length) - return this[offset] -} - -Buffer.prototype.readUint16LE = -Buffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 2, this.length) - return this[offset] | (this[offset + 1] << 8) -} - -Buffer.prototype.readUint16BE = -Buffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 2, this.length) - return (this[offset] << 8) | this[offset + 1] -} - -Buffer.prototype.readUint32LE = -Buffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 4, this.length) - - return ((this[offset]) | - (this[offset + 1] << 8) | - (this[offset + 2] << 16)) + - (this[offset + 3] * 0x1000000) -} - -Buffer.prototype.readUint32BE = -Buffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 4, this.length) - - return (this[offset] * 0x1000000) + - ((this[offset + 1] << 16) | - (this[offset + 2] << 8) | - this[offset + 3]) -} - -Buffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) { - offset = offset >>> 0 - validateNumber(offset, 'offset') - const first = this[offset] - const last = this[offset + 7] - if (first === undefined || last === undefined) { - boundsError(offset, this.length - 8) - } - - const lo = first + - this[++offset] * 2 ** 8 + - this[++offset] * 2 ** 16 + - this[++offset] * 2 ** 24 - - const hi = this[++offset] + - this[++offset] * 2 ** 8 + - this[++offset] * 2 ** 16 + - last * 2 ** 24 - - return BigInt(lo) + (BigInt(hi) << BigInt(32)) -}) - -Buffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) { - offset = offset >>> 0 - validateNumber(offset, 'offset') - const first = this[offset] - const last = this[offset + 7] - if (first === undefined || last === undefined) { - boundsError(offset, this.length - 8) - } - - const hi = first * 2 ** 24 + - this[++offset] * 2 ** 16 + - this[++offset] * 2 ** 8 + - this[++offset] - - const lo = this[++offset] * 2 ** 24 + - this[++offset] * 2 ** 16 + - this[++offset] * 2 ** 8 + - last - - return (BigInt(hi) << BigInt(32)) + BigInt(lo) -}) - -Buffer.prototype.readIntLE = function readIntLE (offset, byteLength, noAssert) { - offset = offset >>> 0 - byteLength = byteLength >>> 0 - if (!noAssert) checkOffset(offset, byteLength, this.length) - - let val = this[offset] - let mul = 1 - let i = 0 - while (++i < byteLength && (mul *= 0x100)) { - val += this[offset + i] * mul - } - mul *= 0x80 - - if (val >= mul) val -= Math.pow(2, 8 * byteLength) - - return val -} - -Buffer.prototype.readIntBE = function readIntBE (offset, byteLength, noAssert) { - offset = offset >>> 0 - byteLength = byteLength >>> 0 - if (!noAssert) checkOffset(offset, byteLength, this.length) - - let i = byteLength - let mul = 1 - let val = this[offset + --i] - while (i > 0 && (mul *= 0x100)) { - val += this[offset + --i] * mul - } - mul *= 0x80 - - if (val >= mul) val -= Math.pow(2, 8 * byteLength) - - return val -} - -Buffer.prototype.readInt8 = function readInt8 (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 1, this.length) - if (!(this[offset] & 0x80)) return (this[offset]) - return ((0xff - this[offset] + 1) * -1) -} - -Buffer.prototype.readInt16LE = function readInt16LE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 2, this.length) - const val = this[offset] | (this[offset + 1] << 8) - return (val & 0x8000) ? val | 0xFFFF0000 : val -} - -Buffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 2, this.length) - const val = this[offset + 1] | (this[offset] << 8) - return (val & 0x8000) ? val | 0xFFFF0000 : val -} - -Buffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 4, this.length) - - return (this[offset]) | - (this[offset + 1] << 8) | - (this[offset + 2] << 16) | - (this[offset + 3] << 24) -} - -Buffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 4, this.length) - - return (this[offset] << 24) | - (this[offset + 1] << 16) | - (this[offset + 2] << 8) | - (this[offset + 3]) -} - -Buffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) { - offset = offset >>> 0 - validateNumber(offset, 'offset') - const first = this[offset] - const last = this[offset + 7] - if (first === undefined || last === undefined) { - boundsError(offset, this.length - 8) - } - - const val = this[offset + 4] + - this[offset + 5] * 2 ** 8 + - this[offset + 6] * 2 ** 16 + - (last << 24) // Overflow - - return (BigInt(val) << BigInt(32)) + - BigInt(first + - this[++offset] * 2 ** 8 + - this[++offset] * 2 ** 16 + - this[++offset] * 2 ** 24) -}) - -Buffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) { - offset = offset >>> 0 - validateNumber(offset, 'offset') - const first = this[offset] - const last = this[offset + 7] - if (first === undefined || last === undefined) { - boundsError(offset, this.length - 8) - } - - const val = (first << 24) + // Overflow - this[++offset] * 2 ** 16 + - this[++offset] * 2 ** 8 + - this[++offset] - - return (BigInt(val) << BigInt(32)) + - BigInt(this[++offset] * 2 ** 24 + - this[++offset] * 2 ** 16 + - this[++offset] * 2 ** 8 + - last) -}) - -Buffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 4, this.length) - return ieee754.read(this, offset, true, 23, 4) -} - -Buffer.prototype.readFloatBE = function readFloatBE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 4, this.length) - return ieee754.read(this, offset, false, 23, 4) -} - -Buffer.prototype.readDoubleLE = function readDoubleLE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 8, this.length) - return ieee754.read(this, offset, true, 52, 8) -} - -Buffer.prototype.readDoubleBE = function readDoubleBE (offset, noAssert) { - offset = offset >>> 0 - if (!noAssert) checkOffset(offset, 8, this.length) - return ieee754.read(this, offset, false, 52, 8) -} - -function checkInt (buf, value, offset, ext, max, min) { - if (!Buffer.isBuffer(buf)) throw new TypeError('"buffer" argument must be a Buffer instance') - if (value > max || value < min) throw new RangeError('"value" argument is out of bounds') - if (offset + ext > buf.length) throw new RangeError('Index out of range') -} - -Buffer.prototype.writeUintLE = -Buffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) { - value = +value - offset = offset >>> 0 - byteLength = byteLength >>> 0 - if (!noAssert) { - const maxBytes = Math.pow(2, 8 * byteLength) - 1 - checkInt(this, value, offset, byteLength, maxBytes, 0) - } - - let mul = 1 - let i = 0 - this[offset] = value & 0xFF - while (++i < byteLength && (mul *= 0x100)) { - this[offset + i] = (value / mul) & 0xFF - } - - return offset + byteLength -} - -Buffer.prototype.writeUintBE = -Buffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) { - value = +value - offset = offset >>> 0 - byteLength = byteLength >>> 0 - if (!noAssert) { - const maxBytes = Math.pow(2, 8 * byteLength) - 1 - checkInt(this, value, offset, byteLength, maxBytes, 0) - } - - let i = byteLength - 1 - let mul = 1 - this[offset + i] = value & 0xFF - while (--i >= 0 && (mul *= 0x100)) { - this[offset + i] = (value / mul) & 0xFF - } - - return offset + byteLength -} - -Buffer.prototype.writeUint8 = -Buffer.prototype.writeUInt8 = function writeUInt8 (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 1, 0xff, 0) - this[offset] = (value & 0xff) - return offset + 1 -} - -Buffer.prototype.writeUint16LE = -Buffer.prototype.writeUInt16LE = function writeUInt16LE (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0) - this[offset] = (value & 0xff) - this[offset + 1] = (value >>> 8) - return offset + 2 -} - -Buffer.prototype.writeUint16BE = -Buffer.prototype.writeUInt16BE = function writeUInt16BE (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 2, 0xffff, 0) - this[offset] = (value >>> 8) - this[offset + 1] = (value & 0xff) - return offset + 2 -} - -Buffer.prototype.writeUint32LE = -Buffer.prototype.writeUInt32LE = function writeUInt32LE (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0) - this[offset + 3] = (value >>> 24) - this[offset + 2] = (value >>> 16) - this[offset + 1] = (value >>> 8) - this[offset] = (value & 0xff) - return offset + 4 -} - -Buffer.prototype.writeUint32BE = -Buffer.prototype.writeUInt32BE = function writeUInt32BE (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 4, 0xffffffff, 0) - this[offset] = (value >>> 24) - this[offset + 1] = (value >>> 16) - this[offset + 2] = (value >>> 8) - this[offset + 3] = (value & 0xff) - return offset + 4 -} - -function wrtBigUInt64LE (buf, value, offset, min, max) { - checkIntBI(value, min, max, buf, offset, 7) - - let lo = Number(value & BigInt(0xffffffff)) - buf[offset++] = lo - lo = lo >> 8 - buf[offset++] = lo - lo = lo >> 8 - buf[offset++] = lo - lo = lo >> 8 - buf[offset++] = lo - let hi = Number(value >> BigInt(32) & BigInt(0xffffffff)) - buf[offset++] = hi - hi = hi >> 8 - buf[offset++] = hi - hi = hi >> 8 - buf[offset++] = hi - hi = hi >> 8 - buf[offset++] = hi - return offset -} - -function wrtBigUInt64BE (buf, value, offset, min, max) { - checkIntBI(value, min, max, buf, offset, 7) - - let lo = Number(value & BigInt(0xffffffff)) - buf[offset + 7] = lo - lo = lo >> 8 - buf[offset + 6] = lo - lo = lo >> 8 - buf[offset + 5] = lo - lo = lo >> 8 - buf[offset + 4] = lo - let hi = Number(value >> BigInt(32) & BigInt(0xffffffff)) - buf[offset + 3] = hi - hi = hi >> 8 - buf[offset + 2] = hi - hi = hi >> 8 - buf[offset + 1] = hi - hi = hi >> 8 - buf[offset] = hi - return offset + 8 -} - -Buffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) { - return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff')) -}) - -Buffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) { - return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff')) -}) - -Buffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) { - const limit = Math.pow(2, (8 * byteLength) - 1) - - checkInt(this, value, offset, byteLength, limit - 1, -limit) - } - - let i = 0 - let mul = 1 - let sub = 0 - this[offset] = value & 0xFF - while (++i < byteLength && (mul *= 0x100)) { - if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) { - sub = 1 - } - this[offset + i] = ((value / mul) >> 0) - sub & 0xFF - } - - return offset + byteLength -} - -Buffer.prototype.writeIntBE = function writeIntBE (value, offset, byteLength, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) { - const limit = Math.pow(2, (8 * byteLength) - 1) - - checkInt(this, value, offset, byteLength, limit - 1, -limit) - } - - let i = byteLength - 1 - let mul = 1 - let sub = 0 - this[offset + i] = value & 0xFF - while (--i >= 0 && (mul *= 0x100)) { - if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) { - sub = 1 - } - this[offset + i] = ((value / mul) >> 0) - sub & 0xFF - } - - return offset + byteLength -} - -Buffer.prototype.writeInt8 = function writeInt8 (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 1, 0x7f, -0x80) - if (value < 0) value = 0xff + value + 1 - this[offset] = (value & 0xff) - return offset + 1 -} - -Buffer.prototype.writeInt16LE = function writeInt16LE (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000) - this[offset] = (value & 0xff) - this[offset + 1] = (value >>> 8) - return offset + 2 -} - -Buffer.prototype.writeInt16BE = function writeInt16BE (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 2, 0x7fff, -0x8000) - this[offset] = (value >>> 8) - this[offset + 1] = (value & 0xff) - return offset + 2 -} - -Buffer.prototype.writeInt32LE = function writeInt32LE (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000) - this[offset] = (value & 0xff) - this[offset + 1] = (value >>> 8) - this[offset + 2] = (value >>> 16) - this[offset + 3] = (value >>> 24) - return offset + 4 -} - -Buffer.prototype.writeInt32BE = function writeInt32BE (value, offset, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) checkInt(this, value, offset, 4, 0x7fffffff, -0x80000000) - if (value < 0) value = 0xffffffff + value + 1 - this[offset] = (value >>> 24) - this[offset + 1] = (value >>> 16) - this[offset + 2] = (value >>> 8) - this[offset + 3] = (value & 0xff) - return offset + 4 -} - -Buffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) { - return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff')) -}) - -Buffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) { - return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff')) -}) - -function checkIEEE754 (buf, value, offset, ext, max, min) { - if (offset + ext > buf.length) throw new RangeError('Index out of range') - if (offset < 0) throw new RangeError('Index out of range') -} - -function writeFloat (buf, value, offset, littleEndian, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) { - checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38) - } - ieee754.write(buf, value, offset, littleEndian, 23, 4) - return offset + 4 -} - -Buffer.prototype.writeFloatLE = function writeFloatLE (value, offset, noAssert) { - return writeFloat(this, value, offset, true, noAssert) -} - -Buffer.prototype.writeFloatBE = function writeFloatBE (value, offset, noAssert) { - return writeFloat(this, value, offset, false, noAssert) -} - -function writeDouble (buf, value, offset, littleEndian, noAssert) { - value = +value - offset = offset >>> 0 - if (!noAssert) { - checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308) - } - ieee754.write(buf, value, offset, littleEndian, 52, 8) - return offset + 8 -} - -Buffer.prototype.writeDoubleLE = function writeDoubleLE (value, offset, noAssert) { - return writeDouble(this, value, offset, true, noAssert) -} - -Buffer.prototype.writeDoubleBE = function writeDoubleBE (value, offset, noAssert) { - return writeDouble(this, value, offset, false, noAssert) -} - -// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length) -Buffer.prototype.copy = function copy (target, targetStart, start, end) { - if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer') - if (!start) start = 0 - if (!end && end !== 0) end = this.length - if (targetStart >= target.length) targetStart = target.length - if (!targetStart) targetStart = 0 - if (end > 0 && end < start) end = start - - // Copy 0 bytes; we're done - if (end === start) return 0 - if (target.length === 0 || this.length === 0) return 0 - - // Fatal error conditions - if (targetStart < 0) { - throw new RangeError('targetStart out of bounds') - } - if (start < 0 || start >= this.length) throw new RangeError('Index out of range') - if (end < 0) throw new RangeError('sourceEnd out of bounds') - - // Are we oob? - if (end > this.length) end = this.length - if (target.length - targetStart < end - start) { - end = target.length - targetStart + start - } - - const len = end - start - - if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') { - // Use built-in when available, missing from IE11 - this.copyWithin(targetStart, start, end) - } else { - Uint8Array.prototype.set.call( - target, - this.subarray(start, end), - targetStart - ) - } - - return len -} - -// Usage: -// buffer.fill(number[, offset[, end]]) -// buffer.fill(buffer[, offset[, end]]) -// buffer.fill(string[, offset[, end]][, encoding]) -Buffer.prototype.fill = function fill (val, start, end, encoding) { - // Handle string cases: - if (typeof val === 'string') { - if (typeof start === 'string') { - encoding = start - start = 0 - end = this.length - } else if (typeof end === 'string') { - encoding = end - end = this.length - } - if (encoding !== undefined && typeof encoding !== 'string') { - throw new TypeError('encoding must be a string') - } - if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) { - throw new TypeError('Unknown encoding: ' + encoding) - } - if (val.length === 1) { - const code = val.charCodeAt(0) - if ((encoding === 'utf8' && code < 128) || - encoding === 'latin1') { - // Fast path: If `val` fits into a single byte, use that numeric value. - val = code - } - } - } else if (typeof val === 'number') { - val = val & 255 - } else if (typeof val === 'boolean') { - val = Number(val) - } - - // Invalid ranges are not set to a default, so can range check early. - if (start < 0 || this.length < start || this.length < end) { - throw new RangeError('Out of range index') - } - - if (end <= start) { - return this - } - - start = start >>> 0 - end = end === undefined ? this.length : end >>> 0 - - if (!val) val = 0 - - let i - if (typeof val === 'number') { - for (i = start; i < end; ++i) { - this[i] = val - } - } else { - const bytes = Buffer.isBuffer(val) - ? val - : Buffer.from(val, encoding) - const len = bytes.length - if (len === 0) { - throw new TypeError('The value "' + val + - '" is invalid for argument "value"') - } - for (i = 0; i < end - start; ++i) { - this[i + start] = bytes[i % len] - } - } - - return this -} - -// CUSTOM ERRORS -// ============= - -// Simplified versions from Node, changed for Buffer-only usage -const errors = {} -function E (sym, getMessage, Base) { - errors[sym] = class NodeError extends Base { - constructor () { - super() - - Object.defineProperty(this, 'message', { - value: getMessage.apply(this, arguments), - writable: true, - configurable: true - }) - - // Add the error code to the name to include it in the stack trace. - this.name = `${this.name} [${sym}]` - // Access the stack to generate the error message including the error code - // from the name. - this.stack // eslint-disable-line no-unused-expressions - // Reset the name to the actual name. - delete this.name - } - - get code () { - return sym - } - - set code (value) { - Object.defineProperty(this, 'code', { - configurable: true, - enumerable: true, - value, - writable: true - }) - } - - toString () { - return `${this.name} [${sym}]: ${this.message}` - } - } -} - -E('ERR_BUFFER_OUT_OF_BOUNDS', - function (name) { - if (name) { - return `${name} is outside of buffer bounds` - } - - return 'Attempt to access memory outside buffer bounds' - }, RangeError) -E('ERR_INVALID_ARG_TYPE', - function (name, actual) { - return `The "${name}" argument must be of type number. Received type ${typeof actual}` - }, TypeError) -E('ERR_OUT_OF_RANGE', - function (str, range, input) { - let msg = `The value of "${str}" is out of range.` - let received = input - if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) { - received = addNumericalSeparator(String(input)) - } else if (typeof input === 'bigint') { - received = String(input) - if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) { - received = addNumericalSeparator(received) - } - received += 'n' - } - msg += ` It must be ${range}. Received ${received}` - return msg - }, RangeError) - -function addNumericalSeparator (val) { - let res = '' - let i = val.length - const start = val[0] === '-' ? 1 : 0 - for (; i >= start + 4; i -= 3) { - res = `_${val.slice(i - 3, i)}${res}` - } - return `${val.slice(0, i)}${res}` -} - -// CHECK FUNCTIONS -// =============== - -function checkBounds (buf, offset, byteLength) { - validateNumber(offset, 'offset') - if (buf[offset] === undefined || buf[offset + byteLength] === undefined) { - boundsError(offset, buf.length - (byteLength + 1)) - } -} - -function checkIntBI (value, min, max, buf, offset, byteLength) { - if (value > max || value < min) { - const n = typeof min === 'bigint' ? 'n' : '' - let range - if (byteLength > 3) { - if (min === 0 || min === BigInt(0)) { - range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}` - } else { - range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` + - `${(byteLength + 1) * 8 - 1}${n}` - } - } else { - range = `>= ${min}${n} and <= ${max}${n}` - } - throw new errors.ERR_OUT_OF_RANGE('value', range, value) - } - checkBounds(buf, offset, byteLength) -} - -function validateNumber (value, name) { - if (typeof value !== 'number') { - throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value) - } -} - -function boundsError (value, length, type) { - if (Math.floor(value) !== value) { - validateNumber(value, type) - throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value) - } - - if (length < 0) { - throw new errors.ERR_BUFFER_OUT_OF_BOUNDS() - } - - throw new errors.ERR_OUT_OF_RANGE(type || 'offset', - `>= ${type ? 1 : 0} and <= ${length}`, - value) -} - -// HELPER FUNCTIONS -// ================ - -const INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g - -function base64clean (str) { - // Node takes equal signs as end of the Base64 encoding - str = str.split('=')[0] - // Node strips out invalid characters like \n and \t from the string, base64-js does not - str = str.trim().replace(INVALID_BASE64_RE, '') - // Node converts strings with length < 2 to '' - if (str.length < 2) return '' - // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not - while (str.length % 4 !== 0) { - str = str + '=' - } - return str -} - -function utf8ToBytes (string, units) { - units = units || Infinity - let codePoint - const length = string.length - let leadSurrogate = null - const bytes = [] - - for (let i = 0; i < length; ++i) { - codePoint = string.charCodeAt(i) - - // is surrogate component - if (codePoint > 0xD7FF && codePoint < 0xE000) { - // last char was a lead - if (!leadSurrogate) { - // no lead yet - if (codePoint > 0xDBFF) { - // unexpected trail - if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) - continue - } else if (i + 1 === length) { - // unpaired lead - if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) - continue - } - - // valid lead - leadSurrogate = codePoint - - continue - } - - // 2 leads in a row - if (codePoint < 0xDC00) { - if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) - leadSurrogate = codePoint - continue - } - - // valid surrogate pair - codePoint = (leadSurrogate - 0xD800 << 10 | codePoint - 0xDC00) + 0x10000 - } else if (leadSurrogate) { - // valid bmp char, but last char was a lead - if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD) - } - - leadSurrogate = null - - // encode utf8 - if (codePoint < 0x80) { - if ((units -= 1) < 0) break - bytes.push(codePoint) - } else if (codePoint < 0x800) { - if ((units -= 2) < 0) break - bytes.push( - codePoint >> 0x6 | 0xC0, - codePoint & 0x3F | 0x80 - ) - } else if (codePoint < 0x10000) { - if ((units -= 3) < 0) break - bytes.push( - codePoint >> 0xC | 0xE0, - codePoint >> 0x6 & 0x3F | 0x80, - codePoint & 0x3F | 0x80 - ) - } else if (codePoint < 0x110000) { - if ((units -= 4) < 0) break - bytes.push( - codePoint >> 0x12 | 0xF0, - codePoint >> 0xC & 0x3F | 0x80, - codePoint >> 0x6 & 0x3F | 0x80, - codePoint & 0x3F | 0x80 - ) - } else { - throw new Error('Invalid code point') - } - } - - return bytes -} - -function asciiToBytes (str) { - const byteArray = [] - for (let i = 0; i < str.length; ++i) { - // Node's code seems to be doing this and not & 0x7F.. - byteArray.push(str.charCodeAt(i) & 0xFF) - } - return byteArray -} - -function utf16leToBytes (str, units) { - let c, hi, lo - const byteArray = [] - for (let i = 0; i < str.length; ++i) { - if ((units -= 2) < 0) break - - c = str.charCodeAt(i) - hi = c >> 8 - lo = c % 256 - byteArray.push(lo) - byteArray.push(hi) - } - - return byteArray -} - -function base64ToBytes (str) { - return base64.toByteArray(base64clean(str)) -} - -function blitBuffer (src, dst, offset, length) { - let i - for (i = 0; i < length; ++i) { - if ((i + offset >= dst.length) || (i >= src.length)) break - dst[i + offset] = src[i] - } - return i -} - -// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass -// the `instanceof` check but they should be treated as of that type. -// See: https://github.com/feross/buffer/issues/166 -function isInstance (obj, type) { - return obj instanceof type || - (obj != null && obj.constructor != null && obj.constructor.name != null && - obj.constructor.name === type.name) -} -function numberIsNaN (obj) { - // For IE11 support - return obj !== obj // eslint-disable-line no-self-compare -} - -// Create lookup table for `toString('hex')` -// See: https://github.com/feross/buffer/issues/219 -const hexSliceLookupTable = (function () { - const alphabet = '0123456789abcdef' - const table = new Array(256) - for (let i = 0; i < 16; ++i) { - const i16 = i * 16 - for (let j = 0; j < 16; ++j) { - table[i16 + j] = alphabet[i] + alphabet[j] - } - } - return table -})() - -// Return not function with Error if BigInt not supported -function defineBigIntMethod (fn) { - return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn -} - -function BufferBigIntNotDefined () { - throw new Error('BigInt not supported') -} - - -/***/ }), - -/***/ "./node_modules/builtin-status-codes/browser.js": -/*!******************************************************!*\ - !*** ./node_modules/builtin-status-codes/browser.js ***! - \******************************************************/ -/***/ ((module) => { - -module.exports = { - "100": "Continue", - "101": "Switching Protocols", - "102": "Processing", - "200": "OK", - "201": "Created", - "202": "Accepted", - "203": "Non-Authoritative Information", - "204": "No Content", - "205": "Reset Content", - "206": "Partial Content", - "207": "Multi-Status", - "208": "Already Reported", - "226": "IM Used", - "300": "Multiple Choices", - "301": "Moved Permanently", - "302": "Found", - "303": "See Other", - "304": "Not Modified", - "305": "Use Proxy", - "307": "Temporary Redirect", - "308": "Permanent Redirect", - "400": "Bad Request", - "401": "Unauthorized", - "402": "Payment Required", - "403": "Forbidden", - "404": "Not Found", - "405": "Method Not Allowed", - "406": "Not Acceptable", - "407": "Proxy Authentication Required", - "408": "Request Timeout", - "409": "Conflict", - "410": "Gone", - "411": "Length Required", - "412": "Precondition Failed", - "413": "Payload Too Large", - "414": "URI Too Long", - "415": "Unsupported Media Type", - "416": "Range Not Satisfiable", - "417": "Expectation Failed", - "418": "I'm a teapot", - "421": "Misdirected Request", - "422": "Unprocessable Entity", - "423": "Locked", - "424": "Failed Dependency", - "425": "Unordered Collection", - "426": "Upgrade Required", - "428": "Precondition Required", - "429": "Too Many Requests", - "431": "Request Header Fields Too Large", - "451": "Unavailable For Legal Reasons", - "500": "Internal Server Error", - "501": "Not Implemented", - "502": "Bad Gateway", - "503": "Service Unavailable", - "504": "Gateway Timeout", - "505": "HTTP Version Not Supported", - "506": "Variant Also Negotiates", - "507": "Insufficient Storage", - "508": "Loop Detected", - "509": "Bandwidth Limit Exceeded", - "510": "Not Extended", - "511": "Network Authentication Required" -} - - -/***/ }), - -/***/ "./node_modules/cache-chunk-store/index.js": -/*!*************************************************!*\ - !*** ./node_modules/cache-chunk-store/index.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*! cache-chunk-store. MIT License. Feross Aboukhadijeh */ -const LRU = __webpack_require__(/*! lru */ "./node_modules/lru/index.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -class CacheStore { - constructor (store, opts) { - this.store = store - this.chunkLength = store.chunkLength - this.inProgressGets = new Map() // Map from chunk index to info on callbacks waiting for that chunk - - if (!this.store || !this.store.get || !this.store.put) { - throw new Error('First argument must be abstract-chunk-store compliant') - } - - this.cache = new LRU(opts) - } - - put (index, buf, cb = () => {}) { - if (!this.cache) { - return queueMicrotask(() => cb(new Error('CacheStore closed'))) - } - - this.cache.remove(index) - this.store.put(index, buf, cb) - } - - get (index, opts, cb = () => {}) { - if (typeof opts === 'function') return this.get(index, null, opts) - - if (!this.cache) { - return queueMicrotask(() => cb(new Error('CacheStore closed'))) - } - - if (!opts) opts = {} - - let buf = this.cache.get(index) - if (buf) { - const offset = opts.offset || 0 - const len = opts.length || (buf.length - offset) - if (offset !== 0 || len !== buf.length) { - buf = buf.slice(offset, len + offset) - } - return queueMicrotask(() => cb(null, buf)) - } - - // See if a get for this index has already started - let waiters = this.inProgressGets.get(index) - const getAlreadyStarted = !!waiters - if (!waiters) { - waiters = [] - this.inProgressGets.set(index, waiters) - } - - waiters.push({ - opts, - cb - }) - - if (!getAlreadyStarted) { - this.store.get(index, (err, buf) => { - if (!err && this.cache != null) this.cache.set(index, buf) - - const inProgressEntry = this.inProgressGets.get(index) - this.inProgressGets.delete(index) - - for (const { opts, cb } of inProgressEntry) { - if (err) { - cb(err) - } else { - const offset = opts.offset || 0 - const len = opts.length || (buf.length - offset) - let slicedBuf = buf - if (offset !== 0 || len !== buf.length) { - slicedBuf = buf.slice(offset, len + offset) - } - cb(null, slicedBuf) - } - } - }) - } - } - - close (cb = () => {}) { - if (!this.cache) { - return queueMicrotask(() => cb(new Error('CacheStore closed'))) - } - - this.cache = null - this.store.close(cb) - } - - destroy (cb = () => {}) { - if (!this.cache) { - return queueMicrotask(() => cb(new Error('CacheStore closed'))) - } - - this.cache = null - this.store.destroy(cb) - } -} - -module.exports = CacheStore - - -/***/ }), - -/***/ "./node_modules/call-bind/callBound.js": -/*!*********************************************!*\ - !*** ./node_modules/call-bind/callBound.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var GetIntrinsic = __webpack_require__(/*! get-intrinsic */ "./node_modules/get-intrinsic/index.js"); - -var callBind = __webpack_require__(/*! ./ */ "./node_modules/call-bind/index.js"); - -var $indexOf = callBind(GetIntrinsic('String.prototype.indexOf')); - -module.exports = function callBoundIntrinsic(name, allowMissing) { - var intrinsic = GetIntrinsic(name, !!allowMissing); - if (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) { - return callBind(intrinsic); - } - return intrinsic; -}; - - -/***/ }), - -/***/ "./node_modules/call-bind/index.js": -/*!*****************************************!*\ - !*** ./node_modules/call-bind/index.js ***! - \*****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var bind = __webpack_require__(/*! function-bind */ "./node_modules/function-bind/index.js"); -var GetIntrinsic = __webpack_require__(/*! get-intrinsic */ "./node_modules/get-intrinsic/index.js"); - -var $apply = GetIntrinsic('%Function.prototype.apply%'); -var $call = GetIntrinsic('%Function.prototype.call%'); -var $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply); - -var $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true); -var $defineProperty = GetIntrinsic('%Object.defineProperty%', true); -var $max = GetIntrinsic('%Math.max%'); - -if ($defineProperty) { - try { - $defineProperty({}, 'a', { value: 1 }); - } catch (e) { - // IE 8 has a broken defineProperty - $defineProperty = null; - } -} - -module.exports = function callBind(originalFunction) { - var func = $reflectApply(bind, $call, arguments); - if ($gOPD && $defineProperty) { - var desc = $gOPD(func, 'length'); - if (desc.configurable) { - // original length, plus the receiver, minus any additional arguments (after the receiver) - $defineProperty( - func, - 'length', - { value: 1 + $max(0, originalFunction.length - (arguments.length - 1)) } - ); - } - } - return func; -}; - -var applyBind = function applyBind() { - return $reflectApply(bind, $apply, arguments); -}; - -if ($defineProperty) { - $defineProperty(module.exports, 'apply', { value: applyBind }); -} else { - module.exports.apply = applyBind; -} - - -/***/ }), - -/***/ "./node_modules/chunk-store-stream/write.js": -/*!**************************************************!*\ - !*** ./node_modules/chunk-store-stream/write.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const BlockStream = __webpack_require__(/*! block-stream2 */ "./node_modules/block-stream2/index.js") -const stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") - -class ChunkStoreWriteStream extends stream.Writable { - constructor (store, chunkLength, opts = {}) { - super(opts) - - if (!store || !store.put || !store.get) { - throw new Error('First argument must be an abstract-chunk-store compliant store') - } - chunkLength = Number(chunkLength) - if (!chunkLength) throw new Error('Second argument must be a chunk length') - - const zeroPadding = opts.zeroPadding === undefined ? false : opts.zeroPadding - this._blockstream = new BlockStream(chunkLength, { ...opts, zeroPadding }) - this._outstandingPuts = 0 - this._storeMaxOutstandingPuts = opts.storeMaxOutstandingPuts || 16 - - let index = 0 - const onData = chunk => { - if (this.destroyed) return - - this._outstandingPuts += 1 - if (this._outstandingPuts >= this._storeMaxOutstandingPuts) { - this._blockstream.pause() - } - store.put(index, chunk, (err) => { - if (err) return this.destroy(err) - this._outstandingPuts -= 1 - if (this._outstandingPuts < this._storeMaxOutstandingPuts) { - this._blockstream.resume() - } - if (this._outstandingPuts === 0 && typeof this._finalCb === 'function') { - this._finalCb(null) - this._finalCb = null - } - }) - index += 1 - } - - this._blockstream - .on('data', onData) - .on('error', err => { this.destroy(err) }) - } - - _write (chunk, encoding, callback) { - this._blockstream.write(chunk, encoding, callback) - } - - _final (cb) { - this._blockstream.end() - this._blockstream.once('end', () => { - if (this._outstandingPuts === 0) cb(null) - else this._finalCb = cb - }) - } - - destroy (err) { - if (this.destroyed) return - this.destroyed = true - - if (err) this.emit('error', err) - this.emit('close') - } -} - -module.exports = ChunkStoreWriteStream - - -/***/ }), - -/***/ "./node_modules/cipher-base/index.js": -/*!*******************************************!*\ - !*** ./node_modules/cipher-base/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var Transform = __webpack_require__(/*! stream */ "./node_modules/stream-browserify/index.js").Transform -var StringDecoder = __webpack_require__(/*! string_decoder */ "./node_modules/string_decoder/lib/string_decoder.js").StringDecoder -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") - -function CipherBase (hashMode) { - Transform.call(this) - this.hashMode = typeof hashMode === 'string' - if (this.hashMode) { - this[hashMode] = this._finalOrDigest - } else { - this.final = this._finalOrDigest - } - if (this._final) { - this.__final = this._final - this._final = null - } - this._decoder = null - this._encoding = null -} -inherits(CipherBase, Transform) - -CipherBase.prototype.update = function (data, inputEnc, outputEnc) { - if (typeof data === 'string') { - data = Buffer.from(data, inputEnc) - } - - var outData = this._update(data) - if (this.hashMode) return this - - if (outputEnc) { - outData = this._toString(outData, outputEnc) - } - - return outData -} - -CipherBase.prototype.setAutoPadding = function () {} -CipherBase.prototype.getAuthTag = function () { - throw new Error('trying to get auth tag in unsupported state') -} - -CipherBase.prototype.setAuthTag = function () { - throw new Error('trying to set auth tag in unsupported state') -} - -CipherBase.prototype.setAAD = function () { - throw new Error('trying to set aad in unsupported state') -} - -CipherBase.prototype._transform = function (data, _, next) { - var err - try { - if (this.hashMode) { - this._update(data) - } else { - this.push(this._update(data)) - } - } catch (e) { - err = e - } finally { - next(err) - } -} -CipherBase.prototype._flush = function (done) { - var err - try { - this.push(this.__final()) - } catch (e) { - err = e - } - - done(err) -} -CipherBase.prototype._finalOrDigest = function (outputEnc) { - var outData = this.__final() || Buffer.alloc(0) - if (outputEnc) { - outData = this._toString(outData, outputEnc, true) - } - return outData -} - -CipherBase.prototype._toString = function (value, enc, fin) { - if (!this._decoder) { - this._decoder = new StringDecoder(enc) - this._encoding = enc - } - - if (this._encoding !== enc) throw new Error('can\'t switch encodings') - - var out = this._decoder.write(value) - if (fin) { - out += this._decoder.end() - } - - return out -} - -module.exports = CipherBase - - -/***/ }), - -/***/ "./node_modules/console-browserify/index.js": -/*!**************************************************!*\ - !*** ./node_modules/console-browserify/index.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*global window, global*/ -var util = __webpack_require__(/*! util */ "./node_modules/util/util.js") -var assert = __webpack_require__(/*! assert */ "./node_modules/assert/build/assert.js") -function now() { return new Date().getTime() } - -var slice = Array.prototype.slice -var console -var times = {} - -if (typeof __webpack_require__.g !== "undefined" && __webpack_require__.g.console) { - console = __webpack_require__.g.console -} else if (typeof window !== "undefined" && window.console) { - console = window.console -} else { - console = {} -} - -var functions = [ - [log, "log"], - [info, "info"], - [warn, "warn"], - [error, "error"], - [time, "time"], - [timeEnd, "timeEnd"], - [trace, "trace"], - [dir, "dir"], - [consoleAssert, "assert"] -] - -for (var i = 0; i < functions.length; i++) { - var tuple = functions[i] - var f = tuple[0] - var name = tuple[1] - - if (!console[name]) { - console[name] = f - } -} - -module.exports = console - -function log() {} - -function info() { - console.log.apply(console, arguments) -} - -function warn() { - console.log.apply(console, arguments) -} - -function error() { - console.warn.apply(console, arguments) -} - -function time(label) { - times[label] = now() -} - -function timeEnd(label) { - var time = times[label] - if (!time) { - throw new Error("No such label: " + label) - } - - delete times[label] - var duration = now() - time - console.log(label + ": " + duration + "ms") -} - -function trace() { - var err = new Error() - err.name = "Trace" - err.message = util.format.apply(null, arguments) - console.error(err.stack) -} - -function dir(object) { - console.log(util.inspect(object) + "\n") -} - -function consoleAssert(expression) { - if (!expression) { - var arr = slice.call(arguments, 1) - assert.ok(false, util.format.apply(null, arr)) - } -} - - -/***/ }), - -/***/ "./node_modules/cpus/browser.js": -/*!**************************************!*\ - !*** ./node_modules/cpus/browser.js ***! - \**************************************/ -/***/ ((module) => { - -module.exports = function cpus () { - var num = navigator.hardwareConcurrency || 1 - var cpus = [] - for (var i = 0; i < num; i++) { - cpus.push({ - model: '', - speed: 0, - times: { user: 0, nice: 0, sys: 0, idle: 0, irq: 0 } - }) - } - return cpus -} - - -/***/ }), - -/***/ "./node_modules/create-ecdh/browser.js": -/*!*********************************************!*\ - !*** ./node_modules/create-ecdh/browser.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var elliptic = __webpack_require__(/*! elliptic */ "./node_modules/elliptic/lib/elliptic.js") -var BN = __webpack_require__(/*! bn.js */ "./node_modules/create-ecdh/node_modules/bn.js/lib/bn.js") - -module.exports = function createECDH (curve) { - return new ECDH(curve) -} - -var aliases = { - secp256k1: { - name: 'secp256k1', - byteLength: 32 - }, - secp224r1: { - name: 'p224', - byteLength: 28 - }, - prime256v1: { - name: 'p256', - byteLength: 32 - }, - prime192v1: { - name: 'p192', - byteLength: 24 - }, - ed25519: { - name: 'ed25519', - byteLength: 32 - }, - secp384r1: { - name: 'p384', - byteLength: 48 - }, - secp521r1: { - name: 'p521', - byteLength: 66 - } -} - -aliases.p224 = aliases.secp224r1 -aliases.p256 = aliases.secp256r1 = aliases.prime256v1 -aliases.p192 = aliases.secp192r1 = aliases.prime192v1 -aliases.p384 = aliases.secp384r1 -aliases.p521 = aliases.secp521r1 - -function ECDH (curve) { - this.curveType = aliases[curve] - if (!this.curveType) { - this.curveType = { - name: curve - } - } - this.curve = new elliptic.ec(this.curveType.name) // eslint-disable-line new-cap - this.keys = void 0 -} - -ECDH.prototype.generateKeys = function (enc, format) { - this.keys = this.curve.genKeyPair() - return this.getPublicKey(enc, format) -} - -ECDH.prototype.computeSecret = function (other, inenc, enc) { - inenc = inenc || 'utf8' - if (!Buffer.isBuffer(other)) { - other = new Buffer(other, inenc) - } - var otherPub = this.curve.keyFromPublic(other).getPublic() - var out = otherPub.mul(this.keys.getPrivate()).getX() - return formatReturnValue(out, enc, this.curveType.byteLength) -} - -ECDH.prototype.getPublicKey = function (enc, format) { - var key = this.keys.getPublic(format === 'compressed', true) - if (format === 'hybrid') { - if (key[key.length - 1] % 2) { - key[0] = 7 - } else { - key[0] = 6 - } - } - return formatReturnValue(key, enc) -} - -ECDH.prototype.getPrivateKey = function (enc) { - return formatReturnValue(this.keys.getPrivate(), enc) -} - -ECDH.prototype.setPublicKey = function (pub, enc) { - enc = enc || 'utf8' - if (!Buffer.isBuffer(pub)) { - pub = new Buffer(pub, enc) - } - this.keys._importPublic(pub) - return this -} - -ECDH.prototype.setPrivateKey = function (priv, enc) { - enc = enc || 'utf8' - if (!Buffer.isBuffer(priv)) { - priv = new Buffer(priv, enc) - } - - var _priv = new BN(priv) - _priv = _priv.toString(16) - this.keys = this.curve.genKeyPair() - this.keys._importPrivate(_priv) - return this -} - -function formatReturnValue (bn, enc, len) { - if (!Array.isArray(bn)) { - bn = bn.toArray() - } - var buf = new Buffer(bn) - if (len && buf.length < len) { - var zeros = new Buffer(len - buf.length) - zeros.fill(0) - buf = Buffer.concat([zeros, buf]) - } - if (!enc) { - return buf - } else { - return buf.toString(enc) - } -} - - -/***/ }), - -/***/ "./node_modules/create-ecdh/node_modules/bn.js/lib/bn.js": -/*!***************************************************************!*\ - !*** ./node_modules/create-ecdh/node_modules/bn.js/lib/bn.js ***! - \***************************************************************/ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -(function (module, exports) { - 'use strict'; - - // Utils - function assert (val, msg) { - if (!val) throw new Error(msg || 'Assertion failed'); - } - - // Could use `inherits` module, but don't want to move from single file - // architecture yet. - function inherits (ctor, superCtor) { - ctor.super_ = superCtor; - var TempCtor = function () {}; - TempCtor.prototype = superCtor.prototype; - ctor.prototype = new TempCtor(); - ctor.prototype.constructor = ctor; - } - - // BN - - function BN (number, base, endian) { - if (BN.isBN(number)) { - return number; - } - - this.negative = 0; - this.words = null; - this.length = 0; - - // Reduction context - this.red = null; - - if (number !== null) { - if (base === 'le' || base === 'be') { - endian = base; - base = 10; - } - - this._init(number || 0, base || 10, endian || 'be'); - } - } - if (typeof module === 'object') { - module.exports = BN; - } else { - exports.BN = BN; - } - - BN.BN = BN; - BN.wordSize = 26; - - var Buffer; - try { - if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { - Buffer = window.Buffer; - } else { - Buffer = __webpack_require__(/*! buffer */ "?4068").Buffer; - } - } catch (e) { - } - - BN.isBN = function isBN (num) { - if (num instanceof BN) { - return true; - } - - return num !== null && typeof num === 'object' && - num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); - }; - - BN.max = function max (left, right) { - if (left.cmp(right) > 0) return left; - return right; - }; - - BN.min = function min (left, right) { - if (left.cmp(right) < 0) return left; - return right; - }; - - BN.prototype._init = function init (number, base, endian) { - if (typeof number === 'number') { - return this._initNumber(number, base, endian); - } - - if (typeof number === 'object') { - return this._initArray(number, base, endian); - } - - if (base === 'hex') { - base = 16; - } - assert(base === (base | 0) && base >= 2 && base <= 36); - - number = number.toString().replace(/\s+/g, ''); - var start = 0; - if (number[0] === '-') { - start++; - this.negative = 1; - } - - if (start < number.length) { - if (base === 16) { - this._parseHex(number, start, endian); - } else { - this._parseBase(number, base, start); - if (endian === 'le') { - this._initArray(this.toArray(), base, endian); - } - } - } - }; - - BN.prototype._initNumber = function _initNumber (number, base, endian) { - if (number < 0) { - this.negative = 1; - number = -number; - } - if (number < 0x4000000) { - this.words = [ number & 0x3ffffff ]; - this.length = 1; - } else if (number < 0x10000000000000) { - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff - ]; - this.length = 2; - } else { - assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff, - 1 - ]; - this.length = 3; - } - - if (endian !== 'le') return; - - // Reverse the bytes - this._initArray(this.toArray(), base, endian); - }; - - BN.prototype._initArray = function _initArray (number, base, endian) { - // Perhaps a Uint8Array - assert(typeof number.length === 'number'); - if (number.length <= 0) { - this.words = [ 0 ]; - this.length = 1; - return this; - } - - this.length = Math.ceil(number.length / 3); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - var j, w; - var off = 0; - if (endian === 'be') { - for (i = number.length - 1, j = 0; i >= 0; i -= 3) { - w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } else if (endian === 'le') { - for (i = 0, j = 0; i < number.length; i += 3) { - w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } - return this.strip(); - }; - - function parseHex4Bits (string, index) { - var c = string.charCodeAt(index); - // 'A' - 'F' - if (c >= 65 && c <= 70) { - return c - 55; - // 'a' - 'f' - } else if (c >= 97 && c <= 102) { - return c - 87; - // '0' - '9' - } else { - return (c - 48) & 0xf; - } - } - - function parseHexByte (string, lowerBound, index) { - var r = parseHex4Bits(string, index); - if (index - 1 >= lowerBound) { - r |= parseHex4Bits(string, index - 1) << 4; - } - return r; - } - - BN.prototype._parseHex = function _parseHex (number, start, endian) { - // Create possibly bigger array to ensure that it fits the number - this.length = Math.ceil((number.length - start) / 6); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - // 24-bits chunks - var off = 0; - var j = 0; - - var w; - if (endian === 'be') { - for (i = number.length - 1; i >= start; i -= 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } else { - var parseLength = number.length - start; - for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } - - this.strip(); - }; - - function parseBase (str, start, end, mul) { - var r = 0; - var len = Math.min(str.length, end); - for (var i = start; i < len; i++) { - var c = str.charCodeAt(i) - 48; - - r *= mul; - - // 'a' - if (c >= 49) { - r += c - 49 + 0xa; - - // 'A' - } else if (c >= 17) { - r += c - 17 + 0xa; - - // '0' - '9' - } else { - r += c; - } - } - return r; - } - - BN.prototype._parseBase = function _parseBase (number, base, start) { - // Initialize as zero - this.words = [ 0 ]; - this.length = 1; - - // Find length of limb in base - for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { - limbLen++; - } - limbLen--; - limbPow = (limbPow / base) | 0; - - var total = number.length - start; - var mod = total % limbLen; - var end = Math.min(total, total - mod) + start; - - var word = 0; - for (var i = start; i < end; i += limbLen) { - word = parseBase(number, i, i + limbLen, base); - - this.imuln(limbPow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - if (mod !== 0) { - var pow = 1; - word = parseBase(number, i, number.length, base); - - for (i = 0; i < mod; i++) { - pow *= base; - } - - this.imuln(pow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - this.strip(); - }; - - BN.prototype.copy = function copy (dest) { - dest.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - dest.words[i] = this.words[i]; - } - dest.length = this.length; - dest.negative = this.negative; - dest.red = this.red; - }; - - BN.prototype.clone = function clone () { - var r = new BN(null); - this.copy(r); - return r; - }; - - BN.prototype._expand = function _expand (size) { - while (this.length < size) { - this.words[this.length++] = 0; - } - return this; - }; - - // Remove leading `0` from `this` - BN.prototype.strip = function strip () { - while (this.length > 1 && this.words[this.length - 1] === 0) { - this.length--; - } - return this._normSign(); - }; - - BN.prototype._normSign = function _normSign () { - // -0 = 0 - if (this.length === 1 && this.words[0] === 0) { - this.negative = 0; - } - return this; - }; - - BN.prototype.inspect = function inspect () { - return (this.red ? ''; - }; - - /* - - var zeros = []; - var groupSizes = []; - var groupBases = []; - - var s = ''; - var i = -1; - while (++i < BN.wordSize) { - zeros[i] = s; - s += '0'; - } - groupSizes[0] = 0; - groupSizes[1] = 0; - groupBases[0] = 0; - groupBases[1] = 0; - var base = 2 - 1; - while (++base < 36 + 1) { - var groupSize = 0; - var groupBase = 1; - while (groupBase < (1 << BN.wordSize) / base) { - groupBase *= base; - groupSize += 1; - } - groupSizes[base] = groupSize; - groupBases[base] = groupBase; - } - - */ - - 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' - ]; - - 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 - ]; - - 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 - ]; - - BN.prototype.toString = function toString (base, padding) { - base = base || 10; - padding = padding | 0 || 1; - - var out; - if (base === 16 || base === 'hex') { - out = ''; - var off = 0; - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = this.words[i]; - var word = (((w << off) | carry) & 0xffffff).toString(16); - carry = (w >>> (24 - off)) & 0xffffff; - if (carry !== 0 || i !== this.length - 1) { - out = zeros[6 - word.length] + word + out; - } else { - out = word + out; - } - off += 2; - if (off >= 26) { - off -= 26; - i--; - } - } - if (carry !== 0) { - out = carry.toString(16) + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - if (base === (base | 0) && base >= 2 && base <= 36) { - // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); - var groupSize = groupSizes[base]; - // var groupBase = Math.pow(base, groupSize); - var groupBase = groupBases[base]; - out = ''; - var c = this.clone(); - c.negative = 0; - while (!c.isZero()) { - var r = c.modn(groupBase).toString(base); - c = c.idivn(groupBase); - - if (!c.isZero()) { - out = zeros[groupSize - r.length] + r + out; - } else { - out = r + out; - } - } - if (this.isZero()) { - out = '0' + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - assert(false, 'Base should be between 2 and 36'); - }; - - BN.prototype.toNumber = function toNumber () { - var ret = this.words[0]; - if (this.length === 2) { - ret += this.words[1] * 0x4000000; - } else if (this.length === 3 && this.words[2] === 0x01) { - // NOTE: at this stage it is known that the top bit is set - ret += 0x10000000000000 + (this.words[1] * 0x4000000); - } else if (this.length > 2) { - assert(false, 'Number can only safely store up to 53 bits'); - } - return (this.negative !== 0) ? -ret : ret; - }; - - BN.prototype.toJSON = function toJSON () { - return this.toString(16); - }; - - BN.prototype.toBuffer = function toBuffer (endian, length) { - assert(typeof Buffer !== 'undefined'); - return this.toArrayLike(Buffer, endian, length); - }; - - BN.prototype.toArray = function toArray (endian, length) { - return this.toArrayLike(Array, endian, length); - }; - - BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { - var byteLength = this.byteLength(); - var reqLength = length || Math.max(1, byteLength); - assert(byteLength <= reqLength, 'byte array longer than desired length'); - assert(reqLength > 0, 'Requested array length <= 0'); - - this.strip(); - var littleEndian = endian === 'le'; - var res = new ArrayType(reqLength); - - var b, i; - var q = this.clone(); - if (!littleEndian) { - // Assume big-endian - for (i = 0; i < reqLength - byteLength; i++) { - res[i] = 0; - } - - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[reqLength - i - 1] = b; - } - } else { - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[i] = b; - } - - for (; i < reqLength; i++) { - res[i] = 0; - } - } - - return res; - }; - - if (Math.clz32) { - BN.prototype._countBits = function _countBits (w) { - return 32 - Math.clz32(w); - }; - } else { - BN.prototype._countBits = function _countBits (w) { - var t = w; - var r = 0; - if (t >= 0x1000) { - r += 13; - t >>>= 13; - } - if (t >= 0x40) { - r += 7; - t >>>= 7; - } - if (t >= 0x8) { - r += 4; - t >>>= 4; - } - if (t >= 0x02) { - r += 2; - t >>>= 2; - } - return r + t; - }; - } - - BN.prototype._zeroBits = function _zeroBits (w) { - // Short-cut - if (w === 0) return 26; - - var t = w; - var r = 0; - if ((t & 0x1fff) === 0) { - r += 13; - t >>>= 13; - } - if ((t & 0x7f) === 0) { - r += 7; - t >>>= 7; - } - if ((t & 0xf) === 0) { - r += 4; - t >>>= 4; - } - if ((t & 0x3) === 0) { - r += 2; - t >>>= 2; - } - if ((t & 0x1) === 0) { - r++; - } - return r; - }; - - // Return number of used bits in a BN - BN.prototype.bitLength = function bitLength () { - var w = this.words[this.length - 1]; - var hi = this._countBits(w); - return (this.length - 1) * 26 + hi; - }; - - function toBitArray (num) { - var w = new Array(num.bitLength()); - - for (var bit = 0; bit < w.length; bit++) { - var off = (bit / 26) | 0; - var wbit = bit % 26; - - w[bit] = (num.words[off] & (1 << wbit)) >>> wbit; - } - - return w; - } - - // Number of trailing zero bits - BN.prototype.zeroBits = function zeroBits () { - if (this.isZero()) return 0; - - var r = 0; - for (var i = 0; i < this.length; i++) { - var b = this._zeroBits(this.words[i]); - r += b; - if (b !== 26) break; - } - return r; - }; - - BN.prototype.byteLength = function byteLength () { - return Math.ceil(this.bitLength() / 8); - }; - - BN.prototype.toTwos = function toTwos (width) { - if (this.negative !== 0) { - return this.abs().inotn(width).iaddn(1); - } - return this.clone(); - }; - - BN.prototype.fromTwos = function fromTwos (width) { - if (this.testn(width - 1)) { - return this.notn(width).iaddn(1).ineg(); - } - return this.clone(); - }; - - BN.prototype.isNeg = function isNeg () { - return this.negative !== 0; - }; - - // Return negative clone of `this` - BN.prototype.neg = function neg () { - return this.clone().ineg(); - }; - - BN.prototype.ineg = function ineg () { - if (!this.isZero()) { - this.negative ^= 1; - } - - return this; - }; - - // Or `num` with `this` in-place - BN.prototype.iuor = function iuor (num) { - while (this.length < num.length) { - this.words[this.length++] = 0; - } - - for (var i = 0; i < num.length; i++) { - this.words[i] = this.words[i] | num.words[i]; - } - - return this.strip(); - }; - - BN.prototype.ior = function ior (num) { - assert((this.negative | num.negative) === 0); - return this.iuor(num); - }; - - // Or `num` with `this` - BN.prototype.or = function or (num) { - if (this.length > num.length) return this.clone().ior(num); - return num.clone().ior(this); - }; - - BN.prototype.uor = function uor (num) { - if (this.length > num.length) return this.clone().iuor(num); - return num.clone().iuor(this); - }; - - // And `num` with `this` in-place - BN.prototype.iuand = function iuand (num) { - // b = min-length(num, this) - var b; - if (this.length > num.length) { - b = num; - } else { - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = this.words[i] & num.words[i]; - } - - this.length = b.length; - - return this.strip(); - }; - - BN.prototype.iand = function iand (num) { - assert((this.negative | num.negative) === 0); - return this.iuand(num); - }; - - // And `num` with `this` - BN.prototype.and = function and (num) { - if (this.length > num.length) return this.clone().iand(num); - return num.clone().iand(this); - }; - - BN.prototype.uand = function uand (num) { - if (this.length > num.length) return this.clone().iuand(num); - return num.clone().iuand(this); - }; - - // Xor `num` with `this` in-place - BN.prototype.iuxor = function iuxor (num) { - // a.length > b.length - var a; - var b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = a.words[i] ^ b.words[i]; - } - - if (this !== a) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = a.length; - - return this.strip(); - }; - - BN.prototype.ixor = function ixor (num) { - assert((this.negative | num.negative) === 0); - return this.iuxor(num); - }; - - // Xor `num` with `this` - BN.prototype.xor = function xor (num) { - if (this.length > num.length) return this.clone().ixor(num); - return num.clone().ixor(this); - }; - - BN.prototype.uxor = function uxor (num) { - if (this.length > num.length) return this.clone().iuxor(num); - return num.clone().iuxor(this); - }; - - // Not ``this`` with ``width`` bitwidth - BN.prototype.inotn = function inotn (width) { - assert(typeof width === 'number' && width >= 0); - - var bytesNeeded = Math.ceil(width / 26) | 0; - var bitsLeft = width % 26; - - // Extend the buffer with leading zeroes - this._expand(bytesNeeded); - - if (bitsLeft > 0) { - bytesNeeded--; - } - - // Handle complete words - for (var i = 0; i < bytesNeeded; i++) { - this.words[i] = ~this.words[i] & 0x3ffffff; - } - - // Handle the residue - if (bitsLeft > 0) { - this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); - } - - // And remove leading zeroes - return this.strip(); - }; - - BN.prototype.notn = function notn (width) { - return this.clone().inotn(width); - }; - - // Set `bit` of `this` - BN.prototype.setn = function setn (bit, val) { - assert(typeof bit === 'number' && bit >= 0); - - var off = (bit / 26) | 0; - var wbit = bit % 26; - - this._expand(off + 1); - - if (val) { - this.words[off] = this.words[off] | (1 << wbit); - } else { - this.words[off] = this.words[off] & ~(1 << wbit); - } - - return this.strip(); - }; - - // Add `num` to `this` in-place - BN.prototype.iadd = function iadd (num) { - var r; - - // negative + positive - if (this.negative !== 0 && num.negative === 0) { - this.negative = 0; - r = this.isub(num); - this.negative ^= 1; - return this._normSign(); - - // positive + negative - } else if (this.negative === 0 && num.negative !== 0) { - num.negative = 0; - r = this.isub(num); - num.negative = 1; - return r._normSign(); - } - - // a.length > b.length - var a, b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) + (b.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - - this.length = a.length; - if (carry !== 0) { - this.words[this.length] = carry; - this.length++; - // Copy the rest of the words - } else if (a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - return this; - }; - - // Add `num` to `this` - BN.prototype.add = function add (num) { - var res; - if (num.negative !== 0 && this.negative === 0) { - num.negative = 0; - res = this.sub(num); - num.negative ^= 1; - return res; - } else if (num.negative === 0 && this.negative !== 0) { - this.negative = 0; - res = num.sub(this); - this.negative = 1; - return res; - } - - if (this.length > num.length) return this.clone().iadd(num); - - return num.clone().iadd(this); - }; - - // Subtract `num` from `this` in-place - BN.prototype.isub = function isub (num) { - // this - (-num) = this + num - if (num.negative !== 0) { - num.negative = 0; - var r = this.iadd(num); - num.negative = 1; - return r._normSign(); - - // -this - num = -(this + num) - } else if (this.negative !== 0) { - this.negative = 0; - this.iadd(num); - this.negative = 1; - return this._normSign(); - } - - // At this point both numbers are positive - var cmp = this.cmp(num); - - // Optimization - zeroify - if (cmp === 0) { - this.negative = 0; - this.length = 1; - this.words[0] = 0; - return this; - } - - // a > b - var a, b; - if (cmp > 0) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) - (b.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - - // Copy rest of the words - if (carry === 0 && i < a.length && a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = Math.max(this.length, i); - - if (a !== this) { - this.negative = 1; - } - - return this.strip(); - }; - - // Subtract `num` from `this` - BN.prototype.sub = function sub (num) { - return this.clone().isub(num); - }; - - function smallMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - var len = (self.length + num.length) | 0; - out.length = len; - len = (len - 1) | 0; - - // Peel one iteration (compiler can't do it, because of code complexity) - var a = self.words[0] | 0; - var b = num.words[0] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - var carry = (r / 0x4000000) | 0; - out.words[0] = lo; - - for (var k = 1; k < len; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = carry >>> 26; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = (k - j) | 0; - a = self.words[i] | 0; - b = num.words[j] | 0; - r = a * b + rword; - ncarry += (r / 0x4000000) | 0; - rword = r & 0x3ffffff; - } - out.words[k] = rword | 0; - carry = ncarry | 0; - } - if (carry !== 0) { - out.words[k] = carry | 0; - } else { - out.length--; - } - - return out.strip(); - } - - // TODO(indutny): it may be reasonable to omit it for users who don't need - // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit - // multiplication (like elliptic secp256k1). - var comb10MulTo = function comb10MulTo (self, num, out) { - var a = self.words; - var b = num.words; - var o = out.words; - var c = 0; - var lo; - var mid; - var hi; - var a0 = a[0] | 0; - var al0 = a0 & 0x1fff; - var ah0 = a0 >>> 13; - var a1 = a[1] | 0; - var al1 = a1 & 0x1fff; - var ah1 = a1 >>> 13; - var a2 = a[2] | 0; - var al2 = a2 & 0x1fff; - var ah2 = a2 >>> 13; - var a3 = a[3] | 0; - var al3 = a3 & 0x1fff; - var ah3 = a3 >>> 13; - var a4 = a[4] | 0; - var al4 = a4 & 0x1fff; - var ah4 = a4 >>> 13; - var a5 = a[5] | 0; - var al5 = a5 & 0x1fff; - var ah5 = a5 >>> 13; - var a6 = a[6] | 0; - var al6 = a6 & 0x1fff; - var ah6 = a6 >>> 13; - var a7 = a[7] | 0; - var al7 = a7 & 0x1fff; - var ah7 = a7 >>> 13; - var a8 = a[8] | 0; - var al8 = a8 & 0x1fff; - var ah8 = a8 >>> 13; - var a9 = a[9] | 0; - var al9 = a9 & 0x1fff; - var ah9 = a9 >>> 13; - var b0 = b[0] | 0; - var bl0 = b0 & 0x1fff; - var bh0 = b0 >>> 13; - var b1 = b[1] | 0; - var bl1 = b1 & 0x1fff; - var bh1 = b1 >>> 13; - var b2 = b[2] | 0; - var bl2 = b2 & 0x1fff; - var bh2 = b2 >>> 13; - var b3 = b[3] | 0; - var bl3 = b3 & 0x1fff; - var bh3 = b3 >>> 13; - var b4 = b[4] | 0; - var bl4 = b4 & 0x1fff; - var bh4 = b4 >>> 13; - var b5 = b[5] | 0; - var bl5 = b5 & 0x1fff; - var bh5 = b5 >>> 13; - var b6 = b[6] | 0; - var bl6 = b6 & 0x1fff; - var bh6 = b6 >>> 13; - var b7 = b[7] | 0; - var bl7 = b7 & 0x1fff; - var bh7 = b7 >>> 13; - var b8 = b[8] | 0; - var bl8 = b8 & 0x1fff; - var bh8 = b8 >>> 13; - var b9 = b[9] | 0; - var bl9 = b9 & 0x1fff; - var bh9 = b9 >>> 13; - - out.negative = self.negative ^ num.negative; - out.length = 19; - /* k = 0 */ - lo = Math.imul(al0, bl0); - mid = Math.imul(al0, bh0); - mid = (mid + Math.imul(ah0, bl0)) | 0; - hi = Math.imul(ah0, bh0); - var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; - w0 &= 0x3ffffff; - /* k = 1 */ - lo = Math.imul(al1, bl0); - mid = Math.imul(al1, bh0); - mid = (mid + Math.imul(ah1, bl0)) | 0; - hi = Math.imul(ah1, bh0); - lo = (lo + Math.imul(al0, bl1)) | 0; - mid = (mid + Math.imul(al0, bh1)) | 0; - mid = (mid + Math.imul(ah0, bl1)) | 0; - hi = (hi + Math.imul(ah0, bh1)) | 0; - var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; - w1 &= 0x3ffffff; - /* k = 2 */ - lo = Math.imul(al2, bl0); - mid = Math.imul(al2, bh0); - mid = (mid + Math.imul(ah2, bl0)) | 0; - hi = Math.imul(ah2, bh0); - lo = (lo + Math.imul(al1, bl1)) | 0; - mid = (mid + Math.imul(al1, bh1)) | 0; - mid = (mid + Math.imul(ah1, bl1)) | 0; - hi = (hi + Math.imul(ah1, bh1)) | 0; - lo = (lo + Math.imul(al0, bl2)) | 0; - mid = (mid + Math.imul(al0, bh2)) | 0; - mid = (mid + Math.imul(ah0, bl2)) | 0; - hi = (hi + Math.imul(ah0, bh2)) | 0; - var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; - w2 &= 0x3ffffff; - /* k = 3 */ - lo = Math.imul(al3, bl0); - mid = Math.imul(al3, bh0); - mid = (mid + Math.imul(ah3, bl0)) | 0; - hi = Math.imul(ah3, bh0); - lo = (lo + Math.imul(al2, bl1)) | 0; - mid = (mid + Math.imul(al2, bh1)) | 0; - mid = (mid + Math.imul(ah2, bl1)) | 0; - hi = (hi + Math.imul(ah2, bh1)) | 0; - lo = (lo + Math.imul(al1, bl2)) | 0; - mid = (mid + Math.imul(al1, bh2)) | 0; - mid = (mid + Math.imul(ah1, bl2)) | 0; - hi = (hi + Math.imul(ah1, bh2)) | 0; - lo = (lo + Math.imul(al0, bl3)) | 0; - mid = (mid + Math.imul(al0, bh3)) | 0; - mid = (mid + Math.imul(ah0, bl3)) | 0; - hi = (hi + Math.imul(ah0, bh3)) | 0; - var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; - w3 &= 0x3ffffff; - /* k = 4 */ - lo = Math.imul(al4, bl0); - mid = Math.imul(al4, bh0); - mid = (mid + Math.imul(ah4, bl0)) | 0; - hi = Math.imul(ah4, bh0); - lo = (lo + Math.imul(al3, bl1)) | 0; - mid = (mid + Math.imul(al3, bh1)) | 0; - mid = (mid + Math.imul(ah3, bl1)) | 0; - hi = (hi + Math.imul(ah3, bh1)) | 0; - lo = (lo + Math.imul(al2, bl2)) | 0; - mid = (mid + Math.imul(al2, bh2)) | 0; - mid = (mid + Math.imul(ah2, bl2)) | 0; - hi = (hi + Math.imul(ah2, bh2)) | 0; - lo = (lo + Math.imul(al1, bl3)) | 0; - mid = (mid + Math.imul(al1, bh3)) | 0; - mid = (mid + Math.imul(ah1, bl3)) | 0; - hi = (hi + Math.imul(ah1, bh3)) | 0; - lo = (lo + Math.imul(al0, bl4)) | 0; - mid = (mid + Math.imul(al0, bh4)) | 0; - mid = (mid + Math.imul(ah0, bl4)) | 0; - hi = (hi + Math.imul(ah0, bh4)) | 0; - var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; - w4 &= 0x3ffffff; - /* k = 5 */ - lo = Math.imul(al5, bl0); - mid = Math.imul(al5, bh0); - mid = (mid + Math.imul(ah5, bl0)) | 0; - hi = Math.imul(ah5, bh0); - lo = (lo + Math.imul(al4, bl1)) | 0; - mid = (mid + Math.imul(al4, bh1)) | 0; - mid = (mid + Math.imul(ah4, bl1)) | 0; - hi = (hi + Math.imul(ah4, bh1)) | 0; - lo = (lo + Math.imul(al3, bl2)) | 0; - mid = (mid + Math.imul(al3, bh2)) | 0; - mid = (mid + Math.imul(ah3, bl2)) | 0; - hi = (hi + Math.imul(ah3, bh2)) | 0; - lo = (lo + Math.imul(al2, bl3)) | 0; - mid = (mid + Math.imul(al2, bh3)) | 0; - mid = (mid + Math.imul(ah2, bl3)) | 0; - hi = (hi + Math.imul(ah2, bh3)) | 0; - lo = (lo + Math.imul(al1, bl4)) | 0; - mid = (mid + Math.imul(al1, bh4)) | 0; - mid = (mid + Math.imul(ah1, bl4)) | 0; - hi = (hi + Math.imul(ah1, bh4)) | 0; - lo = (lo + Math.imul(al0, bl5)) | 0; - mid = (mid + Math.imul(al0, bh5)) | 0; - mid = (mid + Math.imul(ah0, bl5)) | 0; - hi = (hi + Math.imul(ah0, bh5)) | 0; - var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; - w5 &= 0x3ffffff; - /* k = 6 */ - lo = Math.imul(al6, bl0); - mid = Math.imul(al6, bh0); - mid = (mid + Math.imul(ah6, bl0)) | 0; - hi = Math.imul(ah6, bh0); - lo = (lo + Math.imul(al5, bl1)) | 0; - mid = (mid + Math.imul(al5, bh1)) | 0; - mid = (mid + Math.imul(ah5, bl1)) | 0; - hi = (hi + Math.imul(ah5, bh1)) | 0; - lo = (lo + Math.imul(al4, bl2)) | 0; - mid = (mid + Math.imul(al4, bh2)) | 0; - mid = (mid + Math.imul(ah4, bl2)) | 0; - hi = (hi + Math.imul(ah4, bh2)) | 0; - lo = (lo + Math.imul(al3, bl3)) | 0; - mid = (mid + Math.imul(al3, bh3)) | 0; - mid = (mid + Math.imul(ah3, bl3)) | 0; - hi = (hi + Math.imul(ah3, bh3)) | 0; - lo = (lo + Math.imul(al2, bl4)) | 0; - mid = (mid + Math.imul(al2, bh4)) | 0; - mid = (mid + Math.imul(ah2, bl4)) | 0; - hi = (hi + Math.imul(ah2, bh4)) | 0; - lo = (lo + Math.imul(al1, bl5)) | 0; - mid = (mid + Math.imul(al1, bh5)) | 0; - mid = (mid + Math.imul(ah1, bl5)) | 0; - hi = (hi + Math.imul(ah1, bh5)) | 0; - lo = (lo + Math.imul(al0, bl6)) | 0; - mid = (mid + Math.imul(al0, bh6)) | 0; - mid = (mid + Math.imul(ah0, bl6)) | 0; - hi = (hi + Math.imul(ah0, bh6)) | 0; - var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; - w6 &= 0x3ffffff; - /* k = 7 */ - lo = Math.imul(al7, bl0); - mid = Math.imul(al7, bh0); - mid = (mid + Math.imul(ah7, bl0)) | 0; - hi = Math.imul(ah7, bh0); - lo = (lo + Math.imul(al6, bl1)) | 0; - mid = (mid + Math.imul(al6, bh1)) | 0; - mid = (mid + Math.imul(ah6, bl1)) | 0; - hi = (hi + Math.imul(ah6, bh1)) | 0; - lo = (lo + Math.imul(al5, bl2)) | 0; - mid = (mid + Math.imul(al5, bh2)) | 0; - mid = (mid + Math.imul(ah5, bl2)) | 0; - hi = (hi + Math.imul(ah5, bh2)) | 0; - lo = (lo + Math.imul(al4, bl3)) | 0; - mid = (mid + Math.imul(al4, bh3)) | 0; - mid = (mid + Math.imul(ah4, bl3)) | 0; - hi = (hi + Math.imul(ah4, bh3)) | 0; - lo = (lo + Math.imul(al3, bl4)) | 0; - mid = (mid + Math.imul(al3, bh4)) | 0; - mid = (mid + Math.imul(ah3, bl4)) | 0; - hi = (hi + Math.imul(ah3, bh4)) | 0; - lo = (lo + Math.imul(al2, bl5)) | 0; - mid = (mid + Math.imul(al2, bh5)) | 0; - mid = (mid + Math.imul(ah2, bl5)) | 0; - hi = (hi + Math.imul(ah2, bh5)) | 0; - lo = (lo + Math.imul(al1, bl6)) | 0; - mid = (mid + Math.imul(al1, bh6)) | 0; - mid = (mid + Math.imul(ah1, bl6)) | 0; - hi = (hi + Math.imul(ah1, bh6)) | 0; - lo = (lo + Math.imul(al0, bl7)) | 0; - mid = (mid + Math.imul(al0, bh7)) | 0; - mid = (mid + Math.imul(ah0, bl7)) | 0; - hi = (hi + Math.imul(ah0, bh7)) | 0; - var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; - w7 &= 0x3ffffff; - /* k = 8 */ - lo = Math.imul(al8, bl0); - mid = Math.imul(al8, bh0); - mid = (mid + Math.imul(ah8, bl0)) | 0; - hi = Math.imul(ah8, bh0); - lo = (lo + Math.imul(al7, bl1)) | 0; - mid = (mid + Math.imul(al7, bh1)) | 0; - mid = (mid + Math.imul(ah7, bl1)) | 0; - hi = (hi + Math.imul(ah7, bh1)) | 0; - lo = (lo + Math.imul(al6, bl2)) | 0; - mid = (mid + Math.imul(al6, bh2)) | 0; - mid = (mid + Math.imul(ah6, bl2)) | 0; - hi = (hi + Math.imul(ah6, bh2)) | 0; - lo = (lo + Math.imul(al5, bl3)) | 0; - mid = (mid + Math.imul(al5, bh3)) | 0; - mid = (mid + Math.imul(ah5, bl3)) | 0; - hi = (hi + Math.imul(ah5, bh3)) | 0; - lo = (lo + Math.imul(al4, bl4)) | 0; - mid = (mid + Math.imul(al4, bh4)) | 0; - mid = (mid + Math.imul(ah4, bl4)) | 0; - hi = (hi + Math.imul(ah4, bh4)) | 0; - lo = (lo + Math.imul(al3, bl5)) | 0; - mid = (mid + Math.imul(al3, bh5)) | 0; - mid = (mid + Math.imul(ah3, bl5)) | 0; - hi = (hi + Math.imul(ah3, bh5)) | 0; - lo = (lo + Math.imul(al2, bl6)) | 0; - mid = (mid + Math.imul(al2, bh6)) | 0; - mid = (mid + Math.imul(ah2, bl6)) | 0; - hi = (hi + Math.imul(ah2, bh6)) | 0; - lo = (lo + Math.imul(al1, bl7)) | 0; - mid = (mid + Math.imul(al1, bh7)) | 0; - mid = (mid + Math.imul(ah1, bl7)) | 0; - hi = (hi + Math.imul(ah1, bh7)) | 0; - lo = (lo + Math.imul(al0, bl8)) | 0; - mid = (mid + Math.imul(al0, bh8)) | 0; - mid = (mid + Math.imul(ah0, bl8)) | 0; - hi = (hi + Math.imul(ah0, bh8)) | 0; - var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; - w8 &= 0x3ffffff; - /* k = 9 */ - lo = Math.imul(al9, bl0); - mid = Math.imul(al9, bh0); - mid = (mid + Math.imul(ah9, bl0)) | 0; - hi = Math.imul(ah9, bh0); - lo = (lo + Math.imul(al8, bl1)) | 0; - mid = (mid + Math.imul(al8, bh1)) | 0; - mid = (mid + Math.imul(ah8, bl1)) | 0; - hi = (hi + Math.imul(ah8, bh1)) | 0; - lo = (lo + Math.imul(al7, bl2)) | 0; - mid = (mid + Math.imul(al7, bh2)) | 0; - mid = (mid + Math.imul(ah7, bl2)) | 0; - hi = (hi + Math.imul(ah7, bh2)) | 0; - lo = (lo + Math.imul(al6, bl3)) | 0; - mid = (mid + Math.imul(al6, bh3)) | 0; - mid = (mid + Math.imul(ah6, bl3)) | 0; - hi = (hi + Math.imul(ah6, bh3)) | 0; - lo = (lo + Math.imul(al5, bl4)) | 0; - mid = (mid + Math.imul(al5, bh4)) | 0; - mid = (mid + Math.imul(ah5, bl4)) | 0; - hi = (hi + Math.imul(ah5, bh4)) | 0; - lo = (lo + Math.imul(al4, bl5)) | 0; - mid = (mid + Math.imul(al4, bh5)) | 0; - mid = (mid + Math.imul(ah4, bl5)) | 0; - hi = (hi + Math.imul(ah4, bh5)) | 0; - lo = (lo + Math.imul(al3, bl6)) | 0; - mid = (mid + Math.imul(al3, bh6)) | 0; - mid = (mid + Math.imul(ah3, bl6)) | 0; - hi = (hi + Math.imul(ah3, bh6)) | 0; - lo = (lo + Math.imul(al2, bl7)) | 0; - mid = (mid + Math.imul(al2, bh7)) | 0; - mid = (mid + Math.imul(ah2, bl7)) | 0; - hi = (hi + Math.imul(ah2, bh7)) | 0; - lo = (lo + Math.imul(al1, bl8)) | 0; - mid = (mid + Math.imul(al1, bh8)) | 0; - mid = (mid + Math.imul(ah1, bl8)) | 0; - hi = (hi + Math.imul(ah1, bh8)) | 0; - lo = (lo + Math.imul(al0, bl9)) | 0; - mid = (mid + Math.imul(al0, bh9)) | 0; - mid = (mid + Math.imul(ah0, bl9)) | 0; - hi = (hi + Math.imul(ah0, bh9)) | 0; - var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; - w9 &= 0x3ffffff; - /* k = 10 */ - lo = Math.imul(al9, bl1); - mid = Math.imul(al9, bh1); - mid = (mid + Math.imul(ah9, bl1)) | 0; - hi = Math.imul(ah9, bh1); - lo = (lo + Math.imul(al8, bl2)) | 0; - mid = (mid + Math.imul(al8, bh2)) | 0; - mid = (mid + Math.imul(ah8, bl2)) | 0; - hi = (hi + Math.imul(ah8, bh2)) | 0; - lo = (lo + Math.imul(al7, bl3)) | 0; - mid = (mid + Math.imul(al7, bh3)) | 0; - mid = (mid + Math.imul(ah7, bl3)) | 0; - hi = (hi + Math.imul(ah7, bh3)) | 0; - lo = (lo + Math.imul(al6, bl4)) | 0; - mid = (mid + Math.imul(al6, bh4)) | 0; - mid = (mid + Math.imul(ah6, bl4)) | 0; - hi = (hi + Math.imul(ah6, bh4)) | 0; - lo = (lo + Math.imul(al5, bl5)) | 0; - mid = (mid + Math.imul(al5, bh5)) | 0; - mid = (mid + Math.imul(ah5, bl5)) | 0; - hi = (hi + Math.imul(ah5, bh5)) | 0; - lo = (lo + Math.imul(al4, bl6)) | 0; - mid = (mid + Math.imul(al4, bh6)) | 0; - mid = (mid + Math.imul(ah4, bl6)) | 0; - hi = (hi + Math.imul(ah4, bh6)) | 0; - lo = (lo + Math.imul(al3, bl7)) | 0; - mid = (mid + Math.imul(al3, bh7)) | 0; - mid = (mid + Math.imul(ah3, bl7)) | 0; - hi = (hi + Math.imul(ah3, bh7)) | 0; - lo = (lo + Math.imul(al2, bl8)) | 0; - mid = (mid + Math.imul(al2, bh8)) | 0; - mid = (mid + Math.imul(ah2, bl8)) | 0; - hi = (hi + Math.imul(ah2, bh8)) | 0; - lo = (lo + Math.imul(al1, bl9)) | 0; - mid = (mid + Math.imul(al1, bh9)) | 0; - mid = (mid + Math.imul(ah1, bl9)) | 0; - hi = (hi + Math.imul(ah1, bh9)) | 0; - var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; - w10 &= 0x3ffffff; - /* k = 11 */ - lo = Math.imul(al9, bl2); - mid = Math.imul(al9, bh2); - mid = (mid + Math.imul(ah9, bl2)) | 0; - hi = Math.imul(ah9, bh2); - lo = (lo + Math.imul(al8, bl3)) | 0; - mid = (mid + Math.imul(al8, bh3)) | 0; - mid = (mid + Math.imul(ah8, bl3)) | 0; - hi = (hi + Math.imul(ah8, bh3)) | 0; - lo = (lo + Math.imul(al7, bl4)) | 0; - mid = (mid + Math.imul(al7, bh4)) | 0; - mid = (mid + Math.imul(ah7, bl4)) | 0; - hi = (hi + Math.imul(ah7, bh4)) | 0; - lo = (lo + Math.imul(al6, bl5)) | 0; - mid = (mid + Math.imul(al6, bh5)) | 0; - mid = (mid + Math.imul(ah6, bl5)) | 0; - hi = (hi + Math.imul(ah6, bh5)) | 0; - lo = (lo + Math.imul(al5, bl6)) | 0; - mid = (mid + Math.imul(al5, bh6)) | 0; - mid = (mid + Math.imul(ah5, bl6)) | 0; - hi = (hi + Math.imul(ah5, bh6)) | 0; - lo = (lo + Math.imul(al4, bl7)) | 0; - mid = (mid + Math.imul(al4, bh7)) | 0; - mid = (mid + Math.imul(ah4, bl7)) | 0; - hi = (hi + Math.imul(ah4, bh7)) | 0; - lo = (lo + Math.imul(al3, bl8)) | 0; - mid = (mid + Math.imul(al3, bh8)) | 0; - mid = (mid + Math.imul(ah3, bl8)) | 0; - hi = (hi + Math.imul(ah3, bh8)) | 0; - lo = (lo + Math.imul(al2, bl9)) | 0; - mid = (mid + Math.imul(al2, bh9)) | 0; - mid = (mid + Math.imul(ah2, bl9)) | 0; - hi = (hi + Math.imul(ah2, bh9)) | 0; - var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; - w11 &= 0x3ffffff; - /* k = 12 */ - lo = Math.imul(al9, bl3); - mid = Math.imul(al9, bh3); - mid = (mid + Math.imul(ah9, bl3)) | 0; - hi = Math.imul(ah9, bh3); - lo = (lo + Math.imul(al8, bl4)) | 0; - mid = (mid + Math.imul(al8, bh4)) | 0; - mid = (mid + Math.imul(ah8, bl4)) | 0; - hi = (hi + Math.imul(ah8, bh4)) | 0; - lo = (lo + Math.imul(al7, bl5)) | 0; - mid = (mid + Math.imul(al7, bh5)) | 0; - mid = (mid + Math.imul(ah7, bl5)) | 0; - hi = (hi + Math.imul(ah7, bh5)) | 0; - lo = (lo + Math.imul(al6, bl6)) | 0; - mid = (mid + Math.imul(al6, bh6)) | 0; - mid = (mid + Math.imul(ah6, bl6)) | 0; - hi = (hi + Math.imul(ah6, bh6)) | 0; - lo = (lo + Math.imul(al5, bl7)) | 0; - mid = (mid + Math.imul(al5, bh7)) | 0; - mid = (mid + Math.imul(ah5, bl7)) | 0; - hi = (hi + Math.imul(ah5, bh7)) | 0; - lo = (lo + Math.imul(al4, bl8)) | 0; - mid = (mid + Math.imul(al4, bh8)) | 0; - mid = (mid + Math.imul(ah4, bl8)) | 0; - hi = (hi + Math.imul(ah4, bh8)) | 0; - lo = (lo + Math.imul(al3, bl9)) | 0; - mid = (mid + Math.imul(al3, bh9)) | 0; - mid = (mid + Math.imul(ah3, bl9)) | 0; - hi = (hi + Math.imul(ah3, bh9)) | 0; - var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; - w12 &= 0x3ffffff; - /* k = 13 */ - lo = Math.imul(al9, bl4); - mid = Math.imul(al9, bh4); - mid = (mid + Math.imul(ah9, bl4)) | 0; - hi = Math.imul(ah9, bh4); - lo = (lo + Math.imul(al8, bl5)) | 0; - mid = (mid + Math.imul(al8, bh5)) | 0; - mid = (mid + Math.imul(ah8, bl5)) | 0; - hi = (hi + Math.imul(ah8, bh5)) | 0; - lo = (lo + Math.imul(al7, bl6)) | 0; - mid = (mid + Math.imul(al7, bh6)) | 0; - mid = (mid + Math.imul(ah7, bl6)) | 0; - hi = (hi + Math.imul(ah7, bh6)) | 0; - lo = (lo + Math.imul(al6, bl7)) | 0; - mid = (mid + Math.imul(al6, bh7)) | 0; - mid = (mid + Math.imul(ah6, bl7)) | 0; - hi = (hi + Math.imul(ah6, bh7)) | 0; - lo = (lo + Math.imul(al5, bl8)) | 0; - mid = (mid + Math.imul(al5, bh8)) | 0; - mid = (mid + Math.imul(ah5, bl8)) | 0; - hi = (hi + Math.imul(ah5, bh8)) | 0; - lo = (lo + Math.imul(al4, bl9)) | 0; - mid = (mid + Math.imul(al4, bh9)) | 0; - mid = (mid + Math.imul(ah4, bl9)) | 0; - hi = (hi + Math.imul(ah4, bh9)) | 0; - var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; - w13 &= 0x3ffffff; - /* k = 14 */ - lo = Math.imul(al9, bl5); - mid = Math.imul(al9, bh5); - mid = (mid + Math.imul(ah9, bl5)) | 0; - hi = Math.imul(ah9, bh5); - lo = (lo + Math.imul(al8, bl6)) | 0; - mid = (mid + Math.imul(al8, bh6)) | 0; - mid = (mid + Math.imul(ah8, bl6)) | 0; - hi = (hi + Math.imul(ah8, bh6)) | 0; - lo = (lo + Math.imul(al7, bl7)) | 0; - mid = (mid + Math.imul(al7, bh7)) | 0; - mid = (mid + Math.imul(ah7, bl7)) | 0; - hi = (hi + Math.imul(ah7, bh7)) | 0; - lo = (lo + Math.imul(al6, bl8)) | 0; - mid = (mid + Math.imul(al6, bh8)) | 0; - mid = (mid + Math.imul(ah6, bl8)) | 0; - hi = (hi + Math.imul(ah6, bh8)) | 0; - lo = (lo + Math.imul(al5, bl9)) | 0; - mid = (mid + Math.imul(al5, bh9)) | 0; - mid = (mid + Math.imul(ah5, bl9)) | 0; - hi = (hi + Math.imul(ah5, bh9)) | 0; - var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; - w14 &= 0x3ffffff; - /* k = 15 */ - lo = Math.imul(al9, bl6); - mid = Math.imul(al9, bh6); - mid = (mid + Math.imul(ah9, bl6)) | 0; - hi = Math.imul(ah9, bh6); - lo = (lo + Math.imul(al8, bl7)) | 0; - mid = (mid + Math.imul(al8, bh7)) | 0; - mid = (mid + Math.imul(ah8, bl7)) | 0; - hi = (hi + Math.imul(ah8, bh7)) | 0; - lo = (lo + Math.imul(al7, bl8)) | 0; - mid = (mid + Math.imul(al7, bh8)) | 0; - mid = (mid + Math.imul(ah7, bl8)) | 0; - hi = (hi + Math.imul(ah7, bh8)) | 0; - lo = (lo + Math.imul(al6, bl9)) | 0; - mid = (mid + Math.imul(al6, bh9)) | 0; - mid = (mid + Math.imul(ah6, bl9)) | 0; - hi = (hi + Math.imul(ah6, bh9)) | 0; - var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; - w15 &= 0x3ffffff; - /* k = 16 */ - lo = Math.imul(al9, bl7); - mid = Math.imul(al9, bh7); - mid = (mid + Math.imul(ah9, bl7)) | 0; - hi = Math.imul(ah9, bh7); - lo = (lo + Math.imul(al8, bl8)) | 0; - mid = (mid + Math.imul(al8, bh8)) | 0; - mid = (mid + Math.imul(ah8, bl8)) | 0; - hi = (hi + Math.imul(ah8, bh8)) | 0; - lo = (lo + Math.imul(al7, bl9)) | 0; - mid = (mid + Math.imul(al7, bh9)) | 0; - mid = (mid + Math.imul(ah7, bl9)) | 0; - hi = (hi + Math.imul(ah7, bh9)) | 0; - var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; - w16 &= 0x3ffffff; - /* k = 17 */ - lo = Math.imul(al9, bl8); - mid = Math.imul(al9, bh8); - mid = (mid + Math.imul(ah9, bl8)) | 0; - hi = Math.imul(ah9, bh8); - lo = (lo + Math.imul(al8, bl9)) | 0; - mid = (mid + Math.imul(al8, bh9)) | 0; - mid = (mid + Math.imul(ah8, bl9)) | 0; - hi = (hi + Math.imul(ah8, bh9)) | 0; - var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; - w17 &= 0x3ffffff; - /* k = 18 */ - lo = Math.imul(al9, bl9); - mid = Math.imul(al9, bh9); - mid = (mid + Math.imul(ah9, bl9)) | 0; - hi = Math.imul(ah9, bh9); - var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; - w18 &= 0x3ffffff; - o[0] = w0; - o[1] = w1; - o[2] = w2; - o[3] = w3; - o[4] = w4; - o[5] = w5; - o[6] = w6; - o[7] = w7; - o[8] = w8; - o[9] = w9; - o[10] = w10; - o[11] = w11; - o[12] = w12; - o[13] = w13; - o[14] = w14; - o[15] = w15; - o[16] = w16; - o[17] = w17; - o[18] = w18; - if (c !== 0) { - o[19] = c; - out.length++; - } - return out; - }; - - // Polyfill comb - if (!Math.imul) { - comb10MulTo = smallMulTo; - } - - function bigMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - out.length = self.length + num.length; - - var carry = 0; - var hncarry = 0; - for (var k = 0; k < out.length - 1; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = hncarry; - hncarry = 0; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = k - j; - var a = self.words[i] | 0; - var b = num.words[j] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; - lo = (lo + rword) | 0; - rword = lo & 0x3ffffff; - ncarry = (ncarry + (lo >>> 26)) | 0; - - hncarry += ncarry >>> 26; - ncarry &= 0x3ffffff; - } - out.words[k] = rword; - carry = ncarry; - ncarry = hncarry; - } - if (carry !== 0) { - out.words[k] = carry; - } else { - out.length--; - } - - return out.strip(); - } - - function jumboMulTo (self, num, out) { - var fftm = new FFTM(); - return fftm.mulp(self, num, out); - } - - BN.prototype.mulTo = function mulTo (num, out) { - var res; - var len = this.length + num.length; - if (this.length === 10 && num.length === 10) { - res = comb10MulTo(this, num, out); - } else if (len < 63) { - res = smallMulTo(this, num, out); - } else if (len < 1024) { - res = bigMulTo(this, num, out); - } else { - res = jumboMulTo(this, num, out); - } - - return res; - }; - - // Cooley-Tukey algorithm for FFT - // slightly revisited to rely on looping instead of recursion - - function FFTM (x, y) { - this.x = x; - this.y = y; - } - - FFTM.prototype.makeRBT = function makeRBT (N) { - var t = new Array(N); - var l = BN.prototype._countBits(N) - 1; - for (var i = 0; i < N; i++) { - t[i] = this.revBin(i, l, N); - } - - return t; - }; - - // Returns binary-reversed representation of `x` - FFTM.prototype.revBin = function revBin (x, l, N) { - if (x === 0 || x === N - 1) return x; - - var rb = 0; - for (var i = 0; i < l; i++) { - rb |= (x & 1) << (l - i - 1); - x >>= 1; - } - - return rb; - }; - - // Performs "tweedling" phase, therefore 'emulating' - // behaviour of the recursive algorithm - FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { - for (var i = 0; i < N; i++) { - rtws[i] = rws[rbt[i]]; - itws[i] = iws[rbt[i]]; - } - }; - - FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { - this.permute(rbt, rws, iws, rtws, itws, N); - - for (var s = 1; s < N; s <<= 1) { - var l = s << 1; - - var rtwdf = Math.cos(2 * Math.PI / l); - var itwdf = Math.sin(2 * Math.PI / l); - - for (var p = 0; p < N; p += l) { - var rtwdf_ = rtwdf; - var itwdf_ = itwdf; - - for (var j = 0; j < s; j++) { - var re = rtws[p + j]; - var ie = itws[p + j]; - - var ro = rtws[p + j + s]; - var io = itws[p + j + s]; - - var rx = rtwdf_ * ro - itwdf_ * io; - - io = rtwdf_ * io + itwdf_ * ro; - ro = rx; - - rtws[p + j] = re + ro; - itws[p + j] = ie + io; - - rtws[p + j + s] = re - ro; - itws[p + j + s] = ie - io; - - /* jshint maxdepth : false */ - if (j !== l) { - rx = rtwdf * rtwdf_ - itwdf * itwdf_; - - itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; - rtwdf_ = rx; - } - } - } - } - }; - - FFTM.prototype.guessLen13b = function guessLen13b (n, m) { - var N = Math.max(m, n) | 1; - var odd = N & 1; - var i = 0; - for (N = N / 2 | 0; N; N = N >>> 1) { - i++; - } - - return 1 << i + 1 + odd; - }; - - FFTM.prototype.conjugate = function conjugate (rws, iws, N) { - if (N <= 1) return; - - for (var i = 0; i < N / 2; i++) { - var t = rws[i]; - - rws[i] = rws[N - i - 1]; - rws[N - i - 1] = t; - - t = iws[i]; - - iws[i] = -iws[N - i - 1]; - iws[N - i - 1] = -t; - } - }; - - FFTM.prototype.normalize13b = function normalize13b (ws, N) { - var carry = 0; - for (var i = 0; i < N / 2; i++) { - var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + - Math.round(ws[2 * i] / N) + - carry; - - ws[i] = w & 0x3ffffff; - - if (w < 0x4000000) { - carry = 0; - } else { - carry = w / 0x4000000 | 0; - } - } - - return ws; - }; - - FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { - var carry = 0; - for (var i = 0; i < len; i++) { - carry = carry + (ws[i] | 0); - - rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; - rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; - } - - // Pad with zeroes - for (i = 2 * len; i < N; ++i) { - rws[i] = 0; - } - - assert(carry === 0); - assert((carry & ~0x1fff) === 0); - }; - - FFTM.prototype.stub = function stub (N) { - var ph = new Array(N); - for (var i = 0; i < N; i++) { - ph[i] = 0; - } - - return ph; - }; - - FFTM.prototype.mulp = function mulp (x, y, out) { - var N = 2 * this.guessLen13b(x.length, y.length); - - var rbt = this.makeRBT(N); - - var _ = this.stub(N); - - var rws = new Array(N); - var rwst = new Array(N); - var iwst = new Array(N); - - var nrws = new Array(N); - var nrwst = new Array(N); - var niwst = new Array(N); - - var rmws = out.words; - rmws.length = N; - - this.convert13b(x.words, x.length, rws, N); - this.convert13b(y.words, y.length, nrws, N); - - this.transform(rws, _, rwst, iwst, N, rbt); - this.transform(nrws, _, nrwst, niwst, N, rbt); - - for (var i = 0; i < N; i++) { - var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; - iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; - rwst[i] = rx; - } - - this.conjugate(rwst, iwst, N); - this.transform(rwst, iwst, rmws, _, N, rbt); - this.conjugate(rmws, _, N); - this.normalize13b(rmws, N); - - out.negative = x.negative ^ y.negative; - out.length = x.length + y.length; - return out.strip(); - }; - - // Multiply `this` by `num` - BN.prototype.mul = function mul (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return this.mulTo(num, out); - }; - - // Multiply employing FFT - BN.prototype.mulf = function mulf (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return jumboMulTo(this, num, out); - }; - - // In-place Multiplication - BN.prototype.imul = function imul (num) { - return this.clone().mulTo(num, this); - }; - - BN.prototype.imuln = function imuln (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - - // Carry - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = (this.words[i] | 0) * num; - var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); - carry >>= 26; - carry += (w / 0x4000000) | 0; - // NOTE: lo is 27bit maximum - carry += lo >>> 26; - this.words[i] = lo & 0x3ffffff; - } - - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - - return this; - }; - - BN.prototype.muln = function muln (num) { - return this.clone().imuln(num); - }; - - // `this` * `this` - BN.prototype.sqr = function sqr () { - return this.mul(this); - }; - - // `this` * `this` in-place - BN.prototype.isqr = function isqr () { - return this.imul(this.clone()); - }; - - // Math.pow(`this`, `num`) - BN.prototype.pow = function pow (num) { - var w = toBitArray(num); - if (w.length === 0) return new BN(1); - - // Skip leading zeroes - var res = this; - for (var i = 0; i < w.length; i++, res = res.sqr()) { - if (w[i] !== 0) break; - } - - if (++i < w.length) { - for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { - if (w[i] === 0) continue; - - res = res.mul(q); - } - } - - return res; - }; - - // Shift-left in-place - BN.prototype.iushln = function iushln (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); - var i; - - if (r !== 0) { - var carry = 0; - - for (i = 0; i < this.length; i++) { - var newCarry = this.words[i] & carryMask; - var c = ((this.words[i] | 0) - newCarry) << r; - this.words[i] = c | carry; - carry = newCarry >>> (26 - r); - } - - if (carry) { - this.words[i] = carry; - this.length++; - } - } - - if (s !== 0) { - for (i = this.length - 1; i >= 0; i--) { - this.words[i + s] = this.words[i]; - } - - for (i = 0; i < s; i++) { - this.words[i] = 0; - } - - this.length += s; - } - - return this.strip(); - }; - - BN.prototype.ishln = function ishln (bits) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushln(bits); - }; - - // Shift-right in-place - // NOTE: `hint` is a lowest bit before trailing zeroes - // NOTE: if `extended` is present - it will be filled with destroyed bits - BN.prototype.iushrn = function iushrn (bits, hint, extended) { - assert(typeof bits === 'number' && bits >= 0); - var h; - if (hint) { - h = (hint - (hint % 26)) / 26; - } else { - h = 0; - } - - var r = bits % 26; - var s = Math.min((bits - r) / 26, this.length); - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - var maskedWords = extended; - - h -= s; - h = Math.max(0, h); - - // Extended mode, copy masked part - if (maskedWords) { - for (var i = 0; i < s; i++) { - maskedWords.words[i] = this.words[i]; - } - maskedWords.length = s; - } - - if (s === 0) { - // No-op, we should not move anything at all - } else if (this.length > s) { - this.length -= s; - for (i = 0; i < this.length; i++) { - this.words[i] = this.words[i + s]; - } - } else { - this.words[0] = 0; - this.length = 1; - } - - var carry = 0; - for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { - var word = this.words[i] | 0; - this.words[i] = (carry << (26 - r)) | (word >>> r); - carry = word & mask; - } - - // Push carried bits as a mask - if (maskedWords && carry !== 0) { - maskedWords.words[maskedWords.length++] = carry; - } - - if (this.length === 0) { - this.words[0] = 0; - this.length = 1; - } - - return this.strip(); - }; - - BN.prototype.ishrn = function ishrn (bits, hint, extended) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushrn(bits, hint, extended); - }; - - // Shift-left - BN.prototype.shln = function shln (bits) { - return this.clone().ishln(bits); - }; - - BN.prototype.ushln = function ushln (bits) { - return this.clone().iushln(bits); - }; - - // Shift-right - BN.prototype.shrn = function shrn (bits) { - return this.clone().ishrn(bits); - }; - - BN.prototype.ushrn = function ushrn (bits) { - return this.clone().iushrn(bits); - }; - - // Test if n bit is set - BN.prototype.testn = function testn (bit) { - assert(typeof bit === 'number' && bit >= 0); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) return false; - - // Check bit and return - var w = this.words[s]; - - return !!(w & q); - }; - - // Return only lowers bits of number (in-place) - BN.prototype.imaskn = function imaskn (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - - assert(this.negative === 0, 'imaskn works only with positive numbers'); - - if (this.length <= s) { - return this; - } - - if (r !== 0) { - s++; - } - this.length = Math.min(s, this.length); - - if (r !== 0) { - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - this.words[this.length - 1] &= mask; - } - - return this.strip(); - }; - - // Return only lowers bits of number - BN.prototype.maskn = function maskn (bits) { - return this.clone().imaskn(bits); - }; - - // Add plain number `num` to `this` - BN.prototype.iaddn = function iaddn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.isubn(-num); - - // Possible sign change - if (this.negative !== 0) { - if (this.length === 1 && (this.words[0] | 0) < num) { - this.words[0] = num - (this.words[0] | 0); - this.negative = 0; - return this; - } - - this.negative = 0; - this.isubn(num); - this.negative = 1; - return this; - } - - // Add without checks - return this._iaddn(num); - }; - - BN.prototype._iaddn = function _iaddn (num) { - this.words[0] += num; - - // Carry - for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { - this.words[i] -= 0x4000000; - if (i === this.length - 1) { - this.words[i + 1] = 1; - } else { - this.words[i + 1]++; - } - } - this.length = Math.max(this.length, i + 1); - - return this; - }; - - // Subtract plain number `num` from `this` - BN.prototype.isubn = function isubn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.iaddn(-num); - - if (this.negative !== 0) { - this.negative = 0; - this.iaddn(num); - this.negative = 1; - return this; - } - - this.words[0] -= num; - - if (this.length === 1 && this.words[0] < 0) { - this.words[0] = -this.words[0]; - this.negative = 1; - } else { - // Carry - for (var i = 0; i < this.length && this.words[i] < 0; i++) { - this.words[i] += 0x4000000; - this.words[i + 1] -= 1; - } - } - - return this.strip(); - }; - - BN.prototype.addn = function addn (num) { - return this.clone().iaddn(num); - }; - - BN.prototype.subn = function subn (num) { - return this.clone().isubn(num); - }; - - BN.prototype.iabs = function iabs () { - this.negative = 0; - - return this; - }; - - BN.prototype.abs = function abs () { - return this.clone().iabs(); - }; - - BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { - var len = num.length + shift; - var i; - - this._expand(len); - - var w; - var carry = 0; - for (i = 0; i < num.length; i++) { - w = (this.words[i + shift] | 0) + carry; - var right = (num.words[i] | 0) * mul; - w -= right & 0x3ffffff; - carry = (w >> 26) - ((right / 0x4000000) | 0); - this.words[i + shift] = w & 0x3ffffff; - } - for (; i < this.length - shift; i++) { - w = (this.words[i + shift] | 0) + carry; - carry = w >> 26; - this.words[i + shift] = w & 0x3ffffff; - } - - if (carry === 0) return this.strip(); - - // Subtraction overflow - assert(carry === -1); - carry = 0; - for (i = 0; i < this.length; i++) { - w = -(this.words[i] | 0) + carry; - carry = w >> 26; - this.words[i] = w & 0x3ffffff; - } - this.negative = 1; - - return this.strip(); - }; - - BN.prototype._wordDiv = function _wordDiv (num, mode) { - var shift = this.length - num.length; - - var a = this.clone(); - var b = num; - - // Normalize - var bhi = b.words[b.length - 1] | 0; - var bhiBits = this._countBits(bhi); - shift = 26 - bhiBits; - if (shift !== 0) { - b = b.ushln(shift); - a.iushln(shift); - bhi = b.words[b.length - 1] | 0; - } - - // Initialize quotient - var m = a.length - b.length; - var q; - - if (mode !== 'mod') { - q = new BN(null); - q.length = m + 1; - q.words = new Array(q.length); - for (var i = 0; i < q.length; i++) { - q.words[i] = 0; - } - } - - var diff = a.clone()._ishlnsubmul(b, 1, m); - if (diff.negative === 0) { - a = diff; - if (q) { - q.words[m] = 1; - } - } - - for (var j = m - 1; j >= 0; j--) { - 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 - // (0x7ffffff) - qj = Math.min((qj / bhi) | 0, 0x3ffffff); - - a._ishlnsubmul(b, qj, j); - while (a.negative !== 0) { - qj--; - a.negative = 0; - a._ishlnsubmul(b, 1, j); - if (!a.isZero()) { - a.negative ^= 1; - } - } - if (q) { - q.words[j] = qj; - } - } - if (q) { - q.strip(); - } - a.strip(); - - // Denormalize - if (mode !== 'div' && shift !== 0) { - a.iushrn(shift); - } - - return { - div: q || null, - mod: a - }; - }; - - // NOTE: 1) `mode` can be set to `mod` to request mod only, - // to `div` to request div only, or be absent to - // request both div & mod - // 2) `positive` is true if unsigned mod is requested - BN.prototype.divmod = function divmod (num, mode, positive) { - assert(!num.isZero()); - - if (this.isZero()) { - return { - div: new BN(0), - mod: new BN(0) - }; - } - - var div, mod, res; - if (this.negative !== 0 && num.negative === 0) { - res = this.neg().divmod(num, mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.iadd(num); - } - } - - return { - div: div, - mod: mod - }; - } - - if (this.negative === 0 && num.negative !== 0) { - res = this.divmod(num.neg(), mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - return { - div: div, - mod: res.mod - }; - } - - if ((this.negative & num.negative) !== 0) { - res = this.neg().divmod(num.neg(), mode); - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.isub(num); - } - } - - return { - div: res.div, - mod: mod - }; - } - - // Both numbers are positive at this point - - // Strip both numbers to approximate shift value - if (num.length > this.length || this.cmp(num) < 0) { - return { - div: new BN(0), - mod: this - }; - } - - // Very short reduction - if (num.length === 1) { - if (mode === 'div') { - return { - div: this.divn(num.words[0]), - mod: null - }; - } - - if (mode === 'mod') { - return { - div: null, - mod: new BN(this.modn(num.words[0])) - }; - } - - return { - div: this.divn(num.words[0]), - mod: new BN(this.modn(num.words[0])) - }; - } - - return this._wordDiv(num, mode); - }; - - // Find `this` / `num` - BN.prototype.div = function div (num) { - return this.divmod(num, 'div', false).div; - }; - - // Find `this` % `num` - BN.prototype.mod = function mod (num) { - return this.divmod(num, 'mod', false).mod; - }; - - BN.prototype.umod = function umod (num) { - return this.divmod(num, 'mod', true).mod; - }; - - // Find Round(`this` / `num`) - BN.prototype.divRound = function divRound (num) { - var dm = this.divmod(num); - - // Fast case - exact division - if (dm.mod.isZero()) return dm.div; - - var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; - - var half = num.ushrn(1); - var r2 = num.andln(1); - var cmp = mod.cmp(half); - - // Round down - if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div; - - // Round up - return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); - }; - - BN.prototype.modn = function modn (num) { - assert(num <= 0x3ffffff); - var p = (1 << 26) % num; - - var acc = 0; - for (var i = this.length - 1; i >= 0; i--) { - acc = (p * acc + (this.words[i] | 0)) % num; - } - - return acc; - }; - - // In-place division by number - BN.prototype.idivn = function idivn (num) { - assert(num <= 0x3ffffff); - - var carry = 0; - for (var i = this.length - 1; i >= 0; i--) { - var w = (this.words[i] | 0) + carry * 0x4000000; - this.words[i] = (w / num) | 0; - carry = w % num; - } - - return this.strip(); - }; - - BN.prototype.divn = function divn (num) { - return this.clone().idivn(num); - }; - - BN.prototype.egcd = function egcd (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var x = this; - var y = p.clone(); - - if (x.negative !== 0) { - x = x.umod(p); - } else { - x = x.clone(); - } - - // A * x + B * y = x - var A = new BN(1); - var B = new BN(0); - - // C * x + D * y = y - var C = new BN(0); - var D = new BN(1); - - var g = 0; - - while (x.isEven() && y.isEven()) { - x.iushrn(1); - y.iushrn(1); - ++g; - } - - var yp = y.clone(); - var xp = x.clone(); - - while (!x.isZero()) { - for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - x.iushrn(i); - while (i-- > 0) { - if (A.isOdd() || B.isOdd()) { - A.iadd(yp); - B.isub(xp); - } - - A.iushrn(1); - B.iushrn(1); - } - } - - for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - y.iushrn(j); - while (j-- > 0) { - if (C.isOdd() || D.isOdd()) { - C.iadd(yp); - D.isub(xp); - } - - C.iushrn(1); - D.iushrn(1); - } - } - - if (x.cmp(y) >= 0) { - x.isub(y); - A.isub(C); - B.isub(D); - } else { - y.isub(x); - C.isub(A); - D.isub(B); - } - } - - return { - a: C, - b: D, - gcd: y.iushln(g) - }; - }; - - // This is reduced incarnation of the binary EEA - // above, designated to invert members of the - // _prime_ fields F(p) at a maximal speed - BN.prototype._invmp = function _invmp (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var a = this; - var b = p.clone(); - - if (a.negative !== 0) { - a = a.umod(p); - } else { - a = a.clone(); - } - - var x1 = new BN(1); - var x2 = new BN(0); - - var delta = b.clone(); - - while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { - for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - a.iushrn(i); - while (i-- > 0) { - if (x1.isOdd()) { - x1.iadd(delta); - } - - x1.iushrn(1); - } - } - - for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - b.iushrn(j); - while (j-- > 0) { - if (x2.isOdd()) { - x2.iadd(delta); - } - - x2.iushrn(1); - } - } - - if (a.cmp(b) >= 0) { - a.isub(b); - x1.isub(x2); - } else { - b.isub(a); - x2.isub(x1); - } - } - - var res; - if (a.cmpn(1) === 0) { - res = x1; - } else { - res = x2; - } - - if (res.cmpn(0) < 0) { - res.iadd(p); - } - - return res; - }; - - BN.prototype.gcd = function gcd (num) { - if (this.isZero()) return num.abs(); - if (num.isZero()) return this.abs(); - - var a = this.clone(); - var b = num.clone(); - a.negative = 0; - b.negative = 0; - - // Remove common factor of two - for (var shift = 0; a.isEven() && b.isEven(); shift++) { - a.iushrn(1); - b.iushrn(1); - } - - do { - while (a.isEven()) { - a.iushrn(1); - } - while (b.isEven()) { - b.iushrn(1); - } - - var r = a.cmp(b); - if (r < 0) { - // Swap `a` and `b` to make `a` always bigger than `b` - var t = a; - a = b; - b = t; - } else if (r === 0 || b.cmpn(1) === 0) { - break; - } - - a.isub(b); - } while (true); - - return b.iushln(shift); - }; - - // Invert number in the field F(num) - BN.prototype.invm = function invm (num) { - return this.egcd(num).a.umod(num); - }; - - BN.prototype.isEven = function isEven () { - return (this.words[0] & 1) === 0; - }; - - BN.prototype.isOdd = function isOdd () { - return (this.words[0] & 1) === 1; - }; - - // And first word and num - BN.prototype.andln = function andln (num) { - return this.words[0] & num; - }; - - // Increment at the bit position in-line - BN.prototype.bincn = function bincn (bit) { - assert(typeof bit === 'number'); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) { - this._expand(s + 1); - this.words[s] |= q; - return this; - } - - // Add bit and propagate, if needed - var carry = q; - for (var i = s; carry !== 0 && i < this.length; i++) { - var w = this.words[i] | 0; - w += carry; - carry = w >>> 26; - w &= 0x3ffffff; - this.words[i] = w; - } - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - return this; - }; - - BN.prototype.isZero = function isZero () { - return this.length === 1 && this.words[0] === 0; - }; - - BN.prototype.cmpn = function cmpn (num) { - var negative = num < 0; - - if (this.negative !== 0 && !negative) return -1; - if (this.negative === 0 && negative) return 1; - - this.strip(); - - var res; - if (this.length > 1) { - res = 1; - } else { - if (negative) { - num = -num; - } - - assert(num <= 0x3ffffff, 'Number is too big'); - - var w = this.words[0] | 0; - res = w === num ? 0 : w < num ? -1 : 1; - } - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Compare two numbers and return: - // 1 - if `this` > `num` - // 0 - if `this` == `num` - // -1 - if `this` < `num` - BN.prototype.cmp = function cmp (num) { - if (this.negative !== 0 && num.negative === 0) return -1; - if (this.negative === 0 && num.negative !== 0) return 1; - - var res = this.ucmp(num); - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Unsigned comparison - BN.prototype.ucmp = function ucmp (num) { - // At this point both numbers have the same sign - if (this.length > num.length) return 1; - if (this.length < num.length) return -1; - - var res = 0; - for (var i = this.length - 1; i >= 0; i--) { - var a = this.words[i] | 0; - var b = num.words[i] | 0; - - if (a === b) continue; - if (a < b) { - res = -1; - } else if (a > b) { - res = 1; - } - break; - } - return res; - }; - - BN.prototype.gtn = function gtn (num) { - return this.cmpn(num) === 1; - }; - - BN.prototype.gt = function gt (num) { - return this.cmp(num) === 1; - }; - - BN.prototype.gten = function gten (num) { - return this.cmpn(num) >= 0; - }; - - BN.prototype.gte = function gte (num) { - return this.cmp(num) >= 0; - }; - - BN.prototype.ltn = function ltn (num) { - return this.cmpn(num) === -1; - }; - - BN.prototype.lt = function lt (num) { - return this.cmp(num) === -1; - }; - - BN.prototype.lten = function lten (num) { - return this.cmpn(num) <= 0; - }; - - BN.prototype.lte = function lte (num) { - return this.cmp(num) <= 0; - }; - - BN.prototype.eqn = function eqn (num) { - return this.cmpn(num) === 0; - }; - - BN.prototype.eq = function eq (num) { - return this.cmp(num) === 0; - }; - - // - // A reduce context, could be using montgomery or something better, depending - // on the `m` itself. - // - BN.red = function red (num) { - return new Red(num); - }; - - BN.prototype.toRed = function toRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - assert(this.negative === 0, 'red works only with positives'); - return ctx.convertTo(this)._forceRed(ctx); - }; - - BN.prototype.fromRed = function fromRed () { - assert(this.red, 'fromRed works only with numbers in reduction context'); - return this.red.convertFrom(this); - }; - - BN.prototype._forceRed = function _forceRed (ctx) { - this.red = ctx; - return this; - }; - - BN.prototype.forceRed = function forceRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - return this._forceRed(ctx); - }; - - BN.prototype.redAdd = function redAdd (num) { - assert(this.red, 'redAdd works only with red numbers'); - return this.red.add(this, num); - }; - - BN.prototype.redIAdd = function redIAdd (num) { - assert(this.red, 'redIAdd works only with red numbers'); - return this.red.iadd(this, num); - }; - - BN.prototype.redSub = function redSub (num) { - assert(this.red, 'redSub works only with red numbers'); - return this.red.sub(this, num); - }; - - BN.prototype.redISub = function redISub (num) { - assert(this.red, 'redISub works only with red numbers'); - return this.red.isub(this, num); - }; - - BN.prototype.redShl = function redShl (num) { - assert(this.red, 'redShl works only with red numbers'); - return this.red.shl(this, num); - }; - - BN.prototype.redMul = function redMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.mul(this, num); - }; - - BN.prototype.redIMul = function redIMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.imul(this, num); - }; - - BN.prototype.redSqr = function redSqr () { - assert(this.red, 'redSqr works only with red numbers'); - this.red._verify1(this); - return this.red.sqr(this); - }; - - BN.prototype.redISqr = function redISqr () { - assert(this.red, 'redISqr works only with red numbers'); - this.red._verify1(this); - return this.red.isqr(this); - }; - - // Square root over p - BN.prototype.redSqrt = function redSqrt () { - assert(this.red, 'redSqrt works only with red numbers'); - this.red._verify1(this); - return this.red.sqrt(this); - }; - - BN.prototype.redInvm = function redInvm () { - assert(this.red, 'redInvm works only with red numbers'); - this.red._verify1(this); - return this.red.invm(this); - }; - - // Return negative clone of `this` % `red modulo` - BN.prototype.redNeg = function redNeg () { - assert(this.red, 'redNeg works only with red numbers'); - this.red._verify1(this); - return this.red.neg(this); - }; - - BN.prototype.redPow = function redPow (num) { - assert(this.red && !num.red, 'redPow(normalNum)'); - this.red._verify1(this); - return this.red.pow(this, num); - }; - - // Prime numbers with efficient reduction - var primes = { - k256: null, - p224: null, - p192: null, - p25519: null - }; - - // Pseudo-Mersenne prime - function MPrime (name, p) { - // P = 2 ^ N - K - this.name = name; - this.p = new BN(p, 16); - this.n = this.p.bitLength(); - this.k = new BN(1).iushln(this.n).isub(this.p); - - this.tmp = this._tmp(); - } - - MPrime.prototype._tmp = function _tmp () { - var tmp = new BN(null); - tmp.words = new Array(Math.ceil(this.n / 13)); - return tmp; - }; - - MPrime.prototype.ireduce = function ireduce (num) { - // Assumes that `num` is less than `P^2` - // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) - var r = num; - var rlen; - - do { - this.split(r, this.tmp); - r = this.imulK(r); - r = r.iadd(this.tmp); - rlen = r.bitLength(); - } while (rlen > this.n); - - var cmp = rlen < this.n ? -1 : r.ucmp(this.p); - if (cmp === 0) { - r.words[0] = 0; - r.length = 1; - } else if (cmp > 0) { - r.isub(this.p); - } else { - if (r.strip !== undefined) { - // r is BN v4 instance - r.strip(); - } else { - // r is BN v5 instance - r._strip(); - } - } - - return r; - }; - - MPrime.prototype.split = function split (input, out) { - input.iushrn(this.n, 0, out); - }; - - MPrime.prototype.imulK = function imulK (num) { - return num.imul(this.k); - }; - - function K256 () { - MPrime.call( - this, - 'k256', - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); - } - inherits(K256, MPrime); - - K256.prototype.split = function split (input, output) { - // 256 = 9 * 26 + 22 - var mask = 0x3fffff; - - var outLen = Math.min(input.length, 9); - for (var i = 0; i < outLen; i++) { - output.words[i] = input.words[i]; - } - output.length = outLen; - - if (input.length <= 9) { - input.words[0] = 0; - input.length = 1; - return; - } - - // Shift by 9 limbs - var prev = input.words[9]; - output.words[output.length++] = prev & mask; - - for (i = 10; i < input.length; i++) { - var next = input.words[i] | 0; - input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); - prev = next; - } - prev >>>= 22; - input.words[i - 10] = prev; - if (prev === 0 && input.length > 10) { - input.length -= 10; - } else { - input.length -= 9; - } - }; - - K256.prototype.imulK = function imulK (num) { - // K = 0x1000003d1 = [ 0x40, 0x3d1 ] - num.words[num.length] = 0; - num.words[num.length + 1] = 0; - num.length += 2; - - // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 - var lo = 0; - for (var i = 0; i < num.length; i++) { - var w = num.words[i] | 0; - lo += w * 0x3d1; - num.words[i] = lo & 0x3ffffff; - lo = w * 0x40 + ((lo / 0x4000000) | 0); - } - - // Fast length reduction - if (num.words[num.length - 1] === 0) { - num.length--; - if (num.words[num.length - 1] === 0) { - num.length--; - } - } - return num; - }; - - function P224 () { - MPrime.call( - this, - 'p224', - 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); - } - inherits(P224, MPrime); - - function P192 () { - MPrime.call( - this, - 'p192', - 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); - } - inherits(P192, MPrime); - - function P25519 () { - // 2 ^ 255 - 19 - MPrime.call( - this, - '25519', - '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); - } - inherits(P25519, MPrime); - - P25519.prototype.imulK = function imulK (num) { - // K = 0x13 - var carry = 0; - for (var i = 0; i < num.length; i++) { - var hi = (num.words[i] | 0) * 0x13 + carry; - var lo = hi & 0x3ffffff; - hi >>>= 26; - - num.words[i] = lo; - carry = hi; - } - if (carry !== 0) { - num.words[num.length++] = carry; - } - return num; - }; - - // Exported mostly for testing purposes, use plain name instead - BN._prime = function prime (name) { - // Cached version of prime - if (primes[name]) return primes[name]; - - var prime; - if (name === 'k256') { - prime = new K256(); - } else if (name === 'p224') { - prime = new P224(); - } else if (name === 'p192') { - prime = new P192(); - } else if (name === 'p25519') { - prime = new P25519(); - } else { - throw new Error('Unknown prime ' + name); - } - primes[name] = prime; - - return prime; - }; - - // - // Base reduction engine - // - function Red (m) { - if (typeof m === 'string') { - var prime = BN._prime(m); - this.m = prime.p; - this.prime = prime; - } else { - assert(m.gtn(1), 'modulus must be greater than 1'); - this.m = m; - this.prime = null; - } - } - - Red.prototype._verify1 = function _verify1 (a) { - assert(a.negative === 0, 'red works only with positives'); - assert(a.red, 'red works only with red numbers'); - }; - - Red.prototype._verify2 = function _verify2 (a, b) { - assert((a.negative | b.negative) === 0, 'red works only with positives'); - assert(a.red && a.red === b.red, - 'red works only with red numbers'); - }; - - Red.prototype.imod = function imod (a) { - if (this.prime) return this.prime.ireduce(a)._forceRed(this); - return a.umod(this.m)._forceRed(this); - }; - - Red.prototype.neg = function neg (a) { - if (a.isZero()) { - return a.clone(); - } - - return this.m.sub(a)._forceRed(this); - }; - - Red.prototype.add = function add (a, b) { - this._verify2(a, b); - - var res = a.add(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.iadd = function iadd (a, b) { - this._verify2(a, b); - - var res = a.iadd(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res; - }; - - Red.prototype.sub = function sub (a, b) { - this._verify2(a, b); - - var res = a.sub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.isub = function isub (a, b) { - this._verify2(a, b); - - var res = a.isub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res; - }; - - Red.prototype.shl = function shl (a, num) { - this._verify1(a); - return this.imod(a.ushln(num)); - }; - - Red.prototype.imul = function imul (a, b) { - this._verify2(a, b); - return this.imod(a.imul(b)); - }; - - Red.prototype.mul = function mul (a, b) { - this._verify2(a, b); - return this.imod(a.mul(b)); - }; - - Red.prototype.isqr = function isqr (a) { - return this.imul(a, a.clone()); - }; - - Red.prototype.sqr = function sqr (a) { - return this.mul(a, a); - }; - - Red.prototype.sqrt = function sqrt (a) { - if (a.isZero()) return a.clone(); - - var mod3 = this.m.andln(3); - assert(mod3 % 2 === 1); - - // Fast case - if (mod3 === 3) { - var pow = this.m.add(new BN(1)).iushrn(2); - return this.pow(a, pow); - } - - // Tonelli-Shanks algorithm (Totally unoptimized and slow) - // - // Find Q and S, that Q * 2 ^ S = (P - 1) - var q = this.m.subn(1); - var s = 0; - while (!q.isZero() && q.andln(1) === 0) { - s++; - q.iushrn(1); - } - assert(!q.isZero()); - - var one = new BN(1).toRed(this); - var nOne = one.redNeg(); - - // Find quadratic non-residue - // NOTE: Max is such because of generalized Riemann hypothesis. - var lpow = this.m.subn(1).iushrn(1); - var z = this.m.bitLength(); - z = new BN(2 * z * z).toRed(this); - - while (this.pow(z, lpow).cmp(nOne) !== 0) { - z.redIAdd(nOne); - } - - var c = this.pow(z, q); - var r = this.pow(a, q.addn(1).iushrn(1)); - var t = this.pow(a, q); - var m = s; - while (t.cmp(one) !== 0) { - var tmp = t; - for (var i = 0; tmp.cmp(one) !== 0; i++) { - tmp = tmp.redSqr(); - } - assert(i < m); - var b = this.pow(c, new BN(1).iushln(m - i - 1)); - - r = r.redMul(b); - c = b.redSqr(); - t = t.redMul(c); - m = i; - } - - return r; - }; - - Red.prototype.invm = function invm (a) { - var inv = a._invmp(this.m); - if (inv.negative !== 0) { - inv.negative = 0; - return this.imod(inv).redNeg(); - } else { - return this.imod(inv); - } - }; - - Red.prototype.pow = function pow (a, num) { - if (num.isZero()) return new BN(1).toRed(this); - if (num.cmpn(1) === 0) return a.clone(); - - var windowSize = 4; - var wnd = new Array(1 << windowSize); - wnd[0] = new BN(1).toRed(this); - wnd[1] = a; - for (var i = 2; i < wnd.length; i++) { - wnd[i] = this.mul(wnd[i - 1], a); - } - - var res = wnd[0]; - var current = 0; - var currentLen = 0; - var start = num.bitLength() % 26; - if (start === 0) { - start = 26; - } - - for (i = num.length - 1; i >= 0; i--) { - var word = num.words[i]; - for (var j = start - 1; j >= 0; j--) { - var bit = (word >> j) & 1; - if (res !== wnd[0]) { - res = this.sqr(res); - } - - if (bit === 0 && current === 0) { - currentLen = 0; - continue; - } - - current <<= 1; - current |= bit; - currentLen++; - if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; - - res = this.mul(res, wnd[current]); - currentLen = 0; - current = 0; - } - start = 26; - } - - return res; - }; - - Red.prototype.convertTo = function convertTo (num) { - var r = num.umod(this.m); - - return r === num ? r.clone() : r; - }; - - Red.prototype.convertFrom = function convertFrom (num) { - var res = num.clone(); - res.red = null; - return res; - }; - - // - // Montgomery method engine - // - - BN.mont = function mont (num) { - return new Mont(num); - }; - - function Mont (m) { - Red.call(this, m); - - this.shift = this.m.bitLength(); - if (this.shift % 26 !== 0) { - this.shift += 26 - (this.shift % 26); - } - - this.r = new BN(1).iushln(this.shift); - this.r2 = this.imod(this.r.sqr()); - this.rinv = this.r._invmp(this.m); - - this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); - this.minv = this.minv.umod(this.r); - this.minv = this.r.sub(this.minv); - } - inherits(Mont, Red); - - Mont.prototype.convertTo = function convertTo (num) { - return this.imod(num.ushln(this.shift)); - }; - - Mont.prototype.convertFrom = function convertFrom (num) { - var r = this.imod(num.mul(this.rinv)); - r.red = null; - return r; - }; - - Mont.prototype.imul = function imul (a, b) { - if (a.isZero() || b.isZero()) { - a.words[0] = 0; - a.length = 1; - return a; - } - - var t = a.imul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.mul = function mul (a, b) { - if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); - - var t = a.mul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.invm = function invm (a) { - // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R - var res = this.imod(a._invmp(this.m).mul(this.r2)); - return res._forceRed(this); - }; -})( false || module, this); - - -/***/ }), - -/***/ "./node_modules/create-hash/browser.js": -/*!*********************************************!*\ - !*** ./node_modules/create-hash/browser.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var MD5 = __webpack_require__(/*! md5.js */ "./node_modules/md5.js/index.js") -var RIPEMD160 = __webpack_require__(/*! ripemd160 */ "./node_modules/ripemd160/index.js") -var sha = __webpack_require__(/*! sha.js */ "./node_modules/sha.js/index.js") -var Base = __webpack_require__(/*! cipher-base */ "./node_modules/cipher-base/index.js") - -function Hash (hash) { - Base.call(this, 'digest') - - this._hash = hash -} - -inherits(Hash, Base) - -Hash.prototype._update = function (data) { - this._hash.update(data) -} - -Hash.prototype._final = function () { - return this._hash.digest() -} - -module.exports = function createHash (alg) { - alg = alg.toLowerCase() - if (alg === 'md5') return new MD5() - if (alg === 'rmd160' || alg === 'ripemd160') return new RIPEMD160() - - return new Hash(sha(alg)) -} - - -/***/ }), - -/***/ "./node_modules/create-hash/md5.js": -/*!*****************************************!*\ - !*** ./node_modules/create-hash/md5.js ***! - \*****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var MD5 = __webpack_require__(/*! md5.js */ "./node_modules/md5.js/index.js") - -module.exports = function (buffer) { - return new MD5().update(buffer).digest() -} - - -/***/ }), - -/***/ "./node_modules/create-hmac/browser.js": -/*!*********************************************!*\ - !*** ./node_modules/create-hmac/browser.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var Legacy = __webpack_require__(/*! ./legacy */ "./node_modules/create-hmac/legacy.js") -var Base = __webpack_require__(/*! cipher-base */ "./node_modules/cipher-base/index.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var md5 = __webpack_require__(/*! create-hash/md5 */ "./node_modules/create-hash/md5.js") -var RIPEMD160 = __webpack_require__(/*! ripemd160 */ "./node_modules/ripemd160/index.js") - -var sha = __webpack_require__(/*! sha.js */ "./node_modules/sha.js/index.js") - -var ZEROS = Buffer.alloc(128) - -function Hmac (alg, key) { - Base.call(this, 'digest') - if (typeof key === 'string') { - key = Buffer.from(key) - } - - var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64 - - this._alg = alg - this._key = key - if (key.length > blocksize) { - var hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg) - key = hash.update(key).digest() - } else if (key.length < blocksize) { - key = Buffer.concat([key, ZEROS], blocksize) - } - - var ipad = this._ipad = Buffer.allocUnsafe(blocksize) - var opad = this._opad = Buffer.allocUnsafe(blocksize) - - for (var i = 0; i < blocksize; i++) { - ipad[i] = key[i] ^ 0x36 - opad[i] = key[i] ^ 0x5C - } - this._hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg) - this._hash.update(ipad) -} - -inherits(Hmac, Base) - -Hmac.prototype._update = function (data) { - this._hash.update(data) -} - -Hmac.prototype._final = function () { - var h = this._hash.digest() - var hash = this._alg === 'rmd160' ? new RIPEMD160() : sha(this._alg) - return hash.update(this._opad).update(h).digest() -} - -module.exports = function createHmac (alg, key) { - alg = alg.toLowerCase() - if (alg === 'rmd160' || alg === 'ripemd160') { - return new Hmac('rmd160', key) - } - if (alg === 'md5') { - return new Legacy(md5, key) - } - return new Hmac(alg, key) -} - - -/***/ }), - -/***/ "./node_modules/create-hmac/legacy.js": -/*!********************************************!*\ - !*** ./node_modules/create-hmac/legacy.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var Base = __webpack_require__(/*! cipher-base */ "./node_modules/cipher-base/index.js") - -var ZEROS = Buffer.alloc(128) -var blocksize = 64 - -function Hmac (alg, key) { - Base.call(this, 'digest') - if (typeof key === 'string') { - key = Buffer.from(key) - } - - this._alg = alg - this._key = key - - if (key.length > blocksize) { - key = alg(key) - } else if (key.length < blocksize) { - key = Buffer.concat([key, ZEROS], blocksize) - } - - var ipad = this._ipad = Buffer.allocUnsafe(blocksize) - var opad = this._opad = Buffer.allocUnsafe(blocksize) - - for (var i = 0; i < blocksize; i++) { - ipad[i] = key[i] ^ 0x36 - opad[i] = key[i] ^ 0x5C - } - - this._hash = [ipad] -} - -inherits(Hmac, Base) - -Hmac.prototype._update = function (data) { - this._hash.push(data) -} - -Hmac.prototype._final = function () { - var h = this._alg(Buffer.concat(this._hash)) - return this._alg(Buffer.concat([this._opad, h])) -} -module.exports = Hmac - - -/***/ }), - -/***/ "./node_modules/create-torrent/index.js": -/*!**********************************************!*\ - !*** ./node_modules/create-torrent/index.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! create-torrent. MIT License. WebTorrent LLC */ -const bencode = __webpack_require__(/*! bencode */ "./node_modules/bencode/lib/index.js") -const BlockStream = __webpack_require__(/*! block-stream2 */ "./node_modules/block-stream2/index.js") -const calcPieceLength = __webpack_require__(/*! piece-length */ "./node_modules/piece-length/index.js") -const corePath = __webpack_require__(/*! path */ "./node_modules/path-browserify/index.js") -const FileReadStream = __webpack_require__(/*! filestream/read */ "./node_modules/filestream/read.js") -const isFile = __webpack_require__(/*! is-file */ "?f12c") -const junk = __webpack_require__(/*! junk */ "./node_modules/junk/index.js") -const MultiStream = __webpack_require__(/*! multistream */ "./node_modules/multistream/index.js") -const once = __webpack_require__(/*! once */ "./node_modules/once/once.js") -const parallel = __webpack_require__(/*! run-parallel */ "./node_modules/run-parallel/index.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") -const sha1 = __webpack_require__(/*! simple-sha1 */ "./node_modules/simple-sha1/browser.js") -const stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") - -const getFiles = __webpack_require__(/*! ./get-files */ "?3b18") // browser exclude - -const announceList = [ - ['udp://tracker.leechers-paradise.org:6969'], - ['udp://tracker.coppersurfer.tk:6969'], - ['udp://tracker.opentrackr.org:1337'], - ['udp://explodie.org:6969'], - ['udp://tracker.empire-js.us:1337'], - ['wss://tracker.btorrent.xyz'], - ['wss://tracker.openwebtorrent.com'] -] - -/** - * Create a torrent. - * @param {string|File|FileList|Buffer|Stream|Array.} input - * @param {Object} opts - * @param {string=} opts.name - * @param {Date=} opts.creationDate - * @param {string=} opts.comment - * @param {string=} opts.createdBy - * @param {boolean|number=} opts.private - * @param {number=} opts.pieceLength - * @param {Array.>=} opts.announceList - * @param {Array.=} opts.urlList - * @param {Object=} opts.info - * @param {Function} opts.onProgress - * @param {function} cb - * @return {Buffer} buffer of .torrent file data - */ -function createTorrent (input, opts, cb) { - if (typeof opts === 'function') [opts, cb] = [cb, opts] - opts = opts ? Object.assign({}, opts) : {} - - _parseInput(input, opts, (err, files, singleFileTorrent) => { - if (err) return cb(err) - opts.singleFileTorrent = singleFileTorrent - onFiles(files, opts, cb) - }) -} - -function parseInput (input, opts, cb) { - if (typeof opts === 'function') [opts, cb] = [cb, opts] - opts = opts ? Object.assign({}, opts) : {} - _parseInput(input, opts, cb) -} - -/** - * Parse input file and return file information. - */ -function _parseInput (input, opts, cb) { - if (isFileList(input)) input = Array.from(input) - if (!Array.isArray(input)) input = [input] - - if (input.length === 0) throw new Error('invalid input type') - - input.forEach(item => { - if (item == null) throw new Error(`invalid input type: ${item}`) - }) - - // In Electron, use the true file path - input = input.map(item => { - if (isBlob(item) && typeof item.path === 'string' && typeof getFiles === 'function') return item.path - return item - }) - - // If there's just one file, allow the name to be set by `opts.name` - if (input.length === 1 && typeof input[0] !== 'string' && !input[0].name) input[0].name = opts.name - - let commonPrefix = null - input.forEach((item, i) => { - if (typeof item === 'string') { - return - } - - let path = item.fullPath || item.name - if (!path) { - path = `Unknown File ${i + 1}` - item.unknownName = true - } - - item.path = path.split('/') - - // Remove initial slash - if (!item.path[0]) { - item.path.shift() - } - - if (item.path.length < 2) { // No real prefix - commonPrefix = null - } else if (i === 0 && input.length > 1) { // The first file has a prefix - commonPrefix = item.path[0] - } else if (item.path[0] !== commonPrefix) { // The prefix doesn't match - commonPrefix = null - } - }) - - const filterJunkFiles = opts.filterJunkFiles === undefined ? true : opts.filterJunkFiles - if (filterJunkFiles) { - // Remove junk files - input = input.filter(item => { - if (typeof item === 'string') { - return true - } - return !isJunkPath(item.path) - }) - } - - if (commonPrefix) { - input.forEach(item => { - const pathless = (Buffer.isBuffer(item) || isReadable(item)) && !item.path - if (typeof item === 'string' || pathless) return - item.path.shift() - }) - } - - if (!opts.name && commonPrefix) { - opts.name = commonPrefix - } - - if (!opts.name) { - // use first user-set file name - input.some(item => { - if (typeof item === 'string') { - opts.name = corePath.basename(item) - return true - } else if (!item.unknownName) { - opts.name = item.path[item.path.length - 1] - return true - } - return false - }) - } - - if (!opts.name) { - opts.name = `Unnamed Torrent ${Date.now()}` - } - - const numPaths = input.reduce((sum, item) => sum + Number(typeof item === 'string'), 0) - - let isSingleFileTorrent = (input.length === 1) - - if (input.length === 1 && typeof input[0] === 'string') { - if (typeof getFiles !== 'function') { - throw new Error('filesystem paths do not work in the browser') - } - // If there's a single path, verify it's a file before deciding this is a single - // file torrent - isFile(input[0], (err, pathIsFile) => { - if (err) return cb(err) - isSingleFileTorrent = pathIsFile - processInput() - }) - } else { - queueMicrotask(processInput) - } - - function processInput () { - parallel(input.map(item => cb => { - const file = {} - - if (isBlob(item)) { - file.getStream = getBlobStream(item) - file.length = item.size - } else if (Buffer.isBuffer(item)) { - file.getStream = getBufferStream(item) - file.length = item.length - } else if (isReadable(item)) { - file.getStream = getStreamStream(item, file) - file.length = 0 - } else if (typeof item === 'string') { - if (typeof getFiles !== 'function') { - throw new Error('filesystem paths do not work in the browser') - } - const keepRoot = numPaths > 1 || isSingleFileTorrent - getFiles(item, keepRoot, cb) - return // early return! - } else { - throw new Error('invalid input type') - } - file.path = item.path - cb(null, file) - }), (err, files) => { - if (err) return cb(err) - files = files.flat() - cb(null, files, isSingleFileTorrent) - }) - } -} - -const MAX_OUTSTANDING_HASHES = 5 - -function getPieceList (files, pieceLength, estimatedTorrentLength, opts, cb) { - cb = once(cb) - const pieces = [] - let length = 0 - let hashedLength = 0 - - const streams = files.map(file => file.getStream) - - let remainingHashes = 0 - let pieceNum = 0 - let ended = false - - const multistream = new MultiStream(streams) - const blockstream = new BlockStream(pieceLength, { zeroPadding: false }) - - multistream.on('error', onError) - - multistream - .pipe(blockstream) - .on('data', onData) - .on('end', onEnd) - .on('error', onError) - - function onData (chunk) { - length += chunk.length - - const i = pieceNum - sha1(chunk, hash => { - pieces[i] = hash - remainingHashes -= 1 - if (remainingHashes < MAX_OUTSTANDING_HASHES) { - blockstream.resume() - } - hashedLength += chunk.length - if (opts.onProgress) opts.onProgress(hashedLength, estimatedTorrentLength) - maybeDone() - }) - remainingHashes += 1 - if (remainingHashes >= MAX_OUTSTANDING_HASHES) { - blockstream.pause() - } - pieceNum += 1 - } - - function onEnd () { - ended = true - maybeDone() - } - - function onError (err) { - cleanup() - cb(err) - } - - function cleanup () { - multistream.removeListener('error', onError) - blockstream.removeListener('data', onData) - blockstream.removeListener('end', onEnd) - blockstream.removeListener('error', onError) - } - - function maybeDone () { - if (ended && remainingHashes === 0) { - cleanup() - cb(null, Buffer.from(pieces.join(''), 'hex'), length) - } - } -} - -function onFiles (files, opts, cb) { - let announceList = opts.announceList - - if (!announceList) { - if (typeof opts.announce === 'string') announceList = [[opts.announce]] - else if (Array.isArray(opts.announce)) { - announceList = opts.announce.map(u => [u]) - } - } - - if (!announceList) announceList = [] - - if (globalThis.WEBTORRENT_ANNOUNCE) { - if (typeof globalThis.WEBTORRENT_ANNOUNCE === 'string') { - announceList.push([[globalThis.WEBTORRENT_ANNOUNCE]]) - } else if (Array.isArray(globalThis.WEBTORRENT_ANNOUNCE)) { - announceList = announceList.concat(globalThis.WEBTORRENT_ANNOUNCE.map(u => [u])) - } - } - - // When no trackers specified, use some reasonable defaults - if (opts.announce === undefined && opts.announceList === undefined) { - announceList = announceList.concat(module.exports.announceList) - } - - if (typeof opts.urlList === 'string') opts.urlList = [opts.urlList] - - const torrent = { - info: { - name: opts.name - }, - 'creation date': Math.ceil((Number(opts.creationDate) || Date.now()) / 1000), - encoding: 'UTF-8' - } - - if (announceList.length !== 0) { - torrent.announce = announceList[0][0] - torrent['announce-list'] = announceList - } - - if (opts.comment !== undefined) torrent.comment = opts.comment - - if (opts.createdBy !== undefined) torrent['created by'] = opts.createdBy - - if (opts.private !== undefined) torrent.info.private = Number(opts.private) - - if (opts.info !== undefined) Object.assign(torrent.info, opts.info) - - // "ssl-cert" key is for SSL torrents, see: - // - http://blog.libtorrent.org/2012/01/bittorrent-over-ssl/ - // - http://www.libtorrent.org/manual-ref.html#ssl-torrents - // - http://www.libtorrent.org/reference-Create_Torrents.html - if (opts.sslCert !== undefined) torrent.info['ssl-cert'] = opts.sslCert - - if (opts.urlList !== undefined) torrent['url-list'] = opts.urlList - - const estimatedTorrentLength = files.reduce(sumLength, 0) - const pieceLength = opts.pieceLength || calcPieceLength(estimatedTorrentLength) - torrent.info['piece length'] = pieceLength - - getPieceList( - files, - pieceLength, - estimatedTorrentLength, - opts, - (err, pieces, torrentLength) => { - if (err) return cb(err) - torrent.info.pieces = pieces - - files.forEach(file => { - delete file.getStream - }) - - if (opts.singleFileTorrent) { - torrent.info.length = torrentLength - } else { - torrent.info.files = files - } - - cb(null, bencode.encode(torrent)) - } - ) -} - -/** - * Determine if a a file is junk based on its path - * (defined as hidden OR recognized by the `junk` package) - * - * @param {string} path - * @return {boolean} - */ -function isJunkPath (path) { - const filename = path[path.length - 1] - return filename[0] === '.' && junk.is(filename) -} - -/** - * Accumulator to sum file lengths - * @param {number} sum - * @param {Object} file - * @return {number} - */ -function sumLength (sum, file) { - return sum + file.length -} - -/** - * Check if `obj` is a W3C `Blob` object (which `File` inherits from) - * @param {*} obj - * @return {boolean} - */ -function isBlob (obj) { - return typeof Blob !== 'undefined' && obj instanceof Blob -} - -/** - * Check if `obj` is a W3C `FileList` object - * @param {*} obj - * @return {boolean} - */ -function isFileList (obj) { - return typeof FileList !== 'undefined' && obj instanceof FileList -} - -/** - * Check if `obj` is a node Readable stream - * @param {*} obj - * @return {boolean} - */ -function isReadable (obj) { - return typeof obj === 'object' && obj != null && typeof obj.pipe === 'function' -} - -/** - * Convert a `File` to a lazy readable stream. - * @param {File|Blob} file - * @return {function} - */ -function getBlobStream (file) { - return () => new FileReadStream(file) -} - -/** - * Convert a `Buffer` to a lazy readable stream. - * @param {Buffer} buffer - * @return {function} - */ -function getBufferStream (buffer) { - return () => { - const s = new stream.PassThrough() - s.end(buffer) - return s - } -} - -/** - * Convert a readable stream to a lazy readable stream. Adds instrumentation to track - * the number of bytes in the stream and set `file.length`. - * - * @param {Stream} readable - * @param {Object} file - * @return {function} - */ -function getStreamStream (readable, file) { - return () => { - const counter = new stream.Transform() - counter._transform = function (buf, enc, done) { - file.length += buf.length - this.push(buf) - done() - } - readable.pipe(counter) - return counter - } -} - -module.exports = createTorrent -module.exports.parseInput = parseInput -module.exports.announceList = announceList -module.exports.isJunkPath = isJunkPath - - -/***/ }), - -/***/ "./node_modules/crypto-browserify/index.js": -/*!*************************************************!*\ - !*** ./node_modules/crypto-browserify/index.js ***! - \*************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -exports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") -exports.createHash = exports.Hash = __webpack_require__(/*! create-hash */ "./node_modules/create-hash/browser.js") -exports.createHmac = exports.Hmac = __webpack_require__(/*! create-hmac */ "./node_modules/create-hmac/browser.js") - -var algos = __webpack_require__(/*! browserify-sign/algos */ "./node_modules/browserify-sign/algos.js") -var algoKeys = Object.keys(algos) -var hashes = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160'].concat(algoKeys) -exports.getHashes = function () { - return hashes -} - -var p = __webpack_require__(/*! pbkdf2 */ "./node_modules/pbkdf2/browser.js") -exports.pbkdf2 = p.pbkdf2 -exports.pbkdf2Sync = p.pbkdf2Sync - -var aes = __webpack_require__(/*! browserify-cipher */ "./node_modules/browserify-cipher/browser.js") - -exports.Cipher = aes.Cipher -exports.createCipher = aes.createCipher -exports.Cipheriv = aes.Cipheriv -exports.createCipheriv = aes.createCipheriv -exports.Decipher = aes.Decipher -exports.createDecipher = aes.createDecipher -exports.Decipheriv = aes.Decipheriv -exports.createDecipheriv = aes.createDecipheriv -exports.getCiphers = aes.getCiphers -exports.listCiphers = aes.listCiphers - -var dh = __webpack_require__(/*! diffie-hellman */ "./node_modules/diffie-hellman/browser.js") - -exports.DiffieHellmanGroup = dh.DiffieHellmanGroup -exports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup -exports.getDiffieHellman = dh.getDiffieHellman -exports.createDiffieHellman = dh.createDiffieHellman -exports.DiffieHellman = dh.DiffieHellman - -var sign = __webpack_require__(/*! browserify-sign */ "./node_modules/browserify-sign/browser/index.js") - -exports.createSign = sign.createSign -exports.Sign = sign.Sign -exports.createVerify = sign.createVerify -exports.Verify = sign.Verify - -exports.createECDH = __webpack_require__(/*! create-ecdh */ "./node_modules/create-ecdh/browser.js") - -var publicEncrypt = __webpack_require__(/*! public-encrypt */ "./node_modules/public-encrypt/browser.js") - -exports.publicEncrypt = publicEncrypt.publicEncrypt -exports.privateEncrypt = publicEncrypt.privateEncrypt -exports.publicDecrypt = publicEncrypt.publicDecrypt -exports.privateDecrypt = publicEncrypt.privateDecrypt - -// the least I can do is make error messages for the rest of the node.js/crypto api. -// ;[ -// 'createCredentials' -// ].forEach(function (name) { -// exports[name] = function () { -// throw new Error([ -// 'sorry, ' + name + ' is not implemented yet', -// 'we accept pull requests', -// 'https://github.com/crypto-browserify/crypto-browserify' -// ].join('\n')) -// } -// }) - -var rf = __webpack_require__(/*! randomfill */ "./node_modules/randomfill/browser.js") - -exports.randomFill = rf.randomFill -exports.randomFillSync = rf.randomFillSync - -exports.createCredentials = function () { - throw new Error([ - 'sorry, createCredentials is not implemented yet', - 'we accept pull requests', - 'https://github.com/crypto-browserify/crypto-browserify' - ].join('\n')) -} - -exports.constants = { - 'DH_CHECK_P_NOT_SAFE_PRIME': 2, - 'DH_CHECK_P_NOT_PRIME': 1, - 'DH_UNABLE_TO_CHECK_GENERATOR': 4, - 'DH_NOT_SUITABLE_GENERATOR': 8, - 'NPN_ENABLED': 1, - 'ALPN_ENABLED': 1, - 'RSA_PKCS1_PADDING': 1, - 'RSA_SSLV23_PADDING': 2, - 'RSA_NO_PADDING': 3, - 'RSA_PKCS1_OAEP_PADDING': 4, - 'RSA_X931_PADDING': 5, - 'RSA_PKCS1_PSS_PADDING': 6, - 'POINT_CONVERSION_COMPRESSED': 2, - 'POINT_CONVERSION_UNCOMPRESSED': 4, - 'POINT_CONVERSION_HYBRID': 6 -} - - -/***/ }), - -/***/ "./node_modules/debug/src/browser.js": -/*!*******************************************!*\ - !*** ./node_modules/debug/src/browser.js ***! - \*******************************************/ -/***/ ((module, exports, __webpack_require__) => { - -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -/* eslint-env browser */ - -/** - * This is the web browser implementation of `debug()`. - */ - -exports.formatArgs = formatArgs; -exports.save = save; -exports.load = load; -exports.useColors = useColors; -exports.storage = localstorage(); -exports.destroy = (() => { - let warned = false; - - return () => { - if (!warned) { - warned = true; - console.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.'); - } - }; -})(); - -/** - * Colors. - */ - -exports.colors = [ - '#0000CC', - '#0000FF', - '#0033CC', - '#0033FF', - '#0066CC', - '#0066FF', - '#0099CC', - '#0099FF', - '#00CC00', - '#00CC33', - '#00CC66', - '#00CC99', - '#00CCCC', - '#00CCFF', - '#3300CC', - '#3300FF', - '#3333CC', - '#3333FF', - '#3366CC', - '#3366FF', - '#3399CC', - '#3399FF', - '#33CC00', - '#33CC33', - '#33CC66', - '#33CC99', - '#33CCCC', - '#33CCFF', - '#6600CC', - '#6600FF', - '#6633CC', - '#6633FF', - '#66CC00', - '#66CC33', - '#9900CC', - '#9900FF', - '#9933CC', - '#9933FF', - '#99CC00', - '#99CC33', - '#CC0000', - '#CC0033', - '#CC0066', - '#CC0099', - '#CC00CC', - '#CC00FF', - '#CC3300', - '#CC3333', - '#CC3366', - '#CC3399', - '#CC33CC', - '#CC33FF', - '#CC6600', - '#CC6633', - '#CC9900', - '#CC9933', - '#CCCC00', - '#CCCC33', - '#FF0000', - '#FF0033', - '#FF0066', - '#FF0099', - '#FF00CC', - '#FF00FF', - '#FF3300', - '#FF3333', - '#FF3366', - '#FF3399', - '#FF33CC', - '#FF33FF', - '#FF6600', - '#FF6633', - '#FF9900', - '#FF9933', - '#FFCC00', - '#FFCC33' -]; - -/** - * Currently only WebKit-based Web Inspectors, Firefox >= v31, - * and the Firebug extension (any Firefox version) are known - * to support "%c" CSS customizations. - * - * TODO: add a `localStorage` variable to explicitly enable/disable colors - */ - -// eslint-disable-next-line complexity -function useColors() { - // NB: In an Electron preload script, document will be defined but not fully - // initialized. Since we know we're in Chrome, we'll just detect this case - // explicitly - if (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) { - return true; - } - - // Internet Explorer and Edge do not support colors. - if (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/)) { - return false; - } - - // Is webkit? http://stackoverflow.com/a/16459606/376773 - // document is undefined in react-native: https://github.com/facebook/react-native/pull/1632 - return (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) || - // Is firebug? http://stackoverflow.com/a/398120/376773 - (typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) || - // Is firefox >= v31? - // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages - (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/) && parseInt(RegExp.$1, 10) >= 31) || - // Double check webkit in userAgent just in case we are in a worker - (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/)); -} - -/** - * Colorize log arguments if enabled. - * - * @api public - */ - -function formatArgs(args) { - args[0] = (this.useColors ? '%c' : '') + - this.namespace + - (this.useColors ? ' %c' : ' ') + - args[0] + - (this.useColors ? '%c ' : ' ') + - '+' + module.exports.humanize(this.diff); - - if (!this.useColors) { - return; - } - - const c = 'color: ' + this.color; - args.splice(1, 0, c, 'color: inherit'); - - // The final "%c" is somewhat tricky, because there could be other - // arguments passed either before or after the %c, so we need to - // figure out the correct index to insert the CSS into - let index = 0; - let lastC = 0; - args[0].replace(/%[a-zA-Z%]/g, match => { - if (match === '%%') { - return; - } - index++; - if (match === '%c') { - // We only are interested in the *last* %c - // (the user may have provided their own) - lastC = index; - } - }); - - args.splice(lastC, 0, c); -} - -/** - * Invokes `console.debug()` when available. - * No-op when `console.debug` is not a "function". - * If `console.debug` is not available, falls back - * to `console.log`. - * - * @api public - */ -exports.log = console.debug || console.log || (() => {}); - -/** - * Save `namespaces`. - * - * @param {String} namespaces - * @api private - */ -function save(namespaces) { - try { - if (namespaces) { - exports.storage.setItem('debug', namespaces); - } else { - exports.storage.removeItem('debug'); - } - } catch (error) { - // Swallow - // XXX (@Qix-) should we be logging these? - } -} - -/** - * Load `namespaces`. - * - * @return {String} returns the previously persisted debug modes - * @api private - */ -function load() { - let r; - try { - r = exports.storage.getItem('debug'); - } catch (error) { - // Swallow - // XXX (@Qix-) should we be logging these? - } - - // If debug isn't set in LS, and we're in Electron, try to load $DEBUG - if (!r && typeof process !== 'undefined' && 'env' in process) { - r = process.env.DEBUG; - } - - return r; -} - -/** - * Localstorage attempts to return the localstorage. - * - * This is necessary because safari throws - * when a user disables cookies/localstorage - * and you attempt to access it. - * - * @return {LocalStorage} - * @api private - */ - -function localstorage() { - try { - // TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context - // The Browser also has localStorage in the global context. - return localStorage; - } catch (error) { - // Swallow - // XXX (@Qix-) should we be logging these? - } -} - -module.exports = __webpack_require__(/*! ./common */ "./node_modules/debug/src/common.js")(exports); - -const {formatters} = module.exports; - -/** - * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default. - */ - -formatters.j = function (v) { - try { - return JSON.stringify(v); - } catch (error) { - return '[UnexpectedJSONParseError]: ' + error.message; - } -}; - - -/***/ }), - -/***/ "./node_modules/debug/src/common.js": -/*!******************************************!*\ - !*** ./node_modules/debug/src/common.js ***! - \******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); - -/** - * This is the common logic for both the Node.js and web browser - * implementations of `debug()`. - */ - -function setup(env) { - createDebug.debug = createDebug; - createDebug.default = createDebug; - createDebug.coerce = coerce; - createDebug.disable = disable; - createDebug.enable = enable; - createDebug.enabled = enabled; - createDebug.humanize = __webpack_require__(/*! ms */ "./node_modules/ms/index.js"); - createDebug.destroy = destroy; - - Object.keys(env).forEach(key => { - createDebug[key] = env[key]; - }); - - /** - * The currently active debug mode names, and names to skip. - */ - - createDebug.names = []; - createDebug.skips = []; - - /** - * Map of special "%n" handling functions, for the debug "format" argument. - * - * Valid key names are a single, lower or upper-case letter, i.e. "n" and "N". - */ - createDebug.formatters = {}; - - /** - * Selects a color for a debug namespace - * @param {String} namespace The namespace string for the for the debug instance to be colored - * @return {Number|String} An ANSI color code for the given namespace - * @api private - */ - function selectColor(namespace) { - let hash = 0; - - for (let i = 0; i < namespace.length; i++) { - hash = ((hash << 5) - hash) + namespace.charCodeAt(i); - hash |= 0; // Convert to 32bit integer - } - - return createDebug.colors[Math.abs(hash) % createDebug.colors.length]; - } - createDebug.selectColor = selectColor; - - /** - * Create a debugger with the given `namespace`. - * - * @param {String} namespace - * @return {Function} - * @api public - */ - function createDebug(namespace) { - let prevTime; - let enableOverride = null; - let namespacesCache; - let enabledCache; - - function debug(...args) { - // Disabled? - if (!debug.enabled) { - return; - } - - const self = debug; - - // Set `diff` timestamp - const curr = Number(new Date()); - const ms = curr - (prevTime || curr); - self.diff = ms; - self.prev = prevTime; - self.curr = curr; - prevTime = curr; - - args[0] = createDebug.coerce(args[0]); - - if (typeof args[0] !== 'string') { - // Anything else let's inspect with %O - args.unshift('%O'); - } - - // Apply any `formatters` transformations - let index = 0; - args[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => { - // If we encounter an escaped % then don't increase the array index - if (match === '%%') { - return '%'; - } - index++; - const formatter = createDebug.formatters[format]; - if (typeof formatter === 'function') { - const val = args[index]; - match = formatter.call(self, val); - - // Now we need to remove `args[index]` since it's inlined in the `format` - args.splice(index, 1); - index--; - } - return match; - }); - - // Apply env-specific formatting (colors, etc.) - createDebug.formatArgs.call(self, args); - - const logFn = self.log || createDebug.log; - logFn.apply(self, args); - } - - debug.namespace = namespace; - debug.useColors = createDebug.useColors(); - debug.color = createDebug.selectColor(namespace); - debug.extend = extend; - debug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release. - - Object.defineProperty(debug, 'enabled', { - enumerable: true, - configurable: false, - get: () => { - if (enableOverride !== null) { - return enableOverride; - } - if (namespacesCache !== createDebug.namespaces) { - namespacesCache = createDebug.namespaces; - enabledCache = createDebug.enabled(namespace); - } - - return enabledCache; - }, - set: v => { - enableOverride = v; - } - }); - - // Env-specific initialization logic for debug instances - if (typeof createDebug.init === 'function') { - createDebug.init(debug); - } - - return debug; - } - - function extend(namespace, delimiter) { - const newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace); - newDebug.log = this.log; - return newDebug; - } - - /** - * Enables a debug mode by namespaces. This can include modes - * separated by a colon and wildcards. - * - * @param {String} namespaces - * @api public - */ - function enable(namespaces) { - createDebug.save(namespaces); - createDebug.namespaces = namespaces; - - createDebug.names = []; - createDebug.skips = []; - - let i; - const split = (typeof namespaces === 'string' ? namespaces : '').split(/[\s,]+/); - const len = split.length; - - for (i = 0; i < len; i++) { - if (!split[i]) { - // ignore empty strings - continue; - } - - namespaces = split[i].replace(/\*/g, '.*?'); - - if (namespaces[0] === '-') { - createDebug.skips.push(new RegExp('^' + namespaces.substr(1) + '$')); - } else { - createDebug.names.push(new RegExp('^' + namespaces + '$')); - } - } - } - - /** - * Disable debug output. - * - * @return {String} namespaces - * @api public - */ - function disable() { - const namespaces = [ - ...createDebug.names.map(toNamespace), - ...createDebug.skips.map(toNamespace).map(namespace => '-' + namespace) - ].join(','); - createDebug.enable(''); - return namespaces; - } - - /** - * Returns true if the given mode name is enabled, false otherwise. - * - * @param {String} name - * @return {Boolean} - * @api public - */ - function enabled(name) { - if (name[name.length - 1] === '*') { - return true; - } - - let i; - let len; - - for (i = 0, len = createDebug.skips.length; i < len; i++) { - if (createDebug.skips[i].test(name)) { - return false; - } - } - - for (i = 0, len = createDebug.names.length; i < len; i++) { - if (createDebug.names[i].test(name)) { - return true; - } - } - - return false; - } - - /** - * Convert regexp to namespace - * - * @param {RegExp} regxep - * @return {String} namespace - * @api private - */ - function toNamespace(regexp) { - return regexp.toString() - .substring(2, regexp.toString().length - 2) - .replace(/\.\*\?$/, '*'); - } - - /** - * Coerce `val`. - * - * @param {Mixed} val - * @return {Mixed} - * @api private - */ - function coerce(val) { - if (val instanceof Error) { - return val.stack || val.message; - } - return val; - } - - /** - * XXX DO NOT USE. This is a temporary stub function. - * XXX It WILL be removed in the next major release. - */ - function destroy() { - console.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.'); - } - - createDebug.enable(createDebug.load()); - - return createDebug; -} - -module.exports = setup; - - -/***/ }), - -/***/ "./node_modules/define-properties/index.js": -/*!*************************************************!*\ - !*** ./node_modules/define-properties/index.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var keys = __webpack_require__(/*! object-keys */ "./node_modules/object-keys/index.js"); -var hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol'; - -var toStr = Object.prototype.toString; -var concat = Array.prototype.concat; -var origDefineProperty = Object.defineProperty; - -var isFunction = function (fn) { - return typeof fn === 'function' && toStr.call(fn) === '[object Function]'; -}; - -var arePropertyDescriptorsSupported = function () { - var obj = {}; - try { - origDefineProperty(obj, 'x', { enumerable: false, value: obj }); - // eslint-disable-next-line no-unused-vars, no-restricted-syntax - for (var _ in obj) { // jscs:ignore disallowUnusedVariables - return false; - } - return obj.x === obj; - } catch (e) { /* this is IE 8. */ - return false; - } -}; -var supportsDescriptors = origDefineProperty && arePropertyDescriptorsSupported(); - -var defineProperty = function (object, name, value, predicate) { - if (name in object && (!isFunction(predicate) || !predicate())) { - return; - } - if (supportsDescriptors) { - origDefineProperty(object, name, { - configurable: true, - enumerable: false, - value: value, - writable: true - }); - } else { - object[name] = value; - } -}; - -var defineProperties = function (object, map) { - var predicates = arguments.length > 2 ? arguments[2] : {}; - var props = keys(map); - if (hasSymbols) { - props = concat.call(props, Object.getOwnPropertySymbols(map)); - } - for (var i = 0; i < props.length; i += 1) { - defineProperty(object, props[i], map[props[i]], predicates[props[i]]); - } -}; - -defineProperties.supportsDescriptors = !!supportsDescriptors; - -module.exports = defineProperties; - - -/***/ }), - -/***/ "./node_modules/des.js/lib/des.js": -/*!****************************************!*\ - !*** ./node_modules/des.js/lib/des.js ***! - \****************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -exports.utils = __webpack_require__(/*! ./des/utils */ "./node_modules/des.js/lib/des/utils.js"); -exports.Cipher = __webpack_require__(/*! ./des/cipher */ "./node_modules/des.js/lib/des/cipher.js"); -exports.DES = __webpack_require__(/*! ./des/des */ "./node_modules/des.js/lib/des/des.js"); -exports.CBC = __webpack_require__(/*! ./des/cbc */ "./node_modules/des.js/lib/des/cbc.js"); -exports.EDE = __webpack_require__(/*! ./des/ede */ "./node_modules/des.js/lib/des/ede.js"); - - -/***/ }), - -/***/ "./node_modules/des.js/lib/des/cbc.js": -/*!********************************************!*\ - !*** ./node_modules/des.js/lib/des/cbc.js ***! - \********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -var proto = {}; - -function CBCState(iv) { - assert.equal(iv.length, 8, 'Invalid IV length'); - - this.iv = new Array(8); - for (var i = 0; i < this.iv.length; i++) - this.iv[i] = iv[i]; -} - -function instantiate(Base) { - function CBC(options) { - Base.call(this, options); - this._cbcInit(); - } - inherits(CBC, Base); - - var keys = Object.keys(proto); - for (var i = 0; i < keys.length; i++) { - var key = keys[i]; - CBC.prototype[key] = proto[key]; - } - - CBC.create = function create(options) { - return new CBC(options); - }; - - return CBC; -} - -exports.instantiate = instantiate; - -proto._cbcInit = function _cbcInit() { - var state = new CBCState(this.options.iv); - this._cbcState = state; -}; - -proto._update = function _update(inp, inOff, out, outOff) { - var state = this._cbcState; - var superProto = this.constructor.super_.prototype; - - var iv = state.iv; - if (this.type === 'encrypt') { - for (var i = 0; i < this.blockSize; i++) - iv[i] ^= inp[inOff + i]; - - superProto._update.call(this, iv, 0, out, outOff); - - for (var i = 0; i < this.blockSize; i++) - iv[i] = out[outOff + i]; - } else { - superProto._update.call(this, inp, inOff, out, outOff); - - for (var i = 0; i < this.blockSize; i++) - out[outOff + i] ^= iv[i]; - - for (var i = 0; i < this.blockSize; i++) - iv[i] = inp[inOff + i]; - } -}; - - -/***/ }), - -/***/ "./node_modules/des.js/lib/des/cipher.js": -/*!***********************************************!*\ - !*** ./node_modules/des.js/lib/des/cipher.js ***! - \***********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); - -function Cipher(options) { - this.options = options; - - this.type = this.options.type; - this.blockSize = 8; - this._init(); - - this.buffer = new Array(this.blockSize); - this.bufferOff = 0; -} -module.exports = Cipher; - -Cipher.prototype._init = function _init() { - // Might be overrided -}; - -Cipher.prototype.update = function update(data) { - if (data.length === 0) - return []; - - if (this.type === 'decrypt') - return this._updateDecrypt(data); - else - return this._updateEncrypt(data); -}; - -Cipher.prototype._buffer = function _buffer(data, off) { - // Append data to buffer - var min = Math.min(this.buffer.length - this.bufferOff, data.length - off); - for (var i = 0; i < min; i++) - this.buffer[this.bufferOff + i] = data[off + i]; - this.bufferOff += min; - - // Shift next - return min; -}; - -Cipher.prototype._flushBuffer = function _flushBuffer(out, off) { - this._update(this.buffer, 0, out, off); - this.bufferOff = 0; - return this.blockSize; -}; - -Cipher.prototype._updateEncrypt = function _updateEncrypt(data) { - var inputOff = 0; - var outputOff = 0; - - var count = ((this.bufferOff + data.length) / this.blockSize) | 0; - var out = new Array(count * this.blockSize); - - if (this.bufferOff !== 0) { - inputOff += this._buffer(data, inputOff); - - if (this.bufferOff === this.buffer.length) - outputOff += this._flushBuffer(out, outputOff); - } - - // Write blocks - var max = data.length - ((data.length - inputOff) % this.blockSize); - for (; inputOff < max; inputOff += this.blockSize) { - this._update(data, inputOff, out, outputOff); - outputOff += this.blockSize; - } - - // Queue rest - for (; inputOff < data.length; inputOff++, this.bufferOff++) - this.buffer[this.bufferOff] = data[inputOff]; - - return out; -}; - -Cipher.prototype._updateDecrypt = function _updateDecrypt(data) { - var inputOff = 0; - var outputOff = 0; - - var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1; - var out = new Array(count * this.blockSize); - - // TODO(indutny): optimize it, this is far from optimal - for (; count > 0; count--) { - inputOff += this._buffer(data, inputOff); - outputOff += this._flushBuffer(out, outputOff); - } - - // Buffer rest of the input - inputOff += this._buffer(data, inputOff); - - return out; -}; - -Cipher.prototype.final = function final(buffer) { - var first; - if (buffer) - first = this.update(buffer); - - var last; - if (this.type === 'encrypt') - last = this._finalEncrypt(); - else - last = this._finalDecrypt(); - - if (first) - return first.concat(last); - else - return last; -}; - -Cipher.prototype._pad = function _pad(buffer, off) { - if (off === 0) - return false; - - while (off < buffer.length) - buffer[off++] = 0; - - return true; -}; - -Cipher.prototype._finalEncrypt = function _finalEncrypt() { - if (!this._pad(this.buffer, this.bufferOff)) - return []; - - var out = new Array(this.blockSize); - this._update(this.buffer, 0, out, 0); - return out; -}; - -Cipher.prototype._unpad = function _unpad(buffer) { - return buffer; -}; - -Cipher.prototype._finalDecrypt = function _finalDecrypt() { - assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt'); - var out = new Array(this.blockSize); - this._flushBuffer(out, 0); - - return this._unpad(out); -}; - - -/***/ }), - -/***/ "./node_modules/des.js/lib/des/des.js": -/*!********************************************!*\ - !*** ./node_modules/des.js/lib/des/des.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -var utils = __webpack_require__(/*! ./utils */ "./node_modules/des.js/lib/des/utils.js"); -var Cipher = __webpack_require__(/*! ./cipher */ "./node_modules/des.js/lib/des/cipher.js"); - -function DESState() { - this.tmp = new Array(2); - this.keys = null; -} - -function DES(options) { - Cipher.call(this, options); - - var state = new DESState(); - this._desState = state; - - this.deriveKeys(state, options.key); -} -inherits(DES, Cipher); -module.exports = DES; - -DES.create = function create(options) { - return new DES(options); -}; - -var shiftTable = [ - 1, 1, 2, 2, 2, 2, 2, 2, - 1, 2, 2, 2, 2, 2, 2, 1 -]; - -DES.prototype.deriveKeys = function deriveKeys(state, key) { - state.keys = new Array(16 * 2); - - assert.equal(key.length, this.blockSize, 'Invalid key length'); - - var kL = utils.readUInt32BE(key, 0); - var kR = utils.readUInt32BE(key, 4); - - utils.pc1(kL, kR, state.tmp, 0); - kL = state.tmp[0]; - kR = state.tmp[1]; - for (var i = 0; i < state.keys.length; i += 2) { - var shift = shiftTable[i >>> 1]; - kL = utils.r28shl(kL, shift); - kR = utils.r28shl(kR, shift); - utils.pc2(kL, kR, state.keys, i); - } -}; - -DES.prototype._update = function _update(inp, inOff, out, outOff) { - var state = this._desState; - - var l = utils.readUInt32BE(inp, inOff); - var r = utils.readUInt32BE(inp, inOff + 4); - - // Initial Permutation - utils.ip(l, r, state.tmp, 0); - l = state.tmp[0]; - r = state.tmp[1]; - - if (this.type === 'encrypt') - this._encrypt(state, l, r, state.tmp, 0); - else - this._decrypt(state, l, r, state.tmp, 0); - - l = state.tmp[0]; - r = state.tmp[1]; - - utils.writeUInt32BE(out, l, outOff); - utils.writeUInt32BE(out, r, outOff + 4); -}; - -DES.prototype._pad = function _pad(buffer, off) { - var value = buffer.length - off; - for (var i = off; i < buffer.length; i++) - buffer[i] = value; - - return true; -}; - -DES.prototype._unpad = function _unpad(buffer) { - var pad = buffer[buffer.length - 1]; - for (var i = buffer.length - pad; i < buffer.length; i++) - assert.equal(buffer[i], pad); - - return buffer.slice(0, buffer.length - pad); -}; - -DES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) { - var l = lStart; - var r = rStart; - - // Apply f() x16 times - for (var i = 0; i < state.keys.length; i += 2) { - var keyL = state.keys[i]; - var keyR = state.keys[i + 1]; - - // f(r, k) - utils.expand(r, state.tmp, 0); - - keyL ^= state.tmp[0]; - keyR ^= state.tmp[1]; - var s = utils.substitute(keyL, keyR); - var f = utils.permute(s); - - var t = r; - r = (l ^ f) >>> 0; - l = t; - } - - // Reverse Initial Permutation - utils.rip(r, l, out, off); -}; - -DES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) { - var l = rStart; - var r = lStart; - - // Apply f() x16 times - for (var i = state.keys.length - 2; i >= 0; i -= 2) { - var keyL = state.keys[i]; - var keyR = state.keys[i + 1]; - - // f(r, k) - utils.expand(l, state.tmp, 0); - - keyL ^= state.tmp[0]; - keyR ^= state.tmp[1]; - var s = utils.substitute(keyL, keyR); - var f = utils.permute(s); - - var t = l; - l = (r ^ f) >>> 0; - r = t; - } - - // Reverse Initial Permutation - utils.rip(l, r, out, off); -}; - - -/***/ }), - -/***/ "./node_modules/des.js/lib/des/ede.js": -/*!********************************************!*\ - !*** ./node_modules/des.js/lib/des/ede.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -var Cipher = __webpack_require__(/*! ./cipher */ "./node_modules/des.js/lib/des/cipher.js"); -var DES = __webpack_require__(/*! ./des */ "./node_modules/des.js/lib/des/des.js"); - -function EDEState(type, key) { - assert.equal(key.length, 24, 'Invalid key length'); - - var k1 = key.slice(0, 8); - var k2 = key.slice(8, 16); - var k3 = key.slice(16, 24); - - if (type === 'encrypt') { - this.ciphers = [ - DES.create({ type: 'encrypt', key: k1 }), - DES.create({ type: 'decrypt', key: k2 }), - DES.create({ type: 'encrypt', key: k3 }) - ]; - } else { - this.ciphers = [ - DES.create({ type: 'decrypt', key: k3 }), - DES.create({ type: 'encrypt', key: k2 }), - DES.create({ type: 'decrypt', key: k1 }) - ]; - } -} - -function EDE(options) { - Cipher.call(this, options); - - var state = new EDEState(this.type, this.options.key); - this._edeState = state; -} -inherits(EDE, Cipher); - -module.exports = EDE; - -EDE.create = function create(options) { - return new EDE(options); -}; - -EDE.prototype._update = function _update(inp, inOff, out, outOff) { - var state = this._edeState; - - state.ciphers[0]._update(inp, inOff, out, outOff); - state.ciphers[1]._update(out, outOff, out, outOff); - state.ciphers[2]._update(out, outOff, out, outOff); -}; - -EDE.prototype._pad = DES.prototype._pad; -EDE.prototype._unpad = DES.prototype._unpad; - - -/***/ }), - -/***/ "./node_modules/des.js/lib/des/utils.js": -/*!**********************************************!*\ - !*** ./node_modules/des.js/lib/des/utils.js ***! - \**********************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - -exports.readUInt32BE = function readUInt32BE(bytes, off) { - var res = (bytes[0 + off] << 24) | - (bytes[1 + off] << 16) | - (bytes[2 + off] << 8) | - bytes[3 + off]; - return res >>> 0; -}; - -exports.writeUInt32BE = function writeUInt32BE(bytes, value, off) { - bytes[0 + off] = value >>> 24; - bytes[1 + off] = (value >>> 16) & 0xff; - bytes[2 + off] = (value >>> 8) & 0xff; - bytes[3 + off] = value & 0xff; -}; - -exports.ip = function ip(inL, inR, out, off) { - var outL = 0; - var outR = 0; - - for (var i = 6; i >= 0; i -= 2) { - for (var j = 0; j <= 24; j += 8) { - outL <<= 1; - outL |= (inR >>> (j + i)) & 1; - } - for (var j = 0; j <= 24; j += 8) { - outL <<= 1; - outL |= (inL >>> (j + i)) & 1; - } - } - - for (var i = 6; i >= 0; i -= 2) { - for (var j = 1; j <= 25; j += 8) { - outR <<= 1; - outR |= (inR >>> (j + i)) & 1; - } - for (var j = 1; j <= 25; j += 8) { - outR <<= 1; - outR |= (inL >>> (j + i)) & 1; - } - } - - out[off + 0] = outL >>> 0; - out[off + 1] = outR >>> 0; -}; - -exports.rip = function rip(inL, inR, out, off) { - var outL = 0; - var outR = 0; - - for (var i = 0; i < 4; i++) { - for (var j = 24; j >= 0; j -= 8) { - outL <<= 1; - outL |= (inR >>> (j + i)) & 1; - outL <<= 1; - outL |= (inL >>> (j + i)) & 1; - } - } - for (var i = 4; i < 8; i++) { - for (var j = 24; j >= 0; j -= 8) { - outR <<= 1; - outR |= (inR >>> (j + i)) & 1; - outR <<= 1; - outR |= (inL >>> (j + i)) & 1; - } - } - - out[off + 0] = outL >>> 0; - out[off + 1] = outR >>> 0; -}; - -exports.pc1 = function pc1(inL, inR, out, off) { - var outL = 0; - var outR = 0; - - // 7, 15, 23, 31, 39, 47, 55, 63 - // 6, 14, 22, 30, 39, 47, 55, 63 - // 5, 13, 21, 29, 39, 47, 55, 63 - // 4, 12, 20, 28 - for (var i = 7; i >= 5; i--) { - for (var j = 0; j <= 24; j += 8) { - outL <<= 1; - outL |= (inR >> (j + i)) & 1; - } - for (var j = 0; j <= 24; j += 8) { - outL <<= 1; - outL |= (inL >> (j + i)) & 1; - } - } - for (var j = 0; j <= 24; j += 8) { - outL <<= 1; - outL |= (inR >> (j + i)) & 1; - } - - // 1, 9, 17, 25, 33, 41, 49, 57 - // 2, 10, 18, 26, 34, 42, 50, 58 - // 3, 11, 19, 27, 35, 43, 51, 59 - // 36, 44, 52, 60 - for (var i = 1; i <= 3; i++) { - for (var j = 0; j <= 24; j += 8) { - outR <<= 1; - outR |= (inR >> (j + i)) & 1; - } - for (var j = 0; j <= 24; j += 8) { - outR <<= 1; - outR |= (inL >> (j + i)) & 1; - } - } - for (var j = 0; j <= 24; j += 8) { - outR <<= 1; - outR |= (inL >> (j + i)) & 1; - } - - out[off + 0] = outL >>> 0; - out[off + 1] = outR >>> 0; -}; - -exports.r28shl = function r28shl(num, shift) { - return ((num << shift) & 0xfffffff) | (num >>> (28 - shift)); -}; - -var pc2table = [ - // inL => outL - 14, 11, 17, 4, 27, 23, 25, 0, - 13, 22, 7, 18, 5, 9, 16, 24, - 2, 20, 12, 21, 1, 8, 15, 26, - - // inR => outR - 15, 4, 25, 19, 9, 1, 26, 16, - 5, 11, 23, 8, 12, 7, 17, 0, - 22, 3, 10, 14, 6, 20, 27, 24 -]; - -exports.pc2 = function pc2(inL, inR, out, off) { - var outL = 0; - var outR = 0; - - var len = pc2table.length >>> 1; - for (var i = 0; i < len; i++) { - outL <<= 1; - outL |= (inL >>> pc2table[i]) & 0x1; - } - for (var i = len; i < pc2table.length; i++) { - outR <<= 1; - outR |= (inR >>> pc2table[i]) & 0x1; - } - - out[off + 0] = outL >>> 0; - out[off + 1] = outR >>> 0; -}; - -exports.expand = function expand(r, out, off) { - var outL = 0; - var outR = 0; - - outL = ((r & 1) << 5) | (r >>> 27); - for (var i = 23; i >= 15; i -= 4) { - outL <<= 6; - outL |= (r >>> i) & 0x3f; - } - for (var i = 11; i >= 3; i -= 4) { - outR |= (r >>> i) & 0x3f; - outR <<= 6; - } - outR |= ((r & 0x1f) << 1) | (r >>> 31); - - out[off + 0] = outL >>> 0; - out[off + 1] = outR >>> 0; -}; - -var sTable = [ - 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1, - 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8, - 4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7, - 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13, - - 15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14, - 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5, - 0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2, - 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9, - - 10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10, - 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1, - 13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7, - 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12, - - 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3, - 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9, - 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8, - 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14, - - 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1, - 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6, - 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13, - 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3, - - 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5, - 0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8, - 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10, - 7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13, - - 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10, - 3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6, - 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7, - 10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12, - - 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4, - 10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2, - 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13, - 0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11 -]; - -exports.substitute = function substitute(inL, inR) { - var out = 0; - for (var i = 0; i < 4; i++) { - var b = (inL >>> (18 - i * 6)) & 0x3f; - var sb = sTable[i * 0x40 + b]; - - out <<= 4; - out |= sb; - } - for (var i = 0; i < 4; i++) { - var b = (inR >>> (18 - i * 6)) & 0x3f; - var sb = sTable[4 * 0x40 + i * 0x40 + b]; - - out <<= 4; - out |= sb; - } - return out >>> 0; -}; - -var permuteTable = [ - 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22, - 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7 -]; - -exports.permute = function permute(num) { - var out = 0; - for (var i = 0; i < permuteTable.length; i++) { - out <<= 1; - out |= (num >>> permuteTable[i]) & 0x1; - } - return out >>> 0; -}; - -exports.padSplit = function padSplit(num, size, group) { - var str = num.toString(2); - while (str.length < size) - str = '0' + str; - - var out = []; - for (var i = 0; i < size; i += group) - out.push(str.slice(i, i + group)); - return out.join(' '); -}; - - -/***/ }), - -/***/ "./node_modules/diffie-hellman/browser.js": -/*!************************************************!*\ - !*** ./node_modules/diffie-hellman/browser.js ***! - \************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var generatePrime = __webpack_require__(/*! ./lib/generatePrime */ "./node_modules/diffie-hellman/lib/generatePrime.js") -var primes = __webpack_require__(/*! ./lib/primes.json */ "./node_modules/diffie-hellman/lib/primes.json") - -var DH = __webpack_require__(/*! ./lib/dh */ "./node_modules/diffie-hellman/lib/dh.js") - -function getDiffieHellman (mod) { - var prime = new Buffer(primes[mod].prime, 'hex') - var gen = new Buffer(primes[mod].gen, 'hex') - - return new DH(prime, gen) -} - -var ENCODINGS = { - 'binary': true, 'hex': true, 'base64': true -} - -function createDiffieHellman (prime, enc, generator, genc) { - if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) { - return createDiffieHellman(prime, 'binary', enc, generator) - } - - enc = enc || 'binary' - genc = genc || 'binary' - generator = generator || new Buffer([2]) - - if (!Buffer.isBuffer(generator)) { - generator = new Buffer(generator, genc) - } - - if (typeof prime === 'number') { - return new DH(generatePrime(prime, generator), generator, true) - } - - if (!Buffer.isBuffer(prime)) { - prime = new Buffer(prime, enc) - } - - return new DH(prime, generator, true) -} - -exports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman -exports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman - - -/***/ }), - -/***/ "./node_modules/diffie-hellman/lib/dh.js": -/*!***********************************************!*\ - !*** ./node_modules/diffie-hellman/lib/dh.js ***! - \***********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var BN = __webpack_require__(/*! bn.js */ "./node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js"); -var MillerRabin = __webpack_require__(/*! miller-rabin */ "./node_modules/miller-rabin/lib/mr.js"); -var millerRabin = new MillerRabin(); -var TWENTYFOUR = new BN(24); -var ELEVEN = new BN(11); -var TEN = new BN(10); -var THREE = new BN(3); -var SEVEN = new BN(7); -var primes = __webpack_require__(/*! ./generatePrime */ "./node_modules/diffie-hellman/lib/generatePrime.js"); -var randomBytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js"); -module.exports = DH; - -function setPublicKey(pub, enc) { - enc = enc || 'utf8'; - if (!Buffer.isBuffer(pub)) { - pub = new Buffer(pub, enc); - } - this._pub = new BN(pub); - return this; -} - -function setPrivateKey(priv, enc) { - enc = enc || 'utf8'; - if (!Buffer.isBuffer(priv)) { - priv = new Buffer(priv, enc); - } - this._priv = new BN(priv); - return this; -} - -var primeCache = {}; -function checkPrime(prime, generator) { - var gen = generator.toString('hex'); - var hex = [gen, prime.toString(16)].join('_'); - if (hex in primeCache) { - return primeCache[hex]; - } - var error = 0; - - if (prime.isEven() || - !primes.simpleSieve || - !primes.fermatTest(prime) || - !millerRabin.test(prime)) { - //not a prime so +1 - error += 1; - - if (gen === '02' || gen === '05') { - // we'd be able to check the generator - // it would fail so +8 - error += 8; - } else { - //we wouldn't be able to test the generator - // so +4 - error += 4; - } - primeCache[hex] = error; - return error; - } - if (!millerRabin.test(prime.shrn(1))) { - //not a safe prime - error += 2; - } - var rem; - switch (gen) { - case '02': - if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) { - // unsuidable generator - error += 8; - } - break; - case '05': - rem = prime.mod(TEN); - if (rem.cmp(THREE) && rem.cmp(SEVEN)) { - // prime mod 10 needs to equal 3 or 7 - error += 8; - } - break; - default: - error += 4; - } - primeCache[hex] = error; - return error; -} - -function DH(prime, generator, malleable) { - this.setGenerator(generator); - this.__prime = new BN(prime); - this._prime = BN.mont(this.__prime); - this._primeLen = prime.length; - this._pub = undefined; - this._priv = undefined; - this._primeCode = undefined; - if (malleable) { - this.setPublicKey = setPublicKey; - this.setPrivateKey = setPrivateKey; - } else { - this._primeCode = 8; - } -} -Object.defineProperty(DH.prototype, 'verifyError', { - enumerable: true, - get: function () { - if (typeof this._primeCode !== 'number') { - this._primeCode = checkPrime(this.__prime, this.__gen); - } - return this._primeCode; - } -}); -DH.prototype.generateKeys = function () { - if (!this._priv) { - this._priv = new BN(randomBytes(this._primeLen)); - } - this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed(); - return this.getPublicKey(); -}; - -DH.prototype.computeSecret = function (other) { - other = new BN(other); - other = other.toRed(this._prime); - var secret = other.redPow(this._priv).fromRed(); - var out = new Buffer(secret.toArray()); - var prime = this.getPrime(); - if (out.length < prime.length) { - var front = new Buffer(prime.length - out.length); - front.fill(0); - out = Buffer.concat([front, out]); - } - return out; -}; - -DH.prototype.getPublicKey = function getPublicKey(enc) { - return formatReturnValue(this._pub, enc); -}; - -DH.prototype.getPrivateKey = function getPrivateKey(enc) { - return formatReturnValue(this._priv, enc); -}; - -DH.prototype.getPrime = function (enc) { - return formatReturnValue(this.__prime, enc); -}; - -DH.prototype.getGenerator = function (enc) { - return formatReturnValue(this._gen, enc); -}; - -DH.prototype.setGenerator = function (gen, enc) { - enc = enc || 'utf8'; - if (!Buffer.isBuffer(gen)) { - gen = new Buffer(gen, enc); - } - this.__gen = gen; - this._gen = new BN(gen); - return this; -}; - -function formatReturnValue(bn, enc) { - var buf = new Buffer(bn.toArray()); - if (!enc) { - return buf; - } else { - return buf.toString(enc); - } -} - - -/***/ }), - -/***/ "./node_modules/diffie-hellman/lib/generatePrime.js": -/*!**********************************************************!*\ - !*** ./node_modules/diffie-hellman/lib/generatePrime.js ***! - \**********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var randomBytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js"); -module.exports = findPrime; -findPrime.simpleSieve = simpleSieve; -findPrime.fermatTest = fermatTest; -var BN = __webpack_require__(/*! bn.js */ "./node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js"); -var TWENTYFOUR = new BN(24); -var MillerRabin = __webpack_require__(/*! miller-rabin */ "./node_modules/miller-rabin/lib/mr.js"); -var millerRabin = new MillerRabin(); -var ONE = new BN(1); -var TWO = new BN(2); -var FIVE = new BN(5); -var SIXTEEN = new BN(16); -var EIGHT = new BN(8); -var TEN = new BN(10); -var THREE = new BN(3); -var SEVEN = new BN(7); -var ELEVEN = new BN(11); -var FOUR = new BN(4); -var TWELVE = new BN(12); -var primes = null; - -function _getPrimes() { - if (primes !== null) - return primes; - - var limit = 0x100000; - var res = []; - res[0] = 2; - for (var i = 1, k = 3; k < limit; k += 2) { - var sqrt = Math.ceil(Math.sqrt(k)); - for (var j = 0; j < i && res[j] <= sqrt; j++) - if (k % res[j] === 0) - break; - - if (i !== j && res[j] <= sqrt) - continue; - - res[i++] = k; - } - primes = res; - return res; -} - -function simpleSieve(p) { - var primes = _getPrimes(); - - for (var i = 0; i < primes.length; i++) - if (p.modn(primes[i]) === 0) { - if (p.cmpn(primes[i]) === 0) { - return true; - } else { - return false; - } - } - - return true; -} - -function fermatTest(p) { - var red = BN.mont(p); - return TWO.toRed(red).redPow(p.subn(1)).fromRed().cmpn(1) === 0; -} - -function findPrime(bits, gen) { - if (bits < 16) { - // this is what openssl does - if (gen === 2 || gen === 5) { - return new BN([0x8c, 0x7b]); - } else { - return new BN([0x8c, 0x27]); - } - } - gen = new BN(gen); - - var num, n2; - - while (true) { - num = new BN(randomBytes(Math.ceil(bits / 8))); - while (num.bitLength() > bits) { - num.ishrn(1); - } - if (num.isEven()) { - num.iadd(ONE); - } - if (!num.testn(1)) { - num.iadd(TWO); - } - if (!gen.cmp(TWO)) { - while (num.mod(TWENTYFOUR).cmp(ELEVEN)) { - num.iadd(FOUR); - } - } else if (!gen.cmp(FIVE)) { - while (num.mod(TEN).cmp(THREE)) { - num.iadd(FOUR); - } - } - n2 = num.shrn(1); - if (simpleSieve(n2) && simpleSieve(num) && - fermatTest(n2) && fermatTest(num) && - millerRabin.test(n2) && millerRabin.test(num)) { - return num; - } - } - -} - - -/***/ }), - -/***/ "./node_modules/diffie-hellman/lib/primes.json": -/*!*****************************************************!*\ - !*** ./node_modules/diffie-hellman/lib/primes.json ***! - \*****************************************************/ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"modp1":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff"},"modp2":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff"},"modp5":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff"},"modp14":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff"},"modp15":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff"},"modp16":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff"},"modp17":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff"},"modp18":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff"}}'); - -/***/ }), - -/***/ "./node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js": -/*!******************************************************************!*\ - !*** ./node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js ***! - \******************************************************************/ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -(function (module, exports) { - 'use strict'; - - // Utils - function assert (val, msg) { - if (!val) throw new Error(msg || 'Assertion failed'); - } - - // Could use `inherits` module, but don't want to move from single file - // architecture yet. - function inherits (ctor, superCtor) { - ctor.super_ = superCtor; - var TempCtor = function () {}; - TempCtor.prototype = superCtor.prototype; - ctor.prototype = new TempCtor(); - ctor.prototype.constructor = ctor; - } - - // BN - - function BN (number, base, endian) { - if (BN.isBN(number)) { - return number; - } - - this.negative = 0; - this.words = null; - this.length = 0; - - // Reduction context - this.red = null; - - if (number !== null) { - if (base === 'le' || base === 'be') { - endian = base; - base = 10; - } - - this._init(number || 0, base || 10, endian || 'be'); - } - } - if (typeof module === 'object') { - module.exports = BN; - } else { - exports.BN = BN; - } - - BN.BN = BN; - BN.wordSize = 26; - - var Buffer; - try { - if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { - Buffer = window.Buffer; - } else { - Buffer = __webpack_require__(/*! buffer */ "?e7e4").Buffer; - } - } catch (e) { - } - - BN.isBN = function isBN (num) { - if (num instanceof BN) { - return true; - } - - return num !== null && typeof num === 'object' && - num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); - }; - - BN.max = function max (left, right) { - if (left.cmp(right) > 0) return left; - return right; - }; - - BN.min = function min (left, right) { - if (left.cmp(right) < 0) return left; - return right; - }; - - BN.prototype._init = function init (number, base, endian) { - if (typeof number === 'number') { - return this._initNumber(number, base, endian); - } - - if (typeof number === 'object') { - return this._initArray(number, base, endian); - } - - if (base === 'hex') { - base = 16; - } - assert(base === (base | 0) && base >= 2 && base <= 36); - - number = number.toString().replace(/\s+/g, ''); - var start = 0; - if (number[0] === '-') { - start++; - this.negative = 1; - } - - if (start < number.length) { - if (base === 16) { - this._parseHex(number, start, endian); - } else { - this._parseBase(number, base, start); - if (endian === 'le') { - this._initArray(this.toArray(), base, endian); - } - } - } - }; - - BN.prototype._initNumber = function _initNumber (number, base, endian) { - if (number < 0) { - this.negative = 1; - number = -number; - } - if (number < 0x4000000) { - this.words = [ number & 0x3ffffff ]; - this.length = 1; - } else if (number < 0x10000000000000) { - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff - ]; - this.length = 2; - } else { - assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff, - 1 - ]; - this.length = 3; - } - - if (endian !== 'le') return; - - // Reverse the bytes - this._initArray(this.toArray(), base, endian); - }; - - BN.prototype._initArray = function _initArray (number, base, endian) { - // Perhaps a Uint8Array - assert(typeof number.length === 'number'); - if (number.length <= 0) { - this.words = [ 0 ]; - this.length = 1; - return this; - } - - this.length = Math.ceil(number.length / 3); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - var j, w; - var off = 0; - if (endian === 'be') { - for (i = number.length - 1, j = 0; i >= 0; i -= 3) { - w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } else if (endian === 'le') { - for (i = 0, j = 0; i < number.length; i += 3) { - w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } - return this.strip(); - }; - - function parseHex4Bits (string, index) { - var c = string.charCodeAt(index); - // 'A' - 'F' - if (c >= 65 && c <= 70) { - return c - 55; - // 'a' - 'f' - } else if (c >= 97 && c <= 102) { - return c - 87; - // '0' - '9' - } else { - return (c - 48) & 0xf; - } - } - - function parseHexByte (string, lowerBound, index) { - var r = parseHex4Bits(string, index); - if (index - 1 >= lowerBound) { - r |= parseHex4Bits(string, index - 1) << 4; - } - return r; - } - - BN.prototype._parseHex = function _parseHex (number, start, endian) { - // Create possibly bigger array to ensure that it fits the number - this.length = Math.ceil((number.length - start) / 6); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - // 24-bits chunks - var off = 0; - var j = 0; - - var w; - if (endian === 'be') { - for (i = number.length - 1; i >= start; i -= 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } else { - var parseLength = number.length - start; - for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } - - this.strip(); - }; - - function parseBase (str, start, end, mul) { - var r = 0; - var len = Math.min(str.length, end); - for (var i = start; i < len; i++) { - var c = str.charCodeAt(i) - 48; - - r *= mul; - - // 'a' - if (c >= 49) { - r += c - 49 + 0xa; - - // 'A' - } else if (c >= 17) { - r += c - 17 + 0xa; - - // '0' - '9' - } else { - r += c; - } - } - return r; - } - - BN.prototype._parseBase = function _parseBase (number, base, start) { - // Initialize as zero - this.words = [ 0 ]; - this.length = 1; - - // Find length of limb in base - for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { - limbLen++; - } - limbLen--; - limbPow = (limbPow / base) | 0; - - var total = number.length - start; - var mod = total % limbLen; - var end = Math.min(total, total - mod) + start; - - var word = 0; - for (var i = start; i < end; i += limbLen) { - word = parseBase(number, i, i + limbLen, base); - - this.imuln(limbPow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - if (mod !== 0) { - var pow = 1; - word = parseBase(number, i, number.length, base); - - for (i = 0; i < mod; i++) { - pow *= base; - } - - this.imuln(pow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - this.strip(); - }; - - BN.prototype.copy = function copy (dest) { - dest.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - dest.words[i] = this.words[i]; - } - dest.length = this.length; - dest.negative = this.negative; - dest.red = this.red; - }; - - BN.prototype.clone = function clone () { - var r = new BN(null); - this.copy(r); - return r; - }; - - BN.prototype._expand = function _expand (size) { - while (this.length < size) { - this.words[this.length++] = 0; - } - return this; - }; - - // Remove leading `0` from `this` - BN.prototype.strip = function strip () { - while (this.length > 1 && this.words[this.length - 1] === 0) { - this.length--; - } - return this._normSign(); - }; - - BN.prototype._normSign = function _normSign () { - // -0 = 0 - if (this.length === 1 && this.words[0] === 0) { - this.negative = 0; - } - return this; - }; - - BN.prototype.inspect = function inspect () { - return (this.red ? ''; - }; - - /* - - var zeros = []; - var groupSizes = []; - var groupBases = []; - - var s = ''; - var i = -1; - while (++i < BN.wordSize) { - zeros[i] = s; - s += '0'; - } - groupSizes[0] = 0; - groupSizes[1] = 0; - groupBases[0] = 0; - groupBases[1] = 0; - var base = 2 - 1; - while (++base < 36 + 1) { - var groupSize = 0; - var groupBase = 1; - while (groupBase < (1 << BN.wordSize) / base) { - groupBase *= base; - groupSize += 1; - } - groupSizes[base] = groupSize; - groupBases[base] = groupBase; - } - - */ - - 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' - ]; - - 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 - ]; - - 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 - ]; - - BN.prototype.toString = function toString (base, padding) { - base = base || 10; - padding = padding | 0 || 1; - - var out; - if (base === 16 || base === 'hex') { - out = ''; - var off = 0; - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = this.words[i]; - var word = (((w << off) | carry) & 0xffffff).toString(16); - carry = (w >>> (24 - off)) & 0xffffff; - if (carry !== 0 || i !== this.length - 1) { - out = zeros[6 - word.length] + word + out; - } else { - out = word + out; - } - off += 2; - if (off >= 26) { - off -= 26; - i--; - } - } - if (carry !== 0) { - out = carry.toString(16) + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - if (base === (base | 0) && base >= 2 && base <= 36) { - // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); - var groupSize = groupSizes[base]; - // var groupBase = Math.pow(base, groupSize); - var groupBase = groupBases[base]; - out = ''; - var c = this.clone(); - c.negative = 0; - while (!c.isZero()) { - var r = c.modn(groupBase).toString(base); - c = c.idivn(groupBase); - - if (!c.isZero()) { - out = zeros[groupSize - r.length] + r + out; - } else { - out = r + out; - } - } - if (this.isZero()) { - out = '0' + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - assert(false, 'Base should be between 2 and 36'); - }; - - BN.prototype.toNumber = function toNumber () { - var ret = this.words[0]; - if (this.length === 2) { - ret += this.words[1] * 0x4000000; - } else if (this.length === 3 && this.words[2] === 0x01) { - // NOTE: at this stage it is known that the top bit is set - ret += 0x10000000000000 + (this.words[1] * 0x4000000); - } else if (this.length > 2) { - assert(false, 'Number can only safely store up to 53 bits'); - } - return (this.negative !== 0) ? -ret : ret; - }; - - BN.prototype.toJSON = function toJSON () { - return this.toString(16); - }; - - BN.prototype.toBuffer = function toBuffer (endian, length) { - assert(typeof Buffer !== 'undefined'); - return this.toArrayLike(Buffer, endian, length); - }; - - BN.prototype.toArray = function toArray (endian, length) { - return this.toArrayLike(Array, endian, length); - }; - - BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { - var byteLength = this.byteLength(); - var reqLength = length || Math.max(1, byteLength); - assert(byteLength <= reqLength, 'byte array longer than desired length'); - assert(reqLength > 0, 'Requested array length <= 0'); - - this.strip(); - var littleEndian = endian === 'le'; - var res = new ArrayType(reqLength); - - var b, i; - var q = this.clone(); - if (!littleEndian) { - // Assume big-endian - for (i = 0; i < reqLength - byteLength; i++) { - res[i] = 0; - } - - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[reqLength - i - 1] = b; - } - } else { - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[i] = b; - } - - for (; i < reqLength; i++) { - res[i] = 0; - } - } - - return res; - }; - - if (Math.clz32) { - BN.prototype._countBits = function _countBits (w) { - return 32 - Math.clz32(w); - }; - } else { - BN.prototype._countBits = function _countBits (w) { - var t = w; - var r = 0; - if (t >= 0x1000) { - r += 13; - t >>>= 13; - } - if (t >= 0x40) { - r += 7; - t >>>= 7; - } - if (t >= 0x8) { - r += 4; - t >>>= 4; - } - if (t >= 0x02) { - r += 2; - t >>>= 2; - } - return r + t; - }; - } - - BN.prototype._zeroBits = function _zeroBits (w) { - // Short-cut - if (w === 0) return 26; - - var t = w; - var r = 0; - if ((t & 0x1fff) === 0) { - r += 13; - t >>>= 13; - } - if ((t & 0x7f) === 0) { - r += 7; - t >>>= 7; - } - if ((t & 0xf) === 0) { - r += 4; - t >>>= 4; - } - if ((t & 0x3) === 0) { - r += 2; - t >>>= 2; - } - if ((t & 0x1) === 0) { - r++; - } - return r; - }; - - // Return number of used bits in a BN - BN.prototype.bitLength = function bitLength () { - var w = this.words[this.length - 1]; - var hi = this._countBits(w); - return (this.length - 1) * 26 + hi; - }; - - function toBitArray (num) { - var w = new Array(num.bitLength()); - - for (var bit = 0; bit < w.length; bit++) { - var off = (bit / 26) | 0; - var wbit = bit % 26; - - w[bit] = (num.words[off] & (1 << wbit)) >>> wbit; - } - - return w; - } - - // Number of trailing zero bits - BN.prototype.zeroBits = function zeroBits () { - if (this.isZero()) return 0; - - var r = 0; - for (var i = 0; i < this.length; i++) { - var b = this._zeroBits(this.words[i]); - r += b; - if (b !== 26) break; - } - return r; - }; - - BN.prototype.byteLength = function byteLength () { - return Math.ceil(this.bitLength() / 8); - }; - - BN.prototype.toTwos = function toTwos (width) { - if (this.negative !== 0) { - return this.abs().inotn(width).iaddn(1); - } - return this.clone(); - }; - - BN.prototype.fromTwos = function fromTwos (width) { - if (this.testn(width - 1)) { - return this.notn(width).iaddn(1).ineg(); - } - return this.clone(); - }; - - BN.prototype.isNeg = function isNeg () { - return this.negative !== 0; - }; - - // Return negative clone of `this` - BN.prototype.neg = function neg () { - return this.clone().ineg(); - }; - - BN.prototype.ineg = function ineg () { - if (!this.isZero()) { - this.negative ^= 1; - } - - return this; - }; - - // Or `num` with `this` in-place - BN.prototype.iuor = function iuor (num) { - while (this.length < num.length) { - this.words[this.length++] = 0; - } - - for (var i = 0; i < num.length; i++) { - this.words[i] = this.words[i] | num.words[i]; - } - - return this.strip(); - }; - - BN.prototype.ior = function ior (num) { - assert((this.negative | num.negative) === 0); - return this.iuor(num); - }; - - // Or `num` with `this` - BN.prototype.or = function or (num) { - if (this.length > num.length) return this.clone().ior(num); - return num.clone().ior(this); - }; - - BN.prototype.uor = function uor (num) { - if (this.length > num.length) return this.clone().iuor(num); - return num.clone().iuor(this); - }; - - // And `num` with `this` in-place - BN.prototype.iuand = function iuand (num) { - // b = min-length(num, this) - var b; - if (this.length > num.length) { - b = num; - } else { - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = this.words[i] & num.words[i]; - } - - this.length = b.length; - - return this.strip(); - }; - - BN.prototype.iand = function iand (num) { - assert((this.negative | num.negative) === 0); - return this.iuand(num); - }; - - // And `num` with `this` - BN.prototype.and = function and (num) { - if (this.length > num.length) return this.clone().iand(num); - return num.clone().iand(this); - }; - - BN.prototype.uand = function uand (num) { - if (this.length > num.length) return this.clone().iuand(num); - return num.clone().iuand(this); - }; - - // Xor `num` with `this` in-place - BN.prototype.iuxor = function iuxor (num) { - // a.length > b.length - var a; - var b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = a.words[i] ^ b.words[i]; - } - - if (this !== a) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = a.length; - - return this.strip(); - }; - - BN.prototype.ixor = function ixor (num) { - assert((this.negative | num.negative) === 0); - return this.iuxor(num); - }; - - // Xor `num` with `this` - BN.prototype.xor = function xor (num) { - if (this.length > num.length) return this.clone().ixor(num); - return num.clone().ixor(this); - }; - - BN.prototype.uxor = function uxor (num) { - if (this.length > num.length) return this.clone().iuxor(num); - return num.clone().iuxor(this); - }; - - // Not ``this`` with ``width`` bitwidth - BN.prototype.inotn = function inotn (width) { - assert(typeof width === 'number' && width >= 0); - - var bytesNeeded = Math.ceil(width / 26) | 0; - var bitsLeft = width % 26; - - // Extend the buffer with leading zeroes - this._expand(bytesNeeded); - - if (bitsLeft > 0) { - bytesNeeded--; - } - - // Handle complete words - for (var i = 0; i < bytesNeeded; i++) { - this.words[i] = ~this.words[i] & 0x3ffffff; - } - - // Handle the residue - if (bitsLeft > 0) { - this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); - } - - // And remove leading zeroes - return this.strip(); - }; - - BN.prototype.notn = function notn (width) { - return this.clone().inotn(width); - }; - - // Set `bit` of `this` - BN.prototype.setn = function setn (bit, val) { - assert(typeof bit === 'number' && bit >= 0); - - var off = (bit / 26) | 0; - var wbit = bit % 26; - - this._expand(off + 1); - - if (val) { - this.words[off] = this.words[off] | (1 << wbit); - } else { - this.words[off] = this.words[off] & ~(1 << wbit); - } - - return this.strip(); - }; - - // Add `num` to `this` in-place - BN.prototype.iadd = function iadd (num) { - var r; - - // negative + positive - if (this.negative !== 0 && num.negative === 0) { - this.negative = 0; - r = this.isub(num); - this.negative ^= 1; - return this._normSign(); - - // positive + negative - } else if (this.negative === 0 && num.negative !== 0) { - num.negative = 0; - r = this.isub(num); - num.negative = 1; - return r._normSign(); - } - - // a.length > b.length - var a, b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) + (b.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - - this.length = a.length; - if (carry !== 0) { - this.words[this.length] = carry; - this.length++; - // Copy the rest of the words - } else if (a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - return this; - }; - - // Add `num` to `this` - BN.prototype.add = function add (num) { - var res; - if (num.negative !== 0 && this.negative === 0) { - num.negative = 0; - res = this.sub(num); - num.negative ^= 1; - return res; - } else if (num.negative === 0 && this.negative !== 0) { - this.negative = 0; - res = num.sub(this); - this.negative = 1; - return res; - } - - if (this.length > num.length) return this.clone().iadd(num); - - return num.clone().iadd(this); - }; - - // Subtract `num` from `this` in-place - BN.prototype.isub = function isub (num) { - // this - (-num) = this + num - if (num.negative !== 0) { - num.negative = 0; - var r = this.iadd(num); - num.negative = 1; - return r._normSign(); - - // -this - num = -(this + num) - } else if (this.negative !== 0) { - this.negative = 0; - this.iadd(num); - this.negative = 1; - return this._normSign(); - } - - // At this point both numbers are positive - var cmp = this.cmp(num); - - // Optimization - zeroify - if (cmp === 0) { - this.negative = 0; - this.length = 1; - this.words[0] = 0; - return this; - } - - // a > b - var a, b; - if (cmp > 0) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) - (b.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - - // Copy rest of the words - if (carry === 0 && i < a.length && a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = Math.max(this.length, i); - - if (a !== this) { - this.negative = 1; - } - - return this.strip(); - }; - - // Subtract `num` from `this` - BN.prototype.sub = function sub (num) { - return this.clone().isub(num); - }; - - function smallMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - var len = (self.length + num.length) | 0; - out.length = len; - len = (len - 1) | 0; - - // Peel one iteration (compiler can't do it, because of code complexity) - var a = self.words[0] | 0; - var b = num.words[0] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - var carry = (r / 0x4000000) | 0; - out.words[0] = lo; - - for (var k = 1; k < len; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = carry >>> 26; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = (k - j) | 0; - a = self.words[i] | 0; - b = num.words[j] | 0; - r = a * b + rword; - ncarry += (r / 0x4000000) | 0; - rword = r & 0x3ffffff; - } - out.words[k] = rword | 0; - carry = ncarry | 0; - } - if (carry !== 0) { - out.words[k] = carry | 0; - } else { - out.length--; - } - - return out.strip(); - } - - // TODO(indutny): it may be reasonable to omit it for users who don't need - // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit - // multiplication (like elliptic secp256k1). - var comb10MulTo = function comb10MulTo (self, num, out) { - var a = self.words; - var b = num.words; - var o = out.words; - var c = 0; - var lo; - var mid; - var hi; - var a0 = a[0] | 0; - var al0 = a0 & 0x1fff; - var ah0 = a0 >>> 13; - var a1 = a[1] | 0; - var al1 = a1 & 0x1fff; - var ah1 = a1 >>> 13; - var a2 = a[2] | 0; - var al2 = a2 & 0x1fff; - var ah2 = a2 >>> 13; - var a3 = a[3] | 0; - var al3 = a3 & 0x1fff; - var ah3 = a3 >>> 13; - var a4 = a[4] | 0; - var al4 = a4 & 0x1fff; - var ah4 = a4 >>> 13; - var a5 = a[5] | 0; - var al5 = a5 & 0x1fff; - var ah5 = a5 >>> 13; - var a6 = a[6] | 0; - var al6 = a6 & 0x1fff; - var ah6 = a6 >>> 13; - var a7 = a[7] | 0; - var al7 = a7 & 0x1fff; - var ah7 = a7 >>> 13; - var a8 = a[8] | 0; - var al8 = a8 & 0x1fff; - var ah8 = a8 >>> 13; - var a9 = a[9] | 0; - var al9 = a9 & 0x1fff; - var ah9 = a9 >>> 13; - var b0 = b[0] | 0; - var bl0 = b0 & 0x1fff; - var bh0 = b0 >>> 13; - var b1 = b[1] | 0; - var bl1 = b1 & 0x1fff; - var bh1 = b1 >>> 13; - var b2 = b[2] | 0; - var bl2 = b2 & 0x1fff; - var bh2 = b2 >>> 13; - var b3 = b[3] | 0; - var bl3 = b3 & 0x1fff; - var bh3 = b3 >>> 13; - var b4 = b[4] | 0; - var bl4 = b4 & 0x1fff; - var bh4 = b4 >>> 13; - var b5 = b[5] | 0; - var bl5 = b5 & 0x1fff; - var bh5 = b5 >>> 13; - var b6 = b[6] | 0; - var bl6 = b6 & 0x1fff; - var bh6 = b6 >>> 13; - var b7 = b[7] | 0; - var bl7 = b7 & 0x1fff; - var bh7 = b7 >>> 13; - var b8 = b[8] | 0; - var bl8 = b8 & 0x1fff; - var bh8 = b8 >>> 13; - var b9 = b[9] | 0; - var bl9 = b9 & 0x1fff; - var bh9 = b9 >>> 13; - - out.negative = self.negative ^ num.negative; - out.length = 19; - /* k = 0 */ - lo = Math.imul(al0, bl0); - mid = Math.imul(al0, bh0); - mid = (mid + Math.imul(ah0, bl0)) | 0; - hi = Math.imul(ah0, bh0); - var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; - w0 &= 0x3ffffff; - /* k = 1 */ - lo = Math.imul(al1, bl0); - mid = Math.imul(al1, bh0); - mid = (mid + Math.imul(ah1, bl0)) | 0; - hi = Math.imul(ah1, bh0); - lo = (lo + Math.imul(al0, bl1)) | 0; - mid = (mid + Math.imul(al0, bh1)) | 0; - mid = (mid + Math.imul(ah0, bl1)) | 0; - hi = (hi + Math.imul(ah0, bh1)) | 0; - var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; - w1 &= 0x3ffffff; - /* k = 2 */ - lo = Math.imul(al2, bl0); - mid = Math.imul(al2, bh0); - mid = (mid + Math.imul(ah2, bl0)) | 0; - hi = Math.imul(ah2, bh0); - lo = (lo + Math.imul(al1, bl1)) | 0; - mid = (mid + Math.imul(al1, bh1)) | 0; - mid = (mid + Math.imul(ah1, bl1)) | 0; - hi = (hi + Math.imul(ah1, bh1)) | 0; - lo = (lo + Math.imul(al0, bl2)) | 0; - mid = (mid + Math.imul(al0, bh2)) | 0; - mid = (mid + Math.imul(ah0, bl2)) | 0; - hi = (hi + Math.imul(ah0, bh2)) | 0; - var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; - w2 &= 0x3ffffff; - /* k = 3 */ - lo = Math.imul(al3, bl0); - mid = Math.imul(al3, bh0); - mid = (mid + Math.imul(ah3, bl0)) | 0; - hi = Math.imul(ah3, bh0); - lo = (lo + Math.imul(al2, bl1)) | 0; - mid = (mid + Math.imul(al2, bh1)) | 0; - mid = (mid + Math.imul(ah2, bl1)) | 0; - hi = (hi + Math.imul(ah2, bh1)) | 0; - lo = (lo + Math.imul(al1, bl2)) | 0; - mid = (mid + Math.imul(al1, bh2)) | 0; - mid = (mid + Math.imul(ah1, bl2)) | 0; - hi = (hi + Math.imul(ah1, bh2)) | 0; - lo = (lo + Math.imul(al0, bl3)) | 0; - mid = (mid + Math.imul(al0, bh3)) | 0; - mid = (mid + Math.imul(ah0, bl3)) | 0; - hi = (hi + Math.imul(ah0, bh3)) | 0; - var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; - w3 &= 0x3ffffff; - /* k = 4 */ - lo = Math.imul(al4, bl0); - mid = Math.imul(al4, bh0); - mid = (mid + Math.imul(ah4, bl0)) | 0; - hi = Math.imul(ah4, bh0); - lo = (lo + Math.imul(al3, bl1)) | 0; - mid = (mid + Math.imul(al3, bh1)) | 0; - mid = (mid + Math.imul(ah3, bl1)) | 0; - hi = (hi + Math.imul(ah3, bh1)) | 0; - lo = (lo + Math.imul(al2, bl2)) | 0; - mid = (mid + Math.imul(al2, bh2)) | 0; - mid = (mid + Math.imul(ah2, bl2)) | 0; - hi = (hi + Math.imul(ah2, bh2)) | 0; - lo = (lo + Math.imul(al1, bl3)) | 0; - mid = (mid + Math.imul(al1, bh3)) | 0; - mid = (mid + Math.imul(ah1, bl3)) | 0; - hi = (hi + Math.imul(ah1, bh3)) | 0; - lo = (lo + Math.imul(al0, bl4)) | 0; - mid = (mid + Math.imul(al0, bh4)) | 0; - mid = (mid + Math.imul(ah0, bl4)) | 0; - hi = (hi + Math.imul(ah0, bh4)) | 0; - var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; - w4 &= 0x3ffffff; - /* k = 5 */ - lo = Math.imul(al5, bl0); - mid = Math.imul(al5, bh0); - mid = (mid + Math.imul(ah5, bl0)) | 0; - hi = Math.imul(ah5, bh0); - lo = (lo + Math.imul(al4, bl1)) | 0; - mid = (mid + Math.imul(al4, bh1)) | 0; - mid = (mid + Math.imul(ah4, bl1)) | 0; - hi = (hi + Math.imul(ah4, bh1)) | 0; - lo = (lo + Math.imul(al3, bl2)) | 0; - mid = (mid + Math.imul(al3, bh2)) | 0; - mid = (mid + Math.imul(ah3, bl2)) | 0; - hi = (hi + Math.imul(ah3, bh2)) | 0; - lo = (lo + Math.imul(al2, bl3)) | 0; - mid = (mid + Math.imul(al2, bh3)) | 0; - mid = (mid + Math.imul(ah2, bl3)) | 0; - hi = (hi + Math.imul(ah2, bh3)) | 0; - lo = (lo + Math.imul(al1, bl4)) | 0; - mid = (mid + Math.imul(al1, bh4)) | 0; - mid = (mid + Math.imul(ah1, bl4)) | 0; - hi = (hi + Math.imul(ah1, bh4)) | 0; - lo = (lo + Math.imul(al0, bl5)) | 0; - mid = (mid + Math.imul(al0, bh5)) | 0; - mid = (mid + Math.imul(ah0, bl5)) | 0; - hi = (hi + Math.imul(ah0, bh5)) | 0; - var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; - w5 &= 0x3ffffff; - /* k = 6 */ - lo = Math.imul(al6, bl0); - mid = Math.imul(al6, bh0); - mid = (mid + Math.imul(ah6, bl0)) | 0; - hi = Math.imul(ah6, bh0); - lo = (lo + Math.imul(al5, bl1)) | 0; - mid = (mid + Math.imul(al5, bh1)) | 0; - mid = (mid + Math.imul(ah5, bl1)) | 0; - hi = (hi + Math.imul(ah5, bh1)) | 0; - lo = (lo + Math.imul(al4, bl2)) | 0; - mid = (mid + Math.imul(al4, bh2)) | 0; - mid = (mid + Math.imul(ah4, bl2)) | 0; - hi = (hi + Math.imul(ah4, bh2)) | 0; - lo = (lo + Math.imul(al3, bl3)) | 0; - mid = (mid + Math.imul(al3, bh3)) | 0; - mid = (mid + Math.imul(ah3, bl3)) | 0; - hi = (hi + Math.imul(ah3, bh3)) | 0; - lo = (lo + Math.imul(al2, bl4)) | 0; - mid = (mid + Math.imul(al2, bh4)) | 0; - mid = (mid + Math.imul(ah2, bl4)) | 0; - hi = (hi + Math.imul(ah2, bh4)) | 0; - lo = (lo + Math.imul(al1, bl5)) | 0; - mid = (mid + Math.imul(al1, bh5)) | 0; - mid = (mid + Math.imul(ah1, bl5)) | 0; - hi = (hi + Math.imul(ah1, bh5)) | 0; - lo = (lo + Math.imul(al0, bl6)) | 0; - mid = (mid + Math.imul(al0, bh6)) | 0; - mid = (mid + Math.imul(ah0, bl6)) | 0; - hi = (hi + Math.imul(ah0, bh6)) | 0; - var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; - w6 &= 0x3ffffff; - /* k = 7 */ - lo = Math.imul(al7, bl0); - mid = Math.imul(al7, bh0); - mid = (mid + Math.imul(ah7, bl0)) | 0; - hi = Math.imul(ah7, bh0); - lo = (lo + Math.imul(al6, bl1)) | 0; - mid = (mid + Math.imul(al6, bh1)) | 0; - mid = (mid + Math.imul(ah6, bl1)) | 0; - hi = (hi + Math.imul(ah6, bh1)) | 0; - lo = (lo + Math.imul(al5, bl2)) | 0; - mid = (mid + Math.imul(al5, bh2)) | 0; - mid = (mid + Math.imul(ah5, bl2)) | 0; - hi = (hi + Math.imul(ah5, bh2)) | 0; - lo = (lo + Math.imul(al4, bl3)) | 0; - mid = (mid + Math.imul(al4, bh3)) | 0; - mid = (mid + Math.imul(ah4, bl3)) | 0; - hi = (hi + Math.imul(ah4, bh3)) | 0; - lo = (lo + Math.imul(al3, bl4)) | 0; - mid = (mid + Math.imul(al3, bh4)) | 0; - mid = (mid + Math.imul(ah3, bl4)) | 0; - hi = (hi + Math.imul(ah3, bh4)) | 0; - lo = (lo + Math.imul(al2, bl5)) | 0; - mid = (mid + Math.imul(al2, bh5)) | 0; - mid = (mid + Math.imul(ah2, bl5)) | 0; - hi = (hi + Math.imul(ah2, bh5)) | 0; - lo = (lo + Math.imul(al1, bl6)) | 0; - mid = (mid + Math.imul(al1, bh6)) | 0; - mid = (mid + Math.imul(ah1, bl6)) | 0; - hi = (hi + Math.imul(ah1, bh6)) | 0; - lo = (lo + Math.imul(al0, bl7)) | 0; - mid = (mid + Math.imul(al0, bh7)) | 0; - mid = (mid + Math.imul(ah0, bl7)) | 0; - hi = (hi + Math.imul(ah0, bh7)) | 0; - var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; - w7 &= 0x3ffffff; - /* k = 8 */ - lo = Math.imul(al8, bl0); - mid = Math.imul(al8, bh0); - mid = (mid + Math.imul(ah8, bl0)) | 0; - hi = Math.imul(ah8, bh0); - lo = (lo + Math.imul(al7, bl1)) | 0; - mid = (mid + Math.imul(al7, bh1)) | 0; - mid = (mid + Math.imul(ah7, bl1)) | 0; - hi = (hi + Math.imul(ah7, bh1)) | 0; - lo = (lo + Math.imul(al6, bl2)) | 0; - mid = (mid + Math.imul(al6, bh2)) | 0; - mid = (mid + Math.imul(ah6, bl2)) | 0; - hi = (hi + Math.imul(ah6, bh2)) | 0; - lo = (lo + Math.imul(al5, bl3)) | 0; - mid = (mid + Math.imul(al5, bh3)) | 0; - mid = (mid + Math.imul(ah5, bl3)) | 0; - hi = (hi + Math.imul(ah5, bh3)) | 0; - lo = (lo + Math.imul(al4, bl4)) | 0; - mid = (mid + Math.imul(al4, bh4)) | 0; - mid = (mid + Math.imul(ah4, bl4)) | 0; - hi = (hi + Math.imul(ah4, bh4)) | 0; - lo = (lo + Math.imul(al3, bl5)) | 0; - mid = (mid + Math.imul(al3, bh5)) | 0; - mid = (mid + Math.imul(ah3, bl5)) | 0; - hi = (hi + Math.imul(ah3, bh5)) | 0; - lo = (lo + Math.imul(al2, bl6)) | 0; - mid = (mid + Math.imul(al2, bh6)) | 0; - mid = (mid + Math.imul(ah2, bl6)) | 0; - hi = (hi + Math.imul(ah2, bh6)) | 0; - lo = (lo + Math.imul(al1, bl7)) | 0; - mid = (mid + Math.imul(al1, bh7)) | 0; - mid = (mid + Math.imul(ah1, bl7)) | 0; - hi = (hi + Math.imul(ah1, bh7)) | 0; - lo = (lo + Math.imul(al0, bl8)) | 0; - mid = (mid + Math.imul(al0, bh8)) | 0; - mid = (mid + Math.imul(ah0, bl8)) | 0; - hi = (hi + Math.imul(ah0, bh8)) | 0; - var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; - w8 &= 0x3ffffff; - /* k = 9 */ - lo = Math.imul(al9, bl0); - mid = Math.imul(al9, bh0); - mid = (mid + Math.imul(ah9, bl0)) | 0; - hi = Math.imul(ah9, bh0); - lo = (lo + Math.imul(al8, bl1)) | 0; - mid = (mid + Math.imul(al8, bh1)) | 0; - mid = (mid + Math.imul(ah8, bl1)) | 0; - hi = (hi + Math.imul(ah8, bh1)) | 0; - lo = (lo + Math.imul(al7, bl2)) | 0; - mid = (mid + Math.imul(al7, bh2)) | 0; - mid = (mid + Math.imul(ah7, bl2)) | 0; - hi = (hi + Math.imul(ah7, bh2)) | 0; - lo = (lo + Math.imul(al6, bl3)) | 0; - mid = (mid + Math.imul(al6, bh3)) | 0; - mid = (mid + Math.imul(ah6, bl3)) | 0; - hi = (hi + Math.imul(ah6, bh3)) | 0; - lo = (lo + Math.imul(al5, bl4)) | 0; - mid = (mid + Math.imul(al5, bh4)) | 0; - mid = (mid + Math.imul(ah5, bl4)) | 0; - hi = (hi + Math.imul(ah5, bh4)) | 0; - lo = (lo + Math.imul(al4, bl5)) | 0; - mid = (mid + Math.imul(al4, bh5)) | 0; - mid = (mid + Math.imul(ah4, bl5)) | 0; - hi = (hi + Math.imul(ah4, bh5)) | 0; - lo = (lo + Math.imul(al3, bl6)) | 0; - mid = (mid + Math.imul(al3, bh6)) | 0; - mid = (mid + Math.imul(ah3, bl6)) | 0; - hi = (hi + Math.imul(ah3, bh6)) | 0; - lo = (lo + Math.imul(al2, bl7)) | 0; - mid = (mid + Math.imul(al2, bh7)) | 0; - mid = (mid + Math.imul(ah2, bl7)) | 0; - hi = (hi + Math.imul(ah2, bh7)) | 0; - lo = (lo + Math.imul(al1, bl8)) | 0; - mid = (mid + Math.imul(al1, bh8)) | 0; - mid = (mid + Math.imul(ah1, bl8)) | 0; - hi = (hi + Math.imul(ah1, bh8)) | 0; - lo = (lo + Math.imul(al0, bl9)) | 0; - mid = (mid + Math.imul(al0, bh9)) | 0; - mid = (mid + Math.imul(ah0, bl9)) | 0; - hi = (hi + Math.imul(ah0, bh9)) | 0; - var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; - w9 &= 0x3ffffff; - /* k = 10 */ - lo = Math.imul(al9, bl1); - mid = Math.imul(al9, bh1); - mid = (mid + Math.imul(ah9, bl1)) | 0; - hi = Math.imul(ah9, bh1); - lo = (lo + Math.imul(al8, bl2)) | 0; - mid = (mid + Math.imul(al8, bh2)) | 0; - mid = (mid + Math.imul(ah8, bl2)) | 0; - hi = (hi + Math.imul(ah8, bh2)) | 0; - lo = (lo + Math.imul(al7, bl3)) | 0; - mid = (mid + Math.imul(al7, bh3)) | 0; - mid = (mid + Math.imul(ah7, bl3)) | 0; - hi = (hi + Math.imul(ah7, bh3)) | 0; - lo = (lo + Math.imul(al6, bl4)) | 0; - mid = (mid + Math.imul(al6, bh4)) | 0; - mid = (mid + Math.imul(ah6, bl4)) | 0; - hi = (hi + Math.imul(ah6, bh4)) | 0; - lo = (lo + Math.imul(al5, bl5)) | 0; - mid = (mid + Math.imul(al5, bh5)) | 0; - mid = (mid + Math.imul(ah5, bl5)) | 0; - hi = (hi + Math.imul(ah5, bh5)) | 0; - lo = (lo + Math.imul(al4, bl6)) | 0; - mid = (mid + Math.imul(al4, bh6)) | 0; - mid = (mid + Math.imul(ah4, bl6)) | 0; - hi = (hi + Math.imul(ah4, bh6)) | 0; - lo = (lo + Math.imul(al3, bl7)) | 0; - mid = (mid + Math.imul(al3, bh7)) | 0; - mid = (mid + Math.imul(ah3, bl7)) | 0; - hi = (hi + Math.imul(ah3, bh7)) | 0; - lo = (lo + Math.imul(al2, bl8)) | 0; - mid = (mid + Math.imul(al2, bh8)) | 0; - mid = (mid + Math.imul(ah2, bl8)) | 0; - hi = (hi + Math.imul(ah2, bh8)) | 0; - lo = (lo + Math.imul(al1, bl9)) | 0; - mid = (mid + Math.imul(al1, bh9)) | 0; - mid = (mid + Math.imul(ah1, bl9)) | 0; - hi = (hi + Math.imul(ah1, bh9)) | 0; - var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; - w10 &= 0x3ffffff; - /* k = 11 */ - lo = Math.imul(al9, bl2); - mid = Math.imul(al9, bh2); - mid = (mid + Math.imul(ah9, bl2)) | 0; - hi = Math.imul(ah9, bh2); - lo = (lo + Math.imul(al8, bl3)) | 0; - mid = (mid + Math.imul(al8, bh3)) | 0; - mid = (mid + Math.imul(ah8, bl3)) | 0; - hi = (hi + Math.imul(ah8, bh3)) | 0; - lo = (lo + Math.imul(al7, bl4)) | 0; - mid = (mid + Math.imul(al7, bh4)) | 0; - mid = (mid + Math.imul(ah7, bl4)) | 0; - hi = (hi + Math.imul(ah7, bh4)) | 0; - lo = (lo + Math.imul(al6, bl5)) | 0; - mid = (mid + Math.imul(al6, bh5)) | 0; - mid = (mid + Math.imul(ah6, bl5)) | 0; - hi = (hi + Math.imul(ah6, bh5)) | 0; - lo = (lo + Math.imul(al5, bl6)) | 0; - mid = (mid + Math.imul(al5, bh6)) | 0; - mid = (mid + Math.imul(ah5, bl6)) | 0; - hi = (hi + Math.imul(ah5, bh6)) | 0; - lo = (lo + Math.imul(al4, bl7)) | 0; - mid = (mid + Math.imul(al4, bh7)) | 0; - mid = (mid + Math.imul(ah4, bl7)) | 0; - hi = (hi + Math.imul(ah4, bh7)) | 0; - lo = (lo + Math.imul(al3, bl8)) | 0; - mid = (mid + Math.imul(al3, bh8)) | 0; - mid = (mid + Math.imul(ah3, bl8)) | 0; - hi = (hi + Math.imul(ah3, bh8)) | 0; - lo = (lo + Math.imul(al2, bl9)) | 0; - mid = (mid + Math.imul(al2, bh9)) | 0; - mid = (mid + Math.imul(ah2, bl9)) | 0; - hi = (hi + Math.imul(ah2, bh9)) | 0; - var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; - w11 &= 0x3ffffff; - /* k = 12 */ - lo = Math.imul(al9, bl3); - mid = Math.imul(al9, bh3); - mid = (mid + Math.imul(ah9, bl3)) | 0; - hi = Math.imul(ah9, bh3); - lo = (lo + Math.imul(al8, bl4)) | 0; - mid = (mid + Math.imul(al8, bh4)) | 0; - mid = (mid + Math.imul(ah8, bl4)) | 0; - hi = (hi + Math.imul(ah8, bh4)) | 0; - lo = (lo + Math.imul(al7, bl5)) | 0; - mid = (mid + Math.imul(al7, bh5)) | 0; - mid = (mid + Math.imul(ah7, bl5)) | 0; - hi = (hi + Math.imul(ah7, bh5)) | 0; - lo = (lo + Math.imul(al6, bl6)) | 0; - mid = (mid + Math.imul(al6, bh6)) | 0; - mid = (mid + Math.imul(ah6, bl6)) | 0; - hi = (hi + Math.imul(ah6, bh6)) | 0; - lo = (lo + Math.imul(al5, bl7)) | 0; - mid = (mid + Math.imul(al5, bh7)) | 0; - mid = (mid + Math.imul(ah5, bl7)) | 0; - hi = (hi + Math.imul(ah5, bh7)) | 0; - lo = (lo + Math.imul(al4, bl8)) | 0; - mid = (mid + Math.imul(al4, bh8)) | 0; - mid = (mid + Math.imul(ah4, bl8)) | 0; - hi = (hi + Math.imul(ah4, bh8)) | 0; - lo = (lo + Math.imul(al3, bl9)) | 0; - mid = (mid + Math.imul(al3, bh9)) | 0; - mid = (mid + Math.imul(ah3, bl9)) | 0; - hi = (hi + Math.imul(ah3, bh9)) | 0; - var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; - w12 &= 0x3ffffff; - /* k = 13 */ - lo = Math.imul(al9, bl4); - mid = Math.imul(al9, bh4); - mid = (mid + Math.imul(ah9, bl4)) | 0; - hi = Math.imul(ah9, bh4); - lo = (lo + Math.imul(al8, bl5)) | 0; - mid = (mid + Math.imul(al8, bh5)) | 0; - mid = (mid + Math.imul(ah8, bl5)) | 0; - hi = (hi + Math.imul(ah8, bh5)) | 0; - lo = (lo + Math.imul(al7, bl6)) | 0; - mid = (mid + Math.imul(al7, bh6)) | 0; - mid = (mid + Math.imul(ah7, bl6)) | 0; - hi = (hi + Math.imul(ah7, bh6)) | 0; - lo = (lo + Math.imul(al6, bl7)) | 0; - mid = (mid + Math.imul(al6, bh7)) | 0; - mid = (mid + Math.imul(ah6, bl7)) | 0; - hi = (hi + Math.imul(ah6, bh7)) | 0; - lo = (lo + Math.imul(al5, bl8)) | 0; - mid = (mid + Math.imul(al5, bh8)) | 0; - mid = (mid + Math.imul(ah5, bl8)) | 0; - hi = (hi + Math.imul(ah5, bh8)) | 0; - lo = (lo + Math.imul(al4, bl9)) | 0; - mid = (mid + Math.imul(al4, bh9)) | 0; - mid = (mid + Math.imul(ah4, bl9)) | 0; - hi = (hi + Math.imul(ah4, bh9)) | 0; - var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; - w13 &= 0x3ffffff; - /* k = 14 */ - lo = Math.imul(al9, bl5); - mid = Math.imul(al9, bh5); - mid = (mid + Math.imul(ah9, bl5)) | 0; - hi = Math.imul(ah9, bh5); - lo = (lo + Math.imul(al8, bl6)) | 0; - mid = (mid + Math.imul(al8, bh6)) | 0; - mid = (mid + Math.imul(ah8, bl6)) | 0; - hi = (hi + Math.imul(ah8, bh6)) | 0; - lo = (lo + Math.imul(al7, bl7)) | 0; - mid = (mid + Math.imul(al7, bh7)) | 0; - mid = (mid + Math.imul(ah7, bl7)) | 0; - hi = (hi + Math.imul(ah7, bh7)) | 0; - lo = (lo + Math.imul(al6, bl8)) | 0; - mid = (mid + Math.imul(al6, bh8)) | 0; - mid = (mid + Math.imul(ah6, bl8)) | 0; - hi = (hi + Math.imul(ah6, bh8)) | 0; - lo = (lo + Math.imul(al5, bl9)) | 0; - mid = (mid + Math.imul(al5, bh9)) | 0; - mid = (mid + Math.imul(ah5, bl9)) | 0; - hi = (hi + Math.imul(ah5, bh9)) | 0; - var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; - w14 &= 0x3ffffff; - /* k = 15 */ - lo = Math.imul(al9, bl6); - mid = Math.imul(al9, bh6); - mid = (mid + Math.imul(ah9, bl6)) | 0; - hi = Math.imul(ah9, bh6); - lo = (lo + Math.imul(al8, bl7)) | 0; - mid = (mid + Math.imul(al8, bh7)) | 0; - mid = (mid + Math.imul(ah8, bl7)) | 0; - hi = (hi + Math.imul(ah8, bh7)) | 0; - lo = (lo + Math.imul(al7, bl8)) | 0; - mid = (mid + Math.imul(al7, bh8)) | 0; - mid = (mid + Math.imul(ah7, bl8)) | 0; - hi = (hi + Math.imul(ah7, bh8)) | 0; - lo = (lo + Math.imul(al6, bl9)) | 0; - mid = (mid + Math.imul(al6, bh9)) | 0; - mid = (mid + Math.imul(ah6, bl9)) | 0; - hi = (hi + Math.imul(ah6, bh9)) | 0; - var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; - w15 &= 0x3ffffff; - /* k = 16 */ - lo = Math.imul(al9, bl7); - mid = Math.imul(al9, bh7); - mid = (mid + Math.imul(ah9, bl7)) | 0; - hi = Math.imul(ah9, bh7); - lo = (lo + Math.imul(al8, bl8)) | 0; - mid = (mid + Math.imul(al8, bh8)) | 0; - mid = (mid + Math.imul(ah8, bl8)) | 0; - hi = (hi + Math.imul(ah8, bh8)) | 0; - lo = (lo + Math.imul(al7, bl9)) | 0; - mid = (mid + Math.imul(al7, bh9)) | 0; - mid = (mid + Math.imul(ah7, bl9)) | 0; - hi = (hi + Math.imul(ah7, bh9)) | 0; - var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; - w16 &= 0x3ffffff; - /* k = 17 */ - lo = Math.imul(al9, bl8); - mid = Math.imul(al9, bh8); - mid = (mid + Math.imul(ah9, bl8)) | 0; - hi = Math.imul(ah9, bh8); - lo = (lo + Math.imul(al8, bl9)) | 0; - mid = (mid + Math.imul(al8, bh9)) | 0; - mid = (mid + Math.imul(ah8, bl9)) | 0; - hi = (hi + Math.imul(ah8, bh9)) | 0; - var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; - w17 &= 0x3ffffff; - /* k = 18 */ - lo = Math.imul(al9, bl9); - mid = Math.imul(al9, bh9); - mid = (mid + Math.imul(ah9, bl9)) | 0; - hi = Math.imul(ah9, bh9); - var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; - w18 &= 0x3ffffff; - o[0] = w0; - o[1] = w1; - o[2] = w2; - o[3] = w3; - o[4] = w4; - o[5] = w5; - o[6] = w6; - o[7] = w7; - o[8] = w8; - o[9] = w9; - o[10] = w10; - o[11] = w11; - o[12] = w12; - o[13] = w13; - o[14] = w14; - o[15] = w15; - o[16] = w16; - o[17] = w17; - o[18] = w18; - if (c !== 0) { - o[19] = c; - out.length++; - } - return out; - }; - - // Polyfill comb - if (!Math.imul) { - comb10MulTo = smallMulTo; - } - - function bigMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - out.length = self.length + num.length; - - var carry = 0; - var hncarry = 0; - for (var k = 0; k < out.length - 1; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = hncarry; - hncarry = 0; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = k - j; - var a = self.words[i] | 0; - var b = num.words[j] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; - lo = (lo + rword) | 0; - rword = lo & 0x3ffffff; - ncarry = (ncarry + (lo >>> 26)) | 0; - - hncarry += ncarry >>> 26; - ncarry &= 0x3ffffff; - } - out.words[k] = rword; - carry = ncarry; - ncarry = hncarry; - } - if (carry !== 0) { - out.words[k] = carry; - } else { - out.length--; - } - - return out.strip(); - } - - function jumboMulTo (self, num, out) { - var fftm = new FFTM(); - return fftm.mulp(self, num, out); - } - - BN.prototype.mulTo = function mulTo (num, out) { - var res; - var len = this.length + num.length; - if (this.length === 10 && num.length === 10) { - res = comb10MulTo(this, num, out); - } else if (len < 63) { - res = smallMulTo(this, num, out); - } else if (len < 1024) { - res = bigMulTo(this, num, out); - } else { - res = jumboMulTo(this, num, out); - } - - return res; - }; - - // Cooley-Tukey algorithm for FFT - // slightly revisited to rely on looping instead of recursion - - function FFTM (x, y) { - this.x = x; - this.y = y; - } - - FFTM.prototype.makeRBT = function makeRBT (N) { - var t = new Array(N); - var l = BN.prototype._countBits(N) - 1; - for (var i = 0; i < N; i++) { - t[i] = this.revBin(i, l, N); - } - - return t; - }; - - // Returns binary-reversed representation of `x` - FFTM.prototype.revBin = function revBin (x, l, N) { - if (x === 0 || x === N - 1) return x; - - var rb = 0; - for (var i = 0; i < l; i++) { - rb |= (x & 1) << (l - i - 1); - x >>= 1; - } - - return rb; - }; - - // Performs "tweedling" phase, therefore 'emulating' - // behaviour of the recursive algorithm - FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { - for (var i = 0; i < N; i++) { - rtws[i] = rws[rbt[i]]; - itws[i] = iws[rbt[i]]; - } - }; - - FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { - this.permute(rbt, rws, iws, rtws, itws, N); - - for (var s = 1; s < N; s <<= 1) { - var l = s << 1; - - var rtwdf = Math.cos(2 * Math.PI / l); - var itwdf = Math.sin(2 * Math.PI / l); - - for (var p = 0; p < N; p += l) { - var rtwdf_ = rtwdf; - var itwdf_ = itwdf; - - for (var j = 0; j < s; j++) { - var re = rtws[p + j]; - var ie = itws[p + j]; - - var ro = rtws[p + j + s]; - var io = itws[p + j + s]; - - var rx = rtwdf_ * ro - itwdf_ * io; - - io = rtwdf_ * io + itwdf_ * ro; - ro = rx; - - rtws[p + j] = re + ro; - itws[p + j] = ie + io; - - rtws[p + j + s] = re - ro; - itws[p + j + s] = ie - io; - - /* jshint maxdepth : false */ - if (j !== l) { - rx = rtwdf * rtwdf_ - itwdf * itwdf_; - - itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; - rtwdf_ = rx; - } - } - } - } - }; - - FFTM.prototype.guessLen13b = function guessLen13b (n, m) { - var N = Math.max(m, n) | 1; - var odd = N & 1; - var i = 0; - for (N = N / 2 | 0; N; N = N >>> 1) { - i++; - } - - return 1 << i + 1 + odd; - }; - - FFTM.prototype.conjugate = function conjugate (rws, iws, N) { - if (N <= 1) return; - - for (var i = 0; i < N / 2; i++) { - var t = rws[i]; - - rws[i] = rws[N - i - 1]; - rws[N - i - 1] = t; - - t = iws[i]; - - iws[i] = -iws[N - i - 1]; - iws[N - i - 1] = -t; - } - }; - - FFTM.prototype.normalize13b = function normalize13b (ws, N) { - var carry = 0; - for (var i = 0; i < N / 2; i++) { - var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + - Math.round(ws[2 * i] / N) + - carry; - - ws[i] = w & 0x3ffffff; - - if (w < 0x4000000) { - carry = 0; - } else { - carry = w / 0x4000000 | 0; - } - } - - return ws; - }; - - FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { - var carry = 0; - for (var i = 0; i < len; i++) { - carry = carry + (ws[i] | 0); - - rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; - rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; - } - - // Pad with zeroes - for (i = 2 * len; i < N; ++i) { - rws[i] = 0; - } - - assert(carry === 0); - assert((carry & ~0x1fff) === 0); - }; - - FFTM.prototype.stub = function stub (N) { - var ph = new Array(N); - for (var i = 0; i < N; i++) { - ph[i] = 0; - } - - return ph; - }; - - FFTM.prototype.mulp = function mulp (x, y, out) { - var N = 2 * this.guessLen13b(x.length, y.length); - - var rbt = this.makeRBT(N); - - var _ = this.stub(N); - - var rws = new Array(N); - var rwst = new Array(N); - var iwst = new Array(N); - - var nrws = new Array(N); - var nrwst = new Array(N); - var niwst = new Array(N); - - var rmws = out.words; - rmws.length = N; - - this.convert13b(x.words, x.length, rws, N); - this.convert13b(y.words, y.length, nrws, N); - - this.transform(rws, _, rwst, iwst, N, rbt); - this.transform(nrws, _, nrwst, niwst, N, rbt); - - for (var i = 0; i < N; i++) { - var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; - iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; - rwst[i] = rx; - } - - this.conjugate(rwst, iwst, N); - this.transform(rwst, iwst, rmws, _, N, rbt); - this.conjugate(rmws, _, N); - this.normalize13b(rmws, N); - - out.negative = x.negative ^ y.negative; - out.length = x.length + y.length; - return out.strip(); - }; - - // Multiply `this` by `num` - BN.prototype.mul = function mul (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return this.mulTo(num, out); - }; - - // Multiply employing FFT - BN.prototype.mulf = function mulf (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return jumboMulTo(this, num, out); - }; - - // In-place Multiplication - BN.prototype.imul = function imul (num) { - return this.clone().mulTo(num, this); - }; - - BN.prototype.imuln = function imuln (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - - // Carry - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = (this.words[i] | 0) * num; - var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); - carry >>= 26; - carry += (w / 0x4000000) | 0; - // NOTE: lo is 27bit maximum - carry += lo >>> 26; - this.words[i] = lo & 0x3ffffff; - } - - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - - return this; - }; - - BN.prototype.muln = function muln (num) { - return this.clone().imuln(num); - }; - - // `this` * `this` - BN.prototype.sqr = function sqr () { - return this.mul(this); - }; - - // `this` * `this` in-place - BN.prototype.isqr = function isqr () { - return this.imul(this.clone()); - }; - - // Math.pow(`this`, `num`) - BN.prototype.pow = function pow (num) { - var w = toBitArray(num); - if (w.length === 0) return new BN(1); - - // Skip leading zeroes - var res = this; - for (var i = 0; i < w.length; i++, res = res.sqr()) { - if (w[i] !== 0) break; - } - - if (++i < w.length) { - for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { - if (w[i] === 0) continue; - - res = res.mul(q); - } - } - - return res; - }; - - // Shift-left in-place - BN.prototype.iushln = function iushln (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); - var i; - - if (r !== 0) { - var carry = 0; - - for (i = 0; i < this.length; i++) { - var newCarry = this.words[i] & carryMask; - var c = ((this.words[i] | 0) - newCarry) << r; - this.words[i] = c | carry; - carry = newCarry >>> (26 - r); - } - - if (carry) { - this.words[i] = carry; - this.length++; - } - } - - if (s !== 0) { - for (i = this.length - 1; i >= 0; i--) { - this.words[i + s] = this.words[i]; - } - - for (i = 0; i < s; i++) { - this.words[i] = 0; - } - - this.length += s; - } - - return this.strip(); - }; - - BN.prototype.ishln = function ishln (bits) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushln(bits); - }; - - // Shift-right in-place - // NOTE: `hint` is a lowest bit before trailing zeroes - // NOTE: if `extended` is present - it will be filled with destroyed bits - BN.prototype.iushrn = function iushrn (bits, hint, extended) { - assert(typeof bits === 'number' && bits >= 0); - var h; - if (hint) { - h = (hint - (hint % 26)) / 26; - } else { - h = 0; - } - - var r = bits % 26; - var s = Math.min((bits - r) / 26, this.length); - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - var maskedWords = extended; - - h -= s; - h = Math.max(0, h); - - // Extended mode, copy masked part - if (maskedWords) { - for (var i = 0; i < s; i++) { - maskedWords.words[i] = this.words[i]; - } - maskedWords.length = s; - } - - if (s === 0) { - // No-op, we should not move anything at all - } else if (this.length > s) { - this.length -= s; - for (i = 0; i < this.length; i++) { - this.words[i] = this.words[i + s]; - } - } else { - this.words[0] = 0; - this.length = 1; - } - - var carry = 0; - for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { - var word = this.words[i] | 0; - this.words[i] = (carry << (26 - r)) | (word >>> r); - carry = word & mask; - } - - // Push carried bits as a mask - if (maskedWords && carry !== 0) { - maskedWords.words[maskedWords.length++] = carry; - } - - if (this.length === 0) { - this.words[0] = 0; - this.length = 1; - } - - return this.strip(); - }; - - BN.prototype.ishrn = function ishrn (bits, hint, extended) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushrn(bits, hint, extended); - }; - - // Shift-left - BN.prototype.shln = function shln (bits) { - return this.clone().ishln(bits); - }; - - BN.prototype.ushln = function ushln (bits) { - return this.clone().iushln(bits); - }; - - // Shift-right - BN.prototype.shrn = function shrn (bits) { - return this.clone().ishrn(bits); - }; - - BN.prototype.ushrn = function ushrn (bits) { - return this.clone().iushrn(bits); - }; - - // Test if n bit is set - BN.prototype.testn = function testn (bit) { - assert(typeof bit === 'number' && bit >= 0); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) return false; - - // Check bit and return - var w = this.words[s]; - - return !!(w & q); - }; - - // Return only lowers bits of number (in-place) - BN.prototype.imaskn = function imaskn (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - - assert(this.negative === 0, 'imaskn works only with positive numbers'); - - if (this.length <= s) { - return this; - } - - if (r !== 0) { - s++; - } - this.length = Math.min(s, this.length); - - if (r !== 0) { - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - this.words[this.length - 1] &= mask; - } - - return this.strip(); - }; - - // Return only lowers bits of number - BN.prototype.maskn = function maskn (bits) { - return this.clone().imaskn(bits); - }; - - // Add plain number `num` to `this` - BN.prototype.iaddn = function iaddn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.isubn(-num); - - // Possible sign change - if (this.negative !== 0) { - if (this.length === 1 && (this.words[0] | 0) < num) { - this.words[0] = num - (this.words[0] | 0); - this.negative = 0; - return this; - } - - this.negative = 0; - this.isubn(num); - this.negative = 1; - return this; - } - - // Add without checks - return this._iaddn(num); - }; - - BN.prototype._iaddn = function _iaddn (num) { - this.words[0] += num; - - // Carry - for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { - this.words[i] -= 0x4000000; - if (i === this.length - 1) { - this.words[i + 1] = 1; - } else { - this.words[i + 1]++; - } - } - this.length = Math.max(this.length, i + 1); - - return this; - }; - - // Subtract plain number `num` from `this` - BN.prototype.isubn = function isubn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.iaddn(-num); - - if (this.negative !== 0) { - this.negative = 0; - this.iaddn(num); - this.negative = 1; - return this; - } - - this.words[0] -= num; - - if (this.length === 1 && this.words[0] < 0) { - this.words[0] = -this.words[0]; - this.negative = 1; - } else { - // Carry - for (var i = 0; i < this.length && this.words[i] < 0; i++) { - this.words[i] += 0x4000000; - this.words[i + 1] -= 1; - } - } - - return this.strip(); - }; - - BN.prototype.addn = function addn (num) { - return this.clone().iaddn(num); - }; - - BN.prototype.subn = function subn (num) { - return this.clone().isubn(num); - }; - - BN.prototype.iabs = function iabs () { - this.negative = 0; - - return this; - }; - - BN.prototype.abs = function abs () { - return this.clone().iabs(); - }; - - BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { - var len = num.length + shift; - var i; - - this._expand(len); - - var w; - var carry = 0; - for (i = 0; i < num.length; i++) { - w = (this.words[i + shift] | 0) + carry; - var right = (num.words[i] | 0) * mul; - w -= right & 0x3ffffff; - carry = (w >> 26) - ((right / 0x4000000) | 0); - this.words[i + shift] = w & 0x3ffffff; - } - for (; i < this.length - shift; i++) { - w = (this.words[i + shift] | 0) + carry; - carry = w >> 26; - this.words[i + shift] = w & 0x3ffffff; - } - - if (carry === 0) return this.strip(); - - // Subtraction overflow - assert(carry === -1); - carry = 0; - for (i = 0; i < this.length; i++) { - w = -(this.words[i] | 0) + carry; - carry = w >> 26; - this.words[i] = w & 0x3ffffff; - } - this.negative = 1; - - return this.strip(); - }; - - BN.prototype._wordDiv = function _wordDiv (num, mode) { - var shift = this.length - num.length; - - var a = this.clone(); - var b = num; - - // Normalize - var bhi = b.words[b.length - 1] | 0; - var bhiBits = this._countBits(bhi); - shift = 26 - bhiBits; - if (shift !== 0) { - b = b.ushln(shift); - a.iushln(shift); - bhi = b.words[b.length - 1] | 0; - } - - // Initialize quotient - var m = a.length - b.length; - var q; - - if (mode !== 'mod') { - q = new BN(null); - q.length = m + 1; - q.words = new Array(q.length); - for (var i = 0; i < q.length; i++) { - q.words[i] = 0; - } - } - - var diff = a.clone()._ishlnsubmul(b, 1, m); - if (diff.negative === 0) { - a = diff; - if (q) { - q.words[m] = 1; - } - } - - for (var j = m - 1; j >= 0; j--) { - 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 - // (0x7ffffff) - qj = Math.min((qj / bhi) | 0, 0x3ffffff); - - a._ishlnsubmul(b, qj, j); - while (a.negative !== 0) { - qj--; - a.negative = 0; - a._ishlnsubmul(b, 1, j); - if (!a.isZero()) { - a.negative ^= 1; - } - } - if (q) { - q.words[j] = qj; - } - } - if (q) { - q.strip(); - } - a.strip(); - - // Denormalize - if (mode !== 'div' && shift !== 0) { - a.iushrn(shift); - } - - return { - div: q || null, - mod: a - }; - }; - - // NOTE: 1) `mode` can be set to `mod` to request mod only, - // to `div` to request div only, or be absent to - // request both div & mod - // 2) `positive` is true if unsigned mod is requested - BN.prototype.divmod = function divmod (num, mode, positive) { - assert(!num.isZero()); - - if (this.isZero()) { - return { - div: new BN(0), - mod: new BN(0) - }; - } - - var div, mod, res; - if (this.negative !== 0 && num.negative === 0) { - res = this.neg().divmod(num, mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.iadd(num); - } - } - - return { - div: div, - mod: mod - }; - } - - if (this.negative === 0 && num.negative !== 0) { - res = this.divmod(num.neg(), mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - return { - div: div, - mod: res.mod - }; - } - - if ((this.negative & num.negative) !== 0) { - res = this.neg().divmod(num.neg(), mode); - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.isub(num); - } - } - - return { - div: res.div, - mod: mod - }; - } - - // Both numbers are positive at this point - - // Strip both numbers to approximate shift value - if (num.length > this.length || this.cmp(num) < 0) { - return { - div: new BN(0), - mod: this - }; - } - - // Very short reduction - if (num.length === 1) { - if (mode === 'div') { - return { - div: this.divn(num.words[0]), - mod: null - }; - } - - if (mode === 'mod') { - return { - div: null, - mod: new BN(this.modn(num.words[0])) - }; - } - - return { - div: this.divn(num.words[0]), - mod: new BN(this.modn(num.words[0])) - }; - } - - return this._wordDiv(num, mode); - }; - - // Find `this` / `num` - BN.prototype.div = function div (num) { - return this.divmod(num, 'div', false).div; - }; - - // Find `this` % `num` - BN.prototype.mod = function mod (num) { - return this.divmod(num, 'mod', false).mod; - }; - - BN.prototype.umod = function umod (num) { - return this.divmod(num, 'mod', true).mod; - }; - - // Find Round(`this` / `num`) - BN.prototype.divRound = function divRound (num) { - var dm = this.divmod(num); - - // Fast case - exact division - if (dm.mod.isZero()) return dm.div; - - var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; - - var half = num.ushrn(1); - var r2 = num.andln(1); - var cmp = mod.cmp(half); - - // Round down - if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div; - - // Round up - return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); - }; - - BN.prototype.modn = function modn (num) { - assert(num <= 0x3ffffff); - var p = (1 << 26) % num; - - var acc = 0; - for (var i = this.length - 1; i >= 0; i--) { - acc = (p * acc + (this.words[i] | 0)) % num; - } - - return acc; - }; - - // In-place division by number - BN.prototype.idivn = function idivn (num) { - assert(num <= 0x3ffffff); - - var carry = 0; - for (var i = this.length - 1; i >= 0; i--) { - var w = (this.words[i] | 0) + carry * 0x4000000; - this.words[i] = (w / num) | 0; - carry = w % num; - } - - return this.strip(); - }; - - BN.prototype.divn = function divn (num) { - return this.clone().idivn(num); - }; - - BN.prototype.egcd = function egcd (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var x = this; - var y = p.clone(); - - if (x.negative !== 0) { - x = x.umod(p); - } else { - x = x.clone(); - } - - // A * x + B * y = x - var A = new BN(1); - var B = new BN(0); - - // C * x + D * y = y - var C = new BN(0); - var D = new BN(1); - - var g = 0; - - while (x.isEven() && y.isEven()) { - x.iushrn(1); - y.iushrn(1); - ++g; - } - - var yp = y.clone(); - var xp = x.clone(); - - while (!x.isZero()) { - for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - x.iushrn(i); - while (i-- > 0) { - if (A.isOdd() || B.isOdd()) { - A.iadd(yp); - B.isub(xp); - } - - A.iushrn(1); - B.iushrn(1); - } - } - - for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - y.iushrn(j); - while (j-- > 0) { - if (C.isOdd() || D.isOdd()) { - C.iadd(yp); - D.isub(xp); - } - - C.iushrn(1); - D.iushrn(1); - } - } - - if (x.cmp(y) >= 0) { - x.isub(y); - A.isub(C); - B.isub(D); - } else { - y.isub(x); - C.isub(A); - D.isub(B); - } - } - - return { - a: C, - b: D, - gcd: y.iushln(g) - }; - }; - - // This is reduced incarnation of the binary EEA - // above, designated to invert members of the - // _prime_ fields F(p) at a maximal speed - BN.prototype._invmp = function _invmp (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var a = this; - var b = p.clone(); - - if (a.negative !== 0) { - a = a.umod(p); - } else { - a = a.clone(); - } - - var x1 = new BN(1); - var x2 = new BN(0); - - var delta = b.clone(); - - while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { - for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - a.iushrn(i); - while (i-- > 0) { - if (x1.isOdd()) { - x1.iadd(delta); - } - - x1.iushrn(1); - } - } - - for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - b.iushrn(j); - while (j-- > 0) { - if (x2.isOdd()) { - x2.iadd(delta); - } - - x2.iushrn(1); - } - } - - if (a.cmp(b) >= 0) { - a.isub(b); - x1.isub(x2); - } else { - b.isub(a); - x2.isub(x1); - } - } - - var res; - if (a.cmpn(1) === 0) { - res = x1; - } else { - res = x2; - } - - if (res.cmpn(0) < 0) { - res.iadd(p); - } - - return res; - }; - - BN.prototype.gcd = function gcd (num) { - if (this.isZero()) return num.abs(); - if (num.isZero()) return this.abs(); - - var a = this.clone(); - var b = num.clone(); - a.negative = 0; - b.negative = 0; - - // Remove common factor of two - for (var shift = 0; a.isEven() && b.isEven(); shift++) { - a.iushrn(1); - b.iushrn(1); - } - - do { - while (a.isEven()) { - a.iushrn(1); - } - while (b.isEven()) { - b.iushrn(1); - } - - var r = a.cmp(b); - if (r < 0) { - // Swap `a` and `b` to make `a` always bigger than `b` - var t = a; - a = b; - b = t; - } else if (r === 0 || b.cmpn(1) === 0) { - break; - } - - a.isub(b); - } while (true); - - return b.iushln(shift); - }; - - // Invert number in the field F(num) - BN.prototype.invm = function invm (num) { - return this.egcd(num).a.umod(num); - }; - - BN.prototype.isEven = function isEven () { - return (this.words[0] & 1) === 0; - }; - - BN.prototype.isOdd = function isOdd () { - return (this.words[0] & 1) === 1; - }; - - // And first word and num - BN.prototype.andln = function andln (num) { - return this.words[0] & num; - }; - - // Increment at the bit position in-line - BN.prototype.bincn = function bincn (bit) { - assert(typeof bit === 'number'); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) { - this._expand(s + 1); - this.words[s] |= q; - return this; - } - - // Add bit and propagate, if needed - var carry = q; - for (var i = s; carry !== 0 && i < this.length; i++) { - var w = this.words[i] | 0; - w += carry; - carry = w >>> 26; - w &= 0x3ffffff; - this.words[i] = w; - } - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - return this; - }; - - BN.prototype.isZero = function isZero () { - return this.length === 1 && this.words[0] === 0; - }; - - BN.prototype.cmpn = function cmpn (num) { - var negative = num < 0; - - if (this.negative !== 0 && !negative) return -1; - if (this.negative === 0 && negative) return 1; - - this.strip(); - - var res; - if (this.length > 1) { - res = 1; - } else { - if (negative) { - num = -num; - } - - assert(num <= 0x3ffffff, 'Number is too big'); - - var w = this.words[0] | 0; - res = w === num ? 0 : w < num ? -1 : 1; - } - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Compare two numbers and return: - // 1 - if `this` > `num` - // 0 - if `this` == `num` - // -1 - if `this` < `num` - BN.prototype.cmp = function cmp (num) { - if (this.negative !== 0 && num.negative === 0) return -1; - if (this.negative === 0 && num.negative !== 0) return 1; - - var res = this.ucmp(num); - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Unsigned comparison - BN.prototype.ucmp = function ucmp (num) { - // At this point both numbers have the same sign - if (this.length > num.length) return 1; - if (this.length < num.length) return -1; - - var res = 0; - for (var i = this.length - 1; i >= 0; i--) { - var a = this.words[i] | 0; - var b = num.words[i] | 0; - - if (a === b) continue; - if (a < b) { - res = -1; - } else if (a > b) { - res = 1; - } - break; - } - return res; - }; - - BN.prototype.gtn = function gtn (num) { - return this.cmpn(num) === 1; - }; - - BN.prototype.gt = function gt (num) { - return this.cmp(num) === 1; - }; - - BN.prototype.gten = function gten (num) { - return this.cmpn(num) >= 0; - }; - - BN.prototype.gte = function gte (num) { - return this.cmp(num) >= 0; - }; - - BN.prototype.ltn = function ltn (num) { - return this.cmpn(num) === -1; - }; - - BN.prototype.lt = function lt (num) { - return this.cmp(num) === -1; - }; - - BN.prototype.lten = function lten (num) { - return this.cmpn(num) <= 0; - }; - - BN.prototype.lte = function lte (num) { - return this.cmp(num) <= 0; - }; - - BN.prototype.eqn = function eqn (num) { - return this.cmpn(num) === 0; - }; - - BN.prototype.eq = function eq (num) { - return this.cmp(num) === 0; - }; - - // - // A reduce context, could be using montgomery or something better, depending - // on the `m` itself. - // - BN.red = function red (num) { - return new Red(num); - }; - - BN.prototype.toRed = function toRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - assert(this.negative === 0, 'red works only with positives'); - return ctx.convertTo(this)._forceRed(ctx); - }; - - BN.prototype.fromRed = function fromRed () { - assert(this.red, 'fromRed works only with numbers in reduction context'); - return this.red.convertFrom(this); - }; - - BN.prototype._forceRed = function _forceRed (ctx) { - this.red = ctx; - return this; - }; - - BN.prototype.forceRed = function forceRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - return this._forceRed(ctx); - }; - - BN.prototype.redAdd = function redAdd (num) { - assert(this.red, 'redAdd works only with red numbers'); - return this.red.add(this, num); - }; - - BN.prototype.redIAdd = function redIAdd (num) { - assert(this.red, 'redIAdd works only with red numbers'); - return this.red.iadd(this, num); - }; - - BN.prototype.redSub = function redSub (num) { - assert(this.red, 'redSub works only with red numbers'); - return this.red.sub(this, num); - }; - - BN.prototype.redISub = function redISub (num) { - assert(this.red, 'redISub works only with red numbers'); - return this.red.isub(this, num); - }; - - BN.prototype.redShl = function redShl (num) { - assert(this.red, 'redShl works only with red numbers'); - return this.red.shl(this, num); - }; - - BN.prototype.redMul = function redMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.mul(this, num); - }; - - BN.prototype.redIMul = function redIMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.imul(this, num); - }; - - BN.prototype.redSqr = function redSqr () { - assert(this.red, 'redSqr works only with red numbers'); - this.red._verify1(this); - return this.red.sqr(this); - }; - - BN.prototype.redISqr = function redISqr () { - assert(this.red, 'redISqr works only with red numbers'); - this.red._verify1(this); - return this.red.isqr(this); - }; - - // Square root over p - BN.prototype.redSqrt = function redSqrt () { - assert(this.red, 'redSqrt works only with red numbers'); - this.red._verify1(this); - return this.red.sqrt(this); - }; - - BN.prototype.redInvm = function redInvm () { - assert(this.red, 'redInvm works only with red numbers'); - this.red._verify1(this); - return this.red.invm(this); - }; - - // Return negative clone of `this` % `red modulo` - BN.prototype.redNeg = function redNeg () { - assert(this.red, 'redNeg works only with red numbers'); - this.red._verify1(this); - return this.red.neg(this); - }; - - BN.prototype.redPow = function redPow (num) { - assert(this.red && !num.red, 'redPow(normalNum)'); - this.red._verify1(this); - return this.red.pow(this, num); - }; - - // Prime numbers with efficient reduction - var primes = { - k256: null, - p224: null, - p192: null, - p25519: null - }; - - // Pseudo-Mersenne prime - function MPrime (name, p) { - // P = 2 ^ N - K - this.name = name; - this.p = new BN(p, 16); - this.n = this.p.bitLength(); - this.k = new BN(1).iushln(this.n).isub(this.p); - - this.tmp = this._tmp(); - } - - MPrime.prototype._tmp = function _tmp () { - var tmp = new BN(null); - tmp.words = new Array(Math.ceil(this.n / 13)); - return tmp; - }; - - MPrime.prototype.ireduce = function ireduce (num) { - // Assumes that `num` is less than `P^2` - // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) - var r = num; - var rlen; - - do { - this.split(r, this.tmp); - r = this.imulK(r); - r = r.iadd(this.tmp); - rlen = r.bitLength(); - } while (rlen > this.n); - - var cmp = rlen < this.n ? -1 : r.ucmp(this.p); - if (cmp === 0) { - r.words[0] = 0; - r.length = 1; - } else if (cmp > 0) { - r.isub(this.p); - } else { - if (r.strip !== undefined) { - // r is BN v4 instance - r.strip(); - } else { - // r is BN v5 instance - r._strip(); - } - } - - return r; - }; - - MPrime.prototype.split = function split (input, out) { - input.iushrn(this.n, 0, out); - }; - - MPrime.prototype.imulK = function imulK (num) { - return num.imul(this.k); - }; - - function K256 () { - MPrime.call( - this, - 'k256', - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); - } - inherits(K256, MPrime); - - K256.prototype.split = function split (input, output) { - // 256 = 9 * 26 + 22 - var mask = 0x3fffff; - - var outLen = Math.min(input.length, 9); - for (var i = 0; i < outLen; i++) { - output.words[i] = input.words[i]; - } - output.length = outLen; - - if (input.length <= 9) { - input.words[0] = 0; - input.length = 1; - return; - } - - // Shift by 9 limbs - var prev = input.words[9]; - output.words[output.length++] = prev & mask; - - for (i = 10; i < input.length; i++) { - var next = input.words[i] | 0; - input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); - prev = next; - } - prev >>>= 22; - input.words[i - 10] = prev; - if (prev === 0 && input.length > 10) { - input.length -= 10; - } else { - input.length -= 9; - } - }; - - K256.prototype.imulK = function imulK (num) { - // K = 0x1000003d1 = [ 0x40, 0x3d1 ] - num.words[num.length] = 0; - num.words[num.length + 1] = 0; - num.length += 2; - - // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 - var lo = 0; - for (var i = 0; i < num.length; i++) { - var w = num.words[i] | 0; - lo += w * 0x3d1; - num.words[i] = lo & 0x3ffffff; - lo = w * 0x40 + ((lo / 0x4000000) | 0); - } - - // Fast length reduction - if (num.words[num.length - 1] === 0) { - num.length--; - if (num.words[num.length - 1] === 0) { - num.length--; - } - } - return num; - }; - - function P224 () { - MPrime.call( - this, - 'p224', - 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); - } - inherits(P224, MPrime); - - function P192 () { - MPrime.call( - this, - 'p192', - 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); - } - inherits(P192, MPrime); - - function P25519 () { - // 2 ^ 255 - 19 - MPrime.call( - this, - '25519', - '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); - } - inherits(P25519, MPrime); - - P25519.prototype.imulK = function imulK (num) { - // K = 0x13 - var carry = 0; - for (var i = 0; i < num.length; i++) { - var hi = (num.words[i] | 0) * 0x13 + carry; - var lo = hi & 0x3ffffff; - hi >>>= 26; - - num.words[i] = lo; - carry = hi; - } - if (carry !== 0) { - num.words[num.length++] = carry; - } - return num; - }; - - // Exported mostly for testing purposes, use plain name instead - BN._prime = function prime (name) { - // Cached version of prime - if (primes[name]) return primes[name]; - - var prime; - if (name === 'k256') { - prime = new K256(); - } else if (name === 'p224') { - prime = new P224(); - } else if (name === 'p192') { - prime = new P192(); - } else if (name === 'p25519') { - prime = new P25519(); - } else { - throw new Error('Unknown prime ' + name); - } - primes[name] = prime; - - return prime; - }; - - // - // Base reduction engine - // - function Red (m) { - if (typeof m === 'string') { - var prime = BN._prime(m); - this.m = prime.p; - this.prime = prime; - } else { - assert(m.gtn(1), 'modulus must be greater than 1'); - this.m = m; - this.prime = null; - } - } - - Red.prototype._verify1 = function _verify1 (a) { - assert(a.negative === 0, 'red works only with positives'); - assert(a.red, 'red works only with red numbers'); - }; - - Red.prototype._verify2 = function _verify2 (a, b) { - assert((a.negative | b.negative) === 0, 'red works only with positives'); - assert(a.red && a.red === b.red, - 'red works only with red numbers'); - }; - - Red.prototype.imod = function imod (a) { - if (this.prime) return this.prime.ireduce(a)._forceRed(this); - return a.umod(this.m)._forceRed(this); - }; - - Red.prototype.neg = function neg (a) { - if (a.isZero()) { - return a.clone(); - } - - return this.m.sub(a)._forceRed(this); - }; - - Red.prototype.add = function add (a, b) { - this._verify2(a, b); - - var res = a.add(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.iadd = function iadd (a, b) { - this._verify2(a, b); - - var res = a.iadd(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res; - }; - - Red.prototype.sub = function sub (a, b) { - this._verify2(a, b); - - var res = a.sub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.isub = function isub (a, b) { - this._verify2(a, b); - - var res = a.isub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res; - }; - - Red.prototype.shl = function shl (a, num) { - this._verify1(a); - return this.imod(a.ushln(num)); - }; - - Red.prototype.imul = function imul (a, b) { - this._verify2(a, b); - return this.imod(a.imul(b)); - }; - - Red.prototype.mul = function mul (a, b) { - this._verify2(a, b); - return this.imod(a.mul(b)); - }; - - Red.prototype.isqr = function isqr (a) { - return this.imul(a, a.clone()); - }; - - Red.prototype.sqr = function sqr (a) { - return this.mul(a, a); - }; - - Red.prototype.sqrt = function sqrt (a) { - if (a.isZero()) return a.clone(); - - var mod3 = this.m.andln(3); - assert(mod3 % 2 === 1); - - // Fast case - if (mod3 === 3) { - var pow = this.m.add(new BN(1)).iushrn(2); - return this.pow(a, pow); - } - - // Tonelli-Shanks algorithm (Totally unoptimized and slow) - // - // Find Q and S, that Q * 2 ^ S = (P - 1) - var q = this.m.subn(1); - var s = 0; - while (!q.isZero() && q.andln(1) === 0) { - s++; - q.iushrn(1); - } - assert(!q.isZero()); - - var one = new BN(1).toRed(this); - var nOne = one.redNeg(); - - // Find quadratic non-residue - // NOTE: Max is such because of generalized Riemann hypothesis. - var lpow = this.m.subn(1).iushrn(1); - var z = this.m.bitLength(); - z = new BN(2 * z * z).toRed(this); - - while (this.pow(z, lpow).cmp(nOne) !== 0) { - z.redIAdd(nOne); - } - - var c = this.pow(z, q); - var r = this.pow(a, q.addn(1).iushrn(1)); - var t = this.pow(a, q); - var m = s; - while (t.cmp(one) !== 0) { - var tmp = t; - for (var i = 0; tmp.cmp(one) !== 0; i++) { - tmp = tmp.redSqr(); - } - assert(i < m); - var b = this.pow(c, new BN(1).iushln(m - i - 1)); - - r = r.redMul(b); - c = b.redSqr(); - t = t.redMul(c); - m = i; - } - - return r; - }; - - Red.prototype.invm = function invm (a) { - var inv = a._invmp(this.m); - if (inv.negative !== 0) { - inv.negative = 0; - return this.imod(inv).redNeg(); - } else { - return this.imod(inv); - } - }; - - Red.prototype.pow = function pow (a, num) { - if (num.isZero()) return new BN(1).toRed(this); - if (num.cmpn(1) === 0) return a.clone(); - - var windowSize = 4; - var wnd = new Array(1 << windowSize); - wnd[0] = new BN(1).toRed(this); - wnd[1] = a; - for (var i = 2; i < wnd.length; i++) { - wnd[i] = this.mul(wnd[i - 1], a); - } - - var res = wnd[0]; - var current = 0; - var currentLen = 0; - var start = num.bitLength() % 26; - if (start === 0) { - start = 26; - } - - for (i = num.length - 1; i >= 0; i--) { - var word = num.words[i]; - for (var j = start - 1; j >= 0; j--) { - var bit = (word >> j) & 1; - if (res !== wnd[0]) { - res = this.sqr(res); - } - - if (bit === 0 && current === 0) { - currentLen = 0; - continue; - } - - current <<= 1; - current |= bit; - currentLen++; - if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; - - res = this.mul(res, wnd[current]); - currentLen = 0; - current = 0; - } - start = 26; - } - - return res; - }; - - Red.prototype.convertTo = function convertTo (num) { - var r = num.umod(this.m); - - return r === num ? r.clone() : r; - }; - - Red.prototype.convertFrom = function convertFrom (num) { - var res = num.clone(); - res.red = null; - return res; - }; - - // - // Montgomery method engine - // - - BN.mont = function mont (num) { - return new Mont(num); - }; - - function Mont (m) { - Red.call(this, m); - - this.shift = this.m.bitLength(); - if (this.shift % 26 !== 0) { - this.shift += 26 - (this.shift % 26); - } - - this.r = new BN(1).iushln(this.shift); - this.r2 = this.imod(this.r.sqr()); - this.rinv = this.r._invmp(this.m); - - this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); - this.minv = this.minv.umod(this.r); - this.minv = this.r.sub(this.minv); - } - inherits(Mont, Red); - - Mont.prototype.convertTo = function convertTo (num) { - return this.imod(num.ushln(this.shift)); - }; - - Mont.prototype.convertFrom = function convertFrom (num) { - var r = this.imod(num.mul(this.rinv)); - r.red = null; - return r; - }; - - Mont.prototype.imul = function imul (a, b) { - if (a.isZero() || b.isZero()) { - a.words[0] = 0; - a.length = 1; - return a; - } - - var t = a.imul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.mul = function mul (a, b) { - if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); - - var t = a.mul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.invm = function invm (a) { - // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R - var res = this.imod(a._invmp(this.m).mul(this.r2)); - return res._forceRed(this); - }; -})( false || module, this); - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/EbmlStreamDecoder.js": -/*!***********************************************************!*\ - !*** ./node_modules/ebml-stream/lib/EbmlStreamDecoder.js ***! - \***********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const stream_1 = __webpack_require__(/*! stream */ "./node_modules/stream-browserify/index.js"); -const tools_1 = __webpack_require__(/*! ./tools */ "./node_modules/ebml-stream/lib/tools.js"); -const EbmlElementType_1 = __webpack_require__(/*! ./models/enums/EbmlElementType */ "./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js"); -const EbmlTagPosition_1 = __webpack_require__(/*! ./models/enums/EbmlTagPosition */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js"); -const EbmlTagFactory_1 = __webpack_require__(/*! ./models/EbmlTagFactory */ "./node_modules/ebml-stream/lib/models/EbmlTagFactory.js"); -class EbmlStreamDecoderOptions { - constructor() { - this.bufferTagIds = []; - } -} -exports.EbmlStreamDecoderOptions = EbmlStreamDecoderOptions; -class EbmlStreamDecoder extends stream_1.Transform { - constructor(options = {}) { - super(Object.assign({}, options, { readableObjectMode: true })); - this._currentBufferOffset = 0; - this._tagStack = []; - this._buffer = Buffer.alloc(0); - this._bufferTagIds = []; - this._bufferTagIds = options.bufferTagIds || []; - } - get buffer() { - return this._buffer; - } - _transform(chunk, enc, done) { - this._buffer = Buffer.concat([this._buffer, Buffer.from(chunk)]); - while (this.parseTags()) - ; - done(); - } - parseTags() { - const currentTag = this.readTagHeader(this._buffer); - if (!currentTag) { - return false; - } - if (currentTag.type === EbmlElementType_1.EbmlElementType.Master && !this._bufferTagIds.some(i => i === currentTag.id)) { - this._tagStack.push(currentTag); - this.emitTag(currentTag, EbmlTagPosition_1.EbmlTagPosition.Start); - this.advanceBuffer(currentTag.tagHeaderLength); - return true; - } - else { - if (this._buffer.length < currentTag.tagHeaderLength + currentTag.size) { - return false; - } - const data = this._buffer.slice(currentTag.tagHeaderLength, currentTag.tagHeaderLength + currentTag.size); - this.emitTag(currentTag, EbmlTagPosition_1.EbmlTagPosition.Content, data); - this.advanceBuffer(currentTag.tagHeaderLength + currentTag.size); - while (this._tagStack.length > 0) { - const nextTag = this._tagStack[this._tagStack.length - 1]; - if (this._currentBufferOffset < (nextTag.absoluteStart + nextTag.tagHeaderLength + nextTag.size)) { - break; - } - this.emitTag(nextTag, EbmlTagPosition_1.EbmlTagPosition.End); - this._tagStack.pop(); - } - } - return true; - } - advanceBuffer(length) { - this._currentBufferOffset += length; - this._buffer = this._buffer.slice(length); - } - readTagHeader(buffer, offset = 0) { - if (buffer.length == 0) { - return null; - } - const tag = tools_1.Tools.readVint(buffer, offset); - if (tag == null) { - return null; - } - const size = tools_1.Tools.readVint(buffer, offset + tag.length); - if (size == null) { - return null; - } - const tagIdHex = tools_1.Tools.readHexString(buffer, offset, offset + tag.length); - const tagId = Number.parseInt(tagIdHex, 16); - let tagObject = EbmlTagFactory_1.EbmlTagFactory.create(tagId); - tagObject.size = size.value; - return Object.assign(tagObject, { - absoluteStart: this._currentBufferOffset + offset, - tagHeaderLength: tag.length + size.length - }); - } - emitTag(tag, position, data) { - let emittedTag = EbmlTagFactory_1.EbmlTagFactory.create(tag.id); - emittedTag.size = tag.size; - emittedTag.position = position; - if (position === EbmlTagPosition_1.EbmlTagPosition.Content) { - emittedTag.parseContent(data); - } - this.push(emittedTag); - } -} -exports.EbmlStreamDecoder = EbmlStreamDecoder; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/EbmlStreamEncoder.js": -/*!***********************************************************!*\ - !*** ./node_modules/ebml-stream/lib/EbmlStreamEncoder.js ***! - \***********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const stream_1 = __webpack_require__(/*! stream */ "./node_modules/stream-browserify/index.js"); -const EbmlTagPosition_1 = __webpack_require__(/*! ./models/enums/EbmlTagPosition */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js"); -const EbmlTagId_1 = __webpack_require__(/*! ./models/enums/EbmlTagId */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js"); -class EbmlStreamEncoder extends stream_1.Transform { - constructor(options = {}) { - super(Object.assign({}, options, { writableObjectMode: true })); - this.dataBuffer = Buffer.alloc(0); - this.mCorked = false; - this.openTags = []; - } - _transform(chunk, enc, done) { - if (chunk) { - if (!chunk.id) { - throw new Error(`No id found for ${JSON.stringify(chunk)}`); - } - switch (chunk.position) { - case EbmlTagPosition_1.EbmlTagPosition.Start: - this.startTag(chunk); - break; - case EbmlTagPosition_1.EbmlTagPosition.Content: - this.writeTag(chunk); - break; - case EbmlTagPosition_1.EbmlTagPosition.End: - this.endTag(chunk); - break; - default: - break; - } - } - done(); - } - bufferAndFlush(buffer) { - this.dataBuffer = Buffer.concat([this.dataBuffer, buffer]); - this._flush(() => { }); - } - _flush(callback) { - let chunk = null; - if (this.dataBuffer.length > 0 && !this.mCorked) { - chunk = Buffer.from(this.dataBuffer); - this.dataBuffer = Buffer.alloc(0); - this.push(chunk); - } - callback(); - } - _bufferAndFlush(buffer) { - this.bufferAndFlush(buffer); - } - flush() { - this._flush(() => { }); - } - get buffer() { - return this.dataBuffer; - } - set buffer(val) { - this.dataBuffer = val; - } - get stack() { - return this.openTags; - } - cork() { - this.mCorked = true; - } - uncork() { - this.mCorked = false; - this._flush(() => { }); - } - writeTag(tag) { - if (this.openTags.length > 0) { - this.openTags[this.openTags.length - 1].Children.push(tag); - } - else { - this.bufferAndFlush(tag.encode()); - } - } - startTag(tag) { - if (this.openTags.length > 0) { - this.openTags[this.openTags.length - 1].Children.push(tag); - } - this.openTags.push(tag); - } - endTag(tag) { - const inMemoryTag = this.openTags.pop(); - if (tag.id !== inMemoryTag.id) { - throw `Logic error - closing tag "${EbmlTagId_1.EbmlTagId[tag.id]}" is not expected tag "${EbmlTagId_1.EbmlTagId[inMemoryTag.id]}"`; - } - if (this.openTags.length < 1) { - this.bufferAndFlush(inMemoryTag.encode()); - } - } -} -exports.EbmlStreamEncoder = EbmlStreamEncoder; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/index.js": -/*!***********************************************!*\ - !*** ./node_modules/ebml-stream/lib/index.js ***! - \***********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -var tools_1 = __webpack_require__(/*! ./tools */ "./node_modules/ebml-stream/lib/tools.js"); -exports.Tools = tools_1.Tools; -var EbmlStreamDecoder_1 = __webpack_require__(/*! ./EbmlStreamDecoder */ "./node_modules/ebml-stream/lib/EbmlStreamDecoder.js"); -exports.EbmlStreamDecoder = EbmlStreamDecoder_1.EbmlStreamDecoder; -var EbmlStreamEncoder_1 = __webpack_require__(/*! ./EbmlStreamEncoder */ "./node_modules/ebml-stream/lib/EbmlStreamEncoder.js"); -exports.EbmlStreamEncoder = EbmlStreamEncoder_1.EbmlStreamEncoder; -var Block_1 = __webpack_require__(/*! ./models/tags/Block */ "./node_modules/ebml-stream/lib/models/tags/Block.js"); -exports.Block = Block_1.Block; -var BlockLacing_1 = __webpack_require__(/*! ./models/enums/BlockLacing */ "./node_modules/ebml-stream/lib/models/enums/BlockLacing.js"); -exports.BlockLacing = BlockLacing_1.BlockLacing; -var EbmlDataTag_1 = __webpack_require__(/*! ./models/tags/EbmlDataTag */ "./node_modules/ebml-stream/lib/models/tags/EbmlDataTag.js"); -exports.EbmlDataTag = EbmlDataTag_1.EbmlDataTag; -var EbmlElementType_1 = __webpack_require__(/*! ./models/enums/EbmlElementType */ "./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js"); -exports.EbmlElementType = EbmlElementType_1.EbmlElementType; -var EbmlMasterTag_1 = __webpack_require__(/*! ./models/tags/EbmlMasterTag */ "./node_modules/ebml-stream/lib/models/tags/EbmlMasterTag.js"); -exports.EbmlMasterTag = EbmlMasterTag_1.EbmlMasterTag; -var EbmlTag_1 = __webpack_require__(/*! ./models/EbmlTag */ "./node_modules/ebml-stream/lib/models/EbmlTag.js"); -exports.EbmlTag = EbmlTag_1.EbmlTag; -var EbmlTagFactory_1 = __webpack_require__(/*! ./models/EbmlTagFactory */ "./node_modules/ebml-stream/lib/models/EbmlTagFactory.js"); -exports.EbmlTagFactory = EbmlTagFactory_1.EbmlTagFactory; -var EbmlTagId_1 = __webpack_require__(/*! ./models/enums/EbmlTagId */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js"); -exports.EbmlTagId = EbmlTagId_1.EbmlTagId; -var EbmlTagPosition_1 = __webpack_require__(/*! ./models/enums/EbmlTagPosition */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js"); -exports.EbmlTagPosition = EbmlTagPosition_1.EbmlTagPosition; -var SimpleBlock_1 = __webpack_require__(/*! ./models/tags/SimpleBlock */ "./node_modules/ebml-stream/lib/models/tags/SimpleBlock.js"); -exports.SimpleBlock = SimpleBlock_1.SimpleBlock; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/EbmlTag.js": -/*!********************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/EbmlTag.js ***! - \********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const EbmlTagId_1 = __webpack_require__(/*! ./enums/EbmlTagId */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js"); -const tools_1 = __webpack_require__(/*! ../tools */ "./node_modules/ebml-stream/lib/tools.js"); -class EbmlTag { - constructor(id, type, position) { - this.id = id; - this.type = type; - this.position = position; - } - getTagDeclaration() { - let tagHex = this.id.toString(16); - if (tagHex.length % 2 !== 0) { - tagHex = `0${tagHex}`; - } - return Buffer.from(tagHex, 'hex'); - } - encode() { - let vintSize = null; - let content = this.encodeContent(); - if (this.size === -1) { - vintSize = Buffer.from('01ffffffffffffff', 'hex'); - } - else { - let specialLength = undefined; - if ([ - EbmlTagId_1.EbmlTagId.Segment, - EbmlTagId_1.EbmlTagId.Cluster - ].some(i => i === this.id)) { - specialLength = 8; - } - vintSize = tools_1.Tools.writeVint(content.length, specialLength); - } - return Buffer.concat([ - this.getTagDeclaration(), - vintSize, - content - ]); - } -} -exports.EbmlTag = EbmlTag; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/EbmlTagFactory.js": -/*!***************************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/EbmlTagFactory.js ***! - \***************************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const EbmlTagId_1 = __webpack_require__(/*! ./enums/EbmlTagId */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js"); -const EbmlMasterTag_1 = __webpack_require__(/*! ./tags/EbmlMasterTag */ "./node_modules/ebml-stream/lib/models/tags/EbmlMasterTag.js"); -const EbmlDataTag_1 = __webpack_require__(/*! ./tags/EbmlDataTag */ "./node_modules/ebml-stream/lib/models/tags/EbmlDataTag.js"); -const Block_1 = __webpack_require__(/*! ./tags/Block */ "./node_modules/ebml-stream/lib/models/tags/Block.js"); -const SimpleBlock_1 = __webpack_require__(/*! ./tags/SimpleBlock */ "./node_modules/ebml-stream/lib/models/tags/SimpleBlock.js"); -const EbmlElementType_1 = __webpack_require__(/*! ./enums/EbmlElementType */ "./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js"); -class EbmlTagFactory { - static create(id, type) { - if (EbmlTagId_1.EbmlTagId[id] !== undefined) { - let foundType; - switch (id) { - case EbmlTagId_1.EbmlTagId.Block: - return new Block_1.Block(); - case EbmlTagId_1.EbmlTagId.SimpleBlock: - return new SimpleBlock_1.SimpleBlock(); - case EbmlTagId_1.EbmlTagId.ChapterDisplay: - case EbmlTagId_1.EbmlTagId.ContentCompression: - case EbmlTagId_1.EbmlTagId.ContentEncryption: - case EbmlTagId_1.EbmlTagId.SilentTracks: - case EbmlTagId_1.EbmlTagId.ContentEncoding: - case EbmlTagId_1.EbmlTagId.TrackTranslate: - case EbmlTagId_1.EbmlTagId.ChapProcessCommand: - case EbmlTagId_1.EbmlTagId.ChapterTranslate: - case EbmlTagId_1.EbmlTagId.ChapProcess: - case EbmlTagId_1.EbmlTagId.Tag: - case EbmlTagId_1.EbmlTagId.Segment: - case EbmlTagId_1.EbmlTagId.SimpleTag: - case EbmlTagId_1.EbmlTagId.Targets: - case EbmlTagId_1.EbmlTagId.Tags: - case EbmlTagId_1.EbmlTagId.ChapterTrack: - case EbmlTagId_1.EbmlTagId.ChapterAtom: - case EbmlTagId_1.EbmlTagId.EditionEntry: - case EbmlTagId_1.EbmlTagId.Chapters: - case EbmlTagId_1.EbmlTagId.AttachedFile: - case EbmlTagId_1.EbmlTagId.Attachments: - case EbmlTagId_1.EbmlTagId.CueReference: - case EbmlTagId_1.EbmlTagId.CueTrackPositions: - case EbmlTagId_1.EbmlTagId.CuePoint: - case EbmlTagId_1.EbmlTagId.Cues: - case EbmlTagId_1.EbmlTagId.ContentEncAESSettings: - case EbmlTagId_1.EbmlTagId.ContentEncodings: - case EbmlTagId_1.EbmlTagId.TrackJoinBlocks: - case EbmlTagId_1.EbmlTagId.TrackPlane: - case EbmlTagId_1.EbmlTagId.TrackCombinePlanes: - case EbmlTagId_1.EbmlTagId.TrackOperation: - case EbmlTagId_1.EbmlTagId.Audio: - case EbmlTagId_1.EbmlTagId.Video: - case EbmlTagId_1.EbmlTagId.TrackEntry: - case EbmlTagId_1.EbmlTagId.Tracks: - case EbmlTagId_1.EbmlTagId.ReferenceFrame: - case EbmlTagId_1.EbmlTagId.TimeSlice: - case EbmlTagId_1.EbmlTagId.Slices: - case EbmlTagId_1.EbmlTagId.BlockMore: - case EbmlTagId_1.EbmlTagId.BlockAdditions: - case EbmlTagId_1.EbmlTagId.BlockGroup: - case EbmlTagId_1.EbmlTagId.Cluster: - case EbmlTagId_1.EbmlTagId.Info: - case EbmlTagId_1.EbmlTagId.Seek: - case EbmlTagId_1.EbmlTagId.SeekHead: - case EbmlTagId_1.EbmlTagId.SignatureElementList: - case EbmlTagId_1.EbmlTagId.SignatureElements: - case EbmlTagId_1.EbmlTagId.SignatureSlot: - case EbmlTagId_1.EbmlTagId.EBML: - foundType = EbmlElementType_1.EbmlElementType.Master; - break; - case EbmlTagId_1.EbmlTagId.TrackType: - case EbmlTagId_1.EbmlTagId.FlagDefault: - case EbmlTagId_1.EbmlTagId.ChapterTrackNumber: - case EbmlTagId_1.EbmlTagId.ChapterTimeStart: - case EbmlTagId_1.EbmlTagId.ChapterTimeEnd: - case EbmlTagId_1.EbmlTagId.CueRefTime: - case EbmlTagId_1.EbmlTagId.CueRefCluster: - case EbmlTagId_1.EbmlTagId.ChapterFlagHidden: - case EbmlTagId_1.EbmlTagId.ContentCompAlgo: - case EbmlTagId_1.EbmlTagId.DocTypeReadVersion: - case EbmlTagId_1.EbmlTagId.EBMLVersion: - case EbmlTagId_1.EbmlTagId.DocTypeVersion: - case EbmlTagId_1.EbmlTagId.TagDefault: - case EbmlTagId_1.EbmlTagId.ChapterFlagEnabled: - case EbmlTagId_1.EbmlTagId.FileUsedStartTime: - case EbmlTagId_1.EbmlTagId.FileUsedEndTime: - case EbmlTagId_1.EbmlTagId.ContentEncodingOrder: - case EbmlTagId_1.EbmlTagId.ContentEncodingScope: - case EbmlTagId_1.EbmlTagId.ContentEncodingType: - case EbmlTagId_1.EbmlTagId.CueBlockNumber: - case EbmlTagId_1.EbmlTagId.BitDepth: - case EbmlTagId_1.EbmlTagId.ChapProcessTime: - case EbmlTagId_1.EbmlTagId.ChapProcessCodecID: - case EbmlTagId_1.EbmlTagId.AttachmentLink: - case EbmlTagId_1.EbmlTagId.TagAttachmentUID: - case EbmlTagId_1.EbmlTagId.TagChapterUID: - case EbmlTagId_1.EbmlTagId.TagEditionUID: - case EbmlTagId_1.EbmlTagId.TagTrackUID: - case EbmlTagId_1.EbmlTagId.TargetTypeValue: - case EbmlTagId_1.EbmlTagId.ChapterPhysicalEquiv: - case EbmlTagId_1.EbmlTagId.ChapterSegmentEditionUID: - case EbmlTagId_1.EbmlTagId.ChapterUID: - case EbmlTagId_1.EbmlTagId.EditionFlagOrdered: - case EbmlTagId_1.EbmlTagId.EditionFlagDefault: - case EbmlTagId_1.EbmlTagId.EditionFlagHidden: - case EbmlTagId_1.EbmlTagId.EditionUID: - case EbmlTagId_1.EbmlTagId.FileUID: - case EbmlTagId_1.EbmlTagId.CueRefCodecState: - case EbmlTagId_1.EbmlTagId.CueRefNumber: - case EbmlTagId_1.EbmlTagId.CueCodecState: - case EbmlTagId_1.EbmlTagId.CueDuration: - case EbmlTagId_1.EbmlTagId.CueRelativePosition: - case EbmlTagId_1.EbmlTagId.CueClusterPosition: - case EbmlTagId_1.EbmlTagId.CueTrack: - case EbmlTagId_1.EbmlTagId.CueTime: - case EbmlTagId_1.EbmlTagId.AESSettingsCipherMode: - case EbmlTagId_1.EbmlTagId.ContentSigHashAlgo: - case EbmlTagId_1.EbmlTagId.ContentSigAlgo: - case EbmlTagId_1.EbmlTagId.ContentEncAlgo: - case EbmlTagId_1.EbmlTagId.TrickMasterTrackUID: - case EbmlTagId_1.EbmlTagId.TrickTrackFlag: - case EbmlTagId_1.EbmlTagId.TrickTrackUID: - case EbmlTagId_1.EbmlTagId.TrackJoinUID: - case EbmlTagId_1.EbmlTagId.TrackPlaneType: - case EbmlTagId_1.EbmlTagId.TrackPlaneUID: - case EbmlTagId_1.EbmlTagId.Channels: - case EbmlTagId_1.EbmlTagId.AspectRatioType: - case EbmlTagId_1.EbmlTagId.DisplayUnit: - case EbmlTagId_1.EbmlTagId.DisplayHeight: - case EbmlTagId_1.EbmlTagId.DisplayWidth: - case EbmlTagId_1.EbmlTagId.PixelCropRight: - case EbmlTagId_1.EbmlTagId.PixelCropLeft: - case EbmlTagId_1.EbmlTagId.PixelCropTop: - case EbmlTagId_1.EbmlTagId.PixelCropBottom: - case EbmlTagId_1.EbmlTagId.PixelHeight: - case EbmlTagId_1.EbmlTagId.PixelWidth: - case EbmlTagId_1.EbmlTagId.OldStereoMode: - case EbmlTagId_1.EbmlTagId.AlphaMode: - case EbmlTagId_1.EbmlTagId.StereoMode: - case EbmlTagId_1.EbmlTagId.FlagInterlaced: - case EbmlTagId_1.EbmlTagId.TrackTranslateCodec: - case EbmlTagId_1.EbmlTagId.TrackTranslateEditionUID: - case EbmlTagId_1.EbmlTagId.SeekPreRoll: - case EbmlTagId_1.EbmlTagId.CodecDelay: - case EbmlTagId_1.EbmlTagId.TrackOverlay: - case EbmlTagId_1.EbmlTagId.CodecDecodeAll: - case EbmlTagId_1.EbmlTagId.MaxBlockAdditionID: - case EbmlTagId_1.EbmlTagId.DefaultDecodedFieldDuration: - case EbmlTagId_1.EbmlTagId.DefaultDuration: - case EbmlTagId_1.EbmlTagId.MaxCache: - case EbmlTagId_1.EbmlTagId.MinCache: - case EbmlTagId_1.EbmlTagId.FlagLacing: - case EbmlTagId_1.EbmlTagId.FlagForced: - case EbmlTagId_1.EbmlTagId.FlagEnabled: - case EbmlTagId_1.EbmlTagId.TrackUID: - case EbmlTagId_1.EbmlTagId.TrackNumber: - case EbmlTagId_1.EbmlTagId.ReferenceTimeCode: - case EbmlTagId_1.EbmlTagId.ReferenceOffset: - case EbmlTagId_1.EbmlTagId.SliceDuration: - case EbmlTagId_1.EbmlTagId.Delay: - case EbmlTagId_1.EbmlTagId.BlockAdditionID: - case EbmlTagId_1.EbmlTagId.FrameNumber: - case EbmlTagId_1.EbmlTagId.LaceNumber: - case EbmlTagId_1.EbmlTagId.ReferencePriority: - case EbmlTagId_1.EbmlTagId.BlockDuration: - case EbmlTagId_1.EbmlTagId.BlockAddID: - case EbmlTagId_1.EbmlTagId.PrevSize: - case EbmlTagId_1.EbmlTagId.Position: - case EbmlTagId_1.EbmlTagId.SilentTrackNumber: - case EbmlTagId_1.EbmlTagId.Timecode: - case EbmlTagId_1.EbmlTagId.TimecodeScaleDenominator: - case EbmlTagId_1.EbmlTagId.TimecodeScale: - case EbmlTagId_1.EbmlTagId.ChapterTranslateCodec: - case EbmlTagId_1.EbmlTagId.ChapterTranslateEditionUID: - case EbmlTagId_1.EbmlTagId.SeekPosition: - case EbmlTagId_1.EbmlTagId.SignatureHash: - case EbmlTagId_1.EbmlTagId.SignatureAlgo: - case EbmlTagId_1.EbmlTagId.EBMLMaxSizeLength: - case EbmlTagId_1.EbmlTagId.EBMLMaxIDLength: - case EbmlTagId_1.EbmlTagId.EBMLReadVersion: - foundType = EbmlElementType_1.EbmlElementType.UnsignedInt; - break; - case EbmlTagId_1.EbmlTagId.TrackOffset: - case EbmlTagId_1.EbmlTagId.DiscardPadding: - case EbmlTagId_1.EbmlTagId.ReferenceVirtual: - case EbmlTagId_1.EbmlTagId.ReferenceBlock: - foundType = EbmlElementType_1.EbmlElementType.Integer; - break; - case EbmlTagId_1.EbmlTagId.CodecID: - case EbmlTagId_1.EbmlTagId.DocType: - case EbmlTagId_1.EbmlTagId.FileMimeType: - case EbmlTagId_1.EbmlTagId.TagLanguage: - case EbmlTagId_1.EbmlTagId.TargetType: - case EbmlTagId_1.EbmlTagId.ChapCountry: - case EbmlTagId_1.EbmlTagId.ChapLanguage: - case EbmlTagId_1.EbmlTagId.CodecDownloadURL: - case EbmlTagId_1.EbmlTagId.CodecInfoURL: - case EbmlTagId_1.EbmlTagId.Language: - foundType = EbmlElementType_1.EbmlElementType.String; - break; - case EbmlTagId_1.EbmlTagId.ChapString: - case EbmlTagId_1.EbmlTagId.TagString: - case EbmlTagId_1.EbmlTagId.ChapterStringUID: - case EbmlTagId_1.EbmlTagId.WritingApp: - case EbmlTagId_1.EbmlTagId.SegmentFilename: - case EbmlTagId_1.EbmlTagId.CodecName: - case EbmlTagId_1.EbmlTagId.TagName: - case EbmlTagId_1.EbmlTagId.FileName: - case EbmlTagId_1.EbmlTagId.FileDescription: - case EbmlTagId_1.EbmlTagId.CodecSettings: - case EbmlTagId_1.EbmlTagId.Name: - case EbmlTagId_1.EbmlTagId.MuxingApp: - case EbmlTagId_1.EbmlTagId.Title: - case EbmlTagId_1.EbmlTagId.NextFilename: - case EbmlTagId_1.EbmlTagId.PrevFilename: - foundType = EbmlElementType_1.EbmlElementType.UTF8; - break; - case EbmlTagId_1.EbmlTagId.ContentCompSettings: - case EbmlTagId_1.EbmlTagId.SegmentFamily: - case EbmlTagId_1.EbmlTagId.TagBinary: - case EbmlTagId_1.EbmlTagId.FileReferral: - case EbmlTagId_1.EbmlTagId.SignedElement: - case EbmlTagId_1.EbmlTagId.ChapProcessData: - case EbmlTagId_1.EbmlTagId.ChapProcessPrivate: - case EbmlTagId_1.EbmlTagId.ChapterSegmentUID: - case EbmlTagId_1.EbmlTagId.FileData: - case EbmlTagId_1.EbmlTagId.ContentSigKeyID: - case EbmlTagId_1.EbmlTagId.ContentSignature: - case EbmlTagId_1.EbmlTagId.ContentEncKeyID: - case EbmlTagId_1.EbmlTagId.TrickMasterTrackSegmentUID: - case EbmlTagId_1.EbmlTagId.TrickTrackSegmentUID: - case EbmlTagId_1.EbmlTagId.ChannelPositions: - case EbmlTagId_1.EbmlTagId.ColourSpace: - case EbmlTagId_1.EbmlTagId.TrackTranslateTrackID: - case EbmlTagId_1.EbmlTagId.CodecPrivate: - case EbmlTagId_1.EbmlTagId.EncryptedBlock: - case EbmlTagId_1.EbmlTagId.CodecState: - case EbmlTagId_1.EbmlTagId.BlockAdditional: - case EbmlTagId_1.EbmlTagId.BlockVirtual: - case EbmlTagId_1.EbmlTagId.ChapterTranslateID: - case EbmlTagId_1.EbmlTagId.NextUID: - case EbmlTagId_1.EbmlTagId.PrevUID: - case EbmlTagId_1.EbmlTagId.SegmentUID: - case EbmlTagId_1.EbmlTagId.SeekID: - case EbmlTagId_1.EbmlTagId.Signature: - case EbmlTagId_1.EbmlTagId.SignaturePublicKey: - case EbmlTagId_1.EbmlTagId.CRC32: - case EbmlTagId_1.EbmlTagId.Void: - foundType = EbmlElementType_1.EbmlElementType.Binary; - break; - case EbmlTagId_1.EbmlTagId.Duration: - case EbmlTagId_1.EbmlTagId.OutputSamplingFrequency: - case EbmlTagId_1.EbmlTagId.SamplingFrequency: - case EbmlTagId_1.EbmlTagId.FrameRate: - case EbmlTagId_1.EbmlTagId.GammaValue: - case EbmlTagId_1.EbmlTagId.TrackTimecodeScale: - foundType = EbmlElementType_1.EbmlElementType.Float; - break; - case EbmlTagId_1.EbmlTagId.DateUTC: - foundType = EbmlElementType_1.EbmlElementType.Date; - break; - } - if (type === undefined) { - type = foundType; - } - else { - if (type !== foundType) { - throw new Error(`Trying to create tag of well-known type "${EbmlTagId_1.EbmlTagId[id]}" using content type "${type}" (which is incorrect). Either pass the correct type or ignore the type parameter to EbmlTag.create()`); - } - } - } - switch (type) { - case EbmlElementType_1.EbmlElementType.Master: - return new EbmlMasterTag_1.EbmlMasterTag(id); - case EbmlElementType_1.EbmlElementType.UTF8: - case EbmlElementType_1.EbmlElementType.Binary: - case EbmlElementType_1.EbmlElementType.Date: - case EbmlElementType_1.EbmlElementType.Float: - case EbmlElementType_1.EbmlElementType.Integer: - case EbmlElementType_1.EbmlElementType.String: - case EbmlElementType_1.EbmlElementType.UnsignedInt: - default: - return new EbmlDataTag_1.EbmlDataTag(id, type); - } - } -} -exports.EbmlTagFactory = EbmlTagFactory; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/enums/BlockLacing.js": -/*!******************************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/enums/BlockLacing.js ***! - \******************************************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -var BlockLacing; -(function (BlockLacing) { - BlockLacing[BlockLacing["None"] = 0] = "None"; - BlockLacing[BlockLacing["Xiph"] = 1] = "Xiph"; - BlockLacing[BlockLacing["EBML"] = 2] = "EBML"; - BlockLacing[BlockLacing["FixedSize"] = 3] = "FixedSize"; -})(BlockLacing = exports.BlockLacing || (exports.BlockLacing = {})); - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js": -/*!**********************************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js ***! - \**********************************************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -var EbmlElementType; -(function (EbmlElementType) { - EbmlElementType["Master"] = "m"; - EbmlElementType["UnsignedInt"] = "u"; - EbmlElementType["Integer"] = "i"; - EbmlElementType["String"] = "s"; - EbmlElementType["UTF8"] = "8"; - EbmlElementType["Binary"] = "b"; - EbmlElementType["Float"] = "f"; - EbmlElementType["Date"] = "d"; -})(EbmlElementType = exports.EbmlElementType || (exports.EbmlElementType = {})); - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js": -/*!****************************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js ***! - \****************************************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -var EbmlTagId; -(function (EbmlTagId) { - EbmlTagId[EbmlTagId["ChapterDisplay"] = 128] = "ChapterDisplay"; - EbmlTagId[EbmlTagId["TrackType"] = 131] = "TrackType"; - EbmlTagId[EbmlTagId["ChapString"] = 133] = "ChapString"; - EbmlTagId[EbmlTagId["CodecID"] = 134] = "CodecID"; - EbmlTagId[EbmlTagId["FlagDefault"] = 136] = "FlagDefault"; - EbmlTagId[EbmlTagId["ChapterTrackNumber"] = 137] = "ChapterTrackNumber"; - EbmlTagId[EbmlTagId["ChapterTimeStart"] = 145] = "ChapterTimeStart"; - EbmlTagId[EbmlTagId["ChapterTimeEnd"] = 146] = "ChapterTimeEnd"; - EbmlTagId[EbmlTagId["CueRefTime"] = 150] = "CueRefTime"; - EbmlTagId[EbmlTagId["CueRefCluster"] = 151] = "CueRefCluster"; - EbmlTagId[EbmlTagId["ChapterFlagHidden"] = 152] = "ChapterFlagHidden"; - EbmlTagId[EbmlTagId["ContentCompAlgo"] = 16980] = "ContentCompAlgo"; - EbmlTagId[EbmlTagId["ContentCompSettings"] = 16981] = "ContentCompSettings"; - EbmlTagId[EbmlTagId["DocType"] = 17026] = "DocType"; - EbmlTagId[EbmlTagId["DocTypeReadVersion"] = 17029] = "DocTypeReadVersion"; - EbmlTagId[EbmlTagId["EBMLVersion"] = 17030] = "EBMLVersion"; - EbmlTagId[EbmlTagId["DocTypeVersion"] = 17031] = "DocTypeVersion"; - EbmlTagId[EbmlTagId["SegmentFamily"] = 17476] = "SegmentFamily"; - EbmlTagId[EbmlTagId["DateUTC"] = 17505] = "DateUTC"; - EbmlTagId[EbmlTagId["TagDefault"] = 17540] = "TagDefault"; - EbmlTagId[EbmlTagId["TagBinary"] = 17541] = "TagBinary"; - EbmlTagId[EbmlTagId["TagString"] = 17543] = "TagString"; - EbmlTagId[EbmlTagId["Duration"] = 17545] = "Duration"; - EbmlTagId[EbmlTagId["ChapterFlagEnabled"] = 17816] = "ChapterFlagEnabled"; - EbmlTagId[EbmlTagId["FileMimeType"] = 18016] = "FileMimeType"; - EbmlTagId[EbmlTagId["FileUsedStartTime"] = 18017] = "FileUsedStartTime"; - EbmlTagId[EbmlTagId["FileUsedEndTime"] = 18018] = "FileUsedEndTime"; - EbmlTagId[EbmlTagId["FileReferral"] = 18037] = "FileReferral"; - EbmlTagId[EbmlTagId["ContentEncodingOrder"] = 20529] = "ContentEncodingOrder"; - EbmlTagId[EbmlTagId["ContentEncodingScope"] = 20530] = "ContentEncodingScope"; - EbmlTagId[EbmlTagId["ContentEncodingType"] = 20531] = "ContentEncodingType"; - EbmlTagId[EbmlTagId["ContentCompression"] = 20532] = "ContentCompression"; - EbmlTagId[EbmlTagId["ContentEncryption"] = 20533] = "ContentEncryption"; - EbmlTagId[EbmlTagId["CueBlockNumber"] = 21368] = "CueBlockNumber"; - EbmlTagId[EbmlTagId["ChapterStringUID"] = 22100] = "ChapterStringUID"; - EbmlTagId[EbmlTagId["WritingApp"] = 22337] = "WritingApp"; - EbmlTagId[EbmlTagId["SilentTracks"] = 22612] = "SilentTracks"; - EbmlTagId[EbmlTagId["ContentEncoding"] = 25152] = "ContentEncoding"; - EbmlTagId[EbmlTagId["BitDepth"] = 25188] = "BitDepth"; - EbmlTagId[EbmlTagId["SignedElement"] = 25906] = "SignedElement"; - EbmlTagId[EbmlTagId["TrackTranslate"] = 26148] = "TrackTranslate"; - EbmlTagId[EbmlTagId["ChapProcessCommand"] = 26897] = "ChapProcessCommand"; - EbmlTagId[EbmlTagId["ChapProcessTime"] = 26914] = "ChapProcessTime"; - EbmlTagId[EbmlTagId["ChapterTranslate"] = 26916] = "ChapterTranslate"; - EbmlTagId[EbmlTagId["ChapProcessData"] = 26931] = "ChapProcessData"; - EbmlTagId[EbmlTagId["ChapProcess"] = 26948] = "ChapProcess"; - EbmlTagId[EbmlTagId["ChapProcessCodecID"] = 26965] = "ChapProcessCodecID"; - EbmlTagId[EbmlTagId["Tag"] = 29555] = "Tag"; - EbmlTagId[EbmlTagId["SegmentFilename"] = 29572] = "SegmentFilename"; - EbmlTagId[EbmlTagId["AttachmentLink"] = 29766] = "AttachmentLink"; - EbmlTagId[EbmlTagId["CodecName"] = 2459272] = "CodecName"; - EbmlTagId[EbmlTagId["Segment"] = 408125543] = "Segment"; - EbmlTagId[EbmlTagId["TagLanguage"] = 17530] = "TagLanguage"; - EbmlTagId[EbmlTagId["TagName"] = 17827] = "TagName"; - EbmlTagId[EbmlTagId["SimpleTag"] = 26568] = "SimpleTag"; - EbmlTagId[EbmlTagId["TagAttachmentUID"] = 25542] = "TagAttachmentUID"; - EbmlTagId[EbmlTagId["TagChapterUID"] = 25540] = "TagChapterUID"; - EbmlTagId[EbmlTagId["TagEditionUID"] = 25545] = "TagEditionUID"; - EbmlTagId[EbmlTagId["TagTrackUID"] = 25541] = "TagTrackUID"; - EbmlTagId[EbmlTagId["TargetType"] = 25546] = "TargetType"; - EbmlTagId[EbmlTagId["TargetTypeValue"] = 26826] = "TargetTypeValue"; - EbmlTagId[EbmlTagId["Targets"] = 25536] = "Targets"; - EbmlTagId[EbmlTagId["Tags"] = 307544935] = "Tags"; - EbmlTagId[EbmlTagId["ChapProcessPrivate"] = 17677] = "ChapProcessPrivate"; - EbmlTagId[EbmlTagId["ChapCountry"] = 17278] = "ChapCountry"; - EbmlTagId[EbmlTagId["ChapLanguage"] = 17276] = "ChapLanguage"; - EbmlTagId[EbmlTagId["ChapterTrack"] = 143] = "ChapterTrack"; - EbmlTagId[EbmlTagId["ChapterPhysicalEquiv"] = 25539] = "ChapterPhysicalEquiv"; - EbmlTagId[EbmlTagId["ChapterSegmentEditionUID"] = 28348] = "ChapterSegmentEditionUID"; - EbmlTagId[EbmlTagId["ChapterSegmentUID"] = 28263] = "ChapterSegmentUID"; - EbmlTagId[EbmlTagId["ChapterUID"] = 29636] = "ChapterUID"; - EbmlTagId[EbmlTagId["ChapterAtom"] = 182] = "ChapterAtom"; - EbmlTagId[EbmlTagId["EditionFlagOrdered"] = 17885] = "EditionFlagOrdered"; - EbmlTagId[EbmlTagId["EditionFlagDefault"] = 17883] = "EditionFlagDefault"; - EbmlTagId[EbmlTagId["EditionFlagHidden"] = 17853] = "EditionFlagHidden"; - EbmlTagId[EbmlTagId["EditionUID"] = 17852] = "EditionUID"; - EbmlTagId[EbmlTagId["EditionEntry"] = 17849] = "EditionEntry"; - EbmlTagId[EbmlTagId["Chapters"] = 272869232] = "Chapters"; - EbmlTagId[EbmlTagId["FileUID"] = 18094] = "FileUID"; - EbmlTagId[EbmlTagId["FileData"] = 18012] = "FileData"; - EbmlTagId[EbmlTagId["FileName"] = 18030] = "FileName"; - EbmlTagId[EbmlTagId["FileDescription"] = 18046] = "FileDescription"; - EbmlTagId[EbmlTagId["AttachedFile"] = 24999] = "AttachedFile"; - EbmlTagId[EbmlTagId["Attachments"] = 423732329] = "Attachments"; - EbmlTagId[EbmlTagId["CueRefCodecState"] = 235] = "CueRefCodecState"; - EbmlTagId[EbmlTagId["CueRefNumber"] = 21343] = "CueRefNumber"; - EbmlTagId[EbmlTagId["CueReference"] = 219] = "CueReference"; - EbmlTagId[EbmlTagId["CueCodecState"] = 234] = "CueCodecState"; - EbmlTagId[EbmlTagId["CueDuration"] = 178] = "CueDuration"; - EbmlTagId[EbmlTagId["CueRelativePosition"] = 240] = "CueRelativePosition"; - EbmlTagId[EbmlTagId["CueClusterPosition"] = 241] = "CueClusterPosition"; - EbmlTagId[EbmlTagId["CueTrack"] = 247] = "CueTrack"; - EbmlTagId[EbmlTagId["CueTrackPositions"] = 183] = "CueTrackPositions"; - EbmlTagId[EbmlTagId["CueTime"] = 179] = "CueTime"; - EbmlTagId[EbmlTagId["CuePoint"] = 187] = "CuePoint"; - EbmlTagId[EbmlTagId["Cues"] = 475249515] = "Cues"; - EbmlTagId[EbmlTagId["AESSettingsCipherMode"] = 18408] = "AESSettingsCipherMode"; - EbmlTagId[EbmlTagId["ContentEncAESSettings"] = 18407] = "ContentEncAESSettings"; - EbmlTagId[EbmlTagId["ContentSigHashAlgo"] = 18406] = "ContentSigHashAlgo"; - EbmlTagId[EbmlTagId["ContentSigAlgo"] = 18405] = "ContentSigAlgo"; - EbmlTagId[EbmlTagId["ContentSigKeyID"] = 18404] = "ContentSigKeyID"; - EbmlTagId[EbmlTagId["ContentSignature"] = 18403] = "ContentSignature"; - EbmlTagId[EbmlTagId["ContentEncKeyID"] = 18402] = "ContentEncKeyID"; - EbmlTagId[EbmlTagId["ContentEncAlgo"] = 18401] = "ContentEncAlgo"; - EbmlTagId[EbmlTagId["ContentEncodings"] = 28032] = "ContentEncodings"; - EbmlTagId[EbmlTagId["TrickMasterTrackSegmentUID"] = 196] = "TrickMasterTrackSegmentUID"; - EbmlTagId[EbmlTagId["TrickMasterTrackUID"] = 199] = "TrickMasterTrackUID"; - EbmlTagId[EbmlTagId["TrickTrackFlag"] = 198] = "TrickTrackFlag"; - EbmlTagId[EbmlTagId["TrickTrackSegmentUID"] = 193] = "TrickTrackSegmentUID"; - EbmlTagId[EbmlTagId["TrickTrackUID"] = 192] = "TrickTrackUID"; - EbmlTagId[EbmlTagId["TrackJoinUID"] = 237] = "TrackJoinUID"; - EbmlTagId[EbmlTagId["TrackJoinBlocks"] = 233] = "TrackJoinBlocks"; - EbmlTagId[EbmlTagId["TrackPlaneType"] = 230] = "TrackPlaneType"; - EbmlTagId[EbmlTagId["TrackPlaneUID"] = 229] = "TrackPlaneUID"; - EbmlTagId[EbmlTagId["TrackPlane"] = 228] = "TrackPlane"; - EbmlTagId[EbmlTagId["TrackCombinePlanes"] = 227] = "TrackCombinePlanes"; - EbmlTagId[EbmlTagId["TrackOperation"] = 226] = "TrackOperation"; - EbmlTagId[EbmlTagId["ChannelPositions"] = 32123] = "ChannelPositions"; - EbmlTagId[EbmlTagId["Channels"] = 159] = "Channels"; - EbmlTagId[EbmlTagId["OutputSamplingFrequency"] = 30901] = "OutputSamplingFrequency"; - EbmlTagId[EbmlTagId["SamplingFrequency"] = 181] = "SamplingFrequency"; - EbmlTagId[EbmlTagId["Audio"] = 225] = "Audio"; - EbmlTagId[EbmlTagId["FrameRate"] = 2327523] = "FrameRate"; - EbmlTagId[EbmlTagId["GammaValue"] = 3126563] = "GammaValue"; - EbmlTagId[EbmlTagId["ColourSpace"] = 3061028] = "ColourSpace"; - EbmlTagId[EbmlTagId["AspectRatioType"] = 21683] = "AspectRatioType"; - EbmlTagId[EbmlTagId["DisplayUnit"] = 21682] = "DisplayUnit"; - EbmlTagId[EbmlTagId["DisplayHeight"] = 21690] = "DisplayHeight"; - EbmlTagId[EbmlTagId["DisplayWidth"] = 21680] = "DisplayWidth"; - EbmlTagId[EbmlTagId["PixelCropRight"] = 21725] = "PixelCropRight"; - EbmlTagId[EbmlTagId["PixelCropLeft"] = 21708] = "PixelCropLeft"; - EbmlTagId[EbmlTagId["PixelCropTop"] = 21691] = "PixelCropTop"; - EbmlTagId[EbmlTagId["PixelCropBottom"] = 21674] = "PixelCropBottom"; - EbmlTagId[EbmlTagId["PixelHeight"] = 186] = "PixelHeight"; - EbmlTagId[EbmlTagId["PixelWidth"] = 176] = "PixelWidth"; - EbmlTagId[EbmlTagId["OldStereoMode"] = 21433] = "OldStereoMode"; - EbmlTagId[EbmlTagId["AlphaMode"] = 21440] = "AlphaMode"; - EbmlTagId[EbmlTagId["StereoMode"] = 21432] = "StereoMode"; - EbmlTagId[EbmlTagId["FlagInterlaced"] = 154] = "FlagInterlaced"; - EbmlTagId[EbmlTagId["Video"] = 224] = "Video"; - EbmlTagId[EbmlTagId["TrackTranslateTrackID"] = 26277] = "TrackTranslateTrackID"; - EbmlTagId[EbmlTagId["TrackTranslateCodec"] = 26303] = "TrackTranslateCodec"; - EbmlTagId[EbmlTagId["TrackTranslateEditionUID"] = 26364] = "TrackTranslateEditionUID"; - EbmlTagId[EbmlTagId["SeekPreRoll"] = 22203] = "SeekPreRoll"; - EbmlTagId[EbmlTagId["CodecDelay"] = 22186] = "CodecDelay"; - EbmlTagId[EbmlTagId["TrackOverlay"] = 28587] = "TrackOverlay"; - EbmlTagId[EbmlTagId["CodecDecodeAll"] = 170] = "CodecDecodeAll"; - EbmlTagId[EbmlTagId["CodecDownloadURL"] = 2536000] = "CodecDownloadURL"; - EbmlTagId[EbmlTagId["CodecInfoURL"] = 3883072] = "CodecInfoURL"; - EbmlTagId[EbmlTagId["CodecSettings"] = 3839639] = "CodecSettings"; - EbmlTagId[EbmlTagId["CodecPrivate"] = 25506] = "CodecPrivate"; - EbmlTagId[EbmlTagId["Language"] = 2274716] = "Language"; - EbmlTagId[EbmlTagId["Name"] = 21358] = "Name"; - EbmlTagId[EbmlTagId["MaxBlockAdditionID"] = 21998] = "MaxBlockAdditionID"; - EbmlTagId[EbmlTagId["TrackOffset"] = 21375] = "TrackOffset"; - EbmlTagId[EbmlTagId["TrackTimecodeScale"] = 2306383] = "TrackTimecodeScale"; - EbmlTagId[EbmlTagId["DefaultDecodedFieldDuration"] = 2313850] = "DefaultDecodedFieldDuration"; - EbmlTagId[EbmlTagId["DefaultDuration"] = 2352003] = "DefaultDuration"; - EbmlTagId[EbmlTagId["MaxCache"] = 28152] = "MaxCache"; - EbmlTagId[EbmlTagId["MinCache"] = 28135] = "MinCache"; - EbmlTagId[EbmlTagId["FlagLacing"] = 156] = "FlagLacing"; - EbmlTagId[EbmlTagId["FlagForced"] = 21930] = "FlagForced"; - EbmlTagId[EbmlTagId["FlagEnabled"] = 185] = "FlagEnabled"; - EbmlTagId[EbmlTagId["TrackUID"] = 29637] = "TrackUID"; - EbmlTagId[EbmlTagId["TrackNumber"] = 215] = "TrackNumber"; - EbmlTagId[EbmlTagId["TrackEntry"] = 174] = "TrackEntry"; - EbmlTagId[EbmlTagId["Tracks"] = 374648427] = "Tracks"; - EbmlTagId[EbmlTagId["EncryptedBlock"] = 175] = "EncryptedBlock"; - EbmlTagId[EbmlTagId["ReferenceTimeCode"] = 202] = "ReferenceTimeCode"; - EbmlTagId[EbmlTagId["ReferenceOffset"] = 201] = "ReferenceOffset"; - EbmlTagId[EbmlTagId["ReferenceFrame"] = 200] = "ReferenceFrame"; - EbmlTagId[EbmlTagId["SliceDuration"] = 207] = "SliceDuration"; - EbmlTagId[EbmlTagId["Delay"] = 206] = "Delay"; - EbmlTagId[EbmlTagId["BlockAdditionID"] = 203] = "BlockAdditionID"; - EbmlTagId[EbmlTagId["FrameNumber"] = 205] = "FrameNumber"; - EbmlTagId[EbmlTagId["LaceNumber"] = 204] = "LaceNumber"; - EbmlTagId[EbmlTagId["TimeSlice"] = 232] = "TimeSlice"; - EbmlTagId[EbmlTagId["Slices"] = 142] = "Slices"; - EbmlTagId[EbmlTagId["DiscardPadding"] = 30114] = "DiscardPadding"; - EbmlTagId[EbmlTagId["CodecState"] = 164] = "CodecState"; - EbmlTagId[EbmlTagId["ReferenceVirtual"] = 253] = "ReferenceVirtual"; - EbmlTagId[EbmlTagId["ReferenceBlock"] = 251] = "ReferenceBlock"; - EbmlTagId[EbmlTagId["ReferencePriority"] = 250] = "ReferencePriority"; - EbmlTagId[EbmlTagId["BlockDuration"] = 155] = "BlockDuration"; - EbmlTagId[EbmlTagId["BlockAdditional"] = 165] = "BlockAdditional"; - EbmlTagId[EbmlTagId["BlockAddID"] = 238] = "BlockAddID"; - EbmlTagId[EbmlTagId["BlockMore"] = 166] = "BlockMore"; - EbmlTagId[EbmlTagId["BlockAdditions"] = 30113] = "BlockAdditions"; - EbmlTagId[EbmlTagId["BlockVirtual"] = 162] = "BlockVirtual"; - EbmlTagId[EbmlTagId["Block"] = 161] = "Block"; - EbmlTagId[EbmlTagId["BlockGroup"] = 160] = "BlockGroup"; - EbmlTagId[EbmlTagId["SimpleBlock"] = 163] = "SimpleBlock"; - EbmlTagId[EbmlTagId["PrevSize"] = 171] = "PrevSize"; - EbmlTagId[EbmlTagId["Position"] = 167] = "Position"; - EbmlTagId[EbmlTagId["SilentTrackNumber"] = 22743] = "SilentTrackNumber"; - EbmlTagId[EbmlTagId["Timecode"] = 231] = "Timecode"; - EbmlTagId[EbmlTagId["Cluster"] = 524531317] = "Cluster"; - EbmlTagId[EbmlTagId["MuxingApp"] = 19840] = "MuxingApp"; - EbmlTagId[EbmlTagId["Title"] = 31657] = "Title"; - EbmlTagId[EbmlTagId["TimecodeScaleDenominator"] = 2807730] = "TimecodeScaleDenominator"; - EbmlTagId[EbmlTagId["TimecodeScale"] = 2807729] = "TimecodeScale"; - EbmlTagId[EbmlTagId["ChapterTranslateID"] = 27045] = "ChapterTranslateID"; - EbmlTagId[EbmlTagId["ChapterTranslateCodec"] = 27071] = "ChapterTranslateCodec"; - EbmlTagId[EbmlTagId["ChapterTranslateEditionUID"] = 27132] = "ChapterTranslateEditionUID"; - EbmlTagId[EbmlTagId["NextFilename"] = 4096955] = "NextFilename"; - EbmlTagId[EbmlTagId["NextUID"] = 4110627] = "NextUID"; - EbmlTagId[EbmlTagId["PrevFilename"] = 3965867] = "PrevFilename"; - EbmlTagId[EbmlTagId["PrevUID"] = 3979555] = "PrevUID"; - EbmlTagId[EbmlTagId["SegmentUID"] = 29604] = "SegmentUID"; - EbmlTagId[EbmlTagId["Info"] = 357149030] = "Info"; - EbmlTagId[EbmlTagId["SeekPosition"] = 21420] = "SeekPosition"; - EbmlTagId[EbmlTagId["SeekID"] = 21419] = "SeekID"; - EbmlTagId[EbmlTagId["Seek"] = 19899] = "Seek"; - EbmlTagId[EbmlTagId["SeekHead"] = 290298740] = "SeekHead"; - EbmlTagId[EbmlTagId["SignatureElementList"] = 32379] = "SignatureElementList"; - EbmlTagId[EbmlTagId["SignatureElements"] = 32347] = "SignatureElements"; - EbmlTagId[EbmlTagId["Signature"] = 32437] = "Signature"; - EbmlTagId[EbmlTagId["SignaturePublicKey"] = 32421] = "SignaturePublicKey"; - EbmlTagId[EbmlTagId["SignatureHash"] = 32410] = "SignatureHash"; - EbmlTagId[EbmlTagId["SignatureAlgo"] = 32394] = "SignatureAlgo"; - EbmlTagId[EbmlTagId["SignatureSlot"] = 458458727] = "SignatureSlot"; - EbmlTagId[EbmlTagId["CRC32"] = 191] = "CRC32"; - EbmlTagId[EbmlTagId["Void"] = 236] = "Void"; - EbmlTagId[EbmlTagId["EBMLMaxSizeLength"] = 17139] = "EBMLMaxSizeLength"; - EbmlTagId[EbmlTagId["EBMLMaxIDLength"] = 17138] = "EBMLMaxIDLength"; - EbmlTagId[EbmlTagId["EBMLReadVersion"] = 17143] = "EBMLReadVersion"; - EbmlTagId[EbmlTagId["EBML"] = 440786851] = "EBML"; -})(EbmlTagId = exports.EbmlTagId || (exports.EbmlTagId = {})); - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js": -/*!**********************************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js ***! - \**********************************************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -var EbmlTagPosition; -(function (EbmlTagPosition) { - EbmlTagPosition[EbmlTagPosition["Start"] = 0] = "Start"; - EbmlTagPosition[EbmlTagPosition["Content"] = 1] = "Content"; - EbmlTagPosition[EbmlTagPosition["End"] = 2] = "End"; -})(EbmlTagPosition = exports.EbmlTagPosition || (exports.EbmlTagPosition = {})); - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/tags/Block.js": -/*!***********************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/tags/Block.js ***! - \***********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const EbmlDataTag_1 = __webpack_require__(/*! ./EbmlDataTag */ "./node_modules/ebml-stream/lib/models/tags/EbmlDataTag.js"); -const BlockLacing_1 = __webpack_require__(/*! ../enums/BlockLacing */ "./node_modules/ebml-stream/lib/models/enums/BlockLacing.js"); -const tools_1 = __webpack_require__(/*! ../../tools */ "./node_modules/ebml-stream/lib/tools.js"); -const EbmlTagId_1 = __webpack_require__(/*! ../enums/EbmlTagId */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js"); -const EbmlElementType_1 = __webpack_require__(/*! ../enums/EbmlElementType */ "./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js"); -class Block extends EbmlDataTag_1.EbmlDataTag { - constructor(subTypeId) { - super(subTypeId || EbmlTagId_1.EbmlTagId.Block, EbmlElementType_1.EbmlElementType.Binary); - } - writeTrackBuffer() { - return tools_1.Tools.writeVint(this.track); - } - writeValueBuffer() { - let value = Buffer.alloc(2); - value.writeInt16BE(this.value, 0); - return value; - } - writeFlagsBuffer() { - let flags = 0x00; - if (this.invisible) { - flags |= 0x10; - } - switch (this.lacing) { - case BlockLacing_1.BlockLacing.None: - break; - case BlockLacing_1.BlockLacing.Xiph: - flags |= 0x04; - break; - case BlockLacing_1.BlockLacing.EBML: - flags |= 0x08; - break; - case BlockLacing_1.BlockLacing.FixedSize: - flags |= 0x0c; - break; - } - return Buffer.of(flags); - } - encodeContent() { - return Buffer.concat([ - this.writeTrackBuffer(), - this.writeValueBuffer(), - this.writeFlagsBuffer(), - this.payload - ]); - } - parseContent(data) { - const track = tools_1.Tools.readVint(data); - this.track = track.value; - this.value = tools_1.Tools.readSigned(data.subarray(track.length, track.length + 2)); - let flags = data[track.length + 2]; - this.invisible = Boolean(flags & 0x10); - switch (flags & 0x0c) { - case 0x00: - this.lacing = BlockLacing_1.BlockLacing.None; - break; - case 0x04: - this.lacing = BlockLacing_1.BlockLacing.Xiph; - break; - case 0x08: - this.lacing = BlockLacing_1.BlockLacing.EBML; - break; - case 0x0c: - this.lacing = BlockLacing_1.BlockLacing.FixedSize; - break; - } - this.payload = data.slice(track.length + 3); - } -} -exports.Block = Block; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/tags/EbmlDataTag.js": -/*!*****************************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/tags/EbmlDataTag.js ***! - \*****************************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const EbmlTag_1 = __webpack_require__(/*! ../EbmlTag */ "./node_modules/ebml-stream/lib/models/EbmlTag.js"); -const EbmlElementType_1 = __webpack_require__(/*! ../enums/EbmlElementType */ "./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js"); -const tools_1 = __webpack_require__(/*! ../../tools */ "./node_modules/ebml-stream/lib/tools.js"); -const EbmlTagPosition_1 = __webpack_require__(/*! ../enums/EbmlTagPosition */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js"); -class EbmlDataTag extends EbmlTag_1.EbmlTag { - constructor(id, type) { - super(id, type, EbmlTagPosition_1.EbmlTagPosition.Content); - } - parseContent(data) { - switch (this.type) { - case EbmlElementType_1.EbmlElementType.UnsignedInt: - this.data = tools_1.Tools.readUnsigned(data); - break; - case EbmlElementType_1.EbmlElementType.Float: - this.data = tools_1.Tools.readFloat(data); - break; - case EbmlElementType_1.EbmlElementType.Integer: - this.data = tools_1.Tools.readSigned(data); - break; - case EbmlElementType_1.EbmlElementType.String: - this.data = String.fromCharCode(...data); - break; - case EbmlElementType_1.EbmlElementType.UTF8: - this.data = tools_1.Tools.readUtf8(data); - break; - default: - this.data = data; - break; - } - } - encodeContent() { - switch (this.type) { - case EbmlElementType_1.EbmlElementType.UnsignedInt: - return tools_1.Tools.writeUnsigned(this.data); - case EbmlElementType_1.EbmlElementType.Float: - return tools_1.Tools.writeFloat(this.data); - case EbmlElementType_1.EbmlElementType.Integer: - return tools_1.Tools.writeSigned(this.data); - case EbmlElementType_1.EbmlElementType.String: - return Buffer.from(this.data, "ascii"); - case EbmlElementType_1.EbmlElementType.UTF8: - return Buffer.from(this.data, "utf8"); - case EbmlElementType_1.EbmlElementType.Binary: - default: - return this.data; - } - } -} -exports.EbmlDataTag = EbmlDataTag; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/tags/EbmlMasterTag.js": -/*!*******************************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/tags/EbmlMasterTag.js ***! - \*******************************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const EbmlTag_1 = __webpack_require__(/*! ../EbmlTag */ "./node_modules/ebml-stream/lib/models/EbmlTag.js"); -const EbmlElementType_1 = __webpack_require__(/*! ../enums/EbmlElementType */ "./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js"); -const EbmlTagPosition_1 = __webpack_require__(/*! ../enums/EbmlTagPosition */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js"); -const tools_1 = __webpack_require__(/*! ../../tools */ "./node_modules/ebml-stream/lib/tools.js"); -const EbmlTagFactory_1 = __webpack_require__(/*! ../EbmlTagFactory */ "./node_modules/ebml-stream/lib/models/EbmlTagFactory.js"); -class EbmlMasterTag extends EbmlTag_1.EbmlTag { - constructor(id, position = EbmlTagPosition_1.EbmlTagPosition.Content) { - super(id, EbmlElementType_1.EbmlElementType.Master, position); - this._children = []; - } - get Children() { - return this._children; - } - set Children(value) { - this._children = value; - } - encodeContent() { - return Buffer.concat(this._children.map(child => child.encode())); - } - parseContent(content) { - while (content.length > 0) { - const tag = tools_1.Tools.readVint(content); - const size = tools_1.Tools.readVint(content, tag.length); - const tagIdHex = tools_1.Tools.readHexString(content, 0, tag.length); - const tagId = Number.parseInt(tagIdHex, 16); - let tagObject = EbmlTagFactory_1.EbmlTagFactory.create(tagId); - tagObject.size = size.value; - let totalTagLength = tag.length + size.length + size.value; - tagObject.parseContent(content.slice(tag.length + size.length, totalTagLength)); - this._children.push(tagObject); - content = content.slice(totalTagLength); - } - } -} -exports.EbmlMasterTag = EbmlMasterTag; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/models/tags/SimpleBlock.js": -/*!*****************************************************************!*\ - !*** ./node_modules/ebml-stream/lib/models/tags/SimpleBlock.js ***! - \*****************************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -const tools_1 = __webpack_require__(/*! ../../tools */ "./node_modules/ebml-stream/lib/tools.js"); -const Block_1 = __webpack_require__(/*! ./Block */ "./node_modules/ebml-stream/lib/models/tags/Block.js"); -const EbmlTagId_1 = __webpack_require__(/*! ../enums/EbmlTagId */ "./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js"); -class SimpleBlock extends Block_1.Block { - constructor() { - super(EbmlTagId_1.EbmlTagId.SimpleBlock); - } - encodeContent() { - let flags = this.writeFlagsBuffer(); - if (this.keyframe) { - flags[0] |= 0x80; - } - if (this.discardable) { - flags[0] |= 0x01; - } - return Buffer.concat([ - this.writeTrackBuffer(), - this.writeValueBuffer(), - flags, - this.payload - ]); - } - parseContent(data) { - super.parseContent(data); - const track = tools_1.Tools.readVint(data); - let flags = data[track.length + 2]; - this.keyframe = Boolean(flags & 0x80); - this.discardable = Boolean(flags & 0x01); - } -} -exports.SimpleBlock = SimpleBlock; - - -/***/ }), - -/***/ "./node_modules/ebml-stream/lib/tools.js": -/*!***********************************************!*\ - !*** ./node_modules/ebml-stream/lib/tools.js ***! - \***********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -Object.defineProperty(exports, "__esModule", ({ value: true })); -class Tools { - static readVint(buffer, start = 0) { - const length = 8 - Math.floor(Math.log2(buffer[start])); - if (length > 8) { - const number = Tools.readHexString(buffer, start, start + length); - throw new Error(`Unrepresentable length: ${length} ${number}`); - } - if (isNaN(length) || start + length > buffer.length) { - return null; - } - if (length === 8 && buffer[start + 1] >= 0x20 && buffer.subarray(start + 2, start + 8).some(i => i > 0x00)) { - return { - length: 8, - value: -1 - }; - } - let value = buffer[start] & ((1 << (8 - length)) - 1); - for (let i = 1; i < length; i += 1) { - value *= Math.pow(2, 8); - value += buffer[start + i]; - } - if (value === (Math.pow(2, (length * 7)) - 1)) { - value = -1; - } - return { - length, - value, - }; - } - static writeVint(value, desiredLength) { - if (value < 0 || value > (Math.pow(2, 53))) { - throw new Error(`Unrepresentable value: ${value}`); - } - let length = desiredLength; - if (!length) { - for (length = 1; length <= 8; length += 1) { - if (value < Math.pow(2, (7 * length)) - 1) { - break; - } - } - } - const buffer = Buffer.alloc(length); - let val = value; - for (let i = 1; i <= length; i += 1) { - const b = val & 0xff; - buffer[length - i] = b; - val -= b; - val /= Math.pow(2, 8); - } - buffer[0] |= 1 << (8 - length); - return buffer; - } - static padStart(val) { - if (val.length == 0) { - return '00'; - } - if (val.length == 1) { - return '0' + val; - } - return val; - } - static readHexString(buff, start = 0, end = buff.byteLength) { - return Array.from(buff.subarray(start, end)) - .map(q => Number(q).toString(16)) - .reduce((acc, current) => `${acc}${this.padStart(current)}`, ''); - } - static readUtf8(buff) { - try { - return Buffer.from(buff).toString('utf8'); - } - catch (exception) { - return null; - } - } - static readUnsigned(buff) { - const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength); - switch (buff.byteLength) { - case 1: - return b.getUint8(0); - case 2: - return b.getUint16(0); - case 4: - return b.getUint32(0); - default: - break; - } - if (buff.byteLength <= 6) { - return buff.reduce((acc, current) => acc * 256 + current, 0); - } - var hex = Tools.readHexString(buff, 0, buff.byteLength); - var num = parseInt(hex, 16); - if (num <= Math.pow(256, 6)) { - return num; - } - return hex; - } - static writeUnsigned(num) { - if (typeof num === 'string') { - return Buffer.from(num, 'hex'); - } - else { - var buf = Buffer.alloc(6); - buf.fill(0); - buf.writeUIntBE(num, 0, 6); - let firstValueIndex = buf.findIndex(b => b !== 0); - if (firstValueIndex === -1) { - firstValueIndex = buf.length - 1; - } - let ret = buf.slice(firstValueIndex); - return ret; - } - } - static readSigned(buff) { - const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength); - switch (buff.byteLength) { - case 1: - return b.getInt8(0); - case 2: - return b.getInt16(0); - case 4: - return b.getInt32(0); - default: - return NaN; - } - } - static writeSigned(num) { - var buf = Buffer.alloc(8); - buf.writeInt32BE(num, 0); - return buf; - } - static readFloat(buff) { - const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength); - switch (buff.byteLength) { - case 4: - return b.getFloat32(0); - case 8: - return b.getFloat64(0); - default: - return NaN; - } - } - static writeFloat(num) { - let buf = Buffer.alloc(8); - let written = buf.writeFloatBE(num, 0); - if (written <= 4) { - buf = buf.slice(0, 4); - } - return buf; - } -} -exports.Tools = Tools; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic.js": -/*!***********************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic.js ***! - \***********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var elliptic = exports; - -elliptic.version = __webpack_require__(/*! ../package.json */ "./node_modules/elliptic/package.json").version; -elliptic.utils = __webpack_require__(/*! ./elliptic/utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -elliptic.rand = __webpack_require__(/*! brorand */ "./node_modules/brorand/index.js"); -elliptic.curve = __webpack_require__(/*! ./elliptic/curve */ "./node_modules/elliptic/lib/elliptic/curve/index.js"); -elliptic.curves = __webpack_require__(/*! ./elliptic/curves */ "./node_modules/elliptic/lib/elliptic/curves.js"); - -// Protocols -elliptic.ec = __webpack_require__(/*! ./elliptic/ec */ "./node_modules/elliptic/lib/elliptic/ec/index.js"); -elliptic.eddsa = __webpack_require__(/*! ./elliptic/eddsa */ "./node_modules/elliptic/lib/elliptic/eddsa/index.js"); - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/curve/base.js": -/*!**********************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/curve/base.js ***! - \**********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var getNAF = utils.getNAF; -var getJSF = utils.getJSF; -var assert = utils.assert; - -function BaseCurve(type, conf) { - this.type = type; - this.p = new BN(conf.p, 16); - - // Use Montgomery, when there is no fast reduction for the prime - this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p); - - // Useful for many curves - this.zero = new BN(0).toRed(this.red); - this.one = new BN(1).toRed(this.red); - this.two = new BN(2).toRed(this.red); - - // Curve configuration, optional - this.n = conf.n && new BN(conf.n, 16); - this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed); - - // Temporary arrays - this._wnafT1 = new Array(4); - this._wnafT2 = new Array(4); - this._wnafT3 = new Array(4); - this._wnafT4 = new Array(4); - - this._bitLength = this.n ? this.n.bitLength() : 0; - - // Generalized Greg Maxwell's trick - var adjustCount = this.n && this.p.div(this.n); - if (!adjustCount || adjustCount.cmpn(100) > 0) { - this.redN = null; - } else { - this._maxwellTrick = true; - this.redN = this.n.toRed(this.red); - } -} -module.exports = BaseCurve; - -BaseCurve.prototype.point = function point() { - throw new Error('Not implemented'); -}; - -BaseCurve.prototype.validate = function validate() { - throw new Error('Not implemented'); -}; - -BaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) { - assert(p.precomputed); - var doubles = p._getDoubles(); - - var naf = getNAF(k, 1, this._bitLength); - var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1); - I /= 3; - - // Translate into more windowed form - var repr = []; - var j; - var nafW; - for (j = 0; j < naf.length; j += doubles.step) { - nafW = 0; - for (var l = j + doubles.step - 1; l >= j; l--) - nafW = (nafW << 1) + naf[l]; - repr.push(nafW); - } - - var a = this.jpoint(null, null, null); - var b = this.jpoint(null, null, null); - for (var i = I; i > 0; i--) { - for (j = 0; j < repr.length; j++) { - nafW = repr[j]; - if (nafW === i) - b = b.mixedAdd(doubles.points[j]); - else if (nafW === -i) - b = b.mixedAdd(doubles.points[j].neg()); - } - a = a.add(b); - } - return a.toP(); -}; - -BaseCurve.prototype._wnafMul = function _wnafMul(p, k) { - var w = 4; - - // Precompute window - var nafPoints = p._getNAFPoints(w); - w = nafPoints.wnd; - var wnd = nafPoints.points; - - // Get NAF form - var naf = getNAF(k, w, this._bitLength); - - // Add `this`*(N+1) for every w-NAF index - var acc = this.jpoint(null, null, null); - for (var i = naf.length - 1; i >= 0; i--) { - // Count zeroes - for (var l = 0; i >= 0 && naf[i] === 0; i--) - l++; - if (i >= 0) - l++; - acc = acc.dblp(l); - - if (i < 0) - break; - var z = naf[i]; - assert(z !== 0); - if (p.type === 'affine') { - // J +- P - if (z > 0) - acc = acc.mixedAdd(wnd[(z - 1) >> 1]); - else - acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg()); - } else { - // J +- J - if (z > 0) - acc = acc.add(wnd[(z - 1) >> 1]); - else - acc = acc.add(wnd[(-z - 1) >> 1].neg()); - } - } - return p.type === 'affine' ? acc.toP() : acc; -}; - -BaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW, - points, - coeffs, - len, - jacobianResult) { - var wndWidth = this._wnafT1; - var wnd = this._wnafT2; - var naf = this._wnafT3; - - // Fill all arrays - var max = 0; - var i; - var j; - var p; - for (i = 0; i < len; i++) { - p = points[i]; - var nafPoints = p._getNAFPoints(defW); - wndWidth[i] = nafPoints.wnd; - wnd[i] = nafPoints.points; - } - - // Comb small window NAFs - for (i = len - 1; i >= 1; i -= 2) { - var a = i - 1; - var b = i; - if (wndWidth[a] !== 1 || wndWidth[b] !== 1) { - naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength); - naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength); - max = Math.max(naf[a].length, max); - max = Math.max(naf[b].length, max); - continue; - } - - var comb = [ - points[a], /* 1 */ - null, /* 3 */ - null, /* 5 */ - points[b], /* 7 */ - ]; - - // Try to avoid Projective points, if possible - if (points[a].y.cmp(points[b].y) === 0) { - comb[1] = points[a].add(points[b]); - comb[2] = points[a].toJ().mixedAdd(points[b].neg()); - } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) { - comb[1] = points[a].toJ().mixedAdd(points[b]); - comb[2] = points[a].add(points[b].neg()); - } else { - comb[1] = points[a].toJ().mixedAdd(points[b]); - comb[2] = points[a].toJ().mixedAdd(points[b].neg()); - } - - var index = [ - -3, /* -1 -1 */ - -1, /* -1 0 */ - -5, /* -1 1 */ - -7, /* 0 -1 */ - 0, /* 0 0 */ - 7, /* 0 1 */ - 5, /* 1 -1 */ - 1, /* 1 0 */ - 3, /* 1 1 */ - ]; - - var jsf = getJSF(coeffs[a], coeffs[b]); - max = Math.max(jsf[0].length, max); - naf[a] = new Array(max); - naf[b] = new Array(max); - for (j = 0; j < max; j++) { - var ja = jsf[0][j] | 0; - var jb = jsf[1][j] | 0; - - naf[a][j] = index[(ja + 1) * 3 + (jb + 1)]; - naf[b][j] = 0; - wnd[a] = comb; - } - } - - var acc = this.jpoint(null, null, null); - var tmp = this._wnafT4; - for (i = max; i >= 0; i--) { - var k = 0; - - while (i >= 0) { - var zero = true; - for (j = 0; j < len; j++) { - tmp[j] = naf[j][i] | 0; - if (tmp[j] !== 0) - zero = false; - } - if (!zero) - break; - k++; - i--; - } - if (i >= 0) - k++; - acc = acc.dblp(k); - if (i < 0) - break; - - for (j = 0; j < len; j++) { - var z = tmp[j]; - p; - if (z === 0) - continue; - else if (z > 0) - p = wnd[j][(z - 1) >> 1]; - else if (z < 0) - p = wnd[j][(-z - 1) >> 1].neg(); - - if (p.type === 'affine') - acc = acc.mixedAdd(p); - else - acc = acc.add(p); - } - } - // Zeroify references - for (i = 0; i < len; i++) - wnd[i] = null; - - if (jacobianResult) - return acc; - else - return acc.toP(); -}; - -function BasePoint(curve, type) { - this.curve = curve; - this.type = type; - this.precomputed = null; -} -BaseCurve.BasePoint = BasePoint; - -BasePoint.prototype.eq = function eq(/*other*/) { - throw new Error('Not implemented'); -}; - -BasePoint.prototype.validate = function validate() { - return this.curve.validate(this); -}; - -BaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) { - bytes = utils.toArray(bytes, enc); - - var len = this.p.byteLength(); - - // uncompressed, hybrid-odd, hybrid-even - if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) && - bytes.length - 1 === 2 * len) { - if (bytes[0] === 0x06) - assert(bytes[bytes.length - 1] % 2 === 0); - else if (bytes[0] === 0x07) - assert(bytes[bytes.length - 1] % 2 === 1); - - var res = this.point(bytes.slice(1, 1 + len), - bytes.slice(1 + len, 1 + 2 * len)); - - return res; - } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) && - bytes.length - 1 === len) { - return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03); - } - throw new Error('Unknown point format'); -}; - -BasePoint.prototype.encodeCompressed = function encodeCompressed(enc) { - return this.encode(enc, true); -}; - -BasePoint.prototype._encode = function _encode(compact) { - var len = this.curve.p.byteLength(); - var x = this.getX().toArray('be', len); - - if (compact) - return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x); - - return [ 0x04 ].concat(x, this.getY().toArray('be', len)); -}; - -BasePoint.prototype.encode = function encode(enc, compact) { - return utils.encode(this._encode(compact), enc); -}; - -BasePoint.prototype.precompute = function precompute(power) { - if (this.precomputed) - return this; - - var precomputed = { - doubles: null, - naf: null, - beta: null, - }; - precomputed.naf = this._getNAFPoints(8); - precomputed.doubles = this._getDoubles(4, power); - precomputed.beta = this._getBeta(); - this.precomputed = precomputed; - - return this; -}; - -BasePoint.prototype._hasDoubles = function _hasDoubles(k) { - if (!this.precomputed) - return false; - - var doubles = this.precomputed.doubles; - if (!doubles) - return false; - - return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step); -}; - -BasePoint.prototype._getDoubles = function _getDoubles(step, power) { - if (this.precomputed && this.precomputed.doubles) - return this.precomputed.doubles; - - var doubles = [ this ]; - var acc = this; - for (var i = 0; i < power; i += step) { - for (var j = 0; j < step; j++) - acc = acc.dbl(); - doubles.push(acc); - } - return { - step: step, - points: doubles, - }; -}; - -BasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) { - if (this.precomputed && this.precomputed.naf) - return this.precomputed.naf; - - var res = [ this ]; - var max = (1 << wnd) - 1; - var dbl = max === 1 ? null : this.dbl(); - for (var i = 1; i < max; i++) - res[i] = res[i - 1].add(dbl); - return { - wnd: wnd, - points: res, - }; -}; - -BasePoint.prototype._getBeta = function _getBeta() { - return null; -}; - -BasePoint.prototype.dblp = function dblp(k) { - var r = this; - for (var i = 0; i < k; i++) - r = r.dbl(); - return r; -}; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/curve/edwards.js": -/*!*************************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/curve/edwards.js ***! - \*************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); -var Base = __webpack_require__(/*! ./base */ "./node_modules/elliptic/lib/elliptic/curve/base.js"); - -var assert = utils.assert; - -function EdwardsCurve(conf) { - // NOTE: Important as we are creating point in Base.call() - this.twisted = (conf.a | 0) !== 1; - this.mOneA = this.twisted && (conf.a | 0) === -1; - this.extended = this.mOneA; - - Base.call(this, 'edwards', conf); - - this.a = new BN(conf.a, 16).umod(this.red.m); - this.a = this.a.toRed(this.red); - this.c = new BN(conf.c, 16).toRed(this.red); - this.c2 = this.c.redSqr(); - this.d = new BN(conf.d, 16).toRed(this.red); - this.dd = this.d.redAdd(this.d); - - assert(!this.twisted || this.c.fromRed().cmpn(1) === 0); - this.oneC = (conf.c | 0) === 1; -} -inherits(EdwardsCurve, Base); -module.exports = EdwardsCurve; - -EdwardsCurve.prototype._mulA = function _mulA(num) { - if (this.mOneA) - return num.redNeg(); - else - return this.a.redMul(num); -}; - -EdwardsCurve.prototype._mulC = function _mulC(num) { - if (this.oneC) - return num; - else - return this.c.redMul(num); -}; - -// Just for compatibility with Short curve -EdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) { - return this.point(x, y, z, t); -}; - -EdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) { - x = new BN(x, 16); - if (!x.red) - x = x.toRed(this.red); - - var x2 = x.redSqr(); - var rhs = this.c2.redSub(this.a.redMul(x2)); - var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2)); - - var y2 = rhs.redMul(lhs.redInvm()); - var y = y2.redSqrt(); - if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) - throw new Error('invalid point'); - - var isOdd = y.fromRed().isOdd(); - if (odd && !isOdd || !odd && isOdd) - y = y.redNeg(); - - return this.point(x, y); -}; - -EdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) { - y = new BN(y, 16); - if (!y.red) - y = y.toRed(this.red); - - // x^2 = (y^2 - c^2) / (c^2 d y^2 - a) - var y2 = y.redSqr(); - var lhs = y2.redSub(this.c2); - var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a); - var x2 = lhs.redMul(rhs.redInvm()); - - if (x2.cmp(this.zero) === 0) { - if (odd) - throw new Error('invalid point'); - else - return this.point(this.zero, y); - } - - var x = x2.redSqrt(); - if (x.redSqr().redSub(x2).cmp(this.zero) !== 0) - throw new Error('invalid point'); - - if (x.fromRed().isOdd() !== odd) - x = x.redNeg(); - - return this.point(x, y); -}; - -EdwardsCurve.prototype.validate = function validate(point) { - if (point.isInfinity()) - return true; - - // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2) - point.normalize(); - - var x2 = point.x.redSqr(); - var y2 = point.y.redSqr(); - var lhs = x2.redMul(this.a).redAdd(y2); - var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2))); - - return lhs.cmp(rhs) === 0; -}; - -function Point(curve, x, y, z, t) { - Base.BasePoint.call(this, curve, 'projective'); - if (x === null && y === null && z === null) { - this.x = this.curve.zero; - this.y = this.curve.one; - this.z = this.curve.one; - this.t = this.curve.zero; - this.zOne = true; - } else { - this.x = new BN(x, 16); - this.y = new BN(y, 16); - this.z = z ? new BN(z, 16) : this.curve.one; - this.t = t && new BN(t, 16); - if (!this.x.red) - this.x = this.x.toRed(this.curve.red); - if (!this.y.red) - this.y = this.y.toRed(this.curve.red); - if (!this.z.red) - this.z = this.z.toRed(this.curve.red); - if (this.t && !this.t.red) - this.t = this.t.toRed(this.curve.red); - this.zOne = this.z === this.curve.one; - - // Use extended coordinates - if (this.curve.extended && !this.t) { - this.t = this.x.redMul(this.y); - if (!this.zOne) - this.t = this.t.redMul(this.z.redInvm()); - } - } -} -inherits(Point, Base.BasePoint); - -EdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) { - return Point.fromJSON(this, obj); -}; - -EdwardsCurve.prototype.point = function point(x, y, z, t) { - return new Point(this, x, y, z, t); -}; - -Point.fromJSON = function fromJSON(curve, obj) { - return new Point(curve, obj[0], obj[1], obj[2]); -}; - -Point.prototype.inspect = function inspect() { - if (this.isInfinity()) - return ''; - return ''; -}; - -Point.prototype.isInfinity = function isInfinity() { - // XXX This code assumes that zero is always zero in red - return this.x.cmpn(0) === 0 && - (this.y.cmp(this.z) === 0 || - (this.zOne && this.y.cmp(this.curve.c) === 0)); -}; - -Point.prototype._extDbl = function _extDbl() { - // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html - // #doubling-dbl-2008-hwcd - // 4M + 4S - - // A = X1^2 - var a = this.x.redSqr(); - // B = Y1^2 - var b = this.y.redSqr(); - // C = 2 * Z1^2 - var c = this.z.redSqr(); - c = c.redIAdd(c); - // D = a * A - var d = this.curve._mulA(a); - // E = (X1 + Y1)^2 - A - B - var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b); - // G = D + B - var g = d.redAdd(b); - // F = G - C - var f = g.redSub(c); - // H = D - B - var h = d.redSub(b); - // X3 = E * F - var nx = e.redMul(f); - // Y3 = G * H - var ny = g.redMul(h); - // T3 = E * H - var nt = e.redMul(h); - // Z3 = F * G - var nz = f.redMul(g); - return this.curve.point(nx, ny, nz, nt); -}; - -Point.prototype._projDbl = function _projDbl() { - // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html - // #doubling-dbl-2008-bbjlp - // #doubling-dbl-2007-bl - // and others - // Generally 3M + 4S or 2M + 4S - - // B = (X1 + Y1)^2 - var b = this.x.redAdd(this.y).redSqr(); - // C = X1^2 - var c = this.x.redSqr(); - // D = Y1^2 - var d = this.y.redSqr(); - - var nx; - var ny; - var nz; - var e; - var h; - var j; - if (this.curve.twisted) { - // E = a * C - e = this.curve._mulA(c); - // F = E + D - var f = e.redAdd(d); - if (this.zOne) { - // X3 = (B - C - D) * (F - 2) - nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two)); - // Y3 = F * (E - D) - ny = f.redMul(e.redSub(d)); - // Z3 = F^2 - 2 * F - nz = f.redSqr().redSub(f).redSub(f); - } else { - // H = Z1^2 - h = this.z.redSqr(); - // J = F - 2 * H - j = f.redSub(h).redISub(h); - // X3 = (B-C-D)*J - nx = b.redSub(c).redISub(d).redMul(j); - // Y3 = F * (E - D) - ny = f.redMul(e.redSub(d)); - // Z3 = F * J - nz = f.redMul(j); - } - } else { - // E = C + D - e = c.redAdd(d); - // H = (c * Z1)^2 - h = this.curve._mulC(this.z).redSqr(); - // J = E - 2 * H - j = e.redSub(h).redSub(h); - // X3 = c * (B - E) * J - nx = this.curve._mulC(b.redISub(e)).redMul(j); - // Y3 = c * E * (C - D) - ny = this.curve._mulC(e).redMul(c.redISub(d)); - // Z3 = E * J - nz = e.redMul(j); - } - return this.curve.point(nx, ny, nz); -}; - -Point.prototype.dbl = function dbl() { - if (this.isInfinity()) - return this; - - // Double in extended coordinates - if (this.curve.extended) - return this._extDbl(); - else - return this._projDbl(); -}; - -Point.prototype._extAdd = function _extAdd(p) { - // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html - // #addition-add-2008-hwcd-3 - // 8M - - // A = (Y1 - X1) * (Y2 - X2) - var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x)); - // B = (Y1 + X1) * (Y2 + X2) - var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x)); - // C = T1 * k * T2 - var c = this.t.redMul(this.curve.dd).redMul(p.t); - // D = Z1 * 2 * Z2 - var d = this.z.redMul(p.z.redAdd(p.z)); - // E = B - A - var e = b.redSub(a); - // F = D - C - var f = d.redSub(c); - // G = D + C - var g = d.redAdd(c); - // H = B + A - var h = b.redAdd(a); - // X3 = E * F - var nx = e.redMul(f); - // Y3 = G * H - var ny = g.redMul(h); - // T3 = E * H - var nt = e.redMul(h); - // Z3 = F * G - var nz = f.redMul(g); - return this.curve.point(nx, ny, nz, nt); -}; - -Point.prototype._projAdd = function _projAdd(p) { - // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html - // #addition-add-2008-bbjlp - // #addition-add-2007-bl - // 10M + 1S - - // A = Z1 * Z2 - var a = this.z.redMul(p.z); - // B = A^2 - var b = a.redSqr(); - // C = X1 * X2 - var c = this.x.redMul(p.x); - // D = Y1 * Y2 - var d = this.y.redMul(p.y); - // E = d * C * D - var e = this.curve.d.redMul(c).redMul(d); - // F = B - E - var f = b.redSub(e); - // G = B + E - var g = b.redAdd(e); - // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D) - var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d); - var nx = a.redMul(f).redMul(tmp); - var ny; - var nz; - if (this.curve.twisted) { - // Y3 = A * G * (D - a * C) - ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c))); - // Z3 = F * G - nz = f.redMul(g); - } else { - // Y3 = A * G * (D - C) - ny = a.redMul(g).redMul(d.redSub(c)); - // Z3 = c * F * G - nz = this.curve._mulC(f).redMul(g); - } - return this.curve.point(nx, ny, nz); -}; - -Point.prototype.add = function add(p) { - if (this.isInfinity()) - return p; - if (p.isInfinity()) - return this; - - if (this.curve.extended) - return this._extAdd(p); - else - return this._projAdd(p); -}; - -Point.prototype.mul = function mul(k) { - if (this._hasDoubles(k)) - return this.curve._fixedNafMul(this, k); - else - return this.curve._wnafMul(this, k); -}; - -Point.prototype.mulAdd = function mulAdd(k1, p, k2) { - return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false); -}; - -Point.prototype.jmulAdd = function jmulAdd(k1, p, k2) { - return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true); -}; - -Point.prototype.normalize = function normalize() { - if (this.zOne) - return this; - - // Normalize coordinates - var zi = this.z.redInvm(); - this.x = this.x.redMul(zi); - this.y = this.y.redMul(zi); - if (this.t) - this.t = this.t.redMul(zi); - this.z = this.curve.one; - this.zOne = true; - return this; -}; - -Point.prototype.neg = function neg() { - return this.curve.point(this.x.redNeg(), - this.y, - this.z, - this.t && this.t.redNeg()); -}; - -Point.prototype.getX = function getX() { - this.normalize(); - return this.x.fromRed(); -}; - -Point.prototype.getY = function getY() { - this.normalize(); - return this.y.fromRed(); -}; - -Point.prototype.eq = function eq(other) { - return this === other || - this.getX().cmp(other.getX()) === 0 && - this.getY().cmp(other.getY()) === 0; -}; - -Point.prototype.eqXToP = function eqXToP(x) { - var rx = x.toRed(this.curve.red).redMul(this.z); - if (this.x.cmp(rx) === 0) - return true; - - var xc = x.clone(); - var t = this.curve.redN.redMul(this.z); - for (;;) { - xc.iadd(this.curve.n); - if (xc.cmp(this.curve.p) >= 0) - return false; - - rx.redIAdd(t); - if (this.x.cmp(rx) === 0) - return true; - } -}; - -// Compatibility with BaseCurve -Point.prototype.toP = Point.prototype.normalize; -Point.prototype.mixedAdd = Point.prototype.add; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/curve/index.js": -/*!***********************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/curve/index.js ***! - \***********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var curve = exports; - -curve.base = __webpack_require__(/*! ./base */ "./node_modules/elliptic/lib/elliptic/curve/base.js"); -curve.short = __webpack_require__(/*! ./short */ "./node_modules/elliptic/lib/elliptic/curve/short.js"); -curve.mont = __webpack_require__(/*! ./mont */ "./node_modules/elliptic/lib/elliptic/curve/mont.js"); -curve.edwards = __webpack_require__(/*! ./edwards */ "./node_modules/elliptic/lib/elliptic/curve/edwards.js"); - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/curve/mont.js": -/*!**********************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/curve/mont.js ***! - \**********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); -var Base = __webpack_require__(/*! ./base */ "./node_modules/elliptic/lib/elliptic/curve/base.js"); - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); - -function MontCurve(conf) { - Base.call(this, 'mont', conf); - - this.a = new BN(conf.a, 16).toRed(this.red); - this.b = new BN(conf.b, 16).toRed(this.red); - this.i4 = new BN(4).toRed(this.red).redInvm(); - this.two = new BN(2).toRed(this.red); - this.a24 = this.i4.redMul(this.a.redAdd(this.two)); -} -inherits(MontCurve, Base); -module.exports = MontCurve; - -MontCurve.prototype.validate = function validate(point) { - var x = point.normalize().x; - var x2 = x.redSqr(); - var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x); - var y = rhs.redSqrt(); - - return y.redSqr().cmp(rhs) === 0; -}; - -function Point(curve, x, z) { - Base.BasePoint.call(this, curve, 'projective'); - if (x === null && z === null) { - this.x = this.curve.one; - this.z = this.curve.zero; - } else { - this.x = new BN(x, 16); - this.z = new BN(z, 16); - if (!this.x.red) - this.x = this.x.toRed(this.curve.red); - if (!this.z.red) - this.z = this.z.toRed(this.curve.red); - } -} -inherits(Point, Base.BasePoint); - -MontCurve.prototype.decodePoint = function decodePoint(bytes, enc) { - return this.point(utils.toArray(bytes, enc), 1); -}; - -MontCurve.prototype.point = function point(x, z) { - return new Point(this, x, z); -}; - -MontCurve.prototype.pointFromJSON = function pointFromJSON(obj) { - return Point.fromJSON(this, obj); -}; - -Point.prototype.precompute = function precompute() { - // No-op -}; - -Point.prototype._encode = function _encode() { - return this.getX().toArray('be', this.curve.p.byteLength()); -}; - -Point.fromJSON = function fromJSON(curve, obj) { - return new Point(curve, obj[0], obj[1] || curve.one); -}; - -Point.prototype.inspect = function inspect() { - if (this.isInfinity()) - return ''; - return ''; -}; - -Point.prototype.isInfinity = function isInfinity() { - // XXX This code assumes that zero is always zero in red - return this.z.cmpn(0) === 0; -}; - -Point.prototype.dbl = function dbl() { - // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3 - // 2M + 2S + 4A - - // A = X1 + Z1 - var a = this.x.redAdd(this.z); - // AA = A^2 - var aa = a.redSqr(); - // B = X1 - Z1 - var b = this.x.redSub(this.z); - // BB = B^2 - var bb = b.redSqr(); - // C = AA - BB - var c = aa.redSub(bb); - // X3 = AA * BB - var nx = aa.redMul(bb); - // Z3 = C * (BB + A24 * C) - var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c))); - return this.curve.point(nx, nz); -}; - -Point.prototype.add = function add() { - throw new Error('Not supported on Montgomery curve'); -}; - -Point.prototype.diffAdd = function diffAdd(p, diff) { - // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3 - // 4M + 2S + 6A - - // A = X2 + Z2 - var a = this.x.redAdd(this.z); - // B = X2 - Z2 - var b = this.x.redSub(this.z); - // C = X3 + Z3 - var c = p.x.redAdd(p.z); - // D = X3 - Z3 - var d = p.x.redSub(p.z); - // DA = D * A - var da = d.redMul(a); - // CB = C * B - var cb = c.redMul(b); - // X5 = Z1 * (DA + CB)^2 - var nx = diff.z.redMul(da.redAdd(cb).redSqr()); - // Z5 = X1 * (DA - CB)^2 - var nz = diff.x.redMul(da.redISub(cb).redSqr()); - return this.curve.point(nx, nz); -}; - -Point.prototype.mul = function mul(k) { - var t = k.clone(); - var a = this; // (N / 2) * Q + Q - var b = this.curve.point(null, null); // (N / 2) * Q - var c = this; // Q - - for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1)) - bits.push(t.andln(1)); - - for (var i = bits.length - 1; i >= 0; i--) { - if (bits[i] === 0) { - // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q - a = a.diffAdd(b, c); - // N * Q = 2 * ((N / 2) * Q + Q)) - b = b.dbl(); - } else { - // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q) - b = a.diffAdd(b, c); - // N * Q + Q = 2 * ((N / 2) * Q + Q) - a = a.dbl(); - } - } - return b; -}; - -Point.prototype.mulAdd = function mulAdd() { - throw new Error('Not supported on Montgomery curve'); -}; - -Point.prototype.jumlAdd = function jumlAdd() { - throw new Error('Not supported on Montgomery curve'); -}; - -Point.prototype.eq = function eq(other) { - return this.getX().cmp(other.getX()) === 0; -}; - -Point.prototype.normalize = function normalize() { - this.x = this.x.redMul(this.z.redInvm()); - this.z = this.curve.one; - return this; -}; - -Point.prototype.getX = function getX() { - // Normalize coordinates - this.normalize(); - - return this.x.fromRed(); -}; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/curve/short.js": -/*!***********************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/curve/short.js ***! - \***********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); -var Base = __webpack_require__(/*! ./base */ "./node_modules/elliptic/lib/elliptic/curve/base.js"); - -var assert = utils.assert; - -function ShortCurve(conf) { - Base.call(this, 'short', conf); - - this.a = new BN(conf.a, 16).toRed(this.red); - this.b = new BN(conf.b, 16).toRed(this.red); - this.tinv = this.two.redInvm(); - - this.zeroA = this.a.fromRed().cmpn(0) === 0; - this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0; - - // If the curve is endomorphic, precalculate beta and lambda - this.endo = this._getEndomorphism(conf); - this._endoWnafT1 = new Array(4); - this._endoWnafT2 = new Array(4); -} -inherits(ShortCurve, Base); -module.exports = ShortCurve; - -ShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) { - // No efficient endomorphism - if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1) - return; - - // Compute beta and lambda, that lambda * P = (beta * Px; Py) - var beta; - var lambda; - if (conf.beta) { - beta = new BN(conf.beta, 16).toRed(this.red); - } else { - var betas = this._getEndoRoots(this.p); - // Choose the smallest beta - beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1]; - beta = beta.toRed(this.red); - } - if (conf.lambda) { - lambda = new BN(conf.lambda, 16); - } else { - // Choose the lambda that is matching selected beta - var lambdas = this._getEndoRoots(this.n); - if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) { - lambda = lambdas[0]; - } else { - lambda = lambdas[1]; - assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0); - } - } - - // Get basis vectors, used for balanced length-two representation - var basis; - if (conf.basis) { - basis = conf.basis.map(function(vec) { - return { - a: new BN(vec.a, 16), - b: new BN(vec.b, 16), - }; - }); - } else { - basis = this._getEndoBasis(lambda); - } - - return { - beta: beta, - lambda: lambda, - basis: basis, - }; -}; - -ShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) { - // Find roots of for x^2 + x + 1 in F - // Root = (-1 +- Sqrt(-3)) / 2 - // - var red = num === this.p ? this.red : BN.mont(num); - var tinv = new BN(2).toRed(red).redInvm(); - var ntinv = tinv.redNeg(); - - var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv); - - var l1 = ntinv.redAdd(s).fromRed(); - var l2 = ntinv.redSub(s).fromRed(); - return [ l1, l2 ]; -}; - -ShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) { - // aprxSqrt >= sqrt(this.n) - var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2)); - - // 3.74 - // Run EGCD, until r(L + 1) < aprxSqrt - var u = lambda; - var v = this.n.clone(); - var x1 = new BN(1); - var y1 = new BN(0); - var x2 = new BN(0); - var y2 = new BN(1); - - // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n) - var a0; - var b0; - // First vector - var a1; - var b1; - // Second vector - var a2; - var b2; - - var prevR; - var i = 0; - var r; - var x; - while (u.cmpn(0) !== 0) { - var q = v.div(u); - r = v.sub(q.mul(u)); - x = x2.sub(q.mul(x1)); - var y = y2.sub(q.mul(y1)); - - if (!a1 && r.cmp(aprxSqrt) < 0) { - a0 = prevR.neg(); - b0 = x1; - a1 = r.neg(); - b1 = x; - } else if (a1 && ++i === 2) { - break; - } - prevR = r; - - v = u; - u = r; - x2 = x1; - x1 = x; - y2 = y1; - y1 = y; - } - a2 = r.neg(); - b2 = x; - - var len1 = a1.sqr().add(b1.sqr()); - var len2 = a2.sqr().add(b2.sqr()); - if (len2.cmp(len1) >= 0) { - a2 = a0; - b2 = b0; - } - - // Normalize signs - if (a1.negative) { - a1 = a1.neg(); - b1 = b1.neg(); - } - if (a2.negative) { - a2 = a2.neg(); - b2 = b2.neg(); - } - - return [ - { a: a1, b: b1 }, - { a: a2, b: b2 }, - ]; -}; - -ShortCurve.prototype._endoSplit = function _endoSplit(k) { - var basis = this.endo.basis; - var v1 = basis[0]; - var v2 = basis[1]; - - var c1 = v2.b.mul(k).divRound(this.n); - var c2 = v1.b.neg().mul(k).divRound(this.n); - - var p1 = c1.mul(v1.a); - var p2 = c2.mul(v2.a); - var q1 = c1.mul(v1.b); - var q2 = c2.mul(v2.b); - - // Calculate answer - var k1 = k.sub(p1).sub(p2); - var k2 = q1.add(q2).neg(); - return { k1: k1, k2: k2 }; -}; - -ShortCurve.prototype.pointFromX = function pointFromX(x, odd) { - x = new BN(x, 16); - if (!x.red) - x = x.toRed(this.red); - - var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b); - var y = y2.redSqrt(); - if (y.redSqr().redSub(y2).cmp(this.zero) !== 0) - throw new Error('invalid point'); - - // XXX Is there any way to tell if the number is odd without converting it - // to non-red form? - var isOdd = y.fromRed().isOdd(); - if (odd && !isOdd || !odd && isOdd) - y = y.redNeg(); - - return this.point(x, y); -}; - -ShortCurve.prototype.validate = function validate(point) { - if (point.inf) - return true; - - var x = point.x; - var y = point.y; - - var ax = this.a.redMul(x); - var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b); - return y.redSqr().redISub(rhs).cmpn(0) === 0; -}; - -ShortCurve.prototype._endoWnafMulAdd = - function _endoWnafMulAdd(points, coeffs, jacobianResult) { - var npoints = this._endoWnafT1; - var ncoeffs = this._endoWnafT2; - for (var i = 0; i < points.length; i++) { - var split = this._endoSplit(coeffs[i]); - var p = points[i]; - var beta = p._getBeta(); - - if (split.k1.negative) { - split.k1.ineg(); - p = p.neg(true); - } - if (split.k2.negative) { - split.k2.ineg(); - beta = beta.neg(true); - } - - npoints[i * 2] = p; - npoints[i * 2 + 1] = beta; - ncoeffs[i * 2] = split.k1; - ncoeffs[i * 2 + 1] = split.k2; - } - var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult); - - // Clean-up references to points and coefficients - for (var j = 0; j < i * 2; j++) { - npoints[j] = null; - ncoeffs[j] = null; - } - return res; - }; - -function Point(curve, x, y, isRed) { - Base.BasePoint.call(this, curve, 'affine'); - if (x === null && y === null) { - this.x = null; - this.y = null; - this.inf = true; - } else { - this.x = new BN(x, 16); - this.y = new BN(y, 16); - // Force redgomery representation when loading from JSON - if (isRed) { - this.x.forceRed(this.curve.red); - this.y.forceRed(this.curve.red); - } - if (!this.x.red) - this.x = this.x.toRed(this.curve.red); - if (!this.y.red) - this.y = this.y.toRed(this.curve.red); - this.inf = false; - } -} -inherits(Point, Base.BasePoint); - -ShortCurve.prototype.point = function point(x, y, isRed) { - return new Point(this, x, y, isRed); -}; - -ShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) { - return Point.fromJSON(this, obj, red); -}; - -Point.prototype._getBeta = function _getBeta() { - if (!this.curve.endo) - return; - - var pre = this.precomputed; - if (pre && pre.beta) - return pre.beta; - - var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y); - if (pre) { - var curve = this.curve; - var endoMul = function(p) { - return curve.point(p.x.redMul(curve.endo.beta), p.y); - }; - pre.beta = beta; - beta.precomputed = { - beta: null, - naf: pre.naf && { - wnd: pre.naf.wnd, - points: pre.naf.points.map(endoMul), - }, - doubles: pre.doubles && { - step: pre.doubles.step, - points: pre.doubles.points.map(endoMul), - }, - }; - } - return beta; -}; - -Point.prototype.toJSON = function toJSON() { - if (!this.precomputed) - return [ this.x, this.y ]; - - return [ this.x, this.y, this.precomputed && { - doubles: this.precomputed.doubles && { - step: this.precomputed.doubles.step, - points: this.precomputed.doubles.points.slice(1), - }, - naf: this.precomputed.naf && { - wnd: this.precomputed.naf.wnd, - points: this.precomputed.naf.points.slice(1), - }, - } ]; -}; - -Point.fromJSON = function fromJSON(curve, obj, red) { - if (typeof obj === 'string') - obj = JSON.parse(obj); - var res = curve.point(obj[0], obj[1], red); - if (!obj[2]) - return res; - - function obj2point(obj) { - return curve.point(obj[0], obj[1], red); - } - - var pre = obj[2]; - res.precomputed = { - beta: null, - doubles: pre.doubles && { - step: pre.doubles.step, - points: [ res ].concat(pre.doubles.points.map(obj2point)), - }, - naf: pre.naf && { - wnd: pre.naf.wnd, - points: [ res ].concat(pre.naf.points.map(obj2point)), - }, - }; - return res; -}; - -Point.prototype.inspect = function inspect() { - if (this.isInfinity()) - return ''; - return ''; -}; - -Point.prototype.isInfinity = function isInfinity() { - return this.inf; -}; - -Point.prototype.add = function add(p) { - // O + P = P - if (this.inf) - return p; - - // P + O = P - if (p.inf) - return this; - - // P + P = 2P - if (this.eq(p)) - return this.dbl(); - - // P + (-P) = O - if (this.neg().eq(p)) - return this.curve.point(null, null); - - // P + Q = O - if (this.x.cmp(p.x) === 0) - return this.curve.point(null, null); - - var c = this.y.redSub(p.y); - if (c.cmpn(0) !== 0) - c = c.redMul(this.x.redSub(p.x).redInvm()); - var nx = c.redSqr().redISub(this.x).redISub(p.x); - var ny = c.redMul(this.x.redSub(nx)).redISub(this.y); - return this.curve.point(nx, ny); -}; - -Point.prototype.dbl = function dbl() { - if (this.inf) - return this; - - // 2P = O - var ys1 = this.y.redAdd(this.y); - if (ys1.cmpn(0) === 0) - return this.curve.point(null, null); - - var a = this.curve.a; - - var x2 = this.x.redSqr(); - var dyinv = ys1.redInvm(); - var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv); - - var nx = c.redSqr().redISub(this.x.redAdd(this.x)); - var ny = c.redMul(this.x.redSub(nx)).redISub(this.y); - return this.curve.point(nx, ny); -}; - -Point.prototype.getX = function getX() { - return this.x.fromRed(); -}; - -Point.prototype.getY = function getY() { - return this.y.fromRed(); -}; - -Point.prototype.mul = function mul(k) { - k = new BN(k, 16); - if (this.isInfinity()) - return this; - else if (this._hasDoubles(k)) - return this.curve._fixedNafMul(this, k); - else if (this.curve.endo) - return this.curve._endoWnafMulAdd([ this ], [ k ]); - else - return this.curve._wnafMul(this, k); -}; - -Point.prototype.mulAdd = function mulAdd(k1, p2, k2) { - var points = [ this, p2 ]; - var coeffs = [ k1, k2 ]; - if (this.curve.endo) - return this.curve._endoWnafMulAdd(points, coeffs); - else - return this.curve._wnafMulAdd(1, points, coeffs, 2); -}; - -Point.prototype.jmulAdd = function jmulAdd(k1, p2, k2) { - var points = [ this, p2 ]; - var coeffs = [ k1, k2 ]; - if (this.curve.endo) - return this.curve._endoWnafMulAdd(points, coeffs, true); - else - return this.curve._wnafMulAdd(1, points, coeffs, 2, true); -}; - -Point.prototype.eq = function eq(p) { - return this === p || - this.inf === p.inf && - (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0); -}; - -Point.prototype.neg = function neg(_precompute) { - if (this.inf) - return this; - - var res = this.curve.point(this.x, this.y.redNeg()); - if (_precompute && this.precomputed) { - var pre = this.precomputed; - var negate = function(p) { - return p.neg(); - }; - res.precomputed = { - naf: pre.naf && { - wnd: pre.naf.wnd, - points: pre.naf.points.map(negate), - }, - doubles: pre.doubles && { - step: pre.doubles.step, - points: pre.doubles.points.map(negate), - }, - }; - } - return res; -}; - -Point.prototype.toJ = function toJ() { - if (this.inf) - return this.curve.jpoint(null, null, null); - - var res = this.curve.jpoint(this.x, this.y, this.curve.one); - return res; -}; - -function JPoint(curve, x, y, z) { - Base.BasePoint.call(this, curve, 'jacobian'); - if (x === null && y === null && z === null) { - this.x = this.curve.one; - this.y = this.curve.one; - this.z = new BN(0); - } else { - this.x = new BN(x, 16); - this.y = new BN(y, 16); - this.z = new BN(z, 16); - } - if (!this.x.red) - this.x = this.x.toRed(this.curve.red); - if (!this.y.red) - this.y = this.y.toRed(this.curve.red); - if (!this.z.red) - this.z = this.z.toRed(this.curve.red); - - this.zOne = this.z === this.curve.one; -} -inherits(JPoint, Base.BasePoint); - -ShortCurve.prototype.jpoint = function jpoint(x, y, z) { - return new JPoint(this, x, y, z); -}; - -JPoint.prototype.toP = function toP() { - if (this.isInfinity()) - return this.curve.point(null, null); - - var zinv = this.z.redInvm(); - var zinv2 = zinv.redSqr(); - var ax = this.x.redMul(zinv2); - var ay = this.y.redMul(zinv2).redMul(zinv); - - return this.curve.point(ax, ay); -}; - -JPoint.prototype.neg = function neg() { - return this.curve.jpoint(this.x, this.y.redNeg(), this.z); -}; - -JPoint.prototype.add = function add(p) { - // O + P = P - if (this.isInfinity()) - return p; - - // P + O = P - if (p.isInfinity()) - return this; - - // 12M + 4S + 7A - var pz2 = p.z.redSqr(); - var z2 = this.z.redSqr(); - var u1 = this.x.redMul(pz2); - var u2 = p.x.redMul(z2); - var s1 = this.y.redMul(pz2.redMul(p.z)); - var s2 = p.y.redMul(z2.redMul(this.z)); - - var h = u1.redSub(u2); - var r = s1.redSub(s2); - if (h.cmpn(0) === 0) { - if (r.cmpn(0) !== 0) - return this.curve.jpoint(null, null, null); - else - return this.dbl(); - } - - var h2 = h.redSqr(); - var h3 = h2.redMul(h); - var v = u1.redMul(h2); - - var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v); - var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)); - var nz = this.z.redMul(p.z).redMul(h); - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype.mixedAdd = function mixedAdd(p) { - // O + P = P - if (this.isInfinity()) - return p.toJ(); - - // P + O = P - if (p.isInfinity()) - return this; - - // 8M + 3S + 7A - var z2 = this.z.redSqr(); - var u1 = this.x; - var u2 = p.x.redMul(z2); - var s1 = this.y; - var s2 = p.y.redMul(z2).redMul(this.z); - - var h = u1.redSub(u2); - var r = s1.redSub(s2); - if (h.cmpn(0) === 0) { - if (r.cmpn(0) !== 0) - return this.curve.jpoint(null, null, null); - else - return this.dbl(); - } - - var h2 = h.redSqr(); - var h3 = h2.redMul(h); - var v = u1.redMul(h2); - - var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v); - var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3)); - var nz = this.z.redMul(h); - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype.dblp = function dblp(pow) { - if (pow === 0) - return this; - if (this.isInfinity()) - return this; - if (!pow) - return this.dbl(); - - var i; - if (this.curve.zeroA || this.curve.threeA) { - var r = this; - for (i = 0; i < pow; i++) - r = r.dbl(); - return r; - } - - // 1M + 2S + 1A + N * (4S + 5M + 8A) - // N = 1 => 6M + 6S + 9A - var a = this.curve.a; - var tinv = this.curve.tinv; - - var jx = this.x; - var jy = this.y; - var jz = this.z; - var jz4 = jz.redSqr().redSqr(); - - // Reuse results - var jyd = jy.redAdd(jy); - for (i = 0; i < pow; i++) { - var jx2 = jx.redSqr(); - var jyd2 = jyd.redSqr(); - var jyd4 = jyd2.redSqr(); - var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)); - - var t1 = jx.redMul(jyd2); - var nx = c.redSqr().redISub(t1.redAdd(t1)); - var t2 = t1.redISub(nx); - var dny = c.redMul(t2); - dny = dny.redIAdd(dny).redISub(jyd4); - var nz = jyd.redMul(jz); - if (i + 1 < pow) - jz4 = jz4.redMul(jyd4); - - jx = nx; - jz = nz; - jyd = dny; - } - - return this.curve.jpoint(jx, jyd.redMul(tinv), jz); -}; - -JPoint.prototype.dbl = function dbl() { - if (this.isInfinity()) - return this; - - if (this.curve.zeroA) - return this._zeroDbl(); - else if (this.curve.threeA) - return this._threeDbl(); - else - return this._dbl(); -}; - -JPoint.prototype._zeroDbl = function _zeroDbl() { - var nx; - var ny; - var nz; - // Z = 1 - if (this.zOne) { - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html - // #doubling-mdbl-2007-bl - // 1M + 5S + 14A - - // XX = X1^2 - var xx = this.x.redSqr(); - // YY = Y1^2 - var yy = this.y.redSqr(); - // YYYY = YY^2 - var yyyy = yy.redSqr(); - // S = 2 * ((X1 + YY)^2 - XX - YYYY) - var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); - s = s.redIAdd(s); - // M = 3 * XX + a; a = 0 - var m = xx.redAdd(xx).redIAdd(xx); - // T = M ^ 2 - 2*S - var t = m.redSqr().redISub(s).redISub(s); - - // 8 * YYYY - var yyyy8 = yyyy.redIAdd(yyyy); - yyyy8 = yyyy8.redIAdd(yyyy8); - yyyy8 = yyyy8.redIAdd(yyyy8); - - // X3 = T - nx = t; - // Y3 = M * (S - T) - 8 * YYYY - ny = m.redMul(s.redISub(t)).redISub(yyyy8); - // Z3 = 2*Y1 - nz = this.y.redAdd(this.y); - } else { - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html - // #doubling-dbl-2009-l - // 2M + 5S + 13A - - // A = X1^2 - var a = this.x.redSqr(); - // B = Y1^2 - var b = this.y.redSqr(); - // C = B^2 - var c = b.redSqr(); - // D = 2 * ((X1 + B)^2 - A - C) - var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c); - d = d.redIAdd(d); - // E = 3 * A - var e = a.redAdd(a).redIAdd(a); - // F = E^2 - var f = e.redSqr(); - - // 8 * C - var c8 = c.redIAdd(c); - c8 = c8.redIAdd(c8); - c8 = c8.redIAdd(c8); - - // X3 = F - 2 * D - nx = f.redISub(d).redISub(d); - // Y3 = E * (D - X3) - 8 * C - ny = e.redMul(d.redISub(nx)).redISub(c8); - // Z3 = 2 * Y1 * Z1 - nz = this.y.redMul(this.z); - nz = nz.redIAdd(nz); - } - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype._threeDbl = function _threeDbl() { - var nx; - var ny; - var nz; - // Z = 1 - if (this.zOne) { - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html - // #doubling-mdbl-2007-bl - // 1M + 5S + 15A - - // XX = X1^2 - var xx = this.x.redSqr(); - // YY = Y1^2 - var yy = this.y.redSqr(); - // YYYY = YY^2 - var yyyy = yy.redSqr(); - // S = 2 * ((X1 + YY)^2 - XX - YYYY) - var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); - s = s.redIAdd(s); - // M = 3 * XX + a - var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a); - // T = M^2 - 2 * S - var t = m.redSqr().redISub(s).redISub(s); - // X3 = T - nx = t; - // Y3 = M * (S - T) - 8 * YYYY - var yyyy8 = yyyy.redIAdd(yyyy); - yyyy8 = yyyy8.redIAdd(yyyy8); - yyyy8 = yyyy8.redIAdd(yyyy8); - ny = m.redMul(s.redISub(t)).redISub(yyyy8); - // Z3 = 2 * Y1 - nz = this.y.redAdd(this.y); - } else { - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b - // 3M + 5S - - // delta = Z1^2 - var delta = this.z.redSqr(); - // gamma = Y1^2 - var gamma = this.y.redSqr(); - // beta = X1 * gamma - var beta = this.x.redMul(gamma); - // alpha = 3 * (X1 - delta) * (X1 + delta) - var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta)); - alpha = alpha.redAdd(alpha).redIAdd(alpha); - // X3 = alpha^2 - 8 * beta - var beta4 = beta.redIAdd(beta); - beta4 = beta4.redIAdd(beta4); - var beta8 = beta4.redAdd(beta4); - nx = alpha.redSqr().redISub(beta8); - // Z3 = (Y1 + Z1)^2 - gamma - delta - nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta); - // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2 - var ggamma8 = gamma.redSqr(); - ggamma8 = ggamma8.redIAdd(ggamma8); - ggamma8 = ggamma8.redIAdd(ggamma8); - ggamma8 = ggamma8.redIAdd(ggamma8); - ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8); - } - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype._dbl = function _dbl() { - var a = this.curve.a; - - // 4M + 6S + 10A - var jx = this.x; - var jy = this.y; - var jz = this.z; - var jz4 = jz.redSqr().redSqr(); - - var jx2 = jx.redSqr(); - var jy2 = jy.redSqr(); - - var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4)); - - var jxd4 = jx.redAdd(jx); - jxd4 = jxd4.redIAdd(jxd4); - var t1 = jxd4.redMul(jy2); - var nx = c.redSqr().redISub(t1.redAdd(t1)); - var t2 = t1.redISub(nx); - - var jyd8 = jy2.redSqr(); - jyd8 = jyd8.redIAdd(jyd8); - jyd8 = jyd8.redIAdd(jyd8); - jyd8 = jyd8.redIAdd(jyd8); - var ny = c.redMul(t2).redISub(jyd8); - var nz = jy.redAdd(jy).redMul(jz); - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype.trpl = function trpl() { - if (!this.curve.zeroA) - return this.dbl().add(this); - - // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl - // 5M + 10S + ... - - // XX = X1^2 - var xx = this.x.redSqr(); - // YY = Y1^2 - var yy = this.y.redSqr(); - // ZZ = Z1^2 - var zz = this.z.redSqr(); - // YYYY = YY^2 - var yyyy = yy.redSqr(); - // M = 3 * XX + a * ZZ2; a = 0 - var m = xx.redAdd(xx).redIAdd(xx); - // MM = M^2 - var mm = m.redSqr(); - // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM - var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy); - e = e.redIAdd(e); - e = e.redAdd(e).redIAdd(e); - e = e.redISub(mm); - // EE = E^2 - var ee = e.redSqr(); - // T = 16*YYYY - var t = yyyy.redIAdd(yyyy); - t = t.redIAdd(t); - t = t.redIAdd(t); - t = t.redIAdd(t); - // U = (M + E)^2 - MM - EE - T - var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t); - // X3 = 4 * (X1 * EE - 4 * YY * U) - var yyu4 = yy.redMul(u); - yyu4 = yyu4.redIAdd(yyu4); - yyu4 = yyu4.redIAdd(yyu4); - var nx = this.x.redMul(ee).redISub(yyu4); - nx = nx.redIAdd(nx); - nx = nx.redIAdd(nx); - // Y3 = 8 * Y1 * (U * (T - U) - E * EE) - var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee))); - ny = ny.redIAdd(ny); - ny = ny.redIAdd(ny); - ny = ny.redIAdd(ny); - // Z3 = (Z1 + E)^2 - ZZ - EE - var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee); - - return this.curve.jpoint(nx, ny, nz); -}; - -JPoint.prototype.mul = function mul(k, kbase) { - k = new BN(k, kbase); - - return this.curve._wnafMul(this, k); -}; - -JPoint.prototype.eq = function eq(p) { - if (p.type === 'affine') - return this.eq(p.toJ()); - - if (this === p) - return true; - - // x1 * z2^2 == x2 * z1^2 - var z2 = this.z.redSqr(); - var pz2 = p.z.redSqr(); - if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0) - return false; - - // y1 * z2^3 == y2 * z1^3 - var z3 = z2.redMul(this.z); - var pz3 = pz2.redMul(p.z); - return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0; -}; - -JPoint.prototype.eqXToP = function eqXToP(x) { - var zs = this.z.redSqr(); - var rx = x.toRed(this.curve.red).redMul(zs); - if (this.x.cmp(rx) === 0) - return true; - - var xc = x.clone(); - var t = this.curve.redN.redMul(zs); - for (;;) { - xc.iadd(this.curve.n); - if (xc.cmp(this.curve.p) >= 0) - return false; - - rx.redIAdd(t); - if (this.x.cmp(rx) === 0) - return true; - } -}; - -JPoint.prototype.inspect = function inspect() { - if (this.isInfinity()) - return ''; - return ''; -}; - -JPoint.prototype.isInfinity = function isInfinity() { - // XXX This code assumes that zero is always zero in red - return this.z.cmpn(0) === 0; -}; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/curves.js": -/*!******************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/curves.js ***! - \******************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var curves = exports; - -var hash = __webpack_require__(/*! hash.js */ "./node_modules/hash.js/lib/hash.js"); -var curve = __webpack_require__(/*! ./curve */ "./node_modules/elliptic/lib/elliptic/curve/index.js"); -var utils = __webpack_require__(/*! ./utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); - -var assert = utils.assert; - -function PresetCurve(options) { - 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); - this.g = this.curve.g; - this.n = this.curve.n; - this.hash = options.hash; - - assert(this.g.validate(), 'Invalid curve'); - assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O'); -} -curves.PresetCurve = PresetCurve; - -function defineCurve(name, options) { - Object.defineProperty(curves, name, { - configurable: true, - enumerable: true, - get: function() { - var curve = new PresetCurve(options); - Object.defineProperty(curves, name, { - configurable: true, - enumerable: true, - value: curve, - }); - return curve; - }, - }); -} - -defineCurve('p192', { - type: 'short', - prime: 'p192', - p: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff', - a: 'ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc', - b: '64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1', - n: 'ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831', - hash: hash.sha256, - gRed: false, - g: [ - '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012', - '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811', - ], -}); - -defineCurve('p224', { - type: 'short', - prime: 'p224', - p: 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001', - a: 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe', - b: 'b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4', - n: 'ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d', - hash: hash.sha256, - gRed: false, - g: [ - 'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21', - 'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34', - ], -}); - -defineCurve('p256', { - type: 'short', - prime: null, - p: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff', - a: 'ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc', - b: '5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b', - n: 'ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551', - hash: hash.sha256, - gRed: false, - g: [ - '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296', - '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5', - ], -}); - -defineCurve('p384', { - type: 'short', - prime: null, - p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'fffffffe ffffffff 00000000 00000000 ffffffff', - a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'fffffffe ffffffff 00000000 00000000 fffffffc', - b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' + - '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef', - n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' + - 'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973', - hash: hash.sha384, - gRed: false, - 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', - ], -}); - -defineCurve('p521', { - type: 'short', - prime: null, - p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff ffffffff ffffffff ffffffff', - a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff ffffffff ffffffff fffffffc', - b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' + - '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' + - '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00', - n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' + - 'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' + - 'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409', - hash: hash.sha512, - gRed: false, - 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', - ], -}); - -defineCurve('curve25519', { - type: 'mont', - prime: 'p25519', - p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed', - a: '76d06', - b: '1', - n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed', - hash: hash.sha256, - gRed: false, - g: [ - '9', - ], -}); - -defineCurve('ed25519', { - type: 'edwards', - prime: 'p25519', - p: '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed', - a: '-1', - c: '1', - // -121665 * (121666^(-1)) (mod P) - d: '52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3', - n: '1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed', - hash: hash.sha256, - gRed: false, - g: [ - '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a', - - // 4/5 - '6666666666666666666666666666666666666666666666666666666666666658', - ], -}); - -var pre; -try { - pre = __webpack_require__(/*! ./precomputed/secp256k1 */ "./node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js"); -} catch (e) { - pre = undefined; -} - -defineCurve('secp256k1', { - type: 'short', - prime: 'k256', - p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f', - a: '0', - b: '7', - n: 'ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141', - h: '1', - hash: hash.sha256, - - // Precomputed endomorphism - beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee', - lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72', - basis: [ - { - a: '3086d221a7d46bcde86c90e49284eb15', - b: '-e4437ed6010e88286f547fa90abfe4c3', - }, - { - a: '114ca50f7a8e2f3f657c1108d9d44cfd8', - b: '3086d221a7d46bcde86c90e49284eb15', - }, - ], - - gRed: false, - g: [ - '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798', - '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8', - pre, - ], -}); - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/ec/index.js": -/*!********************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/ec/index.js ***! - \********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); -var HmacDRBG = __webpack_require__(/*! hmac-drbg */ "./node_modules/hmac-drbg/lib/hmac-drbg.js"); -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var curves = __webpack_require__(/*! ../curves */ "./node_modules/elliptic/lib/elliptic/curves.js"); -var rand = __webpack_require__(/*! brorand */ "./node_modules/brorand/index.js"); -var assert = utils.assert; - -var KeyPair = __webpack_require__(/*! ./key */ "./node_modules/elliptic/lib/elliptic/ec/key.js"); -var Signature = __webpack_require__(/*! ./signature */ "./node_modules/elliptic/lib/elliptic/ec/signature.js"); - -function EC(options) { - if (!(this instanceof EC)) - return new EC(options); - - // Shortcut `elliptic.ec(curve-name)` - if (typeof options === 'string') { - assert(Object.prototype.hasOwnProperty.call(curves, options), - 'Unknown curve ' + options); - - options = curves[options]; - } - - // Shortcut for `elliptic.ec(elliptic.curves.curveName)` - if (options instanceof curves.PresetCurve) - options = { curve: options }; - - this.curve = options.curve.curve; - this.n = this.curve.n; - this.nh = this.n.ushrn(1); - this.g = this.curve.g; - - // Point on curve - this.g = options.curve.g; - this.g.precompute(options.curve.n.bitLength() + 1); - - // Hash for function for DRBG - this.hash = options.hash || options.curve.hash; -} -module.exports = EC; - -EC.prototype.keyPair = function keyPair(options) { - return new KeyPair(this, options); -}; - -EC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) { - return KeyPair.fromPrivate(this, priv, enc); -}; - -EC.prototype.keyFromPublic = function keyFromPublic(pub, enc) { - return KeyPair.fromPublic(this, pub, enc); -}; - -EC.prototype.genKeyPair = function genKeyPair(options) { - if (!options) - options = {}; - - // Instantiate Hmac_DRBG - var drbg = new HmacDRBG({ - hash: this.hash, - pers: options.pers, - persEnc: options.persEnc || 'utf8', - entropy: options.entropy || rand(this.hash.hmacStrength), - entropyEnc: options.entropy && options.entropyEnc || 'utf8', - nonce: this.n.toArray(), - }); - - var bytes = this.n.byteLength(); - var ns2 = this.n.sub(new BN(2)); - for (;;) { - var priv = new BN(drbg.generate(bytes)); - if (priv.cmp(ns2) > 0) - continue; - - priv.iaddn(1); - return this.keyFromPrivate(priv); - } -}; - -EC.prototype._truncateToN = function _truncateToN(msg, truncOnly) { - var delta = msg.byteLength() * 8 - this.n.bitLength(); - if (delta > 0) - msg = msg.ushrn(delta); - if (!truncOnly && msg.cmp(this.n) >= 0) - return msg.sub(this.n); - else - return msg; -}; - -EC.prototype.sign = function sign(msg, key, enc, options) { - if (typeof enc === 'object') { - options = enc; - enc = null; - } - if (!options) - options = {}; - - key = this.keyFromPrivate(key, enc); - msg = this._truncateToN(new BN(msg, 16)); - - // Zero-extend key to provide enough entropy - var bytes = this.n.byteLength(); - var bkey = key.getPrivate().toArray('be', bytes); - - // Zero-extend nonce to have the same byte size as N - var nonce = msg.toArray('be', bytes); - - // Instantiate Hmac_DRBG - var drbg = new HmacDRBG({ - hash: this.hash, - entropy: bkey, - nonce: nonce, - pers: options.pers, - persEnc: options.persEnc || 'utf8', - }); - - // Number of bytes to generate - var ns1 = this.n.sub(new BN(1)); - - for (var iter = 0; ; iter++) { - var k = options.k ? - options.k(iter) : - new BN(drbg.generate(this.n.byteLength())); - k = this._truncateToN(k, true); - if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0) - continue; - - var kp = this.g.mul(k); - if (kp.isInfinity()) - continue; - - var kpX = kp.getX(); - var r = kpX.umod(this.n); - if (r.cmpn(0) === 0) - continue; - - var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg)); - s = s.umod(this.n); - if (s.cmpn(0) === 0) - continue; - - var recoveryParam = (kp.getY().isOdd() ? 1 : 0) | - (kpX.cmp(r) !== 0 ? 2 : 0); - - // Use complement of `s`, if it is > `n / 2` - if (options.canonical && s.cmp(this.nh) > 0) { - s = this.n.sub(s); - recoveryParam ^= 1; - } - - return new Signature({ r: r, s: s, recoveryParam: recoveryParam }); - } -}; - -EC.prototype.verify = function verify(msg, signature, key, enc) { - msg = this._truncateToN(new BN(msg, 16)); - key = this.keyFromPublic(key, enc); - signature = new Signature(signature, 'hex'); - - // Perform primitive values validation - var r = signature.r; - var s = signature.s; - if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0) - return false; - if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0) - return false; - - // Validate signature - var sinv = s.invm(this.n); - var u1 = sinv.mul(msg).umod(this.n); - var u2 = sinv.mul(r).umod(this.n); - var p; - - if (!this.curve._maxwellTrick) { - p = this.g.mulAdd(u1, key.getPublic(), u2); - if (p.isInfinity()) - return false; - - return p.getX().umod(this.n).cmp(r) === 0; - } - - // NOTE: Greg Maxwell's trick, inspired by: - // https://git.io/vad3K - - p = this.g.jmulAdd(u1, key.getPublic(), u2); - if (p.isInfinity()) - return false; - - // Compare `p.x` of Jacobian point with `r`, - // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the - // inverse of `p.z^2` - return p.eqXToP(r); -}; - -EC.prototype.recoverPubKey = function(msg, signature, j, enc) { - assert((3 & j) === j, 'The recovery param is more than two bits'); - signature = new Signature(signature, enc); - - var n = this.n; - var e = new BN(msg); - var r = signature.r; - var s = signature.s; - - // A set LSB signifies that the y-coordinate is odd - var isYOdd = j & 1; - var isSecondKey = j >> 1; - if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey) - throw new Error('Unable to find sencond key candinate'); - - // 1.1. Let x = r + jn. - if (isSecondKey) - r = this.curve.pointFromX(r.add(this.curve.n), isYOdd); - else - r = this.curve.pointFromX(r, isYOdd); - - var rInv = signature.r.invm(n); - var s1 = n.sub(e).mul(rInv).umod(n); - var s2 = s.mul(rInv).umod(n); - - // 1.6.1 Compute Q = r^-1 (sR - eG) - // Q = r^-1 (sR + -eG) - return this.g.mulAdd(s1, r, s2); -}; - -EC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) { - signature = new Signature(signature, enc); - if (signature.recoveryParam !== null) - return signature.recoveryParam; - - for (var i = 0; i < 4; i++) { - var Qprime; - try { - Qprime = this.recoverPubKey(e, signature, i); - } catch (e) { - continue; - } - - if (Qprime.eq(Q)) - return i; - } - throw new Error('Unable to find valid recovery factor'); -}; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/ec/key.js": -/*!******************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/ec/key.js ***! - \******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var assert = utils.assert; - -function KeyPair(ec, options) { - this.ec = ec; - this.priv = null; - this.pub = null; - - // KeyPair(ec, { priv: ..., pub: ... }) - if (options.priv) - this._importPrivate(options.priv, options.privEnc); - if (options.pub) - this._importPublic(options.pub, options.pubEnc); -} -module.exports = KeyPair; - -KeyPair.fromPublic = function fromPublic(ec, pub, enc) { - if (pub instanceof KeyPair) - return pub; - - return new KeyPair(ec, { - pub: pub, - pubEnc: enc, - }); -}; - -KeyPair.fromPrivate = function fromPrivate(ec, priv, enc) { - if (priv instanceof KeyPair) - return priv; - - return new KeyPair(ec, { - priv: priv, - privEnc: enc, - }); -}; - -KeyPair.prototype.validate = function validate() { - var pub = this.getPublic(); - - if (pub.isInfinity()) - return { result: false, reason: 'Invalid public key' }; - if (!pub.validate()) - return { result: false, reason: 'Public key is not a point' }; - if (!pub.mul(this.ec.curve.n).isInfinity()) - return { result: false, reason: 'Public key * N != O' }; - - return { result: true, reason: null }; -}; - -KeyPair.prototype.getPublic = function getPublic(compact, enc) { - // compact is optional argument - if (typeof compact === 'string') { - enc = compact; - compact = null; - } - - if (!this.pub) - this.pub = this.ec.g.mul(this.priv); - - if (!enc) - return this.pub; - - return this.pub.encode(enc, compact); -}; - -KeyPair.prototype.getPrivate = function getPrivate(enc) { - if (enc === 'hex') - return this.priv.toString(16, 2); - else - return this.priv; -}; - -KeyPair.prototype._importPrivate = function _importPrivate(key, enc) { - this.priv = new BN(key, enc || 16); - - // Ensure that the priv won't be bigger than n, otherwise we may fail - // in fixed multiplication method - this.priv = this.priv.umod(this.ec.curve.n); -}; - -KeyPair.prototype._importPublic = function _importPublic(key, enc) { - if (key.x || key.y) { - // Montgomery points only have an `x` coordinate. - // Weierstrass/Edwards points on the other hand have both `x` and - // `y` coordinates. - if (this.ec.curve.type === 'mont') { - assert(key.x, 'Need x coordinate'); - } else if (this.ec.curve.type === 'short' || - this.ec.curve.type === 'edwards') { - assert(key.x && key.y, 'Need both x and y coordinate'); - } - this.pub = this.ec.curve.point(key.x, key.y); - return; - } - this.pub = this.ec.curve.decodePoint(key, enc); -}; - -// ECDH -KeyPair.prototype.derive = function derive(pub) { - if(!pub.validate()) { - assert(pub.validate(), 'public point not validated'); - } - return pub.mul(this.priv).getX(); -}; - -// ECDSA -KeyPair.prototype.sign = function sign(msg, enc, options) { - return this.ec.sign(msg, this, enc, options); -}; - -KeyPair.prototype.verify = function verify(msg, signature) { - return this.ec.verify(msg, signature, this); -}; - -KeyPair.prototype.inspect = function inspect() { - return ''; -}; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/ec/signature.js": -/*!************************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/ec/signature.js ***! - \************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var assert = utils.assert; - -function Signature(options, enc) { - if (options instanceof Signature) - return options; - - if (this._importDER(options, enc)) - return; - - assert(options.r && options.s, 'Signature without r or s'); - this.r = new BN(options.r, 16); - this.s = new BN(options.s, 16); - if (options.recoveryParam === undefined) - this.recoveryParam = null; - else - this.recoveryParam = options.recoveryParam; -} -module.exports = Signature; - -function Position() { - this.place = 0; -} - -function getLength(buf, p) { - var initial = buf[p.place++]; - if (!(initial & 0x80)) { - return initial; - } - var octetLen = initial & 0xf; - - // Indefinite length or overflow - if (octetLen === 0 || octetLen > 4) { - return false; - } - - var val = 0; - for (var i = 0, off = p.place; i < octetLen; i++, off++) { - val <<= 8; - val |= buf[off]; - val >>>= 0; - } - - // Leading zeroes - if (val <= 0x7f) { - return false; - } - - p.place = off; - return val; -} - -function rmPadding(buf) { - var i = 0; - var len = buf.length - 1; - while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) { - i++; - } - if (i === 0) { - return buf; - } - return buf.slice(i); -} - -Signature.prototype._importDER = function _importDER(data, enc) { - data = utils.toArray(data, enc); - var p = new Position(); - if (data[p.place++] !== 0x30) { - return false; - } - var len = getLength(data, p); - if (len === false) { - return false; - } - if ((len + p.place) !== data.length) { - return false; - } - if (data[p.place++] !== 0x02) { - return false; - } - var rlen = getLength(data, p); - if (rlen === false) { - return false; - } - var r = data.slice(p.place, rlen + p.place); - p.place += rlen; - if (data[p.place++] !== 0x02) { - return false; - } - var slen = getLength(data, p); - if (slen === false) { - return false; - } - if (data.length !== slen + p.place) { - return false; - } - var s = data.slice(p.place, slen + p.place); - if (r[0] === 0) { - if (r[1] & 0x80) { - r = r.slice(1); - } else { - // Leading zeroes - return false; - } - } - if (s[0] === 0) { - if (s[1] & 0x80) { - s = s.slice(1); - } else { - // Leading zeroes - return false; - } - } - - this.r = new BN(r); - this.s = new BN(s); - this.recoveryParam = null; - - return true; -}; - -function constructLength(arr, len) { - if (len < 0x80) { - arr.push(len); - return; - } - var octets = 1 + (Math.log(len) / Math.LN2 >>> 3); - arr.push(octets | 0x80); - while (--octets) { - arr.push((len >>> (octets << 3)) & 0xff); - } - arr.push(len); -} - -Signature.prototype.toDER = function toDER(enc) { - var r = this.r.toArray(); - var s = this.s.toArray(); - - // Pad values - if (r[0] & 0x80) - r = [ 0 ].concat(r); - // Pad values - if (s[0] & 0x80) - s = [ 0 ].concat(s); - - r = rmPadding(r); - s = rmPadding(s); - - while (!s[0] && !(s[1] & 0x80)) { - s = s.slice(1); - } - var arr = [ 0x02 ]; - constructLength(arr, r.length); - arr = arr.concat(r); - arr.push(0x02); - constructLength(arr, s.length); - var backHalf = arr.concat(s); - var res = [ 0x30 ]; - constructLength(res, backHalf.length); - res = res.concat(backHalf); - return utils.encode(res, enc); -}; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/eddsa/index.js": -/*!***********************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/eddsa/index.js ***! - \***********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var hash = __webpack_require__(/*! hash.js */ "./node_modules/hash.js/lib/hash.js"); -var curves = __webpack_require__(/*! ../curves */ "./node_modules/elliptic/lib/elliptic/curves.js"); -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var assert = utils.assert; -var parseBytes = utils.parseBytes; -var KeyPair = __webpack_require__(/*! ./key */ "./node_modules/elliptic/lib/elliptic/eddsa/key.js"); -var Signature = __webpack_require__(/*! ./signature */ "./node_modules/elliptic/lib/elliptic/eddsa/signature.js"); - -function EDDSA(curve) { - assert(curve === 'ed25519', 'only tested with ed25519 so far'); - - if (!(this instanceof EDDSA)) - return new EDDSA(curve); - - curve = curves[curve].curve; - this.curve = curve; - this.g = curve.g; - this.g.precompute(curve.n.bitLength() + 1); - - this.pointClass = curve.point().constructor; - this.encodingLength = Math.ceil(curve.n.bitLength() / 8); - this.hash = hash.sha512; -} - -module.exports = EDDSA; - -/** -* @param {Array|String} message - message bytes -* @param {Array|String|KeyPair} secret - secret bytes or a keypair -* @returns {Signature} - signature -*/ -EDDSA.prototype.sign = function sign(message, secret) { - message = parseBytes(message); - var key = this.keyFromSecret(secret); - var r = this.hashInt(key.messagePrefix(), message); - var R = this.g.mul(r); - var Rencoded = this.encodePoint(R); - var s_ = this.hashInt(Rencoded, key.pubBytes(), message) - .mul(key.priv()); - var S = r.add(s_).umod(this.curve.n); - return this.makeSignature({ R: R, S: S, Rencoded: Rencoded }); -}; - -/** -* @param {Array} message - message bytes -* @param {Array|String|Signature} sig - sig bytes -* @param {Array|String|Point|KeyPair} pub - public key -* @returns {Boolean} - true if public key matches sig of message -*/ -EDDSA.prototype.verify = function verify(message, sig, pub) { - message = parseBytes(message); - sig = this.makeSignature(sig); - var key = this.keyFromPublic(pub); - var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message); - var SG = this.g.mul(sig.S()); - var RplusAh = sig.R().add(key.pub().mul(h)); - return RplusAh.eq(SG); -}; - -EDDSA.prototype.hashInt = function hashInt() { - var hash = this.hash(); - for (var i = 0; i < arguments.length; i++) - hash.update(arguments[i]); - return utils.intFromLE(hash.digest()).umod(this.curve.n); -}; - -EDDSA.prototype.keyFromPublic = function keyFromPublic(pub) { - return KeyPair.fromPublic(this, pub); -}; - -EDDSA.prototype.keyFromSecret = function keyFromSecret(secret) { - return KeyPair.fromSecret(this, secret); -}; - -EDDSA.prototype.makeSignature = function makeSignature(sig) { - if (sig instanceof Signature) - return sig; - return new Signature(this, sig); -}; - -/** -* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2 -* -* EDDSA defines methods for encoding and decoding points and integers. These are -* helper convenience methods, that pass along to utility functions implied -* parameters. -* -*/ -EDDSA.prototype.encodePoint = function encodePoint(point) { - var enc = point.getY().toArray('le', this.encodingLength); - enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0; - return enc; -}; - -EDDSA.prototype.decodePoint = function decodePoint(bytes) { - bytes = utils.parseBytes(bytes); - - var lastIx = bytes.length - 1; - var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80); - var xIsOdd = (bytes[lastIx] & 0x80) !== 0; - - var y = utils.intFromLE(normed); - return this.curve.pointFromY(y, xIsOdd); -}; - -EDDSA.prototype.encodeInt = function encodeInt(num) { - return num.toArray('le', this.encodingLength); -}; - -EDDSA.prototype.decodeInt = function decodeInt(bytes) { - return utils.intFromLE(bytes); -}; - -EDDSA.prototype.isPoint = function isPoint(val) { - return val instanceof this.pointClass; -}; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/eddsa/key.js": -/*!*********************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/eddsa/key.js ***! - \*********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var assert = utils.assert; -var parseBytes = utils.parseBytes; -var cachedProperty = utils.cachedProperty; - -/** -* @param {EDDSA} eddsa - instance -* @param {Object} params - public/private key parameters -* -* @param {Array} [params.secret] - secret seed bytes -* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms) -* @param {Array} [params.pub] - public key point encoded as bytes -* -*/ -function KeyPair(eddsa, params) { - this.eddsa = eddsa; - this._secret = parseBytes(params.secret); - if (eddsa.isPoint(params.pub)) - this._pub = params.pub; - else - this._pubBytes = parseBytes(params.pub); -} - -KeyPair.fromPublic = function fromPublic(eddsa, pub) { - if (pub instanceof KeyPair) - return pub; - return new KeyPair(eddsa, { pub: pub }); -}; - -KeyPair.fromSecret = function fromSecret(eddsa, secret) { - if (secret instanceof KeyPair) - return secret; - return new KeyPair(eddsa, { secret: secret }); -}; - -KeyPair.prototype.secret = function secret() { - return this._secret; -}; - -cachedProperty(KeyPair, 'pubBytes', function pubBytes() { - return this.eddsa.encodePoint(this.pub()); -}); - -cachedProperty(KeyPair, 'pub', function pub() { - if (this._pubBytes) - return this.eddsa.decodePoint(this._pubBytes); - return this.eddsa.g.mul(this.priv()); -}); - -cachedProperty(KeyPair, 'privBytes', function privBytes() { - var eddsa = this.eddsa; - var hash = this.hash(); - var lastIx = eddsa.encodingLength - 1; - - var a = hash.slice(0, eddsa.encodingLength); - a[0] &= 248; - a[lastIx] &= 127; - a[lastIx] |= 64; - - return a; -}); - -cachedProperty(KeyPair, 'priv', function priv() { - return this.eddsa.decodeInt(this.privBytes()); -}); - -cachedProperty(KeyPair, 'hash', function hash() { - return this.eddsa.hash().update(this.secret()).digest(); -}); - -cachedProperty(KeyPair, 'messagePrefix', function messagePrefix() { - return this.hash().slice(this.eddsa.encodingLength); -}); - -KeyPair.prototype.sign = function sign(message) { - assert(this._secret, 'KeyPair can only verify'); - return this.eddsa.sign(message, this); -}; - -KeyPair.prototype.verify = function verify(message, sig) { - return this.eddsa.verify(message, sig, this); -}; - -KeyPair.prototype.getSecret = function getSecret(enc) { - assert(this._secret, 'KeyPair is public only'); - return utils.encode(this.secret(), enc); -}; - -KeyPair.prototype.getPublic = function getPublic(enc) { - return utils.encode(this.pubBytes(), enc); -}; - -module.exports = KeyPair; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/eddsa/signature.js": -/*!***************************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/eddsa/signature.js ***! - \***************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); -var utils = __webpack_require__(/*! ../utils */ "./node_modules/elliptic/lib/elliptic/utils.js"); -var assert = utils.assert; -var cachedProperty = utils.cachedProperty; -var parseBytes = utils.parseBytes; - -/** -* @param {EDDSA} eddsa - eddsa instance -* @param {Array|Object} sig - -* @param {Array|Point} [sig.R] - R point as Point or bytes -* @param {Array|bn} [sig.S] - S scalar as bn or bytes -* @param {Array} [sig.Rencoded] - R point encoded -* @param {Array} [sig.Sencoded] - S scalar encoded -*/ -function Signature(eddsa, sig) { - this.eddsa = eddsa; - - if (typeof sig !== 'object') - sig = parseBytes(sig); - - if (Array.isArray(sig)) { - sig = { - R: sig.slice(0, eddsa.encodingLength), - S: sig.slice(eddsa.encodingLength), - }; - } - - assert(sig.R && sig.S, 'Signature without R or S'); - - if (eddsa.isPoint(sig.R)) - this._R = sig.R; - if (sig.S instanceof BN) - this._S = sig.S; - - this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded; - this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded; -} - -cachedProperty(Signature, 'S', function S() { - return this.eddsa.decodeInt(this.Sencoded()); -}); - -cachedProperty(Signature, 'R', function R() { - return this.eddsa.decodePoint(this.Rencoded()); -}); - -cachedProperty(Signature, 'Rencoded', function Rencoded() { - return this.eddsa.encodePoint(this.R()); -}); - -cachedProperty(Signature, 'Sencoded', function Sencoded() { - return this.eddsa.encodeInt(this.S()); -}); - -Signature.prototype.toBytes = function toBytes() { - return this.Rencoded().concat(this.Sencoded()); -}; - -Signature.prototype.toHex = function toHex() { - return utils.encode(this.toBytes(), 'hex').toUpperCase(); -}; - -module.exports = Signature; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js": -/*!*********************************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js ***! - \*********************************************************************/ -/***/ ((module) => { - -module.exports = { - doubles: { - step: 4, - points: [ - [ - 'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a', - 'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821', - ], - [ - '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508', - '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf', - ], - [ - '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739', - 'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695', - ], - [ - '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640', - '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9', - ], - [ - '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c', - '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36', - ], - [ - '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda', - '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f', - ], - [ - 'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa', - '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999', - ], - [ - '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0', - 'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09', - ], - [ - 'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d', - '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d', - ], - [ - 'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d', - 'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088', - ], - [ - 'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1', - '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d', - ], - [ - '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0', - '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8', - ], - [ - '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047', - '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a', - ], - [ - '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862', - '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453', - ], - [ - '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7', - '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160', - ], - [ - '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd', - '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0', - ], - [ - '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83', - '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6', - ], - [ - '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a', - '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589', - ], - [ - '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8', - 'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17', - ], - [ - 'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d', - '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda', - ], - [ - 'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725', - '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd', - ], - [ - '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754', - '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2', - ], - [ - '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c', - '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6', - ], - [ - 'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6', - '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f', - ], - [ - '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39', - 'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01', - ], - [ - 'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891', - '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3', - ], - [ - 'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b', - 'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f', - ], - [ - 'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03', - '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7', - ], - [ - 'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d', - 'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78', - ], - [ - 'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070', - '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1', - ], - [ - '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4', - 'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150', - ], - [ - '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da', - '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82', - ], - [ - 'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11', - '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc', - ], - [ - '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e', - 'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b', - ], - [ - 'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41', - '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51', - ], - [ - 'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef', - '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45', - ], - [ - 'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8', - 'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120', - ], - [ - '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d', - '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84', - ], - [ - '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96', - '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d', - ], - [ - '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd', - 'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d', - ], - [ - '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5', - '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8', - ], - [ - 'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266', - '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8', - ], - [ - '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71', - '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac', - ], - [ - '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac', - 'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f', - ], - [ - '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751', - '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962', - ], - [ - 'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e', - '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907', - ], - [ - '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241', - 'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec', - ], - [ - 'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3', - 'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d', - ], - [ - 'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f', - '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414', - ], - [ - '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19', - 'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd', - ], - [ - '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be', - 'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0', - ], - [ - 'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9', - '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811', - ], - [ - 'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2', - '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1', - ], - [ - 'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13', - '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c', - ], - [ - '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c', - 'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73', - ], - [ - '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba', - '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd', - ], - [ - 'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151', - 'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405', - ], - [ - '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073', - 'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589', - ], - [ - '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458', - '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e', - ], - [ - '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b', - '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27', - ], - [ - 'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366', - 'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1', - ], - [ - '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa', - '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482', - ], - [ - '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0', - '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945', - ], - [ - 'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787', - '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573', - ], - [ - 'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e', - 'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82', - ], - ], - }, - naf: { - wnd: 7, - points: [ - [ - 'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9', - '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672', - ], - [ - '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4', - 'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6', - ], - [ - '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc', - '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da', - ], - [ - 'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe', - 'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37', - ], - [ - '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb', - 'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b', - ], - [ - 'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8', - 'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81', - ], - [ - 'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e', - '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58', - ], - [ - 'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34', - '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77', - ], - [ - '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c', - '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a', - ], - [ - '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5', - '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c', - ], - [ - '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f', - '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67', - ], - [ - '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714', - '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402', - ], - [ - 'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729', - 'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55', - ], - [ - 'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db', - '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482', - ], - [ - '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4', - 'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82', - ], - [ - '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5', - 'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396', - ], - [ - '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479', - '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49', - ], - [ - '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d', - '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf', - ], - [ - '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f', - '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a', - ], - [ - '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb', - 'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7', - ], - [ - 'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9', - 'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933', - ], - [ - '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963', - '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a', - ], - [ - '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74', - '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6', - ], - [ - 'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530', - 'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37', - ], - [ - '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b', - '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e', - ], - [ - 'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247', - 'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6', - ], - [ - 'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1', - 'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476', - ], - [ - '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120', - '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40', - ], - [ - '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435', - '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61', - ], - [ - '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18', - '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683', - ], - [ - 'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8', - '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5', - ], - [ - '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb', - '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b', - ], - [ - 'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f', - '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417', - ], - [ - '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143', - 'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868', - ], - [ - '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba', - 'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a', - ], - [ - 'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45', - 'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6', - ], - [ - '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a', - '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996', - ], - [ - '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e', - 'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e', - ], - [ - 'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8', - 'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d', - ], - [ - '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c', - '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2', - ], - [ - '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519', - 'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e', - ], - [ - '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab', - '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437', - ], - [ - '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca', - 'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311', - ], - [ - 'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf', - '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4', - ], - [ - '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610', - '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575', - ], - [ - '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4', - 'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d', - ], - [ - '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c', - 'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d', - ], - [ - 'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940', - 'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629', - ], - [ - 'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980', - 'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06', - ], - [ - '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3', - '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374', - ], - [ - '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf', - '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee', - ], - [ - 'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63', - '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1', - ], - [ - 'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448', - 'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b', - ], - [ - '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf', - '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661', - ], - [ - '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5', - '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6', - ], - [ - 'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6', - '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e', - ], - [ - '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5', - '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d', - ], - [ - 'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99', - 'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc', - ], - [ - '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51', - 'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4', - ], - [ - '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5', - '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c', - ], - [ - 'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5', - '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b', - ], - [ - 'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997', - '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913', - ], - [ - '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881', - '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154', - ], - [ - '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5', - '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865', - ], - [ - '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66', - 'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc', - ], - [ - '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726', - 'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224', - ], - [ - '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede', - '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e', - ], - [ - '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94', - '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6', - ], - [ - '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31', - '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511', - ], - [ - '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51', - 'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b', - ], - [ - 'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252', - 'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2', - ], - [ - '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5', - 'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c', - ], - [ - 'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b', - '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3', - ], - [ - 'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4', - '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d', - ], - [ - 'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f', - '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700', - ], - [ - 'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889', - '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4', - ], - [ - '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246', - 'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196', - ], - [ - '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984', - '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4', - ], - [ - '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a', - 'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257', - ], - [ - 'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030', - 'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13', - ], - [ - 'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197', - '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096', - ], - [ - 'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593', - 'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38', - ], - [ - 'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef', - '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f', - ], - [ - '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38', - '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448', - ], - [ - 'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a', - '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a', - ], - [ - 'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111', - '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4', - ], - [ - '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502', - '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437', - ], - [ - '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea', - 'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7', - ], - [ - 'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26', - '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d', - ], - [ - 'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986', - '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a', - ], - [ - 'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e', - '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54', - ], - [ - '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4', - '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77', - ], - [ - 'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda', - 'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517', - ], - [ - '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859', - 'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10', - ], - [ - 'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f', - 'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125', - ], - [ - 'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c', - '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e', - ], - [ - '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942', - 'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1', - ], - [ - 'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a', - '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2', - ], - [ - 'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80', - '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423', - ], - [ - 'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d', - '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8', - ], - [ - '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1', - 'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758', - ], - [ - '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63', - 'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375', - ], - [ - 'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352', - '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d', - ], - [ - '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193', - 'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec', - ], - [ - '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00', - '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0', - ], - [ - '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58', - 'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c', - ], - [ - 'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7', - 'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4', - ], - [ - '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8', - 'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f', - ], - [ - '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e', - '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649', - ], - [ - '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d', - 'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826', - ], - [ - '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b', - '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5', - ], - [ - 'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f', - 'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87', - ], - [ - '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6', - '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b', - ], - [ - 'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297', - '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc', - ], - [ - '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a', - '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c', - ], - [ - 'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c', - 'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f', - ], - [ - 'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52', - '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a', - ], - [ - 'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb', - 'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46', - ], - [ - '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065', - 'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f', - ], - [ - '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917', - '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03', - ], - [ - '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9', - 'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08', - ], - [ - '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3', - '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8', - ], - [ - '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57', - '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373', - ], - [ - '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66', - 'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3', - ], - [ - '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8', - '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8', - ], - [ - '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721', - '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1', - ], - [ - '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180', - '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9', - ], - ], - }, -}; - - -/***/ }), - -/***/ "./node_modules/elliptic/lib/elliptic/utils.js": -/*!*****************************************************!*\ - !*** ./node_modules/elliptic/lib/elliptic/utils.js ***! - \*****************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var utils = exports; -var BN = __webpack_require__(/*! bn.js */ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js"); -var minAssert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); -var minUtils = __webpack_require__(/*! minimalistic-crypto-utils */ "./node_modules/minimalistic-crypto-utils/lib/utils.js"); - -utils.assert = minAssert; -utils.toArray = minUtils.toArray; -utils.zero2 = minUtils.zero2; -utils.toHex = minUtils.toHex; -utils.encode = minUtils.encode; - -// Represent num in a w-NAF form -function getNAF(num, w, bits) { - var naf = new Array(Math.max(num.bitLength(), bits) + 1); - naf.fill(0); - - var ws = 1 << (w + 1); - var k = num.clone(); - - for (var i = 0; i < naf.length; i++) { - var z; - var mod = k.andln(ws - 1); - if (k.isOdd()) { - if (mod > (ws >> 1) - 1) - z = (ws >> 1) - mod; - else - z = mod; - k.isubn(z); - } else { - z = 0; - } - - naf[i] = z; - k.iushrn(1); - } - - return naf; -} -utils.getNAF = getNAF; - -// Represent k1, k2 in a Joint Sparse Form -function getJSF(k1, k2) { - var jsf = [ - [], - [], - ]; - - k1 = k1.clone(); - k2 = k2.clone(); - var d1 = 0; - var d2 = 0; - var m8; - while (k1.cmpn(-d1) > 0 || k2.cmpn(-d2) > 0) { - // First phase - var m14 = (k1.andln(3) + d1) & 3; - var m24 = (k2.andln(3) + d2) & 3; - if (m14 === 3) - m14 = -1; - if (m24 === 3) - m24 = -1; - var u1; - if ((m14 & 1) === 0) { - u1 = 0; - } else { - m8 = (k1.andln(7) + d1) & 7; - if ((m8 === 3 || m8 === 5) && m24 === 2) - u1 = -m14; - else - u1 = m14; - } - jsf[0].push(u1); - - var u2; - if ((m24 & 1) === 0) { - u2 = 0; - } else { - m8 = (k2.andln(7) + d2) & 7; - if ((m8 === 3 || m8 === 5) && m14 === 2) - u2 = -m24; - else - u2 = m24; - } - jsf[1].push(u2); - - // Second phase - if (2 * d1 === u1 + 1) - d1 = 1 - d1; - if (2 * d2 === u2 + 1) - d2 = 1 - d2; - k1.iushrn(1); - k2.iushrn(1); - } - - return jsf; -} -utils.getJSF = getJSF; - -function cachedProperty(obj, name, computer) { - var key = '_' + name; - obj.prototype[name] = function cachedProperty() { - return this[key] !== undefined ? this[key] : - this[key] = computer.call(this); - }; -} -utils.cachedProperty = cachedProperty; - -function parseBytes(bytes) { - return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') : - bytes; -} -utils.parseBytes = parseBytes; - -function intFromLE(bytes) { - return new BN(bytes, 'hex', 'le'); -} -utils.intFromLE = intFromLE; - - - -/***/ }), - -/***/ "./node_modules/elliptic/node_modules/bn.js/lib/bn.js": -/*!************************************************************!*\ - !*** ./node_modules/elliptic/node_modules/bn.js/lib/bn.js ***! - \************************************************************/ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -(function (module, exports) { - 'use strict'; - - // Utils - function assert (val, msg) { - if (!val) throw new Error(msg || 'Assertion failed'); - } - - // Could use `inherits` module, but don't want to move from single file - // architecture yet. - function inherits (ctor, superCtor) { - ctor.super_ = superCtor; - var TempCtor = function () {}; - TempCtor.prototype = superCtor.prototype; - ctor.prototype = new TempCtor(); - ctor.prototype.constructor = ctor; - } - - // BN - - function BN (number, base, endian) { - if (BN.isBN(number)) { - return number; - } - - this.negative = 0; - this.words = null; - this.length = 0; - - // Reduction context - this.red = null; - - if (number !== null) { - if (base === 'le' || base === 'be') { - endian = base; - base = 10; - } - - this._init(number || 0, base || 10, endian || 'be'); - } - } - if (typeof module === 'object') { - module.exports = BN; - } else { - exports.BN = BN; - } - - BN.BN = BN; - BN.wordSize = 26; - - var Buffer; - try { - if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { - Buffer = window.Buffer; - } else { - Buffer = __webpack_require__(/*! buffer */ "?7bec").Buffer; - } - } catch (e) { - } - - BN.isBN = function isBN (num) { - if (num instanceof BN) { - return true; - } - - return num !== null && typeof num === 'object' && - num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); - }; - - BN.max = function max (left, right) { - if (left.cmp(right) > 0) return left; - return right; - }; - - BN.min = function min (left, right) { - if (left.cmp(right) < 0) return left; - return right; - }; - - BN.prototype._init = function init (number, base, endian) { - if (typeof number === 'number') { - return this._initNumber(number, base, endian); - } - - if (typeof number === 'object') { - return this._initArray(number, base, endian); - } - - if (base === 'hex') { - base = 16; - } - assert(base === (base | 0) && base >= 2 && base <= 36); - - number = number.toString().replace(/\s+/g, ''); - var start = 0; - if (number[0] === '-') { - start++; - this.negative = 1; - } - - if (start < number.length) { - if (base === 16) { - this._parseHex(number, start, endian); - } else { - this._parseBase(number, base, start); - if (endian === 'le') { - this._initArray(this.toArray(), base, endian); - } - } - } - }; - - BN.prototype._initNumber = function _initNumber (number, base, endian) { - if (number < 0) { - this.negative = 1; - number = -number; - } - if (number < 0x4000000) { - this.words = [ number & 0x3ffffff ]; - this.length = 1; - } else if (number < 0x10000000000000) { - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff - ]; - this.length = 2; - } else { - assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff, - 1 - ]; - this.length = 3; - } - - if (endian !== 'le') return; - - // Reverse the bytes - this._initArray(this.toArray(), base, endian); - }; - - BN.prototype._initArray = function _initArray (number, base, endian) { - // Perhaps a Uint8Array - assert(typeof number.length === 'number'); - if (number.length <= 0) { - this.words = [ 0 ]; - this.length = 1; - return this; - } - - this.length = Math.ceil(number.length / 3); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - var j, w; - var off = 0; - if (endian === 'be') { - for (i = number.length - 1, j = 0; i >= 0; i -= 3) { - w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } else if (endian === 'le') { - for (i = 0, j = 0; i < number.length; i += 3) { - w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } - return this.strip(); - }; - - function parseHex4Bits (string, index) { - var c = string.charCodeAt(index); - // 'A' - 'F' - if (c >= 65 && c <= 70) { - return c - 55; - // 'a' - 'f' - } else if (c >= 97 && c <= 102) { - return c - 87; - // '0' - '9' - } else { - return (c - 48) & 0xf; - } - } - - function parseHexByte (string, lowerBound, index) { - var r = parseHex4Bits(string, index); - if (index - 1 >= lowerBound) { - r |= parseHex4Bits(string, index - 1) << 4; - } - return r; - } - - BN.prototype._parseHex = function _parseHex (number, start, endian) { - // Create possibly bigger array to ensure that it fits the number - this.length = Math.ceil((number.length - start) / 6); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - // 24-bits chunks - var off = 0; - var j = 0; - - var w; - if (endian === 'be') { - for (i = number.length - 1; i >= start; i -= 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } else { - var parseLength = number.length - start; - for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } - - this.strip(); - }; - - function parseBase (str, start, end, mul) { - var r = 0; - var len = Math.min(str.length, end); - for (var i = start; i < len; i++) { - var c = str.charCodeAt(i) - 48; - - r *= mul; - - // 'a' - if (c >= 49) { - r += c - 49 + 0xa; - - // 'A' - } else if (c >= 17) { - r += c - 17 + 0xa; - - // '0' - '9' - } else { - r += c; - } - } - return r; - } - - BN.prototype._parseBase = function _parseBase (number, base, start) { - // Initialize as zero - this.words = [ 0 ]; - this.length = 1; - - // Find length of limb in base - for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { - limbLen++; - } - limbLen--; - limbPow = (limbPow / base) | 0; - - var total = number.length - start; - var mod = total % limbLen; - var end = Math.min(total, total - mod) + start; - - var word = 0; - for (var i = start; i < end; i += limbLen) { - word = parseBase(number, i, i + limbLen, base); - - this.imuln(limbPow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - if (mod !== 0) { - var pow = 1; - word = parseBase(number, i, number.length, base); - - for (i = 0; i < mod; i++) { - pow *= base; - } - - this.imuln(pow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - this.strip(); - }; - - BN.prototype.copy = function copy (dest) { - dest.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - dest.words[i] = this.words[i]; - } - dest.length = this.length; - dest.negative = this.negative; - dest.red = this.red; - }; - - BN.prototype.clone = function clone () { - var r = new BN(null); - this.copy(r); - return r; - }; - - BN.prototype._expand = function _expand (size) { - while (this.length < size) { - this.words[this.length++] = 0; - } - return this; - }; - - // Remove leading `0` from `this` - BN.prototype.strip = function strip () { - while (this.length > 1 && this.words[this.length - 1] === 0) { - this.length--; - } - return this._normSign(); - }; - - BN.prototype._normSign = function _normSign () { - // -0 = 0 - if (this.length === 1 && this.words[0] === 0) { - this.negative = 0; - } - return this; - }; - - BN.prototype.inspect = function inspect () { - return (this.red ? ''; - }; - - /* - - var zeros = []; - var groupSizes = []; - var groupBases = []; - - var s = ''; - var i = -1; - while (++i < BN.wordSize) { - zeros[i] = s; - s += '0'; - } - groupSizes[0] = 0; - groupSizes[1] = 0; - groupBases[0] = 0; - groupBases[1] = 0; - var base = 2 - 1; - while (++base < 36 + 1) { - var groupSize = 0; - var groupBase = 1; - while (groupBase < (1 << BN.wordSize) / base) { - groupBase *= base; - groupSize += 1; - } - groupSizes[base] = groupSize; - groupBases[base] = groupBase; - } - - */ - - 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' - ]; - - 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 - ]; - - 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 - ]; - - BN.prototype.toString = function toString (base, padding) { - base = base || 10; - padding = padding | 0 || 1; - - var out; - if (base === 16 || base === 'hex') { - out = ''; - var off = 0; - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = this.words[i]; - var word = (((w << off) | carry) & 0xffffff).toString(16); - carry = (w >>> (24 - off)) & 0xffffff; - if (carry !== 0 || i !== this.length - 1) { - out = zeros[6 - word.length] + word + out; - } else { - out = word + out; - } - off += 2; - if (off >= 26) { - off -= 26; - i--; - } - } - if (carry !== 0) { - out = carry.toString(16) + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - if (base === (base | 0) && base >= 2 && base <= 36) { - // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); - var groupSize = groupSizes[base]; - // var groupBase = Math.pow(base, groupSize); - var groupBase = groupBases[base]; - out = ''; - var c = this.clone(); - c.negative = 0; - while (!c.isZero()) { - var r = c.modn(groupBase).toString(base); - c = c.idivn(groupBase); - - if (!c.isZero()) { - out = zeros[groupSize - r.length] + r + out; - } else { - out = r + out; - } - } - if (this.isZero()) { - out = '0' + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - assert(false, 'Base should be between 2 and 36'); - }; - - BN.prototype.toNumber = function toNumber () { - var ret = this.words[0]; - if (this.length === 2) { - ret += this.words[1] * 0x4000000; - } else if (this.length === 3 && this.words[2] === 0x01) { - // NOTE: at this stage it is known that the top bit is set - ret += 0x10000000000000 + (this.words[1] * 0x4000000); - } else if (this.length > 2) { - assert(false, 'Number can only safely store up to 53 bits'); - } - return (this.negative !== 0) ? -ret : ret; - }; - - BN.prototype.toJSON = function toJSON () { - return this.toString(16); - }; - - BN.prototype.toBuffer = function toBuffer (endian, length) { - assert(typeof Buffer !== 'undefined'); - return this.toArrayLike(Buffer, endian, length); - }; - - BN.prototype.toArray = function toArray (endian, length) { - return this.toArrayLike(Array, endian, length); - }; - - BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { - var byteLength = this.byteLength(); - var reqLength = length || Math.max(1, byteLength); - assert(byteLength <= reqLength, 'byte array longer than desired length'); - assert(reqLength > 0, 'Requested array length <= 0'); - - this.strip(); - var littleEndian = endian === 'le'; - var res = new ArrayType(reqLength); - - var b, i; - var q = this.clone(); - if (!littleEndian) { - // Assume big-endian - for (i = 0; i < reqLength - byteLength; i++) { - res[i] = 0; - } - - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[reqLength - i - 1] = b; - } - } else { - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[i] = b; - } - - for (; i < reqLength; i++) { - res[i] = 0; - } - } - - return res; - }; - - if (Math.clz32) { - BN.prototype._countBits = function _countBits (w) { - return 32 - Math.clz32(w); - }; - } else { - BN.prototype._countBits = function _countBits (w) { - var t = w; - var r = 0; - if (t >= 0x1000) { - r += 13; - t >>>= 13; - } - if (t >= 0x40) { - r += 7; - t >>>= 7; - } - if (t >= 0x8) { - r += 4; - t >>>= 4; - } - if (t >= 0x02) { - r += 2; - t >>>= 2; - } - return r + t; - }; - } - - BN.prototype._zeroBits = function _zeroBits (w) { - // Short-cut - if (w === 0) return 26; - - var t = w; - var r = 0; - if ((t & 0x1fff) === 0) { - r += 13; - t >>>= 13; - } - if ((t & 0x7f) === 0) { - r += 7; - t >>>= 7; - } - if ((t & 0xf) === 0) { - r += 4; - t >>>= 4; - } - if ((t & 0x3) === 0) { - r += 2; - t >>>= 2; - } - if ((t & 0x1) === 0) { - r++; - } - return r; - }; - - // Return number of used bits in a BN - BN.prototype.bitLength = function bitLength () { - var w = this.words[this.length - 1]; - var hi = this._countBits(w); - return (this.length - 1) * 26 + hi; - }; - - function toBitArray (num) { - var w = new Array(num.bitLength()); - - for (var bit = 0; bit < w.length; bit++) { - var off = (bit / 26) | 0; - var wbit = bit % 26; - - w[bit] = (num.words[off] & (1 << wbit)) >>> wbit; - } - - return w; - } - - // Number of trailing zero bits - BN.prototype.zeroBits = function zeroBits () { - if (this.isZero()) return 0; - - var r = 0; - for (var i = 0; i < this.length; i++) { - var b = this._zeroBits(this.words[i]); - r += b; - if (b !== 26) break; - } - return r; - }; - - BN.prototype.byteLength = function byteLength () { - return Math.ceil(this.bitLength() / 8); - }; - - BN.prototype.toTwos = function toTwos (width) { - if (this.negative !== 0) { - return this.abs().inotn(width).iaddn(1); - } - return this.clone(); - }; - - BN.prototype.fromTwos = function fromTwos (width) { - if (this.testn(width - 1)) { - return this.notn(width).iaddn(1).ineg(); - } - return this.clone(); - }; - - BN.prototype.isNeg = function isNeg () { - return this.negative !== 0; - }; - - // Return negative clone of `this` - BN.prototype.neg = function neg () { - return this.clone().ineg(); - }; - - BN.prototype.ineg = function ineg () { - if (!this.isZero()) { - this.negative ^= 1; - } - - return this; - }; - - // Or `num` with `this` in-place - BN.prototype.iuor = function iuor (num) { - while (this.length < num.length) { - this.words[this.length++] = 0; - } - - for (var i = 0; i < num.length; i++) { - this.words[i] = this.words[i] | num.words[i]; - } - - return this.strip(); - }; - - BN.prototype.ior = function ior (num) { - assert((this.negative | num.negative) === 0); - return this.iuor(num); - }; - - // Or `num` with `this` - BN.prototype.or = function or (num) { - if (this.length > num.length) return this.clone().ior(num); - return num.clone().ior(this); - }; - - BN.prototype.uor = function uor (num) { - if (this.length > num.length) return this.clone().iuor(num); - return num.clone().iuor(this); - }; - - // And `num` with `this` in-place - BN.prototype.iuand = function iuand (num) { - // b = min-length(num, this) - var b; - if (this.length > num.length) { - b = num; - } else { - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = this.words[i] & num.words[i]; - } - - this.length = b.length; - - return this.strip(); - }; - - BN.prototype.iand = function iand (num) { - assert((this.negative | num.negative) === 0); - return this.iuand(num); - }; - - // And `num` with `this` - BN.prototype.and = function and (num) { - if (this.length > num.length) return this.clone().iand(num); - return num.clone().iand(this); - }; - - BN.prototype.uand = function uand (num) { - if (this.length > num.length) return this.clone().iuand(num); - return num.clone().iuand(this); - }; - - // Xor `num` with `this` in-place - BN.prototype.iuxor = function iuxor (num) { - // a.length > b.length - var a; - var b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = a.words[i] ^ b.words[i]; - } - - if (this !== a) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = a.length; - - return this.strip(); - }; - - BN.prototype.ixor = function ixor (num) { - assert((this.negative | num.negative) === 0); - return this.iuxor(num); - }; - - // Xor `num` with `this` - BN.prototype.xor = function xor (num) { - if (this.length > num.length) return this.clone().ixor(num); - return num.clone().ixor(this); - }; - - BN.prototype.uxor = function uxor (num) { - if (this.length > num.length) return this.clone().iuxor(num); - return num.clone().iuxor(this); - }; - - // Not ``this`` with ``width`` bitwidth - BN.prototype.inotn = function inotn (width) { - assert(typeof width === 'number' && width >= 0); - - var bytesNeeded = Math.ceil(width / 26) | 0; - var bitsLeft = width % 26; - - // Extend the buffer with leading zeroes - this._expand(bytesNeeded); - - if (bitsLeft > 0) { - bytesNeeded--; - } - - // Handle complete words - for (var i = 0; i < bytesNeeded; i++) { - this.words[i] = ~this.words[i] & 0x3ffffff; - } - - // Handle the residue - if (bitsLeft > 0) { - this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); - } - - // And remove leading zeroes - return this.strip(); - }; - - BN.prototype.notn = function notn (width) { - return this.clone().inotn(width); - }; - - // Set `bit` of `this` - BN.prototype.setn = function setn (bit, val) { - assert(typeof bit === 'number' && bit >= 0); - - var off = (bit / 26) | 0; - var wbit = bit % 26; - - this._expand(off + 1); - - if (val) { - this.words[off] = this.words[off] | (1 << wbit); - } else { - this.words[off] = this.words[off] & ~(1 << wbit); - } - - return this.strip(); - }; - - // Add `num` to `this` in-place - BN.prototype.iadd = function iadd (num) { - var r; - - // negative + positive - if (this.negative !== 0 && num.negative === 0) { - this.negative = 0; - r = this.isub(num); - this.negative ^= 1; - return this._normSign(); - - // positive + negative - } else if (this.negative === 0 && num.negative !== 0) { - num.negative = 0; - r = this.isub(num); - num.negative = 1; - return r._normSign(); - } - - // a.length > b.length - var a, b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) + (b.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - - this.length = a.length; - if (carry !== 0) { - this.words[this.length] = carry; - this.length++; - // Copy the rest of the words - } else if (a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - return this; - }; - - // Add `num` to `this` - BN.prototype.add = function add (num) { - var res; - if (num.negative !== 0 && this.negative === 0) { - num.negative = 0; - res = this.sub(num); - num.negative ^= 1; - return res; - } else if (num.negative === 0 && this.negative !== 0) { - this.negative = 0; - res = num.sub(this); - this.negative = 1; - return res; - } - - if (this.length > num.length) return this.clone().iadd(num); - - return num.clone().iadd(this); - }; - - // Subtract `num` from `this` in-place - BN.prototype.isub = function isub (num) { - // this - (-num) = this + num - if (num.negative !== 0) { - num.negative = 0; - var r = this.iadd(num); - num.negative = 1; - return r._normSign(); - - // -this - num = -(this + num) - } else if (this.negative !== 0) { - this.negative = 0; - this.iadd(num); - this.negative = 1; - return this._normSign(); - } - - // At this point both numbers are positive - var cmp = this.cmp(num); - - // Optimization - zeroify - if (cmp === 0) { - this.negative = 0; - this.length = 1; - this.words[0] = 0; - return this; - } - - // a > b - var a, b; - if (cmp > 0) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) - (b.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - - // Copy rest of the words - if (carry === 0 && i < a.length && a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = Math.max(this.length, i); - - if (a !== this) { - this.negative = 1; - } - - return this.strip(); - }; - - // Subtract `num` from `this` - BN.prototype.sub = function sub (num) { - return this.clone().isub(num); - }; - - function smallMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - var len = (self.length + num.length) | 0; - out.length = len; - len = (len - 1) | 0; - - // Peel one iteration (compiler can't do it, because of code complexity) - var a = self.words[0] | 0; - var b = num.words[0] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - var carry = (r / 0x4000000) | 0; - out.words[0] = lo; - - for (var k = 1; k < len; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = carry >>> 26; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = (k - j) | 0; - a = self.words[i] | 0; - b = num.words[j] | 0; - r = a * b + rword; - ncarry += (r / 0x4000000) | 0; - rword = r & 0x3ffffff; - } - out.words[k] = rword | 0; - carry = ncarry | 0; - } - if (carry !== 0) { - out.words[k] = carry | 0; - } else { - out.length--; - } - - return out.strip(); - } - - // TODO(indutny): it may be reasonable to omit it for users who don't need - // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit - // multiplication (like elliptic secp256k1). - var comb10MulTo = function comb10MulTo (self, num, out) { - var a = self.words; - var b = num.words; - var o = out.words; - var c = 0; - var lo; - var mid; - var hi; - var a0 = a[0] | 0; - var al0 = a0 & 0x1fff; - var ah0 = a0 >>> 13; - var a1 = a[1] | 0; - var al1 = a1 & 0x1fff; - var ah1 = a1 >>> 13; - var a2 = a[2] | 0; - var al2 = a2 & 0x1fff; - var ah2 = a2 >>> 13; - var a3 = a[3] | 0; - var al3 = a3 & 0x1fff; - var ah3 = a3 >>> 13; - var a4 = a[4] | 0; - var al4 = a4 & 0x1fff; - var ah4 = a4 >>> 13; - var a5 = a[5] | 0; - var al5 = a5 & 0x1fff; - var ah5 = a5 >>> 13; - var a6 = a[6] | 0; - var al6 = a6 & 0x1fff; - var ah6 = a6 >>> 13; - var a7 = a[7] | 0; - var al7 = a7 & 0x1fff; - var ah7 = a7 >>> 13; - var a8 = a[8] | 0; - var al8 = a8 & 0x1fff; - var ah8 = a8 >>> 13; - var a9 = a[9] | 0; - var al9 = a9 & 0x1fff; - var ah9 = a9 >>> 13; - var b0 = b[0] | 0; - var bl0 = b0 & 0x1fff; - var bh0 = b0 >>> 13; - var b1 = b[1] | 0; - var bl1 = b1 & 0x1fff; - var bh1 = b1 >>> 13; - var b2 = b[2] | 0; - var bl2 = b2 & 0x1fff; - var bh2 = b2 >>> 13; - var b3 = b[3] | 0; - var bl3 = b3 & 0x1fff; - var bh3 = b3 >>> 13; - var b4 = b[4] | 0; - var bl4 = b4 & 0x1fff; - var bh4 = b4 >>> 13; - var b5 = b[5] | 0; - var bl5 = b5 & 0x1fff; - var bh5 = b5 >>> 13; - var b6 = b[6] | 0; - var bl6 = b6 & 0x1fff; - var bh6 = b6 >>> 13; - var b7 = b[7] | 0; - var bl7 = b7 & 0x1fff; - var bh7 = b7 >>> 13; - var b8 = b[8] | 0; - var bl8 = b8 & 0x1fff; - var bh8 = b8 >>> 13; - var b9 = b[9] | 0; - var bl9 = b9 & 0x1fff; - var bh9 = b9 >>> 13; - - out.negative = self.negative ^ num.negative; - out.length = 19; - /* k = 0 */ - lo = Math.imul(al0, bl0); - mid = Math.imul(al0, bh0); - mid = (mid + Math.imul(ah0, bl0)) | 0; - hi = Math.imul(ah0, bh0); - var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; - w0 &= 0x3ffffff; - /* k = 1 */ - lo = Math.imul(al1, bl0); - mid = Math.imul(al1, bh0); - mid = (mid + Math.imul(ah1, bl0)) | 0; - hi = Math.imul(ah1, bh0); - lo = (lo + Math.imul(al0, bl1)) | 0; - mid = (mid + Math.imul(al0, bh1)) | 0; - mid = (mid + Math.imul(ah0, bl1)) | 0; - hi = (hi + Math.imul(ah0, bh1)) | 0; - var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; - w1 &= 0x3ffffff; - /* k = 2 */ - lo = Math.imul(al2, bl0); - mid = Math.imul(al2, bh0); - mid = (mid + Math.imul(ah2, bl0)) | 0; - hi = Math.imul(ah2, bh0); - lo = (lo + Math.imul(al1, bl1)) | 0; - mid = (mid + Math.imul(al1, bh1)) | 0; - mid = (mid + Math.imul(ah1, bl1)) | 0; - hi = (hi + Math.imul(ah1, bh1)) | 0; - lo = (lo + Math.imul(al0, bl2)) | 0; - mid = (mid + Math.imul(al0, bh2)) | 0; - mid = (mid + Math.imul(ah0, bl2)) | 0; - hi = (hi + Math.imul(ah0, bh2)) | 0; - var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; - w2 &= 0x3ffffff; - /* k = 3 */ - lo = Math.imul(al3, bl0); - mid = Math.imul(al3, bh0); - mid = (mid + Math.imul(ah3, bl0)) | 0; - hi = Math.imul(ah3, bh0); - lo = (lo + Math.imul(al2, bl1)) | 0; - mid = (mid + Math.imul(al2, bh1)) | 0; - mid = (mid + Math.imul(ah2, bl1)) | 0; - hi = (hi + Math.imul(ah2, bh1)) | 0; - lo = (lo + Math.imul(al1, bl2)) | 0; - mid = (mid + Math.imul(al1, bh2)) | 0; - mid = (mid + Math.imul(ah1, bl2)) | 0; - hi = (hi + Math.imul(ah1, bh2)) | 0; - lo = (lo + Math.imul(al0, bl3)) | 0; - mid = (mid + Math.imul(al0, bh3)) | 0; - mid = (mid + Math.imul(ah0, bl3)) | 0; - hi = (hi + Math.imul(ah0, bh3)) | 0; - var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; - w3 &= 0x3ffffff; - /* k = 4 */ - lo = Math.imul(al4, bl0); - mid = Math.imul(al4, bh0); - mid = (mid + Math.imul(ah4, bl0)) | 0; - hi = Math.imul(ah4, bh0); - lo = (lo + Math.imul(al3, bl1)) | 0; - mid = (mid + Math.imul(al3, bh1)) | 0; - mid = (mid + Math.imul(ah3, bl1)) | 0; - hi = (hi + Math.imul(ah3, bh1)) | 0; - lo = (lo + Math.imul(al2, bl2)) | 0; - mid = (mid + Math.imul(al2, bh2)) | 0; - mid = (mid + Math.imul(ah2, bl2)) | 0; - hi = (hi + Math.imul(ah2, bh2)) | 0; - lo = (lo + Math.imul(al1, bl3)) | 0; - mid = (mid + Math.imul(al1, bh3)) | 0; - mid = (mid + Math.imul(ah1, bl3)) | 0; - hi = (hi + Math.imul(ah1, bh3)) | 0; - lo = (lo + Math.imul(al0, bl4)) | 0; - mid = (mid + Math.imul(al0, bh4)) | 0; - mid = (mid + Math.imul(ah0, bl4)) | 0; - hi = (hi + Math.imul(ah0, bh4)) | 0; - var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; - w4 &= 0x3ffffff; - /* k = 5 */ - lo = Math.imul(al5, bl0); - mid = Math.imul(al5, bh0); - mid = (mid + Math.imul(ah5, bl0)) | 0; - hi = Math.imul(ah5, bh0); - lo = (lo + Math.imul(al4, bl1)) | 0; - mid = (mid + Math.imul(al4, bh1)) | 0; - mid = (mid + Math.imul(ah4, bl1)) | 0; - hi = (hi + Math.imul(ah4, bh1)) | 0; - lo = (lo + Math.imul(al3, bl2)) | 0; - mid = (mid + Math.imul(al3, bh2)) | 0; - mid = (mid + Math.imul(ah3, bl2)) | 0; - hi = (hi + Math.imul(ah3, bh2)) | 0; - lo = (lo + Math.imul(al2, bl3)) | 0; - mid = (mid + Math.imul(al2, bh3)) | 0; - mid = (mid + Math.imul(ah2, bl3)) | 0; - hi = (hi + Math.imul(ah2, bh3)) | 0; - lo = (lo + Math.imul(al1, bl4)) | 0; - mid = (mid + Math.imul(al1, bh4)) | 0; - mid = (mid + Math.imul(ah1, bl4)) | 0; - hi = (hi + Math.imul(ah1, bh4)) | 0; - lo = (lo + Math.imul(al0, bl5)) | 0; - mid = (mid + Math.imul(al0, bh5)) | 0; - mid = (mid + Math.imul(ah0, bl5)) | 0; - hi = (hi + Math.imul(ah0, bh5)) | 0; - var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; - w5 &= 0x3ffffff; - /* k = 6 */ - lo = Math.imul(al6, bl0); - mid = Math.imul(al6, bh0); - mid = (mid + Math.imul(ah6, bl0)) | 0; - hi = Math.imul(ah6, bh0); - lo = (lo + Math.imul(al5, bl1)) | 0; - mid = (mid + Math.imul(al5, bh1)) | 0; - mid = (mid + Math.imul(ah5, bl1)) | 0; - hi = (hi + Math.imul(ah5, bh1)) | 0; - lo = (lo + Math.imul(al4, bl2)) | 0; - mid = (mid + Math.imul(al4, bh2)) | 0; - mid = (mid + Math.imul(ah4, bl2)) | 0; - hi = (hi + Math.imul(ah4, bh2)) | 0; - lo = (lo + Math.imul(al3, bl3)) | 0; - mid = (mid + Math.imul(al3, bh3)) | 0; - mid = (mid + Math.imul(ah3, bl3)) | 0; - hi = (hi + Math.imul(ah3, bh3)) | 0; - lo = (lo + Math.imul(al2, bl4)) | 0; - mid = (mid + Math.imul(al2, bh4)) | 0; - mid = (mid + Math.imul(ah2, bl4)) | 0; - hi = (hi + Math.imul(ah2, bh4)) | 0; - lo = (lo + Math.imul(al1, bl5)) | 0; - mid = (mid + Math.imul(al1, bh5)) | 0; - mid = (mid + Math.imul(ah1, bl5)) | 0; - hi = (hi + Math.imul(ah1, bh5)) | 0; - lo = (lo + Math.imul(al0, bl6)) | 0; - mid = (mid + Math.imul(al0, bh6)) | 0; - mid = (mid + Math.imul(ah0, bl6)) | 0; - hi = (hi + Math.imul(ah0, bh6)) | 0; - var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; - w6 &= 0x3ffffff; - /* k = 7 */ - lo = Math.imul(al7, bl0); - mid = Math.imul(al7, bh0); - mid = (mid + Math.imul(ah7, bl0)) | 0; - hi = Math.imul(ah7, bh0); - lo = (lo + Math.imul(al6, bl1)) | 0; - mid = (mid + Math.imul(al6, bh1)) | 0; - mid = (mid + Math.imul(ah6, bl1)) | 0; - hi = (hi + Math.imul(ah6, bh1)) | 0; - lo = (lo + Math.imul(al5, bl2)) | 0; - mid = (mid + Math.imul(al5, bh2)) | 0; - mid = (mid + Math.imul(ah5, bl2)) | 0; - hi = (hi + Math.imul(ah5, bh2)) | 0; - lo = (lo + Math.imul(al4, bl3)) | 0; - mid = (mid + Math.imul(al4, bh3)) | 0; - mid = (mid + Math.imul(ah4, bl3)) | 0; - hi = (hi + Math.imul(ah4, bh3)) | 0; - lo = (lo + Math.imul(al3, bl4)) | 0; - mid = (mid + Math.imul(al3, bh4)) | 0; - mid = (mid + Math.imul(ah3, bl4)) | 0; - hi = (hi + Math.imul(ah3, bh4)) | 0; - lo = (lo + Math.imul(al2, bl5)) | 0; - mid = (mid + Math.imul(al2, bh5)) | 0; - mid = (mid + Math.imul(ah2, bl5)) | 0; - hi = (hi + Math.imul(ah2, bh5)) | 0; - lo = (lo + Math.imul(al1, bl6)) | 0; - mid = (mid + Math.imul(al1, bh6)) | 0; - mid = (mid + Math.imul(ah1, bl6)) | 0; - hi = (hi + Math.imul(ah1, bh6)) | 0; - lo = (lo + Math.imul(al0, bl7)) | 0; - mid = (mid + Math.imul(al0, bh7)) | 0; - mid = (mid + Math.imul(ah0, bl7)) | 0; - hi = (hi + Math.imul(ah0, bh7)) | 0; - var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; - w7 &= 0x3ffffff; - /* k = 8 */ - lo = Math.imul(al8, bl0); - mid = Math.imul(al8, bh0); - mid = (mid + Math.imul(ah8, bl0)) | 0; - hi = Math.imul(ah8, bh0); - lo = (lo + Math.imul(al7, bl1)) | 0; - mid = (mid + Math.imul(al7, bh1)) | 0; - mid = (mid + Math.imul(ah7, bl1)) | 0; - hi = (hi + Math.imul(ah7, bh1)) | 0; - lo = (lo + Math.imul(al6, bl2)) | 0; - mid = (mid + Math.imul(al6, bh2)) | 0; - mid = (mid + Math.imul(ah6, bl2)) | 0; - hi = (hi + Math.imul(ah6, bh2)) | 0; - lo = (lo + Math.imul(al5, bl3)) | 0; - mid = (mid + Math.imul(al5, bh3)) | 0; - mid = (mid + Math.imul(ah5, bl3)) | 0; - hi = (hi + Math.imul(ah5, bh3)) | 0; - lo = (lo + Math.imul(al4, bl4)) | 0; - mid = (mid + Math.imul(al4, bh4)) | 0; - mid = (mid + Math.imul(ah4, bl4)) | 0; - hi = (hi + Math.imul(ah4, bh4)) | 0; - lo = (lo + Math.imul(al3, bl5)) | 0; - mid = (mid + Math.imul(al3, bh5)) | 0; - mid = (mid + Math.imul(ah3, bl5)) | 0; - hi = (hi + Math.imul(ah3, bh5)) | 0; - lo = (lo + Math.imul(al2, bl6)) | 0; - mid = (mid + Math.imul(al2, bh6)) | 0; - mid = (mid + Math.imul(ah2, bl6)) | 0; - hi = (hi + Math.imul(ah2, bh6)) | 0; - lo = (lo + Math.imul(al1, bl7)) | 0; - mid = (mid + Math.imul(al1, bh7)) | 0; - mid = (mid + Math.imul(ah1, bl7)) | 0; - hi = (hi + Math.imul(ah1, bh7)) | 0; - lo = (lo + Math.imul(al0, bl8)) | 0; - mid = (mid + Math.imul(al0, bh8)) | 0; - mid = (mid + Math.imul(ah0, bl8)) | 0; - hi = (hi + Math.imul(ah0, bh8)) | 0; - var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; - w8 &= 0x3ffffff; - /* k = 9 */ - lo = Math.imul(al9, bl0); - mid = Math.imul(al9, bh0); - mid = (mid + Math.imul(ah9, bl0)) | 0; - hi = Math.imul(ah9, bh0); - lo = (lo + Math.imul(al8, bl1)) | 0; - mid = (mid + Math.imul(al8, bh1)) | 0; - mid = (mid + Math.imul(ah8, bl1)) | 0; - hi = (hi + Math.imul(ah8, bh1)) | 0; - lo = (lo + Math.imul(al7, bl2)) | 0; - mid = (mid + Math.imul(al7, bh2)) | 0; - mid = (mid + Math.imul(ah7, bl2)) | 0; - hi = (hi + Math.imul(ah7, bh2)) | 0; - lo = (lo + Math.imul(al6, bl3)) | 0; - mid = (mid + Math.imul(al6, bh3)) | 0; - mid = (mid + Math.imul(ah6, bl3)) | 0; - hi = (hi + Math.imul(ah6, bh3)) | 0; - lo = (lo + Math.imul(al5, bl4)) | 0; - mid = (mid + Math.imul(al5, bh4)) | 0; - mid = (mid + Math.imul(ah5, bl4)) | 0; - hi = (hi + Math.imul(ah5, bh4)) | 0; - lo = (lo + Math.imul(al4, bl5)) | 0; - mid = (mid + Math.imul(al4, bh5)) | 0; - mid = (mid + Math.imul(ah4, bl5)) | 0; - hi = (hi + Math.imul(ah4, bh5)) | 0; - lo = (lo + Math.imul(al3, bl6)) | 0; - mid = (mid + Math.imul(al3, bh6)) | 0; - mid = (mid + Math.imul(ah3, bl6)) | 0; - hi = (hi + Math.imul(ah3, bh6)) | 0; - lo = (lo + Math.imul(al2, bl7)) | 0; - mid = (mid + Math.imul(al2, bh7)) | 0; - mid = (mid + Math.imul(ah2, bl7)) | 0; - hi = (hi + Math.imul(ah2, bh7)) | 0; - lo = (lo + Math.imul(al1, bl8)) | 0; - mid = (mid + Math.imul(al1, bh8)) | 0; - mid = (mid + Math.imul(ah1, bl8)) | 0; - hi = (hi + Math.imul(ah1, bh8)) | 0; - lo = (lo + Math.imul(al0, bl9)) | 0; - mid = (mid + Math.imul(al0, bh9)) | 0; - mid = (mid + Math.imul(ah0, bl9)) | 0; - hi = (hi + Math.imul(ah0, bh9)) | 0; - var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; - w9 &= 0x3ffffff; - /* k = 10 */ - lo = Math.imul(al9, bl1); - mid = Math.imul(al9, bh1); - mid = (mid + Math.imul(ah9, bl1)) | 0; - hi = Math.imul(ah9, bh1); - lo = (lo + Math.imul(al8, bl2)) | 0; - mid = (mid + Math.imul(al8, bh2)) | 0; - mid = (mid + Math.imul(ah8, bl2)) | 0; - hi = (hi + Math.imul(ah8, bh2)) | 0; - lo = (lo + Math.imul(al7, bl3)) | 0; - mid = (mid + Math.imul(al7, bh3)) | 0; - mid = (mid + Math.imul(ah7, bl3)) | 0; - hi = (hi + Math.imul(ah7, bh3)) | 0; - lo = (lo + Math.imul(al6, bl4)) | 0; - mid = (mid + Math.imul(al6, bh4)) | 0; - mid = (mid + Math.imul(ah6, bl4)) | 0; - hi = (hi + Math.imul(ah6, bh4)) | 0; - lo = (lo + Math.imul(al5, bl5)) | 0; - mid = (mid + Math.imul(al5, bh5)) | 0; - mid = (mid + Math.imul(ah5, bl5)) | 0; - hi = (hi + Math.imul(ah5, bh5)) | 0; - lo = (lo + Math.imul(al4, bl6)) | 0; - mid = (mid + Math.imul(al4, bh6)) | 0; - mid = (mid + Math.imul(ah4, bl6)) | 0; - hi = (hi + Math.imul(ah4, bh6)) | 0; - lo = (lo + Math.imul(al3, bl7)) | 0; - mid = (mid + Math.imul(al3, bh7)) | 0; - mid = (mid + Math.imul(ah3, bl7)) | 0; - hi = (hi + Math.imul(ah3, bh7)) | 0; - lo = (lo + Math.imul(al2, bl8)) | 0; - mid = (mid + Math.imul(al2, bh8)) | 0; - mid = (mid + Math.imul(ah2, bl8)) | 0; - hi = (hi + Math.imul(ah2, bh8)) | 0; - lo = (lo + Math.imul(al1, bl9)) | 0; - mid = (mid + Math.imul(al1, bh9)) | 0; - mid = (mid + Math.imul(ah1, bl9)) | 0; - hi = (hi + Math.imul(ah1, bh9)) | 0; - var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; - w10 &= 0x3ffffff; - /* k = 11 */ - lo = Math.imul(al9, bl2); - mid = Math.imul(al9, bh2); - mid = (mid + Math.imul(ah9, bl2)) | 0; - hi = Math.imul(ah9, bh2); - lo = (lo + Math.imul(al8, bl3)) | 0; - mid = (mid + Math.imul(al8, bh3)) | 0; - mid = (mid + Math.imul(ah8, bl3)) | 0; - hi = (hi + Math.imul(ah8, bh3)) | 0; - lo = (lo + Math.imul(al7, bl4)) | 0; - mid = (mid + Math.imul(al7, bh4)) | 0; - mid = (mid + Math.imul(ah7, bl4)) | 0; - hi = (hi + Math.imul(ah7, bh4)) | 0; - lo = (lo + Math.imul(al6, bl5)) | 0; - mid = (mid + Math.imul(al6, bh5)) | 0; - mid = (mid + Math.imul(ah6, bl5)) | 0; - hi = (hi + Math.imul(ah6, bh5)) | 0; - lo = (lo + Math.imul(al5, bl6)) | 0; - mid = (mid + Math.imul(al5, bh6)) | 0; - mid = (mid + Math.imul(ah5, bl6)) | 0; - hi = (hi + Math.imul(ah5, bh6)) | 0; - lo = (lo + Math.imul(al4, bl7)) | 0; - mid = (mid + Math.imul(al4, bh7)) | 0; - mid = (mid + Math.imul(ah4, bl7)) | 0; - hi = (hi + Math.imul(ah4, bh7)) | 0; - lo = (lo + Math.imul(al3, bl8)) | 0; - mid = (mid + Math.imul(al3, bh8)) | 0; - mid = (mid + Math.imul(ah3, bl8)) | 0; - hi = (hi + Math.imul(ah3, bh8)) | 0; - lo = (lo + Math.imul(al2, bl9)) | 0; - mid = (mid + Math.imul(al2, bh9)) | 0; - mid = (mid + Math.imul(ah2, bl9)) | 0; - hi = (hi + Math.imul(ah2, bh9)) | 0; - var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; - w11 &= 0x3ffffff; - /* k = 12 */ - lo = Math.imul(al9, bl3); - mid = Math.imul(al9, bh3); - mid = (mid + Math.imul(ah9, bl3)) | 0; - hi = Math.imul(ah9, bh3); - lo = (lo + Math.imul(al8, bl4)) | 0; - mid = (mid + Math.imul(al8, bh4)) | 0; - mid = (mid + Math.imul(ah8, bl4)) | 0; - hi = (hi + Math.imul(ah8, bh4)) | 0; - lo = (lo + Math.imul(al7, bl5)) | 0; - mid = (mid + Math.imul(al7, bh5)) | 0; - mid = (mid + Math.imul(ah7, bl5)) | 0; - hi = (hi + Math.imul(ah7, bh5)) | 0; - lo = (lo + Math.imul(al6, bl6)) | 0; - mid = (mid + Math.imul(al6, bh6)) | 0; - mid = (mid + Math.imul(ah6, bl6)) | 0; - hi = (hi + Math.imul(ah6, bh6)) | 0; - lo = (lo + Math.imul(al5, bl7)) | 0; - mid = (mid + Math.imul(al5, bh7)) | 0; - mid = (mid + Math.imul(ah5, bl7)) | 0; - hi = (hi + Math.imul(ah5, bh7)) | 0; - lo = (lo + Math.imul(al4, bl8)) | 0; - mid = (mid + Math.imul(al4, bh8)) | 0; - mid = (mid + Math.imul(ah4, bl8)) | 0; - hi = (hi + Math.imul(ah4, bh8)) | 0; - lo = (lo + Math.imul(al3, bl9)) | 0; - mid = (mid + Math.imul(al3, bh9)) | 0; - mid = (mid + Math.imul(ah3, bl9)) | 0; - hi = (hi + Math.imul(ah3, bh9)) | 0; - var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; - w12 &= 0x3ffffff; - /* k = 13 */ - lo = Math.imul(al9, bl4); - mid = Math.imul(al9, bh4); - mid = (mid + Math.imul(ah9, bl4)) | 0; - hi = Math.imul(ah9, bh4); - lo = (lo + Math.imul(al8, bl5)) | 0; - mid = (mid + Math.imul(al8, bh5)) | 0; - mid = (mid + Math.imul(ah8, bl5)) | 0; - hi = (hi + Math.imul(ah8, bh5)) | 0; - lo = (lo + Math.imul(al7, bl6)) | 0; - mid = (mid + Math.imul(al7, bh6)) | 0; - mid = (mid + Math.imul(ah7, bl6)) | 0; - hi = (hi + Math.imul(ah7, bh6)) | 0; - lo = (lo + Math.imul(al6, bl7)) | 0; - mid = (mid + Math.imul(al6, bh7)) | 0; - mid = (mid + Math.imul(ah6, bl7)) | 0; - hi = (hi + Math.imul(ah6, bh7)) | 0; - lo = (lo + Math.imul(al5, bl8)) | 0; - mid = (mid + Math.imul(al5, bh8)) | 0; - mid = (mid + Math.imul(ah5, bl8)) | 0; - hi = (hi + Math.imul(ah5, bh8)) | 0; - lo = (lo + Math.imul(al4, bl9)) | 0; - mid = (mid + Math.imul(al4, bh9)) | 0; - mid = (mid + Math.imul(ah4, bl9)) | 0; - hi = (hi + Math.imul(ah4, bh9)) | 0; - var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; - w13 &= 0x3ffffff; - /* k = 14 */ - lo = Math.imul(al9, bl5); - mid = Math.imul(al9, bh5); - mid = (mid + Math.imul(ah9, bl5)) | 0; - hi = Math.imul(ah9, bh5); - lo = (lo + Math.imul(al8, bl6)) | 0; - mid = (mid + Math.imul(al8, bh6)) | 0; - mid = (mid + Math.imul(ah8, bl6)) | 0; - hi = (hi + Math.imul(ah8, bh6)) | 0; - lo = (lo + Math.imul(al7, bl7)) | 0; - mid = (mid + Math.imul(al7, bh7)) | 0; - mid = (mid + Math.imul(ah7, bl7)) | 0; - hi = (hi + Math.imul(ah7, bh7)) | 0; - lo = (lo + Math.imul(al6, bl8)) | 0; - mid = (mid + Math.imul(al6, bh8)) | 0; - mid = (mid + Math.imul(ah6, bl8)) | 0; - hi = (hi + Math.imul(ah6, bh8)) | 0; - lo = (lo + Math.imul(al5, bl9)) | 0; - mid = (mid + Math.imul(al5, bh9)) | 0; - mid = (mid + Math.imul(ah5, bl9)) | 0; - hi = (hi + Math.imul(ah5, bh9)) | 0; - var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; - w14 &= 0x3ffffff; - /* k = 15 */ - lo = Math.imul(al9, bl6); - mid = Math.imul(al9, bh6); - mid = (mid + Math.imul(ah9, bl6)) | 0; - hi = Math.imul(ah9, bh6); - lo = (lo + Math.imul(al8, bl7)) | 0; - mid = (mid + Math.imul(al8, bh7)) | 0; - mid = (mid + Math.imul(ah8, bl7)) | 0; - hi = (hi + Math.imul(ah8, bh7)) | 0; - lo = (lo + Math.imul(al7, bl8)) | 0; - mid = (mid + Math.imul(al7, bh8)) | 0; - mid = (mid + Math.imul(ah7, bl8)) | 0; - hi = (hi + Math.imul(ah7, bh8)) | 0; - lo = (lo + Math.imul(al6, bl9)) | 0; - mid = (mid + Math.imul(al6, bh9)) | 0; - mid = (mid + Math.imul(ah6, bl9)) | 0; - hi = (hi + Math.imul(ah6, bh9)) | 0; - var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; - w15 &= 0x3ffffff; - /* k = 16 */ - lo = Math.imul(al9, bl7); - mid = Math.imul(al9, bh7); - mid = (mid + Math.imul(ah9, bl7)) | 0; - hi = Math.imul(ah9, bh7); - lo = (lo + Math.imul(al8, bl8)) | 0; - mid = (mid + Math.imul(al8, bh8)) | 0; - mid = (mid + Math.imul(ah8, bl8)) | 0; - hi = (hi + Math.imul(ah8, bh8)) | 0; - lo = (lo + Math.imul(al7, bl9)) | 0; - mid = (mid + Math.imul(al7, bh9)) | 0; - mid = (mid + Math.imul(ah7, bl9)) | 0; - hi = (hi + Math.imul(ah7, bh9)) | 0; - var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; - w16 &= 0x3ffffff; - /* k = 17 */ - lo = Math.imul(al9, bl8); - mid = Math.imul(al9, bh8); - mid = (mid + Math.imul(ah9, bl8)) | 0; - hi = Math.imul(ah9, bh8); - lo = (lo + Math.imul(al8, bl9)) | 0; - mid = (mid + Math.imul(al8, bh9)) | 0; - mid = (mid + Math.imul(ah8, bl9)) | 0; - hi = (hi + Math.imul(ah8, bh9)) | 0; - var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; - w17 &= 0x3ffffff; - /* k = 18 */ - lo = Math.imul(al9, bl9); - mid = Math.imul(al9, bh9); - mid = (mid + Math.imul(ah9, bl9)) | 0; - hi = Math.imul(ah9, bh9); - var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; - w18 &= 0x3ffffff; - o[0] = w0; - o[1] = w1; - o[2] = w2; - o[3] = w3; - o[4] = w4; - o[5] = w5; - o[6] = w6; - o[7] = w7; - o[8] = w8; - o[9] = w9; - o[10] = w10; - o[11] = w11; - o[12] = w12; - o[13] = w13; - o[14] = w14; - o[15] = w15; - o[16] = w16; - o[17] = w17; - o[18] = w18; - if (c !== 0) { - o[19] = c; - out.length++; - } - return out; - }; - - // Polyfill comb - if (!Math.imul) { - comb10MulTo = smallMulTo; - } - - function bigMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - out.length = self.length + num.length; - - var carry = 0; - var hncarry = 0; - for (var k = 0; k < out.length - 1; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = hncarry; - hncarry = 0; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = k - j; - var a = self.words[i] | 0; - var b = num.words[j] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; - lo = (lo + rword) | 0; - rword = lo & 0x3ffffff; - ncarry = (ncarry + (lo >>> 26)) | 0; - - hncarry += ncarry >>> 26; - ncarry &= 0x3ffffff; - } - out.words[k] = rword; - carry = ncarry; - ncarry = hncarry; - } - if (carry !== 0) { - out.words[k] = carry; - } else { - out.length--; - } - - return out.strip(); - } - - function jumboMulTo (self, num, out) { - var fftm = new FFTM(); - return fftm.mulp(self, num, out); - } - - BN.prototype.mulTo = function mulTo (num, out) { - var res; - var len = this.length + num.length; - if (this.length === 10 && num.length === 10) { - res = comb10MulTo(this, num, out); - } else if (len < 63) { - res = smallMulTo(this, num, out); - } else if (len < 1024) { - res = bigMulTo(this, num, out); - } else { - res = jumboMulTo(this, num, out); - } - - return res; - }; - - // Cooley-Tukey algorithm for FFT - // slightly revisited to rely on looping instead of recursion - - function FFTM (x, y) { - this.x = x; - this.y = y; - } - - FFTM.prototype.makeRBT = function makeRBT (N) { - var t = new Array(N); - var l = BN.prototype._countBits(N) - 1; - for (var i = 0; i < N; i++) { - t[i] = this.revBin(i, l, N); - } - - return t; - }; - - // Returns binary-reversed representation of `x` - FFTM.prototype.revBin = function revBin (x, l, N) { - if (x === 0 || x === N - 1) return x; - - var rb = 0; - for (var i = 0; i < l; i++) { - rb |= (x & 1) << (l - i - 1); - x >>= 1; - } - - return rb; - }; - - // Performs "tweedling" phase, therefore 'emulating' - // behaviour of the recursive algorithm - FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { - for (var i = 0; i < N; i++) { - rtws[i] = rws[rbt[i]]; - itws[i] = iws[rbt[i]]; - } - }; - - FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { - this.permute(rbt, rws, iws, rtws, itws, N); - - for (var s = 1; s < N; s <<= 1) { - var l = s << 1; - - var rtwdf = Math.cos(2 * Math.PI / l); - var itwdf = Math.sin(2 * Math.PI / l); - - for (var p = 0; p < N; p += l) { - var rtwdf_ = rtwdf; - var itwdf_ = itwdf; - - for (var j = 0; j < s; j++) { - var re = rtws[p + j]; - var ie = itws[p + j]; - - var ro = rtws[p + j + s]; - var io = itws[p + j + s]; - - var rx = rtwdf_ * ro - itwdf_ * io; - - io = rtwdf_ * io + itwdf_ * ro; - ro = rx; - - rtws[p + j] = re + ro; - itws[p + j] = ie + io; - - rtws[p + j + s] = re - ro; - itws[p + j + s] = ie - io; - - /* jshint maxdepth : false */ - if (j !== l) { - rx = rtwdf * rtwdf_ - itwdf * itwdf_; - - itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; - rtwdf_ = rx; - } - } - } - } - }; - - FFTM.prototype.guessLen13b = function guessLen13b (n, m) { - var N = Math.max(m, n) | 1; - var odd = N & 1; - var i = 0; - for (N = N / 2 | 0; N; N = N >>> 1) { - i++; - } - - return 1 << i + 1 + odd; - }; - - FFTM.prototype.conjugate = function conjugate (rws, iws, N) { - if (N <= 1) return; - - for (var i = 0; i < N / 2; i++) { - var t = rws[i]; - - rws[i] = rws[N - i - 1]; - rws[N - i - 1] = t; - - t = iws[i]; - - iws[i] = -iws[N - i - 1]; - iws[N - i - 1] = -t; - } - }; - - FFTM.prototype.normalize13b = function normalize13b (ws, N) { - var carry = 0; - for (var i = 0; i < N / 2; i++) { - var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + - Math.round(ws[2 * i] / N) + - carry; - - ws[i] = w & 0x3ffffff; - - if (w < 0x4000000) { - carry = 0; - } else { - carry = w / 0x4000000 | 0; - } - } - - return ws; - }; - - FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { - var carry = 0; - for (var i = 0; i < len; i++) { - carry = carry + (ws[i] | 0); - - rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; - rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; - } - - // Pad with zeroes - for (i = 2 * len; i < N; ++i) { - rws[i] = 0; - } - - assert(carry === 0); - assert((carry & ~0x1fff) === 0); - }; - - FFTM.prototype.stub = function stub (N) { - var ph = new Array(N); - for (var i = 0; i < N; i++) { - ph[i] = 0; - } - - return ph; - }; - - FFTM.prototype.mulp = function mulp (x, y, out) { - var N = 2 * this.guessLen13b(x.length, y.length); - - var rbt = this.makeRBT(N); - - var _ = this.stub(N); - - var rws = new Array(N); - var rwst = new Array(N); - var iwst = new Array(N); - - var nrws = new Array(N); - var nrwst = new Array(N); - var niwst = new Array(N); - - var rmws = out.words; - rmws.length = N; - - this.convert13b(x.words, x.length, rws, N); - this.convert13b(y.words, y.length, nrws, N); - - this.transform(rws, _, rwst, iwst, N, rbt); - this.transform(nrws, _, nrwst, niwst, N, rbt); - - for (var i = 0; i < N; i++) { - var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; - iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; - rwst[i] = rx; - } - - this.conjugate(rwst, iwst, N); - this.transform(rwst, iwst, rmws, _, N, rbt); - this.conjugate(rmws, _, N); - this.normalize13b(rmws, N); - - out.negative = x.negative ^ y.negative; - out.length = x.length + y.length; - return out.strip(); - }; - - // Multiply `this` by `num` - BN.prototype.mul = function mul (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return this.mulTo(num, out); - }; - - // Multiply employing FFT - BN.prototype.mulf = function mulf (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return jumboMulTo(this, num, out); - }; - - // In-place Multiplication - BN.prototype.imul = function imul (num) { - return this.clone().mulTo(num, this); - }; - - BN.prototype.imuln = function imuln (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - - // Carry - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = (this.words[i] | 0) * num; - var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); - carry >>= 26; - carry += (w / 0x4000000) | 0; - // NOTE: lo is 27bit maximum - carry += lo >>> 26; - this.words[i] = lo & 0x3ffffff; - } - - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - - return this; - }; - - BN.prototype.muln = function muln (num) { - return this.clone().imuln(num); - }; - - // `this` * `this` - BN.prototype.sqr = function sqr () { - return this.mul(this); - }; - - // `this` * `this` in-place - BN.prototype.isqr = function isqr () { - return this.imul(this.clone()); - }; - - // Math.pow(`this`, `num`) - BN.prototype.pow = function pow (num) { - var w = toBitArray(num); - if (w.length === 0) return new BN(1); - - // Skip leading zeroes - var res = this; - for (var i = 0; i < w.length; i++, res = res.sqr()) { - if (w[i] !== 0) break; - } - - if (++i < w.length) { - for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { - if (w[i] === 0) continue; - - res = res.mul(q); - } - } - - return res; - }; - - // Shift-left in-place - BN.prototype.iushln = function iushln (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); - var i; - - if (r !== 0) { - var carry = 0; - - for (i = 0; i < this.length; i++) { - var newCarry = this.words[i] & carryMask; - var c = ((this.words[i] | 0) - newCarry) << r; - this.words[i] = c | carry; - carry = newCarry >>> (26 - r); - } - - if (carry) { - this.words[i] = carry; - this.length++; - } - } - - if (s !== 0) { - for (i = this.length - 1; i >= 0; i--) { - this.words[i + s] = this.words[i]; - } - - for (i = 0; i < s; i++) { - this.words[i] = 0; - } - - this.length += s; - } - - return this.strip(); - }; - - BN.prototype.ishln = function ishln (bits) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushln(bits); - }; - - // Shift-right in-place - // NOTE: `hint` is a lowest bit before trailing zeroes - // NOTE: if `extended` is present - it will be filled with destroyed bits - BN.prototype.iushrn = function iushrn (bits, hint, extended) { - assert(typeof bits === 'number' && bits >= 0); - var h; - if (hint) { - h = (hint - (hint % 26)) / 26; - } else { - h = 0; - } - - var r = bits % 26; - var s = Math.min((bits - r) / 26, this.length); - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - var maskedWords = extended; - - h -= s; - h = Math.max(0, h); - - // Extended mode, copy masked part - if (maskedWords) { - for (var i = 0; i < s; i++) { - maskedWords.words[i] = this.words[i]; - } - maskedWords.length = s; - } - - if (s === 0) { - // No-op, we should not move anything at all - } else if (this.length > s) { - this.length -= s; - for (i = 0; i < this.length; i++) { - this.words[i] = this.words[i + s]; - } - } else { - this.words[0] = 0; - this.length = 1; - } - - var carry = 0; - for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { - var word = this.words[i] | 0; - this.words[i] = (carry << (26 - r)) | (word >>> r); - carry = word & mask; - } - - // Push carried bits as a mask - if (maskedWords && carry !== 0) { - maskedWords.words[maskedWords.length++] = carry; - } - - if (this.length === 0) { - this.words[0] = 0; - this.length = 1; - } - - return this.strip(); - }; - - BN.prototype.ishrn = function ishrn (bits, hint, extended) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushrn(bits, hint, extended); - }; - - // Shift-left - BN.prototype.shln = function shln (bits) { - return this.clone().ishln(bits); - }; - - BN.prototype.ushln = function ushln (bits) { - return this.clone().iushln(bits); - }; - - // Shift-right - BN.prototype.shrn = function shrn (bits) { - return this.clone().ishrn(bits); - }; - - BN.prototype.ushrn = function ushrn (bits) { - return this.clone().iushrn(bits); - }; - - // Test if n bit is set - BN.prototype.testn = function testn (bit) { - assert(typeof bit === 'number' && bit >= 0); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) return false; - - // Check bit and return - var w = this.words[s]; - - return !!(w & q); - }; - - // Return only lowers bits of number (in-place) - BN.prototype.imaskn = function imaskn (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - - assert(this.negative === 0, 'imaskn works only with positive numbers'); - - if (this.length <= s) { - return this; - } - - if (r !== 0) { - s++; - } - this.length = Math.min(s, this.length); - - if (r !== 0) { - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - this.words[this.length - 1] &= mask; - } - - return this.strip(); - }; - - // Return only lowers bits of number - BN.prototype.maskn = function maskn (bits) { - return this.clone().imaskn(bits); - }; - - // Add plain number `num` to `this` - BN.prototype.iaddn = function iaddn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.isubn(-num); - - // Possible sign change - if (this.negative !== 0) { - if (this.length === 1 && (this.words[0] | 0) < num) { - this.words[0] = num - (this.words[0] | 0); - this.negative = 0; - return this; - } - - this.negative = 0; - this.isubn(num); - this.negative = 1; - return this; - } - - // Add without checks - return this._iaddn(num); - }; - - BN.prototype._iaddn = function _iaddn (num) { - this.words[0] += num; - - // Carry - for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { - this.words[i] -= 0x4000000; - if (i === this.length - 1) { - this.words[i + 1] = 1; - } else { - this.words[i + 1]++; - } - } - this.length = Math.max(this.length, i + 1); - - return this; - }; - - // Subtract plain number `num` from `this` - BN.prototype.isubn = function isubn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.iaddn(-num); - - if (this.negative !== 0) { - this.negative = 0; - this.iaddn(num); - this.negative = 1; - return this; - } - - this.words[0] -= num; - - if (this.length === 1 && this.words[0] < 0) { - this.words[0] = -this.words[0]; - this.negative = 1; - } else { - // Carry - for (var i = 0; i < this.length && this.words[i] < 0; i++) { - this.words[i] += 0x4000000; - this.words[i + 1] -= 1; - } - } - - return this.strip(); - }; - - BN.prototype.addn = function addn (num) { - return this.clone().iaddn(num); - }; - - BN.prototype.subn = function subn (num) { - return this.clone().isubn(num); - }; - - BN.prototype.iabs = function iabs () { - this.negative = 0; - - return this; - }; - - BN.prototype.abs = function abs () { - return this.clone().iabs(); - }; - - BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { - var len = num.length + shift; - var i; - - this._expand(len); - - var w; - var carry = 0; - for (i = 0; i < num.length; i++) { - w = (this.words[i + shift] | 0) + carry; - var right = (num.words[i] | 0) * mul; - w -= right & 0x3ffffff; - carry = (w >> 26) - ((right / 0x4000000) | 0); - this.words[i + shift] = w & 0x3ffffff; - } - for (; i < this.length - shift; i++) { - w = (this.words[i + shift] | 0) + carry; - carry = w >> 26; - this.words[i + shift] = w & 0x3ffffff; - } - - if (carry === 0) return this.strip(); - - // Subtraction overflow - assert(carry === -1); - carry = 0; - for (i = 0; i < this.length; i++) { - w = -(this.words[i] | 0) + carry; - carry = w >> 26; - this.words[i] = w & 0x3ffffff; - } - this.negative = 1; - - return this.strip(); - }; - - BN.prototype._wordDiv = function _wordDiv (num, mode) { - var shift = this.length - num.length; - - var a = this.clone(); - var b = num; - - // Normalize - var bhi = b.words[b.length - 1] | 0; - var bhiBits = this._countBits(bhi); - shift = 26 - bhiBits; - if (shift !== 0) { - b = b.ushln(shift); - a.iushln(shift); - bhi = b.words[b.length - 1] | 0; - } - - // Initialize quotient - var m = a.length - b.length; - var q; - - if (mode !== 'mod') { - q = new BN(null); - q.length = m + 1; - q.words = new Array(q.length); - for (var i = 0; i < q.length; i++) { - q.words[i] = 0; - } - } - - var diff = a.clone()._ishlnsubmul(b, 1, m); - if (diff.negative === 0) { - a = diff; - if (q) { - q.words[m] = 1; - } - } - - for (var j = m - 1; j >= 0; j--) { - 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 - // (0x7ffffff) - qj = Math.min((qj / bhi) | 0, 0x3ffffff); - - a._ishlnsubmul(b, qj, j); - while (a.negative !== 0) { - qj--; - a.negative = 0; - a._ishlnsubmul(b, 1, j); - if (!a.isZero()) { - a.negative ^= 1; - } - } - if (q) { - q.words[j] = qj; - } - } - if (q) { - q.strip(); - } - a.strip(); - - // Denormalize - if (mode !== 'div' && shift !== 0) { - a.iushrn(shift); - } - - return { - div: q || null, - mod: a - }; - }; - - // NOTE: 1) `mode` can be set to `mod` to request mod only, - // to `div` to request div only, or be absent to - // request both div & mod - // 2) `positive` is true if unsigned mod is requested - BN.prototype.divmod = function divmod (num, mode, positive) { - assert(!num.isZero()); - - if (this.isZero()) { - return { - div: new BN(0), - mod: new BN(0) - }; - } - - var div, mod, res; - if (this.negative !== 0 && num.negative === 0) { - res = this.neg().divmod(num, mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.iadd(num); - } - } - - return { - div: div, - mod: mod - }; - } - - if (this.negative === 0 && num.negative !== 0) { - res = this.divmod(num.neg(), mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - return { - div: div, - mod: res.mod - }; - } - - if ((this.negative & num.negative) !== 0) { - res = this.neg().divmod(num.neg(), mode); - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.isub(num); - } - } - - return { - div: res.div, - mod: mod - }; - } - - // Both numbers are positive at this point - - // Strip both numbers to approximate shift value - if (num.length > this.length || this.cmp(num) < 0) { - return { - div: new BN(0), - mod: this - }; - } - - // Very short reduction - if (num.length === 1) { - if (mode === 'div') { - return { - div: this.divn(num.words[0]), - mod: null - }; - } - - if (mode === 'mod') { - return { - div: null, - mod: new BN(this.modn(num.words[0])) - }; - } - - return { - div: this.divn(num.words[0]), - mod: new BN(this.modn(num.words[0])) - }; - } - - return this._wordDiv(num, mode); - }; - - // Find `this` / `num` - BN.prototype.div = function div (num) { - return this.divmod(num, 'div', false).div; - }; - - // Find `this` % `num` - BN.prototype.mod = function mod (num) { - return this.divmod(num, 'mod', false).mod; - }; - - BN.prototype.umod = function umod (num) { - return this.divmod(num, 'mod', true).mod; - }; - - // Find Round(`this` / `num`) - BN.prototype.divRound = function divRound (num) { - var dm = this.divmod(num); - - // Fast case - exact division - if (dm.mod.isZero()) return dm.div; - - var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; - - var half = num.ushrn(1); - var r2 = num.andln(1); - var cmp = mod.cmp(half); - - // Round down - if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div; - - // Round up - return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); - }; - - BN.prototype.modn = function modn (num) { - assert(num <= 0x3ffffff); - var p = (1 << 26) % num; - - var acc = 0; - for (var i = this.length - 1; i >= 0; i--) { - acc = (p * acc + (this.words[i] | 0)) % num; - } - - return acc; - }; - - // In-place division by number - BN.prototype.idivn = function idivn (num) { - assert(num <= 0x3ffffff); - - var carry = 0; - for (var i = this.length - 1; i >= 0; i--) { - var w = (this.words[i] | 0) + carry * 0x4000000; - this.words[i] = (w / num) | 0; - carry = w % num; - } - - return this.strip(); - }; - - BN.prototype.divn = function divn (num) { - return this.clone().idivn(num); - }; - - BN.prototype.egcd = function egcd (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var x = this; - var y = p.clone(); - - if (x.negative !== 0) { - x = x.umod(p); - } else { - x = x.clone(); - } - - // A * x + B * y = x - var A = new BN(1); - var B = new BN(0); - - // C * x + D * y = y - var C = new BN(0); - var D = new BN(1); - - var g = 0; - - while (x.isEven() && y.isEven()) { - x.iushrn(1); - y.iushrn(1); - ++g; - } - - var yp = y.clone(); - var xp = x.clone(); - - while (!x.isZero()) { - for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - x.iushrn(i); - while (i-- > 0) { - if (A.isOdd() || B.isOdd()) { - A.iadd(yp); - B.isub(xp); - } - - A.iushrn(1); - B.iushrn(1); - } - } - - for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - y.iushrn(j); - while (j-- > 0) { - if (C.isOdd() || D.isOdd()) { - C.iadd(yp); - D.isub(xp); - } - - C.iushrn(1); - D.iushrn(1); - } - } - - if (x.cmp(y) >= 0) { - x.isub(y); - A.isub(C); - B.isub(D); - } else { - y.isub(x); - C.isub(A); - D.isub(B); - } - } - - return { - a: C, - b: D, - gcd: y.iushln(g) - }; - }; - - // This is reduced incarnation of the binary EEA - // above, designated to invert members of the - // _prime_ fields F(p) at a maximal speed - BN.prototype._invmp = function _invmp (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var a = this; - var b = p.clone(); - - if (a.negative !== 0) { - a = a.umod(p); - } else { - a = a.clone(); - } - - var x1 = new BN(1); - var x2 = new BN(0); - - var delta = b.clone(); - - while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { - for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - a.iushrn(i); - while (i-- > 0) { - if (x1.isOdd()) { - x1.iadd(delta); - } - - x1.iushrn(1); - } - } - - for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - b.iushrn(j); - while (j-- > 0) { - if (x2.isOdd()) { - x2.iadd(delta); - } - - x2.iushrn(1); - } - } - - if (a.cmp(b) >= 0) { - a.isub(b); - x1.isub(x2); - } else { - b.isub(a); - x2.isub(x1); - } - } - - var res; - if (a.cmpn(1) === 0) { - res = x1; - } else { - res = x2; - } - - if (res.cmpn(0) < 0) { - res.iadd(p); - } - - return res; - }; - - BN.prototype.gcd = function gcd (num) { - if (this.isZero()) return num.abs(); - if (num.isZero()) return this.abs(); - - var a = this.clone(); - var b = num.clone(); - a.negative = 0; - b.negative = 0; - - // Remove common factor of two - for (var shift = 0; a.isEven() && b.isEven(); shift++) { - a.iushrn(1); - b.iushrn(1); - } - - do { - while (a.isEven()) { - a.iushrn(1); - } - while (b.isEven()) { - b.iushrn(1); - } - - var r = a.cmp(b); - if (r < 0) { - // Swap `a` and `b` to make `a` always bigger than `b` - var t = a; - a = b; - b = t; - } else if (r === 0 || b.cmpn(1) === 0) { - break; - } - - a.isub(b); - } while (true); - - return b.iushln(shift); - }; - - // Invert number in the field F(num) - BN.prototype.invm = function invm (num) { - return this.egcd(num).a.umod(num); - }; - - BN.prototype.isEven = function isEven () { - return (this.words[0] & 1) === 0; - }; - - BN.prototype.isOdd = function isOdd () { - return (this.words[0] & 1) === 1; - }; - - // And first word and num - BN.prototype.andln = function andln (num) { - return this.words[0] & num; - }; - - // Increment at the bit position in-line - BN.prototype.bincn = function bincn (bit) { - assert(typeof bit === 'number'); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) { - this._expand(s + 1); - this.words[s] |= q; - return this; - } - - // Add bit and propagate, if needed - var carry = q; - for (var i = s; carry !== 0 && i < this.length; i++) { - var w = this.words[i] | 0; - w += carry; - carry = w >>> 26; - w &= 0x3ffffff; - this.words[i] = w; - } - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - return this; - }; - - BN.prototype.isZero = function isZero () { - return this.length === 1 && this.words[0] === 0; - }; - - BN.prototype.cmpn = function cmpn (num) { - var negative = num < 0; - - if (this.negative !== 0 && !negative) return -1; - if (this.negative === 0 && negative) return 1; - - this.strip(); - - var res; - if (this.length > 1) { - res = 1; - } else { - if (negative) { - num = -num; - } - - assert(num <= 0x3ffffff, 'Number is too big'); - - var w = this.words[0] | 0; - res = w === num ? 0 : w < num ? -1 : 1; - } - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Compare two numbers and return: - // 1 - if `this` > `num` - // 0 - if `this` == `num` - // -1 - if `this` < `num` - BN.prototype.cmp = function cmp (num) { - if (this.negative !== 0 && num.negative === 0) return -1; - if (this.negative === 0 && num.negative !== 0) return 1; - - var res = this.ucmp(num); - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Unsigned comparison - BN.prototype.ucmp = function ucmp (num) { - // At this point both numbers have the same sign - if (this.length > num.length) return 1; - if (this.length < num.length) return -1; - - var res = 0; - for (var i = this.length - 1; i >= 0; i--) { - var a = this.words[i] | 0; - var b = num.words[i] | 0; - - if (a === b) continue; - if (a < b) { - res = -1; - } else if (a > b) { - res = 1; - } - break; - } - return res; - }; - - BN.prototype.gtn = function gtn (num) { - return this.cmpn(num) === 1; - }; - - BN.prototype.gt = function gt (num) { - return this.cmp(num) === 1; - }; - - BN.prototype.gten = function gten (num) { - return this.cmpn(num) >= 0; - }; - - BN.prototype.gte = function gte (num) { - return this.cmp(num) >= 0; - }; - - BN.prototype.ltn = function ltn (num) { - return this.cmpn(num) === -1; - }; - - BN.prototype.lt = function lt (num) { - return this.cmp(num) === -1; - }; - - BN.prototype.lten = function lten (num) { - return this.cmpn(num) <= 0; - }; - - BN.prototype.lte = function lte (num) { - return this.cmp(num) <= 0; - }; - - BN.prototype.eqn = function eqn (num) { - return this.cmpn(num) === 0; - }; - - BN.prototype.eq = function eq (num) { - return this.cmp(num) === 0; - }; - - // - // A reduce context, could be using montgomery or something better, depending - // on the `m` itself. - // - BN.red = function red (num) { - return new Red(num); - }; - - BN.prototype.toRed = function toRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - assert(this.negative === 0, 'red works only with positives'); - return ctx.convertTo(this)._forceRed(ctx); - }; - - BN.prototype.fromRed = function fromRed () { - assert(this.red, 'fromRed works only with numbers in reduction context'); - return this.red.convertFrom(this); - }; - - BN.prototype._forceRed = function _forceRed (ctx) { - this.red = ctx; - return this; - }; - - BN.prototype.forceRed = function forceRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - return this._forceRed(ctx); - }; - - BN.prototype.redAdd = function redAdd (num) { - assert(this.red, 'redAdd works only with red numbers'); - return this.red.add(this, num); - }; - - BN.prototype.redIAdd = function redIAdd (num) { - assert(this.red, 'redIAdd works only with red numbers'); - return this.red.iadd(this, num); - }; - - BN.prototype.redSub = function redSub (num) { - assert(this.red, 'redSub works only with red numbers'); - return this.red.sub(this, num); - }; - - BN.prototype.redISub = function redISub (num) { - assert(this.red, 'redISub works only with red numbers'); - return this.red.isub(this, num); - }; - - BN.prototype.redShl = function redShl (num) { - assert(this.red, 'redShl works only with red numbers'); - return this.red.shl(this, num); - }; - - BN.prototype.redMul = function redMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.mul(this, num); - }; - - BN.prototype.redIMul = function redIMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.imul(this, num); - }; - - BN.prototype.redSqr = function redSqr () { - assert(this.red, 'redSqr works only with red numbers'); - this.red._verify1(this); - return this.red.sqr(this); - }; - - BN.prototype.redISqr = function redISqr () { - assert(this.red, 'redISqr works only with red numbers'); - this.red._verify1(this); - return this.red.isqr(this); - }; - - // Square root over p - BN.prototype.redSqrt = function redSqrt () { - assert(this.red, 'redSqrt works only with red numbers'); - this.red._verify1(this); - return this.red.sqrt(this); - }; - - BN.prototype.redInvm = function redInvm () { - assert(this.red, 'redInvm works only with red numbers'); - this.red._verify1(this); - return this.red.invm(this); - }; - - // Return negative clone of `this` % `red modulo` - BN.prototype.redNeg = function redNeg () { - assert(this.red, 'redNeg works only with red numbers'); - this.red._verify1(this); - return this.red.neg(this); - }; - - BN.prototype.redPow = function redPow (num) { - assert(this.red && !num.red, 'redPow(normalNum)'); - this.red._verify1(this); - return this.red.pow(this, num); - }; - - // Prime numbers with efficient reduction - var primes = { - k256: null, - p224: null, - p192: null, - p25519: null - }; - - // Pseudo-Mersenne prime - function MPrime (name, p) { - // P = 2 ^ N - K - this.name = name; - this.p = new BN(p, 16); - this.n = this.p.bitLength(); - this.k = new BN(1).iushln(this.n).isub(this.p); - - this.tmp = this._tmp(); - } - - MPrime.prototype._tmp = function _tmp () { - var tmp = new BN(null); - tmp.words = new Array(Math.ceil(this.n / 13)); - return tmp; - }; - - MPrime.prototype.ireduce = function ireduce (num) { - // Assumes that `num` is less than `P^2` - // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) - var r = num; - var rlen; - - do { - this.split(r, this.tmp); - r = this.imulK(r); - r = r.iadd(this.tmp); - rlen = r.bitLength(); - } while (rlen > this.n); - - var cmp = rlen < this.n ? -1 : r.ucmp(this.p); - if (cmp === 0) { - r.words[0] = 0; - r.length = 1; - } else if (cmp > 0) { - r.isub(this.p); - } else { - if (r.strip !== undefined) { - // r is BN v4 instance - r.strip(); - } else { - // r is BN v5 instance - r._strip(); - } - } - - return r; - }; - - MPrime.prototype.split = function split (input, out) { - input.iushrn(this.n, 0, out); - }; - - MPrime.prototype.imulK = function imulK (num) { - return num.imul(this.k); - }; - - function K256 () { - MPrime.call( - this, - 'k256', - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); - } - inherits(K256, MPrime); - - K256.prototype.split = function split (input, output) { - // 256 = 9 * 26 + 22 - var mask = 0x3fffff; - - var outLen = Math.min(input.length, 9); - for (var i = 0; i < outLen; i++) { - output.words[i] = input.words[i]; - } - output.length = outLen; - - if (input.length <= 9) { - input.words[0] = 0; - input.length = 1; - return; - } - - // Shift by 9 limbs - var prev = input.words[9]; - output.words[output.length++] = prev & mask; - - for (i = 10; i < input.length; i++) { - var next = input.words[i] | 0; - input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); - prev = next; - } - prev >>>= 22; - input.words[i - 10] = prev; - if (prev === 0 && input.length > 10) { - input.length -= 10; - } else { - input.length -= 9; - } - }; - - K256.prototype.imulK = function imulK (num) { - // K = 0x1000003d1 = [ 0x40, 0x3d1 ] - num.words[num.length] = 0; - num.words[num.length + 1] = 0; - num.length += 2; - - // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 - var lo = 0; - for (var i = 0; i < num.length; i++) { - var w = num.words[i] | 0; - lo += w * 0x3d1; - num.words[i] = lo & 0x3ffffff; - lo = w * 0x40 + ((lo / 0x4000000) | 0); - } - - // Fast length reduction - if (num.words[num.length - 1] === 0) { - num.length--; - if (num.words[num.length - 1] === 0) { - num.length--; - } - } - return num; - }; - - function P224 () { - MPrime.call( - this, - 'p224', - 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); - } - inherits(P224, MPrime); - - function P192 () { - MPrime.call( - this, - 'p192', - 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); - } - inherits(P192, MPrime); - - function P25519 () { - // 2 ^ 255 - 19 - MPrime.call( - this, - '25519', - '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); - } - inherits(P25519, MPrime); - - P25519.prototype.imulK = function imulK (num) { - // K = 0x13 - var carry = 0; - for (var i = 0; i < num.length; i++) { - var hi = (num.words[i] | 0) * 0x13 + carry; - var lo = hi & 0x3ffffff; - hi >>>= 26; - - num.words[i] = lo; - carry = hi; - } - if (carry !== 0) { - num.words[num.length++] = carry; - } - return num; - }; - - // Exported mostly for testing purposes, use plain name instead - BN._prime = function prime (name) { - // Cached version of prime - if (primes[name]) return primes[name]; - - var prime; - if (name === 'k256') { - prime = new K256(); - } else if (name === 'p224') { - prime = new P224(); - } else if (name === 'p192') { - prime = new P192(); - } else if (name === 'p25519') { - prime = new P25519(); - } else { - throw new Error('Unknown prime ' + name); - } - primes[name] = prime; - - return prime; - }; - - // - // Base reduction engine - // - function Red (m) { - if (typeof m === 'string') { - var prime = BN._prime(m); - this.m = prime.p; - this.prime = prime; - } else { - assert(m.gtn(1), 'modulus must be greater than 1'); - this.m = m; - this.prime = null; - } - } - - Red.prototype._verify1 = function _verify1 (a) { - assert(a.negative === 0, 'red works only with positives'); - assert(a.red, 'red works only with red numbers'); - }; - - Red.prototype._verify2 = function _verify2 (a, b) { - assert((a.negative | b.negative) === 0, 'red works only with positives'); - assert(a.red && a.red === b.red, - 'red works only with red numbers'); - }; - - Red.prototype.imod = function imod (a) { - if (this.prime) return this.prime.ireduce(a)._forceRed(this); - return a.umod(this.m)._forceRed(this); - }; - - Red.prototype.neg = function neg (a) { - if (a.isZero()) { - return a.clone(); - } - - return this.m.sub(a)._forceRed(this); - }; - - Red.prototype.add = function add (a, b) { - this._verify2(a, b); - - var res = a.add(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.iadd = function iadd (a, b) { - this._verify2(a, b); - - var res = a.iadd(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res; - }; - - Red.prototype.sub = function sub (a, b) { - this._verify2(a, b); - - var res = a.sub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.isub = function isub (a, b) { - this._verify2(a, b); - - var res = a.isub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res; - }; - - Red.prototype.shl = function shl (a, num) { - this._verify1(a); - return this.imod(a.ushln(num)); - }; - - Red.prototype.imul = function imul (a, b) { - this._verify2(a, b); - return this.imod(a.imul(b)); - }; - - Red.prototype.mul = function mul (a, b) { - this._verify2(a, b); - return this.imod(a.mul(b)); - }; - - Red.prototype.isqr = function isqr (a) { - return this.imul(a, a.clone()); - }; - - Red.prototype.sqr = function sqr (a) { - return this.mul(a, a); - }; - - Red.prototype.sqrt = function sqrt (a) { - if (a.isZero()) return a.clone(); - - var mod3 = this.m.andln(3); - assert(mod3 % 2 === 1); - - // Fast case - if (mod3 === 3) { - var pow = this.m.add(new BN(1)).iushrn(2); - return this.pow(a, pow); - } - - // Tonelli-Shanks algorithm (Totally unoptimized and slow) - // - // Find Q and S, that Q * 2 ^ S = (P - 1) - var q = this.m.subn(1); - var s = 0; - while (!q.isZero() && q.andln(1) === 0) { - s++; - q.iushrn(1); - } - assert(!q.isZero()); - - var one = new BN(1).toRed(this); - var nOne = one.redNeg(); - - // Find quadratic non-residue - // NOTE: Max is such because of generalized Riemann hypothesis. - var lpow = this.m.subn(1).iushrn(1); - var z = this.m.bitLength(); - z = new BN(2 * z * z).toRed(this); - - while (this.pow(z, lpow).cmp(nOne) !== 0) { - z.redIAdd(nOne); - } - - var c = this.pow(z, q); - var r = this.pow(a, q.addn(1).iushrn(1)); - var t = this.pow(a, q); - var m = s; - while (t.cmp(one) !== 0) { - var tmp = t; - for (var i = 0; tmp.cmp(one) !== 0; i++) { - tmp = tmp.redSqr(); - } - assert(i < m); - var b = this.pow(c, new BN(1).iushln(m - i - 1)); - - r = r.redMul(b); - c = b.redSqr(); - t = t.redMul(c); - m = i; - } - - return r; - }; - - Red.prototype.invm = function invm (a) { - var inv = a._invmp(this.m); - if (inv.negative !== 0) { - inv.negative = 0; - return this.imod(inv).redNeg(); - } else { - return this.imod(inv); - } - }; - - Red.prototype.pow = function pow (a, num) { - if (num.isZero()) return new BN(1).toRed(this); - if (num.cmpn(1) === 0) return a.clone(); - - var windowSize = 4; - var wnd = new Array(1 << windowSize); - wnd[0] = new BN(1).toRed(this); - wnd[1] = a; - for (var i = 2; i < wnd.length; i++) { - wnd[i] = this.mul(wnd[i - 1], a); - } - - var res = wnd[0]; - var current = 0; - var currentLen = 0; - var start = num.bitLength() % 26; - if (start === 0) { - start = 26; - } - - for (i = num.length - 1; i >= 0; i--) { - var word = num.words[i]; - for (var j = start - 1; j >= 0; j--) { - var bit = (word >> j) & 1; - if (res !== wnd[0]) { - res = this.sqr(res); - } - - if (bit === 0 && current === 0) { - currentLen = 0; - continue; - } - - current <<= 1; - current |= bit; - currentLen++; - if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; - - res = this.mul(res, wnd[current]); - currentLen = 0; - current = 0; - } - start = 26; - } - - return res; - }; - - Red.prototype.convertTo = function convertTo (num) { - var r = num.umod(this.m); - - return r === num ? r.clone() : r; - }; - - Red.prototype.convertFrom = function convertFrom (num) { - var res = num.clone(); - res.red = null; - return res; - }; - - // - // Montgomery method engine - // - - BN.mont = function mont (num) { - return new Mont(num); - }; - - function Mont (m) { - Red.call(this, m); - - this.shift = this.m.bitLength(); - if (this.shift % 26 !== 0) { - this.shift += 26 - (this.shift % 26); - } - - this.r = new BN(1).iushln(this.shift); - this.r2 = this.imod(this.r.sqr()); - this.rinv = this.r._invmp(this.m); - - this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); - this.minv = this.minv.umod(this.r); - this.minv = this.r.sub(this.minv); - } - inherits(Mont, Red); - - Mont.prototype.convertTo = function convertTo (num) { - return this.imod(num.ushln(this.shift)); - }; - - Mont.prototype.convertFrom = function convertFrom (num) { - var r = this.imod(num.mul(this.rinv)); - r.red = null; - return r; - }; - - Mont.prototype.imul = function imul (a, b) { - if (a.isZero() || b.isZero()) { - a.words[0] = 0; - a.length = 1; - return a; - } - - var t = a.imul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.mul = function mul (a, b) { - if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); - - var t = a.mul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.invm = function invm (a) { - // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R - var res = this.imod(a._invmp(this.m).mul(this.r2)); - return res._forceRed(this); - }; -})( false || module, this); - - -/***/ }), - -/***/ "./node_modules/elliptic/package.json": -/*!********************************************!*\ - !*** ./node_modules/elliptic/package.json ***! - \********************************************/ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"name":"elliptic","version":"6.5.4","description":"EC cryptography","main":"lib/elliptic.js","files":["lib"],"scripts":{"lint":"eslint lib test","lint:fix":"npm run lint -- --fix","unit":"istanbul test _mocha --reporter=spec test/index.js","test":"npm run lint && npm run unit","version":"grunt dist && git add dist/"},"repository":{"type":"git","url":"git@github.com:indutny/elliptic"},"keywords":["EC","Elliptic","curve","Cryptography"],"author":"Fedor Indutny ","license":"MIT","bugs":{"url":"https://github.com/indutny/elliptic/issues"},"homepage":"https://github.com/indutny/elliptic","devDependencies":{"brfs":"^2.0.2","coveralls":"^3.1.0","eslint":"^7.6.0","grunt":"^1.2.1","grunt-browserify":"^5.3.0","grunt-cli":"^1.3.2","grunt-contrib-connect":"^3.0.0","grunt-contrib-copy":"^1.0.0","grunt-contrib-uglify":"^5.0.0","grunt-mocha-istanbul":"^5.0.2","grunt-saucelabs":"^9.0.1","istanbul":"^0.4.5","mocha":"^8.0.1"},"dependencies":{"bn.js":"^4.11.9","brorand":"^1.1.0","hash.js":"^1.0.0","hmac-drbg":"^1.0.1","inherits":"^2.0.4","minimalistic-assert":"^1.0.1","minimalistic-crypto-utils":"^1.0.1"}}'); - -/***/ }), - -/***/ "./node_modules/end-of-stream/index.js": -/*!*********************************************!*\ - !*** ./node_modules/end-of-stream/index.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -var once = __webpack_require__(/*! once */ "./node_modules/once/once.js"); - -var noop = function() {}; - -var isRequest = function(stream) { - return stream.setHeader && typeof stream.abort === 'function'; -}; - -var isChildProcess = function(stream) { - return stream.stdio && Array.isArray(stream.stdio) && stream.stdio.length === 3 -}; - -var eos = function(stream, opts, callback) { - if (typeof opts === 'function') return eos(stream, null, opts); - if (!opts) opts = {}; - - callback = once(callback || noop); - - var ws = stream._writableState; - var rs = stream._readableState; - var readable = opts.readable || (opts.readable !== false && stream.readable); - var writable = opts.writable || (opts.writable !== false && stream.writable); - var cancelled = false; - - var onlegacyfinish = function() { - if (!stream.writable) onfinish(); - }; - - var onfinish = function() { - writable = false; - if (!readable) callback.call(stream); - }; - - var onend = function() { - readable = false; - if (!writable) callback.call(stream); - }; - - var onexit = function(exitCode) { - callback.call(stream, exitCode ? new Error('exited with error code: ' + exitCode) : null); - }; - - var onerror = function(err) { - callback.call(stream, err); - }; - - var onclose = function() { - process.nextTick(onclosenexttick); - }; - - var onclosenexttick = function() { - if (cancelled) return; - if (readable && !(rs && (rs.ended && !rs.destroyed))) return callback.call(stream, new Error('premature close')); - if (writable && !(ws && (ws.ended && !ws.destroyed))) return callback.call(stream, new Error('premature close')); - }; - - var onrequest = function() { - stream.req.on('finish', onfinish); - }; - - if (isRequest(stream)) { - stream.on('complete', onfinish); - stream.on('abort', onclose); - if (stream.req) onrequest(); - else stream.on('request', onrequest); - } else if (writable && !ws) { // legacy streams - stream.on('end', onlegacyfinish); - stream.on('close', onlegacyfinish); - } - - if (isChildProcess(stream)) stream.on('exit', onexit); - - stream.on('end', onend); - stream.on('finish', onfinish); - if (opts.error !== false) stream.on('error', onerror); - stream.on('close', onclose); - - return function() { - cancelled = true; - stream.removeListener('complete', onfinish); - stream.removeListener('abort', onclose); - stream.removeListener('request', onrequest); - if (stream.req) stream.req.removeListener('finish', onfinish); - stream.removeListener('end', onlegacyfinish); - stream.removeListener('close', onlegacyfinish); - stream.removeListener('finish', onfinish); - stream.removeListener('exit', onexit); - stream.removeListener('end', onend); - stream.removeListener('error', onerror); - stream.removeListener('close', onclose); - }; -}; - -module.exports = eos; - - -/***/ }), - -/***/ "./node_modules/err-code/index.js": -/*!****************************************!*\ - !*** ./node_modules/err-code/index.js ***! - \****************************************/ -/***/ ((module) => { - -"use strict"; - - -/** - * @typedef {{ [key: string]: any }} Extensions - * @typedef {Error} Err - * @property {string} message - */ - -/** - * - * @param {Error} obj - * @param {Extensions} props - * @returns {Error & Extensions} - */ -function assign(obj, props) { - for (const key in props) { - Object.defineProperty(obj, key, { - value: props[key], - enumerable: true, - configurable: true, - }); - } - - return obj; -} - -/** - * - * @param {any} err - An Error - * @param {string|Extensions} code - A string code or props to set on the error - * @param {Extensions} [props] - Props to set on the error - * @returns {Error & Extensions} - */ -function createError(err, code, props) { - if (!err || typeof err === 'string') { - throw new TypeError('Please pass an Error to err-code'); - } - - if (!props) { - props = {}; - } - - if (typeof code === 'object') { - props = code; - code = ''; - } - - if (code) { - props.code = code; - } - - try { - return assign(err, props); - } catch (_) { - props.message = err.message; - props.stack = err.stack; - - const ErrClass = function () {}; - - ErrClass.prototype = Object.create(Object.getPrototypeOf(err)); - - // @ts-ignore - const output = assign(new ErrClass(), props); - - return output; - } -} - -module.exports = createError; - - -/***/ }), - -/***/ "./node_modules/es-abstract/helpers/getOwnPropertyDescriptor.js": -/*!**********************************************************************!*\ - !*** ./node_modules/es-abstract/helpers/getOwnPropertyDescriptor.js ***! - \**********************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var GetIntrinsic = __webpack_require__(/*! get-intrinsic */ "./node_modules/get-intrinsic/index.js"); - -var $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%'); -if ($gOPD) { - try { - $gOPD([], 'length'); - } catch (e) { - // IE 8 has a broken gOPD - $gOPD = null; - } -} - -module.exports = $gOPD; - - -/***/ }), - -/***/ "./node_modules/es6-object-assign/index.js": -/*!*************************************************!*\ - !*** ./node_modules/es6-object-assign/index.js ***! - \*************************************************/ -/***/ ((module) => { - -"use strict"; -/** - * Code refactored from Mozilla Developer Network: - * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/assign - */ - - - -function assign(target, firstSource) { - if (target === undefined || target === null) { - throw new TypeError('Cannot convert first argument to object'); - } - - var to = Object(target); - for (var i = 1; i < arguments.length; i++) { - var nextSource = arguments[i]; - if (nextSource === undefined || nextSource === null) { - continue; - } - - var keysArray = Object.keys(Object(nextSource)); - for (var nextIndex = 0, len = keysArray.length; nextIndex < len; nextIndex++) { - var nextKey = keysArray[nextIndex]; - var desc = Object.getOwnPropertyDescriptor(nextSource, nextKey); - if (desc !== undefined && desc.enumerable) { - to[nextKey] = nextSource[nextKey]; - } - } - } - return to; -} - -function polyfill() { - if (!Object.assign) { - Object.defineProperty(Object, 'assign', { - enumerable: false, - configurable: true, - writable: true, - value: assign - }); - } -} - -module.exports = { - assign: assign, - polyfill: polyfill -}; - - -/***/ }), - -/***/ "./node_modules/events/events.js": -/*!***************************************!*\ - !*** ./node_modules/events/events.js ***! - \***************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - - -var R = typeof Reflect === 'object' ? Reflect : null -var ReflectApply = R && typeof R.apply === 'function' - ? R.apply - : function ReflectApply(target, receiver, args) { - return Function.prototype.apply.call(target, receiver, args); - } - -var ReflectOwnKeys -if (R && typeof R.ownKeys === 'function') { - ReflectOwnKeys = R.ownKeys -} else if (Object.getOwnPropertySymbols) { - ReflectOwnKeys = function ReflectOwnKeys(target) { - return Object.getOwnPropertyNames(target) - .concat(Object.getOwnPropertySymbols(target)); - }; -} else { - ReflectOwnKeys = function ReflectOwnKeys(target) { - return Object.getOwnPropertyNames(target); - }; -} - -function ProcessEmitWarning(warning) { - if (console && console.warn) console.warn(warning); -} - -var NumberIsNaN = Number.isNaN || function NumberIsNaN(value) { - return value !== value; -} - -function EventEmitter() { - EventEmitter.init.call(this); -} -module.exports = EventEmitter; -module.exports.once = once; - -// Backwards-compat with node 0.10.x -EventEmitter.EventEmitter = EventEmitter; - -EventEmitter.prototype._events = undefined; -EventEmitter.prototype._eventsCount = 0; -EventEmitter.prototype._maxListeners = undefined; - -// By default EventEmitters will print a warning if more than 10 listeners are -// added to it. This is a useful default which helps finding memory leaks. -var defaultMaxListeners = 10; - -function checkListener(listener) { - if (typeof listener !== 'function') { - throw new TypeError('The "listener" argument must be of type Function. Received type ' + typeof listener); - } -} - -Object.defineProperty(EventEmitter, 'defaultMaxListeners', { - enumerable: true, - get: function() { - return defaultMaxListeners; - }, - set: function(arg) { - if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) { - throw new RangeError('The value of "defaultMaxListeners" is out of range. It must be a non-negative number. Received ' + arg + '.'); - } - defaultMaxListeners = arg; - } -}); - -EventEmitter.init = function() { - - if (this._events === undefined || - this._events === Object.getPrototypeOf(this)._events) { - this._events = Object.create(null); - this._eventsCount = 0; - } - - this._maxListeners = this._maxListeners || undefined; -}; - -// Obviously not all Emitters should be limited to 10. This function allows -// that to be increased. Set to zero for unlimited. -EventEmitter.prototype.setMaxListeners = function setMaxListeners(n) { - if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) { - throw new RangeError('The value of "n" is out of range. It must be a non-negative number. Received ' + n + '.'); - } - this._maxListeners = n; - return this; -}; - -function _getMaxListeners(that) { - if (that._maxListeners === undefined) - return EventEmitter.defaultMaxListeners; - return that._maxListeners; -} - -EventEmitter.prototype.getMaxListeners = function getMaxListeners() { - return _getMaxListeners(this); -}; - -EventEmitter.prototype.emit = function emit(type) { - var args = []; - for (var i = 1; i < arguments.length; i++) args.push(arguments[i]); - var doError = (type === 'error'); - - var events = this._events; - if (events !== undefined) - doError = (doError && events.error === undefined); - else if (!doError) - return false; - - // If there is no 'error' event listener then throw. - if (doError) { - var er; - if (args.length > 0) - er = args[0]; - if (er instanceof Error) { - // Note: The comments on the `throw` lines are intentional, they show - // up in Node's output if this results in an unhandled exception. - throw er; // Unhandled 'error' event - } - // At least give some kind of context to the user - var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : '')); - err.context = er; - throw err; // Unhandled 'error' event - } - - var handler = events[type]; - - if (handler === undefined) - return false; - - if (typeof handler === 'function') { - ReflectApply(handler, this, args); - } else { - var len = handler.length; - var listeners = arrayClone(handler, len); - for (var i = 0; i < len; ++i) - ReflectApply(listeners[i], this, args); - } - - return true; -}; - -function _addListener(target, type, listener, prepend) { - var m; - var events; - var existing; - - checkListener(listener); - - events = target._events; - if (events === undefined) { - events = target._events = Object.create(null); - target._eventsCount = 0; - } else { - // To avoid recursion in the case that type === "newListener"! Before - // adding it to the listeners, first emit "newListener". - if (events.newListener !== undefined) { - target.emit('newListener', type, - listener.listener ? listener.listener : listener); - - // Re-assign `events` because a newListener handler could have caused the - // this._events to be assigned to a new object - events = target._events; - } - existing = events[type]; - } - - if (existing === undefined) { - // Optimize the case of one listener. Don't need the extra array object. - existing = events[type] = listener; - ++target._eventsCount; - } else { - if (typeof existing === 'function') { - // Adding the second element, need to change to array. - existing = events[type] = - prepend ? [listener, existing] : [existing, listener]; - // If we've already got an array, just append. - } else if (prepend) { - existing.unshift(listener); - } else { - existing.push(listener); - } - - // Check for listener leak - m = _getMaxListeners(target); - if (m > 0 && existing.length > m && !existing.warned) { - existing.warned = true; - // No error code for this since it is a Warning - // eslint-disable-next-line no-restricted-syntax - var w = new Error('Possible EventEmitter memory leak detected. ' + - existing.length + ' ' + String(type) + ' listeners ' + - 'added. Use emitter.setMaxListeners() to ' + - 'increase limit'); - w.name = 'MaxListenersExceededWarning'; - w.emitter = target; - w.type = type; - w.count = existing.length; - ProcessEmitWarning(w); - } - } - - return target; -} - -EventEmitter.prototype.addListener = function addListener(type, listener) { - return _addListener(this, type, listener, false); -}; - -EventEmitter.prototype.on = EventEmitter.prototype.addListener; - -EventEmitter.prototype.prependListener = - function prependListener(type, listener) { - return _addListener(this, type, listener, true); - }; - -function onceWrapper() { - if (!this.fired) { - this.target.removeListener(this.type, this.wrapFn); - this.fired = true; - if (arguments.length === 0) - return this.listener.call(this.target); - return this.listener.apply(this.target, arguments); - } -} - -function _onceWrap(target, type, listener) { - var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener }; - var wrapped = onceWrapper.bind(state); - wrapped.listener = listener; - state.wrapFn = wrapped; - return wrapped; -} - -EventEmitter.prototype.once = function once(type, listener) { - checkListener(listener); - this.on(type, _onceWrap(this, type, listener)); - return this; -}; - -EventEmitter.prototype.prependOnceListener = - function prependOnceListener(type, listener) { - checkListener(listener); - this.prependListener(type, _onceWrap(this, type, listener)); - return this; - }; - -// Emits a 'removeListener' event if and only if the listener was removed. -EventEmitter.prototype.removeListener = - function removeListener(type, listener) { - var list, events, position, i, originalListener; - - checkListener(listener); - - events = this._events; - if (events === undefined) - return this; - - list = events[type]; - if (list === undefined) - return this; - - if (list === listener || list.listener === listener) { - if (--this._eventsCount === 0) - this._events = Object.create(null); - else { - delete events[type]; - if (events.removeListener) - this.emit('removeListener', type, list.listener || listener); - } - } else if (typeof list !== 'function') { - position = -1; - - for (i = list.length - 1; i >= 0; i--) { - if (list[i] === listener || list[i].listener === listener) { - originalListener = list[i].listener; - position = i; - break; - } - } - - if (position < 0) - return this; - - if (position === 0) - list.shift(); - else { - spliceOne(list, position); - } - - if (list.length === 1) - events[type] = list[0]; - - if (events.removeListener !== undefined) - this.emit('removeListener', type, originalListener || listener); - } - - return this; - }; - -EventEmitter.prototype.off = EventEmitter.prototype.removeListener; - -EventEmitter.prototype.removeAllListeners = - function removeAllListeners(type) { - var listeners, events, i; - - events = this._events; - if (events === undefined) - return this; - - // not listening for removeListener, no need to emit - if (events.removeListener === undefined) { - if (arguments.length === 0) { - this._events = Object.create(null); - this._eventsCount = 0; - } else if (events[type] !== undefined) { - if (--this._eventsCount === 0) - this._events = Object.create(null); - else - delete events[type]; - } - return this; - } - - // emit removeListener for all listeners on all events - if (arguments.length === 0) { - var keys = Object.keys(events); - var key; - for (i = 0; i < keys.length; ++i) { - key = keys[i]; - if (key === 'removeListener') continue; - this.removeAllListeners(key); - } - this.removeAllListeners('removeListener'); - this._events = Object.create(null); - this._eventsCount = 0; - return this; - } - - listeners = events[type]; - - if (typeof listeners === 'function') { - this.removeListener(type, listeners); - } else if (listeners !== undefined) { - // LIFO order - for (i = listeners.length - 1; i >= 0; i--) { - this.removeListener(type, listeners[i]); - } - } - - return this; - }; - -function _listeners(target, type, unwrap) { - var events = target._events; - - if (events === undefined) - return []; - - var evlistener = events[type]; - if (evlistener === undefined) - return []; - - if (typeof evlistener === 'function') - return unwrap ? [evlistener.listener || evlistener] : [evlistener]; - - return unwrap ? - unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length); -} - -EventEmitter.prototype.listeners = function listeners(type) { - return _listeners(this, type, true); -}; - -EventEmitter.prototype.rawListeners = function rawListeners(type) { - return _listeners(this, type, false); -}; - -EventEmitter.listenerCount = function(emitter, type) { - if (typeof emitter.listenerCount === 'function') { - return emitter.listenerCount(type); - } else { - return listenerCount.call(emitter, type); - } -}; - -EventEmitter.prototype.listenerCount = listenerCount; -function listenerCount(type) { - var events = this._events; - - if (events !== undefined) { - var evlistener = events[type]; - - if (typeof evlistener === 'function') { - return 1; - } else if (evlistener !== undefined) { - return evlistener.length; - } - } - - return 0; -} - -EventEmitter.prototype.eventNames = function eventNames() { - return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : []; -}; - -function arrayClone(arr, n) { - var copy = new Array(n); - for (var i = 0; i < n; ++i) - copy[i] = arr[i]; - return copy; -} - -function spliceOne(list, index) { - for (; index + 1 < list.length; index++) - list[index] = list[index + 1]; - list.pop(); -} - -function unwrapListeners(arr) { - var ret = new Array(arr.length); - for (var i = 0; i < ret.length; ++i) { - ret[i] = arr[i].listener || arr[i]; - } - return ret; -} - -function once(emitter, name) { - return new Promise(function (resolve, reject) { - function errorListener(err) { - emitter.removeListener(name, resolver); - reject(err); - } - - function resolver() { - if (typeof emitter.removeListener === 'function') { - emitter.removeListener('error', errorListener); - } - resolve([].slice.call(arguments)); - }; - - eventTargetAgnosticAddListener(emitter, name, resolver, { once: true }); - if (name !== 'error') { - addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true }); - } - }); -} - -function addErrorHandlerIfEventEmitter(emitter, handler, flags) { - if (typeof emitter.on === 'function') { - eventTargetAgnosticAddListener(emitter, 'error', handler, flags); - } -} - -function eventTargetAgnosticAddListener(emitter, name, listener, flags) { - if (typeof emitter.on === 'function') { - if (flags.once) { - emitter.once(name, listener); - } else { - emitter.on(name, listener); - } - } else if (typeof emitter.addEventListener === 'function') { - // EventTarget does not have `error` event semantics like Node - // EventEmitters, we do not listen for `error` events here. - emitter.addEventListener(name, function wrapListener(arg) { - // IE does not have builtin `{ once: true }` support so we - // have to do it manually. - if (flags.once) { - emitter.removeEventListener(name, wrapListener); - } - listener(arg); - }); - } else { - throw new TypeError('The "emitter" argument must be of type EventEmitter. Received type ' + typeof emitter); - } -} - - -/***/ }), - -/***/ "./node_modules/evp_bytestokey/index.js": -/*!**********************************************!*\ - !*** ./node_modules/evp_bytestokey/index.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var MD5 = __webpack_require__(/*! md5.js */ "./node_modules/md5.js/index.js") - -/* eslint-disable camelcase */ -function EVP_BytesToKey (password, salt, keyBits, ivLen) { - if (!Buffer.isBuffer(password)) password = Buffer.from(password, 'binary') - if (salt) { - if (!Buffer.isBuffer(salt)) salt = Buffer.from(salt, 'binary') - if (salt.length !== 8) throw new RangeError('salt should be Buffer with 8 byte length') - } - - var keyLen = keyBits / 8 - var key = Buffer.alloc(keyLen) - var iv = Buffer.alloc(ivLen || 0) - var tmp = Buffer.alloc(0) - - while (keyLen > 0 || ivLen > 0) { - var hash = new MD5() - hash.update(tmp) - hash.update(password) - if (salt) hash.update(salt) - tmp = hash.digest() - - var used = 0 - - if (keyLen > 0) { - var keyStart = key.length - keyLen - used = Math.min(keyLen, tmp.length) - tmp.copy(key, keyStart, 0, used) - keyLen -= used - } - - if (used < tmp.length && ivLen > 0) { - var ivStart = iv.length - ivLen - var length = Math.min(ivLen, tmp.length - used) - tmp.copy(iv, ivStart, used, used + length) - ivLen -= length - } - } - - tmp.fill(0) - return { key: key, iv: iv } -} - -module.exports = EVP_BytesToKey - - -/***/ }), - -/***/ "./node_modules/fast-fifo/fixed-size.js": -/*!**********************************************!*\ - !*** ./node_modules/fast-fifo/fixed-size.js ***! - \**********************************************/ -/***/ ((module) => { - -module.exports = class FixedFIFO { - constructor (hwm) { - if (!(hwm > 0) || ((hwm - 1) & hwm) !== 0) throw new Error('Max size for a FixedFIFO should be a power of two') - this.buffer = new Array(hwm) - this.mask = hwm - 1 - this.top = 0 - this.btm = 0 - this.next = null - } - - push (data) { - if (this.buffer[this.top] !== undefined) return false - this.buffer[this.top] = data - this.top = (this.top + 1) & this.mask - return true - } - - shift () { - const last = this.buffer[this.btm] - if (last === undefined) return undefined - this.buffer[this.btm] = undefined - this.btm = (this.btm + 1) & this.mask - return last - } - - isEmpty () { - return this.buffer[this.btm] === undefined - } -} - - -/***/ }), - -/***/ "./node_modules/fast-fifo/index.js": -/*!*****************************************!*\ - !*** ./node_modules/fast-fifo/index.js ***! - \*****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const FixedFIFO = __webpack_require__(/*! ./fixed-size */ "./node_modules/fast-fifo/fixed-size.js") - -module.exports = class FastFIFO { - constructor (hwm) { - this.hwm = hwm || 16 - this.head = new FixedFIFO(this.hwm) - this.tail = this.head - } - - push (val) { - if (!this.head.push(val)) { - const prev = this.head - this.head = prev.next = new FixedFIFO(2 * this.head.buffer.length) - this.head.push(val) - } - } - - shift () { - const val = this.tail.shift() - if (val === undefined && this.tail.next) { - const next = this.tail.next - this.tail.next = null - this.tail = next - return this.tail.shift() - } - return val - } - - isEmpty () { - return this.head.isEmpty() - } -} - - -/***/ }), - -/***/ "./node_modules/filestream/read.js": -/*!*****************************************!*\ - !*** ./node_modules/filestream/read.js ***! - \*****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* global FileReader */ - -const { Readable } = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -const toBuffer = __webpack_require__(/*! typedarray-to-buffer */ "./node_modules/typedarray-to-buffer/index.js") - -class FileReadStream extends Readable { - constructor (file, opts = {}) { - super(opts) - - // save the read offset - this._offset = 0 - this._ready = false - this._file = file - this._size = file.size - this._chunkSize = opts.chunkSize || Math.max(this._size / 1000, 200 * 1024) - - // create the reader - const reader = new FileReader() - - reader.onload = () => { - // get the data chunk - this.push(toBuffer(reader.result)) - } - reader.onerror = () => { - this.emit('error', reader.error) - } - - this.reader = reader - - // generate the header blocks that we will send as part of the initial payload - this._generateHeaderBlocks(file, opts, (err, blocks) => { - // if we encountered an error, emit it - if (err) { - return this.emit('error', err) - } - - // push the header blocks out to the stream - if (Array.isArray(blocks)) { - blocks.forEach(block => this.push(block)) - } - - this._ready = true - this.emit('_ready') - }) - } - - _generateHeaderBlocks (file, opts, callback) { - callback(null, []) - } - - _read () { - if (!this._ready) { - this.once('_ready', this._read.bind(this)) - return - } - - const startOffset = this._offset - let endOffset = this._offset + this._chunkSize - if (endOffset > this._size) endOffset = this._size - - if (startOffset === this._size) { - this.destroy() - this.push(null) - return - } - - this.reader.readAsArrayBuffer(this._file.slice(startOffset, endOffset)) - - // update the stream offset - this._offset = endOffset - } - - destroy () { - this._file = null - if (this.reader) { - this.reader.onload = null - this.reader.onerror = null - try { this.reader.abort() } catch (e) {}; - } - this.reader = null - } -} - -module.exports = FileReadStream - - -/***/ }), - -/***/ "./node_modules/foreach/index.js": -/*!***************************************!*\ - !*** ./node_modules/foreach/index.js ***! - \***************************************/ -/***/ ((module) => { - - -var hasOwn = Object.prototype.hasOwnProperty; -var toString = Object.prototype.toString; - -module.exports = function forEach (obj, fn, ctx) { - if (toString.call(fn) !== '[object Function]') { - throw new TypeError('iterator must be a function'); - } - var l = obj.length; - if (l === +l) { - for (var i = 0; i < l; i++) { - fn.call(ctx, obj[i], i, obj); - } - } else { - for (var k in obj) { - if (hasOwn.call(obj, k)) { - fn.call(ctx, obj[k], k, obj); - } - } - } -}; - - - -/***/ }), - -/***/ "./node_modules/fs-access-chunk-store/index.js": -/*!*****************************************************!*\ - !*** ./node_modules/fs-access-chunk-store/index.js ***! - \*****************************************************/ -/***/ ((module) => { - -/* eslint-env browser */ -class WebFsChunkStore { - constructor (chunkLength, opts = {}) { - this.chunkLength = Number(chunkLength) - - if (!this.chunkLength) { - throw new Error('First argument must be a chunk length') - } - - this.closed = false - - this.name = opts.name || 'default' - - this.rootDirPromise = opts.rootDir || navigator.storage.getDirectory() - this.storageDirPromise = this._getStorageDirectoryHandle() - this.chunksDirPromise = ((opts.files && opts.rootDir) && this._getChunksDirHandle()) || this.storageDirPromise - - this.chunks = [] // individual chunks, required for reads :/ - this.chunkMap = [] // full files - this.directoryMap = {} - - if (opts.files && opts.rootDir) { - this.files = opts.files.slice(0).map((file, i, files) => { - if (file.path == null) throw new Error('File is missing `path` property') - if (file.length == null) throw new Error('File is missing `length` property') - if (file.offset == null) { - if (i === 0) { - file.offset = 0 - } else { - const prevFile = files[i - 1] - file.offset = prevFile.offset + prevFile.length - } - } - - // file handles - if (file.handle == null) { - file.handle = this._createFileHandle({ path: file.path }) - } - - // file chunkMap - const fileStart = file.offset - const fileEnd = file.offset + file.length - - const firstChunk = Math.floor(fileStart / this.chunkLength) - const lastChunk = Math.floor((fileEnd - 1) / this.chunkLength) - - for (let p = firstChunk; p <= lastChunk; ++p) { - const chunkStart = p * this.chunkLength - const chunkEnd = chunkStart + this.chunkLength - - const from = (fileStart < chunkStart) ? 0 : fileStart - chunkStart - const to = (fileEnd > chunkEnd) ? this.chunkLength : fileEnd - chunkStart - const offset = (fileStart > chunkStart) ? 0 : chunkStart - fileStart - - if (!this.chunkMap[p]) this.chunkMap[p] = [] - - this.chunkMap[p].push({ from, to, offset, file }) - } - - return file - }) - - // close streams is page is frozen/unloaded, they will re-open if the user returns via BFC - window.addEventListener('pagehide', this.cleanup) - - this.length = this.files.reduce((sum, file) => sum + file.length, 0) - if (opts.length != null && opts.length !== this.length) { - throw new Error('total `files` length is not equal to explicit `length` option') - } - } else { - this.length = Number(opts.length) || Infinity - } - - if (this.length !== Infinity) { - this.lastChunkLength = this.length % this.chunkLength || this.chunkLength - this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1 - } - } - - async _getChunksDirHandle () { - const storageDir = await this.storageDirPromise - return await storageDir.getDirectoryHandle('chunks', { create: true }) - } - - async _getStorageDirectoryHandle () { - const rootDir = await this.rootDirPromise - return await rootDir.getDirectoryHandle(this.name, { create: true }) - } - - async _getChunk (index) { - let chunk = this.chunks[index] - - if (!chunk) { - const fileName = index.toString() - const storageDir = await this.chunksDirPromise - - chunk = this.chunks[index] = { fileHandlePromise: storageDir.getFileHandle(fileName, { create: true }) } - } - - return chunk - } - - async _createFileHandle (opts) { - const fileName = opts.path.slice(opts.path.lastIndexOf('/') + 1) - return (await this._getDirectoryHandle(opts)).getFileHandle(fileName, { create: true }) - } - - // recursive, equiv of cd and mkdirp - async _getDirectoryHandle (opts) { - const lastIndex = opts.path.lastIndexOf('/') - if (lastIndex === -1 || lastIndex === 0) return this.storageDirPromise - const path = opts.path = opts.path.slice(0, lastIndex) - if (!this.directoryMap[path]) { - const parent = this._getDirectoryHandle(opts) - this.directoryMap[path] = (await parent).getDirectoryHandle(path.slice(path.lastIndexOf('/') + 1), { create: true }) - } - return this.directoryMap[path] - } - - put (index, buf, cb = () => {}) { - if (this.closed) { - queueMicrotask(() => cb(new Error('Storage is closed'))) - return - } - - const isLastChunk = index === this.lastChunkIndex - if (isLastChunk && buf.length !== this.lastChunkLength) { - queueMicrotask(() => { - cb(new Error(`Last chunk length must be ${this.lastChunkLength}`)) - }) - return - } - if (!isLastChunk && buf.length !== this.chunkLength) { - queueMicrotask(() => { - cb(new Error(`Chunk length must be ${this.chunkLength}`)) - }) - return - } - - ;(async () => { - try { - const chunk = await this._getChunk(index) - const fileHandle = await chunk.fileHandlePromise - const stream = await fileHandle.createWritable({ - keepExistingData: false - }) - await stream.write(buf) - await stream.close() - } catch (err) { - cb(err) - return - } - - if (!this.files) cb(null) - })() - - if (this.files) { - const targets = this.chunkMap[index] - if (!targets) { - queueMicrotask(() => cb(new Error('No files matching the request range'))) - } - const promises = targets.map(target => { - return (async () => { - try { - const { file } = target - if (!file.stream) { - file.stream = (await file.handle).createWritable({ - keepExistingData: true - }) - } - const stream = await file.stream - await stream.write({ type: 'write', position: target.offset, data: buf.slice(target.from, target.to) }) - return null - } catch (err) { - return cb(err) - } - })() - }) - Promise.all(promises).then(() => cb(null)) - } - } - - get (index, opts, cb = () => {}) { - if (typeof opts === 'function') { - return this.get(index, null, opts) - } - if (this.closed) { - queueMicrotask(() => cb(new Error('Storage is closed'))) - return - } - - const isLastChunk = index === this.lastChunkIndex - const chunkLength = isLastChunk ? this.lastChunkLength : this.chunkLength - - if (!opts) opts = {} - - const rangeFrom = opts.offset || 0 - const rangeTo = opts.length ? rangeFrom + opts.length : chunkLength - const len = opts.length || chunkLength - rangeFrom - - if (!this.files || this.chunks[index]) { - ;(async () => { - let buf - try { - const chunk = await this._getChunk(index) - const fileHandle = await chunk.fileHandlePromise - let file = await fileHandle.getFile() - if (rangeFrom !== 0 || len !== chunkLength) { - file = file.slice(rangeFrom, len + rangeFrom) - } - buf = await file.arrayBuffer() - } catch (err) { - cb(err) - return - } - - if (buf.byteLength === 0) { - const err = new Error(`Index ${index} does not exist`) - err.notFound = true - cb(err) - return - } - - cb(null, new Uint8Array(buf)) - })() - } else { - let targets = this.chunkMap[index] - if (!targets) { - queueMicrotask(() => cb(new Error('No files matching the request range'))) - } - if (opts) { - targets = targets.filter(target => { - return target.to > rangeFrom && target.from < rangeTo - }) - if (targets.length === 0) { - queueMicrotask(() => cb(new Error('No files matching the request range'))) - } - } - if (rangeFrom === rangeTo) return queueMicrotask(() => cb(null, new Uint8Array(0))) - - const promises = targets.map(target => { - return (async () => { - let from = target.from - let to = target.to - let offset = target.offset - - if (opts) { - if (to > rangeTo) to = rangeTo - if (from < rangeFrom) { - offset += (rangeFrom - from) - from = rangeFrom - } - } - try { - const handle = await target.file.handle - const file = (await handle.getFile()).slice(offset, offset + to - from) - return await file.arrayBuffer() - } catch (err) { - return err - } - })() - }) - Promise.all(promises).then(values => { - if (values.length === 1) { - cb(null, new Uint8Array(values[0])) - } else { - new Blob(values).arrayBuffer().then(buf => { - cb(null, new Uint8Array(buf)) - }) - } - }) - } - } - - close (cb = () => {}) { - if (this.closed) { - queueMicrotask(() => cb(new Error('Storage is closed'))) - return - } - - this.closed = true - this.chunkMap = [] - this.directoryMap = {} - - this.cleanup() - - queueMicrotask(() => { - cb(null) - }) - } - - async cleanup () { - if (this.files) { - for (const file of this.files) { - if (file.stream) { - await (await file.stream).close() - file.stream = null - } - } - const storageDir = await this.storageDirPromise - await storageDir.removeEntry('chunks', { recursive: true }) - } - this.chunks = [] - } - - destroy (cb = () => {}) { - if (this.closed) { - queueMicrotask(() => cb(new Error('Storage is closed'))) - return - } - - const handleClose = async err => { - if (err) { - cb(err) - return - } - - try { - const rootDir = await this.rootDirPromise - await rootDir.removeEntry(this.name, { recursive: true }) - } catch (err) { - cb(err) - return - } - cb(null) - } - - this.close(handleClose) - } -} - -module.exports = WebFsChunkStore - - -/***/ }), - -/***/ "./node_modules/function-bind/implementation.js": -/*!******************************************************!*\ - !*** ./node_modules/function-bind/implementation.js ***! - \******************************************************/ -/***/ ((module) => { - -"use strict"; - - -/* eslint no-invalid-this: 1 */ - -var ERROR_MESSAGE = 'Function.prototype.bind called on incompatible '; -var slice = Array.prototype.slice; -var toStr = Object.prototype.toString; -var funcType = '[object Function]'; - -module.exports = function bind(that) { - var target = this; - if (typeof target !== 'function' || toStr.call(target) !== funcType) { - throw new TypeError(ERROR_MESSAGE + target); - } - var args = slice.call(arguments, 1); - - var bound; - var binder = function () { - if (this instanceof bound) { - var result = target.apply( - this, - args.concat(slice.call(arguments)) - ); - if (Object(result) === result) { - return result; - } - return this; - } else { - return target.apply( - that, - args.concat(slice.call(arguments)) - ); - } - }; - - var boundLength = Math.max(0, target.length - args.length); - var boundArgs = []; - for (var i = 0; i < boundLength; i++) { - boundArgs.push('$' + i); - } - - bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder); - - if (target.prototype) { - var Empty = function Empty() {}; - Empty.prototype = target.prototype; - bound.prototype = new Empty(); - Empty.prototype = null; - } - - return bound; -}; - - -/***/ }), - -/***/ "./node_modules/function-bind/index.js": -/*!*********************************************!*\ - !*** ./node_modules/function-bind/index.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var implementation = __webpack_require__(/*! ./implementation */ "./node_modules/function-bind/implementation.js"); - -module.exports = Function.prototype.bind || implementation; - - -/***/ }), - -/***/ "./node_modules/get-browser-rtc/index.js": -/*!***********************************************!*\ - !*** ./node_modules/get-browser-rtc/index.js ***! - \***********************************************/ -/***/ ((module) => { - -// originally pulled out of simple-peer - -module.exports = function getBrowserRTC () { - if (typeof globalThis === 'undefined') return null - var wrtc = { - RTCPeerConnection: globalThis.RTCPeerConnection || globalThis.mozRTCPeerConnection || - globalThis.webkitRTCPeerConnection, - RTCSessionDescription: globalThis.RTCSessionDescription || - globalThis.mozRTCSessionDescription || globalThis.webkitRTCSessionDescription, - RTCIceCandidate: globalThis.RTCIceCandidate || globalThis.mozRTCIceCandidate || - globalThis.webkitRTCIceCandidate - } - if (!wrtc.RTCPeerConnection) return null - return wrtc -} - - -/***/ }), - -/***/ "./node_modules/get-intrinsic/index.js": -/*!*********************************************!*\ - !*** ./node_modules/get-intrinsic/index.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var undefined; - -var $SyntaxError = SyntaxError; -var $Function = Function; -var $TypeError = TypeError; - -// eslint-disable-next-line consistent-return -var getEvalledConstructor = function (expressionSyntax) { - try { - return $Function('"use strict"; return (' + expressionSyntax + ').constructor;')(); - } catch (e) {} -}; - -var $gOPD = Object.getOwnPropertyDescriptor; -if ($gOPD) { - try { - $gOPD({}, ''); - } catch (e) { - $gOPD = null; // this is IE 8, which has a broken gOPD - } -} - -var throwTypeError = function () { - throw new $TypeError(); -}; -var ThrowTypeError = $gOPD - ? (function () { - try { - // eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties - arguments.callee; // IE 8 does not throw here - return throwTypeError; - } catch (calleeThrows) { - try { - // IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '') - return $gOPD(arguments, 'callee').get; - } catch (gOPDthrows) { - return throwTypeError; - } - } - }()) - : throwTypeError; - -var hasSymbols = __webpack_require__(/*! has-symbols */ "./node_modules/has-symbols/index.js")(); - -var getProto = Object.getPrototypeOf || function (x) { return x.__proto__; }; // eslint-disable-line no-proto - -var needsEval = {}; - -var TypedArray = typeof Uint8Array === 'undefined' ? undefined : getProto(Uint8Array); - -var INTRINSICS = { - '%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError, - '%Array%': Array, - '%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer, - '%ArrayIteratorPrototype%': hasSymbols ? getProto([][Symbol.iterator]()) : undefined, - '%AsyncFromSyncIteratorPrototype%': undefined, - '%AsyncFunction%': needsEval, - '%AsyncGenerator%': needsEval, - '%AsyncGeneratorFunction%': needsEval, - '%AsyncIteratorPrototype%': needsEval, - '%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics, - '%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt, - '%Boolean%': Boolean, - '%DataView%': typeof DataView === 'undefined' ? undefined : DataView, - '%Date%': Date, - '%decodeURI%': decodeURI, - '%decodeURIComponent%': decodeURIComponent, - '%encodeURI%': encodeURI, - '%encodeURIComponent%': encodeURIComponent, - '%Error%': Error, - '%eval%': eval, // eslint-disable-line no-eval - '%EvalError%': EvalError, - '%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array, - '%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array, - '%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry, - '%Function%': $Function, - '%GeneratorFunction%': needsEval, - '%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array, - '%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array, - '%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array, - '%isFinite%': isFinite, - '%isNaN%': isNaN, - '%IteratorPrototype%': hasSymbols ? getProto(getProto([][Symbol.iterator]())) : undefined, - '%JSON%': typeof JSON === 'object' ? JSON : undefined, - '%Map%': typeof Map === 'undefined' ? undefined : Map, - '%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols ? undefined : getProto(new Map()[Symbol.iterator]()), - '%Math%': Math, - '%Number%': Number, - '%Object%': Object, - '%parseFloat%': parseFloat, - '%parseInt%': parseInt, - '%Promise%': typeof Promise === 'undefined' ? undefined : Promise, - '%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy, - '%RangeError%': RangeError, - '%ReferenceError%': ReferenceError, - '%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect, - '%RegExp%': RegExp, - '%Set%': typeof Set === 'undefined' ? undefined : Set, - '%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols ? undefined : getProto(new Set()[Symbol.iterator]()), - '%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer, - '%String%': String, - '%StringIteratorPrototype%': hasSymbols ? getProto(''[Symbol.iterator]()) : undefined, - '%Symbol%': hasSymbols ? Symbol : undefined, - '%SyntaxError%': $SyntaxError, - '%ThrowTypeError%': ThrowTypeError, - '%TypedArray%': TypedArray, - '%TypeError%': $TypeError, - '%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array, - '%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray, - '%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array, - '%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array, - '%URIError%': URIError, - '%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap, - '%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef, - '%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet -}; - -var doEval = function doEval(name) { - var value; - if (name === '%AsyncFunction%') { - value = getEvalledConstructor('async function () {}'); - } else if (name === '%GeneratorFunction%') { - value = getEvalledConstructor('function* () {}'); - } else if (name === '%AsyncGeneratorFunction%') { - value = getEvalledConstructor('async function* () {}'); - } else if (name === '%AsyncGenerator%') { - var fn = doEval('%AsyncGeneratorFunction%'); - if (fn) { - value = fn.prototype; - } - } else if (name === '%AsyncIteratorPrototype%') { - var gen = doEval('%AsyncGenerator%'); - if (gen) { - value = getProto(gen.prototype); - } - } - - INTRINSICS[name] = value; - - return value; -}; - -var LEGACY_ALIASES = { - '%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'], - '%ArrayPrototype%': ['Array', 'prototype'], - '%ArrayProto_entries%': ['Array', 'prototype', 'entries'], - '%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'], - '%ArrayProto_keys%': ['Array', 'prototype', 'keys'], - '%ArrayProto_values%': ['Array', 'prototype', 'values'], - '%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'], - '%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'], - '%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'], - '%BooleanPrototype%': ['Boolean', 'prototype'], - '%DataViewPrototype%': ['DataView', 'prototype'], - '%DatePrototype%': ['Date', 'prototype'], - '%ErrorPrototype%': ['Error', 'prototype'], - '%EvalErrorPrototype%': ['EvalError', 'prototype'], - '%Float32ArrayPrototype%': ['Float32Array', 'prototype'], - '%Float64ArrayPrototype%': ['Float64Array', 'prototype'], - '%FunctionPrototype%': ['Function', 'prototype'], - '%Generator%': ['GeneratorFunction', 'prototype'], - '%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'], - '%Int8ArrayPrototype%': ['Int8Array', 'prototype'], - '%Int16ArrayPrototype%': ['Int16Array', 'prototype'], - '%Int32ArrayPrototype%': ['Int32Array', 'prototype'], - '%JSONParse%': ['JSON', 'parse'], - '%JSONStringify%': ['JSON', 'stringify'], - '%MapPrototype%': ['Map', 'prototype'], - '%NumberPrototype%': ['Number', 'prototype'], - '%ObjectPrototype%': ['Object', 'prototype'], - '%ObjProto_toString%': ['Object', 'prototype', 'toString'], - '%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'], - '%PromisePrototype%': ['Promise', 'prototype'], - '%PromiseProto_then%': ['Promise', 'prototype', 'then'], - '%Promise_all%': ['Promise', 'all'], - '%Promise_reject%': ['Promise', 'reject'], - '%Promise_resolve%': ['Promise', 'resolve'], - '%RangeErrorPrototype%': ['RangeError', 'prototype'], - '%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'], - '%RegExpPrototype%': ['RegExp', 'prototype'], - '%SetPrototype%': ['Set', 'prototype'], - '%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'], - '%StringPrototype%': ['String', 'prototype'], - '%SymbolPrototype%': ['Symbol', 'prototype'], - '%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'], - '%TypedArrayPrototype%': ['TypedArray', 'prototype'], - '%TypeErrorPrototype%': ['TypeError', 'prototype'], - '%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'], - '%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'], - '%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'], - '%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'], - '%URIErrorPrototype%': ['URIError', 'prototype'], - '%WeakMapPrototype%': ['WeakMap', 'prototype'], - '%WeakSetPrototype%': ['WeakSet', 'prototype'] -}; - -var bind = __webpack_require__(/*! function-bind */ "./node_modules/function-bind/index.js"); -var hasOwn = __webpack_require__(/*! has */ "./node_modules/has/src/index.js"); -var $concat = bind.call(Function.call, Array.prototype.concat); -var $spliceApply = bind.call(Function.apply, Array.prototype.splice); -var $replace = bind.call(Function.call, String.prototype.replace); -var $strSlice = bind.call(Function.call, String.prototype.slice); - -/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */ -var rePropName = /[^%.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|%$))/g; -var reEscapeChar = /\\(\\)?/g; /** Used to match backslashes in property paths. */ -var stringToPath = function stringToPath(string) { - var first = $strSlice(string, 0, 1); - var last = $strSlice(string, -1); - if (first === '%' && last !== '%') { - throw new $SyntaxError('invalid intrinsic syntax, expected closing `%`'); - } else if (last === '%' && first !== '%') { - throw new $SyntaxError('invalid intrinsic syntax, expected opening `%`'); - } - var result = []; - $replace(string, rePropName, function (match, number, quote, subString) { - result[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match; - }); - return result; -}; -/* end adaptation */ - -var getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) { - var intrinsicName = name; - var alias; - if (hasOwn(LEGACY_ALIASES, intrinsicName)) { - alias = LEGACY_ALIASES[intrinsicName]; - intrinsicName = '%' + alias[0] + '%'; - } - - if (hasOwn(INTRINSICS, intrinsicName)) { - var value = INTRINSICS[intrinsicName]; - if (value === needsEval) { - value = doEval(intrinsicName); - } - if (typeof value === 'undefined' && !allowMissing) { - throw new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!'); - } - - return { - alias: alias, - name: intrinsicName, - value: value - }; - } - - throw new $SyntaxError('intrinsic ' + name + ' does not exist!'); -}; - -module.exports = function GetIntrinsic(name, allowMissing) { - if (typeof name !== 'string' || name.length === 0) { - throw new $TypeError('intrinsic name must be a non-empty string'); - } - if (arguments.length > 1 && typeof allowMissing !== 'boolean') { - throw new $TypeError('"allowMissing" argument must be a boolean'); - } - - var parts = stringToPath(name); - var intrinsicBaseName = parts.length > 0 ? parts[0] : ''; - - var intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing); - var intrinsicRealName = intrinsic.name; - var value = intrinsic.value; - var skipFurtherCaching = false; - - var alias = intrinsic.alias; - if (alias) { - intrinsicBaseName = alias[0]; - $spliceApply(parts, $concat([0, 1], alias)); - } - - for (var i = 1, isOwn = true; i < parts.length; i += 1) { - var part = parts[i]; - var first = $strSlice(part, 0, 1); - var last = $strSlice(part, -1); - if ( - ( - (first === '"' || first === "'" || first === '`') - || (last === '"' || last === "'" || last === '`') - ) - && first !== last - ) { - throw new $SyntaxError('property names with quotes must have matching quotes'); - } - if (part === 'constructor' || !isOwn) { - skipFurtherCaching = true; - } - - intrinsicBaseName += '.' + part; - intrinsicRealName = '%' + intrinsicBaseName + '%'; - - if (hasOwn(INTRINSICS, intrinsicRealName)) { - value = INTRINSICS[intrinsicRealName]; - } else if (value != null) { - if (!(part in value)) { - if (!allowMissing) { - throw new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.'); - } - return void undefined; - } - if ($gOPD && (i + 1) >= parts.length) { - var desc = $gOPD(value, part); - isOwn = !!desc; - - // By convention, when a data property is converted to an accessor - // property to emulate a data property that does not suffer from - // the override mistake, that accessor's getter is marked with - // an `originalValue` property. Here, when we detect this, we - // uphold the illusion by pretending to see that original data - // property, i.e., returning the value rather than the getter - // itself. - if (isOwn && 'get' in desc && !('originalValue' in desc.get)) { - value = desc.get; - } else { - value = value[part]; - } - } else { - isOwn = hasOwn(value, part); - value = value[part]; - } - - if (isOwn && !skipFurtherCaching) { - INTRINSICS[intrinsicRealName] = value; - } - } - } - return value; -}; - - -/***/ }), - -/***/ "./node_modules/has-symbols/index.js": -/*!*******************************************!*\ - !*** ./node_modules/has-symbols/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var origSymbol = typeof Symbol !== 'undefined' && Symbol; -var hasSymbolSham = __webpack_require__(/*! ./shams */ "./node_modules/has-symbols/shams.js"); - -module.exports = function hasNativeSymbols() { - if (typeof origSymbol !== 'function') { return false; } - if (typeof Symbol !== 'function') { return false; } - if (typeof origSymbol('foo') !== 'symbol') { return false; } - if (typeof Symbol('bar') !== 'symbol') { return false; } - - return hasSymbolSham(); -}; - - -/***/ }), - -/***/ "./node_modules/has-symbols/shams.js": -/*!*******************************************!*\ - !*** ./node_modules/has-symbols/shams.js ***! - \*******************************************/ -/***/ ((module) => { - -"use strict"; - - -/* eslint complexity: [2, 18], max-statements: [2, 33] */ -module.exports = function hasSymbols() { - if (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; } - if (typeof Symbol.iterator === 'symbol') { return true; } - - var obj = {}; - var sym = Symbol('test'); - var symObj = Object(sym); - if (typeof sym === 'string') { return false; } - - if (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; } - if (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; } - - // temp disabled per https://github.com/ljharb/object.assign/issues/17 - // if (sym instanceof Symbol) { return false; } - // temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4 - // if (!(symObj instanceof Symbol)) { return false; } - - // if (typeof Symbol.prototype.toString !== 'function') { return false; } - // if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; } - - var symVal = 42; - obj[sym] = symVal; - for (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop - if (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; } - - if (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; } - - var syms = Object.getOwnPropertySymbols(obj); - if (syms.length !== 1 || syms[0] !== sym) { return false; } - - if (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; } - - if (typeof Object.getOwnPropertyDescriptor === 'function') { - var descriptor = Object.getOwnPropertyDescriptor(obj, sym); - if (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; } - } - - return true; -}; - - -/***/ }), - -/***/ "./node_modules/has/src/index.js": -/*!***************************************!*\ - !*** ./node_modules/has/src/index.js ***! - \***************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var bind = __webpack_require__(/*! function-bind */ "./node_modules/function-bind/index.js"); - -module.exports = bind.call(Function.call, Object.prototype.hasOwnProperty); - - -/***/ }), - -/***/ "./node_modules/hash-base/index.js": -/*!*****************************************!*\ - !*** ./node_modules/hash-base/index.js ***! - \*****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var Transform = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js").Transform -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") - -function throwIfNotStringOrBuffer (val, prefix) { - if (!Buffer.isBuffer(val) && typeof val !== 'string') { - throw new TypeError(prefix + ' must be a string or a buffer') - } -} - -function HashBase (blockSize) { - Transform.call(this) - - this._block = Buffer.allocUnsafe(blockSize) - this._blockSize = blockSize - this._blockOffset = 0 - this._length = [0, 0, 0, 0] - - this._finalized = false -} - -inherits(HashBase, Transform) - -HashBase.prototype._transform = function (chunk, encoding, callback) { - var error = null - try { - this.update(chunk, encoding) - } catch (err) { - error = err - } - - callback(error) -} - -HashBase.prototype._flush = function (callback) { - var error = null - try { - this.push(this.digest()) - } catch (err) { - error = err - } - - callback(error) -} - -HashBase.prototype.update = function (data, encoding) { - throwIfNotStringOrBuffer(data, 'Data') - if (this._finalized) throw new Error('Digest already called') - if (!Buffer.isBuffer(data)) data = Buffer.from(data, encoding) - - // consume data - var block = this._block - var offset = 0 - while (this._blockOffset + data.length - offset >= this._blockSize) { - for (var i = this._blockOffset; i < this._blockSize;) block[i++] = data[offset++] - this._update() - this._blockOffset = 0 - } - while (offset < data.length) block[this._blockOffset++] = data[offset++] - - // update length - for (var j = 0, carry = data.length * 8; carry > 0; ++j) { - this._length[j] += carry - carry = (this._length[j] / 0x0100000000) | 0 - if (carry > 0) this._length[j] -= 0x0100000000 * carry - } - - return this -} - -HashBase.prototype._update = function () { - throw new Error('_update is not implemented') -} - -HashBase.prototype.digest = function (encoding) { - if (this._finalized) throw new Error('Digest already called') - this._finalized = true - - var digest = this._digest() - if (encoding !== undefined) digest = digest.toString(encoding) - - // reset state - this._block.fill(0) - this._blockOffset = 0 - for (var i = 0; i < 4; ++i) this._length[i] = 0 - - return digest -} - -HashBase.prototype._digest = function () { - throw new Error('_digest is not implemented') -} - -module.exports = HashBase - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash.js": -/*!******************************************!*\ - !*** ./node_modules/hash.js/lib/hash.js ***! - \******************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var hash = exports; - -hash.utils = __webpack_require__(/*! ./hash/utils */ "./node_modules/hash.js/lib/hash/utils.js"); -hash.common = __webpack_require__(/*! ./hash/common */ "./node_modules/hash.js/lib/hash/common.js"); -hash.sha = __webpack_require__(/*! ./hash/sha */ "./node_modules/hash.js/lib/hash/sha.js"); -hash.ripemd = __webpack_require__(/*! ./hash/ripemd */ "./node_modules/hash.js/lib/hash/ripemd.js"); -hash.hmac = __webpack_require__(/*! ./hash/hmac */ "./node_modules/hash.js/lib/hash/hmac.js"); - -// Proxy hash functions to the main object -hash.sha1 = hash.sha.sha1; -hash.sha256 = hash.sha.sha256; -hash.sha224 = hash.sha.sha224; -hash.sha384 = hash.sha.sha384; -hash.sha512 = hash.sha.sha512; -hash.ripemd160 = hash.ripemd.ripemd160; - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/common.js": -/*!*************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/common.js ***! - \*************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ./utils */ "./node_modules/hash.js/lib/hash/utils.js"); -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); - -function BlockHash() { - this.pending = null; - this.pendingTotal = 0; - this.blockSize = this.constructor.blockSize; - this.outSize = this.constructor.outSize; - this.hmacStrength = this.constructor.hmacStrength; - this.padLength = this.constructor.padLength / 8; - this.endian = 'big'; - - this._delta8 = this.blockSize / 8; - this._delta32 = this.blockSize / 32; -} -exports.BlockHash = BlockHash; - -BlockHash.prototype.update = function update(msg, enc) { - // Convert message to array, pad it, and join into 32bit blocks - msg = utils.toArray(msg, enc); - if (!this.pending) - this.pending = msg; - else - this.pending = this.pending.concat(msg); - this.pendingTotal += msg.length; - - // Enough data, try updating - if (this.pending.length >= this._delta8) { - msg = this.pending; - - // Process pending data in blocks - var r = msg.length % this._delta8; - this.pending = msg.slice(msg.length - r, msg.length); - if (this.pending.length === 0) - this.pending = null; - - msg = utils.join32(msg, 0, msg.length - r, this.endian); - for (var i = 0; i < msg.length; i += this._delta32) - this._update(msg, i, i + this._delta32); - } - - return this; -}; - -BlockHash.prototype.digest = function digest(enc) { - this.update(this._pad()); - assert(this.pending === null); - - return this._digest(enc); -}; - -BlockHash.prototype._pad = function pad() { - var len = this.pendingTotal; - var bytes = this._delta8; - var k = bytes - ((len + this.padLength) % bytes); - var res = new Array(k + this.padLength); - res[0] = 0x80; - for (var i = 1; i < k; i++) - res[i] = 0; - - // Append length - len <<= 3; - if (this.endian === 'big') { - for (var t = 8; t < this.padLength; t++) - res[i++] = 0; - - res[i++] = 0; - res[i++] = 0; - res[i++] = 0; - res[i++] = 0; - res[i++] = (len >>> 24) & 0xff; - res[i++] = (len >>> 16) & 0xff; - res[i++] = (len >>> 8) & 0xff; - res[i++] = len & 0xff; - } else { - res[i++] = len & 0xff; - res[i++] = (len >>> 8) & 0xff; - res[i++] = (len >>> 16) & 0xff; - res[i++] = (len >>> 24) & 0xff; - res[i++] = 0; - res[i++] = 0; - res[i++] = 0; - res[i++] = 0; - - for (t = 8; t < this.padLength; t++) - res[i++] = 0; - } - - return res; -}; - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/hmac.js": -/*!***********************************************!*\ - !*** ./node_modules/hash.js/lib/hash/hmac.js ***! - \***********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ./utils */ "./node_modules/hash.js/lib/hash/utils.js"); -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); - -function Hmac(hash, key, enc) { - if (!(this instanceof Hmac)) - return new Hmac(hash, key, enc); - this.Hash = hash; - this.blockSize = hash.blockSize / 8; - this.outSize = hash.outSize / 8; - this.inner = null; - this.outer = null; - - this._init(utils.toArray(key, enc)); -} -module.exports = Hmac; - -Hmac.prototype._init = function init(key) { - // Shorten key, if needed - if (key.length > this.blockSize) - key = new this.Hash().update(key).digest(); - assert(key.length <= this.blockSize); - - // Add padding to key - for (var i = key.length; i < this.blockSize; i++) - key.push(0); - - for (i = 0; i < key.length; i++) - key[i] ^= 0x36; - this.inner = new this.Hash().update(key); - - // 0x36 ^ 0x5c = 0x6a - for (i = 0; i < key.length; i++) - key[i] ^= 0x6a; - this.outer = new this.Hash().update(key); -}; - -Hmac.prototype.update = function update(msg, enc) { - this.inner.update(msg, enc); - return this; -}; - -Hmac.prototype.digest = function digest(enc) { - this.outer.update(this.inner.digest()); - return this.outer.digest(enc); -}; - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/ripemd.js": -/*!*************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/ripemd.js ***! - \*************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ./utils */ "./node_modules/hash.js/lib/hash/utils.js"); -var common = __webpack_require__(/*! ./common */ "./node_modules/hash.js/lib/hash/common.js"); - -var rotl32 = utils.rotl32; -var sum32 = utils.sum32; -var sum32_3 = utils.sum32_3; -var sum32_4 = utils.sum32_4; -var BlockHash = common.BlockHash; - -function RIPEMD160() { - if (!(this instanceof RIPEMD160)) - return new RIPEMD160(); - - BlockHash.call(this); - - this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ]; - this.endian = 'little'; -} -utils.inherits(RIPEMD160, BlockHash); -exports.ripemd160 = RIPEMD160; - -RIPEMD160.blockSize = 512; -RIPEMD160.outSize = 160; -RIPEMD160.hmacStrength = 192; -RIPEMD160.padLength = 64; - -RIPEMD160.prototype._update = function update(msg, start) { - var A = this.h[0]; - var B = this.h[1]; - var C = this.h[2]; - var D = this.h[3]; - var E = this.h[4]; - var Ah = A; - var Bh = B; - var Ch = C; - var Dh = D; - var Eh = E; - for (var j = 0; j < 80; j++) { - var T = sum32( - rotl32( - sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)), - s[j]), - E); - A = E; - E = D; - D = rotl32(C, 10); - C = B; - B = T; - T = sum32( - rotl32( - sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)), - sh[j]), - Eh); - Ah = Eh; - Eh = Dh; - Dh = rotl32(Ch, 10); - Ch = Bh; - Bh = T; - } - T = sum32_3(this.h[1], C, Dh); - this.h[1] = sum32_3(this.h[2], D, Eh); - this.h[2] = sum32_3(this.h[3], E, Ah); - this.h[3] = sum32_3(this.h[4], A, Bh); - this.h[4] = sum32_3(this.h[0], B, Ch); - this.h[0] = T; -}; - -RIPEMD160.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h, 'little'); - else - return utils.split32(this.h, 'little'); -}; - -function f(j, x, y, z) { - if (j <= 15) - return x ^ y ^ z; - else if (j <= 31) - return (x & y) | ((~x) & z); - else if (j <= 47) - return (x | (~y)) ^ z; - else if (j <= 63) - return (x & z) | (y & (~z)); - else - return x ^ (y | (~z)); -} - -function K(j) { - if (j <= 15) - return 0x00000000; - else if (j <= 31) - return 0x5a827999; - else if (j <= 47) - return 0x6ed9eba1; - else if (j <= 63) - return 0x8f1bbcdc; - else - return 0xa953fd4e; -} - -function Kh(j) { - if (j <= 15) - return 0x50a28be6; - else if (j <= 31) - return 0x5c4dd124; - else if (j <= 47) - return 0x6d703ef3; - else if (j <= 63) - return 0x7a6d76e9; - else - return 0x00000000; -} - -var r = [ - 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 -]; - -var rh = [ - 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 -]; - -var s = [ - 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 -]; - -var sh = [ - 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 -]; - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/sha.js": -/*!**********************************************!*\ - !*** ./node_modules/hash.js/lib/hash/sha.js ***! - \**********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -exports.sha1 = __webpack_require__(/*! ./sha/1 */ "./node_modules/hash.js/lib/hash/sha/1.js"); -exports.sha224 = __webpack_require__(/*! ./sha/224 */ "./node_modules/hash.js/lib/hash/sha/224.js"); -exports.sha256 = __webpack_require__(/*! ./sha/256 */ "./node_modules/hash.js/lib/hash/sha/256.js"); -exports.sha384 = __webpack_require__(/*! ./sha/384 */ "./node_modules/hash.js/lib/hash/sha/384.js"); -exports.sha512 = __webpack_require__(/*! ./sha/512 */ "./node_modules/hash.js/lib/hash/sha/512.js"); - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/sha/1.js": -/*!************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/sha/1.js ***! - \************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/hash.js/lib/hash/utils.js"); -var common = __webpack_require__(/*! ../common */ "./node_modules/hash.js/lib/hash/common.js"); -var shaCommon = __webpack_require__(/*! ./common */ "./node_modules/hash.js/lib/hash/sha/common.js"); - -var rotl32 = utils.rotl32; -var sum32 = utils.sum32; -var sum32_5 = utils.sum32_5; -var ft_1 = shaCommon.ft_1; -var BlockHash = common.BlockHash; - -var sha1_K = [ - 0x5A827999, 0x6ED9EBA1, - 0x8F1BBCDC, 0xCA62C1D6 -]; - -function SHA1() { - if (!(this instanceof SHA1)) - return new SHA1(); - - BlockHash.call(this); - this.h = [ - 0x67452301, 0xefcdab89, 0x98badcfe, - 0x10325476, 0xc3d2e1f0 ]; - this.W = new Array(80); -} - -utils.inherits(SHA1, BlockHash); -module.exports = SHA1; - -SHA1.blockSize = 512; -SHA1.outSize = 160; -SHA1.hmacStrength = 80; -SHA1.padLength = 64; - -SHA1.prototype._update = function _update(msg, start) { - var W = this.W; - - for (var i = 0; i < 16; i++) - W[i] = msg[start + i]; - - for(; i < W.length; i++) - W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1); - - var a = this.h[0]; - var b = this.h[1]; - var c = this.h[2]; - var d = this.h[3]; - var e = this.h[4]; - - for (i = 0; i < W.length; i++) { - var s = ~~(i / 20); - var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]); - e = d; - d = c; - c = rotl32(b, 30); - b = a; - a = t; - } - - this.h[0] = sum32(this.h[0], a); - this.h[1] = sum32(this.h[1], b); - this.h[2] = sum32(this.h[2], c); - this.h[3] = sum32(this.h[3], d); - this.h[4] = sum32(this.h[4], e); -}; - -SHA1.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h, 'big'); - else - return utils.split32(this.h, 'big'); -}; - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/sha/224.js": -/*!**************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/sha/224.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/hash.js/lib/hash/utils.js"); -var SHA256 = __webpack_require__(/*! ./256 */ "./node_modules/hash.js/lib/hash/sha/256.js"); - -function SHA224() { - if (!(this instanceof SHA224)) - return new SHA224(); - - SHA256.call(this); - this.h = [ - 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939, - 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ]; -} -utils.inherits(SHA224, SHA256); -module.exports = SHA224; - -SHA224.blockSize = 512; -SHA224.outSize = 224; -SHA224.hmacStrength = 192; -SHA224.padLength = 64; - -SHA224.prototype._digest = function digest(enc) { - // Just truncate output - if (enc === 'hex') - return utils.toHex32(this.h.slice(0, 7), 'big'); - else - return utils.split32(this.h.slice(0, 7), 'big'); -}; - - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/sha/256.js": -/*!**************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/sha/256.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/hash.js/lib/hash/utils.js"); -var common = __webpack_require__(/*! ../common */ "./node_modules/hash.js/lib/hash/common.js"); -var shaCommon = __webpack_require__(/*! ./common */ "./node_modules/hash.js/lib/hash/sha/common.js"); -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); - -var sum32 = utils.sum32; -var sum32_4 = utils.sum32_4; -var sum32_5 = utils.sum32_5; -var ch32 = shaCommon.ch32; -var maj32 = shaCommon.maj32; -var s0_256 = shaCommon.s0_256; -var s1_256 = shaCommon.s1_256; -var g0_256 = shaCommon.g0_256; -var g1_256 = shaCommon.g1_256; - -var BlockHash = common.BlockHash; - -var 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 -]; - -function SHA256() { - if (!(this instanceof SHA256)) - return new SHA256(); - - BlockHash.call(this); - this.h = [ - 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a, - 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19 - ]; - this.k = sha256_K; - this.W = new Array(64); -} -utils.inherits(SHA256, BlockHash); -module.exports = SHA256; - -SHA256.blockSize = 512; -SHA256.outSize = 256; -SHA256.hmacStrength = 192; -SHA256.padLength = 64; - -SHA256.prototype._update = function _update(msg, start) { - var W = this.W; - - for (var i = 0; i < 16; i++) - W[i] = msg[start + i]; - for (; i < W.length; i++) - W[i] = sum32_4(g1_256(W[i - 2]), W[i - 7], g0_256(W[i - 15]), W[i - 16]); - - var a = this.h[0]; - var b = this.h[1]; - var c = this.h[2]; - var d = this.h[3]; - var e = this.h[4]; - var f = this.h[5]; - var g = this.h[6]; - var h = this.h[7]; - - assert(this.k.length === W.length); - for (i = 0; i < W.length; i++) { - var T1 = sum32_5(h, s1_256(e), ch32(e, f, g), this.k[i], W[i]); - var T2 = sum32(s0_256(a), maj32(a, b, c)); - h = g; - g = f; - f = e; - e = sum32(d, T1); - d = c; - c = b; - b = a; - a = sum32(T1, T2); - } - - this.h[0] = sum32(this.h[0], a); - this.h[1] = sum32(this.h[1], b); - this.h[2] = sum32(this.h[2], c); - this.h[3] = sum32(this.h[3], d); - this.h[4] = sum32(this.h[4], e); - this.h[5] = sum32(this.h[5], f); - this.h[6] = sum32(this.h[6], g); - this.h[7] = sum32(this.h[7], h); -}; - -SHA256.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h, 'big'); - else - return utils.split32(this.h, 'big'); -}; - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/sha/384.js": -/*!**************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/sha/384.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/hash.js/lib/hash/utils.js"); - -var SHA512 = __webpack_require__(/*! ./512 */ "./node_modules/hash.js/lib/hash/sha/512.js"); - -function SHA384() { - if (!(this instanceof SHA384)) - return new SHA384(); - - SHA512.call(this); - this.h = [ - 0xcbbb9d5d, 0xc1059ed8, - 0x629a292a, 0x367cd507, - 0x9159015a, 0x3070dd17, - 0x152fecd8, 0xf70e5939, - 0x67332667, 0xffc00b31, - 0x8eb44a87, 0x68581511, - 0xdb0c2e0d, 0x64f98fa7, - 0x47b5481d, 0xbefa4fa4 ]; -} -utils.inherits(SHA384, SHA512); -module.exports = SHA384; - -SHA384.blockSize = 1024; -SHA384.outSize = 384; -SHA384.hmacStrength = 192; -SHA384.padLength = 128; - -SHA384.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h.slice(0, 12), 'big'); - else - return utils.split32(this.h.slice(0, 12), 'big'); -}; - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/sha/512.js": -/*!**************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/sha/512.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/hash.js/lib/hash/utils.js"); -var common = __webpack_require__(/*! ../common */ "./node_modules/hash.js/lib/hash/common.js"); -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); - -var rotr64_hi = utils.rotr64_hi; -var rotr64_lo = utils.rotr64_lo; -var shr64_hi = utils.shr64_hi; -var shr64_lo = utils.shr64_lo; -var sum64 = utils.sum64; -var sum64_hi = utils.sum64_hi; -var sum64_lo = utils.sum64_lo; -var sum64_4_hi = utils.sum64_4_hi; -var sum64_4_lo = utils.sum64_4_lo; -var sum64_5_hi = utils.sum64_5_hi; -var sum64_5_lo = utils.sum64_5_lo; - -var BlockHash = common.BlockHash; - -var 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 -]; - -function SHA512() { - if (!(this instanceof SHA512)) - return new SHA512(); - - BlockHash.call(this); - this.h = [ - 0x6a09e667, 0xf3bcc908, - 0xbb67ae85, 0x84caa73b, - 0x3c6ef372, 0xfe94f82b, - 0xa54ff53a, 0x5f1d36f1, - 0x510e527f, 0xade682d1, - 0x9b05688c, 0x2b3e6c1f, - 0x1f83d9ab, 0xfb41bd6b, - 0x5be0cd19, 0x137e2179 ]; - this.k = sha512_K; - this.W = new Array(160); -} -utils.inherits(SHA512, BlockHash); -module.exports = SHA512; - -SHA512.blockSize = 1024; -SHA512.outSize = 512; -SHA512.hmacStrength = 192; -SHA512.padLength = 128; - -SHA512.prototype._prepareBlock = function _prepareBlock(msg, start) { - var W = this.W; - - // 32 x 32bit words - for (var i = 0; i < 32; i++) - W[i] = msg[start + i]; - for (; i < W.length; i += 2) { - var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2 - var c0_lo = g1_512_lo(W[i - 4], W[i - 3]); - var c1_hi = W[i - 14]; // i - 7 - var c1_lo = W[i - 13]; - var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15 - var c2_lo = g0_512_lo(W[i - 30], W[i - 29]); - var c3_hi = W[i - 32]; // i - 16 - var c3_lo = W[i - 31]; - - W[i] = sum64_4_hi( - c0_hi, c0_lo, - c1_hi, c1_lo, - c2_hi, c2_lo, - c3_hi, c3_lo); - W[i + 1] = sum64_4_lo( - c0_hi, c0_lo, - c1_hi, c1_lo, - c2_hi, c2_lo, - c3_hi, c3_lo); - } -}; - -SHA512.prototype._update = function _update(msg, start) { - this._prepareBlock(msg, start); - - var W = this.W; - - var ah = this.h[0]; - var al = this.h[1]; - var bh = this.h[2]; - var bl = this.h[3]; - var ch = this.h[4]; - var cl = this.h[5]; - var dh = this.h[6]; - var dl = this.h[7]; - var eh = this.h[8]; - var el = this.h[9]; - var fh = this.h[10]; - var fl = this.h[11]; - var gh = this.h[12]; - var gl = this.h[13]; - var hh = this.h[14]; - var hl = this.h[15]; - - assert(this.k.length === W.length); - for (var i = 0; i < W.length; i += 2) { - var c0_hi = hh; - var c0_lo = hl; - var c1_hi = s1_512_hi(eh, el); - var c1_lo = s1_512_lo(eh, el); - var c2_hi = ch64_hi(eh, el, fh, fl, gh, gl); - var c2_lo = ch64_lo(eh, el, fh, fl, gh, gl); - var c3_hi = this.k[i]; - var c3_lo = this.k[i + 1]; - var c4_hi = W[i]; - var c4_lo = W[i + 1]; - - 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); - 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); - - c0_hi = s0_512_hi(ah, al); - c0_lo = s0_512_lo(ah, al); - c1_hi = maj64_hi(ah, al, bh, bl, ch, cl); - c1_lo = maj64_lo(ah, al, bh, bl, ch, cl); - - var T2_hi = sum64_hi(c0_hi, c0_lo, c1_hi, c1_lo); - var T2_lo = sum64_lo(c0_hi, c0_lo, c1_hi, c1_lo); - - hh = gh; - hl = gl; - - gh = fh; - gl = fl; - - fh = eh; - fl = el; - - eh = sum64_hi(dh, dl, T1_hi, T1_lo); - el = sum64_lo(dl, dl, T1_hi, T1_lo); - - dh = ch; - dl = cl; - - ch = bh; - cl = bl; - - bh = ah; - bl = al; - - ah = sum64_hi(T1_hi, T1_lo, T2_hi, T2_lo); - al = sum64_lo(T1_hi, T1_lo, T2_hi, T2_lo); - } - - sum64(this.h, 0, ah, al); - sum64(this.h, 2, bh, bl); - sum64(this.h, 4, ch, cl); - sum64(this.h, 6, dh, dl); - sum64(this.h, 8, eh, el); - sum64(this.h, 10, fh, fl); - sum64(this.h, 12, gh, gl); - sum64(this.h, 14, hh, hl); -}; - -SHA512.prototype._digest = function digest(enc) { - if (enc === 'hex') - return utils.toHex32(this.h, 'big'); - else - return utils.split32(this.h, 'big'); -}; - -function ch64_hi(xh, xl, yh, yl, zh) { - var r = (xh & yh) ^ ((~xh) & zh); - if (r < 0) - r += 0x100000000; - return r; -} - -function ch64_lo(xh, xl, yh, yl, zh, zl) { - var r = (xl & yl) ^ ((~xl) & zl); - if (r < 0) - r += 0x100000000; - return r; -} - -function maj64_hi(xh, xl, yh, yl, zh) { - var r = (xh & yh) ^ (xh & zh) ^ (yh & zh); - if (r < 0) - r += 0x100000000; - return r; -} - -function maj64_lo(xh, xl, yh, yl, zh, zl) { - var r = (xl & yl) ^ (xl & zl) ^ (yl & zl); - if (r < 0) - r += 0x100000000; - return r; -} - -function s0_512_hi(xh, xl) { - var c0_hi = rotr64_hi(xh, xl, 28); - var c1_hi = rotr64_hi(xl, xh, 2); // 34 - var c2_hi = rotr64_hi(xl, xh, 7); // 39 - - var r = c0_hi ^ c1_hi ^ c2_hi; - if (r < 0) - r += 0x100000000; - return r; -} - -function s0_512_lo(xh, xl) { - var c0_lo = rotr64_lo(xh, xl, 28); - var c1_lo = rotr64_lo(xl, xh, 2); // 34 - var c2_lo = rotr64_lo(xl, xh, 7); // 39 - - var r = c0_lo ^ c1_lo ^ c2_lo; - if (r < 0) - r += 0x100000000; - return r; -} - -function s1_512_hi(xh, xl) { - var c0_hi = rotr64_hi(xh, xl, 14); - var c1_hi = rotr64_hi(xh, xl, 18); - var c2_hi = rotr64_hi(xl, xh, 9); // 41 - - var r = c0_hi ^ c1_hi ^ c2_hi; - if (r < 0) - r += 0x100000000; - return r; -} - -function s1_512_lo(xh, xl) { - var c0_lo = rotr64_lo(xh, xl, 14); - var c1_lo = rotr64_lo(xh, xl, 18); - var c2_lo = rotr64_lo(xl, xh, 9); // 41 - - var r = c0_lo ^ c1_lo ^ c2_lo; - if (r < 0) - r += 0x100000000; - return r; -} - -function g0_512_hi(xh, xl) { - var c0_hi = rotr64_hi(xh, xl, 1); - var c1_hi = rotr64_hi(xh, xl, 8); - var c2_hi = shr64_hi(xh, xl, 7); - - var r = c0_hi ^ c1_hi ^ c2_hi; - if (r < 0) - r += 0x100000000; - return r; -} - -function g0_512_lo(xh, xl) { - var c0_lo = rotr64_lo(xh, xl, 1); - var c1_lo = rotr64_lo(xh, xl, 8); - var c2_lo = shr64_lo(xh, xl, 7); - - var r = c0_lo ^ c1_lo ^ c2_lo; - if (r < 0) - r += 0x100000000; - return r; -} - -function g1_512_hi(xh, xl) { - var c0_hi = rotr64_hi(xh, xl, 19); - var c1_hi = rotr64_hi(xl, xh, 29); // 61 - var c2_hi = shr64_hi(xh, xl, 6); - - var r = c0_hi ^ c1_hi ^ c2_hi; - if (r < 0) - r += 0x100000000; - return r; -} - -function g1_512_lo(xh, xl) { - var c0_lo = rotr64_lo(xh, xl, 19); - var c1_lo = rotr64_lo(xl, xh, 29); // 61 - var c2_lo = shr64_lo(xh, xl, 6); - - var r = c0_lo ^ c1_lo ^ c2_lo; - if (r < 0) - r += 0x100000000; - return r; -} - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/sha/common.js": -/*!*****************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/sha/common.js ***! - \*****************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var utils = __webpack_require__(/*! ../utils */ "./node_modules/hash.js/lib/hash/utils.js"); -var rotr32 = utils.rotr32; - -function ft_1(s, x, y, z) { - if (s === 0) - return ch32(x, y, z); - if (s === 1 || s === 3) - return p32(x, y, z); - if (s === 2) - return maj32(x, y, z); -} -exports.ft_1 = ft_1; - -function ch32(x, y, z) { - return (x & y) ^ ((~x) & z); -} -exports.ch32 = ch32; - -function maj32(x, y, z) { - return (x & y) ^ (x & z) ^ (y & z); -} -exports.maj32 = maj32; - -function p32(x, y, z) { - return x ^ y ^ z; -} -exports.p32 = p32; - -function s0_256(x) { - return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22); -} -exports.s0_256 = s0_256; - -function s1_256(x) { - return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25); -} -exports.s1_256 = s1_256; - -function g0_256(x) { - return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3); -} -exports.g0_256 = g0_256; - -function g1_256(x) { - return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10); -} -exports.g1_256 = g1_256; - - -/***/ }), - -/***/ "./node_modules/hash.js/lib/hash/utils.js": -/*!************************************************!*\ - !*** ./node_modules/hash.js/lib/hash/utils.js ***! - \************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -exports.inherits = inherits; - -function isSurrogatePair(msg, i) { - if ((msg.charCodeAt(i) & 0xFC00) !== 0xD800) { - return false; - } - if (i < 0 || i + 1 >= msg.length) { - return false; - } - return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00; -} - -function toArray(msg, enc) { - if (Array.isArray(msg)) - return msg.slice(); - if (!msg) - return []; - var res = []; - if (typeof msg === 'string') { - if (!enc) { - // Inspired by stringToUtf8ByteArray() in closure-library by Google - // https://github.com/google/closure-library/blob/8598d87242af59aac233270742c8984e2b2bdbe0/closure/goog/crypt/crypt.js#L117-L143 - // Apache License 2.0 - // https://github.com/google/closure-library/blob/master/LICENSE - var p = 0; - for (var i = 0; i < msg.length; i++) { - var c = msg.charCodeAt(i); - if (c < 128) { - res[p++] = c; - } else if (c < 2048) { - res[p++] = (c >> 6) | 192; - res[p++] = (c & 63) | 128; - } else if (isSurrogatePair(msg, i)) { - c = 0x10000 + ((c & 0x03FF) << 10) + (msg.charCodeAt(++i) & 0x03FF); - res[p++] = (c >> 18) | 240; - res[p++] = ((c >> 12) & 63) | 128; - res[p++] = ((c >> 6) & 63) | 128; - res[p++] = (c & 63) | 128; - } else { - res[p++] = (c >> 12) | 224; - res[p++] = ((c >> 6) & 63) | 128; - res[p++] = (c & 63) | 128; - } - } - } else if (enc === 'hex') { - msg = msg.replace(/[^a-z0-9]+/ig, ''); - if (msg.length % 2 !== 0) - msg = '0' + msg; - for (i = 0; i < msg.length; i += 2) - res.push(parseInt(msg[i] + msg[i + 1], 16)); - } - } else { - for (i = 0; i < msg.length; i++) - res[i] = msg[i] | 0; - } - return res; -} -exports.toArray = toArray; - -function toHex(msg) { - var res = ''; - for (var i = 0; i < msg.length; i++) - res += zero2(msg[i].toString(16)); - return res; -} -exports.toHex = toHex; - -function htonl(w) { - var res = (w >>> 24) | - ((w >>> 8) & 0xff00) | - ((w << 8) & 0xff0000) | - ((w & 0xff) << 24); - return res >>> 0; -} -exports.htonl = htonl; - -function toHex32(msg, endian) { - var res = ''; - for (var i = 0; i < msg.length; i++) { - var w = msg[i]; - if (endian === 'little') - w = htonl(w); - res += zero8(w.toString(16)); - } - return res; -} -exports.toHex32 = toHex32; - -function zero2(word) { - if (word.length === 1) - return '0' + word; - else - return word; -} -exports.zero2 = zero2; - -function zero8(word) { - 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; -} -exports.zero8 = zero8; - -function join32(msg, start, end, endian) { - var len = end - start; - assert(len % 4 === 0); - var res = new Array(len / 4); - for (var i = 0, k = start; i < res.length; i++, k += 4) { - var w; - 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]; - res[i] = w >>> 0; - } - return res; -} -exports.join32 = join32; - -function split32(msg, endian) { - var res = new Array(msg.length * 4); - for (var i = 0, k = 0; i < msg.length; i++, k += 4) { - var m = msg[i]; - if (endian === 'big') { - res[k] = m >>> 24; - res[k + 1] = (m >>> 16) & 0xff; - res[k + 2] = (m >>> 8) & 0xff; - res[k + 3] = m & 0xff; - } else { - res[k + 3] = m >>> 24; - res[k + 2] = (m >>> 16) & 0xff; - res[k + 1] = (m >>> 8) & 0xff; - res[k] = m & 0xff; - } - } - return res; -} -exports.split32 = split32; - -function rotr32(w, b) { - return (w >>> b) | (w << (32 - b)); -} -exports.rotr32 = rotr32; - -function rotl32(w, b) { - return (w << b) | (w >>> (32 - b)); -} -exports.rotl32 = rotl32; - -function sum32(a, b) { - return (a + b) >>> 0; -} -exports.sum32 = sum32; - -function sum32_3(a, b, c) { - return (a + b + c) >>> 0; -} -exports.sum32_3 = sum32_3; - -function sum32_4(a, b, c, d) { - return (a + b + c + d) >>> 0; -} -exports.sum32_4 = sum32_4; - -function sum32_5(a, b, c, d, e) { - return (a + b + c + d + e) >>> 0; -} -exports.sum32_5 = sum32_5; - -function sum64(buf, pos, ah, al) { - var bh = buf[pos]; - var bl = buf[pos + 1]; - - var lo = (al + bl) >>> 0; - var hi = (lo < al ? 1 : 0) + ah + bh; - buf[pos] = hi >>> 0; - buf[pos + 1] = lo; -} -exports.sum64 = sum64; - -function sum64_hi(ah, al, bh, bl) { - var lo = (al + bl) >>> 0; - var hi = (lo < al ? 1 : 0) + ah + bh; - return hi >>> 0; -} -exports.sum64_hi = sum64_hi; - -function sum64_lo(ah, al, bh, bl) { - var lo = al + bl; - return lo >>> 0; -} -exports.sum64_lo = sum64_lo; - -function sum64_4_hi(ah, al, bh, bl, ch, cl, dh, dl) { - var carry = 0; - var lo = al; - lo = (lo + bl) >>> 0; - carry += lo < al ? 1 : 0; - lo = (lo + cl) >>> 0; - carry += lo < cl ? 1 : 0; - lo = (lo + dl) >>> 0; - carry += lo < dl ? 1 : 0; - - var hi = ah + bh + ch + dh + carry; - return hi >>> 0; -} -exports.sum64_4_hi = sum64_4_hi; - -function sum64_4_lo(ah, al, bh, bl, ch, cl, dh, dl) { - var lo = al + bl + cl + dl; - return lo >>> 0; -} -exports.sum64_4_lo = sum64_4_lo; - -function sum64_5_hi(ah, al, bh, bl, ch, cl, dh, dl, eh, el) { - var carry = 0; - var lo = al; - lo = (lo + bl) >>> 0; - carry += lo < al ? 1 : 0; - lo = (lo + cl) >>> 0; - carry += lo < cl ? 1 : 0; - lo = (lo + dl) >>> 0; - carry += lo < dl ? 1 : 0; - lo = (lo + el) >>> 0; - carry += lo < el ? 1 : 0; - - var hi = ah + bh + ch + dh + eh + carry; - return hi >>> 0; -} -exports.sum64_5_hi = sum64_5_hi; - -function sum64_5_lo(ah, al, bh, bl, ch, cl, dh, dl, eh, el) { - var lo = al + bl + cl + dl + el; - - return lo >>> 0; -} -exports.sum64_5_lo = sum64_5_lo; - -function rotr64_hi(ah, al, num) { - var r = (al << (32 - num)) | (ah >>> num); - return r >>> 0; -} -exports.rotr64_hi = rotr64_hi; - -function rotr64_lo(ah, al, num) { - var r = (ah << (32 - num)) | (al >>> num); - return r >>> 0; -} -exports.rotr64_lo = rotr64_lo; - -function shr64_hi(ah, al, num) { - return ah >>> num; -} -exports.shr64_hi = shr64_hi; - -function shr64_lo(ah, al, num) { - var r = (ah << (32 - num)) | (al >>> num); - return r >>> 0; -} -exports.shr64_lo = shr64_lo; - - -/***/ }), - -/***/ "./node_modules/hmac-drbg/lib/hmac-drbg.js": -/*!*************************************************!*\ - !*** ./node_modules/hmac-drbg/lib/hmac-drbg.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var hash = __webpack_require__(/*! hash.js */ "./node_modules/hash.js/lib/hash.js"); -var utils = __webpack_require__(/*! minimalistic-crypto-utils */ "./node_modules/minimalistic-crypto-utils/lib/utils.js"); -var assert = __webpack_require__(/*! minimalistic-assert */ "./node_modules/minimalistic-assert/index.js"); - -function HmacDRBG(options) { - if (!(this instanceof HmacDRBG)) - return new HmacDRBG(options); - this.hash = options.hash; - this.predResist = !!options.predResist; - - this.outLen = this.hash.outSize; - this.minEntropy = options.minEntropy || this.hash.hmacStrength; - - this._reseed = null; - this.reseedInterval = null; - this.K = null; - this.V = null; - - var entropy = utils.toArray(options.entropy, options.entropyEnc || 'hex'); - var nonce = utils.toArray(options.nonce, options.nonceEnc || 'hex'); - var pers = utils.toArray(options.pers, options.persEnc || 'hex'); - assert(entropy.length >= (this.minEntropy / 8), - 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits'); - this._init(entropy, nonce, pers); -} -module.exports = HmacDRBG; - -HmacDRBG.prototype._init = function init(entropy, nonce, pers) { - var seed = entropy.concat(nonce).concat(pers); - - this.K = new Array(this.outLen / 8); - this.V = new Array(this.outLen / 8); - for (var i = 0; i < this.V.length; i++) { - this.K[i] = 0x00; - this.V[i] = 0x01; - } - - this._update(seed); - this._reseed = 1; - this.reseedInterval = 0x1000000000000; // 2^48 -}; - -HmacDRBG.prototype._hmac = function hmac() { - return new hash.hmac(this.hash, this.K); -}; - -HmacDRBG.prototype._update = function update(seed) { - var kmac = this._hmac() - .update(this.V) - .update([ 0x00 ]); - if (seed) - kmac = kmac.update(seed); - this.K = kmac.digest(); - this.V = this._hmac().update(this.V).digest(); - if (!seed) - return; - - this.K = this._hmac() - .update(this.V) - .update([ 0x01 ]) - .update(seed) - .digest(); - this.V = this._hmac().update(this.V).digest(); -}; - -HmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) { - // Optional entropy enc - if (typeof entropyEnc !== 'string') { - addEnc = add; - add = entropyEnc; - entropyEnc = null; - } - - entropy = utils.toArray(entropy, entropyEnc); - add = utils.toArray(add, addEnc); - - assert(entropy.length >= (this.minEntropy / 8), - 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits'); - - this._update(entropy.concat(add || [])); - this._reseed = 1; -}; - -HmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) { - if (this._reseed > this.reseedInterval) - throw new Error('Reseed is required'); - - // Optional encoding - if (typeof enc !== 'string') { - addEnc = add; - add = enc; - enc = null; - } - - // Optional additional data - if (add) { - add = utils.toArray(add, addEnc || 'hex'); - this._update(add); - } - - var temp = []; - while (temp.length < len) { - this.V = this._hmac().update(this.V).digest(); - temp = temp.concat(this.V); - } - - var res = temp.slice(0, len); - this._update(add); - this._reseed++; - return utils.encode(res, enc); -}; - - -/***/ }), - -/***/ "./node_modules/https-browserify/index.js": -/*!************************************************!*\ - !*** ./node_modules/https-browserify/index.js ***! - \************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var http = __webpack_require__(/*! http */ "./node_modules/stream-http/index.js") -var url = __webpack_require__(/*! url */ "./node_modules/url/url.js") - -var https = module.exports - -for (var key in http) { - if (http.hasOwnProperty(key)) https[key] = http[key] -} - -https.request = function (params, cb) { - params = validateParams(params) - return http.request.call(this, params, cb) -} - -https.get = function (params, cb) { - params = validateParams(params) - return http.get.call(this, params, cb) -} - -function validateParams (params) { - if (typeof params === 'string') { - params = url.parse(params) - } - if (!params.protocol) { - params.protocol = 'https:' - } - if (params.protocol !== 'https:') { - throw new Error('Protocol "' + params.protocol + '" not supported. Expected "https:"') - } - return params -} - - -/***/ }), - -/***/ "./node_modules/hybrid-chunk-store/index.js": -/*!**************************************************!*\ - !*** ./node_modules/hybrid-chunk-store/index.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* eslint-env browser */ -const FSAccessChunkStore = __webpack_require__(/*! fs-access-chunk-store */ "./node_modules/fs-access-chunk-store/index.js") -const IDBChunkStore = __webpack_require__(/*! idb-chunk-store */ "./node_modules/idb-chunk-store/index.js") -const MemoryChunkStore = __webpack_require__(/*! memory-chunk-store */ "./node_modules/memory-chunk-store/index.js") -const CacheChunkStore = __webpack_require__(/*! cache-chunk-store */ "./node_modules/cache-chunk-store/index.js") - -const isChrome = !!window.chrome - -class HybridChunkStore { - constructor (chunkLength, opts = {}) { - this.chunkLength = Number(chunkLength) - if (!this.chunkLength) throw new Error('First argument must be a chunk length') - - this.fallbackStore = null - this.chunkCount = null - this.stores = [] - this.chunks = [] - - // this is kinda stupid, first it makes the fallback store, then the main store - // creates a store limited by targetLength, then uses memory as fallback/overflow - const _mapStore = (TargetStore, targetLenght) => { - const newOpts = opts - if (targetLenght && targetLenght < opts.length) { - this.chunkCount = Math.floor(targetLenght / this.chunkLength) - const newLenght = this.chunkCount * this.chunkLength - newOpts.length = opts.length - newLenght - // ideally this should be blob store, some1 make one pls - this.fallbackStore = new MemoryChunkStore(this.chunkLength, newOpts) - this.stores.push(this.fallbackStore) - newOpts.length = newLenght - } - const store = new CacheChunkStore(new TargetStore(this.chunkLength, newOpts), { max: opts.max || 20 }) - this.stores.push(store) - if (this.chunkCount) { - this.chunks[this.chunkCount - 1] = store - this.chunks.fill(store) - } else { - this.fallbackStore = store - } - } - - this.registration = navigator.storage.estimate().then(estimate => { - // use less than available - const remaining = estimate.quota - estimate.usage - Math.max(Number(opts.reserved) || 0, 16777216) - if ('getDirectory' in navigator.storage) { - // lets hope the user isn't stupid enough to specify a directory with barely any storage, forgive me tech support people - _mapStore(FSAccessChunkStore, !(opts.rootDir) && remaining) - } else { - // WAH. https://i.kym-cdn.com/entries/icons/original/000/027/528/519.png - _mapStore(IDBChunkStore, !(isChrome && estimate.quota === 2147483648) && remaining) - } - }) - } - - get (index, opts, cb) { - this.registration.then(() => { - if (!this.chunks[index]) { - this.fallbackStore.get(index - this.chunkCount, opts, cb) - } else { - this.chunks[index].get(index, opts, cb) - } - }) - } - - put (index, buf, cb) { - this.registration.then(() => { - if (!this.chunks[index]) { - this.fallbackStore.put(index - this.chunkCount, buf, cb) - } else { - this.chunks[index].put(index, buf, cb) - } - }) - } - - close (cb = () => {}) { - const promises = [] - for (const store of this.stores) { - promises.push(new Promise(resolve => store.close(resolve))) - } - Promise.all(promises).then(values => { - values = values.filter(value => value) - cb(values.length > 1 ? values : values[0]) - }) - } - - destroy (cb = () => {}) { - const promises = [] - for (const store of this.stores) { - promises.push(new Promise(resolve => store.destroy(resolve))) - } - Promise.all(promises).then(values => { - values = values.filter(value => value) - cb(values.length > 1 ? values : values[0]) - }) - } -} - -module.exports = HybridChunkStore - - -/***/ }), - -/***/ "./node_modules/idb-chunk-store/index.js": -/*!***********************************************!*\ - !*** ./node_modules/idb-chunk-store/index.js ***! - \***********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; - -const idb = __webpack_require__(/*! idb */ "./node_modules/idb/build/esm/index.js") - -const EventEmitter = __webpack_require__(/*! events */ "./node_modules/events/events.js").EventEmitter -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -class Storage extends EventEmitter { - constructor (chunkLength, opts) { - if (!opts) opts = {} - super() - - this.chunkLength = Number(chunkLength) - if (!this.chunkLength) throw new Error('First argument must be a chunk length') - - this.closed = false - this.destroyed = false - this.length = Number(opts.length) || Infinity - this.name = opts.name || 'idb-chunk-store' - - if (this.length !== Infinity) { - this.lastChunkLength = (this.length % this.chunkLength) || this.chunkLength - this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1 - } - - this.dbPromise = idb.openDB(this.name, undefined, { - upgrade: (db) => { - db.createObjectStore('chunks') - }, - blocking: () => { - // Fires if the database is deleted from outside this Storage object - this.close() - }, - terminated: () => { - this.closed = true - this.emit('error', new Error('Database unexpectedly closed')) - } - }) - } - - put (index, buf, cb = () => {}) { - if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed'))) - - const isLastChunk = (index === this.lastChunkIndex) - if (isLastChunk && buf.length !== this.lastChunkLength) { - return queueMicrotask(() => cb(new Error('Last chunk length must be ' + this.lastChunkLength))) - } - if (!isLastChunk && buf.length !== this.chunkLength) { - return queueMicrotask(() => cb(new Error('Chunk length must be ' + this.chunkLength))) - } - - // Zero-copy coerce Buffer to Uint8Array - buf = new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength) - - // If the backing buffer is larger, copy out only the relevant slice - // so extra data doesn't get saved to indexeddb - if (buf.byteOffset !== 0 || buf.byteLength !== buf.buffer.byteLength) { - buf = buf.slice() - } - - ;(async () => { - try { - const db = await this.dbPromise - await db.put('chunks', buf, index) - } catch (err) { - cb(err) - return - } - - cb(null) - })() - } - - get (index, opts, cb = () => {}) { - if (typeof opts === 'function') return this.get(index, {}, opts) - if (!opts) opts = {} - if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed'))) - - ;(async () => { - let rawResult - try { - const db = await this.dbPromise - rawResult = await db.get('chunks', index) - } catch (err) { - cb(err) - return - } - - // rawResult should be undefined if the chunk is not found, - // but some old browsers occasionally return null - if (rawResult == null) { - const err = new Error('Chunk not found') - err.notFound = true - cb(err) - return - } - - let buf = Buffer.from(rawResult.buffer, rawResult.byteOffset, rawResult.byteLength) - - const offset = opts.offset || 0 - const len = opts.length || (buf.length - offset) - - if (offset !== 0 || len !== buf.length) { - buf = buf.slice(offset, len + offset) - } - - cb(null, buf) - })() - } - - close (cb = () => {}) { - if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed'))) - this.closed = true - - ;(async () => { - try { - const db = await this.dbPromise - db.close() - } catch (err) { - cb(err) - return - } - - cb(null) - })() - } - - destroy (cb = () => {}) { - if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed'))) - if (this.destroyed) return queueMicrotask(() => cb(new Error('Storage is destroyed'))) - this.destroyed = true - - this.close(async (err) => { - if (err) { - cb(err) - return - } - - try { - await idb.deleteDB(this.name) - } catch (err) { - cb(err) - return - } - - cb(null) - }) - } -} -module.exports = Storage - - -/***/ }), - -/***/ "./node_modules/idb-keyval/dist/esm/index.js": -/*!***************************************************!*\ - !*** ./node_modules/idb-keyval/dist/esm/index.js ***! - \***************************************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "clear": () => (/* binding */ clear), -/* harmony export */ "createStore": () => (/* binding */ createStore), -/* harmony export */ "del": () => (/* binding */ del), -/* harmony export */ "entries": () => (/* binding */ entries), -/* harmony export */ "get": () => (/* binding */ get), -/* harmony export */ "getMany": () => (/* binding */ getMany), -/* harmony export */ "keys": () => (/* binding */ keys), -/* harmony export */ "promisifyRequest": () => (/* binding */ promisifyRequest), -/* harmony export */ "set": () => (/* binding */ set), -/* harmony export */ "setMany": () => (/* binding */ setMany), -/* harmony export */ "update": () => (/* binding */ update), -/* harmony export */ "values": () => (/* binding */ values) -/* harmony export */ }); -/* harmony import */ var safari_14_idb_fix__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! safari-14-idb-fix */ "./node_modules/safari-14-idb-fix/dist/esm/index.js"); - - -function promisifyRequest(request) { - return new Promise((resolve, reject) => { - // @ts-ignore - file size hacks - request.oncomplete = request.onsuccess = () => resolve(request.result); - // @ts-ignore - file size hacks - request.onabort = request.onerror = () => reject(request.error); - }); -} -function createStore(dbName, storeName) { - const dbp = (0,safari_14_idb_fix__WEBPACK_IMPORTED_MODULE_0__.default)().then(() => { - const request = indexedDB.open(dbName); - request.onupgradeneeded = () => request.result.createObjectStore(storeName); - return promisifyRequest(request); - }); - return (txMode, callback) => dbp.then((db) => callback(db.transaction(storeName, txMode).objectStore(storeName))); -} -let defaultGetStoreFunc; -function defaultGetStore() { - if (!defaultGetStoreFunc) { - defaultGetStoreFunc = createStore('keyval-store', 'keyval'); - } - return defaultGetStoreFunc; -} -/** - * Get a value by its key. - * - * @param key - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function get(key, customStore = defaultGetStore()) { - return customStore('readonly', (store) => promisifyRequest(store.get(key))); -} -/** - * Set a value with a key. - * - * @param key - * @param value - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function set(key, value, customStore = defaultGetStore()) { - return customStore('readwrite', (store) => { - store.put(value, key); - return promisifyRequest(store.transaction); - }); -} -/** - * Set multiple values at once. This is faster than calling set() multiple times. - * It's also atomic – if one of the pairs can't be added, none will be added. - * - * @param entries Array of entries, where each entry is an array of `[key, value]`. - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function setMany(entries, customStore = defaultGetStore()) { - return customStore('readwrite', (store) => { - entries.forEach((entry) => store.put(entry[1], entry[0])); - return promisifyRequest(store.transaction); - }); -} -/** - * Get multiple values by their keys - * - * @param keys - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function getMany(keys, customStore = defaultGetStore()) { - return customStore('readonly', (store) => Promise.all(keys.map((key) => promisifyRequest(store.get(key))))); -} -/** - * Update a value. This lets you see the old value and update it as an atomic operation. - * - * @param key - * @param updater A callback that takes the old value and returns a new value. - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function update(key, updater, customStore = defaultGetStore()) { - return customStore('readwrite', (store) => - // Need to create the promise manually. - // If I try to chain promises, the transaction closes in browsers - // that use a promise polyfill (IE10/11). - new Promise((resolve, reject) => { - store.get(key).onsuccess = function () { - try { - store.put(updater(this.result), key); - resolve(promisifyRequest(store.transaction)); - } - catch (err) { - reject(err); - } - }; - })); -} -/** - * Delete a particular key from the store. - * - * @param key - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function del(key, customStore = defaultGetStore()) { - return customStore('readwrite', (store) => { - store.delete(key); - return promisifyRequest(store.transaction); - }); -} -/** - * Clear all values in the store. - * - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function clear(customStore = defaultGetStore()) { - return customStore('readwrite', (store) => { - store.clear(); - return promisifyRequest(store.transaction); - }); -} -function eachCursor(customStore, callback) { - return customStore('readonly', (store) => { - // This would be store.getAllKeys(), but it isn't supported by Edge or Safari. - // And openKeyCursor isn't supported by Safari. - store.openCursor().onsuccess = function () { - if (!this.result) - return; - callback(this.result); - this.result.continue(); - }; - return promisifyRequest(store.transaction); - }); -} -/** - * Get all keys in the store. - * - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function keys(customStore = defaultGetStore()) { - const items = []; - return eachCursor(customStore, (cursor) => items.push(cursor.key)).then(() => items); -} -/** - * Get all values in the store. - * - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function values(customStore = defaultGetStore()) { - const items = []; - return eachCursor(customStore, (cursor) => items.push(cursor.value)).then(() => items); -} -/** - * Get all entries in the store. Each entry is an array of `[key, value]`. - * - * @param customStore Method to get a custom store. Use with caution (see the docs). - */ -function entries(customStore = defaultGetStore()) { - const items = []; - return eachCursor(customStore, (cursor) => items.push([cursor.key, cursor.value])).then(() => items); -} - - - - -/***/ }), - -/***/ "./node_modules/idb/build/esm/index.js": -/*!*********************************************!*\ - !*** ./node_modules/idb/build/esm/index.js ***! - \*********************************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "unwrap": () => (/* reexport safe */ _wrap_idb_value_js__WEBPACK_IMPORTED_MODULE_0__.u), -/* harmony export */ "wrap": () => (/* reexport safe */ _wrap_idb_value_js__WEBPACK_IMPORTED_MODULE_0__.w), -/* harmony export */ "deleteDB": () => (/* binding */ deleteDB), -/* harmony export */ "openDB": () => (/* binding */ openDB) -/* harmony export */ }); -/* harmony import */ var _wrap_idb_value_js__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ./wrap-idb-value.js */ "./node_modules/idb/build/esm/wrap-idb-value.js"); - - - -/** - * Open a database. - * - * @param name Name of the database. - * @param version Schema version. - * @param callbacks Additional callbacks. - */ -function openDB(name, version, { blocked, upgrade, blocking, terminated } = {}) { - const request = indexedDB.open(name, version); - const openPromise = (0,_wrap_idb_value_js__WEBPACK_IMPORTED_MODULE_0__.w)(request); - if (upgrade) { - request.addEventListener('upgradeneeded', (event) => { - upgrade((0,_wrap_idb_value_js__WEBPACK_IMPORTED_MODULE_0__.w)(request.result), event.oldVersion, event.newVersion, (0,_wrap_idb_value_js__WEBPACK_IMPORTED_MODULE_0__.w)(request.transaction)); - }); - } - if (blocked) - request.addEventListener('blocked', () => blocked()); - openPromise - .then((db) => { - if (terminated) - db.addEventListener('close', () => terminated()); - if (blocking) - db.addEventListener('versionchange', () => blocking()); - }) - .catch(() => { }); - return openPromise; -} -/** - * Delete a database. - * - * @param name Name of the database. - */ -function deleteDB(name, { blocked } = {}) { - const request = indexedDB.deleteDatabase(name); - if (blocked) - request.addEventListener('blocked', () => blocked()); - return (0,_wrap_idb_value_js__WEBPACK_IMPORTED_MODULE_0__.w)(request).then(() => undefined); -} - -const readMethods = ['get', 'getKey', 'getAll', 'getAllKeys', 'count']; -const writeMethods = ['put', 'add', 'delete', 'clear']; -const cachedMethods = new Map(); -function getMethod(target, prop) { - if (!(target instanceof IDBDatabase && - !(prop in target) && - typeof prop === 'string')) { - return; - } - if (cachedMethods.get(prop)) - return cachedMethods.get(prop); - const targetFuncName = prop.replace(/FromIndex$/, ''); - const useIndex = prop !== targetFuncName; - const isWrite = writeMethods.includes(targetFuncName); - if ( - // Bail if the target doesn't exist on the target. Eg, getAll isn't in Edge. - !(targetFuncName in (useIndex ? IDBIndex : IDBObjectStore).prototype) || - !(isWrite || readMethods.includes(targetFuncName))) { - return; - } - const method = async function (storeName, ...args) { - // isWrite ? 'readwrite' : undefined gzipps better, but fails in Edge :( - const tx = this.transaction(storeName, isWrite ? 'readwrite' : 'readonly'); - let target = tx.store; - if (useIndex) - target = target.index(args.shift()); - // Must reject if op rejects. - // If it's a write operation, must reject if tx.done rejects. - // Must reject with op rejection first. - // Must resolve with op value. - // Must handle both promises (no unhandled rejections) - return (await Promise.all([ - target[targetFuncName](...args), - isWrite && tx.done, - ]))[0]; - }; - cachedMethods.set(prop, method); - return method; -} -(0,_wrap_idb_value_js__WEBPACK_IMPORTED_MODULE_0__.r)((oldTraps) => ({ - ...oldTraps, - get: (target, prop, receiver) => getMethod(target, prop) || oldTraps.get(target, prop, receiver), - has: (target, prop) => !!getMethod(target, prop) || oldTraps.has(target, prop), -})); - - - - -/***/ }), - -/***/ "./node_modules/idb/build/esm/wrap-idb-value.js": -/*!******************************************************!*\ - !*** ./node_modules/idb/build/esm/wrap-idb-value.js ***! - \******************************************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "a": () => (/* binding */ reverseTransformCache), -/* harmony export */ "i": () => (/* binding */ instanceOfAny), -/* harmony export */ "r": () => (/* binding */ replaceTraps), -/* harmony export */ "u": () => (/* binding */ unwrap), -/* harmony export */ "w": () => (/* binding */ wrap) -/* harmony export */ }); -const instanceOfAny = (object, constructors) => constructors.some((c) => object instanceof c); - -let idbProxyableTypes; -let cursorAdvanceMethods; -// This is a function to prevent it throwing up in node environments. -function getIdbProxyableTypes() { - return (idbProxyableTypes || - (idbProxyableTypes = [ - IDBDatabase, - IDBObjectStore, - IDBIndex, - IDBCursor, - IDBTransaction, - ])); -} -// This is a function to prevent it throwing up in node environments. -function getCursorAdvanceMethods() { - return (cursorAdvanceMethods || - (cursorAdvanceMethods = [ - IDBCursor.prototype.advance, - IDBCursor.prototype.continue, - IDBCursor.prototype.continuePrimaryKey, - ])); -} -const cursorRequestMap = new WeakMap(); -const transactionDoneMap = new WeakMap(); -const transactionStoreNamesMap = new WeakMap(); -const transformCache = new WeakMap(); -const reverseTransformCache = new WeakMap(); -function promisifyRequest(request) { - const promise = new Promise((resolve, reject) => { - const unlisten = () => { - request.removeEventListener('success', success); - request.removeEventListener('error', error); - }; - const success = () => { - resolve(wrap(request.result)); - unlisten(); - }; - const error = () => { - reject(request.error); - unlisten(); - }; - request.addEventListener('success', success); - request.addEventListener('error', error); - }); - promise - .then((value) => { - // Since cursoring reuses the IDBRequest (*sigh*), we cache it for later retrieval - // (see wrapFunction). - if (value instanceof IDBCursor) { - cursorRequestMap.set(value, request); - } - // Catching to avoid "Uncaught Promise exceptions" - }) - .catch(() => { }); - // This mapping exists in reverseTransformCache but doesn't doesn't exist in transformCache. This - // is because we create many promises from a single IDBRequest. - reverseTransformCache.set(promise, request); - return promise; -} -function cacheDonePromiseForTransaction(tx) { - // Early bail if we've already created a done promise for this transaction. - if (transactionDoneMap.has(tx)) - return; - const done = new Promise((resolve, reject) => { - const unlisten = () => { - tx.removeEventListener('complete', complete); - tx.removeEventListener('error', error); - tx.removeEventListener('abort', error); - }; - const complete = () => { - resolve(); - unlisten(); - }; - const error = () => { - reject(tx.error || new DOMException('AbortError', 'AbortError')); - unlisten(); - }; - tx.addEventListener('complete', complete); - tx.addEventListener('error', error); - tx.addEventListener('abort', error); - }); - // Cache it for later retrieval. - transactionDoneMap.set(tx, done); -} -let idbProxyTraps = { - get(target, prop, receiver) { - if (target instanceof IDBTransaction) { - // Special handling for transaction.done. - if (prop === 'done') - return transactionDoneMap.get(target); - // Polyfill for objectStoreNames because of Edge. - if (prop === 'objectStoreNames') { - return target.objectStoreNames || transactionStoreNamesMap.get(target); - } - // Make tx.store return the only store in the transaction, or undefined if there are many. - if (prop === 'store') { - return receiver.objectStoreNames[1] - ? undefined - : receiver.objectStore(receiver.objectStoreNames[0]); - } - } - // Else transform whatever we get back. - return wrap(target[prop]); - }, - set(target, prop, value) { - target[prop] = value; - return true; - }, - has(target, prop) { - if (target instanceof IDBTransaction && - (prop === 'done' || prop === 'store')) { - return true; - } - return prop in target; - }, -}; -function replaceTraps(callback) { - idbProxyTraps = callback(idbProxyTraps); -} -function wrapFunction(func) { - // Due to expected object equality (which is enforced by the caching in `wrap`), we - // only create one new func per func. - // Edge doesn't support objectStoreNames (booo), so we polyfill it here. - if (func === IDBDatabase.prototype.transaction && - !('objectStoreNames' in IDBTransaction.prototype)) { - return function (storeNames, ...args) { - const tx = func.call(unwrap(this), storeNames, ...args); - transactionStoreNamesMap.set(tx, storeNames.sort ? storeNames.sort() : [storeNames]); - return wrap(tx); - }; - } - // Cursor methods are special, as the behaviour is a little more different to standard IDB. In - // IDB, you advance the cursor and wait for a new 'success' on the IDBRequest that gave you the - // cursor. It's kinda like a promise that can resolve with many values. That doesn't make sense - // with real promises, so each advance methods returns a new promise for the cursor object, or - // undefined if the end of the cursor has been reached. - if (getCursorAdvanceMethods().includes(func)) { - return function (...args) { - // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use - // the original object. - func.apply(unwrap(this), args); - return wrap(cursorRequestMap.get(this)); - }; - } - return function (...args) { - // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use - // the original object. - return wrap(func.apply(unwrap(this), args)); - }; -} -function transformCachableValue(value) { - if (typeof value === 'function') - return wrapFunction(value); - // This doesn't return, it just creates a 'done' promise for the transaction, - // which is later returned for transaction.done (see idbObjectHandler). - if (value instanceof IDBTransaction) - cacheDonePromiseForTransaction(value); - if (instanceOfAny(value, getIdbProxyableTypes())) - return new Proxy(value, idbProxyTraps); - // Return the same value back if we're not going to transform it. - return value; -} -function wrap(value) { - // We sometimes generate multiple promises from a single IDBRequest (eg when cursoring), because - // IDB is weird and a single IDBRequest can yield many responses, so these can't be cached. - if (value instanceof IDBRequest) - return promisifyRequest(value); - // If we've already transformed this value before, reuse the transformed value. - // This is faster, but it also provides object equality. - if (transformCache.has(value)) - return transformCache.get(value); - const newValue = transformCachableValue(value); - // Not all types are transformed. - // These may be primitive types, so they can't be WeakMap keys. - if (newValue !== value) { - transformCache.set(value, newValue); - reverseTransformCache.set(newValue, value); - } - return newValue; -} -const unwrap = (value) => reverseTransformCache.get(value); - - - - -/***/ }), - -/***/ "./node_modules/ieee754/index.js": -/*!***************************************!*\ - !*** ./node_modules/ieee754/index.js ***! - \***************************************/ -/***/ ((__unused_webpack_module, exports) => { - -/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh */ -exports.read = function (buffer, offset, isLE, mLen, nBytes) { - var e, m - var eLen = (nBytes * 8) - mLen - 1 - var eMax = (1 << eLen) - 1 - var eBias = eMax >> 1 - var nBits = -7 - var i = isLE ? (nBytes - 1) : 0 - var d = isLE ? -1 : 1 - var s = buffer[offset + i] - - i += d - - e = s & ((1 << (-nBits)) - 1) - s >>= (-nBits) - nBits += eLen - for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {} - - m = e & ((1 << (-nBits)) - 1) - e >>= (-nBits) - nBits += mLen - for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {} - - if (e === 0) { - e = 1 - eBias - } else if (e === eMax) { - return m ? NaN : ((s ? -1 : 1) * Infinity) - } else { - m = m + Math.pow(2, mLen) - e = e - eBias - } - return (s ? -1 : 1) * m * Math.pow(2, e - mLen) -} - -exports.write = function (buffer, value, offset, isLE, mLen, nBytes) { - var e, m, c - var eLen = (nBytes * 8) - mLen - 1 - var eMax = (1 << eLen) - 1 - var eBias = eMax >> 1 - var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0) - var i = isLE ? 0 : (nBytes - 1) - var d = isLE ? 1 : -1 - var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0 - - value = Math.abs(value) - - if (isNaN(value) || value === Infinity) { - m = isNaN(value) ? 1 : 0 - e = eMax - } else { - e = Math.floor(Math.log(value) / Math.LN2) - if (value * (c = Math.pow(2, -e)) < 1) { - e-- - c *= 2 - } - if (e + eBias >= 1) { - value += rt / c - } else { - value += rt * Math.pow(2, 1 - eBias) - } - if (value * c >= 2) { - e++ - c /= 2 - } - - if (e + eBias >= eMax) { - m = 0 - e = eMax - } else if (e + eBias >= 1) { - m = ((value * c) - 1) * Math.pow(2, mLen) - e = e + eBias - } else { - m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen) - e = 0 - } - } - - for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {} - - e = (e << mLen) | m - eLen += mLen - for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {} - - buffer[offset + i - d] |= s * 128 -} - - -/***/ }), - -/***/ "./node_modules/immediate-chunk-store/index.js": -/*!*****************************************************!*\ - !*** ./node_modules/immediate-chunk-store/index.js ***! - \*****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*! immediate-chunk-store. MIT License. Feross Aboukhadijeh */ -// TODO: remove when window.queueMicrotask() is well supported -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -class ImmediateStore { - constructor (store) { - this.store = store - this.chunkLength = store.chunkLength - - if (!this.store || !this.store.get || !this.store.put) { - throw new Error('First argument must be abstract-chunk-store compliant') - } - - this.mem = [] - } - - put (index, buf, cb = () => {}) { - this.mem[index] = buf - this.store.put(index, buf, err => { - this.mem[index] = null - cb(err) - }) - } - - get (index, opts, cb = () => {}) { - if (typeof opts === 'function') return this.get(index, null, opts) - - let buf = this.mem[index] - - // if the chunk isn't in the immediate memory cache - if (!buf) { - return this.store.get(index, opts, cb) - } - - if (!opts) opts = {} - - const offset = opts.offset || 0 - const len = opts.length || (buf.length - offset) - - if (offset !== 0 || len !== buf.length) { - buf = buf.slice(offset, len + offset) - } - queueMicrotask(() => cb(null, buf)) - } - - close (cb = () => {}) { - this.store.close(cb) - } - - destroy (cb = () => {}) { - this.store.destroy(cb) - } -} - -module.exports = ImmediateStore - - -/***/ }), - -/***/ "./node_modules/inherits/inherits_browser.js": -/*!***************************************************!*\ - !*** ./node_modules/inherits/inherits_browser.js ***! - \***************************************************/ -/***/ ((module) => { - -if (typeof Object.create === 'function') { - // implementation from standard node.js 'util' module - module.exports = function inherits(ctor, superCtor) { - if (superCtor) { - ctor.super_ = superCtor - ctor.prototype = Object.create(superCtor.prototype, { - constructor: { - value: ctor, - enumerable: false, - writable: true, - configurable: true - } - }) - } - }; -} else { - // old school shim for old browsers - module.exports = function inherits(ctor, superCtor) { - if (superCtor) { - ctor.super_ = superCtor - var TempCtor = function () {} - TempCtor.prototype = superCtor.prototype - ctor.prototype = new TempCtor() - ctor.prototype.constructor = ctor - } - } -} - - -/***/ }), - -/***/ "./node_modules/is-arguments/index.js": -/*!********************************************!*\ - !*** ./node_modules/is-arguments/index.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var hasToStringTag = typeof Symbol === 'function' && typeof Symbol.toStringTag === 'symbol'; -var callBound = __webpack_require__(/*! call-bind/callBound */ "./node_modules/call-bind/callBound.js"); - -var $toString = callBound('Object.prototype.toString'); - -var isStandardArguments = function isArguments(value) { - if (hasToStringTag && value && typeof value === 'object' && Symbol.toStringTag in value) { - return false; - } - return $toString(value) === '[object Arguments]'; -}; - -var isLegacyArguments = function isArguments(value) { - if (isStandardArguments(value)) { - return true; - } - return value !== null && - typeof value === 'object' && - typeof value.length === 'number' && - value.length >= 0 && - $toString(value) !== '[object Array]' && - $toString(value.callee) === '[object Function]'; -}; - -var supportsStandardArguments = (function () { - return isStandardArguments(arguments); -}()); - -isStandardArguments.isLegacyArguments = isLegacyArguments; // for tests - -module.exports = supportsStandardArguments ? isStandardArguments : isLegacyArguments; - - -/***/ }), - -/***/ "./node_modules/is-ascii/index.js": -/*!****************************************!*\ - !*** ./node_modules/is-ascii/index.js ***! - \****************************************/ -/***/ ((module) => { - -/* (c) 2016 Ari Porad (@ariporad) . License: ariporad.mit-license.org */ - -// Partially from http://stackoverflow.com/a/94049/1928484, and from another SO answer, which told me that the highest -// char code that's ascii is 127, but I can't find the link for. Sorry. - -var MAX_ASCII_CHAR_CODE = 127; - -module.exports = function isAscii(str) { - for (var i = 0, strLen = str.length; i < strLen; ++i) { - if (str.charCodeAt(i) > MAX_ASCII_CHAR_CODE) return false; - } - return true; -}; - - -/***/ }), - -/***/ "./node_modules/is-generator-function/index.js": -/*!*****************************************************!*\ - !*** ./node_modules/is-generator-function/index.js ***! - \*****************************************************/ -/***/ ((module) => { - -"use strict"; - - -var toStr = Object.prototype.toString; -var fnToStr = Function.prototype.toString; -var isFnRegex = /^\s*(?:function)?\*/; -var hasToStringTag = typeof Symbol === 'function' && typeof Symbol.toStringTag === 'symbol'; -var getProto = Object.getPrototypeOf; -var getGeneratorFunc = function () { // eslint-disable-line consistent-return - if (!hasToStringTag) { - return false; - } - try { - return Function('return function*() {}')(); - } catch (e) { - } -}; -var GeneratorFunction; - -module.exports = function isGeneratorFunction(fn) { - if (typeof fn !== 'function') { - return false; - } - if (isFnRegex.test(fnToStr.call(fn))) { - return true; - } - if (!hasToStringTag) { - var str = toStr.call(fn); - return str === '[object GeneratorFunction]'; - } - if (!getProto) { - return false; - } - if (typeof GeneratorFunction === 'undefined') { - var generatorFunc = getGeneratorFunc(); - GeneratorFunction = generatorFunc ? getProto(generatorFunc) : false; - } - return getProto(fn) === GeneratorFunction; -}; - - -/***/ }), - -/***/ "./node_modules/is-nan/implementation.js": -/*!***********************************************!*\ - !*** ./node_modules/is-nan/implementation.js ***! - \***********************************************/ -/***/ ((module) => { - -"use strict"; - - -/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */ - -module.exports = function isNaN(value) { - return value !== value; -}; - - -/***/ }), - -/***/ "./node_modules/is-nan/index.js": -/*!**************************************!*\ - !*** ./node_modules/is-nan/index.js ***! - \**************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var callBind = __webpack_require__(/*! call-bind */ "./node_modules/call-bind/index.js"); -var define = __webpack_require__(/*! define-properties */ "./node_modules/define-properties/index.js"); - -var implementation = __webpack_require__(/*! ./implementation */ "./node_modules/is-nan/implementation.js"); -var getPolyfill = __webpack_require__(/*! ./polyfill */ "./node_modules/is-nan/polyfill.js"); -var shim = __webpack_require__(/*! ./shim */ "./node_modules/is-nan/shim.js"); - -var polyfill = callBind(getPolyfill(), Number); - -/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */ - -define(polyfill, { - getPolyfill: getPolyfill, - implementation: implementation, - shim: shim -}); - -module.exports = polyfill; - - -/***/ }), - -/***/ "./node_modules/is-nan/polyfill.js": -/*!*****************************************!*\ - !*** ./node_modules/is-nan/polyfill.js ***! - \*****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var implementation = __webpack_require__(/*! ./implementation */ "./node_modules/is-nan/implementation.js"); - -module.exports = function getPolyfill() { - if (Number.isNaN && Number.isNaN(NaN) && !Number.isNaN('a')) { - return Number.isNaN; - } - return implementation; -}; - - -/***/ }), - -/***/ "./node_modules/is-nan/shim.js": -/*!*************************************!*\ - !*** ./node_modules/is-nan/shim.js ***! - \*************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var define = __webpack_require__(/*! define-properties */ "./node_modules/define-properties/index.js"); -var getPolyfill = __webpack_require__(/*! ./polyfill */ "./node_modules/is-nan/polyfill.js"); - -/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */ - -module.exports = function shimNumberIsNaN() { - var polyfill = getPolyfill(); - define(Number, { isNaN: polyfill }, { - isNaN: function testIsNaN() { - return Number.isNaN !== polyfill; - } - }); - return polyfill; -}; - - -/***/ }), - -/***/ "./node_modules/is-typed-array/index.js": -/*!**********************************************!*\ - !*** ./node_modules/is-typed-array/index.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var forEach = __webpack_require__(/*! foreach */ "./node_modules/foreach/index.js"); -var availableTypedArrays = __webpack_require__(/*! available-typed-arrays */ "./node_modules/available-typed-arrays/index.js"); -var callBound = __webpack_require__(/*! call-bind/callBound */ "./node_modules/call-bind/callBound.js"); - -var $toString = callBound('Object.prototype.toString'); -var hasSymbols = __webpack_require__(/*! has-symbols */ "./node_modules/has-symbols/index.js")(); -var hasToStringTag = hasSymbols && typeof Symbol.toStringTag === 'symbol'; - -var typedArrays = availableTypedArrays(); - -var $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) { - for (var i = 0; i < array.length; i += 1) { - if (array[i] === value) { - return i; - } - } - return -1; -}; -var $slice = callBound('String.prototype.slice'); -var toStrTags = {}; -var gOPD = __webpack_require__(/*! es-abstract/helpers/getOwnPropertyDescriptor */ "./node_modules/es-abstract/helpers/getOwnPropertyDescriptor.js"); -var getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof'); -if (hasToStringTag && gOPD && getPrototypeOf) { - forEach(typedArrays, function (typedArray) { - var arr = new __webpack_require__.g[typedArray](); - if (!(Symbol.toStringTag in arr)) { - throw new EvalError('this engine has support for Symbol.toStringTag, but ' + typedArray + ' does not have the property! Please report this.'); - } - var proto = getPrototypeOf(arr); - var descriptor = gOPD(proto, Symbol.toStringTag); - if (!descriptor) { - var superProto = getPrototypeOf(proto); - descriptor = gOPD(superProto, Symbol.toStringTag); - } - toStrTags[typedArray] = descriptor.get; - }); -} - -var tryTypedArrays = function tryAllTypedArrays(value) { - var anyTrue = false; - forEach(toStrTags, function (getter, typedArray) { - if (!anyTrue) { - try { - anyTrue = getter.call(value) === typedArray; - } catch (e) { /**/ } - } - }); - return anyTrue; -}; - -module.exports = function isTypedArray(value) { - if (!value || typeof value !== 'object') { return false; } - if (!hasToStringTag) { - var tag = $slice($toString(value), 8, -1); - return $indexOf(typedArrays, tag) > -1; - } - if (!gOPD) { return false; } - return tryTypedArrays(value); -}; - - -/***/ }), - -/***/ "./node_modules/is-typedarray/index.js": -/*!*********************************************!*\ - !*** ./node_modules/is-typedarray/index.js ***! - \*********************************************/ -/***/ ((module) => { - -module.exports = isTypedArray -isTypedArray.strict = isStrictTypedArray -isTypedArray.loose = isLooseTypedArray - -var toString = Object.prototype.toString -var names = { - '[object Int8Array]': true - , '[object Int16Array]': true - , '[object Int32Array]': true - , '[object Uint8Array]': true - , '[object Uint8ClampedArray]': true - , '[object Uint16Array]': true - , '[object Uint32Array]': true - , '[object Float32Array]': true - , '[object Float64Array]': true -} - -function isTypedArray(arr) { - return ( - isStrictTypedArray(arr) - || isLooseTypedArray(arr) - ) -} - -function isStrictTypedArray(arr) { - return ( - arr instanceof Int8Array - || arr instanceof Int16Array - || arr instanceof Int32Array - || arr instanceof Uint8Array - || arr instanceof Uint8ClampedArray - || arr instanceof Uint16Array - || arr instanceof Uint32Array - || arr instanceof Float32Array - || arr instanceof Float64Array - ) -} - -function isLooseTypedArray(arr) { - return names[toString.call(arr)] -} - - -/***/ }), - -/***/ "./node_modules/junk/index.js": -/*!************************************!*\ - !*** ./node_modules/junk/index.js ***! - \************************************/ -/***/ ((module, exports) => { - -"use strict"; - - -const blacklist = [ - // # All - '^npm-debug\\.log$', // Error log for npm - '^\\..*\\.swp$', // Swap file for vim state - - // # macOS - '^\\.DS_Store$', // Stores custom folder attributes - '^\\.AppleDouble$', // Stores additional file resources - '^\\.LSOverride$', // Contains the absolute path to the app to be used - '^Icon\\r$', // Custom Finder icon: http://superuser.com/questions/298785/icon-file-on-os-x-desktop - '^\\._.*', // Thumbnail - '^\\.Spotlight-V100(?:$|\\/)', // Directory that might appear on external disk - '\\.Trashes', // File that might appear on external disk - '^__MACOSX$', // Resource fork - - // # Linux - '~$', // Backup file - - // # Windows - '^Thumbs\\.db$', // Image file cache - '^ehthumbs\\.db$', // Folder config file - '^Desktop\\.ini$', // Stores custom folder attributes - '@eaDir$' // Synology Diskstation "hidden" folder where the server stores thumbnails -]; - -exports.re = () => { - throw new Error('`junk.re` was renamed to `junk.regex`'); -}; - -exports.regex = new RegExp(blacklist.join('|')); - -exports.is = filename => exports.regex.test(filename); - -exports.not = filename => !exports.is(filename); - -// TODO: Remove this for the next major release -exports.default = module.exports; - - -/***/ }), - -/***/ "./node_modules/limiter/index.js": -/*!***************************************!*\ - !*** ./node_modules/limiter/index.js ***! - \***************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - - -exports.RateLimiter = __webpack_require__(/*! ./lib/rateLimiter */ "./node_modules/limiter/lib/rateLimiter.js"); -exports.TokenBucket = __webpack_require__(/*! ./lib/tokenBucket */ "./node_modules/limiter/lib/tokenBucket.js"); - - -/***/ }), - -/***/ "./node_modules/limiter/lib/clock.js": -/*!*******************************************!*\ - !*** ./node_modules/limiter/lib/clock.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -var getMilliseconds = function() { - if (typeof process !== 'undefined' && process.hrtime) { - var hrtime = process.hrtime(); - var seconds = hrtime[0]; - var nanoseconds = hrtime[1]; - - return seconds * 1e3 + Math.floor(nanoseconds / 1e6); - } - - return new Date().getTime(); -} - -module.exports = getMilliseconds; - - -/***/ }), - -/***/ "./node_modules/limiter/lib/rateLimiter.js": -/*!*************************************************!*\ - !*** ./node_modules/limiter/lib/rateLimiter.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -var TokenBucket = __webpack_require__(/*! ./tokenBucket */ "./node_modules/limiter/lib/tokenBucket.js"); -var getMilliseconds = __webpack_require__(/*! ./clock */ "./node_modules/limiter/lib/clock.js"); - -/** - * A generic rate limiter. Underneath the hood, this uses a token bucket plus - * an additional check to limit how many tokens we can remove each interval. - * @author John Hurliman - * - * @param {Number} tokensPerInterval Maximum number of tokens that can be - * removed at any given moment and over the course of one interval. - * @param {String|Number} interval The interval length in milliseconds, or as - * one of the following strings: 'second', 'minute', 'hour', day'. - * @param {Boolean} fireImmediately Optional. Whether or not the callback - * will fire immediately when rate limiting is in effect (default is false). - */ -var RateLimiter = function(tokensPerInterval, interval, fireImmediately) { - this.tokenBucket = new TokenBucket(tokensPerInterval, tokensPerInterval, - interval, null); - - // Fill the token bucket to start - this.tokenBucket.content = tokensPerInterval; - - this.curIntervalStart = getMilliseconds(); - this.tokensThisInterval = 0; - this.fireImmediately = fireImmediately; -}; - -RateLimiter.prototype = { - tokenBucket: null, - curIntervalStart: 0, - tokensThisInterval: 0, - fireImmediately: false, - - /** - * Remove the requested number of tokens and fire the given callback. If the - * rate limiter contains enough tokens and we haven't spent too many tokens - * in this interval already, this will happen immediately. Otherwise, the - * removal and callback will happen when enough tokens become available. - * @param {Number} count The number of tokens to remove. - * @param {Function} callback(err, remainingTokens) - * @returns {Boolean} True if the callback was fired immediately, otherwise - * false. - */ - removeTokens: function(count, callback) { - // Make sure the request isn't for more than we can handle - if (count > this.tokenBucket.bucketSize) { - process.nextTick(callback.bind(null, 'Requested tokens ' + count + - ' exceeds maximum tokens per interval ' + this.tokenBucket.bucketSize, - null)); - return false; - } - - var self = this; - var now = getMilliseconds(); - - // Advance the current interval and reset the current interval token count - // if needed - if (now < this.curIntervalStart - || now - this.curIntervalStart >= this.tokenBucket.interval) { - this.curIntervalStart = now; - this.tokensThisInterval = 0; - } - - // If we don't have enough tokens left in this interval, wait until the - // next interval - if (count > this.tokenBucket.tokensPerInterval - this.tokensThisInterval) { - if (this.fireImmediately) { - process.nextTick(callback.bind(null, null, -1)); - } else { - var waitInterval = Math.ceil( - this.curIntervalStart + this.tokenBucket.interval - now); - - setTimeout(function() { - self.tokenBucket.removeTokens(count, afterTokensRemoved); - }, waitInterval); - } - return false; - } - - // Remove the requested number of tokens from the token bucket - return this.tokenBucket.removeTokens(count, afterTokensRemoved); - - function afterTokensRemoved(err, tokensRemaining) { - if (err) return callback(err, null); - - self.tokensThisInterval += count; - callback(null, tokensRemaining); - } - }, - - /** - * Attempt to remove the requested number of tokens and return immediately. - * If the bucket (and any parent buckets) contains enough tokens and we - * haven't spent too many tokens in this interval already, this will return - * true. Otherwise, false is returned. - * @param {Number} count The number of tokens to remove. - * @param {Boolean} True if the tokens were successfully removed, otherwise - * false. - */ - tryRemoveTokens: function(count) { - // Make sure the request isn't for more than we can handle - if (count > this.tokenBucket.bucketSize) - return false; - - var now = getMilliseconds(); - - // Advance the current interval and reset the current interval token count - // if needed - if (now < this.curIntervalStart - || now - this.curIntervalStart >= this.tokenBucket.interval) { - this.curIntervalStart = now; - this.tokensThisInterval = 0; - } - - // If we don't have enough tokens left in this interval, return false - if (count > this.tokenBucket.tokensPerInterval - this.tokensThisInterval) - return false; - - // Try to remove the requested number of tokens from the token bucket - var removed = this.tokenBucket.tryRemoveTokens(count); - if (removed) { - this.tokensThisInterval += count; - } - return removed; - }, - - /** - * Returns the number of tokens remaining in the TokenBucket. - * @returns {Number} The number of tokens remaining. - */ - getTokensRemaining: function () { - this.tokenBucket.drip(); - return this.tokenBucket.content; - } -}; - -module.exports = RateLimiter; - - -/***/ }), - -/***/ "./node_modules/limiter/lib/tokenBucket.js": -/*!*************************************************!*\ - !*** ./node_modules/limiter/lib/tokenBucket.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); - -/** - * A hierarchical token bucket for rate limiting. See - * http://en.wikipedia.org/wiki/Token_bucket for more information. - * @author John Hurliman - * - * @param {Number} bucketSize Maximum number of tokens to hold in the bucket. - * Also known as the burst rate. - * @param {Number} tokensPerInterval Number of tokens to drip into the bucket - * over the course of one interval. - * @param {String|Number} interval The interval length in milliseconds, or as - * one of the following strings: 'second', 'minute', 'hour', day'. - * @param {TokenBucket} parentBucket Optional. A token bucket that will act as - * the parent of this bucket. - */ -var TokenBucket = function(bucketSize, tokensPerInterval, interval, parentBucket) { - this.bucketSize = bucketSize; - this.tokensPerInterval = tokensPerInterval; - - if (typeof interval === 'string') { - switch (interval) { - case 'sec': case 'second': - this.interval = 1000; break; - case 'min': case 'minute': - this.interval = 1000 * 60; break; - case 'hr': case 'hour': - this.interval = 1000 * 60 * 60; break; - case 'day': - this.interval = 1000 * 60 * 60 * 24; break; - default: - throw new Error('Invaid interval ' + interval); - } - } else { - this.interval = interval; - } - - this.parentBucket = parentBucket; - this.content = 0; - this.lastDrip = +new Date(); -}; - -TokenBucket.prototype = { - bucketSize: 1, - tokensPerInterval: 1, - interval: 1000, - parentBucket: null, - content: 0, - lastDrip: 0, - - /** - * Remove the requested number of tokens and fire the given callback. If the - * bucket (and any parent buckets) contains enough tokens this will happen - * immediately. Otherwise, the removal and callback will happen when enough - * tokens become available. - * @param {Number} count The number of tokens to remove. - * @param {Function} callback(err, remainingTokens) - * @returns {Boolean} True if the callback was fired immediately, otherwise - * false. - */ - removeTokens: function(count, callback) { - var self = this; - - // Is this an infinite size bucket? - if (!this.bucketSize) { - process.nextTick(callback.bind(null, null, count, Number.POSITIVE_INFINITY)); - return true; - } - - // Make sure the bucket can hold the requested number of tokens - if (count > this.bucketSize) { - process.nextTick(callback.bind(null, 'Requested tokens ' + count + ' exceeds bucket size ' + - this.bucketSize, null)); - return false; - } - - // Drip new tokens into this bucket - this.drip(); - - // If we don't have enough tokens in this bucket, come back later - if (count > this.content) - return comeBackLater(); - - if (this.parentBucket) { - // Remove the requested from the parent bucket first - return this.parentBucket.removeTokens(count, function(err, remainingTokens) { - if (err) return callback(err, null); - - // Check that we still have enough tokens in this bucket - if (count > self.content) - return comeBackLater(); - - // Tokens were removed from the parent bucket, now remove them from - // this bucket and fire the callback. Note that we look at the current - // bucket and parent bucket's remaining tokens and return the smaller - // of the two values - self.content -= count; - callback(null, Math.min(remainingTokens, self.content)); - }); - } else { - // Remove the requested tokens from this bucket and fire the callback - this.content -= count; - process.nextTick(callback.bind(null, null, this.content)); - return true; - } - - function comeBackLater() { - // How long do we need to wait to make up the difference in tokens? - var waitInterval = Math.ceil( - (count - self.content) * (self.interval / self.tokensPerInterval)); - setTimeout(function() { self.removeTokens(count, callback); }, waitInterval); - return false; - } - }, - - /** - * Attempt to remove the requested number of tokens and return immediately. - * If the bucket (and any parent buckets) contains enough tokens this will - * return true, otherwise false is returned. - * @param {Number} count The number of tokens to remove. - * @param {Boolean} True if the tokens were successfully removed, otherwise - * false. - */ - tryRemoveTokens: function(count) { - // Is this an infinite size bucket? - if (!this.bucketSize) - return true; - - // Make sure the bucket can hold the requested number of tokens - if (count > this.bucketSize) - return false; - - // Drip new tokens into this bucket - this.drip(); - - // If we don't have enough tokens in this bucket, return false - if (count > this.content) - return false; - - // Try to remove the requested tokens from the parent bucket - if (this.parentBucket && !this.parentBucket.tryRemoveTokens(count)) - return false; - - // Remove the requested tokens from this bucket and return - this.content -= count; - return true; - }, - - /** - * Add any new tokens to the bucket since the last drip. - * @returns {Boolean} True if new tokens were added, otherwise false. - */ - drip: function() { - if (!this.tokensPerInterval) { - this.content = this.bucketSize; - return; - } - - var now = +new Date(); - var deltaMS = Math.max(now - this.lastDrip, 0); - this.lastDrip = now; - - var dripAmount = deltaMS * (this.tokensPerInterval / this.interval); - this.content = Math.min(this.content + dripAmount, this.bucketSize); - } -}; - -module.exports = TokenBucket; - - -/***/ }), - -/***/ "./node_modules/lru/index.js": -/*!***********************************!*\ - !*** ./node_modules/lru/index.js ***! - \***********************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var events = __webpack_require__(/*! events */ "./node_modules/events/events.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") - -module.exports = LRU - -function LRU (opts) { - if (!(this instanceof LRU)) return new LRU(opts) - if (typeof opts === 'number') opts = {max: opts} - if (!opts) opts = {} - events.EventEmitter.call(this) - this.cache = {} - this.head = this.tail = null - this.length = 0 - this.max = opts.max || 1000 - this.maxAge = opts.maxAge || 0 -} - -inherits(LRU, events.EventEmitter) - -Object.defineProperty(LRU.prototype, 'keys', { - get: function () { return Object.keys(this.cache) } -}) - -LRU.prototype.clear = function () { - this.cache = {} - this.head = this.tail = null - this.length = 0 -} - -LRU.prototype.remove = function (key) { - if (typeof key !== 'string') key = '' + key - if (!this.cache.hasOwnProperty(key)) return - - var element = this.cache[key] - delete this.cache[key] - this._unlink(key, element.prev, element.next) - return element.value -} - -LRU.prototype._unlink = function (key, prev, next) { - this.length-- - - if (this.length === 0) { - this.head = this.tail = null - } else { - if (this.head === key) { - this.head = prev - this.cache[this.head].next = null - } else if (this.tail === key) { - this.tail = next - this.cache[this.tail].prev = null - } else { - this.cache[prev].next = next - this.cache[next].prev = prev - } - } -} - -LRU.prototype.peek = function (key) { - if (!this.cache.hasOwnProperty(key)) return - - var element = this.cache[key] - - if (!this._checkAge(key, element)) return - return element.value -} - -LRU.prototype.set = function (key, value) { - if (typeof key !== 'string') key = '' + key - - var element - - if (this.cache.hasOwnProperty(key)) { - element = this.cache[key] - element.value = value - if (this.maxAge) element.modified = Date.now() - - // If it's already the head, there's nothing more to do: - if (key === this.head) return value - this._unlink(key, element.prev, element.next) - } else { - element = {value: value, modified: 0, next: null, prev: null} - if (this.maxAge) element.modified = Date.now() - this.cache[key] = element - - // Eviction is only possible if the key didn't already exist: - if (this.length === this.max) this.evict() - } - - this.length++ - element.next = null - element.prev = this.head - - if (this.head) this.cache[this.head].next = key - this.head = key - - if (!this.tail) this.tail = key - return value -} - -LRU.prototype._checkAge = function (key, element) { - if (this.maxAge && (Date.now() - element.modified) > this.maxAge) { - this.remove(key) - this.emit('evict', {key: key, value: element.value}) - return false - } - return true -} - -LRU.prototype.get = function (key) { - if (typeof key !== 'string') key = '' + key - if (!this.cache.hasOwnProperty(key)) return - - var element = this.cache[key] - - if (!this._checkAge(key, element)) return - - if (this.head !== key) { - if (key === this.tail) { - this.tail = element.next - this.cache[this.tail].prev = null - } else { - // Set prev.next -> element.next: - this.cache[element.prev].next = element.next - } - - // Set element.next.prev -> element.prev: - this.cache[element.next].prev = element.prev - - // Element is the new head - this.cache[this.head].next = key - element.prev = this.head - element.next = null - this.head = key - } - - return element.value -} - -LRU.prototype.evict = function () { - if (!this.tail) return - var key = this.tail - var value = this.remove(this.tail) - this.emit('evict', {key: key, value: value}) -} - - -/***/ }), - -/***/ "./node_modules/lt_donthave/index.js": -/*!*******************************************!*\ - !*** ./node_modules/lt_donthave/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! lt_donthave. MIT License. WebTorrent LLC */ -const arrayRemove = __webpack_require__(/*! unordered-array-remove */ "./node_modules/unordered-array-remove/index.js") -const { EventEmitter } = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('lt_donthave') - -module.exports = () => { - class ltDontHave extends EventEmitter { - constructor (wire) { - super() - - this._peerSupports = false - this._wire = wire - } - - onExtendedHandshake () { - this._peerSupports = true - } - - onMessage (buf) { - let index - try { - index = buf.readUInt32BE() - } catch (err) { - // drop invalid messages - return - } - - if (!this._wire.peerPieces.get(index)) return - debug('got donthave %d', index) - this._wire.peerPieces.set(index, false) - - this.emit('donthave', index) - this._failRequests(index) - } - - donthave (index) { - if (!this._peerSupports) return - - debug('donthave %d', index) - const buf = Buffer.alloc(4) - buf.writeUInt32BE(index) - - this._wire.extended('lt_donthave', buf) - } - - _failRequests (index) { - const requests = this._wire.requests - for (let i = 0; i < requests.length; i++) { - const req = requests[i] - if (req.piece === index) { - arrayRemove(requests, i) - i -= 1 // Check the new value at the same slot - this._wire._callback(req, new Error('peer sent donthave'), null) - } - } - } - } - - // Name of the bittorrent-protocol extension - ltDontHave.prototype.name = 'lt_donthave' - - return ltDontHave -} - - -/***/ }), - -/***/ "./node_modules/magnet-uri/index.js": -/*!******************************************!*\ - !*** ./node_modules/magnet-uri/index.js ***! - \******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! magnet-uri. MIT License. WebTorrent LLC */ -module.exports = magnetURIDecode -module.exports.decode = magnetURIDecode -module.exports.encode = magnetURIEncode - -const base32 = __webpack_require__(/*! thirty-two */ "./node_modules/thirty-two/lib/thirty-two/index.js") -const bep53Range = __webpack_require__(/*! bep53-range */ "./node_modules/bep53-range/index.js") - -/** - * Parse a magnet URI and return an object of keys/values - * - * @param {string} uri - * @return {Object} parsed uri - */ -function magnetURIDecode (uri) { - const result = {} - - // Support 'magnet:' and 'stream-magnet:' uris - const data = uri.split('magnet:?')[1] - - const params = (data && data.length >= 0) - ? data.split('&') - : [] - - params.forEach(param => { - const keyval = param.split('=') - - // This keyval is invalid, skip it - if (keyval.length !== 2) return - - const key = keyval[0] - let val = keyval[1] - - // Clean up torrent name - if (key === 'dn') val = decodeURIComponent(val).replace(/\+/g, ' ') - - // Address tracker (tr), exact source (xs), and acceptable source (as) are encoded - // URIs, so decode them - if (key === 'tr' || key === 'xs' || key === 'as' || key === 'ws') { - val = decodeURIComponent(val) - } - - // Return keywords as an array - if (key === 'kt') val = decodeURIComponent(val).split('+') - - // Cast file index (ix) to a number - if (key === 'ix') val = Number(val) - - // bep53 - if (key === 'so') val = bep53Range.parse(decodeURIComponent(val).split(',')) - - // If there are repeated parameters, return an array of values - if (result[key]) { - if (!Array.isArray(result[key])) { - result[key] = [result[key]] - } - - result[key].push(val) - } else { - result[key] = val - } - }) - - // Convenience properties for parity with `parse-torrent-file` module - let m - if (result.xt) { - const xts = Array.isArray(result.xt) ? result.xt : [result.xt] - xts.forEach(xt => { - if ((m = xt.match(/^urn:btih:(.{40})/))) { - result.infoHash = m[1].toLowerCase() - } else if ((m = xt.match(/^urn:btih:(.{32})/))) { - const decodedStr = base32.decode(m[1]) - result.infoHash = Buffer.from(decodedStr, 'binary').toString('hex') - } else if ((m = xt.match(/^urn:btmh:1220(.{64})/))) { - result.infoHashV2 = m[1].toLowerCase() - } - }) - } - - if (result.xs) { - const xss = Array.isArray(result.xs) ? result.xs : [result.xs] - xss.forEach(xs => { - if ((m = xs.match(/^urn:btpk:(.{64})/))) { - result.publicKey = m[1].toLowerCase() - } - }) - } - - if (result.infoHash) result.infoHashBuffer = Buffer.from(result.infoHash, 'hex') - if (result.infoHashV2) result.infoHashV2Buffer = Buffer.from(result.infoHashV2, 'hex') - if (result.publicKey) result.publicKeyBuffer = Buffer.from(result.publicKey, 'hex') - - if (result.dn) result.name = result.dn - if (result.kt) result.keywords = result.kt - - result.announce = [] - if (typeof result.tr === 'string' || Array.isArray(result.tr)) { - result.announce = result.announce.concat(result.tr) - } - - result.urlList = [] - if (typeof result.as === 'string' || Array.isArray(result.as)) { - result.urlList = result.urlList.concat(result.as) - } - if (typeof result.ws === 'string' || Array.isArray(result.ws)) { - result.urlList = result.urlList.concat(result.ws) - } - - result.peerAddresses = [] - if (typeof result['x.pe'] === 'string' || Array.isArray(result['x.pe'])) { - result.peerAddresses = result.peerAddresses.concat(result['x.pe']) - } - - // remove duplicates by converting to Set and back - result.announce = Array.from(new Set(result.announce)) - result.urlList = Array.from(new Set(result.urlList)) - result.peerAddresses = Array.from(new Set(result.peerAddresses)) - - return result -} - -function magnetURIEncode (obj) { - obj = Object.assign({}, obj) // clone obj, so we can mutate it - - // support using convenience names, in addition to spec names - // (example: `infoHash` for `xt`, `name` for `dn`) - - // Deduplicate xt by using a set - let xts = new Set() - if (obj.xt && typeof obj.xt === 'string') xts.add(obj.xt) - if (obj.xt && Array.isArray(obj.xt)) xts = new Set(obj.xt) - if (obj.infoHashBuffer) xts.add(`urn:btih:${obj.infoHashBuffer.toString('hex')}`) - if (obj.infoHash) xts.add(`urn:btih:${obj.infoHash}`) - if (obj.infoHashV2Buffer) xts.add(obj.xt = `urn:btmh:1220${obj.infoHashV2Buffer.toString('hex')}`) - if (obj.infoHashV2) xts.add(`urn:btmh:1220${obj.infoHashV2}`) - const xtsDeduped = Array.from(xts) - if (xtsDeduped.length === 1) obj.xt = xtsDeduped[0] - if (xtsDeduped.length > 1) obj.xt = xtsDeduped - - if (obj.publicKeyBuffer) obj.xs = `urn:btpk:${obj.publicKeyBuffer.toString('hex')}` - if (obj.publicKey) obj.xs = `urn:btpk:${obj.publicKey}` - if (obj.name) obj.dn = obj.name - if (obj.keywords) obj.kt = obj.keywords - if (obj.announce) obj.tr = obj.announce - if (obj.urlList) { - obj.ws = obj.urlList - delete obj.as - } - if (obj.peerAddresses) obj['x.pe'] = obj.peerAddresses - - let result = 'magnet:?' - Object.keys(obj) - .filter(key => key.length === 2 || key === 'x.pe') - .forEach((key, i) => { - const values = Array.isArray(obj[key]) ? obj[key] : [obj[key]] - values.forEach((val, j) => { - if ((i > 0 || j > 0) && ((key !== 'kt' && key !== 'so') || j === 0)) result += '&' - - if (key === 'dn') val = encodeURIComponent(val).replace(/%20/g, '+') - if (key === 'tr' || key === 'as' || key === 'ws') { - val = encodeURIComponent(val) - } - // Don't URI encode BEP46 keys - if (key === 'xs' && !val.startsWith('urn:btpk:')) { - val = encodeURIComponent(val) - } - if (key === 'kt') val = encodeURIComponent(val) - if (key === 'so') return - - if (key === 'kt' && j > 0) result += `+${val}` - else result += `${key}=${val}` - }) - if (key === 'so') result += `${key}=${bep53Range.compose(values)}` - }) - - return result -} - - -/***/ }), - -/***/ "./node_modules/matroska-subtitles/dist/matroska-subtitles.module.js": -/*!***************************************************************************!*\ - !*** ./node_modules/matroska-subtitles/dist/matroska-subtitles.module.js ***! - \***************************************************************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "SubtitleParser": () => (/* binding */ SubtitleParser), -/* harmony export */ "SubtitleStream": () => (/* binding */ SubtitleStream) -/* harmony export */ }); -/* harmony import */ var ebml_stream__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! ebml-stream */ "./node_modules/ebml-stream/lib/index.js"); -/* harmony import */ var readable_stream__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js"); -/* harmony import */ var readable_stream__WEBPACK_IMPORTED_MODULE_1___default = /*#__PURE__*/__webpack_require__.n(readable_stream__WEBPACK_IMPORTED_MODULE_1__); -/* harmony import */ var zlib__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! zlib */ "./node_modules/browserify-zlib/lib/index.js"); -/* harmony import */ var zlib__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(zlib__WEBPACK_IMPORTED_MODULE_2__); -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); - - - - -const SSA_TYPES = new Set(['ssa', 'ass']); -const SSA_KEYS = ['readOrder', 'layer', 'style', 'name', 'marginL', 'marginR', 'marginV', 'effect', 'text']; - -function getData(chunk, id) { - const el = chunk.Children.find(c => c.id === id); - return el ? el.data : undefined; -} - -class SubtitleParserBase extends readable_stream__WEBPACK_IMPORTED_MODULE_1__.Transform { - constructor() { - super(); - this.subtitleTracks = new Map(); - this.timecodeScale = 1; - this._currentClusterTimecode = null; - this.decoder = new ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlStreamDecoder({ - bufferTagIds: [ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.TimecodeScale, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.Tracks, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.BlockGroup, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.AttachedFile] - }); - this.decoder.on('data', this.parseEbmlSubtitles.bind(this)); - } - - parseEbmlSubtitles(chunk) { - // Segment Information - if (chunk.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.TimecodeScale) { - this.timecodeScale = chunk.data / 1000000; - } // Assumption: This is a Cluster `Timecode` - - - if (chunk.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.Timecode) { - this._currentClusterTimecode = chunk.data; - } - - if (chunk.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.Tracks) { - for (const entry of chunk.Children.filter(c => c.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.TrackEntry)) { - // Skip non subtitle tracks - if (getData(entry, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.TrackType) !== 0x11) continue; - const codecID = getData(entry, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.CodecID) || ''; - - if (codecID.startsWith('S_TEXT')) { - const track = { - number: getData(entry, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.TrackNumber), - language: getData(entry, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.Language), - type: codecID.substring(7).toLowerCase() - }; - const name = getData(entry, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.Name); - - if (name) { - track.name = name; - } - - const header = getData(entry, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.CodecPrivate); - - if (header) { - track.header = header.toString(); - } // TODO: Assume zlib deflate compression - - - const compressed = entry.Children.find(c => c.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.ContentEncodings && c.Children.find(cc => cc.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.ContentEncoding && cc.Children.find(ccc => ccc.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.ContentCompression))); - - if (compressed) { - track._compressed = true; - } - - this.subtitleTracks.set(track.number, track); - } - } - - this.emit('tracks', Array.from(this.subtitleTracks.values())); - } - - if (chunk.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.BlockGroup) { - const block = chunk.Children.find(c => c.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.Block); - - if (block && this.subtitleTracks.has(block.track)) { - const blockDuration = getData(chunk, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.BlockDuration); - const track = this.subtitleTracks.get(block.track); - const payload = track._compressed ? (0,zlib__WEBPACK_IMPORTED_MODULE_2__.inflateSync)(Buffer.from(block.payload)) : block.payload; - const subtitle = { - text: payload.toString('utf8'), - time: (block.value + this._currentClusterTimecode) * this.timecodeScale, - duration: blockDuration * this.timecodeScale - }; - - if (SSA_TYPES.has(track.type)) { - // extract SSA/ASS keys - const values = subtitle.text.split(','); // ignore read-order, and skip layer if ssa - - for (let i = track.type === 'ssa' ? 2 : 1; i < 8; i++) { - subtitle[SSA_KEYS[i]] = values[i]; - } - - subtitle.text = values.slice(8).join(','); - } - - this.emit('subtitle', subtitle, block.track); - } - } // Parse attached files, mainly to allow extracting subtitle font files. - - - if (chunk.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.AttachedFile) { - this.emit('file', { - filename: getData(chunk, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.FileName), - mimetype: getData(chunk, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.FileMimeType), - data: getData(chunk, ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.FileData) - }); - } - } - -} - -class SubtitleParser extends SubtitleParserBase { - constructor() { - super(); - this.decoder.on('data', chunk => { - if (chunk.id === ebml_stream__WEBPACK_IMPORTED_MODULE_0__.EbmlTagId.Tracks) { - // stop decoding if no subtitle tracks are present - if (this.subtitleTracks.size === 0) this.end(); - } - }); - } - - _write(chunk, _, callback) { - this.decoder.write(chunk); - callback(null, chunk); - } - -} - -class SubtitleStream extends SubtitleParserBase { - constructor(prevInstance) { - super(); - - if (prevInstance instanceof SubtitleStream) { - prevInstance.once('drain', () => prevInstance.end()); // copy previous metadata - - this.subtitleTracks = prevInstance.subtitleTracks; - this.timecodeScale = prevInstance.timecodeScale; // may not be at ebml tag offset - - this.unstable = true; - } - } // passthrough stream: data is intercepted but not transformed - - - _transform(chunk, _, callback) { - if (this.unstable) { - // the ebml decoder expects to see a tag, so we won't use it until we find a cluster - for (let i = 0; i < chunk.length - 12; i++) { - // cluster id - if (chunk[i] === 0x1f && chunk[i + 1] === 0x43 && chunk[i + 2] === 0xb6 && chunk[i + 3] === 0x75) { - // length of cluster size tag - const len = 8 - Math.floor(Math.log2(chunk[i + 4])); // first tag in cluster is cluster timecode - - if (chunk[i + 4 + len] === 0xe7) { - // okay this is probably a cluster - this.unstable = false; - this.decoderWrite(chunk.slice(i)); - break; - } - } - } - } else { - this.decoderWrite(chunk); - } - - callback(null, chunk); - } - - decoderWrite(chunk) { - // passthrough stream should allow chained streams to continue on error - try { - this.decoder.write(chunk); - } catch (err) { - console.warn('[matroska-subtitles] EBML stream decoding error'); - } - } - -} - - -//# sourceMappingURL=matroska-subtitles.module.js.map - - -/***/ }), - -/***/ "./node_modules/md5.js/index.js": -/*!**************************************!*\ - !*** ./node_modules/md5.js/index.js ***! - \**************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var HashBase = __webpack_require__(/*! hash-base */ "./node_modules/hash-base/index.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var ARRAY16 = new Array(16) - -function MD5 () { - HashBase.call(this, 64) - - // state - this._a = 0x67452301 - this._b = 0xefcdab89 - this._c = 0x98badcfe - this._d = 0x10325476 -} - -inherits(MD5, HashBase) - -MD5.prototype._update = function () { - var M = ARRAY16 - for (var i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4) - - var a = this._a - var b = this._b - var c = this._c - var d = this._d - - a = fnF(a, b, c, d, M[0], 0xd76aa478, 7) - d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12) - c = fnF(c, d, a, b, M[2], 0x242070db, 17) - b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22) - a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7) - d = fnF(d, a, b, c, M[5], 0x4787c62a, 12) - c = fnF(c, d, a, b, M[6], 0xa8304613, 17) - b = fnF(b, c, d, a, M[7], 0xfd469501, 22) - a = fnF(a, b, c, d, M[8], 0x698098d8, 7) - d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12) - c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17) - b = fnF(b, c, d, a, M[11], 0x895cd7be, 22) - a = fnF(a, b, c, d, M[12], 0x6b901122, 7) - d = fnF(d, a, b, c, M[13], 0xfd987193, 12) - c = fnF(c, d, a, b, M[14], 0xa679438e, 17) - b = fnF(b, c, d, a, M[15], 0x49b40821, 22) - - a = fnG(a, b, c, d, M[1], 0xf61e2562, 5) - d = fnG(d, a, b, c, M[6], 0xc040b340, 9) - c = fnG(c, d, a, b, M[11], 0x265e5a51, 14) - b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20) - a = fnG(a, b, c, d, M[5], 0xd62f105d, 5) - d = fnG(d, a, b, c, M[10], 0x02441453, 9) - c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14) - b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20) - a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5) - d = fnG(d, a, b, c, M[14], 0xc33707d6, 9) - c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14) - b = fnG(b, c, d, a, M[8], 0x455a14ed, 20) - a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5) - d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9) - c = fnG(c, d, a, b, M[7], 0x676f02d9, 14) - b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20) - - a = fnH(a, b, c, d, M[5], 0xfffa3942, 4) - d = fnH(d, a, b, c, M[8], 0x8771f681, 11) - c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16) - b = fnH(b, c, d, a, M[14], 0xfde5380c, 23) - a = fnH(a, b, c, d, M[1], 0xa4beea44, 4) - d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11) - c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16) - b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23) - a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4) - d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11) - c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16) - b = fnH(b, c, d, a, M[6], 0x04881d05, 23) - a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4) - d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11) - c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16) - b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23) - - a = fnI(a, b, c, d, M[0], 0xf4292244, 6) - d = fnI(d, a, b, c, M[7], 0x432aff97, 10) - c = fnI(c, d, a, b, M[14], 0xab9423a7, 15) - b = fnI(b, c, d, a, M[5], 0xfc93a039, 21) - a = fnI(a, b, c, d, M[12], 0x655b59c3, 6) - d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10) - c = fnI(c, d, a, b, M[10], 0xffeff47d, 15) - b = fnI(b, c, d, a, M[1], 0x85845dd1, 21) - a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6) - d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10) - c = fnI(c, d, a, b, M[6], 0xa3014314, 15) - b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21) - a = fnI(a, b, c, d, M[4], 0xf7537e82, 6) - d = fnI(d, a, b, c, M[11], 0xbd3af235, 10) - c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15) - b = fnI(b, c, d, a, M[9], 0xeb86d391, 21) - - this._a = (this._a + a) | 0 - this._b = (this._b + b) | 0 - this._c = (this._c + c) | 0 - this._d = (this._d + d) | 0 -} - -MD5.prototype._digest = function () { - // create padding and handle blocks - this._block[this._blockOffset++] = 0x80 - if (this._blockOffset > 56) { - this._block.fill(0, this._blockOffset, 64) - this._update() - this._blockOffset = 0 - } - - this._block.fill(0, this._blockOffset, 56) - this._block.writeUInt32LE(this._length[0], 56) - this._block.writeUInt32LE(this._length[1], 60) - this._update() - - // produce result - var buffer = Buffer.allocUnsafe(16) - buffer.writeInt32LE(this._a, 0) - buffer.writeInt32LE(this._b, 4) - buffer.writeInt32LE(this._c, 8) - buffer.writeInt32LE(this._d, 12) - return buffer -} - -function rotl (x, n) { - return (x << n) | (x >>> (32 - n)) -} - -function fnF (a, b, c, d, m, k, s) { - return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + b) | 0 -} - -function fnG (a, b, c, d, m, k, s) { - return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + b) | 0 -} - -function fnH (a, b, c, d, m, k, s) { - return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0 -} - -function fnI (a, b, c, d, m, k, s) { - return (rotl((a + ((c ^ (b | (~d)))) + m + k) | 0, s) + b) | 0 -} - -module.exports = MD5 - - -/***/ }), - -/***/ "./node_modules/mediasource/index.js": -/*!*******************************************!*\ - !*** ./node_modules/mediasource/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*! mediasource. MIT License. Feross Aboukhadijeh */ -module.exports = MediaElementWrapper - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -var toArrayBuffer = __webpack_require__(/*! to-arraybuffer */ "./node_modules/to-arraybuffer/index.js") - -var MediaSource = typeof window !== 'undefined' && window.MediaSource - -var DEFAULT_BUFFER_DURATION = 60 // seconds - -function MediaElementWrapper (elem, opts) { - var self = this - if (!(self instanceof MediaElementWrapper)) return new MediaElementWrapper(elem, opts) - - if (!MediaSource) throw new Error('web browser lacks MediaSource support') - - if (!opts) opts = {} - self._debug = opts.debug - self._bufferDuration = opts.bufferDuration || DEFAULT_BUFFER_DURATION - self._elem = elem - self._mediaSource = new MediaSource() - self._streams = [] - self.detailedError = null - - self._errorHandler = function () { - self._elem.removeEventListener('error', self._errorHandler) - var streams = self._streams.slice() - streams.forEach(function (stream) { - stream.destroy(self._elem.error) - }) - } - self._elem.addEventListener('error', self._errorHandler) - - self._elem.src = window.URL.createObjectURL(self._mediaSource) -} - -/* - * `obj` can be a previous value returned by this function - * or a string - */ -MediaElementWrapper.prototype.createWriteStream = function (obj) { - var self = this - - return new MediaSourceStream(self, obj) -} - -/* - * Use to trigger an error on the underlying media element - */ -MediaElementWrapper.prototype.error = function (err) { - var self = this - - // be careful not to overwrite any existing detailedError values - if (!self.detailedError) { - self.detailedError = err - } - self._dumpDebugData() - try { - self._mediaSource.endOfStream('decode') - } catch (err) {} - - try { - // Attempt to clean up object URL - window.URL.revokeObjectURL(self._elem.src) - } catch (err) {} -} - -/* - * When self._debug is set, dump all data to files - */ -MediaElementWrapper.prototype._dumpDebugData = function () { - var self = this - - if (self._debug) { - self._debug = false // prevent multiple dumps on multiple errors - self._streams.forEach(function (stream, i) { - downloadBuffers(stream._debugBuffers, 'mediasource-stream-' + i) - }) - } -} - -inherits(MediaSourceStream, stream.Writable) - -function MediaSourceStream (wrapper, obj) { - var self = this - stream.Writable.call(self) - - self._wrapper = wrapper - self._elem = wrapper._elem - self._mediaSource = wrapper._mediaSource - self._allStreams = wrapper._streams - self._allStreams.push(self) - self._bufferDuration = wrapper._bufferDuration - self._sourceBuffer = null - self._debugBuffers = [] - - self._openHandler = function () { - self._onSourceOpen() - } - self._flowHandler = function () { - self._flow() - } - self._errorHandler = function (err) { - if (!self.destroyed) { - self.emit('error', err) - } - } - - if (typeof obj === 'string') { - self._type = obj - // Need to create a new sourceBuffer - if (self._mediaSource.readyState === 'open') { - self._createSourceBuffer() - } else { - self._mediaSource.addEventListener('sourceopen', self._openHandler) - } - } else if (obj._sourceBuffer === null) { - obj.destroy() - self._type = obj._type // The old stream was created but hasn't finished initializing - self._mediaSource.addEventListener('sourceopen', self._openHandler) - } else if (obj._sourceBuffer) { - obj.destroy() - self._type = obj._type - self._sourceBuffer = obj._sourceBuffer // Copy over the old sourceBuffer - self._debugBuffers = obj._debugBuffers // Copy over previous debug data - self._sourceBuffer.addEventListener('updateend', self._flowHandler) - self._sourceBuffer.addEventListener('error', self._errorHandler) - } else { - throw new Error('The argument to MediaElementWrapper.createWriteStream must be a string or a previous stream returned from that function') - } - - self._elem.addEventListener('timeupdate', self._flowHandler) - - self.on('error', function (err) { - self._wrapper.error(err) - }) - - self.on('finish', function () { - if (self.destroyed) return - self._finished = true - if (self._allStreams.every(function (other) { return other._finished })) { - self._wrapper._dumpDebugData() - try { - self._mediaSource.endOfStream() - } catch (err) {} - } - }) -} - -MediaSourceStream.prototype._onSourceOpen = function () { - var self = this - if (self.destroyed) return - - self._mediaSource.removeEventListener('sourceopen', self._openHandler) - self._createSourceBuffer() -} - -MediaSourceStream.prototype.destroy = function (err) { - var self = this - if (self.destroyed) return - self.destroyed = true - - // Remove from allStreams - self._allStreams.splice(self._allStreams.indexOf(self), 1) - - self._mediaSource.removeEventListener('sourceopen', self._openHandler) - self._elem.removeEventListener('timeupdate', self._flowHandler) - if (self._sourceBuffer) { - self._sourceBuffer.removeEventListener('updateend', self._flowHandler) - self._sourceBuffer.removeEventListener('error', self._errorHandler) - if (self._mediaSource.readyState === 'open') { - self._sourceBuffer.abort() - } - } - - if (err) self.emit('error', err) - self.emit('close') -} - -MediaSourceStream.prototype._createSourceBuffer = function () { - var self = this - if (self.destroyed) return - - if (MediaSource.isTypeSupported(self._type)) { - self._sourceBuffer = self._mediaSource.addSourceBuffer(self._type) - self._sourceBuffer.addEventListener('updateend', self._flowHandler) - self._sourceBuffer.addEventListener('error', self._errorHandler) - if (self._cb) { - var cb = self._cb - self._cb = null - cb() - } - } else { - self.destroy(new Error('The provided type is not supported')) - } -} - -MediaSourceStream.prototype._write = function (chunk, encoding, cb) { - var self = this - if (self.destroyed) return - if (!self._sourceBuffer) { - self._cb = function (err) { - if (err) return cb(err) - self._write(chunk, encoding, cb) - } - return - } - - if (self._sourceBuffer.updating) { - return cb(new Error('Cannot append buffer while source buffer updating')) - } - - var arr = toArrayBuffer(chunk) - if (self._wrapper._debug) { - self._debugBuffers.push(arr) - } - - try { - self._sourceBuffer.appendBuffer(arr) - } catch (err) { - // appendBuffer can throw for a number of reasons, most notably when the data - // being appended is invalid or if appendBuffer is called after another error - // already occurred on the media element. In Chrome, there may be useful debugging - // info in chrome://media-internals - self.destroy(err) - return - } - self._cb = cb -} - -MediaSourceStream.prototype._flow = function () { - var self = this - - if (self.destroyed || !self._sourceBuffer || self._sourceBuffer.updating) { - return - } - - if (self._mediaSource.readyState === 'open') { - // check buffer size - if (self._getBufferDuration() > self._bufferDuration) { - return - } - } - - if (self._cb) { - var cb = self._cb - self._cb = null - cb() - } -} - -// TODO: if zero actually works in all browsers, remove the logic associated with this below -var EPSILON = 0 - -MediaSourceStream.prototype._getBufferDuration = function () { - var self = this - - var buffered = self._sourceBuffer.buffered - var currentTime = self._elem.currentTime - var bufferEnd = -1 // end of the buffer - // This is a little over complex because some browsers seem to separate the - // buffered region into multiple sections with slight gaps. - for (var i = 0; i < buffered.length; i++) { - var start = buffered.start(i) - var end = buffered.end(i) + EPSILON - - if (start > currentTime) { - // Reached past the joined buffer - break - } else if (bufferEnd >= 0 || currentTime <= end) { - // Found the start/continuation of the joined buffer - bufferEnd = end - } - } - - var bufferedTime = bufferEnd - currentTime - if (bufferedTime < 0) { - bufferedTime = 0 - } - - return bufferedTime -} - -function downloadBuffers (bufs, name) { - var a = document.createElement('a') - a.href = window.URL.createObjectURL(new window.Blob(bufs)) - a.download = name - a.click() -} - - -/***/ }), - -/***/ "./node_modules/memory-chunk-store/index.js": -/*!**************************************************!*\ - !*** ./node_modules/memory-chunk-store/index.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = Storage - -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -function Storage (chunkLength, opts) { - if (!(this instanceof Storage)) return new Storage(chunkLength, opts) - if (!opts) opts = {} - - this.chunkLength = Number(chunkLength) - if (!this.chunkLength) throw new Error('First argument must be a chunk length') - - this.chunks = [] - this.closed = false - this.length = Number(opts.length) || Infinity - - if (this.length !== Infinity) { - this.lastChunkLength = (this.length % this.chunkLength) || this.chunkLength - this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1 - } -} - -Storage.prototype.put = function (index, buf, cb = () => {}) { - if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed'))) - - const isLastChunk = (index === this.lastChunkIndex) - if (isLastChunk && buf.length !== this.lastChunkLength) { - return queueMicrotask(() => cb(new Error('Last chunk length must be ' + this.lastChunkLength))) - } - if (!isLastChunk && buf.length !== this.chunkLength) { - return queueMicrotask(() => cb(new Error('Chunk length must be ' + this.chunkLength))) - } - this.chunks[index] = buf - queueMicrotask(() => cb(null)) -} - -Storage.prototype.get = function (index, opts, cb = () => {}) { - if (typeof opts === 'function') return this.get(index, null, opts) - if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed'))) - - let buf = this.chunks[index] - - if (!buf) { - const err = new Error('Chunk not found') - err.notFound = true - return queueMicrotask(() => cb(err)) - } - - if (!opts) opts = {} - - const offset = opts.offset || 0 - const len = opts.length || (buf.length - offset) - - if (offset !== 0 || len !== buf.length) { - buf = buf.slice(offset, len + offset) - } - - queueMicrotask(() => cb(null, buf)) -} - -Storage.prototype.close = Storage.prototype.destroy = function (cb = () => {}) { - if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed'))) - this.closed = true - this.chunks = null - queueMicrotask(() => cb(null)) -} - - -/***/ }), - -/***/ "./node_modules/miller-rabin/lib/mr.js": -/*!*********************************************!*\ - !*** ./node_modules/miller-rabin/lib/mr.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var bn = __webpack_require__(/*! bn.js */ "./node_modules/miller-rabin/node_modules/bn.js/lib/bn.js"); -var brorand = __webpack_require__(/*! brorand */ "./node_modules/brorand/index.js"); - -function MillerRabin(rand) { - this.rand = rand || new brorand.Rand(); -} -module.exports = MillerRabin; - -MillerRabin.create = function create(rand) { - return new MillerRabin(rand); -}; - -MillerRabin.prototype._randbelow = function _randbelow(n) { - var len = n.bitLength(); - var min_bytes = Math.ceil(len / 8); - - // Generage random bytes until a number less than n is found. - // This ensures that 0..n-1 have an equal probability of being selected. - do - var a = new bn(this.rand.generate(min_bytes)); - while (a.cmp(n) >= 0); - - return a; -}; - -MillerRabin.prototype._randrange = function _randrange(start, stop) { - // Generate a random number greater than or equal to start and less than stop. - var size = stop.sub(start); - return start.add(this._randbelow(size)); -}; - -MillerRabin.prototype.test = function test(n, k, cb) { - var len = n.bitLength(); - var red = bn.mont(n); - var rone = new bn(1).toRed(red); - - if (!k) - k = Math.max(1, (len / 48) | 0); - - // Find d and s, (n - 1) = (2 ^ s) * d; - var n1 = n.subn(1); - for (var s = 0; !n1.testn(s); s++) {} - var d = n.shrn(s); - - var rn1 = n1.toRed(red); - - var prime = true; - for (; k > 0; k--) { - var a = this._randrange(new bn(2), n1); - if (cb) - cb(a); - - var x = a.toRed(red).redPow(d); - if (x.cmp(rone) === 0 || x.cmp(rn1) === 0) - continue; - - for (var i = 1; i < s; i++) { - x = x.redSqr(); - - if (x.cmp(rone) === 0) - return false; - if (x.cmp(rn1) === 0) - break; - } - - if (i === s) - return false; - } - - return prime; -}; - -MillerRabin.prototype.getDivisor = function getDivisor(n, k) { - var len = n.bitLength(); - var red = bn.mont(n); - var rone = new bn(1).toRed(red); - - if (!k) - k = Math.max(1, (len / 48) | 0); - - // Find d and s, (n - 1) = (2 ^ s) * d; - var n1 = n.subn(1); - for (var s = 0; !n1.testn(s); s++) {} - var d = n.shrn(s); - - var rn1 = n1.toRed(red); - - for (; k > 0; k--) { - var a = this._randrange(new bn(2), n1); - - var g = n.gcd(a); - if (g.cmpn(1) !== 0) - return g; - - var x = a.toRed(red).redPow(d); - if (x.cmp(rone) === 0 || x.cmp(rn1) === 0) - continue; - - for (var i = 1; i < s; i++) { - x = x.redSqr(); - - if (x.cmp(rone) === 0) - return x.fromRed().subn(1).gcd(n); - if (x.cmp(rn1) === 0) - break; - } - - if (i === s) { - x = x.redSqr(); - return x.fromRed().subn(1).gcd(n); - } - } - - return false; -}; - - -/***/ }), - -/***/ "./node_modules/miller-rabin/node_modules/bn.js/lib/bn.js": -/*!****************************************************************!*\ - !*** ./node_modules/miller-rabin/node_modules/bn.js/lib/bn.js ***! - \****************************************************************/ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -(function (module, exports) { - 'use strict'; - - // Utils - function assert (val, msg) { - if (!val) throw new Error(msg || 'Assertion failed'); - } - - // Could use `inherits` module, but don't want to move from single file - // architecture yet. - function inherits (ctor, superCtor) { - ctor.super_ = superCtor; - var TempCtor = function () {}; - TempCtor.prototype = superCtor.prototype; - ctor.prototype = new TempCtor(); - ctor.prototype.constructor = ctor; - } - - // BN - - function BN (number, base, endian) { - if (BN.isBN(number)) { - return number; - } - - this.negative = 0; - this.words = null; - this.length = 0; - - // Reduction context - this.red = null; - - if (number !== null) { - if (base === 'le' || base === 'be') { - endian = base; - base = 10; - } - - this._init(number || 0, base || 10, endian || 'be'); - } - } - if (typeof module === 'object') { - module.exports = BN; - } else { - exports.BN = BN; - } - - BN.BN = BN; - BN.wordSize = 26; - - var Buffer; - try { - if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { - Buffer = window.Buffer; - } else { - Buffer = __webpack_require__(/*! buffer */ "?0aec").Buffer; - } - } catch (e) { - } - - BN.isBN = function isBN (num) { - if (num instanceof BN) { - return true; - } - - return num !== null && typeof num === 'object' && - num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); - }; - - BN.max = function max (left, right) { - if (left.cmp(right) > 0) return left; - return right; - }; - - BN.min = function min (left, right) { - if (left.cmp(right) < 0) return left; - return right; - }; - - BN.prototype._init = function init (number, base, endian) { - if (typeof number === 'number') { - return this._initNumber(number, base, endian); - } - - if (typeof number === 'object') { - return this._initArray(number, base, endian); - } - - if (base === 'hex') { - base = 16; - } - assert(base === (base | 0) && base >= 2 && base <= 36); - - number = number.toString().replace(/\s+/g, ''); - var start = 0; - if (number[0] === '-') { - start++; - this.negative = 1; - } - - if (start < number.length) { - if (base === 16) { - this._parseHex(number, start, endian); - } else { - this._parseBase(number, base, start); - if (endian === 'le') { - this._initArray(this.toArray(), base, endian); - } - } - } - }; - - BN.prototype._initNumber = function _initNumber (number, base, endian) { - if (number < 0) { - this.negative = 1; - number = -number; - } - if (number < 0x4000000) { - this.words = [ number & 0x3ffffff ]; - this.length = 1; - } else if (number < 0x10000000000000) { - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff - ]; - this.length = 2; - } else { - assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff, - 1 - ]; - this.length = 3; - } - - if (endian !== 'le') return; - - // Reverse the bytes - this._initArray(this.toArray(), base, endian); - }; - - BN.prototype._initArray = function _initArray (number, base, endian) { - // Perhaps a Uint8Array - assert(typeof number.length === 'number'); - if (number.length <= 0) { - this.words = [ 0 ]; - this.length = 1; - return this; - } - - this.length = Math.ceil(number.length / 3); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - var j, w; - var off = 0; - if (endian === 'be') { - for (i = number.length - 1, j = 0; i >= 0; i -= 3) { - w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } else if (endian === 'le') { - for (i = 0, j = 0; i < number.length; i += 3) { - w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } - return this.strip(); - }; - - function parseHex4Bits (string, index) { - var c = string.charCodeAt(index); - // 'A' - 'F' - if (c >= 65 && c <= 70) { - return c - 55; - // 'a' - 'f' - } else if (c >= 97 && c <= 102) { - return c - 87; - // '0' - '9' - } else { - return (c - 48) & 0xf; - } - } - - function parseHexByte (string, lowerBound, index) { - var r = parseHex4Bits(string, index); - if (index - 1 >= lowerBound) { - r |= parseHex4Bits(string, index - 1) << 4; - } - return r; - } - - BN.prototype._parseHex = function _parseHex (number, start, endian) { - // Create possibly bigger array to ensure that it fits the number - this.length = Math.ceil((number.length - start) / 6); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - // 24-bits chunks - var off = 0; - var j = 0; - - var w; - if (endian === 'be') { - for (i = number.length - 1; i >= start; i -= 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } else { - var parseLength = number.length - start; - for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } - - this.strip(); - }; - - function parseBase (str, start, end, mul) { - var r = 0; - var len = Math.min(str.length, end); - for (var i = start; i < len; i++) { - var c = str.charCodeAt(i) - 48; - - r *= mul; - - // 'a' - if (c >= 49) { - r += c - 49 + 0xa; - - // 'A' - } else if (c >= 17) { - r += c - 17 + 0xa; - - // '0' - '9' - } else { - r += c; - } - } - return r; - } - - BN.prototype._parseBase = function _parseBase (number, base, start) { - // Initialize as zero - this.words = [ 0 ]; - this.length = 1; - - // Find length of limb in base - for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { - limbLen++; - } - limbLen--; - limbPow = (limbPow / base) | 0; - - var total = number.length - start; - var mod = total % limbLen; - var end = Math.min(total, total - mod) + start; - - var word = 0; - for (var i = start; i < end; i += limbLen) { - word = parseBase(number, i, i + limbLen, base); - - this.imuln(limbPow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - if (mod !== 0) { - var pow = 1; - word = parseBase(number, i, number.length, base); - - for (i = 0; i < mod; i++) { - pow *= base; - } - - this.imuln(pow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - this.strip(); - }; - - BN.prototype.copy = function copy (dest) { - dest.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - dest.words[i] = this.words[i]; - } - dest.length = this.length; - dest.negative = this.negative; - dest.red = this.red; - }; - - BN.prototype.clone = function clone () { - var r = new BN(null); - this.copy(r); - return r; - }; - - BN.prototype._expand = function _expand (size) { - while (this.length < size) { - this.words[this.length++] = 0; - } - return this; - }; - - // Remove leading `0` from `this` - BN.prototype.strip = function strip () { - while (this.length > 1 && this.words[this.length - 1] === 0) { - this.length--; - } - return this._normSign(); - }; - - BN.prototype._normSign = function _normSign () { - // -0 = 0 - if (this.length === 1 && this.words[0] === 0) { - this.negative = 0; - } - return this; - }; - - BN.prototype.inspect = function inspect () { - return (this.red ? ''; - }; - - /* - - var zeros = []; - var groupSizes = []; - var groupBases = []; - - var s = ''; - var i = -1; - while (++i < BN.wordSize) { - zeros[i] = s; - s += '0'; - } - groupSizes[0] = 0; - groupSizes[1] = 0; - groupBases[0] = 0; - groupBases[1] = 0; - var base = 2 - 1; - while (++base < 36 + 1) { - var groupSize = 0; - var groupBase = 1; - while (groupBase < (1 << BN.wordSize) / base) { - groupBase *= base; - groupSize += 1; - } - groupSizes[base] = groupSize; - groupBases[base] = groupBase; - } - - */ - - 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' - ]; - - 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 - ]; - - 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 - ]; - - BN.prototype.toString = function toString (base, padding) { - base = base || 10; - padding = padding | 0 || 1; - - var out; - if (base === 16 || base === 'hex') { - out = ''; - var off = 0; - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = this.words[i]; - var word = (((w << off) | carry) & 0xffffff).toString(16); - carry = (w >>> (24 - off)) & 0xffffff; - if (carry !== 0 || i !== this.length - 1) { - out = zeros[6 - word.length] + word + out; - } else { - out = word + out; - } - off += 2; - if (off >= 26) { - off -= 26; - i--; - } - } - if (carry !== 0) { - out = carry.toString(16) + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - if (base === (base | 0) && base >= 2 && base <= 36) { - // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); - var groupSize = groupSizes[base]; - // var groupBase = Math.pow(base, groupSize); - var groupBase = groupBases[base]; - out = ''; - var c = this.clone(); - c.negative = 0; - while (!c.isZero()) { - var r = c.modn(groupBase).toString(base); - c = c.idivn(groupBase); - - if (!c.isZero()) { - out = zeros[groupSize - r.length] + r + out; - } else { - out = r + out; - } - } - if (this.isZero()) { - out = '0' + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - assert(false, 'Base should be between 2 and 36'); - }; - - BN.prototype.toNumber = function toNumber () { - var ret = this.words[0]; - if (this.length === 2) { - ret += this.words[1] * 0x4000000; - } else if (this.length === 3 && this.words[2] === 0x01) { - // NOTE: at this stage it is known that the top bit is set - ret += 0x10000000000000 + (this.words[1] * 0x4000000); - } else if (this.length > 2) { - assert(false, 'Number can only safely store up to 53 bits'); - } - return (this.negative !== 0) ? -ret : ret; - }; - - BN.prototype.toJSON = function toJSON () { - return this.toString(16); - }; - - BN.prototype.toBuffer = function toBuffer (endian, length) { - assert(typeof Buffer !== 'undefined'); - return this.toArrayLike(Buffer, endian, length); - }; - - BN.prototype.toArray = function toArray (endian, length) { - return this.toArrayLike(Array, endian, length); - }; - - BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { - var byteLength = this.byteLength(); - var reqLength = length || Math.max(1, byteLength); - assert(byteLength <= reqLength, 'byte array longer than desired length'); - assert(reqLength > 0, 'Requested array length <= 0'); - - this.strip(); - var littleEndian = endian === 'le'; - var res = new ArrayType(reqLength); - - var b, i; - var q = this.clone(); - if (!littleEndian) { - // Assume big-endian - for (i = 0; i < reqLength - byteLength; i++) { - res[i] = 0; - } - - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[reqLength - i - 1] = b; - } - } else { - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[i] = b; - } - - for (; i < reqLength; i++) { - res[i] = 0; - } - } - - return res; - }; - - if (Math.clz32) { - BN.prototype._countBits = function _countBits (w) { - return 32 - Math.clz32(w); - }; - } else { - BN.prototype._countBits = function _countBits (w) { - var t = w; - var r = 0; - if (t >= 0x1000) { - r += 13; - t >>>= 13; - } - if (t >= 0x40) { - r += 7; - t >>>= 7; - } - if (t >= 0x8) { - r += 4; - t >>>= 4; - } - if (t >= 0x02) { - r += 2; - t >>>= 2; - } - return r + t; - }; - } - - BN.prototype._zeroBits = function _zeroBits (w) { - // Short-cut - if (w === 0) return 26; - - var t = w; - var r = 0; - if ((t & 0x1fff) === 0) { - r += 13; - t >>>= 13; - } - if ((t & 0x7f) === 0) { - r += 7; - t >>>= 7; - } - if ((t & 0xf) === 0) { - r += 4; - t >>>= 4; - } - if ((t & 0x3) === 0) { - r += 2; - t >>>= 2; - } - if ((t & 0x1) === 0) { - r++; - } - return r; - }; - - // Return number of used bits in a BN - BN.prototype.bitLength = function bitLength () { - var w = this.words[this.length - 1]; - var hi = this._countBits(w); - return (this.length - 1) * 26 + hi; - }; - - function toBitArray (num) { - var w = new Array(num.bitLength()); - - for (var bit = 0; bit < w.length; bit++) { - var off = (bit / 26) | 0; - var wbit = bit % 26; - - w[bit] = (num.words[off] & (1 << wbit)) >>> wbit; - } - - return w; - } - - // Number of trailing zero bits - BN.prototype.zeroBits = function zeroBits () { - if (this.isZero()) return 0; - - var r = 0; - for (var i = 0; i < this.length; i++) { - var b = this._zeroBits(this.words[i]); - r += b; - if (b !== 26) break; - } - return r; - }; - - BN.prototype.byteLength = function byteLength () { - return Math.ceil(this.bitLength() / 8); - }; - - BN.prototype.toTwos = function toTwos (width) { - if (this.negative !== 0) { - return this.abs().inotn(width).iaddn(1); - } - return this.clone(); - }; - - BN.prototype.fromTwos = function fromTwos (width) { - if (this.testn(width - 1)) { - return this.notn(width).iaddn(1).ineg(); - } - return this.clone(); - }; - - BN.prototype.isNeg = function isNeg () { - return this.negative !== 0; - }; - - // Return negative clone of `this` - BN.prototype.neg = function neg () { - return this.clone().ineg(); - }; - - BN.prototype.ineg = function ineg () { - if (!this.isZero()) { - this.negative ^= 1; - } - - return this; - }; - - // Or `num` with `this` in-place - BN.prototype.iuor = function iuor (num) { - while (this.length < num.length) { - this.words[this.length++] = 0; - } - - for (var i = 0; i < num.length; i++) { - this.words[i] = this.words[i] | num.words[i]; - } - - return this.strip(); - }; - - BN.prototype.ior = function ior (num) { - assert((this.negative | num.negative) === 0); - return this.iuor(num); - }; - - // Or `num` with `this` - BN.prototype.or = function or (num) { - if (this.length > num.length) return this.clone().ior(num); - return num.clone().ior(this); - }; - - BN.prototype.uor = function uor (num) { - if (this.length > num.length) return this.clone().iuor(num); - return num.clone().iuor(this); - }; - - // And `num` with `this` in-place - BN.prototype.iuand = function iuand (num) { - // b = min-length(num, this) - var b; - if (this.length > num.length) { - b = num; - } else { - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = this.words[i] & num.words[i]; - } - - this.length = b.length; - - return this.strip(); - }; - - BN.prototype.iand = function iand (num) { - assert((this.negative | num.negative) === 0); - return this.iuand(num); - }; - - // And `num` with `this` - BN.prototype.and = function and (num) { - if (this.length > num.length) return this.clone().iand(num); - return num.clone().iand(this); - }; - - BN.prototype.uand = function uand (num) { - if (this.length > num.length) return this.clone().iuand(num); - return num.clone().iuand(this); - }; - - // Xor `num` with `this` in-place - BN.prototype.iuxor = function iuxor (num) { - // a.length > b.length - var a; - var b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = a.words[i] ^ b.words[i]; - } - - if (this !== a) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = a.length; - - return this.strip(); - }; - - BN.prototype.ixor = function ixor (num) { - assert((this.negative | num.negative) === 0); - return this.iuxor(num); - }; - - // Xor `num` with `this` - BN.prototype.xor = function xor (num) { - if (this.length > num.length) return this.clone().ixor(num); - return num.clone().ixor(this); - }; - - BN.prototype.uxor = function uxor (num) { - if (this.length > num.length) return this.clone().iuxor(num); - return num.clone().iuxor(this); - }; - - // Not ``this`` with ``width`` bitwidth - BN.prototype.inotn = function inotn (width) { - assert(typeof width === 'number' && width >= 0); - - var bytesNeeded = Math.ceil(width / 26) | 0; - var bitsLeft = width % 26; - - // Extend the buffer with leading zeroes - this._expand(bytesNeeded); - - if (bitsLeft > 0) { - bytesNeeded--; - } - - // Handle complete words - for (var i = 0; i < bytesNeeded; i++) { - this.words[i] = ~this.words[i] & 0x3ffffff; - } - - // Handle the residue - if (bitsLeft > 0) { - this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); - } - - // And remove leading zeroes - return this.strip(); - }; - - BN.prototype.notn = function notn (width) { - return this.clone().inotn(width); - }; - - // Set `bit` of `this` - BN.prototype.setn = function setn (bit, val) { - assert(typeof bit === 'number' && bit >= 0); - - var off = (bit / 26) | 0; - var wbit = bit % 26; - - this._expand(off + 1); - - if (val) { - this.words[off] = this.words[off] | (1 << wbit); - } else { - this.words[off] = this.words[off] & ~(1 << wbit); - } - - return this.strip(); - }; - - // Add `num` to `this` in-place - BN.prototype.iadd = function iadd (num) { - var r; - - // negative + positive - if (this.negative !== 0 && num.negative === 0) { - this.negative = 0; - r = this.isub(num); - this.negative ^= 1; - return this._normSign(); - - // positive + negative - } else if (this.negative === 0 && num.negative !== 0) { - num.negative = 0; - r = this.isub(num); - num.negative = 1; - return r._normSign(); - } - - // a.length > b.length - var a, b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) + (b.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - - this.length = a.length; - if (carry !== 0) { - this.words[this.length] = carry; - this.length++; - // Copy the rest of the words - } else if (a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - return this; - }; - - // Add `num` to `this` - BN.prototype.add = function add (num) { - var res; - if (num.negative !== 0 && this.negative === 0) { - num.negative = 0; - res = this.sub(num); - num.negative ^= 1; - return res; - } else if (num.negative === 0 && this.negative !== 0) { - this.negative = 0; - res = num.sub(this); - this.negative = 1; - return res; - } - - if (this.length > num.length) return this.clone().iadd(num); - - return num.clone().iadd(this); - }; - - // Subtract `num` from `this` in-place - BN.prototype.isub = function isub (num) { - // this - (-num) = this + num - if (num.negative !== 0) { - num.negative = 0; - var r = this.iadd(num); - num.negative = 1; - return r._normSign(); - - // -this - num = -(this + num) - } else if (this.negative !== 0) { - this.negative = 0; - this.iadd(num); - this.negative = 1; - return this._normSign(); - } - - // At this point both numbers are positive - var cmp = this.cmp(num); - - // Optimization - zeroify - if (cmp === 0) { - this.negative = 0; - this.length = 1; - this.words[0] = 0; - return this; - } - - // a > b - var a, b; - if (cmp > 0) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) - (b.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - - // Copy rest of the words - if (carry === 0 && i < a.length && a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = Math.max(this.length, i); - - if (a !== this) { - this.negative = 1; - } - - return this.strip(); - }; - - // Subtract `num` from `this` - BN.prototype.sub = function sub (num) { - return this.clone().isub(num); - }; - - function smallMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - var len = (self.length + num.length) | 0; - out.length = len; - len = (len - 1) | 0; - - // Peel one iteration (compiler can't do it, because of code complexity) - var a = self.words[0] | 0; - var b = num.words[0] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - var carry = (r / 0x4000000) | 0; - out.words[0] = lo; - - for (var k = 1; k < len; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = carry >>> 26; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = (k - j) | 0; - a = self.words[i] | 0; - b = num.words[j] | 0; - r = a * b + rword; - ncarry += (r / 0x4000000) | 0; - rword = r & 0x3ffffff; - } - out.words[k] = rword | 0; - carry = ncarry | 0; - } - if (carry !== 0) { - out.words[k] = carry | 0; - } else { - out.length--; - } - - return out.strip(); - } - - // TODO(indutny): it may be reasonable to omit it for users who don't need - // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit - // multiplication (like elliptic secp256k1). - var comb10MulTo = function comb10MulTo (self, num, out) { - var a = self.words; - var b = num.words; - var o = out.words; - var c = 0; - var lo; - var mid; - var hi; - var a0 = a[0] | 0; - var al0 = a0 & 0x1fff; - var ah0 = a0 >>> 13; - var a1 = a[1] | 0; - var al1 = a1 & 0x1fff; - var ah1 = a1 >>> 13; - var a2 = a[2] | 0; - var al2 = a2 & 0x1fff; - var ah2 = a2 >>> 13; - var a3 = a[3] | 0; - var al3 = a3 & 0x1fff; - var ah3 = a3 >>> 13; - var a4 = a[4] | 0; - var al4 = a4 & 0x1fff; - var ah4 = a4 >>> 13; - var a5 = a[5] | 0; - var al5 = a5 & 0x1fff; - var ah5 = a5 >>> 13; - var a6 = a[6] | 0; - var al6 = a6 & 0x1fff; - var ah6 = a6 >>> 13; - var a7 = a[7] | 0; - var al7 = a7 & 0x1fff; - var ah7 = a7 >>> 13; - var a8 = a[8] | 0; - var al8 = a8 & 0x1fff; - var ah8 = a8 >>> 13; - var a9 = a[9] | 0; - var al9 = a9 & 0x1fff; - var ah9 = a9 >>> 13; - var b0 = b[0] | 0; - var bl0 = b0 & 0x1fff; - var bh0 = b0 >>> 13; - var b1 = b[1] | 0; - var bl1 = b1 & 0x1fff; - var bh1 = b1 >>> 13; - var b2 = b[2] | 0; - var bl2 = b2 & 0x1fff; - var bh2 = b2 >>> 13; - var b3 = b[3] | 0; - var bl3 = b3 & 0x1fff; - var bh3 = b3 >>> 13; - var b4 = b[4] | 0; - var bl4 = b4 & 0x1fff; - var bh4 = b4 >>> 13; - var b5 = b[5] | 0; - var bl5 = b5 & 0x1fff; - var bh5 = b5 >>> 13; - var b6 = b[6] | 0; - var bl6 = b6 & 0x1fff; - var bh6 = b6 >>> 13; - var b7 = b[7] | 0; - var bl7 = b7 & 0x1fff; - var bh7 = b7 >>> 13; - var b8 = b[8] | 0; - var bl8 = b8 & 0x1fff; - var bh8 = b8 >>> 13; - var b9 = b[9] | 0; - var bl9 = b9 & 0x1fff; - var bh9 = b9 >>> 13; - - out.negative = self.negative ^ num.negative; - out.length = 19; - /* k = 0 */ - lo = Math.imul(al0, bl0); - mid = Math.imul(al0, bh0); - mid = (mid + Math.imul(ah0, bl0)) | 0; - hi = Math.imul(ah0, bh0); - var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; - w0 &= 0x3ffffff; - /* k = 1 */ - lo = Math.imul(al1, bl0); - mid = Math.imul(al1, bh0); - mid = (mid + Math.imul(ah1, bl0)) | 0; - hi = Math.imul(ah1, bh0); - lo = (lo + Math.imul(al0, bl1)) | 0; - mid = (mid + Math.imul(al0, bh1)) | 0; - mid = (mid + Math.imul(ah0, bl1)) | 0; - hi = (hi + Math.imul(ah0, bh1)) | 0; - var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; - w1 &= 0x3ffffff; - /* k = 2 */ - lo = Math.imul(al2, bl0); - mid = Math.imul(al2, bh0); - mid = (mid + Math.imul(ah2, bl0)) | 0; - hi = Math.imul(ah2, bh0); - lo = (lo + Math.imul(al1, bl1)) | 0; - mid = (mid + Math.imul(al1, bh1)) | 0; - mid = (mid + Math.imul(ah1, bl1)) | 0; - hi = (hi + Math.imul(ah1, bh1)) | 0; - lo = (lo + Math.imul(al0, bl2)) | 0; - mid = (mid + Math.imul(al0, bh2)) | 0; - mid = (mid + Math.imul(ah0, bl2)) | 0; - hi = (hi + Math.imul(ah0, bh2)) | 0; - var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; - w2 &= 0x3ffffff; - /* k = 3 */ - lo = Math.imul(al3, bl0); - mid = Math.imul(al3, bh0); - mid = (mid + Math.imul(ah3, bl0)) | 0; - hi = Math.imul(ah3, bh0); - lo = (lo + Math.imul(al2, bl1)) | 0; - mid = (mid + Math.imul(al2, bh1)) | 0; - mid = (mid + Math.imul(ah2, bl1)) | 0; - hi = (hi + Math.imul(ah2, bh1)) | 0; - lo = (lo + Math.imul(al1, bl2)) | 0; - mid = (mid + Math.imul(al1, bh2)) | 0; - mid = (mid + Math.imul(ah1, bl2)) | 0; - hi = (hi + Math.imul(ah1, bh2)) | 0; - lo = (lo + Math.imul(al0, bl3)) | 0; - mid = (mid + Math.imul(al0, bh3)) | 0; - mid = (mid + Math.imul(ah0, bl3)) | 0; - hi = (hi + Math.imul(ah0, bh3)) | 0; - var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; - w3 &= 0x3ffffff; - /* k = 4 */ - lo = Math.imul(al4, bl0); - mid = Math.imul(al4, bh0); - mid = (mid + Math.imul(ah4, bl0)) | 0; - hi = Math.imul(ah4, bh0); - lo = (lo + Math.imul(al3, bl1)) | 0; - mid = (mid + Math.imul(al3, bh1)) | 0; - mid = (mid + Math.imul(ah3, bl1)) | 0; - hi = (hi + Math.imul(ah3, bh1)) | 0; - lo = (lo + Math.imul(al2, bl2)) | 0; - mid = (mid + Math.imul(al2, bh2)) | 0; - mid = (mid + Math.imul(ah2, bl2)) | 0; - hi = (hi + Math.imul(ah2, bh2)) | 0; - lo = (lo + Math.imul(al1, bl3)) | 0; - mid = (mid + Math.imul(al1, bh3)) | 0; - mid = (mid + Math.imul(ah1, bl3)) | 0; - hi = (hi + Math.imul(ah1, bh3)) | 0; - lo = (lo + Math.imul(al0, bl4)) | 0; - mid = (mid + Math.imul(al0, bh4)) | 0; - mid = (mid + Math.imul(ah0, bl4)) | 0; - hi = (hi + Math.imul(ah0, bh4)) | 0; - var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; - w4 &= 0x3ffffff; - /* k = 5 */ - lo = Math.imul(al5, bl0); - mid = Math.imul(al5, bh0); - mid = (mid + Math.imul(ah5, bl0)) | 0; - hi = Math.imul(ah5, bh0); - lo = (lo + Math.imul(al4, bl1)) | 0; - mid = (mid + Math.imul(al4, bh1)) | 0; - mid = (mid + Math.imul(ah4, bl1)) | 0; - hi = (hi + Math.imul(ah4, bh1)) | 0; - lo = (lo + Math.imul(al3, bl2)) | 0; - mid = (mid + Math.imul(al3, bh2)) | 0; - mid = (mid + Math.imul(ah3, bl2)) | 0; - hi = (hi + Math.imul(ah3, bh2)) | 0; - lo = (lo + Math.imul(al2, bl3)) | 0; - mid = (mid + Math.imul(al2, bh3)) | 0; - mid = (mid + Math.imul(ah2, bl3)) | 0; - hi = (hi + Math.imul(ah2, bh3)) | 0; - lo = (lo + Math.imul(al1, bl4)) | 0; - mid = (mid + Math.imul(al1, bh4)) | 0; - mid = (mid + Math.imul(ah1, bl4)) | 0; - hi = (hi + Math.imul(ah1, bh4)) | 0; - lo = (lo + Math.imul(al0, bl5)) | 0; - mid = (mid + Math.imul(al0, bh5)) | 0; - mid = (mid + Math.imul(ah0, bl5)) | 0; - hi = (hi + Math.imul(ah0, bh5)) | 0; - var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; - w5 &= 0x3ffffff; - /* k = 6 */ - lo = Math.imul(al6, bl0); - mid = Math.imul(al6, bh0); - mid = (mid + Math.imul(ah6, bl0)) | 0; - hi = Math.imul(ah6, bh0); - lo = (lo + Math.imul(al5, bl1)) | 0; - mid = (mid + Math.imul(al5, bh1)) | 0; - mid = (mid + Math.imul(ah5, bl1)) | 0; - hi = (hi + Math.imul(ah5, bh1)) | 0; - lo = (lo + Math.imul(al4, bl2)) | 0; - mid = (mid + Math.imul(al4, bh2)) | 0; - mid = (mid + Math.imul(ah4, bl2)) | 0; - hi = (hi + Math.imul(ah4, bh2)) | 0; - lo = (lo + Math.imul(al3, bl3)) | 0; - mid = (mid + Math.imul(al3, bh3)) | 0; - mid = (mid + Math.imul(ah3, bl3)) | 0; - hi = (hi + Math.imul(ah3, bh3)) | 0; - lo = (lo + Math.imul(al2, bl4)) | 0; - mid = (mid + Math.imul(al2, bh4)) | 0; - mid = (mid + Math.imul(ah2, bl4)) | 0; - hi = (hi + Math.imul(ah2, bh4)) | 0; - lo = (lo + Math.imul(al1, bl5)) | 0; - mid = (mid + Math.imul(al1, bh5)) | 0; - mid = (mid + Math.imul(ah1, bl5)) | 0; - hi = (hi + Math.imul(ah1, bh5)) | 0; - lo = (lo + Math.imul(al0, bl6)) | 0; - mid = (mid + Math.imul(al0, bh6)) | 0; - mid = (mid + Math.imul(ah0, bl6)) | 0; - hi = (hi + Math.imul(ah0, bh6)) | 0; - var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; - w6 &= 0x3ffffff; - /* k = 7 */ - lo = Math.imul(al7, bl0); - mid = Math.imul(al7, bh0); - mid = (mid + Math.imul(ah7, bl0)) | 0; - hi = Math.imul(ah7, bh0); - lo = (lo + Math.imul(al6, bl1)) | 0; - mid = (mid + Math.imul(al6, bh1)) | 0; - mid = (mid + Math.imul(ah6, bl1)) | 0; - hi = (hi + Math.imul(ah6, bh1)) | 0; - lo = (lo + Math.imul(al5, bl2)) | 0; - mid = (mid + Math.imul(al5, bh2)) | 0; - mid = (mid + Math.imul(ah5, bl2)) | 0; - hi = (hi + Math.imul(ah5, bh2)) | 0; - lo = (lo + Math.imul(al4, bl3)) | 0; - mid = (mid + Math.imul(al4, bh3)) | 0; - mid = (mid + Math.imul(ah4, bl3)) | 0; - hi = (hi + Math.imul(ah4, bh3)) | 0; - lo = (lo + Math.imul(al3, bl4)) | 0; - mid = (mid + Math.imul(al3, bh4)) | 0; - mid = (mid + Math.imul(ah3, bl4)) | 0; - hi = (hi + Math.imul(ah3, bh4)) | 0; - lo = (lo + Math.imul(al2, bl5)) | 0; - mid = (mid + Math.imul(al2, bh5)) | 0; - mid = (mid + Math.imul(ah2, bl5)) | 0; - hi = (hi + Math.imul(ah2, bh5)) | 0; - lo = (lo + Math.imul(al1, bl6)) | 0; - mid = (mid + Math.imul(al1, bh6)) | 0; - mid = (mid + Math.imul(ah1, bl6)) | 0; - hi = (hi + Math.imul(ah1, bh6)) | 0; - lo = (lo + Math.imul(al0, bl7)) | 0; - mid = (mid + Math.imul(al0, bh7)) | 0; - mid = (mid + Math.imul(ah0, bl7)) | 0; - hi = (hi + Math.imul(ah0, bh7)) | 0; - var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; - w7 &= 0x3ffffff; - /* k = 8 */ - lo = Math.imul(al8, bl0); - mid = Math.imul(al8, bh0); - mid = (mid + Math.imul(ah8, bl0)) | 0; - hi = Math.imul(ah8, bh0); - lo = (lo + Math.imul(al7, bl1)) | 0; - mid = (mid + Math.imul(al7, bh1)) | 0; - mid = (mid + Math.imul(ah7, bl1)) | 0; - hi = (hi + Math.imul(ah7, bh1)) | 0; - lo = (lo + Math.imul(al6, bl2)) | 0; - mid = (mid + Math.imul(al6, bh2)) | 0; - mid = (mid + Math.imul(ah6, bl2)) | 0; - hi = (hi + Math.imul(ah6, bh2)) | 0; - lo = (lo + Math.imul(al5, bl3)) | 0; - mid = (mid + Math.imul(al5, bh3)) | 0; - mid = (mid + Math.imul(ah5, bl3)) | 0; - hi = (hi + Math.imul(ah5, bh3)) | 0; - lo = (lo + Math.imul(al4, bl4)) | 0; - mid = (mid + Math.imul(al4, bh4)) | 0; - mid = (mid + Math.imul(ah4, bl4)) | 0; - hi = (hi + Math.imul(ah4, bh4)) | 0; - lo = (lo + Math.imul(al3, bl5)) | 0; - mid = (mid + Math.imul(al3, bh5)) | 0; - mid = (mid + Math.imul(ah3, bl5)) | 0; - hi = (hi + Math.imul(ah3, bh5)) | 0; - lo = (lo + Math.imul(al2, bl6)) | 0; - mid = (mid + Math.imul(al2, bh6)) | 0; - mid = (mid + Math.imul(ah2, bl6)) | 0; - hi = (hi + Math.imul(ah2, bh6)) | 0; - lo = (lo + Math.imul(al1, bl7)) | 0; - mid = (mid + Math.imul(al1, bh7)) | 0; - mid = (mid + Math.imul(ah1, bl7)) | 0; - hi = (hi + Math.imul(ah1, bh7)) | 0; - lo = (lo + Math.imul(al0, bl8)) | 0; - mid = (mid + Math.imul(al0, bh8)) | 0; - mid = (mid + Math.imul(ah0, bl8)) | 0; - hi = (hi + Math.imul(ah0, bh8)) | 0; - var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; - w8 &= 0x3ffffff; - /* k = 9 */ - lo = Math.imul(al9, bl0); - mid = Math.imul(al9, bh0); - mid = (mid + Math.imul(ah9, bl0)) | 0; - hi = Math.imul(ah9, bh0); - lo = (lo + Math.imul(al8, bl1)) | 0; - mid = (mid + Math.imul(al8, bh1)) | 0; - mid = (mid + Math.imul(ah8, bl1)) | 0; - hi = (hi + Math.imul(ah8, bh1)) | 0; - lo = (lo + Math.imul(al7, bl2)) | 0; - mid = (mid + Math.imul(al7, bh2)) | 0; - mid = (mid + Math.imul(ah7, bl2)) | 0; - hi = (hi + Math.imul(ah7, bh2)) | 0; - lo = (lo + Math.imul(al6, bl3)) | 0; - mid = (mid + Math.imul(al6, bh3)) | 0; - mid = (mid + Math.imul(ah6, bl3)) | 0; - hi = (hi + Math.imul(ah6, bh3)) | 0; - lo = (lo + Math.imul(al5, bl4)) | 0; - mid = (mid + Math.imul(al5, bh4)) | 0; - mid = (mid + Math.imul(ah5, bl4)) | 0; - hi = (hi + Math.imul(ah5, bh4)) | 0; - lo = (lo + Math.imul(al4, bl5)) | 0; - mid = (mid + Math.imul(al4, bh5)) | 0; - mid = (mid + Math.imul(ah4, bl5)) | 0; - hi = (hi + Math.imul(ah4, bh5)) | 0; - lo = (lo + Math.imul(al3, bl6)) | 0; - mid = (mid + Math.imul(al3, bh6)) | 0; - mid = (mid + Math.imul(ah3, bl6)) | 0; - hi = (hi + Math.imul(ah3, bh6)) | 0; - lo = (lo + Math.imul(al2, bl7)) | 0; - mid = (mid + Math.imul(al2, bh7)) | 0; - mid = (mid + Math.imul(ah2, bl7)) | 0; - hi = (hi + Math.imul(ah2, bh7)) | 0; - lo = (lo + Math.imul(al1, bl8)) | 0; - mid = (mid + Math.imul(al1, bh8)) | 0; - mid = (mid + Math.imul(ah1, bl8)) | 0; - hi = (hi + Math.imul(ah1, bh8)) | 0; - lo = (lo + Math.imul(al0, bl9)) | 0; - mid = (mid + Math.imul(al0, bh9)) | 0; - mid = (mid + Math.imul(ah0, bl9)) | 0; - hi = (hi + Math.imul(ah0, bh9)) | 0; - var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; - w9 &= 0x3ffffff; - /* k = 10 */ - lo = Math.imul(al9, bl1); - mid = Math.imul(al9, bh1); - mid = (mid + Math.imul(ah9, bl1)) | 0; - hi = Math.imul(ah9, bh1); - lo = (lo + Math.imul(al8, bl2)) | 0; - mid = (mid + Math.imul(al8, bh2)) | 0; - mid = (mid + Math.imul(ah8, bl2)) | 0; - hi = (hi + Math.imul(ah8, bh2)) | 0; - lo = (lo + Math.imul(al7, bl3)) | 0; - mid = (mid + Math.imul(al7, bh3)) | 0; - mid = (mid + Math.imul(ah7, bl3)) | 0; - hi = (hi + Math.imul(ah7, bh3)) | 0; - lo = (lo + Math.imul(al6, bl4)) | 0; - mid = (mid + Math.imul(al6, bh4)) | 0; - mid = (mid + Math.imul(ah6, bl4)) | 0; - hi = (hi + Math.imul(ah6, bh4)) | 0; - lo = (lo + Math.imul(al5, bl5)) | 0; - mid = (mid + Math.imul(al5, bh5)) | 0; - mid = (mid + Math.imul(ah5, bl5)) | 0; - hi = (hi + Math.imul(ah5, bh5)) | 0; - lo = (lo + Math.imul(al4, bl6)) | 0; - mid = (mid + Math.imul(al4, bh6)) | 0; - mid = (mid + Math.imul(ah4, bl6)) | 0; - hi = (hi + Math.imul(ah4, bh6)) | 0; - lo = (lo + Math.imul(al3, bl7)) | 0; - mid = (mid + Math.imul(al3, bh7)) | 0; - mid = (mid + Math.imul(ah3, bl7)) | 0; - hi = (hi + Math.imul(ah3, bh7)) | 0; - lo = (lo + Math.imul(al2, bl8)) | 0; - mid = (mid + Math.imul(al2, bh8)) | 0; - mid = (mid + Math.imul(ah2, bl8)) | 0; - hi = (hi + Math.imul(ah2, bh8)) | 0; - lo = (lo + Math.imul(al1, bl9)) | 0; - mid = (mid + Math.imul(al1, bh9)) | 0; - mid = (mid + Math.imul(ah1, bl9)) | 0; - hi = (hi + Math.imul(ah1, bh9)) | 0; - var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; - w10 &= 0x3ffffff; - /* k = 11 */ - lo = Math.imul(al9, bl2); - mid = Math.imul(al9, bh2); - mid = (mid + Math.imul(ah9, bl2)) | 0; - hi = Math.imul(ah9, bh2); - lo = (lo + Math.imul(al8, bl3)) | 0; - mid = (mid + Math.imul(al8, bh3)) | 0; - mid = (mid + Math.imul(ah8, bl3)) | 0; - hi = (hi + Math.imul(ah8, bh3)) | 0; - lo = (lo + Math.imul(al7, bl4)) | 0; - mid = (mid + Math.imul(al7, bh4)) | 0; - mid = (mid + Math.imul(ah7, bl4)) | 0; - hi = (hi + Math.imul(ah7, bh4)) | 0; - lo = (lo + Math.imul(al6, bl5)) | 0; - mid = (mid + Math.imul(al6, bh5)) | 0; - mid = (mid + Math.imul(ah6, bl5)) | 0; - hi = (hi + Math.imul(ah6, bh5)) | 0; - lo = (lo + Math.imul(al5, bl6)) | 0; - mid = (mid + Math.imul(al5, bh6)) | 0; - mid = (mid + Math.imul(ah5, bl6)) | 0; - hi = (hi + Math.imul(ah5, bh6)) | 0; - lo = (lo + Math.imul(al4, bl7)) | 0; - mid = (mid + Math.imul(al4, bh7)) | 0; - mid = (mid + Math.imul(ah4, bl7)) | 0; - hi = (hi + Math.imul(ah4, bh7)) | 0; - lo = (lo + Math.imul(al3, bl8)) | 0; - mid = (mid + Math.imul(al3, bh8)) | 0; - mid = (mid + Math.imul(ah3, bl8)) | 0; - hi = (hi + Math.imul(ah3, bh8)) | 0; - lo = (lo + Math.imul(al2, bl9)) | 0; - mid = (mid + Math.imul(al2, bh9)) | 0; - mid = (mid + Math.imul(ah2, bl9)) | 0; - hi = (hi + Math.imul(ah2, bh9)) | 0; - var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; - w11 &= 0x3ffffff; - /* k = 12 */ - lo = Math.imul(al9, bl3); - mid = Math.imul(al9, bh3); - mid = (mid + Math.imul(ah9, bl3)) | 0; - hi = Math.imul(ah9, bh3); - lo = (lo + Math.imul(al8, bl4)) | 0; - mid = (mid + Math.imul(al8, bh4)) | 0; - mid = (mid + Math.imul(ah8, bl4)) | 0; - hi = (hi + Math.imul(ah8, bh4)) | 0; - lo = (lo + Math.imul(al7, bl5)) | 0; - mid = (mid + Math.imul(al7, bh5)) | 0; - mid = (mid + Math.imul(ah7, bl5)) | 0; - hi = (hi + Math.imul(ah7, bh5)) | 0; - lo = (lo + Math.imul(al6, bl6)) | 0; - mid = (mid + Math.imul(al6, bh6)) | 0; - mid = (mid + Math.imul(ah6, bl6)) | 0; - hi = (hi + Math.imul(ah6, bh6)) | 0; - lo = (lo + Math.imul(al5, bl7)) | 0; - mid = (mid + Math.imul(al5, bh7)) | 0; - mid = (mid + Math.imul(ah5, bl7)) | 0; - hi = (hi + Math.imul(ah5, bh7)) | 0; - lo = (lo + Math.imul(al4, bl8)) | 0; - mid = (mid + Math.imul(al4, bh8)) | 0; - mid = (mid + Math.imul(ah4, bl8)) | 0; - hi = (hi + Math.imul(ah4, bh8)) | 0; - lo = (lo + Math.imul(al3, bl9)) | 0; - mid = (mid + Math.imul(al3, bh9)) | 0; - mid = (mid + Math.imul(ah3, bl9)) | 0; - hi = (hi + Math.imul(ah3, bh9)) | 0; - var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; - w12 &= 0x3ffffff; - /* k = 13 */ - lo = Math.imul(al9, bl4); - mid = Math.imul(al9, bh4); - mid = (mid + Math.imul(ah9, bl4)) | 0; - hi = Math.imul(ah9, bh4); - lo = (lo + Math.imul(al8, bl5)) | 0; - mid = (mid + Math.imul(al8, bh5)) | 0; - mid = (mid + Math.imul(ah8, bl5)) | 0; - hi = (hi + Math.imul(ah8, bh5)) | 0; - lo = (lo + Math.imul(al7, bl6)) | 0; - mid = (mid + Math.imul(al7, bh6)) | 0; - mid = (mid + Math.imul(ah7, bl6)) | 0; - hi = (hi + Math.imul(ah7, bh6)) | 0; - lo = (lo + Math.imul(al6, bl7)) | 0; - mid = (mid + Math.imul(al6, bh7)) | 0; - mid = (mid + Math.imul(ah6, bl7)) | 0; - hi = (hi + Math.imul(ah6, bh7)) | 0; - lo = (lo + Math.imul(al5, bl8)) | 0; - mid = (mid + Math.imul(al5, bh8)) | 0; - mid = (mid + Math.imul(ah5, bl8)) | 0; - hi = (hi + Math.imul(ah5, bh8)) | 0; - lo = (lo + Math.imul(al4, bl9)) | 0; - mid = (mid + Math.imul(al4, bh9)) | 0; - mid = (mid + Math.imul(ah4, bl9)) | 0; - hi = (hi + Math.imul(ah4, bh9)) | 0; - var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; - w13 &= 0x3ffffff; - /* k = 14 */ - lo = Math.imul(al9, bl5); - mid = Math.imul(al9, bh5); - mid = (mid + Math.imul(ah9, bl5)) | 0; - hi = Math.imul(ah9, bh5); - lo = (lo + Math.imul(al8, bl6)) | 0; - mid = (mid + Math.imul(al8, bh6)) | 0; - mid = (mid + Math.imul(ah8, bl6)) | 0; - hi = (hi + Math.imul(ah8, bh6)) | 0; - lo = (lo + Math.imul(al7, bl7)) | 0; - mid = (mid + Math.imul(al7, bh7)) | 0; - mid = (mid + Math.imul(ah7, bl7)) | 0; - hi = (hi + Math.imul(ah7, bh7)) | 0; - lo = (lo + Math.imul(al6, bl8)) | 0; - mid = (mid + Math.imul(al6, bh8)) | 0; - mid = (mid + Math.imul(ah6, bl8)) | 0; - hi = (hi + Math.imul(ah6, bh8)) | 0; - lo = (lo + Math.imul(al5, bl9)) | 0; - mid = (mid + Math.imul(al5, bh9)) | 0; - mid = (mid + Math.imul(ah5, bl9)) | 0; - hi = (hi + Math.imul(ah5, bh9)) | 0; - var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; - w14 &= 0x3ffffff; - /* k = 15 */ - lo = Math.imul(al9, bl6); - mid = Math.imul(al9, bh6); - mid = (mid + Math.imul(ah9, bl6)) | 0; - hi = Math.imul(ah9, bh6); - lo = (lo + Math.imul(al8, bl7)) | 0; - mid = (mid + Math.imul(al8, bh7)) | 0; - mid = (mid + Math.imul(ah8, bl7)) | 0; - hi = (hi + Math.imul(ah8, bh7)) | 0; - lo = (lo + Math.imul(al7, bl8)) | 0; - mid = (mid + Math.imul(al7, bh8)) | 0; - mid = (mid + Math.imul(ah7, bl8)) | 0; - hi = (hi + Math.imul(ah7, bh8)) | 0; - lo = (lo + Math.imul(al6, bl9)) | 0; - mid = (mid + Math.imul(al6, bh9)) | 0; - mid = (mid + Math.imul(ah6, bl9)) | 0; - hi = (hi + Math.imul(ah6, bh9)) | 0; - var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; - w15 &= 0x3ffffff; - /* k = 16 */ - lo = Math.imul(al9, bl7); - mid = Math.imul(al9, bh7); - mid = (mid + Math.imul(ah9, bl7)) | 0; - hi = Math.imul(ah9, bh7); - lo = (lo + Math.imul(al8, bl8)) | 0; - mid = (mid + Math.imul(al8, bh8)) | 0; - mid = (mid + Math.imul(ah8, bl8)) | 0; - hi = (hi + Math.imul(ah8, bh8)) | 0; - lo = (lo + Math.imul(al7, bl9)) | 0; - mid = (mid + Math.imul(al7, bh9)) | 0; - mid = (mid + Math.imul(ah7, bl9)) | 0; - hi = (hi + Math.imul(ah7, bh9)) | 0; - var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; - w16 &= 0x3ffffff; - /* k = 17 */ - lo = Math.imul(al9, bl8); - mid = Math.imul(al9, bh8); - mid = (mid + Math.imul(ah9, bl8)) | 0; - hi = Math.imul(ah9, bh8); - lo = (lo + Math.imul(al8, bl9)) | 0; - mid = (mid + Math.imul(al8, bh9)) | 0; - mid = (mid + Math.imul(ah8, bl9)) | 0; - hi = (hi + Math.imul(ah8, bh9)) | 0; - var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; - w17 &= 0x3ffffff; - /* k = 18 */ - lo = Math.imul(al9, bl9); - mid = Math.imul(al9, bh9); - mid = (mid + Math.imul(ah9, bl9)) | 0; - hi = Math.imul(ah9, bh9); - var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; - w18 &= 0x3ffffff; - o[0] = w0; - o[1] = w1; - o[2] = w2; - o[3] = w3; - o[4] = w4; - o[5] = w5; - o[6] = w6; - o[7] = w7; - o[8] = w8; - o[9] = w9; - o[10] = w10; - o[11] = w11; - o[12] = w12; - o[13] = w13; - o[14] = w14; - o[15] = w15; - o[16] = w16; - o[17] = w17; - o[18] = w18; - if (c !== 0) { - o[19] = c; - out.length++; - } - return out; - }; - - // Polyfill comb - if (!Math.imul) { - comb10MulTo = smallMulTo; - } - - function bigMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - out.length = self.length + num.length; - - var carry = 0; - var hncarry = 0; - for (var k = 0; k < out.length - 1; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = hncarry; - hncarry = 0; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = k - j; - var a = self.words[i] | 0; - var b = num.words[j] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; - lo = (lo + rword) | 0; - rword = lo & 0x3ffffff; - ncarry = (ncarry + (lo >>> 26)) | 0; - - hncarry += ncarry >>> 26; - ncarry &= 0x3ffffff; - } - out.words[k] = rword; - carry = ncarry; - ncarry = hncarry; - } - if (carry !== 0) { - out.words[k] = carry; - } else { - out.length--; - } - - return out.strip(); - } - - function jumboMulTo (self, num, out) { - var fftm = new FFTM(); - return fftm.mulp(self, num, out); - } - - BN.prototype.mulTo = function mulTo (num, out) { - var res; - var len = this.length + num.length; - if (this.length === 10 && num.length === 10) { - res = comb10MulTo(this, num, out); - } else if (len < 63) { - res = smallMulTo(this, num, out); - } else if (len < 1024) { - res = bigMulTo(this, num, out); - } else { - res = jumboMulTo(this, num, out); - } - - return res; - }; - - // Cooley-Tukey algorithm for FFT - // slightly revisited to rely on looping instead of recursion - - function FFTM (x, y) { - this.x = x; - this.y = y; - } - - FFTM.prototype.makeRBT = function makeRBT (N) { - var t = new Array(N); - var l = BN.prototype._countBits(N) - 1; - for (var i = 0; i < N; i++) { - t[i] = this.revBin(i, l, N); - } - - return t; - }; - - // Returns binary-reversed representation of `x` - FFTM.prototype.revBin = function revBin (x, l, N) { - if (x === 0 || x === N - 1) return x; - - var rb = 0; - for (var i = 0; i < l; i++) { - rb |= (x & 1) << (l - i - 1); - x >>= 1; - } - - return rb; - }; - - // Performs "tweedling" phase, therefore 'emulating' - // behaviour of the recursive algorithm - FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { - for (var i = 0; i < N; i++) { - rtws[i] = rws[rbt[i]]; - itws[i] = iws[rbt[i]]; - } - }; - - FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { - this.permute(rbt, rws, iws, rtws, itws, N); - - for (var s = 1; s < N; s <<= 1) { - var l = s << 1; - - var rtwdf = Math.cos(2 * Math.PI / l); - var itwdf = Math.sin(2 * Math.PI / l); - - for (var p = 0; p < N; p += l) { - var rtwdf_ = rtwdf; - var itwdf_ = itwdf; - - for (var j = 0; j < s; j++) { - var re = rtws[p + j]; - var ie = itws[p + j]; - - var ro = rtws[p + j + s]; - var io = itws[p + j + s]; - - var rx = rtwdf_ * ro - itwdf_ * io; - - io = rtwdf_ * io + itwdf_ * ro; - ro = rx; - - rtws[p + j] = re + ro; - itws[p + j] = ie + io; - - rtws[p + j + s] = re - ro; - itws[p + j + s] = ie - io; - - /* jshint maxdepth : false */ - if (j !== l) { - rx = rtwdf * rtwdf_ - itwdf * itwdf_; - - itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; - rtwdf_ = rx; - } - } - } - } - }; - - FFTM.prototype.guessLen13b = function guessLen13b (n, m) { - var N = Math.max(m, n) | 1; - var odd = N & 1; - var i = 0; - for (N = N / 2 | 0; N; N = N >>> 1) { - i++; - } - - return 1 << i + 1 + odd; - }; - - FFTM.prototype.conjugate = function conjugate (rws, iws, N) { - if (N <= 1) return; - - for (var i = 0; i < N / 2; i++) { - var t = rws[i]; - - rws[i] = rws[N - i - 1]; - rws[N - i - 1] = t; - - t = iws[i]; - - iws[i] = -iws[N - i - 1]; - iws[N - i - 1] = -t; - } - }; - - FFTM.prototype.normalize13b = function normalize13b (ws, N) { - var carry = 0; - for (var i = 0; i < N / 2; i++) { - var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + - Math.round(ws[2 * i] / N) + - carry; - - ws[i] = w & 0x3ffffff; - - if (w < 0x4000000) { - carry = 0; - } else { - carry = w / 0x4000000 | 0; - } - } - - return ws; - }; - - FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { - var carry = 0; - for (var i = 0; i < len; i++) { - carry = carry + (ws[i] | 0); - - rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; - rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; - } - - // Pad with zeroes - for (i = 2 * len; i < N; ++i) { - rws[i] = 0; - } - - assert(carry === 0); - assert((carry & ~0x1fff) === 0); - }; - - FFTM.prototype.stub = function stub (N) { - var ph = new Array(N); - for (var i = 0; i < N; i++) { - ph[i] = 0; - } - - return ph; - }; - - FFTM.prototype.mulp = function mulp (x, y, out) { - var N = 2 * this.guessLen13b(x.length, y.length); - - var rbt = this.makeRBT(N); - - var _ = this.stub(N); - - var rws = new Array(N); - var rwst = new Array(N); - var iwst = new Array(N); - - var nrws = new Array(N); - var nrwst = new Array(N); - var niwst = new Array(N); - - var rmws = out.words; - rmws.length = N; - - this.convert13b(x.words, x.length, rws, N); - this.convert13b(y.words, y.length, nrws, N); - - this.transform(rws, _, rwst, iwst, N, rbt); - this.transform(nrws, _, nrwst, niwst, N, rbt); - - for (var i = 0; i < N; i++) { - var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; - iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; - rwst[i] = rx; - } - - this.conjugate(rwst, iwst, N); - this.transform(rwst, iwst, rmws, _, N, rbt); - this.conjugate(rmws, _, N); - this.normalize13b(rmws, N); - - out.negative = x.negative ^ y.negative; - out.length = x.length + y.length; - return out.strip(); - }; - - // Multiply `this` by `num` - BN.prototype.mul = function mul (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return this.mulTo(num, out); - }; - - // Multiply employing FFT - BN.prototype.mulf = function mulf (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return jumboMulTo(this, num, out); - }; - - // In-place Multiplication - BN.prototype.imul = function imul (num) { - return this.clone().mulTo(num, this); - }; - - BN.prototype.imuln = function imuln (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - - // Carry - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = (this.words[i] | 0) * num; - var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); - carry >>= 26; - carry += (w / 0x4000000) | 0; - // NOTE: lo is 27bit maximum - carry += lo >>> 26; - this.words[i] = lo & 0x3ffffff; - } - - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - - return this; - }; - - BN.prototype.muln = function muln (num) { - return this.clone().imuln(num); - }; - - // `this` * `this` - BN.prototype.sqr = function sqr () { - return this.mul(this); - }; - - // `this` * `this` in-place - BN.prototype.isqr = function isqr () { - return this.imul(this.clone()); - }; - - // Math.pow(`this`, `num`) - BN.prototype.pow = function pow (num) { - var w = toBitArray(num); - if (w.length === 0) return new BN(1); - - // Skip leading zeroes - var res = this; - for (var i = 0; i < w.length; i++, res = res.sqr()) { - if (w[i] !== 0) break; - } - - if (++i < w.length) { - for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { - if (w[i] === 0) continue; - - res = res.mul(q); - } - } - - return res; - }; - - // Shift-left in-place - BN.prototype.iushln = function iushln (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); - var i; - - if (r !== 0) { - var carry = 0; - - for (i = 0; i < this.length; i++) { - var newCarry = this.words[i] & carryMask; - var c = ((this.words[i] | 0) - newCarry) << r; - this.words[i] = c | carry; - carry = newCarry >>> (26 - r); - } - - if (carry) { - this.words[i] = carry; - this.length++; - } - } - - if (s !== 0) { - for (i = this.length - 1; i >= 0; i--) { - this.words[i + s] = this.words[i]; - } - - for (i = 0; i < s; i++) { - this.words[i] = 0; - } - - this.length += s; - } - - return this.strip(); - }; - - BN.prototype.ishln = function ishln (bits) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushln(bits); - }; - - // Shift-right in-place - // NOTE: `hint` is a lowest bit before trailing zeroes - // NOTE: if `extended` is present - it will be filled with destroyed bits - BN.prototype.iushrn = function iushrn (bits, hint, extended) { - assert(typeof bits === 'number' && bits >= 0); - var h; - if (hint) { - h = (hint - (hint % 26)) / 26; - } else { - h = 0; - } - - var r = bits % 26; - var s = Math.min((bits - r) / 26, this.length); - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - var maskedWords = extended; - - h -= s; - h = Math.max(0, h); - - // Extended mode, copy masked part - if (maskedWords) { - for (var i = 0; i < s; i++) { - maskedWords.words[i] = this.words[i]; - } - maskedWords.length = s; - } - - if (s === 0) { - // No-op, we should not move anything at all - } else if (this.length > s) { - this.length -= s; - for (i = 0; i < this.length; i++) { - this.words[i] = this.words[i + s]; - } - } else { - this.words[0] = 0; - this.length = 1; - } - - var carry = 0; - for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { - var word = this.words[i] | 0; - this.words[i] = (carry << (26 - r)) | (word >>> r); - carry = word & mask; - } - - // Push carried bits as a mask - if (maskedWords && carry !== 0) { - maskedWords.words[maskedWords.length++] = carry; - } - - if (this.length === 0) { - this.words[0] = 0; - this.length = 1; - } - - return this.strip(); - }; - - BN.prototype.ishrn = function ishrn (bits, hint, extended) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushrn(bits, hint, extended); - }; - - // Shift-left - BN.prototype.shln = function shln (bits) { - return this.clone().ishln(bits); - }; - - BN.prototype.ushln = function ushln (bits) { - return this.clone().iushln(bits); - }; - - // Shift-right - BN.prototype.shrn = function shrn (bits) { - return this.clone().ishrn(bits); - }; - - BN.prototype.ushrn = function ushrn (bits) { - return this.clone().iushrn(bits); - }; - - // Test if n bit is set - BN.prototype.testn = function testn (bit) { - assert(typeof bit === 'number' && bit >= 0); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) return false; - - // Check bit and return - var w = this.words[s]; - - return !!(w & q); - }; - - // Return only lowers bits of number (in-place) - BN.prototype.imaskn = function imaskn (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - - assert(this.negative === 0, 'imaskn works only with positive numbers'); - - if (this.length <= s) { - return this; - } - - if (r !== 0) { - s++; - } - this.length = Math.min(s, this.length); - - if (r !== 0) { - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - this.words[this.length - 1] &= mask; - } - - return this.strip(); - }; - - // Return only lowers bits of number - BN.prototype.maskn = function maskn (bits) { - return this.clone().imaskn(bits); - }; - - // Add plain number `num` to `this` - BN.prototype.iaddn = function iaddn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.isubn(-num); - - // Possible sign change - if (this.negative !== 0) { - if (this.length === 1 && (this.words[0] | 0) < num) { - this.words[0] = num - (this.words[0] | 0); - this.negative = 0; - return this; - } - - this.negative = 0; - this.isubn(num); - this.negative = 1; - return this; - } - - // Add without checks - return this._iaddn(num); - }; - - BN.prototype._iaddn = function _iaddn (num) { - this.words[0] += num; - - // Carry - for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { - this.words[i] -= 0x4000000; - if (i === this.length - 1) { - this.words[i + 1] = 1; - } else { - this.words[i + 1]++; - } - } - this.length = Math.max(this.length, i + 1); - - return this; - }; - - // Subtract plain number `num` from `this` - BN.prototype.isubn = function isubn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.iaddn(-num); - - if (this.negative !== 0) { - this.negative = 0; - this.iaddn(num); - this.negative = 1; - return this; - } - - this.words[0] -= num; - - if (this.length === 1 && this.words[0] < 0) { - this.words[0] = -this.words[0]; - this.negative = 1; - } else { - // Carry - for (var i = 0; i < this.length && this.words[i] < 0; i++) { - this.words[i] += 0x4000000; - this.words[i + 1] -= 1; - } - } - - return this.strip(); - }; - - BN.prototype.addn = function addn (num) { - return this.clone().iaddn(num); - }; - - BN.prototype.subn = function subn (num) { - return this.clone().isubn(num); - }; - - BN.prototype.iabs = function iabs () { - this.negative = 0; - - return this; - }; - - BN.prototype.abs = function abs () { - return this.clone().iabs(); - }; - - BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { - var len = num.length + shift; - var i; - - this._expand(len); - - var w; - var carry = 0; - for (i = 0; i < num.length; i++) { - w = (this.words[i + shift] | 0) + carry; - var right = (num.words[i] | 0) * mul; - w -= right & 0x3ffffff; - carry = (w >> 26) - ((right / 0x4000000) | 0); - this.words[i + shift] = w & 0x3ffffff; - } - for (; i < this.length - shift; i++) { - w = (this.words[i + shift] | 0) + carry; - carry = w >> 26; - this.words[i + shift] = w & 0x3ffffff; - } - - if (carry === 0) return this.strip(); - - // Subtraction overflow - assert(carry === -1); - carry = 0; - for (i = 0; i < this.length; i++) { - w = -(this.words[i] | 0) + carry; - carry = w >> 26; - this.words[i] = w & 0x3ffffff; - } - this.negative = 1; - - return this.strip(); - }; - - BN.prototype._wordDiv = function _wordDiv (num, mode) { - var shift = this.length - num.length; - - var a = this.clone(); - var b = num; - - // Normalize - var bhi = b.words[b.length - 1] | 0; - var bhiBits = this._countBits(bhi); - shift = 26 - bhiBits; - if (shift !== 0) { - b = b.ushln(shift); - a.iushln(shift); - bhi = b.words[b.length - 1] | 0; - } - - // Initialize quotient - var m = a.length - b.length; - var q; - - if (mode !== 'mod') { - q = new BN(null); - q.length = m + 1; - q.words = new Array(q.length); - for (var i = 0; i < q.length; i++) { - q.words[i] = 0; - } - } - - var diff = a.clone()._ishlnsubmul(b, 1, m); - if (diff.negative === 0) { - a = diff; - if (q) { - q.words[m] = 1; - } - } - - for (var j = m - 1; j >= 0; j--) { - 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 - // (0x7ffffff) - qj = Math.min((qj / bhi) | 0, 0x3ffffff); - - a._ishlnsubmul(b, qj, j); - while (a.negative !== 0) { - qj--; - a.negative = 0; - a._ishlnsubmul(b, 1, j); - if (!a.isZero()) { - a.negative ^= 1; - } - } - if (q) { - q.words[j] = qj; - } - } - if (q) { - q.strip(); - } - a.strip(); - - // Denormalize - if (mode !== 'div' && shift !== 0) { - a.iushrn(shift); - } - - return { - div: q || null, - mod: a - }; - }; - - // NOTE: 1) `mode` can be set to `mod` to request mod only, - // to `div` to request div only, or be absent to - // request both div & mod - // 2) `positive` is true if unsigned mod is requested - BN.prototype.divmod = function divmod (num, mode, positive) { - assert(!num.isZero()); - - if (this.isZero()) { - return { - div: new BN(0), - mod: new BN(0) - }; - } - - var div, mod, res; - if (this.negative !== 0 && num.negative === 0) { - res = this.neg().divmod(num, mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.iadd(num); - } - } - - return { - div: div, - mod: mod - }; - } - - if (this.negative === 0 && num.negative !== 0) { - res = this.divmod(num.neg(), mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - return { - div: div, - mod: res.mod - }; - } - - if ((this.negative & num.negative) !== 0) { - res = this.neg().divmod(num.neg(), mode); - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.isub(num); - } - } - - return { - div: res.div, - mod: mod - }; - } - - // Both numbers are positive at this point - - // Strip both numbers to approximate shift value - if (num.length > this.length || this.cmp(num) < 0) { - return { - div: new BN(0), - mod: this - }; - } - - // Very short reduction - if (num.length === 1) { - if (mode === 'div') { - return { - div: this.divn(num.words[0]), - mod: null - }; - } - - if (mode === 'mod') { - return { - div: null, - mod: new BN(this.modn(num.words[0])) - }; - } - - return { - div: this.divn(num.words[0]), - mod: new BN(this.modn(num.words[0])) - }; - } - - return this._wordDiv(num, mode); - }; - - // Find `this` / `num` - BN.prototype.div = function div (num) { - return this.divmod(num, 'div', false).div; - }; - - // Find `this` % `num` - BN.prototype.mod = function mod (num) { - return this.divmod(num, 'mod', false).mod; - }; - - BN.prototype.umod = function umod (num) { - return this.divmod(num, 'mod', true).mod; - }; - - // Find Round(`this` / `num`) - BN.prototype.divRound = function divRound (num) { - var dm = this.divmod(num); - - // Fast case - exact division - if (dm.mod.isZero()) return dm.div; - - var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; - - var half = num.ushrn(1); - var r2 = num.andln(1); - var cmp = mod.cmp(half); - - // Round down - if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div; - - // Round up - return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); - }; - - BN.prototype.modn = function modn (num) { - assert(num <= 0x3ffffff); - var p = (1 << 26) % num; - - var acc = 0; - for (var i = this.length - 1; i >= 0; i--) { - acc = (p * acc + (this.words[i] | 0)) % num; - } - - return acc; - }; - - // In-place division by number - BN.prototype.idivn = function idivn (num) { - assert(num <= 0x3ffffff); - - var carry = 0; - for (var i = this.length - 1; i >= 0; i--) { - var w = (this.words[i] | 0) + carry * 0x4000000; - this.words[i] = (w / num) | 0; - carry = w % num; - } - - return this.strip(); - }; - - BN.prototype.divn = function divn (num) { - return this.clone().idivn(num); - }; - - BN.prototype.egcd = function egcd (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var x = this; - var y = p.clone(); - - if (x.negative !== 0) { - x = x.umod(p); - } else { - x = x.clone(); - } - - // A * x + B * y = x - var A = new BN(1); - var B = new BN(0); - - // C * x + D * y = y - var C = new BN(0); - var D = new BN(1); - - var g = 0; - - while (x.isEven() && y.isEven()) { - x.iushrn(1); - y.iushrn(1); - ++g; - } - - var yp = y.clone(); - var xp = x.clone(); - - while (!x.isZero()) { - for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - x.iushrn(i); - while (i-- > 0) { - if (A.isOdd() || B.isOdd()) { - A.iadd(yp); - B.isub(xp); - } - - A.iushrn(1); - B.iushrn(1); - } - } - - for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - y.iushrn(j); - while (j-- > 0) { - if (C.isOdd() || D.isOdd()) { - C.iadd(yp); - D.isub(xp); - } - - C.iushrn(1); - D.iushrn(1); - } - } - - if (x.cmp(y) >= 0) { - x.isub(y); - A.isub(C); - B.isub(D); - } else { - y.isub(x); - C.isub(A); - D.isub(B); - } - } - - return { - a: C, - b: D, - gcd: y.iushln(g) - }; - }; - - // This is reduced incarnation of the binary EEA - // above, designated to invert members of the - // _prime_ fields F(p) at a maximal speed - BN.prototype._invmp = function _invmp (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var a = this; - var b = p.clone(); - - if (a.negative !== 0) { - a = a.umod(p); - } else { - a = a.clone(); - } - - var x1 = new BN(1); - var x2 = new BN(0); - - var delta = b.clone(); - - while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { - for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - a.iushrn(i); - while (i-- > 0) { - if (x1.isOdd()) { - x1.iadd(delta); - } - - x1.iushrn(1); - } - } - - for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - b.iushrn(j); - while (j-- > 0) { - if (x2.isOdd()) { - x2.iadd(delta); - } - - x2.iushrn(1); - } - } - - if (a.cmp(b) >= 0) { - a.isub(b); - x1.isub(x2); - } else { - b.isub(a); - x2.isub(x1); - } - } - - var res; - if (a.cmpn(1) === 0) { - res = x1; - } else { - res = x2; - } - - if (res.cmpn(0) < 0) { - res.iadd(p); - } - - return res; - }; - - BN.prototype.gcd = function gcd (num) { - if (this.isZero()) return num.abs(); - if (num.isZero()) return this.abs(); - - var a = this.clone(); - var b = num.clone(); - a.negative = 0; - b.negative = 0; - - // Remove common factor of two - for (var shift = 0; a.isEven() && b.isEven(); shift++) { - a.iushrn(1); - b.iushrn(1); - } - - do { - while (a.isEven()) { - a.iushrn(1); - } - while (b.isEven()) { - b.iushrn(1); - } - - var r = a.cmp(b); - if (r < 0) { - // Swap `a` and `b` to make `a` always bigger than `b` - var t = a; - a = b; - b = t; - } else if (r === 0 || b.cmpn(1) === 0) { - break; - } - - a.isub(b); - } while (true); - - return b.iushln(shift); - }; - - // Invert number in the field F(num) - BN.prototype.invm = function invm (num) { - return this.egcd(num).a.umod(num); - }; - - BN.prototype.isEven = function isEven () { - return (this.words[0] & 1) === 0; - }; - - BN.prototype.isOdd = function isOdd () { - return (this.words[0] & 1) === 1; - }; - - // And first word and num - BN.prototype.andln = function andln (num) { - return this.words[0] & num; - }; - - // Increment at the bit position in-line - BN.prototype.bincn = function bincn (bit) { - assert(typeof bit === 'number'); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) { - this._expand(s + 1); - this.words[s] |= q; - return this; - } - - // Add bit and propagate, if needed - var carry = q; - for (var i = s; carry !== 0 && i < this.length; i++) { - var w = this.words[i] | 0; - w += carry; - carry = w >>> 26; - w &= 0x3ffffff; - this.words[i] = w; - } - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - return this; - }; - - BN.prototype.isZero = function isZero () { - return this.length === 1 && this.words[0] === 0; - }; - - BN.prototype.cmpn = function cmpn (num) { - var negative = num < 0; - - if (this.negative !== 0 && !negative) return -1; - if (this.negative === 0 && negative) return 1; - - this.strip(); - - var res; - if (this.length > 1) { - res = 1; - } else { - if (negative) { - num = -num; - } - - assert(num <= 0x3ffffff, 'Number is too big'); - - var w = this.words[0] | 0; - res = w === num ? 0 : w < num ? -1 : 1; - } - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Compare two numbers and return: - // 1 - if `this` > `num` - // 0 - if `this` == `num` - // -1 - if `this` < `num` - BN.prototype.cmp = function cmp (num) { - if (this.negative !== 0 && num.negative === 0) return -1; - if (this.negative === 0 && num.negative !== 0) return 1; - - var res = this.ucmp(num); - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Unsigned comparison - BN.prototype.ucmp = function ucmp (num) { - // At this point both numbers have the same sign - if (this.length > num.length) return 1; - if (this.length < num.length) return -1; - - var res = 0; - for (var i = this.length - 1; i >= 0; i--) { - var a = this.words[i] | 0; - var b = num.words[i] | 0; - - if (a === b) continue; - if (a < b) { - res = -1; - } else if (a > b) { - res = 1; - } - break; - } - return res; - }; - - BN.prototype.gtn = function gtn (num) { - return this.cmpn(num) === 1; - }; - - BN.prototype.gt = function gt (num) { - return this.cmp(num) === 1; - }; - - BN.prototype.gten = function gten (num) { - return this.cmpn(num) >= 0; - }; - - BN.prototype.gte = function gte (num) { - return this.cmp(num) >= 0; - }; - - BN.prototype.ltn = function ltn (num) { - return this.cmpn(num) === -1; - }; - - BN.prototype.lt = function lt (num) { - return this.cmp(num) === -1; - }; - - BN.prototype.lten = function lten (num) { - return this.cmpn(num) <= 0; - }; - - BN.prototype.lte = function lte (num) { - return this.cmp(num) <= 0; - }; - - BN.prototype.eqn = function eqn (num) { - return this.cmpn(num) === 0; - }; - - BN.prototype.eq = function eq (num) { - return this.cmp(num) === 0; - }; - - // - // A reduce context, could be using montgomery or something better, depending - // on the `m` itself. - // - BN.red = function red (num) { - return new Red(num); - }; - - BN.prototype.toRed = function toRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - assert(this.negative === 0, 'red works only with positives'); - return ctx.convertTo(this)._forceRed(ctx); - }; - - BN.prototype.fromRed = function fromRed () { - assert(this.red, 'fromRed works only with numbers in reduction context'); - return this.red.convertFrom(this); - }; - - BN.prototype._forceRed = function _forceRed (ctx) { - this.red = ctx; - return this; - }; - - BN.prototype.forceRed = function forceRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - return this._forceRed(ctx); - }; - - BN.prototype.redAdd = function redAdd (num) { - assert(this.red, 'redAdd works only with red numbers'); - return this.red.add(this, num); - }; - - BN.prototype.redIAdd = function redIAdd (num) { - assert(this.red, 'redIAdd works only with red numbers'); - return this.red.iadd(this, num); - }; - - BN.prototype.redSub = function redSub (num) { - assert(this.red, 'redSub works only with red numbers'); - return this.red.sub(this, num); - }; - - BN.prototype.redISub = function redISub (num) { - assert(this.red, 'redISub works only with red numbers'); - return this.red.isub(this, num); - }; - - BN.prototype.redShl = function redShl (num) { - assert(this.red, 'redShl works only with red numbers'); - return this.red.shl(this, num); - }; - - BN.prototype.redMul = function redMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.mul(this, num); - }; - - BN.prototype.redIMul = function redIMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.imul(this, num); - }; - - BN.prototype.redSqr = function redSqr () { - assert(this.red, 'redSqr works only with red numbers'); - this.red._verify1(this); - return this.red.sqr(this); - }; - - BN.prototype.redISqr = function redISqr () { - assert(this.red, 'redISqr works only with red numbers'); - this.red._verify1(this); - return this.red.isqr(this); - }; - - // Square root over p - BN.prototype.redSqrt = function redSqrt () { - assert(this.red, 'redSqrt works only with red numbers'); - this.red._verify1(this); - return this.red.sqrt(this); - }; - - BN.prototype.redInvm = function redInvm () { - assert(this.red, 'redInvm works only with red numbers'); - this.red._verify1(this); - return this.red.invm(this); - }; - - // Return negative clone of `this` % `red modulo` - BN.prototype.redNeg = function redNeg () { - assert(this.red, 'redNeg works only with red numbers'); - this.red._verify1(this); - return this.red.neg(this); - }; - - BN.prototype.redPow = function redPow (num) { - assert(this.red && !num.red, 'redPow(normalNum)'); - this.red._verify1(this); - return this.red.pow(this, num); - }; - - // Prime numbers with efficient reduction - var primes = { - k256: null, - p224: null, - p192: null, - p25519: null - }; - - // Pseudo-Mersenne prime - function MPrime (name, p) { - // P = 2 ^ N - K - this.name = name; - this.p = new BN(p, 16); - this.n = this.p.bitLength(); - this.k = new BN(1).iushln(this.n).isub(this.p); - - this.tmp = this._tmp(); - } - - MPrime.prototype._tmp = function _tmp () { - var tmp = new BN(null); - tmp.words = new Array(Math.ceil(this.n / 13)); - return tmp; - }; - - MPrime.prototype.ireduce = function ireduce (num) { - // Assumes that `num` is less than `P^2` - // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) - var r = num; - var rlen; - - do { - this.split(r, this.tmp); - r = this.imulK(r); - r = r.iadd(this.tmp); - rlen = r.bitLength(); - } while (rlen > this.n); - - var cmp = rlen < this.n ? -1 : r.ucmp(this.p); - if (cmp === 0) { - r.words[0] = 0; - r.length = 1; - } else if (cmp > 0) { - r.isub(this.p); - } else { - if (r.strip !== undefined) { - // r is BN v4 instance - r.strip(); - } else { - // r is BN v5 instance - r._strip(); - } - } - - return r; - }; - - MPrime.prototype.split = function split (input, out) { - input.iushrn(this.n, 0, out); - }; - - MPrime.prototype.imulK = function imulK (num) { - return num.imul(this.k); - }; - - function K256 () { - MPrime.call( - this, - 'k256', - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); - } - inherits(K256, MPrime); - - K256.prototype.split = function split (input, output) { - // 256 = 9 * 26 + 22 - var mask = 0x3fffff; - - var outLen = Math.min(input.length, 9); - for (var i = 0; i < outLen; i++) { - output.words[i] = input.words[i]; - } - output.length = outLen; - - if (input.length <= 9) { - input.words[0] = 0; - input.length = 1; - return; - } - - // Shift by 9 limbs - var prev = input.words[9]; - output.words[output.length++] = prev & mask; - - for (i = 10; i < input.length; i++) { - var next = input.words[i] | 0; - input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); - prev = next; - } - prev >>>= 22; - input.words[i - 10] = prev; - if (prev === 0 && input.length > 10) { - input.length -= 10; - } else { - input.length -= 9; - } - }; - - K256.prototype.imulK = function imulK (num) { - // K = 0x1000003d1 = [ 0x40, 0x3d1 ] - num.words[num.length] = 0; - num.words[num.length + 1] = 0; - num.length += 2; - - // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 - var lo = 0; - for (var i = 0; i < num.length; i++) { - var w = num.words[i] | 0; - lo += w * 0x3d1; - num.words[i] = lo & 0x3ffffff; - lo = w * 0x40 + ((lo / 0x4000000) | 0); - } - - // Fast length reduction - if (num.words[num.length - 1] === 0) { - num.length--; - if (num.words[num.length - 1] === 0) { - num.length--; - } - } - return num; - }; - - function P224 () { - MPrime.call( - this, - 'p224', - 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); - } - inherits(P224, MPrime); - - function P192 () { - MPrime.call( - this, - 'p192', - 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); - } - inherits(P192, MPrime); - - function P25519 () { - // 2 ^ 255 - 19 - MPrime.call( - this, - '25519', - '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); - } - inherits(P25519, MPrime); - - P25519.prototype.imulK = function imulK (num) { - // K = 0x13 - var carry = 0; - for (var i = 0; i < num.length; i++) { - var hi = (num.words[i] | 0) * 0x13 + carry; - var lo = hi & 0x3ffffff; - hi >>>= 26; - - num.words[i] = lo; - carry = hi; - } - if (carry !== 0) { - num.words[num.length++] = carry; - } - return num; - }; - - // Exported mostly for testing purposes, use plain name instead - BN._prime = function prime (name) { - // Cached version of prime - if (primes[name]) return primes[name]; - - var prime; - if (name === 'k256') { - prime = new K256(); - } else if (name === 'p224') { - prime = new P224(); - } else if (name === 'p192') { - prime = new P192(); - } else if (name === 'p25519') { - prime = new P25519(); - } else { - throw new Error('Unknown prime ' + name); - } - primes[name] = prime; - - return prime; - }; - - // - // Base reduction engine - // - function Red (m) { - if (typeof m === 'string') { - var prime = BN._prime(m); - this.m = prime.p; - this.prime = prime; - } else { - assert(m.gtn(1), 'modulus must be greater than 1'); - this.m = m; - this.prime = null; - } - } - - Red.prototype._verify1 = function _verify1 (a) { - assert(a.negative === 0, 'red works only with positives'); - assert(a.red, 'red works only with red numbers'); - }; - - Red.prototype._verify2 = function _verify2 (a, b) { - assert((a.negative | b.negative) === 0, 'red works only with positives'); - assert(a.red && a.red === b.red, - 'red works only with red numbers'); - }; - - Red.prototype.imod = function imod (a) { - if (this.prime) return this.prime.ireduce(a)._forceRed(this); - return a.umod(this.m)._forceRed(this); - }; - - Red.prototype.neg = function neg (a) { - if (a.isZero()) { - return a.clone(); - } - - return this.m.sub(a)._forceRed(this); - }; - - Red.prototype.add = function add (a, b) { - this._verify2(a, b); - - var res = a.add(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.iadd = function iadd (a, b) { - this._verify2(a, b); - - var res = a.iadd(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res; - }; - - Red.prototype.sub = function sub (a, b) { - this._verify2(a, b); - - var res = a.sub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.isub = function isub (a, b) { - this._verify2(a, b); - - var res = a.isub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res; - }; - - Red.prototype.shl = function shl (a, num) { - this._verify1(a); - return this.imod(a.ushln(num)); - }; - - Red.prototype.imul = function imul (a, b) { - this._verify2(a, b); - return this.imod(a.imul(b)); - }; - - Red.prototype.mul = function mul (a, b) { - this._verify2(a, b); - return this.imod(a.mul(b)); - }; - - Red.prototype.isqr = function isqr (a) { - return this.imul(a, a.clone()); - }; - - Red.prototype.sqr = function sqr (a) { - return this.mul(a, a); - }; - - Red.prototype.sqrt = function sqrt (a) { - if (a.isZero()) return a.clone(); - - var mod3 = this.m.andln(3); - assert(mod3 % 2 === 1); - - // Fast case - if (mod3 === 3) { - var pow = this.m.add(new BN(1)).iushrn(2); - return this.pow(a, pow); - } - - // Tonelli-Shanks algorithm (Totally unoptimized and slow) - // - // Find Q and S, that Q * 2 ^ S = (P - 1) - var q = this.m.subn(1); - var s = 0; - while (!q.isZero() && q.andln(1) === 0) { - s++; - q.iushrn(1); - } - assert(!q.isZero()); - - var one = new BN(1).toRed(this); - var nOne = one.redNeg(); - - // Find quadratic non-residue - // NOTE: Max is such because of generalized Riemann hypothesis. - var lpow = this.m.subn(1).iushrn(1); - var z = this.m.bitLength(); - z = new BN(2 * z * z).toRed(this); - - while (this.pow(z, lpow).cmp(nOne) !== 0) { - z.redIAdd(nOne); - } - - var c = this.pow(z, q); - var r = this.pow(a, q.addn(1).iushrn(1)); - var t = this.pow(a, q); - var m = s; - while (t.cmp(one) !== 0) { - var tmp = t; - for (var i = 0; tmp.cmp(one) !== 0; i++) { - tmp = tmp.redSqr(); - } - assert(i < m); - var b = this.pow(c, new BN(1).iushln(m - i - 1)); - - r = r.redMul(b); - c = b.redSqr(); - t = t.redMul(c); - m = i; - } - - return r; - }; - - Red.prototype.invm = function invm (a) { - var inv = a._invmp(this.m); - if (inv.negative !== 0) { - inv.negative = 0; - return this.imod(inv).redNeg(); - } else { - return this.imod(inv); - } - }; - - Red.prototype.pow = function pow (a, num) { - if (num.isZero()) return new BN(1).toRed(this); - if (num.cmpn(1) === 0) return a.clone(); - - var windowSize = 4; - var wnd = new Array(1 << windowSize); - wnd[0] = new BN(1).toRed(this); - wnd[1] = a; - for (var i = 2; i < wnd.length; i++) { - wnd[i] = this.mul(wnd[i - 1], a); - } - - var res = wnd[0]; - var current = 0; - var currentLen = 0; - var start = num.bitLength() % 26; - if (start === 0) { - start = 26; - } - - for (i = num.length - 1; i >= 0; i--) { - var word = num.words[i]; - for (var j = start - 1; j >= 0; j--) { - var bit = (word >> j) & 1; - if (res !== wnd[0]) { - res = this.sqr(res); - } - - if (bit === 0 && current === 0) { - currentLen = 0; - continue; - } - - current <<= 1; - current |= bit; - currentLen++; - if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; - - res = this.mul(res, wnd[current]); - currentLen = 0; - current = 0; - } - start = 26; - } - - return res; - }; - - Red.prototype.convertTo = function convertTo (num) { - var r = num.umod(this.m); - - return r === num ? r.clone() : r; - }; - - Red.prototype.convertFrom = function convertFrom (num) { - var res = num.clone(); - res.red = null; - return res; - }; - - // - // Montgomery method engine - // - - BN.mont = function mont (num) { - return new Mont(num); - }; - - function Mont (m) { - Red.call(this, m); - - this.shift = this.m.bitLength(); - if (this.shift % 26 !== 0) { - this.shift += 26 - (this.shift % 26); - } - - this.r = new BN(1).iushln(this.shift); - this.r2 = this.imod(this.r.sqr()); - this.rinv = this.r._invmp(this.m); - - this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); - this.minv = this.minv.umod(this.r); - this.minv = this.r.sub(this.minv); - } - inherits(Mont, Red); - - Mont.prototype.convertTo = function convertTo (num) { - return this.imod(num.ushln(this.shift)); - }; - - Mont.prototype.convertFrom = function convertFrom (num) { - var r = this.imod(num.mul(this.rinv)); - r.red = null; - return r; - }; - - Mont.prototype.imul = function imul (a, b) { - if (a.isZero() || b.isZero()) { - a.words[0] = 0; - a.length = 1; - return a; - } - - var t = a.imul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.mul = function mul (a, b) { - if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); - - var t = a.mul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.invm = function invm (a) { - // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R - var res = this.imod(a._invmp(this.m).mul(this.r2)); - return res._forceRed(this); - }; -})( false || module, this); - - -/***/ }), - -/***/ "./node_modules/mime/Mime.js": -/*!***********************************!*\ - !*** ./node_modules/mime/Mime.js ***! - \***********************************/ -/***/ ((module) => { - -"use strict"; - - -/** - * @param typeMap [Object] Map of MIME type -> Array[extensions] - * @param ... - */ -function Mime() { - this._types = Object.create(null); - this._extensions = Object.create(null); - - for (let i = 0; i < arguments.length; i++) { - this.define(arguments[i]); - } - - this.define = this.define.bind(this); - this.getType = this.getType.bind(this); - this.getExtension = this.getExtension.bind(this); -} - -/** - * Define mimetype -> extension mappings. Each key is a mime-type that maps - * to an array of extensions associated with the type. The first extension is - * used as the default extension for the type. - * - * e.g. mime.define({'audio/ogg', ['oga', 'ogg', 'spx']}); - * - * If a type declares an extension that has already been defined, an error will - * be thrown. To suppress this error and force the extension to be associated - * with the new type, pass `force`=true. Alternatively, you may prefix the - * extension with "*" to map the type to extension, without mapping the - * extension to the type. - * - * e.g. mime.define({'audio/wav', ['wav']}, {'audio/x-wav', ['*wav']}); - * - * - * @param map (Object) type definitions - * @param force (Boolean) if true, force overriding of existing definitions - */ -Mime.prototype.define = function(typeMap, force) { - for (let type in typeMap) { - let extensions = typeMap[type].map(function(t) { - return t.toLowerCase(); - }); - type = type.toLowerCase(); - - for (let i = 0; i < extensions.length; i++) { - const ext = extensions[i]; - - // '*' prefix = not the preferred type for this extension. So fixup the - // extension, and skip it. - if (ext[0] === '*') { - continue; - } - - if (!force && (ext in this._types)) { - throw new Error( - 'Attempt to change mapping for "' + ext + - '" extension from "' + this._types[ext] + '" to "' + type + - '". Pass `force=true` to allow this, otherwise remove "' + ext + - '" from the list of extensions for "' + type + '".' - ); - } - - this._types[ext] = type; - } - - // Use first extension as default - if (force || !this._extensions[type]) { - const ext = extensions[0]; - this._extensions[type] = (ext[0] !== '*') ? ext : ext.substr(1); - } - } -}; - -/** - * Lookup a mime type based on extension - */ -Mime.prototype.getType = function(path) { - path = String(path); - let last = path.replace(/^.*[/\\]/, '').toLowerCase(); - let ext = last.replace(/^.*\./, '').toLowerCase(); - - let hasPath = last.length < path.length; - let hasDot = ext.length < last.length - 1; - - return (hasDot || !hasPath) && this._types[ext] || null; -}; - -/** - * Return file extension associated with a mime type - */ -Mime.prototype.getExtension = function(type) { - type = /^\s*([^;\s]*)/.test(type) && RegExp.$1; - return type && this._extensions[type.toLowerCase()] || null; -}; - -module.exports = Mime; - - -/***/ }), - -/***/ "./node_modules/mime/index.js": -/*!************************************!*\ - !*** ./node_modules/mime/index.js ***! - \************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -let Mime = __webpack_require__(/*! ./Mime */ "./node_modules/mime/Mime.js"); -module.exports = new Mime(__webpack_require__(/*! ./types/standard */ "./node_modules/mime/types/standard.js"), __webpack_require__(/*! ./types/other */ "./node_modules/mime/types/other.js")); - - -/***/ }), - -/***/ "./node_modules/mime/types/other.js": -/*!******************************************!*\ - !*** ./node_modules/mime/types/other.js ***! - \******************************************/ -/***/ ((module) => { - -module.exports = {"application/prs.cww":["cww"],"application/vnd.1000minds.decision-model+xml":["1km"],"application/vnd.3gpp.pic-bw-large":["plb"],"application/vnd.3gpp.pic-bw-small":["psb"],"application/vnd.3gpp.pic-bw-var":["pvb"],"application/vnd.3gpp2.tcap":["tcap"],"application/vnd.3m.post-it-notes":["pwn"],"application/vnd.accpac.simply.aso":["aso"],"application/vnd.accpac.simply.imp":["imp"],"application/vnd.acucobol":["acu"],"application/vnd.acucorp":["atc","acutc"],"application/vnd.adobe.air-application-installer-package+zip":["air"],"application/vnd.adobe.formscentral.fcdt":["fcdt"],"application/vnd.adobe.fxp":["fxp","fxpl"],"application/vnd.adobe.xdp+xml":["xdp"],"application/vnd.adobe.xfdf":["xfdf"],"application/vnd.ahead.space":["ahead"],"application/vnd.airzip.filesecure.azf":["azf"],"application/vnd.airzip.filesecure.azs":["azs"],"application/vnd.amazon.ebook":["azw"],"application/vnd.americandynamics.acc":["acc"],"application/vnd.amiga.ami":["ami"],"application/vnd.android.package-archive":["apk"],"application/vnd.anser-web-certificate-issue-initiation":["cii"],"application/vnd.anser-web-funds-transfer-initiation":["fti"],"application/vnd.antix.game-component":["atx"],"application/vnd.apple.installer+xml":["mpkg"],"application/vnd.apple.keynote":["key"],"application/vnd.apple.mpegurl":["m3u8"],"application/vnd.apple.numbers":["numbers"],"application/vnd.apple.pages":["pages"],"application/vnd.apple.pkpass":["pkpass"],"application/vnd.aristanetworks.swi":["swi"],"application/vnd.astraea-software.iota":["iota"],"application/vnd.audiograph":["aep"],"application/vnd.balsamiq.bmml+xml":["bmml"],"application/vnd.blueice.multipass":["mpm"],"application/vnd.bmi":["bmi"],"application/vnd.businessobjects":["rep"],"application/vnd.chemdraw+xml":["cdxml"],"application/vnd.chipnuts.karaoke-mmd":["mmd"],"application/vnd.cinderella":["cdy"],"application/vnd.citationstyles.style+xml":["csl"],"application/vnd.claymore":["cla"],"application/vnd.cloanto.rp9":["rp9"],"application/vnd.clonk.c4group":["c4g","c4d","c4f","c4p","c4u"],"application/vnd.cluetrust.cartomobile-config":["c11amc"],"application/vnd.cluetrust.cartomobile-config-pkg":["c11amz"],"application/vnd.commonspace":["csp"],"application/vnd.contact.cmsg":["cdbcmsg"],"application/vnd.cosmocaller":["cmc"],"application/vnd.crick.clicker":["clkx"],"application/vnd.crick.clicker.keyboard":["clkk"],"application/vnd.crick.clicker.palette":["clkp"],"application/vnd.crick.clicker.template":["clkt"],"application/vnd.crick.clicker.wordbank":["clkw"],"application/vnd.criticaltools.wbs+xml":["wbs"],"application/vnd.ctc-posml":["pml"],"application/vnd.cups-ppd":["ppd"],"application/vnd.curl.car":["car"],"application/vnd.curl.pcurl":["pcurl"],"application/vnd.dart":["dart"],"application/vnd.data-vision.rdz":["rdz"],"application/vnd.dbf":["dbf"],"application/vnd.dece.data":["uvf","uvvf","uvd","uvvd"],"application/vnd.dece.ttml+xml":["uvt","uvvt"],"application/vnd.dece.unspecified":["uvx","uvvx"],"application/vnd.dece.zip":["uvz","uvvz"],"application/vnd.denovo.fcselayout-link":["fe_launch"],"application/vnd.dna":["dna"],"application/vnd.dolby.mlp":["mlp"],"application/vnd.dpgraph":["dpg"],"application/vnd.dreamfactory":["dfac"],"application/vnd.ds-keypoint":["kpxx"],"application/vnd.dvb.ait":["ait"],"application/vnd.dvb.service":["svc"],"application/vnd.dynageo":["geo"],"application/vnd.ecowin.chart":["mag"],"application/vnd.enliven":["nml"],"application/vnd.epson.esf":["esf"],"application/vnd.epson.msf":["msf"],"application/vnd.epson.quickanime":["qam"],"application/vnd.epson.salt":["slt"],"application/vnd.epson.ssf":["ssf"],"application/vnd.eszigno3+xml":["es3","et3"],"application/vnd.ezpix-album":["ez2"],"application/vnd.ezpix-package":["ez3"],"application/vnd.fdf":["fdf"],"application/vnd.fdsn.mseed":["mseed"],"application/vnd.fdsn.seed":["seed","dataless"],"application/vnd.flographit":["gph"],"application/vnd.fluxtime.clip":["ftc"],"application/vnd.framemaker":["fm","frame","maker","book"],"application/vnd.frogans.fnc":["fnc"],"application/vnd.frogans.ltf":["ltf"],"application/vnd.fsc.weblaunch":["fsc"],"application/vnd.fujitsu.oasys":["oas"],"application/vnd.fujitsu.oasys2":["oa2"],"application/vnd.fujitsu.oasys3":["oa3"],"application/vnd.fujitsu.oasysgp":["fg5"],"application/vnd.fujitsu.oasysprs":["bh2"],"application/vnd.fujixerox.ddd":["ddd"],"application/vnd.fujixerox.docuworks":["xdw"],"application/vnd.fujixerox.docuworks.binder":["xbd"],"application/vnd.fuzzysheet":["fzs"],"application/vnd.genomatix.tuxedo":["txd"],"application/vnd.geogebra.file":["ggb"],"application/vnd.geogebra.tool":["ggt"],"application/vnd.geometry-explorer":["gex","gre"],"application/vnd.geonext":["gxt"],"application/vnd.geoplan":["g2w"],"application/vnd.geospace":["g3w"],"application/vnd.gmx":["gmx"],"application/vnd.google-apps.document":["gdoc"],"application/vnd.google-apps.presentation":["gslides"],"application/vnd.google-apps.spreadsheet":["gsheet"],"application/vnd.google-earth.kml+xml":["kml"],"application/vnd.google-earth.kmz":["kmz"],"application/vnd.grafeq":["gqf","gqs"],"application/vnd.groove-account":["gac"],"application/vnd.groove-help":["ghf"],"application/vnd.groove-identity-message":["gim"],"application/vnd.groove-injector":["grv"],"application/vnd.groove-tool-message":["gtm"],"application/vnd.groove-tool-template":["tpl"],"application/vnd.groove-vcard":["vcg"],"application/vnd.hal+xml":["hal"],"application/vnd.handheld-entertainment+xml":["zmm"],"application/vnd.hbci":["hbci"],"application/vnd.hhe.lesson-player":["les"],"application/vnd.hp-hpgl":["hpgl"],"application/vnd.hp-hpid":["hpid"],"application/vnd.hp-hps":["hps"],"application/vnd.hp-jlyt":["jlt"],"application/vnd.hp-pcl":["pcl"],"application/vnd.hp-pclxl":["pclxl"],"application/vnd.hydrostatix.sof-data":["sfd-hdstx"],"application/vnd.ibm.minipay":["mpy"],"application/vnd.ibm.modcap":["afp","listafp","list3820"],"application/vnd.ibm.rights-management":["irm"],"application/vnd.ibm.secure-container":["sc"],"application/vnd.iccprofile":["icc","icm"],"application/vnd.igloader":["igl"],"application/vnd.immervision-ivp":["ivp"],"application/vnd.immervision-ivu":["ivu"],"application/vnd.insors.igm":["igm"],"application/vnd.intercon.formnet":["xpw","xpx"],"application/vnd.intergeo":["i2g"],"application/vnd.intu.qbo":["qbo"],"application/vnd.intu.qfx":["qfx"],"application/vnd.ipunplugged.rcprofile":["rcprofile"],"application/vnd.irepository.package+xml":["irp"],"application/vnd.is-xpr":["xpr"],"application/vnd.isac.fcs":["fcs"],"application/vnd.jam":["jam"],"application/vnd.jcp.javame.midlet-rms":["rms"],"application/vnd.jisp":["jisp"],"application/vnd.joost.joda-archive":["joda"],"application/vnd.kahootz":["ktz","ktr"],"application/vnd.kde.karbon":["karbon"],"application/vnd.kde.kchart":["chrt"],"application/vnd.kde.kformula":["kfo"],"application/vnd.kde.kivio":["flw"],"application/vnd.kde.kontour":["kon"],"application/vnd.kde.kpresenter":["kpr","kpt"],"application/vnd.kde.kspread":["ksp"],"application/vnd.kde.kword":["kwd","kwt"],"application/vnd.kenameaapp":["htke"],"application/vnd.kidspiration":["kia"],"application/vnd.kinar":["kne","knp"],"application/vnd.koan":["skp","skd","skt","skm"],"application/vnd.kodak-descriptor":["sse"],"application/vnd.las.las+xml":["lasxml"],"application/vnd.llamagraphics.life-balance.desktop":["lbd"],"application/vnd.llamagraphics.life-balance.exchange+xml":["lbe"],"application/vnd.lotus-1-2-3":["123"],"application/vnd.lotus-approach":["apr"],"application/vnd.lotus-freelance":["pre"],"application/vnd.lotus-notes":["nsf"],"application/vnd.lotus-organizer":["org"],"application/vnd.lotus-screencam":["scm"],"application/vnd.lotus-wordpro":["lwp"],"application/vnd.macports.portpkg":["portpkg"],"application/vnd.mcd":["mcd"],"application/vnd.medcalcdata":["mc1"],"application/vnd.mediastation.cdkey":["cdkey"],"application/vnd.mfer":["mwf"],"application/vnd.mfmp":["mfm"],"application/vnd.micrografx.flo":["flo"],"application/vnd.micrografx.igx":["igx"],"application/vnd.mif":["mif"],"application/vnd.mobius.daf":["daf"],"application/vnd.mobius.dis":["dis"],"application/vnd.mobius.mbk":["mbk"],"application/vnd.mobius.mqy":["mqy"],"application/vnd.mobius.msl":["msl"],"application/vnd.mobius.plc":["plc"],"application/vnd.mobius.txf":["txf"],"application/vnd.mophun.application":["mpn"],"application/vnd.mophun.certificate":["mpc"],"application/vnd.mozilla.xul+xml":["xul"],"application/vnd.ms-artgalry":["cil"],"application/vnd.ms-cab-compressed":["cab"],"application/vnd.ms-excel":["xls","xlm","xla","xlc","xlt","xlw"],"application/vnd.ms-excel.addin.macroenabled.12":["xlam"],"application/vnd.ms-excel.sheet.binary.macroenabled.12":["xlsb"],"application/vnd.ms-excel.sheet.macroenabled.12":["xlsm"],"application/vnd.ms-excel.template.macroenabled.12":["xltm"],"application/vnd.ms-fontobject":["eot"],"application/vnd.ms-htmlhelp":["chm"],"application/vnd.ms-ims":["ims"],"application/vnd.ms-lrm":["lrm"],"application/vnd.ms-officetheme":["thmx"],"application/vnd.ms-outlook":["msg"],"application/vnd.ms-pki.seccat":["cat"],"application/vnd.ms-pki.stl":["*stl"],"application/vnd.ms-powerpoint":["ppt","pps","pot"],"application/vnd.ms-powerpoint.addin.macroenabled.12":["ppam"],"application/vnd.ms-powerpoint.presentation.macroenabled.12":["pptm"],"application/vnd.ms-powerpoint.slide.macroenabled.12":["sldm"],"application/vnd.ms-powerpoint.slideshow.macroenabled.12":["ppsm"],"application/vnd.ms-powerpoint.template.macroenabled.12":["potm"],"application/vnd.ms-project":["mpp","mpt"],"application/vnd.ms-word.document.macroenabled.12":["docm"],"application/vnd.ms-word.template.macroenabled.12":["dotm"],"application/vnd.ms-works":["wps","wks","wcm","wdb"],"application/vnd.ms-wpl":["wpl"],"application/vnd.ms-xpsdocument":["xps"],"application/vnd.mseq":["mseq"],"application/vnd.musician":["mus"],"application/vnd.muvee.style":["msty"],"application/vnd.mynfc":["taglet"],"application/vnd.neurolanguage.nlu":["nlu"],"application/vnd.nitf":["ntf","nitf"],"application/vnd.noblenet-directory":["nnd"],"application/vnd.noblenet-sealer":["nns"],"application/vnd.noblenet-web":["nnw"],"application/vnd.nokia.n-gage.ac+xml":["*ac"],"application/vnd.nokia.n-gage.data":["ngdat"],"application/vnd.nokia.n-gage.symbian.install":["n-gage"],"application/vnd.nokia.radio-preset":["rpst"],"application/vnd.nokia.radio-presets":["rpss"],"application/vnd.novadigm.edm":["edm"],"application/vnd.novadigm.edx":["edx"],"application/vnd.novadigm.ext":["ext"],"application/vnd.oasis.opendocument.chart":["odc"],"application/vnd.oasis.opendocument.chart-template":["otc"],"application/vnd.oasis.opendocument.database":["odb"],"application/vnd.oasis.opendocument.formula":["odf"],"application/vnd.oasis.opendocument.formula-template":["odft"],"application/vnd.oasis.opendocument.graphics":["odg"],"application/vnd.oasis.opendocument.graphics-template":["otg"],"application/vnd.oasis.opendocument.image":["odi"],"application/vnd.oasis.opendocument.image-template":["oti"],"application/vnd.oasis.opendocument.presentation":["odp"],"application/vnd.oasis.opendocument.presentation-template":["otp"],"application/vnd.oasis.opendocument.spreadsheet":["ods"],"application/vnd.oasis.opendocument.spreadsheet-template":["ots"],"application/vnd.oasis.opendocument.text":["odt"],"application/vnd.oasis.opendocument.text-master":["odm"],"application/vnd.oasis.opendocument.text-template":["ott"],"application/vnd.oasis.opendocument.text-web":["oth"],"application/vnd.olpc-sugar":["xo"],"application/vnd.oma.dd2+xml":["dd2"],"application/vnd.openblox.game+xml":["obgx"],"application/vnd.openofficeorg.extension":["oxt"],"application/vnd.openstreetmap.data+xml":["osm"],"application/vnd.openxmlformats-officedocument.presentationml.presentation":["pptx"],"application/vnd.openxmlformats-officedocument.presentationml.slide":["sldx"],"application/vnd.openxmlformats-officedocument.presentationml.slideshow":["ppsx"],"application/vnd.openxmlformats-officedocument.presentationml.template":["potx"],"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet":["xlsx"],"application/vnd.openxmlformats-officedocument.spreadsheetml.template":["xltx"],"application/vnd.openxmlformats-officedocument.wordprocessingml.document":["docx"],"application/vnd.openxmlformats-officedocument.wordprocessingml.template":["dotx"],"application/vnd.osgeo.mapguide.package":["mgp"],"application/vnd.osgi.dp":["dp"],"application/vnd.osgi.subsystem":["esa"],"application/vnd.palm":["pdb","pqa","oprc"],"application/vnd.pawaafile":["paw"],"application/vnd.pg.format":["str"],"application/vnd.pg.osasli":["ei6"],"application/vnd.picsel":["efif"],"application/vnd.pmi.widget":["wg"],"application/vnd.pocketlearn":["plf"],"application/vnd.powerbuilder6":["pbd"],"application/vnd.previewsystems.box":["box"],"application/vnd.proteus.magazine":["mgz"],"application/vnd.publishare-delta-tree":["qps"],"application/vnd.pvi.ptid1":["ptid"],"application/vnd.quark.quarkxpress":["qxd","qxt","qwd","qwt","qxl","qxb"],"application/vnd.rar":["rar"],"application/vnd.realvnc.bed":["bed"],"application/vnd.recordare.musicxml":["mxl"],"application/vnd.recordare.musicxml+xml":["musicxml"],"application/vnd.rig.cryptonote":["cryptonote"],"application/vnd.rim.cod":["cod"],"application/vnd.rn-realmedia":["rm"],"application/vnd.rn-realmedia-vbr":["rmvb"],"application/vnd.route66.link66+xml":["link66"],"application/vnd.sailingtracker.track":["st"],"application/vnd.seemail":["see"],"application/vnd.sema":["sema"],"application/vnd.semd":["semd"],"application/vnd.semf":["semf"],"application/vnd.shana.informed.formdata":["ifm"],"application/vnd.shana.informed.formtemplate":["itp"],"application/vnd.shana.informed.interchange":["iif"],"application/vnd.shana.informed.package":["ipk"],"application/vnd.simtech-mindmapper":["twd","twds"],"application/vnd.smaf":["mmf"],"application/vnd.smart.teacher":["teacher"],"application/vnd.software602.filler.form+xml":["fo"],"application/vnd.solent.sdkm+xml":["sdkm","sdkd"],"application/vnd.spotfire.dxp":["dxp"],"application/vnd.spotfire.sfs":["sfs"],"application/vnd.stardivision.calc":["sdc"],"application/vnd.stardivision.draw":["sda"],"application/vnd.stardivision.impress":["sdd"],"application/vnd.stardivision.math":["smf"],"application/vnd.stardivision.writer":["sdw","vor"],"application/vnd.stardivision.writer-global":["sgl"],"application/vnd.stepmania.package":["smzip"],"application/vnd.stepmania.stepchart":["sm"],"application/vnd.sun.wadl+xml":["wadl"],"application/vnd.sun.xml.calc":["sxc"],"application/vnd.sun.xml.calc.template":["stc"],"application/vnd.sun.xml.draw":["sxd"],"application/vnd.sun.xml.draw.template":["std"],"application/vnd.sun.xml.impress":["sxi"],"application/vnd.sun.xml.impress.template":["sti"],"application/vnd.sun.xml.math":["sxm"],"application/vnd.sun.xml.writer":["sxw"],"application/vnd.sun.xml.writer.global":["sxg"],"application/vnd.sun.xml.writer.template":["stw"],"application/vnd.sus-calendar":["sus","susp"],"application/vnd.svd":["svd"],"application/vnd.symbian.install":["sis","sisx"],"application/vnd.syncml+xml":["xsm"],"application/vnd.syncml.dm+wbxml":["bdm"],"application/vnd.syncml.dm+xml":["xdm"],"application/vnd.syncml.dmddf+xml":["ddf"],"application/vnd.tao.intent-module-archive":["tao"],"application/vnd.tcpdump.pcap":["pcap","cap","dmp"],"application/vnd.tmobile-livetv":["tmo"],"application/vnd.trid.tpt":["tpt"],"application/vnd.triscape.mxs":["mxs"],"application/vnd.trueapp":["tra"],"application/vnd.ufdl":["ufd","ufdl"],"application/vnd.uiq.theme":["utz"],"application/vnd.umajin":["umj"],"application/vnd.unity":["unityweb"],"application/vnd.uoml+xml":["uoml"],"application/vnd.vcx":["vcx"],"application/vnd.visio":["vsd","vst","vss","vsw"],"application/vnd.visionary":["vis"],"application/vnd.vsf":["vsf"],"application/vnd.wap.wbxml":["wbxml"],"application/vnd.wap.wmlc":["wmlc"],"application/vnd.wap.wmlscriptc":["wmlsc"],"application/vnd.webturbo":["wtb"],"application/vnd.wolfram.player":["nbp"],"application/vnd.wordperfect":["wpd"],"application/vnd.wqd":["wqd"],"application/vnd.wt.stf":["stf"],"application/vnd.xara":["xar"],"application/vnd.xfdl":["xfdl"],"application/vnd.yamaha.hv-dic":["hvd"],"application/vnd.yamaha.hv-script":["hvs"],"application/vnd.yamaha.hv-voice":["hvp"],"application/vnd.yamaha.openscoreformat":["osf"],"application/vnd.yamaha.openscoreformat.osfpvg+xml":["osfpvg"],"application/vnd.yamaha.smaf-audio":["saf"],"application/vnd.yamaha.smaf-phrase":["spf"],"application/vnd.yellowriver-custom-menu":["cmp"],"application/vnd.zul":["zir","zirz"],"application/vnd.zzazz.deck+xml":["zaz"],"application/x-7z-compressed":["7z"],"application/x-abiword":["abw"],"application/x-ace-compressed":["ace"],"application/x-apple-diskimage":["*dmg"],"application/x-arj":["arj"],"application/x-authorware-bin":["aab","x32","u32","vox"],"application/x-authorware-map":["aam"],"application/x-authorware-seg":["aas"],"application/x-bcpio":["bcpio"],"application/x-bdoc":["*bdoc"],"application/x-bittorrent":["torrent"],"application/x-blorb":["blb","blorb"],"application/x-bzip":["bz"],"application/x-bzip2":["bz2","boz"],"application/x-cbr":["cbr","cba","cbt","cbz","cb7"],"application/x-cdlink":["vcd"],"application/x-cfs-compressed":["cfs"],"application/x-chat":["chat"],"application/x-chess-pgn":["pgn"],"application/x-chrome-extension":["crx"],"application/x-cocoa":["cco"],"application/x-conference":["nsc"],"application/x-cpio":["cpio"],"application/x-csh":["csh"],"application/x-debian-package":["*deb","udeb"],"application/x-dgc-compressed":["dgc"],"application/x-director":["dir","dcr","dxr","cst","cct","cxt","w3d","fgd","swa"],"application/x-doom":["wad"],"application/x-dtbncx+xml":["ncx"],"application/x-dtbook+xml":["dtb"],"application/x-dtbresource+xml":["res"],"application/x-dvi":["dvi"],"application/x-envoy":["evy"],"application/x-eva":["eva"],"application/x-font-bdf":["bdf"],"application/x-font-ghostscript":["gsf"],"application/x-font-linux-psf":["psf"],"application/x-font-pcf":["pcf"],"application/x-font-snf":["snf"],"application/x-font-type1":["pfa","pfb","pfm","afm"],"application/x-freearc":["arc"],"application/x-futuresplash":["spl"],"application/x-gca-compressed":["gca"],"application/x-glulx":["ulx"],"application/x-gnumeric":["gnumeric"],"application/x-gramps-xml":["gramps"],"application/x-gtar":["gtar"],"application/x-hdf":["hdf"],"application/x-httpd-php":["php"],"application/x-install-instructions":["install"],"application/x-iso9660-image":["*iso"],"application/x-java-archive-diff":["jardiff"],"application/x-java-jnlp-file":["jnlp"],"application/x-keepass2":["kdbx"],"application/x-latex":["latex"],"application/x-lua-bytecode":["luac"],"application/x-lzh-compressed":["lzh","lha"],"application/x-makeself":["run"],"application/x-mie":["mie"],"application/x-mobipocket-ebook":["prc","mobi"],"application/x-ms-application":["application"],"application/x-ms-shortcut":["lnk"],"application/x-ms-wmd":["wmd"],"application/x-ms-wmz":["wmz"],"application/x-ms-xbap":["xbap"],"application/x-msaccess":["mdb"],"application/x-msbinder":["obd"],"application/x-mscardfile":["crd"],"application/x-msclip":["clp"],"application/x-msdos-program":["*exe"],"application/x-msdownload":["*exe","*dll","com","bat","*msi"],"application/x-msmediaview":["mvb","m13","m14"],"application/x-msmetafile":["*wmf","*wmz","*emf","emz"],"application/x-msmoney":["mny"],"application/x-mspublisher":["pub"],"application/x-msschedule":["scd"],"application/x-msterminal":["trm"],"application/x-mswrite":["wri"],"application/x-netcdf":["nc","cdf"],"application/x-ns-proxy-autoconfig":["pac"],"application/x-nzb":["nzb"],"application/x-perl":["pl","pm"],"application/x-pilot":["*prc","*pdb"],"application/x-pkcs12":["p12","pfx"],"application/x-pkcs7-certificates":["p7b","spc"],"application/x-pkcs7-certreqresp":["p7r"],"application/x-rar-compressed":["*rar"],"application/x-redhat-package-manager":["rpm"],"application/x-research-info-systems":["ris"],"application/x-sea":["sea"],"application/x-sh":["sh"],"application/x-shar":["shar"],"application/x-shockwave-flash":["swf"],"application/x-silverlight-app":["xap"],"application/x-sql":["sql"],"application/x-stuffit":["sit"],"application/x-stuffitx":["sitx"],"application/x-subrip":["srt"],"application/x-sv4cpio":["sv4cpio"],"application/x-sv4crc":["sv4crc"],"application/x-t3vm-image":["t3"],"application/x-tads":["gam"],"application/x-tar":["tar"],"application/x-tcl":["tcl","tk"],"application/x-tex":["tex"],"application/x-tex-tfm":["tfm"],"application/x-texinfo":["texinfo","texi"],"application/x-tgif":["*obj"],"application/x-ustar":["ustar"],"application/x-virtualbox-hdd":["hdd"],"application/x-virtualbox-ova":["ova"],"application/x-virtualbox-ovf":["ovf"],"application/x-virtualbox-vbox":["vbox"],"application/x-virtualbox-vbox-extpack":["vbox-extpack"],"application/x-virtualbox-vdi":["vdi"],"application/x-virtualbox-vhd":["vhd"],"application/x-virtualbox-vmdk":["vmdk"],"application/x-wais-source":["src"],"application/x-web-app-manifest+json":["webapp"],"application/x-x509-ca-cert":["der","crt","pem"],"application/x-xfig":["fig"],"application/x-xliff+xml":["*xlf"],"application/x-xpinstall":["xpi"],"application/x-xz":["xz"],"application/x-zmachine":["z1","z2","z3","z4","z5","z6","z7","z8"],"audio/vnd.dece.audio":["uva","uvva"],"audio/vnd.digital-winds":["eol"],"audio/vnd.dra":["dra"],"audio/vnd.dts":["dts"],"audio/vnd.dts.hd":["dtshd"],"audio/vnd.lucent.voice":["lvp"],"audio/vnd.ms-playready.media.pya":["pya"],"audio/vnd.nuera.ecelp4800":["ecelp4800"],"audio/vnd.nuera.ecelp7470":["ecelp7470"],"audio/vnd.nuera.ecelp9600":["ecelp9600"],"audio/vnd.rip":["rip"],"audio/x-aac":["aac"],"audio/x-aiff":["aif","aiff","aifc"],"audio/x-caf":["caf"],"audio/x-flac":["flac"],"audio/x-m4a":["*m4a"],"audio/x-matroska":["mka"],"audio/x-mpegurl":["m3u"],"audio/x-ms-wax":["wax"],"audio/x-ms-wma":["wma"],"audio/x-pn-realaudio":["ram","ra"],"audio/x-pn-realaudio-plugin":["rmp"],"audio/x-realaudio":["*ra"],"audio/x-wav":["*wav"],"chemical/x-cdx":["cdx"],"chemical/x-cif":["cif"],"chemical/x-cmdf":["cmdf"],"chemical/x-cml":["cml"],"chemical/x-csml":["csml"],"chemical/x-xyz":["xyz"],"image/prs.btif":["btif"],"image/prs.pti":["pti"],"image/vnd.adobe.photoshop":["psd"],"image/vnd.airzip.accelerator.azv":["azv"],"image/vnd.dece.graphic":["uvi","uvvi","uvg","uvvg"],"image/vnd.djvu":["djvu","djv"],"image/vnd.dvb.subtitle":["*sub"],"image/vnd.dwg":["dwg"],"image/vnd.dxf":["dxf"],"image/vnd.fastbidsheet":["fbs"],"image/vnd.fpx":["fpx"],"image/vnd.fst":["fst"],"image/vnd.fujixerox.edmics-mmr":["mmr"],"image/vnd.fujixerox.edmics-rlc":["rlc"],"image/vnd.microsoft.icon":["ico"],"image/vnd.ms-dds":["dds"],"image/vnd.ms-modi":["mdi"],"image/vnd.ms-photo":["wdp"],"image/vnd.net-fpx":["npx"],"image/vnd.pco.b16":["b16"],"image/vnd.tencent.tap":["tap"],"image/vnd.valve.source.texture":["vtf"],"image/vnd.wap.wbmp":["wbmp"],"image/vnd.xiff":["xif"],"image/vnd.zbrush.pcx":["pcx"],"image/x-3ds":["3ds"],"image/x-cmu-raster":["ras"],"image/x-cmx":["cmx"],"image/x-freehand":["fh","fhc","fh4","fh5","fh7"],"image/x-icon":["*ico"],"image/x-jng":["jng"],"image/x-mrsid-image":["sid"],"image/x-ms-bmp":["*bmp"],"image/x-pcx":["*pcx"],"image/x-pict":["pic","pct"],"image/x-portable-anymap":["pnm"],"image/x-portable-bitmap":["pbm"],"image/x-portable-graymap":["pgm"],"image/x-portable-pixmap":["ppm"],"image/x-rgb":["rgb"],"image/x-tga":["tga"],"image/x-xbitmap":["xbm"],"image/x-xpixmap":["xpm"],"image/x-xwindowdump":["xwd"],"message/vnd.wfa.wsc":["wsc"],"model/vnd.collada+xml":["dae"],"model/vnd.dwf":["dwf"],"model/vnd.gdl":["gdl"],"model/vnd.gtw":["gtw"],"model/vnd.mts":["mts"],"model/vnd.opengex":["ogex"],"model/vnd.parasolid.transmit.binary":["x_b"],"model/vnd.parasolid.transmit.text":["x_t"],"model/vnd.usdz+zip":["usdz"],"model/vnd.valve.source.compiled-map":["bsp"],"model/vnd.vtu":["vtu"],"text/prs.lines.tag":["dsc"],"text/vnd.curl":["curl"],"text/vnd.curl.dcurl":["dcurl"],"text/vnd.curl.mcurl":["mcurl"],"text/vnd.curl.scurl":["scurl"],"text/vnd.dvb.subtitle":["sub"],"text/vnd.fly":["fly"],"text/vnd.fmi.flexstor":["flx"],"text/vnd.graphviz":["gv"],"text/vnd.in3d.3dml":["3dml"],"text/vnd.in3d.spot":["spot"],"text/vnd.sun.j2me.app-descriptor":["jad"],"text/vnd.wap.wml":["wml"],"text/vnd.wap.wmlscript":["wmls"],"text/x-asm":["s","asm"],"text/x-c":["c","cc","cxx","cpp","h","hh","dic"],"text/x-component":["htc"],"text/x-fortran":["f","for","f77","f90"],"text/x-handlebars-template":["hbs"],"text/x-java-source":["java"],"text/x-lua":["lua"],"text/x-markdown":["mkd"],"text/x-nfo":["nfo"],"text/x-opml":["opml"],"text/x-org":["*org"],"text/x-pascal":["p","pas"],"text/x-processing":["pde"],"text/x-sass":["sass"],"text/x-scss":["scss"],"text/x-setext":["etx"],"text/x-sfv":["sfv"],"text/x-suse-ymp":["ymp"],"text/x-uuencode":["uu"],"text/x-vcalendar":["vcs"],"text/x-vcard":["vcf"],"video/vnd.dece.hd":["uvh","uvvh"],"video/vnd.dece.mobile":["uvm","uvvm"],"video/vnd.dece.pd":["uvp","uvvp"],"video/vnd.dece.sd":["uvs","uvvs"],"video/vnd.dece.video":["uvv","uvvv"],"video/vnd.dvb.file":["dvb"],"video/vnd.fvt":["fvt"],"video/vnd.mpegurl":["mxu","m4u"],"video/vnd.ms-playready.media.pyv":["pyv"],"video/vnd.uvvu.mp4":["uvu","uvvu"],"video/vnd.vivo":["viv"],"video/x-f4v":["f4v"],"video/x-fli":["fli"],"video/x-flv":["flv"],"video/x-m4v":["m4v"],"video/x-matroska":["mkv","mk3d","mks"],"video/x-mng":["mng"],"video/x-ms-asf":["asf","asx"],"video/x-ms-vob":["vob"],"video/x-ms-wm":["wm"],"video/x-ms-wmv":["wmv"],"video/x-ms-wmx":["wmx"],"video/x-ms-wvx":["wvx"],"video/x-msvideo":["avi"],"video/x-sgi-movie":["movie"],"video/x-smv":["smv"],"x-conference/x-cooltalk":["ice"]}; - -/***/ }), - -/***/ "./node_modules/mime/types/standard.js": -/*!*********************************************!*\ - !*** ./node_modules/mime/types/standard.js ***! - \*********************************************/ -/***/ ((module) => { - -module.exports = {"application/andrew-inset":["ez"],"application/applixware":["aw"],"application/atom+xml":["atom"],"application/atomcat+xml":["atomcat"],"application/atomdeleted+xml":["atomdeleted"],"application/atomsvc+xml":["atomsvc"],"application/atsc-dwd+xml":["dwd"],"application/atsc-held+xml":["held"],"application/atsc-rsat+xml":["rsat"],"application/bdoc":["bdoc"],"application/calendar+xml":["xcs"],"application/ccxml+xml":["ccxml"],"application/cdfx+xml":["cdfx"],"application/cdmi-capability":["cdmia"],"application/cdmi-container":["cdmic"],"application/cdmi-domain":["cdmid"],"application/cdmi-object":["cdmio"],"application/cdmi-queue":["cdmiq"],"application/cu-seeme":["cu"],"application/dash+xml":["mpd"],"application/davmount+xml":["davmount"],"application/docbook+xml":["dbk"],"application/dssc+der":["dssc"],"application/dssc+xml":["xdssc"],"application/ecmascript":["ecma","es"],"application/emma+xml":["emma"],"application/emotionml+xml":["emotionml"],"application/epub+zip":["epub"],"application/exi":["exi"],"application/fdt+xml":["fdt"],"application/font-tdpfr":["pfr"],"application/geo+json":["geojson"],"application/gml+xml":["gml"],"application/gpx+xml":["gpx"],"application/gxf":["gxf"],"application/gzip":["gz"],"application/hjson":["hjson"],"application/hyperstudio":["stk"],"application/inkml+xml":["ink","inkml"],"application/ipfix":["ipfix"],"application/its+xml":["its"],"application/java-archive":["jar","war","ear"],"application/java-serialized-object":["ser"],"application/java-vm":["class"],"application/javascript":["js","mjs"],"application/json":["json","map"],"application/json5":["json5"],"application/jsonml+json":["jsonml"],"application/ld+json":["jsonld"],"application/lgr+xml":["lgr"],"application/lost+xml":["lostxml"],"application/mac-binhex40":["hqx"],"application/mac-compactpro":["cpt"],"application/mads+xml":["mads"],"application/manifest+json":["webmanifest"],"application/marc":["mrc"],"application/marcxml+xml":["mrcx"],"application/mathematica":["ma","nb","mb"],"application/mathml+xml":["mathml"],"application/mbox":["mbox"],"application/mediaservercontrol+xml":["mscml"],"application/metalink+xml":["metalink"],"application/metalink4+xml":["meta4"],"application/mets+xml":["mets"],"application/mmt-aei+xml":["maei"],"application/mmt-usd+xml":["musd"],"application/mods+xml":["mods"],"application/mp21":["m21","mp21"],"application/mp4":["mp4s","m4p"],"application/mrb-consumer+xml":["*xdf"],"application/mrb-publish+xml":["*xdf"],"application/msword":["doc","dot"],"application/mxf":["mxf"],"application/n-quads":["nq"],"application/n-triples":["nt"],"application/node":["cjs"],"application/octet-stream":["bin","dms","lrf","mar","so","dist","distz","pkg","bpk","dump","elc","deploy","exe","dll","deb","dmg","iso","img","msi","msp","msm","buffer"],"application/oda":["oda"],"application/oebps-package+xml":["opf"],"application/ogg":["ogx"],"application/omdoc+xml":["omdoc"],"application/onenote":["onetoc","onetoc2","onetmp","onepkg"],"application/oxps":["oxps"],"application/p2p-overlay+xml":["relo"],"application/patch-ops-error+xml":["*xer"],"application/pdf":["pdf"],"application/pgp-encrypted":["pgp"],"application/pgp-signature":["asc","sig"],"application/pics-rules":["prf"],"application/pkcs10":["p10"],"application/pkcs7-mime":["p7m","p7c"],"application/pkcs7-signature":["p7s"],"application/pkcs8":["p8"],"application/pkix-attr-cert":["ac"],"application/pkix-cert":["cer"],"application/pkix-crl":["crl"],"application/pkix-pkipath":["pkipath"],"application/pkixcmp":["pki"],"application/pls+xml":["pls"],"application/postscript":["ai","eps","ps"],"application/provenance+xml":["provx"],"application/pskc+xml":["pskcxml"],"application/raml+yaml":["raml"],"application/rdf+xml":["rdf","owl"],"application/reginfo+xml":["rif"],"application/relax-ng-compact-syntax":["rnc"],"application/resource-lists+xml":["rl"],"application/resource-lists-diff+xml":["rld"],"application/rls-services+xml":["rs"],"application/route-apd+xml":["rapd"],"application/route-s-tsid+xml":["sls"],"application/route-usd+xml":["rusd"],"application/rpki-ghostbusters":["gbr"],"application/rpki-manifest":["mft"],"application/rpki-roa":["roa"],"application/rsd+xml":["rsd"],"application/rss+xml":["rss"],"application/rtf":["rtf"],"application/sbml+xml":["sbml"],"application/scvp-cv-request":["scq"],"application/scvp-cv-response":["scs"],"application/scvp-vp-request":["spq"],"application/scvp-vp-response":["spp"],"application/sdp":["sdp"],"application/senml+xml":["senmlx"],"application/sensml+xml":["sensmlx"],"application/set-payment-initiation":["setpay"],"application/set-registration-initiation":["setreg"],"application/shf+xml":["shf"],"application/sieve":["siv","sieve"],"application/smil+xml":["smi","smil"],"application/sparql-query":["rq"],"application/sparql-results+xml":["srx"],"application/srgs":["gram"],"application/srgs+xml":["grxml"],"application/sru+xml":["sru"],"application/ssdl+xml":["ssdl"],"application/ssml+xml":["ssml"],"application/swid+xml":["swidtag"],"application/tei+xml":["tei","teicorpus"],"application/thraud+xml":["tfi"],"application/timestamped-data":["tsd"],"application/toml":["toml"],"application/ttml+xml":["ttml"],"application/ubjson":["ubj"],"application/urc-ressheet+xml":["rsheet"],"application/urc-targetdesc+xml":["td"],"application/voicexml+xml":["vxml"],"application/wasm":["wasm"],"application/widget":["wgt"],"application/winhlp":["hlp"],"application/wsdl+xml":["wsdl"],"application/wspolicy+xml":["wspolicy"],"application/xaml+xml":["xaml"],"application/xcap-att+xml":["xav"],"application/xcap-caps+xml":["xca"],"application/xcap-diff+xml":["xdf"],"application/xcap-el+xml":["xel"],"application/xcap-error+xml":["xer"],"application/xcap-ns+xml":["xns"],"application/xenc+xml":["xenc"],"application/xhtml+xml":["xhtml","xht"],"application/xliff+xml":["xlf"],"application/xml":["xml","xsl","xsd","rng"],"application/xml-dtd":["dtd"],"application/xop+xml":["xop"],"application/xproc+xml":["xpl"],"application/xslt+xml":["*xsl","xslt"],"application/xspf+xml":["xspf"],"application/xv+xml":["mxml","xhvml","xvml","xvm"],"application/yang":["yang"],"application/yin+xml":["yin"],"application/zip":["zip"],"audio/3gpp":["*3gpp"],"audio/adpcm":["adp"],"audio/amr":["amr"],"audio/basic":["au","snd"],"audio/midi":["mid","midi","kar","rmi"],"audio/mobile-xmf":["mxmf"],"audio/mp3":["*mp3"],"audio/mp4":["m4a","mp4a"],"audio/mpeg":["mpga","mp2","mp2a","mp3","m2a","m3a"],"audio/ogg":["oga","ogg","spx","opus"],"audio/s3m":["s3m"],"audio/silk":["sil"],"audio/wav":["wav"],"audio/wave":["*wav"],"audio/webm":["weba"],"audio/xm":["xm"],"font/collection":["ttc"],"font/otf":["otf"],"font/ttf":["ttf"],"font/woff":["woff"],"font/woff2":["woff2"],"image/aces":["exr"],"image/apng":["apng"],"image/avif":["avif"],"image/bmp":["bmp"],"image/cgm":["cgm"],"image/dicom-rle":["drle"],"image/emf":["emf"],"image/fits":["fits"],"image/g3fax":["g3"],"image/gif":["gif"],"image/heic":["heic"],"image/heic-sequence":["heics"],"image/heif":["heif"],"image/heif-sequence":["heifs"],"image/hej2k":["hej2"],"image/hsj2":["hsj2"],"image/ief":["ief"],"image/jls":["jls"],"image/jp2":["jp2","jpg2"],"image/jpeg":["jpeg","jpg","jpe"],"image/jph":["jph"],"image/jphc":["jhc"],"image/jpm":["jpm"],"image/jpx":["jpx","jpf"],"image/jxr":["jxr"],"image/jxra":["jxra"],"image/jxrs":["jxrs"],"image/jxs":["jxs"],"image/jxsc":["jxsc"],"image/jxsi":["jxsi"],"image/jxss":["jxss"],"image/ktx":["ktx"],"image/ktx2":["ktx2"],"image/png":["png"],"image/sgi":["sgi"],"image/svg+xml":["svg","svgz"],"image/t38":["t38"],"image/tiff":["tif","tiff"],"image/tiff-fx":["tfx"],"image/webp":["webp"],"image/wmf":["wmf"],"message/disposition-notification":["disposition-notification"],"message/global":["u8msg"],"message/global-delivery-status":["u8dsn"],"message/global-disposition-notification":["u8mdn"],"message/global-headers":["u8hdr"],"message/rfc822":["eml","mime"],"model/3mf":["3mf"],"model/gltf+json":["gltf"],"model/gltf-binary":["glb"],"model/iges":["igs","iges"],"model/mesh":["msh","mesh","silo"],"model/mtl":["mtl"],"model/obj":["obj"],"model/stl":["stl"],"model/vrml":["wrl","vrml"],"model/x3d+binary":["*x3db","x3dbz"],"model/x3d+fastinfoset":["x3db"],"model/x3d+vrml":["*x3dv","x3dvz"],"model/x3d+xml":["x3d","x3dz"],"model/x3d-vrml":["x3dv"],"text/cache-manifest":["appcache","manifest"],"text/calendar":["ics","ifb"],"text/coffeescript":["coffee","litcoffee"],"text/css":["css"],"text/csv":["csv"],"text/html":["html","htm","shtml"],"text/jade":["jade"],"text/jsx":["jsx"],"text/less":["less"],"text/markdown":["markdown","md"],"text/mathml":["mml"],"text/mdx":["mdx"],"text/n3":["n3"],"text/plain":["txt","text","conf","def","list","log","in","ini"],"text/richtext":["rtx"],"text/rtf":["*rtf"],"text/sgml":["sgml","sgm"],"text/shex":["shex"],"text/slim":["slim","slm"],"text/spdx":["spdx"],"text/stylus":["stylus","styl"],"text/tab-separated-values":["tsv"],"text/troff":["t","tr","roff","man","me","ms"],"text/turtle":["ttl"],"text/uri-list":["uri","uris","urls"],"text/vcard":["vcard"],"text/vtt":["vtt"],"text/xml":["*xml"],"text/yaml":["yaml","yml"],"video/3gpp":["3gp","3gpp"],"video/3gpp2":["3g2"],"video/h261":["h261"],"video/h263":["h263"],"video/h264":["h264"],"video/iso.segment":["m4s"],"video/jpeg":["jpgv"],"video/jpm":["*jpm","jpgm"],"video/mj2":["mj2","mjp2"],"video/mp2t":["ts"],"video/mp4":["mp4","mp4v","mpg4"],"video/mpeg":["mpeg","mpg","mpe","m1v","m2v"],"video/ogg":["ogv"],"video/quicktime":["qt","mov"],"video/webm":["webm"]}; - -/***/ }), - -/***/ "./node_modules/minimalistic-assert/index.js": -/*!***************************************************!*\ - !*** ./node_modules/minimalistic-assert/index.js ***! - \***************************************************/ -/***/ ((module) => { - -module.exports = assert; - -function assert(val, msg) { - if (!val) - throw new Error(msg || 'Assertion failed'); -} - -assert.equal = function assertEqual(l, r, msg) { - if (l != r) - throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r)); -}; - - -/***/ }), - -/***/ "./node_modules/minimalistic-crypto-utils/lib/utils.js": -/*!*************************************************************!*\ - !*** ./node_modules/minimalistic-crypto-utils/lib/utils.js ***! - \*************************************************************/ -/***/ ((__unused_webpack_module, exports) => { - -"use strict"; - - -var utils = exports; - -function toArray(msg, enc) { - if (Array.isArray(msg)) - return msg.slice(); - if (!msg) - return []; - var res = []; - if (typeof msg !== 'string') { - for (var i = 0; i < msg.length; i++) - res[i] = msg[i] | 0; - return res; - } - if (enc === 'hex') { - msg = msg.replace(/[^a-z0-9]+/ig, ''); - if (msg.length % 2 !== 0) - msg = '0' + msg; - for (var i = 0; i < msg.length; i += 2) - res.push(parseInt(msg[i] + msg[i + 1], 16)); - } else { - for (var i = 0; i < msg.length; i++) { - var c = msg.charCodeAt(i); - var hi = c >> 8; - var lo = c & 0xff; - if (hi) - res.push(hi, lo); - else - res.push(lo); - } - } - return res; -} -utils.toArray = toArray; - -function zero2(word) { - if (word.length === 1) - return '0' + word; - else - return word; -} -utils.zero2 = zero2; - -function toHex(msg) { - var res = ''; - for (var i = 0; i < msg.length; i++) - res += zero2(msg[i].toString(16)); - return res; -} -utils.toHex = toHex; - -utils.encode = function encode(arr, enc) { - if (enc === 'hex') - return toHex(arr); - else - return arr; -}; - - -/***/ }), - -/***/ "./node_modules/mp4-box-encoding/boxes.js": -/*!************************************************!*\ - !*** ./node_modules/mp4-box-encoding/boxes.js ***! - \************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -// This is an intentionally recursive require. I don't like it either. -var Box = __webpack_require__(/*! ./index */ "./node_modules/mp4-box-encoding/index.js") -var Descriptor = __webpack_require__(/*! ./descriptor */ "./node_modules/mp4-box-encoding/descriptor.js") -var uint64be = __webpack_require__(/*! uint64be */ "./node_modules/uint64be/index.js") - -var TIME_OFFSET = 2082844800000 - -/* -TODO: -test these -add new box versions -*/ - -// These have 'version' and 'flags' fields in the headers -exports.fullBoxes = {} -var fullBoxes = [ - 'mvhd', - 'tkhd', - 'mdhd', - 'vmhd', - 'smhd', - 'stsd', - 'esds', - 'stsz', - 'stco', - 'co64', - 'stss', - 'stts', - 'ctts', - 'stsc', - 'dref', - 'elst', - 'hdlr', - 'mehd', - 'trex', - 'mfhd', - 'tfhd', - 'tfdt', - 'trun' -] -fullBoxes.forEach(function (type) { - exports.fullBoxes[type] = true -}) - -exports.ftyp = {} -exports.ftyp.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.ftyp.encodingLength(box)) - var brands = box.compatibleBrands || [] - buf.write(box.brand, 0, 4, 'ascii') - buf.writeUInt32BE(box.brandVersion, 4) - for (var i = 0; i < brands.length; i++) buf.write(brands[i], 8 + (i * 4), 4, 'ascii') - exports.ftyp.encode.bytes = 8 + brands.length * 4 - return buf -} -exports.ftyp.decode = function (buf, offset) { - buf = buf.slice(offset) - var brand = buf.toString('ascii', 0, 4) - var version = buf.readUInt32BE(4) - var compatibleBrands = [] - for (var i = 8; i < buf.length; i += 4) compatibleBrands.push(buf.toString('ascii', i, i + 4)) - return { - brand: brand, - brandVersion: version, - compatibleBrands: compatibleBrands - } -} -exports.ftyp.encodingLength = function (box) { - return 8 + (box.compatibleBrands || []).length * 4 -} - -exports.mvhd = {} -exports.mvhd.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(96) - writeDate(box.ctime || new Date(), buf, 0) - writeDate(box.mtime || new Date(), buf, 4) - buf.writeUInt32BE(box.timeScale || 0, 8) - buf.writeUInt32BE(box.duration || 0, 12) - writeFixed32(box.preferredRate || 0, buf, 16) - writeFixed16(box.preferredVolume || 0, buf, 20) - writeReserved(buf, 22, 32) - writeMatrix(box.matrix, buf, 32) - buf.writeUInt32BE(box.previewTime || 0, 68) - buf.writeUInt32BE(box.previewDuration || 0, 72) - buf.writeUInt32BE(box.posterTime || 0, 76) - buf.writeUInt32BE(box.selectionTime || 0, 80) - buf.writeUInt32BE(box.selectionDuration || 0, 84) - buf.writeUInt32BE(box.currentTime || 0, 88) - buf.writeUInt32BE(box.nextTrackId || 0, 92) - exports.mvhd.encode.bytes = 96 - return buf -} -exports.mvhd.decode = function (buf, offset) { - buf = buf.slice(offset) - return { - ctime: readDate(buf, 0), - mtime: readDate(buf, 4), - timeScale: buf.readUInt32BE(8), - duration: buf.readUInt32BE(12), - preferredRate: readFixed32(buf, 16), - preferredVolume: readFixed16(buf, 20), - matrix: readMatrix(buf.slice(32, 68)), - previewTime: buf.readUInt32BE(68), - previewDuration: buf.readUInt32BE(72), - posterTime: buf.readUInt32BE(76), - selectionTime: buf.readUInt32BE(80), - selectionDuration: buf.readUInt32BE(84), - currentTime: buf.readUInt32BE(88), - nextTrackId: buf.readUInt32BE(92) - } -} -exports.mvhd.encodingLength = function (box) { - return 96 -} - -exports.tkhd = {} -exports.tkhd.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(80) - writeDate(box.ctime || new Date(), buf, 0) - writeDate(box.mtime || new Date(), buf, 4) - buf.writeUInt32BE(box.trackId || 0, 8) - writeReserved(buf, 12, 16) - buf.writeUInt32BE(box.duration || 0, 16) - writeReserved(buf, 20, 28) - buf.writeUInt16BE(box.layer || 0, 28) - buf.writeUInt16BE(box.alternateGroup || 0, 30) - buf.writeUInt16BE(box.volume || 0, 32) - writeMatrix(box.matrix, buf, 36) - buf.writeUInt32BE(box.trackWidth || 0, 72) - buf.writeUInt32BE(box.trackHeight || 0, 76) - exports.tkhd.encode.bytes = 80 - return buf -} -exports.tkhd.decode = function (buf, offset) { - buf = buf.slice(offset) - return { - ctime: readDate(buf, 0), - mtime: readDate(buf, 4), - trackId: buf.readUInt32BE(8), - duration: buf.readUInt32BE(16), - layer: buf.readUInt16BE(28), - alternateGroup: buf.readUInt16BE(30), - volume: buf.readUInt16BE(32), - matrix: readMatrix(buf.slice(36, 72)), - trackWidth: buf.readUInt32BE(72), - trackHeight: buf.readUInt32BE(76) - } -} -exports.tkhd.encodingLength = function (box) { - return 80 -} - -exports.mdhd = {} -exports.mdhd.encode = function (box, buf, offset) { - if (box.version === 1) { - buf = buf ? buf.slice(offset) : Buffer.alloc(32) - writeDate64(box.ctime || new Date(), buf, 0) - writeDate64(box.mtime || new Date(), buf, 8) - buf.writeUInt32BE(box.timeScale || 0, 16) - // Node only supports integer <= 48bit. Waiting for BigInt! - buf.writeUIntBE(box.duration || 0, 20, 6) - buf.writeUInt16BE(box.language || 0, 28) - buf.writeUInt16BE(box.quality || 0, 30) - exports.mdhd.encode.bytes = 32 - return buf - } - - buf = buf ? buf.slice(offset) : Buffer.alloc(20) - writeDate(box.ctime || new Date(), buf, 0) - writeDate(box.mtime || new Date(), buf, 4) - buf.writeUInt32BE(box.timeScale || 0, 8) - buf.writeUInt32BE(box.duration || 0, 12) - buf.writeUInt16BE(box.language || 0, 16) - buf.writeUInt16BE(box.quality || 0, 18) - exports.mdhd.encode.bytes = 20 - return buf -} - -exports.mdhd.decode = function (buf, offset, end) { - buf = buf.slice(offset) - - var version1 = (end - offset) !== 20 - - // In version 1 creation time and modification time are unsigned long - if (version1) { - return { - ctime: readDate64(buf, 0), - mtime: readDate64(buf, 8), - timeScale: buf.readUInt32BE(16), - // Node only supports integer <= 48bit. Waiting for BigInt! - duration: buf.readUIntBE(20, 6), - language: buf.readUInt16BE(28), - quality: buf.readUInt16BE(30) - } - } - - return { - ctime: readDate(buf, 0), - mtime: readDate(buf, 4), - timeScale: buf.readUInt32BE(8), - duration: buf.readUInt32BE(12), - language: buf.readUInt16BE(16), - quality: buf.readUInt16BE(18) - } -} -exports.mdhd.encodingLength = function (box) { - if (box.version === 1) return 32 - - return 20 -} - -exports.vmhd = {} -exports.vmhd.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(8) - buf.writeUInt16BE(box.graphicsMode || 0, 0) - var opcolor = box.opcolor || [0, 0, 0] - buf.writeUInt16BE(opcolor[0], 2) - buf.writeUInt16BE(opcolor[1], 4) - buf.writeUInt16BE(opcolor[2], 6) - exports.vmhd.encode.bytes = 8 - return buf -} -exports.vmhd.decode = function (buf, offset) { - buf = buf.slice(offset) - return { - graphicsMode: buf.readUInt16BE(0), - opcolor: [buf.readUInt16BE(2), buf.readUInt16BE(4), buf.readUInt16BE(6)] - } -} -exports.vmhd.encodingLength = function (box) { - return 8 -} - -exports.smhd = {} -exports.smhd.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(4) - buf.writeUInt16BE(box.balance || 0, 0) - writeReserved(buf, 2, 4) - exports.smhd.encode.bytes = 4 - return buf -} -exports.smhd.decode = function (buf, offset) { - buf = buf.slice(offset) - return { - balance: buf.readUInt16BE(0) - } -} -exports.smhd.encodingLength = function (box) { - return 4 -} - -exports.stsd = {} -exports.stsd.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsd.encodingLength(box)) - var entries = box.entries || [] - - buf.writeUInt32BE(entries.length, 0) - - var ptr = 4 - for (var i = 0; i < entries.length; i++) { - var entry = entries[i] - Box.encode(entry, buf, ptr) - ptr += Box.encode.bytes - } - - exports.stsd.encode.bytes = ptr - return buf -} -exports.stsd.decode = function (buf, offset, end) { - buf = buf.slice(offset) - var num = buf.readUInt32BE(0) - var entries = new Array(num) - var ptr = 4 - - for (var i = 0; i < num; i++) { - var entry = Box.decode(buf, ptr, end) - entries[i] = entry - ptr += entry.length - } - - return { - entries: entries - } -} -exports.stsd.encodingLength = function (box) { - var totalSize = 4 - if (!box.entries) return totalSize - for (var i = 0; i < box.entries.length; i++) { - totalSize += Box.encodingLength(box.entries[i]) - } - return totalSize -} - -exports.avc1 = exports.VisualSampleEntry = {} -exports.VisualSampleEntry.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.VisualSampleEntry.encodingLength(box)) - - writeReserved(buf, 0, 6) - buf.writeUInt16BE(box.dataReferenceIndex || 0, 6) - writeReserved(buf, 8, 24) - buf.writeUInt16BE(box.width || 0, 24) - buf.writeUInt16BE(box.height || 0, 26) - buf.writeUInt32BE(box.hResolution || 0x480000, 28) - buf.writeUInt32BE(box.vResolution || 0x480000, 32) - writeReserved(buf, 36, 40) - buf.writeUInt16BE(box.frameCount || 1, 40) - var compressorName = box.compressorName || '' - var nameLen = Math.min(compressorName.length, 31) - buf.writeUInt8(nameLen, 42) - buf.write(compressorName, 43, nameLen, 'utf8') - buf.writeUInt16BE(box.depth || 0x18, 74) - buf.writeInt16BE(-1, 76) - - var ptr = 78 - var children = box.children || [] - children.forEach(function (child) { - Box.encode(child, buf, ptr) - ptr += Box.encode.bytes - }) - exports.VisualSampleEntry.encode.bytes = ptr -} -exports.VisualSampleEntry.decode = function (buf, offset, end) { - buf = buf.slice(offset) - var length = end - offset - var nameLen = Math.min(buf.readUInt8(42), 31) - var box = { - dataReferenceIndex: buf.readUInt16BE(6), - width: buf.readUInt16BE(24), - height: buf.readUInt16BE(26), - hResolution: buf.readUInt32BE(28), - vResolution: buf.readUInt32BE(32), - frameCount: buf.readUInt16BE(40), - compressorName: buf.toString('utf8', 43, 43 + nameLen), - depth: buf.readUInt16BE(74), - children: [] - } - - var ptr = 78 - while (length - ptr >= 8) { - var child = Box.decode(buf, ptr, length) - box.children.push(child) - box[child.type] = child - ptr += child.length - } - - return box -} -exports.VisualSampleEntry.encodingLength = function (box) { - var len = 78 - var children = box.children || [] - children.forEach(function (child) { - len += Box.encodingLength(child) - }) - return len -} - -exports.avcC = {} -exports.avcC.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(box.buffer.length) - - box.buffer.copy(buf) - exports.avcC.encode.bytes = box.buffer.length -} -exports.avcC.decode = function (buf, offset, end) { - buf = buf.slice(offset, end) - - return { - mimeCodec: buf.toString('hex', 1, 4), - buffer: Buffer.from(buf) - } -} -exports.avcC.encodingLength = function (box) { - return box.buffer.length -} - -exports.mp4a = exports.AudioSampleEntry = {} -exports.AudioSampleEntry.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.AudioSampleEntry.encodingLength(box)) - - writeReserved(buf, 0, 6) - buf.writeUInt16BE(box.dataReferenceIndex || 0, 6) - writeReserved(buf, 8, 16) - buf.writeUInt16BE(box.channelCount || 2, 16) - buf.writeUInt16BE(box.sampleSize || 16, 18) - writeReserved(buf, 20, 24) - buf.writeUInt32BE(box.sampleRate || 0, 24) - - var ptr = 28 - var children = box.children || [] - children.forEach(function (child) { - Box.encode(child, buf, ptr) - ptr += Box.encode.bytes - }) - exports.AudioSampleEntry.encode.bytes = ptr -} -exports.AudioSampleEntry.decode = function (buf, offset, end) { - buf = buf.slice(offset, end) - var length = end - offset - var box = { - dataReferenceIndex: buf.readUInt16BE(6), - channelCount: buf.readUInt16BE(16), - sampleSize: buf.readUInt16BE(18), - sampleRate: buf.readUInt32BE(24), - children: [] - } - - var ptr = 28 - while (length - ptr >= 8) { - var child = Box.decode(buf, ptr, length) - box.children.push(child) - box[child.type] = child - ptr += child.length - } - - return box -} -exports.AudioSampleEntry.encodingLength = function (box) { - var len = 28 - var children = box.children || [] - children.forEach(function (child) { - len += Box.encodingLength(child) - }) - return len -} - -exports.esds = {} -exports.esds.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(box.buffer.length) - - box.buffer.copy(buf, 0) - exports.esds.encode.bytes = box.buffer.length -} -exports.esds.decode = function (buf, offset, end) { - buf = buf.slice(offset, end) - - var desc = Descriptor.Descriptor.decode(buf, 0, buf.length) - var esd = (desc.tagName === 'ESDescriptor') ? desc : {} - var dcd = esd.DecoderConfigDescriptor || {} - var oti = dcd.oti || 0 - var dsi = dcd.DecoderSpecificInfo - var audioConfig = dsi ? (dsi.buffer.readUInt8(0) & 0xf8) >> 3 : 0 - - var mimeCodec = null - if (oti) { - mimeCodec = oti.toString(16) - if (audioConfig) { - mimeCodec += '.' + audioConfig - } - } - - return { - mimeCodec: mimeCodec, - buffer: Buffer.from(buf.slice(0)) - } -} -exports.esds.encodingLength = function (box) { - return box.buffer.length -} - -// TODO: integrate the two versions in a saner way -exports.stsz = {} -exports.stsz.encode = function (box, buf, offset) { - var entries = box.entries || [] - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsz.encodingLength(box)) - - buf.writeUInt32BE(0, 0) - buf.writeUInt32BE(entries.length, 4) - - for (var i = 0; i < entries.length; i++) { - buf.writeUInt32BE(entries[i], i * 4 + 8) - } - - exports.stsz.encode.bytes = 8 + entries.length * 4 - return buf -} -exports.stsz.decode = function (buf, offset) { - buf = buf.slice(offset) - var size = buf.readUInt32BE(0) - var num = buf.readUInt32BE(4) - var entries = new Array(num) - - for (var i = 0; i < num; i++) { - if (size === 0) { - entries[i] = buf.readUInt32BE(i * 4 + 8) - } else { - entries[i] = size - } - } - - return { - entries: entries - } -} -exports.stsz.encodingLength = function (box) { - return 8 + box.entries.length * 4 -} - -exports.stss = -exports.stco = {} -exports.stco.encode = function (box, buf, offset) { - var entries = box.entries || [] - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stco.encodingLength(box)) - - buf.writeUInt32BE(entries.length, 0) - - for (var i = 0; i < entries.length; i++) { - buf.writeUInt32BE(entries[i], i * 4 + 4) - } - - exports.stco.encode.bytes = 4 + entries.length * 4 - return buf -} -exports.stco.decode = function (buf, offset) { - buf = buf.slice(offset) - var num = buf.readUInt32BE(0) - var entries = new Array(num) - - for (var i = 0; i < num; i++) { - entries[i] = buf.readUInt32BE(i * 4 + 4) - } - - return { - entries: entries - } -} -exports.stco.encodingLength = function (box) { - return 4 + box.entries.length * 4 -} - -exports.co64 = {} -exports.co64.encode = function (box, buf, offset) { - var entries = box.entries || [] - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.co64.encodingLength(box)) - - buf.writeUInt32BE(entries.length, 0) - - for (var i = 0; i < entries.length; i++) { - uint64be.encode(entries[i], buf, i * 8 + 4) - } - - exports.co64.encode.bytes = 4 + entries.length * 8 - return buf -} -exports.co64.decode = function (buf, offset) { - buf = buf.slice(offset) - var num = buf.readUInt32BE(0) - var entries = new Array(num) - - for (var i = 0; i < num; i++) { - entries[i] = uint64be.decode(buf, i * 8 + 4) - } - - return { - entries: entries - } -} -exports.co64.encodingLength = function (box) { - return 4 + box.entries.length * 8 -} - -exports.stts = {} -exports.stts.encode = function (box, buf, offset) { - var entries = box.entries || [] - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stts.encodingLength(box)) - - buf.writeUInt32BE(entries.length, 0) - - for (var i = 0; i < entries.length; i++) { - var ptr = i * 8 + 4 - buf.writeUInt32BE(entries[i].count || 0, ptr) - buf.writeUInt32BE(entries[i].duration || 0, ptr + 4) - } - - exports.stts.encode.bytes = 4 + box.entries.length * 8 - return buf -} -exports.stts.decode = function (buf, offset) { - buf = buf.slice(offset) - var num = buf.readUInt32BE(0) - var entries = new Array(num) - - for (var i = 0; i < num; i++) { - var ptr = i * 8 + 4 - entries[i] = { - count: buf.readUInt32BE(ptr), - duration: buf.readUInt32BE(ptr + 4) - } - } - - return { - entries: entries - } -} -exports.stts.encodingLength = function (box) { - return 4 + box.entries.length * 8 -} - -exports.ctts = {} -exports.ctts.encode = function (box, buf, offset) { - var entries = box.entries || [] - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.ctts.encodingLength(box)) - - buf.writeUInt32BE(entries.length, 0) - - for (var i = 0; i < entries.length; i++) { - var ptr = i * 8 + 4 - buf.writeUInt32BE(entries[i].count || 0, ptr) - buf.writeUInt32BE(entries[i].compositionOffset || 0, ptr + 4) - } - - exports.ctts.encode.bytes = 4 + entries.length * 8 - return buf -} -exports.ctts.decode = function (buf, offset) { - buf = buf.slice(offset) - var num = buf.readUInt32BE(0) - var entries = new Array(num) - - for (var i = 0; i < num; i++) { - var ptr = i * 8 + 4 - entries[i] = { - count: buf.readUInt32BE(ptr), - compositionOffset: buf.readInt32BE(ptr + 4) - } - } - - return { - entries: entries - } -} -exports.ctts.encodingLength = function (box) { - return 4 + box.entries.length * 8 -} - -exports.stsc = {} -exports.stsc.encode = function (box, buf, offset) { - var entries = box.entries || [] - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsc.encodingLength(box)) - - buf.writeUInt32BE(entries.length, 0) - - for (var i = 0; i < entries.length; i++) { - var ptr = i * 12 + 4 - buf.writeUInt32BE(entries[i].firstChunk || 0, ptr) - buf.writeUInt32BE(entries[i].samplesPerChunk || 0, ptr + 4) - buf.writeUInt32BE(entries[i].sampleDescriptionId || 0, ptr + 8) - } - - exports.stsc.encode.bytes = 4 + entries.length * 12 - return buf -} -exports.stsc.decode = function (buf, offset) { - buf = buf.slice(offset) - var num = buf.readUInt32BE(0) - var entries = new Array(num) - - for (var i = 0; i < num; i++) { - var ptr = i * 12 + 4 - entries[i] = { - firstChunk: buf.readUInt32BE(ptr), - samplesPerChunk: buf.readUInt32BE(ptr + 4), - sampleDescriptionId: buf.readUInt32BE(ptr + 8) - } - } - - return { - entries: entries - } -} -exports.stsc.encodingLength = function (box) { - return 4 + box.entries.length * 12 -} - -exports.dref = {} -exports.dref.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.dref.encodingLength(box)) - var entries = box.entries || [] - - buf.writeUInt32BE(entries.length, 0) - - var ptr = 4 - for (var i = 0; i < entries.length; i++) { - var entry = entries[i] - var size = (entry.buf ? entry.buf.length : 0) + 4 + 4 - - buf.writeUInt32BE(size, ptr) - ptr += 4 - - buf.write(entry.type, ptr, 4, 'ascii') - ptr += 4 - - if (entry.buf) { - entry.buf.copy(buf, ptr) - ptr += entry.buf.length - } - } - - exports.dref.encode.bytes = ptr - return buf -} -exports.dref.decode = function (buf, offset) { - buf = buf.slice(offset) - var num = buf.readUInt32BE(0) - var entries = new Array(num) - var ptr = 4 - - for (var i = 0; i < num; i++) { - var size = buf.readUInt32BE(ptr) - var type = buf.toString('ascii', ptr + 4, ptr + 8) - var tmp = buf.slice(ptr + 8, ptr + size) - ptr += size - - entries[i] = { - type: type, - buf: tmp - } - } - - return { - entries: entries - } -} -exports.dref.encodingLength = function (box) { - var totalSize = 4 - if (!box.entries) return totalSize - for (var i = 0; i < box.entries.length; i++) { - var buf = box.entries[i].buf - totalSize += (buf ? buf.length : 0) + 4 + 4 - } - return totalSize -} - -exports.elst = {} -exports.elst.encode = function (box, buf, offset) { - var entries = box.entries || [] - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.elst.encodingLength(box)) - - buf.writeUInt32BE(entries.length, 0) - - for (var i = 0; i < entries.length; i++) { - var ptr = i * 12 + 4 - buf.writeUInt32BE(entries[i].trackDuration || 0, ptr) - buf.writeUInt32BE(entries[i].mediaTime || 0, ptr + 4) - writeFixed32(entries[i].mediaRate || 0, buf, ptr + 8) - } - - exports.elst.encode.bytes = 4 + entries.length * 12 - return buf -} -exports.elst.decode = function (buf, offset) { - buf = buf.slice(offset) - var num = buf.readUInt32BE(0) - var entries = new Array(num) - - for (var i = 0; i < num; i++) { - var ptr = i * 12 + 4 - entries[i] = { - trackDuration: buf.readUInt32BE(ptr), - mediaTime: buf.readInt32BE(ptr + 4), - mediaRate: readFixed32(buf, ptr + 8) - } - } - - return { - entries: entries - } -} -exports.elst.encodingLength = function (box) { - return 4 + box.entries.length * 12 -} - -exports.hdlr = {} -exports.hdlr.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(exports.hdlr.encodingLength(box)) - - var len = 21 + (box.name || '').length - buf.fill(0, 0, len) - - buf.write(box.handlerType || '', 4, 4, 'ascii') - writeString(box.name || '', buf, 20) - - exports.hdlr.encode.bytes = len - return buf -} -exports.hdlr.decode = function (buf, offset, end) { - buf = buf.slice(offset) - return { - handlerType: buf.toString('ascii', 4, 8), - name: readString(buf, 20, end) - } -} -exports.hdlr.encodingLength = function (box) { - return 21 + (box.name || '').length -} - -exports.mehd = {} -exports.mehd.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(4) - - buf.writeUInt32BE(box.fragmentDuration || 0, 0) - exports.mehd.encode.bytes = 4 - return buf -} -exports.mehd.decode = function (buf, offset) { - buf = buf.slice(offset) - return { - fragmentDuration: buf.readUInt32BE(0) - } -} -exports.mehd.encodingLength = function (box) { - return 4 -} - -exports.trex = {} -exports.trex.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(20) - - buf.writeUInt32BE(box.trackId || 0, 0) - buf.writeUInt32BE(box.defaultSampleDescriptionIndex || 0, 4) - buf.writeUInt32BE(box.defaultSampleDuration || 0, 8) - buf.writeUInt32BE(box.defaultSampleSize || 0, 12) - buf.writeUInt32BE(box.defaultSampleFlags || 0, 16) - exports.trex.encode.bytes = 20 - return buf -} -exports.trex.decode = function (buf, offset) { - buf = buf.slice(offset) - return { - trackId: buf.readUInt32BE(0), - defaultSampleDescriptionIndex: buf.readUInt32BE(4), - defaultSampleDuration: buf.readUInt32BE(8), - defaultSampleSize: buf.readUInt32BE(12), - defaultSampleFlags: buf.readUInt32BE(16) - } -} -exports.trex.encodingLength = function (box) { - return 20 -} - -exports.mfhd = {} -exports.mfhd.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(4) - - buf.writeUInt32BE(box.sequenceNumber || 0, 0) - exports.mfhd.encode.bytes = 4 - return buf -} -exports.mfhd.decode = function (buf, offset) { - return { - sequenceNumber: buf.readUInt32BE(0) - } -} -exports.mfhd.encodingLength = function (box) { - return 4 -} - -exports.tfhd = {} -exports.tfhd.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(4) - buf.writeUInt32BE(box.trackId, 0) - exports.tfhd.encode.bytes = 4 - return buf -} -exports.tfhd.decode = function (buf, offset) { - // TODO: this -} -exports.tfhd.encodingLength = function (box) { - // TODO: this is wrong! - return 4 -} - -exports.tfdt = {} -exports.tfdt.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(4) - - buf.writeUInt32BE(box.baseMediaDecodeTime || 0, 0) - exports.tfdt.encode.bytes = 4 - return buf -} -exports.tfdt.decode = function (buf, offset) { - // TODO: this -} -exports.tfdt.encodingLength = function (box) { - return 4 -} - -exports.trun = {} -exports.trun.encode = function (box, buf, offset) { - buf = buf ? buf.slice(offset) : Buffer.alloc(8 + box.entries.length * 16) - - // TODO: this is wrong - buf.writeUInt32BE(box.entries.length, 0) - buf.writeInt32BE(box.dataOffset, 4) - var ptr = 8 - for (var i = 0; i < box.entries.length; i++) { - var entry = box.entries[i] - buf.writeUInt32BE(entry.sampleDuration, ptr) - ptr += 4 - - buf.writeUInt32BE(entry.sampleSize, ptr) - ptr += 4 - - buf.writeUInt32BE(entry.sampleFlags, ptr) - ptr += 4 - - if ((box.version || 0) === 0) { - buf.writeUInt32BE(entry.sampleCompositionTimeOffset, ptr) - } else { - buf.writeInt32BE(entry.sampleCompositionTimeOffset, ptr) - } - ptr += 4 - } - exports.trun.encode.bytes = ptr -} -exports.trun.decode = function (buf, offset) { - // TODO: this -} -exports.trun.encodingLength = function (box) { - // TODO: this is wrong - return 8 + box.entries.length * 16 -} - -exports.mdat = {} -exports.mdat.encode = function (box, buf, offset) { - if (box.buffer) { - box.buffer.copy(buf, offset) - exports.mdat.encode.bytes = box.buffer.length - } else { - exports.mdat.encode.bytes = exports.mdat.encodingLength(box) - } -} -exports.mdat.decode = function (buf, start, end) { - return { - buffer: Buffer.from(buf.slice(start, end)) - } -} -exports.mdat.encodingLength = function (box) { - return box.buffer ? box.buffer.length : box.contentLength -} - -function writeReserved (buf, offset, end) { - for (var i = offset; i < end; i++) buf[i] = 0 -} - -function writeDate (date, buf, offset) { - buf.writeUInt32BE(Math.floor((date.getTime() + TIME_OFFSET) / 1000), offset) -} - -function writeDate64 (date, buf, offset) { - // Node only supports integer <= 48bit. Waiting for BigInt! - buf.writeUIntBE(Math.floor((date.getTime() + TIME_OFFSET) / 1000), offset, 6) -} - -// TODO: think something is wrong here -function writeFixed32 (num, buf, offset) { - buf.writeUInt16BE(Math.floor(num) % (256 * 256), offset) - buf.writeUInt16BE(Math.floor(num * 256 * 256) % (256 * 256), offset + 2) -} - -function writeFixed16 (num, buf, offset) { - buf[offset] = Math.floor(num) % 256 - buf[offset + 1] = Math.floor(num * 256) % 256 -} - -function writeMatrix (list, buf, offset) { - if (!list) list = [0, 0, 0, 0, 0, 0, 0, 0, 0] - for (var i = 0; i < list.length; i++) { - writeFixed32(list[i], buf, offset + i * 4) - } -} - -function writeString (str, buf, offset) { - var strBuffer = Buffer.from(str, 'utf8') - strBuffer.copy(buf, offset) - buf[offset + strBuffer.length] = 0 -} - -function readMatrix (buf) { - var list = new Array(buf.length / 4) - for (var i = 0; i < list.length; i++) list[i] = readFixed32(buf, i * 4) - return list -} - -function readDate64 (buf, offset) { - // Node only supports integer <= 48bit. Waiting for BigInt! - return new Date(buf.readUIntBE(offset, 6) * 1000 - TIME_OFFSET) -} - -function readDate (buf, offset) { - return new Date(buf.readUInt32BE(offset) * 1000 - TIME_OFFSET) -} - -function readFixed32 (buf, offset) { - return buf.readUInt16BE(offset) + buf.readUInt16BE(offset + 2) / (256 * 256) -} - -function readFixed16 (buf, offset) { - return buf[offset] + buf[offset + 1] / 256 -} - -function readString (buf, offset, length) { - var i - for (i = 0; i < length; i++) { - if (buf[offset + i] === 0) { - break - } - } - return buf.toString('utf8', offset, offset + i) -} - - -/***/ }), - -/***/ "./node_modules/mp4-box-encoding/descriptor.js": -/*!*****************************************************!*\ - !*** ./node_modules/mp4-box-encoding/descriptor.js ***! - \*****************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var tagToName = { - 0x03: 'ESDescriptor', - 0x04: 'DecoderConfigDescriptor', - 0x05: 'DecoderSpecificInfo', - 0x06: 'SLConfigDescriptor' -} - -exports.Descriptor = {} -exports.Descriptor.decode = function (buf, start, end) { - var tag = buf.readUInt8(start) - var ptr = start + 1 - var lenByte - var len = 0 - do { - lenByte = buf.readUInt8(ptr++) - len = (len << 7) | (lenByte & 0x7f) - } while (lenByte & 0x80) - - var obj - var tagName = tagToName[tag] // May be undefined; that's ok - if (exports[tagName]) { - obj = exports[tagName].decode(buf, ptr, end) - } else { - obj = { - buffer: Buffer.from(buf.slice(ptr, ptr + len)) - } - } - - obj.tag = tag - obj.tagName = tagName - obj.length = (ptr - start) + len - obj.contentsLen = len - return obj -} - -exports.DescriptorArray = {} -exports.DescriptorArray.decode = function (buf, start, end) { - var ptr = start - var obj = {} - while (ptr + 2 <= end) { - var descriptor = exports.Descriptor.decode(buf, ptr, end) - ptr += descriptor.length - var tagName = tagToName[descriptor.tag] || ('Descriptor' + descriptor.tag) - obj[tagName] = descriptor - } - return obj -} - -exports.ESDescriptor = {} -exports.ESDescriptor.decode = function (buf, start, end) { - var flags = buf.readUInt8(start + 2) - var ptr = start + 3 - if (flags & 0x80) { - ptr += 2 - } - if (flags & 0x40) { - var len = buf.readUInt8(ptr) - ptr += len + 1 - } - if (flags & 0x20) { - ptr += 2 - } - return exports.DescriptorArray.decode(buf, ptr, end) -} - -exports.DecoderConfigDescriptor = {} -exports.DecoderConfigDescriptor.decode = function (buf, start, end) { - var oti = buf.readUInt8(start) - var obj = exports.DescriptorArray.decode(buf, start + 13, end) - obj.oti = oti - return obj -} - - -/***/ }), - -/***/ "./node_modules/mp4-box-encoding/index.js": -/*!************************************************!*\ - !*** ./node_modules/mp4-box-encoding/index.js ***! - \************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -// var assert = require('assert') -var uint64be = __webpack_require__(/*! uint64be */ "./node_modules/uint64be/index.js") - -var boxes = __webpack_require__(/*! ./boxes */ "./node_modules/mp4-box-encoding/boxes.js") - -var UINT32_MAX = 4294967295 - -var Box = exports - -/* - * Lists the proper order for boxes inside containers. - * Five-character names ending in 's' indicate arrays instead of single elements. - */ -var containers = exports.containers = { - 'moov': ['mvhd', 'meta', 'traks', 'mvex'], - 'trak': ['tkhd', 'tref', 'trgr', 'edts', 'meta', 'mdia', 'udta'], - 'edts': ['elst'], - 'mdia': ['mdhd', 'hdlr', 'elng', 'minf'], - 'minf': ['vmhd', 'smhd', 'hmhd', 'sthd', 'nmhd', 'dinf', 'stbl'], - 'dinf': ['dref'], - 'stbl': ['stsd', 'stts', 'ctts', 'cslg', 'stsc', 'stsz', 'stz2', 'stco', 'co64', 'stss', 'stsh', 'padb', 'stdp', 'sdtp', 'sbgps', 'sgpds', 'subss', 'saizs', 'saios'], - 'mvex': ['mehd', 'trexs', 'leva'], - 'moof': ['mfhd', 'meta', 'trafs'], - 'traf': ['tfhd', 'tfdt', 'trun', 'sbgps', 'sgpds', 'subss', 'saizs', 'saios', 'meta'] -} - -Box.encode = function (obj, buffer, offset) { - Box.encodingLength(obj) // sets every level appropriately - offset = offset || 0 - buffer = buffer || Buffer.alloc(obj.length) - return Box._encode(obj, buffer, offset) -} - -Box._encode = function (obj, buffer, offset) { - var type = obj.type - var len = obj.length - if (len > UINT32_MAX) { - len = 1 - } - buffer.writeUInt32BE(len, offset) - buffer.write(obj.type, offset + 4, 4, 'ascii') - var ptr = offset + 8 - if (len === 1) { - uint64be.encode(obj.length, buffer, ptr) - ptr += 8 - } - if (boxes.fullBoxes[type]) { - buffer.writeUInt32BE(obj.flags || 0, ptr) - buffer.writeUInt8(obj.version || 0, ptr) - ptr += 4 - } - - if (containers[type]) { - var contents = containers[type] - contents.forEach(function (childType) { - if (childType.length === 5) { - var entry = obj[childType] || [] - childType = childType.substr(0, 4) - entry.forEach(function (child) { - Box._encode(child, buffer, ptr) - ptr += Box.encode.bytes - }) - } else if (obj[childType]) { - Box._encode(obj[childType], buffer, ptr) - ptr += Box.encode.bytes - } - }) - if (obj.otherBoxes) { - obj.otherBoxes.forEach(function (child) { - Box._encode(child, buffer, ptr) - ptr += Box.encode.bytes - }) - } - } else if (boxes[type]) { - var encode = boxes[type].encode - encode(obj, buffer, ptr) - ptr += encode.bytes - } else if (obj.buffer) { - var buf = obj.buffer - buf.copy(buffer, ptr) - ptr += obj.buffer.length - } else { - throw new Error('Either `type` must be set to a known type (not\'' + type + '\') or `buffer` must be set') - } - - Box.encode.bytes = ptr - offset - // assert.equal(ptr - offset, obj.length, 'Error encoding \'' + type + '\': wrote ' + ptr - offset + ' bytes, expecting ' + obj.length) - return buffer -} - -/* - * Returns an object with `type` and `size` fields, - * or if there isn't enough data, returns the total - * number of bytes needed to read the headers - */ -Box.readHeaders = function (buffer, start, end) { - start = start || 0 - end = end || buffer.length - if (end - start < 8) { - return 8 - } - - var len = buffer.readUInt32BE(start) - var type = buffer.toString('ascii', start + 4, start + 8) - var ptr = start + 8 - - if (len === 1) { - if (end - start < 16) { - return 16 - } - - len = uint64be.decode(buffer, ptr) - ptr += 8 - } - - var version - var flags - if (boxes.fullBoxes[type]) { - version = buffer.readUInt8(ptr) - flags = buffer.readUInt32BE(ptr) & 0xffffff - ptr += 4 - } - - return { - length: len, - headersLen: ptr - start, - contentLen: len - (ptr - start), - type: type, - version: version, - flags: flags - } -} - -Box.decode = function (buffer, start, end) { - start = start || 0 - end = end || buffer.length - var headers = Box.readHeaders(buffer, start, end) - if (!headers || headers.length > end - start) { - throw new Error('Data too short') - } - - return Box.decodeWithoutHeaders(headers, buffer, start + headers.headersLen, start + headers.length) -} - -Box.decodeWithoutHeaders = function (headers, buffer, start, end) { - start = start || 0 - end = end || buffer.length - var type = headers.type - var obj = {} - if (containers[type]) { - obj.otherBoxes = [] - var contents = containers[type] - var ptr = start - while (end - ptr >= 8) { - var child = Box.decode(buffer, ptr, end) - ptr += child.length - if (contents.indexOf(child.type) >= 0) { - obj[child.type] = child - } else if (contents.indexOf(child.type + 's') >= 0) { - var childType = child.type + 's' - var entry = obj[childType] = obj[childType] || [] - entry.push(child) - } else { - obj.otherBoxes.push(child) - } - } - } else if (boxes[type]) { - var decode = boxes[type].decode - obj = decode(buffer, start, end) - } else { - obj.buffer = Buffer.from(buffer.slice(start, end)) - } - - obj.length = headers.length - obj.contentLen = headers.contentLen - obj.type = headers.type - obj.version = headers.version - obj.flags = headers.flags - return obj -} - -Box.encodingLength = function (obj) { - var type = obj.type - - var len = 8 - if (boxes.fullBoxes[type]) { - len += 4 - } - - if (containers[type]) { - var contents = containers[type] - contents.forEach(function (childType) { - if (childType.length === 5) { - var entry = obj[childType] || [] - childType = childType.substr(0, 4) - entry.forEach(function (child) { - child.type = childType - len += Box.encodingLength(child) - }) - } else if (obj[childType]) { - var child = obj[childType] - child.type = childType - len += Box.encodingLength(child) - } - }) - if (obj.otherBoxes) { - obj.otherBoxes.forEach(function (child) { - len += Box.encodingLength(child) - }) - } - } else if (boxes[type]) { - len += boxes[type].encodingLength(obj) - } else if (obj.buffer) { - len += obj.buffer.length - } else { - throw new Error('Either `type` must be set to a known type (not\'' + type + '\') or `buffer` must be set') - } - - if (len > UINT32_MAX) { - len += 8 - } - - obj.length = len - return len -} - - -/***/ }), - -/***/ "./node_modules/mp4-stream/decode.js": -/*!*******************************************!*\ - !*** ./node_modules/mp4-stream/decode.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -var nextEvent = __webpack_require__(/*! next-event */ "./node_modules/next-event/index.js") -var Box = __webpack_require__(/*! mp4-box-encoding */ "./node_modules/mp4-box-encoding/index.js") - -var EMPTY = Buffer.alloc(0) - -class Decoder extends stream.Writable { - constructor (opts) { - super(opts) - - this.destroyed = false - - this._pending = 0 - this._missing = 0 - this._ignoreEmpty = false - this._buf = null - this._str = null - this._cb = null - this._ondrain = null - this._writeBuffer = null - this._writeCb = null - - this._ondrain = null - this._kick() - } - - destroy (err) { - if (this.destroyed) return - this.destroyed = true - if (err) this.emit('error', err) - this.emit('close') - } - - _write (data, enc, next) { - if (this.destroyed) return - var drained = !this._str || !this._str._writableState.needDrain - - while (data.length && !this.destroyed) { - if (!this._missing && !this._ignoreEmpty) { - this._writeBuffer = data - this._writeCb = next - return - } - - var consumed = data.length < this._missing ? data.length : this._missing - if (this._buf) data.copy(this._buf, this._buf.length - this._missing) - else if (this._str) drained = this._str.write(consumed === data.length ? data : data.slice(0, consumed)) - - this._missing -= consumed - - if (!this._missing) { - var buf = this._buf - var cb = this._cb - var stream = this._str - - this._buf = this._cb = this._str = this._ondrain = null - drained = true - - this._ignoreEmpty = false - if (stream) stream.end() - if (cb) cb(buf) - } - - data = consumed === data.length ? EMPTY : data.slice(consumed) - } - - if (this._pending && !this._missing) { - this._writeBuffer = data - this._writeCb = next - return - } - - if (drained) next() - else this._ondrain(next) - } - - _buffer (size, cb) { - this._missing = size - this._buf = Buffer.alloc(size) - this._cb = cb - } - - _stream (size, cb) { - this._missing = size - this._str = new MediaData(this) - this._ondrain = nextEvent(this._str, 'drain') - this._pending++ - this._str.on('end', () => { - this._pending-- - this._kick() - }) - this._cb = cb - return this._str - } - - _readBox () { - const bufferHeaders = (len, buf) => { - this._buffer(len, additionalBuf => { - if (buf) { - buf = Buffer.concat([buf, additionalBuf]) - } else { - buf = additionalBuf - } - var headers = Box.readHeaders(buf) - if (typeof headers === 'number') { - bufferHeaders(headers - buf.length, buf) - } else { - this._pending++ - this._headers = headers - this.emit('box', headers) - } - }) - } - - bufferHeaders(8) - } - - stream () { - if (!this._headers) throw new Error('this function can only be called once after \'box\' is emitted') - var headers = this._headers - this._headers = null - - return this._stream(headers.contentLen, () => { - this._pending-- - this._kick() - }) - } - - decode (cb) { - if (!this._headers) throw new Error('this function can only be called once after \'box\' is emitted') - var headers = this._headers - this._headers = null - - this._buffer(headers.contentLen, buf => { - var box = Box.decodeWithoutHeaders(headers, buf) - cb(box) - this._pending-- - this._kick() - }) - } - - ignore () { - if (!this._headers) throw new Error('this function can only be called once after \'box\' is emitted') - var headers = this._headers - this._headers = null - - this._missing = headers.contentLen - if (this._missing === 0) { - this._ignoreEmpty = true - } - this._cb = () => { - this._pending-- - this._kick() - } - } - - _kick () { - if (this._pending) return - if (!this._buf && !this._str) this._readBox() - if (this._writeBuffer) { - var next = this._writeCb - var buffer = this._writeBuffer - this._writeBuffer = null - this._writeCb = null - this._write(buffer, null, next) - } - } -} - -class MediaData extends stream.PassThrough { - constructor (parent) { - super() - this._parent = parent - this.destroyed = false - } - - destroy (err) { - if (this.destroyed) return - this.destroyed = true - this._parent.destroy(err) - if (err) this.emit('error', err) - this.emit('close') - } -} - -module.exports = Decoder - - -/***/ }), - -/***/ "./node_modules/mp4-stream/encode.js": -/*!*******************************************!*\ - !*** ./node_modules/mp4-stream/encode.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -var Box = __webpack_require__(/*! mp4-box-encoding */ "./node_modules/mp4-box-encoding/index.js") -var queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -function noop () {} - -class Encoder extends stream.Readable { - constructor (opts) { - super(opts) - - this.destroyed = false - - this._finalized = false - this._reading = false - this._stream = null - this._drain = null - this._want = false - - this._onreadable = () => { - if (!this._want) return - this._want = false - this._read() - } - - this._onend = () => { - this._stream = null - } - } - - mdat (size, cb) { - this.mediaData(size, cb) - } - - mediaData (size, cb) { - var stream = new MediaData(this) - this.box({ type: 'mdat', contentLength: size, encodeBufferLen: 8, stream: stream }, cb) - return stream - } - - box (box, cb) { - if (!cb) cb = noop - if (this.destroyed) return cb(new Error('Encoder is destroyed')) - - var buf - if (box.encodeBufferLen) { - buf = Buffer.alloc(box.encodeBufferLen) - } - if (box.stream) { - box.buffer = null - buf = Box.encode(box, buf) - this.push(buf) - this._stream = box.stream - this._stream.on('readable', this._onreadable) - this._stream.on('end', this._onend) - this._stream.on('end', cb) - this._forward() - } else { - buf = Box.encode(box, buf) - var drained = this.push(buf) - if (drained) return queueMicrotask(cb) - this._drain = cb - } - } - - destroy (err) { - if (this.destroyed) return - this.destroyed = true - if (this._stream && this._stream.destroy) this._stream.destroy() - this._stream = null - if (this._drain) { - var cb = this._drain - this._drain = null - cb(err) - } - if (err) this.emit('error', err) - this.emit('close') - } - - finalize () { - this._finalized = true - if (!this._stream && !this._drain) { - this.push(null) - } - } - - _forward () { - if (!this._stream) return - - while (!this.destroyed) { - var buf = this._stream.read() - - if (!buf) { - this._want = !!this._stream - return - } - - if (!this.push(buf)) return - } - } - - _read () { - if (this._reading || this.destroyed) return - this._reading = true - - if (this._stream) this._forward() - if (this._drain) { - var drain = this._drain - this._drain = null - drain() - } - - this._reading = false - if (this._finalized) { - this.push(null) - } - } -} - -class MediaData extends stream.PassThrough { - constructor (parent) { - super() - this._parent = parent - this.destroyed = false - } - - destroy (err) { - if (this.destroyed) return - this.destroyed = true - this._parent.destroy(err) - if (err) this.emit('error', err) - this.emit('close') - } -} - -module.exports = Encoder - - -/***/ }), - -/***/ "./node_modules/mp4-stream/index.js": -/*!******************************************!*\ - !*** ./node_modules/mp4-stream/index.js ***! - \******************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -const Decoder = __webpack_require__(/*! ./decode */ "./node_modules/mp4-stream/decode.js") -const Encoder = __webpack_require__(/*! ./encode */ "./node_modules/mp4-stream/encode.js") - -exports.decode = opts => new Decoder(opts) -exports.encode = opts => new Encoder(opts) - - -/***/ }), - -/***/ "./node_modules/ms/index.js": -/*!**********************************!*\ - !*** ./node_modules/ms/index.js ***! - \**********************************/ -/***/ ((module) => { - -/** - * Helpers. - */ - -var s = 1000; -var m = s * 60; -var h = m * 60; -var d = h * 24; -var w = d * 7; -var y = d * 365.25; - -/** - * Parse or format the given `val`. - * - * Options: - * - * - `long` verbose formatting [false] - * - * @param {String|Number} val - * @param {Object} [options] - * @throws {Error} throw an error if val is not a non-empty string or a number - * @return {String|Number} - * @api public - */ - -module.exports = function(val, options) { - options = options || {}; - var type = typeof val; - if (type === 'string' && val.length > 0) { - return parse(val); - } else if (type === 'number' && isFinite(val)) { - return options.long ? fmtLong(val) : fmtShort(val); - } - throw new Error( - 'val is not a non-empty string or a valid number. val=' + - JSON.stringify(val) - ); -}; - -/** - * Parse the given `str` and return milliseconds. - * - * @param {String} str - * @return {Number} - * @api private - */ - -function parse(str) { - str = String(str); - if (str.length > 100) { - return; - } - var match = /^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec( - str - ); - if (!match) { - return; - } - var n = parseFloat(match[1]); - var type = (match[2] || 'ms').toLowerCase(); - switch (type) { - case 'years': - case 'year': - case 'yrs': - case 'yr': - case 'y': - return n * y; - case 'weeks': - case 'week': - case 'w': - return n * w; - case 'days': - case 'day': - case 'd': - return n * d; - case 'hours': - case 'hour': - case 'hrs': - case 'hr': - case 'h': - return n * h; - case 'minutes': - case 'minute': - case 'mins': - case 'min': - case 'm': - return n * m; - case 'seconds': - case 'second': - case 'secs': - case 'sec': - case 's': - return n * s; - case 'milliseconds': - case 'millisecond': - case 'msecs': - case 'msec': - case 'ms': - return n; - default: - return undefined; - } -} - -/** - * Short format for `ms`. - * - * @param {Number} ms - * @return {String} - * @api private - */ - -function fmtShort(ms) { - var msAbs = Math.abs(ms); - if (msAbs >= d) { - return Math.round(ms / d) + 'd'; - } - if (msAbs >= h) { - return Math.round(ms / h) + 'h'; - } - if (msAbs >= m) { - return Math.round(ms / m) + 'm'; - } - if (msAbs >= s) { - return Math.round(ms / s) + 's'; - } - return ms + 'ms'; -} - -/** - * Long format for `ms`. - * - * @param {Number} ms - * @return {String} - * @api private - */ - -function fmtLong(ms) { - var msAbs = Math.abs(ms); - if (msAbs >= d) { - return plural(ms, msAbs, d, 'day'); - } - if (msAbs >= h) { - return plural(ms, msAbs, h, 'hour'); - } - if (msAbs >= m) { - return plural(ms, msAbs, m, 'minute'); - } - if (msAbs >= s) { - return plural(ms, msAbs, s, 'second'); - } - return ms + ' ms'; -} - -/** - * Pluralization helper. - */ - -function plural(ms, msAbs, n, name) { - var isPlural = msAbs >= n * 1.5; - return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : ''); -} - - -/***/ }), - -/***/ "./node_modules/multistream/index.js": -/*!*******************************************!*\ - !*** ./node_modules/multistream/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*! multistream. MIT License. Feross Aboukhadijeh */ -const stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -const once = __webpack_require__(/*! once */ "./node_modules/once/once.js") - -function toStreams2Obj (s) { - return toStreams2(s, { objectMode: true, highWaterMark: 16 }) -} - -function toStreams2Buf (s) { - return toStreams2(s) -} - -function toStreams2 (s, opts) { - if (!s || typeof s === 'function' || s._readableState) return s - - const wrap = new stream.Readable(opts).wrap(s) - if (s.destroy) { - wrap.destroy = s.destroy.bind(s) - } - return wrap -} - -class MultiStream extends stream.Readable { - constructor (streams, opts) { - super({ ...opts, autoDestroy: true }) - - this._drained = false - this._forwarding = false - this._current = null - this._toStreams2 = (opts && opts.objectMode) ? toStreams2Obj : toStreams2Buf - - if (typeof streams === 'function') { - this._queue = streams - } else { - this._queue = streams.map(this._toStreams2) - this._queue.forEach(stream => { - if (typeof stream !== 'function') this._attachErrorListener(stream) - }) - } - - this._next() - } - - _read () { - this._drained = true - this._forward() - } - - _forward () { - if (this._forwarding || !this._drained || !this._current) return - this._forwarding = true - - let chunk - while (this._drained && (chunk = this._current.read()) !== null) { - this._drained = this.push(chunk) - } - - this._forwarding = false - } - - _destroy (err, cb) { - let streams = [] - if (this._current) streams.push(this._current) - if (typeof this._queue !== 'function') streams = streams.concat(this._queue) - - if (streams.length === 0) { - cb(err) - } else { - let counter = streams.length - let er = err - streams.forEach(stream => { - destroy(stream, err, err => { - er = er || err - if (--counter === 0) { - cb(er) - } - }) - }) - } - } - - _next () { - this._current = null - - if (typeof this._queue === 'function') { - this._queue((err, stream) => { - if (err) return this.destroy(err) - stream = this._toStreams2(stream) - this._attachErrorListener(stream) - this._gotNextStream(stream) - }) - } else { - let stream = this._queue.shift() - if (typeof stream === 'function') { - stream = this._toStreams2(stream()) - this._attachErrorListener(stream) - } - this._gotNextStream(stream) - } - } - - _gotNextStream (stream) { - if (!stream) { - this.push(null) - return - } - - this._current = stream - this._forward() - - const onReadable = () => { - this._forward() - } - - const onClose = () => { - if (!stream._readableState.ended && !stream.destroyed) { - const err = new Error('ERR_STREAM_PREMATURE_CLOSE') - err.code = 'ERR_STREAM_PREMATURE_CLOSE' - this.destroy(err) - } - } - - const onEnd = () => { - this._current = null - stream.removeListener('readable', onReadable) - stream.removeListener('end', onEnd) - stream.removeListener('close', onClose) - stream.destroy() - this._next() - } - - stream.on('readable', onReadable) - stream.once('end', onEnd) - stream.once('close', onClose) - } - - _attachErrorListener (stream) { - if (!stream) return - - const onError = (err) => { - stream.removeListener('error', onError) - this.destroy(err) - } - - stream.once('error', onError) - } -} - -MultiStream.obj = streams => ( - new MultiStream(streams, { objectMode: true, highWaterMark: 16 }) -) - -module.exports = MultiStream - -// Normalize stream destroy w/ callback. -function destroy (stream, err, cb) { - if (!stream.destroy || stream.destroyed) { - cb(err) - } else { - const callback = once(er => cb(er || err)) - stream - .on('error', callback) - .on('close', () => callback()) - .destroy(err, callback) - } -} - - -/***/ }), - -/***/ "./node_modules/next-event/index.js": -/*!******************************************!*\ - !*** ./node_modules/next-event/index.js ***! - \******************************************/ -/***/ ((module) => { - -module.exports = nextEvent - -function nextEvent (emitter, name) { - var next = null - emitter.on(name, function (data) { - if (!next) return - var fn = next - next = null - fn(data) - }) - - return function (once) { - next = once - } -} - - -/***/ }), - -/***/ "./node_modules/object-is/implementation.js": -/*!**************************************************!*\ - !*** ./node_modules/object-is/implementation.js ***! - \**************************************************/ -/***/ ((module) => { - -"use strict"; - - -var numberIsNaN = function (value) { - return value !== value; -}; - -module.exports = function is(a, b) { - if (a === 0 && b === 0) { - return 1 / a === 1 / b; - } - if (a === b) { - return true; - } - if (numberIsNaN(a) && numberIsNaN(b)) { - return true; - } - return false; -}; - - - -/***/ }), - -/***/ "./node_modules/object-is/index.js": -/*!*****************************************!*\ - !*** ./node_modules/object-is/index.js ***! - \*****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var define = __webpack_require__(/*! define-properties */ "./node_modules/define-properties/index.js"); -var callBind = __webpack_require__(/*! call-bind */ "./node_modules/call-bind/index.js"); - -var implementation = __webpack_require__(/*! ./implementation */ "./node_modules/object-is/implementation.js"); -var getPolyfill = __webpack_require__(/*! ./polyfill */ "./node_modules/object-is/polyfill.js"); -var shim = __webpack_require__(/*! ./shim */ "./node_modules/object-is/shim.js"); - -var polyfill = callBind(getPolyfill(), Object); - -define(polyfill, { - getPolyfill: getPolyfill, - implementation: implementation, - shim: shim -}); - -module.exports = polyfill; - - -/***/ }), - -/***/ "./node_modules/object-is/polyfill.js": -/*!********************************************!*\ - !*** ./node_modules/object-is/polyfill.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var implementation = __webpack_require__(/*! ./implementation */ "./node_modules/object-is/implementation.js"); - -module.exports = function getPolyfill() { - return typeof Object.is === 'function' ? Object.is : implementation; -}; - - -/***/ }), - -/***/ "./node_modules/object-is/shim.js": -/*!****************************************!*\ - !*** ./node_modules/object-is/shim.js ***! - \****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var getPolyfill = __webpack_require__(/*! ./polyfill */ "./node_modules/object-is/polyfill.js"); -var define = __webpack_require__(/*! define-properties */ "./node_modules/define-properties/index.js"); - -module.exports = function shimObjectIs() { - var polyfill = getPolyfill(); - define(Object, { is: polyfill }, { - is: function testObjectIs() { - return Object.is !== polyfill; - } - }); - return polyfill; -}; - - -/***/ }), - -/***/ "./node_modules/object-keys/implementation.js": -/*!****************************************************!*\ - !*** ./node_modules/object-keys/implementation.js ***! - \****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var keysShim; -if (!Object.keys) { - // modified from https://github.com/es-shims/es5-shim - var has = Object.prototype.hasOwnProperty; - var toStr = Object.prototype.toString; - var isArgs = __webpack_require__(/*! ./isArguments */ "./node_modules/object-keys/isArguments.js"); // eslint-disable-line global-require - var isEnumerable = Object.prototype.propertyIsEnumerable; - var hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString'); - var hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype'); - var dontEnums = [ - 'toString', - 'toLocaleString', - 'valueOf', - 'hasOwnProperty', - 'isPrototypeOf', - 'propertyIsEnumerable', - 'constructor' - ]; - var equalsConstructorPrototype = function (o) { - var ctor = o.constructor; - return ctor && ctor.prototype === o; - }; - var excludedKeys = { - $applicationCache: true, - $console: true, - $external: true, - $frame: true, - $frameElement: true, - $frames: true, - $innerHeight: true, - $innerWidth: true, - $onmozfullscreenchange: true, - $onmozfullscreenerror: true, - $outerHeight: true, - $outerWidth: true, - $pageXOffset: true, - $pageYOffset: true, - $parent: true, - $scrollLeft: true, - $scrollTop: true, - $scrollX: true, - $scrollY: true, - $self: true, - $webkitIndexedDB: true, - $webkitStorageInfo: true, - $window: true - }; - var hasAutomationEqualityBug = (function () { - /* global window */ - if (typeof window === 'undefined') { return false; } - for (var k in window) { - try { - if (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') { - try { - equalsConstructorPrototype(window[k]); - } catch (e) { - return true; - } - } - } catch (e) { - return true; - } - } - return false; - }()); - var equalsConstructorPrototypeIfNotBuggy = function (o) { - /* global window */ - if (typeof window === 'undefined' || !hasAutomationEqualityBug) { - return equalsConstructorPrototype(o); - } - try { - return equalsConstructorPrototype(o); - } catch (e) { - return false; - } - }; - - keysShim = function keys(object) { - var isObject = object !== null && typeof object === 'object'; - var isFunction = toStr.call(object) === '[object Function]'; - var isArguments = isArgs(object); - var isString = isObject && toStr.call(object) === '[object String]'; - var theKeys = []; - - if (!isObject && !isFunction && !isArguments) { - throw new TypeError('Object.keys called on a non-object'); - } - - var skipProto = hasProtoEnumBug && isFunction; - if (isString && object.length > 0 && !has.call(object, 0)) { - for (var i = 0; i < object.length; ++i) { - theKeys.push(String(i)); - } - } - - if (isArguments && object.length > 0) { - for (var j = 0; j < object.length; ++j) { - theKeys.push(String(j)); - } - } else { - for (var name in object) { - if (!(skipProto && name === 'prototype') && has.call(object, name)) { - theKeys.push(String(name)); - } - } - } - - if (hasDontEnumBug) { - var skipConstructor = equalsConstructorPrototypeIfNotBuggy(object); - - for (var k = 0; k < dontEnums.length; ++k) { - if (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) { - theKeys.push(dontEnums[k]); - } - } - } - return theKeys; - }; -} -module.exports = keysShim; - - -/***/ }), - -/***/ "./node_modules/object-keys/index.js": -/*!*******************************************!*\ - !*** ./node_modules/object-keys/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var slice = Array.prototype.slice; -var isArgs = __webpack_require__(/*! ./isArguments */ "./node_modules/object-keys/isArguments.js"); - -var origKeys = Object.keys; -var keysShim = origKeys ? function keys(o) { return origKeys(o); } : __webpack_require__(/*! ./implementation */ "./node_modules/object-keys/implementation.js"); - -var originalKeys = Object.keys; - -keysShim.shim = function shimObjectKeys() { - if (Object.keys) { - var keysWorksWithArguments = (function () { - // Safari 5.0 bug - var args = Object.keys(arguments); - return args && args.length === arguments.length; - }(1, 2)); - if (!keysWorksWithArguments) { - Object.keys = function keys(object) { // eslint-disable-line func-name-matching - if (isArgs(object)) { - return originalKeys(slice.call(object)); - } - return originalKeys(object); - }; - } - } else { - Object.keys = keysShim; - } - return Object.keys || keysShim; -}; - -module.exports = keysShim; - - -/***/ }), - -/***/ "./node_modules/object-keys/isArguments.js": -/*!*************************************************!*\ - !*** ./node_modules/object-keys/isArguments.js ***! - \*************************************************/ -/***/ ((module) => { - -"use strict"; - - -var toStr = Object.prototype.toString; - -module.exports = function isArguments(value) { - var str = toStr.call(value); - var isArgs = str === '[object Arguments]'; - if (!isArgs) { - isArgs = str !== '[object Array]' && - value !== null && - typeof value === 'object' && - typeof value.length === 'number' && - value.length >= 0 && - toStr.call(value.callee) === '[object Function]'; - } - return isArgs; -}; - - -/***/ }), - -/***/ "./node_modules/once/once.js": -/*!***********************************!*\ - !*** ./node_modules/once/once.js ***! - \***********************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var wrappy = __webpack_require__(/*! wrappy */ "./node_modules/wrappy/wrappy.js") -module.exports = wrappy(once) -module.exports.strict = wrappy(onceStrict) - -once.proto = once(function () { - Object.defineProperty(Function.prototype, 'once', { - value: function () { - return once(this) - }, - configurable: true - }) - - Object.defineProperty(Function.prototype, 'onceStrict', { - value: function () { - return onceStrict(this) - }, - configurable: true - }) -}) - -function once (fn) { - var f = function () { - if (f.called) return f.value - f.called = true - return f.value = fn.apply(this, arguments) - } - f.called = false - return f -} - -function onceStrict (fn) { - var f = function () { - if (f.called) - throw new Error(f.onceError) - f.called = true - return f.value = fn.apply(this, arguments) - } - var name = fn.name || 'Function wrapped with `once`' - f.onceError = name + " shouldn't be called more than once" - f.called = false - return f -} - - -/***/ }), - -/***/ "./node_modules/parse-asn1/aesid.json": -/*!********************************************!*\ - !*** ./node_modules/parse-asn1/aesid.json ***! - \********************************************/ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"2.16.840.1.101.3.4.1.1":"aes-128-ecb","2.16.840.1.101.3.4.1.2":"aes-128-cbc","2.16.840.1.101.3.4.1.3":"aes-128-ofb","2.16.840.1.101.3.4.1.4":"aes-128-cfb","2.16.840.1.101.3.4.1.21":"aes-192-ecb","2.16.840.1.101.3.4.1.22":"aes-192-cbc","2.16.840.1.101.3.4.1.23":"aes-192-ofb","2.16.840.1.101.3.4.1.24":"aes-192-cfb","2.16.840.1.101.3.4.1.41":"aes-256-ecb","2.16.840.1.101.3.4.1.42":"aes-256-cbc","2.16.840.1.101.3.4.1.43":"aes-256-ofb","2.16.840.1.101.3.4.1.44":"aes-256-cfb"}'); - -/***/ }), - -/***/ "./node_modules/parse-asn1/asn1.js": -/*!*****************************************!*\ - !*** ./node_modules/parse-asn1/asn1.js ***! - \*****************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js -// Fedor, you are amazing. - - -var asn1 = __webpack_require__(/*! asn1.js */ "./node_modules/asn1.js/lib/asn1.js") - -exports.certificate = __webpack_require__(/*! ./certificate */ "./node_modules/parse-asn1/certificate.js") - -var RSAPrivateKey = asn1.define('RSAPrivateKey', function () { - this.seq().obj( - this.key('version').int(), - this.key('modulus').int(), - this.key('publicExponent').int(), - this.key('privateExponent').int(), - this.key('prime1').int(), - this.key('prime2').int(), - this.key('exponent1').int(), - this.key('exponent2').int(), - this.key('coefficient').int() - ) -}) -exports.RSAPrivateKey = RSAPrivateKey - -var RSAPublicKey = asn1.define('RSAPublicKey', function () { - this.seq().obj( - this.key('modulus').int(), - this.key('publicExponent').int() - ) -}) -exports.RSAPublicKey = RSAPublicKey - -var PublicKey = asn1.define('SubjectPublicKeyInfo', function () { - this.seq().obj( - this.key('algorithm').use(AlgorithmIdentifier), - this.key('subjectPublicKey').bitstr() - ) -}) -exports.PublicKey = PublicKey - -var AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function () { - this.seq().obj( - this.key('algorithm').objid(), - this.key('none').null_().optional(), - this.key('curve').objid().optional(), - this.key('params').seq().obj( - this.key('p').int(), - this.key('q').int(), - this.key('g').int() - ).optional() - ) -}) - -var PrivateKeyInfo = asn1.define('PrivateKeyInfo', function () { - this.seq().obj( - this.key('version').int(), - this.key('algorithm').use(AlgorithmIdentifier), - this.key('subjectPrivateKey').octstr() - ) -}) -exports.PrivateKey = PrivateKeyInfo -var EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function () { - this.seq().obj( - this.key('algorithm').seq().obj( - this.key('id').objid(), - this.key('decrypt').seq().obj( - this.key('kde').seq().obj( - this.key('id').objid(), - this.key('kdeparams').seq().obj( - this.key('salt').octstr(), - this.key('iters').int() - ) - ), - this.key('cipher').seq().obj( - this.key('algo').objid(), - this.key('iv').octstr() - ) - ) - ), - this.key('subjectPrivateKey').octstr() - ) -}) - -exports.EncryptedPrivateKey = EncryptedPrivateKeyInfo - -var DSAPrivateKey = asn1.define('DSAPrivateKey', function () { - this.seq().obj( - this.key('version').int(), - this.key('p').int(), - this.key('q').int(), - this.key('g').int(), - this.key('pub_key').int(), - this.key('priv_key').int() - ) -}) -exports.DSAPrivateKey = DSAPrivateKey - -exports.DSAparam = asn1.define('DSAparam', function () { - this.int() -}) - -var ECPrivateKey = asn1.define('ECPrivateKey', function () { - this.seq().obj( - this.key('version').int(), - this.key('privateKey').octstr(), - this.key('parameters').optional().explicit(0).use(ECParameters), - this.key('publicKey').optional().explicit(1).bitstr() - ) -}) -exports.ECPrivateKey = ECPrivateKey - -var ECParameters = asn1.define('ECParameters', function () { - this.choice({ - namedCurve: this.objid() - }) -}) - -exports.signature = asn1.define('signature', function () { - this.seq().obj( - this.key('r').int(), - this.key('s').int() - ) -}) - - -/***/ }), - -/***/ "./node_modules/parse-asn1/certificate.js": -/*!************************************************!*\ - !*** ./node_modules/parse-asn1/certificate.js ***! - \************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// from https://github.com/Rantanen/node-dtls/blob/25a7dc861bda38cfeac93a723500eea4f0ac2e86/Certificate.js -// thanks to @Rantanen - - - -var asn = __webpack_require__(/*! asn1.js */ "./node_modules/asn1.js/lib/asn1.js") - -var Time = asn.define('Time', function () { - this.choice({ - utcTime: this.utctime(), - generalTime: this.gentime() - }) -}) - -var AttributeTypeValue = asn.define('AttributeTypeValue', function () { - this.seq().obj( - this.key('type').objid(), - this.key('value').any() - ) -}) - -var AlgorithmIdentifier = asn.define('AlgorithmIdentifier', function () { - this.seq().obj( - this.key('algorithm').objid(), - this.key('parameters').optional(), - this.key('curve').objid().optional() - ) -}) - -var SubjectPublicKeyInfo = asn.define('SubjectPublicKeyInfo', function () { - this.seq().obj( - this.key('algorithm').use(AlgorithmIdentifier), - this.key('subjectPublicKey').bitstr() - ) -}) - -var RelativeDistinguishedName = asn.define('RelativeDistinguishedName', function () { - this.setof(AttributeTypeValue) -}) - -var RDNSequence = asn.define('RDNSequence', function () { - this.seqof(RelativeDistinguishedName) -}) - -var Name = asn.define('Name', function () { - this.choice({ - rdnSequence: this.use(RDNSequence) - }) -}) - -var Validity = asn.define('Validity', function () { - this.seq().obj( - this.key('notBefore').use(Time), - this.key('notAfter').use(Time) - ) -}) - -var Extension = asn.define('Extension', function () { - this.seq().obj( - this.key('extnID').objid(), - this.key('critical').bool().def(false), - this.key('extnValue').octstr() - ) -}) - -var TBSCertificate = asn.define('TBSCertificate', function () { - this.seq().obj( - this.key('version').explicit(0).int().optional(), - this.key('serialNumber').int(), - this.key('signature').use(AlgorithmIdentifier), - this.key('issuer').use(Name), - this.key('validity').use(Validity), - this.key('subject').use(Name), - this.key('subjectPublicKeyInfo').use(SubjectPublicKeyInfo), - this.key('issuerUniqueID').implicit(1).bitstr().optional(), - this.key('subjectUniqueID').implicit(2).bitstr().optional(), - this.key('extensions').explicit(3).seqof(Extension).optional() - ) -}) - -var X509Certificate = asn.define('X509Certificate', function () { - this.seq().obj( - this.key('tbsCertificate').use(TBSCertificate), - this.key('signatureAlgorithm').use(AlgorithmIdentifier), - this.key('signatureValue').bitstr() - ) -}) - -module.exports = X509Certificate - - -/***/ }), - -/***/ "./node_modules/parse-asn1/fixProc.js": -/*!********************************************!*\ - !*** ./node_modules/parse-asn1/fixProc.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -// adapted from https://github.com/apatil/pemstrip -var findProc = /Proc-Type: 4,ENCRYPTED[\n\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\n\r]+([0-9A-z\n\r+/=]+)[\n\r]+/m -var startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m -var fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\n\r+/=]+)-----END \1-----$/m -var evp = __webpack_require__(/*! evp_bytestokey */ "./node_modules/evp_bytestokey/index.js") -var ciphers = __webpack_require__(/*! browserify-aes */ "./node_modules/browserify-aes/browser.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -module.exports = function (okey, password) { - var key = okey.toString() - var match = key.match(findProc) - var decrypted - if (!match) { - var match2 = key.match(fullRegex) - decrypted = Buffer.from(match2[2].replace(/[\r\n]/g, ''), 'base64') - } else { - var suite = 'aes' + match[1] - var iv = Buffer.from(match[2], 'hex') - var cipherText = Buffer.from(match[3].replace(/[\r\n]/g, ''), 'base64') - var cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key - var out = [] - var cipher = ciphers.createDecipheriv(suite, cipherKey, iv) - out.push(cipher.update(cipherText)) - out.push(cipher.final()) - decrypted = Buffer.concat(out) - } - var tag = key.match(startRegex)[1] - return { - tag: tag, - data: decrypted - } -} - - -/***/ }), - -/***/ "./node_modules/parse-asn1/index.js": -/*!******************************************!*\ - !*** ./node_modules/parse-asn1/index.js ***! - \******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var asn1 = __webpack_require__(/*! ./asn1 */ "./node_modules/parse-asn1/asn1.js") -var aesid = __webpack_require__(/*! ./aesid.json */ "./node_modules/parse-asn1/aesid.json") -var fixProc = __webpack_require__(/*! ./fixProc */ "./node_modules/parse-asn1/fixProc.js") -var ciphers = __webpack_require__(/*! browserify-aes */ "./node_modules/browserify-aes/browser.js") -var compat = __webpack_require__(/*! pbkdf2 */ "./node_modules/pbkdf2/browser.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -module.exports = parseKeys - -function parseKeys (buffer) { - var password - if (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) { - password = buffer.passphrase - buffer = buffer.key - } - if (typeof buffer === 'string') { - buffer = Buffer.from(buffer) - } - - var stripped = fixProc(buffer, password) - - var type = stripped.tag - var data = stripped.data - var subtype, ndata - switch (type) { - case 'CERTIFICATE': - ndata = asn1.certificate.decode(data, 'der').tbsCertificate.subjectPublicKeyInfo - // falls through - case 'PUBLIC KEY': - if (!ndata) { - ndata = asn1.PublicKey.decode(data, 'der') - } - subtype = ndata.algorithm.algorithm.join('.') - switch (subtype) { - case '1.2.840.113549.1.1.1': - return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der') - case '1.2.840.10045.2.1': - ndata.subjectPrivateKey = ndata.subjectPublicKey - return { - type: 'ec', - data: ndata - } - case '1.2.840.10040.4.1': - ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der') - return { - type: 'dsa', - data: ndata.algorithm.params - } - default: throw new Error('unknown key id ' + subtype) - } - // throw new Error('unknown key type ' + type) - case 'ENCRYPTED PRIVATE KEY': - data = asn1.EncryptedPrivateKey.decode(data, 'der') - data = decrypt(data, password) - // falls through - case 'PRIVATE KEY': - ndata = asn1.PrivateKey.decode(data, 'der') - subtype = ndata.algorithm.algorithm.join('.') - switch (subtype) { - case '1.2.840.113549.1.1.1': - return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der') - case '1.2.840.10045.2.1': - return { - curve: ndata.algorithm.curve, - privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey - } - case '1.2.840.10040.4.1': - ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der') - return { - type: 'dsa', - params: ndata.algorithm.params - } - default: throw new Error('unknown key id ' + subtype) - } - // throw new Error('unknown key type ' + type) - case 'RSA PUBLIC KEY': - return asn1.RSAPublicKey.decode(data, 'der') - case 'RSA PRIVATE KEY': - return asn1.RSAPrivateKey.decode(data, 'der') - case 'DSA PRIVATE KEY': - return { - type: 'dsa', - params: asn1.DSAPrivateKey.decode(data, 'der') - } - case 'EC PRIVATE KEY': - data = asn1.ECPrivateKey.decode(data, 'der') - return { - curve: data.parameters.value, - privateKey: data.privateKey - } - default: throw new Error('unknown key type ' + type) - } -} -parseKeys.signature = asn1.signature -function decrypt (data, password) { - var salt = data.algorithm.decrypt.kde.kdeparams.salt - var iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10) - var algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')] - var iv = data.algorithm.decrypt.cipher.iv - var cipherText = data.subjectPrivateKey - var keylen = parseInt(algo.split('-')[1], 10) / 8 - var key = compat.pbkdf2Sync(password, salt, iters, keylen, 'sha1') - var cipher = ciphers.createDecipheriv(algo, key, iv) - var out = [] - out.push(cipher.update(cipherText)) - out.push(cipher.final()) - return Buffer.concat(out) -} - - -/***/ }), - -/***/ "./node_modules/parse-torrent/index.js": -/*!*********************************************!*\ - !*** ./node_modules/parse-torrent/index.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! parse-torrent. MIT License. WebTorrent LLC */ -/* global Blob */ - -const bencode = __webpack_require__(/*! bencode */ "./node_modules/bencode/lib/index.js") -const blobToBuffer = __webpack_require__(/*! blob-to-buffer */ "./node_modules/blob-to-buffer/index.js") -const fs = __webpack_require__(/*! fs */ "?8539") // browser exclude -const get = __webpack_require__(/*! simple-get */ "./node_modules/simple-get/index.js") -const magnet = __webpack_require__(/*! magnet-uri */ "./node_modules/magnet-uri/index.js") -const path = __webpack_require__(/*! path */ "./node_modules/path-browserify/index.js") -const sha1 = __webpack_require__(/*! simple-sha1 */ "./node_modules/simple-sha1/browser.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -module.exports = parseTorrent -module.exports.remote = parseTorrentRemote - -module.exports.toMagnetURI = magnet.encode -module.exports.toTorrentFile = encodeTorrentFile - -/** - * Parse a torrent identifier (magnet uri, .torrent file, info hash) - * @param {string|Buffer|Object} torrentId - * @return {Object} - */ -function parseTorrent (torrentId) { - if (typeof torrentId === 'string' && /^(stream-)?magnet:/.test(torrentId)) { - // if magnet uri (string) - const torrentObj = magnet(torrentId) - - // infoHash won't be defined if a non-bittorrent magnet is passed - if (!torrentObj.infoHash) { - throw new Error('Invalid torrent identifier') - } - - return torrentObj - } else if (typeof torrentId === 'string' && (/^[a-f0-9]{40}$/i.test(torrentId) || /^[a-z2-7]{32}$/i.test(torrentId))) { - // if info hash (hex/base-32 string) - return magnet(`magnet:?xt=urn:btih:${torrentId}`) - } else if (Buffer.isBuffer(torrentId) && torrentId.length === 20) { - // if info hash (buffer) - return magnet(`magnet:?xt=urn:btih:${torrentId.toString('hex')}`) - } else if (Buffer.isBuffer(torrentId)) { - // if .torrent file (buffer) - return decodeTorrentFile(torrentId) // might throw - } else if (torrentId && torrentId.infoHash) { - // if parsed torrent (from `parse-torrent` or `magnet-uri`) - torrentId.infoHash = torrentId.infoHash.toLowerCase() - - if (!torrentId.announce) torrentId.announce = [] - - if (typeof torrentId.announce === 'string') { - torrentId.announce = [torrentId.announce] - } - - if (!torrentId.urlList) torrentId.urlList = [] - - return torrentId - } else { - throw new Error('Invalid torrent identifier') - } -} - -function parseTorrentRemote (torrentId, opts, cb) { - if (typeof opts === 'function') return parseTorrentRemote(torrentId, {}, opts) - if (typeof cb !== 'function') throw new Error('second argument must be a Function') - - let parsedTorrent - try { - parsedTorrent = parseTorrent(torrentId) - } catch (err) { - // If torrent fails to parse, it could be a Blob, http/https URL or - // filesystem path, so don't consider it an error yet. - } - - if (parsedTorrent && parsedTorrent.infoHash) { - queueMicrotask(() => { - cb(null, parsedTorrent) - }) - } else if (isBlob(torrentId)) { - blobToBuffer(torrentId, (err, torrentBuf) => { - if (err) return cb(new Error(`Error converting Blob: ${err.message}`)) - parseOrThrow(torrentBuf) - }) - } else if (typeof get === 'function' && /^https?:/.test(torrentId)) { - // http, or https url to torrent file - opts = Object.assign({ - url: torrentId, - timeout: 30 * 1000, - headers: { 'user-agent': 'WebTorrent (https://webtorrent.io)' } - }, opts) - get.concat(opts, (err, res, torrentBuf) => { - if (err) return cb(new Error(`Error downloading torrent: ${err.message}`)) - parseOrThrow(torrentBuf) - }) - } else if (typeof fs.readFile === 'function' && typeof torrentId === 'string') { - // assume it's a filesystem path - fs.readFile(torrentId, (err, torrentBuf) => { - if (err) return cb(new Error('Invalid torrent identifier')) - parseOrThrow(torrentBuf) - }) - } else { - queueMicrotask(() => { - cb(new Error('Invalid torrent identifier')) - }) - } - - function parseOrThrow (torrentBuf) { - try { - parsedTorrent = parseTorrent(torrentBuf) - } catch (err) { - return cb(err) - } - if (parsedTorrent && parsedTorrent.infoHash) cb(null, parsedTorrent) - else cb(new Error('Invalid torrent identifier')) - } -} - -/** - * Parse a torrent. Throws an exception if the torrent is missing required fields. - * @param {Buffer|Object} torrent - * @return {Object} parsed torrent - */ -function decodeTorrentFile (torrent) { - if (Buffer.isBuffer(torrent)) { - torrent = bencode.decode(torrent) - } - - // sanity check - ensure(torrent.info, 'info') - ensure(torrent.info['name.utf-8'] || torrent.info.name, 'info.name') - ensure(torrent.info['piece length'], 'info[\'piece length\']') - ensure(torrent.info.pieces, 'info.pieces') - - if (torrent.info.files) { - torrent.info.files.forEach(file => { - ensure(typeof file.length === 'number', 'info.files[0].length') - ensure(file['path.utf-8'] || file.path, 'info.files[0].path') - }) - } else { - ensure(typeof torrent.info.length === 'number', 'info.length') - } - - const result = { - info: torrent.info, - infoBuffer: bencode.encode(torrent.info), - name: (torrent.info['name.utf-8'] || torrent.info.name).toString(), - announce: [] - } - - result.infoHash = sha1.sync(result.infoBuffer) - result.infoHashBuffer = Buffer.from(result.infoHash, 'hex') - - if (torrent.info.private !== undefined) result.private = !!torrent.info.private - - if (torrent['creation date']) result.created = new Date(torrent['creation date'] * 1000) - if (torrent['created by']) result.createdBy = torrent['created by'].toString() - - if (Buffer.isBuffer(torrent.comment)) result.comment = torrent.comment.toString() - - // announce and announce-list will be missing if metadata fetched via ut_metadata - if (Array.isArray(torrent['announce-list']) && torrent['announce-list'].length > 0) { - torrent['announce-list'].forEach(urls => { - urls.forEach(url => { - result.announce.push(url.toString()) - }) - }) - } else if (torrent.announce) { - result.announce.push(torrent.announce.toString()) - } - - // handle url-list (BEP19 / web seeding) - if (Buffer.isBuffer(torrent['url-list'])) { - // some clients set url-list to empty string - torrent['url-list'] = torrent['url-list'].length > 0 - ? [torrent['url-list']] - : [] - } - result.urlList = (torrent['url-list'] || []).map(url => url.toString()) - - // remove duplicates by converting to Set and back - result.announce = Array.from(new Set(result.announce)) - result.urlList = Array.from(new Set(result.urlList)) - - const files = torrent.info.files || [torrent.info] - result.files = files.map((file, i) => { - const parts = [].concat(result.name, file['path.utf-8'] || file.path || []).map(p => p.toString()) - return { - path: path.join.apply(null, [path.sep].concat(parts)).slice(1), - name: parts[parts.length - 1], - length: file.length, - offset: files.slice(0, i).reduce(sumLength, 0) - } - }) - - result.length = files.reduce(sumLength, 0) - - const lastFile = result.files[result.files.length - 1] - - result.pieceLength = torrent.info['piece length'] - result.lastPieceLength = ((lastFile.offset + lastFile.length) % result.pieceLength) || result.pieceLength - result.pieces = splitPieces(torrent.info.pieces) - - return result -} - -/** - * Convert a parsed torrent object back into a .torrent file buffer. - * @param {Object} parsed parsed torrent - * @return {Buffer} - */ -function encodeTorrentFile (parsed) { - const torrent = { - info: parsed.info - } - - torrent['announce-list'] = (parsed.announce || []).map(url => { - if (!torrent.announce) torrent.announce = url - url = Buffer.from(url, 'utf8') - return [url] - }) - - torrent['url-list'] = parsed.urlList || [] - - if (parsed.private !== undefined) { - torrent.private = Number(parsed.private) - } - - if (parsed.created) { - torrent['creation date'] = (parsed.created.getTime() / 1000) | 0 - } - - if (parsed.createdBy) { - torrent['created by'] = parsed.createdBy - } - - if (parsed.comment) { - torrent.comment = parsed.comment - } - - return bencode.encode(torrent) -} - -/** - * Check if `obj` is a W3C `Blob` or `File` object - * @param {*} obj - * @return {boolean} - */ -function isBlob (obj) { - return typeof Blob !== 'undefined' && obj instanceof Blob -} - -function sumLength (sum, file) { - return sum + file.length -} - -function splitPieces (buf) { - const pieces = [] - for (let i = 0; i < buf.length; i += 20) { - pieces.push(buf.slice(i, i + 20).toString('hex')) - } - return pieces -} - -function ensure (bool, fieldName) { - if (!bool) throw new Error(`Torrent is missing required field: ${fieldName}`) -} - -// Workaround Browserify v13 bug -// https://github.com/substack/node-browserify/issues/1483 -;(() => { Buffer.alloc(0) })() - - -/***/ }), - -/***/ "./node_modules/path-browserify/index.js": -/*!***********************************************!*\ - !*** ./node_modules/path-browserify/index.js ***! - \***********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -// 'path' module extracted from Node.js v8.11.1 (only the posix part) -// transplited with Babel - -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - - -function assertPath(path) { - if (typeof path !== 'string') { - throw new TypeError('Path must be a string. Received ' + JSON.stringify(path)); - } -} - -// Resolves . and .. elements in a path with directory names -function normalizeStringPosix(path, allowAboveRoot) { - var res = ''; - var lastSegmentLength = 0; - var lastSlash = -1; - var dots = 0; - var code; - for (var i = 0; i <= path.length; ++i) { - if (i < path.length) - code = path.charCodeAt(i); - else if (code === 47 /*/*/) - break; - else - code = 47 /*/*/; - if (code === 47 /*/*/) { - if (lastSlash === i - 1 || dots === 1) { - // NOOP - } else if (lastSlash !== i - 1 && dots === 2) { - if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) { - if (res.length > 2) { - var lastSlashIndex = res.lastIndexOf('/'); - if (lastSlashIndex !== res.length - 1) { - if (lastSlashIndex === -1) { - res = ''; - lastSegmentLength = 0; - } else { - res = res.slice(0, lastSlashIndex); - lastSegmentLength = res.length - 1 - res.lastIndexOf('/'); - } - lastSlash = i; - dots = 0; - continue; - } - } else if (res.length === 2 || res.length === 1) { - res = ''; - lastSegmentLength = 0; - lastSlash = i; - dots = 0; - continue; - } - } - if (allowAboveRoot) { - if (res.length > 0) - res += '/..'; - else - res = '..'; - lastSegmentLength = 2; - } - } else { - if (res.length > 0) - res += '/' + path.slice(lastSlash + 1, i); - else - res = path.slice(lastSlash + 1, i); - lastSegmentLength = i - lastSlash - 1; - } - lastSlash = i; - dots = 0; - } else if (code === 46 /*.*/ && dots !== -1) { - ++dots; - } else { - dots = -1; - } - } - return res; -} - -function _format(sep, pathObject) { - var dir = pathObject.dir || pathObject.root; - var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || ''); - if (!dir) { - return base; - } - if (dir === pathObject.root) { - return dir + base; - } - return dir + sep + base; -} - -var posix = { - // path.resolve([from ...], to) - resolve: function resolve() { - var resolvedPath = ''; - var resolvedAbsolute = false; - var cwd; - - for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) { - var path; - if (i >= 0) - path = arguments[i]; - else { - if (cwd === undefined) - cwd = process.cwd(); - path = cwd; - } - - assertPath(path); - - // Skip empty entries - if (path.length === 0) { - continue; - } - - resolvedPath = path + '/' + resolvedPath; - resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/; - } - - // At this point the path should be resolved to a full absolute path, but - // handle relative paths to be safe (might happen when process.cwd() fails) - - // Normalize the path - resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute); - - if (resolvedAbsolute) { - if (resolvedPath.length > 0) - return '/' + resolvedPath; - else - return '/'; - } else if (resolvedPath.length > 0) { - return resolvedPath; - } else { - return '.'; - } - }, - - normalize: function normalize(path) { - assertPath(path); - - if (path.length === 0) return '.'; - - var isAbsolute = path.charCodeAt(0) === 47 /*/*/; - var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/; - - // Normalize the path - path = normalizeStringPosix(path, !isAbsolute); - - if (path.length === 0 && !isAbsolute) path = '.'; - if (path.length > 0 && trailingSeparator) path += '/'; - - if (isAbsolute) return '/' + path; - return path; - }, - - isAbsolute: function isAbsolute(path) { - assertPath(path); - return path.length > 0 && path.charCodeAt(0) === 47 /*/*/; - }, - - join: function join() { - if (arguments.length === 0) - return '.'; - var joined; - for (var i = 0; i < arguments.length; ++i) { - var arg = arguments[i]; - assertPath(arg); - if (arg.length > 0) { - if (joined === undefined) - joined = arg; - else - joined += '/' + arg; - } - } - if (joined === undefined) - return '.'; - return posix.normalize(joined); - }, - - relative: function relative(from, to) { - assertPath(from); - assertPath(to); - - if (from === to) return ''; - - from = posix.resolve(from); - to = posix.resolve(to); - - if (from === to) return ''; - - // Trim any leading backslashes - var fromStart = 1; - for (; fromStart < from.length; ++fromStart) { - if (from.charCodeAt(fromStart) !== 47 /*/*/) - break; - } - var fromEnd = from.length; - var fromLen = fromEnd - fromStart; - - // Trim any leading backslashes - var toStart = 1; - for (; toStart < to.length; ++toStart) { - if (to.charCodeAt(toStart) !== 47 /*/*/) - break; - } - var toEnd = to.length; - var toLen = toEnd - toStart; - - // Compare paths to find the longest common path from root - var length = fromLen < toLen ? fromLen : toLen; - var lastCommonSep = -1; - var i = 0; - for (; i <= length; ++i) { - if (i === length) { - if (toLen > length) { - if (to.charCodeAt(toStart + i) === 47 /*/*/) { - // We get here if `from` is the exact base path for `to`. - // For example: from='/foo/bar'; to='/foo/bar/baz' - return to.slice(toStart + i + 1); - } else if (i === 0) { - // We get here if `from` is the root - // For example: from='/'; to='/foo' - return to.slice(toStart + i); - } - } else if (fromLen > length) { - if (from.charCodeAt(fromStart + i) === 47 /*/*/) { - // We get here if `to` is the exact base path for `from`. - // For example: from='/foo/bar/baz'; to='/foo/bar' - lastCommonSep = i; - } else if (i === 0) { - // We get here if `to` is the root. - // For example: from='/foo'; to='/' - lastCommonSep = 0; - } - } - break; - } - var fromCode = from.charCodeAt(fromStart + i); - var toCode = to.charCodeAt(toStart + i); - if (fromCode !== toCode) - break; - else if (fromCode === 47 /*/*/) - lastCommonSep = i; - } - - var out = ''; - // Generate the relative path based on the path difference between `to` - // and `from` - for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) { - if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) { - if (out.length === 0) - out += '..'; - else - out += '/..'; - } - } - - // Lastly, append the rest of the destination (`to`) path that comes after - // the common path parts - if (out.length > 0) - return out + to.slice(toStart + lastCommonSep); - else { - toStart += lastCommonSep; - if (to.charCodeAt(toStart) === 47 /*/*/) - ++toStart; - return to.slice(toStart); - } - }, - - _makeLong: function _makeLong(path) { - return path; - }, - - dirname: function dirname(path) { - assertPath(path); - if (path.length === 0) return '.'; - var code = path.charCodeAt(0); - var hasRoot = code === 47 /*/*/; - var end = -1; - var matchedSlash = true; - for (var i = path.length - 1; i >= 1; --i) { - code = path.charCodeAt(i); - if (code === 47 /*/*/) { - if (!matchedSlash) { - end = i; - break; - } - } else { - // We saw the first non-path separator - matchedSlash = false; - } - } - - if (end === -1) return hasRoot ? '/' : '.'; - if (hasRoot && end === 1) return '//'; - return path.slice(0, end); - }, - - basename: function basename(path, ext) { - if (ext !== undefined && typeof ext !== 'string') throw new TypeError('"ext" argument must be a string'); - assertPath(path); - - var start = 0; - var end = -1; - var matchedSlash = true; - var i; - - if (ext !== undefined && ext.length > 0 && ext.length <= path.length) { - if (ext.length === path.length && ext === path) return ''; - var extIdx = ext.length - 1; - var firstNonSlashEnd = -1; - for (i = path.length - 1; i >= 0; --i) { - var code = path.charCodeAt(i); - if (code === 47 /*/*/) { - // If we reached a path separator that was not part of a set of path - // separators at the end of the string, stop now - if (!matchedSlash) { - start = i + 1; - break; - } - } else { - if (firstNonSlashEnd === -1) { - // We saw the first non-path separator, remember this index in case - // we need it if the extension ends up not matching - matchedSlash = false; - firstNonSlashEnd = i + 1; - } - if (extIdx >= 0) { - // Try to match the explicit extension - if (code === ext.charCodeAt(extIdx)) { - if (--extIdx === -1) { - // We matched the extension, so mark this as the end of our path - // component - end = i; - } - } else { - // Extension does not match, so our result is the entire path - // component - extIdx = -1; - end = firstNonSlashEnd; - } - } - } - } - - if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length; - return path.slice(start, end); - } else { - for (i = path.length - 1; i >= 0; --i) { - if (path.charCodeAt(i) === 47 /*/*/) { - // If we reached a path separator that was not part of a set of path - // separators at the end of the string, stop now - if (!matchedSlash) { - start = i + 1; - break; - } - } else if (end === -1) { - // We saw the first non-path separator, mark this as the end of our - // path component - matchedSlash = false; - end = i + 1; - } - } - - if (end === -1) return ''; - return path.slice(start, end); - } - }, - - extname: function extname(path) { - assertPath(path); - var startDot = -1; - var startPart = 0; - var end = -1; - var matchedSlash = true; - // Track the state of characters (if any) we see before our first dot and - // after any path separator we find - var preDotState = 0; - for (var i = path.length - 1; i >= 0; --i) { - var code = path.charCodeAt(i); - if (code === 47 /*/*/) { - // If we reached a path separator that was not part of a set of path - // separators at the end of the string, stop now - if (!matchedSlash) { - startPart = i + 1; - break; - } - continue; - } - if (end === -1) { - // We saw the first non-path separator, mark this as the end of our - // extension - matchedSlash = false; - end = i + 1; - } - if (code === 46 /*.*/) { - // If this is our first dot, mark it as the start of our extension - if (startDot === -1) - startDot = i; - else if (preDotState !== 1) - preDotState = 1; - } else if (startDot !== -1) { - // We saw a non-dot and non-path separator before our dot, so we should - // have a good chance at having a non-empty extension - preDotState = -1; - } - } - - if (startDot === -1 || end === -1 || - // We saw a non-dot character immediately before the dot - preDotState === 0 || - // The (right-most) trimmed path component is exactly '..' - preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) { - return ''; - } - return path.slice(startDot, end); - }, - - format: function format(pathObject) { - if (pathObject === null || typeof pathObject !== 'object') { - throw new TypeError('The "pathObject" argument must be of type Object. Received type ' + typeof pathObject); - } - return _format('/', pathObject); - }, - - parse: function parse(path) { - assertPath(path); - - var ret = { root: '', dir: '', base: '', ext: '', name: '' }; - if (path.length === 0) return ret; - var code = path.charCodeAt(0); - var isAbsolute = code === 47 /*/*/; - var start; - if (isAbsolute) { - ret.root = '/'; - start = 1; - } else { - start = 0; - } - var startDot = -1; - var startPart = 0; - var end = -1; - var matchedSlash = true; - var i = path.length - 1; - - // Track the state of characters (if any) we see before our first dot and - // after any path separator we find - var preDotState = 0; - - // Get non-dir info - for (; i >= start; --i) { - code = path.charCodeAt(i); - if (code === 47 /*/*/) { - // If we reached a path separator that was not part of a set of path - // separators at the end of the string, stop now - if (!matchedSlash) { - startPart = i + 1; - break; - } - continue; - } - if (end === -1) { - // We saw the first non-path separator, mark this as the end of our - // extension - matchedSlash = false; - end = i + 1; - } - if (code === 46 /*.*/) { - // If this is our first dot, mark it as the start of our extension - if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1; - } else if (startDot !== -1) { - // We saw a non-dot and non-path separator before our dot, so we should - // have a good chance at having a non-empty extension - preDotState = -1; - } - } - - if (startDot === -1 || end === -1 || - // We saw a non-dot character immediately before the dot - preDotState === 0 || - // The (right-most) trimmed path component is exactly '..' - preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) { - if (end !== -1) { - if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end); - } - } else { - if (startPart === 0 && isAbsolute) { - ret.name = path.slice(1, startDot); - ret.base = path.slice(1, end); - } else { - ret.name = path.slice(startPart, startDot); - ret.base = path.slice(startPart, end); - } - ret.ext = path.slice(startDot, end); - } - - if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/'; - - return ret; - }, - - sep: '/', - delimiter: ':', - win32: null, - posix: null -}; - -posix.posix = posix; - -module.exports = posix; - - -/***/ }), - -/***/ "./node_modules/pbkdf2/browser.js": -/*!****************************************!*\ - !*** ./node_modules/pbkdf2/browser.js ***! - \****************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -exports.pbkdf2 = __webpack_require__(/*! ./lib/async */ "./node_modules/pbkdf2/lib/async.js") -exports.pbkdf2Sync = __webpack_require__(/*! ./lib/sync */ "./node_modules/pbkdf2/lib/sync-browser.js") - - -/***/ }), - -/***/ "./node_modules/pbkdf2/lib/async.js": -/*!******************************************!*\ - !*** ./node_modules/pbkdf2/lib/async.js ***! - \******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var checkParameters = __webpack_require__(/*! ./precondition */ "./node_modules/pbkdf2/lib/precondition.js") -var defaultEncoding = __webpack_require__(/*! ./default-encoding */ "./node_modules/pbkdf2/lib/default-encoding.js") -var sync = __webpack_require__(/*! ./sync */ "./node_modules/pbkdf2/lib/sync-browser.js") -var toBuffer = __webpack_require__(/*! ./to-buffer */ "./node_modules/pbkdf2/lib/to-buffer.js") - -var ZERO_BUF -var subtle = __webpack_require__.g.crypto && __webpack_require__.g.crypto.subtle -var toBrowser = { - sha: 'SHA-1', - 'sha-1': 'SHA-1', - sha1: 'SHA-1', - sha256: 'SHA-256', - 'sha-256': 'SHA-256', - sha384: 'SHA-384', - 'sha-384': 'SHA-384', - 'sha-512': 'SHA-512', - sha512: 'SHA-512' -} -var checks = [] -function checkNative (algo) { - if (__webpack_require__.g.process && !__webpack_require__.g.process.browser) { - return Promise.resolve(false) - } - if (!subtle || !subtle.importKey || !subtle.deriveBits) { - return Promise.resolve(false) - } - if (checks[algo] !== undefined) { - return checks[algo] - } - ZERO_BUF = ZERO_BUF || Buffer.alloc(8) - var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo) - .then(function () { - return true - }).catch(function () { - return false - }) - checks[algo] = prom - return prom -} -var nextTick -function getNextTick () { - if (nextTick) { - return nextTick - } - if (__webpack_require__.g.process && __webpack_require__.g.process.nextTick) { - nextTick = __webpack_require__.g.process.nextTick - } else if (__webpack_require__.g.queueMicrotask) { - nextTick = __webpack_require__.g.queueMicrotask - } else if (__webpack_require__.g.setImmediate) { - nextTick = __webpack_require__.g.setImmediate - } else { - nextTick = __webpack_require__.g.setTimeout - } - return nextTick -} -function browserPbkdf2 (password, salt, iterations, length, algo) { - return subtle.importKey( - 'raw', password, { name: 'PBKDF2' }, false, ['deriveBits'] - ).then(function (key) { - return subtle.deriveBits({ - name: 'PBKDF2', - salt: salt, - iterations: iterations, - hash: { - name: algo - } - }, key, length << 3) - }).then(function (res) { - return Buffer.from(res) - }) -} - -function resolvePromise (promise, callback) { - promise.then(function (out) { - getNextTick()(function () { - callback(null, out) - }) - }, function (e) { - getNextTick()(function () { - callback(e) - }) - }) -} -module.exports = function (password, salt, iterations, keylen, digest, callback) { - if (typeof digest === 'function') { - callback = digest - digest = undefined - } - - digest = digest || 'sha1' - var algo = toBrowser[digest.toLowerCase()] - - if (!algo || typeof __webpack_require__.g.Promise !== 'function') { - getNextTick()(function () { - var out - try { - out = sync(password, salt, iterations, keylen, digest) - } catch (e) { - return callback(e) - } - callback(null, out) - }) - return - } - - checkParameters(iterations, keylen) - password = toBuffer(password, defaultEncoding, 'Password') - salt = toBuffer(salt, defaultEncoding, 'Salt') - if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2') - - resolvePromise(checkNative(algo).then(function (resp) { - if (resp) return browserPbkdf2(password, salt, iterations, keylen, algo) - - return sync(password, salt, iterations, keylen, digest) - }), callback) -} - - -/***/ }), - -/***/ "./node_modules/pbkdf2/lib/default-encoding.js": -/*!*****************************************************!*\ - !*** ./node_modules/pbkdf2/lib/default-encoding.js ***! - \*****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -var defaultEncoding -/* istanbul ignore next */ -if (__webpack_require__.g.process && __webpack_require__.g.process.browser) { - defaultEncoding = 'utf-8' -} else if (__webpack_require__.g.process && __webpack_require__.g.process.version) { - var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10) - - defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary' -} else { - defaultEncoding = 'utf-8' -} -module.exports = defaultEncoding - - -/***/ }), - -/***/ "./node_modules/pbkdf2/lib/precondition.js": -/*!*************************************************!*\ - !*** ./node_modules/pbkdf2/lib/precondition.js ***! - \*************************************************/ -/***/ ((module) => { - -var MAX_ALLOC = Math.pow(2, 30) - 1 // default in iojs - -module.exports = function (iterations, keylen) { - if (typeof iterations !== 'number') { - throw new TypeError('Iterations not a number') - } - - if (iterations < 0) { - throw new TypeError('Bad iterations') - } - - if (typeof keylen !== 'number') { - throw new TypeError('Key length not a number') - } - - if (keylen < 0 || keylen > MAX_ALLOC || keylen !== keylen) { /* eslint no-self-compare: 0 */ - throw new TypeError('Bad key length') - } -} - - -/***/ }), - -/***/ "./node_modules/pbkdf2/lib/sync-browser.js": -/*!*************************************************!*\ - !*** ./node_modules/pbkdf2/lib/sync-browser.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var md5 = __webpack_require__(/*! create-hash/md5 */ "./node_modules/create-hash/md5.js") -var RIPEMD160 = __webpack_require__(/*! ripemd160 */ "./node_modules/ripemd160/index.js") -var sha = __webpack_require__(/*! sha.js */ "./node_modules/sha.js/index.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var checkParameters = __webpack_require__(/*! ./precondition */ "./node_modules/pbkdf2/lib/precondition.js") -var defaultEncoding = __webpack_require__(/*! ./default-encoding */ "./node_modules/pbkdf2/lib/default-encoding.js") -var toBuffer = __webpack_require__(/*! ./to-buffer */ "./node_modules/pbkdf2/lib/to-buffer.js") - -var ZEROS = Buffer.alloc(128) -var sizes = { - md5: 16, - sha1: 20, - sha224: 28, - sha256: 32, - sha384: 48, - sha512: 64, - rmd160: 20, - ripemd160: 20 -} - -function Hmac (alg, key, saltLen) { - var hash = getDigest(alg) - var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64 - - if (key.length > blocksize) { - key = hash(key) - } else if (key.length < blocksize) { - key = Buffer.concat([key, ZEROS], blocksize) - } - - var ipad = Buffer.allocUnsafe(blocksize + sizes[alg]) - var opad = Buffer.allocUnsafe(blocksize + sizes[alg]) - for (var i = 0; i < blocksize; i++) { - ipad[i] = key[i] ^ 0x36 - opad[i] = key[i] ^ 0x5C - } - - var ipad1 = Buffer.allocUnsafe(blocksize + saltLen + 4) - ipad.copy(ipad1, 0, 0, blocksize) - this.ipad1 = ipad1 - this.ipad2 = ipad - this.opad = opad - this.alg = alg - this.blocksize = blocksize - this.hash = hash - this.size = sizes[alg] -} - -Hmac.prototype.run = function (data, ipad) { - data.copy(ipad, this.blocksize) - var h = this.hash(ipad) - h.copy(this.opad, this.blocksize) - return this.hash(this.opad) -} - -function getDigest (alg) { - function shaFunc (data) { - return sha(alg).update(data).digest() - } - function rmd160Func (data) { - return new RIPEMD160().update(data).digest() - } - - if (alg === 'rmd160' || alg === 'ripemd160') return rmd160Func - if (alg === 'md5') return md5 - return shaFunc -} - -function pbkdf2 (password, salt, iterations, keylen, digest) { - checkParameters(iterations, keylen) - password = toBuffer(password, defaultEncoding, 'Password') - salt = toBuffer(salt, defaultEncoding, 'Salt') - - digest = digest || 'sha1' - - var hmac = new Hmac(digest, password, salt.length) - - var DK = Buffer.allocUnsafe(keylen) - var block1 = Buffer.allocUnsafe(salt.length + 4) - salt.copy(block1, 0, 0, salt.length) - - var destPos = 0 - var hLen = sizes[digest] - var l = Math.ceil(keylen / hLen) - - for (var i = 1; i <= l; i++) { - block1.writeUInt32BE(i, salt.length) - - var T = hmac.run(block1, hmac.ipad1) - var U = T - - for (var j = 1; j < iterations; j++) { - U = hmac.run(U, hmac.ipad2) - for (var k = 0; k < hLen; k++) T[k] ^= U[k] - } - - T.copy(DK, destPos) - destPos += hLen - } - - return DK -} - -module.exports = pbkdf2 - - -/***/ }), - -/***/ "./node_modules/pbkdf2/lib/to-buffer.js": -/*!**********************************************!*\ - !*** ./node_modules/pbkdf2/lib/to-buffer.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -module.exports = function (thing, encoding, name) { - if (Buffer.isBuffer(thing)) { - return thing - } else if (typeof thing === 'string') { - return Buffer.from(thing, encoding) - } else if (ArrayBuffer.isView(thing)) { - return Buffer.from(thing.buffer) - } else { - throw new TypeError(name + ' must be a string, a Buffer, a typed array or a DataView') - } -} - - -/***/ }), - -/***/ "./node_modules/piece-length/index.js": -/*!********************************************!*\ - !*** ./node_modules/piece-length/index.js ***! - \********************************************/ -/***/ ((module) => { - -module.exports = length - -function length (bytes) { - return Math.max(16384, 1 << Math.log2(bytes < 1024 ? 1 : bytes / 1024) + 0.5 | 0) -} - - -/***/ }), - -/***/ "./node_modules/process-fast/index.js": -/*!********************************************!*\ - !*** ./node_modules/process-fast/index.js ***! - \********************************************/ -/***/ ((module) => { - -const process = module.exports = {} - -process.title = 'browser' -process.browser = true -process.env = {} -process.argv = [] -process.version = '' -process.versions = {} - -function noop () {} - -process.on = noop -process.addListener = noop -process.once = noop -process.off = noop -process.removeListener = noop -process.removeAllListeners = noop -process.emit = noop -process.prependListener = noop -process.prependOnceListener = noop - -process.nextTick = (func, ...args) => window.queueMicrotask(() => func(...args)) - -process.listeners = (name) => [] - -process.cwd = () => '/' -process.umask = () => 0 -process.binding = (name) => { throw new Error('process.binding is not supported') } -process.chdir = (dir) => { throw new Error('process.chdir is not supported') } - - -/***/ }), - -/***/ "./node_modules/public-encrypt/browser.js": -/*!************************************************!*\ - !*** ./node_modules/public-encrypt/browser.js ***! - \************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -exports.publicEncrypt = __webpack_require__(/*! ./publicEncrypt */ "./node_modules/public-encrypt/publicEncrypt.js") -exports.privateDecrypt = __webpack_require__(/*! ./privateDecrypt */ "./node_modules/public-encrypt/privateDecrypt.js") - -exports.privateEncrypt = function privateEncrypt (key, buf) { - return exports.publicEncrypt(key, buf, true) -} - -exports.publicDecrypt = function publicDecrypt (key, buf) { - return exports.privateDecrypt(key, buf, true) -} - - -/***/ }), - -/***/ "./node_modules/public-encrypt/mgf.js": -/*!********************************************!*\ - !*** ./node_modules/public-encrypt/mgf.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var createHash = __webpack_require__(/*! create-hash */ "./node_modules/create-hash/browser.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -module.exports = function (seed, len) { - var t = Buffer.alloc(0) - var i = 0 - var c - while (t.length < len) { - c = i2ops(i++) - t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()]) - } - return t.slice(0, len) -} - -function i2ops (c) { - var out = Buffer.allocUnsafe(4) - out.writeUInt32BE(c, 0) - return out -} - - -/***/ }), - -/***/ "./node_modules/public-encrypt/node_modules/bn.js/lib/bn.js": -/*!******************************************************************!*\ - !*** ./node_modules/public-encrypt/node_modules/bn.js/lib/bn.js ***! - \******************************************************************/ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -(function (module, exports) { - 'use strict'; - - // Utils - function assert (val, msg) { - if (!val) throw new Error(msg || 'Assertion failed'); - } - - // Could use `inherits` module, but don't want to move from single file - // architecture yet. - function inherits (ctor, superCtor) { - ctor.super_ = superCtor; - var TempCtor = function () {}; - TempCtor.prototype = superCtor.prototype; - ctor.prototype = new TempCtor(); - ctor.prototype.constructor = ctor; - } - - // BN - - function BN (number, base, endian) { - if (BN.isBN(number)) { - return number; - } - - this.negative = 0; - this.words = null; - this.length = 0; - - // Reduction context - this.red = null; - - if (number !== null) { - if (base === 'le' || base === 'be') { - endian = base; - base = 10; - } - - this._init(number || 0, base || 10, endian || 'be'); - } - } - if (typeof module === 'object') { - module.exports = BN; - } else { - exports.BN = BN; - } - - BN.BN = BN; - BN.wordSize = 26; - - var Buffer; - try { - if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') { - Buffer = window.Buffer; - } else { - Buffer = __webpack_require__(/*! buffer */ "?fbf1").Buffer; - } - } catch (e) { - } - - BN.isBN = function isBN (num) { - if (num instanceof BN) { - return true; - } - - return num !== null && typeof num === 'object' && - num.constructor.wordSize === BN.wordSize && Array.isArray(num.words); - }; - - BN.max = function max (left, right) { - if (left.cmp(right) > 0) return left; - return right; - }; - - BN.min = function min (left, right) { - if (left.cmp(right) < 0) return left; - return right; - }; - - BN.prototype._init = function init (number, base, endian) { - if (typeof number === 'number') { - return this._initNumber(number, base, endian); - } - - if (typeof number === 'object') { - return this._initArray(number, base, endian); - } - - if (base === 'hex') { - base = 16; - } - assert(base === (base | 0) && base >= 2 && base <= 36); - - number = number.toString().replace(/\s+/g, ''); - var start = 0; - if (number[0] === '-') { - start++; - this.negative = 1; - } - - if (start < number.length) { - if (base === 16) { - this._parseHex(number, start, endian); - } else { - this._parseBase(number, base, start); - if (endian === 'le') { - this._initArray(this.toArray(), base, endian); - } - } - } - }; - - BN.prototype._initNumber = function _initNumber (number, base, endian) { - if (number < 0) { - this.negative = 1; - number = -number; - } - if (number < 0x4000000) { - this.words = [ number & 0x3ffffff ]; - this.length = 1; - } else if (number < 0x10000000000000) { - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff - ]; - this.length = 2; - } else { - assert(number < 0x20000000000000); // 2 ^ 53 (unsafe) - this.words = [ - number & 0x3ffffff, - (number / 0x4000000) & 0x3ffffff, - 1 - ]; - this.length = 3; - } - - if (endian !== 'le') return; - - // Reverse the bytes - this._initArray(this.toArray(), base, endian); - }; - - BN.prototype._initArray = function _initArray (number, base, endian) { - // Perhaps a Uint8Array - assert(typeof number.length === 'number'); - if (number.length <= 0) { - this.words = [ 0 ]; - this.length = 1; - return this; - } - - this.length = Math.ceil(number.length / 3); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - var j, w; - var off = 0; - if (endian === 'be') { - for (i = number.length - 1, j = 0; i >= 0; i -= 3) { - w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } else if (endian === 'le') { - for (i = 0, j = 0; i < number.length; i += 3) { - w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16); - this.words[j] |= (w << off) & 0x3ffffff; - this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff; - off += 24; - if (off >= 26) { - off -= 26; - j++; - } - } - } - return this.strip(); - }; - - function parseHex4Bits (string, index) { - var c = string.charCodeAt(index); - // 'A' - 'F' - if (c >= 65 && c <= 70) { - return c - 55; - // 'a' - 'f' - } else if (c >= 97 && c <= 102) { - return c - 87; - // '0' - '9' - } else { - return (c - 48) & 0xf; - } - } - - function parseHexByte (string, lowerBound, index) { - var r = parseHex4Bits(string, index); - if (index - 1 >= lowerBound) { - r |= parseHex4Bits(string, index - 1) << 4; - } - return r; - } - - BN.prototype._parseHex = function _parseHex (number, start, endian) { - // Create possibly bigger array to ensure that it fits the number - this.length = Math.ceil((number.length - start) / 6); - this.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - this.words[i] = 0; - } - - // 24-bits chunks - var off = 0; - var j = 0; - - var w; - if (endian === 'be') { - for (i = number.length - 1; i >= start; i -= 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } else { - var parseLength = number.length - start; - for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) { - w = parseHexByte(number, start, i) << off; - this.words[j] |= w & 0x3ffffff; - if (off >= 18) { - off -= 18; - j += 1; - this.words[j] |= w >>> 26; - } else { - off += 8; - } - } - } - - this.strip(); - }; - - function parseBase (str, start, end, mul) { - var r = 0; - var len = Math.min(str.length, end); - for (var i = start; i < len; i++) { - var c = str.charCodeAt(i) - 48; - - r *= mul; - - // 'a' - if (c >= 49) { - r += c - 49 + 0xa; - - // 'A' - } else if (c >= 17) { - r += c - 17 + 0xa; - - // '0' - '9' - } else { - r += c; - } - } - return r; - } - - BN.prototype._parseBase = function _parseBase (number, base, start) { - // Initialize as zero - this.words = [ 0 ]; - this.length = 1; - - // Find length of limb in base - for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) { - limbLen++; - } - limbLen--; - limbPow = (limbPow / base) | 0; - - var total = number.length - start; - var mod = total % limbLen; - var end = Math.min(total, total - mod) + start; - - var word = 0; - for (var i = start; i < end; i += limbLen) { - word = parseBase(number, i, i + limbLen, base); - - this.imuln(limbPow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - if (mod !== 0) { - var pow = 1; - word = parseBase(number, i, number.length, base); - - for (i = 0; i < mod; i++) { - pow *= base; - } - - this.imuln(pow); - if (this.words[0] + word < 0x4000000) { - this.words[0] += word; - } else { - this._iaddn(word); - } - } - - this.strip(); - }; - - BN.prototype.copy = function copy (dest) { - dest.words = new Array(this.length); - for (var i = 0; i < this.length; i++) { - dest.words[i] = this.words[i]; - } - dest.length = this.length; - dest.negative = this.negative; - dest.red = this.red; - }; - - BN.prototype.clone = function clone () { - var r = new BN(null); - this.copy(r); - return r; - }; - - BN.prototype._expand = function _expand (size) { - while (this.length < size) { - this.words[this.length++] = 0; - } - return this; - }; - - // Remove leading `0` from `this` - BN.prototype.strip = function strip () { - while (this.length > 1 && this.words[this.length - 1] === 0) { - this.length--; - } - return this._normSign(); - }; - - BN.prototype._normSign = function _normSign () { - // -0 = 0 - if (this.length === 1 && this.words[0] === 0) { - this.negative = 0; - } - return this; - }; - - BN.prototype.inspect = function inspect () { - return (this.red ? ''; - }; - - /* - - var zeros = []; - var groupSizes = []; - var groupBases = []; - - var s = ''; - var i = -1; - while (++i < BN.wordSize) { - zeros[i] = s; - s += '0'; - } - groupSizes[0] = 0; - groupSizes[1] = 0; - groupBases[0] = 0; - groupBases[1] = 0; - var base = 2 - 1; - while (++base < 36 + 1) { - var groupSize = 0; - var groupBase = 1; - while (groupBase < (1 << BN.wordSize) / base) { - groupBase *= base; - groupSize += 1; - } - groupSizes[base] = groupSize; - groupBases[base] = groupBase; - } - - */ - - 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' - ]; - - 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 - ]; - - 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 - ]; - - BN.prototype.toString = function toString (base, padding) { - base = base || 10; - padding = padding | 0 || 1; - - var out; - if (base === 16 || base === 'hex') { - out = ''; - var off = 0; - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = this.words[i]; - var word = (((w << off) | carry) & 0xffffff).toString(16); - carry = (w >>> (24 - off)) & 0xffffff; - if (carry !== 0 || i !== this.length - 1) { - out = zeros[6 - word.length] + word + out; - } else { - out = word + out; - } - off += 2; - if (off >= 26) { - off -= 26; - i--; - } - } - if (carry !== 0) { - out = carry.toString(16) + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - if (base === (base | 0) && base >= 2 && base <= 36) { - // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base)); - var groupSize = groupSizes[base]; - // var groupBase = Math.pow(base, groupSize); - var groupBase = groupBases[base]; - out = ''; - var c = this.clone(); - c.negative = 0; - while (!c.isZero()) { - var r = c.modn(groupBase).toString(base); - c = c.idivn(groupBase); - - if (!c.isZero()) { - out = zeros[groupSize - r.length] + r + out; - } else { - out = r + out; - } - } - if (this.isZero()) { - out = '0' + out; - } - while (out.length % padding !== 0) { - out = '0' + out; - } - if (this.negative !== 0) { - out = '-' + out; - } - return out; - } - - assert(false, 'Base should be between 2 and 36'); - }; - - BN.prototype.toNumber = function toNumber () { - var ret = this.words[0]; - if (this.length === 2) { - ret += this.words[1] * 0x4000000; - } else if (this.length === 3 && this.words[2] === 0x01) { - // NOTE: at this stage it is known that the top bit is set - ret += 0x10000000000000 + (this.words[1] * 0x4000000); - } else if (this.length > 2) { - assert(false, 'Number can only safely store up to 53 bits'); - } - return (this.negative !== 0) ? -ret : ret; - }; - - BN.prototype.toJSON = function toJSON () { - return this.toString(16); - }; - - BN.prototype.toBuffer = function toBuffer (endian, length) { - assert(typeof Buffer !== 'undefined'); - return this.toArrayLike(Buffer, endian, length); - }; - - BN.prototype.toArray = function toArray (endian, length) { - return this.toArrayLike(Array, endian, length); - }; - - BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) { - var byteLength = this.byteLength(); - var reqLength = length || Math.max(1, byteLength); - assert(byteLength <= reqLength, 'byte array longer than desired length'); - assert(reqLength > 0, 'Requested array length <= 0'); - - this.strip(); - var littleEndian = endian === 'le'; - var res = new ArrayType(reqLength); - - var b, i; - var q = this.clone(); - if (!littleEndian) { - // Assume big-endian - for (i = 0; i < reqLength - byteLength; i++) { - res[i] = 0; - } - - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[reqLength - i - 1] = b; - } - } else { - for (i = 0; !q.isZero(); i++) { - b = q.andln(0xff); - q.iushrn(8); - - res[i] = b; - } - - for (; i < reqLength; i++) { - res[i] = 0; - } - } - - return res; - }; - - if (Math.clz32) { - BN.prototype._countBits = function _countBits (w) { - return 32 - Math.clz32(w); - }; - } else { - BN.prototype._countBits = function _countBits (w) { - var t = w; - var r = 0; - if (t >= 0x1000) { - r += 13; - t >>>= 13; - } - if (t >= 0x40) { - r += 7; - t >>>= 7; - } - if (t >= 0x8) { - r += 4; - t >>>= 4; - } - if (t >= 0x02) { - r += 2; - t >>>= 2; - } - return r + t; - }; - } - - BN.prototype._zeroBits = function _zeroBits (w) { - // Short-cut - if (w === 0) return 26; - - var t = w; - var r = 0; - if ((t & 0x1fff) === 0) { - r += 13; - t >>>= 13; - } - if ((t & 0x7f) === 0) { - r += 7; - t >>>= 7; - } - if ((t & 0xf) === 0) { - r += 4; - t >>>= 4; - } - if ((t & 0x3) === 0) { - r += 2; - t >>>= 2; - } - if ((t & 0x1) === 0) { - r++; - } - return r; - }; - - // Return number of used bits in a BN - BN.prototype.bitLength = function bitLength () { - var w = this.words[this.length - 1]; - var hi = this._countBits(w); - return (this.length - 1) * 26 + hi; - }; - - function toBitArray (num) { - var w = new Array(num.bitLength()); - - for (var bit = 0; bit < w.length; bit++) { - var off = (bit / 26) | 0; - var wbit = bit % 26; - - w[bit] = (num.words[off] & (1 << wbit)) >>> wbit; - } - - return w; - } - - // Number of trailing zero bits - BN.prototype.zeroBits = function zeroBits () { - if (this.isZero()) return 0; - - var r = 0; - for (var i = 0; i < this.length; i++) { - var b = this._zeroBits(this.words[i]); - r += b; - if (b !== 26) break; - } - return r; - }; - - BN.prototype.byteLength = function byteLength () { - return Math.ceil(this.bitLength() / 8); - }; - - BN.prototype.toTwos = function toTwos (width) { - if (this.negative !== 0) { - return this.abs().inotn(width).iaddn(1); - } - return this.clone(); - }; - - BN.prototype.fromTwos = function fromTwos (width) { - if (this.testn(width - 1)) { - return this.notn(width).iaddn(1).ineg(); - } - return this.clone(); - }; - - BN.prototype.isNeg = function isNeg () { - return this.negative !== 0; - }; - - // Return negative clone of `this` - BN.prototype.neg = function neg () { - return this.clone().ineg(); - }; - - BN.prototype.ineg = function ineg () { - if (!this.isZero()) { - this.negative ^= 1; - } - - return this; - }; - - // Or `num` with `this` in-place - BN.prototype.iuor = function iuor (num) { - while (this.length < num.length) { - this.words[this.length++] = 0; - } - - for (var i = 0; i < num.length; i++) { - this.words[i] = this.words[i] | num.words[i]; - } - - return this.strip(); - }; - - BN.prototype.ior = function ior (num) { - assert((this.negative | num.negative) === 0); - return this.iuor(num); - }; - - // Or `num` with `this` - BN.prototype.or = function or (num) { - if (this.length > num.length) return this.clone().ior(num); - return num.clone().ior(this); - }; - - BN.prototype.uor = function uor (num) { - if (this.length > num.length) return this.clone().iuor(num); - return num.clone().iuor(this); - }; - - // And `num` with `this` in-place - BN.prototype.iuand = function iuand (num) { - // b = min-length(num, this) - var b; - if (this.length > num.length) { - b = num; - } else { - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = this.words[i] & num.words[i]; - } - - this.length = b.length; - - return this.strip(); - }; - - BN.prototype.iand = function iand (num) { - assert((this.negative | num.negative) === 0); - return this.iuand(num); - }; - - // And `num` with `this` - BN.prototype.and = function and (num) { - if (this.length > num.length) return this.clone().iand(num); - return num.clone().iand(this); - }; - - BN.prototype.uand = function uand (num) { - if (this.length > num.length) return this.clone().iuand(num); - return num.clone().iuand(this); - }; - - // Xor `num` with `this` in-place - BN.prototype.iuxor = function iuxor (num) { - // a.length > b.length - var a; - var b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - for (var i = 0; i < b.length; i++) { - this.words[i] = a.words[i] ^ b.words[i]; - } - - if (this !== a) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = a.length; - - return this.strip(); - }; - - BN.prototype.ixor = function ixor (num) { - assert((this.negative | num.negative) === 0); - return this.iuxor(num); - }; - - // Xor `num` with `this` - BN.prototype.xor = function xor (num) { - if (this.length > num.length) return this.clone().ixor(num); - return num.clone().ixor(this); - }; - - BN.prototype.uxor = function uxor (num) { - if (this.length > num.length) return this.clone().iuxor(num); - return num.clone().iuxor(this); - }; - - // Not ``this`` with ``width`` bitwidth - BN.prototype.inotn = function inotn (width) { - assert(typeof width === 'number' && width >= 0); - - var bytesNeeded = Math.ceil(width / 26) | 0; - var bitsLeft = width % 26; - - // Extend the buffer with leading zeroes - this._expand(bytesNeeded); - - if (bitsLeft > 0) { - bytesNeeded--; - } - - // Handle complete words - for (var i = 0; i < bytesNeeded; i++) { - this.words[i] = ~this.words[i] & 0x3ffffff; - } - - // Handle the residue - if (bitsLeft > 0) { - this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft)); - } - - // And remove leading zeroes - return this.strip(); - }; - - BN.prototype.notn = function notn (width) { - return this.clone().inotn(width); - }; - - // Set `bit` of `this` - BN.prototype.setn = function setn (bit, val) { - assert(typeof bit === 'number' && bit >= 0); - - var off = (bit / 26) | 0; - var wbit = bit % 26; - - this._expand(off + 1); - - if (val) { - this.words[off] = this.words[off] | (1 << wbit); - } else { - this.words[off] = this.words[off] & ~(1 << wbit); - } - - return this.strip(); - }; - - // Add `num` to `this` in-place - BN.prototype.iadd = function iadd (num) { - var r; - - // negative + positive - if (this.negative !== 0 && num.negative === 0) { - this.negative = 0; - r = this.isub(num); - this.negative ^= 1; - return this._normSign(); - - // positive + negative - } else if (this.negative === 0 && num.negative !== 0) { - num.negative = 0; - r = this.isub(num); - num.negative = 1; - return r._normSign(); - } - - // a.length > b.length - var a, b; - if (this.length > num.length) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) + (b.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - this.words[i] = r & 0x3ffffff; - carry = r >>> 26; - } - - this.length = a.length; - if (carry !== 0) { - this.words[this.length] = carry; - this.length++; - // Copy the rest of the words - } else if (a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - return this; - }; - - // Add `num` to `this` - BN.prototype.add = function add (num) { - var res; - if (num.negative !== 0 && this.negative === 0) { - num.negative = 0; - res = this.sub(num); - num.negative ^= 1; - return res; - } else if (num.negative === 0 && this.negative !== 0) { - this.negative = 0; - res = num.sub(this); - this.negative = 1; - return res; - } - - if (this.length > num.length) return this.clone().iadd(num); - - return num.clone().iadd(this); - }; - - // Subtract `num` from `this` in-place - BN.prototype.isub = function isub (num) { - // this - (-num) = this + num - if (num.negative !== 0) { - num.negative = 0; - var r = this.iadd(num); - num.negative = 1; - return r._normSign(); - - // -this - num = -(this + num) - } else if (this.negative !== 0) { - this.negative = 0; - this.iadd(num); - this.negative = 1; - return this._normSign(); - } - - // At this point both numbers are positive - var cmp = this.cmp(num); - - // Optimization - zeroify - if (cmp === 0) { - this.negative = 0; - this.length = 1; - this.words[0] = 0; - return this; - } - - // a > b - var a, b; - if (cmp > 0) { - a = this; - b = num; - } else { - a = num; - b = this; - } - - var carry = 0; - for (var i = 0; i < b.length; i++) { - r = (a.words[i] | 0) - (b.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - for (; carry !== 0 && i < a.length; i++) { - r = (a.words[i] | 0) + carry; - carry = r >> 26; - this.words[i] = r & 0x3ffffff; - } - - // Copy rest of the words - if (carry === 0 && i < a.length && a !== this) { - for (; i < a.length; i++) { - this.words[i] = a.words[i]; - } - } - - this.length = Math.max(this.length, i); - - if (a !== this) { - this.negative = 1; - } - - return this.strip(); - }; - - // Subtract `num` from `this` - BN.prototype.sub = function sub (num) { - return this.clone().isub(num); - }; - - function smallMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - var len = (self.length + num.length) | 0; - out.length = len; - len = (len - 1) | 0; - - // Peel one iteration (compiler can't do it, because of code complexity) - var a = self.words[0] | 0; - var b = num.words[0] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - var carry = (r / 0x4000000) | 0; - out.words[0] = lo; - - for (var k = 1; k < len; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = carry >>> 26; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = (k - j) | 0; - a = self.words[i] | 0; - b = num.words[j] | 0; - r = a * b + rword; - ncarry += (r / 0x4000000) | 0; - rword = r & 0x3ffffff; - } - out.words[k] = rword | 0; - carry = ncarry | 0; - } - if (carry !== 0) { - out.words[k] = carry | 0; - } else { - out.length--; - } - - return out.strip(); - } - - // TODO(indutny): it may be reasonable to omit it for users who don't need - // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit - // multiplication (like elliptic secp256k1). - var comb10MulTo = function comb10MulTo (self, num, out) { - var a = self.words; - var b = num.words; - var o = out.words; - var c = 0; - var lo; - var mid; - var hi; - var a0 = a[0] | 0; - var al0 = a0 & 0x1fff; - var ah0 = a0 >>> 13; - var a1 = a[1] | 0; - var al1 = a1 & 0x1fff; - var ah1 = a1 >>> 13; - var a2 = a[2] | 0; - var al2 = a2 & 0x1fff; - var ah2 = a2 >>> 13; - var a3 = a[3] | 0; - var al3 = a3 & 0x1fff; - var ah3 = a3 >>> 13; - var a4 = a[4] | 0; - var al4 = a4 & 0x1fff; - var ah4 = a4 >>> 13; - var a5 = a[5] | 0; - var al5 = a5 & 0x1fff; - var ah5 = a5 >>> 13; - var a6 = a[6] | 0; - var al6 = a6 & 0x1fff; - var ah6 = a6 >>> 13; - var a7 = a[7] | 0; - var al7 = a7 & 0x1fff; - var ah7 = a7 >>> 13; - var a8 = a[8] | 0; - var al8 = a8 & 0x1fff; - var ah8 = a8 >>> 13; - var a9 = a[9] | 0; - var al9 = a9 & 0x1fff; - var ah9 = a9 >>> 13; - var b0 = b[0] | 0; - var bl0 = b0 & 0x1fff; - var bh0 = b0 >>> 13; - var b1 = b[1] | 0; - var bl1 = b1 & 0x1fff; - var bh1 = b1 >>> 13; - var b2 = b[2] | 0; - var bl2 = b2 & 0x1fff; - var bh2 = b2 >>> 13; - var b3 = b[3] | 0; - var bl3 = b3 & 0x1fff; - var bh3 = b3 >>> 13; - var b4 = b[4] | 0; - var bl4 = b4 & 0x1fff; - var bh4 = b4 >>> 13; - var b5 = b[5] | 0; - var bl5 = b5 & 0x1fff; - var bh5 = b5 >>> 13; - var b6 = b[6] | 0; - var bl6 = b6 & 0x1fff; - var bh6 = b6 >>> 13; - var b7 = b[7] | 0; - var bl7 = b7 & 0x1fff; - var bh7 = b7 >>> 13; - var b8 = b[8] | 0; - var bl8 = b8 & 0x1fff; - var bh8 = b8 >>> 13; - var b9 = b[9] | 0; - var bl9 = b9 & 0x1fff; - var bh9 = b9 >>> 13; - - out.negative = self.negative ^ num.negative; - out.length = 19; - /* k = 0 */ - lo = Math.imul(al0, bl0); - mid = Math.imul(al0, bh0); - mid = (mid + Math.imul(ah0, bl0)) | 0; - hi = Math.imul(ah0, bh0); - var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0; - w0 &= 0x3ffffff; - /* k = 1 */ - lo = Math.imul(al1, bl0); - mid = Math.imul(al1, bh0); - mid = (mid + Math.imul(ah1, bl0)) | 0; - hi = Math.imul(ah1, bh0); - lo = (lo + Math.imul(al0, bl1)) | 0; - mid = (mid + Math.imul(al0, bh1)) | 0; - mid = (mid + Math.imul(ah0, bl1)) | 0; - hi = (hi + Math.imul(ah0, bh1)) | 0; - var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0; - w1 &= 0x3ffffff; - /* k = 2 */ - lo = Math.imul(al2, bl0); - mid = Math.imul(al2, bh0); - mid = (mid + Math.imul(ah2, bl0)) | 0; - hi = Math.imul(ah2, bh0); - lo = (lo + Math.imul(al1, bl1)) | 0; - mid = (mid + Math.imul(al1, bh1)) | 0; - mid = (mid + Math.imul(ah1, bl1)) | 0; - hi = (hi + Math.imul(ah1, bh1)) | 0; - lo = (lo + Math.imul(al0, bl2)) | 0; - mid = (mid + Math.imul(al0, bh2)) | 0; - mid = (mid + Math.imul(ah0, bl2)) | 0; - hi = (hi + Math.imul(ah0, bh2)) | 0; - var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0; - w2 &= 0x3ffffff; - /* k = 3 */ - lo = Math.imul(al3, bl0); - mid = Math.imul(al3, bh0); - mid = (mid + Math.imul(ah3, bl0)) | 0; - hi = Math.imul(ah3, bh0); - lo = (lo + Math.imul(al2, bl1)) | 0; - mid = (mid + Math.imul(al2, bh1)) | 0; - mid = (mid + Math.imul(ah2, bl1)) | 0; - hi = (hi + Math.imul(ah2, bh1)) | 0; - lo = (lo + Math.imul(al1, bl2)) | 0; - mid = (mid + Math.imul(al1, bh2)) | 0; - mid = (mid + Math.imul(ah1, bl2)) | 0; - hi = (hi + Math.imul(ah1, bh2)) | 0; - lo = (lo + Math.imul(al0, bl3)) | 0; - mid = (mid + Math.imul(al0, bh3)) | 0; - mid = (mid + Math.imul(ah0, bl3)) | 0; - hi = (hi + Math.imul(ah0, bh3)) | 0; - var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0; - w3 &= 0x3ffffff; - /* k = 4 */ - lo = Math.imul(al4, bl0); - mid = Math.imul(al4, bh0); - mid = (mid + Math.imul(ah4, bl0)) | 0; - hi = Math.imul(ah4, bh0); - lo = (lo + Math.imul(al3, bl1)) | 0; - mid = (mid + Math.imul(al3, bh1)) | 0; - mid = (mid + Math.imul(ah3, bl1)) | 0; - hi = (hi + Math.imul(ah3, bh1)) | 0; - lo = (lo + Math.imul(al2, bl2)) | 0; - mid = (mid + Math.imul(al2, bh2)) | 0; - mid = (mid + Math.imul(ah2, bl2)) | 0; - hi = (hi + Math.imul(ah2, bh2)) | 0; - lo = (lo + Math.imul(al1, bl3)) | 0; - mid = (mid + Math.imul(al1, bh3)) | 0; - mid = (mid + Math.imul(ah1, bl3)) | 0; - hi = (hi + Math.imul(ah1, bh3)) | 0; - lo = (lo + Math.imul(al0, bl4)) | 0; - mid = (mid + Math.imul(al0, bh4)) | 0; - mid = (mid + Math.imul(ah0, bl4)) | 0; - hi = (hi + Math.imul(ah0, bh4)) | 0; - var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0; - w4 &= 0x3ffffff; - /* k = 5 */ - lo = Math.imul(al5, bl0); - mid = Math.imul(al5, bh0); - mid = (mid + Math.imul(ah5, bl0)) | 0; - hi = Math.imul(ah5, bh0); - lo = (lo + Math.imul(al4, bl1)) | 0; - mid = (mid + Math.imul(al4, bh1)) | 0; - mid = (mid + Math.imul(ah4, bl1)) | 0; - hi = (hi + Math.imul(ah4, bh1)) | 0; - lo = (lo + Math.imul(al3, bl2)) | 0; - mid = (mid + Math.imul(al3, bh2)) | 0; - mid = (mid + Math.imul(ah3, bl2)) | 0; - hi = (hi + Math.imul(ah3, bh2)) | 0; - lo = (lo + Math.imul(al2, bl3)) | 0; - mid = (mid + Math.imul(al2, bh3)) | 0; - mid = (mid + Math.imul(ah2, bl3)) | 0; - hi = (hi + Math.imul(ah2, bh3)) | 0; - lo = (lo + Math.imul(al1, bl4)) | 0; - mid = (mid + Math.imul(al1, bh4)) | 0; - mid = (mid + Math.imul(ah1, bl4)) | 0; - hi = (hi + Math.imul(ah1, bh4)) | 0; - lo = (lo + Math.imul(al0, bl5)) | 0; - mid = (mid + Math.imul(al0, bh5)) | 0; - mid = (mid + Math.imul(ah0, bl5)) | 0; - hi = (hi + Math.imul(ah0, bh5)) | 0; - var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0; - w5 &= 0x3ffffff; - /* k = 6 */ - lo = Math.imul(al6, bl0); - mid = Math.imul(al6, bh0); - mid = (mid + Math.imul(ah6, bl0)) | 0; - hi = Math.imul(ah6, bh0); - lo = (lo + Math.imul(al5, bl1)) | 0; - mid = (mid + Math.imul(al5, bh1)) | 0; - mid = (mid + Math.imul(ah5, bl1)) | 0; - hi = (hi + Math.imul(ah5, bh1)) | 0; - lo = (lo + Math.imul(al4, bl2)) | 0; - mid = (mid + Math.imul(al4, bh2)) | 0; - mid = (mid + Math.imul(ah4, bl2)) | 0; - hi = (hi + Math.imul(ah4, bh2)) | 0; - lo = (lo + Math.imul(al3, bl3)) | 0; - mid = (mid + Math.imul(al3, bh3)) | 0; - mid = (mid + Math.imul(ah3, bl3)) | 0; - hi = (hi + Math.imul(ah3, bh3)) | 0; - lo = (lo + Math.imul(al2, bl4)) | 0; - mid = (mid + Math.imul(al2, bh4)) | 0; - mid = (mid + Math.imul(ah2, bl4)) | 0; - hi = (hi + Math.imul(ah2, bh4)) | 0; - lo = (lo + Math.imul(al1, bl5)) | 0; - mid = (mid + Math.imul(al1, bh5)) | 0; - mid = (mid + Math.imul(ah1, bl5)) | 0; - hi = (hi + Math.imul(ah1, bh5)) | 0; - lo = (lo + Math.imul(al0, bl6)) | 0; - mid = (mid + Math.imul(al0, bh6)) | 0; - mid = (mid + Math.imul(ah0, bl6)) | 0; - hi = (hi + Math.imul(ah0, bh6)) | 0; - var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0; - w6 &= 0x3ffffff; - /* k = 7 */ - lo = Math.imul(al7, bl0); - mid = Math.imul(al7, bh0); - mid = (mid + Math.imul(ah7, bl0)) | 0; - hi = Math.imul(ah7, bh0); - lo = (lo + Math.imul(al6, bl1)) | 0; - mid = (mid + Math.imul(al6, bh1)) | 0; - mid = (mid + Math.imul(ah6, bl1)) | 0; - hi = (hi + Math.imul(ah6, bh1)) | 0; - lo = (lo + Math.imul(al5, bl2)) | 0; - mid = (mid + Math.imul(al5, bh2)) | 0; - mid = (mid + Math.imul(ah5, bl2)) | 0; - hi = (hi + Math.imul(ah5, bh2)) | 0; - lo = (lo + Math.imul(al4, bl3)) | 0; - mid = (mid + Math.imul(al4, bh3)) | 0; - mid = (mid + Math.imul(ah4, bl3)) | 0; - hi = (hi + Math.imul(ah4, bh3)) | 0; - lo = (lo + Math.imul(al3, bl4)) | 0; - mid = (mid + Math.imul(al3, bh4)) | 0; - mid = (mid + Math.imul(ah3, bl4)) | 0; - hi = (hi + Math.imul(ah3, bh4)) | 0; - lo = (lo + Math.imul(al2, bl5)) | 0; - mid = (mid + Math.imul(al2, bh5)) | 0; - mid = (mid + Math.imul(ah2, bl5)) | 0; - hi = (hi + Math.imul(ah2, bh5)) | 0; - lo = (lo + Math.imul(al1, bl6)) | 0; - mid = (mid + Math.imul(al1, bh6)) | 0; - mid = (mid + Math.imul(ah1, bl6)) | 0; - hi = (hi + Math.imul(ah1, bh6)) | 0; - lo = (lo + Math.imul(al0, bl7)) | 0; - mid = (mid + Math.imul(al0, bh7)) | 0; - mid = (mid + Math.imul(ah0, bl7)) | 0; - hi = (hi + Math.imul(ah0, bh7)) | 0; - var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0; - w7 &= 0x3ffffff; - /* k = 8 */ - lo = Math.imul(al8, bl0); - mid = Math.imul(al8, bh0); - mid = (mid + Math.imul(ah8, bl0)) | 0; - hi = Math.imul(ah8, bh0); - lo = (lo + Math.imul(al7, bl1)) | 0; - mid = (mid + Math.imul(al7, bh1)) | 0; - mid = (mid + Math.imul(ah7, bl1)) | 0; - hi = (hi + Math.imul(ah7, bh1)) | 0; - lo = (lo + Math.imul(al6, bl2)) | 0; - mid = (mid + Math.imul(al6, bh2)) | 0; - mid = (mid + Math.imul(ah6, bl2)) | 0; - hi = (hi + Math.imul(ah6, bh2)) | 0; - lo = (lo + Math.imul(al5, bl3)) | 0; - mid = (mid + Math.imul(al5, bh3)) | 0; - mid = (mid + Math.imul(ah5, bl3)) | 0; - hi = (hi + Math.imul(ah5, bh3)) | 0; - lo = (lo + Math.imul(al4, bl4)) | 0; - mid = (mid + Math.imul(al4, bh4)) | 0; - mid = (mid + Math.imul(ah4, bl4)) | 0; - hi = (hi + Math.imul(ah4, bh4)) | 0; - lo = (lo + Math.imul(al3, bl5)) | 0; - mid = (mid + Math.imul(al3, bh5)) | 0; - mid = (mid + Math.imul(ah3, bl5)) | 0; - hi = (hi + Math.imul(ah3, bh5)) | 0; - lo = (lo + Math.imul(al2, bl6)) | 0; - mid = (mid + Math.imul(al2, bh6)) | 0; - mid = (mid + Math.imul(ah2, bl6)) | 0; - hi = (hi + Math.imul(ah2, bh6)) | 0; - lo = (lo + Math.imul(al1, bl7)) | 0; - mid = (mid + Math.imul(al1, bh7)) | 0; - mid = (mid + Math.imul(ah1, bl7)) | 0; - hi = (hi + Math.imul(ah1, bh7)) | 0; - lo = (lo + Math.imul(al0, bl8)) | 0; - mid = (mid + Math.imul(al0, bh8)) | 0; - mid = (mid + Math.imul(ah0, bl8)) | 0; - hi = (hi + Math.imul(ah0, bh8)) | 0; - var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0; - w8 &= 0x3ffffff; - /* k = 9 */ - lo = Math.imul(al9, bl0); - mid = Math.imul(al9, bh0); - mid = (mid + Math.imul(ah9, bl0)) | 0; - hi = Math.imul(ah9, bh0); - lo = (lo + Math.imul(al8, bl1)) | 0; - mid = (mid + Math.imul(al8, bh1)) | 0; - mid = (mid + Math.imul(ah8, bl1)) | 0; - hi = (hi + Math.imul(ah8, bh1)) | 0; - lo = (lo + Math.imul(al7, bl2)) | 0; - mid = (mid + Math.imul(al7, bh2)) | 0; - mid = (mid + Math.imul(ah7, bl2)) | 0; - hi = (hi + Math.imul(ah7, bh2)) | 0; - lo = (lo + Math.imul(al6, bl3)) | 0; - mid = (mid + Math.imul(al6, bh3)) | 0; - mid = (mid + Math.imul(ah6, bl3)) | 0; - hi = (hi + Math.imul(ah6, bh3)) | 0; - lo = (lo + Math.imul(al5, bl4)) | 0; - mid = (mid + Math.imul(al5, bh4)) | 0; - mid = (mid + Math.imul(ah5, bl4)) | 0; - hi = (hi + Math.imul(ah5, bh4)) | 0; - lo = (lo + Math.imul(al4, bl5)) | 0; - mid = (mid + Math.imul(al4, bh5)) | 0; - mid = (mid + Math.imul(ah4, bl5)) | 0; - hi = (hi + Math.imul(ah4, bh5)) | 0; - lo = (lo + Math.imul(al3, bl6)) | 0; - mid = (mid + Math.imul(al3, bh6)) | 0; - mid = (mid + Math.imul(ah3, bl6)) | 0; - hi = (hi + Math.imul(ah3, bh6)) | 0; - lo = (lo + Math.imul(al2, bl7)) | 0; - mid = (mid + Math.imul(al2, bh7)) | 0; - mid = (mid + Math.imul(ah2, bl7)) | 0; - hi = (hi + Math.imul(ah2, bh7)) | 0; - lo = (lo + Math.imul(al1, bl8)) | 0; - mid = (mid + Math.imul(al1, bh8)) | 0; - mid = (mid + Math.imul(ah1, bl8)) | 0; - hi = (hi + Math.imul(ah1, bh8)) | 0; - lo = (lo + Math.imul(al0, bl9)) | 0; - mid = (mid + Math.imul(al0, bh9)) | 0; - mid = (mid + Math.imul(ah0, bl9)) | 0; - hi = (hi + Math.imul(ah0, bh9)) | 0; - var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0; - w9 &= 0x3ffffff; - /* k = 10 */ - lo = Math.imul(al9, bl1); - mid = Math.imul(al9, bh1); - mid = (mid + Math.imul(ah9, bl1)) | 0; - hi = Math.imul(ah9, bh1); - lo = (lo + Math.imul(al8, bl2)) | 0; - mid = (mid + Math.imul(al8, bh2)) | 0; - mid = (mid + Math.imul(ah8, bl2)) | 0; - hi = (hi + Math.imul(ah8, bh2)) | 0; - lo = (lo + Math.imul(al7, bl3)) | 0; - mid = (mid + Math.imul(al7, bh3)) | 0; - mid = (mid + Math.imul(ah7, bl3)) | 0; - hi = (hi + Math.imul(ah7, bh3)) | 0; - lo = (lo + Math.imul(al6, bl4)) | 0; - mid = (mid + Math.imul(al6, bh4)) | 0; - mid = (mid + Math.imul(ah6, bl4)) | 0; - hi = (hi + Math.imul(ah6, bh4)) | 0; - lo = (lo + Math.imul(al5, bl5)) | 0; - mid = (mid + Math.imul(al5, bh5)) | 0; - mid = (mid + Math.imul(ah5, bl5)) | 0; - hi = (hi + Math.imul(ah5, bh5)) | 0; - lo = (lo + Math.imul(al4, bl6)) | 0; - mid = (mid + Math.imul(al4, bh6)) | 0; - mid = (mid + Math.imul(ah4, bl6)) | 0; - hi = (hi + Math.imul(ah4, bh6)) | 0; - lo = (lo + Math.imul(al3, bl7)) | 0; - mid = (mid + Math.imul(al3, bh7)) | 0; - mid = (mid + Math.imul(ah3, bl7)) | 0; - hi = (hi + Math.imul(ah3, bh7)) | 0; - lo = (lo + Math.imul(al2, bl8)) | 0; - mid = (mid + Math.imul(al2, bh8)) | 0; - mid = (mid + Math.imul(ah2, bl8)) | 0; - hi = (hi + Math.imul(ah2, bh8)) | 0; - lo = (lo + Math.imul(al1, bl9)) | 0; - mid = (mid + Math.imul(al1, bh9)) | 0; - mid = (mid + Math.imul(ah1, bl9)) | 0; - hi = (hi + Math.imul(ah1, bh9)) | 0; - var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0; - w10 &= 0x3ffffff; - /* k = 11 */ - lo = Math.imul(al9, bl2); - mid = Math.imul(al9, bh2); - mid = (mid + Math.imul(ah9, bl2)) | 0; - hi = Math.imul(ah9, bh2); - lo = (lo + Math.imul(al8, bl3)) | 0; - mid = (mid + Math.imul(al8, bh3)) | 0; - mid = (mid + Math.imul(ah8, bl3)) | 0; - hi = (hi + Math.imul(ah8, bh3)) | 0; - lo = (lo + Math.imul(al7, bl4)) | 0; - mid = (mid + Math.imul(al7, bh4)) | 0; - mid = (mid + Math.imul(ah7, bl4)) | 0; - hi = (hi + Math.imul(ah7, bh4)) | 0; - lo = (lo + Math.imul(al6, bl5)) | 0; - mid = (mid + Math.imul(al6, bh5)) | 0; - mid = (mid + Math.imul(ah6, bl5)) | 0; - hi = (hi + Math.imul(ah6, bh5)) | 0; - lo = (lo + Math.imul(al5, bl6)) | 0; - mid = (mid + Math.imul(al5, bh6)) | 0; - mid = (mid + Math.imul(ah5, bl6)) | 0; - hi = (hi + Math.imul(ah5, bh6)) | 0; - lo = (lo + Math.imul(al4, bl7)) | 0; - mid = (mid + Math.imul(al4, bh7)) | 0; - mid = (mid + Math.imul(ah4, bl7)) | 0; - hi = (hi + Math.imul(ah4, bh7)) | 0; - lo = (lo + Math.imul(al3, bl8)) | 0; - mid = (mid + Math.imul(al3, bh8)) | 0; - mid = (mid + Math.imul(ah3, bl8)) | 0; - hi = (hi + Math.imul(ah3, bh8)) | 0; - lo = (lo + Math.imul(al2, bl9)) | 0; - mid = (mid + Math.imul(al2, bh9)) | 0; - mid = (mid + Math.imul(ah2, bl9)) | 0; - hi = (hi + Math.imul(ah2, bh9)) | 0; - var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0; - w11 &= 0x3ffffff; - /* k = 12 */ - lo = Math.imul(al9, bl3); - mid = Math.imul(al9, bh3); - mid = (mid + Math.imul(ah9, bl3)) | 0; - hi = Math.imul(ah9, bh3); - lo = (lo + Math.imul(al8, bl4)) | 0; - mid = (mid + Math.imul(al8, bh4)) | 0; - mid = (mid + Math.imul(ah8, bl4)) | 0; - hi = (hi + Math.imul(ah8, bh4)) | 0; - lo = (lo + Math.imul(al7, bl5)) | 0; - mid = (mid + Math.imul(al7, bh5)) | 0; - mid = (mid + Math.imul(ah7, bl5)) | 0; - hi = (hi + Math.imul(ah7, bh5)) | 0; - lo = (lo + Math.imul(al6, bl6)) | 0; - mid = (mid + Math.imul(al6, bh6)) | 0; - mid = (mid + Math.imul(ah6, bl6)) | 0; - hi = (hi + Math.imul(ah6, bh6)) | 0; - lo = (lo + Math.imul(al5, bl7)) | 0; - mid = (mid + Math.imul(al5, bh7)) | 0; - mid = (mid + Math.imul(ah5, bl7)) | 0; - hi = (hi + Math.imul(ah5, bh7)) | 0; - lo = (lo + Math.imul(al4, bl8)) | 0; - mid = (mid + Math.imul(al4, bh8)) | 0; - mid = (mid + Math.imul(ah4, bl8)) | 0; - hi = (hi + Math.imul(ah4, bh8)) | 0; - lo = (lo + Math.imul(al3, bl9)) | 0; - mid = (mid + Math.imul(al3, bh9)) | 0; - mid = (mid + Math.imul(ah3, bl9)) | 0; - hi = (hi + Math.imul(ah3, bh9)) | 0; - var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0; - w12 &= 0x3ffffff; - /* k = 13 */ - lo = Math.imul(al9, bl4); - mid = Math.imul(al9, bh4); - mid = (mid + Math.imul(ah9, bl4)) | 0; - hi = Math.imul(ah9, bh4); - lo = (lo + Math.imul(al8, bl5)) | 0; - mid = (mid + Math.imul(al8, bh5)) | 0; - mid = (mid + Math.imul(ah8, bl5)) | 0; - hi = (hi + Math.imul(ah8, bh5)) | 0; - lo = (lo + Math.imul(al7, bl6)) | 0; - mid = (mid + Math.imul(al7, bh6)) | 0; - mid = (mid + Math.imul(ah7, bl6)) | 0; - hi = (hi + Math.imul(ah7, bh6)) | 0; - lo = (lo + Math.imul(al6, bl7)) | 0; - mid = (mid + Math.imul(al6, bh7)) | 0; - mid = (mid + Math.imul(ah6, bl7)) | 0; - hi = (hi + Math.imul(ah6, bh7)) | 0; - lo = (lo + Math.imul(al5, bl8)) | 0; - mid = (mid + Math.imul(al5, bh8)) | 0; - mid = (mid + Math.imul(ah5, bl8)) | 0; - hi = (hi + Math.imul(ah5, bh8)) | 0; - lo = (lo + Math.imul(al4, bl9)) | 0; - mid = (mid + Math.imul(al4, bh9)) | 0; - mid = (mid + Math.imul(ah4, bl9)) | 0; - hi = (hi + Math.imul(ah4, bh9)) | 0; - var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0; - w13 &= 0x3ffffff; - /* k = 14 */ - lo = Math.imul(al9, bl5); - mid = Math.imul(al9, bh5); - mid = (mid + Math.imul(ah9, bl5)) | 0; - hi = Math.imul(ah9, bh5); - lo = (lo + Math.imul(al8, bl6)) | 0; - mid = (mid + Math.imul(al8, bh6)) | 0; - mid = (mid + Math.imul(ah8, bl6)) | 0; - hi = (hi + Math.imul(ah8, bh6)) | 0; - lo = (lo + Math.imul(al7, bl7)) | 0; - mid = (mid + Math.imul(al7, bh7)) | 0; - mid = (mid + Math.imul(ah7, bl7)) | 0; - hi = (hi + Math.imul(ah7, bh7)) | 0; - lo = (lo + Math.imul(al6, bl8)) | 0; - mid = (mid + Math.imul(al6, bh8)) | 0; - mid = (mid + Math.imul(ah6, bl8)) | 0; - hi = (hi + Math.imul(ah6, bh8)) | 0; - lo = (lo + Math.imul(al5, bl9)) | 0; - mid = (mid + Math.imul(al5, bh9)) | 0; - mid = (mid + Math.imul(ah5, bl9)) | 0; - hi = (hi + Math.imul(ah5, bh9)) | 0; - var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0; - w14 &= 0x3ffffff; - /* k = 15 */ - lo = Math.imul(al9, bl6); - mid = Math.imul(al9, bh6); - mid = (mid + Math.imul(ah9, bl6)) | 0; - hi = Math.imul(ah9, bh6); - lo = (lo + Math.imul(al8, bl7)) | 0; - mid = (mid + Math.imul(al8, bh7)) | 0; - mid = (mid + Math.imul(ah8, bl7)) | 0; - hi = (hi + Math.imul(ah8, bh7)) | 0; - lo = (lo + Math.imul(al7, bl8)) | 0; - mid = (mid + Math.imul(al7, bh8)) | 0; - mid = (mid + Math.imul(ah7, bl8)) | 0; - hi = (hi + Math.imul(ah7, bh8)) | 0; - lo = (lo + Math.imul(al6, bl9)) | 0; - mid = (mid + Math.imul(al6, bh9)) | 0; - mid = (mid + Math.imul(ah6, bl9)) | 0; - hi = (hi + Math.imul(ah6, bh9)) | 0; - var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0; - w15 &= 0x3ffffff; - /* k = 16 */ - lo = Math.imul(al9, bl7); - mid = Math.imul(al9, bh7); - mid = (mid + Math.imul(ah9, bl7)) | 0; - hi = Math.imul(ah9, bh7); - lo = (lo + Math.imul(al8, bl8)) | 0; - mid = (mid + Math.imul(al8, bh8)) | 0; - mid = (mid + Math.imul(ah8, bl8)) | 0; - hi = (hi + Math.imul(ah8, bh8)) | 0; - lo = (lo + Math.imul(al7, bl9)) | 0; - mid = (mid + Math.imul(al7, bh9)) | 0; - mid = (mid + Math.imul(ah7, bl9)) | 0; - hi = (hi + Math.imul(ah7, bh9)) | 0; - var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0; - w16 &= 0x3ffffff; - /* k = 17 */ - lo = Math.imul(al9, bl8); - mid = Math.imul(al9, bh8); - mid = (mid + Math.imul(ah9, bl8)) | 0; - hi = Math.imul(ah9, bh8); - lo = (lo + Math.imul(al8, bl9)) | 0; - mid = (mid + Math.imul(al8, bh9)) | 0; - mid = (mid + Math.imul(ah8, bl9)) | 0; - hi = (hi + Math.imul(ah8, bh9)) | 0; - var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0; - w17 &= 0x3ffffff; - /* k = 18 */ - lo = Math.imul(al9, bl9); - mid = Math.imul(al9, bh9); - mid = (mid + Math.imul(ah9, bl9)) | 0; - hi = Math.imul(ah9, bh9); - var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0; - c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0; - w18 &= 0x3ffffff; - o[0] = w0; - o[1] = w1; - o[2] = w2; - o[3] = w3; - o[4] = w4; - o[5] = w5; - o[6] = w6; - o[7] = w7; - o[8] = w8; - o[9] = w9; - o[10] = w10; - o[11] = w11; - o[12] = w12; - o[13] = w13; - o[14] = w14; - o[15] = w15; - o[16] = w16; - o[17] = w17; - o[18] = w18; - if (c !== 0) { - o[19] = c; - out.length++; - } - return out; - }; - - // Polyfill comb - if (!Math.imul) { - comb10MulTo = smallMulTo; - } - - function bigMulTo (self, num, out) { - out.negative = num.negative ^ self.negative; - out.length = self.length + num.length; - - var carry = 0; - var hncarry = 0; - for (var k = 0; k < out.length - 1; k++) { - // Sum all words with the same `i + j = k` and accumulate `ncarry`, - // note that ncarry could be >= 0x3ffffff - var ncarry = hncarry; - hncarry = 0; - var rword = carry & 0x3ffffff; - var maxJ = Math.min(k, num.length - 1); - for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) { - var i = k - j; - var a = self.words[i] | 0; - var b = num.words[j] | 0; - var r = a * b; - - var lo = r & 0x3ffffff; - ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0; - lo = (lo + rword) | 0; - rword = lo & 0x3ffffff; - ncarry = (ncarry + (lo >>> 26)) | 0; - - hncarry += ncarry >>> 26; - ncarry &= 0x3ffffff; - } - out.words[k] = rword; - carry = ncarry; - ncarry = hncarry; - } - if (carry !== 0) { - out.words[k] = carry; - } else { - out.length--; - } - - return out.strip(); - } - - function jumboMulTo (self, num, out) { - var fftm = new FFTM(); - return fftm.mulp(self, num, out); - } - - BN.prototype.mulTo = function mulTo (num, out) { - var res; - var len = this.length + num.length; - if (this.length === 10 && num.length === 10) { - res = comb10MulTo(this, num, out); - } else if (len < 63) { - res = smallMulTo(this, num, out); - } else if (len < 1024) { - res = bigMulTo(this, num, out); - } else { - res = jumboMulTo(this, num, out); - } - - return res; - }; - - // Cooley-Tukey algorithm for FFT - // slightly revisited to rely on looping instead of recursion - - function FFTM (x, y) { - this.x = x; - this.y = y; - } - - FFTM.prototype.makeRBT = function makeRBT (N) { - var t = new Array(N); - var l = BN.prototype._countBits(N) - 1; - for (var i = 0; i < N; i++) { - t[i] = this.revBin(i, l, N); - } - - return t; - }; - - // Returns binary-reversed representation of `x` - FFTM.prototype.revBin = function revBin (x, l, N) { - if (x === 0 || x === N - 1) return x; - - var rb = 0; - for (var i = 0; i < l; i++) { - rb |= (x & 1) << (l - i - 1); - x >>= 1; - } - - return rb; - }; - - // Performs "tweedling" phase, therefore 'emulating' - // behaviour of the recursive algorithm - FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) { - for (var i = 0; i < N; i++) { - rtws[i] = rws[rbt[i]]; - itws[i] = iws[rbt[i]]; - } - }; - - FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) { - this.permute(rbt, rws, iws, rtws, itws, N); - - for (var s = 1; s < N; s <<= 1) { - var l = s << 1; - - var rtwdf = Math.cos(2 * Math.PI / l); - var itwdf = Math.sin(2 * Math.PI / l); - - for (var p = 0; p < N; p += l) { - var rtwdf_ = rtwdf; - var itwdf_ = itwdf; - - for (var j = 0; j < s; j++) { - var re = rtws[p + j]; - var ie = itws[p + j]; - - var ro = rtws[p + j + s]; - var io = itws[p + j + s]; - - var rx = rtwdf_ * ro - itwdf_ * io; - - io = rtwdf_ * io + itwdf_ * ro; - ro = rx; - - rtws[p + j] = re + ro; - itws[p + j] = ie + io; - - rtws[p + j + s] = re - ro; - itws[p + j + s] = ie - io; - - /* jshint maxdepth : false */ - if (j !== l) { - rx = rtwdf * rtwdf_ - itwdf * itwdf_; - - itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_; - rtwdf_ = rx; - } - } - } - } - }; - - FFTM.prototype.guessLen13b = function guessLen13b (n, m) { - var N = Math.max(m, n) | 1; - var odd = N & 1; - var i = 0; - for (N = N / 2 | 0; N; N = N >>> 1) { - i++; - } - - return 1 << i + 1 + odd; - }; - - FFTM.prototype.conjugate = function conjugate (rws, iws, N) { - if (N <= 1) return; - - for (var i = 0; i < N / 2; i++) { - var t = rws[i]; - - rws[i] = rws[N - i - 1]; - rws[N - i - 1] = t; - - t = iws[i]; - - iws[i] = -iws[N - i - 1]; - iws[N - i - 1] = -t; - } - }; - - FFTM.prototype.normalize13b = function normalize13b (ws, N) { - var carry = 0; - for (var i = 0; i < N / 2; i++) { - var w = Math.round(ws[2 * i + 1] / N) * 0x2000 + - Math.round(ws[2 * i] / N) + - carry; - - ws[i] = w & 0x3ffffff; - - if (w < 0x4000000) { - carry = 0; - } else { - carry = w / 0x4000000 | 0; - } - } - - return ws; - }; - - FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) { - var carry = 0; - for (var i = 0; i < len; i++) { - carry = carry + (ws[i] | 0); - - rws[2 * i] = carry & 0x1fff; carry = carry >>> 13; - rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13; - } - - // Pad with zeroes - for (i = 2 * len; i < N; ++i) { - rws[i] = 0; - } - - assert(carry === 0); - assert((carry & ~0x1fff) === 0); - }; - - FFTM.prototype.stub = function stub (N) { - var ph = new Array(N); - for (var i = 0; i < N; i++) { - ph[i] = 0; - } - - return ph; - }; - - FFTM.prototype.mulp = function mulp (x, y, out) { - var N = 2 * this.guessLen13b(x.length, y.length); - - var rbt = this.makeRBT(N); - - var _ = this.stub(N); - - var rws = new Array(N); - var rwst = new Array(N); - var iwst = new Array(N); - - var nrws = new Array(N); - var nrwst = new Array(N); - var niwst = new Array(N); - - var rmws = out.words; - rmws.length = N; - - this.convert13b(x.words, x.length, rws, N); - this.convert13b(y.words, y.length, nrws, N); - - this.transform(rws, _, rwst, iwst, N, rbt); - this.transform(nrws, _, nrwst, niwst, N, rbt); - - for (var i = 0; i < N; i++) { - var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i]; - iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i]; - rwst[i] = rx; - } - - this.conjugate(rwst, iwst, N); - this.transform(rwst, iwst, rmws, _, N, rbt); - this.conjugate(rmws, _, N); - this.normalize13b(rmws, N); - - out.negative = x.negative ^ y.negative; - out.length = x.length + y.length; - return out.strip(); - }; - - // Multiply `this` by `num` - BN.prototype.mul = function mul (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return this.mulTo(num, out); - }; - - // Multiply employing FFT - BN.prototype.mulf = function mulf (num) { - var out = new BN(null); - out.words = new Array(this.length + num.length); - return jumboMulTo(this, num, out); - }; - - // In-place Multiplication - BN.prototype.imul = function imul (num) { - return this.clone().mulTo(num, this); - }; - - BN.prototype.imuln = function imuln (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - - // Carry - var carry = 0; - for (var i = 0; i < this.length; i++) { - var w = (this.words[i] | 0) * num; - var lo = (w & 0x3ffffff) + (carry & 0x3ffffff); - carry >>= 26; - carry += (w / 0x4000000) | 0; - // NOTE: lo is 27bit maximum - carry += lo >>> 26; - this.words[i] = lo & 0x3ffffff; - } - - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - - return this; - }; - - BN.prototype.muln = function muln (num) { - return this.clone().imuln(num); - }; - - // `this` * `this` - BN.prototype.sqr = function sqr () { - return this.mul(this); - }; - - // `this` * `this` in-place - BN.prototype.isqr = function isqr () { - return this.imul(this.clone()); - }; - - // Math.pow(`this`, `num`) - BN.prototype.pow = function pow (num) { - var w = toBitArray(num); - if (w.length === 0) return new BN(1); - - // Skip leading zeroes - var res = this; - for (var i = 0; i < w.length; i++, res = res.sqr()) { - if (w[i] !== 0) break; - } - - if (++i < w.length) { - for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) { - if (w[i] === 0) continue; - - res = res.mul(q); - } - } - - return res; - }; - - // Shift-left in-place - BN.prototype.iushln = function iushln (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r); - var i; - - if (r !== 0) { - var carry = 0; - - for (i = 0; i < this.length; i++) { - var newCarry = this.words[i] & carryMask; - var c = ((this.words[i] | 0) - newCarry) << r; - this.words[i] = c | carry; - carry = newCarry >>> (26 - r); - } - - if (carry) { - this.words[i] = carry; - this.length++; - } - } - - if (s !== 0) { - for (i = this.length - 1; i >= 0; i--) { - this.words[i + s] = this.words[i]; - } - - for (i = 0; i < s; i++) { - this.words[i] = 0; - } - - this.length += s; - } - - return this.strip(); - }; - - BN.prototype.ishln = function ishln (bits) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushln(bits); - }; - - // Shift-right in-place - // NOTE: `hint` is a lowest bit before trailing zeroes - // NOTE: if `extended` is present - it will be filled with destroyed bits - BN.prototype.iushrn = function iushrn (bits, hint, extended) { - assert(typeof bits === 'number' && bits >= 0); - var h; - if (hint) { - h = (hint - (hint % 26)) / 26; - } else { - h = 0; - } - - var r = bits % 26; - var s = Math.min((bits - r) / 26, this.length); - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - var maskedWords = extended; - - h -= s; - h = Math.max(0, h); - - // Extended mode, copy masked part - if (maskedWords) { - for (var i = 0; i < s; i++) { - maskedWords.words[i] = this.words[i]; - } - maskedWords.length = s; - } - - if (s === 0) { - // No-op, we should not move anything at all - } else if (this.length > s) { - this.length -= s; - for (i = 0; i < this.length; i++) { - this.words[i] = this.words[i + s]; - } - } else { - this.words[0] = 0; - this.length = 1; - } - - var carry = 0; - for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) { - var word = this.words[i] | 0; - this.words[i] = (carry << (26 - r)) | (word >>> r); - carry = word & mask; - } - - // Push carried bits as a mask - if (maskedWords && carry !== 0) { - maskedWords.words[maskedWords.length++] = carry; - } - - if (this.length === 0) { - this.words[0] = 0; - this.length = 1; - } - - return this.strip(); - }; - - BN.prototype.ishrn = function ishrn (bits, hint, extended) { - // TODO(indutny): implement me - assert(this.negative === 0); - return this.iushrn(bits, hint, extended); - }; - - // Shift-left - BN.prototype.shln = function shln (bits) { - return this.clone().ishln(bits); - }; - - BN.prototype.ushln = function ushln (bits) { - return this.clone().iushln(bits); - }; - - // Shift-right - BN.prototype.shrn = function shrn (bits) { - return this.clone().ishrn(bits); - }; - - BN.prototype.ushrn = function ushrn (bits) { - return this.clone().iushrn(bits); - }; - - // Test if n bit is set - BN.prototype.testn = function testn (bit) { - assert(typeof bit === 'number' && bit >= 0); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) return false; - - // Check bit and return - var w = this.words[s]; - - return !!(w & q); - }; - - // Return only lowers bits of number (in-place) - BN.prototype.imaskn = function imaskn (bits) { - assert(typeof bits === 'number' && bits >= 0); - var r = bits % 26; - var s = (bits - r) / 26; - - assert(this.negative === 0, 'imaskn works only with positive numbers'); - - if (this.length <= s) { - return this; - } - - if (r !== 0) { - s++; - } - this.length = Math.min(s, this.length); - - if (r !== 0) { - var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r); - this.words[this.length - 1] &= mask; - } - - return this.strip(); - }; - - // Return only lowers bits of number - BN.prototype.maskn = function maskn (bits) { - return this.clone().imaskn(bits); - }; - - // Add plain number `num` to `this` - BN.prototype.iaddn = function iaddn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.isubn(-num); - - // Possible sign change - if (this.negative !== 0) { - if (this.length === 1 && (this.words[0] | 0) < num) { - this.words[0] = num - (this.words[0] | 0); - this.negative = 0; - return this; - } - - this.negative = 0; - this.isubn(num); - this.negative = 1; - return this; - } - - // Add without checks - return this._iaddn(num); - }; - - BN.prototype._iaddn = function _iaddn (num) { - this.words[0] += num; - - // Carry - for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) { - this.words[i] -= 0x4000000; - if (i === this.length - 1) { - this.words[i + 1] = 1; - } else { - this.words[i + 1]++; - } - } - this.length = Math.max(this.length, i + 1); - - return this; - }; - - // Subtract plain number `num` from `this` - BN.prototype.isubn = function isubn (num) { - assert(typeof num === 'number'); - assert(num < 0x4000000); - if (num < 0) return this.iaddn(-num); - - if (this.negative !== 0) { - this.negative = 0; - this.iaddn(num); - this.negative = 1; - return this; - } - - this.words[0] -= num; - - if (this.length === 1 && this.words[0] < 0) { - this.words[0] = -this.words[0]; - this.negative = 1; - } else { - // Carry - for (var i = 0; i < this.length && this.words[i] < 0; i++) { - this.words[i] += 0x4000000; - this.words[i + 1] -= 1; - } - } - - return this.strip(); - }; - - BN.prototype.addn = function addn (num) { - return this.clone().iaddn(num); - }; - - BN.prototype.subn = function subn (num) { - return this.clone().isubn(num); - }; - - BN.prototype.iabs = function iabs () { - this.negative = 0; - - return this; - }; - - BN.prototype.abs = function abs () { - return this.clone().iabs(); - }; - - BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) { - var len = num.length + shift; - var i; - - this._expand(len); - - var w; - var carry = 0; - for (i = 0; i < num.length; i++) { - w = (this.words[i + shift] | 0) + carry; - var right = (num.words[i] | 0) * mul; - w -= right & 0x3ffffff; - carry = (w >> 26) - ((right / 0x4000000) | 0); - this.words[i + shift] = w & 0x3ffffff; - } - for (; i < this.length - shift; i++) { - w = (this.words[i + shift] | 0) + carry; - carry = w >> 26; - this.words[i + shift] = w & 0x3ffffff; - } - - if (carry === 0) return this.strip(); - - // Subtraction overflow - assert(carry === -1); - carry = 0; - for (i = 0; i < this.length; i++) { - w = -(this.words[i] | 0) + carry; - carry = w >> 26; - this.words[i] = w & 0x3ffffff; - } - this.negative = 1; - - return this.strip(); - }; - - BN.prototype._wordDiv = function _wordDiv (num, mode) { - var shift = this.length - num.length; - - var a = this.clone(); - var b = num; - - // Normalize - var bhi = b.words[b.length - 1] | 0; - var bhiBits = this._countBits(bhi); - shift = 26 - bhiBits; - if (shift !== 0) { - b = b.ushln(shift); - a.iushln(shift); - bhi = b.words[b.length - 1] | 0; - } - - // Initialize quotient - var m = a.length - b.length; - var q; - - if (mode !== 'mod') { - q = new BN(null); - q.length = m + 1; - q.words = new Array(q.length); - for (var i = 0; i < q.length; i++) { - q.words[i] = 0; - } - } - - var diff = a.clone()._ishlnsubmul(b, 1, m); - if (diff.negative === 0) { - a = diff; - if (q) { - q.words[m] = 1; - } - } - - for (var j = m - 1; j >= 0; j--) { - 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 - // (0x7ffffff) - qj = Math.min((qj / bhi) | 0, 0x3ffffff); - - a._ishlnsubmul(b, qj, j); - while (a.negative !== 0) { - qj--; - a.negative = 0; - a._ishlnsubmul(b, 1, j); - if (!a.isZero()) { - a.negative ^= 1; - } - } - if (q) { - q.words[j] = qj; - } - } - if (q) { - q.strip(); - } - a.strip(); - - // Denormalize - if (mode !== 'div' && shift !== 0) { - a.iushrn(shift); - } - - return { - div: q || null, - mod: a - }; - }; - - // NOTE: 1) `mode` can be set to `mod` to request mod only, - // to `div` to request div only, or be absent to - // request both div & mod - // 2) `positive` is true if unsigned mod is requested - BN.prototype.divmod = function divmod (num, mode, positive) { - assert(!num.isZero()); - - if (this.isZero()) { - return { - div: new BN(0), - mod: new BN(0) - }; - } - - var div, mod, res; - if (this.negative !== 0 && num.negative === 0) { - res = this.neg().divmod(num, mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.iadd(num); - } - } - - return { - div: div, - mod: mod - }; - } - - if (this.negative === 0 && num.negative !== 0) { - res = this.divmod(num.neg(), mode); - - if (mode !== 'mod') { - div = res.div.neg(); - } - - return { - div: div, - mod: res.mod - }; - } - - if ((this.negative & num.negative) !== 0) { - res = this.neg().divmod(num.neg(), mode); - - if (mode !== 'div') { - mod = res.mod.neg(); - if (positive && mod.negative !== 0) { - mod.isub(num); - } - } - - return { - div: res.div, - mod: mod - }; - } - - // Both numbers are positive at this point - - // Strip both numbers to approximate shift value - if (num.length > this.length || this.cmp(num) < 0) { - return { - div: new BN(0), - mod: this - }; - } - - // Very short reduction - if (num.length === 1) { - if (mode === 'div') { - return { - div: this.divn(num.words[0]), - mod: null - }; - } - - if (mode === 'mod') { - return { - div: null, - mod: new BN(this.modn(num.words[0])) - }; - } - - return { - div: this.divn(num.words[0]), - mod: new BN(this.modn(num.words[0])) - }; - } - - return this._wordDiv(num, mode); - }; - - // Find `this` / `num` - BN.prototype.div = function div (num) { - return this.divmod(num, 'div', false).div; - }; - - // Find `this` % `num` - BN.prototype.mod = function mod (num) { - return this.divmod(num, 'mod', false).mod; - }; - - BN.prototype.umod = function umod (num) { - return this.divmod(num, 'mod', true).mod; - }; - - // Find Round(`this` / `num`) - BN.prototype.divRound = function divRound (num) { - var dm = this.divmod(num); - - // Fast case - exact division - if (dm.mod.isZero()) return dm.div; - - var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod; - - var half = num.ushrn(1); - var r2 = num.andln(1); - var cmp = mod.cmp(half); - - // Round down - if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div; - - // Round up - return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1); - }; - - BN.prototype.modn = function modn (num) { - assert(num <= 0x3ffffff); - var p = (1 << 26) % num; - - var acc = 0; - for (var i = this.length - 1; i >= 0; i--) { - acc = (p * acc + (this.words[i] | 0)) % num; - } - - return acc; - }; - - // In-place division by number - BN.prototype.idivn = function idivn (num) { - assert(num <= 0x3ffffff); - - var carry = 0; - for (var i = this.length - 1; i >= 0; i--) { - var w = (this.words[i] | 0) + carry * 0x4000000; - this.words[i] = (w / num) | 0; - carry = w % num; - } - - return this.strip(); - }; - - BN.prototype.divn = function divn (num) { - return this.clone().idivn(num); - }; - - BN.prototype.egcd = function egcd (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var x = this; - var y = p.clone(); - - if (x.negative !== 0) { - x = x.umod(p); - } else { - x = x.clone(); - } - - // A * x + B * y = x - var A = new BN(1); - var B = new BN(0); - - // C * x + D * y = y - var C = new BN(0); - var D = new BN(1); - - var g = 0; - - while (x.isEven() && y.isEven()) { - x.iushrn(1); - y.iushrn(1); - ++g; - } - - var yp = y.clone(); - var xp = x.clone(); - - while (!x.isZero()) { - for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - x.iushrn(i); - while (i-- > 0) { - if (A.isOdd() || B.isOdd()) { - A.iadd(yp); - B.isub(xp); - } - - A.iushrn(1); - B.iushrn(1); - } - } - - for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - y.iushrn(j); - while (j-- > 0) { - if (C.isOdd() || D.isOdd()) { - C.iadd(yp); - D.isub(xp); - } - - C.iushrn(1); - D.iushrn(1); - } - } - - if (x.cmp(y) >= 0) { - x.isub(y); - A.isub(C); - B.isub(D); - } else { - y.isub(x); - C.isub(A); - D.isub(B); - } - } - - return { - a: C, - b: D, - gcd: y.iushln(g) - }; - }; - - // This is reduced incarnation of the binary EEA - // above, designated to invert members of the - // _prime_ fields F(p) at a maximal speed - BN.prototype._invmp = function _invmp (p) { - assert(p.negative === 0); - assert(!p.isZero()); - - var a = this; - var b = p.clone(); - - if (a.negative !== 0) { - a = a.umod(p); - } else { - a = a.clone(); - } - - var x1 = new BN(1); - var x2 = new BN(0); - - var delta = b.clone(); - - while (a.cmpn(1) > 0 && b.cmpn(1) > 0) { - for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1); - if (i > 0) { - a.iushrn(i); - while (i-- > 0) { - if (x1.isOdd()) { - x1.iadd(delta); - } - - x1.iushrn(1); - } - } - - for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1); - if (j > 0) { - b.iushrn(j); - while (j-- > 0) { - if (x2.isOdd()) { - x2.iadd(delta); - } - - x2.iushrn(1); - } - } - - if (a.cmp(b) >= 0) { - a.isub(b); - x1.isub(x2); - } else { - b.isub(a); - x2.isub(x1); - } - } - - var res; - if (a.cmpn(1) === 0) { - res = x1; - } else { - res = x2; - } - - if (res.cmpn(0) < 0) { - res.iadd(p); - } - - return res; - }; - - BN.prototype.gcd = function gcd (num) { - if (this.isZero()) return num.abs(); - if (num.isZero()) return this.abs(); - - var a = this.clone(); - var b = num.clone(); - a.negative = 0; - b.negative = 0; - - // Remove common factor of two - for (var shift = 0; a.isEven() && b.isEven(); shift++) { - a.iushrn(1); - b.iushrn(1); - } - - do { - while (a.isEven()) { - a.iushrn(1); - } - while (b.isEven()) { - b.iushrn(1); - } - - var r = a.cmp(b); - if (r < 0) { - // Swap `a` and `b` to make `a` always bigger than `b` - var t = a; - a = b; - b = t; - } else if (r === 0 || b.cmpn(1) === 0) { - break; - } - - a.isub(b); - } while (true); - - return b.iushln(shift); - }; - - // Invert number in the field F(num) - BN.prototype.invm = function invm (num) { - return this.egcd(num).a.umod(num); - }; - - BN.prototype.isEven = function isEven () { - return (this.words[0] & 1) === 0; - }; - - BN.prototype.isOdd = function isOdd () { - return (this.words[0] & 1) === 1; - }; - - // And first word and num - BN.prototype.andln = function andln (num) { - return this.words[0] & num; - }; - - // Increment at the bit position in-line - BN.prototype.bincn = function bincn (bit) { - assert(typeof bit === 'number'); - var r = bit % 26; - var s = (bit - r) / 26; - var q = 1 << r; - - // Fast case: bit is much higher than all existing words - if (this.length <= s) { - this._expand(s + 1); - this.words[s] |= q; - return this; - } - - // Add bit and propagate, if needed - var carry = q; - for (var i = s; carry !== 0 && i < this.length; i++) { - var w = this.words[i] | 0; - w += carry; - carry = w >>> 26; - w &= 0x3ffffff; - this.words[i] = w; - } - if (carry !== 0) { - this.words[i] = carry; - this.length++; - } - return this; - }; - - BN.prototype.isZero = function isZero () { - return this.length === 1 && this.words[0] === 0; - }; - - BN.prototype.cmpn = function cmpn (num) { - var negative = num < 0; - - if (this.negative !== 0 && !negative) return -1; - if (this.negative === 0 && negative) return 1; - - this.strip(); - - var res; - if (this.length > 1) { - res = 1; - } else { - if (negative) { - num = -num; - } - - assert(num <= 0x3ffffff, 'Number is too big'); - - var w = this.words[0] | 0; - res = w === num ? 0 : w < num ? -1 : 1; - } - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Compare two numbers and return: - // 1 - if `this` > `num` - // 0 - if `this` == `num` - // -1 - if `this` < `num` - BN.prototype.cmp = function cmp (num) { - if (this.negative !== 0 && num.negative === 0) return -1; - if (this.negative === 0 && num.negative !== 0) return 1; - - var res = this.ucmp(num); - if (this.negative !== 0) return -res | 0; - return res; - }; - - // Unsigned comparison - BN.prototype.ucmp = function ucmp (num) { - // At this point both numbers have the same sign - if (this.length > num.length) return 1; - if (this.length < num.length) return -1; - - var res = 0; - for (var i = this.length - 1; i >= 0; i--) { - var a = this.words[i] | 0; - var b = num.words[i] | 0; - - if (a === b) continue; - if (a < b) { - res = -1; - } else if (a > b) { - res = 1; - } - break; - } - return res; - }; - - BN.prototype.gtn = function gtn (num) { - return this.cmpn(num) === 1; - }; - - BN.prototype.gt = function gt (num) { - return this.cmp(num) === 1; - }; - - BN.prototype.gten = function gten (num) { - return this.cmpn(num) >= 0; - }; - - BN.prototype.gte = function gte (num) { - return this.cmp(num) >= 0; - }; - - BN.prototype.ltn = function ltn (num) { - return this.cmpn(num) === -1; - }; - - BN.prototype.lt = function lt (num) { - return this.cmp(num) === -1; - }; - - BN.prototype.lten = function lten (num) { - return this.cmpn(num) <= 0; - }; - - BN.prototype.lte = function lte (num) { - return this.cmp(num) <= 0; - }; - - BN.prototype.eqn = function eqn (num) { - return this.cmpn(num) === 0; - }; - - BN.prototype.eq = function eq (num) { - return this.cmp(num) === 0; - }; - - // - // A reduce context, could be using montgomery or something better, depending - // on the `m` itself. - // - BN.red = function red (num) { - return new Red(num); - }; - - BN.prototype.toRed = function toRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - assert(this.negative === 0, 'red works only with positives'); - return ctx.convertTo(this)._forceRed(ctx); - }; - - BN.prototype.fromRed = function fromRed () { - assert(this.red, 'fromRed works only with numbers in reduction context'); - return this.red.convertFrom(this); - }; - - BN.prototype._forceRed = function _forceRed (ctx) { - this.red = ctx; - return this; - }; - - BN.prototype.forceRed = function forceRed (ctx) { - assert(!this.red, 'Already a number in reduction context'); - return this._forceRed(ctx); - }; - - BN.prototype.redAdd = function redAdd (num) { - assert(this.red, 'redAdd works only with red numbers'); - return this.red.add(this, num); - }; - - BN.prototype.redIAdd = function redIAdd (num) { - assert(this.red, 'redIAdd works only with red numbers'); - return this.red.iadd(this, num); - }; - - BN.prototype.redSub = function redSub (num) { - assert(this.red, 'redSub works only with red numbers'); - return this.red.sub(this, num); - }; - - BN.prototype.redISub = function redISub (num) { - assert(this.red, 'redISub works only with red numbers'); - return this.red.isub(this, num); - }; - - BN.prototype.redShl = function redShl (num) { - assert(this.red, 'redShl works only with red numbers'); - return this.red.shl(this, num); - }; - - BN.prototype.redMul = function redMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.mul(this, num); - }; - - BN.prototype.redIMul = function redIMul (num) { - assert(this.red, 'redMul works only with red numbers'); - this.red._verify2(this, num); - return this.red.imul(this, num); - }; - - BN.prototype.redSqr = function redSqr () { - assert(this.red, 'redSqr works only with red numbers'); - this.red._verify1(this); - return this.red.sqr(this); - }; - - BN.prototype.redISqr = function redISqr () { - assert(this.red, 'redISqr works only with red numbers'); - this.red._verify1(this); - return this.red.isqr(this); - }; - - // Square root over p - BN.prototype.redSqrt = function redSqrt () { - assert(this.red, 'redSqrt works only with red numbers'); - this.red._verify1(this); - return this.red.sqrt(this); - }; - - BN.prototype.redInvm = function redInvm () { - assert(this.red, 'redInvm works only with red numbers'); - this.red._verify1(this); - return this.red.invm(this); - }; - - // Return negative clone of `this` % `red modulo` - BN.prototype.redNeg = function redNeg () { - assert(this.red, 'redNeg works only with red numbers'); - this.red._verify1(this); - return this.red.neg(this); - }; - - BN.prototype.redPow = function redPow (num) { - assert(this.red && !num.red, 'redPow(normalNum)'); - this.red._verify1(this); - return this.red.pow(this, num); - }; - - // Prime numbers with efficient reduction - var primes = { - k256: null, - p224: null, - p192: null, - p25519: null - }; - - // Pseudo-Mersenne prime - function MPrime (name, p) { - // P = 2 ^ N - K - this.name = name; - this.p = new BN(p, 16); - this.n = this.p.bitLength(); - this.k = new BN(1).iushln(this.n).isub(this.p); - - this.tmp = this._tmp(); - } - - MPrime.prototype._tmp = function _tmp () { - var tmp = new BN(null); - tmp.words = new Array(Math.ceil(this.n / 13)); - return tmp; - }; - - MPrime.prototype.ireduce = function ireduce (num) { - // Assumes that `num` is less than `P^2` - // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P) - var r = num; - var rlen; - - do { - this.split(r, this.tmp); - r = this.imulK(r); - r = r.iadd(this.tmp); - rlen = r.bitLength(); - } while (rlen > this.n); - - var cmp = rlen < this.n ? -1 : r.ucmp(this.p); - if (cmp === 0) { - r.words[0] = 0; - r.length = 1; - } else if (cmp > 0) { - r.isub(this.p); - } else { - if (r.strip !== undefined) { - // r is BN v4 instance - r.strip(); - } else { - // r is BN v5 instance - r._strip(); - } - } - - return r; - }; - - MPrime.prototype.split = function split (input, out) { - input.iushrn(this.n, 0, out); - }; - - MPrime.prototype.imulK = function imulK (num) { - return num.imul(this.k); - }; - - function K256 () { - MPrime.call( - this, - 'k256', - 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f'); - } - inherits(K256, MPrime); - - K256.prototype.split = function split (input, output) { - // 256 = 9 * 26 + 22 - var mask = 0x3fffff; - - var outLen = Math.min(input.length, 9); - for (var i = 0; i < outLen; i++) { - output.words[i] = input.words[i]; - } - output.length = outLen; - - if (input.length <= 9) { - input.words[0] = 0; - input.length = 1; - return; - } - - // Shift by 9 limbs - var prev = input.words[9]; - output.words[output.length++] = prev & mask; - - for (i = 10; i < input.length; i++) { - var next = input.words[i] | 0; - input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22); - prev = next; - } - prev >>>= 22; - input.words[i - 10] = prev; - if (prev === 0 && input.length > 10) { - input.length -= 10; - } else { - input.length -= 9; - } - }; - - K256.prototype.imulK = function imulK (num) { - // K = 0x1000003d1 = [ 0x40, 0x3d1 ] - num.words[num.length] = 0; - num.words[num.length + 1] = 0; - num.length += 2; - - // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390 - var lo = 0; - for (var i = 0; i < num.length; i++) { - var w = num.words[i] | 0; - lo += w * 0x3d1; - num.words[i] = lo & 0x3ffffff; - lo = w * 0x40 + ((lo / 0x4000000) | 0); - } - - // Fast length reduction - if (num.words[num.length - 1] === 0) { - num.length--; - if (num.words[num.length - 1] === 0) { - num.length--; - } - } - return num; - }; - - function P224 () { - MPrime.call( - this, - 'p224', - 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001'); - } - inherits(P224, MPrime); - - function P192 () { - MPrime.call( - this, - 'p192', - 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff'); - } - inherits(P192, MPrime); - - function P25519 () { - // 2 ^ 255 - 19 - MPrime.call( - this, - '25519', - '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed'); - } - inherits(P25519, MPrime); - - P25519.prototype.imulK = function imulK (num) { - // K = 0x13 - var carry = 0; - for (var i = 0; i < num.length; i++) { - var hi = (num.words[i] | 0) * 0x13 + carry; - var lo = hi & 0x3ffffff; - hi >>>= 26; - - num.words[i] = lo; - carry = hi; - } - if (carry !== 0) { - num.words[num.length++] = carry; - } - return num; - }; - - // Exported mostly for testing purposes, use plain name instead - BN._prime = function prime (name) { - // Cached version of prime - if (primes[name]) return primes[name]; - - var prime; - if (name === 'k256') { - prime = new K256(); - } else if (name === 'p224') { - prime = new P224(); - } else if (name === 'p192') { - prime = new P192(); - } else if (name === 'p25519') { - prime = new P25519(); - } else { - throw new Error('Unknown prime ' + name); - } - primes[name] = prime; - - return prime; - }; - - // - // Base reduction engine - // - function Red (m) { - if (typeof m === 'string') { - var prime = BN._prime(m); - this.m = prime.p; - this.prime = prime; - } else { - assert(m.gtn(1), 'modulus must be greater than 1'); - this.m = m; - this.prime = null; - } - } - - Red.prototype._verify1 = function _verify1 (a) { - assert(a.negative === 0, 'red works only with positives'); - assert(a.red, 'red works only with red numbers'); - }; - - Red.prototype._verify2 = function _verify2 (a, b) { - assert((a.negative | b.negative) === 0, 'red works only with positives'); - assert(a.red && a.red === b.red, - 'red works only with red numbers'); - }; - - Red.prototype.imod = function imod (a) { - if (this.prime) return this.prime.ireduce(a)._forceRed(this); - return a.umod(this.m)._forceRed(this); - }; - - Red.prototype.neg = function neg (a) { - if (a.isZero()) { - return a.clone(); - } - - return this.m.sub(a)._forceRed(this); - }; - - Red.prototype.add = function add (a, b) { - this._verify2(a, b); - - var res = a.add(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.iadd = function iadd (a, b) { - this._verify2(a, b); - - var res = a.iadd(b); - if (res.cmp(this.m) >= 0) { - res.isub(this.m); - } - return res; - }; - - Red.prototype.sub = function sub (a, b) { - this._verify2(a, b); - - var res = a.sub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res._forceRed(this); - }; - - Red.prototype.isub = function isub (a, b) { - this._verify2(a, b); - - var res = a.isub(b); - if (res.cmpn(0) < 0) { - res.iadd(this.m); - } - return res; - }; - - Red.prototype.shl = function shl (a, num) { - this._verify1(a); - return this.imod(a.ushln(num)); - }; - - Red.prototype.imul = function imul (a, b) { - this._verify2(a, b); - return this.imod(a.imul(b)); - }; - - Red.prototype.mul = function mul (a, b) { - this._verify2(a, b); - return this.imod(a.mul(b)); - }; - - Red.prototype.isqr = function isqr (a) { - return this.imul(a, a.clone()); - }; - - Red.prototype.sqr = function sqr (a) { - return this.mul(a, a); - }; - - Red.prototype.sqrt = function sqrt (a) { - if (a.isZero()) return a.clone(); - - var mod3 = this.m.andln(3); - assert(mod3 % 2 === 1); - - // Fast case - if (mod3 === 3) { - var pow = this.m.add(new BN(1)).iushrn(2); - return this.pow(a, pow); - } - - // Tonelli-Shanks algorithm (Totally unoptimized and slow) - // - // Find Q and S, that Q * 2 ^ S = (P - 1) - var q = this.m.subn(1); - var s = 0; - while (!q.isZero() && q.andln(1) === 0) { - s++; - q.iushrn(1); - } - assert(!q.isZero()); - - var one = new BN(1).toRed(this); - var nOne = one.redNeg(); - - // Find quadratic non-residue - // NOTE: Max is such because of generalized Riemann hypothesis. - var lpow = this.m.subn(1).iushrn(1); - var z = this.m.bitLength(); - z = new BN(2 * z * z).toRed(this); - - while (this.pow(z, lpow).cmp(nOne) !== 0) { - z.redIAdd(nOne); - } - - var c = this.pow(z, q); - var r = this.pow(a, q.addn(1).iushrn(1)); - var t = this.pow(a, q); - var m = s; - while (t.cmp(one) !== 0) { - var tmp = t; - for (var i = 0; tmp.cmp(one) !== 0; i++) { - tmp = tmp.redSqr(); - } - assert(i < m); - var b = this.pow(c, new BN(1).iushln(m - i - 1)); - - r = r.redMul(b); - c = b.redSqr(); - t = t.redMul(c); - m = i; - } - - return r; - }; - - Red.prototype.invm = function invm (a) { - var inv = a._invmp(this.m); - if (inv.negative !== 0) { - inv.negative = 0; - return this.imod(inv).redNeg(); - } else { - return this.imod(inv); - } - }; - - Red.prototype.pow = function pow (a, num) { - if (num.isZero()) return new BN(1).toRed(this); - if (num.cmpn(1) === 0) return a.clone(); - - var windowSize = 4; - var wnd = new Array(1 << windowSize); - wnd[0] = new BN(1).toRed(this); - wnd[1] = a; - for (var i = 2; i < wnd.length; i++) { - wnd[i] = this.mul(wnd[i - 1], a); - } - - var res = wnd[0]; - var current = 0; - var currentLen = 0; - var start = num.bitLength() % 26; - if (start === 0) { - start = 26; - } - - for (i = num.length - 1; i >= 0; i--) { - var word = num.words[i]; - for (var j = start - 1; j >= 0; j--) { - var bit = (word >> j) & 1; - if (res !== wnd[0]) { - res = this.sqr(res); - } - - if (bit === 0 && current === 0) { - currentLen = 0; - continue; - } - - current <<= 1; - current |= bit; - currentLen++; - if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue; - - res = this.mul(res, wnd[current]); - currentLen = 0; - current = 0; - } - start = 26; - } - - return res; - }; - - Red.prototype.convertTo = function convertTo (num) { - var r = num.umod(this.m); - - return r === num ? r.clone() : r; - }; - - Red.prototype.convertFrom = function convertFrom (num) { - var res = num.clone(); - res.red = null; - return res; - }; - - // - // Montgomery method engine - // - - BN.mont = function mont (num) { - return new Mont(num); - }; - - function Mont (m) { - Red.call(this, m); - - this.shift = this.m.bitLength(); - if (this.shift % 26 !== 0) { - this.shift += 26 - (this.shift % 26); - } - - this.r = new BN(1).iushln(this.shift); - this.r2 = this.imod(this.r.sqr()); - this.rinv = this.r._invmp(this.m); - - this.minv = this.rinv.mul(this.r).isubn(1).div(this.m); - this.minv = this.minv.umod(this.r); - this.minv = this.r.sub(this.minv); - } - inherits(Mont, Red); - - Mont.prototype.convertTo = function convertTo (num) { - return this.imod(num.ushln(this.shift)); - }; - - Mont.prototype.convertFrom = function convertFrom (num) { - var r = this.imod(num.mul(this.rinv)); - r.red = null; - return r; - }; - - Mont.prototype.imul = function imul (a, b) { - if (a.isZero() || b.isZero()) { - a.words[0] = 0; - a.length = 1; - return a; - } - - var t = a.imul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.mul = function mul (a, b) { - if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this); - - var t = a.mul(b); - var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m); - var u = t.isub(c).iushrn(this.shift); - var res = u; - if (u.cmp(this.m) >= 0) { - res = u.isub(this.m); - } else if (u.cmpn(0) < 0) { - res = u.iadd(this.m); - } - - return res._forceRed(this); - }; - - Mont.prototype.invm = function invm (a) { - // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R - var res = this.imod(a._invmp(this.m).mul(this.r2)); - return res._forceRed(this); - }; -})( false || module, this); - - -/***/ }), - -/***/ "./node_modules/public-encrypt/privateDecrypt.js": -/*!*******************************************************!*\ - !*** ./node_modules/public-encrypt/privateDecrypt.js ***! - \*******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var parseKeys = __webpack_require__(/*! parse-asn1 */ "./node_modules/parse-asn1/index.js") -var mgf = __webpack_require__(/*! ./mgf */ "./node_modules/public-encrypt/mgf.js") -var xor = __webpack_require__(/*! ./xor */ "./node_modules/public-encrypt/xor.js") -var BN = __webpack_require__(/*! bn.js */ "./node_modules/public-encrypt/node_modules/bn.js/lib/bn.js") -var crt = __webpack_require__(/*! browserify-rsa */ "./node_modules/browserify-rsa/index.js") -var createHash = __webpack_require__(/*! create-hash */ "./node_modules/create-hash/browser.js") -var withPublic = __webpack_require__(/*! ./withPublic */ "./node_modules/public-encrypt/withPublic.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -module.exports = function privateDecrypt (privateKey, enc, reverse) { - var padding - if (privateKey.padding) { - padding = privateKey.padding - } else if (reverse) { - padding = 1 - } else { - padding = 4 - } - - var key = parseKeys(privateKey) - var k = key.modulus.byteLength() - if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) { - throw new Error('decryption error') - } - var msg - if (reverse) { - msg = withPublic(new BN(enc), key) - } else { - msg = crt(enc, key) - } - var zBuffer = Buffer.alloc(k - msg.length) - msg = Buffer.concat([zBuffer, msg], k) - if (padding === 4) { - return oaep(key, msg) - } else if (padding === 1) { - return pkcs1(key, msg, reverse) - } else if (padding === 3) { - return msg - } else { - throw new Error('unknown padding') - } -} - -function oaep (key, msg) { - var k = key.modulus.byteLength() - var iHash = createHash('sha1').update(Buffer.alloc(0)).digest() - var hLen = iHash.length - if (msg[0] !== 0) { - throw new Error('decryption error') - } - var maskedSeed = msg.slice(1, hLen + 1) - var maskedDb = msg.slice(hLen + 1) - var seed = xor(maskedSeed, mgf(maskedDb, hLen)) - var db = xor(maskedDb, mgf(seed, k - hLen - 1)) - if (compare(iHash, db.slice(0, hLen))) { - throw new Error('decryption error') - } - var i = hLen - while (db[i] === 0) { - i++ - } - if (db[i++] !== 1) { - throw new Error('decryption error') - } - return db.slice(i) -} - -function pkcs1 (key, msg, reverse) { - var p1 = msg.slice(0, 2) - var i = 2 - var status = 0 - while (msg[i++] !== 0) { - if (i >= msg.length) { - status++ - break - } - } - var ps = msg.slice(2, i - 1) - - if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)) { - status++ - } - if (ps.length < 8) { - status++ - } - if (status) { - throw new Error('decryption error') - } - return msg.slice(i) -} -function compare (a, b) { - a = Buffer.from(a) - b = Buffer.from(b) - var dif = 0 - var len = a.length - if (a.length !== b.length) { - dif++ - len = Math.min(a.length, b.length) - } - var i = -1 - while (++i < len) { - dif += (a[i] ^ b[i]) - } - return dif -} - - -/***/ }), - -/***/ "./node_modules/public-encrypt/publicEncrypt.js": -/*!******************************************************!*\ - !*** ./node_modules/public-encrypt/publicEncrypt.js ***! - \******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var parseKeys = __webpack_require__(/*! parse-asn1 */ "./node_modules/parse-asn1/index.js") -var randomBytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") -var createHash = __webpack_require__(/*! create-hash */ "./node_modules/create-hash/browser.js") -var mgf = __webpack_require__(/*! ./mgf */ "./node_modules/public-encrypt/mgf.js") -var xor = __webpack_require__(/*! ./xor */ "./node_modules/public-encrypt/xor.js") -var BN = __webpack_require__(/*! bn.js */ "./node_modules/public-encrypt/node_modules/bn.js/lib/bn.js") -var withPublic = __webpack_require__(/*! ./withPublic */ "./node_modules/public-encrypt/withPublic.js") -var crt = __webpack_require__(/*! browserify-rsa */ "./node_modules/browserify-rsa/index.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -module.exports = function publicEncrypt (publicKey, msg, reverse) { - var padding - if (publicKey.padding) { - padding = publicKey.padding - } else if (reverse) { - padding = 1 - } else { - padding = 4 - } - var key = parseKeys(publicKey) - var paddedMsg - if (padding === 4) { - paddedMsg = oaep(key, msg) - } else if (padding === 1) { - paddedMsg = pkcs1(key, msg, reverse) - } else if (padding === 3) { - paddedMsg = new BN(msg) - if (paddedMsg.cmp(key.modulus) >= 0) { - throw new Error('data too long for modulus') - } - } else { - throw new Error('unknown padding') - } - if (reverse) { - return crt(paddedMsg, key) - } else { - return withPublic(paddedMsg, key) - } -} - -function oaep (key, msg) { - var k = key.modulus.byteLength() - var mLen = msg.length - var iHash = createHash('sha1').update(Buffer.alloc(0)).digest() - var hLen = iHash.length - var hLen2 = 2 * hLen - if (mLen > k - hLen2 - 2) { - throw new Error('message too long') - } - var ps = Buffer.alloc(k - mLen - hLen2 - 2) - var dblen = k - hLen - 1 - var seed = randomBytes(hLen) - var maskedDb = xor(Buffer.concat([iHash, ps, Buffer.alloc(1, 1), msg], dblen), mgf(seed, dblen)) - var maskedSeed = xor(seed, mgf(maskedDb, hLen)) - return new BN(Buffer.concat([Buffer.alloc(1), maskedSeed, maskedDb], k)) -} -function pkcs1 (key, msg, reverse) { - var mLen = msg.length - var k = key.modulus.byteLength() - if (mLen > k - 11) { - throw new Error('message too long') - } - var ps - if (reverse) { - ps = Buffer.alloc(k - mLen - 3, 0xff) - } else { - ps = nonZero(k - mLen - 3) - } - return new BN(Buffer.concat([Buffer.from([0, reverse ? 1 : 2]), ps, Buffer.alloc(1), msg], k)) -} -function nonZero (len) { - var out = Buffer.allocUnsafe(len) - var i = 0 - var cache = randomBytes(len * 2) - var cur = 0 - var num - while (i < len) { - if (cur === cache.length) { - cache = randomBytes(len * 2) - cur = 0 - } - num = cache[cur++] - if (num) { - out[i++] = num - } - } - return out -} - - -/***/ }), - -/***/ "./node_modules/public-encrypt/withPublic.js": -/*!***************************************************!*\ - !*** ./node_modules/public-encrypt/withPublic.js ***! - \***************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var BN = __webpack_require__(/*! bn.js */ "./node_modules/public-encrypt/node_modules/bn.js/lib/bn.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -function withPublic (paddedMsg, key) { - return Buffer.from(paddedMsg - .toRed(BN.mont(key.modulus)) - .redPow(new BN(key.publicExponent)) - .fromRed() - .toArray()) -} - -module.exports = withPublic - - -/***/ }), - -/***/ "./node_modules/public-encrypt/xor.js": -/*!********************************************!*\ - !*** ./node_modules/public-encrypt/xor.js ***! - \********************************************/ -/***/ ((module) => { - -module.exports = function xor (a, b) { - var len = a.length - var i = -1 - while (++i < len) { - a[i] ^= b[i] - } - return a -} - - -/***/ }), - -/***/ "./node_modules/pump/index.js": -/*!************************************!*\ - !*** ./node_modules/pump/index.js ***! - \************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -var once = __webpack_require__(/*! once */ "./node_modules/once/once.js") -var eos = __webpack_require__(/*! end-of-stream */ "./node_modules/end-of-stream/index.js") -var fs = __webpack_require__(/*! fs */ "?7874") // we only need fs to get the ReadStream and WriteStream prototypes - -var noop = function () {} -var ancient = /^v?\.0/.test(process.version) - -var isFn = function (fn) { - return typeof fn === 'function' -} - -var isFS = function (stream) { - if (!ancient) return false // newer node version do not need to care about fs is a special way - if (!fs) return false // browser - return (stream instanceof (fs.ReadStream || noop) || stream instanceof (fs.WriteStream || noop)) && isFn(stream.close) -} - -var isRequest = function (stream) { - return stream.setHeader && isFn(stream.abort) -} - -var destroyer = function (stream, reading, writing, callback) { - callback = once(callback) - - var closed = false - stream.on('close', function () { - closed = true - }) - - eos(stream, {readable: reading, writable: writing}, function (err) { - if (err) return callback(err) - closed = true - callback() - }) - - var destroyed = false - return function (err) { - if (closed) return - if (destroyed) return - destroyed = true - - if (isFS(stream)) return stream.close(noop) // use close for fs streams to avoid fd leaks - if (isRequest(stream)) return stream.abort() // request.destroy just do .end - .abort is what we want - - if (isFn(stream.destroy)) return stream.destroy() - - callback(err || new Error('stream was destroyed')) - } -} - -var call = function (fn) { - fn() -} - -var pipe = function (from, to) { - return from.pipe(to) -} - -var pump = function () { - var streams = Array.prototype.slice.call(arguments) - var callback = isFn(streams[streams.length - 1] || noop) && streams.pop() || noop - - if (Array.isArray(streams[0])) streams = streams[0] - if (streams.length < 2) throw new Error('pump requires two streams per minimum') - - var error - var destroys = streams.map(function (stream, i) { - var reading = i < streams.length - 1 - var writing = i > 0 - return destroyer(stream, reading, writing, function (err) { - if (!error) error = err - if (err) destroys.forEach(call) - if (reading) return - destroys.forEach(call) - callback(error) - }) - }) - - return streams.reduce(pipe) -} - -module.exports = pump - - -/***/ }), - -/***/ "./node_modules/querystring/decode.js": -/*!********************************************!*\ - !*** ./node_modules/querystring/decode.js ***! - \********************************************/ -/***/ ((module) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - - -// If obj.hasOwnProperty has been overridden, then calling -// obj.hasOwnProperty(prop) will break. -// See: https://github.com/joyent/node/issues/1707 -function hasOwnProperty(obj, prop) { - return Object.prototype.hasOwnProperty.call(obj, prop); -} - -module.exports = function(qs, sep, eq, options) { - sep = sep || '&'; - eq = eq || '='; - var obj = {}; - - if (typeof qs !== 'string' || qs.length === 0) { - return obj; - } - - var regexp = /\+/g; - qs = qs.split(sep); - - var maxKeys = 1000; - if (options && typeof options.maxKeys === 'number') { - maxKeys = options.maxKeys; - } - - var len = qs.length; - // maxKeys <= 0 means that we should not limit keys count - if (maxKeys > 0 && len > maxKeys) { - len = maxKeys; - } - - for (var i = 0; i < len; ++i) { - var x = qs[i].replace(regexp, '%20'), - idx = x.indexOf(eq), - kstr, vstr, k, v; - - if (idx >= 0) { - kstr = x.substr(0, idx); - vstr = x.substr(idx + 1); - } else { - kstr = x; - vstr = ''; - } - - k = decodeURIComponent(kstr); - v = decodeURIComponent(vstr); - - if (!hasOwnProperty(obj, k)) { - obj[k] = v; - } else if (Array.isArray(obj[k])) { - obj[k].push(v); - } else { - obj[k] = [obj[k], v]; - } - } - - return obj; -}; - - -/***/ }), - -/***/ "./node_modules/querystring/encode.js": -/*!********************************************!*\ - !*** ./node_modules/querystring/encode.js ***! - \********************************************/ -/***/ ((module) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - - -var stringifyPrimitive = function(v) { - switch (typeof v) { - case 'string': - return v; - - case 'boolean': - return v ? 'true' : 'false'; - - case 'number': - return isFinite(v) ? v : ''; - - default: - return ''; - } -}; - -module.exports = function(obj, sep, eq, name) { - sep = sep || '&'; - eq = eq || '='; - if (obj === null) { - obj = undefined; - } - - if (typeof obj === 'object') { - return Object.keys(obj).map(function(k) { - var ks = encodeURIComponent(stringifyPrimitive(k)) + eq; - if (Array.isArray(obj[k])) { - return obj[k].map(function(v) { - return ks + encodeURIComponent(stringifyPrimitive(v)); - }).join(sep); - } else { - return ks + encodeURIComponent(stringifyPrimitive(obj[k])); - } - }).join(sep); - - } - - if (!name) return ''; - return encodeURIComponent(stringifyPrimitive(name)) + eq + - encodeURIComponent(stringifyPrimitive(obj)); -}; - - -/***/ }), - -/***/ "./node_modules/querystring/index.js": -/*!*******************************************!*\ - !*** ./node_modules/querystring/index.js ***! - \*******************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; - - -exports.decode = exports.parse = __webpack_require__(/*! ./decode */ "./node_modules/querystring/decode.js"); -exports.encode = exports.stringify = __webpack_require__(/*! ./encode */ "./node_modules/querystring/encode.js"); - - -/***/ }), - -/***/ "./node_modules/queue-microtask/index.js": -/*!***********************************************!*\ - !*** ./node_modules/queue-microtask/index.js ***! - \***********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*! queue-microtask. MIT License. Feross Aboukhadijeh */ -let promise - -module.exports = typeof queueMicrotask === 'function' - ? queueMicrotask.bind(typeof window !== 'undefined' ? window : __webpack_require__.g) - // reuse resolved promise, and allocate it lazily - : cb => (promise || (promise = Promise.resolve())) - .then(cb) - .catch(err => setTimeout(() => { throw err }, 0)) - - -/***/ }), - -/***/ "./node_modules/queue-tick/queue-microtask.js": -/*!****************************************************!*\ - !*** ./node_modules/queue-tick/queue-microtask.js ***! - \****************************************************/ -/***/ ((module) => { - -module.exports = typeof queueMicrotask === 'function' ? queueMicrotask : (fn) => Promise.resolve().then(fn) - - -/***/ }), - -/***/ "./node_modules/random-iterate/index.js": -/*!**********************************************!*\ - !*** ./node_modules/random-iterate/index.js ***! - \**********************************************/ -/***/ ((module) => { - -var iterate = function (list) { - var offset = 0 - return function () { - if (offset === list.length) return null - - var len = list.length - offset - var i = (Math.random() * len) | 0 - var el = list[offset + i] - - var tmp = list[offset] - list[offset] = el - list[offset + i] = tmp - offset++ - - return el - } -} - -module.exports = iterate - - -/***/ }), - -/***/ "./node_modules/randombytes/browser.js": -/*!*********************************************!*\ - !*** ./node_modules/randombytes/browser.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); - - -// limit of Crypto.getRandomValues() -// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues -var MAX_BYTES = 65536 - -// Node supports requesting up to this number of bytes -// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48 -var MAX_UINT32 = 4294967295 - -function oldBrowser () { - throw new Error('Secure random number generation is not supported by this browser.\nUse Chrome, Firefox or Internet Explorer 11') -} - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer -var crypto = __webpack_require__.g.crypto || __webpack_require__.g.msCrypto - -if (crypto && crypto.getRandomValues) { - module.exports = randomBytes -} else { - module.exports = oldBrowser -} - -function randomBytes (size, cb) { - // phantomjs needs to throw - if (size > MAX_UINT32) throw new RangeError('requested too many random bytes') - - var bytes = Buffer.allocUnsafe(size) - - if (size > 0) { // getRandomValues fails on IE if size == 0 - if (size > MAX_BYTES) { // this is the max bytes crypto.getRandomValues - // can do at once see https://developer.mozilla.org/en-US/docs/Web/API/window.crypto.getRandomValues - for (var generated = 0; generated < size; generated += MAX_BYTES) { - // buffer.slice automatically checks if the end is past the end of - // the buffer so we don't have to here - crypto.getRandomValues(bytes.slice(generated, generated + MAX_BYTES)) - } - } else { - crypto.getRandomValues(bytes) - } - } - - if (typeof cb === 'function') { - return process.nextTick(function () { - cb(null, bytes) - }) - } - - return bytes -} - - -/***/ }), - -/***/ "./node_modules/randomfill/browser.js": -/*!********************************************!*\ - !*** ./node_modules/randomfill/browser.js ***! - \********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); - - -function oldBrowser () { - throw new Error('secure random number generation not supported by this browser\nuse chrome, FireFox or Internet Explorer 11') -} -var safeBuffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js") -var randombytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") -var Buffer = safeBuffer.Buffer -var kBufferMaxLength = safeBuffer.kMaxLength -var crypto = __webpack_require__.g.crypto || __webpack_require__.g.msCrypto -var kMaxUint32 = Math.pow(2, 32) - 1 -function assertOffset (offset, length) { - if (typeof offset !== 'number' || offset !== offset) { // eslint-disable-line no-self-compare - throw new TypeError('offset must be a number') - } - - if (offset > kMaxUint32 || offset < 0) { - throw new TypeError('offset must be a uint32') - } - - if (offset > kBufferMaxLength || offset > length) { - throw new RangeError('offset out of range') - } -} - -function assertSize (size, offset, length) { - if (typeof size !== 'number' || size !== size) { // eslint-disable-line no-self-compare - throw new TypeError('size must be a number') - } - - if (size > kMaxUint32 || size < 0) { - throw new TypeError('size must be a uint32') - } - - if (size + offset > length || size > kBufferMaxLength) { - throw new RangeError('buffer too small') - } -} -if ((crypto && crypto.getRandomValues) || !process.browser) { - exports.randomFill = randomFill - exports.randomFillSync = randomFillSync -} else { - exports.randomFill = oldBrowser - exports.randomFillSync = oldBrowser -} -function randomFill (buf, offset, size, cb) { - if (!Buffer.isBuffer(buf) && !(buf instanceof __webpack_require__.g.Uint8Array)) { - throw new TypeError('"buf" argument must be a Buffer or Uint8Array') - } - - if (typeof offset === 'function') { - cb = offset - offset = 0 - size = buf.length - } else if (typeof size === 'function') { - cb = size - size = buf.length - offset - } else if (typeof cb !== 'function') { - throw new TypeError('"cb" argument must be a function') - } - assertOffset(offset, buf.length) - assertSize(size, offset, buf.length) - return actualFill(buf, offset, size, cb) -} - -function actualFill (buf, offset, size, cb) { - if (process.browser) { - var ourBuf = buf.buffer - var uint = new Uint8Array(ourBuf, offset, size) - crypto.getRandomValues(uint) - if (cb) { - process.nextTick(function () { - cb(null, buf) - }) - return - } - return buf - } - if (cb) { - randombytes(size, function (err, bytes) { - if (err) { - return cb(err) - } - bytes.copy(buf, offset) - cb(null, buf) - }) - return - } - var bytes = randombytes(size) - bytes.copy(buf, offset) - return buf -} -function randomFillSync (buf, offset, size) { - if (typeof offset === 'undefined') { - offset = 0 - } - if (!Buffer.isBuffer(buf) && !(buf instanceof __webpack_require__.g.Uint8Array)) { - throw new TypeError('"buf" argument must be a Buffer or Uint8Array') - } - - assertOffset(offset, buf.length) - - if (size === undefined) size = buf.length - offset - - assertSize(size, offset, buf.length) - - return actualFill(buf, offset, size) -} - - -/***/ }), - -/***/ "./node_modules/range-parser/index.js": -/*!********************************************!*\ - !*** ./node_modules/range-parser/index.js ***! - \********************************************/ -/***/ ((module) => { - -"use strict"; -/*! - * range-parser - * Copyright(c) 2012-2014 TJ Holowaychuk - * Copyright(c) 2015-2016 Douglas Christopher Wilson - * MIT Licensed - */ - - - -/** - * Module exports. - * @public - */ - -module.exports = rangeParser - -/** - * Parse "Range" header `str` relative to the given file `size`. - * - * @param {Number} size - * @param {String} str - * @param {Object} [options] - * @return {Array} - * @public - */ - -function rangeParser (size, str, options) { - if (typeof str !== 'string') { - throw new TypeError('argument str must be a string') - } - - var index = str.indexOf('=') - - if (index === -1) { - return -2 - } - - // split the range string - var arr = str.slice(index + 1).split(',') - var ranges = [] - - // add ranges type - ranges.type = str.slice(0, index) - - // parse all ranges - for (var i = 0; i < arr.length; i++) { - var range = arr[i].split('-') - var start = parseInt(range[0], 10) - var end = parseInt(range[1], 10) - - // -nnn - if (isNaN(start)) { - start = size - end - end = size - 1 - // nnn- - } else if (isNaN(end)) { - end = size - 1 - } - - // limit last-byte-pos to current length - if (end > size - 1) { - end = size - 1 - } - - // invalid or unsatisifiable - if (isNaN(start) || isNaN(end) || start > end || start < 0) { - continue - } - - // add range - ranges.push({ - start: start, - end: end - }) - } - - if (ranges.length < 1) { - // unsatisifiable - return -1 - } - - return options && options.combine - ? combineRanges(ranges) - : ranges -} - -/** - * Combine overlapping & adjacent ranges. - * @private - */ - -function combineRanges (ranges) { - var ordered = ranges.map(mapWithIndex).sort(sortByRangeStart) - - for (var j = 0, i = 1; i < ordered.length; i++) { - var range = ordered[i] - var current = ordered[j] - - if (range.start > current.end + 1) { - // next range - ordered[++j] = range - } else if (range.end > current.end) { - // extend range - current.end = range.end - current.index = Math.min(current.index, range.index) - } - } - - // trim ordered array - ordered.length = j + 1 - - // generate combined range - var combined = ordered.sort(sortByRangeIndex).map(mapWithoutIndex) - - // copy ranges type - combined.type = ranges.type - - return combined -} - -/** - * Map function to add index value to ranges. - * @private - */ - -function mapWithIndex (range, index) { - return { - start: range.start, - end: range.end, - index: index - } -} - -/** - * Map function to remove index value from ranges. - * @private - */ - -function mapWithoutIndex (range) { - return { - start: range.start, - end: range.end - } -} - -/** - * Sort function to sort ranges by index. - * @private - */ - -function sortByRangeIndex (a, b) { - return a.index - b.index -} - -/** - * Sort function to sort ranges by start position. - * @private - */ - -function sortByRangeStart (a, b) { - return a.start - b.start -} - - -/***/ }), - -/***/ "./node_modules/range-slice-stream/index.js": -/*!**************************************************!*\ - !*** ./node_modules/range-slice-stream/index.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* -Instance of writable stream. - -call .get(length) or .discard(length) to get a stream (relative to the last end) - -emits 'stalled' once everything is written - -*/ -const { Writable, PassThrough } = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") - -class RangeSliceStream extends Writable { - constructor (offset, opts = {}) { - super(opts) - - this.destroyed = false - this._queue = [] - this._position = offset || 0 - this._cb = null - this._buffer = null - this._out = null - } - - _write (chunk, encoding, cb) { - let drained = true - - while (true) { - if (this.destroyed) { - return - } - - // Wait for more queue entries - if (this._queue.length === 0) { - this._buffer = chunk - this._cb = cb - return - } - - this._buffer = null - var currRange = this._queue[0] - // Relative to the start of chunk, what data do we need? - const writeStart = Math.max(currRange.start - this._position, 0) - const writeEnd = currRange.end - this._position - - // Check if we need to throw it all away - if (writeStart >= chunk.length) { - this._position += chunk.length - return cb(null) - } - - // Check if we need to use it all - let toWrite - if (writeEnd > chunk.length) { - this._position += chunk.length - if (writeStart === 0) { - toWrite = chunk - } else { - toWrite = chunk.slice(writeStart) - } - drained = currRange.stream.write(toWrite) && drained - break - } - - this._position += writeEnd - - toWrite = (writeStart === 0 && writeEnd === chunk.length) - ? chunk - : chunk.slice(writeStart, writeEnd) - - drained = currRange.stream.write(toWrite) && drained - if (currRange.last) { - currRange.stream.end() - } - chunk = chunk.slice(writeEnd) - this._queue.shift() - } - - if (drained) { - cb(null) - } else { - currRange.stream.once('drain', cb.bind(null, null)) - } - } - - slice (ranges) { - if (this.destroyed) return null - - if (!Array.isArray(ranges)) ranges = [ranges] - - const str = new PassThrough() - - ranges.forEach((range, i) => { - this._queue.push({ - start: range.start, - end: range.end, - stream: str, - last: i === ranges.length - 1 - }) - }) - - if (this._buffer) { - this._write(this._buffer, null, this._cb) - } - - return str - } - - destroy (err) { - if (this.destroyed) return - this.destroyed = true - - if (err) this.emit('error', err) - } -} - -module.exports = RangeSliceStream - - -/***/ }), - -/***/ "./node_modules/rc4/rc4.js": -/*!*********************************!*\ - !*** ./node_modules/rc4/rc4.js ***! - \*********************************/ -/***/ ((module) => { - -"use strict"; - - -// Based on RC4 algorithm, as described in -// http://en.wikipedia.org/wiki/RC4 - -function isInteger(n) { - return parseInt(n, 10) === n; -} - -function createRC4(N) { - function identityPermutation() { - var s = new Array(N); - for (var i = 0; i < N; i++) { - s[i] = i; - } - return s; - } - - // :: string | array integer -> array integer - function seed(key) { - if (key === undefined) { - key = new Array(N); - for (var k = 0; k < N; k++) { - key[k] = Math.floor(Math.random() * N); - } - } else if (typeof key === "string") { - // to string - key = "" + key; - key = key.split("").map(function (c) { return c.charCodeAt(0) % N; }); - } else if (Array.isArray(key)) { - if (!key.every(function (v) { - return typeof v === "number" && v === (v | 0); - })) { - throw new TypeError("invalid seed key specified: not array of integers"); - } - } else { - throw new TypeError("invalid seed key specified"); - } - - var keylen = key.length; - - // resed state - var s = identityPermutation(); - - var j = 0; - for (var i = 0; i < N; i++) { - j = (j + s[i] + key[i % keylen]) % N; - var tmp = s[i]; - s[i] = s[j]; - s[j] = tmp; - } - - return s; - } - - /* eslint-disable no-shadow */ - function RC4(key) { - this.s = seed(key); - this.i = 0; - this.j = 0; - } - /* eslint-enable no-shadow */ - - RC4.prototype.randomNative = function () { - this.i = (this.i + 1) % N; - this.j = (this.j + this.s[this.i]) % N; - - var tmp = this.s[this.i]; - this.s[this.i] = this.s[this.j]; - this.s[this.j] = tmp; - - var k = this.s[(this.s[this.i] + this.s[this.j]) % N]; - - return k; - }; - - RC4.prototype.randomUInt32 = function () { - var a = this.randomByte(); - var b = this.randomByte(); - var c = this.randomByte(); - var d = this.randomByte(); - - return ((a * 256 + b) * 256 + c) * 256 + d; - }; - - RC4.prototype.randomFloat = function () { - return this.randomUInt32() / 0x100000000; - }; - - RC4.prototype.random = function () { - var a; - var b; - - if (arguments.length === 1) { - a = 0; - b = arguments[0]; - } else if (arguments.length === 2) { - a = arguments[0]; - b = arguments[1]; - } else { - throw new TypeError("random takes one or two integer arguments"); - } - - if (!isInteger(a) || !isInteger(b)) { - throw new TypeError("random takes one or two integer arguments"); - } - - return a + this.randomUInt32() % (b - a + 1); - }; - - RC4.prototype.currentState = function () { - return { - i: this.i, - j: this.j, - s: this.s.slice(), // copy - }; - }; - - RC4.prototype.setState = function (state) { - var s = state.s; - var i = state.i; - var j = state.j; - - /* eslint-disable yoda */ - if (!(i === (i | 0) && 0 <= i && i < N)) { - throw new Error("state.i should be integer [0, " + (N - 1) + "]"); - } - - if (!(j === (j | 0) && 0 <= j && j < N)) { - throw new Error("state.j should be integer [0, " + (N - 1) + "]"); - } - /* eslint-enable yoda */ - - // check length - if (!Array.isArray(s) || s.length !== N) { - throw new Error("state should be array of length " + N); - } - - // check that all params are there - for (var k = 0; k < N; k++) { - if (s.indexOf(k) === -1) { - throw new Error("state should be permutation of 0.." + (N - 1) + ": " + k + " is missing"); - } - } - - this.i = i; - this.j = j; - this.s = s.slice(); // assign copy - }; - - return RC4; -} - -var RC4 = createRC4(256); -RC4.prototype.randomByte = RC4.prototype.randomNative; - -var RC4small = createRC4(16); -RC4small.prototype.randomByte = function () { - var a = this.randomNative(); - var b = this.randomNative(); - - return a * 16 + b; -}; - -var ordA = "a".charCodeAt(0); -var ord0 = "0".charCodeAt(0); - -function toHex(n) { - return n < 10 ? String.fromCharCode(ord0 + n) : String.fromCharCode(ordA + n - 10); -} - -function fromHex(c) { - return parseInt(c, 16); -} - -RC4small.prototype.currentStateString = function () { - var state = this.currentState(); - - var i = toHex(state.i); - var j = toHex(state.j); - - var res = i + j + state.s.map(toHex).join(""); - return res; -}; - -RC4small.prototype.setStateString = function (stateString) { - if (!stateString.match(/^[0-9a-f]{18}$/)) { - throw new TypeError("RC4small stateString should be 18 hex character string"); - } - - var i = fromHex(stateString[0]); - var j = fromHex(stateString[1]); - var s = stateString.split("").slice(2).map(fromHex); - - this.setState({ - i: i, - j: j, - s: s, - }); -}; - -RC4.RC4small = RC4small; - -module.exports = RC4; - - -/***/ }), - -/***/ "./node_modules/readable-stream/errors-browser.js": -/*!********************************************************!*\ - !*** ./node_modules/readable-stream/errors-browser.js ***! - \********************************************************/ -/***/ ((module) => { - -"use strict"; - - -function _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; } - -var codes = {}; - -function createErrorType(code, message, Base) { - if (!Base) { - Base = Error; - } - - function getMessage(arg1, arg2, arg3) { - if (typeof message === 'string') { - return message; - } else { - return message(arg1, arg2, arg3); - } - } - - var NodeError = - /*#__PURE__*/ - function (_Base) { - _inheritsLoose(NodeError, _Base); - - function NodeError(arg1, arg2, arg3) { - return _Base.call(this, getMessage(arg1, arg2, arg3)) || this; - } - - return NodeError; - }(Base); - - NodeError.prototype.name = Base.name; - NodeError.prototype.code = code; - codes[code] = NodeError; -} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js - - -function oneOf(expected, thing) { - if (Array.isArray(expected)) { - var len = expected.length; - expected = expected.map(function (i) { - return String(i); - }); - - if (len > 2) { - return "one of ".concat(thing, " ").concat(expected.slice(0, len - 1).join(', '), ", or ") + expected[len - 1]; - } else if (len === 2) { - return "one of ".concat(thing, " ").concat(expected[0], " or ").concat(expected[1]); - } else { - return "of ".concat(thing, " ").concat(expected[0]); - } - } else { - return "of ".concat(thing, " ").concat(String(expected)); - } -} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith - - -function startsWith(str, search, pos) { - return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search; -} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith - - -function endsWith(str, search, this_len) { - if (this_len === undefined || this_len > str.length) { - this_len = str.length; - } - - return str.substring(this_len - search.length, this_len) === search; -} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes - - -function includes(str, search, start) { - if (typeof start !== 'number') { - start = 0; - } - - if (start + search.length > str.length) { - return false; - } else { - return str.indexOf(search, start) !== -1; - } -} - -createErrorType('ERR_INVALID_OPT_VALUE', function (name, value) { - return 'The value "' + value + '" is invalid for option "' + name + '"'; -}, TypeError); -createErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) { - // determiner: 'must be' or 'must not be' - var determiner; - - if (typeof expected === 'string' && startsWith(expected, 'not ')) { - determiner = 'must not be'; - expected = expected.replace(/^not /, ''); - } else { - determiner = 'must be'; - } - - var msg; - - if (endsWith(name, ' argument')) { - // For cases like 'first argument' - msg = "The ".concat(name, " ").concat(determiner, " ").concat(oneOf(expected, 'type')); - } else { - var type = includes(name, '.') ? 'property' : 'argument'; - msg = "The \"".concat(name, "\" ").concat(type, " ").concat(determiner, " ").concat(oneOf(expected, 'type')); - } - - msg += ". Received type ".concat(typeof actual); - return msg; -}, TypeError); -createErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF'); -createErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) { - return 'The ' + name + ' method is not implemented'; -}); -createErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close'); -createErrorType('ERR_STREAM_DESTROYED', function (name) { - return 'Cannot call ' + name + ' after a stream was destroyed'; -}); -createErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times'); -createErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable'); -createErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end'); -createErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError); -createErrorType('ERR_UNKNOWN_ENCODING', function (arg) { - return 'Unknown encoding: ' + arg; -}, TypeError); -createErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event'); -module.exports.codes = codes; - - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/_stream_duplex.js": -/*!************************************************************!*\ - !*** ./node_modules/readable-stream/lib/_stream_duplex.js ***! - \************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. -// a duplex stream is just a stream that is both readable and writable. -// Since JS doesn't have multiple prototypal inheritance, this class -// prototypally inherits from Readable, and then parasitically from -// Writable. - -/**/ - -var objectKeys = Object.keys || function (obj) { - var keys = []; - - for (var key in obj) { - keys.push(key); - } - - return keys; -}; -/**/ - - -module.exports = Duplex; - -var Readable = __webpack_require__(/*! ./_stream_readable */ "./node_modules/readable-stream/lib/_stream_readable.js"); - -var Writable = __webpack_require__(/*! ./_stream_writable */ "./node_modules/readable-stream/lib/_stream_writable.js"); - -__webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js")(Duplex, Readable); - -{ - // Allow the keys array to be GC'ed. - var keys = objectKeys(Writable.prototype); - - for (var v = 0; v < keys.length; v++) { - var method = keys[v]; - if (!Duplex.prototype[method]) Duplex.prototype[method] = Writable.prototype[method]; - } -} - -function Duplex(options) { - if (!(this instanceof Duplex)) return new Duplex(options); - Readable.call(this, options); - Writable.call(this, options); - this.allowHalfOpen = true; - - if (options) { - if (options.readable === false) this.readable = false; - if (options.writable === false) this.writable = false; - - if (options.allowHalfOpen === false) { - this.allowHalfOpen = false; - this.once('end', onend); - } - } -} - -Object.defineProperty(Duplex.prototype, 'writableHighWaterMark', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState.highWaterMark; - } -}); -Object.defineProperty(Duplex.prototype, 'writableBuffer', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState && this._writableState.getBuffer(); - } -}); -Object.defineProperty(Duplex.prototype, 'writableLength', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState.length; - } -}); // the no-half-open enforcer - -function onend() { - // If the writable side ended, then we're ok. - if (this._writableState.ended) return; // no more data can be written. - // But allow more writes to happen in this tick. - - process.nextTick(onEndNT, this); -} - -function onEndNT(self) { - self.end(); -} - -Object.defineProperty(Duplex.prototype, 'destroyed', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - if (this._readableState === undefined || this._writableState === undefined) { - return false; - } - - return this._readableState.destroyed && this._writableState.destroyed; - }, - set: function set(value) { - // we ignore the value if the stream - // has not been initialized yet - if (this._readableState === undefined || this._writableState === undefined) { - return; - } // backward compatibility, the user is explicitly - // managing destroyed - - - this._readableState.destroyed = value; - this._writableState.destroyed = value; - } -}); - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/_stream_passthrough.js": -/*!*****************************************************************!*\ - !*** ./node_modules/readable-stream/lib/_stream_passthrough.js ***! - \*****************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. -// a passthrough stream. -// basically just the most minimal sort of Transform stream. -// Every written chunk gets output as-is. - - -module.exports = PassThrough; - -var Transform = __webpack_require__(/*! ./_stream_transform */ "./node_modules/readable-stream/lib/_stream_transform.js"); - -__webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js")(PassThrough, Transform); - -function PassThrough(options) { - if (!(this instanceof PassThrough)) return new PassThrough(options); - Transform.call(this, options); -} - -PassThrough.prototype._transform = function (chunk, encoding, cb) { - cb(null, chunk); -}; - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/_stream_readable.js": -/*!**************************************************************!*\ - !*** ./node_modules/readable-stream/lib/_stream_readable.js ***! - \**************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - -module.exports = Readable; -/**/ - -var Duplex; -/**/ - -Readable.ReadableState = ReadableState; -/**/ - -var EE = __webpack_require__(/*! events */ "./node_modules/events/events.js").EventEmitter; - -var EElistenerCount = function EElistenerCount(emitter, type) { - return emitter.listeners(type).length; -}; -/**/ - -/**/ - - -var Stream = __webpack_require__(/*! ./internal/streams/stream */ "./node_modules/readable-stream/lib/internal/streams/stream-browser.js"); -/**/ - - -var Buffer = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js").Buffer; - -var OurUint8Array = __webpack_require__.g.Uint8Array || function () {}; - -function _uint8ArrayToBuffer(chunk) { - return Buffer.from(chunk); -} - -function _isUint8Array(obj) { - return Buffer.isBuffer(obj) || obj instanceof OurUint8Array; -} -/**/ - - -var debugUtil = __webpack_require__(/*! util */ "?d17e"); - -var debug; - -if (debugUtil && debugUtil.debuglog) { - debug = debugUtil.debuglog('stream'); -} else { - debug = function debug() {}; -} -/**/ - - -var BufferList = __webpack_require__(/*! ./internal/streams/buffer_list */ "./node_modules/readable-stream/lib/internal/streams/buffer_list.js"); - -var destroyImpl = __webpack_require__(/*! ./internal/streams/destroy */ "./node_modules/readable-stream/lib/internal/streams/destroy.js"); - -var _require = __webpack_require__(/*! ./internal/streams/state */ "./node_modules/readable-stream/lib/internal/streams/state.js"), - getHighWaterMark = _require.getHighWaterMark; - -var _require$codes = __webpack_require__(/*! ../errors */ "./node_modules/readable-stream/errors-browser.js").codes, - ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE, - ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF, - ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, - ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT; // Lazy loaded to improve the startup performance. - - -var StringDecoder; -var createReadableStreamAsyncIterator; -var from; - -__webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js")(Readable, Stream); - -var errorOrDestroy = destroyImpl.errorOrDestroy; -var kProxyEvents = ['error', 'close', 'destroy', 'pause', 'resume']; - -function prependListener(emitter, event, fn) { - // Sadly this is not cacheable as some libraries bundle their own - // event emitter implementation with them. - 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 - // userland ones. NEVER DO THIS. This is here only because this code needs - // to continue to work with older versions of Node.js that do not include - // the prependListener() method. The goal is to eventually remove this hack. - - if (!emitter._events || !emitter._events[event]) emitter.on(event, fn);else if (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]]; -} - -function ReadableState(options, stream, isDuplex) { - Duplex = Duplex || __webpack_require__(/*! ./_stream_duplex */ "./node_modules/readable-stream/lib/_stream_duplex.js"); - options = options || {}; // Duplex streams are both readable and writable, but share - // the same options object. - // However, some cases require setting options to different - // values for the readable and the writable sides of the duplex stream. - // These options can be provided separately as readableXXX and writableXXX. - - if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; // object stream flag. Used to make read(n) ignore n and to - // make all the buffer merging and length checks go away - - this.objectMode = !!options.objectMode; - if (isDuplex) this.objectMode = this.objectMode || !!options.readableObjectMode; // the point at which it stops calling _read() to fill the buffer - // Note: 0 is a valid value, means "don't call _read preemptively ever" - - this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex); // A linked list is used to store data chunks instead of an array because the - // linked list can remove elements from the beginning faster than - // array.shift() - - this.buffer = new BufferList(); - this.length = 0; - this.pipes = null; - this.pipesCount = 0; - this.flowing = null; - this.ended = false; - this.endEmitted = false; - this.reading = false; // a flag to be able to tell if the event 'readable'/'data' is emitted - // immediately, or on a later tick. We set this to true at first, because - // any actions that shouldn't happen until "later" should generally also - // not happen before the first read call. - - this.sync = true; // whenever we return null, then we set a flag to say - // that we're awaiting a 'readable' event emission. - - this.needReadable = false; - this.emittedReadable = false; - this.readableListening = false; - this.resumeScheduled = false; - this.paused = true; // Should close be emitted on destroy. Defaults to true. - - this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'end' (and potentially 'finish') - - this.autoDestroy = !!options.autoDestroy; // has it been destroyed - - this.destroyed = false; // Crypto is kind of old and crusty. Historically, its default string - // encoding is 'binary' so we have to make this configurable. - // Everything else in the universe uses 'utf8', though. - - this.defaultEncoding = options.defaultEncoding || 'utf8'; // the number of writers that are awaiting a drain event in .pipe()s - - this.awaitDrain = 0; // if true, a maybeReadMore has been scheduled - - this.readingMore = false; - this.decoder = null; - this.encoding = null; - - if (options.encoding) { - if (!StringDecoder) StringDecoder = __webpack_require__(/*! string_decoder/ */ "./node_modules/string_decoder/lib/string_decoder.js").StringDecoder; - this.decoder = new StringDecoder(options.encoding); - this.encoding = options.encoding; - } -} - -function Readable(options) { - Duplex = Duplex || __webpack_require__(/*! ./_stream_duplex */ "./node_modules/readable-stream/lib/_stream_duplex.js"); - if (!(this instanceof Readable)) return new Readable(options); // Checking for a Stream.Duplex instance is faster here instead of inside - // the ReadableState constructor, at least with V8 6.5 - - var isDuplex = this instanceof Duplex; - this._readableState = new ReadableState(options, this, isDuplex); // legacy - - this.readable = true; - - if (options) { - if (typeof options.read === 'function') this._read = options.read; - if (typeof options.destroy === 'function') this._destroy = options.destroy; - } - - Stream.call(this); -} - -Object.defineProperty(Readable.prototype, 'destroyed', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - if (this._readableState === undefined) { - return false; - } - - return this._readableState.destroyed; - }, - set: function set(value) { - // we ignore the value if the stream - // has not been initialized yet - if (!this._readableState) { - return; - } // backward compatibility, the user is explicitly - // managing destroyed - - - this._readableState.destroyed = value; - } -}); -Readable.prototype.destroy = destroyImpl.destroy; -Readable.prototype._undestroy = destroyImpl.undestroy; - -Readable.prototype._destroy = function (err, cb) { - cb(err); -}; // Manually shove something into the read() buffer. -// This returns true if the highWaterMark has not been hit yet, -// similar to how Writable.write() returns true if you should -// write() some more. - - -Readable.prototype.push = function (chunk, encoding) { - var state = this._readableState; - var skipChunkCheck; - - if (!state.objectMode) { - if (typeof chunk === 'string') { - encoding = encoding || state.defaultEncoding; - - if (encoding !== state.encoding) { - chunk = Buffer.from(chunk, encoding); - encoding = ''; - } - - skipChunkCheck = true; - } - } else { - skipChunkCheck = true; - } - - return readableAddChunk(this, chunk, encoding, false, skipChunkCheck); -}; // Unshift should *always* be something directly out of read() - - -Readable.prototype.unshift = function (chunk) { - return readableAddChunk(this, chunk, null, true, false); -}; - -function readableAddChunk(stream, chunk, encoding, addToFront, skipChunkCheck) { - debug('readableAddChunk', chunk); - var state = stream._readableState; - - if (chunk === null) { - state.reading = false; - onEofChunk(stream, state); - } else { - var er; - if (!skipChunkCheck) er = chunkInvalid(state, chunk); - - if (er) { - errorOrDestroy(stream, er); - } else if (state.objectMode || chunk && chunk.length > 0) { - if (typeof chunk !== 'string' && !state.objectMode && Object.getPrototypeOf(chunk) !== Buffer.prototype) { - chunk = _uint8ArrayToBuffer(chunk); - } - - if (addToFront) { - if (state.endEmitted) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true); - } else if (state.ended) { - errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF()); - } else if (state.destroyed) { - return false; - } else { - state.reading = false; - - if (state.decoder && !encoding) { - chunk = state.decoder.write(chunk); - if (state.objectMode || chunk.length !== 0) addChunk(stream, state, chunk, false);else maybeReadMore(stream, state); - } else { - addChunk(stream, state, chunk, false); - } - } - } else if (!addToFront) { - state.reading = false; - maybeReadMore(stream, state); - } - } // We can push more data if we are below the highWaterMark. - // Also, if we have no data yet, we can stand some more bytes. - // This is to work around cases where hwm=0, such as the repl. - - - return !state.ended && (state.length < state.highWaterMark || state.length === 0); -} - -function addChunk(stream, state, chunk, addToFront) { - if (state.flowing && state.length === 0 && !state.sync) { - state.awaitDrain = 0; - stream.emit('data', chunk); - } else { - // update the buffer info. - state.length += state.objectMode ? 1 : chunk.length; - if (addToFront) state.buffer.unshift(chunk);else state.buffer.push(chunk); - if (state.needReadable) emitReadable(stream); - } - - maybeReadMore(stream, state); -} - -function chunkInvalid(state, chunk) { - var er; - - if (!_isUint8Array(chunk) && typeof chunk !== 'string' && chunk !== undefined && !state.objectMode) { - er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk); - } - - return er; -} - -Readable.prototype.isPaused = function () { - return this._readableState.flowing === false; -}; // backwards compatibility. - - -Readable.prototype.setEncoding = function (enc) { - if (!StringDecoder) StringDecoder = __webpack_require__(/*! string_decoder/ */ "./node_modules/string_decoder/lib/string_decoder.js").StringDecoder; - var decoder = new StringDecoder(enc); - this._readableState.decoder = decoder; // If setEncoding(null), decoder.encoding equals utf8 - - this._readableState.encoding = this._readableState.decoder.encoding; // Iterate over current buffer to convert already stored Buffers: - - var p = this._readableState.buffer.head; - var content = ''; - - while (p !== null) { - content += decoder.write(p.data); - p = p.next; - } - - this._readableState.buffer.clear(); - - if (content !== '') this._readableState.buffer.push(content); - this._readableState.length = content.length; - return this; -}; // Don't raise the hwm > 1GB - - -var MAX_HWM = 0x40000000; - -function computeNewHighWaterMark(n) { - if (n >= MAX_HWM) { - // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE. - n = MAX_HWM; - } else { - // Get the next highest power of 2 to prevent increasing hwm excessively in - // tiny amounts - n--; - n |= n >>> 1; - n |= n >>> 2; - n |= n >>> 4; - n |= n >>> 8; - n |= n >>> 16; - n++; - } - - return n; -} // This function is designed to be inlinable, so please take care when making -// changes to the function body. - - -function howMuchToRead(n, state) { - if (n <= 0 || state.length === 0 && state.ended) return 0; - if (state.objectMode) return 1; - - if (n !== n) { - // Only flow one buffer at a time - if (state.flowing && state.length) return state.buffer.head.data.length;else return state.length; - } // If we're asking for more than the current hwm, then raise the hwm. - - - if (n > state.highWaterMark) state.highWaterMark = computeNewHighWaterMark(n); - if (n <= state.length) return n; // Don't have enough - - if (!state.ended) { - state.needReadable = true; - return 0; - } - - return state.length; -} // you can override either this method, or the async _read(n) below. - - -Readable.prototype.read = function (n) { - debug('read', n); - n = parseInt(n, 10); - var state = this._readableState; - var nOrig = n; - if (n !== 0) state.emittedReadable = false; // if we're doing read(0) to trigger a readable event, but we - // already have a bunch of data in the buffer, then just trigger - // the 'readable' event and move on. - - if (n === 0 && state.needReadable && ((state.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || state.ended)) { - debug('read: emitReadable', state.length, state.ended); - if (state.length === 0 && state.ended) endReadable(this);else emitReadable(this); - return null; - } - - n = howMuchToRead(n, state); // if we've ended, and we're now clear, then finish it up. - - if (n === 0 && state.ended) { - if (state.length === 0) endReadable(this); - return null; - } // All the actual chunk generation logic needs to be - // *below* the call to _read. The reason is that in certain - // synthetic stream cases, such as passthrough streams, _read - // may be a completely synchronous operation which may change - // the state of the read buffer, providing enough data when - // before there was *not* enough. - // - // So, the steps are: - // 1. Figure out what the state of things will be after we do - // a read from the buffer. - // - // 2. If that resulting state will trigger a _read, then call _read. - // Note that this may be asynchronous, or synchronous. Yes, it is - // deeply ugly to write APIs this way, but that still doesn't mean - // that the Readable class should behave improperly, as streams are - // designed to be sync/async agnostic. - // Take note if the _read call is sync or async (ie, if the read call - // has returned yet), so that we know whether or not it's safe to emit - // 'readable' etc. - // - // 3. Actually pull the requested chunks out of the buffer and return. - // if we need a readable event, then we need to do some reading. - - - var doRead = state.needReadable; - debug('need readable', doRead); // if we currently have less than the highWaterMark, then also read some - - if (state.length === 0 || state.length - n < state.highWaterMark) { - doRead = true; - debug('length less than watermark', doRead); - } // however, if we've ended, then there's no point, and if we're already - // reading, then it's unnecessary. - - - if (state.ended || state.reading) { - doRead = false; - debug('reading or ended', doRead); - } else if (doRead) { - debug('do read'); - state.reading = true; - state.sync = true; // if the length is currently zero, then we *need* a readable event. - - if (state.length === 0) state.needReadable = true; // call internal read method - - this._read(state.highWaterMark); - - state.sync = false; // If _read pushed data synchronously, then `reading` will be false, - // and we need to re-evaluate how much data we can return to the user. - - if (!state.reading) n = howMuchToRead(nOrig, state); - } - - var ret; - if (n > 0) ret = fromList(n, state);else ret = null; - - if (ret === null) { - state.needReadable = state.length <= state.highWaterMark; - n = 0; - } else { - state.length -= n; - state.awaitDrain = 0; - } - - if (state.length === 0) { - // If we have nothing in the buffer, then we want to know - // as soon as we *do* get something into the buffer. - if (!state.ended) state.needReadable = true; // If we tried to read() past the EOF, then emit end on the next tick. - - if (nOrig !== n && state.ended) endReadable(this); - } - - if (ret !== null) this.emit('data', ret); - return ret; -}; - -function onEofChunk(stream, state) { - debug('onEofChunk'); - if (state.ended) return; - - if (state.decoder) { - var chunk = state.decoder.end(); - - if (chunk && chunk.length) { - state.buffer.push(chunk); - state.length += state.objectMode ? 1 : chunk.length; - } - } - - state.ended = true; - - if (state.sync) { - // if we are sync, wait until next tick to emit the data. - // Otherwise we risk emitting data in the flow() - // the readable code triggers during a read() call - emitReadable(stream); - } else { - // emit 'readable' now to make sure it gets picked up. - state.needReadable = false; - - if (!state.emittedReadable) { - state.emittedReadable = true; - emitReadable_(stream); - } - } -} // Don't emit readable right away in sync mode, because this can trigger -// another read() call => stack overflow. This way, it might trigger -// a nextTick recursion warning, but that's not so bad. - - -function emitReadable(stream) { - var state = stream._readableState; - debug('emitReadable', state.needReadable, state.emittedReadable); - state.needReadable = false; - - if (!state.emittedReadable) { - debug('emitReadable', state.flowing); - state.emittedReadable = true; - process.nextTick(emitReadable_, stream); - } -} - -function emitReadable_(stream) { - var state = stream._readableState; - debug('emitReadable_', state.destroyed, state.length, state.ended); - - if (!state.destroyed && (state.length || state.ended)) { - stream.emit('readable'); - state.emittedReadable = false; - } // The stream needs another readable event if - // 1. It is not flowing, as the flow mechanism will take - // care of it. - // 2. It is not ended. - // 3. It is below the highWaterMark, so we can schedule - // another readable later. - - - state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark; - flow(stream); -} // at this point, the user has presumably seen the 'readable' event, -// and called read() to consume some data. that may have triggered -// in turn another _read(n) call, in which case reading = true if -// it's in progress. -// However, if we're not ended, or reading, and the length < hwm, -// then go ahead and try to read some more preemptively. - - -function maybeReadMore(stream, state) { - if (!state.readingMore) { - state.readingMore = true; - process.nextTick(maybeReadMore_, stream, state); - } -} - -function maybeReadMore_(stream, state) { - // Attempt to read more data if we should. - // - // The conditions for reading more data are (one of): - // - Not enough data buffered (state.length < state.highWaterMark). The loop - // is responsible for filling the buffer with enough data if such data - // is available. If highWaterMark is 0 and we are not in the flowing mode - // we should _not_ attempt to buffer any extra data. We'll get more data - // when the stream consumer calls read() instead. - // - No data in the buffer, and the stream is in flowing mode. In this mode - // the loop below is responsible for ensuring read() is called. Failing to - // call read here would abort the flow and there's no other mechanism for - // continuing the flow if the stream consumer has just subscribed to the - // 'data' event. - // - // In addition to the above conditions to keep reading data, the following - // conditions prevent the data from being read: - // - The stream has ended (state.ended). - // - There is already a pending 'read' operation (state.reading). This is a - // case where the the stream has called the implementation defined _read() - // method, but they are processing the call asynchronously and have _not_ - // called push() with new data. In this case we skip performing more - // read()s. The execution ends in this method again after the _read() ends - // up calling push() with more data. - while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) { - var len = state.length; - debug('maybeReadMore read 0'); - stream.read(0); - if (len === state.length) // didn't get any data, stop spinning. - break; - } - - state.readingMore = false; -} // abstract method. to be overridden in specific implementation classes. -// call cb(er, data) where data is <= n in length. -// for virtual (non-string, non-buffer) streams, "length" is somewhat -// arbitrary, and perhaps not very meaningful. - - -Readable.prototype._read = function (n) { - errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()')); -}; - -Readable.prototype.pipe = function (dest, pipeOpts) { - var src = this; - var state = this._readableState; - - switch (state.pipesCount) { - case 0: - state.pipes = dest; - break; - - case 1: - state.pipes = [state.pipes, dest]; - break; - - default: - state.pipes.push(dest); - break; - } - - state.pipesCount += 1; - debug('pipe count=%d opts=%j', state.pipesCount, pipeOpts); - var doEnd = (!pipeOpts || pipeOpts.end !== false) && dest !== process.stdout && dest !== process.stderr; - var endFn = doEnd ? onend : unpipe; - if (state.endEmitted) process.nextTick(endFn);else src.once('end', endFn); - dest.on('unpipe', onunpipe); - - function onunpipe(readable, unpipeInfo) { - debug('onunpipe'); - - if (readable === src) { - if (unpipeInfo && unpipeInfo.hasUnpiped === false) { - unpipeInfo.hasUnpiped = true; - cleanup(); - } - } - } - - function onend() { - debug('onend'); - dest.end(); - } // when the dest drains, it reduces the awaitDrain counter - // on the source. This would be more elegant with a .once() - // handler in flow(), but adding and removing repeatedly is - // too slow. - - - var ondrain = pipeOnDrain(src); - dest.on('drain', ondrain); - var cleanedUp = false; - - function cleanup() { - debug('cleanup'); // cleanup event handlers once the pipe is broken - - dest.removeListener('close', onclose); - dest.removeListener('finish', onfinish); - dest.removeListener('drain', ondrain); - dest.removeListener('error', onerror); - dest.removeListener('unpipe', onunpipe); - src.removeListener('end', onend); - src.removeListener('end', unpipe); - src.removeListener('data', ondata); - cleanedUp = true; // if the reader is waiting for a drain event from this - // specific writer, then it would cause it to never start - // flowing again. - // So, if this is awaiting a drain, then we just call it now. - // If we don't know, then assume that we are waiting for one. - - if (state.awaitDrain && (!dest._writableState || dest._writableState.needDrain)) ondrain(); - } - - src.on('data', ondata); - - function ondata(chunk) { - debug('ondata'); - var ret = dest.write(chunk); - debug('dest.write', ret); - - if (ret === false) { - // If the user unpiped during `dest.write()`, it is possible - // to get stuck in a permanently paused state if that write - // also returned false. - // => Check whether `dest` is still a piping destination. - if ((state.pipesCount === 1 && state.pipes === dest || state.pipesCount > 1 && indexOf(state.pipes, dest) !== -1) && !cleanedUp) { - debug('false write response, pause', state.awaitDrain); - state.awaitDrain++; - } - - src.pause(); - } - } // if the dest has an error, then stop piping into it. - // however, don't suppress the throwing behavior for this. - - - function onerror(er) { - debug('onerror', er); - unpipe(); - dest.removeListener('error', onerror); - if (EElistenerCount(dest, 'error') === 0) errorOrDestroy(dest, er); - } // Make sure our error handler is attached before userland ones. - - - prependListener(dest, 'error', onerror); // Both close and finish should trigger unpipe, but only once. - - function onclose() { - dest.removeListener('finish', onfinish); - unpipe(); - } - - dest.once('close', onclose); - - function onfinish() { - debug('onfinish'); - dest.removeListener('close', onclose); - unpipe(); - } - - dest.once('finish', onfinish); - - function unpipe() { - debug('unpipe'); - src.unpipe(dest); - } // tell the dest that it's being piped to - - - dest.emit('pipe', src); // start the flow if it hasn't been started already. - - if (!state.flowing) { - debug('pipe resume'); - src.resume(); - } - - return dest; -}; - -function pipeOnDrain(src) { - return function pipeOnDrainFunctionResult() { - var state = src._readableState; - debug('pipeOnDrain', state.awaitDrain); - if (state.awaitDrain) state.awaitDrain--; - - if (state.awaitDrain === 0 && EElistenerCount(src, 'data')) { - state.flowing = true; - flow(src); - } - }; -} - -Readable.prototype.unpipe = function (dest) { - var state = this._readableState; - var unpipeInfo = { - hasUnpiped: false - }; // if we're not piping anywhere, then do nothing. - - if (state.pipesCount === 0) return this; // just one destination. most common case. - - if (state.pipesCount === 1) { - // passed in one, but it's not the right one. - if (dest && dest !== state.pipes) return this; - if (!dest) dest = state.pipes; // got a match. - - state.pipes = null; - state.pipesCount = 0; - state.flowing = false; - if (dest) dest.emit('unpipe', this, unpipeInfo); - return this; - } // slow case. multiple pipe destinations. - - - if (!dest) { - // remove all. - var dests = state.pipes; - var len = state.pipesCount; - state.pipes = null; - state.pipesCount = 0; - state.flowing = false; - - for (var i = 0; i < len; i++) { - dests[i].emit('unpipe', this, { - hasUnpiped: false - }); - } - - return this; - } // try to find the right one. - - - var index = indexOf(state.pipes, dest); - if (index === -1) return this; - state.pipes.splice(index, 1); - state.pipesCount -= 1; - if (state.pipesCount === 1) state.pipes = state.pipes[0]; - dest.emit('unpipe', this, unpipeInfo); - return this; -}; // set up data events if they are asked for -// Ensure readable listeners eventually get something - - -Readable.prototype.on = function (ev, fn) { - var res = Stream.prototype.on.call(this, ev, fn); - var state = this._readableState; - - if (ev === 'data') { - // update readableListening so that resume() may be a no-op - // a few lines down. This is needed to support once('readable'). - state.readableListening = this.listenerCount('readable') > 0; // Try start flowing on next tick if stream isn't explicitly paused - - if (state.flowing !== false) this.resume(); - } else if (ev === 'readable') { - if (!state.endEmitted && !state.readableListening) { - state.readableListening = state.needReadable = true; - state.flowing = false; - state.emittedReadable = false; - debug('on readable', state.length, state.reading); - - if (state.length) { - emitReadable(this); - } else if (!state.reading) { - process.nextTick(nReadingNextTick, this); - } - } - } - - return res; -}; - -Readable.prototype.addListener = Readable.prototype.on; - -Readable.prototype.removeListener = function (ev, fn) { - var res = Stream.prototype.removeListener.call(this, ev, fn); - - if (ev === 'readable') { - // We need to check if there is someone still listening to - // readable and reset the state. However this needs to happen - // after readable has been emitted but before I/O (nextTick) to - // support once('readable', fn) cycles. This means that calling - // resume within the same tick will have no - // effect. - process.nextTick(updateReadableListening, this); - } - - return res; -}; - -Readable.prototype.removeAllListeners = function (ev) { - var res = Stream.prototype.removeAllListeners.apply(this, arguments); - - if (ev === 'readable' || ev === undefined) { - // We need to check if there is someone still listening to - // readable and reset the state. However this needs to happen - // after readable has been emitted but before I/O (nextTick) to - // support once('readable', fn) cycles. This means that calling - // resume within the same tick will have no - // effect. - process.nextTick(updateReadableListening, this); - } - - return res; -}; - -function updateReadableListening(self) { - var state = self._readableState; - state.readableListening = self.listenerCount('readable') > 0; - - if (state.resumeScheduled && !state.paused) { - // flowing needs to be set to true now, otherwise - // the upcoming resume will not flow. - state.flowing = true; // crude way to check if we should resume - } else if (self.listenerCount('data') > 0) { - self.resume(); - } -} - -function nReadingNextTick(self) { - debug('readable nexttick read 0'); - self.read(0); -} // pause() and resume() are remnants of the legacy readable stream API -// If the user uses them, then switch into old mode. - - -Readable.prototype.resume = function () { - var state = this._readableState; - - if (!state.flowing) { - debug('resume'); // we flow only if there is no one listening - // for readable, but we still have to call - // resume() - - state.flowing = !state.readableListening; - resume(this, state); - } - - state.paused = false; - return this; -}; - -function resume(stream, state) { - if (!state.resumeScheduled) { - state.resumeScheduled = true; - process.nextTick(resume_, stream, state); - } -} - -function resume_(stream, state) { - debug('resume', state.reading); - - if (!state.reading) { - stream.read(0); - } - - state.resumeScheduled = false; - stream.emit('resume'); - flow(stream); - if (state.flowing && !state.reading) stream.read(0); -} - -Readable.prototype.pause = function () { - debug('call pause flowing=%j', this._readableState.flowing); - - if (this._readableState.flowing !== false) { - debug('pause'); - this._readableState.flowing = false; - this.emit('pause'); - } - - this._readableState.paused = true; - return this; -}; - -function flow(stream) { - var state = stream._readableState; - debug('flow', state.flowing); - - while (state.flowing && stream.read() !== null) { - ; - } -} // wrap an old-style stream as the async data source. -// This is *not* part of the readable stream interface. -// It is an ugly unfortunate mess of history. - - -Readable.prototype.wrap = function (stream) { - var _this = this; - - var state = this._readableState; - var paused = false; - stream.on('end', function () { - debug('wrapped end'); - - if (state.decoder && !state.ended) { - var chunk = state.decoder.end(); - if (chunk && chunk.length) _this.push(chunk); - } - - _this.push(null); - }); - stream.on('data', function (chunk) { - debug('wrapped data'); - if (state.decoder) chunk = state.decoder.write(chunk); // don't skip over falsy values in objectMode - - if (state.objectMode && (chunk === null || chunk === undefined)) return;else if (!state.objectMode && (!chunk || !chunk.length)) return; - - var ret = _this.push(chunk); - - if (!ret) { - paused = true; - stream.pause(); - } - }); // proxy all the other methods. - // important when wrapping filters and duplexes. - - for (var i in stream) { - if (this[i] === undefined && typeof stream[i] === 'function') { - this[i] = function methodWrap(method) { - return function methodWrapReturnFunction() { - return stream[method].apply(stream, arguments); - }; - }(i); - } - } // proxy certain important events. - - - for (var n = 0; n < kProxyEvents.length; n++) { - stream.on(kProxyEvents[n], this.emit.bind(this, kProxyEvents[n])); - } // when we try to consume some more bytes, simply unpause the - // underlying stream. - - - this._read = function (n) { - debug('wrapped _read', n); - - if (paused) { - paused = false; - stream.resume(); - } - }; - - return this; -}; - -if (typeof Symbol === 'function') { - Readable.prototype[Symbol.asyncIterator] = function () { - if (createReadableStreamAsyncIterator === undefined) { - createReadableStreamAsyncIterator = __webpack_require__(/*! ./internal/streams/async_iterator */ "./node_modules/readable-stream/lib/internal/streams/async_iterator.js"); - } - - return createReadableStreamAsyncIterator(this); - }; -} - -Object.defineProperty(Readable.prototype, 'readableHighWaterMark', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._readableState.highWaterMark; - } -}); -Object.defineProperty(Readable.prototype, 'readableBuffer', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._readableState && this._readableState.buffer; - } -}); -Object.defineProperty(Readable.prototype, 'readableFlowing', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._readableState.flowing; - }, - set: function set(state) { - if (this._readableState) { - this._readableState.flowing = state; - } - } -}); // exposed for testing purposes only. - -Readable._fromList = fromList; -Object.defineProperty(Readable.prototype, 'readableLength', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._readableState.length; - } -}); // Pluck off n bytes from an array of buffers. -// Length is the combined lengths of all the buffers in the list. -// This function is designed to be inlinable, so please take care when making -// changes to the function body. - -function fromList(n, state) { - // nothing buffered - if (state.length === 0) return null; - var ret; - if (state.objectMode) ret = state.buffer.shift();else if (!n || n >= state.length) { - // read it all, truncate the list - if (state.decoder) ret = state.buffer.join('');else if (state.buffer.length === 1) ret = state.buffer.first();else ret = state.buffer.concat(state.length); - state.buffer.clear(); - } else { - // read part of list - ret = state.buffer.consume(n, state.decoder); - } - return ret; -} - -function endReadable(stream) { - var state = stream._readableState; - debug('endReadable', state.endEmitted); - - if (!state.endEmitted) { - state.ended = true; - process.nextTick(endReadableNT, state, stream); - } -} - -function endReadableNT(state, stream) { - debug('endReadableNT', state.endEmitted, state.length); // Check that we didn't get one last unshift. - - if (!state.endEmitted && state.length === 0) { - state.endEmitted = true; - stream.readable = false; - stream.emit('end'); - - if (state.autoDestroy) { - // In case of duplex streams we need a way to detect - // if the writable side is ready for autoDestroy as well - var wState = stream._writableState; - - if (!wState || wState.autoDestroy && wState.finished) { - stream.destroy(); - } - } - } -} - -if (typeof Symbol === 'function') { - Readable.from = function (iterable, opts) { - if (from === undefined) { - from = __webpack_require__(/*! ./internal/streams/from */ "./node_modules/readable-stream/lib/internal/streams/from-browser.js"); - } - - return from(Readable, iterable, opts); - }; -} - -function indexOf(xs, x) { - for (var i = 0, l = xs.length; i < l; i++) { - if (xs[i] === x) return i; - } - - return -1; -} - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/_stream_transform.js": -/*!***************************************************************!*\ - !*** ./node_modules/readable-stream/lib/_stream_transform.js ***! - \***************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. -// a transform stream is a readable/writable stream where you do -// something with the data. Sometimes it's called a "filter", -// but that's not a great name for it, since that implies a thing where -// some bits pass through, and others are simply ignored. (That would -// be a valid example of a transform, of course.) -// -// While the output is causally related to the input, it's not a -// necessarily symmetric or synchronous transformation. For example, -// a zlib stream might take multiple plain-text writes(), and then -// emit a single compressed chunk some time in the future. -// -// Here's how this works: -// -// The Transform stream has all the aspects of the readable and writable -// stream classes. When you write(chunk), that calls _write(chunk,cb) -// internally, and returns false if there's a lot of pending writes -// buffered up. When you call read(), that calls _read(n) until -// there's enough pending readable data buffered up. -// -// In a transform stream, the written data is placed in a buffer. When -// _read(n) is called, it transforms the queued up data, calling the -// buffered _write cb's as it consumes chunks. If consuming a single -// written chunk would result in multiple output chunks, then the first -// outputted bit calls the readcb, and subsequent chunks just go into -// the read buffer, and will cause it to emit 'readable' if necessary. -// -// This way, back-pressure is actually determined by the reading side, -// since _read has to be called to start processing a new chunk. However, -// a pathological inflate type of transform can cause excessive buffering -// here. For example, imagine a stream where every byte of input is -// interpreted as an integer from 0-255, and then results in that many -// bytes of output. Writing the 4 bytes {ff,ff,ff,ff} would result in -// 1kb of data being output. In this case, you could write a very small -// amount of input, and end up with a very large amount of output. In -// such a pathological inflating mechanism, there'd be no way to tell -// the system to stop doing the transform. A single 4MB write could -// cause the system to run out of memory. -// -// However, even in such a pathological case, only a single written chunk -// would be consumed, and then the rest would wait (un-transformed) until -// the results of the previous transformed chunk were consumed. - - -module.exports = Transform; - -var _require$codes = __webpack_require__(/*! ../errors */ "./node_modules/readable-stream/errors-browser.js").codes, - ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, - ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK, - ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING, - ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0; - -var Duplex = __webpack_require__(/*! ./_stream_duplex */ "./node_modules/readable-stream/lib/_stream_duplex.js"); - -__webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js")(Transform, Duplex); - -function afterTransform(er, data) { - var ts = this._transformState; - ts.transforming = false; - var cb = ts.writecb; - - if (cb === null) { - return this.emit('error', new ERR_MULTIPLE_CALLBACK()); - } - - ts.writechunk = null; - ts.writecb = null; - if (data != null) // single equals check for both `null` and `undefined` - this.push(data); - cb(er); - var rs = this._readableState; - rs.reading = false; - - if (rs.needReadable || rs.length < rs.highWaterMark) { - this._read(rs.highWaterMark); - } -} - -function Transform(options) { - if (!(this instanceof Transform)) return new Transform(options); - Duplex.call(this, options); - this._transformState = { - afterTransform: afterTransform.bind(this), - needTransform: false, - transforming: false, - writecb: null, - writechunk: null, - writeencoding: null - }; // start out asking for a readable event once data is transformed. - - this._readableState.needReadable = true; // we have implemented the _read method, and done the other things - // that Readable wants before the first _read call, so unset the - // sync guard flag. - - this._readableState.sync = false; - - if (options) { - if (typeof options.transform === 'function') this._transform = options.transform; - if (typeof options.flush === 'function') this._flush = options.flush; - } // When the writable side finishes, then flush out anything remaining. - - - this.on('prefinish', prefinish); -} - -function prefinish() { - var _this = this; - - if (typeof this._flush === 'function' && !this._readableState.destroyed) { - this._flush(function (er, data) { - done(_this, er, data); - }); - } else { - done(this, null, null); - } -} - -Transform.prototype.push = function (chunk, encoding) { - this._transformState.needTransform = false; - return Duplex.prototype.push.call(this, chunk, encoding); -}; // This is the part where you do stuff! -// override this function in implementation classes. -// 'chunk' is an input chunk. -// -// Call `push(newChunk)` to pass along transformed output -// to the readable side. You may call 'push' zero or more times. -// -// Call `cb(err)` when you are done with this chunk. If you pass -// an error, then that'll put the hurt on the whole operation. If you -// never call cb(), then you'll never get another chunk. - - -Transform.prototype._transform = function (chunk, encoding, cb) { - cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()')); -}; - -Transform.prototype._write = function (chunk, encoding, cb) { - var ts = this._transformState; - ts.writecb = cb; - ts.writechunk = chunk; - ts.writeencoding = encoding; - - if (!ts.transforming) { - var rs = this._readableState; - if (ts.needTransform || rs.needReadable || rs.length < rs.highWaterMark) this._read(rs.highWaterMark); - } -}; // Doesn't matter what the args are here. -// _transform does all the work. -// That we got here means that the readable side wants more data. - - -Transform.prototype._read = function (n) { - var ts = this._transformState; - - if (ts.writechunk !== null && !ts.transforming) { - ts.transforming = true; - - this._transform(ts.writechunk, ts.writeencoding, ts.afterTransform); - } else { - // mark that we need a transform, so that any data that comes in - // will get processed, now that we've asked for it. - ts.needTransform = true; - } -}; - -Transform.prototype._destroy = function (err, cb) { - Duplex.prototype._destroy.call(this, err, function (err2) { - cb(err2); - }); -}; - -function done(stream, er, data) { - if (er) return stream.emit('error', er); - if (data != null) // single equals check for both `null` and `undefined` - stream.push(data); // TODO(BridgeAR): Write a test for these two error cases - // if there's nothing in the write buffer, then that means - // that nothing more will ever be provided - - if (stream._writableState.length) throw new ERR_TRANSFORM_WITH_LENGTH_0(); - if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING(); - return stream.push(null); -} - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/_stream_writable.js": -/*!**************************************************************!*\ - !*** ./node_modules/readable-stream/lib/_stream_writable.js ***! - \**************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. -// A bit simpler than readable streams. -// Implement an async ._write(chunk, encoding, cb), and it'll handle all -// the drain event emission and buffering. - - -module.exports = Writable; -/* */ - -function WriteReq(chunk, encoding, cb) { - this.chunk = chunk; - this.encoding = encoding; - this.callback = cb; - this.next = null; -} // It seems a linked list but it is not -// there will be only 2 of these for each stream - - -function CorkedRequest(state) { - var _this = this; - - this.next = null; - this.entry = null; - - this.finish = function () { - onCorkedFinish(_this, state); - }; -} -/* */ - -/**/ - - -var Duplex; -/**/ - -Writable.WritableState = WritableState; -/**/ - -var internalUtil = { - deprecate: __webpack_require__(/*! util-deprecate */ "./node_modules/util-deprecate/browser.js") -}; -/**/ - -/**/ - -var Stream = __webpack_require__(/*! ./internal/streams/stream */ "./node_modules/readable-stream/lib/internal/streams/stream-browser.js"); -/**/ - - -var Buffer = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js").Buffer; - -var OurUint8Array = __webpack_require__.g.Uint8Array || function () {}; - -function _uint8ArrayToBuffer(chunk) { - return Buffer.from(chunk); -} - -function _isUint8Array(obj) { - return Buffer.isBuffer(obj) || obj instanceof OurUint8Array; -} - -var destroyImpl = __webpack_require__(/*! ./internal/streams/destroy */ "./node_modules/readable-stream/lib/internal/streams/destroy.js"); - -var _require = __webpack_require__(/*! ./internal/streams/state */ "./node_modules/readable-stream/lib/internal/streams/state.js"), - getHighWaterMark = _require.getHighWaterMark; - -var _require$codes = __webpack_require__(/*! ../errors */ "./node_modules/readable-stream/errors-browser.js").codes, - ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE, - ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED, - ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK, - ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE, - ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED, - ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES, - ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END, - ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING; - -var errorOrDestroy = destroyImpl.errorOrDestroy; - -__webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js")(Writable, Stream); - -function nop() {} - -function WritableState(options, stream, isDuplex) { - Duplex = Duplex || __webpack_require__(/*! ./_stream_duplex */ "./node_modules/readable-stream/lib/_stream_duplex.js"); - options = options || {}; // Duplex streams are both readable and writable, but share - // the same options object. - // However, some cases require setting options to different - // values for the readable and the writable sides of the duplex stream, - // e.g. options.readableObjectMode vs. options.writableObjectMode, etc. - - if (typeof isDuplex !== 'boolean') isDuplex = stream instanceof Duplex; // object stream flag to indicate whether or not this stream - // contains buffers or objects. - - this.objectMode = !!options.objectMode; - if (isDuplex) this.objectMode = this.objectMode || !!options.writableObjectMode; // the point at which write() starts returning false - // Note: 0 is a valid value, means that we always return false if - // the entire buffer is not flushed immediately on write() - - this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex); // if _final has been called - - this.finalCalled = false; // drain event flag. - - this.needDrain = false; // at the start of calling end() - - this.ending = false; // when end() has been called, and returned - - this.ended = false; // when 'finish' is emitted - - this.finished = false; // has it been destroyed - - this.destroyed = false; // should we decode strings into buffers before passing to _write? - // this is here so that some node-core streams can optimize string - // handling at a lower level. - - var noDecode = options.decodeStrings === false; - this.decodeStrings = !noDecode; // Crypto is kind of old and crusty. Historically, its default string - // encoding is 'binary' so we have to make this configurable. - // Everything else in the universe uses 'utf8', though. - - this.defaultEncoding = options.defaultEncoding || 'utf8'; // not an actual buffer we keep track of, but a measurement - // of how much we're waiting to get pushed to some underlying - // socket or file. - - this.length = 0; // a flag to see when we're in the middle of a write. - - this.writing = false; // when true all writes will be buffered until .uncork() call - - this.corked = 0; // a flag to be able to tell if the onwrite cb is called immediately, - // or on a later tick. We set this to true at first, because any - // actions that shouldn't happen until "later" should generally also - // not happen before the first write call. - - this.sync = true; // a flag to know if we're processing previously buffered items, which - // may call the _write() callback in the same tick, so that we don't - // end up in an overlapped onwrite situation. - - this.bufferProcessing = false; // the callback that's passed to _write(chunk,cb) - - this.onwrite = function (er) { - onwrite(stream, er); - }; // the callback that the user supplies to write(chunk,encoding,cb) - - - this.writecb = null; // the amount that is being written when _write is called. - - this.writelen = 0; - this.bufferedRequest = null; - this.lastBufferedRequest = null; // number of pending user-supplied write callbacks - // this must be 0 before 'finish' can be emitted - - this.pendingcb = 0; // emit prefinish if the only thing we're waiting for is _write cbs - // This is relevant for synchronous Transform streams - - this.prefinished = false; // True if the error was already emitted and should not be thrown again - - this.errorEmitted = false; // Should close be emitted on destroy. Defaults to true. - - this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'finish' (and potentially 'end') - - this.autoDestroy = !!options.autoDestroy; // count buffered requests - - this.bufferedRequestCount = 0; // allocate the first CorkedRequest, there is always - // one allocated and free to use, and we maintain at most two - - this.corkedRequestsFree = new CorkedRequest(this); -} - -WritableState.prototype.getBuffer = function getBuffer() { - var current = this.bufferedRequest; - var out = []; - - while (current) { - out.push(current); - current = current.next; - } - - return out; -}; - -(function () { - try { - Object.defineProperty(WritableState.prototype, 'buffer', { - get: internalUtil.deprecate(function writableStateBufferGetter() { - return this.getBuffer(); - }, '_writableState.buffer is deprecated. Use _writableState.getBuffer ' + 'instead.', 'DEP0003') - }); - } catch (_) {} -})(); // Test _writableState for inheritance to account for Duplex streams, -// whose prototype chain only points to Readable. - - -var realHasInstance; - -if (typeof Symbol === 'function' && Symbol.hasInstance && typeof Function.prototype[Symbol.hasInstance] === 'function') { - realHasInstance = Function.prototype[Symbol.hasInstance]; - Object.defineProperty(Writable, Symbol.hasInstance, { - value: function value(object) { - if (realHasInstance.call(this, object)) return true; - if (this !== Writable) return false; - return object && object._writableState instanceof WritableState; - } - }); -} else { - realHasInstance = function realHasInstance(object) { - return object instanceof this; - }; -} - -function Writable(options) { - Duplex = Duplex || __webpack_require__(/*! ./_stream_duplex */ "./node_modules/readable-stream/lib/_stream_duplex.js"); // Writable ctor is applied to Duplexes, too. - // `realHasInstance` is necessary because using plain `instanceof` - // would return false, as no `_writableState` property is attached. - // Trying to use the custom `instanceof` for Writable here will also break the - // Node.js LazyTransform implementation, which has a non-trivial getter for - // `_writableState` that would lead to infinite recursion. - // Checking for a Stream.Duplex instance is faster here instead of inside - // the WritableState constructor, at least with V8 6.5 - - var isDuplex = this instanceof Duplex; - if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options); - this._writableState = new WritableState(options, this, isDuplex); // legacy. - - this.writable = true; - - if (options) { - if (typeof options.write === 'function') this._write = options.write; - if (typeof options.writev === 'function') this._writev = options.writev; - if (typeof options.destroy === 'function') this._destroy = options.destroy; - if (typeof options.final === 'function') this._final = options.final; - } - - Stream.call(this); -} // Otherwise people can pipe Writable streams, which is just wrong. - - -Writable.prototype.pipe = function () { - errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE()); -}; - -function writeAfterEnd(stream, cb) { - var er = new ERR_STREAM_WRITE_AFTER_END(); // TODO: defer error events consistently everywhere, not just the cb - - errorOrDestroy(stream, er); - process.nextTick(cb, er); -} // Checks that a user-supplied chunk is valid, especially for the particular -// mode the stream is in. Currently this means that `null` is never accepted -// and undefined/non-string values are only allowed in object mode. - - -function validChunk(stream, state, chunk, cb) { - var er; - - if (chunk === null) { - er = new ERR_STREAM_NULL_VALUES(); - } else if (typeof chunk !== 'string' && !state.objectMode) { - er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk); - } - - if (er) { - errorOrDestroy(stream, er); - process.nextTick(cb, er); - return false; - } - - return true; -} - -Writable.prototype.write = function (chunk, encoding, cb) { - var state = this._writableState; - var ret = false; - - var isBuf = !state.objectMode && _isUint8Array(chunk); - - if (isBuf && !Buffer.isBuffer(chunk)) { - chunk = _uint8ArrayToBuffer(chunk); - } - - if (typeof encoding === 'function') { - cb = encoding; - encoding = null; - } - - if (isBuf) encoding = 'buffer';else if (!encoding) encoding = state.defaultEncoding; - if (typeof cb !== 'function') cb = nop; - if (state.ending) writeAfterEnd(this, cb);else if (isBuf || validChunk(this, state, chunk, cb)) { - state.pendingcb++; - ret = writeOrBuffer(this, state, isBuf, chunk, encoding, cb); - } - return ret; -}; - -Writable.prototype.cork = function () { - this._writableState.corked++; -}; - -Writable.prototype.uncork = function () { - var state = this._writableState; - - if (state.corked) { - state.corked--; - if (!state.writing && !state.corked && !state.bufferProcessing && state.bufferedRequest) clearBuffer(this, state); - } -}; - -Writable.prototype.setDefaultEncoding = function setDefaultEncoding(encoding) { - // node::ParseEncoding() requires lower case. - if (typeof encoding === 'string') encoding = encoding.toLowerCase(); - if (!(['hex', 'utf8', 'utf-8', 'ascii', 'binary', 'base64', 'ucs2', 'ucs-2', 'utf16le', 'utf-16le', 'raw'].indexOf((encoding + '').toLowerCase()) > -1)) throw new ERR_UNKNOWN_ENCODING(encoding); - this._writableState.defaultEncoding = encoding; - return this; -}; - -Object.defineProperty(Writable.prototype, 'writableBuffer', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState && this._writableState.getBuffer(); - } -}); - -function decodeChunk(state, chunk, encoding) { - if (!state.objectMode && state.decodeStrings !== false && typeof chunk === 'string') { - chunk = Buffer.from(chunk, encoding); - } - - return chunk; -} - -Object.defineProperty(Writable.prototype, 'writableHighWaterMark', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState.highWaterMark; - } -}); // if we're already writing something, then just put this -// in the queue, and wait our turn. Otherwise, call _write -// If we return false, then we need a drain event, so set that flag. - -function writeOrBuffer(stream, state, isBuf, chunk, encoding, cb) { - if (!isBuf) { - var newChunk = decodeChunk(state, chunk, encoding); - - if (chunk !== newChunk) { - isBuf = true; - encoding = 'buffer'; - chunk = newChunk; - } - } - - var len = state.objectMode ? 1 : chunk.length; - state.length += len; - var ret = state.length < state.highWaterMark; // we must ensure that previous needDrain will not be reset to false. - - if (!ret) state.needDrain = true; - - if (state.writing || state.corked) { - var last = state.lastBufferedRequest; - state.lastBufferedRequest = { - chunk: chunk, - encoding: encoding, - isBuf: isBuf, - callback: cb, - next: null - }; - - if (last) { - last.next = state.lastBufferedRequest; - } else { - state.bufferedRequest = state.lastBufferedRequest; - } - - state.bufferedRequestCount += 1; - } else { - doWrite(stream, state, false, len, chunk, encoding, cb); - } - - return ret; -} - -function doWrite(stream, state, writev, len, chunk, encoding, cb) { - state.writelen = len; - state.writecb = cb; - state.writing = true; - state.sync = true; - if (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else if (writev) stream._writev(chunk, state.onwrite);else stream._write(chunk, encoding, state.onwrite); - state.sync = false; -} - -function onwriteError(stream, state, sync, er, cb) { - --state.pendingcb; - - if (sync) { - // defer the callback if we are being called synchronously - // to avoid piling up things on the stack - process.nextTick(cb, er); // this can emit finish, and it will always happen - // after error - - process.nextTick(finishMaybe, stream, state); - stream._writableState.errorEmitted = true; - errorOrDestroy(stream, er); - } else { - // the caller expect this to happen before if - // it is async - cb(er); - stream._writableState.errorEmitted = true; - errorOrDestroy(stream, er); // this can emit finish, but finish must - // always follow error - - finishMaybe(stream, state); - } -} - -function onwriteStateUpdate(state) { - state.writing = false; - state.writecb = null; - state.length -= state.writelen; - state.writelen = 0; -} - -function onwrite(stream, er) { - var state = stream._writableState; - var sync = state.sync; - var cb = state.writecb; - if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK(); - onwriteStateUpdate(state); - if (er) onwriteError(stream, state, sync, er, cb);else { - // Check if we're actually ready to finish, but don't emit yet - var finished = needFinish(state) || stream.destroyed; - - if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) { - clearBuffer(stream, state); - } - - if (sync) { - process.nextTick(afterWrite, stream, state, finished, cb); - } else { - afterWrite(stream, state, finished, cb); - } - } -} - -function afterWrite(stream, state, finished, cb) { - if (!finished) onwriteDrain(stream, state); - state.pendingcb--; - cb(); - finishMaybe(stream, state); -} // Must force callback to be called on nextTick, so that we don't -// emit 'drain' before the write() consumer gets the 'false' return -// value, and has a chance to attach a 'drain' listener. - - -function onwriteDrain(stream, state) { - if (state.length === 0 && state.needDrain) { - state.needDrain = false; - stream.emit('drain'); - } -} // if there's something in the buffer waiting, then process it - - -function clearBuffer(stream, state) { - state.bufferProcessing = true; - var entry = state.bufferedRequest; - - if (stream._writev && entry && entry.next) { - // Fast case, write everything using _writev() - var l = state.bufferedRequestCount; - var buffer = new Array(l); - var holder = state.corkedRequestsFree; - holder.entry = entry; - var count = 0; - var allBuffers = true; - - while (entry) { - buffer[count] = entry; - if (!entry.isBuf) allBuffers = false; - entry = entry.next; - count += 1; - } - - buffer.allBuffers = allBuffers; - doWrite(stream, state, true, state.length, buffer, '', holder.finish); // doWrite is almost always async, defer these to save a bit of time - // as the hot path ends with doWrite - - state.pendingcb++; - state.lastBufferedRequest = null; - - if (holder.next) { - state.corkedRequestsFree = holder.next; - holder.next = null; - } else { - state.corkedRequestsFree = new CorkedRequest(state); - } - - state.bufferedRequestCount = 0; - } else { - // Slow case, write chunks one-by-one - while (entry) { - var chunk = entry.chunk; - var encoding = entry.encoding; - var cb = entry.callback; - var len = state.objectMode ? 1 : chunk.length; - doWrite(stream, state, false, len, chunk, encoding, cb); - entry = entry.next; - state.bufferedRequestCount--; // if we didn't call the onwrite immediately, then - // it means that we need to wait until it does. - // also, that means that the chunk and cb are currently - // being processed, so move the buffer counter past them. - - if (state.writing) { - break; - } - } - - if (entry === null) state.lastBufferedRequest = null; - } - - state.bufferedRequest = entry; - state.bufferProcessing = false; -} - -Writable.prototype._write = function (chunk, encoding, cb) { - cb(new ERR_METHOD_NOT_IMPLEMENTED('_write()')); -}; - -Writable.prototype._writev = null; - -Writable.prototype.end = function (chunk, encoding, cb) { - var state = this._writableState; - - if (typeof chunk === 'function') { - cb = chunk; - chunk = null; - encoding = null; - } else if (typeof encoding === 'function') { - cb = encoding; - encoding = null; - } - - if (chunk !== null && chunk !== undefined) this.write(chunk, encoding); // .end() fully uncorks - - if (state.corked) { - state.corked = 1; - this.uncork(); - } // ignore unnecessary end() calls. - - - if (!state.ending) endWritable(this, state, cb); - return this; -}; - -Object.defineProperty(Writable.prototype, 'writableLength', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - return this._writableState.length; - } -}); - -function needFinish(state) { - return state.ending && state.length === 0 && state.bufferedRequest === null && !state.finished && !state.writing; -} - -function callFinal(stream, state) { - stream._final(function (err) { - state.pendingcb--; - - if (err) { - errorOrDestroy(stream, err); - } - - state.prefinished = true; - stream.emit('prefinish'); - finishMaybe(stream, state); - }); -} - -function prefinish(stream, state) { - if (!state.prefinished && !state.finalCalled) { - if (typeof stream._final === 'function' && !state.destroyed) { - state.pendingcb++; - state.finalCalled = true; - process.nextTick(callFinal, stream, state); - } else { - state.prefinished = true; - stream.emit('prefinish'); - } - } -} - -function finishMaybe(stream, state) { - var need = needFinish(state); - - if (need) { - prefinish(stream, state); - - if (state.pendingcb === 0) { - state.finished = true; - stream.emit('finish'); - - if (state.autoDestroy) { - // In case of duplex streams we need a way to detect - // if the readable side is ready for autoDestroy as well - var rState = stream._readableState; - - if (!rState || rState.autoDestroy && rState.endEmitted) { - stream.destroy(); - } - } - } - } - - return need; -} - -function endWritable(stream, state, cb) { - state.ending = true; - finishMaybe(stream, state); - - if (cb) { - if (state.finished) process.nextTick(cb);else stream.once('finish', cb); - } - - state.ended = true; - stream.writable = false; -} - -function onCorkedFinish(corkReq, state, err) { - var entry = corkReq.entry; - corkReq.entry = null; - - while (entry) { - var cb = entry.callback; - state.pendingcb--; - cb(err); - entry = entry.next; - } // reuse the free corkReq. - - - state.corkedRequestsFree.next = corkReq; -} - -Object.defineProperty(Writable.prototype, 'destroyed', { - // making it explicit this property is not enumerable - // because otherwise some prototype manipulation in - // userland will fail - enumerable: false, - get: function get() { - if (this._writableState === undefined) { - return false; - } - - return this._writableState.destroyed; - }, - set: function set(value) { - // we ignore the value if the stream - // has not been initialized yet - if (!this._writableState) { - return; - } // backward compatibility, the user is explicitly - // managing destroyed - - - this._writableState.destroyed = value; - } -}); -Writable.prototype.destroy = destroyImpl.destroy; -Writable.prototype._undestroy = destroyImpl.undestroy; - -Writable.prototype._destroy = function (err, cb) { - cb(err); -}; - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/internal/streams/async_iterator.js": -/*!*****************************************************************************!*\ - !*** ./node_modules/readable-stream/lib/internal/streams/async_iterator.js ***! - \*****************************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); - - -var _Object$setPrototypeO; - -function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } - -var finished = __webpack_require__(/*! ./end-of-stream */ "./node_modules/readable-stream/lib/internal/streams/end-of-stream.js"); - -var kLastResolve = Symbol('lastResolve'); -var kLastReject = Symbol('lastReject'); -var kError = Symbol('error'); -var kEnded = Symbol('ended'); -var kLastPromise = Symbol('lastPromise'); -var kHandlePromise = Symbol('handlePromise'); -var kStream = Symbol('stream'); - -function createIterResult(value, done) { - return { - value: value, - done: done - }; -} - -function readAndResolve(iter) { - var resolve = iter[kLastResolve]; - - if (resolve !== null) { - var data = iter[kStream].read(); // we defer if data is null - // we can be expecting either 'end' or - // 'error' - - if (data !== null) { - iter[kLastPromise] = null; - iter[kLastResolve] = null; - iter[kLastReject] = null; - resolve(createIterResult(data, false)); - } - } -} - -function onReadable(iter) { - // we wait for the next tick, because it might - // emit an error with process.nextTick - process.nextTick(readAndResolve, iter); -} - -function wrapForNext(lastPromise, iter) { - return function (resolve, reject) { - lastPromise.then(function () { - if (iter[kEnded]) { - resolve(createIterResult(undefined, true)); - return; - } - - iter[kHandlePromise](resolve, reject); - }, reject); - }; -} - -var AsyncIteratorPrototype = Object.getPrototypeOf(function () {}); -var ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = { - get stream() { - return this[kStream]; - }, - - next: function next() { - var _this = this; - - // if we have detected an error in the meanwhile - // reject straight away - var error = this[kError]; - - if (error !== null) { - return Promise.reject(error); - } - - if (this[kEnded]) { - return Promise.resolve(createIterResult(undefined, true)); - } - - if (this[kStream].destroyed) { - // We need to defer via nextTick because if .destroy(err) is - // called, the error will be emitted via nextTick, and - // we cannot guarantee that there is no error lingering around - // waiting to be emitted. - return new Promise(function (resolve, reject) { - process.nextTick(function () { - if (_this[kError]) { - reject(_this[kError]); - } else { - resolve(createIterResult(undefined, true)); - } - }); - }); - } // if we have multiple next() calls - // we will wait for the previous Promise to finish - // this logic is optimized to support for await loops, - // where next() is only called once at a time - - - var lastPromise = this[kLastPromise]; - var promise; - - if (lastPromise) { - promise = new Promise(wrapForNext(lastPromise, this)); - } else { - // fast path needed to support multiple this.push() - // without triggering the next() queue - var data = this[kStream].read(); - - if (data !== null) { - return Promise.resolve(createIterResult(data, false)); - } - - promise = new Promise(this[kHandlePromise]); - } - - this[kLastPromise] = promise; - return promise; - } -}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () { - return this; -}), _defineProperty(_Object$setPrototypeO, "return", function _return() { - var _this2 = this; - - // destroy(err, cb) is a private API - // we can guarantee we have that here, because we control the - // Readable class this is attached to - return new Promise(function (resolve, reject) { - _this2[kStream].destroy(null, function (err) { - if (err) { - reject(err); - return; - } - - resolve(createIterResult(undefined, true)); - }); - }); -}), _Object$setPrototypeO), AsyncIteratorPrototype); - -var createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) { - var _Object$create; - - var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, { - value: stream, - writable: true - }), _defineProperty(_Object$create, kLastResolve, { - value: null, - writable: true - }), _defineProperty(_Object$create, kLastReject, { - value: null, - writable: true - }), _defineProperty(_Object$create, kError, { - value: null, - writable: true - }), _defineProperty(_Object$create, kEnded, { - value: stream._readableState.endEmitted, - writable: true - }), _defineProperty(_Object$create, kHandlePromise, { - value: function value(resolve, reject) { - var data = iterator[kStream].read(); - - if (data) { - iterator[kLastPromise] = null; - iterator[kLastResolve] = null; - iterator[kLastReject] = null; - resolve(createIterResult(data, false)); - } else { - iterator[kLastResolve] = resolve; - iterator[kLastReject] = reject; - } - }, - writable: true - }), _Object$create)); - iterator[kLastPromise] = null; - finished(stream, function (err) { - if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') { - var reject = iterator[kLastReject]; // reject if we are waiting for data in the Promise - // returned by next() and store the error - - if (reject !== null) { - iterator[kLastPromise] = null; - iterator[kLastResolve] = null; - iterator[kLastReject] = null; - reject(err); - } - - iterator[kError] = err; - return; - } - - var resolve = iterator[kLastResolve]; - - if (resolve !== null) { - iterator[kLastPromise] = null; - iterator[kLastResolve] = null; - iterator[kLastReject] = null; - resolve(createIterResult(undefined, true)); - } - - iterator[kEnded] = true; - }); - stream.on('readable', onReadable.bind(null, iterator)); - return iterator; -}; - -module.exports = createReadableStreamAsyncIterator; - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/internal/streams/buffer_list.js": -/*!**************************************************************************!*\ - !*** ./node_modules/readable-stream/lib/internal/streams/buffer_list.js ***! - \**************************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -function ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; } - -function _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; } - -function _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; } - -function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } - -function _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } - -function _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; } - -var _require = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js"), - Buffer = _require.Buffer; - -var _require2 = __webpack_require__(/*! util */ "?ed1b"), - inspect = _require2.inspect; - -var custom = inspect && inspect.custom || 'inspect'; - -function copyBuffer(src, target, offset) { - Buffer.prototype.copy.call(src, target, offset); -} - -module.exports = -/*#__PURE__*/ -function () { - function BufferList() { - _classCallCheck(this, BufferList); - - this.head = null; - this.tail = null; - this.length = 0; - } - - _createClass(BufferList, [{ - key: "push", - value: function push(v) { - var entry = { - data: v, - next: null - }; - if (this.length > 0) this.tail.next = entry;else this.head = entry; - this.tail = entry; - ++this.length; - } - }, { - key: "unshift", - value: function unshift(v) { - var entry = { - data: v, - next: this.head - }; - if (this.length === 0) this.tail = entry; - this.head = entry; - ++this.length; - } - }, { - key: "shift", - value: function shift() { - if (this.length === 0) return; - var ret = this.head.data; - if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next; - --this.length; - return ret; - } - }, { - key: "clear", - value: function clear() { - this.head = this.tail = null; - this.length = 0; - } - }, { - key: "join", - value: function join(s) { - if (this.length === 0) return ''; - var p = this.head; - var ret = '' + p.data; - - while (p = p.next) { - ret += s + p.data; - } - - return ret; - } - }, { - key: "concat", - value: function concat(n) { - if (this.length === 0) return Buffer.alloc(0); - var ret = Buffer.allocUnsafe(n >>> 0); - var p = this.head; - var i = 0; - - while (p) { - copyBuffer(p.data, ret, i); - i += p.data.length; - p = p.next; - } - - return ret; - } // Consumes a specified amount of bytes or characters from the buffered data. - - }, { - key: "consume", - value: function consume(n, hasStrings) { - var ret; - - if (n < this.head.data.length) { - // `slice` is the same for buffers and strings. - ret = this.head.data.slice(0, n); - this.head.data = this.head.data.slice(n); - } else if (n === this.head.data.length) { - // First chunk is a perfect match. - ret = this.shift(); - } else { - // Result spans more than one buffer. - ret = hasStrings ? this._getString(n) : this._getBuffer(n); - } - - return ret; - } - }, { - key: "first", - value: function first() { - return this.head.data; - } // Consumes a specified amount of characters from the buffered data. - - }, { - key: "_getString", - value: function _getString(n) { - var p = this.head; - var c = 1; - var ret = p.data; - n -= ret.length; - - while (p = p.next) { - var str = p.data; - var nb = n > str.length ? str.length : n; - if (nb === str.length) ret += str;else ret += str.slice(0, n); - n -= nb; - - if (n === 0) { - if (nb === str.length) { - ++c; - if (p.next) this.head = p.next;else this.head = this.tail = null; - } else { - this.head = p; - p.data = str.slice(nb); - } - - break; - } - - ++c; - } - - this.length -= c; - return ret; - } // Consumes a specified amount of bytes from the buffered data. - - }, { - key: "_getBuffer", - value: function _getBuffer(n) { - var ret = Buffer.allocUnsafe(n); - var p = this.head; - var c = 1; - p.data.copy(ret); - n -= p.data.length; - - while (p = p.next) { - var buf = p.data; - var nb = n > buf.length ? buf.length : n; - buf.copy(ret, ret.length - n, 0, nb); - n -= nb; - - if (n === 0) { - if (nb === buf.length) { - ++c; - if (p.next) this.head = p.next;else this.head = this.tail = null; - } else { - this.head = p; - p.data = buf.slice(nb); - } - - break; - } - - ++c; - } - - this.length -= c; - return ret; - } // Make sure the linked list only shows the minimal necessary information. - - }, { - key: custom, - value: function value(_, options) { - return inspect(this, _objectSpread({}, options, { - // Only inspect one level. - depth: 0, - // It should not recurse. - customInspect: false - })); - } - }]); - - return BufferList; -}(); - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/internal/streams/destroy.js": -/*!**********************************************************************!*\ - !*** ./node_modules/readable-stream/lib/internal/streams/destroy.js ***! - \**********************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); - // undocumented cb() API, needed for core, not for public API - -function destroy(err, cb) { - var _this = this; - - var readableDestroyed = this._readableState && this._readableState.destroyed; - var writableDestroyed = this._writableState && this._writableState.destroyed; - - if (readableDestroyed || writableDestroyed) { - if (cb) { - cb(err); - } else if (err) { - if (!this._writableState) { - process.nextTick(emitErrorNT, this, err); - } else if (!this._writableState.errorEmitted) { - this._writableState.errorEmitted = true; - process.nextTick(emitErrorNT, this, err); - } - } - - return this; - } // we set destroyed to true before firing error callbacks in order - // to make it re-entrance safe in case destroy() is called within callbacks - - - if (this._readableState) { - this._readableState.destroyed = true; - } // if this is a duplex stream mark the writable part as destroyed as well - - - if (this._writableState) { - this._writableState.destroyed = true; - } - - this._destroy(err || null, function (err) { - if (!cb && err) { - if (!_this._writableState) { - process.nextTick(emitErrorAndCloseNT, _this, err); - } else if (!_this._writableState.errorEmitted) { - _this._writableState.errorEmitted = true; - process.nextTick(emitErrorAndCloseNT, _this, err); - } else { - process.nextTick(emitCloseNT, _this); - } - } else if (cb) { - process.nextTick(emitCloseNT, _this); - cb(err); - } else { - process.nextTick(emitCloseNT, _this); - } - }); - - return this; -} - -function emitErrorAndCloseNT(self, err) { - emitErrorNT(self, err); - emitCloseNT(self); -} - -function emitCloseNT(self) { - if (self._writableState && !self._writableState.emitClose) return; - if (self._readableState && !self._readableState.emitClose) return; - self.emit('close'); -} - -function undestroy() { - if (this._readableState) { - this._readableState.destroyed = false; - this._readableState.reading = false; - this._readableState.ended = false; - this._readableState.endEmitted = false; - } - - if (this._writableState) { - this._writableState.destroyed = false; - this._writableState.ended = false; - this._writableState.ending = false; - this._writableState.finalCalled = false; - this._writableState.prefinished = false; - this._writableState.finished = false; - this._writableState.errorEmitted = false; - } -} - -function emitErrorNT(self, err) { - self.emit('error', err); -} - -function errorOrDestroy(stream, err) { - // We have tests that rely on errors being emitted - // in the same tick, so changing this is semver major. - // For now when you opt-in to autoDestroy we allow - // the error to be emitted nextTick. In a future - // semver major update we should change the default to this. - var rState = stream._readableState; - var wState = stream._writableState; - if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err); -} - -module.exports = { - destroy: destroy, - undestroy: undestroy, - errorOrDestroy: errorOrDestroy -}; - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/internal/streams/end-of-stream.js": -/*!****************************************************************************!*\ - !*** ./node_modules/readable-stream/lib/internal/streams/end-of-stream.js ***! - \****************************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Ported from https://github.com/mafintosh/end-of-stream with -// permission from the author, Mathias Buus (@mafintosh). - - -var ERR_STREAM_PREMATURE_CLOSE = __webpack_require__(/*! ../../../errors */ "./node_modules/readable-stream/errors-browser.js").codes.ERR_STREAM_PREMATURE_CLOSE; - -function once(callback) { - var called = false; - return function () { - if (called) return; - called = true; - - for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) { - args[_key] = arguments[_key]; - } - - callback.apply(this, args); - }; -} - -function noop() {} - -function isRequest(stream) { - return stream.setHeader && typeof stream.abort === 'function'; -} - -function eos(stream, opts, callback) { - if (typeof opts === 'function') return eos(stream, null, opts); - if (!opts) opts = {}; - callback = once(callback || noop); - var readable = opts.readable || opts.readable !== false && stream.readable; - var writable = opts.writable || opts.writable !== false && stream.writable; - - var onlegacyfinish = function onlegacyfinish() { - if (!stream.writable) onfinish(); - }; - - var writableEnded = stream._writableState && stream._writableState.finished; - - var onfinish = function onfinish() { - writable = false; - writableEnded = true; - if (!readable) callback.call(stream); - }; - - var readableEnded = stream._readableState && stream._readableState.endEmitted; - - var onend = function onend() { - readable = false; - readableEnded = true; - if (!writable) callback.call(stream); - }; - - var onerror = function onerror(err) { - callback.call(stream, err); - }; - - var onclose = function onclose() { - var err; - - if (readable && !readableEnded) { - if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE(); - return callback.call(stream, err); - } - - if (writable && !writableEnded) { - if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE(); - return callback.call(stream, err); - } - }; - - var onrequest = function onrequest() { - stream.req.on('finish', onfinish); - }; - - if (isRequest(stream)) { - stream.on('complete', onfinish); - stream.on('abort', onclose); - if (stream.req) onrequest();else stream.on('request', onrequest); - } else if (writable && !stream._writableState) { - // legacy streams - stream.on('end', onlegacyfinish); - stream.on('close', onlegacyfinish); - } - - stream.on('end', onend); - stream.on('finish', onfinish); - if (opts.error !== false) stream.on('error', onerror); - stream.on('close', onclose); - return function () { - stream.removeListener('complete', onfinish); - stream.removeListener('abort', onclose); - stream.removeListener('request', onrequest); - if (stream.req) stream.req.removeListener('finish', onfinish); - stream.removeListener('end', onlegacyfinish); - stream.removeListener('close', onlegacyfinish); - stream.removeListener('finish', onfinish); - stream.removeListener('end', onend); - stream.removeListener('error', onerror); - stream.removeListener('close', onclose); - }; -} - -module.exports = eos; - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/internal/streams/from-browser.js": -/*!***************************************************************************!*\ - !*** ./node_modules/readable-stream/lib/internal/streams/from-browser.js ***! - \***************************************************************************/ -/***/ ((module) => { - -module.exports = function () { - throw new Error('Readable.from is not available in the browser') -}; - - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/internal/streams/pipeline.js": -/*!***********************************************************************!*\ - !*** ./node_modules/readable-stream/lib/internal/streams/pipeline.js ***! - \***********************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -// Ported from https://github.com/mafintosh/pump with -// permission from the author, Mathias Buus (@mafintosh). - - -var eos; - -function once(callback) { - var called = false; - return function () { - if (called) return; - called = true; - callback.apply(void 0, arguments); - }; -} - -var _require$codes = __webpack_require__(/*! ../../../errors */ "./node_modules/readable-stream/errors-browser.js").codes, - ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS, - ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED; - -function noop(err) { - // Rethrow the error if it exists to avoid swallowing it - if (err) throw err; -} - -function isRequest(stream) { - return stream.setHeader && typeof stream.abort === 'function'; -} - -function destroyer(stream, reading, writing, callback) { - callback = once(callback); - var closed = false; - stream.on('close', function () { - closed = true; - }); - if (eos === undefined) eos = __webpack_require__(/*! ./end-of-stream */ "./node_modules/readable-stream/lib/internal/streams/end-of-stream.js"); - eos(stream, { - readable: reading, - writable: writing - }, function (err) { - if (err) return callback(err); - closed = true; - callback(); - }); - var destroyed = false; - return function (err) { - if (closed) return; - if (destroyed) return; - destroyed = true; // request.destroy just do .end - .abort is what we want - - if (isRequest(stream)) return stream.abort(); - if (typeof stream.destroy === 'function') return stream.destroy(); - callback(err || new ERR_STREAM_DESTROYED('pipe')); - }; -} - -function call(fn) { - fn(); -} - -function pipe(from, to) { - return from.pipe(to); -} - -function popCallback(streams) { - if (!streams.length) return noop; - if (typeof streams[streams.length - 1] !== 'function') return noop; - return streams.pop(); -} - -function pipeline() { - for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) { - streams[_key] = arguments[_key]; - } - - var callback = popCallback(streams); - if (Array.isArray(streams[0])) streams = streams[0]; - - if (streams.length < 2) { - throw new ERR_MISSING_ARGS('streams'); - } - - var error; - var destroys = streams.map(function (stream, i) { - var reading = i < streams.length - 1; - var writing = i > 0; - return destroyer(stream, reading, writing, function (err) { - if (!error) error = err; - if (err) destroys.forEach(call); - if (reading) return; - destroys.forEach(call); - callback(error); - }); - }); - return streams.reduce(pipe); -} - -module.exports = pipeline; - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/internal/streams/state.js": -/*!********************************************************************!*\ - !*** ./node_modules/readable-stream/lib/internal/streams/state.js ***! - \********************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var ERR_INVALID_OPT_VALUE = __webpack_require__(/*! ../../../errors */ "./node_modules/readable-stream/errors-browser.js").codes.ERR_INVALID_OPT_VALUE; - -function highWaterMarkFrom(options, isDuplex, duplexKey) { - return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null; -} - -function getHighWaterMark(state, options, duplexKey, isDuplex) { - var hwm = highWaterMarkFrom(options, isDuplex, duplexKey); - - if (hwm != null) { - if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) { - var name = isDuplex ? duplexKey : 'highWaterMark'; - throw new ERR_INVALID_OPT_VALUE(name, hwm); - } - - return Math.floor(hwm); - } // Default value - - - return state.objectMode ? 16 : 16 * 1024; -} - -module.exports = { - getHighWaterMark: getHighWaterMark -}; - -/***/ }), - -/***/ "./node_modules/readable-stream/lib/internal/streams/stream-browser.js": -/*!*****************************************************************************!*\ - !*** ./node_modules/readable-stream/lib/internal/streams/stream-browser.js ***! - \*****************************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -module.exports = __webpack_require__(/*! events */ "./node_modules/events/events.js").EventEmitter; - - -/***/ }), - -/***/ "./node_modules/readable-stream/readable-browser.js": -/*!**********************************************************!*\ - !*** ./node_modules/readable-stream/readable-browser.js ***! - \**********************************************************/ -/***/ ((module, exports, __webpack_require__) => { - -exports = module.exports = __webpack_require__(/*! ./lib/_stream_readable.js */ "./node_modules/readable-stream/lib/_stream_readable.js"); -exports.Stream = exports; -exports.Readable = exports; -exports.Writable = __webpack_require__(/*! ./lib/_stream_writable.js */ "./node_modules/readable-stream/lib/_stream_writable.js"); -exports.Duplex = __webpack_require__(/*! ./lib/_stream_duplex.js */ "./node_modules/readable-stream/lib/_stream_duplex.js"); -exports.Transform = __webpack_require__(/*! ./lib/_stream_transform.js */ "./node_modules/readable-stream/lib/_stream_transform.js"); -exports.PassThrough = __webpack_require__(/*! ./lib/_stream_passthrough.js */ "./node_modules/readable-stream/lib/_stream_passthrough.js"); -exports.finished = __webpack_require__(/*! ./lib/internal/streams/end-of-stream.js */ "./node_modules/readable-stream/lib/internal/streams/end-of-stream.js"); -exports.pipeline = __webpack_require__(/*! ./lib/internal/streams/pipeline.js */ "./node_modules/readable-stream/lib/internal/streams/pipeline.js"); - - -/***/ }), - -/***/ "./node_modules/render-media/index.js": -/*!********************************************!*\ - !*** ./node_modules/render-media/index.js ***! - \********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/*! render-media. MIT License. Feross Aboukhadijeh */ -exports.render = render -exports.append = append -exports.mime = __webpack_require__(/*! ./lib/mime.json */ "./node_modules/render-media/lib/mime.json") - -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('render-media') -const isAscii = __webpack_require__(/*! is-ascii */ "./node_modules/is-ascii/index.js") -const MediaElementWrapper = __webpack_require__(/*! mediasource */ "./node_modules/mediasource/index.js") -const path = __webpack_require__(/*! path */ "./node_modules/path-browserify/index.js") -const streamToBlobURL = __webpack_require__(/*! stream-to-blob-url */ "./node_modules/stream-to-blob-url/index.js") -const VideoStream = __webpack_require__(/*! videostream */ "./node_modules/videostream/videostream.js") - -// Note: Everything listed in VIDEOSTREAM_EXTS should also appear in either -// MEDIASOURCE_VIDEO_EXTS or MEDIASOURCE_AUDIO_EXTS. -const VIDEOSTREAM_EXTS = [ - '.m4a', - '.m4b', - '.m4p', - '.m4v', - '.mp4' -] - -const MEDIASOURCE_VIDEO_EXTS = [ - '.m4v', - '.mkv', - '.mp4', - '.webm' -] - -const MEDIASOURCE_AUDIO_EXTS = [ - '.m4a', - '.m4b', - '.m4p', - '.mp3' -] - -const MEDIASOURCE_EXTS = [].concat( - MEDIASOURCE_VIDEO_EXTS, - MEDIASOURCE_AUDIO_EXTS -) - -const VIDEO_EXTS = [ - '.mov', - '.ogv' -] - -const AUDIO_EXTS = [ - '.aac', - '.oga', - '.ogg', - '.wav', - '.flac' -] - -const IMAGE_EXTS = [ - '.bmp', - '.gif', - '.jpeg', - '.jpg', - '.png', - '.svg' -] - -const IFRAME_EXTS = [ - '.css', - '.html', - '.js', - '.md', - '.pdf', - '.srt', - '.txt' -] - -// Maximum file length for which the Blob URL strategy will be attempted -// See: https://github.com/feross/render-media/issues/18 -const MAX_BLOB_LENGTH = 200 * 1000 * 1000 // 200 MB - -const MediaSource = typeof window !== 'undefined' && window.MediaSource - -function render (file, elem, opts, cb) { - if (typeof opts === 'function') { - cb = opts - opts = {} - } - if (!opts) opts = {} - if (!cb) cb = () => {} - - validateFile(file) - parseOpts(opts) - - if (typeof elem === 'string') elem = document.querySelector(elem) - - renderMedia(file, tagName => { - if (elem.nodeName !== tagName.toUpperCase()) { - const extname = path.extname(file.name).toLowerCase() - - throw new Error( - `Cannot render "${extname}" inside a "${elem.nodeName.toLowerCase()}" element, expected "${tagName}"` - ) - } - - if (tagName === 'video' || tagName === 'audio') setMediaOpts(elem, opts) - - return elem - }, opts, cb) -} - -function append (file, rootElem, opts, cb) { - if (typeof opts === 'function') { - cb = opts - opts = {} - } - if (!opts) opts = {} - if (!cb) cb = () => {} - - validateFile(file) - parseOpts(opts) - - if (typeof rootElem === 'string') rootElem = document.querySelector(rootElem) - - if (rootElem && (rootElem.nodeName === 'VIDEO' || rootElem.nodeName === 'AUDIO')) { - throw new Error( - 'Invalid video/audio node argument. Argument must be root element that ' + - 'video/audio tag will be appended to.' - ) - } - - renderMedia(file, getElem, opts, done) - - function getElem (tagName) { - if (tagName === 'video' || tagName === 'audio') return createMedia(tagName) - else return createElem(tagName) - } - - function createMedia (tagName) { - const elem = createElem(tagName) - setMediaOpts(elem, opts) - rootElem.appendChild(elem) - return elem - } - - function createElem (tagName) { - const elem = document.createElement(tagName) - rootElem.appendChild(elem) - return elem - } - - function done (err, elem) { - if (err && elem) elem.remove() - cb(err, elem) - } -} - -function renderMedia (file, getElem, opts, cb) { - const extname = path.extname(file.name).toLowerCase() - let currentTime = 0 - let elem - - if (MEDIASOURCE_EXTS.includes(extname)) { - renderMediaSource() - } else if (VIDEO_EXTS.includes(extname)) { - renderMediaElement('video') - } else if (AUDIO_EXTS.includes(extname)) { - renderMediaElement('audio') - } else if (IMAGE_EXTS.includes(extname)) { - renderImage() - } else if (IFRAME_EXTS.includes(extname)) { - renderIframe() - } else { - tryRenderIframe() - } - - function renderMediaSource () { - const tagName = MEDIASOURCE_VIDEO_EXTS.includes(extname) ? 'video' : 'audio' - - if (MediaSource) { - if (VIDEOSTREAM_EXTS.includes(extname)) { - useVideostream() - } else { - useMediaSource() - } - } else { - useBlobURL() - } - - function useVideostream () { - debug(`Use \`videostream\` package for ${file.name}`) - prepareElem() - elem.addEventListener('error', fallbackToMediaSource) - elem.addEventListener('loadstart', onLoadStart) - elem.addEventListener('loadedmetadata', onLoadedMetadata) - new VideoStream(file, elem) /* eslint-disable-line no-new */ - } - - function useMediaSource () { - debug(`Use MediaSource API for ${file.name}`) - prepareElem() - elem.addEventListener('error', fallbackToBlobURL) - elem.addEventListener('loadstart', onLoadStart) - elem.addEventListener('loadedmetadata', onLoadedMetadata) - - const wrapper = new MediaElementWrapper(elem) - const writable = wrapper.createWriteStream(getCodec(file.name)) - file.createReadStream().pipe(writable) - - if (currentTime) elem.currentTime = currentTime - } - - function useBlobURL () { - debug(`Use Blob URL for ${file.name}`) - prepareElem() - elem.addEventListener('error', fatalError) - elem.addEventListener('loadstart', onLoadStart) - elem.addEventListener('loadedmetadata', onLoadedMetadata) - getBlobURL(file, (err, url) => { - if (err) return fatalError(err) - elem.src = url - if (currentTime) elem.currentTime = currentTime - }) - } - - function fallbackToMediaSource (err) { - debug('videostream error: fallback to MediaSource API: %o', err.message || err) - elem.removeEventListener('error', fallbackToMediaSource) - elem.removeEventListener('loadedmetadata', onLoadedMetadata) - - useMediaSource() - } - - function fallbackToBlobURL (err) { - debug('MediaSource API error: fallback to Blob URL: %o', err.message || err) - if (!checkBlobLength()) return - - elem.removeEventListener('error', fallbackToBlobURL) - elem.removeEventListener('loadedmetadata', onLoadedMetadata) - - useBlobURL() - } - - function prepareElem () { - if (!elem) { - elem = getElem(tagName) - - elem.addEventListener('progress', () => { - currentTime = elem.currentTime - }) - } - } - } - - function checkBlobLength () { - if (typeof file.length === 'number' && file.length > opts.maxBlobLength) { - debug( - 'File length too large for Blob URL approach: %d (max: %d)', - file.length, opts.maxBlobLength - ) - fatalError(new Error( - `File length too large for Blob URL approach: ${file.length} (max: ${opts.maxBlobLength})` - )) - return false - } - return true - } - - function renderMediaElement (type) { - if (!checkBlobLength()) return - - elem = getElem(type) - getBlobURL(file, (err, url) => { - if (err) return fatalError(err) - elem.addEventListener('error', fatalError) - elem.addEventListener('loadstart', onLoadStart) - elem.addEventListener('loadedmetadata', onLoadedMetadata) - elem.src = url - }) - } - - function onLoadStart () { - elem.removeEventListener('loadstart', onLoadStart) - if (opts.autoplay) { - const playPromise = elem.play() - if (typeof playPromise !== 'undefined') playPromise.catch(fatalError) - } - } - - function onLoadedMetadata () { - elem.removeEventListener('loadedmetadata', onLoadedMetadata) - cb(null, elem) - } - - function renderImage () { - elem = getElem('img') - getBlobURL(file, (err, url) => { - if (err) return fatalError(err) - elem.src = url - elem.alt = file.name - cb(null, elem) - }) - } - - function renderIframe () { - getBlobURL(file, (err, url) => { - if (err) return fatalError(err) - - if (extname !== '.pdf') { - // Render iframe - elem = getElem('iframe') - elem.sandbox = 'allow-forms allow-scripts' - elem.src = url - } else { - // Render .pdf - elem = getElem('object') - // Firefox-only: `typemustmatch` keeps the embedded file from running unless - // its content type matches the specified `type` attribute - elem.setAttribute('typemustmatch', true) - elem.setAttribute('type', 'application/pdf') - elem.setAttribute('data', url) - } - cb(null, elem) - }) - } - - function tryRenderIframe () { - debug('Unknown file extension "%s" - will attempt to render into iframe', extname) - - let str = '' - file.createReadStream({ start: 0, end: 1000 }) - .setEncoding('utf8') - .on('data', chunk => { - str += chunk - }) - .on('end', done) - .on('error', cb) - - function done () { - if (isAscii(str)) { - debug('File extension "%s" appears ascii, so will render.', extname) - renderIframe() - } else { - debug('File extension "%s" appears non-ascii, will not render.', extname) - cb(new Error(`Unsupported file type "${extname}": Cannot append to DOM`)) - } - } - } - - function fatalError (err) { - err.message = `Error rendering file "${file.name}": ${err.message}` - debug(err.message) - cb(err) - } -} - -function getBlobURL (file, cb) { - const extname = path.extname(file.name).toLowerCase() - streamToBlobURL(file.createReadStream(), exports.mime[extname]) - .then( - blobUrl => cb(null, blobUrl), - err => cb(err) - ) -} - -function validateFile (file) { - if (file == null) { - throw new Error('file cannot be null or undefined') - } - if (typeof file.name !== 'string') { - throw new Error('missing or invalid file.name property') - } - if (typeof file.createReadStream !== 'function') { - throw new Error('missing or invalid file.createReadStream property') - } -} - -function getCodec (name) { - const extname = path.extname(name).toLowerCase() - return { - '.m4a': 'audio/mp4; codecs="mp4a.40.5"', - '.m4b': 'audio/mp4; codecs="mp4a.40.5"', - '.m4p': 'audio/mp4; codecs="mp4a.40.5"', - '.m4v': 'video/mp4; codecs="avc1.640029, mp4a.40.5"', - '.mkv': 'video/webm; codecs="avc1.640029, mp4a.40.5"', - '.mp3': 'audio/mpeg', - '.mp4': 'video/mp4; codecs="avc1.640029, mp4a.40.5"', - '.webm': 'video/webm; codecs="vorbis, vp8"' - }[extname] -} - -function parseOpts (opts) { - if (opts.autoplay == null) opts.autoplay = false - if (opts.muted == null) opts.muted = false - if (opts.controls == null) opts.controls = true - if (opts.maxBlobLength == null) opts.maxBlobLength = MAX_BLOB_LENGTH -} - -function setMediaOpts (elem, opts) { - elem.autoplay = !!opts.autoplay - elem.muted = !!opts.muted - elem.controls = !!opts.controls -} - - -/***/ }), - -/***/ "./node_modules/render-media/lib/mime.json": -/*!*************************************************!*\ - !*** ./node_modules/render-media/lib/mime.json ***! - \*************************************************/ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{".3gp":"video/3gpp",".aac":"audio/aac",".aif":"audio/x-aiff",".aiff":"audio/x-aiff",".atom":"application/atom+xml",".avi":"video/x-msvideo",".bmp":"image/bmp",".bz2":"application/x-bzip2",".conf":"text/plain",".css":"text/css",".csv":"text/plain",".diff":"text/x-diff",".doc":"application/msword",".flv":"video/x-flv",".gif":"image/gif",".gz":"application/x-gzip",".htm":"text/html",".html":"text/html",".ico":"image/vnd.microsoft.icon",".ics":"text/calendar",".iso":"application/octet-stream",".jar":"application/java-archive",".jpeg":"image/jpeg",".jpg":"image/jpeg",".js":"application/javascript",".json":"application/json",".less":"text/css",".log":"text/plain",".m3u":"audio/x-mpegurl",".m4a":"audio/x-m4a",".m4b":"audio/mp4",".m4p":"audio/mp4",".m4v":"video/x-m4v",".manifest":"text/cache-manifest",".markdown":"text/x-markdown",".mathml":"application/mathml+xml",".md":"text/x-markdown",".mid":"audio/midi",".midi":"audio/midi",".mov":"video/quicktime",".mp3":"audio/mpeg",".mp4":"video/mp4",".mp4v":"video/mp4",".mpeg":"video/mpeg",".mpg":"video/mpeg",".odp":"application/vnd.oasis.opendocument.presentation",".ods":"application/vnd.oasis.opendocument.spreadsheet",".odt":"application/vnd.oasis.opendocument.text",".oga":"audio/ogg",".ogg":"application/ogg",".pdf":"application/pdf",".png":"image/png",".pps":"application/vnd.ms-powerpoint",".ppt":"application/vnd.ms-powerpoint",".ps":"application/postscript",".psd":"image/vnd.adobe.photoshop",".qt":"video/quicktime",".rar":"application/x-rar-compressed",".rdf":"application/rdf+xml",".rss":"application/rss+xml",".rtf":"application/rtf",".svg":"image/svg+xml",".svgz":"image/svg+xml",".swf":"application/x-shockwave-flash",".tar":"application/x-tar",".tbz":"application/x-bzip-compressed-tar",".text":"text/plain",".tif":"image/tiff",".tiff":"image/tiff",".torrent":"application/x-bittorrent",".ttf":"application/x-font-ttf",".txt":"text/plain",".wav":"audio/wav",".webm":"video/webm",".wma":"audio/x-ms-wma",".wmv":"video/x-ms-wmv",".xls":"application/vnd.ms-excel",".xml":"application/xml",".yaml":"text/yaml",".yml":"text/yaml",".zip":"application/zip"}'); - -/***/ }), - -/***/ "./node_modules/ripemd160/index.js": -/*!*****************************************!*\ - !*** ./node_modules/ripemd160/index.js ***! - \*****************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - -var Buffer = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js").Buffer -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var HashBase = __webpack_require__(/*! hash-base */ "./node_modules/hash-base/index.js") - -var ARRAY16 = new Array(16) - -var 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 -] - -var 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 -] - -var 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 -] - -var 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 -] - -var hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e] -var hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000] - -function RIPEMD160 () { - HashBase.call(this, 64) - - // state - this._a = 0x67452301 - this._b = 0xefcdab89 - this._c = 0x98badcfe - this._d = 0x10325476 - this._e = 0xc3d2e1f0 -} - -inherits(RIPEMD160, HashBase) - -RIPEMD160.prototype._update = function () { - var words = ARRAY16 - for (var j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4) - - var al = this._a | 0 - var bl = this._b | 0 - var cl = this._c | 0 - var dl = this._d | 0 - var el = this._e | 0 - - var ar = this._a | 0 - var br = this._b | 0 - var cr = this._c | 0 - var dr = this._d | 0 - var er = this._e | 0 - - // computation - for (var i = 0; i < 80; i += 1) { - var tl - var tr - if (i < 16) { - tl = fn1(al, bl, cl, dl, el, words[zl[i]], hl[0], sl[i]) - tr = fn5(ar, br, cr, dr, er, words[zr[i]], hr[0], sr[i]) - } else if (i < 32) { - tl = fn2(al, bl, cl, dl, el, words[zl[i]], hl[1], sl[i]) - tr = fn4(ar, br, cr, dr, er, words[zr[i]], hr[1], sr[i]) - } else if (i < 48) { - tl = fn3(al, bl, cl, dl, el, words[zl[i]], hl[2], sl[i]) - tr = fn3(ar, br, cr, dr, er, words[zr[i]], hr[2], sr[i]) - } else if (i < 64) { - tl = fn4(al, bl, cl, dl, el, words[zl[i]], hl[3], sl[i]) - tr = fn2(ar, br, cr, dr, er, words[zr[i]], hr[3], sr[i]) - } else { // if (i<80) { - tl = fn5(al, bl, cl, dl, el, words[zl[i]], hl[4], sl[i]) - tr = fn1(ar, br, cr, dr, er, words[zr[i]], hr[4], sr[i]) - } - - al = el - el = dl - dl = rotl(cl, 10) - cl = bl - bl = tl - - ar = er - er = dr - dr = rotl(cr, 10) - cr = br - br = tr - } - - // update state - var t = (this._b + cl + dr) | 0 - this._b = (this._c + dl + er) | 0 - this._c = (this._d + el + ar) | 0 - this._d = (this._e + al + br) | 0 - this._e = (this._a + bl + cr) | 0 - this._a = t -} - -RIPEMD160.prototype._digest = function () { - // create padding and handle blocks - this._block[this._blockOffset++] = 0x80 - if (this._blockOffset > 56) { - this._block.fill(0, this._blockOffset, 64) - this._update() - this._blockOffset = 0 - } - - this._block.fill(0, this._blockOffset, 56) - this._block.writeUInt32LE(this._length[0], 56) - this._block.writeUInt32LE(this._length[1], 60) - this._update() - - // produce result - var buffer = Buffer.alloc ? Buffer.alloc(20) : new Buffer(20) - buffer.writeInt32LE(this._a, 0) - buffer.writeInt32LE(this._b, 4) - buffer.writeInt32LE(this._c, 8) - buffer.writeInt32LE(this._d, 12) - buffer.writeInt32LE(this._e, 16) - return buffer -} - -function rotl (x, n) { - return (x << n) | (x >>> (32 - n)) -} - -function fn1 (a, b, c, d, e, m, k, s) { - return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + e) | 0 -} - -function fn2 (a, b, c, d, e, m, k, s) { - return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + e) | 0 -} - -function fn3 (a, b, c, d, e, m, k, s) { - return (rotl((a + ((b | (~c)) ^ d) + m + k) | 0, s) + e) | 0 -} - -function fn4 (a, b, c, d, e, m, k, s) { - return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + e) | 0 -} - -function fn5 (a, b, c, d, e, m, k, s) { - return (rotl((a + (b ^ (c | (~d))) + m + k) | 0, s) + e) | 0 -} - -module.exports = RIPEMD160 - - -/***/ }), - -/***/ "./node_modules/run-parallel-limit/index.js": -/*!**************************************************!*\ - !*** ./node_modules/run-parallel-limit/index.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*! run-parallel-limit. MIT License. Feross Aboukhadijeh */ -module.exports = runParallelLimit - -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -function runParallelLimit (tasks, limit, cb) { - if (typeof limit !== 'number') throw new Error('second argument must be a Number') - let results, len, pending, keys, isErrored - let isSync = true - let next - - if (Array.isArray(tasks)) { - results = [] - pending = len = tasks.length - } else { - keys = Object.keys(tasks) - results = {} - pending = len = keys.length - } - - function done (err) { - function end () { - if (cb) cb(err, results) - cb = null - } - if (isSync) queueMicrotask(end) - else end() - } - - function each (i, err, result) { - results[i] = result - if (err) isErrored = true - if (--pending === 0 || err) { - done(err) - } else if (!isErrored && next < len) { - let key - if (keys) { - key = keys[next] - next += 1 - tasks[key](function (err, result) { each(key, err, result) }) - } else { - key = next - next += 1 - tasks[key](function (err, result) { each(key, err, result) }) - } - } - } - - next = limit - if (!pending) { - // empty - done(null) - } else if (keys) { - // object - keys.some(function (key, i) { - tasks[key](function (err, result) { each(key, err, result) }) - if (i === limit - 1) return true // early return - return false - }) - } else { - // array - tasks.some(function (task, i) { - task(function (err, result) { each(i, err, result) }) - if (i === limit - 1) return true // early return - return false - }) - } - - isSync = false -} - - -/***/ }), - -/***/ "./node_modules/run-parallel/index.js": -/*!********************************************!*\ - !*** ./node_modules/run-parallel/index.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*! run-parallel. MIT License. Feross Aboukhadijeh */ -module.exports = runParallel - -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") - -function runParallel (tasks, cb) { - let results, pending, keys - let isSync = true - - if (Array.isArray(tasks)) { - results = [] - pending = tasks.length - } else { - keys = Object.keys(tasks) - results = {} - pending = keys.length - } - - function done (err) { - function end () { - if (cb) cb(err, results) - cb = null - } - if (isSync) queueMicrotask(end) - else end() - } - - function each (i, err, result) { - results[i] = result - if (--pending === 0 || err) { - done(err) - } - } - - if (!pending) { - // empty - done(null) - } else if (keys) { - // object - keys.forEach(function (key) { - tasks[key](function (err, result) { each(key, err, result) }) - }) - } else { - // array - tasks.forEach(function (task, i) { - task(function (err, result) { each(i, err, result) }) - }) - } - - isSync = false -} - - -/***/ }), - -/***/ "./node_modules/rusha/dist/rusha.js": -/*!******************************************!*\ - !*** ./node_modules/rusha/dist/rusha.js ***! - \******************************************/ -/***/ (function(module, __unused_webpack_exports, __webpack_require__) { - -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -(function webpackUniversalModuleDefinition(root, factory) { - if(true) - module.exports = factory(); - else {} -})(typeof self !== 'undefined' ? self : this, function() { -return /******/ (function(modules) { // webpackBootstrap -/******/ // The module cache -/******/ var installedModules = {}; -/******/ -/******/ // The require function -/******/ function __nested_webpack_require_570__(moduleId) { -/******/ -/******/ // Check if module is in cache -/******/ if(installedModules[moduleId]) { -/******/ return installedModules[moduleId].exports; -/******/ } -/******/ // Create a new module (and put it into the cache) -/******/ var module = installedModules[moduleId] = { -/******/ i: moduleId, -/******/ l: false, -/******/ exports: {} -/******/ }; -/******/ -/******/ // Execute the module function -/******/ modules[moduleId].call(module.exports, module, module.exports, __nested_webpack_require_570__); -/******/ -/******/ // Flag the module as loaded -/******/ module.l = true; -/******/ -/******/ // Return the exports of the module -/******/ return module.exports; -/******/ } -/******/ -/******/ -/******/ // expose the modules object (__webpack_modules__) -/******/ __nested_webpack_require_570__.m = modules; -/******/ -/******/ // expose the module cache -/******/ __nested_webpack_require_570__.c = installedModules; -/******/ -/******/ // define getter function for harmony exports -/******/ __nested_webpack_require_570__.d = function(exports, name, getter) { -/******/ if(!__nested_webpack_require_570__.o(exports, name)) { -/******/ Object.defineProperty(exports, name, { -/******/ configurable: false, -/******/ enumerable: true, -/******/ get: getter -/******/ }); -/******/ } -/******/ }; -/******/ -/******/ // getDefaultExport function for compatibility with non-harmony modules -/******/ __nested_webpack_require_570__.n = function(module) { -/******/ var getter = module && module.__esModule ? -/******/ function getDefault() { return module['default']; } : -/******/ function getModuleExports() { return module; }; -/******/ __nested_webpack_require_570__.d(getter, 'a', getter); -/******/ return getter; -/******/ }; -/******/ -/******/ // Object.prototype.hasOwnProperty.call -/******/ __nested_webpack_require_570__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); }; -/******/ -/******/ // __webpack_public_path__ -/******/ __nested_webpack_require_570__.p = ""; -/******/ -/******/ // Load entry module and return exports -/******/ return __nested_webpack_require_570__(__nested_webpack_require_570__.s = 3); -/******/ }) -/************************************************************************/ -/******/ ([ -/* 0 */ -/***/ (function(module, exports, __nested_webpack_require_2847__) { - -function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } - -/* eslint-env commonjs, browser */ - -var RushaCore = __nested_webpack_require_2847__(5); - -var _require = __nested_webpack_require_2847__(1), - toHex = _require.toHex, - ceilHeapSize = _require.ceilHeapSize; - -var conv = __nested_webpack_require_2847__(6); - -// Calculate the length of buffer that the sha1 routine uses -// including the padding. -var padlen = function (len) { - for (len += 9; len % 64 > 0; len += 1) {} - return len; -}; - -var padZeroes = function (bin, len) { - var h8 = new Uint8Array(bin.buffer); - var om = len % 4, - align = len - om; - switch (om) { - case 0: - h8[align + 3] = 0; - case 1: - h8[align + 2] = 0; - case 2: - h8[align + 1] = 0; - case 3: - h8[align + 0] = 0; - } - for (var i = (len >> 2) + 1; i < bin.length; i++) { - bin[i] = 0; - } -}; - -var padData = function (bin, chunkLen, msgLen) { - bin[chunkLen >> 2] |= 0x80 << 24 - (chunkLen % 4 << 3); - // To support msgLen >= 2 GiB, use a float division when computing the - // high 32-bits of the big-endian message length in bits. - bin[((chunkLen >> 2) + 2 & ~0x0f) + 14] = msgLen / (1 << 29) | 0; - bin[((chunkLen >> 2) + 2 & ~0x0f) + 15] = msgLen << 3; -}; - -var getRawDigest = function (heap, padMaxChunkLen) { - var io = new Int32Array(heap, padMaxChunkLen + 320, 5); - var out = new Int32Array(5); - var arr = new DataView(out.buffer); - arr.setInt32(0, io[0], false); - arr.setInt32(4, io[1], false); - arr.setInt32(8, io[2], false); - arr.setInt32(12, io[3], false); - arr.setInt32(16, io[4], false); - return out; -}; - -var Rusha = function () { - function Rusha(chunkSize) { - _classCallCheck(this, Rusha); - - chunkSize = chunkSize || 64 * 1024; - if (chunkSize % 64 > 0) { - throw new Error('Chunk size must be a multiple of 128 bit'); - } - this._offset = 0; - this._maxChunkLen = chunkSize; - this._padMaxChunkLen = padlen(chunkSize); - // The size of the heap is the sum of: - // 1. The padded input message size - // 2. The extended space the algorithm needs (320 byte) - // 3. The 160 bit state the algoritm uses - this._heap = new ArrayBuffer(ceilHeapSize(this._padMaxChunkLen + 320 + 20)); - this._h32 = new Int32Array(this._heap); - this._h8 = new Int8Array(this._heap); - this._core = new RushaCore({ Int32Array: Int32Array }, {}, this._heap); - } - - Rusha.prototype._initState = function _initState(heap, padMsgLen) { - this._offset = 0; - var io = new Int32Array(heap, padMsgLen + 320, 5); - io[0] = 1732584193; - io[1] = -271733879; - io[2] = -1732584194; - io[3] = 271733878; - io[4] = -1009589776; - }; - - Rusha.prototype._padChunk = function _padChunk(chunkLen, msgLen) { - var padChunkLen = padlen(chunkLen); - var view = new Int32Array(this._heap, 0, padChunkLen >> 2); - padZeroes(view, chunkLen); - padData(view, chunkLen, msgLen); - return padChunkLen; - }; - - Rusha.prototype._write = function _write(data, chunkOffset, chunkLen, off) { - conv(data, this._h8, this._h32, chunkOffset, chunkLen, off || 0); - }; - - Rusha.prototype._coreCall = function _coreCall(data, chunkOffset, chunkLen, msgLen, finalize) { - var padChunkLen = chunkLen; - this._write(data, chunkOffset, chunkLen); - if (finalize) { - padChunkLen = this._padChunk(chunkLen, msgLen); - } - this._core.hash(padChunkLen, this._padMaxChunkLen); - }; - - Rusha.prototype.rawDigest = function rawDigest(str) { - var msgLen = str.byteLength || str.length || str.size || 0; - this._initState(this._heap, this._padMaxChunkLen); - var chunkOffset = 0, - chunkLen = this._maxChunkLen; - for (chunkOffset = 0; msgLen > chunkOffset + chunkLen; chunkOffset += chunkLen) { - this._coreCall(str, chunkOffset, chunkLen, msgLen, false); - } - this._coreCall(str, chunkOffset, msgLen - chunkOffset, msgLen, true); - return getRawDigest(this._heap, this._padMaxChunkLen); - }; - - Rusha.prototype.digest = function digest(str) { - return toHex(this.rawDigest(str).buffer); - }; - - Rusha.prototype.digestFromString = function digestFromString(str) { - return this.digest(str); - }; - - Rusha.prototype.digestFromBuffer = function digestFromBuffer(str) { - return this.digest(str); - }; - - Rusha.prototype.digestFromArrayBuffer = function digestFromArrayBuffer(str) { - return this.digest(str); - }; - - Rusha.prototype.resetState = function resetState() { - this._initState(this._heap, this._padMaxChunkLen); - return this; - }; - - Rusha.prototype.append = function append(chunk) { - var chunkOffset = 0; - var chunkLen = chunk.byteLength || chunk.length || chunk.size || 0; - var turnOffset = this._offset % this._maxChunkLen; - var inputLen = void 0; - - this._offset += chunkLen; - while (chunkOffset < chunkLen) { - inputLen = Math.min(chunkLen - chunkOffset, this._maxChunkLen - turnOffset); - this._write(chunk, chunkOffset, inputLen, turnOffset); - turnOffset += inputLen; - chunkOffset += inputLen; - if (turnOffset === this._maxChunkLen) { - this._core.hash(this._maxChunkLen, this._padMaxChunkLen); - turnOffset = 0; - } - } - return this; - }; - - Rusha.prototype.getState = function getState() { - var turnOffset = this._offset % this._maxChunkLen; - var heap = void 0; - if (!turnOffset) { - var io = new Int32Array(this._heap, this._padMaxChunkLen + 320, 5); - heap = io.buffer.slice(io.byteOffset, io.byteOffset + io.byteLength); - } else { - heap = this._heap.slice(0); - } - return { - offset: this._offset, - heap: heap - }; - }; - - Rusha.prototype.setState = function setState(state) { - this._offset = state.offset; - if (state.heap.byteLength === 20) { - var io = new Int32Array(this._heap, this._padMaxChunkLen + 320, 5); - io.set(new Int32Array(state.heap)); - } else { - this._h32.set(new Int32Array(state.heap)); - } - return this; - }; - - Rusha.prototype.rawEnd = function rawEnd() { - var msgLen = this._offset; - var chunkLen = msgLen % this._maxChunkLen; - var padChunkLen = this._padChunk(chunkLen, msgLen); - this._core.hash(padChunkLen, this._padMaxChunkLen); - var result = getRawDigest(this._heap, this._padMaxChunkLen); - this._initState(this._heap, this._padMaxChunkLen); - return result; - }; - - Rusha.prototype.end = function end() { - return toHex(this.rawEnd().buffer); - }; - - return Rusha; -}(); - -module.exports = Rusha; -module.exports._core = RushaCore; - -/***/ }), -/* 1 */ -/***/ (function(module, exports) { - -/* eslint-env commonjs, browser */ - -// -// toHex -// - -var precomputedHex = new Array(256); -for (var i = 0; i < 256; i++) { - precomputedHex[i] = (i < 0x10 ? '0' : '') + i.toString(16); -} - -module.exports.toHex = function (arrayBuffer) { - var binarray = new Uint8Array(arrayBuffer); - var res = new Array(arrayBuffer.byteLength); - for (var _i = 0; _i < res.length; _i++) { - res[_i] = precomputedHex[binarray[_i]]; - } - return res.join(''); -}; - -// -// ceilHeapSize -// - -module.exports.ceilHeapSize = function (v) { - // The asm.js spec says: - // The heap object's byteLength must be either - // 2^n for n in [12, 24) or 2^24 * n for n ≥ 1. - // Also, byteLengths smaller than 2^16 are deprecated. - var p = 0; - // If v is smaller than 2^16, the smallest possible solution - // is 2^16. - if (v <= 65536) return 65536; - // If v < 2^24, we round up to 2^n, - // otherwise we round up to 2^24 * n. - if (v < 16777216) { - for (p = 1; p < v; p = p << 1) {} - } else { - for (p = 16777216; p < v; p += 16777216) {} - } - return p; -}; - -// -// isDedicatedWorkerScope -// - -module.exports.isDedicatedWorkerScope = function (self) { - var isRunningInWorker = 'WorkerGlobalScope' in self && self instanceof self.WorkerGlobalScope; - var isRunningInSharedWorker = 'SharedWorkerGlobalScope' in self && self instanceof self.SharedWorkerGlobalScope; - var isRunningInServiceWorker = 'ServiceWorkerGlobalScope' in self && self instanceof self.ServiceWorkerGlobalScope; - - // Detects whether we run inside a dedicated worker or not. - // - // We can't just check for `DedicatedWorkerGlobalScope`, since IE11 - // has a bug where it only supports `WorkerGlobalScope`. - // - // Therefore, we consider us as running inside a dedicated worker - // when we are running inside a worker, but not in a shared or service worker. - // - // When new types of workers are introduced, we will need to adjust this code. - return isRunningInWorker && !isRunningInSharedWorker && !isRunningInServiceWorker; -}; - -/***/ }), -/* 2 */ -/***/ (function(module, exports, __nested_webpack_require_11492__) { - -/* eslint-env commonjs, worker */ - -module.exports = function () { - var Rusha = __nested_webpack_require_11492__(0); - - var hashData = function (hasher, data, cb) { - try { - return cb(null, hasher.digest(data)); - } catch (e) { - return cb(e); - } - }; - - var hashFile = function (hasher, readTotal, blockSize, file, cb) { - var reader = new self.FileReader(); - reader.onloadend = function onloadend() { - if (reader.error) { - return cb(reader.error); - } - var buffer = reader.result; - readTotal += reader.result.byteLength; - try { - hasher.append(buffer); - } catch (e) { - cb(e); - return; - } - if (readTotal < file.size) { - hashFile(hasher, readTotal, blockSize, file, cb); - } else { - cb(null, hasher.end()); - } - }; - reader.readAsArrayBuffer(file.slice(readTotal, readTotal + blockSize)); - }; - - var workerBehaviourEnabled = true; - - self.onmessage = function (event) { - if (!workerBehaviourEnabled) { - return; - } - - var data = event.data.data, - file = event.data.file, - id = event.data.id; - if (typeof id === 'undefined') return; - if (!file && !data) return; - var blockSize = event.data.blockSize || 4 * 1024 * 1024; - var hasher = new Rusha(blockSize); - hasher.resetState(); - var done = function (err, hash) { - if (!err) { - self.postMessage({ id: id, hash: hash }); - } else { - self.postMessage({ id: id, error: err.name }); - } - }; - if (data) hashData(hasher, data, done); - if (file) hashFile(hasher, 0, blockSize, file, done); - }; - - return function () { - workerBehaviourEnabled = false; - }; -}; - -/***/ }), -/* 3 */ -/***/ (function(module, exports, __nested_webpack_require_13254__) { - -/* eslint-env commonjs, browser */ - -var work = __nested_webpack_require_13254__(4); -var Rusha = __nested_webpack_require_13254__(0); -var createHash = __nested_webpack_require_13254__(7); -var runWorker = __nested_webpack_require_13254__(2); - -var _require = __nested_webpack_require_13254__(1), - isDedicatedWorkerScope = _require.isDedicatedWorkerScope; - -var isRunningInDedicatedWorker = typeof self !== 'undefined' && isDedicatedWorkerScope(self); - -Rusha.disableWorkerBehaviour = isRunningInDedicatedWorker ? runWorker() : function () {}; - -Rusha.createWorker = function () { - var worker = work(/*require.resolve*/(2)); - var terminate = worker.terminate; - worker.terminate = function () { - URL.revokeObjectURL(worker.objectURL); - terminate.call(worker); - }; - return worker; -}; - -Rusha.createHash = createHash; - -module.exports = Rusha; - -/***/ }), -/* 4 */ -/***/ (function(module, exports, __nested_webpack_require_14111__) { - -function webpackBootstrapFunc (modules) { -/******/ // The module cache -/******/ var installedModules = {}; - -/******/ // The require function -/******/ function __nested_webpack_require_14289__(moduleId) { - -/******/ // Check if module is in cache -/******/ if(installedModules[moduleId]) -/******/ return installedModules[moduleId].exports; - -/******/ // Create a new module (and put it into the cache) -/******/ var module = installedModules[moduleId] = { -/******/ i: moduleId, -/******/ l: false, -/******/ exports: {} -/******/ }; - -/******/ // Execute the module function -/******/ modules[moduleId].call(module.exports, module, module.exports, __nested_webpack_require_14289__); - -/******/ // Flag the module as loaded -/******/ module.l = true; - -/******/ // Return the exports of the module -/******/ return module.exports; -/******/ } - -/******/ // expose the modules object (__webpack_modules__) -/******/ __nested_webpack_require_14289__.m = modules; - -/******/ // expose the module cache -/******/ __nested_webpack_require_14289__.c = installedModules; - -/******/ // identity function for calling harmony imports with the correct context -/******/ __nested_webpack_require_14289__.i = function(value) { return value; }; - -/******/ // define getter function for harmony exports -/******/ __nested_webpack_require_14289__.d = function(exports, name, getter) { -/******/ if(!__nested_webpack_require_14289__.o(exports, name)) { -/******/ Object.defineProperty(exports, name, { -/******/ configurable: false, -/******/ enumerable: true, -/******/ get: getter -/******/ }); -/******/ } -/******/ }; - -/******/ // define __esModule on exports -/******/ __nested_webpack_require_14289__.r = function(exports) { -/******/ Object.defineProperty(exports, '__esModule', { value: true }); -/******/ }; - -/******/ // getDefaultExport function for compatibility with non-harmony modules -/******/ __nested_webpack_require_14289__.n = function(module) { -/******/ var getter = module && module.__esModule ? -/******/ function getDefault() { return module['default']; } : -/******/ function getModuleExports() { return module; }; -/******/ __nested_webpack_require_14289__.d(getter, 'a', getter); -/******/ return getter; -/******/ }; - -/******/ // Object.prototype.hasOwnProperty.call -/******/ __nested_webpack_require_14289__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); }; - -/******/ // __webpack_public_path__ -/******/ __nested_webpack_require_14289__.p = "/"; - -/******/ // on error function for async loading -/******/ __nested_webpack_require_14289__.oe = function(err) { console.error(err); throw err; }; - - var f = __nested_webpack_require_14289__(__nested_webpack_require_14289__.s = ENTRY_MODULE) - return f.default || f // try to call default if defined to also support babel esmodule exports -} - -var moduleNameReqExp = '[\\.|\\-|\\+|\\w|\/|@]+' -var dependencyRegExp = '\\((\/\\*.*?\\*\/)?\s?.*?(' + moduleNameReqExp + ').*?\\)' // additional chars when output.pathinfo is true - -// http://stackoverflow.com/a/2593661/130442 -function quoteRegExp (str) { - return (str + '').replace(/[.?*+^$[\]\\(){}|-]/g, '\\$&') -} - -function getModuleDependencies (sources, module, queueName) { - var retval = {} - retval[queueName] = [] - - var fnString = module.toString() - var wrapperSignature = fnString.match(/^function\s?\(\w+,\s*\w+,\s*(\w+)\)/) - if (!wrapperSignature) return retval - var webpackRequireName = wrapperSignature[1] - - // main bundle deps - var re = new RegExp('(\\\\n|\\W)' + quoteRegExp(webpackRequireName) + dependencyRegExp, 'g') - var match - while ((match = re.exec(fnString))) { - if (match[3] === 'dll-reference') continue - retval[queueName].push(match[3]) - } - - // dll deps - re = new RegExp('\\(' + quoteRegExp(webpackRequireName) + '\\("(dll-reference\\s(' + moduleNameReqExp + '))"\\)\\)' + dependencyRegExp, 'g') - while ((match = re.exec(fnString))) { - if (!sources[match[2]]) { - retval[queueName].push(match[1]) - sources[match[2]] = __nested_webpack_require_14111__(match[1]).m - } - retval[match[2]] = retval[match[2]] || [] - retval[match[2]].push(match[4]) - } - - return retval -} - -function hasValuesInQueues (queues) { - var keys = Object.keys(queues) - return keys.reduce(function (hasValues, key) { - return hasValues || queues[key].length > 0 - }, false) -} - -function getRequiredModules (sources, moduleId) { - var modulesQueue = { - main: [moduleId] - } - var requiredModules = { - main: [] - } - var seenModules = { - main: {} - } - - while (hasValuesInQueues(modulesQueue)) { - var queues = Object.keys(modulesQueue) - for (var i = 0; i < queues.length; i++) { - var queueName = queues[i] - var queue = modulesQueue[queueName] - var moduleToCheck = queue.pop() - seenModules[queueName] = seenModules[queueName] || {} - if (seenModules[queueName][moduleToCheck] || !sources[queueName][moduleToCheck]) continue - seenModules[queueName][moduleToCheck] = true - requiredModules[queueName] = requiredModules[queueName] || [] - requiredModules[queueName].push(moduleToCheck) - var newModules = getModuleDependencies(sources, sources[queueName][moduleToCheck], queueName) - var newModulesKeys = Object.keys(newModules) - for (var j = 0; j < newModulesKeys.length; j++) { - modulesQueue[newModulesKeys[j]] = modulesQueue[newModulesKeys[j]] || [] - modulesQueue[newModulesKeys[j]] = modulesQueue[newModulesKeys[j]].concat(newModules[newModulesKeys[j]]) - } - } - } - - return requiredModules -} - -module.exports = function (moduleId, options) { - options = options || {} - var sources = { - main: __nested_webpack_require_14111__.m - } - - var requiredModules = options.all ? { main: Object.keys(sources) } : getRequiredModules(sources, moduleId) - - var src = '' - - Object.keys(requiredModules).filter(function (m) { return m !== 'main' }).forEach(function (module) { - var entryModule = 0 - while (requiredModules[module][entryModule]) { - entryModule++ - } - requiredModules[module].push(entryModule) - sources[module][entryModule] = '(function(module, exports, __webpack_require__) { module.exports = __webpack_require__; })' - src = src + 'var ' + module + ' = (' + webpackBootstrapFunc.toString().replace('ENTRY_MODULE', JSON.stringify(entryModule)) + ')({' + requiredModules[module].map(function (id) { return '' + JSON.stringify(id) + ': ' + sources[module][id].toString() }).join(',') + '});\n' - }) - - src = src + '(' + webpackBootstrapFunc.toString().replace('ENTRY_MODULE', JSON.stringify(moduleId)) + ')({' + requiredModules.main.map(function (id) { return '' + JSON.stringify(id) + ': ' + sources.main[id].toString() }).join(',') + '})(self);' - - var blob = new window.Blob([src], { type: 'text/javascript' }) - if (options.bare) { return blob } - - var URL = window.URL || window.webkitURL || window.mozURL || window.msURL - - var workerUrl = URL.createObjectURL(blob) - var worker = new window.Worker(workerUrl) - worker.objectURL = workerUrl - - return worker -} - - -/***/ }), -/* 5 */ -/***/ (function(module, exports) { - -// The low-level RushCore module provides the heart of Rusha, -// a high-speed sha1 implementation working on an Int32Array heap. -// At first glance, the implementation seems complicated, however -// with the SHA1 spec at hand, it is obvious this almost a textbook -// implementation that has a few functions hand-inlined and a few loops -// hand-unrolled. -module.exports = function RushaCore(stdlib$840, foreign$841, heap$842) { - 'use asm'; - var H$843 = new stdlib$840.Int32Array(heap$842); - function hash$844(k$845, x$846) { - // k in bytes - k$845 = k$845 | 0; - x$846 = x$846 | 0; - var i$847 = 0, j$848 = 0, y0$849 = 0, z0$850 = 0, y1$851 = 0, z1$852 = 0, y2$853 = 0, z2$854 = 0, y3$855 = 0, z3$856 = 0, y4$857 = 0, z4$858 = 0, t0$859 = 0, t1$860 = 0; - y0$849 = H$843[x$846 + 320 >> 2] | 0; - y1$851 = H$843[x$846 + 324 >> 2] | 0; - y2$853 = H$843[x$846 + 328 >> 2] | 0; - y3$855 = H$843[x$846 + 332 >> 2] | 0; - y4$857 = H$843[x$846 + 336 >> 2] | 0; - for (i$847 = 0; (i$847 | 0) < (k$845 | 0); i$847 = i$847 + 64 | 0) { - z0$850 = y0$849; - z1$852 = y1$851; - z2$854 = y2$853; - z3$856 = y3$855; - z4$858 = y4$857; - for (j$848 = 0; (j$848 | 0) < 64; j$848 = j$848 + 4 | 0) { - t1$860 = H$843[i$847 + j$848 >> 2] | 0; - t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | ~y1$851 & y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1518500249 | 0) | 0; - y4$857 = y3$855; - y3$855 = y2$853; - y2$853 = y1$851 << 30 | y1$851 >>> 2; - y1$851 = y0$849; - y0$849 = t0$859; - H$843[k$845 + j$848 >> 2] = t1$860; - } - for (j$848 = k$845 + 64 | 0; (j$848 | 0) < (k$845 + 80 | 0); j$848 = j$848 + 4 | 0) { - t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31; - t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | ~y1$851 & y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1518500249 | 0) | 0; - y4$857 = y3$855; - y3$855 = y2$853; - y2$853 = y1$851 << 30 | y1$851 >>> 2; - y1$851 = y0$849; - y0$849 = t0$859; - H$843[j$848 >> 2] = t1$860; - } - for (j$848 = k$845 + 80 | 0; (j$848 | 0) < (k$845 + 160 | 0); j$848 = j$848 + 4 | 0) { - t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31; - t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 ^ y2$853 ^ y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1859775393 | 0) | 0; - y4$857 = y3$855; - y3$855 = y2$853; - y2$853 = y1$851 << 30 | y1$851 >>> 2; - y1$851 = y0$849; - y0$849 = t0$859; - H$843[j$848 >> 2] = t1$860; - } - for (j$848 = k$845 + 160 | 0; (j$848 | 0) < (k$845 + 240 | 0); j$848 = j$848 + 4 | 0) { - t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31; - t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | y1$851 & y3$855 | y2$853 & y3$855) | 0) + ((t1$860 + y4$857 | 0) - 1894007588 | 0) | 0; - y4$857 = y3$855; - y3$855 = y2$853; - y2$853 = y1$851 << 30 | y1$851 >>> 2; - y1$851 = y0$849; - y0$849 = t0$859; - H$843[j$848 >> 2] = t1$860; - } - for (j$848 = k$845 + 240 | 0; (j$848 | 0) < (k$845 + 320 | 0); j$848 = j$848 + 4 | 0) { - t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31; - t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 ^ y2$853 ^ y3$855) | 0) + ((t1$860 + y4$857 | 0) - 899497514 | 0) | 0; - y4$857 = y3$855; - y3$855 = y2$853; - y2$853 = y1$851 << 30 | y1$851 >>> 2; - y1$851 = y0$849; - y0$849 = t0$859; - H$843[j$848 >> 2] = t1$860; - } - y0$849 = y0$849 + z0$850 | 0; - y1$851 = y1$851 + z1$852 | 0; - y2$853 = y2$853 + z2$854 | 0; - y3$855 = y3$855 + z3$856 | 0; - y4$857 = y4$857 + z4$858 | 0; - } - H$843[x$846 + 320 >> 2] = y0$849; - H$843[x$846 + 324 >> 2] = y1$851; - H$843[x$846 + 328 >> 2] = y2$853; - H$843[x$846 + 332 >> 2] = y3$855; - H$843[x$846 + 336 >> 2] = y4$857; - } - return { hash: hash$844 }; -}; - -/***/ }), -/* 6 */ -/***/ (function(module, exports) { - -var _this = this; - -/* eslint-env commonjs, browser */ - -var reader = void 0; -if (typeof self !== 'undefined' && typeof self.FileReaderSync !== 'undefined') { - reader = new self.FileReaderSync(); -} - -// Convert a binary string and write it to the heap. -// A binary string is expected to only contain char codes < 256. -var convStr = function (str, H8, H32, start, len, off) { - var i = void 0, - om = off % 4, - lm = (len + om) % 4, - j = len - lm; - switch (om) { - case 0: - H8[off] = str.charCodeAt(start + 3); - case 1: - H8[off + 1 - (om << 1) | 0] = str.charCodeAt(start + 2); - case 2: - H8[off + 2 - (om << 1) | 0] = str.charCodeAt(start + 1); - case 3: - H8[off + 3 - (om << 1) | 0] = str.charCodeAt(start); - } - if (len < lm + (4 - om)) { - return; - } - for (i = 4 - om; i < j; i = i + 4 | 0) { - H32[off + i >> 2] = str.charCodeAt(start + i) << 24 | str.charCodeAt(start + i + 1) << 16 | str.charCodeAt(start + i + 2) << 8 | str.charCodeAt(start + i + 3); - } - switch (lm) { - case 3: - H8[off + j + 1 | 0] = str.charCodeAt(start + j + 2); - case 2: - H8[off + j + 2 | 0] = str.charCodeAt(start + j + 1); - case 1: - H8[off + j + 3 | 0] = str.charCodeAt(start + j); - } -}; - -// Convert a buffer or array and write it to the heap. -// The buffer or array is expected to only contain elements < 256. -var convBuf = function (buf, H8, H32, start, len, off) { - var i = void 0, - om = off % 4, - lm = (len + om) % 4, - j = len - lm; - switch (om) { - case 0: - H8[off] = buf[start + 3]; - case 1: - H8[off + 1 - (om << 1) | 0] = buf[start + 2]; - case 2: - H8[off + 2 - (om << 1) | 0] = buf[start + 1]; - case 3: - H8[off + 3 - (om << 1) | 0] = buf[start]; - } - if (len < lm + (4 - om)) { - return; - } - for (i = 4 - om; i < j; i = i + 4 | 0) { - H32[off + i >> 2 | 0] = buf[start + i] << 24 | buf[start + i + 1] << 16 | buf[start + i + 2] << 8 | buf[start + i + 3]; - } - switch (lm) { - case 3: - H8[off + j + 1 | 0] = buf[start + j + 2]; - case 2: - H8[off + j + 2 | 0] = buf[start + j + 1]; - case 1: - H8[off + j + 3 | 0] = buf[start + j]; - } -}; - -var convBlob = function (blob, H8, H32, start, len, off) { - var i = void 0, - om = off % 4, - lm = (len + om) % 4, - j = len - lm; - var buf = new Uint8Array(reader.readAsArrayBuffer(blob.slice(start, start + len))); - switch (om) { - case 0: - H8[off] = buf[3]; - case 1: - H8[off + 1 - (om << 1) | 0] = buf[2]; - case 2: - H8[off + 2 - (om << 1) | 0] = buf[1]; - case 3: - H8[off + 3 - (om << 1) | 0] = buf[0]; - } - if (len < lm + (4 - om)) { - return; - } - for (i = 4 - om; i < j; i = i + 4 | 0) { - H32[off + i >> 2 | 0] = buf[i] << 24 | buf[i + 1] << 16 | buf[i + 2] << 8 | buf[i + 3]; - } - switch (lm) { - case 3: - H8[off + j + 1 | 0] = buf[j + 2]; - case 2: - H8[off + j + 2 | 0] = buf[j + 1]; - case 1: - H8[off + j + 3 | 0] = buf[j]; - } -}; - -module.exports = function (data, H8, H32, start, len, off) { - if (typeof data === 'string') { - return convStr(data, H8, H32, start, len, off); - } - if (data instanceof Array) { - return convBuf(data, H8, H32, start, len, off); - } - // Safely doing a Buffer check using "this" to avoid Buffer polyfill to be included in the dist - if (_this && _this.Buffer && _this.Buffer.isBuffer(data)) { - return convBuf(data, H8, H32, start, len, off); - } - if (data instanceof ArrayBuffer) { - return convBuf(new Uint8Array(data), H8, H32, start, len, off); - } - if (data.buffer instanceof ArrayBuffer) { - return convBuf(new Uint8Array(data.buffer, data.byteOffset, data.byteLength), H8, H32, start, len, off); - } - if (data instanceof Blob) { - return convBlob(data, H8, H32, start, len, off); - } - throw new Error('Unsupported data type.'); -}; - -/***/ }), -/* 7 */ -/***/ (function(module, exports, __nested_webpack_require_30231__) { - -var _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if ("value" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }(); - -function _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError("Cannot call a class as a function"); } } - -/* eslint-env commonjs, browser */ - -var Rusha = __nested_webpack_require_30231__(0); - -var _require = __nested_webpack_require_30231__(1), - toHex = _require.toHex; - -var Hash = function () { - function Hash() { - _classCallCheck(this, Hash); - - this._rusha = new Rusha(); - this._rusha.resetState(); - } - - Hash.prototype.update = function update(data) { - this._rusha.append(data); - return this; - }; - - Hash.prototype.digest = function digest(encoding) { - var digest = this._rusha.rawEnd().buffer; - if (!encoding) { - return digest; - } - if (encoding === 'hex') { - return toHex(digest); - } - throw new Error('unsupported digest encoding'); - }; - - _createClass(Hash, [{ - key: 'state', - get: function () { - return this._rusha.getState(); - }, - set: function (state) { - this._rusha.setState(state); - } - }]); - - return Hash; -}(); - -module.exports = function () { - return new Hash(); -}; - -/***/ }) -/******/ ]); -}); - -/***/ }), - -/***/ "./node_modules/safari-14-idb-fix/dist/esm/index.js": -/*!**********************************************************!*\ - !*** ./node_modules/safari-14-idb-fix/dist/esm/index.js ***! - \**********************************************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "default": () => (__WEBPACK_DEFAULT_EXPORT__) -/* harmony export */ }); -/** - * https://bugs.webkit.org/show_bug.cgi?id=226547 - * Safari has a horrible bug where IDB requests can hang while the browser is starting up. - * The only solution is to keep nudging it until it's awake. - * This probably creates garbage, but garbage is better than totally failing. - */ -function idbReady() { - const isSafari = !navigator.userAgentData && - /Safari\//.test(navigator.userAgent) && - !/Chrom(e|ium)\//.test(navigator.userAgent); - // No point putting other browsers or older versions of Safari through this mess. - if (!isSafari || !indexedDB.databases) - return Promise.resolve(); - let intervalId; - return new Promise((resolve) => { - const tryIdb = () => indexedDB.databases().finally(resolve); - intervalId = setInterval(tryIdb, 100); - tryIdb(); - }).finally(() => clearInterval(intervalId)); -} - -/* harmony default export */ const __WEBPACK_DEFAULT_EXPORT__ = (idbReady); - - -/***/ }), - -/***/ "./node_modules/safe-buffer/index.js": -/*!*******************************************!*\ - !*** ./node_modules/safe-buffer/index.js ***! - \*******************************************/ -/***/ ((module, exports, __webpack_require__) => { - -/*! safe-buffer. MIT License. Feross Aboukhadijeh */ -/* eslint-disable node/no-deprecated-api */ -var buffer = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js") -var Buffer = buffer.Buffer - -// alternative to using Object.keys for old browsers -function copyProps (src, dst) { - for (var key in src) { - dst[key] = src[key] - } -} -if (Buffer.from && Buffer.alloc && Buffer.allocUnsafe && Buffer.allocUnsafeSlow) { - module.exports = buffer -} else { - // Copy properties from require('buffer') - copyProps(buffer, exports) - exports.Buffer = SafeBuffer -} - -function SafeBuffer (arg, encodingOrOffset, length) { - return Buffer(arg, encodingOrOffset, length) -} - -SafeBuffer.prototype = Object.create(Buffer.prototype) - -// Copy static methods from Buffer -copyProps(Buffer, SafeBuffer) - -SafeBuffer.from = function (arg, encodingOrOffset, length) { - if (typeof arg === 'number') { - throw new TypeError('Argument must not be a number') - } - return Buffer(arg, encodingOrOffset, length) -} - -SafeBuffer.alloc = function (size, fill, encoding) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - var buf = Buffer(size) - if (fill !== undefined) { - if (typeof encoding === 'string') { - buf.fill(fill, encoding) - } else { - buf.fill(fill) - } - } else { - buf.fill(0) - } - return buf -} - -SafeBuffer.allocUnsafe = function (size) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - return Buffer(size) -} - -SafeBuffer.allocUnsafeSlow = function (size) { - if (typeof size !== 'number') { - throw new TypeError('Argument must be a number') - } - return buffer.SlowBuffer(size) -} - - -/***/ }), - -/***/ "./node_modules/safer-buffer/safer.js": -/*!********************************************!*\ - !*** ./node_modules/safer-buffer/safer.js ***! - \********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -/* eslint-disable node/no-deprecated-api */ - - - -var buffer = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js") -var Buffer = buffer.Buffer - -var safer = {} - -var key - -for (key in buffer) { - if (!buffer.hasOwnProperty(key)) continue - if (key === 'SlowBuffer' || key === 'Buffer') continue - safer[key] = buffer[key] -} - -var Safer = safer.Buffer = {} -for (key in Buffer) { - if (!Buffer.hasOwnProperty(key)) continue - if (key === 'allocUnsafe' || key === 'allocUnsafeSlow') continue - Safer[key] = Buffer[key] -} - -safer.Buffer.prototype = Buffer.prototype - -if (!Safer.from || Safer.from === Uint8Array.from) { - Safer.from = function (value, encodingOrOffset, length) { - if (typeof value === 'number') { - throw new TypeError('The "value" argument must not be of type number. Received type ' + typeof value) - } - if (value && typeof value.length === 'undefined') { - throw new TypeError('The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type ' + typeof value) - } - return Buffer(value, encodingOrOffset, length) - } -} - -if (!Safer.alloc) { - Safer.alloc = function (size, fill, encoding) { - if (typeof size !== 'number') { - throw new TypeError('The "size" argument must be of type number. Received type ' + typeof size) - } - if (size < 0 || size >= 2 * (1 << 30)) { - throw new RangeError('The value "' + size + '" is invalid for option "size"') - } - var buf = Buffer(size) - if (!fill || fill.length === 0) { - buf.fill(0) - } else if (typeof encoding === 'string') { - buf.fill(fill, encoding) - } else { - buf.fill(fill) - } - return buf - } -} - -if (!safer.kStringMaxLength) { - try { - safer.kStringMaxLength = process.binding('buffer').kStringMaxLength - } catch (e) { - // we can't determine kStringMaxLength in environments where process.binding - // is unsupported, so let's not set it - } -} - -if (!safer.constants) { - safer.constants = { - MAX_LENGTH: safer.kMaxLength - } - if (safer.kStringMaxLength) { - safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength - } -} - -module.exports = safer - - -/***/ }), - -/***/ "./node_modules/sha.js/hash.js": -/*!*************************************!*\ - !*** ./node_modules/sha.js/hash.js ***! - \*************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -// prototype class for hash functions -function Hash (blockSize, finalSize) { - this._block = Buffer.alloc(blockSize) - this._finalSize = finalSize - this._blockSize = blockSize - this._len = 0 -} - -Hash.prototype.update = function (data, enc) { - if (typeof data === 'string') { - enc = enc || 'utf8' - data = Buffer.from(data, enc) - } - - var block = this._block - var blockSize = this._blockSize - var length = data.length - var accum = this._len - - for (var offset = 0; offset < length;) { - var assigned = accum % blockSize - var remainder = Math.min(length - offset, blockSize - assigned) - - for (var i = 0; i < remainder; i++) { - block[assigned + i] = data[offset + i] - } - - accum += remainder - offset += remainder - - if ((accum % blockSize) === 0) { - this._update(block) - } - } - - this._len += length - return this -} - -Hash.prototype.digest = function (enc) { - var rem = this._len % this._blockSize - - this._block[rem] = 0x80 - - // zero (rem + 1) trailing bits, where (rem + 1) is the smallest - // non-negative solution to the equation (length + 1 + (rem + 1)) === finalSize mod blockSize - this._block.fill(0, rem + 1) - - if (rem >= this._finalSize) { - this._update(this._block) - this._block.fill(0) - } - - var bits = this._len * 8 - - // uint32 - if (bits <= 0xffffffff) { - this._block.writeUInt32BE(bits, this._blockSize - 4) - - // uint64 - } else { - var lowBits = (bits & 0xffffffff) >>> 0 - var highBits = (bits - lowBits) / 0x100000000 - - this._block.writeUInt32BE(highBits, this._blockSize - 8) - this._block.writeUInt32BE(lowBits, this._blockSize - 4) - } - - this._update(this._block) - var hash = this._hash() - - return enc ? hash.toString(enc) : hash -} - -Hash.prototype._update = function () { - throw new Error('_update must be implemented by subclass') -} - -module.exports = Hash - - -/***/ }), - -/***/ "./node_modules/sha.js/index.js": -/*!**************************************!*\ - !*** ./node_modules/sha.js/index.js ***! - \**************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var exports = module.exports = function SHA (algorithm) { - algorithm = algorithm.toLowerCase() - - var Algorithm = exports[algorithm] - if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)') - - return new Algorithm() -} - -exports.sha = __webpack_require__(/*! ./sha */ "./node_modules/sha.js/sha.js") -exports.sha1 = __webpack_require__(/*! ./sha1 */ "./node_modules/sha.js/sha1.js") -exports.sha224 = __webpack_require__(/*! ./sha224 */ "./node_modules/sha.js/sha224.js") -exports.sha256 = __webpack_require__(/*! ./sha256 */ "./node_modules/sha.js/sha256.js") -exports.sha384 = __webpack_require__(/*! ./sha384 */ "./node_modules/sha.js/sha384.js") -exports.sha512 = __webpack_require__(/*! ./sha512 */ "./node_modules/sha.js/sha512.js") - - -/***/ }), - -/***/ "./node_modules/sha.js/sha.js": -/*!************************************!*\ - !*** ./node_modules/sha.js/sha.js ***! - \************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* - * A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined - * in FIPS PUB 180-1 - * This source code is derived from sha1.js of the same repository. - * The difference between SHA-0 and SHA-1 is just a bitwise rotate left - * operation was added. - */ - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var Hash = __webpack_require__(/*! ./hash */ "./node_modules/sha.js/hash.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var K = [ - 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0 -] - -var W = new Array(80) - -function Sha () { - this.init() - this._w = W - - Hash.call(this, 64, 56) -} - -inherits(Sha, Hash) - -Sha.prototype.init = function () { - this._a = 0x67452301 - this._b = 0xefcdab89 - this._c = 0x98badcfe - this._d = 0x10325476 - this._e = 0xc3d2e1f0 - - return this -} - -function rotl5 (num) { - return (num << 5) | (num >>> 27) -} - -function rotl30 (num) { - return (num << 30) | (num >>> 2) -} - -function ft (s, b, c, d) { - if (s === 0) return (b & c) | ((~b) & d) - if (s === 2) return (b & c) | (b & d) | (c & d) - return b ^ c ^ d -} - -Sha.prototype._update = function (M) { - var W = this._w - - var a = this._a | 0 - var b = this._b | 0 - var c = this._c | 0 - var d = this._d | 0 - var e = this._e | 0 - - for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4) - for (; i < 80; ++i) W[i] = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16] - - for (var j = 0; j < 80; ++j) { - var s = ~~(j / 20) - var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0 - - e = d - d = c - c = rotl30(b) - b = a - a = t - } - - this._a = (a + this._a) | 0 - this._b = (b + this._b) | 0 - this._c = (c + this._c) | 0 - this._d = (d + this._d) | 0 - this._e = (e + this._e) | 0 -} - -Sha.prototype._hash = function () { - var H = Buffer.allocUnsafe(20) - - H.writeInt32BE(this._a | 0, 0) - H.writeInt32BE(this._b | 0, 4) - H.writeInt32BE(this._c | 0, 8) - H.writeInt32BE(this._d | 0, 12) - H.writeInt32BE(this._e | 0, 16) - - return H -} - -module.exports = Sha - - -/***/ }), - -/***/ "./node_modules/sha.js/sha1.js": -/*!*************************************!*\ - !*** ./node_modules/sha.js/sha1.js ***! - \*************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* - * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined - * in FIPS PUB 180-1 - * Version 2.1a Copyright Paul Johnston 2000 - 2002. - * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet - * Distributed under the BSD License - * See http://pajhome.org.uk/crypt/md5 for details. - */ - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var Hash = __webpack_require__(/*! ./hash */ "./node_modules/sha.js/hash.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var K = [ - 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0 -] - -var W = new Array(80) - -function Sha1 () { - this.init() - this._w = W - - Hash.call(this, 64, 56) -} - -inherits(Sha1, Hash) - -Sha1.prototype.init = function () { - this._a = 0x67452301 - this._b = 0xefcdab89 - this._c = 0x98badcfe - this._d = 0x10325476 - this._e = 0xc3d2e1f0 - - return this -} - -function rotl1 (num) { - return (num << 1) | (num >>> 31) -} - -function rotl5 (num) { - return (num << 5) | (num >>> 27) -} - -function rotl30 (num) { - return (num << 30) | (num >>> 2) -} - -function ft (s, b, c, d) { - if (s === 0) return (b & c) | ((~b) & d) - if (s === 2) return (b & c) | (b & d) | (c & d) - return b ^ c ^ d -} - -Sha1.prototype._update = function (M) { - var W = this._w - - var a = this._a | 0 - var b = this._b | 0 - var c = this._c | 0 - var d = this._d | 0 - var e = this._e | 0 - - for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4) - for (; i < 80; ++i) W[i] = rotl1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]) - - for (var j = 0; j < 80; ++j) { - var s = ~~(j / 20) - var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0 - - e = d - d = c - c = rotl30(b) - b = a - a = t - } - - this._a = (a + this._a) | 0 - this._b = (b + this._b) | 0 - this._c = (c + this._c) | 0 - this._d = (d + this._d) | 0 - this._e = (e + this._e) | 0 -} - -Sha1.prototype._hash = function () { - var H = Buffer.allocUnsafe(20) - - H.writeInt32BE(this._a | 0, 0) - H.writeInt32BE(this._b | 0, 4) - H.writeInt32BE(this._c | 0, 8) - H.writeInt32BE(this._d | 0, 12) - H.writeInt32BE(this._e | 0, 16) - - return H -} - -module.exports = Sha1 - - -/***/ }), - -/***/ "./node_modules/sha.js/sha224.js": -/*!***************************************!*\ - !*** ./node_modules/sha.js/sha224.js ***! - \***************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/** - * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined - * in FIPS 180-2 - * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009. - * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet - * - */ - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var Sha256 = __webpack_require__(/*! ./sha256 */ "./node_modules/sha.js/sha256.js") -var Hash = __webpack_require__(/*! ./hash */ "./node_modules/sha.js/hash.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var W = new Array(64) - -function Sha224 () { - this.init() - - this._w = W // new Array(64) - - Hash.call(this, 64, 56) -} - -inherits(Sha224, Sha256) - -Sha224.prototype.init = function () { - this._a = 0xc1059ed8 - this._b = 0x367cd507 - this._c = 0x3070dd17 - this._d = 0xf70e5939 - this._e = 0xffc00b31 - this._f = 0x68581511 - this._g = 0x64f98fa7 - this._h = 0xbefa4fa4 - - return this -} - -Sha224.prototype._hash = function () { - var H = Buffer.allocUnsafe(28) - - H.writeInt32BE(this._a, 0) - H.writeInt32BE(this._b, 4) - H.writeInt32BE(this._c, 8) - H.writeInt32BE(this._d, 12) - H.writeInt32BE(this._e, 16) - H.writeInt32BE(this._f, 20) - H.writeInt32BE(this._g, 24) - - return H -} - -module.exports = Sha224 - - -/***/ }), - -/***/ "./node_modules/sha.js/sha256.js": -/*!***************************************!*\ - !*** ./node_modules/sha.js/sha256.js ***! - \***************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/** - * A JavaScript implementation of the Secure Hash Algorithm, SHA-256, as defined - * in FIPS 180-2 - * Version 2.2-beta Copyright Angel Marin, Paul Johnston 2000 - 2009. - * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet - * - */ - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var Hash = __webpack_require__(/*! ./hash */ "./node_modules/sha.js/hash.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var 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 -] - -var W = new Array(64) - -function Sha256 () { - this.init() - - this._w = W // new Array(64) - - Hash.call(this, 64, 56) -} - -inherits(Sha256, Hash) - -Sha256.prototype.init = function () { - this._a = 0x6a09e667 - this._b = 0xbb67ae85 - this._c = 0x3c6ef372 - this._d = 0xa54ff53a - this._e = 0x510e527f - this._f = 0x9b05688c - this._g = 0x1f83d9ab - this._h = 0x5be0cd19 - - return this -} - -function ch (x, y, z) { - return z ^ (x & (y ^ z)) -} - -function maj (x, y, z) { - return (x & y) | (z & (x | y)) -} - -function sigma0 (x) { - return (x >>> 2 | x << 30) ^ (x >>> 13 | x << 19) ^ (x >>> 22 | x << 10) -} - -function sigma1 (x) { - return (x >>> 6 | x << 26) ^ (x >>> 11 | x << 21) ^ (x >>> 25 | x << 7) -} - -function gamma0 (x) { - return (x >>> 7 | x << 25) ^ (x >>> 18 | x << 14) ^ (x >>> 3) -} - -function gamma1 (x) { - return (x >>> 17 | x << 15) ^ (x >>> 19 | x << 13) ^ (x >>> 10) -} - -Sha256.prototype._update = function (M) { - var W = this._w - - var a = this._a | 0 - var b = this._b | 0 - var c = this._c | 0 - var d = this._d | 0 - var e = this._e | 0 - var f = this._f | 0 - var g = this._g | 0 - var h = this._h | 0 - - for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4) - for (; i < 64; ++i) W[i] = (gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16]) | 0 - - for (var j = 0; j < 64; ++j) { - var T1 = (h + sigma1(e) + ch(e, f, g) + K[j] + W[j]) | 0 - var T2 = (sigma0(a) + maj(a, b, c)) | 0 - - h = g - g = f - f = e - e = (d + T1) | 0 - d = c - c = b - b = a - a = (T1 + T2) | 0 - } - - this._a = (a + this._a) | 0 - this._b = (b + this._b) | 0 - this._c = (c + this._c) | 0 - this._d = (d + this._d) | 0 - this._e = (e + this._e) | 0 - this._f = (f + this._f) | 0 - this._g = (g + this._g) | 0 - this._h = (h + this._h) | 0 -} - -Sha256.prototype._hash = function () { - var H = Buffer.allocUnsafe(32) - - H.writeInt32BE(this._a, 0) - H.writeInt32BE(this._b, 4) - H.writeInt32BE(this._c, 8) - H.writeInt32BE(this._d, 12) - H.writeInt32BE(this._e, 16) - H.writeInt32BE(this._f, 20) - H.writeInt32BE(this._g, 24) - H.writeInt32BE(this._h, 28) - - return H -} - -module.exports = Sha256 - - -/***/ }), - -/***/ "./node_modules/sha.js/sha384.js": -/*!***************************************!*\ - !*** ./node_modules/sha.js/sha384.js ***! - \***************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var SHA512 = __webpack_require__(/*! ./sha512 */ "./node_modules/sha.js/sha512.js") -var Hash = __webpack_require__(/*! ./hash */ "./node_modules/sha.js/hash.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var W = new Array(160) - -function Sha384 () { - this.init() - this._w = W - - Hash.call(this, 128, 112) -} - -inherits(Sha384, SHA512) - -Sha384.prototype.init = function () { - this._ah = 0xcbbb9d5d - this._bh = 0x629a292a - this._ch = 0x9159015a - this._dh = 0x152fecd8 - this._eh = 0x67332667 - this._fh = 0x8eb44a87 - this._gh = 0xdb0c2e0d - this._hh = 0x47b5481d - - this._al = 0xc1059ed8 - this._bl = 0x367cd507 - this._cl = 0x3070dd17 - this._dl = 0xf70e5939 - this._el = 0xffc00b31 - this._fl = 0x68581511 - this._gl = 0x64f98fa7 - this._hl = 0xbefa4fa4 - - return this -} - -Sha384.prototype._hash = function () { - var H = Buffer.allocUnsafe(48) - - function writeInt64BE (h, l, offset) { - H.writeInt32BE(h, offset) - H.writeInt32BE(l, offset + 4) - } - - writeInt64BE(this._ah, this._al, 0) - writeInt64BE(this._bh, this._bl, 8) - writeInt64BE(this._ch, this._cl, 16) - writeInt64BE(this._dh, this._dl, 24) - writeInt64BE(this._eh, this._el, 32) - writeInt64BE(this._fh, this._fl, 40) - - return H -} - -module.exports = Sha384 - - -/***/ }), - -/***/ "./node_modules/sha.js/sha512.js": -/*!***************************************!*\ - !*** ./node_modules/sha.js/sha512.js ***! - \***************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var Hash = __webpack_require__(/*! ./hash */ "./node_modules/sha.js/hash.js") -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer - -var 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 -] - -var W = new Array(160) - -function Sha512 () { - this.init() - this._w = W - - Hash.call(this, 128, 112) -} - -inherits(Sha512, Hash) - -Sha512.prototype.init = function () { - this._ah = 0x6a09e667 - this._bh = 0xbb67ae85 - this._ch = 0x3c6ef372 - this._dh = 0xa54ff53a - this._eh = 0x510e527f - this._fh = 0x9b05688c - this._gh = 0x1f83d9ab - this._hh = 0x5be0cd19 - - this._al = 0xf3bcc908 - this._bl = 0x84caa73b - this._cl = 0xfe94f82b - this._dl = 0x5f1d36f1 - this._el = 0xade682d1 - this._fl = 0x2b3e6c1f - this._gl = 0xfb41bd6b - this._hl = 0x137e2179 - - return this -} - -function Ch (x, y, z) { - return z ^ (x & (y ^ z)) -} - -function maj (x, y, z) { - return (x & y) | (z & (x | y)) -} - -function sigma0 (x, xl) { - return (x >>> 28 | xl << 4) ^ (xl >>> 2 | x << 30) ^ (xl >>> 7 | x << 25) -} - -function sigma1 (x, xl) { - return (x >>> 14 | xl << 18) ^ (x >>> 18 | xl << 14) ^ (xl >>> 9 | x << 23) -} - -function Gamma0 (x, xl) { - return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7) -} - -function Gamma0l (x, xl) { - return (x >>> 1 | xl << 31) ^ (x >>> 8 | xl << 24) ^ (x >>> 7 | xl << 25) -} - -function Gamma1 (x, xl) { - return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6) -} - -function Gamma1l (x, xl) { - return (x >>> 19 | xl << 13) ^ (xl >>> 29 | x << 3) ^ (x >>> 6 | xl << 26) -} - -function getCarry (a, b) { - return (a >>> 0) < (b >>> 0) ? 1 : 0 -} - -Sha512.prototype._update = function (M) { - var W = this._w - - var ah = this._ah | 0 - var bh = this._bh | 0 - var ch = this._ch | 0 - var dh = this._dh | 0 - var eh = this._eh | 0 - var fh = this._fh | 0 - var gh = this._gh | 0 - var hh = this._hh | 0 - - var al = this._al | 0 - var bl = this._bl | 0 - var cl = this._cl | 0 - var dl = this._dl | 0 - var el = this._el | 0 - var fl = this._fl | 0 - var gl = this._gl | 0 - var hl = this._hl | 0 - - for (var i = 0; i < 32; i += 2) { - W[i] = M.readInt32BE(i * 4) - W[i + 1] = M.readInt32BE(i * 4 + 4) - } - for (; i < 160; i += 2) { - var xh = W[i - 15 * 2] - var xl = W[i - 15 * 2 + 1] - var gamma0 = Gamma0(xh, xl) - var gamma0l = Gamma0l(xl, xh) - - xh = W[i - 2 * 2] - xl = W[i - 2 * 2 + 1] - var gamma1 = Gamma1(xh, xl) - var gamma1l = Gamma1l(xl, xh) - - // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16] - var Wi7h = W[i - 7 * 2] - var Wi7l = W[i - 7 * 2 + 1] - - var Wi16h = W[i - 16 * 2] - var Wi16l = W[i - 16 * 2 + 1] - - var Wil = (gamma0l + Wi7l) | 0 - var Wih = (gamma0 + Wi7h + getCarry(Wil, gamma0l)) | 0 - Wil = (Wil + gamma1l) | 0 - Wih = (Wih + gamma1 + getCarry(Wil, gamma1l)) | 0 - Wil = (Wil + Wi16l) | 0 - Wih = (Wih + Wi16h + getCarry(Wil, Wi16l)) | 0 - - W[i] = Wih - W[i + 1] = Wil - } - - for (var j = 0; j < 160; j += 2) { - Wih = W[j] - Wil = W[j + 1] - - var majh = maj(ah, bh, ch) - var majl = maj(al, bl, cl) - - var sigma0h = sigma0(ah, al) - var sigma0l = sigma0(al, ah) - var sigma1h = sigma1(eh, el) - var sigma1l = sigma1(el, eh) - - // t1 = h + sigma1 + ch + K[j] + W[j] - var Kih = K[j] - var Kil = K[j + 1] - - var chh = Ch(eh, fh, gh) - var chl = Ch(el, fl, gl) - - var t1l = (hl + sigma1l) | 0 - var t1h = (hh + sigma1h + getCarry(t1l, hl)) | 0 - t1l = (t1l + chl) | 0 - t1h = (t1h + chh + getCarry(t1l, chl)) | 0 - t1l = (t1l + Kil) | 0 - t1h = (t1h + Kih + getCarry(t1l, Kil)) | 0 - t1l = (t1l + Wil) | 0 - t1h = (t1h + Wih + getCarry(t1l, Wil)) | 0 - - // t2 = sigma0 + maj - var t2l = (sigma0l + majl) | 0 - var t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0 - - hh = gh - hl = gl - gh = fh - gl = fl - fh = eh - fl = el - el = (dl + t1l) | 0 - eh = (dh + t1h + getCarry(el, dl)) | 0 - dh = ch - dl = cl - ch = bh - cl = bl - bh = ah - bl = al - al = (t1l + t2l) | 0 - ah = (t1h + t2h + getCarry(al, t1l)) | 0 - } - - this._al = (this._al + al) | 0 - this._bl = (this._bl + bl) | 0 - this._cl = (this._cl + cl) | 0 - this._dl = (this._dl + dl) | 0 - this._el = (this._el + el) | 0 - this._fl = (this._fl + fl) | 0 - this._gl = (this._gl + gl) | 0 - this._hl = (this._hl + hl) | 0 - - this._ah = (this._ah + ah + getCarry(this._al, al)) | 0 - this._bh = (this._bh + bh + getCarry(this._bl, bl)) | 0 - this._ch = (this._ch + ch + getCarry(this._cl, cl)) | 0 - this._dh = (this._dh + dh + getCarry(this._dl, dl)) | 0 - this._eh = (this._eh + eh + getCarry(this._el, el)) | 0 - this._fh = (this._fh + fh + getCarry(this._fl, fl)) | 0 - this._gh = (this._gh + gh + getCarry(this._gl, gl)) | 0 - this._hh = (this._hh + hh + getCarry(this._hl, hl)) | 0 -} - -Sha512.prototype._hash = function () { - var H = Buffer.allocUnsafe(64) - - function writeInt64BE (h, l, offset) { - H.writeInt32BE(h, offset) - H.writeInt32BE(l, offset + 4) - } - - writeInt64BE(this._ah, this._al, 0) - writeInt64BE(this._bh, this._bl, 8) - writeInt64BE(this._ch, this._cl, 16) - writeInt64BE(this._dh, this._dl, 24) - writeInt64BE(this._eh, this._el, 32) - writeInt64BE(this._fh, this._fl, 40) - writeInt64BE(this._gh, this._gl, 48) - writeInt64BE(this._hh, this._hl, 56) - - return H -} - -module.exports = Sha512 - - -/***/ }), - -/***/ "./node_modules/simple-concat/index.js": -/*!*********************************************!*\ - !*** ./node_modules/simple-concat/index.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! simple-concat. MIT License. Feross Aboukhadijeh */ -module.exports = function (stream, cb) { - var chunks = [] - stream.on('data', function (chunk) { - chunks.push(chunk) - }) - stream.once('end', function () { - if (cb) cb(null, Buffer.concat(chunks)) - cb = null - }) - stream.once('error', function (err) { - if (cb) cb(err) - cb = null - }) -} - - -/***/ }), - -/***/ "./node_modules/simple-get/index.js": -/*!******************************************!*\ - !*** ./node_modules/simple-get/index.js ***! - \******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! simple-get. MIT License. Feross Aboukhadijeh */ -module.exports = simpleGet - -const concat = __webpack_require__(/*! simple-concat */ "./node_modules/simple-concat/index.js") -const decompressResponse = __webpack_require__(/*! decompress-response */ "?45bd") // excluded from browser build -const http = __webpack_require__(/*! http */ "./node_modules/stream-http/index.js") -const https = __webpack_require__(/*! https */ "./node_modules/https-browserify/index.js") -const once = __webpack_require__(/*! once */ "./node_modules/once/once.js") -const querystring = __webpack_require__(/*! querystring */ "./node_modules/querystring/index.js") -const url = __webpack_require__(/*! url */ "./node_modules/url/url.js") - -const isStream = o => o !== null && typeof o === 'object' && typeof o.pipe === 'function' - -function simpleGet (opts, cb) { - opts = Object.assign({ maxRedirects: 10 }, typeof opts === 'string' ? { url: opts } : opts) - cb = once(cb) - - if (opts.url) { - const { hostname, port, protocol, auth, path } = url.parse(opts.url) // eslint-disable-line node/no-deprecated-api - delete opts.url - if (!hostname && !port && !protocol && !auth) opts.path = path // Relative redirect - else Object.assign(opts, { hostname, port, protocol, auth, path }) // Absolute redirect - } - - const headers = { 'accept-encoding': 'gzip, deflate' } - if (opts.headers) Object.keys(opts.headers).forEach(k => (headers[k.toLowerCase()] = opts.headers[k])) - opts.headers = headers - - let body - if (opts.body) { - body = opts.json && !isStream(opts.body) ? JSON.stringify(opts.body) : opts.body - } else if (opts.form) { - body = typeof opts.form === 'string' ? opts.form : querystring.stringify(opts.form) - opts.headers['content-type'] = 'application/x-www-form-urlencoded' - } - - if (body) { - if (!opts.method) opts.method = 'POST' - if (!isStream(body)) opts.headers['content-length'] = Buffer.byteLength(body) - if (opts.json && !opts.form) opts.headers['content-type'] = 'application/json' - } - delete opts.body; delete opts.form - - if (opts.json) opts.headers.accept = 'application/json' - if (opts.method) opts.method = opts.method.toUpperCase() - - const protocol = opts.protocol === 'https:' ? https : http // Support http/https urls - const req = protocol.request(opts, res => { - if (opts.followRedirects !== false && res.statusCode >= 300 && res.statusCode < 400 && res.headers.location) { - opts.url = res.headers.location // Follow 3xx redirects - delete opts.headers.host // Discard `host` header on redirect (see #32) - res.resume() // Discard response - - if (opts.method === 'POST' && [301, 302].includes(res.statusCode)) { - opts.method = 'GET' // On 301/302 redirect, change POST to GET (see #35) - delete opts.headers['content-length']; delete opts.headers['content-type'] - } - - if (opts.maxRedirects-- === 0) return cb(new Error('too many redirects')) - else return simpleGet(opts, cb) - } - - const tryUnzip = typeof decompressResponse === 'function' && opts.method !== 'HEAD' - cb(null, tryUnzip ? decompressResponse(res) : res) - }) - req.on('timeout', () => { - req.abort() - cb(new Error('Request timed out')) - }) - req.on('error', cb) - - if (isStream(body)) body.on('error', cb).pipe(req) - else req.end(body) - - return req -} - -simpleGet.concat = (opts, cb) => { - return simpleGet(opts, (err, res) => { - if (err) return cb(err) - concat(res, (err, data) => { - if (err) return cb(err) - if (opts.json) { - try { - data = JSON.parse(data.toString()) - } catch (err) { - return cb(err, res, data) - } - } - cb(null, res, data) - }) - }) -} - -;['get', 'post', 'put', 'patch', 'head', 'delete'].forEach(method => { - simpleGet[method] = (opts, cb) => { - if (typeof opts === 'string') opts = { url: opts } - return simpleGet(Object.assign({ method: method.toUpperCase() }, opts), cb) - } -}) - - -/***/ }), - -/***/ "./node_modules/simple-peer/index.js": -/*!*******************************************!*\ - !*** ./node_modules/simple-peer/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -/*! simple-peer. MIT License. Feross Aboukhadijeh */ -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('simple-peer') -const getBrowserRTC = __webpack_require__(/*! get-browser-rtc */ "./node_modules/get-browser-rtc/index.js") -const randombytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") -const stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") // TODO: remove when Node 10 is not supported -const errCode = __webpack_require__(/*! err-code */ "./node_modules/err-code/index.js") -const { Buffer } = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js") - -const MAX_BUFFERED_AMOUNT = 64 * 1024 -const ICECOMPLETE_TIMEOUT = 5 * 1000 -const CHANNEL_CLOSING_TIMEOUT = 5 * 1000 - -// HACK: Filter trickle lines when trickle is disabled #354 -function filterTrickle (sdp) { - return sdp.replace(/a=ice-options:trickle\s\n/g, '') -} - -function warn (message) { - console.warn(message) -} - -/** - * WebRTC peer connection. Same API as node core `net.Socket`, plus a few extra methods. - * Duplex stream. - * @param {Object} opts - */ -class Peer extends stream.Duplex { - constructor (opts) { - opts = Object.assign({ - allowHalfOpen: false - }, opts) - - super(opts) - - this._id = randombytes(4).toString('hex').slice(0, 7) - this._debug('new peer %o', opts) - - this.channelName = opts.initiator - ? opts.channelName || randombytes(20).toString('hex') - : null - - this.initiator = opts.initiator || false - this.channelConfig = opts.channelConfig || Peer.channelConfig - this.channelNegotiated = this.channelConfig.negotiated - this.config = Object.assign({}, Peer.config, opts.config) - this.offerOptions = opts.offerOptions || {} - this.answerOptions = opts.answerOptions || {} - this.sdpTransform = opts.sdpTransform || (sdp => sdp) - this.streams = opts.streams || (opts.stream ? [opts.stream] : []) // support old "stream" option - this.trickle = opts.trickle !== undefined ? opts.trickle : true - this.allowHalfTrickle = opts.allowHalfTrickle !== undefined ? opts.allowHalfTrickle : false - this.iceCompleteTimeout = opts.iceCompleteTimeout || ICECOMPLETE_TIMEOUT - - this.destroyed = false - this.destroying = false - this._connected = false - - this.remoteAddress = undefined - this.remoteFamily = undefined - this.remotePort = undefined - this.localAddress = undefined - this.localFamily = undefined - this.localPort = undefined - - this._wrtc = (opts.wrtc && typeof opts.wrtc === 'object') - ? opts.wrtc - : getBrowserRTC() - - if (!this._wrtc) { - if (typeof window === 'undefined') { - throw errCode(new Error('No WebRTC support: Specify `opts.wrtc` option in this environment'), 'ERR_WEBRTC_SUPPORT') - } else { - throw errCode(new Error('No WebRTC support: Not a supported browser'), 'ERR_WEBRTC_SUPPORT') - } - } - - this._pcReady = false - this._channelReady = false - this._iceComplete = false // ice candidate trickle done (got null candidate) - this._iceCompleteTimer = null // send an offer/answer anyway after some timeout - this._channel = null - this._pendingCandidates = [] - - this._isNegotiating = false // is this peer waiting for negotiation to complete? - this._firstNegotiation = true - this._batchedNegotiation = false // batch synchronous negotiations - this._queuedNegotiation = false // is there a queued negotiation request? - this._sendersAwaitingStable = [] - this._senderMap = new Map() - this._closingInterval = null - - this._remoteTracks = [] - this._remoteStreams = [] - - this._chunk = null - this._cb = null - this._interval = null - - try { - this._pc = new (this._wrtc.RTCPeerConnection)(this.config) - } catch (err) { - this.destroy(errCode(err, 'ERR_PC_CONSTRUCTOR')) - return - } - - // We prefer feature detection whenever possible, but sometimes that's not - // possible for certain implementations. - this._isReactNativeWebrtc = typeof this._pc._peerConnectionId === 'number' - - this._pc.oniceconnectionstatechange = () => { - this._onIceStateChange() - } - this._pc.onicegatheringstatechange = () => { - this._onIceStateChange() - } - this._pc.onconnectionstatechange = () => { - this._onConnectionStateChange() - } - this._pc.onsignalingstatechange = () => { - this._onSignalingStateChange() - } - this._pc.onicecandidate = event => { - this._onIceCandidate(event) - } - - // HACK: Fix for odd Firefox behavior, see: https://github.com/feross/simple-peer/pull/783 - if (typeof this._pc.peerIdentity === 'object') { - this._pc.peerIdentity.catch(err => { - this.destroy(errCode(err, 'ERR_PC_PEER_IDENTITY')) - }) - } - - // Other spec events, unused by this implementation: - // - onconnectionstatechange - // - onicecandidateerror - // - onfingerprintfailure - // - onnegotiationneeded - - if (this.initiator || this.channelNegotiated) { - this._setupData({ - channel: this._pc.createDataChannel(this.channelName, this.channelConfig) - }) - } else { - this._pc.ondatachannel = event => { - this._setupData(event) - } - } - - if (this.streams) { - this.streams.forEach(stream => { - this.addStream(stream) - }) - } - this._pc.ontrack = event => { - this._onTrack(event) - } - - this._debug('initial negotiation') - this._needsNegotiation() - - this._onFinishBound = () => { - this._onFinish() - } - this.once('finish', this._onFinishBound) - } - - get bufferSize () { - return (this._channel && this._channel.bufferedAmount) || 0 - } - - // HACK: it's possible channel.readyState is "closing" before peer.destroy() fires - // https://bugs.chromium.org/p/chromium/issues/detail?id=882743 - get connected () { - return (this._connected && this._channel.readyState === 'open') - } - - address () { - return { port: this.localPort, family: this.localFamily, address: this.localAddress } - } - - signal (data) { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot signal after peer is destroyed'), 'ERR_DESTROYED') - if (typeof data === 'string') { - try { - data = JSON.parse(data) - } catch (err) { - data = {} - } - } - this._debug('signal()') - - if (data.renegotiate && this.initiator) { - this._debug('got request to renegotiate') - this._needsNegotiation() - } - if (data.transceiverRequest && this.initiator) { - this._debug('got request for transceiver') - this.addTransceiver(data.transceiverRequest.kind, data.transceiverRequest.init) - } - if (data.candidate) { - if (this._pc.remoteDescription && this._pc.remoteDescription.type) { - this._addIceCandidate(data.candidate) - } else { - this._pendingCandidates.push(data.candidate) - } - } - if (data.sdp) { - this._pc.setRemoteDescription(new (this._wrtc.RTCSessionDescription)(data)) - .then(() => { - if (this.destroyed) return - - this._pendingCandidates.forEach(candidate => { - this._addIceCandidate(candidate) - }) - this._pendingCandidates = [] - - if (this._pc.remoteDescription.type === 'offer') this._createAnswer() - }) - .catch(err => { - this.destroy(errCode(err, 'ERR_SET_REMOTE_DESCRIPTION')) - }) - } - if (!data.sdp && !data.candidate && !data.renegotiate && !data.transceiverRequest) { - this.destroy(errCode(new Error('signal() called with invalid signal data'), 'ERR_SIGNALING')) - } - } - - _addIceCandidate (candidate) { - const iceCandidateObj = new this._wrtc.RTCIceCandidate(candidate) - this._pc.addIceCandidate(iceCandidateObj) - .catch(err => { - if (!iceCandidateObj.address || iceCandidateObj.address.endsWith('.local')) { - warn('Ignoring unsupported ICE candidate.') - } else { - this.destroy(errCode(err, 'ERR_ADD_ICE_CANDIDATE')) - } - }) - } - - /** - * Send text/binary data to the remote peer. - * @param {ArrayBufferView|ArrayBuffer|Buffer|string|Blob} chunk - */ - send (chunk) { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot send after peer is destroyed'), 'ERR_DESTROYED') - this._channel.send(chunk) - } - - /** - * Add a Transceiver to the connection. - * @param {String} kind - * @param {Object} init - */ - addTransceiver (kind, init) { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot addTransceiver after peer is destroyed'), 'ERR_DESTROYED') - this._debug('addTransceiver()') - - if (this.initiator) { - try { - this._pc.addTransceiver(kind, init) - this._needsNegotiation() - } catch (err) { - this.destroy(errCode(err, 'ERR_ADD_TRANSCEIVER')) - } - } else { - this.emit('signal', { // request initiator to renegotiate - type: 'transceiverRequest', - transceiverRequest: { kind, init } - }) - } - } - - /** - * Add a MediaStream to the connection. - * @param {MediaStream} stream - */ - addStream (stream) { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot addStream after peer is destroyed'), 'ERR_DESTROYED') - this._debug('addStream()') - - stream.getTracks().forEach(track => { - this.addTrack(track, stream) - }) - } - - /** - * Add a MediaStreamTrack to the connection. - * @param {MediaStreamTrack} track - * @param {MediaStream} stream - */ - addTrack (track, stream) { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot addTrack after peer is destroyed'), 'ERR_DESTROYED') - this._debug('addTrack()') - - const submap = this._senderMap.get(track) || new Map() // nested Maps map [track, stream] to sender - let sender = submap.get(stream) - if (!sender) { - sender = this._pc.addTrack(track, stream) - submap.set(stream, sender) - this._senderMap.set(track, submap) - this._needsNegotiation() - } else if (sender.removed) { - throw errCode(new Error('Track has been removed. You should enable/disable tracks that you want to re-add.'), 'ERR_SENDER_REMOVED') - } else { - throw errCode(new Error('Track has already been added to that stream.'), 'ERR_SENDER_ALREADY_ADDED') - } - } - - /** - * Replace a MediaStreamTrack by another in the connection. - * @param {MediaStreamTrack} oldTrack - * @param {MediaStreamTrack} newTrack - * @param {MediaStream} stream - */ - replaceTrack (oldTrack, newTrack, stream) { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot replaceTrack after peer is destroyed'), 'ERR_DESTROYED') - this._debug('replaceTrack()') - - const submap = this._senderMap.get(oldTrack) - const sender = submap ? submap.get(stream) : null - if (!sender) { - throw errCode(new Error('Cannot replace track that was never added.'), 'ERR_TRACK_NOT_ADDED') - } - if (newTrack) this._senderMap.set(newTrack, submap) - - if (sender.replaceTrack != null) { - sender.replaceTrack(newTrack) - } else { - this.destroy(errCode(new Error('replaceTrack is not supported in this browser'), 'ERR_UNSUPPORTED_REPLACETRACK')) - } - } - - /** - * Remove a MediaStreamTrack from the connection. - * @param {MediaStreamTrack} track - * @param {MediaStream} stream - */ - removeTrack (track, stream) { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot removeTrack after peer is destroyed'), 'ERR_DESTROYED') - this._debug('removeSender()') - - const submap = this._senderMap.get(track) - const sender = submap ? submap.get(stream) : null - if (!sender) { - throw errCode(new Error('Cannot remove track that was never added.'), 'ERR_TRACK_NOT_ADDED') - } - try { - sender.removed = true - this._pc.removeTrack(sender) - } catch (err) { - if (err.name === 'NS_ERROR_UNEXPECTED') { - this._sendersAwaitingStable.push(sender) // HACK: Firefox must wait until (signalingState === stable) https://bugzilla.mozilla.org/show_bug.cgi?id=1133874 - } else { - this.destroy(errCode(err, 'ERR_REMOVE_TRACK')) - } - } - this._needsNegotiation() - } - - /** - * Remove a MediaStream from the connection. - * @param {MediaStream} stream - */ - removeStream (stream) { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot removeStream after peer is destroyed'), 'ERR_DESTROYED') - this._debug('removeSenders()') - - stream.getTracks().forEach(track => { - this.removeTrack(track, stream) - }) - } - - _needsNegotiation () { - this._debug('_needsNegotiation') - if (this._batchedNegotiation) return // batch synchronous renegotiations - this._batchedNegotiation = true - queueMicrotask(() => { - this._batchedNegotiation = false - if (this.initiator || !this._firstNegotiation) { - this._debug('starting batched negotiation') - this.negotiate() - } else { - this._debug('non-initiator initial negotiation request discarded') - } - this._firstNegotiation = false - }) - } - - negotiate () { - if (this.destroying) return - if (this.destroyed) throw errCode(new Error('cannot negotiate after peer is destroyed'), 'ERR_DESTROYED') - - if (this.initiator) { - if (this._isNegotiating) { - this._queuedNegotiation = true - this._debug('already negotiating, queueing') - } else { - this._debug('start negotiation') - setTimeout(() => { // HACK: Chrome crashes if we immediately call createOffer - this._createOffer() - }, 0) - } - } else { - if (this._isNegotiating) { - this._queuedNegotiation = true - this._debug('already negotiating, queueing') - } else { - this._debug('requesting negotiation from initiator') - this.emit('signal', { // request initiator to renegotiate - type: 'renegotiate', - renegotiate: true - }) - } - } - this._isNegotiating = true - } - - // TODO: Delete this method once readable-stream is updated to contain a default - // implementation of destroy() that automatically calls _destroy() - // See: https://github.com/nodejs/readable-stream/issues/283 - destroy (err) { - this._destroy(err, () => {}) - } - - _destroy (err, cb) { - if (this.destroyed || this.destroying) return - this.destroying = true - - this._debug('destroying (error: %s)', err && (err.message || err)) - - queueMicrotask(() => { // allow events concurrent with the call to _destroy() to fire (see #692) - this.destroyed = true - this.destroying = false - - this._debug('destroy (error: %s)', err && (err.message || err)) - - this.readable = this.writable = false - - if (!this._readableState.ended) this.push(null) - if (!this._writableState.finished) this.end() - - this._connected = false - this._pcReady = false - this._channelReady = false - this._remoteTracks = null - this._remoteStreams = null - this._senderMap = null - - clearInterval(this._closingInterval) - this._closingInterval = null - - clearInterval(this._interval) - this._interval = null - this._chunk = null - this._cb = null - - if (this._onFinishBound) this.removeListener('finish', this._onFinishBound) - this._onFinishBound = null - - if (this._channel) { - try { - this._channel.close() - } catch (err) {} - - // allow events concurrent with destruction to be handled - this._channel.onmessage = null - this._channel.onopen = null - this._channel.onclose = null - this._channel.onerror = null - } - if (this._pc) { - try { - this._pc.close() - } catch (err) {} - - // allow events concurrent with destruction to be handled - this._pc.oniceconnectionstatechange = null - this._pc.onicegatheringstatechange = null - this._pc.onsignalingstatechange = null - this._pc.onicecandidate = null - this._pc.ontrack = null - this._pc.ondatachannel = null - } - this._pc = null - this._channel = null - - if (err) this.emit('error', err) - this.emit('close') - cb() - }) - } - - _setupData (event) { - if (!event.channel) { - // In some situations `pc.createDataChannel()` returns `undefined` (in wrtc), - // which is invalid behavior. Handle it gracefully. - // See: https://github.com/feross/simple-peer/issues/163 - return this.destroy(errCode(new Error('Data channel event is missing `channel` property'), 'ERR_DATA_CHANNEL')) - } - - this._channel = event.channel - this._channel.binaryType = 'arraybuffer' - - if (typeof this._channel.bufferedAmountLowThreshold === 'number') { - this._channel.bufferedAmountLowThreshold = MAX_BUFFERED_AMOUNT - } - - this.channelName = this._channel.label - - this._channel.onmessage = event => { - this._onChannelMessage(event) - } - this._channel.onbufferedamountlow = () => { - this._onChannelBufferedAmountLow() - } - this._channel.onopen = () => { - this._onChannelOpen() - } - this._channel.onclose = () => { - this._onChannelClose() - } - this._channel.onerror = event => { - const err = event.error instanceof Error - ? event.error - : new Error(`Datachannel error: ${event.message} ${event.filename}:${event.lineno}:${event.colno}`) - this.destroy(errCode(err, 'ERR_DATA_CHANNEL')) - } - - // HACK: Chrome will sometimes get stuck in readyState "closing", let's check for this condition - // https://bugs.chromium.org/p/chromium/issues/detail?id=882743 - let isClosing = false - this._closingInterval = setInterval(() => { // No "onclosing" event - if (this._channel && this._channel.readyState === 'closing') { - if (isClosing) this._onChannelClose() // closing timed out: equivalent to onclose firing - isClosing = true - } else { - isClosing = false - } - }, CHANNEL_CLOSING_TIMEOUT) - } - - _read () {} - - _write (chunk, encoding, cb) { - if (this.destroyed) return cb(errCode(new Error('cannot write after peer is destroyed'), 'ERR_DATA_CHANNEL')) - - if (this._connected) { - try { - this.send(chunk) - } catch (err) { - return this.destroy(errCode(err, 'ERR_DATA_CHANNEL')) - } - if (this._channel.bufferedAmount > MAX_BUFFERED_AMOUNT) { - this._debug('start backpressure: bufferedAmount %d', this._channel.bufferedAmount) - this._cb = cb - } else { - cb(null) - } - } else { - this._debug('write before connect') - this._chunk = chunk - this._cb = cb - } - } - - // When stream finishes writing, close socket. Half open connections are not - // supported. - _onFinish () { - if (this.destroyed) return - - // Wait a bit before destroying so the socket flushes. - // TODO: is there a more reliable way to accomplish this? - const destroySoon = () => { - setTimeout(() => this.destroy(), 1000) - } - - if (this._connected) { - destroySoon() - } else { - this.once('connect', destroySoon) - } - } - - _startIceCompleteTimeout () { - if (this.destroyed) return - if (this._iceCompleteTimer) return - this._debug('started iceComplete timeout') - this._iceCompleteTimer = setTimeout(() => { - if (!this._iceComplete) { - this._iceComplete = true - this._debug('iceComplete timeout completed') - this.emit('iceTimeout') - this.emit('_iceComplete') - } - }, this.iceCompleteTimeout) - } - - _createOffer () { - if (this.destroyed) return - - this._pc.createOffer(this.offerOptions) - .then(offer => { - if (this.destroyed) return - if (!this.trickle && !this.allowHalfTrickle) offer.sdp = filterTrickle(offer.sdp) - offer.sdp = this.sdpTransform(offer.sdp) - - const sendOffer = () => { - if (this.destroyed) return - const signal = this._pc.localDescription || offer - this._debug('signal') - this.emit('signal', { - type: signal.type, - sdp: signal.sdp - }) - } - - const onSuccess = () => { - this._debug('createOffer success') - if (this.destroyed) return - if (this.trickle || this._iceComplete) sendOffer() - else this.once('_iceComplete', sendOffer) // wait for candidates - } - - const onError = err => { - this.destroy(errCode(err, 'ERR_SET_LOCAL_DESCRIPTION')) - } - - this._pc.setLocalDescription(offer) - .then(onSuccess) - .catch(onError) - }) - .catch(err => { - this.destroy(errCode(err, 'ERR_CREATE_OFFER')) - }) - } - - _requestMissingTransceivers () { - if (this._pc.getTransceivers) { - this._pc.getTransceivers().forEach(transceiver => { - if (!transceiver.mid && transceiver.sender.track && !transceiver.requested) { - transceiver.requested = true // HACK: Safari returns negotiated transceivers with a null mid - this.addTransceiver(transceiver.sender.track.kind) - } - }) - } - } - - _createAnswer () { - if (this.destroyed) return - - this._pc.createAnswer(this.answerOptions) - .then(answer => { - if (this.destroyed) return - if (!this.trickle && !this.allowHalfTrickle) answer.sdp = filterTrickle(answer.sdp) - answer.sdp = this.sdpTransform(answer.sdp) - - const sendAnswer = () => { - if (this.destroyed) return - const signal = this._pc.localDescription || answer - this._debug('signal') - this.emit('signal', { - type: signal.type, - sdp: signal.sdp - }) - if (!this.initiator) this._requestMissingTransceivers() - } - - const onSuccess = () => { - if (this.destroyed) return - if (this.trickle || this._iceComplete) sendAnswer() - else this.once('_iceComplete', sendAnswer) - } - - const onError = err => { - this.destroy(errCode(err, 'ERR_SET_LOCAL_DESCRIPTION')) - } - - this._pc.setLocalDescription(answer) - .then(onSuccess) - .catch(onError) - }) - .catch(err => { - this.destroy(errCode(err, 'ERR_CREATE_ANSWER')) - }) - } - - _onConnectionStateChange () { - if (this.destroyed) return - if (this._pc.connectionState === 'failed') { - this.destroy(errCode(new Error('Connection failed.'), 'ERR_CONNECTION_FAILURE')) - } - } - - _onIceStateChange () { - if (this.destroyed) return - const iceConnectionState = this._pc.iceConnectionState - const iceGatheringState = this._pc.iceGatheringState - - this._debug( - 'iceStateChange (connection: %s) (gathering: %s)', - iceConnectionState, - iceGatheringState - ) - this.emit('iceStateChange', iceConnectionState, iceGatheringState) - - if (iceConnectionState === 'connected' || iceConnectionState === 'completed') { - this._pcReady = true - this._maybeReady() - } - if (iceConnectionState === 'failed') { - this.destroy(errCode(new Error('Ice connection failed.'), 'ERR_ICE_CONNECTION_FAILURE')) - } - if (iceConnectionState === 'closed') { - this.destroy(errCode(new Error('Ice connection closed.'), 'ERR_ICE_CONNECTION_CLOSED')) - } - } - - getStats (cb) { - // statreports can come with a value array instead of properties - const flattenValues = report => { - if (Object.prototype.toString.call(report.values) === '[object Array]') { - report.values.forEach(value => { - Object.assign(report, value) - }) - } - return report - } - - // Promise-based getStats() (standard) - if (this._pc.getStats.length === 0 || this._isReactNativeWebrtc) { - this._pc.getStats() - .then(res => { - const reports = [] - res.forEach(report => { - reports.push(flattenValues(report)) - }) - cb(null, reports) - }, err => cb(err)) - - // Single-parameter callback-based getStats() (non-standard) - } else if (this._pc.getStats.length > 0) { - this._pc.getStats(res => { - // If we destroy connection in `connect` callback this code might happen to run when actual connection is already closed - if (this.destroyed) return - - const reports = [] - res.result().forEach(result => { - const report = {} - result.names().forEach(name => { - report[name] = result.stat(name) - }) - report.id = result.id - report.type = result.type - report.timestamp = result.timestamp - reports.push(flattenValues(report)) - }) - cb(null, reports) - }, err => cb(err)) - - // Unknown browser, skip getStats() since it's anyone's guess which style of - // getStats() they implement. - } else { - cb(null, []) - } - } - - _maybeReady () { - this._debug('maybeReady pc %s channel %s', this._pcReady, this._channelReady) - if (this._connected || this._connecting || !this._pcReady || !this._channelReady) return - - this._connecting = true - - // HACK: We can't rely on order here, for details see https://github.com/js-platform/node-webrtc/issues/339 - const findCandidatePair = () => { - if (this.destroyed) return - - this.getStats((err, items) => { - if (this.destroyed) return - - // Treat getStats error as non-fatal. It's not essential. - if (err) items = [] - - const remoteCandidates = {} - const localCandidates = {} - const candidatePairs = {} - let foundSelectedCandidatePair = false - - items.forEach(item => { - // TODO: Once all browsers support the hyphenated stats report types, remove - // the non-hypenated ones - if (item.type === 'remotecandidate' || item.type === 'remote-candidate') { - remoteCandidates[item.id] = item - } - if (item.type === 'localcandidate' || item.type === 'local-candidate') { - localCandidates[item.id] = item - } - if (item.type === 'candidatepair' || item.type === 'candidate-pair') { - candidatePairs[item.id] = item - } - }) - - const setSelectedCandidatePair = selectedCandidatePair => { - foundSelectedCandidatePair = true - - let local = localCandidates[selectedCandidatePair.localCandidateId] - - if (local && (local.ip || local.address)) { - // Spec - this.localAddress = local.ip || local.address - this.localPort = Number(local.port) - } else if (local && local.ipAddress) { - // Firefox - this.localAddress = local.ipAddress - this.localPort = Number(local.portNumber) - } else if (typeof selectedCandidatePair.googLocalAddress === 'string') { - // TODO: remove this once Chrome 58 is released - local = selectedCandidatePair.googLocalAddress.split(':') - this.localAddress = local[0] - this.localPort = Number(local[1]) - } - if (this.localAddress) { - this.localFamily = this.localAddress.includes(':') ? 'IPv6' : 'IPv4' - } - - let remote = remoteCandidates[selectedCandidatePair.remoteCandidateId] - - if (remote && (remote.ip || remote.address)) { - // Spec - this.remoteAddress = remote.ip || remote.address - this.remotePort = Number(remote.port) - } else if (remote && remote.ipAddress) { - // Firefox - this.remoteAddress = remote.ipAddress - this.remotePort = Number(remote.portNumber) - } else if (typeof selectedCandidatePair.googRemoteAddress === 'string') { - // TODO: remove this once Chrome 58 is released - remote = selectedCandidatePair.googRemoteAddress.split(':') - this.remoteAddress = remote[0] - this.remotePort = Number(remote[1]) - } - if (this.remoteAddress) { - this.remoteFamily = this.remoteAddress.includes(':') ? 'IPv6' : 'IPv4' - } - - this._debug( - 'connect local: %s:%s remote: %s:%s', - this.localAddress, - this.localPort, - this.remoteAddress, - this.remotePort - ) - } - - items.forEach(item => { - // Spec-compliant - if (item.type === 'transport' && item.selectedCandidatePairId) { - setSelectedCandidatePair(candidatePairs[item.selectedCandidatePairId]) - } - - // Old implementations - if ( - (item.type === 'googCandidatePair' && item.googActiveConnection === 'true') || - ((item.type === 'candidatepair' || item.type === 'candidate-pair') && item.selected) - ) { - setSelectedCandidatePair(item) - } - }) - - // Ignore candidate pair selection in browsers like Safari 11 that do not have any local or remote candidates - // But wait until at least 1 candidate pair is available - if (!foundSelectedCandidatePair && (!Object.keys(candidatePairs).length || Object.keys(localCandidates).length)) { - setTimeout(findCandidatePair, 100) - return - } else { - this._connecting = false - this._connected = true - } - - if (this._chunk) { - try { - this.send(this._chunk) - } catch (err) { - return this.destroy(errCode(err, 'ERR_DATA_CHANNEL')) - } - this._chunk = null - this._debug('sent chunk from "write before connect"') - - const cb = this._cb - this._cb = null - cb(null) - } - - // If `bufferedAmountLowThreshold` and 'onbufferedamountlow' are unsupported, - // fallback to using setInterval to implement backpressure. - if (typeof this._channel.bufferedAmountLowThreshold !== 'number') { - this._interval = setInterval(() => this._onInterval(), 150) - if (this._interval.unref) this._interval.unref() - } - - this._debug('connect') - this.emit('connect') - }) - } - findCandidatePair() - } - - _onInterval () { - if (!this._cb || !this._channel || this._channel.bufferedAmount > MAX_BUFFERED_AMOUNT) { - return - } - this._onChannelBufferedAmountLow() - } - - _onSignalingStateChange () { - if (this.destroyed) return - - if (this._pc.signalingState === 'stable') { - this._isNegotiating = false - - // HACK: Firefox doesn't yet support removing tracks when signalingState !== 'stable' - this._debug('flushing sender queue', this._sendersAwaitingStable) - this._sendersAwaitingStable.forEach(sender => { - this._pc.removeTrack(sender) - this._queuedNegotiation = true - }) - this._sendersAwaitingStable = [] - - if (this._queuedNegotiation) { - this._debug('flushing negotiation queue') - this._queuedNegotiation = false - this._needsNegotiation() // negotiate again - } else { - this._debug('negotiated') - this.emit('negotiated') - } - } - - this._debug('signalingStateChange %s', this._pc.signalingState) - this.emit('signalingStateChange', this._pc.signalingState) - } - - _onIceCandidate (event) { - if (this.destroyed) return - if (event.candidate && this.trickle) { - this.emit('signal', { - type: 'candidate', - candidate: { - candidate: event.candidate.candidate, - sdpMLineIndex: event.candidate.sdpMLineIndex, - sdpMid: event.candidate.sdpMid - } - }) - } else if (!event.candidate && !this._iceComplete) { - this._iceComplete = true - this.emit('_iceComplete') - } - // as soon as we've received one valid candidate start timeout - if (event.candidate) { - this._startIceCompleteTimeout() - } - } - - _onChannelMessage (event) { - if (this.destroyed) return - let data = event.data - if (data instanceof ArrayBuffer) data = Buffer.from(data) - this.push(data) - } - - _onChannelBufferedAmountLow () { - if (this.destroyed || !this._cb) return - this._debug('ending backpressure: bufferedAmount %d', this._channel.bufferedAmount) - const cb = this._cb - this._cb = null - cb(null) - } - - _onChannelOpen () { - if (this._connected || this.destroyed) return - this._debug('on channel open') - this._channelReady = true - this._maybeReady() - } - - _onChannelClose () { - if (this.destroyed) return - this._debug('on channel close') - this.destroy() - } - - _onTrack (event) { - if (this.destroyed) return - - event.streams.forEach(eventStream => { - this._debug('on track') - this.emit('track', event.track, eventStream) - - this._remoteTracks.push({ - track: event.track, - stream: eventStream - }) - - if (this._remoteStreams.some(remoteStream => { - return remoteStream.id === eventStream.id - })) return // Only fire one 'stream' event, even though there may be multiple tracks per stream - - this._remoteStreams.push(eventStream) - queueMicrotask(() => { - this._debug('on stream') - this.emit('stream', eventStream) // ensure all tracks have been added - }) - }) - } - - _debug () { - const args = [].slice.call(arguments) - args[0] = '[' + this._id + '] ' + args[0] - debug.apply(null, args) - } -} - -Peer.WEBRTC_SUPPORT = !!getBrowserRTC() - -/** - * Expose peer and data channel config for overriding all Peer - * instances. Otherwise, just set opts.config or opts.channelConfig - * when constructing a Peer. - */ -Peer.config = { - iceServers: [ - { - urls: [ - 'stun:stun.l.google.com:19302', - 'stun:global.stun.twilio.com:3478' - ] - } - ], - sdpSemantics: 'unified-plan' -} - -Peer.channelConfig = {} - -module.exports = Peer - - -/***/ }), - -/***/ "./node_modules/simple-sha1/browser.js": -/*!*********************************************!*\ - !*** ./node_modules/simple-sha1/browser.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* global self */ - -const Rusha = __webpack_require__(/*! rusha */ "./node_modules/rusha/dist/rusha.js") -const rushaWorkerSha1 = __webpack_require__(/*! ./rusha-worker-sha1 */ "./node_modules/simple-sha1/rusha-worker-sha1.js") - -const rusha = new Rusha() -const scope = typeof window !== 'undefined' ? window : self -const crypto = scope.crypto || scope.msCrypto || {} -let subtle = crypto.subtle || crypto.webkitSubtle - -function sha1sync (buf) { - return rusha.digest(buf) -} - -// Browsers throw if they lack support for an algorithm. -// Promise will be rejected on non-secure origins. (http://goo.gl/lq4gCo) -try { - subtle.digest({ name: 'sha-1' }, new Uint8Array()).catch(function () { - subtle = false - }) -} catch (err) { subtle = false } - -function sha1 (buf, cb) { - if (!subtle) { - if (typeof window !== 'undefined') { - rushaWorkerSha1(buf, function onRushaWorkerSha1 (err, hash) { - if (err) { - // On error, fallback to synchronous method which cannot fail - cb(sha1sync(buf)) - return - } - - cb(hash) - }) - } else { - queueMicrotask(() => cb(sha1sync(buf))) - } - return - } - - if (typeof buf === 'string') { - buf = uint8array(buf) - } - - subtle.digest({ name: 'sha-1' }, buf) - .then(function succeed (result) { - cb(hex(new Uint8Array(result))) - }, - function fail () { - // On error, fallback to synchronous method which cannot fail - cb(sha1sync(buf)) - }) -} - -function uint8array (s) { - const l = s.length - const array = new Uint8Array(l) - for (let i = 0; i < l; i++) { - array[i] = s.charCodeAt(i) - } - return array -} - -function hex (buf) { - const l = buf.length - const chars = [] - for (let i = 0; i < l; i++) { - const bite = buf[i] - chars.push((bite >>> 4).toString(16)) - chars.push((bite & 0x0f).toString(16)) - } - return chars.join('') -} - -module.exports = sha1 -module.exports.sync = sha1sync - - -/***/ }), - -/***/ "./node_modules/simple-sha1/rusha-worker-sha1.js": -/*!*******************************************************!*\ - !*** ./node_modules/simple-sha1/rusha-worker-sha1.js ***! - \*******************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const Rusha = __webpack_require__(/*! rusha */ "./node_modules/rusha/dist/rusha.js") - -let worker -let nextTaskId -let cbs - -function init () { - worker = Rusha.createWorker() - nextTaskId = 1 - cbs = {} // taskId -> cb - - worker.onmessage = function onRushaMessage (e) { - const taskId = e.data.id - const cb = cbs[taskId] - delete cbs[taskId] - - if (e.data.error != null) { - cb(new Error('Rusha worker error: ' + e.data.error)) - } else { - cb(null, e.data.hash) - } - } -} - -function sha1 (buf, cb) { - if (!worker) init() - - cbs[nextTaskId] = cb - worker.postMessage({ id: nextTaskId, data: buf }) - nextTaskId += 1 -} - -module.exports = sha1 - - -/***/ }), - -/***/ "./node_modules/simple-websocket/index.js": -/*!************************************************!*\ - !*** ./node_modules/simple-websocket/index.js ***! - \************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! simple-websocket. MIT License. Feross Aboukhadijeh */ -/* global WebSocket */ - -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('simple-websocket') -const randombytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") -const stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") // TODO: remove when Node 10 is not supported -const ws = __webpack_require__(/*! ws */ "?c33b") // websockets in node - will be empty object in browser - -const _WebSocket = typeof ws !== 'function' ? WebSocket : ws - -const MAX_BUFFERED_AMOUNT = 64 * 1024 - -/** - * WebSocket. Same API as node core `net.Socket`. Duplex stream. - * @param {Object} opts - * @param {string=} opts.url websocket server url - * @param {string=} opts.socket raw websocket instance to wrap - */ -class Socket extends stream.Duplex { - constructor (opts = {}) { - // Support simple usage: `new Socket(url)` - if (typeof opts === 'string') { - opts = { url: opts } - } - - opts = Object.assign({ - allowHalfOpen: false - }, opts) - - super(opts) - - if (opts.url == null && opts.socket == null) { - throw new Error('Missing required `url` or `socket` option') - } - if (opts.url != null && opts.socket != null) { - throw new Error('Must specify either `url` or `socket` option, not both') - } - - this._id = randombytes(4).toString('hex').slice(0, 7) - this._debug('new websocket: %o', opts) - - this.connected = false - this.destroyed = false - - this._chunk = null - this._cb = null - this._interval = null - - if (opts.socket) { - this.url = opts.socket.url - this._ws = opts.socket - this.connected = opts.socket.readyState === _WebSocket.OPEN - } else { - this.url = opts.url - try { - if (typeof ws === 'function') { - // `ws` package accepts options - this._ws = new _WebSocket(opts.url, null, { - ...opts, - encoding: undefined // encoding option breaks ws internals - }) - } else { - this._ws = new _WebSocket(opts.url) - } - } catch (err) { - queueMicrotask(() => this.destroy(err)) - return - } - } - - this._ws.binaryType = 'arraybuffer' - - if (opts.socket && this.connected) { - queueMicrotask(() => this._handleOpen()) - } else { - this._ws.onopen = () => this._handleOpen() - } - - this._ws.onmessage = event => this._handleMessage(event) - this._ws.onclose = () => this._handleClose() - this._ws.onerror = err => this._handleError(err) - - this._handleFinishBound = () => this._handleFinish() - this.once('finish', this._handleFinishBound) - } - - /** - * Send text/binary data to the WebSocket server. - * @param {TypedArrayView|ArrayBuffer|Buffer|string|Blob|Object} chunk - */ - send (chunk) { - this._ws.send(chunk) - } - - // TODO: Delete this method once readable-stream is updated to contain a default - // implementation of destroy() that automatically calls _destroy() - // See: https://github.com/nodejs/readable-stream/issues/283 - destroy (err) { - this._destroy(err, () => {}) - } - - _destroy (err, cb) { - if (this.destroyed) return - - this._debug('destroy (error: %s)', err && (err.message || err)) - - this.readable = this.writable = false - if (!this._readableState.ended) this.push(null) - if (!this._writableState.finished) this.end() - - this.connected = false - this.destroyed = true - - clearInterval(this._interval) - this._interval = null - this._chunk = null - this._cb = null - - if (this._handleFinishBound) { - this.removeListener('finish', this._handleFinishBound) - } - this._handleFinishBound = null - - if (this._ws) { - const ws = this._ws - const onClose = () => { - ws.onclose = null - } - if (ws.readyState === _WebSocket.CLOSED) { - onClose() - } else { - try { - ws.onclose = onClose - ws.close() - } catch (err) { - onClose() - } - } - - ws.onopen = null - ws.onmessage = null - ws.onerror = () => {} - } - this._ws = null - - if (err) this.emit('error', err) - this.emit('close') - cb() - } - - _read () {} - - _write (chunk, encoding, cb) { - if (this.destroyed) return cb(new Error('cannot write after socket is destroyed')) - - if (this.connected) { - try { - this.send(chunk) - } catch (err) { - return this.destroy(err) - } - if (typeof ws !== 'function' && this._ws.bufferedAmount > MAX_BUFFERED_AMOUNT) { - this._debug('start backpressure: bufferedAmount %d', this._ws.bufferedAmount) - this._cb = cb - } else { - cb(null) - } - } else { - this._debug('write before connect') - this._chunk = chunk - this._cb = cb - } - } - - _handleOpen () { - if (this.connected || this.destroyed) return - this.connected = true - - if (this._chunk) { - try { - this.send(this._chunk) - } catch (err) { - return this.destroy(err) - } - this._chunk = null - this._debug('sent chunk from "write before connect"') - - const cb = this._cb - this._cb = null - cb(null) - } - - // Backpressure is not implemented in Node.js. The `ws` module has a buggy - // `bufferedAmount` property. See: https://github.com/websockets/ws/issues/492 - if (typeof ws !== 'function') { - this._interval = setInterval(() => this._onInterval(), 150) - if (this._interval.unref) this._interval.unref() - } - - this._debug('connect') - this.emit('connect') - } - - _handleMessage (event) { - if (this.destroyed) return - let data = event.data - if (data instanceof ArrayBuffer) data = Buffer.from(data) - this.push(data) - } - - _handleClose () { - if (this.destroyed) return - this._debug('on close') - this.destroy() - } - - _handleError (_) { - this.destroy(new Error(`Error connecting to ${this.url}`)) - } - - // When stream finishes writing, close socket. Half open connections are not - // supported. - _handleFinish () { - if (this.destroyed) return - - // Wait a bit before destroying so the socket flushes. - // TODO: is there a more reliable way to accomplish this? - const destroySoon = () => { - setTimeout(() => this.destroy(), 1000) - } - - if (this.connected) { - destroySoon() - } else { - this.once('connect', destroySoon) - } - } - - _onInterval () { - if (!this._cb || !this._ws || this._ws.bufferedAmount > MAX_BUFFERED_AMOUNT) { - return - } - this._debug('ending backpressure: bufferedAmount %d', this._ws.bufferedAmount) - const cb = this._cb - this._cb = null - cb(null) - } - - _debug () { - const args = [].slice.call(arguments) - args[0] = '[' + this._id + '] ' + args[0] - debug.apply(null, args) - } -} - -Socket.WEBSOCKET_SUPPORT = !!_WebSocket - -module.exports = Socket - - -/***/ }), - -/***/ "./node_modules/speed-limiter/index.js": -/*!*********************************************!*\ - !*** ./node_modules/speed-limiter/index.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const Throttle = __webpack_require__(/*! ./lib/throttle */ "./node_modules/speed-limiter/lib/throttle.js") -const ThrottleGroup = __webpack_require__(/*! ./lib/throttle-group */ "./node_modules/speed-limiter/lib/throttle-group.js") - -module.exports = { - Throttle, - ThrottleGroup -} - - -/***/ }), - -/***/ "./node_modules/speed-limiter/lib/throttle-group.js": -/*!**********************************************************!*\ - !*** ./node_modules/speed-limiter/lib/throttle-group.js ***! - \**********************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const { TokenBucket } = __webpack_require__(/*! limiter */ "./node_modules/limiter/index.js") -const Throttle = __webpack_require__(/*! ./throttle */ "./node_modules/speed-limiter/lib/throttle.js") - -class ThrottleGroup { - constructor (opts = {}) { - if (typeof opts !== 'object') throw new Error('Options must be an object') - - this.throttles = [] - this.setEnabled(opts.enabled) - this.setRate(opts.rate, opts.chunksize) - } - - getEnabled () { - return this._enabled - } - - getRate () { - // Note: bucketSize === tokensPerInterval - return this.bucket.tokensPerInterval - } - - getChunksize () { - return this.chunksize - } - - setEnabled (val = true) { - if (typeof val !== 'boolean') throw new Error('Enabled must be a boolean') - - this._enabled = val - for (const throttle of this.throttles) { - throttle.setEnabled(val) - } - } - - setRate (rate, chunksize = null) { - // Note: rate = 0, means we should stop processing chunks - if (!Number.isInteger(rate) || rate < 0) throw new Error('Rate must be an integer bigger than zero') - rate = parseInt(rate) - - if (chunksize && (typeof chunksize !== 'number' || chunksize <= 0)) throw new Error('Chunksize must be bigger than zero') - chunksize = chunksize || Math.max(parseInt(rate / 10), 1) - chunksize = parseInt(chunksize) - if (rate > 0 && chunksize > rate) throw new Error('Chunk size must be smaller than rate') - - if (!this.bucket) this.bucket = new TokenBucket(rate, rate, 'second', null) - - this.bucket.bucketSize = rate - this.bucket.tokensPerInterval = rate - this.chunksize = chunksize - } - - setChunksize (chunksize) { - if (!Number.isInteger(chunksize) || chunksize <= 0) throw new Error('Chunk size must be an integer bigger than zero') - const rate = this.getRate() - chunksize = parseInt(chunksize) - if (rate > 0 && chunksize > rate) throw new Error('Chunk size must be smaller than rate') - this.chunksize = chunksize - } - - throttle (opts = {}) { - if (typeof opts !== 'object') throw new Error('Options must be an object') - - const newThrottle = new Throttle({ - ...opts, - group: this - }) - - return newThrottle - } - - destroy () { - for (const throttle of this.throttles) { - throttle.destroy() - } - - this.throttles = [] - } - - _addThrottle (throttle) { - if (!(throttle instanceof Throttle)) throw new Error('Throttle must be an instance of Throttle') - - this.throttles.push(throttle) - } - - _removeThrottle (throttle) { - const index = this.throttles.indexOf(throttle) - if (index > -1) this.throttles.splice(index, 1) - } -} - -module.exports = ThrottleGroup - - -/***/ }), - -/***/ "./node_modules/speed-limiter/lib/throttle.js": -/*!****************************************************!*\ - !*** ./node_modules/speed-limiter/lib/throttle.js ***! - \****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const { EventEmitter } = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const { Transform } = __webpack_require__(/*! streamx */ "./node_modules/streamx/index.js") -const { wait } = __webpack_require__(/*! ./utils */ "./node_modules/speed-limiter/lib/utils.js") - -class Throttle extends Transform { - constructor (opts = {}) { - super() - - if (typeof opts !== 'object') throw new Error('Options must be an object') - - const params = Object.assign({}, opts) - - if (params.group && !(params.group instanceof ThrottleGroup)) throw new Error('Group must be an instanece of ThrottleGroup') - else if (!params.group) params.group = new ThrottleGroup(params) - - this._setEnabled(params.enabled || params.group.enabled) - this._group = params.group - this._emitter = new EventEmitter() - this._destroyed = false - - this._group._addThrottle(this) - } - - getEnabled () { - return this._enabled - } - - getGroup () { - return this._group - } - - _setEnabled (val = true) { - if (typeof val !== 'boolean') throw new Error('Enabled must be a boolean') - this._enabled = val - } - - setEnabled (val) { - this._setEnabled(val) - if (this._enabled) this._emitter.emit('enabled') - else this._emitter.emit('disabled') - } - - _transform (chunk, done) { - this._processChunk(chunk, done) - } - - /* async _waitForPositiveRate () { - // Stop pushing chunks if rate is zero - while (this._group.getRate() === 0 && !this._destroyed && this._areBothEnabled()) { - await wait(1 * 1000) // wait 1 second - } - } */ - - async _waitForTokens (amount) { - // Wait for enabled, destroyed or tokens - return new Promise((resolve, reject) => { - let done = false - const self = this - function isDone (err) { - self._emitter.removeListener('disabled', isDone) - self._emitter.removeListener('destroyed', isDone) - - if (done) return - done = true - if (err) return reject(err) - resolve() - } - this._emitter.once('disabled', isDone) - this._emitter.once('destroyed', isDone) - // TODO: next version remove lisener in "isDone" - this._group.bucket.removeTokens(amount, isDone) - }) - } - - _areBothEnabled () { - return this._enabled && this._group.getEnabled() - } - - /* async _throttleChunk (size) { - // Stop pushing chunks if rate is zero - await this._waitForPositiveRate() - if (this._destroyed) return - if (!this._areBothEnabled()) return - - // Get tokens from bucket - await this._waitForTokens(size) - } */ - - async _processChunk (chunk, done) { - if (!this._areBothEnabled()) return done(null, chunk) - - let pos = 0 - let chunksize = this._group.getChunksize() - let slice = chunk.slice(pos, pos + chunksize) - while (slice.length > 0) { - // Check here again because we might be in the middle of a big chunk - // with a lot of small slices - if (this._areBothEnabled()) { - try { - // WAIT FOR POSITIVE RATE - // Stop pushing chunks if rate is zero - while (this._group.getRate() === 0 && !this._destroyed && this._areBothEnabled()) { - await wait(1000) // wait 1 second - if (this._destroyed) return - } - - // WAIT FOR TOKENS - if (this._areBothEnabled() && !this._group.bucket.tryRemoveTokens(slice.length)) { - await this._waitForTokens(slice.length) - if (this._destroyed) return - } - } catch (err) { - return done(err) - } - } - - this.push(slice) - pos += chunksize - - // Calculate params for next slice - chunksize = (this._areBothEnabled()) - ? this._group.getChunksize() // Chunksize might have changed - : chunk.length - pos // Get the rest of the chunk - slice = chunk.slice(pos, pos + chunksize) - } - - return done() - } - - destroy (...args) { - this._group._removeThrottle(this) - - this._destroyed = true - this._emitter.emit('destroyed') - - super.destroy(...args) - } -} - -module.exports = Throttle - -// Fix circular dependency -const ThrottleGroup = __webpack_require__(/*! ./throttle-group */ "./node_modules/speed-limiter/lib/throttle-group.js") - - -/***/ }), - -/***/ "./node_modules/speed-limiter/lib/utils.js": -/*!*************************************************!*\ - !*** ./node_modules/speed-limiter/lib/utils.js ***! - \*************************************************/ -/***/ ((module) => { - -function wait (time) { - return new Promise((resolve) => setTimeout(resolve, time)) -} - -module.exports = { - wait -} - - -/***/ }), - -/***/ "./node_modules/speedometer/index.js": -/*!*******************************************!*\ - !*** ./node_modules/speedometer/index.js ***! - \*******************************************/ -/***/ ((module) => { - -var tick = 1 -var maxTick = 65535 -var resolution = 4 -var timer -var inc = function () { - tick = (tick + 1) & maxTick -} - - -module.exports = function (seconds) { - if (!timer) { - timer = setInterval(inc, (1000 / resolution) | 0) - if (timer.unref) timer.unref() - } - - var size = resolution * (seconds || 5) - var buffer = [0] - var pointer = 1 - var last = (tick - 1) & maxTick - - return function (delta) { - var dist = (tick - last) & maxTick - if (dist > size) dist = size - last = tick - - while (dist--) { - if (pointer === size) pointer = 0 - buffer[pointer] = buffer[pointer === 0 ? size - 1 : pointer - 1] - pointer++ - } - - if (delta) buffer[pointer - 1] += delta - - var top = buffer[pointer - 1] - var btm = buffer.length < size ? 0 : buffer[pointer === size ? 0 : pointer] - - return buffer.length < resolution ? top : (top - btm) * resolution / buffer.length - } -} - - -/***/ }), - -/***/ "./node_modules/stream-browserify/index.js": -/*!*************************************************!*\ - !*** ./node_modules/stream-browserify/index.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - -module.exports = Stream; - -var EE = __webpack_require__(/*! events */ "./node_modules/events/events.js").EventEmitter; -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -inherits(Stream, EE); -Stream.Readable = __webpack_require__(/*! readable-stream/lib/_stream_readable.js */ "./node_modules/readable-stream/lib/_stream_readable.js"); -Stream.Writable = __webpack_require__(/*! readable-stream/lib/_stream_writable.js */ "./node_modules/readable-stream/lib/_stream_writable.js"); -Stream.Duplex = __webpack_require__(/*! readable-stream/lib/_stream_duplex.js */ "./node_modules/readable-stream/lib/_stream_duplex.js"); -Stream.Transform = __webpack_require__(/*! readable-stream/lib/_stream_transform.js */ "./node_modules/readable-stream/lib/_stream_transform.js"); -Stream.PassThrough = __webpack_require__(/*! readable-stream/lib/_stream_passthrough.js */ "./node_modules/readable-stream/lib/_stream_passthrough.js"); -Stream.finished = __webpack_require__(/*! readable-stream/lib/internal/streams/end-of-stream.js */ "./node_modules/readable-stream/lib/internal/streams/end-of-stream.js") -Stream.pipeline = __webpack_require__(/*! readable-stream/lib/internal/streams/pipeline.js */ "./node_modules/readable-stream/lib/internal/streams/pipeline.js") - -// Backwards-compat with node 0.4.x -Stream.Stream = Stream; - - - -// old-style streams. Note that the pipe method (the only relevant -// part of this class) is overridden in the Readable class. - -function Stream() { - EE.call(this); -} - -Stream.prototype.pipe = function(dest, options) { - var source = this; - - function ondata(chunk) { - if (dest.writable) { - if (false === dest.write(chunk) && source.pause) { - source.pause(); - } - } - } - - source.on('data', ondata); - - function ondrain() { - if (source.readable && source.resume) { - source.resume(); - } - } - - dest.on('drain', ondrain); - - // If the 'end' option is not supplied, dest.end() will be called when - // source gets the 'end' or 'close' events. Only dest.end() once. - if (!dest._isStdio && (!options || options.end !== false)) { - source.on('end', onend); - source.on('close', onclose); - } - - var didOnEnd = false; - function onend() { - if (didOnEnd) return; - didOnEnd = true; - - dest.end(); - } - - - function onclose() { - if (didOnEnd) return; - didOnEnd = true; - - if (typeof dest.destroy === 'function') dest.destroy(); - } - - // don't leave dangling pipes when there are errors. - function onerror(er) { - cleanup(); - if (EE.listenerCount(this, 'error') === 0) { - throw er; // Unhandled stream error in pipe. - } - } - - source.on('error', onerror); - dest.on('error', onerror); - - // remove all the event listeners that were added. - function cleanup() { - source.removeListener('data', ondata); - dest.removeListener('drain', ondrain); - - source.removeListener('end', onend); - source.removeListener('close', onclose); - - source.removeListener('error', onerror); - dest.removeListener('error', onerror); - - source.removeListener('end', cleanup); - source.removeListener('close', cleanup); - - dest.removeListener('close', cleanup); - } - - source.on('end', cleanup); - source.on('close', cleanup); - - dest.on('close', cleanup); - - dest.emit('pipe', source); - - // Allow for unix-like usage: A.pipe(B).pipe(C) - return dest; -}; - - -/***/ }), - -/***/ "./node_modules/stream-http/index.js": -/*!*******************************************!*\ - !*** ./node_modules/stream-http/index.js ***! - \*******************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var ClientRequest = __webpack_require__(/*! ./lib/request */ "./node_modules/stream-http/lib/request.js") -var response = __webpack_require__(/*! ./lib/response */ "./node_modules/stream-http/lib/response.js") -var extend = __webpack_require__(/*! xtend */ "./node_modules/xtend/immutable.js") -var statusCodes = __webpack_require__(/*! builtin-status-codes */ "./node_modules/builtin-status-codes/browser.js") -var url = __webpack_require__(/*! url */ "./node_modules/url/url.js") - -var http = exports - -http.request = function (opts, cb) { - if (typeof opts === 'string') - opts = url.parse(opts) - else - opts = extend(opts) - - // Normally, the page is loaded from http or https, so not specifying a protocol - // will result in a (valid) protocol-relative url. However, this won't work if - // the protocol is something else, like 'file:' - var defaultProtocol = __webpack_require__.g.location.protocol.search(/^https?:$/) === -1 ? 'http:' : '' - - var protocol = opts.protocol || defaultProtocol - var host = opts.hostname || opts.host - var port = opts.port - var path = opts.path || '/' - - // Necessary for IPv6 addresses - if (host && host.indexOf(':') !== -1) - host = '[' + host + ']' - - // This may be a relative url. The browser should always be able to interpret it correctly. - opts.url = (host ? (protocol + '//' + host) : '') + (port ? ':' + port : '') + path - opts.method = (opts.method || 'GET').toUpperCase() - opts.headers = opts.headers || {} - - // Also valid opts.auth, opts.mode - - var req = new ClientRequest(opts) - if (cb) - req.on('response', cb) - return req -} - -http.get = function get (opts, cb) { - var req = http.request(opts, cb) - req.end() - return req -} - -http.ClientRequest = ClientRequest -http.IncomingMessage = response.IncomingMessage - -http.Agent = function () {} -http.Agent.defaultMaxSockets = 4 - -http.globalAgent = new http.Agent() - -http.STATUS_CODES = statusCodes - -http.METHODS = [ - 'CHECKOUT', - 'CONNECT', - 'COPY', - 'DELETE', - 'GET', - 'HEAD', - 'LOCK', - 'M-SEARCH', - 'MERGE', - 'MKACTIVITY', - 'MKCOL', - 'MOVE', - 'NOTIFY', - 'OPTIONS', - 'PATCH', - 'POST', - 'PROPFIND', - 'PROPPATCH', - 'PURGE', - 'PUT', - 'REPORT', - 'SEARCH', - 'SUBSCRIBE', - 'TRACE', - 'UNLOCK', - 'UNSUBSCRIBE' -] - -/***/ }), - -/***/ "./node_modules/stream-http/lib/capability.js": -/*!****************************************************!*\ - !*** ./node_modules/stream-http/lib/capability.js ***! - \****************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -exports.fetch = isFunction(__webpack_require__.g.fetch) && isFunction(__webpack_require__.g.ReadableStream) - -exports.writableStream = isFunction(__webpack_require__.g.WritableStream) - -exports.abortController = isFunction(__webpack_require__.g.AbortController) - -// The xhr request to example.com may violate some restrictive CSP configurations, -// so if we're running in a browser that supports `fetch`, avoid calling getXHR() -// and assume support for certain features below. -var xhr -function getXHR () { - // Cache the xhr value - if (xhr !== undefined) return xhr - - if (__webpack_require__.g.XMLHttpRequest) { - xhr = new __webpack_require__.g.XMLHttpRequest() - // If XDomainRequest is available (ie only, where xhr might not work - // cross domain), use the page location. Otherwise use example.com - // Note: this doesn't actually make an http request. - try { - xhr.open('GET', __webpack_require__.g.XDomainRequest ? '/' : 'https://example.com') - } catch(e) { - xhr = null - } - } else { - // Service workers don't have XHR - xhr = null - } - return xhr -} - -function checkTypeSupport (type) { - var xhr = getXHR() - if (!xhr) return false - try { - xhr.responseType = type - return xhr.responseType === type - } catch (e) {} - return false -} - -// If fetch is supported, then arraybuffer will be supported too. Skip calling -// checkTypeSupport(), since that calls getXHR(). -exports.arraybuffer = exports.fetch || checkTypeSupport('arraybuffer') - -// These next two tests unavoidably show warnings in Chrome. Since fetch will always -// be used if it's available, just return false for these to avoid the warnings. -exports.msstream = !exports.fetch && checkTypeSupport('ms-stream') -exports.mozchunkedarraybuffer = !exports.fetch && checkTypeSupport('moz-chunked-arraybuffer') - -// If fetch is supported, then overrideMimeType will be supported too. Skip calling -// getXHR(). -exports.overrideMimeType = exports.fetch || (getXHR() ? isFunction(getXHR().overrideMimeType) : false) - -function isFunction (value) { - return typeof value === 'function' -} - -xhr = null // Help gc - - -/***/ }), - -/***/ "./node_modules/stream-http/lib/request.js": -/*!*************************************************!*\ - !*** ./node_modules/stream-http/lib/request.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -var capability = __webpack_require__(/*! ./capability */ "./node_modules/stream-http/lib/capability.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var response = __webpack_require__(/*! ./response */ "./node_modules/stream-http/lib/response.js") -var stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") - -var IncomingMessage = response.IncomingMessage -var rStates = response.readyStates - -function decideMode (preferBinary, useFetch) { - if (capability.fetch && useFetch) { - return 'fetch' - } else if (capability.mozchunkedarraybuffer) { - return 'moz-chunked-arraybuffer' - } else if (capability.msstream) { - return 'ms-stream' - } else if (capability.arraybuffer && preferBinary) { - return 'arraybuffer' - } else { - return 'text' - } -} - -var ClientRequest = module.exports = function (opts) { - var self = this - stream.Writable.call(self) - - self._opts = opts - self._body = [] - self._headers = {} - if (opts.auth) - self.setHeader('Authorization', 'Basic ' + Buffer.from(opts.auth).toString('base64')) - Object.keys(opts.headers).forEach(function (name) { - self.setHeader(name, opts.headers[name]) - }) - - var preferBinary - var useFetch = true - if (opts.mode === 'disable-fetch' || ('requestTimeout' in opts && !capability.abortController)) { - // If the use of XHR should be preferred. Not typically needed. - useFetch = false - preferBinary = true - } else if (opts.mode === 'prefer-streaming') { - // If streaming is a high priority but binary compatibility and - // the accuracy of the 'content-type' header aren't - preferBinary = false - } else if (opts.mode === 'allow-wrong-content-type') { - // If streaming is more important than preserving the 'content-type' header - preferBinary = !capability.overrideMimeType - } else if (!opts.mode || opts.mode === 'default' || opts.mode === 'prefer-fast') { - // Use binary if text streaming may corrupt data or the content-type header, or for speed - preferBinary = true - } else { - throw new Error('Invalid value for opts.mode') - } - self._mode = decideMode(preferBinary, useFetch) - self._fetchTimer = null - self._socketTimeout = null - self._socketTimer = null - - self.on('finish', function () { - self._onFinish() - }) -} - -inherits(ClientRequest, stream.Writable) - -ClientRequest.prototype.setHeader = function (name, value) { - var self = this - var lowerName = name.toLowerCase() - // This check is not necessary, but it prevents warnings from browsers about setting unsafe - // headers. To be honest I'm not entirely sure hiding these warnings is a good thing, but - // http-browserify did it, so I will too. - if (unsafeHeaders.indexOf(lowerName) !== -1) - return - - self._headers[lowerName] = { - name: name, - value: value - } -} - -ClientRequest.prototype.getHeader = function (name) { - var header = this._headers[name.toLowerCase()] - if (header) - return header.value - return null -} - -ClientRequest.prototype.removeHeader = function (name) { - var self = this - delete self._headers[name.toLowerCase()] -} - -ClientRequest.prototype._onFinish = function () { - var self = this - - if (self._destroyed) - return - var opts = self._opts - - if ('timeout' in opts && opts.timeout !== 0) { - self.setTimeout(opts.timeout) - } - - var headersObj = self._headers - var body = null - if (opts.method !== 'GET' && opts.method !== 'HEAD') { - body = new Blob(self._body, { - type: (headersObj['content-type'] || {}).value || '' - }); - } - - // create flattened list of headers - var headersList = [] - Object.keys(headersObj).forEach(function (keyName) { - var name = headersObj[keyName].name - var value = headersObj[keyName].value - if (Array.isArray(value)) { - value.forEach(function (v) { - headersList.push([name, v]) - }) - } else { - headersList.push([name, value]) - } - }) - - if (self._mode === 'fetch') { - var signal = null - if (capability.abortController) { - var controller = new AbortController() - signal = controller.signal - self._fetchAbortController = controller - - if ('requestTimeout' in opts && opts.requestTimeout !== 0) { - self._fetchTimer = __webpack_require__.g.setTimeout(function () { - self.emit('requestTimeout') - if (self._fetchAbortController) - self._fetchAbortController.abort() - }, opts.requestTimeout) - } - } - - __webpack_require__.g.fetch(self._opts.url, { - method: self._opts.method, - headers: headersList, - body: body || undefined, - mode: 'cors', - credentials: opts.withCredentials ? 'include' : 'same-origin', - signal: signal - }).then(function (response) { - self._fetchResponse = response - self._resetTimers(false) - self._connect() - }, function (reason) { - self._resetTimers(true) - if (!self._destroyed) - self.emit('error', reason) - }) - } else { - var xhr = self._xhr = new __webpack_require__.g.XMLHttpRequest() - try { - xhr.open(self._opts.method, self._opts.url, true) - } catch (err) { - process.nextTick(function () { - self.emit('error', err) - }) - return - } - - // Can't set responseType on really old browsers - if ('responseType' in xhr) - xhr.responseType = self._mode - - if ('withCredentials' in xhr) - xhr.withCredentials = !!opts.withCredentials - - if (self._mode === 'text' && 'overrideMimeType' in xhr) - xhr.overrideMimeType('text/plain; charset=x-user-defined') - - if ('requestTimeout' in opts) { - xhr.timeout = opts.requestTimeout - xhr.ontimeout = function () { - self.emit('requestTimeout') - } - } - - headersList.forEach(function (header) { - xhr.setRequestHeader(header[0], header[1]) - }) - - self._response = null - xhr.onreadystatechange = function () { - switch (xhr.readyState) { - case rStates.LOADING: - case rStates.DONE: - self._onXHRProgress() - break - } - } - // Necessary for streaming in Firefox, since xhr.response is ONLY defined - // in onprogress, not in onreadystatechange with xhr.readyState = 3 - if (self._mode === 'moz-chunked-arraybuffer') { - xhr.onprogress = function () { - self._onXHRProgress() - } - } - - xhr.onerror = function () { - if (self._destroyed) - return - self._resetTimers(true) - self.emit('error', new Error('XHR error')) - } - - try { - xhr.send(body) - } catch (err) { - process.nextTick(function () { - self.emit('error', err) - }) - return - } - } -} - -/** - * Checks if xhr.status is readable and non-zero, indicating no error. - * Even though the spec says it should be available in readyState 3, - * accessing it throws an exception in IE8 - */ -function statusValid (xhr) { - try { - var status = xhr.status - return (status !== null && status !== 0) - } catch (e) { - return false - } -} - -ClientRequest.prototype._onXHRProgress = function () { - var self = this - - self._resetTimers(false) - - if (!statusValid(self._xhr) || self._destroyed) - return - - if (!self._response) - self._connect() - - self._response._onXHRProgress(self._resetTimers.bind(self)) -} - -ClientRequest.prototype._connect = function () { - var self = this - - if (self._destroyed) - return - - self._response = new IncomingMessage(self._xhr, self._fetchResponse, self._mode, self._resetTimers.bind(self)) - self._response.on('error', function(err) { - self.emit('error', err) - }) - - self.emit('response', self._response) -} - -ClientRequest.prototype._write = function (chunk, encoding, cb) { - var self = this - - self._body.push(chunk) - cb() -} - -ClientRequest.prototype._resetTimers = function (done) { - var self = this - - __webpack_require__.g.clearTimeout(self._socketTimer) - self._socketTimer = null - - if (done) { - __webpack_require__.g.clearTimeout(self._fetchTimer) - self._fetchTimer = null - } else if (self._socketTimeout) { - self._socketTimer = __webpack_require__.g.setTimeout(function () { - self.emit('timeout') - }, self._socketTimeout) - } -} - -ClientRequest.prototype.abort = ClientRequest.prototype.destroy = function (err) { - var self = this - self._destroyed = true - self._resetTimers(true) - if (self._response) - self._response._destroyed = true - if (self._xhr) - self._xhr.abort() - else if (self._fetchAbortController) - self._fetchAbortController.abort() - - if (err) - self.emit('error', err) -} - -ClientRequest.prototype.end = function (data, encoding, cb) { - var self = this - if (typeof data === 'function') { - cb = data - data = undefined - } - - stream.Writable.prototype.end.call(self, data, encoding, cb) -} - -ClientRequest.prototype.setTimeout = function (timeout, cb) { - var self = this - - if (cb) - self.once('timeout', cb) - - self._socketTimeout = timeout - self._resetTimers(false) -} - -ClientRequest.prototype.flushHeaders = function () {} -ClientRequest.prototype.setNoDelay = function () {} -ClientRequest.prototype.setSocketKeepAlive = function () {} - -// Taken from http://www.w3.org/TR/XMLHttpRequest/#the-setrequestheader%28%29-method -var unsafeHeaders = [ - 'accept-charset', - 'accept-encoding', - 'access-control-request-headers', - 'access-control-request-method', - 'connection', - 'content-length', - 'cookie', - 'cookie2', - 'date', - 'dnt', - 'expect', - 'host', - 'keep-alive', - 'origin', - 'referer', - 'te', - 'trailer', - 'transfer-encoding', - 'upgrade', - 'via' -] - - -/***/ }), - -/***/ "./node_modules/stream-http/lib/response.js": -/*!**************************************************!*\ - !*** ./node_modules/stream-http/lib/response.js ***! - \**************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -var capability = __webpack_require__(/*! ./capability */ "./node_modules/stream-http/lib/capability.js") -var inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js") -var stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") - -var rStates = exports.readyStates = { - UNSENT: 0, - OPENED: 1, - HEADERS_RECEIVED: 2, - LOADING: 3, - DONE: 4 -} - -var IncomingMessage = exports.IncomingMessage = function (xhr, response, mode, resetTimers) { - var self = this - stream.Readable.call(self) - - self._mode = mode - self.headers = {} - self.rawHeaders = [] - self.trailers = {} - self.rawTrailers = [] - - // Fake the 'close' event, but only once 'end' fires - self.on('end', function () { - // The nextTick is necessary to prevent the 'request' module from causing an infinite loop - process.nextTick(function () { - self.emit('close') - }) - }) - - if (mode === 'fetch') { - self._fetchResponse = response - - self.url = response.url - self.statusCode = response.status - self.statusMessage = response.statusText - - response.headers.forEach(function (header, key){ - self.headers[key.toLowerCase()] = header - self.rawHeaders.push(key, header) - }) - - if (capability.writableStream) { - var writable = new WritableStream({ - write: function (chunk) { - resetTimers(false) - return new Promise(function (resolve, reject) { - if (self._destroyed) { - reject() - } else if(self.push(Buffer.from(chunk))) { - resolve() - } else { - self._resumeFetch = resolve - } - }) - }, - close: function () { - resetTimers(true) - if (!self._destroyed) - self.push(null) - }, - abort: function (err) { - resetTimers(true) - if (!self._destroyed) - self.emit('error', err) - } - }) - - try { - response.body.pipeTo(writable).catch(function (err) { - resetTimers(true) - if (!self._destroyed) - self.emit('error', err) - }) - return - } catch (e) {} // pipeTo method isn't defined. Can't find a better way to feature test this - } - // fallback for when writableStream or pipeTo aren't available - var reader = response.body.getReader() - function read () { - reader.read().then(function (result) { - if (self._destroyed) - return - resetTimers(result.done) - if (result.done) { - self.push(null) - return - } - self.push(Buffer.from(result.value)) - read() - }).catch(function (err) { - resetTimers(true) - if (!self._destroyed) - self.emit('error', err) - }) - } - read() - } else { - self._xhr = xhr - self._pos = 0 - - self.url = xhr.responseURL - self.statusCode = xhr.status - self.statusMessage = xhr.statusText - var headers = xhr.getAllResponseHeaders().split(/\r?\n/) - headers.forEach(function (header) { - var matches = header.match(/^([^:]+):\s*(.*)/) - if (matches) { - var key = matches[1].toLowerCase() - if (key === 'set-cookie') { - if (self.headers[key] === undefined) { - self.headers[key] = [] - } - self.headers[key].push(matches[2]) - } else if (self.headers[key] !== undefined) { - self.headers[key] += ', ' + matches[2] - } else { - self.headers[key] = matches[2] - } - self.rawHeaders.push(matches[1], matches[2]) - } - }) - - self._charset = 'x-user-defined' - if (!capability.overrideMimeType) { - var mimeType = self.rawHeaders['mime-type'] - if (mimeType) { - var charsetMatch = mimeType.match(/;\s*charset=([^;])(;|$)/) - if (charsetMatch) { - self._charset = charsetMatch[1].toLowerCase() - } - } - if (!self._charset) - self._charset = 'utf-8' // best guess - } - } -} - -inherits(IncomingMessage, stream.Readable) - -IncomingMessage.prototype._read = function () { - var self = this - - var resolve = self._resumeFetch - if (resolve) { - self._resumeFetch = null - resolve() - } -} - -IncomingMessage.prototype._onXHRProgress = function (resetTimers) { - var self = this - - var xhr = self._xhr - - var response = null - switch (self._mode) { - case 'text': - response = xhr.responseText - if (response.length > self._pos) { - var newData = response.substr(self._pos) - if (self._charset === 'x-user-defined') { - var buffer = Buffer.alloc(newData.length) - for (var i = 0; i < newData.length; i++) - buffer[i] = newData.charCodeAt(i) & 0xff - - self.push(buffer) - } else { - self.push(newData, self._charset) - } - self._pos = response.length - } - break - case 'arraybuffer': - if (xhr.readyState !== rStates.DONE || !xhr.response) - break - response = xhr.response - self.push(Buffer.from(new Uint8Array(response))) - break - case 'moz-chunked-arraybuffer': // take whole - response = xhr.response - if (xhr.readyState !== rStates.LOADING || !response) - break - self.push(Buffer.from(new Uint8Array(response))) - break - case 'ms-stream': - response = xhr.response - if (xhr.readyState !== rStates.LOADING) - break - var reader = new __webpack_require__.g.MSStreamReader() - reader.onprogress = function () { - if (reader.result.byteLength > self._pos) { - self.push(Buffer.from(new Uint8Array(reader.result.slice(self._pos)))) - self._pos = reader.result.byteLength - } - } - reader.onload = function () { - resetTimers(true) - self.push(null) - } - // reader.onerror = ??? // TODO: this - reader.readAsArrayBuffer(response) - break - } - - // The ms-stream case handles end separately in reader.onload() - if (self._xhr.readyState === rStates.DONE && self._mode !== 'ms-stream') { - resetTimers(true) - self.push(null) - } -} - - -/***/ }), - -/***/ "./node_modules/stream-to-blob-url/index.js": -/*!**************************************************!*\ - !*** ./node_modules/stream-to-blob-url/index.js ***! - \**************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/*! stream-to-blob-url. MIT License. Feross Aboukhadijeh */ -module.exports = getBlobURL - -const getBlob = __webpack_require__(/*! stream-to-blob */ "./node_modules/stream-to-blob/index.js") - -async function getBlobURL (stream, mimeType) { - const blob = await getBlob(stream, mimeType) - const url = URL.createObjectURL(blob) - return url -} - - -/***/ }), - -/***/ "./node_modules/stream-to-blob/index.js": -/*!**********************************************!*\ - !*** ./node_modules/stream-to-blob/index.js ***! - \**********************************************/ -/***/ ((module) => { - -/*! stream-to-blob. MIT License. Feross Aboukhadijeh */ -/* global Blob */ - -module.exports = streamToBlob - -function streamToBlob (stream, mimeType) { - if (mimeType != null && typeof mimeType !== 'string') { - throw new Error('Invalid mimetype, expected string.') - } - return new Promise((resolve, reject) => { - const chunks = [] - stream - .on('data', chunk => chunks.push(chunk)) - .once('end', () => { - const blob = mimeType != null - ? new Blob(chunks, { type: mimeType }) - : new Blob(chunks) - resolve(blob) - }) - .once('error', reject) - }) -} - - -/***/ }), - -/***/ "./node_modules/stream-with-known-length-to-buffer/index.js": -/*!******************************************************************!*\ - !*** ./node_modules/stream-with-known-length-to-buffer/index.js ***! - \******************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! stream-with-known-length-to-buffer. MIT License. Feross Aboukhadijeh */ -var once = __webpack_require__(/*! once */ "./node_modules/once/once.js") - -module.exports = function getBuffer (stream, length, cb) { - cb = once(cb) - var buf = Buffer.alloc(length) - var offset = 0 - stream - .on('data', function (chunk) { - chunk.copy(buf, offset) - offset += chunk.length - }) - .on('end', function () { cb(null, buf) }) - .on('error', cb) -} - - -/***/ }), - -/***/ "./node_modules/streamx/index.js": -/*!***************************************!*\ - !*** ./node_modules/streamx/index.js ***! - \***************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const { EventEmitter } = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const STREAM_DESTROYED = new Error('Stream was destroyed') -const PREMATURE_CLOSE = new Error('Premature close') - -const queueTick = __webpack_require__(/*! queue-tick */ "./node_modules/queue-tick/queue-microtask.js") -const FIFO = __webpack_require__(/*! fast-fifo */ "./node_modules/fast-fifo/index.js") - -/* eslint-disable no-multi-spaces */ - -const MAX = ((1 << 25) - 1) - -// Shared state -const OPENING = 0b001 -const DESTROYING = 0b010 -const DESTROYED = 0b100 - -const NOT_OPENING = MAX ^ OPENING - -// Read state -const READ_ACTIVE = 0b0000000000001 << 3 -const READ_PRIMARY = 0b0000000000010 << 3 -const READ_SYNC = 0b0000000000100 << 3 -const READ_QUEUED = 0b0000000001000 << 3 -const READ_RESUMED = 0b0000000010000 << 3 -const READ_PIPE_DRAINED = 0b0000000100000 << 3 -const READ_ENDING = 0b0000001000000 << 3 -const READ_EMIT_DATA = 0b0000010000000 << 3 -const READ_EMIT_READABLE = 0b0000100000000 << 3 -const READ_EMITTED_READABLE = 0b0001000000000 << 3 -const READ_DONE = 0b0010000000000 << 3 -const READ_NEXT_TICK = 0b0100000000001 << 3 // also active -const READ_NEEDS_PUSH = 0b1000000000000 << 3 - -const READ_NOT_ACTIVE = MAX ^ READ_ACTIVE -const READ_NON_PRIMARY = MAX ^ READ_PRIMARY -const READ_NON_PRIMARY_AND_PUSHED = MAX ^ (READ_PRIMARY | READ_NEEDS_PUSH) -const READ_NOT_SYNC = MAX ^ READ_SYNC -const READ_PUSHED = MAX ^ READ_NEEDS_PUSH -const READ_PAUSED = MAX ^ READ_RESUMED -const READ_NOT_QUEUED = MAX ^ (READ_QUEUED | READ_EMITTED_READABLE) -const READ_NOT_ENDING = MAX ^ READ_ENDING -const READ_PIPE_NOT_DRAINED = MAX ^ (READ_RESUMED | READ_PIPE_DRAINED) -const READ_NOT_NEXT_TICK = MAX ^ READ_NEXT_TICK - -// Write state -const WRITE_ACTIVE = 0b000000001 << 16 -const WRITE_PRIMARY = 0b000000010 << 16 -const WRITE_SYNC = 0b000000100 << 16 -const WRITE_QUEUED = 0b000001000 << 16 -const WRITE_UNDRAINED = 0b000010000 << 16 -const WRITE_DONE = 0b000100000 << 16 -const WRITE_EMIT_DRAIN = 0b001000000 << 16 -const WRITE_NEXT_TICK = 0b010000001 << 16 // also active -const WRITE_FINISHING = 0b100000000 << 16 - -const WRITE_NOT_ACTIVE = MAX ^ WRITE_ACTIVE -const WRITE_NOT_SYNC = MAX ^ WRITE_SYNC -const WRITE_NON_PRIMARY = MAX ^ WRITE_PRIMARY -const WRITE_NOT_FINISHING = MAX ^ WRITE_FINISHING -const WRITE_DRAINED = MAX ^ WRITE_UNDRAINED -const WRITE_NOT_QUEUED = MAX ^ WRITE_QUEUED -const WRITE_NOT_NEXT_TICK = MAX ^ WRITE_NEXT_TICK - -// Combined shared state -const ACTIVE = READ_ACTIVE | WRITE_ACTIVE -const NOT_ACTIVE = MAX ^ ACTIVE -const DONE = READ_DONE | WRITE_DONE -const DESTROY_STATUS = DESTROYING | DESTROYED -const OPEN_STATUS = DESTROY_STATUS | OPENING -const AUTO_DESTROY = DESTROY_STATUS | DONE -const NON_PRIMARY = WRITE_NON_PRIMARY & READ_NON_PRIMARY -const TICKING = (WRITE_NEXT_TICK | READ_NEXT_TICK) & NOT_ACTIVE -const ACTIVE_OR_TICKING = ACTIVE | TICKING -const IS_OPENING = OPEN_STATUS | TICKING - -// Combined read state -const READ_PRIMARY_STATUS = OPEN_STATUS | READ_ENDING | READ_DONE -const READ_STATUS = OPEN_STATUS | READ_DONE | READ_QUEUED -const READ_FLOWING = READ_RESUMED | READ_PIPE_DRAINED -const READ_ACTIVE_AND_SYNC = READ_ACTIVE | READ_SYNC -const READ_ACTIVE_AND_SYNC_AND_NEEDS_PUSH = READ_ACTIVE | READ_SYNC | READ_NEEDS_PUSH -const READ_PRIMARY_AND_ACTIVE = READ_PRIMARY | READ_ACTIVE -const READ_ENDING_STATUS = OPEN_STATUS | READ_ENDING | READ_QUEUED -const READ_EMIT_READABLE_AND_QUEUED = READ_EMIT_READABLE | READ_QUEUED -const READ_READABLE_STATUS = OPEN_STATUS | READ_EMIT_READABLE | READ_QUEUED | READ_EMITTED_READABLE -const SHOULD_NOT_READ = OPEN_STATUS | READ_ACTIVE | READ_ENDING | READ_DONE | READ_NEEDS_PUSH -const READ_BACKPRESSURE_STATUS = DESTROY_STATUS | READ_ENDING | READ_DONE - -// Combined write state -const WRITE_PRIMARY_STATUS = OPEN_STATUS | WRITE_FINISHING | WRITE_DONE -const WRITE_QUEUED_AND_UNDRAINED = WRITE_QUEUED | WRITE_UNDRAINED -const WRITE_QUEUED_AND_ACTIVE = WRITE_QUEUED | WRITE_ACTIVE -const WRITE_DRAIN_STATUS = WRITE_QUEUED | WRITE_UNDRAINED | OPEN_STATUS | WRITE_ACTIVE -const WRITE_STATUS = OPEN_STATUS | WRITE_ACTIVE | WRITE_QUEUED -const WRITE_PRIMARY_AND_ACTIVE = WRITE_PRIMARY | WRITE_ACTIVE -const WRITE_ACTIVE_AND_SYNC = WRITE_ACTIVE | WRITE_SYNC -const WRITE_FINISHING_STATUS = OPEN_STATUS | WRITE_FINISHING | WRITE_QUEUED -const WRITE_BACKPRESSURE_STATUS = WRITE_UNDRAINED | DESTROY_STATUS | WRITE_FINISHING | WRITE_DONE - -const asyncIterator = Symbol.asyncIterator || Symbol('asyncIterator') - -class WritableState { - constructor (stream, { highWaterMark = 16384, map = null, mapWritable, byteLength, byteLengthWritable } = {}) { - this.stream = stream - this.queue = new FIFO() - this.highWaterMark = highWaterMark - this.buffered = 0 - this.error = null - this.pipeline = null - this.byteLength = byteLengthWritable || byteLength || defaultByteLength - this.map = mapWritable || map - this.afterWrite = afterWrite.bind(this) - this.afterUpdateNextTick = updateWriteNT.bind(this) - } - - get ended () { - return (this.stream._duplexState & WRITE_DONE) !== 0 - } - - push (data) { - if (this.map !== null) data = this.map(data) - - this.buffered += this.byteLength(data) - this.queue.push(data) - - if (this.buffered < this.highWaterMark) { - this.stream._duplexState |= WRITE_QUEUED - return true - } - - this.stream._duplexState |= WRITE_QUEUED_AND_UNDRAINED - return false - } - - shift () { - const data = this.queue.shift() - const stream = this.stream - - this.buffered -= this.byteLength(data) - if (this.buffered === 0) stream._duplexState &= WRITE_NOT_QUEUED - - return data - } - - end (data) { - if (typeof data === 'function') this.stream.once('finish', data) - else if (data !== undefined && data !== null) this.push(data) - this.stream._duplexState = (this.stream._duplexState | WRITE_FINISHING) & WRITE_NON_PRIMARY - } - - autoBatch (data, cb) { - const buffer = [] - const stream = this.stream - - buffer.push(data) - while ((stream._duplexState & WRITE_STATUS) === WRITE_QUEUED_AND_ACTIVE) { - buffer.push(stream._writableState.shift()) - } - - if ((stream._duplexState & OPEN_STATUS) !== 0) return cb(null) - stream._writev(buffer, cb) - } - - update () { - const stream = this.stream - - while ((stream._duplexState & WRITE_STATUS) === WRITE_QUEUED) { - const data = this.shift() - stream._duplexState |= WRITE_ACTIVE_AND_SYNC - stream._write(data, this.afterWrite) - stream._duplexState &= WRITE_NOT_SYNC - } - - if ((stream._duplexState & WRITE_PRIMARY_AND_ACTIVE) === 0) this.updateNonPrimary() - } - - updateNonPrimary () { - const stream = this.stream - - if ((stream._duplexState & WRITE_FINISHING_STATUS) === WRITE_FINISHING) { - stream._duplexState = (stream._duplexState | WRITE_ACTIVE) & WRITE_NOT_FINISHING - stream._final(afterFinal.bind(this)) - return - } - - if ((stream._duplexState & DESTROY_STATUS) === DESTROYING) { - if ((stream._duplexState & ACTIVE_OR_TICKING) === 0) { - stream._duplexState |= ACTIVE - stream._destroy(afterDestroy.bind(this)) - } - return - } - - if ((stream._duplexState & IS_OPENING) === OPENING) { - stream._duplexState = (stream._duplexState | ACTIVE) & NOT_OPENING - stream._open(afterOpen.bind(this)) - } - } - - updateNextTick () { - if ((this.stream._duplexState & WRITE_NEXT_TICK) !== 0) return - this.stream._duplexState |= WRITE_NEXT_TICK - queueTick(this.afterUpdateNextTick) - } -} - -class ReadableState { - constructor (stream, { highWaterMark = 16384, map = null, mapReadable, byteLength, byteLengthReadable } = {}) { - this.stream = stream - this.queue = new FIFO() - this.highWaterMark = highWaterMark - this.buffered = 0 - this.error = null - this.pipeline = null - this.byteLength = byteLengthReadable || byteLength || defaultByteLength - this.map = mapReadable || map - this.pipeTo = null - this.afterRead = afterRead.bind(this) - this.afterUpdateNextTick = updateReadNT.bind(this) - } - - get ended () { - return (this.stream._duplexState & READ_DONE) !== 0 - } - - pipe (pipeTo, cb) { - if (this.pipeTo !== null) throw new Error('Can only pipe to one destination') - - this.stream._duplexState |= READ_PIPE_DRAINED - this.pipeTo = pipeTo - this.pipeline = new Pipeline(this.stream, pipeTo, cb || null) - - if (cb) this.stream.on('error', noop) // We already error handle this so supress crashes - - if (isStreamx(pipeTo)) { - pipeTo._writableState.pipeline = this.pipeline - if (cb) pipeTo.on('error', noop) // We already error handle this so supress crashes - pipeTo.on('finish', this.pipeline.finished.bind(this.pipeline)) // TODO: just call finished from pipeTo itself - } else { - const onerror = this.pipeline.done.bind(this.pipeline, pipeTo) - const onclose = this.pipeline.done.bind(this.pipeline, pipeTo, null) // onclose has a weird bool arg - pipeTo.on('error', onerror) - pipeTo.on('close', onclose) - pipeTo.on('finish', this.pipeline.finished.bind(this.pipeline)) - } - - pipeTo.on('drain', afterDrain.bind(this)) - this.stream.emit('piping', pipeTo) - pipeTo.emit('pipe', this.stream) - } - - push (data) { - const stream = this.stream - - if (data === null) { - this.highWaterMark = 0 - stream._duplexState = (stream._duplexState | READ_ENDING) & READ_NON_PRIMARY_AND_PUSHED - return false - } - - if (this.map !== null) data = this.map(data) - this.buffered += this.byteLength(data) - this.queue.push(data) - - stream._duplexState = (stream._duplexState | READ_QUEUED) & READ_PUSHED - - return this.buffered < this.highWaterMark - } - - shift () { - const data = this.queue.shift() - - this.buffered -= this.byteLength(data) - if (this.buffered === 0) this.stream._duplexState &= READ_NOT_QUEUED - return data - } - - unshift (data) { - let tail - const pending = [] - - while ((tail = this.queue.shift()) !== undefined) { - pending.push(tail) - } - - this.push(data) - - for (let i = 0; i < pending.length; i++) { - this.queue.push(pending[i]) - } - } - - read () { - const stream = this.stream - - if ((stream._duplexState & READ_STATUS) === READ_QUEUED) { - const data = this.shift() - if ((stream._duplexState & READ_EMIT_DATA) !== 0) stream.emit('data', data) - if (this.pipeTo !== null && this.pipeTo.write(data) === false) stream._duplexState &= READ_PIPE_NOT_DRAINED - return data - } - - return null - } - - drain () { - const stream = this.stream - - while ((stream._duplexState & READ_STATUS) === READ_QUEUED && (stream._duplexState & READ_FLOWING) !== 0) { - const data = this.shift() - if ((stream._duplexState & READ_EMIT_DATA) !== 0) stream.emit('data', data) - if (this.pipeTo !== null && this.pipeTo.write(data) === false) stream._duplexState &= READ_PIPE_NOT_DRAINED - } - } - - update () { - const stream = this.stream - - this.drain() - - while (this.buffered < this.highWaterMark && (stream._duplexState & SHOULD_NOT_READ) === 0) { - stream._duplexState |= READ_ACTIVE_AND_SYNC_AND_NEEDS_PUSH - stream._read(this.afterRead) - stream._duplexState &= READ_NOT_SYNC - if ((stream._duplexState & READ_ACTIVE) === 0) this.drain() - } - - if ((stream._duplexState & READ_READABLE_STATUS) === READ_EMIT_READABLE_AND_QUEUED) { - stream._duplexState |= READ_EMITTED_READABLE - stream.emit('readable') - } - - if ((stream._duplexState & READ_PRIMARY_AND_ACTIVE) === 0) this.updateNonPrimary() - } - - updateNonPrimary () { - const stream = this.stream - - if ((stream._duplexState & READ_ENDING_STATUS) === READ_ENDING) { - stream._duplexState = (stream._duplexState | READ_DONE) & READ_NOT_ENDING - stream.emit('end') - if ((stream._duplexState & AUTO_DESTROY) === DONE) stream._duplexState |= DESTROYING - if (this.pipeTo !== null) this.pipeTo.end() - } - - if ((stream._duplexState & DESTROY_STATUS) === DESTROYING) { - if ((stream._duplexState & ACTIVE_OR_TICKING) === 0) { - stream._duplexState |= ACTIVE - stream._destroy(afterDestroy.bind(this)) - } - return - } - - if ((stream._duplexState & IS_OPENING) === OPENING) { - stream._duplexState = (stream._duplexState | ACTIVE) & NOT_OPENING - stream._open(afterOpen.bind(this)) - } - } - - updateNextTick () { - if ((this.stream._duplexState & READ_NEXT_TICK) !== 0) return - this.stream._duplexState |= READ_NEXT_TICK - queueTick(this.afterUpdateNextTick) - } -} - -class TransformState { - constructor (stream) { - this.data = null - this.afterTransform = afterTransform.bind(stream) - this.afterFinal = null - } -} - -class Pipeline { - constructor (src, dst, cb) { - this.from = src - this.to = dst - this.afterPipe = cb - this.error = null - this.pipeToFinished = false - } - - finished () { - this.pipeToFinished = true - } - - done (stream, err) { - if (err) this.error = err - - if (stream === this.to) { - this.to = null - - if (this.from !== null) { - if ((this.from._duplexState & READ_DONE) === 0 || !this.pipeToFinished) { - this.from.destroy(this.error || new Error('Writable stream closed prematurely')) - } - return - } - } - - if (stream === this.from) { - this.from = null - - if (this.to !== null) { - if ((stream._duplexState & READ_DONE) === 0) { - this.to.destroy(this.error || new Error('Readable stream closed before ending')) - } - return - } - } - - if (this.afterPipe !== null) this.afterPipe(this.error) - this.to = this.from = this.afterPipe = null - } -} - -function afterDrain () { - this.stream._duplexState |= READ_PIPE_DRAINED - if ((this.stream._duplexState & READ_ACTIVE_AND_SYNC) === 0) this.updateNextTick() -} - -function afterFinal (err) { - const stream = this.stream - if (err) stream.destroy(err) - if ((stream._duplexState & DESTROY_STATUS) === 0) { - stream._duplexState |= WRITE_DONE - stream.emit('finish') - } - if ((stream._duplexState & AUTO_DESTROY) === DONE) { - stream._duplexState |= DESTROYING - } - - stream._duplexState &= WRITE_NOT_ACTIVE - this.update() -} - -function afterDestroy (err) { - const stream = this.stream - - if (!err && this.error !== STREAM_DESTROYED) err = this.error - if (err) stream.emit('error', err) - stream._duplexState |= DESTROYED - stream.emit('close') - - const rs = stream._readableState - const ws = stream._writableState - - if (rs !== null && rs.pipeline !== null) rs.pipeline.done(stream, err) - if (ws !== null && ws.pipeline !== null) ws.pipeline.done(stream, err) -} - -function afterWrite (err) { - const stream = this.stream - - if (err) stream.destroy(err) - stream._duplexState &= WRITE_NOT_ACTIVE - - if ((stream._duplexState & WRITE_DRAIN_STATUS) === WRITE_UNDRAINED) { - stream._duplexState &= WRITE_DRAINED - if ((stream._duplexState & WRITE_EMIT_DRAIN) === WRITE_EMIT_DRAIN) { - stream.emit('drain') - } - } - - if ((stream._duplexState & WRITE_SYNC) === 0) this.update() -} - -function afterRead (err) { - if (err) this.stream.destroy(err) - this.stream._duplexState &= READ_NOT_ACTIVE - if ((this.stream._duplexState & READ_SYNC) === 0) this.update() -} - -function updateReadNT () { - this.stream._duplexState &= READ_NOT_NEXT_TICK - this.update() -} - -function updateWriteNT () { - this.stream._duplexState &= WRITE_NOT_NEXT_TICK - this.update() -} - -function afterOpen (err) { - const stream = this.stream - - if (err) stream.destroy(err) - - if ((stream._duplexState & DESTROYING) === 0) { - if ((stream._duplexState & READ_PRIMARY_STATUS) === 0) stream._duplexState |= READ_PRIMARY - if ((stream._duplexState & WRITE_PRIMARY_STATUS) === 0) stream._duplexState |= WRITE_PRIMARY - stream.emit('open') - } - - stream._duplexState &= NOT_ACTIVE - - if (stream._writableState !== null) { - stream._writableState.update() - } - - if (stream._readableState !== null) { - stream._readableState.update() - } -} - -function afterTransform (err, data) { - if (data !== undefined && data !== null) this.push(data) - this._writableState.afterWrite(err) -} - -class Stream extends EventEmitter { - constructor (opts) { - super() - - this._duplexState = 0 - this._readableState = null - this._writableState = null - - if (opts) { - if (opts.open) this._open = opts.open - if (opts.destroy) this._destroy = opts.destroy - if (opts.predestroy) this._predestroy = opts.predestroy - if (opts.signal) { - opts.signal.addEventListener('abort', abort.bind(this)) - } - } - } - - _open (cb) { - cb(null) - } - - _destroy (cb) { - cb(null) - } - - _predestroy () { - // does nothing - } - - get readable () { - return this._readableState !== null ? true : undefined - } - - get writable () { - return this._writableState !== null ? true : undefined - } - - get destroyed () { - return (this._duplexState & DESTROYED) !== 0 - } - - get destroying () { - return (this._duplexState & DESTROY_STATUS) !== 0 - } - - destroy (err) { - if ((this._duplexState & DESTROY_STATUS) === 0) { - if (!err) err = STREAM_DESTROYED - this._duplexState = (this._duplexState | DESTROYING) & NON_PRIMARY - if (this._readableState !== null) { - this._readableState.error = err - this._readableState.updateNextTick() - } - if (this._writableState !== null) { - this._writableState.error = err - this._writableState.updateNextTick() - } - this._predestroy() - } - } - - on (name, fn) { - if (this._readableState !== null) { - if (name === 'data') { - this._duplexState |= (READ_EMIT_DATA | READ_RESUMED) - this._readableState.updateNextTick() - } - if (name === 'readable') { - this._duplexState |= READ_EMIT_READABLE - this._readableState.updateNextTick() - } - } - - if (this._writableState !== null) { - if (name === 'drain') { - this._duplexState |= WRITE_EMIT_DRAIN - this._writableState.updateNextTick() - } - } - - return super.on(name, fn) - } -} - -class Readable extends Stream { - constructor (opts) { - super(opts) - - this._duplexState |= OPENING | WRITE_DONE - this._readableState = new ReadableState(this, opts) - - if (opts) { - if (opts.read) this._read = opts.read - } - } - - _read (cb) { - cb(null) - } - - pipe (dest, cb) { - this._readableState.pipe(dest, cb) - this._readableState.updateNextTick() - return dest - } - - read () { - this._readableState.updateNextTick() - return this._readableState.read() - } - - push (data) { - this._readableState.updateNextTick() - return this._readableState.push(data) - } - - unshift (data) { - this._readableState.updateNextTick() - return this._readableState.unshift(data) - } - - resume () { - this._duplexState |= READ_RESUMED - this._readableState.updateNextTick() - return this - } - - pause () { - this._duplexState &= READ_PAUSED - return this - } - - static _fromAsyncIterator (ite, opts) { - let destroy - - const rs = new Readable({ - ...opts, - read (cb) { - ite.next().then(push).then(cb.bind(null, null)).catch(cb) - }, - predestroy () { - destroy = ite.return() - }, - destroy (cb) { - destroy.then(cb.bind(null, null)).catch(cb) - } - }) - - return rs - - function push (data) { - if (data.done) rs.push(null) - else rs.push(data.value) - } - } - - static from (data, opts) { - if (isReadStreamx(data)) return data - if (data[asyncIterator]) return this._fromAsyncIterator(data[asyncIterator](), opts) - if (!Array.isArray(data)) data = data === undefined ? [] : [data] - - let i = 0 - return new Readable({ - ...opts, - read (cb) { - this.push(i === data.length ? null : data[i++]) - cb(null) - } - }) - } - - static isBackpressured (rs) { - return (rs._duplexState & READ_BACKPRESSURE_STATUS) !== 0 || rs._readableState.buffered >= rs._readableState.highWaterMark - } - - static isPaused (rs) { - return (rs._duplexState & READ_RESUMED) === 0 - } - - [asyncIterator] () { - const stream = this - - let error = null - let promiseResolve = null - let promiseReject = null - - this.on('error', (err) => { error = err }) - this.on('readable', onreadable) - this.on('close', onclose) - - return { - [asyncIterator] () { - return this - }, - next () { - return new Promise(function (resolve, reject) { - promiseResolve = resolve - promiseReject = reject - const data = stream.read() - if (data !== null) ondata(data) - else if ((stream._duplexState & DESTROYED) !== 0) ondata(null) - }) - }, - return () { - return destroy(null) - }, - throw (err) { - return destroy(err) - } - } - - function onreadable () { - if (promiseResolve !== null) ondata(stream.read()) - } - - function onclose () { - if (promiseResolve !== null) ondata(null) - } - - function ondata (data) { - if (promiseReject === null) return - if (error) promiseReject(error) - else if (data === null && (stream._duplexState & READ_DONE) === 0) promiseReject(STREAM_DESTROYED) - else promiseResolve({ value: data, done: data === null }) - promiseReject = promiseResolve = null - } - - function destroy (err) { - stream.destroy(err) - return new Promise((resolve, reject) => { - if (stream._duplexState & DESTROYED) return resolve({ value: undefined, done: true }) - stream.once('close', function () { - if (err) reject(err) - else resolve({ value: undefined, done: true }) - }) - }) - } - } -} - -class Writable extends Stream { - constructor (opts) { - super(opts) - - this._duplexState |= OPENING | READ_DONE - this._writableState = new WritableState(this, opts) - - if (opts) { - if (opts.writev) this._writev = opts.writev - if (opts.write) this._write = opts.write - if (opts.final) this._final = opts.final - } - } - - _writev (batch, cb) { - cb(null) - } - - _write (data, cb) { - this._writableState.autoBatch(data, cb) - } - - _final (cb) { - cb(null) - } - - static isBackpressured (ws) { - return (ws._duplexState & WRITE_BACKPRESSURE_STATUS) !== 0 - } - - write (data) { - this._writableState.updateNextTick() - return this._writableState.push(data) - } - - end (data) { - this._writableState.updateNextTick() - this._writableState.end(data) - return this - } -} - -class Duplex extends Readable { // and Writable - constructor (opts) { - super(opts) - - this._duplexState = OPENING - this._writableState = new WritableState(this, opts) - - if (opts) { - if (opts.writev) this._writev = opts.writev - if (opts.write) this._write = opts.write - if (opts.final) this._final = opts.final - } - } - - _writev (batch, cb) { - cb(null) - } - - _write (data, cb) { - this._writableState.autoBatch(data, cb) - } - - _final (cb) { - cb(null) - } - - write (data) { - this._writableState.updateNextTick() - return this._writableState.push(data) - } - - end (data) { - this._writableState.updateNextTick() - this._writableState.end(data) - return this - } -} - -class Transform extends Duplex { - constructor (opts) { - super(opts) - this._transformState = new TransformState(this) - - if (opts) { - if (opts.transform) this._transform = opts.transform - if (opts.flush) this._flush = opts.flush - } - } - - _write (data, cb) { - if (this._readableState.buffered >= this._readableState.highWaterMark) { - this._transformState.data = data - } else { - this._transform(data, this._transformState.afterTransform) - } - } - - _read (cb) { - if (this._transformState.data !== null) { - const data = this._transformState.data - this._transformState.data = null - cb(null) - this._transform(data, this._transformState.afterTransform) - } else { - cb(null) - } - } - - _transform (data, cb) { - cb(null, data) - } - - _flush (cb) { - cb(null) - } - - _final (cb) { - this._transformState.afterFinal = cb - this._flush(transformAfterFlush.bind(this)) - } -} - -class PassThrough extends Transform {} - -function transformAfterFlush (err, data) { - const cb = this._transformState.afterFinal - if (err) return cb(err) - if (data !== null && data !== undefined) this.push(data) - this.push(null) - cb(null) -} - -function pipelinePromise (...streams) { - return new Promise((resolve, reject) => { - return pipeline(...streams, (err) => { - if (err) return reject(err) - resolve() - }) - }) -} - -function pipeline (stream, ...streams) { - const all = Array.isArray(stream) ? [...stream, ...streams] : [stream, ...streams] - const done = (all.length && typeof all[all.length - 1] === 'function') ? all.pop() : null - - if (all.length < 2) throw new Error('Pipeline requires at least 2 streams') - - let src = all[0] - let dest = null - let error = null - - for (let i = 1; i < all.length; i++) { - dest = all[i] - - if (isStreamx(src)) { - src.pipe(dest, onerror) - } else { - errorHandle(src, true, i > 1, onerror) - src.pipe(dest) - } - - src = dest - } - - if (done) { - let fin = false - - dest.on('finish', () => { fin = true }) - dest.on('error', err => { error = error || err }) - dest.on('close', () => done(error || (fin ? null : PREMATURE_CLOSE))) - } - - return dest - - function errorHandle (s, rd, wr, onerror) { - s.on('error', onerror) - s.on('close', onclose) - - function onclose () { - if (rd && s._readableState && !s._readableState.ended) return onerror(PREMATURE_CLOSE) - if (wr && s._writableState && !s._writableState.ended) return onerror(PREMATURE_CLOSE) - } - } - - function onerror (err) { - if (!err || error) return - error = err - - for (const s of all) { - s.destroy(err) - } - } -} - -function isStream (stream) { - return !!stream._readableState || !!stream._writableState -} - -function isStreamx (stream) { - return typeof stream._duplexState === 'number' && isStream(stream) -} - -function isReadStreamx (stream) { - return isStreamx(stream) && stream.readable -} - -function isTypedArray (data) { - return typeof data === 'object' && data !== null && typeof data.byteLength === 'number' -} - -function defaultByteLength (data) { - return isTypedArray(data) ? data.byteLength : 1024 -} - -function noop () {} - -function abort () { - this.destroy(new Error('Stream aborted.')) -} - -module.exports = { - pipeline, - pipelinePromise, - isStream, - isStreamx, - Stream, - Writable, - Readable, - Duplex, - Transform, - // Export PassThrough for compatibility with Node.js core's stream module - PassThrough -} - - -/***/ }), - -/***/ "./node_modules/string_decoder/lib/string_decoder.js": -/*!***********************************************************!*\ - !*** ./node_modules/string_decoder/lib/string_decoder.js ***! - \***********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - - -/**/ - -var Buffer = __webpack_require__(/*! safe-buffer */ "./node_modules/safe-buffer/index.js").Buffer; -/**/ - -var isEncoding = Buffer.isEncoding || function (encoding) { - encoding = '' + encoding; - switch (encoding && encoding.toLowerCase()) { - case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw': - return true; - default: - return false; - } -}; - -function _normalizeEncoding(enc) { - if (!enc) return 'utf8'; - var retried; - while (true) { - switch (enc) { - case 'utf8': - case 'utf-8': - return 'utf8'; - case 'ucs2': - case 'ucs-2': - case 'utf16le': - case 'utf-16le': - return 'utf16le'; - case 'latin1': - case 'binary': - return 'latin1'; - case 'base64': - case 'ascii': - case 'hex': - return enc; - default: - if (retried) return; // undefined - enc = ('' + enc).toLowerCase(); - retried = true; - } - } -}; - -// Do not cache `Buffer.isEncoding` when checking encoding names as some -// modules monkey-patch it to support additional encodings -function normalizeEncoding(enc) { - var nenc = _normalizeEncoding(enc); - if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc); - return nenc || enc; -} - -// StringDecoder provides an interface for efficiently splitting a series of -// buffers into a series of JS strings without breaking apart multi-byte -// characters. -exports.StringDecoder = StringDecoder; -function StringDecoder(encoding) { - this.encoding = normalizeEncoding(encoding); - var nb; - switch (this.encoding) { - case 'utf16le': - this.text = utf16Text; - this.end = utf16End; - nb = 4; - break; - case 'utf8': - this.fillLast = utf8FillLast; - nb = 4; - break; - case 'base64': - this.text = base64Text; - this.end = base64End; - nb = 3; - break; - default: - this.write = simpleWrite; - this.end = simpleEnd; - return; - } - this.lastNeed = 0; - this.lastTotal = 0; - this.lastChar = Buffer.allocUnsafe(nb); -} - -StringDecoder.prototype.write = function (buf) { - if (buf.length === 0) return ''; - var r; - var i; - if (this.lastNeed) { - r = this.fillLast(buf); - if (r === undefined) return ''; - i = this.lastNeed; - this.lastNeed = 0; - } else { - i = 0; - } - if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i); - return r || ''; -}; - -StringDecoder.prototype.end = utf8End; - -// Returns only complete characters in a Buffer -StringDecoder.prototype.text = utf8Text; - -// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer -StringDecoder.prototype.fillLast = function (buf) { - if (this.lastNeed <= buf.length) { - buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, this.lastNeed); - return this.lastChar.toString(this.encoding, 0, this.lastTotal); - } - buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length); - this.lastNeed -= buf.length; -}; - -// Checks the type of a UTF-8 byte, whether it's ASCII, a leading byte, or a -// continuation byte. If an invalid byte is detected, -2 is returned. -function utf8CheckByte(byte) { - 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; - return byte >> 6 === 0x02 ? -1 : -2; -} - -// Checks at most 3 bytes at the end of a Buffer in order to detect an -// incomplete multi-byte UTF-8 character. The total number of bytes (2, 3, or 4) -// needed to complete the UTF-8 character (if applicable) are returned. -function utf8CheckIncomplete(self, buf, i) { - var j = buf.length - 1; - if (j < i) return 0; - var nb = utf8CheckByte(buf[j]); - if (nb >= 0) { - if (nb > 0) self.lastNeed = nb - 1; - return nb; - } - if (--j < i || nb === -2) return 0; - nb = utf8CheckByte(buf[j]); - if (nb >= 0) { - if (nb > 0) self.lastNeed = nb - 2; - return nb; - } - if (--j < i || nb === -2) return 0; - nb = utf8CheckByte(buf[j]); - if (nb >= 0) { - if (nb > 0) { - if (nb === 2) nb = 0;else self.lastNeed = nb - 3; - } - return nb; - } - return 0; -} - -// Validates as many continuation bytes for a multi-byte UTF-8 character as -// needed or are available. If we see a non-continuation byte where we expect -// one, we "replace" the validated continuation bytes we've seen so far with -// a single UTF-8 replacement character ('\ufffd'), to match v8's UTF-8 decoding -// behavior. The continuation byte check is included three times in the case -// where all of the continuation bytes for a character exist in the same buffer. -// It is also done this way as a slight performance increase instead of using a -// loop. -function utf8CheckExtraBytes(self, buf, p) { - if ((buf[0] & 0xC0) !== 0x80) { - self.lastNeed = 0; - return '\ufffd'; - } - if (self.lastNeed > 1 && buf.length > 1) { - if ((buf[1] & 0xC0) !== 0x80) { - self.lastNeed = 1; - return '\ufffd'; - } - if (self.lastNeed > 2 && buf.length > 2) { - if ((buf[2] & 0xC0) !== 0x80) { - self.lastNeed = 2; - return '\ufffd'; - } - } - } -} - -// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer. -function utf8FillLast(buf) { - var p = this.lastTotal - this.lastNeed; - var r = utf8CheckExtraBytes(this, buf, p); - if (r !== undefined) return r; - if (this.lastNeed <= buf.length) { - buf.copy(this.lastChar, p, 0, this.lastNeed); - return this.lastChar.toString(this.encoding, 0, this.lastTotal); - } - buf.copy(this.lastChar, p, 0, buf.length); - this.lastNeed -= buf.length; -} - -// Returns all complete UTF-8 characters in a Buffer. If the Buffer ended on a -// partial character, the character's bytes are buffered until the required -// number of bytes are available. -function utf8Text(buf, i) { - var total = utf8CheckIncomplete(this, buf, i); - if (!this.lastNeed) return buf.toString('utf8', i); - this.lastTotal = total; - var end = buf.length - (total - this.lastNeed); - buf.copy(this.lastChar, 0, end); - return buf.toString('utf8', i, end); -} - -// For UTF-8, a replacement character is added when ending on a partial -// character. -function utf8End(buf) { - var r = buf && buf.length ? this.write(buf) : ''; - if (this.lastNeed) return r + '\ufffd'; - return r; -} - -// UTF-16LE typically needs two bytes per character, but even if we have an even -// number of bytes available, we need to check if we end on a leading/high -// surrogate. In that case, we need to wait for the next two bytes in order to -// decode the last character properly. -function utf16Text(buf, i) { - if ((buf.length - i) % 2 === 0) { - var r = buf.toString('utf16le', i); - if (r) { - var c = r.charCodeAt(r.length - 1); - if (c >= 0xD800 && c <= 0xDBFF) { - this.lastNeed = 2; - this.lastTotal = 4; - this.lastChar[0] = buf[buf.length - 2]; - this.lastChar[1] = buf[buf.length - 1]; - return r.slice(0, -1); - } - } - return r; - } - this.lastNeed = 1; - this.lastTotal = 2; - this.lastChar[0] = buf[buf.length - 1]; - return buf.toString('utf16le', i, buf.length - 1); -} - -// For UTF-16LE we do not explicitly append special replacement characters if we -// end on a partial character, we simply let v8 handle that. -function utf16End(buf) { - var r = buf && buf.length ? this.write(buf) : ''; - if (this.lastNeed) { - var end = this.lastTotal - this.lastNeed; - return r + this.lastChar.toString('utf16le', 0, end); - } - return r; -} - -function base64Text(buf, i) { - var n = (buf.length - i) % 3; - if (n === 0) return buf.toString('base64', i); - this.lastNeed = 3 - n; - this.lastTotal = 3; - if (n === 1) { - this.lastChar[0] = buf[buf.length - 1]; - } else { - this.lastChar[0] = buf[buf.length - 2]; - this.lastChar[1] = buf[buf.length - 1]; - } - return buf.toString('base64', i, buf.length - n); -} - -function base64End(buf) { - var r = buf && buf.length ? this.write(buf) : ''; - if (this.lastNeed) return r + this.lastChar.toString('base64', 0, 3 - this.lastNeed); - return r; -} - -// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex) -function simpleWrite(buf) { - return buf.toString(this.encoding); -} - -function simpleEnd(buf) { - return buf && buf.length ? this.write(buf) : ''; -} - -/***/ }), - -/***/ "./node_modules/thirty-two/lib/thirty-two/index.js": -/*!*********************************************************!*\ - !*** ./node_modules/thirty-two/lib/thirty-two/index.js ***! - \*********************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* -Copyright (c) 2011, Chris Umbel - -Permission is hereby granted, free of charge, to any person obtaining a copy -of this software and associated documentation files (the "Software"), to deal -in the Software without restriction, including without limitation the rights -to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -copies of the Software, and to permit persons to whom the Software is -furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in -all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN -THE SOFTWARE. -*/ - -var base32 = __webpack_require__(/*! ./thirty-two */ "./node_modules/thirty-two/lib/thirty-two/thirty-two.js"); - -exports.encode = base32.encode; -exports.decode = base32.decode; - - -/***/ }), - -/***/ "./node_modules/thirty-two/lib/thirty-two/thirty-two.js": -/*!**************************************************************!*\ - !*** ./node_modules/thirty-two/lib/thirty-two/thirty-two.js ***! - \**************************************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/* -Copyright (c) 2011, Chris Umbel - -Permission is hereby granted, free of charge, to any person obtaining a copy -of this software and associated documentation files (the "Software"), to deal -in the Software without restriction, including without limitation the rights -to use, copy, modify, merge, publish, distribute, sublicense, and/or sell -copies of the Software, and to permit persons to whom the Software is -furnished to do so, subject to the following conditions: - -The above copyright notice and this permission notice shall be included in -all copies or substantial portions of the Software. - -THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR -IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, -FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE -AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER -LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, -OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN -THE SOFTWARE. -*/ - - -var charTable = "ABCDEFGHIJKLMNOPQRSTUVWXYZ234567"; -var byteTable = [ - 0xff, 0xff, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f, - 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, - 0xff, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, - 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, - 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, - 0x17, 0x18, 0x19, 0xff, 0xff, 0xff, 0xff, 0xff, - 0xff, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06, - 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e, - 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16, - 0x17, 0x18, 0x19, 0xff, 0xff, 0xff, 0xff, 0xff -]; - -function quintetCount(buff) { - var quintets = Math.floor(buff.length / 5); - return buff.length % 5 === 0 ? quintets: quintets + 1; -} - -exports.encode = function(plain) { - if(!Buffer.isBuffer(plain)){ - plain = new Buffer(plain); - } - var i = 0; - var j = 0; - var shiftIndex = 0; - var digit = 0; - var encoded = new Buffer(quintetCount(plain) * 8); - - /* byte by byte isn't as pretty as quintet by quintet but tests a bit - faster. will have to revisit. */ - while(i < plain.length) { - var current = plain[i]; - - if(shiftIndex > 3) { - digit = current & (0xff >> shiftIndex); - shiftIndex = (shiftIndex + 5) % 8; - digit = (digit << shiftIndex) | ((i + 1 < plain.length) ? - plain[i + 1] : 0) >> (8 - shiftIndex); - i++; - } else { - digit = (current >> (8 - (shiftIndex + 5))) & 0x1f; - shiftIndex = (shiftIndex + 5) % 8; - if(shiftIndex === 0) i++; - } - - encoded[j] = charTable.charCodeAt(digit); - j++; - } - - for(i = j; i < encoded.length; i++) { - encoded[i] = 0x3d; //'='.charCodeAt(0) - } - - return encoded; -}; - -exports.decode = function(encoded) { - var shiftIndex = 0; - var plainDigit = 0; - var plainChar; - var plainPos = 0; - if(!Buffer.isBuffer(encoded)){ - encoded = new Buffer(encoded); - } - var decoded = new Buffer(Math.ceil(encoded.length * 5 / 8)); - - /* byte by byte isn't as pretty as octet by octet but tests a bit - faster. will have to revisit. */ - for(var i = 0; i < encoded.length; i++) { - if(encoded[i] === 0x3d){ //'=' - break; - } - - var encodedByte = encoded[i] - 0x30; - - if(encodedByte < byteTable.length) { - plainDigit = byteTable[encodedByte]; - - if(shiftIndex <= 3) { - shiftIndex = (shiftIndex + 5) % 8; - - if(shiftIndex === 0) { - plainChar |= plainDigit; - decoded[plainPos] = plainChar; - plainPos++; - plainChar = 0; - } else { - plainChar |= 0xff & (plainDigit << (8 - shiftIndex)); - } - } else { - shiftIndex = (shiftIndex + 5) % 8; - plainChar |= 0xff & (plainDigit >>> shiftIndex); - decoded[plainPos] = plainChar; - plainPos++; - - plainChar = 0xff & (plainDigit << (8 - shiftIndex)); - } - } else { - throw new Error('Invalid input - it is not base32 encoded string'); - } - } - - return decoded.slice(0, plainPos); -}; - - -/***/ }), - -/***/ "./node_modules/to-arraybuffer/index.js": -/*!**********************************************!*\ - !*** ./node_modules/to-arraybuffer/index.js ***! - \**********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -var Buffer = __webpack_require__(/*! buffer */ "./node_modules/buffer/index.js").Buffer - -module.exports = function (buf) { - // If the buffer is backed by a Uint8Array, a faster version will work - if (buf instanceof Uint8Array) { - // If the buffer isn't a subarray, return the underlying ArrayBuffer - if (buf.byteOffset === 0 && buf.byteLength === buf.buffer.byteLength) { - return buf.buffer - } else if (typeof buf.buffer.slice === 'function') { - // Otherwise we need to get a proper copy - return buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength) - } - } - - if (Buffer.isBuffer(buf)) { - // This is the slow version that will work with any Buffer - // implementation (even in old browsers) - var arrayCopy = new Uint8Array(buf.length) - var len = buf.length - for (var i = 0; i < len; i++) { - arrayCopy[i] = buf[i] - } - return arrayCopy.buffer - } else { - throw new Error('Argument must be a Buffer') - } -} - - -/***/ }), - -/***/ "./node_modules/torrent-discovery/index.js": -/*!*************************************************!*\ - !*** ./node_modules/torrent-discovery/index.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -/*! torrent-discovery. MIT License. WebTorrent LLC */ -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('torrent-discovery') -const DHT = __webpack_require__(/*! bittorrent-dht/client */ "?42e5") // empty object in browser -const EventEmitter = __webpack_require__(/*! events */ "./node_modules/events/events.js").EventEmitter -const parallel = __webpack_require__(/*! run-parallel */ "./node_modules/run-parallel/index.js") -const Tracker = __webpack_require__(/*! bittorrent-tracker/client */ "./node_modules/bittorrent-tracker/client.js") -const LSD = __webpack_require__(/*! bittorrent-lsd */ "?72f0") - -class Discovery extends EventEmitter { - constructor (opts) { - super() - - if (!opts.peerId) throw new Error('Option `peerId` is required') - if (!opts.infoHash) throw new Error('Option `infoHash` is required') - if (!process.browser && !opts.port) throw new Error('Option `port` is required') - - this.peerId = typeof opts.peerId === 'string' - ? opts.peerId - : opts.peerId.toString('hex') - this.infoHash = typeof opts.infoHash === 'string' - ? opts.infoHash.toLowerCase() - : opts.infoHash.toString('hex') - this._port = opts.port // torrent port - this._userAgent = opts.userAgent // User-Agent header for http requests - - this.destroyed = false - - this._announce = opts.announce || [] - this._intervalMs = opts.intervalMs || (15 * 60 * 1000) - this._trackerOpts = null - this._dhtAnnouncing = false - this._dhtTimeout = false - this._internalDHT = false // is the DHT created internally? - - this._onWarning = err => { - this.emit('warning', err) - } - this._onError = err => { - this.emit('error', err) - } - this._onDHTPeer = (peer, infoHash) => { - if (infoHash.toString('hex') !== this.infoHash) return - this.emit('peer', `${peer.host}:${peer.port}`, 'dht') - } - this._onTrackerPeer = peer => { - this.emit('peer', peer, 'tracker') - } - this._onTrackerAnnounce = () => { - this.emit('trackerAnnounce') - } - this._onLSDPeer = (peer, infoHash) => { - this.emit('peer', peer, 'lsd') - } - - const createDHT = (port, opts) => { - const dht = new DHT(opts) - dht.on('warning', this._onWarning) - dht.on('error', this._onError) - dht.listen(port) - this._internalDHT = true - return dht - } - - if (opts.tracker === false) { - this.tracker = null - } else if (opts.tracker && typeof opts.tracker === 'object') { - this._trackerOpts = Object.assign({}, opts.tracker) - this.tracker = this._createTracker() - } else { - this.tracker = this._createTracker() - } - - if (opts.dht === false || typeof DHT !== 'function') { - this.dht = null - } else if (opts.dht && typeof opts.dht.addNode === 'function') { - this.dht = opts.dht - } else if (opts.dht && typeof opts.dht === 'object') { - this.dht = createDHT(opts.dhtPort, opts.dht) - } else { - this.dht = createDHT(opts.dhtPort) - } - - if (this.dht) { - this.dht.on('peer', this._onDHTPeer) - this._dhtAnnounce() - } - - if (opts.lsd === false || typeof LSD !== 'function') { - this.lsd = null - } else { - this.lsd = this._createLSD() - } - } - - updatePort (port) { - if (port === this._port) return - this._port = port - - if (this.dht) this._dhtAnnounce() - - if (this.tracker) { - this.tracker.stop() - this.tracker.destroy(() => { - this.tracker = this._createTracker() - }) - } - } - - complete (opts) { - if (this.tracker) { - this.tracker.complete(opts) - } - } - - destroy (cb) { - if (this.destroyed) return - this.destroyed = true - - clearTimeout(this._dhtTimeout) - - const tasks = [] - - if (this.tracker) { - this.tracker.stop() - this.tracker.removeListener('warning', this._onWarning) - this.tracker.removeListener('error', this._onError) - this.tracker.removeListener('peer', this._onTrackerPeer) - this.tracker.removeListener('update', this._onTrackerAnnounce) - tasks.push(cb => { - this.tracker.destroy(cb) - }) - } - - if (this.dht) { - this.dht.removeListener('peer', this._onDHTPeer) - } - - if (this._internalDHT) { - this.dht.removeListener('warning', this._onWarning) - this.dht.removeListener('error', this._onError) - tasks.push(cb => { - this.dht.destroy(cb) - }) - } - - if (this.lsd) { - this.lsd.removeListener('warning', this._onWarning) - this.lsd.removeListener('error', this._onError) - this.lsd.removeListener('peer', this._onLSDPeer) - tasks.push(cb => { - this.lsd.destroy(cb) - }) - } - - parallel(tasks, cb) - - // cleanup - this.dht = null - this.tracker = null - this.lsd = null - this._announce = null - } - - _createTracker () { - const opts = Object.assign({}, this._trackerOpts, { - infoHash: this.infoHash, - announce: this._announce, - peerId: this.peerId, - port: this._port, - userAgent: this._userAgent - }) - - const tracker = new Tracker(opts) - tracker.on('warning', this._onWarning) - tracker.on('error', this._onError) - tracker.on('peer', this._onTrackerPeer) - tracker.on('update', this._onTrackerAnnounce) - tracker.setInterval(this._intervalMs) - tracker.start() - return tracker - } - - _dhtAnnounce () { - if (this._dhtAnnouncing) return - debug('dht announce') - - this._dhtAnnouncing = true - clearTimeout(this._dhtTimeout) - - this.dht.announce(this.infoHash, this._port, err => { - this._dhtAnnouncing = false - debug('dht announce complete') - - if (err) this.emit('warning', err) - this.emit('dhtAnnounce') - - if (!this.destroyed) { - this._dhtTimeout = setTimeout(() => { - this._dhtAnnounce() - }, this._intervalMs + Math.floor(Math.random() * this._intervalMs / 5)) - if (this._dhtTimeout.unref) this._dhtTimeout.unref() - } - }) - } - - _createLSD () { - const opts = Object.assign({}, { - infoHash: this.infoHash, - peerId: this.peerId, - port: this._port - }) - - const lsd = new LSD(opts) - lsd.on('warning', this._onWarning) - lsd.on('error', this._onError) - lsd.on('peer', this._onLSDPeer) - lsd.start() - return lsd - } -} - -module.exports = Discovery - - -/***/ }), - -/***/ "./node_modules/torrent-piece/index.js": -/*!*********************************************!*\ - !*** ./node_modules/torrent-piece/index.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! torrent-piece. MIT License. WebTorrent LLC */ -const BLOCK_LENGTH = 1 << 14 - -class Piece { - constructor (length) { - this.length = length - this.missing = length - this.sources = null - - this._chunks = Math.ceil(length / BLOCK_LENGTH) - this._remainder = (length % BLOCK_LENGTH) || BLOCK_LENGTH - this._buffered = 0 - this._buffer = null - this._cancellations = null - this._reservations = 0 - this._flushed = false - } - - chunkLength (i) { - return i === this._chunks - 1 ? this._remainder : BLOCK_LENGTH - } - - chunkLengthRemaining (i) { - return this.length - (i * BLOCK_LENGTH) - } - - chunkOffset (i) { - return i * BLOCK_LENGTH - } - - reserve () { - if (!this.init()) return -1 - if (this._cancellations.length) return this._cancellations.pop() - if (this._reservations < this._chunks) return this._reservations++ - return -1 - } - - reserveRemaining () { - if (!this.init()) return -1 - if (this._cancellations.length || this._reservations < this._chunks) { - let min = this._reservations - while (this._cancellations.length) { - min = Math.min(min, this._cancellations.pop()) - } - this._reservations = this._chunks - return min - } - return -1 - } - - cancel (i) { - if (!this.init()) return - this._cancellations.push(i) - } - - cancelRemaining (i) { - if (!this.init()) return - this._reservations = i - } - - get (i) { - if (!this.init()) return null - return this._buffer[i] - } - - set (i, data, source) { - if (!this.init()) return false - const len = data.length - const blocks = Math.ceil(len / BLOCK_LENGTH) - for (let j = 0; j < blocks; j++) { - if (!this._buffer[i + j]) { - const offset = j * BLOCK_LENGTH - const splitData = data.slice(offset, offset + BLOCK_LENGTH) - this._buffered++ - this._buffer[i + j] = splitData - this.missing -= splitData.length - if (!this.sources.includes(source)) { - this.sources.push(source) - } - } - } - return this._buffered === this._chunks - } - - flush () { - if (!this._buffer || this._chunks !== this._buffered) return null - const buffer = Buffer.concat(this._buffer, this.length) - this._buffer = null - this._cancellations = null - this.sources = null - this._flushed = true - return buffer - } - - init () { - if (this._flushed) return false - if (this._buffer) return true - this._buffer = new Array(this._chunks) - this._cancellations = [] - this.sources = [] - return true - } -} - -Object.defineProperty(Piece, 'BLOCK_LENGTH', { value: BLOCK_LENGTH }) - -module.exports = Piece - - -/***/ }), - -/***/ "./node_modules/typedarray-to-buffer/index.js": -/*!****************************************************!*\ - !*** ./node_modules/typedarray-to-buffer/index.js ***! - \****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/** - * Convert a typed array to a Buffer without a copy - * - * Author: Feross Aboukhadijeh - * License: MIT - * - * `npm install typedarray-to-buffer` - */ - -var isTypedArray = __webpack_require__(/*! is-typedarray */ "./node_modules/is-typedarray/index.js").strict - -module.exports = function typedarrayToBuffer (arr) { - if (isTypedArray(arr)) { - // To avoid a copy, use the typed array's underlying ArrayBuffer to back new Buffer - var buf = Buffer.from(arr.buffer) - if (arr.byteLength !== arr.buffer.byteLength) { - // Respect the "view", i.e. byteOffset and byteLength, without doing a copy - buf = buf.slice(arr.byteOffset, arr.byteOffset + arr.byteLength) - } - return buf - } else { - // Pass through all other types to `Buffer.from` - return Buffer.from(arr) - } -} - - -/***/ }), - -/***/ "./node_modules/uint64be/index.js": -/*!****************************************!*\ - !*** ./node_modules/uint64be/index.js ***! - \****************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -var bufferAlloc = __webpack_require__(/*! buffer-alloc */ "./node_modules/buffer-alloc/index.js") - -var UINT_32_MAX = Math.pow(2, 32) - -exports.encodingLength = function () { - return 8 -} - -exports.encode = function (num, buf, offset) { - if (!buf) buf = bufferAlloc(8) - if (!offset) offset = 0 - - var top = Math.floor(num / UINT_32_MAX) - var rem = num - top * UINT_32_MAX - - buf.writeUInt32BE(top, offset) - buf.writeUInt32BE(rem, offset + 4) - return buf -} - -exports.decode = function (buf, offset) { - if (!offset) offset = 0 - - var top = buf.readUInt32BE(offset) - var rem = buf.readUInt32BE(offset + 4) - - return top * UINT_32_MAX + rem -} - -exports.encode.bytes = 8 -exports.decode.bytes = 8 - - -/***/ }), - -/***/ "./node_modules/unordered-array-remove/index.js": -/*!******************************************************!*\ - !*** ./node_modules/unordered-array-remove/index.js ***! - \******************************************************/ -/***/ ((module) => { - -module.exports = remove - -function remove (arr, i) { - if (i >= arr.length || i < 0) return - var last = arr.pop() - if (i < arr.length) { - var tmp = arr[i] - arr[i] = last - return tmp - } - return last -} - - -/***/ }), - -/***/ "./node_modules/url/node_modules/punycode/punycode.js": -/*!************************************************************!*\ - !*** ./node_modules/url/node_modules/punycode/punycode.js ***! - \************************************************************/ -/***/ (function(module, exports, __webpack_require__) { - -/* module decorator */ module = __webpack_require__.nmd(module); -var __WEBPACK_AMD_DEFINE_RESULT__;/*! https://mths.be/punycode v1.3.2 by @mathias */ -;(function(root) { - - /** Detect free variables */ - var freeExports = true && exports && - !exports.nodeType && exports; - var freeModule = true && module && - !module.nodeType && module; - var freeGlobal = typeof __webpack_require__.g == 'object' && __webpack_require__.g; - if ( - freeGlobal.global === freeGlobal || - freeGlobal.window === freeGlobal || - freeGlobal.self === freeGlobal - ) { - root = freeGlobal; - } - - /** - * The `punycode` object. - * @name punycode - * @type Object - */ - var punycode, - - /** Highest positive signed 32-bit float value */ - maxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1 - - /** Bootstring parameters */ - base = 36, - tMin = 1, - tMax = 26, - skew = 38, - damp = 700, - initialBias = 72, - initialN = 128, // 0x80 - delimiter = '-', // '\x2D' - - /** Regular expressions */ - regexPunycode = /^xn--/, - regexNonASCII = /[^\x20-\x7E]/, // unprintable ASCII chars + non-ASCII chars - regexSeparators = /[\x2E\u3002\uFF0E\uFF61]/g, // RFC 3490 separators - - /** Error messages */ - errors = { - 'overflow': 'Overflow: input needs wider integers to process', - 'not-basic': 'Illegal input >= 0x80 (not a basic code point)', - 'invalid-input': 'Invalid input' - }, - - /** Convenience shortcuts */ - baseMinusTMin = base - tMin, - floor = Math.floor, - stringFromCharCode = String.fromCharCode, - - /** Temporary variable */ - key; - - /*--------------------------------------------------------------------------*/ - - /** - * A generic error utility function. - * @private - * @param {String} type The error type. - * @returns {Error} Throws a `RangeError` with the applicable error message. - */ - function error(type) { - throw RangeError(errors[type]); - } - - /** - * A generic `Array#map` utility function. - * @private - * @param {Array} array The array to iterate over. - * @param {Function} callback The function that gets called for every array - * item. - * @returns {Array} A new array of values returned by the callback function. - */ - function map(array, fn) { - var length = array.length; - var result = []; - while (length--) { - result[length] = fn(array[length]); - } - return result; - } - - /** - * A simple `Array#map`-like wrapper to work with domain name strings or email - * addresses. - * @private - * @param {String} domain The domain name or email address. - * @param {Function} callback The function that gets called for every - * character. - * @returns {Array} A new string of characters returned by the callback - * function. - */ - function mapDomain(string, fn) { - var parts = string.split('@'); - var result = ''; - if (parts.length > 1) { - // In email addresses, only the domain name should be punycoded. Leave - // the local part (i.e. everything up to `@`) intact. - result = parts[0] + '@'; - string = parts[1]; - } - // Avoid `split(regex)` for IE8 compatibility. See #17. - string = string.replace(regexSeparators, '\x2E'); - var labels = string.split('.'); - var encoded = map(labels, fn).join('.'); - return result + encoded; - } - - /** - * Creates an array containing the numeric code points of each Unicode - * character in the string. While JavaScript uses UCS-2 internally, - * this function will convert a pair of surrogate halves (each of which - * UCS-2 exposes as separate characters) into a single code point, - * matching UTF-16. - * @see `punycode.ucs2.encode` - * @see - * @memberOf punycode.ucs2 - * @name decode - * @param {String} string The Unicode input string (UCS-2). - * @returns {Array} The new array of code points. - */ - function ucs2decode(string) { - var output = [], - counter = 0, - length = string.length, - value, - extra; - while (counter < length) { - value = string.charCodeAt(counter++); - if (value >= 0xD800 && value <= 0xDBFF && counter < length) { - // high surrogate, and there is a next character - extra = string.charCodeAt(counter++); - if ((extra & 0xFC00) == 0xDC00) { // low surrogate - output.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000); - } else { - // unmatched surrogate; only append this code unit, in case the next - // code unit is the high surrogate of a surrogate pair - output.push(value); - counter--; - } - } else { - output.push(value); - } - } - return output; - } - - /** - * Creates a string based on an array of numeric code points. - * @see `punycode.ucs2.decode` - * @memberOf punycode.ucs2 - * @name encode - * @param {Array} codePoints The array of numeric code points. - * @returns {String} The new Unicode string (UCS-2). - */ - function ucs2encode(array) { - return map(array, function(value) { - var output = ''; - if (value > 0xFFFF) { - value -= 0x10000; - output += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800); - value = 0xDC00 | value & 0x3FF; - } - output += stringFromCharCode(value); - return output; - }).join(''); - } - - /** - * Converts a basic code point into a digit/integer. - * @see `digitToBasic()` - * @private - * @param {Number} codePoint The basic numeric code point value. - * @returns {Number} The numeric value of a basic code point (for use in - * representing integers) in the range `0` to `base - 1`, or `base` if - * the code point does not represent a value. - */ - function basicToDigit(codePoint) { - if (codePoint - 48 < 10) { - return codePoint - 22; - } - if (codePoint - 65 < 26) { - return codePoint - 65; - } - if (codePoint - 97 < 26) { - return codePoint - 97; - } - return base; - } - - /** - * Converts a digit/integer into a basic code point. - * @see `basicToDigit()` - * @private - * @param {Number} digit The numeric value of a basic code point. - * @returns {Number} The basic code point whose value (when used for - * representing integers) is `digit`, which needs to be in the range - * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is - * used; else, the lowercase form is used. The behavior is undefined - * if `flag` is non-zero and `digit` has no uppercase form. - */ - function digitToBasic(digit, flag) { - // 0..25 map to ASCII a..z or A..Z - // 26..35 map to ASCII 0..9 - return digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5); - } - - /** - * Bias adaptation function as per section 3.4 of RFC 3492. - * http://tools.ietf.org/html/rfc3492#section-3.4 - * @private - */ - function adapt(delta, numPoints, firstTime) { - var k = 0; - delta = firstTime ? floor(delta / damp) : delta >> 1; - delta += floor(delta / numPoints); - for (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) { - delta = floor(delta / baseMinusTMin); - } - return floor(k + (baseMinusTMin + 1) * delta / (delta + skew)); - } - - /** - * Converts a Punycode string of ASCII-only symbols to a string of Unicode - * symbols. - * @memberOf punycode - * @param {String} input The Punycode string of ASCII-only symbols. - * @returns {String} The resulting string of Unicode symbols. - */ - function decode(input) { - // Don't use UCS-2 - var output = [], - inputLength = input.length, - out, - i = 0, - n = initialN, - bias = initialBias, - basic, - j, - index, - oldi, - w, - k, - digit, - t, - /** Cached calculation results */ - baseMinusT; - - // Handle the basic code points: let `basic` be the number of input code - // points before the last delimiter, or `0` if there is none, then copy - // the first basic code points to the output. - - basic = input.lastIndexOf(delimiter); - if (basic < 0) { - basic = 0; - } - - for (j = 0; j < basic; ++j) { - // if it's not a basic code point - if (input.charCodeAt(j) >= 0x80) { - error('not-basic'); - } - output.push(input.charCodeAt(j)); - } - - // Main decoding loop: start just after the last delimiter if any basic code - // points were copied; start at the beginning otherwise. - - for (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) { - - // `index` is the index of the next character to be consumed. - // Decode a generalized variable-length integer into `delta`, - // which gets added to `i`. The overflow checking is easier - // if we increase `i` as we go, then subtract off its starting - // value at the end to obtain `delta`. - for (oldi = i, w = 1, k = base; /* no condition */; k += base) { - - if (index >= inputLength) { - error('invalid-input'); - } - - digit = basicToDigit(input.charCodeAt(index++)); - - if (digit >= base || digit > floor((maxInt - i) / w)) { - error('overflow'); - } - - i += digit * w; - t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias); - - if (digit < t) { - break; - } - - baseMinusT = base - t; - if (w > floor(maxInt / baseMinusT)) { - error('overflow'); - } - - w *= baseMinusT; - - } - - out = output.length + 1; - bias = adapt(i - oldi, out, oldi == 0); - - // `i` was supposed to wrap around from `out` to `0`, - // incrementing `n` each time, so we'll fix that now: - if (floor(i / out) > maxInt - n) { - error('overflow'); - } - - n += floor(i / out); - i %= out; - - // Insert `n` at position `i` of the output - output.splice(i++, 0, n); - - } - - return ucs2encode(output); - } - - /** - * Converts a string of Unicode symbols (e.g. a domain name label) to a - * Punycode string of ASCII-only symbols. - * @memberOf punycode - * @param {String} input The string of Unicode symbols. - * @returns {String} The resulting Punycode string of ASCII-only symbols. - */ - function encode(input) { - var n, - delta, - handledCPCount, - basicLength, - bias, - j, - m, - q, - k, - t, - currentValue, - output = [], - /** `inputLength` will hold the number of code points in `input`. */ - inputLength, - /** Cached calculation results */ - handledCPCountPlusOne, - baseMinusT, - qMinusT; - - // Convert the input in UCS-2 to Unicode - input = ucs2decode(input); - - // Cache the length - inputLength = input.length; - - // Initialize the state - n = initialN; - delta = 0; - bias = initialBias; - - // Handle the basic code points - for (j = 0; j < inputLength; ++j) { - currentValue = input[j]; - if (currentValue < 0x80) { - output.push(stringFromCharCode(currentValue)); - } - } - - handledCPCount = basicLength = output.length; - - // `handledCPCount` is the number of code points that have been handled; - // `basicLength` is the number of basic code points. - - // Finish the basic string - if it is not empty - with a delimiter - if (basicLength) { - output.push(delimiter); - } - - // Main encoding loop: - while (handledCPCount < inputLength) { - - // All non-basic code points < n have been handled already. Find the next - // larger one: - for (m = maxInt, j = 0; j < inputLength; ++j) { - currentValue = input[j]; - if (currentValue >= n && currentValue < m) { - m = currentValue; - } - } - - // Increase `delta` enough to advance the decoder's state to , - // but guard against overflow - handledCPCountPlusOne = handledCPCount + 1; - if (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) { - error('overflow'); - } - - delta += (m - n) * handledCPCountPlusOne; - n = m; - - for (j = 0; j < inputLength; ++j) { - currentValue = input[j]; - - if (currentValue < n && ++delta > maxInt) { - error('overflow'); - } - - if (currentValue == n) { - // Represent delta as a generalized variable-length integer - for (q = delta, k = base; /* no condition */; k += base) { - t = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias); - if (q < t) { - break; - } - qMinusT = q - t; - baseMinusT = base - t; - output.push( - stringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0)) - ); - q = floor(qMinusT / baseMinusT); - } - - output.push(stringFromCharCode(digitToBasic(q, 0))); - bias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength); - delta = 0; - ++handledCPCount; - } - } - - ++delta; - ++n; - - } - return output.join(''); - } - - /** - * Converts a Punycode string representing a domain name or an email address - * to Unicode. Only the Punycoded parts of the input will be converted, i.e. - * it doesn't matter if you call it on a string that has already been - * converted to Unicode. - * @memberOf punycode - * @param {String} input The Punycoded domain name or email address to - * convert to Unicode. - * @returns {String} The Unicode representation of the given Punycode - * string. - */ - function toUnicode(input) { - return mapDomain(input, function(string) { - return regexPunycode.test(string) - ? decode(string.slice(4).toLowerCase()) - : string; - }); - } - - /** - * Converts a Unicode string representing a domain name or an email address to - * Punycode. Only the non-ASCII parts of the domain name will be converted, - * i.e. it doesn't matter if you call it with a domain that's already in - * ASCII. - * @memberOf punycode - * @param {String} input The domain name or email address to convert, as a - * Unicode string. - * @returns {String} The Punycode representation of the given domain name or - * email address. - */ - function toASCII(input) { - return mapDomain(input, function(string) { - return regexNonASCII.test(string) - ? 'xn--' + encode(string) - : string; - }); - } - - /*--------------------------------------------------------------------------*/ - - /** Define the public API */ - punycode = { - /** - * A string representing the current Punycode.js version number. - * @memberOf punycode - * @type String - */ - 'version': '1.3.2', - /** - * An object of methods to convert from JavaScript's internal character - * representation (UCS-2) to Unicode code points, and back. - * @see - * @memberOf punycode - * @type Object - */ - 'ucs2': { - 'decode': ucs2decode, - 'encode': ucs2encode - }, - 'decode': decode, - 'encode': encode, - 'toASCII': toASCII, - 'toUnicode': toUnicode - }; - - /** Expose `punycode` */ - // Some AMD build optimizers, like r.js, check for specific condition patterns - // like the following: - if ( - true - ) { - !(__WEBPACK_AMD_DEFINE_RESULT__ = (function() { - return punycode; - }).call(exports, __webpack_require__, exports, module), - __WEBPACK_AMD_DEFINE_RESULT__ !== undefined && (module.exports = __WEBPACK_AMD_DEFINE_RESULT__)); - } else {} - -}(this)); - - -/***/ }), - -/***/ "./node_modules/url/url.js": -/*!*********************************!*\ - !*** ./node_modules/url/url.js ***! - \*********************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - - - -var punycode = __webpack_require__(/*! punycode */ "./node_modules/url/node_modules/punycode/punycode.js"); -var util = __webpack_require__(/*! ./util */ "./node_modules/url/util.js"); - -exports.parse = urlParse; -exports.resolve = urlResolve; -exports.resolveObject = urlResolveObject; -exports.format = urlFormat; - -exports.Url = Url; - -function Url() { - this.protocol = null; - this.slashes = null; - this.auth = null; - this.host = null; - this.port = null; - this.hostname = null; - this.hash = null; - this.search = null; - this.query = null; - this.pathname = null; - this.path = null; - this.href = null; -} - -// Reference: RFC 3986, RFC 1808, RFC 2396 - -// define these here so at least they only have to be -// compiled once on the first module load. -var protocolPattern = /^([a-z0-9.+-]+:)/i, - portPattern = /:[0-9]*$/, - - // Special case for a simple path URL - simplePathPattern = /^(\/\/?(?!\/)[^\?\s]*)(\?[^\s]*)?$/, - - // RFC 2396: characters reserved for delimiting URLs. - // We actually just auto-escape these. - delims = ['<', '>', '"', '`', ' ', '\r', '\n', '\t'], - - // RFC 2396: characters not allowed for various reasons. - unwise = ['{', '}', '|', '\\', '^', '`'].concat(delims), - - // Allowed by RFCs, but cause of XSS attacks. Always escape these. - autoEscape = ['\''].concat(unwise), - // Characters that are never ever allowed in a hostname. - // Note that any invalid chars are also handled, but these - // are the ones that are *expected* to be seen, so we fast-path - // them. - nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape), - hostEndingChars = ['/', '?', '#'], - hostnameMaxLen = 255, - hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/, - hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/, - // protocols that can allow "unsafe" and "unwise" chars. - unsafeProtocol = { - 'javascript': true, - 'javascript:': true - }, - // protocols that never have a hostname. - hostlessProtocol = { - 'javascript': true, - 'javascript:': true - }, - // protocols that always contain a // bit. - slashedProtocol = { - 'http': true, - 'https': true, - 'ftp': true, - 'gopher': true, - 'file': true, - 'http:': true, - 'https:': true, - 'ftp:': true, - 'gopher:': true, - 'file:': true - }, - querystring = __webpack_require__(/*! querystring */ "./node_modules/querystring/index.js"); - -function urlParse(url, parseQueryString, slashesDenoteHost) { - if (url && util.isObject(url) && url instanceof Url) return url; - - var u = new Url; - u.parse(url, parseQueryString, slashesDenoteHost); - return u; -} - -Url.prototype.parse = function(url, parseQueryString, slashesDenoteHost) { - if (!util.isString(url)) { - throw new TypeError("Parameter 'url' must be a string, not " + typeof url); - } - - // Copy chrome, IE, opera backslash-handling behavior. - // Back slashes before the query string get converted to forward slashes - // See: https://code.google.com/p/chromium/issues/detail?id=25916 - var queryIndex = url.indexOf('?'), - splitter = - (queryIndex !== -1 && queryIndex < url.indexOf('#')) ? '?' : '#', - uSplit = url.split(splitter), - slashRegex = /\\/g; - uSplit[0] = uSplit[0].replace(slashRegex, '/'); - url = uSplit.join(splitter); - - var rest = url; - - // trim before proceeding. - // This is to support parse stuff like " http://foo.com \n" - rest = rest.trim(); - - if (!slashesDenoteHost && url.split('#').length === 1) { - // Try fast path regexp - var simplePath = simplePathPattern.exec(rest); - if (simplePath) { - this.path = rest; - this.href = rest; - this.pathname = simplePath[1]; - if (simplePath[2]) { - this.search = simplePath[2]; - if (parseQueryString) { - this.query = querystring.parse(this.search.substr(1)); - } else { - this.query = this.search.substr(1); - } - } else if (parseQueryString) { - this.search = ''; - this.query = {}; - } - return this; - } - } - - var proto = protocolPattern.exec(rest); - if (proto) { - proto = proto[0]; - var lowerProto = proto.toLowerCase(); - this.protocol = lowerProto; - rest = rest.substr(proto.length); - } - - // figure out if it's got a host - // user@server is *always* interpreted as a hostname, and url - // resolution will treat //foo/bar as host=foo,path=bar because that's - // how the browser resolves relative URLs. - if (slashesDenoteHost || proto || rest.match(/^\/\/[^@\/]+@[^@\/]+/)) { - var slashes = rest.substr(0, 2) === '//'; - if (slashes && !(proto && hostlessProtocol[proto])) { - rest = rest.substr(2); - this.slashes = true; - } - } - - if (!hostlessProtocol[proto] && - (slashes || (proto && !slashedProtocol[proto]))) { - - // there's a hostname. - // the first instance of /, ?, ;, or # ends the host. - // - // If there is an @ in the hostname, then non-host chars *are* allowed - // to the left of the last @ sign, unless some host-ending character - // comes *before* the @-sign. - // URLs are obnoxious. - // - // ex: - // http://a@b@c/ => user:a@b host:c - // http://a@b?@c => user:a host:c path:/?@c - - // v0.12 TODO(isaacs): This is not quite how Chrome does things. - // Review our test case against browsers more comprehensively. - - // find the first instance of any hostEndingChars - var hostEnd = -1; - for (var i = 0; i < hostEndingChars.length; i++) { - var hec = rest.indexOf(hostEndingChars[i]); - if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) - hostEnd = hec; - } - - // at this point, either we have an explicit point where the - // auth portion cannot go past, or the last @ char is the decider. - var auth, atSign; - if (hostEnd === -1) { - // atSign can be anywhere. - atSign = rest.lastIndexOf('@'); - } else { - // atSign must be in auth portion. - // http://a@b/c@d => host:b auth:a path:/c@d - atSign = rest.lastIndexOf('@', hostEnd); - } - - // Now we have a portion which is definitely the auth. - // Pull that off. - if (atSign !== -1) { - auth = rest.slice(0, atSign); - rest = rest.slice(atSign + 1); - this.auth = decodeURIComponent(auth); - } - - // the host is the remaining to the left of the first non-host char - hostEnd = -1; - for (var i = 0; i < nonHostChars.length; i++) { - var hec = rest.indexOf(nonHostChars[i]); - if (hec !== -1 && (hostEnd === -1 || hec < hostEnd)) - hostEnd = hec; - } - // if we still have not hit it, then the entire thing is a host. - if (hostEnd === -1) - hostEnd = rest.length; - - this.host = rest.slice(0, hostEnd); - rest = rest.slice(hostEnd); - - // pull out port. - this.parseHost(); - - // we've indicated that there is a hostname, - // so even if it's empty, it has to be present. - this.hostname = this.hostname || ''; - - // if hostname begins with [ and ends with ] - // assume that it's an IPv6 address. - var ipv6Hostname = this.hostname[0] === '[' && - this.hostname[this.hostname.length - 1] === ']'; - - // validate a little. - if (!ipv6Hostname) { - var hostparts = this.hostname.split(/\./); - for (var i = 0, l = hostparts.length; i < l; i++) { - var part = hostparts[i]; - if (!part) continue; - if (!part.match(hostnamePartPattern)) { - var newpart = ''; - for (var j = 0, k = part.length; j < k; j++) { - if (part.charCodeAt(j) > 127) { - // we replace non-ASCII char with a temporary placeholder - // we need this to make sure size of hostname is not - // broken by replacing non-ASCII by nothing - newpart += 'x'; - } else { - newpart += part[j]; - } - } - // we test again with ASCII char only - if (!newpart.match(hostnamePartPattern)) { - var validParts = hostparts.slice(0, i); - var notHost = hostparts.slice(i + 1); - var bit = part.match(hostnamePartStart); - if (bit) { - validParts.push(bit[1]); - notHost.unshift(bit[2]); - } - if (notHost.length) { - rest = '/' + notHost.join('.') + rest; - } - this.hostname = validParts.join('.'); - break; - } - } - } - } - - if (this.hostname.length > hostnameMaxLen) { - this.hostname = ''; - } else { - // hostnames are always lower case. - this.hostname = this.hostname.toLowerCase(); - } - - if (!ipv6Hostname) { - // IDNA Support: Returns a punycoded representation of "domain". - // It only converts parts of the domain name that - // have non-ASCII characters, i.e. it doesn't matter if - // you call it with a domain that already is ASCII-only. - this.hostname = punycode.toASCII(this.hostname); - } - - var p = this.port ? ':' + this.port : ''; - var h = this.hostname || ''; - this.host = h + p; - this.href += this.host; - - // strip [ and ] from the hostname - // the host field still retains them, though - if (ipv6Hostname) { - this.hostname = this.hostname.substr(1, this.hostname.length - 2); - if (rest[0] !== '/') { - rest = '/' + rest; - } - } - } - - // now rest is set to the post-host stuff. - // chop off any delim chars. - if (!unsafeProtocol[lowerProto]) { - - // First, make 100% sure that any "autoEscape" chars get - // escaped, even if encodeURIComponent doesn't think they - // need to be. - for (var i = 0, l = autoEscape.length; i < l; i++) { - var ae = autoEscape[i]; - if (rest.indexOf(ae) === -1) - continue; - var esc = encodeURIComponent(ae); - if (esc === ae) { - esc = escape(ae); - } - rest = rest.split(ae).join(esc); - } - } - - - // chop off from the tail first. - var hash = rest.indexOf('#'); - if (hash !== -1) { - // got a fragment string. - this.hash = rest.substr(hash); - rest = rest.slice(0, hash); - } - var qm = rest.indexOf('?'); - if (qm !== -1) { - this.search = rest.substr(qm); - this.query = rest.substr(qm + 1); - if (parseQueryString) { - this.query = querystring.parse(this.query); - } - rest = rest.slice(0, qm); - } else if (parseQueryString) { - // no query string, but parseQueryString still requested - this.search = ''; - this.query = {}; - } - if (rest) this.pathname = rest; - if (slashedProtocol[lowerProto] && - this.hostname && !this.pathname) { - this.pathname = '/'; - } - - //to support http.request - if (this.pathname || this.search) { - var p = this.pathname || ''; - var s = this.search || ''; - this.path = p + s; - } - - // finally, reconstruct the href based on what has been validated. - this.href = this.format(); - return this; -}; - -// format a parsed object into a url string -function urlFormat(obj) { - // ensure it's an object, and not a string url. - // If it's an obj, this is a no-op. - // this way, you can call url_format() on strings - // to clean up potentially wonky urls. - if (util.isString(obj)) obj = urlParse(obj); - if (!(obj instanceof Url)) return Url.prototype.format.call(obj); - return obj.format(); -} - -Url.prototype.format = function() { - var auth = this.auth || ''; - if (auth) { - auth = encodeURIComponent(auth); - auth = auth.replace(/%3A/i, ':'); - auth += '@'; - } - - var protocol = this.protocol || '', - pathname = this.pathname || '', - hash = this.hash || '', - host = false, - query = ''; - - if (this.host) { - host = auth + this.host; - } else if (this.hostname) { - host = auth + (this.hostname.indexOf(':') === -1 ? - this.hostname : - '[' + this.hostname + ']'); - if (this.port) { - host += ':' + this.port; - } - } - - if (this.query && - util.isObject(this.query) && - Object.keys(this.query).length) { - query = querystring.stringify(this.query); - } - - var search = this.search || (query && ('?' + query)) || ''; - - if (protocol && protocol.substr(-1) !== ':') protocol += ':'; - - // only the slashedProtocols get the //. Not mailto:, xmpp:, etc. - // unless they had them to begin with. - if (this.slashes || - (!protocol || slashedProtocol[protocol]) && host !== false) { - host = '//' + (host || ''); - if (pathname && pathname.charAt(0) !== '/') pathname = '/' + pathname; - } else if (!host) { - host = ''; - } - - if (hash && hash.charAt(0) !== '#') hash = '#' + hash; - if (search && search.charAt(0) !== '?') search = '?' + search; - - pathname = pathname.replace(/[?#]/g, function(match) { - return encodeURIComponent(match); - }); - search = search.replace('#', '%23'); - - return protocol + host + pathname + search + hash; -}; - -function urlResolve(source, relative) { - return urlParse(source, false, true).resolve(relative); -} - -Url.prototype.resolve = function(relative) { - return this.resolveObject(urlParse(relative, false, true)).format(); -}; - -function urlResolveObject(source, relative) { - if (!source) return relative; - return urlParse(source, false, true).resolveObject(relative); -} - -Url.prototype.resolveObject = function(relative) { - if (util.isString(relative)) { - var rel = new Url(); - rel.parse(relative, false, true); - relative = rel; - } - - var result = new Url(); - var tkeys = Object.keys(this); - for (var tk = 0; tk < tkeys.length; tk++) { - var tkey = tkeys[tk]; - result[tkey] = this[tkey]; - } - - // hash is always overridden, no matter what. - // even href="" will remove it. - result.hash = relative.hash; - - // if the relative url is empty, then there's nothing left to do here. - if (relative.href === '') { - result.href = result.format(); - return result; - } - - // hrefs like //foo/bar always cut to the protocol. - if (relative.slashes && !relative.protocol) { - // take everything except the protocol from relative - var rkeys = Object.keys(relative); - for (var rk = 0; rk < rkeys.length; rk++) { - var rkey = rkeys[rk]; - if (rkey !== 'protocol') - result[rkey] = relative[rkey]; - } - - //urlParse appends trailing / to urls like http://www.example.com - if (slashedProtocol[result.protocol] && - result.hostname && !result.pathname) { - result.path = result.pathname = '/'; - } - - result.href = result.format(); - return result; - } - - if (relative.protocol && relative.protocol !== result.protocol) { - // if it's a known url protocol, then changing - // the protocol does weird things - // first, if it's not file:, then we MUST have a host, - // and if there was a path - // to begin with, then we MUST have a path. - // if it is file:, then the host is dropped, - // because that's known to be hostless. - // anything else is assumed to be absolute. - if (!slashedProtocol[relative.protocol]) { - var keys = Object.keys(relative); - for (var v = 0; v < keys.length; v++) { - var k = keys[v]; - result[k] = relative[k]; - } - result.href = result.format(); - return result; - } - - result.protocol = relative.protocol; - if (!relative.host && !hostlessProtocol[relative.protocol]) { - var relPath = (relative.pathname || '').split('/'); - while (relPath.length && !(relative.host = relPath.shift())); - if (!relative.host) relative.host = ''; - if (!relative.hostname) relative.hostname = ''; - if (relPath[0] !== '') relPath.unshift(''); - if (relPath.length < 2) relPath.unshift(''); - result.pathname = relPath.join('/'); - } else { - result.pathname = relative.pathname; - } - result.search = relative.search; - result.query = relative.query; - result.host = relative.host || ''; - result.auth = relative.auth; - result.hostname = relative.hostname || relative.host; - result.port = relative.port; - // to support http.request - if (result.pathname || result.search) { - var p = result.pathname || ''; - var s = result.search || ''; - result.path = p + s; - } - result.slashes = result.slashes || relative.slashes; - result.href = result.format(); - return result; - } - - var isSourceAbs = (result.pathname && result.pathname.charAt(0) === '/'), - isRelAbs = ( - relative.host || - relative.pathname && relative.pathname.charAt(0) === '/' - ), - mustEndAbs = (isRelAbs || isSourceAbs || - (result.host && relative.pathname)), - removeAllDots = mustEndAbs, - srcPath = result.pathname && result.pathname.split('/') || [], - relPath = relative.pathname && relative.pathname.split('/') || [], - psychotic = result.protocol && !slashedProtocol[result.protocol]; - - // if the url is a non-slashed url, then relative - // links like ../.. should be able - // to crawl up to the hostname, as well. This is strange. - // result.protocol has already been set by now. - // Later on, put the first path part into the host field. - if (psychotic) { - result.hostname = ''; - result.port = null; - if (result.host) { - if (srcPath[0] === '') srcPath[0] = result.host; - else srcPath.unshift(result.host); - } - result.host = ''; - if (relative.protocol) { - relative.hostname = null; - relative.port = null; - if (relative.host) { - if (relPath[0] === '') relPath[0] = relative.host; - else relPath.unshift(relative.host); - } - relative.host = null; - } - mustEndAbs = mustEndAbs && (relPath[0] === '' || srcPath[0] === ''); - } - - if (isRelAbs) { - // it's absolute. - result.host = (relative.host || relative.host === '') ? - relative.host : result.host; - result.hostname = (relative.hostname || relative.hostname === '') ? - relative.hostname : result.hostname; - result.search = relative.search; - result.query = relative.query; - srcPath = relPath; - // fall through to the dot-handling below. - } else if (relPath.length) { - // it's relative - // throw away the existing file, and take the new path instead. - if (!srcPath) srcPath = []; - srcPath.pop(); - srcPath = srcPath.concat(relPath); - result.search = relative.search; - result.query = relative.query; - } else if (!util.isNullOrUndefined(relative.search)) { - // just pull out the search. - // like href='?foo'. - // Put this after the other two cases because it simplifies the booleans - if (psychotic) { - result.hostname = result.host = srcPath.shift(); - //occationaly the auth can get stuck only in host - //this especially happens in cases like - //url.resolveObject('mailto:local1@domain1', 'local2@domain2') - var authInHost = result.host && result.host.indexOf('@') > 0 ? - result.host.split('@') : false; - if (authInHost) { - result.auth = authInHost.shift(); - result.host = result.hostname = authInHost.shift(); - } - } - result.search = relative.search; - result.query = relative.query; - //to support http.request - if (!util.isNull(result.pathname) || !util.isNull(result.search)) { - result.path = (result.pathname ? result.pathname : '') + - (result.search ? result.search : ''); - } - result.href = result.format(); - return result; - } - - if (!srcPath.length) { - // no path at all. easy. - // we've already handled the other stuff above. - result.pathname = null; - //to support http.request - if (result.search) { - result.path = '/' + result.search; - } else { - result.path = null; - } - result.href = result.format(); - return result; - } - - // if a url ENDs in . or .., then it must get a trailing slash. - // however, if it ends in anything else non-slashy, - // then it must NOT get a trailing slash. - var last = srcPath.slice(-1)[0]; - var hasTrailingSlash = ( - (result.host || relative.host || srcPath.length > 1) && - (last === '.' || last === '..') || last === ''); - - // strip single dots, resolve double dots to parent dir - // if the path tries to go above the root, `up` ends up > 0 - var up = 0; - for (var i = srcPath.length; i >= 0; i--) { - last = srcPath[i]; - if (last === '.') { - srcPath.splice(i, 1); - } else if (last === '..') { - srcPath.splice(i, 1); - up++; - } else if (up) { - srcPath.splice(i, 1); - up--; - } - } - - // if the path is allowed to go above the root, restore leading ..s - if (!mustEndAbs && !removeAllDots) { - for (; up--; up) { - srcPath.unshift('..'); - } - } - - if (mustEndAbs && srcPath[0] !== '' && - (!srcPath[0] || srcPath[0].charAt(0) !== '/')) { - srcPath.unshift(''); - } - - if (hasTrailingSlash && (srcPath.join('/').substr(-1) !== '/')) { - srcPath.push(''); - } - - var isAbsolute = srcPath[0] === '' || - (srcPath[0] && srcPath[0].charAt(0) === '/'); - - // put the host back - if (psychotic) { - result.hostname = result.host = isAbsolute ? '' : - srcPath.length ? srcPath.shift() : ''; - //occationaly the auth can get stuck only in host - //this especially happens in cases like - //url.resolveObject('mailto:local1@domain1', 'local2@domain2') - var authInHost = result.host && result.host.indexOf('@') > 0 ? - result.host.split('@') : false; - if (authInHost) { - result.auth = authInHost.shift(); - result.host = result.hostname = authInHost.shift(); - } - } - - mustEndAbs = mustEndAbs || (result.host && srcPath.length); - - if (mustEndAbs && !isAbsolute) { - srcPath.unshift(''); - } - - if (!srcPath.length) { - result.pathname = null; - result.path = null; - } else { - result.pathname = srcPath.join('/'); - } - - //to support request.http - if (!util.isNull(result.pathname) || !util.isNull(result.search)) { - result.path = (result.pathname ? result.pathname : '') + - (result.search ? result.search : ''); - } - result.auth = relative.auth || result.auth; - result.slashes = result.slashes || relative.slashes; - result.href = result.format(); - return result; -}; - -Url.prototype.parseHost = function() { - var host = this.host; - var port = portPattern.exec(host); - if (port) { - port = port[0]; - if (port !== ':') { - this.port = port.substr(1); - } - host = host.substr(0, host.length - port.length); - } - if (host) this.hostname = host; -}; - - -/***/ }), - -/***/ "./node_modules/url/util.js": -/*!**********************************!*\ - !*** ./node_modules/url/util.js ***! - \**********************************/ -/***/ ((module) => { - -"use strict"; - - -module.exports = { - isString: function(arg) { - return typeof(arg) === 'string'; - }, - isObject: function(arg) { - return typeof(arg) === 'object' && arg !== null; - }, - isNull: function(arg) { - return arg === null; - }, - isNullOrUndefined: function(arg) { - return arg == null; - } -}; - - -/***/ }), - -/***/ "./node_modules/ut_metadata/index.js": -/*!*******************************************!*\ - !*** ./node_modules/ut_metadata/index.js ***! - \*******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/*! ut_metadata. MIT License. WebTorrent LLC */ -const { EventEmitter } = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const bencode = __webpack_require__(/*! bencode */ "./node_modules/bencode/lib/index.js") -const BitField = __webpack_require__(/*! bitfield */ "./node_modules/bitfield/lib/index.js").default -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('ut_metadata') -const sha1 = __webpack_require__(/*! simple-sha1 */ "./node_modules/simple-sha1/browser.js") - -const MAX_METADATA_SIZE = 1E7 // 10 MB -const BITFIELD_GROW = 1E3 -const PIECE_LENGTH = 1 << 14 // 16 KiB - -module.exports = metadata => { - class utMetadata extends EventEmitter { - constructor (wire) { - super() - - this._wire = wire - - this._fetching = false - this._metadataComplete = false - this._metadataSize = null - // how many reject messages to tolerate before quitting - this._remainingRejects = null - - // The largest torrent file that I know of is ~1-2MB, which is ~100 - // pieces. Therefore, cap the bitfield to 10x that (1000 pieces) so a - // malicious peer can't make it grow to fill all memory. - this._bitfield = new BitField(0, { grow: BITFIELD_GROW }) - - if (Buffer.isBuffer(metadata)) { - this.setMetadata(metadata) - } - } - - onHandshake (infoHash, peerId, extensions) { - this._infoHash = infoHash - } - - onExtendedHandshake (handshake) { - if (!handshake.m || !handshake.m.ut_metadata) { - return this.emit('warning', new Error('Peer does not support ut_metadata')) - } - if (!handshake.metadata_size) { - return this.emit('warning', new Error('Peer does not have metadata')) - } - if (typeof handshake.metadata_size !== 'number' || - MAX_METADATA_SIZE < handshake.metadata_size || - handshake.metadata_size <= 0) { - return this.emit('warning', new Error('Peer gave invalid metadata size')) - } - - this._metadataSize = handshake.metadata_size - this._numPieces = Math.ceil(this._metadataSize / PIECE_LENGTH) - this._remainingRejects = this._numPieces * 2 - - this._requestPieces() - } - - onMessage (buf) { - let dict - let trailer - try { - const str = buf.toString() - const trailerIndex = str.indexOf('ee') + 2 - dict = bencode.decode(str.substring(0, trailerIndex)) - trailer = buf.slice(trailerIndex) - } catch (err) { - // drop invalid messages - return - } - - switch (dict.msg_type) { - case 0: - // ut_metadata request (from peer) - // example: { 'msg_type': 0, 'piece': 0 } - this._onRequest(dict.piece) - break - case 1: - // ut_metadata data (in response to our request) - // example: { 'msg_type': 1, 'piece': 0, 'total_size': 3425 } - this._onData(dict.piece, trailer, dict.total_size) - break - case 2: - // ut_metadata reject (peer doesn't have piece we requested) - // { 'msg_type': 2, 'piece': 0 } - this._onReject(dict.piece) - break - } - } - - /** - * Ask the peer to send metadata. - * @public - */ - fetch () { - if (this._metadataComplete) { - return - } - this._fetching = true - if (this._metadataSize) { - this._requestPieces() - } - } - - /** - * Stop asking the peer to send metadata. - * @public - */ - cancel () { - this._fetching = false - } - - setMetadata (metadata) { - if (this._metadataComplete) return true - debug('set metadata') - - // if full torrent dictionary was passed in, pull out just `info` key - try { - const info = bencode.decode(metadata).info - if (info) { - metadata = bencode.encode(info) - } - } catch (err) {} - - // check hash - if (this._infoHash && this._infoHash !== sha1.sync(metadata)) { - return false - } - - this.cancel() - - this.metadata = metadata - this._metadataComplete = true - this._metadataSize = this.metadata.length - this._wire.extendedHandshake.metadata_size = this._metadataSize - - this.emit('metadata', bencode.encode({ - info: bencode.decode(this.metadata) - })) - - return true - } - - _send (dict, trailer) { - let buf = bencode.encode(dict) - if (Buffer.isBuffer(trailer)) { - buf = Buffer.concat([buf, trailer]) - } - this._wire.extended('ut_metadata', buf) - } - - _request (piece) { - this._send({ msg_type: 0, piece }) - } - - _data (piece, buf, totalSize) { - const msg = { msg_type: 1, piece } - if (typeof totalSize === 'number') { - msg.total_size = totalSize - } - this._send(msg, buf) - } - - _reject (piece) { - this._send({ msg_type: 2, piece }) - } - - _onRequest (piece) { - if (!this._metadataComplete) { - this._reject(piece) - return - } - const start = piece * PIECE_LENGTH - let end = start + PIECE_LENGTH - if (end > this._metadataSize) { - end = this._metadataSize - } - const buf = this.metadata.slice(start, end) - this._data(piece, buf, this._metadataSize) - } - - _onData (piece, buf, totalSize) { - if (buf.length > PIECE_LENGTH || !this._fetching) { - return - } - buf.copy(this.metadata, piece * PIECE_LENGTH) - this._bitfield.set(piece) - this._checkDone() - } - - _onReject (piece) { - if (this._remainingRejects > 0 && this._fetching) { - // If we haven't been rejected too much, - // then try to request the piece again - this._request(piece) - this._remainingRejects -= 1 - } else { - this.emit('warning', new Error('Peer sent "reject" too much')) - } - } - - _requestPieces () { - if (!this._fetching) return - this.metadata = Buffer.alloc(this._metadataSize) - for (let piece = 0; piece < this._numPieces; piece++) { - this._request(piece) - } - } - - _checkDone () { - let done = true - for (let piece = 0; piece < this._numPieces; piece++) { - if (!this._bitfield.get(piece)) { - done = false - break - } - } - if (!done) return - - // attempt to set metadata -- may fail sha1 check - const success = this.setMetadata(this.metadata) - - if (!success) { - this._failedMetadata() - } - } - - _failedMetadata () { - // reset bitfield & try again - this._bitfield = new BitField(0, { grow: BITFIELD_GROW }) - this._remainingRejects -= this._numPieces - if (this._remainingRejects > 0) { - this._requestPieces() - } else { - this.emit('warning', new Error('Peer sent invalid metadata')) - } - } - } - - // Name of the bittorrent-protocol extension - utMetadata.prototype.name = 'ut_metadata' - - return utMetadata -} - - -/***/ }), - -/***/ "./node_modules/util-deprecate/browser.js": -/*!************************************************!*\ - !*** ./node_modules/util-deprecate/browser.js ***! - \************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); - -/** - * Module exports. - */ - -module.exports = deprecate; - -/** - * Mark that a method should not be used. - * Returns a modified function which warns once by default. - * - * If `localStorage.noDeprecation = true` is set, then it is a no-op. - * - * If `localStorage.throwDeprecation = true` is set, then deprecated functions - * will throw an Error when invoked. - * - * If `localStorage.traceDeprecation = true` is set, then deprecated functions - * will invoke `console.trace()` instead of `console.error()`. - * - * @param {Function} fn - the function to deprecate - * @param {String} msg - the string to print to the console when `fn` is invoked - * @returns {Function} a new "deprecated" version of `fn` - * @api public - */ - -function deprecate (fn, msg) { - if (config('noDeprecation')) { - return fn; - } - - var warned = false; - function deprecated() { - if (!warned) { - if (config('throwDeprecation')) { - throw new Error(msg); - } else if (config('traceDeprecation')) { - console.trace(msg); - } else { - console.warn(msg); - } - warned = true; - } - return fn.apply(this, arguments); - } - - return deprecated; -} - -/** - * Checks `localStorage` for boolean values for the given `name`. - * - * @param {String} name - * @returns {Boolean} - * @api private - */ - -function config (name) { - // accessing global.localStorage can trigger a DOMException in sandboxed iframes - try { - if (!__webpack_require__.g.localStorage) return false; - } catch (_) { - return false; - } - var val = __webpack_require__.g.localStorage[name]; - if (null == val) return false; - return String(val).toLowerCase() === 'true'; -} - - -/***/ }), - -/***/ "./node_modules/util/support/isBufferBrowser.js": -/*!******************************************************!*\ - !*** ./node_modules/util/support/isBufferBrowser.js ***! - \******************************************************/ -/***/ ((module) => { - -module.exports = function isBuffer(arg) { - return arg && typeof arg === 'object' - && typeof arg.copy === 'function' - && typeof arg.fill === 'function' - && typeof arg.readUInt8 === 'function'; -} - -/***/ }), - -/***/ "./node_modules/util/support/types.js": -/*!********************************************!*\ - !*** ./node_modules/util/support/types.js ***! - \********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -"use strict"; -// Currently in sync with Node.js lib/internal/util/types.js -// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9 - - - -var isArgumentsObject = __webpack_require__(/*! is-arguments */ "./node_modules/is-arguments/index.js"); -var isGeneratorFunction = __webpack_require__(/*! is-generator-function */ "./node_modules/is-generator-function/index.js"); -var whichTypedArray = __webpack_require__(/*! which-typed-array */ "./node_modules/which-typed-array/index.js"); -var isTypedArray = __webpack_require__(/*! is-typed-array */ "./node_modules/is-typed-array/index.js"); - -function uncurryThis(f) { - return f.call.bind(f); -} - -var BigIntSupported = typeof BigInt !== 'undefined'; -var SymbolSupported = typeof Symbol !== 'undefined'; - -var ObjectToString = uncurryThis(Object.prototype.toString); - -var numberValue = uncurryThis(Number.prototype.valueOf); -var stringValue = uncurryThis(String.prototype.valueOf); -var booleanValue = uncurryThis(Boolean.prototype.valueOf); - -if (BigIntSupported) { - var bigIntValue = uncurryThis(BigInt.prototype.valueOf); -} - -if (SymbolSupported) { - var symbolValue = uncurryThis(Symbol.prototype.valueOf); -} - -function checkBoxedPrimitive(value, prototypeValueOf) { - if (typeof value !== 'object') { - return false; - } - try { - prototypeValueOf(value); - return true; - } catch(e) { - return false; - } -} - -exports.isArgumentsObject = isArgumentsObject; -exports.isGeneratorFunction = isGeneratorFunction; -exports.isTypedArray = isTypedArray; - -// Taken from here and modified for better browser support -// https://github.com/sindresorhus/p-is-promise/blob/cda35a513bda03f977ad5cde3a079d237e82d7ef/index.js -function isPromise(input) { - return ( - ( - typeof Promise !== 'undefined' && - input instanceof Promise - ) || - ( - input !== null && - typeof input === 'object' && - typeof input.then === 'function' && - typeof input.catch === 'function' - ) - ); -} -exports.isPromise = isPromise; - -function isArrayBufferView(value) { - if (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView) { - return ArrayBuffer.isView(value); - } - - return ( - isTypedArray(value) || - isDataView(value) - ); -} -exports.isArrayBufferView = isArrayBufferView; - - -function isUint8Array(value) { - return whichTypedArray(value) === 'Uint8Array'; -} -exports.isUint8Array = isUint8Array; - -function isUint8ClampedArray(value) { - return whichTypedArray(value) === 'Uint8ClampedArray'; -} -exports.isUint8ClampedArray = isUint8ClampedArray; - -function isUint16Array(value) { - return whichTypedArray(value) === 'Uint16Array'; -} -exports.isUint16Array = isUint16Array; - -function isUint32Array(value) { - return whichTypedArray(value) === 'Uint32Array'; -} -exports.isUint32Array = isUint32Array; - -function isInt8Array(value) { - return whichTypedArray(value) === 'Int8Array'; -} -exports.isInt8Array = isInt8Array; - -function isInt16Array(value) { - return whichTypedArray(value) === 'Int16Array'; -} -exports.isInt16Array = isInt16Array; - -function isInt32Array(value) { - return whichTypedArray(value) === 'Int32Array'; -} -exports.isInt32Array = isInt32Array; - -function isFloat32Array(value) { - return whichTypedArray(value) === 'Float32Array'; -} -exports.isFloat32Array = isFloat32Array; - -function isFloat64Array(value) { - return whichTypedArray(value) === 'Float64Array'; -} -exports.isFloat64Array = isFloat64Array; - -function isBigInt64Array(value) { - return whichTypedArray(value) === 'BigInt64Array'; -} -exports.isBigInt64Array = isBigInt64Array; - -function isBigUint64Array(value) { - return whichTypedArray(value) === 'BigUint64Array'; -} -exports.isBigUint64Array = isBigUint64Array; - -function isMapToString(value) { - return ObjectToString(value) === '[object Map]'; -} -isMapToString.working = ( - typeof Map !== 'undefined' && - isMapToString(new Map()) -); - -function isMap(value) { - if (typeof Map === 'undefined') { - return false; - } - - return isMapToString.working - ? isMapToString(value) - : value instanceof Map; -} -exports.isMap = isMap; - -function isSetToString(value) { - return ObjectToString(value) === '[object Set]'; -} -isSetToString.working = ( - typeof Set !== 'undefined' && - isSetToString(new Set()) -); -function isSet(value) { - if (typeof Set === 'undefined') { - return false; - } - - return isSetToString.working - ? isSetToString(value) - : value instanceof Set; -} -exports.isSet = isSet; - -function isWeakMapToString(value) { - return ObjectToString(value) === '[object WeakMap]'; -} -isWeakMapToString.working = ( - typeof WeakMap !== 'undefined' && - isWeakMapToString(new WeakMap()) -); -function isWeakMap(value) { - if (typeof WeakMap === 'undefined') { - return false; - } - - return isWeakMapToString.working - ? isWeakMapToString(value) - : value instanceof WeakMap; -} -exports.isWeakMap = isWeakMap; - -function isWeakSetToString(value) { - return ObjectToString(value) === '[object WeakSet]'; -} -isWeakSetToString.working = ( - typeof WeakSet !== 'undefined' && - isWeakSetToString(new WeakSet()) -); -function isWeakSet(value) { - return isWeakSetToString(value); -} -exports.isWeakSet = isWeakSet; - -function isArrayBufferToString(value) { - return ObjectToString(value) === '[object ArrayBuffer]'; -} -isArrayBufferToString.working = ( - typeof ArrayBuffer !== 'undefined' && - isArrayBufferToString(new ArrayBuffer()) -); -function isArrayBuffer(value) { - if (typeof ArrayBuffer === 'undefined') { - return false; - } - - return isArrayBufferToString.working - ? isArrayBufferToString(value) - : value instanceof ArrayBuffer; -} -exports.isArrayBuffer = isArrayBuffer; - -function isDataViewToString(value) { - return ObjectToString(value) === '[object DataView]'; -} -isDataViewToString.working = ( - typeof ArrayBuffer !== 'undefined' && - typeof DataView !== 'undefined' && - isDataViewToString(new DataView(new ArrayBuffer(1), 0, 1)) -); -function isDataView(value) { - if (typeof DataView === 'undefined') { - return false; - } - - return isDataViewToString.working - ? isDataViewToString(value) - : value instanceof DataView; -} -exports.isDataView = isDataView; - -// Store a copy of SharedArrayBuffer in case it's deleted elsewhere -var SharedArrayBufferCopy = typeof SharedArrayBuffer !== 'undefined' ? SharedArrayBuffer : undefined; -function isSharedArrayBufferToString(value) { - return ObjectToString(value) === '[object SharedArrayBuffer]'; -} -function isSharedArrayBuffer(value) { - if (typeof SharedArrayBufferCopy === 'undefined') { - return false; - } - - if (typeof isSharedArrayBufferToString.working === 'undefined') { - isSharedArrayBufferToString.working = isSharedArrayBufferToString(new SharedArrayBufferCopy()); - } - - return isSharedArrayBufferToString.working - ? isSharedArrayBufferToString(value) - : value instanceof SharedArrayBufferCopy; -} -exports.isSharedArrayBuffer = isSharedArrayBuffer; - -function isAsyncFunction(value) { - return ObjectToString(value) === '[object AsyncFunction]'; -} -exports.isAsyncFunction = isAsyncFunction; - -function isMapIterator(value) { - return ObjectToString(value) === '[object Map Iterator]'; -} -exports.isMapIterator = isMapIterator; - -function isSetIterator(value) { - return ObjectToString(value) === '[object Set Iterator]'; -} -exports.isSetIterator = isSetIterator; - -function isGeneratorObject(value) { - return ObjectToString(value) === '[object Generator]'; -} -exports.isGeneratorObject = isGeneratorObject; - -function isWebAssemblyCompiledModule(value) { - return ObjectToString(value) === '[object WebAssembly.Module]'; -} -exports.isWebAssemblyCompiledModule = isWebAssemblyCompiledModule; - -function isNumberObject(value) { - return checkBoxedPrimitive(value, numberValue); -} -exports.isNumberObject = isNumberObject; - -function isStringObject(value) { - return checkBoxedPrimitive(value, stringValue); -} -exports.isStringObject = isStringObject; - -function isBooleanObject(value) { - return checkBoxedPrimitive(value, booleanValue); -} -exports.isBooleanObject = isBooleanObject; - -function isBigIntObject(value) { - return BigIntSupported && checkBoxedPrimitive(value, bigIntValue); -} -exports.isBigIntObject = isBigIntObject; - -function isSymbolObject(value) { - return SymbolSupported && checkBoxedPrimitive(value, symbolValue); -} -exports.isSymbolObject = isSymbolObject; - -function isBoxedPrimitive(value) { - return ( - isNumberObject(value) || - isStringObject(value) || - isBooleanObject(value) || - isBigIntObject(value) || - isSymbolObject(value) - ); -} -exports.isBoxedPrimitive = isBoxedPrimitive; - -function isAnyArrayBuffer(value) { - return typeof Uint8Array !== 'undefined' && ( - isArrayBuffer(value) || - isSharedArrayBuffer(value) - ); -} -exports.isAnyArrayBuffer = isAnyArrayBuffer; - -['isProxy', 'isExternal', 'isModuleNamespaceObject'].forEach(function(method) { - Object.defineProperty(exports, method, { - enumerable: false, - value: function() { - throw new Error(method + ' is not supported in userland'); - } - }); -}); - - -/***/ }), - -/***/ "./node_modules/util/util.js": -/*!***********************************!*\ - !*** ./node_modules/util/util.js ***! - \***********************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -// Copyright Joyent, Inc. and other Node contributors. -// -// Permission is hereby granted, free of charge, to any person obtaining a -// copy of this software and associated documentation files (the -// "Software"), to deal in the Software without restriction, including -// without limitation the rights to use, copy, modify, merge, publish, -// distribute, sublicense, and/or sell copies of the Software, and to permit -// persons to whom the Software is furnished to do so, subject to the -// following conditions: -// -// The above copyright notice and this permission notice shall be included -// in all copies or substantial portions of the Software. -// -// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN -// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -// DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -// OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE -// USE OR OTHER DEALINGS IN THE SOFTWARE. - -var getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors || - function getOwnPropertyDescriptors(obj) { - var keys = Object.keys(obj); - var descriptors = {}; - for (var i = 0; i < keys.length; i++) { - descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]); - } - return descriptors; - }; - -var formatRegExp = /%[sdj%]/g; -exports.format = function(f) { - if (!isString(f)) { - var objects = []; - for (var i = 0; i < arguments.length; i++) { - objects.push(inspect(arguments[i])); - } - return objects.join(' '); - } - - var i = 1; - var args = arguments; - var len = args.length; - var str = String(f).replace(formatRegExp, function(x) { - if (x === '%%') return '%'; - if (i >= len) return x; - switch (x) { - case '%s': return String(args[i++]); - case '%d': return Number(args[i++]); - case '%j': - try { - return JSON.stringify(args[i++]); - } catch (_) { - return '[Circular]'; - } - default: - return x; - } - }); - for (var x = args[i]; i < len; x = args[++i]) { - if (isNull(x) || !isObject(x)) { - str += ' ' + x; - } else { - str += ' ' + inspect(x); - } - } - return str; -}; - - -// Mark that a method should not be used. -// Returns a modified function which warns once by default. -// If --no-deprecation is set, then it is a no-op. -exports.deprecate = function(fn, msg) { - if (typeof process !== 'undefined' && process.noDeprecation === true) { - return fn; - } - - // Allow for deprecating things in the process of starting up. - if (typeof process === 'undefined') { - return function() { - return exports.deprecate(fn, msg).apply(this, arguments); - }; - } - - var warned = false; - function deprecated() { - if (!warned) { - if (process.throwDeprecation) { - throw new Error(msg); - } else if (process.traceDeprecation) { - console.trace(msg); - } else { - console.error(msg); - } - warned = true; - } - return fn.apply(this, arguments); - } - - return deprecated; -}; - - -var debugs = {}; -var debugEnvRegex = /^$/; - -if (process.env.NODE_DEBUG) { - var debugEnv = process.env.NODE_DEBUG; - debugEnv = debugEnv.replace(/[|\\{}()[\]^$+?.]/g, '\\$&') - .replace(/\*/g, '.*') - .replace(/,/g, '$|^') - .toUpperCase(); - debugEnvRegex = new RegExp('^' + debugEnv + '$', 'i'); -} -exports.debuglog = function(set) { - set = set.toUpperCase(); - if (!debugs[set]) { - if (debugEnvRegex.test(set)) { - var pid = process.pid; - debugs[set] = function() { - var msg = exports.format.apply(exports, arguments); - console.error('%s %d: %s', set, pid, msg); - }; - } else { - debugs[set] = function() {}; - } - } - return debugs[set]; -}; - - -/** - * Echos the value of a value. Trys to print the value out - * in the best way possible given the different types. - * - * @param {Object} obj The object to print out. - * @param {Object} opts Optional options object that alters the output. - */ -/* legacy: obj, showHidden, depth, colors*/ -function inspect(obj, opts) { - // default options - var ctx = { - seen: [], - stylize: stylizeNoColor - }; - // legacy... - if (arguments.length >= 3) ctx.depth = arguments[2]; - if (arguments.length >= 4) ctx.colors = arguments[3]; - if (isBoolean(opts)) { - // legacy... - ctx.showHidden = opts; - } else if (opts) { - // got an "options" object - exports._extend(ctx, opts); - } - // set default options - if (isUndefined(ctx.showHidden)) ctx.showHidden = false; - if (isUndefined(ctx.depth)) ctx.depth = 2; - if (isUndefined(ctx.colors)) ctx.colors = false; - if (isUndefined(ctx.customInspect)) ctx.customInspect = true; - if (ctx.colors) ctx.stylize = stylizeWithColor; - return formatValue(ctx, obj, ctx.depth); -} -exports.inspect = inspect; - - -// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics -inspect.colors = { - 'bold' : [1, 22], - 'italic' : [3, 23], - 'underline' : [4, 24], - 'inverse' : [7, 27], - 'white' : [37, 39], - 'grey' : [90, 39], - 'black' : [30, 39], - 'blue' : [34, 39], - 'cyan' : [36, 39], - 'green' : [32, 39], - 'magenta' : [35, 39], - 'red' : [31, 39], - 'yellow' : [33, 39] -}; - -// Don't use 'blue' not visible on cmd.exe -inspect.styles = { - 'special': 'cyan', - 'number': 'yellow', - 'boolean': 'yellow', - 'undefined': 'grey', - 'null': 'bold', - 'string': 'green', - 'date': 'magenta', - // "name": intentionally not styling - 'regexp': 'red' -}; - - -function stylizeWithColor(str, styleType) { - var style = inspect.styles[styleType]; - - if (style) { - return '\u001b[' + inspect.colors[style][0] + 'm' + str + - '\u001b[' + inspect.colors[style][1] + 'm'; - } else { - return str; - } -} - - -function stylizeNoColor(str, styleType) { - return str; -} - - -function arrayToHash(array) { - var hash = {}; - - array.forEach(function(val, idx) { - hash[val] = true; - }); - - return hash; -} - - -function formatValue(ctx, value, recurseTimes) { - // Provide a hook for user-specified inspect functions. - // Check that value is an object with an inspect function on it - if (ctx.customInspect && - value && - isFunction(value.inspect) && - // Filter out the util module, it's inspect function is special - value.inspect !== exports.inspect && - // Also filter out any prototype objects using the circular check. - !(value.constructor && value.constructor.prototype === value)) { - var ret = value.inspect(recurseTimes, ctx); - if (!isString(ret)) { - ret = formatValue(ctx, ret, recurseTimes); - } - return ret; - } - - // Primitive types cannot have properties - var primitive = formatPrimitive(ctx, value); - if (primitive) { - return primitive; - } - - // Look up the keys of the object. - var keys = Object.keys(value); - var visibleKeys = arrayToHash(keys); - - if (ctx.showHidden) { - keys = Object.getOwnPropertyNames(value); - } - - // IE doesn't make error fields non-enumerable - // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx - if (isError(value) - && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) { - return formatError(value); - } - - // Some type of object without properties can be shortcutted. - if (keys.length === 0) { - if (isFunction(value)) { - var name = value.name ? ': ' + value.name : ''; - return ctx.stylize('[Function' + name + ']', 'special'); - } - if (isRegExp(value)) { - return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); - } - if (isDate(value)) { - return ctx.stylize(Date.prototype.toString.call(value), 'date'); - } - if (isError(value)) { - return formatError(value); - } - } - - var base = '', array = false, braces = ['{', '}']; - - // Make Array say that they are Array - if (isArray(value)) { - array = true; - braces = ['[', ']']; - } - - // Make functions say that they are functions - if (isFunction(value)) { - var n = value.name ? ': ' + value.name : ''; - base = ' [Function' + n + ']'; - } - - // Make RegExps say that they are RegExps - if (isRegExp(value)) { - base = ' ' + RegExp.prototype.toString.call(value); - } - - // Make dates with properties first say the date - if (isDate(value)) { - base = ' ' + Date.prototype.toUTCString.call(value); - } - - // Make error with message first say the error - if (isError(value)) { - base = ' ' + formatError(value); - } - - if (keys.length === 0 && (!array || value.length == 0)) { - return braces[0] + base + braces[1]; - } - - if (recurseTimes < 0) { - if (isRegExp(value)) { - return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp'); - } else { - return ctx.stylize('[Object]', 'special'); - } - } - - ctx.seen.push(value); - - var output; - if (array) { - output = formatArray(ctx, value, recurseTimes, visibleKeys, keys); - } else { - output = keys.map(function(key) { - return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array); - }); - } - - ctx.seen.pop(); - - return reduceToSingleString(output, base, braces); -} - - -function formatPrimitive(ctx, value) { - if (isUndefined(value)) - return ctx.stylize('undefined', 'undefined'); - if (isString(value)) { - var simple = '\'' + JSON.stringify(value).replace(/^"|"$/g, '') - .replace(/'/g, "\\'") - .replace(/\\"/g, '"') + '\''; - return ctx.stylize(simple, 'string'); - } - if (isNumber(value)) - return ctx.stylize('' + value, 'number'); - if (isBoolean(value)) - return ctx.stylize('' + value, 'boolean'); - // For some reason typeof null is "object", so special case here. - if (isNull(value)) - return ctx.stylize('null', 'null'); -} - - -function formatError(value) { - return '[' + Error.prototype.toString.call(value) + ']'; -} - - -function formatArray(ctx, value, recurseTimes, visibleKeys, keys) { - var output = []; - for (var i = 0, l = value.length; i < l; ++i) { - if (hasOwnProperty(value, String(i))) { - output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, - String(i), true)); - } else { - output.push(''); - } - } - keys.forEach(function(key) { - if (!key.match(/^\d+$/)) { - output.push(formatProperty(ctx, value, recurseTimes, visibleKeys, - key, true)); - } - }); - return output; -} - - -function formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) { - var name, str, desc; - desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] }; - if (desc.get) { - if (desc.set) { - str = ctx.stylize('[Getter/Setter]', 'special'); - } else { - str = ctx.stylize('[Getter]', 'special'); - } - } else { - if (desc.set) { - str = ctx.stylize('[Setter]', 'special'); - } - } - if (!hasOwnProperty(visibleKeys, key)) { - name = '[' + key + ']'; - } - if (!str) { - if (ctx.seen.indexOf(desc.value) < 0) { - if (isNull(recurseTimes)) { - str = formatValue(ctx, desc.value, null); - } else { - str = formatValue(ctx, desc.value, recurseTimes - 1); - } - if (str.indexOf('\n') > -1) { - if (array) { - str = str.split('\n').map(function(line) { - return ' ' + line; - }).join('\n').substr(2); - } else { - str = '\n' + str.split('\n').map(function(line) { - return ' ' + line; - }).join('\n'); - } - } - } else { - str = ctx.stylize('[Circular]', 'special'); - } - } - if (isUndefined(name)) { - if (array && key.match(/^\d+$/)) { - return str; - } - name = JSON.stringify('' + key); - if (name.match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)) { - name = name.substr(1, name.length - 2); - name = ctx.stylize(name, 'name'); - } else { - name = name.replace(/'/g, "\\'") - .replace(/\\"/g, '"') - .replace(/(^"|"$)/g, "'"); - name = ctx.stylize(name, 'string'); - } - } - - return name + ': ' + str; -} - - -function reduceToSingleString(output, base, braces) { - var numLinesEst = 0; - var length = output.reduce(function(prev, cur) { - numLinesEst++; - if (cur.indexOf('\n') >= 0) numLinesEst++; - return prev + cur.replace(/\u001b\[\d\d?m/g, '').length + 1; - }, 0); - - if (length > 60) { - return braces[0] + - (base === '' ? '' : base + '\n ') + - ' ' + - output.join(',\n ') + - ' ' + - braces[1]; - } - - return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1]; -} - - -// NOTE: These type checking functions intentionally don't use `instanceof` -// because it is fragile and can be easily faked with `Object.create()`. -exports.types = __webpack_require__(/*! ./support/types */ "./node_modules/util/support/types.js"); - -function isArray(ar) { - return Array.isArray(ar); -} -exports.isArray = isArray; - -function isBoolean(arg) { - return typeof arg === 'boolean'; -} -exports.isBoolean = isBoolean; - -function isNull(arg) { - return arg === null; -} -exports.isNull = isNull; - -function isNullOrUndefined(arg) { - return arg == null; -} -exports.isNullOrUndefined = isNullOrUndefined; - -function isNumber(arg) { - return typeof arg === 'number'; -} -exports.isNumber = isNumber; - -function isString(arg) { - return typeof arg === 'string'; -} -exports.isString = isString; - -function isSymbol(arg) { - return typeof arg === 'symbol'; -} -exports.isSymbol = isSymbol; - -function isUndefined(arg) { - return arg === void 0; -} -exports.isUndefined = isUndefined; - -function isRegExp(re) { - return isObject(re) && objectToString(re) === '[object RegExp]'; -} -exports.isRegExp = isRegExp; -exports.types.isRegExp = isRegExp; - -function isObject(arg) { - return typeof arg === 'object' && arg !== null; -} -exports.isObject = isObject; - -function isDate(d) { - return isObject(d) && objectToString(d) === '[object Date]'; -} -exports.isDate = isDate; -exports.types.isDate = isDate; - -function isError(e) { - return isObject(e) && - (objectToString(e) === '[object Error]' || e instanceof Error); -} -exports.isError = isError; -exports.types.isNativeError = isError; - -function isFunction(arg) { - return typeof arg === 'function'; -} -exports.isFunction = isFunction; - -function isPrimitive(arg) { - return arg === null || - typeof arg === 'boolean' || - typeof arg === 'number' || - typeof arg === 'string' || - typeof arg === 'symbol' || // ES6 symbol - typeof arg === 'undefined'; -} -exports.isPrimitive = isPrimitive; - -exports.isBuffer = __webpack_require__(/*! ./support/isBuffer */ "./node_modules/util/support/isBufferBrowser.js"); - -function objectToString(o) { - return Object.prototype.toString.call(o); -} - - -function pad(n) { - return n < 10 ? '0' + n.toString(10) : n.toString(10); -} - - -var months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep', - 'Oct', 'Nov', 'Dec']; - -// 26 Feb 16:19:34 -function timestamp() { - var d = new Date(); - var time = [pad(d.getHours()), - pad(d.getMinutes()), - pad(d.getSeconds())].join(':'); - return [d.getDate(), months[d.getMonth()], time].join(' '); -} - - -// log is just a thin wrapper to console.log that prepends a timestamp -exports.log = function() { - console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments)); -}; - - -/** - * Inherit the prototype methods from one constructor into another. - * - * The Function.prototype.inherits from lang.js rewritten as a standalone - * function (not on Function.prototype). NOTE: If this file is to be loaded - * during bootstrapping this function needs to be rewritten using some native - * functions as prototype setup using normal JavaScript does not work as - * expected during bootstrapping (see mirror.js in r114903). - * - * @param {function} ctor Constructor function which needs to inherit the - * prototype. - * @param {function} superCtor Constructor function to inherit prototype from. - */ -exports.inherits = __webpack_require__(/*! inherits */ "./node_modules/inherits/inherits_browser.js"); - -exports._extend = function(origin, add) { - // Don't do anything if add isn't an object - if (!add || !isObject(add)) return origin; - - var keys = Object.keys(add); - var i = keys.length; - while (i--) { - origin[keys[i]] = add[keys[i]]; - } - return origin; -}; - -function hasOwnProperty(obj, prop) { - return Object.prototype.hasOwnProperty.call(obj, prop); -} - -var kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined; - -exports.promisify = function promisify(original) { - if (typeof original !== 'function') - throw new TypeError('The "original" argument must be of type Function'); - - if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) { - var fn = original[kCustomPromisifiedSymbol]; - if (typeof fn !== 'function') { - throw new TypeError('The "util.promisify.custom" argument must be of type Function'); - } - Object.defineProperty(fn, kCustomPromisifiedSymbol, { - value: fn, enumerable: false, writable: false, configurable: true - }); - return fn; - } - - function fn() { - var promiseResolve, promiseReject; - var promise = new Promise(function (resolve, reject) { - promiseResolve = resolve; - promiseReject = reject; - }); - - var args = []; - for (var i = 0; i < arguments.length; i++) { - args.push(arguments[i]); - } - args.push(function (err, value) { - if (err) { - promiseReject(err); - } else { - promiseResolve(value); - } - }); - - try { - original.apply(this, args); - } catch (err) { - promiseReject(err); - } - - return promise; - } - - Object.setPrototypeOf(fn, Object.getPrototypeOf(original)); - - if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, { - value: fn, enumerable: false, writable: false, configurable: true - }); - return Object.defineProperties( - fn, - getOwnPropertyDescriptors(original) - ); -} - -exports.promisify.custom = kCustomPromisifiedSymbol - -function callbackifyOnRejected(reason, cb) { - // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M). - // Because `null` is a special error value in callbacks which means "no error - // occurred", we error-wrap so the callback consumer can distinguish between - // "the promise rejected with null" or "the promise fulfilled with undefined". - if (!reason) { - var newReason = new Error('Promise was rejected with a falsy value'); - newReason.reason = reason; - reason = newReason; - } - return cb(reason); -} - -function callbackify(original) { - if (typeof original !== 'function') { - throw new TypeError('The "original" argument must be of type Function'); - } - - // We DO NOT return the promise as it gives the user a false sense that - // the promise is actually somehow related to the callback's execution - // and that the callback throwing will reject the promise. - function callbackified() { - var args = []; - for (var i = 0; i < arguments.length; i++) { - args.push(arguments[i]); - } - - var maybeCb = args.pop(); - if (typeof maybeCb !== 'function') { - throw new TypeError('The last argument must be of type Function'); - } - var self = this; - var cb = function() { - return maybeCb.apply(self, arguments); - }; - // In true node style we process the callback on `nextTick` with all the - // implications (stack, `uncaughtException`, `async_hooks`) - original.apply(this, args) - .then(function(ret) { process.nextTick(cb.bind(null, null, ret)) }, - function(rej) { process.nextTick(callbackifyOnRejected.bind(null, rej, cb)) }); - } - - Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original)); - Object.defineProperties(callbackified, - getOwnPropertyDescriptors(original)); - return callbackified; -} -exports.callbackify = callbackify; - - -/***/ }), - -/***/ "./node_modules/videostream/mp4-remuxer.js": -/*!*************************************************!*\ - !*** ./node_modules/videostream/mp4-remuxer.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -const bs = __webpack_require__(/*! binary-search */ "./node_modules/binary-search/index.js") -const EventEmitter = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const mp4 = __webpack_require__(/*! mp4-stream */ "./node_modules/mp4-stream/index.js") -const Box = __webpack_require__(/*! mp4-box-encoding */ "./node_modules/mp4-box-encoding/index.js") -const RangeSliceStream = __webpack_require__(/*! range-slice-stream */ "./node_modules/range-slice-stream/index.js") - -// if we want to ignore more than this many bytes, request a new stream. -// if we want to ignore fewer, just skip them. -const FIND_MOOV_SEEK_SIZE = 4096 - -class MP4Remuxer extends EventEmitter { - constructor (file) { - super() - - this._tracks = [] - this._file = file - this._decoder = null - this._findMoov(0) - } - - _findMoov (offset) { - if (this._decoder) { - this._decoder.destroy() - } - - let toSkip = 0 - this._decoder = mp4.decode() - const fileStream = this._file.createReadStream({ - start: offset - }) - fileStream.pipe(this._decoder) - - const boxHandler = headers => { - if (headers.type === 'moov') { - this._decoder.removeListener('box', boxHandler) - this._decoder.decode(moov => { - fileStream.destroy() - try { - this._processMoov(moov) - } catch (err) { - err.message = `Cannot parse mp4 file: ${err.message}` - this.emit('error', err) - } - }) - } else if (headers.length < FIND_MOOV_SEEK_SIZE) { - toSkip += headers.length - this._decoder.ignore() - } else { - this._decoder.removeListener('box', boxHandler) - toSkip += headers.length - fileStream.destroy() - this._decoder.destroy() - this._findMoov(offset + toSkip) - } - } - this._decoder.on('box', boxHandler) - - } - - _processMoov (moov) { - const traks = moov.traks - this._tracks = [] - this._hasVideo = false - this._hasAudio = false - for (let i = 0; i < traks.length; i++) { - const trak = traks[i] - const stbl = trak.mdia.minf.stbl - const stsdEntry = stbl.stsd.entries[0] - const handlerType = trak.mdia.hdlr.handlerType - let codec - let mime - if (handlerType === 'vide' && stsdEntry.type === 'avc1') { - if (this._hasVideo) { - continue - } - this._hasVideo = true - codec = 'avc1' - if (stsdEntry.avcC) { - codec += `.${stsdEntry.avcC.mimeCodec}` - } - mime = `video/mp4; codecs="${codec}"` - } else if (handlerType === 'soun' && stsdEntry.type === 'mp4a') { - if (this._hasAudio) { - continue - } - this._hasAudio = true - codec = 'mp4a' - if (stsdEntry.esds && stsdEntry.esds.mimeCodec) { - codec += `.${stsdEntry.esds.mimeCodec}` - } - mime = `audio/mp4; codecs="${codec}"` - } else { - continue - } - - const samples = [] - let sample = 0 - - // Chunk/position data - let sampleInChunk = 0 - let chunk = 0 - let offsetInChunk = 0 - let sampleToChunkIndex = 0 - - // Time data - let dts = 0 - const decodingTimeEntry = new RunLengthIndex(stbl.stts.entries) - let presentationOffsetEntry = null - if (stbl.ctts) { - presentationOffsetEntry = new RunLengthIndex(stbl.ctts.entries) - } - - // Sync table index - let syncSampleIndex = 0 - - while (true) { - var currChunkEntry = stbl.stsc.entries[sampleToChunkIndex] - - // Compute size - const size = stbl.stsz.entries[sample] - - // Compute time data - const duration = decodingTimeEntry.value.duration - const presentationOffset = presentationOffsetEntry ? presentationOffsetEntry.value.compositionOffset : 0 - - // Compute sync - let sync = true - if (stbl.stss) { - sync = stbl.stss.entries[syncSampleIndex] === sample + 1 - } - - // Create new sample entry - const chunkOffsetTable = stbl.stco || stbl.co64 - samples.push({ - size, - duration, - dts, - presentationOffset, - sync, - offset: offsetInChunk + chunkOffsetTable.entries[chunk] - }) - - // Go to next sample - sample++ - if (sample >= stbl.stsz.entries.length) { - break - } - - // Move position/chunk - sampleInChunk++ - offsetInChunk += size - if (sampleInChunk >= currChunkEntry.samplesPerChunk) { - // Move to new chunk - sampleInChunk = 0 - offsetInChunk = 0 - chunk++ - // Move sample to chunk box index - const nextChunkEntry = stbl.stsc.entries[sampleToChunkIndex + 1] - if (nextChunkEntry && chunk + 1 >= nextChunkEntry.firstChunk) { - sampleToChunkIndex++ - } - } - - // Move time forward - dts += duration - decodingTimeEntry.inc() - presentationOffsetEntry && presentationOffsetEntry.inc() - - // Move sync table index - if (sync) { - syncSampleIndex++ - } - } - - trak.mdia.mdhd.duration = 0 - trak.tkhd.duration = 0 - - const defaultSampleDescriptionIndex = currChunkEntry.sampleDescriptionId - - const trackMoov = { - type: 'moov', - mvhd: moov.mvhd, - traks: [{ - tkhd: trak.tkhd, - mdia: { - mdhd: trak.mdia.mdhd, - hdlr: trak.mdia.hdlr, - elng: trak.mdia.elng, - minf: { - vmhd: trak.mdia.minf.vmhd, - smhd: trak.mdia.minf.smhd, - dinf: trak.mdia.minf.dinf, - stbl: { - stsd: stbl.stsd, - stts: empty(), - ctts: empty(), - stsc: empty(), - stsz: empty(), - stco: empty(), - stss: empty() - } - } - } - }], - mvex: { - mehd: { - fragmentDuration: moov.mvhd.duration - }, - trexs: [{ - trackId: trak.tkhd.trackId, - defaultSampleDescriptionIndex, - defaultSampleDuration: 0, - defaultSampleSize: 0, - defaultSampleFlags: 0 - }] - } - } - - this._tracks.push({ - fragmentSequence: 1, - trackId: trak.tkhd.trackId, - timeScale: trak.mdia.mdhd.timeScale, - samples, - currSample: null, - currTime: null, - moov: trackMoov, - mime - }) - } - - if (this._tracks.length === 0) { - this.emit('error', new Error('no playable tracks')) - return - } - - // Must be set last since this is used above - moov.mvhd.duration = 0 - - this._ftyp = { - type: 'ftyp', - brand: 'iso5', - brandVersion: 0, - compatibleBrands: [ - 'iso5' - ] - } - - const ftypBuf = Box.encode(this._ftyp) - const data = this._tracks.map(track => { - const moovBuf = Box.encode(track.moov) - return { - mime: track.mime, - init: Buffer.concat([ftypBuf, moovBuf]) - } - }) - - this.emit('ready', data) - } - - seek (time) { - if (!this._tracks) { - throw new Error('Not ready yet; wait for \'ready\' event') - } - - if (this._fileStream) { - this._fileStream.destroy() - this._fileStream = null - } - - let startOffset = -1 - this._tracks.map((track, i) => { - // find the keyframe before the time - // stream from there - if (track.outStream) { - track.outStream.destroy() - } - if (track.inStream) { - track.inStream.destroy() - track.inStream = null - } - const outStream = track.outStream = mp4.encode() - const fragment = this._generateFragment(i, time) - if (!fragment) { - return outStream.finalize() - } - - if (startOffset === -1 || fragment.ranges[0].start < startOffset) { - startOffset = fragment.ranges[0].start - } - - const writeFragment = (frag) => { - if (outStream.destroyed) return - outStream.box(frag.moof, err => { - if (err) return this.emit('error', err) - if (outStream.destroyed) return - const slicedStream = track.inStream.slice(frag.ranges) - slicedStream.pipe(outStream.mediaData(frag.length, err => { - if (err) return this.emit('error', err) - if (outStream.destroyed) return - const nextFrag = this._generateFragment(i) - if (!nextFrag) { - return outStream.finalize() - } - writeFragment(nextFrag) - })) - }) - } - writeFragment(fragment) - }) - - if (startOffset >= 0) { - const fileStream = this._fileStream = this._file.createReadStream({ - start: startOffset - }) - - this._tracks.forEach(track => { - track.inStream = new RangeSliceStream(startOffset, { - // Allow up to a 10MB offset between audio and video, - // which should be fine for any reasonable interleaving - // interval and bitrate - highWaterMark: 10000000 - }) - fileStream.pipe(track.inStream) - }) - } - - return this._tracks.map(track => { - return track.outStream - }) - } - - _findSampleBefore (trackInd, time) { - const track = this._tracks[trackInd] - const scaledTime = Math.floor(track.timeScale * time) - let sample = bs(track.samples, scaledTime, (sample, t) => { - const pts = sample.dts + sample.presentationOffset// - track.editShift - return pts - t - }) - if (sample === -1) { - sample = 0 - } else if (sample < 0) { - sample = -sample - 2 - } - // sample is now the last sample with dts <= time - // Find the preceeding sync sample - while (!track.samples[sample].sync) { - sample-- - } - return sample - } - - _generateFragment (track, time) { - /* - 1. Find correct sample - 2. Process backward until sync sample found - 3. Process forward until next sync sample after MIN_FRAGMENT_DURATION found - */ - const currTrack = this._tracks[track] - let firstSample - if (time !== undefined) { - firstSample = this._findSampleBefore(track, time) - } else { - firstSample = currTrack.currSample - } - - if (firstSample >= currTrack.samples.length) { return null } - - const startDts = currTrack.samples[firstSample].dts - - let totalLen = 0 - const ranges = [] - for (var currSample = firstSample; currSample < currTrack.samples.length; currSample++) { - const sample = currTrack.samples[currSample] - if (sample.sync && sample.dts - startDts >= currTrack.timeScale * MIN_FRAGMENT_DURATION) { - break // This is a reasonable place to end the fragment - } - - totalLen += sample.size - const currRange = ranges.length - 1 - if (currRange < 0 || ranges[currRange].end !== sample.offset) { - // Push a new range - ranges.push({ - start: sample.offset, - end: sample.offset + sample.size - }) - } else { - ranges[currRange].end += sample.size - } - } - - currTrack.currSample = currSample - - return { - moof: this._generateMoof(track, firstSample, currSample), - ranges, - length: totalLen - } - } - - _generateMoof (track, firstSample, lastSample) { - const currTrack = this._tracks[track] - - const entries = [] - let trunVersion = 0 - for (let j = firstSample; j < lastSample; j++) { - const currSample = currTrack.samples[j] - if (currSample.presentationOffset < 0) { trunVersion = 1 } - entries.push({ - sampleDuration: currSample.duration, - sampleSize: currSample.size, - sampleFlags: currSample.sync ? 0x2000000 : 0x1010000, - sampleCompositionTimeOffset: currSample.presentationOffset - }) - } - - const moof = { - type: 'moof', - mfhd: { - sequenceNumber: currTrack.fragmentSequence++ - }, - trafs: [{ - tfhd: { - flags: 0x20000, // default-base-is-moof - trackId: currTrack.trackId - }, - tfdt: { - baseMediaDecodeTime: currTrack.samples[firstSample].dts - }, - trun: { - flags: 0xf01, - dataOffset: 8, // The moof size has to be added to this later as well - entries, - version: trunVersion - } - }] - } - - // Update the offset - moof.trafs[0].trun.dataOffset += Box.encodingLength(moof) - - return moof - } -} - -class RunLengthIndex { - constructor (entries, countName) { - this._entries = entries - this._countName = countName || 'count' - this._index = 0 - this._offset = 0 - - this.value = this._entries[0] - } - - inc () { - this._offset++ - if (this._offset >= this._entries[this._index][this._countName]) { - this._index++ - this._offset = 0 - } - - this.value = this._entries[this._index] - } -} - -function empty () { - return { - version: 0, - flags: 0, - entries: [] - } -} - -const MIN_FRAGMENT_DURATION = 1 // second - -module.exports = MP4Remuxer - - -/***/ }), - -/***/ "./node_modules/videostream/videostream.js": -/*!*************************************************!*\ - !*** ./node_modules/videostream/videostream.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -const MediaElementWrapper = __webpack_require__(/*! mediasource */ "./node_modules/mediasource/index.js") -const pump = __webpack_require__(/*! pump */ "./node_modules/pump/index.js") - -const MP4Remuxer = __webpack_require__(/*! ./mp4-remuxer */ "./node_modules/videostream/mp4-remuxer.js") - -function VideoStream (file, mediaElem, opts = {}) { - if (!(this instanceof VideoStream)) { - console.warn("Don't invoke VideoStream without the 'new' keyword.") - return new VideoStream(file, mediaElem, opts) - } - - this.detailedError = null - - this._elem = mediaElem - this._elemWrapper = new MediaElementWrapper(mediaElem) - this._waitingFired = false - this._trackMeta = null - this._file = file - this._tracks = null - - if (this._elem.preload !== 'none') { - this._createMuxer() - } - - this._onError = () => { - this.detailedError = this._elemWrapper.detailedError - this.destroy() // don't pass err though so the user doesn't need to listen for errors - } - - this._onWaiting = () => { - this._waitingFired = true - if (!this._muxer) { - this._createMuxer() - } else if (this._tracks) { - this._pump() - } - } - - if (mediaElem.autoplay) { mediaElem.preload = 'auto' } - mediaElem.addEventListener('waiting', this._onWaiting) - mediaElem.addEventListener('error', this._onError) -} - -VideoStream.prototype = { - _createMuxer () { - this._muxer = new MP4Remuxer(this._file) - this._muxer.on('ready', data => { - this._tracks = data.map(trackData => { - const mediaSource = this._elemWrapper.createWriteStream(trackData.mime) - mediaSource.on('error', err => { - this._elemWrapper.error(err) - }) - const track = { - muxed: null, - mediaSource, - initFlushed: false, - onInitFlushed: null - } - mediaSource.write(trackData.init, err => { - track.initFlushed = true - if (track.onInitFlushed) { - track.onInitFlushed(err) - } - }) - return track - }) - - if (this._waitingFired || this._elem.preload === 'auto') { - this._pump() - } - }) - - this._muxer.on('error', err => { - this._elemWrapper.error(err) - }) - }, - _pump () { - const muxed = this._muxer.seek(this._elem.currentTime, !this._tracks) - - this._tracks.forEach((track, i) => { - const pumpTrack = () => { - if (track.muxed) { - track.muxed.destroy() - track.mediaSource = this._elemWrapper.createWriteStream(track.mediaSource) - track.mediaSource.on('error', err => { - this._elemWrapper.error(err) - }) - } - track.muxed = muxed[i] - pump(track.muxed, track.mediaSource) - } - if (!track.initFlushed) { - track.onInitFlushed = err => { - if (err) { - this._elemWrapper.error(err) - return - } - pumpTrack() - } - } else { - pumpTrack() - } - }) - }, - destroy () { - if (this.destroyed) { - return - } - this.destroyed = true - - this._elem.removeEventListener('waiting', this._onWaiting) - this._elem.removeEventListener('error', this._onError) - - if (this._tracks) { - this._tracks.forEach(track => { - if (track.muxed) { - track.muxed.destroy() - } - }) - } - - this._elem.src = '' - } -} - -module.exports = VideoStream - - -/***/ }), - -/***/ "./node_modules/webtorrent-player/index.js": -/*!*************************************************!*\ - !*** ./node_modules/webtorrent-player/index.js ***! - \*************************************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "default": () => (/* binding */ WebTorrentPlayer) -/* harmony export */ }); -/* harmony import */ var webtorrent__WEBPACK_IMPORTED_MODULE_0__ = __webpack_require__(/*! webtorrent */ "./node_modules/webtorrent/index.js"); -/* harmony import */ var webtorrent__WEBPACK_IMPORTED_MODULE_0___default = /*#__PURE__*/__webpack_require__.n(webtorrent__WEBPACK_IMPORTED_MODULE_0__); -/* harmony import */ var matroska_subtitles__WEBPACK_IMPORTED_MODULE_1__ = __webpack_require__(/*! matroska-subtitles */ "./node_modules/matroska-subtitles/dist/matroska-subtitles.module.js"); -/* harmony import */ var hybrid_chunk_store__WEBPACK_IMPORTED_MODULE_2__ = __webpack_require__(/*! hybrid-chunk-store */ "./node_modules/hybrid-chunk-store/index.js"); -/* harmony import */ var hybrid_chunk_store__WEBPACK_IMPORTED_MODULE_2___default = /*#__PURE__*/__webpack_require__.n(hybrid_chunk_store__WEBPACK_IMPORTED_MODULE_2__); -/* harmony import */ var _lib_subtitles_octopus_js__WEBPACK_IMPORTED_MODULE_3__ = __webpack_require__(/*! ./lib/subtitles-octopus.js */ "./node_modules/webtorrent-player/lib/subtitles-octopus.js"); -/* harmony import */ var _lib_subtitles_octopus_js__WEBPACK_IMPORTED_MODULE_3___default = /*#__PURE__*/__webpack_require__.n(_lib_subtitles_octopus_js__WEBPACK_IMPORTED_MODULE_3__); -/* harmony import */ var _lib_peer_js__WEBPACK_IMPORTED_MODULE_4__ = __webpack_require__(/*! ./lib/peer.js */ "./node_modules/webtorrent-player/lib/peer.js"); -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -/* global MediaMetadata, navNowPlaying */ - - - - - - -const units = [' B', ' KB', ' MB', ' GB', ' TB'] - -class WebTorrentPlayer extends (webtorrent__WEBPACK_IMPORTED_MODULE_0___default()) { - constructor (options = {}) { - super(options.WebTorrentOpts) - - this.storeOpts = options.storeOpts || {} - - const scope = location.pathname.substr(0, location.pathname.lastIndexOf('/') + 1) - const worker = location.origin + scope + 'sw.js' === navigator.serviceWorker?.controller?.scriptURL && navigator.serviceWorker.controller - const handleWorker = worker => { - const checkState = worker => { - return worker.state === 'activated' && this.loadWorker(worker) - } - if (!checkState(worker)) { - worker.addEventListener('statechange', ({ target }) => checkState(target)) - } - } - if (worker) { - handleWorker(worker) - } else { - navigator.serviceWorker.register('sw.js', { scope }).then(reg => { - handleWorker(reg.active || reg.waiting || reg.installing) - }).catch(e => { - if (String(e) === 'InvalidStateError: Failed to register a ServiceWorker: The document is in an invalid state.') { - location.reload() // weird workaround for a weird bug - } else { - throw e - } - }) - } - window.addEventListener('unload', () => { - this.destroy() - this.cleanupVideo() - }) - - this.video = options.video - this.controls = options.controls || {} // object of controls - // playPause, playNext, playLast, openPlaylist, toggleMute, setVolume, setProgress, selectCaptions, selectAudio, toggleTheatre, toggleFullscreen, togglePopout, forward, rewind - - if (this.controls.setVolume) { - this.controls.setVolume.addEventListener('input', e => this.setVolume(e.target.value)) - this.setVolume() - this.oldVolume = undefined - if ('audioTracks' in HTMLVideoElement.prototype && this.controls.audioButton) { - this.video.addEventListener('loadedmetadata', () => { - if (this.video.audioTracks.length > 1) { - this.controls.audioButton.removeAttribute('disabled') - for (const track of this.video.audioTracks) { - this.createRadioElement(track, 'audio') - } - } else { - this.controls.audioButton.setAttribute('disabled', '') - } - }) - } - } - if (this.controls.ppToggle) { - this.controls.ppToggle.addEventListener('click', () => this.playPause()) - this.controls.ppToggle.addEventListener('dblclick', () => this.toggleFullscreen()) - } - - if (this.controls.setProgress) { - this.controls.setProgress.addEventListener('input', e => this.setProgress(e.target.value)) - this.controls.setProgress.addEventListener('mouseup', e => this.dragBarEnd(e.target.value)) - this.controls.setProgress.addEventListener('touchend', e => this.dragBarEnd(e.target.value)) - this.controls.setProgress.addEventListener('mousedown', e => this.dragBarStart(e.target.value)) - this.video.addEventListener('timeupdate', e => { - if (this.immerseTimeout && document.location.hash === '#player' && !this.video.paused) this.setProgress(e.target.currentTime / e.target.duration * 100) - }) - this.video.addEventListener('ended', () => this.setProgress(100)) - } - - this.video.addEventListener('loadedmetadata', () => this.findSubtitleFiles(this.currentFile)) - this.subtitleData = { - fonts: [], - headers: [], - tracks: [], - current: undefined, - renderer: undefined, - stream: undefined, - parser: undefined, - parsed: undefined, - timeout: undefined, - defaultHeader: `[V4+ Styles] -Format: Name, Fontname, Fontsize, PrimaryColour, SecondaryColour, OutlineColour, BackColour, Bold, Italic, Underline, StrikeOut, ScaleX, ScaleY, Spacing, Angle, BorderStyle, Outline, Shadow, Alignment, MarginL, MarginR, MarginV, Encoding -Style: Default,${options.defaultSSAStyles || 'Roboto Medium,26,&H00FFFFFF,&H000000FF,&H00020713,&H00000000,0,0,0,0,100,100,0,0,1,1.3,0,2,20,20,23,1'} -[Events] - -` - } - - this.completed = false - this.video.addEventListener('timeupdate', () => this.checkCompletion()) - - this.nextTimeout = undefined - if (options.autoNext) this.video.addEventListener('ended', () => this.playNext()) - - this.resolveFileMedia = options.resolveFileMedia - this.currentFile = undefined - this.videoFile = undefined - - if (this.controls.thumbnail) { - this.generateThumbnails = options.generateThumbnails - const thumbCanvas = document.createElement('canvas') - thumbCanvas.width = options.thumbnailWidth || 150 - this.thumbnailData = { - thumbnails: [], - canvas: thumbCanvas, - context: thumbCanvas.getContext('2d'), - interval: undefined, - video: undefined - } - this.video.addEventListener('loadedmetadata', () => this.initThumbnail()) - this.video.addEventListener('timeupdate', () => this.createThumbnail(this.video)) - } - - if (options.visibilityLossPause) { - document.addEventListener('visibilitychange', () => { - if (!this.video.ended) document.visibilityState === 'hidden' ? this.video.pause() : this.playPause() - }) - } - - this.onDone = undefined - - this.destroyStore = !!options.destroyStore - - this.immerseTimeout = undefined - this.immerseTime = options.immerseTime || 5 - - this.playerWrapper = options.playerWrapper - this.player = options.player - if (this.player) { - this.player.addEventListener('fullscreenchange', () => this.updateFullscreen()) - this.player.addEventListener('mousemove', () => requestAnimationFrame(() => this.resetImmerse())) - this.player.addEventListener('touchmove', () => requestAnimationFrame(() => this.resetImmerse())) - this.player.addEventListener('keypress', () => requestAnimationFrame(() => this.resetImmerse())) - this.player.addEventListener('mouseleave', () => requestAnimationFrame(() => this.immersePlayer())) - - this.doubleTapTimeout = undefined - this.player.addEventListener('touchend', e => { - if (this.doubleTapTimeout) { - e.preventDefault() - clearTimeout(this.doubleTapTimeout) - this.doubleTapTimeout = undefined - this.toggleFullscreen() - } else { - this.doubleTapTimeout = setTimeout(() => { - this.doubleTapTimeout = undefined - }, 200) - } - }) - } - - this.bufferTimeout = undefined - this.video.addEventListener('playing', () => this.hideBuffering()) - this.video.addEventListener('canplay', () => this.hideBuffering()) - this.video.addEventListener('loadeddata', () => this.hideBuffering()) - this.video.addEventListener('waiting', () => this.showBuffering()) - - const handleAvailability = aval => { - if (aval) { - this.controls.toggleCast.removeAttribute('disabled') - } else { - this.controls.toggleCast.setAttribute('disabled', '') - } - } - if ('PresentationRequest' in window) { - this.presentationRequest = new PresentationRequest(['lib/cast.html']) - this.presentationRequest.addEventListener('connectionavailable', e => this.initCast(e)) - this.presentationConnection = null - navigator.presentation.defaultRequest = this.presentationRequest - this.presentationRequest.getAvailability().then(aval => { - aval.onchange = e => handleAvailability(e.target.value) - handleAvailability(aval.value) - }) - } else { - this.controls.toggleCast.setAttribute('disabled', '') - } - - if ('pictureInPictureEnabled' in document) { - this.burnIn = options.burnIn - if (this.controls.togglePopout) this.controls.togglePopout.removeAttribute('disabled') - if (this.burnIn) this.video.addEventListener('enterpictureinpicture', () => { if (this.subtitleData.renderer) this.togglePopout() }) - } else { - this.video.setAttribute('disablePictureInPicture', '') - if (this.controls.togglePopout) this.controls.togglePopout.setAttribute('disabled', '') - } - - this.seekTime = options.seekTime || 5 - if ('mediaSession' in navigator) { - navigator.mediaSession.setActionHandler('play', () => this.playPause()) - navigator.mediaSession.setActionHandler('pause', () => this.playPause()) - navigator.mediaSession.setActionHandler('seekbackward', () => this.seek(this.seekTime)) - navigator.mediaSession.setActionHandler('seekforward', () => this.seek(this.seekTime)) - navigator.mediaSession.setActionHandler('nexttrack', () => this.playNext()) - if ('setPositionState' in navigator.mediaSession) this.video.addEventListener('timeupdate', () => this.updatePositionState()) - } - - this.subtitleExtensions = ['.srt', '.vtt', '.ass', '.ssa'] - this.videoExtensions = ['.3g2', '.3gp', '.asf', '.avi', '.dv', '.flv', '.gxf', '.m2ts', '.m4a', '.m4b', '.m4p', '.m4r', '.m4v', '.mkv', '.mov', '.mp4', '.mpd', '.mpeg', '.mpg', '.mxf', '.nut', '.ogm', '.ogv', '.swf', '.ts', '.vob', '.webm', '.wmv', '.wtv'] - this.videoFiles = undefined - - this.updateDisplay() - this.offlineTorrents = JSON.parse(localStorage.getItem('offlineTorrents')) || {} - // adds all offline store torrents to the client - Object.values(this.offlineTorrents).forEach(torrentID => this.offlineDownload(new Blob([new Uint8Array(torrentID)]))) - - this.streamedDownload = options.streamedDownload - - this.fps = 23.976 - this.video.addEventListener('loadedmetadata', () => { - if ('requestVideoFrameCallback' in HTMLVideoElement.prototype) { - this.fps = new Promise(resolve => { - const resolveFps = () => { - this.video.removeEventListener('timeupdate', resolveFps) - if (!this.video.paused) { - setTimeout(() => this.video.requestVideoFrameCallback((now, metaData) => { - let duration = 0 - for (let index = this.video.played.length; index--;) { - duration += this.video.played.end(index) - this.video.played.start(index) - } - const rawFPS = metaData.presentedFrames / duration - if (rawFPS < 28) { - resolve(23.976) - } else if (rawFPS <= 35) { - resolve(29.97) - } else if (rawFPS <= 70) { - resolve(59.94) - } else { - resolve(23.976) // smth went VERY wrong - } - }), 2000) - } - } - this.video.addEventListener('timeupdate', resolveFps) - }) - } - }) - - for (const [functionName, elements] of Object.entries(this.controls)) { - if (this[functionName]) { - if (elements.constructor === Array) { - for (const element of elements) { - element.addEventListener('click', e => { - this[functionName](e.target.value) - }) - } - } else { - elements.addEventListener('click', e => { - this[functionName](e.target.value) - }) - } - } - } - document.addEventListener('keydown', a => { - if (a.key === 'F5') { - a.preventDefault() - } - if (location.hash === '#player') { - switch (a.key) { - case ' ': - this.playPause() - break - case 'n': - this.playNext() - break - case 'm': - this.toggleMute() - break - case 'p': - this.togglePopout() - break - case 't': - this.toggleTheatre() - break - case 'c': - this.captions() - break - case 'f': - this.toggleFullscreen() - break - case 's': - this.seek(85) - break - case 'ArrowLeft': - this.seek(-this.seekTime) - break - case 'ArrowRight': - this.seek(this.seekTime) - break - case 'ArrowUp': - this.setVolume(Number(this.controls.setVolume.value) + 5) - break - case 'ArrowDown': - this.setVolume(Number(this.controls.setVolume.value) - 5) - break - case 'Escape': - location.hash = '#home' - break - } - } - }) - } - - async buildVideo (torrent, opts = {}) { // sets video source and creates a bunch of other media stuff - // play wanted episode from opts, or the 1st episode, or 1st file [batches: plays wanted episode, single: plays the only episode, manually added: plays first or only file] - this.cleanupVideo() - if (opts.file) { - this.currentFile = opts.file - } else if (this.videoFiles.length > 1) { - this.currentFile = this.videoFiles.filter(async file => await this.resolveFileMedia({ fileName: file.name }).then(FileMedia => (Number(FileMedia.episodeNumber) === Number(opts.episode || 1)) || (FileMedia === opts.media)))[0] || this.videoFiles[0] - } else { - this.currentFile = this.videoFiles[0] - } - // opts.media: mediaTitle, episodeNumber, episodeTitle, episodeThumbnail, mediaCover, name - this.nowPlaying = (opts.media && (this.videoFiles.length === 1 || (opts.forceMedia && opts.file))) ? opts.media : this.resolveFileMedia ? await this.resolveFileMedia({ fileName: this.currentFile.name, method: 'SearchName' }) : undefined - - if (this.nowPlaying) { - if (navNowPlaying) navNowPlaying.classList.remove('d-none') - - const episodeInfo = [this.nowPlaying.episodeNumber, this.nowPlaying.episodeTitle].filter(s => s).join(' - ') - - if ('mediaSession' in navigator) { - navigator.mediaSession.metadata = new MediaMetadata({ - title: this.nowPlaying.mediaTitle || this.nowPlaying.name || 'WebTorrentPlayer', - artist: 'Episode ' + episodeInfo, - album: this.nowPlaying.name || 'WebTorrentPlayer', - artwork: [{ - src: this.nowPlaying.episodeThumbnail || this.nowPlaying.mediaCover || '', - sizes: '256x256', - type: 'image/jpg' - }] - }) - } - if (this.nowPlaying.episodeThumbnail) this.video.poster = this.nowPlaying.episodeThumbnail - - this.changeControlsIcon('nowPlaying', 'EP ' + episodeInfo) - document.title = [this.nowPlaying.mediaTitle, episodeInfo ? 'EP ' + episodeInfo : false, this.nowPlaying.name || 'WebTorrentPlayer'].filter(s => s).join(' - ') - } - if (!this.currentFile.done && this.currentFile.name.endsWith('.mkv')) await this.initParser(this.currentFile) - await navigator.serviceWorker.ready - if (this.currentFile.done) { - this.postDownload() - } else { - this.onDone = this.currentFile.on('done', () => { - this.postDownload(true) - }) - } - this.currentFile.on('stream', ({ stream, file, req }, cb) => { - if (req.destination === 'video' && file.name.endsWith('.mkv') && !this.subtitleData.parsed) { - this.subtitleData.stream = new matroska_subtitles__WEBPACK_IMPORTED_MODULE_1__.SubtitleStream(this.subtitleData.stream) - this.handleSubtitleParser(this.subtitleData.stream, true) - stream.pipe(this.subtitleData.stream) - cb(this.subtitleData.stream) - } - }) - this.currentFile.streamTo(this.video) - this.video.load() - this.playVideo() - - if (this.controls.downloadFile) { - this.currentFile.getStreamURL((_err, url) => { - this.controls.downloadFile.href = url - }) - } - } - - cleanupVideo () { // cleans up objects, attemps to clear as much video caching as possible - this.presentationConnection?.terminate() - if (document.pictureInPictureElement) document.exitPictureInPicture() - this.subtitleData.renderer?.destroy() - this.subtitleData.parser?.destroy() - this.subtitleData.stream?.destroy() - this.subtitleData.fonts?.forEach(file => URL.revokeObjectURL(file)) // ideally this should clean up after its been downloaded by the sw renderer, but oh well - if (this.controls.downloadFile) this.controls.downloadFile.href = '' - this.currentFile = undefined - this.video.poster = '' - // some attemt at cache clearing - this.video.pause() - this.video.src = '' - this.video.load() - this.onDone = undefined - document.title = this.nowPlaying?.name || 'WebTorrentPlayer' - this.setProgress(0) - // look for file and delete its store, idk how to do this - Object.assign(this.subtitleData, { - fonts: [], - headers: [], - tracks: [], - current: undefined, - renderer: undefined, - stream: undefined, - parser: undefined, - parsed: undefined, - timeout: undefined - }) - - if (this.controls.thumbnail) { - Object.assign(this.thumbnailData, { - thumbnails: [], - interval: undefined, - video: undefined - }) - } - this.completed = false - this.changeControlsIcon('nowPlaying', '') - if (this.controls.captionsButton) this.controls.captionsButton.setAttribute('disabled', '') - this.changeControlsIcon('selectCaptions', '') - this.changeControlsIcon('selectAudio', '') - if (this.controls.openPlaylist) this.controls.openPlaylist.setAttribute('disabled', '') - if (navNowPlaying) navNowPlaying.classList.add('d-none') - if ('mediaSession' in navigator) navigator.mediaSession.metadata = undefined - this.fps = 23.976 - } - - changeControlsIcon (type, text) { - if (this.controls[type]) { - if (this.controls[type].constructor === Array) { - for (const element of this.controls[type]) { - element.textContent = text - } - } else { - this.controls[type].textContent = text - } - } - } - - async playVideo () { - try { - await this.video.play() - this.changeControlsIcon('playPause', 'pause') - } catch (err) { - this.changeControlsIcon('playPause', 'play_arrow') - } - } - - playPause () { - if (this.video.paused) { - this.playVideo() - } else { - this.changeControlsIcon('playPause', 'play_arrow') - this.video.pause() - } - } - - setVolume (volume) { - const level = volume === undefined ? Number(this.controls.setVolume.value) : volume - this.controls.setVolume.value = level - this.controls.setVolume.style.setProperty('--volume-level', level + '%') - this.changeControlsIcon('toggleMute', level === 0 ? 'volume_off' : 'volume_up') - this.video.volume = level / 100 - } - - toggleMute () { - if (this.video.volume === 0) { - this.setVolume(this.oldVolume) - } else { - this.oldVolume = this.video.volume * 100 - this.setVolume(0) - } - } - - toggleTheatre () { - this.playerWrapper.classList.toggle('nav-hidden') - } - - toggleFullscreen () { - document.fullscreenElement ? document.exitFullscreen() : this.player.requestFullscreen() - } - - updateFullscreen () { - this.changeControlsIcon('toggleFullscreen', document.fullscreenElement ? 'fullscreen_exit' : 'fullscreen') - } - - openPlaylist () { - this.emit('playlist', { files: this.videoFiles }) - } - - playNext () { - clearTimeout(this.nextTimeout) - this.nextTimeout = setTimeout(() => { - if (this.videoFiles?.indexOf(this.currentFile) < this.videoFiles?.length - 1) { - const nowPlaying = this.nowPlaying - nowPlaying.episodeNumber += 1 - const torrent = this.currentFile._torrent - this.buildVideo(torrent, { media: nowPlaying, file: this.videoFiles[this.videoFiles.indexOf(this.currentFile) + 1] }) - } else { - this.emit('next', { file: this.currentFile, filemedia: this.nowPlaying }) - } - }, 200) - } - - playLast () { - clearTimeout(this.nextTimeout) - this.nextTimeout = setTimeout(() => { - if (this.videoFiles?.indexOf(this.currentFile)) { - const nowPlaying = this.nowPlaying - nowPlaying.episodeNumber -= 1 - const torrent = this.currentFile._torrent - this.buildVideo(torrent, { media: nowPlaying, file: this.videoFiles[this.videoFiles.indexOf(this.currentFile) - 1] }) - } else { - this.emit('prev', { file: this.currentFile, filemedia: this.nowPlaying }) - } - }, 200) - } - - toggleCast () { - if (this.video.readyState) { - if (this.presentationConnection) { - this.presentationConnection?.terminate() - } else { - this.presentationRequest.start() - } - } - } - - initCast (event) { - let peer = new _lib_peer_js__WEBPACK_IMPORTED_MODULE_4__.default({ polite: true }) - - this.presentationConnection = event.connection - this.presentationConnection.addEventListener('terminate', () => { - this.presentationConnection = null - this.changeControlsIcon('toggleCast', 'cast') - this.player.classList.remove('pip') - peer = null - }) - - peer.signalingPort.onmessage = ({ data }) => { - this.presentationConnection.send(data) - } - - this.presentationConnection.addEventListener('message', ({ data }) => { - peer.signalingPort.postMessage(data) - }) - - peer.dc.onopen = async () => { - await this.fps - if (peer && this.presentationConnection) { - this.changeControlsIcon('toggleCast', 'cast_connected') - this.player.classList.add('pip') - const tracks = [] - const videostream = this.video.captureStream(await this.fps) - if (this.burnIn) { - const { stream, destroy } = await this.getBurnIn(!this.subtitleData.renderer) - tracks.push(stream.getVideoTracks()[0], videostream.getAudioTracks()[0]) - this.presentationConnection.addEventListener('terminate', destroy) - } else { - tracks.push(videostream.getVideoTracks()[0], videostream.getAudioTracks()[0]) - } - for (const track of tracks) { - peer.pc.addTrack(track, videostream) - } - this.video.play() // video pauses for some reason - } - } - } - - async togglePopout () { - if (this.video.readyState) { - if (this.burnIn) { - await this.fps - if (!this.subtitleData.renderer) { - this.video !== document.pictureInPictureElement ? this.video.requestPictureInPicture() : document.exitPictureInPicture() - } else { - if (document.pictureInPictureElement && !document.pictureInPictureElement.id) { // only exit if pip is the custom one, else overwrite existing pip with custom - document.exitPictureInPicture() - } else { - const canvasVideo = document.createElement('video') - const { stream, destroy } = await this.getBurnIn() - canvasVideo.srcObject = stream - canvasVideo.onloadedmetadata = () => { - canvasVideo.play() - canvasVideo.requestPictureInPicture().then( - this.player.classList.add('pip') - ).catch(e => { - console.warn('Failed To Burn In Subtitles ' + e) - destroy() - canvasVideo.remove() - this.player.classList.remove('pip') - }) - } - canvasVideo.onleavepictureinpicture = () => { - destroy() - canvasVideo.remove() - this.player.classList.remove('pip') - } - } - } - } else { - this.video !== document.pictureInPictureElement ? this.video.requestPictureInPicture() : document.exitPictureInPicture() - } - } - } - - async getBurnIn (noSubs) { - const canvas = document.createElement('canvas') - const context = canvas.getContext('2d', { alpha: false }) - let running = true - canvas.width = this.video.videoWidth - canvas.height = this.video.videoHeight - - const renderFrame = () => { - if (running === true) { - context.drawImage(this.video, 0, 0) - if (!noSubs) context.drawImage(this.subtitleData.renderer?.canvas, 0, 0, canvas.width, canvas.height) - requestAnimationFrame(renderFrame) - } - } - requestAnimationFrame(renderFrame) - const destroy = () => { - running = false - canvas.remove() - } - return { stream: canvas.captureStream(await this.fps), destroy } - } - - toTS (sec, full) { - if (isNaN(sec) || sec < 0) { - return full ? '0:00:00.00' : '00:00' - } - const hours = Math.floor(sec / 3600) - let minutes = Math.floor(sec / 60) - (hours * 60) - let seconds = full ? (sec % 60).toFixed(2) : Math.floor(sec % 60) - if (minutes < 10) minutes = '0' + minutes - if (seconds < 10) seconds = '0' + seconds - return (hours > 0 || full) ? hours + ':' + minutes + ':' + seconds : minutes + ':' + seconds - } - - prettyBytes (num) { - if (isNaN(num)) return '0 B' - if (num < 1) return num + ' B' - const exponent = Math.min(Math.floor(Math.log(num) / Math.log(1000)), units.length - 1) - return Number((num / Math.pow(1000, exponent)).toFixed(2)) + units[exponent] - } - - getBytes (str) { - const units = ['B', 'KiB', 'MiB', 'GiB', 'TiB', 'Bytes', 'KB', 'MB', 'GB', 'TB'] - const split = str.split(' ') - return split[0] * 1024 ** (units.indexOf(split[1] || 'B') % 5) // this is so lazy - } - - seek (time) { - if (time === 85 && this.video.currentTime < 10) { - this.video.currentTime = 90 - } else if (time === 85 && (this.video.duration - this.video.currentTime) < 90) { - this.video.currentTime = this.video.duration - } else { - this.video.currentTime += time - } - this.setProgress(this.video.currentTime / this.video.duration * 100) - } - - forward () { - this.seek(this.seekTime) - } - - rewind () { - this.seek(-this.seekTime) - } - - immersePlayer () { - this.player.classList.add('immersed') - this.immerseTimeout = undefined - } - - resetImmerse () { - if (this.immerseTimeout) { - clearTimeout(this.immerseTimeout) - } else { - this.player.classList.remove('immersed') - } - this.immerseTimeout = setTimeout(() => this.immersePlayer(), this.immerseTime * 1000) - } - - hideBuffering () { - if (this.bufferTimeout) { - clearTimeout(this.bufferTimeout) - this.bufferTimeout = undefined - this.player.classList.remove('buffering') - } - } - - showBuffering () { - this.bufferTimeout = setTimeout(() => { - this.player.classList.add('buffering') - this.resetImmerse() - }, 150) - } - - checkCompletion () { - if (!this.completed && this.video.duration - 180 < this.video.currentTime) { - this.completed = true - this.emit('watched', { file: this.currentFile, filemedia: this.nowPlaying }) - } - } - - updatePositionState () { - if (this.video.duration) { - navigator.mediaSession.setPositionState({ - duration: this.video.duration || 0, - playbackRate: this.video.playbackRate || 0, - position: this.video.currentTime || 0 - }) - } - } - - initThumbnail () { - const height = this.thumbnailData.canvas.width / (this.video.videoWidth / this.video.videoHeight) - this.thumbnailData.interval = this.video.duration / 300 < 5 ? 5 : this.video.duration / 300 - this.thumbnailData.canvas.height = height - this.controls.thumbnail.style.setProperty('height', height + 'px') - } - - createThumbnail (video) { - if (video?.readyState >= 2) { - const index = Math.floor(video.currentTime / this.thumbnailData.interval) - if (!this.thumbnailData.thumbnails[index]) { - this.thumbnailData.context.fillRect(0, 0, 150, this.thumbnailData.canvas.height) - this.thumbnailData.context.drawImage(video, 0, 0, 150, this.thumbnailData.canvas.height) - this.thumbnailData.thumbnails[index] = this.thumbnailData.canvas.toDataURL('image/jpeg') - } - } - } - - finishThumbnails (src) { - const t0 = performance.now() - const video = document.createElement('video') - let index = 0 - video.preload = 'none' - video.volume = 0 - video.playbackRate = 0 - video.addEventListener('loadeddata', () => loadTime()) - video.addEventListener('canplay', () => { - this.createThumbnail(this.thumbnailData.video) - loadTime() - }) - this.thumbnailData.video = video - const loadTime = () => { - while (this.thumbnailData.thumbnails[index] && index <= Math.floor(this.thumbnailData.video.duration / this.thumbnailData.interval)) { // only create thumbnails that are missing - index++ - } - if (this.thumbnailData.video?.currentTime !== this.thumbnailData.video?.duration) { - this.thumbnailData.video.currentTime = index * this.thumbnailData.interval - } else { - this.thumbnailData.video?.removeAttribute('src') - this.thumbnailData.video?.load() - this.thumbnailData.video?.remove() - delete this.thumbnailData.video - console.log('Thumbnail creating finished', index, this.toTS((performance.now() - t0) / 1000)) - } - index++ - } - this.thumbnailData.video.src = src - this.thumbnailData.video.play() - console.log('Thumbnail creating started') - } - - dragBarEnd (progressPercent) { - this.video.currentTime = this.video.duration * progressPercent / 100 || 0 - this.playVideo() - } - - dragBarStart (progressPercent) { - this.video.pause() - this.setProgress(progressPercent) - } - - setProgress (progressPercent) { - progressPercent = progressPercent || 0 - const currentTime = this.video.duration * progressPercent / 100 || 0 - if (this.controls.progressWrapper) this.controls.progressWrapper.style.setProperty('--progress', progressPercent + '%') - if (this.controls.thumbnail) this.controls.thumbnail.src = this.thumbnailData.thumbnails[Math.floor(currentTime / this.thumbnailData.interval)] || ' ' - if (this.controls.setProgress) { - this.controls.setProgress.dataset.elapsed = this.toTS(currentTime) - this.controls.setProgress.value = progressPercent - } - if (this.controls.progressWrapper) { - this.controls.progressWrapper.dataset.elapsed = this.toTS(currentTime) - this.controls.progressWrapper.dataset.remaining = this.toTS(this.video.duration - currentTime) - } - } - - updateDisplay () { - if (this.currentFile && this.currentFile._torrent) { - if (this.player) this.player.style.setProperty('--download', this.currentFile.progress * 100 + '%') - if (this.controls.peers) this.controls.peers.dataset.value = this.currentFile._torrent.numPeers - if (this.controls.downSpeed) this.controls.downSpeed.dataset.value = this.prettyBytes(this.currentFile._torrent.downloadSpeed) + '/s' - if (this.controls.upSpeed) this.controls.upSpeed.dataset.value = this.prettyBytes(this.currentFile._torrent.uploadSpeed) + '/s' - } - setTimeout(() => requestAnimationFrame(() => this.updateDisplay()), 200) - } - - createRadioElement (track, type) { - // type: captions audio - if ((type === 'captions' && this.controls.selectCaptions && this.controls.captionsButton) || (type === 'audio' && this.controls.selectAudio)) { - const frag = document.createDocumentFragment() - const input = document.createElement('input') - const label = document.createElement('label') - input.name = `${type}-radio-set` - input.type = 'radio' - input.id = type === 'captions' ? `${type}-${track ? track.number : 'off'}-radio` : `${type}-${track.id}-radio` - input.value = type === 'captions' ? track ? track.number : -1 : track.id - input.checked = type === 'captions' ? track?.number === this.subtitleData.current : track.enabled - label.htmlFor = type === 'captions' ? `${type}-${track ? track.number : 'off'}-radio` : `${type}-${track.id}-radio` - label.textContent = track - ? type === 'captions' - ? (track.language || (!Object.values(this.subtitleData.headers).some(header => header.language === 'eng' || header.language === 'en') ? 'eng' : track.type)) + (track.name ? ' - ' + track.name : '') - : (track.language || (!Object.values(this.video.audioTracks).some(track => track.language === 'eng' || track.language === 'en') ? 'eng' : track.label)) + (track.label ? ' - ' + track.label : '') - : 'OFF' // TODO: clean this up, TLDR assume english track if track lang is undefined || 'und' and there isnt an existing eng track already - frag.append(input) - frag.append(label) - if (type === 'captions') { - this.controls.selectCaptions.append(frag) - this.controls.captionsButton.removeAttribute('disabled') - } else { - this.controls.selectAudio.append(frag) - } - } - } - - selectAudio (id) { - if (id !== undefined) { - for (const track of this.video.audioTracks) { - track.enabled = track.id === id - } - this.seek(-0.5) // stupid fix because video freezes up when chaging tracks - } - } - - selectCaptions (trackNumber) { - if (trackNumber !== undefined) { - trackNumber = Number(trackNumber) - this.subtitleData.current = trackNumber - if (!this.subtitleData.timeout) { - this.subtitleData.timeout = setTimeout(() => { - this.subtitleData.timeout = undefined - if (this.subtitleData.renderer) { - this.subtitleData.renderer.setTrack(trackNumber !== -1 ? this.subtitleData.headers[trackNumber].header.slice(0, -1) + Array.from(this.subtitleData.tracks[trackNumber]).join('\n') : this.subtitleData.defaultHeader) - } - }, 1000) - } - } - } - - constructSub (subtitle, isNotAss) { - if (isNotAss === true) { // converts VTT or other to SSA - const matches = subtitle.text.match(/<[^>]+>/g) // create array of all tags - if (matches) { - matches.forEach(match => { - if (/<\//.test(match)) { // check if its a closing tag - subtitle.text = subtitle.text.replace(match, match.replace('', '0}')) - } else { - subtitle.text = subtitle.text.replace(match, match.replace('<', '{\\').replace('>', '1}')) - } - }) - } - // replace all html special tags with normal ones - subtitle.text.replace(/&/g, '&').replace(/</g, '<').replace(/>/g, '>').replace(/ /g, '\\h') - } - return 'Dialogue: ' + - (subtitle.layer || 0) + ',' + - this.toTS(subtitle.time / 1000, true) + ',' + - this.toTS((subtitle.time + subtitle.duration) / 1000, true) + ',' + - (subtitle.style || 'Default') + ',' + - (subtitle.name || '') + ',' + - (subtitle.marginL || '0') + ',' + - (subtitle.marginR || '0') + ',' + - (subtitle.marginV || '0') + ',' + - (subtitle.effect || '') + ',' + - subtitle.text || 0 - } - - parseSubtitles (file, skipFiles) { // parse subtitles fully after a download is finished - return new Promise((resolve) => { - if (file.name.endsWith('.mkv')) { - let parser = new matroska_subtitles__WEBPACK_IMPORTED_MODULE_1__.SubtitleParser() - this.handleSubtitleParser(parser, skipFiles) - parser.on('finish', () => { - console.log('Sub parsing finished', this.toTS((performance.now() - t0) / 1000)) - this.subtitleData.parsed = true - this.subtitleData.stream?.destroy() - this.subtitleData.stream = undefined - this.subtitleData.parser.destroy() - this.subtitleData.parser = undefined - this.selectCaptions(this.subtitleData.current) - parser = undefined - if (!this.video.paused) { - this.video.pause() - this.playVideo() - } - resolve() - }) - const t0 = performance.now() - console.log('Sub parsing started') - this.subtitleData.parser = file.createReadStream().pipe(parser) - } else { - resolve() - } - }) - } - - initParser (file) { - return new Promise(resolve => { - this.subtitleData.stream = new matroska_subtitles__WEBPACK_IMPORTED_MODULE_1__.SubtitleParser() - this.handleSubtitleParser(this.subtitleData.stream) - this.subtitleData.stream.once('tracks', tracks => { - if (!tracks.length) { - this.subtitleData.parsed = true - resolve() - this.subtitleData.stream.destroy() - fileStreamStream.destroy() - } - }) - this.subtitleData.stream.once('subtitle', () => { - resolve() - fileStreamStream.destroy() - }) - const fileStreamStream = file.createReadStream() - fileStreamStream.pipe(this.subtitleData.stream) - }) - } - - handleSubtitleParser (parser, skipFile) { - parser.once('tracks', tracks => { - if (!tracks.length) { - this.subtitleData.parsed = true - } else { - tracks.forEach(track => { - if (!this.subtitleData.tracks[track.number]) { - // overwrite webvtt or other header with custom one - if (track.type !== 'ass') track.header = this.subtitleData.defaultHeader - if (!this.subtitleData.current) { - this.subtitleData.current = track.number - this.createRadioElement(undefined, 'captions') - } - this.subtitleData.tracks[track.number] = new Set() - this.subtitleData.headers[track.number] = track - this.createRadioElement(track, 'captions') - } - }) - } - }) - parser.on('subtitle', (subtitle, trackNumber) => { - if (!this.subtitleData.parsed) { - if (!this.subtitleData.renderer) this.initSubtitleRenderer() - this.subtitleData.tracks[trackNumber].add(this.constructSub(subtitle, this.subtitleData.headers[trackNumber].type !== 'ass')) - if (this.subtitleData.current === trackNumber) this.selectCaptions(trackNumber) - } - }) - if (!skipFile) { - parser.on('file', file => { - if (file.mimetype === 'application/x-truetype-font' || file.mimetype === 'application/font-woff' || file.mimetype === 'application/vnd.ms-opentype') { - this.subtitleData.fonts.push(URL.createObjectURL(new Blob([file.data], { type: file.mimetype }))) - } - }) - } - } - - async initSubtitleRenderer () { - if (!this.subtitleData.renderer) { - const options = { - video: this.video, - targetFps: await this.fps, - subContent: this.subtitleData.headers[this.subtitleData.current].header.slice(0, -1), - renderMode: 'offscreen', - fonts: this.subtitleData.fonts, - fallbackFont: 'https://fonts.gstatic.com/s/roboto/v20/KFOlCnqEu92Fr1MmEU9fBBc4.woff2', - workerUrl: 'lib/subtitles-octopus-worker.js', - onReady: () => { // weird hack for laggy subtitles, this is some issue in SO - if (!this.video.paused) { - this.video.pause() - this.playVideo() - } - } - } - if (!this.subtitleData.renderer) { - this.subtitleData.renderer = new (_lib_subtitles_octopus_js__WEBPACK_IMPORTED_MODULE_3___default())(options) - this.selectCaptions(this.subtitleData.current) - } - } - } - - convertSubFile (file, isAss, callback) { - const regex = /(?:\d+\n)?(\S{9,12})\s?-->\s?(\S{9,12})(.*)\n([\s\S]*)$/i - file.getBuffer((_err, buffer) => { - const subtitles = isAss ? buffer.toString() : [] - if (isAss) { - callback(subtitles) - } else { - const text = buffer.toString().replace(/\r/g, '') - for (const split of text.split('\n\n')) { - const match = split.match(regex) - if (match) { - match[1] = match[1].match(/.*[.,]\d{2}/)[0] - match[2] = match[2].match(/.*[.,]\d{2}/)[0] - if (match[1].length === 9) { - match[1] = '0:' + match[1] - } else { - if (match[1][0] === '0') { - match[1] = match[1].substring(1) - } - } - match[1].replace(',', '.') - if (match[2].length === 9) { - match[2] = '0:' + match[2] - } else { - if (match[2][0] === '0') { - match[2] = match[2].substring(1) - } - } - match[2].replace(',', '.') - const matches = match[4].match(/<[^>]+>/g) // create array of all tags - if (matches) { - matches.forEach(matched => { - if (/<\//.test(matched)) { // check if its a closing tag - match[4] = match[4].replace(matched, matched.replace('', '0}')) - } else { - match[4] = match[4].replace(matched, matched.replace('<', '{\\').replace('>', '1}')) - } - }) - } - subtitles.push('Dialogue: 0,' + match[1].replace(',', '.') + ',' + match[2].replace(',', '.') + ',Default,,0,0,0,,' + match[4]) - } - } - callback(subtitles) - } - }) - } - - findSubtitleFiles (targetFile) { - const path = targetFile.path.split(targetFile.name)[0] - // array of subtitle files that match video name, or all subtitle files when only 1 vid file - const subtitleFiles = targetFile._torrent.files.filter(file => { - return this.subtitleExtensions.some(ext => file.name.endsWith(ext)) && (this.videoFiles.length === 1 ? true : file.path.split(path).length === 2) - }) - if (subtitleFiles.length) { - this.createRadioElement(undefined, 'captions') - this.subtitleData.parsed = true - this.subtitleData.current = 0 - for (const [index, file] of subtitleFiles.entries()) { - const isAss = file.name.endsWith('.ass') || file.name.endsWith('.ssa') - const extension = /\.(\w+)$/ - const name = file.name.replace(targetFile.name, '') === file.name - ? file.name.replace(targetFile.name.replace(extension, ''), '').slice(0, -4).replace(/[,._-]/g, ' ').trim() - : file.name.replace(targetFile.name, '').slice(0, -4).replace(/[,._-]/g, ' ').trim() - const header = { - header: this.subtitleData.defaultHeader, - language: name, - number: index, - type: file.name.match(extension)[1] - } - this.subtitleData.headers.push(header) - this.subtitleData.tracks[index] = [] - this.createRadioElement(header, 'captions') - this.convertSubFile(file, isAss, subtitles => { - if (isAss) { - this.subtitleData.headers[index].header = subtitles - } else { - this.subtitleData.tracks[index] = subtitles - } - if (this.subtitleData.current === index) this.selectCaptions(this.subtitleData.current) - }) - this.initSubtitleRenderer() - } - } - } - - postDownload (skipFiles) { - this.emit('download-done', { file: this.currentFile }) - this.parseSubtitles(this.currentFile, skipFiles).then(() => { - if (this.generateThumbnails) { - this.finishThumbnails(this.video.src) - } - }) - } - - playTorrent (torrentID, opts = {}) { // TODO: clean this up - const handleTorrent = (torrent, opts) => { - torrent.on('noPeers', () => { - this.emit('no-peers', torrent) - }) - if (this.streamedDownload) { - torrent.files.forEach(file => file.deselect()) - torrent.deselect(0, torrent.pieces.length - 1, false) - } - this.videoFiles = torrent.files.filter(file => this.videoExtensions.some(ext => file.name.endsWith(ext))) - this.emit('video-files', { files: this.videoFiles, torrent: torrent }) - if (this.videoFiles.length > 1) { - torrent.files.forEach(file => file.deselect()) - } - if (this.videoFiles) { - this.buildVideo(torrent, opts) - } else { - this.emit('no-file', torrent) - this.cleanupTorrents() - } - } - document.location.hash = '#player' - this.cleanupVideo() - this.cleanupTorrents() - if (torrentID instanceof Object) { - handleTorrent(torrentID, opts) - } else if (this.get(torrentID)) { - handleTorrent(this.get(torrentID), opts) - } else { - this.add(torrentID, { - destroyStoreOnDestroy: this.destroyStore, - storeOpts: this.storeOpts, - storeCacheSlots: 0, - store: (hybrid_chunk_store__WEBPACK_IMPORTED_MODULE_2___default()), - announce: this.tracker.announce || [ - 'wss://tracker.openwebtorrent.com', - 'wss://spacetradersapi-chatbox.herokuapp.com:443/announce', - 'wss://peertube.cpy.re:443/tracker/socket' - ] - }, torrent => { - handleTorrent(torrent, opts) - }) - } - } - - // cleanup torrent and store - cleanupTorrents () { - // creates an array of all non-offline store torrents and removes them - this.torrents.filter(torrent => !this.offlineTorrents[torrent.infoHash]).forEach(torrent => torrent.destroy()) - } - - // add torrent for offline download - offlineDownload (torrentID) { - const torrent = this.add(torrentID, { - storeOpts: this.storeOpts, - store: (hybrid_chunk_store__WEBPACK_IMPORTED_MODULE_2___default()), - storeCacheSlots: 0, - announce: this.tracker.announce || [ - 'wss://tracker.openwebtorrent.com', - 'wss://spacetradersapi-chatbox.herokuapp.com:443/announce', - 'wss://peertube.cpy.re:443/tracker/socket' - ] - }) - torrent.on('metadata', () => { - if (!this.offlineTorrents[torrent.infoHash]) { - this.offlineTorrents[torrent.infoHash] = Array.from(torrent.torrentFile) - localStorage.setItem('offlineTorrents', JSON.stringify(this.offlineTorrents)) - } - this.emit('offline-torrent', torrent) - }) - } -} - - -/***/ }), - -/***/ "./node_modules/webtorrent-player/lib/peer.js": -/*!****************************************************!*\ - !*** ./node_modules/webtorrent-player/lib/peer.js ***! - \****************************************************/ -/***/ ((__unused_webpack_module, __webpack_exports__, __webpack_require__) => { - -"use strict"; -__webpack_require__.r(__webpack_exports__); -/* harmony export */ __webpack_require__.d(__webpack_exports__, { -/* harmony export */ "default": () => (/* binding */ Peer) -/* harmony export */ }); -function waitToCompleteIceGathering (pc, state = pc.iceGatheringState) { - return state !== 'complete' && new Promise(resolve => { - pc.addEventListener('icegatheringstatechange', () => (pc.iceGatheringState === 'complete') && resolve()) - }) -} - -/** - * @typedef {AddEventListenerOptions} Test~options - * @property {AbortSignal} signal - funkis? - */ - -class Peer { - /** - * @param {{ - * polite: boolean, - * trickle: boolean, - * iceServers: RTCIceServer[] - * signal: AbortSignal - * }} [options] - */ - constructor (options = {}) { - let { polite = true, trickle = true } = options - - let { port1, port2 } = new MessageChannel() - let send = msg => port2.postMessage(JSON.stringify(msg)) - - const pc = new RTCPeerConnection({ - iceServers: options?.iceServers || [{ - urls: [ - 'stun:stun.l.google.com:19302', - 'stun:global.stun.twilio.com:3478' - ] - }] - }) - - const ctrl = new AbortController() - - /** @type {any} dummy alias for AbortSignal to make TS happy */ - const signal = { signal: ctrl.signal } - - pc.addEventListener('iceconnectionstatechange', () => { - if ( - pc.iceConnectionState === 'disconnected' || - pc.iceConnectionState === 'failed' - ) { - ctrl.abort() - } - }, signal) - - const dc = pc.createDataChannel('both', { negotiated: true, id: 0 }) - - this.pc = pc - this.dc = dc - this.signal = ctrl.signal - this.polite = polite - this.signalingPort = port1 - - this.ready = new Promise(resolve => { - dc.addEventListener('open', () => { - // At this point we start to trickle over datachannel instead - // we also close the message channel as we do not need it anymore - trickle = true - send = (msg) => dc.send(JSON.stringify(msg)) - port1.close() - port2.close() - this.ready = port2 = port1 = port2.onmessage = null - resolve() - }, { once: true, ...signal }) - }) - - pc.addEventListener('icecandidate', ({ candidate }) => { - trickle && send({ candidate }) - }, { ...signal }) - - // The rest is the polite peer negotiation logic, copied from this blog - - let makingOffer = false; let ignoreOffer = false - - pc.addEventListener('negotiationneeded', async () => { - makingOffer = true - const offer = await pc.createOffer() - if (pc.signalingState !== 'stable') return - await pc.setLocalDescription(offer) - makingOffer = false - if (trickle) { - send({ description: pc.localDescription }) - } else { - await waitToCompleteIceGathering(pc) - const description = pc.localDescription.toJSON() - description.sdp = description.sdp.replace(/a=ice-options:trickle\s\n/g, '') - send({ description }) - } - }, { ...signal }) - - async function onmessage ({ data }) { - const { description, candidate } = typeof data === 'string' ? JSON.parse(data) : data - - if (description) { - const offerCollision = description.type === 'offer' && - (makingOffer || pc.signalingState !== 'stable') - - ignoreOffer = !this.polite && offerCollision - if (ignoreOffer) { - return - } - - if (offerCollision) { - await Promise.all([ - pc.setLocalDescription({ type: 'rollback' }), - pc.setRemoteDescription(description) - ]) - } else { - try { - (description.type === 'answer' && pc.signalingState === 'stable') || - await pc.setRemoteDescription(description) - } catch (err) { } - } - if (description.type === 'offer') { - await pc.setLocalDescription(await pc.createAnswer()) - // Edge didn't set the state to 'new' after calling the above :[ - if (!trickle) await waitToCompleteIceGathering(pc, 'new') - send({ description: pc.localDescription }) - } - } else if (candidate) { - await pc.addIceCandidate(candidate) - } - } - - port2.onmessage = onmessage.bind(this) - dc.addEventListener('message', onmessage.bind(this), { ...signal }) - } -} -window.Peer = Peer - - -/***/ }), - -/***/ "./node_modules/webtorrent-player/lib/subtitles-octopus.js": -/*!*****************************************************************!*\ - !*** ./node_modules/webtorrent-player/lib/subtitles-octopus.js ***! - \*****************************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -/* - author: Daodor, libass - license: MIT - - re-written by: ThaUnknown_ - license: GPL3 -*/ -class SubtitlesOctopus { - constructor (options = {}) { - if (!window.Worker) { - this.workerError('worker not supported') - return - } - // opts - this.canvas = options.canvas // HTML canvas element (optional if video specified) - - // choose best render mode based on browser support - this.renderMode = options.renderMode || 'offscreen' - if (this.renderMode !== 'blend' && this.renderMode !== 'normal') { - if (typeof createImageBitmap === 'undefined') { - this.renderMode = 'normal' - } else if (typeof OffscreenCanvas !== 'undefined') { - this.renderMode = 'offscreen' - } - } - - // play with those when you need some speed, e.g. for slow devices - this.targetFps = options.targetFps || 23.976 - this.prescaleTradeoff = options.prescaleTradeoff || null // render subtitles less than viewport when less than 1.0 to improve speed, render to more than 1.0 to improve quality; set to null to disable scaling - this.softHeightLimit = options.softHeightLimit || 1080 // don't apply prescaleTradeoff < 1 when viewport height is less that this limit - this.hardHeightLimit = options.hardHeightLimit || 2160 // don't ever go above this limit - this.resizeVariation = options.resizeVariation || 0.2 // by how many a size can vary before it would cause clearance of prerendered buffer - - this.video = options.video // HTML video element (optional if canvas specified) - this.canvasParent = null // (internal) HTML canvas parent element - this.onReadyEvent = options.onReady // Function called when SubtitlesOctopus is ready (optional) - this.onErrorEvent = options.onError // Function called in case of critical error meaning sub wouldn't be shown and you should use alternative method (for instance it occurs if browser doesn't support web workers). - this.debug = !!options.debug // When debug enabled, some performance info printed in console. - this.lastRenderTime = 0 // (internal) Last time we got some frame from worker - - this.timeOffset = options.timeOffset || 0 // Time offset would be applied to currentTime from video (option) - - this.renderedItems = [] // used to store items rendered ahead when renderAhead > 0 - // how many MiB to render ahead and store; 0 to disable (approximate) - this.renderAhead = (options.renderAhead || 0) * 1024 * 1024 * 0.9 // try to eat less than requested - this.oneshotState = { - eventStart: null, - eventOver: false, - iteration: 0, - renderRequested: false, - requestNextTimestamp: -1, - prevWidth: null, - prevHeight: null - } - - this.renderFrameData = null - this.workerActive = false - this.frameId = 0 - this.workerActive = false - - // init worker - if (!this.worker) { - this.worker = new Worker(options.workerUrl || 'subtitles-octopus-worker.js') - this.worker.onmessage = event => this.onWorkerMessage(event) - this.worker.onerror = event => this.workerError(event) - } - - this.createCanvas() - this.setVideo(options.video) - this.worker.postMessage({ - target: 'worker-init', - width: this.canvas.width, - height: this.canvas.height, - URL: document.URL, - currentScript: options.workerUrl || 'subtitles-octopus-worker.js', // Link to WebAssembly worker - preMain: true, - renderMode: this.renderMode, - subUrl: options.subUrl, // Link to sub file (optional if subContent specified) - subContent: options.subContent || null, // Sub content (optional if subUrl specified) - fallbackFont: options.fallbackFont || null, // Override fallback font, for example, with a CJK one. Default fallback font is Liberation Sans - lazyFontLoading: options.lazyFontLoading || false, // Load fonts in a lazy way. Requires Access-Control-Expose-Headers for Accept-Ranges, Content-Length, and Content-Encoding. If Content-Encoding is compressed, file will be fully fetched instead of just a HEAD request. - fonts: options.fonts || [], // Array with links to fonts used in sub (optional) - availableFonts: options.availableFonts || [], // Object with all available fonts (optional). Key is font name in lower case, value is link: {"arial": "/font1.ttf"} - debug: this.debug, - targetFps: this.targetFps, - libassMemoryLimit: options.libassMemoryLimit || 0, // set libass bitmap cache memory limit in MiB (approximate) - libassGlyphLimit: options.libassGlyphLimit || 0, // set libass glyph cache memory limit in MiB (approximate) - renderOnDemand: this.renderAhead > 0, - dropAllAnimations: !!options.dropAllAnimations - }) - if (this.renderMode === 'offscreen') this.pushOffscreenCanvas() - this.initDone = true - - // test ImageData constructor - ;(() => { - if (typeof ImageData.prototype.constructor === 'function') { - try { - // try actually calling ImageData, as on some browsers it's reported - // as existing but calling it errors out as "TypeError: Illegal constructor" - return new ImageData(new Uint8ClampedArray([0, 0, 0, 0]), 1, 1) - } catch (e) { - console.log('detected that ImageData is not constructable despite browser saying so') - } - } - - const canvas = document.createElement('canvas') - const ctx = canvas.getContext('2d') - - window.ImageData = () => { - let i = 0 - let data - if (arguments[0] instanceof Uint8ClampedArray) data = arguments[i++] - const width = arguments[i++] - const height = arguments[i] - - const imageData = ctx.createImageData(width, height) - if (data) imageData.data.set(data) - return imageData - } - })() - - // test alpha bug - if (this.renderMode !== 'offscreen') { - this.ctx = this.canvas.getContext('2d') - this.bufferCanvas = document.createElement('canvas') - this.bufferCanvasCtx = this.bufferCanvas.getContext('2d') - - // test for alpha bug, where e.g. WebKit can render a transparent pixel - // (with alpha == 0) as non-black which then leads to visual artifacts - this.bufferCanvas.width = 1 - this.bufferCanvas.height = 1 - const testBuf = new Uint8ClampedArray([0, 255, 0, 0]) - const testImage = new ImageData(testBuf, 1, 1) - this.bufferCanvasCtx.clearRect(0, 0, 1, 1) - this.ctx.clearRect(0, 0, 1, 1) - const prePut = this.ctx.getImageData(0, 0, 1, 1).data - this.bufferCanvasCtx.putImageData(testImage, 0, 0) - this.ctx.drawImage(this.bufferCanvas, 0, 0) - const postPut = this.ctx.getImageData(0, 0, 1, 1).data - this.hasAlphaBug = prePut[1] !== postPut[1] - if (this.hasAlphaBug) console.log('Detected a browser having issue with transparent pixels, applying workaround') - } - } - - workerError (error) { - console.error('Worker error: ', error) - if (this.onErrorEvent) this.onErrorEvent(error) - if (!this.debug) { - this.dispose() - throw new Error('Worker error: ' + error) - } - } - - pushOffscreenCanvas () { - const canvasControl = this.canvas.transferControlToOffscreen() - this.worker.postMessage({ - target: 'offscreenCanvas', - canvas: canvasControl - }, [canvasControl]) - } - - createCanvas () { - if (this.video) { - this.canvas = document.createElement('canvas') - this.canvas.className = 'subtitles-octopus-canvas' - this.canvas.style.display = 'none' - - this.canvasParent = document.createElement('div') - this.canvasParent.className = 'subtitles-octopus-canvas-parent' - this.canvasParent.appendChild(this.canvas) - - if (this.video.nextSibling) { - this.video.parentNode.insertBefore(this.canvasParent, this.video.nextSibling) - } else { - this.video.parentNode.appendChild(this.canvasParent) - } - } else { - if (!this.canvas) { - this.workerError('Don\'t know where to render: you should give video or canvas in options.') - } - } - } - - setVideo (video) { - this.video = video - if (this.video) { - let state = this.video.paused - const timeupdate = playing => { - if (playing != null) state = playing - this.setCurrentTime(this.video.paused || state, video.currentTime + this.timeOffset) - } - this.video.addEventListener('timeupdate', () => timeupdate(), false) - this.video.addEventListener('progress', () => timeupdate(), false) - - this.video.addEventListener('waiting', () => timeupdate(true), false) - this.video.addEventListener('pause', () => timeupdate(true), false) - this.video.addEventListener('seeking', () => timeupdate(true), false) - - this.video.addEventListener('playing', () => timeupdate(false), false) - - this.video.addEventListener('seeked', () => { - timeupdate(false) - if (this.renderAhead > 0) { - this._cleanPastRendered(this.video.currentTime + this.timeOffset, true) - } - }, false) - - this.video.addEventListener('ratechange', this.setRate.bind(this), false) - - // Support Element Resize Observer - if (typeof ResizeObserver !== 'undefined') { - this.ro = new ResizeObserver(this.resize.bind(this, 0, 0, 0, 0)) - this.ro.observe(this.video) - } - - if (this.video.videoWidth > 0) { - this.resize() - } else { - this.video.addEventListener('loadedmetadata', this.resize.bind(this, 0, 0, 0, 0), false) - } - } - } - - getVideoPosition () { - const videoRatio = this.video.videoWidth / this.video.videoHeight - const { offsetWidth, offsetHeight } = this.video - const elementRatio = offsetWidth / offsetHeight - let width = offsetWidth - let height = offsetHeight - if (elementRatio > videoRatio) { - width = Math.floor(offsetHeight * videoRatio) - } else { - height = Math.floor(offsetWidth / videoRatio) - } - - const x = (offsetWidth - width) / 2 - const y = (offsetHeight - height) / 2 - - return { width, height, x, y } - } - - _cleanPastRendered (currentTime, seekClean) { - let retainedItems = [] - for (const item of this.renderedItems) { - if (item.emptyFinish < 0 || item.emptyFinish >= currentTime) { - // item is not yet finished, retain it - retainedItems.push(item) - } - } - - if (seekClean && retainedItems.length > 0) { - // items are ordered by event start time when we push to this.renderedItems, - // so first item is the earliest - if (currentTime < retainedItems[0].eventStart) { - if (retainedItems[0].eventStart - currentTime > 60) { - console.info('seeked back too far, cleaning prerender buffer') - retainedItems = [] - } else { - console.info('seeked backwards, need to free up some buffer') - let size = 0; const limit = this.renderAhead * 0.3 /* try to take no more than 1/3 of buffer */ - const retain = [] - for (const item of retainedItems) { - size += item.size - if (size >= limit) break - retain.push(item) - } - retainedItems = retain - } - } - } - - const removed = retainedItems.length < this.renderedItems - this.renderedItems = retainedItems - return removed - } - - // Oneshot stuff - processOneshot (data) { - if (data.iteration !== this.oneshotState.iteration) { - console.debug('received stale prerender, ignoring') - return - } - - if (this.debug) { - console.info('oneshot received (start=' + - data.eventStart + ', empty=' + data.emptyFinish + - '), render: ' + Math.round(data.spentTime) + ' ms') - } - this.oneshotState.renderRequested = false - if (Math.abs(data.lastRenderedTime - this.oneshotState.requestNextTimestamp) < 0.01) { - this.oneshotState.requestNextTimestamp = -1 - } - if (data.eventStart - data.lastRenderedTime > 0.01) { - // generate bogus empty element, so all timeline is covered anyway - this.renderedItems.push({ - eventStart: data.lastRenderedTime, - eventFinish: data.lastRenderedTime - 0.001, - emptyFinish: data.eventStart, - viewport: data.viewport, - spentTime: 0, - blendTime: 0, - items: [], - animated: false, - size: 0 - }) - } - - const items = [] - let size = 0 - for (const item of data.canvases) { - items.push({ - ...item, - image: new ImageData(new Uint8ClampedArray(item.buffer), item.w, item.h) - }) - size += item.buffer.byteLength - } - - let eventSplitted = false - if ((data.emptyFinish > 0 && data.emptyFinish - data.eventStart < 1.0 / this.targetFps) || data.animated) { - const newFinish = data.eventStart + 1.0 / this.targetFps - data.emptyFinish = newFinish - data.eventFinish = newFinish - eventSplitted = true - } - this.renderedItems.push({ - ...data, - items: items, - size: size - }) - - this.renderedItems.sort((a, b) => a.eventStart - b.eventStart) - - if (this.oneshotState.requestNextTimestamp >= 0) { - // requesting an out of order event render - this.tryRequestOneshot(this.oneshotState.requestNextTimestamp, true) - } else if (data.eventStart < 0) { - console.info('oneshot received "end of frames" event') - } else if (data.emptyFinish >= 0) { - // there's some more event to render, try requesting next event - this.tryRequestOneshot(data.emptyFinish, eventSplitted) - } else { - console.info('there are no more events to prerender') - } - } - - tryRequestOneshot (currentTime, renderNow) { - if (!this.renderAhead || this.renderAhead <= 0) return - if (this.oneshotState.renderRequested && !renderNow) return - - if (typeof currentTime === 'undefined') { - if (!this.video) return - currentTime = this.video.currentTime + this.timeOffset - } - - let size = 0 - for (const item of this.renderedItems) { - if (item.emptyFinish < 0) { - console.info('oneshot already reached end-of-events') - return - } - if (currentTime >= item.eventStart && currentTime < item.emptyFinish) { - // an event for requested time already exists - console.debug('not requesting a render for ' + currentTime + - ' as event already covering it exists (start=' + - item.eventStart + ', empty=' + item.emptyFinish + ')') - return - } - size += item.size - } - - if (size <= this.renderAhead) { - const lastRendered = currentTime - (renderNow ? 0 : 0.001) - if (!this.oneshotState.renderRequested) { - this.oneshotState.renderRequested = true - this.worker.postMessage({ - target: 'oneshot-render', - lastRendered: lastRendered, - renderNow: renderNow, - iteration: this.oneshotState.iteration - }) - } else { - if (this.workerActive) console.info('worker busy, requesting to seek') - this.oneshotState.requestNextTimestamp = lastRendered - } - } - } - - _renderSubtitleEvent (event, currentTime) { - const eventOver = event.eventFinish < currentTime - if (this.oneshotState.eventStart === event.eventStart && this.oneshotState.eventOver === eventOver) return - this.oneshotState.eventStart = event.eventStart - this.oneshotState.eventOver = eventOver - - const beforeDrawTime = performance.now() - if (event.viewport.width !== this.canvas.width || event.viewport.height !== this.canvas.height) { - this.canvas.width = event.viewport.width - this.canvas.height = event.viewport.height - } - this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height) - if (!eventOver) { - for (const image of event.items) { - this.bufferCanvas.width = image.w - this.bufferCanvas.height = image.h - this.bufferCanvasCtx.putImageData(image.image, 0, 0) - this.ctx.drawImage(this.bufferCanvas, image.x, image.y) - } - } - if (this.debug) { - const drawTime = Math.round(performance.now() - beforeDrawTime) - console.log('render: ' + Math.round(event.spentTime - event.blendTime) + ' ms, blend: ' + Math.round(event.blendTime) + ' ms, draw: ' + drawTime + ' ms') - } - } - - oneshotRender () { - window.requestAnimationFrame(this.oneshotRender) - if (!this.video) return - - const currentTime = this.video.currentTime + this.timeOffset - let finishTime = -1; let eventShown = false; let animated = false - for (const item of this.renderedItems) { - if (!eventShown && item.eventStart <= currentTime && (item.emptyFinish < 0 || item.emptyFinish > currentTime)) { - this._renderSubtitleEvent(item, currentTime) - eventShown = true - finishTime = item.emptyFinish - } else if (finishTime >= 0) { - // we've already found a known event, now find - // the farthest point of consequent events - // NOTE: this.renderedItems may have gaps due to seeking - if (item.eventStart - finishTime < 0.01) { - finishTime = item.emptyFinish - animated = item.animated - } else { - break - } - } - } - - if (!eventShown) { - if (Math.abs(this.oneshotState.requestNextTimestamp - currentTime) > 0.01) { - this._cleanPastRendered(currentTime) - this.tryRequestOneshot(currentTime, true) - } - } else if (this._cleanPastRendered(currentTime) && finishTime >= 0) { - this.tryRequestOneshot(finishTime, animated) - } - } - - resetRenderAheadCache (isResizing) { - if (this.renderAhead > 0) { - const newCache = [] - if (isResizing && this.oneshotState.prevHeight && this.oneshotState.prevWidth) { - if (this.oneshotState.prevHeight === this.canvas.height && this.oneshotState.prevWidth === this.canvas.width) return - let timeLimit = 10; let sizeLimit = this.renderAhead * 0.3 - if (this.canvas.height >= this.oneshotState.prevHeight * (1.0 - this.resizeVariation) && - this.canvas.height <= this.oneshotState.prevHeight * (1.0 + this.resizeVariation) && - this.canvas.width >= this.oneshotState.prevWidth * (1.0 - this.resizeVariation) && - this.canvas.width <= this.oneshotState.prevWidth * (1.0 + this.resizeVariation)) { - console.debug('viewport changes are small, leaving more of prerendered buffer') - timeLimit = 30 - sizeLimit = this.renderAhead * 0.5 - } - const stopTime = this.video.currentTime + this.timeOffset + timeLimit - let size = 0 - for (const item of this.renderedItems) { - if (item.emptyFinish < 0 || item.emptyFinish >= stopTime) break - size += item.size - if (size >= sizeLimit) break - newCache.push(item) - } - } - - console.info('resetting prerender cache') - this.renderedItems = newCache - this.oneshotState.eventStart = null - this.oneshotState.iteration++ - this.oneshotState.renderRequested = false - this.oneshotState.prevHeight = this.canvas.height - this.oneshotState.prevWidth = this.canvas.width - - window.requestAnimationFrame(this.oneshotRender) - this.tryRequestOneshot(undefined, true) - } - } - - // Rendering - renderFrames (data) { - const beforeDrawTime = performance.now() - this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height) - for (const image of data.canvases) { - this.bufferCanvas.width = image.w - this.bufferCanvas.height = image.h - const imageBuffer = new Uint8ClampedArray(image.buffer) - if (this.hasAlphaBug) { - for (let j = 3; j < imageBuffer.length; j += 4) { - imageBuffer[j] = (imageBuffer[j] >= 1) ? imageBuffer[j] : 1 - } - } - const imageData = new ImageData(imageBuffer, image.w, image.h) - this.bufferCanvasCtx.putImageData(imageData, 0, 0) - this.ctx.drawImage(this.bufferCanvas, image.x, image.y) - } - if (this.debug) { - const drawTime = performance.now() - beforeDrawTime - const blendTime = data.blendTime - if (typeof blendTime !== 'undefined') { - console.log('render: ' + Math.round(data.spentTime - blendTime) + ' ms, blend: ' + Math.round(blendTime) + ' ms, draw: ' + drawTime + ' ms; TOTAL=' + Math.round(data.spentTime + drawTime) + ' ms') - } else { - console.log({ length: data.canvases.length, sum: data.libassTime + data.decodeTime + drawTime, libassTime: data.libassTime, decodeTime: data.decodeTime, drawTime }) - } - this.renderStart = performance.now() - } - } - - renderFastFrames (data) { - const beforeDrawTime = performance.now() - this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height) - for (const image of data.bitmaps) { - this.ctx.drawImage(image.bitmap, image.x, image.y) - } - if (this.debug) { - const drawTime = performance.now() - beforeDrawTime - console.log({ length: data.bitmaps.length, sum: data.libassTime + data.decodeTime + drawTime, libassTime: data.libassTime, decodeTime: data.decodeTime, drawTime }) - this.renderStart = performance.now() - } - } - - _computeCanvasSize (width, height) { - if (this.prescaleTradeoff === null) { - if (height > this.hardHeightLimit) { - width = width * this.hardHeightLimit / height - height = this.hardHeightLimit - } - } else if (this.prescaleTradeoff > 1) { - if (height * this.prescaleTradeoff <= this.softHeightLimit) { - width *= this.prescaleTradeoff - height *= this.prescaleTradeoff - } else if (height < this.softHeightLimit) { - width = width * this.softHeightLimit / height - height = this.softHeightLimit - } else if (height >= this.hardHeightLimit) { - width = width * this.hardHeightLimit / height - height = this.hardHeightLimit - } - } else if (height >= this.softHeightLimit) { - if (height * this.prescaleTradeoff <= this.softHeightLimit) { - width = width * this.softHeightLimit / height - height = this.softHeightLimit - } else if (height * this.prescaleTradeoff <= this.hardHeightLimit) { - width *= this.prescaleTradeoff - height *= this.prescaleTradeoff - } else { - width = width * this.hardHeightLimit / height - height = this.hardHeightLimit - } - } - - return { width, height } - } - - resize (width = 0, height = 0, top = 0, left = 0) { - let videoSize = null - if ((!width || !height) && this.video) { - videoSize = this.getVideoPosition() - const newsize = this._computeCanvasSize(videoSize.width * (window.devicePixelRatio || 1), videoSize.height * (window.devicePixelRatio || 1)) - width = newsize.width - height = newsize.height - const offset = this.canvasParent.getBoundingClientRect().top - this.video.getBoundingClientRect().top - top = videoSize.y - offset - left = videoSize.x - } - - if (this.canvas.style.top !== top || this.canvas.style.left !== left) { - if (videoSize != null) { - this.canvasParent.style.position = 'relative' - this.canvas.style.display = 'block' - this.canvas.style.position = 'absolute' - this.canvas.style.top = top + 'px' - this.canvas.style.left = left + 'px' - this.canvas.style.pointerEvents = 'none' - this.canvas.style.width = videoSize.width + 'px' - this.canvas.style.height = videoSize.height + 'px' - } - if (!(this.canvas.width === width && this.canvas.height === height)) { - // only re-paint if dimensions actually changed - if (this.renderMode === 'offscreen' && this.initDone) { - this.canvasParent.remove() - this.canvasParent = undefined - this.createCanvas() - } - // dont spam re-paints like crazy when re-sizing with animations, but still update instantly without them - if (this.resizeTimeoutBuffer) { - clearTimeout(this.resizeTimeoutBuffer) - this.resizeTimeoutBuffer = setTimeout(() => { - this.resizeTimeoutBuffer = undefined - this.rePaint(width, height, top, left, videoSize) - }, 50) - } else { - this.rePaint(width, height, top, left, videoSize) - this.resizeTimeoutBuffer = setTimeout(() => { - this.resizeTimeoutBuffer = undefined - }, 50) - } - } - } - } - - rePaint (width = 0, height = 0, top = 0, left = 0, videoSize) { - if (this.renderMode === 'offscreen' && this.canvasParent && this.initDone) { - this.canvasParent.remove() - this.canvasParent = undefined - this.createCanvas() - } - this.canvas.width = width - this.canvas.height = height - - if (videoSize != null) { - this.canvasParent.style.position = 'relative' - this.canvas.style.display = 'block' - this.canvas.style.position = 'absolute' - this.canvas.style.top = top + 'px' - this.canvas.style.left = left + 'px' - this.canvas.style.pointerEvents = 'none' - this.canvas.style.width = videoSize.width + 'px' - this.canvas.style.height = videoSize.height + 'px' - } - - if (this.renderMode === 'offscreen' && this.initDone) { - this.pushOffscreenCanvas() - } - this.worker.postMessage({ - target: 'canvas', - width: this.canvas.width, - height: this.canvas.height - }) - this.resetRenderAheadCache(true) - } - - onWorkerMessage (event) { - if (!this.workerActive) { - this.workerActive = true - if (this.onReadyEvent) { - this.onReadyEvent() - } - } - const data = event.data - switch (data.target) { - case 'stdout': { - console.log(data.content) - break - } - case 'stderr': { - console.error(data.content) - break - } - case 'canvas': { - switch (data.op) { - case 'renderCanvas': { - if (this.lastRenderTime < data.time) { - this.lastRenderTime = data.time - window.requestAnimationFrame(this.renderFrames.bind(this, data)) - } - break - } - case 'renderFastCanvas': { - if (this.lastRenderTime < data.time) { - this.lastRenderTime = data.time - window.requestAnimationFrame(this.renderFastFrames.bind(this, data)) - } - break - } - case 'oneshot-result': { - this.processOneshot(data) - break - } - default: - throw data.target - } - break - } - case 'tick': { - this.frameId = data.id - this.worker.postMessage({ - target: 'tock', - id: this.frameId - }) - break - } - case 'custom': { - if (this.onCustomMessage) { - this.onCustomMessage(event) - } else { - console.error('Custom message received but client onCustomMessage not implemented.') - } - break - } - case 'ready': { - break - } - default: - console.log(data) - break - } - } - - runBenchmark () { - this.worker.postMessage({ - target: 'runBenchmark' - }) - } - - customMessage (data, options = {}) { - this.worker.postMessage({ - target: 'custom', - userData: data, - preMain: options.preMain - }) - } - - setCurrentTime (isPaused, currentTime) { - this.worker.postMessage({ - target: 'video', - isPaused: isPaused, - currentTime: currentTime - }) - } - - setTrackByUrl (url) { - this.worker.postMessage({ - target: 'set-track-by-url', - url: url - }) - this.resetRenderAheadCache(false) - } - - setTrack (content) { - this.worker.postMessage({ - target: 'set-track', - content: content - }) - this.resetRenderAheadCache(false) - } - - freeTrack () { - this.worker.postMessage({ - target: 'free-track' - }) - this.resetRenderAheadCache(false) - } - - setRate () { - this.worker.postMessage({ - target: 'video', - rate: this.video.playbackRate - }) - } - - destroy () { - this.worker.postMessage({ - target: 'destroy' - }) - - this.worker.terminate() - this.workerActive = false - // Remove the canvas element to remove residual subtitles rendered on player - if (this.video) this.video.parentNode.removeChild(this.canvasParent) - } - - createEvent (event) { - this.worker.postMessage({ - target: 'create-event', - event: event - }) - } - - getEvents () { - this.worker.postMessage({ - target: 'get-events' - }) - } - - setEvent (event, index) { - this.worker.postMessage({ - target: 'set-event', - event: event, - index: index - }) - } - - removeEvent (index) { - this.worker.postMessage({ - target: 'remove-event', - index: index - }) - } - - createStyle (style) { - this.worker.postMessage({ - target: 'create-style', - style: style - }) - } - - getStyles () { - this.worker.postMessage({ - target: 'get-styles' - }) - } - - setStyle (style, index) { - this.worker.postMessage({ - target: 'set-style', - style: style, - index: index - }) - } - - removeStyle (index) { - this.worker.postMessage({ - target: 'remove-style', - index: index - }) - } -} - -if (true) { - module.exports = SubtitlesOctopus -} - - -/***/ }), - -/***/ "./node_modules/webtorrent/index.js": -/*!******************************************!*\ - !*** ./node_modules/webtorrent/index.js ***! - \******************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -/* provided dependency */ var console = __webpack_require__(/*! ./node_modules/console-browserify/index.js */ "./node_modules/console-browserify/index.js"); -/*! webtorrent. MIT License. WebTorrent LLC */ -/* global FileList, ServiceWorker */ -/* eslint-env browser */ - -const { EventEmitter } = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const concat = __webpack_require__(/*! simple-concat */ "./node_modules/simple-concat/index.js") -const createTorrent = __webpack_require__(/*! create-torrent */ "./node_modules/create-torrent/index.js") -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('webtorrent') -const DHT = __webpack_require__(/*! bittorrent-dht/client */ "?4b99") // browser exclude -const loadIPSet = __webpack_require__(/*! load-ip-set */ "?ae1e") // browser exclude -const parallel = __webpack_require__(/*! run-parallel */ "./node_modules/run-parallel/index.js") -const parseTorrent = __webpack_require__(/*! parse-torrent */ "./node_modules/parse-torrent/index.js") -const path = __webpack_require__(/*! path */ "./node_modules/path-browserify/index.js") -const Peer = __webpack_require__(/*! simple-peer */ "./node_modules/simple-peer/index.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") -const randombytes = __webpack_require__(/*! randombytes */ "./node_modules/randombytes/browser.js") -const sha1 = __webpack_require__(/*! simple-sha1 */ "./node_modules/simple-sha1/browser.js") -const speedometer = __webpack_require__(/*! speedometer */ "./node_modules/speedometer/index.js") -const { ThrottleGroup } = __webpack_require__(/*! speed-limiter */ "./node_modules/speed-limiter/index.js") - -const ConnPool = __webpack_require__(/*! ./lib/conn-pool */ "?6e41") // browser exclude -const Torrent = __webpack_require__(/*! ./lib/torrent */ "./node_modules/webtorrent/lib/torrent.js") -const VERSION = __webpack_require__(/*! ./package.json */ "./node_modules/webtorrent/package.json").version - -/** - * Version number in Azureus-style. Generated from major and minor semver version. - * For example: - * '0.16.1' -> '0016' - * '1.2.5' -> '0102' - */ -const VERSION_STR = VERSION - .replace(/\d*./g, v => `0${v % 100}`.slice(-2)) - .slice(0, 4) - -/** - * Version prefix string (used in peer ID). WebTorrent uses the Azureus-style - * encoding: '-', two characters for client id ('WW'), four ascii digits for version - * number, '-', followed by random numbers. - * For example: - * '-WW0102-'... - */ -const VERSION_PREFIX = `-WW${VERSION_STR}-` - -/** - * WebTorrent Client - * @param {Object=} opts - */ -class WebTorrent extends EventEmitter { - constructor (opts = {}) { - super() - - if (typeof opts.peerId === 'string') { - this.peerId = opts.peerId - } else if (Buffer.isBuffer(opts.peerId)) { - this.peerId = opts.peerId.toString('hex') - } else { - this.peerId = Buffer.from(VERSION_PREFIX + randombytes(9).toString('base64')).toString('hex') - } - this.peerIdBuffer = Buffer.from(this.peerId, 'hex') - - if (typeof opts.nodeId === 'string') { - this.nodeId = opts.nodeId - } else if (Buffer.isBuffer(opts.nodeId)) { - this.nodeId = opts.nodeId.toString('hex') - } else { - this.nodeId = randombytes(20).toString('hex') - } - this.nodeIdBuffer = Buffer.from(this.nodeId, 'hex') - - this._debugId = this.peerId.toString('hex').substring(0, 7) - - this.destroyed = false - this.listening = false - this.torrentPort = opts.torrentPort || 0 - this.dhtPort = opts.dhtPort || 0 - this.tracker = opts.tracker !== undefined ? opts.tracker : {} - this.lsd = opts.lsd !== false - this.torrents = [] - this.maxConns = Number(opts.maxConns) || 55 - this.utp = WebTorrent.UTP_SUPPORT && opts.utp !== false - - this._downloadLimit = Math.max((typeof opts.downloadLimit === 'number') ? opts.downloadLimit : -1, -1) - this._uploadLimit = Math.max((typeof opts.uploadLimit === 'number') ? opts.uploadLimit : -1, -1) - - this.serviceWorker = null - this.workerKeepAliveInterval = null - this.workerPortCount = 0 - - if (opts.secure === true) { - __webpack_require__(/*! ./lib/peer */ "./node_modules/webtorrent/lib/peer.js").enableSecure() - } - - this._debug( - 'new webtorrent (peerId %s, nodeId %s, port %s)', - this.peerId, this.nodeId, this.torrentPort - ) - - this.throttleGroups = { - down: new ThrottleGroup({ rate: Math.max(this._downloadLimit, 0), enabled: this._downloadLimit >= 0 }), - up: new ThrottleGroup({ rate: Math.max(this._uploadLimit, 0), enabled: this._uploadLimit >= 0 }) - } - - if (this.tracker) { - if (typeof this.tracker !== 'object') this.tracker = {} - if (globalThis.WRTC && !this.tracker.wrtc) this.tracker.wrtc = globalThis.WRTC - } - - if (typeof ConnPool === 'function') { - this._connPool = new ConnPool(this) - } else { - queueMicrotask(() => { - this._onListening() - }) - } - - // stats - this._downloadSpeed = speedometer() - this._uploadSpeed = speedometer() - - if (opts.dht !== false && typeof DHT === 'function' /* browser exclude */) { - // use a single DHT instance for all torrents, so the routing table can be reused - this.dht = new DHT(Object.assign({}, { nodeId: this.nodeId }, opts.dht)) - - this.dht.once('error', err => { - this._destroy(err) - }) - - this.dht.once('listening', () => { - const address = this.dht.address() - if (address) this.dhtPort = address.port - }) - - // Ignore warning when there are > 10 torrents in the client - this.dht.setMaxListeners(0) - - this.dht.listen(this.dhtPort) - } else { - this.dht = false - } - - // Enable or disable BEP19 (Web Seeds). Enabled by default: - this.enableWebSeeds = opts.webSeeds !== false - - const ready = () => { - if (this.destroyed) return - this.ready = true - this.emit('ready') - } - - if (typeof loadIPSet === 'function' && opts.blocklist != null) { - loadIPSet(opts.blocklist, { - headers: { - 'user-agent': `WebTorrent/${VERSION} (https://webtorrent.io)` - } - }, (err, ipSet) => { - if (err) return console.error(`Failed to load blocklist: ${err.message}`) - this.blocked = ipSet - ready() - }) - } else { - queueMicrotask(ready) - } - } - - /** - * Accepts an existing service worker registration [navigator.serviceWorker.controller] - * which must be activated, "creates" a file server for streamed file rendering to use. - * - * @param {ServiceWorker} controller - * @param {function=} cb - * @return {null} - */ - loadWorker (controller, cb = () => {}) { - if (!(controller instanceof ServiceWorker)) throw new Error('Invalid worker registration') - if (controller.state !== 'activated') throw new Error('Worker isn\'t activated') - const keepAliveTime = 20000 - - this.serviceWorker = controller - - navigator.serviceWorker.addEventListener('message', event => { - const { data } = event - if (!data.type || !data.type === 'webtorrent' || !data.url) return null - let [infoHash, ...filePath] = data.url.slice(data.url.indexOf(data.scope + 'webtorrent/') + 11 + data.scope.length).split('/') - filePath = decodeURI(filePath.join('/')) - if (!infoHash || !filePath) return null - - const [port] = event.ports - - const file = this.get(infoHash) && this.get(infoHash).files.find(file => file.path === filePath) - if (!file) return null - - const [response, stream, raw] = file._serve(data) - const asyncIterator = stream && stream[Symbol.asyncIterator]() - - const cleanup = () => { - port.onmessage = null - if (stream) stream.destroy() - if (raw) raw.destroy() - this.workerPortCount-- - if (!this.workerPortCount) { - clearInterval(this.workerKeepAliveInterval) - this.workerKeepAliveInterval = null - } - } - - port.onmessage = async msg => { - if (msg.data) { - let chunk - try { - chunk = (await asyncIterator.next()).value - } catch (e) { - // chunk is yet to be downloaded or it somehow failed, should this be logged? - } - port.postMessage(chunk) - if (!chunk) cleanup() - if (!this.workerKeepAliveInterval) this.workerKeepAliveInterval = setInterval(() => fetch(`${this.serviceWorker.scriptURL.substr(0, this.serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length)}webtorrent/keepalive/`), keepAliveTime) - } else { - cleanup() - } - } - this.workerPortCount++ - port.postMessage(response) - }) - cb(this.serviceWorker) - } - - get downloadSpeed () { return this._downloadSpeed() } - - get uploadSpeed () { return this._uploadSpeed() } - - get progress () { - const torrents = this.torrents.filter(torrent => torrent.progress !== 1) - const downloaded = torrents.reduce((total, torrent) => total + torrent.downloaded, 0) - const length = torrents.reduce((total, torrent) => total + (torrent.length || 0), 0) || 1 - return downloaded / length - } - - get ratio () { - const uploaded = this.torrents.reduce((total, torrent) => total + torrent.uploaded, 0) - const received = this.torrents.reduce((total, torrent) => total + torrent.received, 0) || 1 - return uploaded / received - } - - /** - * Returns the torrent with the given `torrentId`. Convenience method. Easier than - * searching through the `client.torrents` array. Returns `null` if no matching torrent - * found. - * - * @param {string|Buffer|Object|Torrent} torrentId - * @return {Torrent|null} - */ - get (torrentId) { - if (torrentId instanceof Torrent) { - if (this.torrents.includes(torrentId)) return torrentId - } else { - let parsed - try { parsed = parseTorrent(torrentId) } catch (err) {} - - if (!parsed) return null - if (!parsed.infoHash) throw new Error('Invalid torrent identifier') - - for (const torrent of this.torrents) { - if (torrent.infoHash === parsed.infoHash) return torrent - } - } - return null - } - - /** - * Start downloading a new torrent. Aliased as `client.download`. - * @param {string|Buffer|Object} torrentId - * @param {Object} opts torrent-specific options - * @param {function=} ontorrent called when the torrent is ready (has metadata) - */ - add (torrentId, opts = {}, ontorrent = () => {}) { - if (this.destroyed) throw new Error('client is destroyed') - if (typeof opts === 'function') [opts, ontorrent] = [{}, opts] - - const onInfoHash = () => { - if (this.destroyed) return - for (const t of this.torrents) { - if (t.infoHash === torrent.infoHash && t !== torrent) { - torrent._destroy(new Error(`Cannot add duplicate torrent ${torrent.infoHash}`)) - return - } - } - } - - const onReady = () => { - if (this.destroyed) return - ontorrent(torrent) - this.emit('torrent', torrent) - } - - function onClose () { - torrent.removeListener('_infoHash', onInfoHash) - torrent.removeListener('ready', onReady) - torrent.removeListener('close', onClose) - } - - this._debug('add') - opts = opts ? Object.assign({}, opts) : {} - - const torrent = new Torrent(torrentId, this, opts) - this.torrents.push(torrent) - - torrent.once('_infoHash', onInfoHash) - torrent.once('ready', onReady) - torrent.once('close', onClose) - - return torrent - } - - /** - * Start seeding a new file/folder. - * @param {string|File|FileList|Buffer|Array.} input - * @param {Object=} opts - * @param {function=} onseed called when torrent is seeding - */ - seed (input, opts, onseed) { - if (this.destroyed) throw new Error('client is destroyed') - if (typeof opts === 'function') [opts, onseed] = [{}, opts] - - this._debug('seed') - opts = opts ? Object.assign({}, opts) : {} - - // no need to verify the hashes we create - opts.skipVerify = true - - const isFilePath = typeof input === 'string' - - // When seeding from fs path, initialize store from that path to avoid a copy - if (isFilePath) opts.path = path.dirname(input) - if (!opts.createdBy) opts.createdBy = `WebTorrent/${VERSION_STR}` - - const onTorrent = torrent => { - const tasks = [ - cb => { - // when a filesystem path is specified or the store is preloaded, files are already in the FS store - if (isFilePath || opts.preloadedStore) return cb() - torrent.load(streams, cb) - } - ] - if (this.dht) { - tasks.push(cb => { - torrent.once('dhtAnnounce', cb) - }) - } - parallel(tasks, err => { - if (this.destroyed) return - if (err) return torrent._destroy(err) - _onseed(torrent) - }) - } - - const _onseed = torrent => { - this._debug('on seed') - if (typeof onseed === 'function') onseed(torrent) - torrent.emit('seed') - this.emit('seed', torrent) - } - - const torrent = this.add(null, opts, onTorrent) - let streams - - if (isFileList(input)) input = Array.from(input) - else if (!Array.isArray(input)) input = [input] - - parallel(input.map(item => cb => { - if (!opts.preloadedStore && isReadable(item)) { - concat(item, (err, buf) => { - if (err) return cb(err) - buf.name = item.name - cb(null, buf) - }) - } else { - cb(null, item) - } - }), (err, input) => { - if (this.destroyed) return - if (err) return torrent._destroy(err) - - createTorrent.parseInput(input, opts, (err, files) => { - if (this.destroyed) return - if (err) return torrent._destroy(err) - - streams = files.map(file => file.getStream) - - createTorrent(input, opts, (err, torrentBuf) => { - if (this.destroyed) return - if (err) return torrent._destroy(err) - - const existingTorrent = this.get(torrentBuf) - if (existingTorrent) { - torrent._destroy(new Error(`Cannot add duplicate torrent ${existingTorrent.infoHash}`)) - } else { - torrent._onTorrentId(torrentBuf) - } - }) - }) - }) - - return torrent - } - - /** - * Remove a torrent from the client. - * @param {string|Buffer|Torrent} torrentId - * @param {function} cb - */ - remove (torrentId, opts, cb) { - if (typeof opts === 'function') return this.remove(torrentId, null, opts) - - this._debug('remove') - const torrent = this.get(torrentId) - if (!torrent) throw new Error(`No torrent with id ${torrentId}`) - this._remove(torrentId, opts, cb) - } - - _remove (torrentId, opts, cb) { - if (typeof opts === 'function') return this._remove(torrentId, null, opts) - - const torrent = this.get(torrentId) - if (!torrent) return - this.torrents.splice(this.torrents.indexOf(torrent), 1) - torrent.destroy(opts, cb) - } - - address () { - if (!this.listening) return null - return this._connPool - ? this._connPool.tcpServer.address() - : { address: '0.0.0.0', family: 'IPv4', port: 0 } - } - - /** - * Set global download throttle rate. - * @param {Number} rate (must be bigger or equal than zero, or -1 to disable throttling) - */ - throttleDownload (rate) { - rate = Number(rate) - if (isNaN(rate) || !isFinite(rate) || rate < -1) return false - this._downloadLimit = rate - if (this._downloadLimit < 0) return this.throttleGroups.down.setEnabled(false) - this.throttleGroups.down.setEnabled(true) - this.throttleGroups.down.setRate(this._downloadLimit) - } - - /** - * Set global upload throttle rate - * @param {Number} rate (must be bigger or equal than zero, or -1 to disable throttling) - */ - throttleUpload (rate) { - rate = Number(rate) - if (isNaN(rate) || !isFinite(rate) || rate < -1) return false - this._uploadLimit = rate - if (this._uploadLimit < 0) return this.throttleGroups.up.setEnabled(false) - this.throttleGroups.up.setEnabled(true) - this.throttleGroups.up.setRate(this._uploadLimit) - } - - /** - * Destroy the client, including all torrents and connections to peers. - * @param {function} cb - */ - destroy (cb) { - if (this.destroyed) throw new Error('client already destroyed') - this._destroy(null, cb) - } - - _destroy (err, cb) { - this._debug('client destroy') - this.destroyed = true - - const tasks = this.torrents.map(torrent => cb => { - torrent.destroy(cb) - }) - - if (this._connPool) { - tasks.push(cb => { - this._connPool.destroy(cb) - }) - } - - if (this.dht) { - tasks.push(cb => { - this.dht.destroy(cb) - }) - } - - parallel(tasks, cb) - - if (err) this.emit('error', err) - - this.torrents = [] - this._connPool = null - this.dht = null - - this.throttleGroups.down.destroy() - this.throttleGroups.up.destroy() - } - - _onListening () { - this._debug('listening') - this.listening = true - - if (this._connPool) { - // Sometimes server.address() returns `null` in Docker. - const address = this._connPool.tcpServer.address() - if (address) this.torrentPort = address.port - } - - this.emit('listening') - } - - _debug () { - const args = [].slice.call(arguments) - args[0] = `[${this._debugId}] ${args[0]}` - debug(...args) - } - - _getByHash (infoHashHash) { - for (const torrent of this.torrents) { - if (!torrent.infoHashHash) { - torrent.infoHashHash = sha1.sync(Buffer.from('72657132' /* 'req2' */ + torrent.infoHash, 'hex')) - } - if (infoHashHash === torrent.infoHashHash) { - return torrent - } - } - - return null - } -} - -WebTorrent.WEBRTC_SUPPORT = Peer.WEBRTC_SUPPORT -WebTorrent.UTP_SUPPORT = ConnPool.UTP_SUPPORT -WebTorrent.VERSION = VERSION - -/** - * Check if `obj` is a node Readable stream - * @param {*} obj - * @return {boolean} - */ -function isReadable (obj) { - return typeof obj === 'object' && obj != null && typeof obj.pipe === 'function' -} - -/** - * Check if `obj` is a W3C `FileList` object - * @param {*} obj - * @return {boolean} - */ -function isFileList (obj) { - return typeof FileList !== 'undefined' && obj instanceof FileList -} - -module.exports = WebTorrent - - -/***/ }), - -/***/ "./node_modules/webtorrent/lib/file-stream.js": -/*!****************************************************!*\ - !*** ./node_modules/webtorrent/lib/file-stream.js ***! - \****************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('webtorrent:file-stream') -const stream = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -const eos = __webpack_require__(/*! end-of-stream */ "./node_modules/end-of-stream/index.js") - -/** - * Readable stream of a torrent file - * - * @param {File} file - * @param {Object} opts - * @param {number} opts.start stream slice of file, starting from this byte (inclusive) - * @param {number} opts.end stream slice of file, ending with this byte (inclusive) - */ -class FileStream extends stream.Readable { - constructor (file, opts) { - super(opts) - - this._torrent = file._torrent - - const start = (opts && opts.start) || 0 - const end = (opts && opts.end && opts.end < file.length) - ? opts.end - : file.length - 1 - - const pieceLength = file._torrent.pieceLength - - this._startPiece = (start + file.offset) / pieceLength | 0 - this._endPiece = (end + file.offset) / pieceLength | 0 - - this._piece = this._startPiece - this._offset = (start + file.offset) - (this._startPiece * pieceLength) - - this._missing = end - start + 1 - this._reading = false - this._notifying = false - this._criticalLength = Math.min((1024 * 1024 / pieceLength) | 0, 2) - - this._torrent.select(this._startPiece, this._endPiece, true, () => { - this._notify() - }) - - // Ensure that cleanup happens even if destroy() is never called (readable-stream v3 currently doesn't call it automaticallly) - eos(this, (err) => { - this.destroy(err) - }) - } - - _read () { - if (this._reading) return - this._reading = true - this._notify() - } - - _notify () { - if (!this._reading || this._missing === 0) return - if (!this._torrent.bitfield.get(this._piece)) { - return this._torrent.critical(this._piece, this._piece + this._criticalLength) - } - - if (this._notifying) return - this._notifying = true - - if (this._torrent.destroyed) return this.destroy(new Error('Torrent removed')) - - const p = this._piece - - const getOpts = {} - // Specify length for the last piece in case it is zero-padded - if (p === this._torrent.pieces.length - 1) { - getOpts.length = this._torrent.lastPieceLength - } - this._torrent.store.get(p, getOpts, (err, buffer) => { - this._notifying = false - if (this.destroyed) return - debug('read %s (length %s) (err %s)', p, buffer && buffer.length, err && err.message) - - if (err) return this.destroy(err) - - if (this._offset) { - buffer = buffer.slice(this._offset) - this._offset = 0 - } - - if (this._missing < buffer.length) { - buffer = buffer.slice(0, this._missing) - } - this._missing -= buffer.length - - debug('pushing buffer of length %s', buffer.length) - this._reading = false - this.push(buffer) - - if (this._missing === 0) this.push(null) - }) - this._piece += 1 - } - - _destroy (err, cb) { - if (!this._torrent.destroyed) { - this._torrent.deselect(this._startPiece, this._endPiece, true) - } - cb(err) - } -} - -module.exports = FileStream - - -/***/ }), - -/***/ "./node_modules/webtorrent/lib/file.js": -/*!*********************************************!*\ - !*** ./node_modules/webtorrent/lib/file.js ***! - \*********************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -const { EventEmitter } = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const { PassThrough } = __webpack_require__(/*! readable-stream */ "./node_modules/readable-stream/readable-browser.js") -const path = __webpack_require__(/*! path */ "./node_modules/path-browserify/index.js") -const render = __webpack_require__(/*! render-media */ "./node_modules/render-media/index.js") -const streamToBlob = __webpack_require__(/*! stream-to-blob */ "./node_modules/stream-to-blob/index.js") -const streamToBlobURL = __webpack_require__(/*! stream-to-blob-url */ "./node_modules/stream-to-blob-url/index.js") -const streamToBuffer = __webpack_require__(/*! stream-with-known-length-to-buffer */ "./node_modules/stream-with-known-length-to-buffer/index.js") -const FileStream = __webpack_require__(/*! ./file-stream */ "./node_modules/webtorrent/lib/file-stream.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") -const rangeParser = __webpack_require__(/*! range-parser */ "./node_modules/range-parser/index.js") -const mime = __webpack_require__(/*! mime */ "./node_modules/mime/index.js") -const eos = __webpack_require__(/*! end-of-stream */ "./node_modules/end-of-stream/index.js") - -class File extends EventEmitter { - constructor (torrent, file) { - super() - - this._torrent = torrent - this._destroyed = false - this._fileStreams = new Set() - - this.name = file.name - this.path = file.path - this.length = file.length - this.offset = file.offset - - this.done = false - - const start = file.offset - const end = start + file.length - 1 - - this._startPiece = start / this._torrent.pieceLength | 0 - this._endPiece = end / this._torrent.pieceLength | 0 - - if (this.length === 0) { - this.done = true - this.emit('done') - } - - this._serviceWorker = torrent.client.serviceWorker - } - - get downloaded () { - if (this._destroyed || !this._torrent.bitfield) return 0 - - const { pieces, bitfield, pieceLength, lastPieceLength } = this._torrent - const { _startPiece: start, _endPiece: end } = this - - const getPieceLength = (pieceIndex) => ( - pieceIndex === pieces.length - 1 ? lastPieceLength : pieceLength - ) - - const getPieceDownloaded = (pieceIndex) => { - const len = pieceIndex === pieces.length - 1 ? lastPieceLength : pieceLength - if (bitfield.get(pieceIndex)) { - // verified data - return len - } else { - // "in progress" data - return len - pieces[pieceIndex].missing - } - } - - let downloaded = 0 - for (let index = start; index <= end; index += 1) { - const pieceDownloaded = getPieceDownloaded(index) - downloaded += pieceDownloaded - - if (index === start) { - // First piece may have an offset, e.g. irrelevant bytes from the end of - // the previous file - const irrelevantFirstPieceBytes = this.offset % pieceLength - downloaded -= Math.min(irrelevantFirstPieceBytes, pieceDownloaded) - } - - if (index === end) { - // Last piece may have an offset, e.g. irrelevant bytes from the start - // of the next file - const irrelevantLastPieceBytes = getPieceLength(end) - (this.offset + this.length) % pieceLength - downloaded -= Math.min(irrelevantLastPieceBytes, pieceDownloaded) - } - } - - return downloaded - } - - get progress () { - return this.length ? this.downloaded / this.length : 0 - } - - select (priority) { - if (this.length === 0) return - this._torrent.select(this._startPiece, this._endPiece, priority) - } - - deselect () { - if (this.length === 0) return - this._torrent.deselect(this._startPiece, this._endPiece, false) - } - - createReadStream (opts) { - if (this.length === 0) { - const empty = new PassThrough() - queueMicrotask(() => { - empty.end() - }) - return empty - } - - const fileStream = new FileStream(this, opts) - - this._fileStreams.add(fileStream) - fileStream.once('close', () => { - this._fileStreams.delete(fileStream) - }) - - return fileStream - } - - getBuffer (cb) { - streamToBuffer(this.createReadStream(), this.length, cb) - } - - getBlob (cb) { - if (typeof window === 'undefined') throw new Error('browser-only method') - streamToBlob(this.createReadStream(), this._getMimeType()) - .then( - blob => cb(null, blob), - err => cb(err) - ) - } - - getBlobURL (cb) { - if (typeof window === 'undefined') throw new Error('browser-only method') - streamToBlobURL(this.createReadStream(), this._getMimeType()) - .then( - blobUrl => cb(null, blobUrl), - err => cb(err) - ) - } - - appendTo (elem, opts, cb) { - if (typeof window === 'undefined') throw new Error('browser-only method') - render.append(this, elem, opts, cb) - } - - renderTo (elem, opts, cb) { - if (typeof window === 'undefined') throw new Error('browser-only method') - render.render(this, elem, opts, cb) - } - - _serve (req) { - const res = { - status: 200, - headers: { - // Support range-requests - 'Accept-Ranges': 'bytes', - 'Content-Type': mime.getType(this.name), - 'Cache-Control': 'no-cache, no-store, must-revalidate, max-age=0', - Expires: '0' - }, - body: req.method === 'HEAD' ? '' : 'STREAM' - } - // force the browser to download the file if if it's opened in a new tab - if (req.destination === 'document') { - res.headers['Content-Type'] = 'application/octet-stream' - res.headers['Content-Disposition'] = 'attachment' - res.body = 'DOWNLOAD' - } - - // `rangeParser` returns an array of ranges, or an error code (number) if - // there was an error parsing the range. - let range = rangeParser(this.length, req.headers.range || '') - - if (range.constructor === Array) { - res.status = 206 // indicates that range-request was understood - - // no support for multi-range request, just use the first range - range = range[0] - - res.headers['Content-Range'] = `bytes ${range.start}-${range.end}/${this.length}` - res.headers['Content-Length'] = `${range.end - range.start + 1}` - } else { - res.headers['Content-Length'] = this.length - } - - const stream = req.method === 'GET' && this.createReadStream(range) - - let pipe = null - if (stream) { - this.emit('stream', { stream, req, file: this }, piped => { - pipe = piped - - // piped stream might not close the original filestream on close/error, this is agressive but necessary - eos(piped, () => { - if (piped) piped.destroy() - stream.destroy() - }) - }) - } - - return [res, pipe || stream, pipe && stream] - } - - getStreamURL (cb = () => {}) { - if (typeof window === 'undefined') throw new Error('browser-only method') - if (!this._serviceWorker) throw new Error('No worker registered') - if (this._serviceWorker.state !== 'activated') throw new Error('Worker isn\'t activated') - const workerPath = this._serviceWorker.scriptURL.substr(0, this._serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length) - const url = `${workerPath}webtorrent/${this._torrent.infoHash}/${encodeURI(this.path)}` - cb(null, url) - } - - streamTo (elem, cb = () => {}) { - if (typeof window === 'undefined') throw new Error('browser-only method') - if (!this._serviceWorker) throw new Error('No worker registered') - if (this._serviceWorker.state !== 'activated') throw new Error('Worker isn\'t activated') - const workerPath = this._serviceWorker.scriptURL.substr(0, this._serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length) - elem.src = `${workerPath}webtorrent/${this._torrent.infoHash}/${encodeURI(this.path)}` - cb(null, elem) - } - - _getMimeType () { - return render.mime[path.extname(this.name).toLowerCase()] - } - - _destroy () { - this._destroyed = true - this._torrent = null - - for (const fileStream of this._fileStreams) { - fileStream.destroy() - } - this._fileStreams.clear() - } -} - -module.exports = File - - -/***/ }), - -/***/ "./node_modules/webtorrent/lib/peer.js": -/*!*********************************************!*\ - !*** ./node_modules/webtorrent/lib/peer.js ***! - \*********************************************/ -/***/ ((__unused_webpack_module, exports, __webpack_require__) => { - -const { EventEmitter } = __webpack_require__(/*! events */ "./node_modules/events/events.js") -const { Transform } = __webpack_require__(/*! stream */ "./node_modules/stream-browserify/index.js") -const arrayRemove = __webpack_require__(/*! unordered-array-remove */ "./node_modules/unordered-array-remove/index.js") -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('webtorrent:peer') -const Wire = __webpack_require__(/*! bittorrent-protocol */ "./node_modules/bittorrent-protocol/index.js") - -const CONNECT_TIMEOUT_TCP = 5000 -const CONNECT_TIMEOUT_UTP = 5000 -const CONNECT_TIMEOUT_WEBRTC = 25000 -const HANDSHAKE_TIMEOUT = 25000 - -let secure = false - -exports.enableSecure = () => { - secure = true -} - -/** - * WebRTC peer connections start out connected, because WebRTC peers require an - * "introduction" (i.e. WebRTC signaling), and there's no equivalent to an IP address - * that lets you refer to a WebRTC endpoint. - */ -exports.createWebRTCPeer = (conn, swarm, throttleGroups) => { - const peer = new Peer(conn.id, 'webrtc') - peer.conn = conn - peer.swarm = swarm - peer.throttleGroups = throttleGroups - - if (peer.conn.connected) { - peer.onConnect() - } else { - const cleanup = () => { - peer.conn.removeListener('connect', onConnect) - peer.conn.removeListener('error', onError) - } - const onConnect = () => { - cleanup() - peer.onConnect() - } - const onError = err => { - cleanup() - peer.destroy(err) - } - peer.conn.once('connect', onConnect) - peer.conn.once('error', onError) - peer.startConnectTimeout() - } - - return peer -} - -/** - * Incoming TCP peers start out connected, because the remote peer connected to the - * listening port of the TCP server. Until the remote peer sends a handshake, we don't - * know what swarm the connection is intended for. - */ -exports.createTCPIncomingPeer = (conn, throttleGroups) => { - return _createIncomingPeer(conn, 'tcpIncoming', throttleGroups) -} - -/** - * Incoming uTP peers start out connected, because the remote peer connected to the - * listening port of the uTP server. Until the remote peer sends a handshake, we don't - * know what swarm the connection is intended for. - */ -exports.createUTPIncomingPeer = (conn, throttleGroups) => { - return _createIncomingPeer(conn, 'utpIncoming', throttleGroups) -} - -/** - * Outgoing TCP peers start out with just an IP address. At some point (when there is an - * available connection), the client can attempt to connect to the address. - */ -exports.createTCPOutgoingPeer = (addr, swarm, throttleGroups) => { - return _createOutgoingPeer(addr, swarm, 'tcpOutgoing', throttleGroups) -} - -/** - * Outgoing uTP peers start out with just an IP address. At some point (when there is an - * available connection), the client can attempt to connect to the address. - */ -exports.createUTPOutgoingPeer = (addr, swarm, throttleGroups) => { - return _createOutgoingPeer(addr, swarm, 'utpOutgoing', throttleGroups) -} - -const _createIncomingPeer = (conn, type, throttleGroups) => { - const addr = `${conn.remoteAddress}:${conn.remotePort}` - const peer = new Peer(addr, type) - peer.conn = conn - peer.addr = addr - peer.throttleGroups = throttleGroups - - peer.onConnect() - - return peer -} - -const _createOutgoingPeer = (addr, swarm, type, throttleGroups) => { - const peer = new Peer(addr, type) - peer.addr = addr - peer.swarm = swarm - peer.throttleGroups = throttleGroups - - return peer -} - -/** - * Peer that represents a Web Seed (BEP17 / BEP19). - */ -exports.createWebSeedPeer = (conn, id, swarm, throttleGroups) => { - const peer = new Peer(id, 'webSeed') - peer.swarm = swarm - peer.conn = conn - peer.throttleGroups = throttleGroups - - peer.onConnect() - - return peer -} - -/** - * Peer. Represents a peer in the torrent swarm. - * - * @param {string} id "ip:port" string, peer id (for WebRTC peers), or url (for Web Seeds) - * @param {string} type the type of the peer - */ -class Peer extends EventEmitter { - constructor (id, type) { - super() - - this.id = id - this.type = type - - debug('new %s Peer %s', type, id) - - this.addr = null - this.conn = null - this.swarm = null - this.wire = null - - this.connected = false - this.destroyed = false - this.timeout = null // handshake timeout - this.retries = 0 // outgoing TCP connection retry count - - this.sentPe1 = false - this.sentPe2 = false - this.sentPe3 = false - this.sentPe4 = false - this.sentHandshake = false - } - - /** - * Called once the peer is connected (i.e. fired 'connect' event) - * @param {Socket} conn - */ - onConnect () { - if (this.destroyed) return - this.connected = true - - debug('Peer %s connected', this.id) - - clearTimeout(this.connectTimeout) - - const conn = this.conn - conn.once('end', () => { - this.destroy() - }) - conn.once('close', () => { - this.destroy() - }) - conn.once('finish', () => { - this.destroy() - }) - conn.once('error', err => { - this.destroy(err) - }) - - const wire = this.wire = new Wire(this.type, this.retries, secure) - - wire.once('end', () => { - this.destroy() - }) - wire.once('close', () => { - this.destroy() - }) - wire.once('finish', () => { - this.destroy() - }) - wire.once('error', err => { - this.destroy(err) - }) - - wire.once('pe1', () => { - this.onPe1() - }) - wire.once('pe2', () => { - this.onPe2() - }) - wire.once('pe3', () => { - this.onPe3() - }) - wire.once('pe4', () => { - this.onPe4() - }) - wire.once('handshake', (infoHash, peerId) => { - this.onHandshake(infoHash, peerId) - }) - this.startHandshakeTimeout() - - this.setThrottlePipes() - - if (this.swarm) { - if (this.type === 'tcpOutgoing') { - if (secure && this.retries === 0 && !this.sentPe1) this.sendPe1() - else if (!this.sentHandshake) this.handshake() - } else if (this.type !== 'tcpIncoming' && !this.sentHandshake) this.handshake() - } - } - - sendPe1 () { - this.wire.sendPe1() - this.sentPe1 = true - } - - onPe1 () { - this.sendPe2() - } - - sendPe2 () { - this.wire.sendPe2() - this.sentPe2 = true - } - - onPe2 () { - this.sendPe3() - } - - sendPe3 () { - this.wire.sendPe3(this.swarm.infoHash) - this.sentPe3 = true - } - - onPe3 (infoHashHash) { - if (this.swarm) { - if (this.swarm.infoHashHash !== infoHashHash) { - this.destroy(new Error('unexpected crypto handshake info hash for this swarm')) - } - this.sendPe4() - } - } - - sendPe4 () { - this.wire.sendPe4(this.swarm.infoHash) - this.sentPe4 = true - } - - onPe4 () { - if (!this.sentHandshake) this.handshake() - } - - clearPipes () { - this.conn.unpipe() - this.wire.unpipe() - } - - setThrottlePipes () { - const self = this - this.conn - .pipe(this.throttleGroups.down.throttle()) - .pipe(new Transform({ - transform (chunk, _, callback) { - self.emit('download', chunk.length) - if (self.destroyed) return - callback(null, chunk) - } - })) - .pipe(this.wire) - .pipe(this.throttleGroups.up.throttle()) - .pipe(new Transform({ - transform (chunk, _, callback) { - self.emit('upload', chunk.length) - if (self.destroyed) return - callback(null, chunk) - } - })) - .pipe(this.conn) - } - - /** - * Called when handshake is received from remote peer. - * @param {string} infoHash - * @param {string} peerId - */ - onHandshake (infoHash, peerId) { - if (!this.swarm) return // `this.swarm` not set yet, so do nothing - if (this.destroyed) return - - if (this.swarm.destroyed) { - return this.destroy(new Error('swarm already destroyed')) - } - if (infoHash !== this.swarm.infoHash) { - return this.destroy(new Error('unexpected handshake info hash for this swarm')) - } - if (peerId === this.swarm.peerId) { - return this.destroy(new Error('refusing to connect to ourselves')) - } - - debug('Peer %s got handshake %s', this.id, infoHash) - - clearTimeout(this.handshakeTimeout) - - this.retries = 0 - - let addr = this.addr - if (!addr && this.conn.remoteAddress && this.conn.remotePort) { - addr = `${this.conn.remoteAddress}:${this.conn.remotePort}` - } - this.swarm._onWire(this.wire, addr) - - // swarm could be destroyed in user's 'wire' event handler - if (!this.swarm || this.swarm.destroyed) return - - if (!this.sentHandshake) this.handshake() - } - - handshake () { - const opts = { - dht: this.swarm.private ? false : !!this.swarm.client.dht - } - this.wire.handshake(this.swarm.infoHash, this.swarm.client.peerId, opts) - this.sentHandshake = true - } - - startConnectTimeout () { - clearTimeout(this.connectTimeout) - - const connectTimeoutValues = { - webrtc: CONNECT_TIMEOUT_WEBRTC, - tcpOutgoing: CONNECT_TIMEOUT_TCP, - utpOutgoing: CONNECT_TIMEOUT_UTP - } - - this.connectTimeout = setTimeout(() => { - this.destroy(new Error('connect timeout')) - }, connectTimeoutValues[this.type]) - if (this.connectTimeout.unref) this.connectTimeout.unref() - } - - startHandshakeTimeout () { - clearTimeout(this.handshakeTimeout) - this.handshakeTimeout = setTimeout(() => { - this.destroy(new Error('handshake timeout')) - }, HANDSHAKE_TIMEOUT) - if (this.handshakeTimeout.unref) this.handshakeTimeout.unref() - } - - destroy (err) { - if (this.destroyed) return - this.destroyed = true - this.connected = false - - debug('destroy %s %s (error: %s)', this.type, this.id, err && (err.message || err)) - - clearTimeout(this.connectTimeout) - clearTimeout(this.handshakeTimeout) - - const swarm = this.swarm - const conn = this.conn - const wire = this.wire - - this.swarm = null - this.conn = null - this.wire = null - - if (swarm && wire) { - arrayRemove(swarm.wires, swarm.wires.indexOf(wire)) - } - if (conn) { - conn.on('error', () => {}) - conn.destroy() - } - if (wire) wire.destroy() - if (swarm) swarm.removePeer(this.id) - } -} - - -/***/ }), - -/***/ "./node_modules/webtorrent/lib/rarity-map.js": -/*!***************************************************!*\ - !*** ./node_modules/webtorrent/lib/rarity-map.js ***! - \***************************************************/ -/***/ ((module) => { - - -/** - * Mapping of torrent pieces to their respective availability in the torrent swarm. Used - * by the torrent manager for implementing the rarest piece first selection strategy. - */ -class RarityMap { - constructor (torrent) { - this._torrent = torrent - this._numPieces = torrent.pieces.length - this._pieces = new Array(this._numPieces) - - this._onWire = wire => { - this.recalculate() - this._initWire(wire) - } - this._onWireHave = index => { - this._pieces[index] += 1 - } - this._onWireBitfield = () => { - this.recalculate() - } - - this._torrent.wires.forEach(wire => { - this._initWire(wire) - }) - this._torrent.on('wire', this._onWire) - this.recalculate() - } - - /** - * Get the index of the rarest piece. Optionally, pass a filter function to exclude - * certain pieces (for instance, those that we already have). - * - * @param {function} pieceFilterFunc - * @return {number} index of rarest piece, or -1 - */ - getRarestPiece (pieceFilterFunc) { - let candidates = [] - let min = Infinity - - for (let i = 0; i < this._numPieces; ++i) { - if (pieceFilterFunc && !pieceFilterFunc(i)) continue - - const availability = this._pieces[i] - if (availability === min) { - candidates.push(i) - } else if (availability < min) { - candidates = [i] - min = availability - } - } - - if (candidates.length) { - // if there are multiple pieces with the same availability, choose one randomly - return candidates[Math.random() * candidates.length | 0] - } else { - return -1 - } - } - - destroy () { - this._torrent.removeListener('wire', this._onWire) - this._torrent.wires.forEach(wire => { - this._cleanupWireEvents(wire) - }) - this._torrent = null - this._pieces = null - - this._onWire = null - this._onWireHave = null - this._onWireBitfield = null - } - - _initWire (wire) { - wire._onClose = () => { - this._cleanupWireEvents(wire) - for (let i = 0; i < this._numPieces; ++i) { - this._pieces[i] -= wire.peerPieces.get(i) - } - } - - wire.on('have', this._onWireHave) - wire.on('bitfield', this._onWireBitfield) - wire.once('close', wire._onClose) - } - - /** - * Recalculates piece availability across all peers in the torrent. - */ - recalculate () { - this._pieces.fill(0) - - for (const wire of this._torrent.wires) { - for (let i = 0; i < this._numPieces; ++i) { - this._pieces[i] += wire.peerPieces.get(i) - } - } - } - - _cleanupWireEvents (wire) { - wire.removeListener('have', this._onWireHave) - wire.removeListener('bitfield', this._onWireBitfield) - if (wire._onClose) wire.removeListener('close', wire._onClose) - wire._onClose = null - } -} - -module.exports = RarityMap - - -/***/ }), - -/***/ "./node_modules/webtorrent/lib/torrent.js": -/*!************************************************!*\ - !*** ./node_modules/webtorrent/lib/torrent.js ***! - \************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var process = __webpack_require__(/*! process-fast */ "./node_modules/process-fast/index.js"); -/* global Blob */ - -const addrToIPPort = __webpack_require__(/*! addr-to-ip-port */ "./node_modules/addr-to-ip-port/index.js") -const BitField = __webpack_require__(/*! bitfield */ "./node_modules/bitfield/lib/index.js").default -const CacheChunkStore = __webpack_require__(/*! cache-chunk-store */ "./node_modules/cache-chunk-store/index.js") -const ChunkStoreWriteStream = __webpack_require__(/*! chunk-store-stream/write */ "./node_modules/chunk-store-stream/write.js") -const cpus = __webpack_require__(/*! cpus */ "./node_modules/cpus/browser.js") -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('webtorrent:torrent') -const Discovery = __webpack_require__(/*! torrent-discovery */ "./node_modules/torrent-discovery/index.js") -const EventEmitter = __webpack_require__(/*! events */ "./node_modules/events/events.js").EventEmitter -const fs = __webpack_require__(/*! fs */ "?c172") -const FSChunkStore = __webpack_require__(/*! fs-chunk-store */ "./node_modules/memory-chunk-store/index.js") // browser: `memory-chunk-store` -const get = __webpack_require__(/*! simple-get */ "./node_modules/simple-get/index.js") -const ImmediateChunkStore = __webpack_require__(/*! immediate-chunk-store */ "./node_modules/immediate-chunk-store/index.js") -const ltDontHave = __webpack_require__(/*! lt_donthave */ "./node_modules/lt_donthave/index.js") -const MemoryChunkStore = __webpack_require__(/*! memory-chunk-store */ "./node_modules/memory-chunk-store/index.js") -const MultiStream = __webpack_require__(/*! multistream */ "./node_modules/multistream/index.js") -const net = __webpack_require__(/*! net */ "?c362") // browser exclude -const os = __webpack_require__(/*! os */ "?5efe") // browser exclude -const parallel = __webpack_require__(/*! run-parallel */ "./node_modules/run-parallel/index.js") -const parallelLimit = __webpack_require__(/*! run-parallel-limit */ "./node_modules/run-parallel-limit/index.js") -const parseTorrent = __webpack_require__(/*! parse-torrent */ "./node_modules/parse-torrent/index.js") -const path = __webpack_require__(/*! path */ "./node_modules/path-browserify/index.js") -const Piece = __webpack_require__(/*! torrent-piece */ "./node_modules/torrent-piece/index.js") -const pump = __webpack_require__(/*! pump */ "./node_modules/pump/index.js") -const queueMicrotask = __webpack_require__(/*! queue-microtask */ "./node_modules/queue-microtask/index.js") -const randomIterate = __webpack_require__(/*! random-iterate */ "./node_modules/random-iterate/index.js") -const sha1 = __webpack_require__(/*! simple-sha1 */ "./node_modules/simple-sha1/browser.js") -const speedometer = __webpack_require__(/*! speedometer */ "./node_modules/speedometer/index.js") -const utMetadata = __webpack_require__(/*! ut_metadata */ "./node_modules/ut_metadata/index.js") -const utPex = __webpack_require__(/*! ut_pex */ "?6dbd") // browser exclude - -const File = __webpack_require__(/*! ./file */ "./node_modules/webtorrent/lib/file.js") -const Peer = __webpack_require__(/*! ./peer */ "./node_modules/webtorrent/lib/peer.js") -const RarityMap = __webpack_require__(/*! ./rarity-map */ "./node_modules/webtorrent/lib/rarity-map.js") -const Server = __webpack_require__(/*! ./server */ "?ea49") // browser exclude -const utp = __webpack_require__(/*! ./utp */ "?d41a") // browser exclude -const WebConn = __webpack_require__(/*! ./webconn */ "./node_modules/webtorrent/lib/webconn.js") - -const MAX_BLOCK_LENGTH = 128 * 1024 -const PIECE_TIMEOUT = 30000 -const CHOKE_TIMEOUT = 5000 -const SPEED_THRESHOLD = 3 * Piece.BLOCK_LENGTH - -const PIPELINE_MIN_DURATION = 0.5 -const PIPELINE_MAX_DURATION = 1 - -const RECHOKE_INTERVAL = 10000 // 10 seconds -const RECHOKE_OPTIMISTIC_DURATION = 2 // 30 seconds - -// IndexedDB chunk stores used in the browser benefit from high concurrency -const FILESYSTEM_CONCURRENCY = process.browser ? cpus().length : 2 - -const RECONNECT_WAIT = [1000, 5000, 15000] - -const VERSION = __webpack_require__(/*! ../package.json */ "./node_modules/webtorrent/package.json").version -const USER_AGENT = `WebTorrent/${VERSION} (https://webtorrent.io)` - -let TMP -try { - TMP = path.join(fs.statSync('/tmp') && '/tmp', 'webtorrent') -} catch (err) { - TMP = path.join(typeof os.tmpdir === 'function' ? os.tmpdir() : '/', 'webtorrent') -} - -class Torrent extends EventEmitter { - constructor (torrentId, client, opts) { - super() - - this._debugId = 'unknown infohash' - this.client = client - - this.announce = opts.announce - this.urlList = opts.urlList - - this.path = opts.path - this.skipVerify = !!opts.skipVerify - this._store = opts.store || FSChunkStore - this._preloadedStore = opts.preloadedStore || null - this._storeCacheSlots = opts.storeCacheSlots !== undefined ? opts.storeCacheSlots : 20 - this._destroyStoreOnDestroy = opts.destroyStoreOnDestroy || false - this._getAnnounceOpts = opts.getAnnounceOpts - - // if defined, `opts.private` overrides default privacy of torrent - if (typeof opts.private === 'boolean') this.private = opts.private - - this.strategy = opts.strategy || 'sequential' - - this.maxWebConns = opts.maxWebConns || 4 - - this._rechokeNumSlots = (opts.uploads === false || opts.uploads === 0) - ? 0 - : (+opts.uploads || 10) - this._rechokeOptimisticWire = null - this._rechokeOptimisticTime = 0 - this._rechokeIntervalId = null - - this.ready = false - this.destroyed = false - this.paused = opts.paused || false - this.done = false - - this.metadata = null - this.store = null - this.files = [] - this.pieces = [] - - this._amInterested = false - this._selections = [] - this._critical = [] - - this.wires = [] // open wires (added *after* handshake) - - this._queue = [] // queue of outgoing tcp peers to connect to - this._peers = {} // connected peers (addr/peerId -> Peer) - this._peersLength = 0 // number of elements in `this._peers` (cache, for perf) - - // stats - this.received = 0 - this.uploaded = 0 - this._downloadSpeed = speedometer() - this._uploadSpeed = speedometer() - - // for cleanup - this._servers = [] - this._xsRequests = [] - - // TODO: remove this and expose a hook instead - // optimization: don't recheck every file if it hasn't changed - this._fileModtimes = opts.fileModtimes - - if (torrentId !== null) this._onTorrentId(torrentId) - - this._debug('new torrent') - } - - get timeRemaining () { - if (this.done) return 0 - if (this.downloadSpeed === 0) return Infinity - return ((this.length - this.downloaded) / this.downloadSpeed) * 1000 - } - - get downloaded () { - if (!this.bitfield) return 0 - let downloaded = 0 - for (let index = 0, len = this.pieces.length; index < len; ++index) { - if (this.bitfield.get(index)) { // verified data - downloaded += (index === len - 1) ? this.lastPieceLength : this.pieceLength - } else { // "in progress" data - const piece = this.pieces[index] - downloaded += (piece.length - piece.missing) - } - } - return downloaded - } - - // TODO: re-enable this. The number of missing pieces. Used to implement 'end game' mode. - // Object.defineProperty(Storage.prototype, 'numMissing', { - // get: function () { - // var self = this - // var numMissing = self.pieces.length - // for (var index = 0, len = self.pieces.length; index < len; index++) { - // numMissing -= self.bitfield.get(index) - // } - // return numMissing - // } - // }) - - get downloadSpeed () { return this._downloadSpeed() } - - get uploadSpeed () { return this._uploadSpeed() } - - get progress () { return this.length ? this.downloaded / this.length : 0 } - - get ratio () { return this.uploaded / (this.received || this.length) } - - get numPeers () { return this.wires.length } - - get torrentFileBlobURL () { - if (typeof window === 'undefined') throw new Error('browser-only property') - if (!this.torrentFile) return null - return URL.createObjectURL( - new Blob([this.torrentFile], { type: 'application/x-bittorrent' }) - ) - } - - get _numQueued () { - return this._queue.length + (this._peersLength - this._numConns) - } - - get _numConns () { - let numConns = 0 - for (const id in this._peers) { - if (this._peers[id].connected) numConns += 1 - } - return numConns - } - - _onTorrentId (torrentId) { - if (this.destroyed) return - - let parsedTorrent - try { parsedTorrent = parseTorrent(torrentId) } catch (err) {} - if (parsedTorrent) { - // Attempt to set infoHash property synchronously - this.infoHash = parsedTorrent.infoHash - this._debugId = parsedTorrent.infoHash.toString('hex').substring(0, 7) - queueMicrotask(() => { - if (this.destroyed) return - this._onParsedTorrent(parsedTorrent) - }) - } else { - // If torrentId failed to parse, it could be in a form that requires an async - // operation, i.e. http/https link, filesystem path, or Blob. - parseTorrent.remote(torrentId, (err, parsedTorrent) => { - if (this.destroyed) return - if (err) return this._destroy(err) - this._onParsedTorrent(parsedTorrent) - }) - } - } - - _onParsedTorrent (parsedTorrent) { - if (this.destroyed) return - - this._processParsedTorrent(parsedTorrent) - - if (!this.infoHash) { - return this._destroy(new Error('Malformed torrent data: No info hash')) - } - - if (!this.path) this.path = path.join(TMP, this.infoHash) - - this._rechokeIntervalId = setInterval(() => { - this._rechoke() - }, RECHOKE_INTERVAL) - if (this._rechokeIntervalId.unref) this._rechokeIntervalId.unref() - - // Private 'infoHash' event allows client.add to check for duplicate torrents and - // destroy them before the normal 'infoHash' event is emitted. Prevents user - // applications from needing to deal with duplicate 'infoHash' events. - this.emit('_infoHash', this.infoHash) - if (this.destroyed) return - - this.emit('infoHash', this.infoHash) - if (this.destroyed) return // user might destroy torrent in event handler - - if (this.client.listening) { - this._onListening() - } else { - this.client.once('listening', () => { - this._onListening() - }) - } - } - - _processParsedTorrent (parsedTorrent) { - this._debugId = parsedTorrent.infoHash.toString('hex').substring(0, 7) - - if (typeof this.private !== 'undefined') { - // `private` option overrides default, only if it's defined - parsedTorrent.private = this.private - } - - if (this.announce) { - // Allow specifying trackers via `opts` parameter - parsedTorrent.announce = parsedTorrent.announce.concat(this.announce) - } - - if (this.client.tracker && __webpack_require__.g.WEBTORRENT_ANNOUNCE && !parsedTorrent.private) { - // So `webtorrent-hybrid` can force specific trackers to be used - parsedTorrent.announce = parsedTorrent.announce.concat(__webpack_require__.g.WEBTORRENT_ANNOUNCE) - } - - if (this.urlList) { - // Allow specifying web seeds via `opts` parameter - parsedTorrent.urlList = parsedTorrent.urlList.concat(this.urlList) - } - - // remove duplicates by converting to Set and back - parsedTorrent.announce = Array.from(new Set(parsedTorrent.announce)) - parsedTorrent.urlList = Array.from(new Set(parsedTorrent.urlList)) - - Object.assign(this, parsedTorrent) - - this.magnetURI = parseTorrent.toMagnetURI(parsedTorrent) - this.torrentFile = parseTorrent.toTorrentFile(parsedTorrent) - } - - _onListening () { - if (this.destroyed) return - - if (this.info) { - // if full metadata was included in initial torrent id, use it immediately. Otherwise, - // wait for torrent-discovery to find peers and ut_metadata to get the metadata. - this._onMetadata(this) - } else { - if (this.xs) this._getMetadataFromServer() - this._startDiscovery() - } - } - - _startDiscovery () { - if (this.discovery || this.destroyed) return - - let trackerOpts = this.client.tracker - if (trackerOpts) { - trackerOpts = Object.assign({}, this.client.tracker, { - getAnnounceOpts: () => { - if (this.destroyed) return - - const opts = { - uploaded: this.uploaded, - downloaded: this.downloaded, - left: Math.max(this.length - this.downloaded, 0) - } - if (this.client.tracker.getAnnounceOpts) { - Object.assign(opts, this.client.tracker.getAnnounceOpts()) - } - if (this._getAnnounceOpts) { - // TODO: consider deprecating this, as it's redundant with the former case - Object.assign(opts, this._getAnnounceOpts()) - } - return opts - } - }) - } - - // add BEP09 peer-address - if (this.peerAddresses) { - this.peerAddresses.forEach(peer => this.addPeer(peer)) - } - - // begin discovering peers via DHT and trackers - this.discovery = new Discovery({ - infoHash: this.infoHash, - announce: this.announce, - peerId: this.client.peerId, - dht: !this.private && this.client.dht, - tracker: trackerOpts, - port: this.client.torrentPort, - userAgent: USER_AGENT, - lsd: this.client.lsd - }) - - this.discovery.on('error', (err) => { - this._destroy(err) - }) - - this.discovery.on('peer', (peer, source) => { - this._debug('peer %s discovered via %s', peer, source) - // Don't create new outgoing TCP connections when torrent is done - if (typeof peer === 'string' && this.done) return - this.addPeer(peer) - }) - - this.discovery.on('trackerAnnounce', () => { - this.emit('trackerAnnounce') - if (this.numPeers === 0) this.emit('noPeers', 'tracker') - }) - - this.discovery.on('dhtAnnounce', () => { - this.emit('dhtAnnounce') - if (this.numPeers === 0) this.emit('noPeers', 'dht') - }) - - this.discovery.on('warning', (err) => { - this.emit('warning', err) - }) - } - - _getMetadataFromServer () { - // to allow function hoisting - const self = this - - const urls = Array.isArray(this.xs) ? this.xs : [this.xs] - - const tasks = urls.map(url => cb => { - getMetadataFromURL(url, cb) - }) - parallel(tasks) - - function getMetadataFromURL (url, cb) { - if (url.indexOf('http://') !== 0 && url.indexOf('https://') !== 0) { - self.emit('warning', new Error(`skipping non-http xs param: ${url}`)) - return cb(null) - } - - const opts = { - url, - method: 'GET', - headers: { - 'user-agent': USER_AGENT - } - } - let req - try { - req = get.concat(opts, onResponse) - } catch (err) { - self.emit('warning', new Error(`skipping invalid url xs param: ${url}`)) - return cb(null) - } - - self._xsRequests.push(req) - - function onResponse (err, res, torrent) { - if (self.destroyed) return cb(null) - if (self.metadata) return cb(null) - - if (err) { - self.emit('warning', new Error(`http error from xs param: ${url}`)) - return cb(null) - } - if (res.statusCode !== 200) { - self.emit('warning', new Error(`non-200 status code ${res.statusCode} from xs param: ${url}`)) - return cb(null) - } - - let parsedTorrent - try { - parsedTorrent = parseTorrent(torrent) - } catch (err) {} - - if (!parsedTorrent) { - self.emit('warning', new Error(`got invalid torrent file from xs param: ${url}`)) - return cb(null) - } - - if (parsedTorrent.infoHash !== self.infoHash) { - self.emit('warning', new Error(`got torrent file with incorrect info hash from xs param: ${url}`)) - return cb(null) - } - - self._onMetadata(parsedTorrent) - cb(null) - } - } - } - - /** - * Called when the full torrent metadata is received. - */ - _onMetadata (metadata) { - if (this.metadata || this.destroyed) return - this._debug('got metadata') - - this._xsRequests.forEach(req => { - req.abort() - }) - this._xsRequests = [] - - let parsedTorrent - if (metadata && metadata.infoHash) { - // `metadata` is a parsed torrent (from parse-torrent module) - parsedTorrent = metadata - } else { - try { - parsedTorrent = parseTorrent(metadata) - } catch (err) { - return this._destroy(err) - } - } - - this._processParsedTorrent(parsedTorrent) - this.metadata = this.torrentFile - - // add web seed urls (BEP19) - if (this.client.enableWebSeeds) { - this.urlList.forEach(url => { - this.addWebSeed(url) - }) - } - - this._rarityMap = new RarityMap(this) - - let rawStore = this._preloadedStore - if (!rawStore) { - rawStore = new this._store(this.pieceLength, { - // opts.torrent is deprecated (replaced by the name property). - // it doesn't appear to be used by current versions of any stores on npm. - torrent: { - infoHash: this.infoHash - }, - files: this.files.map(file => ({ - path: path.join(this.path, file.path), - length: file.length, - offset: file.offset - })), - length: this.length, - name: this.infoHash - }) - } - - // don't use the cache if the store is already in memory - if (this._storeCacheSlots > 0 && !(rawStore instanceof MemoryChunkStore)) { - rawStore = new CacheChunkStore(rawStore, { - max: this._storeCacheSlots - }) - } - - this.store = new ImmediateChunkStore( - rawStore - ) - - this.files = this.files.map(file => new File(this, file)) - - // Select only specified files (BEP53) http://www.bittorrent.org/beps/bep_0053.html - if (this.so) { - this.files.forEach((v, i) => { - if (this.so.includes(i)) { - this.files[i].select() - } else { - this.files[i].deselect() - } - }) - } else { - // start off selecting the entire torrent with low priority - if (this.pieces.length !== 0) { - this.select(0, this.pieces.length - 1, false) - } - } - - this._hashes = this.pieces - - this.pieces = this.pieces.map((hash, i) => { - const pieceLength = (i === this.pieces.length - 1) - ? this.lastPieceLength - : this.pieceLength - return new Piece(pieceLength) - }) - - this._reservations = this.pieces.map(() => []) - - this.bitfield = new BitField(this.pieces.length) - - this.wires.forEach(wire => { - // If we didn't have the metadata at the time ut_metadata was initialized for this - // wire, we still want to make it available to the peer in case they request it. - if (wire.ut_metadata) wire.ut_metadata.setMetadata(this.metadata) - - this._onWireWithMetadata(wire) - }) - - // Emit 'metadata' before 'ready' and 'done' - this.emit('metadata') - - // User might destroy torrent in response to 'metadata' event - if (this.destroyed) return - - if (this.skipVerify) { - // Skip verifying exisitng data and just assume it's correct - this._markAllVerified() - this._onStore() - } else { - const onPiecesVerified = (err) => { - if (err) return this._destroy(err) - this._debug('done verifying') - this._onStore() - } - - this._debug('verifying existing torrent data') - if (this._fileModtimes && this._store === FSChunkStore) { - // don't verify if the files haven't been modified since we last checked - this.getFileModtimes((err, fileModtimes) => { - if (err) return this._destroy(err) - - const unchanged = this.files.map((_, index) => fileModtimes[index] === this._fileModtimes[index]).every(x => x) - - if (unchanged) { - this._markAllVerified() - this._onStore() - } else { - this._verifyPieces(onPiecesVerified) - } - }) - } else { - this._verifyPieces(onPiecesVerified) - } - } - } - - /* - * TODO: remove this - * Gets the last modified time of every file on disk for this torrent. - * Only valid in Node, not in the browser. - */ - getFileModtimes (cb) { - const ret = [] - parallelLimit(this.files.map((file, index) => cb => { - fs.stat(path.join(this.path, file.path), (err, stat) => { - if (err && err.code !== 'ENOENT') return cb(err) - ret[index] = stat && stat.mtime.getTime() - cb(null) - }) - }), FILESYSTEM_CONCURRENCY, err => { - this._debug('done getting file modtimes') - cb(err, ret) - }) - } - - _verifyPieces (cb) { - parallelLimit(this.pieces.map((piece, index) => cb => { - if (this.destroyed) return cb(new Error('torrent is destroyed')) - - const getOpts = {} - // Specify length for the last piece in case it is zero-padded - if (index === this.pieces.length - 1) { - getOpts.length = this.lastPieceLength - } - this.store.get(index, getOpts, (err, buf) => { - if (this.destroyed) return cb(new Error('torrent is destroyed')) - - if (err) return queueMicrotask(() => cb(null)) // ignore error - sha1(buf, hash => { - if (this.destroyed) return cb(new Error('torrent is destroyed')) - - if (hash === this._hashes[index]) { - this._debug('piece verified %s', index) - this._markVerified(index) - } else { - this._debug('piece invalid %s', index) - } - cb(null) - }) - }) - }), FILESYSTEM_CONCURRENCY, cb) - } - - rescanFiles (cb) { - if (this.destroyed) throw new Error('torrent is destroyed') - if (!cb) cb = noop - - this._verifyPieces((err) => { - if (err) { - this._destroy(err) - return cb(err) - } - - this._checkDone() - cb(null) - }) - } - - _markAllVerified () { - for (let index = 0; index < this.pieces.length; index++) { - this._markVerified(index) - } - } - - _markVerified (index) { - this.pieces[index] = null - this._reservations[index] = null - this.bitfield.set(index, true) - } - - /** - * Called when the metadata, listening server, and underlying chunk store is initialized. - */ - _onStore () { - if (this.destroyed) return - this._debug('on store') - - // Start discovery before emitting 'ready' - this._startDiscovery() - - this.ready = true - this.emit('ready') - - // Files may start out done if the file was already in the store - this._checkDone() - - // In case any selections were made before torrent was ready - this._updateSelections() - } - - destroy (opts, cb) { - if (typeof opts === 'function') return this.destroy(null, opts) - - this._destroy(null, opts, cb) - } - - _destroy (err, opts, cb) { - if (typeof opts === 'function') return this._destroy(err, null, opts) - if (this.destroyed) return - this.destroyed = true - this._debug('destroy') - - this.client._remove(this) - - clearInterval(this._rechokeIntervalId) - - this._xsRequests.forEach(req => { - req.abort() - }) - - if (this._rarityMap) { - this._rarityMap.destroy() - } - - for (const id in this._peers) { - this.removePeer(id) - } - - this.files.forEach(file => { - if (file instanceof File) file._destroy() - }) - - const tasks = this._servers.map(server => cb => { - server.destroy(cb) - }) - - if (this.discovery) { - tasks.push(cb => { - this.discovery.destroy(cb) - }) - } - - if (this.store) { - let destroyStore = this._destroyStoreOnDestroy - if (opts && opts.destroyStore !== undefined) { - destroyStore = opts.destroyStore - } - tasks.push(cb => { - if (destroyStore) { - this.store.destroy(cb) - } else { - this.store.close(cb) - } - }) - } - - parallel(tasks, cb) - - if (err) { - // Torrent errors are emitted at `torrent.on('error')`. If there are no 'error' - // event handlers on the torrent instance, then the error will be emitted at - // `client.on('error')`. This prevents throwing an uncaught exception - // (unhandled 'error' event), but it makes it impossible to distinguish client - // errors versus torrent errors. Torrent errors are not fatal, and the client - // is still usable afterwards. Therefore, always listen for errors in both - // places (`client.on('error')` and `torrent.on('error')`). - if (this.listenerCount('error') === 0) { - this.client.emit('error', err) - } else { - this.emit('error', err) - } - } - - this.emit('close') - - this.client = null - this.files = [] - this.discovery = null - this.store = null - this._rarityMap = null - this._peers = null - this._servers = null - this._xsRequests = null - } - - addPeer (peer) { - if (this.destroyed) throw new Error('torrent is destroyed') - if (!this.infoHash) throw new Error('addPeer() must not be called before the `infoHash` event') - - let host - - if (this.client.blocked) { - if (typeof peer === 'string') { - let parts - try { - parts = addrToIPPort(peer) - } catch (e) { - this._debug('ignoring peer: invalid %s', peer) - this.emit('invalidPeer', peer) - return false - } - host = parts[0] - } else if (typeof peer.remoteAddress === 'string') { - host = peer.remoteAddress - } - - if (host && this.client.blocked.contains(host)) { - this._debug('ignoring peer: blocked %s', peer) - if (typeof peer !== 'string') peer.destroy() - this.emit('blockedPeer', peer) - return false - } - } - - // if the utp connection fails to connect, then it is replaced with a tcp connection to the same ip:port - - const type = (this.client.utp && this._isIPv4(host)) ? 'utp' : 'tcp' - const wasAdded = !!this._addPeer(peer, type) - - if (wasAdded) { - this.emit('peer', peer) - } else { - this.emit('invalidPeer', peer) - } - return wasAdded - } - - _addPeer (peer, type) { - if (this.destroyed) { - if (typeof peer !== 'string') peer.destroy() - return null - } - if (typeof peer === 'string' && !this._validAddr(peer)) { - this._debug('ignoring peer: invalid %s', peer) - return null - } - - const id = (peer && peer.id) || peer - if (this._peers[id]) { - this._debug('ignoring peer: duplicate (%s)', id) - if (typeof peer !== 'string') peer.destroy() - return null - } - - if (this.paused) { - this._debug('ignoring peer: torrent is paused') - if (typeof peer !== 'string') peer.destroy() - return null - } - - this._debug('add peer %s', id) - - let newPeer - if (typeof peer === 'string') { - // `peer` is an addr ("ip:port" string) - newPeer = type === 'utp' - ? Peer.createUTPOutgoingPeer(peer, this, this.client.throttleGroups) - : Peer.createTCPOutgoingPeer(peer, this, this.client.throttleGroups) - } else { - // `peer` is a WebRTC connection (simple-peer) - newPeer = Peer.createWebRTCPeer(peer, this, this.client.throttleGroups) - } - - this._registerPeer(newPeer) - - if (typeof peer === 'string') { - // `peer` is an addr ("ip:port" string) - this._queue.push(newPeer) - this._drain() - } - - return newPeer - } - - addWebSeed (urlOrConn) { - if (this.destroyed) throw new Error('torrent is destroyed') - - let id - let conn - if (typeof urlOrConn === 'string') { - id = urlOrConn - - if (!/^https?:\/\/.+/.test(id)) { - this.emit('warning', new Error(`ignoring invalid web seed: ${id}`)) - this.emit('invalidPeer', id) - return - } - - if (this._peers[id]) { - this.emit('warning', new Error(`ignoring duplicate web seed: ${id}`)) - this.emit('invalidPeer', id) - return - } - - conn = new WebConn(id, this) - } else if (urlOrConn && typeof urlOrConn.connId === 'string') { - conn = urlOrConn - id = conn.connId - - if (this._peers[id]) { - this.emit('warning', new Error(`ignoring duplicate web seed: ${id}`)) - this.emit('invalidPeer', id) - return - } - } else { - this.emit('warning', new Error('addWebSeed must be passed a string or connection object with id property')) - return - } - - this._debug('add web seed %s', id) - - const newPeer = Peer.createWebSeedPeer(conn, id, this, this.client.throttleGroups) - - this._registerPeer(newPeer) - - this.emit('peer', id) - } - - /** - * Called whenever a new incoming TCP peer connects to this torrent swarm. Called with a - * peer that has already sent a handshake. - */ - _addIncomingPeer (peer) { - if (this.destroyed) return peer.destroy(new Error('torrent is destroyed')) - if (this.paused) return peer.destroy(new Error('torrent is paused')) - - this._debug('add incoming peer %s', peer.id) - - this._registerPeer(peer) - } - - _registerPeer (newPeer) { - newPeer.on('download', downloaded => { - if (this.destroyed) return - this.received += downloaded - this._downloadSpeed(downloaded) - this.client._downloadSpeed(downloaded) - this.emit('download', downloaded) - if (this.destroyed) return - this.client.emit('download', downloaded) - }) - - newPeer.on('upload', uploaded => { - if (this.destroyed) return - this.uploaded += uploaded - this._uploadSpeed(uploaded) - this.client._uploadSpeed(uploaded) - this.emit('upload', uploaded) - if (this.destroyed) return - this.client.emit('upload', uploaded) - }) - - this._peers[newPeer.id] = newPeer - this._peersLength += 1 - } - - removePeer (peer) { - const id = (peer && peer.id) || peer - peer = this._peers[id] - - if (!peer) return - - this._debug('removePeer %s', id) - - delete this._peers[id] - this._peersLength -= 1 - - peer.destroy() - - // If torrent swarm was at capacity before, try to open a new connection now - this._drain() - } - - select (start, end, priority, notify) { - if (this.destroyed) throw new Error('torrent is destroyed') - - if (start < 0 || end < start || this.pieces.length <= end) { - throw new Error(`invalid selection ${start} : ${end}`) - } - priority = Number(priority) || 0 - - this._debug('select %s-%s (priority %s)', start, end, priority) - - this._selections.push({ - from: start, - to: end, - offset: 0, - priority, - notify: notify || noop - }) - - this._selections.sort((a, b) => b.priority - a.priority) - - this._updateSelections() - } - - deselect (start, end, priority) { - if (this.destroyed) throw new Error('torrent is destroyed') - - priority = Number(priority) || 0 - this._debug('deselect %s-%s (priority %s)', start, end, priority) - - for (let i = 0; i < this._selections.length; ++i) { - const s = this._selections[i] - if (s.from === start && s.to === end && s.priority === priority) { - this._selections.splice(i, 1) - break - } - } - - this._updateSelections() - } - - critical (start, end) { - if (this.destroyed) throw new Error('torrent is destroyed') - - this._debug('critical %s-%s', start, end) - - for (let i = start; i <= end; ++i) { - this._critical[i] = true - } - - this._updateSelections() - } - - _onWire (wire, addr) { - this._debug('got wire %s (%s)', wire._debugId, addr || 'Unknown') - - this.wires.push(wire) - - if (addr) { - // Sometimes RTCPeerConnection.getStats() doesn't return an ip:port for peers - const parts = addrToIPPort(addr) - wire.remoteAddress = parts[0] - wire.remotePort = parts[1] - } - - // When peer sends PORT message, add that DHT node to routing table - if (this.client.dht && this.client.dht.listening) { - wire.on('port', port => { - if (this.destroyed || this.client.dht.destroyed) { - return - } - if (!wire.remoteAddress) { - return this._debug('ignoring PORT from peer with no address') - } - if (port === 0 || port > 65536) { - return this._debug('ignoring invalid PORT from peer') - } - - this._debug('port: %s (from %s)', port, addr) - this.client.dht.addNode({ host: wire.remoteAddress, port }) - }) - } - - wire.on('timeout', () => { - this._debug('wire timeout (%s)', addr) - // TODO: this might be destroying wires too eagerly - wire.destroy() - }) - - // Timeout for piece requests to this peer - if (wire.type !== 'webSeed') { // webseeds always send 'unhave' on http timeout - wire.setTimeout(PIECE_TIMEOUT, true) - } - - // Send KEEP-ALIVE (every 60s) so peers will not disconnect the wire - wire.setKeepAlive(true) - - // use ut_metadata extension - wire.use(utMetadata(this.metadata)) - - wire.ut_metadata.on('warning', err => { - this._debug('ut_metadata warning: %s', err.message) - }) - - if (!this.metadata) { - wire.ut_metadata.on('metadata', metadata => { - this._debug('got metadata via ut_metadata') - this._onMetadata(metadata) - }) - wire.ut_metadata.fetch() - } - - // use ut_pex extension if the torrent is not flagged as private - if (typeof utPex === 'function' && !this.private) { - wire.use(utPex()) - - wire.ut_pex.on('peer', peer => { - // Only add potential new peers when we're not seeding - if (this.done) return - this._debug('ut_pex: got peer: %s (from %s)', peer, addr) - this.addPeer(peer) - }) - - wire.ut_pex.on('dropped', peer => { - // the remote peer believes a given peer has been dropped from the torrent swarm. - // if we're not currently connected to it, then remove it from the queue. - const peerObj = this._peers[peer] - if (peerObj && !peerObj.connected) { - this._debug('ut_pex: dropped peer: %s (from %s)', peer, addr) - this.removePeer(peer) - } - }) - - wire.once('close', () => { - // Stop sending updates to remote peer - wire.ut_pex.reset() - }) - } - - wire.use(ltDontHave()) - - // Hook to allow user-defined `bittorrent-protocol` extensions - // More info: https://github.com/webtorrent/bittorrent-protocol#extension-api - this.emit('wire', wire, addr) - - if (this.metadata) { - queueMicrotask(() => { - // This allows wire.handshake() to be called (by Peer.onHandshake) before any - // messages get sent on the wire - this._onWireWithMetadata(wire) - }) - } - } - - _onWireWithMetadata (wire) { - let timeoutId = null - - const onChokeTimeout = () => { - if (this.destroyed || wire.destroyed) return - - if (this._numQueued > 2 * (this._numConns - this.numPeers) && - wire.amInterested) { - wire.destroy() - } else { - timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT) - if (timeoutId.unref) timeoutId.unref() - } - } - - let i - const updateSeedStatus = () => { - if (wire.peerPieces.buffer.length !== this.bitfield.buffer.length) return - for (i = 0; i < this.pieces.length; ++i) { - if (!wire.peerPieces.get(i)) return - } - wire.isSeeder = true - wire.choke() // always choke seeders - } - - wire.on('bitfield', () => { - updateSeedStatus() - this._update() - this._updateWireInterest(wire) - }) - - wire.on('have', () => { - updateSeedStatus() - this._update() - this._updateWireInterest(wire) - }) - - wire.lt_donthave.on('donthave', () => { - updateSeedStatus() - this._update() - this._updateWireInterest(wire) - }) - - wire.once('interested', () => { - wire.unchoke() - }) - - wire.once('close', () => { - clearTimeout(timeoutId) - }) - - wire.on('choke', () => { - clearTimeout(timeoutId) - timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT) - if (timeoutId.unref) timeoutId.unref() - }) - - wire.on('unchoke', () => { - clearTimeout(timeoutId) - this._update() - }) - - wire.on('request', (index, offset, length, cb) => { - if (length > MAX_BLOCK_LENGTH) { - // Per spec, disconnect from peers that request >128KB - return wire.destroy() - } - if (this.pieces[index]) return - this.store.get(index, { offset, length }, cb) - }) - - wire.bitfield(this.bitfield) // always send bitfield (required) - - // initialize interest in case bitfield message was already received before above handler was registered - this._updateWireInterest(wire) - - // Send PORT message to peers that support DHT - if (wire.peerExtensions.dht && this.client.dht && this.client.dht.listening) { - wire.port(this.client.dht.address().port) - } - - if (wire.type !== 'webSeed') { // do not choke on webseeds - timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT) - if (timeoutId.unref) timeoutId.unref() - } - - wire.isSeeder = false - updateSeedStatus() - } - - /** - * Called on selection changes. - */ - _updateSelections () { - if (!this.ready || this.destroyed) return - - queueMicrotask(() => { - this._gcSelections() - }) - this._updateInterest() - this._update() - } - - /** - * Garbage collect selections with respect to the store's current state. - */ - _gcSelections () { - for (let i = 0; i < this._selections.length; ++i) { - const s = this._selections[i] - const oldOffset = s.offset - - // check for newly downloaded pieces in selection - while (this.bitfield.get(s.from + s.offset) && s.from + s.offset < s.to) { - s.offset += 1 - } - - if (oldOffset !== s.offset) s.notify() - if (s.to !== s.from + s.offset) continue - if (!this.bitfield.get(s.from + s.offset)) continue - - this._selections.splice(i, 1) // remove fully downloaded selection - i -= 1 // decrement i to offset splice - - s.notify() - this._updateInterest() - } - - if (!this._selections.length) this.emit('idle') - } - - /** - * Update interested status for all peers. - */ - _updateInterest () { - const prev = this._amInterested - this._amInterested = !!this._selections.length - - this.wires.forEach(wire => this._updateWireInterest(wire)) - - if (prev === this._amInterested) return - if (this._amInterested) this.emit('interested') - else this.emit('uninterested') - } - - _updateWireInterest (wire) { - let interested = false - for (let index = 0; index < this.pieces.length; ++index) { - if (this.pieces[index] && wire.peerPieces.get(index)) { - interested = true - break - } - } - - if (interested) wire.interested() - else wire.uninterested() - } - - /** - * Heartbeat to update all peers and their requests. - */ - _update () { - if (this.destroyed) return - - // update wires in random order for better request distribution - const ite = randomIterate(this.wires) - let wire - while ((wire = ite())) { - this._updateWireWrapper(wire) - } - } - - _updateWireWrapper (wire) { - const self = this - - if (typeof window !== 'undefined' && typeof window.requestIdleCallback === 'function') { - window.requestIdleCallback(() => { self._updateWire(wire) }, { timeout: 250 }) - } else { - self._updateWire(wire) - } - } - - /** - * Attempts to update a peer's requests - */ - _updateWire (wire) { - // to allow function hoisting - const self = this - - if (wire.peerChoking) return - if (!wire.downloaded) return validateWire() - - const minOutstandingRequests = getBlockPipelineLength(wire, PIPELINE_MIN_DURATION) - if (wire.requests.length >= minOutstandingRequests) return - const maxOutstandingRequests = getBlockPipelineLength(wire, PIPELINE_MAX_DURATION) - - trySelectWire(false) || trySelectWire(true) - - function genPieceFilterFunc (start, end, tried, rank) { - return i => i >= start && i <= end && !(i in tried) && wire.peerPieces.get(i) && (!rank || rank(i)) - } - - // TODO: Do we need both validateWire and trySelectWire? - function validateWire () { - if (wire.requests.length) return - - let i = self._selections.length - while (i--) { - const next = self._selections[i] - let piece - if (self.strategy === 'rarest') { - const start = next.from + next.offset - const end = next.to - const len = end - start + 1 - const tried = {} - let tries = 0 - const filter = genPieceFilterFunc(start, end, tried) - - while (tries < len) { - piece = self._rarityMap.getRarestPiece(filter) - if (piece < 0) break - if (self._request(wire, piece, false)) return - tried[piece] = true - tries += 1 - } - } else { - for (piece = next.to; piece >= next.from + next.offset; --piece) { - if (!wire.peerPieces.get(piece)) continue - if (self._request(wire, piece, false)) return - } - } - } - - // TODO: wire failed to validate as useful; should we close it? - // probably not, since 'have' and 'bitfield' messages might be coming - } - - function speedRanker () { - const speed = wire.downloadSpeed() || 1 - if (speed > SPEED_THRESHOLD) return () => true - - const secs = Math.max(1, wire.requests.length) * Piece.BLOCK_LENGTH / speed - let tries = 10 - let ptr = 0 - - return index => { - if (!tries || self.bitfield.get(index)) return true - - let missing = self.pieces[index].missing - - for (; ptr < self.wires.length; ptr++) { - const otherWire = self.wires[ptr] - const otherSpeed = otherWire.downloadSpeed() - - if (otherSpeed < SPEED_THRESHOLD) continue - if (otherSpeed <= speed) continue - if (!otherWire.peerPieces.get(index)) continue - if ((missing -= otherSpeed * secs) > 0) continue - - tries-- - return false - } - - return true - } - } - - function shufflePriority (i) { - let last = i - for (let j = i; j < self._selections.length && self._selections[j].priority; j++) { - last = j - } - const tmp = self._selections[i] - self._selections[i] = self._selections[last] - self._selections[last] = tmp - } - - function trySelectWire (hotswap) { - if (wire.requests.length >= maxOutstandingRequests) return true - const rank = speedRanker() - - for (let i = 0; i < self._selections.length; i++) { - const next = self._selections[i] - - let piece - if (self.strategy === 'rarest') { - const start = next.from + next.offset - const end = next.to - const len = end - start + 1 - const tried = {} - let tries = 0 - const filter = genPieceFilterFunc(start, end, tried, rank) - - while (tries < len) { - piece = self._rarityMap.getRarestPiece(filter) - if (piece < 0) break - - while (self._request(wire, piece, self._critical[piece] || hotswap)) { - // body intentionally empty - // request all non-reserved blocks in this piece - } - - if (wire.requests.length < maxOutstandingRequests) { - tried[piece] = true - tries++ - continue - } - - if (next.priority) shufflePriority(i) - return true - } - } else { - for (piece = next.from + next.offset; piece <= next.to; piece++) { - if (!wire.peerPieces.get(piece) || !rank(piece)) continue - - while (self._request(wire, piece, self._critical[piece] || hotswap)) { - // body intentionally empty - // request all non-reserved blocks in piece - } - - if (wire.requests.length < maxOutstandingRequests) continue - - if (next.priority) shufflePriority(i) - return true - } - } - } - - return false - } - } - - /** - * Called periodically to update the choked status of all peers, handling optimistic - * unchoking as described in BEP3. - */ - _rechoke () { - if (!this.ready) return - - // wires in increasing order of quality (pop() gives next best peer) - const wireStack = - this.wires - .map(wire => ({ wire, random: Math.random() })) // insert a random seed for randomizing the sort - .sort((objA, objB) => { - const wireA = objA.wire - const wireB = objB.wire - - // prefer peers that send us data faster - if (wireA.downloadSpeed() !== wireB.downloadSpeed()) { - return wireA.downloadSpeed() - wireB.downloadSpeed() - } - - // then prefer peers that can download data from us faster - if (wireA.uploadSpeed() !== wireB.uploadSpeed()) { - return wireA.uploadSpeed() - wireB.uploadSpeed() - } - - // then prefer already unchoked peers (to minimize fibrillation) - if (wireA.amChoking !== wireB.amChoking) { - return wireA.amChoking ? -1 : 1 // choking < unchoked - } - - // otherwise random order - return objA.random - objB.random - }) - .map(obj => obj.wire) // return array of wires (remove random seed) - - if (this._rechokeOptimisticTime <= 0) { - // clear old optimistic peer, so it can be rechoked normally and then replaced - this._rechokeOptimisticWire = null - } else { - this._rechokeOptimisticTime -= 1 - } - - let numInterestedUnchoked = 0 - // leave one rechoke slot open for optimistic unchoking - while (wireStack.length > 0 && numInterestedUnchoked < this._rechokeNumSlots - 1) { - const wire = wireStack.pop() // next best quality peer - - if (wire.isSeeder || wire === this._rechokeOptimisticWire) { - continue - } - - wire.unchoke() - - // only stop unchoking once we fill the slots with interested peers that will actually download - if (wire.peerInterested) { - numInterestedUnchoked++ - } - } - - // fill optimistic unchoke slot if empty - if (this._rechokeOptimisticWire === null && this._rechokeNumSlots > 0) { - // don't optimistically unchoke uninterested peers - const remaining = wireStack.filter(wire => wire.peerInterested) - - if (remaining.length > 0) { - // select random remaining (not yet unchoked) peer - const newOptimisticPeer = remaining[randomInt(remaining.length)] - - newOptimisticPeer.unchoke() - - this._rechokeOptimisticWire = newOptimisticPeer - - this._rechokeOptimisticTime = RECHOKE_OPTIMISTIC_DURATION - } - } - - // choke the rest - wireStack - .filter(wire => wire !== this._rechokeOptimisticWire) // except the optimistically unchoked peer - .forEach(wire => wire.choke()) - } - - /** - * Attempts to cancel a slow block request from another wire such that the - * given wire may effectively swap out the request for one of its own. - */ - _hotswap (wire, index) { - const speed = wire.downloadSpeed() - if (speed < Piece.BLOCK_LENGTH) return false - if (!this._reservations[index]) return false - - const r = this._reservations[index] - if (!r) { - return false - } - - let minSpeed = Infinity - let minWire - - let i - for (i = 0; i < r.length; i++) { - const otherWire = r[i] - if (!otherWire || otherWire === wire) continue - - const otherSpeed = otherWire.downloadSpeed() - if (otherSpeed >= SPEED_THRESHOLD) continue - if (2 * otherSpeed > speed || otherSpeed > minSpeed) continue - - minWire = otherWire - minSpeed = otherSpeed - } - - if (!minWire) return false - - for (i = 0; i < r.length; i++) { - if (r[i] === minWire) r[i] = null - } - - for (i = 0; i < minWire.requests.length; i++) { - const req = minWire.requests[i] - if (req.piece !== index) continue - - this.pieces[index].cancel((req.offset / Piece.BLOCK_LENGTH) | 0) - } - - this.emit('hotswap', minWire, wire, index) - return true - } - - /** - * Attempts to request a block from the given wire. - */ - _request (wire, index, hotswap) { - const self = this - const numRequests = wire.requests.length - const isWebSeed = wire.type === 'webSeed' - - if (self.bitfield.get(index)) return false - - const maxOutstandingRequests = isWebSeed - ? Math.min( - getPiecePipelineLength(wire, PIPELINE_MAX_DURATION, self.pieceLength), - self.maxWebConns - ) - : getBlockPipelineLength(wire, PIPELINE_MAX_DURATION) - - if (numRequests >= maxOutstandingRequests) return false - // var endGame = (wire.requests.length === 0 && self.store.numMissing < 30) - - const piece = self.pieces[index] - let reservation = isWebSeed ? piece.reserveRemaining() : piece.reserve() - - if (reservation === -1 && hotswap && self._hotswap(wire, index)) { - reservation = isWebSeed ? piece.reserveRemaining() : piece.reserve() - } - if (reservation === -1) return false - - let r = self._reservations[index] - if (!r) r = self._reservations[index] = [] - let i = r.indexOf(null) - if (i === -1) i = r.length - r[i] = wire - - const chunkOffset = piece.chunkOffset(reservation) - const chunkLength = isWebSeed ? piece.chunkLengthRemaining(reservation) : piece.chunkLength(reservation) - - wire.request(index, chunkOffset, chunkLength, function onChunk (err, chunk) { - if (self.destroyed) return - - // TODO: what is this for? - if (!self.ready) return self.once('ready', () => { onChunk(err, chunk) }) - - if (r[i] === wire) r[i] = null - - if (piece !== self.pieces[index]) return onUpdateTick() - - if (err) { - self._debug( - 'error getting piece %s (offset: %s length: %s) from %s: %s', - index, chunkOffset, chunkLength, `${wire.remoteAddress}:${wire.remotePort}`, - err.message - ) - isWebSeed ? piece.cancelRemaining(reservation) : piece.cancel(reservation) - onUpdateTick() - return - } - - self._debug( - 'got piece %s (offset: %s length: %s) from %s', - index, chunkOffset, chunkLength, `${wire.remoteAddress}:${wire.remotePort}` - ) - - if (!piece.set(reservation, chunk, wire)) return onUpdateTick() - - const buf = piece.flush() - - // TODO: might need to set self.pieces[index] = null here since sha1 is async - - sha1(buf, hash => { - if (self.destroyed) return - - if (hash === self._hashes[index]) { - self._debug('piece verified %s', index) - - self.store.put(index, buf, err => { - if (err) { - self._destroy(err) - return - } else { - self.pieces[index] = null - self._markVerified(index) - self.wires.forEach(wire => { - wire.have(index) - }) - } - // We also check `self.destroyed` since `torrent.destroy()` could have been - // called in the `torrent.on('done')` handler, triggered by `_checkDone()`. - if (self._checkDone() && !self.destroyed) self.discovery.complete() - onUpdateTick() - }) - } else { - self.pieces[index] = new Piece(piece.length) - self.emit('warning', new Error(`Piece ${index} failed verification`)) - onUpdateTick() - } - }) - }) - - function onUpdateTick () { - queueMicrotask(() => { self._update() }) - } - - return true - } - - _checkDone () { - if (this.destroyed) return - - // are any new files done? - this.files.forEach(file => { - if (file.done) return - for (let i = file._startPiece; i <= file._endPiece; ++i) { - if (!this.bitfield.get(i)) return - } - file.done = true - file.emit('done') - this._debug(`file done: ${file.name}`) - }) - - // is the torrent done? (if all current selections are satisfied, or there are - // no selections, then torrent is done) - let done = true - - for (const selection of this._selections) { - for (let piece = selection.from; piece <= selection.to; piece++) { - if (!this.bitfield.get(piece)) { - done = false - break - } - } - if (!done) break - } - - if (!this.done && done) { - this.done = true - this._debug(`torrent done: ${this.infoHash}`) - this.emit('done') - } - this._gcSelections() - - return done - } - - load (streams, cb) { - if (this.destroyed) throw new Error('torrent is destroyed') - if (!this.ready) return this.once('ready', () => { this.load(streams, cb) }) - - if (!Array.isArray(streams)) streams = [streams] - if (!cb) cb = noop - - const readable = new MultiStream(streams) - const writable = new ChunkStoreWriteStream(this.store, this.pieceLength) - - pump(readable, writable, err => { - if (err) return cb(err) - this._markAllVerified() - this._checkDone() - cb(null) - }) - } - - createServer (requestListener) { - if (typeof Server !== 'function') throw new Error('node.js-only method') - if (this.destroyed) throw new Error('torrent is destroyed') - const server = new Server(this, requestListener) - this._servers.push(server) - return server - } - - pause () { - if (this.destroyed) return - this._debug('pause') - this.paused = true - } - - resume () { - if (this.destroyed) return - this._debug('resume') - this.paused = false - this._drain() - } - - _debug () { - const args = [].slice.call(arguments) - args[0] = `[${this.client ? this.client._debugId : 'No Client'}] [${this._debugId}] ${args[0]}` - debug(...args) - } - - /** - * Pop a peer off the FIFO queue and connect to it. When _drain() gets called, - * the queue will usually have only one peer in it, except when there are too - * many peers (over `this.maxConns`) in which case they will just sit in the - * queue until another connection closes. - */ - _drain () { - this._debug('_drain numConns %s maxConns %s', this._numConns, this.client.maxConns) - if (typeof net.connect !== 'function' || this.destroyed || this.paused || - this._numConns >= this.client.maxConns) { - return - } - this._debug('drain (%s queued, %s/%s peers)', this._numQueued, this.numPeers, this.client.maxConns) - - const peer = this._queue.shift() - if (!peer) return // queue could be empty - - this._debug('%s connect attempt to %s', peer.type, peer.addr) - - const parts = addrToIPPort(peer.addr) - const opts = { - host: parts[0], - port: parts[1] - } - - if (this.client.utp && peer.type === 'utpOutgoing') { - peer.conn = utp.connect(opts.port, opts.host) - } else { - peer.conn = net.connect(opts) - } - - const conn = peer.conn - - conn.once('connect', () => { peer.onConnect() }) - conn.once('error', err => { peer.destroy(err) }) - peer.startConnectTimeout() - - // When connection closes, attempt reconnect after timeout (with exponential backoff) - conn.on('close', () => { - if (this.destroyed) return - - if (peer.retries >= RECONNECT_WAIT.length) { - if (this.client.utp) { - const newPeer = this._addPeer(peer.addr, 'tcp') - if (newPeer) newPeer.retries = 0 - } else { - this._debug( - 'conn %s closed: will not re-add (max %s attempts)', - peer.addr, RECONNECT_WAIT.length - ) - } - return - } - - const ms = RECONNECT_WAIT[peer.retries] - this._debug( - 'conn %s closed: will re-add to queue in %sms (attempt %s)', - peer.addr, ms, peer.retries + 1 - ) - - const reconnectTimeout = setTimeout(() => { - if (this.destroyed) return - const host = addrToIPPort(peer.addr)[0] - const type = (this.client.utp && this._isIPv4(host)) ? 'utp' : 'tcp' - const newPeer = this._addPeer(peer.addr, type) - if (newPeer) newPeer.retries = peer.retries + 1 - }, ms) - if (reconnectTimeout.unref) reconnectTimeout.unref() - }) - } - - /** - * Returns `true` if string is valid IPv4/6 address. - * @param {string} addr - * @return {boolean} - */ - _validAddr (addr) { - let parts - try { - parts = addrToIPPort(addr) - } catch (e) { - return false - } - const host = parts[0] - const port = parts[1] - return port > 0 && port < 65535 && - !(host === '127.0.0.1' && port === this.client.torrentPort) - } - - /** - * Return `true` if string is a valid IPv4 address. - * @param {string} addr - * @return {boolean} - */ - _isIPv4 (addr) { - const IPv4Pattern = /^((?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])[.]){3}(?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])$/ - return IPv4Pattern.test(addr) - } -} - -function getBlockPipelineLength (wire, duration) { - return 2 + Math.ceil(duration * wire.downloadSpeed() / Piece.BLOCK_LENGTH) -} - -function getPiecePipelineLength (wire, duration, pieceLength) { - return 1 + Math.ceil(duration * wire.downloadSpeed() / pieceLength) -} - -/** - * Returns a random integer in [0,high) - */ -function randomInt (high) { - return Math.random() * high | 0 -} - -function noop () {} - -module.exports = Torrent - - -/***/ }), - -/***/ "./node_modules/webtorrent/lib/webconn.js": -/*!************************************************!*\ - !*** ./node_modules/webtorrent/lib/webconn.js ***! - \************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -/* provided dependency */ var Buffer = __webpack_require__(/*! ./node_modules/buffer/index.js */ "./node_modules/buffer/index.js")["Buffer"]; -const BitField = __webpack_require__(/*! bitfield */ "./node_modules/bitfield/lib/index.js").default -const debug = __webpack_require__(/*! debug */ "./node_modules/debug/src/browser.js")('webtorrent:webconn') -const get = __webpack_require__(/*! simple-get */ "./node_modules/simple-get/index.js") -const ltDontHave = __webpack_require__(/*! lt_donthave */ "./node_modules/lt_donthave/index.js") -const sha1 = __webpack_require__(/*! simple-sha1 */ "./node_modules/simple-sha1/browser.js") -const Wire = __webpack_require__(/*! bittorrent-protocol */ "./node_modules/bittorrent-protocol/index.js") - -const VERSION = __webpack_require__(/*! ../package.json */ "./node_modules/webtorrent/package.json").version - -const SOCKET_TIMEOUT = 60000 -const RETRY_DELAY = 10000 - -/** - * Converts requests for torrent blocks into http range requests. - * @param {string} url web seed url - * @param {Object} torrent - */ -class WebConn extends Wire { - constructor (url, torrent) { - super() - - this.url = url - this.connId = url // Unique id to deduplicate web seeds - this.webPeerId = sha1.sync(url) // Used as the peerId for this fake remote peer - this._torrent = torrent - - this._init() - } - - _init () { - this.setKeepAlive(true) - - this.use(ltDontHave()) - - this.once('handshake', (infoHash, peerId) => { - if (this.destroyed) return - this.handshake(infoHash, this.webPeerId) - const numPieces = this._torrent.pieces.length - const bitfield = new BitField(numPieces) - for (let i = 0; i <= numPieces; i++) { - bitfield.set(i, true) - } - this.bitfield(bitfield) - }) - - this.once('interested', () => { - debug('interested') - this.unchoke() - }) - - this.on('uninterested', () => { debug('uninterested') }) - this.on('choke', () => { debug('choke') }) - this.on('unchoke', () => { debug('unchoke') }) - this.on('bitfield', () => { debug('bitfield') }) - this.lt_donthave.on('donthave', () => { debug('donthave') }) - - this.on('request', (pieceIndex, offset, length, callback) => { - debug('request pieceIndex=%d offset=%d length=%d', pieceIndex, offset, length) - this.httpRequest(pieceIndex, offset, length, (err, data) => { - if (err) { - // Cancel all in progress requests for this piece - this.lt_donthave.donthave(pieceIndex) - - // Wait a little while before saying the webseed has the failed piece again - const retryTimeout = setTimeout(() => { - if (this.destroyed) return - - this.have(pieceIndex) - }, RETRY_DELAY) - if (retryTimeout.unref) retryTimeout.unref() - } - - callback(err, data) - }) - }) - } - - httpRequest (pieceIndex, offset, length, cb) { - const pieceOffset = pieceIndex * this._torrent.pieceLength - const rangeStart = pieceOffset + offset /* offset within whole torrent */ - const rangeEnd = rangeStart + length - 1 - - // Web seed URL format: - // For single-file torrents, make HTTP range requests directly to the web seed URL - // For multi-file torrents, add the torrent folder and file name to the URL - const files = this._torrent.files - let requests - if (files.length <= 1) { - requests = [{ - url: this.url, - start: rangeStart, - end: rangeEnd - }] - } else { - const requestedFiles = files.filter(file => file.offset <= rangeEnd && (file.offset + file.length) > rangeStart) - if (requestedFiles.length < 1) { - return cb(new Error('Could not find file corresponding to web seed range request')) - } - - requests = requestedFiles.map(requestedFile => { - const fileEnd = requestedFile.offset + requestedFile.length - 1 - const url = this.url + - (this.url[this.url.length - 1] === '/' ? '' : '/') + - requestedFile.path - return { - url, - fileOffsetInRange: Math.max(requestedFile.offset - rangeStart, 0), - start: Math.max(rangeStart - requestedFile.offset, 0), - end: Math.min(fileEnd, rangeEnd - requestedFile.offset) - } - }) - } - - // Now make all the HTTP requests we need in order to load this piece - // Usually that's one requests, but sometimes it will be multiple - // Send requests in parallel and wait for them all to come back - let numRequestsSucceeded = 0 - let hasError = false - - let ret - if (requests.length > 1) { - ret = Buffer.alloc(length) - } - - requests.forEach(request => { - const url = request.url - const start = request.start - const end = request.end - debug( - 'Requesting url=%s pieceIndex=%d offset=%d length=%d start=%d end=%d', - url, pieceIndex, offset, length, start, end - ) - const opts = { - url, - method: 'GET', - headers: { - 'user-agent': `WebTorrent/${VERSION} (https://webtorrent.io)`, - range: `bytes=${start}-${end}` - }, - timeout: SOCKET_TIMEOUT - } - function onResponse (res, data) { - if (res.statusCode < 200 || res.statusCode >= 300) { - if (hasError) return - hasError = true - return cb(new Error(`Unexpected HTTP status code ${res.statusCode}`)) - } - debug('Got data of length %d', data.length) - - if (requests.length === 1) { - // Common case: fetch piece in a single HTTP request, return directly - cb(null, data) - } else { - // Rare case: reconstruct multiple HTTP requests across 2+ files into one - // piece buffer - data.copy(ret, request.fileOffsetInRange) - if (++numRequestsSucceeded === requests.length) { - cb(null, ret) - } - } - } - get.concat(opts, (err, res, data) => { - if (hasError) return - if (err) { - // Browsers allow HTTP redirects for simple cross-origin - // requests but not for requests that require preflight. - // Use a simple request to unravel any redirects and get the - // final URL. Retry the original request with the new URL if - // it's different. - // - // This test is imperfect but it's simple and good for common - // cases. It catches all cross-origin cases but matches a few - // same-origin cases too. - if (typeof window === 'undefined' || url.startsWith(`${window.location.origin}/`)) { - hasError = true - return cb(err) - } - - return get.head(url, (errHead, res) => { - if (hasError) return - if (errHead) { - hasError = true - return cb(errHead) - } - if (res.statusCode < 200 || res.statusCode >= 300) { - hasError = true - return cb(new Error(`Unexpected HTTP status code ${res.statusCode}`)) - } - if (res.url === url) { - hasError = true - return cb(err) - } - - opts.url = res.url - get.concat(opts, (err, res, data) => { - if (hasError) return - if (err) { - hasError = true - return cb(err) - } - onResponse(res, data) - }) - }) - } - onResponse(res, data) - }) - }) - } - - destroy () { - super.destroy() - this._torrent = null - } -} - -module.exports = WebConn - - -/***/ }), - -/***/ "./node_modules/webtorrent/package.json": -/*!**********************************************!*\ - !*** ./node_modules/webtorrent/package.json ***! - \**********************************************/ -/***/ ((module) => { - -"use strict"; -module.exports = JSON.parse('{"name":"webtorrent","description":"Streaming torrent client","version":"1.5.2","author":{"name":"WebTorrent LLC","email":"feross@webtorrent.io","url":"https://webtorrent.io"},"browser":{"./lib/server.js":false,"./lib/conn-pool.js":false,"./lib/utp.js":false,"bittorrent-dht/client":false,"fs":false,"fs-chunk-store":"memory-chunk-store","load-ip-set":false,"net":false,"os":false,"ut_pex":false},"browserify":{"transform":["package-json-versionify"]},"bugs":{"url":"https://github.com/webtorrent/webtorrent/issues"},"chromeapp":{"./lib/utp.js":false,"fs-chunk-store":"memory-chunk-store","http":"http-node","load-ip-set":false,"net":"chrome-net","os":false},"dependencies":{"addr-to-ip-port":"^1.5.4","bitfield":"^4.0.0","bittorrent-dht":"^10.0.2","bittorrent-protocol":"^3.4.3","cache-chunk-store":"^3.2.2","chrome-net":"^3.3.4","chunk-store-stream":"^4.3.0","cpus":"^1.0.3","create-torrent":"^5.0.1","debug":"^4.3.2","end-of-stream":"^1.4.4","escape-html":"^1.0.3","fs-chunk-store":"^2.0.3","http-node":"github:feross/http-node#webtorrent","immediate-chunk-store":"^2.2.0","load-ip-set":"^2.2.1","lt_donthave":"^1.0.1","memory-chunk-store":"^1.3.5","mime":"^2.5.2","multistream":"^4.1.0","package-json-versionify":"^1.0.4","parse-torrent":"^9.1.4","pump":"^3.0.0","queue-microtask":"^1.2.3","random-iterate":"^1.0.1","randombytes":"^2.1.0","range-parser":"^1.2.1","readable-stream":"^3.6.0","render-media":"^4.1.0","run-parallel":"^1.2.0","run-parallel-limit":"^1.1.0","simple-concat":"^1.0.1","simple-get":"^4.0.0","simple-peer":"^9.11.0","simple-sha1":"^3.1.0","speed-limiter":"^1.0.2","speedometer":"^1.1.0","stream-to-blob":"^2.0.1","stream-to-blob-url":"^3.0.2","stream-with-known-length-to-buffer":"^1.0.4","torrent-discovery":"^9.4.4","torrent-piece":"^2.0.1","unordered-array-remove":"^1.0.2","ut_metadata":"^3.5.2","ut_pex":"^3.0.2"},"devDependencies":{"@webtorrent/semantic-release-config":"1.0.6","airtap":"4.0.3","airtap-manual":"1.0.0","airtap-sauce":"1.1.2","babel-minify":"0.5.1","bittorrent-tracker":"9.17.4","browserify":"17.0.0","disc":"1.3.3","finalhandler":"1.1.2","network-address":"1.1.2","run-series":"1.1.9","semantic-release":"17.4.5","serve-static":"1.14.1","standard":"*","tape":"5.3.1","webtorrent-fixtures":"1.7.5"},"optionalDependencies":{"utp-native":"^2.5.3"},"engines":{"node":">=12"},"funding":[{"type":"github","url":"https://github.com/sponsors/feross"},{"type":"patreon","url":"https://www.patreon.com/feross"},{"type":"consulting","url":"https://feross.org/support"}],"homepage":"https://webtorrent.io","keywords":["bittorrent","bittorrent client","download","mad science","p2p","peer-to-peer","peers","streaming","swarm","torrent","web torrent","webrtc","webrtc data","webtorrent"],"license":"MIT","main":"index.js","repository":{"type":"git","url":"git://github.com/webtorrent/webtorrent.git"},"scripts":{"build":"npm run build-js && npm run build-js-worker && npm run build-chromeapp","build-chromeapp":"browserify --browser-field=chromeapp --standalone WebTorrent . | minify --mangle=false > webtorrent.chromeapp.js","build-chromeapp-debug":"browserify --browser-field=chromeapp --standalone WebTorrent . > webtorrent.chromeapp.js","build-js":"browserify --standalone WebTorrent . | minify --mangle=false > webtorrent.min.js","build-js-worker":"browserify ./lib/worker.js | minify --mangle=false > sw.min.js","build-js-debug":"browserify --standalone WebTorrent . > webtorrent.debug.js","build-js-worker-debug":"browserify ./lib/worker.js > sw.debug.js","prepublishOnly":"npm run build && npm run update-authors","preversion":"npm run build && npm run update-authors","size":"npm run size-js && npm run size-disc","size-disc":"browserify --full-paths . | discify --open","size-js":"npm run build && cat webtorrent.min.js | gzip | wc -c","test":"standard && npm run test-node && npm run test-browser","test-browser":"airtap --concurrency 1 -- test/*.js test/browser/*.js","test-browser-local":"airtap --preset local -- test/*.js test/browser/*.js","test-node":"tape test/*.js test/node/*.js","update-authors":"./scripts/update-authors.sh"},"standard":{"ignore":["webtorrent.min.js","sw.min.js","webtorrent.chromeapp.js"]},"renovate":{"extends":["github>webtorrent/renovate-config"],"rangeStrategy":"bump"},"release":{"extends":"@webtorrent/semantic-release-config"}}'); - -/***/ }), - -/***/ "./node_modules/which-typed-array/index.js": -/*!*************************************************!*\ - !*** ./node_modules/which-typed-array/index.js ***! - \*************************************************/ -/***/ ((module, __unused_webpack_exports, __webpack_require__) => { - -"use strict"; - - -var forEach = __webpack_require__(/*! foreach */ "./node_modules/foreach/index.js"); -var availableTypedArrays = __webpack_require__(/*! available-typed-arrays */ "./node_modules/available-typed-arrays/index.js"); -var callBound = __webpack_require__(/*! call-bind/callBound */ "./node_modules/call-bind/callBound.js"); - -var $toString = callBound('Object.prototype.toString'); -var hasSymbols = __webpack_require__(/*! has-symbols */ "./node_modules/has-symbols/index.js")(); -var hasToStringTag = hasSymbols && typeof Symbol.toStringTag === 'symbol'; - -var typedArrays = availableTypedArrays(); - -var $slice = callBound('String.prototype.slice'); -var toStrTags = {}; -var gOPD = __webpack_require__(/*! es-abstract/helpers/getOwnPropertyDescriptor */ "./node_modules/es-abstract/helpers/getOwnPropertyDescriptor.js"); -var getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof'); -if (hasToStringTag && gOPD && getPrototypeOf) { - forEach(typedArrays, function (typedArray) { - if (typeof __webpack_require__.g[typedArray] === 'function') { - var arr = new __webpack_require__.g[typedArray](); - if (!(Symbol.toStringTag in arr)) { - throw new EvalError('this engine has support for Symbol.toStringTag, but ' + typedArray + ' does not have the property! Please report this.'); - } - var proto = getPrototypeOf(arr); - var descriptor = gOPD(proto, Symbol.toStringTag); - if (!descriptor) { - var superProto = getPrototypeOf(proto); - descriptor = gOPD(superProto, Symbol.toStringTag); - } - toStrTags[typedArray] = descriptor.get; - } - }); -} - -var tryTypedArrays = function tryAllTypedArrays(value) { - var foundName = false; - forEach(toStrTags, function (getter, typedArray) { - if (!foundName) { - try { - var name = getter.call(value); - if (name === typedArray) { - foundName = name; - } - } catch (e) {} - } - }); - return foundName; -}; - -var isTypedArray = __webpack_require__(/*! is-typed-array */ "./node_modules/is-typed-array/index.js"); - -module.exports = function whichTypedArray(value) { - if (!isTypedArray(value)) { return false; } - if (!hasToStringTag) { return $slice($toString(value), 8, -1); } - return tryTypedArrays(value); -}; - - -/***/ }), - -/***/ "./node_modules/wrappy/wrappy.js": -/*!***************************************!*\ - !*** ./node_modules/wrappy/wrappy.js ***! - \***************************************/ -/***/ ((module) => { - -// Returns a wrapper function that returns a wrapped callback -// The wrapper function should do some stuff, and return a -// presumably different callback function. -// This makes sure that own properties are retained, so that -// decorations and such are not lost along the way. -module.exports = wrappy -function wrappy (fn, cb) { - if (fn && cb) return wrappy(fn)(cb) - - if (typeof fn !== 'function') - throw new TypeError('need wrapper function') - - Object.keys(fn).forEach(function (k) { - wrapper[k] = fn[k] - }) - - return wrapper - - function wrapper() { - var args = new Array(arguments.length) - for (var i = 0; i < args.length; i++) { - args[i] = arguments[i] - } - var ret = fn.apply(this, args) - var cb = args[args.length-1] - if (typeof ret === 'function' && ret !== cb) { - Object.keys(cb).forEach(function (k) { - ret[k] = cb[k] - }) - } - return ret - } -} - - -/***/ }), - -/***/ "./node_modules/xtend/immutable.js": -/*!*****************************************!*\ - !*** ./node_modules/xtend/immutable.js ***! - \*****************************************/ -/***/ ((module) => { - -module.exports = extend - -var hasOwnProperty = Object.prototype.hasOwnProperty; - -function extend() { - var target = {} - - for (var i = 0; i < arguments.length; i++) { - var source = arguments[i] - - for (var key in source) { - if (hasOwnProperty.call(source, key)) { - target[key] = source[key] - } - } - } - - return target -} - - -/***/ }), - -/***/ "anitomyscript": -/*!********************************!*\ - !*** external "anitomyscript" ***! - \********************************/ -/***/ ((module) => { - -"use strict"; -module.exports = anitomyscript; - -/***/ }), - -/***/ "halfmoon": -/*!***************************!*\ - !*** external "halfmoon" ***! - \***************************/ -/***/ ((module) => { - -"use strict"; -module.exports = halfmoon; - -/***/ }), - -/***/ "?d546": -/*!************************!*\ - !*** buffer (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?5a06": -/*!*******************************!*\ - !*** ./common-node (ignored) ***! - \*******************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?ed7a": -/*!*******************************************!*\ - !*** ./lib/client/http-tracker (ignored) ***! - \*******************************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?5c78": -/*!******************************************!*\ - !*** ./lib/client/udp-tracker (ignored) ***! - \******************************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?8131": -/*!************************!*\ - !*** buffer (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?3fc0": -/*!************************!*\ - !*** crypto (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?4068": -/*!************************!*\ - !*** buffer (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?3b18": -/*!*****************************!*\ - !*** ./get-files (ignored) ***! - \*****************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?f12c": -/*!*************************!*\ - !*** is-file (ignored) ***! - \*************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?e7e4": -/*!************************!*\ - !*** buffer (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?7bec": -/*!************************!*\ - !*** buffer (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?0aec": -/*!************************!*\ - !*** buffer (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?8539": -/*!********************!*\ - !*** fs (ignored) ***! - \********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?fbf1": -/*!************************!*\ - !*** buffer (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?7874": -/*!********************!*\ - !*** fs (ignored) ***! - \********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?ed1b": -/*!**********************!*\ - !*** util (ignored) ***! - \**********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?d17e": -/*!**********************!*\ - !*** util (ignored) ***! - \**********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?45bd": -/*!*************************************!*\ - !*** decompress-response (ignored) ***! - \*************************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?c33b": -/*!********************!*\ - !*** ws (ignored) ***! - \********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?42e5": -/*!***************************************!*\ - !*** bittorrent-dht/client (ignored) ***! - \***************************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?72f0": -/*!********************************!*\ - !*** bittorrent-lsd (ignored) ***! - \********************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?ea49": -/*!**************************!*\ - !*** ./server (ignored) ***! - \**************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?d41a": -/*!***********************!*\ - !*** ./utp (ignored) ***! - \***********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?c172": -/*!********************!*\ - !*** fs (ignored) ***! - \********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?c362": -/*!*********************!*\ - !*** net (ignored) ***! - \*********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?5efe": -/*!********************!*\ - !*** os (ignored) ***! - \********************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?6dbd": -/*!************************!*\ - !*** ut_pex (ignored) ***! - \************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?6e41": -/*!*********************************!*\ - !*** ./lib/conn-pool (ignored) ***! - \*********************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?4b99": -/*!***************************************!*\ - !*** bittorrent-dht/client (ignored) ***! - \***************************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }), - -/***/ "?ae1e": -/*!*****************************!*\ - !*** load-ip-set (ignored) ***! - \*****************************/ -/***/ (() => { - -/* (ignored) */ - -/***/ }) - -/******/ }); -/************************************************************************/ -/******/ // The module cache -/******/ var __webpack_module_cache__ = {}; -/******/ -/******/ // The require function -/******/ function __webpack_require__(moduleId) { -/******/ // Check if module is in cache -/******/ var cachedModule = __webpack_module_cache__[moduleId]; -/******/ if (cachedModule !== undefined) { -/******/ return cachedModule.exports; -/******/ } -/******/ // Create a new module (and put it into the cache) -/******/ var module = __webpack_module_cache__[moduleId] = { -/******/ id: moduleId, -/******/ loaded: false, -/******/ exports: {} -/******/ }; -/******/ -/******/ // Execute the module function -/******/ __webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__); -/******/ -/******/ // Flag the module as loaded -/******/ module.loaded = true; -/******/ -/******/ // Return the exports of the module -/******/ return module.exports; -/******/ } -/******/ -/************************************************************************/ -/******/ /* webpack/runtime/compat get default export */ -/******/ (() => { -/******/ // getDefaultExport function for compatibility with non-harmony modules -/******/ __webpack_require__.n = (module) => { -/******/ var getter = module && module.__esModule ? -/******/ () => (module['default']) : -/******/ () => (module); -/******/ __webpack_require__.d(getter, { a: getter }); -/******/ return getter; -/******/ }; -/******/ })(); -/******/ -/******/ /* webpack/runtime/define property getters */ -/******/ (() => { -/******/ // define getter functions for harmony exports -/******/ __webpack_require__.d = (exports, definition) => { -/******/ for(var key in definition) { -/******/ if(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) { -/******/ Object.defineProperty(exports, key, { enumerable: true, get: definition[key] }); -/******/ } -/******/ } -/******/ }; -/******/ })(); -/******/ -/******/ /* webpack/runtime/global */ -/******/ (() => { -/******/ __webpack_require__.g = (function() { -/******/ if (typeof globalThis === 'object') return globalThis; -/******/ try { -/******/ return this || new Function('return this')(); -/******/ } catch (e) { -/******/ if (typeof window === 'object') return window; -/******/ } -/******/ })(); -/******/ })(); -/******/ -/******/ /* webpack/runtime/hasOwnProperty shorthand */ -/******/ (() => { -/******/ __webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop)) -/******/ })(); -/******/ -/******/ /* webpack/runtime/make namespace object */ -/******/ (() => { -/******/ // define __esModule on exports -/******/ __webpack_require__.r = (exports) => { -/******/ if(typeof Symbol !== 'undefined' && Symbol.toStringTag) { -/******/ Object.defineProperty(exports, Symbol.toStringTag, { value: 'Module' }); -/******/ } -/******/ Object.defineProperty(exports, '__esModule', { value: true }); -/******/ }; -/******/ })(); -/******/ -/******/ /* webpack/runtime/node module decorator */ -/******/ (() => { -/******/ __webpack_require__.nmd = (module) => { -/******/ module.paths = []; -/******/ if (!module.children) module.children = []; -/******/ return module; -/******/ }; -/******/ })(); -/******/ -/************************************************************************/ -/******/ -/******/ // startup -/******/ // Load entry module and return exports -/******/ // This entry module is referenced by other modules so it can't be inlined -/******/ var __webpack_exports__ = __webpack_require__("./app/js/main.js"); -/******/ -/******/ })() -; +/*! For license information please see bundle.js.LICENSE.txt */ +(()=>{var t={2884:t=>{const e=/^\[?([^\]]+)]?:(\d+)$/;let i=new Map;t.exports=function(t){if(1e5===i.size&&i.clear(),!i.has(t)){const r=e.exec(t);if(!r)throw new Error(`invalid addr: ${t}`);i.set(t,[r[1],Number(r[2])])}return i.get(t)}},9809:(t,e,i)=>{"use strict";const r=e;r.bignum=i(4590),r.define=i(2500).define,r.base=i(1979),r.constants=i(6826),r.decoders=i(8307),r.encoders=i(6579)},2500:(t,e,i)=>{"use strict";const r=i(6579),n=i(8307),s=i(5717);function o(t,e){this.name=t,this.body=e,this.decoders={},this.encoders={}}e.define=function(t,e){return new o(t,e)},o.prototype._createNamed=function(t){const e=this.name;function i(t){this._initNamed(t,e)}return s(i,t),i.prototype._initNamed=function(e,i){t.call(this,e,i)},new i(this)},o.prototype._getDecoder=function(t){return t=t||"der",this.decoders.hasOwnProperty(t)||(this.decoders[t]=this._createNamed(n[t])),this.decoders[t]},o.prototype.decode=function(t,e,i){return this._getDecoder(e).decode(t,i)},o.prototype._getEncoder=function(t){return t=t||"der",this.encoders.hasOwnProperty(t)||(this.encoders[t]=this._createNamed(r[t])),this.encoders[t]},o.prototype.encode=function(t,e,i){return this._getEncoder(e).encode(t,i)}},6625:(t,e,i)=>{"use strict";const r=i(5717),n=i(8465).b,s=i(2399).Buffer;function o(t,e){n.call(this,e),s.isBuffer(t)?(this.base=t,this.offset=0,this.length=t.length):this.error("Input not Buffer")}function a(t,e){if(Array.isArray(t))this.length=0,this.value=t.map((function(t){return a.isEncoderBuffer(t)||(t=new a(t,e)),this.length+=t.length,t}),this);else if("number"==typeof t){if(!(0<=t&&t<=255))return e.error("non-byte EncoderBuffer value");this.value=t,this.length=1}else if("string"==typeof t)this.value=t,this.length=s.byteLength(t);else{if(!s.isBuffer(t))return e.error("Unsupported type: "+typeof t);this.value=t,this.length=t.length}}r(o,n),e.C=o,o.isDecoderBuffer=function(t){return t instanceof o||"object"==typeof t&&s.isBuffer(t.base)&&"DecoderBuffer"===t.constructor.name&&"number"==typeof t.offset&&"number"==typeof t.length&&"function"==typeof t.save&&"function"==typeof t.restore&&"function"==typeof t.isEmpty&&"function"==typeof t.readUInt8&&"function"==typeof t.skip&&"function"==typeof t.raw},o.prototype.save=function(){return{offset:this.offset,reporter:n.prototype.save.call(this)}},o.prototype.restore=function(t){const e=new o(this.base);return e.offset=t.offset,e.length=this.offset,this.offset=t.offset,n.prototype.restore.call(this,t.reporter),e},o.prototype.isEmpty=function(){return this.offset===this.length},o.prototype.readUInt8=function(t){return this.offset+1<=this.length?this.base.readUInt8(this.offset++,!0):this.error(t||"DecoderBuffer overrun")},o.prototype.skip=function(t,e){if(!(this.offset+t<=this.length))return this.error(e||"DecoderBuffer overrun");const i=new o(this.base);return i._reporterState=this._reporterState,i.offset=this.offset,i.length=this.offset+t,this.offset+=t,i},o.prototype.raw=function(t){return this.base.slice(t?t.offset:this.offset,this.length)},e.R=a,a.isEncoderBuffer=function(t){return t instanceof a||"object"==typeof t&&"EncoderBuffer"===t.constructor.name&&"number"==typeof t.length&&"function"==typeof t.join},a.prototype.join=function(t,e){return t||(t=s.alloc(this.length)),e||(e=0),0===this.length||(Array.isArray(this.value)?this.value.forEach((function(i){i.join(t,e),e+=i.length})):("number"==typeof this.value?t[e]=this.value:"string"==typeof this.value?t.write(this.value,e):s.isBuffer(this.value)&&this.value.copy(t,e),e+=this.length)),t}},1979:(t,e,i)=>{"use strict";const r=e;r.Reporter=i(8465).b,r.DecoderBuffer=i(6625).C,r.EncoderBuffer=i(6625).R,r.Node=i(1949)},1949:(t,e,i)=>{"use strict";const r=i(8465).b,n=i(6625).R,s=i(6625).C,o=i(9746),a=["seq","seqof","set","setof","objid","bool","gentime","utctime","null_","enum","int","objDesc","bitstr","bmpstr","charstr","genstr","graphstr","ia5str","iso646str","numstr","octstr","printstr","t61str","unistr","utf8str","videostr"],h=["key","obj","use","optional","explicit","implicit","def","choice","any","contains"].concat(a);function u(t,e,i){const r={};this._baseState=r,r.name=i,r.enc=t,r.parent=e||null,r.children=null,r.tag=null,r.args=null,r.reverseArgs=null,r.choice=null,r.optional=!1,r.any=!1,r.obj=!1,r.use=null,r.useDecoder=null,r.key=null,r.default=null,r.explicit=null,r.implicit=null,r.contains=null,r.parent||(r.children=[],this._wrap())}t.exports=u;const l=["enc","parent","children","tag","args","reverseArgs","choice","optional","any","obj","use","alteredUse","key","default","explicit","implicit","contains"];u.prototype.clone=function(){const t=this._baseState,e={};l.forEach((function(i){e[i]=t[i]}));const i=new this.constructor(e.parent);return i._baseState=e,i},u.prototype._wrap=function(){const t=this._baseState;h.forEach((function(e){this[e]=function(){const i=new this.constructor(this);return t.children.push(i),i[e].apply(i,arguments)}}),this)},u.prototype._init=function(t){const e=this._baseState;o(null===e.parent),t.call(this),e.children=e.children.filter((function(t){return t._baseState.parent===this}),this),o.equal(e.children.length,1,"Root node can have only one child")},u.prototype._useArgs=function(t){const e=this._baseState,i=t.filter((function(t){return t instanceof this.constructor}),this);t=t.filter((function(t){return!(t instanceof this.constructor)}),this),0!==i.length&&(o(null===e.children),e.children=i,i.forEach((function(t){t._baseState.parent=this}),this)),0!==t.length&&(o(null===e.args),e.args=t,e.reverseArgs=t.map((function(t){if("object"!=typeof t||t.constructor!==Object)return t;const e={};return Object.keys(t).forEach((function(i){i==(0|i)&&(i|=0);const r=t[i];e[r]=i})),e})))},["_peekTag","_decodeTag","_use","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeInt","_decodeBool","_decodeList","_encodeComposite","_encodeStr","_encodeObjid","_encodeTime","_encodeNull","_encodeInt","_encodeBool"].forEach((function(t){u.prototype[t]=function(){const e=this._baseState;throw new Error(t+" not implemented for encoding: "+e.enc)}})),a.forEach((function(t){u.prototype[t]=function(){const e=this._baseState,i=Array.prototype.slice.call(arguments);return o(null===e.tag),e.tag=t,this._useArgs(i),this}})),u.prototype.use=function(t){o(t);const e=this._baseState;return o(null===e.use),e.use=t,this},u.prototype.optional=function(){return this._baseState.optional=!0,this},u.prototype.def=function(t){const e=this._baseState;return o(null===e.default),e.default=t,e.optional=!0,this},u.prototype.explicit=function(t){const e=this._baseState;return o(null===e.explicit&&null===e.implicit),e.explicit=t,this},u.prototype.implicit=function(t){const e=this._baseState;return o(null===e.explicit&&null===e.implicit),e.implicit=t,this},u.prototype.obj=function(){const t=this._baseState,e=Array.prototype.slice.call(arguments);return t.obj=!0,0!==e.length&&this._useArgs(e),this},u.prototype.key=function(t){const e=this._baseState;return o(null===e.key),e.key=t,this},u.prototype.any=function(){return this._baseState.any=!0,this},u.prototype.choice=function(t){const e=this._baseState;return o(null===e.choice),e.choice=t,this._useArgs(Object.keys(t).map((function(e){return t[e]}))),this},u.prototype.contains=function(t){const e=this._baseState;return o(null===e.use),e.contains=t,this},u.prototype._decode=function(t,e){const i=this._baseState;if(null===i.parent)return t.wrapResult(i.children[0]._decode(t,e));let r,n=i.default,o=!0,a=null;if(null!==i.key&&(a=t.enterKey(i.key)),i.optional){let r=null;if(null!==i.explicit?r=i.explicit:null!==i.implicit?r=i.implicit:null!==i.tag&&(r=i.tag),null!==r||i.any){if(o=this._peekTag(t,r,i.any),t.isError(o))return o}else{const r=t.save();try{null===i.choice?this._decodeGeneric(i.tag,t,e):this._decodeChoice(t,e),o=!0}catch(t){o=!1}t.restore(r)}}if(i.obj&&o&&(r=t.enterObject()),o){if(null!==i.explicit){const e=this._decodeTag(t,i.explicit);if(t.isError(e))return e;t=e}const r=t.offset;if(null===i.use&&null===i.choice){let e;i.any&&(e=t.save());const r=this._decodeTag(t,null!==i.implicit?i.implicit:i.tag,i.any);if(t.isError(r))return r;i.any?n=t.raw(e):t=r}if(e&&e.track&&null!==i.tag&&e.track(t.path(),r,t.length,"tagged"),e&&e.track&&null!==i.tag&&e.track(t.path(),t.offset,t.length,"content"),i.any||(n=null===i.choice?this._decodeGeneric(i.tag,t,e):this._decodeChoice(t,e)),t.isError(n))return n;if(i.any||null!==i.choice||null===i.children||i.children.forEach((function(i){i._decode(t,e)})),i.contains&&("octstr"===i.tag||"bitstr"===i.tag)){const r=new s(n);n=this._getUse(i.contains,t._reporterState.obj)._decode(r,e)}}return i.obj&&o&&(n=t.leaveObject(r)),null===i.key||null===n&&!0!==o?null!==a&&t.exitKey(a):t.leaveKey(a,i.key,n),n},u.prototype._decodeGeneric=function(t,e,i){const r=this._baseState;return"seq"===t||"set"===t?null:"seqof"===t||"setof"===t?this._decodeList(e,t,r.args[0],i):/str$/.test(t)?this._decodeStr(e,t,i):"objid"===t&&r.args?this._decodeObjid(e,r.args[0],r.args[1],i):"objid"===t?this._decodeObjid(e,null,null,i):"gentime"===t||"utctime"===t?this._decodeTime(e,t,i):"null_"===t?this._decodeNull(e,i):"bool"===t?this._decodeBool(e,i):"objDesc"===t?this._decodeStr(e,t,i):"int"===t||"enum"===t?this._decodeInt(e,r.args&&r.args[0],i):null!==r.use?this._getUse(r.use,e._reporterState.obj)._decode(e,i):e.error("unknown tag: "+t)},u.prototype._getUse=function(t,e){const i=this._baseState;return i.useDecoder=this._use(t,e),o(null===i.useDecoder._baseState.parent),i.useDecoder=i.useDecoder._baseState.children[0],i.implicit!==i.useDecoder._baseState.implicit&&(i.useDecoder=i.useDecoder.clone(),i.useDecoder._baseState.implicit=i.implicit),i.useDecoder},u.prototype._decodeChoice=function(t,e){const i=this._baseState;let r=null,n=!1;return Object.keys(i.choice).some((function(s){const o=t.save(),a=i.choice[s];try{const i=a._decode(t,e);if(t.isError(i))return!1;r={type:s,value:i},n=!0}catch(e){return t.restore(o),!1}return!0}),this),n?r:t.error("Choice not matched")},u.prototype._createEncoderBuffer=function(t){return new n(t,this.reporter)},u.prototype._encode=function(t,e,i){const r=this._baseState;if(null!==r.default&&r.default===t)return;const n=this._encodeValue(t,e,i);return void 0===n||this._skipDefault(n,e,i)?void 0:n},u.prototype._encodeValue=function(t,e,i){const n=this._baseState;if(null===n.parent)return n.children[0]._encode(t,e||new r);let s=null;if(this.reporter=e,n.optional&&void 0===t){if(null===n.default)return;t=n.default}let o=null,a=!1;if(n.any)s=this._createEncoderBuffer(t);else if(n.choice)s=this._encodeChoice(t,e);else if(n.contains)o=this._getUse(n.contains,i)._encode(t,e),a=!0;else if(n.children)o=n.children.map((function(i){if("null_"===i._baseState.tag)return i._encode(null,e,t);if(null===i._baseState.key)return e.error("Child should have a key");const r=e.enterKey(i._baseState.key);if("object"!=typeof t)return e.error("Child expected, but input is not object");const n=i._encode(t[i._baseState.key],e,t);return e.leaveKey(r),n}),this).filter((function(t){return t})),o=this._createEncoderBuffer(o);else if("seqof"===n.tag||"setof"===n.tag){if(!n.args||1!==n.args.length)return e.error("Too many args for : "+n.tag);if(!Array.isArray(t))return e.error("seqof/setof, but data is not Array");const i=this.clone();i._baseState.implicit=null,o=this._createEncoderBuffer(t.map((function(i){const r=this._baseState;return this._getUse(r.args[0],t)._encode(i,e)}),i))}else null!==n.use?s=this._getUse(n.use,i)._encode(t,e):(o=this._encodePrimitive(n.tag,t),a=!0);if(!n.any&&null===n.choice){const t=null!==n.implicit?n.implicit:n.tag,i=null===n.implicit?"universal":"context";null===t?null===n.use&&e.error("Tag could be omitted only for .use()"):null===n.use&&(s=this._encodeComposite(t,a,i,o))}return null!==n.explicit&&(s=this._encodeComposite(n.explicit,!1,"context",s)),s},u.prototype._encodeChoice=function(t,e){const i=this._baseState,r=i.choice[t.type];return r||o(!1,t.type+" not found in "+JSON.stringify(Object.keys(i.choice))),r._encode(t.value,e)},u.prototype._encodePrimitive=function(t,e){const i=this._baseState;if(/str$/.test(t))return this._encodeStr(e,t);if("objid"===t&&i.args)return this._encodeObjid(e,i.reverseArgs[0],i.args[1]);if("objid"===t)return this._encodeObjid(e,null,null);if("gentime"===t||"utctime"===t)return this._encodeTime(e,t);if("null_"===t)return this._encodeNull();if("int"===t||"enum"===t)return this._encodeInt(e,i.args&&i.reverseArgs[0]);if("bool"===t)return this._encodeBool(e);if("objDesc"===t)return this._encodeStr(e,t);throw new Error("Unsupported tag: "+t)},u.prototype._isNumstr=function(t){return/^[0-9 ]*$/.test(t)},u.prototype._isPrintstr=function(t){return/^[A-Za-z0-9 '()+,-./:=?]*$/.test(t)}},8465:(t,e,i)=>{"use strict";const r=i(5717);function n(t){this._reporterState={obj:null,path:[],options:t||{},errors:[]}}function s(t,e){this.path=t,this.rethrow(e)}e.b=n,n.prototype.isError=function(t){return t instanceof s},n.prototype.save=function(){const t=this._reporterState;return{obj:t.obj,pathLen:t.path.length}},n.prototype.restore=function(t){const e=this._reporterState;e.obj=t.obj,e.path=e.path.slice(0,t.pathLen)},n.prototype.enterKey=function(t){return this._reporterState.path.push(t)},n.prototype.exitKey=function(t){const e=this._reporterState;e.path=e.path.slice(0,t-1)},n.prototype.leaveKey=function(t,e,i){const r=this._reporterState;this.exitKey(t),null!==r.obj&&(r.obj[e]=i)},n.prototype.path=function(){return this._reporterState.path.join("/")},n.prototype.enterObject=function(){const t=this._reporterState,e=t.obj;return t.obj={},e},n.prototype.leaveObject=function(t){const e=this._reporterState,i=e.obj;return e.obj=t,i},n.prototype.error=function(t){let e;const i=this._reporterState,r=t instanceof s;if(e=r?t:new s(i.path.map((function(t){return"["+JSON.stringify(t)+"]"})).join(""),t.message||t,t.stack),!i.options.partial)throw e;return r||i.errors.push(e),e},n.prototype.wrapResult=function(t){const e=this._reporterState;return e.options.partial?{result:this.isError(t)?null:t,errors:e.errors}:t},r(s,Error),s.prototype.rethrow=function(t){if(this.message=t+" at: "+(this.path||"(shallow)"),Error.captureStackTrace&&Error.captureStackTrace(this,s),!this.stack)try{throw new Error(this.message)}catch(t){this.stack=t.stack}return this}},160:(t,e)=>{"use strict";function i(t){const e={};return Object.keys(t).forEach((function(i){(0|i)==i&&(i|=0);const r=t[i];e[r]=i})),e}e.tagClass={0:"universal",1:"application",2:"context",3:"private"},e.tagClassByName=i(e.tagClass),e.tag={0:"end",1:"bool",2:"int",3:"bitstr",4:"octstr",5:"null_",6:"objid",7:"objDesc",8:"external",9:"real",10:"enum",11:"embed",12:"utf8str",13:"relativeOid",16:"seq",17:"set",18:"numstr",19:"printstr",20:"t61str",21:"videostr",22:"ia5str",23:"utctime",24:"gentime",25:"graphstr",26:"iso646str",27:"genstr",28:"unistr",29:"charstr",30:"bmpstr"},e.tagByName=i(e.tag)},6826:(t,e,i)=>{"use strict";const r=e;r._reverse=function(t){const e={};return Object.keys(t).forEach((function(i){(0|i)==i&&(i|=0);const r=t[i];e[r]=i})),e},r.der=i(160)},1671:(t,e,i)=>{"use strict";const r=i(5717),n=i(4590),s=i(6625).C,o=i(1949),a=i(160);function h(t){this.enc="der",this.name=t.name,this.entity=t,this.tree=new u,this.tree._init(t.body)}function u(t){o.call(this,"der",t)}function l(t,e){let i=t.readUInt8(e);if(t.isError(i))return i;const r=a.tagClass[i>>6],n=0==(32&i);if(31==(31&i)){let r=i;for(i=0;128==(128&r);){if(r=t.readUInt8(e),t.isError(r))return r;i<<=7,i|=127&r}}else i&=31;return{cls:r,primitive:n,tag:i,tagStr:a.tag[i]}}function c(t,e,i){let r=t.readUInt8(i);if(t.isError(r))return r;if(!e&&128===r)return null;if(0==(128&r))return r;const n=127&r;if(n>4)return t.error("length octect is too long");r=0;for(let e=0;e{"use strict";const r=e;r.der=i(1671),r.pem=i(9631)},9631:(t,e,i)=>{"use strict";const r=i(5717),n=i(2399).Buffer,s=i(1671);function o(t){s.call(this,t),this.enc="pem"}r(o,s),t.exports=o,o.prototype.decode=function(t,e){const i=t.toString().split(/[\r\n]+/g),r=e.label.toUpperCase(),o=/^-----(BEGIN|END) ([^-]+)-----$/;let a=-1,h=-1;for(let t=0;t{"use strict";const r=i(5717),n=i(2399).Buffer,s=i(1949),o=i(160);function a(t){this.enc="der",this.name=t.name,this.entity=t,this.tree=new h,this.tree._init(t.body)}function h(t){s.call(this,"der",t)}function u(t){return t<10?"0"+t:t}t.exports=a,a.prototype.encode=function(t,e){return this.tree._encode(t,e).join()},r(h,s),h.prototype._encodeComposite=function(t,e,i,r){const s=function(t,e,i,r){let n;if("seqof"===t?t="seq":"setof"===t&&(t="set"),o.tagByName.hasOwnProperty(t))n=o.tagByName[t];else{if("number"!=typeof t||(0|t)!==t)return r.error("Unknown tag: "+t);n=t}return n>=31?r.error("Multi-octet tag encoding unsupported"):(e||(n|=32),n|=o.tagClassByName[i||"universal"]<<6,n)}(t,e,i,this.reporter);if(r.length<128){const t=n.alloc(2);return t[0]=s,t[1]=r.length,this._createEncoderBuffer([t,r])}let a=1;for(let t=r.length;t>=256;t>>=8)a++;const h=n.alloc(2+a);h[0]=s,h[1]=128|a;for(let t=1+a,e=r.length;e>0;t--,e>>=8)h[t]=255&e;return this._createEncoderBuffer([h,r])},h.prototype._encodeStr=function(t,e){if("bitstr"===e)return this._createEncoderBuffer([0|t.unused,t.data]);if("bmpstr"===e){const e=n.alloc(2*t.length);for(let i=0;i=40)return this.reporter.error("Second objid identifier OOB");t.splice(0,2,40*t[0]+t[1])}let r=0;for(let e=0;e=128;i>>=7)r++}const s=n.alloc(r);let o=s.length-1;for(let e=t.length-1;e>=0;e--){let i=t[e];for(s[o--]=127&i;(i>>=7)>0;)s[o--]=128|127&i}return this._createEncoderBuffer(s)},h.prototype._encodeTime=function(t,e){let i;const r=new Date(t);return"gentime"===e?i=[u(r.getUTCFullYear()),u(r.getUTCMonth()+1),u(r.getUTCDate()),u(r.getUTCHours()),u(r.getUTCMinutes()),u(r.getUTCSeconds()),"Z"].join(""):"utctime"===e?i=[u(r.getUTCFullYear()%100),u(r.getUTCMonth()+1),u(r.getUTCDate()),u(r.getUTCHours()),u(r.getUTCMinutes()),u(r.getUTCSeconds()),"Z"].join(""):this.reporter.error("Encoding "+e+" time is not supported yet"),this._encodeStr(i,"octstr")},h.prototype._encodeNull=function(){return this._createEncoderBuffer("")},h.prototype._encodeInt=function(t,e){if("string"==typeof t){if(!e)return this.reporter.error("String int or enum given, but no values map");if(!e.hasOwnProperty(t))return this.reporter.error("Values map doesn't contain: "+JSON.stringify(t));t=e[t]}if("number"!=typeof t&&!n.isBuffer(t)){const e=t.toArray();!t.sign&&128&e[0]&&e.unshift(0),t=n.from(e)}if(n.isBuffer(t)){let e=t.length;0===t.length&&e++;const i=n.alloc(e);return t.copy(i),0===t.length&&(i[0]=0),this._createEncoderBuffer(i)}if(t<128)return this._createEncoderBuffer(t);if(t<256)return this._createEncoderBuffer([0,t]);let i=1;for(let e=t;e>=256;e>>=8)i++;const r=new Array(i);for(let e=r.length-1;e>=0;e--)r[e]=255&t,t>>=8;return 128&r[0]&&r.unshift(0),this._createEncoderBuffer(n.from(r))},h.prototype._encodeBool=function(t){return this._createEncoderBuffer(t?255:0)},h.prototype._use=function(t,e){return"function"==typeof t&&(t=t(e)),t._getEncoder("der").tree},h.prototype._skipDefault=function(t,e,i){const r=this._baseState;let n;if(null===r.default)return!1;const s=t.join();if(void 0===r.defaultBuffer&&(r.defaultBuffer=this._encodeValue(r.default,e,i).join()),s.length!==r.defaultBuffer.length)return!1;for(n=0;n{"use strict";const r=e;r.der=i(6984),r.pem=i(2883)},2883:(t,e,i)=>{"use strict";const r=i(5717),n=i(6984);function s(t){n.call(this,t),this.enc="pem"}r(s,n),t.exports=s,s.prototype.encode=function(t,e){const i=n.prototype.encode.call(this,t).toString("base64"),r=["-----BEGIN "+e.label+"-----"];for(let t=0;t=65&&i<=70?i-55:i>=97&&i<=102?i-87:i-48&15}function h(t,e,i){var r=a(t,i);return i-1>=e&&(r|=a(t,i-1)<<4),r}function u(t,e,i,r){for(var n=0,s=Math.min(t.length,i),o=e;o=49?a-49+10:a>=17?a-17+10:a}return n}s.isBN=function(t){return t instanceof s||null!==t&&"object"==typeof t&&t.constructor.wordSize===s.wordSize&&Array.isArray(t.words)},s.max=function(t,e){return t.cmp(e)>0?t:e},s.min=function(t,e){return t.cmp(e)<0?t:e},s.prototype._init=function(t,e,i){if("number"==typeof t)return this._initNumber(t,e,i);if("object"==typeof t)return this._initArray(t,e,i);"hex"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var n=0;"-"===(t=t.toString().replace(/\s+/g,""))[0]&&(n++,this.negative=1),n=0;n-=3)o=t[n]|t[n-1]<<8|t[n-2]<<16,this.words[s]|=o<>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);else if("le"===i)for(n=0,s=0;n>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);return this.strip()},s.prototype._parseHex=function(t,e,i){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var r=0;r=e;r-=2)n=h(t,e,r)<=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;else for(r=(t.length-e)%2==0?e+1:e;r=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;this.strip()},s.prototype._parseBase=function(t,e,i){this.words=[0],this.length=1;for(var r=0,n=1;n<=67108863;n*=e)r++;r--,n=n/e|0;for(var s=t.length-i,o=s%r,a=Math.min(s,s-o)+i,h=0,l=i;l1&&0===this.words[this.length-1];)this.length--;return this._normSign()},s.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},s.prototype.inspect=function(){return(this.red?""};var l=["","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"],c=[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],d=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function f(t,e,i){i.negative=e.negative^t.negative;var r=t.length+e.length|0;i.length=r,r=r-1|0;var n=0|t.words[0],s=0|e.words[0],o=n*s,a=67108863&o,h=o/67108864|0;i.words[0]=a;for(var u=1;u>>26,c=67108863&h,d=Math.min(u,e.length-1),f=Math.max(0,u-t.length+1);f<=d;f++){var p=u-f|0;l+=(o=(n=0|t.words[p])*(s=0|e.words[f])+c)/67108864|0,c=67108863&o}i.words[u]=0|c,h=0|l}return 0!==h?i.words[u]=0|h:i.length--,i.strip()}s.prototype.toString=function(t,e){var i;if(e=0|e||1,16===(t=t||10)||"hex"===t){i="";for(var n=0,s=0,o=0;o>>24-n&16777215)||o!==this.length-1?l[6-h.length]+h+i:h+i,(n+=2)>=26&&(n-=26,o--)}for(0!==s&&(i=s.toString(16)+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}if(t===(0|t)&&t>=2&&t<=36){var u=c[t],f=d[t];i="";var p=this.clone();for(p.negative=0;!p.isZero();){var m=p.modn(f).toString(t);i=(p=p.idivn(f)).isZero()?m+i:l[u-m.length]+m+i}for(this.isZero()&&(i="0"+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}r(!1,"Base should be between 2 and 36")},s.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-t:t},s.prototype.toJSON=function(){return this.toString(16)},s.prototype.toBuffer=function(t,e){return r(void 0!==o),this.toArrayLike(o,t,e)},s.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},s.prototype.toArrayLike=function(t,e,i){var n=this.byteLength(),s=i||Math.max(1,n);r(n<=s,"byte array longer than desired length"),r(s>0,"Requested array length <= 0"),this.strip();var o,a,h="le"===e,u=new t(s),l=this.clone();if(h){for(a=0;!l.isZero();a++)o=l.andln(255),l.iushrn(8),u[a]=o;for(;a=4096&&(i+=13,e>>>=13),e>=64&&(i+=7,e>>>=7),e>=8&&(i+=4,e>>>=4),e>=2&&(i+=2,e>>>=2),i+e},s.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,i=0;return 0==(8191&e)&&(i+=13,e>>>=13),0==(127&e)&&(i+=7,e>>>=7),0==(15&e)&&(i+=4,e>>>=4),0==(3&e)&&(i+=2,e>>>=2),0==(1&e)&&i++,i},s.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},s.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;et.length?this.clone().ior(t):t.clone().ior(this)},s.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},s.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var i=0;it.length?this.clone().iand(t):t.clone().iand(this)},s.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},s.prototype.iuxor=function(t){var e,i;this.length>t.length?(e=this,i=t):(e=t,i=this);for(var r=0;rt.length?this.clone().ixor(t):t.clone().ixor(this)},s.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},s.prototype.inotn=function(t){r("number"==typeof t&&t>=0);var e=0|Math.ceil(t/26),i=t%26;this._expand(e),i>0&&e--;for(var n=0;n0&&(this.words[n]=~this.words[n]&67108863>>26-i),this.strip()},s.prototype.notn=function(t){return this.clone().inotn(t)},s.prototype.setn=function(t,e){r("number"==typeof t&&t>=0);var i=t/26|0,n=t%26;return this._expand(i+1),this.words[i]=e?this.words[i]|1<t.length?(i=this,r=t):(i=t,r=this);for(var n=0,s=0;s>>26;for(;0!==n&&s>>26;if(this.length=i.length,0!==n)this.words[this.length]=n,this.length++;else if(i!==this)for(;st.length?this.clone().iadd(t):t.clone().iadd(this)},s.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var i,r,n=this.cmp(t);if(0===n)return this.negative=0,this.length=1,this.words[0]=0,this;n>0?(i=this,r=t):(i=t,r=this);for(var s=0,o=0;o>26,this.words[o]=67108863&e;for(;0!==s&&o>26,this.words[o]=67108863&e;if(0===s&&o>>13,f=0|o[1],p=8191&f,m=f>>>13,g=0|o[2],b=8191&g,v=g>>>13,y=0|o[3],w=8191&y,_=y>>>13,M=0|o[4],k=8191&M,x=M>>>13,E=0|o[5],S=8191&E,T=E>>>13,A=0|o[6],I=8191&A,C=A>>>13,B=0|o[7],R=8191&B,P=B>>>13,L=0|o[8],O=8191&L,D=L>>>13,N=0|o[9],j=8191&N,U=N>>>13,F=0|a[0],q=8191&F,z=F>>>13,H=0|a[1],W=8191&H,$=H>>>13,Z=0|a[2],V=8191&Z,K=Z>>>13,G=0|a[3],J=8191&G,Y=G>>>13,X=0|a[4],Q=8191&X,tt=X>>>13,et=0|a[5],it=8191&et,rt=et>>>13,nt=0|a[6],st=8191&nt,ot=nt>>>13,at=0|a[7],ht=8191&at,ut=at>>>13,lt=0|a[8],ct=8191<,dt=lt>>>13,ft=0|a[9],pt=8191&ft,mt=ft>>>13;i.negative=t.negative^e.negative,i.length=19;var gt=(u+(r=Math.imul(c,q))|0)+((8191&(n=(n=Math.imul(c,z))+Math.imul(d,q)|0))<<13)|0;u=((s=Math.imul(d,z))+(n>>>13)|0)+(gt>>>26)|0,gt&=67108863,r=Math.imul(p,q),n=(n=Math.imul(p,z))+Math.imul(m,q)|0,s=Math.imul(m,z);var bt=(u+(r=r+Math.imul(c,W)|0)|0)+((8191&(n=(n=n+Math.imul(c,$)|0)+Math.imul(d,W)|0))<<13)|0;u=((s=s+Math.imul(d,$)|0)+(n>>>13)|0)+(bt>>>26)|0,bt&=67108863,r=Math.imul(b,q),n=(n=Math.imul(b,z))+Math.imul(v,q)|0,s=Math.imul(v,z),r=r+Math.imul(p,W)|0,n=(n=n+Math.imul(p,$)|0)+Math.imul(m,W)|0,s=s+Math.imul(m,$)|0;var vt=(u+(r=r+Math.imul(c,V)|0)|0)+((8191&(n=(n=n+Math.imul(c,K)|0)+Math.imul(d,V)|0))<<13)|0;u=((s=s+Math.imul(d,K)|0)+(n>>>13)|0)+(vt>>>26)|0,vt&=67108863,r=Math.imul(w,q),n=(n=Math.imul(w,z))+Math.imul(_,q)|0,s=Math.imul(_,z),r=r+Math.imul(b,W)|0,n=(n=n+Math.imul(b,$)|0)+Math.imul(v,W)|0,s=s+Math.imul(v,$)|0,r=r+Math.imul(p,V)|0,n=(n=n+Math.imul(p,K)|0)+Math.imul(m,V)|0,s=s+Math.imul(m,K)|0;var yt=(u+(r=r+Math.imul(c,J)|0)|0)+((8191&(n=(n=n+Math.imul(c,Y)|0)+Math.imul(d,J)|0))<<13)|0;u=((s=s+Math.imul(d,Y)|0)+(n>>>13)|0)+(yt>>>26)|0,yt&=67108863,r=Math.imul(k,q),n=(n=Math.imul(k,z))+Math.imul(x,q)|0,s=Math.imul(x,z),r=r+Math.imul(w,W)|0,n=(n=n+Math.imul(w,$)|0)+Math.imul(_,W)|0,s=s+Math.imul(_,$)|0,r=r+Math.imul(b,V)|0,n=(n=n+Math.imul(b,K)|0)+Math.imul(v,V)|0,s=s+Math.imul(v,K)|0,r=r+Math.imul(p,J)|0,n=(n=n+Math.imul(p,Y)|0)+Math.imul(m,J)|0,s=s+Math.imul(m,Y)|0;var wt=(u+(r=r+Math.imul(c,Q)|0)|0)+((8191&(n=(n=n+Math.imul(c,tt)|0)+Math.imul(d,Q)|0))<<13)|0;u=((s=s+Math.imul(d,tt)|0)+(n>>>13)|0)+(wt>>>26)|0,wt&=67108863,r=Math.imul(S,q),n=(n=Math.imul(S,z))+Math.imul(T,q)|0,s=Math.imul(T,z),r=r+Math.imul(k,W)|0,n=(n=n+Math.imul(k,$)|0)+Math.imul(x,W)|0,s=s+Math.imul(x,$)|0,r=r+Math.imul(w,V)|0,n=(n=n+Math.imul(w,K)|0)+Math.imul(_,V)|0,s=s+Math.imul(_,K)|0,r=r+Math.imul(b,J)|0,n=(n=n+Math.imul(b,Y)|0)+Math.imul(v,J)|0,s=s+Math.imul(v,Y)|0,r=r+Math.imul(p,Q)|0,n=(n=n+Math.imul(p,tt)|0)+Math.imul(m,Q)|0,s=s+Math.imul(m,tt)|0;var _t=(u+(r=r+Math.imul(c,it)|0)|0)+((8191&(n=(n=n+Math.imul(c,rt)|0)+Math.imul(d,it)|0))<<13)|0;u=((s=s+Math.imul(d,rt)|0)+(n>>>13)|0)+(_t>>>26)|0,_t&=67108863,r=Math.imul(I,q),n=(n=Math.imul(I,z))+Math.imul(C,q)|0,s=Math.imul(C,z),r=r+Math.imul(S,W)|0,n=(n=n+Math.imul(S,$)|0)+Math.imul(T,W)|0,s=s+Math.imul(T,$)|0,r=r+Math.imul(k,V)|0,n=(n=n+Math.imul(k,K)|0)+Math.imul(x,V)|0,s=s+Math.imul(x,K)|0,r=r+Math.imul(w,J)|0,n=(n=n+Math.imul(w,Y)|0)+Math.imul(_,J)|0,s=s+Math.imul(_,Y)|0,r=r+Math.imul(b,Q)|0,n=(n=n+Math.imul(b,tt)|0)+Math.imul(v,Q)|0,s=s+Math.imul(v,tt)|0,r=r+Math.imul(p,it)|0,n=(n=n+Math.imul(p,rt)|0)+Math.imul(m,it)|0,s=s+Math.imul(m,rt)|0;var Mt=(u+(r=r+Math.imul(c,st)|0)|0)+((8191&(n=(n=n+Math.imul(c,ot)|0)+Math.imul(d,st)|0))<<13)|0;u=((s=s+Math.imul(d,ot)|0)+(n>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,r=Math.imul(R,q),n=(n=Math.imul(R,z))+Math.imul(P,q)|0,s=Math.imul(P,z),r=r+Math.imul(I,W)|0,n=(n=n+Math.imul(I,$)|0)+Math.imul(C,W)|0,s=s+Math.imul(C,$)|0,r=r+Math.imul(S,V)|0,n=(n=n+Math.imul(S,K)|0)+Math.imul(T,V)|0,s=s+Math.imul(T,K)|0,r=r+Math.imul(k,J)|0,n=(n=n+Math.imul(k,Y)|0)+Math.imul(x,J)|0,s=s+Math.imul(x,Y)|0,r=r+Math.imul(w,Q)|0,n=(n=n+Math.imul(w,tt)|0)+Math.imul(_,Q)|0,s=s+Math.imul(_,tt)|0,r=r+Math.imul(b,it)|0,n=(n=n+Math.imul(b,rt)|0)+Math.imul(v,it)|0,s=s+Math.imul(v,rt)|0,r=r+Math.imul(p,st)|0,n=(n=n+Math.imul(p,ot)|0)+Math.imul(m,st)|0,s=s+Math.imul(m,ot)|0;var kt=(u+(r=r+Math.imul(c,ht)|0)|0)+((8191&(n=(n=n+Math.imul(c,ut)|0)+Math.imul(d,ht)|0))<<13)|0;u=((s=s+Math.imul(d,ut)|0)+(n>>>13)|0)+(kt>>>26)|0,kt&=67108863,r=Math.imul(O,q),n=(n=Math.imul(O,z))+Math.imul(D,q)|0,s=Math.imul(D,z),r=r+Math.imul(R,W)|0,n=(n=n+Math.imul(R,$)|0)+Math.imul(P,W)|0,s=s+Math.imul(P,$)|0,r=r+Math.imul(I,V)|0,n=(n=n+Math.imul(I,K)|0)+Math.imul(C,V)|0,s=s+Math.imul(C,K)|0,r=r+Math.imul(S,J)|0,n=(n=n+Math.imul(S,Y)|0)+Math.imul(T,J)|0,s=s+Math.imul(T,Y)|0,r=r+Math.imul(k,Q)|0,n=(n=n+Math.imul(k,tt)|0)+Math.imul(x,Q)|0,s=s+Math.imul(x,tt)|0,r=r+Math.imul(w,it)|0,n=(n=n+Math.imul(w,rt)|0)+Math.imul(_,it)|0,s=s+Math.imul(_,rt)|0,r=r+Math.imul(b,st)|0,n=(n=n+Math.imul(b,ot)|0)+Math.imul(v,st)|0,s=s+Math.imul(v,ot)|0,r=r+Math.imul(p,ht)|0,n=(n=n+Math.imul(p,ut)|0)+Math.imul(m,ht)|0,s=s+Math.imul(m,ut)|0;var xt=(u+(r=r+Math.imul(c,ct)|0)|0)+((8191&(n=(n=n+Math.imul(c,dt)|0)+Math.imul(d,ct)|0))<<13)|0;u=((s=s+Math.imul(d,dt)|0)+(n>>>13)|0)+(xt>>>26)|0,xt&=67108863,r=Math.imul(j,q),n=(n=Math.imul(j,z))+Math.imul(U,q)|0,s=Math.imul(U,z),r=r+Math.imul(O,W)|0,n=(n=n+Math.imul(O,$)|0)+Math.imul(D,W)|0,s=s+Math.imul(D,$)|0,r=r+Math.imul(R,V)|0,n=(n=n+Math.imul(R,K)|0)+Math.imul(P,V)|0,s=s+Math.imul(P,K)|0,r=r+Math.imul(I,J)|0,n=(n=n+Math.imul(I,Y)|0)+Math.imul(C,J)|0,s=s+Math.imul(C,Y)|0,r=r+Math.imul(S,Q)|0,n=(n=n+Math.imul(S,tt)|0)+Math.imul(T,Q)|0,s=s+Math.imul(T,tt)|0,r=r+Math.imul(k,it)|0,n=(n=n+Math.imul(k,rt)|0)+Math.imul(x,it)|0,s=s+Math.imul(x,rt)|0,r=r+Math.imul(w,st)|0,n=(n=n+Math.imul(w,ot)|0)+Math.imul(_,st)|0,s=s+Math.imul(_,ot)|0,r=r+Math.imul(b,ht)|0,n=(n=n+Math.imul(b,ut)|0)+Math.imul(v,ht)|0,s=s+Math.imul(v,ut)|0,r=r+Math.imul(p,ct)|0,n=(n=n+Math.imul(p,dt)|0)+Math.imul(m,ct)|0,s=s+Math.imul(m,dt)|0;var Et=(u+(r=r+Math.imul(c,pt)|0)|0)+((8191&(n=(n=n+Math.imul(c,mt)|0)+Math.imul(d,pt)|0))<<13)|0;u=((s=s+Math.imul(d,mt)|0)+(n>>>13)|0)+(Et>>>26)|0,Et&=67108863,r=Math.imul(j,W),n=(n=Math.imul(j,$))+Math.imul(U,W)|0,s=Math.imul(U,$),r=r+Math.imul(O,V)|0,n=(n=n+Math.imul(O,K)|0)+Math.imul(D,V)|0,s=s+Math.imul(D,K)|0,r=r+Math.imul(R,J)|0,n=(n=n+Math.imul(R,Y)|0)+Math.imul(P,J)|0,s=s+Math.imul(P,Y)|0,r=r+Math.imul(I,Q)|0,n=(n=n+Math.imul(I,tt)|0)+Math.imul(C,Q)|0,s=s+Math.imul(C,tt)|0,r=r+Math.imul(S,it)|0,n=(n=n+Math.imul(S,rt)|0)+Math.imul(T,it)|0,s=s+Math.imul(T,rt)|0,r=r+Math.imul(k,st)|0,n=(n=n+Math.imul(k,ot)|0)+Math.imul(x,st)|0,s=s+Math.imul(x,ot)|0,r=r+Math.imul(w,ht)|0,n=(n=n+Math.imul(w,ut)|0)+Math.imul(_,ht)|0,s=s+Math.imul(_,ut)|0,r=r+Math.imul(b,ct)|0,n=(n=n+Math.imul(b,dt)|0)+Math.imul(v,ct)|0,s=s+Math.imul(v,dt)|0;var St=(u+(r=r+Math.imul(p,pt)|0)|0)+((8191&(n=(n=n+Math.imul(p,mt)|0)+Math.imul(m,pt)|0))<<13)|0;u=((s=s+Math.imul(m,mt)|0)+(n>>>13)|0)+(St>>>26)|0,St&=67108863,r=Math.imul(j,V),n=(n=Math.imul(j,K))+Math.imul(U,V)|0,s=Math.imul(U,K),r=r+Math.imul(O,J)|0,n=(n=n+Math.imul(O,Y)|0)+Math.imul(D,J)|0,s=s+Math.imul(D,Y)|0,r=r+Math.imul(R,Q)|0,n=(n=n+Math.imul(R,tt)|0)+Math.imul(P,Q)|0,s=s+Math.imul(P,tt)|0,r=r+Math.imul(I,it)|0,n=(n=n+Math.imul(I,rt)|0)+Math.imul(C,it)|0,s=s+Math.imul(C,rt)|0,r=r+Math.imul(S,st)|0,n=(n=n+Math.imul(S,ot)|0)+Math.imul(T,st)|0,s=s+Math.imul(T,ot)|0,r=r+Math.imul(k,ht)|0,n=(n=n+Math.imul(k,ut)|0)+Math.imul(x,ht)|0,s=s+Math.imul(x,ut)|0,r=r+Math.imul(w,ct)|0,n=(n=n+Math.imul(w,dt)|0)+Math.imul(_,ct)|0,s=s+Math.imul(_,dt)|0;var Tt=(u+(r=r+Math.imul(b,pt)|0)|0)+((8191&(n=(n=n+Math.imul(b,mt)|0)+Math.imul(v,pt)|0))<<13)|0;u=((s=s+Math.imul(v,mt)|0)+(n>>>13)|0)+(Tt>>>26)|0,Tt&=67108863,r=Math.imul(j,J),n=(n=Math.imul(j,Y))+Math.imul(U,J)|0,s=Math.imul(U,Y),r=r+Math.imul(O,Q)|0,n=(n=n+Math.imul(O,tt)|0)+Math.imul(D,Q)|0,s=s+Math.imul(D,tt)|0,r=r+Math.imul(R,it)|0,n=(n=n+Math.imul(R,rt)|0)+Math.imul(P,it)|0,s=s+Math.imul(P,rt)|0,r=r+Math.imul(I,st)|0,n=(n=n+Math.imul(I,ot)|0)+Math.imul(C,st)|0,s=s+Math.imul(C,ot)|0,r=r+Math.imul(S,ht)|0,n=(n=n+Math.imul(S,ut)|0)+Math.imul(T,ht)|0,s=s+Math.imul(T,ut)|0,r=r+Math.imul(k,ct)|0,n=(n=n+Math.imul(k,dt)|0)+Math.imul(x,ct)|0,s=s+Math.imul(x,dt)|0;var At=(u+(r=r+Math.imul(w,pt)|0)|0)+((8191&(n=(n=n+Math.imul(w,mt)|0)+Math.imul(_,pt)|0))<<13)|0;u=((s=s+Math.imul(_,mt)|0)+(n>>>13)|0)+(At>>>26)|0,At&=67108863,r=Math.imul(j,Q),n=(n=Math.imul(j,tt))+Math.imul(U,Q)|0,s=Math.imul(U,tt),r=r+Math.imul(O,it)|0,n=(n=n+Math.imul(O,rt)|0)+Math.imul(D,it)|0,s=s+Math.imul(D,rt)|0,r=r+Math.imul(R,st)|0,n=(n=n+Math.imul(R,ot)|0)+Math.imul(P,st)|0,s=s+Math.imul(P,ot)|0,r=r+Math.imul(I,ht)|0,n=(n=n+Math.imul(I,ut)|0)+Math.imul(C,ht)|0,s=s+Math.imul(C,ut)|0,r=r+Math.imul(S,ct)|0,n=(n=n+Math.imul(S,dt)|0)+Math.imul(T,ct)|0,s=s+Math.imul(T,dt)|0;var It=(u+(r=r+Math.imul(k,pt)|0)|0)+((8191&(n=(n=n+Math.imul(k,mt)|0)+Math.imul(x,pt)|0))<<13)|0;u=((s=s+Math.imul(x,mt)|0)+(n>>>13)|0)+(It>>>26)|0,It&=67108863,r=Math.imul(j,it),n=(n=Math.imul(j,rt))+Math.imul(U,it)|0,s=Math.imul(U,rt),r=r+Math.imul(O,st)|0,n=(n=n+Math.imul(O,ot)|0)+Math.imul(D,st)|0,s=s+Math.imul(D,ot)|0,r=r+Math.imul(R,ht)|0,n=(n=n+Math.imul(R,ut)|0)+Math.imul(P,ht)|0,s=s+Math.imul(P,ut)|0,r=r+Math.imul(I,ct)|0,n=(n=n+Math.imul(I,dt)|0)+Math.imul(C,ct)|0,s=s+Math.imul(C,dt)|0;var Ct=(u+(r=r+Math.imul(S,pt)|0)|0)+((8191&(n=(n=n+Math.imul(S,mt)|0)+Math.imul(T,pt)|0))<<13)|0;u=((s=s+Math.imul(T,mt)|0)+(n>>>13)|0)+(Ct>>>26)|0,Ct&=67108863,r=Math.imul(j,st),n=(n=Math.imul(j,ot))+Math.imul(U,st)|0,s=Math.imul(U,ot),r=r+Math.imul(O,ht)|0,n=(n=n+Math.imul(O,ut)|0)+Math.imul(D,ht)|0,s=s+Math.imul(D,ut)|0,r=r+Math.imul(R,ct)|0,n=(n=n+Math.imul(R,dt)|0)+Math.imul(P,ct)|0,s=s+Math.imul(P,dt)|0;var Bt=(u+(r=r+Math.imul(I,pt)|0)|0)+((8191&(n=(n=n+Math.imul(I,mt)|0)+Math.imul(C,pt)|0))<<13)|0;u=((s=s+Math.imul(C,mt)|0)+(n>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,r=Math.imul(j,ht),n=(n=Math.imul(j,ut))+Math.imul(U,ht)|0,s=Math.imul(U,ut),r=r+Math.imul(O,ct)|0,n=(n=n+Math.imul(O,dt)|0)+Math.imul(D,ct)|0,s=s+Math.imul(D,dt)|0;var Rt=(u+(r=r+Math.imul(R,pt)|0)|0)+((8191&(n=(n=n+Math.imul(R,mt)|0)+Math.imul(P,pt)|0))<<13)|0;u=((s=s+Math.imul(P,mt)|0)+(n>>>13)|0)+(Rt>>>26)|0,Rt&=67108863,r=Math.imul(j,ct),n=(n=Math.imul(j,dt))+Math.imul(U,ct)|0,s=Math.imul(U,dt);var Pt=(u+(r=r+Math.imul(O,pt)|0)|0)+((8191&(n=(n=n+Math.imul(O,mt)|0)+Math.imul(D,pt)|0))<<13)|0;u=((s=s+Math.imul(D,mt)|0)+(n>>>13)|0)+(Pt>>>26)|0,Pt&=67108863;var Lt=(u+(r=Math.imul(j,pt))|0)+((8191&(n=(n=Math.imul(j,mt))+Math.imul(U,pt)|0))<<13)|0;return u=((s=Math.imul(U,mt))+(n>>>13)|0)+(Lt>>>26)|0,Lt&=67108863,h[0]=gt,h[1]=bt,h[2]=vt,h[3]=yt,h[4]=wt,h[5]=_t,h[6]=Mt,h[7]=kt,h[8]=xt,h[9]=Et,h[10]=St,h[11]=Tt,h[12]=At,h[13]=It,h[14]=Ct,h[15]=Bt,h[16]=Rt,h[17]=Pt,h[18]=Lt,0!==u&&(h[19]=u,i.length++),i};function m(t,e,i){return(new g).mulp(t,e,i)}function g(t,e){this.x=t,this.y=e}Math.imul||(p=f),s.prototype.mulTo=function(t,e){var i,r=this.length+t.length;return i=10===this.length&&10===t.length?p(this,t,e):r<63?f(this,t,e):r<1024?function(t,e,i){i.negative=e.negative^t.negative,i.length=t.length+e.length;for(var r=0,n=0,s=0;s>>26)|0)>>>26,o&=67108863}i.words[s]=a,r=o,o=n}return 0!==r?i.words[s]=r:i.length--,i.strip()}(this,t,e):m(this,t,e),i},g.prototype.makeRBT=function(t){for(var e=new Array(t),i=s.prototype._countBits(t)-1,r=0;r>=1;return r},g.prototype.permute=function(t,e,i,r,n,s){for(var o=0;o>>=1)n++;return 1<>>=13,i[2*o+1]=8191&s,s>>>=13;for(o=2*e;o>=26,e+=n/67108864|0,e+=s>>>26,this.words[i]=67108863&s}return 0!==e&&(this.words[i]=e,this.length++),this},s.prototype.muln=function(t){return this.clone().imuln(t)},s.prototype.sqr=function(){return this.mul(this)},s.prototype.isqr=function(){return this.imul(this.clone())},s.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),i=0;i>>n}return e}(t);if(0===e.length)return new s(1);for(var i=this,r=0;r=0);var e,i=t%26,n=(t-i)/26,s=67108863>>>26-i<<26-i;if(0!==i){var o=0;for(e=0;e>>26-i}o&&(this.words[e]=o,this.length++)}if(0!==n){for(e=this.length-1;e>=0;e--)this.words[e+n]=this.words[e];for(e=0;e=0),n=e?(e-e%26)/26:0;var s=t%26,o=Math.min((t-s)/26,this.length),a=67108863^67108863>>>s<o)for(this.length-=o,u=0;u=0&&(0!==l||u>=n);u--){var c=0|this.words[u];this.words[u]=l<<26-s|c>>>s,l=c&a}return h&&0!==l&&(h.words[h.length++]=l),0===this.length&&(this.words[0]=0,this.length=1),this.strip()},s.prototype.ishrn=function(t,e,i){return r(0===this.negative),this.iushrn(t,e,i)},s.prototype.shln=function(t){return this.clone().ishln(t)},s.prototype.ushln=function(t){return this.clone().iushln(t)},s.prototype.shrn=function(t){return this.clone().ishrn(t)},s.prototype.ushrn=function(t){return this.clone().iushrn(t)},s.prototype.testn=function(t){r("number"==typeof t&&t>=0);var e=t%26,i=(t-e)/26,n=1<=0);var e=t%26,i=(t-e)/26;if(r(0===this.negative,"imaskn works only with positive numbers"),this.length<=i)return this;if(0!==e&&i++,this.length=Math.min(i,this.length),0!==e){var n=67108863^67108863>>>e<=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},s.prototype.isubn=function(t){if(r("number"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e>26)-(h/67108864|0),this.words[n+i]=67108863&s}for(;n>26,this.words[n+i]=67108863&s;if(0===a)return this.strip();for(r(-1===a),a=0,n=0;n>26,this.words[n]=67108863&s;return this.negative=1,this.strip()},s.prototype._wordDiv=function(t,e){var i=(this.length,t.length),r=this.clone(),n=t,o=0|n.words[n.length-1];0!=(i=26-this._countBits(o))&&(n=n.ushln(i),r.iushln(i),o=0|n.words[n.length-1]);var a,h=r.length-n.length;if("mod"!==e){(a=new s(null)).length=h+1,a.words=new Array(a.length);for(var u=0;u=0;c--){var d=67108864*(0|r.words[n.length+c])+(0|r.words[n.length+c-1]);for(d=Math.min(d/o|0,67108863),r._ishlnsubmul(n,d,c);0!==r.negative;)d--,r.negative=0,r._ishlnsubmul(n,1,c),r.isZero()||(r.negative^=1);a&&(a.words[c]=d)}return a&&a.strip(),r.strip(),"div"!==e&&0!==i&&r.iushrn(i),{div:a||null,mod:r}},s.prototype.divmod=function(t,e,i){return r(!t.isZero()),this.isZero()?{div:new s(0),mod:new s(0)}:0!==this.negative&&0===t.negative?(a=this.neg().divmod(t,e),"mod"!==e&&(n=a.div.neg()),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.iadd(t)),{div:n,mod:o}):0===this.negative&&0!==t.negative?(a=this.divmod(t.neg(),e),"mod"!==e&&(n=a.div.neg()),{div:n,mod:a.mod}):0!=(this.negative&t.negative)?(a=this.neg().divmod(t.neg(),e),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.isub(t)),{div:a.div,mod:o}):t.length>this.length||this.cmp(t)<0?{div:new s(0),mod:this}:1===t.length?"div"===e?{div:this.divn(t.words[0]),mod:null}:"mod"===e?{div:null,mod:new s(this.modn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new s(this.modn(t.words[0]))}:this._wordDiv(t,e);var n,o,a},s.prototype.div=function(t){return this.divmod(t,"div",!1).div},s.prototype.mod=function(t){return this.divmod(t,"mod",!1).mod},s.prototype.umod=function(t){return this.divmod(t,"mod",!0).mod},s.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var i=0!==e.div.negative?e.mod.isub(t):e.mod,r=t.ushrn(1),n=t.andln(1),s=i.cmp(r);return s<0||1===n&&0===s?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},s.prototype.modn=function(t){r(t<=67108863);for(var e=(1<<26)%t,i=0,n=this.length-1;n>=0;n--)i=(e*i+(0|this.words[n]))%t;return i},s.prototype.idivn=function(t){r(t<=67108863);for(var e=0,i=this.length-1;i>=0;i--){var n=(0|this.words[i])+67108864*e;this.words[i]=n/t|0,e=n%t}return this.strip()},s.prototype.divn=function(t){return this.clone().idivn(t)},s.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n=new s(1),o=new s(0),a=new s(0),h=new s(1),u=0;e.isEven()&&i.isEven();)e.iushrn(1),i.iushrn(1),++u;for(var l=i.clone(),c=e.clone();!e.isZero();){for(var d=0,f=1;0==(e.words[0]&f)&&d<26;++d,f<<=1);if(d>0)for(e.iushrn(d);d-- >0;)(n.isOdd()||o.isOdd())&&(n.iadd(l),o.isub(c)),n.iushrn(1),o.iushrn(1);for(var p=0,m=1;0==(i.words[0]&m)&&p<26;++p,m<<=1);if(p>0)for(i.iushrn(p);p-- >0;)(a.isOdd()||h.isOdd())&&(a.iadd(l),h.isub(c)),a.iushrn(1),h.iushrn(1);e.cmp(i)>=0?(e.isub(i),n.isub(a),o.isub(h)):(i.isub(e),a.isub(n),h.isub(o))}return{a,b:h,gcd:i.iushln(u)}},s.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n,o=new s(1),a=new s(0),h=i.clone();e.cmpn(1)>0&&i.cmpn(1)>0;){for(var u=0,l=1;0==(e.words[0]&l)&&u<26;++u,l<<=1);if(u>0)for(e.iushrn(u);u-- >0;)o.isOdd()&&o.iadd(h),o.iushrn(1);for(var c=0,d=1;0==(i.words[0]&d)&&c<26;++c,d<<=1);if(c>0)for(i.iushrn(c);c-- >0;)a.isOdd()&&a.iadd(h),a.iushrn(1);e.cmp(i)>=0?(e.isub(i),o.isub(a)):(i.isub(e),a.isub(o))}return(n=0===e.cmpn(1)?o:a).cmpn(0)<0&&n.iadd(t),n},s.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),i=t.clone();e.negative=0,i.negative=0;for(var r=0;e.isEven()&&i.isEven();r++)e.iushrn(1),i.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;i.isEven();)i.iushrn(1);var n=e.cmp(i);if(n<0){var s=e;e=i,i=s}else if(0===n||0===i.cmpn(1))break;e.isub(i)}return i.iushln(r)},s.prototype.invm=function(t){return this.egcd(t).a.umod(t)},s.prototype.isEven=function(){return 0==(1&this.words[0])},s.prototype.isOdd=function(){return 1==(1&this.words[0])},s.prototype.andln=function(t){return this.words[0]&t},s.prototype.bincn=function(t){r("number"==typeof t);var e=t%26,i=(t-e)/26,n=1<>>26,a&=67108863,this.words[o]=a}return 0!==s&&(this.words[o]=s,this.length++),this},s.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},s.prototype.cmpn=function(t){var e,i=t<0;if(0!==this.negative&&!i)return-1;if(0===this.negative&&i)return 1;if(this.strip(),this.length>1)e=1;else{i&&(t=-t),r(t<=67108863,"Number is too big");var n=0|this.words[0];e=n===t?0:nt.length)return 1;if(this.length=0;i--){var r=0|this.words[i],n=0|t.words[i];if(r!==n){rn&&(e=1);break}}return e},s.prototype.gtn=function(t){return 1===this.cmpn(t)},s.prototype.gt=function(t){return 1===this.cmp(t)},s.prototype.gten=function(t){return this.cmpn(t)>=0},s.prototype.gte=function(t){return this.cmp(t)>=0},s.prototype.ltn=function(t){return-1===this.cmpn(t)},s.prototype.lt=function(t){return-1===this.cmp(t)},s.prototype.lten=function(t){return this.cmpn(t)<=0},s.prototype.lte=function(t){return this.cmp(t)<=0},s.prototype.eqn=function(t){return 0===this.cmpn(t)},s.prototype.eq=function(t){return 0===this.cmp(t)},s.red=function(t){return new k(t)},s.prototype.toRed=function(t){return r(!this.red,"Already a number in reduction context"),r(0===this.negative,"red works only with positives"),t.convertTo(this)._forceRed(t)},s.prototype.fromRed=function(){return r(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},s.prototype._forceRed=function(t){return this.red=t,this},s.prototype.forceRed=function(t){return r(!this.red,"Already a number in reduction context"),this._forceRed(t)},s.prototype.redAdd=function(t){return r(this.red,"redAdd works only with red numbers"),this.red.add(this,t)},s.prototype.redIAdd=function(t){return r(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,t)},s.prototype.redSub=function(t){return r(this.red,"redSub works only with red numbers"),this.red.sub(this,t)},s.prototype.redISub=function(t){return r(this.red,"redISub works only with red numbers"),this.red.isub(this,t)},s.prototype.redShl=function(t){return r(this.red,"redShl works only with red numbers"),this.red.shl(this,t)},s.prototype.redMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.mul(this,t)},s.prototype.redIMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.imul(this,t)},s.prototype.redSqr=function(){return r(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},s.prototype.redISqr=function(){return r(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},s.prototype.redSqrt=function(){return r(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},s.prototype.redInvm=function(){return r(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},s.prototype.redNeg=function(){return r(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},s.prototype.redPow=function(t){return r(this.red&&!t.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,t)};var b={k256:null,p224:null,p192:null,p25519:null};function v(t,e){this.name=t,this.p=new s(e,16),this.n=this.p.bitLength(),this.k=new s(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function y(){v.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function w(){v.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function _(){v.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function M(){v.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function k(t){if("string"==typeof t){var e=s._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),"modulus must be greater than 1"),this.m=t,this.prime=null}function x(t){k.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new s(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}v.prototype._tmp=function(){var t=new s(null);return t.words=new Array(Math.ceil(this.n/13)),t},v.prototype.ireduce=function(t){var e,i=t;do{this.split(i,this.tmp),e=(i=(i=this.imulK(i)).iadd(this.tmp)).bitLength()}while(e>this.n);var r=e0?i.isub(this.p):void 0!==i.strip?i.strip():i._strip(),i},v.prototype.split=function(t,e){t.iushrn(this.n,0,e)},v.prototype.imulK=function(t){return t.imul(this.k)},n(y,v),y.prototype.split=function(t,e){for(var i=4194303,r=Math.min(t.length,9),n=0;n>>22,s=o}s>>>=22,t.words[n-10]=s,0===s&&t.length>10?t.length-=10:t.length-=9},y.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,i=0;i>>=26,t.words[i]=n,e=r}return 0!==e&&(t.words[t.length++]=e),t},s._prime=function(t){if(b[t])return b[t];var e;if("k256"===t)e=new y;else if("p224"===t)e=new w;else if("p192"===t)e=new _;else{if("p25519"!==t)throw new Error("Unknown prime "+t);e=new M}return b[t]=e,e},k.prototype._verify1=function(t){r(0===t.negative,"red works only with positives"),r(t.red,"red works only with red numbers")},k.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),"red works only with positives"),r(t.red&&t.red===e.red,"red works only with red numbers")},k.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):t.umod(this.m)._forceRed(this)},k.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},k.prototype.add=function(t,e){this._verify2(t,e);var i=t.add(e);return i.cmp(this.m)>=0&&i.isub(this.m),i._forceRed(this)},k.prototype.iadd=function(t,e){this._verify2(t,e);var i=t.iadd(e);return i.cmp(this.m)>=0&&i.isub(this.m),i},k.prototype.sub=function(t,e){this._verify2(t,e);var i=t.sub(e);return i.cmpn(0)<0&&i.iadd(this.m),i._forceRed(this)},k.prototype.isub=function(t,e){this._verify2(t,e);var i=t.isub(e);return i.cmpn(0)<0&&i.iadd(this.m),i},k.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},k.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},k.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},k.prototype.isqr=function(t){return this.imul(t,t.clone())},k.prototype.sqr=function(t){return this.mul(t,t)},k.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var i=this.m.add(new s(1)).iushrn(2);return this.pow(t,i)}for(var n=this.m.subn(1),o=0;!n.isZero()&&0===n.andln(1);)o++,n.iushrn(1);r(!n.isZero());var a=new s(1).toRed(this),h=a.redNeg(),u=this.m.subn(1).iushrn(1),l=this.m.bitLength();for(l=new s(2*l*l).toRed(this);0!==this.pow(l,u).cmp(h);)l.redIAdd(h);for(var c=this.pow(l,n),d=this.pow(t,n.addn(1).iushrn(1)),f=this.pow(t,n),p=o;0!==f.cmp(a);){for(var m=f,g=0;0!==m.cmp(a);g++)m=m.redSqr();r(g=0;r--){for(var u=e.words[r],l=h-1;l>=0;l--){var c=u>>l&1;n!==i[0]&&(n=this.sqr(n)),0!==c||0!==o?(o<<=1,o|=c,(4==++a||0===r&&0===l)&&(n=this.mul(n,i[o]),a=0,o=0)):a=0}h=26}return n},k.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},k.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},s.mont=function(t){return new x(t)},n(x,k),x.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},x.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},x.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var i=t.imul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),s=n;return n.cmp(this.m)>=0?s=n.isub(this.m):n.cmpn(0)<0&&(s=n.iadd(this.m)),s._forceRed(this)},x.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new s(0)._forceRed(this);var i=t.mul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),o=n;return n.cmp(this.m)>=0?o=n.isub(this.m):n.cmpn(0)<0&&(o=n.iadd(this.m)),o._forceRed(this)},x.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(t=i.nmd(t),this)},9282:(t,e,i)=>{"use strict";var r=i(9590),n=i(5108);function s(t){return s="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},s(t)}var o,a,h=i(2136).codes,u=h.ERR_AMBIGUOUS_ARGUMENT,l=h.ERR_INVALID_ARG_TYPE,c=h.ERR_INVALID_ARG_VALUE,d=h.ERR_INVALID_RETURN_VALUE,f=h.ERR_MISSING_ARGS,p=i(5961),m=i(9539).inspect,g=i(9539).types,b=g.isPromise,v=g.isRegExp,y=Object.assign?Object.assign:i(8091).assign,w=Object.is?Object.is:i(609);function _(){var t=i(9158);o=t.isDeepEqual,a=t.isDeepStrictEqual}new Map;var M=!1,k=t.exports=T,x={};function E(t){if(t.message instanceof Error)throw t.message;throw new p(t)}function S(t,e,i,r){if(!i){var n=!1;if(0===e)n=!0,r="No value argument passed to `assert.ok()`";else if(r instanceof Error)throw r;var s=new p({actual:i,expected:!0,message:r,operator:"==",stackStartFn:t});throw s.generatedMessage=n,s}}function T(){for(var t=arguments.length,e=new Array(t),i=0;i1?i-1:0),n=1;n1?i-1:0),n=1;n1?i-1:0),n=1;n1?i-1:0),n=1;n{"use strict";var r=i(9590);function n(t,e,i){return e in t?Object.defineProperty(t,e,{value:i,enumerable:!0,configurable:!0,writable:!0}):t[e]=i,t}function s(t,e){for(var i=0;it.length)&&(i=t.length),t.substring(i-e.length,i)===e}var b="",v="",y="",w="",_={deepStrictEqual:"Expected values to be strictly deep-equal:",strictEqual:"Expected values to be strictly equal:",strictEqualObject:'Expected "actual" to be reference-equal to "expected":',deepEqual:"Expected values to be loosely deep-equal:",equal:"Expected values to be loosely equal:",notDeepStrictEqual:'Expected "actual" not to be strictly deep-equal to:',notStrictEqual:'Expected "actual" to be strictly unequal to:',notStrictEqualObject:'Expected "actual" not to be reference-equal to "expected":',notDeepEqual:'Expected "actual" not to be loosely deep-equal to:',notEqual:'Expected "actual" to be loosely unequal to:',notIdentical:"Values identical but not reference-equal:"};function M(t){var e=Object.keys(t),i=Object.create(Object.getPrototypeOf(t));return e.forEach((function(e){i[e]=t[e]})),Object.defineProperty(i,"message",{value:t.message}),i}function k(t){return p(t,{compact:!1,customInspect:!1,depth:1e3,maxArrayLength:1/0,showHidden:!1,breakLength:1/0,showProxy:!1,sorted:!0,getters:!0})}var x=function(t){function e(t){var i;if(function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,e),"object"!==f(t)||null===t)throw new m("options","Object",t);var n=t.message,s=t.operator,h=t.stackStartFn,u=t.actual,l=t.expected,c=Error.stackTraceLimit;if(Error.stackTraceLimit=0,null!=n)i=o(this,d(e).call(this,String(n)));else if(r.stderr&&r.stderr.isTTY&&(r.stderr&&r.stderr.getColorDepth&&1!==r.stderr.getColorDepth()?(b="",v="",w="",y=""):(b="",v="",w="",y="")),"object"===f(u)&&null!==u&&"object"===f(l)&&null!==l&&"stack"in u&&u instanceof Error&&"stack"in l&&l instanceof Error&&(u=M(u),l=M(l)),"deepStrictEqual"===s||"strictEqual"===s)i=o(this,d(e).call(this,function(t,e,i){var n="",s="",o=0,a="",h=!1,u=k(t),l=u.split("\n"),c=k(e).split("\n"),d=0,p="";if("strictEqual"===i&&"object"===f(t)&&"object"===f(e)&&null!==t&&null!==e&&(i="strictEqualObject"),1===l.length&&1===c.length&&l[0]!==c[0]){var m=l[0].length+c[0].length;if(m<=10){if(!("object"===f(t)&&null!==t||"object"===f(e)&&null!==e||0===t&&0===e))return"".concat(_[i],"\n\n")+"".concat(l[0]," !== ").concat(c[0],"\n")}else if("strictEqualObject"!==i&&m<(r.stderr&&r.stderr.isTTY?r.stderr.columns:80)){for(;l[0][d]===c[0][d];)d++;d>2&&(p="\n ".concat(function(t,e){if(e=Math.floor(e),0==t.length||0==e)return"";var i=t.length*e;for(e=Math.floor(Math.log(e)/Math.log(2));e;)t+=t,e--;return t+t.substring(0,i-t.length)}(" ",d),"^"),d=0)}}for(var M=l[l.length-1],x=c[c.length-1];M===x&&(d++<2?a="\n ".concat(M).concat(a):n=M,l.pop(),c.pop(),0!==l.length&&0!==c.length);)M=l[l.length-1],x=c[c.length-1];var E=Math.max(l.length,c.length);if(0===E){var S=u.split("\n");if(S.length>30)for(S[26]="".concat(b,"...").concat(w);S.length>27;)S.pop();return"".concat(_.notIdentical,"\n\n").concat(S.join("\n"),"\n")}d>3&&(a="\n".concat(b,"...").concat(w).concat(a),h=!0),""!==n&&(a="\n ".concat(n).concat(a),n="");var T=0,A=_[i]+"\n".concat(v,"+ actual").concat(w," ").concat(y,"- expected").concat(w),I=" ".concat(b,"...").concat(w," Lines skipped");for(d=0;d1&&d>2&&(C>4?(s+="\n".concat(b,"...").concat(w),h=!0):C>3&&(s+="\n ".concat(c[d-2]),T++),s+="\n ".concat(c[d-1]),T++),o=d,n+="\n".concat(y,"-").concat(w," ").concat(c[d]),T++;else if(c.length1&&d>2&&(C>4?(s+="\n".concat(b,"...").concat(w),h=!0):C>3&&(s+="\n ".concat(l[d-2]),T++),s+="\n ".concat(l[d-1]),T++),o=d,s+="\n".concat(v,"+").concat(w," ").concat(l[d]),T++;else{var B=c[d],R=l[d],P=R!==B&&(!g(R,",")||R.slice(0,-1)!==B);P&&g(B,",")&&B.slice(0,-1)===R&&(P=!1,R+=","),P?(C>1&&d>2&&(C>4?(s+="\n".concat(b,"...").concat(w),h=!0):C>3&&(s+="\n ".concat(l[d-2]),T++),s+="\n ".concat(l[d-1]),T++),o=d,s+="\n".concat(v,"+").concat(w," ").concat(R),n+="\n".concat(y,"-").concat(w," ").concat(B),T+=2):(s+=n,n="",1!==C&&0!==d||(s+="\n ".concat(R),T++))}if(T>20&&d30)for(x[26]="".concat(b,"...").concat(w);x.length>27;)x.pop();i=1===x.length?o(this,d(e).call(this,"".concat(p," ").concat(x[0]))):o(this,d(e).call(this,"".concat(p,"\n\n").concat(x.join("\n"),"\n")))}else{var E=k(u),S="",T=_[s];"notDeepEqual"===s||"notEqual"===s?(E="".concat(_[s],"\n\n").concat(E)).length>1024&&(E="".concat(E.slice(0,1021),"...")):(S="".concat(k(l)),E.length>512&&(E="".concat(E.slice(0,509),"...")),S.length>512&&(S="".concat(S.slice(0,509),"...")),"deepEqual"===s||"equal"===s?E="".concat(T,"\n\n").concat(E,"\n\nshould equal\n\n"):S=" ".concat(s," ").concat(S)),i=o(this,d(e).call(this,"".concat(E).concat(S)))}return Error.stackTraceLimit=c,i.generatedMessage=!n,Object.defineProperty(a(i),"name",{value:"AssertionError [ERR_ASSERTION]",enumerable:!1,writable:!0,configurable:!0}),i.code="ERR_ASSERTION",i.actual=u,i.expected=l,i.operator=s,Error.captureStackTrace&&Error.captureStackTrace(a(i),h),i.stack,i.name="AssertionError",o(i)}var i,h;return function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function");t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,writable:!0,configurable:!0}}),e&&c(t,e)}(e,t),i=e,h=[{key:"toString",value:function(){return"".concat(this.name," [").concat(this.code,"]: ").concat(this.message)}},{key:p.custom,value:function(t,e){return p(this,function(t){for(var e=1;e{"use strict";function r(t){return r="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},r(t)}function n(t){return n=Object.setPrototypeOf?Object.getPrototypeOf:function(t){return t.__proto__||Object.getPrototypeOf(t)},n(t)}function s(t,e){return s=Object.setPrototypeOf||function(t,e){return t.__proto__=e,t},s(t,e)}var o,a,h={};function u(t,e,i){i||(i=Error);var o=function(i){function o(i,s,a){var h;return function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,o),h=function(t,e){return!e||"object"!==r(e)&&"function"!=typeof e?function(t){if(void 0===t)throw new ReferenceError("this hasn't been initialised - super() hasn't been called");return t}(t):e}(this,n(o).call(this,function(t,i,r){return"string"==typeof e?e:e(t,i,r)}(i,s,a))),h.code=t,h}return function(t,e){if("function"!=typeof e&&null!==e)throw new TypeError("Super expression must either be null or a function");t.prototype=Object.create(e&&e.prototype,{constructor:{value:t,writable:!0,configurable:!0}}),e&&s(t,e)}(o,i),o}(i);h[t]=o}function l(t,e){if(Array.isArray(t)){var i=t.length;return t=t.map((function(t){return String(t)})),i>2?"one of ".concat(e," ").concat(t.slice(0,i-1).join(", "),", or ")+t[i-1]:2===i?"one of ".concat(e," ").concat(t[0]," or ").concat(t[1]):"of ".concat(e," ").concat(t[0])}return"of ".concat(e," ").concat(String(t))}u("ERR_AMBIGUOUS_ARGUMENT",'The "%s" argument is ambiguous. %s',TypeError),u("ERR_INVALID_ARG_TYPE",(function(t,e,n){var s,a,h,u,c;if(void 0===o&&(o=i(9282)),o("string"==typeof t,"'name' must be a string"),"string"==typeof e&&(a="not ",e.substr(0,a.length)===a)?(s="must not be",e=e.replace(/^not /,"")):s="must be",function(t,e,i){return(void 0===i||i>t.length)&&(i=t.length),t.substring(i-e.length,i)===e}(t," argument"))h="The ".concat(t," ").concat(s," ").concat(l(e,"type"));else{var d=("number"!=typeof c&&(c=0),c+".".length>(u=t).length||-1===u.indexOf(".",c)?"argument":"property");h='The "'.concat(t,'" ').concat(d," ").concat(s," ").concat(l(e,"type"))}return h+". Received type ".concat(r(n))}),TypeError),u("ERR_INVALID_ARG_VALUE",(function(t,e){var r=arguments.length>2&&void 0!==arguments[2]?arguments[2]:"is invalid";void 0===a&&(a=i(9539));var n=a.inspect(e);return n.length>128&&(n="".concat(n.slice(0,128),"...")),"The argument '".concat(t,"' ").concat(r,". Received ").concat(n)}),TypeError,RangeError),u("ERR_INVALID_RETURN_VALUE",(function(t,e,i){var n;return n=i&&i.constructor&&i.constructor.name?"instance of ".concat(i.constructor.name):"type ".concat(r(i)),"Expected ".concat(t,' to be returned from the "').concat(e,'"')+" function but got ".concat(n,".")}),TypeError),u("ERR_MISSING_ARGS",(function(){for(var t=arguments.length,e=new Array(t),r=0;r0,"At least one arg needs to be specified");var n="The ",s=e.length;switch(e=e.map((function(t){return'"'.concat(t,'"')})),s){case 1:n+="".concat(e[0]," argument");break;case 2:n+="".concat(e[0]," and ").concat(e[1]," arguments");break;default:n+=e.slice(0,s-1).join(", "),n+=", and ".concat(e[s-1]," arguments")}return"".concat(n," must be specified")}),TypeError),t.exports.codes=h},9158:(t,e,i)=>{"use strict";function r(t,e){return function(t){if(Array.isArray(t))return t}(t)||function(t,e){var i=[],r=!0,n=!1,s=void 0;try{for(var o,a=t[Symbol.iterator]();!(r=(o=a.next()).done)&&(i.push(o.value),!e||i.length!==e);r=!0);}catch(t){n=!0,s=t}finally{try{r||null==a.return||a.return()}finally{if(n)throw s}}return i}(t,e)||function(){throw new TypeError("Invalid attempt to destructure non-iterable instance")}()}function n(t){return n="function"==typeof Symbol&&"symbol"==typeof Symbol.iterator?function(t){return typeof t}:function(t){return t&&"function"==typeof Symbol&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},n(t)}var s=void 0!==/a/g.flags,o=function(t){var e=[];return t.forEach((function(t){return e.push(t)})),e},a=function(t){var e=[];return t.forEach((function(t,i){return e.push([i,t])})),e},h=Object.is?Object.is:i(609),u=Object.getOwnPropertySymbols?Object.getOwnPropertySymbols:function(){return[]},l=Number.isNaN?Number.isNaN:i(360);function c(t){return t.call.bind(t)}var d=c(Object.prototype.hasOwnProperty),f=c(Object.prototype.propertyIsEnumerable),p=c(Object.prototype.toString),m=i(9539).types,g=m.isAnyArrayBuffer,b=m.isArrayBufferView,v=m.isDate,y=m.isMap,w=m.isRegExp,_=m.isSet,M=m.isNativeError,k=m.isBoxedPrimitive,x=m.isNumberObject,E=m.isStringObject,S=m.isBooleanObject,T=m.isBigIntObject,A=m.isSymbolObject,I=m.isFloat32Array,C=m.isFloat64Array;function B(t){if(0===t.length||t.length>10)return!0;for(var e=0;e57)return!0}return 10===t.length&&t>=Math.pow(2,32)}function R(t){return Object.keys(t).filter(B).concat(u(t).filter(Object.prototype.propertyIsEnumerable.bind(t)))}function P(t,e){if(t===e)return 0;for(var i=t.length,r=e.length,n=0,s=Math.min(i,r);n{"use strict";e.byteLength=function(t){var e=h(t),i=e[0],r=e[1];return 3*(i+r)/4-r},e.toByteArray=function(t){var e,i,s=h(t),o=s[0],a=s[1],u=new n(function(t,e,i){return 3*(e+i)/4-i}(0,o,a)),l=0,c=a>0?o-4:o;for(i=0;i>16&255,u[l++]=e>>8&255,u[l++]=255&e;return 2===a&&(e=r[t.charCodeAt(i)]<<2|r[t.charCodeAt(i+1)]>>4,u[l++]=255&e),1===a&&(e=r[t.charCodeAt(i)]<<10|r[t.charCodeAt(i+1)]<<4|r[t.charCodeAt(i+2)]>>2,u[l++]=e>>8&255,u[l++]=255&e),u},e.fromByteArray=function(t){for(var e,r=t.length,n=r%3,s=[],o=16383,a=0,h=r-n;ah?h:a+o));return 1===n?(e=t[r-1],s.push(i[e>>2]+i[e<<4&63]+"==")):2===n&&(e=(t[r-2]<<8)+t[r-1],s.push(i[e>>10]+i[e>>4&63]+i[e<<2&63]+"=")),s.join("")};for(var i=[],r=[],n="undefined"!=typeof Uint8Array?Uint8Array:Array,s="ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",o=0,a=s.length;o0)throw new Error("Invalid string. Length must be a multiple of 4");var i=t.indexOf("=");return-1===i&&(i=e),[i,i===e?0:4-i%4]}function u(t,e,r){for(var n,s,o=[],a=e;a>18&63]+i[s>>12&63]+i[s>>6&63]+i[63&s]);return o.join("")}r["-".charCodeAt(0)]=62,r["_".charCodeAt(0)]=63},6992:(t,e,i)=>{var r=i(8764).Buffer;function n(t,e,i){let r=0,n=1;for(let s=e;s=48)r=10*r+(i-48);else if(s!==e||43!==i){if(s!==e||45!==i){if(46===i)break;throw new Error("not a number: buffer["+s+"] = "+i)}n=-1}}return r*n}function s(t,e,i,n){return null==t||0===t.length?null:("number"!=typeof e&&null==n&&(n=e,e=void 0),"number"!=typeof i&&null==n&&(n=i,i=void 0),s.position=0,s.encoding=n||null,s.data=r.isBuffer(t)?t.slice(e,i):r.from(t),s.bytes=s.data.length,s.next())}s.bytes=0,s.position=0,s.data=null,s.encoding=null,s.next=function(){switch(s.data[s.position]){case 100:return s.dictionary();case 108:return s.list();case 105:return s.integer();default:return s.buffer()}},s.find=function(t){let e=s.position;const i=s.data.length,r=s.data;for(;e{var r=i(8764).Buffer,n=i(5108);const{getType:s}=i(7186);function o(t,e,i){const n=[];let s=null;return o._encode(n,t),s=r.concat(n),o.bytes=s.length,r.isBuffer(e)?(s.copy(e,i),e):s}o.bytes=-1,o._floatConversionDetected=!1,o._encode=function(t,e){if(null!=e)switch(s(e)){case"buffer":o.buffer(t,e);break;case"object":o.dict(t,e);break;case"map":o.dictMap(t,e);break;case"array":o.list(t,e);break;case"set":o.listSet(t,e);break;case"string":o.string(t,e);break;case"number":case"boolean":o.number(t,e);break;case"arraybufferview":o.buffer(t,r.from(e.buffer,e.byteOffset,e.byteLength));break;case"arraybuffer":o.buffer(t,r.from(e))}};const a=r.from("e"),h=r.from("d"),u=r.from("l");o.buffer=function(t,e){t.push(r.from(e.length+":"),e)},o.string=function(t,e){t.push(r.from(r.byteLength(e)+":"+e))},o.number=function(t,e){const i=2147483648,s=(e/i<<0)*i+(e%i<<0);t.push(r.from("i"+s+"e")),s===e||o._floatConversionDetected||(o._floatConversionDetected=!0,n.warn('WARNING: Possible data corruption detected with value "'+e+'":','Bencoding only defines support for integers, value was converted to "'+s+'"'),n.trace())},o.dict=function(t,e){t.push(h);let i,r=0;const n=Object.keys(e).sort(),s=n.length;for(;r{var r=i(8764).Buffer;const{digitCount:n,getType:s}=i(7186);t.exports=function t(e){if(null==e)return 0;const i=s(e);switch(i){case"buffer":return n(e.length)+1+e.length;case"arraybufferview":return function(t){const e=t.byteLength-t.byteOffset;return n(e)+1+e}(e);case"string":return function(t){const e=r.byteLength(t);return n(e)+1+e}(e);case"array":case"set":return function(e){let i=2;for(const r of e)i+=t(r);return i}(e);case"number":return 1+n(Math.floor(e))+1;case"bigint":return 1+e.toString().length+1;case"object":return function(e){let i=2;const s=Object.keys(e);for(let o=0;o{const r=t.exports;r.encode=i(2244),r.decode=i(6992),r.byteLength=r.encodingLength=i(1722)},7186:(t,e,i)=>{var r=i(8764).Buffer;const n=t.exports;n.digitCount=function(t){const e=t<0?1:0;return t=Math.abs(Number(t||1)),Math.floor(Math.log10(t))+1+e},n.getType=function(t){return r.isBuffer(t)?"buffer":ArrayBuffer.isView(t)?"arraybufferview":Array.isArray(t)?"array":t instanceof Number?"number":t instanceof Boolean?"boolean":t instanceof Set?"set":t instanceof Map?"map":t instanceof String?"string":t instanceof ArrayBuffer?"arraybuffer":typeof t}},7500:t=>{function e(t){return t.reduce(((t,e,i,r)=>{const n=e.split("-").map((t=>parseInt(t)));return t.concat(((t,e=t)=>Array.from({length:e-t+1},((e,i)=>i+t)))(...n))}),[])}t.exports=e,t.exports.parse=e,t.exports.compose=function(t){return t.reduce(((t,e,i,r)=>(0!==i&&e===r[i-1]+1||t.push([]),t[t.length-1].push(e),t)),[]).map((t=>t.length>1?`${t[0]}-${t[t.length-1]}`:`${t[0]}`))}},7513:t=>{t.exports=function(t,e,i,r,n){var s,o;if(void 0===r)r=0;else if((r|=0)<0||r>=t.length)throw new RangeError("invalid lower bound");if(void 0===n)n=t.length-1;else if((n|=0)=t.length)throw new RangeError("invalid upper bound");for(;r<=n;)if((o=+i(t[s=r+(n-r>>>1)],e,s,t))<0)r=s+1;else{if(!(o>0))return s;n=s-1}return~r}},8833:(t,e)=>{"use strict";function i(t){var e=t>>3;return t%8!=0&&e++,e}Object.defineProperty(e,"__esModule",{value:!0});var r=function(){function t(t,e){void 0===t&&(t=0);var r=null==e?void 0:e.grow;this.grow=r&&isFinite(r)&&i(r)||r||0,this.buffer="number"==typeof t?new Uint8Array(i(t)):t}return t.prototype.get=function(t){var e=t>>3;return e>t%8)},t.prototype.set=function(t,e){void 0===e&&(e=!0);var i=t>>3;if(e){if(this.buffer.length>t%8}else i>t%8))},t.prototype.forEach=function(t,e,i){void 0===e&&(e=0),void 0===i&&(i=8*this.buffer.length);for(var r=e,n=r>>3,s=128>>r%8,o=this.buffer[n];r>1},t}();e.default=r},5228:(t,e,i)=>{var r=i(8764).Buffer;const n=i(6581),s=i(5799),o=i(8833).default,a=i(5835),h=i(1227)("bittorrent-protocol"),u=i(1798),l=i(4159),c=i(9529),d=i(8473),f=i(7830),p=r.from("BitTorrent protocol"),m=r.from([0,0,0,0]),g=r.from([0,0,0,1,0]),b=r.from([0,0,0,1,1]),v=r.from([0,0,0,1,2]),y=r.from([0,0,0,1,3]),w=[0,0,0,0,0,0,0,0],_=[0,0,0,3,9,0,0],M=r.from([0,0,0,1,14]),k=r.from([0,0,0,1,15]),x=r.from([0,0,0,0,0,0,0,0]),E=r.from([0,0,1,2]),S=r.from([0,0,0,2]);function T(t,e){for(let i=t.length;i--;)t[i]^=e[i];return t}class A{constructor(t,e,i,r){this.piece=t,this.offset=e,this.length=i,this.callback=r}}class I{constructor(){this.buffer=new Uint8Array}get(t){return!0}set(t){}}class C extends d.Duplex{constructor(t=null,e=0,i=!1){super(),this._debugId=u(4).toString("hex"),this._debug("new wire"),this.peerId=null,this.peerIdBuffer=null,this.type=t,this.amChoking=!0,this.amInterested=!1,this.peerChoking=!0,this.peerInterested=!1,this.peerPieces=new o(0,{grow:4e5}),this.extensions={},this.peerExtensions={},this.requests=[],this.peerRequests=[],this.extendedMapping={},this.peerExtendedMapping={},this.extendedHandshake={},this.peerExtendedHandshake={},this.hasFast=!1,this.allowedFastSet=[],this.peerAllowedFastSet=[],this._ext={},this._nextExt=1,this.uploaded=0,this.downloaded=0,this.uploadSpeed=c(),this.downloadSpeed=c(),this._keepAliveInterval=null,this._timeout=null,this._timeoutMs=0,this._timeoutExpiresAt=null,this.destroyed=!1,this._finished=!1,this._parserSize=0,this._parser=null,this._buffer=[],this._bufferSize=0,this._peEnabled=i,i?(this._dh=a.createDiffieHellman("ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a36210000000000090563","hex",2),this._myPubKey=this._dh.generateKeys("hex")):this._myPubKey=null,this._peerPubKey=null,this._sharedSecret=null,this._peerCryptoProvide=[],this._cryptoHandshakeDone=!1,this._cryptoSyncPattern=null,this._waitMaxBytes=null,this._encryptionMethod=null,this._encryptGenerator=null,this._decryptGenerator=null,this._setGenerators=!1,this.once("finish",(()=>this._onFinish())),this.on("finish",this._onFinish),this._debug("type:",this.type),"tcpIncoming"===this.type&&this._peEnabled?this._determineHandshakeType():"tcpOutgoing"===this.type&&this._peEnabled&&0===e?this._parsePe2():this._parseHandshake(null)}setKeepAlive(t){this._debug("setKeepAlive %s",t),clearInterval(this._keepAliveInterval),!1!==t&&(this._keepAliveInterval=setInterval((()=>{this.keepAlive()}),55e3))}setTimeout(t,e){this._debug("setTimeout ms=%d unref=%s",t,e),this._timeoutMs=t,this._timeoutUnref=!!e,this._resetTimeout(!0)}destroy(){if(!this.destroyed)return this.destroyed=!0,this._debug("destroy"),this.emit("close"),this.end(),this}end(...t){return this._debug("end"),this._onUninterested(),this._onChoke(),super.end(...t)}use(t){const e=t.prototype.name;if(!e)throw new Error('Extension class requires a "name" property on the prototype');this._debug("use extension.name=%s",e);const i=this._nextExt,r=new t(this);function n(){}"function"!=typeof r.onHandshake&&(r.onHandshake=n),"function"!=typeof r.onExtendedHandshake&&(r.onExtendedHandshake=n),"function"!=typeof r.onMessage&&(r.onMessage=n),this.extendedMapping[i]=e,this._ext[e]=r,this[e]=r,this._nextExt+=1}keepAlive(){this._debug("keep-alive"),this._push(m)}sendPe1(){if(this._peEnabled){const t=Math.floor(513*Math.random()),e=u(t);this._push(r.concat([r.from(this._myPubKey,"hex"),e]))}}sendPe2(){const t=Math.floor(513*Math.random()),e=u(t);this._push(r.concat([r.from(this._myPubKey,"hex"),e]))}sendPe3(t){this.setEncrypt(this._sharedSecret,t);const e=r.from(l.sync(r.from(this._utfToHex("req1")+this._sharedSecret,"hex")),"hex"),i=T(r.from(l.sync(r.from(this._utfToHex("req2")+t,"hex")),"hex"),r.from(l.sync(r.from(this._utfToHex("req3")+this._sharedSecret,"hex")),"hex")),n=u(2).readUInt16BE(0)%512,s=u(n);let o=r.alloc(14+n+2);x.copy(o),E.copy(o,8),o.writeInt16BE(n,12),s.copy(o,14),o.writeInt16BE(0,14+n),o=this._encryptHandshake(o),this._push(r.concat([e,i,o]))}sendPe4(t){this.setEncrypt(this._sharedSecret,t);const e=u(2).readUInt16BE(0)%512,i=u(e);let n=r.alloc(14+e);x.copy(n),S.copy(n,8),n.writeInt16BE(e,12),i.copy(n,14),n=this._encryptHandshake(n),this._push(n),this._cryptoHandshakeDone=!0,this._debug("completed crypto handshake")}handshake(t,e,i){let n,s;if("string"==typeof t?(t=t.toLowerCase(),n=r.from(t,"hex")):(n=t,t=n.toString("hex")),"string"==typeof e?s=r.from(e,"hex"):(s=e,e=s.toString("hex")),this._infoHash=n,20!==n.length||20!==s.length)throw new Error("infoHash and peerId MUST have length 20");this._debug("handshake i=%s p=%s exts=%o",t,e,i);const o=r.from(w);this.extensions={extended:!0,dht:!(!i||!i.dht),fast:!(!i||!i.fast)},o[5]|=16,this.extensions.dht&&(o[7]|=1),this.extensions.fast&&(o[7]|=4),this.extensions.fast&&this.peerExtensions.fast&&(this._debug("fast extension is enabled"),this.hasFast=!0),this._push(r.concat([p,o,n,s])),this._handshakeSent=!0,this.peerExtensions.extended&&!this._extendedHandshakeSent&&this._sendExtendedHandshake()}_sendExtendedHandshake(){const t=Object.assign({},this.extendedHandshake);t.m={};for(const e in this.extendedMapping){const i=this.extendedMapping[e];t.m[i]=Number(e)}this.extended(0,s.encode(t)),this._extendedHandshakeSent=!0}choke(){if(!this.amChoking)if(this.amChoking=!0,this._debug("choke"),this._push(g),this.hasFast)for(;this.peerRequests.length;){const t=this.peerRequests[0];this.allowedFastSet.includes(t.piece)||this.reject(t.piece,t.offset,t.length)}else for(;this.peerRequests.length;)this.peerRequests.pop()}unchoke(){this.amChoking&&(this.amChoking=!1,this._debug("unchoke"),this._push(b))}interested(){this.amInterested||(this.amInterested=!0,this._debug("interested"),this._push(v))}uninterested(){this.amInterested&&(this.amInterested=!1,this._debug("uninterested"),this._push(y))}have(t){this._debug("have %d",t),this._message(4,[t],null)}bitfield(t){this._debug("bitfield"),r.isBuffer(t)||(t=t.buffer),this._message(5,[],t)}request(t,e,i,r){return r||(r=()=>{}),this._finished?r(new Error("wire is closed")):!this.peerChoking||this.hasFast&&this.peerAllowedFastSet.includes(t)?(this._debug("request index=%d offset=%d length=%d",t,e,i),this.requests.push(new A(t,e,i,r)),this._timeout||this._resetTimeout(!0),void this._message(6,[t,e,i],null)):r(new Error("peer is choking"))}piece(t,e,i){this._debug("piece index=%d offset=%d",t,e),this._message(7,[t,e],i),this.uploaded+=i.length,this.uploadSpeed(i.length),this.emit("upload",i.length)}cancel(t,e,i){this._debug("cancel index=%d offset=%d length=%d",t,e,i),this._callback(this._pull(this.requests,t,e,i),new Error("request was cancelled"),null),this._message(8,[t,e,i],null)}port(t){this._debug("port %d",t);const e=r.from(_);e.writeUInt16BE(t,5),this._push(e)}suggest(t){if(!this.hasFast)throw Error("fast extension is disabled");this._debug("suggest %d",t),this._message(13,[t],null)}haveAll(){if(!this.hasFast)throw Error("fast extension is disabled");this._debug("have-all"),this._push(M)}haveNone(){if(!this.hasFast)throw Error("fast extension is disabled");this._debug("have-none"),this._push(k)}reject(t,e,i){if(!this.hasFast)throw Error("fast extension is disabled");this._debug("reject index=%d offset=%d length=%d",t,e,i),this._pull(this.peerRequests,t,e,i),this._message(16,[t,e,i],null)}allowedFast(t){if(!this.hasFast)throw Error("fast extension is disabled");this._debug("allowed-fast %d",t),this.allowedFastSet.includes(t)||this.allowedFastSet.push(t),this._message(17,[t],null)}extended(t,e){if(this._debug("extended ext=%s",t),"string"==typeof t&&this.peerExtendedMapping[t]&&(t=this.peerExtendedMapping[t]),"number"!=typeof t)throw new Error(`Unrecognized extension: ${t}`);{const i=r.from([t]),n=r.isBuffer(e)?e:s.encode(e);this._message(20,[],r.concat([i,n]))}}setEncrypt(t,e){let i,n,s,o,a,h;switch(this.type){case"tcpIncoming":i=l.sync(r.from(this._utfToHex("keyB")+t+e,"hex")),n=l.sync(r.from(this._utfToHex("keyA")+t+e,"hex")),s=r.from(i,"hex"),o=[];for(const t of s.values())o.push(t);a=r.from(n,"hex"),h=[];for(const t of a.values())h.push(t);this._encryptGenerator=new f(o),this._decryptGenerator=new f(h);break;case"tcpOutgoing":i=l.sync(r.from(this._utfToHex("keyA")+t+e,"hex")),n=l.sync(r.from(this._utfToHex("keyB")+t+e,"hex")),s=r.from(i,"hex"),o=[];for(const t of s.values())o.push(t);a=r.from(n,"hex"),h=[];for(const t of a.values())h.push(t);this._encryptGenerator=new f(o),this._decryptGenerator=new f(h);break;default:return!1}for(let t=0;t<1024;t++)this._encryptGenerator.randomByte(),this._decryptGenerator.randomByte();return this._setGenerators=!0,!0}_read(){}_message(t,e,i){const n=i?i.length:0,s=r.allocUnsafe(5+4*e.length);s.writeUInt32BE(s.length+n-4,0),s[4]=t;for(let t=0;t{if(n===this._pull(this.peerRequests,t,e,i))return r?(this._debug("error satisfying request index=%d offset=%d length=%d (%s)",t,e,i,r.message),void(this.hasFast&&this.reject(t,e,i))):void this.piece(t,e,s)},n=new A(t,e,i,r);this.peerRequests.push(n),this.emit("request",t,e,i,r)}_onPiece(t,e,i){this._debug("got piece index=%d offset=%d",t,e),this._callback(this._pull(this.requests,t,e,i.length),null,i),this.downloaded+=i.length,this.downloadSpeed(i.length),this.emit("download",i.length),this.emit("piece",t,e,i)}_onCancel(t,e,i){this._debug("got cancel index=%d offset=%d length=%d",t,e,i),this._pull(this.peerRequests,t,e,i),this.emit("cancel",t,e,i)}_onPort(t){this._debug("got port %d",t),this.emit("port",t)}_onSuggest(t){if(!this.hasFast)return this._debug("Error: got suggest whereas fast extension is disabled"),void this.destroy();this._debug("got suggest %d",t),this.emit("suggest",t)}_onHaveAll(){if(!this.hasFast)return this._debug("Error: got have-all whereas fast extension is disabled"),void this.destroy();this._debug("got have-all"),this.peerPieces=new I,this.emit("have-all")}_onHaveNone(){if(!this.hasFast)return this._debug("Error: got have-none whereas fast extension is disabled"),void this.destroy();this._debug("got have-none"),this.emit("have-none")}_onReject(t,e,i){if(!this.hasFast)return this._debug("Error: got reject whereas fast extension is disabled"),void this.destroy();this._debug("got reject index=%d offset=%d length=%d",t,e,i),this._callback(this._pull(this.requests,t,e,i),new Error("request was rejected"),null),this.emit("reject",t,e,i)}_onAllowedFast(t){if(!this.hasFast)return this._debug("Error: got allowed-fast whereas fast extension is disabled"),void this.destroy();this._debug("got allowed-fast %d",t),this.peerAllowedFastSet.includes(t)||this.peerAllowedFastSet.push(t),this.peerAllowedFastSet.length>100&&this.peerAllowedFastSet.shift(),this.emit("allowed-fast",t)}_onExtended(t,e){if(0===t){let t;try{t=s.decode(e)}catch(t){this._debug("ignoring invalid extended handshake: %s",t.message||t)}if(!t)return;if(this.peerExtendedHandshake=t,"object"==typeof t.m)for(const e in t.m)this.peerExtendedMapping[e]=Number(t.m[e].toString());for(const t in this._ext)this.peerExtendedMapping[t]&&this._ext[t].onExtendedHandshake(this.peerExtendedHandshake);this._debug("got extended handshake"),this.emit("extended","handshake",this.peerExtendedHandshake)}else this.extendedMapping[t]&&(t=this.extendedMapping[t],this._ext[t]&&this._ext[t].onMessage(e)),this._debug("got extended message ext=%s",t),this.emit("extended",t,e)}_onTimeout(){this._debug("request timed out"),this._callback(this.requests.shift(),new Error("request has timed out"),null),this.emit("timeout")}_write(t,e,i){if(2===this._encryptionMethod&&this._cryptoHandshakeDone&&(t=this._decrypt(t)),this._bufferSize+=t.length,this._buffer.push(t),this._buffer.length>1&&(this._buffer=[r.concat(this._buffer,this._bufferSize)]),this._cryptoSyncPattern){const e=this._buffer[0].indexOf(this._cryptoSyncPattern);if(-1!==e)this._buffer[0]=this._buffer[0].slice(e+this._cryptoSyncPattern.length),this._bufferSize-=e+this._cryptoSyncPattern.length,this._cryptoSyncPattern=null;else if(this._bufferSize+t.length>this._waitMaxBytes+this._cryptoSyncPattern.length)return this._debug("Error: could not resynchronize"),void this.destroy()}for(;this._bufferSize>=this._parserSize&&!this._cryptoSyncPattern;)if(0===this._parserSize)this._parser(r.from([]));else{const t=this._buffer[0];this._bufferSize-=this._parserSize,this._buffer=this._bufferSize?[t.slice(this._parserSize)]:[],this._parser(t.slice(0,this._parserSize))}i(null)}_callback(t,e,i){t&&(this._resetTimeout(!this.peerChoking&&!this._finished),t.callback(e,i))}_resetTimeout(t){if(!t||!this._timeoutMs||!this.requests.length)return clearTimeout(this._timeout),this._timeout=null,void(this._timeoutExpiresAt=null);const e=Date.now()+this._timeoutMs;if(this._timeout){if(e-this._timeoutExpiresAt<.05*this._timeoutMs)return;clearTimeout(this._timeout)}this._timeoutExpiresAt=e,this._timeout=setTimeout((()=>this._onTimeout()),this._timeoutMs),this._timeoutUnref&&this._timeout.unref&&this._timeout.unref()}_parse(t,e){this._parserSize=t,this._parser=e}_parseUntil(t,e){this._cryptoSyncPattern=t,this._waitMaxBytes=e}_onMessageLength(t){const e=t.readUInt32BE(0);e>0?this._parse(e,this._onMessage):(this._onKeepAlive(),this._parse(4,this._onMessageLength))}_onMessage(t){switch(this._parse(4,this._onMessageLength),t[0]){case 0:return this._onChoke();case 1:return this._onUnchoke();case 2:return this._onInterested();case 3:return this._onUninterested();case 4:return this._onHave(t.readUInt32BE(1));case 5:return this._onBitField(t.slice(1));case 6:return this._onRequest(t.readUInt32BE(1),t.readUInt32BE(5),t.readUInt32BE(9));case 7:return this._onPiece(t.readUInt32BE(1),t.readUInt32BE(5),t.slice(9));case 8:return this._onCancel(t.readUInt32BE(1),t.readUInt32BE(5),t.readUInt32BE(9));case 9:return this._onPort(t.readUInt16BE(1));case 13:return this._onSuggest(t.readUInt32BE(1));case 14:return this._onHaveAll();case 15:return this._onHaveNone();case 16:return this._onReject(t.readUInt32BE(1),t.readUInt32BE(5),t.readUInt32BE(9));case 17:return this._onAllowedFast(t.readUInt32BE(1));case 20:return this._onExtended(t.readUInt8(1),t.slice(2));default:return this._debug("got unknown message"),this.emit("unknownmessage",t)}}_determineHandshakeType(){this._parse(1,(t=>{const e=t.readUInt8(0);19===e?this._parse(e+48,this._onHandshakeBuffer):this._parsePe1(t)}))}_parsePe1(t){this._parse(95,(e=>{this._onPe1(r.concat([t,e])),this._parsePe3()}))}_parsePe2(){this._parse(96,(t=>{for(this._onPe2(t);!this._setGenerators;);this._parsePe4()}))}_parsePe3(){const t=r.from(l.sync(r.from(this._utfToHex("req1")+this._sharedSecret,"hex")),"hex");this._parseUntil(t,512),this._parse(20,(t=>{for(this._onPe3(t);!this._setGenerators;);this._parsePe3Encrypted()}))}_parsePe3Encrypted(){this._parse(14,(t=>{const e=this._decryptHandshake(t.slice(0,8)),i=this._decryptHandshake(t.slice(8,12)),r=this._decryptHandshake(t.slice(12,14)).readUInt16BE(0);this._parse(r,(t=>{t=this._decryptHandshake(t),this._parse(2,(r=>{const n=this._decryptHandshake(r).readUInt16BE(0);this._parse(n,(r=>{r=this._decryptHandshake(r),this._onPe3Encrypted(e,i,t,r);const s=n?r.readUInt8(0):null,o=n?r.slice(1,20):null;19===s&&"BitTorrent protocol"===o.toString()?this._onHandshakeBuffer(r.slice(1)):this._parseHandshake()}))}))}))}))}_parsePe4(){const t=this._decryptHandshake(x);this._parseUntil(t,512),this._parse(6,(t=>{const e=this._decryptHandshake(t.slice(0,4)),i=this._decryptHandshake(t.slice(4,6)).readUInt16BE(0);this._parse(i,(t=>{this._decryptHandshake(t),this._onPe4(e),this._parseHandshake(null)}))}))}_parseHandshake(){this._parse(1,(t=>{const e=t.readUInt8(0);if(19!==e)return this._debug("Error: wire not speaking BitTorrent protocol (%s)",e.toString()),void this.end();this._parse(e+48,this._onHandshakeBuffer)}))}_onHandshakeBuffer(t){const e=t.slice(0,19);if("BitTorrent protocol"!==e.toString())return this._debug("Error: wire not speaking BitTorrent protocol (%s)",e.toString()),void this.end();t=t.slice(19),this._onHandshake(t.slice(8,28),t.slice(28,48),{dht:!!(1&t[7]),fast:!!(4&t[7]),extended:!!(16&t[5])}),this._parse(4,this._onMessageLength)}_onFinish(){for(this._finished=!0,this.push(null);this.read(););for(clearInterval(this._keepAliveInterval),this._parse(Number.MAX_VALUE,(()=>{}));this.peerRequests.length;)this.peerRequests.pop();for(;this.requests.length;)this._callback(this.requests.pop(),new Error("wire was closed"),null)}_debug(...t){t[0]=`[${this._debugId}] ${t[0]}`,h(...t)}_pull(t,e,i,r){for(let s=0;s{var r=i(9590),n=i(8764).Buffer;const s=i(1227)("bittorrent-tracker:client"),o=i(7187),a=i(778),h=i(4595),u=i(8853),l=i(4375),c=i(3165),d=i(8333),f=i(59),p=i(1423);class m extends o{constructor(t={}){if(super(),!t.peerId)throw new Error("Option `peerId` is required");if(!t.infoHash)throw new Error("Option `infoHash` is required");if(!t.announce)throw new Error("Option `announce` is required");if(!r.browser&&!t.port)throw new Error("Option `port` is required");this.peerId="string"==typeof t.peerId?t.peerId:t.peerId.toString("hex"),this._peerIdBuffer=n.from(this.peerId,"hex"),this._peerIdBinary=this._peerIdBuffer.toString("binary"),this.infoHash="string"==typeof t.infoHash?t.infoHash.toLowerCase():t.infoHash.toString("hex"),this._infoHashBuffer=n.from(this.infoHash,"hex"),this._infoHashBinary=this._infoHashBuffer.toString("binary"),s("new client %s",this.infoHash),this.destroyed=!1,this._port=t.port,this._getAnnounceOpts=t.getAnnounceOpts,this._rtcConfig=t.rtcConfig,this._userAgent=t.userAgent,this._proxyOpts=t.proxyOpts,this._wrtc="function"==typeof t.wrtc?t.wrtc():t.wrtc;let e="string"==typeof t.announce?[t.announce]:null==t.announce?[]:t.announce;e=e.map((t=>("/"===(t=t.toString())[t.length-1]&&(t=t.substring(0,t.length-1)),t))),e=Array.from(new Set(e));const i=!1!==this._wrtc&&(!!this._wrtc||u.WEBRTC_SUPPORT),o=t=>{l((()=>{this.emit("warning",t)}))};this._trackers=e.map((t=>{let e;try{e=c.parseUrl(t)}catch(e){return o(new Error(`Invalid tracker URL: ${t}`)),null}const r=e.port;if(r<0||r>65535)return o(new Error(`Invalid tracker port: ${t}`)),null;const n=e.protocol;return"http:"!==n&&"https:"!==n||"function"!=typeof d?"udp:"===n&&"function"==typeof f?new f(this,t):"ws:"!==n&&"wss:"!==n||!i||"ws:"===n&&"undefined"!=typeof window&&"https:"===window.location.protocol?(o(new Error(`Unsupported tracker protocol: ${t}`)),null):new p(this,t):new d(this,t)})).filter(Boolean)}start(t){(t=this._defaultAnnounceOpts(t)).event="started",s("send `start` %o",t),this._announce(t),this._trackers.forEach((t=>{t.setInterval()}))}stop(t){(t=this._defaultAnnounceOpts(t)).event="stopped",s("send `stop` %o",t),this._announce(t)}complete(t){t||(t={}),(t=this._defaultAnnounceOpts(t)).event="completed",s("send `complete` %o",t),this._announce(t)}update(t){(t=this._defaultAnnounceOpts(t)).event&&delete t.event,s("send `update` %o",t),this._announce(t)}_announce(t){this._trackers.forEach((e=>{e.announce(t)}))}scrape(t){s("send `scrape`"),t||(t={}),this._trackers.forEach((e=>{e.scrape(t)}))}setInterval(t){s("setInterval %d",t),this._trackers.forEach((e=>{e.setInterval(t)}))}destroy(t){if(this.destroyed)return;this.destroyed=!0,s("destroy");const e=this._trackers.map((t=>e=>{t.destroy(e)}));h(e,t),this._trackers=[],this._getAnnounceOpts=null}_defaultAnnounceOpts(t={}){return null==t.numwant&&(t.numwant=c.DEFAULT_ANNOUNCE_PEERS),null==t.uploaded&&(t.uploaded=0),null==t.downloaded&&(t.downloaded=0),this._getAnnounceOpts&&(t=Object.assign({},t,this._getAnnounceOpts())),t}}m.scrape=(t,e)=>{if(e=a(e),!t.infoHash)throw new Error("Option `infoHash` is required");if(!t.announce)throw new Error("Option `announce` is required");const i=Object.assign({},t,{infoHash:Array.isArray(t.infoHash)?t.infoHash[0]:t.infoHash,peerId:n.from("01234567890123456789"),port:6881}),r=new m(i);r.once("error",e),r.once("warning",e);let s=Array.isArray(t.infoHash)?t.infoHash.length:1;const o={};return r.on("scrape",(t=>{if(s-=1,o[t.infoHash]=t,0===s){r.destroy();const t=Object.keys(o);1===t.length?e(null,o[t[0]]):e(null,o)}})),t.infoHash=Array.isArray(t.infoHash)?t.infoHash.map((t=>n.from(t,"hex"))):n.from(t.infoHash,"hex"),r.scrape({infoHash:t.infoHash}),r},t.exports=m},4394:(t,e,i)=>{const r=i(7187);t.exports=class extends r{constructor(t,e){super(),this.client=t,this.announceUrl=e,this.interval=null,this.destroyed=!1}setInterval(t){null==t&&(t=this.DEFAULT_ANNOUNCE_INTERVAL),clearInterval(this.interval),t&&(this.interval=setInterval((()=>{this.announce(this.client._defaultAnnounceOpts())}),t),this.interval.unref&&this.interval.unref())}}},1423:(t,e,i)=>{const r=i(6313),n=i(1227)("bittorrent-tracker:websocket-tracker"),s=i(8853),o=i(1798),a=i(522),h=i(9354),u=i(3165),l=i(4394),c={};class d extends l{constructor(t,e){super(t,e),n("new websocket tracker %s",e),this.peers={},this.socket=null,this.reconnecting=!1,this.retries=0,this.reconnectTimer=null,this.expectingResponse=!1,this._openSocket()}announce(t){if(this.destroyed||this.reconnecting)return;if(!this.socket.connected)return void this.socket.once("connect",(()=>{this.announce(t)}));const e=Object.assign({},t,{action:"announce",info_hash:this.client._infoHashBinary,peer_id:this.client._peerIdBinary});if(this._trackerId&&(e.trackerid=this._trackerId),"stopped"===t.event||"completed"===t.event)this._send(e);else{const i=Math.min(t.numwant,5);this._generateOffers(i,(t=>{e.numwant=i,e.offers=t,this._send(e)}))}}scrape(t){if(this.destroyed||this.reconnecting)return;if(!this.socket.connected)return void this.socket.once("connect",(()=>{this.scrape(t)}));const e={action:"scrape",info_hash:Array.isArray(t.infoHash)&&t.infoHash.length>0?t.infoHash.map((t=>t.toString("binary"))):t.infoHash&&t.infoHash.toString("binary")||this.client._infoHashBinary};this._send(e)}destroy(t=f){if(this.destroyed)return t(null);this.destroyed=!0,clearInterval(this.interval),clearTimeout(this.reconnectTimer);for(const t in this.peers){const e=this.peers[t];clearTimeout(e.trackerTimeout),e.destroy()}if(this.peers=null,this.socket&&(this.socket.removeListener("connect",this._onSocketConnectBound),this.socket.removeListener("data",this._onSocketDataBound),this.socket.removeListener("close",this._onSocketCloseBound),this.socket.removeListener("error",this._onSocketErrorBound),this.socket=null),this._onSocketConnectBound=null,this._onSocketErrorBound=null,this._onSocketDataBound=null,this._onSocketCloseBound=null,c[this.announceUrl]&&(c[this.announceUrl].consumers-=1),c[this.announceUrl].consumers>0)return t();let e,i=c[this.announceUrl];if(delete c[this.announceUrl],i.on("error",f),i.once("close",t),!this.expectingResponse)return r();function r(){e&&(clearTimeout(e),e=null),i.removeListener("data",r),i.destroy(),i=null}e=setTimeout(r,u.DESTROY_TIMEOUT),i.once("data",r)}_openSocket(){if(this.destroyed=!1,this.peers||(this.peers={}),this._onSocketConnectBound=()=>{this._onSocketConnect()},this._onSocketErrorBound=t=>{this._onSocketError(t)},this._onSocketDataBound=t=>{this._onSocketData(t)},this._onSocketCloseBound=()=>{this._onSocketClose()},this.socket=c[this.announceUrl],this.socket)c[this.announceUrl].consumers+=1,this.socket.connected&&this._onSocketConnectBound();else{const t=new URL(this.announceUrl);let e;this.client._proxyOpts&&(e="wss:"===t.protocol?this.client._proxyOpts.httpsAgent:this.client._proxyOpts.httpAgent,!e&&this.client._proxyOpts.socksProxy&&(e=new h.Agent(r(this.client._proxyOpts.socksProxy),"wss:"===t.protocol))),this.socket=c[this.announceUrl]=new a({url:this.announceUrl,agent:e}),this.socket.consumers=1,this.socket.once("connect",this._onSocketConnectBound)}this.socket.on("data",this._onSocketDataBound),this.socket.once("close",this._onSocketCloseBound),this.socket.once("error",this._onSocketErrorBound)}_onSocketConnect(){this.destroyed||this.reconnecting&&(this.reconnecting=!1,this.retries=0,this.announce(this.client._defaultAnnounceOpts()))}_onSocketData(t){if(!this.destroyed){this.expectingResponse=!1;try{t=JSON.parse(t)}catch(t){return void this.client.emit("warning",new Error("Invalid tracker response"))}"announce"===t.action?this._onAnnounceResponse(t):"scrape"===t.action?this._onScrapeResponse(t):this._onSocketError(new Error(`invalid action in WS response: ${t.action}`))}}_onAnnounceResponse(t){if(t.info_hash!==this.client._infoHashBinary)return void n("ignoring websocket data from %s for %s (looking for %s: reused socket)",this.announceUrl,u.binaryToHex(t.info_hash),this.client.infoHash);if(t.peer_id&&t.peer_id===this.client._peerIdBinary)return;n("received %s from %s for %s",JSON.stringify(t),this.announceUrl,this.client.infoHash);const e=t["failure reason"];if(e)return this.client.emit("warning",new Error(e));const i=t["warning message"];i&&this.client.emit("warning",new Error(i));const r=t.interval||t["min interval"];r&&this.setInterval(1e3*r);const s=t["tracker id"];if(s&&(this._trackerId=s),null!=t.complete){const e=Object.assign({},t,{announce:this.announceUrl,infoHash:u.binaryToHex(t.info_hash)});this.client.emit("update",e)}let o;if(t.offer&&t.peer_id&&(n("creating peer (from remote offer)"),o=this._createPeer(),o.id=u.binaryToHex(t.peer_id),o.once("signal",(e=>{const i={action:"announce",info_hash:this.client._infoHashBinary,peer_id:this.client._peerIdBinary,to_peer_id:t.peer_id,answer:e,offer_id:t.offer_id};this._trackerId&&(i.trackerid=this._trackerId),this._send(i)})),this.client.emit("peer",o),o.signal(t.offer)),t.answer&&t.peer_id){const e=u.binaryToHex(t.offer_id);o=this.peers[e],o?(o.id=u.binaryToHex(t.peer_id),this.client.emit("peer",o),o.signal(t.answer),clearTimeout(o.trackerTimeout),o.trackerTimeout=null,delete this.peers[e]):n(`got unexpected answer: ${JSON.stringify(t.answer)}`)}}_onScrapeResponse(t){t=t.files||{};const e=Object.keys(t);0!==e.length?e.forEach((e=>{const i=Object.assign(t[e],{announce:this.announceUrl,infoHash:u.binaryToHex(e)});this.client.emit("scrape",i)})):this.client.emit("warning",new Error("invalid scrape response"))}_onSocketClose(){this.destroyed||(this.destroy(),this._startReconnectTimer())}_onSocketError(t){this.destroyed||(this.destroy(),this.client.emit("warning",t),this._startReconnectTimer())}_startReconnectTimer(){const t=Math.floor(3e5*Math.random())+Math.min(1e4*Math.pow(2,this.retries),36e5);this.reconnecting=!0,clearTimeout(this.reconnectTimer),this.reconnectTimer=setTimeout((()=>{this.retries++,this._openSocket()}),t),this.reconnectTimer.unref&&this.reconnectTimer.unref(),n("reconnecting socket in %s ms",t)}_send(t){if(this.destroyed)return;this.expectingResponse=!0;const e=JSON.stringify(t);n("send %s",e),this.socket.send(e)}_generateOffers(t,e){const i=this,r=[];n("generating %s offers",t);for(let e=0;e{r.push({offer:e,offer_id:u.hexToBinary(t)}),a()})),e.trackerTimeout=setTimeout((()=>{n("tracker timeout: destroying peer"),e.trackerTimeout=null,delete i.peers[t],e.destroy()}),5e4),e.trackerTimeout.unref&&e.trackerTimeout.unref()}function a(){r.length===t&&(n("generated %s offers",t),e(r))}a()}_createPeer(t){const e=this;t=Object.assign({trickle:!1,config:e.client._rtcConfig,wrtc:e.client._wrtc},t);const i=new s(t);return i.once("error",r),i.once("connect",(function t(){i.removeListener("error",r),i.removeListener("connect",t)})),i;function r(t){e.client.emit("warning",new Error(`Connection error: ${t.message}`)),i.destroy()}}}function f(){}d.prototype.DEFAULT_ANNOUNCE_INTERVAL=3e4,d._socketPool=c,t.exports=d},3165:(t,e,i)=>{var r=i(8764).Buffer;e.DEFAULT_ANNOUNCE_PEERS=50,e.MAX_ANNOUNCE_PEERS=82,e.binaryToHex=t=>("string"!=typeof t&&(t=String(t)),r.from(t,"binary").toString("hex")),e.hexToBinary=t=>("string"!=typeof t&&(t=String(t)),r.from(t,"hex").toString("binary")),e.parseUrl=t=>{const e=new URL(t.replace(/^udp:/,"http:"));return t.match(/^udp:/)&&Object.defineProperties(e,{href:{value:e.href.replace(/^http/,"udp")},protocol:{value:e.protocol.replace(/^http/,"udp")},origin:{value:e.origin.replace(/^http/,"udp")}}),e};const n=i(3762);Object.assign(e,n)},7619:(t,e,i)=>{var r=i(8764).Buffer;t.exports=function(t,e){if("undefined"==typeof Blob||!(t instanceof Blob))throw new Error("first argument must be a Blob");if("function"!=typeof e)throw new Error("second argument must be a function");const i=new FileReader;i.addEventListener("loadend",(function t(n){i.removeEventListener("loadend",t,!1),n.error?e(n.error):e(null,r.from(i.result))}),!1),i.readAsArrayBuffer(t)}},9e3:(t,e,i)=>{var r=i(8764).Buffer;const{Transform:n}=i(8473);t.exports=class extends n{constructor(t,e={}){super(e),"object"==typeof t&&(t=(e=t).size),this.size=t||512;const{nopad:i,zeroPadding:r=!0}=e;this._zeroPadding=!i&&!!r,this._buffered=[],this._bufferedBytes=0}_transform(t,e,i){for(this._bufferedBytes+=t.length,this._buffered.push(t);this._bufferedBytes>=this.size;){this._bufferedBytes-=this.size;const t=[];let e=0;for(;e=48&&i<=57?i-48:i>=65&&i<=70?i-55:i>=97&&i<=102?i-87:void r(!1,"Invalid character in "+t)}function h(t,e,i){var r=a(t,i);return i-1>=e&&(r|=a(t,i-1)<<4),r}function u(t,e,i,n){for(var s=0,o=0,a=Math.min(t.length,i),h=e;h=49?u-49+10:u>=17?u-17+10:u,r(u>=0&&o0?t:e},s.min=function(t,e){return t.cmp(e)<0?t:e},s.prototype._init=function(t,e,i){if("number"==typeof t)return this._initNumber(t,e,i);if("object"==typeof t)return this._initArray(t,e,i);"hex"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var n=0;"-"===(t=t.toString().replace(/\s+/g,""))[0]&&(n++,this.negative=1),n=0;n-=3)o=t[n]|t[n-1]<<8|t[n-2]<<16,this.words[s]|=o<>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);else if("le"===i)for(n=0,s=0;n>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);return this._strip()},s.prototype._parseHex=function(t,e,i){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var r=0;r=e;r-=2)n=h(t,e,r)<=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;else for(r=(t.length-e)%2==0?e+1:e;r=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;this._strip()},s.prototype._parseBase=function(t,e,i){this.words=[0],this.length=1;for(var r=0,n=1;n<=67108863;n*=e)r++;r--,n=n/e|0;for(var s=t.length-i,o=s%r,a=Math.min(s,s-o)+i,h=0,l=i;l1&&0===this.words[this.length-1];)this.length--;return this._normSign()},s.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},"undefined"!=typeof Symbol&&"function"==typeof Symbol.for)try{s.prototype[Symbol.for("nodejs.util.inspect.custom")]=c}catch(t){s.prototype.inspect=c}else s.prototype.inspect=c;function c(){return(this.red?""}var d=["","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"],f=[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],p=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function m(t,e,i){i.negative=e.negative^t.negative;var r=t.length+e.length|0;i.length=r,r=r-1|0;var n=0|t.words[0],s=0|e.words[0],o=n*s,a=67108863&o,h=o/67108864|0;i.words[0]=a;for(var u=1;u>>26,c=67108863&h,d=Math.min(u,e.length-1),f=Math.max(0,u-t.length+1);f<=d;f++){var p=u-f|0;l+=(o=(n=0|t.words[p])*(s=0|e.words[f])+c)/67108864|0,c=67108863&o}i.words[u]=0|c,h=0|l}return 0!==h?i.words[u]=0|h:i.length--,i._strip()}s.prototype.toString=function(t,e){var i;if(e=0|e||1,16===(t=t||10)||"hex"===t){i="";for(var n=0,s=0,o=0;o>>24-n&16777215)||o!==this.length-1?d[6-h.length]+h+i:h+i,(n+=2)>=26&&(n-=26,o--)}for(0!==s&&(i=s.toString(16)+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}if(t===(0|t)&&t>=2&&t<=36){var u=f[t],l=p[t];i="";var c=this.clone();for(c.negative=0;!c.isZero();){var m=c.modrn(l).toString(t);i=(c=c.idivn(l)).isZero()?m+i:d[u-m.length]+m+i}for(this.isZero()&&(i="0"+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}r(!1,"Base should be between 2 and 36")},s.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-t:t},s.prototype.toJSON=function(){return this.toString(16,2)},o&&(s.prototype.toBuffer=function(t,e){return this.toArrayLike(o,t,e)}),s.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},s.prototype.toArrayLike=function(t,e,i){this._strip();var n=this.byteLength(),s=i||Math.max(1,n);r(n<=s,"byte array longer than desired length"),r(s>0,"Requested array length <= 0");var o=function(t,e){return t.allocUnsafe?t.allocUnsafe(e):new t(e)}(t,s);return this["_toArrayLike"+("le"===e?"LE":"BE")](o,n),o},s.prototype._toArrayLikeLE=function(t,e){for(var i=0,r=0,n=0,s=0;n>8&255),i>16&255),6===s?(i>24&255),r=0,s=0):(r=o>>>24,s+=2)}if(i=0&&(t[i--]=o>>8&255),i>=0&&(t[i--]=o>>16&255),6===s?(i>=0&&(t[i--]=o>>24&255),r=0,s=0):(r=o>>>24,s+=2)}if(i>=0)for(t[i--]=r;i>=0;)t[i--]=0},Math.clz32?s.prototype._countBits=function(t){return 32-Math.clz32(t)}:s.prototype._countBits=function(t){var e=t,i=0;return e>=4096&&(i+=13,e>>>=13),e>=64&&(i+=7,e>>>=7),e>=8&&(i+=4,e>>>=4),e>=2&&(i+=2,e>>>=2),i+e},s.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,i=0;return 0==(8191&e)&&(i+=13,e>>>=13),0==(127&e)&&(i+=7,e>>>=7),0==(15&e)&&(i+=4,e>>>=4),0==(3&e)&&(i+=2,e>>>=2),0==(1&e)&&i++,i},s.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},s.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;et.length?this.clone().ior(t):t.clone().ior(this)},s.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},s.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var i=0;it.length?this.clone().iand(t):t.clone().iand(this)},s.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},s.prototype.iuxor=function(t){var e,i;this.length>t.length?(e=this,i=t):(e=t,i=this);for(var r=0;rt.length?this.clone().ixor(t):t.clone().ixor(this)},s.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},s.prototype.inotn=function(t){r("number"==typeof t&&t>=0);var e=0|Math.ceil(t/26),i=t%26;this._expand(e),i>0&&e--;for(var n=0;n0&&(this.words[n]=~this.words[n]&67108863>>26-i),this._strip()},s.prototype.notn=function(t){return this.clone().inotn(t)},s.prototype.setn=function(t,e){r("number"==typeof t&&t>=0);var i=t/26|0,n=t%26;return this._expand(i+1),this.words[i]=e?this.words[i]|1<t.length?(i=this,r=t):(i=t,r=this);for(var n=0,s=0;s>>26;for(;0!==n&&s>>26;if(this.length=i.length,0!==n)this.words[this.length]=n,this.length++;else if(i!==this)for(;st.length?this.clone().iadd(t):t.clone().iadd(this)},s.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var i,r,n=this.cmp(t);if(0===n)return this.negative=0,this.length=1,this.words[0]=0,this;n>0?(i=this,r=t):(i=t,r=this);for(var s=0,o=0;o>26,this.words[o]=67108863&e;for(;0!==s&&o>26,this.words[o]=67108863&e;if(0===s&&o>>13,f=0|o[1],p=8191&f,m=f>>>13,g=0|o[2],b=8191&g,v=g>>>13,y=0|o[3],w=8191&y,_=y>>>13,M=0|o[4],k=8191&M,x=M>>>13,E=0|o[5],S=8191&E,T=E>>>13,A=0|o[6],I=8191&A,C=A>>>13,B=0|o[7],R=8191&B,P=B>>>13,L=0|o[8],O=8191&L,D=L>>>13,N=0|o[9],j=8191&N,U=N>>>13,F=0|a[0],q=8191&F,z=F>>>13,H=0|a[1],W=8191&H,$=H>>>13,Z=0|a[2],V=8191&Z,K=Z>>>13,G=0|a[3],J=8191&G,Y=G>>>13,X=0|a[4],Q=8191&X,tt=X>>>13,et=0|a[5],it=8191&et,rt=et>>>13,nt=0|a[6],st=8191&nt,ot=nt>>>13,at=0|a[7],ht=8191&at,ut=at>>>13,lt=0|a[8],ct=8191<,dt=lt>>>13,ft=0|a[9],pt=8191&ft,mt=ft>>>13;i.negative=t.negative^e.negative,i.length=19;var gt=(u+(r=Math.imul(c,q))|0)+((8191&(n=(n=Math.imul(c,z))+Math.imul(d,q)|0))<<13)|0;u=((s=Math.imul(d,z))+(n>>>13)|0)+(gt>>>26)|0,gt&=67108863,r=Math.imul(p,q),n=(n=Math.imul(p,z))+Math.imul(m,q)|0,s=Math.imul(m,z);var bt=(u+(r=r+Math.imul(c,W)|0)|0)+((8191&(n=(n=n+Math.imul(c,$)|0)+Math.imul(d,W)|0))<<13)|0;u=((s=s+Math.imul(d,$)|0)+(n>>>13)|0)+(bt>>>26)|0,bt&=67108863,r=Math.imul(b,q),n=(n=Math.imul(b,z))+Math.imul(v,q)|0,s=Math.imul(v,z),r=r+Math.imul(p,W)|0,n=(n=n+Math.imul(p,$)|0)+Math.imul(m,W)|0,s=s+Math.imul(m,$)|0;var vt=(u+(r=r+Math.imul(c,V)|0)|0)+((8191&(n=(n=n+Math.imul(c,K)|0)+Math.imul(d,V)|0))<<13)|0;u=((s=s+Math.imul(d,K)|0)+(n>>>13)|0)+(vt>>>26)|0,vt&=67108863,r=Math.imul(w,q),n=(n=Math.imul(w,z))+Math.imul(_,q)|0,s=Math.imul(_,z),r=r+Math.imul(b,W)|0,n=(n=n+Math.imul(b,$)|0)+Math.imul(v,W)|0,s=s+Math.imul(v,$)|0,r=r+Math.imul(p,V)|0,n=(n=n+Math.imul(p,K)|0)+Math.imul(m,V)|0,s=s+Math.imul(m,K)|0;var yt=(u+(r=r+Math.imul(c,J)|0)|0)+((8191&(n=(n=n+Math.imul(c,Y)|0)+Math.imul(d,J)|0))<<13)|0;u=((s=s+Math.imul(d,Y)|0)+(n>>>13)|0)+(yt>>>26)|0,yt&=67108863,r=Math.imul(k,q),n=(n=Math.imul(k,z))+Math.imul(x,q)|0,s=Math.imul(x,z),r=r+Math.imul(w,W)|0,n=(n=n+Math.imul(w,$)|0)+Math.imul(_,W)|0,s=s+Math.imul(_,$)|0,r=r+Math.imul(b,V)|0,n=(n=n+Math.imul(b,K)|0)+Math.imul(v,V)|0,s=s+Math.imul(v,K)|0,r=r+Math.imul(p,J)|0,n=(n=n+Math.imul(p,Y)|0)+Math.imul(m,J)|0,s=s+Math.imul(m,Y)|0;var wt=(u+(r=r+Math.imul(c,Q)|0)|0)+((8191&(n=(n=n+Math.imul(c,tt)|0)+Math.imul(d,Q)|0))<<13)|0;u=((s=s+Math.imul(d,tt)|0)+(n>>>13)|0)+(wt>>>26)|0,wt&=67108863,r=Math.imul(S,q),n=(n=Math.imul(S,z))+Math.imul(T,q)|0,s=Math.imul(T,z),r=r+Math.imul(k,W)|0,n=(n=n+Math.imul(k,$)|0)+Math.imul(x,W)|0,s=s+Math.imul(x,$)|0,r=r+Math.imul(w,V)|0,n=(n=n+Math.imul(w,K)|0)+Math.imul(_,V)|0,s=s+Math.imul(_,K)|0,r=r+Math.imul(b,J)|0,n=(n=n+Math.imul(b,Y)|0)+Math.imul(v,J)|0,s=s+Math.imul(v,Y)|0,r=r+Math.imul(p,Q)|0,n=(n=n+Math.imul(p,tt)|0)+Math.imul(m,Q)|0,s=s+Math.imul(m,tt)|0;var _t=(u+(r=r+Math.imul(c,it)|0)|0)+((8191&(n=(n=n+Math.imul(c,rt)|0)+Math.imul(d,it)|0))<<13)|0;u=((s=s+Math.imul(d,rt)|0)+(n>>>13)|0)+(_t>>>26)|0,_t&=67108863,r=Math.imul(I,q),n=(n=Math.imul(I,z))+Math.imul(C,q)|0,s=Math.imul(C,z),r=r+Math.imul(S,W)|0,n=(n=n+Math.imul(S,$)|0)+Math.imul(T,W)|0,s=s+Math.imul(T,$)|0,r=r+Math.imul(k,V)|0,n=(n=n+Math.imul(k,K)|0)+Math.imul(x,V)|0,s=s+Math.imul(x,K)|0,r=r+Math.imul(w,J)|0,n=(n=n+Math.imul(w,Y)|0)+Math.imul(_,J)|0,s=s+Math.imul(_,Y)|0,r=r+Math.imul(b,Q)|0,n=(n=n+Math.imul(b,tt)|0)+Math.imul(v,Q)|0,s=s+Math.imul(v,tt)|0,r=r+Math.imul(p,it)|0,n=(n=n+Math.imul(p,rt)|0)+Math.imul(m,it)|0,s=s+Math.imul(m,rt)|0;var Mt=(u+(r=r+Math.imul(c,st)|0)|0)+((8191&(n=(n=n+Math.imul(c,ot)|0)+Math.imul(d,st)|0))<<13)|0;u=((s=s+Math.imul(d,ot)|0)+(n>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,r=Math.imul(R,q),n=(n=Math.imul(R,z))+Math.imul(P,q)|0,s=Math.imul(P,z),r=r+Math.imul(I,W)|0,n=(n=n+Math.imul(I,$)|0)+Math.imul(C,W)|0,s=s+Math.imul(C,$)|0,r=r+Math.imul(S,V)|0,n=(n=n+Math.imul(S,K)|0)+Math.imul(T,V)|0,s=s+Math.imul(T,K)|0,r=r+Math.imul(k,J)|0,n=(n=n+Math.imul(k,Y)|0)+Math.imul(x,J)|0,s=s+Math.imul(x,Y)|0,r=r+Math.imul(w,Q)|0,n=(n=n+Math.imul(w,tt)|0)+Math.imul(_,Q)|0,s=s+Math.imul(_,tt)|0,r=r+Math.imul(b,it)|0,n=(n=n+Math.imul(b,rt)|0)+Math.imul(v,it)|0,s=s+Math.imul(v,rt)|0,r=r+Math.imul(p,st)|0,n=(n=n+Math.imul(p,ot)|0)+Math.imul(m,st)|0,s=s+Math.imul(m,ot)|0;var kt=(u+(r=r+Math.imul(c,ht)|0)|0)+((8191&(n=(n=n+Math.imul(c,ut)|0)+Math.imul(d,ht)|0))<<13)|0;u=((s=s+Math.imul(d,ut)|0)+(n>>>13)|0)+(kt>>>26)|0,kt&=67108863,r=Math.imul(O,q),n=(n=Math.imul(O,z))+Math.imul(D,q)|0,s=Math.imul(D,z),r=r+Math.imul(R,W)|0,n=(n=n+Math.imul(R,$)|0)+Math.imul(P,W)|0,s=s+Math.imul(P,$)|0,r=r+Math.imul(I,V)|0,n=(n=n+Math.imul(I,K)|0)+Math.imul(C,V)|0,s=s+Math.imul(C,K)|0,r=r+Math.imul(S,J)|0,n=(n=n+Math.imul(S,Y)|0)+Math.imul(T,J)|0,s=s+Math.imul(T,Y)|0,r=r+Math.imul(k,Q)|0,n=(n=n+Math.imul(k,tt)|0)+Math.imul(x,Q)|0,s=s+Math.imul(x,tt)|0,r=r+Math.imul(w,it)|0,n=(n=n+Math.imul(w,rt)|0)+Math.imul(_,it)|0,s=s+Math.imul(_,rt)|0,r=r+Math.imul(b,st)|0,n=(n=n+Math.imul(b,ot)|0)+Math.imul(v,st)|0,s=s+Math.imul(v,ot)|0,r=r+Math.imul(p,ht)|0,n=(n=n+Math.imul(p,ut)|0)+Math.imul(m,ht)|0,s=s+Math.imul(m,ut)|0;var xt=(u+(r=r+Math.imul(c,ct)|0)|0)+((8191&(n=(n=n+Math.imul(c,dt)|0)+Math.imul(d,ct)|0))<<13)|0;u=((s=s+Math.imul(d,dt)|0)+(n>>>13)|0)+(xt>>>26)|0,xt&=67108863,r=Math.imul(j,q),n=(n=Math.imul(j,z))+Math.imul(U,q)|0,s=Math.imul(U,z),r=r+Math.imul(O,W)|0,n=(n=n+Math.imul(O,$)|0)+Math.imul(D,W)|0,s=s+Math.imul(D,$)|0,r=r+Math.imul(R,V)|0,n=(n=n+Math.imul(R,K)|0)+Math.imul(P,V)|0,s=s+Math.imul(P,K)|0,r=r+Math.imul(I,J)|0,n=(n=n+Math.imul(I,Y)|0)+Math.imul(C,J)|0,s=s+Math.imul(C,Y)|0,r=r+Math.imul(S,Q)|0,n=(n=n+Math.imul(S,tt)|0)+Math.imul(T,Q)|0,s=s+Math.imul(T,tt)|0,r=r+Math.imul(k,it)|0,n=(n=n+Math.imul(k,rt)|0)+Math.imul(x,it)|0,s=s+Math.imul(x,rt)|0,r=r+Math.imul(w,st)|0,n=(n=n+Math.imul(w,ot)|0)+Math.imul(_,st)|0,s=s+Math.imul(_,ot)|0,r=r+Math.imul(b,ht)|0,n=(n=n+Math.imul(b,ut)|0)+Math.imul(v,ht)|0,s=s+Math.imul(v,ut)|0,r=r+Math.imul(p,ct)|0,n=(n=n+Math.imul(p,dt)|0)+Math.imul(m,ct)|0,s=s+Math.imul(m,dt)|0;var Et=(u+(r=r+Math.imul(c,pt)|0)|0)+((8191&(n=(n=n+Math.imul(c,mt)|0)+Math.imul(d,pt)|0))<<13)|0;u=((s=s+Math.imul(d,mt)|0)+(n>>>13)|0)+(Et>>>26)|0,Et&=67108863,r=Math.imul(j,W),n=(n=Math.imul(j,$))+Math.imul(U,W)|0,s=Math.imul(U,$),r=r+Math.imul(O,V)|0,n=(n=n+Math.imul(O,K)|0)+Math.imul(D,V)|0,s=s+Math.imul(D,K)|0,r=r+Math.imul(R,J)|0,n=(n=n+Math.imul(R,Y)|0)+Math.imul(P,J)|0,s=s+Math.imul(P,Y)|0,r=r+Math.imul(I,Q)|0,n=(n=n+Math.imul(I,tt)|0)+Math.imul(C,Q)|0,s=s+Math.imul(C,tt)|0,r=r+Math.imul(S,it)|0,n=(n=n+Math.imul(S,rt)|0)+Math.imul(T,it)|0,s=s+Math.imul(T,rt)|0,r=r+Math.imul(k,st)|0,n=(n=n+Math.imul(k,ot)|0)+Math.imul(x,st)|0,s=s+Math.imul(x,ot)|0,r=r+Math.imul(w,ht)|0,n=(n=n+Math.imul(w,ut)|0)+Math.imul(_,ht)|0,s=s+Math.imul(_,ut)|0,r=r+Math.imul(b,ct)|0,n=(n=n+Math.imul(b,dt)|0)+Math.imul(v,ct)|0,s=s+Math.imul(v,dt)|0;var St=(u+(r=r+Math.imul(p,pt)|0)|0)+((8191&(n=(n=n+Math.imul(p,mt)|0)+Math.imul(m,pt)|0))<<13)|0;u=((s=s+Math.imul(m,mt)|0)+(n>>>13)|0)+(St>>>26)|0,St&=67108863,r=Math.imul(j,V),n=(n=Math.imul(j,K))+Math.imul(U,V)|0,s=Math.imul(U,K),r=r+Math.imul(O,J)|0,n=(n=n+Math.imul(O,Y)|0)+Math.imul(D,J)|0,s=s+Math.imul(D,Y)|0,r=r+Math.imul(R,Q)|0,n=(n=n+Math.imul(R,tt)|0)+Math.imul(P,Q)|0,s=s+Math.imul(P,tt)|0,r=r+Math.imul(I,it)|0,n=(n=n+Math.imul(I,rt)|0)+Math.imul(C,it)|0,s=s+Math.imul(C,rt)|0,r=r+Math.imul(S,st)|0,n=(n=n+Math.imul(S,ot)|0)+Math.imul(T,st)|0,s=s+Math.imul(T,ot)|0,r=r+Math.imul(k,ht)|0,n=(n=n+Math.imul(k,ut)|0)+Math.imul(x,ht)|0,s=s+Math.imul(x,ut)|0,r=r+Math.imul(w,ct)|0,n=(n=n+Math.imul(w,dt)|0)+Math.imul(_,ct)|0,s=s+Math.imul(_,dt)|0;var Tt=(u+(r=r+Math.imul(b,pt)|0)|0)+((8191&(n=(n=n+Math.imul(b,mt)|0)+Math.imul(v,pt)|0))<<13)|0;u=((s=s+Math.imul(v,mt)|0)+(n>>>13)|0)+(Tt>>>26)|0,Tt&=67108863,r=Math.imul(j,J),n=(n=Math.imul(j,Y))+Math.imul(U,J)|0,s=Math.imul(U,Y),r=r+Math.imul(O,Q)|0,n=(n=n+Math.imul(O,tt)|0)+Math.imul(D,Q)|0,s=s+Math.imul(D,tt)|0,r=r+Math.imul(R,it)|0,n=(n=n+Math.imul(R,rt)|0)+Math.imul(P,it)|0,s=s+Math.imul(P,rt)|0,r=r+Math.imul(I,st)|0,n=(n=n+Math.imul(I,ot)|0)+Math.imul(C,st)|0,s=s+Math.imul(C,ot)|0,r=r+Math.imul(S,ht)|0,n=(n=n+Math.imul(S,ut)|0)+Math.imul(T,ht)|0,s=s+Math.imul(T,ut)|0,r=r+Math.imul(k,ct)|0,n=(n=n+Math.imul(k,dt)|0)+Math.imul(x,ct)|0,s=s+Math.imul(x,dt)|0;var At=(u+(r=r+Math.imul(w,pt)|0)|0)+((8191&(n=(n=n+Math.imul(w,mt)|0)+Math.imul(_,pt)|0))<<13)|0;u=((s=s+Math.imul(_,mt)|0)+(n>>>13)|0)+(At>>>26)|0,At&=67108863,r=Math.imul(j,Q),n=(n=Math.imul(j,tt))+Math.imul(U,Q)|0,s=Math.imul(U,tt),r=r+Math.imul(O,it)|0,n=(n=n+Math.imul(O,rt)|0)+Math.imul(D,it)|0,s=s+Math.imul(D,rt)|0,r=r+Math.imul(R,st)|0,n=(n=n+Math.imul(R,ot)|0)+Math.imul(P,st)|0,s=s+Math.imul(P,ot)|0,r=r+Math.imul(I,ht)|0,n=(n=n+Math.imul(I,ut)|0)+Math.imul(C,ht)|0,s=s+Math.imul(C,ut)|0,r=r+Math.imul(S,ct)|0,n=(n=n+Math.imul(S,dt)|0)+Math.imul(T,ct)|0,s=s+Math.imul(T,dt)|0;var It=(u+(r=r+Math.imul(k,pt)|0)|0)+((8191&(n=(n=n+Math.imul(k,mt)|0)+Math.imul(x,pt)|0))<<13)|0;u=((s=s+Math.imul(x,mt)|0)+(n>>>13)|0)+(It>>>26)|0,It&=67108863,r=Math.imul(j,it),n=(n=Math.imul(j,rt))+Math.imul(U,it)|0,s=Math.imul(U,rt),r=r+Math.imul(O,st)|0,n=(n=n+Math.imul(O,ot)|0)+Math.imul(D,st)|0,s=s+Math.imul(D,ot)|0,r=r+Math.imul(R,ht)|0,n=(n=n+Math.imul(R,ut)|0)+Math.imul(P,ht)|0,s=s+Math.imul(P,ut)|0,r=r+Math.imul(I,ct)|0,n=(n=n+Math.imul(I,dt)|0)+Math.imul(C,ct)|0,s=s+Math.imul(C,dt)|0;var Ct=(u+(r=r+Math.imul(S,pt)|0)|0)+((8191&(n=(n=n+Math.imul(S,mt)|0)+Math.imul(T,pt)|0))<<13)|0;u=((s=s+Math.imul(T,mt)|0)+(n>>>13)|0)+(Ct>>>26)|0,Ct&=67108863,r=Math.imul(j,st),n=(n=Math.imul(j,ot))+Math.imul(U,st)|0,s=Math.imul(U,ot),r=r+Math.imul(O,ht)|0,n=(n=n+Math.imul(O,ut)|0)+Math.imul(D,ht)|0,s=s+Math.imul(D,ut)|0,r=r+Math.imul(R,ct)|0,n=(n=n+Math.imul(R,dt)|0)+Math.imul(P,ct)|0,s=s+Math.imul(P,dt)|0;var Bt=(u+(r=r+Math.imul(I,pt)|0)|0)+((8191&(n=(n=n+Math.imul(I,mt)|0)+Math.imul(C,pt)|0))<<13)|0;u=((s=s+Math.imul(C,mt)|0)+(n>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,r=Math.imul(j,ht),n=(n=Math.imul(j,ut))+Math.imul(U,ht)|0,s=Math.imul(U,ut),r=r+Math.imul(O,ct)|0,n=(n=n+Math.imul(O,dt)|0)+Math.imul(D,ct)|0,s=s+Math.imul(D,dt)|0;var Rt=(u+(r=r+Math.imul(R,pt)|0)|0)+((8191&(n=(n=n+Math.imul(R,mt)|0)+Math.imul(P,pt)|0))<<13)|0;u=((s=s+Math.imul(P,mt)|0)+(n>>>13)|0)+(Rt>>>26)|0,Rt&=67108863,r=Math.imul(j,ct),n=(n=Math.imul(j,dt))+Math.imul(U,ct)|0,s=Math.imul(U,dt);var Pt=(u+(r=r+Math.imul(O,pt)|0)|0)+((8191&(n=(n=n+Math.imul(O,mt)|0)+Math.imul(D,pt)|0))<<13)|0;u=((s=s+Math.imul(D,mt)|0)+(n>>>13)|0)+(Pt>>>26)|0,Pt&=67108863;var Lt=(u+(r=Math.imul(j,pt))|0)+((8191&(n=(n=Math.imul(j,mt))+Math.imul(U,pt)|0))<<13)|0;return u=((s=Math.imul(U,mt))+(n>>>13)|0)+(Lt>>>26)|0,Lt&=67108863,h[0]=gt,h[1]=bt,h[2]=vt,h[3]=yt,h[4]=wt,h[5]=_t,h[6]=Mt,h[7]=kt,h[8]=xt,h[9]=Et,h[10]=St,h[11]=Tt,h[12]=At,h[13]=It,h[14]=Ct,h[15]=Bt,h[16]=Rt,h[17]=Pt,h[18]=Lt,0!==u&&(h[19]=u,i.length++),i};function b(t,e,i){i.negative=e.negative^t.negative,i.length=t.length+e.length;for(var r=0,n=0,s=0;s>>26)|0)>>>26,o&=67108863}i.words[s]=a,r=o,o=n}return 0!==r?i.words[s]=r:i.length--,i._strip()}function v(t,e,i){return b(t,e,i)}function y(t,e){this.x=t,this.y=e}Math.imul||(g=m),s.prototype.mulTo=function(t,e){var i=this.length+t.length;return 10===this.length&&10===t.length?g(this,t,e):i<63?m(this,t,e):i<1024?b(this,t,e):v(this,t,e)},y.prototype.makeRBT=function(t){for(var e=new Array(t),i=s.prototype._countBits(t)-1,r=0;r>=1;return r},y.prototype.permute=function(t,e,i,r,n,s){for(var o=0;o>>=1)n++;return 1<>>=13,i[2*o+1]=8191&s,s>>>=13;for(o=2*e;o>=26,i+=s/67108864|0,i+=o>>>26,this.words[n]=67108863&o}return 0!==i&&(this.words[n]=i,this.length++),e?this.ineg():this},s.prototype.muln=function(t){return this.clone().imuln(t)},s.prototype.sqr=function(){return this.mul(this)},s.prototype.isqr=function(){return this.imul(this.clone())},s.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),i=0;i>>n&1}return e}(t);if(0===e.length)return new s(1);for(var i=this,r=0;r=0);var e,i=t%26,n=(t-i)/26,s=67108863>>>26-i<<26-i;if(0!==i){var o=0;for(e=0;e>>26-i}o&&(this.words[e]=o,this.length++)}if(0!==n){for(e=this.length-1;e>=0;e--)this.words[e+n]=this.words[e];for(e=0;e=0),n=e?(e-e%26)/26:0;var s=t%26,o=Math.min((t-s)/26,this.length),a=67108863^67108863>>>s<o)for(this.length-=o,u=0;u=0&&(0!==l||u>=n);u--){var c=0|this.words[u];this.words[u]=l<<26-s|c>>>s,l=c&a}return h&&0!==l&&(h.words[h.length++]=l),0===this.length&&(this.words[0]=0,this.length=1),this._strip()},s.prototype.ishrn=function(t,e,i){return r(0===this.negative),this.iushrn(t,e,i)},s.prototype.shln=function(t){return this.clone().ishln(t)},s.prototype.ushln=function(t){return this.clone().iushln(t)},s.prototype.shrn=function(t){return this.clone().ishrn(t)},s.prototype.ushrn=function(t){return this.clone().iushrn(t)},s.prototype.testn=function(t){r("number"==typeof t&&t>=0);var e=t%26,i=(t-e)/26,n=1<=0);var e=t%26,i=(t-e)/26;if(r(0===this.negative,"imaskn works only with positive numbers"),this.length<=i)return this;if(0!==e&&i++,this.length=Math.min(i,this.length),0!==e){var n=67108863^67108863>>>e<=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},s.prototype.isubn=function(t){if(r("number"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e>26)-(h/67108864|0),this.words[n+i]=67108863&s}for(;n>26,this.words[n+i]=67108863&s;if(0===a)return this._strip();for(r(-1===a),a=0,n=0;n>26,this.words[n]=67108863&s;return this.negative=1,this._strip()},s.prototype._wordDiv=function(t,e){var i=(this.length,t.length),r=this.clone(),n=t,o=0|n.words[n.length-1];0!=(i=26-this._countBits(o))&&(n=n.ushln(i),r.iushln(i),o=0|n.words[n.length-1]);var a,h=r.length-n.length;if("mod"!==e){(a=new s(null)).length=h+1,a.words=new Array(a.length);for(var u=0;u=0;c--){var d=67108864*(0|r.words[n.length+c])+(0|r.words[n.length+c-1]);for(d=Math.min(d/o|0,67108863),r._ishlnsubmul(n,d,c);0!==r.negative;)d--,r.negative=0,r._ishlnsubmul(n,1,c),r.isZero()||(r.negative^=1);a&&(a.words[c]=d)}return a&&a._strip(),r._strip(),"div"!==e&&0!==i&&r.iushrn(i),{div:a||null,mod:r}},s.prototype.divmod=function(t,e,i){return r(!t.isZero()),this.isZero()?{div:new s(0),mod:new s(0)}:0!==this.negative&&0===t.negative?(a=this.neg().divmod(t,e),"mod"!==e&&(n=a.div.neg()),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.iadd(t)),{div:n,mod:o}):0===this.negative&&0!==t.negative?(a=this.divmod(t.neg(),e),"mod"!==e&&(n=a.div.neg()),{div:n,mod:a.mod}):0!=(this.negative&t.negative)?(a=this.neg().divmod(t.neg(),e),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.isub(t)),{div:a.div,mod:o}):t.length>this.length||this.cmp(t)<0?{div:new s(0),mod:this}:1===t.length?"div"===e?{div:this.divn(t.words[0]),mod:null}:"mod"===e?{div:null,mod:new s(this.modrn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new s(this.modrn(t.words[0]))}:this._wordDiv(t,e);var n,o,a},s.prototype.div=function(t){return this.divmod(t,"div",!1).div},s.prototype.mod=function(t){return this.divmod(t,"mod",!1).mod},s.prototype.umod=function(t){return this.divmod(t,"mod",!0).mod},s.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var i=0!==e.div.negative?e.mod.isub(t):e.mod,r=t.ushrn(1),n=t.andln(1),s=i.cmp(r);return s<0||1===n&&0===s?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},s.prototype.modrn=function(t){var e=t<0;e&&(t=-t),r(t<=67108863);for(var i=(1<<26)%t,n=0,s=this.length-1;s>=0;s--)n=(i*n+(0|this.words[s]))%t;return e?-n:n},s.prototype.modn=function(t){return this.modrn(t)},s.prototype.idivn=function(t){var e=t<0;e&&(t=-t),r(t<=67108863);for(var i=0,n=this.length-1;n>=0;n--){var s=(0|this.words[n])+67108864*i;this.words[n]=s/t|0,i=s%t}return this._strip(),e?this.ineg():this},s.prototype.divn=function(t){return this.clone().idivn(t)},s.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n=new s(1),o=new s(0),a=new s(0),h=new s(1),u=0;e.isEven()&&i.isEven();)e.iushrn(1),i.iushrn(1),++u;for(var l=i.clone(),c=e.clone();!e.isZero();){for(var d=0,f=1;0==(e.words[0]&f)&&d<26;++d,f<<=1);if(d>0)for(e.iushrn(d);d-- >0;)(n.isOdd()||o.isOdd())&&(n.iadd(l),o.isub(c)),n.iushrn(1),o.iushrn(1);for(var p=0,m=1;0==(i.words[0]&m)&&p<26;++p,m<<=1);if(p>0)for(i.iushrn(p);p-- >0;)(a.isOdd()||h.isOdd())&&(a.iadd(l),h.isub(c)),a.iushrn(1),h.iushrn(1);e.cmp(i)>=0?(e.isub(i),n.isub(a),o.isub(h)):(i.isub(e),a.isub(n),h.isub(o))}return{a,b:h,gcd:i.iushln(u)}},s.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n,o=new s(1),a=new s(0),h=i.clone();e.cmpn(1)>0&&i.cmpn(1)>0;){for(var u=0,l=1;0==(e.words[0]&l)&&u<26;++u,l<<=1);if(u>0)for(e.iushrn(u);u-- >0;)o.isOdd()&&o.iadd(h),o.iushrn(1);for(var c=0,d=1;0==(i.words[0]&d)&&c<26;++c,d<<=1);if(c>0)for(i.iushrn(c);c-- >0;)a.isOdd()&&a.iadd(h),a.iushrn(1);e.cmp(i)>=0?(e.isub(i),o.isub(a)):(i.isub(e),a.isub(o))}return(n=0===e.cmpn(1)?o:a).cmpn(0)<0&&n.iadd(t),n},s.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),i=t.clone();e.negative=0,i.negative=0;for(var r=0;e.isEven()&&i.isEven();r++)e.iushrn(1),i.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;i.isEven();)i.iushrn(1);var n=e.cmp(i);if(n<0){var s=e;e=i,i=s}else if(0===n||0===i.cmpn(1))break;e.isub(i)}return i.iushln(r)},s.prototype.invm=function(t){return this.egcd(t).a.umod(t)},s.prototype.isEven=function(){return 0==(1&this.words[0])},s.prototype.isOdd=function(){return 1==(1&this.words[0])},s.prototype.andln=function(t){return this.words[0]&t},s.prototype.bincn=function(t){r("number"==typeof t);var e=t%26,i=(t-e)/26,n=1<>>26,a&=67108863,this.words[o]=a}return 0!==s&&(this.words[o]=s,this.length++),this},s.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},s.prototype.cmpn=function(t){var e,i=t<0;if(0!==this.negative&&!i)return-1;if(0===this.negative&&i)return 1;if(this._strip(),this.length>1)e=1;else{i&&(t=-t),r(t<=67108863,"Number is too big");var n=0|this.words[0];e=n===t?0:nt.length)return 1;if(this.length=0;i--){var r=0|this.words[i],n=0|t.words[i];if(r!==n){rn&&(e=1);break}}return e},s.prototype.gtn=function(t){return 1===this.cmpn(t)},s.prototype.gt=function(t){return 1===this.cmp(t)},s.prototype.gten=function(t){return this.cmpn(t)>=0},s.prototype.gte=function(t){return this.cmp(t)>=0},s.prototype.ltn=function(t){return-1===this.cmpn(t)},s.prototype.lt=function(t){return-1===this.cmp(t)},s.prototype.lten=function(t){return this.cmpn(t)<=0},s.prototype.lte=function(t){return this.cmp(t)<=0},s.prototype.eqn=function(t){return 0===this.cmpn(t)},s.prototype.eq=function(t){return 0===this.cmp(t)},s.red=function(t){return new S(t)},s.prototype.toRed=function(t){return r(!this.red,"Already a number in reduction context"),r(0===this.negative,"red works only with positives"),t.convertTo(this)._forceRed(t)},s.prototype.fromRed=function(){return r(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},s.prototype._forceRed=function(t){return this.red=t,this},s.prototype.forceRed=function(t){return r(!this.red,"Already a number in reduction context"),this._forceRed(t)},s.prototype.redAdd=function(t){return r(this.red,"redAdd works only with red numbers"),this.red.add(this,t)},s.prototype.redIAdd=function(t){return r(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,t)},s.prototype.redSub=function(t){return r(this.red,"redSub works only with red numbers"),this.red.sub(this,t)},s.prototype.redISub=function(t){return r(this.red,"redISub works only with red numbers"),this.red.isub(this,t)},s.prototype.redShl=function(t){return r(this.red,"redShl works only with red numbers"),this.red.shl(this,t)},s.prototype.redMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.mul(this,t)},s.prototype.redIMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.imul(this,t)},s.prototype.redSqr=function(){return r(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},s.prototype.redISqr=function(){return r(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},s.prototype.redSqrt=function(){return r(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},s.prototype.redInvm=function(){return r(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},s.prototype.redNeg=function(){return r(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},s.prototype.redPow=function(t){return r(this.red&&!t.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,t)};var w={k256:null,p224:null,p192:null,p25519:null};function _(t,e){this.name=t,this.p=new s(e,16),this.n=this.p.bitLength(),this.k=new s(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function M(){_.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function k(){_.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function x(){_.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function E(){_.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function S(t){if("string"==typeof t){var e=s._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),"modulus must be greater than 1"),this.m=t,this.prime=null}function T(t){S.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new s(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}_.prototype._tmp=function(){var t=new s(null);return t.words=new Array(Math.ceil(this.n/13)),t},_.prototype.ireduce=function(t){var e,i=t;do{this.split(i,this.tmp),e=(i=(i=this.imulK(i)).iadd(this.tmp)).bitLength()}while(e>this.n);var r=e0?i.isub(this.p):void 0!==i.strip?i.strip():i._strip(),i},_.prototype.split=function(t,e){t.iushrn(this.n,0,e)},_.prototype.imulK=function(t){return t.imul(this.k)},n(M,_),M.prototype.split=function(t,e){for(var i=4194303,r=Math.min(t.length,9),n=0;n>>22,s=o}s>>>=22,t.words[n-10]=s,0===s&&t.length>10?t.length-=10:t.length-=9},M.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,i=0;i>>=26,t.words[i]=n,e=r}return 0!==e&&(t.words[t.length++]=e),t},s._prime=function(t){if(w[t])return w[t];var e;if("k256"===t)e=new M;else if("p224"===t)e=new k;else if("p192"===t)e=new x;else{if("p25519"!==t)throw new Error("Unknown prime "+t);e=new E}return w[t]=e,e},S.prototype._verify1=function(t){r(0===t.negative,"red works only with positives"),r(t.red,"red works only with red numbers")},S.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),"red works only with positives"),r(t.red&&t.red===e.red,"red works only with red numbers")},S.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):(l(t,t.umod(this.m)._forceRed(this)),t)},S.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},S.prototype.add=function(t,e){this._verify2(t,e);var i=t.add(e);return i.cmp(this.m)>=0&&i.isub(this.m),i._forceRed(this)},S.prototype.iadd=function(t,e){this._verify2(t,e);var i=t.iadd(e);return i.cmp(this.m)>=0&&i.isub(this.m),i},S.prototype.sub=function(t,e){this._verify2(t,e);var i=t.sub(e);return i.cmpn(0)<0&&i.iadd(this.m),i._forceRed(this)},S.prototype.isub=function(t,e){this._verify2(t,e);var i=t.isub(e);return i.cmpn(0)<0&&i.iadd(this.m),i},S.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},S.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},S.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},S.prototype.isqr=function(t){return this.imul(t,t.clone())},S.prototype.sqr=function(t){return this.mul(t,t)},S.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var i=this.m.add(new s(1)).iushrn(2);return this.pow(t,i)}for(var n=this.m.subn(1),o=0;!n.isZero()&&0===n.andln(1);)o++,n.iushrn(1);r(!n.isZero());var a=new s(1).toRed(this),h=a.redNeg(),u=this.m.subn(1).iushrn(1),l=this.m.bitLength();for(l=new s(2*l*l).toRed(this);0!==this.pow(l,u).cmp(h);)l.redIAdd(h);for(var c=this.pow(l,n),d=this.pow(t,n.addn(1).iushrn(1)),f=this.pow(t,n),p=o;0!==f.cmp(a);){for(var m=f,g=0;0!==m.cmp(a);g++)m=m.redSqr();r(g=0;r--){for(var u=e.words[r],l=h-1;l>=0;l--){var c=u>>l&1;n!==i[0]&&(n=this.sqr(n)),0!==c||0!==o?(o<<=1,o|=c,(4==++a||0===r&&0===l)&&(n=this.mul(n,i[o]),a=0,o=0)):a=0}h=26}return n},S.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},S.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},s.mont=function(t){return new T(t)},n(T,S),T.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},T.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},T.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var i=t.imul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),s=n;return n.cmp(this.m)>=0?s=n.isub(this.m):n.cmpn(0)<0&&(s=n.iadd(this.m)),s._forceRed(this)},T.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new s(0)._forceRed(this);var i=t.mul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),o=n;return n.cmp(this.m)>=0?o=n.isub(this.m):n.cmpn(0)<0&&(o=n.iadd(this.m)),o._forceRed(this)},T.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(t=i.nmd(t),this)},9931:(t,e,i)=>{var r;function n(t){this.rand=t}if(t.exports=function(t){return r||(r=new n(null)),r.generate(t)},t.exports.Rand=n,n.prototype.generate=function(t){return this._rand(t)},n.prototype._rand=function(t){if(this.rand.getBytes)return this.rand.getBytes(t);for(var e=new Uint8Array(t),i=0;i{var r=i(9509).Buffer;function n(t){r.isBuffer(t)||(t=r.from(t));for(var e=t.length/4|0,i=new Array(e),n=0;n>>24]^l[p>>>16&255]^c[m>>>8&255]^d[255&g]^e[b++],o=u[p>>>24]^l[m>>>16&255]^c[g>>>8&255]^d[255&f]^e[b++],a=u[m>>>24]^l[g>>>16&255]^c[f>>>8&255]^d[255&p]^e[b++],h=u[g>>>24]^l[f>>>16&255]^c[p>>>8&255]^d[255&m]^e[b++],f=s,p=o,m=a,g=h;return s=(r[f>>>24]<<24|r[p>>>16&255]<<16|r[m>>>8&255]<<8|r[255&g])^e[b++],o=(r[p>>>24]<<24|r[m>>>16&255]<<16|r[g>>>8&255]<<8|r[255&f])^e[b++],a=(r[m>>>24]<<24|r[g>>>16&255]<<16|r[f>>>8&255]<<8|r[255&p])^e[b++],h=(r[g>>>24]<<24|r[f>>>16&255]<<16|r[p>>>8&255]<<8|r[255&m])^e[b++],[s>>>=0,o>>>=0,a>>>=0,h>>>=0]}var a=[0,1,2,4,8,16,32,64,128,27,54],h=function(){for(var t=new Array(256),e=0;e<256;e++)t[e]=e<128?e<<1:e<<1^283;for(var i=[],r=[],n=[[],[],[],[]],s=[[],[],[],[]],o=0,a=0,h=0;h<256;++h){var u=a^a<<1^a<<2^a<<3^a<<4;u=u>>>8^255&u^99,i[o]=u,r[u]=o;var l=t[o],c=t[l],d=t[c],f=257*t[u]^16843008*u;n[0][o]=f<<24|f>>>8,n[1][o]=f<<16|f>>>16,n[2][o]=f<<8|f>>>24,n[3][o]=f,f=16843009*d^65537*c^257*l^16843008*o,s[0][u]=f<<24|f>>>8,s[1][u]=f<<16|f>>>16,s[2][u]=f<<8|f>>>24,s[3][u]=f,0===o?o=a=1:(o=l^t[t[t[d^l]]],a^=t[t[a]])}return{SBOX:i,INV_SBOX:r,SUB_MIX:n,INV_SUB_MIX:s}}();function u(t){this._key=n(t),this._reset()}u.blockSize=16,u.keySize=32,u.prototype.blockSize=u.blockSize,u.prototype.keySize=u.keySize,u.prototype._reset=function(){for(var t=this._key,e=t.length,i=e+6,r=4*(i+1),n=[],s=0;s>>24,o=h.SBOX[o>>>24]<<24|h.SBOX[o>>>16&255]<<16|h.SBOX[o>>>8&255]<<8|h.SBOX[255&o],o^=a[s/e|0]<<24):e>6&&s%e==4&&(o=h.SBOX[o>>>24]<<24|h.SBOX[o>>>16&255]<<16|h.SBOX[o>>>8&255]<<8|h.SBOX[255&o]),n[s]=n[s-e]^o}for(var u=[],l=0;l>>24]]^h.INV_SUB_MIX[1][h.SBOX[d>>>16&255]]^h.INV_SUB_MIX[2][h.SBOX[d>>>8&255]]^h.INV_SUB_MIX[3][h.SBOX[255&d]]}this._nRounds=i,this._keySchedule=n,this._invKeySchedule=u},u.prototype.encryptBlockRaw=function(t){return o(t=n(t),this._keySchedule,h.SUB_MIX,h.SBOX,this._nRounds)},u.prototype.encryptBlock=function(t){var e=this.encryptBlockRaw(t),i=r.allocUnsafe(16);return i.writeUInt32BE(e[0],0),i.writeUInt32BE(e[1],4),i.writeUInt32BE(e[2],8),i.writeUInt32BE(e[3],12),i},u.prototype.decryptBlock=function(t){var e=(t=n(t))[1];t[1]=t[3],t[3]=e;var i=o(t,this._invKeySchedule,h.INV_SUB_MIX,h.INV_SBOX,this._nRounds),s=r.allocUnsafe(16);return s.writeUInt32BE(i[0],0),s.writeUInt32BE(i[3],4),s.writeUInt32BE(i[2],8),s.writeUInt32BE(i[1],12),s},u.prototype.scrub=function(){s(this._keySchedule),s(this._invKeySchedule),s(this._key)},t.exports.AES=u},2422:(t,e,i)=>{var r=i(4497),n=i(9509).Buffer,s=i(1027),o=i(5717),a=i(3288),h=i(7295),u=i(685);function l(t,e,i,o){s.call(this);var h=n.alloc(4,0);this._cipher=new r.AES(e);var l=this._cipher.encryptBlock(h);this._ghash=new a(l),i=function(t,e,i){if(12===e.length)return t._finID=n.concat([e,n.from([0,0,0,1])]),n.concat([e,n.from([0,0,0,2])]);var r=new a(i),s=e.length,o=s%16;r.update(e),o&&(o=16-o,r.update(n.alloc(o,0))),r.update(n.alloc(8,0));var h=8*s,l=n.alloc(8);l.writeUIntBE(h,0,8),r.update(l),t._finID=r.state;var c=n.from(t._finID);return u(c),c}(this,i,l),this._prev=n.from(i),this._cache=n.allocUnsafe(0),this._secCache=n.allocUnsafe(0),this._decrypt=o,this._alen=0,this._len=0,this._mode=t,this._authTag=null,this._called=!1}o(l,s),l.prototype._update=function(t){if(!this._called&&this._alen){var e=16-this._alen%16;e<16&&(e=n.alloc(e,0),this._ghash.update(e))}this._called=!0;var i=this._mode.encrypt(this,t);return this._decrypt?this._ghash.update(t):this._ghash.update(i),this._len+=t.length,i},l.prototype._final=function(){if(this._decrypt&&!this._authTag)throw new Error("Unsupported state or unable to authenticate data");var t=h(this._ghash.final(8*this._alen,8*this._len),this._cipher.encryptBlock(this._finID));if(this._decrypt&&function(t,e){var i=0;t.length!==e.length&&i++;for(var r=Math.min(t.length,e.length),n=0;n{var r=i(1494),n=i(6193),s=i(4946);e.createCipher=e.Cipher=r.createCipher,e.createCipheriv=e.Cipheriv=r.createCipheriv,e.createDecipher=e.Decipher=n.createDecipher,e.createDecipheriv=e.Decipheriv=n.createDecipheriv,e.listCiphers=e.getCiphers=function(){return Object.keys(s)}},6193:(t,e,i)=>{var r=i(2422),n=i(9509).Buffer,s=i(45),o=i(5969),a=i(1027),h=i(4497),u=i(3048);function l(t,e,i){a.call(this),this._cache=new c,this._last=void 0,this._cipher=new h.AES(e),this._prev=n.from(i),this._mode=t,this._autopadding=!0}function c(){this.cache=n.allocUnsafe(0)}function d(t,e,i){var a=s[t.toLowerCase()];if(!a)throw new TypeError("invalid suite type");if("string"==typeof i&&(i=n.from(i)),"GCM"!==a.mode&&i.length!==a.iv)throw new TypeError("invalid iv length "+i.length);if("string"==typeof e&&(e=n.from(e)),e.length!==a.key/8)throw new TypeError("invalid key length "+e.length);return"stream"===a.type?new o(a.module,e,i,!0):"auth"===a.type?new r(a.module,e,i,!0):new l(a.module,e,i)}i(5717)(l,a),l.prototype._update=function(t){var e,i;this._cache.add(t);for(var r=[];e=this._cache.get(this._autopadding);)i=this._mode.decrypt(this,e),r.push(i);return n.concat(r)},l.prototype._final=function(){var t=this._cache.flush();if(this._autopadding)return function(t){var e=t[15];if(e<1||e>16)throw new Error("unable to decrypt data");for(var i=-1;++i16)return e=this.cache.slice(0,16),this.cache=this.cache.slice(16),e}else if(this.cache.length>=16)return e=this.cache.slice(0,16),this.cache=this.cache.slice(16),e;return null},c.prototype.flush=function(){if(this.cache.length)return this.cache},e.createDecipher=function(t,e){var i=s[t.toLowerCase()];if(!i)throw new TypeError("invalid suite type");var r=u(e,!1,i.key,i.iv);return d(t,r.key,r.iv)},e.createDecipheriv=d},1494:(t,e,i)=>{var r=i(45),n=i(2422),s=i(9509).Buffer,o=i(5969),a=i(1027),h=i(4497),u=i(3048);function l(t,e,i){a.call(this),this._cache=new d,this._cipher=new h.AES(e),this._prev=s.from(i),this._mode=t,this._autopadding=!0}i(5717)(l,a),l.prototype._update=function(t){var e,i;this._cache.add(t);for(var r=[];e=this._cache.get();)i=this._mode.encrypt(this,e),r.push(i);return s.concat(r)};var c=s.alloc(16,16);function d(){this.cache=s.allocUnsafe(0)}function f(t,e,i){var a=r[t.toLowerCase()];if(!a)throw new TypeError("invalid suite type");if("string"==typeof e&&(e=s.from(e)),e.length!==a.key/8)throw new TypeError("invalid key length "+e.length);if("string"==typeof i&&(i=s.from(i)),"GCM"!==a.mode&&i.length!==a.iv)throw new TypeError("invalid iv length "+i.length);return"stream"===a.type?new o(a.module,e,i):"auth"===a.type?new n(a.module,e,i):new l(a.module,e,i)}l.prototype._final=function(){var t=this._cache.flush();if(this._autopadding)return t=this._mode.encrypt(this,t),this._cipher.scrub(),t;if(!t.equals(c))throw this._cipher.scrub(),new Error("data not multiple of block length")},l.prototype.setAutoPadding=function(t){return this._autopadding=!!t,this},d.prototype.add=function(t){this.cache=s.concat([this.cache,t])},d.prototype.get=function(){if(this.cache.length>15){var t=this.cache.slice(0,16);return this.cache=this.cache.slice(16),t}return null},d.prototype.flush=function(){for(var t=16-this.cache.length,e=s.allocUnsafe(t),i=-1;++i{var r=i(9509).Buffer,n=r.alloc(16,0);function s(t){var e=r.allocUnsafe(16);return e.writeUInt32BE(t[0]>>>0,0),e.writeUInt32BE(t[1]>>>0,4),e.writeUInt32BE(t[2]>>>0,8),e.writeUInt32BE(t[3]>>>0,12),e}function o(t){this.h=t,this.state=r.alloc(16,0),this.cache=r.allocUnsafe(0)}o.prototype.ghash=function(t){for(var e=-1;++e0;e--)r[e]=r[e]>>>1|(1&r[e-1])<<31;r[0]=r[0]>>>1,i&&(r[0]=r[0]^225<<24)}this.state=s(n)},o.prototype.update=function(t){var e;for(this.cache=r.concat([this.cache,t]);this.cache.length>=16;)e=this.cache.slice(0,16),this.cache=this.cache.slice(16),this.ghash(e)},o.prototype.final=function(t,e){return this.cache.length&&this.ghash(r.concat([this.cache,n],16)),this.ghash(s([0,t,0,e])),this.state},t.exports=o},685:t=>{t.exports=function(t){for(var e,i=t.length;i--;){if(255!==(e=t.readUInt8(i))){e++,t.writeUInt8(e,i);break}t.writeUInt8(0,i)}}},5292:(t,e,i)=>{var r=i(7295);e.encrypt=function(t,e){var i=r(e,t._prev);return t._prev=t._cipher.encryptBlock(i),t._prev},e.decrypt=function(t,e){var i=t._prev;t._prev=e;var n=t._cipher.decryptBlock(e);return r(n,i)}},6311:(t,e,i)=>{var r=i(9509).Buffer,n=i(7295);function s(t,e,i){var s=e.length,o=n(e,t._cache);return t._cache=t._cache.slice(s),t._prev=r.concat([t._prev,i?e:o]),o}e.encrypt=function(t,e,i){for(var n,o=r.allocUnsafe(0);e.length;){if(0===t._cache.length&&(t._cache=t._cipher.encryptBlock(t._prev),t._prev=r.allocUnsafe(0)),!(t._cache.length<=e.length)){o=r.concat([o,s(t,e,i)]);break}n=t._cache.length,o=r.concat([o,s(t,e.slice(0,n),i)]),e=e.slice(n)}return o}},1510:(t,e,i)=>{var r=i(9509).Buffer;function n(t,e,i){for(var r,n,o=-1,a=0;++o<8;)r=e&1<<7-o?128:0,a+=(128&(n=t._cipher.encryptBlock(t._prev)[0]^r))>>o%8,t._prev=s(t._prev,i?r:n);return a}function s(t,e){var i=t.length,n=-1,s=r.allocUnsafe(t.length);for(t=r.concat([t,r.from([e])]);++n>7;return s}e.encrypt=function(t,e,i){for(var s=e.length,o=r.allocUnsafe(s),a=-1;++a{var r=i(9509).Buffer;function n(t,e,i){var n=t._cipher.encryptBlock(t._prev)[0]^e;return t._prev=r.concat([t._prev.slice(1),r.from([i?e:n])]),n}e.encrypt=function(t,e,i){for(var s=e.length,o=r.allocUnsafe(s),a=-1;++a{var r=i(7295),n=i(9509).Buffer,s=i(685);function o(t){var e=t._cipher.encryptBlockRaw(t._prev);return s(t._prev),e}e.encrypt=function(t,e){var i=Math.ceil(e.length/16),s=t._cache.length;t._cache=n.concat([t._cache,n.allocUnsafe(16*i)]);for(var a=0;a{e.encrypt=function(t,e){return t._cipher.encryptBlock(e)},e.decrypt=function(t,e){return t._cipher.decryptBlock(e)}},45:(t,e,i)=>{var r={ECB:i(1084),CBC:i(5292),CFB:i(6311),CFB8:i(1964),CFB1:i(1510),OFB:i(8861),CTR:i(6009),GCM:i(6009)},n=i(4946);for(var s in n)n[s].module=r[n[s].mode];t.exports=n},8861:(t,e,i)=>{var r=i(8764).Buffer,n=i(7295);function s(t){return t._prev=t._cipher.encryptBlock(t._prev),t._prev}e.encrypt=function(t,e){for(;t._cache.length{var r=i(4497),n=i(9509).Buffer,s=i(1027);function o(t,e,i,o){s.call(this),this._cipher=new r.AES(e),this._prev=n.from(i),this._cache=n.allocUnsafe(0),this._secCache=n.allocUnsafe(0),this._decrypt=o,this._mode=t}i(5717)(o,s),o.prototype._update=function(t){return this._mode.encrypt(this,t,this._decrypt)},o.prototype._final=function(){this._cipher.scrub()},t.exports=o},3614:(t,e,i)=>{var r=i(7667),n=i(4696),s=i(45),o=i(9715),a=i(3048);function h(t,e,i){if(t=t.toLowerCase(),s[t])return n.createCipheriv(t,e,i);if(o[t])return new r({key:e,iv:i,mode:t});throw new TypeError("invalid suite type")}function u(t,e,i){if(t=t.toLowerCase(),s[t])return n.createDecipheriv(t,e,i);if(o[t])return new r({key:e,iv:i,mode:t,decrypt:!0});throw new TypeError("invalid suite type")}e.createCipher=e.Cipher=function(t,e){var i,r;if(t=t.toLowerCase(),s[t])i=s[t].key,r=s[t].iv;else{if(!o[t])throw new TypeError("invalid suite type");i=8*o[t].key,r=o[t].iv}var n=a(e,!1,i,r);return h(t,n.key,n.iv)},e.createCipheriv=e.Cipheriv=h,e.createDecipher=e.Decipher=function(t,e){var i,r;if(t=t.toLowerCase(),s[t])i=s[t].key,r=s[t].iv;else{if(!o[t])throw new TypeError("invalid suite type");i=8*o[t].key,r=o[t].iv}var n=a(e,!1,i,r);return u(t,n.key,n.iv)},e.createDecipheriv=e.Decipheriv=u,e.listCiphers=e.getCiphers=function(){return Object.keys(o).concat(n.getCiphers())}},7667:(t,e,i)=>{var r=i(1027),n=i(5251),s=i(5717),o=i(9509).Buffer,a={"des-ede3-cbc":n.CBC.instantiate(n.EDE),"des-ede3":n.EDE,"des-ede-cbc":n.CBC.instantiate(n.EDE),"des-ede":n.EDE,"des-cbc":n.CBC.instantiate(n.DES),"des-ecb":n.DES};function h(t){r.call(this);var e,i=t.mode.toLowerCase(),n=a[i];e=t.decrypt?"decrypt":"encrypt";var s=t.key;o.isBuffer(s)||(s=o.from(s)),"des-ede"!==i&&"des-ede-cbc"!==i||(s=o.concat([s,s.slice(0,8)]));var h=t.iv;o.isBuffer(h)||(h=o.from(h)),this._des=n.create({key:s,iv:h,type:e})}a.des=a["des-cbc"],a.des3=a["des-ede3-cbc"],t.exports=h,s(h,r),h.prototype._update=function(t){return o.from(this._des.update(t))},h.prototype._final=function(){return o.from(this._des.final())}},9715:(t,e)=>{e["des-ecb"]={key:8,iv:0},e["des-cbc"]=e.des={key:8,iv:8},e["des-ede3-cbc"]=e.des3={key:24,iv:8},e["des-ede3"]={key:24,iv:0},e["des-ede-cbc"]={key:16,iv:8},e["des-ede"]={key:16,iv:0}},3663:(t,e,i)=>{var r=i(8764).Buffer,n=i(3550),s=i(1798);function o(t){var e,i=t.modulus.byteLength();do{e=new n(s(i))}while(e.cmp(t.modulus)>=0||!e.umod(t.prime1)||!e.umod(t.prime2));return e}function a(t,e){var i=function(t){var e=o(t);return{blinder:e.toRed(n.mont(t.modulus)).redPow(new n(t.publicExponent)).fromRed(),unblinder:e.invm(t.modulus)}}(e),s=e.modulus.byteLength(),a=new n(t).mul(i.blinder).umod(e.modulus),h=a.toRed(n.mont(e.prime1)),u=a.toRed(n.mont(e.prime2)),l=e.coefficient,c=e.prime1,d=e.prime2,f=h.redPow(e.exponent1).fromRed(),p=u.redPow(e.exponent2).fromRed(),m=f.isub(p).imul(l).umod(c).imul(d);return p.iadd(m).imul(i.unblinder).umod(e.modulus).toArrayLike(r,"be",s)}a.getr=o,t.exports=a},6042:(t,e,i)=>{t.exports=i(5207)},4743:(t,e,i)=>{var r=i(9509).Buffer,n=i(3482),s=i(8473),o=i(5717),a=i(2957),h=i(7753),u=i(5207);function l(t){s.Writable.call(this);var e=u[t];if(!e)throw new Error("Unknown message digest");this._hashType=e.hash,this._hash=n(e.hash),this._tag=e.id,this._signType=e.sign}function c(t){s.Writable.call(this);var e=u[t];if(!e)throw new Error("Unknown message digest");this._hash=n(e.hash),this._tag=e.id,this._signType=e.sign}function d(t){return new l(t)}function f(t){return new c(t)}Object.keys(u).forEach((function(t){u[t].id=r.from(u[t].id,"hex"),u[t.toLowerCase()]=u[t]})),o(l,s.Writable),l.prototype._write=function(t,e,i){this._hash.update(t),i()},l.prototype.update=function(t,e){return"string"==typeof t&&(t=r.from(t,e)),this._hash.update(t),this},l.prototype.sign=function(t,e){this.end();var i=this._hash.digest(),r=a(i,t,this._hashType,this._signType,this._tag);return e?r.toString(e):r},o(c,s.Writable),c.prototype._write=function(t,e,i){this._hash.update(t),i()},c.prototype.update=function(t,e){return"string"==typeof t&&(t=r.from(t,e)),this._hash.update(t),this},c.prototype.verify=function(t,e,i){"string"==typeof e&&(e=r.from(e,i)),this.end();var n=this._hash.digest();return h(e,n,t,this._signType,this._tag)},t.exports={Sign:d,Verify:f,createSign:d,createVerify:f}},2957:(t,e,i)=>{var r=i(9509).Buffer,n=i(8355),s=i(3663),o=i(6266).ec,a=i(3550),h=i(980),u=i(1308);function l(t,e,i,s){if((t=r.from(t.toArray())).length0&&i.ishrn(r),i}function d(t,e,i){var s,o;do{for(s=r.alloc(0);8*s.length{var r=i(9509).Buffer,n=i(3550),s=i(6266).ec,o=i(980),a=i(1308);function h(t,e){if(t.cmpn(0)<=0)throw new Error("invalid sig");if(t.cmp(e)>=e)throw new Error("invalid sig")}t.exports=function(t,e,i,u,l){var c=o(i);if("ec"===c.type){if("ecdsa"!==u&&"ecdsa/rsa"!==u)throw new Error("wrong public key type");return function(t,e,i){var r=a[i.data.algorithm.curve.join(".")];if(!r)throw new Error("unknown curve "+i.data.algorithm.curve.join("."));var n=new s(r),o=i.data.subjectPrivateKey.data;return n.verify(e,t,o)}(t,e,c)}if("dsa"===c.type){if("dsa"!==u)throw new Error("wrong public key type");return function(t,e,i){var r=i.data.p,s=i.data.q,a=i.data.g,u=i.data.pub_key,l=o.signature.decode(t,"der"),c=l.s,d=l.r;h(c,s),h(d,s);var f=n.mont(r),p=c.invm(s);return 0===a.toRed(f).redPow(new n(e).mul(p).mod(s)).fromRed().mul(u.toRed(f).redPow(d.mul(p).mod(s)).fromRed()).mod(r).mod(s).cmp(d)}(t,e,c)}if("rsa"!==u&&"ecdsa/rsa"!==u)throw new Error("wrong public key type");e=r.concat([l,e]);for(var d=c.modulus.byteLength(),f=[1],p=0;e.length+f.length+2{"use strict";var r=i(8764).Buffer,n=i(9590),s=i(9282),o=i(2292),a=i(405),h=i(7948),u=i(1619);for(var l in u)e[l]=u[l];function c(t){if("number"!=typeof t||te.UNZIP)throw new TypeError("Bad argument");this.dictionary=null,this.err=0,this.flush=0,this.init_done=!1,this.level=0,this.memLevel=0,this.mode=t,this.strategy=0,this.windowBits=0,this.write_in_progress=!1,this.pending_close=!1,this.gzip_id_bytes_read=0}e.NONE=0,e.DEFLATE=1,e.INFLATE=2,e.GZIP=3,e.GUNZIP=4,e.DEFLATERAW=5,e.INFLATERAW=6,e.UNZIP=7,c.prototype.close=function(){this.write_in_progress?this.pending_close=!0:(this.pending_close=!1,s(this.init_done,"close before init"),s(this.mode<=e.UNZIP),this.mode===e.DEFLATE||this.mode===e.GZIP||this.mode===e.DEFLATERAW?a.deflateEnd(this.strm):this.mode!==e.INFLATE&&this.mode!==e.GUNZIP&&this.mode!==e.INFLATERAW&&this.mode!==e.UNZIP||h.inflateEnd(this.strm),this.mode=e.NONE,this.dictionary=null)},c.prototype.write=function(t,e,i,r,n,s,o){return this._write(!0,t,e,i,r,n,s,o)},c.prototype.writeSync=function(t,e,i,r,n,s,o){return this._write(!1,t,e,i,r,n,s,o)},c.prototype._write=function(t,i,o,a,h,u,l,c){if(s.equal(arguments.length,8),s(this.init_done,"write before init"),s(this.mode!==e.NONE,"already finalized"),s.equal(!1,this.write_in_progress,"write already in progress"),s.equal(!1,this.pending_close,"close is pending"),this.write_in_progress=!0,s.equal(!1,void 0===i,"must provide flush value"),this.write_in_progress=!0,i!==e.Z_NO_FLUSH&&i!==e.Z_PARTIAL_FLUSH&&i!==e.Z_SYNC_FLUSH&&i!==e.Z_FULL_FLUSH&&i!==e.Z_FINISH&&i!==e.Z_BLOCK)throw new Error("Invalid flush value");if(null==o&&(o=r.alloc(0),h=0,a=0),this.strm.avail_in=h,this.strm.input=o,this.strm.next_in=a,this.strm.avail_out=c,this.strm.output=u,this.strm.next_out=l,this.flush=i,!t)return this._process(),this._checkError()?this._afterSync():void 0;var d=this;return n.nextTick((function(){d._process(),d._after()})),this},c.prototype._afterSync=function(){var t=this.strm.avail_out,e=this.strm.avail_in;return this.write_in_progress=!1,[e,t]},c.prototype._process=function(){var t=null;switch(this.mode){case e.DEFLATE:case e.GZIP:case e.DEFLATERAW:this.err=a.deflate(this.strm,this.flush);break;case e.UNZIP:switch(this.strm.avail_in>0&&(t=this.strm.next_in),this.gzip_id_bytes_read){case 0:if(null===t)break;if(31!==this.strm.input[t]){this.mode=e.INFLATE;break}if(this.gzip_id_bytes_read=1,t++,1===this.strm.avail_in)break;case 1:if(null===t)break;139===this.strm.input[t]?(this.gzip_id_bytes_read=2,this.mode=e.GUNZIP):this.mode=e.INFLATE;break;default:throw new Error("invalid number of gzip magic number bytes read")}case e.INFLATE:case e.GUNZIP:case e.INFLATERAW:for(this.err=h.inflate(this.strm,this.flush),this.err===e.Z_NEED_DICT&&this.dictionary&&(this.err=h.inflateSetDictionary(this.strm,this.dictionary),this.err===e.Z_OK?this.err=h.inflate(this.strm,this.flush):this.err===e.Z_DATA_ERROR&&(this.err=e.Z_NEED_DICT));this.strm.avail_in>0&&this.mode===e.GUNZIP&&this.err===e.Z_STREAM_END&&0!==this.strm.next_in[0];)this.reset(),this.err=h.inflate(this.strm,this.flush);break;default:throw new Error("Unknown mode "+this.mode)}},c.prototype._checkError=function(){switch(this.err){case e.Z_OK:case e.Z_BUF_ERROR:if(0!==this.strm.avail_out&&this.flush===e.Z_FINISH)return this._error("unexpected end of file"),!1;break;case e.Z_STREAM_END:break;case e.Z_NEED_DICT:return null==this.dictionary?this._error("Missing dictionary"):this._error("Bad dictionary"),!1;default:return this._error("Zlib error"),!1}return!0},c.prototype._after=function(){if(this._checkError()){var t=this.strm.avail_out,e=this.strm.avail_in;this.write_in_progress=!1,this.callback(e,t),this.pending_close&&this.close()}},c.prototype._error=function(t){this.strm.msg&&(t=this.strm.msg),this.onerror(t,this.err),this.write_in_progress=!1,this.pending_close&&this.close()},c.prototype.init=function(t,i,r,n,o){s(4===arguments.length||5===arguments.length,"init(windowBits, level, memLevel, strategy, [dictionary])"),s(t>=8&&t<=15,"invalid windowBits"),s(i>=-1&&i<=9,"invalid compression level"),s(r>=1&&r<=9,"invalid memlevel"),s(n===e.Z_FILTERED||n===e.Z_HUFFMAN_ONLY||n===e.Z_RLE||n===e.Z_FIXED||n===e.Z_DEFAULT_STRATEGY,"invalid strategy"),this._init(i,t,r,n,o),this._setDictionary()},c.prototype.params=function(){throw new Error("deflateParams Not supported")},c.prototype.reset=function(){this._reset(),this._setDictionary()},c.prototype._init=function(t,i,r,n,s){switch(this.level=t,this.windowBits=i,this.memLevel=r,this.strategy=n,this.flush=e.Z_NO_FLUSH,this.err=e.Z_OK,this.mode!==e.GZIP&&this.mode!==e.GUNZIP||(this.windowBits+=16),this.mode===e.UNZIP&&(this.windowBits+=32),this.mode!==e.DEFLATERAW&&this.mode!==e.INFLATERAW||(this.windowBits=-1*this.windowBits),this.strm=new o,this.mode){case e.DEFLATE:case e.GZIP:case e.DEFLATERAW:this.err=a.deflateInit2(this.strm,this.level,e.Z_DEFLATED,this.windowBits,this.memLevel,this.strategy);break;case e.INFLATE:case e.GUNZIP:case e.INFLATERAW:case e.UNZIP:this.err=h.inflateInit2(this.strm,this.windowBits);break;default:throw new Error("Unknown mode "+this.mode)}this.err!==e.Z_OK&&this._error("Init error"),this.dictionary=s,this.write_in_progress=!1,this.init_done=!0},c.prototype._setDictionary=function(){if(null!=this.dictionary){switch(this.err=e.Z_OK,this.mode){case e.DEFLATE:case e.DEFLATERAW:this.err=a.deflateSetDictionary(this.strm,this.dictionary)}this.err!==e.Z_OK&&this._error("Failed to set dictionary")}},c.prototype._reset=function(){switch(this.err=e.Z_OK,this.mode){case e.DEFLATE:case e.DEFLATERAW:case e.GZIP:this.err=a.deflateReset(this.strm);break;case e.INFLATE:case e.INFLATERAW:case e.GUNZIP:this.err=h.inflateReset(this.strm)}this.err!==e.Z_OK&&this._error("Failed to reset stream")},e.Zlib=c},2635:(t,e,i)=>{"use strict";var r=i(9590),n=i(8764).Buffer,s=i(2830).Transform,o=i(4505),a=i(9539),h=i(9282).ok,u=i(8764).kMaxLength,l="Cannot create final Buffer. It would be larger than 0x"+u.toString(16)+" bytes";o.Z_MIN_WINDOWBITS=8,o.Z_MAX_WINDOWBITS=15,o.Z_DEFAULT_WINDOWBITS=15,o.Z_MIN_CHUNK=64,o.Z_MAX_CHUNK=1/0,o.Z_DEFAULT_CHUNK=16384,o.Z_MIN_MEMLEVEL=1,o.Z_MAX_MEMLEVEL=9,o.Z_DEFAULT_MEMLEVEL=8,o.Z_MIN_LEVEL=-1,o.Z_MAX_LEVEL=9,o.Z_DEFAULT_LEVEL=o.Z_DEFAULT_COMPRESSION;for(var c=Object.keys(o),d=0;d=u?o=new RangeError(l):e=n.concat(r,s),r=[],t.close(),i(o,e)}t.on("error",(function(e){t.removeListener("end",a),t.removeListener("readable",o),i(e)})),t.on("end",a),t.end(e),o()}function y(t,e){if("string"==typeof e&&(e=n.from(e)),!n.isBuffer(e))throw new TypeError("Not a string or buffer");var i=t._finishFlushFlag;return t._processChunk(e,i)}function w(t){if(!(this instanceof w))return new w(t);A.call(this,t,o.DEFLATE)}function _(t){if(!(this instanceof _))return new _(t);A.call(this,t,o.INFLATE)}function M(t){if(!(this instanceof M))return new M(t);A.call(this,t,o.GZIP)}function k(t){if(!(this instanceof k))return new k(t);A.call(this,t,o.GUNZIP)}function x(t){if(!(this instanceof x))return new x(t);A.call(this,t,o.DEFLATERAW)}function E(t){if(!(this instanceof E))return new E(t);A.call(this,t,o.INFLATERAW)}function S(t){if(!(this instanceof S))return new S(t);A.call(this,t,o.UNZIP)}function T(t){return t===o.Z_NO_FLUSH||t===o.Z_PARTIAL_FLUSH||t===o.Z_SYNC_FLUSH||t===o.Z_FULL_FLUSH||t===o.Z_FINISH||t===o.Z_BLOCK}function A(t,i){var r=this;if(this._opts=t=t||{},this._chunkSize=t.chunkSize||e.Z_DEFAULT_CHUNK,s.call(this,t),t.flush&&!T(t.flush))throw new Error("Invalid flush flag: "+t.flush);if(t.finishFlush&&!T(t.finishFlush))throw new Error("Invalid flush flag: "+t.finishFlush);if(this._flushFlag=t.flush||o.Z_NO_FLUSH,this._finishFlushFlag=void 0!==t.finishFlush?t.finishFlush:o.Z_FINISH,t.chunkSize&&(t.chunkSizee.Z_MAX_CHUNK))throw new Error("Invalid chunk size: "+t.chunkSize);if(t.windowBits&&(t.windowBitse.Z_MAX_WINDOWBITS))throw new Error("Invalid windowBits: "+t.windowBits);if(t.level&&(t.levele.Z_MAX_LEVEL))throw new Error("Invalid compression level: "+t.level);if(t.memLevel&&(t.memLevele.Z_MAX_MEMLEVEL))throw new Error("Invalid memLevel: "+t.memLevel);if(t.strategy&&t.strategy!=e.Z_FILTERED&&t.strategy!=e.Z_HUFFMAN_ONLY&&t.strategy!=e.Z_RLE&&t.strategy!=e.Z_FIXED&&t.strategy!=e.Z_DEFAULT_STRATEGY)throw new Error("Invalid strategy: "+t.strategy);if(t.dictionary&&!n.isBuffer(t.dictionary))throw new Error("Invalid dictionary: it should be a Buffer instance");this._handle=new o.Zlib(i);var a=this;this._hadError=!1,this._handle.onerror=function(t,i){I(a),a._hadError=!0;var r=new Error(t);r.errno=i,r.code=e.codes[i],a.emit("error",r)};var h=e.Z_DEFAULT_COMPRESSION;"number"==typeof t.level&&(h=t.level);var u=e.Z_DEFAULT_STRATEGY;"number"==typeof t.strategy&&(u=t.strategy),this._handle.init(t.windowBits||e.Z_DEFAULT_WINDOWBITS,h,t.memLevel||e.Z_DEFAULT_MEMLEVEL,u,t.dictionary),this._buffer=n.allocUnsafe(this._chunkSize),this._offset=0,this._level=h,this._strategy=u,this.once("end",this.close),Object.defineProperty(this,"_closed",{get:function(){return!r._handle},configurable:!0,enumerable:!0})}function I(t,e){e&&r.nextTick(e),t._handle&&(t._handle.close(),t._handle=null)}function C(t){t.emit("close")}Object.defineProperty(e,"codes",{enumerable:!0,value:Object.freeze(p),writable:!1}),e.Deflate=w,e.Inflate=_,e.Gzip=M,e.Gunzip=k,e.DeflateRaw=x,e.InflateRaw=E,e.Unzip=S,e.createDeflate=function(t){return new w(t)},e.createInflate=function(t){return new _(t)},e.createDeflateRaw=function(t){return new x(t)},e.createInflateRaw=function(t){return new E(t)},e.createGzip=function(t){return new M(t)},e.createGunzip=function(t){return new k(t)},e.createUnzip=function(t){return new S(t)},e.deflate=function(t,e,i){return"function"==typeof e&&(i=e,e={}),v(new w(e),t,i)},e.deflateSync=function(t,e){return y(new w(e),t)},e.gzip=function(t,e,i){return"function"==typeof e&&(i=e,e={}),v(new M(e),t,i)},e.gzipSync=function(t,e){return y(new M(e),t)},e.deflateRaw=function(t,e,i){return"function"==typeof e&&(i=e,e={}),v(new x(e),t,i)},e.deflateRawSync=function(t,e){return y(new x(e),t)},e.unzip=function(t,e,i){return"function"==typeof e&&(i=e,e={}),v(new S(e),t,i)},e.unzipSync=function(t,e){return y(new S(e),t)},e.inflate=function(t,e,i){return"function"==typeof e&&(i=e,e={}),v(new _(e),t,i)},e.inflateSync=function(t,e){return y(new _(e),t)},e.gunzip=function(t,e,i){return"function"==typeof e&&(i=e,e={}),v(new k(e),t,i)},e.gunzipSync=function(t,e){return y(new k(e),t)},e.inflateRaw=function(t,e,i){return"function"==typeof e&&(i=e,e={}),v(new E(e),t,i)},e.inflateRawSync=function(t,e){return y(new E(e),t)},a.inherits(A,s),A.prototype.params=function(t,i,n){if(te.Z_MAX_LEVEL)throw new RangeError("Invalid compression level: "+t);if(i!=e.Z_FILTERED&&i!=e.Z_HUFFMAN_ONLY&&i!=e.Z_RLE&&i!=e.Z_FIXED&&i!=e.Z_DEFAULT_STRATEGY)throw new TypeError("Invalid strategy: "+i);if(this._level!==t||this._strategy!==i){var s=this;this.flush(o.Z_SYNC_FLUSH,(function(){h(s._handle,"zlib binding closed"),s._handle.params(t,i),s._hadError||(s._level=t,s._strategy=i,n&&n())}))}else r.nextTick(n)},A.prototype.reset=function(){return h(this._handle,"zlib binding closed"),this._handle.reset()},A.prototype._flush=function(t){this._transform(n.alloc(0),"",t)},A.prototype.flush=function(t,e){var i=this,s=this._writableState;("function"==typeof t||void 0===t&&!e)&&(e=t,t=o.Z_FULL_FLUSH),s.ended?e&&r.nextTick(e):s.ending?e&&this.once("end",e):s.needDrain?e&&this.once("drain",(function(){return i.flush(t,e)})):(this._flushFlag=t,this.write(n.alloc(0),"",e))},A.prototype.close=function(t){I(this,t),r.nextTick(C,this)},A.prototype._transform=function(t,e,i){var r,s=this._writableState,a=(s.ending||s.ended)&&(!t||s.length===t.length);return null===t||n.isBuffer(t)?this._handle?(a?r=this._finishFlushFlag:(r=this._flushFlag,t.length>=s.length&&(this._flushFlag=this._opts.flush||o.Z_NO_FLUSH)),void this._processChunk(t,r,i)):i(new Error("zlib binding closed")):i(new Error("invalid input"))},A.prototype._processChunk=function(t,e,i){var r=t&&t.length,s=this._chunkSize-this._offset,o=0,a=this,c="function"==typeof i;if(!c){var d,f=[],p=0;this.on("error",(function(t){d=t})),h(this._handle,"zlib binding closed");do{var m=this._handle.writeSync(e,t,o,r,this._buffer,this._offset,s)}while(!this._hadError&&v(m[0],m[1]));if(this._hadError)throw d;if(p>=u)throw I(this),new RangeError(l);var g=n.concat(f,p);return I(this),g}h(this._handle,"zlib binding closed");var b=this._handle.write(e,t,o,r,this._buffer,this._offset,s);function v(u,l){if(this&&(this.buffer=null,this.callback=null),!a._hadError){var d=s-l;if(h(d>=0,"have should not go down"),d>0){var m=a._buffer.slice(a._offset,a._offset+d);a._offset+=d,c?a.push(m):(f.push(m),p+=m.length)}if((0===l||a._offset>=a._chunkSize)&&(s=a._chunkSize,a._offset=0,a._buffer=n.allocUnsafe(a._chunkSize)),0===l){if(o+=r-u,r=u,!c)return!0;var g=a._handle.write(e,t,o,r,a._buffer,a._offset,a._chunkSize);return g.callback=v,void(g.buffer=t)}if(!c)return!1;i()}}b.buffer=t,b.callback=v},a.inherits(w,A),a.inherits(_,A),a.inherits(M,A),a.inherits(k,A),a.inherits(x,A),a.inherits(E,A),a.inherits(S,A)},1909:(t,e,i)=>{var r=i(8764).Buffer;t.exports=function(t){if("number"!=typeof t)throw new TypeError('"size" argument must be a number');if(t<0)throw new RangeError('"size" argument must not be negative');return r.allocUnsafe?r.allocUnsafe(t):new r(t)}},2822:(t,e,i)=>{var r=i(8764).Buffer,n=i(7676),s=i(1909);t.exports=function(t,e,i){if("number"!=typeof t)throw new TypeError('"size" argument must be a number');if(t<0)throw new RangeError('"size" argument must not be negative');if(r.alloc)return r.alloc(t,e,i);var o=s(t);return 0===t?o:void 0===e?n(o,0):("string"!=typeof i&&(i=void 0),n(o,e,i))}},7676:(t,e,i)=>{var r=i(8764).Buffer,n=function(){try{if(!r.isEncoding("latin1"))return!1;var t=r.alloc?r.alloc(4):new r(4);return t.fill("ab","ucs2"),"61006200"===t.toString("hex")}catch(t){return!1}}();function s(t,e,i,r){if(i<0||r>t.length)throw new RangeError("Out of range index");return i>>>=0,(r=void 0===r?t.length:r>>>0)>i&&t.fill(e,i,r),t}t.exports=function(t,e,i,o,a){if(n)return t.fill(e,i,o,a);if("number"==typeof e)return s(t,e,i,o);if("string"==typeof e){if("string"==typeof i?(a=i,i=0,o=t.length):"string"==typeof o&&(a=o,o=t.length),void 0!==a&&"string"!=typeof a)throw new TypeError("encoding must be a string");if("latin1"===a&&(a="binary"),"string"==typeof a&&!r.isEncoding(a))throw new TypeError("Unknown encoding: "+a);if(""===e)return s(t,0,i,o);if(function(t){return 1===t.length&&t.charCodeAt(0)<256}(e))return s(t,e.charCodeAt(0),i,o);e=new r(e,a)}return r.isBuffer(e)?function(t,e,i,r){if(i<0||r>t.length)throw new RangeError("Out of range index");if(r<=i)return t;i>>>=0,r=void 0===r?t.length:r>>>0;for(var n=i,s=e.length;n<=r-s;)e.copy(t,n),n+=s;return n!==r&&e.copy(t,n,0,r-n),t}(t,e,i,o):s(t,0,i,o)}},7295:(t,e,i)=>{var r=i(8764).Buffer;t.exports=function(t,e){for(var i=Math.min(t.length,e.length),n=new r(i),s=0;s{"use strict";var r=i(5108);const n=i(9742),s=i(645),o="function"==typeof Symbol&&"function"==typeof Symbol.for?Symbol.for("nodejs.util.inspect.custom"):null;e.Buffer=u,e.SlowBuffer=function(t){return+t!=t&&(t=0),u.alloc(+t)},e.INSPECT_MAX_BYTES=50;const a=2147483647;function h(t){if(t>a)throw new RangeError('The value "'+t+'" is invalid for option "size"');const e=new Uint8Array(t);return Object.setPrototypeOf(e,u.prototype),e}function u(t,e,i){if("number"==typeof t){if("string"==typeof e)throw new TypeError('The "string" argument must be of type string. Received type number');return d(t)}return l(t,e,i)}function l(t,e,i){if("string"==typeof t)return function(t,e){if("string"==typeof e&&""!==e||(e="utf8"),!u.isEncoding(e))throw new TypeError("Unknown encoding: "+e);const i=0|g(t,e);let r=h(i);const n=r.write(t,e);return n!==i&&(r=r.slice(0,n)),r}(t,e);if(ArrayBuffer.isView(t))return function(t){if(J(t,Uint8Array)){const e=new Uint8Array(t);return p(e.buffer,e.byteOffset,e.byteLength)}return f(t)}(t);if(null==t)throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type "+typeof t);if(J(t,ArrayBuffer)||t&&J(t.buffer,ArrayBuffer))return p(t,e,i);if("undefined"!=typeof SharedArrayBuffer&&(J(t,SharedArrayBuffer)||t&&J(t.buffer,SharedArrayBuffer)))return p(t,e,i);if("number"==typeof t)throw new TypeError('The "value" argument must not be of type number. Received type number');const r=t.valueOf&&t.valueOf();if(null!=r&&r!==t)return u.from(r,e,i);const n=function(t){if(u.isBuffer(t)){const e=0|m(t.length),i=h(e);return 0===i.length||t.copy(i,0,0,e),i}return void 0!==t.length?"number"!=typeof t.length||Y(t.length)?h(0):f(t):"Buffer"===t.type&&Array.isArray(t.data)?f(t.data):void 0}(t);if(n)return n;if("undefined"!=typeof Symbol&&null!=Symbol.toPrimitive&&"function"==typeof t[Symbol.toPrimitive])return u.from(t[Symbol.toPrimitive]("string"),e,i);throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type "+typeof t)}function c(t){if("number"!=typeof t)throw new TypeError('"size" argument must be of type number');if(t<0)throw new RangeError('The value "'+t+'" is invalid for option "size"')}function d(t){return c(t),h(t<0?0:0|m(t))}function f(t){const e=t.length<0?0:0|m(t.length),i=h(e);for(let r=0;r=a)throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x"+a.toString(16)+" bytes");return 0|t}function g(t,e){if(u.isBuffer(t))return t.length;if(ArrayBuffer.isView(t)||J(t,ArrayBuffer))return t.byteLength;if("string"!=typeof t)throw new TypeError('The "string" argument must be one of type string, Buffer, or ArrayBuffer. Received type '+typeof t);const i=t.length,r=arguments.length>2&&!0===arguments[2];if(!r&&0===i)return 0;let n=!1;for(;;)switch(e){case"ascii":case"latin1":case"binary":return i;case"utf8":case"utf-8":return V(t).length;case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return 2*i;case"hex":return i>>>1;case"base64":return K(t).length;default:if(n)return r?-1:V(t).length;e=(""+e).toLowerCase(),n=!0}}function b(t,e,i){let r=!1;if((void 0===e||e<0)&&(e=0),e>this.length)return"";if((void 0===i||i>this.length)&&(i=this.length),i<=0)return"";if((i>>>=0)<=(e>>>=0))return"";for(t||(t="utf8");;)switch(t){case"hex":return B(this,e,i);case"utf8":case"utf-8":return T(this,e,i);case"ascii":return I(this,e,i);case"latin1":case"binary":return C(this,e,i);case"base64":return S(this,e,i);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return R(this,e,i);default:if(r)throw new TypeError("Unknown encoding: "+t);t=(t+"").toLowerCase(),r=!0}}function v(t,e,i){const r=t[e];t[e]=t[i],t[i]=r}function y(t,e,i,r,n){if(0===t.length)return-1;if("string"==typeof i?(r=i,i=0):i>2147483647?i=2147483647:i<-2147483648&&(i=-2147483648),Y(i=+i)&&(i=n?0:t.length-1),i<0&&(i=t.length+i),i>=t.length){if(n)return-1;i=t.length-1}else if(i<0){if(!n)return-1;i=0}if("string"==typeof e&&(e=u.from(e,r)),u.isBuffer(e))return 0===e.length?-1:w(t,e,i,r,n);if("number"==typeof e)return e&=255,"function"==typeof Uint8Array.prototype.indexOf?n?Uint8Array.prototype.indexOf.call(t,e,i):Uint8Array.prototype.lastIndexOf.call(t,e,i):w(t,[e],i,r,n);throw new TypeError("val must be string, number or Buffer")}function w(t,e,i,r,n){let s,o=1,a=t.length,h=e.length;if(void 0!==r&&("ucs2"===(r=String(r).toLowerCase())||"ucs-2"===r||"utf16le"===r||"utf-16le"===r)){if(t.length<2||e.length<2)return-1;o=2,a/=2,h/=2,i/=2}function u(t,e){return 1===o?t[e]:t.readUInt16BE(e*o)}if(n){let r=-1;for(s=i;sa&&(i=a-h),s=i;s>=0;s--){let i=!0;for(let r=0;rn&&(r=n):r=n;const s=e.length;let o;for(r>s/2&&(r=s/2),o=0;o>8,n=i%256,s.push(n),s.push(r);return s}(e,t.length-i),t,i,r)}function S(t,e,i){return 0===e&&i===t.length?n.fromByteArray(t):n.fromByteArray(t.slice(e,i))}function T(t,e,i){i=Math.min(t.length,i);const r=[];let n=e;for(;n239?4:e>223?3:e>191?2:1;if(n+o<=i){let i,r,a,h;switch(o){case 1:e<128&&(s=e);break;case 2:i=t[n+1],128==(192&i)&&(h=(31&e)<<6|63&i,h>127&&(s=h));break;case 3:i=t[n+1],r=t[n+2],128==(192&i)&&128==(192&r)&&(h=(15&e)<<12|(63&i)<<6|63&r,h>2047&&(h<55296||h>57343)&&(s=h));break;case 4:i=t[n+1],r=t[n+2],a=t[n+3],128==(192&i)&&128==(192&r)&&128==(192&a)&&(h=(15&e)<<18|(63&i)<<12|(63&r)<<6|63&a,h>65535&&h<1114112&&(s=h))}}null===s?(s=65533,o=1):s>65535&&(s-=65536,r.push(s>>>10&1023|55296),s=56320|1023&s),r.push(s),n+=o}return function(t){const e=t.length;if(e<=A)return String.fromCharCode.apply(String,t);let i="",r=0;for(;rr.length?(u.isBuffer(e)||(e=u.from(e)),e.copy(r,n)):Uint8Array.prototype.set.call(r,e,n);else{if(!u.isBuffer(e))throw new TypeError('"list" argument must be an Array of Buffers');e.copy(r,n)}n+=e.length}return r},u.byteLength=g,u.prototype._isBuffer=!0,u.prototype.swap16=function(){const t=this.length;if(t%2!=0)throw new RangeError("Buffer size must be a multiple of 16-bits");for(let e=0;ei&&(t+=" ... "),""},o&&(u.prototype[o]=u.prototype.inspect),u.prototype.compare=function(t,e,i,r,n){if(J(t,Uint8Array)&&(t=u.from(t,t.offset,t.byteLength)),!u.isBuffer(t))throw new TypeError('The "target" argument must be one of type Buffer or Uint8Array. Received type '+typeof t);if(void 0===e&&(e=0),void 0===i&&(i=t?t.length:0),void 0===r&&(r=0),void 0===n&&(n=this.length),e<0||i>t.length||r<0||n>this.length)throw new RangeError("out of range index");if(r>=n&&e>=i)return 0;if(r>=n)return-1;if(e>=i)return 1;if(this===t)return 0;let s=(n>>>=0)-(r>>>=0),o=(i>>>=0)-(e>>>=0);const a=Math.min(s,o),h=this.slice(r,n),l=t.slice(e,i);for(let t=0;t>>=0,isFinite(i)?(i>>>=0,void 0===r&&(r="utf8")):(r=i,i=void 0)}const n=this.length-e;if((void 0===i||i>n)&&(i=n),t.length>0&&(i<0||e<0)||e>this.length)throw new RangeError("Attempt to write outside buffer bounds");r||(r="utf8");let s=!1;for(;;)switch(r){case"hex":return _(this,t,e,i);case"utf8":case"utf-8":return M(this,t,e,i);case"ascii":case"latin1":case"binary":return k(this,t,e,i);case"base64":return x(this,t,e,i);case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return E(this,t,e,i);default:if(s)throw new TypeError("Unknown encoding: "+r);r=(""+r).toLowerCase(),s=!0}},u.prototype.toJSON=function(){return{type:"Buffer",data:Array.prototype.slice.call(this._arr||this,0)}};const A=4096;function I(t,e,i){let r="";i=Math.min(t.length,i);for(let n=e;nr)&&(i=r);let n="";for(let r=e;ri)throw new RangeError("Trying to access beyond buffer length")}function L(t,e,i,r,n,s){if(!u.isBuffer(t))throw new TypeError('"buffer" argument must be a Buffer instance');if(e>n||et.length)throw new RangeError("Index out of range")}function O(t,e,i,r,n){H(e,r,n,t,i,7);let s=Number(e&BigInt(4294967295));t[i++]=s,s>>=8,t[i++]=s,s>>=8,t[i++]=s,s>>=8,t[i++]=s;let o=Number(e>>BigInt(32)&BigInt(4294967295));return t[i++]=o,o>>=8,t[i++]=o,o>>=8,t[i++]=o,o>>=8,t[i++]=o,i}function D(t,e,i,r,n){H(e,r,n,t,i,7);let s=Number(e&BigInt(4294967295));t[i+7]=s,s>>=8,t[i+6]=s,s>>=8,t[i+5]=s,s>>=8,t[i+4]=s;let o=Number(e>>BigInt(32)&BigInt(4294967295));return t[i+3]=o,o>>=8,t[i+2]=o,o>>=8,t[i+1]=o,o>>=8,t[i]=o,i+8}function N(t,e,i,r,n,s){if(i+r>t.length)throw new RangeError("Index out of range");if(i<0)throw new RangeError("Index out of range")}function j(t,e,i,r,n){return e=+e,i>>>=0,n||N(t,0,i,4),s.write(t,e,i,r,23,4),i+4}function U(t,e,i,r,n){return e=+e,i>>>=0,n||N(t,0,i,8),s.write(t,e,i,r,52,8),i+8}u.prototype.slice=function(t,e){const i=this.length;(t=~~t)<0?(t+=i)<0&&(t=0):t>i&&(t=i),(e=void 0===e?i:~~e)<0?(e+=i)<0&&(e=0):e>i&&(e=i),e>>=0,e>>>=0,i||P(t,e,this.length);let r=this[t],n=1,s=0;for(;++s>>=0,e>>>=0,i||P(t,e,this.length);let r=this[t+--e],n=1;for(;e>0&&(n*=256);)r+=this[t+--e]*n;return r},u.prototype.readUint8=u.prototype.readUInt8=function(t,e){return t>>>=0,e||P(t,1,this.length),this[t]},u.prototype.readUint16LE=u.prototype.readUInt16LE=function(t,e){return t>>>=0,e||P(t,2,this.length),this[t]|this[t+1]<<8},u.prototype.readUint16BE=u.prototype.readUInt16BE=function(t,e){return t>>>=0,e||P(t,2,this.length),this[t]<<8|this[t+1]},u.prototype.readUint32LE=u.prototype.readUInt32LE=function(t,e){return t>>>=0,e||P(t,4,this.length),(this[t]|this[t+1]<<8|this[t+2]<<16)+16777216*this[t+3]},u.prototype.readUint32BE=u.prototype.readUInt32BE=function(t,e){return t>>>=0,e||P(t,4,this.length),16777216*this[t]+(this[t+1]<<16|this[t+2]<<8|this[t+3])},u.prototype.readBigUInt64LE=Q((function(t){W(t>>>=0,"offset");const e=this[t],i=this[t+7];void 0!==e&&void 0!==i||$(t,this.length-8);const r=e+256*this[++t]+65536*this[++t]+this[++t]*2**24,n=this[++t]+256*this[++t]+65536*this[++t]+i*2**24;return BigInt(r)+(BigInt(n)<>>=0,"offset");const e=this[t],i=this[t+7];void 0!==e&&void 0!==i||$(t,this.length-8);const r=e*2**24+65536*this[++t]+256*this[++t]+this[++t],n=this[++t]*2**24+65536*this[++t]+256*this[++t]+i;return(BigInt(r)<>>=0,e>>>=0,i||P(t,e,this.length);let r=this[t],n=1,s=0;for(;++s=n&&(r-=Math.pow(2,8*e)),r},u.prototype.readIntBE=function(t,e,i){t>>>=0,e>>>=0,i||P(t,e,this.length);let r=e,n=1,s=this[t+--r];for(;r>0&&(n*=256);)s+=this[t+--r]*n;return n*=128,s>=n&&(s-=Math.pow(2,8*e)),s},u.prototype.readInt8=function(t,e){return t>>>=0,e||P(t,1,this.length),128&this[t]?-1*(255-this[t]+1):this[t]},u.prototype.readInt16LE=function(t,e){t>>>=0,e||P(t,2,this.length);const i=this[t]|this[t+1]<<8;return 32768&i?4294901760|i:i},u.prototype.readInt16BE=function(t,e){t>>>=0,e||P(t,2,this.length);const i=this[t+1]|this[t]<<8;return 32768&i?4294901760|i:i},u.prototype.readInt32LE=function(t,e){return t>>>=0,e||P(t,4,this.length),this[t]|this[t+1]<<8|this[t+2]<<16|this[t+3]<<24},u.prototype.readInt32BE=function(t,e){return t>>>=0,e||P(t,4,this.length),this[t]<<24|this[t+1]<<16|this[t+2]<<8|this[t+3]},u.prototype.readBigInt64LE=Q((function(t){W(t>>>=0,"offset");const e=this[t],i=this[t+7];void 0!==e&&void 0!==i||$(t,this.length-8);const r=this[t+4]+256*this[t+5]+65536*this[t+6]+(i<<24);return(BigInt(r)<>>=0,"offset");const e=this[t],i=this[t+7];void 0!==e&&void 0!==i||$(t,this.length-8);const r=(e<<24)+65536*this[++t]+256*this[++t]+this[++t];return(BigInt(r)<>>=0,e||P(t,4,this.length),s.read(this,t,!0,23,4)},u.prototype.readFloatBE=function(t,e){return t>>>=0,e||P(t,4,this.length),s.read(this,t,!1,23,4)},u.prototype.readDoubleLE=function(t,e){return t>>>=0,e||P(t,8,this.length),s.read(this,t,!0,52,8)},u.prototype.readDoubleBE=function(t,e){return t>>>=0,e||P(t,8,this.length),s.read(this,t,!1,52,8)},u.prototype.writeUintLE=u.prototype.writeUIntLE=function(t,e,i,r){t=+t,e>>>=0,i>>>=0,r||L(this,t,e,i,Math.pow(2,8*i)-1,0);let n=1,s=0;for(this[e]=255&t;++s>>=0,i>>>=0,r||L(this,t,e,i,Math.pow(2,8*i)-1,0);let n=i-1,s=1;for(this[e+n]=255&t;--n>=0&&(s*=256);)this[e+n]=t/s&255;return e+i},u.prototype.writeUint8=u.prototype.writeUInt8=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,1,255,0),this[e]=255&t,e+1},u.prototype.writeUint16LE=u.prototype.writeUInt16LE=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,2,65535,0),this[e]=255&t,this[e+1]=t>>>8,e+2},u.prototype.writeUint16BE=u.prototype.writeUInt16BE=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,2,65535,0),this[e]=t>>>8,this[e+1]=255&t,e+2},u.prototype.writeUint32LE=u.prototype.writeUInt32LE=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,4,4294967295,0),this[e+3]=t>>>24,this[e+2]=t>>>16,this[e+1]=t>>>8,this[e]=255&t,e+4},u.prototype.writeUint32BE=u.prototype.writeUInt32BE=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,4,4294967295,0),this[e]=t>>>24,this[e+1]=t>>>16,this[e+2]=t>>>8,this[e+3]=255&t,e+4},u.prototype.writeBigUInt64LE=Q((function(t,e=0){return O(this,t,e,BigInt(0),BigInt("0xffffffffffffffff"))})),u.prototype.writeBigUInt64BE=Q((function(t,e=0){return D(this,t,e,BigInt(0),BigInt("0xffffffffffffffff"))})),u.prototype.writeIntLE=function(t,e,i,r){if(t=+t,e>>>=0,!r){const r=Math.pow(2,8*i-1);L(this,t,e,i,r-1,-r)}let n=0,s=1,o=0;for(this[e]=255&t;++n>0)-o&255;return e+i},u.prototype.writeIntBE=function(t,e,i,r){if(t=+t,e>>>=0,!r){const r=Math.pow(2,8*i-1);L(this,t,e,i,r-1,-r)}let n=i-1,s=1,o=0;for(this[e+n]=255&t;--n>=0&&(s*=256);)t<0&&0===o&&0!==this[e+n+1]&&(o=1),this[e+n]=(t/s>>0)-o&255;return e+i},u.prototype.writeInt8=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,1,127,-128),t<0&&(t=255+t+1),this[e]=255&t,e+1},u.prototype.writeInt16LE=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,2,32767,-32768),this[e]=255&t,this[e+1]=t>>>8,e+2},u.prototype.writeInt16BE=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,2,32767,-32768),this[e]=t>>>8,this[e+1]=255&t,e+2},u.prototype.writeInt32LE=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,4,2147483647,-2147483648),this[e]=255&t,this[e+1]=t>>>8,this[e+2]=t>>>16,this[e+3]=t>>>24,e+4},u.prototype.writeInt32BE=function(t,e,i){return t=+t,e>>>=0,i||L(this,t,e,4,2147483647,-2147483648),t<0&&(t=4294967295+t+1),this[e]=t>>>24,this[e+1]=t>>>16,this[e+2]=t>>>8,this[e+3]=255&t,e+4},u.prototype.writeBigInt64LE=Q((function(t,e=0){return O(this,t,e,-BigInt("0x8000000000000000"),BigInt("0x7fffffffffffffff"))})),u.prototype.writeBigInt64BE=Q((function(t,e=0){return D(this,t,e,-BigInt("0x8000000000000000"),BigInt("0x7fffffffffffffff"))})),u.prototype.writeFloatLE=function(t,e,i){return j(this,t,e,!0,i)},u.prototype.writeFloatBE=function(t,e,i){return j(this,t,e,!1,i)},u.prototype.writeDoubleLE=function(t,e,i){return U(this,t,e,!0,i)},u.prototype.writeDoubleBE=function(t,e,i){return U(this,t,e,!1,i)},u.prototype.copy=function(t,e,i,r){if(!u.isBuffer(t))throw new TypeError("argument should be a Buffer");if(i||(i=0),r||0===r||(r=this.length),e>=t.length&&(e=t.length),e||(e=0),r>0&&r=this.length)throw new RangeError("Index out of range");if(r<0)throw new RangeError("sourceEnd out of bounds");r>this.length&&(r=this.length),t.length-e>>=0,i=void 0===i?this.length:i>>>0,t||(t=0),"number"==typeof t)for(n=e;n=r+4;i-=3)e=`_${t.slice(i-3,i)}${e}`;return`${t.slice(0,i)}${e}`}function H(t,e,i,r,n,s){if(t>i||t3?0===e||e===BigInt(0)?`>= 0${r} and < 2${r} ** ${8*(s+1)}${r}`:`>= -(2${r} ** ${8*(s+1)-1}${r}) and < 2 ** ${8*(s+1)-1}${r}`:`>= ${e}${r} and <= ${i}${r}`,new F.ERR_OUT_OF_RANGE("value",n,t)}!function(t,e,i){W(e,"offset"),void 0!==t[e]&&void 0!==t[e+i]||$(e,t.length-(i+1))}(r,n,s)}function W(t,e){if("number"!=typeof t)throw new F.ERR_INVALID_ARG_TYPE(e,"number",t)}function $(t,e,i){if(Math.floor(t)!==t)throw W(t,i),new F.ERR_OUT_OF_RANGE(i||"offset","an integer",t);if(e<0)throw new F.ERR_BUFFER_OUT_OF_BOUNDS;throw new F.ERR_OUT_OF_RANGE(i||"offset",`>= ${i?1:0} and <= ${e}`,t)}q("ERR_BUFFER_OUT_OF_BOUNDS",(function(t){return t?`${t} is outside of buffer bounds`:"Attempt to access memory outside buffer bounds"}),RangeError),q("ERR_INVALID_ARG_TYPE",(function(t,e){return`The "${t}" argument must be of type number. Received type ${typeof e}`}),TypeError),q("ERR_OUT_OF_RANGE",(function(t,e,i){let r=`The value of "${t}" is out of range.`,n=i;return Number.isInteger(i)&&Math.abs(i)>2**32?n=z(String(i)):"bigint"==typeof i&&(n=String(i),(i>BigInt(2)**BigInt(32)||i<-(BigInt(2)**BigInt(32)))&&(n=z(n)),n+="n"),r+=` It must be ${e}. Received ${n}`,r}),RangeError);const Z=/[^+/0-9A-Za-z-_]/g;function V(t,e){let i;e=e||1/0;const r=t.length;let n=null;const s=[];for(let o=0;o55295&&i<57344){if(!n){if(i>56319){(e-=3)>-1&&s.push(239,191,189);continue}if(o+1===r){(e-=3)>-1&&s.push(239,191,189);continue}n=i;continue}if(i<56320){(e-=3)>-1&&s.push(239,191,189),n=i;continue}i=65536+(n-55296<<10|i-56320)}else n&&(e-=3)>-1&&s.push(239,191,189);if(n=null,i<128){if((e-=1)<0)break;s.push(i)}else if(i<2048){if((e-=2)<0)break;s.push(i>>6|192,63&i|128)}else if(i<65536){if((e-=3)<0)break;s.push(i>>12|224,i>>6&63|128,63&i|128)}else{if(!(i<1114112))throw new Error("Invalid code point");if((e-=4)<0)break;s.push(i>>18|240,i>>12&63|128,i>>6&63|128,63&i|128)}}return s}function K(t){return n.toByteArray(function(t){if((t=(t=t.split("=")[0]).trim().replace(Z,"")).length<2)return"";for(;t.length%4!=0;)t+="=";return t}(t))}function G(t,e,i,r){let n;for(n=0;n=e.length||n>=t.length);++n)e[n+i]=t[n];return n}function J(t,e){return t instanceof e||null!=t&&null!=t.constructor&&null!=t.constructor.name&&t.constructor.name===e.name}function Y(t){return t!=t}const X=function(){const t="0123456789abcdef",e=new Array(256);for(let i=0;i<16;++i){const r=16*i;for(let n=0;n<16;++n)e[r+n]=t[i]+t[n]}return e}();function Q(t){return"undefined"==typeof BigInt?tt:t}function tt(){throw new Error("BigInt not supported")}},584:t=>{t.exports={100:"Continue",101:"Switching Protocols",102:"Processing",200:"OK",201:"Created",202:"Accepted",203:"Non-Authoritative Information",204:"No Content",205:"Reset Content",206:"Partial Content",207:"Multi-Status",208:"Already Reported",226:"IM Used",300:"Multiple Choices",301:"Moved Permanently",302:"Found",303:"See Other",304:"Not Modified",305:"Use Proxy",307:"Temporary Redirect",308:"Permanent Redirect",400:"Bad Request",401:"Unauthorized",402:"Payment Required",403:"Forbidden",404:"Not Found",405:"Method Not Allowed",406:"Not Acceptable",407:"Proxy Authentication Required",408:"Request Timeout",409:"Conflict",410:"Gone",411:"Length Required",412:"Precondition Failed",413:"Payload Too Large",414:"URI Too Long",415:"Unsupported Media Type",416:"Range Not Satisfiable",417:"Expectation Failed",418:"I'm a teapot",421:"Misdirected Request",422:"Unprocessable Entity",423:"Locked",424:"Failed Dependency",425:"Unordered Collection",426:"Upgrade Required",428:"Precondition Required",429:"Too Many Requests",431:"Request Header Fields Too Large",451:"Unavailable For Legal Reasons",500:"Internal Server Error",501:"Not Implemented",502:"Bad Gateway",503:"Service Unavailable",504:"Gateway Timeout",505:"HTTP Version Not Supported",506:"Variant Also Negotiates",507:"Insufficient Storage",508:"Loop Detected",509:"Bandwidth Limit Exceeded",510:"Not Extended",511:"Network Authentication Required"}},9421:(t,e,i)=>{const r=i(7117),n=i(4375);t.exports=class{constructor(t,e){if(this.store=t,this.chunkLength=t.chunkLength,this.inProgressGets=new Map,!this.store||!this.store.get||!this.store.put)throw new Error("First argument must be abstract-chunk-store compliant");this.cache=new r(e)}put(t,e,i=(()=>{})){if(!this.cache)return n((()=>i(new Error("CacheStore closed"))));this.cache.remove(t),this.store.put(t,e,i)}get(t,e,i=(()=>{})){if("function"==typeof e)return this.get(t,null,e);if(!this.cache)return n((()=>i(new Error("CacheStore closed"))));e||(e={});let r=this.cache.get(t);if(r){const t=e.offset||0,s=e.length||r.length-t;return 0===t&&s===r.length||(r=r.slice(t,s+t)),n((()=>i(null,r)))}let s=this.inProgressGets.get(t);const o=!!s;s||(s=[],this.inProgressGets.set(t,s)),s.push({opts:e,cb:i}),o||this.store.get(t,((e,i)=>{e||null==this.cache||this.cache.set(t,i);const r=this.inProgressGets.get(t);this.inProgressGets.delete(t);for(const{opts:t,cb:n}of r)if(e)n(e);else{const e=t.offset||0,r=t.length||i.length-e;let s=i;0===e&&r===i.length||(s=i.slice(e,r+e)),n(null,s)}}))}close(t=(()=>{})){if(!this.cache)return n((()=>t(new Error("CacheStore closed"))));this.cache=null,this.store.close(t)}destroy(t=(()=>{})){if(!this.cache)return n((()=>t(new Error("CacheStore closed"))));this.cache=null,this.store.destroy(t)}}},1924:(t,e,i)=>{"use strict";var r=i(210),n=i(5559),s=n(r("String.prototype.indexOf"));t.exports=function(t,e){var i=r(t,!!e);return"function"==typeof i&&s(t,".prototype.")>-1?n(i):i}},5559:(t,e,i)=>{"use strict";var r=i(8612),n=i(210),s=n("%Function.prototype.apply%"),o=n("%Function.prototype.call%"),a=n("%Reflect.apply%",!0)||r.call(o,s),h=n("%Object.getOwnPropertyDescriptor%",!0),u=n("%Object.defineProperty%",!0),l=n("%Math.max%");if(u)try{u({},"a",{value:1})}catch(t){u=null}t.exports=function(t){var e=a(r,o,arguments);if(h&&u){var i=h(e,"length");i.configurable&&u(e,"length",{value:1+l(0,t.length-(arguments.length-1))})}return e};var c=function(){return a(r,s,arguments)};u?u(t.exports,"apply",{value:c}):t.exports.apply=c},5293:(t,e,i)=>{const r=i(9e3),n=i(8473);class s extends n.Writable{constructor(t,e,i={}){if(super(i),!t||!t.put||!t.get)throw new Error("First argument must be an abstract-chunk-store compliant store");if(!(e=Number(e)))throw new Error("Second argument must be a chunk length");const n=void 0!==i.zeroPadding&&i.zeroPadding;this._blockstream=new r(e,{...i,zeroPadding:n}),this._outstandingPuts=0,this._storeMaxOutstandingPuts=i.storeMaxOutstandingPuts||16;let s=0;this._blockstream.on("data",(e=>{this.destroyed||(this._outstandingPuts+=1,this._outstandingPuts>=this._storeMaxOutstandingPuts&&this._blockstream.pause(),t.put(s,e,(t=>{if(t)return this.destroy(t);this._outstandingPuts-=1,this._outstandingPuts{this.destroy(t)}))}_write(t,e,i){this._blockstream.write(t,e,i)}_final(t){this._blockstream.end(),this._blockstream.once("end",(()=>{0===this._outstandingPuts?t(null):this._finalCb=t}))}destroy(t){this.destroyed||(this.destroyed=!0,t&&this.emit("error",t),this.emit("close"))}}t.exports=s},1027:(t,e,i)=>{var r=i(9509).Buffer,n=i(2830).Transform,s=i(2553).s;function o(t){n.call(this),this.hashMode="string"==typeof t,this.hashMode?this[t]=this._finalOrDigest:this.final=this._finalOrDigest,this._final&&(this.__final=this._final,this._final=null),this._decoder=null,this._encoding=null}i(5717)(o,n),o.prototype.update=function(t,e,i){"string"==typeof t&&(t=r.from(t,e));var n=this._update(t);return this.hashMode?this:(i&&(n=this._toString(n,i)),n)},o.prototype.setAutoPadding=function(){},o.prototype.getAuthTag=function(){throw new Error("trying to get auth tag in unsupported state")},o.prototype.setAuthTag=function(){throw new Error("trying to set auth tag in unsupported state")},o.prototype.setAAD=function(){throw new Error("trying to set aad in unsupported state")},o.prototype._transform=function(t,e,i){var r;try{this.hashMode?this._update(t):this.push(this._update(t))}catch(t){r=t}finally{i(r)}},o.prototype._flush=function(t){var e;try{this.push(this.__final())}catch(t){e=t}t(e)},o.prototype._finalOrDigest=function(t){var e=this.__final()||r.alloc(0);return t&&(e=this._toString(e,t,!0)),e},o.prototype._toString=function(t,e,i){if(this._decoder||(this._decoder=new s(e),this._encoding=e),this._encoding!==e)throw new Error("can't switch encodings");var r=this._decoder.write(t);return i&&(r+=this._decoder.end()),r},t.exports=o},6313:(t,e,i)=>{var r=i(8764).Buffer,n=function(){"use strict";function t(t,e){return null!=e&&t instanceof e}var e,i,n;try{e=Map}catch(t){e=function(){}}try{i=Set}catch(t){i=function(){}}try{n=Promise}catch(t){n=function(){}}function s(o,h,u,l,c){"object"==typeof h&&(u=h.depth,l=h.prototype,c=h.includeNonEnumerable,h=h.circular);var d=[],f=[],p=void 0!==r;return void 0===h&&(h=!0),void 0===u&&(u=1/0),function o(u,m){if(null===u)return null;if(0===m)return u;var g,b;if("object"!=typeof u)return u;if(t(u,e))g=new e;else if(t(u,i))g=new i;else if(t(u,n))g=new n((function(t,e){u.then((function(e){t(o(e,m-1))}),(function(t){e(o(t,m-1))}))}));else if(s.__isArray(u))g=[];else if(s.__isRegExp(u))g=new RegExp(u.source,a(u)),u.lastIndex&&(g.lastIndex=u.lastIndex);else if(s.__isDate(u))g=new Date(u.getTime());else{if(p&&r.isBuffer(u))return g=r.allocUnsafe?r.allocUnsafe(u.length):new r(u.length),u.copy(g),g;t(u,Error)?g=Object.create(u):void 0===l?(b=Object.getPrototypeOf(u),g=Object.create(b)):(g=Object.create(l),b=l)}if(h){var v=d.indexOf(u);if(-1!=v)return f[v];d.push(u),f.push(g)}for(var y in t(u,e)&&u.forEach((function(t,e){var i=o(e,m-1),r=o(t,m-1);g.set(i,r)})),t(u,i)&&u.forEach((function(t){var e=o(t,m-1);g.add(e)})),u){var w;b&&(w=Object.getOwnPropertyDescriptor(b,y)),w&&null==w.set||(g[y]=o(u[y],m-1))}if(Object.getOwnPropertySymbols){var _=Object.getOwnPropertySymbols(u);for(y=0;y<_.length;y++){var M=_[y];(!(x=Object.getOwnPropertyDescriptor(u,M))||x.enumerable||c)&&(g[M]=o(u[M],m-1),x.enumerable||Object.defineProperty(g,M,{enumerable:!1}))}}if(c){var k=Object.getOwnPropertyNames(u);for(y=0;y{var r=i(9539),n=i(9282);function s(){return(new Date).getTime()}var o,a=Array.prototype.slice,h={};o=void 0!==i.g&&i.g.console?i.g.console:"undefined"!=typeof window&&window.console?window.console:{};for(var u=[[function(){},"log"],[function(){o.log.apply(o,arguments)},"info"],[function(){o.log.apply(o,arguments)},"warn"],[function(){o.warn.apply(o,arguments)},"error"],[function(t){h[t]=s()},"time"],[function(t){var e=h[t];if(!e)throw new Error("No such label: "+t);delete h[t];var i=s()-e;o.log(t+": "+i+"ms")},"timeEnd"],[function(){var t=new Error;t.name="Trace",t.message=r.format.apply(null,arguments),o.error(t.stack)},"trace"],[function(t){o.log(r.inspect(t)+"\n")},"dir"],[function(t){if(!t){var e=a.call(arguments,1);n.ok(!1,r.format.apply(null,e))}},"assert"]],l=0;l{t.exports=function(){for(var t=navigator.hardwareConcurrency||1,e=[],i=0;i{var r=i(8764).Buffer,n=i(6266),s=i(6426);t.exports=function(t){return new a(t)};var o={secp256k1:{name:"secp256k1",byteLength:32},secp224r1:{name:"p224",byteLength:28},prime256v1:{name:"p256",byteLength:32},prime192v1:{name:"p192",byteLength:24},ed25519:{name:"ed25519",byteLength:32},secp384r1:{name:"p384",byteLength:48},secp521r1:{name:"p521",byteLength:66}};function a(t){this.curveType=o[t],this.curveType||(this.curveType={name:t}),this.curve=new n.ec(this.curveType.name),this.keys=void 0}function h(t,e,i){Array.isArray(t)||(t=t.toArray());var n=new r(t);if(i&&n.length=65&&i<=70?i-55:i>=97&&i<=102?i-87:i-48&15}function h(t,e,i){var r=a(t,i);return i-1>=e&&(r|=a(t,i-1)<<4),r}function u(t,e,i,r){for(var n=0,s=Math.min(t.length,i),o=e;o=49?a-49+10:a>=17?a-17+10:a}return n}s.isBN=function(t){return t instanceof s||null!==t&&"object"==typeof t&&t.constructor.wordSize===s.wordSize&&Array.isArray(t.words)},s.max=function(t,e){return t.cmp(e)>0?t:e},s.min=function(t,e){return t.cmp(e)<0?t:e},s.prototype._init=function(t,e,i){if("number"==typeof t)return this._initNumber(t,e,i);if("object"==typeof t)return this._initArray(t,e,i);"hex"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var n=0;"-"===(t=t.toString().replace(/\s+/g,""))[0]&&(n++,this.negative=1),n=0;n-=3)o=t[n]|t[n-1]<<8|t[n-2]<<16,this.words[s]|=o<>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);else if("le"===i)for(n=0,s=0;n>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);return this.strip()},s.prototype._parseHex=function(t,e,i){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var r=0;r=e;r-=2)n=h(t,e,r)<=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;else for(r=(t.length-e)%2==0?e+1:e;r=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;this.strip()},s.prototype._parseBase=function(t,e,i){this.words=[0],this.length=1;for(var r=0,n=1;n<=67108863;n*=e)r++;r--,n=n/e|0;for(var s=t.length-i,o=s%r,a=Math.min(s,s-o)+i,h=0,l=i;l1&&0===this.words[this.length-1];)this.length--;return this._normSign()},s.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},s.prototype.inspect=function(){return(this.red?""};var l=["","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"],c=[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],d=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function f(t,e,i){i.negative=e.negative^t.negative;var r=t.length+e.length|0;i.length=r,r=r-1|0;var n=0|t.words[0],s=0|e.words[0],o=n*s,a=67108863&o,h=o/67108864|0;i.words[0]=a;for(var u=1;u>>26,c=67108863&h,d=Math.min(u,e.length-1),f=Math.max(0,u-t.length+1);f<=d;f++){var p=u-f|0;l+=(o=(n=0|t.words[p])*(s=0|e.words[f])+c)/67108864|0,c=67108863&o}i.words[u]=0|c,h=0|l}return 0!==h?i.words[u]=0|h:i.length--,i.strip()}s.prototype.toString=function(t,e){var i;if(e=0|e||1,16===(t=t||10)||"hex"===t){i="";for(var n=0,s=0,o=0;o>>24-n&16777215)||o!==this.length-1?l[6-h.length]+h+i:h+i,(n+=2)>=26&&(n-=26,o--)}for(0!==s&&(i=s.toString(16)+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}if(t===(0|t)&&t>=2&&t<=36){var u=c[t],f=d[t];i="";var p=this.clone();for(p.negative=0;!p.isZero();){var m=p.modn(f).toString(t);i=(p=p.idivn(f)).isZero()?m+i:l[u-m.length]+m+i}for(this.isZero()&&(i="0"+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}r(!1,"Base should be between 2 and 36")},s.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-t:t},s.prototype.toJSON=function(){return this.toString(16)},s.prototype.toBuffer=function(t,e){return r(void 0!==o),this.toArrayLike(o,t,e)},s.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},s.prototype.toArrayLike=function(t,e,i){var n=this.byteLength(),s=i||Math.max(1,n);r(n<=s,"byte array longer than desired length"),r(s>0,"Requested array length <= 0"),this.strip();var o,a,h="le"===e,u=new t(s),l=this.clone();if(h){for(a=0;!l.isZero();a++)o=l.andln(255),l.iushrn(8),u[a]=o;for(;a=4096&&(i+=13,e>>>=13),e>=64&&(i+=7,e>>>=7),e>=8&&(i+=4,e>>>=4),e>=2&&(i+=2,e>>>=2),i+e},s.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,i=0;return 0==(8191&e)&&(i+=13,e>>>=13),0==(127&e)&&(i+=7,e>>>=7),0==(15&e)&&(i+=4,e>>>=4),0==(3&e)&&(i+=2,e>>>=2),0==(1&e)&&i++,i},s.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},s.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;et.length?this.clone().ior(t):t.clone().ior(this)},s.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},s.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var i=0;it.length?this.clone().iand(t):t.clone().iand(this)},s.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},s.prototype.iuxor=function(t){var e,i;this.length>t.length?(e=this,i=t):(e=t,i=this);for(var r=0;rt.length?this.clone().ixor(t):t.clone().ixor(this)},s.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},s.prototype.inotn=function(t){r("number"==typeof t&&t>=0);var e=0|Math.ceil(t/26),i=t%26;this._expand(e),i>0&&e--;for(var n=0;n0&&(this.words[n]=~this.words[n]&67108863>>26-i),this.strip()},s.prototype.notn=function(t){return this.clone().inotn(t)},s.prototype.setn=function(t,e){r("number"==typeof t&&t>=0);var i=t/26|0,n=t%26;return this._expand(i+1),this.words[i]=e?this.words[i]|1<t.length?(i=this,r=t):(i=t,r=this);for(var n=0,s=0;s>>26;for(;0!==n&&s>>26;if(this.length=i.length,0!==n)this.words[this.length]=n,this.length++;else if(i!==this)for(;st.length?this.clone().iadd(t):t.clone().iadd(this)},s.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var i,r,n=this.cmp(t);if(0===n)return this.negative=0,this.length=1,this.words[0]=0,this;n>0?(i=this,r=t):(i=t,r=this);for(var s=0,o=0;o>26,this.words[o]=67108863&e;for(;0!==s&&o>26,this.words[o]=67108863&e;if(0===s&&o>>13,f=0|o[1],p=8191&f,m=f>>>13,g=0|o[2],b=8191&g,v=g>>>13,y=0|o[3],w=8191&y,_=y>>>13,M=0|o[4],k=8191&M,x=M>>>13,E=0|o[5],S=8191&E,T=E>>>13,A=0|o[6],I=8191&A,C=A>>>13,B=0|o[7],R=8191&B,P=B>>>13,L=0|o[8],O=8191&L,D=L>>>13,N=0|o[9],j=8191&N,U=N>>>13,F=0|a[0],q=8191&F,z=F>>>13,H=0|a[1],W=8191&H,$=H>>>13,Z=0|a[2],V=8191&Z,K=Z>>>13,G=0|a[3],J=8191&G,Y=G>>>13,X=0|a[4],Q=8191&X,tt=X>>>13,et=0|a[5],it=8191&et,rt=et>>>13,nt=0|a[6],st=8191&nt,ot=nt>>>13,at=0|a[7],ht=8191&at,ut=at>>>13,lt=0|a[8],ct=8191<,dt=lt>>>13,ft=0|a[9],pt=8191&ft,mt=ft>>>13;i.negative=t.negative^e.negative,i.length=19;var gt=(u+(r=Math.imul(c,q))|0)+((8191&(n=(n=Math.imul(c,z))+Math.imul(d,q)|0))<<13)|0;u=((s=Math.imul(d,z))+(n>>>13)|0)+(gt>>>26)|0,gt&=67108863,r=Math.imul(p,q),n=(n=Math.imul(p,z))+Math.imul(m,q)|0,s=Math.imul(m,z);var bt=(u+(r=r+Math.imul(c,W)|0)|0)+((8191&(n=(n=n+Math.imul(c,$)|0)+Math.imul(d,W)|0))<<13)|0;u=((s=s+Math.imul(d,$)|0)+(n>>>13)|0)+(bt>>>26)|0,bt&=67108863,r=Math.imul(b,q),n=(n=Math.imul(b,z))+Math.imul(v,q)|0,s=Math.imul(v,z),r=r+Math.imul(p,W)|0,n=(n=n+Math.imul(p,$)|0)+Math.imul(m,W)|0,s=s+Math.imul(m,$)|0;var vt=(u+(r=r+Math.imul(c,V)|0)|0)+((8191&(n=(n=n+Math.imul(c,K)|0)+Math.imul(d,V)|0))<<13)|0;u=((s=s+Math.imul(d,K)|0)+(n>>>13)|0)+(vt>>>26)|0,vt&=67108863,r=Math.imul(w,q),n=(n=Math.imul(w,z))+Math.imul(_,q)|0,s=Math.imul(_,z),r=r+Math.imul(b,W)|0,n=(n=n+Math.imul(b,$)|0)+Math.imul(v,W)|0,s=s+Math.imul(v,$)|0,r=r+Math.imul(p,V)|0,n=(n=n+Math.imul(p,K)|0)+Math.imul(m,V)|0,s=s+Math.imul(m,K)|0;var yt=(u+(r=r+Math.imul(c,J)|0)|0)+((8191&(n=(n=n+Math.imul(c,Y)|0)+Math.imul(d,J)|0))<<13)|0;u=((s=s+Math.imul(d,Y)|0)+(n>>>13)|0)+(yt>>>26)|0,yt&=67108863,r=Math.imul(k,q),n=(n=Math.imul(k,z))+Math.imul(x,q)|0,s=Math.imul(x,z),r=r+Math.imul(w,W)|0,n=(n=n+Math.imul(w,$)|0)+Math.imul(_,W)|0,s=s+Math.imul(_,$)|0,r=r+Math.imul(b,V)|0,n=(n=n+Math.imul(b,K)|0)+Math.imul(v,V)|0,s=s+Math.imul(v,K)|0,r=r+Math.imul(p,J)|0,n=(n=n+Math.imul(p,Y)|0)+Math.imul(m,J)|0,s=s+Math.imul(m,Y)|0;var wt=(u+(r=r+Math.imul(c,Q)|0)|0)+((8191&(n=(n=n+Math.imul(c,tt)|0)+Math.imul(d,Q)|0))<<13)|0;u=((s=s+Math.imul(d,tt)|0)+(n>>>13)|0)+(wt>>>26)|0,wt&=67108863,r=Math.imul(S,q),n=(n=Math.imul(S,z))+Math.imul(T,q)|0,s=Math.imul(T,z),r=r+Math.imul(k,W)|0,n=(n=n+Math.imul(k,$)|0)+Math.imul(x,W)|0,s=s+Math.imul(x,$)|0,r=r+Math.imul(w,V)|0,n=(n=n+Math.imul(w,K)|0)+Math.imul(_,V)|0,s=s+Math.imul(_,K)|0,r=r+Math.imul(b,J)|0,n=(n=n+Math.imul(b,Y)|0)+Math.imul(v,J)|0,s=s+Math.imul(v,Y)|0,r=r+Math.imul(p,Q)|0,n=(n=n+Math.imul(p,tt)|0)+Math.imul(m,Q)|0,s=s+Math.imul(m,tt)|0;var _t=(u+(r=r+Math.imul(c,it)|0)|0)+((8191&(n=(n=n+Math.imul(c,rt)|0)+Math.imul(d,it)|0))<<13)|0;u=((s=s+Math.imul(d,rt)|0)+(n>>>13)|0)+(_t>>>26)|0,_t&=67108863,r=Math.imul(I,q),n=(n=Math.imul(I,z))+Math.imul(C,q)|0,s=Math.imul(C,z),r=r+Math.imul(S,W)|0,n=(n=n+Math.imul(S,$)|0)+Math.imul(T,W)|0,s=s+Math.imul(T,$)|0,r=r+Math.imul(k,V)|0,n=(n=n+Math.imul(k,K)|0)+Math.imul(x,V)|0,s=s+Math.imul(x,K)|0,r=r+Math.imul(w,J)|0,n=(n=n+Math.imul(w,Y)|0)+Math.imul(_,J)|0,s=s+Math.imul(_,Y)|0,r=r+Math.imul(b,Q)|0,n=(n=n+Math.imul(b,tt)|0)+Math.imul(v,Q)|0,s=s+Math.imul(v,tt)|0,r=r+Math.imul(p,it)|0,n=(n=n+Math.imul(p,rt)|0)+Math.imul(m,it)|0,s=s+Math.imul(m,rt)|0;var Mt=(u+(r=r+Math.imul(c,st)|0)|0)+((8191&(n=(n=n+Math.imul(c,ot)|0)+Math.imul(d,st)|0))<<13)|0;u=((s=s+Math.imul(d,ot)|0)+(n>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,r=Math.imul(R,q),n=(n=Math.imul(R,z))+Math.imul(P,q)|0,s=Math.imul(P,z),r=r+Math.imul(I,W)|0,n=(n=n+Math.imul(I,$)|0)+Math.imul(C,W)|0,s=s+Math.imul(C,$)|0,r=r+Math.imul(S,V)|0,n=(n=n+Math.imul(S,K)|0)+Math.imul(T,V)|0,s=s+Math.imul(T,K)|0,r=r+Math.imul(k,J)|0,n=(n=n+Math.imul(k,Y)|0)+Math.imul(x,J)|0,s=s+Math.imul(x,Y)|0,r=r+Math.imul(w,Q)|0,n=(n=n+Math.imul(w,tt)|0)+Math.imul(_,Q)|0,s=s+Math.imul(_,tt)|0,r=r+Math.imul(b,it)|0,n=(n=n+Math.imul(b,rt)|0)+Math.imul(v,it)|0,s=s+Math.imul(v,rt)|0,r=r+Math.imul(p,st)|0,n=(n=n+Math.imul(p,ot)|0)+Math.imul(m,st)|0,s=s+Math.imul(m,ot)|0;var kt=(u+(r=r+Math.imul(c,ht)|0)|0)+((8191&(n=(n=n+Math.imul(c,ut)|0)+Math.imul(d,ht)|0))<<13)|0;u=((s=s+Math.imul(d,ut)|0)+(n>>>13)|0)+(kt>>>26)|0,kt&=67108863,r=Math.imul(O,q),n=(n=Math.imul(O,z))+Math.imul(D,q)|0,s=Math.imul(D,z),r=r+Math.imul(R,W)|0,n=(n=n+Math.imul(R,$)|0)+Math.imul(P,W)|0,s=s+Math.imul(P,$)|0,r=r+Math.imul(I,V)|0,n=(n=n+Math.imul(I,K)|0)+Math.imul(C,V)|0,s=s+Math.imul(C,K)|0,r=r+Math.imul(S,J)|0,n=(n=n+Math.imul(S,Y)|0)+Math.imul(T,J)|0,s=s+Math.imul(T,Y)|0,r=r+Math.imul(k,Q)|0,n=(n=n+Math.imul(k,tt)|0)+Math.imul(x,Q)|0,s=s+Math.imul(x,tt)|0,r=r+Math.imul(w,it)|0,n=(n=n+Math.imul(w,rt)|0)+Math.imul(_,it)|0,s=s+Math.imul(_,rt)|0,r=r+Math.imul(b,st)|0,n=(n=n+Math.imul(b,ot)|0)+Math.imul(v,st)|0,s=s+Math.imul(v,ot)|0,r=r+Math.imul(p,ht)|0,n=(n=n+Math.imul(p,ut)|0)+Math.imul(m,ht)|0,s=s+Math.imul(m,ut)|0;var xt=(u+(r=r+Math.imul(c,ct)|0)|0)+((8191&(n=(n=n+Math.imul(c,dt)|0)+Math.imul(d,ct)|0))<<13)|0;u=((s=s+Math.imul(d,dt)|0)+(n>>>13)|0)+(xt>>>26)|0,xt&=67108863,r=Math.imul(j,q),n=(n=Math.imul(j,z))+Math.imul(U,q)|0,s=Math.imul(U,z),r=r+Math.imul(O,W)|0,n=(n=n+Math.imul(O,$)|0)+Math.imul(D,W)|0,s=s+Math.imul(D,$)|0,r=r+Math.imul(R,V)|0,n=(n=n+Math.imul(R,K)|0)+Math.imul(P,V)|0,s=s+Math.imul(P,K)|0,r=r+Math.imul(I,J)|0,n=(n=n+Math.imul(I,Y)|0)+Math.imul(C,J)|0,s=s+Math.imul(C,Y)|0,r=r+Math.imul(S,Q)|0,n=(n=n+Math.imul(S,tt)|0)+Math.imul(T,Q)|0,s=s+Math.imul(T,tt)|0,r=r+Math.imul(k,it)|0,n=(n=n+Math.imul(k,rt)|0)+Math.imul(x,it)|0,s=s+Math.imul(x,rt)|0,r=r+Math.imul(w,st)|0,n=(n=n+Math.imul(w,ot)|0)+Math.imul(_,st)|0,s=s+Math.imul(_,ot)|0,r=r+Math.imul(b,ht)|0,n=(n=n+Math.imul(b,ut)|0)+Math.imul(v,ht)|0,s=s+Math.imul(v,ut)|0,r=r+Math.imul(p,ct)|0,n=(n=n+Math.imul(p,dt)|0)+Math.imul(m,ct)|0,s=s+Math.imul(m,dt)|0;var Et=(u+(r=r+Math.imul(c,pt)|0)|0)+((8191&(n=(n=n+Math.imul(c,mt)|0)+Math.imul(d,pt)|0))<<13)|0;u=((s=s+Math.imul(d,mt)|0)+(n>>>13)|0)+(Et>>>26)|0,Et&=67108863,r=Math.imul(j,W),n=(n=Math.imul(j,$))+Math.imul(U,W)|0,s=Math.imul(U,$),r=r+Math.imul(O,V)|0,n=(n=n+Math.imul(O,K)|0)+Math.imul(D,V)|0,s=s+Math.imul(D,K)|0,r=r+Math.imul(R,J)|0,n=(n=n+Math.imul(R,Y)|0)+Math.imul(P,J)|0,s=s+Math.imul(P,Y)|0,r=r+Math.imul(I,Q)|0,n=(n=n+Math.imul(I,tt)|0)+Math.imul(C,Q)|0,s=s+Math.imul(C,tt)|0,r=r+Math.imul(S,it)|0,n=(n=n+Math.imul(S,rt)|0)+Math.imul(T,it)|0,s=s+Math.imul(T,rt)|0,r=r+Math.imul(k,st)|0,n=(n=n+Math.imul(k,ot)|0)+Math.imul(x,st)|0,s=s+Math.imul(x,ot)|0,r=r+Math.imul(w,ht)|0,n=(n=n+Math.imul(w,ut)|0)+Math.imul(_,ht)|0,s=s+Math.imul(_,ut)|0,r=r+Math.imul(b,ct)|0,n=(n=n+Math.imul(b,dt)|0)+Math.imul(v,ct)|0,s=s+Math.imul(v,dt)|0;var St=(u+(r=r+Math.imul(p,pt)|0)|0)+((8191&(n=(n=n+Math.imul(p,mt)|0)+Math.imul(m,pt)|0))<<13)|0;u=((s=s+Math.imul(m,mt)|0)+(n>>>13)|0)+(St>>>26)|0,St&=67108863,r=Math.imul(j,V),n=(n=Math.imul(j,K))+Math.imul(U,V)|0,s=Math.imul(U,K),r=r+Math.imul(O,J)|0,n=(n=n+Math.imul(O,Y)|0)+Math.imul(D,J)|0,s=s+Math.imul(D,Y)|0,r=r+Math.imul(R,Q)|0,n=(n=n+Math.imul(R,tt)|0)+Math.imul(P,Q)|0,s=s+Math.imul(P,tt)|0,r=r+Math.imul(I,it)|0,n=(n=n+Math.imul(I,rt)|0)+Math.imul(C,it)|0,s=s+Math.imul(C,rt)|0,r=r+Math.imul(S,st)|0,n=(n=n+Math.imul(S,ot)|0)+Math.imul(T,st)|0,s=s+Math.imul(T,ot)|0,r=r+Math.imul(k,ht)|0,n=(n=n+Math.imul(k,ut)|0)+Math.imul(x,ht)|0,s=s+Math.imul(x,ut)|0,r=r+Math.imul(w,ct)|0,n=(n=n+Math.imul(w,dt)|0)+Math.imul(_,ct)|0,s=s+Math.imul(_,dt)|0;var Tt=(u+(r=r+Math.imul(b,pt)|0)|0)+((8191&(n=(n=n+Math.imul(b,mt)|0)+Math.imul(v,pt)|0))<<13)|0;u=((s=s+Math.imul(v,mt)|0)+(n>>>13)|0)+(Tt>>>26)|0,Tt&=67108863,r=Math.imul(j,J),n=(n=Math.imul(j,Y))+Math.imul(U,J)|0,s=Math.imul(U,Y),r=r+Math.imul(O,Q)|0,n=(n=n+Math.imul(O,tt)|0)+Math.imul(D,Q)|0,s=s+Math.imul(D,tt)|0,r=r+Math.imul(R,it)|0,n=(n=n+Math.imul(R,rt)|0)+Math.imul(P,it)|0,s=s+Math.imul(P,rt)|0,r=r+Math.imul(I,st)|0,n=(n=n+Math.imul(I,ot)|0)+Math.imul(C,st)|0,s=s+Math.imul(C,ot)|0,r=r+Math.imul(S,ht)|0,n=(n=n+Math.imul(S,ut)|0)+Math.imul(T,ht)|0,s=s+Math.imul(T,ut)|0,r=r+Math.imul(k,ct)|0,n=(n=n+Math.imul(k,dt)|0)+Math.imul(x,ct)|0,s=s+Math.imul(x,dt)|0;var At=(u+(r=r+Math.imul(w,pt)|0)|0)+((8191&(n=(n=n+Math.imul(w,mt)|0)+Math.imul(_,pt)|0))<<13)|0;u=((s=s+Math.imul(_,mt)|0)+(n>>>13)|0)+(At>>>26)|0,At&=67108863,r=Math.imul(j,Q),n=(n=Math.imul(j,tt))+Math.imul(U,Q)|0,s=Math.imul(U,tt),r=r+Math.imul(O,it)|0,n=(n=n+Math.imul(O,rt)|0)+Math.imul(D,it)|0,s=s+Math.imul(D,rt)|0,r=r+Math.imul(R,st)|0,n=(n=n+Math.imul(R,ot)|0)+Math.imul(P,st)|0,s=s+Math.imul(P,ot)|0,r=r+Math.imul(I,ht)|0,n=(n=n+Math.imul(I,ut)|0)+Math.imul(C,ht)|0,s=s+Math.imul(C,ut)|0,r=r+Math.imul(S,ct)|0,n=(n=n+Math.imul(S,dt)|0)+Math.imul(T,ct)|0,s=s+Math.imul(T,dt)|0;var It=(u+(r=r+Math.imul(k,pt)|0)|0)+((8191&(n=(n=n+Math.imul(k,mt)|0)+Math.imul(x,pt)|0))<<13)|0;u=((s=s+Math.imul(x,mt)|0)+(n>>>13)|0)+(It>>>26)|0,It&=67108863,r=Math.imul(j,it),n=(n=Math.imul(j,rt))+Math.imul(U,it)|0,s=Math.imul(U,rt),r=r+Math.imul(O,st)|0,n=(n=n+Math.imul(O,ot)|0)+Math.imul(D,st)|0,s=s+Math.imul(D,ot)|0,r=r+Math.imul(R,ht)|0,n=(n=n+Math.imul(R,ut)|0)+Math.imul(P,ht)|0,s=s+Math.imul(P,ut)|0,r=r+Math.imul(I,ct)|0,n=(n=n+Math.imul(I,dt)|0)+Math.imul(C,ct)|0,s=s+Math.imul(C,dt)|0;var Ct=(u+(r=r+Math.imul(S,pt)|0)|0)+((8191&(n=(n=n+Math.imul(S,mt)|0)+Math.imul(T,pt)|0))<<13)|0;u=((s=s+Math.imul(T,mt)|0)+(n>>>13)|0)+(Ct>>>26)|0,Ct&=67108863,r=Math.imul(j,st),n=(n=Math.imul(j,ot))+Math.imul(U,st)|0,s=Math.imul(U,ot),r=r+Math.imul(O,ht)|0,n=(n=n+Math.imul(O,ut)|0)+Math.imul(D,ht)|0,s=s+Math.imul(D,ut)|0,r=r+Math.imul(R,ct)|0,n=(n=n+Math.imul(R,dt)|0)+Math.imul(P,ct)|0,s=s+Math.imul(P,dt)|0;var Bt=(u+(r=r+Math.imul(I,pt)|0)|0)+((8191&(n=(n=n+Math.imul(I,mt)|0)+Math.imul(C,pt)|0))<<13)|0;u=((s=s+Math.imul(C,mt)|0)+(n>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,r=Math.imul(j,ht),n=(n=Math.imul(j,ut))+Math.imul(U,ht)|0,s=Math.imul(U,ut),r=r+Math.imul(O,ct)|0,n=(n=n+Math.imul(O,dt)|0)+Math.imul(D,ct)|0,s=s+Math.imul(D,dt)|0;var Rt=(u+(r=r+Math.imul(R,pt)|0)|0)+((8191&(n=(n=n+Math.imul(R,mt)|0)+Math.imul(P,pt)|0))<<13)|0;u=((s=s+Math.imul(P,mt)|0)+(n>>>13)|0)+(Rt>>>26)|0,Rt&=67108863,r=Math.imul(j,ct),n=(n=Math.imul(j,dt))+Math.imul(U,ct)|0,s=Math.imul(U,dt);var Pt=(u+(r=r+Math.imul(O,pt)|0)|0)+((8191&(n=(n=n+Math.imul(O,mt)|0)+Math.imul(D,pt)|0))<<13)|0;u=((s=s+Math.imul(D,mt)|0)+(n>>>13)|0)+(Pt>>>26)|0,Pt&=67108863;var Lt=(u+(r=Math.imul(j,pt))|0)+((8191&(n=(n=Math.imul(j,mt))+Math.imul(U,pt)|0))<<13)|0;return u=((s=Math.imul(U,mt))+(n>>>13)|0)+(Lt>>>26)|0,Lt&=67108863,h[0]=gt,h[1]=bt,h[2]=vt,h[3]=yt,h[4]=wt,h[5]=_t,h[6]=Mt,h[7]=kt,h[8]=xt,h[9]=Et,h[10]=St,h[11]=Tt,h[12]=At,h[13]=It,h[14]=Ct,h[15]=Bt,h[16]=Rt,h[17]=Pt,h[18]=Lt,0!==u&&(h[19]=u,i.length++),i};function m(t,e,i){return(new g).mulp(t,e,i)}function g(t,e){this.x=t,this.y=e}Math.imul||(p=f),s.prototype.mulTo=function(t,e){var i,r=this.length+t.length;return i=10===this.length&&10===t.length?p(this,t,e):r<63?f(this,t,e):r<1024?function(t,e,i){i.negative=e.negative^t.negative,i.length=t.length+e.length;for(var r=0,n=0,s=0;s>>26)|0)>>>26,o&=67108863}i.words[s]=a,r=o,o=n}return 0!==r?i.words[s]=r:i.length--,i.strip()}(this,t,e):m(this,t,e),i},g.prototype.makeRBT=function(t){for(var e=new Array(t),i=s.prototype._countBits(t)-1,r=0;r>=1;return r},g.prototype.permute=function(t,e,i,r,n,s){for(var o=0;o>>=1)n++;return 1<>>=13,i[2*o+1]=8191&s,s>>>=13;for(o=2*e;o>=26,e+=n/67108864|0,e+=s>>>26,this.words[i]=67108863&s}return 0!==e&&(this.words[i]=e,this.length++),this},s.prototype.muln=function(t){return this.clone().imuln(t)},s.prototype.sqr=function(){return this.mul(this)},s.prototype.isqr=function(){return this.imul(this.clone())},s.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),i=0;i>>n}return e}(t);if(0===e.length)return new s(1);for(var i=this,r=0;r=0);var e,i=t%26,n=(t-i)/26,s=67108863>>>26-i<<26-i;if(0!==i){var o=0;for(e=0;e>>26-i}o&&(this.words[e]=o,this.length++)}if(0!==n){for(e=this.length-1;e>=0;e--)this.words[e+n]=this.words[e];for(e=0;e=0),n=e?(e-e%26)/26:0;var s=t%26,o=Math.min((t-s)/26,this.length),a=67108863^67108863>>>s<o)for(this.length-=o,u=0;u=0&&(0!==l||u>=n);u--){var c=0|this.words[u];this.words[u]=l<<26-s|c>>>s,l=c&a}return h&&0!==l&&(h.words[h.length++]=l),0===this.length&&(this.words[0]=0,this.length=1),this.strip()},s.prototype.ishrn=function(t,e,i){return r(0===this.negative),this.iushrn(t,e,i)},s.prototype.shln=function(t){return this.clone().ishln(t)},s.prototype.ushln=function(t){return this.clone().iushln(t)},s.prototype.shrn=function(t){return this.clone().ishrn(t)},s.prototype.ushrn=function(t){return this.clone().iushrn(t)},s.prototype.testn=function(t){r("number"==typeof t&&t>=0);var e=t%26,i=(t-e)/26,n=1<=0);var e=t%26,i=(t-e)/26;if(r(0===this.negative,"imaskn works only with positive numbers"),this.length<=i)return this;if(0!==e&&i++,this.length=Math.min(i,this.length),0!==e){var n=67108863^67108863>>>e<=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},s.prototype.isubn=function(t){if(r("number"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e>26)-(h/67108864|0),this.words[n+i]=67108863&s}for(;n>26,this.words[n+i]=67108863&s;if(0===a)return this.strip();for(r(-1===a),a=0,n=0;n>26,this.words[n]=67108863&s;return this.negative=1,this.strip()},s.prototype._wordDiv=function(t,e){var i=(this.length,t.length),r=this.clone(),n=t,o=0|n.words[n.length-1];0!=(i=26-this._countBits(o))&&(n=n.ushln(i),r.iushln(i),o=0|n.words[n.length-1]);var a,h=r.length-n.length;if("mod"!==e){(a=new s(null)).length=h+1,a.words=new Array(a.length);for(var u=0;u=0;c--){var d=67108864*(0|r.words[n.length+c])+(0|r.words[n.length+c-1]);for(d=Math.min(d/o|0,67108863),r._ishlnsubmul(n,d,c);0!==r.negative;)d--,r.negative=0,r._ishlnsubmul(n,1,c),r.isZero()||(r.negative^=1);a&&(a.words[c]=d)}return a&&a.strip(),r.strip(),"div"!==e&&0!==i&&r.iushrn(i),{div:a||null,mod:r}},s.prototype.divmod=function(t,e,i){return r(!t.isZero()),this.isZero()?{div:new s(0),mod:new s(0)}:0!==this.negative&&0===t.negative?(a=this.neg().divmod(t,e),"mod"!==e&&(n=a.div.neg()),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.iadd(t)),{div:n,mod:o}):0===this.negative&&0!==t.negative?(a=this.divmod(t.neg(),e),"mod"!==e&&(n=a.div.neg()),{div:n,mod:a.mod}):0!=(this.negative&t.negative)?(a=this.neg().divmod(t.neg(),e),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.isub(t)),{div:a.div,mod:o}):t.length>this.length||this.cmp(t)<0?{div:new s(0),mod:this}:1===t.length?"div"===e?{div:this.divn(t.words[0]),mod:null}:"mod"===e?{div:null,mod:new s(this.modn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new s(this.modn(t.words[0]))}:this._wordDiv(t,e);var n,o,a},s.prototype.div=function(t){return this.divmod(t,"div",!1).div},s.prototype.mod=function(t){return this.divmod(t,"mod",!1).mod},s.prototype.umod=function(t){return this.divmod(t,"mod",!0).mod},s.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var i=0!==e.div.negative?e.mod.isub(t):e.mod,r=t.ushrn(1),n=t.andln(1),s=i.cmp(r);return s<0||1===n&&0===s?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},s.prototype.modn=function(t){r(t<=67108863);for(var e=(1<<26)%t,i=0,n=this.length-1;n>=0;n--)i=(e*i+(0|this.words[n]))%t;return i},s.prototype.idivn=function(t){r(t<=67108863);for(var e=0,i=this.length-1;i>=0;i--){var n=(0|this.words[i])+67108864*e;this.words[i]=n/t|0,e=n%t}return this.strip()},s.prototype.divn=function(t){return this.clone().idivn(t)},s.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n=new s(1),o=new s(0),a=new s(0),h=new s(1),u=0;e.isEven()&&i.isEven();)e.iushrn(1),i.iushrn(1),++u;for(var l=i.clone(),c=e.clone();!e.isZero();){for(var d=0,f=1;0==(e.words[0]&f)&&d<26;++d,f<<=1);if(d>0)for(e.iushrn(d);d-- >0;)(n.isOdd()||o.isOdd())&&(n.iadd(l),o.isub(c)),n.iushrn(1),o.iushrn(1);for(var p=0,m=1;0==(i.words[0]&m)&&p<26;++p,m<<=1);if(p>0)for(i.iushrn(p);p-- >0;)(a.isOdd()||h.isOdd())&&(a.iadd(l),h.isub(c)),a.iushrn(1),h.iushrn(1);e.cmp(i)>=0?(e.isub(i),n.isub(a),o.isub(h)):(i.isub(e),a.isub(n),h.isub(o))}return{a,b:h,gcd:i.iushln(u)}},s.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n,o=new s(1),a=new s(0),h=i.clone();e.cmpn(1)>0&&i.cmpn(1)>0;){for(var u=0,l=1;0==(e.words[0]&l)&&u<26;++u,l<<=1);if(u>0)for(e.iushrn(u);u-- >0;)o.isOdd()&&o.iadd(h),o.iushrn(1);for(var c=0,d=1;0==(i.words[0]&d)&&c<26;++c,d<<=1);if(c>0)for(i.iushrn(c);c-- >0;)a.isOdd()&&a.iadd(h),a.iushrn(1);e.cmp(i)>=0?(e.isub(i),o.isub(a)):(i.isub(e),a.isub(o))}return(n=0===e.cmpn(1)?o:a).cmpn(0)<0&&n.iadd(t),n},s.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),i=t.clone();e.negative=0,i.negative=0;for(var r=0;e.isEven()&&i.isEven();r++)e.iushrn(1),i.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;i.isEven();)i.iushrn(1);var n=e.cmp(i);if(n<0){var s=e;e=i,i=s}else if(0===n||0===i.cmpn(1))break;e.isub(i)}return i.iushln(r)},s.prototype.invm=function(t){return this.egcd(t).a.umod(t)},s.prototype.isEven=function(){return 0==(1&this.words[0])},s.prototype.isOdd=function(){return 1==(1&this.words[0])},s.prototype.andln=function(t){return this.words[0]&t},s.prototype.bincn=function(t){r("number"==typeof t);var e=t%26,i=(t-e)/26,n=1<>>26,a&=67108863,this.words[o]=a}return 0!==s&&(this.words[o]=s,this.length++),this},s.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},s.prototype.cmpn=function(t){var e,i=t<0;if(0!==this.negative&&!i)return-1;if(0===this.negative&&i)return 1;if(this.strip(),this.length>1)e=1;else{i&&(t=-t),r(t<=67108863,"Number is too big");var n=0|this.words[0];e=n===t?0:nt.length)return 1;if(this.length=0;i--){var r=0|this.words[i],n=0|t.words[i];if(r!==n){rn&&(e=1);break}}return e},s.prototype.gtn=function(t){return 1===this.cmpn(t)},s.prototype.gt=function(t){return 1===this.cmp(t)},s.prototype.gten=function(t){return this.cmpn(t)>=0},s.prototype.gte=function(t){return this.cmp(t)>=0},s.prototype.ltn=function(t){return-1===this.cmpn(t)},s.prototype.lt=function(t){return-1===this.cmp(t)},s.prototype.lten=function(t){return this.cmpn(t)<=0},s.prototype.lte=function(t){return this.cmp(t)<=0},s.prototype.eqn=function(t){return 0===this.cmpn(t)},s.prototype.eq=function(t){return 0===this.cmp(t)},s.red=function(t){return new k(t)},s.prototype.toRed=function(t){return r(!this.red,"Already a number in reduction context"),r(0===this.negative,"red works only with positives"),t.convertTo(this)._forceRed(t)},s.prototype.fromRed=function(){return r(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},s.prototype._forceRed=function(t){return this.red=t,this},s.prototype.forceRed=function(t){return r(!this.red,"Already a number in reduction context"),this._forceRed(t)},s.prototype.redAdd=function(t){return r(this.red,"redAdd works only with red numbers"),this.red.add(this,t)},s.prototype.redIAdd=function(t){return r(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,t)},s.prototype.redSub=function(t){return r(this.red,"redSub works only with red numbers"),this.red.sub(this,t)},s.prototype.redISub=function(t){return r(this.red,"redISub works only with red numbers"),this.red.isub(this,t)},s.prototype.redShl=function(t){return r(this.red,"redShl works only with red numbers"),this.red.shl(this,t)},s.prototype.redMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.mul(this,t)},s.prototype.redIMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.imul(this,t)},s.prototype.redSqr=function(){return r(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},s.prototype.redISqr=function(){return r(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},s.prototype.redSqrt=function(){return r(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},s.prototype.redInvm=function(){return r(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},s.prototype.redNeg=function(){return r(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},s.prototype.redPow=function(t){return r(this.red&&!t.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,t)};var b={k256:null,p224:null,p192:null,p25519:null};function v(t,e){this.name=t,this.p=new s(e,16),this.n=this.p.bitLength(),this.k=new s(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function y(){v.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function w(){v.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function _(){v.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function M(){v.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function k(t){if("string"==typeof t){var e=s._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),"modulus must be greater than 1"),this.m=t,this.prime=null}function x(t){k.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new s(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}v.prototype._tmp=function(){var t=new s(null);return t.words=new Array(Math.ceil(this.n/13)),t},v.prototype.ireduce=function(t){var e,i=t;do{this.split(i,this.tmp),e=(i=(i=this.imulK(i)).iadd(this.tmp)).bitLength()}while(e>this.n);var r=e0?i.isub(this.p):void 0!==i.strip?i.strip():i._strip(),i},v.prototype.split=function(t,e){t.iushrn(this.n,0,e)},v.prototype.imulK=function(t){return t.imul(this.k)},n(y,v),y.prototype.split=function(t,e){for(var i=4194303,r=Math.min(t.length,9),n=0;n>>22,s=o}s>>>=22,t.words[n-10]=s,0===s&&t.length>10?t.length-=10:t.length-=9},y.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,i=0;i>>=26,t.words[i]=n,e=r}return 0!==e&&(t.words[t.length++]=e),t},s._prime=function(t){if(b[t])return b[t];var e;if("k256"===t)e=new y;else if("p224"===t)e=new w;else if("p192"===t)e=new _;else{if("p25519"!==t)throw new Error("Unknown prime "+t);e=new M}return b[t]=e,e},k.prototype._verify1=function(t){r(0===t.negative,"red works only with positives"),r(t.red,"red works only with red numbers")},k.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),"red works only with positives"),r(t.red&&t.red===e.red,"red works only with red numbers")},k.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):t.umod(this.m)._forceRed(this)},k.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},k.prototype.add=function(t,e){this._verify2(t,e);var i=t.add(e);return i.cmp(this.m)>=0&&i.isub(this.m),i._forceRed(this)},k.prototype.iadd=function(t,e){this._verify2(t,e);var i=t.iadd(e);return i.cmp(this.m)>=0&&i.isub(this.m),i},k.prototype.sub=function(t,e){this._verify2(t,e);var i=t.sub(e);return i.cmpn(0)<0&&i.iadd(this.m),i._forceRed(this)},k.prototype.isub=function(t,e){this._verify2(t,e);var i=t.isub(e);return i.cmpn(0)<0&&i.iadd(this.m),i},k.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},k.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},k.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},k.prototype.isqr=function(t){return this.imul(t,t.clone())},k.prototype.sqr=function(t){return this.mul(t,t)},k.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var i=this.m.add(new s(1)).iushrn(2);return this.pow(t,i)}for(var n=this.m.subn(1),o=0;!n.isZero()&&0===n.andln(1);)o++,n.iushrn(1);r(!n.isZero());var a=new s(1).toRed(this),h=a.redNeg(),u=this.m.subn(1).iushrn(1),l=this.m.bitLength();for(l=new s(2*l*l).toRed(this);0!==this.pow(l,u).cmp(h);)l.redIAdd(h);for(var c=this.pow(l,n),d=this.pow(t,n.addn(1).iushrn(1)),f=this.pow(t,n),p=o;0!==f.cmp(a);){for(var m=f,g=0;0!==m.cmp(a);g++)m=m.redSqr();r(g=0;r--){for(var u=e.words[r],l=h-1;l>=0;l--){var c=u>>l&1;n!==i[0]&&(n=this.sqr(n)),0!==c||0!==o?(o<<=1,o|=c,(4==++a||0===r&&0===l)&&(n=this.mul(n,i[o]),a=0,o=0)):a=0}h=26}return n},k.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},k.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},s.mont=function(t){return new x(t)},n(x,k),x.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},x.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},x.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var i=t.imul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),s=n;return n.cmp(this.m)>=0?s=n.isub(this.m):n.cmpn(0)<0&&(s=n.iadd(this.m)),s._forceRed(this)},x.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new s(0)._forceRed(this);var i=t.mul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),o=n;return n.cmp(this.m)>=0?o=n.isub(this.m):n.cmpn(0)<0&&(o=n.iadd(this.m)),o._forceRed(this)},x.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(t=i.nmd(t),this)},3482:(t,e,i)=>{"use strict";var r=i(5717),n=i(2318),s=i(9785),o=i(9072),a=i(1027);function h(t){a.call(this,"digest"),this._hash=t}r(h,a),h.prototype._update=function(t){this._hash.update(t)},h.prototype._final=function(){return this._hash.digest()},t.exports=function(t){return"md5"===(t=t.toLowerCase())?new n:"rmd160"===t||"ripemd160"===t?new s:new h(o(t))}},8028:(t,e,i)=>{var r=i(2318);t.exports=function(t){return(new r).update(t).digest()}},8355:(t,e,i)=>{"use strict";var r=i(5717),n=i(1031),s=i(1027),o=i(9509).Buffer,a=i(8028),h=i(9785),u=i(9072),l=o.alloc(128);function c(t,e){s.call(this,"digest"),"string"==typeof e&&(e=o.from(e));var i="sha512"===t||"sha384"===t?128:64;this._alg=t,this._key=e,e.length>i?e=("rmd160"===t?new h:u(t)).update(e).digest():e.length{"use strict";var r=i(5717),n=i(9509).Buffer,s=i(1027),o=n.alloc(128),a=64;function h(t,e){s.call(this,"digest"),"string"==typeof e&&(e=n.from(e)),this._alg=t,this._key=e,e.length>a?e=t(e):e.length{var r=i(8764).Buffer;const n=i(5799),s=i(9e3),o=i(3786),a=i(6470),h=i(452),u=i(970),l=i(1351),c=i(5673),d=i(778),f=i(4595),p=i(4375),m=i(4159),g=i(8473),b=i(2528);function v(t,e,i){if("undefined"!=typeof FileList&&t instanceof FileList&&(t=Array.from(t)),Array.isArray(t)||(t=[t]),0===t.length)throw new Error("invalid input type");t.forEach((t=>{if(null==t)throw new Error(`invalid input type: ${t}`)})),1!==(t=t.map((t=>_(t)&&"string"==typeof t.path&&"function"==typeof b?t.path:t))).length||"string"==typeof t[0]||t[0].name||(t[0].name=e.name);let n=null;t.forEach(((e,i)=>{if("string"==typeof e)return;let r=e.fullPath||e.name;r||(r=`Unknown File ${i+1}`,e.unknownName=!0),e.path=r.split("/"),e.path[0]||e.path.shift(),e.path.length<2?n=null:0===i&&t.length>1?n=e.path[0]:e.path[0]!==n&&(n=null)})),(void 0===e.filterJunkFiles||e.filterJunkFiles)&&(t=t.filter((t=>"string"==typeof t||!y(t.path)))),n&&t.forEach((t=>{const e=(r.isBuffer(t)||M(t))&&!t.path;"string"==typeof t||e||t.path.shift()})),!e.name&&n&&(e.name=n),e.name||t.some((t=>"string"==typeof t?(e.name=a.basename(t),!0):!t.unknownName&&(e.name=t.path[t.path.length-1],!0))),e.name||(e.name=`Unnamed Torrent ${Date.now()}`);const s=t.reduce(((t,e)=>t+Number("string"==typeof e)),0);let o=1===t.length;if(1===t.length&&"string"==typeof t[0]){if("function"!=typeof b)throw new Error("filesystem paths do not work in the browser");u(t[0],((t,e)=>{if(t)return i(t);o=e,l()}))}else p(l);function l(){f(t.map((t=>e=>{const i={};if(_(t))i.getStream=function(t){return()=>new h(t)}(t),i.length=t.size;else if(r.isBuffer(t))i.getStream=(n=t,()=>{const t=new g.PassThrough;return t.end(n),t}),i.length=t.length;else{if(!M(t)){if("string"==typeof t){if("function"!=typeof b)throw new Error("filesystem paths do not work in the browser");return void b(t,s>1||o,e)}throw new Error("invalid input type")}i.getStream=function(t,e){return()=>{const i=new g.Transform;return i._transform=function(t,i,r){e.length+=t.length,this.push(t),r()},t.pipe(i),i}}(t,i),i.length=0}var n;i.path=t.path,e(null,i)})),((t,e)=>{if(t)return i(t);e=e.flat(),i(null,e,o)}))}}function y(t){const e=t[t.length-1];return"."===e[0]&&l.is(e)}function w(t,e){return t+e.length}function _(t){return"undefined"!=typeof Blob&&t instanceof Blob}function M(t){return"object"==typeof t&&null!=t&&"function"==typeof t.pipe}t.exports=function(e,i,a){"function"==typeof i&&([i,a]=[a,i]),v(e,i=i?Object.assign({},i):{},((e,h,u)=>{if(e)return a(e);i.singleFileTorrent=u,function(e,i,a){let h=i.announceList;h||("string"==typeof i.announce?h=[[i.announce]]:Array.isArray(i.announce)&&(h=i.announce.map((t=>[t])))),h||(h=[]),globalThis.WEBTORRENT_ANNOUNCE&&("string"==typeof globalThis.WEBTORRENT_ANNOUNCE?h.push([[globalThis.WEBTORRENT_ANNOUNCE]]):Array.isArray(globalThis.WEBTORRENT_ANNOUNCE)&&(h=h.concat(globalThis.WEBTORRENT_ANNOUNCE.map((t=>[t]))))),void 0===i.announce&&void 0===i.announceList&&(h=h.concat(t.exports.announceList)),"string"==typeof i.urlList&&(i.urlList=[i.urlList]);const u={info:{name:i.name},"creation date":Math.ceil((Number(i.creationDate)||Date.now())/1e3),encoding:"UTF-8"};0!==h.length&&(u.announce=h[0][0],u["announce-list"]=h),void 0!==i.comment&&(u.comment=i.comment),void 0!==i.createdBy&&(u["created by"]=i.createdBy),void 0!==i.private&&(u.info.private=Number(i.private)),void 0!==i.info&&Object.assign(u.info,i.info),void 0!==i.sslCert&&(u.info["ssl-cert"]=i.sslCert),void 0!==i.urlList&&(u["url-list"]=i.urlList);const l=e.reduce(w,0),f=i.pieceLength||o(l);u.info["piece length"]=f,function(t,e,i,n,o){o=d(o);const a=[];let h=0,u=0;const l=t.map((t=>t.getStream));let f=0,p=0,g=!1;const b=new c(l),v=new s(e,{zeroPadding:!1});function y(t){h+=t.length;const e=p;m(t,(r=>{a[e]=r,f-=1,f<5&&v.resume(),u+=t.length,n.onProgress&&n.onProgress(u,i),k()})),f+=1,f>=5&&v.pause(),p+=1}function w(){g=!0,k()}function _(t){M(),o(t)}function M(){b.removeListener("error",_),v.removeListener("data",y),v.removeListener("end",w),v.removeListener("error",_)}function k(){g&&0===f&&(M(),o(null,r.from(a.join(""),"hex"),h))}b.on("error",_),b.pipe(v).on("data",y).on("end",w).on("error",_)}(e,f,l,i,((t,r,s)=>{if(t)return a(t);u.info.pieces=r,e.forEach((t=>{delete t.getStream})),i.singleFileTorrent?u.info.length=s:u.info.files=e,a(null,n.encode(u))}))}(h,i,a)}))},t.exports.parseInput=function(t,e,i){"function"==typeof e&&([e,i]=[i,e]),v(t,e=e?Object.assign({},e):{},i)},t.exports.announceList=[["udp://tracker.leechers-paradise.org:6969"],["udp://tracker.coppersurfer.tk:6969"],["udp://tracker.opentrackr.org:1337"],["udp://explodie.org:6969"],["udp://tracker.empire-js.us:1337"],["wss://tracker.btorrent.xyz"],["wss://tracker.openwebtorrent.com"]],t.exports.isJunkPath=y},5835:(t,e,i)=>{"use strict";e.randomBytes=e.rng=e.pseudoRandomBytes=e.prng=i(1798),e.createHash=e.Hash=i(3482),e.createHmac=e.Hmac=i(8355);var r=i(6042),n=Object.keys(r),s=["sha1","sha224","sha256","sha384","sha512","md5","rmd160"].concat(n);e.getHashes=function(){return s};var o=i(5632);e.pbkdf2=o.pbkdf2,e.pbkdf2Sync=o.pbkdf2Sync;var a=i(3614);e.Cipher=a.Cipher,e.createCipher=a.createCipher,e.Cipheriv=a.Cipheriv,e.createCipheriv=a.createCipheriv,e.Decipher=a.Decipher,e.createDecipher=a.createDecipher,e.Decipheriv=a.Decipheriv,e.createDecipheriv=a.createDecipheriv,e.getCiphers=a.getCiphers,e.listCiphers=a.listCiphers;var h=i(2607);e.DiffieHellmanGroup=h.DiffieHellmanGroup,e.createDiffieHellmanGroup=h.createDiffieHellmanGroup,e.getDiffieHellman=h.getDiffieHellman,e.createDiffieHellman=h.createDiffieHellman,e.DiffieHellman=h.DiffieHellman;var u=i(4743);e.createSign=u.createSign,e.Sign=u.Sign,e.createVerify=u.createVerify,e.Verify=u.Verify,e.createECDH=i(6393);var l=i(7900);e.publicEncrypt=l.publicEncrypt,e.privateEncrypt=l.privateEncrypt,e.publicDecrypt=l.publicDecrypt,e.privateDecrypt=l.privateDecrypt;var c=i(7963);e.randomFill=c.randomFill,e.randomFillSync=c.randomFillSync,e.createCredentials=function(){throw new Error(["sorry, createCredentials is not implemented yet","we accept pull requests","https://github.com/crypto-browserify/crypto-browserify"].join("\n"))},e.constants={DH_CHECK_P_NOT_SAFE_PRIME:2,DH_CHECK_P_NOT_PRIME:1,DH_UNABLE_TO_CHECK_GENERATOR:4,DH_NOT_SUITABLE_GENERATOR:8,NPN_ENABLED:1,ALPN_ENABLED:1,RSA_PKCS1_PADDING:1,RSA_SSLV23_PADDING:2,RSA_NO_PADDING:3,RSA_PKCS1_OAEP_PADDING:4,RSA_X931_PADDING:5,RSA_PKCS1_PSS_PADDING:6,POINT_CONVERSION_COMPRESSED:2,POINT_CONVERSION_UNCOMPRESSED:4,POINT_CONVERSION_HYBRID:6}},1227:(t,e,i)=>{var r=i(5108),n=i(9590);e.formatArgs=function(e){if(e[0]=(this.useColors?"%c":"")+this.namespace+(this.useColors?" %c":" ")+e[0]+(this.useColors?"%c ":" ")+"+"+t.exports.humanize(this.diff),!this.useColors)return;const i="color: "+this.color;e.splice(1,0,i,"color: inherit");let r=0,n=0;e[0].replace(/%[a-zA-Z%]/g,(t=>{"%%"!==t&&(r++,"%c"===t&&(n=r))})),e.splice(n,0,i)},e.save=function(t){try{t?e.storage.setItem("debug",t):e.storage.removeItem("debug")}catch(t){}},e.load=function(){let t;try{t=e.storage.getItem("debug")}catch(t){}return!t&&void 0!==n&&"env"in n&&(t=n.env.DEBUG),t},e.useColors=function(){return!("undefined"==typeof window||!window.process||"renderer"!==window.process.type&&!window.process.__nwjs)||("undefined"==typeof navigator||!navigator.userAgent||!navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/))&&("undefined"!=typeof document&&document.documentElement&&document.documentElement.style&&document.documentElement.style.WebkitAppearance||"undefined"!=typeof window&&window.console&&(window.console.firebug||window.console.exception&&window.console.table)||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/)&&parseInt(RegExp.$1,10)>=31||"undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/))},e.storage=function(){try{return localStorage}catch(t){}}(),e.destroy=(()=>{let t=!1;return()=>{t||(t=!0,r.warn("Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`."))}})(),e.colors=["#0000CC","#0000FF","#0033CC","#0033FF","#0066CC","#0066FF","#0099CC","#0099FF","#00CC00","#00CC33","#00CC66","#00CC99","#00CCCC","#00CCFF","#3300CC","#3300FF","#3333CC","#3333FF","#3366CC","#3366FF","#3399CC","#3399FF","#33CC00","#33CC33","#33CC66","#33CC99","#33CCCC","#33CCFF","#6600CC","#6600FF","#6633CC","#6633FF","#66CC00","#66CC33","#9900CC","#9900FF","#9933CC","#9933FF","#99CC00","#99CC33","#CC0000","#CC0033","#CC0066","#CC0099","#CC00CC","#CC00FF","#CC3300","#CC3333","#CC3366","#CC3399","#CC33CC","#CC33FF","#CC6600","#CC6633","#CC9900","#CC9933","#CCCC00","#CCCC33","#FF0000","#FF0033","#FF0066","#FF0099","#FF00CC","#FF00FF","#FF3300","#FF3333","#FF3366","#FF3399","#FF33CC","#FF33FF","#FF6600","#FF6633","#FF9900","#FF9933","#FFCC00","#FFCC33"],e.log=r.debug||r.log||(()=>{}),t.exports=i(2447)(e);const{formatters:s}=t.exports;s.j=function(t){try{return JSON.stringify(t)}catch(t){return"[UnexpectedJSONParseError]: "+t.message}}},2447:(t,e,i)=>{var r=i(5108);t.exports=function(t){function e(t){let i,r,s,o=null;function a(...t){if(!a.enabled)return;const r=a,n=Number(new Date),s=n-(i||n);r.diff=s,r.prev=i,r.curr=n,i=n,t[0]=e.coerce(t[0]),"string"!=typeof t[0]&&t.unshift("%O");let o=0;t[0]=t[0].replace(/%([a-zA-Z%])/g,((i,n)=>{if("%%"===i)return"%";o++;const s=e.formatters[n];if("function"==typeof s){const e=t[o];i=s.call(r,e),t.splice(o,1),o--}return i})),e.formatArgs.call(r,t),(r.log||e.log).apply(r,t)}return a.namespace=t,a.useColors=e.useColors(),a.color=e.selectColor(t),a.extend=n,a.destroy=e.destroy,Object.defineProperty(a,"enabled",{enumerable:!0,configurable:!1,get:()=>null!==o?o:(r!==e.namespaces&&(r=e.namespaces,s=e.enabled(t)),s),set:t=>{o=t}}),"function"==typeof e.init&&e.init(a),a}function n(t,i){const r=e(this.namespace+(void 0===i?":":i)+t);return r.log=this.log,r}function s(t){return t.toString().substring(2,t.toString().length-2).replace(/\.\*\?$/,"*")}return e.debug=e,e.default=e,e.coerce=function(t){return t instanceof Error?t.stack||t.message:t},e.disable=function(){const t=[...e.names.map(s),...e.skips.map(s).map((t=>"-"+t))].join(",");return e.enable(""),t},e.enable=function(t){let i;e.save(t),e.namespaces=t,e.names=[],e.skips=[];const r=("string"==typeof t?t:"").split(/[\s,]+/),n=r.length;for(i=0;i{e[i]=t[i]})),e.names=[],e.skips=[],e.formatters={},e.selectColor=function(t){let i=0;for(let e=0;e{"use strict";var r=i(2215),n="function"==typeof Symbol&&"symbol"==typeof Symbol("foo"),s=Object.prototype.toString,o=Array.prototype.concat,a=Object.defineProperty,h=a&&function(){var t={};try{for(var e in a(t,"x",{enumerable:!1,value:t}),t)return!1;return t.x===t}catch(t){return!1}}(),u=function(t,e,i,r){var n;(!(e in t)||"function"==typeof(n=r)&&"[object Function]"===s.call(n)&&r())&&(h?a(t,e,{configurable:!0,enumerable:!1,value:i,writable:!0}):t[e]=i)},l=function(t,e){var i=arguments.length>2?arguments[2]:{},s=r(e);n&&(s=o.call(s,Object.getOwnPropertySymbols(e)));for(var a=0;a{"use strict";e.utils=i(1278),e.Cipher=i(5756),e.DES=i(327),e.CBC=i(9051),e.EDE=i(651)},9051:(t,e,i)=>{"use strict";var r=i(9746),n=i(5717),s={};function o(t){r.equal(t.length,8,"Invalid IV length"),this.iv=new Array(8);for(var e=0;e{"use strict";var r=i(9746);function n(t){this.options=t,this.type=this.options.type,this.blockSize=8,this._init(),this.buffer=new Array(this.blockSize),this.bufferOff=0}t.exports=n,n.prototype._init=function(){},n.prototype.update=function(t){return 0===t.length?[]:"decrypt"===this.type?this._updateDecrypt(t):this._updateEncrypt(t)},n.prototype._buffer=function(t,e){for(var i=Math.min(this.buffer.length-this.bufferOff,t.length-e),r=0;r0;r--)e+=this._buffer(t,e),i+=this._flushBuffer(n,i);return e+=this._buffer(t,e),n},n.prototype.final=function(t){var e,i;return t&&(e=this.update(t)),i="encrypt"===this.type?this._finalEncrypt():this._finalDecrypt(),e?e.concat(i):i},n.prototype._pad=function(t,e){if(0===e)return!1;for(;e{"use strict";var r=i(9746),n=i(5717),s=i(1278),o=i(5756);function a(){this.tmp=new Array(2),this.keys=null}function h(t){o.call(this,t);var e=new a;this._desState=e,this.deriveKeys(e,t.key)}n(h,o),t.exports=h,h.create=function(t){return new h(t)};var u=[1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1];h.prototype.deriveKeys=function(t,e){t.keys=new Array(32),r.equal(e.length,this.blockSize,"Invalid key length");var i=s.readUInt32BE(e,0),n=s.readUInt32BE(e,4);s.pc1(i,n,t.tmp,0),i=t.tmp[0],n=t.tmp[1];for(var o=0;o>>1];i=s.r28shl(i,a),n=s.r28shl(n,a),s.pc2(i,n,t.keys,o)}},h.prototype._update=function(t,e,i,r){var n=this._desState,o=s.readUInt32BE(t,e),a=s.readUInt32BE(t,e+4);s.ip(o,a,n.tmp,0),o=n.tmp[0],a=n.tmp[1],"encrypt"===this.type?this._encrypt(n,o,a,n.tmp,0):this._decrypt(n,o,a,n.tmp,0),o=n.tmp[0],a=n.tmp[1],s.writeUInt32BE(i,o,r),s.writeUInt32BE(i,a,r+4)},h.prototype._pad=function(t,e){for(var i=t.length-e,r=e;r>>0,o=d}s.rip(a,o,r,n)},h.prototype._decrypt=function(t,e,i,r,n){for(var o=i,a=e,h=t.keys.length-2;h>=0;h-=2){var u=t.keys[h],l=t.keys[h+1];s.expand(o,t.tmp,0),u^=t.tmp[0],l^=t.tmp[1];var c=s.substitute(u,l),d=o;o=(a^s.permute(c))>>>0,a=d}s.rip(o,a,r,n)}},651:(t,e,i)=>{"use strict";var r=i(9746),n=i(5717),s=i(5756),o=i(327);function a(t,e){r.equal(e.length,24,"Invalid key length");var i=e.slice(0,8),n=e.slice(8,16),s=e.slice(16,24);this.ciphers="encrypt"===t?[o.create({type:"encrypt",key:i}),o.create({type:"decrypt",key:n}),o.create({type:"encrypt",key:s})]:[o.create({type:"decrypt",key:s}),o.create({type:"encrypt",key:n}),o.create({type:"decrypt",key:i})]}function h(t){s.call(this,t);var e=new a(this.type,this.options.key);this._edeState=e}n(h,s),t.exports=h,h.create=function(t){return new h(t)},h.prototype._update=function(t,e,i,r){var n=this._edeState;n.ciphers[0]._update(t,e,i,r),n.ciphers[1]._update(i,r,i,r),n.ciphers[2]._update(i,r,i,r)},h.prototype._pad=o.prototype._pad,h.prototype._unpad=o.prototype._unpad},1278:(t,e)=>{"use strict";e.readUInt32BE=function(t,e){return(t[0+e]<<24|t[1+e]<<16|t[2+e]<<8|t[3+e])>>>0},e.writeUInt32BE=function(t,e,i){t[0+i]=e>>>24,t[1+i]=e>>>16&255,t[2+i]=e>>>8&255,t[3+i]=255&e},e.ip=function(t,e,i,r){for(var n=0,s=0,o=6;o>=0;o-=2){for(var a=0;a<=24;a+=8)n<<=1,n|=e>>>a+o&1;for(a=0;a<=24;a+=8)n<<=1,n|=t>>>a+o&1}for(o=6;o>=0;o-=2){for(a=1;a<=25;a+=8)s<<=1,s|=e>>>a+o&1;for(a=1;a<=25;a+=8)s<<=1,s|=t>>>a+o&1}i[r+0]=n>>>0,i[r+1]=s>>>0},e.rip=function(t,e,i,r){for(var n=0,s=0,o=0;o<4;o++)for(var a=24;a>=0;a-=8)n<<=1,n|=e>>>a+o&1,n<<=1,n|=t>>>a+o&1;for(o=4;o<8;o++)for(a=24;a>=0;a-=8)s<<=1,s|=e>>>a+o&1,s<<=1,s|=t>>>a+o&1;i[r+0]=n>>>0,i[r+1]=s>>>0},e.pc1=function(t,e,i,r){for(var n=0,s=0,o=7;o>=5;o--){for(var a=0;a<=24;a+=8)n<<=1,n|=e>>a+o&1;for(a=0;a<=24;a+=8)n<<=1,n|=t>>a+o&1}for(a=0;a<=24;a+=8)n<<=1,n|=e>>a+o&1;for(o=1;o<=3;o++){for(a=0;a<=24;a+=8)s<<=1,s|=e>>a+o&1;for(a=0;a<=24;a+=8)s<<=1,s|=t>>a+o&1}for(a=0;a<=24;a+=8)s<<=1,s|=t>>a+o&1;i[r+0]=n>>>0,i[r+1]=s>>>0},e.r28shl=function(t,e){return t<>>28-e};var i=[14,11,17,4,27,23,25,0,13,22,7,18,5,9,16,24,2,20,12,21,1,8,15,26,15,4,25,19,9,1,26,16,5,11,23,8,12,7,17,0,22,3,10,14,6,20,27,24];e.pc2=function(t,e,r,n){for(var s=0,o=0,a=i.length>>>1,h=0;h>>i[h]&1;for(h=a;h>>i[h]&1;r[n+0]=s>>>0,r[n+1]=o>>>0},e.expand=function(t,e,i){var r=0,n=0;r=(1&t)<<5|t>>>27;for(var s=23;s>=15;s-=4)r<<=6,r|=t>>>s&63;for(s=11;s>=3;s-=4)n|=t>>>s&63,n<<=6;n|=(31&t)<<1|t>>>31,e[i+0]=r>>>0,e[i+1]=n>>>0};var r=[14,0,4,15,13,7,1,4,2,14,15,2,11,13,8,1,3,10,10,6,6,12,12,11,5,9,9,5,0,3,7,8,4,15,1,12,14,8,8,2,13,4,6,9,2,1,11,7,15,5,12,11,9,3,7,14,3,10,10,0,5,6,0,13,15,3,1,13,8,4,14,7,6,15,11,2,3,8,4,14,9,12,7,0,2,1,13,10,12,6,0,9,5,11,10,5,0,13,14,8,7,10,11,1,10,3,4,15,13,4,1,2,5,11,8,6,12,7,6,12,9,0,3,5,2,14,15,9,10,13,0,7,9,0,14,9,6,3,3,4,15,6,5,10,1,2,13,8,12,5,7,14,11,12,4,11,2,15,8,1,13,1,6,10,4,13,9,0,8,6,15,9,3,8,0,7,11,4,1,15,2,14,12,3,5,11,10,5,14,2,7,12,7,13,13,8,14,11,3,5,0,6,6,15,9,0,10,3,1,4,2,7,8,2,5,12,11,1,12,10,4,14,15,9,10,3,6,15,9,0,0,6,12,10,11,1,7,13,13,8,15,9,1,4,3,5,14,11,5,12,2,7,8,2,4,14,2,14,12,11,4,2,1,12,7,4,10,7,11,13,6,1,8,5,5,0,3,15,15,10,13,3,0,9,14,8,9,6,4,11,2,8,1,12,11,7,10,1,13,14,7,2,8,13,15,6,9,15,12,0,5,9,6,10,3,4,0,5,14,3,12,10,1,15,10,4,15,2,9,7,2,12,6,9,8,5,0,6,13,1,3,13,4,14,14,0,7,11,5,3,11,8,9,4,14,3,15,2,5,12,2,9,8,5,12,15,3,10,7,11,0,14,4,1,10,7,1,6,13,0,11,8,6,13,4,13,11,0,2,11,14,7,15,4,0,9,8,1,13,10,3,14,12,3,9,5,7,12,5,2,10,15,6,8,1,6,1,6,4,11,11,13,13,8,12,1,3,4,7,10,14,7,10,9,15,5,6,0,8,15,0,14,5,2,9,3,2,12,13,1,2,15,8,13,4,8,6,10,15,3,11,7,1,4,10,12,9,5,3,6,14,11,5,0,0,14,12,9,7,2,7,2,11,1,4,14,1,7,9,4,12,10,14,8,2,13,0,15,6,12,10,9,13,0,15,3,3,5,5,6,8,11];e.substitute=function(t,e){for(var i=0,n=0;n<4;n++)i<<=4,i|=r[64*n+(t>>>18-6*n&63)];for(n=0;n<4;n++)i<<=4,i|=r[256+64*n+(e>>>18-6*n&63)];return i>>>0};var n=[16,25,12,11,3,20,4,15,31,17,9,6,27,14,1,22,30,24,8,18,0,5,29,23,13,19,2,26,10,21,28,7];e.permute=function(t){for(var e=0,i=0;i>>n[i]&1;return e>>>0},e.padSplit=function(t,e,i){for(var r=t.toString(2);r.length{var r=i(8764).Buffer,n=i(3590),s=i(9799),o=i(7426),a={binary:!0,hex:!0,base64:!0};e.DiffieHellmanGroup=e.createDiffieHellmanGroup=e.getDiffieHellman=function(t){var e=new r(s[t].prime,"hex"),i=new r(s[t].gen,"hex");return new o(e,i)},e.createDiffieHellman=e.DiffieHellman=function t(e,i,s,h){return r.isBuffer(i)||void 0===a[i]?t(e,"binary",i,s):(i=i||"binary",h=h||"binary",s=s||new r([2]),r.isBuffer(s)||(s=new r(s,h)),"number"==typeof e?new o(n(e,s),s,!0):(r.isBuffer(e)||(e=new r(e,i)),new o(e,s,!0)))}},7426:(t,e,i)=>{var r=i(8764).Buffer,n=i(3620),s=new(i(3047)),o=new n(24),a=new n(11),h=new n(10),u=new n(3),l=new n(7),c=i(3590),d=i(1798);function f(t,e){return e=e||"utf8",r.isBuffer(t)||(t=new r(t,e)),this._pub=new n(t),this}function p(t,e){return e=e||"utf8",r.isBuffer(t)||(t=new r(t,e)),this._priv=new n(t),this}t.exports=g;var m={};function g(t,e,i){this.setGenerator(e),this.__prime=new n(t),this._prime=n.mont(this.__prime),this._primeLen=t.length,this._pub=void 0,this._priv=void 0,this._primeCode=void 0,i?(this.setPublicKey=f,this.setPrivateKey=p):this._primeCode=8}function b(t,e){var i=new r(t.toArray());return e?i.toString(e):i}Object.defineProperty(g.prototype,"verifyError",{enumerable:!0,get:function(){return"number"!=typeof this._primeCode&&(this._primeCode=function(t,e){var i=e.toString("hex"),r=[i,t.toString(16)].join("_");if(r in m)return m[r];var n,d=0;if(t.isEven()||!c.simpleSieve||!c.fermatTest(t)||!s.test(t))return d+=1,d+="02"===i||"05"===i?8:4,m[r]=d,d;switch(s.test(t.shrn(1))||(d+=2),i){case"02":t.mod(o).cmp(a)&&(d+=8);break;case"05":(n=t.mod(h)).cmp(u)&&n.cmp(l)&&(d+=8);break;default:d+=4}return m[r]=d,d}(this.__prime,this.__gen)),this._primeCode}}),g.prototype.generateKeys=function(){return this._priv||(this._priv=new n(d(this._primeLen))),this._pub=this._gen.toRed(this._prime).redPow(this._priv).fromRed(),this.getPublicKey()},g.prototype.computeSecret=function(t){var e=(t=(t=new n(t)).toRed(this._prime)).redPow(this._priv).fromRed(),i=new r(e.toArray()),s=this.getPrime();if(i.length{var r=i(1798);t.exports=v,v.simpleSieve=g,v.fermatTest=b;var n=i(3620),s=new n(24),o=new(i(3047)),a=new n(1),h=new n(2),u=new n(5),l=(new n(16),new n(8),new n(10)),c=new n(3),d=(new n(7),new n(11)),f=new n(4),p=(new n(12),null);function m(){if(null!==p)return p;var t=[];t[0]=2;for(var e=1,i=3;i<1048576;i+=2){for(var r=Math.ceil(Math.sqrt(i)),n=0;nt;)i.ishrn(1);if(i.isEven()&&i.iadd(a),i.testn(1)||i.iadd(h),e.cmp(h)){if(!e.cmp(u))for(;i.mod(l).cmp(c);)i.iadd(f)}else for(;i.mod(s).cmp(d);)i.iadd(f);if(g(p=i.shrn(1))&&g(i)&&b(p)&&b(i)&&o.test(p)&&o.test(i))return i}}},3620:function(t,e,i){!function(t,e){"use strict";function r(t,e){if(!t)throw new Error(e||"Assertion failed")}function n(t,e){t.super_=e;var i=function(){};i.prototype=e.prototype,t.prototype=new i,t.prototype.constructor=t}function s(t,e,i){if(s.isBN(t))return t;this.negative=0,this.words=null,this.length=0,this.red=null,null!==t&&("le"!==e&&"be"!==e||(i=e,e=10),this._init(t||0,e||10,i||"be"))}var o;"object"==typeof t?t.exports=s:e.BN=s,s.BN=s,s.wordSize=26;try{o="undefined"!=typeof window&&void 0!==window.Buffer?window.Buffer:i(7748).Buffer}catch(t){}function a(t,e){var i=t.charCodeAt(e);return i>=65&&i<=70?i-55:i>=97&&i<=102?i-87:i-48&15}function h(t,e,i){var r=a(t,i);return i-1>=e&&(r|=a(t,i-1)<<4),r}function u(t,e,i,r){for(var n=0,s=Math.min(t.length,i),o=e;o=49?a-49+10:a>=17?a-17+10:a}return n}s.isBN=function(t){return t instanceof s||null!==t&&"object"==typeof t&&t.constructor.wordSize===s.wordSize&&Array.isArray(t.words)},s.max=function(t,e){return t.cmp(e)>0?t:e},s.min=function(t,e){return t.cmp(e)<0?t:e},s.prototype._init=function(t,e,i){if("number"==typeof t)return this._initNumber(t,e,i);if("object"==typeof t)return this._initArray(t,e,i);"hex"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var n=0;"-"===(t=t.toString().replace(/\s+/g,""))[0]&&(n++,this.negative=1),n=0;n-=3)o=t[n]|t[n-1]<<8|t[n-2]<<16,this.words[s]|=o<>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);else if("le"===i)for(n=0,s=0;n>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);return this.strip()},s.prototype._parseHex=function(t,e,i){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var r=0;r=e;r-=2)n=h(t,e,r)<=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;else for(r=(t.length-e)%2==0?e+1:e;r=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;this.strip()},s.prototype._parseBase=function(t,e,i){this.words=[0],this.length=1;for(var r=0,n=1;n<=67108863;n*=e)r++;r--,n=n/e|0;for(var s=t.length-i,o=s%r,a=Math.min(s,s-o)+i,h=0,l=i;l1&&0===this.words[this.length-1];)this.length--;return this._normSign()},s.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},s.prototype.inspect=function(){return(this.red?""};var l=["","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"],c=[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],d=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function f(t,e,i){i.negative=e.negative^t.negative;var r=t.length+e.length|0;i.length=r,r=r-1|0;var n=0|t.words[0],s=0|e.words[0],o=n*s,a=67108863&o,h=o/67108864|0;i.words[0]=a;for(var u=1;u>>26,c=67108863&h,d=Math.min(u,e.length-1),f=Math.max(0,u-t.length+1);f<=d;f++){var p=u-f|0;l+=(o=(n=0|t.words[p])*(s=0|e.words[f])+c)/67108864|0,c=67108863&o}i.words[u]=0|c,h=0|l}return 0!==h?i.words[u]=0|h:i.length--,i.strip()}s.prototype.toString=function(t,e){var i;if(e=0|e||1,16===(t=t||10)||"hex"===t){i="";for(var n=0,s=0,o=0;o>>24-n&16777215)||o!==this.length-1?l[6-h.length]+h+i:h+i,(n+=2)>=26&&(n-=26,o--)}for(0!==s&&(i=s.toString(16)+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}if(t===(0|t)&&t>=2&&t<=36){var u=c[t],f=d[t];i="";var p=this.clone();for(p.negative=0;!p.isZero();){var m=p.modn(f).toString(t);i=(p=p.idivn(f)).isZero()?m+i:l[u-m.length]+m+i}for(this.isZero()&&(i="0"+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}r(!1,"Base should be between 2 and 36")},s.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-t:t},s.prototype.toJSON=function(){return this.toString(16)},s.prototype.toBuffer=function(t,e){return r(void 0!==o),this.toArrayLike(o,t,e)},s.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},s.prototype.toArrayLike=function(t,e,i){var n=this.byteLength(),s=i||Math.max(1,n);r(n<=s,"byte array longer than desired length"),r(s>0,"Requested array length <= 0"),this.strip();var o,a,h="le"===e,u=new t(s),l=this.clone();if(h){for(a=0;!l.isZero();a++)o=l.andln(255),l.iushrn(8),u[a]=o;for(;a=4096&&(i+=13,e>>>=13),e>=64&&(i+=7,e>>>=7),e>=8&&(i+=4,e>>>=4),e>=2&&(i+=2,e>>>=2),i+e},s.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,i=0;return 0==(8191&e)&&(i+=13,e>>>=13),0==(127&e)&&(i+=7,e>>>=7),0==(15&e)&&(i+=4,e>>>=4),0==(3&e)&&(i+=2,e>>>=2),0==(1&e)&&i++,i},s.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},s.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;et.length?this.clone().ior(t):t.clone().ior(this)},s.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},s.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var i=0;it.length?this.clone().iand(t):t.clone().iand(this)},s.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},s.prototype.iuxor=function(t){var e,i;this.length>t.length?(e=this,i=t):(e=t,i=this);for(var r=0;rt.length?this.clone().ixor(t):t.clone().ixor(this)},s.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},s.prototype.inotn=function(t){r("number"==typeof t&&t>=0);var e=0|Math.ceil(t/26),i=t%26;this._expand(e),i>0&&e--;for(var n=0;n0&&(this.words[n]=~this.words[n]&67108863>>26-i),this.strip()},s.prototype.notn=function(t){return this.clone().inotn(t)},s.prototype.setn=function(t,e){r("number"==typeof t&&t>=0);var i=t/26|0,n=t%26;return this._expand(i+1),this.words[i]=e?this.words[i]|1<t.length?(i=this,r=t):(i=t,r=this);for(var n=0,s=0;s>>26;for(;0!==n&&s>>26;if(this.length=i.length,0!==n)this.words[this.length]=n,this.length++;else if(i!==this)for(;st.length?this.clone().iadd(t):t.clone().iadd(this)},s.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var i,r,n=this.cmp(t);if(0===n)return this.negative=0,this.length=1,this.words[0]=0,this;n>0?(i=this,r=t):(i=t,r=this);for(var s=0,o=0;o>26,this.words[o]=67108863&e;for(;0!==s&&o>26,this.words[o]=67108863&e;if(0===s&&o>>13,f=0|o[1],p=8191&f,m=f>>>13,g=0|o[2],b=8191&g,v=g>>>13,y=0|o[3],w=8191&y,_=y>>>13,M=0|o[4],k=8191&M,x=M>>>13,E=0|o[5],S=8191&E,T=E>>>13,A=0|o[6],I=8191&A,C=A>>>13,B=0|o[7],R=8191&B,P=B>>>13,L=0|o[8],O=8191&L,D=L>>>13,N=0|o[9],j=8191&N,U=N>>>13,F=0|a[0],q=8191&F,z=F>>>13,H=0|a[1],W=8191&H,$=H>>>13,Z=0|a[2],V=8191&Z,K=Z>>>13,G=0|a[3],J=8191&G,Y=G>>>13,X=0|a[4],Q=8191&X,tt=X>>>13,et=0|a[5],it=8191&et,rt=et>>>13,nt=0|a[6],st=8191&nt,ot=nt>>>13,at=0|a[7],ht=8191&at,ut=at>>>13,lt=0|a[8],ct=8191<,dt=lt>>>13,ft=0|a[9],pt=8191&ft,mt=ft>>>13;i.negative=t.negative^e.negative,i.length=19;var gt=(u+(r=Math.imul(c,q))|0)+((8191&(n=(n=Math.imul(c,z))+Math.imul(d,q)|0))<<13)|0;u=((s=Math.imul(d,z))+(n>>>13)|0)+(gt>>>26)|0,gt&=67108863,r=Math.imul(p,q),n=(n=Math.imul(p,z))+Math.imul(m,q)|0,s=Math.imul(m,z);var bt=(u+(r=r+Math.imul(c,W)|0)|0)+((8191&(n=(n=n+Math.imul(c,$)|0)+Math.imul(d,W)|0))<<13)|0;u=((s=s+Math.imul(d,$)|0)+(n>>>13)|0)+(bt>>>26)|0,bt&=67108863,r=Math.imul(b,q),n=(n=Math.imul(b,z))+Math.imul(v,q)|0,s=Math.imul(v,z),r=r+Math.imul(p,W)|0,n=(n=n+Math.imul(p,$)|0)+Math.imul(m,W)|0,s=s+Math.imul(m,$)|0;var vt=(u+(r=r+Math.imul(c,V)|0)|0)+((8191&(n=(n=n+Math.imul(c,K)|0)+Math.imul(d,V)|0))<<13)|0;u=((s=s+Math.imul(d,K)|0)+(n>>>13)|0)+(vt>>>26)|0,vt&=67108863,r=Math.imul(w,q),n=(n=Math.imul(w,z))+Math.imul(_,q)|0,s=Math.imul(_,z),r=r+Math.imul(b,W)|0,n=(n=n+Math.imul(b,$)|0)+Math.imul(v,W)|0,s=s+Math.imul(v,$)|0,r=r+Math.imul(p,V)|0,n=(n=n+Math.imul(p,K)|0)+Math.imul(m,V)|0,s=s+Math.imul(m,K)|0;var yt=(u+(r=r+Math.imul(c,J)|0)|0)+((8191&(n=(n=n+Math.imul(c,Y)|0)+Math.imul(d,J)|0))<<13)|0;u=((s=s+Math.imul(d,Y)|0)+(n>>>13)|0)+(yt>>>26)|0,yt&=67108863,r=Math.imul(k,q),n=(n=Math.imul(k,z))+Math.imul(x,q)|0,s=Math.imul(x,z),r=r+Math.imul(w,W)|0,n=(n=n+Math.imul(w,$)|0)+Math.imul(_,W)|0,s=s+Math.imul(_,$)|0,r=r+Math.imul(b,V)|0,n=(n=n+Math.imul(b,K)|0)+Math.imul(v,V)|0,s=s+Math.imul(v,K)|0,r=r+Math.imul(p,J)|0,n=(n=n+Math.imul(p,Y)|0)+Math.imul(m,J)|0,s=s+Math.imul(m,Y)|0;var wt=(u+(r=r+Math.imul(c,Q)|0)|0)+((8191&(n=(n=n+Math.imul(c,tt)|0)+Math.imul(d,Q)|0))<<13)|0;u=((s=s+Math.imul(d,tt)|0)+(n>>>13)|0)+(wt>>>26)|0,wt&=67108863,r=Math.imul(S,q),n=(n=Math.imul(S,z))+Math.imul(T,q)|0,s=Math.imul(T,z),r=r+Math.imul(k,W)|0,n=(n=n+Math.imul(k,$)|0)+Math.imul(x,W)|0,s=s+Math.imul(x,$)|0,r=r+Math.imul(w,V)|0,n=(n=n+Math.imul(w,K)|0)+Math.imul(_,V)|0,s=s+Math.imul(_,K)|0,r=r+Math.imul(b,J)|0,n=(n=n+Math.imul(b,Y)|0)+Math.imul(v,J)|0,s=s+Math.imul(v,Y)|0,r=r+Math.imul(p,Q)|0,n=(n=n+Math.imul(p,tt)|0)+Math.imul(m,Q)|0,s=s+Math.imul(m,tt)|0;var _t=(u+(r=r+Math.imul(c,it)|0)|0)+((8191&(n=(n=n+Math.imul(c,rt)|0)+Math.imul(d,it)|0))<<13)|0;u=((s=s+Math.imul(d,rt)|0)+(n>>>13)|0)+(_t>>>26)|0,_t&=67108863,r=Math.imul(I,q),n=(n=Math.imul(I,z))+Math.imul(C,q)|0,s=Math.imul(C,z),r=r+Math.imul(S,W)|0,n=(n=n+Math.imul(S,$)|0)+Math.imul(T,W)|0,s=s+Math.imul(T,$)|0,r=r+Math.imul(k,V)|0,n=(n=n+Math.imul(k,K)|0)+Math.imul(x,V)|0,s=s+Math.imul(x,K)|0,r=r+Math.imul(w,J)|0,n=(n=n+Math.imul(w,Y)|0)+Math.imul(_,J)|0,s=s+Math.imul(_,Y)|0,r=r+Math.imul(b,Q)|0,n=(n=n+Math.imul(b,tt)|0)+Math.imul(v,Q)|0,s=s+Math.imul(v,tt)|0,r=r+Math.imul(p,it)|0,n=(n=n+Math.imul(p,rt)|0)+Math.imul(m,it)|0,s=s+Math.imul(m,rt)|0;var Mt=(u+(r=r+Math.imul(c,st)|0)|0)+((8191&(n=(n=n+Math.imul(c,ot)|0)+Math.imul(d,st)|0))<<13)|0;u=((s=s+Math.imul(d,ot)|0)+(n>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,r=Math.imul(R,q),n=(n=Math.imul(R,z))+Math.imul(P,q)|0,s=Math.imul(P,z),r=r+Math.imul(I,W)|0,n=(n=n+Math.imul(I,$)|0)+Math.imul(C,W)|0,s=s+Math.imul(C,$)|0,r=r+Math.imul(S,V)|0,n=(n=n+Math.imul(S,K)|0)+Math.imul(T,V)|0,s=s+Math.imul(T,K)|0,r=r+Math.imul(k,J)|0,n=(n=n+Math.imul(k,Y)|0)+Math.imul(x,J)|0,s=s+Math.imul(x,Y)|0,r=r+Math.imul(w,Q)|0,n=(n=n+Math.imul(w,tt)|0)+Math.imul(_,Q)|0,s=s+Math.imul(_,tt)|0,r=r+Math.imul(b,it)|0,n=(n=n+Math.imul(b,rt)|0)+Math.imul(v,it)|0,s=s+Math.imul(v,rt)|0,r=r+Math.imul(p,st)|0,n=(n=n+Math.imul(p,ot)|0)+Math.imul(m,st)|0,s=s+Math.imul(m,ot)|0;var kt=(u+(r=r+Math.imul(c,ht)|0)|0)+((8191&(n=(n=n+Math.imul(c,ut)|0)+Math.imul(d,ht)|0))<<13)|0;u=((s=s+Math.imul(d,ut)|0)+(n>>>13)|0)+(kt>>>26)|0,kt&=67108863,r=Math.imul(O,q),n=(n=Math.imul(O,z))+Math.imul(D,q)|0,s=Math.imul(D,z),r=r+Math.imul(R,W)|0,n=(n=n+Math.imul(R,$)|0)+Math.imul(P,W)|0,s=s+Math.imul(P,$)|0,r=r+Math.imul(I,V)|0,n=(n=n+Math.imul(I,K)|0)+Math.imul(C,V)|0,s=s+Math.imul(C,K)|0,r=r+Math.imul(S,J)|0,n=(n=n+Math.imul(S,Y)|0)+Math.imul(T,J)|0,s=s+Math.imul(T,Y)|0,r=r+Math.imul(k,Q)|0,n=(n=n+Math.imul(k,tt)|0)+Math.imul(x,Q)|0,s=s+Math.imul(x,tt)|0,r=r+Math.imul(w,it)|0,n=(n=n+Math.imul(w,rt)|0)+Math.imul(_,it)|0,s=s+Math.imul(_,rt)|0,r=r+Math.imul(b,st)|0,n=(n=n+Math.imul(b,ot)|0)+Math.imul(v,st)|0,s=s+Math.imul(v,ot)|0,r=r+Math.imul(p,ht)|0,n=(n=n+Math.imul(p,ut)|0)+Math.imul(m,ht)|0,s=s+Math.imul(m,ut)|0;var xt=(u+(r=r+Math.imul(c,ct)|0)|0)+((8191&(n=(n=n+Math.imul(c,dt)|0)+Math.imul(d,ct)|0))<<13)|0;u=((s=s+Math.imul(d,dt)|0)+(n>>>13)|0)+(xt>>>26)|0,xt&=67108863,r=Math.imul(j,q),n=(n=Math.imul(j,z))+Math.imul(U,q)|0,s=Math.imul(U,z),r=r+Math.imul(O,W)|0,n=(n=n+Math.imul(O,$)|0)+Math.imul(D,W)|0,s=s+Math.imul(D,$)|0,r=r+Math.imul(R,V)|0,n=(n=n+Math.imul(R,K)|0)+Math.imul(P,V)|0,s=s+Math.imul(P,K)|0,r=r+Math.imul(I,J)|0,n=(n=n+Math.imul(I,Y)|0)+Math.imul(C,J)|0,s=s+Math.imul(C,Y)|0,r=r+Math.imul(S,Q)|0,n=(n=n+Math.imul(S,tt)|0)+Math.imul(T,Q)|0,s=s+Math.imul(T,tt)|0,r=r+Math.imul(k,it)|0,n=(n=n+Math.imul(k,rt)|0)+Math.imul(x,it)|0,s=s+Math.imul(x,rt)|0,r=r+Math.imul(w,st)|0,n=(n=n+Math.imul(w,ot)|0)+Math.imul(_,st)|0,s=s+Math.imul(_,ot)|0,r=r+Math.imul(b,ht)|0,n=(n=n+Math.imul(b,ut)|0)+Math.imul(v,ht)|0,s=s+Math.imul(v,ut)|0,r=r+Math.imul(p,ct)|0,n=(n=n+Math.imul(p,dt)|0)+Math.imul(m,ct)|0,s=s+Math.imul(m,dt)|0;var Et=(u+(r=r+Math.imul(c,pt)|0)|0)+((8191&(n=(n=n+Math.imul(c,mt)|0)+Math.imul(d,pt)|0))<<13)|0;u=((s=s+Math.imul(d,mt)|0)+(n>>>13)|0)+(Et>>>26)|0,Et&=67108863,r=Math.imul(j,W),n=(n=Math.imul(j,$))+Math.imul(U,W)|0,s=Math.imul(U,$),r=r+Math.imul(O,V)|0,n=(n=n+Math.imul(O,K)|0)+Math.imul(D,V)|0,s=s+Math.imul(D,K)|0,r=r+Math.imul(R,J)|0,n=(n=n+Math.imul(R,Y)|0)+Math.imul(P,J)|0,s=s+Math.imul(P,Y)|0,r=r+Math.imul(I,Q)|0,n=(n=n+Math.imul(I,tt)|0)+Math.imul(C,Q)|0,s=s+Math.imul(C,tt)|0,r=r+Math.imul(S,it)|0,n=(n=n+Math.imul(S,rt)|0)+Math.imul(T,it)|0,s=s+Math.imul(T,rt)|0,r=r+Math.imul(k,st)|0,n=(n=n+Math.imul(k,ot)|0)+Math.imul(x,st)|0,s=s+Math.imul(x,ot)|0,r=r+Math.imul(w,ht)|0,n=(n=n+Math.imul(w,ut)|0)+Math.imul(_,ht)|0,s=s+Math.imul(_,ut)|0,r=r+Math.imul(b,ct)|0,n=(n=n+Math.imul(b,dt)|0)+Math.imul(v,ct)|0,s=s+Math.imul(v,dt)|0;var St=(u+(r=r+Math.imul(p,pt)|0)|0)+((8191&(n=(n=n+Math.imul(p,mt)|0)+Math.imul(m,pt)|0))<<13)|0;u=((s=s+Math.imul(m,mt)|0)+(n>>>13)|0)+(St>>>26)|0,St&=67108863,r=Math.imul(j,V),n=(n=Math.imul(j,K))+Math.imul(U,V)|0,s=Math.imul(U,K),r=r+Math.imul(O,J)|0,n=(n=n+Math.imul(O,Y)|0)+Math.imul(D,J)|0,s=s+Math.imul(D,Y)|0,r=r+Math.imul(R,Q)|0,n=(n=n+Math.imul(R,tt)|0)+Math.imul(P,Q)|0,s=s+Math.imul(P,tt)|0,r=r+Math.imul(I,it)|0,n=(n=n+Math.imul(I,rt)|0)+Math.imul(C,it)|0,s=s+Math.imul(C,rt)|0,r=r+Math.imul(S,st)|0,n=(n=n+Math.imul(S,ot)|0)+Math.imul(T,st)|0,s=s+Math.imul(T,ot)|0,r=r+Math.imul(k,ht)|0,n=(n=n+Math.imul(k,ut)|0)+Math.imul(x,ht)|0,s=s+Math.imul(x,ut)|0,r=r+Math.imul(w,ct)|0,n=(n=n+Math.imul(w,dt)|0)+Math.imul(_,ct)|0,s=s+Math.imul(_,dt)|0;var Tt=(u+(r=r+Math.imul(b,pt)|0)|0)+((8191&(n=(n=n+Math.imul(b,mt)|0)+Math.imul(v,pt)|0))<<13)|0;u=((s=s+Math.imul(v,mt)|0)+(n>>>13)|0)+(Tt>>>26)|0,Tt&=67108863,r=Math.imul(j,J),n=(n=Math.imul(j,Y))+Math.imul(U,J)|0,s=Math.imul(U,Y),r=r+Math.imul(O,Q)|0,n=(n=n+Math.imul(O,tt)|0)+Math.imul(D,Q)|0,s=s+Math.imul(D,tt)|0,r=r+Math.imul(R,it)|0,n=(n=n+Math.imul(R,rt)|0)+Math.imul(P,it)|0,s=s+Math.imul(P,rt)|0,r=r+Math.imul(I,st)|0,n=(n=n+Math.imul(I,ot)|0)+Math.imul(C,st)|0,s=s+Math.imul(C,ot)|0,r=r+Math.imul(S,ht)|0,n=(n=n+Math.imul(S,ut)|0)+Math.imul(T,ht)|0,s=s+Math.imul(T,ut)|0,r=r+Math.imul(k,ct)|0,n=(n=n+Math.imul(k,dt)|0)+Math.imul(x,ct)|0,s=s+Math.imul(x,dt)|0;var At=(u+(r=r+Math.imul(w,pt)|0)|0)+((8191&(n=(n=n+Math.imul(w,mt)|0)+Math.imul(_,pt)|0))<<13)|0;u=((s=s+Math.imul(_,mt)|0)+(n>>>13)|0)+(At>>>26)|0,At&=67108863,r=Math.imul(j,Q),n=(n=Math.imul(j,tt))+Math.imul(U,Q)|0,s=Math.imul(U,tt),r=r+Math.imul(O,it)|0,n=(n=n+Math.imul(O,rt)|0)+Math.imul(D,it)|0,s=s+Math.imul(D,rt)|0,r=r+Math.imul(R,st)|0,n=(n=n+Math.imul(R,ot)|0)+Math.imul(P,st)|0,s=s+Math.imul(P,ot)|0,r=r+Math.imul(I,ht)|0,n=(n=n+Math.imul(I,ut)|0)+Math.imul(C,ht)|0,s=s+Math.imul(C,ut)|0,r=r+Math.imul(S,ct)|0,n=(n=n+Math.imul(S,dt)|0)+Math.imul(T,ct)|0,s=s+Math.imul(T,dt)|0;var It=(u+(r=r+Math.imul(k,pt)|0)|0)+((8191&(n=(n=n+Math.imul(k,mt)|0)+Math.imul(x,pt)|0))<<13)|0;u=((s=s+Math.imul(x,mt)|0)+(n>>>13)|0)+(It>>>26)|0,It&=67108863,r=Math.imul(j,it),n=(n=Math.imul(j,rt))+Math.imul(U,it)|0,s=Math.imul(U,rt),r=r+Math.imul(O,st)|0,n=(n=n+Math.imul(O,ot)|0)+Math.imul(D,st)|0,s=s+Math.imul(D,ot)|0,r=r+Math.imul(R,ht)|0,n=(n=n+Math.imul(R,ut)|0)+Math.imul(P,ht)|0,s=s+Math.imul(P,ut)|0,r=r+Math.imul(I,ct)|0,n=(n=n+Math.imul(I,dt)|0)+Math.imul(C,ct)|0,s=s+Math.imul(C,dt)|0;var Ct=(u+(r=r+Math.imul(S,pt)|0)|0)+((8191&(n=(n=n+Math.imul(S,mt)|0)+Math.imul(T,pt)|0))<<13)|0;u=((s=s+Math.imul(T,mt)|0)+(n>>>13)|0)+(Ct>>>26)|0,Ct&=67108863,r=Math.imul(j,st),n=(n=Math.imul(j,ot))+Math.imul(U,st)|0,s=Math.imul(U,ot),r=r+Math.imul(O,ht)|0,n=(n=n+Math.imul(O,ut)|0)+Math.imul(D,ht)|0,s=s+Math.imul(D,ut)|0,r=r+Math.imul(R,ct)|0,n=(n=n+Math.imul(R,dt)|0)+Math.imul(P,ct)|0,s=s+Math.imul(P,dt)|0;var Bt=(u+(r=r+Math.imul(I,pt)|0)|0)+((8191&(n=(n=n+Math.imul(I,mt)|0)+Math.imul(C,pt)|0))<<13)|0;u=((s=s+Math.imul(C,mt)|0)+(n>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,r=Math.imul(j,ht),n=(n=Math.imul(j,ut))+Math.imul(U,ht)|0,s=Math.imul(U,ut),r=r+Math.imul(O,ct)|0,n=(n=n+Math.imul(O,dt)|0)+Math.imul(D,ct)|0,s=s+Math.imul(D,dt)|0;var Rt=(u+(r=r+Math.imul(R,pt)|0)|0)+((8191&(n=(n=n+Math.imul(R,mt)|0)+Math.imul(P,pt)|0))<<13)|0;u=((s=s+Math.imul(P,mt)|0)+(n>>>13)|0)+(Rt>>>26)|0,Rt&=67108863,r=Math.imul(j,ct),n=(n=Math.imul(j,dt))+Math.imul(U,ct)|0,s=Math.imul(U,dt);var Pt=(u+(r=r+Math.imul(O,pt)|0)|0)+((8191&(n=(n=n+Math.imul(O,mt)|0)+Math.imul(D,pt)|0))<<13)|0;u=((s=s+Math.imul(D,mt)|0)+(n>>>13)|0)+(Pt>>>26)|0,Pt&=67108863;var Lt=(u+(r=Math.imul(j,pt))|0)+((8191&(n=(n=Math.imul(j,mt))+Math.imul(U,pt)|0))<<13)|0;return u=((s=Math.imul(U,mt))+(n>>>13)|0)+(Lt>>>26)|0,Lt&=67108863,h[0]=gt,h[1]=bt,h[2]=vt,h[3]=yt,h[4]=wt,h[5]=_t,h[6]=Mt,h[7]=kt,h[8]=xt,h[9]=Et,h[10]=St,h[11]=Tt,h[12]=At,h[13]=It,h[14]=Ct,h[15]=Bt,h[16]=Rt,h[17]=Pt,h[18]=Lt,0!==u&&(h[19]=u,i.length++),i};function m(t,e,i){return(new g).mulp(t,e,i)}function g(t,e){this.x=t,this.y=e}Math.imul||(p=f),s.prototype.mulTo=function(t,e){var i,r=this.length+t.length;return i=10===this.length&&10===t.length?p(this,t,e):r<63?f(this,t,e):r<1024?function(t,e,i){i.negative=e.negative^t.negative,i.length=t.length+e.length;for(var r=0,n=0,s=0;s>>26)|0)>>>26,o&=67108863}i.words[s]=a,r=o,o=n}return 0!==r?i.words[s]=r:i.length--,i.strip()}(this,t,e):m(this,t,e),i},g.prototype.makeRBT=function(t){for(var e=new Array(t),i=s.prototype._countBits(t)-1,r=0;r>=1;return r},g.prototype.permute=function(t,e,i,r,n,s){for(var o=0;o>>=1)n++;return 1<>>=13,i[2*o+1]=8191&s,s>>>=13;for(o=2*e;o>=26,e+=n/67108864|0,e+=s>>>26,this.words[i]=67108863&s}return 0!==e&&(this.words[i]=e,this.length++),this},s.prototype.muln=function(t){return this.clone().imuln(t)},s.prototype.sqr=function(){return this.mul(this)},s.prototype.isqr=function(){return this.imul(this.clone())},s.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),i=0;i>>n}return e}(t);if(0===e.length)return new s(1);for(var i=this,r=0;r=0);var e,i=t%26,n=(t-i)/26,s=67108863>>>26-i<<26-i;if(0!==i){var o=0;for(e=0;e>>26-i}o&&(this.words[e]=o,this.length++)}if(0!==n){for(e=this.length-1;e>=0;e--)this.words[e+n]=this.words[e];for(e=0;e=0),n=e?(e-e%26)/26:0;var s=t%26,o=Math.min((t-s)/26,this.length),a=67108863^67108863>>>s<o)for(this.length-=o,u=0;u=0&&(0!==l||u>=n);u--){var c=0|this.words[u];this.words[u]=l<<26-s|c>>>s,l=c&a}return h&&0!==l&&(h.words[h.length++]=l),0===this.length&&(this.words[0]=0,this.length=1),this.strip()},s.prototype.ishrn=function(t,e,i){return r(0===this.negative),this.iushrn(t,e,i)},s.prototype.shln=function(t){return this.clone().ishln(t)},s.prototype.ushln=function(t){return this.clone().iushln(t)},s.prototype.shrn=function(t){return this.clone().ishrn(t)},s.prototype.ushrn=function(t){return this.clone().iushrn(t)},s.prototype.testn=function(t){r("number"==typeof t&&t>=0);var e=t%26,i=(t-e)/26,n=1<=0);var e=t%26,i=(t-e)/26;if(r(0===this.negative,"imaskn works only with positive numbers"),this.length<=i)return this;if(0!==e&&i++,this.length=Math.min(i,this.length),0!==e){var n=67108863^67108863>>>e<=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},s.prototype.isubn=function(t){if(r("number"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e>26)-(h/67108864|0),this.words[n+i]=67108863&s}for(;n>26,this.words[n+i]=67108863&s;if(0===a)return this.strip();for(r(-1===a),a=0,n=0;n>26,this.words[n]=67108863&s;return this.negative=1,this.strip()},s.prototype._wordDiv=function(t,e){var i=(this.length,t.length),r=this.clone(),n=t,o=0|n.words[n.length-1];0!=(i=26-this._countBits(o))&&(n=n.ushln(i),r.iushln(i),o=0|n.words[n.length-1]);var a,h=r.length-n.length;if("mod"!==e){(a=new s(null)).length=h+1,a.words=new Array(a.length);for(var u=0;u=0;c--){var d=67108864*(0|r.words[n.length+c])+(0|r.words[n.length+c-1]);for(d=Math.min(d/o|0,67108863),r._ishlnsubmul(n,d,c);0!==r.negative;)d--,r.negative=0,r._ishlnsubmul(n,1,c),r.isZero()||(r.negative^=1);a&&(a.words[c]=d)}return a&&a.strip(),r.strip(),"div"!==e&&0!==i&&r.iushrn(i),{div:a||null,mod:r}},s.prototype.divmod=function(t,e,i){return r(!t.isZero()),this.isZero()?{div:new s(0),mod:new s(0)}:0!==this.negative&&0===t.negative?(a=this.neg().divmod(t,e),"mod"!==e&&(n=a.div.neg()),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.iadd(t)),{div:n,mod:o}):0===this.negative&&0!==t.negative?(a=this.divmod(t.neg(),e),"mod"!==e&&(n=a.div.neg()),{div:n,mod:a.mod}):0!=(this.negative&t.negative)?(a=this.neg().divmod(t.neg(),e),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.isub(t)),{div:a.div,mod:o}):t.length>this.length||this.cmp(t)<0?{div:new s(0),mod:this}:1===t.length?"div"===e?{div:this.divn(t.words[0]),mod:null}:"mod"===e?{div:null,mod:new s(this.modn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new s(this.modn(t.words[0]))}:this._wordDiv(t,e);var n,o,a},s.prototype.div=function(t){return this.divmod(t,"div",!1).div},s.prototype.mod=function(t){return this.divmod(t,"mod",!1).mod},s.prototype.umod=function(t){return this.divmod(t,"mod",!0).mod},s.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var i=0!==e.div.negative?e.mod.isub(t):e.mod,r=t.ushrn(1),n=t.andln(1),s=i.cmp(r);return s<0||1===n&&0===s?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},s.prototype.modn=function(t){r(t<=67108863);for(var e=(1<<26)%t,i=0,n=this.length-1;n>=0;n--)i=(e*i+(0|this.words[n]))%t;return i},s.prototype.idivn=function(t){r(t<=67108863);for(var e=0,i=this.length-1;i>=0;i--){var n=(0|this.words[i])+67108864*e;this.words[i]=n/t|0,e=n%t}return this.strip()},s.prototype.divn=function(t){return this.clone().idivn(t)},s.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n=new s(1),o=new s(0),a=new s(0),h=new s(1),u=0;e.isEven()&&i.isEven();)e.iushrn(1),i.iushrn(1),++u;for(var l=i.clone(),c=e.clone();!e.isZero();){for(var d=0,f=1;0==(e.words[0]&f)&&d<26;++d,f<<=1);if(d>0)for(e.iushrn(d);d-- >0;)(n.isOdd()||o.isOdd())&&(n.iadd(l),o.isub(c)),n.iushrn(1),o.iushrn(1);for(var p=0,m=1;0==(i.words[0]&m)&&p<26;++p,m<<=1);if(p>0)for(i.iushrn(p);p-- >0;)(a.isOdd()||h.isOdd())&&(a.iadd(l),h.isub(c)),a.iushrn(1),h.iushrn(1);e.cmp(i)>=0?(e.isub(i),n.isub(a),o.isub(h)):(i.isub(e),a.isub(n),h.isub(o))}return{a,b:h,gcd:i.iushln(u)}},s.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n,o=new s(1),a=new s(0),h=i.clone();e.cmpn(1)>0&&i.cmpn(1)>0;){for(var u=0,l=1;0==(e.words[0]&l)&&u<26;++u,l<<=1);if(u>0)for(e.iushrn(u);u-- >0;)o.isOdd()&&o.iadd(h),o.iushrn(1);for(var c=0,d=1;0==(i.words[0]&d)&&c<26;++c,d<<=1);if(c>0)for(i.iushrn(c);c-- >0;)a.isOdd()&&a.iadd(h),a.iushrn(1);e.cmp(i)>=0?(e.isub(i),o.isub(a)):(i.isub(e),a.isub(o))}return(n=0===e.cmpn(1)?o:a).cmpn(0)<0&&n.iadd(t),n},s.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),i=t.clone();e.negative=0,i.negative=0;for(var r=0;e.isEven()&&i.isEven();r++)e.iushrn(1),i.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;i.isEven();)i.iushrn(1);var n=e.cmp(i);if(n<0){var s=e;e=i,i=s}else if(0===n||0===i.cmpn(1))break;e.isub(i)}return i.iushln(r)},s.prototype.invm=function(t){return this.egcd(t).a.umod(t)},s.prototype.isEven=function(){return 0==(1&this.words[0])},s.prototype.isOdd=function(){return 1==(1&this.words[0])},s.prototype.andln=function(t){return this.words[0]&t},s.prototype.bincn=function(t){r("number"==typeof t);var e=t%26,i=(t-e)/26,n=1<>>26,a&=67108863,this.words[o]=a}return 0!==s&&(this.words[o]=s,this.length++),this},s.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},s.prototype.cmpn=function(t){var e,i=t<0;if(0!==this.negative&&!i)return-1;if(0===this.negative&&i)return 1;if(this.strip(),this.length>1)e=1;else{i&&(t=-t),r(t<=67108863,"Number is too big");var n=0|this.words[0];e=n===t?0:nt.length)return 1;if(this.length=0;i--){var r=0|this.words[i],n=0|t.words[i];if(r!==n){rn&&(e=1);break}}return e},s.prototype.gtn=function(t){return 1===this.cmpn(t)},s.prototype.gt=function(t){return 1===this.cmp(t)},s.prototype.gten=function(t){return this.cmpn(t)>=0},s.prototype.gte=function(t){return this.cmp(t)>=0},s.prototype.ltn=function(t){return-1===this.cmpn(t)},s.prototype.lt=function(t){return-1===this.cmp(t)},s.prototype.lten=function(t){return this.cmpn(t)<=0},s.prototype.lte=function(t){return this.cmp(t)<=0},s.prototype.eqn=function(t){return 0===this.cmpn(t)},s.prototype.eq=function(t){return 0===this.cmp(t)},s.red=function(t){return new k(t)},s.prototype.toRed=function(t){return r(!this.red,"Already a number in reduction context"),r(0===this.negative,"red works only with positives"),t.convertTo(this)._forceRed(t)},s.prototype.fromRed=function(){return r(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},s.prototype._forceRed=function(t){return this.red=t,this},s.prototype.forceRed=function(t){return r(!this.red,"Already a number in reduction context"),this._forceRed(t)},s.prototype.redAdd=function(t){return r(this.red,"redAdd works only with red numbers"),this.red.add(this,t)},s.prototype.redIAdd=function(t){return r(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,t)},s.prototype.redSub=function(t){return r(this.red,"redSub works only with red numbers"),this.red.sub(this,t)},s.prototype.redISub=function(t){return r(this.red,"redISub works only with red numbers"),this.red.isub(this,t)},s.prototype.redShl=function(t){return r(this.red,"redShl works only with red numbers"),this.red.shl(this,t)},s.prototype.redMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.mul(this,t)},s.prototype.redIMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.imul(this,t)},s.prototype.redSqr=function(){return r(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},s.prototype.redISqr=function(){return r(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},s.prototype.redSqrt=function(){return r(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},s.prototype.redInvm=function(){return r(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},s.prototype.redNeg=function(){return r(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},s.prototype.redPow=function(t){return r(this.red&&!t.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,t)};var b={k256:null,p224:null,p192:null,p25519:null};function v(t,e){this.name=t,this.p=new s(e,16),this.n=this.p.bitLength(),this.k=new s(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function y(){v.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function w(){v.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function _(){v.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function M(){v.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function k(t){if("string"==typeof t){var e=s._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),"modulus must be greater than 1"),this.m=t,this.prime=null}function x(t){k.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new s(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}v.prototype._tmp=function(){var t=new s(null);return t.words=new Array(Math.ceil(this.n/13)),t},v.prototype.ireduce=function(t){var e,i=t;do{this.split(i,this.tmp),e=(i=(i=this.imulK(i)).iadd(this.tmp)).bitLength()}while(e>this.n);var r=e0?i.isub(this.p):void 0!==i.strip?i.strip():i._strip(),i},v.prototype.split=function(t,e){t.iushrn(this.n,0,e)},v.prototype.imulK=function(t){return t.imul(this.k)},n(y,v),y.prototype.split=function(t,e){for(var i=4194303,r=Math.min(t.length,9),n=0;n>>22,s=o}s>>>=22,t.words[n-10]=s,0===s&&t.length>10?t.length-=10:t.length-=9},y.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,i=0;i>>=26,t.words[i]=n,e=r}return 0!==e&&(t.words[t.length++]=e),t},s._prime=function(t){if(b[t])return b[t];var e;if("k256"===t)e=new y;else if("p224"===t)e=new w;else if("p192"===t)e=new _;else{if("p25519"!==t)throw new Error("Unknown prime "+t);e=new M}return b[t]=e,e},k.prototype._verify1=function(t){r(0===t.negative,"red works only with positives"),r(t.red,"red works only with red numbers")},k.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),"red works only with positives"),r(t.red&&t.red===e.red,"red works only with red numbers")},k.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):t.umod(this.m)._forceRed(this)},k.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},k.prototype.add=function(t,e){this._verify2(t,e);var i=t.add(e);return i.cmp(this.m)>=0&&i.isub(this.m),i._forceRed(this)},k.prototype.iadd=function(t,e){this._verify2(t,e);var i=t.iadd(e);return i.cmp(this.m)>=0&&i.isub(this.m),i},k.prototype.sub=function(t,e){this._verify2(t,e);var i=t.sub(e);return i.cmpn(0)<0&&i.iadd(this.m),i._forceRed(this)},k.prototype.isub=function(t,e){this._verify2(t,e);var i=t.isub(e);return i.cmpn(0)<0&&i.iadd(this.m),i},k.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},k.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},k.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},k.prototype.isqr=function(t){return this.imul(t,t.clone())},k.prototype.sqr=function(t){return this.mul(t,t)},k.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var i=this.m.add(new s(1)).iushrn(2);return this.pow(t,i)}for(var n=this.m.subn(1),o=0;!n.isZero()&&0===n.andln(1);)o++,n.iushrn(1);r(!n.isZero());var a=new s(1).toRed(this),h=a.redNeg(),u=this.m.subn(1).iushrn(1),l=this.m.bitLength();for(l=new s(2*l*l).toRed(this);0!==this.pow(l,u).cmp(h);)l.redIAdd(h);for(var c=this.pow(l,n),d=this.pow(t,n.addn(1).iushrn(1)),f=this.pow(t,n),p=o;0!==f.cmp(a);){for(var m=f,g=0;0!==m.cmp(a);g++)m=m.redSqr();r(g=0;r--){for(var u=e.words[r],l=h-1;l>=0;l--){var c=u>>l&1;n!==i[0]&&(n=this.sqr(n)),0!==c||0!==o?(o<<=1,o|=c,(4==++a||0===r&&0===l)&&(n=this.mul(n,i[o]),a=0,o=0)):a=0}h=26}return n},k.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},k.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},s.mont=function(t){return new x(t)},n(x,k),x.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},x.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},x.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var i=t.imul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),s=n;return n.cmp(this.m)>=0?s=n.isub(this.m):n.cmpn(0)<0&&(s=n.iadd(this.m)),s._forceRed(this)},x.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new s(0)._forceRed(this);var i=t.mul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),o=n;return n.cmp(this.m)>=0?o=n.isub(this.m):n.cmpn(0)<0&&(o=n.iadd(this.m)),o._forceRed(this)},x.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(t=i.nmd(t),this)},2510:(t,e,i)=>{"use strict";var r=i(8764).Buffer;Object.defineProperty(e,"__esModule",{value:!0});const n=i(2830),s=i(5103),o=i(8984),a=i(1471),h=i(2451);e.EbmlStreamDecoderOptions=class{constructor(){this.bufferTagIds=[]}};class u extends n.Transform{constructor(t={}){super(Object.assign({},t,{readableObjectMode:!0})),this._currentBufferOffset=0,this._tagStack=[],this._buffer=r.alloc(0),this._bufferTagIds=[],this._bufferTagIds=t.bufferTagIds||[]}get buffer(){return this._buffer}_transform(t,e,i){for(this._buffer=r.concat([this._buffer,r.from(t)]);this.parseTags(););i()}parseTags(){const t=this.readTagHeader(this._buffer);if(!t)return!1;if(t.type===o.EbmlElementType.Master&&!this._bufferTagIds.some((e=>e===t.id)))return this._tagStack.push(t),this.emitTag(t,a.EbmlTagPosition.Start),this.advanceBuffer(t.tagHeaderLength),!0;{if(this._buffer.length0;){const t=this._tagStack[this._tagStack.length-1];if(this._currentBufferOffset{"use strict";var r=i(8764).Buffer;Object.defineProperty(e,"__esModule",{value:!0});const n=i(2830),s=i(1471),o=i(2090);class a extends n.Transform{constructor(t={}){super(Object.assign({},t,{writableObjectMode:!0})),this.dataBuffer=r.alloc(0),this.mCorked=!1,this.openTags=[]}_transform(t,e,i){if(t){if(!t.id)throw new Error(`No id found for ${JSON.stringify(t)}`);switch(t.position){case s.EbmlTagPosition.Start:this.startTag(t);break;case s.EbmlTagPosition.Content:this.writeTag(t);break;case s.EbmlTagPosition.End:this.endTag(t)}}i()}bufferAndFlush(t){this.dataBuffer=r.concat([this.dataBuffer,t]),this._flush((()=>{}))}_flush(t){let e=null;this.dataBuffer.length>0&&!this.mCorked&&(e=r.from(this.dataBuffer),this.dataBuffer=r.alloc(0),this.push(e)),t()}_bufferAndFlush(t){this.bufferAndFlush(t)}flush(){this._flush((()=>{}))}get buffer(){return this.dataBuffer}set buffer(t){this.dataBuffer=t}get stack(){return this.openTags}cork(){this.mCorked=!0}uncork(){this.mCorked=!1,this._flush((()=>{}))}writeTag(t){this.openTags.length>0?this.openTags[this.openTags.length-1].Children.push(t):this.bufferAndFlush(t.encode())}startTag(t){this.openTags.length>0&&this.openTags[this.openTags.length-1].Children.push(t),this.openTags.push(t)}endTag(t){const e=this.openTags.pop();if(t.id!==e.id)throw`Logic error - closing tag "${o.EbmlTagId[t.id]}" is not expected tag "${o.EbmlTagId[e.id]}"`;this.openTags.length<1&&this.bufferAndFlush(e.encode())}}e.EbmlStreamEncoder=a},3277:(t,e,i)=>{"use strict";i(5103).Tools;var r=i(2510);e.LE=r.EbmlStreamDecoder,i(1875).EbmlStreamEncoder,i(5016).Block,i(5563).BlockLacing,i(9958).EbmlDataTag,i(8984).EbmlElementType,i(2785).EbmlMasterTag,i(6819).EbmlTag,i(2451).EbmlTagFactory;var n=i(2090);e.Av=n.EbmlTagId,i(1471).EbmlTagPosition,i(8212).SimpleBlock},6819:(t,e,i)=>{"use strict";var r=i(8764).Buffer;Object.defineProperty(e,"__esModule",{value:!0});const n=i(2090),s=i(5103);e.EbmlTag=class{constructor(t,e,i){this.id=t,this.type=e,this.position=i}getTagDeclaration(){let t=this.id.toString(16);return t.length%2!=0&&(t=`0${t}`),r.from(t,"hex")}encode(){let t=null,e=this.encodeContent();if(-1===this.size)t=r.from("01ffffffffffffff","hex");else{let i;[n.EbmlTagId.Segment,n.EbmlTagId.Cluster].some((t=>t===this.id))&&(i=8),t=s.Tools.writeVint(e.length,i)}return r.concat([this.getTagDeclaration(),t,e])}}},2451:(t,e,i)=>{"use strict";Object.defineProperty(e,"__esModule",{value:!0});const r=i(2090),n=i(2785),s=i(9958),o=i(5016),a=i(8212),h=i(8984);e.EbmlTagFactory=class{static create(t,e){if(void 0!==r.EbmlTagId[t]){let i;switch(t){case r.EbmlTagId.Block:return new o.Block;case r.EbmlTagId.SimpleBlock:return new a.SimpleBlock;case r.EbmlTagId.ChapterDisplay:case r.EbmlTagId.ContentCompression:case r.EbmlTagId.ContentEncryption:case r.EbmlTagId.SilentTracks:case r.EbmlTagId.ContentEncoding:case r.EbmlTagId.TrackTranslate:case r.EbmlTagId.ChapProcessCommand:case r.EbmlTagId.ChapterTranslate:case r.EbmlTagId.ChapProcess:case r.EbmlTagId.Tag:case r.EbmlTagId.Segment:case r.EbmlTagId.SimpleTag:case r.EbmlTagId.Targets:case r.EbmlTagId.Tags:case r.EbmlTagId.ChapterTrack:case r.EbmlTagId.ChapterAtom:case r.EbmlTagId.EditionEntry:case r.EbmlTagId.Chapters:case r.EbmlTagId.AttachedFile:case r.EbmlTagId.Attachments:case r.EbmlTagId.CueReference:case r.EbmlTagId.CueTrackPositions:case r.EbmlTagId.CuePoint:case r.EbmlTagId.Cues:case r.EbmlTagId.ContentEncAESSettings:case r.EbmlTagId.ContentEncodings:case r.EbmlTagId.TrackJoinBlocks:case r.EbmlTagId.TrackPlane:case r.EbmlTagId.TrackCombinePlanes:case r.EbmlTagId.TrackOperation:case r.EbmlTagId.Audio:case r.EbmlTagId.Video:case r.EbmlTagId.TrackEntry:case r.EbmlTagId.Tracks:case r.EbmlTagId.ReferenceFrame:case r.EbmlTagId.TimeSlice:case r.EbmlTagId.Slices:case r.EbmlTagId.BlockMore:case r.EbmlTagId.BlockAdditions:case r.EbmlTagId.BlockGroup:case r.EbmlTagId.Cluster:case r.EbmlTagId.Info:case r.EbmlTagId.Seek:case r.EbmlTagId.SeekHead:case r.EbmlTagId.SignatureElementList:case r.EbmlTagId.SignatureElements:case r.EbmlTagId.SignatureSlot:case r.EbmlTagId.EBML:i=h.EbmlElementType.Master;break;case r.EbmlTagId.TrackType:case r.EbmlTagId.FlagDefault:case r.EbmlTagId.ChapterTrackNumber:case r.EbmlTagId.ChapterTimeStart:case r.EbmlTagId.ChapterTimeEnd:case r.EbmlTagId.CueRefTime:case r.EbmlTagId.CueRefCluster:case r.EbmlTagId.ChapterFlagHidden:case r.EbmlTagId.ContentCompAlgo:case r.EbmlTagId.DocTypeReadVersion:case r.EbmlTagId.EBMLVersion:case r.EbmlTagId.DocTypeVersion:case r.EbmlTagId.TagDefault:case r.EbmlTagId.ChapterFlagEnabled:case r.EbmlTagId.FileUsedStartTime:case r.EbmlTagId.FileUsedEndTime:case r.EbmlTagId.ContentEncodingOrder:case r.EbmlTagId.ContentEncodingScope:case r.EbmlTagId.ContentEncodingType:case r.EbmlTagId.CueBlockNumber:case r.EbmlTagId.BitDepth:case r.EbmlTagId.ChapProcessTime:case r.EbmlTagId.ChapProcessCodecID:case r.EbmlTagId.AttachmentLink:case r.EbmlTagId.TagAttachmentUID:case r.EbmlTagId.TagChapterUID:case r.EbmlTagId.TagEditionUID:case r.EbmlTagId.TagTrackUID:case r.EbmlTagId.TargetTypeValue:case r.EbmlTagId.ChapterPhysicalEquiv:case r.EbmlTagId.ChapterSegmentEditionUID:case r.EbmlTagId.ChapterUID:case r.EbmlTagId.EditionFlagOrdered:case r.EbmlTagId.EditionFlagDefault:case r.EbmlTagId.EditionFlagHidden:case r.EbmlTagId.EditionUID:case r.EbmlTagId.FileUID:case r.EbmlTagId.CueRefCodecState:case r.EbmlTagId.CueRefNumber:case r.EbmlTagId.CueCodecState:case r.EbmlTagId.CueDuration:case r.EbmlTagId.CueRelativePosition:case r.EbmlTagId.CueClusterPosition:case r.EbmlTagId.CueTrack:case r.EbmlTagId.CueTime:case r.EbmlTagId.AESSettingsCipherMode:case r.EbmlTagId.ContentSigHashAlgo:case r.EbmlTagId.ContentSigAlgo:case r.EbmlTagId.ContentEncAlgo:case r.EbmlTagId.TrickMasterTrackUID:case r.EbmlTagId.TrickTrackFlag:case r.EbmlTagId.TrickTrackUID:case r.EbmlTagId.TrackJoinUID:case r.EbmlTagId.TrackPlaneType:case r.EbmlTagId.TrackPlaneUID:case r.EbmlTagId.Channels:case r.EbmlTagId.AspectRatioType:case r.EbmlTagId.DisplayUnit:case r.EbmlTagId.DisplayHeight:case r.EbmlTagId.DisplayWidth:case r.EbmlTagId.PixelCropRight:case r.EbmlTagId.PixelCropLeft:case r.EbmlTagId.PixelCropTop:case r.EbmlTagId.PixelCropBottom:case r.EbmlTagId.PixelHeight:case r.EbmlTagId.PixelWidth:case r.EbmlTagId.OldStereoMode:case r.EbmlTagId.AlphaMode:case r.EbmlTagId.StereoMode:case r.EbmlTagId.FlagInterlaced:case r.EbmlTagId.TrackTranslateCodec:case r.EbmlTagId.TrackTranslateEditionUID:case r.EbmlTagId.SeekPreRoll:case r.EbmlTagId.CodecDelay:case r.EbmlTagId.TrackOverlay:case r.EbmlTagId.CodecDecodeAll:case r.EbmlTagId.MaxBlockAdditionID:case r.EbmlTagId.DefaultDecodedFieldDuration:case r.EbmlTagId.DefaultDuration:case r.EbmlTagId.MaxCache:case r.EbmlTagId.MinCache:case r.EbmlTagId.FlagLacing:case r.EbmlTagId.FlagForced:case r.EbmlTagId.FlagEnabled:case r.EbmlTagId.TrackUID:case r.EbmlTagId.TrackNumber:case r.EbmlTagId.ReferenceTimeCode:case r.EbmlTagId.ReferenceOffset:case r.EbmlTagId.SliceDuration:case r.EbmlTagId.Delay:case r.EbmlTagId.BlockAdditionID:case r.EbmlTagId.FrameNumber:case r.EbmlTagId.LaceNumber:case r.EbmlTagId.ReferencePriority:case r.EbmlTagId.BlockDuration:case r.EbmlTagId.BlockAddID:case r.EbmlTagId.PrevSize:case r.EbmlTagId.Position:case r.EbmlTagId.SilentTrackNumber:case r.EbmlTagId.Timecode:case r.EbmlTagId.TimecodeScaleDenominator:case r.EbmlTagId.TimecodeScale:case r.EbmlTagId.ChapterTranslateCodec:case r.EbmlTagId.ChapterTranslateEditionUID:case r.EbmlTagId.SeekPosition:case r.EbmlTagId.SignatureHash:case r.EbmlTagId.SignatureAlgo:case r.EbmlTagId.EBMLMaxSizeLength:case r.EbmlTagId.EBMLMaxIDLength:case r.EbmlTagId.EBMLReadVersion:i=h.EbmlElementType.UnsignedInt;break;case r.EbmlTagId.TrackOffset:case r.EbmlTagId.DiscardPadding:case r.EbmlTagId.ReferenceVirtual:case r.EbmlTagId.ReferenceBlock:i=h.EbmlElementType.Integer;break;case r.EbmlTagId.CodecID:case r.EbmlTagId.DocType:case r.EbmlTagId.FileMimeType:case r.EbmlTagId.TagLanguage:case r.EbmlTagId.TargetType:case r.EbmlTagId.ChapCountry:case r.EbmlTagId.ChapLanguage:case r.EbmlTagId.CodecDownloadURL:case r.EbmlTagId.CodecInfoURL:case r.EbmlTagId.Language:i=h.EbmlElementType.String;break;case r.EbmlTagId.ChapString:case r.EbmlTagId.TagString:case r.EbmlTagId.ChapterStringUID:case r.EbmlTagId.WritingApp:case r.EbmlTagId.SegmentFilename:case r.EbmlTagId.CodecName:case r.EbmlTagId.TagName:case r.EbmlTagId.FileName:case r.EbmlTagId.FileDescription:case r.EbmlTagId.CodecSettings:case r.EbmlTagId.Name:case r.EbmlTagId.MuxingApp:case r.EbmlTagId.Title:case r.EbmlTagId.NextFilename:case r.EbmlTagId.PrevFilename:i=h.EbmlElementType.UTF8;break;case r.EbmlTagId.ContentCompSettings:case r.EbmlTagId.SegmentFamily:case r.EbmlTagId.TagBinary:case r.EbmlTagId.FileReferral:case r.EbmlTagId.SignedElement:case r.EbmlTagId.ChapProcessData:case r.EbmlTagId.ChapProcessPrivate:case r.EbmlTagId.ChapterSegmentUID:case r.EbmlTagId.FileData:case r.EbmlTagId.ContentSigKeyID:case r.EbmlTagId.ContentSignature:case r.EbmlTagId.ContentEncKeyID:case r.EbmlTagId.TrickMasterTrackSegmentUID:case r.EbmlTagId.TrickTrackSegmentUID:case r.EbmlTagId.ChannelPositions:case r.EbmlTagId.ColourSpace:case r.EbmlTagId.TrackTranslateTrackID:case r.EbmlTagId.CodecPrivate:case r.EbmlTagId.EncryptedBlock:case r.EbmlTagId.CodecState:case r.EbmlTagId.BlockAdditional:case r.EbmlTagId.BlockVirtual:case r.EbmlTagId.ChapterTranslateID:case r.EbmlTagId.NextUID:case r.EbmlTagId.PrevUID:case r.EbmlTagId.SegmentUID:case r.EbmlTagId.SeekID:case r.EbmlTagId.Signature:case r.EbmlTagId.SignaturePublicKey:case r.EbmlTagId.CRC32:case r.EbmlTagId.Void:i=h.EbmlElementType.Binary;break;case r.EbmlTagId.Duration:case r.EbmlTagId.OutputSamplingFrequency:case r.EbmlTagId.SamplingFrequency:case r.EbmlTagId.FrameRate:case r.EbmlTagId.GammaValue:case r.EbmlTagId.TrackTimecodeScale:i=h.EbmlElementType.Float;break;case r.EbmlTagId.DateUTC:i=h.EbmlElementType.Date}if(void 0===e)e=i;else if(e!==i)throw new Error(`Trying to create tag of well-known type "${r.EbmlTagId[t]}" using content type "${e}" (which is incorrect). Either pass the correct type or ignore the type parameter to EbmlTag.create()`)}switch(e){case h.EbmlElementType.Master:return new n.EbmlMasterTag(t);case h.EbmlElementType.UTF8:case h.EbmlElementType.Binary:case h.EbmlElementType.Date:case h.EbmlElementType.Float:case h.EbmlElementType.Integer:case h.EbmlElementType.String:case h.EbmlElementType.UnsignedInt:default:return new s.EbmlDataTag(t,e)}}}},5563:(t,e)=>{"use strict";var i;Object.defineProperty(e,"__esModule",{value:!0}),(i=e.BlockLacing||(e.BlockLacing={}))[i.None=0]="None",i[i.Xiph=1]="Xiph",i[i.EBML=2]="EBML",i[i.FixedSize=3]="FixedSize"},8984:(t,e)=>{"use strict";var i;Object.defineProperty(e,"__esModule",{value:!0}),(i=e.EbmlElementType||(e.EbmlElementType={})).Master="m",i.UnsignedInt="u",i.Integer="i",i.String="s",i.UTF8="8",i.Binary="b",i.Float="f",i.Date="d"},2090:(t,e)=>{"use strict";var i;Object.defineProperty(e,"__esModule",{value:!0}),(i=e.EbmlTagId||(e.EbmlTagId={}))[i.ChapterDisplay=128]="ChapterDisplay",i[i.TrackType=131]="TrackType",i[i.ChapString=133]="ChapString",i[i.CodecID=134]="CodecID",i[i.FlagDefault=136]="FlagDefault",i[i.ChapterTrackNumber=137]="ChapterTrackNumber",i[i.ChapterTimeStart=145]="ChapterTimeStart",i[i.ChapterTimeEnd=146]="ChapterTimeEnd",i[i.CueRefTime=150]="CueRefTime",i[i.CueRefCluster=151]="CueRefCluster",i[i.ChapterFlagHidden=152]="ChapterFlagHidden",i[i.ContentCompAlgo=16980]="ContentCompAlgo",i[i.ContentCompSettings=16981]="ContentCompSettings",i[i.DocType=17026]="DocType",i[i.DocTypeReadVersion=17029]="DocTypeReadVersion",i[i.EBMLVersion=17030]="EBMLVersion",i[i.DocTypeVersion=17031]="DocTypeVersion",i[i.SegmentFamily=17476]="SegmentFamily",i[i.DateUTC=17505]="DateUTC",i[i.TagDefault=17540]="TagDefault",i[i.TagBinary=17541]="TagBinary",i[i.TagString=17543]="TagString",i[i.Duration=17545]="Duration",i[i.ChapterFlagEnabled=17816]="ChapterFlagEnabled",i[i.FileMimeType=18016]="FileMimeType",i[i.FileUsedStartTime=18017]="FileUsedStartTime",i[i.FileUsedEndTime=18018]="FileUsedEndTime",i[i.FileReferral=18037]="FileReferral",i[i.ContentEncodingOrder=20529]="ContentEncodingOrder",i[i.ContentEncodingScope=20530]="ContentEncodingScope",i[i.ContentEncodingType=20531]="ContentEncodingType",i[i.ContentCompression=20532]="ContentCompression",i[i.ContentEncryption=20533]="ContentEncryption",i[i.CueBlockNumber=21368]="CueBlockNumber",i[i.ChapterStringUID=22100]="ChapterStringUID",i[i.WritingApp=22337]="WritingApp",i[i.SilentTracks=22612]="SilentTracks",i[i.ContentEncoding=25152]="ContentEncoding",i[i.BitDepth=25188]="BitDepth",i[i.SignedElement=25906]="SignedElement",i[i.TrackTranslate=26148]="TrackTranslate",i[i.ChapProcessCommand=26897]="ChapProcessCommand",i[i.ChapProcessTime=26914]="ChapProcessTime",i[i.ChapterTranslate=26916]="ChapterTranslate",i[i.ChapProcessData=26931]="ChapProcessData",i[i.ChapProcess=26948]="ChapProcess",i[i.ChapProcessCodecID=26965]="ChapProcessCodecID",i[i.Tag=29555]="Tag",i[i.SegmentFilename=29572]="SegmentFilename",i[i.AttachmentLink=29766]="AttachmentLink",i[i.CodecName=2459272]="CodecName",i[i.Segment=408125543]="Segment",i[i.TagLanguage=17530]="TagLanguage",i[i.TagName=17827]="TagName",i[i.SimpleTag=26568]="SimpleTag",i[i.TagAttachmentUID=25542]="TagAttachmentUID",i[i.TagChapterUID=25540]="TagChapterUID",i[i.TagEditionUID=25545]="TagEditionUID",i[i.TagTrackUID=25541]="TagTrackUID",i[i.TargetType=25546]="TargetType",i[i.TargetTypeValue=26826]="TargetTypeValue",i[i.Targets=25536]="Targets",i[i.Tags=307544935]="Tags",i[i.ChapProcessPrivate=17677]="ChapProcessPrivate",i[i.ChapCountry=17278]="ChapCountry",i[i.ChapLanguage=17276]="ChapLanguage",i[i.ChapterTrack=143]="ChapterTrack",i[i.ChapterPhysicalEquiv=25539]="ChapterPhysicalEquiv",i[i.ChapterSegmentEditionUID=28348]="ChapterSegmentEditionUID",i[i.ChapterSegmentUID=28263]="ChapterSegmentUID",i[i.ChapterUID=29636]="ChapterUID",i[i.ChapterAtom=182]="ChapterAtom",i[i.EditionFlagOrdered=17885]="EditionFlagOrdered",i[i.EditionFlagDefault=17883]="EditionFlagDefault",i[i.EditionFlagHidden=17853]="EditionFlagHidden",i[i.EditionUID=17852]="EditionUID",i[i.EditionEntry=17849]="EditionEntry",i[i.Chapters=272869232]="Chapters",i[i.FileUID=18094]="FileUID",i[i.FileData=18012]="FileData",i[i.FileName=18030]="FileName",i[i.FileDescription=18046]="FileDescription",i[i.AttachedFile=24999]="AttachedFile",i[i.Attachments=423732329]="Attachments",i[i.CueRefCodecState=235]="CueRefCodecState",i[i.CueRefNumber=21343]="CueRefNumber",i[i.CueReference=219]="CueReference",i[i.CueCodecState=234]="CueCodecState",i[i.CueDuration=178]="CueDuration",i[i.CueRelativePosition=240]="CueRelativePosition",i[i.CueClusterPosition=241]="CueClusterPosition",i[i.CueTrack=247]="CueTrack",i[i.CueTrackPositions=183]="CueTrackPositions",i[i.CueTime=179]="CueTime",i[i.CuePoint=187]="CuePoint",i[i.Cues=475249515]="Cues",i[i.AESSettingsCipherMode=18408]="AESSettingsCipherMode",i[i.ContentEncAESSettings=18407]="ContentEncAESSettings",i[i.ContentSigHashAlgo=18406]="ContentSigHashAlgo",i[i.ContentSigAlgo=18405]="ContentSigAlgo",i[i.ContentSigKeyID=18404]="ContentSigKeyID",i[i.ContentSignature=18403]="ContentSignature",i[i.ContentEncKeyID=18402]="ContentEncKeyID",i[i.ContentEncAlgo=18401]="ContentEncAlgo",i[i.ContentEncodings=28032]="ContentEncodings",i[i.TrickMasterTrackSegmentUID=196]="TrickMasterTrackSegmentUID",i[i.TrickMasterTrackUID=199]="TrickMasterTrackUID",i[i.TrickTrackFlag=198]="TrickTrackFlag",i[i.TrickTrackSegmentUID=193]="TrickTrackSegmentUID",i[i.TrickTrackUID=192]="TrickTrackUID",i[i.TrackJoinUID=237]="TrackJoinUID",i[i.TrackJoinBlocks=233]="TrackJoinBlocks",i[i.TrackPlaneType=230]="TrackPlaneType",i[i.TrackPlaneUID=229]="TrackPlaneUID",i[i.TrackPlane=228]="TrackPlane",i[i.TrackCombinePlanes=227]="TrackCombinePlanes",i[i.TrackOperation=226]="TrackOperation",i[i.ChannelPositions=32123]="ChannelPositions",i[i.Channels=159]="Channels",i[i.OutputSamplingFrequency=30901]="OutputSamplingFrequency",i[i.SamplingFrequency=181]="SamplingFrequency",i[i.Audio=225]="Audio",i[i.FrameRate=2327523]="FrameRate",i[i.GammaValue=3126563]="GammaValue",i[i.ColourSpace=3061028]="ColourSpace",i[i.AspectRatioType=21683]="AspectRatioType",i[i.DisplayUnit=21682]="DisplayUnit",i[i.DisplayHeight=21690]="DisplayHeight",i[i.DisplayWidth=21680]="DisplayWidth",i[i.PixelCropRight=21725]="PixelCropRight",i[i.PixelCropLeft=21708]="PixelCropLeft",i[i.PixelCropTop=21691]="PixelCropTop",i[i.PixelCropBottom=21674]="PixelCropBottom",i[i.PixelHeight=186]="PixelHeight",i[i.PixelWidth=176]="PixelWidth",i[i.OldStereoMode=21433]="OldStereoMode",i[i.AlphaMode=21440]="AlphaMode",i[i.StereoMode=21432]="StereoMode",i[i.FlagInterlaced=154]="FlagInterlaced",i[i.Video=224]="Video",i[i.TrackTranslateTrackID=26277]="TrackTranslateTrackID",i[i.TrackTranslateCodec=26303]="TrackTranslateCodec",i[i.TrackTranslateEditionUID=26364]="TrackTranslateEditionUID",i[i.SeekPreRoll=22203]="SeekPreRoll",i[i.CodecDelay=22186]="CodecDelay",i[i.TrackOverlay=28587]="TrackOverlay",i[i.CodecDecodeAll=170]="CodecDecodeAll",i[i.CodecDownloadURL=2536e3]="CodecDownloadURL",i[i.CodecInfoURL=3883072]="CodecInfoURL",i[i.CodecSettings=3839639]="CodecSettings",i[i.CodecPrivate=25506]="CodecPrivate",i[i.Language=2274716]="Language",i[i.Name=21358]="Name",i[i.MaxBlockAdditionID=21998]="MaxBlockAdditionID",i[i.TrackOffset=21375]="TrackOffset",i[i.TrackTimecodeScale=2306383]="TrackTimecodeScale",i[i.DefaultDecodedFieldDuration=2313850]="DefaultDecodedFieldDuration",i[i.DefaultDuration=2352003]="DefaultDuration",i[i.MaxCache=28152]="MaxCache",i[i.MinCache=28135]="MinCache",i[i.FlagLacing=156]="FlagLacing",i[i.FlagForced=21930]="FlagForced",i[i.FlagEnabled=185]="FlagEnabled",i[i.TrackUID=29637]="TrackUID",i[i.TrackNumber=215]="TrackNumber",i[i.TrackEntry=174]="TrackEntry",i[i.Tracks=374648427]="Tracks",i[i.EncryptedBlock=175]="EncryptedBlock",i[i.ReferenceTimeCode=202]="ReferenceTimeCode",i[i.ReferenceOffset=201]="ReferenceOffset",i[i.ReferenceFrame=200]="ReferenceFrame",i[i.SliceDuration=207]="SliceDuration",i[i.Delay=206]="Delay",i[i.BlockAdditionID=203]="BlockAdditionID",i[i.FrameNumber=205]="FrameNumber",i[i.LaceNumber=204]="LaceNumber",i[i.TimeSlice=232]="TimeSlice",i[i.Slices=142]="Slices",i[i.DiscardPadding=30114]="DiscardPadding",i[i.CodecState=164]="CodecState",i[i.ReferenceVirtual=253]="ReferenceVirtual",i[i.ReferenceBlock=251]="ReferenceBlock",i[i.ReferencePriority=250]="ReferencePriority",i[i.BlockDuration=155]="BlockDuration",i[i.BlockAdditional=165]="BlockAdditional",i[i.BlockAddID=238]="BlockAddID",i[i.BlockMore=166]="BlockMore",i[i.BlockAdditions=30113]="BlockAdditions",i[i.BlockVirtual=162]="BlockVirtual",i[i.Block=161]="Block",i[i.BlockGroup=160]="BlockGroup",i[i.SimpleBlock=163]="SimpleBlock",i[i.PrevSize=171]="PrevSize",i[i.Position=167]="Position",i[i.SilentTrackNumber=22743]="SilentTrackNumber",i[i.Timecode=231]="Timecode",i[i.Cluster=524531317]="Cluster",i[i.MuxingApp=19840]="MuxingApp",i[i.Title=31657]="Title",i[i.TimecodeScaleDenominator=2807730]="TimecodeScaleDenominator",i[i.TimecodeScale=2807729]="TimecodeScale",i[i.ChapterTranslateID=27045]="ChapterTranslateID",i[i.ChapterTranslateCodec=27071]="ChapterTranslateCodec",i[i.ChapterTranslateEditionUID=27132]="ChapterTranslateEditionUID",i[i.NextFilename=4096955]="NextFilename",i[i.NextUID=4110627]="NextUID",i[i.PrevFilename=3965867]="PrevFilename",i[i.PrevUID=3979555]="PrevUID",i[i.SegmentUID=29604]="SegmentUID",i[i.Info=357149030]="Info",i[i.SeekPosition=21420]="SeekPosition",i[i.SeekID=21419]="SeekID",i[i.Seek=19899]="Seek",i[i.SeekHead=290298740]="SeekHead",i[i.SignatureElementList=32379]="SignatureElementList",i[i.SignatureElements=32347]="SignatureElements",i[i.Signature=32437]="Signature",i[i.SignaturePublicKey=32421]="SignaturePublicKey",i[i.SignatureHash=32410]="SignatureHash",i[i.SignatureAlgo=32394]="SignatureAlgo",i[i.SignatureSlot=458458727]="SignatureSlot",i[i.CRC32=191]="CRC32",i[i.Void=236]="Void",i[i.EBMLMaxSizeLength=17139]="EBMLMaxSizeLength",i[i.EBMLMaxIDLength=17138]="EBMLMaxIDLength",i[i.EBMLReadVersion=17143]="EBMLReadVersion",i[i.EBML=440786851]="EBML"},1471:(t,e)=>{"use strict";var i;Object.defineProperty(e,"__esModule",{value:!0}),(i=e.EbmlTagPosition||(e.EbmlTagPosition={}))[i.Start=0]="Start",i[i.Content=1]="Content",i[i.End=2]="End"},5016:(t,e,i)=>{"use strict";var r=i(8764).Buffer;Object.defineProperty(e,"__esModule",{value:!0});const n=i(9958),s=i(5563),o=i(5103),a=i(2090),h=i(8984);class u extends n.EbmlDataTag{constructor(t){super(t||a.EbmlTagId.Block,h.EbmlElementType.Binary)}writeTrackBuffer(){return o.Tools.writeVint(this.track)}writeValueBuffer(){let t=r.alloc(2);return t.writeInt16BE(this.value,0),t}writeFlagsBuffer(){let t=0;switch(this.invisible&&(t|=16),this.lacing){case s.BlockLacing.None:break;case s.BlockLacing.Xiph:t|=4;break;case s.BlockLacing.EBML:t|=8;break;case s.BlockLacing.FixedSize:t|=12}return r.of(t)}encodeContent(){return r.concat([this.writeTrackBuffer(),this.writeValueBuffer(),this.writeFlagsBuffer(),this.payload])}parseContent(t){const e=o.Tools.readVint(t);this.track=e.value,this.value=o.Tools.readSigned(t.subarray(e.length,e.length+2));let i=t[e.length+2];switch(this.invisible=Boolean(16&i),12&i){case 0:this.lacing=s.BlockLacing.None;break;case 4:this.lacing=s.BlockLacing.Xiph;break;case 8:this.lacing=s.BlockLacing.EBML;break;case 12:this.lacing=s.BlockLacing.FixedSize}this.payload=t.slice(e.length+3)}}e.Block=u},9958:(t,e,i)=>{"use strict";var r=i(8764).Buffer;Object.defineProperty(e,"__esModule",{value:!0});const n=i(6819),s=i(8984),o=i(5103),a=i(1471);class h extends n.EbmlTag{constructor(t,e){super(t,e,a.EbmlTagPosition.Content)}parseContent(t){switch(this.type){case s.EbmlElementType.UnsignedInt:this.data=o.Tools.readUnsigned(t);break;case s.EbmlElementType.Float:this.data=o.Tools.readFloat(t);break;case s.EbmlElementType.Integer:this.data=o.Tools.readSigned(t);break;case s.EbmlElementType.String:this.data=String.fromCharCode(...t);break;case s.EbmlElementType.UTF8:this.data=o.Tools.readUtf8(t);break;default:this.data=t}}encodeContent(){switch(this.type){case s.EbmlElementType.UnsignedInt:return o.Tools.writeUnsigned(this.data);case s.EbmlElementType.Float:return o.Tools.writeFloat(this.data);case s.EbmlElementType.Integer:return o.Tools.writeSigned(this.data);case s.EbmlElementType.String:return r.from(this.data,"ascii");case s.EbmlElementType.UTF8:return r.from(this.data,"utf8");case s.EbmlElementType.Binary:default:return this.data}}}e.EbmlDataTag=h},2785:(t,e,i)=>{"use strict";var r=i(8764).Buffer;Object.defineProperty(e,"__esModule",{value:!0});const n=i(6819),s=i(8984),o=i(1471),a=i(5103),h=i(2451);class u extends n.EbmlTag{constructor(t,e=o.EbmlTagPosition.Content){super(t,s.EbmlElementType.Master,e),this._children=[]}get Children(){return this._children}set Children(t){this._children=t}encodeContent(){return r.concat(this._children.map((t=>t.encode())))}parseContent(t){for(;t.length>0;){const e=a.Tools.readVint(t),i=a.Tools.readVint(t,e.length),r=a.Tools.readHexString(t,0,e.length),n=Number.parseInt(r,16);let s=h.EbmlTagFactory.create(n);s.size=i.value;let o=e.length+i.length+i.value;s.parseContent(t.slice(e.length+i.length,o)),this._children.push(s),t=t.slice(o)}}}e.EbmlMasterTag=u},8212:(t,e,i)=>{"use strict";var r=i(8764).Buffer;Object.defineProperty(e,"__esModule",{value:!0});const n=i(5103),s=i(5016),o=i(2090);class a extends s.Block{constructor(){super(o.EbmlTagId.SimpleBlock)}encodeContent(){let t=this.writeFlagsBuffer();return this.keyframe&&(t[0]|=128),this.discardable&&(t[0]|=1),r.concat([this.writeTrackBuffer(),this.writeValueBuffer(),t,this.payload])}parseContent(t){super.parseContent(t);let e=t[n.Tools.readVint(t).length+2];this.keyframe=Boolean(128&e),this.discardable=Boolean(1&e)}}e.SimpleBlock=a},5103:(t,e,i)=>{"use strict";var r=i(8764).Buffer;Object.defineProperty(e,"__esModule",{value:!0});class n{static readVint(t,e=0){const i=8-Math.floor(Math.log2(t[e]));if(i>8){const r=n.readHexString(t,e,e+i);throw new Error(`Unrepresentable length: ${i} ${r}`)}if(isNaN(i)||e+i>t.length)return null;if(8===i&&t[e+1]>=32&&t.subarray(e+2,e+8).some((t=>t>0)))return{length:8,value:-1};let r=t[e]&(1<<8-i)-1;for(let n=1;nMath.pow(2,53))throw new Error(`Unrepresentable value: ${t}`);let i=e;if(!i)for(i=1;i<=8&&!(tNumber(t).toString(16))).reduce(((t,e)=>`${t}${this.padStart(e)}`),"")}static readUtf8(t){try{return r.from(t).toString("utf8")}catch(t){return null}}static readUnsigned(t){const e=new DataView(t.buffer,t.byteOffset,t.byteLength);switch(t.byteLength){case 1:return e.getUint8(0);case 2:return e.getUint16(0);case 4:return e.getUint32(0)}if(t.byteLength<=6)return t.reduce(((t,e)=>256*t+e),0);var i=n.readHexString(t,0,t.byteLength),r=parseInt(i,16);return r<=Math.pow(256,6)?r:i}static writeUnsigned(t){if("string"==typeof t)return r.from(t,"hex");{var e=r.alloc(6);e.fill(0),e.writeUIntBE(t,0,6);let i=e.findIndex((t=>0!==t));return-1===i&&(i=e.length-1),e.slice(i)}}static readSigned(t){const e=new DataView(t.buffer,t.byteOffset,t.byteLength);switch(t.byteLength){case 1:return e.getInt8(0);case 2:return e.getInt16(0);case 4:return e.getInt32(0);default:return NaN}}static writeSigned(t){var e=r.alloc(8);return e.writeInt32BE(t,0),e}static readFloat(t){const e=new DataView(t.buffer,t.byteOffset,t.byteLength);switch(t.byteLength){case 4:return e.getFloat32(0);case 8:return e.getFloat64(0);default:return NaN}}static writeFloat(t){let e=r.alloc(8);return e.writeFloatBE(t,0)<=4&&(e=e.slice(0,4)),e}}e.Tools=n},6266:(t,e,i)=>{"use strict";var r=e;r.version=i(8597).i8,r.utils=i(953),r.rand=i(9931),r.curve=i(8254),r.curves=i(5427),r.ec=i(7954),r.eddsa=i(5980)},4918:(t,e,i)=>{"use strict";var r=i(3785),n=i(953),s=n.getNAF,o=n.getJSF,a=n.assert;function h(t,e){this.type=t,this.p=new r(e.p,16),this.red=e.prime?r.red(e.prime):r.mont(this.p),this.zero=new r(0).toRed(this.red),this.one=new r(1).toRed(this.red),this.two=new r(2).toRed(this.red),this.n=e.n&&new r(e.n,16),this.g=e.g&&this.pointFromJSON(e.g,e.gRed),this._wnafT1=new Array(4),this._wnafT2=new Array(4),this._wnafT3=new Array(4),this._wnafT4=new Array(4),this._bitLength=this.n?this.n.bitLength():0;var i=this.n&&this.p.div(this.n);!i||i.cmpn(100)>0?this.redN=null:(this._maxwellTrick=!0,this.redN=this.n.toRed(this.red))}function u(t,e){this.curve=t,this.type=e,this.precomputed=null}t.exports=h,h.prototype.point=function(){throw new Error("Not implemented")},h.prototype.validate=function(){throw new Error("Not implemented")},h.prototype._fixedNafMul=function(t,e){a(t.precomputed);var i=t._getDoubles(),r=s(e,1,this._bitLength),n=(1<=o;l--)h=(h<<1)+r[l];u.push(h)}for(var c=this.jpoint(null,null,null),d=this.jpoint(null,null,null),f=n;f>0;f--){for(o=0;o=0;u--){for(var l=0;u>=0&&0===o[u];u--)l++;if(u>=0&&l++,h=h.dblp(l),u<0)break;var c=o[u];a(0!==c),h="affine"===t.type?c>0?h.mixedAdd(n[c-1>>1]):h.mixedAdd(n[-c-1>>1].neg()):c>0?h.add(n[c-1>>1]):h.add(n[-c-1>>1].neg())}return"affine"===t.type?h.toP():h},h.prototype._wnafMulAdd=function(t,e,i,r,n){var a,h,u,l=this._wnafT1,c=this._wnafT2,d=this._wnafT3,f=0;for(a=0;a=1;a-=2){var m=a-1,g=a;if(1===l[m]&&1===l[g]){var b=[e[m],null,null,e[g]];0===e[m].y.cmp(e[g].y)?(b[1]=e[m].add(e[g]),b[2]=e[m].toJ().mixedAdd(e[g].neg())):0===e[m].y.cmp(e[g].y.redNeg())?(b[1]=e[m].toJ().mixedAdd(e[g]),b[2]=e[m].add(e[g].neg())):(b[1]=e[m].toJ().mixedAdd(e[g]),b[2]=e[m].toJ().mixedAdd(e[g].neg()));var v=[-3,-1,-5,-7,0,7,5,1,3],y=o(i[m],i[g]);for(f=Math.max(y[0].length,f),d[m]=new Array(f),d[g]=new Array(f),h=0;h=0;a--){for(var x=0;a>=0;){var E=!0;for(h=0;h=0&&x++,M=M.dblp(x),a<0)break;for(h=0;h0?u=c[h][S-1>>1]:S<0&&(u=c[h][-S-1>>1].neg()),M="affine"===u.type?M.mixedAdd(u):M.add(u))}}for(a=0;a=Math.ceil((t.bitLength()+1)/e.step)},u.prototype._getDoubles=function(t,e){if(this.precomputed&&this.precomputed.doubles)return this.precomputed.doubles;for(var i=[this],r=this,n=0;n{"use strict";var r=i(953),n=i(3785),s=i(5717),o=i(4918),a=r.assert;function h(t){this.twisted=1!=(0|t.a),this.mOneA=this.twisted&&-1==(0|t.a),this.extended=this.mOneA,o.call(this,"edwards",t),this.a=new n(t.a,16).umod(this.red.m),this.a=this.a.toRed(this.red),this.c=new n(t.c,16).toRed(this.red),this.c2=this.c.redSqr(),this.d=new n(t.d,16).toRed(this.red),this.dd=this.d.redAdd(this.d),a(!this.twisted||0===this.c.fromRed().cmpn(1)),this.oneC=1==(0|t.c)}function u(t,e,i,r,s){o.BasePoint.call(this,t,"projective"),null===e&&null===i&&null===r?(this.x=this.curve.zero,this.y=this.curve.one,this.z=this.curve.one,this.t=this.curve.zero,this.zOne=!0):(this.x=new n(e,16),this.y=new n(i,16),this.z=r?new n(r,16):this.curve.one,this.t=s&&new n(s,16),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)),this.t&&!this.t.red&&(this.t=this.t.toRed(this.curve.red)),this.zOne=this.z===this.curve.one,this.curve.extended&&!this.t&&(this.t=this.x.redMul(this.y),this.zOne||(this.t=this.t.redMul(this.z.redInvm()))))}s(h,o),t.exports=h,h.prototype._mulA=function(t){return this.mOneA?t.redNeg():this.a.redMul(t)},h.prototype._mulC=function(t){return this.oneC?t:this.c.redMul(t)},h.prototype.jpoint=function(t,e,i,r){return this.point(t,e,i,r)},h.prototype.pointFromX=function(t,e){(t=new n(t,16)).red||(t=t.toRed(this.red));var i=t.redSqr(),r=this.c2.redSub(this.a.redMul(i)),s=this.one.redSub(this.c2.redMul(this.d).redMul(i)),o=r.redMul(s.redInvm()),a=o.redSqrt();if(0!==a.redSqr().redSub(o).cmp(this.zero))throw new Error("invalid point");var h=a.fromRed().isOdd();return(e&&!h||!e&&h)&&(a=a.redNeg()),this.point(t,a)},h.prototype.pointFromY=function(t,e){(t=new n(t,16)).red||(t=t.toRed(this.red));var i=t.redSqr(),r=i.redSub(this.c2),s=i.redMul(this.d).redMul(this.c2).redSub(this.a),o=r.redMul(s.redInvm());if(0===o.cmp(this.zero)){if(e)throw new Error("invalid point");return this.point(this.zero,t)}var a=o.redSqrt();if(0!==a.redSqr().redSub(o).cmp(this.zero))throw new Error("invalid point");return a.fromRed().isOdd()!==e&&(a=a.redNeg()),this.point(a,t)},h.prototype.validate=function(t){if(t.isInfinity())return!0;t.normalize();var e=t.x.redSqr(),i=t.y.redSqr(),r=e.redMul(this.a).redAdd(i),n=this.c2.redMul(this.one.redAdd(this.d.redMul(e).redMul(i)));return 0===r.cmp(n)},s(u,o.BasePoint),h.prototype.pointFromJSON=function(t){return u.fromJSON(this,t)},h.prototype.point=function(t,e,i,r){return new u(this,t,e,i,r)},u.fromJSON=function(t,e){return new u(t,e[0],e[1],e[2])},u.prototype.inspect=function(){return this.isInfinity()?"":""},u.prototype.isInfinity=function(){return 0===this.x.cmpn(0)&&(0===this.y.cmp(this.z)||this.zOne&&0===this.y.cmp(this.curve.c))},u.prototype._extDbl=function(){var t=this.x.redSqr(),e=this.y.redSqr(),i=this.z.redSqr();i=i.redIAdd(i);var r=this.curve._mulA(t),n=this.x.redAdd(this.y).redSqr().redISub(t).redISub(e),s=r.redAdd(e),o=s.redSub(i),a=r.redSub(e),h=n.redMul(o),u=s.redMul(a),l=n.redMul(a),c=o.redMul(s);return this.curve.point(h,u,c,l)},u.prototype._projDbl=function(){var t,e,i,r,n,s,o=this.x.redAdd(this.y).redSqr(),a=this.x.redSqr(),h=this.y.redSqr();if(this.curve.twisted){var u=(r=this.curve._mulA(a)).redAdd(h);this.zOne?(t=o.redSub(a).redSub(h).redMul(u.redSub(this.curve.two)),e=u.redMul(r.redSub(h)),i=u.redSqr().redSub(u).redSub(u)):(n=this.z.redSqr(),s=u.redSub(n).redISub(n),t=o.redSub(a).redISub(h).redMul(s),e=u.redMul(r.redSub(h)),i=u.redMul(s))}else r=a.redAdd(h),n=this.curve._mulC(this.z).redSqr(),s=r.redSub(n).redSub(n),t=this.curve._mulC(o.redISub(r)).redMul(s),e=this.curve._mulC(r).redMul(a.redISub(h)),i=r.redMul(s);return this.curve.point(t,e,i)},u.prototype.dbl=function(){return this.isInfinity()?this:this.curve.extended?this._extDbl():this._projDbl()},u.prototype._extAdd=function(t){var e=this.y.redSub(this.x).redMul(t.y.redSub(t.x)),i=this.y.redAdd(this.x).redMul(t.y.redAdd(t.x)),r=this.t.redMul(this.curve.dd).redMul(t.t),n=this.z.redMul(t.z.redAdd(t.z)),s=i.redSub(e),o=n.redSub(r),a=n.redAdd(r),h=i.redAdd(e),u=s.redMul(o),l=a.redMul(h),c=s.redMul(h),d=o.redMul(a);return this.curve.point(u,l,d,c)},u.prototype._projAdd=function(t){var e,i,r=this.z.redMul(t.z),n=r.redSqr(),s=this.x.redMul(t.x),o=this.y.redMul(t.y),a=this.curve.d.redMul(s).redMul(o),h=n.redSub(a),u=n.redAdd(a),l=this.x.redAdd(this.y).redMul(t.x.redAdd(t.y)).redISub(s).redISub(o),c=r.redMul(h).redMul(l);return this.curve.twisted?(e=r.redMul(u).redMul(o.redSub(this.curve._mulA(s))),i=h.redMul(u)):(e=r.redMul(u).redMul(o.redSub(s)),i=this.curve._mulC(h).redMul(u)),this.curve.point(c,e,i)},u.prototype.add=function(t){return this.isInfinity()?t:t.isInfinity()?this:this.curve.extended?this._extAdd(t):this._projAdd(t)},u.prototype.mul=function(t){return this._hasDoubles(t)?this.curve._fixedNafMul(this,t):this.curve._wnafMul(this,t)},u.prototype.mulAdd=function(t,e,i){return this.curve._wnafMulAdd(1,[this,e],[t,i],2,!1)},u.prototype.jmulAdd=function(t,e,i){return this.curve._wnafMulAdd(1,[this,e],[t,i],2,!0)},u.prototype.normalize=function(){if(this.zOne)return this;var t=this.z.redInvm();return this.x=this.x.redMul(t),this.y=this.y.redMul(t),this.t&&(this.t=this.t.redMul(t)),this.z=this.curve.one,this.zOne=!0,this},u.prototype.neg=function(){return this.curve.point(this.x.redNeg(),this.y,this.z,this.t&&this.t.redNeg())},u.prototype.getX=function(){return this.normalize(),this.x.fromRed()},u.prototype.getY=function(){return this.normalize(),this.y.fromRed()},u.prototype.eq=function(t){return this===t||0===this.getX().cmp(t.getX())&&0===this.getY().cmp(t.getY())},u.prototype.eqXToP=function(t){var e=t.toRed(this.curve.red).redMul(this.z);if(0===this.x.cmp(e))return!0;for(var i=t.clone(),r=this.curve.redN.redMul(this.z);;){if(i.iadd(this.curve.n),i.cmp(this.curve.p)>=0)return!1;if(e.redIAdd(r),0===this.x.cmp(e))return!0}},u.prototype.toP=u.prototype.normalize,u.prototype.mixedAdd=u.prototype.add},8254:(t,e,i)=>{"use strict";var r=e;r.base=i(4918),r.short=i(6673),r.mont=i(2881),r.edwards=i(1138)},2881:(t,e,i)=>{"use strict";var r=i(3785),n=i(5717),s=i(4918),o=i(953);function a(t){s.call(this,"mont",t),this.a=new r(t.a,16).toRed(this.red),this.b=new r(t.b,16).toRed(this.red),this.i4=new r(4).toRed(this.red).redInvm(),this.two=new r(2).toRed(this.red),this.a24=this.i4.redMul(this.a.redAdd(this.two))}function h(t,e,i){s.BasePoint.call(this,t,"projective"),null===e&&null===i?(this.x=this.curve.one,this.z=this.curve.zero):(this.x=new r(e,16),this.z=new r(i,16),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)))}n(a,s),t.exports=a,a.prototype.validate=function(t){var e=t.normalize().x,i=e.redSqr(),r=i.redMul(e).redAdd(i.redMul(this.a)).redAdd(e);return 0===r.redSqrt().redSqr().cmp(r)},n(h,s.BasePoint),a.prototype.decodePoint=function(t,e){return this.point(o.toArray(t,e),1)},a.prototype.point=function(t,e){return new h(this,t,e)},a.prototype.pointFromJSON=function(t){return h.fromJSON(this,t)},h.prototype.precompute=function(){},h.prototype._encode=function(){return this.getX().toArray("be",this.curve.p.byteLength())},h.fromJSON=function(t,e){return new h(t,e[0],e[1]||t.one)},h.prototype.inspect=function(){return this.isInfinity()?"":""},h.prototype.isInfinity=function(){return 0===this.z.cmpn(0)},h.prototype.dbl=function(){var t=this.x.redAdd(this.z).redSqr(),e=this.x.redSub(this.z).redSqr(),i=t.redSub(e),r=t.redMul(e),n=i.redMul(e.redAdd(this.curve.a24.redMul(i)));return this.curve.point(r,n)},h.prototype.add=function(){throw new Error("Not supported on Montgomery curve")},h.prototype.diffAdd=function(t,e){var i=this.x.redAdd(this.z),r=this.x.redSub(this.z),n=t.x.redAdd(t.z),s=t.x.redSub(t.z).redMul(i),o=n.redMul(r),a=e.z.redMul(s.redAdd(o).redSqr()),h=e.x.redMul(s.redISub(o).redSqr());return this.curve.point(a,h)},h.prototype.mul=function(t){for(var e=t.clone(),i=this,r=this.curve.point(null,null),n=[];0!==e.cmpn(0);e.iushrn(1))n.push(e.andln(1));for(var s=n.length-1;s>=0;s--)0===n[s]?(i=i.diffAdd(r,this),r=r.dbl()):(r=i.diffAdd(r,this),i=i.dbl());return r},h.prototype.mulAdd=function(){throw new Error("Not supported on Montgomery curve")},h.prototype.jumlAdd=function(){throw new Error("Not supported on Montgomery curve")},h.prototype.eq=function(t){return 0===this.getX().cmp(t.getX())},h.prototype.normalize=function(){return this.x=this.x.redMul(this.z.redInvm()),this.z=this.curve.one,this},h.prototype.getX=function(){return this.normalize(),this.x.fromRed()}},6673:(t,e,i)=>{"use strict";var r=i(953),n=i(3785),s=i(5717),o=i(4918),a=r.assert;function h(t){o.call(this,"short",t),this.a=new n(t.a,16).toRed(this.red),this.b=new n(t.b,16).toRed(this.red),this.tinv=this.two.redInvm(),this.zeroA=0===this.a.fromRed().cmpn(0),this.threeA=0===this.a.fromRed().sub(this.p).cmpn(-3),this.endo=this._getEndomorphism(t),this._endoWnafT1=new Array(4),this._endoWnafT2=new Array(4)}function u(t,e,i,r){o.BasePoint.call(this,t,"affine"),null===e&&null===i?(this.x=null,this.y=null,this.inf=!0):(this.x=new n(e,16),this.y=new n(i,16),r&&(this.x.forceRed(this.curve.red),this.y.forceRed(this.curve.red)),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.inf=!1)}function l(t,e,i,r){o.BasePoint.call(this,t,"jacobian"),null===e&&null===i&&null===r?(this.x=this.curve.one,this.y=this.curve.one,this.z=new n(0)):(this.x=new n(e,16),this.y=new n(i,16),this.z=new n(r,16)),this.x.red||(this.x=this.x.toRed(this.curve.red)),this.y.red||(this.y=this.y.toRed(this.curve.red)),this.z.red||(this.z=this.z.toRed(this.curve.red)),this.zOne=this.z===this.curve.one}s(h,o),t.exports=h,h.prototype._getEndomorphism=function(t){if(this.zeroA&&this.g&&this.n&&1===this.p.modn(3)){var e,i;if(t.beta)e=new n(t.beta,16).toRed(this.red);else{var r=this._getEndoRoots(this.p);e=(e=r[0].cmp(r[1])<0?r[0]:r[1]).toRed(this.red)}if(t.lambda)i=new n(t.lambda,16);else{var s=this._getEndoRoots(this.n);0===this.g.mul(s[0]).x.cmp(this.g.x.redMul(e))?i=s[0]:(i=s[1],a(0===this.g.mul(i).x.cmp(this.g.x.redMul(e))))}return{beta:e,lambda:i,basis:t.basis?t.basis.map((function(t){return{a:new n(t.a,16),b:new n(t.b,16)}})):this._getEndoBasis(i)}}},h.prototype._getEndoRoots=function(t){var e=t===this.p?this.red:n.mont(t),i=new n(2).toRed(e).redInvm(),r=i.redNeg(),s=new n(3).toRed(e).redNeg().redSqrt().redMul(i);return[r.redAdd(s).fromRed(),r.redSub(s).fromRed()]},h.prototype._getEndoBasis=function(t){for(var e,i,r,s,o,a,h,u,l,c=this.n.ushrn(Math.floor(this.n.bitLength()/2)),d=t,f=this.n.clone(),p=new n(1),m=new n(0),g=new n(0),b=new n(1),v=0;0!==d.cmpn(0);){var y=f.div(d);u=f.sub(y.mul(d)),l=g.sub(y.mul(p));var w=b.sub(y.mul(m));if(!r&&u.cmp(c)<0)e=h.neg(),i=p,r=u.neg(),s=l;else if(r&&2==++v)break;h=u,f=d,d=u,g=p,p=l,b=m,m=w}o=u.neg(),a=l;var _=r.sqr().add(s.sqr());return o.sqr().add(a.sqr()).cmp(_)>=0&&(o=e,a=i),r.negative&&(r=r.neg(),s=s.neg()),o.negative&&(o=o.neg(),a=a.neg()),[{a:r,b:s},{a:o,b:a}]},h.prototype._endoSplit=function(t){var e=this.endo.basis,i=e[0],r=e[1],n=r.b.mul(t).divRound(this.n),s=i.b.neg().mul(t).divRound(this.n),o=n.mul(i.a),a=s.mul(r.a),h=n.mul(i.b),u=s.mul(r.b);return{k1:t.sub(o).sub(a),k2:h.add(u).neg()}},h.prototype.pointFromX=function(t,e){(t=new n(t,16)).red||(t=t.toRed(this.red));var i=t.redSqr().redMul(t).redIAdd(t.redMul(this.a)).redIAdd(this.b),r=i.redSqrt();if(0!==r.redSqr().redSub(i).cmp(this.zero))throw new Error("invalid point");var s=r.fromRed().isOdd();return(e&&!s||!e&&s)&&(r=r.redNeg()),this.point(t,r)},h.prototype.validate=function(t){if(t.inf)return!0;var e=t.x,i=t.y,r=this.a.redMul(e),n=e.redSqr().redMul(e).redIAdd(r).redIAdd(this.b);return 0===i.redSqr().redISub(n).cmpn(0)},h.prototype._endoWnafMulAdd=function(t,e,i){for(var r=this._endoWnafT1,n=this._endoWnafT2,s=0;s":""},u.prototype.isInfinity=function(){return this.inf},u.prototype.add=function(t){if(this.inf)return t;if(t.inf)return this;if(this.eq(t))return this.dbl();if(this.neg().eq(t))return this.curve.point(null,null);if(0===this.x.cmp(t.x))return this.curve.point(null,null);var e=this.y.redSub(t.y);0!==e.cmpn(0)&&(e=e.redMul(this.x.redSub(t.x).redInvm()));var i=e.redSqr().redISub(this.x).redISub(t.x),r=e.redMul(this.x.redSub(i)).redISub(this.y);return this.curve.point(i,r)},u.prototype.dbl=function(){if(this.inf)return this;var t=this.y.redAdd(this.y);if(0===t.cmpn(0))return this.curve.point(null,null);var e=this.curve.a,i=this.x.redSqr(),r=t.redInvm(),n=i.redAdd(i).redIAdd(i).redIAdd(e).redMul(r),s=n.redSqr().redISub(this.x.redAdd(this.x)),o=n.redMul(this.x.redSub(s)).redISub(this.y);return this.curve.point(s,o)},u.prototype.getX=function(){return this.x.fromRed()},u.prototype.getY=function(){return this.y.fromRed()},u.prototype.mul=function(t){return t=new n(t,16),this.isInfinity()?this:this._hasDoubles(t)?this.curve._fixedNafMul(this,t):this.curve.endo?this.curve._endoWnafMulAdd([this],[t]):this.curve._wnafMul(this,t)},u.prototype.mulAdd=function(t,e,i){var r=[this,e],n=[t,i];return this.curve.endo?this.curve._endoWnafMulAdd(r,n):this.curve._wnafMulAdd(1,r,n,2)},u.prototype.jmulAdd=function(t,e,i){var r=[this,e],n=[t,i];return this.curve.endo?this.curve._endoWnafMulAdd(r,n,!0):this.curve._wnafMulAdd(1,r,n,2,!0)},u.prototype.eq=function(t){return this===t||this.inf===t.inf&&(this.inf||0===this.x.cmp(t.x)&&0===this.y.cmp(t.y))},u.prototype.neg=function(t){if(this.inf)return this;var e=this.curve.point(this.x,this.y.redNeg());if(t&&this.precomputed){var i=this.precomputed,r=function(t){return t.neg()};e.precomputed={naf:i.naf&&{wnd:i.naf.wnd,points:i.naf.points.map(r)},doubles:i.doubles&&{step:i.doubles.step,points:i.doubles.points.map(r)}}}return e},u.prototype.toJ=function(){return this.inf?this.curve.jpoint(null,null,null):this.curve.jpoint(this.x,this.y,this.curve.one)},s(l,o.BasePoint),h.prototype.jpoint=function(t,e,i){return new l(this,t,e,i)},l.prototype.toP=function(){if(this.isInfinity())return this.curve.point(null,null);var t=this.z.redInvm(),e=t.redSqr(),i=this.x.redMul(e),r=this.y.redMul(e).redMul(t);return this.curve.point(i,r)},l.prototype.neg=function(){return this.curve.jpoint(this.x,this.y.redNeg(),this.z)},l.prototype.add=function(t){if(this.isInfinity())return t;if(t.isInfinity())return this;var e=t.z.redSqr(),i=this.z.redSqr(),r=this.x.redMul(e),n=t.x.redMul(i),s=this.y.redMul(e.redMul(t.z)),o=t.y.redMul(i.redMul(this.z)),a=r.redSub(n),h=s.redSub(o);if(0===a.cmpn(0))return 0!==h.cmpn(0)?this.curve.jpoint(null,null,null):this.dbl();var u=a.redSqr(),l=u.redMul(a),c=r.redMul(u),d=h.redSqr().redIAdd(l).redISub(c).redISub(c),f=h.redMul(c.redISub(d)).redISub(s.redMul(l)),p=this.z.redMul(t.z).redMul(a);return this.curve.jpoint(d,f,p)},l.prototype.mixedAdd=function(t){if(this.isInfinity())return t.toJ();if(t.isInfinity())return this;var e=this.z.redSqr(),i=this.x,r=t.x.redMul(e),n=this.y,s=t.y.redMul(e).redMul(this.z),o=i.redSub(r),a=n.redSub(s);if(0===o.cmpn(0))return 0!==a.cmpn(0)?this.curve.jpoint(null,null,null):this.dbl();var h=o.redSqr(),u=h.redMul(o),l=i.redMul(h),c=a.redSqr().redIAdd(u).redISub(l).redISub(l),d=a.redMul(l.redISub(c)).redISub(n.redMul(u)),f=this.z.redMul(o);return this.curve.jpoint(c,d,f)},l.prototype.dblp=function(t){if(0===t)return this;if(this.isInfinity())return this;if(!t)return this.dbl();var e;if(this.curve.zeroA||this.curve.threeA){var i=this;for(e=0;e=0)return!1;if(i.redIAdd(n),0===this.x.cmp(i))return!0}},l.prototype.inspect=function(){return this.isInfinity()?"":""},l.prototype.isInfinity=function(){return 0===this.z.cmpn(0)}},5427:(t,e,i)=>{"use strict";var r,n=e,s=i(3715),o=i(8254),a=i(953).assert;function h(t){"short"===t.type?this.curve=new o.short(t):"edwards"===t.type?this.curve=new o.edwards(t):this.curve=new o.mont(t),this.g=this.curve.g,this.n=this.curve.n,this.hash=t.hash,a(this.g.validate(),"Invalid curve"),a(this.g.mul(this.n).isInfinity(),"Invalid curve, G*N != O")}function u(t,e){Object.defineProperty(n,t,{configurable:!0,enumerable:!0,get:function(){var i=new h(e);return Object.defineProperty(n,t,{configurable:!0,enumerable:!0,value:i}),i}})}n.PresetCurve=h,u("p192",{type:"short",prime:"p192",p:"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff",a:"ffffffff ffffffff ffffffff fffffffe ffffffff fffffffc",b:"64210519 e59c80e7 0fa7e9ab 72243049 feb8deec c146b9b1",n:"ffffffff ffffffff ffffffff 99def836 146bc9b1 b4d22831",hash:s.sha256,gRed:!1,g:["188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012","07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811"]}),u("p224",{type:"short",prime:"p224",p:"ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001",a:"ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff fffffffe",b:"b4050a85 0c04b3ab f5413256 5044b0b7 d7bfd8ba 270b3943 2355ffb4",n:"ffffffff ffffffff ffffffff ffff16a2 e0b8f03e 13dd2945 5c5c2a3d",hash:s.sha256,gRed:!1,g:["b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21","bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34"]}),u("p256",{type:"short",prime:null,p:"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff ffffffff",a:"ffffffff 00000001 00000000 00000000 00000000 ffffffff ffffffff fffffffc",b:"5ac635d8 aa3a93e7 b3ebbd55 769886bc 651d06b0 cc53b0f6 3bce3c3e 27d2604b",n:"ffffffff 00000000 ffffffff ffffffff bce6faad a7179e84 f3b9cac2 fc632551",hash:s.sha256,gRed:!1,g:["6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296","4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5"]}),u("p384",{type:"short",prime:null,p:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 ffffffff",a:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe ffffffff 00000000 00000000 fffffffc",b:"b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f 5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef",n:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 f4372ddf 581a0db2 48b0a77a ecec196a ccc52973",hash:s.sha384,gRed:!1,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"]}),u("p521",{type:"short",prime:null,p:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff",a:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffc",b:"00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b 99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd 3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00",n:"000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409",hash:s.sha512,gRed:!1,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"]}),u("curve25519",{type:"mont",prime:"p25519",p:"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed",a:"76d06",b:"1",n:"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed",hash:s.sha256,gRed:!1,g:["9"]}),u("ed25519",{type:"edwards",prime:"p25519",p:"7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed",a:"-1",c:"1",d:"52036cee2b6ffe73 8cc740797779e898 00700a4d4141d8ab 75eb4dca135978a3",n:"1000000000000000 0000000000000000 14def9dea2f79cd6 5812631a5cf5d3ed",hash:s.sha256,gRed:!1,g:["216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a","6666666666666666666666666666666666666666666666666666666666666658"]});try{r=i(1037)}catch(t){r=void 0}u("secp256k1",{type:"short",prime:"k256",p:"ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f",a:"0",b:"7",n:"ffffffff ffffffff ffffffff fffffffe baaedce6 af48a03b bfd25e8c d0364141",h:"1",hash:s.sha256,beta:"7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee",lambda:"5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72",basis:[{a:"3086d221a7d46bcde86c90e49284eb15",b:"-e4437ed6010e88286f547fa90abfe4c3"},{a:"114ca50f7a8e2f3f657c1108d9d44cfd8",b:"3086d221a7d46bcde86c90e49284eb15"}],gRed:!1,g:["79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798","483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8",r]})},7954:(t,e,i)=>{"use strict";var r=i(3785),n=i(2156),s=i(953),o=i(5427),a=i(9931),h=s.assert,u=i(1251),l=i(611);function c(t){if(!(this instanceof c))return new c(t);"string"==typeof t&&(h(Object.prototype.hasOwnProperty.call(o,t),"Unknown curve "+t),t=o[t]),t instanceof o.PresetCurve&&(t={curve:t}),this.curve=t.curve.curve,this.n=this.curve.n,this.nh=this.n.ushrn(1),this.g=this.curve.g,this.g=t.curve.g,this.g.precompute(t.curve.n.bitLength()+1),this.hash=t.hash||t.curve.hash}t.exports=c,c.prototype.keyPair=function(t){return new u(this,t)},c.prototype.keyFromPrivate=function(t,e){return u.fromPrivate(this,t,e)},c.prototype.keyFromPublic=function(t,e){return u.fromPublic(this,t,e)},c.prototype.genKeyPair=function(t){t||(t={});for(var e=new n({hash:this.hash,pers:t.pers,persEnc:t.persEnc||"utf8",entropy:t.entropy||a(this.hash.hmacStrength),entropyEnc:t.entropy&&t.entropyEnc||"utf8",nonce:this.n.toArray()}),i=this.n.byteLength(),s=this.n.sub(new r(2));;){var o=new r(e.generate(i));if(!(o.cmp(s)>0))return o.iaddn(1),this.keyFromPrivate(o)}},c.prototype._truncateToN=function(t,e){var i=8*t.byteLength()-this.n.bitLength();return i>0&&(t=t.ushrn(i)),!e&&t.cmp(this.n)>=0?t.sub(this.n):t},c.prototype.sign=function(t,e,i,s){"object"==typeof i&&(s=i,i=null),s||(s={}),e=this.keyFromPrivate(e,i),t=this._truncateToN(new r(t,16));for(var o=this.n.byteLength(),a=e.getPrivate().toArray("be",o),h=t.toArray("be",o),u=new n({hash:this.hash,entropy:a,nonce:h,pers:s.pers,persEnc:s.persEnc||"utf8"}),c=this.n.sub(new r(1)),d=0;;d++){var f=s.k?s.k(d):new r(u.generate(this.n.byteLength()));if(!((f=this._truncateToN(f,!0)).cmpn(1)<=0||f.cmp(c)>=0)){var p=this.g.mul(f);if(!p.isInfinity()){var m=p.getX(),g=m.umod(this.n);if(0!==g.cmpn(0)){var b=f.invm(this.n).mul(g.mul(e.getPrivate()).iadd(t));if(0!==(b=b.umod(this.n)).cmpn(0)){var v=(p.getY().isOdd()?1:0)|(0!==m.cmp(g)?2:0);return s.canonical&&b.cmp(this.nh)>0&&(b=this.n.sub(b),v^=1),new l({r:g,s:b,recoveryParam:v})}}}}}},c.prototype.verify=function(t,e,i,n){t=this._truncateToN(new r(t,16)),i=this.keyFromPublic(i,n);var s=(e=new l(e,"hex")).r,o=e.s;if(s.cmpn(1)<0||s.cmp(this.n)>=0)return!1;if(o.cmpn(1)<0||o.cmp(this.n)>=0)return!1;var a,h=o.invm(this.n),u=h.mul(t).umod(this.n),c=h.mul(s).umod(this.n);return this.curve._maxwellTrick?!(a=this.g.jmulAdd(u,i.getPublic(),c)).isInfinity()&&a.eqXToP(s):!(a=this.g.mulAdd(u,i.getPublic(),c)).isInfinity()&&0===a.getX().umod(this.n).cmp(s)},c.prototype.recoverPubKey=function(t,e,i,n){h((3&i)===i,"The recovery param is more than two bits"),e=new l(e,n);var s=this.n,o=new r(t),a=e.r,u=e.s,c=1&i,d=i>>1;if(a.cmp(this.curve.p.umod(this.curve.n))>=0&&d)throw new Error("Unable to find sencond key candinate");a=d?this.curve.pointFromX(a.add(this.curve.n),c):this.curve.pointFromX(a,c);var f=e.r.invm(s),p=s.sub(o).mul(f).umod(s),m=u.mul(f).umod(s);return this.g.mulAdd(p,a,m)},c.prototype.getKeyRecoveryParam=function(t,e,i,r){if(null!==(e=new l(e,r)).recoveryParam)return e.recoveryParam;for(var n=0;n<4;n++){var s;try{s=this.recoverPubKey(t,e,n)}catch(t){continue}if(s.eq(i))return n}throw new Error("Unable to find valid recovery factor")}},1251:(t,e,i)=>{"use strict";var r=i(3785),n=i(953).assert;function s(t,e){this.ec=t,this.priv=null,this.pub=null,e.priv&&this._importPrivate(e.priv,e.privEnc),e.pub&&this._importPublic(e.pub,e.pubEnc)}t.exports=s,s.fromPublic=function(t,e,i){return e instanceof s?e:new s(t,{pub:e,pubEnc:i})},s.fromPrivate=function(t,e,i){return e instanceof s?e:new s(t,{priv:e,privEnc:i})},s.prototype.validate=function(){var t=this.getPublic();return t.isInfinity()?{result:!1,reason:"Invalid public key"}:t.validate()?t.mul(this.ec.curve.n).isInfinity()?{result:!0,reason:null}:{result:!1,reason:"Public key * N != O"}:{result:!1,reason:"Public key is not a point"}},s.prototype.getPublic=function(t,e){return"string"==typeof t&&(e=t,t=null),this.pub||(this.pub=this.ec.g.mul(this.priv)),e?this.pub.encode(e,t):this.pub},s.prototype.getPrivate=function(t){return"hex"===t?this.priv.toString(16,2):this.priv},s.prototype._importPrivate=function(t,e){this.priv=new r(t,e||16),this.priv=this.priv.umod(this.ec.curve.n)},s.prototype._importPublic=function(t,e){if(t.x||t.y)return"mont"===this.ec.curve.type?n(t.x,"Need x coordinate"):"short"!==this.ec.curve.type&&"edwards"!==this.ec.curve.type||n(t.x&&t.y,"Need both x and y coordinate"),void(this.pub=this.ec.curve.point(t.x,t.y));this.pub=this.ec.curve.decodePoint(t,e)},s.prototype.derive=function(t){return t.validate()||n(t.validate(),"public point not validated"),t.mul(this.priv).getX()},s.prototype.sign=function(t,e,i){return this.ec.sign(t,this,e,i)},s.prototype.verify=function(t,e){return this.ec.verify(t,e,this)},s.prototype.inspect=function(){return""}},611:(t,e,i)=>{"use strict";var r=i(3785),n=i(953),s=n.assert;function o(t,e){if(t instanceof o)return t;this._importDER(t,e)||(s(t.r&&t.s,"Signature without r or s"),this.r=new r(t.r,16),this.s=new r(t.s,16),void 0===t.recoveryParam?this.recoveryParam=null:this.recoveryParam=t.recoveryParam)}function a(){this.place=0}function h(t,e){var i=t[e.place++];if(!(128&i))return i;var r=15&i;if(0===r||r>4)return!1;for(var n=0,s=0,o=e.place;s>>=0;return!(n<=127)&&(e.place=o,n)}function u(t){for(var e=0,i=t.length-1;!t[e]&&!(128&t[e+1])&&e>>3);for(t.push(128|i);--i;)t.push(e>>>(i<<3)&255);t.push(e)}}t.exports=o,o.prototype._importDER=function(t,e){t=n.toArray(t,e);var i=new a;if(48!==t[i.place++])return!1;var s=h(t,i);if(!1===s)return!1;if(s+i.place!==t.length)return!1;if(2!==t[i.place++])return!1;var o=h(t,i);if(!1===o)return!1;var u=t.slice(i.place,o+i.place);if(i.place+=o,2!==t[i.place++])return!1;var l=h(t,i);if(!1===l)return!1;if(t.length!==l+i.place)return!1;var c=t.slice(i.place,l+i.place);if(0===u[0]){if(!(128&u[1]))return!1;u=u.slice(1)}if(0===c[0]){if(!(128&c[1]))return!1;c=c.slice(1)}return this.r=new r(u),this.s=new r(c),this.recoveryParam=null,!0},o.prototype.toDER=function(t){var e=this.r.toArray(),i=this.s.toArray();for(128&e[0]&&(e=[0].concat(e)),128&i[0]&&(i=[0].concat(i)),e=u(e),i=u(i);!(i[0]||128&i[1]);)i=i.slice(1);var r=[2];l(r,e.length),(r=r.concat(e)).push(2),l(r,i.length);var s=r.concat(i),o=[48];return l(o,s.length),o=o.concat(s),n.encode(o,t)}},5980:(t,e,i)=>{"use strict";var r=i(3715),n=i(5427),s=i(953),o=s.assert,a=s.parseBytes,h=i(9087),u=i(3622);function l(t){if(o("ed25519"===t,"only tested with ed25519 so far"),!(this instanceof l))return new l(t);t=n[t].curve,this.curve=t,this.g=t.g,this.g.precompute(t.n.bitLength()+1),this.pointClass=t.point().constructor,this.encodingLength=Math.ceil(t.n.bitLength()/8),this.hash=r.sha512}t.exports=l,l.prototype.sign=function(t,e){t=a(t);var i=this.keyFromSecret(e),r=this.hashInt(i.messagePrefix(),t),n=this.g.mul(r),s=this.encodePoint(n),o=this.hashInt(s,i.pubBytes(),t).mul(i.priv()),h=r.add(o).umod(this.curve.n);return this.makeSignature({R:n,S:h,Rencoded:s})},l.prototype.verify=function(t,e,i){t=a(t),e=this.makeSignature(e);var r=this.keyFromPublic(i),n=this.hashInt(e.Rencoded(),r.pubBytes(),t),s=this.g.mul(e.S());return e.R().add(r.pub().mul(n)).eq(s)},l.prototype.hashInt=function(){for(var t=this.hash(),e=0;e{"use strict";var r=i(953),n=r.assert,s=r.parseBytes,o=r.cachedProperty;function a(t,e){this.eddsa=t,this._secret=s(e.secret),t.isPoint(e.pub)?this._pub=e.pub:this._pubBytes=s(e.pub)}a.fromPublic=function(t,e){return e instanceof a?e:new a(t,{pub:e})},a.fromSecret=function(t,e){return e instanceof a?e:new a(t,{secret:e})},a.prototype.secret=function(){return this._secret},o(a,"pubBytes",(function(){return this.eddsa.encodePoint(this.pub())})),o(a,"pub",(function(){return this._pubBytes?this.eddsa.decodePoint(this._pubBytes):this.eddsa.g.mul(this.priv())})),o(a,"privBytes",(function(){var t=this.eddsa,e=this.hash(),i=t.encodingLength-1,r=e.slice(0,t.encodingLength);return r[0]&=248,r[i]&=127,r[i]|=64,r})),o(a,"priv",(function(){return this.eddsa.decodeInt(this.privBytes())})),o(a,"hash",(function(){return this.eddsa.hash().update(this.secret()).digest()})),o(a,"messagePrefix",(function(){return this.hash().slice(this.eddsa.encodingLength)})),a.prototype.sign=function(t){return n(this._secret,"KeyPair can only verify"),this.eddsa.sign(t,this)},a.prototype.verify=function(t,e){return this.eddsa.verify(t,e,this)},a.prototype.getSecret=function(t){return n(this._secret,"KeyPair is public only"),r.encode(this.secret(),t)},a.prototype.getPublic=function(t){return r.encode(this.pubBytes(),t)},t.exports=a},3622:(t,e,i)=>{"use strict";var r=i(3785),n=i(953),s=n.assert,o=n.cachedProperty,a=n.parseBytes;function h(t,e){this.eddsa=t,"object"!=typeof e&&(e=a(e)),Array.isArray(e)&&(e={R:e.slice(0,t.encodingLength),S:e.slice(t.encodingLength)}),s(e.R&&e.S,"Signature without R or S"),t.isPoint(e.R)&&(this._R=e.R),e.S instanceof r&&(this._S=e.S),this._Rencoded=Array.isArray(e.R)?e.R:e.Rencoded,this._Sencoded=Array.isArray(e.S)?e.S:e.Sencoded}o(h,"S",(function(){return this.eddsa.decodeInt(this.Sencoded())})),o(h,"R",(function(){return this.eddsa.decodePoint(this.Rencoded())})),o(h,"Rencoded",(function(){return this.eddsa.encodePoint(this.R())})),o(h,"Sencoded",(function(){return this.eddsa.encodeInt(this.S())})),h.prototype.toBytes=function(){return this.Rencoded().concat(this.Sencoded())},h.prototype.toHex=function(){return n.encode(this.toBytes(),"hex").toUpperCase()},t.exports=h},1037:t=>{t.exports={doubles:{step:4,points:[["e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a","f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821"],["8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508","11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf"],["175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739","d3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695"],["363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640","4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9"],["8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c","4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36"],["723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda","96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f"],["eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa","5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999"],["100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0","cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09"],["e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d","9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d"],["feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d","e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088"],["da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1","9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d"],["53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0","5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8"],["8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047","10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a"],["385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862","283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453"],["6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7","7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160"],["3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd","56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0"],["85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83","7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6"],["948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a","53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589"],["6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8","bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17"],["e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d","4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda"],["e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725","7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd"],["213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754","4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2"],["4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c","17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6"],["fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6","6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f"],["76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39","c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01"],["c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891","893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3"],["d895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b","febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f"],["b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03","2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7"],["e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d","eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78"],["a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070","7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1"],["90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4","e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150"],["8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da","662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82"],["e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11","1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc"],["8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e","efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b"],["e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41","2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51"],["b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef","67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45"],["d68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8","db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120"],["324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d","648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84"],["4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96","35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d"],["9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd","ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d"],["6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5","9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8"],["a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266","40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8"],["7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71","34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac"],["928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac","c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f"],["85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751","1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962"],["ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e","493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907"],["827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241","c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec"],["eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3","be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d"],["e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f","4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414"],["1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19","aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd"],["146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be","b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0"],["fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9","6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811"],["da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2","8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1"],["a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13","7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c"],["174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c","ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73"],["959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba","2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd"],["d2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151","e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405"],["64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073","d99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589"],["8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458","38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e"],["13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b","69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27"],["bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366","d3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1"],["8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa","40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482"],["8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0","620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945"],["dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787","7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573"],["f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e","ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82"]]},naf:{wnd:7,points:[["f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9","388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672"],["2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4","d8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6"],["5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc","6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da"],["acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe","cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37"],["774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb","d984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b"],["f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8","ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81"],["d7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e","581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58"],["defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34","4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77"],["2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c","85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a"],["352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5","321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c"],["2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f","2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67"],["9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714","73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402"],["daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729","a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55"],["c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db","2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482"],["6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4","e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82"],["1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5","b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396"],["605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479","2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49"],["62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d","80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf"],["80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f","1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a"],["7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb","d0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7"],["d528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9","eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933"],["49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963","758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a"],["77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74","958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6"],["f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530","e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37"],["463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b","5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e"],["f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247","cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6"],["caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1","cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476"],["2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120","4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40"],["7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435","91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61"],["754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18","673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683"],["e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8","59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5"],["186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb","3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b"],["df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f","55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417"],["5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143","efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868"],["290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba","e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a"],["af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45","f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6"],["766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a","744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996"],["59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e","c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e"],["f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8","e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d"],["7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c","30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2"],["948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519","e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e"],["7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab","100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437"],["3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca","ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311"],["d3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf","8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4"],["1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610","68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575"],["733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4","f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d"],["15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c","d56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d"],["a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940","edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629"],["e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980","a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06"],["311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3","66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374"],["34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf","9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee"],["f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63","4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1"],["d7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448","fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b"],["32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf","5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661"],["7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5","8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6"],["ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6","8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e"],["16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5","5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d"],["eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99","f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc"],["78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51","f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4"],["494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5","42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c"],["a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5","204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b"],["c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997","4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913"],["841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881","73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154"],["5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5","39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865"],["36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66","d2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc"],["336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726","ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224"],["8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede","6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e"],["1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94","60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6"],["85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31","3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511"],["29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51","b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b"],["a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252","ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2"],["4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5","cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c"],["d24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b","6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3"],["ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4","322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d"],["af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f","6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700"],["e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889","2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4"],["591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246","b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196"],["11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984","998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4"],["3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a","b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257"],["cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030","bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13"],["c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197","6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096"],["c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593","c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38"],["a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef","21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f"],["347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38","60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448"],["da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a","49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a"],["c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111","5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4"],["4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502","7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437"],["3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea","be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7"],["cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26","8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d"],["b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986","39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a"],["d4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e","62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54"],["48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4","25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77"],["dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda","ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517"],["6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859","cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10"],["e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f","f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125"],["eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c","6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e"],["13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942","fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1"],["ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a","1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2"],["b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80","5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423"],["ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d","438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8"],["8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1","cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758"],["52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63","c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375"],["e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352","6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d"],["7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193","ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec"],["5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00","9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0"],["32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58","ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c"],["e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7","d3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4"],["8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8","c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f"],["4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e","67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649"],["3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d","cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826"],["674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b","299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5"],["d32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f","f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87"],["30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6","462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b"],["be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297","62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc"],["93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a","7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c"],["b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c","ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f"],["d5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52","4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a"],["d3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb","bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46"],["463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065","bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f"],["7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917","603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03"],["74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9","cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08"],["30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3","553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8"],["9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57","712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373"],["176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66","ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3"],["75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8","9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8"],["809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721","9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1"],["1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180","4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9"]]}}},953:(t,e,i)=>{"use strict";var r=e,n=i(3785),s=i(9746),o=i(4504);r.assert=s,r.toArray=o.toArray,r.zero2=o.zero2,r.toHex=o.toHex,r.encode=o.encode,r.getNAF=function(t,e,i){var r=new Array(Math.max(t.bitLength(),i)+1);r.fill(0);for(var n=1<(n>>1)-1?(n>>1)-h:h,s.isubn(a)):a=0,r[o]=a,s.iushrn(1)}return r},r.getJSF=function(t,e){var i=[[],[]];t=t.clone(),e=e.clone();for(var r,n=0,s=0;t.cmpn(-n)>0||e.cmpn(-s)>0;){var o,a,h=t.andln(3)+n&3,u=e.andln(3)+s&3;3===h&&(h=-1),3===u&&(u=-1),o=0==(1&h)?0:3!=(r=t.andln(7)+n&7)&&5!==r||2!==u?h:-h,i[0].push(o),a=0==(1&u)?0:3!=(r=e.andln(7)+s&7)&&5!==r||2!==h?u:-u,i[1].push(a),2*n===o+1&&(n=1-n),2*s===a+1&&(s=1-s),t.iushrn(1),e.iushrn(1)}return i},r.cachedProperty=function(t,e,i){var r="_"+e;t.prototype[e]=function(){return void 0!==this[r]?this[r]:this[r]=i.call(this)}},r.parseBytes=function(t){return"string"==typeof t?r.toArray(t,"hex"):t},r.intFromLE=function(t){return new n(t,"hex","le")}},3785:function(t,e,i){!function(t,e){"use strict";function r(t,e){if(!t)throw new Error(e||"Assertion failed")}function n(t,e){t.super_=e;var i=function(){};i.prototype=e.prototype,t.prototype=new i,t.prototype.constructor=t}function s(t,e,i){if(s.isBN(t))return t;this.negative=0,this.words=null,this.length=0,this.red=null,null!==t&&("le"!==e&&"be"!==e||(i=e,e=10),this._init(t||0,e||10,i||"be"))}var o;"object"==typeof t?t.exports=s:e.BN=s,s.BN=s,s.wordSize=26;try{o="undefined"!=typeof window&&void 0!==window.Buffer?window.Buffer:i(5568).Buffer}catch(t){}function a(t,e){var i=t.charCodeAt(e);return i>=65&&i<=70?i-55:i>=97&&i<=102?i-87:i-48&15}function h(t,e,i){var r=a(t,i);return i-1>=e&&(r|=a(t,i-1)<<4),r}function u(t,e,i,r){for(var n=0,s=Math.min(t.length,i),o=e;o=49?a-49+10:a>=17?a-17+10:a}return n}s.isBN=function(t){return t instanceof s||null!==t&&"object"==typeof t&&t.constructor.wordSize===s.wordSize&&Array.isArray(t.words)},s.max=function(t,e){return t.cmp(e)>0?t:e},s.min=function(t,e){return t.cmp(e)<0?t:e},s.prototype._init=function(t,e,i){if("number"==typeof t)return this._initNumber(t,e,i);if("object"==typeof t)return this._initArray(t,e,i);"hex"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var n=0;"-"===(t=t.toString().replace(/\s+/g,""))[0]&&(n++,this.negative=1),n=0;n-=3)o=t[n]|t[n-1]<<8|t[n-2]<<16,this.words[s]|=o<>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);else if("le"===i)for(n=0,s=0;n>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);return this.strip()},s.prototype._parseHex=function(t,e,i){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var r=0;r=e;r-=2)n=h(t,e,r)<=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;else for(r=(t.length-e)%2==0?e+1:e;r=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;this.strip()},s.prototype._parseBase=function(t,e,i){this.words=[0],this.length=1;for(var r=0,n=1;n<=67108863;n*=e)r++;r--,n=n/e|0;for(var s=t.length-i,o=s%r,a=Math.min(s,s-o)+i,h=0,l=i;l1&&0===this.words[this.length-1];)this.length--;return this._normSign()},s.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},s.prototype.inspect=function(){return(this.red?""};var l=["","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"],c=[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],d=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function f(t,e,i){i.negative=e.negative^t.negative;var r=t.length+e.length|0;i.length=r,r=r-1|0;var n=0|t.words[0],s=0|e.words[0],o=n*s,a=67108863&o,h=o/67108864|0;i.words[0]=a;for(var u=1;u>>26,c=67108863&h,d=Math.min(u,e.length-1),f=Math.max(0,u-t.length+1);f<=d;f++){var p=u-f|0;l+=(o=(n=0|t.words[p])*(s=0|e.words[f])+c)/67108864|0,c=67108863&o}i.words[u]=0|c,h=0|l}return 0!==h?i.words[u]=0|h:i.length--,i.strip()}s.prototype.toString=function(t,e){var i;if(e=0|e||1,16===(t=t||10)||"hex"===t){i="";for(var n=0,s=0,o=0;o>>24-n&16777215)||o!==this.length-1?l[6-h.length]+h+i:h+i,(n+=2)>=26&&(n-=26,o--)}for(0!==s&&(i=s.toString(16)+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}if(t===(0|t)&&t>=2&&t<=36){var u=c[t],f=d[t];i="";var p=this.clone();for(p.negative=0;!p.isZero();){var m=p.modn(f).toString(t);i=(p=p.idivn(f)).isZero()?m+i:l[u-m.length]+m+i}for(this.isZero()&&(i="0"+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}r(!1,"Base should be between 2 and 36")},s.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-t:t},s.prototype.toJSON=function(){return this.toString(16)},s.prototype.toBuffer=function(t,e){return r(void 0!==o),this.toArrayLike(o,t,e)},s.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},s.prototype.toArrayLike=function(t,e,i){var n=this.byteLength(),s=i||Math.max(1,n);r(n<=s,"byte array longer than desired length"),r(s>0,"Requested array length <= 0"),this.strip();var o,a,h="le"===e,u=new t(s),l=this.clone();if(h){for(a=0;!l.isZero();a++)o=l.andln(255),l.iushrn(8),u[a]=o;for(;a=4096&&(i+=13,e>>>=13),e>=64&&(i+=7,e>>>=7),e>=8&&(i+=4,e>>>=4),e>=2&&(i+=2,e>>>=2),i+e},s.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,i=0;return 0==(8191&e)&&(i+=13,e>>>=13),0==(127&e)&&(i+=7,e>>>=7),0==(15&e)&&(i+=4,e>>>=4),0==(3&e)&&(i+=2,e>>>=2),0==(1&e)&&i++,i},s.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},s.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;et.length?this.clone().ior(t):t.clone().ior(this)},s.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},s.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var i=0;it.length?this.clone().iand(t):t.clone().iand(this)},s.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},s.prototype.iuxor=function(t){var e,i;this.length>t.length?(e=this,i=t):(e=t,i=this);for(var r=0;rt.length?this.clone().ixor(t):t.clone().ixor(this)},s.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},s.prototype.inotn=function(t){r("number"==typeof t&&t>=0);var e=0|Math.ceil(t/26),i=t%26;this._expand(e),i>0&&e--;for(var n=0;n0&&(this.words[n]=~this.words[n]&67108863>>26-i),this.strip()},s.prototype.notn=function(t){return this.clone().inotn(t)},s.prototype.setn=function(t,e){r("number"==typeof t&&t>=0);var i=t/26|0,n=t%26;return this._expand(i+1),this.words[i]=e?this.words[i]|1<t.length?(i=this,r=t):(i=t,r=this);for(var n=0,s=0;s>>26;for(;0!==n&&s>>26;if(this.length=i.length,0!==n)this.words[this.length]=n,this.length++;else if(i!==this)for(;st.length?this.clone().iadd(t):t.clone().iadd(this)},s.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var i,r,n=this.cmp(t);if(0===n)return this.negative=0,this.length=1,this.words[0]=0,this;n>0?(i=this,r=t):(i=t,r=this);for(var s=0,o=0;o>26,this.words[o]=67108863&e;for(;0!==s&&o>26,this.words[o]=67108863&e;if(0===s&&o>>13,f=0|o[1],p=8191&f,m=f>>>13,g=0|o[2],b=8191&g,v=g>>>13,y=0|o[3],w=8191&y,_=y>>>13,M=0|o[4],k=8191&M,x=M>>>13,E=0|o[5],S=8191&E,T=E>>>13,A=0|o[6],I=8191&A,C=A>>>13,B=0|o[7],R=8191&B,P=B>>>13,L=0|o[8],O=8191&L,D=L>>>13,N=0|o[9],j=8191&N,U=N>>>13,F=0|a[0],q=8191&F,z=F>>>13,H=0|a[1],W=8191&H,$=H>>>13,Z=0|a[2],V=8191&Z,K=Z>>>13,G=0|a[3],J=8191&G,Y=G>>>13,X=0|a[4],Q=8191&X,tt=X>>>13,et=0|a[5],it=8191&et,rt=et>>>13,nt=0|a[6],st=8191&nt,ot=nt>>>13,at=0|a[7],ht=8191&at,ut=at>>>13,lt=0|a[8],ct=8191<,dt=lt>>>13,ft=0|a[9],pt=8191&ft,mt=ft>>>13;i.negative=t.negative^e.negative,i.length=19;var gt=(u+(r=Math.imul(c,q))|0)+((8191&(n=(n=Math.imul(c,z))+Math.imul(d,q)|0))<<13)|0;u=((s=Math.imul(d,z))+(n>>>13)|0)+(gt>>>26)|0,gt&=67108863,r=Math.imul(p,q),n=(n=Math.imul(p,z))+Math.imul(m,q)|0,s=Math.imul(m,z);var bt=(u+(r=r+Math.imul(c,W)|0)|0)+((8191&(n=(n=n+Math.imul(c,$)|0)+Math.imul(d,W)|0))<<13)|0;u=((s=s+Math.imul(d,$)|0)+(n>>>13)|0)+(bt>>>26)|0,bt&=67108863,r=Math.imul(b,q),n=(n=Math.imul(b,z))+Math.imul(v,q)|0,s=Math.imul(v,z),r=r+Math.imul(p,W)|0,n=(n=n+Math.imul(p,$)|0)+Math.imul(m,W)|0,s=s+Math.imul(m,$)|0;var vt=(u+(r=r+Math.imul(c,V)|0)|0)+((8191&(n=(n=n+Math.imul(c,K)|0)+Math.imul(d,V)|0))<<13)|0;u=((s=s+Math.imul(d,K)|0)+(n>>>13)|0)+(vt>>>26)|0,vt&=67108863,r=Math.imul(w,q),n=(n=Math.imul(w,z))+Math.imul(_,q)|0,s=Math.imul(_,z),r=r+Math.imul(b,W)|0,n=(n=n+Math.imul(b,$)|0)+Math.imul(v,W)|0,s=s+Math.imul(v,$)|0,r=r+Math.imul(p,V)|0,n=(n=n+Math.imul(p,K)|0)+Math.imul(m,V)|0,s=s+Math.imul(m,K)|0;var yt=(u+(r=r+Math.imul(c,J)|0)|0)+((8191&(n=(n=n+Math.imul(c,Y)|0)+Math.imul(d,J)|0))<<13)|0;u=((s=s+Math.imul(d,Y)|0)+(n>>>13)|0)+(yt>>>26)|0,yt&=67108863,r=Math.imul(k,q),n=(n=Math.imul(k,z))+Math.imul(x,q)|0,s=Math.imul(x,z),r=r+Math.imul(w,W)|0,n=(n=n+Math.imul(w,$)|0)+Math.imul(_,W)|0,s=s+Math.imul(_,$)|0,r=r+Math.imul(b,V)|0,n=(n=n+Math.imul(b,K)|0)+Math.imul(v,V)|0,s=s+Math.imul(v,K)|0,r=r+Math.imul(p,J)|0,n=(n=n+Math.imul(p,Y)|0)+Math.imul(m,J)|0,s=s+Math.imul(m,Y)|0;var wt=(u+(r=r+Math.imul(c,Q)|0)|0)+((8191&(n=(n=n+Math.imul(c,tt)|0)+Math.imul(d,Q)|0))<<13)|0;u=((s=s+Math.imul(d,tt)|0)+(n>>>13)|0)+(wt>>>26)|0,wt&=67108863,r=Math.imul(S,q),n=(n=Math.imul(S,z))+Math.imul(T,q)|0,s=Math.imul(T,z),r=r+Math.imul(k,W)|0,n=(n=n+Math.imul(k,$)|0)+Math.imul(x,W)|0,s=s+Math.imul(x,$)|0,r=r+Math.imul(w,V)|0,n=(n=n+Math.imul(w,K)|0)+Math.imul(_,V)|0,s=s+Math.imul(_,K)|0,r=r+Math.imul(b,J)|0,n=(n=n+Math.imul(b,Y)|0)+Math.imul(v,J)|0,s=s+Math.imul(v,Y)|0,r=r+Math.imul(p,Q)|0,n=(n=n+Math.imul(p,tt)|0)+Math.imul(m,Q)|0,s=s+Math.imul(m,tt)|0;var _t=(u+(r=r+Math.imul(c,it)|0)|0)+((8191&(n=(n=n+Math.imul(c,rt)|0)+Math.imul(d,it)|0))<<13)|0;u=((s=s+Math.imul(d,rt)|0)+(n>>>13)|0)+(_t>>>26)|0,_t&=67108863,r=Math.imul(I,q),n=(n=Math.imul(I,z))+Math.imul(C,q)|0,s=Math.imul(C,z),r=r+Math.imul(S,W)|0,n=(n=n+Math.imul(S,$)|0)+Math.imul(T,W)|0,s=s+Math.imul(T,$)|0,r=r+Math.imul(k,V)|0,n=(n=n+Math.imul(k,K)|0)+Math.imul(x,V)|0,s=s+Math.imul(x,K)|0,r=r+Math.imul(w,J)|0,n=(n=n+Math.imul(w,Y)|0)+Math.imul(_,J)|0,s=s+Math.imul(_,Y)|0,r=r+Math.imul(b,Q)|0,n=(n=n+Math.imul(b,tt)|0)+Math.imul(v,Q)|0,s=s+Math.imul(v,tt)|0,r=r+Math.imul(p,it)|0,n=(n=n+Math.imul(p,rt)|0)+Math.imul(m,it)|0,s=s+Math.imul(m,rt)|0;var Mt=(u+(r=r+Math.imul(c,st)|0)|0)+((8191&(n=(n=n+Math.imul(c,ot)|0)+Math.imul(d,st)|0))<<13)|0;u=((s=s+Math.imul(d,ot)|0)+(n>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,r=Math.imul(R,q),n=(n=Math.imul(R,z))+Math.imul(P,q)|0,s=Math.imul(P,z),r=r+Math.imul(I,W)|0,n=(n=n+Math.imul(I,$)|0)+Math.imul(C,W)|0,s=s+Math.imul(C,$)|0,r=r+Math.imul(S,V)|0,n=(n=n+Math.imul(S,K)|0)+Math.imul(T,V)|0,s=s+Math.imul(T,K)|0,r=r+Math.imul(k,J)|0,n=(n=n+Math.imul(k,Y)|0)+Math.imul(x,J)|0,s=s+Math.imul(x,Y)|0,r=r+Math.imul(w,Q)|0,n=(n=n+Math.imul(w,tt)|0)+Math.imul(_,Q)|0,s=s+Math.imul(_,tt)|0,r=r+Math.imul(b,it)|0,n=(n=n+Math.imul(b,rt)|0)+Math.imul(v,it)|0,s=s+Math.imul(v,rt)|0,r=r+Math.imul(p,st)|0,n=(n=n+Math.imul(p,ot)|0)+Math.imul(m,st)|0,s=s+Math.imul(m,ot)|0;var kt=(u+(r=r+Math.imul(c,ht)|0)|0)+((8191&(n=(n=n+Math.imul(c,ut)|0)+Math.imul(d,ht)|0))<<13)|0;u=((s=s+Math.imul(d,ut)|0)+(n>>>13)|0)+(kt>>>26)|0,kt&=67108863,r=Math.imul(O,q),n=(n=Math.imul(O,z))+Math.imul(D,q)|0,s=Math.imul(D,z),r=r+Math.imul(R,W)|0,n=(n=n+Math.imul(R,$)|0)+Math.imul(P,W)|0,s=s+Math.imul(P,$)|0,r=r+Math.imul(I,V)|0,n=(n=n+Math.imul(I,K)|0)+Math.imul(C,V)|0,s=s+Math.imul(C,K)|0,r=r+Math.imul(S,J)|0,n=(n=n+Math.imul(S,Y)|0)+Math.imul(T,J)|0,s=s+Math.imul(T,Y)|0,r=r+Math.imul(k,Q)|0,n=(n=n+Math.imul(k,tt)|0)+Math.imul(x,Q)|0,s=s+Math.imul(x,tt)|0,r=r+Math.imul(w,it)|0,n=(n=n+Math.imul(w,rt)|0)+Math.imul(_,it)|0,s=s+Math.imul(_,rt)|0,r=r+Math.imul(b,st)|0,n=(n=n+Math.imul(b,ot)|0)+Math.imul(v,st)|0,s=s+Math.imul(v,ot)|0,r=r+Math.imul(p,ht)|0,n=(n=n+Math.imul(p,ut)|0)+Math.imul(m,ht)|0,s=s+Math.imul(m,ut)|0;var xt=(u+(r=r+Math.imul(c,ct)|0)|0)+((8191&(n=(n=n+Math.imul(c,dt)|0)+Math.imul(d,ct)|0))<<13)|0;u=((s=s+Math.imul(d,dt)|0)+(n>>>13)|0)+(xt>>>26)|0,xt&=67108863,r=Math.imul(j,q),n=(n=Math.imul(j,z))+Math.imul(U,q)|0,s=Math.imul(U,z),r=r+Math.imul(O,W)|0,n=(n=n+Math.imul(O,$)|0)+Math.imul(D,W)|0,s=s+Math.imul(D,$)|0,r=r+Math.imul(R,V)|0,n=(n=n+Math.imul(R,K)|0)+Math.imul(P,V)|0,s=s+Math.imul(P,K)|0,r=r+Math.imul(I,J)|0,n=(n=n+Math.imul(I,Y)|0)+Math.imul(C,J)|0,s=s+Math.imul(C,Y)|0,r=r+Math.imul(S,Q)|0,n=(n=n+Math.imul(S,tt)|0)+Math.imul(T,Q)|0,s=s+Math.imul(T,tt)|0,r=r+Math.imul(k,it)|0,n=(n=n+Math.imul(k,rt)|0)+Math.imul(x,it)|0,s=s+Math.imul(x,rt)|0,r=r+Math.imul(w,st)|0,n=(n=n+Math.imul(w,ot)|0)+Math.imul(_,st)|0,s=s+Math.imul(_,ot)|0,r=r+Math.imul(b,ht)|0,n=(n=n+Math.imul(b,ut)|0)+Math.imul(v,ht)|0,s=s+Math.imul(v,ut)|0,r=r+Math.imul(p,ct)|0,n=(n=n+Math.imul(p,dt)|0)+Math.imul(m,ct)|0,s=s+Math.imul(m,dt)|0;var Et=(u+(r=r+Math.imul(c,pt)|0)|0)+((8191&(n=(n=n+Math.imul(c,mt)|0)+Math.imul(d,pt)|0))<<13)|0;u=((s=s+Math.imul(d,mt)|0)+(n>>>13)|0)+(Et>>>26)|0,Et&=67108863,r=Math.imul(j,W),n=(n=Math.imul(j,$))+Math.imul(U,W)|0,s=Math.imul(U,$),r=r+Math.imul(O,V)|0,n=(n=n+Math.imul(O,K)|0)+Math.imul(D,V)|0,s=s+Math.imul(D,K)|0,r=r+Math.imul(R,J)|0,n=(n=n+Math.imul(R,Y)|0)+Math.imul(P,J)|0,s=s+Math.imul(P,Y)|0,r=r+Math.imul(I,Q)|0,n=(n=n+Math.imul(I,tt)|0)+Math.imul(C,Q)|0,s=s+Math.imul(C,tt)|0,r=r+Math.imul(S,it)|0,n=(n=n+Math.imul(S,rt)|0)+Math.imul(T,it)|0,s=s+Math.imul(T,rt)|0,r=r+Math.imul(k,st)|0,n=(n=n+Math.imul(k,ot)|0)+Math.imul(x,st)|0,s=s+Math.imul(x,ot)|0,r=r+Math.imul(w,ht)|0,n=(n=n+Math.imul(w,ut)|0)+Math.imul(_,ht)|0,s=s+Math.imul(_,ut)|0,r=r+Math.imul(b,ct)|0,n=(n=n+Math.imul(b,dt)|0)+Math.imul(v,ct)|0,s=s+Math.imul(v,dt)|0;var St=(u+(r=r+Math.imul(p,pt)|0)|0)+((8191&(n=(n=n+Math.imul(p,mt)|0)+Math.imul(m,pt)|0))<<13)|0;u=((s=s+Math.imul(m,mt)|0)+(n>>>13)|0)+(St>>>26)|0,St&=67108863,r=Math.imul(j,V),n=(n=Math.imul(j,K))+Math.imul(U,V)|0,s=Math.imul(U,K),r=r+Math.imul(O,J)|0,n=(n=n+Math.imul(O,Y)|0)+Math.imul(D,J)|0,s=s+Math.imul(D,Y)|0,r=r+Math.imul(R,Q)|0,n=(n=n+Math.imul(R,tt)|0)+Math.imul(P,Q)|0,s=s+Math.imul(P,tt)|0,r=r+Math.imul(I,it)|0,n=(n=n+Math.imul(I,rt)|0)+Math.imul(C,it)|0,s=s+Math.imul(C,rt)|0,r=r+Math.imul(S,st)|0,n=(n=n+Math.imul(S,ot)|0)+Math.imul(T,st)|0,s=s+Math.imul(T,ot)|0,r=r+Math.imul(k,ht)|0,n=(n=n+Math.imul(k,ut)|0)+Math.imul(x,ht)|0,s=s+Math.imul(x,ut)|0,r=r+Math.imul(w,ct)|0,n=(n=n+Math.imul(w,dt)|0)+Math.imul(_,ct)|0,s=s+Math.imul(_,dt)|0;var Tt=(u+(r=r+Math.imul(b,pt)|0)|0)+((8191&(n=(n=n+Math.imul(b,mt)|0)+Math.imul(v,pt)|0))<<13)|0;u=((s=s+Math.imul(v,mt)|0)+(n>>>13)|0)+(Tt>>>26)|0,Tt&=67108863,r=Math.imul(j,J),n=(n=Math.imul(j,Y))+Math.imul(U,J)|0,s=Math.imul(U,Y),r=r+Math.imul(O,Q)|0,n=(n=n+Math.imul(O,tt)|0)+Math.imul(D,Q)|0,s=s+Math.imul(D,tt)|0,r=r+Math.imul(R,it)|0,n=(n=n+Math.imul(R,rt)|0)+Math.imul(P,it)|0,s=s+Math.imul(P,rt)|0,r=r+Math.imul(I,st)|0,n=(n=n+Math.imul(I,ot)|0)+Math.imul(C,st)|0,s=s+Math.imul(C,ot)|0,r=r+Math.imul(S,ht)|0,n=(n=n+Math.imul(S,ut)|0)+Math.imul(T,ht)|0,s=s+Math.imul(T,ut)|0,r=r+Math.imul(k,ct)|0,n=(n=n+Math.imul(k,dt)|0)+Math.imul(x,ct)|0,s=s+Math.imul(x,dt)|0;var At=(u+(r=r+Math.imul(w,pt)|0)|0)+((8191&(n=(n=n+Math.imul(w,mt)|0)+Math.imul(_,pt)|0))<<13)|0;u=((s=s+Math.imul(_,mt)|0)+(n>>>13)|0)+(At>>>26)|0,At&=67108863,r=Math.imul(j,Q),n=(n=Math.imul(j,tt))+Math.imul(U,Q)|0,s=Math.imul(U,tt),r=r+Math.imul(O,it)|0,n=(n=n+Math.imul(O,rt)|0)+Math.imul(D,it)|0,s=s+Math.imul(D,rt)|0,r=r+Math.imul(R,st)|0,n=(n=n+Math.imul(R,ot)|0)+Math.imul(P,st)|0,s=s+Math.imul(P,ot)|0,r=r+Math.imul(I,ht)|0,n=(n=n+Math.imul(I,ut)|0)+Math.imul(C,ht)|0,s=s+Math.imul(C,ut)|0,r=r+Math.imul(S,ct)|0,n=(n=n+Math.imul(S,dt)|0)+Math.imul(T,ct)|0,s=s+Math.imul(T,dt)|0;var It=(u+(r=r+Math.imul(k,pt)|0)|0)+((8191&(n=(n=n+Math.imul(k,mt)|0)+Math.imul(x,pt)|0))<<13)|0;u=((s=s+Math.imul(x,mt)|0)+(n>>>13)|0)+(It>>>26)|0,It&=67108863,r=Math.imul(j,it),n=(n=Math.imul(j,rt))+Math.imul(U,it)|0,s=Math.imul(U,rt),r=r+Math.imul(O,st)|0,n=(n=n+Math.imul(O,ot)|0)+Math.imul(D,st)|0,s=s+Math.imul(D,ot)|0,r=r+Math.imul(R,ht)|0,n=(n=n+Math.imul(R,ut)|0)+Math.imul(P,ht)|0,s=s+Math.imul(P,ut)|0,r=r+Math.imul(I,ct)|0,n=(n=n+Math.imul(I,dt)|0)+Math.imul(C,ct)|0,s=s+Math.imul(C,dt)|0;var Ct=(u+(r=r+Math.imul(S,pt)|0)|0)+((8191&(n=(n=n+Math.imul(S,mt)|0)+Math.imul(T,pt)|0))<<13)|0;u=((s=s+Math.imul(T,mt)|0)+(n>>>13)|0)+(Ct>>>26)|0,Ct&=67108863,r=Math.imul(j,st),n=(n=Math.imul(j,ot))+Math.imul(U,st)|0,s=Math.imul(U,ot),r=r+Math.imul(O,ht)|0,n=(n=n+Math.imul(O,ut)|0)+Math.imul(D,ht)|0,s=s+Math.imul(D,ut)|0,r=r+Math.imul(R,ct)|0,n=(n=n+Math.imul(R,dt)|0)+Math.imul(P,ct)|0,s=s+Math.imul(P,dt)|0;var Bt=(u+(r=r+Math.imul(I,pt)|0)|0)+((8191&(n=(n=n+Math.imul(I,mt)|0)+Math.imul(C,pt)|0))<<13)|0;u=((s=s+Math.imul(C,mt)|0)+(n>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,r=Math.imul(j,ht),n=(n=Math.imul(j,ut))+Math.imul(U,ht)|0,s=Math.imul(U,ut),r=r+Math.imul(O,ct)|0,n=(n=n+Math.imul(O,dt)|0)+Math.imul(D,ct)|0,s=s+Math.imul(D,dt)|0;var Rt=(u+(r=r+Math.imul(R,pt)|0)|0)+((8191&(n=(n=n+Math.imul(R,mt)|0)+Math.imul(P,pt)|0))<<13)|0;u=((s=s+Math.imul(P,mt)|0)+(n>>>13)|0)+(Rt>>>26)|0,Rt&=67108863,r=Math.imul(j,ct),n=(n=Math.imul(j,dt))+Math.imul(U,ct)|0,s=Math.imul(U,dt);var Pt=(u+(r=r+Math.imul(O,pt)|0)|0)+((8191&(n=(n=n+Math.imul(O,mt)|0)+Math.imul(D,pt)|0))<<13)|0;u=((s=s+Math.imul(D,mt)|0)+(n>>>13)|0)+(Pt>>>26)|0,Pt&=67108863;var Lt=(u+(r=Math.imul(j,pt))|0)+((8191&(n=(n=Math.imul(j,mt))+Math.imul(U,pt)|0))<<13)|0;return u=((s=Math.imul(U,mt))+(n>>>13)|0)+(Lt>>>26)|0,Lt&=67108863,h[0]=gt,h[1]=bt,h[2]=vt,h[3]=yt,h[4]=wt,h[5]=_t,h[6]=Mt,h[7]=kt,h[8]=xt,h[9]=Et,h[10]=St,h[11]=Tt,h[12]=At,h[13]=It,h[14]=Ct,h[15]=Bt,h[16]=Rt,h[17]=Pt,h[18]=Lt,0!==u&&(h[19]=u,i.length++),i};function m(t,e,i){return(new g).mulp(t,e,i)}function g(t,e){this.x=t,this.y=e}Math.imul||(p=f),s.prototype.mulTo=function(t,e){var i,r=this.length+t.length;return i=10===this.length&&10===t.length?p(this,t,e):r<63?f(this,t,e):r<1024?function(t,e,i){i.negative=e.negative^t.negative,i.length=t.length+e.length;for(var r=0,n=0,s=0;s>>26)|0)>>>26,o&=67108863}i.words[s]=a,r=o,o=n}return 0!==r?i.words[s]=r:i.length--,i.strip()}(this,t,e):m(this,t,e),i},g.prototype.makeRBT=function(t){for(var e=new Array(t),i=s.prototype._countBits(t)-1,r=0;r>=1;return r},g.prototype.permute=function(t,e,i,r,n,s){for(var o=0;o>>=1)n++;return 1<>>=13,i[2*o+1]=8191&s,s>>>=13;for(o=2*e;o>=26,e+=n/67108864|0,e+=s>>>26,this.words[i]=67108863&s}return 0!==e&&(this.words[i]=e,this.length++),this},s.prototype.muln=function(t){return this.clone().imuln(t)},s.prototype.sqr=function(){return this.mul(this)},s.prototype.isqr=function(){return this.imul(this.clone())},s.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),i=0;i>>n}return e}(t);if(0===e.length)return new s(1);for(var i=this,r=0;r=0);var e,i=t%26,n=(t-i)/26,s=67108863>>>26-i<<26-i;if(0!==i){var o=0;for(e=0;e>>26-i}o&&(this.words[e]=o,this.length++)}if(0!==n){for(e=this.length-1;e>=0;e--)this.words[e+n]=this.words[e];for(e=0;e=0),n=e?(e-e%26)/26:0;var s=t%26,o=Math.min((t-s)/26,this.length),a=67108863^67108863>>>s<o)for(this.length-=o,u=0;u=0&&(0!==l||u>=n);u--){var c=0|this.words[u];this.words[u]=l<<26-s|c>>>s,l=c&a}return h&&0!==l&&(h.words[h.length++]=l),0===this.length&&(this.words[0]=0,this.length=1),this.strip()},s.prototype.ishrn=function(t,e,i){return r(0===this.negative),this.iushrn(t,e,i)},s.prototype.shln=function(t){return this.clone().ishln(t)},s.prototype.ushln=function(t){return this.clone().iushln(t)},s.prototype.shrn=function(t){return this.clone().ishrn(t)},s.prototype.ushrn=function(t){return this.clone().iushrn(t)},s.prototype.testn=function(t){r("number"==typeof t&&t>=0);var e=t%26,i=(t-e)/26,n=1<=0);var e=t%26,i=(t-e)/26;if(r(0===this.negative,"imaskn works only with positive numbers"),this.length<=i)return this;if(0!==e&&i++,this.length=Math.min(i,this.length),0!==e){var n=67108863^67108863>>>e<=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},s.prototype.isubn=function(t){if(r("number"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e>26)-(h/67108864|0),this.words[n+i]=67108863&s}for(;n>26,this.words[n+i]=67108863&s;if(0===a)return this.strip();for(r(-1===a),a=0,n=0;n>26,this.words[n]=67108863&s;return this.negative=1,this.strip()},s.prototype._wordDiv=function(t,e){var i=(this.length,t.length),r=this.clone(),n=t,o=0|n.words[n.length-1];0!=(i=26-this._countBits(o))&&(n=n.ushln(i),r.iushln(i),o=0|n.words[n.length-1]);var a,h=r.length-n.length;if("mod"!==e){(a=new s(null)).length=h+1,a.words=new Array(a.length);for(var u=0;u=0;c--){var d=67108864*(0|r.words[n.length+c])+(0|r.words[n.length+c-1]);for(d=Math.min(d/o|0,67108863),r._ishlnsubmul(n,d,c);0!==r.negative;)d--,r.negative=0,r._ishlnsubmul(n,1,c),r.isZero()||(r.negative^=1);a&&(a.words[c]=d)}return a&&a.strip(),r.strip(),"div"!==e&&0!==i&&r.iushrn(i),{div:a||null,mod:r}},s.prototype.divmod=function(t,e,i){return r(!t.isZero()),this.isZero()?{div:new s(0),mod:new s(0)}:0!==this.negative&&0===t.negative?(a=this.neg().divmod(t,e),"mod"!==e&&(n=a.div.neg()),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.iadd(t)),{div:n,mod:o}):0===this.negative&&0!==t.negative?(a=this.divmod(t.neg(),e),"mod"!==e&&(n=a.div.neg()),{div:n,mod:a.mod}):0!=(this.negative&t.negative)?(a=this.neg().divmod(t.neg(),e),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.isub(t)),{div:a.div,mod:o}):t.length>this.length||this.cmp(t)<0?{div:new s(0),mod:this}:1===t.length?"div"===e?{div:this.divn(t.words[0]),mod:null}:"mod"===e?{div:null,mod:new s(this.modn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new s(this.modn(t.words[0]))}:this._wordDiv(t,e);var n,o,a},s.prototype.div=function(t){return this.divmod(t,"div",!1).div},s.prototype.mod=function(t){return this.divmod(t,"mod",!1).mod},s.prototype.umod=function(t){return this.divmod(t,"mod",!0).mod},s.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var i=0!==e.div.negative?e.mod.isub(t):e.mod,r=t.ushrn(1),n=t.andln(1),s=i.cmp(r);return s<0||1===n&&0===s?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},s.prototype.modn=function(t){r(t<=67108863);for(var e=(1<<26)%t,i=0,n=this.length-1;n>=0;n--)i=(e*i+(0|this.words[n]))%t;return i},s.prototype.idivn=function(t){r(t<=67108863);for(var e=0,i=this.length-1;i>=0;i--){var n=(0|this.words[i])+67108864*e;this.words[i]=n/t|0,e=n%t}return this.strip()},s.prototype.divn=function(t){return this.clone().idivn(t)},s.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n=new s(1),o=new s(0),a=new s(0),h=new s(1),u=0;e.isEven()&&i.isEven();)e.iushrn(1),i.iushrn(1),++u;for(var l=i.clone(),c=e.clone();!e.isZero();){for(var d=0,f=1;0==(e.words[0]&f)&&d<26;++d,f<<=1);if(d>0)for(e.iushrn(d);d-- >0;)(n.isOdd()||o.isOdd())&&(n.iadd(l),o.isub(c)),n.iushrn(1),o.iushrn(1);for(var p=0,m=1;0==(i.words[0]&m)&&p<26;++p,m<<=1);if(p>0)for(i.iushrn(p);p-- >0;)(a.isOdd()||h.isOdd())&&(a.iadd(l),h.isub(c)),a.iushrn(1),h.iushrn(1);e.cmp(i)>=0?(e.isub(i),n.isub(a),o.isub(h)):(i.isub(e),a.isub(n),h.isub(o))}return{a,b:h,gcd:i.iushln(u)}},s.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n,o=new s(1),a=new s(0),h=i.clone();e.cmpn(1)>0&&i.cmpn(1)>0;){for(var u=0,l=1;0==(e.words[0]&l)&&u<26;++u,l<<=1);if(u>0)for(e.iushrn(u);u-- >0;)o.isOdd()&&o.iadd(h),o.iushrn(1);for(var c=0,d=1;0==(i.words[0]&d)&&c<26;++c,d<<=1);if(c>0)for(i.iushrn(c);c-- >0;)a.isOdd()&&a.iadd(h),a.iushrn(1);e.cmp(i)>=0?(e.isub(i),o.isub(a)):(i.isub(e),a.isub(o))}return(n=0===e.cmpn(1)?o:a).cmpn(0)<0&&n.iadd(t),n},s.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),i=t.clone();e.negative=0,i.negative=0;for(var r=0;e.isEven()&&i.isEven();r++)e.iushrn(1),i.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;i.isEven();)i.iushrn(1);var n=e.cmp(i);if(n<0){var s=e;e=i,i=s}else if(0===n||0===i.cmpn(1))break;e.isub(i)}return i.iushln(r)},s.prototype.invm=function(t){return this.egcd(t).a.umod(t)},s.prototype.isEven=function(){return 0==(1&this.words[0])},s.prototype.isOdd=function(){return 1==(1&this.words[0])},s.prototype.andln=function(t){return this.words[0]&t},s.prototype.bincn=function(t){r("number"==typeof t);var e=t%26,i=(t-e)/26,n=1<>>26,a&=67108863,this.words[o]=a}return 0!==s&&(this.words[o]=s,this.length++),this},s.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},s.prototype.cmpn=function(t){var e,i=t<0;if(0!==this.negative&&!i)return-1;if(0===this.negative&&i)return 1;if(this.strip(),this.length>1)e=1;else{i&&(t=-t),r(t<=67108863,"Number is too big");var n=0|this.words[0];e=n===t?0:nt.length)return 1;if(this.length=0;i--){var r=0|this.words[i],n=0|t.words[i];if(r!==n){rn&&(e=1);break}}return e},s.prototype.gtn=function(t){return 1===this.cmpn(t)},s.prototype.gt=function(t){return 1===this.cmp(t)},s.prototype.gten=function(t){return this.cmpn(t)>=0},s.prototype.gte=function(t){return this.cmp(t)>=0},s.prototype.ltn=function(t){return-1===this.cmpn(t)},s.prototype.lt=function(t){return-1===this.cmp(t)},s.prototype.lten=function(t){return this.cmpn(t)<=0},s.prototype.lte=function(t){return this.cmp(t)<=0},s.prototype.eqn=function(t){return 0===this.cmpn(t)},s.prototype.eq=function(t){return 0===this.cmp(t)},s.red=function(t){return new k(t)},s.prototype.toRed=function(t){return r(!this.red,"Already a number in reduction context"),r(0===this.negative,"red works only with positives"),t.convertTo(this)._forceRed(t)},s.prototype.fromRed=function(){return r(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},s.prototype._forceRed=function(t){return this.red=t,this},s.prototype.forceRed=function(t){return r(!this.red,"Already a number in reduction context"),this._forceRed(t)},s.prototype.redAdd=function(t){return r(this.red,"redAdd works only with red numbers"),this.red.add(this,t)},s.prototype.redIAdd=function(t){return r(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,t)},s.prototype.redSub=function(t){return r(this.red,"redSub works only with red numbers"),this.red.sub(this,t)},s.prototype.redISub=function(t){return r(this.red,"redISub works only with red numbers"),this.red.isub(this,t)},s.prototype.redShl=function(t){return r(this.red,"redShl works only with red numbers"),this.red.shl(this,t)},s.prototype.redMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.mul(this,t)},s.prototype.redIMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.imul(this,t)},s.prototype.redSqr=function(){return r(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},s.prototype.redISqr=function(){return r(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},s.prototype.redSqrt=function(){return r(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},s.prototype.redInvm=function(){return r(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},s.prototype.redNeg=function(){return r(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},s.prototype.redPow=function(t){return r(this.red&&!t.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,t)};var b={k256:null,p224:null,p192:null,p25519:null};function v(t,e){this.name=t,this.p=new s(e,16),this.n=this.p.bitLength(),this.k=new s(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function y(){v.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function w(){v.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function _(){v.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function M(){v.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function k(t){if("string"==typeof t){var e=s._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),"modulus must be greater than 1"),this.m=t,this.prime=null}function x(t){k.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new s(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}v.prototype._tmp=function(){var t=new s(null);return t.words=new Array(Math.ceil(this.n/13)),t},v.prototype.ireduce=function(t){var e,i=t;do{this.split(i,this.tmp),e=(i=(i=this.imulK(i)).iadd(this.tmp)).bitLength()}while(e>this.n);var r=e0?i.isub(this.p):void 0!==i.strip?i.strip():i._strip(),i},v.prototype.split=function(t,e){t.iushrn(this.n,0,e)},v.prototype.imulK=function(t){return t.imul(this.k)},n(y,v),y.prototype.split=function(t,e){for(var i=4194303,r=Math.min(t.length,9),n=0;n>>22,s=o}s>>>=22,t.words[n-10]=s,0===s&&t.length>10?t.length-=10:t.length-=9},y.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,i=0;i>>=26,t.words[i]=n,e=r}return 0!==e&&(t.words[t.length++]=e),t},s._prime=function(t){if(b[t])return b[t];var e;if("k256"===t)e=new y;else if("p224"===t)e=new w;else if("p192"===t)e=new _;else{if("p25519"!==t)throw new Error("Unknown prime "+t);e=new M}return b[t]=e,e},k.prototype._verify1=function(t){r(0===t.negative,"red works only with positives"),r(t.red,"red works only with red numbers")},k.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),"red works only with positives"),r(t.red&&t.red===e.red,"red works only with red numbers")},k.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):t.umod(this.m)._forceRed(this)},k.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},k.prototype.add=function(t,e){this._verify2(t,e);var i=t.add(e);return i.cmp(this.m)>=0&&i.isub(this.m),i._forceRed(this)},k.prototype.iadd=function(t,e){this._verify2(t,e);var i=t.iadd(e);return i.cmp(this.m)>=0&&i.isub(this.m),i},k.prototype.sub=function(t,e){this._verify2(t,e);var i=t.sub(e);return i.cmpn(0)<0&&i.iadd(this.m),i._forceRed(this)},k.prototype.isub=function(t,e){this._verify2(t,e);var i=t.isub(e);return i.cmpn(0)<0&&i.iadd(this.m),i},k.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},k.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},k.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},k.prototype.isqr=function(t){return this.imul(t,t.clone())},k.prototype.sqr=function(t){return this.mul(t,t)},k.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var i=this.m.add(new s(1)).iushrn(2);return this.pow(t,i)}for(var n=this.m.subn(1),o=0;!n.isZero()&&0===n.andln(1);)o++,n.iushrn(1);r(!n.isZero());var a=new s(1).toRed(this),h=a.redNeg(),u=this.m.subn(1).iushrn(1),l=this.m.bitLength();for(l=new s(2*l*l).toRed(this);0!==this.pow(l,u).cmp(h);)l.redIAdd(h);for(var c=this.pow(l,n),d=this.pow(t,n.addn(1).iushrn(1)),f=this.pow(t,n),p=o;0!==f.cmp(a);){for(var m=f,g=0;0!==m.cmp(a);g++)m=m.redSqr();r(g=0;r--){for(var u=e.words[r],l=h-1;l>=0;l--){var c=u>>l&1;n!==i[0]&&(n=this.sqr(n)),0!==c||0!==o?(o<<=1,o|=c,(4==++a||0===r&&0===l)&&(n=this.mul(n,i[o]),a=0,o=0)):a=0}h=26}return n},k.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},k.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},s.mont=function(t){return new x(t)},n(x,k),x.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},x.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},x.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var i=t.imul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),s=n;return n.cmp(this.m)>=0?s=n.isub(this.m):n.cmpn(0)<0&&(s=n.iadd(this.m)),s._forceRed(this)},x.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new s(0)._forceRed(this);var i=t.mul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),o=n;return n.cmp(this.m)>=0?o=n.isub(this.m):n.cmpn(0)<0&&(o=n.iadd(this.m)),o._forceRed(this)},x.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(t=i.nmd(t),this)},2840:(t,e,i)=>{var r=i(9590),n=i(778),s=function(){},o=function(t,e,i){if("function"==typeof e)return o(t,null,e);e||(e={}),i=n(i||s);var a=t._writableState,h=t._readableState,u=e.readable||!1!==e.readable&&t.readable,l=e.writable||!1!==e.writable&&t.writable,c=!1,d=function(){t.writable||f()},f=function(){l=!1,u||i.call(t)},p=function(){u=!1,l||i.call(t)},m=function(e){i.call(t,e?new Error("exited with error code: "+e):null)},g=function(e){i.call(t,e)},b=function(){r.nextTick(v)},v=function(){if(!c)return(!u||h&&h.ended&&!h.destroyed)&&(!l||a&&a.ended&&!a.destroyed)?void 0:i.call(t,new Error("premature close"))},y=function(){t.req.on("finish",f)};return function(t){return t.setHeader&&"function"==typeof t.abort}(t)?(t.on("complete",f),t.on("abort",b),t.req?y():t.on("request",y)):l&&!a&&(t.on("end",d),t.on("close",d)),function(t){return t.stdio&&Array.isArray(t.stdio)&&3===t.stdio.length}(t)&&t.on("exit",m),t.on("end",p),t.on("finish",f),!1!==e.error&&t.on("error",g),t.on("close",b),function(){c=!0,t.removeListener("complete",f),t.removeListener("abort",b),t.removeListener("request",y),t.req&&t.req.removeListener("finish",f),t.removeListener("end",d),t.removeListener("close",d),t.removeListener("finish",f),t.removeListener("exit",m),t.removeListener("end",p),t.removeListener("error",g),t.removeListener("close",b)}};t.exports=o},2114:t=>{"use strict";function e(t,e){for(const i in e)Object.defineProperty(t,i,{value:e[i],enumerable:!0,configurable:!0});return t}t.exports=function(t,i,r){if(!t||"string"==typeof t)throw new TypeError("Please pass an Error to err-code");r||(r={}),"object"==typeof i&&(r=i,i=""),i&&(r.code=i);try{return e(t,r)}catch(i){r.message=t.message,r.stack=t.stack;const n=function(){};return n.prototype=Object.create(Object.getPrototypeOf(t)),e(new n,r)}}},8091:t=>{"use strict";function e(t,e){if(null==t)throw new TypeError("Cannot convert first argument to object");for(var i=Object(t),r=1;r{"use strict";var r,n=i(5108),s="object"==typeof Reflect?Reflect:null,o=s&&"function"==typeof s.apply?s.apply:function(t,e,i){return Function.prototype.apply.call(t,e,i)};r=s&&"function"==typeof s.ownKeys?s.ownKeys:Object.getOwnPropertySymbols?function(t){return Object.getOwnPropertyNames(t).concat(Object.getOwnPropertySymbols(t))}:function(t){return Object.getOwnPropertyNames(t)};var a=Number.isNaN||function(t){return t!=t};function h(){h.init.call(this)}t.exports=h,t.exports.once=function(t,e){return new Promise((function(i,r){function n(i){t.removeListener(e,s),r(i)}function s(){"function"==typeof t.removeListener&&t.removeListener("error",n),i([].slice.call(arguments))}v(t,e,s,{once:!0}),"error"!==e&&function(t,e,i){"function"==typeof t.on&&v(t,"error",e,{once:!0})}(t,n)}))},h.EventEmitter=h,h.prototype._events=void 0,h.prototype._eventsCount=0,h.prototype._maxListeners=void 0;var u=10;function l(t){if("function"!=typeof t)throw new TypeError('The "listener" argument must be of type Function. Received type '+typeof t)}function c(t){return void 0===t._maxListeners?h.defaultMaxListeners:t._maxListeners}function d(t,e,i,r){var s,o,a,h;if(l(i),void 0===(o=t._events)?(o=t._events=Object.create(null),t._eventsCount=0):(void 0!==o.newListener&&(t.emit("newListener",e,i.listener?i.listener:i),o=t._events),a=o[e]),void 0===a)a=o[e]=i,++t._eventsCount;else if("function"==typeof a?a=o[e]=r?[i,a]:[a,i]:r?a.unshift(i):a.push(i),(s=c(t))>0&&a.length>s&&!a.warned){a.warned=!0;var u=new Error("Possible EventEmitter memory leak detected. "+a.length+" "+String(e)+" listeners added. Use emitter.setMaxListeners() to increase limit");u.name="MaxListenersExceededWarning",u.emitter=t,u.type=e,u.count=a.length,h=u,n&&n.warn&&n.warn(h)}return t}function f(){if(!this.fired)return this.target.removeListener(this.type,this.wrapFn),this.fired=!0,0===arguments.length?this.listener.call(this.target):this.listener.apply(this.target,arguments)}function p(t,e,i){var r={fired:!1,wrapFn:void 0,target:t,type:e,listener:i},n=f.bind(r);return n.listener=i,r.wrapFn=n,n}function m(t,e,i){var r=t._events;if(void 0===r)return[];var n=r[e];return void 0===n?[]:"function"==typeof n?i?[n.listener||n]:[n]:i?function(t){for(var e=new Array(t.length),i=0;i0&&(s=e[0]),s instanceof Error)throw s;var a=new Error("Unhandled error."+(s?" ("+s.message+")":""));throw a.context=s,a}var h=n[t];if(void 0===h)return!1;if("function"==typeof h)o(h,this,e);else{var u=h.length,l=b(h,u);for(i=0;i=0;s--)if(i[s]===e||i[s].listener===e){o=i[s].listener,n=s;break}if(n<0)return this;0===n?i.shift():function(t,e){for(;e+1=0;r--)this.removeListener(t,e[r]);return this},h.prototype.listeners=function(t){return m(this,t,!0)},h.prototype.rawListeners=function(t){return m(this,t,!1)},h.listenerCount=function(t,e){return"function"==typeof t.listenerCount?t.listenerCount(e):g.call(t,e)},h.prototype.listenerCount=g,h.prototype.eventNames=function(){return this._eventsCount>0?r(this._events):[]}},3048:(t,e,i)=>{var r=i(9509).Buffer,n=i(2318);t.exports=function(t,e,i,s){if(r.isBuffer(t)||(t=r.from(t,"binary")),e&&(r.isBuffer(e)||(e=r.from(e,"binary")),8!==e.length))throw new RangeError("salt should be Buffer with 8 byte length");for(var o=i/8,a=r.alloc(o),h=r.alloc(s||0),u=r.alloc(0);o>0||s>0;){var l=new n;l.update(u),l.update(t),e&&l.update(e),u=l.digest();var c=0;if(o>0){var d=a.length-o;c=Math.min(o,u.length),u.copy(a,d,0,c),o-=c}if(c0){var f=h.length-s,p=Math.min(s,u.length-c);u.copy(h,f,c,c+p),s-=p}}return u.fill(0),{key:a,iv:h}}},3975:t=>{t.exports=class{constructor(t){if(!(t>0)||0!=(t-1&t))throw new Error("Max size for a FixedFIFO should be a power of two");this.buffer=new Array(t),this.mask=t-1,this.top=0,this.btm=0,this.next=null}push(t){return void 0===this.buffer[this.top]&&(this.buffer[this.top]=t,this.top=this.top+1&this.mask,!0)}shift(){const t=this.buffer[this.btm];if(void 0!==t)return this.buffer[this.btm]=void 0,this.btm=this.btm+1&this.mask,t}peek(){return this.buffer[this.btm]}isEmpty(){return void 0===this.buffer[this.btm]}}},1607:(t,e,i)=>{const r=i(3975);t.exports=class{constructor(t){this.hwm=t||16,this.head=new r(this.hwm),this.tail=this.head}push(t){if(!this.head.push(t)){const e=this.head;this.head=e.next=new r(2*this.head.buffer.length),this.head.push(t)}}shift(){const t=this.tail.shift();if(void 0===t&&this.tail.next){const t=this.tail.next;return this.tail.next=null,this.tail=t,this.tail.shift()}return t}peek(){return this.tail.peek()}isEmpty(){return this.head.isEmpty()}}},452:(t,e,i)=>{const{Readable:r}=i(8473),n=i(5054);t.exports=class extends r{constructor(t,e={}){super(e),this._offset=0,this._ready=!1,this._file=t,this._size=t.size,this._chunkSize=e.chunkSize||Math.max(this._size/1e3,204800);const i=new FileReader;i.onload=()=>{this.push(n(i.result))},i.onerror=()=>{this.emit("error",i.error)},this.reader=i,this._generateHeaderBlocks(t,e,((t,e)=>{if(t)return this.emit("error",t);Array.isArray(e)&&e.forEach((t=>this.push(t))),this._ready=!0,this.emit("_ready")}))}_generateHeaderBlocks(t,e,i){i(null,[])}_read(){if(!this._ready)return void this.once("_ready",this._read.bind(this));const t=this._offset;let e=this._offset+this._chunkSize;if(e>this._size&&(e=this._size),t===this._size)return this.destroy(),void this.push(null);this.reader.readAsArrayBuffer(this._file.slice(t,e)),this._offset=e}destroy(){if(this._file=null,this.reader){this.reader.onload=null,this.reader.onerror=null;try{this.reader.abort()}catch(t){}}this.reader=null}}},9804:t=>{var e=Object.prototype.hasOwnProperty,i=Object.prototype.toString;t.exports=function(t,r,n){if("[object Function]"!==i.call(r))throw new TypeError("iterator must be a function");var s=t.length;if(s===+s)for(var o=0;o{"use strict";var e="Function.prototype.bind called on incompatible ",i=Array.prototype.slice,r=Object.prototype.toString,n="[object Function]";t.exports=function(t){var s=this;if("function"!=typeof s||r.call(s)!==n)throw new TypeError(e+s);for(var o,a=i.call(arguments,1),h=function(){if(this instanceof o){var e=s.apply(this,a.concat(i.call(arguments)));return Object(e)===e?e:this}return s.apply(t,a.concat(i.call(arguments)))},u=Math.max(0,s.length-a.length),l=[],c=0;c{"use strict";var r=i(7648);t.exports=Function.prototype.bind||r},5177:t=>{t.exports=function(){if("undefined"==typeof globalThis)return null;var t={RTCPeerConnection:globalThis.RTCPeerConnection||globalThis.mozRTCPeerConnection||globalThis.webkitRTCPeerConnection,RTCSessionDescription:globalThis.RTCSessionDescription||globalThis.mozRTCSessionDescription||globalThis.webkitRTCSessionDescription,RTCIceCandidate:globalThis.RTCIceCandidate||globalThis.mozRTCIceCandidate||globalThis.webkitRTCIceCandidate};return t.RTCPeerConnection?t:null}},210:(t,e,i)=>{"use strict";var r,n=SyntaxError,s=Function,o=TypeError,a=function(t){try{return s('"use strict"; return ('+t+").constructor;")()}catch(t){}},h=Object.getOwnPropertyDescriptor;if(h)try{h({},"")}catch(t){h=null}var u=function(){throw new o},l=h?function(){try{return u}catch(t){try{return h(arguments,"callee").get}catch(t){return u}}}():u,c=i(1405)(),d=Object.getPrototypeOf||function(t){return t.__proto__},f={},p="undefined"==typeof Uint8Array?r:d(Uint8Array),m={"%AggregateError%":"undefined"==typeof AggregateError?r:AggregateError,"%Array%":Array,"%ArrayBuffer%":"undefined"==typeof ArrayBuffer?r:ArrayBuffer,"%ArrayIteratorPrototype%":c?d([][Symbol.iterator]()):r,"%AsyncFromSyncIteratorPrototype%":r,"%AsyncFunction%":f,"%AsyncGenerator%":f,"%AsyncGeneratorFunction%":f,"%AsyncIteratorPrototype%":f,"%Atomics%":"undefined"==typeof Atomics?r:Atomics,"%BigInt%":"undefined"==typeof BigInt?r:BigInt,"%Boolean%":Boolean,"%DataView%":"undefined"==typeof DataView?r:DataView,"%Date%":Date,"%decodeURI%":decodeURI,"%decodeURIComponent%":decodeURIComponent,"%encodeURI%":encodeURI,"%encodeURIComponent%":encodeURIComponent,"%Error%":Error,"%eval%":eval,"%EvalError%":EvalError,"%Float32Array%":"undefined"==typeof Float32Array?r:Float32Array,"%Float64Array%":"undefined"==typeof Float64Array?r:Float64Array,"%FinalizationRegistry%":"undefined"==typeof FinalizationRegistry?r:FinalizationRegistry,"%Function%":s,"%GeneratorFunction%":f,"%Int8Array%":"undefined"==typeof Int8Array?r:Int8Array,"%Int16Array%":"undefined"==typeof Int16Array?r:Int16Array,"%Int32Array%":"undefined"==typeof Int32Array?r:Int32Array,"%isFinite%":isFinite,"%isNaN%":isNaN,"%IteratorPrototype%":c?d(d([][Symbol.iterator]())):r,"%JSON%":"object"==typeof JSON?JSON:r,"%Map%":"undefined"==typeof Map?r:Map,"%MapIteratorPrototype%":"undefined"!=typeof Map&&c?d((new Map)[Symbol.iterator]()):r,"%Math%":Math,"%Number%":Number,"%Object%":Object,"%parseFloat%":parseFloat,"%parseInt%":parseInt,"%Promise%":"undefined"==typeof Promise?r:Promise,"%Proxy%":"undefined"==typeof Proxy?r:Proxy,"%RangeError%":RangeError,"%ReferenceError%":ReferenceError,"%Reflect%":"undefined"==typeof Reflect?r:Reflect,"%RegExp%":RegExp,"%Set%":"undefined"==typeof Set?r:Set,"%SetIteratorPrototype%":"undefined"!=typeof Set&&c?d((new Set)[Symbol.iterator]()):r,"%SharedArrayBuffer%":"undefined"==typeof SharedArrayBuffer?r:SharedArrayBuffer,"%String%":String,"%StringIteratorPrototype%":c?d(""[Symbol.iterator]()):r,"%Symbol%":c?Symbol:r,"%SyntaxError%":n,"%ThrowTypeError%":l,"%TypedArray%":p,"%TypeError%":o,"%Uint8Array%":"undefined"==typeof Uint8Array?r:Uint8Array,"%Uint8ClampedArray%":"undefined"==typeof Uint8ClampedArray?r:Uint8ClampedArray,"%Uint16Array%":"undefined"==typeof Uint16Array?r:Uint16Array,"%Uint32Array%":"undefined"==typeof Uint32Array?r:Uint32Array,"%URIError%":URIError,"%WeakMap%":"undefined"==typeof WeakMap?r:WeakMap,"%WeakRef%":"undefined"==typeof WeakRef?r:WeakRef,"%WeakSet%":"undefined"==typeof WeakSet?r:WeakSet},g=function t(e){var i;if("%AsyncFunction%"===e)i=a("async function () {}");else if("%GeneratorFunction%"===e)i=a("function* () {}");else if("%AsyncGeneratorFunction%"===e)i=a("async function* () {}");else if("%AsyncGenerator%"===e){var r=t("%AsyncGeneratorFunction%");r&&(i=r.prototype)}else if("%AsyncIteratorPrototype%"===e){var n=t("%AsyncGenerator%");n&&(i=d(n.prototype))}return m[e]=i,i},b={"%ArrayBufferPrototype%":["ArrayBuffer","prototype"],"%ArrayPrototype%":["Array","prototype"],"%ArrayProto_entries%":["Array","prototype","entries"],"%ArrayProto_forEach%":["Array","prototype","forEach"],"%ArrayProto_keys%":["Array","prototype","keys"],"%ArrayProto_values%":["Array","prototype","values"],"%AsyncFunctionPrototype%":["AsyncFunction","prototype"],"%AsyncGenerator%":["AsyncGeneratorFunction","prototype"],"%AsyncGeneratorPrototype%":["AsyncGeneratorFunction","prototype","prototype"],"%BooleanPrototype%":["Boolean","prototype"],"%DataViewPrototype%":["DataView","prototype"],"%DatePrototype%":["Date","prototype"],"%ErrorPrototype%":["Error","prototype"],"%EvalErrorPrototype%":["EvalError","prototype"],"%Float32ArrayPrototype%":["Float32Array","prototype"],"%Float64ArrayPrototype%":["Float64Array","prototype"],"%FunctionPrototype%":["Function","prototype"],"%Generator%":["GeneratorFunction","prototype"],"%GeneratorPrototype%":["GeneratorFunction","prototype","prototype"],"%Int8ArrayPrototype%":["Int8Array","prototype"],"%Int16ArrayPrototype%":["Int16Array","prototype"],"%Int32ArrayPrototype%":["Int32Array","prototype"],"%JSONParse%":["JSON","parse"],"%JSONStringify%":["JSON","stringify"],"%MapPrototype%":["Map","prototype"],"%NumberPrototype%":["Number","prototype"],"%ObjectPrototype%":["Object","prototype"],"%ObjProto_toString%":["Object","prototype","toString"],"%ObjProto_valueOf%":["Object","prototype","valueOf"],"%PromisePrototype%":["Promise","prototype"],"%PromiseProto_then%":["Promise","prototype","then"],"%Promise_all%":["Promise","all"],"%Promise_reject%":["Promise","reject"],"%Promise_resolve%":["Promise","resolve"],"%RangeErrorPrototype%":["RangeError","prototype"],"%ReferenceErrorPrototype%":["ReferenceError","prototype"],"%RegExpPrototype%":["RegExp","prototype"],"%SetPrototype%":["Set","prototype"],"%SharedArrayBufferPrototype%":["SharedArrayBuffer","prototype"],"%StringPrototype%":["String","prototype"],"%SymbolPrototype%":["Symbol","prototype"],"%SyntaxErrorPrototype%":["SyntaxError","prototype"],"%TypedArrayPrototype%":["TypedArray","prototype"],"%TypeErrorPrototype%":["TypeError","prototype"],"%Uint8ArrayPrototype%":["Uint8Array","prototype"],"%Uint8ClampedArrayPrototype%":["Uint8ClampedArray","prototype"],"%Uint16ArrayPrototype%":["Uint16Array","prototype"],"%Uint32ArrayPrototype%":["Uint32Array","prototype"],"%URIErrorPrototype%":["URIError","prototype"],"%WeakMapPrototype%":["WeakMap","prototype"],"%WeakSetPrototype%":["WeakSet","prototype"]},v=i(8612),y=i(7642),w=v.call(Function.call,Array.prototype.concat),_=v.call(Function.apply,Array.prototype.splice),M=v.call(Function.call,String.prototype.replace),k=v.call(Function.call,String.prototype.slice),x=/[^%.[\]]+|\[(?:(-?\d+(?:\.\d+)?)|(["'])((?:(?!\2)[^\\]|\\.)*?)\2)\]|(?=(?:\.|\[\])(?:\.|\[\]|%$))/g,E=/\\(\\)?/g,S=function(t){var e=k(t,0,1),i=k(t,-1);if("%"===e&&"%"!==i)throw new n("invalid intrinsic syntax, expected closing `%`");if("%"===i&&"%"!==e)throw new n("invalid intrinsic syntax, expected opening `%`");var r=[];return M(t,x,(function(t,e,i,n){r[r.length]=i?M(n,E,"$1"):e||t})),r},T=function(t,e){var i,r=t;if(y(b,r)&&(r="%"+(i=b[r])[0]+"%"),y(m,r)){var s=m[r];if(s===f&&(s=g(r)),void 0===s&&!e)throw new o("intrinsic "+t+" exists, but is not available. Please file an issue!");return{alias:i,name:r,value:s}}throw new n("intrinsic "+t+" does not exist!")};t.exports=function(t,e){if("string"!=typeof t||0===t.length)throw new o("intrinsic name must be a non-empty string");if(arguments.length>1&&"boolean"!=typeof e)throw new o('"allowMissing" argument must be a boolean');var i=S(t),r=i.length>0?i[0]:"",s=T("%"+r+"%",e),a=s.name,u=s.value,l=!1,c=s.alias;c&&(r=c[0],_(i,w([0,1],c)));for(var d=1,f=!0;d=i.length){var v=h(u,p);u=(f=!!v)&&"get"in v&&!("originalValue"in v.get)?v.get:u[p]}else f=y(u,p),u=u[p];f&&!l&&(m[a]=u)}}return u}},1405:(t,e,i)=>{"use strict";var r="undefined"!=typeof Symbol&&Symbol,n=i(5419);t.exports=function(){return"function"==typeof r&&"function"==typeof Symbol&&"symbol"==typeof r("foo")&&"symbol"==typeof Symbol("bar")&&n()}},5419:t=>{"use strict";t.exports=function(){if("function"!=typeof Symbol||"function"!=typeof Object.getOwnPropertySymbols)return!1;if("symbol"==typeof Symbol.iterator)return!0;var t={},e=Symbol("test"),i=Object(e);if("string"==typeof e)return!1;if("[object Symbol]"!==Object.prototype.toString.call(e))return!1;if("[object Symbol]"!==Object.prototype.toString.call(i))return!1;for(e in t[e]=42,t)return!1;if("function"==typeof Object.keys&&0!==Object.keys(t).length)return!1;if("function"==typeof Object.getOwnPropertyNames&&0!==Object.getOwnPropertyNames(t).length)return!1;var r=Object.getOwnPropertySymbols(t);if(1!==r.length||r[0]!==e)return!1;if(!Object.prototype.propertyIsEnumerable.call(t,e))return!1;if("function"==typeof Object.getOwnPropertyDescriptor){var n=Object.getOwnPropertyDescriptor(t,e);if(42!==n.value||!0!==n.enumerable)return!1}return!0}},6410:(t,e,i)=>{"use strict";var r=i(5419);t.exports=function(){return r()&&!!Symbol.toStringTag}},7642:(t,e,i)=>{"use strict";var r=i(8612);t.exports=r.call(Function.call,Object.prototype.hasOwnProperty)},3349:(t,e,i)=>{"use strict";var r=i(9509).Buffer,n=i(8473).Transform;function s(t){n.call(this),this._block=r.allocUnsafe(t),this._blockSize=t,this._blockOffset=0,this._length=[0,0,0,0],this._finalized=!1}i(5717)(s,n),s.prototype._transform=function(t,e,i){var r=null;try{this.update(t,e)}catch(t){r=t}i(r)},s.prototype._flush=function(t){var e=null;try{this.push(this.digest())}catch(t){e=t}t(e)},s.prototype.update=function(t,e){if(function(t,e){if(!r.isBuffer(t)&&"string"!=typeof t)throw new TypeError("Data must be a string or a buffer")}(t),this._finalized)throw new Error("Digest already called");r.isBuffer(t)||(t=r.from(t,e));for(var i=this._block,n=0;this._blockOffset+t.length-n>=this._blockSize;){for(var s=this._blockOffset;s0;++o)this._length[o]+=a,(a=this._length[o]/4294967296|0)>0&&(this._length[o]-=4294967296*a);return this},s.prototype._update=function(){throw new Error("_update is not implemented")},s.prototype.digest=function(t){if(this._finalized)throw new Error("Digest already called");this._finalized=!0;var e=this._digest();void 0!==t&&(e=e.toString(t)),this._block.fill(0),this._blockOffset=0;for(var i=0;i<4;++i)this._length[i]=0;return e},s.prototype._digest=function(){throw new Error("_digest is not implemented")},t.exports=s},3715:(t,e,i)=>{var r=e;r.utils=i(6436),r.common=i(5772),r.sha=i(9041),r.ripemd=i(2949),r.hmac=i(2344),r.sha1=r.sha.sha1,r.sha256=r.sha.sha256,r.sha224=r.sha.sha224,r.sha384=r.sha.sha384,r.sha512=r.sha.sha512,r.ripemd160=r.ripemd.ripemd160},5772:(t,e,i)=>{"use strict";var r=i(6436),n=i(9746);function s(){this.pending=null,this.pendingTotal=0,this.blockSize=this.constructor.blockSize,this.outSize=this.constructor.outSize,this.hmacStrength=this.constructor.hmacStrength,this.padLength=this.constructor.padLength/8,this.endian="big",this._delta8=this.blockSize/8,this._delta32=this.blockSize/32}e.BlockHash=s,s.prototype.update=function(t,e){if(t=r.toArray(t,e),this.pending?this.pending=this.pending.concat(t):this.pending=t,this.pendingTotal+=t.length,this.pending.length>=this._delta8){var i=(t=this.pending).length%this._delta8;this.pending=t.slice(t.length-i,t.length),0===this.pending.length&&(this.pending=null),t=r.join32(t,0,t.length-i,this.endian);for(var n=0;n>>24&255,r[n++]=t>>>16&255,r[n++]=t>>>8&255,r[n++]=255&t}else for(r[n++]=255&t,r[n++]=t>>>8&255,r[n++]=t>>>16&255,r[n++]=t>>>24&255,r[n++]=0,r[n++]=0,r[n++]=0,r[n++]=0,s=8;s{"use strict";var r=i(6436),n=i(9746);function s(t,e,i){if(!(this instanceof s))return new s(t,e,i);this.Hash=t,this.blockSize=t.blockSize/8,this.outSize=t.outSize/8,this.inner=null,this.outer=null,this._init(r.toArray(e,i))}t.exports=s,s.prototype._init=function(t){t.length>this.blockSize&&(t=(new this.Hash).update(t).digest()),n(t.length<=this.blockSize);for(var e=t.length;e{"use strict";var r=i(6436),n=i(5772),s=r.rotl32,o=r.sum32,a=r.sum32_3,h=r.sum32_4,u=n.BlockHash;function l(){if(!(this instanceof l))return new l;u.call(this),this.h=[1732584193,4023233417,2562383102,271733878,3285377520],this.endian="little"}function c(t,e,i,r){return t<=15?e^i^r:t<=31?e&i|~e&r:t<=47?(e|~i)^r:t<=63?e&r|i&~r:e^(i|~r)}function d(t){return t<=15?0:t<=31?1518500249:t<=47?1859775393:t<=63?2400959708:2840853838}function f(t){return t<=15?1352829926:t<=31?1548603684:t<=47?1836072691:t<=63?2053994217:0}r.inherits(l,u),e.ripemd160=l,l.blockSize=512,l.outSize=160,l.hmacStrength=192,l.padLength=64,l.prototype._update=function(t,e){for(var i=this.h[0],r=this.h[1],n=this.h[2],u=this.h[3],l=this.h[4],v=i,y=r,w=n,_=u,M=l,k=0;k<80;k++){var x=o(s(h(i,c(k,r,n,u),t[p[k]+e],d(k)),g[k]),l);i=l,l=u,u=s(n,10),n=r,r=x,x=o(s(h(v,c(79-k,y,w,_),t[m[k]+e],f(k)),b[k]),M),v=M,M=_,_=s(w,10),w=y,y=x}x=a(this.h[1],n,_),this.h[1]=a(this.h[2],u,M),this.h[2]=a(this.h[3],l,v),this.h[3]=a(this.h[4],i,y),this.h[4]=a(this.h[0],r,w),this.h[0]=x},l.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h,"little"):r.split32(this.h,"little")};var p=[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],m=[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],g=[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],b=[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]},9041:(t,e,i)=>{"use strict";e.sha1=i(4761),e.sha224=i(799),e.sha256=i(9344),e.sha384=i(772),e.sha512=i(5900)},4761:(t,e,i)=>{"use strict";var r=i(6436),n=i(5772),s=i(7038),o=r.rotl32,a=r.sum32,h=r.sum32_5,u=s.ft_1,l=n.BlockHash,c=[1518500249,1859775393,2400959708,3395469782];function d(){if(!(this instanceof d))return new d;l.call(this),this.h=[1732584193,4023233417,2562383102,271733878,3285377520],this.W=new Array(80)}r.inherits(d,l),t.exports=d,d.blockSize=512,d.outSize=160,d.hmacStrength=80,d.padLength=64,d.prototype._update=function(t,e){for(var i=this.W,r=0;r<16;r++)i[r]=t[e+r];for(;r{"use strict";var r=i(6436),n=i(9344);function s(){if(!(this instanceof s))return new s;n.call(this),this.h=[3238371032,914150663,812702999,4144912697,4290775857,1750603025,1694076839,3204075428]}r.inherits(s,n),t.exports=s,s.blockSize=512,s.outSize=224,s.hmacStrength=192,s.padLength=64,s.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h.slice(0,7),"big"):r.split32(this.h.slice(0,7),"big")}},9344:(t,e,i)=>{"use strict";var r=i(6436),n=i(5772),s=i(7038),o=i(9746),a=r.sum32,h=r.sum32_4,u=r.sum32_5,l=s.ch32,c=s.maj32,d=s.s0_256,f=s.s1_256,p=s.g0_256,m=s.g1_256,g=n.BlockHash,b=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298];function v(){if(!(this instanceof v))return new v;g.call(this),this.h=[1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225],this.k=b,this.W=new Array(64)}r.inherits(v,g),t.exports=v,v.blockSize=512,v.outSize=256,v.hmacStrength=192,v.padLength=64,v.prototype._update=function(t,e){for(var i=this.W,r=0;r<16;r++)i[r]=t[e+r];for(;r{"use strict";var r=i(6436),n=i(5900);function s(){if(!(this instanceof s))return new s;n.call(this),this.h=[3418070365,3238371032,1654270250,914150663,2438529370,812702999,355462360,4144912697,1731405415,4290775857,2394180231,1750603025,3675008525,1694076839,1203062813,3204075428]}r.inherits(s,n),t.exports=s,s.blockSize=1024,s.outSize=384,s.hmacStrength=192,s.padLength=128,s.prototype._digest=function(t){return"hex"===t?r.toHex32(this.h.slice(0,12),"big"):r.split32(this.h.slice(0,12),"big")}},5900:(t,e,i)=>{"use strict";var r=i(6436),n=i(5772),s=i(9746),o=r.rotr64_hi,a=r.rotr64_lo,h=r.shr64_hi,u=r.shr64_lo,l=r.sum64,c=r.sum64_hi,d=r.sum64_lo,f=r.sum64_4_hi,p=r.sum64_4_lo,m=r.sum64_5_hi,g=r.sum64_5_lo,b=n.BlockHash,v=[1116352408,3609767458,1899447441,602891725,3049323471,3964484399,3921009573,2173295548,961987163,4081628472,1508970993,3053834265,2453635748,2937671579,2870763221,3664609560,3624381080,2734883394,310598401,1164996542,607225278,1323610764,1426881987,3590304994,1925078388,4068182383,2162078206,991336113,2614888103,633803317,3248222580,3479774868,3835390401,2666613458,4022224774,944711139,264347078,2341262773,604807628,2007800933,770255983,1495990901,1249150122,1856431235,1555081692,3175218132,1996064986,2198950837,2554220882,3999719339,2821834349,766784016,2952996808,2566594879,3210313671,3203337956,3336571891,1034457026,3584528711,2466948901,113926993,3758326383,338241895,168717936,666307205,1188179964,773529912,1546045734,1294757372,1522805485,1396182291,2643833823,1695183700,2343527390,1986661051,1014477480,2177026350,1206759142,2456956037,344077627,2730485921,1290863460,2820302411,3158454273,3259730800,3505952657,3345764771,106217008,3516065817,3606008344,3600352804,1432725776,4094571909,1467031594,275423344,851169720,430227734,3100823752,506948616,1363258195,659060556,3750685593,883997877,3785050280,958139571,3318307427,1322822218,3812723403,1537002063,2003034995,1747873779,3602036899,1955562222,1575990012,2024104815,1125592928,2227730452,2716904306,2361852424,442776044,2428436474,593698344,2756734187,3733110249,3204031479,2999351573,3329325298,3815920427,3391569614,3928383900,3515267271,566280711,3940187606,3454069534,4118630271,4000239992,116418474,1914138554,174292421,2731055270,289380356,3203993006,460393269,320620315,685471733,587496836,852142971,1086792851,1017036298,365543100,1126000580,2618297676,1288033470,3409855158,1501505948,4234509866,1607167915,987167468,1816402316,1246189591];function y(){if(!(this instanceof y))return new y;b.call(this),this.h=[1779033703,4089235720,3144134277,2227873595,1013904242,4271175723,2773480762,1595750129,1359893119,2917565137,2600822924,725511199,528734635,4215389547,1541459225,327033209],this.k=v,this.W=new Array(160)}function w(t,e,i,r,n){var s=t&i^~t&n;return s<0&&(s+=4294967296),s}function _(t,e,i,r,n,s){var o=e&r^~e&s;return o<0&&(o+=4294967296),o}function M(t,e,i,r,n){var s=t&i^t&n^i&n;return s<0&&(s+=4294967296),s}function k(t,e,i,r,n,s){var o=e&r^e&s^r&s;return o<0&&(o+=4294967296),o}function x(t,e){var i=o(t,e,28)^o(e,t,2)^o(e,t,7);return i<0&&(i+=4294967296),i}function E(t,e){var i=a(t,e,28)^a(e,t,2)^a(e,t,7);return i<0&&(i+=4294967296),i}function S(t,e){var i=a(t,e,14)^a(t,e,18)^a(e,t,9);return i<0&&(i+=4294967296),i}function T(t,e){var i=o(t,e,1)^o(t,e,8)^h(t,e,7);return i<0&&(i+=4294967296),i}function A(t,e){var i=a(t,e,1)^a(t,e,8)^u(t,e,7);return i<0&&(i+=4294967296),i}function I(t,e){var i=a(t,e,19)^a(e,t,29)^u(t,e,6);return i<0&&(i+=4294967296),i}r.inherits(y,b),t.exports=y,y.blockSize=1024,y.outSize=512,y.hmacStrength=192,y.padLength=128,y.prototype._prepareBlock=function(t,e){for(var i=this.W,r=0;r<32;r++)i[r]=t[e+r];for(;r{"use strict";var r=i(6436).rotr32;function n(t,e,i){return t&e^~t&i}function s(t,e,i){return t&e^t&i^e&i}function o(t,e,i){return t^e^i}e.ft_1=function(t,e,i,r){return 0===t?n(e,i,r):1===t||3===t?o(e,i,r):2===t?s(e,i,r):void 0},e.ch32=n,e.maj32=s,e.p32=o,e.s0_256=function(t){return r(t,2)^r(t,13)^r(t,22)},e.s1_256=function(t){return r(t,6)^r(t,11)^r(t,25)},e.g0_256=function(t){return r(t,7)^r(t,18)^t>>>3},e.g1_256=function(t){return r(t,17)^r(t,19)^t>>>10}},6436:(t,e,i)=>{"use strict";var r=i(9746),n=i(5717);function s(t,e){return 55296==(64512&t.charCodeAt(e))&&!(e<0||e+1>=t.length)&&56320==(64512&t.charCodeAt(e+1))}function o(t){return(t>>>24|t>>>8&65280|t<<8&16711680|(255&t)<<24)>>>0}function a(t){return 1===t.length?"0"+t:t}function h(t){return 7===t.length?"0"+t:6===t.length?"00"+t:5===t.length?"000"+t:4===t.length?"0000"+t:3===t.length?"00000"+t:2===t.length?"000000"+t:1===t.length?"0000000"+t:t}e.inherits=n,e.toArray=function(t,e){if(Array.isArray(t))return t.slice();if(!t)return[];var i=[];if("string"==typeof t)if(e){if("hex"===e)for((t=t.replace(/[^a-z0-9]+/gi,"")).length%2!=0&&(t="0"+t),n=0;n>6|192,i[r++]=63&o|128):s(t,n)?(o=65536+((1023&o)<<10)+(1023&t.charCodeAt(++n)),i[r++]=o>>18|240,i[r++]=o>>12&63|128,i[r++]=o>>6&63|128,i[r++]=63&o|128):(i[r++]=o>>12|224,i[r++]=o>>6&63|128,i[r++]=63&o|128)}else for(n=0;n>>0}return o},e.split32=function(t,e){for(var i=new Array(4*t.length),r=0,n=0;r>>24,i[n+1]=s>>>16&255,i[n+2]=s>>>8&255,i[n+3]=255&s):(i[n+3]=s>>>24,i[n+2]=s>>>16&255,i[n+1]=s>>>8&255,i[n]=255&s)}return i},e.rotr32=function(t,e){return t>>>e|t<<32-e},e.rotl32=function(t,e){return t<>>32-e},e.sum32=function(t,e){return t+e>>>0},e.sum32_3=function(t,e,i){return t+e+i>>>0},e.sum32_4=function(t,e,i,r){return t+e+i+r>>>0},e.sum32_5=function(t,e,i,r,n){return t+e+i+r+n>>>0},e.sum64=function(t,e,i,r){var n=t[e],s=r+t[e+1]>>>0,o=(s>>0,t[e+1]=s},e.sum64_hi=function(t,e,i,r){return(e+r>>>0>>0},e.sum64_lo=function(t,e,i,r){return e+r>>>0},e.sum64_4_hi=function(t,e,i,r,n,s,o,a){var h=0,u=e;return h+=(u=u+r>>>0)>>0)>>0)>>0},e.sum64_4_lo=function(t,e,i,r,n,s,o,a){return e+r+s+a>>>0},e.sum64_5_hi=function(t,e,i,r,n,s,o,a,h,u){var l=0,c=e;return l+=(c=c+r>>>0)>>0)>>0)>>0)>>0},e.sum64_5_lo=function(t,e,i,r,n,s,o,a,h,u){return e+r+s+a+u>>>0},e.rotr64_hi=function(t,e,i){return(e<<32-i|t>>>i)>>>0},e.rotr64_lo=function(t,e,i){return(t<<32-i|e>>>i)>>>0},e.shr64_hi=function(t,e,i){return t>>>i},e.shr64_lo=function(t,e,i){return(t<<32-i|e>>>i)>>>0}},2156:(t,e,i)=>{"use strict";var r=i(3715),n=i(4504),s=i(9746);function o(t){if(!(this instanceof o))return new o(t);this.hash=t.hash,this.predResist=!!t.predResist,this.outLen=this.hash.outSize,this.minEntropy=t.minEntropy||this.hash.hmacStrength,this._reseed=null,this.reseedInterval=null,this.K=null,this.V=null;var e=n.toArray(t.entropy,t.entropyEnc||"hex"),i=n.toArray(t.nonce,t.nonceEnc||"hex"),r=n.toArray(t.pers,t.persEnc||"hex");s(e.length>=this.minEntropy/8,"Not enough entropy. Minimum is: "+this.minEntropy+" bits"),this._init(e,i,r)}t.exports=o,o.prototype._init=function(t,e,i){var r=t.concat(e).concat(i);this.K=new Array(this.outLen/8),this.V=new Array(this.outLen/8);for(var n=0;n=this.minEntropy/8,"Not enough entropy. Minimum is: "+this.minEntropy+" bits"),this._update(t.concat(i||[])),this._reseed=1},o.prototype.generate=function(t,e,i,r){if(this._reseed>this.reseedInterval)throw new Error("Reseed is required");"string"!=typeof e&&(r=i,i=e,e=null),i&&(i=n.toArray(i,r||"hex"),this._update(i));for(var s=[];s.length{var r=i(8501),n=i(8575),s=t.exports;for(var o in r)r.hasOwnProperty(o)&&(s[o]=r[o]);function a(t){if("string"==typeof t&&(t=n.parse(t)),t.protocol||(t.protocol="https:"),"https:"!==t.protocol)throw new Error('Protocol "'+t.protocol+'" not supported. Expected "https:"');return t}s.request=function(t,e){return t=a(t),r.request.call(this,t,e)},s.get=function(t,e){return t=a(t),r.get.call(this,t,e)}},4137:(t,e,i)=>{"use strict";var r=i(8764).Buffer;const n=i(3029),s=i(7187).EventEmitter,o=i(4375);t.exports=class extends s{constructor(t,e){if(e||(e={}),super(),this.chunkLength=Number(t),!this.chunkLength)throw new Error("First argument must be a chunk length");this.closed=!1,this.destroyed=!1,this.length=Number(e.length)||1/0,this.name=e.name||"idb-chunk-store",this.length!==1/0&&(this.lastChunkLength=this.length%this.chunkLength||this.chunkLength,this.lastChunkIndex=Math.ceil(this.length/this.chunkLength)-1),this.dbPromise=n.openDB(this.name,void 0,{upgrade:t=>{t.createObjectStore("chunks")},blocking:()=>{this.close()},terminated:()=>{this.closed=!0,this.emit("error",new Error("Database unexpectedly closed"))}})}put(t,e,i=(()=>{})){if(this.closed)return o((()=>i(new Error("Storage is closed"))));const r=t===this.lastChunkIndex;return r&&e.length!==this.lastChunkLength?o((()=>i(new Error("Last chunk length must be "+this.lastChunkLength)))):r||e.length===this.chunkLength?(0===(e=new Uint8Array(e.buffer,e.byteOffset,e.byteLength)).byteOffset&&e.byteLength===e.buffer.byteLength||(e=e.slice()),void(async()=>{try{const i=await this.dbPromise;await i.put("chunks",e,t)}catch(t){return void i(t)}i(null)})()):o((()=>i(new Error("Chunk length must be "+this.chunkLength))))}get(t,e,i=(()=>{})){return"function"==typeof e?this.get(t,{},e):(e||(e={}),this.closed?o((()=>i(new Error("Storage is closed")))):void(async()=>{let n;try{const e=await this.dbPromise;n=await e.get("chunks",t)}catch(t){return void i(t)}if(null==n){const t=new Error("Chunk not found");return t.notFound=!0,void i(t)}let s=r.from(n.buffer,n.byteOffset,n.byteLength);const o=e.offset||0,a=e.length||s.length-o;0===o&&a===s.length||(s=s.slice(o,a+o)),i(null,s)})())}close(t=(()=>{})){if(this.closed)return o((()=>t(new Error("Storage is closed"))));this.closed=!0,(async()=>{try{(await this.dbPromise).close()}catch(e){return void t(e)}t(null)})()}destroy(t=(()=>{})){return this.closed?o((()=>t(new Error("Storage is closed")))):this.destroyed?o((()=>t(new Error("Storage is destroyed")))):(this.destroyed=!0,void this.close((async e=>{if(e)t(e);else{try{await n.deleteDB(this.name)}catch(e){return void t(e)}t(null)}})))}}},3029:(t,e,i)=>{"use strict";let r,n;i.r(e),i.d(e,{deleteDB:()=>m,openDB:()=>p,unwrap:()=>f,wrap:()=>d});const s=new WeakMap,o=new WeakMap,a=new WeakMap,h=new WeakMap,u=new WeakMap;let l={get(t,e,i){if(t instanceof IDBTransaction){if("done"===e)return o.get(t);if("objectStoreNames"===e)return t.objectStoreNames||a.get(t);if("store"===e)return i.objectStoreNames[1]?void 0:i.objectStore(i.objectStoreNames[0])}return d(t[e])},set:(t,e,i)=>(t[e]=i,!0),has:(t,e)=>t instanceof IDBTransaction&&("done"===e||"store"===e)||e in t};function c(t){return"function"==typeof t?(e=t)!==IDBDatabase.prototype.transaction||"objectStoreNames"in IDBTransaction.prototype?(n||(n=[IDBCursor.prototype.advance,IDBCursor.prototype.continue,IDBCursor.prototype.continuePrimaryKey])).includes(e)?function(...t){return e.apply(f(this),t),d(s.get(this))}:function(...t){return d(e.apply(f(this),t))}:function(t,...i){const r=e.call(f(this),t,...i);return a.set(r,t.sort?t.sort():[t]),d(r)}:(t instanceof IDBTransaction&&function(t){if(o.has(t))return;const e=new Promise(((e,i)=>{const r=()=>{t.removeEventListener("complete",n),t.removeEventListener("error",s),t.removeEventListener("abort",s)},n=()=>{e(),r()},s=()=>{i(t.error||new DOMException("AbortError","AbortError")),r()};t.addEventListener("complete",n),t.addEventListener("error",s),t.addEventListener("abort",s)}));o.set(t,e)}(t),i=t,(r||(r=[IDBDatabase,IDBObjectStore,IDBIndex,IDBCursor,IDBTransaction])).some((t=>i instanceof t))?new Proxy(t,l):t);var e,i}function d(t){if(t instanceof IDBRequest)return function(t){const e=new Promise(((e,i)=>{const r=()=>{t.removeEventListener("success",n),t.removeEventListener("error",s)},n=()=>{e(d(t.result)),r()},s=()=>{i(t.error),r()};t.addEventListener("success",n),t.addEventListener("error",s)}));return e.then((e=>{e instanceof IDBCursor&&s.set(e,t)})).catch((()=>{})),u.set(e,t),e}(t);if(h.has(t))return h.get(t);const e=c(t);return e!==t&&(h.set(t,e),u.set(e,t)),e}const f=t=>u.get(t);function p(t,e,{blocked:i,upgrade:r,blocking:n,terminated:s}={}){const o=indexedDB.open(t,e),a=d(o);return r&&o.addEventListener("upgradeneeded",(t=>{r(d(o.result),t.oldVersion,t.newVersion,d(o.transaction))})),i&&o.addEventListener("blocked",(()=>i())),a.then((t=>{s&&t.addEventListener("close",(()=>s())),n&&t.addEventListener("versionchange",(()=>n()))})).catch((()=>{})),a}function m(t,{blocked:e}={}){const i=indexedDB.deleteDatabase(t);return e&&i.addEventListener("blocked",(()=>e())),d(i).then((()=>{}))}const g=["get","getKey","getAll","getAllKeys","count"],b=["put","add","delete","clear"],v=new Map;function y(t,e){if(!(t instanceof IDBDatabase)||e in t||"string"!=typeof e)return;if(v.get(e))return v.get(e);const i=e.replace(/FromIndex$/,""),r=e!==i,n=b.includes(i);if(!(i in(r?IDBIndex:IDBObjectStore).prototype)||!n&&!g.includes(i))return;const s=async function(t,...e){const s=this.transaction(t,n?"readwrite":"readonly");let o=s.store;return r&&(o=o.index(e.shift())),(await Promise.all([o[i](...e),n&&s.done]))[0]};return v.set(e,s),s}var w;w=l,l={...w,get:(t,e,i)=>y(t,e)||w.get(t,e,i),has:(t,e)=>!!y(t,e)||w.has(t,e)}},645:(t,e)=>{e.read=function(t,e,i,r,n){var s,o,a=8*n-r-1,h=(1<>1,l=-7,c=i?n-1:0,d=i?-1:1,f=t[e+c];for(c+=d,s=f&(1<<-l)-1,f>>=-l,l+=a;l>0;s=256*s+t[e+c],c+=d,l-=8);for(o=s&(1<<-l)-1,s>>=-l,l+=r;l>0;o=256*o+t[e+c],c+=d,l-=8);if(0===s)s=1-u;else{if(s===h)return o?NaN:1/0*(f?-1:1);o+=Math.pow(2,r),s-=u}return(f?-1:1)*o*Math.pow(2,s-r)},e.write=function(t,e,i,r,n,s){var o,a,h,u=8*s-n-1,l=(1<>1,d=23===n?Math.pow(2,-24)-Math.pow(2,-77):0,f=r?0:s-1,p=r?1:-1,m=e<0||0===e&&1/e<0?1:0;for(e=Math.abs(e),isNaN(e)||e===1/0?(a=isNaN(e)?1:0,o=l):(o=Math.floor(Math.log(e)/Math.LN2),e*(h=Math.pow(2,-o))<1&&(o--,h*=2),(e+=o+c>=1?d/h:d*Math.pow(2,1-c))*h>=2&&(o++,h/=2),o+c>=l?(a=0,o=l):o+c>=1?(a=(e*h-1)*Math.pow(2,n),o+=c):(a=e*Math.pow(2,c-1)*Math.pow(2,n),o=0));n>=8;t[i+f]=255&a,f+=p,a/=256,n-=8);for(o=o<0;t[i+f]=255&o,f+=p,o/=256,u-=8);t[i+f-p]|=128*m}},3700:(t,e,i)=>{const r=i(4375);t.exports=class{constructor(t){if(this.store=t,this.chunkLength=t.chunkLength,!this.store||!this.store.get||!this.store.put)throw new Error("First argument must be abstract-chunk-store compliant");this.mem=[]}put(t,e,i=(()=>{})){this.mem[t]=e,this.store.put(t,e,(e=>{this.mem[t]=null,i(e)}))}get(t,e,i=(()=>{})){if("function"==typeof e)return this.get(t,null,e);let n=this.mem[t];if(!n)return this.store.get(t,e,i);e||(e={});const s=e.offset||0,o=e.length||n.length-s;0===s&&o===n.length||(n=n.slice(s,o+s)),r((()=>i(null,n)))}close(t=(()=>{})){this.store.close(t)}destroy(t=(()=>{})){this.store.destroy(t)}}},5717:t=>{"function"==typeof Object.create?t.exports=function(t,e){e&&(t.super_=e,t.prototype=Object.create(e.prototype,{constructor:{value:t,enumerable:!1,writable:!0,configurable:!0}}))}:t.exports=function(t,e){if(e){t.super_=e;var i=function(){};i.prototype=e.prototype,t.prototype=new i,t.prototype.constructor=t}}},2584:(t,e,i)=>{"use strict";var r=i(6410)(),n=i(1924)("Object.prototype.toString"),s=function(t){return!(r&&t&&"object"==typeof t&&Symbol.toStringTag in t)&&"[object Arguments]"===n(t)},o=function(t){return!!s(t)||null!==t&&"object"==typeof t&&"number"==typeof t.length&&t.length>=0&&"[object Array]"!==n(t)&&"[object Function]"===n(t.callee)},a=function(){return s(arguments)}();s.isLegacyArguments=o,t.exports=a?s:o},4264:t=>{t.exports=function(t){for(var e=0,i=t.length;e127)return!1;return!0}},8662:(t,e,i)=>{"use strict";var r,n=Object.prototype.toString,s=Function.prototype.toString,o=/^\s*(?:function)?\*/,a=i(6410)(),h=Object.getPrototypeOf;t.exports=function(t){if("function"!=typeof t)return!1;if(o.test(s.call(t)))return!0;if(!a)return"[object GeneratorFunction]"===n.call(t);if(!h)return!1;if(void 0===r){var e=function(){if(!a)return!1;try{return Function("return function*() {}")()}catch(t){}}();r=!!e&&h(e)}return h(t)===r}},8611:t=>{"use strict";t.exports=function(t){return t!=t}},360:(t,e,i)=>{"use strict";var r=i(5559),n=i(4289),s=i(8611),o=i(9415),a=i(3194),h=r(o(),Number);n(h,{getPolyfill:o,implementation:s,shim:a}),t.exports=h},9415:(t,e,i)=>{"use strict";var r=i(8611);t.exports=function(){return Number.isNaN&&Number.isNaN(NaN)&&!Number.isNaN("a")?Number.isNaN:r}},3194:(t,e,i)=>{"use strict";var r=i(4289),n=i(9415);t.exports=function(){var t=n();return r(Number,{isNaN:t},{isNaN:function(){return Number.isNaN!==t}}),t}},5692:(t,e,i)=>{"use strict";var r=i(9804),n=i(3083),s=i(1924),o=s("Object.prototype.toString"),a=i(6410)(),h="undefined"==typeof globalThis?i.g:globalThis,u=n(),l=s("Array.prototype.indexOf",!0)||function(t,e){for(var i=0;i-1}return!!f&&function(t){var e=!1;return r(d,(function(i,r){if(!e)try{e=i.call(t)===r}catch(t){}})),e}(t)}},4501:t=>{t.exports=r,r.strict=n,r.loose=s;var e=Object.prototype.toString,i={"[object Int8Array]":!0,"[object Int16Array]":!0,"[object Int32Array]":!0,"[object Uint8Array]":!0,"[object Uint8ClampedArray]":!0,"[object Uint16Array]":!0,"[object Uint32Array]":!0,"[object Float32Array]":!0,"[object Float64Array]":!0};function r(t){return n(t)||s(t)}function n(t){return t instanceof Int8Array||t instanceof Int16Array||t instanceof Int32Array||t instanceof Uint8Array||t instanceof Uint8ClampedArray||t instanceof Uint16Array||t instanceof Uint32Array||t instanceof Float32Array||t instanceof Float64Array}function s(t){return i[e.call(t)]}},1351:(t,e)=>{"use strict";e.re=()=>{throw new Error("`junk.re` was renamed to `junk.regex`")},e.regex=new RegExp(["^npm-debug\\.log$","^\\..*\\.swp$","^\\.DS_Store$","^\\.AppleDouble$","^\\.LSOverride$","^Icon\\r$","^\\._.*","^\\.Spotlight-V100(?:$|\\/)","\\.Trashes","^__MACOSX$","~$","^Thumbs\\.db$","^ehthumbs\\.db$","^Desktop\\.ini$","@eaDir$"].join("|")),e.is=t=>e.regex.test(t),e.not=t=>!e.is(t),e.default=t.exports},5516:(t,e,i)=>{e.RateLimiter=i(1114),e.TokenBucket=i(4976)},6188:(t,e,i)=>{var r=i(9590);t.exports=function(){if(void 0!==r&&r.hrtime){var t=r.hrtime(),e=t[0],i=t[1];return 1e3*e+Math.floor(i/1e6)}return(new Date).getTime()}},1114:(t,e,i)=>{var r=i(9590),n=i(4976),s=i(6188),o=function(t,e,i){this.tokenBucket=new n(t,t,e,null),this.tokenBucket.content=t,this.curIntervalStart=s(),this.tokensThisInterval=0,this.fireImmediately=i};o.prototype={tokenBucket:null,curIntervalStart:0,tokensThisInterval:0,fireImmediately:!1,removeTokens:function(t,e){if(t>this.tokenBucket.bucketSize)return r.nextTick(e.bind(null,"Requested tokens "+t+" exceeds maximum tokens per interval "+this.tokenBucket.bucketSize,null)),!1;var i=this,n=s();if((n=this.tokenBucket.interval)&&(this.curIntervalStart=n,this.tokensThisInterval=0),t>this.tokenBucket.tokensPerInterval-this.tokensThisInterval){if(this.fireImmediately)r.nextTick(e.bind(null,null,-1));else{var o=Math.ceil(this.curIntervalStart+this.tokenBucket.interval-n);setTimeout((function(){i.tokenBucket.removeTokens(t,a)}),o)}return!1}return this.tokenBucket.removeTokens(t,a);function a(r,n){if(r)return e(r,null);i.tokensThisInterval+=t,e(null,n)}},tryRemoveTokens:function(t){if(t>this.tokenBucket.bucketSize)return!1;var e=s();if((e=this.tokenBucket.interval)&&(this.curIntervalStart=e,this.tokensThisInterval=0),t>this.tokenBucket.tokensPerInterval-this.tokensThisInterval)return!1;var i=this.tokenBucket.tryRemoveTokens(t);return i&&(this.tokensThisInterval+=t),i},getTokensRemaining:function(){return this.tokenBucket.drip(),this.tokenBucket.content}},t.exports=o},4976:(t,e,i)=>{var r=i(9590),n=function(t,e,i,r){if(this.bucketSize=t,this.tokensPerInterval=e,"string"==typeof i)switch(i){case"sec":case"second":this.interval=1e3;break;case"min":case"minute":this.interval=6e4;break;case"hr":case"hour":this.interval=36e5;break;case"day":this.interval=864e5;break;default:throw new Error("Invaid interval "+i)}else this.interval=i;this.parentBucket=r,this.content=0,this.lastDrip=+new Date};n.prototype={bucketSize:1,tokensPerInterval:1,interval:1e3,parentBucket:null,content:0,lastDrip:0,removeTokens:function(t,e){var i=this;return this.bucketSize?t>this.bucketSize?(r.nextTick(e.bind(null,"Requested tokens "+t+" exceeds bucket size "+this.bucketSize,null)),!1):(this.drip(),t>this.content?n():this.parentBucket?this.parentBucket.removeTokens(t,(function(r,s){return r?e(r,null):t>i.content?n():(i.content-=t,void e(null,Math.min(s,i.content)))})):(this.content-=t,r.nextTick(e.bind(null,null,this.content)),!0)):(r.nextTick(e.bind(null,null,t,Number.POSITIVE_INFINITY)),!0);function n(){var r=Math.ceil((t-i.content)*(i.interval/i.tokensPerInterval));return setTimeout((function(){i.removeTokens(t,e)}),r),!1}},tryRemoveTokens:function(t){return!(this.bucketSize&&(t>this.bucketSize||(this.drip(),t>this.content||this.parentBucket&&!this.parentBucket.tryRemoveTokens(t)||(this.content-=t,0))))},drip:function(){if(this.tokensPerInterval){var t=+new Date,e=Math.max(t-this.lastDrip,0);this.lastDrip=t;var i=e*(this.tokensPerInterval/this.interval);this.content=Math.min(this.content+i,this.bucketSize)}else this.content=this.bucketSize}},t.exports=n},7117:(t,e,i)=>{var r=i(7187),n=i(5717);function s(t){if(!(this instanceof s))return new s(t);"number"==typeof t&&(t={max:t}),t||(t={}),r.EventEmitter.call(this),this.cache={},this.head=this.tail=null,this.length=0,this.max=t.max||1e3,this.maxAge=t.maxAge||0}t.exports=s,n(s,r.EventEmitter),Object.defineProperty(s.prototype,"keys",{get:function(){return Object.keys(this.cache)}}),s.prototype.clear=function(){this.cache={},this.head=this.tail=null,this.length=0},s.prototype.remove=function(t){if("string"!=typeof t&&(t=""+t),this.cache.hasOwnProperty(t)){var e=this.cache[t];return delete this.cache[t],this._unlink(t,e.prev,e.next),e.value}},s.prototype._unlink=function(t,e,i){this.length--,0===this.length?this.head=this.tail=null:this.head===t?(this.head=e,this.cache[this.head].next=null):this.tail===t?(this.tail=i,this.cache[this.tail].prev=null):(this.cache[e].next=i,this.cache[i].prev=e)},s.prototype.peek=function(t){if(this.cache.hasOwnProperty(t)){var e=this.cache[t];if(this._checkAge(t,e))return e.value}},s.prototype.set=function(t,e){var i;if("string"!=typeof t&&(t=""+t),this.cache.hasOwnProperty(t)){if((i=this.cache[t]).value=e,this.maxAge&&(i.modified=Date.now()),t===this.head)return e;this._unlink(t,i.prev,i.next)}else i={value:e,modified:0,next:null,prev:null},this.maxAge&&(i.modified=Date.now()),this.cache[t]=i,this.length===this.max&&this.evict();return this.length++,i.next=null,i.prev=this.head,this.head&&(this.cache[this.head].next=t),this.head=t,this.tail||(this.tail=t),e},s.prototype._checkAge=function(t,e){return!(this.maxAge&&Date.now()-e.modified>this.maxAge&&(this.remove(t),this.emit("evict",{key:t,value:e.value}),1))},s.prototype.get=function(t){if("string"!=typeof t&&(t=""+t),this.cache.hasOwnProperty(t)){var e=this.cache[t];if(this._checkAge(t,e))return this.head!==t&&(t===this.tail?(this.tail=e.next,this.cache[this.tail].prev=null):this.cache[e.prev].next=e.next,this.cache[e.next].prev=e.prev,this.cache[this.head].next=t,e.prev=this.head,e.next=null,this.head=t),e.value}},s.prototype.evict=function(){if(this.tail){var t=this.tail,e=this.remove(this.tail);this.emit("evict",{key:t,value:e})}}},9417:(t,e,i)=>{var r=i(8764).Buffer;const n=i(6581),{EventEmitter:s}=i(7187),o=i(1227)("lt_donthave");t.exports=()=>{class t extends s{constructor(t){super(),this._peerSupports=!1,this._wire=t}onExtendedHandshake(){this._peerSupports=!0}onMessage(t){let e;try{e=t.readUInt32BE()}catch(t){return}this._wire.peerPieces.get(e)&&(o("got donthave %d",e),this._wire.peerPieces.set(e,!1),this.emit("donthave",e),this._failRequests(e))}donthave(t){if(!this._peerSupports)return;o("donthave %d",t);const e=r.alloc(4);e.writeUInt32BE(t),this._wire.extended("lt_donthave",e)}_failRequests(t){const e=this._wire.requests;for(let i=0;i{var r=i(8764).Buffer;t.exports=o,t.exports.decode=o,t.exports.encode=function(t){t=Object.assign({},t);let e=new Set;t.xt&&"string"==typeof t.xt&&e.add(t.xt),t.xt&&Array.isArray(t.xt)&&(e=new Set(t.xt)),t.infoHashBuffer&&e.add(`urn:btih:${t.infoHashBuffer.toString("hex")}`),t.infoHash&&e.add(`urn:btih:${t.infoHash}`),t.infoHashV2Buffer&&e.add(t.xt=`urn:btmh:1220${t.infoHashV2Buffer.toString("hex")}`),t.infoHashV2&&e.add(`urn:btmh:1220${t.infoHashV2}`);const i=Array.from(e);1===i.length&&(t.xt=i[0]),i.length>1&&(t.xt=i),t.publicKeyBuffer&&(t.xs=`urn:btpk:${t.publicKeyBuffer.toString("hex")}`),t.publicKey&&(t.xs=`urn:btpk:${t.publicKey}`),t.name&&(t.dn=t.name),t.keywords&&(t.kt=t.keywords),t.announce&&(t.tr=t.announce),t.urlList&&(t.ws=t.urlList,delete t.as),t.peerAddresses&&(t["x.pe"]=t.peerAddresses);let r="magnet:?";return Object.keys(t).filter((t=>2===t.length||"x.pe"===t)).forEach(((e,i)=>{const n=Array.isArray(t[e])?t[e]:[t[e]];n.forEach(((t,n)=>{(i>0||n>0)&&("kt"!==e&&"so"!==e||0===n)&&(r+="&"),"dn"===e&&(t=encodeURIComponent(t).replace(/%20/g,"+")),"tr"!==e&&"as"!==e&&"ws"!==e||(t=encodeURIComponent(t)),"xs"!==e||t.startsWith("urn:btpk:")||(t=encodeURIComponent(t)),"kt"===e&&(t=encodeURIComponent(t)),"so"!==e&&(r+="kt"===e&&n>0?`+${t}`:`${e}=${t}`)})),"so"===e&&(r+=`${e}=${s.compose(n)}`)})),r};const n=i(5017),s=i(7500);function o(t){const e={},i=t.split("magnet:?")[1];let o;return(i&&i.length>=0?i.split("&"):[]).forEach((t=>{const i=t.split("=");if(2!==i.length)return;const r=i[0];let n=i[1];"dn"===r&&(n=decodeURIComponent(n).replace(/\+/g," ")),"tr"!==r&&"xs"!==r&&"as"!==r&&"ws"!==r||(n=decodeURIComponent(n)),"kt"===r&&(n=decodeURIComponent(n).split("+")),"ix"===r&&(n=Number(n)),"so"===r&&(n=s.parse(decodeURIComponent(n).split(","))),e[r]?(Array.isArray(e[r])||(e[r]=[e[r]]),e[r].push(n)):e[r]=n})),e.xt&&(Array.isArray(e.xt)?e.xt:[e.xt]).forEach((t=>{if(o=t.match(/^urn:btih:(.{40})/))e.infoHash=o[1].toLowerCase();else if(o=t.match(/^urn:btih:(.{32})/)){const t=n.decode(o[1]);e.infoHash=r.from(t,"binary").toString("hex")}else(o=t.match(/^urn:btmh:1220(.{64})/))&&(e.infoHashV2=o[1].toLowerCase())})),e.xs&&(Array.isArray(e.xs)?e.xs:[e.xs]).forEach((t=>{(o=t.match(/^urn:btpk:(.{64})/))&&(e.publicKey=o[1].toLowerCase())})),e.infoHash&&(e.infoHashBuffer=r.from(e.infoHash,"hex")),e.infoHashV2&&(e.infoHashV2Buffer=r.from(e.infoHashV2,"hex")),e.publicKey&&(e.publicKeyBuffer=r.from(e.publicKey,"hex")),e.dn&&(e.name=e.dn),e.kt&&(e.keywords=e.kt),e.announce=[],("string"==typeof e.tr||Array.isArray(e.tr))&&(e.announce=e.announce.concat(e.tr)),e.urlList=[],("string"==typeof e.as||Array.isArray(e.as))&&(e.urlList=e.urlList.concat(e.as)),("string"==typeof e.ws||Array.isArray(e.ws))&&(e.urlList=e.urlList.concat(e.ws)),e.peerAddresses=[],("string"==typeof e["x.pe"]||Array.isArray(e["x.pe"]))&&(e.peerAddresses=e.peerAddresses.concat(e["x.pe"])),e.announce=Array.from(new Set(e.announce)),e.urlList=Array.from(new Set(e.urlList)),e.peerAddresses=Array.from(new Set(e.peerAddresses)),e}},2318:(t,e,i)=>{"use strict";var r=i(5717),n=i(3349),s=i(9509).Buffer,o=new Array(16);function a(){n.call(this,64),this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878}function h(t,e){return t<>>32-e}function u(t,e,i,r,n,s,o){return h(t+(e&i|~e&r)+n+s|0,o)+e|0}function l(t,e,i,r,n,s,o){return h(t+(e&r|i&~r)+n+s|0,o)+e|0}function c(t,e,i,r,n,s,o){return h(t+(e^i^r)+n+s|0,o)+e|0}function d(t,e,i,r,n,s,o){return h(t+(i^(e|~r))+n+s|0,o)+e|0}r(a,n),a.prototype._update=function(){for(var t=o,e=0;e<16;++e)t[e]=this._block.readInt32LE(4*e);var i=this._a,r=this._b,n=this._c,s=this._d;i=u(i,r,n,s,t[0],3614090360,7),s=u(s,i,r,n,t[1],3905402710,12),n=u(n,s,i,r,t[2],606105819,17),r=u(r,n,s,i,t[3],3250441966,22),i=u(i,r,n,s,t[4],4118548399,7),s=u(s,i,r,n,t[5],1200080426,12),n=u(n,s,i,r,t[6],2821735955,17),r=u(r,n,s,i,t[7],4249261313,22),i=u(i,r,n,s,t[8],1770035416,7),s=u(s,i,r,n,t[9],2336552879,12),n=u(n,s,i,r,t[10],4294925233,17),r=u(r,n,s,i,t[11],2304563134,22),i=u(i,r,n,s,t[12],1804603682,7),s=u(s,i,r,n,t[13],4254626195,12),n=u(n,s,i,r,t[14],2792965006,17),i=l(i,r=u(r,n,s,i,t[15],1236535329,22),n,s,t[1],4129170786,5),s=l(s,i,r,n,t[6],3225465664,9),n=l(n,s,i,r,t[11],643717713,14),r=l(r,n,s,i,t[0],3921069994,20),i=l(i,r,n,s,t[5],3593408605,5),s=l(s,i,r,n,t[10],38016083,9),n=l(n,s,i,r,t[15],3634488961,14),r=l(r,n,s,i,t[4],3889429448,20),i=l(i,r,n,s,t[9],568446438,5),s=l(s,i,r,n,t[14],3275163606,9),n=l(n,s,i,r,t[3],4107603335,14),r=l(r,n,s,i,t[8],1163531501,20),i=l(i,r,n,s,t[13],2850285829,5),s=l(s,i,r,n,t[2],4243563512,9),n=l(n,s,i,r,t[7],1735328473,14),i=c(i,r=l(r,n,s,i,t[12],2368359562,20),n,s,t[5],4294588738,4),s=c(s,i,r,n,t[8],2272392833,11),n=c(n,s,i,r,t[11],1839030562,16),r=c(r,n,s,i,t[14],4259657740,23),i=c(i,r,n,s,t[1],2763975236,4),s=c(s,i,r,n,t[4],1272893353,11),n=c(n,s,i,r,t[7],4139469664,16),r=c(r,n,s,i,t[10],3200236656,23),i=c(i,r,n,s,t[13],681279174,4),s=c(s,i,r,n,t[0],3936430074,11),n=c(n,s,i,r,t[3],3572445317,16),r=c(r,n,s,i,t[6],76029189,23),i=c(i,r,n,s,t[9],3654602809,4),s=c(s,i,r,n,t[12],3873151461,11),n=c(n,s,i,r,t[15],530742520,16),i=d(i,r=c(r,n,s,i,t[2],3299628645,23),n,s,t[0],4096336452,6),s=d(s,i,r,n,t[7],1126891415,10),n=d(n,s,i,r,t[14],2878612391,15),r=d(r,n,s,i,t[5],4237533241,21),i=d(i,r,n,s,t[12],1700485571,6),s=d(s,i,r,n,t[3],2399980690,10),n=d(n,s,i,r,t[10],4293915773,15),r=d(r,n,s,i,t[1],2240044497,21),i=d(i,r,n,s,t[8],1873313359,6),s=d(s,i,r,n,t[15],4264355552,10),n=d(n,s,i,r,t[6],2734768916,15),r=d(r,n,s,i,t[13],1309151649,21),i=d(i,r,n,s,t[4],4149444226,6),s=d(s,i,r,n,t[11],3174756917,10),n=d(n,s,i,r,t[2],718787259,15),r=d(r,n,s,i,t[9],3951481745,21),this._a=this._a+i|0,this._b=this._b+r|0,this._c=this._c+n|0,this._d=this._d+s|0},a.prototype._digest=function(){this._block[this._blockOffset++]=128,this._blockOffset>56&&(this._block.fill(0,this._blockOffset,64),this._update(),this._blockOffset=0),this._block.fill(0,this._blockOffset,56),this._block.writeUInt32LE(this._length[0],56),this._block.writeUInt32LE(this._length[1],60),this._update();var t=s.allocUnsafe(16);return t.writeInt32LE(this._a,0),t.writeInt32LE(this._b,4),t.writeInt32LE(this._c,8),t.writeInt32LE(this._d,12),t},t.exports=a},6567:(t,e,i)=>{t.exports=a;var r=i(5717),n=i(8473),s=i(2885),o="undefined"!=typeof window&&window.MediaSource;function a(t,e){var i=this;if(!(i instanceof a))return new a(t,e);if(!o)throw new Error("web browser lacks MediaSource support");e||(e={}),i._debug=e.debug,i._bufferDuration=e.bufferDuration||60,i._elem=t,i._mediaSource=new o,i._streams=[],i.detailedError=null,i._errorHandler=function(){i._elem.removeEventListener("error",i._errorHandler),i._streams.slice().forEach((function(t){t.destroy(i._elem.error)}))},i._elem.addEventListener("error",i._errorHandler),i._elem.src=window.URL.createObjectURL(i._mediaSource)}function h(t,e){var i=this;if(n.Writable.call(i),i._wrapper=t,i._elem=t._elem,i._mediaSource=t._mediaSource,i._allStreams=t._streams,i._allStreams.push(i),i._bufferDuration=t._bufferDuration,i._sourceBuffer=null,i._debugBuffers=[],i._openHandler=function(){i._onSourceOpen()},i._flowHandler=function(){i._flow()},i._errorHandler=function(t){i.destroyed||i.emit("error",t)},"string"==typeof e)i._type=e,"open"===i._mediaSource.readyState?i._createSourceBuffer():i._mediaSource.addEventListener("sourceopen",i._openHandler);else if(null===e._sourceBuffer)e.destroy(),i._type=e._type,i._mediaSource.addEventListener("sourceopen",i._openHandler);else{if(!e._sourceBuffer)throw new Error("The argument to MediaElementWrapper.createWriteStream must be a string or a previous stream returned from that function");e.destroy(),i._type=e._type,i._sourceBuffer=e._sourceBuffer,i._debugBuffers=e._debugBuffers,i._sourceBuffer.addEventListener("updateend",i._flowHandler),i._sourceBuffer.addEventListener("error",i._errorHandler)}i._elem.addEventListener("timeupdate",i._flowHandler),i.on("error",(function(t){i._wrapper.error(t)})),i.on("finish",(function(){if(!i.destroyed&&(i._finished=!0,i._allStreams.every((function(t){return t._finished})))){i._wrapper._dumpDebugData();try{i._mediaSource.endOfStream()}catch(t){}}}))}a.prototype.createWriteStream=function(t){return new h(this,t)},a.prototype.error=function(t){var e=this;e.detailedError||(e.detailedError=t),e._dumpDebugData();try{e._mediaSource.endOfStream("decode")}catch(t){}try{window.URL.revokeObjectURL(e._elem.src)}catch(t){}},a.prototype._dumpDebugData=function(){var t=this;t._debug&&(t._debug=!1,t._streams.forEach((function(t,e){var i,r,n;i=t._debugBuffers,r="mediasource-stream-"+e,(n=document.createElement("a")).href=window.URL.createObjectURL(new window.Blob(i)),n.download=r,n.click()})))},r(h,n.Writable),h.prototype._onSourceOpen=function(){var t=this;t.destroyed||(t._mediaSource.removeEventListener("sourceopen",t._openHandler),t._createSourceBuffer())},h.prototype.destroy=function(t){var e=this;e.destroyed||(e.destroyed=!0,e._allStreams.splice(e._allStreams.indexOf(e),1),e._mediaSource.removeEventListener("sourceopen",e._openHandler),e._elem.removeEventListener("timeupdate",e._flowHandler),e._sourceBuffer&&(e._sourceBuffer.removeEventListener("updateend",e._flowHandler),e._sourceBuffer.removeEventListener("error",e._errorHandler),"open"===e._mediaSource.readyState&&e._sourceBuffer.abort()),t&&e.emit("error",t),e.emit("close"))},h.prototype._createSourceBuffer=function(){var t=this;if(!t.destroyed)if(o.isTypeSupported(t._type)){if(t._sourceBuffer=t._mediaSource.addSourceBuffer(t._type),t._sourceBuffer.addEventListener("updateend",t._flowHandler),t._sourceBuffer.addEventListener("error",t._errorHandler),t._cb){var e=t._cb;t._cb=null,e()}}else t.destroy(new Error("The provided type is not supported"))},h.prototype._write=function(t,e,i){var r=this;if(!r.destroyed)if(r._sourceBuffer){if(r._sourceBuffer.updating)return i(new Error("Cannot append buffer while source buffer updating"));var n=s(t);r._wrapper._debug&&r._debugBuffers.push(n);try{r._sourceBuffer.appendBuffer(n)}catch(t){return void r.destroy(t)}r._cb=i}else r._cb=function(n){if(n)return i(n);r._write(t,e,i)}},h.prototype._flow=function(){var t=this;if(!t.destroyed&&t._sourceBuffer&&!t._sourceBuffer.updating&&!("open"===t._mediaSource.readyState&&t._getBufferDuration()>t._bufferDuration)&&t._cb){var e=t._cb;t._cb=null,e()}},h.prototype._getBufferDuration=function(){for(var t=this._sourceBuffer.buffered,e=this._elem.currentTime,i=-1,r=0;re)break;(i>=0||e<=s)&&(i=s)}var o=i-e;return o<0&&(o=0),o}},1191:(t,e,i)=>{t.exports=n;const r=i(4375);function n(t,e){if(!(this instanceof n))return new n(t,e);if(e||(e={}),this.chunkLength=Number(t),!this.chunkLength)throw new Error("First argument must be a chunk length");this.chunks=[],this.closed=!1,this.length=Number(e.length)||1/0,this.length!==1/0&&(this.lastChunkLength=this.length%this.chunkLength||this.chunkLength,this.lastChunkIndex=Math.ceil(this.length/this.chunkLength)-1)}n.prototype.put=function(t,e,i=(()=>{})){if(this.closed)return r((()=>i(new Error("Storage is closed"))));const n=t===this.lastChunkIndex;return n&&e.length!==this.lastChunkLength?r((()=>i(new Error("Last chunk length must be "+this.lastChunkLength)))):n||e.length===this.chunkLength?(this.chunks[t]=e,void r((()=>i(null)))):r((()=>i(new Error("Chunk length must be "+this.chunkLength))))},n.prototype.get=function(t,e,i=(()=>{})){if("function"==typeof e)return this.get(t,null,e);if(this.closed)return r((()=>i(new Error("Storage is closed"))));let n=this.chunks[t];if(!n){const t=new Error("Chunk not found");return t.notFound=!0,r((()=>i(t)))}e||(e={});const s=e.offset||0,o=e.length||n.length-s;0===s&&o===n.length||(n=n.slice(s,o+s)),r((()=>i(null,n)))},n.prototype.close=n.prototype.destroy=function(t=(()=>{})){if(this.closed)return r((()=>t(new Error("Storage is closed"))));this.closed=!0,this.chunks=null,r((()=>t(null)))}},3047:(t,e,i)=>{var r=i(6240),n=i(9931);function s(t){this.rand=t||new n.Rand}t.exports=s,s.create=function(t){return new s(t)},s.prototype._randbelow=function(t){var e=t.bitLength(),i=Math.ceil(e/8);do{var n=new r(this.rand.generate(i))}while(n.cmp(t)>=0);return n},s.prototype._randrange=function(t,e){var i=e.sub(t);return t.add(this._randbelow(i))},s.prototype.test=function(t,e,i){var n=t.bitLength(),s=r.mont(t),o=new r(1).toRed(s);e||(e=Math.max(1,n/48|0));for(var a=t.subn(1),h=0;!a.testn(h);h++);for(var u=t.shrn(h),l=a.toRed(s);e>0;e--){var c=this._randrange(new r(2),a);i&&i(c);var d=c.toRed(s).redPow(u);if(0!==d.cmp(o)&&0!==d.cmp(l)){for(var f=1;f0;e--){var l=this._randrange(new r(2),o),c=t.gcd(l);if(0!==c.cmpn(1))return c;var d=l.toRed(n).redPow(h);if(0!==d.cmp(s)&&0!==d.cmp(u)){for(var f=1;f=65&&i<=70?i-55:i>=97&&i<=102?i-87:i-48&15}function h(t,e,i){var r=a(t,i);return i-1>=e&&(r|=a(t,i-1)<<4),r}function u(t,e,i,r){for(var n=0,s=Math.min(t.length,i),o=e;o=49?a-49+10:a>=17?a-17+10:a}return n}s.isBN=function(t){return t instanceof s||null!==t&&"object"==typeof t&&t.constructor.wordSize===s.wordSize&&Array.isArray(t.words)},s.max=function(t,e){return t.cmp(e)>0?t:e},s.min=function(t,e){return t.cmp(e)<0?t:e},s.prototype._init=function(t,e,i){if("number"==typeof t)return this._initNumber(t,e,i);if("object"==typeof t)return this._initArray(t,e,i);"hex"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var n=0;"-"===(t=t.toString().replace(/\s+/g,""))[0]&&(n++,this.negative=1),n=0;n-=3)o=t[n]|t[n-1]<<8|t[n-2]<<16,this.words[s]|=o<>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);else if("le"===i)for(n=0,s=0;n>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);return this.strip()},s.prototype._parseHex=function(t,e,i){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var r=0;r=e;r-=2)n=h(t,e,r)<=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;else for(r=(t.length-e)%2==0?e+1:e;r=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;this.strip()},s.prototype._parseBase=function(t,e,i){this.words=[0],this.length=1;for(var r=0,n=1;n<=67108863;n*=e)r++;r--,n=n/e|0;for(var s=t.length-i,o=s%r,a=Math.min(s,s-o)+i,h=0,l=i;l1&&0===this.words[this.length-1];)this.length--;return this._normSign()},s.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},s.prototype.inspect=function(){return(this.red?""};var l=["","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"],c=[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],d=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function f(t,e,i){i.negative=e.negative^t.negative;var r=t.length+e.length|0;i.length=r,r=r-1|0;var n=0|t.words[0],s=0|e.words[0],o=n*s,a=67108863&o,h=o/67108864|0;i.words[0]=a;for(var u=1;u>>26,c=67108863&h,d=Math.min(u,e.length-1),f=Math.max(0,u-t.length+1);f<=d;f++){var p=u-f|0;l+=(o=(n=0|t.words[p])*(s=0|e.words[f])+c)/67108864|0,c=67108863&o}i.words[u]=0|c,h=0|l}return 0!==h?i.words[u]=0|h:i.length--,i.strip()}s.prototype.toString=function(t,e){var i;if(e=0|e||1,16===(t=t||10)||"hex"===t){i="";for(var n=0,s=0,o=0;o>>24-n&16777215)||o!==this.length-1?l[6-h.length]+h+i:h+i,(n+=2)>=26&&(n-=26,o--)}for(0!==s&&(i=s.toString(16)+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}if(t===(0|t)&&t>=2&&t<=36){var u=c[t],f=d[t];i="";var p=this.clone();for(p.negative=0;!p.isZero();){var m=p.modn(f).toString(t);i=(p=p.idivn(f)).isZero()?m+i:l[u-m.length]+m+i}for(this.isZero()&&(i="0"+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}r(!1,"Base should be between 2 and 36")},s.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-t:t},s.prototype.toJSON=function(){return this.toString(16)},s.prototype.toBuffer=function(t,e){return r(void 0!==o),this.toArrayLike(o,t,e)},s.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},s.prototype.toArrayLike=function(t,e,i){var n=this.byteLength(),s=i||Math.max(1,n);r(n<=s,"byte array longer than desired length"),r(s>0,"Requested array length <= 0"),this.strip();var o,a,h="le"===e,u=new t(s),l=this.clone();if(h){for(a=0;!l.isZero();a++)o=l.andln(255),l.iushrn(8),u[a]=o;for(;a=4096&&(i+=13,e>>>=13),e>=64&&(i+=7,e>>>=7),e>=8&&(i+=4,e>>>=4),e>=2&&(i+=2,e>>>=2),i+e},s.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,i=0;return 0==(8191&e)&&(i+=13,e>>>=13),0==(127&e)&&(i+=7,e>>>=7),0==(15&e)&&(i+=4,e>>>=4),0==(3&e)&&(i+=2,e>>>=2),0==(1&e)&&i++,i},s.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},s.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;et.length?this.clone().ior(t):t.clone().ior(this)},s.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},s.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var i=0;it.length?this.clone().iand(t):t.clone().iand(this)},s.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},s.prototype.iuxor=function(t){var e,i;this.length>t.length?(e=this,i=t):(e=t,i=this);for(var r=0;rt.length?this.clone().ixor(t):t.clone().ixor(this)},s.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},s.prototype.inotn=function(t){r("number"==typeof t&&t>=0);var e=0|Math.ceil(t/26),i=t%26;this._expand(e),i>0&&e--;for(var n=0;n0&&(this.words[n]=~this.words[n]&67108863>>26-i),this.strip()},s.prototype.notn=function(t){return this.clone().inotn(t)},s.prototype.setn=function(t,e){r("number"==typeof t&&t>=0);var i=t/26|0,n=t%26;return this._expand(i+1),this.words[i]=e?this.words[i]|1<t.length?(i=this,r=t):(i=t,r=this);for(var n=0,s=0;s>>26;for(;0!==n&&s>>26;if(this.length=i.length,0!==n)this.words[this.length]=n,this.length++;else if(i!==this)for(;st.length?this.clone().iadd(t):t.clone().iadd(this)},s.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var i,r,n=this.cmp(t);if(0===n)return this.negative=0,this.length=1,this.words[0]=0,this;n>0?(i=this,r=t):(i=t,r=this);for(var s=0,o=0;o>26,this.words[o]=67108863&e;for(;0!==s&&o>26,this.words[o]=67108863&e;if(0===s&&o>>13,f=0|o[1],p=8191&f,m=f>>>13,g=0|o[2],b=8191&g,v=g>>>13,y=0|o[3],w=8191&y,_=y>>>13,M=0|o[4],k=8191&M,x=M>>>13,E=0|o[5],S=8191&E,T=E>>>13,A=0|o[6],I=8191&A,C=A>>>13,B=0|o[7],R=8191&B,P=B>>>13,L=0|o[8],O=8191&L,D=L>>>13,N=0|o[9],j=8191&N,U=N>>>13,F=0|a[0],q=8191&F,z=F>>>13,H=0|a[1],W=8191&H,$=H>>>13,Z=0|a[2],V=8191&Z,K=Z>>>13,G=0|a[3],J=8191&G,Y=G>>>13,X=0|a[4],Q=8191&X,tt=X>>>13,et=0|a[5],it=8191&et,rt=et>>>13,nt=0|a[6],st=8191&nt,ot=nt>>>13,at=0|a[7],ht=8191&at,ut=at>>>13,lt=0|a[8],ct=8191<,dt=lt>>>13,ft=0|a[9],pt=8191&ft,mt=ft>>>13;i.negative=t.negative^e.negative,i.length=19;var gt=(u+(r=Math.imul(c,q))|0)+((8191&(n=(n=Math.imul(c,z))+Math.imul(d,q)|0))<<13)|0;u=((s=Math.imul(d,z))+(n>>>13)|0)+(gt>>>26)|0,gt&=67108863,r=Math.imul(p,q),n=(n=Math.imul(p,z))+Math.imul(m,q)|0,s=Math.imul(m,z);var bt=(u+(r=r+Math.imul(c,W)|0)|0)+((8191&(n=(n=n+Math.imul(c,$)|0)+Math.imul(d,W)|0))<<13)|0;u=((s=s+Math.imul(d,$)|0)+(n>>>13)|0)+(bt>>>26)|0,bt&=67108863,r=Math.imul(b,q),n=(n=Math.imul(b,z))+Math.imul(v,q)|0,s=Math.imul(v,z),r=r+Math.imul(p,W)|0,n=(n=n+Math.imul(p,$)|0)+Math.imul(m,W)|0,s=s+Math.imul(m,$)|0;var vt=(u+(r=r+Math.imul(c,V)|0)|0)+((8191&(n=(n=n+Math.imul(c,K)|0)+Math.imul(d,V)|0))<<13)|0;u=((s=s+Math.imul(d,K)|0)+(n>>>13)|0)+(vt>>>26)|0,vt&=67108863,r=Math.imul(w,q),n=(n=Math.imul(w,z))+Math.imul(_,q)|0,s=Math.imul(_,z),r=r+Math.imul(b,W)|0,n=(n=n+Math.imul(b,$)|0)+Math.imul(v,W)|0,s=s+Math.imul(v,$)|0,r=r+Math.imul(p,V)|0,n=(n=n+Math.imul(p,K)|0)+Math.imul(m,V)|0,s=s+Math.imul(m,K)|0;var yt=(u+(r=r+Math.imul(c,J)|0)|0)+((8191&(n=(n=n+Math.imul(c,Y)|0)+Math.imul(d,J)|0))<<13)|0;u=((s=s+Math.imul(d,Y)|0)+(n>>>13)|0)+(yt>>>26)|0,yt&=67108863,r=Math.imul(k,q),n=(n=Math.imul(k,z))+Math.imul(x,q)|0,s=Math.imul(x,z),r=r+Math.imul(w,W)|0,n=(n=n+Math.imul(w,$)|0)+Math.imul(_,W)|0,s=s+Math.imul(_,$)|0,r=r+Math.imul(b,V)|0,n=(n=n+Math.imul(b,K)|0)+Math.imul(v,V)|0,s=s+Math.imul(v,K)|0,r=r+Math.imul(p,J)|0,n=(n=n+Math.imul(p,Y)|0)+Math.imul(m,J)|0,s=s+Math.imul(m,Y)|0;var wt=(u+(r=r+Math.imul(c,Q)|0)|0)+((8191&(n=(n=n+Math.imul(c,tt)|0)+Math.imul(d,Q)|0))<<13)|0;u=((s=s+Math.imul(d,tt)|0)+(n>>>13)|0)+(wt>>>26)|0,wt&=67108863,r=Math.imul(S,q),n=(n=Math.imul(S,z))+Math.imul(T,q)|0,s=Math.imul(T,z),r=r+Math.imul(k,W)|0,n=(n=n+Math.imul(k,$)|0)+Math.imul(x,W)|0,s=s+Math.imul(x,$)|0,r=r+Math.imul(w,V)|0,n=(n=n+Math.imul(w,K)|0)+Math.imul(_,V)|0,s=s+Math.imul(_,K)|0,r=r+Math.imul(b,J)|0,n=(n=n+Math.imul(b,Y)|0)+Math.imul(v,J)|0,s=s+Math.imul(v,Y)|0,r=r+Math.imul(p,Q)|0,n=(n=n+Math.imul(p,tt)|0)+Math.imul(m,Q)|0,s=s+Math.imul(m,tt)|0;var _t=(u+(r=r+Math.imul(c,it)|0)|0)+((8191&(n=(n=n+Math.imul(c,rt)|0)+Math.imul(d,it)|0))<<13)|0;u=((s=s+Math.imul(d,rt)|0)+(n>>>13)|0)+(_t>>>26)|0,_t&=67108863,r=Math.imul(I,q),n=(n=Math.imul(I,z))+Math.imul(C,q)|0,s=Math.imul(C,z),r=r+Math.imul(S,W)|0,n=(n=n+Math.imul(S,$)|0)+Math.imul(T,W)|0,s=s+Math.imul(T,$)|0,r=r+Math.imul(k,V)|0,n=(n=n+Math.imul(k,K)|0)+Math.imul(x,V)|0,s=s+Math.imul(x,K)|0,r=r+Math.imul(w,J)|0,n=(n=n+Math.imul(w,Y)|0)+Math.imul(_,J)|0,s=s+Math.imul(_,Y)|0,r=r+Math.imul(b,Q)|0,n=(n=n+Math.imul(b,tt)|0)+Math.imul(v,Q)|0,s=s+Math.imul(v,tt)|0,r=r+Math.imul(p,it)|0,n=(n=n+Math.imul(p,rt)|0)+Math.imul(m,it)|0,s=s+Math.imul(m,rt)|0;var Mt=(u+(r=r+Math.imul(c,st)|0)|0)+((8191&(n=(n=n+Math.imul(c,ot)|0)+Math.imul(d,st)|0))<<13)|0;u=((s=s+Math.imul(d,ot)|0)+(n>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,r=Math.imul(R,q),n=(n=Math.imul(R,z))+Math.imul(P,q)|0,s=Math.imul(P,z),r=r+Math.imul(I,W)|0,n=(n=n+Math.imul(I,$)|0)+Math.imul(C,W)|0,s=s+Math.imul(C,$)|0,r=r+Math.imul(S,V)|0,n=(n=n+Math.imul(S,K)|0)+Math.imul(T,V)|0,s=s+Math.imul(T,K)|0,r=r+Math.imul(k,J)|0,n=(n=n+Math.imul(k,Y)|0)+Math.imul(x,J)|0,s=s+Math.imul(x,Y)|0,r=r+Math.imul(w,Q)|0,n=(n=n+Math.imul(w,tt)|0)+Math.imul(_,Q)|0,s=s+Math.imul(_,tt)|0,r=r+Math.imul(b,it)|0,n=(n=n+Math.imul(b,rt)|0)+Math.imul(v,it)|0,s=s+Math.imul(v,rt)|0,r=r+Math.imul(p,st)|0,n=(n=n+Math.imul(p,ot)|0)+Math.imul(m,st)|0,s=s+Math.imul(m,ot)|0;var kt=(u+(r=r+Math.imul(c,ht)|0)|0)+((8191&(n=(n=n+Math.imul(c,ut)|0)+Math.imul(d,ht)|0))<<13)|0;u=((s=s+Math.imul(d,ut)|0)+(n>>>13)|0)+(kt>>>26)|0,kt&=67108863,r=Math.imul(O,q),n=(n=Math.imul(O,z))+Math.imul(D,q)|0,s=Math.imul(D,z),r=r+Math.imul(R,W)|0,n=(n=n+Math.imul(R,$)|0)+Math.imul(P,W)|0,s=s+Math.imul(P,$)|0,r=r+Math.imul(I,V)|0,n=(n=n+Math.imul(I,K)|0)+Math.imul(C,V)|0,s=s+Math.imul(C,K)|0,r=r+Math.imul(S,J)|0,n=(n=n+Math.imul(S,Y)|0)+Math.imul(T,J)|0,s=s+Math.imul(T,Y)|0,r=r+Math.imul(k,Q)|0,n=(n=n+Math.imul(k,tt)|0)+Math.imul(x,Q)|0,s=s+Math.imul(x,tt)|0,r=r+Math.imul(w,it)|0,n=(n=n+Math.imul(w,rt)|0)+Math.imul(_,it)|0,s=s+Math.imul(_,rt)|0,r=r+Math.imul(b,st)|0,n=(n=n+Math.imul(b,ot)|0)+Math.imul(v,st)|0,s=s+Math.imul(v,ot)|0,r=r+Math.imul(p,ht)|0,n=(n=n+Math.imul(p,ut)|0)+Math.imul(m,ht)|0,s=s+Math.imul(m,ut)|0;var xt=(u+(r=r+Math.imul(c,ct)|0)|0)+((8191&(n=(n=n+Math.imul(c,dt)|0)+Math.imul(d,ct)|0))<<13)|0;u=((s=s+Math.imul(d,dt)|0)+(n>>>13)|0)+(xt>>>26)|0,xt&=67108863,r=Math.imul(j,q),n=(n=Math.imul(j,z))+Math.imul(U,q)|0,s=Math.imul(U,z),r=r+Math.imul(O,W)|0,n=(n=n+Math.imul(O,$)|0)+Math.imul(D,W)|0,s=s+Math.imul(D,$)|0,r=r+Math.imul(R,V)|0,n=(n=n+Math.imul(R,K)|0)+Math.imul(P,V)|0,s=s+Math.imul(P,K)|0,r=r+Math.imul(I,J)|0,n=(n=n+Math.imul(I,Y)|0)+Math.imul(C,J)|0,s=s+Math.imul(C,Y)|0,r=r+Math.imul(S,Q)|0,n=(n=n+Math.imul(S,tt)|0)+Math.imul(T,Q)|0,s=s+Math.imul(T,tt)|0,r=r+Math.imul(k,it)|0,n=(n=n+Math.imul(k,rt)|0)+Math.imul(x,it)|0,s=s+Math.imul(x,rt)|0,r=r+Math.imul(w,st)|0,n=(n=n+Math.imul(w,ot)|0)+Math.imul(_,st)|0,s=s+Math.imul(_,ot)|0,r=r+Math.imul(b,ht)|0,n=(n=n+Math.imul(b,ut)|0)+Math.imul(v,ht)|0,s=s+Math.imul(v,ut)|0,r=r+Math.imul(p,ct)|0,n=(n=n+Math.imul(p,dt)|0)+Math.imul(m,ct)|0,s=s+Math.imul(m,dt)|0;var Et=(u+(r=r+Math.imul(c,pt)|0)|0)+((8191&(n=(n=n+Math.imul(c,mt)|0)+Math.imul(d,pt)|0))<<13)|0;u=((s=s+Math.imul(d,mt)|0)+(n>>>13)|0)+(Et>>>26)|0,Et&=67108863,r=Math.imul(j,W),n=(n=Math.imul(j,$))+Math.imul(U,W)|0,s=Math.imul(U,$),r=r+Math.imul(O,V)|0,n=(n=n+Math.imul(O,K)|0)+Math.imul(D,V)|0,s=s+Math.imul(D,K)|0,r=r+Math.imul(R,J)|0,n=(n=n+Math.imul(R,Y)|0)+Math.imul(P,J)|0,s=s+Math.imul(P,Y)|0,r=r+Math.imul(I,Q)|0,n=(n=n+Math.imul(I,tt)|0)+Math.imul(C,Q)|0,s=s+Math.imul(C,tt)|0,r=r+Math.imul(S,it)|0,n=(n=n+Math.imul(S,rt)|0)+Math.imul(T,it)|0,s=s+Math.imul(T,rt)|0,r=r+Math.imul(k,st)|0,n=(n=n+Math.imul(k,ot)|0)+Math.imul(x,st)|0,s=s+Math.imul(x,ot)|0,r=r+Math.imul(w,ht)|0,n=(n=n+Math.imul(w,ut)|0)+Math.imul(_,ht)|0,s=s+Math.imul(_,ut)|0,r=r+Math.imul(b,ct)|0,n=(n=n+Math.imul(b,dt)|0)+Math.imul(v,ct)|0,s=s+Math.imul(v,dt)|0;var St=(u+(r=r+Math.imul(p,pt)|0)|0)+((8191&(n=(n=n+Math.imul(p,mt)|0)+Math.imul(m,pt)|0))<<13)|0;u=((s=s+Math.imul(m,mt)|0)+(n>>>13)|0)+(St>>>26)|0,St&=67108863,r=Math.imul(j,V),n=(n=Math.imul(j,K))+Math.imul(U,V)|0,s=Math.imul(U,K),r=r+Math.imul(O,J)|0,n=(n=n+Math.imul(O,Y)|0)+Math.imul(D,J)|0,s=s+Math.imul(D,Y)|0,r=r+Math.imul(R,Q)|0,n=(n=n+Math.imul(R,tt)|0)+Math.imul(P,Q)|0,s=s+Math.imul(P,tt)|0,r=r+Math.imul(I,it)|0,n=(n=n+Math.imul(I,rt)|0)+Math.imul(C,it)|0,s=s+Math.imul(C,rt)|0,r=r+Math.imul(S,st)|0,n=(n=n+Math.imul(S,ot)|0)+Math.imul(T,st)|0,s=s+Math.imul(T,ot)|0,r=r+Math.imul(k,ht)|0,n=(n=n+Math.imul(k,ut)|0)+Math.imul(x,ht)|0,s=s+Math.imul(x,ut)|0,r=r+Math.imul(w,ct)|0,n=(n=n+Math.imul(w,dt)|0)+Math.imul(_,ct)|0,s=s+Math.imul(_,dt)|0;var Tt=(u+(r=r+Math.imul(b,pt)|0)|0)+((8191&(n=(n=n+Math.imul(b,mt)|0)+Math.imul(v,pt)|0))<<13)|0;u=((s=s+Math.imul(v,mt)|0)+(n>>>13)|0)+(Tt>>>26)|0,Tt&=67108863,r=Math.imul(j,J),n=(n=Math.imul(j,Y))+Math.imul(U,J)|0,s=Math.imul(U,Y),r=r+Math.imul(O,Q)|0,n=(n=n+Math.imul(O,tt)|0)+Math.imul(D,Q)|0,s=s+Math.imul(D,tt)|0,r=r+Math.imul(R,it)|0,n=(n=n+Math.imul(R,rt)|0)+Math.imul(P,it)|0,s=s+Math.imul(P,rt)|0,r=r+Math.imul(I,st)|0,n=(n=n+Math.imul(I,ot)|0)+Math.imul(C,st)|0,s=s+Math.imul(C,ot)|0,r=r+Math.imul(S,ht)|0,n=(n=n+Math.imul(S,ut)|0)+Math.imul(T,ht)|0,s=s+Math.imul(T,ut)|0,r=r+Math.imul(k,ct)|0,n=(n=n+Math.imul(k,dt)|0)+Math.imul(x,ct)|0,s=s+Math.imul(x,dt)|0;var At=(u+(r=r+Math.imul(w,pt)|0)|0)+((8191&(n=(n=n+Math.imul(w,mt)|0)+Math.imul(_,pt)|0))<<13)|0;u=((s=s+Math.imul(_,mt)|0)+(n>>>13)|0)+(At>>>26)|0,At&=67108863,r=Math.imul(j,Q),n=(n=Math.imul(j,tt))+Math.imul(U,Q)|0,s=Math.imul(U,tt),r=r+Math.imul(O,it)|0,n=(n=n+Math.imul(O,rt)|0)+Math.imul(D,it)|0,s=s+Math.imul(D,rt)|0,r=r+Math.imul(R,st)|0,n=(n=n+Math.imul(R,ot)|0)+Math.imul(P,st)|0,s=s+Math.imul(P,ot)|0,r=r+Math.imul(I,ht)|0,n=(n=n+Math.imul(I,ut)|0)+Math.imul(C,ht)|0,s=s+Math.imul(C,ut)|0,r=r+Math.imul(S,ct)|0,n=(n=n+Math.imul(S,dt)|0)+Math.imul(T,ct)|0,s=s+Math.imul(T,dt)|0;var It=(u+(r=r+Math.imul(k,pt)|0)|0)+((8191&(n=(n=n+Math.imul(k,mt)|0)+Math.imul(x,pt)|0))<<13)|0;u=((s=s+Math.imul(x,mt)|0)+(n>>>13)|0)+(It>>>26)|0,It&=67108863,r=Math.imul(j,it),n=(n=Math.imul(j,rt))+Math.imul(U,it)|0,s=Math.imul(U,rt),r=r+Math.imul(O,st)|0,n=(n=n+Math.imul(O,ot)|0)+Math.imul(D,st)|0,s=s+Math.imul(D,ot)|0,r=r+Math.imul(R,ht)|0,n=(n=n+Math.imul(R,ut)|0)+Math.imul(P,ht)|0,s=s+Math.imul(P,ut)|0,r=r+Math.imul(I,ct)|0,n=(n=n+Math.imul(I,dt)|0)+Math.imul(C,ct)|0,s=s+Math.imul(C,dt)|0;var Ct=(u+(r=r+Math.imul(S,pt)|0)|0)+((8191&(n=(n=n+Math.imul(S,mt)|0)+Math.imul(T,pt)|0))<<13)|0;u=((s=s+Math.imul(T,mt)|0)+(n>>>13)|0)+(Ct>>>26)|0,Ct&=67108863,r=Math.imul(j,st),n=(n=Math.imul(j,ot))+Math.imul(U,st)|0,s=Math.imul(U,ot),r=r+Math.imul(O,ht)|0,n=(n=n+Math.imul(O,ut)|0)+Math.imul(D,ht)|0,s=s+Math.imul(D,ut)|0,r=r+Math.imul(R,ct)|0,n=(n=n+Math.imul(R,dt)|0)+Math.imul(P,ct)|0,s=s+Math.imul(P,dt)|0;var Bt=(u+(r=r+Math.imul(I,pt)|0)|0)+((8191&(n=(n=n+Math.imul(I,mt)|0)+Math.imul(C,pt)|0))<<13)|0;u=((s=s+Math.imul(C,mt)|0)+(n>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,r=Math.imul(j,ht),n=(n=Math.imul(j,ut))+Math.imul(U,ht)|0,s=Math.imul(U,ut),r=r+Math.imul(O,ct)|0,n=(n=n+Math.imul(O,dt)|0)+Math.imul(D,ct)|0,s=s+Math.imul(D,dt)|0;var Rt=(u+(r=r+Math.imul(R,pt)|0)|0)+((8191&(n=(n=n+Math.imul(R,mt)|0)+Math.imul(P,pt)|0))<<13)|0;u=((s=s+Math.imul(P,mt)|0)+(n>>>13)|0)+(Rt>>>26)|0,Rt&=67108863,r=Math.imul(j,ct),n=(n=Math.imul(j,dt))+Math.imul(U,ct)|0,s=Math.imul(U,dt);var Pt=(u+(r=r+Math.imul(O,pt)|0)|0)+((8191&(n=(n=n+Math.imul(O,mt)|0)+Math.imul(D,pt)|0))<<13)|0;u=((s=s+Math.imul(D,mt)|0)+(n>>>13)|0)+(Pt>>>26)|0,Pt&=67108863;var Lt=(u+(r=Math.imul(j,pt))|0)+((8191&(n=(n=Math.imul(j,mt))+Math.imul(U,pt)|0))<<13)|0;return u=((s=Math.imul(U,mt))+(n>>>13)|0)+(Lt>>>26)|0,Lt&=67108863,h[0]=gt,h[1]=bt,h[2]=vt,h[3]=yt,h[4]=wt,h[5]=_t,h[6]=Mt,h[7]=kt,h[8]=xt,h[9]=Et,h[10]=St,h[11]=Tt,h[12]=At,h[13]=It,h[14]=Ct,h[15]=Bt,h[16]=Rt,h[17]=Pt,h[18]=Lt,0!==u&&(h[19]=u,i.length++),i};function m(t,e,i){return(new g).mulp(t,e,i)}function g(t,e){this.x=t,this.y=e}Math.imul||(p=f),s.prototype.mulTo=function(t,e){var i,r=this.length+t.length;return i=10===this.length&&10===t.length?p(this,t,e):r<63?f(this,t,e):r<1024?function(t,e,i){i.negative=e.negative^t.negative,i.length=t.length+e.length;for(var r=0,n=0,s=0;s>>26)|0)>>>26,o&=67108863}i.words[s]=a,r=o,o=n}return 0!==r?i.words[s]=r:i.length--,i.strip()}(this,t,e):m(this,t,e),i},g.prototype.makeRBT=function(t){for(var e=new Array(t),i=s.prototype._countBits(t)-1,r=0;r>=1;return r},g.prototype.permute=function(t,e,i,r,n,s){for(var o=0;o>>=1)n++;return 1<>>=13,i[2*o+1]=8191&s,s>>>=13;for(o=2*e;o>=26,e+=n/67108864|0,e+=s>>>26,this.words[i]=67108863&s}return 0!==e&&(this.words[i]=e,this.length++),this},s.prototype.muln=function(t){return this.clone().imuln(t)},s.prototype.sqr=function(){return this.mul(this)},s.prototype.isqr=function(){return this.imul(this.clone())},s.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),i=0;i>>n}return e}(t);if(0===e.length)return new s(1);for(var i=this,r=0;r=0);var e,i=t%26,n=(t-i)/26,s=67108863>>>26-i<<26-i;if(0!==i){var o=0;for(e=0;e>>26-i}o&&(this.words[e]=o,this.length++)}if(0!==n){for(e=this.length-1;e>=0;e--)this.words[e+n]=this.words[e];for(e=0;e=0),n=e?(e-e%26)/26:0;var s=t%26,o=Math.min((t-s)/26,this.length),a=67108863^67108863>>>s<o)for(this.length-=o,u=0;u=0&&(0!==l||u>=n);u--){var c=0|this.words[u];this.words[u]=l<<26-s|c>>>s,l=c&a}return h&&0!==l&&(h.words[h.length++]=l),0===this.length&&(this.words[0]=0,this.length=1),this.strip()},s.prototype.ishrn=function(t,e,i){return r(0===this.negative),this.iushrn(t,e,i)},s.prototype.shln=function(t){return this.clone().ishln(t)},s.prototype.ushln=function(t){return this.clone().iushln(t)},s.prototype.shrn=function(t){return this.clone().ishrn(t)},s.prototype.ushrn=function(t){return this.clone().iushrn(t)},s.prototype.testn=function(t){r("number"==typeof t&&t>=0);var e=t%26,i=(t-e)/26,n=1<=0);var e=t%26,i=(t-e)/26;if(r(0===this.negative,"imaskn works only with positive numbers"),this.length<=i)return this;if(0!==e&&i++,this.length=Math.min(i,this.length),0!==e){var n=67108863^67108863>>>e<=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},s.prototype.isubn=function(t){if(r("number"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e>26)-(h/67108864|0),this.words[n+i]=67108863&s}for(;n>26,this.words[n+i]=67108863&s;if(0===a)return this.strip();for(r(-1===a),a=0,n=0;n>26,this.words[n]=67108863&s;return this.negative=1,this.strip()},s.prototype._wordDiv=function(t,e){var i=(this.length,t.length),r=this.clone(),n=t,o=0|n.words[n.length-1];0!=(i=26-this._countBits(o))&&(n=n.ushln(i),r.iushln(i),o=0|n.words[n.length-1]);var a,h=r.length-n.length;if("mod"!==e){(a=new s(null)).length=h+1,a.words=new Array(a.length);for(var u=0;u=0;c--){var d=67108864*(0|r.words[n.length+c])+(0|r.words[n.length+c-1]);for(d=Math.min(d/o|0,67108863),r._ishlnsubmul(n,d,c);0!==r.negative;)d--,r.negative=0,r._ishlnsubmul(n,1,c),r.isZero()||(r.negative^=1);a&&(a.words[c]=d)}return a&&a.strip(),r.strip(),"div"!==e&&0!==i&&r.iushrn(i),{div:a||null,mod:r}},s.prototype.divmod=function(t,e,i){return r(!t.isZero()),this.isZero()?{div:new s(0),mod:new s(0)}:0!==this.negative&&0===t.negative?(a=this.neg().divmod(t,e),"mod"!==e&&(n=a.div.neg()),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.iadd(t)),{div:n,mod:o}):0===this.negative&&0!==t.negative?(a=this.divmod(t.neg(),e),"mod"!==e&&(n=a.div.neg()),{div:n,mod:a.mod}):0!=(this.negative&t.negative)?(a=this.neg().divmod(t.neg(),e),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.isub(t)),{div:a.div,mod:o}):t.length>this.length||this.cmp(t)<0?{div:new s(0),mod:this}:1===t.length?"div"===e?{div:this.divn(t.words[0]),mod:null}:"mod"===e?{div:null,mod:new s(this.modn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new s(this.modn(t.words[0]))}:this._wordDiv(t,e);var n,o,a},s.prototype.div=function(t){return this.divmod(t,"div",!1).div},s.prototype.mod=function(t){return this.divmod(t,"mod",!1).mod},s.prototype.umod=function(t){return this.divmod(t,"mod",!0).mod},s.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var i=0!==e.div.negative?e.mod.isub(t):e.mod,r=t.ushrn(1),n=t.andln(1),s=i.cmp(r);return s<0||1===n&&0===s?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},s.prototype.modn=function(t){r(t<=67108863);for(var e=(1<<26)%t,i=0,n=this.length-1;n>=0;n--)i=(e*i+(0|this.words[n]))%t;return i},s.prototype.idivn=function(t){r(t<=67108863);for(var e=0,i=this.length-1;i>=0;i--){var n=(0|this.words[i])+67108864*e;this.words[i]=n/t|0,e=n%t}return this.strip()},s.prototype.divn=function(t){return this.clone().idivn(t)},s.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n=new s(1),o=new s(0),a=new s(0),h=new s(1),u=0;e.isEven()&&i.isEven();)e.iushrn(1),i.iushrn(1),++u;for(var l=i.clone(),c=e.clone();!e.isZero();){for(var d=0,f=1;0==(e.words[0]&f)&&d<26;++d,f<<=1);if(d>0)for(e.iushrn(d);d-- >0;)(n.isOdd()||o.isOdd())&&(n.iadd(l),o.isub(c)),n.iushrn(1),o.iushrn(1);for(var p=0,m=1;0==(i.words[0]&m)&&p<26;++p,m<<=1);if(p>0)for(i.iushrn(p);p-- >0;)(a.isOdd()||h.isOdd())&&(a.iadd(l),h.isub(c)),a.iushrn(1),h.iushrn(1);e.cmp(i)>=0?(e.isub(i),n.isub(a),o.isub(h)):(i.isub(e),a.isub(n),h.isub(o))}return{a,b:h,gcd:i.iushln(u)}},s.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n,o=new s(1),a=new s(0),h=i.clone();e.cmpn(1)>0&&i.cmpn(1)>0;){for(var u=0,l=1;0==(e.words[0]&l)&&u<26;++u,l<<=1);if(u>0)for(e.iushrn(u);u-- >0;)o.isOdd()&&o.iadd(h),o.iushrn(1);for(var c=0,d=1;0==(i.words[0]&d)&&c<26;++c,d<<=1);if(c>0)for(i.iushrn(c);c-- >0;)a.isOdd()&&a.iadd(h),a.iushrn(1);e.cmp(i)>=0?(e.isub(i),o.isub(a)):(i.isub(e),a.isub(o))}return(n=0===e.cmpn(1)?o:a).cmpn(0)<0&&n.iadd(t),n},s.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),i=t.clone();e.negative=0,i.negative=0;for(var r=0;e.isEven()&&i.isEven();r++)e.iushrn(1),i.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;i.isEven();)i.iushrn(1);var n=e.cmp(i);if(n<0){var s=e;e=i,i=s}else if(0===n||0===i.cmpn(1))break;e.isub(i)}return i.iushln(r)},s.prototype.invm=function(t){return this.egcd(t).a.umod(t)},s.prototype.isEven=function(){return 0==(1&this.words[0])},s.prototype.isOdd=function(){return 1==(1&this.words[0])},s.prototype.andln=function(t){return this.words[0]&t},s.prototype.bincn=function(t){r("number"==typeof t);var e=t%26,i=(t-e)/26,n=1<>>26,a&=67108863,this.words[o]=a}return 0!==s&&(this.words[o]=s,this.length++),this},s.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},s.prototype.cmpn=function(t){var e,i=t<0;if(0!==this.negative&&!i)return-1;if(0===this.negative&&i)return 1;if(this.strip(),this.length>1)e=1;else{i&&(t=-t),r(t<=67108863,"Number is too big");var n=0|this.words[0];e=n===t?0:nt.length)return 1;if(this.length=0;i--){var r=0|this.words[i],n=0|t.words[i];if(r!==n){rn&&(e=1);break}}return e},s.prototype.gtn=function(t){return 1===this.cmpn(t)},s.prototype.gt=function(t){return 1===this.cmp(t)},s.prototype.gten=function(t){return this.cmpn(t)>=0},s.prototype.gte=function(t){return this.cmp(t)>=0},s.prototype.ltn=function(t){return-1===this.cmpn(t)},s.prototype.lt=function(t){return-1===this.cmp(t)},s.prototype.lten=function(t){return this.cmpn(t)<=0},s.prototype.lte=function(t){return this.cmp(t)<=0},s.prototype.eqn=function(t){return 0===this.cmpn(t)},s.prototype.eq=function(t){return 0===this.cmp(t)},s.red=function(t){return new k(t)},s.prototype.toRed=function(t){return r(!this.red,"Already a number in reduction context"),r(0===this.negative,"red works only with positives"),t.convertTo(this)._forceRed(t)},s.prototype.fromRed=function(){return r(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},s.prototype._forceRed=function(t){return this.red=t,this},s.prototype.forceRed=function(t){return r(!this.red,"Already a number in reduction context"),this._forceRed(t)},s.prototype.redAdd=function(t){return r(this.red,"redAdd works only with red numbers"),this.red.add(this,t)},s.prototype.redIAdd=function(t){return r(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,t)},s.prototype.redSub=function(t){return r(this.red,"redSub works only with red numbers"),this.red.sub(this,t)},s.prototype.redISub=function(t){return r(this.red,"redISub works only with red numbers"),this.red.isub(this,t)},s.prototype.redShl=function(t){return r(this.red,"redShl works only with red numbers"),this.red.shl(this,t)},s.prototype.redMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.mul(this,t)},s.prototype.redIMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.imul(this,t)},s.prototype.redSqr=function(){return r(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},s.prototype.redISqr=function(){return r(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},s.prototype.redSqrt=function(){return r(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},s.prototype.redInvm=function(){return r(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},s.prototype.redNeg=function(){return r(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},s.prototype.redPow=function(t){return r(this.red&&!t.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,t)};var b={k256:null,p224:null,p192:null,p25519:null};function v(t,e){this.name=t,this.p=new s(e,16),this.n=this.p.bitLength(),this.k=new s(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function y(){v.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function w(){v.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function _(){v.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function M(){v.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function k(t){if("string"==typeof t){var e=s._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),"modulus must be greater than 1"),this.m=t,this.prime=null}function x(t){k.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new s(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}v.prototype._tmp=function(){var t=new s(null);return t.words=new Array(Math.ceil(this.n/13)),t},v.prototype.ireduce=function(t){var e,i=t;do{this.split(i,this.tmp),e=(i=(i=this.imulK(i)).iadd(this.tmp)).bitLength()}while(e>this.n);var r=e0?i.isub(this.p):void 0!==i.strip?i.strip():i._strip(),i},v.prototype.split=function(t,e){t.iushrn(this.n,0,e)},v.prototype.imulK=function(t){return t.imul(this.k)},n(y,v),y.prototype.split=function(t,e){for(var i=4194303,r=Math.min(t.length,9),n=0;n>>22,s=o}s>>>=22,t.words[n-10]=s,0===s&&t.length>10?t.length-=10:t.length-=9},y.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,i=0;i>>=26,t.words[i]=n,e=r}return 0!==e&&(t.words[t.length++]=e),t},s._prime=function(t){if(b[t])return b[t];var e;if("k256"===t)e=new y;else if("p224"===t)e=new w;else if("p192"===t)e=new _;else{if("p25519"!==t)throw new Error("Unknown prime "+t);e=new M}return b[t]=e,e},k.prototype._verify1=function(t){r(0===t.negative,"red works only with positives"),r(t.red,"red works only with red numbers")},k.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),"red works only with positives"),r(t.red&&t.red===e.red,"red works only with red numbers")},k.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):t.umod(this.m)._forceRed(this)},k.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},k.prototype.add=function(t,e){this._verify2(t,e);var i=t.add(e);return i.cmp(this.m)>=0&&i.isub(this.m),i._forceRed(this)},k.prototype.iadd=function(t,e){this._verify2(t,e);var i=t.iadd(e);return i.cmp(this.m)>=0&&i.isub(this.m),i},k.prototype.sub=function(t,e){this._verify2(t,e);var i=t.sub(e);return i.cmpn(0)<0&&i.iadd(this.m),i._forceRed(this)},k.prototype.isub=function(t,e){this._verify2(t,e);var i=t.isub(e);return i.cmpn(0)<0&&i.iadd(this.m),i},k.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},k.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},k.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},k.prototype.isqr=function(t){return this.imul(t,t.clone())},k.prototype.sqr=function(t){return this.mul(t,t)},k.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var i=this.m.add(new s(1)).iushrn(2);return this.pow(t,i)}for(var n=this.m.subn(1),o=0;!n.isZero()&&0===n.andln(1);)o++,n.iushrn(1);r(!n.isZero());var a=new s(1).toRed(this),h=a.redNeg(),u=this.m.subn(1).iushrn(1),l=this.m.bitLength();for(l=new s(2*l*l).toRed(this);0!==this.pow(l,u).cmp(h);)l.redIAdd(h);for(var c=this.pow(l,n),d=this.pow(t,n.addn(1).iushrn(1)),f=this.pow(t,n),p=o;0!==f.cmp(a);){for(var m=f,g=0;0!==m.cmp(a);g++)m=m.redSqr();r(g=0;r--){for(var u=e.words[r],l=h-1;l>=0;l--){var c=u>>l&1;n!==i[0]&&(n=this.sqr(n)),0!==c||0!==o?(o<<=1,o|=c,(4==++a||0===r&&0===l)&&(n=this.mul(n,i[o]),a=0,o=0)):a=0}h=26}return n},k.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},k.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},s.mont=function(t){return new x(t)},n(x,k),x.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},x.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},x.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var i=t.imul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),s=n;return n.cmp(this.m)>=0?s=n.isub(this.m):n.cmpn(0)<0&&(s=n.iadd(this.m)),s._forceRed(this)},x.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new s(0)._forceRed(this);var i=t.mul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),o=n;return n.cmp(this.m)>=0?o=n.isub(this.m):n.cmpn(0)<0&&(o=n.iadd(this.m)),o._forceRed(this)},x.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(t=i.nmd(t),this)},9146:t=>{"use strict";function e(){this._types=Object.create(null),this._extensions=Object.create(null);for(let t=0;t{"use strict";let r=i(9146);t.exports=new r(i(4415),i(3014))},3014:t=>{t.exports={"application/prs.cww":["cww"],"application/vnd.1000minds.decision-model+xml":["1km"],"application/vnd.3gpp.pic-bw-large":["plb"],"application/vnd.3gpp.pic-bw-small":["psb"],"application/vnd.3gpp.pic-bw-var":["pvb"],"application/vnd.3gpp2.tcap":["tcap"],"application/vnd.3m.post-it-notes":["pwn"],"application/vnd.accpac.simply.aso":["aso"],"application/vnd.accpac.simply.imp":["imp"],"application/vnd.acucobol":["acu"],"application/vnd.acucorp":["atc","acutc"],"application/vnd.adobe.air-application-installer-package+zip":["air"],"application/vnd.adobe.formscentral.fcdt":["fcdt"],"application/vnd.adobe.fxp":["fxp","fxpl"],"application/vnd.adobe.xdp+xml":["xdp"],"application/vnd.adobe.xfdf":["xfdf"],"application/vnd.ahead.space":["ahead"],"application/vnd.airzip.filesecure.azf":["azf"],"application/vnd.airzip.filesecure.azs":["azs"],"application/vnd.amazon.ebook":["azw"],"application/vnd.americandynamics.acc":["acc"],"application/vnd.amiga.ami":["ami"],"application/vnd.android.package-archive":["apk"],"application/vnd.anser-web-certificate-issue-initiation":["cii"],"application/vnd.anser-web-funds-transfer-initiation":["fti"],"application/vnd.antix.game-component":["atx"],"application/vnd.apple.installer+xml":["mpkg"],"application/vnd.apple.keynote":["key"],"application/vnd.apple.mpegurl":["m3u8"],"application/vnd.apple.numbers":["numbers"],"application/vnd.apple.pages":["pages"],"application/vnd.apple.pkpass":["pkpass"],"application/vnd.aristanetworks.swi":["swi"],"application/vnd.astraea-software.iota":["iota"],"application/vnd.audiograph":["aep"],"application/vnd.balsamiq.bmml+xml":["bmml"],"application/vnd.blueice.multipass":["mpm"],"application/vnd.bmi":["bmi"],"application/vnd.businessobjects":["rep"],"application/vnd.chemdraw+xml":["cdxml"],"application/vnd.chipnuts.karaoke-mmd":["mmd"],"application/vnd.cinderella":["cdy"],"application/vnd.citationstyles.style+xml":["csl"],"application/vnd.claymore":["cla"],"application/vnd.cloanto.rp9":["rp9"],"application/vnd.clonk.c4group":["c4g","c4d","c4f","c4p","c4u"],"application/vnd.cluetrust.cartomobile-config":["c11amc"],"application/vnd.cluetrust.cartomobile-config-pkg":["c11amz"],"application/vnd.commonspace":["csp"],"application/vnd.contact.cmsg":["cdbcmsg"],"application/vnd.cosmocaller":["cmc"],"application/vnd.crick.clicker":["clkx"],"application/vnd.crick.clicker.keyboard":["clkk"],"application/vnd.crick.clicker.palette":["clkp"],"application/vnd.crick.clicker.template":["clkt"],"application/vnd.crick.clicker.wordbank":["clkw"],"application/vnd.criticaltools.wbs+xml":["wbs"],"application/vnd.ctc-posml":["pml"],"application/vnd.cups-ppd":["ppd"],"application/vnd.curl.car":["car"],"application/vnd.curl.pcurl":["pcurl"],"application/vnd.dart":["dart"],"application/vnd.data-vision.rdz":["rdz"],"application/vnd.dbf":["dbf"],"application/vnd.dece.data":["uvf","uvvf","uvd","uvvd"],"application/vnd.dece.ttml+xml":["uvt","uvvt"],"application/vnd.dece.unspecified":["uvx","uvvx"],"application/vnd.dece.zip":["uvz","uvvz"],"application/vnd.denovo.fcselayout-link":["fe_launch"],"application/vnd.dna":["dna"],"application/vnd.dolby.mlp":["mlp"],"application/vnd.dpgraph":["dpg"],"application/vnd.dreamfactory":["dfac"],"application/vnd.ds-keypoint":["kpxx"],"application/vnd.dvb.ait":["ait"],"application/vnd.dvb.service":["svc"],"application/vnd.dynageo":["geo"],"application/vnd.ecowin.chart":["mag"],"application/vnd.enliven":["nml"],"application/vnd.epson.esf":["esf"],"application/vnd.epson.msf":["msf"],"application/vnd.epson.quickanime":["qam"],"application/vnd.epson.salt":["slt"],"application/vnd.epson.ssf":["ssf"],"application/vnd.eszigno3+xml":["es3","et3"],"application/vnd.ezpix-album":["ez2"],"application/vnd.ezpix-package":["ez3"],"application/vnd.fdf":["fdf"],"application/vnd.fdsn.mseed":["mseed"],"application/vnd.fdsn.seed":["seed","dataless"],"application/vnd.flographit":["gph"],"application/vnd.fluxtime.clip":["ftc"],"application/vnd.framemaker":["fm","frame","maker","book"],"application/vnd.frogans.fnc":["fnc"],"application/vnd.frogans.ltf":["ltf"],"application/vnd.fsc.weblaunch":["fsc"],"application/vnd.fujitsu.oasys":["oas"],"application/vnd.fujitsu.oasys2":["oa2"],"application/vnd.fujitsu.oasys3":["oa3"],"application/vnd.fujitsu.oasysgp":["fg5"],"application/vnd.fujitsu.oasysprs":["bh2"],"application/vnd.fujixerox.ddd":["ddd"],"application/vnd.fujixerox.docuworks":["xdw"],"application/vnd.fujixerox.docuworks.binder":["xbd"],"application/vnd.fuzzysheet":["fzs"],"application/vnd.genomatix.tuxedo":["txd"],"application/vnd.geogebra.file":["ggb"],"application/vnd.geogebra.tool":["ggt"],"application/vnd.geometry-explorer":["gex","gre"],"application/vnd.geonext":["gxt"],"application/vnd.geoplan":["g2w"],"application/vnd.geospace":["g3w"],"application/vnd.gmx":["gmx"],"application/vnd.google-apps.document":["gdoc"],"application/vnd.google-apps.presentation":["gslides"],"application/vnd.google-apps.spreadsheet":["gsheet"],"application/vnd.google-earth.kml+xml":["kml"],"application/vnd.google-earth.kmz":["kmz"],"application/vnd.grafeq":["gqf","gqs"],"application/vnd.groove-account":["gac"],"application/vnd.groove-help":["ghf"],"application/vnd.groove-identity-message":["gim"],"application/vnd.groove-injector":["grv"],"application/vnd.groove-tool-message":["gtm"],"application/vnd.groove-tool-template":["tpl"],"application/vnd.groove-vcard":["vcg"],"application/vnd.hal+xml":["hal"],"application/vnd.handheld-entertainment+xml":["zmm"],"application/vnd.hbci":["hbci"],"application/vnd.hhe.lesson-player":["les"],"application/vnd.hp-hpgl":["hpgl"],"application/vnd.hp-hpid":["hpid"],"application/vnd.hp-hps":["hps"],"application/vnd.hp-jlyt":["jlt"],"application/vnd.hp-pcl":["pcl"],"application/vnd.hp-pclxl":["pclxl"],"application/vnd.hydrostatix.sof-data":["sfd-hdstx"],"application/vnd.ibm.minipay":["mpy"],"application/vnd.ibm.modcap":["afp","listafp","list3820"],"application/vnd.ibm.rights-management":["irm"],"application/vnd.ibm.secure-container":["sc"],"application/vnd.iccprofile":["icc","icm"],"application/vnd.igloader":["igl"],"application/vnd.immervision-ivp":["ivp"],"application/vnd.immervision-ivu":["ivu"],"application/vnd.insors.igm":["igm"],"application/vnd.intercon.formnet":["xpw","xpx"],"application/vnd.intergeo":["i2g"],"application/vnd.intu.qbo":["qbo"],"application/vnd.intu.qfx":["qfx"],"application/vnd.ipunplugged.rcprofile":["rcprofile"],"application/vnd.irepository.package+xml":["irp"],"application/vnd.is-xpr":["xpr"],"application/vnd.isac.fcs":["fcs"],"application/vnd.jam":["jam"],"application/vnd.jcp.javame.midlet-rms":["rms"],"application/vnd.jisp":["jisp"],"application/vnd.joost.joda-archive":["joda"],"application/vnd.kahootz":["ktz","ktr"],"application/vnd.kde.karbon":["karbon"],"application/vnd.kde.kchart":["chrt"],"application/vnd.kde.kformula":["kfo"],"application/vnd.kde.kivio":["flw"],"application/vnd.kde.kontour":["kon"],"application/vnd.kde.kpresenter":["kpr","kpt"],"application/vnd.kde.kspread":["ksp"],"application/vnd.kde.kword":["kwd","kwt"],"application/vnd.kenameaapp":["htke"],"application/vnd.kidspiration":["kia"],"application/vnd.kinar":["kne","knp"],"application/vnd.koan":["skp","skd","skt","skm"],"application/vnd.kodak-descriptor":["sse"],"application/vnd.las.las+xml":["lasxml"],"application/vnd.llamagraphics.life-balance.desktop":["lbd"],"application/vnd.llamagraphics.life-balance.exchange+xml":["lbe"],"application/vnd.lotus-1-2-3":["123"],"application/vnd.lotus-approach":["apr"],"application/vnd.lotus-freelance":["pre"],"application/vnd.lotus-notes":["nsf"],"application/vnd.lotus-organizer":["org"],"application/vnd.lotus-screencam":["scm"],"application/vnd.lotus-wordpro":["lwp"],"application/vnd.macports.portpkg":["portpkg"],"application/vnd.mapbox-vector-tile":["mvt"],"application/vnd.mcd":["mcd"],"application/vnd.medcalcdata":["mc1"],"application/vnd.mediastation.cdkey":["cdkey"],"application/vnd.mfer":["mwf"],"application/vnd.mfmp":["mfm"],"application/vnd.micrografx.flo":["flo"],"application/vnd.micrografx.igx":["igx"],"application/vnd.mif":["mif"],"application/vnd.mobius.daf":["daf"],"application/vnd.mobius.dis":["dis"],"application/vnd.mobius.mbk":["mbk"],"application/vnd.mobius.mqy":["mqy"],"application/vnd.mobius.msl":["msl"],"application/vnd.mobius.plc":["plc"],"application/vnd.mobius.txf":["txf"],"application/vnd.mophun.application":["mpn"],"application/vnd.mophun.certificate":["mpc"],"application/vnd.mozilla.xul+xml":["xul"],"application/vnd.ms-artgalry":["cil"],"application/vnd.ms-cab-compressed":["cab"],"application/vnd.ms-excel":["xls","xlm","xla","xlc","xlt","xlw"],"application/vnd.ms-excel.addin.macroenabled.12":["xlam"],"application/vnd.ms-excel.sheet.binary.macroenabled.12":["xlsb"],"application/vnd.ms-excel.sheet.macroenabled.12":["xlsm"],"application/vnd.ms-excel.template.macroenabled.12":["xltm"],"application/vnd.ms-fontobject":["eot"],"application/vnd.ms-htmlhelp":["chm"],"application/vnd.ms-ims":["ims"],"application/vnd.ms-lrm":["lrm"],"application/vnd.ms-officetheme":["thmx"],"application/vnd.ms-outlook":["msg"],"application/vnd.ms-pki.seccat":["cat"],"application/vnd.ms-pki.stl":["*stl"],"application/vnd.ms-powerpoint":["ppt","pps","pot"],"application/vnd.ms-powerpoint.addin.macroenabled.12":["ppam"],"application/vnd.ms-powerpoint.presentation.macroenabled.12":["pptm"],"application/vnd.ms-powerpoint.slide.macroenabled.12":["sldm"],"application/vnd.ms-powerpoint.slideshow.macroenabled.12":["ppsm"],"application/vnd.ms-powerpoint.template.macroenabled.12":["potm"],"application/vnd.ms-project":["mpp","mpt"],"application/vnd.ms-word.document.macroenabled.12":["docm"],"application/vnd.ms-word.template.macroenabled.12":["dotm"],"application/vnd.ms-works":["wps","wks","wcm","wdb"],"application/vnd.ms-wpl":["wpl"],"application/vnd.ms-xpsdocument":["xps"],"application/vnd.mseq":["mseq"],"application/vnd.musician":["mus"],"application/vnd.muvee.style":["msty"],"application/vnd.mynfc":["taglet"],"application/vnd.neurolanguage.nlu":["nlu"],"application/vnd.nitf":["ntf","nitf"],"application/vnd.noblenet-directory":["nnd"],"application/vnd.noblenet-sealer":["nns"],"application/vnd.noblenet-web":["nnw"],"application/vnd.nokia.n-gage.ac+xml":["*ac"],"application/vnd.nokia.n-gage.data":["ngdat"],"application/vnd.nokia.n-gage.symbian.install":["n-gage"],"application/vnd.nokia.radio-preset":["rpst"],"application/vnd.nokia.radio-presets":["rpss"],"application/vnd.novadigm.edm":["edm"],"application/vnd.novadigm.edx":["edx"],"application/vnd.novadigm.ext":["ext"],"application/vnd.oasis.opendocument.chart":["odc"],"application/vnd.oasis.opendocument.chart-template":["otc"],"application/vnd.oasis.opendocument.database":["odb"],"application/vnd.oasis.opendocument.formula":["odf"],"application/vnd.oasis.opendocument.formula-template":["odft"],"application/vnd.oasis.opendocument.graphics":["odg"],"application/vnd.oasis.opendocument.graphics-template":["otg"],"application/vnd.oasis.opendocument.image":["odi"],"application/vnd.oasis.opendocument.image-template":["oti"],"application/vnd.oasis.opendocument.presentation":["odp"],"application/vnd.oasis.opendocument.presentation-template":["otp"],"application/vnd.oasis.opendocument.spreadsheet":["ods"],"application/vnd.oasis.opendocument.spreadsheet-template":["ots"],"application/vnd.oasis.opendocument.text":["odt"],"application/vnd.oasis.opendocument.text-master":["odm"],"application/vnd.oasis.opendocument.text-template":["ott"],"application/vnd.oasis.opendocument.text-web":["oth"],"application/vnd.olpc-sugar":["xo"],"application/vnd.oma.dd2+xml":["dd2"],"application/vnd.openblox.game+xml":["obgx"],"application/vnd.openofficeorg.extension":["oxt"],"application/vnd.openstreetmap.data+xml":["osm"],"application/vnd.openxmlformats-officedocument.presentationml.presentation":["pptx"],"application/vnd.openxmlformats-officedocument.presentationml.slide":["sldx"],"application/vnd.openxmlformats-officedocument.presentationml.slideshow":["ppsx"],"application/vnd.openxmlformats-officedocument.presentationml.template":["potx"],"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet":["xlsx"],"application/vnd.openxmlformats-officedocument.spreadsheetml.template":["xltx"],"application/vnd.openxmlformats-officedocument.wordprocessingml.document":["docx"],"application/vnd.openxmlformats-officedocument.wordprocessingml.template":["dotx"],"application/vnd.osgeo.mapguide.package":["mgp"],"application/vnd.osgi.dp":["dp"],"application/vnd.osgi.subsystem":["esa"],"application/vnd.palm":["pdb","pqa","oprc"],"application/vnd.pawaafile":["paw"],"application/vnd.pg.format":["str"],"application/vnd.pg.osasli":["ei6"],"application/vnd.picsel":["efif"],"application/vnd.pmi.widget":["wg"],"application/vnd.pocketlearn":["plf"],"application/vnd.powerbuilder6":["pbd"],"application/vnd.previewsystems.box":["box"],"application/vnd.proteus.magazine":["mgz"],"application/vnd.publishare-delta-tree":["qps"],"application/vnd.pvi.ptid1":["ptid"],"application/vnd.quark.quarkxpress":["qxd","qxt","qwd","qwt","qxl","qxb"],"application/vnd.rar":["rar"],"application/vnd.realvnc.bed":["bed"],"application/vnd.recordare.musicxml":["mxl"],"application/vnd.recordare.musicxml+xml":["musicxml"],"application/vnd.rig.cryptonote":["cryptonote"],"application/vnd.rim.cod":["cod"],"application/vnd.rn-realmedia":["rm"],"application/vnd.rn-realmedia-vbr":["rmvb"],"application/vnd.route66.link66+xml":["link66"],"application/vnd.sailingtracker.track":["st"],"application/vnd.seemail":["see"],"application/vnd.sema":["sema"],"application/vnd.semd":["semd"],"application/vnd.semf":["semf"],"application/vnd.shana.informed.formdata":["ifm"],"application/vnd.shana.informed.formtemplate":["itp"],"application/vnd.shana.informed.interchange":["iif"],"application/vnd.shana.informed.package":["ipk"],"application/vnd.simtech-mindmapper":["twd","twds"],"application/vnd.smaf":["mmf"],"application/vnd.smart.teacher":["teacher"],"application/vnd.software602.filler.form+xml":["fo"],"application/vnd.solent.sdkm+xml":["sdkm","sdkd"],"application/vnd.spotfire.dxp":["dxp"],"application/vnd.spotfire.sfs":["sfs"],"application/vnd.stardivision.calc":["sdc"],"application/vnd.stardivision.draw":["sda"],"application/vnd.stardivision.impress":["sdd"],"application/vnd.stardivision.math":["smf"],"application/vnd.stardivision.writer":["sdw","vor"],"application/vnd.stardivision.writer-global":["sgl"],"application/vnd.stepmania.package":["smzip"],"application/vnd.stepmania.stepchart":["sm"],"application/vnd.sun.wadl+xml":["wadl"],"application/vnd.sun.xml.calc":["sxc"],"application/vnd.sun.xml.calc.template":["stc"],"application/vnd.sun.xml.draw":["sxd"],"application/vnd.sun.xml.draw.template":["std"],"application/vnd.sun.xml.impress":["sxi"],"application/vnd.sun.xml.impress.template":["sti"],"application/vnd.sun.xml.math":["sxm"],"application/vnd.sun.xml.writer":["sxw"],"application/vnd.sun.xml.writer.global":["sxg"],"application/vnd.sun.xml.writer.template":["stw"],"application/vnd.sus-calendar":["sus","susp"],"application/vnd.svd":["svd"],"application/vnd.symbian.install":["sis","sisx"],"application/vnd.syncml+xml":["xsm"],"application/vnd.syncml.dm+wbxml":["bdm"],"application/vnd.syncml.dm+xml":["xdm"],"application/vnd.syncml.dmddf+xml":["ddf"],"application/vnd.tao.intent-module-archive":["tao"],"application/vnd.tcpdump.pcap":["pcap","cap","dmp"],"application/vnd.tmobile-livetv":["tmo"],"application/vnd.trid.tpt":["tpt"],"application/vnd.triscape.mxs":["mxs"],"application/vnd.trueapp":["tra"],"application/vnd.ufdl":["ufd","ufdl"],"application/vnd.uiq.theme":["utz"],"application/vnd.umajin":["umj"],"application/vnd.unity":["unityweb"],"application/vnd.uoml+xml":["uoml"],"application/vnd.vcx":["vcx"],"application/vnd.visio":["vsd","vst","vss","vsw"],"application/vnd.visionary":["vis"],"application/vnd.vsf":["vsf"],"application/vnd.wap.wbxml":["wbxml"],"application/vnd.wap.wmlc":["wmlc"],"application/vnd.wap.wmlscriptc":["wmlsc"],"application/vnd.webturbo":["wtb"],"application/vnd.wolfram.player":["nbp"],"application/vnd.wordperfect":["wpd"],"application/vnd.wqd":["wqd"],"application/vnd.wt.stf":["stf"],"application/vnd.xara":["xar"],"application/vnd.xfdl":["xfdl"],"application/vnd.yamaha.hv-dic":["hvd"],"application/vnd.yamaha.hv-script":["hvs"],"application/vnd.yamaha.hv-voice":["hvp"],"application/vnd.yamaha.openscoreformat":["osf"],"application/vnd.yamaha.openscoreformat.osfpvg+xml":["osfpvg"],"application/vnd.yamaha.smaf-audio":["saf"],"application/vnd.yamaha.smaf-phrase":["spf"],"application/vnd.yellowriver-custom-menu":["cmp"],"application/vnd.zul":["zir","zirz"],"application/vnd.zzazz.deck+xml":["zaz"],"application/x-7z-compressed":["7z"],"application/x-abiword":["abw"],"application/x-ace-compressed":["ace"],"application/x-apple-diskimage":["*dmg"],"application/x-arj":["arj"],"application/x-authorware-bin":["aab","x32","u32","vox"],"application/x-authorware-map":["aam"],"application/x-authorware-seg":["aas"],"application/x-bcpio":["bcpio"],"application/x-bdoc":["*bdoc"],"application/x-bittorrent":["torrent"],"application/x-blorb":["blb","blorb"],"application/x-bzip":["bz"],"application/x-bzip2":["bz2","boz"],"application/x-cbr":["cbr","cba","cbt","cbz","cb7"],"application/x-cdlink":["vcd"],"application/x-cfs-compressed":["cfs"],"application/x-chat":["chat"],"application/x-chess-pgn":["pgn"],"application/x-chrome-extension":["crx"],"application/x-cocoa":["cco"],"application/x-conference":["nsc"],"application/x-cpio":["cpio"],"application/x-csh":["csh"],"application/x-debian-package":["*deb","udeb"],"application/x-dgc-compressed":["dgc"],"application/x-director":["dir","dcr","dxr","cst","cct","cxt","w3d","fgd","swa"],"application/x-doom":["wad"],"application/x-dtbncx+xml":["ncx"],"application/x-dtbook+xml":["dtb"],"application/x-dtbresource+xml":["res"],"application/x-dvi":["dvi"],"application/x-envoy":["evy"],"application/x-eva":["eva"],"application/x-font-bdf":["bdf"],"application/x-font-ghostscript":["gsf"],"application/x-font-linux-psf":["psf"],"application/x-font-pcf":["pcf"],"application/x-font-snf":["snf"],"application/x-font-type1":["pfa","pfb","pfm","afm"],"application/x-freearc":["arc"],"application/x-futuresplash":["spl"],"application/x-gca-compressed":["gca"],"application/x-glulx":["ulx"],"application/x-gnumeric":["gnumeric"],"application/x-gramps-xml":["gramps"],"application/x-gtar":["gtar"],"application/x-hdf":["hdf"],"application/x-httpd-php":["php"],"application/x-install-instructions":["install"],"application/x-iso9660-image":["*iso"],"application/x-iwork-keynote-sffkey":["*key"],"application/x-iwork-numbers-sffnumbers":["*numbers"],"application/x-iwork-pages-sffpages":["*pages"],"application/x-java-archive-diff":["jardiff"],"application/x-java-jnlp-file":["jnlp"],"application/x-keepass2":["kdbx"],"application/x-latex":["latex"],"application/x-lua-bytecode":["luac"],"application/x-lzh-compressed":["lzh","lha"],"application/x-makeself":["run"],"application/x-mie":["mie"],"application/x-mobipocket-ebook":["prc","mobi"],"application/x-ms-application":["application"],"application/x-ms-shortcut":["lnk"],"application/x-ms-wmd":["wmd"],"application/x-ms-wmz":["wmz"],"application/x-ms-xbap":["xbap"],"application/x-msaccess":["mdb"],"application/x-msbinder":["obd"],"application/x-mscardfile":["crd"],"application/x-msclip":["clp"],"application/x-msdos-program":["*exe"],"application/x-msdownload":["*exe","*dll","com","bat","*msi"],"application/x-msmediaview":["mvb","m13","m14"],"application/x-msmetafile":["*wmf","*wmz","*emf","emz"],"application/x-msmoney":["mny"],"application/x-mspublisher":["pub"],"application/x-msschedule":["scd"],"application/x-msterminal":["trm"],"application/x-mswrite":["wri"],"application/x-netcdf":["nc","cdf"],"application/x-ns-proxy-autoconfig":["pac"],"application/x-nzb":["nzb"],"application/x-perl":["pl","pm"],"application/x-pilot":["*prc","*pdb"],"application/x-pkcs12":["p12","pfx"],"application/x-pkcs7-certificates":["p7b","spc"],"application/x-pkcs7-certreqresp":["p7r"],"application/x-rar-compressed":["*rar"],"application/x-redhat-package-manager":["rpm"],"application/x-research-info-systems":["ris"],"application/x-sea":["sea"],"application/x-sh":["sh"],"application/x-shar":["shar"],"application/x-shockwave-flash":["swf"],"application/x-silverlight-app":["xap"],"application/x-sql":["sql"],"application/x-stuffit":["sit"],"application/x-stuffitx":["sitx"],"application/x-subrip":["srt"],"application/x-sv4cpio":["sv4cpio"],"application/x-sv4crc":["sv4crc"],"application/x-t3vm-image":["t3"],"application/x-tads":["gam"],"application/x-tar":["tar"],"application/x-tcl":["tcl","tk"],"application/x-tex":["tex"],"application/x-tex-tfm":["tfm"],"application/x-texinfo":["texinfo","texi"],"application/x-tgif":["*obj"],"application/x-ustar":["ustar"],"application/x-virtualbox-hdd":["hdd"],"application/x-virtualbox-ova":["ova"],"application/x-virtualbox-ovf":["ovf"],"application/x-virtualbox-vbox":["vbox"],"application/x-virtualbox-vbox-extpack":["vbox-extpack"],"application/x-virtualbox-vdi":["vdi"],"application/x-virtualbox-vhd":["vhd"],"application/x-virtualbox-vmdk":["vmdk"],"application/x-wais-source":["src"],"application/x-web-app-manifest+json":["webapp"],"application/x-x509-ca-cert":["der","crt","pem"],"application/x-xfig":["fig"],"application/x-xliff+xml":["*xlf"],"application/x-xpinstall":["xpi"],"application/x-xz":["xz"],"application/x-zmachine":["z1","z2","z3","z4","z5","z6","z7","z8"],"audio/vnd.dece.audio":["uva","uvva"],"audio/vnd.digital-winds":["eol"],"audio/vnd.dra":["dra"],"audio/vnd.dts":["dts"],"audio/vnd.dts.hd":["dtshd"],"audio/vnd.lucent.voice":["lvp"],"audio/vnd.ms-playready.media.pya":["pya"],"audio/vnd.nuera.ecelp4800":["ecelp4800"],"audio/vnd.nuera.ecelp7470":["ecelp7470"],"audio/vnd.nuera.ecelp9600":["ecelp9600"],"audio/vnd.rip":["rip"],"audio/x-aac":["aac"],"audio/x-aiff":["aif","aiff","aifc"],"audio/x-caf":["caf"],"audio/x-flac":["flac"],"audio/x-m4a":["*m4a"],"audio/x-matroska":["mka"],"audio/x-mpegurl":["m3u"],"audio/x-ms-wax":["wax"],"audio/x-ms-wma":["wma"],"audio/x-pn-realaudio":["ram","ra"],"audio/x-pn-realaudio-plugin":["rmp"],"audio/x-realaudio":["*ra"],"audio/x-wav":["*wav"],"chemical/x-cdx":["cdx"],"chemical/x-cif":["cif"],"chemical/x-cmdf":["cmdf"],"chemical/x-cml":["cml"],"chemical/x-csml":["csml"],"chemical/x-xyz":["xyz"],"image/prs.btif":["btif"],"image/prs.pti":["pti"],"image/vnd.adobe.photoshop":["psd"],"image/vnd.airzip.accelerator.azv":["azv"],"image/vnd.dece.graphic":["uvi","uvvi","uvg","uvvg"],"image/vnd.djvu":["djvu","djv"],"image/vnd.dvb.subtitle":["*sub"],"image/vnd.dwg":["dwg"],"image/vnd.dxf":["dxf"],"image/vnd.fastbidsheet":["fbs"],"image/vnd.fpx":["fpx"],"image/vnd.fst":["fst"],"image/vnd.fujixerox.edmics-mmr":["mmr"],"image/vnd.fujixerox.edmics-rlc":["rlc"],"image/vnd.microsoft.icon":["ico"],"image/vnd.ms-dds":["dds"],"image/vnd.ms-modi":["mdi"],"image/vnd.ms-photo":["wdp"],"image/vnd.net-fpx":["npx"],"image/vnd.pco.b16":["b16"],"image/vnd.tencent.tap":["tap"],"image/vnd.valve.source.texture":["vtf"],"image/vnd.wap.wbmp":["wbmp"],"image/vnd.xiff":["xif"],"image/vnd.zbrush.pcx":["pcx"],"image/x-3ds":["3ds"],"image/x-cmu-raster":["ras"],"image/x-cmx":["cmx"],"image/x-freehand":["fh","fhc","fh4","fh5","fh7"],"image/x-icon":["*ico"],"image/x-jng":["jng"],"image/x-mrsid-image":["sid"],"image/x-ms-bmp":["*bmp"],"image/x-pcx":["*pcx"],"image/x-pict":["pic","pct"],"image/x-portable-anymap":["pnm"],"image/x-portable-bitmap":["pbm"],"image/x-portable-graymap":["pgm"],"image/x-portable-pixmap":["ppm"],"image/x-rgb":["rgb"],"image/x-tga":["tga"],"image/x-xbitmap":["xbm"],"image/x-xpixmap":["xpm"],"image/x-xwindowdump":["xwd"],"message/vnd.wfa.wsc":["wsc"],"model/vnd.collada+xml":["dae"],"model/vnd.dwf":["dwf"],"model/vnd.gdl":["gdl"],"model/vnd.gtw":["gtw"],"model/vnd.mts":["mts"],"model/vnd.opengex":["ogex"],"model/vnd.parasolid.transmit.binary":["x_b"],"model/vnd.parasolid.transmit.text":["x_t"],"model/vnd.sap.vds":["vds"],"model/vnd.usdz+zip":["usdz"],"model/vnd.valve.source.compiled-map":["bsp"],"model/vnd.vtu":["vtu"],"text/prs.lines.tag":["dsc"],"text/vnd.curl":["curl"],"text/vnd.curl.dcurl":["dcurl"],"text/vnd.curl.mcurl":["mcurl"],"text/vnd.curl.scurl":["scurl"],"text/vnd.dvb.subtitle":["sub"],"text/vnd.fly":["fly"],"text/vnd.fmi.flexstor":["flx"],"text/vnd.graphviz":["gv"],"text/vnd.in3d.3dml":["3dml"],"text/vnd.in3d.spot":["spot"],"text/vnd.sun.j2me.app-descriptor":["jad"],"text/vnd.wap.wml":["wml"],"text/vnd.wap.wmlscript":["wmls"],"text/x-asm":["s","asm"],"text/x-c":["c","cc","cxx","cpp","h","hh","dic"],"text/x-component":["htc"],"text/x-fortran":["f","for","f77","f90"],"text/x-handlebars-template":["hbs"],"text/x-java-source":["java"],"text/x-lua":["lua"],"text/x-markdown":["mkd"],"text/x-nfo":["nfo"],"text/x-opml":["opml"],"text/x-org":["*org"],"text/x-pascal":["p","pas"],"text/x-processing":["pde"],"text/x-sass":["sass"],"text/x-scss":["scss"],"text/x-setext":["etx"],"text/x-sfv":["sfv"],"text/x-suse-ymp":["ymp"],"text/x-uuencode":["uu"],"text/x-vcalendar":["vcs"],"text/x-vcard":["vcf"],"video/vnd.dece.hd":["uvh","uvvh"],"video/vnd.dece.mobile":["uvm","uvvm"],"video/vnd.dece.pd":["uvp","uvvp"],"video/vnd.dece.sd":["uvs","uvvs"],"video/vnd.dece.video":["uvv","uvvv"],"video/vnd.dvb.file":["dvb"],"video/vnd.fvt":["fvt"],"video/vnd.mpegurl":["mxu","m4u"],"video/vnd.ms-playready.media.pyv":["pyv"],"video/vnd.uvvu.mp4":["uvu","uvvu"],"video/vnd.vivo":["viv"],"video/x-f4v":["f4v"],"video/x-fli":["fli"],"video/x-flv":["flv"],"video/x-m4v":["m4v"],"video/x-matroska":["mkv","mk3d","mks"],"video/x-mng":["mng"],"video/x-ms-asf":["asf","asx"],"video/x-ms-vob":["vob"],"video/x-ms-wm":["wm"],"video/x-ms-wmv":["wmv"],"video/x-ms-wmx":["wmx"],"video/x-ms-wvx":["wvx"],"video/x-msvideo":["avi"],"video/x-sgi-movie":["movie"],"video/x-smv":["smv"],"x-conference/x-cooltalk":["ice"]}},4415:t=>{t.exports={"application/andrew-inset":["ez"],"application/applixware":["aw"],"application/atom+xml":["atom"],"application/atomcat+xml":["atomcat"],"application/atomdeleted+xml":["atomdeleted"],"application/atomsvc+xml":["atomsvc"],"application/atsc-dwd+xml":["dwd"],"application/atsc-held+xml":["held"],"application/atsc-rsat+xml":["rsat"],"application/bdoc":["bdoc"],"application/calendar+xml":["xcs"],"application/ccxml+xml":["ccxml"],"application/cdfx+xml":["cdfx"],"application/cdmi-capability":["cdmia"],"application/cdmi-container":["cdmic"],"application/cdmi-domain":["cdmid"],"application/cdmi-object":["cdmio"],"application/cdmi-queue":["cdmiq"],"application/cu-seeme":["cu"],"application/dash+xml":["mpd"],"application/davmount+xml":["davmount"],"application/docbook+xml":["dbk"],"application/dssc+der":["dssc"],"application/dssc+xml":["xdssc"],"application/ecmascript":["es","ecma"],"application/emma+xml":["emma"],"application/emotionml+xml":["emotionml"],"application/epub+zip":["epub"],"application/exi":["exi"],"application/express":["exp"],"application/fdt+xml":["fdt"],"application/font-tdpfr":["pfr"],"application/geo+json":["geojson"],"application/gml+xml":["gml"],"application/gpx+xml":["gpx"],"application/gxf":["gxf"],"application/gzip":["gz"],"application/hjson":["hjson"],"application/hyperstudio":["stk"],"application/inkml+xml":["ink","inkml"],"application/ipfix":["ipfix"],"application/its+xml":["its"],"application/java-archive":["jar","war","ear"],"application/java-serialized-object":["ser"],"application/java-vm":["class"],"application/javascript":["js","mjs"],"application/json":["json","map"],"application/json5":["json5"],"application/jsonml+json":["jsonml"],"application/ld+json":["jsonld"],"application/lgr+xml":["lgr"],"application/lost+xml":["lostxml"],"application/mac-binhex40":["hqx"],"application/mac-compactpro":["cpt"],"application/mads+xml":["mads"],"application/manifest+json":["webmanifest"],"application/marc":["mrc"],"application/marcxml+xml":["mrcx"],"application/mathematica":["ma","nb","mb"],"application/mathml+xml":["mathml"],"application/mbox":["mbox"],"application/mediaservercontrol+xml":["mscml"],"application/metalink+xml":["metalink"],"application/metalink4+xml":["meta4"],"application/mets+xml":["mets"],"application/mmt-aei+xml":["maei"],"application/mmt-usd+xml":["musd"],"application/mods+xml":["mods"],"application/mp21":["m21","mp21"],"application/mp4":["mp4s","m4p"],"application/msword":["doc","dot"],"application/mxf":["mxf"],"application/n-quads":["nq"],"application/n-triples":["nt"],"application/node":["cjs"],"application/octet-stream":["bin","dms","lrf","mar","so","dist","distz","pkg","bpk","dump","elc","deploy","exe","dll","deb","dmg","iso","img","msi","msp","msm","buffer"],"application/oda":["oda"],"application/oebps-package+xml":["opf"],"application/ogg":["ogx"],"application/omdoc+xml":["omdoc"],"application/onenote":["onetoc","onetoc2","onetmp","onepkg"],"application/oxps":["oxps"],"application/p2p-overlay+xml":["relo"],"application/patch-ops-error+xml":["xer"],"application/pdf":["pdf"],"application/pgp-encrypted":["pgp"],"application/pgp-signature":["asc","sig"],"application/pics-rules":["prf"],"application/pkcs10":["p10"],"application/pkcs7-mime":["p7m","p7c"],"application/pkcs7-signature":["p7s"],"application/pkcs8":["p8"],"application/pkix-attr-cert":["ac"],"application/pkix-cert":["cer"],"application/pkix-crl":["crl"],"application/pkix-pkipath":["pkipath"],"application/pkixcmp":["pki"],"application/pls+xml":["pls"],"application/postscript":["ai","eps","ps"],"application/provenance+xml":["provx"],"application/pskc+xml":["pskcxml"],"application/raml+yaml":["raml"],"application/rdf+xml":["rdf","owl"],"application/reginfo+xml":["rif"],"application/relax-ng-compact-syntax":["rnc"],"application/resource-lists+xml":["rl"],"application/resource-lists-diff+xml":["rld"],"application/rls-services+xml":["rs"],"application/route-apd+xml":["rapd"],"application/route-s-tsid+xml":["sls"],"application/route-usd+xml":["rusd"],"application/rpki-ghostbusters":["gbr"],"application/rpki-manifest":["mft"],"application/rpki-roa":["roa"],"application/rsd+xml":["rsd"],"application/rss+xml":["rss"],"application/rtf":["rtf"],"application/sbml+xml":["sbml"],"application/scvp-cv-request":["scq"],"application/scvp-cv-response":["scs"],"application/scvp-vp-request":["spq"],"application/scvp-vp-response":["spp"],"application/sdp":["sdp"],"application/senml+xml":["senmlx"],"application/sensml+xml":["sensmlx"],"application/set-payment-initiation":["setpay"],"application/set-registration-initiation":["setreg"],"application/shf+xml":["shf"],"application/sieve":["siv","sieve"],"application/smil+xml":["smi","smil"],"application/sparql-query":["rq"],"application/sparql-results+xml":["srx"],"application/srgs":["gram"],"application/srgs+xml":["grxml"],"application/sru+xml":["sru"],"application/ssdl+xml":["ssdl"],"application/ssml+xml":["ssml"],"application/swid+xml":["swidtag"],"application/tei+xml":["tei","teicorpus"],"application/thraud+xml":["tfi"],"application/timestamped-data":["tsd"],"application/toml":["toml"],"application/trig":["trig"],"application/ttml+xml":["ttml"],"application/ubjson":["ubj"],"application/urc-ressheet+xml":["rsheet"],"application/urc-targetdesc+xml":["td"],"application/voicexml+xml":["vxml"],"application/wasm":["wasm"],"application/widget":["wgt"],"application/winhlp":["hlp"],"application/wsdl+xml":["wsdl"],"application/wspolicy+xml":["wspolicy"],"application/xaml+xml":["xaml"],"application/xcap-att+xml":["xav"],"application/xcap-caps+xml":["xca"],"application/xcap-diff+xml":["xdf"],"application/xcap-el+xml":["xel"],"application/xcap-ns+xml":["xns"],"application/xenc+xml":["xenc"],"application/xhtml+xml":["xhtml","xht"],"application/xliff+xml":["xlf"],"application/xml":["xml","xsl","xsd","rng"],"application/xml-dtd":["dtd"],"application/xop+xml":["xop"],"application/xproc+xml":["xpl"],"application/xslt+xml":["*xsl","xslt"],"application/xspf+xml":["xspf"],"application/xv+xml":["mxml","xhvml","xvml","xvm"],"application/yang":["yang"],"application/yin+xml":["yin"],"application/zip":["zip"],"audio/3gpp":["*3gpp"],"audio/adpcm":["adp"],"audio/amr":["amr"],"audio/basic":["au","snd"],"audio/midi":["mid","midi","kar","rmi"],"audio/mobile-xmf":["mxmf"],"audio/mp3":["*mp3"],"audio/mp4":["m4a","mp4a"],"audio/mpeg":["mpga","mp2","mp2a","mp3","m2a","m3a"],"audio/ogg":["oga","ogg","spx","opus"],"audio/s3m":["s3m"],"audio/silk":["sil"],"audio/wav":["wav"],"audio/wave":["*wav"],"audio/webm":["weba"],"audio/xm":["xm"],"font/collection":["ttc"],"font/otf":["otf"],"font/ttf":["ttf"],"font/woff":["woff"],"font/woff2":["woff2"],"image/aces":["exr"],"image/apng":["apng"],"image/avif":["avif"],"image/bmp":["bmp"],"image/cgm":["cgm"],"image/dicom-rle":["drle"],"image/emf":["emf"],"image/fits":["fits"],"image/g3fax":["g3"],"image/gif":["gif"],"image/heic":["heic"],"image/heic-sequence":["heics"],"image/heif":["heif"],"image/heif-sequence":["heifs"],"image/hej2k":["hej2"],"image/hsj2":["hsj2"],"image/ief":["ief"],"image/jls":["jls"],"image/jp2":["jp2","jpg2"],"image/jpeg":["jpeg","jpg","jpe"],"image/jph":["jph"],"image/jphc":["jhc"],"image/jpm":["jpm"],"image/jpx":["jpx","jpf"],"image/jxr":["jxr"],"image/jxra":["jxra"],"image/jxrs":["jxrs"],"image/jxs":["jxs"],"image/jxsc":["jxsc"],"image/jxsi":["jxsi"],"image/jxss":["jxss"],"image/ktx":["ktx"],"image/ktx2":["ktx2"],"image/png":["png"],"image/sgi":["sgi"],"image/svg+xml":["svg","svgz"],"image/t38":["t38"],"image/tiff":["tif","tiff"],"image/tiff-fx":["tfx"],"image/webp":["webp"],"image/wmf":["wmf"],"message/disposition-notification":["disposition-notification"],"message/global":["u8msg"],"message/global-delivery-status":["u8dsn"],"message/global-disposition-notification":["u8mdn"],"message/global-headers":["u8hdr"],"message/rfc822":["eml","mime"],"model/3mf":["3mf"],"model/gltf+json":["gltf"],"model/gltf-binary":["glb"],"model/iges":["igs","iges"],"model/mesh":["msh","mesh","silo"],"model/mtl":["mtl"],"model/obj":["obj"],"model/step+xml":["stpx"],"model/step+zip":["stpz"],"model/step-xml+zip":["stpxz"],"model/stl":["stl"],"model/vrml":["wrl","vrml"],"model/x3d+binary":["*x3db","x3dbz"],"model/x3d+fastinfoset":["x3db"],"model/x3d+vrml":["*x3dv","x3dvz"],"model/x3d+xml":["x3d","x3dz"],"model/x3d-vrml":["x3dv"],"text/cache-manifest":["appcache","manifest"],"text/calendar":["ics","ifb"],"text/coffeescript":["coffee","litcoffee"],"text/css":["css"],"text/csv":["csv"],"text/html":["html","htm","shtml"],"text/jade":["jade"],"text/jsx":["jsx"],"text/less":["less"],"text/markdown":["markdown","md"],"text/mathml":["mml"],"text/mdx":["mdx"],"text/n3":["n3"],"text/plain":["txt","text","conf","def","list","log","in","ini"],"text/richtext":["rtx"],"text/rtf":["*rtf"],"text/sgml":["sgml","sgm"],"text/shex":["shex"],"text/slim":["slim","slm"],"text/spdx":["spdx"],"text/stylus":["stylus","styl"],"text/tab-separated-values":["tsv"],"text/troff":["t","tr","roff","man","me","ms"],"text/turtle":["ttl"],"text/uri-list":["uri","uris","urls"],"text/vcard":["vcard"],"text/vtt":["vtt"],"text/xml":["*xml"],"text/yaml":["yaml","yml"],"video/3gpp":["3gp","3gpp"],"video/3gpp2":["3g2"],"video/h261":["h261"],"video/h263":["h263"],"video/h264":["h264"],"video/iso.segment":["m4s"],"video/jpeg":["jpgv"],"video/jpm":["*jpm","jpgm"],"video/mj2":["mj2","mjp2"],"video/mp2t":["ts"],"video/mp4":["mp4","mp4v","mpg4"],"video/mpeg":["mpeg","mpg","mpe","m1v","m2v"],"video/ogg":["ogv"],"video/quicktime":["qt","mov"],"video/webm":["webm"]}},9746:t=>{function e(t,e){if(!t)throw new Error(e||"Assertion failed")}t.exports=e,e.equal=function(t,e,i){if(t!=e)throw new Error(i||"Assertion failed: "+t+" != "+e)}},4504:(t,e)=>{"use strict";var i=e;function r(t){return 1===t.length?"0"+t:t}function n(t){for(var e="",i=0;i>8,o=255&n;s?i.push(s,o):i.push(o)}return i},i.zero2=r,i.toHex=n,i.encode=function(t,e){return"hex"===e?n(t):t}},9199:(t,e,i)=>{var r=i(8764).Buffer,n=i(2068),s=i(5597),o=i(4372),a=20828448e5;function h(t,e,i){for(var r=e;r=8;){var h=n.decode(t,a,r);o.children.push(h),o[h.type]=h,a+=h.length}return o},e.VisualSampleEntry.encodingLength=function(t){var e=78;return(t.children||[]).forEach((function(t){e+=n.encodingLength(t)})),e},e.avcC={},e.avcC.encode=function(t,i,n){i=i?i.slice(n):r.alloc(t.buffer.length),t.buffer.copy(i),e.avcC.encode.bytes=t.buffer.length},e.avcC.decode=function(t,e,i){return{mimeCodec:(t=t.slice(e,i)).toString("hex",1,4),buffer:r.from(t)}},e.avcC.encodingLength=function(t){return t.buffer.length},e.mp4a=e.AudioSampleEntry={},e.AudioSampleEntry.encode=function(t,i,s){h(i=i?i.slice(s):r.alloc(e.AudioSampleEntry.encodingLength(t)),0,6),i.writeUInt16BE(t.dataReferenceIndex||0,6),h(i,8,16),i.writeUInt16BE(t.channelCount||2,16),i.writeUInt16BE(t.sampleSize||16,18),h(i,20,24),i.writeUInt32BE(t.sampleRate||0,24);var o=28;(t.children||[]).forEach((function(t){n.encode(t,i,o),o+=n.encode.bytes})),e.AudioSampleEntry.encode.bytes=o},e.AudioSampleEntry.decode=function(t,e,i){for(var r=i-e,s={dataReferenceIndex:(t=t.slice(e,i)).readUInt16BE(6),channelCount:t.readUInt16BE(16),sampleSize:t.readUInt16BE(18),sampleRate:t.readUInt32BE(24),children:[]},o=28;r-o>=8;){var a=n.decode(t,o,r);s.children.push(a),s[a.type]=a,o+=a.length}return s},e.AudioSampleEntry.encodingLength=function(t){var e=28;return(t.children||[]).forEach((function(t){e+=n.encodingLength(t)})),e},e.esds={},e.esds.encode=function(t,i,n){i=i?i.slice(n):r.alloc(t.buffer.length),t.buffer.copy(i,0),e.esds.encode.bytes=t.buffer.length},e.esds.decode=function(t,e,i){t=t.slice(e,i);var n=s.Descriptor.decode(t,0,t.length),o=("ESDescriptor"===n.tagName?n:{}).DecoderConfigDescriptor||{},a=o.oti||0,h=o.DecoderSpecificInfo,u=h?(248&h.buffer.readUInt8(0))>>3:0,l=null;return a&&(l=a.toString(16),u&&(l+="."+u)),{mimeCodec:l,buffer:r.from(t.slice(0))}},e.esds.encodingLength=function(t){return t.buffer.length},e.stsz={},e.stsz.encode=function(t,i,n){var s=t.entries||[];(i=i?i.slice(n):r.alloc(e.stsz.encodingLength(t))).writeUInt32BE(0,0),i.writeUInt32BE(s.length,4);for(var o=0;o{var r=i(8764).Buffer,n={3:"ESDescriptor",4:"DecoderConfigDescriptor",5:"DecoderSpecificInfo",6:"SLConfigDescriptor"};e.Descriptor={},e.Descriptor.decode=function(t,i,s){var o,a,h=t.readUInt8(i),u=i+1,l=0;do{l=l<<7|127&(o=t.readUInt8(u++))}while(128&o);var c=n[h];return(a=e[c]?e[c].decode(t,u,s):{buffer:r.from(t.slice(u,u+l))}).tag=h,a.tagName=c,a.length=u-i+l,a.contentsLen=l,a},e.DescriptorArray={},e.DescriptorArray.decode=function(t,i,r){for(var s=i,o={};s+2<=r;){var a=e.Descriptor.decode(t,s,r);s+=a.length,o[n[a.tag]||"Descriptor"+a.tag]=a}return o},e.ESDescriptor={},e.ESDescriptor.decode=function(t,i,r){var n=t.readUInt8(i+2),s=i+3;return 128&n&&(s+=2),64&n&&(s+=t.readUInt8(s)+1),32&n&&(s+=2),e.DescriptorArray.decode(t,s,r)},e.DecoderConfigDescriptor={},e.DecoderConfigDescriptor.decode=function(t,i,r){var n=t.readUInt8(i),s=e.DescriptorArray.decode(t,i+13,r);return s.oti=n,s}},2068:(t,e,i)=>{var r=i(8764).Buffer,n=i(4372),s=i(9199),o=4294967295,a=e,h=e.containers={moov:["mvhd","meta","traks","mvex"],trak:["tkhd","tref","trgr","edts","meta","mdia","udta"],edts:["elst"],mdia:["mdhd","hdlr","elng","minf"],minf:["vmhd","smhd","hmhd","sthd","nmhd","dinf","stbl"],dinf:["dref"],stbl:["stsd","stts","ctts","cslg","stsc","stsz","stz2","stco","co64","stss","stsh","padb","stdp","sdtp","sbgps","sgpds","subss","saizs","saios"],mvex:["mehd","trexs","leva"],moof:["mfhd","meta","trafs"],traf:["tfhd","tfdt","trun","sbgps","sgpds","subss","saizs","saios","meta"]};a.encode=function(t,e,i){return a.encodingLength(t),i=i||0,e=e||r.alloc(t.length),a._encode(t,e,i)},a._encode=function(t,e,i){var r=t.type,u=t.length;u>o&&(u=1),e.writeUInt32BE(u,i),e.write(t.type,i+4,4,"ascii");var l=i+8;if(1===u&&(n.encode(t.length,e,l),l+=8),s.fullBoxes[r]&&(e.writeUInt32BE(t.flags||0,l),e.writeUInt8(t.version||0,l),l+=4),h[r])h[r].forEach((function(i){if(5===i.length){var r=t[i]||[];i=i.substr(0,4),r.forEach((function(t){a._encode(t,e,l),l+=a.encode.bytes}))}else t[i]&&(a._encode(t[i],e,l),l+=a.encode.bytes)})),t.otherBoxes&&t.otherBoxes.forEach((function(t){a._encode(t,e,l),l+=a.encode.bytes}));else if(s[r]){var c=s[r].encode;c(t,e,l),l+=c.bytes}else{if(!t.buffer)throw new Error("Either `type` must be set to a known type (not'"+r+"') or `buffer` must be set");t.buffer.copy(e,l),l+=t.buffer.length}return a.encode.bytes=l-i,e},a.readHeaders=function(t,e,i){if(e=e||0,(i=i||t.length)-e<8)return 8;var r,o,a=t.readUInt32BE(e),h=t.toString("ascii",e+4,e+8),u=e+8;if(1===a){if(i-e<16)return 16;a=n.decode(t,u),u+=8}return s.fullBoxes[h]&&(r=t.readUInt8(u),o=16777215&t.readUInt32BE(u),u+=4),{length:a,headersLen:u-e,contentLen:a-(u-e),type:h,version:r,flags:o}},a.decode=function(t,e,i){e=e||0,i=i||t.length;var r=a.readHeaders(t,e,i);if(!r||r.length>i-e)throw new Error("Data too short");return a.decodeWithoutHeaders(r,t,e+r.headersLen,e+r.length)},a.decodeWithoutHeaders=function(t,e,i,n){i=i||0,n=n||e.length;var o=t.type,u={};if(h[o]){u.otherBoxes=[];for(var l=h[o],c=i;n-c>=8;){var d=a.decode(e,c,n);if(c+=d.length,l.indexOf(d.type)>=0)u[d.type]=d;else if(l.indexOf(d.type+"s")>=0){var f=d.type+"s";(u[f]=u[f]||[]).push(d)}else u.otherBoxes.push(d)}}else s[o]?u=(0,s[o].decode)(e,i,n):u.buffer=r.from(e.slice(i,n));return u.length=t.length,u.contentLen=t.contentLen,u.type=t.type,u.version=t.version,u.flags=t.flags,u},a.encodingLength=function(t){var e=t.type,i=8;if(s.fullBoxes[e]&&(i+=4),h[e])h[e].forEach((function(e){if(5===e.length){var r=t[e]||[];e=e.substr(0,4),r.forEach((function(t){t.type=e,i+=a.encodingLength(t)}))}else if(t[e]){var n=t[e];n.type=e,i+=a.encodingLength(n)}})),t.otherBoxes&&t.otherBoxes.forEach((function(t){i+=a.encodingLength(t)}));else if(s[e])i+=s[e].encodingLength(t);else{if(!t.buffer)throw new Error("Either `type` must be set to a known type (not'"+e+"') or `buffer` must be set");i+=t.buffer.length}return i>o&&(i+=8),t.length=i,i}},2604:(t,e,i)=>{var r=i(8764).Buffer,n=i(8473),s=i(354),o=i(2068),a=r.alloc(0);class h extends n.Writable{constructor(t){super(t),this.destroyed=!1,this._pending=0,this._missing=0,this._ignoreEmpty=!1,this._buf=null,this._str=null,this._cb=null,this._ondrain=null,this._writeBuffer=null,this._writeCb=null,this._ondrain=null,this._kick()}destroy(t){this.destroyed||(this.destroyed=!0,t&&this.emit("error",t),this.emit("close"))}_write(t,e,i){if(!this.destroyed){for(var r=!this._str||!this._str._writableState.needDrain;t.length&&!this.destroyed;){if(!this._missing&&!this._ignoreEmpty)return this._writeBuffer=t,void(this._writeCb=i);var n=t.length{this._pending--,this._kick()})),this._cb=e,this._str}_readBox(){const t=(e,i)=>{this._buffer(e,(e=>{i=i?r.concat([i,e]):e;var n=o.readHeaders(i);"number"==typeof n?t(n-i.length,i):(this._pending++,this._headers=n,this.emit("box",n))}))};t(8)}stream(){if(!this._headers)throw new Error("this function can only be called once after 'box' is emitted");var t=this._headers;return this._headers=null,this._stream(t.contentLen,(()=>{this._pending--,this._kick()}))}decode(t){if(!this._headers)throw new Error("this function can only be called once after 'box' is emitted");var e=this._headers;this._headers=null,this._buffer(e.contentLen,(i=>{var r=o.decodeWithoutHeaders(e,i);t(r),this._pending--,this._kick()}))}ignore(){if(!this._headers)throw new Error("this function can only be called once after 'box' is emitted");var t=this._headers;this._headers=null,this._missing=t.contentLen,0===this._missing&&(this._ignoreEmpty=!0),this._cb=()=>{this._pending--,this._kick()}}_kick(){if(!this._pending&&(this._buf||this._str||this._readBox(),this._writeBuffer)){var t=this._writeCb,e=this._writeBuffer;this._writeBuffer=null,this._writeCb=null,this._write(e,null,t)}}}class u extends n.PassThrough{constructor(t){super(),this._parent=t,this.destroyed=!1}destroy(t){this.destroyed||(this.destroyed=!0,this._parent.destroy(t),t&&this.emit("error",t),this.emit("close"))}}t.exports=h},1206:(t,e,i)=>{var r=i(8764).Buffer,n=i(8473),s=i(2068),o=i(4375);function a(){}class h extends n.Readable{constructor(t){super(t),this.destroyed=!1,this._finalized=!1,this._reading=!1,this._stream=null,this._drain=null,this._want=!1,this._onreadable=()=>{this._want&&(this._want=!1,this._read())},this._onend=()=>{this._stream=null}}mdat(t,e){this.mediaData(t,e)}mediaData(t,e){var i=new u(this);return this.box({type:"mdat",contentLength:t,encodeBufferLen:8,stream:i},e),i}box(t,e){if(e||(e=a),this.destroyed)return e(new Error("Encoder is destroyed"));var i;if(t.encodeBufferLen&&(i=r.alloc(t.encodeBufferLen)),t.stream)t.buffer=null,i=s.encode(t,i),this.push(i),this._stream=t.stream,this._stream.on("readable",this._onreadable),this._stream.on("end",this._onend),this._stream.on("end",e),this._forward();else{if(i=s.encode(t,i),this.push(i))return o(e);this._drain=e}}destroy(t){if(!this.destroyed){if(this.destroyed=!0,this._stream&&this._stream.destroy&&this._stream.destroy(),this._stream=null,this._drain){var e=this._drain;this._drain=null,e(t)}t&&this.emit("error",t),this.emit("close")}}finalize(){this._finalized=!0,this._stream||this._drain||this.push(null)}_forward(){if(this._stream)for(;!this.destroyed;){var t=this._stream.read();if(!t)return void(this._want=!!this._stream);if(!this.push(t))return}}_read(){if(!this._reading&&!this.destroyed){if(this._reading=!0,this._stream&&this._forward(),this._drain){var t=this._drain;this._drain=null,t()}this._reading=!1,this._finalized&&this.push(null)}}}class u extends n.PassThrough{constructor(t){super(),this._parent=t,this.destroyed=!1}destroy(t){this.destroyed||(this.destroyed=!0,this._parent.destroy(t),t&&this.emit("error",t),this.emit("close"))}}t.exports=h},2853:(t,e,i)=>{const r=i(2604),n=i(1206);e.decode=t=>new r(t),e.encode=t=>new n(t)},7824:t=>{var e=1e3,i=60*e,r=60*i,n=24*r;function s(t,e,i,r){var n=e>=1.5*i;return Math.round(t/i)+" "+r+(n?"s":"")}t.exports=function(t,o){o=o||{};var a,h,u=typeof t;if("string"===u&&t.length>0)return function(t){if(!((t=String(t)).length>100)){var s=/^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(t);if(s){var o=parseFloat(s[1]);switch((s[2]||"ms").toLowerCase()){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*o;case"weeks":case"week":case"w":return 6048e5*o;case"days":case"day":case"d":return o*n;case"hours":case"hour":case"hrs":case"hr":case"h":return o*r;case"minutes":case"minute":case"mins":case"min":case"m":return o*i;case"seconds":case"second":case"secs":case"sec":case"s":return o*e;case"milliseconds":case"millisecond":case"msecs":case"msec":case"ms":return o;default:return}}}}(t);if("number"===u&&isFinite(t))return o.long?(a=t,(h=Math.abs(a))>=n?s(a,h,n,"day"):h>=r?s(a,h,r,"hour"):h>=i?s(a,h,i,"minute"):h>=e?s(a,h,e,"second"):a+" ms"):function(t){var s=Math.abs(t);return s>=n?Math.round(t/n)+"d":s>=r?Math.round(t/r)+"h":s>=i?Math.round(t/i)+"m":s>=e?Math.round(t/e)+"s":t+"ms"}(t);throw new Error("val is not a non-empty string or a valid number. val="+JSON.stringify(t))}},5673:(t,e,i)=>{const r=i(8473),n=i(778);function s(t){return a(t,{objectMode:!0,highWaterMark:16})}function o(t){return a(t)}function a(t,e){if(!t||"function"==typeof t||t._readableState)return t;const i=new r.Readable(e).wrap(t);return t.destroy&&(i.destroy=t.destroy.bind(t)),i}class h extends r.Readable{constructor(t,e){super({...e,autoDestroy:!0}),this._drained=!1,this._forwarding=!1,this._current=null,this._toStreams2=e&&e.objectMode?s:o,"function"==typeof t?this._queue=t:(this._queue=t.map(this._toStreams2),this._queue.forEach((t=>{"function"!=typeof t&&this._attachErrorListener(t)}))),this._next()}_read(){this._drained=!0,this._forward()}_forward(){if(this._forwarding||!this._drained||!this._current)return;let t;for(this._forwarding=!0;this._drained&&null!==(t=this._current.read());)this._drained=this.push(t);this._forwarding=!1}_destroy(t,e){let i=[];if(this._current&&i.push(this._current),"function"!=typeof this._queue&&(i=i.concat(this._queue)),0===i.length)e(t);else{let r=i.length,s=t;i.forEach((i=>{!function(t,e,i){if(!t.destroy||t.destroyed)i(e);else{const r=n((t=>i(t||e)));t.on("error",r).on("close",(()=>r())).destroy(e,r)}}(i,t,(t=>{s=s||t,0==--r&&e(s)}))}))}}_next(){if(this._current=null,"function"==typeof this._queue)this._queue(((t,e)=>{if(t)return this.destroy(t);e=this._toStreams2(e),this._attachErrorListener(e),this._gotNextStream(e)}));else{let t=this._queue.shift();"function"==typeof t&&(t=this._toStreams2(t()),this._attachErrorListener(t)),this._gotNextStream(t)}}_gotNextStream(t){if(!t)return void this.push(null);this._current=t,this._forward();const e=()=>{this._forward()},i=()=>{if(!t._readableState.ended&&!t.destroyed){const t=new Error("ERR_STREAM_PREMATURE_CLOSE");t.code="ERR_STREAM_PREMATURE_CLOSE",this.destroy(t)}},r=()=>{this._current=null,t.removeListener("readable",e),t.removeListener("end",r),t.removeListener("close",i),t.destroy(),this._next()};t.on("readable",e),t.once("end",r),t.once("close",i)}_attachErrorListener(t){if(!t)return;const e=i=>{t.removeListener("error",e),this.destroy(i)};t.once("error",e)}}h.obj=t=>new h(t,{objectMode:!0,highWaterMark:16}),t.exports=h},354:t=>{t.exports=function(t,e){var i=null;return t.on(e,(function(t){if(i){var e=i;i=null,e(t)}})),function(t){i=t}}},4244:t=>{"use strict";var e=function(t){return t!=t};t.exports=function(t,i){return 0===t&&0===i?1/t==1/i:t===i||!(!e(t)||!e(i))}},609:(t,e,i)=>{"use strict";var r=i(4289),n=i(5559),s=i(4244),o=i(5624),a=i(2281),h=n(o(),Object);r(h,{getPolyfill:o,implementation:s,shim:a}),t.exports=h},5624:(t,e,i)=>{"use strict";var r=i(4244);t.exports=function(){return"function"==typeof Object.is?Object.is:r}},2281:(t,e,i)=>{"use strict";var r=i(5624),n=i(4289);t.exports=function(){var t=r();return n(Object,{is:t},{is:function(){return Object.is!==t}}),t}},8987:(t,e,i)=>{"use strict";var r;if(!Object.keys){var n=Object.prototype.hasOwnProperty,s=Object.prototype.toString,o=i(1414),a=Object.prototype.propertyIsEnumerable,h=!a.call({toString:null},"toString"),u=a.call((function(){}),"prototype"),l=["toString","toLocaleString","valueOf","hasOwnProperty","isPrototypeOf","propertyIsEnumerable","constructor"],c=function(t){var e=t.constructor;return e&&e.prototype===t},d={$applicationCache:!0,$console:!0,$external:!0,$frame:!0,$frameElement:!0,$frames:!0,$innerHeight:!0,$innerWidth:!0,$onmozfullscreenchange:!0,$onmozfullscreenerror:!0,$outerHeight:!0,$outerWidth:!0,$pageXOffset:!0,$pageYOffset:!0,$parent:!0,$scrollLeft:!0,$scrollTop:!0,$scrollX:!0,$scrollY:!0,$self:!0,$webkitIndexedDB:!0,$webkitStorageInfo:!0,$window:!0},f=function(){if("undefined"==typeof window)return!1;for(var t in window)try{if(!d["$"+t]&&n.call(window,t)&&null!==window[t]&&"object"==typeof window[t])try{c(window[t])}catch(t){return!0}}catch(t){return!0}return!1}();r=function(t){var e=null!==t&&"object"==typeof t,i="[object Function]"===s.call(t),r=o(t),a=e&&"[object String]"===s.call(t),d=[];if(!e&&!i&&!r)throw new TypeError("Object.keys called on a non-object");var p=u&&i;if(a&&t.length>0&&!n.call(t,0))for(var m=0;m0)for(var g=0;g{"use strict";var r=Array.prototype.slice,n=i(1414),s=Object.keys,o=s?function(t){return s(t)}:i(8987),a=Object.keys;o.shim=function(){if(Object.keys){var t=function(){var t=Object.keys(arguments);return t&&t.length===arguments.length}(1,2);t||(Object.keys=function(t){return n(t)?a(r.call(t)):a(t)})}else Object.keys=o;return Object.keys||o},t.exports=o},1414:t=>{"use strict";var e=Object.prototype.toString;t.exports=function(t){var i=e.call(t),r="[object Arguments]"===i;return r||(r="[object Array]"!==i&&null!==t&&"object"==typeof t&&"number"==typeof t.length&&t.length>=0&&"[object Function]"===e.call(t.callee)),r}},778:(t,e,i)=>{var r=i(2479);function n(t){var e=function(){return e.called?e.value:(e.called=!0,e.value=t.apply(this,arguments))};return e.called=!1,e}function s(t){var e=function(){if(e.called)throw new Error(e.onceError);return e.called=!0,e.value=t.apply(this,arguments)},i=t.name||"Function wrapped with `once`";return e.onceError=i+" shouldn't be called more than once",e.called=!1,e}t.exports=r(n),t.exports.strict=r(s),n.proto=n((function(){Object.defineProperty(Function.prototype,"once",{value:function(){return n(this)},configurable:!0}),Object.defineProperty(Function.prototype,"onceStrict",{value:function(){return s(this)},configurable:!0})}))},4236:(t,e)=>{"use strict";var i="undefined"!=typeof Uint8Array&&"undefined"!=typeof Uint16Array&&"undefined"!=typeof Int32Array;function r(t,e){return Object.prototype.hasOwnProperty.call(t,e)}e.assign=function(t){for(var e=Array.prototype.slice.call(arguments,1);e.length;){var i=e.shift();if(i){if("object"!=typeof i)throw new TypeError(i+"must be non-object");for(var n in i)r(i,n)&&(t[n]=i[n])}}return t},e.shrinkBuf=function(t,e){return t.length===e?t:t.subarray?t.subarray(0,e):(t.length=e,t)};var n={arraySet:function(t,e,i,r,n){if(e.subarray&&t.subarray)t.set(e.subarray(i,i+r),n);else for(var s=0;s{"use strict";t.exports=function(t,e,i,r){for(var n=65535&t|0,s=t>>>16&65535|0,o=0;0!==i;){i-=o=i>2e3?2e3:i;do{s=s+(n=n+e[r++]|0)|0}while(--o);n%=65521,s%=65521}return n|s<<16|0}},1619:t=>{"use strict";t.exports={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8}},2869:t=>{"use strict";var e=function(){for(var t,e=[],i=0;i<256;i++){t=i;for(var r=0;r<8;r++)t=1&t?3988292384^t>>>1:t>>>1;e[i]=t}return e}();t.exports=function(t,i,r,n){var s=e,o=n+r;t^=-1;for(var a=n;a>>8^s[255&(t^i[a])];return-1^t}},405:(t,e,i)=>{"use strict";var r,n=i(4236),s=i(342),o=i(6069),a=i(2869),h=i(8898),u=-2,l=258,c=262,d=103,f=113,p=666;function m(t,e){return t.msg=h[e],e}function g(t){return(t<<1)-(t>4?9:0)}function b(t){for(var e=t.length;--e>=0;)t[e]=0}function v(t){var e=t.state,i=e.pending;i>t.avail_out&&(i=t.avail_out),0!==i&&(n.arraySet(t.output,e.pending_buf,e.pending_out,i,t.next_out),t.next_out+=i,e.pending_out+=i,t.total_out+=i,t.avail_out-=i,e.pending-=i,0===e.pending&&(e.pending_out=0))}function y(t,e){s._tr_flush_block(t,t.block_start>=0?t.block_start:-1,t.strstart-t.block_start,e),t.block_start=t.strstart,v(t.strm)}function w(t,e){t.pending_buf[t.pending++]=e}function _(t,e){t.pending_buf[t.pending++]=e>>>8&255,t.pending_buf[t.pending++]=255&e}function M(t,e){var i,r,n=t.max_chain_length,s=t.strstart,o=t.prev_length,a=t.nice_match,h=t.strstart>t.w_size-c?t.strstart-(t.w_size-c):0,u=t.window,d=t.w_mask,f=t.prev,p=t.strstart+l,m=u[s+o-1],g=u[s+o];t.prev_length>=t.good_match&&(n>>=2),a>t.lookahead&&(a=t.lookahead);do{if(u[(i=e)+o]===g&&u[i+o-1]===m&&u[i]===u[s]&&u[++i]===u[s+1]){s+=2,i++;do{}while(u[++s]===u[++i]&&u[++s]===u[++i]&&u[++s]===u[++i]&&u[++s]===u[++i]&&u[++s]===u[++i]&&u[++s]===u[++i]&&u[++s]===u[++i]&&u[++s]===u[++i]&&so){if(t.match_start=e,o=r,r>=a)break;m=u[s+o-1],g=u[s+o]}}}while((e=f[e&d])>h&&0!=--n);return o<=t.lookahead?o:t.lookahead}function k(t){var e,i,r,s,h,u,l,d,f,p,m=t.w_size;do{if(s=t.window_size-t.lookahead-t.strstart,t.strstart>=m+(m-c)){n.arraySet(t.window,t.window,m,m,0),t.match_start-=m,t.strstart-=m,t.block_start-=m,e=i=t.hash_size;do{r=t.head[--e],t.head[e]=r>=m?r-m:0}while(--i);e=i=m;do{r=t.prev[--e],t.prev[e]=r>=m?r-m:0}while(--i);s+=m}if(0===t.strm.avail_in)break;if(u=t.strm,l=t.window,d=t.strstart+t.lookahead,f=s,p=void 0,(p=u.avail_in)>f&&(p=f),i=0===p?0:(u.avail_in-=p,n.arraySet(l,u.input,u.next_in,p,d),1===u.state.wrap?u.adler=o(u.adler,l,p,d):2===u.state.wrap&&(u.adler=a(u.adler,l,p,d)),u.next_in+=p,u.total_in+=p,p),t.lookahead+=i,t.lookahead+t.insert>=3)for(h=t.strstart-t.insert,t.ins_h=t.window[h],t.ins_h=(t.ins_h<=3&&(t.ins_h=(t.ins_h<=3)if(r=s._tr_tally(t,t.strstart-t.match_start,t.match_length-3),t.lookahead-=t.match_length,t.match_length<=t.max_lazy_match&&t.lookahead>=3){t.match_length--;do{t.strstart++,t.ins_h=(t.ins_h<=3&&(t.ins_h=(t.ins_h<4096)&&(t.match_length=2)),t.prev_length>=3&&t.match_length<=t.prev_length){n=t.strstart+t.lookahead-3,r=s._tr_tally(t,t.strstart-1-t.prev_match,t.prev_length-3),t.lookahead-=t.prev_length-1,t.prev_length-=2;do{++t.strstart<=n&&(t.ins_h=(t.ins_h<15&&(a=2,r-=16),s<1||s>9||8!==i||r<8||r>15||e<0||e>9||o<0||o>4)return m(t,u);8===r&&(r=9);var h=new T;return t.state=h,h.strm=t,h.wrap=a,h.gzhead=null,h.w_bits=r,h.w_size=1<t.pending_buf_size-5&&(i=t.pending_buf_size-5);;){if(t.lookahead<=1){if(k(t),0===t.lookahead&&0===e)return 1;if(0===t.lookahead)break}t.strstart+=t.lookahead,t.lookahead=0;var r=t.block_start+i;if((0===t.strstart||t.strstart>=r)&&(t.lookahead=t.strstart-r,t.strstart=r,y(t,!1),0===t.strm.avail_out))return 1;if(t.strstart-t.block_start>=t.w_size-c&&(y(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,4===e?(y(t,!0),0===t.strm.avail_out?3:4):(t.strstart>t.block_start&&(y(t,!1),t.strm.avail_out),1)})),new S(4,4,8,4,x),new S(4,5,16,8,x),new S(4,6,32,32,x),new S(4,4,16,16,E),new S(8,16,32,32,E),new S(8,16,128,128,E),new S(8,32,128,256,E),new S(32,128,258,1024,E),new S(32,258,258,4096,E)],e.deflateInit=function(t,e){return C(t,e,8,15,8,0)},e.deflateInit2=C,e.deflateReset=I,e.deflateResetKeep=A,e.deflateSetHeader=function(t,e){return t&&t.state?2!==t.state.wrap?u:(t.state.gzhead=e,0):u},e.deflate=function(t,e){var i,n,o,h;if(!t||!t.state||e>5||e<0)return t?m(t,u):u;if(n=t.state,!t.output||!t.input&&0!==t.avail_in||n.status===p&&4!==e)return m(t,0===t.avail_out?-5:u);if(n.strm=t,i=n.last_flush,n.last_flush=e,42===n.status)if(2===n.wrap)t.adler=0,w(n,31),w(n,139),w(n,8),n.gzhead?(w(n,(n.gzhead.text?1:0)+(n.gzhead.hcrc?2:0)+(n.gzhead.extra?4:0)+(n.gzhead.name?8:0)+(n.gzhead.comment?16:0)),w(n,255&n.gzhead.time),w(n,n.gzhead.time>>8&255),w(n,n.gzhead.time>>16&255),w(n,n.gzhead.time>>24&255),w(n,9===n.level?2:n.strategy>=2||n.level<2?4:0),w(n,255&n.gzhead.os),n.gzhead.extra&&n.gzhead.extra.length&&(w(n,255&n.gzhead.extra.length),w(n,n.gzhead.extra.length>>8&255)),n.gzhead.hcrc&&(t.adler=a(t.adler,n.pending_buf,n.pending,0)),n.gzindex=0,n.status=69):(w(n,0),w(n,0),w(n,0),w(n,0),w(n,0),w(n,9===n.level?2:n.strategy>=2||n.level<2?4:0),w(n,3),n.status=f);else{var c=8+(n.w_bits-8<<4)<<8;c|=(n.strategy>=2||n.level<2?0:n.level<6?1:6===n.level?2:3)<<6,0!==n.strstart&&(c|=32),c+=31-c%31,n.status=f,_(n,c),0!==n.strstart&&(_(n,t.adler>>>16),_(n,65535&t.adler)),t.adler=1}if(69===n.status)if(n.gzhead.extra){for(o=n.pending;n.gzindex<(65535&n.gzhead.extra.length)&&(n.pending!==n.pending_buf_size||(n.gzhead.hcrc&&n.pending>o&&(t.adler=a(t.adler,n.pending_buf,n.pending-o,o)),v(t),o=n.pending,n.pending!==n.pending_buf_size));)w(n,255&n.gzhead.extra[n.gzindex]),n.gzindex++;n.gzhead.hcrc&&n.pending>o&&(t.adler=a(t.adler,n.pending_buf,n.pending-o,o)),n.gzindex===n.gzhead.extra.length&&(n.gzindex=0,n.status=73)}else n.status=73;if(73===n.status)if(n.gzhead.name){o=n.pending;do{if(n.pending===n.pending_buf_size&&(n.gzhead.hcrc&&n.pending>o&&(t.adler=a(t.adler,n.pending_buf,n.pending-o,o)),v(t),o=n.pending,n.pending===n.pending_buf_size)){h=1;break}h=n.gzindexo&&(t.adler=a(t.adler,n.pending_buf,n.pending-o,o)),0===h&&(n.gzindex=0,n.status=91)}else n.status=91;if(91===n.status)if(n.gzhead.comment){o=n.pending;do{if(n.pending===n.pending_buf_size&&(n.gzhead.hcrc&&n.pending>o&&(t.adler=a(t.adler,n.pending_buf,n.pending-o,o)),v(t),o=n.pending,n.pending===n.pending_buf_size)){h=1;break}h=n.gzindexo&&(t.adler=a(t.adler,n.pending_buf,n.pending-o,o)),0===h&&(n.status=d)}else n.status=d;if(n.status===d&&(n.gzhead.hcrc?(n.pending+2>n.pending_buf_size&&v(t),n.pending+2<=n.pending_buf_size&&(w(n,255&t.adler),w(n,t.adler>>8&255),t.adler=0,n.status=f)):n.status=f),0!==n.pending){if(v(t),0===t.avail_out)return n.last_flush=-1,0}else if(0===t.avail_in&&g(e)<=g(i)&&4!==e)return m(t,-5);if(n.status===p&&0!==t.avail_in)return m(t,-5);if(0!==t.avail_in||0!==n.lookahead||0!==e&&n.status!==p){var M=2===n.strategy?function(t,e){for(var i;;){if(0===t.lookahead&&(k(t),0===t.lookahead)){if(0===e)return 1;break}if(t.match_length=0,i=s._tr_tally(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++,i&&(y(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,4===e?(y(t,!0),0===t.strm.avail_out?3:4):t.last_lit&&(y(t,!1),0===t.strm.avail_out)?1:2}(n,e):3===n.strategy?function(t,e){for(var i,r,n,o,a=t.window;;){if(t.lookahead<=l){if(k(t),t.lookahead<=l&&0===e)return 1;if(0===t.lookahead)break}if(t.match_length=0,t.lookahead>=3&&t.strstart>0&&(r=a[n=t.strstart-1])===a[++n]&&r===a[++n]&&r===a[++n]){o=t.strstart+l;do{}while(r===a[++n]&&r===a[++n]&&r===a[++n]&&r===a[++n]&&r===a[++n]&&r===a[++n]&&r===a[++n]&&r===a[++n]&&nt.lookahead&&(t.match_length=t.lookahead)}if(t.match_length>=3?(i=s._tr_tally(t,1,t.match_length-3),t.lookahead-=t.match_length,t.strstart+=t.match_length,t.match_length=0):(i=s._tr_tally(t,0,t.window[t.strstart]),t.lookahead--,t.strstart++),i&&(y(t,!1),0===t.strm.avail_out))return 1}return t.insert=0,4===e?(y(t,!0),0===t.strm.avail_out?3:4):t.last_lit&&(y(t,!1),0===t.strm.avail_out)?1:2}(n,e):r[n.level].func(n,e);if(3!==M&&4!==M||(n.status=p),1===M||3===M)return 0===t.avail_out&&(n.last_flush=-1),0;if(2===M&&(1===e?s._tr_align(n):5!==e&&(s._tr_stored_block(n,0,0,!1),3===e&&(b(n.head),0===n.lookahead&&(n.strstart=0,n.block_start=0,n.insert=0))),v(t),0===t.avail_out))return n.last_flush=-1,0}return 4!==e?0:n.wrap<=0?1:(2===n.wrap?(w(n,255&t.adler),w(n,t.adler>>8&255),w(n,t.adler>>16&255),w(n,t.adler>>24&255),w(n,255&t.total_in),w(n,t.total_in>>8&255),w(n,t.total_in>>16&255),w(n,t.total_in>>24&255)):(_(n,t.adler>>>16),_(n,65535&t.adler)),v(t),n.wrap>0&&(n.wrap=-n.wrap),0!==n.pending?0:1)},e.deflateEnd=function(t){var e;return t&&t.state?42!==(e=t.state.status)&&69!==e&&73!==e&&91!==e&&e!==d&&e!==f&&e!==p?m(t,u):(t.state=null,e===f?m(t,-3):0):u},e.deflateSetDictionary=function(t,e){var i,r,s,a,h,l,c,d,f=e.length;if(!t||!t.state)return u;if(2===(a=(i=t.state).wrap)||1===a&&42!==i.status||i.lookahead)return u;for(1===a&&(t.adler=o(t.adler,e,f,0)),i.wrap=0,f>=i.w_size&&(0===a&&(b(i.head),i.strstart=0,i.block_start=0,i.insert=0),d=new n.Buf8(i.w_size),n.arraySet(d,e,f-i.w_size,i.w_size,0),e=d,f=i.w_size),h=t.avail_in,l=t.next_in,c=t.input,t.avail_in=f,t.next_in=0,t.input=e,k(i);i.lookahead>=3;){r=i.strstart,s=i.lookahead-2;do{i.ins_h=(i.ins_h<{"use strict";t.exports=function(t,e){var i,r,n,s,o,a,h,u,l,c,d,f,p,m,g,b,v,y,w,_,M,k,x,E,S;i=t.state,r=t.next_in,E=t.input,n=r+(t.avail_in-5),s=t.next_out,S=t.output,o=s-(e-t.avail_out),a=s+(t.avail_out-257),h=i.dmax,u=i.wsize,l=i.whave,c=i.wnext,d=i.window,f=i.hold,p=i.bits,m=i.lencode,g=i.distcode,b=(1<>>=w=y>>>24,p-=w,0==(w=y>>>16&255))S[s++]=65535&y;else{if(!(16&w)){if(0==(64&w)){y=m[(65535&y)+(f&(1<>>=w,p-=w),p<15&&(f+=E[r++]<>>=w=y>>>24,p-=w,!(16&(w=y>>>16&255))){if(0==(64&w)){y=g[(65535&y)+(f&(1<h){t.msg="invalid distance too far back",i.mode=30;break t}if(f>>>=w,p-=w,M>(w=s-o)){if((w=M-w)>l&&i.sane){t.msg="invalid distance too far back",i.mode=30;break t}if(k=0,x=d,0===c){if(k+=u-w,w<_){_-=w;do{S[s++]=d[k++]}while(--w);k=s-M,x=S}}else if(c2;)S[s++]=x[k++],S[s++]=x[k++],S[s++]=x[k++],_-=3;_&&(S[s++]=x[k++],_>1&&(S[s++]=x[k++]))}else{k=s-M;do{S[s++]=S[k++],S[s++]=S[k++],S[s++]=S[k++],_-=3}while(_>2);_&&(S[s++]=S[k++],_>1&&(S[s++]=S[k++]))}break}}break}}while(r>3,f&=(1<<(p-=_<<3))-1,t.next_in=r,t.next_out=s,t.avail_in=r{"use strict";var r=i(4236),n=i(6069),s=i(2869),o=i(3318),a=i(9241),h=-2,u=12,l=30;function c(t){return(t>>>24&255)+(t>>>8&65280)+((65280&t)<<8)+((255&t)<<24)}function d(){this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new r.Buf16(320),this.work=new r.Buf16(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0}function f(t){var e;return t&&t.state?(e=t.state,t.total_in=t.total_out=e.total=0,t.msg="",e.wrap&&(t.adler=1&e.wrap),e.mode=1,e.last=0,e.havedict=0,e.dmax=32768,e.head=null,e.hold=0,e.bits=0,e.lencode=e.lendyn=new r.Buf32(852),e.distcode=e.distdyn=new r.Buf32(592),e.sane=1,e.back=-1,0):h}function p(t){var e;return t&&t.state?((e=t.state).wsize=0,e.whave=0,e.wnext=0,f(t)):h}function m(t,e){var i,r;return t&&t.state?(r=t.state,e<0?(i=0,e=-e):(i=1+(e>>4),e<48&&(e&=15)),e&&(e<8||e>15)?h:(null!==r.window&&r.wbits!==e&&(r.window=null),r.wrap=i,r.wbits=e,p(t))):h}function g(t,e){var i,r;return t?(r=new d,t.state=r,r.window=null,0!==(i=m(t,e))&&(t.state=null),i):h}var b,v,y=!0;function w(t){if(y){var e;for(b=new r.Buf32(512),v=new r.Buf32(32),e=0;e<144;)t.lens[e++]=8;for(;e<256;)t.lens[e++]=9;for(;e<280;)t.lens[e++]=7;for(;e<288;)t.lens[e++]=8;for(a(1,t.lens,0,288,b,0,t.work,{bits:9}),e=0;e<32;)t.lens[e++]=5;a(2,t.lens,0,32,v,0,t.work,{bits:5}),y=!1}t.lencode=b,t.lenbits=9,t.distcode=v,t.distbits=5}function _(t,e,i,n){var s,o=t.state;return null===o.window&&(o.wsize=1<=o.wsize?(r.arraySet(o.window,e,i-o.wsize,o.wsize,0),o.wnext=0,o.whave=o.wsize):((s=o.wsize-o.wnext)>n&&(s=n),r.arraySet(o.window,e,i-n,s,o.wnext),(n-=s)?(r.arraySet(o.window,e,i-n,n,0),o.wnext=n,o.whave=o.wsize):(o.wnext+=s,o.wnext===o.wsize&&(o.wnext=0),o.whave>>8&255,i.check=s(i.check,j,2,0),v=0,y=0,i.mode=2;break}if(i.flags=0,i.head&&(i.head.done=!1),!(1&i.wrap)||(((255&v)<<8)+(v>>8))%31){t.msg="incorrect header check",i.mode=l;break}if(8!=(15&v)){t.msg="unknown compression method",i.mode=l;break}if(y-=4,P=8+(15&(v>>>=4)),0===i.wbits)i.wbits=P;else if(P>i.wbits){t.msg="invalid window size",i.mode=l;break}i.dmax=1<>8&1),512&i.flags&&(j[0]=255&v,j[1]=v>>>8&255,i.check=s(i.check,j,2,0)),v=0,y=0,i.mode=3;case 3:for(;y<32;){if(0===g)break t;g--,v+=d[p++]<>>8&255,j[2]=v>>>16&255,j[3]=v>>>24&255,i.check=s(i.check,j,4,0)),v=0,y=0,i.mode=4;case 4:for(;y<16;){if(0===g)break t;g--,v+=d[p++]<>8),512&i.flags&&(j[0]=255&v,j[1]=v>>>8&255,i.check=s(i.check,j,2,0)),v=0,y=0,i.mode=5;case 5:if(1024&i.flags){for(;y<16;){if(0===g)break t;g--,v+=d[p++]<>>8&255,i.check=s(i.check,j,2,0)),v=0,y=0}else i.head&&(i.head.extra=null);i.mode=6;case 6:if(1024&i.flags&&((x=i.length)>g&&(x=g),x&&(i.head&&(P=i.head.extra_len-i.length,i.head.extra||(i.head.extra=new Array(i.head.extra_len)),r.arraySet(i.head.extra,d,p,x,P)),512&i.flags&&(i.check=s(i.check,d,x,p)),g-=x,p+=x,i.length-=x),i.length))break t;i.length=0,i.mode=7;case 7:if(2048&i.flags){if(0===g)break t;x=0;do{P=d[p+x++],i.head&&P&&i.length<65536&&(i.head.name+=String.fromCharCode(P))}while(P&&x>9&1,i.head.done=!0),t.adler=i.check=0,i.mode=u;break;case 10:for(;y<32;){if(0===g)break t;g--,v+=d[p++]<>>=7&y,y-=7&y,i.mode=27;break}for(;y<3;){if(0===g)break t;g--,v+=d[p++]<>>=1)){case 0:i.mode=14;break;case 1:if(w(i),i.mode=20,6===e){v>>>=2,y-=2;break t}break;case 2:i.mode=17;break;case 3:t.msg="invalid block type",i.mode=l}v>>>=2,y-=2;break;case 14:for(v>>>=7&y,y-=7&y;y<32;){if(0===g)break t;g--,v+=d[p++]<>>16^65535)){t.msg="invalid stored block lengths",i.mode=l;break}if(i.length=65535&v,v=0,y=0,i.mode=15,6===e)break t;case 15:i.mode=16;case 16:if(x=i.length){if(x>g&&(x=g),x>b&&(x=b),0===x)break t;r.arraySet(f,d,p,x,m),g-=x,p+=x,b-=x,m+=x,i.length-=x;break}i.mode=u;break;case 17:for(;y<14;){if(0===g)break t;g--,v+=d[p++]<>>=5,y-=5,i.ndist=1+(31&v),v>>>=5,y-=5,i.ncode=4+(15&v),v>>>=4,y-=4,i.nlen>286||i.ndist>30){t.msg="too many length or distance symbols",i.mode=l;break}i.have=0,i.mode=18;case 18:for(;i.have>>=3,y-=3}for(;i.have<19;)i.lens[U[i.have++]]=0;if(i.lencode=i.lendyn,i.lenbits=7,O={bits:i.lenbits},L=a(0,i.lens,0,19,i.lencode,0,i.work,O),i.lenbits=O.bits,L){t.msg="invalid code lengths set",i.mode=l;break}i.have=0,i.mode=19;case 19:for(;i.have>>16&255,I=65535&N,!((T=N>>>24)<=y);){if(0===g)break t;g--,v+=d[p++]<>>=T,y-=T,i.lens[i.have++]=I;else{if(16===I){for(D=T+2;y>>=T,y-=T,0===i.have){t.msg="invalid bit length repeat",i.mode=l;break}P=i.lens[i.have-1],x=3+(3&v),v>>>=2,y-=2}else if(17===I){for(D=T+3;y>>=T)),v>>>=3,y-=3}else{for(D=T+7;y>>=T)),v>>>=7,y-=7}if(i.have+x>i.nlen+i.ndist){t.msg="invalid bit length repeat",i.mode=l;break}for(;x--;)i.lens[i.have++]=P}}if(i.mode===l)break;if(0===i.lens[256]){t.msg="invalid code -- missing end-of-block",i.mode=l;break}if(i.lenbits=9,O={bits:i.lenbits},L=a(1,i.lens,0,i.nlen,i.lencode,0,i.work,O),i.lenbits=O.bits,L){t.msg="invalid literal/lengths set",i.mode=l;break}if(i.distbits=6,i.distcode=i.distdyn,O={bits:i.distbits},L=a(2,i.lens,i.nlen,i.ndist,i.distcode,0,i.work,O),i.distbits=O.bits,L){t.msg="invalid distances set",i.mode=l;break}if(i.mode=20,6===e)break t;case 20:i.mode=21;case 21:if(g>=6&&b>=258){t.next_out=m,t.avail_out=b,t.next_in=p,t.avail_in=g,i.hold=v,i.bits=y,o(t,k),m=t.next_out,f=t.output,b=t.avail_out,p=t.next_in,d=t.input,g=t.avail_in,v=i.hold,y=i.bits,i.mode===u&&(i.back=-1);break}for(i.back=0;A=(N=i.lencode[v&(1<>>16&255,I=65535&N,!((T=N>>>24)<=y);){if(0===g)break t;g--,v+=d[p++]<>C)])>>>16&255,I=65535&N,!(C+(T=N>>>24)<=y);){if(0===g)break t;g--,v+=d[p++]<>>=C,y-=C,i.back+=C}if(v>>>=T,y-=T,i.back+=T,i.length=I,0===A){i.mode=26;break}if(32&A){i.back=-1,i.mode=u;break}if(64&A){t.msg="invalid literal/length code",i.mode=l;break}i.extra=15&A,i.mode=22;case 22:if(i.extra){for(D=i.extra;y>>=i.extra,y-=i.extra,i.back+=i.extra}i.was=i.length,i.mode=23;case 23:for(;A=(N=i.distcode[v&(1<>>16&255,I=65535&N,!((T=N>>>24)<=y);){if(0===g)break t;g--,v+=d[p++]<>C)])>>>16&255,I=65535&N,!(C+(T=N>>>24)<=y);){if(0===g)break t;g--,v+=d[p++]<>>=C,y-=C,i.back+=C}if(v>>>=T,y-=T,i.back+=T,64&A){t.msg="invalid distance code",i.mode=l;break}i.offset=I,i.extra=15&A,i.mode=24;case 24:if(i.extra){for(D=i.extra;y>>=i.extra,y-=i.extra,i.back+=i.extra}if(i.offset>i.dmax){t.msg="invalid distance too far back",i.mode=l;break}i.mode=25;case 25:if(0===b)break t;if(x=k-b,i.offset>x){if((x=i.offset-x)>i.whave&&i.sane){t.msg="invalid distance too far back",i.mode=l;break}x>i.wnext?(x-=i.wnext,E=i.wsize-x):E=i.wnext-x,x>i.length&&(x=i.length),S=i.window}else S=f,E=m-i.offset,x=i.length;x>b&&(x=b),b-=x,i.length-=x;do{f[m++]=S[E++]}while(--x);0===i.length&&(i.mode=21);break;case 26:if(0===b)break t;f[m++]=i.length,b--,i.mode=21;break;case 27:if(i.wrap){for(;y<32;){if(0===g)break t;g--,v|=d[p++]<{"use strict";var r=i(4236),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],s=[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],o=[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],a=[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];t.exports=function(t,e,i,h,u,l,c,d){var f,p,m,g,b,v,y,w,_,M=d.bits,k=0,x=0,E=0,S=0,T=0,A=0,I=0,C=0,B=0,R=0,P=null,L=0,O=new r.Buf16(16),D=new r.Buf16(16),N=null,j=0;for(k=0;k<=15;k++)O[k]=0;for(x=0;x=1&&0===O[S];S--);if(T>S&&(T=S),0===S)return u[l++]=20971520,u[l++]=20971520,d.bits=1,0;for(E=1;E0&&(0===t||1!==S))return-1;for(D[1]=0,k=1;k<15;k++)D[k+1]=D[k]+O[k];for(x=0;x852||2===t&&B>592)return 1;for(;;){y=k-I,c[x]v?(w=N[j+c[x]],_=P[L+c[x]]):(w=96,_=0),f=1<>I)+(p-=f)]=y<<24|w<<16|_|0}while(0!==p);for(f=1<>=1;if(0!==f?(R&=f-1,R+=f):R=0,x++,0==--O[k]){if(k===S)break;k=e[i+c[x]]}if(k>T&&(R&g)!==m){for(0===I&&(I=T),b+=E,C=1<<(A=k-I);A+I852||2===t&&B>592)return 1;u[m=R&g]=T<<24|A<<16|b-l|0}}return 0!==R&&(u[b+R]=k-I<<24|64<<16|0),d.bits=T,0}},8898:t=>{"use strict";t.exports={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"}},342:(t,e,i)=>{"use strict";var r=i(4236);function n(t){for(var e=t.length;--e>=0;)t[e]=0}var s=[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],o=[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],a=[0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7],h=[16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15],u=new Array(576);n(u);var l=new Array(60);n(l);var c=new Array(512);n(c);var d=new Array(256);n(d);var f=new Array(29);n(f);var p,m,g,b=new Array(30);function v(t,e,i,r,n){this.static_tree=t,this.extra_bits=e,this.extra_base=i,this.elems=r,this.max_length=n,this.has_stree=t&&t.length}function y(t,e){this.dyn_tree=t,this.max_code=0,this.stat_desc=e}function w(t){return t<256?c[t]:c[256+(t>>>7)]}function _(t,e){t.pending_buf[t.pending++]=255&e,t.pending_buf[t.pending++]=e>>>8&255}function M(t,e,i){t.bi_valid>16-i?(t.bi_buf|=e<>16-t.bi_valid,t.bi_valid+=i-16):(t.bi_buf|=e<>>=1,i<<=1}while(--e>0);return i>>>1}function E(t,e,i){var r,n,s=new Array(16),o=0;for(r=1;r<=15;r++)s[r]=o=o+i[r-1]<<1;for(n=0;n<=e;n++){var a=t[2*n+1];0!==a&&(t[2*n]=x(s[a]++,a))}}function S(t){var e;for(e=0;e<286;e++)t.dyn_ltree[2*e]=0;for(e=0;e<30;e++)t.dyn_dtree[2*e]=0;for(e=0;e<19;e++)t.bl_tree[2*e]=0;t.dyn_ltree[512]=1,t.opt_len=t.static_len=0,t.last_lit=t.matches=0}function T(t){t.bi_valid>8?_(t,t.bi_buf):t.bi_valid>0&&(t.pending_buf[t.pending++]=t.bi_buf),t.bi_buf=0,t.bi_valid=0}function A(t,e,i,r){var n=2*e,s=2*i;return t[n]>1;i>=1;i--)I(t,s,i);n=h;do{i=t.heap[1],t.heap[1]=t.heap[t.heap_len--],I(t,s,1),r=t.heap[1],t.heap[--t.heap_max]=i,t.heap[--t.heap_max]=r,s[2*n]=s[2*i]+s[2*r],t.depth[n]=(t.depth[i]>=t.depth[r]?t.depth[i]:t.depth[r])+1,s[2*i+1]=s[2*r+1]=n,t.heap[1]=n++,I(t,s,1)}while(t.heap_len>=2);t.heap[--t.heap_max]=t.heap[1],function(t,e){var i,r,n,s,o,a,h=e.dyn_tree,u=e.max_code,l=e.stat_desc.static_tree,c=e.stat_desc.has_stree,d=e.stat_desc.extra_bits,f=e.stat_desc.extra_base,p=e.stat_desc.max_length,m=0;for(s=0;s<=15;s++)t.bl_count[s]=0;for(h[2*t.heap[t.heap_max]+1]=0,i=t.heap_max+1;i<573;i++)(s=h[2*h[2*(r=t.heap[i])+1]+1]+1)>p&&(s=p,m++),h[2*r+1]=s,r>u||(t.bl_count[s]++,o=0,r>=f&&(o=d[r-f]),a=h[2*r],t.opt_len+=a*(s+o),c&&(t.static_len+=a*(l[2*r+1]+o)));if(0!==m){do{for(s=p-1;0===t.bl_count[s];)s--;t.bl_count[s]--,t.bl_count[s+1]+=2,t.bl_count[p]--,m-=2}while(m>0);for(s=p;0!==s;s--)for(r=t.bl_count[s];0!==r;)(n=t.heap[--i])>u||(h[2*n+1]!==s&&(t.opt_len+=(s-h[2*n+1])*h[2*n],h[2*n+1]=s),r--)}}(t,e),E(s,u,t.bl_count)}function R(t,e,i){var r,n,s=-1,o=e[1],a=0,h=7,u=4;for(0===o&&(h=138,u=3),e[2*(i+1)+1]=65535,r=0;r<=i;r++)n=o,o=e[2*(r+1)+1],++a>=7;r<30;r++)for(b[r]=n<<7,t=0;t<1<0?(2===t.strm.data_type&&(t.strm.data_type=function(t){var e,i=4093624447;for(e=0;e<=31;e++,i>>>=1)if(1&i&&0!==t.dyn_ltree[2*e])return 0;if(0!==t.dyn_ltree[18]||0!==t.dyn_ltree[20]||0!==t.dyn_ltree[26])return 1;for(e=32;e<256;e++)if(0!==t.dyn_ltree[2*e])return 1;return 0}(t)),B(t,t.l_desc),B(t,t.d_desc),o=function(t){var e;for(R(t,t.dyn_ltree,t.l_desc.max_code),R(t,t.dyn_dtree,t.d_desc.max_code),B(t,t.bl_desc),e=18;e>=3&&0===t.bl_tree[2*h[e]+1];e--);return t.opt_len+=3*(e+1)+5+5+4,e}(t),n=t.opt_len+3+7>>>3,(s=t.static_len+3+7>>>3)<=n&&(n=s)):n=s=i+5,i+4<=n&&-1!==e?O(t,e,i,r):4===t.strategy||s===n?(M(t,2+(r?1:0),3),C(t,u,l)):(M(t,4+(r?1:0),3),function(t,e,i,r){var n;for(M(t,e-257,5),M(t,i-1,5),M(t,r-4,4),n=0;n>>8&255,t.pending_buf[t.d_buf+2*t.last_lit+1]=255&e,t.pending_buf[t.l_buf+t.last_lit]=255&i,t.last_lit++,0===e?t.dyn_ltree[2*i]++:(t.matches++,e--,t.dyn_ltree[2*(d[i]+256+1)]++,t.dyn_dtree[2*w(e)]++),t.last_lit===t.lit_bufsize-1},e._tr_align=function(t){M(t,2,3),k(t,256,u),function(t){16===t.bi_valid?(_(t,t.bi_buf),t.bi_buf=0,t.bi_valid=0):t.bi_valid>=8&&(t.pending_buf[t.pending++]=255&t.bi_buf,t.bi_buf>>=8,t.bi_valid-=8)}(t)}},2292:t=>{"use strict";t.exports=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0}},2818:(t,e,i)=>{"use strict";var r=i(9809);e.certificate=i(1934);var n=r.define("RSAPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("modulus").int(),this.key("publicExponent").int(),this.key("privateExponent").int(),this.key("prime1").int(),this.key("prime2").int(),this.key("exponent1").int(),this.key("exponent2").int(),this.key("coefficient").int())}));e.RSAPrivateKey=n;var s=r.define("RSAPublicKey",(function(){this.seq().obj(this.key("modulus").int(),this.key("publicExponent").int())}));e.RSAPublicKey=s;var o=r.define("SubjectPublicKeyInfo",(function(){this.seq().obj(this.key("algorithm").use(a),this.key("subjectPublicKey").bitstr())}));e.PublicKey=o;var a=r.define("AlgorithmIdentifier",(function(){this.seq().obj(this.key("algorithm").objid(),this.key("none").null_().optional(),this.key("curve").objid().optional(),this.key("params").seq().obj(this.key("p").int(),this.key("q").int(),this.key("g").int()).optional())})),h=r.define("PrivateKeyInfo",(function(){this.seq().obj(this.key("version").int(),this.key("algorithm").use(a),this.key("subjectPrivateKey").octstr())}));e.PrivateKey=h;var u=r.define("EncryptedPrivateKeyInfo",(function(){this.seq().obj(this.key("algorithm").seq().obj(this.key("id").objid(),this.key("decrypt").seq().obj(this.key("kde").seq().obj(this.key("id").objid(),this.key("kdeparams").seq().obj(this.key("salt").octstr(),this.key("iters").int())),this.key("cipher").seq().obj(this.key("algo").objid(),this.key("iv").octstr()))),this.key("subjectPrivateKey").octstr())}));e.EncryptedPrivateKey=u;var l=r.define("DSAPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("p").int(),this.key("q").int(),this.key("g").int(),this.key("pub_key").int(),this.key("priv_key").int())}));e.DSAPrivateKey=l,e.DSAparam=r.define("DSAparam",(function(){this.int()}));var c=r.define("ECPrivateKey",(function(){this.seq().obj(this.key("version").int(),this.key("privateKey").octstr(),this.key("parameters").optional().explicit(0).use(d),this.key("publicKey").optional().explicit(1).bitstr())}));e.ECPrivateKey=c;var d=r.define("ECParameters",(function(){this.choice({namedCurve:this.objid()})}));e.signature=r.define("signature",(function(){this.seq().obj(this.key("r").int(),this.key("s").int())}))},1934:(t,e,i)=>{"use strict";var r=i(9809),n=r.define("Time",(function(){this.choice({utcTime:this.utctime(),generalTime:this.gentime()})})),s=r.define("AttributeTypeValue",(function(){this.seq().obj(this.key("type").objid(),this.key("value").any())})),o=r.define("AlgorithmIdentifier",(function(){this.seq().obj(this.key("algorithm").objid(),this.key("parameters").optional(),this.key("curve").objid().optional())})),a=r.define("SubjectPublicKeyInfo",(function(){this.seq().obj(this.key("algorithm").use(o),this.key("subjectPublicKey").bitstr())})),h=r.define("RelativeDistinguishedName",(function(){this.setof(s)})),u=r.define("RDNSequence",(function(){this.seqof(h)})),l=r.define("Name",(function(){this.choice({rdnSequence:this.use(u)})})),c=r.define("Validity",(function(){this.seq().obj(this.key("notBefore").use(n),this.key("notAfter").use(n))})),d=r.define("Extension",(function(){this.seq().obj(this.key("extnID").objid(),this.key("critical").bool().def(!1),this.key("extnValue").octstr())})),f=r.define("TBSCertificate",(function(){this.seq().obj(this.key("version").explicit(0).int().optional(),this.key("serialNumber").int(),this.key("signature").use(o),this.key("issuer").use(l),this.key("validity").use(c),this.key("subject").use(l),this.key("subjectPublicKeyInfo").use(a),this.key("issuerUniqueID").implicit(1).bitstr().optional(),this.key("subjectUniqueID").implicit(2).bitstr().optional(),this.key("extensions").explicit(3).seqof(d).optional())})),p=r.define("X509Certificate",(function(){this.seq().obj(this.key("tbsCertificate").use(f),this.key("signatureAlgorithm").use(o),this.key("signatureValue").bitstr())}));t.exports=p},7631:(t,e,i)=>{var r=/Proc-Type: 4,ENCRYPTED[\n\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\n\r]+([0-9A-z\n\r+/=]+)[\n\r]+/m,n=/^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m,s=/^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\n\r+/=]+)-----END \1-----$/m,o=i(3048),a=i(4696),h=i(9509).Buffer;t.exports=function(t,e){var i,u=t.toString(),l=u.match(r);if(l){var c="aes"+l[1],d=h.from(l[2],"hex"),f=h.from(l[3].replace(/[\r\n]/g,""),"base64"),p=o(e,d.slice(0,8),parseInt(l[1],10)).key,m=[],g=a.createDecipheriv(c,p,d);m.push(g.update(f)),m.push(g.final()),i=h.concat(m)}else{var b=u.match(s);i=h.from(b[2].replace(/[\r\n]/g,""),"base64")}return{tag:u.match(n)[1],data:i}}},980:(t,e,i)=>{var r=i(2818),n=i(2562),s=i(7631),o=i(4696),a=i(5632),h=i(9509).Buffer;function u(t){var e;"object"!=typeof t||h.isBuffer(t)||(e=t.passphrase,t=t.key),"string"==typeof t&&(t=h.from(t));var i,u,l=s(t,e),c=l.tag,d=l.data;switch(c){case"CERTIFICATE":u=r.certificate.decode(d,"der").tbsCertificate.subjectPublicKeyInfo;case"PUBLIC KEY":switch(u||(u=r.PublicKey.decode(d,"der")),i=u.algorithm.algorithm.join(".")){case"1.2.840.113549.1.1.1":return r.RSAPublicKey.decode(u.subjectPublicKey.data,"der");case"1.2.840.10045.2.1":return u.subjectPrivateKey=u.subjectPublicKey,{type:"ec",data:u};case"1.2.840.10040.4.1":return u.algorithm.params.pub_key=r.DSAparam.decode(u.subjectPublicKey.data,"der"),{type:"dsa",data:u.algorithm.params};default:throw new Error("unknown key id "+i)}case"ENCRYPTED PRIVATE KEY":d=function(t,e){var i=t.algorithm.decrypt.kde.kdeparams.salt,r=parseInt(t.algorithm.decrypt.kde.kdeparams.iters.toString(),10),s=n[t.algorithm.decrypt.cipher.algo.join(".")],u=t.algorithm.decrypt.cipher.iv,l=t.subjectPrivateKey,c=parseInt(s.split("-")[1],10)/8,d=a.pbkdf2Sync(e,i,r,c,"sha1"),f=o.createDecipheriv(s,d,u),p=[];return p.push(f.update(l)),p.push(f.final()),h.concat(p)}(d=r.EncryptedPrivateKey.decode(d,"der"),e);case"PRIVATE KEY":switch(i=(u=r.PrivateKey.decode(d,"der")).algorithm.algorithm.join(".")){case"1.2.840.113549.1.1.1":return r.RSAPrivateKey.decode(u.subjectPrivateKey,"der");case"1.2.840.10045.2.1":return{curve:u.algorithm.curve,privateKey:r.ECPrivateKey.decode(u.subjectPrivateKey,"der").privateKey};case"1.2.840.10040.4.1":return u.algorithm.params.priv_key=r.DSAparam.decode(u.subjectPrivateKey,"der"),{type:"dsa",params:u.algorithm.params};default:throw new Error("unknown key id "+i)}case"RSA PUBLIC KEY":return r.RSAPublicKey.decode(d,"der");case"RSA PRIVATE KEY":return r.RSAPrivateKey.decode(d,"der");case"DSA PRIVATE KEY":return{type:"dsa",params:r.DSAPrivateKey.decode(d,"der")};case"EC PRIVATE KEY":return{curve:(d=r.ECPrivateKey.decode(d,"der")).parameters.value,privateKey:d.privateKey};default:throw new Error("unknown key type "+c)}}t.exports=u,u.signature=r.signature},5203:(t,e,i)=>{var r=i(8764).Buffer;const n=i(5799),s=i(7619),o=i(1982),a=i(6993),h=i(9566),u=i(6470),l=i(4159),c=i(4375);function d(t){if("string"==typeof t&&/^(stream-)?magnet:/.test(t)){const e=h(t);if(!e.infoHash)throw new Error("Invalid torrent identifier");return e}if("string"==typeof t&&(/^[a-f0-9]{40}$/i.test(t)||/^[a-z2-7]{32}$/i.test(t)))return h(`magnet:?xt=urn:btih:${t}`);if(r.isBuffer(t)&&20===t.length)return h(`magnet:?xt=urn:btih:${t.toString("hex")}`);if(r.isBuffer(t))return function(t){r.isBuffer(t)&&(t=n.decode(t)),p(t.info,"info"),p(t.info["name.utf-8"]||t.info.name,"info.name"),p(t.info["piece length"],"info['piece length']"),p(t.info.pieces,"info.pieces"),t.info.files?t.info.files.forEach((t=>{p("number"==typeof t.length,"info.files[0].length"),p(t["path.utf-8"]||t.path,"info.files[0].path")})):p("number"==typeof t.info.length,"info.length");const e={info:t.info,infoBuffer:n.encode(t.info),name:(t.info["name.utf-8"]||t.info.name).toString(),announce:[]};e.infoHash=l.sync(e.infoBuffer),e.infoHashBuffer=r.from(e.infoHash,"hex"),void 0!==t.info.private&&(e.private=!!t.info.private),t["creation date"]&&(e.created=new Date(1e3*t["creation date"])),t["created by"]&&(e.createdBy=t["created by"].toString()),r.isBuffer(t.comment)&&(e.comment=t.comment.toString()),Array.isArray(t["announce-list"])&&t["announce-list"].length>0?t["announce-list"].forEach((t=>{t.forEach((t=>{e.announce.push(t.toString())}))})):t.announce&&e.announce.push(t.announce.toString()),r.isBuffer(t["url-list"])&&(t["url-list"]=t["url-list"].length>0?[t["url-list"]]:[]),e.urlList=(t["url-list"]||[]).map((t=>t.toString())),e.announce=Array.from(new Set(e.announce)),e.urlList=Array.from(new Set(e.urlList));const i=t.info.files||[t.info];e.files=i.map(((t,r)=>{const n=[].concat(e.name,t["path.utf-8"]||t.path||[]).map((t=>t.toString()));return{path:u.join.apply(null,[u.sep].concat(n)).slice(1),name:n[n.length-1],length:t.length,offset:i.slice(0,r).reduce(f,0)}})),e.length=i.reduce(f,0);const s=e.files[e.files.length-1];return e.pieceLength=t.info["piece length"],e.lastPieceLength=(s.offset+s.length)%e.pieceLength||e.pieceLength,e.pieces=function(t){const e=[];for(let i=0;i{r(null,n)})):"undefined"!=typeof Blob&&e instanceof Blob?s(e,((t,e)=>{if(t)return r(new Error(`Error converting Blob: ${t.message}`));h(e)})):"function"==typeof a&&/^https?:/.test(e)?(i=Object.assign({url:e,timeout:3e4,headers:{"user-agent":"WebTorrent (https://webtorrent.io)"}},i),a.concat(i,((t,e,i)=>{if(t)return r(new Error(`Error downloading torrent: ${t.message}`));h(i)}))):"function"==typeof o.readFile&&"string"==typeof e?o.readFile(e,((t,e)=>{if(t)return r(new Error("Invalid torrent identifier"));h(e)})):c((()=>{r(new Error("Invalid torrent identifier"))}))},t.exports.toMagnetURI=h.encode,t.exports.toTorrentFile=function(t){const e={info:t.info};return e["announce-list"]=(t.announce||[]).map((t=>(e.announce||(e.announce=t),[t=r.from(t,"utf8")]))),e["url-list"]=t.urlList||[],void 0!==t.private&&(e.private=Number(t.private)),t.created&&(e["creation date"]=t.created.getTime()/1e3|0),t.createdBy&&(e["created by"]=t.createdBy),t.comment&&(e.comment=t.comment),n.encode(e)},r.alloc(0)},6470:(t,e,i)=>{"use strict";var r=i(9590);function n(t){if("string"!=typeof t)throw new TypeError("Path must be a string. Received "+JSON.stringify(t))}function s(t,e){for(var i,r="",n=0,s=-1,o=0,a=0;a<=t.length;++a){if(a2){var h=r.lastIndexOf("/");if(h!==r.length-1){-1===h?(r="",n=0):n=(r=r.slice(0,h)).length-1-r.lastIndexOf("/"),s=a,o=0;continue}}else if(2===r.length||1===r.length){r="",n=0,s=a,o=0;continue}e&&(r.length>0?r+="/..":r="..",n=2)}else r.length>0?r+="/"+t.slice(s+1,a):r=t.slice(s+1,a),n=a-s-1;s=a,o=0}else 46===i&&-1!==o?++o:o=-1}return r}var o={resolve:function(){for(var t,e="",i=!1,o=arguments.length-1;o>=-1&&!i;o--){var a;o>=0?a=arguments[o]:(void 0===t&&(t=r.cwd()),a=t),n(a),0!==a.length&&(e=a+"/"+e,i=47===a.charCodeAt(0))}return e=s(e,!i),i?e.length>0?"/"+e:"/":e.length>0?e:"."},normalize:function(t){if(n(t),0===t.length)return".";var e=47===t.charCodeAt(0),i=47===t.charCodeAt(t.length-1);return 0!==(t=s(t,!e)).length||e||(t="."),t.length>0&&i&&(t+="/"),e?"/"+t:t},isAbsolute:function(t){return n(t),t.length>0&&47===t.charCodeAt(0)},join:function(){if(0===arguments.length)return".";for(var t,e=0;e0&&(void 0===t?t=i:t+="/"+i)}return void 0===t?".":o.normalize(t)},relative:function(t,e){if(n(t),n(e),t===e)return"";if((t=o.resolve(t))===(e=o.resolve(e)))return"";for(var i=1;iu){if(47===e.charCodeAt(a+c))return e.slice(a+c+1);if(0===c)return e.slice(a+c)}else s>u&&(47===t.charCodeAt(i+c)?l=c:0===c&&(l=0));break}var d=t.charCodeAt(i+c);if(d!==e.charCodeAt(a+c))break;47===d&&(l=c)}var f="";for(c=i+l+1;c<=r;++c)c!==r&&47!==t.charCodeAt(c)||(0===f.length?f+="..":f+="/..");return f.length>0?f+e.slice(a+l):(a+=l,47===e.charCodeAt(a)&&++a,e.slice(a))},_makeLong:function(t){return t},dirname:function(t){if(n(t),0===t.length)return".";for(var e=t.charCodeAt(0),i=47===e,r=-1,s=!0,o=t.length-1;o>=1;--o)if(47===(e=t.charCodeAt(o))){if(!s){r=o;break}}else s=!1;return-1===r?i?"/":".":i&&1===r?"//":t.slice(0,r)},basename:function(t,e){if(void 0!==e&&"string"!=typeof e)throw new TypeError('"ext" argument must be a string');n(t);var i,r=0,s=-1,o=!0;if(void 0!==e&&e.length>0&&e.length<=t.length){if(e.length===t.length&&e===t)return"";var a=e.length-1,h=-1;for(i=t.length-1;i>=0;--i){var u=t.charCodeAt(i);if(47===u){if(!o){r=i+1;break}}else-1===h&&(o=!1,h=i+1),a>=0&&(u===e.charCodeAt(a)?-1==--a&&(s=i):(a=-1,s=h))}return r===s?s=h:-1===s&&(s=t.length),t.slice(r,s)}for(i=t.length-1;i>=0;--i)if(47===t.charCodeAt(i)){if(!o){r=i+1;break}}else-1===s&&(o=!1,s=i+1);return-1===s?"":t.slice(r,s)},extname:function(t){n(t);for(var e=-1,i=0,r=-1,s=!0,o=0,a=t.length-1;a>=0;--a){var h=t.charCodeAt(a);if(47!==h)-1===r&&(s=!1,r=a+1),46===h?-1===e?e=a:1!==o&&(o=1):-1!==e&&(o=-1);else if(!s){i=a+1;break}}return-1===e||-1===r||0===o||1===o&&e===r-1&&e===i+1?"":t.slice(e,r)},format:function(t){if(null===t||"object"!=typeof t)throw new TypeError('The "pathObject" argument must be of type Object. Received type '+typeof t);return function(t,e){var i=e.dir||e.root,r=e.base||(e.name||"")+(e.ext||"");return i?i===e.root?i+r:i+"/"+r:r}(0,t)},parse:function(t){n(t);var e={root:"",dir:"",base:"",ext:"",name:""};if(0===t.length)return e;var i,r=t.charCodeAt(0),s=47===r;s?(e.root="/",i=1):i=0;for(var o=-1,a=0,h=-1,u=!0,l=t.length-1,c=0;l>=i;--l)if(47!==(r=t.charCodeAt(l)))-1===h&&(u=!1,h=l+1),46===r?-1===o?o=l:1!==c&&(c=1):-1!==o&&(c=-1);else if(!u){a=l+1;break}return-1===o||-1===h||0===c||1===c&&o===h-1&&o===a+1?-1!==h&&(e.base=e.name=0===a&&s?t.slice(1,h):t.slice(a,h)):(0===a&&s?(e.name=t.slice(1,o),e.base=t.slice(1,h)):(e.name=t.slice(a,o),e.base=t.slice(a,h)),e.ext=t.slice(o,h)),a>0?e.dir=t.slice(0,a-1):s&&(e.dir="/"),e},sep:"/",delimiter:":",win32:null,posix:null};o.posix=o,t.exports=o},5632:(t,e,i)=>{e.pbkdf2=i(8638),e.pbkdf2Sync=i(1257)},8638:(t,e,i)=>{var r,n,s=i(9509).Buffer,o=i(7357),a=i(2368),h=i(1257),u=i(7777),l=i.g.crypto&&i.g.crypto.subtle,c={sha:"SHA-1","sha-1":"SHA-1",sha1:"SHA-1",sha256:"SHA-256","sha-256":"SHA-256",sha384:"SHA-384","sha-384":"SHA-384","sha-512":"SHA-512",sha512:"SHA-512"},d=[];function f(){return n||(n=i.g.process&&i.g.process.nextTick?i.g.process.nextTick:i.g.queueMicrotask?i.g.queueMicrotask:i.g.setImmediate?i.g.setImmediate:i.g.setTimeout)}function p(t,e,i,r,n){return l.importKey("raw",t,{name:"PBKDF2"},!1,["deriveBits"]).then((function(t){return l.deriveBits({name:"PBKDF2",salt:e,iterations:i,hash:{name:n}},t,r<<3)})).then((function(t){return s.from(t)}))}t.exports=function(t,e,n,m,g,b){"function"==typeof g&&(b=g,g=void 0);var v=c[(g=g||"sha1").toLowerCase()];if(v&&"function"==typeof i.g.Promise){if(o(n,m),t=u(t,a,"Password"),e=u(e,a,"Salt"),"function"!=typeof b)throw new Error("No callback provided to pbkdf2");!function(t,e){t.then((function(t){f()((function(){e(null,t)}))}),(function(t){f()((function(){e(t)}))}))}(function(t){if(i.g.process&&!i.g.process.browser)return Promise.resolve(!1);if(!l||!l.importKey||!l.deriveBits)return Promise.resolve(!1);if(void 0!==d[t])return d[t];var e=p(r=r||s.alloc(8),r,10,128,t).then((function(){return!0})).catch((function(){return!1}));return d[t]=e,e}(v).then((function(i){return i?p(t,e,n,m,v):h(t,e,n,m,g)})),b)}else f()((function(){var i;try{i=h(t,e,n,m,g)}catch(t){return b(t)}b(null,i)}))}},2368:(t,e,i)=>{var r,n=i(9590);r=i.g.process&&i.g.process.browser?"utf-8":i.g.process&&i.g.process.version?parseInt(n.version.split(".")[0].slice(1),10)>=6?"utf-8":"binary":"utf-8",t.exports=r},7357:t=>{var e=Math.pow(2,30)-1;t.exports=function(t,i){if("number"!=typeof t)throw new TypeError("Iterations not a number");if(t<0)throw new TypeError("Bad iterations");if("number"!=typeof i)throw new TypeError("Key length not a number");if(i<0||i>e||i!=i)throw new TypeError("Bad key length")}},1257:(t,e,i)=>{var r=i(8028),n=i(9785),s=i(9072),o=i(9509).Buffer,a=i(7357),h=i(2368),u=i(7777),l=o.alloc(128),c={md5:16,sha1:20,sha224:28,sha256:32,sha384:48,sha512:64,rmd160:20,ripemd160:20};function d(t,e,i){var a=function(t){return"rmd160"===t||"ripemd160"===t?function(t){return(new n).update(t).digest()}:"md5"===t?r:function(e){return s(t).update(e).digest()}}(t),h="sha512"===t||"sha384"===t?128:64;e.length>h?e=a(e):e.length{var r=i(9509).Buffer;t.exports=function(t,e,i){if(r.isBuffer(t))return t;if("string"==typeof t)return r.from(t,e);if(ArrayBuffer.isView(t))return r.from(t.buffer);throw new TypeError(i+" must be a string, a Buffer, a typed array or a DataView")}},3786:t=>{t.exports=function(t){return Math.max(16384,1<{const e=t.exports={};function i(){}e.title="browser",e.browser=!0,e.env={},e.argv=[],e.version="",e.versions={},e.on=i,e.addListener=i,e.once=i,e.off=i,e.removeListener=i,e.removeAllListeners=i,e.emit=i,e.prependListener=i,e.prependOnceListener=i,e.nextTick=(t,...e)=>window.queueMicrotask((()=>t(...e))),e.listeners=t=>[],e.cwd=()=>"/",e.umask=()=>0,e.binding=t=>{throw new Error("process.binding is not supported")},e.chdir=t=>{throw new Error("process.chdir is not supported")}},7900:(t,e,i)=>{e.publicEncrypt=i(6559),e.privateDecrypt=i(6138),e.privateEncrypt=function(t,i){return e.publicEncrypt(t,i,!0)},e.publicDecrypt=function(t,i){return e.privateDecrypt(t,i,!0)}},7139:(t,e,i)=>{var r=i(3482),n=i(9509).Buffer;function s(t){var e=n.allocUnsafe(4);return e.writeUInt32BE(t,0),e}t.exports=function(t,e){for(var i,o=n.alloc(0),a=0;o.length=65&&i<=70?i-55:i>=97&&i<=102?i-87:i-48&15}function h(t,e,i){var r=a(t,i);return i-1>=e&&(r|=a(t,i-1)<<4),r}function u(t,e,i,r){for(var n=0,s=Math.min(t.length,i),o=e;o=49?a-49+10:a>=17?a-17+10:a}return n}s.isBN=function(t){return t instanceof s||null!==t&&"object"==typeof t&&t.constructor.wordSize===s.wordSize&&Array.isArray(t.words)},s.max=function(t,e){return t.cmp(e)>0?t:e},s.min=function(t,e){return t.cmp(e)<0?t:e},s.prototype._init=function(t,e,i){if("number"==typeof t)return this._initNumber(t,e,i);if("object"==typeof t)return this._initArray(t,e,i);"hex"===e&&(e=16),r(e===(0|e)&&e>=2&&e<=36);var n=0;"-"===(t=t.toString().replace(/\s+/g,""))[0]&&(n++,this.negative=1),n=0;n-=3)o=t[n]|t[n-1]<<8|t[n-2]<<16,this.words[s]|=o<>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);else if("le"===i)for(n=0,s=0;n>>26-a&67108863,(a+=24)>=26&&(a-=26,s++);return this.strip()},s.prototype._parseHex=function(t,e,i){this.length=Math.ceil((t.length-e)/6),this.words=new Array(this.length);for(var r=0;r=e;r-=2)n=h(t,e,r)<=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;else for(r=(t.length-e)%2==0?e+1:e;r=18?(s-=18,o+=1,this.words[o]|=n>>>26):s+=8;this.strip()},s.prototype._parseBase=function(t,e,i){this.words=[0],this.length=1;for(var r=0,n=1;n<=67108863;n*=e)r++;r--,n=n/e|0;for(var s=t.length-i,o=s%r,a=Math.min(s,s-o)+i,h=0,l=i;l1&&0===this.words[this.length-1];)this.length--;return this._normSign()},s.prototype._normSign=function(){return 1===this.length&&0===this.words[0]&&(this.negative=0),this},s.prototype.inspect=function(){return(this.red?""};var l=["","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"],c=[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],d=[0,0,33554432,43046721,16777216,48828125,60466176,40353607,16777216,43046721,1e7,19487171,35831808,62748517,7529536,11390625,16777216,24137569,34012224,47045881,64e6,4084101,5153632,6436343,7962624,9765625,11881376,14348907,17210368,20511149,243e5,28629151,33554432,39135393,45435424,52521875,60466176];function f(t,e,i){i.negative=e.negative^t.negative;var r=t.length+e.length|0;i.length=r,r=r-1|0;var n=0|t.words[0],s=0|e.words[0],o=n*s,a=67108863&o,h=o/67108864|0;i.words[0]=a;for(var u=1;u>>26,c=67108863&h,d=Math.min(u,e.length-1),f=Math.max(0,u-t.length+1);f<=d;f++){var p=u-f|0;l+=(o=(n=0|t.words[p])*(s=0|e.words[f])+c)/67108864|0,c=67108863&o}i.words[u]=0|c,h=0|l}return 0!==h?i.words[u]=0|h:i.length--,i.strip()}s.prototype.toString=function(t,e){var i;if(e=0|e||1,16===(t=t||10)||"hex"===t){i="";for(var n=0,s=0,o=0;o>>24-n&16777215)||o!==this.length-1?l[6-h.length]+h+i:h+i,(n+=2)>=26&&(n-=26,o--)}for(0!==s&&(i=s.toString(16)+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}if(t===(0|t)&&t>=2&&t<=36){var u=c[t],f=d[t];i="";var p=this.clone();for(p.negative=0;!p.isZero();){var m=p.modn(f).toString(t);i=(p=p.idivn(f)).isZero()?m+i:l[u-m.length]+m+i}for(this.isZero()&&(i="0"+i);i.length%e!=0;)i="0"+i;return 0!==this.negative&&(i="-"+i),i}r(!1,"Base should be between 2 and 36")},s.prototype.toNumber=function(){var t=this.words[0];return 2===this.length?t+=67108864*this.words[1]:3===this.length&&1===this.words[2]?t+=4503599627370496+67108864*this.words[1]:this.length>2&&r(!1,"Number can only safely store up to 53 bits"),0!==this.negative?-t:t},s.prototype.toJSON=function(){return this.toString(16)},s.prototype.toBuffer=function(t,e){return r(void 0!==o),this.toArrayLike(o,t,e)},s.prototype.toArray=function(t,e){return this.toArrayLike(Array,t,e)},s.prototype.toArrayLike=function(t,e,i){var n=this.byteLength(),s=i||Math.max(1,n);r(n<=s,"byte array longer than desired length"),r(s>0,"Requested array length <= 0"),this.strip();var o,a,h="le"===e,u=new t(s),l=this.clone();if(h){for(a=0;!l.isZero();a++)o=l.andln(255),l.iushrn(8),u[a]=o;for(;a=4096&&(i+=13,e>>>=13),e>=64&&(i+=7,e>>>=7),e>=8&&(i+=4,e>>>=4),e>=2&&(i+=2,e>>>=2),i+e},s.prototype._zeroBits=function(t){if(0===t)return 26;var e=t,i=0;return 0==(8191&e)&&(i+=13,e>>>=13),0==(127&e)&&(i+=7,e>>>=7),0==(15&e)&&(i+=4,e>>>=4),0==(3&e)&&(i+=2,e>>>=2),0==(1&e)&&i++,i},s.prototype.bitLength=function(){var t=this.words[this.length-1],e=this._countBits(t);return 26*(this.length-1)+e},s.prototype.zeroBits=function(){if(this.isZero())return 0;for(var t=0,e=0;et.length?this.clone().ior(t):t.clone().ior(this)},s.prototype.uor=function(t){return this.length>t.length?this.clone().iuor(t):t.clone().iuor(this)},s.prototype.iuand=function(t){var e;e=this.length>t.length?t:this;for(var i=0;it.length?this.clone().iand(t):t.clone().iand(this)},s.prototype.uand=function(t){return this.length>t.length?this.clone().iuand(t):t.clone().iuand(this)},s.prototype.iuxor=function(t){var e,i;this.length>t.length?(e=this,i=t):(e=t,i=this);for(var r=0;rt.length?this.clone().ixor(t):t.clone().ixor(this)},s.prototype.uxor=function(t){return this.length>t.length?this.clone().iuxor(t):t.clone().iuxor(this)},s.prototype.inotn=function(t){r("number"==typeof t&&t>=0);var e=0|Math.ceil(t/26),i=t%26;this._expand(e),i>0&&e--;for(var n=0;n0&&(this.words[n]=~this.words[n]&67108863>>26-i),this.strip()},s.prototype.notn=function(t){return this.clone().inotn(t)},s.prototype.setn=function(t,e){r("number"==typeof t&&t>=0);var i=t/26|0,n=t%26;return this._expand(i+1),this.words[i]=e?this.words[i]|1<t.length?(i=this,r=t):(i=t,r=this);for(var n=0,s=0;s>>26;for(;0!==n&&s>>26;if(this.length=i.length,0!==n)this.words[this.length]=n,this.length++;else if(i!==this)for(;st.length?this.clone().iadd(t):t.clone().iadd(this)},s.prototype.isub=function(t){if(0!==t.negative){t.negative=0;var e=this.iadd(t);return t.negative=1,e._normSign()}if(0!==this.negative)return this.negative=0,this.iadd(t),this.negative=1,this._normSign();var i,r,n=this.cmp(t);if(0===n)return this.negative=0,this.length=1,this.words[0]=0,this;n>0?(i=this,r=t):(i=t,r=this);for(var s=0,o=0;o>26,this.words[o]=67108863&e;for(;0!==s&&o>26,this.words[o]=67108863&e;if(0===s&&o>>13,f=0|o[1],p=8191&f,m=f>>>13,g=0|o[2],b=8191&g,v=g>>>13,y=0|o[3],w=8191&y,_=y>>>13,M=0|o[4],k=8191&M,x=M>>>13,E=0|o[5],S=8191&E,T=E>>>13,A=0|o[6],I=8191&A,C=A>>>13,B=0|o[7],R=8191&B,P=B>>>13,L=0|o[8],O=8191&L,D=L>>>13,N=0|o[9],j=8191&N,U=N>>>13,F=0|a[0],q=8191&F,z=F>>>13,H=0|a[1],W=8191&H,$=H>>>13,Z=0|a[2],V=8191&Z,K=Z>>>13,G=0|a[3],J=8191&G,Y=G>>>13,X=0|a[4],Q=8191&X,tt=X>>>13,et=0|a[5],it=8191&et,rt=et>>>13,nt=0|a[6],st=8191&nt,ot=nt>>>13,at=0|a[7],ht=8191&at,ut=at>>>13,lt=0|a[8],ct=8191<,dt=lt>>>13,ft=0|a[9],pt=8191&ft,mt=ft>>>13;i.negative=t.negative^e.negative,i.length=19;var gt=(u+(r=Math.imul(c,q))|0)+((8191&(n=(n=Math.imul(c,z))+Math.imul(d,q)|0))<<13)|0;u=((s=Math.imul(d,z))+(n>>>13)|0)+(gt>>>26)|0,gt&=67108863,r=Math.imul(p,q),n=(n=Math.imul(p,z))+Math.imul(m,q)|0,s=Math.imul(m,z);var bt=(u+(r=r+Math.imul(c,W)|0)|0)+((8191&(n=(n=n+Math.imul(c,$)|0)+Math.imul(d,W)|0))<<13)|0;u=((s=s+Math.imul(d,$)|0)+(n>>>13)|0)+(bt>>>26)|0,bt&=67108863,r=Math.imul(b,q),n=(n=Math.imul(b,z))+Math.imul(v,q)|0,s=Math.imul(v,z),r=r+Math.imul(p,W)|0,n=(n=n+Math.imul(p,$)|0)+Math.imul(m,W)|0,s=s+Math.imul(m,$)|0;var vt=(u+(r=r+Math.imul(c,V)|0)|0)+((8191&(n=(n=n+Math.imul(c,K)|0)+Math.imul(d,V)|0))<<13)|0;u=((s=s+Math.imul(d,K)|0)+(n>>>13)|0)+(vt>>>26)|0,vt&=67108863,r=Math.imul(w,q),n=(n=Math.imul(w,z))+Math.imul(_,q)|0,s=Math.imul(_,z),r=r+Math.imul(b,W)|0,n=(n=n+Math.imul(b,$)|0)+Math.imul(v,W)|0,s=s+Math.imul(v,$)|0,r=r+Math.imul(p,V)|0,n=(n=n+Math.imul(p,K)|0)+Math.imul(m,V)|0,s=s+Math.imul(m,K)|0;var yt=(u+(r=r+Math.imul(c,J)|0)|0)+((8191&(n=(n=n+Math.imul(c,Y)|0)+Math.imul(d,J)|0))<<13)|0;u=((s=s+Math.imul(d,Y)|0)+(n>>>13)|0)+(yt>>>26)|0,yt&=67108863,r=Math.imul(k,q),n=(n=Math.imul(k,z))+Math.imul(x,q)|0,s=Math.imul(x,z),r=r+Math.imul(w,W)|0,n=(n=n+Math.imul(w,$)|0)+Math.imul(_,W)|0,s=s+Math.imul(_,$)|0,r=r+Math.imul(b,V)|0,n=(n=n+Math.imul(b,K)|0)+Math.imul(v,V)|0,s=s+Math.imul(v,K)|0,r=r+Math.imul(p,J)|0,n=(n=n+Math.imul(p,Y)|0)+Math.imul(m,J)|0,s=s+Math.imul(m,Y)|0;var wt=(u+(r=r+Math.imul(c,Q)|0)|0)+((8191&(n=(n=n+Math.imul(c,tt)|0)+Math.imul(d,Q)|0))<<13)|0;u=((s=s+Math.imul(d,tt)|0)+(n>>>13)|0)+(wt>>>26)|0,wt&=67108863,r=Math.imul(S,q),n=(n=Math.imul(S,z))+Math.imul(T,q)|0,s=Math.imul(T,z),r=r+Math.imul(k,W)|0,n=(n=n+Math.imul(k,$)|0)+Math.imul(x,W)|0,s=s+Math.imul(x,$)|0,r=r+Math.imul(w,V)|0,n=(n=n+Math.imul(w,K)|0)+Math.imul(_,V)|0,s=s+Math.imul(_,K)|0,r=r+Math.imul(b,J)|0,n=(n=n+Math.imul(b,Y)|0)+Math.imul(v,J)|0,s=s+Math.imul(v,Y)|0,r=r+Math.imul(p,Q)|0,n=(n=n+Math.imul(p,tt)|0)+Math.imul(m,Q)|0,s=s+Math.imul(m,tt)|0;var _t=(u+(r=r+Math.imul(c,it)|0)|0)+((8191&(n=(n=n+Math.imul(c,rt)|0)+Math.imul(d,it)|0))<<13)|0;u=((s=s+Math.imul(d,rt)|0)+(n>>>13)|0)+(_t>>>26)|0,_t&=67108863,r=Math.imul(I,q),n=(n=Math.imul(I,z))+Math.imul(C,q)|0,s=Math.imul(C,z),r=r+Math.imul(S,W)|0,n=(n=n+Math.imul(S,$)|0)+Math.imul(T,W)|0,s=s+Math.imul(T,$)|0,r=r+Math.imul(k,V)|0,n=(n=n+Math.imul(k,K)|0)+Math.imul(x,V)|0,s=s+Math.imul(x,K)|0,r=r+Math.imul(w,J)|0,n=(n=n+Math.imul(w,Y)|0)+Math.imul(_,J)|0,s=s+Math.imul(_,Y)|0,r=r+Math.imul(b,Q)|0,n=(n=n+Math.imul(b,tt)|0)+Math.imul(v,Q)|0,s=s+Math.imul(v,tt)|0,r=r+Math.imul(p,it)|0,n=(n=n+Math.imul(p,rt)|0)+Math.imul(m,it)|0,s=s+Math.imul(m,rt)|0;var Mt=(u+(r=r+Math.imul(c,st)|0)|0)+((8191&(n=(n=n+Math.imul(c,ot)|0)+Math.imul(d,st)|0))<<13)|0;u=((s=s+Math.imul(d,ot)|0)+(n>>>13)|0)+(Mt>>>26)|0,Mt&=67108863,r=Math.imul(R,q),n=(n=Math.imul(R,z))+Math.imul(P,q)|0,s=Math.imul(P,z),r=r+Math.imul(I,W)|0,n=(n=n+Math.imul(I,$)|0)+Math.imul(C,W)|0,s=s+Math.imul(C,$)|0,r=r+Math.imul(S,V)|0,n=(n=n+Math.imul(S,K)|0)+Math.imul(T,V)|0,s=s+Math.imul(T,K)|0,r=r+Math.imul(k,J)|0,n=(n=n+Math.imul(k,Y)|0)+Math.imul(x,J)|0,s=s+Math.imul(x,Y)|0,r=r+Math.imul(w,Q)|0,n=(n=n+Math.imul(w,tt)|0)+Math.imul(_,Q)|0,s=s+Math.imul(_,tt)|0,r=r+Math.imul(b,it)|0,n=(n=n+Math.imul(b,rt)|0)+Math.imul(v,it)|0,s=s+Math.imul(v,rt)|0,r=r+Math.imul(p,st)|0,n=(n=n+Math.imul(p,ot)|0)+Math.imul(m,st)|0,s=s+Math.imul(m,ot)|0;var kt=(u+(r=r+Math.imul(c,ht)|0)|0)+((8191&(n=(n=n+Math.imul(c,ut)|0)+Math.imul(d,ht)|0))<<13)|0;u=((s=s+Math.imul(d,ut)|0)+(n>>>13)|0)+(kt>>>26)|0,kt&=67108863,r=Math.imul(O,q),n=(n=Math.imul(O,z))+Math.imul(D,q)|0,s=Math.imul(D,z),r=r+Math.imul(R,W)|0,n=(n=n+Math.imul(R,$)|0)+Math.imul(P,W)|0,s=s+Math.imul(P,$)|0,r=r+Math.imul(I,V)|0,n=(n=n+Math.imul(I,K)|0)+Math.imul(C,V)|0,s=s+Math.imul(C,K)|0,r=r+Math.imul(S,J)|0,n=(n=n+Math.imul(S,Y)|0)+Math.imul(T,J)|0,s=s+Math.imul(T,Y)|0,r=r+Math.imul(k,Q)|0,n=(n=n+Math.imul(k,tt)|0)+Math.imul(x,Q)|0,s=s+Math.imul(x,tt)|0,r=r+Math.imul(w,it)|0,n=(n=n+Math.imul(w,rt)|0)+Math.imul(_,it)|0,s=s+Math.imul(_,rt)|0,r=r+Math.imul(b,st)|0,n=(n=n+Math.imul(b,ot)|0)+Math.imul(v,st)|0,s=s+Math.imul(v,ot)|0,r=r+Math.imul(p,ht)|0,n=(n=n+Math.imul(p,ut)|0)+Math.imul(m,ht)|0,s=s+Math.imul(m,ut)|0;var xt=(u+(r=r+Math.imul(c,ct)|0)|0)+((8191&(n=(n=n+Math.imul(c,dt)|0)+Math.imul(d,ct)|0))<<13)|0;u=((s=s+Math.imul(d,dt)|0)+(n>>>13)|0)+(xt>>>26)|0,xt&=67108863,r=Math.imul(j,q),n=(n=Math.imul(j,z))+Math.imul(U,q)|0,s=Math.imul(U,z),r=r+Math.imul(O,W)|0,n=(n=n+Math.imul(O,$)|0)+Math.imul(D,W)|0,s=s+Math.imul(D,$)|0,r=r+Math.imul(R,V)|0,n=(n=n+Math.imul(R,K)|0)+Math.imul(P,V)|0,s=s+Math.imul(P,K)|0,r=r+Math.imul(I,J)|0,n=(n=n+Math.imul(I,Y)|0)+Math.imul(C,J)|0,s=s+Math.imul(C,Y)|0,r=r+Math.imul(S,Q)|0,n=(n=n+Math.imul(S,tt)|0)+Math.imul(T,Q)|0,s=s+Math.imul(T,tt)|0,r=r+Math.imul(k,it)|0,n=(n=n+Math.imul(k,rt)|0)+Math.imul(x,it)|0,s=s+Math.imul(x,rt)|0,r=r+Math.imul(w,st)|0,n=(n=n+Math.imul(w,ot)|0)+Math.imul(_,st)|0,s=s+Math.imul(_,ot)|0,r=r+Math.imul(b,ht)|0,n=(n=n+Math.imul(b,ut)|0)+Math.imul(v,ht)|0,s=s+Math.imul(v,ut)|0,r=r+Math.imul(p,ct)|0,n=(n=n+Math.imul(p,dt)|0)+Math.imul(m,ct)|0,s=s+Math.imul(m,dt)|0;var Et=(u+(r=r+Math.imul(c,pt)|0)|0)+((8191&(n=(n=n+Math.imul(c,mt)|0)+Math.imul(d,pt)|0))<<13)|0;u=((s=s+Math.imul(d,mt)|0)+(n>>>13)|0)+(Et>>>26)|0,Et&=67108863,r=Math.imul(j,W),n=(n=Math.imul(j,$))+Math.imul(U,W)|0,s=Math.imul(U,$),r=r+Math.imul(O,V)|0,n=(n=n+Math.imul(O,K)|0)+Math.imul(D,V)|0,s=s+Math.imul(D,K)|0,r=r+Math.imul(R,J)|0,n=(n=n+Math.imul(R,Y)|0)+Math.imul(P,J)|0,s=s+Math.imul(P,Y)|0,r=r+Math.imul(I,Q)|0,n=(n=n+Math.imul(I,tt)|0)+Math.imul(C,Q)|0,s=s+Math.imul(C,tt)|0,r=r+Math.imul(S,it)|0,n=(n=n+Math.imul(S,rt)|0)+Math.imul(T,it)|0,s=s+Math.imul(T,rt)|0,r=r+Math.imul(k,st)|0,n=(n=n+Math.imul(k,ot)|0)+Math.imul(x,st)|0,s=s+Math.imul(x,ot)|0,r=r+Math.imul(w,ht)|0,n=(n=n+Math.imul(w,ut)|0)+Math.imul(_,ht)|0,s=s+Math.imul(_,ut)|0,r=r+Math.imul(b,ct)|0,n=(n=n+Math.imul(b,dt)|0)+Math.imul(v,ct)|0,s=s+Math.imul(v,dt)|0;var St=(u+(r=r+Math.imul(p,pt)|0)|0)+((8191&(n=(n=n+Math.imul(p,mt)|0)+Math.imul(m,pt)|0))<<13)|0;u=((s=s+Math.imul(m,mt)|0)+(n>>>13)|0)+(St>>>26)|0,St&=67108863,r=Math.imul(j,V),n=(n=Math.imul(j,K))+Math.imul(U,V)|0,s=Math.imul(U,K),r=r+Math.imul(O,J)|0,n=(n=n+Math.imul(O,Y)|0)+Math.imul(D,J)|0,s=s+Math.imul(D,Y)|0,r=r+Math.imul(R,Q)|0,n=(n=n+Math.imul(R,tt)|0)+Math.imul(P,Q)|0,s=s+Math.imul(P,tt)|0,r=r+Math.imul(I,it)|0,n=(n=n+Math.imul(I,rt)|0)+Math.imul(C,it)|0,s=s+Math.imul(C,rt)|0,r=r+Math.imul(S,st)|0,n=(n=n+Math.imul(S,ot)|0)+Math.imul(T,st)|0,s=s+Math.imul(T,ot)|0,r=r+Math.imul(k,ht)|0,n=(n=n+Math.imul(k,ut)|0)+Math.imul(x,ht)|0,s=s+Math.imul(x,ut)|0,r=r+Math.imul(w,ct)|0,n=(n=n+Math.imul(w,dt)|0)+Math.imul(_,ct)|0,s=s+Math.imul(_,dt)|0;var Tt=(u+(r=r+Math.imul(b,pt)|0)|0)+((8191&(n=(n=n+Math.imul(b,mt)|0)+Math.imul(v,pt)|0))<<13)|0;u=((s=s+Math.imul(v,mt)|0)+(n>>>13)|0)+(Tt>>>26)|0,Tt&=67108863,r=Math.imul(j,J),n=(n=Math.imul(j,Y))+Math.imul(U,J)|0,s=Math.imul(U,Y),r=r+Math.imul(O,Q)|0,n=(n=n+Math.imul(O,tt)|0)+Math.imul(D,Q)|0,s=s+Math.imul(D,tt)|0,r=r+Math.imul(R,it)|0,n=(n=n+Math.imul(R,rt)|0)+Math.imul(P,it)|0,s=s+Math.imul(P,rt)|0,r=r+Math.imul(I,st)|0,n=(n=n+Math.imul(I,ot)|0)+Math.imul(C,st)|0,s=s+Math.imul(C,ot)|0,r=r+Math.imul(S,ht)|0,n=(n=n+Math.imul(S,ut)|0)+Math.imul(T,ht)|0,s=s+Math.imul(T,ut)|0,r=r+Math.imul(k,ct)|0,n=(n=n+Math.imul(k,dt)|0)+Math.imul(x,ct)|0,s=s+Math.imul(x,dt)|0;var At=(u+(r=r+Math.imul(w,pt)|0)|0)+((8191&(n=(n=n+Math.imul(w,mt)|0)+Math.imul(_,pt)|0))<<13)|0;u=((s=s+Math.imul(_,mt)|0)+(n>>>13)|0)+(At>>>26)|0,At&=67108863,r=Math.imul(j,Q),n=(n=Math.imul(j,tt))+Math.imul(U,Q)|0,s=Math.imul(U,tt),r=r+Math.imul(O,it)|0,n=(n=n+Math.imul(O,rt)|0)+Math.imul(D,it)|0,s=s+Math.imul(D,rt)|0,r=r+Math.imul(R,st)|0,n=(n=n+Math.imul(R,ot)|0)+Math.imul(P,st)|0,s=s+Math.imul(P,ot)|0,r=r+Math.imul(I,ht)|0,n=(n=n+Math.imul(I,ut)|0)+Math.imul(C,ht)|0,s=s+Math.imul(C,ut)|0,r=r+Math.imul(S,ct)|0,n=(n=n+Math.imul(S,dt)|0)+Math.imul(T,ct)|0,s=s+Math.imul(T,dt)|0;var It=(u+(r=r+Math.imul(k,pt)|0)|0)+((8191&(n=(n=n+Math.imul(k,mt)|0)+Math.imul(x,pt)|0))<<13)|0;u=((s=s+Math.imul(x,mt)|0)+(n>>>13)|0)+(It>>>26)|0,It&=67108863,r=Math.imul(j,it),n=(n=Math.imul(j,rt))+Math.imul(U,it)|0,s=Math.imul(U,rt),r=r+Math.imul(O,st)|0,n=(n=n+Math.imul(O,ot)|0)+Math.imul(D,st)|0,s=s+Math.imul(D,ot)|0,r=r+Math.imul(R,ht)|0,n=(n=n+Math.imul(R,ut)|0)+Math.imul(P,ht)|0,s=s+Math.imul(P,ut)|0,r=r+Math.imul(I,ct)|0,n=(n=n+Math.imul(I,dt)|0)+Math.imul(C,ct)|0,s=s+Math.imul(C,dt)|0;var Ct=(u+(r=r+Math.imul(S,pt)|0)|0)+((8191&(n=(n=n+Math.imul(S,mt)|0)+Math.imul(T,pt)|0))<<13)|0;u=((s=s+Math.imul(T,mt)|0)+(n>>>13)|0)+(Ct>>>26)|0,Ct&=67108863,r=Math.imul(j,st),n=(n=Math.imul(j,ot))+Math.imul(U,st)|0,s=Math.imul(U,ot),r=r+Math.imul(O,ht)|0,n=(n=n+Math.imul(O,ut)|0)+Math.imul(D,ht)|0,s=s+Math.imul(D,ut)|0,r=r+Math.imul(R,ct)|0,n=(n=n+Math.imul(R,dt)|0)+Math.imul(P,ct)|0,s=s+Math.imul(P,dt)|0;var Bt=(u+(r=r+Math.imul(I,pt)|0)|0)+((8191&(n=(n=n+Math.imul(I,mt)|0)+Math.imul(C,pt)|0))<<13)|0;u=((s=s+Math.imul(C,mt)|0)+(n>>>13)|0)+(Bt>>>26)|0,Bt&=67108863,r=Math.imul(j,ht),n=(n=Math.imul(j,ut))+Math.imul(U,ht)|0,s=Math.imul(U,ut),r=r+Math.imul(O,ct)|0,n=(n=n+Math.imul(O,dt)|0)+Math.imul(D,ct)|0,s=s+Math.imul(D,dt)|0;var Rt=(u+(r=r+Math.imul(R,pt)|0)|0)+((8191&(n=(n=n+Math.imul(R,mt)|0)+Math.imul(P,pt)|0))<<13)|0;u=((s=s+Math.imul(P,mt)|0)+(n>>>13)|0)+(Rt>>>26)|0,Rt&=67108863,r=Math.imul(j,ct),n=(n=Math.imul(j,dt))+Math.imul(U,ct)|0,s=Math.imul(U,dt);var Pt=(u+(r=r+Math.imul(O,pt)|0)|0)+((8191&(n=(n=n+Math.imul(O,mt)|0)+Math.imul(D,pt)|0))<<13)|0;u=((s=s+Math.imul(D,mt)|0)+(n>>>13)|0)+(Pt>>>26)|0,Pt&=67108863;var Lt=(u+(r=Math.imul(j,pt))|0)+((8191&(n=(n=Math.imul(j,mt))+Math.imul(U,pt)|0))<<13)|0;return u=((s=Math.imul(U,mt))+(n>>>13)|0)+(Lt>>>26)|0,Lt&=67108863,h[0]=gt,h[1]=bt,h[2]=vt,h[3]=yt,h[4]=wt,h[5]=_t,h[6]=Mt,h[7]=kt,h[8]=xt,h[9]=Et,h[10]=St,h[11]=Tt,h[12]=At,h[13]=It,h[14]=Ct,h[15]=Bt,h[16]=Rt,h[17]=Pt,h[18]=Lt,0!==u&&(h[19]=u,i.length++),i};function m(t,e,i){return(new g).mulp(t,e,i)}function g(t,e){this.x=t,this.y=e}Math.imul||(p=f),s.prototype.mulTo=function(t,e){var i,r=this.length+t.length;return i=10===this.length&&10===t.length?p(this,t,e):r<63?f(this,t,e):r<1024?function(t,e,i){i.negative=e.negative^t.negative,i.length=t.length+e.length;for(var r=0,n=0,s=0;s>>26)|0)>>>26,o&=67108863}i.words[s]=a,r=o,o=n}return 0!==r?i.words[s]=r:i.length--,i.strip()}(this,t,e):m(this,t,e),i},g.prototype.makeRBT=function(t){for(var e=new Array(t),i=s.prototype._countBits(t)-1,r=0;r>=1;return r},g.prototype.permute=function(t,e,i,r,n,s){for(var o=0;o>>=1)n++;return 1<>>=13,i[2*o+1]=8191&s,s>>>=13;for(o=2*e;o>=26,e+=n/67108864|0,e+=s>>>26,this.words[i]=67108863&s}return 0!==e&&(this.words[i]=e,this.length++),this},s.prototype.muln=function(t){return this.clone().imuln(t)},s.prototype.sqr=function(){return this.mul(this)},s.prototype.isqr=function(){return this.imul(this.clone())},s.prototype.pow=function(t){var e=function(t){for(var e=new Array(t.bitLength()),i=0;i>>n}return e}(t);if(0===e.length)return new s(1);for(var i=this,r=0;r=0);var e,i=t%26,n=(t-i)/26,s=67108863>>>26-i<<26-i;if(0!==i){var o=0;for(e=0;e>>26-i}o&&(this.words[e]=o,this.length++)}if(0!==n){for(e=this.length-1;e>=0;e--)this.words[e+n]=this.words[e];for(e=0;e=0),n=e?(e-e%26)/26:0;var s=t%26,o=Math.min((t-s)/26,this.length),a=67108863^67108863>>>s<o)for(this.length-=o,u=0;u=0&&(0!==l||u>=n);u--){var c=0|this.words[u];this.words[u]=l<<26-s|c>>>s,l=c&a}return h&&0!==l&&(h.words[h.length++]=l),0===this.length&&(this.words[0]=0,this.length=1),this.strip()},s.prototype.ishrn=function(t,e,i){return r(0===this.negative),this.iushrn(t,e,i)},s.prototype.shln=function(t){return this.clone().ishln(t)},s.prototype.ushln=function(t){return this.clone().iushln(t)},s.prototype.shrn=function(t){return this.clone().ishrn(t)},s.prototype.ushrn=function(t){return this.clone().iushrn(t)},s.prototype.testn=function(t){r("number"==typeof t&&t>=0);var e=t%26,i=(t-e)/26,n=1<=0);var e=t%26,i=(t-e)/26;if(r(0===this.negative,"imaskn works only with positive numbers"),this.length<=i)return this;if(0!==e&&i++,this.length=Math.min(i,this.length),0!==e){var n=67108863^67108863>>>e<=67108864;e++)this.words[e]-=67108864,e===this.length-1?this.words[e+1]=1:this.words[e+1]++;return this.length=Math.max(this.length,e+1),this},s.prototype.isubn=function(t){if(r("number"==typeof t),r(t<67108864),t<0)return this.iaddn(-t);if(0!==this.negative)return this.negative=0,this.iaddn(t),this.negative=1,this;if(this.words[0]-=t,1===this.length&&this.words[0]<0)this.words[0]=-this.words[0],this.negative=1;else for(var e=0;e>26)-(h/67108864|0),this.words[n+i]=67108863&s}for(;n>26,this.words[n+i]=67108863&s;if(0===a)return this.strip();for(r(-1===a),a=0,n=0;n>26,this.words[n]=67108863&s;return this.negative=1,this.strip()},s.prototype._wordDiv=function(t,e){var i=(this.length,t.length),r=this.clone(),n=t,o=0|n.words[n.length-1];0!=(i=26-this._countBits(o))&&(n=n.ushln(i),r.iushln(i),o=0|n.words[n.length-1]);var a,h=r.length-n.length;if("mod"!==e){(a=new s(null)).length=h+1,a.words=new Array(a.length);for(var u=0;u=0;c--){var d=67108864*(0|r.words[n.length+c])+(0|r.words[n.length+c-1]);for(d=Math.min(d/o|0,67108863),r._ishlnsubmul(n,d,c);0!==r.negative;)d--,r.negative=0,r._ishlnsubmul(n,1,c),r.isZero()||(r.negative^=1);a&&(a.words[c]=d)}return a&&a.strip(),r.strip(),"div"!==e&&0!==i&&r.iushrn(i),{div:a||null,mod:r}},s.prototype.divmod=function(t,e,i){return r(!t.isZero()),this.isZero()?{div:new s(0),mod:new s(0)}:0!==this.negative&&0===t.negative?(a=this.neg().divmod(t,e),"mod"!==e&&(n=a.div.neg()),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.iadd(t)),{div:n,mod:o}):0===this.negative&&0!==t.negative?(a=this.divmod(t.neg(),e),"mod"!==e&&(n=a.div.neg()),{div:n,mod:a.mod}):0!=(this.negative&t.negative)?(a=this.neg().divmod(t.neg(),e),"div"!==e&&(o=a.mod.neg(),i&&0!==o.negative&&o.isub(t)),{div:a.div,mod:o}):t.length>this.length||this.cmp(t)<0?{div:new s(0),mod:this}:1===t.length?"div"===e?{div:this.divn(t.words[0]),mod:null}:"mod"===e?{div:null,mod:new s(this.modn(t.words[0]))}:{div:this.divn(t.words[0]),mod:new s(this.modn(t.words[0]))}:this._wordDiv(t,e);var n,o,a},s.prototype.div=function(t){return this.divmod(t,"div",!1).div},s.prototype.mod=function(t){return this.divmod(t,"mod",!1).mod},s.prototype.umod=function(t){return this.divmod(t,"mod",!0).mod},s.prototype.divRound=function(t){var e=this.divmod(t);if(e.mod.isZero())return e.div;var i=0!==e.div.negative?e.mod.isub(t):e.mod,r=t.ushrn(1),n=t.andln(1),s=i.cmp(r);return s<0||1===n&&0===s?e.div:0!==e.div.negative?e.div.isubn(1):e.div.iaddn(1)},s.prototype.modn=function(t){r(t<=67108863);for(var e=(1<<26)%t,i=0,n=this.length-1;n>=0;n--)i=(e*i+(0|this.words[n]))%t;return i},s.prototype.idivn=function(t){r(t<=67108863);for(var e=0,i=this.length-1;i>=0;i--){var n=(0|this.words[i])+67108864*e;this.words[i]=n/t|0,e=n%t}return this.strip()},s.prototype.divn=function(t){return this.clone().idivn(t)},s.prototype.egcd=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n=new s(1),o=new s(0),a=new s(0),h=new s(1),u=0;e.isEven()&&i.isEven();)e.iushrn(1),i.iushrn(1),++u;for(var l=i.clone(),c=e.clone();!e.isZero();){for(var d=0,f=1;0==(e.words[0]&f)&&d<26;++d,f<<=1);if(d>0)for(e.iushrn(d);d-- >0;)(n.isOdd()||o.isOdd())&&(n.iadd(l),o.isub(c)),n.iushrn(1),o.iushrn(1);for(var p=0,m=1;0==(i.words[0]&m)&&p<26;++p,m<<=1);if(p>0)for(i.iushrn(p);p-- >0;)(a.isOdd()||h.isOdd())&&(a.iadd(l),h.isub(c)),a.iushrn(1),h.iushrn(1);e.cmp(i)>=0?(e.isub(i),n.isub(a),o.isub(h)):(i.isub(e),a.isub(n),h.isub(o))}return{a,b:h,gcd:i.iushln(u)}},s.prototype._invmp=function(t){r(0===t.negative),r(!t.isZero());var e=this,i=t.clone();e=0!==e.negative?e.umod(t):e.clone();for(var n,o=new s(1),a=new s(0),h=i.clone();e.cmpn(1)>0&&i.cmpn(1)>0;){for(var u=0,l=1;0==(e.words[0]&l)&&u<26;++u,l<<=1);if(u>0)for(e.iushrn(u);u-- >0;)o.isOdd()&&o.iadd(h),o.iushrn(1);for(var c=0,d=1;0==(i.words[0]&d)&&c<26;++c,d<<=1);if(c>0)for(i.iushrn(c);c-- >0;)a.isOdd()&&a.iadd(h),a.iushrn(1);e.cmp(i)>=0?(e.isub(i),o.isub(a)):(i.isub(e),a.isub(o))}return(n=0===e.cmpn(1)?o:a).cmpn(0)<0&&n.iadd(t),n},s.prototype.gcd=function(t){if(this.isZero())return t.abs();if(t.isZero())return this.abs();var e=this.clone(),i=t.clone();e.negative=0,i.negative=0;for(var r=0;e.isEven()&&i.isEven();r++)e.iushrn(1),i.iushrn(1);for(;;){for(;e.isEven();)e.iushrn(1);for(;i.isEven();)i.iushrn(1);var n=e.cmp(i);if(n<0){var s=e;e=i,i=s}else if(0===n||0===i.cmpn(1))break;e.isub(i)}return i.iushln(r)},s.prototype.invm=function(t){return this.egcd(t).a.umod(t)},s.prototype.isEven=function(){return 0==(1&this.words[0])},s.prototype.isOdd=function(){return 1==(1&this.words[0])},s.prototype.andln=function(t){return this.words[0]&t},s.prototype.bincn=function(t){r("number"==typeof t);var e=t%26,i=(t-e)/26,n=1<>>26,a&=67108863,this.words[o]=a}return 0!==s&&(this.words[o]=s,this.length++),this},s.prototype.isZero=function(){return 1===this.length&&0===this.words[0]},s.prototype.cmpn=function(t){var e,i=t<0;if(0!==this.negative&&!i)return-1;if(0===this.negative&&i)return 1;if(this.strip(),this.length>1)e=1;else{i&&(t=-t),r(t<=67108863,"Number is too big");var n=0|this.words[0];e=n===t?0:nt.length)return 1;if(this.length=0;i--){var r=0|this.words[i],n=0|t.words[i];if(r!==n){rn&&(e=1);break}}return e},s.prototype.gtn=function(t){return 1===this.cmpn(t)},s.prototype.gt=function(t){return 1===this.cmp(t)},s.prototype.gten=function(t){return this.cmpn(t)>=0},s.prototype.gte=function(t){return this.cmp(t)>=0},s.prototype.ltn=function(t){return-1===this.cmpn(t)},s.prototype.lt=function(t){return-1===this.cmp(t)},s.prototype.lten=function(t){return this.cmpn(t)<=0},s.prototype.lte=function(t){return this.cmp(t)<=0},s.prototype.eqn=function(t){return 0===this.cmpn(t)},s.prototype.eq=function(t){return 0===this.cmp(t)},s.red=function(t){return new k(t)},s.prototype.toRed=function(t){return r(!this.red,"Already a number in reduction context"),r(0===this.negative,"red works only with positives"),t.convertTo(this)._forceRed(t)},s.prototype.fromRed=function(){return r(this.red,"fromRed works only with numbers in reduction context"),this.red.convertFrom(this)},s.prototype._forceRed=function(t){return this.red=t,this},s.prototype.forceRed=function(t){return r(!this.red,"Already a number in reduction context"),this._forceRed(t)},s.prototype.redAdd=function(t){return r(this.red,"redAdd works only with red numbers"),this.red.add(this,t)},s.prototype.redIAdd=function(t){return r(this.red,"redIAdd works only with red numbers"),this.red.iadd(this,t)},s.prototype.redSub=function(t){return r(this.red,"redSub works only with red numbers"),this.red.sub(this,t)},s.prototype.redISub=function(t){return r(this.red,"redISub works only with red numbers"),this.red.isub(this,t)},s.prototype.redShl=function(t){return r(this.red,"redShl works only with red numbers"),this.red.shl(this,t)},s.prototype.redMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.mul(this,t)},s.prototype.redIMul=function(t){return r(this.red,"redMul works only with red numbers"),this.red._verify2(this,t),this.red.imul(this,t)},s.prototype.redSqr=function(){return r(this.red,"redSqr works only with red numbers"),this.red._verify1(this),this.red.sqr(this)},s.prototype.redISqr=function(){return r(this.red,"redISqr works only with red numbers"),this.red._verify1(this),this.red.isqr(this)},s.prototype.redSqrt=function(){return r(this.red,"redSqrt works only with red numbers"),this.red._verify1(this),this.red.sqrt(this)},s.prototype.redInvm=function(){return r(this.red,"redInvm works only with red numbers"),this.red._verify1(this),this.red.invm(this)},s.prototype.redNeg=function(){return r(this.red,"redNeg works only with red numbers"),this.red._verify1(this),this.red.neg(this)},s.prototype.redPow=function(t){return r(this.red&&!t.red,"redPow(normalNum)"),this.red._verify1(this),this.red.pow(this,t)};var b={k256:null,p224:null,p192:null,p25519:null};function v(t,e){this.name=t,this.p=new s(e,16),this.n=this.p.bitLength(),this.k=new s(1).iushln(this.n).isub(this.p),this.tmp=this._tmp()}function y(){v.call(this,"k256","ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f")}function w(){v.call(this,"p224","ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001")}function _(){v.call(this,"p192","ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff")}function M(){v.call(this,"25519","7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed")}function k(t){if("string"==typeof t){var e=s._prime(t);this.m=e.p,this.prime=e}else r(t.gtn(1),"modulus must be greater than 1"),this.m=t,this.prime=null}function x(t){k.call(this,t),this.shift=this.m.bitLength(),this.shift%26!=0&&(this.shift+=26-this.shift%26),this.r=new s(1).iushln(this.shift),this.r2=this.imod(this.r.sqr()),this.rinv=this.r._invmp(this.m),this.minv=this.rinv.mul(this.r).isubn(1).div(this.m),this.minv=this.minv.umod(this.r),this.minv=this.r.sub(this.minv)}v.prototype._tmp=function(){var t=new s(null);return t.words=new Array(Math.ceil(this.n/13)),t},v.prototype.ireduce=function(t){var e,i=t;do{this.split(i,this.tmp),e=(i=(i=this.imulK(i)).iadd(this.tmp)).bitLength()}while(e>this.n);var r=e0?i.isub(this.p):void 0!==i.strip?i.strip():i._strip(),i},v.prototype.split=function(t,e){t.iushrn(this.n,0,e)},v.prototype.imulK=function(t){return t.imul(this.k)},n(y,v),y.prototype.split=function(t,e){for(var i=4194303,r=Math.min(t.length,9),n=0;n>>22,s=o}s>>>=22,t.words[n-10]=s,0===s&&t.length>10?t.length-=10:t.length-=9},y.prototype.imulK=function(t){t.words[t.length]=0,t.words[t.length+1]=0,t.length+=2;for(var e=0,i=0;i>>=26,t.words[i]=n,e=r}return 0!==e&&(t.words[t.length++]=e),t},s._prime=function(t){if(b[t])return b[t];var e;if("k256"===t)e=new y;else if("p224"===t)e=new w;else if("p192"===t)e=new _;else{if("p25519"!==t)throw new Error("Unknown prime "+t);e=new M}return b[t]=e,e},k.prototype._verify1=function(t){r(0===t.negative,"red works only with positives"),r(t.red,"red works only with red numbers")},k.prototype._verify2=function(t,e){r(0==(t.negative|e.negative),"red works only with positives"),r(t.red&&t.red===e.red,"red works only with red numbers")},k.prototype.imod=function(t){return this.prime?this.prime.ireduce(t)._forceRed(this):t.umod(this.m)._forceRed(this)},k.prototype.neg=function(t){return t.isZero()?t.clone():this.m.sub(t)._forceRed(this)},k.prototype.add=function(t,e){this._verify2(t,e);var i=t.add(e);return i.cmp(this.m)>=0&&i.isub(this.m),i._forceRed(this)},k.prototype.iadd=function(t,e){this._verify2(t,e);var i=t.iadd(e);return i.cmp(this.m)>=0&&i.isub(this.m),i},k.prototype.sub=function(t,e){this._verify2(t,e);var i=t.sub(e);return i.cmpn(0)<0&&i.iadd(this.m),i._forceRed(this)},k.prototype.isub=function(t,e){this._verify2(t,e);var i=t.isub(e);return i.cmpn(0)<0&&i.iadd(this.m),i},k.prototype.shl=function(t,e){return this._verify1(t),this.imod(t.ushln(e))},k.prototype.imul=function(t,e){return this._verify2(t,e),this.imod(t.imul(e))},k.prototype.mul=function(t,e){return this._verify2(t,e),this.imod(t.mul(e))},k.prototype.isqr=function(t){return this.imul(t,t.clone())},k.prototype.sqr=function(t){return this.mul(t,t)},k.prototype.sqrt=function(t){if(t.isZero())return t.clone();var e=this.m.andln(3);if(r(e%2==1),3===e){var i=this.m.add(new s(1)).iushrn(2);return this.pow(t,i)}for(var n=this.m.subn(1),o=0;!n.isZero()&&0===n.andln(1);)o++,n.iushrn(1);r(!n.isZero());var a=new s(1).toRed(this),h=a.redNeg(),u=this.m.subn(1).iushrn(1),l=this.m.bitLength();for(l=new s(2*l*l).toRed(this);0!==this.pow(l,u).cmp(h);)l.redIAdd(h);for(var c=this.pow(l,n),d=this.pow(t,n.addn(1).iushrn(1)),f=this.pow(t,n),p=o;0!==f.cmp(a);){for(var m=f,g=0;0!==m.cmp(a);g++)m=m.redSqr();r(g=0;r--){for(var u=e.words[r],l=h-1;l>=0;l--){var c=u>>l&1;n!==i[0]&&(n=this.sqr(n)),0!==c||0!==o?(o<<=1,o|=c,(4==++a||0===r&&0===l)&&(n=this.mul(n,i[o]),a=0,o=0)):a=0}h=26}return n},k.prototype.convertTo=function(t){var e=t.umod(this.m);return e===t?e.clone():e},k.prototype.convertFrom=function(t){var e=t.clone();return e.red=null,e},s.mont=function(t){return new x(t)},n(x,k),x.prototype.convertTo=function(t){return this.imod(t.ushln(this.shift))},x.prototype.convertFrom=function(t){var e=this.imod(t.mul(this.rinv));return e.red=null,e},x.prototype.imul=function(t,e){if(t.isZero()||e.isZero())return t.words[0]=0,t.length=1,t;var i=t.imul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),s=n;return n.cmp(this.m)>=0?s=n.isub(this.m):n.cmpn(0)<0&&(s=n.iadd(this.m)),s._forceRed(this)},x.prototype.mul=function(t,e){if(t.isZero()||e.isZero())return new s(0)._forceRed(this);var i=t.mul(e),r=i.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m),n=i.isub(r).iushrn(this.shift),o=n;return n.cmp(this.m)>=0?o=n.isub(this.m):n.cmpn(0)<0&&(o=n.iadd(this.m)),o._forceRed(this)},x.prototype.invm=function(t){return this.imod(t._invmp(this.m).mul(this.r2))._forceRed(this)}}(t=i.nmd(t),this)},6138:(t,e,i)=>{var r=i(980),n=i(7139),s=i(7859),o=i(2144),a=i(3663),h=i(3482),u=i(4818),l=i(9509).Buffer;t.exports=function(t,e,i){var c;c=t.padding?t.padding:i?1:4;var d,f=r(t),p=f.modulus.byteLength();if(e.length>p||new o(e).cmp(f.modulus)>=0)throw new Error("decryption error");d=i?u(new o(e),f):a(e,f);var m=l.alloc(p-d.length);if(d=l.concat([m,d],p),4===c)return function(t,e){var i=t.modulus.byteLength(),r=h("sha1").update(l.alloc(0)).digest(),o=r.length;if(0!==e[0])throw new Error("decryption error");var a=e.slice(1,o+1),u=e.slice(o+1),c=s(a,n(u,o)),d=s(u,n(c,i-o-1));if(function(t,e){t=l.from(t),e=l.from(e);var i=0,r=t.length;t.length!==e.length&&(i++,r=Math.min(t.length,e.length));for(var n=-1;++n=e.length){s++;break}var o=e.slice(2,n-1);if(("0002"!==r.toString("hex")&&!i||"0001"!==r.toString("hex")&&i)&&s++,o.length<8&&s++,s)throw new Error("decryption error");return e.slice(n)}(0,d,i);if(3===c)return d;throw new Error("unknown padding")}},6559:(t,e,i)=>{var r=i(980),n=i(1798),s=i(3482),o=i(7139),a=i(7859),h=i(2144),u=i(4818),l=i(3663),c=i(9509).Buffer;t.exports=function(t,e,i){var d;d=t.padding?t.padding:i?1:4;var f,p=r(t);if(4===d)f=function(t,e){var i=t.modulus.byteLength(),r=e.length,u=s("sha1").update(c.alloc(0)).digest(),l=u.length,d=2*l;if(r>i-d-2)throw new Error("message too long");var f=c.alloc(i-r-d-2),p=i-l-1,m=n(l),g=a(c.concat([u,f,c.alloc(1,1),e],p),o(m,p)),b=a(m,o(g,l));return new h(c.concat([c.alloc(1),b,g],i))}(p,e);else if(1===d)f=function(t,e,i){var r,s=e.length,o=t.modulus.byteLength();if(s>o-11)throw new Error("message too long");return r=i?c.alloc(o-s-3,255):function(t){for(var e,i=c.allocUnsafe(t),r=0,s=n(2*t),o=0;r=0)throw new Error("data too long for modulus")}return i?l(f,p):u(f,p)}},4818:(t,e,i)=>{var r=i(2144),n=i(9509).Buffer;t.exports=function(t,e){return n.from(t.toRed(r.mont(e.modulus)).redPow(new r(e.publicExponent)).fromRed().toArray())}},7859:t=>{t.exports=function(t,e){for(var i=t.length,r=-1;++r{var r=i(9590),n=i(778),s=i(2840),o=i(1156),a=function(){},h=/^v?\.0/.test(r.version),u=function(t){return"function"==typeof t},l=function(t,e,i,r){r=n(r);var l=!1;t.on("close",(function(){l=!0})),s(t,{readable:e,writable:i},(function(t){if(t)return r(t);l=!0,r()}));var c=!1;return function(e){if(!l&&!c)return c=!0,function(t){return!!h&&!!o&&(t instanceof(o.ReadStream||a)||t instanceof(o.WriteStream||a))&&u(t.close)}(t)?t.close(a):function(t){return t.setHeader&&u(t.abort)}(t)?t.abort():u(t.destroy)?t.destroy():void r(e||new Error("stream was destroyed"))}},c=function(t){t()},d=function(t,e){return t.pipe(e)};t.exports=function(){var t,e=Array.prototype.slice.call(arguments),i=u(e[e.length-1]||a)&&e.pop()||a;if(Array.isArray(e[0])&&(e=e[0]),e.length<2)throw new Error("pump requires two streams per minimum");var r=e.map((function(n,s){var o=s0,(function(e){t||(t=e),e&&r.forEach(c),o||(r.forEach(c),i(t))}))}));return e.reduce(d)}},2587:t=>{"use strict";function e(t,e){return Object.prototype.hasOwnProperty.call(t,e)}t.exports=function(t,i,r,n){i=i||"&",r=r||"=";var s={};if("string"!=typeof t||0===t.length)return s;var o=/\+/g;t=t.split(i);var a=1e3;n&&"number"==typeof n.maxKeys&&(a=n.maxKeys);var h=t.length;a>0&&h>a&&(h=a);for(var u=0;u=0?(l=p.substr(0,m),c=p.substr(m+1)):(l=p,c=""),d=decodeURIComponent(l),f=decodeURIComponent(c),e(s,d)?Array.isArray(s[d])?s[d].push(f):s[d]=[s[d],f]:s[d]=f}return s}},2182:t=>{"use strict";var e=function(t){switch(typeof t){case"string":return t;case"boolean":return t?"true":"false";case"number":return isFinite(t)?t:"";default:return""}};t.exports=function(t,i,r,n){return i=i||"&",r=r||"=",null===t&&(t=void 0),"object"==typeof t?Object.keys(t).map((function(n){var s=encodeURIComponent(e(n))+r;return Array.isArray(t[n])?t[n].map((function(t){return s+encodeURIComponent(e(t))})).join(i):s+encodeURIComponent(e(t[n]))})).join(i):n?encodeURIComponent(e(n))+r+encodeURIComponent(e(t)):""}},7673:(t,e,i)=>{"use strict";e.decode=e.parse=i(2587),e.encode=e.stringify=i(2182)},4375:(t,e,i)=>{let r;t.exports="function"==typeof queueMicrotask?queueMicrotask.bind("undefined"!=typeof window?window:i.g):t=>(r||(r=Promise.resolve())).then(t).catch((t=>setTimeout((()=>{throw t}),0)))},3527:t=>{t.exports="function"==typeof queueMicrotask?queueMicrotask:t=>Promise.resolve().then(t)},5960:t=>{t.exports=function(t){var e=0;return function(){if(e===t.length)return null;var i=t.length-e,r=Math.random()*i|0,n=t[e+r],s=t[e];return t[e]=n,t[e+r]=s,e++,n}}},1798:(t,e,i)=>{"use strict";var r=i(9590),n=65536,s=i(9509).Buffer,o=i.g.crypto||i.g.msCrypto;o&&o.getRandomValues?t.exports=function(t,e){if(t>4294967295)throw new RangeError("requested too many random bytes");var i=s.allocUnsafe(t);if(t>0)if(t>n)for(var a=0;a{"use strict";var r=i(9590);function n(){throw new Error("secure random number generation not supported by this browser\nuse chrome, FireFox or Internet Explorer 11")}var s=i(9509),o=i(1798),a=s.Buffer,h=s.kMaxLength,u=i.g.crypto||i.g.msCrypto,l=Math.pow(2,32)-1;function c(t,e){if("number"!=typeof t||t!=t)throw new TypeError("offset must be a number");if(t>l||t<0)throw new TypeError("offset must be a uint32");if(t>h||t>e)throw new RangeError("offset out of range")}function d(t,e,i){if("number"!=typeof t||t!=t)throw new TypeError("size must be a number");if(t>l||t<0)throw new TypeError("size must be a uint32");if(t+e>i||t>h)throw new RangeError("buffer too small")}function f(t,e,i,n){if(r.browser){var s=t.buffer,a=new Uint8Array(s,e,i);return u.getRandomValues(a),n?void r.nextTick((function(){n(null,t)})):t}if(!n)return o(i).copy(t,e),t;o(i,(function(i,r){if(i)return n(i);r.copy(t,e),n(null,t)}))}u&&u.getRandomValues||!r.browser?(e.randomFill=function(t,e,r,n){if(!(a.isBuffer(t)||t instanceof i.g.Uint8Array))throw new TypeError('"buf" argument must be a Buffer or Uint8Array');if("function"==typeof e)n=e,e=0,r=t.length;else if("function"==typeof r)n=r,r=t.length-e;else if("function"!=typeof n)throw new TypeError('"cb" argument must be a function');return c(e,t.length),d(r,e,t.length),f(t,e,r,n)},e.randomFillSync=function(t,e,r){if(void 0===e&&(e=0),!(a.isBuffer(t)||t instanceof i.g.Uint8Array))throw new TypeError('"buf" argument must be a Buffer or Uint8Array');return c(e,t.length),void 0===r&&(r=t.length-e),d(r,e,t.length),f(t,e,r)}):(e.randomFill=n,e.randomFillSync=n)},4622:t=>{"use strict";function e(t,e){return{start:t.start,end:t.end,index:e}}function i(t){return{start:t.start,end:t.end}}function r(t,e){return t.index-e.index}function n(t,e){return t.start-e.start}t.exports=function(t,s,o){if("string"!=typeof s)throw new TypeError("argument str must be a string");var a=s.indexOf("=");if(-1===a)return-2;var h=s.slice(a+1).split(","),u=[];u.type=s.slice(0,a);for(var l=0;lt-1&&(f=t-1),isNaN(d)||isNaN(f)||d>f||d<0||u.push({start:d,end:f})}return u.length<1?-1:o&&o.combine?function(t){for(var s=t.map(e).sort(n),o=0,a=1;au.end+1?s[++o]=h:h.end>u.end&&(u.end=h.end,u.index=Math.min(u.index,h.index))}s.length=o+1;var l=s.sort(r).map(i);return l.type=t.type,l}(u):u}},7856:(t,e,i)=>{const{Writable:r,PassThrough:n}=i(8473);t.exports=class extends r{constructor(t,e={}){super(e),this.destroyed=!1,this._queue=[],this._position=t||0,this._cb=null,this._buffer=null,this._out=null}_write(t,e,i){let r=!0;for(;;){if(this.destroyed)return;if(0===this._queue.length)return this._buffer=t,void(this._cb=i);this._buffer=null;var n=this._queue[0];const e=Math.max(n.start-this._position,0),s=n.end-this._position;if(e>=t.length)return this._position+=t.length,i(null);let o;if(s>t.length){this._position+=t.length,o=0===e?t:t.slice(e),r=n.stream.write(o)&&r;break}this._position+=s,o=0===e&&s===t.length?t:t.slice(e,s),r=n.stream.write(o)&&r,n.last&&n.stream.end(),t=t.slice(s),this._queue.shift()}r?i(null):n.stream.once("drain",i.bind(null,null))}slice(t){if(this.destroyed)return null;Array.isArray(t)||(t=[t]);const e=new n;return t.forEach(((i,r)=>{this._queue.push({start:i.start,end:i.end,stream:e,last:r===t.length-1})})),this._buffer&&this._write(this._buffer,null,this._cb),e}destroy(t){this.destroyed||(this.destroyed=!0,t&&this.emit("error",t))}}},7830:t=>{"use strict";function e(t){return parseInt(t,10)===t}function i(t){function i(e){this.s=function(e){if(void 0===e){e=new Array(t);for(var i=0;i{"use strict";var e={};function i(t,i,r){r||(r=Error);var n=function(t){var e,r;function n(e,r,n){return t.call(this,function(t,e,r){return"string"==typeof i?i:i(t,e,r)}(e,r,n))||this}return r=t,(e=n).prototype=Object.create(r.prototype),e.prototype.constructor=e,e.__proto__=r,n}(r);n.prototype.name=r.name,n.prototype.code=t,e[t]=n}function r(t,e){if(Array.isArray(t)){var i=t.length;return t=t.map((function(t){return String(t)})),i>2?"one of ".concat(e," ").concat(t.slice(0,i-1).join(", "),", or ")+t[i-1]:2===i?"one of ".concat(e," ").concat(t[0]," or ").concat(t[1]):"of ".concat(e," ").concat(t[0])}return"of ".concat(e," ").concat(String(t))}i("ERR_INVALID_OPT_VALUE",(function(t,e){return'The value "'+e+'" is invalid for option "'+t+'"'}),TypeError),i("ERR_INVALID_ARG_TYPE",(function(t,e,i){var n,s,o,a,h;if("string"==typeof e&&(s="not ",e.substr(0,s.length)===s)?(n="must not be",e=e.replace(/^not /,"")):n="must be",function(t,e,i){return(void 0===i||i>t.length)&&(i=t.length),t.substring(i-e.length,i)===e}(t," argument"))o="The ".concat(t," ").concat(n," ").concat(r(e,"type"));else{var u=("number"!=typeof h&&(h=0),h+".".length>(a=t).length||-1===a.indexOf(".",h)?"argument":"property");o='The "'.concat(t,'" ').concat(u," ").concat(n," ").concat(r(e,"type"))}return o+". Received type ".concat(typeof i)}),TypeError),i("ERR_STREAM_PUSH_AFTER_EOF","stream.push() after EOF"),i("ERR_METHOD_NOT_IMPLEMENTED",(function(t){return"The "+t+" method is not implemented"})),i("ERR_STREAM_PREMATURE_CLOSE","Premature close"),i("ERR_STREAM_DESTROYED",(function(t){return"Cannot call "+t+" after a stream was destroyed"})),i("ERR_MULTIPLE_CALLBACK","Callback called multiple times"),i("ERR_STREAM_CANNOT_PIPE","Cannot pipe, not readable"),i("ERR_STREAM_WRITE_AFTER_END","write after end"),i("ERR_STREAM_NULL_VALUES","May not write null values to stream",TypeError),i("ERR_UNKNOWN_ENCODING",(function(t){return"Unknown encoding: "+t}),TypeError),i("ERR_STREAM_UNSHIFT_AFTER_END_EVENT","stream.unshift() after end event"),t.exports.q=e},6753:(t,e,i)=>{"use strict";var r=i(9590),n=Object.keys||function(t){var e=[];for(var i in t)e.push(i);return e};t.exports=l;var s=i(9481),o=i(4229);i(5717)(l,s);for(var a=n(o.prototype),h=0;h{"use strict";t.exports=n;var r=i(4605);function n(t){if(!(this instanceof n))return new n(t);r.call(this,t)}i(5717)(n,r),n.prototype._transform=function(t,e,i){i(null,t)}},9481:(t,e,i)=>{"use strict";var r,n=i(9590);t.exports=E,E.ReadableState=x,i(7187).EventEmitter;var s,o=function(t,e){return t.listeners(e).length},a=i(2503),h=i(8764).Buffer,u=i.g.Uint8Array||function(){},l=i(4616);s=l&&l.debuglog?l.debuglog("stream"):function(){};var c,d,f,p=i(7327),m=i(1195),g=i(2457).getHighWaterMark,b=i(4281).q,v=b.ERR_INVALID_ARG_TYPE,y=b.ERR_STREAM_PUSH_AFTER_EOF,w=b.ERR_METHOD_NOT_IMPLEMENTED,_=b.ERR_STREAM_UNSHIFT_AFTER_END_EVENT;i(5717)(E,a);var M=m.errorOrDestroy,k=["error","close","destroy","pause","resume"];function x(t,e,n){r=r||i(6753),t=t||{},"boolean"!=typeof n&&(n=e instanceof r),this.objectMode=!!t.objectMode,n&&(this.objectMode=this.objectMode||!!t.readableObjectMode),this.highWaterMark=g(this,t,"readableHighWaterMark",n),this.buffer=new p,this.length=0,this.pipes=null,this.pipesCount=0,this.flowing=null,this.ended=!1,this.endEmitted=!1,this.reading=!1,this.sync=!0,this.needReadable=!1,this.emittedReadable=!1,this.readableListening=!1,this.resumeScheduled=!1,this.paused=!0,this.emitClose=!1!==t.emitClose,this.autoDestroy=!!t.autoDestroy,this.destroyed=!1,this.defaultEncoding=t.defaultEncoding||"utf8",this.awaitDrain=0,this.readingMore=!1,this.decoder=null,this.encoding=null,t.encoding&&(c||(c=i(2553).s),this.decoder=new c(t.encoding),this.encoding=t.encoding)}function E(t){if(r=r||i(6753),!(this instanceof E))return new E(t);var e=this instanceof r;this._readableState=new x(t,this,e),this.readable=!0,t&&("function"==typeof t.read&&(this._read=t.read),"function"==typeof t.destroy&&(this._destroy=t.destroy)),a.call(this)}function S(t,e,i,r,n){s("readableAddChunk",e);var o,a=t._readableState;if(null===e)a.reading=!1,function(t,e){if(s("onEofChunk"),!e.ended){if(e.decoder){var i=e.decoder.end();i&&i.length&&(e.buffer.push(i),e.length+=e.objectMode?1:i.length)}e.ended=!0,e.sync?C(t):(e.needReadable=!1,e.emittedReadable||(e.emittedReadable=!0,B(t)))}}(t,a);else if(n||(o=function(t,e){var i,r;return r=e,h.isBuffer(r)||r instanceof u||"string"==typeof e||void 0===e||t.objectMode||(i=new v("chunk",["string","Buffer","Uint8Array"],e)),i}(a,e)),o)M(t,o);else if(a.objectMode||e&&e.length>0)if("string"==typeof e||a.objectMode||Object.getPrototypeOf(e)===h.prototype||(e=function(t){return h.from(t)}(e)),r)a.endEmitted?M(t,new _):T(t,a,e,!0);else if(a.ended)M(t,new y);else{if(a.destroyed)return!1;a.reading=!1,a.decoder&&!i?(e=a.decoder.write(e),a.objectMode||0!==e.length?T(t,a,e,!1):R(t,a)):T(t,a,e,!1)}else r||(a.reading=!1,R(t,a));return!a.ended&&(a.lengthe.highWaterMark&&(e.highWaterMark=function(t){return t>=A?t=A:(t--,t|=t>>>1,t|=t>>>2,t|=t>>>4,t|=t>>>8,t|=t>>>16,t++),t}(t)),t<=e.length?t:e.ended?e.length:(e.needReadable=!0,0))}function C(t){var e=t._readableState;s("emitReadable",e.needReadable,e.emittedReadable),e.needReadable=!1,e.emittedReadable||(s("emitReadable",e.flowing),e.emittedReadable=!0,n.nextTick(B,t))}function B(t){var e=t._readableState;s("emitReadable_",e.destroyed,e.length,e.ended),e.destroyed||!e.length&&!e.ended||(t.emit("readable"),e.emittedReadable=!1),e.needReadable=!e.flowing&&!e.ended&&e.length<=e.highWaterMark,N(t)}function R(t,e){e.readingMore||(e.readingMore=!0,n.nextTick(P,t,e))}function P(t,e){for(;!e.reading&&!e.ended&&(e.length0,e.resumeScheduled&&!e.paused?e.flowing=!0:t.listenerCount("data")>0&&t.resume()}function O(t){s("readable nexttick read 0"),t.read(0)}function D(t,e){s("resume",e.reading),e.reading||t.read(0),e.resumeScheduled=!1,t.emit("resume"),N(t),e.flowing&&!e.reading&&t.read(0)}function N(t){var e=t._readableState;for(s("flow",e.flowing);e.flowing&&null!==t.read(););}function j(t,e){return 0===e.length?null:(e.objectMode?i=e.buffer.shift():!t||t>=e.length?(i=e.decoder?e.buffer.join(""):1===e.buffer.length?e.buffer.first():e.buffer.concat(e.length),e.buffer.clear()):i=e.buffer.consume(t,e.decoder),i);var i}function U(t){var e=t._readableState;s("endReadable",e.endEmitted),e.endEmitted||(e.ended=!0,n.nextTick(F,e,t))}function F(t,e){if(s("endReadableNT",t.endEmitted,t.length),!t.endEmitted&&0===t.length&&(t.endEmitted=!0,e.readable=!1,e.emit("end"),t.autoDestroy)){var i=e._writableState;(!i||i.autoDestroy&&i.finished)&&e.destroy()}}function q(t,e){for(var i=0,r=t.length;i=e.highWaterMark:e.length>0)||e.ended))return s("read: emitReadable",e.length,e.ended),0===e.length&&e.ended?U(this):C(this),null;if(0===(t=I(t,e))&&e.ended)return 0===e.length&&U(this),null;var r,n=e.needReadable;return s("need readable",n),(0===e.length||e.length-t0?j(t,e):null)?(e.needReadable=e.length<=e.highWaterMark,t=0):(e.length-=t,e.awaitDrain=0),0===e.length&&(e.ended||(e.needReadable=!0),i!==t&&e.ended&&U(this)),null!==r&&this.emit("data",r),r},E.prototype._read=function(t){M(this,new w("_read()"))},E.prototype.pipe=function(t,e){var i=this,r=this._readableState;switch(r.pipesCount){case 0:r.pipes=t;break;case 1:r.pipes=[r.pipes,t];break;default:r.pipes.push(t)}r.pipesCount+=1,s("pipe count=%d opts=%j",r.pipesCount,e);var a=e&&!1===e.end||t===n.stdout||t===n.stderr?m:h;function h(){s("onend"),t.end()}r.endEmitted?n.nextTick(a):i.once("end",a),t.on("unpipe",(function e(n,o){s("onunpipe"),n===i&&o&&!1===o.hasUnpiped&&(o.hasUnpiped=!0,s("cleanup"),t.removeListener("close",f),t.removeListener("finish",p),t.removeListener("drain",u),t.removeListener("error",d),t.removeListener("unpipe",e),i.removeListener("end",h),i.removeListener("end",m),i.removeListener("data",c),l=!0,!r.awaitDrain||t._writableState&&!t._writableState.needDrain||u())}));var u=function(t){return function(){var e=t._readableState;s("pipeOnDrain",e.awaitDrain),e.awaitDrain&&e.awaitDrain--,0===e.awaitDrain&&o(t,"data")&&(e.flowing=!0,N(t))}}(i);t.on("drain",u);var l=!1;function c(e){s("ondata");var n=t.write(e);s("dest.write",n),!1===n&&((1===r.pipesCount&&r.pipes===t||r.pipesCount>1&&-1!==q(r.pipes,t))&&!l&&(s("false write response, pause",r.awaitDrain),r.awaitDrain++),i.pause())}function d(e){s("onerror",e),m(),t.removeListener("error",d),0===o(t,"error")&&M(t,e)}function f(){t.removeListener("finish",p),m()}function p(){s("onfinish"),t.removeListener("close",f),m()}function m(){s("unpipe"),i.unpipe(t)}return i.on("data",c),function(t,e,i){if("function"==typeof t.prependListener)return t.prependListener(e,i);t._events&&t._events.error?Array.isArray(t._events.error)?t._events.error.unshift(i):t._events.error=[i,t._events.error]:t.on(e,i)}(t,"error",d),t.once("close",f),t.once("finish",p),t.emit("pipe",i),r.flowing||(s("pipe resume"),i.resume()),t},E.prototype.unpipe=function(t){var e=this._readableState,i={hasUnpiped:!1};if(0===e.pipesCount)return this;if(1===e.pipesCount)return t&&t!==e.pipes||(t||(t=e.pipes),e.pipes=null,e.pipesCount=0,e.flowing=!1,t&&t.emit("unpipe",this,i)),this;if(!t){var r=e.pipes,n=e.pipesCount;e.pipes=null,e.pipesCount=0,e.flowing=!1;for(var s=0;s0,!1!==r.flowing&&this.resume()):"readable"===t&&(r.endEmitted||r.readableListening||(r.readableListening=r.needReadable=!0,r.flowing=!1,r.emittedReadable=!1,s("on readable",r.length,r.reading),r.length?C(this):r.reading||n.nextTick(O,this))),i},E.prototype.addListener=E.prototype.on,E.prototype.removeListener=function(t,e){var i=a.prototype.removeListener.call(this,t,e);return"readable"===t&&n.nextTick(L,this),i},E.prototype.removeAllListeners=function(t){var e=a.prototype.removeAllListeners.apply(this,arguments);return"readable"!==t&&void 0!==t||n.nextTick(L,this),e},E.prototype.resume=function(){var t=this._readableState;return t.flowing||(s("resume"),t.flowing=!t.readableListening,function(t,e){e.resumeScheduled||(e.resumeScheduled=!0,n.nextTick(D,t,e))}(this,t)),t.paused=!1,this},E.prototype.pause=function(){return s("call pause flowing=%j",this._readableState.flowing),!1!==this._readableState.flowing&&(s("pause"),this._readableState.flowing=!1,this.emit("pause")),this._readableState.paused=!0,this},E.prototype.wrap=function(t){var e=this,i=this._readableState,r=!1;for(var n in t.on("end",(function(){if(s("wrapped end"),i.decoder&&!i.ended){var t=i.decoder.end();t&&t.length&&e.push(t)}e.push(null)})),t.on("data",(function(n){s("wrapped data"),i.decoder&&(n=i.decoder.write(n)),i.objectMode&&null==n||(i.objectMode||n&&n.length)&&(e.push(n)||(r=!0,t.pause()))})),t)void 0===this[n]&&"function"==typeof t[n]&&(this[n]=function(e){return function(){return t[e].apply(t,arguments)}}(n));for(var o=0;o{"use strict";t.exports=l;var r=i(4281).q,n=r.ERR_METHOD_NOT_IMPLEMENTED,s=r.ERR_MULTIPLE_CALLBACK,o=r.ERR_TRANSFORM_ALREADY_TRANSFORMING,a=r.ERR_TRANSFORM_WITH_LENGTH_0,h=i(6753);function u(t,e){var i=this._transformState;i.transforming=!1;var r=i.writecb;if(null===r)return this.emit("error",new s);i.writechunk=null,i.writecb=null,null!=e&&this.push(e),r(t);var n=this._readableState;n.reading=!1,(n.needReadable||n.length{"use strict";var r,n=i(9590);function s(t){var e=this;this.next=null,this.entry=null,this.finish=function(){!function(t,e,i){var r=t.entry;for(t.entry=null;r;){var n=r.callback;e.pendingcb--,n(undefined),r=r.next}e.corkedRequestsFree.next=t}(e,t)}}t.exports=E,E.WritableState=x;var o,a={deprecate:i(4927)},h=i(2503),u=i(8764).Buffer,l=i.g.Uint8Array||function(){},c=i(1195),d=i(2457).getHighWaterMark,f=i(4281).q,p=f.ERR_INVALID_ARG_TYPE,m=f.ERR_METHOD_NOT_IMPLEMENTED,g=f.ERR_MULTIPLE_CALLBACK,b=f.ERR_STREAM_CANNOT_PIPE,v=f.ERR_STREAM_DESTROYED,y=f.ERR_STREAM_NULL_VALUES,w=f.ERR_STREAM_WRITE_AFTER_END,_=f.ERR_UNKNOWN_ENCODING,M=c.errorOrDestroy;function k(){}function x(t,e,o){r=r||i(6753),t=t||{},"boolean"!=typeof o&&(o=e instanceof r),this.objectMode=!!t.objectMode,o&&(this.objectMode=this.objectMode||!!t.writableObjectMode),this.highWaterMark=d(this,t,"writableHighWaterMark",o),this.finalCalled=!1,this.needDrain=!1,this.ending=!1,this.ended=!1,this.finished=!1,this.destroyed=!1;var a=!1===t.decodeStrings;this.decodeStrings=!a,this.defaultEncoding=t.defaultEncoding||"utf8",this.length=0,this.writing=!1,this.corked=0,this.sync=!0,this.bufferProcessing=!1,this.onwrite=function(t){!function(t,e){var i=t._writableState,r=i.sync,s=i.writecb;if("function"!=typeof s)throw new g;if(function(t){t.writing=!1,t.writecb=null,t.length-=t.writelen,t.writelen=0}(i),e)!function(t,e,i,r,s){--e.pendingcb,i?(n.nextTick(s,r),n.nextTick(B,t,e),t._writableState.errorEmitted=!0,M(t,r)):(s(r),t._writableState.errorEmitted=!0,M(t,r),B(t,e))}(t,i,r,e,s);else{var o=I(i)||t.destroyed;o||i.corked||i.bufferProcessing||!i.bufferedRequest||A(t,i),r?n.nextTick(T,t,i,o,s):T(t,i,o,s)}}(e,t)},this.writecb=null,this.writelen=0,this.bufferedRequest=null,this.lastBufferedRequest=null,this.pendingcb=0,this.prefinished=!1,this.errorEmitted=!1,this.emitClose=!1!==t.emitClose,this.autoDestroy=!!t.autoDestroy,this.bufferedRequestCount=0,this.corkedRequestsFree=new s(this)}function E(t){var e=this instanceof(r=r||i(6753));if(!e&&!o.call(E,this))return new E(t);this._writableState=new x(t,this,e),this.writable=!0,t&&("function"==typeof t.write&&(this._write=t.write),"function"==typeof t.writev&&(this._writev=t.writev),"function"==typeof t.destroy&&(this._destroy=t.destroy),"function"==typeof t.final&&(this._final=t.final)),h.call(this)}function S(t,e,i,r,n,s,o){e.writelen=r,e.writecb=o,e.writing=!0,e.sync=!0,e.destroyed?e.onwrite(new v("write")):i?t._writev(n,e.onwrite):t._write(n,s,e.onwrite),e.sync=!1}function T(t,e,i,r){i||function(t,e){0===e.length&&e.needDrain&&(e.needDrain=!1,t.emit("drain"))}(t,e),e.pendingcb--,r(),B(t,e)}function A(t,e){e.bufferProcessing=!0;var i=e.bufferedRequest;if(t._writev&&i&&i.next){var r=e.bufferedRequestCount,n=new Array(r),o=e.corkedRequestsFree;o.entry=i;for(var a=0,h=!0;i;)n[a]=i,i.isBuf||(h=!1),i=i.next,a+=1;n.allBuffers=h,S(t,e,!0,e.length,n,"",o.finish),e.pendingcb++,e.lastBufferedRequest=null,o.next?(e.corkedRequestsFree=o.next,o.next=null):e.corkedRequestsFree=new s(e),e.bufferedRequestCount=0}else{for(;i;){var u=i.chunk,l=i.encoding,c=i.callback;if(S(t,e,!1,e.objectMode?1:u.length,u,l,c),i=i.next,e.bufferedRequestCount--,e.writing)break}null===i&&(e.lastBufferedRequest=null)}e.bufferedRequest=i,e.bufferProcessing=!1}function I(t){return t.ending&&0===t.length&&null===t.bufferedRequest&&!t.finished&&!t.writing}function C(t,e){t._final((function(i){e.pendingcb--,i&&M(t,i),e.prefinished=!0,t.emit("prefinish"),B(t,e)}))}function B(t,e){var i=I(e);if(i&&(function(t,e){e.prefinished||e.finalCalled||("function"!=typeof t._final||e.destroyed?(e.prefinished=!0,t.emit("prefinish")):(e.pendingcb++,e.finalCalled=!0,n.nextTick(C,t,e)))}(t,e),0===e.pendingcb&&(e.finished=!0,t.emit("finish"),e.autoDestroy))){var r=t._readableState;(!r||r.autoDestroy&&r.endEmitted)&&t.destroy()}return i}i(5717)(E,h),x.prototype.getBuffer=function(){for(var t=this.bufferedRequest,e=[];t;)e.push(t),t=t.next;return e},function(){try{Object.defineProperty(x.prototype,"buffer",{get:a.deprecate((function(){return this.getBuffer()}),"_writableState.buffer is deprecated. Use _writableState.getBuffer instead.","DEP0003")})}catch(t){}}(),"function"==typeof Symbol&&Symbol.hasInstance&&"function"==typeof Function.prototype[Symbol.hasInstance]?(o=Function.prototype[Symbol.hasInstance],Object.defineProperty(E,Symbol.hasInstance,{value:function(t){return!!o.call(this,t)||this===E&&t&&t._writableState instanceof x}})):o=function(t){return t instanceof this},E.prototype.pipe=function(){M(this,new b)},E.prototype.write=function(t,e,i){var r,s=this._writableState,o=!1,a=!s.objectMode&&(r=t,u.isBuffer(r)||r instanceof l);return a&&!u.isBuffer(t)&&(t=function(t){return u.from(t)}(t)),"function"==typeof e&&(i=e,e=null),a?e="buffer":e||(e=s.defaultEncoding),"function"!=typeof i&&(i=k),s.ending?function(t,e){var i=new w;M(t,i),n.nextTick(e,i)}(this,i):(a||function(t,e,i,r){var s;return null===i?s=new y:"string"==typeof i||e.objectMode||(s=new p("chunk",["string","Buffer"],i)),!s||(M(t,s),n.nextTick(r,s),!1)}(this,s,t,i))&&(s.pendingcb++,o=function(t,e,i,r,n,s){if(!i){var o=function(t,e,i){return t.objectMode||!1===t.decodeStrings||"string"!=typeof e||(e=u.from(e,i)),e}(e,r,n);r!==o&&(i=!0,n="buffer",r=o)}var a=e.objectMode?1:r.length;e.length+=a;var h=e.length-1))throw new _(t);return this._writableState.defaultEncoding=t,this},Object.defineProperty(E.prototype,"writableBuffer",{enumerable:!1,get:function(){return this._writableState&&this._writableState.getBuffer()}}),Object.defineProperty(E.prototype,"writableHighWaterMark",{enumerable:!1,get:function(){return this._writableState.highWaterMark}}),E.prototype._write=function(t,e,i){i(new m("_write()"))},E.prototype._writev=null,E.prototype.end=function(t,e,i){var r=this._writableState;return"function"==typeof t?(i=t,t=null,e=null):"function"==typeof e&&(i=e,e=null),null!=t&&this.write(t,e),r.corked&&(r.corked=1,this.uncork()),r.ending||function(t,e,i){e.ending=!0,B(t,e),i&&(e.finished?n.nextTick(i):t.once("finish",i)),e.ended=!0,t.writable=!1}(this,r,i),this},Object.defineProperty(E.prototype,"writableLength",{enumerable:!1,get:function(){return this._writableState.length}}),Object.defineProperty(E.prototype,"destroyed",{enumerable:!1,get:function(){return void 0!==this._writableState&&this._writableState.destroyed},set:function(t){this._writableState&&(this._writableState.destroyed=t)}}),E.prototype.destroy=c.destroy,E.prototype._undestroy=c.undestroy,E.prototype._destroy=function(t,e){e(t)}},5850:(t,e,i)=>{"use strict";var r,n=i(9590);function s(t,e,i){return e in t?Object.defineProperty(t,e,{value:i,enumerable:!0,configurable:!0,writable:!0}):t[e]=i,t}var o=i(8610),a=Symbol("lastResolve"),h=Symbol("lastReject"),u=Symbol("error"),l=Symbol("ended"),c=Symbol("lastPromise"),d=Symbol("handlePromise"),f=Symbol("stream");function p(t,e){return{value:t,done:e}}function m(t){var e=t[a];if(null!==e){var i=t[f].read();null!==i&&(t[c]=null,t[a]=null,t[h]=null,e(p(i,!1)))}}function g(t){n.nextTick(m,t)}var b=Object.getPrototypeOf((function(){})),v=Object.setPrototypeOf((s(r={get stream(){return this[f]},next:function(){var t=this,e=this[u];if(null!==e)return Promise.reject(e);if(this[l])return Promise.resolve(p(void 0,!0));if(this[f].destroyed)return new Promise((function(e,i){n.nextTick((function(){t[u]?i(t[u]):e(p(void 0,!0))}))}));var i,r=this[c];if(r)i=new Promise(function(t,e){return function(i,r){t.then((function(){e[l]?i(p(void 0,!0)):e[d](i,r)}),r)}}(r,this));else{var s=this[f].read();if(null!==s)return Promise.resolve(p(s,!1));i=new Promise(this[d])}return this[c]=i,i}},Symbol.asyncIterator,(function(){return this})),s(r,"return",(function(){var t=this;return new Promise((function(e,i){t[f].destroy(null,(function(t){t?i(t):e(p(void 0,!0))}))}))})),r),b);t.exports=function(t){var e,i=Object.create(v,(s(e={},f,{value:t,writable:!0}),s(e,a,{value:null,writable:!0}),s(e,h,{value:null,writable:!0}),s(e,u,{value:null,writable:!0}),s(e,l,{value:t._readableState.endEmitted,writable:!0}),s(e,d,{value:function(t,e){var r=i[f].read();r?(i[c]=null,i[a]=null,i[h]=null,t(p(r,!1))):(i[a]=t,i[h]=e)},writable:!0}),e));return i[c]=null,o(t,(function(t){if(t&&"ERR_STREAM_PREMATURE_CLOSE"!==t.code){var e=i[h];return null!==e&&(i[c]=null,i[a]=null,i[h]=null,e(t)),void(i[u]=t)}var r=i[a];null!==r&&(i[c]=null,i[a]=null,i[h]=null,r(p(void 0,!0))),i[l]=!0})),t.on("readable",g.bind(null,i)),i}},7327:(t,e,i)=>{"use strict";function r(t,e){var i=Object.keys(t);if(Object.getOwnPropertySymbols){var r=Object.getOwnPropertySymbols(t);e&&(r=r.filter((function(e){return Object.getOwnPropertyDescriptor(t,e).enumerable}))),i.push.apply(i,r)}return i}function n(t,e,i){return e in t?Object.defineProperty(t,e,{value:i,enumerable:!0,configurable:!0,writable:!0}):t[e]=i,t}function s(t,e){for(var i=0;i0?this.tail.next=e:this.head=e,this.tail=e,++this.length}},{key:"unshift",value:function(t){var e={data:t,next:this.head};0===this.length&&(this.tail=e),this.head=e,++this.length}},{key:"shift",value:function(){if(0!==this.length){var t=this.head.data;return 1===this.length?this.head=this.tail=null:this.head=this.head.next,--this.length,t}}},{key:"clear",value:function(){this.head=this.tail=null,this.length=0}},{key:"join",value:function(t){if(0===this.length)return"";for(var e=this.head,i=""+e.data;e=e.next;)i+=t+e.data;return i}},{key:"concat",value:function(t){if(0===this.length)return o.alloc(0);for(var e,i,r,n=o.allocUnsafe(t>>>0),s=this.head,a=0;s;)e=s.data,i=n,r=a,o.prototype.copy.call(e,i,r),a+=s.data.length,s=s.next;return n}},{key:"consume",value:function(t,e){var i;return tn.length?n.length:t;if(s===n.length?r+=n:r+=n.slice(0,t),0==(t-=s)){s===n.length?(++i,e.next?this.head=e.next:this.head=this.tail=null):(this.head=e,e.data=n.slice(s));break}++i}return this.length-=i,r}},{key:"_getBuffer",value:function(t){var e=o.allocUnsafe(t),i=this.head,r=1;for(i.data.copy(e),t-=i.data.length;i=i.next;){var n=i.data,s=t>n.length?n.length:t;if(n.copy(e,e.length-t,0,s),0==(t-=s)){s===n.length?(++r,i.next?this.head=i.next:this.head=this.tail=null):(this.head=i,i.data=n.slice(s));break}++r}return this.length-=r,e}},{key:h,value:function(t,e){return a(this,function(t){for(var e=1;e{"use strict";var r=i(9590);function n(t,e){o(t,e),s(t)}function s(t){t._writableState&&!t._writableState.emitClose||t._readableState&&!t._readableState.emitClose||t.emit("close")}function o(t,e){t.emit("error",e)}t.exports={destroy:function(t,e){var i=this,a=this._readableState&&this._readableState.destroyed,h=this._writableState&&this._writableState.destroyed;return a||h?(e?e(t):t&&(this._writableState?this._writableState.errorEmitted||(this._writableState.errorEmitted=!0,r.nextTick(o,this,t)):r.nextTick(o,this,t)),this):(this._readableState&&(this._readableState.destroyed=!0),this._writableState&&(this._writableState.destroyed=!0),this._destroy(t||null,(function(t){!e&&t?i._writableState?i._writableState.errorEmitted?r.nextTick(s,i):(i._writableState.errorEmitted=!0,r.nextTick(n,i,t)):r.nextTick(n,i,t):e?(r.nextTick(s,i),e(t)):r.nextTick(s,i)})),this)},undestroy:function(){this._readableState&&(this._readableState.destroyed=!1,this._readableState.reading=!1,this._readableState.ended=!1,this._readableState.endEmitted=!1),this._writableState&&(this._writableState.destroyed=!1,this._writableState.ended=!1,this._writableState.ending=!1,this._writableState.finalCalled=!1,this._writableState.prefinished=!1,this._writableState.finished=!1,this._writableState.errorEmitted=!1)},errorOrDestroy:function(t,e){var i=t._readableState,r=t._writableState;i&&i.autoDestroy||r&&r.autoDestroy?t.destroy(e):t.emit("error",e)}}},8610:(t,e,i)=>{"use strict";var r=i(4281).q.ERR_STREAM_PREMATURE_CLOSE;function n(){}t.exports=function t(e,i,s){if("function"==typeof i)return t(e,null,i);i||(i={}),s=function(t){var e=!1;return function(){if(!e){e=!0;for(var i=arguments.length,r=new Array(i),n=0;n{t.exports=function(){throw new Error("Readable.from is not available in the browser")}},9946:(t,e,i)=>{"use strict";var r,n=i(4281).q,s=n.ERR_MISSING_ARGS,o=n.ERR_STREAM_DESTROYED;function a(t){if(t)throw t}function h(t,e,n,s){s=function(t){var e=!1;return function(){e||(e=!0,t.apply(void 0,arguments))}}(s);var a=!1;t.on("close",(function(){a=!0})),void 0===r&&(r=i(8610)),r(t,{readable:e,writable:n},(function(t){if(t)return s(t);a=!0,s()}));var h=!1;return function(e){if(!a&&!h)return h=!0,function(t){return t.setHeader&&"function"==typeof t.abort}(t)?t.abort():"function"==typeof t.destroy?t.destroy():void s(e||new o("pipe"))}}function u(t){t()}function l(t,e){return t.pipe(e)}function c(t){return t.length?"function"!=typeof t[t.length-1]?a:t.pop():a}t.exports=function(){for(var t=arguments.length,e=new Array(t),i=0;i0,(function(t){r||(r=t),t&&o.forEach(u),s||(o.forEach(u),n(r))}))}));return e.reduce(l)}},2457:(t,e,i)=>{"use strict";var r=i(4281).q.ERR_INVALID_OPT_VALUE;t.exports={getHighWaterMark:function(t,e,i,n){var s=function(t,e,i){return null!=t.highWaterMark?t.highWaterMark:e?t[i]:null}(e,n,i);if(null!=s){if(!isFinite(s)||Math.floor(s)!==s||s<0)throw new r(n?i:"highWaterMark",s);return Math.floor(s)}return t.objectMode?16:16384}}},2503:(t,e,i)=>{t.exports=i(7187).EventEmitter},8473:(t,e,i)=>{(e=t.exports=i(9481)).Stream=e,e.Readable=e,e.Writable=i(4229),e.Duplex=i(6753),e.Transform=i(4605),e.PassThrough=i(2725),e.finished=i(8610),e.pipeline=i(9946)},38:(t,e,i)=>{e.render=function(t,e,i,r){"function"==typeof i&&(r=i,i={}),i||(i={}),r||(r=()=>{}),y(t),w(i),"string"==typeof e&&(e=document.querySelector(e)),b(t,(r=>{if(e.nodeName!==r.toUpperCase()){const i=o.extname(t.name).toLowerCase();throw new Error(`Cannot render "${i}" inside a "${e.nodeName.toLowerCase()}" element, expected "${r}"`)}return"video"!==r&&"audio"!==r||_(e,i),e}),i,r)},e.append=function(t,e,i,r){if("function"==typeof i&&(r=i,i={}),i||(i={}),r||(r=()=>{}),y(t),w(i),"string"==typeof e&&(e=document.querySelector(e)),e&&("VIDEO"===e.nodeName||"AUDIO"===e.nodeName))throw new Error("Invalid video/audio node argument. Argument must be root element that video/audio tag will be appended to.");function n(t){const i=document.createElement(t);return e.appendChild(i),i}b(t,(function(t){return"video"===t||"audio"===t?function(t){const r=n(t);return _(r,i),e.appendChild(r),r}(t):n(t)}),i,(function(t,e){t&&e&&e.remove(),r(t,e)}))},e.mime=i(876);const r=i(1227)("render-media"),n=i(4264),s=i(6567),o=i(6470),a=i(8677),h=i(7235),u=[".m4a",".m4b",".m4p",".m4v",".mp4"],l=[".m4v",".mkv",".mp4",".webm"],c=[].concat(l,[".m4a",".m4b",".m4p",".mp3"]),d=[".mov",".ogv"],f=[".aac",".oga",".ogg",".wav",".flac"],p=[".bmp",".gif",".jpeg",".jpg",".png",".svg"],m=[".css",".html",".js",".md",".pdf",".srt",".txt"],g="undefined"!=typeof window&&window.MediaSource;function b(t,e,i,a){const b=o.extname(t.name).toLowerCase();let y,w=0;function _(){return!("number"==typeof t.length&&t.length>i.maxBlobLength&&(r("File length too large for Blob URL approach: %d (max: %d)",t.length,i.maxBlobLength),S(new Error(`File length too large for Blob URL approach: ${t.length} (max: ${i.maxBlobLength})`)),1))}function M(i){_()&&(y=e(i),v(t,((t,e)=>{if(t)return S(t);y.addEventListener("error",S),y.addEventListener("loadstart",k),y.addEventListener("loadedmetadata",x),y.src=e})))}function k(){if(y.removeEventListener("loadstart",k),i.autoplay){const t=y.play();void 0!==t&&t.catch(S)}}function x(){y.removeEventListener("loadedmetadata",x),a(null,y)}function E(){v(t,((t,i)=>{if(t)return S(t);".pdf"!==b?(y=e("iframe"),y.sandbox="allow-forms allow-scripts",y.src=i):(y=e("object"),y.setAttribute("typemustmatch",!0),y.setAttribute("type","application/pdf"),y.setAttribute("data",i)),a(null,y)}))}function S(e){e.message=`Error rendering file "${t.name}": ${e.message}`,r(e.message),a(e)}c.includes(b)?function(){const i=l.includes(b)?"video":"audio";function n(){r(`Use MediaSource API for ${t.name}`),f(),y.addEventListener("error",d),y.addEventListener("loadstart",k),y.addEventListener("loadedmetadata",x);const e=new s(y).createWriteStream((i=t.name,{".m4a":'audio/mp4; codecs="mp4a.40.5"',".m4b":'audio/mp4; codecs="mp4a.40.5"',".m4p":'audio/mp4; codecs="mp4a.40.5"',".m4v":'video/mp4; codecs="avc1.640029, mp4a.40.5"',".mkv":'video/webm; codecs="avc1.640029, mp4a.40.5"',".mp3":"audio/mpeg",".mp4":'video/mp4; codecs="avc1.640029, mp4a.40.5"',".webm":'video/webm; codecs="vorbis, vp8"'}[o.extname(i).toLowerCase()]));var i;t.createReadStream().pipe(e),w&&(y.currentTime=w)}function a(){r(`Use Blob URL for ${t.name}`),f(),y.addEventListener("error",S),y.addEventListener("loadstart",k),y.addEventListener("loadedmetadata",x),v(t,((t,e)=>{if(t)return S(t);y.src=e,w&&(y.currentTime=w)}))}function c(t){r("videostream error: fallback to MediaSource API: %o",t.message||t),y.removeEventListener("error",c),y.removeEventListener("loadedmetadata",x),n()}function d(t){r("MediaSource API error: fallback to Blob URL: %o",t.message||t),_()&&(y.removeEventListener("error",d),y.removeEventListener("loadedmetadata",x),a())}function f(){y||(y=e(i),y.addEventListener("progress",(()=>{w=y.currentTime})))}g?u.includes(b)?(r(`Use \`videostream\` package for ${t.name}`),f(),y.addEventListener("error",c),y.addEventListener("loadstart",k),y.addEventListener("loadedmetadata",x),new h(t,y)):n():a()}():d.includes(b)?M("video"):f.includes(b)?M("audio"):p.includes(b)?(y=e("img"),v(t,((e,i)=>{if(e)return S(e);y.src=i,y.alt=t.name,a(null,y)}))):m.includes(b)?E():function(){r('Unknown file extension "%s" - will attempt to render into iframe',b);let e="";t.createReadStream({start:0,end:1e3}).setEncoding("utf8").on("data",(t=>{e+=t})).on("end",(function(){n(e)?(r('File extension "%s" appears ascii, so will render.',b),E()):(r('File extension "%s" appears non-ascii, will not render.',b),a(new Error(`Unsupported file type "${b}": Cannot append to DOM`)))})).on("error",a)}()}function v(t,i){const r=o.extname(t.name).toLowerCase();a(t.createReadStream(),e.mime[r]).then((t=>i(null,t)),(t=>i(t)))}function y(t){if(null==t)throw new Error("file cannot be null or undefined");if("string"!=typeof t.name)throw new Error("missing or invalid file.name property");if("function"!=typeof t.createReadStream)throw new Error("missing or invalid file.createReadStream property")}function w(t){null==t.autoplay&&(t.autoplay=!1),null==t.muted&&(t.muted=!1),null==t.controls&&(t.controls=!0),null==t.maxBlobLength&&(t.maxBlobLength=2e8)}function _(t,e){t.autoplay=!!e.autoplay,t.muted=!!e.muted,t.controls=!!e.controls}},9785:(t,e,i)=>{"use strict";var r=i(8764).Buffer,n=i(5717),s=i(3349),o=new Array(16),a=[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],h=[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],u=[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],l=[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],c=[0,1518500249,1859775393,2400959708,2840853838],d=[1352829926,1548603684,1836072691,2053994217,0];function f(){s.call(this,64),this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520}function p(t,e){return t<>>32-e}function m(t,e,i,r,n,s,o,a){return p(t+(e^i^r)+s+o|0,a)+n|0}function g(t,e,i,r,n,s,o,a){return p(t+(e&i|~e&r)+s+o|0,a)+n|0}function b(t,e,i,r,n,s,o,a){return p(t+((e|~i)^r)+s+o|0,a)+n|0}function v(t,e,i,r,n,s,o,a){return p(t+(e&r|i&~r)+s+o|0,a)+n|0}function y(t,e,i,r,n,s,o,a){return p(t+(e^(i|~r))+s+o|0,a)+n|0}n(f,s),f.prototype._update=function(){for(var t=o,e=0;e<16;++e)t[e]=this._block.readInt32LE(4*e);for(var i=0|this._a,r=0|this._b,n=0|this._c,s=0|this._d,f=0|this._e,w=0|this._a,_=0|this._b,M=0|this._c,k=0|this._d,x=0|this._e,E=0;E<80;E+=1){var S,T;E<16?(S=m(i,r,n,s,f,t[a[E]],c[0],u[E]),T=y(w,_,M,k,x,t[h[E]],d[0],l[E])):E<32?(S=g(i,r,n,s,f,t[a[E]],c[1],u[E]),T=v(w,_,M,k,x,t[h[E]],d[1],l[E])):E<48?(S=b(i,r,n,s,f,t[a[E]],c[2],u[E]),T=b(w,_,M,k,x,t[h[E]],d[2],l[E])):E<64?(S=v(i,r,n,s,f,t[a[E]],c[3],u[E]),T=g(w,_,M,k,x,t[h[E]],d[3],l[E])):(S=y(i,r,n,s,f,t[a[E]],c[4],u[E]),T=m(w,_,M,k,x,t[h[E]],d[4],l[E])),i=f,f=s,s=p(n,10),n=r,r=S,w=x,x=k,k=p(M,10),M=_,_=T}var A=this._b+n+k|0;this._b=this._c+s+x|0,this._c=this._d+f+w|0,this._d=this._e+i+_|0,this._e=this._a+r+M|0,this._a=A},f.prototype._digest=function(){this._block[this._blockOffset++]=128,this._blockOffset>56&&(this._block.fill(0,this._blockOffset,64),this._update(),this._blockOffset=0),this._block.fill(0,this._blockOffset,56),this._block.writeUInt32LE(this._length[0],56),this._block.writeUInt32LE(this._length[1],60),this._update();var t=r.alloc?r.alloc(20):new r(20);return t.writeInt32LE(this._a,0),t.writeInt32LE(this._b,4),t.writeInt32LE(this._c,8),t.writeInt32LE(this._d,12),t.writeInt32LE(this._e,16),t},t.exports=f},9967:(t,e,i)=>{t.exports=function(t,e,i){if("number"!=typeof e)throw new Error("second argument must be a Number");let n,s,o,a,h,u,l=!0;function c(t){function e(){i&&i(t,n),i=null}l?r(e):e()}function d(e,i,r){if(n[e]=r,i&&(h=!0),0==--o||i)c(i);else if(!h&&u{t.exports=function(t,e){let i,n,s,o=!0;function a(t){function n(){e&&e(t,i),e=null}o?r(n):n()}function h(t,e,r){i[t]=r,(0==--n||e)&&a(e)}Array.isArray(t)?(i=[],n=t.length):(s=Object.keys(t),i={},n=s.length),n?s?s.forEach((function(e){t[e]((function(t,i){h(e,t,i)}))})):t.forEach((function(t,e){t((function(t,i){h(e,t,i)}))})):a(null),o=!1};const r=i(4375)},4029:function(t,e,i){var r,n=i(5108);"undefined"!=typeof self&&self,r=function(){return function(t){var e={};function i(r){if(e[r])return e[r].exports;var n=e[r]={i:r,l:!1,exports:{}};return t[r].call(n.exports,n,n.exports,i),n.l=!0,n.exports}return i.m=t,i.c=e,i.d=function(t,e,r){i.o(t,e)||Object.defineProperty(t,e,{configurable:!1,enumerable:!0,get:r})},i.n=function(t){var e=t&&t.__esModule?function(){return t.default}:function(){return t};return i.d(e,"a",e),e},i.o=function(t,e){return Object.prototype.hasOwnProperty.call(t,e)},i.p="",i(i.s=3)}([function(t,e,i){var r=i(5),n=i(1),s=n.toHex,o=n.ceilHeapSize,a=i(6),h=function(t){for(t+=9;t%64>0;t+=1);return t},u=function(t,e){var i=new Int32Array(t,e+320,5),r=new Int32Array(5),n=new DataView(r.buffer);return n.setInt32(0,i[0],!1),n.setInt32(4,i[1],!1),n.setInt32(8,i[2],!1),n.setInt32(12,i[3],!1),n.setInt32(16,i[4],!1),r},l=function(){function t(e){if(function(t,e){if(!(t instanceof e))throw new TypeError("Cannot call a class as a function")}(this,t),(e=e||65536)%64>0)throw new Error("Chunk size must be a multiple of 128 bit");this._offset=0,this._maxChunkLen=e,this._padMaxChunkLen=h(e),this._heap=new ArrayBuffer(o(this._padMaxChunkLen+320+20)),this._h32=new Int32Array(this._heap),this._h8=new Int8Array(this._heap),this._core=new r({Int32Array},{},this._heap)}return t.prototype._initState=function(t,e){this._offset=0;var i=new Int32Array(t,e+320,5);i[0]=1732584193,i[1]=-271733879,i[2]=-1732584194,i[3]=271733878,i[4]=-1009589776},t.prototype._padChunk=function(t,e){var i=h(t),r=new Int32Array(this._heap,0,i>>2);return function(t,e){var i=new Uint8Array(t.buffer),r=e%4,n=e-r;switch(r){case 0:i[n+3]=0;case 1:i[n+2]=0;case 2:i[n+1]=0;case 3:i[n+0]=0}for(var s=1+(e>>2);s>2]|=128<<24-(e%4<<3),t[14+(2+(e>>2)&-16)]=i/(1<<29)|0,t[15+(2+(e>>2)&-16)]=i<<3}(r,t,e),i},t.prototype._write=function(t,e,i,r){a(t,this._h8,this._h32,e,i,r||0)},t.prototype._coreCall=function(t,e,i,r,n){var s=i;this._write(t,e,i),n&&(s=this._padChunk(i,r)),this._core.hash(s,this._padMaxChunkLen)},t.prototype.rawDigest=function(t){var e=t.byteLength||t.length||t.size||0;this._initState(this._heap,this._padMaxChunkLen);var i=0,r=this._maxChunkLen;for(i=0;e>i+r;i+=r)this._coreCall(t,i,r,e,!1);return this._coreCall(t,i,e-i,e,!0),u(this._heap,this._padMaxChunkLen)},t.prototype.digest=function(t){return s(this.rawDigest(t).buffer)},t.prototype.digestFromString=function(t){return this.digest(t)},t.prototype.digestFromBuffer=function(t){return this.digest(t)},t.prototype.digestFromArrayBuffer=function(t){return this.digest(t)},t.prototype.resetState=function(){return this._initState(this._heap,this._padMaxChunkLen),this},t.prototype.append=function(t){var e=0,i=t.byteLength||t.length||t.size||0,r=this._offset%this._maxChunkLen,n=void 0;for(this._offset+=i;e0}),!1)}t.exports=function(t,e){e=e||{};var n={main:i.m},s=e.all?{main:Object.keys(n)}:function(t,e){for(var i={main:[e]},r={main:[]},n={main:{}};h(i);)for(var s=Object.keys(i),o=0;o>2]|0;a=r[e+324>>2]|0;u=r[e+328>>2]|0;c=r[e+332>>2]|0;f=r[e+336>>2]|0;for(i=0;(i|0)<(t|0);i=i+64|0){o=s;h=a;l=u;d=c;p=f;for(n=0;(n|0)<64;n=n+4|0){g=r[i+n>>2]|0;m=((s<<5|s>>>27)+(a&u|~a&c)|0)+((g+f|0)+1518500249|0)|0;f=c;c=u;u=a<<30|a>>>2;a=s;s=m;r[t+n>>2]=g}for(n=t+64|0;(n|0)<(t+80|0);n=n+4|0){g=(r[n-12>>2]^r[n-32>>2]^r[n-56>>2]^r[n-64>>2])<<1|(r[n-12>>2]^r[n-32>>2]^r[n-56>>2]^r[n-64>>2])>>>31;m=((s<<5|s>>>27)+(a&u|~a&c)|0)+((g+f|0)+1518500249|0)|0;f=c;c=u;u=a<<30|a>>>2;a=s;s=m;r[n>>2]=g}for(n=t+80|0;(n|0)<(t+160|0);n=n+4|0){g=(r[n-12>>2]^r[n-32>>2]^r[n-56>>2]^r[n-64>>2])<<1|(r[n-12>>2]^r[n-32>>2]^r[n-56>>2]^r[n-64>>2])>>>31;m=((s<<5|s>>>27)+(a^u^c)|0)+((g+f|0)+1859775393|0)|0;f=c;c=u;u=a<<30|a>>>2;a=s;s=m;r[n>>2]=g}for(n=t+160|0;(n|0)<(t+240|0);n=n+4|0){g=(r[n-12>>2]^r[n-32>>2]^r[n-56>>2]^r[n-64>>2])<<1|(r[n-12>>2]^r[n-32>>2]^r[n-56>>2]^r[n-64>>2])>>>31;m=((s<<5|s>>>27)+(a&u|a&c|u&c)|0)+((g+f|0)-1894007588|0)|0;f=c;c=u;u=a<<30|a>>>2;a=s;s=m;r[n>>2]=g}for(n=t+240|0;(n|0)<(t+320|0);n=n+4|0){g=(r[n-12>>2]^r[n-32>>2]^r[n-56>>2]^r[n-64>>2])<<1|(r[n-12>>2]^r[n-32>>2]^r[n-56>>2]^r[n-64>>2])>>>31;m=((s<<5|s>>>27)+(a^u^c)|0)+((g+f|0)-899497514|0)|0;f=c;c=u;u=a<<30|a>>>2;a=s;s=m;r[n>>2]=g}s=s+o|0;a=a+h|0;u=u+l|0;c=c+d|0;f=f+p|0}r[e+320>>2]=s;r[e+324>>2]=a;r[e+328>>2]=u;r[e+332>>2]=c;r[e+336>>2]=f}return{hash:n}}},function(t,e){var i=this,r=void 0;"undefined"!=typeof self&&void 0!==self.FileReaderSync&&(r=new self.FileReaderSync);var n=function(t,e,i,r,n,s){var o=void 0,a=s%4,h=(n+a)%4,u=n-h;switch(a){case 0:e[s]=t[r+3];case 1:e[s+1-(a<<1)|0]=t[r+2];case 2:e[s+2-(a<<1)|0]=t[r+1];case 3:e[s+3-(a<<1)|0]=t[r]}if(!(n>2|0]=t[r+o]<<24|t[r+o+1]<<16|t[r+o+2]<<8|t[r+o+3];switch(h){case 3:e[s+u+1|0]=t[r+u+2];case 2:e[s+u+2|0]=t[r+u+1];case 1:e[s+u+3|0]=t[r+u]}}};t.exports=function(t,e,s,o,a,h){if("string"==typeof t)return function(t,e,i,r,n,s){var o=void 0,a=s%4,h=(n+a)%4,u=n-h;switch(a){case 0:e[s]=t.charCodeAt(r+3);case 1:e[s+1-(a<<1)|0]=t.charCodeAt(r+2);case 2:e[s+2-(a<<1)|0]=t.charCodeAt(r+1);case 3:e[s+3-(a<<1)|0]=t.charCodeAt(r)}if(!(n>2]=t.charCodeAt(r+o)<<24|t.charCodeAt(r+o+1)<<16|t.charCodeAt(r+o+2)<<8|t.charCodeAt(r+o+3);switch(h){case 3:e[s+u+1|0]=t.charCodeAt(r+u+2);case 2:e[s+u+2|0]=t.charCodeAt(r+u+1);case 1:e[s+u+3|0]=t.charCodeAt(r+u)}}}(t,e,s,o,a,h);if(t instanceof Array)return n(t,e,s,o,a,h);if(i&&i.Buffer&&i.Buffer.isBuffer(t))return n(t,e,s,o,a,h);if(t instanceof ArrayBuffer)return n(new Uint8Array(t),e,s,o,a,h);if(t.buffer instanceof ArrayBuffer)return n(new Uint8Array(t.buffer,t.byteOffset,t.byteLength),e,s,o,a,h);if(t instanceof Blob)return function(t,e,i,n,s,o){var a=void 0,h=o%4,u=(s+h)%4,l=s-u,c=new Uint8Array(r.readAsArrayBuffer(t.slice(n,n+s)));switch(h){case 0:e[o]=c[3];case 1:e[o+1-(h<<1)|0]=c[2];case 2:e[o+2-(h<<1)|0]=c[1];case 3:e[o+3-(h<<1)|0]=c[0]}if(!(s>2|0]=c[a]<<24|c[a+1]<<16|c[a+2]<<8|c[a+3];switch(u){case 3:e[o+l+1|0]=c[l+2];case 2:e[o+l+2|0]=c[l+1];case 1:e[o+l+3|0]=c[l]}}}(t,e,s,o,a,h);throw new Error("Unsupported data type.")}},function(t,e,i){var r=function(){function t(t,e){for(var i=0;i{var r=i(8764),n=r.Buffer;function s(t,e){for(var i in t)e[i]=t[i]}function o(t,e,i){return n(t,e,i)}n.from&&n.alloc&&n.allocUnsafe&&n.allocUnsafeSlow?t.exports=r:(s(r,e),e.Buffer=o),o.prototype=Object.create(n.prototype),s(n,o),o.from=function(t,e,i){if("number"==typeof t)throw new TypeError("Argument must not be a number");return n(t,e,i)},o.alloc=function(t,e,i){if("number"!=typeof t)throw new TypeError("Argument must be a number");var r=n(t);return void 0!==e?"string"==typeof i?r.fill(e,i):r.fill(e):r.fill(0),r},o.allocUnsafe=function(t){if("number"!=typeof t)throw new TypeError("Argument must be a number");return n(t)},o.allocUnsafeSlow=function(t){if("number"!=typeof t)throw new TypeError("Argument must be a number");return r.SlowBuffer(t)}},2399:(t,e,i)=>{"use strict";var r,n=i(9590),s=i(8764),o=s.Buffer,a={};for(r in s)s.hasOwnProperty(r)&&"SlowBuffer"!==r&&"Buffer"!==r&&(a[r]=s[r]);var h=a.Buffer={};for(r in o)o.hasOwnProperty(r)&&"allocUnsafe"!==r&&"allocUnsafeSlow"!==r&&(h[r]=o[r]);if(a.Buffer.prototype=o.prototype,h.from&&h.from!==Uint8Array.from||(h.from=function(t,e,i){if("number"==typeof t)throw new TypeError('The "value" argument must not be of type number. Received type '+typeof t);if(t&&void 0===t.length)throw new TypeError("The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type "+typeof t);return o(t,e,i)}),h.alloc||(h.alloc=function(t,e,i){if("number"!=typeof t)throw new TypeError('The "size" argument must be of type number. Received type '+typeof t);if(t<0||t>=2*(1<<30))throw new RangeError('The value "'+t+'" is invalid for option "size"');var r=o(t);return e&&0!==e.length?"string"==typeof i?r.fill(e,i):r.fill(e):r.fill(0),r}),!a.kStringMaxLength)try{a.kStringMaxLength=n.binding("buffer").kStringMaxLength}catch(t){}a.constants||(a.constants={MAX_LENGTH:a.kMaxLength},a.kStringMaxLength&&(a.constants.MAX_STRING_LENGTH=a.kStringMaxLength)),t.exports=a},4189:(t,e,i)=>{var r=i(9509).Buffer;function n(t,e){this._block=r.alloc(t),this._finalSize=e,this._blockSize=t,this._len=0}n.prototype.update=function(t,e){"string"==typeof t&&(e=e||"utf8",t=r.from(t,e));for(var i=this._block,n=this._blockSize,s=t.length,o=this._len,a=0;a=this._finalSize&&(this._update(this._block),this._block.fill(0));var i=8*this._len;if(i<=4294967295)this._block.writeUInt32BE(i,this._blockSize-4);else{var r=(4294967295&i)>>>0,n=(i-r)/4294967296;this._block.writeUInt32BE(n,this._blockSize-8),this._block.writeUInt32BE(r,this._blockSize-4)}this._update(this._block);var s=this._hash();return t?s.toString(t):s},n.prototype._update=function(){throw new Error("_update must be implemented by subclass")},t.exports=n},9072:(t,e,i)=>{var r=t.exports=function(t){t=t.toLowerCase();var e=r[t];if(!e)throw new Error(t+" is not supported (we accept pull requests)");return new e};r.sha=i(4448),r.sha1=i(8336),r.sha224=i(8432),r.sha256=i(7499),r.sha384=i(1686),r.sha512=i(7816)},4448:(t,e,i)=>{var r=i(5717),n=i(4189),s=i(9509).Buffer,o=[1518500249,1859775393,-1894007588,-899497514],a=new Array(80);function h(){this.init(),this._w=a,n.call(this,64,56)}function u(t){return t<<30|t>>>2}function l(t,e,i,r){return 0===t?e&i|~e&r:2===t?e&i|e&r|i&r:e^i^r}r(h,n),h.prototype.init=function(){return this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520,this},h.prototype._update=function(t){for(var e,i=this._w,r=0|this._a,n=0|this._b,s=0|this._c,a=0|this._d,h=0|this._e,c=0;c<16;++c)i[c]=t.readInt32BE(4*c);for(;c<80;++c)i[c]=i[c-3]^i[c-8]^i[c-14]^i[c-16];for(var d=0;d<80;++d){var f=~~(d/20),p=0|((e=r)<<5|e>>>27)+l(f,n,s,a)+h+i[d]+o[f];h=a,a=s,s=u(n),n=r,r=p}this._a=r+this._a|0,this._b=n+this._b|0,this._c=s+this._c|0,this._d=a+this._d|0,this._e=h+this._e|0},h.prototype._hash=function(){var t=s.allocUnsafe(20);return t.writeInt32BE(0|this._a,0),t.writeInt32BE(0|this._b,4),t.writeInt32BE(0|this._c,8),t.writeInt32BE(0|this._d,12),t.writeInt32BE(0|this._e,16),t},t.exports=h},8336:(t,e,i)=>{var r=i(5717),n=i(4189),s=i(9509).Buffer,o=[1518500249,1859775393,-1894007588,-899497514],a=new Array(80);function h(){this.init(),this._w=a,n.call(this,64,56)}function u(t){return t<<5|t>>>27}function l(t){return t<<30|t>>>2}function c(t,e,i,r){return 0===t?e&i|~e&r:2===t?e&i|e&r|i&r:e^i^r}r(h,n),h.prototype.init=function(){return this._a=1732584193,this._b=4023233417,this._c=2562383102,this._d=271733878,this._e=3285377520,this},h.prototype._update=function(t){for(var e,i=this._w,r=0|this._a,n=0|this._b,s=0|this._c,a=0|this._d,h=0|this._e,d=0;d<16;++d)i[d]=t.readInt32BE(4*d);for(;d<80;++d)i[d]=(e=i[d-3]^i[d-8]^i[d-14]^i[d-16])<<1|e>>>31;for(var f=0;f<80;++f){var p=~~(f/20),m=u(r)+c(p,n,s,a)+h+i[f]+o[p]|0;h=a,a=s,s=l(n),n=r,r=m}this._a=r+this._a|0,this._b=n+this._b|0,this._c=s+this._c|0,this._d=a+this._d|0,this._e=h+this._e|0},h.prototype._hash=function(){var t=s.allocUnsafe(20);return t.writeInt32BE(0|this._a,0),t.writeInt32BE(0|this._b,4),t.writeInt32BE(0|this._c,8),t.writeInt32BE(0|this._d,12),t.writeInt32BE(0|this._e,16),t},t.exports=h},8432:(t,e,i)=>{var r=i(5717),n=i(7499),s=i(4189),o=i(9509).Buffer,a=new Array(64);function h(){this.init(),this._w=a,s.call(this,64,56)}r(h,n),h.prototype.init=function(){return this._a=3238371032,this._b=914150663,this._c=812702999,this._d=4144912697,this._e=4290775857,this._f=1750603025,this._g=1694076839,this._h=3204075428,this},h.prototype._hash=function(){var t=o.allocUnsafe(28);return t.writeInt32BE(this._a,0),t.writeInt32BE(this._b,4),t.writeInt32BE(this._c,8),t.writeInt32BE(this._d,12),t.writeInt32BE(this._e,16),t.writeInt32BE(this._f,20),t.writeInt32BE(this._g,24),t},t.exports=h},7499:(t,e,i)=>{var r=i(5717),n=i(4189),s=i(9509).Buffer,o=[1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298],a=new Array(64);function h(){this.init(),this._w=a,n.call(this,64,56)}function u(t,e,i){return i^t&(e^i)}function l(t,e,i){return t&e|i&(t|e)}function c(t){return(t>>>2|t<<30)^(t>>>13|t<<19)^(t>>>22|t<<10)}function d(t){return(t>>>6|t<<26)^(t>>>11|t<<21)^(t>>>25|t<<7)}function f(t){return(t>>>7|t<<25)^(t>>>18|t<<14)^t>>>3}r(h,n),h.prototype.init=function(){return this._a=1779033703,this._b=3144134277,this._c=1013904242,this._d=2773480762,this._e=1359893119,this._f=2600822924,this._g=528734635,this._h=1541459225,this},h.prototype._update=function(t){for(var e,i=this._w,r=0|this._a,n=0|this._b,s=0|this._c,a=0|this._d,h=0|this._e,p=0|this._f,m=0|this._g,g=0|this._h,b=0;b<16;++b)i[b]=t.readInt32BE(4*b);for(;b<64;++b)i[b]=0|(((e=i[b-2])>>>17|e<<15)^(e>>>19|e<<13)^e>>>10)+i[b-7]+f(i[b-15])+i[b-16];for(var v=0;v<64;++v){var y=g+d(h)+u(h,p,m)+o[v]+i[v]|0,w=c(r)+l(r,n,s)|0;g=m,m=p,p=h,h=a+y|0,a=s,s=n,n=r,r=y+w|0}this._a=r+this._a|0,this._b=n+this._b|0,this._c=s+this._c|0,this._d=a+this._d|0,this._e=h+this._e|0,this._f=p+this._f|0,this._g=m+this._g|0,this._h=g+this._h|0},h.prototype._hash=function(){var t=s.allocUnsafe(32);return t.writeInt32BE(this._a,0),t.writeInt32BE(this._b,4),t.writeInt32BE(this._c,8),t.writeInt32BE(this._d,12),t.writeInt32BE(this._e,16),t.writeInt32BE(this._f,20),t.writeInt32BE(this._g,24),t.writeInt32BE(this._h,28),t},t.exports=h},1686:(t,e,i)=>{var r=i(5717),n=i(7816),s=i(4189),o=i(9509).Buffer,a=new Array(160);function h(){this.init(),this._w=a,s.call(this,128,112)}r(h,n),h.prototype.init=function(){return this._ah=3418070365,this._bh=1654270250,this._ch=2438529370,this._dh=355462360,this._eh=1731405415,this._fh=2394180231,this._gh=3675008525,this._hh=1203062813,this._al=3238371032,this._bl=914150663,this._cl=812702999,this._dl=4144912697,this._el=4290775857,this._fl=1750603025,this._gl=1694076839,this._hl=3204075428,this},h.prototype._hash=function(){var t=o.allocUnsafe(48);function e(e,i,r){t.writeInt32BE(e,r),t.writeInt32BE(i,r+4)}return e(this._ah,this._al,0),e(this._bh,this._bl,8),e(this._ch,this._cl,16),e(this._dh,this._dl,24),e(this._eh,this._el,32),e(this._fh,this._fl,40),t},t.exports=h},7816:(t,e,i)=>{var r=i(5717),n=i(4189),s=i(9509).Buffer,o=[1116352408,3609767458,1899447441,602891725,3049323471,3964484399,3921009573,2173295548,961987163,4081628472,1508970993,3053834265,2453635748,2937671579,2870763221,3664609560,3624381080,2734883394,310598401,1164996542,607225278,1323610764,1426881987,3590304994,1925078388,4068182383,2162078206,991336113,2614888103,633803317,3248222580,3479774868,3835390401,2666613458,4022224774,944711139,264347078,2341262773,604807628,2007800933,770255983,1495990901,1249150122,1856431235,1555081692,3175218132,1996064986,2198950837,2554220882,3999719339,2821834349,766784016,2952996808,2566594879,3210313671,3203337956,3336571891,1034457026,3584528711,2466948901,113926993,3758326383,338241895,168717936,666307205,1188179964,773529912,1546045734,1294757372,1522805485,1396182291,2643833823,1695183700,2343527390,1986661051,1014477480,2177026350,1206759142,2456956037,344077627,2730485921,1290863460,2820302411,3158454273,3259730800,3505952657,3345764771,106217008,3516065817,3606008344,3600352804,1432725776,4094571909,1467031594,275423344,851169720,430227734,3100823752,506948616,1363258195,659060556,3750685593,883997877,3785050280,958139571,3318307427,1322822218,3812723403,1537002063,2003034995,1747873779,3602036899,1955562222,1575990012,2024104815,1125592928,2227730452,2716904306,2361852424,442776044,2428436474,593698344,2756734187,3733110249,3204031479,2999351573,3329325298,3815920427,3391569614,3928383900,3515267271,566280711,3940187606,3454069534,4118630271,4000239992,116418474,1914138554,174292421,2731055270,289380356,3203993006,460393269,320620315,685471733,587496836,852142971,1086792851,1017036298,365543100,1126000580,2618297676,1288033470,3409855158,1501505948,4234509866,1607167915,987167468,1816402316,1246189591],a=new Array(160);function h(){this.init(),this._w=a,n.call(this,128,112)}function u(t,e,i){return i^t&(e^i)}function l(t,e,i){return t&e|i&(t|e)}function c(t,e){return(t>>>28|e<<4)^(e>>>2|t<<30)^(e>>>7|t<<25)}function d(t,e){return(t>>>14|e<<18)^(t>>>18|e<<14)^(e>>>9|t<<23)}function f(t,e){return(t>>>1|e<<31)^(t>>>8|e<<24)^t>>>7}function p(t,e){return(t>>>1|e<<31)^(t>>>8|e<<24)^(t>>>7|e<<25)}function m(t,e){return(t>>>19|e<<13)^(e>>>29|t<<3)^t>>>6}function g(t,e){return(t>>>19|e<<13)^(e>>>29|t<<3)^(t>>>6|e<<26)}function b(t,e){return t>>>0>>0?1:0}r(h,n),h.prototype.init=function(){return this._ah=1779033703,this._bh=3144134277,this._ch=1013904242,this._dh=2773480762,this._eh=1359893119,this._fh=2600822924,this._gh=528734635,this._hh=1541459225,this._al=4089235720,this._bl=2227873595,this._cl=4271175723,this._dl=1595750129,this._el=2917565137,this._fl=725511199,this._gl=4215389547,this._hl=327033209,this},h.prototype._update=function(t){for(var e=this._w,i=0|this._ah,r=0|this._bh,n=0|this._ch,s=0|this._dh,a=0|this._eh,h=0|this._fh,v=0|this._gh,y=0|this._hh,w=0|this._al,_=0|this._bl,M=0|this._cl,k=0|this._dl,x=0|this._el,E=0|this._fl,S=0|this._gl,T=0|this._hl,A=0;A<32;A+=2)e[A]=t.readInt32BE(4*A),e[A+1]=t.readInt32BE(4*A+4);for(;A<160;A+=2){var I=e[A-30],C=e[A-30+1],B=f(I,C),R=p(C,I),P=m(I=e[A-4],C=e[A-4+1]),L=g(C,I),O=e[A-14],D=e[A-14+1],N=e[A-32],j=e[A-32+1],U=R+D|0,F=B+O+b(U,R)|0;F=(F=F+P+b(U=U+L|0,L)|0)+N+b(U=U+j|0,j)|0,e[A]=F,e[A+1]=U}for(var q=0;q<160;q+=2){F=e[q],U=e[q+1];var z=l(i,r,n),H=l(w,_,M),W=c(i,w),$=c(w,i),Z=d(a,x),V=d(x,a),K=o[q],G=o[q+1],J=u(a,h,v),Y=u(x,E,S),X=T+V|0,Q=y+Z+b(X,T)|0;Q=(Q=(Q=Q+J+b(X=X+Y|0,Y)|0)+K+b(X=X+G|0,G)|0)+F+b(X=X+U|0,U)|0;var tt=$+H|0,et=W+z+b(tt,$)|0;y=v,T=S,v=h,S=E,h=a,E=x,a=s+Q+b(x=k+X|0,k)|0,s=n,k=M,n=r,M=_,r=i,_=w,i=Q+et+b(w=X+tt|0,X)|0}this._al=this._al+w|0,this._bl=this._bl+_|0,this._cl=this._cl+M|0,this._dl=this._dl+k|0,this._el=this._el+x|0,this._fl=this._fl+E|0,this._gl=this._gl+S|0,this._hl=this._hl+T|0,this._ah=this._ah+i+b(this._al,w)|0,this._bh=this._bh+r+b(this._bl,_)|0,this._ch=this._ch+n+b(this._cl,M)|0,this._dh=this._dh+s+b(this._dl,k)|0,this._eh=this._eh+a+b(this._el,x)|0,this._fh=this._fh+h+b(this._fl,E)|0,this._gh=this._gh+v+b(this._gl,S)|0,this._hh=this._hh+y+b(this._hl,T)|0},h.prototype._hash=function(){var t=s.allocUnsafe(64);function e(e,i,r){t.writeInt32BE(e,r),t.writeInt32BE(i,r+4)}return e(this._ah,this._al,0),e(this._bh,this._bl,8),e(this._ch,this._cl,16),e(this._dh,this._dl,24),e(this._eh,this._el,32),e(this._fh,this._fl,40),e(this._gh,this._gl,48),e(this._hh,this._hl,56),t},t.exports=h},7485:(t,e,i)=>{var r=i(8764).Buffer;t.exports=function(t,e){var i=[];t.on("data",(function(t){i.push(t)})),t.once("end",(function(){e&&e(null,r.concat(i)),e=null})),t.once("error",(function(t){e&&e(t),e=null}))}},6993:(t,e,i)=>{var r=i(8764).Buffer;t.exports=d;const n=i(7485),s=i(1356),o=i(8501),a=i(9267),h=i(778),u=i(7673),l=i(8575),c=t=>null!==t&&"object"==typeof t&&"function"==typeof t.pipe;function d(t,e){if(t=Object.assign({maxRedirects:10},"string"==typeof t?{url:t}:t),e=h(e),t.url){const{hostname:e,port:i,protocol:r,auth:n,path:s}=l.parse(t.url);delete t.url,e||i||r||n?Object.assign(t,{hostname:e,port:i,protocol:r,auth:n,path:s}):t.path=s}const i={"accept-encoding":"gzip, deflate"};let n;t.headers&&Object.keys(t.headers).forEach((e=>i[e.toLowerCase()]=t.headers[e])),t.headers=i,t.body?n=t.json&&!c(t.body)?JSON.stringify(t.body):t.body:t.form&&(n="string"==typeof t.form?t.form:u.stringify(t.form),t.headers["content-type"]="application/x-www-form-urlencoded"),n&&(t.method||(t.method="POST"),c(n)||(t.headers["content-length"]=r.byteLength(n)),t.json&&!t.form&&(t.headers["content-type"]="application/json")),delete t.body,delete t.form,t.json&&(t.headers.accept="application/json"),t.method&&(t.method=t.method.toUpperCase());const f=t.hostname,p=("https:"===t.protocol?a:o).request(t,(i=>{if(!1!==t.followRedirects&&i.statusCode>=300&&i.statusCode<400&&i.headers.location){t.url=i.headers.location,delete t.headers.host,i.resume();const r=l.parse(t.url).hostname;return null!==r&&r!==f&&(delete t.headers.cookie,delete t.headers.authorization),"POST"===t.method&&[301,302].includes(i.statusCode)&&(t.method="GET",delete t.headers["content-length"],delete t.headers["content-type"]),0==t.maxRedirects--?e(new Error("too many redirects")):d(t,e)}const r="function"==typeof s&&"HEAD"!==t.method;e(null,r?s(i):i)}));return p.on("timeout",(()=>{p.abort(),e(new Error("Request timed out"))})),p.on("error",e),c(n)?n.on("error",e).pipe(p):p.end(n),p}d.concat=(t,e)=>d(t,((i,r)=>{if(i)return e(i);n(r,((i,n)=>{if(i)return e(i);if(t.json)try{n=JSON.parse(n.toString())}catch(i){return e(i,r,n)}e(null,r,n)}))})),["get","post","put","patch","head","delete"].forEach((t=>{d[t]=(e,i)=>("string"==typeof e&&(e={url:e}),d(Object.assign({method:t.toUpperCase()},e),i))}))},8853:(t,e,i)=>{var r=i(5108);const n=i(1227)("simple-peer"),s=i(5177),o=i(1798),a=i(8473),h=i(4375),u=i(2114),{Buffer:l}=i(8764),c=65536;function d(t){return t.replace(/a=ice-options:trickle\s\n/g,"")}class f extends a.Duplex{constructor(t){if(super(t=Object.assign({allowHalfOpen:!1},t)),this._id=o(4).toString("hex").slice(0,7),this._debug("new peer %o",t),this.channelName=t.initiator?t.channelName||o(20).toString("hex"):null,this.initiator=t.initiator||!1,this.channelConfig=t.channelConfig||f.channelConfig,this.channelNegotiated=this.channelConfig.negotiated,this.config=Object.assign({},f.config,t.config),this.offerOptions=t.offerOptions||{},this.answerOptions=t.answerOptions||{},this.sdpTransform=t.sdpTransform||(t=>t),this.streams=t.streams||(t.stream?[t.stream]:[]),this.trickle=void 0===t.trickle||t.trickle,this.allowHalfTrickle=void 0!==t.allowHalfTrickle&&t.allowHalfTrickle,this.iceCompleteTimeout=t.iceCompleteTimeout||5e3,this.destroyed=!1,this.destroying=!1,this._connected=!1,this.remoteAddress=void 0,this.remoteFamily=void 0,this.remotePort=void 0,this.localAddress=void 0,this.localFamily=void 0,this.localPort=void 0,this._wrtc=t.wrtc&&"object"==typeof t.wrtc?t.wrtc:s(),!this._wrtc)throw"undefined"==typeof window?u(new Error("No WebRTC support: Specify `opts.wrtc` option in this environment"),"ERR_WEBRTC_SUPPORT"):u(new Error("No WebRTC support: Not a supported browser"),"ERR_WEBRTC_SUPPORT");this._pcReady=!1,this._channelReady=!1,this._iceComplete=!1,this._iceCompleteTimer=null,this._channel=null,this._pendingCandidates=[],this._isNegotiating=!1,this._firstNegotiation=!0,this._batchedNegotiation=!1,this._queuedNegotiation=!1,this._sendersAwaitingStable=[],this._senderMap=new Map,this._closingInterval=null,this._remoteTracks=[],this._remoteStreams=[],this._chunk=null,this._cb=null,this._interval=null;try{this._pc=new this._wrtc.RTCPeerConnection(this.config)}catch(t){return void this.destroy(u(t,"ERR_PC_CONSTRUCTOR"))}this._isReactNativeWebrtc="number"==typeof this._pc._peerConnectionId,this._pc.oniceconnectionstatechange=()=>{this._onIceStateChange()},this._pc.onicegatheringstatechange=()=>{this._onIceStateChange()},this._pc.onconnectionstatechange=()=>{this._onConnectionStateChange()},this._pc.onsignalingstatechange=()=>{this._onSignalingStateChange()},this._pc.onicecandidate=t=>{this._onIceCandidate(t)},"object"==typeof this._pc.peerIdentity&&this._pc.peerIdentity.catch((t=>{this.destroy(u(t,"ERR_PC_PEER_IDENTITY"))})),this.initiator||this.channelNegotiated?this._setupData({channel:this._pc.createDataChannel(this.channelName,this.channelConfig)}):this._pc.ondatachannel=t=>{this._setupData(t)},this.streams&&this.streams.forEach((t=>{this.addStream(t)})),this._pc.ontrack=t=>{this._onTrack(t)},this._debug("initial negotiation"),this._needsNegotiation(),this._onFinishBound=()=>{this._onFinish()},this.once("finish",this._onFinishBound)}get bufferSize(){return this._channel&&this._channel.bufferedAmount||0}get connected(){return this._connected&&"open"===this._channel.readyState}address(){return{port:this.localPort,family:this.localFamily,address:this.localAddress}}signal(t){if(!this.destroying){if(this.destroyed)throw u(new Error("cannot signal after peer is destroyed"),"ERR_DESTROYED");if("string"==typeof t)try{t=JSON.parse(t)}catch(e){t={}}this._debug("signal()"),t.renegotiate&&this.initiator&&(this._debug("got request to renegotiate"),this._needsNegotiation()),t.transceiverRequest&&this.initiator&&(this._debug("got request for transceiver"),this.addTransceiver(t.transceiverRequest.kind,t.transceiverRequest.init)),t.candidate&&(this._pc.remoteDescription&&this._pc.remoteDescription.type?this._addIceCandidate(t.candidate):this._pendingCandidates.push(t.candidate)),t.sdp&&this._pc.setRemoteDescription(new this._wrtc.RTCSessionDescription(t)).then((()=>{this.destroyed||(this._pendingCandidates.forEach((t=>{this._addIceCandidate(t)})),this._pendingCandidates=[],"offer"===this._pc.remoteDescription.type&&this._createAnswer())})).catch((t=>{this.destroy(u(t,"ERR_SET_REMOTE_DESCRIPTION"))})),t.sdp||t.candidate||t.renegotiate||t.transceiverRequest||this.destroy(u(new Error("signal() called with invalid signal data"),"ERR_SIGNALING"))}}_addIceCandidate(t){const e=new this._wrtc.RTCIceCandidate(t);this._pc.addIceCandidate(e).catch((t=>{!e.address||e.address.endsWith(".local")?("Ignoring unsupported ICE candidate.",r.warn("Ignoring unsupported ICE candidate.")):this.destroy(u(t,"ERR_ADD_ICE_CANDIDATE"))}))}send(t){if(!this.destroying){if(this.destroyed)throw u(new Error("cannot send after peer is destroyed"),"ERR_DESTROYED");this._channel.send(t)}}addTransceiver(t,e){if(!this.destroying){if(this.destroyed)throw u(new Error("cannot addTransceiver after peer is destroyed"),"ERR_DESTROYED");if(this._debug("addTransceiver()"),this.initiator)try{this._pc.addTransceiver(t,e),this._needsNegotiation()}catch(t){this.destroy(u(t,"ERR_ADD_TRANSCEIVER"))}else this.emit("signal",{type:"transceiverRequest",transceiverRequest:{kind:t,init:e}})}}addStream(t){if(!this.destroying){if(this.destroyed)throw u(new Error("cannot addStream after peer is destroyed"),"ERR_DESTROYED");this._debug("addStream()"),t.getTracks().forEach((e=>{this.addTrack(e,t)}))}}addTrack(t,e){if(this.destroying)return;if(this.destroyed)throw u(new Error("cannot addTrack after peer is destroyed"),"ERR_DESTROYED");this._debug("addTrack()");const i=this._senderMap.get(t)||new Map;let r=i.get(e);if(r)throw r.removed?u(new Error("Track has been removed. You should enable/disable tracks that you want to re-add."),"ERR_SENDER_REMOVED"):u(new Error("Track has already been added to that stream."),"ERR_SENDER_ALREADY_ADDED");r=this._pc.addTrack(t,e),i.set(e,r),this._senderMap.set(t,i),this._needsNegotiation()}replaceTrack(t,e,i){if(this.destroying)return;if(this.destroyed)throw u(new Error("cannot replaceTrack after peer is destroyed"),"ERR_DESTROYED");this._debug("replaceTrack()");const r=this._senderMap.get(t),n=r?r.get(i):null;if(!n)throw u(new Error("Cannot replace track that was never added."),"ERR_TRACK_NOT_ADDED");e&&this._senderMap.set(e,r),null!=n.replaceTrack?n.replaceTrack(e):this.destroy(u(new Error("replaceTrack is not supported in this browser"),"ERR_UNSUPPORTED_REPLACETRACK"))}removeTrack(t,e){if(this.destroying)return;if(this.destroyed)throw u(new Error("cannot removeTrack after peer is destroyed"),"ERR_DESTROYED");this._debug("removeSender()");const i=this._senderMap.get(t),r=i?i.get(e):null;if(!r)throw u(new Error("Cannot remove track that was never added."),"ERR_TRACK_NOT_ADDED");try{r.removed=!0,this._pc.removeTrack(r)}catch(t){"NS_ERROR_UNEXPECTED"===t.name?this._sendersAwaitingStable.push(r):this.destroy(u(t,"ERR_REMOVE_TRACK"))}this._needsNegotiation()}removeStream(t){if(!this.destroying){if(this.destroyed)throw u(new Error("cannot removeStream after peer is destroyed"),"ERR_DESTROYED");this._debug("removeSenders()"),t.getTracks().forEach((e=>{this.removeTrack(e,t)}))}}_needsNegotiation(){this._debug("_needsNegotiation"),this._batchedNegotiation||(this._batchedNegotiation=!0,h((()=>{this._batchedNegotiation=!1,this.initiator||!this._firstNegotiation?(this._debug("starting batched negotiation"),this.negotiate()):this._debug("non-initiator initial negotiation request discarded"),this._firstNegotiation=!1})))}negotiate(){if(!this.destroying){if(this.destroyed)throw u(new Error("cannot negotiate after peer is destroyed"),"ERR_DESTROYED");this.initiator?this._isNegotiating?(this._queuedNegotiation=!0,this._debug("already negotiating, queueing")):(this._debug("start negotiation"),setTimeout((()=>{this._createOffer()}),0)):this._isNegotiating?(this._queuedNegotiation=!0,this._debug("already negotiating, queueing")):(this._debug("requesting negotiation from initiator"),this.emit("signal",{type:"renegotiate",renegotiate:!0})),this._isNegotiating=!0}}destroy(t){this._destroy(t,(()=>{}))}_destroy(t,e){this.destroyed||this.destroying||(this.destroying=!0,this._debug("destroying (error: %s)",t&&(t.message||t)),h((()=>{if(this.destroyed=!0,this.destroying=!1,this._debug("destroy (error: %s)",t&&(t.message||t)),this.readable=this.writable=!1,this._readableState.ended||this.push(null),this._writableState.finished||this.end(),this._connected=!1,this._pcReady=!1,this._channelReady=!1,this._remoteTracks=null,this._remoteStreams=null,this._senderMap=null,clearInterval(this._closingInterval),this._closingInterval=null,clearInterval(this._interval),this._interval=null,this._chunk=null,this._cb=null,this._onFinishBound&&this.removeListener("finish",this._onFinishBound),this._onFinishBound=null,this._channel){try{this._channel.close()}catch(t){}this._channel.onmessage=null,this._channel.onopen=null,this._channel.onclose=null,this._channel.onerror=null}if(this._pc){try{this._pc.close()}catch(t){}this._pc.oniceconnectionstatechange=null,this._pc.onicegatheringstatechange=null,this._pc.onsignalingstatechange=null,this._pc.onicecandidate=null,this._pc.ontrack=null,this._pc.ondatachannel=null}this._pc=null,this._channel=null,t&&this.emit("error",t),this.emit("close"),e()})))}_setupData(t){if(!t.channel)return this.destroy(u(new Error("Data channel event is missing `channel` property"),"ERR_DATA_CHANNEL"));this._channel=t.channel,this._channel.binaryType="arraybuffer","number"==typeof this._channel.bufferedAmountLowThreshold&&(this._channel.bufferedAmountLowThreshold=c),this.channelName=this._channel.label,this._channel.onmessage=t=>{this._onChannelMessage(t)},this._channel.onbufferedamountlow=()=>{this._onChannelBufferedAmountLow()},this._channel.onopen=()=>{this._onChannelOpen()},this._channel.onclose=()=>{this._onChannelClose()},this._channel.onerror=t=>{const e=t.error instanceof Error?t.error:new Error(`Datachannel error: ${t.message} ${t.filename}:${t.lineno}:${t.colno}`);this.destroy(u(e,"ERR_DATA_CHANNEL"))};let e=!1;this._closingInterval=setInterval((()=>{this._channel&&"closing"===this._channel.readyState?(e&&this._onChannelClose(),e=!0):e=!1}),5e3)}_read(){}_write(t,e,i){if(this.destroyed)return i(u(new Error("cannot write after peer is destroyed"),"ERR_DATA_CHANNEL"));if(this._connected){try{this.send(t)}catch(t){return this.destroy(u(t,"ERR_DATA_CHANNEL"))}this._channel.bufferedAmount>c?(this._debug("start backpressure: bufferedAmount %d",this._channel.bufferedAmount),this._cb=i):i(null)}else this._debug("write before connect"),this._chunk=t,this._cb=i}_onFinish(){if(this.destroyed)return;const t=()=>{setTimeout((()=>this.destroy()),1e3)};this._connected?t():this.once("connect",t)}_startIceCompleteTimeout(){this.destroyed||this._iceCompleteTimer||(this._debug("started iceComplete timeout"),this._iceCompleteTimer=setTimeout((()=>{this._iceComplete||(this._iceComplete=!0,this._debug("iceComplete timeout completed"),this.emit("iceTimeout"),this.emit("_iceComplete"))}),this.iceCompleteTimeout))}_createOffer(){this.destroyed||this._pc.createOffer(this.offerOptions).then((t=>{if(this.destroyed)return;this.trickle||this.allowHalfTrickle||(t.sdp=d(t.sdp)),t.sdp=this.sdpTransform(t.sdp);const e=()=>{if(this.destroyed)return;const e=this._pc.localDescription||t;this._debug("signal"),this.emit("signal",{type:e.type,sdp:e.sdp})};this._pc.setLocalDescription(t).then((()=>{this._debug("createOffer success"),this.destroyed||(this.trickle||this._iceComplete?e():this.once("_iceComplete",e))})).catch((t=>{this.destroy(u(t,"ERR_SET_LOCAL_DESCRIPTION"))}))})).catch((t=>{this.destroy(u(t,"ERR_CREATE_OFFER"))}))}_requestMissingTransceivers(){this._pc.getTransceivers&&this._pc.getTransceivers().forEach((t=>{t.mid||!t.sender.track||t.requested||(t.requested=!0,this.addTransceiver(t.sender.track.kind))}))}_createAnswer(){this.destroyed||this._pc.createAnswer(this.answerOptions).then((t=>{if(this.destroyed)return;this.trickle||this.allowHalfTrickle||(t.sdp=d(t.sdp)),t.sdp=this.sdpTransform(t.sdp);const e=()=>{if(this.destroyed)return;const e=this._pc.localDescription||t;this._debug("signal"),this.emit("signal",{type:e.type,sdp:e.sdp}),this.initiator||this._requestMissingTransceivers()};this._pc.setLocalDescription(t).then((()=>{this.destroyed||(this.trickle||this._iceComplete?e():this.once("_iceComplete",e))})).catch((t=>{this.destroy(u(t,"ERR_SET_LOCAL_DESCRIPTION"))}))})).catch((t=>{this.destroy(u(t,"ERR_CREATE_ANSWER"))}))}_onConnectionStateChange(){this.destroyed||"failed"===this._pc.connectionState&&this.destroy(u(new Error("Connection failed."),"ERR_CONNECTION_FAILURE"))}_onIceStateChange(){if(this.destroyed)return;const t=this._pc.iceConnectionState,e=this._pc.iceGatheringState;this._debug("iceStateChange (connection: %s) (gathering: %s)",t,e),this.emit("iceStateChange",t,e),"connected"!==t&&"completed"!==t||(this._pcReady=!0,this._maybeReady()),"failed"===t&&this.destroy(u(new Error("Ice connection failed."),"ERR_ICE_CONNECTION_FAILURE")),"closed"===t&&this.destroy(u(new Error("Ice connection closed."),"ERR_ICE_CONNECTION_CLOSED"))}getStats(t){const e=t=>("[object Array]"===Object.prototype.toString.call(t.values)&&t.values.forEach((e=>{Object.assign(t,e)})),t);0===this._pc.getStats.length||this._isReactNativeWebrtc?this._pc.getStats().then((i=>{const r=[];i.forEach((t=>{r.push(e(t))})),t(null,r)}),(e=>t(e))):this._pc.getStats.length>0?this._pc.getStats((i=>{if(this.destroyed)return;const r=[];i.result().forEach((t=>{const i={};t.names().forEach((e=>{i[e]=t.stat(e)})),i.id=t.id,i.type=t.type,i.timestamp=t.timestamp,r.push(e(i))})),t(null,r)}),(e=>t(e))):t(null,[])}_maybeReady(){if(this._debug("maybeReady pc %s channel %s",this._pcReady,this._channelReady),this._connected||this._connecting||!this._pcReady||!this._channelReady)return;this._connecting=!0;const t=()=>{this.destroyed||this.getStats(((e,i)=>{if(this.destroyed)return;e&&(i=[]);const r={},n={},s={};let o=!1;i.forEach((t=>{"remotecandidate"!==t.type&&"remote-candidate"!==t.type||(r[t.id]=t),"localcandidate"!==t.type&&"local-candidate"!==t.type||(n[t.id]=t),"candidatepair"!==t.type&&"candidate-pair"!==t.type||(s[t.id]=t)}));const a=t=>{o=!0;let e=n[t.localCandidateId];e&&(e.ip||e.address)?(this.localAddress=e.ip||e.address,this.localPort=Number(e.port)):e&&e.ipAddress?(this.localAddress=e.ipAddress,this.localPort=Number(e.portNumber)):"string"==typeof t.googLocalAddress&&(e=t.googLocalAddress.split(":"),this.localAddress=e[0],this.localPort=Number(e[1])),this.localAddress&&(this.localFamily=this.localAddress.includes(":")?"IPv6":"IPv4");let i=r[t.remoteCandidateId];i&&(i.ip||i.address)?(this.remoteAddress=i.ip||i.address,this.remotePort=Number(i.port)):i&&i.ipAddress?(this.remoteAddress=i.ipAddress,this.remotePort=Number(i.portNumber)):"string"==typeof t.googRemoteAddress&&(i=t.googRemoteAddress.split(":"),this.remoteAddress=i[0],this.remotePort=Number(i[1])),this.remoteAddress&&(this.remoteFamily=this.remoteAddress.includes(":")?"IPv6":"IPv4"),this._debug("connect local: %s:%s remote: %s:%s",this.localAddress,this.localPort,this.remoteAddress,this.remotePort)};if(i.forEach((t=>{"transport"===t.type&&t.selectedCandidatePairId&&a(s[t.selectedCandidatePairId]),("googCandidatePair"===t.type&&"true"===t.googActiveConnection||("candidatepair"===t.type||"candidate-pair"===t.type)&&t.selected)&&a(t)})),o||Object.keys(s).length&&!Object.keys(n).length){if(this._connecting=!1,this._connected=!0,this._chunk){try{this.send(this._chunk)}catch(e){return this.destroy(u(e,"ERR_DATA_CHANNEL"))}this._chunk=null,this._debug('sent chunk from "write before connect"');const t=this._cb;this._cb=null,t(null)}"number"!=typeof this._channel.bufferedAmountLowThreshold&&(this._interval=setInterval((()=>this._onInterval()),150),this._interval.unref&&this._interval.unref()),this._debug("connect"),this.emit("connect")}else setTimeout(t,100)}))};t()}_onInterval(){!this._cb||!this._channel||this._channel.bufferedAmount>c||this._onChannelBufferedAmountLow()}_onSignalingStateChange(){this.destroyed||("stable"===this._pc.signalingState&&(this._isNegotiating=!1,this._debug("flushing sender queue",this._sendersAwaitingStable),this._sendersAwaitingStable.forEach((t=>{this._pc.removeTrack(t),this._queuedNegotiation=!0})),this._sendersAwaitingStable=[],this._queuedNegotiation?(this._debug("flushing negotiation queue"),this._queuedNegotiation=!1,this._needsNegotiation()):(this._debug("negotiated"),this.emit("negotiated"))),this._debug("signalingStateChange %s",this._pc.signalingState),this.emit("signalingStateChange",this._pc.signalingState))}_onIceCandidate(t){this.destroyed||(t.candidate&&this.trickle?this.emit("signal",{type:"candidate",candidate:{candidate:t.candidate.candidate,sdpMLineIndex:t.candidate.sdpMLineIndex,sdpMid:t.candidate.sdpMid}}):t.candidate||this._iceComplete||(this._iceComplete=!0,this.emit("_iceComplete")),t.candidate&&this._startIceCompleteTimeout())}_onChannelMessage(t){if(this.destroyed)return;let e=t.data;e instanceof ArrayBuffer&&(e=l.from(e)),this.push(e)}_onChannelBufferedAmountLow(){if(this.destroyed||!this._cb)return;this._debug("ending backpressure: bufferedAmount %d",this._channel.bufferedAmount);const t=this._cb;this._cb=null,t(null)}_onChannelOpen(){this._connected||this.destroyed||(this._debug("on channel open"),this._channelReady=!0,this._maybeReady())}_onChannelClose(){this.destroyed||(this._debug("on channel close"),this.destroy())}_onTrack(t){this.destroyed||t.streams.forEach((e=>{this._debug("on track"),this.emit("track",t.track,e),this._remoteTracks.push({track:t.track,stream:e}),this._remoteStreams.some((t=>t.id===e.id))||(this._remoteStreams.push(e),h((()=>{this._debug("on stream"),this.emit("stream",e)})))}))}_debug(){const t=[].slice.call(arguments);t[0]="["+this._id+"] "+t[0],n.apply(null,t)}}f.WEBRTC_SUPPORT=!!s(),f.config={iceServers:[{urls:["stun:stun.l.google.com:19302","stun:global.stun.twilio.com:3478"]}],sdpSemantics:"unified-plan"},f.channelConfig={},t.exports=f},4159:(t,e,i)=>{const r=i(4029),n=i(4580),s=new r,o="undefined"!=typeof window?window:self,a=o.crypto||o.msCrypto||{};let h=a.subtle||a.webkitSubtle;function u(t){return s.digest(t)}try{h.digest({name:"sha-1"},new Uint8Array).catch((function(){h=!1}))}catch(t){h=!1}t.exports=function(t,e){h?("string"==typeof t&&(t=function(t){const e=t.length,i=new Uint8Array(e);for(let r=0;r>>4).toString(16)),i.push((15&e).toString(16))}return i.join("")}(new Uint8Array(t)))}),(function(){e(u(t))}))):"undefined"!=typeof window?n(t,(function(i,r){e(i?u(t):r)})):queueMicrotask((()=>e(u(t))))},t.exports.sync=u},4580:(t,e,i)=>{const r=i(4029);let n,s,o;t.exports=function(t,e){n||(n=r.createWorker(),s=1,o={},n.onmessage=function(t){const e=t.data.id,i=o[e];delete o[e],null!=t.data.error?i(new Error("Rusha worker error: "+t.data.error)):i(null,t.data.hash)}),o[s]=e,n.postMessage({id:s,data:t}),s+=1}},522:(t,e,i)=>{var r=i(8764).Buffer;const n=i(1227)("simple-websocket"),s=i(1798),o=i(8473),a=i(4375),h=i(3719),u="function"!=typeof h?WebSocket:h;class l extends o.Duplex{constructor(t={}){if("string"==typeof t&&(t={url:t}),super(t=Object.assign({allowHalfOpen:!1},t)),null==t.url&&null==t.socket)throw new Error("Missing required `url` or `socket` option");if(null!=t.url&&null!=t.socket)throw new Error("Must specify either `url` or `socket` option, not both");if(this._id=s(4).toString("hex").slice(0,7),this._debug("new websocket: %o",t),this.connected=!1,this.destroyed=!1,this._chunk=null,this._cb=null,this._interval=null,t.socket)this.url=t.socket.url,this._ws=t.socket,this.connected=t.socket.readyState===u.OPEN;else{this.url=t.url;try{this._ws="function"==typeof h?new u(t.url,null,{...t,encoding:void 0}):new u(t.url)}catch(t){return void a((()=>this.destroy(t)))}}this._ws.binaryType="arraybuffer",t.socket&&this.connected?a((()=>this._handleOpen())):this._ws.onopen=()=>this._handleOpen(),this._ws.onmessage=t=>this._handleMessage(t),this._ws.onclose=()=>this._handleClose(),this._ws.onerror=t=>this._handleError(t),this._handleFinishBound=()=>this._handleFinish(),this.once("finish",this._handleFinishBound)}send(t){this._ws.send(t)}destroy(t){this._destroy(t,(()=>{}))}_destroy(t,e){if(!this.destroyed){if(this._debug("destroy (error: %s)",t&&(t.message||t)),this.readable=this.writable=!1,this._readableState.ended||this.push(null),this._writableState.finished||this.end(),this.connected=!1,this.destroyed=!0,clearInterval(this._interval),this._interval=null,this._chunk=null,this._cb=null,this._handleFinishBound&&this.removeListener("finish",this._handleFinishBound),this._handleFinishBound=null,this._ws){const e=this._ws,i=()=>{e.onclose=null};if(e.readyState===u.CLOSED)i();else try{e.onclose=i,e.close()}catch(t){i()}e.onopen=null,e.onmessage=null,e.onerror=()=>{}}this._ws=null,t&&this.emit("error",t),this.emit("close"),e()}}_read(){}_write(t,e,i){if(this.destroyed)return i(new Error("cannot write after socket is destroyed"));if(this.connected){try{this.send(t)}catch(t){return this.destroy(t)}"function"!=typeof h&&this._ws.bufferedAmount>65536?(this._debug("start backpressure: bufferedAmount %d",this._ws.bufferedAmount),this._cb=i):i(null)}else this._debug("write before connect"),this._chunk=t,this._cb=i}_handleOpen(){if(!this.connected&&!this.destroyed){if(this.connected=!0,this._chunk){try{this.send(this._chunk)}catch(t){return this.destroy(t)}this._chunk=null,this._debug('sent chunk from "write before connect"');const t=this._cb;this._cb=null,t(null)}"function"!=typeof h&&(this._interval=setInterval((()=>this._onInterval()),150),this._interval.unref&&this._interval.unref()),this._debug("connect"),this.emit("connect")}}_handleMessage(t){if(this.destroyed)return;let e=t.data;e instanceof ArrayBuffer&&(e=r.from(e)),this.push(e)}_handleClose(){this.destroyed||(this._debug("on close"),this.destroy())}_handleError(t){this.destroy(new Error(`Error connecting to ${this.url}`))}_handleFinish(){if(this.destroyed)return;const t=()=>{setTimeout((()=>this.destroy()),1e3)};this.connected?t():this.once("connect",t)}_onInterval(){if(!this._cb||!this._ws||this._ws.bufferedAmount>65536)return;this._debug("ending backpressure: bufferedAmount %d",this._ws.bufferedAmount);const t=this._cb;this._cb=null,t(null)}_debug(){const t=[].slice.call(arguments);t[0]="["+this._id+"] "+t[0],n.apply(null,t)}}l.WEBSOCKET_SUPPORT=!!u,t.exports=l},558:(t,e,i)=>{const r=i(7768),n=i(9929);t.exports={Throttle:r,ThrottleGroup:n}},9929:(t,e,i)=>{const{TokenBucket:r}=i(5516),n=i(7768);t.exports=class{constructor(t={}){if("object"!=typeof t)throw new Error("Options must be an object");this.throttles=[],this.setEnabled(t.enabled),this.setRate(t.rate,t.chunksize)}getEnabled(){return this._enabled}getRate(){return this.bucket.tokensPerInterval}getChunksize(){return this.chunksize}setEnabled(t=!0){if("boolean"!=typeof t)throw new Error("Enabled must be a boolean");this._enabled=t;for(const e of this.throttles)e.setEnabled(t)}setRate(t,e=null){if(!Number.isInteger(t)||t<0)throw new Error("Rate must be an integer bigger than zero");if(t=parseInt(t),e&&("number"!=typeof e||e<=0))throw new Error("Chunksize must be bigger than zero");if(e=e||Math.max(parseInt(t/10),1),e=parseInt(e),t>0&&e>t)throw new Error("Chunk size must be smaller than rate");this.bucket||(this.bucket=new r(t,t,"second",null)),this.bucket.bucketSize=t,this.bucket.tokensPerInterval=t,this.chunksize=e}setChunksize(t){if(!Number.isInteger(t)||t<=0)throw new Error("Chunk size must be an integer bigger than zero");const e=this.getRate();if(t=parseInt(t),e>0&&t>e)throw new Error("Chunk size must be smaller than rate");this.chunksize=t}throttle(t={}){if("object"!=typeof t)throw new Error("Options must be an object");return new n({...t,group:this})}destroy(){for(const t of this.throttles)t.destroy();this.throttles=[]}_addThrottle(t){if(!(t instanceof n))throw new Error("Throttle must be an instance of Throttle");this.throttles.push(t)}_removeThrottle(t){const e=this.throttles.indexOf(t);e>-1&&this.throttles.splice(e,1)}}},7768:(t,e,i)=>{const{EventEmitter:r}=i(7187),{Transform:n}=i(1237),{wait:s}=i(5324);t.exports=class extends n{constructor(t={}){if(super(),"object"!=typeof t)throw new Error("Options must be an object");const e=Object.assign({},t);if(e.group&&!(e.group instanceof o))throw new Error("Group must be an instanece of ThrottleGroup");e.group||(e.group=new o(e)),this._setEnabled(e.enabled||e.group.enabled),this._group=e.group,this._emitter=new r,this._destroyed=!1,this._group._addThrottle(this)}getEnabled(){return this._enabled}getGroup(){return this._group}_setEnabled(t=!0){if("boolean"!=typeof t)throw new Error("Enabled must be a boolean");this._enabled=t}setEnabled(t){this._setEnabled(t),this._enabled?this._emitter.emit("enabled"):this._emitter.emit("disabled")}_transform(t,e){this._processChunk(t,e)}async _waitForTokens(t){return new Promise(((e,i)=>{let r=!1;const n=this;function s(t){if(n._emitter.removeListener("disabled",s),n._emitter.removeListener("destroyed",s),!r){if(r=!0,t)return i(t);e()}}this._emitter.once("disabled",s),this._emitter.once("destroyed",s),this._group.bucket.removeTokens(t,s)}))}_areBothEnabled(){return this._enabled&&this._group.getEnabled()}async _processChunk(t,e){if(!this._areBothEnabled())return e(null,t);let i=0,r=this._group.getChunksize(),n=t.slice(i,i+r);for(;n.length>0;){if(this._areBothEnabled())try{for(;0===this._group.getRate()&&!this._destroyed&&this._areBothEnabled();)if(await s(1e3),this._destroyed)return;if(this._areBothEnabled()&&!this._group.bucket.tryRemoveTokens(n.length)&&(await this._waitForTokens(n.length),this._destroyed))return}catch(t){return e(t)}this.push(n),i+=r,r=this._areBothEnabled()?this._group.getChunksize():t.length-i,n=t.slice(i,i+r)}return e()}destroy(...t){this._group._removeThrottle(this),this._destroyed=!0,this._emitter.emit("destroyed"),super.destroy(...t)}};const o=i(9929)},5324:t=>{t.exports={wait:function(t){return new Promise((e=>setTimeout(e,t)))}}},9529:t=>{var e,i=1,r=65535,n=function(){i=i+1&r};t.exports=function(t){e||(e=setInterval(n,250)).unref&&e.unref();var s=4*(t||5),o=[0],a=1,h=i-1&r;return function(t){var e=i-h&r;for(e>s&&(e=s),h=i;e--;)a===s&&(a=0),o[a]=o[0===a?s-1:a-1],a++;t&&(o[a-1]+=t);var n=o[a-1],u=o.length{t.exports=n;var r=i(7187).EventEmitter;function n(){r.call(this)}i(5717)(n,r),n.Readable=i(9481),n.Writable=i(4229),n.Duplex=i(6753),n.Transform=i(4605),n.PassThrough=i(2725),n.finished=i(8610),n.pipeline=i(9946),n.Stream=n,n.prototype.pipe=function(t,e){var i=this;function n(e){t.writable&&!1===t.write(e)&&i.pause&&i.pause()}function s(){i.readable&&i.resume&&i.resume()}i.on("data",n),t.on("drain",s),t._isStdio||e&&!1===e.end||(i.on("end",a),i.on("close",h));var o=!1;function a(){o||(o=!0,t.end())}function h(){o||(o=!0,"function"==typeof t.destroy&&t.destroy())}function u(t){if(l(),0===r.listenerCount(this,"error"))throw t}function l(){i.removeListener("data",n),t.removeListener("drain",s),i.removeListener("end",a),i.removeListener("close",h),i.removeListener("error",u),t.removeListener("error",u),i.removeListener("end",l),i.removeListener("close",l),t.removeListener("close",l)}return i.on("error",u),t.on("error",u),i.on("end",l),i.on("close",l),t.on("close",l),t.emit("pipe",i),t}},8501:(t,e,i)=>{var r=i(1989),n=i(5676),s=i(7529),o=i(584),a=i(8575),h=e;h.request=function(t,e){t="string"==typeof t?a.parse(t):s(t);var n=-1===i.g.location.protocol.search(/^https?:$/)?"http:":"",o=t.protocol||n,h=t.hostname||t.host,u=t.port,l=t.path||"/";h&&-1!==h.indexOf(":")&&(h="["+h+"]"),t.url=(h?o+"//"+h:"")+(u?":"+u:"")+l,t.method=(t.method||"GET").toUpperCase(),t.headers=t.headers||{};var c=new r(t);return e&&c.on("response",e),c},h.get=function(t,e){var i=h.request(t,e);return i.end(),i},h.ClientRequest=r,h.IncomingMessage=n.IncomingMessage,h.Agent=function(){},h.Agent.defaultMaxSockets=4,h.globalAgent=new h.Agent,h.STATUS_CODES=o,h.METHODS=["CHECKOUT","CONNECT","COPY","DELETE","GET","HEAD","LOCK","M-SEARCH","MERGE","MKACTIVITY","MKCOL","MOVE","NOTIFY","OPTIONS","PATCH","POST","PROPFIND","PROPPATCH","PURGE","PUT","REPORT","SEARCH","SUBSCRIBE","TRACE","UNLOCK","UNSUBSCRIBE"]},8725:(t,e,i)=>{var r;function n(){if(void 0!==r)return r;if(i.g.XMLHttpRequest){r=new i.g.XMLHttpRequest;try{r.open("GET",i.g.XDomainRequest?"/":"https://example.com")}catch(t){r=null}}else r=null;return r}function s(t){var e=n();if(!e)return!1;try{return e.responseType=t,e.responseType===t}catch(t){}return!1}function o(t){return"function"==typeof t}e.fetch=o(i.g.fetch)&&o(i.g.ReadableStream),e.writableStream=o(i.g.WritableStream),e.abortController=o(i.g.AbortController),e.arraybuffer=e.fetch||s("arraybuffer"),e.msstream=!e.fetch&&s("ms-stream"),e.mozchunkedarraybuffer=!e.fetch&&s("moz-chunked-arraybuffer"),e.overrideMimeType=e.fetch||!!n()&&o(n().overrideMimeType),r=null},1989:(t,e,i)=>{var r=i(8764).Buffer,n=i(9590),s=i(8725),o=i(5717),a=i(5676),h=i(8473),u=a.IncomingMessage,l=a.readyStates,c=t.exports=function(t){var e,i=this;h.Writable.call(i),i._opts=t,i._body=[],i._headers={},t.auth&&i.setHeader("Authorization","Basic "+r.from(t.auth).toString("base64")),Object.keys(t.headers).forEach((function(e){i.setHeader(e,t.headers[e])}));var n=!0;if("disable-fetch"===t.mode||"requestTimeout"in t&&!s.abortController)n=!1,e=!0;else if("prefer-streaming"===t.mode)e=!1;else if("allow-wrong-content-type"===t.mode)e=!s.overrideMimeType;else{if(t.mode&&"default"!==t.mode&&"prefer-fast"!==t.mode)throw new Error("Invalid value for opts.mode");e=!0}i._mode=function(t,e){return s.fetch&&e?"fetch":s.mozchunkedarraybuffer?"moz-chunked-arraybuffer":s.msstream?"ms-stream":s.arraybuffer&&t?"arraybuffer":"text"}(e,n),i._fetchTimer=null,i._socketTimeout=null,i._socketTimer=null,i.on("finish",(function(){i._onFinish()}))};o(c,h.Writable),c.prototype.setHeader=function(t,e){var i=t.toLowerCase();-1===d.indexOf(i)&&(this._headers[i]={name:t,value:e})},c.prototype.getHeader=function(t){var e=this._headers[t.toLowerCase()];return e?e.value:null},c.prototype.removeHeader=function(t){delete this._headers[t.toLowerCase()]},c.prototype._onFinish=function(){var t=this;if(!t._destroyed){var e=t._opts;"timeout"in e&&0!==e.timeout&&t.setTimeout(e.timeout);var r=t._headers,o=null;"GET"!==e.method&&"HEAD"!==e.method&&(o=new Blob(t._body,{type:(r["content-type"]||{}).value||""}));var a=[];if(Object.keys(r).forEach((function(t){var e=r[t].name,i=r[t].value;Array.isArray(i)?i.forEach((function(t){a.push([e,t])})):a.push([e,i])})),"fetch"===t._mode){var h=null;if(s.abortController){var u=new AbortController;h=u.signal,t._fetchAbortController=u,"requestTimeout"in e&&0!==e.requestTimeout&&(t._fetchTimer=i.g.setTimeout((function(){t.emit("requestTimeout"),t._fetchAbortController&&t._fetchAbortController.abort()}),e.requestTimeout))}i.g.fetch(t._opts.url,{method:t._opts.method,headers:a,body:o||void 0,mode:"cors",credentials:e.withCredentials?"include":"same-origin",signal:h}).then((function(e){t._fetchResponse=e,t._resetTimers(!1),t._connect()}),(function(e){t._resetTimers(!0),t._destroyed||t.emit("error",e)}))}else{var c=t._xhr=new i.g.XMLHttpRequest;try{c.open(t._opts.method,t._opts.url,!0)}catch(e){return void n.nextTick((function(){t.emit("error",e)}))}"responseType"in c&&(c.responseType=t._mode),"withCredentials"in c&&(c.withCredentials=!!e.withCredentials),"text"===t._mode&&"overrideMimeType"in c&&c.overrideMimeType("text/plain; charset=x-user-defined"),"requestTimeout"in e&&(c.timeout=e.requestTimeout,c.ontimeout=function(){t.emit("requestTimeout")}),a.forEach((function(t){c.setRequestHeader(t[0],t[1])})),t._response=null,c.onreadystatechange=function(){switch(c.readyState){case l.LOADING:case l.DONE:t._onXHRProgress()}},"moz-chunked-arraybuffer"===t._mode&&(c.onprogress=function(){t._onXHRProgress()}),c.onerror=function(){t._destroyed||(t._resetTimers(!0),t.emit("error",new Error("XHR error")))};try{c.send(o)}catch(e){return void n.nextTick((function(){t.emit("error",e)}))}}}},c.prototype._onXHRProgress=function(){var t=this;t._resetTimers(!1),function(t){try{var e=t.status;return null!==e&&0!==e}catch(t){return!1}}(t._xhr)&&!t._destroyed&&(t._response||t._connect(),t._response._onXHRProgress(t._resetTimers.bind(t)))},c.prototype._connect=function(){var t=this;t._destroyed||(t._response=new u(t._xhr,t._fetchResponse,t._mode,t._resetTimers.bind(t)),t._response.on("error",(function(e){t.emit("error",e)})),t.emit("response",t._response))},c.prototype._write=function(t,e,i){this._body.push(t),i()},c.prototype._resetTimers=function(t){var e=this;i.g.clearTimeout(e._socketTimer),e._socketTimer=null,t?(i.g.clearTimeout(e._fetchTimer),e._fetchTimer=null):e._socketTimeout&&(e._socketTimer=i.g.setTimeout((function(){e.emit("timeout")}),e._socketTimeout))},c.prototype.abort=c.prototype.destroy=function(t){var e=this;e._destroyed=!0,e._resetTimers(!0),e._response&&(e._response._destroyed=!0),e._xhr?e._xhr.abort():e._fetchAbortController&&e._fetchAbortController.abort(),t&&e.emit("error",t)},c.prototype.end=function(t,e,i){"function"==typeof t&&(i=t,t=void 0),h.Writable.prototype.end.call(this,t,e,i)},c.prototype.setTimeout=function(t,e){var i=this;e&&i.once("timeout",e),i._socketTimeout=t,i._resetTimers(!1)},c.prototype.flushHeaders=function(){},c.prototype.setNoDelay=function(){},c.prototype.setSocketKeepAlive=function(){};var d=["accept-charset","accept-encoding","access-control-request-headers","access-control-request-method","connection","content-length","cookie","cookie2","date","dnt","expect","host","keep-alive","origin","referer","te","trailer","transfer-encoding","upgrade","via"]},5676:(t,e,i)=>{var r=i(9590),n=i(8764).Buffer,s=i(8725),o=i(5717),a=i(8473),h=e.readyStates={UNSENT:0,OPENED:1,HEADERS_RECEIVED:2,LOADING:3,DONE:4},u=e.IncomingMessage=function(t,e,i,o){var h=this;if(a.Readable.call(h),h._mode=i,h.headers={},h.rawHeaders=[],h.trailers={},h.rawTrailers=[],h.on("end",(function(){r.nextTick((function(){h.emit("close")}))})),"fetch"===i){if(h._fetchResponse=e,h.url=e.url,h.statusCode=e.status,h.statusMessage=e.statusText,e.headers.forEach((function(t,e){h.headers[e.toLowerCase()]=t,h.rawHeaders.push(e,t)})),s.writableStream){var u=new WritableStream({write:function(t){return o(!1),new Promise((function(e,i){h._destroyed?i():h.push(n.from(t))?e():h._resumeFetch=e}))},close:function(){o(!0),h._destroyed||h.push(null)},abort:function(t){o(!0),h._destroyed||h.emit("error",t)}});try{return void e.body.pipeTo(u).catch((function(t){o(!0),h._destroyed||h.emit("error",t)}))}catch(t){}}var l=e.body.getReader();!function t(){l.read().then((function(e){h._destroyed||(o(e.done),e.done?h.push(null):(h.push(n.from(e.value)),t()))})).catch((function(t){o(!0),h._destroyed||h.emit("error",t)}))}()}else if(h._xhr=t,h._pos=0,h.url=t.responseURL,h.statusCode=t.status,h.statusMessage=t.statusText,t.getAllResponseHeaders().split(/\r?\n/).forEach((function(t){var e=t.match(/^([^:]+):\s*(.*)/);if(e){var i=e[1].toLowerCase();"set-cookie"===i?(void 0===h.headers[i]&&(h.headers[i]=[]),h.headers[i].push(e[2])):void 0!==h.headers[i]?h.headers[i]+=", "+e[2]:h.headers[i]=e[2],h.rawHeaders.push(e[1],e[2])}})),h._charset="x-user-defined",!s.overrideMimeType){var c=h.rawHeaders["mime-type"];if(c){var d=c.match(/;\s*charset=([^;])(;|$)/);d&&(h._charset=d[1].toLowerCase())}h._charset||(h._charset="utf-8")}};o(u,a.Readable),u.prototype._read=function(){var t=this._resumeFetch;t&&(this._resumeFetch=null,t())},u.prototype._onXHRProgress=function(t){var e=this,r=e._xhr,s=null;switch(e._mode){case"text":if((s=r.responseText).length>e._pos){var o=s.substr(e._pos);if("x-user-defined"===e._charset){for(var a=n.alloc(o.length),u=0;ue._pos&&(e.push(n.from(new Uint8Array(l.result.slice(e._pos)))),e._pos=l.result.byteLength)},l.onload=function(){t(!0),e.push(null)},l.readAsArrayBuffer(s)}e._xhr.readyState===h.DONE&&"ms-stream"!==e._mode&&(t(!0),e.push(null))}},8677:(t,e,i)=>{t.exports=async function(t,e){const i=await r(t,e);return URL.createObjectURL(i)};const r=i(2428)},2428:t=>{t.exports=function(t,e){if(null!=e&&"string"!=typeof e)throw new Error("Invalid mimetype, expected string.");return new Promise(((i,r)=>{const n=[];t.on("data",(t=>n.push(t))).once("end",(()=>{const t=null!=e?new Blob(n,{type:e}):new Blob(n);i(t)})).once("error",r)}))}},5100:(t,e,i)=>{var r=i(8764).Buffer,n=i(778);t.exports=function(t,e,i){i=n(i);var s=r.alloc(e),o=0;t.on("data",(function(t){t.copy(s,o),o+=t.length})).on("end",(function(){i(null,s)})).on("error",i)}},1237:(t,e,i)=>{const{EventEmitter:r}=i(7187),n=new Error("Stream was destroyed"),s=new Error("Premature close"),o=i(3527),a=i(1607),h=33554431,u=1^h,l=8192,c=384^h,d=8<<16,f=32<<16,p=64<<16,m=8454144,g=256<<16,b=33488895,v=65544,y=2105344,w=6|y,_=8470536,M=8404999,k=589831,x=Symbol.asyncIterator||Symbol("asyncIterator");class E{constructor(t,{highWaterMark:e=16384,map:i=null,mapWritable:r,byteLength:n,byteLengthWritable:s}={}){this.stream=t,this.queue=new a,this.highWaterMark=e,this.buffered=0,this.error=null,this.pipeline=null,this.byteLength=s||n||Z,this.map=r||i,this.afterWrite=R.bind(this),this.afterUpdateNextTick=O.bind(this)}get ended(){return 0!=(this.stream._duplexState&f)}push(t){return null!==this.map&&(t=this.map(t)),this.buffered+=this.byteLength(t),this.queue.push(t),this.buffered=t._readableState.highWaterMark}static isPaused(t){return 0==(128&t._duplexState)}[x](){const t=this;let e=null,i=null,r=null;return this.on("error",(t=>{e=t})),this.on("readable",(function(){null!==i&&s(t.read())})),this.on("close",(function(){null!==i&&s(null)})),{[x](){return this},next:()=>new Promise((function(e,n){i=e,r=n;const o=t.read();null!==o?s(o):0!=(4&t._duplexState)&&s(null)})),return:()=>o(null),throw:t=>o(t)};function s(s){null!==r&&(e?r(e):null===s&&0==(t._duplexState&l)?r(n):i({value:s,done:null===s}),r=i=null)}function o(e){return t.destroy(e),new Promise(((i,r)=>{if(4&t._duplexState)return i({value:void 0,done:!0});t.once("close",(function(){e?r(e):i({value:void 0,done:!0})}))}))}}}class F extends U{constructor(t){super(t),this._duplexState=1,this._writableState=new E(this,t),t&&(t.writev&&(this._writev=t.writev),t.write&&(this._write=t.write),t.final&&(this._final=t.final))}_writev(t,e){e(null)}_write(t,e){this._writableState.autoBatch(t,e)}_final(t){t(null)}write(t){return this._writableState.updateNextTick(),this._writableState.push(t)}end(t){return this._writableState.updateNextTick(),this._writableState.end(t),this}}class q extends F{constructor(t){super(t),this._transformState=new T(this),t&&(t.transform&&(this._transform=t.transform),t.flush&&(this._flush=t.flush))}_write(t,e){this._readableState.buffered>=this._readableState.highWaterMark?this._transformState.data=t:this._transform(t,this._transformState.afterTransform)}_read(t){if(null!==this._transformState.data){const e=this._transformState.data;this._transformState.data=null,t(null),this._transform(e,this._transformState.afterTransform)}else t(null)}_transform(t,e){e(null,t)}_flush(t){t(null)}_final(t){this._transformState.afterFinal=t,this._flush(z.bind(this))}}function z(t,e){const i=this._transformState.afterFinal;if(t)return i(t);null!=e&&this.push(e),this.push(null),i(null)}function H(t,...e){const i=Array.isArray(t)?[...t,...e]:[t,...e],r=i.length&&"function"==typeof i[i.length-1]?i.pop():null;if(i.length<2)throw new Error("Pipeline requires at least 2 streams");let n=i[0],o=null,a=null;for(let t=1;t1,u),n.pipe(o)),n=o;if(r){let t=!1;o.on("finish",(()=>{t=!0})),o.on("error",(t=>{a=a||t})),o.on("close",(()=>r(a||(t?null:s))))}return o;function h(t,e,i,r){t.on("error",r),t.on("close",(function(){return e&&t._readableState&&!t._readableState.ended||i&&t._writableState&&!t._writableState.ended?r(s):void 0}))}function u(t){if(t&&!a){a=t;for(const e of i)e.destroy(t)}}}function W(t){return!!t._readableState||!!t._writableState}function $(t){return"number"==typeof t._duplexState&&W(t)}function Z(t){return function(t){return"object"==typeof t&&null!==t&&"number"==typeof t.byteLength}(t)?t.byteLength:1024}function V(){}function K(){this.destroy(new Error("Stream aborted."))}t.exports={pipeline:H,pipelinePromise:function(...t){return new Promise(((e,i)=>H(...t,(t=>{if(t)return i(t);e()}))))},isStream:W,isStreamx:$,Stream:j,Writable:class extends j{constructor(t){super(t),this._duplexState|=8193,this._writableState=new E(this,t),t&&(t.writev&&(this._writev=t.writev),t.write&&(this._write=t.write),t.final&&(this._final=t.final))}_writev(t,e){e(null)}_write(t,e){this._writableState.autoBatch(t,e)}_final(t){t(null)}static isBackpressured(t){return 0!=(19922950&t._duplexState)}write(t){return this._writableState.updateNextTick(),this._writableState.push(t)}end(t){return this._writableState.updateNextTick(),this._writableState.end(t),this}},Readable:U,Duplex:F,Transform:q,PassThrough:class extends q{}}},2553:(t,e,i)=>{"use strict";var r=i(9509).Buffer,n=r.isEncoding||function(t){switch((t=""+t)&&t.toLowerCase()){case"hex":case"utf8":case"utf-8":case"ascii":case"binary":case"base64":case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":case"raw":return!0;default:return!1}};function s(t){var e;switch(this.encoding=function(t){var e=function(t){if(!t)return"utf8";for(var e;;)switch(t){case"utf8":case"utf-8":return"utf8";case"ucs2":case"ucs-2":case"utf16le":case"utf-16le":return"utf16le";case"latin1":case"binary":return"latin1";case"base64":case"ascii":case"hex":return t;default:if(e)return;t=(""+t).toLowerCase(),e=!0}}(t);if("string"!=typeof e&&(r.isEncoding===n||!n(t)))throw new Error("Unknown encoding: "+t);return e||t}(t),this.encoding){case"utf16le":this.text=h,this.end=u,e=4;break;case"utf8":this.fillLast=a,e=4;break;case"base64":this.text=l,this.end=c,e=3;break;default:return this.write=d,void(this.end=f)}this.lastNeed=0,this.lastTotal=0,this.lastChar=r.allocUnsafe(e)}function o(t){return t<=127?0:t>>5==6?2:t>>4==14?3:t>>3==30?4:t>>6==2?-1:-2}function a(t){var e=this.lastTotal-this.lastNeed,i=function(t,e,i){if(128!=(192&e[0]))return t.lastNeed=0,"�";if(t.lastNeed>1&&e.length>1){if(128!=(192&e[1]))return t.lastNeed=1,"�";if(t.lastNeed>2&&e.length>2&&128!=(192&e[2]))return t.lastNeed=2,"�"}}(this,t);return void 0!==i?i:this.lastNeed<=t.length?(t.copy(this.lastChar,e,0,this.lastNeed),this.lastChar.toString(this.encoding,0,this.lastTotal)):(t.copy(this.lastChar,e,0,t.length),void(this.lastNeed-=t.length))}function h(t,e){if((t.length-e)%2==0){var i=t.toString("utf16le",e);if(i){var r=i.charCodeAt(i.length-1);if(r>=55296&&r<=56319)return this.lastNeed=2,this.lastTotal=4,this.lastChar[0]=t[t.length-2],this.lastChar[1]=t[t.length-1],i.slice(0,-1)}return i}return this.lastNeed=1,this.lastTotal=2,this.lastChar[0]=t[t.length-1],t.toString("utf16le",e,t.length-1)}function u(t){var e=t&&t.length?this.write(t):"";if(this.lastNeed){var i=this.lastTotal-this.lastNeed;return e+this.lastChar.toString("utf16le",0,i)}return e}function l(t,e){var i=(t.length-e)%3;return 0===i?t.toString("base64",e):(this.lastNeed=3-i,this.lastTotal=3,1===i?this.lastChar[0]=t[t.length-1]:(this.lastChar[0]=t[t.length-2],this.lastChar[1]=t[t.length-1]),t.toString("base64",e,t.length-i))}function c(t){var e=t&&t.length?this.write(t):"";return this.lastNeed?e+this.lastChar.toString("base64",0,3-this.lastNeed):e}function d(t){return t.toString(this.encoding)}function f(t){return t&&t.length?this.write(t):""}e.s=s,s.prototype.write=function(t){if(0===t.length)return"";var e,i;if(this.lastNeed){if(void 0===(e=this.fillLast(t)))return"";i=this.lastNeed,this.lastNeed=0}else i=0;return i=0?(n>0&&(t.lastNeed=n-1),n):--r=0?(n>0&&(t.lastNeed=n-2),n):--r=0?(n>0&&(2===n?n=0:t.lastNeed=n-3),n):0}(this,t,e);if(!this.lastNeed)return t.toString("utf8",e);this.lastTotal=i;var r=t.length-(i-this.lastNeed);return t.copy(this.lastChar,0,r),t.toString("utf8",e,r)},s.prototype.fillLast=function(t){if(this.lastNeed<=t.length)return t.copy(this.lastChar,this.lastTotal-this.lastNeed,0,this.lastNeed),this.lastChar.toString(this.encoding,0,this.lastTotal);t.copy(this.lastChar,this.lastTotal-this.lastNeed,0,t.length),this.lastNeed-=t.length}},5017:(t,e,i)=>{var r=i(883);e.encode=r.encode,e.decode=r.decode},883:(t,e,i)=>{"use strict";var r=i(8764).Buffer,n=[255,255,26,27,28,29,30,31,255,255,255,255,255,255,255,255,255,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,255,255,255,255,255,255,0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,255,255,255,255,255];e.encode=function(t){r.isBuffer(t)||(t=new r(t));for(var e,i,n=0,s=0,o=0,a=0,h=new r(8*(e=t,i=Math.floor(e.length/5),e.length%5==0?i:i+1));n3?(a=(a=u&255>>o)<<(o=(o+5)%8)|(n+1>8-o,n++):(a=u>>8-(o+5)&31,0==(o=(o+5)%8)&&n++),h[s]="ABCDEFGHIJKLMNOPQRSTUVWXYZ234567".charCodeAt(a),s++}for(n=s;n>>(i=(i+5)%8),a[o]=e,o++,e=255&s<<8-i)}return a.slice(0,o)}},2885:(t,e,i)=>{var r=i(8764).Buffer;t.exports=function(t){if(t instanceof Uint8Array){if(0===t.byteOffset&&t.byteLength===t.buffer.byteLength)return t.buffer;if("function"==typeof t.buffer.slice)return t.buffer.slice(t.byteOffset,t.byteOffset+t.byteLength)}if(r.isBuffer(t)){for(var e=new Uint8Array(t.length),i=t.length,n=0;n{var r=i(9590);const n=i(1227)("torrent-discovery"),s=i(2378),o=i(7187).EventEmitter,a=i(4595),h=i(8735),u=i(2067);t.exports=class extends o{constructor(t){if(super(),!t.peerId)throw new Error("Option `peerId` is required");if(!t.infoHash)throw new Error("Option `infoHash` is required");if(!r.browser&&!t.port)throw new Error("Option `port` is required");this.peerId="string"==typeof t.peerId?t.peerId:t.peerId.toString("hex"),this.infoHash="string"==typeof t.infoHash?t.infoHash.toLowerCase():t.infoHash.toString("hex"),this._port=t.port,this._userAgent=t.userAgent,this.destroyed=!1,this._announce=t.announce||[],this._intervalMs=t.intervalMs||9e5,this._trackerOpts=null,this._dhtAnnouncing=!1,this._dhtTimeout=!1,this._internalDHT=!1,this._onWarning=t=>{this.emit("warning",t)},this._onError=t=>{this.emit("error",t)},this._onDHTPeer=(t,e)=>{e.toString("hex")===this.infoHash&&this.emit("peer",`${t.host}:${t.port}`,"dht")},this._onTrackerPeer=t=>{this.emit("peer",t,"tracker")},this._onTrackerAnnounce=()=>{this.emit("trackerAnnounce")},this._onLSDPeer=(t,e)=>{this.emit("peer",t,"lsd")};const e=(t,e)=>{const i=new s(e);return i.on("warning",this._onWarning),i.on("error",this._onError),i.listen(t),this._internalDHT=!0,i};!1===t.tracker?this.tracker=null:t.tracker&&"object"==typeof t.tracker?(this._trackerOpts=Object.assign({},t.tracker),this.tracker=this._createTracker()):this.tracker=this._createTracker(),!1===t.dht||"function"!=typeof s?this.dht=null:t.dht&&"function"==typeof t.dht.addNode?this.dht=t.dht:t.dht&&"object"==typeof t.dht?this.dht=e(t.dhtPort,t.dht):this.dht=e(t.dhtPort),this.dht&&(this.dht.on("peer",this._onDHTPeer),this._dhtAnnounce()),!1===t.lsd||"function"!=typeof u?this.lsd=null:this.lsd=this._createLSD()}updatePort(t){t!==this._port&&(this._port=t,this.dht&&this._dhtAnnounce(),this.tracker&&(this.tracker.stop(),this.tracker.destroy((()=>{this.tracker=this._createTracker()}))))}complete(t){this.tracker&&this.tracker.complete(t)}destroy(t){if(this.destroyed)return;this.destroyed=!0,clearTimeout(this._dhtTimeout);const e=[];this.tracker&&(this.tracker.stop(),this.tracker.removeListener("warning",this._onWarning),this.tracker.removeListener("error",this._onError),this.tracker.removeListener("peer",this._onTrackerPeer),this.tracker.removeListener("update",this._onTrackerAnnounce),e.push((t=>{this.tracker.destroy(t)}))),this.dht&&this.dht.removeListener("peer",this._onDHTPeer),this._internalDHT&&(this.dht.removeListener("warning",this._onWarning),this.dht.removeListener("error",this._onError),e.push((t=>{this.dht.destroy(t)}))),this.lsd&&(this.lsd.removeListener("warning",this._onWarning),this.lsd.removeListener("error",this._onError),this.lsd.removeListener("peer",this._onLSDPeer),e.push((t=>{this.lsd.destroy(t)}))),a(e,t),this.dht=null,this.tracker=null,this.lsd=null,this._announce=null}_createTracker(){const t=Object.assign({},this._trackerOpts,{infoHash:this.infoHash,announce:this._announce,peerId:this.peerId,port:this._port,userAgent:this._userAgent}),e=new h(t);return e.on("warning",this._onWarning),e.on("error",this._onError),e.on("peer",this._onTrackerPeer),e.on("update",this._onTrackerAnnounce),e.setInterval(this._intervalMs),e.start(),e}_dhtAnnounce(){this._dhtAnnouncing||(n("dht announce"),this._dhtAnnouncing=!0,clearTimeout(this._dhtTimeout),this.dht.announce(this.infoHash,this._port,(t=>{this._dhtAnnouncing=!1,n("dht announce complete"),t&&this.emit("warning",t),this.emit("dhtAnnounce"),this.destroyed||(this._dhtTimeout=setTimeout((()=>{this._dhtAnnounce()}),this._intervalMs+Math.floor(Math.random()*this._intervalMs/5)),this._dhtTimeout.unref&&this._dhtTimeout.unref())})))}_createLSD(){const t=Object.assign({},{infoHash:this.infoHash,peerId:this.peerId,port:this._port}),e=new u(t);return e.on("warning",this._onWarning),e.on("error",this._onError),e.on("peer",this._onLSDPeer),e.start(),e}}},8687:(t,e,i)=>{var r=i(8764).Buffer;const n=16384;class s{constructor(t){this.length=t,this.missing=t,this.sources=null,this._chunks=Math.ceil(t/n),this._remainder=t%n||n,this._buffered=0,this._buffer=null,this._cancellations=null,this._reservations=0,this._flushed=!1}chunkLength(t){return t===this._chunks-1?this._remainder:n}chunkLengthRemaining(t){return this.length-t*n}chunkOffset(t){return t*n}reserve(){return this.init()?this._cancellations.length?this._cancellations.pop():this._reservations{var r=i(8764).Buffer,n=i(4501).strict;t.exports=function(t){if(n(t)){var e=r.from(t.buffer);return t.byteLength!==t.buffer.byteLength&&(e=e.slice(t.byteOffset,t.byteOffset+t.byteLength)),e}return r.from(t)}},4372:(t,e,i)=>{var r=i(2822),n=Math.pow(2,32);e.encodingLength=function(){return 8},e.encode=function(t,e,i){e||(e=r(8)),i||(i=0);var s=Math.floor(t/n),o=t-s*n;return e.writeUInt32BE(s,i),e.writeUInt32BE(o,i+4),e},e.decode=function(t,e){e||(e=0);var i=t.readUInt32BE(e),r=t.readUInt32BE(e+4);return i*n+r},e.encode.bytes=8,e.decode.bytes=8},6581:t=>{t.exports=function(t,e){if(!(e>=t.length||e<0)){var i=t.pop();if(e= 0x80 (not a basic code point)","invalid-input":"Invalid input"},f=Math.floor,p=String.fromCharCode;function m(t){throw RangeError(d[t])}function g(t,e){for(var i=t.length,r=[];i--;)r[i]=e(t[i]);return r}function b(t,e){var i=t.split("@"),r="";return i.length>1&&(r=i[0]+"@",t=i[1]),r+g((t=t.replace(c,".")).split("."),e).join(".")}function v(t){for(var e,i,r=[],n=0,s=t.length;n=55296&&e<=56319&&n65535&&(e+=p((t-=65536)>>>10&1023|55296),t=56320|1023&t),e+p(t)})).join("")}function w(t,e){return t+22+75*(t<26)-((0!=e)<<5)}function _(t,e,i){var r=0;for(t=i?f(t/700):t>>1,t+=f(t/e);t>455;r+=h)t=f(t/35);return f(r+36*t/(t+38))}function M(t){var e,i,r,n,s,o,u,l,c,d,p,g=[],b=t.length,v=0,w=128,M=72;for((i=t.lastIndexOf("-"))<0&&(i=0),r=0;r=128&&m("not-basic"),g.push(t.charCodeAt(r));for(n=i>0?i+1:0;n=b&&m("invalid-input"),((l=(p=t.charCodeAt(n++))-48<10?p-22:p-65<26?p-65:p-97<26?p-97:h)>=h||l>f((a-v)/o))&&m("overflow"),v+=l*o,!(l<(c=u<=M?1:u>=M+26?26:u-M));u+=h)o>f(a/(d=h-c))&&m("overflow"),o*=d;M=_(v-s,e=g.length+1,0==s),f(v/e)>a-w&&m("overflow"),w+=f(v/e),v%=e,g.splice(v++,0,w)}return y(g)}function k(t){var e,i,r,n,s,o,u,l,c,d,g,b,y,M,k,x=[];for(b=(t=v(t)).length,e=128,i=0,s=72,o=0;o=e&&gf((a-i)/(y=r+1))&&m("overflow"),i+=(u-e)*y,e=u,o=0;oa&&m("overflow"),g==e){for(l=i,c=h;!(l<(d=c<=s?1:c>=s+26?26:c-s));c+=h)k=l-d,M=h-d,x.push(p(w(d+k%M,0))),l=f(k/M);x.push(p(w(l,0))),s=_(i,y,r==n),i=0,++r}++i,++e}return x.join("")}o={version:"1.3.2",ucs2:{decode:v,encode:y},decode:M,encode:k,toASCII:function(t){return b(t,(function(t){return l.test(t)?"xn--"+k(t):t}))},toUnicode:function(t){return b(t,(function(t){return u.test(t)?M(t.slice(4).toLowerCase()):t}))}},void 0===(r=function(){return o}.call(e,i,e,t))||(t.exports=r)}()},8575:(t,e,i)=>{"use strict";var r=i(2511),n=i(2502);function s(){this.protocol=null,this.slashes=null,this.auth=null,this.host=null,this.port=null,this.hostname=null,this.hash=null,this.search=null,this.query=null,this.pathname=null,this.path=null,this.href=null}e.parse=y,e.resolve=function(t,e){return y(t,!1,!0).resolve(e)},e.resolveObject=function(t,e){return t?y(t,!1,!0).resolveObject(e):e},e.format=function(t){return n.isString(t)&&(t=y(t)),t instanceof s?t.format():s.prototype.format.call(t)},e.Url=s;var o=/^([a-z0-9.+-]+:)/i,a=/:[0-9]*$/,h=/^(\/\/?(?!\/)[^\?\s]*)(\?[^\s]*)?$/,u=["{","}","|","\\","^","`"].concat(["<",">",'"',"`"," ","\r","\n","\t"]),l=["'"].concat(u),c=["%","/","?",";","#"].concat(l),d=["/","?","#"],f=/^[+a-z0-9A-Z_-]{0,63}$/,p=/^([+a-z0-9A-Z_-]{0,63})(.*)$/,m={javascript:!0,"javascript:":!0},g={javascript:!0,"javascript:":!0},b={http:!0,https:!0,ftp:!0,gopher:!0,file:!0,"http:":!0,"https:":!0,"ftp:":!0,"gopher:":!0,"file:":!0},v=i(7673);function y(t,e,i){if(t&&n.isObject(t)&&t instanceof s)return t;var r=new s;return r.parse(t,e,i),r}s.prototype.parse=function(t,e,i){if(!n.isString(t))throw new TypeError("Parameter 'url' must be a string, not "+typeof t);var s=t.indexOf("?"),a=-1!==s&&s127?P+="x":P+=R[L];if(!P.match(f)){var D=C.slice(0,T),N=C.slice(T+1),j=R.match(p);j&&(D.push(j[1]),N.unshift(j[2])),N.length&&(y="/"+N.join(".")+y),this.hostname=D.join(".");break}}}this.hostname.length>255?this.hostname="":this.hostname=this.hostname.toLowerCase(),I||(this.hostname=r.toASCII(this.hostname));var U=this.port?":"+this.port:"",F=this.hostname||"";this.host=F+U,this.href+=this.host,I&&(this.hostname=this.hostname.substr(1,this.hostname.length-2),"/"!==y[0]&&(y="/"+y))}if(!m[M])for(T=0,B=l.length;T0)&&i.host.split("@"))&&(i.auth=I.shift(),i.host=i.hostname=I.shift())),i.search=t.search,i.query=t.query,n.isNull(i.pathname)&&n.isNull(i.search)||(i.path=(i.pathname?i.pathname:"")+(i.search?i.search:"")),i.href=i.format(),i;if(!k.length)return i.pathname=null,i.search?i.path="/"+i.search:i.path=null,i.href=i.format(),i;for(var E=k.slice(-1)[0],S=(i.host||t.host||k.length>1)&&("."===E||".."===E)||""===E,T=0,A=k.length;A>=0;A--)"."===(E=k[A])?k.splice(A,1):".."===E?(k.splice(A,1),T++):T&&(k.splice(A,1),T--);if(!_&&!M)for(;T--;T)k.unshift("..");!_||""===k[0]||k[0]&&"/"===k[0].charAt(0)||k.unshift(""),S&&"/"!==k.join("/").substr(-1)&&k.push("");var I,C=""===k[0]||k[0]&&"/"===k[0].charAt(0);return x&&(i.hostname=i.host=C?"":k.length?k.shift():"",(I=!!(i.host&&i.host.indexOf("@")>0)&&i.host.split("@"))&&(i.auth=I.shift(),i.host=i.hostname=I.shift())),(_=_||i.host&&k.length)&&!C&&k.unshift(""),k.length?i.pathname=k.join("/"):(i.pathname=null,i.path=null),n.isNull(i.pathname)&&n.isNull(i.search)||(i.path=(i.pathname?i.pathname:"")+(i.search?i.search:"")),i.auth=t.auth||i.auth,i.slashes=i.slashes||t.slashes,i.href=i.format(),i},s.prototype.parseHost=function(){var t=this.host,e=a.exec(t);e&&(":"!==(e=e[0])&&(this.port=e.substr(1)),t=t.substr(0,t.length-e.length)),t&&(this.hostname=t)}},2502:t=>{"use strict";t.exports={isString:function(t){return"string"==typeof t},isObject:function(t){return"object"==typeof t&&null!==t},isNull:function(t){return null===t},isNullOrUndefined:function(t){return null==t}}},2219:(t,e,i)=>{var r=i(8764).Buffer;const{EventEmitter:n}=i(7187),s=i(5799),o=i(8833).default,a=i(1227)("ut_metadata"),h=i(4159),u=16384;t.exports=t=>{class e extends n{constructor(e){super(),this._wire=e,this._fetching=!1,this._metadataComplete=!1,this._metadataSize=null,this._remainingRejects=null,this._bitfield=new o(0,{grow:1e3}),r.isBuffer(t)&&this.setMetadata(t)}onHandshake(t,e,i){this._infoHash=t}onExtendedHandshake(t){return t.m&&t.m.ut_metadata?t.metadata_size?"number"!=typeof t.metadata_size||1e7this._metadataSize&&(i=this._metadataSize);const r=this.metadata.slice(e,i);this._data(t,r,this._metadataSize)}_onData(t,e,i){e.length>u||!this._fetching||(e.copy(this.metadata,t*u),this._bitfield.set(t),this._checkDone())}_onReject(t){this._remainingRejects>0&&this._fetching?(this._request(t),this._remainingRejects-=1):this.emit("warning",new Error('Peer sent "reject" too much'))}_requestPieces(){if(this._fetching){this.metadata=r.alloc(this._metadataSize);for(let t=0;t0?this._requestPieces():this.emit("warning",new Error("Peer sent invalid metadata"))}}return e.prototype.name="ut_metadata",e}},4927:(t,e,i)=>{var r=i(5108);function n(t){try{if(!i.g.localStorage)return!1}catch(t){return!1}var e=i.g.localStorage[t];return null!=e&&"true"===String(e).toLowerCase()}t.exports=function(t,e){if(n("noDeprecation"))return t;var i=!1;return function(){if(!i){if(n("throwDeprecation"))throw new Error(e);n("traceDeprecation")?r.trace(e):r.warn(e),i=!0}return t.apply(this,arguments)}}},384:t=>{t.exports=function(t){return t&&"object"==typeof t&&"function"==typeof t.copy&&"function"==typeof t.fill&&"function"==typeof t.readUInt8}},5955:(t,e,i)=>{"use strict";var r=i(2584),n=i(8662),s=i(6430),o=i(5692);function a(t){return t.call.bind(t)}var h="undefined"!=typeof BigInt,u="undefined"!=typeof Symbol,l=a(Object.prototype.toString),c=a(Number.prototype.valueOf),d=a(String.prototype.valueOf),f=a(Boolean.prototype.valueOf);if(h)var p=a(BigInt.prototype.valueOf);if(u)var m=a(Symbol.prototype.valueOf);function g(t,e){if("object"!=typeof t)return!1;try{return e(t),!0}catch(t){return!1}}function b(t){return"[object Map]"===l(t)}function v(t){return"[object Set]"===l(t)}function y(t){return"[object WeakMap]"===l(t)}function w(t){return"[object WeakSet]"===l(t)}function _(t){return"[object ArrayBuffer]"===l(t)}function M(t){return"undefined"!=typeof ArrayBuffer&&(_.working?_(t):t instanceof ArrayBuffer)}function k(t){return"[object DataView]"===l(t)}function x(t){return"undefined"!=typeof DataView&&(k.working?k(t):t instanceof DataView)}e.isArgumentsObject=r,e.isGeneratorFunction=n,e.isTypedArray=o,e.isPromise=function(t){return"undefined"!=typeof Promise&&t instanceof Promise||null!==t&&"object"==typeof t&&"function"==typeof t.then&&"function"==typeof t.catch},e.isArrayBufferView=function(t){return"undefined"!=typeof ArrayBuffer&&ArrayBuffer.isView?ArrayBuffer.isView(t):o(t)||x(t)},e.isUint8Array=function(t){return"Uint8Array"===s(t)},e.isUint8ClampedArray=function(t){return"Uint8ClampedArray"===s(t)},e.isUint16Array=function(t){return"Uint16Array"===s(t)},e.isUint32Array=function(t){return"Uint32Array"===s(t)},e.isInt8Array=function(t){return"Int8Array"===s(t)},e.isInt16Array=function(t){return"Int16Array"===s(t)},e.isInt32Array=function(t){return"Int32Array"===s(t)},e.isFloat32Array=function(t){return"Float32Array"===s(t)},e.isFloat64Array=function(t){return"Float64Array"===s(t)},e.isBigInt64Array=function(t){return"BigInt64Array"===s(t)},e.isBigUint64Array=function(t){return"BigUint64Array"===s(t)},b.working="undefined"!=typeof Map&&b(new Map),e.isMap=function(t){return"undefined"!=typeof Map&&(b.working?b(t):t instanceof Map)},v.working="undefined"!=typeof Set&&v(new Set),e.isSet=function(t){return"undefined"!=typeof Set&&(v.working?v(t):t instanceof Set)},y.working="undefined"!=typeof WeakMap&&y(new WeakMap),e.isWeakMap=function(t){return"undefined"!=typeof WeakMap&&(y.working?y(t):t instanceof WeakMap)},w.working="undefined"!=typeof WeakSet&&w(new WeakSet),e.isWeakSet=function(t){return w(t)},_.working="undefined"!=typeof ArrayBuffer&&_(new ArrayBuffer),e.isArrayBuffer=M,k.working="undefined"!=typeof ArrayBuffer&&"undefined"!=typeof DataView&&k(new DataView(new ArrayBuffer(1),0,1)),e.isDataView=x;var E="undefined"!=typeof SharedArrayBuffer?SharedArrayBuffer:void 0;function S(t){return"[object SharedArrayBuffer]"===l(t)}function T(t){return void 0!==E&&(void 0===S.working&&(S.working=S(new E)),S.working?S(t):t instanceof E)}function A(t){return g(t,c)}function I(t){return g(t,d)}function C(t){return g(t,f)}function B(t){return h&&g(t,p)}function R(t){return u&&g(t,m)}e.isSharedArrayBuffer=T,e.isAsyncFunction=function(t){return"[object AsyncFunction]"===l(t)},e.isMapIterator=function(t){return"[object Map Iterator]"===l(t)},e.isSetIterator=function(t){return"[object Set Iterator]"===l(t)},e.isGeneratorObject=function(t){return"[object Generator]"===l(t)},e.isWebAssemblyCompiledModule=function(t){return"[object WebAssembly.Module]"===l(t)},e.isNumberObject=A,e.isStringObject=I,e.isBooleanObject=C,e.isBigIntObject=B,e.isSymbolObject=R,e.isBoxedPrimitive=function(t){return A(t)||I(t)||C(t)||B(t)||R(t)},e.isAnyArrayBuffer=function(t){return"undefined"!=typeof Uint8Array&&(M(t)||T(t))},["isProxy","isExternal","isModuleNamespaceObject"].forEach((function(t){Object.defineProperty(e,t,{enumerable:!1,value:function(){throw new Error(t+" is not supported in userland")}})}))},9539:(t,e,i)=>{var r=i(9590),n=i(5108),s=Object.getOwnPropertyDescriptors||function(t){for(var e=Object.keys(t),i={},r=0;r=n)return t;switch(t){case"%s":return String(r[i++]);case"%d":return Number(r[i++]);case"%j":try{return JSON.stringify(r[i++])}catch(t){return"[Circular]"}default:return t}})),a=r[i];i=3&&(r.depth=arguments[2]),arguments.length>=4&&(r.colors=arguments[3]),b(i)?r.showHidden=i:i&&e._extend(r,i),_(r.showHidden)&&(r.showHidden=!1),_(r.depth)&&(r.depth=2),_(r.colors)&&(r.colors=!1),_(r.customInspect)&&(r.customInspect=!0),r.colors&&(r.stylize=c),f(r,t,r.depth)}function c(t,e){var i=l.styles[e];return i?"["+l.colors[i][0]+"m"+t+"["+l.colors[i][1]+"m":t}function d(t,e){return t}function f(t,i,r){if(t.customInspect&&i&&S(i.inspect)&&i.inspect!==e.inspect&&(!i.constructor||i.constructor.prototype!==i)){var n=i.inspect(r,t);return w(n)||(n=f(t,n,r)),n}var s=function(t,e){if(_(e))return t.stylize("undefined","undefined");if(w(e)){var i="'"+JSON.stringify(e).replace(/^"|"$/g,"").replace(/'/g,"\\'").replace(/\\"/g,'"')+"'";return t.stylize(i,"string")}return y(e)?t.stylize(""+e,"number"):b(e)?t.stylize(""+e,"boolean"):v(e)?t.stylize("null","null"):void 0}(t,i);if(s)return s;var o=Object.keys(i),a=function(t){var e={};return t.forEach((function(t,i){e[t]=!0})),e}(o);if(t.showHidden&&(o=Object.getOwnPropertyNames(i)),E(i)&&(o.indexOf("message")>=0||o.indexOf("description")>=0))return p(i);if(0===o.length){if(S(i)){var h=i.name?": "+i.name:"";return t.stylize("[Function"+h+"]","special")}if(M(i))return t.stylize(RegExp.prototype.toString.call(i),"regexp");if(x(i))return t.stylize(Date.prototype.toString.call(i),"date");if(E(i))return p(i)}var u,l="",c=!1,d=["{","}"];return g(i)&&(c=!0,d=["[","]"]),S(i)&&(l=" [Function"+(i.name?": "+i.name:"")+"]"),M(i)&&(l=" "+RegExp.prototype.toString.call(i)),x(i)&&(l=" "+Date.prototype.toUTCString.call(i)),E(i)&&(l=" "+p(i)),0!==o.length||c&&0!=i.length?r<0?M(i)?t.stylize(RegExp.prototype.toString.call(i),"regexp"):t.stylize("[Object]","special"):(t.seen.push(i),u=c?function(t,e,i,r,n){for(var s=[],o=0,a=e.length;o60?i[0]+(""===e?"":e+"\n ")+" "+t.join(",\n ")+" "+i[1]:i[0]+e+" "+t.join(", ")+" "+i[1]}(u,l,d)):d[0]+l+d[1]}function p(t){return"["+Error.prototype.toString.call(t)+"]"}function m(t,e,i,r,n,s){var o,a,h;if((h=Object.getOwnPropertyDescriptor(e,n)||{value:e[n]}).get?a=h.set?t.stylize("[Getter/Setter]","special"):t.stylize("[Getter]","special"):h.set&&(a=t.stylize("[Setter]","special")),B(r,n)||(o="["+n+"]"),a||(t.seen.indexOf(h.value)<0?(a=v(i)?f(t,h.value,null):f(t,h.value,i-1)).indexOf("\n")>-1&&(a=s?a.split("\n").map((function(t){return" "+t})).join("\n").substr(2):"\n"+a.split("\n").map((function(t){return" "+t})).join("\n")):a=t.stylize("[Circular]","special")),_(o)){if(s&&n.match(/^\d+$/))return a;(o=JSON.stringify(""+n)).match(/^"([a-zA-Z_][a-zA-Z_0-9]*)"$/)?(o=o.substr(1,o.length-2),o=t.stylize(o,"name")):(o=o.replace(/'/g,"\\'").replace(/\\"/g,'"').replace(/(^"|"$)/g,"'"),o=t.stylize(o,"string"))}return o+": "+a}function g(t){return Array.isArray(t)}function b(t){return"boolean"==typeof t}function v(t){return null===t}function y(t){return"number"==typeof t}function w(t){return"string"==typeof t}function _(t){return void 0===t}function M(t){return k(t)&&"[object RegExp]"===T(t)}function k(t){return"object"==typeof t&&null!==t}function x(t){return k(t)&&"[object Date]"===T(t)}function E(t){return k(t)&&("[object Error]"===T(t)||t instanceof Error)}function S(t){return"function"==typeof t}function T(t){return Object.prototype.toString.call(t)}function A(t){return t<10?"0"+t.toString(10):t.toString(10)}e.debuglog=function(t){if(t=t.toUpperCase(),!a[t])if(h.test(t)){var i=r.pid;a[t]=function(){var r=e.format.apply(e,arguments);n.error("%s %d: %s",t,i,r)}}else a[t]=function(){};return a[t]},e.inspect=l,l.colors={bold:[1,22],italic:[3,23],underline:[4,24],inverse:[7,27],white:[37,39],grey:[90,39],black:[30,39],blue:[34,39],cyan:[36,39],green:[32,39],magenta:[35,39],red:[31,39],yellow:[33,39]},l.styles={special:"cyan",number:"yellow",boolean:"yellow",undefined:"grey",null:"bold",string:"green",date:"magenta",regexp:"red"},e.types=i(5955),e.isArray=g,e.isBoolean=b,e.isNull=v,e.isNullOrUndefined=function(t){return null==t},e.isNumber=y,e.isString=w,e.isSymbol=function(t){return"symbol"==typeof t},e.isUndefined=_,e.isRegExp=M,e.types.isRegExp=M,e.isObject=k,e.isDate=x,e.types.isDate=x,e.isError=E,e.types.isNativeError=E,e.isFunction=S,e.isPrimitive=function(t){return null===t||"boolean"==typeof t||"number"==typeof t||"string"==typeof t||"symbol"==typeof t||void 0===t},e.isBuffer=i(384);var I=["Jan","Feb","Mar","Apr","May","Jun","Jul","Aug","Sep","Oct","Nov","Dec"];function C(){var t=new Date,e=[A(t.getHours()),A(t.getMinutes()),A(t.getSeconds())].join(":");return[t.getDate(),I[t.getMonth()],e].join(" ")}function B(t,e){return Object.prototype.hasOwnProperty.call(t,e)}e.log=function(){n.log("%s - %s",C(),e.format.apply(e,arguments))},e.inherits=i(5717),e._extend=function(t,e){if(!e||!k(e))return t;for(var i=Object.keys(e),r=i.length;r--;)t[i[r]]=e[i[r]];return t};var R="undefined"!=typeof Symbol?Symbol("util.promisify.custom"):void 0;function P(t,e){if(!t){var i=new Error("Promise was rejected with a falsy value");i.reason=t,t=i}return e(t)}e.promisify=function(t){if("function"!=typeof t)throw new TypeError('The "original" argument must be of type Function');if(R&&t[R]){var e;if("function"!=typeof(e=t[R]))throw new TypeError('The "util.promisify.custom" argument must be of type Function');return Object.defineProperty(e,R,{value:e,enumerable:!1,writable:!1,configurable:!0}),e}function e(){for(var e,i,r=new Promise((function(t,r){e=t,i=r})),n=[],s=0;s{var r=i(8764).Buffer;const n=i(7513),s=i(7187),o=i(2853),a=i(2068),h=i(7856);class u{constructor(t,e){this._entries=t,this._countName=e||"count",this._index=0,this._offset=0,this.value=this._entries[0]}inc(){this._offset++,this._offset>=this._entries[this._index][this._countName]&&(this._index++,this._offset=0),this.value=this._entries[this._index]}}t.exports=class extends s{constructor(t){super(),this._tracks=[],this._file=t,this._decoder=null,this._findMoov(0)}_findMoov(t){this._decoder&&this._decoder.destroy();let e=0;this._decoder=o.decode();const i=this._file.createReadStream({start:t});i.pipe(this._decoder);const r=n=>{"moov"===n.type?(this._decoder.removeListener("box",r),this._decoder.decode((t=>{i.destroy();try{this._processMoov(t)}catch(t){t.message=`Cannot parse mp4 file: ${t.message}`,this.emit("error",t)}}))):n.length<4096?(e+=n.length,this._decoder.ignore()):(this._decoder.removeListener("box",r),e+=n.length,i.destroy(),this._decoder.destroy(),this._findMoov(t+e))};this._decoder.on("box",r)}_processMoov(t){const e=t.traks;this._tracks=[],this._hasVideo=!1,this._hasAudio=!1;for(let r=0;r=s.stsz.entries.length)break;if(f++,m+=t,f>=i.samplesPerChunk){f=0,m=0,p++;const t=s.stsc.entries[g+1];t&&p+1>=t.firstChunk&&g++}b+=e,v.inc(),y&&y.inc(),n&&w++}n.mdia.mdhd.duration=0,n.tkhd.duration=0;const _=i.sampleDescriptionId,M={type:"moov",mvhd:t.mvhd,traks:[{tkhd:n.tkhd,mdia:{mdhd:n.mdia.mdhd,hdlr:n.mdia.hdlr,elng:n.mdia.elng,minf:{vmhd:n.mdia.minf.vmhd,smhd:n.mdia.minf.smhd,dinf:n.mdia.minf.dinf,stbl:{stsd:s.stsd,stts:{version:0,flags:0,entries:[]},ctts:{version:0,flags:0,entries:[]},stsc:{version:0,flags:0,entries:[]},stsz:{version:0,flags:0,entries:[]},stco:{version:0,flags:0,entries:[]},stss:{version:0,flags:0,entries:[]}}}}}],mvex:{mehd:{fragmentDuration:t.mvhd.duration},trexs:[{trackId:n.tkhd.trackId,defaultSampleDescriptionIndex:_,defaultSampleDuration:0,defaultSampleSize:0,defaultSampleFlags:0}]}};this._tracks.push({fragmentSequence:1,trackId:n.tkhd.trackId,timeScale:n.mdia.mdhd.timeScale,samples:c,currSample:null,currTime:null,moov:M,mime:l})}if(0===this._tracks.length)return void this.emit("error",new Error("no playable tracks"));t.mvhd.duration=0,this._ftyp={type:"ftyp",brand:"iso5",brandVersion:0,compatibleBrands:["iso5"]};const n=a.encode(this._ftyp),s=this._tracks.map((t=>{const e=a.encode(t.moov);return{mime:t.mime,init:r.concat([n,e])}}));this.emit("ready",s)}seek(t){if(!this._tracks)throw new Error("Not ready yet; wait for 'ready' event");this._fileStream&&(this._fileStream.destroy(),this._fileStream=null);let e=-1;if(this._tracks.map(((i,r)=>{i.outStream&&i.outStream.destroy(),i.inStream&&(i.inStream.destroy(),i.inStream=null);const n=i.outStream=o.encode(),s=this._generateFragment(r,t);if(!s)return n.finalize();(-1===e||s.ranges[0].start{n.destroyed||n.box(t.moof,(e=>{if(e)return this.emit("error",e);n.destroyed||i.inStream.slice(t.ranges).pipe(n.mediaData(t.length,(t=>{if(t)return this.emit("error",t);if(n.destroyed)return;const e=this._generateFragment(r);if(!e)return n.finalize();a(e)})))}))};a(s)})),e>=0){const t=this._fileStream=this._file.createReadStream({start:e});this._tracks.forEach((i=>{i.inStream=new h(e,{highWaterMark:1e7}),t.pipe(i.inStream)}))}return this._tracks.map((t=>t.outStream))}_findSampleBefore(t,e){const i=this._tracks[t],r=Math.floor(i.timeScale*e);let s=n(i.samples,r,((t,e)=>t.dts+t.presentationOffset-e));for(-1===s?s=0:s<0&&(s=-s-2);!i.samples[s].sync;)s--;return s}_generateFragment(t,e){const i=this._tracks[t];let r;if(r=void 0!==e?this._findSampleBefore(t,e):i.currSample,r>=i.samples.length)return null;const n=i.samples[r].dts;let s=0;const o=[];for(var a=r;a=1*i.timeScale)break;s+=t.size;const e=o.length-1;e<0||o[e].end!==t.offset?o.push({start:t.offset,end:t.offset+t.size}):o[e].end+=t.size}return i.currSample=a,{moof:this._generateMoof(t,r,a),ranges:o,length:s}}_generateMoof(t,e,i){const r=this._tracks[t],n=[];let s=0;for(let t=e;t{var r=i(5108);const n=i(6567),s=i(4286),o=i(9872);function a(t,e,i={}){if(!(this instanceof a))return r.warn("Don't invoke VideoStream without the 'new' keyword."),new a(t,e,i);this.detailedError=null,this._elem=e,this._elemWrapper=new n(e),this._waitingFired=!1,this._trackMeta=null,this._file=t,this._tracks=null,"none"!==this._elem.preload&&this._createMuxer(),this._onError=()=>{this.detailedError=this._elemWrapper.detailedError,this.destroy()},this._onWaiting=()=>{this._waitingFired=!0,this._muxer?this._tracks&&this._pump():this._createMuxer()},e.autoplay&&(e.preload="auto"),e.addEventListener("waiting",this._onWaiting),e.addEventListener("error",this._onError)}a.prototype={_createMuxer(){this._muxer=new o(this._file),this._muxer.on("ready",(t=>{this._tracks=t.map((t=>{const e=this._elemWrapper.createWriteStream(t.mime);e.on("error",(t=>{this._elemWrapper.error(t)}));const i={muxed:null,mediaSource:e,initFlushed:!1,onInitFlushed:null};return e.write(t.init,(t=>{i.initFlushed=!0,i.onInitFlushed&&i.onInitFlushed(t)})),i})),(this._waitingFired||"auto"===this._elem.preload)&&this._pump()})),this._muxer.on("error",(t=>{this._elemWrapper.error(t)}))},_pump(){const t=this._muxer.seek(this._elem.currentTime,!this._tracks);this._tracks.forEach(((e,i)=>{const r=()=>{e.muxed&&(e.muxed.destroy(),e.mediaSource=this._elemWrapper.createWriteStream(e.mediaSource),e.mediaSource.on("error",(t=>{this._elemWrapper.error(t)}))),e.muxed=t[i],s(e.muxed,e.mediaSource)};e.initFlushed?r():e.onInitFlushed=t=>{t?this._elemWrapper.error(t):r()}}))},destroy(){this.destroyed||(this.destroyed=!0,this._elem.removeEventListener("waiting",this._onWaiting),this._elem.removeEventListener("error",this._onError),this._tracks&&this._tracks.forEach((t=>{t.muxed&&t.muxed.destroy()})),this._elem.src="")}},t.exports=a},221:(t,e,i)=>{var r=i(8764).Buffer,n=i(5108);const s=i(7187),o=i(6470),a=i(7485),h=i(3202),u=i(1227),l=i(146),c=i(2050),d=i(4595),f=i(5203),p=i(8853),m=i(4375),g=i(1798),b=i(4159),v=i(9529),{ThrottleGroup:y}=i(558),w=i(7523),_=i(5363),{version:M}=i(1907),k=u("webtorrent"),x=M.replace(/\d*./g,(t=>("0"+t%100).slice(-2))).slice(0,4),E=`-WW${x}-`;class S extends s{constructor(t={}){super(),"string"==typeof t.peerId?this.peerId=t.peerId:r.isBuffer(t.peerId)?this.peerId=t.peerId.toString("hex"):this.peerId=r.from(E+g(9).toString("base64")).toString("hex"),this.peerIdBuffer=r.from(this.peerId,"hex"),"string"==typeof t.nodeId?this.nodeId=t.nodeId:r.isBuffer(t.nodeId)?this.nodeId=t.nodeId.toString("hex"):this.nodeId=g(20).toString("hex"),this.nodeIdBuffer=r.from(this.nodeId,"hex"),this._debugId=this.peerId.toString("hex").substring(0,7),this.destroyed=!1,this.listening=!1,this.torrentPort=t.torrentPort||0,this.dhtPort=t.dhtPort||0,this.tracker=void 0!==t.tracker?t.tracker:{},this.lsd=!1!==t.lsd,this.torrents=[],this.maxConns=Number(t.maxConns)||55,this.utp=S.UTP_SUPPORT&&!1!==t.utp,this._downloadLimit=Math.max("number"==typeof t.downloadLimit?t.downloadLimit:-1,-1),this._uploadLimit=Math.max("number"==typeof t.uploadLimit?t.uploadLimit:-1,-1),this.serviceWorker=null,this.workerKeepAliveInterval=null,this.workerPortCount=0,!0===t.secure&&i(563).enableSecure(),this._debug("new webtorrent (peerId %s, nodeId %s, port %s)",this.peerId,this.nodeId,this.torrentPort),this.throttleGroups={down:new y({rate:Math.max(this._downloadLimit,0),enabled:this._downloadLimit>=0}),up:new y({rate:Math.max(this._uploadLimit,0),enabled:this._uploadLimit>=0})},this.tracker&&("object"!=typeof this.tracker&&(this.tracker={}),globalThis.WRTC&&!this.tracker.wrtc&&(this.tracker.wrtc=globalThis.WRTC)),"function"==typeof w?this._connPool=new w(this):m((()=>{this._onListening()})),this._downloadSpeed=v(),this._uploadSpeed=v(),!1!==t.dht&&"function"==typeof l?(this.dht=new l(Object.assign({},{nodeId:this.nodeId},t.dht)),this.dht.once("error",(t=>{this._destroy(t)})),this.dht.once("listening",(()=>{const t=this.dht.address();t&&(this.dhtPort=t.port)})),this.dht.setMaxListeners(0),this.dht.listen(this.dhtPort)):this.dht=!1,this.enableWebSeeds=!1!==t.webSeeds;const e=()=>{this.destroyed||(this.ready=!0,this.emit("ready"))};"function"==typeof c&&null!=t.blocklist?c(t.blocklist,{headers:{"user-agent":`WebTorrent/${M} (https://webtorrent.io)`}},((t,i)=>{if(t)return n.error(`Failed to load blocklist: ${t.message}`);this.blocked=i,e()})):m(e)}loadWorker(t,e=(()=>{})){if(!(t instanceof ServiceWorker))throw new Error("Invalid worker registration");if("activated"!==t.state)throw new Error("Worker isn't activated");this.serviceWorker=t,navigator.serviceWorker.addEventListener("message",(t=>{const{data:e}=t;if(!e.type||"webtorrent"===!e.type||!e.url)return null;let[i,...r]=e.url.slice(e.url.indexOf(e.scope+"webtorrent/")+11+e.scope.length).split("/");if(r=decodeURI(r.join("/")),!i||!r)return null;const[n]=t.ports,s=this.get(i)&&this.get(i).files.find((t=>t.path===r));if(!s)return null;const[o,a,h]=s._serve(e),u=a&&a[Symbol.asyncIterator](),l=()=>{n.onmessage=null,a&&a.destroy(),h&&h.destroy(),this.workerPortCount--,this.workerPortCount||(clearInterval(this.workerKeepAliveInterval),this.workerKeepAliveInterval=null)};n.onmessage=async t=>{if(t.data){let t;try{t=(await u.next()).value}catch(t){}n.postMessage(t),t||l(),this.workerKeepAliveInterval||(this.workerKeepAliveInterval=setInterval((()=>fetch(`${this.serviceWorker.scriptURL.substr(0,this.serviceWorker.scriptURL.lastIndexOf("/")+1).slice(window.location.origin.length)}webtorrent/keepalive/`)),2e4))}else l()},this.workerPortCount++,n.postMessage(o)})),e(this.serviceWorker)}get downloadSpeed(){return this._downloadSpeed()}get uploadSpeed(){return this._uploadSpeed()}get progress(){const t=this.torrents.filter((t=>1!==t.progress));return t.reduce(((t,e)=>t+e.downloaded),0)/(t.reduce(((t,e)=>t+(e.length||0)),0)||1)}get ratio(){return this.torrents.reduce(((t,e)=>t+e.uploaded),0)/(this.torrents.reduce(((t,e)=>t+e.received),0)||1)}get(t){if(t instanceof _){if(this.torrents.includes(t))return t}else{let e;try{e=f(t)}catch(t){}if(!e)return null;if(!e.infoHash)throw new Error("Invalid torrent identifier");for(const t of this.torrents)if(t.infoHash===e.infoHash)return t}return null}add(t,e={},i=(()=>{})){if(this.destroyed)throw new Error("client is destroyed");"function"==typeof e&&([e,i]=[{},e]);const r=()=>{if(!this.destroyed)for(const t of this.torrents)if(t.infoHash===s.infoHash&&t!==s)return void s._destroy(new Error(`Cannot add duplicate torrent ${s.infoHash}`))},n=()=>{this.destroyed||(i(s),this.emit("torrent",s))};this._debug("add"),e=e?Object.assign({},e):{};const s=new _(t,this,e);return this.torrents.push(s),s.once("_infoHash",r),s.once("ready",n),s.once("close",(function t(){s.removeListener("_infoHash",r),s.removeListener("ready",n),s.removeListener("close",t)})),s}seed(t,e,i){if(this.destroyed)throw new Error("client is destroyed");"function"==typeof e&&([e,i]=[{},e]),this._debug("seed"),(e=e?Object.assign({},e):{}).skipVerify=!0;const r="string"==typeof t;r&&(e.path=o.dirname(t)),e.createdBy||(e.createdBy=`WebTorrent/${x}`);const s=t=>{this._debug("on seed"),"function"==typeof i&&i(t),t.emit("seed"),this.emit("seed",t)},u=this.add(null,e,(t=>{const i=[i=>{if(r||e.preloadedStore)return i();t.load(l,i)}];this.dht&&i.push((e=>{t.once("dhtAnnounce",e)})),d(i,(e=>{if(!this.destroyed)return e?t._destroy(e):void s(t)}))}));let l;return"undefined"!=typeof FileList&&t instanceof FileList?t=Array.from(t):Array.isArray(t)||(t=[t]),d(t.map((t=>i=>{!e.preloadedStore&&function(t){return"object"==typeof t&&null!=t&&"function"==typeof t.pipe}(t)?a(t,((e,r)=>{if(e)return i(e);r.name=t.name,i(null,r)})):i(null,t)})),((t,r)=>{if(!this.destroyed)return t?u._destroy(t):void h.parseInput(r,e,((t,s)=>{if(!this.destroyed){if(t)return u._destroy(t);l=s.map((t=>t.getStream)),h(r,e,((t,e)=>{if(this.destroyed)return;if(t)return u._destroy(t);const r=this.get(e);r?(n.warn("A torrent with the same id is already being seeded"),u._destroy(),"function"==typeof i&&i(r)):u._onTorrentId(e)}))}}))})),u}remove(t,e,i){if("function"==typeof e)return this.remove(t,null,e);if(this._debug("remove"),!this.get(t))throw new Error(`No torrent with id ${t}`);this._remove(t,e,i)}_remove(t,e,i){if("function"==typeof e)return this._remove(t,null,e);const r=this.get(t);r&&(this.torrents.splice(this.torrents.indexOf(r),1),r.destroy(e,i),this.dht&&this.dht._tables.remove(r.infoHash))}address(){return this.listening?this._connPool?this._connPool.tcpServer.address():{address:"0.0.0.0",family:"IPv4",port:0}:null}throttleDownload(t){return t=Number(t),!(isNaN(t)||!isFinite(t)||t<-1)&&(this._downloadLimit=t,this._downloadLimit<0?this.throttleGroups.down.setEnabled(!1):(this.throttleGroups.down.setEnabled(!0),void this.throttleGroups.down.setRate(this._downloadLimit)))}throttleUpload(t){return t=Number(t),!(isNaN(t)||!isFinite(t)||t<-1)&&(this._uploadLimit=t,this._uploadLimit<0?this.throttleGroups.up.setEnabled(!1):(this.throttleGroups.up.setEnabled(!0),void this.throttleGroups.up.setRate(this._uploadLimit)))}destroy(t){if(this.destroyed)throw new Error("client already destroyed");this._destroy(null,t)}_destroy(t,e){this._debug("client destroy"),this.destroyed=!0;const i=this.torrents.map((t=>e=>{t.destroy(e)}));this._connPool&&i.push((t=>{this._connPool.destroy(t)})),this.dht&&i.push((t=>{this.dht.destroy(t)})),d(i,e),t&&this.emit("error",t),this.torrents=[],this._connPool=null,this.dht=null,this.throttleGroups.down.destroy(),this.throttleGroups.up.destroy()}_onListening(){if(this._debug("listening"),this.listening=!0,this._connPool){const t=this._connPool.tcpServer.address();t&&(this.torrentPort=t.port)}this.emit("listening")}_debug(){const t=[].slice.call(arguments);t[0]=`[${this._debugId}] ${t[0]}`,k(...t)}_getByHash(t){for(const e of this.torrents)if(e.infoHashHash||(e.infoHashHash=b.sync(r.from("72657132"+e.infoHash,"hex"))),t===e.infoHashHash)return e;return null}}S.WEBRTC_SUPPORT=p.WEBRTC_SUPPORT,S.UTP_SUPPORT=w.UTP_SUPPORT,S.VERSION=M,t.exports=S},1208:(t,e,i)=>{const r=i(2830),n=i(1227),s=i(2840),o=n("webtorrent:file-stream");class a extends r.Readable{constructor(t,e){super(e),this._torrent=t._torrent;const i=e&&e.start||0,r=e&&e.end&&e.end{this._notify()})),s(this,(t=>{this.destroy(t)}))}_read(){this._reading||(this._reading=!0,this._notify())}_notify(){if(!this._reading||0===this._missing)return;if(!this._torrent.bitfield.get(this._piece))return this._torrent.critical(this._piece,this._piece+this._criticalLength);if(this._notifying)return;if(this._notifying=!0,this._torrent.destroyed)return this.destroy(new Error("Torrent removed"));const t=this._piece,e={};t===this._torrent.pieces.length-1&&(e.length=this._torrent.lastPieceLength),this._torrent.store.get(t,e,((e,i)=>{if(this._notifying=!1,!this.destroyed){if(o("read %s (length %s) (err %s)",t,i&&i.length,e&&e.message),e)return this.destroy(e);this._offset&&(i=i.slice(this._offset),this._offset=0),this._missing{const r=i(7187),{PassThrough:n}=i(2830),s=i(6470),o=i(38),a=i(2428),h=i(8677),u=i(5100),l=i(4375),c=i(4622),d=i(3893),f=i(2840),p=i(1208);t.exports=class extends r{constructor(t,e){super(),this._torrent=t,this._destroyed=!1,this._fileStreams=new Set,this.name=e.name,this.path=e.path,this.length=e.length,this.offset=e.offset,this.done=!1;const i=e.offset,r=i+e.length-1;this._startPiece=i/this._torrent.pieceLength|0,this._endPiece=r/this._torrent.pieceLength|0,0===this.length&&(this.done=!0,this.emit("done")),this._serviceWorker=t.client.serviceWorker}get downloaded(){if(this._destroyed||!this._torrent.bitfield)return 0;const{pieces:t,bitfield:e,pieceLength:i,lastPieceLength:r}=this._torrent,{_startPiece:n,_endPiece:s}=this,o=n=>{const s=n===t.length-1?r:i;return e.get(n)?s:s-t[n].missing};let a=0;for(let e=n;e<=s;e+=1){const h=o(e);if(a+=h,e===n){const t=this.offset%i;a-=Math.min(t,h)}if(e===s){const e=(s===t.length-1?r:i)-(this.offset+this.length)%i;a-=Math.min(e,h)}}return a}get progress(){return this.length?this.downloaded/this.length:0}select(t){0!==this.length&&this._torrent.select(this._startPiece,this._endPiece,t)}deselect(){0!==this.length&&this._torrent.deselect(this._startPiece,this._endPiece,!1)}createReadStream(t){if(0===this.length){const t=new n;return l((()=>{t.end()})),t}const e=new p(this,t);return this._fileStreams.add(e),e.once("close",(()=>{this._fileStreams.delete(e)})),e}getBuffer(t){u(this.createReadStream(),this.length,t)}getBlob(t){if("undefined"==typeof window)throw new Error("browser-only method");a(this.createReadStream(),this._getMimeType()).then((e=>t(null,e)),(e=>t(e)))}getBlobURL(t){if("undefined"==typeof window)throw new Error("browser-only method");h(this.createReadStream(),this._getMimeType()).then((e=>t(null,e)),(e=>t(e)))}appendTo(t,e,i){if("undefined"==typeof window)throw new Error("browser-only method");o.append(this,t,e,i)}renderTo(t,e,i){if("undefined"==typeof window)throw new Error("browser-only method");o.render(this,t,e,i)}_serve(t){const e={status:200,headers:{"Accept-Ranges":"bytes","Content-Type":d.getType(this.name),"Cache-Control":"no-cache, no-store, must-revalidate, max-age=0",Expires:"0"},body:"HEAD"===t.method?"":"STREAM"};"document"===t.destination&&(e.headers["Content-Type"]="application/octet-stream",e.headers["Content-Disposition"]="attachment",e.body="DOWNLOAD");let i=c(this.length,t.headers.range||"");i.constructor===Array?(e.status=206,i=i[0],e.headers["Content-Range"]=`bytes ${i.start}-${i.end}/${this.length}`,e.headers["Content-Length"]=""+(i.end-i.start+1)):e.headers["Content-Length"]=this.length;const r="GET"===t.method&&this.createReadStream(i);let n=null;return r&&this.emit("stream",{stream:r,req:t,file:this},(t=>{n=t,f(t,(()=>{t&&t.destroy(),r.destroy()}))})),[e,n||r,n&&r]}getStreamURL(t=(()=>{})){if("undefined"==typeof window)throw new Error("browser-only method");if(!this._serviceWorker)throw new Error("No worker registered");if("activated"!==this._serviceWorker.state)throw new Error("Worker isn't activated");t(null,`${this._serviceWorker.scriptURL.substr(0,this._serviceWorker.scriptURL.lastIndexOf("/")+1).slice(window.location.origin.length)}webtorrent/${this._torrent.infoHash}/${encodeURI(this.path)}`)}streamTo(t,e=(()=>{})){if("undefined"==typeof window)throw new Error("browser-only method");if(!this._serviceWorker)throw new Error("No worker registered");if("activated"!==this._serviceWorker.state)throw new Error("Worker isn't activated");const i=this._serviceWorker.scriptURL.substr(0,this._serviceWorker.scriptURL.lastIndexOf("/")+1).slice(window.location.origin.length);t.src=`${i}webtorrent/${this._torrent.infoHash}/${encodeURI(this.path)}`,e(null,t)}_getMimeType(){return o.mime[s.extname(this.name).toLowerCase()]}_destroy(){this._destroyed=!0,this._torrent=null;for(const t of this._fileStreams)t.destroy();this._fileStreams.clear()}}},563:(t,e,i)=>{const r=i(7187),{Transform:n}=i(2830),s=i(6581),o=i(1227),a=i(5228),h=o("webtorrent:peer");let u=!1;e.enableSecure=()=>{u=!0},e.createWebRTCPeer=(t,e,i)=>{const r=new d(t.id,"webrtc");if(r.conn=t,r.swarm=e,r.throttleGroups=i,r.conn.connected)r.onConnect();else{const t=()=>{r.conn.removeListener("connect",e),r.conn.removeListener("error",i)},e=()=>{t(),r.onConnect()},i=e=>{t(),r.destroy(e)};r.conn.once("connect",e),r.conn.once("error",i),r.startConnectTimeout()}return r},e.createTCPIncomingPeer=(t,e)=>l(t,"tcpIncoming",e),e.createUTPIncomingPeer=(t,e)=>l(t,"utpIncoming",e),e.createTCPOutgoingPeer=(t,e,i)=>c(t,e,"tcpOutgoing",i),e.createUTPOutgoingPeer=(t,e,i)=>c(t,e,"utpOutgoing",i);const l=(t,e,i)=>{const r=`${t.remoteAddress}:${t.remotePort}`,n=new d(r,e);return n.conn=t,n.addr=r,n.throttleGroups=i,n.onConnect(),n},c=(t,e,i,r)=>{const n=new d(t,i);return n.addr=t,n.swarm=e,n.throttleGroups=r,n};e.createWebSeedPeer=(t,e,i,r)=>{const n=new d(e,"webSeed");return n.swarm=i,n.conn=t,n.throttleGroups=r,n.onConnect(),n};class d extends r{constructor(t,e){super(),this.id=t,this.type=e,h("new %s Peer %s",e,t),this.addr=null,this.conn=null,this.swarm=null,this.wire=null,this.connected=!1,this.destroyed=!1,this.timeout=null,this.retries=0,this.sentPe1=!1,this.sentPe2=!1,this.sentPe3=!1,this.sentPe4=!1,this.sentHandshake=!1}onConnect(){if(this.destroyed)return;this.connected=!0,h("Peer %s connected",this.id),clearTimeout(this.connectTimeout);const t=this.conn;t.once("end",(()=>{this.destroy()})),t.once("close",(()=>{this.destroy()})),t.once("finish",(()=>{this.destroy()})),t.once("error",(t=>{this.destroy(t)}));const e=this.wire=new a(this.type,this.retries,u);e.once("end",(()=>{this.destroy()})),e.once("close",(()=>{this.destroy()})),e.once("finish",(()=>{this.destroy()})),e.once("error",(t=>{this.destroy(t)})),e.once("pe1",(()=>{this.onPe1()})),e.once("pe2",(()=>{this.onPe2()})),e.once("pe3",(()=>{this.onPe3()})),e.once("pe4",(()=>{this.onPe4()})),e.once("handshake",((t,e)=>{this.onHandshake(t,e)})),this.startHandshakeTimeout(),this.setThrottlePipes(),this.swarm&&("tcpOutgoing"===this.type?u&&0===this.retries&&!this.sentPe1?this.sendPe1():this.sentHandshake||this.handshake():"tcpIncoming"===this.type||this.sentHandshake||this.handshake())}sendPe1(){this.wire.sendPe1(),this.sentPe1=!0}onPe1(){this.sendPe2()}sendPe2(){this.wire.sendPe2(),this.sentPe2=!0}onPe2(){this.sendPe3()}sendPe3(){this.wire.sendPe3(this.swarm.infoHash),this.sentPe3=!0}onPe3(t){this.swarm&&(this.swarm.infoHashHash!==t&&this.destroy(new Error("unexpected crypto handshake info hash for this swarm")),this.sendPe4())}sendPe4(){this.wire.sendPe4(this.swarm.infoHash),this.sentPe4=!0}onPe4(){this.sentHandshake||this.handshake()}clearPipes(){this.conn.unpipe(),this.wire.unpipe()}setThrottlePipes(){const t=this;this.conn.pipe(this.throttleGroups.down.throttle()).pipe(new n({transform(e,i,r){t.emit("download",e.length),t.destroyed||r(null,e)}})).pipe(this.wire).pipe(this.throttleGroups.up.throttle()).pipe(new n({transform(e,i,r){t.emit("upload",e.length),t.destroyed||r(null,e)}})).pipe(this.conn)}onHandshake(t,e){if(!this.swarm)return;if(this.destroyed)return;if(this.swarm.destroyed)return this.destroy(new Error("swarm already destroyed"));if(t!==this.swarm.infoHash)return this.destroy(new Error("unexpected handshake info hash for this swarm"));if(e===this.swarm.peerId)return this.destroy(new Error("refusing to connect to ourselves"));h("Peer %s got handshake %s",this.id,t),clearTimeout(this.handshakeTimeout),this.retries=0;let i=this.addr;!i&&this.conn.remoteAddress&&this.conn.remotePort&&(i=`${this.conn.remoteAddress}:${this.conn.remotePort}`),this.swarm._onWire(this.wire,i),this.swarm&&!this.swarm.destroyed&&(this.sentHandshake||this.handshake())}handshake(){const t={dht:!this.swarm.private&&!!this.swarm.client.dht,fast:!0};this.wire.handshake(this.swarm.infoHash,this.swarm.client.peerId,t),this.sentHandshake=!0}startConnectTimeout(){clearTimeout(this.connectTimeout);this.connectTimeout=setTimeout((()=>{this.destroy(new Error("connect timeout"))}),{webrtc:25e3,tcpOutgoing:5e3,utpOutgoing:5e3}[this.type]),this.connectTimeout.unref&&this.connectTimeout.unref()}startHandshakeTimeout(){clearTimeout(this.handshakeTimeout),this.handshakeTimeout=setTimeout((()=>{this.destroy(new Error("handshake timeout"))}),25e3),this.handshakeTimeout.unref&&this.handshakeTimeout.unref()}destroy(t){if(this.destroyed)return;this.destroyed=!0,this.connected=!1,h("destroy %s %s (error: %s)",this.type,this.id,t&&(t.message||t)),clearTimeout(this.connectTimeout),clearTimeout(this.handshakeTimeout);const e=this.swarm,i=this.conn,r=this.wire;this.swarm=null,this.conn=null,this.wire=null,e&&r&&s(e.wires,e.wires.indexOf(r)),i&&(i.on("error",(()=>{})),i.destroy()),r&&r.destroy(),e&&e.removePeer(this.id)}}},742:t=>{t.exports=class{constructor(t){this._torrent=t,this._numPieces=t.pieces.length,this._pieces=new Array(this._numPieces),this._onWire=t=>{this.recalculate(),this._initWire(t)},this._onWireHave=t=>{this._pieces[t]+=1},this._onWireBitfield=()=>{this.recalculate()},this._torrent.wires.forEach((t=>{this._initWire(t)})),this._torrent.on("wire",this._onWire),this.recalculate()}getRarestPiece(t){let e=[],i=1/0;for(let r=0;r{this._cleanupWireEvents(t)})),this._torrent=null,this._pieces=null,this._onWire=null,this._onWireHave=null,this._onWireBitfield=null}_initWire(t){t._onClose=()=>{this._cleanupWireEvents(t);for(let e=0;e{var r=i(9590);const n=i(7187),s=i(9608),o=i(8856),a=i(5688),h=i(6470),u=i(2884),{default:l}=i(8833),c=i(9421),d=i(5293),f=i(9648),p=i(1227),m=i(3207),g=i(1191),b=i(6993),v=i(3700),y=i(9417),w=i(1191),_=i(5673),M=i(4595),k=i(9967),x=i(5203),E=i(8687),S=i(4286),T=i(4375),A=i(5960),I=i(4159),C=i(9529),B=i(2219),R=i(7525),P=i(1234),L=i(563),O=i(742),D=i(6322),N=i(4854),j=i(6695),U=p("webtorrent:torrent"),F=5e3,q=3*E.BLOCK_LENGTH,z=r.browser?f().length:2,H=[1e3,5e3,15e3],W=`WebTorrent/${i(1907).version} (https://webtorrent.io)`;let $;try{$=h.join(s.statSync("/tmp")&&"/tmp","webtorrent")}catch(t){$=h.join("function"==typeof a.tmpdir?a.tmpdir():"/","webtorrent")}function Z(t,e){let i=2+Math.ceil(e*t.downloadSpeed()/E.BLOCK_LENGTH);if(t.peerExtendedHandshake){const e=t.peerExtendedHandshake.reqq;"number"==typeof e&&e>0&&(i=Math.min(i,e))}return i}function V(){}t.exports=class extends n{constructor(t,e,i){super(),this._debugId="unknown infohash",this.client=e,this.announce=i.announce,this.urlList=i.urlList,this.path=i.path||$,this.addUID=i.addUID||!1,this.skipVerify=!!i.skipVerify,this._store=i.store||g,this._preloadedStore=i.preloadedStore||null,this._storeCacheSlots=void 0!==i.storeCacheSlots?i.storeCacheSlots:20,this._destroyStoreOnDestroy=i.destroyStoreOnDestroy||!1,this._getAnnounceOpts=i.getAnnounceOpts,"boolean"==typeof i.private&&(this.private=i.private),this.strategy=i.strategy||"sequential",this.maxWebConns=i.maxWebConns||4,this._rechokeNumSlots=!1===i.uploads||0===i.uploads?0:+i.uploads||10,this._rechokeOptimisticWire=null,this._rechokeOptimisticTime=0,this._rechokeIntervalId=null,this.ready=!1,this.destroyed=!1,this.paused=i.paused||!1,this.done=!1,this.metadata=null,this.store=null,this.storeOpts=i.storeOpts,this.files=[],this.pieces=[],this._amInterested=!1,this._selections=[],this._critical=[],this.wires=[],this._queue=[],this._peers={},this._peersLength=0,this.received=0,this.uploaded=0,this._downloadSpeed=C(),this._uploadSpeed=C(),this._servers=[],this._xsRequests=[],this._fileModtimes=i.fileModtimes,null!==t&&this._onTorrentId(t),this._debug("new torrent")}get timeRemaining(){return this.done?0:0===this.downloadSpeed?1/0:(this.length-this.downloaded)/this.downloadSpeed*1e3}get downloaded(){if(!this.bitfield)return 0;let t=0;for(let e=0,i=this.pieces.length;e{this.destroyed||this._onParsedTorrent(e)}))):x.remote(t,((t,e)=>{if(!this.destroyed)return t?this._destroy(t):void this._onParsedTorrent(e)}))}_onParsedTorrent(t){if(!this.destroyed){if(this._processParsedTorrent(t),!this.infoHash)return this._destroy(new Error("Malformed torrent data: No info hash"));this._rechokeIntervalId=setInterval((()=>{this._rechoke()}),1e4),this._rechokeIntervalId.unref&&this._rechokeIntervalId.unref(),this.emit("_infoHash",this.infoHash),this.destroyed||(this.emit("infoHash",this.infoHash),this.destroyed||(this.client.listening?this._onListening():this.client.once("listening",(()=>{this._onListening()}))))}}_processParsedTorrent(t){this._debugId=t.infoHash.toString("hex").substring(0,7),void 0!==this.private&&(t.private=this.private),this.announce&&(t.announce=t.announce.concat(this.announce)),this.client.tracker&&i.g.WEBTORRENT_ANNOUNCE&&!t.private&&(t.announce=t.announce.concat(i.g.WEBTORRENT_ANNOUNCE)),this.urlList&&(t.urlList=t.urlList.concat(this.urlList)),t.announce=Array.from(new Set(t.announce)),t.urlList=Array.from(new Set(t.urlList)),Object.assign(this,t),this.magnetURI=x.toMagnetURI(t),this.torrentFile=x.toTorrentFile(t)}_onListening(){this.destroyed||(this.info?this._onMetadata(this):(this.xs&&this._getMetadataFromServer(),this._startDiscovery()))}_startDiscovery(){if(this.discovery||this.destroyed)return;let t=this.client.tracker;t&&(t=Object.assign({},this.client.tracker,{getAnnounceOpts:()=>{if(this.destroyed)return;const t={uploaded:this.uploaded,downloaded:this.downloaded,left:Math.max(this.length-this.downloaded,0)};return this.client.tracker.getAnnounceOpts&&Object.assign(t,this.client.tracker.getAnnounceOpts()),this._getAnnounceOpts&&Object.assign(t,this._getAnnounceOpts()),t}})),this.peerAddresses&&this.peerAddresses.forEach((t=>this.addPeer(t))),this.discovery=new m({infoHash:this.infoHash,announce:this.announce,peerId:this.client.peerId,dht:!this.private&&this.client.dht,tracker:t,port:this.client.torrentPort,userAgent:W,lsd:this.client.lsd}),this.discovery.on("error",(t=>{this._destroy(t)})),this.discovery.on("peer",((t,e)=>{this._debug("peer %s discovered via %s",t,e),"string"==typeof t&&this.done||this.addPeer(t)})),this.discovery.on("trackerAnnounce",(()=>{this.emit("trackerAnnounce"),0===this.numPeers&&this.emit("noPeers","tracker")})),this.discovery.on("dhtAnnounce",(()=>{this.emit("dhtAnnounce"),0===this.numPeers&&this.emit("noPeers","dht")})),this.discovery.on("warning",(t=>{this.emit("warning",t)}))}_getMetadataFromServer(){const t=this,e=(Array.isArray(this.xs)?this.xs:[this.xs]).map((e=>i=>{!function(e,i){if(0!==e.indexOf("http://")&&0!==e.indexOf("https://"))return t.emit("warning",new Error(`skipping non-http xs param: ${e}`)),i(null);const r={url:e,method:"GET",headers:{"user-agent":W}};let n;try{n=b.concat(r,(function(r,n,s){if(t.destroyed)return i(null);if(t.metadata)return i(null);if(r)return t.emit("warning",new Error(`http error from xs param: ${e}`)),i(null);if(200!==n.statusCode)return t.emit("warning",new Error(`non-200 status code ${n.statusCode} from xs param: ${e}`)),i(null);let o;try{o=x(s)}catch(r){}return o?o.infoHash!==t.infoHash?(t.emit("warning",new Error(`got torrent file with incorrect info hash from xs param: ${e}`)),i(null)):(t._onMetadata(o),void i(null)):(t.emit("warning",new Error(`got invalid torrent file from xs param: ${e}`)),i(null))}))}catch(r){return t.emit("warning",new Error(`skipping invalid url xs param: ${e}`)),i(null)}t._xsRequests.push(n)}(e,i)}));M(e)}_onMetadata(t){if(this.metadata||this.destroyed)return;let e;if(this._debug("got metadata"),this._xsRequests.forEach((t=>{t.abort()})),this._xsRequests=[],t&&t.infoHash)e=t;else try{e=x(t)}catch(t){return this._destroy(t)}this._processParsedTorrent(e),this.metadata=this.torrentFile,this.client.enableWebSeeds&&this.urlList.forEach((t=>{this.addWebSeed(t)})),this._rarityMap=new O(this),this.files=this.files.map((t=>new P(this,t)));let i=this._preloadedStore;if(i||(i=new this._store(this.pieceLength,{...this.storeOpts,torrent:this,path:this.path,files:this.files,length:this.length,name:this.name+" - "+this.infoHash.slice(0,8),addUID:this.addUID})),this._storeCacheSlots>0&&!(i instanceof w)&&(i=new c(i,{max:this._storeCacheSlots})),this.store=new v(i),this.so?this.files.forEach(((t,e)=>{this.so.includes(e)?this.files[e].select():this.files[e].deselect()})):0!==this.pieces.length&&this.select(0,this.pieces.length-1,!1),this._hashes=this.pieces,this.pieces=this.pieces.map(((t,e)=>{const i=e===this.pieces.length-1?this.lastPieceLength:this.pieceLength;return new E(i)})),this._reservations=this.pieces.map((()=>[])),this.bitfield=new l(this.pieces.length),this.wires.forEach((t=>{t.ut_metadata&&t.ut_metadata.setMetadata(this.metadata),this._onWireWithMetadata(t)})),this.emit("metadata"),!this.destroyed)if(this.skipVerify)this._markAllVerified(),this._onStore();else{const t=t=>{if(t)return this._destroy(t);this._debug("done verifying"),this._onStore()};this._debug("verifying existing torrent data"),this._fileModtimes&&this._store===g?this.getFileModtimes(((e,i)=>{if(e)return this._destroy(e);this.files.map(((t,e)=>i[e]===this._fileModtimes[e])).every((t=>t))?(this._markAllVerified(),this._onStore()):this._verifyPieces(t)})):this._verifyPieces(t)}}getFileModtimes(t){const e=[];k(this.files.map(((t,i)=>r=>{const n=this.addUID?h.join(this.name+" - "+this.infoHash.slice(0,8)):h.join(this.path,t.path);s.stat(n,((t,n)=>{if(t&&"ENOENT"!==t.code)return r(t);e[i]=n&&n.mtime.getTime(),r(null)}))})),z,(i=>{this._debug("done getting file modtimes"),t(i,e)}))}_verifyPieces(t){k(this.pieces.map(((t,e)=>t=>{if(this.destroyed)return t(new Error("torrent is destroyed"));const i={};e===this.pieces.length-1&&(i.length=this.lastPieceLength),this.store.get(e,i,((i,r)=>this.destroyed?t(new Error("torrent is destroyed")):i?T((()=>t(null))):void I(r,(i=>{if(this.destroyed)return t(new Error("torrent is destroyed"));i===this._hashes[e]?(this._debug("piece verified %s",e),this._markVerified(e)):this._debug("piece invalid %s",e),t(null)}))))})),z,t)}rescanFiles(t){if(this.destroyed)throw new Error("torrent is destroyed");t||(t=V),this._verifyPieces((e=>{if(e)return this._destroy(e),t(e);this._checkDone(),t(null)}))}_markAllVerified(){for(let t=0;tt))return!0;return!1}_onStore(){this.destroyed||(this._debug("on store"),this._startDiscovery(),this.ready=!0,this.emit("ready"),this._checkDone(),this._updateSelections())}destroy(t,e){if("function"==typeof t)return this.destroy(null,t);this._destroy(null,t,e)}_destroy(t,e,i){if("function"==typeof e)return this._destroy(t,null,e);if(this.destroyed)return;this.destroyed=!0,this._debug("destroy"),this.client._remove(this),clearInterval(this._rechokeIntervalId),this._xsRequests.forEach((t=>{t.abort()})),this._rarityMap&&this._rarityMap.destroy();for(const t in this._peers)this.removePeer(t);this.files.forEach((t=>{t instanceof P&&t._destroy()}));const r=this._servers.map((t=>e=>{t.destroy(e)}));if(this.discovery&&r.push((t=>{this.discovery.destroy(t)})),this.store){let t=this._destroyStoreOnDestroy;e&&void 0!==e.destroyStore&&(t=e.destroyStore),r.push((e=>{t?this.store.destroy(e):this.store.close(e)}))}M(r,i),t&&(0===this.listenerCount("error")?this.client.emit("error",t):this.emit("error",t)),this.emit("close"),this.client=null,this.files=[],this.discovery=null,this.store=null,this._rarityMap=null,this._peers=null,this._servers=null,this._xsRequests=null}addPeer(t){if(this.destroyed)throw new Error("torrent is destroyed");if(!this.infoHash)throw new Error("addPeer() must not be called before the `infoHash` event");let e;if(this.client.blocked){if("string"==typeof t){let i;try{i=u(t)}catch(e){return this._debug("ignoring peer: invalid %s",t),this.emit("invalidPeer",t),!1}e=i[0]}else"string"==typeof t.remoteAddress&&(e=t.remoteAddress);if(e&&this.client.blocked.contains(e))return this._debug("ignoring peer: blocked %s",t),"string"!=typeof t&&t.destroy(),this.emit("blockedPeer",t),!1}const i=this.client.utp&&this._isIPv4(e)?"utp":"tcp",r=!!this._addPeer(t,i);return r?this.emit("peer",t):this.emit("invalidPeer",t),r}_addPeer(t,e){if(this.destroyed)return"string"!=typeof t&&t.destroy(),null;if("string"==typeof t&&!this._validAddr(t))return this._debug("ignoring peer: invalid %s",t),null;const i=t&&t.id||t;if(this._peers[i])return this._debug("ignoring peer: duplicate (%s)",i),"string"!=typeof t&&t.destroy(),null;if(this.paused)return this._debug("ignoring peer: torrent is paused"),"string"!=typeof t&&t.destroy(),null;let r;return this._debug("add peer %s",i),r="string"==typeof t?"utp"===e?L.createUTPOutgoingPeer(t,this,this.client.throttleGroups):L.createTCPOutgoingPeer(t,this,this.client.throttleGroups):L.createWebRTCPeer(t,this,this.client.throttleGroups),this._registerPeer(r),"string"==typeof t&&(this._queue.push(r),this._drain()),r}addWebSeed(t){if(this.destroyed)throw new Error("torrent is destroyed");let e,i;if("string"==typeof t){if(e=t,!/^https?:\/\/.+/.test(e))return this.emit("warning",new Error(`ignoring invalid web seed: ${e}`)),void this.emit("invalidPeer",e);if(this._peers[e])return this.emit("warning",new Error(`ignoring duplicate web seed: ${e}`)),void this.emit("invalidPeer",e);i=new j(e,this)}else{if(!t||"string"!=typeof t.connId)return void this.emit("warning",new Error("addWebSeed must be passed a string or connection object with id property"));if(i=t,e=i.connId,this._peers[e])return this.emit("warning",new Error(`ignoring duplicate web seed: ${e}`)),void this.emit("invalidPeer",e)}this._debug("add web seed %s",e);const r=L.createWebSeedPeer(i,e,this,this.client.throttleGroups);this._registerPeer(r),this.emit("peer",e)}_addIncomingPeer(t){return this.destroyed?t.destroy(new Error("torrent is destroyed")):this.paused?t.destroy(new Error("torrent is paused")):(this._debug("add incoming peer %s",t.id),void this._registerPeer(t))}_registerPeer(t){t.on("download",(t=>{this.destroyed||(this.received+=t,this._downloadSpeed(t),this.client._downloadSpeed(t),this.emit("download",t),this.destroyed||this.client.emit("download",t))})),t.on("upload",(t=>{this.destroyed||(this.uploaded+=t,this._uploadSpeed(t),this.client._uploadSpeed(t),this.emit("upload",t),this.destroyed||this.client.emit("upload",t))})),this._peers[t.id]=t,this._peersLength+=1}removePeer(t){const e=t&&t.id||t;(t=this._peers[e])&&(this._debug("removePeer %s",e),delete this._peers[e],this._peersLength-=1,t.destroy(),this._drain())}select(t,e,i,r){if(this.destroyed)throw new Error("torrent is destroyed");if(t<0||ee.priority-t.priority)),this._updateSelections()}deselect(t,e,i){if(this.destroyed)throw new Error("torrent is destroyed");i=Number(i)||0,this._debug("deselect %s-%s (priority %s)",t,e,i);for(let r=0;r{if(!this.destroyed&&!this.client.dht.destroyed){if(!t.remoteAddress)return this._debug("ignoring PORT from peer with no address");if(0===i||i>65536)return this._debug("ignoring invalid PORT from peer");this._debug("port: %s (from %s)",i,e),this.client.dht.addNode({host:t.remoteAddress,port:i})}})),t.on("timeout",(()=>{this._debug("wire timeout (%s)",e),t.destroy()})),"webSeed"!==t.type&&t.setTimeout(3e4,!0),t.setKeepAlive(!0),t.use(B(this.metadata)),t.ut_metadata.on("warning",(t=>{this._debug("ut_metadata warning: %s",t.message)})),this.metadata||(t.ut_metadata.on("metadata",(t=>{this._debug("got metadata via ut_metadata"),this._onMetadata(t)})),t.ut_metadata.fetch()),"function"!=typeof R||this.private||(t.use(R()),t.ut_pex.on("peer",(t=>{this.done||(this._debug("ut_pex: got peer: %s (from %s)",t,e),this.addPeer(t))})),t.ut_pex.on("dropped",(t=>{const i=this._peers[t];i&&!i.connected&&(this._debug("ut_pex: dropped peer: %s (from %s)",t,e),this.removePeer(t))})),t.once("close",(()=>{t.ut_pex.reset()}))),t.use(y()),this.emit("wire",t,e),this.metadata&&T((()=>{this._onWireWithMetadata(t)}))}_onWireWithMetadata(t){let e=null;const i=()=>{this.destroyed||t.destroyed||(this._numQueued>2*(this._numConns-this.numPeers)&&t.amInterested?t.destroy():(e=setTimeout(i,F),e.unref&&e.unref()))};let r;const n=()=>{if(t.peerPieces.buffer.length===this.bitfield.buffer.length){for(r=0;r{n(),this._update(),this._updateWireInterest(t)})),t.on("have",(()=>{n(),this._update(),this._updateWireInterest(t)})),t.lt_donthave.on("donthave",(()=>{n(),this._update(),this._updateWireInterest(t)})),t.on("have-all",(()=>{t.isSeeder=!0,t.choke(),this._update(),this._updateWireInterest(t)})),t.on("have-none",(()=>{t.isSeeder=!1,this._update(),this._updateWireInterest(t)})),t.on("allowed-fast",(t=>{this._update()})),t.once("interested",(()=>{t.unchoke()})),t.once("close",(()=>{clearTimeout(e)})),t.on("choke",(()=>{clearTimeout(e),e=setTimeout(i,F),e.unref&&e.unref()})),t.on("unchoke",(()=>{clearTimeout(e),this._update()})),t.on("request",((e,i,r,n)=>{if(r>131072)return t.destroy();this.pieces[e]||this.store.get(e,{offset:i,length:r},n)})),t.hasFast&&this._hasAllPieces()?t.haveAll():t.hasFast&&this._hasNoPieces()?t.haveNone():t.bitfield(this.bitfield),this._updateWireInterest(t),t.peerExtensions.dht&&this.client.dht&&this.client.dht.listening&&t.port(this.client.dht.address().port),"webSeed"!==t.type&&(e=setTimeout(i,F),e.unref&&e.unref()),t.isSeeder=!1,n()}_updateSelections(){this.ready&&!this.destroyed&&(T((()=>{this._gcSelections()})),this._updateInterest(),this._update())}_gcSelections(){for(let t=0;tthis._updateWireInterest(t))),t!==this._amInterested&&(this._amInterested?this.emit("interested"):this.emit("uninterested"))}_updateWireInterest(t){let e=!1;for(let i=0;i{e._updateWire(t)}),{timeout:250}):e._updateWire(t)}_updateWire(t){const e=this,i=Z(t,.5);if(t.requests.length>=i)return;const r=Z(t,1);if(t.peerChoking)t.hasFast&&t.peerAllowedFastSet.length>0&&!this._hasMorePieces(t.peerAllowedFastSet.length-1)&&function(){if(t.requests.length>=r)return!1;for(const i of t.peerAllowedFastSet){if(t.peerPieces.get(i)&&!e.bitfield.get(i))for(;e._request(t,i,!1)&&t.requests.length=r.from+r.offset;--s)if(t.peerPieces.get(s)&&e._request(t,s,!1))return}}();o(!1)||o(!0)}function n(e,i,r,n){return s=>s>=e&&s<=i&&!(s in r)&&t.peerPieces.get(s)&&(!n||n(s))}function s(t){let i=t;for(let r=t;r=r)return!0;const o=function(){const i=t.downloadSpeed()||1;if(i>q)return()=>!0;const r=Math.max(1,t.requests.length)*E.BLOCK_LENGTH/i;let n=10,s=0;return t=>{if(!n||e.bitfield.get(t))return!0;let o=e.pieces[t].missing;for(;s0))return n--,!1}return!0}}();for(let a=0;a({wire:t,random:Math.random()}))).sort(((t,e)=>{const i=t.wire,r=e.wire;return i.downloadSpeed()!==r.downloadSpeed()?i.downloadSpeed()-r.downloadSpeed():i.uploadSpeed()!==r.uploadSpeed()?i.uploadSpeed()-r.uploadSpeed():i.amChoking!==r.amChoking?i.amChoking?-1:1:t.random-e.random})).map((t=>t.wire));this._rechokeOptimisticTime<=0?this._rechokeOptimisticWire=null:this._rechokeOptimisticTime-=1;let e=0;for(;t.length>0&&e0){const e=t.filter((t=>t.peerInterested));if(e.length>0){const t=e[(i=e.length,Math.random()*i|0)];t.unchoke(),this._rechokeOptimisticWire=t,this._rechokeOptimisticTime=2}}var i;t.filter((t=>t!==this._rechokeOptimisticWire)).forEach((t=>t.choke()))}_hotswap(t,e){const i=t.downloadSpeed();if(i=q||2*a>i||a>o||(n=e,o=a)}if(!n)return!1;for(s=0;s=o)return!1;const a=r.pieces[e];let h=s?a.reserveRemaining():a.reserve();if(-1===h&&i&&r._hotswap(t,e)&&(h=s?a.reserveRemaining():a.reserve()),-1===h)return!1;let u=r._reservations[e];u||(u=r._reservations[e]=[]);let l=u.indexOf(null);-1===l&&(l=u.length),u[l]=t;const c=a.chunkOffset(h),d=s?a.chunkLengthRemaining(h):a.chunkLength(h);function f(){T((()=>{r._update()}))}return t.request(e,c,d,(function i(n,o){if(r.destroyed)return;if(!r.ready)return r.once("ready",(()=>{i(n,o)}));if(u[l]===t&&(u[l]=null),a!==r.pieces[e])return f();if(n)return r._debug("error getting piece %s (offset: %s length: %s) from %s: %s",e,c,d,`${t.remoteAddress}:${t.remotePort}`,n.message),s?a.cancelRemaining(h):a.cancel(h),void f();if(r._debug("got piece %s (offset: %s length: %s) from %s",e,c,d,`${t.remoteAddress}:${t.remotePort}`),!a.set(h,o,t))return f();const p=a.flush();I(p,(t=>{r.destroyed||(t===r._hashes[e]?(r._debug("piece verified %s",e),r.store.put(e,p,(t=>{t?r._destroy(t):(r.pieces[e]=null,r._markVerified(e),r.wires.forEach((t=>{t.have(e)})),r._checkDone()&&!r.destroyed&&r.discovery.complete(),f())}))):(r.pieces[e]=new E(a.length),r.emit("warning",new Error(`Piece ${e} failed verification`)),f()))}))})),!0}_checkDone(){if(this.destroyed)return;this.files.forEach((t=>{if(!t.done){for(let e=t._startPiece;e<=t._endPiece;++e)if(!this.bitfield.get(e))return;t.done=!0,t.emit("done"),this._debug(`file done: ${t.name}`)}}));let t=!0;for(const e of this._selections){for(let i=e.from;i<=e.to;i++)if(!this.bitfield.get(i)){t=!1;break}if(!t)break}return!this.done&&t?(this.done=!0,this._debug(`torrent done: ${this.infoHash}`),this.emit("done")):this.done=!1,this._gcSelections(),t}load(t,e){if(this.destroyed)throw new Error("torrent is destroyed");if(!this.ready)return this.once("ready",(()=>{this.load(t,e)}));Array.isArray(t)||(t=[t]),e||(e=V);const i=new _(t),r=new d(this.store,this.pieceLength);S(i,r,(t=>{if(t)return e(t);this._markAllVerified(),this._checkDone(),e(null)}))}createServer(t){if("function"!=typeof D)throw new Error("node.js-only method");if(this.destroyed)throw new Error("torrent is destroyed");const e=new D(this,t);return this._servers.push(e),e}pause(){this.destroyed||(this._debug("pause"),this.paused=!0)}resume(){this.destroyed||(this._debug("resume"),this.paused=!1,this._drain())}_debug(){const t=[].slice.call(arguments);t[0]=`[${this.client?this.client._debugId:"No Client"}] [${this._debugId}] ${t[0]}`,U(...t)}_drain(){if(this._debug("_drain numConns %s maxConns %s",this._numConns,this.client.maxConns),"function"!=typeof o.connect||this.destroyed||this.paused||this._numConns>=this.client.maxConns)return;this._debug("drain (%s queued, %s/%s peers)",this._numQueued,this.numPeers,this.client.maxConns);const t=this._queue.shift();if(!t)return;this._debug("%s connect attempt to %s",t.type,t.addr);const e=u(t.addr),i={host:e[0],port:e[1]};this.client.utp&&"utpOutgoing"===t.type?t.conn=N.connect(i.port,i.host):t.conn=o.connect(i);const r=t.conn;r.once("connect",(()=>{t.onConnect()})),r.once("error",(e=>{t.destroy(e)})),t.startConnectTimeout(),r.on("close",(()=>{if(this.destroyed)return;if(t.retries>=H.length){if(this.client.utp){const e=this._addPeer(t.addr,"tcp");e&&(e.retries=0)}else this._debug("conn %s closed: will not re-add (max %s attempts)",t.addr,H.length);return}const e=H[t.retries];this._debug("conn %s closed: will re-add to queue in %sms (attempt %s)",t.addr,e,t.retries+1);const i=setTimeout((()=>{if(this.destroyed)return;const e=u(t.addr)[0],i=this.client.utp&&this._isIPv4(e)?"utp":"tcp",r=this._addPeer(t.addr,i);r&&(r.retries=t.retries+1)}),e);i.unref&&i.unref()}))}_validAddr(t){let e;try{e=u(t)}catch(t){return!1}const i=e[0],r=e[1];return r>0&&r<65535&&!("127.0.0.1"===i&&r===this.client.torrentPort)}_isIPv4(t){return/^((?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])[.]){3}(?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])$/.test(t)}}},6695:(t,e,i)=>{var r=i(8764).Buffer;const{default:n}=i(8833),s=i(1227),o=i(6993),a=i(9417),h=i(4159),u=i(5228),l=s("webtorrent:webconn"),c=i(1907).version;t.exports=class extends u{constructor(t,e){super(),this.url=t,this.connId=t,this.webPeerId=h.sync(t),this._torrent=e,this._init()}_init(){this.setKeepAlive(!0),this.use(a()),this.once("handshake",((t,e)=>{if(this.destroyed)return;this.handshake(t,this.webPeerId);const i=this._torrent.pieces.length,r=new n(i);for(let t=0;t<=i;t++)r.set(t,!0);this.bitfield(r)})),this.once("interested",(()=>{l("interested"),this.unchoke()})),this.on("uninterested",(()=>{l("uninterested")})),this.on("choke",(()=>{l("choke")})),this.on("unchoke",(()=>{l("unchoke")})),this.on("bitfield",(()=>{l("bitfield")})),this.lt_donthave.on("donthave",(()=>{l("donthave")})),this.on("request",((t,e,i,r)=>{l("request pieceIndex=%d offset=%d length=%d",t,e,i),this.httpRequest(t,e,i,((e,i)=>{if(e){this.lt_donthave.donthave(t);const e=setTimeout((()=>{this.destroyed||this.have(t)}),1e4);e.unref&&e.unref()}r(e,i)}))}))}httpRequest(t,e,i,n){const s=t*this._torrent.pieceLength+e,a=s+i-1,h=this._torrent.files;let u;if(h.length<=1)u=[{url:this.url,start:s,end:a}];else{const t=h.filter((t=>t.offset<=a&&t.offset+t.length>s));if(t.length<1)return n(new Error("Could not find file corresponding to web seed range request"));u=t.map((t=>{const e=t.offset+t.length-1;return{url:this.url+("/"===this.url[this.url.length-1]?"":"/")+t.path,fileOffsetInRange:Math.max(t.offset-s,0),start:Math.max(s-t.offset,0),end:Math.min(e,a-t.offset)}}))}let d,f=0,p=!1;u.length>1&&(d=r.alloc(i)),u.forEach((r=>{const s=r.url,a=r.start,h=r.end;l("Requesting url=%s pieceIndex=%d offset=%d length=%d start=%d end=%d",s,t,e,i,a,h);const m={url:s,method:"GET",headers:{"user-agent":`WebTorrent/${c} (https://webtorrent.io)`,range:`bytes=${a}-${h}`},timeout:6e4};function g(t,e){if(t.statusCode<200||t.statusCode>=300){if(p)return;return p=!0,n(new Error(`Unexpected HTTP status code ${t.statusCode}`))}l("Got data of length %d",e.length),1===u.length?n(null,e):(e.copy(d,r.fileOffsetInRange),++f===u.length&&n(null,d))}o.concat(m,((t,e,i)=>{if(!p)return t?"undefined"==typeof window||s.startsWith(`${window.location.origin}/`)?(p=!0,n(t)):o.head(s,((e,i)=>{if(!p){if(e)return p=!0,n(e);if(i.statusCode<200||i.statusCode>=300)return p=!0,n(new Error(`Unexpected HTTP status code ${i.statusCode}`));if(i.url===s)return p=!0,n(t);m.url=i.url,o.concat(m,((t,e,i)=>{if(!p)return t?(p=!0,n(t)):void g(e,i)}))}})):void g(e,i)}))}))}destroy(){super.destroy(),this._torrent=null}}},6430:(t,e,i)=>{"use strict";var r=i(9804),n=i(3083),s=i(1924),o=s("Object.prototype.toString"),a=i(6410)(),h="undefined"==typeof globalThis?i.g:globalThis,u=n(),l=s("String.prototype.slice"),c={},d=i(882),f=Object.getPrototypeOf;a&&d&&f&&r(u,(function(t){if("function"==typeof h[t]){var e=new h[t];if(Symbol.toStringTag in e){var i=f(e),r=d(i,Symbol.toStringTag);if(!r){var n=f(i);r=d(n,Symbol.toStringTag)}c[t]=r.get}}}));var p=i(5692);t.exports=function(t){return!!p(t)&&(a&&Symbol.toStringTag in t?function(t){var e=!1;return r(c,(function(i,r){if(!e)try{var n=i.call(t);n===r&&(e=n)}catch(t){}})),e}(t):l(o(t),8,-1))}},2479:t=>{t.exports=function t(e,i){if(e&&i)return t(e)(i);if("function"!=typeof e)throw new TypeError("need wrapper function");return Object.keys(e).forEach((function(t){r[t]=e[t]})),r;function r(){for(var t=new Array(arguments.length),i=0;i{t.exports=function(){for(var t={},i=0;i{},9354:()=>{},3762:()=>{},8333:()=>{},59:()=>{},6601:()=>{},9214:()=>{},8623:()=>{},2528:()=>{},970:()=>{},7748:()=>{},5568:()=>{},6619:()=>{},1982:()=>{},7108:()=>{},1156:()=>{},2361:()=>{},4616:()=>{},1356:()=>{},3719:()=>{},2378:()=>{},2067:()=>{},6322:()=>{},4854:()=>{},9608:()=>{},8856:()=>{},5688:()=>{},7525:()=>{},7523:()=>{},146:()=>{},2050:()=>{},3083:(t,e,i)=>{"use strict";var r=["BigInt64Array","BigUint64Array","Float32Array","Float64Array","Int16Array","Int32Array","Int8Array","Uint16Array","Uint32Array","Uint8Array","Uint8ClampedArray"],n="undefined"==typeof globalThis?i.g:globalThis;t.exports=function(){for(var t=[],e=0;e{"use strict";var r=i(210)("%Object.getOwnPropertyDescriptor%",!0);if(r)try{r([],"length")}catch(t){r=null}t.exports=r},4946:t=>{"use strict";t.exports=JSON.parse('{"aes-128-ecb":{"cipher":"AES","key":128,"iv":0,"mode":"ECB","type":"block"},"aes-192-ecb":{"cipher":"AES","key":192,"iv":0,"mode":"ECB","type":"block"},"aes-256-ecb":{"cipher":"AES","key":256,"iv":0,"mode":"ECB","type":"block"},"aes-128-cbc":{"cipher":"AES","key":128,"iv":16,"mode":"CBC","type":"block"},"aes-192-cbc":{"cipher":"AES","key":192,"iv":16,"mode":"CBC","type":"block"},"aes-256-cbc":{"cipher":"AES","key":256,"iv":16,"mode":"CBC","type":"block"},"aes128":{"cipher":"AES","key":128,"iv":16,"mode":"CBC","type":"block"},"aes192":{"cipher":"AES","key":192,"iv":16,"mode":"CBC","type":"block"},"aes256":{"cipher":"AES","key":256,"iv":16,"mode":"CBC","type":"block"},"aes-128-cfb":{"cipher":"AES","key":128,"iv":16,"mode":"CFB","type":"stream"},"aes-192-cfb":{"cipher":"AES","key":192,"iv":16,"mode":"CFB","type":"stream"},"aes-256-cfb":{"cipher":"AES","key":256,"iv":16,"mode":"CFB","type":"stream"},"aes-128-cfb8":{"cipher":"AES","key":128,"iv":16,"mode":"CFB8","type":"stream"},"aes-192-cfb8":{"cipher":"AES","key":192,"iv":16,"mode":"CFB8","type":"stream"},"aes-256-cfb8":{"cipher":"AES","key":256,"iv":16,"mode":"CFB8","type":"stream"},"aes-128-cfb1":{"cipher":"AES","key":128,"iv":16,"mode":"CFB1","type":"stream"},"aes-192-cfb1":{"cipher":"AES","key":192,"iv":16,"mode":"CFB1","type":"stream"},"aes-256-cfb1":{"cipher":"AES","key":256,"iv":16,"mode":"CFB1","type":"stream"},"aes-128-ofb":{"cipher":"AES","key":128,"iv":16,"mode":"OFB","type":"stream"},"aes-192-ofb":{"cipher":"AES","key":192,"iv":16,"mode":"OFB","type":"stream"},"aes-256-ofb":{"cipher":"AES","key":256,"iv":16,"mode":"OFB","type":"stream"},"aes-128-ctr":{"cipher":"AES","key":128,"iv":16,"mode":"CTR","type":"stream"},"aes-192-ctr":{"cipher":"AES","key":192,"iv":16,"mode":"CTR","type":"stream"},"aes-256-ctr":{"cipher":"AES","key":256,"iv":16,"mode":"CTR","type":"stream"},"aes-128-gcm":{"cipher":"AES","key":128,"iv":12,"mode":"GCM","type":"auth"},"aes-192-gcm":{"cipher":"AES","key":192,"iv":12,"mode":"GCM","type":"auth"},"aes-256-gcm":{"cipher":"AES","key":256,"iv":12,"mode":"GCM","type":"auth"}}')},5207:t=>{"use strict";t.exports=JSON.parse('{"sha224WithRSAEncryption":{"sign":"rsa","hash":"sha224","id":"302d300d06096086480165030402040500041c"},"RSA-SHA224":{"sign":"ecdsa/rsa","hash":"sha224","id":"302d300d06096086480165030402040500041c"},"sha256WithRSAEncryption":{"sign":"rsa","hash":"sha256","id":"3031300d060960864801650304020105000420"},"RSA-SHA256":{"sign":"ecdsa/rsa","hash":"sha256","id":"3031300d060960864801650304020105000420"},"sha384WithRSAEncryption":{"sign":"rsa","hash":"sha384","id":"3041300d060960864801650304020205000430"},"RSA-SHA384":{"sign":"ecdsa/rsa","hash":"sha384","id":"3041300d060960864801650304020205000430"},"sha512WithRSAEncryption":{"sign":"rsa","hash":"sha512","id":"3051300d060960864801650304020305000440"},"RSA-SHA512":{"sign":"ecdsa/rsa","hash":"sha512","id":"3051300d060960864801650304020305000440"},"RSA-SHA1":{"sign":"rsa","hash":"sha1","id":"3021300906052b0e03021a05000414"},"ecdsa-with-SHA1":{"sign":"ecdsa","hash":"sha1","id":""},"sha256":{"sign":"ecdsa","hash":"sha256","id":""},"sha224":{"sign":"ecdsa","hash":"sha224","id":""},"sha384":{"sign":"ecdsa","hash":"sha384","id":""},"sha512":{"sign":"ecdsa","hash":"sha512","id":""},"DSA-SHA":{"sign":"dsa","hash":"sha1","id":""},"DSA-SHA1":{"sign":"dsa","hash":"sha1","id":""},"DSA":{"sign":"dsa","hash":"sha1","id":""},"DSA-WITH-SHA224":{"sign":"dsa","hash":"sha224","id":""},"DSA-SHA224":{"sign":"dsa","hash":"sha224","id":""},"DSA-WITH-SHA256":{"sign":"dsa","hash":"sha256","id":""},"DSA-SHA256":{"sign":"dsa","hash":"sha256","id":""},"DSA-WITH-SHA384":{"sign":"dsa","hash":"sha384","id":""},"DSA-SHA384":{"sign":"dsa","hash":"sha384","id":""},"DSA-WITH-SHA512":{"sign":"dsa","hash":"sha512","id":""},"DSA-SHA512":{"sign":"dsa","hash":"sha512","id":""},"DSA-RIPEMD160":{"sign":"dsa","hash":"rmd160","id":""},"ripemd160WithRSA":{"sign":"rsa","hash":"rmd160","id":"3021300906052b2403020105000414"},"RSA-RIPEMD160":{"sign":"rsa","hash":"rmd160","id":"3021300906052b2403020105000414"},"md5WithRSAEncryption":{"sign":"rsa","hash":"md5","id":"3020300c06082a864886f70d020505000410"},"RSA-MD5":{"sign":"rsa","hash":"md5","id":"3020300c06082a864886f70d020505000410"}}')},1308:t=>{"use strict";t.exports=JSON.parse('{"1.3.132.0.10":"secp256k1","1.3.132.0.33":"p224","1.2.840.10045.3.1.1":"p192","1.2.840.10045.3.1.7":"p256","1.3.132.0.34":"p384","1.3.132.0.35":"p521"}')},9799:t=>{"use strict";t.exports=JSON.parse('{"modp1":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a3620ffffffffffffffff"},"modp2":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece65381ffffffffffffffff"},"modp5":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca237327ffffffffffffffff"},"modp14":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aacaa68ffffffffffffffff"},"modp15":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a93ad2caffffffffffffffff"},"modp16":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c934063199ffffffffffffffff"},"modp17":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dcc4024ffffffffffffffff"},"modp18":{"gen":"02","prime":"ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a637ed6b0bff5cb6f406b7edee386bfb5a899fa5ae9f24117c4b1fe649286651ece45b3dc2007cb8a163bf0598da48361c55d39a69163fa8fd24cf5f83655d23dca3ad961c62f356208552bb9ed529077096966d670c354e4abc9804f1746c08ca18217c32905e462e36ce3be39e772c180e86039b2783a2ec07a28fb5c55df06f4c52c9de2bcbf6955817183995497cea956ae515d2261898fa051015728e5a8aaac42dad33170d04507a33a85521abdf1cba64ecfb850458dbef0a8aea71575d060c7db3970f85a6e1e4c7abf5ae8cdb0933d71e8c94e04a25619dcee3d2261ad2ee6bf12ffa06d98a0864d87602733ec86a64521f2b18177b200cbbe117577a615d6c770988c0bad946e208e24fa074e5ab3143db5bfce0fd108e4b82d120a92108011a723c12a787e6d788719a10bdba5b2699c327186af4e23c1a946834b6150bda2583e9ca2ad44ce8dbbbc2db04de8ef92e8efc141fbecaa6287c59474e6bc05d99b2964fa090c3a2233ba186515be7ed1f612970cee2d7afb81bdd762170481cd0069127d5b05aa993b4ea988d8fddc186ffb7dc90a6c08f4df435c93402849236c3fab4d27c7026c1d4dcb2602646dec9751e763dba37bdf8ff9406ad9e530ee5db382f413001aeb06a53ed9027d831179727b0865a8918da3edbebcf9b14ed44ce6cbaced4bb1bdb7f1447e6cc254b332051512bd7af426fb8f401378cd2bf5983ca01c64b92ecf032ea15d1721d03f482d7ce6e74fef6d55e702f46980c82b5a84031900b1c9e59e7c97fbec7e8f323a97a7e36cc88be0f1d45b7ff585ac54bd407b22b4154aacc8f6d7ebf48e1d814cc5ed20f8037e0a79715eef29be32806a1d58bb7c5da76f550aa3d8a1fbff0eb19ccb1a313d55cda56c9ec2ef29632387fe8d76e3c0468043e8f663f4860ee12bf2d5b0b7474d6e694f91e6dbe115974a3926f12fee5e438777cb6a932df8cd8bec4d073b931ba3bc832b68d9dd300741fa7bf8afc47ed2576f6936ba424663aab639c5ae4f5683423b4742bf1c978238f16cbe39d652de3fdb8befc848ad922222e04a4037c0713eb57a81a23f0c73473fc646cea306b4bcbc8862f8385ddfa9d4b7fa2c087e879683303ed5bdd3a062b3cf5b3a278a66d2a13f83f44f82ddf310ee074ab6a364597e899a0255dc164f31cc50846851df9ab48195ded7ea1b1d510bd7ee74d73faf36bc31ecfa268359046f4eb879f924009438b481c6cd7889a002ed5ee382bc9190da6fc026e479558e4475677e9aa9e3050e2765694dfc81f56e880b96e7160c980dd98edd3dfffffffffffffffff"}}')},8597:t=>{"use strict";t.exports={i8:"6.5.4"}},2562:t=>{"use strict";t.exports=JSON.parse('{"2.16.840.1.101.3.4.1.1":"aes-128-ecb","2.16.840.1.101.3.4.1.2":"aes-128-cbc","2.16.840.1.101.3.4.1.3":"aes-128-ofb","2.16.840.1.101.3.4.1.4":"aes-128-cfb","2.16.840.1.101.3.4.1.21":"aes-192-ecb","2.16.840.1.101.3.4.1.22":"aes-192-cbc","2.16.840.1.101.3.4.1.23":"aes-192-ofb","2.16.840.1.101.3.4.1.24":"aes-192-cfb","2.16.840.1.101.3.4.1.41":"aes-256-ecb","2.16.840.1.101.3.4.1.42":"aes-256-cbc","2.16.840.1.101.3.4.1.43":"aes-256-ofb","2.16.840.1.101.3.4.1.44":"aes-256-cfb"}')},876:t=>{"use strict";t.exports=JSON.parse('{".3gp":"video/3gpp",".aac":"audio/aac",".aif":"audio/x-aiff",".aiff":"audio/x-aiff",".atom":"application/atom+xml",".avi":"video/x-msvideo",".bmp":"image/bmp",".bz2":"application/x-bzip2",".conf":"text/plain",".css":"text/css",".csv":"text/plain",".diff":"text/x-diff",".doc":"application/msword",".flv":"video/x-flv",".gif":"image/gif",".gz":"application/x-gzip",".htm":"text/html",".html":"text/html",".ico":"image/vnd.microsoft.icon",".ics":"text/calendar",".iso":"application/octet-stream",".jar":"application/java-archive",".jpeg":"image/jpeg",".jpg":"image/jpeg",".js":"application/javascript",".json":"application/json",".less":"text/css",".log":"text/plain",".m3u":"audio/x-mpegurl",".m4a":"audio/x-m4a",".m4b":"audio/mp4",".m4p":"audio/mp4",".m4v":"video/x-m4v",".manifest":"text/cache-manifest",".markdown":"text/x-markdown",".mathml":"application/mathml+xml",".md":"text/x-markdown",".mid":"audio/midi",".midi":"audio/midi",".mov":"video/quicktime",".mp3":"audio/mpeg",".mp4":"video/mp4",".mp4v":"video/mp4",".mpeg":"video/mpeg",".mpg":"video/mpeg",".odp":"application/vnd.oasis.opendocument.presentation",".ods":"application/vnd.oasis.opendocument.spreadsheet",".odt":"application/vnd.oasis.opendocument.text",".oga":"audio/ogg",".ogg":"application/ogg",".pdf":"application/pdf",".png":"image/png",".pps":"application/vnd.ms-powerpoint",".ppt":"application/vnd.ms-powerpoint",".ps":"application/postscript",".psd":"image/vnd.adobe.photoshop",".qt":"video/quicktime",".rar":"application/x-rar-compressed",".rdf":"application/rdf+xml",".rss":"application/rss+xml",".rtf":"application/rtf",".svg":"image/svg+xml",".svgz":"image/svg+xml",".swf":"application/x-shockwave-flash",".tar":"application/x-tar",".tbz":"application/x-bzip-compressed-tar",".text":"text/plain",".tif":"image/tiff",".tiff":"image/tiff",".torrent":"application/x-bittorrent",".ttf":"application/x-font-ttf",".txt":"text/plain",".wav":"audio/wav",".webm":"video/webm",".wma":"audio/x-ms-wma",".wmv":"video/x-ms-wmv",".xls":"application/vnd.ms-excel",".xml":"application/xml",".yaml":"text/yaml",".yml":"text/yaml",".zip":"application/zip"}')},1907:t=>{"use strict";t.exports=JSON.parse('{"name":"webtorrent","description":"Streaming torrent client","version":"1.8.5","author":{"name":"WebTorrent LLC","email":"feross@webtorrent.io","url":"https://webtorrent.io"},"browser":{"./lib/server.js":false,"./lib/conn-pool.js":false,"./lib/utp.js":false,"bittorrent-dht/client":false,"fs":false,"fs-chunk-store":"memory-chunk-store","load-ip-set":false,"net":false,"os":false,"ut_pex":false},"browserify":{"transform":["package-json-versionify"]},"bugs":{"url":"https://github.com/webtorrent/webtorrent/issues"},"chromeapp":{"./lib/utp.js":false,"fs-chunk-store":"memory-chunk-store","http":"@webtorrent/http-node","load-ip-set":false,"net":"chrome-net","os":false},"dependencies":{"@webtorrent/http-node":"^1.3.0","addr-to-ip-port":"^1.5.4","bitfield":"^4.0.0","bittorrent-dht":"^10.0.2","bittorrent-protocol":"^3.5.1","cache-chunk-store":"^3.2.2","chrome-net":"^3.3.4","chunk-store-stream":"^4.3.0","cpus":"^1.0.3","create-torrent":"^5.0.1","debug":"^4.3.3","end-of-stream":"^1.4.4","escape-html":"^1.0.3","fs-chunk-store":"^2.0.4","immediate-chunk-store":"^2.2.0","load-ip-set":"^2.2.1","lt_donthave":"^1.0.1","memory-chunk-store":"^1.3.5","mime":"^3.0.0","multistream":"^4.1.0","package-json-versionify":"^1.0.4","parse-torrent":"^9.1.4","pump":"^3.0.0","queue-microtask":"^1.2.3","random-iterate":"^1.0.1","randombytes":"^2.1.0","range-parser":"^1.2.1","render-media":"^4.1.0","run-parallel":"^1.2.0","run-parallel-limit":"^1.1.0","simple-concat":"^1.0.1","simple-get":"^4.0.1","simple-peer":"^9.11.1","simple-sha1":"^3.1.0","speed-limiter":"^1.0.2","speedometer":"^1.1.0","stream-to-blob":"^2.0.1","stream-to-blob-url":"^3.0.2","stream-with-known-length-to-buffer":"^1.0.4","torrent-discovery":"^9.4.9","torrent-piece":"^2.0.1","unordered-array-remove":"^1.0.2","ut_metadata":"^3.5.2","ut_pex":"^3.0.2"},"devDependencies":{"@webtorrent/semantic-release-config":"1.0.7","airtap":"4.0.4","airtap-manual":"1.0.0","airtap-sauce":"1.1.2","babel-minify":"0.5.1","bittorrent-tracker":"9.18.4","browserify":"17.0.0","disc":"1.3.3","finalhandler":"1.1.2","network-address":"1.1.2","run-series":"1.1.9","semantic-release":"19.0.2","serve-static":"1.14.2","standard":"*","tape":"5.5.2","webtorrent-fixtures":"1.7.5"},"optionalDependencies":{"utp-native":"^2.5.3"},"engines":{"node":">=12"},"funding":[{"type":"github","url":"https://github.com/sponsors/feross"},{"type":"patreon","url":"https://www.patreon.com/feross"},{"type":"consulting","url":"https://feross.org/support"}],"homepage":"https://webtorrent.io","keywords":["bittorrent","bittorrent client","download","mad science","p2p","peer-to-peer","peers","streaming","swarm","torrent","web torrent","webrtc","webrtc data","webtorrent"],"license":"MIT","main":"index.js","repository":{"type":"git","url":"git://github.com/webtorrent/webtorrent.git"},"scripts":{"build":"npm run build-js && npm run build-js-worker && npm run build-chromeapp","build-chromeapp":"browserify --browser-field=chromeapp --standalone WebTorrent . | minify --mangle=false > webtorrent.chromeapp.js","build-chromeapp-debug":"browserify --browser-field=chromeapp --standalone WebTorrent . > webtorrent.chromeapp.js","build-js":"browserify --standalone WebTorrent . | minify --mangle=false > webtorrent.min.js","build-js-worker":"browserify ./lib/worker.js | minify --mangle=false > sw.min.js","build-js-debug":"browserify --standalone WebTorrent . > webtorrent.debug.js","build-js-worker-debug":"browserify ./lib/worker.js > sw.debug.js","prepublishOnly":"npm run build && npm run update-authors","preversion":"npm run build && npm run update-authors","size":"npm run size-js && npm run size-disc","size-disc":"browserify --full-paths . | discify --open","size-js":"npm run build && cat webtorrent.min.js | gzip | wc -c","test":"standard && npm run test-node && npm run test-browser","test-browser":"airtap --concurrency 1 -- test/*.js test/browser/*.js","test-browser-local":"airtap --preset local -- test/*.js test/browser/*.js","test-node":"tape test/*.js test/node/*.js","update-authors":"./scripts/update-authors.sh"},"standard":{"ignore":["webtorrent.min.js","sw.min.js","webtorrent.chromeapp.js"]},"renovate":{"extends":["github>webtorrent/renovate-config"],"rangeStrategy":"bump"},"release":{"extends":"@webtorrent/semantic-release-config"}}')}},e={};function i(r){var n=e[r];if(void 0!==n)return n.exports;var s=e[r]={id:r,loaded:!1,exports:{}};return t[r].call(s.exports,s,s.exports,i),s.loaded=!0,s.exports}i.n=t=>{var e=t&&t.__esModule?()=>t.default:()=>t;return i.d(e,{a:e}),e},i.d=(t,e)=>{for(var r in e)i.o(e,r)&&!i.o(t,r)&&Object.defineProperty(t,r,{enumerable:!0,get:e[r]})},i.g=function(){if("object"==typeof globalThis)return globalThis;try{return this||new Function("return this")()}catch(t){if("object"==typeof window)return window}}(),i.o=(t,e)=>Object.prototype.hasOwnProperty.call(t,e),i.r=t=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(t,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(t,"__esModule",{value:!0})},i.nmd=t=>(t.paths=[],t.children||(t.children=[]),t);var r={};(()=>{"use strict";i.d(r,{L:()=>Wt});var t=i(221),e=i.n(t),n=i(3277),s=i(8473),o=i(2635),a=i(8764).Buffer,h=i(5108);const u=new Set(["ssa","ass"]),l=["readOrder","layer","style","name","marginL","marginR","marginV","effect","text"];function c(t,e){const i=t.Children.find((t=>t.id===e));return i?i.data:void 0}class d extends s.Transform{constructor(){super(),this.subtitleTracks=new Map,this.timecodeScale=1,this._currentClusterTimecode=null,this.decoder=new n.LE({bufferTagIds:[n.Av.TimecodeScale,n.Av.Tracks,n.Av.BlockGroup,n.Av.AttachedFile]}),this.decoder.on("data",this.parseEbmlSubtitles.bind(this))}parseEbmlSubtitles(t){if(t.id===n.Av.TimecodeScale&&(this.timecodeScale=t.data/1e6),t.id===n.Av.Timecode&&(this._currentClusterTimecode=t.data),t.id===n.Av.Tracks){for(const e of t.Children.filter((t=>t.id===n.Av.TrackEntry))){if(17!==c(e,n.Av.TrackType))continue;const t=c(e,n.Av.CodecID)||"";if(t.startsWith("S_TEXT")){const i={number:c(e,n.Av.TrackNumber),language:c(e,n.Av.Language),type:t.substring(7).toLowerCase()},r=c(e,n.Av.Name);r&&(i.name=r);const s=c(e,n.Av.CodecPrivate);s&&(i.header=s.toString()),e.Children.find((t=>t.id===n.Av.ContentEncodings&&t.Children.find((t=>t.id===n.Av.ContentEncoding&&t.Children.find((t=>t.id===n.Av.ContentCompression))))))&&(i._compressed=!0),this.subtitleTracks.set(i.number,i)}}this.emit("tracks",Array.from(this.subtitleTracks.values()))}if(t.id===n.Av.BlockGroup){const e=t.Children.find((t=>t.id===n.Av.Block));if(e&&this.subtitleTracks.has(e.track)){const i=c(t,n.Av.BlockDuration),r=this.subtitleTracks.get(e.track),s={text:(r._compressed?(0,o.inflateSync)(a.from(e.payload)):e.payload).toString("utf8"),time:(e.value+this._currentClusterTimecode)*this.timecodeScale,duration:i*this.timecodeScale};if(u.has(r.type)){const t=s.text.split(",");for(let e="ssa"===r.type?2:1;e<8;e++)s[l[e]]=t[e];s.text=t.slice(8).join(",")}this.emit("subtitle",s,e.track)}}t.id===n.Av.AttachedFile&&this.emit("file",{filename:c(t,n.Av.FileName),mimetype:c(t,n.Av.FileMimeType),data:c(t,n.Av.FileData)})}}class f extends d{constructor(){super(),this.decoder.on("data",(t=>{t.id===n.Av.Tracks&&0===this.subtitleTracks.size&&this.end()}))}_write(t,e,i){this.decoder.write(t),i(null,t)}}class p extends d{constructor(t){super(),t instanceof d&&(t.once("drain",(()=>t.end())),this.subtitleTracks=t.subtitleTracks,this.timecodeScale=t.timecodeScale,this.unstable=!0)}_transform(t,e,i){if(this.unstable){for(let e=0;e{t.oncomplete=t.onsuccess=()=>e(t.result),t.onabort=t.onerror=()=>i(t.error)}))}function g(t,e){const i=(!navigator.userAgentData&&/Safari\//.test(navigator.userAgent)&&!/Chrom(e|ium)\//.test(navigator.userAgent)&&indexedDB.databases?new Promise((function(t){var e=function(){return indexedDB.databases().finally(t)};r=setInterval(e,100),e()})).finally((function(){return clearInterval(r)})):Promise.resolve()).then((()=>{const i=indexedDB.open(t);return i.onupgradeneeded=()=>i.result.createObjectStore(e),m(i)}));var r;return(t,r)=>i.then((i=>r(i.transaction(e,t).objectStore(e))))}let b;function v(){return b||(b=g("keyval-store","keyval")),b}function y(t,e,i=v()){return i("readwrite",(i=>(i.put(e,t),m(i.transaction))))}function w(t,e=v()){return e("readwrite",(e=>(e.delete(t),m(e.transaction))))}const _=g("fsa-chunk-store","handles");(function(t=v()){return t("readonly",(e=>{if(e.getAll&&e.getAllKeys)return Promise.all([m(e.getAllKeys()),m(e.getAll())]).then((([t,e])=>t.map(((t,i)=>[t,e[i]]))));const i=[];return t("readonly",(t=>function(t,e){return t.openCursor().onsuccess=function(){this.result&&(e(this.result),this.result.continue())},m(t.transaction)}(t,(t=>i.push([t.key,t.value]))).then((()=>i))))}))})(_).then((t=>{for(const[e,i]of t)i.removeEntry(e,{recursive:!0}),w(e,_)}));class M{constructor(t,e={}){if(this.chunkLength=Number(t),!this.chunkLength)throw new Error("First argument must be a chunk length");if(this.closed=!1,this.name=e.name||"default",this.rootDirPromise=e.rootDir||navigator.storage.getDirectory(),this.storageDirPromise=this._getStorageDirectoryHandle(),this.chunksDirPromise=e.files&&e.rootDir&&this._getChunksDirHandle()||this.storageDirPromise,this.chunks=[],this.chunkMap=[],this.directoryMap={},e.files&&e.rootDir){if(this.files=e.files.slice(0).map(((t,e,i)=>{if(null==t.path)throw new Error("File is missing `path` property");if(null==t.length)throw new Error("File is missing `length` property");if(null==t.offset)if(0===e)t.offset=0;else{const r=i[e-1];t.offset=r.offset+r.length}null==t.handle&&(t.handle=this._createFileHandle({path:t.path}));const r=t.offset,n=t.offset+t.length,s=Math.floor(r/this.chunkLength),o=Math.floor((n-1)/this.chunkLength);for(let e=s;e<=o;++e){const i=e*this.chunkLength,s=ri+this.chunkLength?this.chunkLength:n-i,a=r>i?0:i-r;this.chunkMap[e]||(this.chunkMap[e]=[]),this.chunkMap[e].push({from:s,to:o,offset:a,file:t})}return t})),window.addEventListener("pagehide",this.cleanup),this.length=this.files.reduce(((t,e)=>t+e.length),0),null!=e.length&&e.length!==this.length)throw new Error("total `files` length is not equal to explicit `length` option")}else this.length=Number(e.length)||1/0;this.length!==1/0&&(this.lastChunkLength=this.length%this.chunkLength||this.chunkLength,this.lastChunkIndex=Math.ceil(this.length/this.chunkLength)-1)}async _getChunksDirHandle(){const t=await this.storageDirPromise;return await t.getDirectoryHandle("chunks",{create:!0})}async _getStorageDirectoryHandle(){const t=await this.rootDirPromise;return await t.getDirectoryHandle(this.name,{create:!0})}async _getChunk(t){let e=this.chunks[t];if(!e){const i=t.toString(),r=await this.chunksDirPromise;e=this.chunks[t]={fileHandlePromise:r.getFileHandle(i,{create:!0})}}return e}async _createFileHandle(t){const e=t.path.slice(t.path.lastIndexOf("/")+1);return(await this._getDirectoryHandle(t)).getFileHandle(e,{create:!0})}async _getDirectoryHandle(t){const e=t.path.lastIndexOf("/");if(-1===e||0===e)return this.storageDirPromise;const i=t.path=t.path.slice(0,e);if(!this.directoryMap[i]){const e=this._getDirectoryHandle(t);this.directoryMap[i]=(await e).getDirectoryHandle(i.slice(i.lastIndexOf("/")+1),{create:!0})}return this.directoryMap[i]}put(t,e,i=(()=>{})){if(this.closed)return void queueMicrotask((()=>i(new Error("Storage is closed"))));const r=t===this.lastChunkIndex;if(r&&e.length!==this.lastChunkLength)queueMicrotask((()=>{i(new Error(`Last chunk length must be ${this.lastChunkLength}`))}));else if(r||e.length===this.chunkLength){if((async()=>{try{const i=await this._getChunk(t),r=await i.fileHandlePromise,n=await r.createWritable({keepExistingData:!1});await n.write(e),await n.close()}catch(t){return void i(t)}this.files||i(null)})(),this.files){const r=this.chunkMap[t];r||queueMicrotask((()=>i(new Error("No files matching the request range"))));const n=r.map((t=>(async()=>{try{const{file:i}=t;i.stream||(i.stream=(await i.handle).createWritable({keepExistingData:!0}));const r=await i.stream;return await r.write({type:"write",position:t.offset,data:e.slice(t.from,t.to)}),null}catch(t){return i(t)}})()));Promise.all(n).then((()=>i(null)))}}else queueMicrotask((()=>{i(new Error(`Chunk length must be ${this.chunkLength}`))}))}get(t,e,i=(()=>{})){if("function"==typeof e)return this.get(t,null,e);if(this.closed)return void queueMicrotask((()=>i(new Error("Storage is closed"))));const r=t===this.lastChunkIndex?this.lastChunkLength:this.chunkLength;e||(e={});const n=e.offset||0,s=e.length?n+e.length:r,o=e.length||r-n;if(!this.files||this.chunks[t])(async()=>{let e;try{const i=await this._getChunk(t),s=await i.fileHandlePromise;let a=await s.getFile();0===n&&o===r||(a=a.slice(n,o+n)),e=await a.arrayBuffer()}catch(t){return void i(t)}if(0===e.byteLength){const e=new Error(`Index ${t} does not exist`);return e.notFound=!0,void i(e)}i(null,new Uint8Array(e))})();else{let r=this.chunkMap[t];if(r||queueMicrotask((()=>i(new Error("No files matching the request range")))),e&&(r=r.filter((t=>t.to>n&&t.fromi(new Error("No files matching the request range"))))),n===s)return queueMicrotask((()=>i(null,new Uint8Array(0))));const o=r.map((t=>(async()=>{let i=t.from,r=t.to,o=t.offset;e&&(r>s&&(r=s),i{1===t.length?i(null,new Uint8Array(t[0])):new Blob(t).arrayBuffer().then((t=>{i(null,new Uint8Array(t))}))}))}}async close(t=(()=>{}),e){this.closed?queueMicrotask((()=>t(new Error("Storage is closed")))):(this.closed=!0,this.chunkMap=[],this.directoryMap={},await this.cleanup(e),queueMicrotask((()=>{t(null)})))}async cleanup(t){if(this.chunks=[],this.files){const e=[];for(const t of this.files)t.stream&&(e.push(await(await t.stream).close()),t.stream=null);if(!0!==t){const t=await this.storageDirPromise;y("chunks",t,_),await t.removeEntry("chunks",{recursive:!0}),w("chunks",_)}await Promise.all(e)}}async destroy(t=(()=>{})){if(this.closed)return void queueMicrotask((()=>t(new Error("Storage is closed"))));const e=await this.rootDirPromise;y(this.name,e,_),this.close((async()=>{try{await e.removeEntry(this.name,{recursive:!0}),w(this.name,_)}catch(e){return void t(e)}t(null)}),!0)}}var k=i(4137),x=i(1191),E=i(9421);const S=!!window.chrome;class T{constructor(t,e={}){if(this.chunkLength=Number(t),!this.chunkLength)throw new Error("First argument must be a chunk length");this.length=Number(e.length)||1/0,this.fallbackStore=null,this.chunkCount=null,this.stores=[],this.chunks=[];const i=(t,i)=>{const r=e;if(i&&i{const r=t.quota-t.usage-Math.max(Number(e.reserved)||0,16777216);!0===e.onlyMem||r<=0?(this.fallbackStore=new x(this.chunkLength,e),this.stores.push(this.fallbackStore),this.chunkCount=0):"getDirectory"in navigator.storage?i(M,!e.rootDir&&r):i(k,!(S&&2147483648===t.quota)&&r)}))}get(t,e,i){this.registration.then((()=>{this.chunks[t]?this.chunks[t].get(t,e,i):this.fallbackStore.get(t-this.chunkCount,e,i)}))}put(t,e,i){this.registration.then((()=>{this.chunks[t]?this.chunks[t].put(t,e,i):this.fallbackStore.put(t-this.chunkCount,e,i)}))}close(t=(()=>{})){const e=[];for(const t of this.stores)e.push(new Promise((e=>t.close(e))));Promise.all(e).then((e=>{e=e.filter((t=>t)),t(e.length>1?e:e[0])}))}destroy(t=(()=>{})){const e=[];for(const t of this.stores)e.push(new Promise((e=>t.destroy(e))));Promise.all(e).then((e=>{e=e.filter((t=>t)),t(e.length>1?e:e[0])}))}}var A=i(5108);class I{constructor(t={}){if(window.Worker){if(this.canvas=t.canvas,this.renderMode=t.renderMode||"offscreen","blend"!==this.renderMode&&"normal"!==this.renderMode&&("undefined"==typeof createImageBitmap?this.renderMode="normal":"undefined"!=typeof OffscreenCanvas&&(this.renderMode="offscreen")),this.targetFps=t.targetFps||23.976,this.prescaleTradeoff=t.prescaleTradeoff||null,this.softHeightLimit=t.softHeightLimit||1080,this.hardHeightLimit=t.hardHeightLimit||2160,this.resizeVariation=t.resizeVariation||.2,this.video=t.video,this.canvasParent=null,this.onReadyEvent=t.onReady,this.onErrorEvent=t.onError,this.debug=!!t.debug,this.lastRenderTime=0,this.timeOffset=t.timeOffset||0,this.renderedItems=[],this.renderAhead=1024*(t.renderAhead||0)*1024*.9,this.oneshotState={eventStart:null,eventOver:!1,iteration:0,renderRequested:!1,requestNextTimestamp:-1,prevWidth:null,prevHeight:null},this.renderFrameData=null,this.workerActive=!1,this.frameId=0,this.workerActive=!1,this.worker||(this.worker=new Worker(t.workerUrl||"subtitles-octopus-worker.js"),this.worker.onmessage=t=>this.onWorkerMessage(t),this.worker.onerror=t=>this.workerError(t)),this.createCanvas(),this.setVideo(t.video),this.worker.postMessage({target:"worker-init",width:this.canvas.width,height:this.canvas.height,URL:document.URL,currentScript:t.workerUrl||"subtitles-octopus-worker.js",preMain:!0,renderMode:this.renderMode,subUrl:t.subUrl,subContent:t.subContent||null,fallbackFont:t.fallbackFont||null,lazyFontLoading:t.lazyFontLoading||!1,fonts:t.fonts||[],availableFonts:t.availableFonts||[],debug:this.debug,targetFps:this.targetFps,libassMemoryLimit:t.libassMemoryLimit||0,libassGlyphLimit:t.libassGlyphLimit||0,renderOnDemand:this.renderAhead>0,dropAllAnimations:!!t.dropAllAnimations}),"offscreen"===this.renderMode&&this.pushOffscreenCanvas(),this.initDone=!0,(()=>{if("function"==typeof ImageData.prototype.constructor)try{return new ImageData(new Uint8ClampedArray([0,0,0,0]),1,1)}catch(t){A.log("detected that ImageData is not constructable despite browser saying so")}const t=document.createElement("canvas").getContext("2d");window.ImageData=()=>{let e,i=0;arguments[0]instanceof Uint8ClampedArray&&(e=arguments[i++]);const r=arguments[i++],n=arguments[i],s=t.createImageData(r,n);return e&&s.data.set(e),s}})(),"offscreen"!==this.renderMode){this.ctx=this.canvas.getContext("2d"),this.bufferCanvas=document.createElement("canvas"),this.bufferCanvasCtx=this.bufferCanvas.getContext("2d"),this.bufferCanvas.width=1,this.bufferCanvas.height=1;const t=new Uint8ClampedArray([0,255,0,0]),e=new ImageData(t,1,1);this.bufferCanvasCtx.clearRect(0,0,1,1),this.ctx.clearRect(0,0,1,1);const i=this.ctx.getImageData(0,0,1,1).data;this.bufferCanvasCtx.putImageData(e,0,0),this.ctx.drawImage(this.bufferCanvas,0,0);const r=this.ctx.getImageData(0,0,1,1).data;this.hasAlphaBug=i[1]!==r[1],this.hasAlphaBug&&A.log("Detected a browser having issue with transparent pixels, applying workaround")}}else this.workerError("worker not supported")}workerError(t){if(A.error("Worker error: ",t),this.onErrorEvent&&this.onErrorEvent(t),!this.debug)throw this.destroy(),new Error("Worker error: "+t)}pushOffscreenCanvas(){const t=this.canvas.transferControlToOffscreen();this.worker.postMessage({target:"offscreenCanvas",canvas:t},[t])}createCanvas(){this.video?(this.canvas=document.createElement("canvas"),this.canvas.className="subtitles-octopus-canvas",this.canvas.style.display="none",this.canvasParent=document.createElement("div"),this.canvasParent.className="subtitles-octopus-canvas-parent",this.canvasParent.appendChild(this.canvas),this.video.nextSibling?this.video.parentNode.insertBefore(this.canvasParent,this.video.nextSibling):this.video.parentNode.appendChild(this.canvasParent)):this.canvas||this.workerError("Don't know where to render: you should give video or canvas in options.")}setVideo(t){if(this.video=t,this.video){let e=this.video.paused;const i=i=>{null!=i&&(e=i),this.setCurrentTime(this.video.paused||e,t.currentTime+this.timeOffset)};this.video.addEventListener("timeupdate",(()=>i()),!1),this.video.addEventListener("progress",(()=>i()),!1),this.video.addEventListener("waiting",(()=>i(!0)),!1),this.video.addEventListener("pause",(()=>i(!0)),!1),this.video.addEventListener("seeking",(()=>i(!0)),!1),this.video.addEventListener("playing",(()=>i(!1)),!1),this.video.addEventListener("seeked",(()=>{i(!1),this.renderAhead>0&&this._cleanPastRendered(this.video.currentTime+this.timeOffset,!0)}),!1),this.video.addEventListener("ratechange",this.setRate.bind(this),!1),"undefined"!=typeof ResizeObserver&&(this.ro=new ResizeObserver(this.resize.bind(this,0,0,0,0)),this.ro.observe(this.video)),this.video.videoWidth>0?this.resize():this.video.addEventListener("loadedmetadata",this.resize.bind(this,0,0,0,0),!1)}}getVideoPosition(){const t=this.video.videoWidth/this.video.videoHeight,{offsetWidth:e,offsetHeight:i}=this.video;let r=e,n=i;return e/i>t?r=Math.floor(i*t):n=Math.floor(e/t),{width:r,height:n,x:(e-r)/2,y:(i-n)/2}}_cleanPastRendered(t,e){let i=[];for(const e of this.renderedItems)(e.emptyFinish<0||e.emptyFinish>=t)&&i.push(e);if(e&&i.length>0&&t60)A.info("seeked back too far, cleaning prerender buffer"),i=[];else{A.info("seeked backwards, need to free up some buffer");let t=0;const e=.3*this.renderAhead,r=[];for(const n of i){if(t+=n.size,t>=e)break;r.push(n)}i=r}const r=i.length.01&&this.renderedItems.push({eventStart:t.lastRenderedTime,eventFinish:t.lastRenderedTime-.001,emptyFinish:t.eventStart,viewport:t.viewport,spentTime:0,blendTime:0,items:[],animated:!1,size:0});const e=[];let i=0;for(const r of t.canvases)e.push({...r,image:new ImageData(new Uint8ClampedArray(r.buffer),r.w,r.h)}),i+=r.buffer.byteLength;let r=!1;if(t.emptyFinish>0&&t.emptyFinish-t.eventStart<1/this.targetFps||t.animated){const e=t.eventStart+1/this.targetFps;t.emptyFinish=e,t.eventFinish=e,r=!0}this.renderedItems.push({...t,items:e,size:i}),this.renderedItems.sort(((t,e)=>t.eventStart-e.eventStart)),this.oneshotState.requestNextTimestamp>=0?this.tryRequestOneshot(this.oneshotState.requestNextTimestamp,!0):t.eventStart<0?A.info('oneshot received "end of frames" event'):t.emptyFinish>=0?this.tryRequestOneshot(t.emptyFinish,r):A.info("there are no more events to prerender")}tryRequestOneshot(t,e){if(!this.renderAhead||this.renderAhead<=0)return;if(this.oneshotState.renderRequested&&!e)return;if(void 0===t){if(!this.video)return;t=this.video.currentTime+this.timeOffset}let i=0;for(const e of this.renderedItems){if(e.emptyFinish<0)return void A.info("oneshot already reached end-of-events");if(t>=e.eventStart&&tt))this._renderSubtitleEvent(n,t),i=!0,e=n.emptyFinish;else if(e>=0){if(!(n.eventStart-e<.01))break;e=n.emptyFinish,r=n.animated}i?this._cleanPastRendered(t)&&e>=0&&this.tryRequestOneshot(e,r):Math.abs(this.oneshotState.requestNextTimestamp-t)>.01&&(this._cleanPastRendered(t),this.tryRequestOneshot(t,!0))}resetRenderAheadCache(t){if(this.renderAhead>0){const e=[];if(t&&this.oneshotState.prevHeight&&this.oneshotState.prevWidth){if(this.oneshotState.prevHeight===this.canvas.height&&this.oneshotState.prevWidth===this.canvas.width)return;let t=10,i=.3*this.renderAhead;this.canvas.height>=this.oneshotState.prevHeight*(1-this.resizeVariation)&&this.canvas.height<=this.oneshotState.prevHeight*(1+this.resizeVariation)&&this.canvas.width>=this.oneshotState.prevWidth*(1-this.resizeVariation)&&this.canvas.width<=this.oneshotState.prevWidth*(1+this.resizeVariation)&&(A.debug("viewport changes are small, leaving more of prerendered buffer"),t=30,i=.5*this.renderAhead);const r=this.video.currentTime+this.timeOffset+t;let n=0;for(const t of this.renderedItems){if(t.emptyFinish<0||t.emptyFinish>=r)break;if(n+=t.size,n>=i)break;e.push(t)}}A.info("resetting prerender cache"),this.renderedItems=e,this.oneshotState.eventStart=null,this.oneshotState.iteration++,this.oneshotState.renderRequested=!1,this.oneshotState.prevHeight=this.canvas.height,this.oneshotState.prevWidth=this.canvas.width,window.requestAnimationFrame(this.oneshotRender),this.tryRequestOneshot(void 0,!0)}}renderFrames(t){const e=performance.now();this.ctx.clearRect(0,0,this.canvas.width,this.canvas.height);for(const e of t.canvases){this.bufferCanvas.width=e.w,this.bufferCanvas.height=e.h;const t=new Uint8ClampedArray(e.buffer);if(this.hasAlphaBug)for(let e=3;e=1?t[e]:1;const i=new ImageData(t,e.w,e.h);this.bufferCanvasCtx.putImageData(i,0,0),this.ctx.drawImage(this.bufferCanvas,e.x,e.y)}if(this.debug){const i=performance.now()-e,r=t.blendTime;void 0!==r?A.log("render: "+Math.round(t.spentTime-r)+" ms, blend: "+Math.round(r)+" ms, draw: "+i+" ms; TOTAL="+Math.round(t.spentTime+i)+" ms"):A.log({length:t.canvases.length,sum:t.libassTime+t.decodeTime+i,libassTime:t.libassTime,decodeTime:t.decodeTime,drawTime:i}),this.renderStart=performance.now()}}renderFastFrames(t){const e=performance.now();this.ctx.clearRect(0,0,this.canvas.width,this.canvas.height);for(const e of t.bitmaps)this.ctx.drawImage(e.bitmap,e.x,e.y);if(this.debug){const i=performance.now()-e;A.log({length:t.bitmaps.length,sum:t.libassTime+t.decodeTime+i,libassTime:t.libassTime,decodeTime:t.decodeTime,drawTime:i}),this.renderStart=performance.now()}}_computeCanvasSize(t,e){return null===this.prescaleTradeoff?e>this.hardHeightLimit&&(t=t*this.hardHeightLimit/e,e=this.hardHeightLimit):this.prescaleTradeoff>1?e*this.prescaleTradeoff<=this.softHeightLimit?(t*=this.prescaleTradeoff,e*=this.prescaleTradeoff):e=this.hardHeightLimit&&(t=t*this.hardHeightLimit/e,e=this.hardHeightLimit):e>=this.softHeightLimit&&(e*this.prescaleTradeoff<=this.softHeightLimit?(t=t*this.softHeightLimit/e,e=this.softHeightLimit):e*this.prescaleTradeoff<=this.hardHeightLimit?(t*=this.prescaleTradeoff,e*=this.prescaleTradeoff):(t=t*this.hardHeightLimit/e,e=this.hardHeightLimit)),{width:t,height:e}}resize(t=0,e=0,i=0,r=0){let n=null;if((!t||!e)&&this.video){n=this.getVideoPosition();const s=this._computeCanvasSize(n.width*(window.devicePixelRatio||1),n.height*(window.devicePixelRatio||1));t=s.width,e=s.height;const o=this.canvasParent.getBoundingClientRect().top-this.video.getBoundingClientRect().top;i=n.y-o,r=n.x}this.canvas.style.top===i&&this.canvas.style.left===r||(null!=n&&(this.canvasParent.style.position="relative",this.canvas.style.display="block",this.canvas.style.position="absolute",this.canvas.style.top=i+"px",this.canvas.style.left=r+"px",this.canvas.style.pointerEvents="none",this.canvas.style.width=n.width+"px",this.canvas.style.height=n.height+"px"),this.canvas.width===t&&this.canvas.height===e||("offscreen"===this.renderMode&&this.initDone&&(this.canvasParent.remove(),this.canvasParent=void 0,this.createCanvas()),this.resizeTimeoutBuffer?(clearTimeout(this.resizeTimeoutBuffer),this.resizeTimeoutBuffer=setTimeout((()=>{this.resizeTimeoutBuffer=void 0,this.rePaint(t,e,i,r,n)}),50)):(this.rePaint(t,e,i,r,n),this.resizeTimeoutBuffer=setTimeout((()=>{this.resizeTimeoutBuffer=void 0}),50))))}rePaint(t=0,e=0,i=0,r=0,n){"offscreen"===this.renderMode&&this.canvasParent&&this.initDone&&(this.canvasParent.remove(),this.canvasParent=void 0,this.createCanvas()),this.canvas.width=t,this.canvas.height=e,null!=n&&(this.canvasParent.style.position="relative",this.canvas.style.display="block",this.canvas.style.position="absolute",this.canvas.style.top=i+"px",this.canvas.style.left=r+"px",this.canvas.style.pointerEvents="none",this.canvas.style.width=n.width+"px",this.canvas.style.height=n.height+"px"),"offscreen"===this.renderMode&&this.initDone&&this.pushOffscreenCanvas(),this.worker.postMessage({target:"canvas",width:this.canvas.width,height:this.canvas.height}),this.resetRenderAheadCache(!0)}onWorkerMessage(t){this.workerActive||(this.workerActive=!0,this.onReadyEvent&&this.onReadyEvent());const e=t.data;switch(e.target){case"stdout":A.log(e.content);break;case"stderr":A.error(e.content);break;case"canvas":switch(e.op){case"renderCanvas":this.lastRenderTime{t.addEventListener("icegatheringstatechange",(()=>"complete"===t.iceGatheringState&&e()))}))}class B{constructor(t={}){let{polite:e=!0,trickle:i=!0}=t,{port1:r,port2:n}=new MessageChannel,s=t=>n.postMessage(JSON.stringify(t));const o=new RTCPeerConnection({iceServers:t?.iceServers||[{urls:["stun:stun.l.google.com:19302","stun:global.stun.twilio.com:3478"]}]}),a=new AbortController,h={signal:a.signal};o.addEventListener("iceconnectionstatechange",(()=>{"disconnected"!==o.iceConnectionState&&"failed"!==o.iceConnectionState||a.abort()}),h);const u=o.createDataChannel("both",{negotiated:!0,id:0});this.pc=o,this.dc=u,this.signal=a.signal,this.polite=e,this.signalingPort=r,this.ready=new Promise((t=>{u.addEventListener("open",(()=>{i=!0,s=t=>u.send(JSON.stringify(t)),r.close(),n.close(),this.ready=n=r=n.onmessage=null,t()}),{once:!0,...h})})),o.addEventListener("icecandidate",(({candidate:t})=>{i&&s({candidate:t})}),{...h});let l=!1,c=!1;async function d({data:t}){const{description:e,candidate:r}="string"==typeof t?JSON.parse(t):t;if(e){const t="offer"===e.type&&(l||"stable"!==o.signalingState);if(c=!this.polite&&t,c)return;if(t)await Promise.all([o.setLocalDescription({type:"rollback"}),o.setRemoteDescription(e)]);else try{"answer"===e.type&&"stable"===o.signalingState||await o.setRemoteDescription(e)}catch(t){}"offer"===e.type&&(await o.setLocalDescription(await o.createAnswer()),i||await C(o,"new"),s({description:o.localDescription}))}else r&&await o.addIceCandidate(r)}o.addEventListener("negotiationneeded",(async()=>{l=!0;const t=await o.createOffer();if("stable"===o.signalingState)if(await o.setLocalDescription(t),l=!1,i)s({description:o.localDescription});else{await C(o);const t=o.localDescription.toJSON();t.sdp=t.sdp.replace(/a=ice-options:trickle\s\n/g,""),s({description:t})}}),{...h}),n.onmessage=d.bind(this),u.addEventListener("message",d.bind(this),{...h})}}window.Peer=B;var R=i(5108);const P=[" B"," KB"," MB"," GB"," TB"];class L extends(e()){constructor(t={}){super(t.WebTorrentOpts),this.storeOpts=t.storeOpts||{};const e=location.pathname.substr(0,location.pathname.lastIndexOf("/")+1),i=location.origin+e+"sw.js"===navigator.serviceWorker?.controller?.scriptURL&&navigator.serviceWorker.controller,r=t=>{const e=t=>"activated"===t.state&&this.loadWorker(t);e(t)||t.addEventListener("statechange",(({target:t})=>e(t)))};if(i?r(i):navigator.serviceWorker.register("sw.js",{scope:e}).then((t=>{r(t.active||t.waiting||t.installing)})).catch((t=>{if("InvalidStateError: Failed to register a ServiceWorker: The document is in an invalid state."!==String(t))throw t;location.reload()})),window.addEventListener("beforeunload",(()=>{this.destroy(),this.cleanupVideo()})),this.video=t.video,this.controls=t.controls||{},this.controls.setVolume&&(this.controls.setVolume.addEventListener("input",(t=>this.setVolume(t.target.value))),this.setVolume(),this.oldVolume=void 0,"audioTracks"in HTMLVideoElement.prototype&&this.controls.audioButton&&this.video.addEventListener("loadedmetadata",(()=>{if(this.video.audioTracks.length>1){this.controls.audioButton.removeAttribute("disabled");for(const t of this.video.audioTracks)this.createRadioElement(t,"audio")}else this.controls.audioButton.setAttribute("disabled","")}))),this.controls.ppToggle&&(this.controls.ppToggle.addEventListener("click",(()=>this.playPause())),this.controls.ppToggle.addEventListener("dblclick",(()=>this.toggleFullscreen()))),this.controls.setProgress&&(this.controls.setProgress.addEventListener("input",(t=>this.setProgress(t.target.value))),this.controls.setProgress.addEventListener("mouseup",(t=>this.dragBarEnd(t.target.value))),this.controls.setProgress.addEventListener("touchend",(t=>this.dragBarEnd(t.target.value))),this.controls.setProgress.addEventListener("mousedown",(t=>this.dragBarStart(t.target.value))),this.video.addEventListener("timeupdate",(t=>{this.immerseTimeout&&"#player"===document.location.hash&&!this.video.paused&&this.setProgress(t.target.currentTime/t.target.duration*100)})),this.video.addEventListener("ended",(()=>this.setProgress(100)))),this.video.addEventListener("loadedmetadata",(()=>this.findSubtitleFiles(this.currentFile))),this.subtitleData={fonts:[],headers:[],tracks:[],current:void 0,renderer:void 0,stream:void 0,parser:void 0,parsed:void 0,timeout:void 0,defaultHeader:`[V4+ Styles]\nFormat: Name, Fontname, Fontsize, PrimaryColour, SecondaryColour, OutlineColour, BackColour, Bold, Italic, Underline, StrikeOut, ScaleX, ScaleY, Spacing, Angle, BorderStyle, Outline, Shadow, Alignment, MarginL, MarginR, MarginV, Encoding\nStyle: Default,${t.defaultSSAStyles||"Roboto Medium,26,&H00FFFFFF,&H000000FF,&H00020713,&H00000000,0,0,0,0,100,100,0,0,1,1.3,0,2,20,20,23,1"}\n[Events]\n\n`},this.completed=!1,this.video.addEventListener("timeupdate",(()=>this.checkCompletion())),this.nextTimeout=void 0,t.autoNext&&this.video.addEventListener("ended",(()=>this.playNext())),this.resolveFileMedia=t.resolveFileMedia,this.currentFile=void 0,this.videoFile=void 0,this.controls.thumbnail){this.generateThumbnails=t.generateThumbnails;const e=document.createElement("canvas");e.width=t.thumbnailWidth||150,this.thumbnailData={thumbnails:[],canvas:e,context:e.getContext("2d"),interval:void 0,video:void 0},this.video.addEventListener("loadedmetadata",(()=>this.initThumbnail())),this.video.addEventListener("timeupdate",(()=>this.createThumbnail(this.video)))}t.visibilityLossPause&&(this.wasPaused=!0,document.addEventListener("visibilitychange",(()=>{this.video.ended||("hidden"===document.visibilityState?(this.wasPaused=this.video.paused,this.video.pause()):this.wasPaused||this.playPause())}))),this.onDone=void 0,this.destroyStore=null==t.destroyStore||!!t.destroyStore,this.immerseTimeout=void 0,this.immerseTime=t.immerseTime||5,this.playerWrapper=t.playerWrapper,this.player=t.player,this.player&&(this.player.addEventListener("fullscreenchange",(()=>this.updateFullscreen())),this.player.addEventListener("mousemove",(()=>requestAnimationFrame((()=>this.resetImmerse())))),this.player.addEventListener("touchmove",(()=>requestAnimationFrame((()=>this.resetImmerse())))),this.player.addEventListener("keypress",(()=>requestAnimationFrame((()=>this.resetImmerse())))),this.player.addEventListener("mouseleave",(()=>requestAnimationFrame((()=>this.immersePlayer())))),this.doubleTapTimeout=void 0,this.player.addEventListener("touchend",(t=>{this.doubleTapTimeout?(t.preventDefault(),clearTimeout(this.doubleTapTimeout),this.doubleTapTimeout=void 0,this.toggleFullscreen()):this.doubleTapTimeout=setTimeout((()=>{this.doubleTapTimeout=void 0}),200)}))),this.bufferTimeout=void 0,this.video.addEventListener("playing",(()=>this.hideBuffering())),this.video.addEventListener("canplay",(()=>this.hideBuffering())),this.video.addEventListener("loadeddata",(()=>this.hideBuffering())),this.video.addEventListener("waiting",(()=>this.showBuffering()));const n=t=>{t?this.controls.toggleCast.removeAttribute("disabled"):this.controls.toggleCast.setAttribute("disabled","")};"PresentationRequest"in window?(this.presentationRequest=new PresentationRequest(["lib/cast.html"]),this.presentationRequest.addEventListener("connectionavailable",(t=>this.initCast(t))),this.presentationConnection=null,navigator.presentation.defaultRequest=this.presentationRequest,this.presentationRequest.getAvailability().then((t=>{t.onchange=t=>n(t.target.value),n(t.value)}))):this.controls.toggleCast.setAttribute("disabled",""),"pictureInPictureEnabled"in document?(this.burnIn=t.burnIn,this.controls.togglePopout&&this.controls.togglePopout.removeAttribute("disabled"),this.burnIn&&this.video.addEventListener("enterpictureinpicture",(()=>{this.subtitleData.renderer&&this.togglePopout()}))):(this.video.setAttribute("disablePictureInPicture",""),this.controls.togglePopout&&this.controls.togglePopout.setAttribute("disabled","")),this.seekTime=t.seekTime||5,"mediaSession"in navigator&&(navigator.mediaSession.setActionHandler("play",(()=>this.playPause())),navigator.mediaSession.setActionHandler("pause",(()=>this.playPause())),navigator.mediaSession.setActionHandler("seekbackward",(()=>this.seek(this.seekTime))),navigator.mediaSession.setActionHandler("seekforward",(()=>this.seek(this.seekTime))),navigator.mediaSession.setActionHandler("nexttrack",(()=>this.playNext())),"setPositionState"in navigator.mediaSession&&this.video.addEventListener("timeupdate",(()=>this.updatePositionState()))),this.subtitleExtensions=[".srt",".vtt",".ass",".ssa"],this.videoExtensions=[".3g2",".3gp",".asf",".avi",".dv",".flv",".gxf",".m2ts",".m4a",".m4b",".m4p",".m4r",".m4v",".mkv",".mov",".mp4",".mpd",".mpeg",".mpg",".mxf",".nut",".ogm",".ogv",".swf",".ts",".vob",".webm",".wmv",".wtv"],this.videoFiles=void 0,this.updateDisplay(),this.offlineTorrents=JSON.parse(localStorage.getItem("offlineTorrents"))||{},Object.values(this.offlineTorrents).forEach((t=>this.offlineDownload(new Blob([new Uint8Array(t)])))),this.streamedDownload=t.streamedDownload,this.fps=23.976,"requestVideoFrameCallback"in HTMLVideoElement.prototype&&this.video.addEventListener("loadeddata",(()=>{this.fps=new Promise((t=>{let e=null,i=!1,r=0;const n=(s,o)=>{if(r)if(e){const r=(1/((o.mediaTime-e.mediaTime)/(o.presentedFrames-e.presentedFrames))).toFixed(3);this.currentFile.name.endsWith(".mkv")?t(r<25&&r>22?23.976:r<31&&r>28?29.97:r<62&&r>58?59.94:r):t(r),i&&this.video.pause()}else e=o,this.video.requestVideoFrameCallback(n);else r++,this.video.paused&&(i=!0,this.video.play()),this.video.requestVideoFrameCallback(n)};this.video.requestVideoFrameCallback(n)}))}));for(const[t,e]of Object.entries(this.controls))if(this[t])if(e.constructor===Array)for(const i of e)i.addEventListener("click",(e=>{this[t](e.target.value)}));else e.addEventListener("click",(e=>{this[t](e.target.value)}));document.addEventListener("keydown",(t=>{if("F5"===t.key&&t.preventDefault(),"#player"===location.hash)switch(t.key){case" ":this.playPause();break;case"n":this.playNext();break;case"m":this.toggleMute();break;case"p":this.togglePopout();break;case"t":this.toggleTheatre();break;case"c":this.captions();break;case"f":this.toggleFullscreen();break;case"s":this.seek(85);break;case"ArrowLeft":this.seek(-this.seekTime);break;case"ArrowRight":this.seek(this.seekTime);break;case"ArrowUp":this.setVolume(Number(this.controls.setVolume.value)+5);break;case"ArrowDown":this.setVolume(Number(this.controls.setVolume.value)-5);break;case"Escape":location.hash="#home"}}))}async buildVideo(t,e={}){if(this.cleanupVideo(),e.file?this.currentFile=e.file:this.videoFiles.length>1?this.currentFile=this.videoFiles.filter((async t=>await this.resolveFileMedia({fileName:t.name}).then((t=>Number(t.episodeNumber)===Number(e.episode||1)||t===e.media))))[0]||this.videoFiles[0]:this.currentFile=this.videoFiles[0],this.nowPlaying=e.media&&(1===this.videoFiles.length||e.forceMedia&&e.file)?e.media:this.resolveFileMedia?await this.resolveFileMedia({fileName:this.currentFile.name,method:"SearchName"}):void 0,this.nowPlaying){navNowPlaying&&navNowPlaying.classList.remove("d-none");const t=[this.nowPlaying.episodeNumber,this.nowPlaying.episodeTitle].filter((t=>t)).join(" - ");"mediaSession"in navigator&&(navigator.mediaSession.metadata=new MediaMetadata({title:this.nowPlaying.mediaTitle||this.nowPlaying.name||"WebTorrentPlayer",artist:"Episode "+t,album:this.nowPlaying.name||"WebTorrentPlayer",artwork:[{src:this.nowPlaying.episodeThumbnail||this.nowPlaying.mediaCover||"",sizes:"256x256",type:"image/jpg"}]})),this.nowPlaying.episodeThumbnail&&(this.video.poster=this.nowPlaying.episodeThumbnail),this.changeControlsIcon("nowPlaying","EP "+t),document.title=[this.nowPlaying.mediaTitle,!!t&&"EP "+t,this.nowPlaying.name||"WebTorrentPlayer"].filter((t=>t)).join(" - ")}if(this.currentFile.name.endsWith("mkv")){let t=null;this.currentFile.on("stream",(({stream:e})=>{t=e})),this.initParser(this.currentFile).then((()=>{this.currentFile.on("stream",(({stream:t,req:e},i)=>{"video"!==e.destination||this.subtitleData.parsed||(this.subtitleData.stream=new p(this.subtitleData.stream),this.handleSubtitleParser(this.subtitleData.stream,!0),t.pipe(this.subtitleData.stream),i(this.subtitleData.stream))})),t?.destroy()}))}await navigator.serviceWorker.ready,this.currentFile.done?this.postDownload():this.onDone=this.currentFile.on("done",(()=>this.postDownload())),this.currentFile.streamTo(this.video),this.video.load(),this.playVideo(),this.controls.downloadFile&&this.currentFile.getStreamURL(((t,e)=>{this.controls.downloadFile.href=e}))}cleanupVideo(){this.presentationConnection?.terminate(),document.pictureInPictureElement&&document.exitPictureInPicture(),this.subtitleData.renderer?.destroy(),this.subtitleData.parser?.destroy(),this.subtitleData.stream?.destroy(),this.subtitleData.fonts?.forEach((t=>URL.revokeObjectURL(t))),this.controls.downloadFile&&(this.controls.downloadFile.href=""),this.currentFile=void 0,this.video.poster="",this.video.pause(),this.video.src="",this.video.load(),this.onDone=void 0,document.title=this.nowPlaying?.name||"WebTorrentPlayer",this.setProgress(0),Object.assign(this.subtitleData,{fonts:[],headers:[],tracks:[],current:void 0,renderer:void 0,stream:void 0,parser:void 0,parsed:void 0,timeout:void 0}),this.controls.thumbnail&&Object.assign(this.thumbnailData,{thumbnails:[],interval:void 0,video:void 0}),this.completed=!1,this.changeControlsIcon("nowPlaying",""),this.controls.captionsButton&&this.controls.captionsButton.setAttribute("disabled",""),this.changeControlsIcon("selectCaptions",""),this.changeControlsIcon("selectAudio",""),this.controls.openPlaylist&&this.controls.openPlaylist.setAttribute("disabled",""),navNowPlaying&&navNowPlaying.classList.add("d-none"),"mediaSession"in navigator&&(navigator.mediaSession.metadata=void 0),this.fps=23.976}changeControlsIcon(t,e){if(this.controls[t])if(this.controls[t].constructor===Array)for(const i of this.controls[t])i.textContent=e;else this.controls[t].textContent=e}async playVideo(){try{await this.video.play(),this.changeControlsIcon("playPause","pause")}catch(t){this.changeControlsIcon("playPause","play_arrow")}}playPause(){this.video.paused?this.playVideo():(this.changeControlsIcon("playPause","play_arrow"),this.video.pause())}setVolume(t){const e=void 0===t?Number(this.controls.setVolume.value):t;this.controls.setVolume.value=e,this.controls.setVolume.style.setProperty("--volume-level",e+"%"),this.changeControlsIcon("toggleMute",0===e?"volume_off":"volume_up"),this.video.volume=e/100}toggleMute(){0===this.video.volume?this.setVolume(this.oldVolume):(this.oldVolume=100*this.video.volume,this.setVolume(0))}toggleTheatre(){this.playerWrapper.classList.toggle("nav-hidden")}toggleFullscreen(){document.fullscreenElement?document.exitFullscreen():this.player.requestFullscreen()}updateFullscreen(){this.changeControlsIcon("toggleFullscreen",document.fullscreenElement?"fullscreen_exit":"fullscreen")}openPlaylist(){this.emit("playlist",{files:this.videoFiles})}playNext(){clearTimeout(this.nextTimeout),this.nextTimeout=setTimeout((()=>{if(this.videoFiles?.indexOf(this.currentFile){if(this.videoFiles?.indexOf(this.currentFile)){const t=this.nowPlaying;t.episodeNumber-=1;const e=this.currentFile._torrent;this.buildVideo(e,{media:t,file:this.videoFiles[this.videoFiles.indexOf(this.currentFile)-1]})}else this.emit("prev",{file:this.currentFile,filemedia:this.nowPlaying})}),200)}toggleCast(){this.video.readyState&&(this.presentationConnection?this.presentationConnection?.terminate():this.presentationRequest.start())}initCast(t){let e=new B({polite:!0});this.presentationConnection=t.connection,this.presentationConnection.addEventListener("terminate",(()=>{this.presentationConnection=null,this.changeControlsIcon("toggleCast","cast"),this.player.classList.remove("pip"),e=null})),e.signalingPort.onmessage=({data:t})=>{this.presentationConnection.send(t)},this.presentationConnection.addEventListener("message",(({data:t})=>{e.signalingPort.postMessage(t)})),e.dc.onopen=async()=>{if(await this.fps,e&&this.presentationConnection){this.changeControlsIcon("toggleCast","cast_connected"),this.player.classList.add("pip");const t=[],i=this.video.captureStream();if(this.burnIn){const{stream:e,destroy:r}=await this.getBurnIn(!this.subtitleData.renderer);t.push(e.getVideoTracks()[0],i.getAudioTracks()[0]),this.presentationConnection.addEventListener("terminate",r)}else t.push(i.getVideoTracks()[0],i.getAudioTracks()[0]);for(const r of t)e.pc.addTrack(r,i);this.video.play()}}}async togglePopout(){if(this.video.readyState)if(this.burnIn)if(await this.fps,this.subtitleData.renderer)if(document.pictureInPictureElement&&!document.pictureInPictureElement.id)document.exitPictureInPicture();else{const t=document.createElement("video"),{stream:e,destroy:i}=await this.getBurnIn();t.srcObject=e,t.onloadedmetadata=()=>{t.play(),t.requestPictureInPicture().then(this.player.classList.add("pip")).catch((e=>{R.warn("Failed To Burn In Subtitles "+e),i(),t.remove(),this.player.classList.remove("pip")}))},t.onleavepictureinpicture=()=>{i(),t.remove(),this.player.classList.remove("pip")}}else this.video!==document.pictureInPictureElement?this.video.requestPictureInPicture():document.exitPictureInPicture();else this.video!==document.pictureInPictureElement?this.video.requestPictureInPicture():document.exitPictureInPicture()}async getBurnIn(t){const e=document.createElement("canvas"),i=e.getContext("2d",{alpha:!1}),r=await this.fps;let n=null,s=null;if(e.width=this.video.videoWidth,e.height=this.video.videoHeight,"requestVideoFrameCallback"in HTMLVideoElement.prototype){const r=async()=>{i.drawImage(this.video,0,0),t||i.drawImage(this.subtitleData.renderer?.canvas,0,0,e.width,e.height),n=this.video.requestVideoFrameCallback(r)};n=this.video.requestVideoFrameCallback(r),s=()=>{this.video.cancelVideoFrameCallback(n),e.remove()}}else{const o=()=>{i.drawImage(this.video,0,0),t||i.drawImage(this.subtitleData.renderer?.canvas,0,0,e.width,e.height),n=function(t,e){const i=Date.now();let r=requestAnimationFrame((function n(){Date.now()-i>=e?t():r=requestAnimationFrame(n)}));return{clear:()=>cancelAnimationFrame(r)}}(o,500/r)};n=requestAnimationFrame(o),s=()=>{var t;(t=n)&&t.clear(),e.remove()}}return{stream:e.captureStream(),destroy:s}}toTS(t,e){if(isNaN(t)||t<0)return e?"0:00:00.00":"00:00";const i=Math.floor(t/3600);let r=Math.floor(t/60)-60*i,n=e?(t%60).toFixed(2):Math.floor(t%60);return r<10&&(r="0"+r),n<10&&(n="0"+n),i>0||e?i+":"+r+":"+n:r+":"+n}prettyBytes(t){if(isNaN(t))return"0 B";if(t<1)return t+" B";const e=Math.min(Math.floor(Math.log(t)/Math.log(1e3)),P.length-1);return Number((t/Math.pow(1e3,e)).toFixed(2))+P[e]}getBytes(t){const e=t.split(" ");return e[0]*1024**(["B","KiB","MiB","GiB","TiB","Bytes","KB","MB","GB","TB"].indexOf(e[1]||"B")%5)}seek(t){85===t&&this.video.currentTime<10?this.video.currentTime=90:85===t&&this.video.duration-this.video.currentTime<90?this.video.currentTime=this.video.duration:this.video.currentTime+=t,this.setProgress(this.video.currentTime/this.video.duration*100)}forward(){this.seek(this.seekTime)}rewind(){this.seek(-this.seekTime)}immersePlayer(){this.player.classList.add("immersed"),this.immerseTimeout=void 0}resetImmerse(){this.immerseTimeout?clearTimeout(this.immerseTimeout):this.player.classList.remove("immersed"),this.immerseTimeout=setTimeout((()=>this.immersePlayer()),1e3*this.immerseTime)}hideBuffering(){this.bufferTimeout&&(clearTimeout(this.bufferTimeout),this.bufferTimeout=void 0,this.player.classList.remove("buffering"))}showBuffering(){this.bufferTimeout=setTimeout((()=>{this.player.classList.add("buffering"),this.resetImmerse()}),150)}checkCompletion(){!this.completed&&this.video.duration-180=2){const e=Math.floor(t.currentTime/this.thumbnailData.interval);this.thumbnailData.thumbnails[e]||(this.thumbnailData.context.fillRect(0,0,150,this.thumbnailData.canvas.height),this.thumbnailData.context.drawImage(t,0,0,150,this.thumbnailData.canvas.height),this.thumbnailData.thumbnails[e]=this.thumbnailData.canvas.toDataURL("image/jpeg"))}}finishThumbnails(t){const e=performance.now(),i=document.createElement("video");let r=0;i.preload="none",i.volume=0,i.playbackRate=0,i.addEventListener("loadeddata",(()=>n())),i.addEventListener("canplay",(()=>{this.createThumbnail(this.thumbnailData.video),n()})),this.thumbnailData.video=i;const n=()=>{for(;this.thumbnailData.thumbnails[r]&&r<=Math.floor(this.thumbnailData.video.duration/this.thumbnailData.interval);)r++;this.thumbnailData.video?.currentTime!==this.thumbnailData.video?.duration?this.thumbnailData.video.currentTime=r*this.thumbnailData.interval:(this.thumbnailData.video?.removeAttribute("src"),this.thumbnailData.video?.load(),this.thumbnailData.video?.remove(),delete this.thumbnailData.video,R.log("Thumbnail creating finished",r,this.toTS((performance.now()-e)/1e3))),r++};this.thumbnailData.video.src=t,this.thumbnailData.video.play(),R.log("Thumbnail creating started")}dragBarEnd(t){this.video.currentTime=this.video.duration*t/100||0,this.playVideo()}dragBarStart(t){this.video.pause(),this.setProgress(t)}setProgress(t){t=t||0;const e=this.video.duration*t/100||0;this.controls.progressWrapper&&this.controls.progressWrapper.style.setProperty("--progress",t+"%"),this.controls.thumbnail&&(this.controls.thumbnail.src=this.thumbnailData.thumbnails[Math.floor(e/this.thumbnailData.interval)]||" "),this.controls.setProgress&&(this.controls.setProgress.dataset.elapsed=this.toTS(e),this.controls.setProgress.value=t),this.controls.progressWrapper&&(this.controls.progressWrapper.dataset.elapsed=this.toTS(e),this.controls.progressWrapper.dataset.remaining=this.toTS(this.video.duration-e))}updateDisplay(){this.currentFile&&this.currentFile._torrent&&(this.player&&this.player.style.setProperty("--download",100*this.currentFile.progress+"%"),this.controls.peers&&(this.controls.peers.dataset.value=this.currentFile._torrent.numPeers),this.controls.downSpeed&&(this.controls.downSpeed.dataset.value=this.prettyBytes(this.currentFile._torrent.downloadSpeed)+"/s"),this.controls.upSpeed&&(this.controls.upSpeed.dataset.value=this.prettyBytes(this.currentFile._torrent.uploadSpeed)+"/s")),setTimeout((()=>requestAnimationFrame((()=>this.updateDisplay()))),200)}createRadioElement(t,e){if("captions"===e&&this.controls.selectCaptions&&this.controls.captionsButton||"audio"===e&&this.controls.selectAudio){const i=document.createDocumentFragment(),r=document.createElement("input"),n=document.createElement("label");r.name=`${e}-radio-set`,r.type="radio",r.id="captions"===e?`${e}-${t?t.number:"off"}-radio`:`${e}-${t.id}-radio`,r.value="captions"===e?t?t.number:-1:t.id,r.checked="captions"===e?t?.number===this.subtitleData.current:t.enabled,n.htmlFor="captions"===e?`${e}-${t?t.number:"off"}-radio`:`${e}-${t.id}-radio`,n.textContent=t?"captions"===e?(t.language||(Object.values(this.subtitleData.headers).some((t=>"eng"===t.language||"en"===t.language))?t.type:"eng"))+(t.name?" - "+t.name:""):(t.language||(Object.values(this.video.audioTracks).some((t=>"eng"===t.language||"en"===t.language))?t.label:"eng"))+(t.label?" - "+t.label:""):"OFF",i.append(r),i.append(n),"captions"===e?(this.controls.selectCaptions.append(i),this.controls.captionsButton.removeAttribute("disabled")):this.controls.selectAudio.append(i)}}selectAudio(t){if(void 0!==t){for(const e of this.video.audioTracks)e.enabled=e.id===t;this.seek(-.5)}}selectCaptions(t){void 0!==t&&(t=Number(t),this.subtitleData.current=t,this.subtitleData.timeout||(this.subtitleData.timeout=setTimeout((()=>{this.subtitleData.timeout=void 0,this.subtitleData.renderer&&this.subtitleData.renderer.setTrack(-1!==t?this.subtitleData.headers[t].header.slice(0,-1)+Array.from(this.subtitleData.tracks[t]).join("\n"):this.subtitleData.defaultHeader)}),1e3)))}constructSub(t,e){if(!0===e){const e=t.text.match(/<[^>]+>/g);e&&e.forEach((e=>{/<\//.test(e)?t.text=t.text.replace(e,e.replace("","0}")):t.text=t.text.replace(e,e.replace("<","{\\").replace(">","1}"))})),t.text.replace(/&/g,"&").replace(/</g,"<").replace(/>/g,">").replace(/ /g,"\\h")}return"Dialogue: "+(t.layer||0)+","+this.toTS(t.time/1e3,!0)+","+this.toTS((t.time+t.duration)/1e3,!0)+","+(t.style||"Default")+","+(t.name||"")+","+(t.marginL||"0")+","+(t.marginR||"0")+","+(t.marginV||"0")+","+(t.effect||"")+","+t.text||0}parseSubtitles(t,e){return new Promise((i=>{if(t.name.endsWith(".mkv")){let r=new f;this.handleSubtitleParser(r,e);const n=()=>{R.log("Sub parsing finished",this.toTS((performance.now()-s)/1e3)),this.subtitleData.parsed=!0,this.subtitleData.stream?.destroy(),this.subtitleData.parser?.destroy(),o?.destroy(),this.subtitleData.stream=void 0,this.subtitleData.parser=void 0,this.selectCaptions(this.subtitleData.current),r=void 0,this.video.paused||(this.video.pause(),this.playVideo()),i()};r.once("tracks",(t=>{t.length||n()})),r.once("finish",n);const s=performance.now();R.log("Sub parsing started");const o=t.createReadStream();this.subtitleData.parser=o.pipe(r)}else i()}))}initParser(t){return new Promise((e=>{const i=this.subtitleData.stream=new f;this.handleSubtitleParser(this.subtitleData.stream),i.once("tracks",(t=>{t.length||(this.subtitleData.parsed=!0,e(),this.subtitleData.stream.destroy(),r.destroy())})),i.on("subtitle",(()=>{e(),r.destroy()}));const r=t.createReadStream({end:t.length/2});r.pipe(i)}))}handleSubtitleParser(t,e){t.once("tracks",(t=>{t.length?t.forEach((t=>{this.subtitleData.tracks[t.number]||("ass"!==t.type&&(t.header=this.subtitleData.defaultHeader),this.subtitleData.current||(this.subtitleData.current=t.number,this.createRadioElement(void 0,"captions")),this.subtitleData.tracks[t.number]=new Set,this.subtitleData.headers[t.number]=t,this.createRadioElement(t,"captions"))})):this.subtitleData.parsed=!0})),t.on("subtitle",((t,e)=>{this.subtitleData.parsed||(this.subtitleData.renderer||this.initSubtitleRenderer(),this.subtitleData.tracks[e].add(this.constructSub(t,"ass"!==this.subtitleData.headers[e].type)),this.subtitleData.current===e&&this.selectCaptions(e))})),e||t.on("file",(t=>{"application/x-truetype-font"!==t.mimetype&&"application/font-woff"!==t.mimetype&&"application/vnd.ms-opentype"!==t.mimetype||this.subtitleData.fonts.push(URL.createObjectURL(new Blob([t.data],{type:t.mimetype})))}))}async initSubtitleRenderer(){if(!this.subtitleData.renderer){const t={video:this.video,targetFps:await this.fps,subContent:this.subtitleData.headers[this.subtitleData.current].header.slice(0,-1),renderMode:"offscreen",fonts:this.subtitleData.fonts,fallbackFont:"https://fonts.gstatic.com/s/roboto/v20/KFOlCnqEu92Fr1MmEU9fBBc4.woff2",workerUrl:"lib/subtitles-octopus-worker.js",onReady:()=>{this.video.paused||(this.video.pause(),this.playVideo())}};this.subtitleData.renderer||(this.subtitleData.renderer=new I(t),this.selectCaptions(this.subtitleData.current))}}convertSubFile(t,e,i){const r=/(?:\d+\n)?(\S{9,12})\s?-->\s?(\S{9,12})(.*)\n([\s\S]*)$/i;t.getBuffer(((t,n)=>{const s=e?n.toString():[];if(e)i(s);else{const t=n.toString().replace(/\r/g,"");for(const e of t.split("\n\n")){const t=e.match(r);if(t){t[1]=t[1].match(/.*[.,]\d{2}/)[0],t[2]=t[2].match(/.*[.,]\d{2}/)[0],9===t[1].length?t[1]="0:"+t[1]:"0"===t[1][0]&&(t[1]=t[1].substring(1)),t[1].replace(",","."),9===t[2].length?t[2]="0:"+t[2]:"0"===t[2][0]&&(t[2]=t[2].substring(1)),t[2].replace(",",".");const e=t[4].match(/<[^>]+>/g);e&&e.forEach((e=>{/<\//.test(e)?t[4]=t[4].replace(e,e.replace("","0}")):t[4]=t[4].replace(e,e.replace("<","{\\").replace(">","1}"))})),s.push("Dialogue: 0,"+t[1].replace(",",".")+","+t[2].replace(",",".")+",Default,,0,0,0,,"+t[4])}}i(s)}}))}findSubtitleFiles(t){const e=t.path.split(t.name)[0],i=t._torrent.files.filter((t=>this.subtitleExtensions.some((e=>t.name.endsWith(e)))&&(1===this.videoFiles.length||2===t.path.split(e).length)));if(i.length){this.createRadioElement(void 0,"captions"),this.subtitleData.parsed=!0,this.subtitleData.current=0;for(const[e,r]of i.entries()){const i=r.name.endsWith(".ass")||r.name.endsWith(".ssa"),n=/\.(\w+)$/,s=r.name.replace(t.name,"")===r.name?r.name.replace(t.name.replace(n,""),"").slice(0,-4).replace(/[,._-]/g," ").trim():r.name.replace(t.name,"").slice(0,-4).replace(/[,._-]/g," ").trim(),o={header:this.subtitleData.defaultHeader,language:s,number:e,type:r.name.match(n)[1]};this.subtitleData.headers.push(o),this.subtitleData.tracks[e]=[],this.createRadioElement(o,"captions"),this.convertSubFile(r,i,(t=>{i?this.subtitleData.headers[e].header=t:this.subtitleData.tracks[e]=t,this.subtitleData.current===e&&this.selectCaptions(this.subtitleData.current)})),this.initSubtitleRenderer()}}}postDownload(){this.emit("download-done",{file:this.currentFile}),this.parseSubtitles(this.currentFile,!0).then((()=>{this.generateThumbnails&&this.finishThumbnails(this.video.src)}))}playTorrent(t,e={}){const i=(t,e)=>{t.on("noPeers",(()=>{this.emit("no-peers",t)})),this.streamedDownload&&(t.files.forEach((t=>t.deselect())),t.deselect(0,t.pieces.length-1,!1)),this.videoFiles=t.files.filter((t=>this.videoExtensions.some((e=>t.name.endsWith(e))))),this.emit("video-files",{files:this.videoFiles,torrent:t}),this.videoFiles.length>1&&t.files.forEach((t=>t.deselect())),this.videoFiles?this.buildVideo(t,e):(this.emit("no-file",t),this.cleanupTorrents())};document.location.hash="#player",this.cleanupVideo(),this.cleanupTorrents(),t instanceof Object?i(t,e):this.get(t)?i(this.get(t),e):this.add(t,{destroyStoreOnDestroy:this.destroyStore,storeOpts:this.storeOpts,storeCacheSlots:0,store:T,announce:this.tracker.announce||["wss://tracker.openwebtorrent.com","wss://spacetradersapi-chatbox.herokuapp.com:443/announce","wss://peertube.cpy.re:443/tracker/socket"]},(t=>{i(t,e)}))}cleanupTorrents(){this.torrents.filter((t=>!this.offlineTorrents[t.infoHash])).forEach((t=>t.destroy()))}offlineDownload(t){const e=this.add(t,{storeOpts:this.storeOpts,store:T,storeCacheSlots:0,announce:this.tracker.announce||["wss://tracker.openwebtorrent.com","wss://spacetradersapi-chatbox.herokuapp.com:443/announce","wss://peertube.cpy.re:443/tracker/socket"]});e.on("metadata",(()=>{this.offlineTorrents[e.infoHash]||(this.offlineTorrents[e.infoHash]=Array.from(e.torrentFile),localStorage.setItem("offlineTorrents",JSON.stringify(this.offlineTorrents))),this.emit("offline-torrent",e)}))}}const O=halfmoon;var D=i.n(O),N=i(5108);D().showModal=t=>{const e=document.getElementById(t);e&&e.classList.add("show")},D().hideModal=t=>{const e=document.getElementById(t);e&&e.classList.remove("show")};const j=new URLSearchParams(location.href);j.get("access_token")&&(localStorage.setItem("ALtoken",j.get("access_token")),window.location="/app/#home");const U=window.chrome?-1!==navigator.userAgent.indexOf("Edg")?"edge":"chromium":"firefox";function F(t){const e=Math.floor(t/86400);t-=3600*e*24;const i=Math.floor(t/3600);t-=3600*i;const r=Math.floor(t/60);t-=60*r;const n=[];return e&&n.push(e+"d"),(e||i)&&n.push(i+"h"),(e||i||r)&&n.push(r+"m"),n.join(" ")}function q(t){const e={};for(const i in t)if(t[i]&&t[i].constructor===Object){const r=q(t[i]);for(const t in r)e[t]=r[t]}else e[i]=t[i];return e}const z=(new DOMParser).parseFromString.bind(new DOMParser);function H(t,e){if(!e){e=0;let i=t.length||t.byteLength||0;for(;i--;)e+=t[i].length}const i=new Uint8Array(e);let r=0;for(let e=0,n=t.length;enew Promise((e=>setTimeout(e,t)));class ${constructor(){this.queue=[],this.destroyed=!1,this.lastfn=null}add(t){if(!this.destroyed)if(!this.queue.length||t.index>this.queue[this.queue.length-1].index||t.indext.index)return void this.queue.splice(e,0,t);this.queue.push(t),N.warn("got bad")}}async _next(){const t=this.queue[0];await t.fn(),this._remove(t),!this.destroyed&&this.queue.length&&this._next()}_remove(t){this.destroyed||this.queue.splice(this.queue.indexOf(t),1)}destroy(){this.destroyed=!0,this.queue=null}}function Z(t){return new Promise(((e,i)=>{t.oncomplete=t.onsuccess=()=>e(t.result),t.onabort=t.onerror=()=>i(t.error)}))}function V(t,e){const i=function(){if(navigator.userAgentData||!/Safari\//.test(navigator.userAgent)||/Chrom(e|ium)\//.test(navigator.userAgent)||!indexedDB.databases)return Promise.resolve();let t;return new Promise((e=>{const i=()=>indexedDB.databases().finally(e);t=setInterval(i,100),i()})).finally((()=>clearInterval(t)))}().then((()=>{const i=indexedDB.open(t);return i.onupgradeneeded=()=>i.result.createObjectStore(e),Z(i)}));return(t,r)=>i.then((i=>r(i.transaction(e,t).objectStore(e))))}let K;function G(){return K||(K=V("keyval-store","keyval")),K}const J=[volume,player2,player3,player5,player6,player10,subtitle1,subtitle3,torrent1,torrent2,torrent3,torrent4,torrent7,torrent8,torrent9,torrent10,other1,other2,other3];setRes.addEventListener("click",(function(){localStorage.removeItem("settings"),location.reload()})),settingsTab.addEventListener("click",et),volume.addEventListener("click",et),regProtButton.addEventListener("click",(function(){"registerProtocolHandler"in navigator&&navigator.registerProtocolHandler("magnet",`${location.href.replace(location.hash,"")}#home&file=%s`,"Miru")}));const Y=JSON.parse(localStorage.getItem("settings"))||{};let X,Q;async function tt(){for(const t of J)Y[t.id]="checkbox"===t.type?t.checked:t.value;localStorage.setItem("settings",JSON.stringify(Y)),"showDirectoryPicker"in window&&Y.torrent5&&function(t,e,i=G()){i("readwrite",(i=>(i.put(e,t),Z(i.transaction))))}("directory",await Y.torrent5,X)}function et(){clearTimeout(Q),Q=setTimeout(tt,500)}"showDirectoryPicker"in window&&(X=V("handle-store","handles"),Y.torrent5=function(t,e=G()){return e("readonly",(e=>Z(e.get(t))))}("directory",X).then((t=>t?(torrent5label.value="Folder: "+t.name,t):null)),torrent5.classList.remove("d-none"),torrent5.onclick=async()=>{const t=await window.showDirectoryPicker();await t.requestPermission({mode:"readwrite"}),Y.torrent5=t,torrent5label.value="Folder: "+t.name||0}),clearRelCache.onclick=()=>{localStorage.removeItem("relations"),location.reload()};for(const t of Object.entries(Y)){const e=J.filter((e=>e.id===t[0]))[0];e&&("checkbox"===e.type?e.checked=t[1]:e.value=t[1])}tt(),other1.oninput=()=>other1.checked&&Notification.requestPermission().then((t=>{other1.checked="denied"!==t}));var it=i(5108);const rt={edge:["DTS"],chromium:["DTS","AC3","HEVC","x265","H.265"],firefox:["DTS","AC3","HEVC","x265","H.265",".3gp",".mkv"]};function nt(t){return fetch(t).then((t=>{if(t.ok)return t.text().then((t=>z(t,"text/xml")));throw Error(t.statusText)})).catch((t=>{D().initStickyAlert({content:"Failed fetching RSS!
"+t,title:"Search Failed",alertType:"alert-danger",fillType:""}),it.error(t)}))}function st(){return Object.values(torrent4list.options).filter((t=>t.value===Y.torrent4))[0]?new URL(Object.values(torrent4list.options).filter((t=>t.value===Y.torrent4))[0].textContent+Y.torrent1):new URL(Y.torrent4+Y.torrent1)}function ot(){const t=[navSchedule,homeContinueMore,homeReleasesMore,homePlanningMore,homeTrendingMore,homeRomanceMore,homeActionMore],e=[homeContinue,homeReleases,homePlanning,homeTrending,homeRomance,homeAction],i=[searchText,searchGenre,searchYear,searchSeason,searchFormat,searchStatus,searchSort],r=document.querySelector(".browse"),n={continue:async function(t){t||d(r);const e=await wt({method:"UserLists",status_in:"CURRENT",id:bt,page:t||1});return f({media:e.data.Page.mediaList.map((t=>t.media)).filter((t=>"RELEASING"!==t.status||t.mediaListEntry?.progresst.media)),gallery:r,method:"planning",page:t||1}),e.data.Page.pageInfo.hasNextPage},trending:async function(){return d(r),m(),searchSort.value="TRENDING_DESC",await n.search()},romance:async function(){return d(r),m(),searchGenre.value="romance",searchSort.value="TRENDING_DESC",await n.search()},action:async function(){return d(r),m(),searchGenre.value="action",searchSort.value="TRENDING_DESC",await n.search()},schedule:async function(t){t||d(r);const e=await wt({method:"AiringSchedule",page:t||1});return f({media:e.data.Page.airingSchedules.filter((t=>"CN"!==t.media.countryOfOrigin&&!1===t.media.isAdult)),gallery:r,method:"schedule",page:t||1,schedule:!0}),e.data.Page.pageInfo.hasNextPage},search:async function(t){const e={method:"Search",page:t||1},n={};Object.assign(n,e);for(const t of i)t.value&&(n[t.dataset.option]=t.value);if(Object.keys(e).length!==Object.keys(n).length){const e=await wt(n);return f({media:e.data.Page.media,gallery:r,method:"search",page:t||1}),e.data.Page.pageInfo.hasNextPage}return searchClear.classList.remove("text-primary"),home.classList.remove("loading"),p(),!1}},s={continue:function(){wt({method:"UserLists",status_in:"CURRENT",id:bt,perPage:50}).then((t=>{f({media:t.data.Page.mediaList.filter((({media:t})=>"RELEASING"!==t.status||t.mediaListEntry?.progresst.media)),gallery:homeContinue})}))},releases:async function(){const t=await nt(st());if(t){const e=t.querySelector("pubDate").textContent;if(u!==e){u&&(homeReleases.textContent="",homeReleases.append(...o(5)),Y.other1&&It({fileName:t.querySelector("item title").textContent,isRelease:!0}).then((e=>{new Notification(e.media.title.userPreferred,{body:`Episode ${e.episodeNumber} was just released!`,icon:e.media.coverImage.medium}).onclick=async()=>{window.parent.focus(),Ct[e.parseObject.anime_title]=(await wt({id:e.media.id,method:"SearchIDSingle"})).data.Media.id,Wt.playTorrent(t.querySelector("item link").textContent,{media:e,episode:e.episode})}}))),u=e;const i=await ct(t.querySelectorAll("item"),5);homeReleases.textContent="",homeReleases.append(...i)}}},planning:function(){wt({method:"UserLists",status_in:"PLANNING",id:bt,perPage:5}).then((t=>{f({media:t.data.Page.mediaList.map((t=>t.media)),gallery:homePlanning})}))},trending:function(){wt({method:"Search",id:bt,perPage:5,sort:"TRENDING_DESC"}).then((t=>{f({media:t.data.Page.media,gallery:homeTrending})}))},romance:function(){wt({method:"Search",genre:"Romance",perPage:5,sort:"TRENDING_DESC"}).then((t=>{f({media:t.data.Page.media,gallery:homeRomance})}))},action:function(){wt({method:"Search",genre:"Action",perPage:5,sort:"TRENDING_DESC"}).then((t=>{f({media:t.data.Page.media,gallery:homeAction})}))}},o=function(t){const e=[];for(;t--;)e.push(at.cloneNode(!0));return e};let a,h,u,l,c=!0;function d(t){home.classList.add("loading"),t.textContent="",t.append(...o(10))}function f(t){1===t.page&&home.classList.remove("loading"),t.method&&(c=!1,home.onscroll=function(){this.scrollTop+this.clientHeight>this.scrollHeight-800&&!a&&c&&(c=!1,a=setTimeout((function(){a=void 0}),1e3),n[t.method](t.page+1).then((t=>{c=t})))}),t.page&&1!==t.page||(t.gallery.textContent="");const e=new Date,i=[];t.media.forEach((r=>{if(t.schedule){if(r.timeUntilAiring&&(!h||new Date(+e+1e3*r.timeUntilAiring).getDay()!==h.getDay())){const t=document.createElement("div");h=new Date(+e+1e3*r.timeUntilAiring),t.classList.add("day-row","font-size-24","font-weight-bold","h-50","d-flex","align-items-end"),t.textContent=h.toLocaleDateString("en-US",{weekday:"long"}),i.push(t)}r=r.media}i.push(lt({media:r,schedule:t.schedule,onclick:()=>gt(r)}))})),t.gallery.append(...i),c=!0}for(const t of e)s[t.dataset.function]();setInterval(s.releases,3e4);for(const e of t)e.onclick=function(){home.scrollTop=0,home.classList.add("browsing"),searchClear.classList.add("text-primary"),n[e.dataset.function]()};function p(){m(),searchClear.classList.remove("text-primary"),home.classList.remove("browsing"),u=void 0,home.onscroll=void 0,home.scrollTop=0;for(const t of e)t.textContent="",t.append(...o(5)),s[t.dataset.function]();document.querySelector(".browse").textContent=""}function m(){for(const t of i)t.value=""}navHome.onclick=p,searchClear.onclick=p,searchWrapper.oninput=()=>{l?clearTimeout(l):(home.classList.add("browsing"),d(r),home.scrollTop=0),searchClear.classList.add("text-primary"),l=setTimeout((()=>{n.search(),l=void 0}),500)}}"audioTracks"in HTMLVideoElement.prototype||rt[U].push("mutli audio","dual audio");const at=skeletonCardTemplate.cloneNode(!0).content,ht=bareCardTemplate.cloneNode(!0).content,ut=fullCardTemplate.cloneNode(!0).content;function lt(t){if(t.media){const e=ut.cloneNode(!0),i=e.querySelectorAll("*");return i[0].onclick=t.onclick,i[0].style=`--color:${t.media.coverImage.color||"#1890ff"};`,i[3].src=t.media.coverImage.extraLarge||"",i[6].textContent=[t.media.title.userPreferred,t.episodeNumber].filter((t=>t)).join(" - "),t.schedule&&t.media.nextAiringEpisode&&(i[7].textContent="EP "+t.media.nextAiringEpisode.episode+" in "+F(t.media.nextAiringEpisode.timeUntilAiring)),i[8].innerHTML=""+["TV"===t.media.format?"TV Show":t.media.format?.toLowerCase().replace(/_/g," "),t.media.episodes?t.media.episodes+" Episodes":t.media.duration?t.media.duration+" Minutes":void 0,t.media.status?.toLowerCase().replace(/_/g," "),[t.media.season?.toLowerCase(),t.media.seasonYear].filter((t=>t)).join(" ")].filter((t=>t)).join("")+"",i[13].innerHTML=t.media.description,i[14].innerHTML=t.media.genres.map((t=>`${t} `)).join(""),e}if(t.parseObject){const e=ht.cloneNode(!0);return e.querySelector("h5").textContent=[t.parseObject.anime_title,t.parseObject.episode_number].filter((t=>t)).join(" - "),e.firstElementChild.onclick=t.onclick,e}return at.cloneNode(!0)}async function ct(t,e){const i=[];return(await It({fileName:[...t].map((t=>t.querySelector("title").textContent)).slice(0,e),isRelease:!0})).forEach(((e,r)=>{e.onclick=()=>Wt.playTorrent(t[r].querySelector("link").textContent,{media:e,episode:e.episode}),i.push(lt(e))})),localStorage.setItem("relations",JSON.stringify(Ct)),i}const dt=document.createElement("span");dt.classList.add("badge","badge-pill","shadow");const ft=[{property:"episode",label:"Airing",icon:"schedule",custom:"property"},{property:"genres",label:"Genres",icon:"theater_comedy"},{property:"season",label:"Season",icon:"spa",custom:"property"},{property:"episodes",label:"Episodes",icon:"theaters",custom:"property"},{property:"duration",label:"Duration",icon:"timer"},{property:"format",label:"Format",icon:"monitor"},{property:"status",label:"Status",icon:"live_tv"},{property:"nodes",label:"Studio",icon:"business"},{property:"source",label:"Source",icon:"source"},{property:"averageScore",label:"Rating",icon:"trending_up",custom:"property"},{property:"english",label:"English",icon:"title"},{property:"romaji",label:"Romaji",icon:"translate"},{property:"native",label:"Native",icon:"語",custom:"icon"}],pt=detailTemplate.cloneNode(!0).content;trailerClose.onclick=()=>{trailerVideo.src=""},navNowPlaying.onclick=()=>{Wt.nowPlaying.media&>(Wt.nowPlaying.media)};const mt=viewAnime.querySelectorAll("*");function gt(t,e){D().showModal("viewAnime");const i=q(t);mt[9].src=i.extraLarge||i.medium,mt[13].textContent=i.userPreferred,mt[17].textContent=i.averageScore+"%",mt[20].textContent="TV"===i.format?i.format:i.format?.toLowerCase(),1===i.episodes||!i.episodes&&!i.episode?(mt[14].classList.add("movie"),mt[31].classList.add("movie"),mt[28].textContent=i.duration+" min"):(mt[31].classList.remove("movie"),mt[14].classList.remove("movie"),mt[24].textContent=i.episodes),mt[29].textContent="",mt[29].append(...function(t=[]){const e=[];for(const i of t){const t=dt.cloneNode(!0);t.textContent=i,e.push(t)}return e}(i.genres)),i.episodes||i.episode?(mt[31].classList.remove("hidden"),mt[33].onclick=()=>{At(t,Number(mt[44].value)||1),D().hideModal("viewAnime")},mt[44].value=e||Math.min(Number(i.progress)+1||1,i.episodes),mt[35].textContent=i.progress&&i.progress!==i.episodes?"Continue":"Play",mt[46].onclick=()=>{At(t,Number(mt[56].value)||1,!0),D().hideModal("viewAnime")},mt[56].value=e||Math.min(Number(i.progress)+1||1,i.episodes)):mt[31].classList.add("hidden"),i.bannerImage?mt[4].style=`background-image: linear-gradient(0deg, rgba(17,20,23,1) 0%, rgba(17,20,23,0.80) 25%, rgba(17,20,23,0.40) 50%, rgba(37,40,44,0) 100%), url('${i.bannerImage}') !important`:mt[4].style="background-image: linear-gradient(0deg, rgba(17,20,23,1) 0%, rgba(17,20,23,0.80) 25%, rgba(17,20,23,0.40) 50%, rgba(37,40,44,0) 100%) !important",mt[57].onclick=()=>{return e=t.trailer,trailerVideo.src="",D().toggleModal("trailer"),void("youtube"===e.site&&(trailerVideo.src="https://www.youtube.com/embed/"+e.id));var e},mt[63].innerHTML=i.description,mt[66].textContent="",mt[66].append(...function(t){const e=[];for(const i of ft)if(t[i.property]){const r=pt.cloneNode(!0),n=r.querySelectorAll("*");switch(t[i.property].constructor){case String:n[4].textContent=t[i.property].replace(/_/g," ").toLowerCase();break;case Number:n[4].textContent=t[i.property];break;case Array:"nodes"===i.property?n[4].textContent=t[i.property][0]&&t[i.property][0].name:n[4].textContent=t[i.property].join(", ").replace(/_/g," ").toLowerCase()}switch(n[1].textContent=i.icon,n[3].textContent=i.label,i.custom){case"icon":n[1].classList.remove("material-icons","font-size-24"),n[1].classList.add("d-flex","align-items-center","text-nowrap","font-size-12","font-weight-bold");break;case"property":"episodes"===i.property&&t.progress?n[4].innerHTML=`Watched ${t.progress} of ${t.episodes}`:"averageScore"===i.property?n[4].textContent=t.averageScore+"%":"season"===i.property?n[4].textContent=[t.season?.toLowerCase(),t.seasonYear].filter((t=>t)).join(" "):"episode"===i.property?n[4].textContent=`Ep ${t.episode}: ${F(t.timeUntilAiring)}`:n[4].textContent=t[i.property]}e.push(r)}return e}(i))}let bt;"firefox"===U&&D().initStickyAlert({content:"Your browser will likely not support many video formats, containers and features. Please use Chromium!",title:"Bad Browser",alertType:"alert-danger",fillType:""});var vt=i(5108);async function yt(t){return await fetch("https://graphql.anilist.co",t).then((async t=>{const e=await t.json();if(!t.ok)for(const t of e.errors)D().initStickyAlert({content:`Failed making request to anilist!
${t.status} - ${t.message}`,title:"Search Failed",alertType:"alert-danger",fillType:""}),vt.error(t);return e}))}async function wt(t){let e;const i={type:"ANIME",sort:t.sort||"TRENDING_DESC",page:t.page||1,perPage:t.perPage||30,status_in:t.status_in||"[CURRENT,PLANNING]",chunk:t.chunk||1,perchunk:t.perChunk||30,startDate:!Y.other3&&(t.startDate||20210328)||1e7},r={method:"POST",headers:{"Content-Type":"application/json",Accept:"application/json"}},n="\nid,\ntitle {\n romaji,\n english,\n native,\n userPreferred\n},\ndescription(\n asHtml: true\n),\nseason,\nseasonYear,\nformat,\nstatus,\nepisodes,\nduration,\naverageScore,\ngenres,\ncoverImage {\n extraLarge,\n medium,\n color\n},\ncountryOfOrigin,\nisAdult,\nbannerImage,\nsynonyms,\nnextAiringEpisode {\n timeUntilAiring,\n episode\n},\ntrailer {\n id,\n site\n},\nstreamingEpisodes {\n title,\n thumbnail\n},\nmediaListEntry {\n progress\n},\nsource,\nstudios(isMain: true) {\n nodes {\n name\n }\n},\nrelations {\n edges {\n relationType(version:2)\n node {\n id,\n title {\n userPreferred\n },\n coverImage {\n medium\n },\n type,\n status,\n format,\n episodes\n }\n }\n}";switch(t.status&&(i.status=t.status),localStorage.getItem("ALtoken")&&(r.headers.Authorization=localStorage.getItem("ALtoken")),t.method){case"SearchName":i.search=t.name,e=` \nquery ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: [MediaStatus]) {\n Page (page: $page, perPage: $perPage) {\n pageInfo {\n hasNextPage\n },\n media(type: $type, search: $search, sort: $sort, status_in: $status) {\n ${n}\n }\n }\n}`;break;case"SearchIDSingle":i.id=t.id,e=` \nquery ($id: Int, $type: MediaType) { \n Media (id: $id, type: $type) {\n ${n}\n }\n}`;break;case"SearchIDS":i.id=t.id,e=` \nquery ($id: [Int], $type: MediaType, $page: Int, $perPage: Int) { \n Page (page: $page, perPage: $perPage) {\n pageInfo {\n hasNextPage\n },\n media (id_in: $id, type: $type) {\n ${n}\n }\n }\n}`;break;case"Viewer":e=" \nquery {\n Viewer {\n avatar {\n medium\n },\n name,\n id\n }\n}";break;case"UserLists":i.id=t.id,e=` \nquery ($page: Int, $perPage: Int, $id: Int, $type: MediaType, $status_in: [MediaListStatus]){\n Page (page: $page, perPage: $perPage) {\n pageInfo {\n hasNextPage\n },\n mediaList (userId: $id, type: $type, status_in: $status_in) {\n media {\n ${n}\n }\n }\n }\n}`;break;case"SearchIDStatus":i.id=bt,i.mediaId=t.id,e=" \nquery ($id: Int, $mediaId: Int){\n MediaList(userId: $id, mediaId: $mediaId) {\n status,\n progress,\n repeat\n }\n}";break;case"AiringSchedule":{const t=new Date,r=t.getDay()>=1?t.getDay()-1:6-t.getDay();t.setDate(t.getDate()-r),t.setHours(0,0,0,0),i.from=t.getTime()/1e3,i.to=(t.getTime()+6048e5)/1e3,e=` \nquery ($page: Int, $perPage: Int, $from: Int, $to: Int) {\n Page (page: $page, perPage: $perPage) {\n pageInfo {\n hasNextPage\n },\n airingSchedules(airingAt_greater: $from, airingAt_lesser: $to) {\n episode,\n timeUntilAiring,\n airingAt,\n media{\n ${n}\n }\n }\n }\n}`;break}case"Search":i.genre=t.genre,i.search=t.search,i.year=t.year,i.season=t.season,i.format=t.format,i.status=t.status,i.sort=t.sort||"SEARCH_MATCH",e=` \nquery ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: MediaStatus, $season: MediaSeason, $year: Int, $genre: String, $format: MediaFormat, $startDate: FuzzyDateInt) {\n Page (page: $page, perPage: $perPage) {\n pageInfo {\n hasNextPage\n },\n media(type: $type, search: $search, sort: $sort, status: $status, season: $season, seasonYear: $year, genre: $genre, format: $format, startDate_greater: $startDate) {\n ${n}\n }\n }\n}`}return r.body=JSON.stringify({query:e.replace(/\s/g,""),variables:i}),await yt(r)}const _t=anitomyscript;var Mt=i.n(_t),kt=i(5108);const xt=/(^magnet:){1}|(^[A-F\d]{8,40}$){1}|(.*\.torrent$){1}/i,Et=/\.(jpeg|jpg|gif|png|webp)/i;function St(t,e){if("file"===e){const e=new FileReader;e.onload=t=>{D().initStickyAlert({content:`Looking up anime for image.
`})},e.readAsDataURL(t.get("image"))}else D().initStickyAlert({content:`Looking up anime for image.
`});let i,r=`https://api.trace.moe/search?cutBorders&url=${t}`;"file"===e&&(i={method:"POST",body:t},r="https://api.trace.moe/search"),fetch(r,i).then((t=>t.json())).then((async({result:t})=>{t&&t[0].similarity>=.85?gt((await wt({method:"SearchIDSingle",id:t[0].anilist})).data.Media,t[0].episode):D().initStickyAlert({content:"Couldn't find anime for specified image! Try to remove black bars, or use a more detailed image.",title:"Search Failed",alertType:"alert-danger",fillType:""})}))}window.addEventListener("paste",(async t=>{const e=t.clipboardData.items[0];if(e&&0===e.type.indexOf("image")){t.preventDefault();const i=new FormData;i.append("image",e.getAsFile()),St(i,"file")}else e&&"text/plain"===e.type?e.getAsString((e=>{xt.exec(e)?(t.preventDefault(),searchText.value="",Wt.playTorrent(e)):Et.exec(e)&&(t.preventDefault(),searchText.value="",St(e))})):e&&"text/html"===e.type&&e.getAsString((e=>{const i=z(e,"text/html").querySelectorAll("img")[0];i&&(t.preventDefault(),searchText.value="",St(i.src))}))})),j.get("link")&&(St(j.get("link")),window.location="/app/#home");const Tt=/Episode (\d+) - (.*)/;async function At(t,e,i){parseInt(e)<10&&(e=`0${e}`);const r=document.querySelector("tbody.results"),n=await async function(t,e,i){const r=document.createDocumentFragment(),n=[...new Set(Object.values(t.title).concat(t.synonyms).filter((t=>null!=t)))].join(")|(").replace(/&/g,"%26"),s=1!==t.episodes&&("FINISHED"===t.status&&Y.torrent9?`"01-${t.episodes}"|"01~${t.episodes}"|"Batch"|"Complete"|"+${e}+"|"+${e}v"|"S01"`:`"+${e}+"|"+${e}v"`)||"",o=rt[U].join("|"),a=`${Y.torrent1}`||'"1080p"',h=!0===Y.torrent3?2:0,u=new URL(`https://meowinjapanese.cf/?page=rss&c=1_2&f=${h}&s=seeders&o=desc&q=(${n})${s}${a}-(${o})`),l=(await nt(u)).querySelectorAll("item *");if(!l.length)return r;const c=[];for(let t=Math.floor(l.length/15);t--;){const e=15*t;c[t]={title:l[e].textContent,hash:l[e+1].textContent,seeders:l[e+4].textContent,leechers:l[e+5].textContent,downloads:l[e+6].textContent,size:l[e+10].textContent}}c.sort(((t,e)=>e.seeders-t.seeders));const d=t?.streamingEpisodes.filter((t=>Tt.exec(t.title)&&Number(Tt.exec(t.title)[1])===Number(t)))[0],f={mediaTitle:t?.title.userPreferred,episodeNumber:Number(e),episodeTitle:d?Tt.exec(d.title)[2]:void 0,episodeThumbnail:d?.thumbnail,mediaCover:t?.coverImage.medium,name:"Miru",media:t};return Y.torrent2&&(i?Wt.offlineDownload(c[0].hash):Wt.playTorrent(c[0].hash,{media:f,episode:e}),D().toggleModal("tsearch")),c.forEach(((t,n)=>{const s=document.createElement("tr");s.innerHTML+=`\n${n+1}\n${t.title}\n${t.size}\n${t.seeders}\n${t.leechers}\n${t.downloads}\nPlay`,s.onclick=()=>{i?Wt.offlineDownload(t.hash):Wt.playTorrent(t.hash,{media:f,episode:e}),D().hideModal("tsearch")},r.appendChild(s)})),r}(t,e,i);0===n.children.length?D().initStickyAlert({content:`Couldn't find torrent for ${t.title.userPreferred} Episode ${parseInt(e)}! Try specifying a torrent manually.`,title:"Search Failed",alertType:"alert-danger",fillType:""}):(r.innerHTML="",r.appendChild(n),D().toggleModal("tsearch"))}async function It(t){const e=t.fileName.constructor===Array?t.fileName.map((t=>Mt()(t))):[Mt()(t.fileName)],i=await Promise.all(e);await Promise.all([...new Set(i.map((t=>t.anime_title)))].map((t=>async function(t){if(!(t in Ct)){const e={name:t,method:"SearchName",perPage:1,status:["RELEASING","FINISHED"],sort:"SEARCH_MATCH",startDate:1e7};let i=await wt(e);if(!i.data.Page.media[0]){const t=e.name.search(/S\d/);e.name=(-1!==t&&e.name.slice(0,t)+e.name.slice(t+1,e.name.length)||e.name).replace("(TV)","").replace(/ (19[5-9]\d|20[0-6]\d)/,"").replace("-",""),e.status=["RELEASING","FINISHED"],i=await wt(e)}i.data.Page.media[0]?Ct[t]=i.data.Page.media[0].id:Ct[t]=null}}(t))));const r={};for(let t=[...new Set(i.map((t=>Ct[t.anime_title])))];t.length;t=t.slice(50))for await(const e of(await wt({method:"SearchIDS",id:t.slice(0,50),perPage:50})).data.Page.media)r[e.id]=e;const n=[];for(const t of i){let e,i=r[Ct[t.anime_title]];async function s(r){let n,o,a,h;if(r.episode.constructor===Array?(n=Number(r.episode[0]),o=Number(r.episode[r.episode.length-1])):n=o=Number(r.episode),r.media.relations.edges.some((t=>"PREQUEL"===t.relationType&&("TV"===t.node.format||"TV_SHORT")))&&!r.increment?a=r.media.relations.edges.filter((t=>"PREQUEL"===t.relationType&&("TV"===t.node.format||"TV_SHORT")))[0].node:r.media.relations.edges.some((t=>"SEQUEL"===t.relationType&&("TV"===t.node.format||"TV_SHORT")))&&(a=r.media.relations.edges.filter((t=>"SEQUEL"===t.relationType&&("TV"===t.node.format||"TV_SHORT")))[0].node,h=!0),a?.episodes&&o-(r.offset+i.episodes)>(i.nextAiringEpisode?.episode||i.episodes)){const t=await wt({method:"SearchIDSingle",id:a.id});await s({media:t.data.Media,episode:r.episode,offset:r.offset+t.data.Media.episodes,increment:h})}else if(a?.episodes&&o-(r.offset+i.episodes)<=(i.nextAiringEpisode?.episode||i.episodes)&&n-(r.offset+i.episodes)>0){if(e=r.episode.constructor===Array?`${t.episode_number[0]-(r.offset+i.episodes)} ~ ${t.episode_number[t.episode_number.length-1]-(r.offset+i.episodes)}`:r.episode-(r.offset+i.episodes),r.increment||h){const t=await wt({method:"SearchIDSingle",id:a.id});i=t.data.Media}}else kt.log("error in parsing!",r.media,a),D().initStickyAlert({content:`Failed resolving anime episode!
${r.media.title.userPreferred} - ${o}`,title:"Parsing Error",alertType:"alert-secondary",fillType:""}),e=r.episode.constructor===Array?`${Number(t.episode_number[0])} ~ ${Number(t.episode_number[t.episode_number.length-1])}`:Number(r.episode)}("MOVIE"!==i?.format||i.episodes||i.nextAiringEpisode.episode)&&t.episode_number&&(t.episode_number.constructor===Array?1===parseInt(t.episode_number[0])?e=`${t.episode_number[0]} ~ ${t.episode_number[t.episode_number.length-1]}`:(i?.episodes||i?.nextAiringEpisode?.episode)&&parseInt(t.episode_number[t.episode_number.length-1])>(i.episodes||i.nextAiringEpisode.episode)?await s({media:i,episode:t.episode_number,offset:0}):e=`${Number(t.episode_number[0])} ~ ${Number(t.episode_number[t.episode_number.length-1])}`:(i?.episodes||i?.nextAiringEpisode?.episode)&&parseInt(t.episode_number)>(i.episodes||i.nextAiringEpisode.episode)?await s({media:i,episode:t.episode_number,offset:0}):e=Number(t.episode_number));const o=i?.streamingEpisodes.filter((e=>Tt.exec(e.title)&&Number(Tt.exec(e.title)[1])===Number(t.episode_number)))[0];n.push({mediaTitle:i?.title.userPreferred,episodeNumber:e,episodeTitle:o&&Tt.exec(o.title)[2],episodeThumbnail:o?.thumbnail,mediaCover:i?.coverImage.medium,name:"Miru",parseObject:t,media:i})}return 1===n.length?n[0]:n}const Ct=JSON.parse(localStorage.getItem("relations"))||{};var Bt=i(8833),Rt=i(4159),Pt=i.n(Rt),Lt=i(5228),Ot=i.n(Lt);const Dt=globalThis.gapi,Nt={apiKey:"",clientId:"",scope:"https://www.googleapis.com/auth/drive.readonly",discoveryDocs:["https://www.googleapis.com/discovery/v1/apis/drive/v3/rest"]};var jt=i(5108),Ut=i(8764).Buffer;const Ft=new Promise((t=>{(0,Dt.load)("client:auth2",(()=>{Dt.client.init(Object.assign({},Nt)).then((()=>{const e=Dt.auth2.getAuthInstance();if(e.isSignedIn.listen((i=>{if(!0===i){if(!e.currentUser.get().getAuthResponse().scope.includes("https://www.googleapis.com/auth/drive.readonly"))return D().initStickyAlert({content:"You didn't grant permission for Google Drive access, try again!",title:"Login Error",alertType:"alert-danger",fillType:""}),e.signOut();t(e.currentUser.get().getAuthResponse().access_token),gsignin.classList.add("d-none")}})),e.isSignedIn.get()){if(!e.currentUser.get().getAuthResponse().scope.includes("https://www.googleapis.com/auth/drive.readonly"))return D().initStickyAlert({content:"You didn't grant permission for Google Drive access, try again!",title:"Login Error",alertType:"alert-danger",fillType:""}),e.signOut();t(e.currentUser.get().getAuthResponse().access_token)}else gsignin.onclick=e.signIn,gsignin.classList.remove("d-none")}))}))}));async function qt(t){return new Promise((e=>{Ft.then((()=>{Dt.client.drive.files.list({pageSize:1,fields:"files(id)",includeItemsFromAllDrives:!0,supportsAllDrives:!0,corpora:"allDrives",q:`name = '${t}'`}).then((t=>{jt.log(t),e(t?.result?.files?.length&&t?.result?.files[0].id)}))}))}))}class zt extends(Ot()){constructor(t){super(),this.connId=t.infoHash+" gdrive",this.webPeerId=Pt().sync(this.connId),this._torrent=t,this.lastRequest={},this.sleep=null,this.queue=new $,this._init()}_init(){this.setKeepAlive(!0),this.once("handshake",((t,e)=>{if(this.destroyed)return;this.handshake(t,this.webPeerId);const i=this._torrent.pieces.length,r=new Bt.default(i);for(let t=0;t<=i;t++)r.set(t,!0);this.bitfield(r)})),this.once("interested",(()=>{this.unchoke()})),this.on("request",((t,e,i,r)=>{const n=()=>this.queue.add({fn:async()=>await this.httpRequest(t,e,i,((t,e)=>{if(t||e?.length!==i)return n();r(t,e)})),index:t});n()}))}async httpRequest(t,e,i,r){const n=t*this._torrent.pieceLength+e,s=n+i-1,o=this._torrent.files;let a;if(o.length<=1)a=[{url:`https://www.googleapis.com/drive/v3/files/${o[0].gDriveID}?supportsAllDrives=true&alt=media&key=${Nt.apiKey}`,start:n,end:s}];else{const t=o.filter((t=>t.offset<=s&&t.offset+t.length>n));if(t.length<1)return r(new Error("Could not find file corresponding to web seed range request"));a=t.map((t=>{const e=t.offset+t.length-1;return{url:`https://www.googleapis.com/drive/v3/files/${t.gDriveID}?supportsAllDrives=true&alt=media&key=${Nt.apiKey}`,fileOffsetInRange:Math.max(t.offset-n,0),start:Math.max(n-t.offset,0),end:Math.min(e,s-t.offset)}}))}let h,u=0,l=!1;a.length>1&&(h=Ut.alloc(i));let{res:c,reader:d,endRange:f,setSize:p,ctrl:m}=this.lastRequest;for await(const t of a){const{url:e,start:i,end:n}=t;function s(e,i){if(!e||e.status<200||e.status>=300){if(l)return;return l=!0,r(new Error(`Unexpected HTTP status code ${e?.status}`))}1===a.length?r(null,i):(i.copy(h,t.fileOffsetInRange),++u===a.length&&r(null,h))}if(f!==i-1||m?.signal?.aborted){async function*t(t){let e=[],i=0,r=!1,n=512;for(yield t=>{n=t};!r;){const s=await t.read();if(r=s.done,r)return void(yield H(e,i));for(i+=s.value.byteLength,e.push(s.value);i>=n;){const t=H(e);i-=n,yield t.slice(0,n),e=[t.slice(n,t.length)]}}}m&&m.abort(),m=new AbortController,await this.sleep;try{c=await fetch(e,{headers:{range:`bytes=${i}-`,authorization:"Bearer "+await Ft},signal:m.signal})}catch(t){throw this.sleep=W(500),s(),t}this.sleep=W(500),d=t(c.body.getReader()),p=(await d.next()).value}f=n,p(n-i+1),s(c,(await d.next()).value||new Uint8Array)}this.lastRequest={res:c,reader:d,endRange:f,setSize:p,ctrl:m}}destroy(){this.lastRequest?.ctrl?.abort(),this.queue.destroy(),this.lastRequest?.ctrl?.abort(),super.destroy(),this._torrent=null}}const Ht={};for(const t of document.getElementsByClassName("ctrl"))Ht[t.dataset.name]?Ht[t.dataset.name]=[Ht[t.dataset.name],t]:Ht[t.dataset.name]=t;window.addEventListener("beforeunload",(()=>{Wt.destroy()}));const Wt=new L({WebTorrentOpts:{maxConns:127,downloadLimit:1048576*Y.torrent7,uploadLimit:1572864*Y.torrent7,tracker:{announce:Y.torrent10.split("\n")},destroyStore:!0},controls:Ht,video,player,destroyStore:!0,playerWrapper:pageWrapper,burnIn:Y.subtitle3,seekTime:Number(Y.player3),immerseTime:Number(Y.player2),visibilityLossPause:Y.player10,autoNext:Y.player6,streamedDownload:Y.torrent8,generateThumbnails:Y.player5,defaultSSAStyles:Object.values(subtitle1list.options).filter((t=>t.value===Y.subtitle1))[0].textContent,resolveFileMedia:It});Wt.on("download-done",(({file:t})=>{D().initStickyAlert({content:`${t.name} has finished downloading. Now seeding.`,title:"Download Complete",alertType:"alert-success",fillType:""})})),Wt.on("torrent",(async function(t){await Ft;for await(const e of t.files){const t=await qt(e.name);if(!t)return D().initStickyAlert({content:`Couldn't find a GDrive file for ${e.name}! Can't create webseed!`,title:"GDrive Error!",alertType:"alert-secondary",fillType:""}),null;e.gDriveID=t,await W(1e3)}t.addWebSeed(new zt(t))})),Wt.on("watched",(({filemedia:t})=>{(t?.media?.episodes||t?.media?.nextAiringEpisode?.episode)&&Y.other2&&(t.media.episodes||t.media.nextAiringEpisode?.episode>t.episodeNumber)&&function(t){t.media&&localStorage.getItem("ALtoken")&&wt({method:"SearchIDStatus",id:t.media.id}).then((e=>{if(e.errors&&404===e.errors[0].status||e.data.MediaList.progress<=t.episodeNumber||1===t.episodes){const i="\nmutation ($id: Int, $status: MediaListStatus, $episode: Int, $repeat: Int) {\n SaveMediaListEntry (mediaId: $id, status: $status, progress: $episode, repeat: $repeat) {\n id,\n status,\n progress,\n repeat\n }\n}",r={repeat:0,id:t.media.id,status:"CURRENT",episode:t.episodeNumber||1};t.episodeNumber!==t.media.episodes&&1!==t.episodes||(r.status="COMPLETED","COMPLETED"===e.data.MediaList.status&&(r.repeat=e.data.MediaList.repeat+1)),yt({method:"POST",headers:{Authorization:"Bearer "+localStorage.getItem("ALtoken"),"Content-Type":"application/json",Accept:"application/json"},body:JSON.stringify({query:i,variables:r})})}}))}(t)})),Wt.on("playlist",(()=>{window.location.hash="#playlist"})),Wt.on("next",(({filemedia:t})=>{t.media?At(t.media,parseInt(t.episodeNumber)+1):D().initStickyAlert({content:"Couldn't find anime name! Try specifying a torrent manually.",title:"Search Failed",alertType:"alert-danger",fillType:""})})),Wt.on("prev",(({filemedia:t})=>{t.media?At(t.media,t.episodeNumber-1):D().initStickyAlert({content:"Couldn't find anime name! Try specifying a torrent manually.",title:"Search Failed",alertType:"alert-danger",fillType:""})})),Wt.on("offline-torrent",(t=>{It({fileName:t.name}).then((e=>{e.onclick=()=>Wt.playTorrent(t,{media:e,episode:e.episode});const i=lt(e);document.querySelector(".downloads").appendChild(i)}))})),Wt.on("video-files",(async({files:t,torrent:e})=>{document.querySelector(".playlist").textContent="";const i=[];for(const r of t){const t=await It({fileName:r.name});t.onclick=()=>{Wt.buildVideo(e,{media:t,episode:t.parseObject.episode,file:r})},i.push(lt(t))}document.querySelector(".playlist").append(...i)})),Wt.on("no-files",(t=>{D().initStickyAlert({content:`Couldn't find video file for ${t.infoHash}!`,title:"Search Failed",alertType:"alert-danger",fillType:""})})),Wt.on("no peers",(t=>{1!==t.progress&&D().initStickyAlert({content:`Couldn't find peers for ${t.infoHash}! Try a torrent with more seeders.`,title:"Search Failed",alertType:"alert-danger",fillType:""})})),Wt.nowPlaying={name:"Miru"},window.client=Wt,j.get("file")&&Wt.playTorrent(j.get("file")),queueMicrotask((function(){localStorage.getItem("ALtoken")?wt({method:"Viewer"}).then((t=>{oauth.removeAttribute("href"),oauth.setAttribute("data-title",`${t.data.Viewer.name}\nClick To Logout`),oauth.innerHTML=`\n \n \n ${t.data.Viewer.name}\n logout\n `,oauth.onclick=()=>{localStorage.removeItem("ALtoken"),location.reload()},bt=t.data.Viewer.id,ot()})):(ot(),home.classList.add("noauth"))}))})()})(); //# sourceMappingURL=bundle.js.map \ No newline at end of file diff --git a/app/js/bundle.js.LICENSE.txt b/app/js/bundle.js.LICENSE.txt new file mode 100644 index 0000000..35b6b70 --- /dev/null +++ b/app/js/bundle.js.LICENSE.txt @@ -0,0 +1,76 @@ +/*! + * The buffer module from node.js, for the browser. + * + * @author Feross Aboukhadijeh + * @license MIT + */ + +/*! + * The buffer module from node.js, for the browser. + * + * @author Feross Aboukhadijeh + * @license MIT + */ + +/*! + * range-parser + * Copyright(c) 2012-2014 TJ Holowaychuk + * Copyright(c) 2015-2016 Douglas Christopher Wilson + * MIT Licensed + */ + +/*! bittorrent-protocol. MIT License. WebTorrent LLC */ + +/*! blob-to-buffer. MIT License. Feross Aboukhadijeh */ + +/*! cache-chunk-store. MIT License. Feross Aboukhadijeh */ + +/*! create-torrent. MIT License. WebTorrent LLC */ + +/*! https://mths.be/punycode v1.3.2 by @mathias */ + +/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh */ + +/*! immediate-chunk-store. MIT License. Feross Aboukhadijeh */ + +/*! lt_donthave. MIT License. WebTorrent LLC */ + +/*! magnet-uri. MIT License. WebTorrent LLC */ + +/*! mediasource. MIT License. Feross Aboukhadijeh */ + +/*! multistream. MIT License. Feross Aboukhadijeh */ + +/*! parse-torrent. MIT License. WebTorrent LLC */ + +/*! queue-microtask. MIT License. Feross Aboukhadijeh */ + +/*! render-media. MIT License. Feross Aboukhadijeh */ + +/*! run-parallel-limit. MIT License. Feross Aboukhadijeh */ + +/*! run-parallel. MIT License. Feross Aboukhadijeh */ + +/*! safe-buffer. MIT License. Feross Aboukhadijeh */ + +/*! simple-concat. MIT License. Feross Aboukhadijeh */ + +/*! simple-get. MIT License. Feross Aboukhadijeh */ + +/*! simple-peer. MIT License. Feross Aboukhadijeh */ + +/*! simple-websocket. MIT License. Feross Aboukhadijeh */ + +/*! stream-to-blob-url. MIT License. Feross Aboukhadijeh */ + +/*! stream-to-blob. MIT License. Feross Aboukhadijeh */ + +/*! stream-with-known-length-to-buffer. MIT License. Feross Aboukhadijeh */ + +/*! torrent-discovery. MIT License. WebTorrent LLC */ + +/*! torrent-piece. MIT License. WebTorrent LLC */ + +/*! ut_metadata. MIT License. WebTorrent LLC */ + +/*! webtorrent. MIT License. WebTorrent LLC */ diff --git a/app/js/bundle.js.map b/app/js/bundle.js.map index ace01e0..b379a9c 100644 --- a/app/js/bundle.js.map +++ b/app/js/bundle.js.map @@ -1 +1 @@ -{"version":3,"file":"bundle.js","mappings":";;;;;;;;;;;;;;;;;;;AAAqC;AACN;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,+DAAwB;AAChC,2DAA2D,cAAc,IAAI,cAAc;AAC3F;AACA;AACA;AACA,SAAS;AACT,QAAQ,OAAO;AACf;AACA;AACA;AACA,GAAG;AACH;AACA;AACO;AACP;AACA,gBAAgB,kDAAkD;AAClE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,CAAC;AACD;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,QAAQ;AACR;AACA;AACA,CAAC;AACD;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,CAAC;AACD;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,QAAQ;AACR;AACA;AACA,CAAC;AACD;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,CAAC;AACD;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,CAAC;AACD;AACA,MAAM;AACN,qBAAqB,+CAAI;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,CAAC;AACD;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,QAAQ;AACR;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACxRA;AACkC;AACiB;AACX;AACN;AACQ;AACX;AACU;AACzC,8BAA8B,EAAE,WAAW,KAAK,GAAG,EAAE,gBAAgB,EAAE;AACvE;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,QAAQ,wDAAkB;AAC1B,QAAQ;AACR;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA,kBAAkB,mDAAS;AAC3B;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,CAAC;AACD,IAAI,sDAAgB;AACpB,aAAa,sDAAgB;AAC7B;AACA;AACA,oCAAoC;AACpC;AACA;AACA;AACA,MAAM,+DAAwB;AAC9B,wFAAwF,gBAAgB;AACxG,OAAO;AACP;AACA;AACA,IAAI;AACJ,IAAI,+DAAwB;AAC5B,sFAAsF,MAAM;AAC5F,KAAK;AACL;AACA;AACA,2DAA2D,MAAM;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4DAA4D,QAAQ;AACpE;AACA,wBAAwB,sDAAS,GAAG,iDAAiD;AACrF,MAAM,yDAAS;AACf,MAAM;AACN,MAAM,+DAAwB;AAC9B;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;AACO;AACP;AACO;AACP;AACA,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA,wBAAwB,gDAAO;AAC/B;AACA;AACA,IAAI,+DAAwB;AAC5B,4CAA4C,2BAA2B,UAAU,kBAAkB;AACnG;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA,IAAI,2DAAoB;AACxB;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;AACnB;AACA,QAAQ;AACR,mBAAmB;AACnB;AACA,kBAAkB,sDAAS;AAC3B;AACA;AACA;AACA;AACA,oBAAoB,sDAAS;AAC7B;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,gCAAgC,oDAAa;AAC7C,OAAO,oDAAa;AACpB;AACA;AACA;AACA,6BAA6B,sDAAS,GAAG,sGAAsG;AAC/I;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD;AAChD;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,sDAAS,GAAG,4CAA4C;AACvF,8BAA8B,6HAA6H;AAC3J,QAAQ;AACR;AACA;AACA,uBAAuB,iEAAiE,IAAI,iGAAiG;AAC7L,UAAU;AACV;AACA;AACA;AACA,iCAAiC,sDAAS,GAAG,4CAA4C;AACzF;AACA;AACA,QAAQ;AACR,QAAQ,OAAO;AACf,QAAQ,+DAAwB;AAChC,yDAAyD,gCAAgC,IAAI,MAAM;AACnG;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,uBAAuB,oCAAoC,IAAI,oEAAoE;AACnI,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,4BAA4B,IAAI,4DAA4D;AACnH,UAAU;AACV;AACA;AACA,kCAAkC,2DAA2D;AAC7F,YAAY;AACZ;AACA,yBAAyB,oCAAoC,IAAI,oEAAoE;AACrI;AACA;AACA,QAAQ;AACR;AACA;AACA,gCAAgC,2DAA2D;AAC3F,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACO;;;;;;;;;;;;;;;;;;;;;;;;;;;;AC5OP;AACA;AACA;AACA;AACwC;AAC4B;AACjB;AACX;AACN;AACe;AAClB;AACxB;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,sDAAS,GAAG,sEAAsE;AAC1G;AACA;AACA,OAAO;AACP,sBAAsB,+EAA+E;AACrG;AACA,KAAK;AACL;AACA;AACA,+CAA+C,sDAAa,CAAC,kDAAS;AACtE;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,wBAAwB,sDAAS,GAAG,uEAAuE;AAC3G;AACA,sBAAsB,iGAAiG;AACvH;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,wBAAwB,sDAAS,GAAG,2CAA2C;AAC/E;AACA,sBAAsB,sLAAsL;AAC5M;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,sDAAS;AACnC;AACA,wBAAwB,6EAA6E;AACrG;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,uDAAS,GAAG,kEAAkE;AACpF,4DAA4D,OAAO;AACnE;AACA,SAAS;AACT,wBAAwB,yCAAyC;AACjE,OAAO;AACP,KAAK;AACL,kCAAkC;AAClC,wBAAwB,sDAAa,CAAC,kDAAS;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,yDAAe;AAC/B,cAAc,2DAAgB,GAAG,wEAAwE;AACzG;AACA,mCAAmC,gCAAgC;AACnE;AACA,iBAAiB;AACjB;AACA;AACA,kBAAkB,gDAAS,oDAAoD,sDAAS,GAAG,yDAAyD;AACpJ,kBAAkB,wDAAkB,+CAA+C,4DAA4D;AAC/I;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,MAAM,sDAAS,GAAG,kEAAkE;AACpF,wBAAwB,yEAAyE;AACjG,OAAO;AACP,KAAK;AACL;AACA,MAAM,sDAAS,GAAG,+DAA+D;AACjF,wBAAwB,mDAAmD;AAC3E,OAAO;AACP,KAAK;AACL;AACA,MAAM,sDAAS,GAAG,uEAAuE;AACzF,wBAAwB,kDAAkD;AAC1E,OAAO;AACP,KAAK;AACL;AACA,MAAM,sDAAS,GAAG,sEAAsE;AACxF,wBAAwB,iDAAiD;AACzE,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iDAAiD,yBAAyB;AAC1E,gFAAgF,yBAAyB;AACzG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mEAAmE,iBAAiB;AACpF;AACA;AACA;AACA;AACA,+BAA+B,wEAAwE;AACvG,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,gCAAgC,0CAA0C;AAC1E;AACA;AACA,sIAAsI,mDAAS;AAC/I;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sIAAsI,IAAI;AAC1I;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,2DAAgB,GAAG,4GAA4G;AACrJ;AACA,qCAAqC,wDAAkB,mDAAmD,4DAA4D;AACtK;AACA,GAAG;AACH,mDAAmD,gDAAS;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,6DAA6D;AACjE,IAAI,sEAAsE;AAC1E,IAAI,+EAA+E;AACnF,IAAI,wDAAwD;AAC5D,IAAI,sDAAsD;AAC1D,IAAI,sDAAsD;AAC1D,IAAI,sDAAsD;AAC1D,IAAI,qDAAqD;AACzD,IAAI,oFAAoF;AACxF,IAAI,sDAAsD;AAC1D,IAAI,wDAAwD;AAC5D,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,eAAe,aAAa,eAAe;AAC1F,YAAY;AACZ;AACA,YAAY;AACZ;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,2DAAoB;AACtB,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,IAAI,6DAAwB,YAAY,6DAAuB;AAC/F;AACA;AACO;AACP,EAAE,yDAAkB;AACpB,gBAAgB,oDAAU;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC,sDAAU,2CAA2C,yDAAkB;AAC3G;AACA;AACA;AACA,oCAAoC,sDAAU,iDAAiD,yDAAkB;AACjH;AACA,IAAI;AACJ;AACA;AACA;AACA,wKAAwK,kBAAkB;AAC1L,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACO;AACP;AACA,IAAI,sDAAS,GAAG,kBAAkB;AAClC;AACA,0CAA0C,wBAAwB;AAClE;AACA;AACA,kBAAkB,iCAAiC;AACnD,2BAA2B,wBAAwB;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;ACvcA;AACA;AACgD;AACR;AACiB;AACnB;AACE;AACc;AACvB;AAC/B;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACO,mBAAmB,sDAAgB;AAC1C;AACA;AACA,mBAAmB,2DAAiB;AACpC,iBAAiB,2DAAiB;AAClC;AACA,gBAAgB,kEAAwB;AACxC;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,UAAU,4DAAkB;AAC5B,mBAAmB,0DAAgB;AACnC,sBAAsB,0DAAgB;AACtC,uBAAuB,2DAAiB;AACxC,YAAY,0DAAgB;AAC5B,oBAAoB,2DAAiB;AACrC,sBAAsB,0DAAgB;AACtC,uFAAuF,4DAAkB;AACzG,oBAAoB,uDAAgB;AACpC,CAAC;AACD,8BAA8B,MAAM;AACpC,EAAE,+DAAwB;AAC1B,yCAAyC,UAAU;AACnD;AACA;AACA;AACA,GAAG;AACH,CAAC;AACD,wBAAwB,WAAW;AACnC;AACA,QAAQ,yDAAe;AACvB,MAAM,oDAAO;AACb;AACA;AACA,kDAAkD,qBAAqB,kBAAkB,yBAAyB;AAClH;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,CAAC;AACD;AACA;AACA,CAAC;AACD,qBAAqB,WAAW;AAChC;AACA,IAAI,qDAAU;AACd,IAAI;AACJ,IAAI,+DAAwB;AAC5B;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,CAAC;AACD,qBAAqB,WAAW;AAChC;AACA,IAAI,qDAAU;AACd,IAAI;AACJ,IAAI,+DAAwB;AAC5B;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,CAAC;AACD;AACA,EAAE,4DAAgB,GAAG,wBAAwB;AAC7C,mEAAmE,4DAA4D;AAC/H,qBAAqB,0DAAW;AAChC;AACA,GAAG;AACH,CAAC;AACD,kCAAkC,gBAAgB;AAClD;AACA;AACA;AACA,mCAAmC,2DAAgB,GAAG,qBAAqB;AAC3E;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,eAAe,0DAAW;AAC1B;AACA;AACA,CAAC;AACD;AACA,EAAE,+DAAwB;AAC1B,sEAAsE,iBAAiB;AACvF;AACA;AACA;AACA,GAAG;AACH,CAAC;AACD;AACA;AACA,IAAI,+DAAwB;AAC5B,mEAAmE,iBAAiB;AACpF;AACA;AACA;AACA,KAAK;AACL;AACA,CAAC;AACD,sBAAsB;AACtB;AACA;AACA;AACA,gCAAgC;AAChC;AACA,IAAI,sDAAgB,6BAA6B,sDAAgB;AACjE;AACA,eAAe,mDAAQ;;;;;;;;;;;;;;;;;;;;;;;;;AC7IvB;AACA;AACwC;AACU;AAChB;AACH;AACO;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,iDAAW;AACxB;AACA;AACO;AACP;AACA;AACA;AACA,eAAe,mDAAS;AACxB,OAAO;AACP;AACA;AACA,GAAG;AACH,IAAI,+DAAwB;AAC5B;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI,OAAO;AACX,GAAG;AACH;AACA;AACO;AACP;AACA;AACA,uEAAuE,2DAAiB,WAAW,eAAe,QAAQ,eAAe,yBAAyB,QAAQ,OAAO,QAAQ,iBAAiB,QAAQ,OAAO,QAAQ;AACjO,0BAA0B,iDAAW;AACrC,sBAAsB,2DAAiB,CAAC;AACxC,kBAAkB,2DAAiB;AACnC,qEAAqE,QAAQ,uBAAuB,OAAO,GAAG,GAAG,EAAE,QAAQ,IAAI,KAAK;AACpI;AACA;AACA;AACA;AACA,kDAAkD,QAAQ;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sEAAsE,qDAAc,0BAA0B,qDAAc;AAC5H;AACA;AACA;AACA,qCAAqC,qDAAc;AACnD;AACA;AACA;AACA;AACA;AACA,MAAM,2DAAiB;AACvB;AACA,MAAM,4DAAsB;AAC5B,MAAM;AACN,MAAM,wDAAkB,oBAAoB,oCAAoC;AAChF;AACA,IAAI,2DAAoB;AACxB;AACA;AACA;AACA;AACA,MAAM,YAAY;AAClB,MAAM,YAAY;AAClB,MAAM,WAAW;AACjB,MAAM,cAAc;AACpB,MAAM,eAAe;AACrB,MAAM,gBAAgB;AACtB;AACA;AACA;AACA,QAAQ,4DAAsB;AAC9B,QAAQ;AACR,QAAQ,wDAAkB,eAAe,oCAAoC;AAC7E;AACA,MAAM,yDAAkB;AACxB;AACA;AACA,GAAG;AACH;AACA;AACA;AACO;AACP,wEAAwE,2DAAiB;AACzF,WAAW,2DAAiB,6FAA6F,2DAAiB,iBAAiB,2DAAiB,0FAA0F,2DAAiB,iBAAiB,2DAAiB;AACzT,IAAI;AACJ,WAAW,2DAAiB,GAAG,2DAAiB;AAChD;AACA;;;;;;;;;;;;;;;;;;AC3GA;AACkD;AAC3C;AACP;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,gBAAgB,uDAAW;AAC3B,sBAAsB,+CAAG;AACzB;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,qCAAqC,mBAAmB;AACxD;AACA,sDAAsD,CAAM;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,+CAAG;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS,yCAAyC;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yFAAyF,oEAAoE;;;;;;;;;;;;;;;;;;;;;;AC5E9H;AAC/B,4DAAkB;AAClB;AACA;AACA;AACA,4DAAkB;AAClB;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA,CAAC;AACM;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACO;;;;;;;;;;;ACnDP;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,6CAA6C,KAAK;AAClD;AACA;AACA;AACA;;;;;;;;;;;;ACda;;AAEb;;AAEA,cAAc,mBAAO,CAAC,kEAAO;;AAE7B,cAAc,sFAA4B;AAC1C,YAAY,mBAAO,CAAC,kEAAa;AACjC,iBAAiB,mBAAO,CAAC,4EAAkB;AAC3C,gBAAgB,mBAAO,CAAC,0EAAiB;AACzC,gBAAgB,mBAAO,CAAC,0EAAiB;;;;;;;;;;;;ACV5B;;AAEb,iBAAiB,mBAAO,CAAC,qEAAY;AACrC,iBAAiB,mBAAO,CAAC,qEAAY;AACrC,iBAAiB,mBAAO,CAAC,6DAAU;;AAEnC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;ACxDa;;AAEb,iBAAiB,mBAAO,CAAC,6DAAU;AACnC,iBAAiB,wGAAoC;AACrD,eAAe,sFAA8B;;AAE7C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,qBAAqB;;AAErB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,WAAW;AACX;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,qBAAqB;;AAErB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;ACxJa;;AAEb;;AAEA,gBAAgB,kGAA8B;AAC9C,qBAAqB,mGAAiC;AACtD,qBAAqB,mGAAiC;AACtD,YAAY,mBAAO,CAAC,4DAAQ;;;;;;;;;;;;ACPf;;AAEb,iBAAiB,wGAAoC;AACrD,sBAAsB,yGAAuC;AAC7D,sBAAsB,yGAAuC;AAC7D,eAAe,mBAAO,CAAC,wEAAqB;;AAE5C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;;AAEH;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,MAAM;AACN;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB;AACjB;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,OAAO;AACP,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;AC7nBa;;AAEb,iBAAiB,mBAAO,CAAC,6DAAU;;AAEnC;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;;AAEA;AACA;;AAEA,WAAW;AACX;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC1Ha;;AAEb;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA,sBAAsB;;AAEtB,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;;;;;;;;;;;;ACzDJ;;AAEb;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA,gBAAgB,mBAAO,CAAC,+DAAO;;;;;;;;;;;;ACpBlB;;AAEb,iBAAiB,mBAAO,CAAC,6DAAU;;AAEnC,eAAe,mBAAO,CAAC,kEAAO;AAC9B,sBAAsB,yGAAuC;AAC7D,aAAa,mBAAO,CAAC,kEAAc;;AAEnC;AACA,YAAY,mBAAO,CAAC,0EAAkB;;AAEtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,IAAI;AACJ;AACA;AACA;;AAEA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AC9Ua;;AAEb;;AAEA,eAAe,mBAAO,CAAC,8DAAO;AAC9B,eAAe,mBAAO,CAAC,8DAAO;;;;;;;;;;;;ACLjB;;AAEb,iBAAiB,mBAAO,CAAC,6DAAU;AACnC,eAAe,sFAA8B;;AAE7C,mBAAmB,mBAAO,CAAC,8DAAO;;AAElC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,kBAAkB,kBAAkB;AACpC;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;AClDa;;AAEb,iBAAiB,mBAAO,CAAC,6DAAU;AACnC,eAAe,sFAA8B;AAC7C,aAAa,mBAAO,CAAC,kEAAc;;AAEnC;AACA,YAAY,mBAAO,CAAC,0EAAkB;;AAEtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,+BAA+B,YAAY;AAC3C;;AAEA;AACA;AACA;;AAEA,kDAAkD,OAAO;AACzD;;AAEA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,eAAe;AACnC;AACA,IAAI;AACJ;AACA,oBAAoB,eAAe;AACnC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,eAAe;AACjC;AACA,iBAAiB,eAAe;AAChC;AACA;;AAEA;AACA;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;;AAEA;AACA,+BAA+B,QAAQ;AACvC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,YAAY,iBAAiB;AAC7B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;;;;;;;;;;;ACtSa;;AAEb;;AAEA,eAAe,mBAAO,CAAC,8DAAO;AAC9B,eAAe,mBAAO,CAAC,8DAAO;;;;;;;;;;;;ACLjB;;AAEb,iBAAiB,mBAAO,CAAC,6DAAU;;AAEnC,mBAAmB,mBAAO,CAAC,8DAAO;;AAElC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,kBAAkB,cAAc;AAChC;AACA;AACA;AACA;;;;;;;;;;;;ACtBA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,iDAAwB;AACvC;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA,0DAA0D,mBAAmB;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,sBAAsB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,SAAS;AACjC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,4BAA4B;AAC9C;AACA;;AAEA,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;AACA,MAAM;AACN,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;;AAEA,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,gBAAgB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;;AAEA,sBAAsB,OAAO;AAC7B;AACA;;AAEA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,GAAG;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,WAAW;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;;AAEA,mCAAmC;AACnC,uCAAuC;AACvC;;AAEA;AACA,sBAAsB,OAAO;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,8BAA8B,cAAc;AAC5C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,QAAQ;AACxC;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,+CAA+C;AACnE;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,sBAAsB,sCAAsC;AAC5D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,0BAA0B;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,oBAAoB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,QAAQ;AACrC;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAE,MAA6B;;;;;;;;;;;;;;ACr3GhC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACa;;AAEb,wBAAwB,2EAA2E,kCAAkC,wBAAwB,OAAO,kCAAkC,mIAAmI;;AAEzU,kDAAkD,0CAA0C;;AAE5F,eAAe,mBAAO,CAAC,yEAAmB;AAC1C;AACA;AACA;AACA;AACA;AACA;;AAEA,qBAAqB,mBAAO,CAAC,yGAAmC;;AAEhE,gBAAgB,mBAAO,CAAC,0CAAO;AAC/B;;AAEA,qBAAqB,qEAAsB;AAC3C;AACA;;AAEA,mDAAmD,gGAAmC;AACtF,uCAAuC,mBAAO,CAAC,oDAAW;AAC1D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB,mBAAO,CAAC,6FAA6B;;AAExD;AACA;AACA,EAAE;AACF;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB;AACpB;AACA;;AAEA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;AACA,iBAAiB,OAAO,eAAe,OAAO,eAAe,OAAO,WAAW,OAAO;AACtF;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB;;AAEpB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,EAAE;AACF;;;AAGA;AACA,sEAAsE,aAAa;AACnF;AACA;;AAEA;AACA;;AAEA,gBAAgB;;AAEhB;;AAEA;AACA;AACA;AACA,IAAI;;;AAGJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;AACH;;;AAGA;AACA;AACA;AACA,IAAI;;;AAGJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;;;AAGH;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;;;AAGH;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA,0DAA0D;;AAE1D;AACA;AACA,MAAM;;;AAGN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA,sCAAsC;AACtC;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA,IAAI;;;AAGJ;AACA;AACA;;AAEA;AACA;AACA;;AAEA,yBAAyB;AACzB;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,mCAAmC;;AAEnC;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA,6FAA6F,eAAe;AAC5G;AACA;;AAEA;AACA;;AAEA;AACA,6FAA6F,eAAe;AAC5G;AACA;;AAEA;AACA;AACA,GAAG;AACH;;AAEA;AACA,6FAA6F,eAAe;AAC5G;AACA;;AAEA;AACA;;AAEA;AACA,6FAA6F,eAAe;AAC5G;AACA;;AAEA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,GAAG;;AAER;;AAEA;AACA;AACA;AACA;AACA;AACA,oBAAoB;;AAEpB;;AAEA,sBAAsB,iBAAiB;AACvC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,GAAG;;;AAGH;AACA,yEAAyE,eAAe;AACxF;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,qC;;;;;;;;;;;;ACtnBA;AACA;AACa;;AAEb,iCAAiC,gBAAgB,sBAAsB,OAAO,uDAAuD,mCAAmC,0DAA0D,sFAAsF,iEAAiE,MAAM,iCAAiC,4CAA4C,KAAK;;AAEjd,4CAA4C,kBAAkB,kCAAkC,oEAAoE,KAAK,OAAO,oBAAoB;;AAEpM,kDAAkD,0CAA0C;;AAE5F,4CAA4C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD;;AAE/P,8DAA8D,sEAAsE,8DAA8D;;AAElM,kDAAkD,0EAA0E,eAAe;;AAE3I,wCAAwC,uBAAuB,yFAAyF;;AAExJ,2CAA2C,+DAA+D,6EAA6E,yEAAyE,eAAe,uDAAuD,GAAG;;AAEzU,mCAAmC,gEAAgE,sDAAsD,+DAA+D,mCAAmC,6EAA6E,qCAAqC,iDAAiD,8BAA8B,qBAAqB,0EAA0E,qDAAqD,eAAe,yEAAyE,GAAG,2CAA2C;;AAEttB,sCAAsC,wEAAwE,0CAA0C,8CAA8C,MAAM,uEAAuE,IAAI,eAAe,YAAY;;AAElT,2CAA2C,kCAAkC,kCAAkC,OAAO,wDAAwD,gBAAgB,uBAAuB,kDAAkD,kCAAkC,uDAAuD,sBAAsB;;AAEtX,iCAAiC;;AAEjC,iCAAiC,4EAA4E,iBAAiB,aAAa;;AAE3I,8BAA8B,gGAAgG,mDAAmD;;AAEjL,wBAAwB,2EAA2E,kCAAkC,wBAAwB,OAAO,kCAAkC,mIAAmI;;AAEzU,eAAe,mBAAO,CAAC,0CAAO;AAC9B;;AAEA,gBAAgB,mBAAO,CAAC,iEAAW;AACnC,iEAAiE;;;AAGjE;AACA;AACA;AACA;;AAEA;AACA,EAAE;;;AAGF;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;;AAEA;AACA;AACA,IAAI;AACJ;;;AAGA;AACA,uEAAuE;AACvE;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,sBAAsB,OAAO,WAAW,OAAO,gBAAgB,OAAO;;AAEtE;AACA;AACA;AACA,UAAU;;;AAGV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;;;AAGA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,qEAAqE;AACrE,oCAAoC,aAAa,IAAI,aAAa;;AAElE;AACA;AACA,oDAAoD;AACpD;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,cAAc,cAAc;AAC5B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA,QAAQ;;;AAGR,mBAAmB;;AAEnB;AACA,sBAAsB;AACtB,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA,QAAQ;;;AAGR,mBAAmB;;AAEnB;AACA,sBAAsB;AACtB,MAAM;AACN;AACA,uCAAuC;AACvC;AACA;;AAEA,oIAAoI;AACpI;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;;AAEA;AACA;AACA,UAAU;;;AAGV,qBAAqB;AACrB;;AAEA;AACA;AACA,2BAA2B;AAC3B,QAAQ;AACR;AACA;AACA;AACA,oBAAoB;AACpB;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;;AAGN;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN,UAAU,OAAO,WAAW,OAAO;AACnC;AACA;AACA,YAAY,OAAO,WAAW,OAAO,yBAAyB,OAAO;AACrE;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,oDAAoD;;AAEpD;AACA;AACA,UAAU;AACV;;;AAGA;AACA;;AAEA;AACA;AACA;AACA,UAAU;;;AAGV;AACA;AACA,UAAU;AACV;AACA;AACA,QAAQ;AACR;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,YAAY;AACZ;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;;;AAGN,iBAAiB;;AAEjB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C;AAC3C;AACA;AACA,OAAO;AACP;AACA,GAAG;;AAEH;AACA,CAAC;;AAED,gC;;;;;;;;;;;ACpfA;AACA;;AAEA;;AAEA;;AAEA;AACa,CAAC;AACd;AACA;AACA;AACA;;AAEA,wBAAwB,2EAA2E,kCAAkC,wBAAwB,OAAO,kCAAkC,mIAAmI;;AAEzU,kDAAkD,0CAA0C;;AAE5F,kDAAkD,0EAA0E,eAAe;;AAE3I,wCAAwC,uBAAuB,yFAAyF;;AAExJ,8BAA8B,gGAAgG,mDAAmD;;AAEjL,2CAA2C,+DAA+D,6EAA6E,yEAAyE,eAAe,uDAAuD,GAAG;;AAEzU,iCAAiC,4EAA4E,iBAAiB,aAAa;;AAE3I,gBAAgB;;AAEhB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,GAAG;;AAEH;AACA,EAAE;;;AAGF;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;AACA,EAAE;;;AAGF;AACA;AACA,EAAE;;;AAGF;AACA;AACA;AACA;;AAEA;AACA,EAAE;;;AAGF;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA,qCAAqC,mBAAO,CAAC,wDAAW;AACxD,+DAA+D;;AAE/D;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;;;AAGJ;AACA;AACA,CAAC;AACD;AACA;AACA,iCAAiC,mBAAO,CAAC,0CAAO;AAChD;;AAEA;AACA;AACA;;AAEA;AACA,CAAC;AACD;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA,CAAC;AACD;AACA,sEAAsE,aAAa;AACnF;AACA;;AAEA,qCAAqC,mBAAO,CAAC,wDAAW;AACxD;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,CAAC;AACD,oBAAoB,S;;;;;;;;;;;AClMpB;AACA;AACa;;AAEb,kCAAkC;;AAElC,8BAA8B;;AAE9B,yCAAyC,eAAe,eAAe,gBAAgB,oBAAoB,MAAM,0CAA0C,+BAA+B,aAAa,qBAAqB,uCAAuC,cAAc,WAAW,YAAY,UAAU,MAAM,mDAAmD,UAAU,sBAAsB;;AAE3Y,gCAAgC;;AAEhC,wBAAwB,2EAA2E,kCAAkC,wBAAwB,OAAO,kCAAkC,mIAAmI;;AAEzU;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA,uCAAuC,mBAAO,CAAC,oDAAW;AAC1D;AACA;AACA;AACA,gDAAgD,mBAAO,CAAC,8CAAQ;;AAEhE;AACA;AACA;;AAEA;AACA;AACA;;AAEA,qBAAqB,qEAAsB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,gBAAgB;AAClC;AACA;AACA,IAAI;;;AAGJ;AACA;;AAEA;AACA;AACA,EAAE;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,wCAAwC,SAAS;AACjD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,uBAAuB,uBAAuB;AAC9C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,IAAI;;;AAGJ;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;;AAGA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC;;AAEnC;AACA;AACA;AACA,IAAI;;;AAGJ;;AAEA,SAAS,kBAAkB;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,kBAAkB,wBAAwB;AAC1C;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;;;AAGJ;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,sBAAsB;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,EAAE;AACF;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,oBAAoB;AACtC,0BAA0B;AAC1B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;;AAGA;AACA,MAAM;AACN,gCAAgC;;AAEhC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,qBAAqB,qBAAqB;AAC1C,8BAA8B;AAC9B;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,eAAe,WAAW,oBAAoB,WAAW;AACzD;AACA;;AAEA,kBAAkB,sBAAsB;AACxC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,qBAAqB;AACvC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,kCAAkC;AAClC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,uBAAuB;AAC7C;AACA;AACA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,IAAI;AACJ,WAAW,cAAc;AACzB;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA,QAAQ;AACR;AACA;;AAEA,eAAe,kBAAkB;AACjC;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;;;AAGA,cAAc,iBAAiB;AAC/B;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,E;;;;;;;;;;;AC/qBa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,0BAA0B;AAC3C,aAAa,qBAAM;AACnB;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACxBY;;AAEZ,kBAAkB;AAClB,mBAAmB;AACnB,qBAAqB;;AAErB;AACA;AACA;;AAEA;AACA,mCAAmC,SAAS;AAC5C;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,cAAc,SAAS;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,sBAAsB,SAAS;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2CAA2C,UAAU;AACrD;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;ACrJA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,YAAY,QAAQ;AACpB;AACA;AACA;AACA;;AAEA,sBAAsB,SAAS;AAC/B;;AAEA;AACA;AACA;AACA;;AAEA,qCAAqC;AACrC;AACA;;AAEA,qCAAqC;AACrC;AACA;AACA;;AAEA,sBAAsB;AACtB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY;AACZ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,MAAM;AACxB,MAAM,MAAM;AACZ;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;;ACvKA,QAAQ,UAAU,EAAE,mBAAO,CAAC,qDAAW;;AAEvC;AACA;AACA;AACA,YAAY,2CAA2C;AACvD,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA,WAAW,MAAM;AACjB;;AAEA,MAAM,MAAM;AACZ;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,sBAAsB;;AAEtB;AACA,iDAAiD;AACjD,+CAA+C;AAC/C,+CAA+C;AAC/C,8CAA8C;AAC9C,+CAA+C;AAC/C,iDAAiD;AACjD,iDAAiD;AACjD,kDAAkD;AAClD,mDAAmD,MAAM,uDAAuD;AAChH,+CAA+C,MAAM,cAAc;AACnE;AACA;;AAEA,cAAc,MAAM;AACpB,cAAc,MAAM;AACpB,cAAc,MAAM;;AAEpB;AACA,eAAe,MAAM;AACrB;;AAEA;AACA,eAAe,MAAM,MAAM,MAAM;AACjC;;AAEA;AACA;AACA;AACA;AACA;;AAEA,eAAe,MAAM;;AAErB;AACA;AACA,IAAI,OAAO;AACX;AACA;AACA;AACA,IAAI,OAAO;AACX;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,SAAS,QAAQ;AACjB;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,IAAI,MAAM;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,SAAS,OAAO;AAChB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;;ACrIA,QAAQ,sBAAsB,EAAE,mBAAO,CAAC,qDAAW;;AAEnD;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,sBAAsB,MAAM;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC,sBAAsB,MAAM;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA,iBAAiB,MAAM;AACvB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD,KAAK;AAC7D;AACA;;AAEA;;;;;;;;;;;ACpEA;;AAEA,iBAAiB,mBAAO,CAAC,yDAAa;AACtC,iBAAiB,mBAAO,CAAC,yDAAa;;AAEtC;AACA;AACA;AACA,YAAY,2CAA2C;AACvD,YAAY,QAAQ;AACpB;AACA,8CAA8C,mBAAO,CAAC,2EAAsB;;;;;;;;;;;;ACX5E;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM,MAAM;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACtBA;AACA,oBAAoB;AACpB,sBAAsB;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,iCAAiC,OAAO,GAAG,oBAAoB,OAAO,OAAO;AAC7E,KAAK;AACL;;AAEA;AACA,6DAA6D,yBAAyB;;AAEtF;AACA;AACA;AACA;AACA,KAAK;AACL;;;;;;;;;;;ACxBA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;AC5Ca;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC,8BAA8B;AAC9B,iFAAiF,SAAS;AAC1F;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,eAAe;;;;;;;;;;;;AC7Ef;AACA,oBAAoB,mBAAO,CAAC,8EAAwB;AACpD,gBAAgB,mBAAO,CAAC,oDAAS;AACjC,iBAAiB,mFAA2B;AAC5C,eAAe,mBAAO,CAAC,yDAAQ;AAC/B,cAAc,mBAAO,CAAC,kDAAO;AAC7B,oBAAoB,mBAAO,CAAC,0DAAa;AACzC,aAAa,mBAAO,CAAC,0DAAa;AAClC,oBAAoB,mBAAO,CAAC,wDAAa;AACzC,eAAe,mBAAO,CAAC,2EAAiB;AACxC,YAAY,mBAAO,CAAC,sCAAK;;AAEzB;AACA;;AAEA,yBAAyB,MAAM;AAC/B,2BAA2B,MAAM;AACjC,sBAAsB,MAAM;AAC5B,wBAAwB,MAAM;AAC9B,2BAA2B,MAAM;AACjC,6BAA6B,MAAM;;AAEnC;AACA;;AAEA;AACA;AACA,WAAW,MAAM;AACjB,uBAAuB,MAAM;AAC7B,sBAAsB,MAAM;;AAE5B;AACA,2BAA2B,MAAM;AACjC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,wCAAwC,qBAAqB;;AAE7D;;AAEA;AACA;;AAEA,8BAA8B;AAC9B,kCAAkC;;AAElC;AACA;AACA;;AAEA,oCAAoC;;AAEpC,mBAAmB;AACnB;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,yEAAyE;AACzE;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,UAAU;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,UAAU;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB,MAAM,SAAS,MAAM;AACtC;AACA;;AAEA;AACA;AACA;AACA,eAAe,MAAM,SAAS,MAAM;AACpC;;AAEA;AACA;;AAEA,wBAAwB,MAAM,gBAAgB,MAAM;;AAEpD,wBAAwB,MAAM,gBAAgB,MAAM;AACpD,wBAAwB,MAAM,gBAAgB,MAAM;AACpD;;AAEA;AACA;;AAEA,6BAA6B,MAAM;AACnC;AACA;;AAEA;AACA;AACA;AACA;;AAEA,eAAe,MAAM;AACrB;;AAEA;AACA;;AAEA;AACA;AACA,4BAA4B,MAAM;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,eAAe;AAC7B,cAAc,eAAe;AAC7B,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,MAAM;AAC7B,MAAM;AACN;AACA;AACA;AACA;AACA,qBAAqB,MAAM;AAC3B,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA,qBAAqB,MAAM;;AAE3B;AACA;;AAEA;;AAEA,eAAe,MAAM;AACrB;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,iBAAiB;AAC/B;AACA;AACA;AACA,SAAS,MAAM;AACf;AACA;;AAEA;AACA;AACA,cAAc,UAAU;AACxB,cAAc,UAAU;AACxB,cAAc,UAAU;AACxB,cAAc,UAAU;AACxB;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA,oBAAoB,MAAM;AAC1B;AACA;AACA;;AAEA;AACA;AACA,cAAc,eAAe;AAC7B,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,MAAM;AAC1B,kBAAkB,MAAM;;AAExB,4BAA4B,MAAM;AAClC,MAAM;AACN,iDAAiD,IAAI;AACrD;AACA;;AAEA;AACA;AACA;AACA,aAAa,QAAQ;AACrB;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,MAAM;AACrC,+BAA+B,MAAM;AACrC,wBAAwB,MAAM;AAC9B;AACA;AACA;AACA;AACA,wBAAwB,MAAM;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,MAAM;AACrC,+BAA+B,MAAM;AACrC,wBAAwB,MAAM;AAC9B;AACA;AACA;AACA;AACA,wBAAwB,MAAM;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,UAAU;AAC9B;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,mBAAmB,MAAM;;AAEzB;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,4BAA4B,MAAM;AAClC,yBAAyB,MAAM;AAC/B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,QAAQ;AACtB,cAAc,UAAU;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,MAAM;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qBAAqB,MAAM;AAC3B,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc,QAAQ;AACtB,cAAc,UAAU;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,kBAAkB,MAAM;AACxB;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,wBAAwB,MAAM,gBAAgB,MAAM;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA,WAAW;AACX,SAAS;AACT,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,cAAc,IAAI,QAAQ;AAC5C;AACA;;AAEA;AACA,oBAAoB,qBAAqB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,MAAM;AACxB;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kBAAkB,MAAM;;AAExB;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,MAAM;;AAE1B;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,MAAM;;AAE1B;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;;AAEA;AACA,WAAW,MAAM;AACjB;AACA;;AAEA;;;;;;;;;;;;;ACloCA,cAAc,mBAAO,CAAC,kDAAO;AAC7B,qBAAqB,mBAAO,CAAC,+CAAQ;AACrC,aAAa,mBAAO,CAAC,yCAAM;AAC3B,iBAAiB,mBAAO,CAAC,0DAAc;AACvC,aAAa,mBAAO,CAAC,wDAAa;AAClC,uBAAuB,mBAAO,CAAC,gEAAiB;;AAEhD,eAAe,mBAAO,CAAC,qEAAc;AACrC,oBAAoB,mBAAO,CAAC,wCAA2B;AACvD,mBAAmB,mBAAO,CAAC,uCAA0B;AACrD,yBAAyB,mBAAO,CAAC,yGAAgC;;AAEjE;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,eAAe;AAC1B,WAAW,eAAe;AAC1B,WAAW,uBAAuB;AAClC,WAAW,QAAQ;AACnB,WAAW,UAAU;AACrB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA,wBAAwB;AACxB;;AAEA;AACA;AACA;AACA,SAAS,OAAO;;AAEhB;AACA;AACA;AACA,yBAAyB,MAAM;AAC/B;;AAEA;AACA;AACA;AACA,2BAA2B,MAAM;AACjC;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,yDAAyD,YAAY;AACrE;AACA;;AAEA;AACA;AACA,0DAA0D,YAAY;AACtE;AACA;;AAEA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA,UAAU;AACV;AACA;AACA;AACA,oEAAoE,YAAY;AAChF;AACA;AACA;AACA,UAAU;AACV,kEAAkE,YAAY;AAC9E;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;;AAEA,iCAAiC;AACjC;;AAEA;AACA;;AAEA,sDAAsD;;AAEtD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY,uBAAuB;AACnC,YAAY,QAAQ;AACpB,YAAY,UAAU;AACtB;AACA;AACA;;AAEA;AACA;;AAEA,qCAAqC;AACrC;AACA,YAAY,MAAM;AAClB;AACA,GAAG;;AAEH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,GAAG;;AAEH;AACA,oCAAoC,MAAM;AAC1C,MAAM,MAAM;AACZ,kBAAkB,yBAAyB;AAC3C;AACA;;AAEA;;;;;;;;;;;ACjSA,qBAAqB,mBAAO,CAAC,+CAAQ;;AAErC;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;;;;;;;;;;;AC3BA,cAAc,mBAAO,CAAC,kDAAO;AAC7B,aAAa,mBAAO,CAAC,wDAAa;AAClC,oBAAoB,mBAAO,CAAC,0DAAa;AACzC,eAAe,mBAAO,CAAC,kEAAkB;;AAEzC,eAAe,mBAAO,CAAC,kEAAW;AAClC,gBAAgB,mBAAO,CAAC,0EAAW;;AAEnC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,oBAAoB;AACpB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA,mCAAmC;AACnC;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN,sEAAsE,YAAY;AAClF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC;AACvC;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR,wCAAwC,4BAA4B;AACpE;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,oBAAoB,aAAa;AACjC;AACA;AACA;;AAEA;AACA;AACA;AACA,4DAA4D,iBAAiB;AAC7E;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,iEAAiE,YAAY;AAC7E;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;;;;;;;;;;;AC/aA;AACA;AACA;;AAEA,8BAA8B;AAC9B,0BAA0B;;AAE1B,mBAAmB;AACnB;AACA;AACA;AACA,SAAS,MAAM;AACf;;AAEA,mBAAmB;AACnB;AACA;AACA;AACA,SAAS,MAAM;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;;AAEA;AACA;AACA,cAAc,yCAAyC;AACvD,kBAAkB,6CAA6C;AAC/D,gBAAgB;AAChB,KAAK;AACL;;AAEA;AACA;;AAEA,eAAe,mBAAO,CAAC,4BAAe;AACtC;;;;;;;;;;;;AChDA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,kBAAkB,MAAM;AACxB;;AAEA;AACA;AACA;;;;;;;;;;;;ACrBA,QAAQ,YAAY,EAAE,mBAAO,CAAC,2EAAiB;;AAE/C;AACA,8BAA8B;AAC9B;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA,YAAY,4BAA4B;;AAExC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,gBAAgB,MAAM;AACtB;AACA;AACA;;AAEA;AACA;AACA,qBAAqB,MAAM;AAC3B;AACA,gBAAgB,MAAM;AACtB;AACA,MAAM;AACN,gBAAgB,MAAM;AACtB;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,iDAAwB;AACvC;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA,0DAA0D,mBAAmB;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,sBAAsB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,SAAS;AACjC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,+BAA+B,iBAAiB;AAChD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,+BAA+B,iBAAiB;AAChD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,gBAAgB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;;AAEA,sBAAsB,OAAO;AAC7B;AACA;;AAEA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,GAAG;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,WAAW;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;;AAEA,mCAAmC;AACnC,uCAAuC;AACvC;;AAEA;AACA,sBAAsB,OAAO;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,8BAA8B,cAAc;AAC5C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,QAAQ;AACxC;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,+CAA+C;AACnE;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,sBAAsB,sCAAsC;AAC5D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,0BAA0B;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,oBAAoB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,QAAQ;AACrC;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAE,MAA6B;;;;;;;;;;;AC19GhC;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA,iBAAiB,mBAAO,CAAC,qBAAQ;AACjC;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;;;;;;;;;;;AChEA;AACA;AACA;AACA;;AAEA,aAAa,oFAA6B;;AAE1C;AACA;;AAEA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA,kBAAkB,cAAc;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,aAAa;AAC/B;AACA;;AAEA,oBAAoB,YAAY;AAChC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,mBAAmB,aAAa;AAChC;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB;;;;;;;;;;;ACnOlB,UAAU,mBAAO,CAAC,mDAAO;AACzB,aAAa,oFAA6B;AAC1C,gBAAgB,mBAAO,CAAC,wDAAa;AACrC,eAAe,mBAAO,CAAC,6DAAU;AACjC,YAAY,mBAAO,CAAC,uDAAS;AAC7B,UAAU,mBAAO,CAAC,sDAAY;AAC9B,aAAa,mBAAO,CAAC,yDAAU;;AAE/B;AACA;AACA;;AAEA;AACA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;ACpHA,cAAc,mBAAO,CAAC,+DAAa;AACnC,gBAAgB,mBAAO,CAAC,+DAAa;AACrC,YAAY,mBAAO,CAAC,wEAAmB;;AAEvC;AACA;AACA;;AAEA,oBAAoB,GAAG,cAAc;AACrC,sBAAsB,GAAG,gBAAgB;AACzC,sBAAsB,GAAG,gBAAgB;AACzC,wBAAwB,GAAG,kBAAkB;AAC7C,mBAAmB,GAAG,kBAAkB;;;;;;;;;;;ACZxC,iBAAiB,mBAAO,CAAC,iEAAc;AACvC,aAAa,oFAA6B;AAC1C,YAAY,mBAAO,CAAC,6DAAS;AAC7B,mBAAmB,mBAAO,CAAC,qEAAgB;AAC3C,gBAAgB,mBAAO,CAAC,wDAAa;AACrC,UAAU,mBAAO,CAAC,mDAAO;AACzB,WAAW,mBAAO,CAAC,8DAAgB;AACnC,eAAe,mBAAO,CAAC,6DAAU;;AAEjC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,sBAAsB;AACtB,wBAAwB;;;;;;;;;;;AC3HxB,YAAY,mBAAO,CAAC,6DAAS;AAC7B,iBAAiB,mBAAO,CAAC,iEAAc;AACvC,aAAa,oFAA6B;AAC1C,mBAAmB,mBAAO,CAAC,qEAAgB;AAC3C,gBAAgB,mBAAO,CAAC,wDAAa;AACrC,UAAU,mBAAO,CAAC,mDAAO;AACzB,WAAW,mBAAO,CAAC,8DAAgB;AACnC,eAAe,mBAAO,CAAC,6DAAU;;AAEjC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,sBAAsB;AACtB,oBAAoB;;;;;;;;;;;ACjHpB,aAAa,oFAA6B;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,gBAAgB,OAAO;AACvB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;ACxFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACdA,UAAU,mBAAO,CAAC,sDAAY;;AAE9B,eAAe;AACf;;AAEA;AACA;AACA;;AAEA,eAAe;AACf;;AAEA;AACA;;AAEA;AACA;;;;;;;;;;;AChBA,aAAa,oFAA6B;AAC1C,UAAU,mBAAO,CAAC,sDAAY;;AAE9B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe;AACf;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;AChCA,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,eAAe;AACf;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;ACzCA,aAAa,oFAA6B;;AAE1C;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,eAAe;AACf;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;ACxBA,UAAU,mBAAO,CAAC,sDAAY;AAC9B,aAAa,oFAA6B;AAC1C,aAAa,mBAAO,CAAC,0DAAW;;AAEhC;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,cAAc;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;AC7BA,eAAe;AACf;AACA;;AAEA,eAAe;AACf;AACA;;;;;;;;;;;ACNA;AACA,OAAO,mBAAO,CAAC,yDAAO;AACtB,OAAO,mBAAO,CAAC,yDAAO;AACtB,OAAO,mBAAO,CAAC,yDAAO;AACtB,QAAQ,mBAAO,CAAC,2DAAQ;AACxB,QAAQ,mBAAO,CAAC,2DAAQ;AACxB,OAAO,mBAAO,CAAC,yDAAO;AACtB,OAAO,mBAAO,CAAC,yDAAO;AACtB,OAAO,mBAAO,CAAC,yDAAO;AACtB;;AAEA,YAAY,mBAAO,CAAC,kEAAa;;AAEjC;AACA;AACA;;AAEA;;;;;;;;;;;;;;;;;;;;;;;ACjBA,UAAU,mBAAO,CAAC,sDAAY;;AAE9B;AACA;AACA;AACA;;AAEA,eAAe;AACf;AACA,kBAAkB,MAAM;AACxB;;AAEA;AACA;AACA;AACA;;;;;;;;;;;ACfA,UAAU,mBAAO,CAAC,mDAAO;AACzB,aAAa,oFAA6B;AAC1C,gBAAgB,mBAAO,CAAC,wDAAa;AACrC,eAAe,mBAAO,CAAC,6DAAU;;AAEjC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;AC1BA,UAAU,mBAAO,CAAC,8DAAgB;AAClC,UAAU,mBAAO,CAAC,wEAAwB;AAC1C,eAAe,mBAAO,CAAC,0EAAsB;AAC7C,eAAe,mBAAO,CAAC,oEAAsB;AAC7C,WAAW,mBAAO,CAAC,8DAAgB;;AAEnC;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,wCAAwC,+BAA+B;;AAEvE;AACA;;AAEA;AACA;AACA;AACA,wCAAwC,8CAA8C;;AAEtF;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,GAAG,cAAc;AACrC,sBAAsB,GAAG,gBAAgB;AACzC,sBAAsB,GAAG,gBAAgB;AACzC,wBAAwB,GAAG,kBAAkB;AAC7C,mBAAmB,GAAG,kBAAkB;;;;;;;;;;;AClExC,iBAAiB,mBAAO,CAAC,wDAAa;AACtC,UAAU,mBAAO,CAAC,gDAAQ;AAC1B,eAAe,mBAAO,CAAC,6DAAU;AACjC,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACjDA,kBAAkB;AAClB;AACA;AACA;AACA,kBAAkB,GAAG,WAAW;AAChC;AACA;AACA;AACA,uBAAuB,GAAG,YAAY;AACtC;AACA;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA;;;;;;;;;;;;ACvBA,SAAS,mBAAO,CAAC,6CAAO;AACxB,kBAAkB,mBAAO,CAAC,0DAAa;;AAEvC;AACA;AACA;AACA,WAAW;AACX;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0EAA0E,MAAM;AAChF;AACA;;AAEA;;;;;;;;;;;AClCA,+HAAqD;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACArD,aAAa,oFAA6B;AAC1C,iBAAiB,mBAAO,CAAC,0DAAa;AACtC,aAAa,mBAAO,CAAC,2EAAiB;AACtC,eAAe,mBAAO,CAAC,6DAAU;AACjC,WAAW,mBAAO,CAAC,8DAAQ;AAC3B,aAAa,mBAAO,CAAC,kEAAU;;AAE/B,iBAAiB,mBAAO,CAAC,iFAAmB;AAC5C;AACA;AACA;AACA,CAAC;;AAED;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;AC3FA;AACA,aAAa,oFAA6B;AAC1C,iBAAiB,mBAAO,CAAC,0DAAa;AACtC,UAAU,mBAAO,CAAC,8DAAgB;AAClC,SAAS,iFAAsB;AAC/B,SAAS,mBAAO,CAAC,6CAAO;AACxB,gBAAgB,mBAAO,CAAC,sDAAY;AACpC,aAAa,mBAAO,CAAC,yEAAe;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA,qBAAqB;AACrB,sBAAsB;;;;;;;;;;;AC9ItB;AACA,aAAa,oFAA6B;AAC1C,SAAS,mBAAO,CAAC,6CAAO;AACxB,SAAS,iFAAsB;AAC/B,gBAAgB,mBAAO,CAAC,sDAAY;AACpC,aAAa,mBAAO,CAAC,yEAAe;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;;;ACnFa;AACb;;AAEA,aAAa,mBAAO,CAAC,qDAAQ;;AAE7B,cAAc,mBAAO,CAAC,mGAAuB;AAC7C,mBAAmB,mBAAO,CAAC,sGAA0B;AACrD,mBAAmB,mBAAO,CAAC,sGAA0B;AACrD,gBAAgB,mBAAO,CAAC,uGAAyB;;AAEjD;AACA;AACA;;AAEA;AACA,YAAY;AACZ,eAAe;AACf,eAAe;AACf,YAAY;AACZ,cAAc;AACd,kBAAkB;AAClB,kBAAkB;AAClB,aAAa;;AAEb;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,YAAY,MAAM;AAClB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,EAAE,OAAO;AACT;AACA;AACA,GAAG;;AAEH;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,YAAY,Q;;;;;;;;;;;;ACxZC;;AAEb,aAAa,0EAAwB;AACrC,gBAAgB,wFAA2B;AAC3C,cAAc,mBAAO,CAAC,gEAAW;AACjC,WAAW,mBAAO,CAAC,yCAAM;AACzB,aAAa,6EAAoB;AACjC,iBAAiB,8EAA4B;AAC7C;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,mBAAmB;AACpC;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,mBAAmB;AACpC;AACA;AACA;;AAEA,yCAAwC;AACxC;AACA,CAAC,EAAC;;AAEF,eAAe;AACf,eAAe;AACf,YAAY;AACZ,cAAc;AACd,kBAAkB;AAClB,kBAAkB;AAClB,aAAa;;AAEb,qBAAqB;AACrB;AACA;;AAEA,qBAAqB;AACrB;AACA;;AAEA,wBAAwB;AACxB;AACA;;AAEA,wBAAwB;AACxB;AACA;;AAEA,kBAAkB;AAClB;AACA;;AAEA,oBAAoB;AACpB;AACA;;AAEA,mBAAmB;AACnB;AACA;;AAEA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB;AACnB;AACA;;AAEA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB;AACA;;AAEA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB;AACA;;AAEA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB;AACjB;AACA;;AAEA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB;AACnB;AACA;;AAEA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB;AAClB;AACA;;AAEA,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,GAAG;AACH;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ,IAAI,OAAO;AACX;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,OAAO;AACzB,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA,OAAO;AACP;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA,EAAE,OAAO;AACT;;AAEA;AACA,gBAAgB,OAAO;;AAEvB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB,MAAM;;AAEN;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,kCAAkC;AAClC;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,2B;;;;;;;;;;;AChmBa;;;AAGb;AACA;AACA;;AAEA;AACA;AACA;;AAEA,cAAc;AACd;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA,iBAAiB;AACjB,6BAA6B;AAC7B,sBAAsB;AACtB;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA,mCAAmC,OAAO;AAC1C;AACA;;AAEA;AACA;AACA;AACA,mCAAmC,OAAO;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,gBAAgB;AAChB;AACA,IAAI,YAAY;AAChB,IAAI,aAAa;AACjB,IAAI,aAAa;AACjB;AACA,IAAI;AACJ,IAAI,YAAY;AAChB,IAAI,aAAa;AACjB,IAAI,aAAa;AACjB;AACA;AACA;;AAEA;;;;;;;;;;;;ACxGa;;AAEb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;;AAEA;AACA;;;AAGA;;;;;;;;;;;;AClDa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;ACnEa;;AAEb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;;AAEA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;;AAEA,uBAAuB;AACvB;;;AAGA;;;;;;;;;;;;AC1Da;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc,mBAAO,CAAC,6FAAiB;AACvC,cAAc,mBAAO,CAAC,mFAAS;AAC/B,cAAc,mBAAO,CAAC,uFAAW;AACjC,cAAc,mBAAO,CAAC,mFAAS;AAC/B,cAAc,mBAAO,CAAC,yFAAY;;AAElC;AACA;;;AAGA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,iCAAiC;AACjC;;;AAGA;AACA;;AAEA;;;AAGA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,2BAA2B;AAC3B,2BAA2B;AAC3B,2BAA2B;AAC3B,2BAA2B;;AAE3B,oBAAoB;;AAEpB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,qBAAqB,sBAAsB,qBAAqB;;;AAGhE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB;AACpB,mBAAmB;;AAEnB;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C,yBAAyB;AACzB,mCAAmC;AACnC,qCAAqC;AACrC,6CAA6C;AAC7C,6CAA6C;AAC7C;AACA;;AAEA,uBAAuB;;AAEvB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;;AAElC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,QAAQ;;AAER;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;;AAER;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,uDAAuD;AACvD;AACA;AACA;AACA;AACA;AACA,mEAAmE;AACnE;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,IAAI;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB,wBAAwB;;AAExB,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,oDAAoD;AACpD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oEAAoE;;AAEpE;AACA,0DAA0D;AAC1D;;AAEA;;AAEA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,4DAA4D;AAC5D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,2DAA2D;AAC3D;;AAEA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B,2BAA2B;;AAE3B;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA,oDAAoD;AACpD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,6DAA6D;AAC7D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2DAA2D;AAC3D;;AAEA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB,yBAAyB;AACzB,yBAAyB;;AAEzB;;AAEA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,SAAS;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,qEAAqE;AACrE;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,2DAA2D;AAC3D;;AAEA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,0BAA0B;;AAE1B,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;;AAEA;AACA;AACA;AACA,yDAAyD;AACzD;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,+BAA+B;AAC/B,8BAA8B;AAC9B,gCAAgC;AAChC,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,4BAA4B;AAC5B,0BAA0B;;AAE1B,oBAAoB;AACpB,oBAAoB;AACpB,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;;AAEtB,wBAAwB;AACxB,wBAAwB;AACxB,wBAAwB;AACxB,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;;AAE9B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB,sBAAsB;;AAEtB;AACA;;AAEA,uBAAuB;;AAEvB;;AAEA;;AAEA,8CAA8C;AAC9C,8CAA8C;AAC9C,8CAA8C;;AAE9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gCAAgC;AAChC,gCAAgC;AAChC,gCAAgC;;AAEhC;AACA;AACA;;AAEA,gCAAgC;AAChC,iDAAiD;AACjD;;AAEA,mCAAmC;AACnC,mCAAmC;AACnC;AACA;AACA;;AAEA,iDAAiD;AACjD;AACA;AACA;;AAEA,2BAA2B;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,0BAA0B;;AAE1B;AACA;AACA;AACA;AACA;;AAEA,0BAA0B;AAC1B,0BAA0B;AAC1B,0BAA0B;AAC1B,0BAA0B;;;AAG1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oDAAoD;AACpD;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,8BAA8B;AAC9B,+BAA+B;AAC/B;AACA;AACA;;;AAGA;AACA,eAAe;AACf;AACA;AACA;;AAEA;AACA;AACA;;AAEA,wBAAwB;AACxB;AACA;AACA;;AAEA;AACA,wBAAwB;AACxB;AACA;;;AAGA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,uBAAuB;;AAEvB,uCAAuC;;AAEvC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB;AACjB;AACA;;AAEA;AACA;;AAEA,wBAAwB;AACxB,uBAAuB;AACvB;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,QAAQ;AACR;AACA,QAAQ;AACR;AACA,QAAQ;AACR;AACA;AACA;AACA,8BAA8B;AAC9B;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;;AAEA;AACA;AACA;AACA,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,QAAQ;;AAER;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,QAAQ;;AAER;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC;;AAEpC;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA,+BAA+B;;AAE/B,4BAA4B;AAC5B,qBAAqB;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,qDAAqD;AACrD;AACA;;AAEA,gBAAgB;;AAEhB;AACA;AACA,iCAAiC;AACjC,0BAA0B;AAC1B,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iEAAiE;AACjE;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA,mBAAmB;AACnB,oBAAoB;AACpB,oBAAoB;AACpB,wBAAwB;AACxB,wBAAwB;AACxB,eAAe;AACf,kBAAkB;AAClB,4BAA4B;AAC5B,mBAAmB;;AAEnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACj1Da;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB;AACpB,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B;AACA,8BAA8B;AAC9B;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B;;;AAGA,qBAAqB;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,WAAW,IAAI;AACf;AACA;AACA;AACA;AACA,+CAA+C;AAC/C;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,eAAe,IAAI;AACnB;AACA;AACA;AACA;;AAEA,8CAA8C;AAC9C;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C;AAC5C,4CAA4C;AAC5C,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA,2CAA2C;AAC3C;AACA,wCAAwC;AACxC;AACA;AACA;AACA,oBAAoB;AACpB,uCAAuC;AACvC;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA,wCAAwC;AACxC;AACA;AACA;AACA,oBAAoB;AACpB;AACA,sCAAsC;AACtC;AACA;AACA;AACA;AACA,sBAAsB;AACtB,6CAA6C;AAC7C;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA,wCAAwC;AACxC;AACA;AACA;AACA,oBAAoB;AACpB,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C;AAC3C,0CAA0C;AAC1C;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB;AACjB;AACA;AACA,+CAA+C;AAC/C;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,aAAa;AACb;AACA,IAAI;;AAEJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACxVa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,mBAAO,CAAC,6FAAiB;AAC7C,oBAAoB,mBAAO,CAAC,uFAAW;AACvC,oBAAoB,mBAAO,CAAC,mFAAS;AACrC,oBAAoB,mBAAO,CAAC,uFAAW;AACvC,oBAAoB,mBAAO,CAAC,yFAAY;;AAExC;AACA;AACA;;AAEA;AACA;;;AAGA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;;;AAGA,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,2BAA2B;AAC3B,2BAA2B;AAC3B,2BAA2B;AAC3B,2BAA2B;AAC3B,2BAA2B;AAC3B,2BAA2B;AAC3B,2BAA2B;AAC3B,2BAA2B;AAC3B,+BAA+B;AAC/B,+BAA+B;AAC/B,+BAA+B;AAC/B,+BAA+B;AAC/B,+BAA+B;AAC/B,+BAA+B;AAC/B,+BAA+B;AAC/B,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;AACvB,uBAAuB;;AAEvB;;;;AAIA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,6BAA6B;AAC7B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B;AACA,8BAA8B;;AAE9B;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;;AAE9B;AACA,8BAA8B;AAC9B,8BAA8B;;AAE9B;AACA,8BAA8B;AAC9B,8BAA8B;;AAE9B;AACA,8BAA8B;;AAE9B;AACA,gCAAgC;AAChC,gCAAgC;AAChC,8BAA8B;AAC9B,8BAA8B;;AAE9B;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,iCAAiC;;AAEjC,oCAAoC;AACpC,oCAAoC;;AAEpC;AACA;AACA;AACA;AACA,gDAAgD;AAChD,mCAAmC;AACnC,mCAAmC;AACnC,mCAAmC;AACnC,mCAAmC;AACnC,mCAAmC;AACnC;;AAEA;AACA;;AAEA,8BAA8B;AAC9B;AACA;AACA,iBAAiB;AACjB,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,8BAA8B;AAC9B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,eAAe;AACf,uCAAuC;;AAEvC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qBAAqB;;AAErB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,wBAAwB;AACxB,wBAAwB;AACxB,wBAAwB;AACxB,wBAAwB;;AAExB,wEAAwE,SAAS;;AAEjF;AACA;AACA,uBAAuB;;AAEvB,wEAAwE,SAAS;;AAEjF;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC;AACzC,uCAAuC;AACvC;AACA;AACA;AACA;;AAEA;AACA;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B;AACA,8BAA8B;AAC9B,oCAAoC;AACpC,gCAAgC;AAChC,oCAAoC;AACpC,8BAA8B;AAC9B,8BAA8B;AAC9B,mCAAmC;AACnC;;AAEA,SAAS;;AAET;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA,6BAA6B,0BAA0B;;;AAGvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA,oDAAoD;AACpD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;;AAEZ;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD;AACtD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B,6BAA6B;AAC7B,4BAA4B;AAC5B,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA,0DAA0D;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB;AACjB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB,oEAAoE;AACpE;AACA;AACA;;AAEA,uCAAuC;AACvC;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wCAAwC;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC;;AAElC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf,oEAAoE;AACpE;AACA;AACA;;AAEA,mCAAmC;AACnC;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;AAEA,mDAAmD;AACnD;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;AACf,oEAAoE;AACpE;AACA;AACA;;AAEA,qCAAqC;AACrC;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;;AAEA,mDAAmD;AACnD;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA,2CAA2C;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC;AACvC,+BAA+B;AAC/B;AACA;AACA;AACA;AACA,cAAc;AACd,sCAAsC;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA,UAAU;AACV,kCAAkC;AAClC;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD;AACxD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iFAAiF;AACjF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B;AAC9B;AACA,gCAAgC;;AAEhC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,8DAA8D;AAC9D;;AAEA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB;AAChB,yDAAyD;AACzD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB;AACpB,qBAAqB;AACrB,wBAAwB;AACxB,mBAAmB;AACnB,oBAAoB;AACpB,eAAe;AACf,kBAAkB;AAClB,wBAAwB;AACxB,4BAA4B;AAC5B,mBAAmB;;AAEnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACnhDa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA,YAAY,mBAAO,CAAC,6FAAiB;;AAErC;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,0BAA0B;;AAE1B,6BAA6B;AAC7B,6BAA6B;AAC7B,iCAAiC;AACjC,6BAA6B;AAC7B,6BAA6B;AAC7B,6BAA6B;AAC7B,kCAAkC;AAClC,6BAA6B;AAC7B,6BAA6B;AAC7B,yBAAyB;AACzB,yBAAyB;AACzB,yBAAyB;AACzB,yBAAyB;AACzB,wBAAwB;AACxB,uBAAuB;AACvB;AACA,qBAAqB;AACrB,8BAA8B;AAC9B,4CAA4C,kBAAkB;AAC9D,2CAA2C,mBAAmB;AAC9D;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA,gBAAgB,aAAa;AAC7B;AACA;;AAEA;AACA;AACA,sBAAsB,UAAU;AAChC,4BAA4B;AAC5B;AACA;AACA;AACA;AACA,uCAAuC;AACvC,wCAAwC,6BAA6B;AACrE,0CAA0C;AAC1C,2CAA2C;AAC3C;;;AAGA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB;AAClB;AACA,gBAAgB,WAAW;AAC3B,4BAA4B;AAC5B;AACA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA,oCAAoC;AACpC;;AAEA;AACA;AACA,gBAAgB,eAAe;AAC/B;AACA;;AAEA;AACA,gBAAgB,aAAa;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;;AAEA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA,IAAI,0BAA0B;AAC9B;AACA;AACA;AACA;;AAEA;AACA,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,mCAAmC;AACnC,8BAA8B;AAC9B,8BAA8B;AAC9B,8BAA8B;AAC9B,6BAA6B;AAC7B,8BAA8B;;AAE9B;AACA;AACA;AACA;AACA;;AAEA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC;AACjC;AACA;;AAEA;AACA;AACA;AACA,gCAAgC;AAChC;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,8BAA8B;;AAE9B;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,+CAA+C;AAC/C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,6CAA6C;AAC7C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACtVa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC/Ba;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,YAAY,mBAAO,CAAC,6FAAiB;;AAErC;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,+BAA+B;AAC/B;;AAEA;;;AAGA,qBAAqB,sBAAsB,qBAAqB;;AAEhE;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA,yBAAyB;;AAEzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;;AAEA,oCAAoC;AACpC,oCAAoC;AACpC,oCAAoC;AACpC,oCAAoC;AACpC,oCAAoC;;AAEpC;AACA;AACA;;;AAGA;AACA;AACA;;;AAGA;AACA,gCAAgC;AAChC,gCAAgC;AAChC,gCAAgC;AAChC;;;;AAIA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;;AAGA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,IAAI;AACJ;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC;AACtC;AACA;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB,sBAAsB;AACtB,sBAAsB;AACtB,sBAAsB;AACtB,sBAAsB;AACtB,sBAAsB;;AAEtB,iBAAiB,kBAAkB;AACnC;AACA;;AAEA;AACA;AACA;AACA,gDAAgD;;AAEhD,2BAA2B,eAAe;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,YAAY;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;;AAExB;AACA;;AAEA;AACA;AACA;AACA,qCAAqC;AACrC,6BAA6B;AAC7B,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;AACA;AACA;AACA;AACA,0BAA0B,YAAY;AACtC;AACA;AACA;AACA,0BAA0B;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC;AACjC,iCAAiC;AACjC,iCAAiC;AACjC;AACA,2CAA2C;AAC3C,6BAA6B;AAC7B,6BAA6B;AAC7B,6BAA6B;;AAE7B;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,eAAe;AAC9B;AACA,qBAAqB;AACrB;AACA;;AAEA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,gBAAgB;AAChB,gBAAgB;AAChB,gBAAgB;AAChB,gBAAgB;AAChB,gBAAgB;AAChB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,yBAAyB;AAC1C;AACA,gBAAgB,8BAA8B;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,iBAAiB,WAAW;AAC5B;AACA,gBAAgB,8BAA8B;AAC9C;AACA;AACA;AACA;AACA,cAAc;AACd,SAAS,gBAAgB;AACzB;AACA,gBAAgB,oCAAoC;AACpD;AACA;AACA;AACA;;AAEA;AACA,iBAAiB,kBAAkB;AACnC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc,aAAa;AAC3B;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA,cAAc,cAAc,OAAO;AACnC,cAAc,cAAc,OAAO;AACnC,cAAc,cAAc,OAAO;;AAEnC;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB,oBAAoB;AACpB,oBAAoB;AACpB;AACA,uBAAuB;;AAEvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB,2BAA2B;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD;;AAEhD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B,4BAA4B;AAC5B;AACA,sBAAsB;AACtB,sBAAsB;AACtB,sBAAsB;AACtB,sBAAsB;AACtB,sBAAsB;;AAEtB;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC;AACjC;AACA,QAAQ;AACR;AACA;AACA,kDAAkD;AAClD;AACA;AACA;AACA,yCAAyC;AACzC;AACA,gBAAgB;AAChB;AACA;;AAEA,yCAAyC;AACzC;AACA;AACA;AACA,uCAAuC;AACvC;AACA,QAAQ;;AAER;AACA;AACA;;AAEA,MAAM;AACN;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,qBAAqB;AACrB,qBAAqB;;AAErB;AACA;AACA;AACA;AACA;AACA;;AAEA,cAAc,WAAW;AACzB;AACA;AACA;;AAEA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,wCAAwC,QAAQ,OAAO;;AAEvD;AACA;AACA;AACA,6BAA6B;AAC7B;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;;AAEA,+BAA+B;;AAE/B,8BAA8B;AAC9B;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,IAAI;;AAEJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB,uBAAuB;AACvB;AACA,6BAA6B;AAC7B,6BAA6B;AAC7B,6BAA6B;;AAE7B,yCAAyC;;AAEzC,6BAA6B;AAC7B,6BAA6B;AAC7B,6BAA6B;;AAE7B;AACA;AACA;AACA;AACA,iDAAiD;;AAEjD,cAAc,eAAe;AAC7B;AACA;;AAEA;AACA;;AAEA,MAAM;AACN;;AAEA,MAAM;;AAEN,gCAAgC;AAChC;;AAEA,MAAM;AACN;;AAEA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,MAAM;AACN;AACA;;AAEA,MAAM;AACN;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB,0BAA0B;AAC1B;AACA,6BAA6B;AAC7B,6BAA6B;AAC7B,6BAA6B;;AAE7B,yCAAyC;;AAEzC,6BAA6B;AAC7B,6BAA6B;AAC7B,6BAA6B;;AAE7B,gCAAgC;AAChC;AACA;AACA;AACA;;AAEA,cAAc,eAAe;AAC7B;AACA;;AAEA;AACA;;AAEA,MAAM;AACN,WAAW,mCAAmC;;AAE9C,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,MAAM;AACN;AACA;;AAEA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,MAAM;AACN;AACA;;AAEA,MAAM;AACN;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,oBAAoB;;AAEpB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mCAAmC,kBAAkB;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC;AACnC;AACA,+BAA+B;;AAE/B;AACA;AACA;AACA;AACA,iCAAiC;AACjC;AACA,iCAAiC;AACjC,iBAAiB,gBAAgB;AACjC;AACA;AACA;AACA;;AAEA,yCAAyC;AACzC;;AAEA,yCAAyC;AACzC;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,IAAI,MAAM,GAAG,MAAM,GAAG;AAChD;AACA;AACA;AACA,SAAS,IAAI,KAAK,GAAG,MAAM,GAAG,MAAM,GAAG,MAAM,IAAI,MAAM,IAAI;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc,SAAS;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,eAAe,cAAc;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB,oBAAoB;AACpB,oBAAoB;AACpB;AACA,4DAA4D;AAC5D,wCAAwC;AACxC;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB;AACpB,oBAAoB;AACpB,oBAAoB;AACpB;AACA,8BAA8B;AAC9B,8BAA8B;;AAE9B;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,mCAAmC;;AAEnC,IAAI;AACJ;AACA,6CAA6C;AAC7C;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,IAAI;;AAEJ;AACA;;AAEA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB,sBAAsB;AACtB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,wBAAwB;AACxB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB,wBAAwB;AACxB,uBAAuB;AACvB,iBAAiB;AACjB,iBAAiB;;;;;;;;;;;;ACrsCJ;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8DAA8D;AAC9D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC9CA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,MAAM,MAAM;AACZ,WAAW,MAAM;AACjB,IAAI;AACJ,eAAe,MAAM;AACrB;AACA;;AAEA;;;;;;;;;;;;AChBA,iBAAiB,mBAAO,CAAC,wDAAa;AACtC,kBAAkB,mBAAO,CAAC,wEAAqB;;AAE/C;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,MAAM,MAAM;AACZ,WAAW,MAAM;AACjB;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AC/BA;AACA;AACA;AACA,SAAS,MAAM;AACf;AACA;;AAEA,cAAc,MAAM,SAAS,MAAM,gBAAgB,MAAM;;AAEzD;;AAEA;AACA,IAAI;AACJ;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,yCAAyC,MAAM;AAC/C;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,cAAc,MAAM;AACpB;;AAEA,MAAM,MAAM;AACZ;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;AChHA;AACA;AACA,mBAAmB,MAAM;;AAEzB,kBAAkB,YAAY;AAC9B;AACA;;AAEA;AACA;;;;;;;;;;;;;ACTA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEY;;AAEZ,eAAe,mBAAO,CAAC,oDAAW;AAClC,gBAAgB,mBAAO,CAAC,gDAAS;AACjC;AACA;AACA;AACA;;AAEA,cAAc;AACd,kBAAkB;AAClB,yBAAyB;;AAEzB;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,0CAA0C,OAAO;AACjD,WAAW,OAAO;AAClB,EAAE,OAAO;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,mBAAmB;AACvC;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,YAAY;AAC9B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA,wCAAwC,SAAS;AACjD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;;AAEA;AACA;AACA,cAAc,iBAAiB;AAC/B;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,iDAAiD,EAAE;AACnD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C;AAC1C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA,yBAAyB,eAAe;AACxC;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,yBAAyB,QAAQ;AACjC;AACA,sBAAsB,eAAe;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,cAAc,YAAY;AAC1B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,sBAAsB,SAAS;AAC/B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,sBAAsB,SAAS;AAC/B;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,sBAAsB,SAAS;AAC/B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,sBAAsB;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB;AACnB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA,qBAAqB,WAAW,GAAG,IAAI;AACvC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA,gBAAgB,WAAW,GAAG,IAAI,KAAK,aAAa;AACpD;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,MAAM;AACtB;;AAEA;AACA,GAAG;AACH;AACA;AACA,mBAAmB,KAAK,mDAAmD,cAAc;AACzF,GAAG;AACH;AACA;AACA,+BAA+B,IAAI;AACnC;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,MAAM,aAAa,SAAS;AACtD;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA,SAAS,gBAAgB;AACzB,cAAc,oBAAoB,EAAE,IAAI;AACxC;AACA,YAAY,gBAAgB,EAAE,IAAI;AAClC;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,GAAG,SAAS,GAAG,KAAK,qBAAqB,EAAE,EAAE;AACpE,QAAQ;AACR,yBAAyB,GAAG,KAAK,yBAAyB,EAAE,EAAE;AAC9D,mBAAmB,yBAAyB,EAAE,EAAE;AAChD;AACA,MAAM;AACN,oBAAoB,IAAI,EAAE,GAAG,SAAS,IAAI,EAAE,EAAE;AAC9C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,0CAA0C,cAAc,SAAS,OAAO;AACxE;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,YAAY;AAC9B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,gBAAgB;AAClC;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,cAAc,YAAY;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB,QAAQ;AAC1B;AACA,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;ACzjEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;AC/DA;AACA,YAAY,mBAAO,CAAC,wCAAK;AACzB,uBAAuB,mBAAO,CAAC,gEAAiB;;AAEhD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,gCAAgC;AAChC;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iCAAiC;AACjC;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA,qBAAqB,WAAW;AAChC;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA,sBAAsB;AACtB;AACA;AACA;;AAEA;AACA;AACA;;AAEA,wBAAwB;AACxB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACrGa;;AAEb,mBAAmB,mBAAO,CAAC,4DAAe;;AAE1C,eAAe,mBAAO,CAAC,6CAAI;;AAE3B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACda;;AAEb,WAAW,mBAAO,CAAC,4DAAe;AAClC,mBAAmB,mBAAO,CAAC,4DAAe;;AAE1C;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS,UAAU;AACvC,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,4CAA4C,kBAAkB;AAC9D,EAAE;AACF,CAAC,oBAAoB;AACrB;;;;;;;;;;;AC9CA,oBAAoB,mBAAO,CAAC,4DAAe;AAC3C,eAAe,mBAAO,CAAC,2EAAiB;;AAExC;AACA,4CAA4C;AAC5C;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,uDAAuD,sBAAsB;AAC7E;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA,4BAA4B,mBAAmB;AAC/C;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;AClEA,aAAa,oFAA6B;AAC1C,gBAAgB,wFAA2B;AAC3C,oBAAoB,8GAAuC;AAC3D,eAAe,mBAAO,CAAC,6DAAU;;AAEjC;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;AClGA;AACA,WAAW,mBAAO,CAAC,yCAAM;AACzB,aAAa,mBAAO,CAAC,qDAAQ;AAC7B,iBAAiB;;AAEjB;AACA;AACA;;AAEA,WAAW,qBAAM,oBAAoB,qBAAM;AAC3C,cAAc,qBAAM;AACpB,EAAE;AACF;AACA,EAAE;AACF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB,sBAAsB;AACtC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACtFA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA,eAAe;AACf,KAAK;AACL;AACA;AACA;;;;;;;;;;;;ACXA,eAAe,mBAAO,CAAC,yDAAU;AACjC,SAAS,mBAAO,CAAC,sEAAO;;AAExB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO,MAAM;AACb,gBAAgB,MAAM;AACtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,OAAO,MAAM;AACb,cAAc,MAAM;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO,MAAM;AACb,eAAe,MAAM;AACrB;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,MAAM;AACtB;AACA,oBAAoB,MAAM;AAC1B;AACA,UAAU,MAAM;AAChB;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;;;;;;;;;;;AC3HA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,iDAAwB;AACvC;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA,0DAA0D,mBAAmB;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,sBAAsB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,SAAS;AACjC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,4BAA4B;AAC9C;AACA;;AAEA,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;AACA,MAAM;AACN,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;;AAEA,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,gBAAgB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;;AAEA,sBAAsB,OAAO;AAC7B;AACA;;AAEA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,GAAG;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,WAAW;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;;AAEA,mCAAmC;AACnC,uCAAuC;AACvC;;AAEA;AACA,sBAAsB,OAAO;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,8BAA8B,cAAc;AAC5C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,QAAQ;AACxC;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,+CAA+C;AACnE;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,sBAAsB,sCAAsC;AAC5D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,0BAA0B;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,oBAAoB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,QAAQ;AACrC;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAE,MAA6B;;;;;;;;;;;;ACr3GpB;AACZ,eAAe,mBAAO,CAAC,6DAAU;AACjC,UAAU,mBAAO,CAAC,8CAAQ;AAC1B,gBAAgB,mBAAO,CAAC,oDAAW;AACnC,UAAU,mBAAO,CAAC,8CAAQ;AAC1B,WAAW,mBAAO,CAAC,wDAAa;;AAEhC;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;AC7BA,UAAU,mBAAO,CAAC,8CAAQ;;AAE1B;AACA;AACA;;;;;;;;;;;;ACJY;AACZ,eAAe,mBAAO,CAAC,6DAAU;AACjC,aAAa,mBAAO,CAAC,sDAAU;AAC/B,WAAW,mBAAO,CAAC,wDAAa;AAChC,aAAa,oFAA6B;AAC1C,UAAU,mBAAO,CAAC,0DAAiB;AACnC,gBAAgB,mBAAO,CAAC,oDAAW;;AAEnC,UAAU,mBAAO,CAAC,8CAAQ;;AAE1B;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA,kBAAkB,eAAe;AACjC;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC7DY;AACZ,eAAe,mBAAO,CAAC,6DAAU;AACjC,aAAa,oFAA6B;;AAE1C,WAAW,mBAAO,CAAC,wDAAa;;AAEhC;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA,kBAAkB,eAAe;AACjC;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC7CA;AACA,gBAAgB,mBAAO,CAAC,oDAAS;AACjC,oBAAoB,mBAAO,CAAC,4DAAe;AAC3C,wBAAwB,mBAAO,CAAC,0DAAc;AAC9C,iBAAiB,mBAAO,CAAC,qDAAM;AAC/B,uBAAuB,mBAAO,CAAC,0DAAiB;AAChD,eAAe,mBAAO,CAAC,sBAAS;AAChC,aAAa,mBAAO,CAAC,0CAAM;AAC3B,oBAAoB,mBAAO,CAAC,wDAAa;AACzC,aAAa,mBAAO,CAAC,yCAAM;AAC3B,iBAAiB,mBAAO,CAAC,0DAAc;AACvC,uBAAuB,mBAAO,CAAC,gEAAiB;AAChD,aAAa,mBAAO,CAAC,0DAAa;AAClC,eAAe,mBAAO,CAAC,2EAAiB;;AAExC,iBAAiB,mBAAO,CAAC,0BAAa;;AAEtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,sEAAsE;AAClF,YAAY,QAAQ;AACpB,YAAY,SAAS;AACrB,YAAY,OAAO;AACnB,YAAY,SAAS;AACrB,YAAY,SAAS;AACrB,YAAY,iBAAiB;AAC7B,YAAY,SAAS;AACrB,YAAY,yBAAyB;AACrC,YAAY,iBAAiB;AAC7B,YAAY,SAAS;AACrB,YAAY,UAAU;AACtB,YAAY,UAAU;AACtB,YAAY,QAAQ;AACpB;AACA;AACA;AACA,gCAAgC;;AAEhC;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA,gCAAgC;AAChC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,6DAA6D,KAAK;AAClE,GAAG;;AAEH;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B,MAAM;AACnC;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA,gCAAgC;AAChC;AACA,MAAM,wCAAwC;AAC9C;AACA,MAAM,0CAA0C;AAChD;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,wBAAwB,MAAM;AAC9B;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA,mCAAmC,WAAW;AAC9C;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ,SAAS,MAAM;AACvB;AACA;AACA,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,qDAAqD,oBAAoB;;AAEzE;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;;AAEP;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY;AACZ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,GAAG;AACf,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,GAAG;AACf,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,GAAG;AACf,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,WAAW;AACvB,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yBAAyB;AACzB,2BAA2B;AAC3B,yBAAyB;;;;;;;;;;;;ACtcb;;AAEZ,mBAAmB,GAAG,WAAW,GAAG,yBAAyB,GAAG,8FAAqC;AACrG,kBAAkB,GAAG,8FAAqC;AAC1D,kBAAkB,GAAG,8FAAqC;;AAE1D,YAAY,mBAAO,CAAC,sEAAuB;AAC3C;AACA;AACA,iBAAiB;AACjB;AACA;;AAEA,QAAQ,mBAAO,CAAC,gDAAQ;AACxB,cAAc;AACd,kBAAkB;;AAElB,UAAU,mBAAO,CAAC,sEAAmB;;AAErC,cAAc;AACd,oBAAoB;AACpB,gBAAgB;AAChB,sBAAsB;AACtB,gBAAgB;AAChB,sBAAsB;AACtB,kBAAkB;AAClB,wBAAwB;AACxB,kBAAkB;AAClB,mBAAmB;;AAEnB,SAAS,mBAAO,CAAC,gEAAgB;;AAEjC,0BAA0B;AAC1B,gCAAgC;AAChC,wBAAwB;AACxB,2BAA2B;AAC3B,qBAAqB;;AAErB,WAAW,mBAAO,CAAC,wEAAiB;;AAEpC,kBAAkB;AAClB,YAAY;AACZ,oBAAoB;AACpB,cAAc;;AAEd,oGAA2C;;AAE3C,oBAAoB,mBAAO,CAAC,gEAAgB;;AAE5C,qBAAqB;AACrB,sBAAsB;AACtB,qBAAqB;AACrB,sBAAsB;;AAEtB;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ,SAAS,mBAAO,CAAC,wDAAY;;AAE7B,kBAAkB;AAClB,sBAAsB;;AAEtB,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AChGA;;AAEA;AACA;AACA;;AAEA,kBAAkB;AAClB,YAAY;AACZ,YAAY;AACZ,iBAAiB;AACjB,eAAe;AACf,eAAe;AACf;;AAEA;AACA;AACA;AACA,GAAG,OAAO;AACV;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;;AAEF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,GAAG,OAAO,UAAU,OAAO,iBAAiB;;AAEvD;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY,QAAQ;AACpB;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA,kBAAkB,OAAO,6BAA6B,OAAO;AAC7D,MAAM,OAAO;AACb;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA,iBAAiB,mBAAO,CAAC,oDAAU;;AAEnC,OAAO,YAAY;;AAEnB;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;;;;;;;;;;;;AC3QA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,mBAAO,CAAC,sCAAI;AACpC;;AAEA;AACA;AACA,EAAE;;AAEF;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,YAAY,eAAe;AAC3B;AACA;AACA;AACA;;AAEA,kBAAkB,sBAAsB;AACxC;AACA,cAAc;AACd;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,uCAAuC;;AAEvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,cAAc,SAAS;AACvB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY,QAAQ;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,8CAA8C,SAAS;AACvD;AACA;AACA;AACA;;AAEA,8CAA8C,SAAS;AACvD;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,YAAY,QAAQ;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,OAAO;AAClB,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,EAAE,OAAO;AACT;;AAEA;;AAEA;AACA;;AAEA;;;;;;;;;;;;ACjRa;;AAEb,WAAW,mBAAO,CAAC,wDAAa;AAChC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,iCAAiC,+BAA+B;AAChE;AACA,uBAAuB;AACvB;AACA;AACA;AACA,GAAG,YAAY;AACf;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;;AAEA;;AAEA;;;;;;;;;;;;ACzDa;;AAEb,gGAAsC;AACtC,mGAAwC;AACxC,0FAAkC;AAClC,0FAAkC;AAClC,0FAAkC;;;;;;;;;;;;ACNrB;;AAEb,aAAa,mBAAO,CAAC,wEAAqB;AAC1C,eAAe,mBAAO,CAAC,6DAAU;;AAEjC;;AAEA;AACA;;AAEA;AACA,kBAAkB,oBAAoB;AACtC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,mBAAmB;;AAEnB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;;AAEA;;AAEA,oBAAoB,oBAAoB;AACxC;AACA,IAAI;AACJ;;AAEA,oBAAoB,oBAAoB;AACxC;;AAEA,oBAAoB,oBAAoB;AACxC;AACA;AACA;;;;;;;;;;;;AChEa;;AAEb,aAAa,mBAAO,CAAC,wEAAqB;;AAE1C;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,SAAS,gBAAgB;AACzB;AACA;AACA;;AAEA;AACA,SAAS,wBAAwB;AACjC;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,SAAS,WAAW;AACpB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AC5Ia;;AAEb,aAAa,mBAAO,CAAC,wEAAqB;AAC1C,eAAe,mBAAO,CAAC,6DAAU;;AAEjC,YAAY,mBAAO,CAAC,uDAAS;AAC7B,aAAa,mBAAO,CAAC,yDAAU;;AAE/B;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,uBAAuB;AACzC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,mBAAmB;AACvC;;AAEA;AACA;;AAEA;AACA;AACA,oCAAoC,mBAAmB;AACvD;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kBAAkB,uBAAuB;AACzC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,sCAAsC,QAAQ;AAC9C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;AC7Ia;;AAEb,aAAa,mBAAO,CAAC,wEAAqB;AAC1C,eAAe,mBAAO,CAAC,6DAAU;;AAEjC,aAAa,mBAAO,CAAC,yDAAU;AAC/B,UAAU,mBAAO,CAAC,mDAAO;;AAEzB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,0BAA0B;AAC7C,mBAAmB,0BAA0B;AAC7C,mBAAmB,0BAA0B;AAC7C;AACA,IAAI;AACJ;AACA,mBAAmB,0BAA0B;AAC7C,mBAAmB,0BAA0B;AAC7C,mBAAmB,0BAA0B;AAC7C;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;ACrDa;;AAEb,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;;AAEA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;;AAEA,UAAU;AACV;AACA;;AAEA,kBAAkB,QAAQ;AAC1B,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,WAAW;AACX;AACA;;AAEA,kBAAkB,OAAO;AACzB,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,OAAO;AACzB,qBAAqB,QAAQ;AAC7B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,WAAW;AACX;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,QAAQ;AAC1B,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,QAAQ;AAC1B,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;;AAEA;AACA;AACA;;AAEA,cAAc;AACd;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,WAAW;AACX;AACA;;AAEA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA,oBAAoB,qBAAqB;AACzC;AACA;AACA;;AAEA;AACA;AACA;;AAEA,cAAc;AACd;AACA;;AAEA;AACA,mBAAmB,SAAS;AAC5B;AACA;AACA;AACA,mBAAmB,QAAQ;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB;AAClB;AACA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,eAAe;AACf;AACA,kBAAkB,yBAAyB;AAC3C;AACA;AACA;AACA;AACA;;AAEA,gBAAgB;AAChB;AACA;AACA;;AAEA;AACA,kBAAkB,UAAU;AAC5B;AACA;AACA;;;;;;;;;;;;AC/PA,oBAAoB,mBAAO,CAAC,+EAAqB;AACjD,aAAa,mBAAO,CAAC,wEAAmB;;AAExC,SAAS,mBAAO,CAAC,yDAAU;;AAE3B;AACA,kBAAkB,MAAM;AACxB,gBAAgB,MAAM;;AAEtB;AACA;;AAEA;AACA;AACA;;AAEA;AACA,MAAM,MAAM;AACZ;AACA;;AAEA;AACA;AACA,+BAA+B,MAAM;;AAErC,OAAO,MAAM;AACb,oBAAoB,MAAM;AAC1B;;AAEA;AACA;AACA;;AAEA,OAAO,MAAM;AACb,gBAAgB,MAAM;AACtB;;AAEA;AACA;;AAEA,0BAA0B,GAAG,gCAAgC,GAAG,wBAAwB;AACxF,2BAA2B,GAAG,qBAAqB;;;;;;;;;;;;ACzCnD,SAAS,mBAAO,CAAC,yEAAO;AACxB,kBAAkB,mBAAO,CAAC,2DAAc;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,mBAAO,CAAC,2EAAiB;AACtC,kBAAkB,mBAAO,CAAC,0DAAa;AACvC;;AAEA;AACA;AACA,OAAO,MAAM;AACb,cAAc,MAAM;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO,MAAM;AACb,eAAe,MAAM;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,MAAM;AACtB;AACA;AACA,oBAAoB,MAAM;AAC1B;AACA,UAAU,MAAM;AAChB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,OAAO,MAAM;AACb,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;;AAEA;AACA,gBAAgB,MAAM;AACtB;AACA;AACA,IAAI;AACJ;AACA;AACA;;;;;;;;;;;ACnKA,kBAAkB,mBAAO,CAAC,0DAAa;AACvC;AACA;AACA;AACA,SAAS,mBAAO,CAAC,yEAAO;AACxB;AACA,kBAAkB,mBAAO,CAAC,2DAAc;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,yBAAyB,WAAW;AACpC;AACA,oBAAoB,yBAAyB;AAC7C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,mBAAmB;AACrC;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;;;;;;;;;;;;ACxGA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,iDAAwB;AACvC;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA,0DAA0D,mBAAmB;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,sBAAsB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,SAAS;AACjC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,4BAA4B;AAC9C;AACA;;AAEA,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;AACA,MAAM;AACN,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;;AAEA,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,gBAAgB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;;AAEA,sBAAsB,OAAO;AAC7B;AACA;;AAEA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,GAAG;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,WAAW;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;;AAEA,mCAAmC;AACnC,uCAAuC;AACvC;;AAEA;AACA,sBAAsB,OAAO;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,8BAA8B,cAAc;AAC5C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,QAAQ;AACxC;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,+CAA+C;AACnE;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,sBAAsB,sCAAsC;AAC5D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,0BAA0B;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,oBAAoB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,QAAQ;AACrC;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAE,MAA6B;;;;;;;;;;;;;ACr3GnB;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,iBAAiB,mBAAO,CAAC,yDAAQ;AACjC,gBAAgB,mBAAO,CAAC,wDAAS;AACjC,0BAA0B,mBAAO,CAAC,sGAAgC;AAClE,0BAA0B,mBAAO,CAAC,sGAAgC;AAClE,yBAAyB,mBAAO,CAAC,wFAAyB;AAC1D;AACA;AACA;AACA;AACA;AACA,gCAAgC;AAChC;AACA,4BAA4B;AAC5B,8BAA8B,aAAa,0BAA0B;AACrE;AACA;AACA,uBAAuB,MAAM;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,MAAM,uBAAuB,MAAM;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;;;;;;;;;;;;;AC/FZ;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,iBAAiB,mBAAO,CAAC,yDAAQ;AACjC,0BAA0B,mBAAO,CAAC,sGAAgC;AAClE,oBAAoB,mBAAO,CAAC,0FAA0B;AACtD;AACA,4BAA4B;AAC5B,8BAA8B,aAAa,0BAA0B;AACrE,0BAA0B,MAAM;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,mDAAmD,sBAAsB;AACzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,MAAM;AAChC,6BAA6B;AAC7B;AACA;AACA;AACA;AACA,oBAAoB,MAAM;AAC1B,8BAA8B,MAAM;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,8BAA8B,yBAAyB,sCAAsC;AAC7I;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;;;;;;;;;;;;AC5FZ;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,cAAc,mBAAO,CAAC,wDAAS;AAC/B,aAAa;AACb,0BAA0B,mBAAO,CAAC,gFAAqB;AACvD,yBAAyB;AACzB,0BAA0B,mBAAO,CAAC,gFAAqB;AACvD,yBAAyB;AACzB,cAAc,mBAAO,CAAC,gFAAqB;AAC3C,aAAa;AACb,oBAAoB,mBAAO,CAAC,8FAA4B;AACxD,mBAAmB;AACnB,oBAAoB,mBAAO,CAAC,4FAA2B;AACvD,mBAAmB;AACnB,wBAAwB,mBAAO,CAAC,sGAAgC;AAChE,uBAAuB;AACvB,sBAAsB,mBAAO,CAAC,gGAA6B;AAC3D,qBAAqB;AACrB,gBAAgB,mBAAO,CAAC,0EAAkB;AAC1C,eAAe;AACf,uBAAuB,mBAAO,CAAC,wFAAyB;AACxD,sBAAsB;AACtB,kBAAkB,mBAAO,CAAC,0FAA0B;AACpD,iBAAiB;AACjB,wBAAwB,mBAAO,CAAC,sGAAgC;AAChE,uBAAuB;AACvB,oBAAoB,mBAAO,CAAC,4FAA2B;AACvD,mBAAmB;;;;;;;;;;;;;AC3BN;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,oBAAoB,mBAAO,CAAC,mFAAmB;AAC/C,gBAAgB,mBAAO,CAAC,yDAAU;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,OAAO;AAChC;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA,uBAAuB,MAAM;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;;;;;;;;;;;;ACxCF;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,oBAAoB,mBAAO,CAAC,mFAAmB;AAC/C,wBAAwB,mBAAO,CAAC,yFAAsB;AACtD,sBAAsB,mBAAO,CAAC,qFAAoB;AAClD,gBAAgB,mBAAO,CAAC,yEAAc;AACtC,sBAAsB,mBAAO,CAAC,qFAAoB;AAClD,0BAA0B,mBAAO,CAAC,+FAAyB;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gFAAgF,0BAA0B,wBAAwB,KAAK;AACvI;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;;;;;;;;;;;;AC3RT;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,wCAAwC,mBAAmB,KAAK;;;;;;;;;;;;ACRpD;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,gDAAgD,uBAAuB,KAAK;;;;;;;;;;;;ACZhE;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,oCAAoC,iBAAiB,KAAK;;;;;;;;;;;;ACvO9C;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D;AACA;AACA;AACA;AACA;AACA,CAAC,gDAAgD,uBAAuB,KAAK;;;;;;;;;;;;;ACPhE;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,sBAAsB,mBAAO,CAAC,gFAAe;AAC7C,sBAAsB,mBAAO,CAAC,wFAAsB;AACpD,gBAAgB,mBAAO,CAAC,4DAAa;AACrC,oBAAoB,mBAAO,CAAC,oFAAoB;AAChD,0BAA0B,mBAAO,CAAC,gGAA0B;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,MAAM;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;;;;;;;;;;;;ACtEA;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,kBAAkB,mBAAO,CAAC,oEAAY;AACtC,0BAA0B,mBAAO,CAAC,gGAA0B;AAC5D,gBAAgB,mBAAO,CAAC,4DAAa;AACrC,0BAA0B,mBAAO,CAAC,gGAA0B;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,MAAM;AAC7B;AACA,uBAAuB,MAAM;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;;;;;;;;;;;;;AClDN;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,kBAAkB,mBAAO,CAAC,oEAAY;AACtC,0BAA0B,mBAAO,CAAC,gGAA0B;AAC5D,0BAA0B,mBAAO,CAAC,gGAA0B;AAC5D,gBAAgB,mBAAO,CAAC,4DAAa;AACrC,yBAAyB,mBAAO,CAAC,kFAAmB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;;;;;;;;;;;;;ACpCR;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D,gBAAgB,mBAAO,CAAC,4DAAa;AACrC,gBAAgB,mBAAO,CAAC,oEAAS;AACjC,oBAAoB,mBAAO,CAAC,oFAAoB;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;;;;;;;;;;;;;AChCN;AACb,8CAA6C,EAAE,aAAa,EAAC;AAC7D;AACA;AACA;AACA;AACA;AACA,uDAAuD,QAAQ,EAAE,OAAO;AACxE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,YAAY;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sDAAsD,MAAM;AAC5D;AACA;AACA;AACA,6BAA6B,aAAa;AAC1C;AACA;AACA;AACA;AACA;AACA,uBAAuB,MAAM;AAC7B;AACA,wBAAwB,aAAa;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC,IAAI,EAAE,uBAAuB;AACtE;AACA;AACA;AACA,mBAAmB,MAAM;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,MAAM;AACzB;AACA;AACA,sBAAsB,MAAM;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,MAAM;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,MAAM;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;;;;;;;;;;;ACxJA;;AAEb;;AAEA,mBAAmB,0FAAkC;AACrD,iBAAiB,mBAAO,CAAC,uEAAkB;AAC3C,gBAAgB,mBAAO,CAAC,gDAAS;AACjC,iBAAiB,mBAAO,CAAC,6EAAkB;AAC3C,kBAAkB,mBAAO,CAAC,yEAAmB;;AAE7C;AACA,cAAc,mBAAO,CAAC,uEAAe;AACrC,iBAAiB,mBAAO,CAAC,6EAAkB;;;;;;;;;;;;ACZ9B;;AAEb,SAAS,mBAAO,CAAC,mEAAO;AACxB,YAAY,mBAAO,CAAC,+DAAU;AAC9B;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc,gBAAgB;AAC9B;AACA,uCAAuC,QAAQ;AAC/C;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,OAAO;AACzB,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,+BAA+B,QAAQ;AACvC;AACA,oBAAoB,wBAAwB;AAC5C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc,SAAS;AACvB;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,QAAQ;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,SAAS;AACzB;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB,QAAQ;AACxB;;AAEA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB,SAAS;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,SAAS;AACvB;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,WAAW;AAC7B,oBAAoB,UAAU;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,OAAO;AACzB;AACA;AACA;;;;;;;;;;;;AC5Xa;;AAEb,YAAY,mBAAO,CAAC,+DAAU;AAC9B,SAAS,mBAAO,CAAC,mEAAO;AACxB,eAAe,mBAAO,CAAC,6DAAU;AACjC,WAAW,mBAAO,CAAC,kEAAQ;;AAE3B;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;AClba;;AAEb;;AAEA,aAAa,mBAAO,CAAC,kEAAQ;AAC7B,cAAc,mBAAO,CAAC,oEAAS;AAC/B,aAAa,mBAAO,CAAC,kEAAQ;AAC7B,gBAAgB,mBAAO,CAAC,wEAAW;;;;;;;;;;;;ACPtB;;AAEb,SAAS,mBAAO,CAAC,mEAAO;AACxB,eAAe,mBAAO,CAAC,6DAAU;AACjC,WAAW,mBAAO,CAAC,kEAAQ;;AAE3B,YAAY,mBAAO,CAAC,+DAAU;;AAE9B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB;AAChB,wCAAwC;AACxC,gBAAgB;;AAEhB,sBAAsB,iBAAiB;AACvC;;AAEA,gCAAgC,QAAQ;AACxC;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;ACjLa;;AAEb,YAAY,mBAAO,CAAC,+DAAU;AAC9B,SAAS,mBAAO,CAAC,mEAAO;AACxB,eAAe,mBAAO,CAAC,6DAAU;AACjC,WAAW,mBAAO,CAAC,kEAAQ;;AAE3B;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,4DAA4D;AAC5D;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM,cAAc;AACpB,MAAM,cAAc;AACpB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW;AACX;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,mBAAmB;AACzC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,sBAAsB,WAAW;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,gBAAgB,SAAS;AACzB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,SAAS;AACvB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB;AACvB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;ACz6Ba;;AAEb;;AAEA,WAAW,mBAAO,CAAC,mDAAS;AAC5B,YAAY,mBAAO,CAAC,oEAAS;AAC7B,YAAY,mBAAO,CAAC,8DAAS;;AAE7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,QAAQ,mBAAO,CAAC,8FAAyB;AACzC,EAAE;AACF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;AC7MY;;AAEb,SAAS,mBAAO,CAAC,mEAAO;AACxB,eAAe,mBAAO,CAAC,4DAAW;AAClC,YAAY,mBAAO,CAAC,+DAAU;AAC9B,aAAa,mBAAO,CAAC,iEAAW;AAChC,WAAW,mBAAO,CAAC,gDAAS;AAC5B;;AAEA,cAAc,mBAAO,CAAC,6DAAO;AAC7B,gBAAgB,mBAAO,CAAC,yEAAa;;AAErC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA,uBAAuB;AACvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,2BAA2B,0CAA0C;AACrE;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AClPa;;AAEb,SAAS,mBAAO,CAAC,mEAAO;AACxB,YAAY,mBAAO,CAAC,+DAAU;AAC9B;;AAEA;AACA;AACA;AACA;;AAEA,mBAAmB,qBAAqB;AACxC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;;AAEA;AACA,aAAa;AACb;AACA,aAAa;AACb;AACA,aAAa;;AAEb,WAAW;AACX;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;ACxHa;;AAEb,SAAS,mBAAO,CAAC,mEAAO;;AAExB,YAAY,mBAAO,CAAC,+DAAU;AAC9B;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC,cAAc;AAC/C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACrKa;;AAEb,WAAW,mBAAO,CAAC,mDAAS;AAC5B,aAAa,mBAAO,CAAC,iEAAW;AAChC,YAAY,mBAAO,CAAC,+DAAU;AAC9B;AACA;AACA,cAAc,mBAAO,CAAC,gEAAO;AAC7B,gBAAgB,mBAAO,CAAC,4EAAa;;AAErC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,UAAU,cAAc;AACxB,UAAU,sBAAsB;AAChC,YAAY,WAAW;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,gCAAgC;AAC9D;;AAEA;AACA,UAAU,OAAO;AACjB,UAAU,wBAAwB;AAClC,UAAU,4BAA4B;AACtC,YAAY,SAAS;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,sBAAsB;AACxC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;ACrHa;;AAEb,YAAY,mBAAO,CAAC,+DAAU;AAC9B;AACA;AACA;;AAEA;AACA,UAAU,OAAO;AACjB,UAAU,QAAQ;AAClB;AACA,UAAU,aAAa;AACvB,UAAU,OAAO;AACjB,UAAU,aAAa;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,8BAA8B,UAAU;AACxC;;AAEA;AACA;AACA;AACA,8BAA8B,gBAAgB;AAC9C;;AAEA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;AC9Fa;;AAEb,SAAS,mBAAO,CAAC,mEAAO;AACxB,YAAY,mBAAO,CAAC,+DAAU;AAC9B;AACA;AACA;;AAEA;AACA,UAAU,OAAO;AACjB,UAAU,qBAAqB;AAC/B,UAAU,oBAAoB;AAC9B,UAAU,iBAAiB;AAC3B,UAAU,cAAc;AACxB,UAAU,cAAc;AACxB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;AChEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;;;;;;;;;;;AC3wBa;;AAEb;AACA,SAAS,mBAAO,CAAC,mEAAO;AACxB,gBAAgB,mBAAO,CAAC,wEAAqB;AAC7C,eAAe,mBAAO,CAAC,wFAA2B;;AAElD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;;ACrHA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,iDAAwB;AACvC;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA,0DAA0D,mBAAmB;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,sBAAsB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,SAAS;AACjC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,4BAA4B;AAC9C;AACA;;AAEA,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;AACA,MAAM;AACN,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;;AAEA,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,gBAAgB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;;AAEA,sBAAsB,OAAO;AAC7B;AACA;;AAEA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,GAAG;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,WAAW;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;;AAEA,mCAAmC;AACnC,uCAAuC;AACvC;;AAEA;AACA,sBAAsB,OAAO;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,8BAA8B,cAAc;AAC5C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,QAAQ;AACxC;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,+CAA+C;AACnE;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,sBAAsB,sCAAsC;AAC5D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,0BAA0B;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,oBAAoB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,QAAQ;AACrC;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAE,MAA6B;;;;;;;;;;;;;;;;;;;;;;;ACr3GhC,WAAW,mBAAO,CAAC,yCAAM;;AAEzB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,EAAE,OAAO;AACT;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG,4BAA4B;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC7Fa;;AAEb;AACA,eAAe,sBAAsB;AACrC,aAAa,OAAO;AACpB,cAAc,QAAQ;AACtB;;AAEA;AACA;AACA,WAAW,OAAO;AAClB,WAAW,YAAY;AACvB,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;;AAEA;AACA;;AAEA;AACA;AACA,WAAW,KAAK;AAChB,WAAW,mBAAmB;AAC9B,WAAW,YAAY;AACvB,aAAa;AACb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;ACpEa;;AAEb,mBAAmB,mBAAO,CAAC,4DAAe;;AAE1C;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACdA;AACA;AACA;AACA;;AAEa;;AAEb;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,sBAAsB;AACxC;AACA;AACA;AACA;;AAEA;AACA,oDAAoD,iBAAiB;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;;AC7CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;;AAEA;AACA,MAAM,OAAO,IAAI,OAAO,OAAO,OAAO;AACtC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,sBAAsB;AACxC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA,eAAe;AACf;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA,oBAAoB,SAAS;AAC7B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;;AAEA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA,uCAAuC,QAAQ;AAC/C;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,OAAO;AACzB;AACA;AACA;;AAEA;AACA,SAAS,yBAAyB;AAClC;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,8DAA8D,YAAY;AAC1E;AACA,8DAA8D,YAAY;AAC1E;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,qCAAqC,YAAY;AACjD;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA;;;;;;;;;;;AChfA,aAAa,oFAA6B;AAC1C,UAAU,mBAAO,CAAC,8CAAQ;;AAE1B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,WAAW;AACX;;AAEA;;;;;;;;;;;AC5CA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;AC5BA,kBAAkB,mBAAO,CAAC,4DAAc;;AAExC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;AC/BA;;AAEA,QAAQ,WAAW,EAAE,mBAAO,CAAC,2EAAiB;AAC9C,iBAAiB,mBAAO,CAAC,0EAAsB;;AAE/C;AACA,8BAA8B;AAC9B;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY,sBAAsB;AAClC;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AClFA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,OAAO;AAC/B;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACpBA;AACA;AACA,qCAAqC;AACrC;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA,iDAAiD,iBAAiB;AAClE;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,iCAAiC,gBAAgB;AACjD;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA,kCAAkC,wBAAwB;AAC1D;;AAEA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,2DAA2D,cAAc;AACzE;;AAEA;AACA;AACA,yDAAyD,cAAc;AACvE;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,qCAAqC,wDAAwD,cAAc;AAC3G;;AAEA;AACA;;AAEA;AACA;AACA,4EAA4E,cAAc;AAC1F;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2GAA2G,cAAc;AACzH;AACA;AACA;;AAEA,gCAAgC;AAChC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kDAAkD,qBAAqB;AACvE,OAAO;AACP;AACA;AACA;AACA;AACA,6CAA6C,iBAAiB;AAC9D,OAAO;AACP;AACA;;AAEA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA,eAAe;AACf;AACA;AACA,iCAAiC,iFAAiF;AAClH;AACA,YAAY;AACZ;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA;;AAEA,iCAAiC;AACjC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA,yCAAyC,OAAO;AAChD;AACA;AACA;AACA;;AAEA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,WAAW;AACX;AACA,OAAO;AACP;AACA;;AAEA,sBAAsB;AACtB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C,iBAAiB;AAChE;AACA;AACA;;AAEA,wBAAwB;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,+CAA+C,iBAAiB;AAChE,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;AC3Ua;;AAEb;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA,+EAA+E,sCAAsC;;AAErH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;ACnDa;;AAEb,qBAAqB,mBAAO,CAAC,wEAAkB;;AAE/C;;;;;;;;;;;ACJA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACda;;AAEb;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,kCAAkC,8CAA8C;AAChF,GAAG;AACH;;AAEA;AACA;AACA;AACA,UAAU;AACV,GAAG;AACH,gBAAgB;AAChB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB;AACrB;AACA,IAAI;AACJ;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,EAAE;AACF;;AAEA,iBAAiB,mBAAO,CAAC,wDAAa;;AAEtC,uDAAuD,uBAAuB;;AAE9E;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qDAAqD;AACrD,GAAG;AACH,gDAAgD;AAChD,GAAG;AACH,sDAAsD;AACtD,GAAG;AACH;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,WAAW,mBAAO,CAAC,4DAAe;AAClC,aAAa,mBAAO,CAAC,4CAAK;AAC1B;AACA;AACA;AACA;;AAEA;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,+BAA+B,kBAAkB;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACzUa;;AAEb;AACA,oBAAoB,mBAAO,CAAC,oDAAS;;AAErC;AACA,yCAAyC;AACzC,qCAAqC;AACrC,8CAA8C;AAC9C,0CAA0C;;AAE1C;AACA;;;;;;;;;;;;ACZa;;AAEb;AACA;AACA,2FAA2F;AAC3F,4CAA4C;;AAE5C;AACA;AACA;AACA,gCAAgC;;AAEhC,kEAAkE;AAClE,qEAAqE;;AAErE;AACA,iCAAiC;AACjC;AACA,uCAAuC;;AAEvC,2DAA2D;AAC3D,+DAA+D;;AAE/D;AACA;AACA,oBAAoB,gBAAgB;AACpC,2EAA2E;;AAE3E,yGAAyG;;AAEzG;AACA,6CAA6C;;AAE7C,8DAA8D;;AAE9D;AACA;AACA,uEAAuE;AACvE;;AAEA;AACA;;;;;;;;;;;;ACzCa;;AAEb,WAAW,mBAAO,CAAC,4DAAe;;AAElC;;;;;;;;;;;;ACJY;AACZ,aAAa,oFAA6B;AAC1C,gBAAgB,0GAAoC;AACpD,eAAe,mBAAO,CAAC,6DAAU;;AAEjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oCAAoC,oBAAoB;AACxD;AACA;AACA;AACA;;AAEA;AACA,2CAA2C,WAAW;AACtD;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,OAAO;;AAEzB;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;AC9FA;;AAEA,aAAa,mBAAO,CAAC,8DAAc;AACnC,cAAc,mBAAO,CAAC,gEAAe;AACrC,WAAW,mBAAO,CAAC,0DAAY;AAC/B,cAAc,mBAAO,CAAC,gEAAe;AACrC,YAAY,mBAAO,CAAC,4DAAa;;AAEjC;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACda;;AAEb,YAAY,mBAAO,CAAC,yDAAS;AAC7B,aAAa,mBAAO,CAAC,wEAAqB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,OAAO;AACzB;;AAEA;AACA;AACA;AACA,oBAAoB,oBAAoB;AACxC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB,oBAAoB;AACpC;AACA;;AAEA;AACA;;;;;;;;;;;;AC3Fa;;AAEb,YAAY,mBAAO,CAAC,yDAAS;AAC7B,aAAa,mBAAO,CAAC,wEAAqB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,2BAA2B,oBAAoB;AAC/C;;AAEA,cAAc,gBAAgB;AAC9B;AACA;;AAEA;AACA,cAAc,gBAAgB;AAC9B;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;AC9Ca;;AAEb,YAAY,mBAAO,CAAC,yDAAS;AAC7B,aAAa,mBAAO,CAAC,2DAAU;;AAE/B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACjJa;;AAEb,6FAAiC;AACjC,mGAAqC;AACrC,mGAAqC;AACrC,mGAAqC;AACrC,mGAAqC;;;;;;;;;;;;ACNxB;;AAEb,YAAY,mBAAO,CAAC,0DAAU;AAC9B,aAAa,mBAAO,CAAC,4DAAW;AAChC,gBAAgB,mBAAO,CAAC,+DAAU;;AAElC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B;;AAEA,QAAQ,cAAc;AACtB;;AAEA;AACA;AACA;AACA;AACA;;AAEA,cAAc,cAAc;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACzEa;;AAEb,YAAY,mBAAO,CAAC,0DAAU;AAC9B,aAAa,mBAAO,CAAC,yDAAO;;AAE5B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC5Ba;;AAEb,YAAY,mBAAO,CAAC,0DAAU;AAC9B,aAAa,mBAAO,CAAC,4DAAW;AAChC,gBAAgB,mBAAO,CAAC,+DAAU;AAClC,aAAa,mBAAO,CAAC,wEAAqB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B;AACA,SAAS,cAAc;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,cAAc,cAAc;AAC5B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACxGa;;AAEb,YAAY,mBAAO,CAAC,0DAAU;;AAE9B,aAAa,mBAAO,CAAC,yDAAO;;AAE5B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AClCa;;AAEb,YAAY,mBAAO,CAAC,0DAAU;AAC9B,aAAa,mBAAO,CAAC,4DAAW;AAChC,aAAa,mBAAO,CAAC,wEAAqB;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kBAAkB,QAAQ;AAC1B;AACA,SAAS,cAAc;AACvB,gDAAgD;AAChD;AACA,4BAA4B;AAC5B;AACA,kDAAkD;AAClD;AACA,4BAA4B;AAC5B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,cAAc;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qCAAqC;AACrC,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,qCAAqC;AACrC,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,sCAAsC;AACtC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,sCAAsC;AACtC;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACzUa;;AAEb,YAAY,mBAAO,CAAC,0DAAU;AAC9B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;;AAEZ;AACA;AACA;AACA,YAAY;;AAEZ;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA,WAAW;;AAEX;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,cAAc;;;;;;;;;;;;AChDD;;AAEb,aAAa,mBAAO,CAAC,wEAAqB;AAC1C,eAAe,mBAAO,CAAC,6DAAU;;AAEjC,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,gBAAgB;AACtC;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA,IAAI;AACJ,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA,6BAA6B,gBAAgB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA,yBAAyB,gBAAgB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;;AAEA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA;AACA,gBAAgB;;;;;;;;;;;;ACrRH;;AAEb,WAAW,mBAAO,CAAC,mDAAS;AAC5B,YAAY,mBAAO,CAAC,wFAA2B;AAC/C,aAAa,mBAAO,CAAC,wEAAqB;;AAE1C;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,kBAAkB,mBAAmB;AACrC;AACA;AACA;;AAEA;AACA;AACA,0CAA0C;AAC1C;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;AChHA,WAAW,mBAAO,CAAC,iDAAM;AACzB,UAAU,mBAAO,CAAC,sCAAK;;AAEvB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;AC9BA;AACA,2BAA2B,mBAAO,CAAC,4EAAuB;AAC1D,sBAAsB,mBAAO,CAAC,gEAAiB;AAC/C,yBAAyB,mBAAO,CAAC,sEAAoB;AACrD,wBAAwB,mBAAO,CAAC,oEAAmB;;AAEnD;;AAEA;AACA,qCAAqC;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sFAAsF,qBAAqB;AAC3G;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,KAAK;AACL;;AAEA,sBAAsB;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;;;;;;;;;;;;;ACjGY;AACZ,YAAY,mBAAO,CAAC,kDAAK;;AAEzB,qBAAqB,iFAA8B;AACnD,uBAAuB,mBAAO,CAAC,gEAAiB;;AAEhD;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA,gCAAgC;AAChC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,KAAK;AACL;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA,KAAK;AACL;;AAEA,iCAAiC;AACjC,6DAA6D;AAC7D;AACA;;AAEA,KAAK;AACL;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gBAAgB,MAAM;;AAEtB;AACA;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;AACL;;AAEA,sBAAsB;AACtB;AACA;;AAEA,KAAK;AACL;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA,KAAK;AACL;;AAEA,wBAAwB;AACxB;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;ACpJ0C;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,gBAAgB,0DAAS;AACzB;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEgH;;;;;;;;;;;;;;;;;;;;AC7J7C;AACN;;AAE7D;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,yCAAyC,IAAI;AAC9E;AACA,wBAAwB,qDAAI;AAC5B;AACA;AACA,oBAAoB,qDAAI,sDAAsD,qDAAI;AAClF,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0BAA0B,UAAU,IAAI;AACxC;AACA;AACA;AACA,WAAW,qDAAI;AACf;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qDAAY;AACZ;AACA;AACA;AACA,CAAC;;AAE2B;;;;;;;;;;;;;;;;;;;;ACvF5B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEqG;;;;;;;;;;;ACxLrG;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,SAAS,WAAW;;AAEpB;AACA;AACA;AACA,SAAS,WAAW;;AAEpB;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA,SAAS,WAAW;;AAEpB;AACA;AACA,SAAS,UAAU;;AAEnB;AACA;;;;;;;;;;;ACpFA;AACA;AACA,uBAAuB,mBAAO,CAAC,gEAAiB;;AAEhD;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,gCAAgC;AAChC;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA,iCAAiC;AACjC;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB;AACtB;AACA;;AAEA,wBAAwB;AACxB;AACA;AACA;;AAEA;;;;;;;;;;;ACtDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC1Ba;;AAEb;AACA,gBAAgB,mBAAO,CAAC,kEAAqB;;AAE7C;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,CAAC;;AAED,2DAA2D;;AAE3D;;;;;;;;;;;AChCA;;AAEA;AACA;;AAEA;;AAEA;AACA,uCAAuC,YAAY;AACnD;AACA;AACA;AACA;;;;;;;;;;;;ACZa;;AAEb;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA;AACA;AACA,wCAAwC;AACxC,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACrCa;;AAEb;;AAEA;AACA;AACA;;;;;;;;;;;;ACNa;;AAEb,eAAe,mBAAO,CAAC,oDAAW;AAClC,aAAa,mBAAO,CAAC,oEAAmB;;AAExC,qBAAqB,mBAAO,CAAC,iEAAkB;AAC/C,kBAAkB,mBAAO,CAAC,qDAAY;AACtC,WAAW,mBAAO,CAAC,6CAAQ;;AAE3B;;AAEA;;AAEA;AACA;AACA;AACA;AACA,CAAC;;AAED;;;;;;;;;;;;ACnBa;;AAEb,qBAAqB,mBAAO,CAAC,iEAAkB;;AAE/C;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACTa;;AAEb,aAAa,mBAAO,CAAC,oEAAmB;AACxC,kBAAkB,mBAAO,CAAC,qDAAY;;AAEtC;;AAEA;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA,EAAE;AACF;AACA;;;;;;;;;;;;ACfa;;AAEb,cAAc,mBAAO,CAAC,gDAAS;AAC/B,2BAA2B,mBAAO,CAAC,8EAAwB;AAC3D,gBAAgB,mBAAO,CAAC,kEAAqB;;AAE7C;AACA,iBAAiB,mBAAO,CAAC,wDAAa;AACtC;;AAEA;;AAEA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,mBAAO,CAAC,oHAA8C;AACjE,4CAA4C;AAC5C;AACA;AACA,gBAAgB,qBAAM;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK,YAAY;AACjB;AACA,EAAE;AACF;AACA;;AAEA;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;;;;;;;;;;;AC5DA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;ACxCa;;AAEb;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,UAAU;AACV;AACA;;AAEA,aAAa;;AAEb,UAAU;;AAEV,WAAW;;AAEX;AACA,eAAe;;;;;;;;;;;ACtCf;AACA,+GAAkD;AAClD,+GAAkD;;;;;;;;;;;;ACFlD;AACA,aAAa,OAAO,oBAAoB,OAAO;AAC/C,iBAAiB,OAAO;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACZA,kBAAkB,mBAAO,CAAC,gEAAe;AACzC,sBAAsB,mBAAO,CAAC,oDAAS;AACvC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA,WAAW,eAAe;AAC1B;AACA,WAAW,SAAS;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,UAAU;AACvB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,OAAO;AACf,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,eAAe,QAAQ;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACxIA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA,WAAW,QAAQ;AACnB;AACA,WAAW,eAAe;AAC1B;AACA,WAAW,aAAa;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B;AAC9B;AACA,mCAAmC;AACnC;AACA,wCAAwC;AACxC;AACA,6CAA6C;AAC7C;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,UAAU;AACvB,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,qCAAqC;AACnE;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,SAAS;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,eAAe,SAAS;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACtKA,aAAa,mBAAO,CAAC,+CAAQ;AAC7B,eAAe,mBAAO,CAAC,6DAAU;;AAEjC;;AAEA;AACA;AACA,wCAAwC;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,qBAAqB;AACrB,CAAC;;AAED;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ,eAAe;AACf;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,+BAA+B;AACvD;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,uBAAuB;AAC7C;;;;;;;;;;;;AChJA;AACA,oBAAoB,mBAAO,CAAC,8EAAwB;AACpD,QAAQ,eAAe,EAAE,mBAAO,CAAC,+CAAQ;AACzC,cAAc,mBAAO,CAAC,kDAAO;;AAE7B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kBAAkB,MAAM;AACxB;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,qBAAqB;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;;;;;;;;;;AC9DA;AACA;AACA,qBAAqB;AACrB,qBAAqB;;AAErB,eAAe,mBAAO,CAAC,qEAAY;AACnC,mBAAmB,mBAAO,CAAC,wDAAa;;AAExC;AACA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY,QAAQ;AACpB;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA,sCAAsC,GAAG;AACzC;AACA,QAAQ,qCAAqC,GAAG;AAChD;AACA,0BAA0B,MAAM;AAChC,QAAQ,yCAAyC,GAAG;AACpD;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA,sCAAsC,GAAG;AACzC;AACA;AACA,KAAK;AACL;;AAEA,+CAA+C,MAAM;AACrD,mDAAmD,MAAM;AACzD,iDAAiD,MAAM;;AAEvD;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,wBAAwB;;AAExB;AACA;;AAEA;AACA;AACA;AACA;AACA,8CAA8C,mCAAmC;AACjF,wCAAwC,aAAa;AACrD,6DAA6D,qCAAqC;AAClG,8CAA8C,eAAe;AAC7D;AACA;AACA;;AAEA,gDAAgD,oCAAoC;AACpF,0CAA0C,cAAc;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,iDAAiD,IAAI;AACrD,0BAA0B,IAAI,GAAG,IAAI;AACrC,OAAO;AACP,qCAAqC,IAAI,GAAG,2BAA2B;AACvE,KAAK;;AAEL;AACA;;;;;;;;;;;;;;;;;;;;;;;;AChL2D;AACf;AACT;;AAEnC;AACA;;AAEA;AACA;AACA;AACA;;AAEA,iCAAiC,sDAAS;AAC1C;AACA;AACA;AACA;AACA;AACA,uBAAuB,0DAAiB;AACxC,qBAAqB,gEAAuB,EAAE,yDAAgB,EAAE,6DAAoB,EAAE,+DAAsB;AAC5G,KAAK;AACL;AACA;;AAEA;AACA;AACA,qBAAqB,gEAAuB;AAC5C;AACA,MAAM;;;AAGN,qBAAqB,2DAAkB;AACvC;AACA;;AAEA,qBAAqB,yDAAgB;AACrC,8DAA8D,6DAAoB;AAClF;AACA,2BAA2B,4DAAmB;AAC9C,uCAAuC,0DAAiB;;AAExD;AACA;AACA,mCAAmC,8DAAqB;AACxD,qCAAqC,2DAAkB;AACvD;AACA;AACA,sCAAsC,uDAAc;;AAEpD;AACA;AACA;;AAEA,wCAAwC,+DAAsB;;AAE9D;AACA;AACA,YAAY;;;AAGZ,+DAA+D,mEAA0B,oCAAoC,kEAAyB,uCAAuC,qEAA4B;;AAEzN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,qBAAqB,6DAAoB;AACzC,sDAAsD,wDAAe;;AAErE;AACA,6CAA6C,gEAAuB;AACpE;AACA,4CAA4C,iDAAW,CAAC,MAAM;AAC9D;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,mDAAmD;;AAEnD,qDAAqD,OAAO;AAC5D;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;;;AAGN,qBAAqB,+DAAsB;AAC3C;AACA,iCAAiC,2DAAkB;AACnD,iCAAiC,+DAAsB;AACvD,6BAA6B,2DAAkB;AAC/C,OAAO;AACP;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,uBAAuB,yDAAgB;AACvC;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,4DAA4D;;AAE5D;AACA,uDAAuD;;AAEvD;AACA;AACA,IAAI;;;AAGJ;AACA;AACA;AACA,sBAAsB,uBAAuB;AAC7C;AACA;AACA;AACA,+DAA+D;;AAE/D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,MAAM,OAAO;AACb;AACA;;AAEA;;AAE0C;AAC1C;;;;;;;;;;;;ACtLY;AACZ,eAAe,mBAAO,CAAC,6DAAU;AACjC,eAAe,mBAAO,CAAC,oDAAW;AAClC,aAAa,oFAA6B;;AAE1C;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,kBAAkB,QAAQ;;AAE1B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;ACjJA;AACA;;AAEA,eAAe,mBAAO,CAAC,6DAAU;AACjC,aAAa,mBAAO,CAAC,2EAAiB;AACtC,oBAAoB,mBAAO,CAAC,8DAAgB;;AAE5C;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;AACA;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;;AAEA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA,kDAAkD,wBAAwB;AAC1E;AACA;AACA;AACA,QAAQ;AACR;AACA,GAAG;AACH;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB,qBAAqB;AACvC;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACjSA;;AAEA,uBAAuB,mBAAO,CAAC,gEAAiB;;AAEhD;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,2DAA2D;AAC3D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,4DAA4D;AAC5D;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,6EAA6E;AAC7E;AACA;AACA;AACA;AACA;;;;;;;;;;;AChEA,SAAS,mBAAO,CAAC,uEAAO;AACxB,cAAc,mBAAO,CAAC,gDAAS;;AAE/B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,kBAAkB,cAAc;AAChC;;AAEA;;AAEA;AACA,SAAS,OAAO;AAChB;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,kBAAkB,cAAc;AAChC;;AAEA;;AAEA,SAAS,OAAO;AAChB;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AClHA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,iDAAwB;AACvC;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA,0DAA0D,mBAAmB;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,sBAAsB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,SAAS;AACjC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,4BAA4B;AAC9C;AACA;;AAEA,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;AACA,MAAM;AACN,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;;AAEA,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,gBAAgB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;;AAEA,sBAAsB,OAAO;AAC7B;AACA;;AAEA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,GAAG;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,WAAW;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;;AAEA,mCAAmC;AACnC,uCAAuC;AACvC;;AAEA;AACA,sBAAsB,OAAO;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,8BAA8B,cAAc;AAC5C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,QAAQ;AACxC;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,+CAA+C;AACnE;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,sBAAsB,sCAAsC;AAC5D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,0BAA0B;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,oBAAoB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,QAAQ;AACrC;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAE,MAA6B;;;;;;;;;;;;ACr3GnB;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,sBAAsB;AACxC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,qBAAqB,mCAAmC;AACxD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,qBAAqB,GAAG,wBAAwB;AACrE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA,oBAAoB,uBAAuB;AAC3C;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;;AAEA;;;;;;;;;;;;AChGa;;AAEb,WAAW,mBAAO,CAAC,2CAAQ;AAC3B,0BAA0B,mBAAO,CAAC,+DAAkB,GAAG,mBAAO,CAAC,yDAAe;;;;;;;;;;;ACH9E,kBAAkB,ujyB;;;;;;;;;;ACAlB,kBAAkB,gxS;;;;;;;;;;ACAlB;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;ACVa;;AAEb;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA,IAAI;AACJ,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACzDA;AACA,UAAU,mBAAO,CAAC,yDAAS;AAC3B,iBAAiB,mBAAO,CAAC,mEAAc;AACvC,eAAe,mBAAO,CAAC,kDAAU;;AAEjC;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;AACxC;AACA;AACA;AACA,kBAAkB,mBAAmB;AACrC,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB;AACA,oCAAoC,MAAM;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,yBAAyB;AAC7B;AACA;;AAEA,kCAAkC,MAAM;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,EAAE,yBAAyB;AAC3B;AACA;;AAEA,mBAAmB;AACnB;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;;AAEA;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;AACxC;AACA;AACA;AACA;AACA;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;AACxC;AACA;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;AACxC;;AAEA;;AAEA;AACA,kBAAkB,oBAAoB;AACtC;AACA;AACA;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA,kBAAkB,wBAAwB;AAC1C;AACA;AACA;AACA;;AAEA,YAAY,GAAG,yBAAyB;AACxC,gCAAgC;AAChC,kCAAkC,MAAM;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,EAAE,sCAAsC;AACxC;AACA,gCAAgC;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,wCAAwC;AACxC;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;;AAExC;AACA,EAAE,yBAAyB;AAC3B;AACA,mBAAmB;AACnB;;AAEA;AACA;AACA,YAAY,MAAM;AAClB;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY,GAAG,wBAAwB;AACvC,+BAA+B;AAC/B,kCAAkC,MAAM;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,EAAE,qCAAqC;AACvC;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;;AAExC;AACA,EAAE,yBAAyB;AAC3B;AACA,mBAAmB;AACnB;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,MAAM;AAClB;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA;AACA,YAAY;AACZ,mBAAmB;AACnB;AACA,kCAAkC,MAAM;;AAExC;AACA;;AAEA,kBAAkB,oBAAoB;AACtC;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,YAAY;AACZ,mBAAmB;AACnB;AACA,kCAAkC,MAAM;;AAExC;;AAEA,kBAAkB,oBAAoB;AACtC;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB;AACA,kCAAkC,MAAM;;AAExC;;AAEA,kBAAkB,oBAAoB;AACtC;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB;AACA,kCAAkC,MAAM;;AAExC;;AAEA,kBAAkB,oBAAoB;AACtC;AACA;AACA;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB;AACA,kCAAkC,MAAM;;AAExC;;AAEA,kBAAkB,oBAAoB;AACtC;AACA;AACA;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB;AACA,kCAAkC,MAAM;;AAExC;;AAEA,kBAAkB,oBAAoB;AACtC;AACA;AACA;AACA;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;AACxC;;AAEA;;AAEA;AACA,kBAAkB,oBAAoB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA,kBAAkB,wBAAwB;AAC1C;AACA;AACA;AACA;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB;AACA,kCAAkC,MAAM;;AAExC;;AAEA,kBAAkB,oBAAoB;AACtC;AACA;AACA;AACA;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;;AAExC;AACA;;AAEA;AACA;;AAEA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;;AAExC;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;;AAExC;AACA;AACA;AACA;AACA;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;;AAExC;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;AACxC;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;;AAExC;AACA,EAAE,yBAAyB;AAC3B;AACA;AACA,mBAAmB;AACnB;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB,kCAAkC,MAAM;;AAExC;AACA;AACA;AACA;AACA,kBAAkB,wBAAwB;AAC1C;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,EAAE,yBAAyB;AAC3B;AACA,mBAAmB;AACnB;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;;AAEA,YAAY;AACZ,mBAAmB;AACnB;AACA;AACA,IAAI,yBAAyB;AAC7B,IAAI;AACJ,IAAI,yBAAyB;AAC7B;AACA;AACA,mBAAmB;AACnB;AACA,YAAY,MAAM;AAClB;AACA;AACA,2BAA2B;AAC3B;AACA;;AAEA;AACA,uBAAuB,SAAS;AAChC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA;;AAEA;AACA,kBAAkB,MAAM;AACxB;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,iBAAiB;AACnC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,cAAc,YAAY;AAC1B;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC/+BA;AACA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB;AAClB,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ;AACA,oDAAoD;AACpD;AACA;AACA,IAAI;AACJ;AACA,cAAc,MAAM;AACpB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,uBAAuB;AACvB,8BAA8B;AAC9B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB;AACpB,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,+BAA+B;AAC/B,sCAAsC;AACtC;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACvEA;AACA,eAAe,mBAAO,CAAC,kDAAU;;AAEjC,YAAY,mBAAO,CAAC,yDAAS;;AAE7B;;AAEA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qBAAqB,MAAM;AAC3B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,QAAQ;AACR;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,IAAI;AACJ;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ,iBAAiB,MAAM;AACvB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,QAAQ;AACR;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,OAAO;AACP;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;;AChOA,aAAa,mBAAO,CAAC,2EAAiB;AACtC,gBAAgB,mBAAO,CAAC,sDAAY;AACpC,UAAU,mBAAO,CAAC,kEAAkB;;AAEpC,YAAY,MAAM;;AAElB;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,gBAAgB,MAAM;AACtB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB,MAAM;AACtB,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;ACzLA,aAAa,mBAAO,CAAC,2EAAiB;AACtC,UAAU,mBAAO,CAAC,kEAAkB;AACpC,qBAAqB,mBAAO,CAAC,gEAAiB;;AAE9C;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,eAAe,uEAAuE;AACtF;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,YAAY,MAAM;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;ACtIA,gBAAgB,mBAAO,CAAC,qDAAU;AAClC,gBAAgB,mBAAO,CAAC,qDAAU;;AAElC,cAAc;AACd,cAAc;;;;;;;;;;;ACJd;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,eAAe;AAC1B,WAAW,QAAQ;AACnB,YAAY,OAAO;AACnB,YAAY;AACZ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,YAAY;AACZ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,YAAY;AACZ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,YAAY;AACZ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;;;;;;;;;;ACjKA;AACA,eAAe,mBAAO,CAAC,2EAAiB;AACxC,aAAa,mBAAO,CAAC,yCAAM;;AAE3B;AACA,yBAAyB,qCAAqC;AAC9D;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,4BAA4B;;AAExC;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,6BAA6B,qCAAqC;AAClE;;AAEA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACrKA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;;;;;;;;;;;;ACda;;AAEb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;ACjBa;;AAEb,aAAa,mBAAO,CAAC,oEAAmB;AACxC,eAAe,mBAAO,CAAC,oDAAW;;AAElC,qBAAqB,mBAAO,CAAC,oEAAkB;AAC/C,kBAAkB,mBAAO,CAAC,wDAAY;AACtC,WAAW,mBAAO,CAAC,gDAAQ;;AAE3B;;AAEA;AACA;AACA;AACA;AACA,CAAC;;AAED;;;;;;;;;;;;ACjBa;;AAEb,qBAAqB,mBAAO,CAAC,oEAAkB;;AAE/C;AACA;AACA;;;;;;;;;;;;ACNa;;AAEb,kBAAkB,mBAAO,CAAC,wDAAY;AACtC,aAAa,mBAAO,CAAC,oEAAmB;;AAExC;AACA;AACA,kBAAkB,cAAc;AAChC;AACA;AACA;AACA,EAAE;AACF;AACA;;;;;;;;;;;;ACba;;AAEb;AACA;AACA;AACA;AACA;AACA,cAAc,mBAAO,CAAC,gEAAe,GAAG;AACxC;AACA,2CAA2C,gBAAgB;AAC3D,uDAAuD;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uCAAuC;AACvC;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;;AAEA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,mBAAmB,sBAAsB;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACzHa;;AAEb;AACA,aAAa,mBAAO,CAAC,gEAAe;;AAEpC;AACA,6CAA6C,sBAAsB,EAAE,mBAAO,CAAC,sEAAkB;;AAE/F;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC/Ba;;AAEb;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;AChBA,aAAa,mBAAO,CAAC,+CAAQ;AAC7B;AACA,qBAAqB;;AAErB;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;;AAEH;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;ACzCA;AACA;AACY;;AAEZ,WAAW,mBAAO,CAAC,mDAAS;;AAE5B,0GAA8C;;AAE9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,qBAAqB;;AAErB;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,kBAAkB;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED,2BAA2B;;AAE3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,qBAAqB;;AAErB,gBAAgB;AAChB;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD,oBAAoB;;AAEpB;AACA;AACA;AACA,GAAG;AACH,CAAC;;AAED,iBAAiB;AACjB;AACA;AACA;AACA;AACA,CAAC;;;;;;;;;;;;ACzHD;AACA;;AAEY;;AAEZ,UAAU,mBAAO,CAAC,mDAAS;;AAE3B;AACA;AACA;AACA;AACA,GAAG;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA,GAAG;AACH,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;;;;;;;;;;;ACxFA;AACA;AACA;AACA;AACA,UAAU,mBAAO,CAAC,8DAAgB;AAClC,cAAc,mBAAO,CAAC,gEAAgB;AACtC,aAAa,oFAA6B;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;AC9BA,WAAW,mBAAO,CAAC,iDAAQ;AAC3B,YAAY,mBAAO,CAAC,0DAAc;AAClC,cAAc,mBAAO,CAAC,uDAAW;AACjC,cAAc,mBAAO,CAAC,gEAAgB;AACtC,aAAa,mBAAO,CAAC,gDAAQ;AAC7B,aAAa,oFAA6B;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC1GA;AACA;;AAEA,gBAAgB,mBAAO,CAAC,oDAAS;AACjC,qBAAqB,mBAAO,CAAC,8DAAgB;AAC7C,WAAW,mBAAO,CAAC,iBAAI;AACvB,YAAY,mBAAO,CAAC,sDAAY;AAChC,eAAe,mBAAO,CAAC,sDAAY;AACnC,aAAa,mBAAO,CAAC,qDAAM;AAC3B,aAAa,mBAAO,CAAC,0DAAa;AAClC,uBAAuB,mBAAO,CAAC,gEAAiB;;AAEhD;AACA,qBAAqB;;AAErB,0BAA0B;AAC1B,4BAA4B;;AAE5B;AACA;AACA,YAAY,sBAAsB;AAClC,YAAY;AACZ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,IAAI,sDAAsD,GAAG,kCAAkC,GAAG;AAClG;AACA,yCAAyC,UAAU;AACnD,IAAI,SAAS,MAAM;AACnB;AACA,yCAAyC,0BAA0B;AACnE,IAAI,SAAS,MAAM;AACnB;AACA;AACA,IAAI;AACJ;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA,yEAAyE;AACzE;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA,6DAA6D,YAAY;AACzE;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA;AACA;AACA,iBAAiB;AACjB,KAAK;AACL;AACA,iEAAiE,YAAY;AAC7E;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,eAAe;AAC3B,YAAY,eAAe;AAC3B;AACA;AACA,MAAM,MAAM;AACZ;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,0BAA0B,MAAM;;AAEhC;;AAEA;AACA;;AAEA,MAAM,MAAM;;AAEZ;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL,IAAI;AACJ;AACA;;AAEA;AACA,MAAM,MAAM;AACZ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY;AACZ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU,MAAM;AAChB;AACA,GAAG;;AAEH;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,YAAY,GAAG;AACf,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;AACA;;AAEA;AACA,mEAAmE,UAAU;AAC7E;;AAEA;AACA;AACA,CAAC,SAAS,MAAM,WAAW;;;;;;;;;;;;;AC5Q3B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,kBAAkB;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,uCAAuC,8BAA8B;AACrE;AACA;AACA;AACA;AACA;AACA,gBAAgB,OAAO;AACvB;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA,GAAG;;AAEH;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA,oBAAoB,sBAAsB;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,qBAAqB;AAChC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,WAAW,aAAa;AACxB;AACA;AACA;AACA;AACA,6CAA6C;AAC7C;AACA,YAAY;AACZ;AACA,sCAAsC;AACtC;AACA;AACA,UAAU;AACV;AACA;AACA,iDAAiD;AACjD;AACA,YAAY;AACZ;AACA,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,4CAA4C,cAAc;AAC1D;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,gCAAgC,QAAQ;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,gDAAgD;AAChD;AACA,MAAM;AACN,gCAAgC,QAAQ;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA,gBAAgB;AAChB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,WAAW,YAAY;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4CAA4C;AAC5C,UAAU;AACV;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,oFAAoF;AACpF;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA,8DAA8D;;AAE9D;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;;;;;;;;;;AChhBA,6FAAuC;AACvC,uGAA0C;;;;;;;;;;;ACD1C,aAAa,oFAA6B;;AAE1C,sBAAsB,mBAAO,CAAC,iEAAgB;AAC9C,sBAAsB,mBAAO,CAAC,yEAAoB;AAClD,WAAW,mBAAO,CAAC,yDAAQ;AAC3B,eAAe,mBAAO,CAAC,2DAAa;;AAEpC;AACA,aAAa,qBAAM,WAAW,qBAAM;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,qBAAM,aAAa,qBAAM;AAC/B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,qBAAM,YAAY,qBAAM;AAC9B,eAAe,qBAAM;AACrB,IAAI,SAAS,qBAAM;AACnB,eAAe,qBAAM;AACrB,IAAI,SAAS,qBAAM;AACnB,eAAe,qBAAM;AACrB,IAAI;AACJ,eAAe,qBAAM;AACrB;AACA;AACA;AACA;AACA;AACA,uBAAuB,gBAAgB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,qBAAM;AAC5B;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,GAAG;AACH;;;;;;;;;;;;ACrHA;AACA;AACA,IAAI,qBAAM,YAAY,qBAAM;AAC5B;AACA,EAAE,SAAS,qBAAM,YAAY,qBAAM;AACnC,+BAA+B,OAAO;;AAEtC;AACA,EAAE;AACF;AACA;AACA;;;;;;;;;;;ACXA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,+DAA+D;AAC/D;AACA;AACA;;;;;;;;;;;AClBA,UAAU,mBAAO,CAAC,0DAAiB;AACnC,gBAAgB,mBAAO,CAAC,oDAAW;AACnC,UAAU,mBAAO,CAAC,8CAAQ;AAC1B,aAAa,oFAA6B;;AAE1C,sBAAsB,mBAAO,CAAC,iEAAgB;AAC9C,sBAAsB,mBAAO,CAAC,yEAAoB;AAClD,eAAe,mBAAO,CAAC,2DAAa;;AAEpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA,kBAAkB,eAAe;AACjC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B;;AAEA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA,sBAAsB,UAAU;AAChC;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;ACxGA,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;;;;;;;;;;;ACZA;;AAEA;AACA;AACA;;;;;;;;;;;ACJA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA,8BAA8B;AAC9B,2BAA2B;;;;;;;;;;;AC5B3B,oHAAkD;AAClD,uHAAoD;;AAEpD,sBAAsB;AACtB;AACA;;AAEA,qBAAqB;AACrB;AACA;;;;;;;;;;;ACTA,iBAAiB,mBAAO,CAAC,0DAAa;AACtC,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AClBA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN,eAAe,iDAAwB;AACvC;AACA,IAAI;AACJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yCAAyC;AACzC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,QAAQ;AACjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,yBAAyB,mBAAmB;AAC5C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,kCAAkC,YAAY;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA,0DAA0D,mBAAmB;AAC7E;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,SAAS;AACjC;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,QAAQ;AACR;;AAEA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,sBAAsB;AAC7D;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,SAAS;AACjC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB,4BAA4B;AAC9C;AACA;;AAEA,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;AACA,MAAM;AACN,kBAAkB,aAAa;AAC/B;AACA;;AAEA;AACA;;AAEA,aAAa,eAAe;AAC5B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,sBAAsB,gBAAgB;AACtC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,iBAAiB;AACrC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,oBAAoB,cAAc;AAClC;AACA;AACA;AACA;AACA,WAAW,6BAA6B;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,cAAc;AAC3B;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,oBAAoB;AACxC;AACA;AACA;AACA;AACA;AACA;AACA,qDAAqD,WAAW;AAChE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;;AAEA;AACA;;AAEA,sBAAsB,OAAO;AAC7B;AACA;;AAEA,wBAAwB,OAAO;AAC/B;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,wBAAwB,GAAG;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,WAAW;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,WAAW;AAC/B;AACA;AACA;;AAEA;;AAEA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,SAAS;AAC7B;;AAEA,mCAAmC;AACnC,uCAAuC;AACvC;;AAEA;AACA,sBAAsB,OAAO;AAC7B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,cAAc;AAClC;AACA;;AAEA;AACA,8BAA8B,cAAc;AAC5C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,QAAQ;AACxC;AACA;;AAEA,kBAAkB,OAAO;AACzB;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,kBAAkB,iBAAiB;AACnC;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oBAAoB,+CAA+C;AACnE;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,sBAAsB,sCAAsC;AAC5D;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,gBAAgB,gBAAgB;AAChC;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,yBAAyB;AACpC;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,gBAAgB,iBAAiB;AACjC;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,cAAc;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,wBAAwB,QAAQ;AAChC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,8BAA8B,mCAAmC;AACjE;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,wBAAwB,0BAA0B;AAClD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA,MAAM;;AAEN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gCAAgC;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,QAAQ;AAC1C;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;;AAEN;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,iBAAiB,kBAAkB;AACnC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,oBAAoB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,gBAAgB;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,6BAA6B,QAAQ;AACrC;AACA,8BAA8B,QAAQ;AACtC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,CAAC,EAAE,MAA6B;;;;;;;;;;;ACr3GhC,gBAAgB,mBAAO,CAAC,sDAAY;AACpC,UAAU,mBAAO,CAAC,mDAAO;AACzB,UAAU,mBAAO,CAAC,mDAAO;AACzB,SAAS,mBAAO,CAAC,yEAAO;AACxB,UAAU,mBAAO,CAAC,8DAAgB;AAClC,iBAAiB,mBAAO,CAAC,0DAAa;AACtC,iBAAiB,mBAAO,CAAC,iEAAc;AACvC,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACxGA,gBAAgB,mBAAO,CAAC,sDAAY;AACpC,kBAAkB,mBAAO,CAAC,0DAAa;AACvC,iBAAiB,mBAAO,CAAC,0DAAa;AACtC,UAAU,mBAAO,CAAC,mDAAO;AACzB,UAAU,mBAAO,CAAC,mDAAO;AACzB,SAAS,mBAAO,CAAC,yEAAO;AACxB,iBAAiB,mBAAO,CAAC,iEAAc;AACvC,UAAU,mBAAO,CAAC,8DAAgB;AAClC,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;ACvFA,SAAS,mBAAO,CAAC,yEAAO;AACxB,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;ACXA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACPA,WAAW,mBAAO,CAAC,yCAAM;AACzB,UAAU,mBAAO,CAAC,4DAAe;AACjC,SAAS,mBAAO,CAAC,iBAAI;;AAErB;AACA,4BAA4B,OAAO;;AAEnC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,GAAG;;AAEH,eAAe,qCAAqC;AACpD;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;;AAEH;AACA;;AAEA;;;;;;;;;;;;ACjFA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AC/EA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,QAAQ;AACR;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;;;;;;;;;;;;AC/Da;;AAEb,cAAc,GAAG,2FAAmC;AACpD,cAAc,GAAG,+FAAuC;;;;;;;;;;;ACHxD;AACA;;AAEA;AACA,iEAAiE,qBAAM;AACvE;AACA;AACA;AACA,qCAAqC,WAAW;;;;;;;;;;;ACRhD;;;;;;;;;;;ACAA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;;AClBY;;AAEZ;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,aAAa,oFAA6B;AAC1C,aAAa,qBAAM,WAAW,qBAAM;;AAEpC;AACA;AACA,EAAE;AACF;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA,mBAAmB;AACnB,4BAA4B;AAC5B;AACA,8BAA8B,kBAAkB;AAChD;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,WAAW,OAAO;AAClB;AACA,KAAK;AACL;;AAEA;AACA;;;;;;;;;;;;;ACjDY;;AAEZ;AACA;AACA;AACA,iBAAiB,mBAAO,CAAC,wDAAa;AACtC,kBAAkB,mBAAO,CAAC,0DAAa;AACvC;AACA;AACA,aAAa,qBAAM,WAAW,qBAAM;AACpC;AACA;AACA,yDAAyD;AACzD;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,mDAAmD;AACnD;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2CAA2C,OAAO;AAClD,EAAE,kBAAkB;AACpB,EAAE,sBAAsB;AACxB,EAAE;AACF,EAAE,kBAAkB;AACpB,EAAE,sBAAsB;AACxB;AACA;AACA,gDAAgD,qBAAM;AACtD;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gDAAgD,qBAAM;AACtD;AACA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;;;;;;;;;;;;AC3GA;AACA;AACA;AACA;AACA;AACA;;AAEY;;AAEZ;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,YAAY;AACZ;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,kBAAkB,gBAAgB;AAClC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,yBAAyB,oBAAoB;AAC7C;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;ACjKA;AACA;;AAEA;;AAEA;;AAEA;AACA,QAAQ,wBAAwB,EAAE,mBAAO,CAAC,2EAAiB;;AAE3D;AACA,gCAAgC;AAChC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;AClHa;;AAEb;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,sBAAsB,OAAO;AAC7B;AACA;AACA,MAAM;AACN;AACA;AACA,6CAA6C,6BAA6B;AAC1E,MAAM;AACN;AACA;AACA,OAAO;AACP;AACA;AACA,MAAM;AACN;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,oBAAoB,OAAO;AAC3B;AACA;AACA;AACA;;AAEA;AACA;AACA,wBAAwB;AACxB;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,oCAAoC,GAAG;AACvC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;;AAEA;;;;;;;;;;;;AC3Ma;;AAEb,gDAAgD,0DAA0D,2CAA2C;;AAErJ;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,GAAG;;AAEH;AACA;AACA;AACA,EAAE;;;AAGF;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;AACA,EAAE;;;AAGF;AACA;AACA,EAAE;;;AAGF;AACA;AACA;AACA;;AAEA;AACA,EAAE;;;AAGF;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA,CAAC;AACD;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA,oBAAoB;;;;;;;;;;;;;AC9HpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACa;AACb;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;;AAGA;;AAEA,eAAe,mBAAO,CAAC,kFAAoB;;AAE3C,eAAe,mBAAO,CAAC,kFAAoB;;AAE3C,mBAAO,CAAC,6DAAU;;AAElB;AACA;AACA;;AAEA,kBAAkB,iBAAiB;AACnC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,GAAG;;AAEJ;AACA;AACA,yCAAyC;AACzC;;AAEA,EAAE,OAAO;AACT;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;;;AAGA;AACA;AACA;AACA,CAAC,E;;;;;;;;;;;AC1ID;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACa;;AAEb;;AAEA,gBAAgB,mBAAO,CAAC,oFAAqB;;AAE7C,mBAAO,CAAC,6DAAU;;AAElB;AACA;AACA;AACA;;AAEA;AACA;AACA,E;;;;;;;;;;;;ACtCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACa;;AAEb;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,SAAS,iFAA8B;;AAEvC;AACA;AACA;AACA;;AAEA;;;AAGA,aAAa,mBAAO,CAAC,wGAA2B;AAChD;;;AAGA,aAAa,0EAAwB;;AAErC,oBAAoB,qBAAM;;AAE1B;AACA;AACA;;AAEA;AACA;AACA;AACA;;;AAGA,gBAAgB,mBAAO,CAAC,mBAAM;;AAE9B;;AAEA;AACA;AACA,EAAE;AACF;AACA;AACA;;;AAGA,iBAAiB,mBAAO,CAAC,0GAAgC;;AAEzD,kBAAkB,mBAAO,CAAC,kGAA4B;;AAEtD,eAAe,mBAAO,CAAC,8FAA0B;AACjD;;AAEA,qBAAqB,8FAA0B;AAC/C;AACA;AACA;AACA,4FAA4F;;;AAG5F;AACA;AACA;;AAEA,mBAAO,CAAC,6DAAU;;AAElB;AACA;;AAEA;AACA;AACA;AACA,gGAAgG;AAChG;AACA;AACA;;AAEA,yEAAyE,mFAAmF;AAC5J;;AAEA;AACA,qBAAqB,mBAAO,CAAC,8EAAkB;AAC/C,2BAA2B;AAC3B;AACA;AACA;AACA;;AAEA,0EAA0E;AAC1E;;AAEA;AACA,mFAAmF;AACnF;;AAEA,2FAA2F;AAC3F;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;;AAEA,oBAAoB;AACpB;;AAEA;AACA;AACA;AACA;AACA,sBAAsB;;AAEtB,gDAAgD;;AAEhD,4CAA4C;;AAE5C,0BAA0B;AAC1B;AACA;;AAEA,4DAA4D;;AAE5D,uBAAuB;;AAEvB;AACA;AACA;;AAEA;AACA,wCAAwC,+GAAwC;AAChF;AACA;AACA;AACA;;AAEA;AACA,qBAAqB,mBAAO,CAAC,8EAAkB;AAC/C,iEAAiE;AACjE;;AAEA;AACA,oEAAoE;;AAEpE;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;;;AAGA;AACA;AACA,CAAC;AACD;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA,GAAG;;;AAGH;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA,+FAA+F;AAC/F,QAAQ;AACR;AACA,QAAQ;AACR;AACA,QAAQ;AACR;;AAEA;AACA;AACA,4FAA4F;AAC5F,UAAU;AACV;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,IAAI;AACJ;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,gDAAgD;AAChD;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,GAAG;;;AAGH;AACA,sCAAsC,+GAAwC;AAC9E;AACA,yCAAyC;;AAEzC,uEAAuE;;AAEvE;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,GAAG;;;AAGH;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,EAAE;AACF;;;AAGA;AACA;AACA;;AAEA;AACA;AACA,4EAA4E;AAC5E,IAAI;;;AAGJ;AACA,mCAAmC;;AAEnC;AACA;AACA;AACA;;AAEA;AACA,EAAE;;;AAGF;AACA;AACA;AACA;AACA;AACA,8CAA8C;AAC9C;AACA;;AAEA;AACA;AACA,6DAA6D;AAC7D;AACA;;AAEA,+BAA+B;;AAE/B;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,kCAAkC;;AAElC;AACA;AACA;AACA,IAAI;AACJ;;;AAGA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,uBAAuB;;AAEvB,uDAAuD;;AAEvD;;AAEA,wBAAwB;AACxB;;AAEA;AACA;;AAEA;AACA,sCAAsC;;AAEtC;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA,iDAAiD;;AAEjD;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;;;AAGA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI,OAAO;AACX;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA,EAAE;AACF;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,IAAI,OAAO;AACX;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,EAAE;AACF;AACA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,gEAAgE,OAAO,oBAAoB,OAAO;AAClG;AACA,wBAAwB,OAAO,iBAAiB;AAChD;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB;AACtB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;;;AAGA;AACA;AACA;AACA;AACA;AACA,IAAI;;;AAGJ,2CAA2C;;AAE3C;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,IAAI;;;AAGJ,0BAA0B;;AAE1B;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL,2CAA2C;;AAE3C;AACA;AACA;AACA,mCAAmC;;AAEnC;AACA;AACA;AACA;AACA;AACA,IAAI;;;AAGJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,oBAAoB,SAAS;AAC7B;AACA;AACA,OAAO;AACP;;AAEA;AACA,IAAI;;;AAGJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;;AAGA;AACA;AACA;;AAEA;AACA;AACA;AACA,kEAAkE;;AAElE;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,QAAQ;AACR,QAAQ,OAAO;AACf;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO;AACX;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO;AACX;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,0BAA0B;AAC1B,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAE;AACF;;;AAGA;AACA;;AAEA;AACA,qBAAqB;AACrB;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI,OAAO;AACX;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAE;AACF;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA,2DAA2D;;AAE3D,4EAA4E;;AAE5E;;AAEA;AACA;AACA;AACA;AACA,GAAG,GAAG;AACN;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,IAAI;;;AAGJ,kBAAkB,yBAAyB;AAC3C;AACA,IAAI;AACJ;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,0CAA0C,mBAAO,CAAC,gHAAmC;AACrF;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;AACD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,CAAC,GAAG;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,GAAG;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mDAAmD;AACnD;AACA,mDAAmD,+DAA+D;AAClH;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,IAAI,OAAO;AACX;AACA;;AAEA;AACA,0DAA0D;;AAE1D;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,aAAa,mBAAO,CAAC,oGAAyB;AAC9C;;AAEA;AACA;AACA;;AAEA;AACA,iCAAiC,OAAO;AACxC;AACA;;AAEA;AACA,C;;;;;;;;;;;ACnmCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,aAAa;AACvD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACa;;AAEb;;AAEA,qBAAqB,8FAA0B;AAC/C;AACA;AACA;AACA;;AAEA,aAAa,mBAAO,CAAC,8EAAkB;;AAEvC,mBAAO,CAAC,6DAAU;;AAElB;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL,2CAA2C;AAC3C;AACA;;AAEA;;AAEA;AACA;AACA;AACA,IAAI;;;AAGJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;;AAGA;AACA;;AAEA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA,uBAAuB;AACvB;AACA;;AAEA;AACA;AACA;AACA,C;;;;;;;;;;;;ACxMA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACa;;AAEb;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;;;AAGA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;;AAGA;AACA;;AAEA;AACA;;AAEA;AACA,aAAa,mBAAO,CAAC,gEAAgB;AACrC;AACA;;AAEA;;AAEA,aAAa,mBAAO,CAAC,wGAA2B;AAChD;;;AAGA,aAAa,0EAAwB;;AAErC,oBAAoB,qBAAM;;AAE1B;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,mBAAO,CAAC,kGAA4B;;AAEtD,eAAe,mBAAO,CAAC,8FAA0B;AACjD;;AAEA,qBAAqB,8FAA0B;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,mBAAO,CAAC,6DAAU;;AAElB;;AAEA;AACA,qBAAqB,mBAAO,CAAC,8EAAkB;AAC/C,2BAA2B;AAC3B;AACA;AACA;AACA;;AAEA,0EAA0E;AAC1E;;AAEA;AACA,mFAAmF;AACnF;AACA;;AAEA,2FAA2F;;AAE3F,4BAA4B;;AAE5B,0BAA0B;;AAE1B,uBAAuB;;AAEvB,sBAAsB;;AAEtB,yBAAyB;;AAEzB,0BAA0B;AAC1B;AACA;;AAEA;AACA,kCAAkC;AAClC;AACA;;AAEA,4DAA4D;AAC5D;AACA;;AAEA,mBAAmB;;AAEnB,wBAAwB;;AAExB,mBAAmB;AACnB;AACA;AACA;;AAEA,oBAAoB;AACpB;AACA;;AAEA,iCAAiC;;AAEjC;AACA;AACA,KAAK;;;AAGL,uBAAuB;;AAEvB;AACA;AACA,mCAAmC;AACnC;;AAEA,sBAAsB;AACtB;;AAEA,4BAA4B;;AAE5B,6BAA6B;;AAE7B,gDAAgD;;AAEhD,4CAA4C;;AAE5C,iCAAiC;AACjC;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL,IAAI;AACJ,CAAC,KAAK;AACN;;;AAGA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,EAAE;AACF;AACA;AACA;AACA;;AAEA;AACA,qBAAqB,mBAAO,CAAC,8EAAkB,GAAG;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oEAAoE;;AAEpE;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,EAAE;;;AAGF;AACA;AACA;;AAEA;AACA,6CAA6C;;AAE7C;AACA,EAAE,OAAO;AACT,EAAE;AACF;AACA;;;AAGA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA,IAAI,OAAO;AACX;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,iCAAiC;AACjC;AACA,4CAA4C;AAC5C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC,GAAG;AACJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,gDAAgD;;AAEhD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,wEAAwE,sDAAsD;AAC9H;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,IAAI,OAAO,mBAAmB;AAC9B;;AAEA,IAAI,OAAO;AACX;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA,gCAAgC;AAChC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,oDAAoD;AACpD;AACA;;AAEA;AACA;AACA;;AAEA;AACA,MAAM,OAAO;AACb,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA,EAAE;;;AAGF;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2EAA2E;AAC3E;;AAEA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,oCAAoC;AACpC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA,0EAA0E;;AAE1E;AACA;AACA;AACA,IAAI;;;AAGJ;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,CAAC;;AAED;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,wBAAwB,OAAO,cAAc;AAC7C;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;;;AAGJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;;;AAGA;AACA;AACA,CAAC;AACD;AACA;;AAEA;AACA;AACA,E;;;;;;;;;;;;ACxrBa;;AAEb;;AAEA,4CAA4C,kBAAkB,kCAAkC,oEAAoE,KAAK,OAAO,oBAAoB;;AAEpM,eAAe,mBAAO,CAAC,6FAAiB;;AAExC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,qCAAqC;AACrC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAE,OAAO;AACT;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA;;AAEA,iEAAiE;AACjE;AACA;AACA;AACA,GAAG;;AAEH;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,OAAO;AACf;AACA;AACA,YAAY;AACZ;AACA;AACA,SAAS;AACT,OAAO;AACP,MAAM;AACN;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,CAAC;AACD;AACA,CAAC;AACD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,KAAK;AACL,GAAG;AACH,CAAC;;AAED;AACA;;AAEA,yFAAyF;AACzF;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,KAAK;AACL;AACA,GAAG;AACH;AACA;AACA;AACA,0CAA0C;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,GAAG;AACH;AACA;AACA;;AAEA,mD;;;;;;;;;;;AC9Ma;;AAEb,2CAA2C,gCAAgC,oCAAoC,oDAAoD,8DAA8D,iEAAiE,GAAG,kCAAkC;;AAEvU,iCAAiC,gBAAgB,sBAAsB,OAAO,uDAAuD,aAAa,uDAAuD,4CAA4C,KAAK,6CAA6C,6EAA6E,OAAO,iDAAiD,mFAAmF,OAAO;;AAEtgB,4CAA4C,kBAAkB,kCAAkC,oEAAoE,KAAK,OAAO,oBAAoB;;AAEpM,kDAAkD,0CAA0C;;AAE5F,4CAA4C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD;;AAE/P,8DAA8D,sEAAsE,8DAA8D;;AAElM,eAAe,mBAAO,CAAC,8CAAQ;AAC/B;;AAEA,gBAAgB,mBAAO,CAAC,mBAAM;AAC9B;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kDAAkD;AAClD;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,0DAA0D;AAC1D;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,MAAM;;AAEN,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,MAAM;;AAEN,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,0CAA0C;AAC1C;;AAEA;AACA;AACA;AACA,2CAA2C;AAC3C,YAAY;AACZ;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;;AAEN,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,2CAA2C;AAC3C,YAAY;AACZ;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;;AAEN,GAAG;AACH;AACA;AACA,2CAA2C;AAC3C;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,GAAG;;AAEH;AACA,CAAC,G;;;;;;;;;;;;ACjNY,CAAC;;AAEd;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA,QAAQ,OAAO;AACf,QAAQ;AACR;AACA,QAAQ,OAAO;AACf;AACA;;AAEA;AACA,IAAI;AACJ;;;AAGA;AACA;AACA,IAAI;;;AAGJ;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ,OAAO;AACf,QAAQ;AACR;AACA,QAAQ,OAAO;AACf,QAAQ;AACR,QAAQ,OAAO;AACf;AACA,MAAM;AACN,MAAM,OAAO;AACb;AACA,MAAM;AACN,MAAM,OAAO;AACb;AACA,GAAG;;AAEH;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wFAAwF;AACxF;;AAEA;AACA;AACA;AACA;AACA,E;;;;;;;;;;;ACxGA;AACA;AACa;;AAEb,iCAAiC,+HAA2D;;AAE5F;AACA;AACA;AACA;AACA;;AAEA,wEAAwE,aAAa;AACrF;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,gCAAgC;AAChC,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qB;;;;;;;;;;ACvGA;AACA;AACA;;;;;;;;;;;;ACFA;AACA;AACa;;AAEb;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qBAAqB,oGAAgC;AACrD;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,+BAA+B,mBAAO,CAAC,6FAAiB;AACxD;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,yEAAyE,aAAa;AACtF;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;;AAEA,0B;;;;;;;;;;;AChGa;;AAEb,4BAA4B,0HAAsD;;AAElF;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,IAAI;;;AAGJ;AACA;;AAEA;AACA;AACA,E;;;;;;;;;;AC1BA,kGAA+C;;;;;;;;;;;ACA/C,UAAU,+HAAqD;AAC/D,cAAc;AACd,gBAAgB;AAChB,iIAAuD;AACvD,2HAAmD;AACnD,oIAAyD;AACzD,0IAA6D;AAC7D,6JAAqE;AACrE,mJAAgE;;;;;;;;;;;ACRhE;AACA,cAAc;AACd,cAAc;AACd,sGAAyC;;AAEzC,cAAc,mBAAO,CAAC,kDAAO;AAC7B,gBAAgB,mBAAO,CAAC,kDAAU;AAClC,4BAA4B,mBAAO,CAAC,wDAAa;AACjD,aAAa,mBAAO,CAAC,qDAAM;AAC3B,wBAAwB,mBAAO,CAAC,sEAAoB;AACpD,oBAAoB,mBAAO,CAAC,8DAAa;;AAEzC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,0BAA0B,QAAQ,cAAc,4BAA4B,uBAAuB,QAAQ;AAC3G;AACA;;AAEA;;AAEA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA,+CAA+C,UAAU;AACzD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uCAAuC,UAAU;AACjD;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,gCAAgC,UAAU;AAC1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wDAAwD,aAAa,QAAQ,mBAAmB;AAChG;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA,4BAA4B,qBAAqB;AACjD;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA,+CAA+C,QAAQ;AACvD;AACA;AACA;;AAEA;AACA,2CAA2C,UAAU,KAAK,YAAY;AACtE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB;AACxB,wBAAwB;AACxB,wBAAwB;AACxB,wBAAwB;AACxB,yBAAyB;AACzB;AACA,wBAAwB;AACxB,0BAA0B;AAC1B,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;;;;;;;;;;;AC9YY;AACZ,aAAa,0EAAwB;AACrC,eAAe,mBAAO,CAAC,6DAAU;AACjC,eAAe,mBAAO,CAAC,oDAAW;;AAElC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,kBAAkB,QAAQ;;AAE1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;AClKA;AACA;;AAEA,uBAAuB,mBAAO,CAAC,gEAAiB;;AAEhD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,4CAA4C,wBAAwB;AACpE,QAAQ;AACR;AACA;AACA,4CAA4C,wBAAwB;AACpE;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,0CAA0C,wBAAwB;AAClE;AACA;AACA,KAAK;AACL,IAAI;AACJ;AACA;AACA,oCAAoC,sBAAsB;AAC1D;AACA;AACA,KAAK;AACL;;AAEA;AACA;;;;;;;;;;;ACrEA;AACA;;AAEA,uBAAuB,mBAAO,CAAC,gEAAiB;;AAEhD;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,0CAA0C,wBAAwB;AAClE,KAAK;AACL,IAAI;AACJ;AACA;AACA,oCAAoC,sBAAsB;AAC1D,KAAK;AACL;;AAEA;AACA;;;;;;;;;;;;AClDA;AACA,IAAI,IAAyD;AAC7D;AACA,MAAM,EAKsB;AAC5B,CAAC;AACD,qCAAqC;AACrC;AACA;AACA;AACA;AACA,mBAAmB,8BAAmB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0EAA0E,8BAAmB;AAC7F;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,8BAAmB;AAC7B;AACA;AACA,UAAU,8BAAmB;AAC7B;AACA;AACA,UAAU,8BAAmB;AAC7B,eAAe,8BAAmB;AAClC;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA,UAAU,8BAAmB;AAC7B;AACA,oCAAoC,4BAA4B;AAChE,0CAA0C;AAC1C,WAAW,8BAAmB;AAC9B;AACA;AACA;AACA;AACA,UAAU,8BAAmB,kCAAkC;AAC/D;AACA;AACA,UAAU,8BAAmB;AAC7B;AACA;AACA,iBAAiB,8BAAmB,CAAC,8BAAmB;AACxD,UAAU;AACV;AACA;AACA;AACA,iCAAiC,+BAAmB;;AAEpD,kDAAkD,0CAA0C;;AAE5F;;AAEA,gBAAgB,+BAAmB;;AAEnC,eAAe,+BAAmB;AAClC;AACA;;AAEA,WAAW,+BAAmB;;AAE9B;AACA;AACA;AACA,iBAAiB,cAAc;AAC/B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,gBAAgB;AAC/C;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,wBAAwB,IAAI;AAC7D;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,0BAA0B,iCAAiC;AAC3D;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,CAAC;;AAED;AACA;;AAEA,OAAO;AACP;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,gBAAgB,SAAS;AACzB;AACA;;AAEA;AACA;AACA;AACA,mBAAmB,iBAAiB;AACpC;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,OAAO;AACvB,IAAI;AACJ,uBAAuB,OAAO;AAC9B;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAO;AACP;AACA,iCAAiC,gCAAmB;;AAEpD;;AAEA;AACA,cAAc,gCAAmB;;AAEjC;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,oBAAoB;AAC/C,QAAQ;AACR,2BAA2B,yBAAyB;AACpD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,OAAO;AACP;AACA,iCAAiC,gCAAmB;;AAEpD;;AAEA,WAAW,gCAAmB;AAC9B,YAAY,gCAAmB;AAC/B,iBAAiB,gCAAmB;AACpC,gBAAgB,gCAAmB;;AAEnC,eAAe,gCAAmB;AAClC;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA,OAAO;AACP;AACA,iCAAiC,gCAAmB;;AAEpD;AACA;AACA;;AAEA;AACA,mBAAmB,gCAAmB;;AAEtC;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,2EAA2E,gCAAmB;;AAE9F;AACA;;AAEA;AACA;AACA;;AAEA;AACA,UAAU,gCAAmB;;AAE7B;AACA,UAAU,gCAAmB;;AAE7B;AACA,UAAU,gCAAmB,uBAAuB;;AAEpD;AACA,UAAU,gCAAmB;AAC7B,gBAAgB,gCAAmB;AACnC;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;;AAEA;AACA,UAAU,gCAAmB;AAC7B,2DAA2D,aAAa;AACxE;;AAEA;AACA,UAAU,gCAAmB;AAC7B;AACA,sCAAsC,4BAA4B;AAClE,4CAA4C;AAC5C,YAAY,gCAAmB;AAC/B;AACA;;AAEA;AACA,UAAU,gCAAmB,kCAAkC;;AAE/D;AACA,UAAU,gCAAmB;;AAE7B;AACA,UAAU,gCAAmB,sBAAsB,OAAO,aAAa;;AAEvE,UAAU,gCAAmB,CAAC,gCAAmB;AACjD;AACA;;AAEA;AACA;;AAEA;AACA;AACA,6CAA6C;AAC7C;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,0BAA0B,gCAAmB;AAC7C;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,mBAAmB;AACvC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,2BAA2B;AACjD;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,UAAU,gCAAmB;AAC7B;;AAEA,wCAAwC,6BAA6B;;AAErE;;AAEA,qDAAqD,qBAAqB;AAC1E;AACA;AACA;AACA;AACA;AACA,sFAAsF,uCAAuC;AAC7H,sIAAsI,gDAAgD,wEAAwE,gBAAgB,EAAE;AAChR,GAAG;;AAEH,4GAA4G,6CAA6C,qEAAqE,gBAAgB,QAAQ;;AAEtP,sCAAsC,yBAAyB;AAC/D,sBAAsB;;AAEtB;;AAEA;AACA;AACA;;AAEA;AACA;;;AAGA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,2BAA2B;AACnD;AACA;AACA;AACA;AACA;AACA,4BAA4B,kBAAkB;AAC9C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC,gCAAgC;AACzE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC,iCAAiC;AAC1E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,iCAAiC;AAC3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,iCAAiC;AAC3E;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;;AAEA,OAAO;AACP;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,OAAO;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,OAAO;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,OAAO;AAC1B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,OAAO;AACP;AACA,iCAAiC,gCAAmB;;AAEpD,iCAAiC,2CAA2C,gBAAgB,kBAAkB,OAAO,2BAA2B,wDAAwD,gCAAgC,uDAAuD,+DAA+D,yDAAyD,qEAAqE,6DAA6D,wBAAwB;;AAEjjB,kDAAkD,0CAA0C;;AAE5F;;AAEA,YAAY,gCAAmB;;AAE/B,eAAe,gCAAmB;AAClC;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,GAAG;;AAEH;AACA,CAAC;;AAED;AACA;AACA;;AAEA,OAAO;AACP;AACA,CAAC,E;;;;;;;;;;;;;;;AC36BD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA,iEAAe,QAAQ,EAAC;;;;;;;;;;;ACrBxB;AACA;AACA,aAAa,mBAAO,CAAC,8CAAQ;AAC7B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;AACA;AACA,EAAE,cAAc;AAChB;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AChEA;;AAEY;;AAEZ,aAAa,mBAAO,CAAC,8CAAQ;AAC7B;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,6BAA6B,OAAO;AACpC,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;AC5EA,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,uBAAuB,gBAAgB;AACvC;AACA;;AAEA,oBAAoB,eAAe;AACnC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;AChFA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,cAAc,mBAAO,CAAC,2CAAO;AAC7B,eAAe,mBAAO,CAAC,6CAAQ;AAC/B,iBAAiB,mBAAO,CAAC,iDAAU;AACnC,iBAAiB,mBAAO,CAAC,iDAAU;AACnC,iBAAiB,mBAAO,CAAC,iDAAU;AACnC,iBAAiB,mBAAO,CAAC,iDAAU;;;;;;;;;;;ACdnC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,mBAAO,CAAC,6DAAU;AACjC,WAAW,mBAAO,CAAC,6CAAQ;AAC3B,aAAa,oFAA6B;;AAE1C;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B,SAAS,QAAQ;;AAEjB,kBAAkB,QAAQ;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;AC7FA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,mBAAO,CAAC,6DAAU;AACjC,WAAW,mBAAO,CAAC,6CAAQ;AAC3B,aAAa,oFAA6B;;AAE1C;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B,SAAS,QAAQ;;AAEjB,kBAAkB,QAAQ;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;AClGA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,mBAAO,CAAC,6DAAU;AACjC,aAAa,mBAAO,CAAC,iDAAU;AAC/B,WAAW,mBAAO,CAAC,6CAAQ;AAC3B,aAAa,oFAA6B;;AAE1C;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;ACpDA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,eAAe,mBAAO,CAAC,6DAAU;AACjC,WAAW,mBAAO,CAAC,6CAAQ;AAC3B,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B,SAAS,QAAQ;;AAEjB,kBAAkB,QAAQ;AAC1B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;ACtIA,eAAe,mBAAO,CAAC,6DAAU;AACjC,aAAa,mBAAO,CAAC,iDAAU;AAC/B,WAAW,mBAAO,CAAC,6CAAQ;AAC3B,aAAa,oFAA6B;;AAE1C;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;ACxDA,eAAe,mBAAO,CAAC,6DAAU;AACjC,WAAW,mBAAO,CAAC,6CAAQ;AAC3B,aAAa,oFAA6B;;AAE1C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,kBAAkB,QAAQ;AAC1B;AACA;AACA;AACA,SAAS,SAAS;AAClB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,SAAS;AAC3B;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;;;;;;;;;;;ACnQA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA,qBAAqB,MAAM;AAC3B;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;;;;;;;;;;;;ACdA;AACA;;AAEA,eAAe,mBAAO,CAAC,4DAAe;AACtC,2BAA2B,mBAAO,CAAC,kCAAqB;AACxD,aAAa,mBAAO,CAAC,iDAAM;AAC3B,cAAc,mBAAO,CAAC,uDAAO;AAC7B,aAAa,mBAAO,CAAC,yCAAM;AAC3B,oBAAoB,mBAAO,CAAC,wDAAa;AACzC,YAAY,mBAAO,CAAC,sCAAK;;AAEzB;;AAEA;AACA,yBAAyB,kBAAkB,+BAA+B,YAAY;AACtF;;AAEA;AACA,YAAY,uCAAuC;AACnD;AACA;AACA,+BAA+B,sCAAsC;AACrE;;AAEA,oBAAoB;AACpB;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA;AACA;AACA,0DAA0D,MAAM;AAChE;AACA;AACA,oBAAoB;;AAEpB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,+CAA+C;AAC/C;;AAEA;AACA;AACA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;;AAEA,CAAC;AACD;AACA,2CAA2C;AAC3C,qCAAqC,8BAA8B;AACnE;AACA,CAAC;;;;;;;;;;;;ACnGD;AACA,cAAc,mBAAO,CAAC,kDAAO;AAC7B,sBAAsB,mBAAO,CAAC,gEAAiB;AAC/C,oBAAoB,mBAAO,CAAC,0DAAa;AACzC,eAAe,mBAAO,CAAC,2EAAiB;AACxC,uBAAuB,mBAAO,CAAC,gEAAiB;AAChD,gBAAgB,mBAAO,CAAC,kDAAU;AAClC,QAAQ,SAAS,EAAE,mBAAO,CAAC,8CAAQ;;AAEnC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,EAAE,OAAO;AACT;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,kCAAkC;AAClC;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,aAAa;AACb;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW;AACX;;AAEA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA,aAAa,gDAAgD;AAC7D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN,4BAA4B;AAC5B;AACA,8BAA8B;AAC9B,OAAO;AACP;AACA;;AAEA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,aAAa,kBAAkB;AAC/B,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA,aAAa,kBAAkB;AAC/B,aAAa,kBAAkB;AAC/B,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA,aAAa,kBAAkB;AAC/B,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,aAAa;AAC1B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA,2BAA2B;AAC3B;AACA,SAAS;AACT;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA,8BAA8B;AAC9B;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;;AAEA;AACA;AACA;;AAEA;;AAEA,2BAA2B;AAC3B;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;;AAEV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,0CAA0C,eAAe,EAAE,eAAe,GAAG,aAAa,GAAG,YAAY;AACzG;AACA;;AAEA;AACA;AACA;AACA,gDAAgD;AAChD;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA,SAAS;;AAET;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,OAAO;;AAEP;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;AACP;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;;;;;;;;;;AC3hCA;;AAEA,cAAc,mBAAO,CAAC,iDAAO;AAC7B,wBAAwB,mBAAO,CAAC,4EAAqB;;AAErD;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,eAAe;AACjC;AACA,GAAG;AACH,EAAE,cAAc;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,kBAAkB,eAAe;AACjC;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA,kBAAkB,OAAO;AACzB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,OAAO;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB;;;;;;;;;;;AC3EnB,cAAc,mBAAO,CAAC,iDAAO;;AAE7B;AACA;AACA;;AAEA;AACA;AACA;AACA,WAAW;;AAEX;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,uBAAuB,2BAA2B;AAClD;AACA;;AAEA;;;;;;;;;;;;AChCA;AACA;;AAEA,cAAc,mBAAO,CAAC,kDAAO;AAC7B,oBAAoB,mBAAO,CAAC,0DAAa;AACzC,eAAe,mBAAO,CAAC,2EAAiB;AACxC,uBAAuB,mBAAO,CAAC,gEAAiB;AAChD,WAAW,mBAAO,CAAC,iBAAI;;AAEvB;;AAEA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,SAAS;AACpB,WAAW,SAAS;AACpB;AACA;AACA,wBAAwB;AACxB;AACA;AACA,eAAe;AACf;;AAEA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,UAAU;AACV;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,aAAa,sDAAsD;AACnE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,4CAA4C,MAAM;AAClD;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kDAAkD,SAAS;AAC3D;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;;;;;;;;;;AClQA,iBAAiB,mBAAO,CAAC,oEAAgB;AACzC,sBAAsB,mBAAO,CAAC,gFAAsB;;AAEpD;AACA;AACA;AACA;;;;;;;;;;;ACNA,QAAQ,cAAc,EAAE,mBAAO,CAAC,gDAAS;AACzC,iBAAiB,mBAAO,CAAC,gEAAY;;AAErC;AACA,wBAAwB;AACxB;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,qBAAqB;AACrB;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;AC1FA,QAAQ,eAAe,EAAE,mBAAO,CAAC,+CAAQ;AACzC,QAAQ,YAAY,EAAE,mBAAO,CAAC,gDAAS;AACvC,QAAQ,OAAO,EAAE,mBAAO,CAAC,0DAAS;;AAElC;AACA,wBAAwB;AACxB;;AAEA;;AAEA,mCAAmC;;AAEnC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;;AAEJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA,sBAAsB,mBAAO,CAAC,4EAAkB;;;;;;;;;;;AC9IhD;AACA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;ACNA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;;;;;;;;;;ACtCA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA,SAAS,iFAA8B;AACvC,eAAe,mBAAO,CAAC,6DAAU;;AAEjC;AACA,kBAAkB,mBAAO,CAAC,uGAAyC;AACnE,kBAAkB,mBAAO,CAAC,uGAAyC;AACnE,gBAAgB,mBAAO,CAAC,mGAAuC;AAC/D,mBAAmB,mBAAO,CAAC,yGAA0C;AACrE,qBAAqB,mBAAO,CAAC,6GAA4C;AACzE,kBAAkB,mBAAO,CAAC,mIAAuD;AACjF,kBAAkB,mBAAO,CAAC,yHAAkD;;AAE5E;AACA;;;;AAIA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;;;;;;;;;;AChIA,oBAAoB,mBAAO,CAAC,gEAAe;AAC3C,eAAe,mBAAO,CAAC,kEAAgB;AACvC,aAAa,mBAAO,CAAC,gDAAO;AAC5B,kBAAkB,mBAAO,CAAC,4EAAsB;AAChD,UAAU,mBAAO,CAAC,sCAAK;;AAEvB;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,uBAAuB,qBAAM;;AAE7B;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,C;;;;;;;;;;ACpFA,aAAa,cAAc,qBAAM,sBAAsB,qBAAM;;AAE7D,sBAAsB,cAAc,qBAAM;;AAE1C,uBAAuB,cAAc,qBAAM;;AAE3C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,KAAK,qBAAM;AACX,YAAY,qBAAM;AAClB;AACA;AACA;AACA;AACA,mBAAmB,qBAAM;AACzB,IAAI;AACJ;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA,gBAAgB;AAChB,6BAA6B;;AAE7B;AACA;AACA,wBAAwB;;AAExB;AACA;AACA;;AAEA;;;;;;;;;;;;;AC1DA,iBAAiB,mBAAO,CAAC,kEAAc;AACvC,eAAe,mBAAO,CAAC,6DAAU;AACjC,eAAe,mBAAO,CAAC,8DAAY;AACnC,aAAa,mBAAO,CAAC,2EAAiB;;AAEtC;AACA;;AAEA;AACA;AACA;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,6CAA6C,MAAM;AACnD;AACA;AACA,EAAE;;AAEF;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,EAAE;AACF;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,mDAAmD;AACnD,SAAS;AACT;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ,IAAI;AACJ;AACA;AACA,EAAE;;AAEF;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,uBAAuB,qBAAM;AAC7B;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA,EAAE,qBAAM;AACR;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA,GAAG;AACH,GAAG;AACH,4BAA4B,qBAAM;AAClC;AACA;AACA,IAAI;AACJ,GAAG,OAAO;AACV;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,qCAAqC;;AAErC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ,GAAG,OAAO;AACV;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,EAAE;;AAEF;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA,CAAC,qBAAM;AACP;;AAEA;AACA,EAAE,qBAAM;AACR;AACA,GAAG;AACH,sBAAsB,qBAAM;AAC5B;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;;AC/VA,iBAAiB,mBAAO,CAAC,kEAAc;AACvC,eAAe,mBAAO,CAAC,6DAAU;AACjC,aAAa,mBAAO,CAAC,2EAAiB;;AAEtC,cAAc,mBAAmB;AACjC;AACA;AACA;AACA;AACA;AACA;;AAEA,sBAAsB,uBAAuB;AAC7C;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,EAAE,OAAO;AACT;AACA,GAAG;AACH,EAAE;;AAEF;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,kBAAkB,MAAM;AAChC;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,IAAI;;AAEJ;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,KAAK,aAAa;AAClB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc,MAAM;AACpB;AACA,IAAI;AACJ;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA,wCAAwC,eAAe,IAAI;AAC3D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,MAAM;AACxB,qBAAqB,oBAAoB;AACzC;;AAEA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA,aAAa,MAAM;AACnB;AACA;AACA;AACA;AACA;AACA,oBAAoB,qBAAM;AAC1B;AACA;AACA,eAAe,MAAM;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;AClNA;AACA;;AAEA,gBAAgB,mBAAO,CAAC,8DAAgB;;AAExC;AACA;AACA;AACA;AACA;;;;;;;;;;;ACTA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+BAA+B,gBAAgB;AAC/C;AACA;AACA,OAAO;AACP;AACA,GAAG;AACH;;;;;;;;;;;;ACrBA;AACA,WAAW,mBAAO,CAAC,yCAAM;;AAEzB;AACA;AACA,YAAY,MAAM;AAClB;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,6BAA6B,eAAe;AAC5C;AACA;;;;;;;;;;;ACdA,QAAQ,eAAe,EAAE,mBAAO,CAAC,+CAAQ;AACzC;AACA;;AAEA,kBAAkB,mBAAO,CAAC,gEAAY;AACtC,aAAa,mBAAO,CAAC,oDAAW;;AAEhC;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA,yBAAyB,iFAAiF,IAAI;AAC9G;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yBAAyB,iFAAiF,IAAI;AAC9G;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA,oBAAoB,oBAAoB;AACxC;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA,gCAAgC,aAAa;AAC7C;AACA;;AAEA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,4BAA4B,kCAAkC;AAC9D;AACA;;AAEA;AACA;AACA;AACA,8DAA8D,8BAA8B;AAC5F;AACA;AACA,yBAAyB,8BAA8B;AACvD,SAAS;AACT,OAAO;AACP;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA,gCAAgC;AAChC;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,GAAG;AACH;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA,kBAAkB,gBAAgB;AAClC;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,8BAA8B,YAAY;AAC1C,8BAA8B,sBAAsB;AACpD;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC19BA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb;;AAEA,aAAa,oFAA6B;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,qBAAqB;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,6BAA6B,sCAAsC,sCAAsC;AACzG;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,C;;;;;;;;;;ACvSA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,aAAa,mBAAO,CAAC,4EAAc;;AAEnC,cAAc;AACd,cAAc;;;;;;;;;;;;;ACzBd;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,cAAc;AACd,QAAQ,MAAM;AACd,iBAAiB,MAAM;AACvB;AACA;AACA;AACA;AACA;AACA,sBAAsB,MAAM;;AAE5B;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,eAAe,oBAAoB;AACnC,2BAA2B;AAC3B;;AAEA;AACA;;AAEA,cAAc;AACd;AACA;AACA;AACA;AACA,QAAQ,MAAM;AACd,mBAAmB,MAAM;AACzB;AACA,sBAAsB,MAAM;;AAE5B;AACA;AACA,mBAAmB,oBAAoB;AACvC,8BAA8B;AAC9B;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;;AAEA;AACA;AACA,UAAU;AACV;AACA;AACA;;AAEA;AACA;;;;;;;;;;;AC/HA,aAAa,0EAAwB;;AAErC;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,kBAAkB,SAAS;AAC3B;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;;;;;;;;;;;;AC1BA;AACA,cAAc,mBAAO,CAAC,kDAAO;AAC7B,YAAY,mBAAO,CAAC,oCAAuB;AAC3C,qBAAqB,iFAA8B;AACnD,iBAAiB,mBAAO,CAAC,0DAAc;AACvC,gBAAgB,mBAAO,CAAC,8EAA2B;AACnD,YAAY,mBAAO,CAAC,6BAAgB;;AAEpC;AACA;AACA;;AAEA;AACA;AACA,SAAS,OAAO;;AAEhB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B,UAAU,GAAG,UAAU;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN,0CAA0C;AAC1C;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,iCAAiC;AACjC;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,KAAK;AACL;;AAEA;AACA,iCAAiC;AACjC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC7NA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,YAAY;AAChC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,MAAM;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,+CAA+C,qBAAqB;;AAEpE;;;;;;;;;;;;AC1GA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,mBAAmB,wFAA+B;;AAElD;AACA;AACA;AACA,cAAc,MAAM;AACpB;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA,WAAW,MAAM;AACjB;AACA;;;;;;;;;;;ACxBA,kBAAkB,mBAAO,CAAC,0DAAc;;AAExC;;AAEA,sBAAsB;AACtB;AACA;;AAEA,cAAc;AACd;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,cAAc;AACd;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB;AACpB,oBAAoB;;;;;;;;;;;AC9BpB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;ACXA;AACA,CAAC;;AAED;AACA,mBAAmB,KAA0B;AAC7C;AACA,kBAAkB,KAAyB;AAC3C;AACA,yBAAyB,qBAAM,gBAAgB,qBAAM;AACrD;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,EAAE;;AAEF;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,cAAc,OAAO;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY,OAAO;AACnB,YAAY,UAAU;AACtB;AACA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,YAAY,UAAU;AACtB;AACA,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,cAAc,OAAO;AACrB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC;AACtC;AACA,MAAM;AACN,6BAA6B;AAC7B;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY,OAAO;AACnB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,cAAc,QAAQ;AACtB;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,gCAAgC,mCAAmC;AACnE;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,cAAc,WAAW;AACzB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,yBAAyB;;AAEzB,0CAA0C,qBAAqB;;AAE/D;AACA;AACA;AACA;AACA;AACA,mCAAmC,oBAAoB;;AAEvD;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,cAAc,iBAAiB;AAC/B;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,2BAA2B,iBAAiB;AAC5C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA,eAAe,iBAAiB;AAChC;;AAEA;AACA;AACA;;AAEA;AACA;AACA,+BAA+B,oBAAoB;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB;AACA,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,QAAQ;AACpB;AACA,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,EAAE,IAEU;AACZ;AACA,EAAE,mCAAmB;AACrB;AACA,GAAG;AAAA,kGAAC;AACJ,GAAG,KAAK,EAUN;;AAEF,CAAC;;;;;;;;;;;;ACjhBD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEa;;AAEb,eAAe,mBAAO,CAAC,sEAAU;AACjC,WAAW,mBAAO,CAAC,0CAAQ;;AAE3B,aAAa;AACb,eAAe;AACf,qBAAqB;AACrB,cAAc;;AAEd,WAAW;;AAEX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,gBAAgB,KAAK;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA,qCAAqC;AACrC;AACA;AACA,2CAA2C,KAAK;AAChD,0CAA0C,KAAK;AAC/C;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL,kBAAkB,mBAAO,CAAC,wDAAa;;AAEvC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,oCAAoC;AACpC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oBAAoB,4BAA4B;AAChD;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,oBAAoB,yBAAyB;AAC7C;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,4CAA4C,OAAO;AACnD;AACA;AACA;AACA;AACA,2CAA2C,OAAO;AAClD;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,2CAA2C,OAAO;AAClD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;;AAEA;AACA;AACA,GAAG;AACH;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,mBAAmB,mBAAmB;AACtC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qBAAqB,mBAAmB;AACxC;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,iBAAiB;AACvC;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,+BAA+B,QAAQ;AACvC;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA,WAAW,MAAM;AACjB;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AC3tBa;;AAEb;AACA;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;;;;;;;;;;;;ACfA;AACA,QAAQ,eAAe,EAAE,mBAAO,CAAC,+CAAQ;AACzC,gBAAgB,mBAAO,CAAC,oDAAS;AACjC,iBAAiB,mFAA2B;AAC5C,cAAc,mBAAO,CAAC,kDAAO;AAC7B,aAAa,mBAAO,CAAC,0DAAa;;AAElC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,qBAAqB;;AAE9D,UAAU,MAAM;AAChB;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;;AAER;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA;AACA,UAAU,MAAM;AAChB,cAAc,MAAM;AACpB;AACA;AACA;;AAEA;AACA,mBAAmB,oBAAoB;AACvC;;AAEA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;;AAEA;AACA,mBAAmB,oBAAoB;AACvC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;AACA,sBAAsB,MAAM;AAC5B,0BAA0B,yBAAyB;AACnD;AACA;AACA;;AAEA;AACA;AACA,0BAA0B,yBAAyB;AACnD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,yCAAyC,qBAAqB;AAC9D;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;;;;;;;;;;;;AClPA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,UAAU;AACrB,WAAW,QAAQ;AACnB,aAAa,UAAU;AACvB;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR,QAAQ,OAAO;AACf,QAAQ;AACR,QAAQ,OAAO;AACf;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,aAAa;AACb;AACA;;AAEA;AACA;AACA;AACA,SAAS,qBAAM;AACf,IAAI;AACJ;AACA;AACA,YAAY,qBAAM;AAClB;AACA;AACA;;;;;;;;;;;AClEA;AACA;AACA;AACA;AACA;AACA,C;;;;;;;;;;;ACLA;AACA;;AAEa;;AAEb,wBAAwB,mBAAO,CAAC,0DAAc;AAC9C,0BAA0B,mBAAO,CAAC,4EAAuB;AACzD,sBAAsB,mBAAO,CAAC,oEAAmB;AACjD,mBAAmB,mBAAO,CAAC,8DAAgB;;AAE3C;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;AAEA,yBAAyB;AACzB,2BAA2B;AAC3B,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,yBAAyB;;;AAGzB;AACA;AACA;AACA,oBAAoB;;AAEpB;AACA;AACA;AACA,2BAA2B;;AAE3B;AACA;AACA;AACA,qBAAqB;;AAErB;AACA;AACA;AACA,qBAAqB;;AAErB;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA;AACA,oBAAoB;;AAEpB;AACA;AACA;AACA,oBAAoB;;AAEpB;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA,uBAAuB;;AAEvB;AACA;AACA;AACA,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa;;AAEb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,qBAAqB;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,2BAA2B;;AAE3B;AACA;AACA;AACA,uBAAuB;;AAEvB;AACA;AACA;AACA,qBAAqB;;AAErB;AACA;AACA;AACA,qBAAqB;;AAErB;AACA;AACA;AACA,yBAAyB;;AAEzB;AACA;AACA;AACA,mCAAmC;;AAEnC;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA,uBAAuB;;AAEvB;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA,sBAAsB;;AAEtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,CAAC;;;;;;;;;;;;;AC7UD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;;AAEA;AACA,cAAc;AACd;AACA;AACA,oBAAoB,sBAAsB;AAC1C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,GAAG;AACH,wBAAwB,SAAS;AACjC;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA,iBAAiB;AACjB,aAAa,OAAO,oBAAoB,OAAO;AAC/C;AACA;;AAEA;AACA,aAAa,OAAO;AACpB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU,OAAO;AACjB;AACA,QAAQ,SAAS,OAAO;AACxB,QAAQ,OAAO;AACf,QAAQ;AACR,QAAQ,OAAO;AACf;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;;AAEA,IAAI,OAAO;AACX,iBAAiB,OAAO;AACxB,qCAAqC;AACrC;AACA;AACA;AACA;AACA;AACA,gBAAgB;AAChB;AACA;AACA;AACA,gBAAgB,OAAO;AACvB;AACA;AACA,QAAQ,OAAO;AACf;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe;;;AAGf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA;;;AAGA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA,GAAG;;AAEH;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA,4CAA4C,KAAK;;AAEjD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,IAAI;AACJ;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA;AACA;;;AAGA;AACA;AACA,oCAAoC,OAAO;AAC3C;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;AACH;AACA;;;AAGA;AACA;AACA,0DAA0D;AAC1D;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,UAAU;AACV;AACA;AACA,WAAW;AACX;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA,GAAG;;AAEH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;AAGA;AACA;AACA,kGAA0C;;AAE1C;AACA;AACA;AACA,eAAe;;AAEf;AACA;AACA;AACA,iBAAiB;;AAEjB;AACA;AACA;AACA,cAAc;;AAEd;AACA;AACA;AACA,yBAAyB;;AAEzB;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA,mBAAmB;;AAEnB;AACA;AACA;AACA,gBAAgB;AAChB,sBAAsB;;AAEtB;AACA;AACA;AACA,gBAAgB;;AAEhB;AACA;AACA;AACA,cAAc;AACd,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA,eAAe;AACf,2BAA2B;;AAE3B;AACA;AACA;AACA,kBAAkB;;AAElB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB;;AAEnB,kHAAgD;;AAEhD;AACA;AACA;;;AAGA;AACA;AACA;;;AAGA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;;AAGA;AACA,WAAW;AACX,EAAE,OAAO;AACT;;;AAGA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW,UAAU;AACrB;AACA,WAAW,UAAU;AACrB;AACA,qGAAsC;;AAEtC,eAAe;AACf;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA,iBAAiB;AACjB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,oBAAoB,sBAAsB;AAC1C;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,KAAK;;AAEL;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA,wBAAwB;;AAExB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,oBAAoB,sBAAsB;AAC1C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,OAAO,qCAAqC;AACxE,4BAA4B,OAAO,sDAAsD;AACzF;;AAEA;AACA;AACA;AACA;AACA;AACA,mBAAmB;;;;;;;;;;;;AC1sBnB,WAAW,mBAAO,CAAC,4DAAe;AAClC,qBAAqB,mBAAO,CAAC,+CAAQ;AACrC,YAAY,mBAAO,CAAC,sDAAY;AAChC,YAAY,mBAAO,CAAC,kEAAkB;AACtC,yBAAyB,mBAAO,CAAC,sEAAoB;;AAErD;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ,oDAAoD,YAAY;AAChE;AACA;AACA,SAAS;AACT,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,yBAAyB;AAChD;AACA,2BAA2B,UAAU,MAAM;AAC3C,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,uBAAuB,yBAAyB;AAChD;AACA,2BAA2B,UAAU,MAAM;AAC3C,QAAQ;AACR;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;;AAET;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc,MAAM;AACpB;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;AACA,sCAAsC;AACtC;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,SAAS;AACT;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,OAAO;AACP;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA,mDAAmD;;AAEnD;;AAEA;AACA;AACA,uCAAuC,uCAAuC;AAC9E;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,QAAQ;AACR;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,8BAA8B,gBAAgB;AAC9C;AACA,+CAA+C;AAC/C;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;;;;;;;;;;;AC3dA,4BAA4B,mBAAO,CAAC,wDAAa;AACjD,aAAa,mBAAO,CAAC,0CAAM;;AAE3B,mBAAmB,mBAAO,CAAC,gEAAe;;AAE1C,gDAAgD;AAChD;AACA,IAAI,OAAO;AACX;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA,4BAA4B;AAC5B;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,OAAO;;AAEP;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,KAAK;AACL,GAAG;AACH;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;;AAEA;;;;;;;;;;;;;;;;;;;;;;;;;AC7HA;AACmC;AACgC;AAClB;AACQ;AACzB;AAChC;AACA;AACA;AACe,+BAA+B,mDAAU;AACxD,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kDAAkD,QAAQ;AAC1D;AACA;AACA;AACA;AACA,MAAM;AACN,kDAAkD,OAAO;AACzD;AACA,OAAO;AACP;AACA;AACA,UAAU;AACV;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,2CAA2C;AAC3C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iBAAiB;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,WAAW;AACX;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA,oFAAoF,qDAAqD;AACzI,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2DAA2D,QAAQ;AACnE;AACA;AACA;AACA;AACA;AACA,kBAAkB;AAClB;AACA,kBAAkB;AAClB;AACA,kBAAkB;AAClB;AACA;AACA,eAAe;AACf;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA,UAAU;AACV;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,sCAAsC,IAAI;AAC1C;AACA;AACA;AACA;AACA,MAAM;AACN,4FAA4F,qBAAqB;AACjH,MAAM;AACN;AACA;AACA;AACA,4KAA4K,uDAAuD;AACnO;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,OAAO;AACP;AACA,qCAAqC,mBAAmB;AACxD;AACA,uCAAuC,8DAAc;AACrD;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,oBAAoB;AACpB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,wBAAwB;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,yFAAyF;AAC5H,QAAQ;AACR,4BAA4B,oDAAoD;AAChF;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mCAAmC,yFAAyF;AAC5H,QAAQ;AACR,4BAA4B,oDAAoD;AAChF;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,mBAAmB,iDAAI,GAAG,cAAc;AACxC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,sCAAsC,MAAM;AAC5C;AACA;AACA;AACA,+DAA+D,MAAM;AACrE;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,kBAAkB,kBAAkB;AACpC;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,0FAA0F;AAC1F;AACA,YAAY;AACZ;AACA,oBAAoB,kBAAkB;AACtC;AACA;AACA;AACA;AACA;AACA;AACA,gBAAgB,OAAO;AACvB;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA,8CAA8C,cAAc;AAC5D;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,6BAA6B,oDAAoD;AACjF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,6IAA6I;AAC7I;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,QAAQ,OAAO;AACf;AACA;AACA;AACA;AACA;AACA,IAAI,OAAO;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sBAAsB,KAAK;AAC3B;AACA,0CAA0C,KAAK,GAAG,6BAA6B,aAAa,KAAK,GAAG,SAAS;AAC7G;AACA;AACA,+CAA+C,KAAK,GAAG,6BAA6B,aAAa,KAAK,GAAG,SAAS;AAClH;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;AACA;AACA,mCAAmC;AACnC,+EAA+E,qBAAqB;AACpG,YAAY;AACZ,8EAA8E,qBAAqB;AACnG;AACA,SAAS;AACT;AACA;AACA,kCAAkC,sBAAsB,sBAAsB,wBAAwB;AACtG;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,qBAAqB,CAAE;AACvB;AACA;AACA,qCAAqC;AACrC;AACA;AACA,yBAAyB,8DAAc;AACvC;AACA;AACA,UAAU,OAAO;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,QAAQ,OAAO;AACf;AACA,QAAQ;AACR;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,qCAAqC,8DAAc;AACnD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA,OAAO;AACP;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,mFAAmF,qBAAqB;AACxG;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yCAAyC,kEAAgB;AACzD;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,KAAK,cAAc,KAAK;AACzD;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA,gDAAgD,EAAE;AAClD,gDAAgD,EAAE;AAClD;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2CAA2C;AAC3C,+EAA+E,qBAAqB;AACpG,kBAAkB;AAClB,8EAA8E,qBAAqB;AACnG;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,iCAAiC,wBAAwB;AACzD;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,mCAAmC,IAAI;AACvC;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA,iCAAiC,0CAA0C;AAC3E;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,MAAM;AACN;AACA;AACA;AACA;AACA,eAAe,2DAAgB;AAC/B;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa,2DAAgB;AAC7B;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;;;;;;;;;;;;;;;ACnoCA;AACA;AACA;AACA,GAAG;AACH;;AAEA;AACA,aAAa,yBAAyB;AACtC,cAAc,aAAa;AAC3B;;AAEe;AACf;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA,2BAA2B;AAC3B,UAAU,gCAAgC;;AAE1C,UAAU,eAAe;AACzB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;;AAEL;;AAEA,eAAe,KAAK;AACpB,qBAAqB;;AAErB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL,8CAA8C,yBAAyB;;AAEvE;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO,IAAI,uBAAuB;AAClC,KAAK;;AAEL,2CAA2C,WAAW;AACtD,wBAAwB,WAAW;AACnC,KAAK,IAAI,WAAW;;AAEpB;;AAEA,6BAA6B;;AAE7B;AACA;AACA;AACA;AACA;AACA;AACA;AACA,eAAe,kCAAkC;AACjD,QAAQ;AACR;AACA;AACA;AACA,eAAe,aAAa;AAC5B;AACA,KAAK,IAAI,WAAW;;AAEpB,gCAAgC,MAAM;AACtC,cAAc,yBAAyB;;AAEvC;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,qCAAqC,kBAAkB;AACvD;AACA;AACA,UAAU;AACV;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA;AACA,iBAAiB,kCAAkC;AACnD;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA,2DAA2D,WAAW;AACtE;AACA;AACA;;;;;;;;;;;;ACpIA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,2BAA2B;AAC3B;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,qLAAqL;AACrL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,+CAA+C;AAC/C;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,mJAAmJ;AACnJ;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,UAAU,OAAO;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B,OAAO;AACnC;AACA;AACA;AACA;AACA,IAAI,OAAO;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA;AACA,YAAY,4BAA4B;AACxC;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU,OAAO;AACjB;AACA,UAAU;AACV,UAAU,OAAO;AACjB,wBAAwB;AACxB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN,MAAM,OAAO;AACb,MAAM;AACN;AACA;AACA,MAAM;AACN,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,OAAO;AACf;AACA;AACA;AACA;AACA,QAAQ,OAAO;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,QAAQ;AACR,+BAA+B,OAAO;AACtC;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,yBAAyB,wBAAwB;AACjD;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,4BAA4B;AAC5B;AACA;AACA;AACA;AACA,UAAU,OAAO;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,wBAAwB,wBAAwB;AAChD;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,OAAO,qIAAqI;AACpJ,QAAQ;AACR,QAAQ,OAAO,OAAO,qJAAqJ;AAC3K;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM,OAAO,OAAO,oJAAoJ;AACxK;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;AACA;AACA,aAAa;AACb;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,UAAU;AACV;AACA;AACA;AACA,WAAW;AACX;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,OAAO;AACf;AACA;AACA;AACA,QAAQ,OAAO;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,UAAU,OAAO;AACjB;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ,OAAO;AACf;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,mCAAmC;AACnC;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA;AACA,IAAI,IAA6B;AACjC;AACA;;;;;;;;;;;;;AC1zBA;AACA;AACA;;AAEA,QAAQ,eAAe,EAAE,mBAAO,CAAC,+CAAQ;AACzC,eAAe,mBAAO,CAAC,4DAAe;AACtC,sBAAsB,mBAAO,CAAC,8DAAgB;AAC9C,cAAc,mBAAO,CAAC,kDAAO;AAC7B,YAAY,mBAAO,CAAC,oCAAuB;AAC3C,kBAAkB,mBAAO,CAAC,0BAAa;AACvC,iBAAiB,mBAAO,CAAC,0DAAc;AACvC,qBAAqB,mBAAO,CAAC,4DAAe;AAC5C,aAAa,mBAAO,CAAC,qDAAM;AAC3B,aAAa,mBAAO,CAAC,wDAAa;AAClC,uBAAuB,mBAAO,CAAC,gEAAiB;AAChD,oBAAoB,mBAAO,CAAC,0DAAa;AACzC,aAAa,mBAAO,CAAC,0DAAa;AAClC,oBAAoB,mBAAO,CAAC,wDAAa;AACzC,QAAQ,gBAAgB,EAAE,mBAAO,CAAC,4DAAe;;AAEjD,iBAAiB,mBAAO,CAAC,8BAAiB;AAC1C,gBAAgB,mBAAO,CAAC,+DAAe;AACvC,gBAAgB,2FAAiC;;AAEjD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,QAAQ;AACrC;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,6BAA6B,YAAY;;AAEzC;AACA;AACA,WAAW,SAAS;AACpB;AACA;AACA,wBAAwB;AACxB;;AAEA;AACA;AACA,MAAM,SAAS,MAAM;AACrB;AACA,MAAM;AACN,oBAAoB,MAAM;AAC1B;AACA,wBAAwB,MAAM;;AAE9B;AACA;AACA,MAAM,SAAS,MAAM;AACrB;AACA,MAAM;AACN;AACA;AACA,wBAAwB,MAAM;;AAE9B;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,MAAM,2FAAkC;AACxC;;AAEA;AACA;AACA;AACA;;AAEA;AACA,gCAAgC,2EAA2E;AAC3G,8BAA8B,uEAAuE;AACrG;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;;AAEA;AACA;AACA,yCAAyC,IAAI,qBAAqB;;AAElE;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA,OAAO;;AAEP;AACA;;AAEA;AACA,MAAM;AACN;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,sCAAsC,SAAS;AAC/C;AACA,OAAO;AACP,wBAAwB,OAAO,oCAAoC,YAAY;AAC/E;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc,eAAe;AAC7B,aAAa,WAAW;AACxB,cAAc;AACd;AACA,uCAAuC;AACvC;AACA;AACA;;AAEA;;AAEA;AACA,cAAc,OAAO;AACrB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA;AACA,uGAAuG,+HAA+H;AACtO,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA,yBAAyB;;AAEzB,uBAAuB;;AAEvB;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,cAAc,8BAA8B;AAC5C,cAAc;AACd;AACA;AACA;AACA;AACA,MAAM;AACN;AACA,YAAY,mCAAmC;;AAE/C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,sBAAsB;AACnC,aAAa,QAAQ;AACrB,aAAa,WAAW;AACxB;AACA,2BAA2B,sBAAsB;AACjD;AACA,2DAA2D;;AAE3D;AACA;AACA;AACA;AACA,qEAAqE,iBAAiB;AACtF;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC;;AAElC;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,cAAc,wDAAwD;AACtE,cAAc,SAAS;AACvB,cAAc,WAAW;AACzB;AACA;AACA;AACA,wDAAwD;;AAExD;AACA,kCAAkC;;AAElC;AACA;;AAEA;;AAEA;AACA;AACA,wDAAwD,YAAY;;AAEpE;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT,QAAQ;AACR;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,uEAAuE,yBAAyB;AAChG,YAAY;AACZ;AACA;AACA,SAAS;AACT,OAAO;AACP,KAAK;;AAEL;AACA;;AAEA;AACA;AACA,cAAc,yBAAyB;AACvC,cAAc,UAAU;AACxB;AACA;AACA;;AAEA;AACA;AACA,wDAAwD,UAAU;AAClE;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,UAAU;AACV;;AAEA;AACA;AACA,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,QAAQ;AACtB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,cAAc,UAAU;AACxB;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA,OAAO;AACP;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,kBAAkB,cAAc,IAAI,QAAQ;AAC5C;AACA;;AAEA;AACA;AACA;AACA,yCAAyC,MAAM;AAC/C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,YAAY,GAAG;AACf,YAAY;AACZ;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,GAAG;AACf,YAAY;AACZ;AACA;AACA;AACA;;AAEA;;;;;;;;;;;AC7iBA,cAAc,mBAAO,CAAC,kDAAO;AAC7B,eAAe,mBAAO,CAAC,2EAAiB;AACxC,YAAY,mBAAO,CAAC,4DAAe;;AAEnC;AACA;AACA;AACA,WAAW,MAAM;AACjB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;ACxGA,QAAQ,eAAe,EAAE,mBAAO,CAAC,+CAAQ;AACzC,QAAQ,cAAc,EAAE,mBAAO,CAAC,2EAAiB;AACjD,aAAa,mBAAO,CAAC,qDAAM;AAC3B,eAAe,mBAAO,CAAC,0DAAc;AACrC,qBAAqB,mBAAO,CAAC,8DAAgB;AAC7C,wBAAwB,mBAAO,CAAC,sEAAoB;AACpD,uBAAuB,mBAAO,CAAC,sGAAoC;AACnE,mBAAmB,mBAAO,CAAC,mEAAe;AAC1C,uBAAuB,mBAAO,CAAC,gEAAiB;AAChD,oBAAoB,mBAAO,CAAC,0DAAc;AAC1C,aAAa,mBAAO,CAAC,0CAAM;AAC3B,YAAY,mBAAO,CAAC,4DAAe;;AAEnC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,YAAY,iDAAiD;AAC7D,YAAY,qCAAqC;;AAEjD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA,4BAA4B,cAAc;AAC1C;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;;AAEA;AACA;AACA;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,8CAA8C,YAAY,GAAG,UAAU,GAAG,YAAY;AACtF,yCAAyC,4BAA4B;AACrE,MAAM;AACN;AACA;;AAEA;;AAEA;AACA;AACA,4BAA4B,yBAAyB;AACrD;;AAEA;AACA;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP;;AAEA;AACA;;AAEA,6BAA6B;AAC7B;AACA;AACA;AACA;AACA,mBAAmB,WAAW,aAAa,uBAAuB,GAAG,qBAAqB;AAC1F;AACA;;AAEA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA,kBAAkB,WAAW,aAAa,uBAAuB,GAAG,qBAAqB;AACzF;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;AC7OA,QAAQ,eAAe,EAAE,mBAAO,CAAC,+CAAQ;AACzC,QAAQ,YAAY,EAAE,mBAAO,CAAC,yDAAQ;AACtC,oBAAoB,mBAAO,CAAC,8EAAwB;AACpD,cAAc,mBAAO,CAAC,kDAAO;AAC7B,aAAa,mBAAO,CAAC,wEAAqB;;AAE1C;AACA;AACA;AACA;;AAEA;;AAEA,oBAAoB;AACpB;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,wBAAwB;AACxB;AACA;AACA;AACA;;AAEA;AACA;AACA,IAAI;AACJ;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;;AAEA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;;AAEA;AACA;AACA;AACA;AACA,6BAA6B;AAC7B;AACA;;AAEA;AACA,kBAAkB,mBAAmB,GAAG,gBAAgB;AACxD;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,yBAAyB;AACzB;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;;AAEL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;AACA;AACA,KAAK;AACL;;AAEA;;AAEA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,aAAa,QAAQ;AACrB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;AACA,gBAAgB,wBAAwB,GAAG,qBAAqB;AAChE;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,+BAA+B;AAC/B;AACA;AACA;AACA;AACA;AACA;;;;;;;;;;;;AChYA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,aAAa,UAAU;AACvB,cAAc,QAAQ;AACtB;AACA;AACA;AACA;;AAEA,oBAAoB,qBAAqB;AACzC;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,sBAAsB,qBAAqB;AAC3C;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA,sBAAsB,qBAAqB;AAC3C;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;AC3GA;;AAEA,qBAAqB,mBAAO,CAAC,gEAAiB;AAC9C,iBAAiB,mFAA2B;AAC5C,wBAAwB,mBAAO,CAAC,oEAAmB;AACnD,8BAA8B,mBAAO,CAAC,4EAA0B;AAChE,aAAa,mBAAO,CAAC,4CAAM;AAC3B,cAAc,mBAAO,CAAC,kDAAO;AAC7B,kBAAkB,mBAAO,CAAC,oEAAmB;AAC7C,qBAAqB,iFAA8B;AACnD,WAAW,mBAAO,CAAC,iBAAI;AACvB,qBAAqB,mBAAO,CAAC,kEAAgB;AAC7C,YAAY,mBAAO,CAAC,sDAAY;AAChC,4BAA4B,mBAAO,CAAC,4EAAuB;AAC3D,mBAAmB,mBAAO,CAAC,wDAAa;AACxC,yBAAyB,mBAAO,CAAC,sEAAoB;AACrD,oBAAoB,mBAAO,CAAC,wDAAa;AACzC,YAAY,mBAAO,CAAC,kBAAK;AACzB,WAAW,mBAAO,CAAC,iBAAI;AACvB,iBAAiB,mBAAO,CAAC,0DAAc;AACvC,sBAAsB,mBAAO,CAAC,sEAAoB;AAClD,qBAAqB,mBAAO,CAAC,4DAAe;AAC5C,aAAa,mBAAO,CAAC,qDAAM;AAC3B,cAAc,mBAAO,CAAC,4DAAe;AACrC,aAAa,mBAAO,CAAC,0CAAM;AAC3B,uBAAuB,mBAAO,CAAC,gEAAiB;AAChD,sBAAsB,mBAAO,CAAC,8DAAgB;AAC9C,aAAa,mBAAO,CAAC,0DAAa;AAClC,oBAAoB,mBAAO,CAAC,wDAAa;AACzC,mBAAmB,mBAAO,CAAC,wDAAa;AACxC,cAAc,mBAAO,CAAC,qBAAQ;;AAE9B,aAAa,mBAAO,CAAC,qDAAQ;AAC7B,aAAa,mBAAO,CAAC,qDAAQ;AAC7B,kBAAkB,mBAAO,CAAC,iEAAc;AACxC,eAAe,mBAAO,CAAC,uBAAU;AACjC,YAAY,mBAAO,CAAC,oBAAO;AAC3B,gBAAgB,mBAAO,CAAC,2DAAW;;AAEnC;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,+BAA+B,OAAO;;AAEtC;;AAEA,gBAAgB,4FAAkC;AAClD,iCAAiC,SAAS;;AAE1C;AACA;AACA;AACA,EAAE;AACF;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA,qBAAqB;AACrB;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kDAAkD,aAAa;AAC/D,sCAAsC;AACtC;AACA,QAAQ,OAAO;AACf;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,uDAAuD,aAAa;AACpE;AACA;AACA;AACA;AACA,MAAM;;AAEN,yBAAyB;;AAEzB,uBAAuB;;AAEvB,oBAAoB;;AAEpB,iBAAiB;;AAEjB,oBAAoB;;AAEpB;AACA;AACA;AACA;AACA,qCAAqC,kCAAkC;AACvE;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,UAAU,0CAA0C;AACpD;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,+BAA+B,qBAAM;AACrC;AACA,6DAA6D,qBAAM;AACnE;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,oCAAoC;AACpC;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA,sEAAsE,IAAI;AAC1E;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR,yEAAyE,IAAI;AAC7E;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA,sEAAsE,IAAI;AAC1E;AACA;AACA;AACA,gEAAgE,gBAAgB,iBAAiB,IAAI;AACrG;AACA;;AAEA;AACA;AACA;AACA,UAAU;;AAEV;AACA,oFAAoF,IAAI;AACxF;AACA;;AAEA;AACA,qGAAqG,IAAI;AACzG;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA;AACA;AACA,SAAS;AACT;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,KAAK;;AAEL;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA,SAAS;AACT,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,KAAK;AACL;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA,YAAY;AACZ;AACA;AACA;AACA,SAAS;AACT,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;;AAEA;AACA,wBAAwB,4BAA4B;AACpD;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA,OAAO;AACP;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA,QAAQ;AACR;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA,qEAAqE,GAAG;AACxE;AACA;AACA;;AAEA;AACA,uEAAuE,GAAG;AAC1E;AACA;AACA;;AAEA;AACA,MAAM;AACN;AACA;;AAEA;AACA,uEAAuE,GAAG;AAC1E;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;;AAEA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,2CAA2C,OAAO,IAAI,IAAI;AAC1D;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;;AAEL;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA,oBAAoB,6BAA6B;AACjD;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA,wBAAwB,UAAU;AAClC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA,kCAAkC,gCAAgC;AAClE,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA,mCAAmC;AACnC;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;;AAEP;AACA;AACA;AACA,OAAO;AACP;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,QAAQ;AACR;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,kBAAkB,wBAAwB;AAC1C;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA,KAAK;;AAEL;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA;AACA;AACA;AACA,8BAA8B,gBAAgB;AAC9C,KAAK;;AAEL;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA,mCAAmC;AACnC;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,KAAK;AACL;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,oBAAoB,6BAA6B;AACjD;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,wBAAwB,4BAA4B;AACpD;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,yCAAyC,wBAAwB,IAAI,cAAc;AACnF,MAAM;AACN;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,UAAU;AACV,gCAAgC,kCAAkC;AAClE;AACA;AACA;AACA;AACA;;AAEA,kDAAkD;AAClD;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA,eAAe,yBAAyB;AACxC;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA,sBAAsB,6DAA6D;AACnF;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA,sBAAsB,6BAA6B;AACnD;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV,gDAAgD,kBAAkB;AAClE;;AAEA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA,wBAAwB,6BAA6B;AACrD;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA,SAAS;AACT;;AAEA;AACA;AACA;AACA,MAAM;AACN;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA,gBAAgB,cAAc;AAC9B;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;;AAEA,gBAAgB,cAAc;AAC9B;AACA;;AAEA,gBAAgB,6BAA6B;AAC7C;AACA;;AAEA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA,yDAAyD,qBAAqB;;AAE9E;;AAEA;;AAEA;AACA;AACA;AACA,8CAA8C,mBAAmB,GAAG,gBAAgB;AACpF;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,4CAA4C,mBAAmB,GAAG,gBAAgB;AAClF;;AAEA;;AAEA;;AAEA;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA,cAAc;AACd;AACA;AACA;AACA;AACA,eAAe;AACf;AACA;AACA;AACA;AACA;AACA,WAAW;AACX,UAAU;AACV;AACA,kDAAkD,OAAO;AACzD;AACA;AACA,OAAO;AACP,KAAK;;AAEL;AACA,6BAA6B,gBAAgB;AAC7C;;AAEA;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA,qCAAqC,qBAAqB;AAC1D;AACA;AACA;AACA;AACA,gCAAgC,UAAU;AAC1C,KAAK;;AAEL;AACA;AACA;;AAEA;AACA,uCAAuC,uBAAuB;AAC9D;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,mCAAmC,cAAc;AACjD;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,uDAAuD,wBAAwB;;AAE/E;AACA;;AAEA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,kBAAkB,iDAAiD,KAAK,cAAc,IAAI,QAAQ;AAClG;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,MAAM;AACN;AACA;;AAEA;;AAEA,iCAAiC,kBAAkB;AACnD,gCAAgC,mBAAmB;AACnD;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA,KAAK;AACL;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,cAAc;AACd;AACA;AACA;AACA;AACA;AACA,MAAM;AACN;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,aAAa,QAAQ;AACrB,cAAc;AACd;AACA;AACA,oFAAoF,EAAE;AACtF;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;;AAEA;;;;;;;;;;;;AC30DA,iBAAiB,mFAA2B;AAC5C,cAAc,mBAAO,CAAC,kDAAO;AAC7B,YAAY,mBAAO,CAAC,sDAAY;AAChC,mBAAmB,mBAAO,CAAC,wDAAa;AACxC,aAAa,mBAAO,CAAC,0DAAa;AAClC,aAAa,mBAAO,CAAC,wEAAqB;;AAE1C,gBAAgB,4FAAkC;;AAElD;AACA;;AAEA;AACA;AACA,WAAW,QAAQ;AACnB,WAAW,QAAQ;AACnB;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;;AAEA;;AAEA;AACA;AACA;AACA;AACA;AACA,sBAAsB,gBAAgB;AACtC;AACA;AACA;AACA,KAAK;;AAEL;AACA;AACA;AACA,KAAK;;AAEL,oCAAoC,uBAAuB;AAC3D,6BAA6B,gBAAgB;AAC7C,+BAA+B,kBAAkB;AACjD,gCAAgC,mBAAmB;AACnD,4CAA4C,mBAAmB;;AAE/D;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;;AAEA;AACA,WAAW;AACX;AACA;;AAEA;AACA,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP,MAAM;AACN;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;;AAEA;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA,YAAY,MAAM;AAClB;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,sCAAsC,SAAS;AAC/C,0BAA0B,MAAM,GAAG,IAAI;AACvC,SAAS;AACT;AACA;AACA;AACA;AACA;AACA;AACA,6DAA6D,eAAe;AAC5E;AACA;;AAEA;AACA;AACA;AACA,UAAU;AACV;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iEAAiE,uBAAuB;AACxF;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,iEAAiE,eAAe;AAChF;AACA;AACA;AACA;AACA;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,aAAa;AACb,WAAW;AACX;AACA;AACA,OAAO;AACP,KAAK;AACL;;AAEA;AACA;AACA;AACA;AACA;;AAEA;;;;;;;;;;;;;;;;;;;;;;;ACvNa;;AAEb,cAAc,mBAAO,CAAC,gDAAS;AAC/B,2BAA2B,mBAAO,CAAC,8EAAwB;AAC3D,gBAAgB,mBAAO,CAAC,kEAAqB;;AAE7C;AACA,iBAAiB,mBAAO,CAAC,wDAAa;AACtC;;AAEA;;AAEA;AACA;AACA,WAAW,mBAAO,CAAC,oHAA8C;AACjE,4CAA4C;AAC5C;AACA;AACA,aAAa,qBAAM;AACnB,iBAAiB,qBAAM;AACvB;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,EAAE;AACF;;AAEA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA,KAAK;AACL;AACA,EAAE;AACF;AACA;;AAEA,mBAAmB,mBAAO,CAAC,8DAAgB;;AAE3C;AACA,6BAA6B;AAC7B,wBAAwB;AACxB;AACA;;;;;;;;;;;ACvDA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;AAEA;AACA;AACA,GAAG;;AAEH;;AAEA;AACA;AACA,oBAAoB,iBAAiB;AACrC;AACA;AACA;AACA;AACA;AACA;AACA;AACA,OAAO;AACP;AACA;AACA;AACA;;;;;;;;;;;AChCA;;AAEA;;AAEA;AACA;;AAEA,oBAAoB,sBAAsB;AAC1C;;AAEA;AACA;AACA;AACA;AACA;AACA;;AAEA;AACA;;;;;;;;;;;;AClBA,+B;;;;;;;;;;;ACAA,0B;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;;;;;ACAA,e;;;;;;UCAA;UACA;;UAEA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;UACA;;UAEA;UACA;;UAEA;UACA;;UAEA;UACA;UACA;;;;;WCzBA;WACA;WACA;WACA;WACA;WACA,iCAAiC,WAAW;WAC5C;WACA,E;;;;;WCPA;WACA;WACA;WACA;WACA,yCAAyC,wCAAwC;WACjF;WACA;WACA,E;;;;;WCPA;WACA;WACA;WACA;WACA,GAAG;WACH;WACA;WACA,CAAC,I;;;;;WCPD,wF;;;;;WCAA;WACA;WACA;WACA,uDAAuD,iBAAiB;WACxE;WACA,gDAAgD,aAAa;WAC7D,E;;;;;WCNA;WACA;WACA;WACA;WACA,E;;;;;UEJA;UACA;UACA;UACA","sources":["webpack://miru/./app/js/anilist.js","webpack://miru/./app/js/anime.js","webpack://miru/./app/js/interface.js","webpack://miru/./app/js/main.js","webpack://miru/./app/js/rss.js","webpack://miru/./app/js/settings.js","webpack://miru/./app/js/util.js","webpack://miru/./node_modules/addr-to-ip-port/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1.js","webpack://miru/./node_modules/asn1.js/lib/asn1/api.js","webpack://miru/./node_modules/asn1.js/lib/asn1/base/buffer.js","webpack://miru/./node_modules/asn1.js/lib/asn1/base/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1/base/node.js","webpack://miru/./node_modules/asn1.js/lib/asn1/base/reporter.js","webpack://miru/./node_modules/asn1.js/lib/asn1/constants/der.js","webpack://miru/./node_modules/asn1.js/lib/asn1/constants/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1/decoders/der.js","webpack://miru/./node_modules/asn1.js/lib/asn1/decoders/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1/decoders/pem.js","webpack://miru/./node_modules/asn1.js/lib/asn1/encoders/der.js","webpack://miru/./node_modules/asn1.js/lib/asn1/encoders/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1/encoders/pem.js","webpack://miru/./node_modules/asn1.js/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/assert/build/assert.js","webpack://miru/./node_modules/assert/build/internal/assert/assertion_error.js","webpack://miru/./node_modules/assert/build/internal/errors.js","webpack://miru/./node_modules/assert/build/internal/util/comparisons.js","webpack://miru/./node_modules/available-typed-arrays/index.js","webpack://miru/./node_modules/base64-js/index.js","webpack://miru/./node_modules/bencode/lib/decode.js","webpack://miru/./node_modules/bencode/lib/encode.js","webpack://miru/./node_modules/bencode/lib/encoding-length.js","webpack://miru/./node_modules/bencode/lib/index.js","webpack://miru/./node_modules/bencode/lib/util.js","webpack://miru/./node_modules/bep53-range/index.js","webpack://miru/./node_modules/binary-search/index.js","webpack://miru/./node_modules/bitfield/lib/index.js","webpack://miru/./node_modules/bittorrent-protocol/index.js","webpack://miru/./node_modules/bittorrent-tracker/client.js","webpack://miru/./node_modules/bittorrent-tracker/lib/client/tracker.js","webpack://miru/./node_modules/bittorrent-tracker/lib/client/websocket-tracker.js","webpack://miru/./node_modules/bittorrent-tracker/lib/common.js","webpack://miru/./node_modules/blob-to-buffer/index.js","webpack://miru/./node_modules/block-stream2/index.js","webpack://miru/./node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/brorand/index.js","webpack://miru/./node_modules/browserify-aes/aes.js","webpack://miru/./node_modules/browserify-aes/authCipher.js","webpack://miru/./node_modules/browserify-aes/browser.js","webpack://miru/./node_modules/browserify-aes/decrypter.js","webpack://miru/./node_modules/browserify-aes/encrypter.js","webpack://miru/./node_modules/browserify-aes/ghash.js","webpack://miru/./node_modules/browserify-aes/incr32.js","webpack://miru/./node_modules/browserify-aes/modes/cbc.js","webpack://miru/./node_modules/browserify-aes/modes/cfb.js","webpack://miru/./node_modules/browserify-aes/modes/cfb1.js","webpack://miru/./node_modules/browserify-aes/modes/cfb8.js","webpack://miru/./node_modules/browserify-aes/modes/ctr.js","webpack://miru/./node_modules/browserify-aes/modes/ecb.js","webpack://miru/./node_modules/browserify-aes/modes/index.js","webpack://miru/./node_modules/browserify-aes/modes/ofb.js","webpack://miru/./node_modules/browserify-aes/streamCipher.js","webpack://miru/./node_modules/browserify-cipher/browser.js","webpack://miru/./node_modules/browserify-des/index.js","webpack://miru/./node_modules/browserify-des/modes.js","webpack://miru/./node_modules/browserify-rsa/index.js","webpack://miru/./node_modules/browserify-sign/algos.js","webpack://miru/./node_modules/browserify-sign/browser/index.js","webpack://miru/./node_modules/browserify-sign/browser/sign.js","webpack://miru/./node_modules/browserify-sign/browser/verify.js","webpack://miru/./node_modules/browserify-zlib/lib/binding.js","webpack://miru/./node_modules/browserify-zlib/lib/index.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/utils/common.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/adler32.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/constants.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/crc32.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/deflate.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inffast.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inflate.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/inftrees.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/messages.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/trees.js","webpack://miru/./node_modules/browserify-zlib/node_modules/pako/lib/zlib/zstream.js","webpack://miru/./node_modules/buffer-alloc-unsafe/index.js","webpack://miru/./node_modules/buffer-alloc/index.js","webpack://miru/./node_modules/buffer-fill/index.js","webpack://miru/./node_modules/buffer-xor/index.js","webpack://miru/./node_modules/buffer/index.js","webpack://miru/./node_modules/builtin-status-codes/browser.js","webpack://miru/./node_modules/cache-chunk-store/index.js","webpack://miru/./node_modules/call-bind/callBound.js","webpack://miru/./node_modules/call-bind/index.js","webpack://miru/./node_modules/chunk-store-stream/write.js","webpack://miru/./node_modules/cipher-base/index.js","webpack://miru/./node_modules/console-browserify/index.js","webpack://miru/./node_modules/cpus/browser.js","webpack://miru/./node_modules/create-ecdh/browser.js","webpack://miru/./node_modules/create-ecdh/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/create-hash/browser.js","webpack://miru/./node_modules/create-hash/md5.js","webpack://miru/./node_modules/create-hmac/browser.js","webpack://miru/./node_modules/create-hmac/legacy.js","webpack://miru/./node_modules/create-torrent/index.js","webpack://miru/./node_modules/crypto-browserify/index.js","webpack://miru/./node_modules/debug/src/browser.js","webpack://miru/./node_modules/debug/src/common.js","webpack://miru/./node_modules/define-properties/index.js","webpack://miru/./node_modules/des.js/lib/des.js","webpack://miru/./node_modules/des.js/lib/des/cbc.js","webpack://miru/./node_modules/des.js/lib/des/cipher.js","webpack://miru/./node_modules/des.js/lib/des/des.js","webpack://miru/./node_modules/des.js/lib/des/ede.js","webpack://miru/./node_modules/des.js/lib/des/utils.js","webpack://miru/./node_modules/diffie-hellman/browser.js","webpack://miru/./node_modules/diffie-hellman/lib/dh.js","webpack://miru/./node_modules/diffie-hellman/lib/generatePrime.js","webpack://miru/./node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/ebml-stream/lib/EbmlStreamDecoder.js","webpack://miru/./node_modules/ebml-stream/lib/EbmlStreamEncoder.js","webpack://miru/./node_modules/ebml-stream/lib/index.js","webpack://miru/./node_modules/ebml-stream/lib/models/EbmlTag.js","webpack://miru/./node_modules/ebml-stream/lib/models/EbmlTagFactory.js","webpack://miru/./node_modules/ebml-stream/lib/models/enums/BlockLacing.js","webpack://miru/./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js","webpack://miru/./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js","webpack://miru/./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js","webpack://miru/./node_modules/ebml-stream/lib/models/tags/Block.js","webpack://miru/./node_modules/ebml-stream/lib/models/tags/EbmlDataTag.js","webpack://miru/./node_modules/ebml-stream/lib/models/tags/EbmlMasterTag.js","webpack://miru/./node_modules/ebml-stream/lib/models/tags/SimpleBlock.js","webpack://miru/./node_modules/ebml-stream/lib/tools.js","webpack://miru/./node_modules/elliptic/lib/elliptic.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/base.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/edwards.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/index.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/mont.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/short.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curves.js","webpack://miru/./node_modules/elliptic/lib/elliptic/ec/index.js","webpack://miru/./node_modules/elliptic/lib/elliptic/ec/key.js","webpack://miru/./node_modules/elliptic/lib/elliptic/ec/signature.js","webpack://miru/./node_modules/elliptic/lib/elliptic/eddsa/index.js","webpack://miru/./node_modules/elliptic/lib/elliptic/eddsa/key.js","webpack://miru/./node_modules/elliptic/lib/elliptic/eddsa/signature.js","webpack://miru/./node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js","webpack://miru/./node_modules/elliptic/lib/elliptic/utils.js","webpack://miru/./node_modules/elliptic/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/end-of-stream/index.js","webpack://miru/./node_modules/err-code/index.js","webpack://miru/./node_modules/es-abstract/helpers/getOwnPropertyDescriptor.js","webpack://miru/./node_modules/es6-object-assign/index.js","webpack://miru/./node_modules/events/events.js","webpack://miru/./node_modules/evp_bytestokey/index.js","webpack://miru/./node_modules/fast-fifo/fixed-size.js","webpack://miru/./node_modules/fast-fifo/index.js","webpack://miru/./node_modules/filestream/read.js","webpack://miru/./node_modules/foreach/index.js","webpack://miru/./node_modules/fs-access-chunk-store/index.js","webpack://miru/./node_modules/function-bind/implementation.js","webpack://miru/./node_modules/function-bind/index.js","webpack://miru/./node_modules/get-browser-rtc/index.js","webpack://miru/./node_modules/get-intrinsic/index.js","webpack://miru/./node_modules/has-symbols/index.js","webpack://miru/./node_modules/has-symbols/shams.js","webpack://miru/./node_modules/has/src/index.js","webpack://miru/./node_modules/hash-base/index.js","webpack://miru/./node_modules/hash.js/lib/hash.js","webpack://miru/./node_modules/hash.js/lib/hash/common.js","webpack://miru/./node_modules/hash.js/lib/hash/hmac.js","webpack://miru/./node_modules/hash.js/lib/hash/ripemd.js","webpack://miru/./node_modules/hash.js/lib/hash/sha.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/1.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/224.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/256.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/384.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/512.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/common.js","webpack://miru/./node_modules/hash.js/lib/hash/utils.js","webpack://miru/./node_modules/hmac-drbg/lib/hmac-drbg.js","webpack://miru/./node_modules/https-browserify/index.js","webpack://miru/./node_modules/hybrid-chunk-store/index.js","webpack://miru/./node_modules/idb-chunk-store/index.js","webpack://miru/./node_modules/idb-keyval/dist/esm/index.js","webpack://miru/./node_modules/idb/build/esm/index.js","webpack://miru/./node_modules/idb/build/esm/wrap-idb-value.js","webpack://miru/./node_modules/ieee754/index.js","webpack://miru/./node_modules/immediate-chunk-store/index.js","webpack://miru/./node_modules/inherits/inherits_browser.js","webpack://miru/./node_modules/is-arguments/index.js","webpack://miru/./node_modules/is-ascii/index.js","webpack://miru/./node_modules/is-generator-function/index.js","webpack://miru/./node_modules/is-nan/implementation.js","webpack://miru/./node_modules/is-nan/index.js","webpack://miru/./node_modules/is-nan/polyfill.js","webpack://miru/./node_modules/is-nan/shim.js","webpack://miru/./node_modules/is-typed-array/index.js","webpack://miru/./node_modules/is-typedarray/index.js","webpack://miru/./node_modules/junk/index.js","webpack://miru/./node_modules/limiter/index.js","webpack://miru/./node_modules/limiter/lib/clock.js","webpack://miru/./node_modules/limiter/lib/rateLimiter.js","webpack://miru/./node_modules/limiter/lib/tokenBucket.js","webpack://miru/./node_modules/lru/index.js","webpack://miru/./node_modules/lt_donthave/index.js","webpack://miru/./node_modules/magnet-uri/index.js","webpack://miru/./node_modules/matroska-subtitles/dist/matroska-subtitles.module.js","webpack://miru/./node_modules/md5.js/index.js","webpack://miru/./node_modules/mediasource/index.js","webpack://miru/./node_modules/memory-chunk-store/index.js","webpack://miru/./node_modules/miller-rabin/lib/mr.js","webpack://miru/./node_modules/miller-rabin/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/mime/Mime.js","webpack://miru/./node_modules/mime/index.js","webpack://miru/./node_modules/mime/types/other.js","webpack://miru/./node_modules/mime/types/standard.js","webpack://miru/./node_modules/minimalistic-assert/index.js","webpack://miru/./node_modules/minimalistic-crypto-utils/lib/utils.js","webpack://miru/./node_modules/mp4-box-encoding/boxes.js","webpack://miru/./node_modules/mp4-box-encoding/descriptor.js","webpack://miru/./node_modules/mp4-box-encoding/index.js","webpack://miru/./node_modules/mp4-stream/decode.js","webpack://miru/./node_modules/mp4-stream/encode.js","webpack://miru/./node_modules/mp4-stream/index.js","webpack://miru/./node_modules/ms/index.js","webpack://miru/./node_modules/multistream/index.js","webpack://miru/./node_modules/next-event/index.js","webpack://miru/./node_modules/object-is/implementation.js","webpack://miru/./node_modules/object-is/index.js","webpack://miru/./node_modules/object-is/polyfill.js","webpack://miru/./node_modules/object-is/shim.js","webpack://miru/./node_modules/object-keys/implementation.js","webpack://miru/./node_modules/object-keys/index.js","webpack://miru/./node_modules/object-keys/isArguments.js","webpack://miru/./node_modules/once/once.js","webpack://miru/./node_modules/parse-asn1/asn1.js","webpack://miru/./node_modules/parse-asn1/certificate.js","webpack://miru/./node_modules/parse-asn1/fixProc.js","webpack://miru/./node_modules/parse-asn1/index.js","webpack://miru/./node_modules/parse-torrent/index.js","webpack://miru/./node_modules/path-browserify/index.js","webpack://miru/./node_modules/pbkdf2/browser.js","webpack://miru/./node_modules/pbkdf2/lib/async.js","webpack://miru/./node_modules/pbkdf2/lib/default-encoding.js","webpack://miru/./node_modules/pbkdf2/lib/precondition.js","webpack://miru/./node_modules/pbkdf2/lib/sync-browser.js","webpack://miru/./node_modules/pbkdf2/lib/to-buffer.js","webpack://miru/./node_modules/piece-length/index.js","webpack://miru/./node_modules/process-fast/index.js","webpack://miru/./node_modules/public-encrypt/browser.js","webpack://miru/./node_modules/public-encrypt/mgf.js","webpack://miru/./node_modules/public-encrypt/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/public-encrypt/privateDecrypt.js","webpack://miru/./node_modules/public-encrypt/publicEncrypt.js","webpack://miru/./node_modules/public-encrypt/withPublic.js","webpack://miru/./node_modules/public-encrypt/xor.js","webpack://miru/./node_modules/pump/index.js","webpack://miru/./node_modules/querystring/decode.js","webpack://miru/./node_modules/querystring/encode.js","webpack://miru/./node_modules/querystring/index.js","webpack://miru/./node_modules/queue-microtask/index.js","webpack://miru/./node_modules/queue-tick/queue-microtask.js","webpack://miru/./node_modules/random-iterate/index.js","webpack://miru/./node_modules/randombytes/browser.js","webpack://miru/./node_modules/randomfill/browser.js","webpack://miru/./node_modules/range-parser/index.js","webpack://miru/./node_modules/range-slice-stream/index.js","webpack://miru/./node_modules/rc4/rc4.js","webpack://miru/./node_modules/readable-stream/errors-browser.js","webpack://miru/./node_modules/readable-stream/lib/_stream_duplex.js","webpack://miru/./node_modules/readable-stream/lib/_stream_passthrough.js","webpack://miru/./node_modules/readable-stream/lib/_stream_readable.js","webpack://miru/./node_modules/readable-stream/lib/_stream_transform.js","webpack://miru/./node_modules/readable-stream/lib/_stream_writable.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/async_iterator.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/buffer_list.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/destroy.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/end-of-stream.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/from-browser.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/pipeline.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/state.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/stream-browser.js","webpack://miru/./node_modules/readable-stream/readable-browser.js","webpack://miru/./node_modules/render-media/index.js","webpack://miru/./node_modules/ripemd160/index.js","webpack://miru/./node_modules/run-parallel-limit/index.js","webpack://miru/./node_modules/run-parallel/index.js","webpack://miru/./node_modules/rusha/dist/rusha.js","webpack://miru/./node_modules/safari-14-idb-fix/dist/esm/index.js","webpack://miru/./node_modules/safe-buffer/index.js","webpack://miru/./node_modules/safer-buffer/safer.js","webpack://miru/./node_modules/sha.js/hash.js","webpack://miru/./node_modules/sha.js/index.js","webpack://miru/./node_modules/sha.js/sha.js","webpack://miru/./node_modules/sha.js/sha1.js","webpack://miru/./node_modules/sha.js/sha224.js","webpack://miru/./node_modules/sha.js/sha256.js","webpack://miru/./node_modules/sha.js/sha384.js","webpack://miru/./node_modules/sha.js/sha512.js","webpack://miru/./node_modules/simple-concat/index.js","webpack://miru/./node_modules/simple-get/index.js","webpack://miru/./node_modules/simple-peer/index.js","webpack://miru/./node_modules/simple-sha1/browser.js","webpack://miru/./node_modules/simple-sha1/rusha-worker-sha1.js","webpack://miru/./node_modules/simple-websocket/index.js","webpack://miru/./node_modules/speed-limiter/index.js","webpack://miru/./node_modules/speed-limiter/lib/throttle-group.js","webpack://miru/./node_modules/speed-limiter/lib/throttle.js","webpack://miru/./node_modules/speed-limiter/lib/utils.js","webpack://miru/./node_modules/speedometer/index.js","webpack://miru/./node_modules/stream-browserify/index.js","webpack://miru/./node_modules/stream-http/index.js","webpack://miru/./node_modules/stream-http/lib/capability.js","webpack://miru/./node_modules/stream-http/lib/request.js","webpack://miru/./node_modules/stream-http/lib/response.js","webpack://miru/./node_modules/stream-to-blob-url/index.js","webpack://miru/./node_modules/stream-to-blob/index.js","webpack://miru/./node_modules/stream-with-known-length-to-buffer/index.js","webpack://miru/./node_modules/streamx/index.js","webpack://miru/./node_modules/string_decoder/lib/string_decoder.js","webpack://miru/./node_modules/thirty-two/lib/thirty-two/index.js","webpack://miru/./node_modules/thirty-two/lib/thirty-two/thirty-two.js","webpack://miru/./node_modules/to-arraybuffer/index.js","webpack://miru/./node_modules/torrent-discovery/index.js","webpack://miru/./node_modules/torrent-piece/index.js","webpack://miru/./node_modules/typedarray-to-buffer/index.js","webpack://miru/./node_modules/uint64be/index.js","webpack://miru/./node_modules/unordered-array-remove/index.js","webpack://miru/./node_modules/url/node_modules/punycode/punycode.js","webpack://miru/./node_modules/url/url.js","webpack://miru/./node_modules/url/util.js","webpack://miru/./node_modules/ut_metadata/index.js","webpack://miru/./node_modules/util-deprecate/browser.js","webpack://miru/./node_modules/util/support/isBufferBrowser.js","webpack://miru/./node_modules/util/support/types.js","webpack://miru/./node_modules/util/util.js","webpack://miru/./node_modules/videostream/mp4-remuxer.js","webpack://miru/./node_modules/videostream/videostream.js","webpack://miru/./node_modules/webtorrent-player/index.js","webpack://miru/./node_modules/webtorrent-player/lib/peer.js","webpack://miru/./node_modules/webtorrent-player/lib/subtitles-octopus.js","webpack://miru/./node_modules/webtorrent/index.js","webpack://miru/./node_modules/webtorrent/lib/file-stream.js","webpack://miru/./node_modules/webtorrent/lib/file.js","webpack://miru/./node_modules/webtorrent/lib/peer.js","webpack://miru/./node_modules/webtorrent/lib/rarity-map.js","webpack://miru/./node_modules/webtorrent/lib/torrent.js","webpack://miru/./node_modules/webtorrent/lib/webconn.js","webpack://miru/./node_modules/which-typed-array/index.js","webpack://miru/./node_modules/wrappy/wrappy.js","webpack://miru/./node_modules/xtend/immutable.js","webpack://miru/external \"anitomyscript\"","webpack://miru/external \"halfmoon\"","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\asn1.js\\node_modules\\bn.js\\lib|buffer","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\bittorrent-tracker\\lib|./common-node","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\bittorrent-tracker|./lib/client/http-tracker","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\bittorrent-tracker|./lib/client/udp-tracker","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\bn.js\\lib|buffer","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\brorand|crypto","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\create-ecdh\\node_modules\\bn.js\\lib|buffer","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\create-torrent|./get-files","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\create-torrent|is-file","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\diffie-hellman\\node_modules\\bn.js\\lib|buffer","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\elliptic\\node_modules\\bn.js\\lib|buffer","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\miller-rabin\\node_modules\\bn.js\\lib|buffer","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\parse-torrent|fs","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\public-encrypt\\node_modules\\bn.js\\lib|buffer","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\pump|fs","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\readable-stream\\lib\\internal\\streams|util","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\readable-stream\\lib|util","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\simple-get|decompress-response","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\simple-websocket|ws","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\torrent-discovery|bittorrent-dht/client","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\torrent-discovery|bittorrent-lsd","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent\\lib|./server","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent\\lib|./utp","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent\\lib|fs","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent\\lib|net","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent\\lib|os","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent\\lib|ut_pex","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent|./lib/conn-pool","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent|bittorrent-dht/client","webpack://miru/ignored|D:\\Webdevelopment\\miru\\node_modules\\webtorrent|load-ip-set","webpack://miru/webpack/bootstrap","webpack://miru/webpack/runtime/compat get default export","webpack://miru/webpack/runtime/define property getters","webpack://miru/webpack/runtime/global","webpack://miru/webpack/runtime/hasOwnProperty shorthand","webpack://miru/webpack/runtime/make namespace object","webpack://miru/webpack/runtime/node module decorator","webpack://miru/webpack/before-startup","webpack://miru/webpack/startup","webpack://miru/webpack/after-startup"],"sourcesContent":["import { alID } from './interface.js'\r\nimport halfmoon from 'halfmoon'\r\n\r\nasync function handleRequest (opts) {\r\n return await fetch('https://graphql.anilist.co', opts).then(async res => {\r\n const json = await res.json()\r\n if (!res.ok) {\r\n for (const error of json.errors) {\r\n halfmoon.initStickyAlert({\r\n content: `Failed making request to anilist!
${error.status} - ${error.message}`,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n console.error(error)\r\n }\r\n }\r\n return json\r\n })\r\n}\r\n\r\nexport function alEntry (filemedia) {\r\n if (filemedia.media && localStorage.getItem('ALtoken')) {\r\n alRequest({ method: 'SearchIDStatus', id: filemedia.media.id }).then(res => {\r\n if ((res.errors && res.errors[0].status === 404) || res.data.MediaList.progress <= filemedia.episodeNumber || filemedia.episodes === 1) {\r\n const query = `\r\nmutation ($id: Int, $status: MediaListStatus, $episode: Int, $repeat: Int) {\r\n SaveMediaListEntry (mediaId: $id, status: $status, progress: $episode, repeat: $repeat) {\r\n id,\r\n status,\r\n progress,\r\n repeat\r\n }\r\n}`\r\n const variables = {\r\n repeat: 0,\r\n id: filemedia.media.id,\r\n status: 'CURRENT',\r\n episode: filemedia.episodeNumber || 1\r\n }\r\n if (filemedia.episodeNumber === filemedia.media.episodes || filemedia.episodes === 1) {\r\n variables.status = 'COMPLETED'\r\n if (res.data.MediaList.status === 'COMPLETED') {\r\n variables.repeat = res.data.MediaList.repeat + 1\r\n }\r\n }\r\n const options = {\r\n method: 'POST',\r\n headers: {\r\n Authorization: 'Bearer ' + localStorage.getItem('ALtoken'),\r\n 'Content-Type': 'application/json',\r\n Accept: 'application/json'\r\n },\r\n body: JSON.stringify({\r\n query: query,\r\n variables: variables\r\n })\r\n }\r\n handleRequest(options)\r\n }\r\n })\r\n }\r\n}\r\n\r\nexport async function alRequest (opts) {\r\n let query\r\n const variables = {\r\n type: 'ANIME',\r\n sort: opts.sort || 'TRENDING_DESC',\r\n page: opts.page || 1,\r\n perPage: opts.perPage || 30,\r\n status_in: opts.status_in || '[CURRENT,PLANNING]',\r\n chunk: opts.chunk || 1,\r\n perchunk: opts.perChunk || 30\r\n }\r\n const options = {\r\n method: 'POST',\r\n headers: {\r\n 'Content-Type': 'application/json',\r\n Accept: 'application/json'\r\n }\r\n }\r\n const queryObjects = `\r\nid,\r\ntitle {\r\n romaji,\r\n english,\r\n native,\r\n userPreferred\r\n},\r\ndescription(\r\n asHtml: true\r\n),\r\nseason,\r\nseasonYear,\r\nformat,\r\nstatus,\r\nepisodes,\r\nduration,\r\naverageScore,\r\ngenres,\r\ncoverImage {\r\n extraLarge,\r\n medium,\r\n color\r\n},\r\ncountryOfOrigin,\r\nisAdult,\r\nbannerImage,\r\nsynonyms,\r\nnextAiringEpisode {\r\n timeUntilAiring,\r\n episode\r\n},\r\ntrailer {\r\n id,\r\n site\r\n},\r\nstreamingEpisodes {\r\n title,\r\n thumbnail\r\n},\r\nmediaListEntry {\r\n progress\r\n},\r\nsource,\r\nstudios(isMain: true) {\r\n nodes {\r\n name\r\n }\r\n},\r\nrelations {\r\n edges {\r\n relationType(version:2)\r\n node {\r\n id,\r\n title {\r\n userPreferred\r\n },\r\n coverImage {\r\n medium\r\n },\r\n type,\r\n status,\r\n format,\r\n episodes\r\n }\r\n }\r\n}`\r\n if (opts.status) variables.status = opts.status\r\n if (localStorage.getItem('ALtoken')) options.headers.Authorization = localStorage.getItem('ALtoken')\r\n switch (opts.method) {\r\n case 'SearchName': {\r\n variables.search = opts.name\r\n query = ` \r\nquery ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: [MediaStatus]) {\r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n media(type: $type, search: $search, sort: $sort, status_in: $status) {\r\n ${queryObjects}\r\n }\r\n }\r\n}`\r\n break\r\n } case 'SearchIDSingle': {\r\n variables.id = opts.id\r\n query = ` \r\nquery ($id: Int, $type: MediaType) { \r\n Media (id: $id, type: $type) {\r\n ${queryObjects}\r\n }\r\n}`\r\n break\r\n } case 'SearchIDS': {\r\n variables.id = opts.id\r\n query = ` \r\nquery ($id: [Int], $type: MediaType, $page: Int, $perPage: Int) { \r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n media (id_in: $id, type: $type) {\r\n ${queryObjects}\r\n }\r\n }\r\n}`\r\n break\r\n } case 'Viewer': {\r\n query = ` \r\nquery {\r\n Viewer {\r\n avatar {\r\n medium\r\n },\r\n name,\r\n id\r\n }\r\n}`\r\n break\r\n } case 'UserLists': {\r\n variables.id = opts.id\r\n query = ` \r\nquery ($page: Int, $perPage: Int, $id: Int, $type: MediaType, $status_in: [MediaListStatus]){\r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n mediaList (userId: $id, type: $type, status_in: $status_in) {\r\n media {\r\n ${queryObjects}\r\n }\r\n }\r\n }\r\n}`\r\n break\r\n } case 'SearchIDStatus': {\r\n variables.id = alID\r\n variables.mediaId = opts.id\r\n query = ` \r\nquery ($id: Int, $mediaId: Int){\r\n MediaList(userId: $id, mediaId: $mediaId) {\r\n status,\r\n progress,\r\n repeat\r\n }\r\n}`\r\n break\r\n } case 'AiringSchedule': {\r\n const date = new Date()\r\n const diff = date.getDay() >= 1 ? date.getDay() - 1 : 6 - date.getDay()\r\n date.setDate(date.getDate() - diff)\r\n date.setHours(0, 0, 0, 0)\r\n variables.from = date.getTime() / 1000\r\n variables.to = (date.getTime() + 7 * 24 * 60 * 60 * 1000) / 1000\r\n query = ` \r\nquery ($page: Int, $perPage: Int, $from: Int, $to: Int) {\r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n airingSchedules(airingAt_greater: $from, airingAt_lesser: $to) {\r\n episode,\r\n timeUntilAiring,\r\n airingAt,\r\n media{\r\n ${queryObjects}\r\n }\r\n }\r\n }\r\n}`\r\n break\r\n } case 'Search': {\r\n variables.genre = opts.genre\r\n variables.search = opts.search\r\n variables.year = opts.year\r\n variables.season = opts.season\r\n variables.format = opts.format\r\n variables.status = opts.status\r\n variables.sort = opts.sort || 'SEARCH_MATCH'\r\n query = ` \r\nquery ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: MediaStatus, $season: MediaSeason, $year: Int, $genre: String, $format: MediaFormat) {\r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n media(type: $type, search: $search, sort: $sort, status: $status, season: $season, seasonYear: $year, genre: $genre, format: $format) {\r\n ${queryObjects}\r\n }\r\n }\r\n}`\r\n }\r\n }\r\n options.body = JSON.stringify({\r\n query: query.replace(/\\s/g, ''),\r\n variables: variables\r\n })\r\n\r\n return await handleRequest(options)\r\n}\r\n","/* global searchText */\r\nimport { client } from './main.js'\r\nimport { searchParams, DOMPARSER } from './util.js'\r\nimport { alRequest } from './anilist.js'\r\nimport { nyaaRss } from './rss.js'\r\nimport { viewMedia } from './interface.js'\r\nimport halfmoon from 'halfmoon'\r\nimport anitomyscript from 'anitomyscript'\r\nconst torrentRx = /(^magnet:){1}|(^[A-F\\d]{8,40}$){1}|(.*\\.torrent$){1}/i\r\nconst imageRx = /\\.(jpeg|jpg|gif|png|webp)/i\r\nwindow.addEventListener('paste', async e => { // WAIT image lookup on paste, or add torrent on paste\r\n const item = e.clipboardData.items[0]\r\n if (item && item.type.indexOf('image') === 0) {\r\n e.preventDefault()\r\n const formData = new FormData()\r\n formData.append('image', item.getAsFile())\r\n traceAnime(formData, 'file')\r\n } else if (item && item.type === 'text/plain') {\r\n item.getAsString(text => {\r\n if (torrentRx.exec(text)) {\r\n e.preventDefault()\r\n searchText.value = ''\r\n client.playTorrent(text)\r\n } else if (imageRx.exec(text)) {\r\n e.preventDefault()\r\n searchText.value = ''\r\n traceAnime(text)\r\n }\r\n })\r\n } else if (item && item.type === 'text/html') {\r\n item.getAsString(text => {\r\n const img = DOMPARSER(text, 'text/html').querySelectorAll('img')[0]\r\n if (img) {\r\n e.preventDefault()\r\n searchText.value = ''\r\n traceAnime(img.src)\r\n }\r\n })\r\n }\r\n})\r\nif (searchParams.get('link')) {\r\n traceAnime(searchParams.get('link'))\r\n window.location = '/app/#home'\r\n}\r\nfunction traceAnime (image, type) { // WAIT lookup logic\r\n if (type === 'file') {\r\n const reader = new FileReader()\r\n reader.onload = e => {\r\n halfmoon.initStickyAlert({\r\n content: `Looking up anime for image.
`\r\n })\r\n }\r\n reader.readAsDataURL(image.get('image'))\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: `Looking up anime for image.
`\r\n })\r\n }\r\n let options\r\n let url = `https://api.trace.moe/search?cutBorders&url=${image}`\r\n if (type === 'file') {\r\n options = {\r\n method: 'POST',\r\n body: image\r\n }\r\n url = 'https://api.trace.moe/search'\r\n }\r\n fetch(url, options).then(res => res.json()).then(async ({ result }) => {\r\n if (result && result[0].similarity >= 0.85) {\r\n const res = await alRequest({ method: 'SearchIDSingle', id: result[0].anilist })\r\n viewMedia(res.data.Media, result[0].episode)\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: 'Couldn\\'t find anime for specified image! Try to remove black bars, or use a more detailed image.',\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n }\r\n })\r\n}\r\nexport const episodeRx = /Episode (\\d+) - (.*)/\r\n\r\nexport async function nyaaSearch (media, episode, isOffline) {\r\n if (parseInt(episode) < 10) {\r\n episode = `0${episode}`\r\n }\r\n\r\n const table = document.querySelector('tbody.results')\r\n const results = await nyaaRss(media, episode, isOffline)\r\n\r\n if (results.children.length === 0) {\r\n halfmoon.initStickyAlert({\r\n content: `Couldn't find torrent for ${media.title.userPreferred} Episode ${parseInt(episode)}! Try specifying a torrent manually.`,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n } else {\r\n table.innerHTML = ''\r\n table.appendChild(results)\r\n halfmoon.toggleModal('tsearch')\r\n }\r\n}\r\n\r\n// resolve anime name based on file name and store it\r\n\r\nexport async function resolveFileMedia (opts) {\r\n // opts.fileName opts.isRelease\r\n\r\n async function resolveTitle (title) {\r\n if (!(title in relations)) {\r\n // resolve name and shit\r\n let method, res\r\n if (opts.isRelease) {\r\n method = { name: title, method: 'SearchName', perPage: 1, status: ['RELEASING'], sort: 'SEARCH_MATCH' }\r\n // maybe releases should include this and last season? idfk\r\n } else {\r\n method = { name: title, method: 'SearchName', perPage: 1, status: ['RELEASING', 'FINISHED'], sort: 'SEARCH_MATCH' }\r\n }\r\n res = await alRequest(method)\r\n if (!res.data.Page.media[0]) {\r\n const index = method.name.search(/S\\d/)\r\n method.name = ((index !== -1 && method.name.slice(0, index) + method.name.slice(index + 1, method.name.length)) || method.name).replace('(TV)', '').replace(/ (19[5-9]\\d|20[0-6]\\d)/, '').replace('-', '')\r\n method.status = ['RELEASING', 'FINISHED']\r\n res = await alRequest(method)\r\n }\r\n if (res.data.Page.media[0]) {\r\n relations[title] = res.data.Page.media[0].id\r\n } else {\r\n relations[title] = null\r\n }\r\n }\r\n }\r\n const parsePromises = opts.fileName.constructor === Array\r\n ? opts.fileName.map(name => anitomyscript(name))\r\n : [anitomyscript(opts.fileName)]\r\n const parseObjs = await Promise.all(parsePromises)\r\n await Promise.all([...new Set(parseObjs.map(obj => obj.anime_title))].map(title => resolveTitle(title)))\r\n const assoc = {}\r\n for (const media of (await alRequest({ method: 'SearchIDS', id: [...new Set(parseObjs.map(obj => relations[obj.anime_title]))], perPage: 50 })).data.Page.media) assoc[media.id] = media\r\n const fileMedias = []\r\n for (const praseObj of parseObjs) {\r\n let episode\r\n let media = assoc[relations[praseObj.anime_title]]\r\n async function resolveSeason (opts) {\r\n // opts.media, opts.episode, opts.increment, opts.offset\r\n let epMin, epMax\r\n if (opts.episode.constructor === Array) { // support batch episode ranges\r\n epMin = Number(opts.episode[0])\r\n epMax = Number(opts.episode[opts.episode.length - 1])\r\n } else {\r\n epMin = epMax = Number(opts.episode)\r\n }\r\n let tempMedia, increment\r\n if (opts.media.relations.edges.some(edge => edge.relationType === 'PREQUEL' && (edge.node.format === 'TV' || 'TV_SHORT')) && !opts.increment) {\r\n // media has prequel and we dont want to move up in the tree\r\n tempMedia = opts.media.relations.edges.filter(edge => edge.relationType === 'PREQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))[0].node\r\n } else if (opts.media.relations.edges.some(edge => edge.relationType === 'SEQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))) {\r\n // media doesnt have prequel, or we want to move up in the tree\r\n tempMedia = opts.media.relations.edges.filter(edge => edge.relationType === 'SEQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))[0].node\r\n increment = true\r\n }\r\n if (tempMedia?.episodes && epMax - (opts.offset + tempMedia.episodes) > (media.nextAiringEpisode?.episode || media.episodes)) {\r\n // episode is still out of bounds\r\n const nextEdge = await alRequest({ method: 'SearchIDSingle', id: tempMedia.id })\r\n await resolveSeason({ media: nextEdge.data.Media, episode: opts.episode, offset: opts.offset + nextEdge.data.Media.episodes, increment: increment })\r\n } else if (tempMedia?.episodes && epMax - (opts.offset + tempMedia.episodes) <= (media.nextAiringEpisode?.episode || media.episodes) && epMin - (opts.offset + tempMedia.episodes) > 0) {\r\n // episode is in range, seems good! overwriting media to count up \"seasons\"\r\n if (opts.episode.constructor === Array) {\r\n episode = `${praseObj.episode_number[0] - (opts.offset + tempMedia.episodes)} ~ ${praseObj.episode_number[praseObj.episode_number.length - 1] - (opts.offset + tempMedia.episodes)}`\r\n } else {\r\n episode = opts.episode - (opts.offset + tempMedia.episodes)\r\n }\r\n if (opts.increment || increment) {\r\n const nextEdge = await alRequest({ method: 'SearchIDSingle', id: tempMedia.id })\r\n media = nextEdge.data.Media\r\n }\r\n } else {\r\n console.log('error in parsing!', opts.media, tempMedia)\r\n halfmoon.initStickyAlert({\r\n content: `Failed resolving anime episode!
${opts.media.title.userPreferred} - ${epMax}`,\r\n title: 'Parsing Error',\r\n alertType: 'alert-secondary',\r\n fillType: ''\r\n })\r\n // something failed, most likely couldnt find an edge or processing failed, force episode number even if its invalid/out of bounds, better than nothing\r\n if (opts.episode.constructor === Array) {\r\n episode = `${Number(praseObj.episode_number[0])} ~ ${Number(praseObj.episode_number[praseObj.episode_number.length - 1])}`\r\n } else {\r\n episode = Number(opts.episode)\r\n }\r\n }\r\n }\r\n\r\n // resolve episode, if movie, dont.\r\n if ((media?.format !== 'MOVIE' || (media.episodes || media.nextAiringEpisode.episode)) && praseObj.episode_number) {\r\n if (praseObj.episode_number.constructor === Array) {\r\n // is an episode range\r\n if (parseInt(praseObj.episode_number[0]) === 1) {\r\n // if it starts with #1 and overflows then it includes more than 1 season in a batch, cant fix this cleanly, name is parsed per file basis so this shouldnt be an issue\r\n episode = `${praseObj.episode_number[0]} ~ ${praseObj.episode_number[praseObj.episode_number.length - 1]}`\r\n } else {\r\n if ((media?.episodes || media?.nextAiringEpisode?.episode) && parseInt(praseObj.episode_number[praseObj.episode_number.length - 1]) > (media.episodes || media.nextAiringEpisode.episode)) {\r\n // if highest value is bigger than episode count or latest streamed episode +1 for safety, parseint to math.floor a number like 12.5 - specials - in 1 go\r\n await resolveSeason({ media: media, episode: praseObj.episode_number, offset: 0 })\r\n } else {\r\n // cant find ep count or range seems fine\r\n episode = `${Number(praseObj.episode_number[0])} ~ ${Number(praseObj.episode_number[praseObj.episode_number.length - 1])}`\r\n }\r\n }\r\n } else {\r\n if ((media?.episodes || media?.nextAiringEpisode?.episode) && parseInt(praseObj.episode_number) > (media.episodes || media.nextAiringEpisode.episode)) {\r\n // value bigger than episode count\r\n await resolveSeason({ media: media, episode: praseObj.episode_number, offset: 0 })\r\n } else {\r\n // cant find ep count or episode seems fine\r\n episode = Number(praseObj.episode_number)\r\n }\r\n }\r\n }\r\n const streamingEpisode = media?.streamingEpisodes.filter(episode => episodeRx.exec(episode.title) && Number(episodeRx.exec(episode.title)[1]) === Number(praseObj.episode_number))[0]\r\n fileMedias.push({\r\n mediaTitle: media?.title.userPreferred,\r\n episodeNumber: episode,\r\n episodeTitle: streamingEpisode && episodeRx.exec(streamingEpisode.title)[2],\r\n episodeThumbnail: streamingEpisode?.thumbnail,\r\n mediaCover: media?.coverImage.medium,\r\n name: 'Miru',\r\n parseObject: praseObj,\r\n media: media\r\n })\r\n }\r\n return fileMedias.length === 1 ? fileMedias[0] : fileMedias\r\n}\r\n\r\nexport const relations = JSON.parse(localStorage.getItem('relations')) || {}\r\n","/* global navHome, searchClear, searchWrapper, skeletonCardTemplate, bareCardTemplate, fullCardTemplate, home, searchText, searchGenre, searchYear, searchSeason, searchFormat, searchStatus, searchSort, navSchedule, homeContinueMore, homeReleasesMore, homePlanningMore, homeTrendingMore, homeRomanceMore, homeActionMore, homeContinue, homeReleases, homePlanning, homeTrending, homeRomance, homeAction */\r\n\r\n// THIS IS WHY YOU FUCKING USE FRAMEWORKS\r\n\r\nimport { alRequest } from './anilist.js'\r\nimport { resolveFileMedia, relations, nyaaSearch } from './anime.js'\r\nimport { getRSSurl, getRSSContent } from './rss.js'\r\nimport { settings } from './settings.js'\r\nimport { client } from './main.js'\r\nimport { countdown, flattenObj } from './util.js'\r\nimport halfmoon from 'halfmoon'\r\nexport function loadHomePage () {\r\n const homeLoadElements = [navSchedule, homeContinueMore, homeReleasesMore, homePlanningMore, homeTrendingMore, homeRomanceMore, homeActionMore]\r\n const homePreviewElements = [homeContinue, homeReleases, homePlanning, homeTrending, homeRomance, homeAction]\r\n const homeSearchElements = [searchText, searchGenre, searchYear, searchSeason, searchFormat, searchStatus, searchSort]\r\n const browseGallery = document.querySelector('.browse')\r\n const homeLoadFunctions = {\r\n continue: async function (page) {\r\n if (!page) gallerySkeleton(browseGallery)\r\n const res = await alRequest({ method: 'UserLists', status_in: 'CURRENT', id: alID, page: page || 1 })\r\n const mediaList = res.data.Page.mediaList.map(i => i.media).filter(media => {\r\n return !(media.status === 'RELEASING' && media.mediaListEntry?.progress === media.nextAiringEpisode?.episode - 1)\r\n })\r\n galleryAppend({ media: mediaList, gallery: browseGallery, method: 'continue', page: page || 1 })\r\n return res.data.Page.pageInfo.hasNextPage\r\n },\r\n releases: async function () {\r\n gallerySkeleton(browseGallery)\r\n const cards = await releasesCards((await getRSSContent(getRSSurl())).querySelectorAll('item'))\r\n browseGallery.textContent = ''\r\n browseGallery.append(...cards)\r\n home.classList.remove('loading')\r\n home.onscroll = undefined\r\n return false\r\n },\r\n planning: async function (page) {\r\n if (!page) gallerySkeleton(browseGallery)\r\n const res = await alRequest({ method: 'UserLists', status_in: 'PLANNING', id: alID, page: page || 1 })\r\n const mediaList = res.data.Page.mediaList\r\n galleryAppend({ media: mediaList.map(i => i.media), gallery: browseGallery, method: 'planning', page: page || 1 })\r\n return res.data.Page.pageInfo.hasNextPage\r\n },\r\n trending: async function () {\r\n gallerySkeleton(browseGallery)\r\n clearSearch()\r\n searchSort.value = 'TRENDING_DESC'\r\n return await homeLoadFunctions.search()\r\n },\r\n romance: async function () {\r\n gallerySkeleton(browseGallery)\r\n clearSearch()\r\n searchGenre.value = 'romance'\r\n searchSort.value = 'TRENDING_DESC'\r\n return await homeLoadFunctions.search()\r\n },\r\n action: async function () {\r\n gallerySkeleton(browseGallery)\r\n clearSearch()\r\n searchGenre.value = 'action'\r\n searchSort.value = 'TRENDING_DESC'\r\n return await homeLoadFunctions.search()\r\n },\r\n schedule: async function (page) {\r\n if (!page) gallerySkeleton(browseGallery)\r\n const res = await alRequest({ method: 'AiringSchedule', page: page || 1 })\r\n const mediaList = res.data.Page.airingSchedules\r\n galleryAppend({ media: mediaList.filter(entry => entry.media.countryOfOrigin !== 'CN' && entry.media.isAdult === false), gallery: browseGallery, method: 'schedule', page: page || 1, schedule: true })\r\n return res.data.Page.pageInfo.hasNextPage\r\n },\r\n search: async function (page) {\r\n const def = {\r\n method: 'Search',\r\n page: page || 1\r\n }\r\n const opts = {}\r\n Object.assign(opts, def)\r\n for (const element of homeSearchElements) {\r\n if (element.value) opts[element.dataset.option] = element.value\r\n }\r\n if (Object.keys(def).length !== Object.keys(opts).length) {\r\n const res = await alRequest(opts)\r\n const mediaList = res.data.Page.media\r\n galleryAppend({ media: mediaList, gallery: browseGallery, method: 'search', page: page || 1 })\r\n return res.data.Page.pageInfo.hasNextPage\r\n } else {\r\n searchClear.classList.remove('text-primary')\r\n home.classList.remove('loading')\r\n reloadHome()\r\n return false\r\n }\r\n }\r\n }\r\n const homePreviewFunctions = {\r\n continue: function () {\r\n alRequest({ method: 'UserLists', status_in: 'CURRENT', id: alID, perPage: 50 }).then(res => {\r\n const mediaList = res.data.Page.mediaList.filter(({ media }) => {\r\n return !(media.status === 'RELEASING' && media.mediaListEntry?.progress === media.nextAiringEpisode?.episode - 1)\r\n }).slice(0, 5).map(i => i.media)\r\n galleryAppend({ media: mediaList, gallery: homeContinue })\r\n })\r\n },\r\n releases: async function () { // this could be cleaner, but oh well\r\n const doc = await getRSSContent(getRSSurl())\r\n if (doc) {\r\n const pubDate = doc.querySelector('pubDate').textContent\r\n if (lastRSSDate !== pubDate) {\r\n if (lastRSSDate) {\r\n homeReleases.textContent = ''\r\n homeReleases.append(...gallerySkeletonFrag(5))\r\n if (settings.other1) {\r\n resolveFileMedia({ fileName: doc.querySelector('item title').textContent, isRelease: true }).then(mediaInformation => {\r\n const notification = new Notification(mediaInformation.media.title.userPreferred, {\r\n body: `Episode ${mediaInformation.episodeNumber} was just released!`,\r\n icon: mediaInformation.media.coverImage.medium\r\n })\r\n notification.onclick = async () => {\r\n window.parent.focus()\r\n relations[mediaInformation.parseObject.anime_title] = (await alRequest({ id: mediaInformation.media.id, method: 'SearchIDSingle' })).data.Media.id\r\n client.playTorrent(doc.querySelector('item link').textContent, { media: mediaInformation, episode: mediaInformation.episode })\r\n }\r\n })\r\n }\r\n }\r\n lastRSSDate = pubDate\r\n const cards = await releasesCards(doc.querySelectorAll('item'), 5)\r\n homeReleases.textContent = ''\r\n homeReleases.append(...cards)\r\n }\r\n }\r\n },\r\n planning: function () {\r\n alRequest({ method: 'UserLists', status_in: 'PLANNING', id: alID, perPage: 5 }).then(res => {\r\n galleryAppend({ media: res.data.Page.mediaList.map(i => i.media), gallery: homePlanning })\r\n })\r\n },\r\n trending: function () {\r\n alRequest({ method: 'Search', id: alID, perPage: 5, sort: 'TRENDING_DESC' }).then(res => {\r\n galleryAppend({ media: res.data.Page.media, gallery: homeTrending })\r\n })\r\n },\r\n romance: function () {\r\n alRequest({ method: 'Search', genre: 'Romance', perPage: 5, sort: 'TRENDING_DESC' }).then(res => {\r\n galleryAppend({ media: res.data.Page.media, gallery: homeRomance })\r\n })\r\n },\r\n action: function () {\r\n alRequest({ method: 'Search', genre: 'Action', perPage: 5, sort: 'TRENDING_DESC' }).then(res => {\r\n galleryAppend({ media: res.data.Page.media, gallery: homeAction })\r\n })\r\n }\r\n }\r\n const gallerySkeletonFrag = function (limit) {\r\n const cards = []\r\n while (limit--) {\r\n cards.push(skeletonCard.cloneNode(true))\r\n }\r\n return cards\r\n }\r\n let loadTimeout\r\n let lastDate\r\n let lastRSSDate\r\n let canScroll = true\r\n\r\n function gallerySkeleton (gallery) {\r\n home.classList.add('loading')\r\n gallery.textContent = ''\r\n gallery.append(...gallerySkeletonFrag(10))\r\n }\r\n function galleryAppend (opts) {\r\n if (opts.page === 1) {\r\n home.classList.remove('loading')\r\n }\r\n if (opts.method) {\r\n canScroll = false\r\n home.onscroll = function () {\r\n if (this.scrollTop + this.clientHeight > this.scrollHeight - 800 && !loadTimeout && canScroll) {\r\n canScroll = false\r\n loadTimeout = setTimeout(function () { loadTimeout = undefined }, 1000)\r\n homeLoadFunctions[opts.method](opts.page + 1).then((hasNextPage) => { canScroll = hasNextPage })\r\n }\r\n }\r\n }\r\n if (!opts.page || opts.page === 1) {\r\n opts.gallery.textContent = ''\r\n }\r\n const date = new Date()\r\n const cards = []\r\n opts.media.forEach(media => {\r\n if (opts.schedule) {\r\n if (media.timeUntilAiring && (!lastDate || (new Date(+date + media.timeUntilAiring * 1000).getDay() !== lastDate.getDay()))) {\r\n const div = document.createElement('div')\r\n lastDate = new Date(+date + media.timeUntilAiring * 1000)\r\n div.classList.add('day-row', 'font-size-24', 'font-weight-bold', 'h-50', 'd-flex', 'align-items-end')\r\n div.textContent = lastDate.toLocaleDateString('en-US', { weekday: 'long' })\r\n cards.push(div)\r\n }\r\n media = media.media\r\n }\r\n cards.push(cardCreator({ media: media, schedule: opts.schedule, onclick: () => viewMedia(media) }))\r\n })\r\n opts.gallery.append(...cards)\r\n canScroll = true\r\n }\r\n\r\n for (const item of homePreviewElements) {\r\n homePreviewFunctions[item.dataset.function]()\r\n }\r\n setInterval(homePreviewFunctions.releases, 30000)\r\n for (const item of homeLoadElements) {\r\n item.onclick = function () {\r\n home.scrollTop = 0\r\n home.classList.add('browsing')\r\n searchClear.classList.add('text-primary')\r\n homeLoadFunctions[item.dataset.function]()\r\n }\r\n }\r\n function reloadHome () {\r\n clearSearch()\r\n searchClear.classList.remove('text-primary')\r\n home.classList.remove('browsing')\r\n lastRSSDate = undefined\r\n home.onscroll = undefined\r\n home.scrollTop = 0\r\n for (const item of homePreviewElements) {\r\n item.textContent = ''\r\n item.append(...gallerySkeletonFrag(5))\r\n homePreviewFunctions[item.dataset.function]()\r\n }\r\n document.querySelector('.browse').textContent = ''\r\n }\r\n navHome.onclick = reloadHome\r\n searchClear.onclick = reloadHome\r\n function clearSearch () {\r\n for (const element of homeSearchElements) {\r\n element.value = ''\r\n }\r\n }\r\n let searchTimeout\r\n searchWrapper.oninput = () => {\r\n if (!searchTimeout) {\r\n home.classList.add('browsing')\r\n gallerySkeleton(browseGallery)\r\n home.scrollTop = 0\r\n } else {\r\n clearTimeout(searchTimeout)\r\n }\r\n searchClear.classList.add('text-primary')\r\n searchTimeout = setTimeout(() => {\r\n homeLoadFunctions.search()\r\n searchTimeout = undefined\r\n }, 500)\r\n }\r\n}\r\n\r\nconst skeletonCard = skeletonCardTemplate.cloneNode(true).content\r\nconst bareCard = bareCardTemplate.cloneNode(true).content\r\nconst fullCard = fullCardTemplate.cloneNode(true).content\r\nexport function cardCreator (opts) {\r\n if (opts.media) {\r\n const card = fullCard.cloneNode(true)\r\n const nodes = card.querySelectorAll('*')\r\n nodes[0].onclick = opts.onclick\r\n nodes[0].style = `--color:${opts.media.coverImage.color || '#1890ff'};`\r\n nodes[3].src = opts.media.coverImage.extraLarge || ''\r\n nodes[6].textContent = [opts.media.title.userPreferred, opts.episodeNumber].filter(s => s).join(' - ')\r\n if (opts.schedule && opts.media.nextAiringEpisode) nodes[7].textContent = 'EP ' + opts.media.nextAiringEpisode.episode + ' in ' + countdown(opts.media.nextAiringEpisode.timeUntilAiring)\r\n nodes[8].innerHTML = '' + [\r\n opts.media.format === 'TV' ? 'TV Show' : opts.media.format?.toLowerCase().replace(/_/g, ' '),\r\n opts.media.episodes ? opts.media.episodes + ' Episodes' : opts.media.duration ? opts.media.duration + ' Minutes' : undefined,\r\n opts.media.status?.toLowerCase().replace(/_/g, ' '),\r\n [opts.media.season?.toLowerCase(), opts.media.seasonYear].filter(s => s).join(' ')\r\n ].filter(s => s).join('') + ''\r\n nodes[13].innerHTML = opts.media.description\r\n nodes[14].innerHTML = opts.media.genres.map(key => (`${key} `)).join('')\r\n return card\r\n } else if (opts.parseObject) {\r\n const card = bareCard.cloneNode(true)\r\n card.querySelector('h5').textContent = [opts.parseObject.anime_title, opts.parseObject.episode_number].filter(s => s).join(' - ')\r\n card.firstElementChild.onclick = opts.onclick\r\n return card\r\n }\r\n return skeletonCard.cloneNode(true)\r\n}\r\n\r\nasync function releasesCards (items, limit) {\r\n const cards = []\r\n const media = await resolveFileMedia({ fileName: [...items].map(item => item.querySelector('title').textContent).slice(0, limit), isRelease: true })\r\n media.forEach((mediaInformation, index) => {\r\n mediaInformation.onclick = () => client.playTorrent(items[index].querySelector('link').textContent, { media: mediaInformation, episode: mediaInformation.episode })\r\n cards.push(cardCreator(mediaInformation))\r\n })\r\n localStorage.setItem('relations', JSON.stringify(relations))\r\n return cards\r\n}\r\nconst genreBadge = document.createElement('span')\r\ngenreBadge.classList.add('badge', 'badge-pill', 'shadow')\r\n\r\nfunction genreBadges (genres = []) {\r\n const badges = []\r\n for (const genre of genres) {\r\n const badge = genreBadge.cloneNode(true)\r\n badge.textContent = genre\r\n badges.push(badge)\r\n }\r\n return badges\r\n}\r\nconst detailsMap = [\r\n { property: 'genres', label: 'Genres', icon: 'theater_comedy' },\r\n { property: 'season', label: 'Season', icon: 'spa', custom: 'property' },\r\n { property: 'episodes', label: 'Episodes', icon: 'theaters', custom: 'property' },\r\n { property: 'duration', label: 'Duration', icon: 'timer' },\r\n { property: 'format', label: 'Format', icon: 'monitor' },\r\n { property: 'status', label: 'Status', icon: 'live_tv' },\r\n { property: 'nodes', label: 'Studio', icon: 'business' },\r\n { property: 'source', label: 'Source', icon: 'source' },\r\n { property: 'averageScore', label: 'Rating', icon: 'trending_up', custom: 'property' },\r\n { property: 'english', label: 'English', icon: 'title' },\r\n { property: 'romaji', label: 'Romaji', icon: 'translate' },\r\n { property: 'native', label: 'Native', icon: '日本', custom: 'icon' }\r\n]\r\n/* global detailTemplate */\r\nconst detailTemp = detailTemplate.cloneNode(true).content\r\nfunction mediaDetails (media) {\r\n const details = []\r\n for (const detail of detailsMap) {\r\n if (media[detail.property]) {\r\n const clone = detailTemp.cloneNode(true)\r\n const nodes = clone.querySelectorAll('*')\r\n switch (media[detail.property].constructor) {\r\n case String: {\r\n nodes[4].textContent = media[detail.property].replace(/_/g, ' ').toLowerCase()\r\n break\r\n }\r\n case Number: {\r\n nodes[4].textContent = media[detail.property]\r\n break\r\n }\r\n case Array: {\r\n if (detail.property === 'nodes') {\r\n nodes[4].textContent = media[detail.property][0] && media[detail.property][0].name\r\n } else {\r\n nodes[4].textContent = media[detail.property].join(', ').replace(/_/g, ' ').toLowerCase()\r\n }\r\n }\r\n }\r\n nodes[1].textContent = detail.icon\r\n nodes[3].textContent = detail.label\r\n switch (detail.custom) {\r\n case 'icon': {\r\n nodes[1].classList.remove('material-icons', 'font-size-24')\r\n nodes[1].classList.add('d-flex', 'align-items-center', 'text-nowrap', 'font-size-12', 'font-weight-bold')\r\n break\r\n }\r\n case 'property': {\r\n if (detail.property === 'episodes' && media.progress) {\r\n nodes[4].innerHTML = `Watched ${media.progress} of ${media.episodes}`\r\n } else if (detail.property === 'averageScore') {\r\n nodes[4].textContent = media.averageScore + '%'\r\n } else if (detail.property === 'season') {\r\n nodes[4].textContent = [media.season?.toLowerCase(), media.seasonYear].filter(f => f).join(' ')\r\n } else {\r\n nodes[4].textContent = media[detail.property]\r\n }\r\n }\r\n }\r\n details.push(clone)\r\n }\r\n }\r\n return details\r\n}\r\n\r\nfunction trailerPopup (trailer) {\r\n trailerVideo.src = ''\r\n halfmoon.toggleModal('trailer')\r\n switch (trailer.site) { // should support the other possible sites too, but i cant find any examples\r\n case 'youtube':\r\n trailerVideo.src = 'https://www.youtube.com/embed/' + trailer.id\r\n break\r\n }\r\n}\r\ntrailerClose.onclick = () => {\r\n trailerVideo.src = ''\r\n}\r\n\r\nnavNowPlaying.onclick = () => { if (client.nowPlaying?.media) viewMedia(client.nowPlaying.media) }\r\n/* global trailerVideo, viewAnime, trailerClose, navNowPlaying */\r\nconst viewNodes = viewAnime.querySelectorAll('*')\r\nexport function viewMedia (input, episode) {\r\n halfmoon.showModal('viewAnime')\r\n const media = flattenObj(input)\r\n viewNodes[9].src = media.extraLarge || media.medium\r\n viewNodes[13].textContent = media.userPreferred\r\n viewNodes[17].textContent = media.averageScore + '%'\r\n viewNodes[20].textContent = media.format === 'TV' ? media.format : media.format?.toLowerCase()\r\n if (media.episodes === 1 || (!media.episodes && !media.episode)) {\r\n viewNodes[14].classList.add('movie')\r\n viewNodes[31].classList.add('movie')\r\n viewNodes[28].textContent = media.duration + ' min'\r\n } else {\r\n viewNodes[31].classList.remove('movie')\r\n viewNodes[14].classList.remove('movie')\r\n viewNodes[24].textContent = media.episodes\r\n }\r\n viewNodes[29].textContent = ''\r\n viewNodes[29].append(...genreBadges(media.genres))\r\n\r\n if (media.episodes || media.episode) {\r\n viewNodes[31].classList.remove('hidden')\r\n viewNodes[33].onclick = () => { nyaaSearch(input, Number(viewNodes[44].value) || 1); halfmoon.hideModal('viewAnime') }\r\n viewNodes[44].value = episode || Math.min(Number(media.progress) + 1 || 1, media.episodes)\r\n viewNodes[35].textContent = media.progress && media.progress !== media.episodes ? 'Continue' : 'Play'\r\n\r\n viewNodes[46].onclick = () => { nyaaSearch(input, Number(viewNodes[56].value) || 1, true); halfmoon.hideModal('viewAnime') }\r\n viewNodes[56].value = episode || Math.min(Number(media.progress) + 1 || 1, media.episodes)\r\n } else {\r\n viewNodes[31].classList.add('hidden')\r\n }\r\n if (media.bannerImage) {\r\n viewNodes[4].style = `background-image: linear-gradient(0deg, rgba(17,20,23,1) 0%, rgba(17,20,23,0.80) 25%, rgba(17,20,23,0.40) 50%, rgba(37,40,44,0) 100%), url('${media.bannerImage}') !important`\r\n } else {\r\n viewNodes[4].style = 'background-image: linear-gradient(0deg, rgba(17,20,23,1) 0%, rgba(17,20,23,0.80) 25%, rgba(17,20,23,0.40) 50%, rgba(37,40,44,0) 100%) !important'\r\n }\r\n\r\n viewNodes[57].onclick = () => trailerPopup(input.trailer)\r\n\r\n viewNodes[63].innerHTML = media.description\r\n\r\n viewNodes[68].textContent = ''\r\n viewNodes[68].append(...mediaDetails(media))\r\n}\r\n\r\nexport let alID // login icon\r\n/* global oauth */\r\nexport function initMenu () {\r\n if (localStorage.getItem('ALtoken')) {\r\n alRequest({ method: 'Viewer' }).then(result => {\r\n oauth.removeAttribute('href')\r\n oauth.setAttribute('data-title', `${result.data.Viewer.name}\\nClick To Logout`)\r\n oauth.innerHTML = `\r\n \r\n \r\n ${result.data.Viewer.name}\r\n logout\r\n `\r\n oauth.onclick = () => {\r\n localStorage.removeItem('ALtoken')\r\n location.reload()\r\n }\r\n alID = result.data.Viewer.id\r\n loadHomePage()\r\n })\r\n } else {\r\n loadHomePage()\r\n home.classList.add('noauth')\r\n }\r\n}\r\n","/* globals video, player, pageWrapper, subtitle1list */\r\n\r\nimport WebTorrentPlayer from 'webtorrent-player'\r\nimport { searchParams } from './util.js'\r\nimport { resolveFileMedia, nyaaSearch } from './anime.js'\r\nimport { alEntry } from './anilist.js'\r\nimport { settings } from './settings.js'\r\nimport { cardCreator, initMenu } from './interface.js'\r\nimport halfmoon from 'halfmoon'\r\n\r\nconst playerControls = {}\r\nfor (const item of document.getElementsByClassName('ctrl')) {\r\n if (!playerControls[item.dataset.name]) {\r\n playerControls[item.dataset.name] = item\r\n } else {\r\n playerControls[item.dataset.name] = [playerControls[item.dataset.name], item]\r\n }\r\n}\r\nexport const client = new WebTorrentPlayer({\r\n WebTorrentOpts: {\r\n maxConns: 127,\r\n downloadLimit: settings.torrent7 * 1048576,\r\n uploadLimit: settings.torrent7 * 1572864,\r\n tracker: {\r\n announce: settings.torrent10.split('\\n')\r\n }\r\n },\r\n controls: playerControls,\r\n video: video,\r\n player: player,\r\n destroyStore: true,\r\n playerWrapper: pageWrapper,\r\n burnIn: settings.subtitle3,\r\n seekTime: Number(settings.player3),\r\n immerseTime: Number(settings.player2),\r\n visibilityLossPause: settings.player10,\r\n autoNext: settings.player6,\r\n streamedDownload: settings.torrent8,\r\n generateThumbnails: settings.player5,\r\n defaultSSAStyles: Object.values(subtitle1list.options).filter(item => item.value === settings.subtitle1)[0].textContent,\r\n resolveFileMedia: resolveFileMedia\r\n})\r\nclient.on('download-done', ({ file }) => {\r\n halfmoon.initStickyAlert({\r\n content: `${file.name} has finished downloading. Now seeding.`,\r\n title: 'Download Complete',\r\n alertType: 'alert-success',\r\n fillType: ''\r\n })\r\n})\r\nclient.on('watched', ({ filemedia }) => {\r\n if (filemedia?.media?.episodes || filemedia?.media?.nextAiringEpisode?.episode) {\r\n if (settings.other2 && (filemedia.media.episodes || filemedia.media.nextAiringEpisode?.episode > filemedia.episodeNumber)) {\r\n alEntry(filemedia)\r\n }\r\n // halfmoon.initStickyAlert({\r\n // content: `Do You Want To Mark
${filemedia.mediaTitle}
Episode ${filemedia.episodeNumber} As Completed?
\r\n // \r\n // `,\r\n // title: 'Episode Complete',\r\n // timeShown: 180000\r\n // })\r\n // }\r\n }\r\n})\r\nclient.on('playlist', () => {\r\n window.location.hash = '#playlist'\r\n})\r\nclient.on('next', ({ filemedia }) => {\r\n if (filemedia.media) {\r\n nyaaSearch(filemedia.media, parseInt(filemedia.episodeNumber) + 1)\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: 'Couldn\\'t find anime name! Try specifying a torrent manually.',\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n }\r\n})\r\nclient.on('prev', ({ filemedia }) => {\r\n if (filemedia.media) {\r\n nyaaSearch(filemedia.media, filemedia.episodeNumber - 1)\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: 'Couldn\\'t find anime name! Try specifying a torrent manually.',\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n }\r\n})\r\nclient.on('offline-torrent', torrent => {\r\n resolveFileMedia({ fileName: torrent.name }).then(mediaInformation => {\r\n mediaInformation.onclick = () => client.playTorrent(torrent, { media: mediaInformation, episode: mediaInformation.episode })\r\n const template = cardCreator(mediaInformation)\r\n document.querySelector('.downloads').appendChild(template)\r\n })\r\n})\r\nclient.on('video-files', async ({ files, torrent }) => {\r\n document.querySelector('.playlist').textContent = ''\r\n const cards = []\r\n for (const file of files) {\r\n const mediaInformation = await resolveFileMedia({ fileName: file.name })\r\n mediaInformation.onclick = () => {\r\n client.buildVideo(torrent, {\r\n media: mediaInformation,\r\n episode: mediaInformation.parseObject.episode,\r\n file: file\r\n })\r\n }\r\n cards.push(cardCreator(mediaInformation))\r\n }\r\n document.querySelector('.playlist').append(...cards)\r\n})\r\nclient.on('no-files', torrent => {\r\n halfmoon.initStickyAlert({\r\n content: `Couldn't find video file for ${torrent.infoHash}!`,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n})\r\nclient.on('no peers', torrent => {\r\n if (torrent.progress !== 1) {\r\n halfmoon.initStickyAlert({\r\n content: `Couldn't find peers for ${torrent.infoHash}! Try a torrent with more seeders.`,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n }\r\n})\r\nclient.nowPlaying = { name: 'Miru' }\r\n\r\nwindow.client = client\r\n\r\nwindow.onbeforeunload = () => { return '' }\r\n\r\nif (searchParams.get('file')) client.playTorrent(searchParams.get('file'))\r\n\r\nqueueMicrotask(initMenu)\r\n","/* global torrent4list */\r\n\r\nimport { settings } from './settings.js'\r\nimport { userBrowser, DOMPARSER } from './util.js'\r\nimport { client } from './main.js'\r\nimport halfmoon from 'halfmoon'\r\nimport { episodeRx } from './anime.js'\r\n\r\nconst exclusions = {\r\n edge: ['DTS'],\r\n chromium: ['DTS', 'AC3', 'HEVC', 'x265', 'H.265'],\r\n firefox: ['DTS', 'AC3', 'HEVC', 'x265', 'H.265', '.3gp', '.mkv']\r\n}\r\nif (!('audioTracks' in HTMLVideoElement.prototype)) {\r\n exclusions[userBrowser].push('mutli audio', 'dual audio')\r\n}\r\n\r\nexport function getRSSContent (url) {\r\n return fetch(url).then(res => {\r\n if (res.ok) {\r\n return res.text().then(xmlTxt => {\r\n return DOMPARSER(xmlTxt, 'text/xml')\r\n })\r\n }\r\n throw Error(res.statusText)\r\n }).catch(error => {\r\n halfmoon.initStickyAlert({\r\n content: 'Failed fetching RSS!
' + error,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n console.error(error)\r\n })\r\n}\r\n\r\nexport async function nyaaRss (media, episode, isOffline) {\r\n const frag = document.createDocumentFragment()\r\n const titles = [...new Set(Object.values(media.title).concat(media.synonyms).filter(name => name != null))].join(')|(').replace(/&/g, '%26')\r\n const ep = (media.episodes !== 1 && ((media.status === 'FINISHED' && settings.torrent9) ? `\"01-${media.episodes}\"|\"01~${media.episodes}\"|\"Batch\"|\"Complete\"|\"+${episode}+\"|\"+${episode}v\"|\"S01\"` : `\"+${episode}+\"|\"+${episode}v\"`)) || ''\r\n const excl = exclusions[userBrowser].join('|')\r\n const quality = `\"${settings.torrent1}\"` || '\"1080p\"'\r\n const trusted = settings.torrent3 === true ? 2 : 0\r\n const url = new URL(`https://meowinjapanese.cf/?page=rss&c=1_2&f=${trusted}&s=seeders&o=desc&q=(${titles})${ep}${quality}-(${excl})`)\r\n\r\n const nodes = (await getRSSContent(url)).querySelectorAll('item *')\r\n if (!nodes.length) return frag\r\n const entries = []\r\n for (let index = Math.floor(nodes.length / 15); index--;) {\r\n const position = index * 15\r\n entries[index] = {\r\n title: nodes[position].textContent,\r\n hash: nodes[position + 1].textContent,\r\n seeders: nodes[position + 4].textContent,\r\n leechers: nodes[position + 5].textContent,\r\n downloads: nodes[position + 6].textContent,\r\n size: nodes[position + 10].textContent\r\n }\r\n }\r\n entries.sort((a, b) => b.seeders - a.seeders)\r\n const streamingEpisode = media?.streamingEpisodes.filter(episode => episodeRx.exec(episode.title) && Number(episodeRx.exec(episode.title)[1]) === Number(episode))[0]\r\n const fileMedia = {\r\n mediaTitle: media?.title.userPreferred,\r\n episodeNumber: Number(episode),\r\n episodeTitle: streamingEpisode ? episodeRx.exec(streamingEpisode.title)[2] : undefined,\r\n episodeThumbnail: streamingEpisode?.thumbnail,\r\n mediaCover: media?.coverImage.medium,\r\n name: 'Miru',\r\n media: media\r\n }\r\n if (settings.torrent2) {\r\n if (isOffline) {\r\n client.offlineDownload(entries[0].hash)\r\n } else {\r\n client.playTorrent(entries[0].hash, { media: fileMedia, episode: episode })\r\n }\r\n halfmoon.toggleModal('tsearch')\r\n }\r\n entries.forEach((entry, index) => {\r\n const template = document.createElement('tr')\r\n template.innerHTML += `\r\n${(index + 1)}\r\n${entry.title}\r\n${entry.size}\r\n${entry.seeders}\r\n${entry.leechers}\r\n${entry.downloads}\r\nPlay`\r\n template.onclick = () => {\r\n if (isOffline) {\r\n client.offlineDownload(entry.hash)\r\n } else {\r\n client.playTorrent(entry.hash, { media: fileMedia, episode: episode })\r\n }\r\n halfmoon.hideModal('tsearch')\r\n }\r\n frag.appendChild(template)\r\n })\r\n return frag\r\n}\r\n\r\nexport function getRSSurl () {\r\n if (Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0]) {\r\n return settings.torrent4 === 'Erai-raws' ? new URL(Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0].innerHTML + settings.torrent1 + '-magnet') : new URL(Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0].innerHTML + settings.torrent1)\r\n } else {\r\n return settings.torrent4 + settings.torrent1 // add custom RSS\r\n }\r\n}\r\n","/* global volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent5, torrent5label, torrent7, torrent8, torrent9, torrent10, other1, other2, setRes, settingsTab, regProtButton, clearRelCache */\r\nimport { get, set, createStore } from 'idb-keyval'\r\nexport const settingsElements = [\r\n volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent7, torrent8, torrent9, torrent10, other1, other2\r\n]\r\nsetRes.addEventListener('click', restoreDefaults)\r\nsettingsTab.addEventListener('click', applySettingsTimeout)\r\nvolume.addEventListener('click', applySettingsTimeout)\r\nregProtButton.addEventListener('click', registerProtocol)\r\nexport const settings = JSON.parse(localStorage.getItem('settings')) || {}\r\n\r\nlet customStore\r\n\r\nif ('showDirectoryPicker' in window) {\r\n customStore = createStore('handle-store', 'handles')\r\n settings.torrent5 = get('directory', customStore).then(handle => {\r\n if (handle) {\r\n torrent5label.value = 'Folder: ' + handle.name\r\n return handle\r\n }\r\n return null\r\n })\r\n torrent5.classList.remove('d-none')\r\n torrent5.onclick = async () => {\r\n const handle = await window.showDirectoryPicker()\r\n await handle.requestPermission({ mode: 'readwrite' })\r\n settings.torrent5 = handle\r\n torrent5label.value = 'Folder: ' + handle.name || 'none'\r\n }\r\n}\r\n\r\nasync function saveSettings () {\r\n for (const element of settingsElements) {\r\n settings[element.id] = element.type === 'checkbox' ? element.checked : element.value\r\n }\r\n localStorage.setItem('settings', JSON.stringify(settings))\r\n if ('showDirectoryPicker' in window) {\r\n if (settings.torrent5) set('directory', await settings.torrent5, customStore)\r\n }\r\n}\r\n\r\nif (Object.keys(settings).length !== settingsElements.length + 1) {\r\n saveSettings()\r\n}\r\n\r\nlet applyTimeout\r\nfunction applySettingsTimeout () {\r\n clearTimeout(applyTimeout)\r\n applyTimeout = setTimeout(saveSettings, 500)\r\n}\r\n\r\nfunction registerProtocol () {\r\n if ('registerProtocolHandler' in navigator) {\r\n navigator.registerProtocolHandler(\r\n 'magnet',\r\n `${location.href.replace(location.hash, '')}#home&file=%s`,\r\n 'Miru'\r\n )\r\n }\r\n}\r\n\r\nfunction restoreDefaults () {\r\n localStorage.removeItem('settings')\r\n location.reload()\r\n}\r\n\r\nclearRelCache.onclick = () => {\r\n localStorage.removeItem('relations')\r\n location.reload()\r\n}\r\n\r\nfor (const setting of Object.entries(settings)) {\r\n const settingElement = settingsElements.filter(e => e.id === setting[0])[0]\r\n if (settingElement) settingElement.type === 'checkbox' ? settingElement.checked = setting[1] : settingElement.value = setting[1]\r\n}\r\n\r\nother1.oninput = () => other1.checked && Notification.requestPermission().then(perm => { perm === 'denied' ? other1.checked = false : other1.checked = true })\r\n","import halfmoon from 'halfmoon'\r\nhalfmoon.showModal = id => {\r\n const t = document.getElementById(id)\r\n t && t.classList.add('show')\r\n}\r\nhalfmoon.hideModal = id => {\r\n const t = document.getElementById(id)\r\n t && t.classList.remove('show')\r\n}\r\nexport const searchParams = new URLSearchParams(location.href)\r\nif (searchParams.get('access_token')) {\r\n localStorage.setItem('ALtoken', searchParams.get('access_token'))\r\n window.location = '/app/#home'\r\n}\r\nexport const userBrowser = (() => {\r\n if (window.chrome) {\r\n return (navigator.userAgent.indexOf('Edg') !== -1) ? 'edge' : 'chromium'\r\n }\r\n return 'firefox'\r\n})()\r\nexport function countdown (s) {\r\n const d = Math.floor(s / (3600 * 24))\r\n s -= d * 3600 * 24\r\n const h = Math.floor(s / 3600)\r\n s -= h * 3600\r\n const m = Math.floor(s / 60)\r\n s -= m * 60\r\n const tmp = []\r\n if (d) tmp.push(d + 'd')\r\n if (d || h) tmp.push(h + 'h')\r\n if (d || h || m) tmp.push(m + 'm')\r\n return tmp.join(' ')\r\n}\r\n\r\nexport function flattenObj (obj) {\r\n const result = {}\r\n\r\n for (const key in obj) {\r\n if (obj[key] && obj[key].constructor === Object) {\r\n const childObj = flattenObj(obj[key])\r\n\r\n for (const childObjKey in childObj) {\r\n result[childObjKey] = childObj[childObjKey]\r\n }\r\n } else {\r\n result[key] = obj[key]\r\n }\r\n }\r\n return result\r\n}\r\n\r\nexport const DOMPARSER = new DOMParser().parseFromString.bind(new DOMParser())\r\n","const ADDR_RE = /^\\[?([^\\]]+)]?:(\\d+)$/ // ipv4/ipv6/hostname + port\n\nlet cache = new Map()\n\n// reset cache when it gets to 100,000 elements (~ 600KB of ipv4 addresses)\n// so it will not grow to consume all memory in long-running processes\nmodule.exports = function addrToIPPort (addr) {\n if (cache.size === 100000) cache.clear()\n if (!cache.has(addr)) {\n const m = ADDR_RE.exec(addr)\n if (!m) throw new Error(`invalid addr: ${addr}`)\n cache.set(addr, [ m[1], Number(m[2]) ])\n }\n return cache.get(addr)\n}\n","'use strict';\n\nconst asn1 = exports;\n\nasn1.bignum = require('bn.js');\n\nasn1.define = require('./asn1/api').define;\nasn1.base = require('./asn1/base');\nasn1.constants = require('./asn1/constants');\nasn1.decoders = require('./asn1/decoders');\nasn1.encoders = require('./asn1/encoders');\n","'use strict';\n\nconst encoders = require('./encoders');\nconst decoders = require('./decoders');\nconst inherits = require('inherits');\n\nconst api = exports;\n\napi.define = function define(name, body) {\n return new Entity(name, body);\n};\n\nfunction Entity(name, body) {\n this.name = name;\n this.body = body;\n\n this.decoders = {};\n this.encoders = {};\n}\n\nEntity.prototype._createNamed = function createNamed(Base) {\n const name = this.name;\n\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n inherits(Generated, Base);\n Generated.prototype._initNamed = function _initNamed(entity, name) {\n Base.call(this, entity, name);\n };\n\n return new Generated(this);\n};\n\nEntity.prototype._getDecoder = function _getDecoder(enc) {\n enc = enc || 'der';\n // Lazily create decoder\n if (!this.decoders.hasOwnProperty(enc))\n this.decoders[enc] = this._createNamed(decoders[enc]);\n return this.decoders[enc];\n};\n\nEntity.prototype.decode = function decode(data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n};\n\nEntity.prototype._getEncoder = function _getEncoder(enc) {\n enc = enc || 'der';\n // Lazily create encoder\n if (!this.encoders.hasOwnProperty(enc))\n this.encoders[enc] = this._createNamed(encoders[enc]);\n return this.encoders[enc];\n};\n\nEntity.prototype.encode = function encode(data, enc, /* internal */ reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n};\n","'use strict';\n\nconst inherits = require('inherits');\nconst Reporter = require('../base/reporter').Reporter;\nconst Buffer = require('safer-buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n Reporter.call(this, options);\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}\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.isDecoderBuffer = function isDecoderBuffer(data) {\n if (data instanceof DecoderBuffer) {\n return true;\n }\n\n // Or accept compatible API\n const isCompatible = typeof data === 'object' &&\n Buffer.isBuffer(data.base) &&\n data.constructor.name === 'DecoderBuffer' &&\n typeof data.offset === 'number' &&\n typeof data.length === 'number' &&\n typeof data.save === 'function' &&\n typeof data.restore === 'function' &&\n typeof data.isEmpty === 'function' &&\n typeof data.readUInt8 === 'function' &&\n typeof data.skip === 'function' &&\n typeof data.raw === 'function';\n\n return isCompatible;\n};\n\nDecoderBuffer.prototype.save = function save() {\n return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n // Return skipped data\n const res = new DecoderBuffer(this.base);\n res.offset = save.offset;\n res.length = this.offset;\n\n this.offset = save.offset;\n Reporter.prototype.restore.call(this, save.reporter);\n\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)\n return this.base.readUInt8(this.offset++, true);\n else\n return this.error(fail || 'DecoderBuffer overrun');\n};\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n if (!(this.offset + bytes <= this.length))\n return this.error(fail || 'DecoderBuffer overrun');\n\n const res = new DecoderBuffer(this.base);\n\n // Share reporter state\n res._reporterState = this._reporterState;\n\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 (!EncoderBuffer.isEncoderBuffer(item))\n 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))\n 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}\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.isEncoderBuffer = function isEncoderBuffer(data) {\n if (data instanceof EncoderBuffer) {\n return true;\n }\n\n // Or accept compatible API\n const isCompatible = typeof data === 'object' &&\n data.constructor.name === 'EncoderBuffer' &&\n typeof data.length === 'number' &&\n typeof data.join === 'function';\n\n return isCompatible;\n};\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n if (!out)\n out = Buffer.alloc(this.length);\n if (!offset)\n offset = 0;\n\n if (this.length === 0)\n 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')\n out[offset] = this.value;\n else if (typeof this.value === 'string')\n out.write(this.value, offset);\n else if (Buffer.isBuffer(this.value))\n this.value.copy(out, offset);\n offset += this.length;\n }\n\n return out;\n};\n","'use strict';\n\nconst base = exports;\n\nbase.Reporter = require('./reporter').Reporter;\nbase.DecoderBuffer = require('./buffer').DecoderBuffer;\nbase.EncoderBuffer = require('./buffer').EncoderBuffer;\nbase.Node = require('./node');\n","'use strict';\n\nconst Reporter = require('../base/reporter').Reporter;\nconst EncoderBuffer = require('../base/buffer').EncoderBuffer;\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst assert = require('minimalistic-assert');\n\n// Supported tags\nconst tags = [\n 'seq', 'seqof', 'set', 'setof', 'objid', 'bool',\n 'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',\n 'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',\n 'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'\n];\n\n// Public methods list\nconst methods = [\n 'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',\n 'any', 'contains'\n].concat(tags);\n\n// Overrided methods list\nconst overrided = [\n '_peekTag', '_decodeTag', '_use',\n '_decodeStr', '_decodeObjid', '_decodeTime',\n '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',\n\n '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',\n '_encodeNull', '_encodeInt', '_encodeBool'\n];\n\nfunction Node(enc, parent, name) {\n const state = {};\n this._baseState = state;\n\n state.name = name;\n state.enc = enc;\n\n state.parent = parent || null;\n state.children = null;\n\n // State\n state.tag = null;\n state.args = null;\n state.reverseArgs = null;\n state.choice = null;\n state.optional = false;\n state.any = false;\n state.obj = false;\n state.use = null;\n state.useDecoder = null;\n state.key = null;\n state['default'] = null;\n state.explicit = null;\n state.implicit = null;\n state.contains = null;\n\n // Should create new instance on each method\n if (!state.parent) {\n state.children = [];\n this._wrap();\n }\n}\nmodule.exports = Node;\n\nconst stateProps = [\n 'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',\n 'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',\n 'implicit', 'contains'\n];\n\nNode.prototype.clone = function clone() {\n const state = this._baseState;\n const cstate = {};\n stateProps.forEach(function(prop) {\n cstate[prop] = state[prop];\n });\n const res = new this.constructor(cstate.parent);\n res._baseState = cstate;\n return res;\n};\n\nNode.prototype._wrap = function wrap() {\n const state = this._baseState;\n methods.forEach(function(method) {\n this[method] = function _wrappedMethod() {\n const clone = new this.constructor(this);\n state.children.push(clone);\n return clone[method].apply(clone, arguments);\n };\n }, this);\n};\n\nNode.prototype._init = function init(body) {\n const state = this._baseState;\n\n assert(state.parent === null);\n body.call(this);\n\n // Filter children\n state.children = state.children.filter(function(child) {\n return child._baseState.parent === this;\n }, this);\n assert.equal(state.children.length, 1, 'Root node can have only one child');\n};\n\nNode.prototype._useArgs = function useArgs(args) {\n const state = this._baseState;\n\n // Filter children and args\n const children = args.filter(function(arg) {\n return arg instanceof this.constructor;\n }, this);\n args = args.filter(function(arg) {\n return !(arg instanceof this.constructor);\n }, this);\n\n if (children.length !== 0) {\n assert(state.children === null);\n state.children = children;\n\n // Replace parent to maintain backward link\n children.forEach(function(child) {\n child._baseState.parent = this;\n }, this);\n }\n if (args.length !== 0) {\n assert(state.args === null);\n state.args = args;\n state.reverseArgs = args.map(function(arg) {\n if (typeof arg !== 'object' || arg.constructor !== Object)\n return arg;\n\n const res = {};\n Object.keys(arg).forEach(function(key) {\n if (key == (key | 0))\n key |= 0;\n const value = arg[key];\n res[value] = key;\n });\n return res;\n });\n }\n};\n\n//\n// Overrided methods\n//\n\noverrided.forEach(function(method) {\n Node.prototype[method] = function _overrided() {\n const state = this._baseState;\n throw new Error(method + ' not implemented for encoding: ' + state.enc);\n };\n});\n\n//\n// Public methods\n//\n\ntags.forEach(function(tag) {\n Node.prototype[tag] = function _tagMethod() {\n const state = this._baseState;\n const args = Array.prototype.slice.call(arguments);\n\n assert(state.tag === null);\n state.tag = tag;\n\n this._useArgs(args);\n\n return this;\n };\n});\n\nNode.prototype.use = function use(item) {\n assert(item);\n const state = this._baseState;\n\n assert(state.use === null);\n state.use = item;\n\n return this;\n};\n\nNode.prototype.optional = function optional() {\n const state = this._baseState;\n\n state.optional = true;\n\n return this;\n};\n\nNode.prototype.def = function def(val) {\n const state = this._baseState;\n\n assert(state['default'] === null);\n state['default'] = val;\n state.optional = true;\n\n return this;\n};\n\nNode.prototype.explicit = function explicit(num) {\n const state = this._baseState;\n\n assert(state.explicit === null && state.implicit === null);\n state.explicit = num;\n\n return this;\n};\n\nNode.prototype.implicit = function implicit(num) {\n const state = this._baseState;\n\n assert(state.explicit === null && state.implicit === null);\n state.implicit = num;\n\n return this;\n};\n\nNode.prototype.obj = function obj() {\n const state = this._baseState;\n const args = Array.prototype.slice.call(arguments);\n\n state.obj = true;\n\n if (args.length !== 0)\n this._useArgs(args);\n\n return this;\n};\n\nNode.prototype.key = function key(newKey) {\n const state = this._baseState;\n\n assert(state.key === null);\n state.key = newKey;\n\n return this;\n};\n\nNode.prototype.any = function any() {\n const state = this._baseState;\n\n state.any = true;\n\n return this;\n};\n\nNode.prototype.choice = function choice(obj) {\n const state = this._baseState;\n\n assert(state.choice === null);\n state.choice = obj;\n this._useArgs(Object.keys(obj).map(function(key) {\n return obj[key];\n }));\n\n return this;\n};\n\nNode.prototype.contains = function contains(item) {\n const state = this._baseState;\n\n assert(state.use === null);\n state.contains = item;\n\n return this;\n};\n\n//\n// Decoding\n//\n\nNode.prototype._decode = function decode(input, options) {\n const state = this._baseState;\n\n // Decode root node\n if (state.parent === null)\n return input.wrapResult(state.children[0]._decode(input, options));\n\n let result = state['default'];\n let present = true;\n\n let prevKey = null;\n if (state.key !== null)\n prevKey = input.enterKey(state.key);\n\n // Check if tag is there\n if (state.optional) {\n let tag = null;\n if (state.explicit !== null)\n tag = state.explicit;\n else if (state.implicit !== null)\n tag = state.implicit;\n else if (state.tag !== null)\n tag = state.tag;\n\n if (tag === null && !state.any) {\n // Trial and Error\n const save = input.save();\n try {\n if (state.choice === null)\n this._decodeGeneric(state.tag, input, options);\n else\n this._decodeChoice(input, options);\n present = true;\n } catch (e) {\n present = false;\n }\n input.restore(save);\n } else {\n present = this._peekTag(input, tag, state.any);\n\n if (input.isError(present))\n return present;\n }\n }\n\n // Push object on stack\n let prevObj;\n if (state.obj && present)\n prevObj = input.enterObject();\n\n if (present) {\n // Unwrap explicit values\n if (state.explicit !== null) {\n const explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit))\n return explicit;\n input = explicit;\n }\n\n const start = input.offset;\n\n // Unwrap implicit and normal values\n if (state.use === null && state.choice === null) {\n let save;\n if (state.any)\n save = input.save();\n const body = this._decodeTag(\n input,\n state.implicit !== null ? state.implicit : state.tag,\n state.any\n );\n if (input.isError(body))\n return body;\n\n if (state.any)\n result = input.raw(save);\n else\n input = body;\n }\n\n if (options && options.track && state.tag !== null)\n options.track(input.path(), start, input.length, 'tagged');\n\n if (options && options.track && state.tag !== null)\n options.track(input.path(), input.offset, input.length, 'content');\n\n // Select proper method for tag\n if (state.any) {\n // no-op\n } else if (state.choice === null) {\n result = this._decodeGeneric(state.tag, input, options);\n } else {\n result = this._decodeChoice(input, options);\n }\n\n if (input.isError(result))\n return result;\n\n // Decode children\n if (!state.any && state.choice === null && state.children !== null) {\n state.children.forEach(function decodeChildren(child) {\n // NOTE: We are ignoring errors here, to let parser continue with other\n // parts of encoded data\n child._decode(input, options);\n });\n }\n\n // Decode contained/encoded by schema, only in bit or octet strings\n if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {\n const data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)\n ._decode(data, options);\n }\n }\n\n // Pop object\n if (state.obj && present)\n result = input.leaveObject(prevObj);\n\n // Set key\n if (state.key !== null && (result !== null || present === true))\n input.leaveKey(prevKey, state.key, result);\n else if (prevKey !== null)\n input.exitKey(prevKey);\n\n return result;\n};\n\nNode.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {\n const state = this._baseState;\n\n if (tag === 'seq' || tag === 'set')\n return null;\n if (tag === 'seqof' || tag === 'setof')\n return this._decodeList(input, tag, state.args[0], options);\n else if (/str$/.test(tag))\n return this._decodeStr(input, tag, options);\n else if (tag === 'objid' && state.args)\n return this._decodeObjid(input, state.args[0], state.args[1], options);\n else if (tag === 'objid')\n return this._decodeObjid(input, null, null, options);\n else if (tag === 'gentime' || tag === 'utctime')\n return this._decodeTime(input, tag, options);\n else if (tag === 'null_')\n return this._decodeNull(input, options);\n else if (tag === 'bool')\n return this._decodeBool(input, options);\n else if (tag === 'objDesc')\n return this._decodeStr(input, tag, options);\n else if (tag === 'int' || tag === 'enum')\n return this._decodeInt(input, state.args && state.args[0], options);\n\n if (state.use !== null) {\n return this._getUse(state.use, input._reporterState.obj)\n ._decode(input, options);\n } else {\n return input.error('unknown tag: ' + tag);\n }\n};\n\nNode.prototype._getUse = function _getUse(entity, obj) {\n\n const state = this._baseState;\n // Create altered use decoder if implicit is set\n state.useDecoder = this._use(entity, obj);\n assert(state.useDecoder._baseState.parent === null);\n state.useDecoder = state.useDecoder._baseState.children[0];\n if (state.implicit !== state.useDecoder._baseState.implicit) {\n state.useDecoder = state.useDecoder.clone();\n state.useDecoder._baseState.implicit = state.implicit;\n }\n return state.useDecoder;\n};\n\nNode.prototype._decodeChoice = function decodeChoice(input, options) {\n const state = this._baseState;\n let result = null;\n let match = false;\n\n Object.keys(state.choice).some(function(key) {\n const save = input.save();\n const node = state.choice[key];\n try {\n const value = node._decode(input, options);\n if (input.isError(value))\n return false;\n\n result = { type: key, value: value };\n match = true;\n } catch (e) {\n input.restore(save);\n return false;\n }\n return true;\n }, this);\n\n if (!match)\n return input.error('Choice not matched');\n\n return result;\n};\n\n//\n// Encoding\n//\n\nNode.prototype._createEncoderBuffer = function createEncoderBuffer(data) {\n return new EncoderBuffer(data, this.reporter);\n};\n\nNode.prototype._encode = function encode(data, reporter, parent) {\n const state = this._baseState;\n if (state['default'] !== null && state['default'] === data)\n return;\n\n const result = this._encodeValue(data, reporter, parent);\n if (result === undefined)\n return;\n\n if (this._skipDefault(result, reporter, parent))\n return;\n\n return result;\n};\n\nNode.prototype._encodeValue = function encode(data, reporter, parent) {\n const state = this._baseState;\n\n // Decode root node\n if (state.parent === null)\n return state.children[0]._encode(data, reporter || new Reporter());\n\n let result = null;\n\n // Set reporter to share it with a child class\n this.reporter = reporter;\n\n // Check if data is there\n if (state.optional && data === undefined) {\n if (state['default'] !== null)\n data = state['default'];\n else\n return;\n }\n\n // Encode children first\n let content = null;\n let primitive = false;\n if (state.any) {\n // Anything that was given is translated to buffer\n result = this._createEncoderBuffer(data);\n } else if (state.choice) {\n result = this._encodeChoice(data, reporter);\n } else if (state.contains) {\n content = this._getUse(state.contains, parent)._encode(data, reporter);\n primitive = true;\n } else if (state.children) {\n content = state.children.map(function(child) {\n if (child._baseState.tag === 'null_')\n return child._encode(null, reporter, data);\n\n if (child._baseState.key === null)\n return reporter.error('Child should have a key');\n const prevKey = reporter.enterKey(child._baseState.key);\n\n if (typeof data !== 'object')\n return reporter.error('Child expected, but input is not object');\n\n const res = child._encode(data[child._baseState.key], reporter, data);\n reporter.leaveKey(prevKey);\n\n return res;\n }, this).filter(function(child) {\n return child;\n });\n content = this._createEncoderBuffer(content);\n } else {\n if (state.tag === 'seqof' || state.tag === 'setof') {\n // TODO(indutny): this should be thrown on DSL level\n if (!(state.args && state.args.length === 1))\n return reporter.error('Too many args for : ' + state.tag);\n\n if (!Array.isArray(data))\n return reporter.error('seqof/setof, but data is not Array');\n\n const child = this.clone();\n child._baseState.implicit = null;\n content = this._createEncoderBuffer(data.map(function(item) {\n const state = this._baseState;\n\n return this._getUse(state.args[0], data)._encode(item, reporter);\n }, child));\n } else if (state.use !== null) {\n result = this._getUse(state.use, parent)._encode(data, reporter);\n } else {\n content = this._encodePrimitive(state.tag, data);\n primitive = true;\n }\n }\n\n // Encode data itself\n if (!state.any && state.choice === null) {\n const tag = state.implicit !== null ? state.implicit : state.tag;\n const cls = state.implicit === null ? 'universal' : 'context';\n\n if (tag === null) {\n if (state.use === null)\n reporter.error('Tag could be omitted only for .use()');\n } else {\n if (state.use === null)\n result = this._encodeComposite(tag, primitive, cls, content);\n }\n }\n\n // Wrap in explicit\n if (state.explicit !== null)\n result = this._encodeComposite(state.explicit, false, 'context', result);\n\n return result;\n};\n\nNode.prototype._encodeChoice = function encodeChoice(data, reporter) {\n const state = this._baseState;\n\n const node = state.choice[data.type];\n if (!node) {\n assert(\n false,\n data.type + ' not found in ' +\n JSON.stringify(Object.keys(state.choice)));\n }\n return node._encode(data.value, reporter);\n};\n\nNode.prototype._encodePrimitive = function encodePrimitive(tag, data) {\n const state = this._baseState;\n\n if (/str$/.test(tag))\n return this._encodeStr(data, tag);\n else if (tag === 'objid' && state.args)\n return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n else if (tag === 'objid')\n return this._encodeObjid(data, null, null);\n else if (tag === 'gentime' || tag === 'utctime')\n return this._encodeTime(data, tag);\n else if (tag === 'null_')\n return this._encodeNull();\n else if (tag === 'int' || tag === 'enum')\n return this._encodeInt(data, state.args && state.reverseArgs[0]);\n else if (tag === 'bool')\n return this._encodeBool(data);\n else if (tag === 'objDesc')\n return this._encodeStr(data, tag);\n else\n throw new Error('Unsupported tag: ' + tag);\n};\n\nNode.prototype._isNumstr = function isNumstr(str) {\n return /^[0-9 ]*$/.test(str);\n};\n\nNode.prototype._isPrintstr = function isPrintstr(str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n};\n","'use strict';\n\nconst inherits = require('inherits');\n\nfunction Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: []\n };\n}\nexports.Reporter = Reporter;\n\nReporter.prototype.isError = function isError(obj) {\n return obj instanceof ReporterError;\n};\n\nReporter.prototype.save = function save() {\n const state = this._reporterState;\n\n return { obj: state.obj, pathLen: state.path.length };\n};\n\nReporter.prototype.restore = function restore(data) {\n const state = this._reporterState;\n\n state.obj = data.obj;\n state.path = state.path.slice(0, data.pathLen);\n};\n\nReporter.prototype.enterKey = function enterKey(key) {\n return this._reporterState.path.push(key);\n};\n\nReporter.prototype.exitKey = function exitKey(index) {\n const state = this._reporterState;\n\n state.path = state.path.slice(0, index - 1);\n};\n\nReporter.prototype.leaveKey = function leaveKey(index, key, value) {\n const state = this._reporterState;\n\n this.exitKey(index);\n if (state.obj !== null)\n state.obj[key] = value;\n};\n\nReporter.prototype.path = function path() {\n return this._reporterState.path.join('/');\n};\n\nReporter.prototype.enterObject = function enterObject() {\n const state = this._reporterState;\n\n const prev = state.obj;\n state.obj = {};\n return prev;\n};\n\nReporter.prototype.leaveObject = function leaveObject(prev) {\n const state = this._reporterState;\n\n const now = state.obj;\n state.obj = prev;\n return now;\n};\n\nReporter.prototype.error = function error(msg) {\n let err;\n const state = this._reporterState;\n\n const inherited = msg instanceof ReporterError;\n if (inherited) {\n err = msg;\n } else {\n err = new ReporterError(state.path.map(function(elem) {\n return '[' + JSON.stringify(elem) + ']';\n }).join(''), msg.message || msg, msg.stack);\n }\n\n if (!state.options.partial)\n throw err;\n\n if (!inherited)\n state.errors.push(err);\n\n return err;\n};\n\nReporter.prototype.wrapResult = function wrapResult(result) {\n const state = this._reporterState;\n if (!state.options.partial)\n return result;\n\n return {\n result: this.isError(result) ? null : result,\n errors: state.errors\n };\n};\n\nfunction ReporterError(path, msg) {\n this.path = path;\n this.rethrow(msg);\n}\ninherits(ReporterError, Error);\n\nReporterError.prototype.rethrow = function rethrow(msg) {\n this.message = msg + ' at: ' + (this.path || '(shallow)');\n if (Error.captureStackTrace)\n Error.captureStackTrace(this, ReporterError);\n\n if (!this.stack) {\n try {\n // IE only adds stack when thrown\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n }\n return this;\n};\n","'use strict';\n\n// Helper\nfunction reverse(map) {\n const res = {};\n\n Object.keys(map).forEach(function(key) {\n // Convert key to integer if it is stringified\n if ((key | 0) == key)\n key = key | 0;\n\n const value = map[key];\n res[value] = key;\n });\n\n return res;\n}\n\nexports.tagClass = {\n 0: 'universal',\n 1: 'application',\n 2: 'context',\n 3: 'private'\n};\nexports.tagClassByName = reverse(exports.tagClass);\n\nexports.tag = {\n 0x00: 'end',\n 0x01: 'bool',\n 0x02: 'int',\n 0x03: 'bitstr',\n 0x04: 'octstr',\n 0x05: 'null_',\n 0x06: 'objid',\n 0x07: 'objDesc',\n 0x08: 'external',\n 0x09: 'real',\n 0x0a: 'enum',\n 0x0b: 'embed',\n 0x0c: 'utf8str',\n 0x0d: 'relativeOid',\n 0x10: 'seq',\n 0x11: 'set',\n 0x12: 'numstr',\n 0x13: 'printstr',\n 0x14: 't61str',\n 0x15: 'videostr',\n 0x16: 'ia5str',\n 0x17: 'utctime',\n 0x18: 'gentime',\n 0x19: 'graphstr',\n 0x1a: 'iso646str',\n 0x1b: 'genstr',\n 0x1c: 'unistr',\n 0x1d: 'charstr',\n 0x1e: 'bmpstr'\n};\nexports.tagByName = reverse(exports.tag);\n","'use strict';\n\nconst constants = exports;\n\n// Helper\nconstants._reverse = function reverse(map) {\n const res = {};\n\n Object.keys(map).forEach(function(key) {\n // Convert key to integer if it is stringified\n if ((key | 0) == key)\n key = key | 0;\n\n const value = map[key];\n res[value] = key;\n });\n\n return res;\n};\n\nconstants.der = require('./der');\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst bignum = require('bn.js');\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DERDecoder(entity) {\n this.enc = 'der';\n this.name = entity.name;\n this.entity = entity;\n\n // Construct base tree\n this.tree = new DERNode();\n this.tree._init(entity.body);\n}\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n if (!DecoderBuffer.isDecoderBuffer(data)) {\n data = new DecoderBuffer(data, options);\n }\n\n return this.tree._decode(data, options);\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n if (buffer.isEmpty())\n return false;\n\n const state = buffer.save();\n const decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n if (buffer.isError(decodedTag))\n return decodedTag;\n\n buffer.restore(state);\n\n return decodedTag.tag === tag || decodedTag.tagStr === tag ||\n (decodedTag.tagStr + 'of') === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n const decodedTag = derDecodeTag(buffer,\n 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag))\n return decodedTag;\n\n let len = derDecodeLen(buffer,\n decodedTag.primitive,\n 'Failed to get length of \"' + tag + '\"');\n\n // Failure\n if (buffer.isError(len))\n return len;\n\n if (!any &&\n decodedTag.tag !== tag &&\n decodedTag.tagStr !== tag &&\n decodedTag.tagStr + 'of' !== tag) {\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n }\n\n if (decodedTag.primitive || len !== null)\n return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n\n // Indefinite length... find END tag\n const state = buffer.save();\n const res = this._skipUntilEnd(\n buffer,\n 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n if (buffer.isError(res))\n return res;\n\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 for (;;) {\n const tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag))\n return tag;\n const len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len))\n return len;\n\n let res;\n if (tag.primitive || len !== null)\n res = buffer.skip(len);\n else\n res = this._skipUntilEnd(buffer, fail);\n\n // Failure\n if (buffer.isError(res))\n return res;\n\n if (tag.tagStr === 'end')\n break;\n }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,\n options) {\n const result = [];\n while (!buffer.isEmpty()) {\n const possibleEnd = this._peekTag(buffer, 'end');\n if (buffer.isError(possibleEnd))\n return possibleEnd;\n\n const res = decoder.decode(buffer, 'der', options);\n if (buffer.isError(res) && possibleEnd)\n break;\n result.push(res);\n }\n return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n if (tag === 'bitstr') {\n const unused = buffer.readUInt8();\n if (buffer.isError(unused))\n return unused;\n return { unused: unused, data: buffer.raw() };\n } else if (tag === 'bmpstr') {\n const raw = buffer.raw();\n if (raw.length % 2 === 1)\n return buffer.error('Decoding of string type: bmpstr length mismatch');\n\n let str = '';\n for (let i = 0; i < raw.length / 2; i++) {\n str += String.fromCharCode(raw.readUInt16BE(i * 2));\n }\n return str;\n } else if (tag === 'numstr') {\n const numstr = buffer.raw().toString('ascii');\n if (!this._isNumstr(numstr)) {\n return buffer.error('Decoding of string type: ' +\n 'numstr unsupported characters');\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 const printstr = buffer.raw().toString('ascii');\n if (!this._isPrintstr(printstr)) {\n return buffer.error('Decoding of string type: ' +\n 'printstr unsupported characters');\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 let result;\n const identifiers = [];\n let ident = 0;\n let subident = 0;\n while (!buffer.isEmpty()) {\n subident = buffer.readUInt8();\n ident <<= 7;\n ident |= subident & 0x7f;\n if ((subident & 0x80) === 0) {\n identifiers.push(ident);\n ident = 0;\n }\n }\n if (subident & 0x80)\n identifiers.push(ident);\n\n const first = (identifiers[0] / 40) | 0;\n const second = identifiers[0] % 40;\n\n if (relative)\n result = identifiers;\n else\n result = [first, second].concat(identifiers.slice(1));\n\n if (values) {\n let tmp = values[result.join(' ')];\n if (tmp === undefined)\n tmp = values[result.join('.')];\n if (tmp !== undefined)\n result = tmp;\n }\n\n return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n const str = buffer.raw().toString();\n\n let year;\n let mon;\n let day;\n let hour;\n let min;\n let sec;\n if (tag === 'gentime') {\n year = str.slice(0, 4) | 0;\n mon = str.slice(4, 6) | 0;\n day = str.slice(6, 8) | 0;\n hour = str.slice(8, 10) | 0;\n min = str.slice(10, 12) | 0;\n sec = str.slice(12, 14) | 0;\n } else if (tag === 'utctime') {\n year = str.slice(0, 2) | 0;\n mon = str.slice(2, 4) | 0;\n day = str.slice(4, 6) | 0;\n hour = str.slice(6, 8) | 0;\n min = str.slice(8, 10) | 0;\n sec = str.slice(10, 12) | 0;\n if (year < 70)\n year = 2000 + year;\n else\n 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() {\n return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n const res = buffer.readUInt8();\n if (buffer.isError(res))\n return res;\n else\n return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n // Bigint, return as it is (assume big endian)\n const raw = buffer.raw();\n let res = new bignum(raw);\n\n if (values)\n res = values[res.toString(10)] || res;\n\n return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n if (typeof entity === 'function')\n entity = entity(obj);\n return entity._getDecoder('der').tree;\n};\n\n// Utility methods\n\nfunction derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag))\n return tag;\n\n const cls = der.tagClass[tag >> 6];\n const primitive = (tag & 0x20) === 0;\n\n // Multi-octet tag - load\n if ((tag & 0x1f) === 0x1f) {\n let oct = tag;\n tag = 0;\n while ((oct & 0x80) === 0x80) {\n oct = buf.readUInt8(fail);\n if (buf.isError(oct))\n return oct;\n\n tag <<= 7;\n tag |= oct & 0x7f;\n }\n } else {\n tag &= 0x1f;\n }\n const tagStr = der.tag[tag];\n\n return {\n cls: cls,\n primitive: primitive,\n tag: tag,\n tagStr: tagStr\n };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len))\n return len;\n\n // Indefinite form\n if (!primitive && len === 0x80)\n return null;\n\n // Definite form\n if ((len & 0x80) === 0) {\n // Short form\n return len;\n }\n\n // Long form\n const num = len & 0x7f;\n if (num > 4)\n return buf.error('length octect is too long');\n\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n const j = buf.readUInt8(fail);\n if (buf.isError(j))\n return j;\n len |= j;\n }\n\n return len;\n}\n","'use strict';\n\nconst decoders = exports;\n\ndecoders.der = require('./der');\ndecoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\n\nconst DERDecoder = require('./der');\n\nfunction PEMDecoder(entity) {\n DERDecoder.call(this, entity);\n this.enc = 'pem';\n}\ninherits(PEMDecoder, DERDecoder);\nmodule.exports = PEMDecoder;\n\nPEMDecoder.prototype.decode = function decode(data, options) {\n const lines = data.toString().split(/[\\r\\n]+/g);\n\n const label = options.label.toUpperCase();\n\n const re = /^-----(BEGIN|END) ([^-]+)-----$/;\n let start = -1;\n let end = -1;\n for (let i = 0; i < lines.length; i++) {\n const match = lines[i].match(re);\n if (match === null)\n continue;\n\n if (match[2] !== label)\n continue;\n\n if (start === -1) {\n if (match[1] !== 'BEGIN')\n break;\n start = i;\n } else {\n if (match[1] !== 'END')\n break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1)\n throw new Error('PEM section not found for: ' + label);\n\n const base64 = lines.slice(start + 1, end).join('');\n // Remove excessive symbols\n base64.replace(/[^a-z0-9+/=]+/gi, '');\n\n const input = Buffer.from(base64, 'base64');\n return DERDecoder.prototype.decode.call(this, input, options);\n};\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DEREncoder(entity) {\n this.enc = 'der';\n this.name = entity.name;\n this.entity = entity;\n\n // Construct base tree\n this.tree = new DERNode();\n this.tree._init(entity.body);\n}\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n return this.tree._encode(data, reporter).join();\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag,\n primitive,\n cls,\n content) {\n const encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n\n // Short form\n if (content.length < 0x80) {\n const header = Buffer.alloc(2);\n header[0] = encodedTag;\n header[1] = content.length;\n return this._createEncoderBuffer([ header, content ]);\n }\n\n // Long form\n // Count octets required to store length\n let lenOctets = 1;\n for (let i = content.length; i >= 0x100; i >>= 8)\n lenOctets++;\n\n const header = Buffer.alloc(1 + 1 + lenOctets);\n header[0] = encodedTag;\n header[1] = 0x80 | lenOctets;\n\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)\n header[i] = j & 0xff;\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 const buf = Buffer.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) {\n buf.writeUInt16BE(str.charCodeAt(i), i * 2);\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 ' +\n 'only digits and space');\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 ' +\n 'only latin upper and lower case letters, ' +\n 'digits, space, apostrophe, left and rigth ' +\n 'parenthesis, plus sign, comma, hyphen, ' +\n 'dot, slash, colon, equal sign, ' +\n 'question mark');\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 +\n ' unsupported');\n }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n if (typeof id === 'string') {\n if (!values)\n return this.reporter.error('string objid given, but no values map found');\n if (!values.hasOwnProperty(id))\n return this.reporter.error('objid not found in values map');\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++)\n id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++)\n id[i] |= 0;\n }\n\n if (!Array.isArray(id)) {\n return this.reporter.error('objid() should be either array or string, ' +\n 'got: ' + JSON.stringify(id));\n }\n\n if (!relative) {\n if (id[1] >= 40)\n return this.reporter.error('Second objid identifier OOB');\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n\n // Count number of octets\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 0x80; ident >>= 7)\n size++;\n }\n\n const objid = Buffer.alloc(size);\n let offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n objid[offset--] = ident & 0x7f;\n while ((ident >>= 7) > 0)\n objid[offset--] = 0x80 | (ident & 0x7f);\n }\n\n return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n if (num < 10)\n return '0' + num;\n else\n return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n let str;\n const date = new Date(time);\n\n if (tag === 'gentime') {\n str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n 'Z'\n ].join('');\n } else if (tag === 'utctime') {\n str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n 'Z'\n ].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)\n return this.reporter.error('String int or enum given, but no values map');\n if (!values.hasOwnProperty(num)) {\n return this.reporter.error('Values map doesn\\'t contain: ' +\n JSON.stringify(num));\n }\n num = values[num];\n }\n\n // Bignum, assume big endian\n if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n const numArray = num.toArray();\n if (!num.sign && numArray[0] & 0x80) {\n numArray.unshift(0);\n }\n num = Buffer.from(numArray);\n }\n\n if (Buffer.isBuffer(num)) {\n let size = num.length;\n if (num.length === 0)\n size++;\n\n const out = Buffer.alloc(size);\n num.copy(out);\n if (num.length === 0)\n out[0] = 0;\n return this._createEncoderBuffer(out);\n }\n\n if (num < 0x80)\n return this._createEncoderBuffer(num);\n\n if (num < 0x100)\n return this._createEncoderBuffer([0, num]);\n\n let size = 1;\n for (let i = num; i >= 0x100; i >>= 8)\n size++;\n\n const out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) {\n out[i] = num & 0xff;\n num >>= 8;\n }\n if(out[0] & 0x80) {\n out.unshift(0);\n }\n\n return this._createEncoderBuffer(Buffer.from(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')\n entity = entity(obj);\n return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n const state = this._baseState;\n let i;\n if (state['default'] === null)\n return false;\n\n const data = dataBuffer.join();\n if (state.defaultBuffer === undefined)\n state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n\n if (data.length !== state.defaultBuffer.length)\n return false;\n\n for (i=0; i < data.length; i++)\n if (data[i] !== state.defaultBuffer[i])\n return false;\n\n return true;\n};\n\n// Utility methods\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n let res;\n\n if (tag === 'seqof')\n tag = 'seq';\n else if (tag === 'setof')\n tag = 'set';\n\n if (der.tagByName.hasOwnProperty(tag))\n res = der.tagByName[tag];\n else if (typeof tag === 'number' && (tag | 0) === tag)\n res = tag;\n else\n return reporter.error('Unknown tag: ' + tag);\n\n if (res >= 0x1f)\n return reporter.error('Multi-octet tag encoding unsupported');\n\n if (!primitive)\n res |= 0x20;\n\n res |= (der.tagClassByName[cls || 'universal'] << 6);\n\n return res;\n}\n","'use strict';\n\nconst encoders = exports;\n\nencoders.der = require('./der');\nencoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst DEREncoder = require('./der');\n\nfunction PEMEncoder(entity) {\n DEREncoder.call(this, entity);\n this.enc = 'pem';\n}\ninherits(PEMEncoder, DEREncoder);\nmodule.exports = PEMEncoder;\n\nPEMEncoder.prototype.encode = function encode(data, options) {\n const buf = DEREncoder.prototype.encode.call(this, data);\n\n const p = buf.toString('base64');\n const out = [ '-----BEGIN ' + options.label + '-----' ];\n for (let i = 0; i < p.length; i += 64)\n out.push(p.slice(i, i + 64));\n out.push('-----END ' + options.label + '-----');\n return out.join('\\n');\n};\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","// Currently in sync with Node.js lib/assert.js\n// https://github.com/nodejs/node/commit/2a51ae424a513ec9a6aa3466baa0cc1d55dd4f3b\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\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\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell 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\n// all 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 BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n'use strict';\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nvar _require = require('./internal/errors'),\n _require$codes = _require.codes,\n ERR_AMBIGUOUS_ARGUMENT = _require$codes.ERR_AMBIGUOUS_ARGUMENT,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_INVALID_ARG_VALUE = _require$codes.ERR_INVALID_ARG_VALUE,\n ERR_INVALID_RETURN_VALUE = _require$codes.ERR_INVALID_RETURN_VALUE,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS;\n\nvar AssertionError = require('./internal/assert/assertion_error');\n\nvar _require2 = require('util/'),\n inspect = _require2.inspect;\n\nvar _require$types = require('util/').types,\n isPromise = _require$types.isPromise,\n isRegExp = _require$types.isRegExp;\n\nvar objectAssign = Object.assign ? Object.assign : require('es6-object-assign').assign;\nvar objectIs = Object.is ? Object.is : require('object-is');\nvar errorCache = new Map();\nvar isDeepEqual;\nvar isDeepStrictEqual;\nvar parseExpressionAt;\nvar findNodeAround;\nvar decoder;\n\nfunction lazyLoadComparison() {\n var comparison = require('./internal/util/comparisons');\n\n isDeepEqual = comparison.isDeepEqual;\n isDeepStrictEqual = comparison.isDeepStrictEqual;\n} // Escape control characters but not \\n and \\t to keep the line breaks and\n// indentation intact.\n// eslint-disable-next-line no-control-regex\n\n\nvar escapeSequencesRegExp = /[\\x00-\\x08\\x0b\\x0c\\x0e-\\x1f]/g;\nvar meta = [\"\\\\u0000\", \"\\\\u0001\", \"\\\\u0002\", \"\\\\u0003\", \"\\\\u0004\", \"\\\\u0005\", \"\\\\u0006\", \"\\\\u0007\", '\\\\b', '', '', \"\\\\u000b\", '\\\\f', '', \"\\\\u000e\", \"\\\\u000f\", \"\\\\u0010\", \"\\\\u0011\", \"\\\\u0012\", \"\\\\u0013\", \"\\\\u0014\", \"\\\\u0015\", \"\\\\u0016\", \"\\\\u0017\", \"\\\\u0018\", \"\\\\u0019\", \"\\\\u001a\", \"\\\\u001b\", \"\\\\u001c\", \"\\\\u001d\", \"\\\\u001e\", \"\\\\u001f\"];\n\nvar escapeFn = function escapeFn(str) {\n return meta[str.charCodeAt(0)];\n};\n\nvar warned = false; // The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\nvar NO_EXCEPTION_SENTINEL = {}; // All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided. All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction innerFail(obj) {\n if (obj.message instanceof Error) throw obj.message;\n throw new AssertionError(obj);\n}\n\nfunction fail(actual, expected, message, operator, stackStartFn) {\n var argsLen = arguments.length;\n var internalMessage;\n\n if (argsLen === 0) {\n internalMessage = 'Failed';\n } else if (argsLen === 1) {\n message = actual;\n actual = undefined;\n } else {\n if (warned === false) {\n warned = true;\n var warn = process.emitWarning ? process.emitWarning : console.warn.bind(console);\n warn('assert.fail() with more than one argument is deprecated. ' + 'Please use assert.strictEqual() instead or only pass a message.', 'DeprecationWarning', 'DEP0094');\n }\n\n if (argsLen === 2) operator = '!=';\n }\n\n if (message instanceof Error) throw message;\n var errArgs = {\n actual: actual,\n expected: expected,\n operator: operator === undefined ? 'fail' : operator,\n stackStartFn: stackStartFn || fail\n };\n\n if (message !== undefined) {\n errArgs.message = message;\n }\n\n var err = new AssertionError(errArgs);\n\n if (internalMessage) {\n err.message = internalMessage;\n err.generatedMessage = true;\n }\n\n throw err;\n}\n\nassert.fail = fail; // The AssertionError is defined in internal/error.\n\nassert.AssertionError = AssertionError;\n\nfunction innerOk(fn, argLen, value, message) {\n if (!value) {\n var generatedMessage = false;\n\n if (argLen === 0) {\n generatedMessage = true;\n message = 'No value argument passed to `assert.ok()`';\n } else if (message instanceof Error) {\n throw message;\n }\n\n var err = new AssertionError({\n actual: value,\n expected: true,\n message: message,\n operator: '==',\n stackStartFn: fn\n });\n err.generatedMessage = generatedMessage;\n throw err;\n }\n} // Pure assertion tests whether a value is truthy, as determined\n// by !!value.\n\n\nfunction ok() {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n innerOk.apply(void 0, [ok, args.length].concat(args));\n}\n\nassert.ok = ok; // The equality assertion tests shallow, coercive equality with ==.\n\n/* eslint-disable no-restricted-properties */\n\nassert.equal = function equal(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n } // eslint-disable-next-line eqeqeq\n\n\n if (actual != expected) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: '==',\n stackStartFn: equal\n });\n }\n}; // The non-equality assertion tests for whether two objects are not\n// equal with !=.\n\n\nassert.notEqual = function notEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n } // eslint-disable-next-line eqeqeq\n\n\n if (actual == expected) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: '!=',\n stackStartFn: notEqual\n });\n }\n}; // The equivalence assertion tests a deep equality relation.\n\n\nassert.deepEqual = function deepEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (!isDeepEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'deepEqual',\n stackStartFn: deepEqual\n });\n }\n}; // The non-equivalence assertion tests for any deep inequality.\n\n\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (isDeepEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notDeepEqual',\n stackStartFn: notDeepEqual\n });\n }\n};\n/* eslint-enable */\n\n\nassert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (!isDeepStrictEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'deepStrictEqual',\n stackStartFn: deepStrictEqual\n });\n }\n};\n\nassert.notDeepStrictEqual = notDeepStrictEqual;\n\nfunction notDeepStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (isDeepStrictEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notDeepStrictEqual',\n stackStartFn: notDeepStrictEqual\n });\n }\n}\n\nassert.strictEqual = function strictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (!objectIs(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'strictEqual',\n stackStartFn: strictEqual\n });\n }\n};\n\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (objectIs(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notStrictEqual',\n stackStartFn: notStrictEqual\n });\n }\n};\n\nvar Comparison = function Comparison(obj, keys, actual) {\n var _this = this;\n\n _classCallCheck(this, Comparison);\n\n keys.forEach(function (key) {\n if (key in obj) {\n if (actual !== undefined && typeof actual[key] === 'string' && isRegExp(obj[key]) && obj[key].test(actual[key])) {\n _this[key] = actual[key];\n } else {\n _this[key] = obj[key];\n }\n }\n });\n};\n\nfunction compareExceptionKey(actual, expected, key, message, keys, fn) {\n if (!(key in actual) || !isDeepStrictEqual(actual[key], expected[key])) {\n if (!message) {\n // Create placeholder objects to create a nice output.\n var a = new Comparison(actual, keys);\n var b = new Comparison(expected, keys, actual);\n var err = new AssertionError({\n actual: a,\n expected: b,\n operator: 'deepStrictEqual',\n stackStartFn: fn\n });\n err.actual = actual;\n err.expected = expected;\n err.operator = fn.name;\n throw err;\n }\n\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: fn.name,\n stackStartFn: fn\n });\n }\n}\n\nfunction expectedException(actual, expected, msg, fn) {\n if (typeof expected !== 'function') {\n if (isRegExp(expected)) return expected.test(actual); // assert.doesNotThrow does not accept objects.\n\n if (arguments.length === 2) {\n throw new ERR_INVALID_ARG_TYPE('expected', ['Function', 'RegExp'], expected);\n } // Handle primitives properly.\n\n\n if (_typeof(actual) !== 'object' || actual === null) {\n var err = new AssertionError({\n actual: actual,\n expected: expected,\n message: msg,\n operator: 'deepStrictEqual',\n stackStartFn: fn\n });\n err.operator = fn.name;\n throw err;\n }\n\n var keys = Object.keys(expected); // Special handle errors to make sure the name and the message are compared\n // as well.\n\n if (expected instanceof Error) {\n keys.push('name', 'message');\n } else if (keys.length === 0) {\n throw new ERR_INVALID_ARG_VALUE('error', expected, 'may not be an empty object');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n keys.forEach(function (key) {\n if (typeof actual[key] === 'string' && isRegExp(expected[key]) && expected[key].test(actual[key])) {\n return;\n }\n\n compareExceptionKey(actual, expected, key, msg, keys, fn);\n });\n return true;\n } // Guard instanceof against arrow functions as they don't have a prototype.\n\n\n if (expected.prototype !== undefined && actual instanceof expected) {\n return true;\n }\n\n if (Error.isPrototypeOf(expected)) {\n return false;\n }\n\n return expected.call({}, actual) === true;\n}\n\nfunction getActual(fn) {\n if (typeof fn !== 'function') {\n throw new ERR_INVALID_ARG_TYPE('fn', 'Function', fn);\n }\n\n try {\n fn();\n } catch (e) {\n return e;\n }\n\n return NO_EXCEPTION_SENTINEL;\n}\n\nfunction checkIsPromise(obj) {\n // Accept native ES6 promises and promises that are implemented in a similar\n // way. Do not accept thenables that use a function as `obj` and that have no\n // `catch` handler.\n // TODO: thenables are checked up until they have the correct methods,\n // but according to documentation, the `then` method should receive\n // the `fulfill` and `reject` arguments as well or it may be never resolved.\n return isPromise(obj) || obj !== null && _typeof(obj) === 'object' && typeof obj.then === 'function' && typeof obj.catch === 'function';\n}\n\nfunction waitForActual(promiseFn) {\n return Promise.resolve().then(function () {\n var resultPromise;\n\n if (typeof promiseFn === 'function') {\n // Return a rejected promise if `promiseFn` throws synchronously.\n resultPromise = promiseFn(); // Fail in case no promise is returned.\n\n if (!checkIsPromise(resultPromise)) {\n throw new ERR_INVALID_RETURN_VALUE('instance of Promise', 'promiseFn', resultPromise);\n }\n } else if (checkIsPromise(promiseFn)) {\n resultPromise = promiseFn;\n } else {\n throw new ERR_INVALID_ARG_TYPE('promiseFn', ['Function', 'Promise'], promiseFn);\n }\n\n return Promise.resolve().then(function () {\n return resultPromise;\n }).then(function () {\n return NO_EXCEPTION_SENTINEL;\n }).catch(function (e) {\n return e;\n });\n });\n}\n\nfunction expectsError(stackStartFn, actual, error, message) {\n if (typeof error === 'string') {\n if (arguments.length === 4) {\n throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n }\n\n if (_typeof(actual) === 'object' && actual !== null) {\n if (actual.message === error) {\n throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error message \\\"\".concat(actual.message, \"\\\" is identical to the message.\"));\n }\n } else if (actual === error) {\n throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error \\\"\".concat(actual, \"\\\" is identical to the message.\"));\n }\n\n message = error;\n error = undefined;\n } else if (error != null && _typeof(error) !== 'object' && typeof error !== 'function') {\n throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n }\n\n if (actual === NO_EXCEPTION_SENTINEL) {\n var details = '';\n\n if (error && error.name) {\n details += \" (\".concat(error.name, \")\");\n }\n\n details += message ? \": \".concat(message) : '.';\n var fnType = stackStartFn.name === 'rejects' ? 'rejection' : 'exception';\n innerFail({\n actual: undefined,\n expected: error,\n operator: stackStartFn.name,\n message: \"Missing expected \".concat(fnType).concat(details),\n stackStartFn: stackStartFn\n });\n }\n\n if (error && !expectedException(actual, error, message, stackStartFn)) {\n throw actual;\n }\n}\n\nfunction expectsNoError(stackStartFn, actual, error, message) {\n if (actual === NO_EXCEPTION_SENTINEL) return;\n\n if (typeof error === 'string') {\n message = error;\n error = undefined;\n }\n\n if (!error || expectedException(actual, error)) {\n var details = message ? \": \".concat(message) : '.';\n var fnType = stackStartFn.name === 'doesNotReject' ? 'rejection' : 'exception';\n innerFail({\n actual: actual,\n expected: error,\n operator: stackStartFn.name,\n message: \"Got unwanted \".concat(fnType).concat(details, \"\\n\") + \"Actual message: \\\"\".concat(actual && actual.message, \"\\\"\"),\n stackStartFn: stackStartFn\n });\n }\n\n throw actual;\n}\n\nassert.throws = function throws(promiseFn) {\n for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n args[_key2 - 1] = arguments[_key2];\n }\n\n expectsError.apply(void 0, [throws, getActual(promiseFn)].concat(args));\n};\n\nassert.rejects = function rejects(promiseFn) {\n for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {\n args[_key3 - 1] = arguments[_key3];\n }\n\n return waitForActual(promiseFn).then(function (result) {\n return expectsError.apply(void 0, [rejects, result].concat(args));\n });\n};\n\nassert.doesNotThrow = function doesNotThrow(fn) {\n for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {\n args[_key4 - 1] = arguments[_key4];\n }\n\n expectsNoError.apply(void 0, [doesNotThrow, getActual(fn)].concat(args));\n};\n\nassert.doesNotReject = function doesNotReject(fn) {\n for (var _len5 = arguments.length, args = new Array(_len5 > 1 ? _len5 - 1 : 0), _key5 = 1; _key5 < _len5; _key5++) {\n args[_key5 - 1] = arguments[_key5];\n }\n\n return waitForActual(fn).then(function (result) {\n return expectsNoError.apply(void 0, [doesNotReject, result].concat(args));\n });\n};\n\nassert.ifError = function ifError(err) {\n if (err !== null && err !== undefined) {\n var message = 'ifError got unwanted exception: ';\n\n if (_typeof(err) === 'object' && typeof err.message === 'string') {\n if (err.message.length === 0 && err.constructor) {\n message += err.constructor.name;\n } else {\n message += err.message;\n }\n } else {\n message += inspect(err);\n }\n\n var newErr = new AssertionError({\n actual: err,\n expected: null,\n operator: 'ifError',\n message: message,\n stackStartFn: ifError\n }); // Make sure we actually have a stack trace!\n\n var origStack = err.stack;\n\n if (typeof origStack === 'string') {\n // This will remove any duplicated frames from the error frames taken\n // from within `ifError` and add the original error frames to the newly\n // created ones.\n var tmp2 = origStack.split('\\n');\n tmp2.shift(); // Filter all frames existing in err.stack.\n\n var tmp1 = newErr.stack.split('\\n');\n\n for (var i = 0; i < tmp2.length; i++) {\n // Find the first occurrence of the frame.\n var pos = tmp1.indexOf(tmp2[i]);\n\n if (pos !== -1) {\n // Only keep new frames.\n tmp1 = tmp1.slice(0, pos);\n break;\n }\n }\n\n newErr.stack = \"\".concat(tmp1.join('\\n'), \"\\n\").concat(tmp2.join('\\n'));\n }\n\n throw newErr;\n }\n}; // Expose a strict only variant of assert\n\n\nfunction strict() {\n for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {\n args[_key6] = arguments[_key6];\n }\n\n innerOk.apply(void 0, [strict, args.length].concat(args));\n}\n\nassert.strict = objectAssign(strict, assert, {\n equal: assert.strictEqual,\n deepEqual: assert.deepStrictEqual,\n notEqual: assert.notStrictEqual,\n notDeepEqual: assert.notDeepStrictEqual\n});\nassert.strict.strict = assert.strict;","// Currently in sync with Node.js lib/internal/assert/assertion_error.js\n// https://github.com/nodejs/node/commit/0817840f775032169ddd70c85ac059f18ffcc81c\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\n\nfunction isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nfunction _construct(Parent, args, Class) { if (isNativeReflectConstruct()) { _construct = Reflect.construct; } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\n\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar _require = require('util/'),\n inspect = _require.inspect;\n\nvar _require2 = require('../errors'),\n ERR_INVALID_ARG_TYPE = _require2.codes.ERR_INVALID_ARG_TYPE; // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat\n\n\nfunction repeat(str, count) {\n count = Math.floor(count);\n if (str.length == 0 || count == 0) return '';\n var maxCount = str.length * count;\n count = Math.floor(Math.log(count) / Math.log(2));\n\n while (count) {\n str += str;\n count--;\n }\n\n str += str.substring(0, maxCount - str.length);\n return str;\n}\n\nvar blue = '';\nvar green = '';\nvar red = '';\nvar white = '';\nvar kReadableOperator = {\n deepStrictEqual: 'Expected values to be strictly deep-equal:',\n strictEqual: 'Expected values to be strictly equal:',\n strictEqualObject: 'Expected \"actual\" to be reference-equal to \"expected\":',\n deepEqual: 'Expected values to be loosely deep-equal:',\n equal: 'Expected values to be loosely equal:',\n notDeepStrictEqual: 'Expected \"actual\" not to be strictly deep-equal to:',\n notStrictEqual: 'Expected \"actual\" to be strictly unequal to:',\n notStrictEqualObject: 'Expected \"actual\" not to be reference-equal to \"expected\":',\n notDeepEqual: 'Expected \"actual\" not to be loosely deep-equal to:',\n notEqual: 'Expected \"actual\" to be loosely unequal to:',\n notIdentical: 'Values identical but not reference-equal:'\n}; // Comparing short primitives should just show === / !== instead of using the\n// diff.\n\nvar kMaxShortLength = 10;\n\nfunction copyError(source) {\n var keys = Object.keys(source);\n var target = Object.create(Object.getPrototypeOf(source));\n keys.forEach(function (key) {\n target[key] = source[key];\n });\n Object.defineProperty(target, 'message', {\n value: source.message\n });\n return target;\n}\n\nfunction inspectValue(val) {\n // The util.inspect default values could be changed. This makes sure the\n // error messages contain the necessary information nevertheless.\n return inspect(val, {\n compact: false,\n customInspect: false,\n depth: 1000,\n maxArrayLength: Infinity,\n // Assert compares only enumerable properties (with a few exceptions).\n showHidden: false,\n // Having a long line as error is better than wrapping the line for\n // comparison for now.\n // TODO(BridgeAR): `breakLength` should be limited as soon as soon as we\n // have meta information about the inspected properties (i.e., know where\n // in what line the property starts and ends).\n breakLength: Infinity,\n // Assert does not detect proxies currently.\n showProxy: false,\n sorted: true,\n // Inspect getters as we also check them when comparing entries.\n getters: true\n });\n}\n\nfunction createErrDiff(actual, expected, operator) {\n var other = '';\n var res = '';\n var lastPos = 0;\n var end = '';\n var skipped = false;\n var actualInspected = inspectValue(actual);\n var actualLines = actualInspected.split('\\n');\n var expectedLines = inspectValue(expected).split('\\n');\n var i = 0;\n var indicator = ''; // In case both values are objects explicitly mark them as not reference equal\n // for the `strictEqual` operator.\n\n if (operator === 'strictEqual' && _typeof(actual) === 'object' && _typeof(expected) === 'object' && actual !== null && expected !== null) {\n operator = 'strictEqualObject';\n } // If \"actual\" and \"expected\" fit on a single line and they are not strictly\n // equal, check further special handling.\n\n\n if (actualLines.length === 1 && expectedLines.length === 1 && actualLines[0] !== expectedLines[0]) {\n var inputLength = actualLines[0].length + expectedLines[0].length; // If the character length of \"actual\" and \"expected\" together is less than\n // kMaxShortLength and if neither is an object and at least one of them is\n // not `zero`, use the strict equal comparison to visualize the output.\n\n if (inputLength <= kMaxShortLength) {\n if ((_typeof(actual) !== 'object' || actual === null) && (_typeof(expected) !== 'object' || expected === null) && (actual !== 0 || expected !== 0)) {\n // -0 === +0\n return \"\".concat(kReadableOperator[operator], \"\\n\\n\") + \"\".concat(actualLines[0], \" !== \").concat(expectedLines[0], \"\\n\");\n }\n } else if (operator !== 'strictEqualObject') {\n // If the stderr is a tty and the input length is lower than the current\n // columns per line, add a mismatch indicator below the output. If it is\n // not a tty, use a default value of 80 characters.\n var maxLength = process.stderr && process.stderr.isTTY ? process.stderr.columns : 80;\n\n if (inputLength < maxLength) {\n while (actualLines[0][i] === expectedLines[0][i]) {\n i++;\n } // Ignore the first characters.\n\n\n if (i > 2) {\n // Add position indicator for the first mismatch in case it is a\n // single line and the input length is less than the column length.\n indicator = \"\\n \".concat(repeat(' ', i), \"^\");\n i = 0;\n }\n }\n }\n } // Remove all ending lines that match (this optimizes the output for\n // readability by reducing the number of total changed lines).\n\n\n var a = actualLines[actualLines.length - 1];\n var b = expectedLines[expectedLines.length - 1];\n\n while (a === b) {\n if (i++ < 2) {\n end = \"\\n \".concat(a).concat(end);\n } else {\n other = a;\n }\n\n actualLines.pop();\n expectedLines.pop();\n if (actualLines.length === 0 || expectedLines.length === 0) break;\n a = actualLines[actualLines.length - 1];\n b = expectedLines[expectedLines.length - 1];\n }\n\n var maxLines = Math.max(actualLines.length, expectedLines.length); // Strict equal with identical objects that are not identical by reference.\n // E.g., assert.deepStrictEqual({ a: Symbol() }, { a: Symbol() })\n\n if (maxLines === 0) {\n // We have to get the result again. The lines were all removed before.\n var _actualLines = actualInspected.split('\\n'); // Only remove lines in case it makes sense to collapse those.\n // TODO: Accept env to always show the full error.\n\n\n if (_actualLines.length > 30) {\n _actualLines[26] = \"\".concat(blue, \"...\").concat(white);\n\n while (_actualLines.length > 27) {\n _actualLines.pop();\n }\n }\n\n return \"\".concat(kReadableOperator.notIdentical, \"\\n\\n\").concat(_actualLines.join('\\n'), \"\\n\");\n }\n\n if (i > 3) {\n end = \"\\n\".concat(blue, \"...\").concat(white).concat(end);\n skipped = true;\n }\n\n if (other !== '') {\n end = \"\\n \".concat(other).concat(end);\n other = '';\n }\n\n var printedLines = 0;\n var msg = kReadableOperator[operator] + \"\\n\".concat(green, \"+ actual\").concat(white, \" \").concat(red, \"- expected\").concat(white);\n var skippedMsg = \" \".concat(blue, \"...\").concat(white, \" Lines skipped\");\n\n for (i = 0; i < maxLines; i++) {\n // Only extra expected lines exist\n var cur = i - lastPos;\n\n if (actualLines.length < i + 1) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(expectedLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(expectedLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the expected line to the cache.\n\n other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLines[i]);\n printedLines++; // Only extra actual lines exist\n } else if (expectedLines.length < i + 1) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(actualLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(actualLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the actual line to the result.\n\n res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLines[i]);\n printedLines++; // Lines diverge\n } else {\n var expectedLine = expectedLines[i];\n var actualLine = actualLines[i]; // If the lines diverge, specifically check for lines that only diverge by\n // a trailing comma. In that case it is actually identical and we should\n // mark it as such.\n\n var divergingLines = actualLine !== expectedLine && (!endsWith(actualLine, ',') || actualLine.slice(0, -1) !== expectedLine); // If the expected line has a trailing comma but is otherwise identical,\n // add a comma at the end of the actual line. Otherwise the output could\n // look weird as in:\n //\n // [\n // 1 // No comma at the end!\n // + 2\n // ]\n //\n\n if (divergingLines && endsWith(expectedLine, ',') && expectedLine.slice(0, -1) === actualLine) {\n divergingLines = false;\n actualLine += ',';\n }\n\n if (divergingLines) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(actualLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(actualLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the actual line to the result and cache the expected diverging\n // line so consecutive diverging lines show up as +++--- and not +-+-+-.\n\n res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLine);\n other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLine);\n printedLines += 2; // Lines are identical\n } else {\n // Add all cached information to the result before adding other things\n // and reset the cache.\n res += other;\n other = ''; // If the last diverging line is exactly one line above or if it is the\n // very first line, add the line to the result.\n\n if (cur === 1 || i === 0) {\n res += \"\\n \".concat(actualLine);\n printedLines++;\n }\n }\n } // Inspected object to big (Show ~20 rows max)\n\n\n if (printedLines > 20 && i < maxLines - 2) {\n return \"\".concat(msg).concat(skippedMsg, \"\\n\").concat(res, \"\\n\").concat(blue, \"...\").concat(white).concat(other, \"\\n\") + \"\".concat(blue, \"...\").concat(white);\n }\n }\n\n return \"\".concat(msg).concat(skipped ? skippedMsg : '', \"\\n\").concat(res).concat(other).concat(end).concat(indicator);\n}\n\nvar AssertionError =\n/*#__PURE__*/\nfunction (_Error) {\n _inherits(AssertionError, _Error);\n\n function AssertionError(options) {\n var _this;\n\n _classCallCheck(this, AssertionError);\n\n if (_typeof(options) !== 'object' || options === null) {\n throw new ERR_INVALID_ARG_TYPE('options', 'Object', options);\n }\n\n var message = options.message,\n operator = options.operator,\n stackStartFn = options.stackStartFn;\n var actual = options.actual,\n expected = options.expected;\n var limit = Error.stackTraceLimit;\n Error.stackTraceLimit = 0;\n\n if (message != null) {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, String(message)));\n } else {\n if (process.stderr && process.stderr.isTTY) {\n // Reset on each call to make sure we handle dynamically set environment\n // variables correct.\n if (process.stderr && process.stderr.getColorDepth && process.stderr.getColorDepth() !== 1) {\n blue = \"\\x1B[34m\";\n green = \"\\x1B[32m\";\n white = \"\\x1B[39m\";\n red = \"\\x1B[31m\";\n } else {\n blue = '';\n green = '';\n white = '';\n red = '';\n }\n } // Prevent the error stack from being visible by duplicating the error\n // in a very close way to the original in case both sides are actually\n // instances of Error.\n\n\n if (_typeof(actual) === 'object' && actual !== null && _typeof(expected) === 'object' && expected !== null && 'stack' in actual && actual instanceof Error && 'stack' in expected && expected instanceof Error) {\n actual = copyError(actual);\n expected = copyError(expected);\n }\n\n if (operator === 'deepStrictEqual' || operator === 'strictEqual') {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, createErrDiff(actual, expected, operator)));\n } else if (operator === 'notDeepStrictEqual' || operator === 'notStrictEqual') {\n // In case the objects are equal but the operator requires unequal, show\n // the first object and say A equals B\n var base = kReadableOperator[operator];\n var res = inspectValue(actual).split('\\n'); // In case \"actual\" is an object, it should not be reference equal.\n\n if (operator === 'notStrictEqual' && _typeof(actual) === 'object' && actual !== null) {\n base = kReadableOperator.notStrictEqualObject;\n } // Only remove lines in case it makes sense to collapse those.\n // TODO: Accept env to always show the full error.\n\n\n if (res.length > 30) {\n res[26] = \"\".concat(blue, \"...\").concat(white);\n\n while (res.length > 27) {\n res.pop();\n }\n } // Only print a single input.\n\n\n if (res.length === 1) {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(base, \" \").concat(res[0])));\n } else {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(base, \"\\n\\n\").concat(res.join('\\n'), \"\\n\")));\n }\n } else {\n var _res = inspectValue(actual);\n\n var other = '';\n var knownOperators = kReadableOperator[operator];\n\n if (operator === 'notDeepEqual' || operator === 'notEqual') {\n _res = \"\".concat(kReadableOperator[operator], \"\\n\\n\").concat(_res);\n\n if (_res.length > 1024) {\n _res = \"\".concat(_res.slice(0, 1021), \"...\");\n }\n } else {\n other = \"\".concat(inspectValue(expected));\n\n if (_res.length > 512) {\n _res = \"\".concat(_res.slice(0, 509), \"...\");\n }\n\n if (other.length > 512) {\n other = \"\".concat(other.slice(0, 509), \"...\");\n }\n\n if (operator === 'deepEqual' || operator === 'equal') {\n _res = \"\".concat(knownOperators, \"\\n\\n\").concat(_res, \"\\n\\nshould equal\\n\\n\");\n } else {\n other = \" \".concat(operator, \" \").concat(other);\n }\n }\n\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(_res).concat(other)));\n }\n }\n\n Error.stackTraceLimit = limit;\n _this.generatedMessage = !message;\n Object.defineProperty(_assertThisInitialized(_this), 'name', {\n value: 'AssertionError [ERR_ASSERTION]',\n enumerable: false,\n writable: true,\n configurable: true\n });\n _this.code = 'ERR_ASSERTION';\n _this.actual = actual;\n _this.expected = expected;\n _this.operator = operator;\n\n if (Error.captureStackTrace) {\n // eslint-disable-next-line no-restricted-syntax\n Error.captureStackTrace(_assertThisInitialized(_this), stackStartFn);\n } // Create error message including the error code in the name.\n\n\n _this.stack; // Reset the name.\n\n _this.name = 'AssertionError';\n return _possibleConstructorReturn(_this);\n }\n\n _createClass(AssertionError, [{\n key: \"toString\",\n value: function toString() {\n return \"\".concat(this.name, \" [\").concat(this.code, \"]: \").concat(this.message);\n }\n }, {\n key: inspect.custom,\n value: function value(recurseTimes, ctx) {\n // This limits the `actual` and `expected` property default inspection to\n // the minimum depth. Otherwise those values would be too verbose compared\n // to the actual error message which contains a combined view of these two\n // input values.\n return inspect(this, _objectSpread({}, ctx, {\n customInspect: false,\n depth: 0\n }));\n }\n }]);\n\n return AssertionError;\n}(_wrapNativeSuper(Error));\n\nmodule.exports = AssertionError;","// Currently in sync with Node.js lib/internal/errors.js\n// https://github.com/nodejs/node/commit/3b044962c48fe313905877a96b5d0894a5404f6f\n\n/* eslint node-core/documented-errors: \"error\" */\n\n/* eslint node-core/alphabetize-errors: \"error\" */\n\n/* eslint node-core/prefer-util-format-errors: \"error\" */\n'use strict'; // The whole point behind this internal module is to allow Node.js to no\n// longer be forced to treat every error message change as a semver-major\n// change. The NodeError classes here all expose a `code` property whose\n// value statically and permanently identifies the error. While the error\n// message may change, the code should not.\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nvar codes = {}; // Lazy loaded\n\nvar assert;\nvar util;\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inherits(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n var _this;\n\n _classCallCheck(this, NodeError);\n\n _this = _possibleConstructorReturn(this, _getPrototypeOf(NodeError).call(this, getMessage(arg1, arg2, arg3)));\n _this.code = code;\n return _this;\n }\n\n return NodeError;\n }(Base);\n\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_AMBIGUOUS_ARGUMENT', 'The \"%s\" argument is ambiguous. %s', TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n if (assert === undefined) assert = require('../assert');\n assert(typeof name === 'string', \"'name' must be a string\"); // determiner: 'must be' or 'must not be'\n\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } // TODO(BridgeAR): Improve the output by showing `null` and similar.\n\n\n msg += \". Received type \".concat(_typeof(actual));\n return msg;\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_VALUE', function (name, value) {\n var reason = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'is invalid';\n if (util === undefined) util = require('util/');\n var inspected = util.inspect(value);\n\n if (inspected.length > 128) {\n inspected = \"\".concat(inspected.slice(0, 128), \"...\");\n }\n\n return \"The argument '\".concat(name, \"' \").concat(reason, \". Received \").concat(inspected);\n}, TypeError, RangeError);\ncreateErrorType('ERR_INVALID_RETURN_VALUE', function (input, name, value) {\n var type;\n\n if (value && value.constructor && value.constructor.name) {\n type = \"instance of \".concat(value.constructor.name);\n } else {\n type = \"type \".concat(_typeof(value));\n }\n\n return \"Expected \".concat(input, \" to be returned from the \\\"\").concat(name, \"\\\"\") + \" function but got \".concat(type, \".\");\n}, TypeError);\ncreateErrorType('ERR_MISSING_ARGS', function () {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n if (assert === undefined) assert = require('../assert');\n assert(args.length > 0, 'At least one arg needs to be specified');\n var msg = 'The ';\n var len = args.length;\n args = args.map(function (a) {\n return \"\\\"\".concat(a, \"\\\"\");\n });\n\n switch (len) {\n case 1:\n msg += \"\".concat(args[0], \" argument\");\n break;\n\n case 2:\n msg += \"\".concat(args[0], \" and \").concat(args[1], \" arguments\");\n break;\n\n default:\n msg += args.slice(0, len - 1).join(', ');\n msg += \", and \".concat(args[len - 1], \" arguments\");\n break;\n }\n\n return \"\".concat(msg, \" must be specified\");\n}, TypeError);\nmodule.exports.codes = codes;","// Currently in sync with Node.js lib/internal/util/comparisons.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n'use strict';\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar regexFlagsSupported = /a/g.flags !== undefined;\n\nvar arrayFromSet = function arrayFromSet(set) {\n var array = [];\n set.forEach(function (value) {\n return array.push(value);\n });\n return array;\n};\n\nvar arrayFromMap = function arrayFromMap(map) {\n var array = [];\n map.forEach(function (value, key) {\n return array.push([key, value]);\n });\n return array;\n};\n\nvar objectIs = Object.is ? Object.is : require('object-is');\nvar objectGetOwnPropertySymbols = Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols : function () {\n return [];\n};\nvar numberIsNaN = Number.isNaN ? Number.isNaN : require('is-nan');\n\nfunction uncurryThis(f) {\n return f.call.bind(f);\n}\n\nvar hasOwnProperty = uncurryThis(Object.prototype.hasOwnProperty);\nvar propertyIsEnumerable = uncurryThis(Object.prototype.propertyIsEnumerable);\nvar objectToString = uncurryThis(Object.prototype.toString);\n\nvar _require$types = require('util/').types,\n isAnyArrayBuffer = _require$types.isAnyArrayBuffer,\n isArrayBufferView = _require$types.isArrayBufferView,\n isDate = _require$types.isDate,\n isMap = _require$types.isMap,\n isRegExp = _require$types.isRegExp,\n isSet = _require$types.isSet,\n isNativeError = _require$types.isNativeError,\n isBoxedPrimitive = _require$types.isBoxedPrimitive,\n isNumberObject = _require$types.isNumberObject,\n isStringObject = _require$types.isStringObject,\n isBooleanObject = _require$types.isBooleanObject,\n isBigIntObject = _require$types.isBigIntObject,\n isSymbolObject = _require$types.isSymbolObject,\n isFloat32Array = _require$types.isFloat32Array,\n isFloat64Array = _require$types.isFloat64Array;\n\nfunction isNonIndex(key) {\n if (key.length === 0 || key.length > 10) return true;\n\n for (var i = 0; i < key.length; i++) {\n var code = key.charCodeAt(i);\n if (code < 48 || code > 57) return true;\n } // The maximum size for an array is 2 ** 32 -1.\n\n\n return key.length === 10 && key >= Math.pow(2, 32);\n}\n\nfunction getOwnNonIndexProperties(value) {\n return Object.keys(value).filter(isNonIndex).concat(objectGetOwnPropertySymbols(value).filter(Object.prototype.propertyIsEnumerable.bind(value)));\n} // Taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js\n// original notice:\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh \n * @license MIT\n */\n\n\nfunction compare(a, b) {\n if (a === b) {\n return 0;\n }\n\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) {\n return -1;\n }\n\n if (y < x) {\n return 1;\n }\n\n return 0;\n}\n\nvar ONLY_ENUMERABLE = undefined;\nvar kStrict = true;\nvar kLoose = false;\nvar kNoIterator = 0;\nvar kIsArray = 1;\nvar kIsSet = 2;\nvar kIsMap = 3; // Check if they have the same source and flags\n\nfunction areSimilarRegExps(a, b) {\n return regexFlagsSupported ? a.source === b.source && a.flags === b.flags : RegExp.prototype.toString.call(a) === RegExp.prototype.toString.call(b);\n}\n\nfunction areSimilarFloatArrays(a, b) {\n if (a.byteLength !== b.byteLength) {\n return false;\n }\n\n for (var offset = 0; offset < a.byteLength; offset++) {\n if (a[offset] !== b[offset]) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction areSimilarTypedArrays(a, b) {\n if (a.byteLength !== b.byteLength) {\n return false;\n }\n\n return compare(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)) === 0;\n}\n\nfunction areEqualArrayBuffers(buf1, buf2) {\n return buf1.byteLength === buf2.byteLength && compare(new Uint8Array(buf1), new Uint8Array(buf2)) === 0;\n}\n\nfunction isEqualBoxedPrimitive(val1, val2) {\n if (isNumberObject(val1)) {\n return isNumberObject(val2) && objectIs(Number.prototype.valueOf.call(val1), Number.prototype.valueOf.call(val2));\n }\n\n if (isStringObject(val1)) {\n return isStringObject(val2) && String.prototype.valueOf.call(val1) === String.prototype.valueOf.call(val2);\n }\n\n if (isBooleanObject(val1)) {\n return isBooleanObject(val2) && Boolean.prototype.valueOf.call(val1) === Boolean.prototype.valueOf.call(val2);\n }\n\n if (isBigIntObject(val1)) {\n return isBigIntObject(val2) && BigInt.prototype.valueOf.call(val1) === BigInt.prototype.valueOf.call(val2);\n }\n\n return isSymbolObject(val2) && Symbol.prototype.valueOf.call(val1) === Symbol.prototype.valueOf.call(val2);\n} // Notes: Type tags are historical [[Class]] properties that can be set by\n// FunctionTemplate::SetClassName() in C++ or Symbol.toStringTag in JS\n// and retrieved using Object.prototype.toString.call(obj) in JS\n// See https://tc39.github.io/ecma262/#sec-object.prototype.tostring\n// for a list of tags pre-defined in the spec.\n// There are some unspecified tags in the wild too (e.g. typed array tags).\n// Since tags can be altered, they only serve fast failures\n//\n// Typed arrays and buffers are checked by comparing the content in their\n// underlying ArrayBuffer. This optimization requires that it's\n// reasonable to interpret their underlying memory in the same way,\n// which is checked by comparing their type tags.\n// (e.g. a Uint8Array and a Uint16Array with the same memory content\n// could still be different because they will be interpreted differently).\n//\n// For strict comparison, objects should have\n// a) The same built-in type tags\n// b) The same prototypes.\n\n\nfunction innerDeepEqual(val1, val2, strict, memos) {\n // All identical values are equivalent, as determined by ===.\n if (val1 === val2) {\n if (val1 !== 0) return true;\n return strict ? objectIs(val1, val2) : true;\n } // Check more closely if val1 and val2 are equal.\n\n\n if (strict) {\n if (_typeof(val1) !== 'object') {\n return typeof val1 === 'number' && numberIsNaN(val1) && numberIsNaN(val2);\n }\n\n if (_typeof(val2) !== 'object' || val1 === null || val2 === null) {\n return false;\n }\n\n if (Object.getPrototypeOf(val1) !== Object.getPrototypeOf(val2)) {\n return false;\n }\n } else {\n if (val1 === null || _typeof(val1) !== 'object') {\n if (val2 === null || _typeof(val2) !== 'object') {\n // eslint-disable-next-line eqeqeq\n return val1 == val2;\n }\n\n return false;\n }\n\n if (val2 === null || _typeof(val2) !== 'object') {\n return false;\n }\n }\n\n var val1Tag = objectToString(val1);\n var val2Tag = objectToString(val2);\n\n if (val1Tag !== val2Tag) {\n return false;\n }\n\n if (Array.isArray(val1)) {\n // Check for sparse arrays and general fast path\n if (val1.length !== val2.length) {\n return false;\n }\n\n var keys1 = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n var keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n\n if (keys1.length !== keys2.length) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsArray, keys1);\n } // [browserify] This triggers on certain types in IE (Map/Set) so we don't\n // wan't to early return out of the rest of the checks. However we can check\n // if the second value is one of these values and the first isn't.\n\n\n if (val1Tag === '[object Object]') {\n // return keyCheck(val1, val2, strict, memos, kNoIterator);\n if (!isMap(val1) && isMap(val2) || !isSet(val1) && isSet(val2)) {\n return false;\n }\n }\n\n if (isDate(val1)) {\n if (!isDate(val2) || Date.prototype.getTime.call(val1) !== Date.prototype.getTime.call(val2)) {\n return false;\n }\n } else if (isRegExp(val1)) {\n if (!isRegExp(val2) || !areSimilarRegExps(val1, val2)) {\n return false;\n }\n } else if (isNativeError(val1) || val1 instanceof Error) {\n // Do not compare the stack as it might differ even though the error itself\n // is otherwise identical.\n if (val1.message !== val2.message || val1.name !== val2.name) {\n return false;\n }\n } else if (isArrayBufferView(val1)) {\n if (!strict && (isFloat32Array(val1) || isFloat64Array(val1))) {\n if (!areSimilarFloatArrays(val1, val2)) {\n return false;\n }\n } else if (!areSimilarTypedArrays(val1, val2)) {\n return false;\n } // Buffer.compare returns true, so val1.length === val2.length. If they both\n // only contain numeric keys, we don't need to exam further than checking\n // the symbols.\n\n\n var _keys = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n\n var _keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n\n if (_keys.length !== _keys2.length) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kNoIterator, _keys);\n } else if (isSet(val1)) {\n if (!isSet(val2) || val1.size !== val2.size) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsSet);\n } else if (isMap(val1)) {\n if (!isMap(val2) || val1.size !== val2.size) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsMap);\n } else if (isAnyArrayBuffer(val1)) {\n if (!areEqualArrayBuffers(val1, val2)) {\n return false;\n }\n } else if (isBoxedPrimitive(val1) && !isEqualBoxedPrimitive(val1, val2)) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kNoIterator);\n}\n\nfunction getEnumerables(val, keys) {\n return keys.filter(function (k) {\n return propertyIsEnumerable(val, k);\n });\n}\n\nfunction keyCheck(val1, val2, strict, memos, iterationType, aKeys) {\n // For all remaining Object pairs, including Array, objects and Maps,\n // equivalence is determined by having:\n // a) The same number of owned enumerable properties\n // b) The same set of keys/indexes (although not necessarily the same order)\n // c) Equivalent values for every corresponding key/index\n // d) For Sets and Maps, equal contents\n // Note: this accounts for both named and indexed properties on Arrays.\n if (arguments.length === 5) {\n aKeys = Object.keys(val1);\n var bKeys = Object.keys(val2); // The pair must have the same number of owned properties.\n\n if (aKeys.length !== bKeys.length) {\n return false;\n }\n } // Cheap key test\n\n\n var i = 0;\n\n for (; i < aKeys.length; i++) {\n if (!hasOwnProperty(val2, aKeys[i])) {\n return false;\n }\n }\n\n if (strict && arguments.length === 5) {\n var symbolKeysA = objectGetOwnPropertySymbols(val1);\n\n if (symbolKeysA.length !== 0) {\n var count = 0;\n\n for (i = 0; i < symbolKeysA.length; i++) {\n var key = symbolKeysA[i];\n\n if (propertyIsEnumerable(val1, key)) {\n if (!propertyIsEnumerable(val2, key)) {\n return false;\n }\n\n aKeys.push(key);\n count++;\n } else if (propertyIsEnumerable(val2, key)) {\n return false;\n }\n }\n\n var symbolKeysB = objectGetOwnPropertySymbols(val2);\n\n if (symbolKeysA.length !== symbolKeysB.length && getEnumerables(val2, symbolKeysB).length !== count) {\n return false;\n }\n } else {\n var _symbolKeysB = objectGetOwnPropertySymbols(val2);\n\n if (_symbolKeysB.length !== 0 && getEnumerables(val2, _symbolKeysB).length !== 0) {\n return false;\n }\n }\n }\n\n if (aKeys.length === 0 && (iterationType === kNoIterator || iterationType === kIsArray && val1.length === 0 || val1.size === 0)) {\n return true;\n } // Use memos to handle cycles.\n\n\n if (memos === undefined) {\n memos = {\n val1: new Map(),\n val2: new Map(),\n position: 0\n };\n } else {\n // We prevent up to two map.has(x) calls by directly retrieving the value\n // and checking for undefined. The map can only contain numbers, so it is\n // safe to check for undefined only.\n var val2MemoA = memos.val1.get(val1);\n\n if (val2MemoA !== undefined) {\n var val2MemoB = memos.val2.get(val2);\n\n if (val2MemoB !== undefined) {\n return val2MemoA === val2MemoB;\n }\n }\n\n memos.position++;\n }\n\n memos.val1.set(val1, memos.position);\n memos.val2.set(val2, memos.position);\n var areEq = objEquiv(val1, val2, strict, aKeys, memos, iterationType);\n memos.val1.delete(val1);\n memos.val2.delete(val2);\n return areEq;\n}\n\nfunction setHasEqualElement(set, val1, strict, memo) {\n // Go looking.\n var setValues = arrayFromSet(set);\n\n for (var i = 0; i < setValues.length; i++) {\n var val2 = setValues[i];\n\n if (innerDeepEqual(val1, val2, strict, memo)) {\n // Remove the matching element to make sure we do not check that again.\n set.delete(val2);\n return true;\n }\n }\n\n return false;\n} // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Equality_comparisons_and_sameness#Loose_equality_using\n// Sadly it is not possible to detect corresponding values properly in case the\n// type is a string, number, bigint or boolean. The reason is that those values\n// can match lots of different string values (e.g., 1n == '+00001').\n\n\nfunction findLooseMatchingPrimitives(prim) {\n switch (_typeof(prim)) {\n case 'undefined':\n return null;\n\n case 'object':\n // Only pass in null as object!\n return undefined;\n\n case 'symbol':\n return false;\n\n case 'string':\n prim = +prim;\n // Loose equal entries exist only if the string is possible to convert to\n // a regular number and not NaN.\n // Fall through\n\n case 'number':\n if (numberIsNaN(prim)) {\n return false;\n }\n\n }\n\n return true;\n}\n\nfunction setMightHaveLoosePrim(a, b, prim) {\n var altValue = findLooseMatchingPrimitives(prim);\n if (altValue != null) return altValue;\n return b.has(altValue) && !a.has(altValue);\n}\n\nfunction mapMightHaveLoosePrim(a, b, prim, item, memo) {\n var altValue = findLooseMatchingPrimitives(prim);\n\n if (altValue != null) {\n return altValue;\n }\n\n var curB = b.get(altValue);\n\n if (curB === undefined && !b.has(altValue) || !innerDeepEqual(item, curB, false, memo)) {\n return false;\n }\n\n return !a.has(altValue) && innerDeepEqual(item, curB, false, memo);\n}\n\nfunction setEquiv(a, b, strict, memo) {\n // This is a lazily initiated Set of entries which have to be compared\n // pairwise.\n var set = null;\n var aValues = arrayFromSet(a);\n\n for (var i = 0; i < aValues.length; i++) {\n var val = aValues[i]; // Note: Checking for the objects first improves the performance for object\n // heavy sets but it is a minor slow down for primitives. As they are fast\n // to check this improves the worst case scenario instead.\n\n if (_typeof(val) === 'object' && val !== null) {\n if (set === null) {\n set = new Set();\n } // If the specified value doesn't exist in the second set its an not null\n // object (or non strict only: a not matching primitive) we'll need to go\n // hunting for something thats deep-(strict-)equal to it. To make this\n // O(n log n) complexity we have to copy these values in a new set first.\n\n\n set.add(val);\n } else if (!b.has(val)) {\n if (strict) return false; // Fast path to detect missing string, symbol, undefined and null values.\n\n if (!setMightHaveLoosePrim(a, b, val)) {\n return false;\n }\n\n if (set === null) {\n set = new Set();\n }\n\n set.add(val);\n }\n }\n\n if (set !== null) {\n var bValues = arrayFromSet(b);\n\n for (var _i = 0; _i < bValues.length; _i++) {\n var _val = bValues[_i]; // We have to check if a primitive value is already\n // matching and only if it's not, go hunting for it.\n\n if (_typeof(_val) === 'object' && _val !== null) {\n if (!setHasEqualElement(set, _val, strict, memo)) return false;\n } else if (!strict && !a.has(_val) && !setHasEqualElement(set, _val, strict, memo)) {\n return false;\n }\n }\n\n return set.size === 0;\n }\n\n return true;\n}\n\nfunction mapHasEqualEntry(set, map, key1, item1, strict, memo) {\n // To be able to handle cases like:\n // Map([[{}, 'a'], [{}, 'b']]) vs Map([[{}, 'b'], [{}, 'a']])\n // ... we need to consider *all* matching keys, not just the first we find.\n var setValues = arrayFromSet(set);\n\n for (var i = 0; i < setValues.length; i++) {\n var key2 = setValues[i];\n\n if (innerDeepEqual(key1, key2, strict, memo) && innerDeepEqual(item1, map.get(key2), strict, memo)) {\n set.delete(key2);\n return true;\n }\n }\n\n return false;\n}\n\nfunction mapEquiv(a, b, strict, memo) {\n var set = null;\n var aEntries = arrayFromMap(a);\n\n for (var i = 0; i < aEntries.length; i++) {\n var _aEntries$i = _slicedToArray(aEntries[i], 2),\n key = _aEntries$i[0],\n item1 = _aEntries$i[1];\n\n if (_typeof(key) === 'object' && key !== null) {\n if (set === null) {\n set = new Set();\n }\n\n set.add(key);\n } else {\n // By directly retrieving the value we prevent another b.has(key) check in\n // almost all possible cases.\n var item2 = b.get(key);\n\n if (item2 === undefined && !b.has(key) || !innerDeepEqual(item1, item2, strict, memo)) {\n if (strict) return false; // Fast path to detect missing string, symbol, undefined and null\n // keys.\n\n if (!mapMightHaveLoosePrim(a, b, key, item1, memo)) return false;\n\n if (set === null) {\n set = new Set();\n }\n\n set.add(key);\n }\n }\n }\n\n if (set !== null) {\n var bEntries = arrayFromMap(b);\n\n for (var _i2 = 0; _i2 < bEntries.length; _i2++) {\n var _bEntries$_i = _slicedToArray(bEntries[_i2], 2),\n key = _bEntries$_i[0],\n item = _bEntries$_i[1];\n\n if (_typeof(key) === 'object' && key !== null) {\n if (!mapHasEqualEntry(set, a, key, item, strict, memo)) return false;\n } else if (!strict && (!a.has(key) || !innerDeepEqual(a.get(key), item, false, memo)) && !mapHasEqualEntry(set, a, key, item, false, memo)) {\n return false;\n }\n }\n\n return set.size === 0;\n }\n\n return true;\n}\n\nfunction objEquiv(a, b, strict, keys, memos, iterationType) {\n // Sets and maps don't have their entries accessible via normal object\n // properties.\n var i = 0;\n\n if (iterationType === kIsSet) {\n if (!setEquiv(a, b, strict, memos)) {\n return false;\n }\n } else if (iterationType === kIsMap) {\n if (!mapEquiv(a, b, strict, memos)) {\n return false;\n }\n } else if (iterationType === kIsArray) {\n for (; i < a.length; i++) {\n if (hasOwnProperty(a, i)) {\n if (!hasOwnProperty(b, i) || !innerDeepEqual(a[i], b[i], strict, memos)) {\n return false;\n }\n } else if (hasOwnProperty(b, i)) {\n return false;\n } else {\n // Array is sparse.\n var keysA = Object.keys(a);\n\n for (; i < keysA.length; i++) {\n var key = keysA[i];\n\n if (!hasOwnProperty(b, key) || !innerDeepEqual(a[key], b[key], strict, memos)) {\n return false;\n }\n }\n\n if (keysA.length !== Object.keys(b).length) {\n return false;\n }\n\n return true;\n }\n }\n } // The pair must have equivalent values for every corresponding key.\n // Possibly expensive deep test:\n\n\n for (i = 0; i < keys.length; i++) {\n var _key = keys[i];\n\n if (!innerDeepEqual(a[_key], b[_key], strict, memos)) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction isDeepEqual(val1, val2) {\n return innerDeepEqual(val1, val2, kLoose);\n}\n\nfunction isDeepStrictEqual(val1, val2) {\n return innerDeepEqual(val1, val2, kStrict);\n}\n\nmodule.exports = {\n isDeepEqual: isDeepEqual,\n isDeepStrictEqual: isDeepStrictEqual\n};","'use strict';\n\nvar possibleNames = [\n\t'BigInt64Array',\n\t'BigUint64Array',\n\t'Float32Array',\n\t'Float64Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Int8Array',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray'\n];\n\nmodule.exports = function availableTypedArrays() {\n\tvar out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof global[possibleNames[i]] === 'function') {\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) |\n (revLookup[b64.charCodeAt(i + 1)] << 12) |\n (revLookup[b64.charCodeAt(i + 2)] << 6) |\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) |\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) |\n (revLookup[b64.charCodeAt(i + 1)] << 4) |\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","const INTEGER_START = 0x69 // 'i'\nconst STRING_DELIM = 0x3A // ':'\nconst DICTIONARY_START = 0x64 // 'd'\nconst LIST_START = 0x6C // 'l'\nconst END_OF_TYPE = 0x65 // 'e'\n\n/**\n * replaces parseInt(buffer.toString('ascii', start, end)).\n * For strings with less then ~30 charachters, this is actually a lot faster.\n *\n * @param {Buffer} data\n * @param {Number} start\n * @param {Number} end\n * @return {Number} calculated number\n */\nfunction getIntFromBuffer (buffer, start, end) {\n let sum = 0\n let sign = 1\n\n for (let i = start; i < end; i++) {\n const num = buffer[i]\n\n if (num < 58 && num >= 48) {\n sum = sum * 10 + (num - 48)\n continue\n }\n\n if (i === start && num === 43) { // +\n continue\n }\n\n if (i === start && num === 45) { // -\n sign = -1\n continue\n }\n\n if (num === 46) { // .\n // its a float. break here.\n break\n }\n\n throw new Error('not a number: buffer[' + i + '] = ' + num)\n }\n\n return sum * sign\n}\n\n/**\n * Decodes bencoded data.\n *\n * @param {Buffer} data\n * @param {Number} start (optional)\n * @param {Number} end (optional)\n * @param {String} encoding (optional)\n * @return {Object|Array|Buffer|String|Number}\n */\nfunction decode (data, start, end, encoding) {\n if (data == null || data.length === 0) {\n return null\n }\n\n if (typeof start !== 'number' && encoding == null) {\n encoding = start\n start = undefined\n }\n\n if (typeof end !== 'number' && encoding == null) {\n encoding = end\n end = undefined\n }\n\n decode.position = 0\n decode.encoding = encoding || null\n\n decode.data = !(Buffer.isBuffer(data))\n ? Buffer.from(data)\n : data.slice(start, end)\n\n decode.bytes = decode.data.length\n\n return decode.next()\n}\n\ndecode.bytes = 0\ndecode.position = 0\ndecode.data = null\ndecode.encoding = null\n\ndecode.next = function () {\n switch (decode.data[decode.position]) {\n case DICTIONARY_START:\n return decode.dictionary()\n case LIST_START:\n return decode.list()\n case INTEGER_START:\n return decode.integer()\n default:\n return decode.buffer()\n }\n}\n\ndecode.find = function (chr) {\n let i = decode.position\n const c = decode.data.length\n const d = decode.data\n\n while (i < c) {\n if (d[i] === chr) return i\n i++\n }\n\n throw new Error(\n 'Invalid data: Missing delimiter \"' +\n String.fromCharCode(chr) + '\" [0x' +\n chr.toString(16) + ']'\n )\n}\n\ndecode.dictionary = function () {\n decode.position++\n\n const dict = {}\n\n while (decode.data[decode.position] !== END_OF_TYPE) {\n dict[decode.buffer()] = decode.next()\n }\n\n decode.position++\n\n return dict\n}\n\ndecode.list = function () {\n decode.position++\n\n const lst = []\n\n while (decode.data[decode.position] !== END_OF_TYPE) {\n lst.push(decode.next())\n }\n\n decode.position++\n\n return lst\n}\n\ndecode.integer = function () {\n const end = decode.find(END_OF_TYPE)\n const number = getIntFromBuffer(decode.data, decode.position + 1, end)\n\n decode.position += end + 1 - decode.position\n\n return number\n}\n\ndecode.buffer = function () {\n let sep = decode.find(STRING_DELIM)\n const length = getIntFromBuffer(decode.data, decode.position, sep)\n const end = ++sep + length\n\n decode.position = end\n\n return decode.encoding\n ? decode.data.toString(decode.encoding, sep, end)\n : decode.data.slice(sep, end)\n}\n\nmodule.exports = decode\n","const { getType } = require('./util.js')\n\n/**\n * Encodes data in bencode.\n *\n * @param {Buffer|Array|String|Object|Number|Boolean} data\n * @return {Buffer}\n */\nfunction encode (data, buffer, offset) {\n const buffers = []\n let result = null\n\n encode._encode(buffers, data)\n result = Buffer.concat(buffers)\n encode.bytes = result.length\n\n if (Buffer.isBuffer(buffer)) {\n result.copy(buffer, offset)\n return buffer\n }\n\n return result\n}\n\nencode.bytes = -1\nencode._floatConversionDetected = false\n\nencode._encode = function (buffers, data) {\n if (data == null) { return }\n\n switch (getType(data)) {\n case 'buffer': encode.buffer(buffers, data); break\n case 'object': encode.dict(buffers, data); break\n case 'map': encode.dictMap(buffers, data); break\n case 'array': encode.list(buffers, data); break\n case 'set': encode.listSet(buffers, data); break\n case 'string': encode.string(buffers, data); break\n case 'number': encode.number(buffers, data); break\n case 'boolean': encode.number(buffers, data); break\n case 'arraybufferview': encode.buffer(buffers, Buffer.from(data.buffer, data.byteOffset, data.byteLength)); break\n case 'arraybuffer': encode.buffer(buffers, Buffer.from(data)); break\n }\n}\n\nconst buffE = Buffer.from('e')\nconst buffD = Buffer.from('d')\nconst buffL = Buffer.from('l')\n\nencode.buffer = function (buffers, data) {\n buffers.push(Buffer.from(data.length + ':'), data)\n}\n\nencode.string = function (buffers, data) {\n buffers.push(Buffer.from(Buffer.byteLength(data) + ':' + data))\n}\n\nencode.number = function (buffers, data) {\n const maxLo = 0x80000000\n const hi = (data / maxLo) << 0\n const lo = (data % maxLo) << 0\n const val = hi * maxLo + lo\n\n buffers.push(Buffer.from('i' + val + 'e'))\n\n if (val !== data && !encode._floatConversionDetected) {\n encode._floatConversionDetected = true\n console.warn(\n 'WARNING: Possible data corruption detected with value \"' + data + '\":',\n 'Bencoding only defines support for integers, value was converted to \"' + val + '\"'\n )\n console.trace()\n }\n}\n\nencode.dict = function (buffers, data) {\n buffers.push(buffD)\n\n let j = 0\n let k\n // fix for issue #13 - sorted dicts\n const keys = Object.keys(data).sort()\n const kl = keys.length\n\n for (; j < kl; j++) {\n k = keys[j]\n if (data[k] == null) continue\n encode.string(buffers, k)\n encode._encode(buffers, data[k])\n }\n\n buffers.push(buffE)\n}\n\nencode.dictMap = function (buffers, data) {\n buffers.push(buffD)\n\n const keys = Array.from(data.keys()).sort()\n\n for (const key of keys) {\n if (data.get(key) == null) continue\n Buffer.isBuffer(key)\n ? encode._encode(buffers, key)\n : encode.string(buffers, String(key))\n encode._encode(buffers, data.get(key))\n }\n\n buffers.push(buffE)\n}\n\nencode.list = function (buffers, data) {\n let i = 0\n const c = data.length\n buffers.push(buffL)\n\n for (; i < c; i++) {\n if (data[i] == null) continue\n encode._encode(buffers, data[i])\n }\n\n buffers.push(buffE)\n}\n\nencode.listSet = function (buffers, data) {\n buffers.push(buffL)\n\n for (const item of data) {\n if (item == null) continue\n encode._encode(buffers, item)\n }\n\n buffers.push(buffE)\n}\n\nmodule.exports = encode\n","const { digitCount, getType } = require('./util.js')\n\nfunction listLength (list) {\n let length = 1 + 1 // type marker + end-of-type marker\n\n for (const value of list) {\n length += encodingLength(value)\n }\n\n return length\n}\n\nfunction mapLength (map) {\n let length = 1 + 1 // type marker + end-of-type marker\n\n for (const [key, value] of map) {\n const keyLength = Buffer.byteLength(key)\n length += digitCount(keyLength) + 1 + keyLength\n length += encodingLength(value)\n }\n\n return length\n}\n\nfunction objectLength (value) {\n let length = 1 + 1 // type marker + end-of-type marker\n const keys = Object.keys(value)\n\n for (let i = 0; i < keys.length; i++) {\n const keyLength = Buffer.byteLength(keys[i])\n length += digitCount(keyLength) + 1 + keyLength\n length += encodingLength(value[keys[i]])\n }\n\n return length\n}\n\nfunction stringLength (value) {\n const length = Buffer.byteLength(value)\n return digitCount(length) + 1 + length\n}\n\nfunction arrayBufferLength (value) {\n const length = value.byteLength - value.byteOffset\n return digitCount(length) + 1 + length\n}\n\nfunction encodingLength (value) {\n const length = 0\n\n if (value == null) return length\n\n const type = getType(value)\n\n switch (type) {\n case 'buffer': return digitCount(value.length) + 1 + value.length\n case 'arraybufferview': return arrayBufferLength(value)\n case 'string': return stringLength(value)\n case 'array': case 'set': return listLength(value)\n case 'number': return 1 + digitCount(Math.floor(value)) + 1\n case 'bigint': return 1 + value.toString().length + 1\n case 'object': return objectLength(value)\n case 'map': return mapLength(value)\n default:\n throw new TypeError(`Unsupported value of type \"${type}\"`)\n }\n}\n\nmodule.exports = encodingLength\n","const bencode = module.exports\n\nbencode.encode = require('./encode.js')\nbencode.decode = require('./decode.js')\n\n/**\n * Determines the amount of bytes\n * needed to encode the given value\n * @param {Object|Array|Buffer|String|Number|Boolean} value\n * @return {Number} byteCount\n */\nbencode.byteLength = bencode.encodingLength = require('./encoding-length.js')\n","const util = module.exports\n\nutil.digitCount = function digitCount (value) {\n // Add a digit for negative numbers, as the sign will be prefixed\n const sign = value < 0 ? 1 : 0\n // Guard against negative numbers & zero going into log10(),\n // as that would return -Infinity\n value = Math.abs(Number(value || 1))\n return Math.floor(Math.log10(value)) + 1 + sign\n}\n\nutil.getType = function getType (value) {\n if (Buffer.isBuffer(value)) return 'buffer'\n if (ArrayBuffer.isView(value)) return 'arraybufferview'\n if (Array.isArray(value)) return 'array'\n if (value instanceof Number) return 'number'\n if (value instanceof Boolean) return 'boolean'\n if (value instanceof Set) return 'set'\n if (value instanceof Map) return 'map'\n if (value instanceof String) return 'string'\n if (value instanceof ArrayBuffer) return 'arraybuffer'\n return typeof value\n}\n","module.exports = parseRange\nmodule.exports.parse = parseRange\nmodule.exports.compose = composeRange\n\nfunction composeRange (range) {\n return range\n .reduce((acc, cur, idx, arr) => {\n if (idx === 0 || cur !== arr[idx - 1] + 1) acc.push([])\n acc[acc.length - 1].push(cur)\n return acc\n }, [])\n .map((cur) => {\n return cur.length > 1 ? `${cur[0]}-${cur[cur.length - 1]}` : `${cur[0]}`\n })\n}\n\nfunction parseRange (range) {\n const generateRange = (start, end = start) => Array.from({ length: end - start + 1 }, (cur, idx) => idx + start)\n\n return range\n .reduce((acc, cur, idx, arr) => {\n const r = cur.split('-').map(cur => parseInt(cur))\n return acc.concat(generateRange(...r))\n }, [])\n}\n","module.exports = function(haystack, needle, comparator, low, high) {\n var mid, cmp;\n\n if(low === undefined)\n low = 0;\n\n else {\n low = low|0;\n if(low < 0 || low >= haystack.length)\n throw new RangeError(\"invalid lower bound\");\n }\n\n if(high === undefined)\n high = haystack.length - 1;\n\n else {\n high = high|0;\n if(high < low || high >= haystack.length)\n throw new RangeError(\"invalid upper bound\");\n }\n\n while(low <= high) {\n // The naive `low + high >>> 1` could fail for array lengths > 2**31\n // because `>>>` converts its operands to int32. `low + (high - low >>> 1)`\n // works for array lengths <= 2**32-1 which is also Javascript's max array\n // length.\n mid = low + ((high - low) >>> 1);\n cmp = +comparator(haystack[mid], needle, mid, haystack);\n\n // Too low.\n if(cmp < 0.0)\n low = mid + 1;\n\n // Too high.\n else if(cmp > 0.0)\n high = mid - 1;\n\n // Key found.\n else\n return mid;\n }\n\n // Key not found.\n return ~low;\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nfunction getByteSize(num) {\n var out = num >> 3;\n if (num % 8 !== 0)\n out++;\n return out;\n}\nvar BitField = /** @class */ (function () {\n /**\n *\n *\n * @param data Either a number representing the maximum number of supported bytes, or a Uint8Array.\n * @param opts Options for the bitfield.\n */\n function BitField(data, opts) {\n if (data === void 0) { data = 0; }\n var grow = opts === null || opts === void 0 ? void 0 : opts.grow;\n this.grow = (grow && isFinite(grow) && getByteSize(grow)) || grow || 0;\n this.buffer =\n typeof data === \"number\" ? new Uint8Array(getByteSize(data)) : data;\n }\n /**\n * Get a particular bit.\n *\n * @param i Bit index to retrieve.\n * @returns A boolean indicating whether the `i`th bit is set.\n */\n BitField.prototype.get = function (i) {\n var j = i >> 3;\n return j < this.buffer.length && !!(this.buffer[j] & (128 >> i % 8));\n };\n /**\n * Set a particular bit.\n *\n * Will grow the underlying array if the bit is out of bounds and the `grow` option is set.\n *\n * @param i Bit index to set.\n * @param value Value to set the bit to. Defaults to `true`.\n */\n BitField.prototype.set = function (i, value) {\n if (value === void 0) { value = true; }\n var j = i >> 3;\n if (value) {\n if (this.buffer.length < j + 1) {\n var length_1 = Math.max(j + 1, Math.min(2 * this.buffer.length, this.grow));\n if (length_1 <= this.grow) {\n var newBuffer = new Uint8Array(length_1);\n newBuffer.set(this.buffer);\n this.buffer = newBuffer;\n }\n }\n // Set\n this.buffer[j] |= 128 >> i % 8;\n }\n else if (j < this.buffer.length) {\n // Clear\n this.buffer[j] &= ~(128 >> i % 8);\n }\n };\n /**\n * Loop through the bits in the bitfield.\n *\n * @param fn Function to be called with the bit value and index.\n * @param start Index of the first bit to look at.\n * @param end Index of the first bit that should no longer be considered.\n */\n BitField.prototype.forEach = function (fn, start, end) {\n if (start === void 0) { start = 0; }\n if (end === void 0) { end = this.buffer.length * 8; }\n for (var i = start, j = i >> 3, y = 128 >> i % 8, byte = this.buffer[j]; i < end; i++) {\n fn(!!(byte & y), i);\n y = y === 1 ? ((byte = this.buffer[++j]), 128) : y >> 1;\n }\n };\n return BitField;\n}());\nexports.default = BitField;\n","/*! bittorrent-protocol. MIT License. WebTorrent LLC */\nconst arrayRemove = require('unordered-array-remove')\nconst bencode = require('bencode')\nconst BitField = require('bitfield').default\nconst crypto = require('crypto')\nconst debug = require('debug')('bittorrent-protocol')\nconst randombytes = require('randombytes')\nconst sha1 = require('simple-sha1')\nconst speedometer = require('speedometer')\nconst stream = require('readable-stream')\nconst RC4 = require('rc4')\n\nconst BITFIELD_GROW = 400000\nconst KEEP_ALIVE_TIMEOUT = 55000\n\nconst MESSAGE_PROTOCOL = Buffer.from('\\u0013BitTorrent protocol')\nconst MESSAGE_KEEP_ALIVE = Buffer.from([0x00, 0x00, 0x00, 0x00])\nconst MESSAGE_CHOKE = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x00])\nconst MESSAGE_UNCHOKE = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x01])\nconst MESSAGE_INTERESTED = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x02])\nconst MESSAGE_UNINTERESTED = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x03])\n\nconst MESSAGE_RESERVED = [0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]\nconst MESSAGE_PORT = [0x00, 0x00, 0x00, 0x03, 0x09, 0x00, 0x00]\n\nconst DH_PRIME = 'ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a36210000000000090563'\nconst DH_GENERATOR = 2\nconst VC = Buffer.from([0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00])\nconst CRYPTO_PROVIDE = Buffer.from([0x00, 0x00, 0x01, 0x02])\nconst CRYPTO_SELECT = Buffer.from([0x00, 0x00, 0x00, 0x02]) // always try to choose RC4 encryption instead of plaintext\n\nfunction xor (a, b) {\n for (let len = a.length; len--;) a[len] ^= b[len]\n return a\n}\n\nclass Request {\n constructor (piece, offset, length, callback) {\n this.piece = piece\n this.offset = offset\n this.length = length\n this.callback = callback\n }\n}\n\nclass Wire extends stream.Duplex {\n constructor (type = null, retries = 0, peEnabled = false) {\n super()\n\n this._debugId = randombytes(4).toString('hex')\n this._debug('new wire')\n\n this.peerId = null // remote peer id (hex string)\n this.peerIdBuffer = null // remote peer id (buffer)\n this.type = type // connection type ('webrtc', 'tcpIncoming', 'tcpOutgoing', 'webSeed')\n\n this.amChoking = true // are we choking the peer?\n this.amInterested = false // are we interested in the peer?\n\n this.peerChoking = true // is the peer choking us?\n this.peerInterested = false // is the peer interested in us?\n\n // The largest torrent that I know of (the Geocities archive) is ~641 GB and has\n // ~41,000 pieces. Therefore, cap bitfield to 10x larger (400,000 bits) to support all\n // possible torrents but prevent malicious peers from growing bitfield to fill memory.\n this.peerPieces = new BitField(0, { grow: BITFIELD_GROW })\n\n this.peerExtensions = {}\n\n this.requests = [] // outgoing\n this.peerRequests = [] // incoming\n\n this.extendedMapping = {} // number -> string, ex: 1 -> 'ut_metadata'\n this.peerExtendedMapping = {} // string -> number, ex: 9 -> 'ut_metadata'\n\n // The extended handshake to send, minus the \"m\" field, which gets automatically\n // filled from `this.extendedMapping`\n this.extendedHandshake = {}\n\n this.peerExtendedHandshake = {} // remote peer's extended handshake\n\n this._ext = {} // string -> function, ex 'ut_metadata' -> ut_metadata()\n this._nextExt = 1\n\n this.uploaded = 0\n this.downloaded = 0\n this.uploadSpeed = speedometer()\n this.downloadSpeed = speedometer()\n\n this._keepAliveInterval = null\n this._timeout = null\n this._timeoutMs = 0\n this._timeoutExpiresAt = null\n\n this.destroyed = false // was the wire ended by calling `destroy`?\n this._finished = false\n\n this._parserSize = 0 // number of needed bytes to parse next message from remote peer\n this._parser = null // function to call once `this._parserSize` bytes are available\n\n this._buffer = [] // incomplete message data\n this._bufferSize = 0 // cached total length of buffers in `this._buffer`\n\n this._peEnabled = peEnabled\n if (peEnabled) {\n this._dh = crypto.createDiffieHellman(DH_PRIME, 'hex', DH_GENERATOR) // crypto object used to generate keys/secret\n this._myPubKey = this._dh.generateKeys('hex') // my DH public key\n } else {\n this._myPubKey = null\n }\n this._peerPubKey = null // peer's DH public key\n this._sharedSecret = null // shared DH secret\n this._peerCryptoProvide = [] // encryption methods provided by peer; we expect this to always contain 0x02\n this._cryptoHandshakeDone = false\n\n this._cryptoSyncPattern = null // the pattern to search for when resynchronizing after receiving pe1/pe2\n this._waitMaxBytes = null // the maximum number of bytes resynchronization must occur within\n this._encryptionMethod = null // 1 for plaintext, 2 for RC4\n this._encryptGenerator = null // RC4 keystream generator for encryption\n this._decryptGenerator = null // RC4 keystream generator for decryption\n this._setGenerators = false // a flag for whether setEncrypt() has successfully completed\n\n this.once('finish', () => this._onFinish())\n\n this.on('finish', this._onFinish)\n this._debug('type:', this.type)\n\n if (this.type === 'tcpIncoming' && this._peEnabled) {\n // If we are not the initiator, we should wait to see if the client begins\n // with PE/MSE handshake or the standard bittorrent handshake.\n this._determineHandshakeType()\n } else if (this.type === 'tcpOutgoing' && this._peEnabled && retries === 0) {\n this._parsePe2()\n } else {\n this._parseHandshake(null)\n }\n }\n\n /**\n * Set whether to send a \"keep-alive\" ping (sent every 55s)\n * @param {boolean} enable\n */\n setKeepAlive (enable) {\n this._debug('setKeepAlive %s', enable)\n clearInterval(this._keepAliveInterval)\n if (enable === false) return\n this._keepAliveInterval = setInterval(() => {\n this.keepAlive()\n }, KEEP_ALIVE_TIMEOUT)\n }\n\n /**\n * Set the amount of time to wait before considering a request to be \"timed out\"\n * @param {number} ms\n * @param {boolean=} unref (should the timer be unref'd? default: false)\n */\n setTimeout (ms, unref) {\n this._debug('setTimeout ms=%d unref=%s', ms, unref)\n this._timeoutMs = ms\n this._timeoutUnref = !!unref\n this._resetTimeout(true)\n }\n\n destroy () {\n if (this.destroyed) return\n this.destroyed = true\n this._debug('destroy')\n this.emit('close')\n this.end()\n }\n\n end (...args) {\n this._debug('end')\n this._onUninterested()\n this._onChoke()\n super.end(...args)\n }\n\n /**\n * Use the specified protocol extension.\n * @param {function} Extension\n */\n use (Extension) {\n const name = Extension.prototype.name\n if (!name) {\n throw new Error('Extension class requires a \"name\" property on the prototype')\n }\n this._debug('use extension.name=%s', name)\n\n const ext = this._nextExt\n const handler = new Extension(this)\n\n function noop () {}\n\n if (typeof handler.onHandshake !== 'function') {\n handler.onHandshake = noop\n }\n if (typeof handler.onExtendedHandshake !== 'function') {\n handler.onExtendedHandshake = noop\n }\n if (typeof handler.onMessage !== 'function') {\n handler.onMessage = noop\n }\n\n this.extendedMapping[ext] = name\n this._ext[name] = handler\n this[name] = handler\n\n this._nextExt += 1\n }\n\n //\n // OUTGOING MESSAGES\n //\n\n /**\n * Message \"keep-alive\": \n */\n keepAlive () {\n this._debug('keep-alive')\n this._push(MESSAGE_KEEP_ALIVE)\n }\n\n sendPe1 () {\n if (this._peEnabled) {\n const padALen = Math.floor(Math.random() * 513)\n const padA = randombytes(padALen)\n this._push(Buffer.concat([Buffer.from(this._myPubKey, 'hex'), padA]))\n }\n }\n\n sendPe2 () {\n const padBLen = Math.floor(Math.random() * 513)\n const padB = randombytes(padBLen)\n this._push(Buffer.concat([Buffer.from(this._myPubKey, 'hex'), padB]))\n }\n\n sendPe3 (infoHash) {\n this.setEncrypt(this._sharedSecret, infoHash)\n\n const hash1Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req1') + this._sharedSecret, 'hex')), 'hex')\n\n const hash2Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req2') + infoHash, 'hex')), 'hex')\n const hash3Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req3') + this._sharedSecret, 'hex')), 'hex')\n const hashesXorBuffer = xor(hash2Buffer, hash3Buffer)\n\n const padCLen = randombytes(2).readUInt16BE(0) % 512\n const padCBuffer = randombytes(padCLen)\n\n let vcAndProvideBuffer = Buffer.alloc(8 + 4 + 2 + padCLen + 2)\n VC.copy(vcAndProvideBuffer)\n CRYPTO_PROVIDE.copy(vcAndProvideBuffer, 8)\n\n vcAndProvideBuffer.writeInt16BE(padCLen, 12) // pad C length\n padCBuffer.copy(vcAndProvideBuffer, 14)\n vcAndProvideBuffer.writeInt16BE(0, 14 + padCLen) // IA length\n vcAndProvideBuffer = this._encryptHandshake(vcAndProvideBuffer)\n\n this._push(Buffer.concat([hash1Buffer, hashesXorBuffer, vcAndProvideBuffer]))\n }\n\n sendPe4 (infoHash) {\n this.setEncrypt(this._sharedSecret, infoHash)\n\n const padDLen = randombytes(2).readUInt16BE(0) % 512\n const padDBuffer = randombytes(padDLen)\n let vcAndSelectBuffer = Buffer.alloc(8 + 4 + 2 + padDLen)\n VC.copy(vcAndSelectBuffer)\n CRYPTO_SELECT.copy(vcAndSelectBuffer, 8)\n vcAndSelectBuffer.writeInt16BE(padDLen, 12) // lenD?\n padDBuffer.copy(vcAndSelectBuffer, 14)\n vcAndSelectBuffer = this._encryptHandshake(vcAndSelectBuffer)\n this._push(vcAndSelectBuffer)\n this._cryptoHandshakeDone = true\n this._debug('completed crypto handshake')\n }\n\n /**\n * Message: \"handshake\" \n * @param {Buffer|string} infoHash (as Buffer or *hex* string)\n * @param {Buffer|string} peerId\n * @param {Object} extensions\n */\n handshake (infoHash, peerId, extensions) {\n let infoHashBuffer\n let peerIdBuffer\n if (typeof infoHash === 'string') {\n infoHash = infoHash.toLowerCase()\n infoHashBuffer = Buffer.from(infoHash, 'hex')\n } else {\n infoHashBuffer = infoHash\n infoHash = infoHashBuffer.toString('hex')\n }\n if (typeof peerId === 'string') {\n peerIdBuffer = Buffer.from(peerId, 'hex')\n } else {\n peerIdBuffer = peerId\n peerId = peerIdBuffer.toString('hex')\n }\n\n this._infoHash = infoHashBuffer\n\n if (infoHashBuffer.length !== 20 || peerIdBuffer.length !== 20) {\n throw new Error('infoHash and peerId MUST have length 20')\n }\n\n this._debug('handshake i=%s p=%s exts=%o', infoHash, peerId, extensions)\n\n const reserved = Buffer.from(MESSAGE_RESERVED)\n\n // enable extended message\n reserved[5] |= 0x10\n\n if (extensions && extensions.dht) reserved[7] |= 1\n\n this._push(Buffer.concat([MESSAGE_PROTOCOL, reserved, infoHashBuffer, peerIdBuffer]))\n this._handshakeSent = true\n\n if (this.peerExtensions.extended && !this._extendedHandshakeSent) {\n // Peer's handshake indicated support already\n // (incoming connection)\n this._sendExtendedHandshake()\n }\n }\n\n /* Peer supports BEP-0010, send extended handshake.\n *\n * This comes after the 'handshake' event to give the user a chance to populate\n * `this.extendedHandshake` and `this.extendedMapping` before the extended handshake\n * is sent to the remote peer.\n */\n _sendExtendedHandshake () {\n // Create extended message object from registered extensions\n const msg = Object.assign({}, this.extendedHandshake)\n msg.m = {}\n for (const ext in this.extendedMapping) {\n const name = this.extendedMapping[ext]\n msg.m[name] = Number(ext)\n }\n\n // Send extended handshake\n this.extended(0, bencode.encode(msg))\n this._extendedHandshakeSent = true\n }\n\n /**\n * Message \"choke\": \n */\n choke () {\n if (this.amChoking) return\n this.amChoking = true\n this._debug('choke')\n while (this.peerRequests.length) {\n this.peerRequests.pop()\n }\n this._push(MESSAGE_CHOKE)\n }\n\n /**\n * Message \"unchoke\": \n */\n unchoke () {\n if (!this.amChoking) return\n this.amChoking = false\n this._debug('unchoke')\n this._push(MESSAGE_UNCHOKE)\n }\n\n /**\n * Message \"interested\": \n */\n interested () {\n if (this.amInterested) return\n this.amInterested = true\n this._debug('interested')\n this._push(MESSAGE_INTERESTED)\n }\n\n /**\n * Message \"uninterested\": \n */\n uninterested () {\n if (!this.amInterested) return\n this.amInterested = false\n this._debug('uninterested')\n this._push(MESSAGE_UNINTERESTED)\n }\n\n /**\n * Message \"have\": \n * @param {number} index\n */\n have (index) {\n this._debug('have %d', index)\n this._message(4, [index], null)\n }\n\n /**\n * Message \"bitfield\": \n * @param {BitField|Buffer} bitfield\n */\n bitfield (bitfield) {\n this._debug('bitfield')\n if (!Buffer.isBuffer(bitfield)) bitfield = bitfield.buffer\n this._message(5, [], bitfield)\n }\n\n /**\n * Message \"request\": \n * @param {number} index\n * @param {number} offset\n * @param {number} length\n * @param {function} cb\n */\n request (index, offset, length, cb) {\n if (!cb) cb = () => {}\n if (this._finished) return cb(new Error('wire is closed'))\n if (this.peerChoking) return cb(new Error('peer is choking'))\n\n this._debug('request index=%d offset=%d length=%d', index, offset, length)\n\n this.requests.push(new Request(index, offset, length, cb))\n if (!this._timeout) {\n this._resetTimeout(true)\n }\n this._message(6, [index, offset, length], null)\n }\n\n /**\n * Message \"piece\": \n * @param {number} index\n * @param {number} offset\n * @param {Buffer} buffer\n */\n piece (index, offset, buffer) {\n this._debug('piece index=%d offset=%d', index, offset)\n this._message(7, [index, offset], buffer)\n this.uploaded += buffer.length\n this.uploadSpeed(buffer.length)\n this.emit('upload', buffer.length)\n }\n\n /**\n * Message \"cancel\": \n * @param {number} index\n * @param {number} offset\n * @param {number} length\n */\n cancel (index, offset, length) {\n this._debug('cancel index=%d offset=%d length=%d', index, offset, length)\n this._callback(\n this._pull(this.requests, index, offset, length),\n new Error('request was cancelled'),\n null\n )\n this._message(8, [index, offset, length], null)\n }\n\n /**\n * Message: \"port\" \n * @param {Number} port\n */\n port (port) {\n this._debug('port %d', port)\n const message = Buffer.from(MESSAGE_PORT)\n message.writeUInt16BE(port, 5)\n this._push(message)\n }\n\n /**\n * Message: \"extended\" \n * @param {number|string} ext\n * @param {Object} obj\n */\n extended (ext, obj) {\n this._debug('extended ext=%s', ext)\n if (typeof ext === 'string' && this.peerExtendedMapping[ext]) {\n ext = this.peerExtendedMapping[ext]\n }\n if (typeof ext === 'number') {\n const extId = Buffer.from([ext])\n const buf = Buffer.isBuffer(obj) ? obj : bencode.encode(obj)\n\n this._message(20, [], Buffer.concat([extId, buf]))\n } else {\n throw new Error(`Unrecognized extension: ${ext}`)\n }\n }\n\n /**\n * Sets the encryption method for this wire, as per PSE/ME specification\n *\n * @param {string} sharedSecret: A hex-encoded string, which is the shared secret agreed\n * upon from DH key exchange\n * @param {string} infoHash: A hex-encoded info hash\n * @returns boolean, true if encryption setting succeeds, false if it fails.\n */\n setEncrypt (sharedSecret, infoHash) {\n let encryptKey\n let decryptKey\n let encryptKeyBuf\n let encryptKeyIntArray\n let decryptKeyBuf\n let decryptKeyIntArray\n switch (this.type) {\n case 'tcpIncoming':\n encryptKey = sha1.sync(Buffer.from(this._utfToHex('keyB') + sharedSecret + infoHash, 'hex'))\n decryptKey = sha1.sync(Buffer.from(this._utfToHex('keyA') + sharedSecret + infoHash, 'hex'))\n encryptKeyBuf = Buffer.from(encryptKey, 'hex')\n encryptKeyIntArray = []\n for (const value of encryptKeyBuf.values()) {\n encryptKeyIntArray.push(value)\n }\n decryptKeyBuf = Buffer.from(decryptKey, 'hex')\n decryptKeyIntArray = []\n for (const value of decryptKeyBuf.values()) {\n decryptKeyIntArray.push(value)\n }\n this._encryptGenerator = new RC4(encryptKeyIntArray)\n this._decryptGenerator = new RC4(decryptKeyIntArray)\n break\n case 'tcpOutgoing':\n encryptKey = sha1.sync(Buffer.from(this._utfToHex('keyA') + sharedSecret + infoHash, 'hex'))\n decryptKey = sha1.sync(Buffer.from(this._utfToHex('keyB') + sharedSecret + infoHash, 'hex'))\n encryptKeyBuf = Buffer.from(encryptKey, 'hex')\n encryptKeyIntArray = []\n for (const value of encryptKeyBuf.values()) {\n encryptKeyIntArray.push(value)\n }\n decryptKeyBuf = Buffer.from(decryptKey, 'hex')\n decryptKeyIntArray = []\n for (const value of decryptKeyBuf.values()) {\n decryptKeyIntArray.push(value)\n }\n this._encryptGenerator = new RC4(encryptKeyIntArray)\n this._decryptGenerator = new RC4(decryptKeyIntArray)\n break\n default:\n return false\n }\n\n // Discard the first 1024 bytes, as per MSE/PE implementation\n for (let i = 0; i < 1024; i++) {\n this._encryptGenerator.randomByte()\n this._decryptGenerator.randomByte()\n }\n\n this._setGenerators = true\n return true\n }\n\n /**\n * Duplex stream method. Called whenever the remote peer stream wants data. No-op\n * since we'll just push data whenever we get it.\n */\n _read () {}\n\n /**\n * Send a message to the remote peer.\n */\n _message (id, numbers, data) {\n const dataLength = data ? data.length : 0\n const buffer = Buffer.allocUnsafe(5 + (4 * numbers.length))\n\n buffer.writeUInt32BE(buffer.length + dataLength - 4, 0)\n buffer[4] = id\n for (let i = 0; i < numbers.length; i++) {\n buffer.writeUInt32BE(numbers[i], 5 + (4 * i))\n }\n\n this._push(buffer)\n if (data) this._push(data)\n }\n\n _push (data) {\n if (this._finished) return\n if (this._encryptionMethod === 2 && this._cryptoHandshakeDone) {\n data = this._encrypt(data)\n }\n return this.push(data)\n }\n\n //\n // INCOMING MESSAGES\n //\n\n _onKeepAlive () {\n this._debug('got keep-alive')\n this.emit('keep-alive')\n }\n\n _onPe1 (pubKeyBuffer) {\n this._peerPubKey = pubKeyBuffer.toString('hex')\n this._sharedSecret = this._dh.computeSecret(this._peerPubKey, 'hex', 'hex')\n this.emit('pe1')\n }\n\n _onPe2 (pubKeyBuffer) {\n this._peerPubKey = pubKeyBuffer.toString('hex')\n this._sharedSecret = this._dh.computeSecret(this._peerPubKey, 'hex', 'hex')\n this.emit('pe2')\n }\n\n _onPe3 (hashesXorBuffer) {\n const hash3 = sha1.sync(Buffer.from(this._utfToHex('req3') + this._sharedSecret, 'hex'))\n const sKeyHash = xor(Buffer.from(hash3, 'hex'), hashesXorBuffer).toString('hex')\n this.emit('pe3', sKeyHash)\n }\n\n _onPe3Encrypted (vcBuffer, peerProvideBuffer) {\n if (!vcBuffer.equals(VC)) {\n this._debug('Error: verification constant did not match')\n this.destroy()\n return\n }\n\n for (const provideByte of peerProvideBuffer.values()) {\n if (provideByte !== 0) {\n this._peerCryptoProvide.push(provideByte)\n }\n }\n if (this._peerCryptoProvide.includes(2)) {\n this._encryptionMethod = 2\n } else {\n this._debug('Error: RC4 encryption method not provided by peer')\n this.destroy()\n }\n }\n\n _onPe4 (peerSelectBuffer) {\n this._encryptionMethod = peerSelectBuffer.readUInt8(3)\n if (!CRYPTO_PROVIDE.includes(this._encryptionMethod)) {\n this._debug('Error: peer selected invalid crypto method')\n this.destroy()\n }\n this._cryptoHandshakeDone = true\n this._debug('crypto handshake done')\n this.emit('pe4')\n }\n\n _onHandshake (infoHashBuffer, peerIdBuffer, extensions) {\n const infoHash = infoHashBuffer.toString('hex')\n const peerId = peerIdBuffer.toString('hex')\n\n this._debug('got handshake i=%s p=%s exts=%o', infoHash, peerId, extensions)\n\n this.peerId = peerId\n this.peerIdBuffer = peerIdBuffer\n this.peerExtensions = extensions\n\n this.emit('handshake', infoHash, peerId, extensions)\n\n for (const name in this._ext) {\n this._ext[name].onHandshake(infoHash, peerId, extensions)\n }\n\n if (extensions.extended && this._handshakeSent &&\n !this._extendedHandshakeSent) {\n // outgoing connection\n this._sendExtendedHandshake()\n }\n }\n\n _onChoke () {\n this.peerChoking = true\n this._debug('got choke')\n this.emit('choke')\n while (this.requests.length) {\n this._callback(this.requests.pop(), new Error('peer is choking'), null)\n }\n }\n\n _onUnchoke () {\n this.peerChoking = false\n this._debug('got unchoke')\n this.emit('unchoke')\n }\n\n _onInterested () {\n this.peerInterested = true\n this._debug('got interested')\n this.emit('interested')\n }\n\n _onUninterested () {\n this.peerInterested = false\n this._debug('got uninterested')\n this.emit('uninterested')\n }\n\n _onHave (index) {\n if (this.peerPieces.get(index)) return\n this._debug('got have %d', index)\n\n this.peerPieces.set(index, true)\n this.emit('have', index)\n }\n\n _onBitField (buffer) {\n this.peerPieces = new BitField(buffer)\n this._debug('got bitfield')\n this.emit('bitfield', this.peerPieces)\n }\n\n _onRequest (index, offset, length) {\n if (this.amChoking) return\n this._debug('got request index=%d offset=%d length=%d', index, offset, length)\n\n const respond = (err, buffer) => {\n if (request !== this._pull(this.peerRequests, index, offset, length)) return\n if (err) return this._debug('error satisfying request index=%d offset=%d length=%d (%s)', index, offset, length, err.message)\n this.piece(index, offset, buffer)\n }\n\n const request = new Request(index, offset, length, respond)\n this.peerRequests.push(request)\n this.emit('request', index, offset, length, respond)\n }\n\n _onPiece (index, offset, buffer) {\n this._debug('got piece index=%d offset=%d', index, offset)\n this._callback(this._pull(this.requests, index, offset, buffer.length), null, buffer)\n this.downloaded += buffer.length\n this.downloadSpeed(buffer.length)\n this.emit('download', buffer.length)\n this.emit('piece', index, offset, buffer)\n }\n\n _onCancel (index, offset, length) {\n this._debug('got cancel index=%d offset=%d length=%d', index, offset, length)\n this._pull(this.peerRequests, index, offset, length)\n this.emit('cancel', index, offset, length)\n }\n\n _onPort (port) {\n this._debug('got port %d', port)\n this.emit('port', port)\n }\n\n _onExtended (ext, buf) {\n if (ext === 0) {\n let info\n try {\n info = bencode.decode(buf)\n } catch (err) {\n this._debug('ignoring invalid extended handshake: %s', err.message || err)\n }\n\n if (!info) return\n this.peerExtendedHandshake = info\n\n if (typeof info.m === 'object') {\n for (const name in info.m) {\n this.peerExtendedMapping[name] = Number(info.m[name].toString())\n }\n }\n for (const name in this._ext) {\n if (this.peerExtendedMapping[name]) {\n this._ext[name].onExtendedHandshake(this.peerExtendedHandshake)\n }\n }\n this._debug('got extended handshake')\n this.emit('extended', 'handshake', this.peerExtendedHandshake)\n } else {\n if (this.extendedMapping[ext]) {\n ext = this.extendedMapping[ext] // friendly name for extension\n if (this._ext[ext]) {\n // there is an registered extension handler, so call it\n this._ext[ext].onMessage(buf)\n }\n }\n this._debug('got extended message ext=%s', ext)\n this.emit('extended', ext, buf)\n }\n }\n\n _onTimeout () {\n this._debug('request timed out')\n this._callback(this.requests.shift(), new Error('request has timed out'), null)\n this.emit('timeout')\n }\n\n /**\n * Duplex stream method. Called whenever the remote peer has data for us. Data that the\n * remote peer sends gets buffered (i.e. not actually processed) until the right number\n * of bytes have arrived, determined by the last call to `this._parse(number, callback)`.\n * Once enough bytes have arrived to process the message, the callback function\n * (i.e. `this._parser`) gets called with the full buffer of data.\n * @param {Buffer} data\n * @param {string} encoding\n * @param {function} cb\n */\n _write (data, encoding, cb) {\n if (this._encryptionMethod === 2 && this._cryptoHandshakeDone) {\n data = this._decrypt(data)\n }\n this._bufferSize += data.length\n this._buffer.push(data)\n if (this._buffer.length > 1) {\n this._buffer = [Buffer.concat(this._buffer, this._bufferSize)]\n }\n // now this._buffer is an array containing a single Buffer\n if (this._cryptoSyncPattern) {\n const index = this._buffer[0].indexOf(this._cryptoSyncPattern)\n if (index !== -1) {\n this._buffer[0] = this._buffer[0].slice(index + this._cryptoSyncPattern.length)\n this._bufferSize -= (index + this._cryptoSyncPattern.length)\n this._cryptoSyncPattern = null\n } else if (this._bufferSize + data.length > this._waitMaxBytes + this._cryptoSyncPattern.length) {\n this._debug('Error: could not resynchronize')\n this.destroy()\n return\n }\n }\n\n while (this._bufferSize >= this._parserSize && !this._cryptoSyncPattern) {\n if (this._parserSize === 0) {\n this._parser(Buffer.from([]))\n } else {\n const buffer = this._buffer[0]\n // console.log('buffer:', this._buffer)\n this._bufferSize -= this._parserSize\n this._buffer = this._bufferSize\n ? [buffer.slice(this._parserSize)]\n : []\n this._parser(buffer.slice(0, this._parserSize))\n }\n }\n\n cb(null) // Signal that we're ready for more data\n }\n\n _callback (request, err, buffer) {\n if (!request) return\n\n this._resetTimeout(!this.peerChoking && !this._finished)\n\n request.callback(err, buffer)\n }\n\n _resetTimeout (setAgain) {\n if (!setAgain || !this._timeoutMs || !this.requests.length) {\n clearTimeout(this._timeout)\n this._timeout = null\n this._timeoutExpiresAt = null\n return\n }\n\n const timeoutExpiresAt = Date.now() + this._timeoutMs\n\n if (this._timeout) {\n // If existing expiration is already within 5% of correct, it's close enough\n if (timeoutExpiresAt - this._timeoutExpiresAt < this._timeoutMs * 0.05) {\n return\n }\n clearTimeout(this._timeout)\n }\n\n this._timeoutExpiresAt = timeoutExpiresAt\n this._timeout = setTimeout(() => this._onTimeout(), this._timeoutMs)\n if (this._timeoutUnref && this._timeout.unref) this._timeout.unref()\n }\n\n /**\n * Takes a number of bytes that the local peer is waiting to receive from the remote peer\n * in order to parse a complete message, and a callback function to be called once enough\n * bytes have arrived.\n * @param {number} size\n * @param {function} parser\n */\n _parse (size, parser) {\n this._parserSize = size\n this._parser = parser\n }\n\n _parseUntil (pattern, maxBytes) {\n this._cryptoSyncPattern = pattern\n this._waitMaxBytes = maxBytes\n }\n\n /**\n * Handle the first 4 bytes of a message, to determine the length of bytes that must be\n * waited for in order to have the whole message.\n * @param {Buffer} buffer\n */\n _onMessageLength (buffer) {\n const length = buffer.readUInt32BE(0)\n if (length > 0) {\n this._parse(length, this._onMessage)\n } else {\n this._onKeepAlive()\n this._parse(4, this._onMessageLength)\n }\n }\n\n /**\n * Handle a message from the remote peer.\n * @param {Buffer} buffer\n */\n _onMessage (buffer) {\n this._parse(4, this._onMessageLength)\n switch (buffer[0]) {\n case 0:\n return this._onChoke()\n case 1:\n return this._onUnchoke()\n case 2:\n return this._onInterested()\n case 3:\n return this._onUninterested()\n case 4:\n return this._onHave(buffer.readUInt32BE(1))\n case 5:\n return this._onBitField(buffer.slice(1))\n case 6:\n return this._onRequest(\n buffer.readUInt32BE(1),\n buffer.readUInt32BE(5),\n buffer.readUInt32BE(9)\n )\n case 7:\n return this._onPiece(\n buffer.readUInt32BE(1),\n buffer.readUInt32BE(5),\n buffer.slice(9)\n )\n case 8:\n return this._onCancel(\n buffer.readUInt32BE(1),\n buffer.readUInt32BE(5),\n buffer.readUInt32BE(9)\n )\n case 9:\n return this._onPort(buffer.readUInt16BE(1))\n case 20:\n return this._onExtended(buffer.readUInt8(1), buffer.slice(2))\n default:\n this._debug('got unknown message')\n return this.emit('unknownmessage', buffer)\n }\n }\n\n _determineHandshakeType () {\n this._parse(1, pstrLenBuffer => {\n const pstrlen = pstrLenBuffer.readUInt8(0)\n if (pstrlen === 19) {\n this._parse(pstrlen + 48, this._onHandshakeBuffer)\n } else {\n this._parsePe1(pstrLenBuffer)\n }\n })\n }\n\n _parsePe1 (pubKeyPrefix) {\n this._parse(95, pubKeySuffix => {\n this._onPe1(Buffer.concat([pubKeyPrefix, pubKeySuffix]))\n this._parsePe3()\n })\n }\n\n _parsePe2 () {\n this._parse(96, pubKey => {\n this._onPe2(pubKey)\n while (!this._setGenerators) {\n // Wait until generators have been set\n }\n this._parsePe4()\n })\n }\n\n // Handles the unencrypted portion of step 4\n _parsePe3 () {\n const hash1Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req1') + this._sharedSecret, 'hex')), 'hex')\n // synchronize on HASH('req1', S)\n this._parseUntil(hash1Buffer, 512)\n this._parse(20, buffer => {\n this._onPe3(buffer)\n while (!this._setGenerators) {\n // Wait until generators have been set\n }\n this._parsePe3Encrypted()\n })\n }\n\n _parsePe3Encrypted () {\n this._parse(14, buffer => {\n const vcBuffer = this._decryptHandshake(buffer.slice(0, 8))\n const peerProvideBuffer = this._decryptHandshake(buffer.slice(8, 12))\n const padCLen = this._decryptHandshake(buffer.slice(12, 14)).readUInt16BE(0)\n this._parse(padCLen, padCBuffer => {\n padCBuffer = this._decryptHandshake(padCBuffer)\n this._parse(2, iaLenBuf => {\n const iaLen = this._decryptHandshake(iaLenBuf).readUInt16BE(0)\n this._parse(iaLen, iaBuffer => {\n iaBuffer = this._decryptHandshake(iaBuffer)\n this._onPe3Encrypted(vcBuffer, peerProvideBuffer, padCBuffer, iaBuffer)\n const pstrlen = iaLen ? iaBuffer.readUInt8(0) : null\n const protocol = iaLen ? iaBuffer.slice(1, 20) : null\n if (pstrlen === 19 && protocol.toString() === 'BitTorrent protocol') {\n this._onHandshakeBuffer(iaBuffer.slice(1))\n } else {\n this._parseHandshake()\n }\n })\n })\n })\n })\n }\n\n _parsePe4 () {\n // synchronize on ENCRYPT(VC).\n // since we encrypt using bitwise xor, decryption and encryption are the same operation.\n // calling _decryptHandshake here advances the decrypt generator keystream forward 8 bytes\n const vcBufferEncrypted = this._decryptHandshake(VC)\n this._parseUntil(vcBufferEncrypted, 512)\n this._parse(6, buffer => {\n const peerSelectBuffer = this._decryptHandshake(buffer.slice(0, 4))\n const padDLen = this._decryptHandshake(buffer.slice(4, 6)).readUInt16BE(0)\n this._parse(padDLen, padDBuf => {\n this._decryptHandshake(padDBuf)\n this._onPe4(peerSelectBuffer)\n this._parseHandshake(null)\n })\n })\n }\n\n /**\n * Reads the handshake as specified by the bittorrent wire protocol.\n */\n _parseHandshake () {\n this._parse(1, buffer => {\n const pstrlen = buffer.readUInt8(0)\n if (pstrlen !== 19) {\n this._debug('Error: wire not speaking BitTorrent protocol (%s)', pstrlen.toString())\n this.end()\n return\n }\n this._parse(pstrlen + 48, this._onHandshakeBuffer)\n })\n }\n\n _onHandshakeBuffer (handshake) {\n const protocol = handshake.slice(0, 19)\n if (protocol.toString() !== 'BitTorrent protocol') {\n this._debug('Error: wire not speaking BitTorrent protocol (%s)', protocol.toString())\n this.end()\n return\n }\n handshake = handshake.slice(19)\n this._onHandshake(handshake.slice(8, 28), handshake.slice(28, 48), {\n dht: !!(handshake[7] & 0x01), // see bep_0005\n extended: !!(handshake[5] & 0x10) // see bep_0010\n })\n this._parse(4, this._onMessageLength)\n }\n\n _onFinish () {\n this._finished = true\n\n this.push(null) // stream cannot be half open, so signal the end of it\n while (this.read()) {\n // body intentionally empty\n // consume and discard the rest of the stream data\n }\n\n clearInterval(this._keepAliveInterval)\n this._parse(Number.MAX_VALUE, () => {})\n while (this.peerRequests.length) {\n this.peerRequests.pop()\n }\n while (this.requests.length) {\n this._callback(this.requests.pop(), new Error('wire was closed'), null)\n }\n }\n\n _debug (...args) {\n args[0] = `[${this._debugId}] ${args[0]}`\n debug(...args)\n }\n\n _pull (requests, piece, offset, length) {\n for (let i = 0; i < requests.length; i++) {\n const req = requests[i]\n if (req.piece === piece && req.offset === offset && req.length === length) {\n arrayRemove(requests, i)\n return req\n }\n }\n return null\n }\n\n _encryptHandshake (buf) {\n const crypt = Buffer.from(buf)\n if (!this._encryptGenerator) {\n this._debug('Warning: Encrypting without any generator')\n return crypt\n }\n\n for (let i = 0; i < buf.length; i++) {\n const keystream = this._encryptGenerator.randomByte()\n crypt[i] = crypt[i] ^ keystream\n }\n\n return crypt\n }\n\n _encrypt (buf) {\n const crypt = Buffer.from(buf)\n\n if (!this._encryptGenerator || this._encryptionMethod !== 2) {\n return crypt\n }\n for (let i = 0; i < buf.length; i++) {\n const keystream = this._encryptGenerator.randomByte()\n crypt[i] = crypt[i] ^ keystream\n }\n\n return crypt\n }\n\n _decryptHandshake (buf) {\n const decrypt = Buffer.from(buf)\n\n if (!this._decryptGenerator) {\n this._debug('Warning: Decrypting without any generator')\n return decrypt\n }\n for (let i = 0; i < buf.length; i++) {\n const keystream = this._decryptGenerator.randomByte()\n decrypt[i] = decrypt[i] ^ keystream\n }\n\n return decrypt\n }\n\n _decrypt (buf) {\n const decrypt = Buffer.from(buf)\n\n if (!this._decryptGenerator || this._encryptionMethod !== 2) {\n return decrypt\n }\n for (let i = 0; i < buf.length; i++) {\n const keystream = this._decryptGenerator.randomByte()\n decrypt[i] = decrypt[i] ^ keystream\n }\n\n return decrypt\n }\n\n _utfToHex (str) {\n return Buffer.from(str, 'utf8').toString('hex')\n }\n}\n\nmodule.exports = Wire\n","const debug = require('debug')('bittorrent-tracker:client')\nconst EventEmitter = require('events')\nconst once = require('once')\nconst parallel = require('run-parallel')\nconst Peer = require('simple-peer')\nconst queueMicrotask = require('queue-microtask')\n\nconst common = require('./lib/common')\nconst HTTPTracker = require('./lib/client/http-tracker') // empty object in browser\nconst UDPTracker = require('./lib/client/udp-tracker') // empty object in browser\nconst WebSocketTracker = require('./lib/client/websocket-tracker')\n\n/**\n * BitTorrent tracker client.\n *\n * Find torrent peers, to help a torrent client participate in a torrent swarm.\n *\n * @param {Object} opts options object\n * @param {string|Buffer} opts.infoHash torrent info hash\n * @param {string|Buffer} opts.peerId peer id\n * @param {string|Array.} opts.announce announce\n * @param {number} opts.port torrent client listening port\n * @param {function} opts.getAnnounceOpts callback to provide data to tracker\n * @param {number} opts.rtcConfig RTCPeerConnection configuration object\n * @param {number} opts.userAgent User-Agent header for http requests\n * @param {number} opts.wrtc custom webrtc impl (useful in node.js)\n */\nclass Client extends EventEmitter {\n constructor (opts = {}) {\n super()\n\n if (!opts.peerId) throw new Error('Option `peerId` is required')\n if (!opts.infoHash) throw new Error('Option `infoHash` is required')\n if (!opts.announce) throw new Error('Option `announce` is required')\n if (!process.browser && !opts.port) throw new Error('Option `port` is required')\n\n this.peerId = typeof opts.peerId === 'string'\n ? opts.peerId\n : opts.peerId.toString('hex')\n this._peerIdBuffer = Buffer.from(this.peerId, 'hex')\n this._peerIdBinary = this._peerIdBuffer.toString('binary')\n\n this.infoHash = typeof opts.infoHash === 'string'\n ? opts.infoHash.toLowerCase()\n : opts.infoHash.toString('hex')\n this._infoHashBuffer = Buffer.from(this.infoHash, 'hex')\n this._infoHashBinary = this._infoHashBuffer.toString('binary')\n\n debug('new client %s', this.infoHash)\n\n this.destroyed = false\n\n this._port = opts.port\n this._getAnnounceOpts = opts.getAnnounceOpts\n this._rtcConfig = opts.rtcConfig\n this._userAgent = opts.userAgent\n\n // Support lazy 'wrtc' module initialization\n // See: https://github.com/webtorrent/webtorrent-hybrid/issues/46\n this._wrtc = typeof opts.wrtc === 'function' ? opts.wrtc() : opts.wrtc\n\n let announce = typeof opts.announce === 'string'\n ? [opts.announce]\n : opts.announce == null ? [] : opts.announce\n\n // Remove trailing slash from trackers to catch duplicates\n announce = announce.map(announceUrl => {\n announceUrl = announceUrl.toString()\n if (announceUrl[announceUrl.length - 1] === '/') {\n announceUrl = announceUrl.substring(0, announceUrl.length - 1)\n }\n return announceUrl\n })\n // remove duplicates by converting to Set and back\n announce = Array.from(new Set(announce))\n\n const webrtcSupport = this._wrtc !== false && (!!this._wrtc || Peer.WEBRTC_SUPPORT)\n\n const nextTickWarn = err => {\n queueMicrotask(() => {\n this.emit('warning', err)\n })\n }\n\n this._trackers = announce\n .map(announceUrl => {\n let parsedUrl\n try {\n parsedUrl = common.parseUrl(announceUrl)\n } catch (err) {\n nextTickWarn(new Error(`Invalid tracker URL: ${announceUrl}`))\n return null\n }\n\n const port = parsedUrl.port\n if (port < 0 || port > 65535) {\n nextTickWarn(new Error(`Invalid tracker port: ${announceUrl}`))\n return null\n }\n\n const protocol = parsedUrl.protocol\n if ((protocol === 'http:' || protocol === 'https:') &&\n typeof HTTPTracker === 'function') {\n return new HTTPTracker(this, announceUrl)\n } else if (protocol === 'udp:' && typeof UDPTracker === 'function') {\n return new UDPTracker(this, announceUrl)\n } else if ((protocol === 'ws:' || protocol === 'wss:') && webrtcSupport) {\n // Skip ws:// trackers on https:// sites because they throw SecurityError\n if (protocol === 'ws:' && typeof window !== 'undefined' &&\n window.location.protocol === 'https:') {\n nextTickWarn(new Error(`Unsupported tracker protocol: ${announceUrl}`))\n return null\n }\n return new WebSocketTracker(this, announceUrl)\n } else {\n nextTickWarn(new Error(`Unsupported tracker protocol: ${announceUrl}`))\n return null\n }\n })\n .filter(Boolean)\n }\n\n /**\n * Send a `start` announce to the trackers.\n * @param {Object} opts\n * @param {number=} opts.uploaded\n * @param {number=} opts.downloaded\n * @param {number=} opts.left (if not set, calculated automatically)\n */\n start (opts) {\n opts = this._defaultAnnounceOpts(opts)\n opts.event = 'started'\n debug('send `start` %o', opts)\n this._announce(opts)\n\n // start announcing on intervals\n this._trackers.forEach(tracker => {\n tracker.setInterval()\n })\n }\n\n /**\n * Send a `stop` announce to the trackers.\n * @param {Object} opts\n * @param {number=} opts.uploaded\n * @param {number=} opts.downloaded\n * @param {number=} opts.numwant\n * @param {number=} opts.left (if not set, calculated automatically)\n */\n stop (opts) {\n opts = this._defaultAnnounceOpts(opts)\n opts.event = 'stopped'\n debug('send `stop` %o', opts)\n this._announce(opts)\n }\n\n /**\n * Send a `complete` announce to the trackers.\n * @param {Object} opts\n * @param {number=} opts.uploaded\n * @param {number=} opts.downloaded\n * @param {number=} opts.numwant\n * @param {number=} opts.left (if not set, calculated automatically)\n */\n complete (opts) {\n if (!opts) opts = {}\n opts = this._defaultAnnounceOpts(opts)\n opts.event = 'completed'\n debug('send `complete` %o', opts)\n this._announce(opts)\n }\n\n /**\n * Send a `update` announce to the trackers.\n * @param {Object} opts\n * @param {number=} opts.uploaded\n * @param {number=} opts.downloaded\n * @param {number=} opts.numwant\n * @param {number=} opts.left (if not set, calculated automatically)\n */\n update (opts) {\n opts = this._defaultAnnounceOpts(opts)\n if (opts.event) delete opts.event\n debug('send `update` %o', opts)\n this._announce(opts)\n }\n\n _announce (opts) {\n this._trackers.forEach(tracker => {\n // tracker should not modify `opts` object, it's passed to all trackers\n tracker.announce(opts)\n })\n }\n\n /**\n * Send a scrape request to the trackers.\n * @param {Object} opts\n */\n scrape (opts) {\n debug('send `scrape`')\n if (!opts) opts = {}\n this._trackers.forEach(tracker => {\n // tracker should not modify `opts` object, it's passed to all trackers\n tracker.scrape(opts)\n })\n }\n\n setInterval (intervalMs) {\n debug('setInterval %d', intervalMs)\n this._trackers.forEach(tracker => {\n tracker.setInterval(intervalMs)\n })\n }\n\n destroy (cb) {\n if (this.destroyed) return\n this.destroyed = true\n debug('destroy')\n\n const tasks = this._trackers.map(tracker => cb => {\n tracker.destroy(cb)\n })\n\n parallel(tasks, cb)\n\n this._trackers = []\n this._getAnnounceOpts = null\n }\n\n _defaultAnnounceOpts (opts = {}) {\n if (opts.numwant == null) opts.numwant = common.DEFAULT_ANNOUNCE_PEERS\n\n if (opts.uploaded == null) opts.uploaded = 0\n if (opts.downloaded == null) opts.downloaded = 0\n\n if (this._getAnnounceOpts) opts = Object.assign({}, opts, this._getAnnounceOpts())\n\n return opts\n }\n}\n\n/**\n * Simple convenience function to scrape a tracker for an info hash without needing to\n * create a Client, pass it a parsed torrent, etc. Support scraping a tracker for multiple\n * torrents at the same time.\n * @params {Object} opts\n * @param {string|Array.} opts.infoHash\n * @param {string} opts.announce\n * @param {function} cb\n */\nClient.scrape = (opts, cb) => {\n cb = once(cb)\n\n if (!opts.infoHash) throw new Error('Option `infoHash` is required')\n if (!opts.announce) throw new Error('Option `announce` is required')\n\n const clientOpts = Object.assign({}, opts, {\n infoHash: Array.isArray(opts.infoHash) ? opts.infoHash[0] : opts.infoHash,\n peerId: Buffer.from('01234567890123456789'), // dummy value\n port: 6881 // dummy value\n })\n\n const client = new Client(clientOpts)\n client.once('error', cb)\n client.once('warning', cb)\n\n let len = Array.isArray(opts.infoHash) ? opts.infoHash.length : 1\n const results = {}\n client.on('scrape', data => {\n len -= 1\n results[data.infoHash] = data\n if (len === 0) {\n client.destroy()\n const keys = Object.keys(results)\n if (keys.length === 1) {\n cb(null, results[keys[0]])\n } else {\n cb(null, results)\n }\n }\n })\n\n opts.infoHash = Array.isArray(opts.infoHash)\n ? opts.infoHash.map(infoHash => Buffer.from(infoHash, 'hex'))\n : Buffer.from(opts.infoHash, 'hex')\n client.scrape({ infoHash: opts.infoHash })\n return client\n}\n\nmodule.exports = Client\n","const EventEmitter = require('events')\n\nclass Tracker extends EventEmitter {\n constructor (client, announceUrl) {\n super()\n\n this.client = client\n this.announceUrl = announceUrl\n\n this.interval = null\n this.destroyed = false\n }\n\n setInterval (intervalMs) {\n if (intervalMs == null) intervalMs = this.DEFAULT_ANNOUNCE_INTERVAL\n\n clearInterval(this.interval)\n\n if (intervalMs) {\n this.interval = setInterval(() => {\n this.announce(this.client._defaultAnnounceOpts())\n }, intervalMs)\n if (this.interval.unref) this.interval.unref()\n }\n }\n}\n\nmodule.exports = Tracker\n","const debug = require('debug')('bittorrent-tracker:websocket-tracker')\nconst Peer = require('simple-peer')\nconst randombytes = require('randombytes')\nconst Socket = require('simple-websocket')\n\nconst common = require('../common')\nconst Tracker = require('./tracker')\n\n// Use a socket pool, so tracker clients share WebSocket objects for the same server.\n// In practice, WebSockets are pretty slow to establish, so this gives a nice performance\n// boost, and saves browser resources.\nconst socketPool = {}\n\nconst RECONNECT_MINIMUM = 10 * 1000\nconst RECONNECT_MAXIMUM = 60 * 60 * 1000\nconst RECONNECT_VARIANCE = 5 * 60 * 1000\nconst OFFER_TIMEOUT = 50 * 1000\n\nclass WebSocketTracker extends Tracker {\n constructor (client, announceUrl) {\n super(client, announceUrl)\n debug('new websocket tracker %s', announceUrl)\n\n this.peers = {} // peers (offer id -> peer)\n this.socket = null\n\n this.reconnecting = false\n this.retries = 0\n this.reconnectTimer = null\n\n // Simple boolean flag to track whether the socket has received data from\n // the websocket server since the last time socket.send() was called.\n this.expectingResponse = false\n\n this._openSocket()\n }\n\n announce (opts) {\n if (this.destroyed || this.reconnecting) return\n if (!this.socket.connected) {\n this.socket.once('connect', () => {\n this.announce(opts)\n })\n return\n }\n\n const params = Object.assign({}, opts, {\n action: 'announce',\n info_hash: this.client._infoHashBinary,\n peer_id: this.client._peerIdBinary\n })\n if (this._trackerId) params.trackerid = this._trackerId\n\n if (opts.event === 'stopped' || opts.event === 'completed') {\n // Don't include offers with 'stopped' or 'completed' event\n this._send(params)\n } else {\n // Limit the number of offers that are generated, since it can be slow\n const numwant = Math.min(opts.numwant, 5)\n\n this._generateOffers(numwant, offers => {\n params.numwant = numwant\n params.offers = offers\n this._send(params)\n })\n }\n }\n\n scrape (opts) {\n if (this.destroyed || this.reconnecting) return\n if (!this.socket.connected) {\n this.socket.once('connect', () => {\n this.scrape(opts)\n })\n return\n }\n\n const infoHashes = (Array.isArray(opts.infoHash) && opts.infoHash.length > 0)\n ? opts.infoHash.map(infoHash => infoHash.toString('binary'))\n : (opts.infoHash && opts.infoHash.toString('binary')) || this.client._infoHashBinary\n const params = {\n action: 'scrape',\n info_hash: infoHashes\n }\n\n this._send(params)\n }\n\n destroy (cb = noop) {\n if (this.destroyed) return cb(null)\n\n this.destroyed = true\n\n clearInterval(this.interval)\n clearTimeout(this.reconnectTimer)\n\n // Destroy peers\n for (const peerId in this.peers) {\n const peer = this.peers[peerId]\n clearTimeout(peer.trackerTimeout)\n peer.destroy()\n }\n this.peers = null\n\n if (this.socket) {\n this.socket.removeListener('connect', this._onSocketConnectBound)\n this.socket.removeListener('data', this._onSocketDataBound)\n this.socket.removeListener('close', this._onSocketCloseBound)\n this.socket.removeListener('error', this._onSocketErrorBound)\n this.socket = null\n }\n\n this._onSocketConnectBound = null\n this._onSocketErrorBound = null\n this._onSocketDataBound = null\n this._onSocketCloseBound = null\n\n if (socketPool[this.announceUrl]) {\n socketPool[this.announceUrl].consumers -= 1\n }\n\n // Other instances are using the socket, so there's nothing left to do here\n if (socketPool[this.announceUrl].consumers > 0) return cb()\n\n let socket = socketPool[this.announceUrl]\n delete socketPool[this.announceUrl]\n socket.on('error', noop) // ignore all future errors\n socket.once('close', cb)\n\n let timeout\n\n // If there is no data response expected, destroy immediately.\n if (!this.expectingResponse) return destroyCleanup()\n\n // Otherwise, wait a short time for potential responses to come in from the\n // server, then force close the socket.\n timeout = setTimeout(destroyCleanup, common.DESTROY_TIMEOUT)\n\n // But, if a response comes from the server before the timeout fires, do cleanup\n // right away.\n socket.once('data', destroyCleanup)\n\n function destroyCleanup () {\n if (timeout) {\n clearTimeout(timeout)\n timeout = null\n }\n socket.removeListener('data', destroyCleanup)\n socket.destroy()\n socket = null\n }\n }\n\n _openSocket () {\n this.destroyed = false\n\n if (!this.peers) this.peers = {}\n\n this._onSocketConnectBound = () => {\n this._onSocketConnect()\n }\n this._onSocketErrorBound = err => {\n this._onSocketError(err)\n }\n this._onSocketDataBound = data => {\n this._onSocketData(data)\n }\n this._onSocketCloseBound = () => {\n this._onSocketClose()\n }\n\n this.socket = socketPool[this.announceUrl]\n if (this.socket) {\n socketPool[this.announceUrl].consumers += 1\n if (this.socket.connected) {\n this._onSocketConnectBound()\n }\n } else {\n this.socket = socketPool[this.announceUrl] = new Socket(this.announceUrl)\n this.socket.consumers = 1\n this.socket.once('connect', this._onSocketConnectBound)\n }\n\n this.socket.on('data', this._onSocketDataBound)\n this.socket.once('close', this._onSocketCloseBound)\n this.socket.once('error', this._onSocketErrorBound)\n }\n\n _onSocketConnect () {\n if (this.destroyed) return\n\n if (this.reconnecting) {\n this.reconnecting = false\n this.retries = 0\n this.announce(this.client._defaultAnnounceOpts())\n }\n }\n\n _onSocketData (data) {\n if (this.destroyed) return\n\n this.expectingResponse = false\n\n try {\n data = JSON.parse(data)\n } catch (err) {\n this.client.emit('warning', new Error('Invalid tracker response'))\n return\n }\n\n if (data.action === 'announce') {\n this._onAnnounceResponse(data)\n } else if (data.action === 'scrape') {\n this._onScrapeResponse(data)\n } else {\n this._onSocketError(new Error(`invalid action in WS response: ${data.action}`))\n }\n }\n\n _onAnnounceResponse (data) {\n if (data.info_hash !== this.client._infoHashBinary) {\n debug(\n 'ignoring websocket data from %s for %s (looking for %s: reused socket)',\n this.announceUrl, common.binaryToHex(data.info_hash), this.client.infoHash\n )\n return\n }\n\n if (data.peer_id && data.peer_id === this.client._peerIdBinary) {\n // ignore offers/answers from this client\n return\n }\n\n debug(\n 'received %s from %s for %s',\n JSON.stringify(data), this.announceUrl, this.client.infoHash\n )\n\n const failure = data['failure reason']\n if (failure) return this.client.emit('warning', new Error(failure))\n\n const warning = data['warning message']\n if (warning) this.client.emit('warning', new Error(warning))\n\n const interval = data.interval || data['min interval']\n if (interval) this.setInterval(interval * 1000)\n\n const trackerId = data['tracker id']\n if (trackerId) {\n // If absent, do not discard previous trackerId value\n this._trackerId = trackerId\n }\n\n if (data.complete != null) {\n const response = Object.assign({}, data, {\n announce: this.announceUrl,\n infoHash: common.binaryToHex(data.info_hash)\n })\n this.client.emit('update', response)\n }\n\n let peer\n if (data.offer && data.peer_id) {\n debug('creating peer (from remote offer)')\n peer = this._createPeer()\n peer.id = common.binaryToHex(data.peer_id)\n peer.once('signal', answer => {\n const params = {\n action: 'announce',\n info_hash: this.client._infoHashBinary,\n peer_id: this.client._peerIdBinary,\n to_peer_id: data.peer_id,\n answer,\n offer_id: data.offer_id\n }\n if (this._trackerId) params.trackerid = this._trackerId\n this._send(params)\n })\n this.client.emit('peer', peer)\n peer.signal(data.offer)\n }\n\n if (data.answer && data.peer_id) {\n const offerId = common.binaryToHex(data.offer_id)\n peer = this.peers[offerId]\n if (peer) {\n peer.id = common.binaryToHex(data.peer_id)\n this.client.emit('peer', peer)\n peer.signal(data.answer)\n\n clearTimeout(peer.trackerTimeout)\n peer.trackerTimeout = null\n delete this.peers[offerId]\n } else {\n debug(`got unexpected answer: ${JSON.stringify(data.answer)}`)\n }\n }\n }\n\n _onScrapeResponse (data) {\n data = data.files || {}\n\n const keys = Object.keys(data)\n if (keys.length === 0) {\n this.client.emit('warning', new Error('invalid scrape response'))\n return\n }\n\n keys.forEach(infoHash => {\n // TODO: optionally handle data.flags.min_request_interval\n // (separate from announce interval)\n const response = Object.assign(data[infoHash], {\n announce: this.announceUrl,\n infoHash: common.binaryToHex(infoHash)\n })\n this.client.emit('scrape', response)\n })\n }\n\n _onSocketClose () {\n if (this.destroyed) return\n this.destroy()\n this._startReconnectTimer()\n }\n\n _onSocketError (err) {\n if (this.destroyed) return\n this.destroy()\n // errors will often happen if a tracker is offline, so don't treat it as fatal\n this.client.emit('warning', err)\n this._startReconnectTimer()\n }\n\n _startReconnectTimer () {\n const ms = Math.floor(Math.random() * RECONNECT_VARIANCE) + Math.min(Math.pow(2, this.retries) * RECONNECT_MINIMUM, RECONNECT_MAXIMUM)\n\n this.reconnecting = true\n clearTimeout(this.reconnectTimer)\n this.reconnectTimer = setTimeout(() => {\n this.retries++\n this._openSocket()\n }, ms)\n if (this.reconnectTimer.unref) this.reconnectTimer.unref()\n\n debug('reconnecting socket in %s ms', ms)\n }\n\n _send (params) {\n if (this.destroyed) return\n this.expectingResponse = true\n const message = JSON.stringify(params)\n debug('send %s', message)\n this.socket.send(message)\n }\n\n _generateOffers (numwant, cb) {\n const self = this\n const offers = []\n debug('generating %s offers', numwant)\n\n for (let i = 0; i < numwant; ++i) {\n generateOffer()\n }\n checkDone()\n\n function generateOffer () {\n const offerId = randombytes(20).toString('hex')\n debug('creating peer (from _generateOffers)')\n const peer = self.peers[offerId] = self._createPeer({ initiator: true })\n peer.once('signal', offer => {\n offers.push({\n offer,\n offer_id: common.hexToBinary(offerId)\n })\n checkDone()\n })\n peer.trackerTimeout = setTimeout(() => {\n debug('tracker timeout: destroying peer')\n peer.trackerTimeout = null\n delete self.peers[offerId]\n peer.destroy()\n }, OFFER_TIMEOUT)\n if (peer.trackerTimeout.unref) peer.trackerTimeout.unref()\n }\n\n function checkDone () {\n if (offers.length === numwant) {\n debug('generated %s offers', numwant)\n cb(offers)\n }\n }\n }\n\n _createPeer (opts) {\n const self = this\n\n opts = Object.assign({\n trickle: false,\n config: self.client._rtcConfig,\n wrtc: self.client._wrtc\n }, opts)\n\n const peer = new Peer(opts)\n\n peer.once('error', onError)\n peer.once('connect', onConnect)\n\n return peer\n\n // Handle peer 'error' events that are fired *before* the peer is emitted in\n // a 'peer' event.\n function onError (err) {\n self.client.emit('warning', new Error(`Connection error: ${err.message}`))\n peer.destroy()\n }\n\n // Once the peer is emitted in a 'peer' event, then it's the consumer's\n // responsibility to listen for errors, so the listeners are removed here.\n function onConnect () {\n peer.removeListener('error', onError)\n peer.removeListener('connect', onConnect)\n }\n }\n}\n\nWebSocketTracker.prototype.DEFAULT_ANNOUNCE_INTERVAL = 30 * 1000 // 30 seconds\n// Normally this shouldn't be accessed but is occasionally useful\nWebSocketTracker._socketPool = socketPool\n\nfunction noop () {}\n\nmodule.exports = WebSocketTracker\n","/**\n * Functions/constants needed by both the client and server.\n */\n\nexports.DEFAULT_ANNOUNCE_PEERS = 50\nexports.MAX_ANNOUNCE_PEERS = 82\n\nexports.binaryToHex = str => {\n if (typeof str !== 'string') {\n str = String(str)\n }\n return Buffer.from(str, 'binary').toString('hex')\n}\n\nexports.hexToBinary = str => {\n if (typeof str !== 'string') {\n str = String(str)\n }\n return Buffer.from(str, 'hex').toString('binary')\n}\n\n// HACK: Fix for WHATWG URL object not parsing non-standard URL schemes like\n// 'udp:'. Just replace it with 'http:' since we only need a few properties.\n//\n// Note: Only affects Chrome and Firefox. Works fine in Node.js, Safari, and\n// Edge.\n//\n// Note: UDP trackers aren't used in the normal browser build, but they are\n// used in a Chrome App build (i.e. by Brave Browser).\n//\n// Bug reports:\n// - Chrome: https://bugs.chromium.org/p/chromium/issues/detail?id=734880\n// - Firefox: https://bugzilla.mozilla.org/show_bug.cgi?id=1374505\nexports.parseUrl = str => {\n const url = new URL(str.replace(/^udp:/, 'http:'))\n\n if (str.match(/^udp:/)) {\n Object.defineProperties(url, {\n href: { value: url.href.replace(/^http/, 'udp') },\n protocol: { value: url.protocol.replace(/^http/, 'udp') },\n origin: { value: url.origin.replace(/^http/, 'udp') }\n })\n }\n\n return url\n}\n\nconst config = require('./common-node')\nObject.assign(exports, config)\n","/*! blob-to-buffer. MIT License. Feross Aboukhadijeh */\n/* global Blob, FileReader */\n\nmodule.exports = function blobToBuffer (blob, cb) {\n if (typeof Blob === 'undefined' || !(blob instanceof Blob)) {\n throw new Error('first argument must be a Blob')\n }\n if (typeof cb !== 'function') {\n throw new Error('second argument must be a function')\n }\n\n const reader = new FileReader()\n\n function onLoadEnd (e) {\n reader.removeEventListener('loadend', onLoadEnd, false)\n if (e.error) cb(e.error)\n else cb(null, Buffer.from(reader.result))\n }\n\n reader.addEventListener('loadend', onLoadEnd, false)\n reader.readAsArrayBuffer(blob)\n}\n","const { Transform } = require('readable-stream')\n\nclass Block extends Transform {\n constructor (size, opts = {}) {\n super(opts)\n\n if (typeof size === 'object') {\n opts = size\n size = opts.size\n }\n\n this.size = size || 512\n\n const { nopad, zeroPadding = true } = opts\n\n if (nopad) this._zeroPadding = false\n else this._zeroPadding = !!zeroPadding\n\n this._buffered = []\n this._bufferedBytes = 0\n }\n\n _transform (buf, enc, next) {\n this._bufferedBytes += buf.length\n this._buffered.push(buf)\n\n while (this._bufferedBytes >= this.size) {\n this._bufferedBytes -= this.size\n\n // Assemble the buffers that will compose the final block\n const blockBufs = []\n let blockBufsBytes = 0\n while (blockBufsBytes < this.size) {\n const b = this._buffered.shift()\n\n if (blockBufsBytes + b.length <= this.size) {\n blockBufs.push(b)\n blockBufsBytes += b.length\n } else {\n // If the last buffer is larger than needed for the block, just\n // use the needed part\n const neededSize = this.size - blockBufsBytes\n blockBufs.push(b.slice(0, neededSize))\n blockBufsBytes += neededSize\n this._buffered.unshift(b.slice(neededSize))\n }\n }\n\n // Then concat just those buffers, leaving the rest untouched in _buffered\n this.push(Buffer.concat(blockBufs, this.size))\n }\n next()\n }\n\n _flush () {\n if (this._bufferedBytes && this._zeroPadding) {\n const zeroes = Buffer.alloc(this.size - this._bufferedBytes)\n this._buffered.push(zeroes)\n this.push(Buffer.concat(this._buffered))\n this._buffered = null\n } else if (this._bufferedBytes) {\n this.push(Buffer.concat(this._buffered))\n this._buffered = null\n }\n this.push(null)\n }\n}\n\nmodule.exports = Block\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [number & 0x3ffffff];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this._strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // '0' - '9'\n if (c >= 48 && c <= 57) {\n return c - 48;\n // 'A' - 'F'\n } else if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n } else {\n assert(false, 'Invalid character in ' + string);\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 b = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n b = c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n b = c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n b = c;\n }\n assert(c >= 0 && b < mul, 'Invalid character');\n r += b;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n function move (dest, src) {\n dest.words = src.words;\n dest.length = src.length;\n dest.negative = src.negative;\n dest.red = src.red;\n }\n\n BN.prototype._move = function _move (dest) {\n move(dest, this);\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype._strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n // Check Symbol.for because not everywhere where Symbol defined\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n try {\n BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n } catch (e) {\n BN.prototype.inspect = inspect;\n }\n } else {\n BN.prototype.inspect = inspect;\n }\n\n function inspect () {\n return (this.red ? '';\n }\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modrn(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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16, 2);\n };\n\n if (Buffer) {\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n return this.toArrayLike(Buffer, endian, length);\n };\n }\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n var allocate = function allocate (ArrayType, size) {\n if (ArrayType.allocUnsafe) {\n return ArrayType.allocUnsafe(size);\n }\n return new ArrayType(size);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n this._strip();\n\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\n var res = allocate(ArrayType, reqLength);\n var postfix = endian === 'le' ? 'LE' : 'BE';\n this['_toArrayLike' + postfix](res, byteLength);\n return res;\n };\n\n BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n var position = 0;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position++] = word & 0xff;\n if (position < res.length) {\n res[position++] = (word >> 8) & 0xff;\n }\n if (position < res.length) {\n res[position++] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position < res.length) {\n res[position++] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position < res.length) {\n res[position++] = carry;\n\n while (position < res.length) {\n res[position++] = 0;\n }\n }\n };\n\n BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n var position = res.length - 1;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position--] = word & 0xff;\n if (position >= 0) {\n res[position--] = (word >> 8) & 0xff;\n }\n if (position >= 0) {\n res[position--] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position >= 0) {\n res[position--] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position >= 0) {\n res[position--] = carry;\n\n while (position >= 0) {\n res[position--] = 0;\n }\n }\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] >>> wbit) & 0x01;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this._strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n // var fftm = new FFTM();\n // return fftm.mulp(self, num, out);\n return bigMulTo(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out._strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this._strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q._strip();\n }\n a._strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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.modrn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modrn = function modrn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return isNegNum ? -acc : acc;\n };\n\n // WARNING: DEPRECATED\n BN.prototype.modn = function modn (num) {\n return this.modrn(num);\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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 this._strip();\n return isNegNum ? this.ineg() : this;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this._strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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 a BN v4 instance\n r.strip();\n } else {\n // r is a 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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\n move(a, a.umod(this.m)._forceRed(this));\n return a;\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","var r;\n\nmodule.exports = function rand(len) {\n if (!r)\n r = new Rand(null);\n\n return r.generate(len);\n};\n\nfunction Rand(rand) {\n this.rand = rand;\n}\nmodule.exports.Rand = Rand;\n\nRand.prototype.generate = function generate(len) {\n return this._rand(len);\n};\n\n// Emulate crypto API using randy\nRand.prototype._rand = function _rand(n) {\n if (this.rand.getBytes)\n return this.rand.getBytes(n);\n\n var res = new Uint8Array(n);\n for (var i = 0; i < res.length; i++)\n res[i] = this.rand.getByte();\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 };\n\n // Safari's WebWorkers do not have `crypto`\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 if (typeof crypto.randomBytes !== 'function')\n throw new Error('Not supported');\n\n Rand.prototype._rand = function _rand(n) {\n return crypto.randomBytes(n);\n };\n } catch (e) {\n }\n}\n","// based on the aes implimentation in triple sec\n// https://github.com/keybase/triplesec\n// which is in turn based on the one from crypto-js\n// https://code.google.com/p/crypto-js/\n\nvar Buffer = require('safe-buffer').Buffer\n\nfunction asUInt32Array (buf) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n\n var len = (buf.length / 4) | 0\n var out = new Array(len)\n\n for (var i = 0; i < len; i++) {\n out[i] = buf.readUInt32BE(i * 4)\n }\n\n return out\n}\n\nfunction scrubVec (v) {\n for (var i = 0; i < v.length; v++) {\n v[i] = 0\n }\n}\n\nfunction cryptBlock (M, keySchedule, SUB_MIX, SBOX, nRounds) {\n var SUB_MIX0 = SUB_MIX[0]\n var SUB_MIX1 = SUB_MIX[1]\n var SUB_MIX2 = SUB_MIX[2]\n var SUB_MIX3 = SUB_MIX[3]\n\n var s0 = M[0] ^ keySchedule[0]\n var s1 = M[1] ^ keySchedule[1]\n var s2 = M[2] ^ keySchedule[2]\n var s3 = M[3] ^ keySchedule[3]\n var t0, t1, t2, t3\n var ksRow = 4\n\n for (var round = 1; round < nRounds; round++) {\n t0 = SUB_MIX0[s0 >>> 24] ^ SUB_MIX1[(s1 >>> 16) & 0xff] ^ SUB_MIX2[(s2 >>> 8) & 0xff] ^ SUB_MIX3[s3 & 0xff] ^ keySchedule[ksRow++]\n t1 = SUB_MIX0[s1 >>> 24] ^ SUB_MIX1[(s2 >>> 16) & 0xff] ^ SUB_MIX2[(s3 >>> 8) & 0xff] ^ SUB_MIX3[s0 & 0xff] ^ keySchedule[ksRow++]\n t2 = SUB_MIX0[s2 >>> 24] ^ SUB_MIX1[(s3 >>> 16) & 0xff] ^ SUB_MIX2[(s0 >>> 8) & 0xff] ^ SUB_MIX3[s1 & 0xff] ^ keySchedule[ksRow++]\n t3 = SUB_MIX0[s3 >>> 24] ^ SUB_MIX1[(s0 >>> 16) & 0xff] ^ SUB_MIX2[(s1 >>> 8) & 0xff] ^ SUB_MIX3[s2 & 0xff] ^ keySchedule[ksRow++]\n s0 = t0\n s1 = t1\n s2 = t2\n s3 = t3\n }\n\n t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++]\n t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++]\n t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++]\n t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++]\n t0 = t0 >>> 0\n t1 = t1 >>> 0\n t2 = t2 >>> 0\n t3 = t3 >>> 0\n\n return [t0, t1, t2, t3]\n}\n\n// AES constants\nvar RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36]\nvar G = (function () {\n // Compute double table\n var d = new Array(256)\n for (var j = 0; j < 256; j++) {\n if (j < 128) {\n d[j] = j << 1\n } else {\n d[j] = (j << 1) ^ 0x11b\n }\n }\n\n var SBOX = []\n var INV_SBOX = []\n var SUB_MIX = [[], [], [], []]\n var INV_SUB_MIX = [[], [], [], []]\n\n // Walk GF(2^8)\n var x = 0\n var xi = 0\n for (var i = 0; i < 256; ++i) {\n // Compute sbox\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4)\n sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63\n SBOX[x] = sx\n INV_SBOX[sx] = x\n\n // Compute multiplication\n var x2 = d[x]\n var x4 = d[x2]\n var x8 = d[x4]\n\n // Compute sub bytes, mix columns tables\n var t = (d[sx] * 0x101) ^ (sx * 0x1010100)\n SUB_MIX[0][x] = (t << 24) | (t >>> 8)\n SUB_MIX[1][x] = (t << 16) | (t >>> 16)\n SUB_MIX[2][x] = (t << 8) | (t >>> 24)\n SUB_MIX[3][x] = t\n\n // Compute inv sub bytes, inv mix columns tables\n t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100)\n INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)\n INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)\n INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)\n INV_SUB_MIX[3][sx] = t\n\n if (x === 0) {\n x = xi = 1\n } else {\n x = x2 ^ d[d[d[x8 ^ x2]]]\n xi ^= d[d[xi]]\n }\n }\n\n return {\n SBOX: SBOX,\n INV_SBOX: INV_SBOX,\n SUB_MIX: SUB_MIX,\n INV_SUB_MIX: INV_SUB_MIX\n }\n})()\n\nfunction AES (key) {\n this._key = asUInt32Array(key)\n this._reset()\n}\n\nAES.blockSize = 4 * 4\nAES.keySize = 256 / 8\nAES.prototype.blockSize = AES.blockSize\nAES.prototype.keySize = AES.keySize\nAES.prototype._reset = function () {\n var keyWords = this._key\n var keySize = keyWords.length\n var nRounds = keySize + 6\n var ksRows = (nRounds + 1) * 4\n\n var keySchedule = []\n for (var k = 0; k < keySize; k++) {\n keySchedule[k] = keyWords[k]\n }\n\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1]\n\n if (k % keySize === 0) {\n t = (t << 8) | (t >>> 24)\n t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 0xff] << 16) |\n (G.SBOX[(t >>> 8) & 0xff] << 8) |\n (G.SBOX[t & 0xff])\n\n t ^= RCON[(k / keySize) | 0] << 24\n } else if (keySize > 6 && k % keySize === 4) {\n t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 0xff] << 16) |\n (G.SBOX[(t >>> 8) & 0xff] << 8) |\n (G.SBOX[t & 0xff])\n }\n\n keySchedule[k] = keySchedule[k - keySize] ^ t\n }\n\n var invKeySchedule = []\n for (var ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik\n var tt = keySchedule[ksR - (ik % 4 ? 0 : 4)]\n\n if (ik < 4 || ksR <= 4) {\n invKeySchedule[ik] = tt\n } else {\n invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 0xff]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 0xff]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 0xff]]\n }\n }\n\n this._nRounds = nRounds\n this._keySchedule = keySchedule\n this._invKeySchedule = invKeySchedule\n}\n\nAES.prototype.encryptBlockRaw = function (M) {\n M = asUInt32Array(M)\n return cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds)\n}\n\nAES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M)\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0], 0)\n buf.writeUInt32BE(out[1], 4)\n buf.writeUInt32BE(out[2], 8)\n buf.writeUInt32BE(out[3], 12)\n return buf\n}\n\nAES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M)\n\n // swap\n var m1 = M[1]\n M[1] = M[3]\n M[3] = m1\n\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds)\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0], 0)\n buf.writeUInt32BE(out[3], 4)\n buf.writeUInt32BE(out[2], 8)\n buf.writeUInt32BE(out[1], 12)\n return buf\n}\n\nAES.prototype.scrub = function () {\n scrubVec(this._keySchedule)\n scrubVec(this._invKeySchedule)\n scrubVec(this._key)\n}\n\nmodule.exports.AES = AES\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\nvar GHASH = require('./ghash')\nvar xor = require('buffer-xor')\nvar incr32 = require('./incr32')\n\nfunction xorTest (a, b) {\n var out = 0\n if (a.length !== b.length) out++\n\n var len = Math.min(a.length, b.length)\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 var ghash = new GHASH(ck)\n var len = iv.length\n var toPad = len % 16\n ghash.update(iv)\n if (toPad) {\n toPad = 16 - toPad\n ghash.update(Buffer.alloc(toPad, 0))\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}\nfunction StreamCipher (mode, key, iv, decrypt) {\n Transform.call(this)\n\n var h = Buffer.alloc(4, 0)\n\n this._cipher = new aes.AES(key)\n var ck = this._cipher.encryptBlock(h)\n this._ghash = new GHASH(ck)\n iv = calcIv(this, iv, ck)\n\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\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 if (rump < 16) {\n rump = Buffer.alloc(rump, 0)\n this._ghash.update(rump)\n }\n }\n\n this._called = true\n var out = this._mode.encrypt(this, chunk)\n if (this._decrypt) {\n this._ghash.update(chunk)\n } else {\n this._ghash.update(out)\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\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\n this._authTag = tag\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\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\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 this._alen += buf.length\n}\n\nmodule.exports = StreamCipher\n","var ciphers = require('./encrypter')\nvar deciphers = require('./decrypter')\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\n","var AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar MODES = require('./modes')\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Decipher (mode, key, iv) {\n Transform.call(this)\n\n this._cache = new Splitter()\n this._last = void 0\n this._cipher = new aes.AES(key)\n this._prev = Buffer.from(iv)\n this._mode = mode\n this._autopadding = true\n}\n\ninherits(Decipher, Transform)\n\nDecipher.prototype._update = function (data) {\n this._cache.add(data)\n var chunk\n var thing\n var out = []\n while ((chunk = this._cache.get(this._autopadding))) {\n thing = this._mode.decrypt(this, chunk)\n out.push(thing)\n }\n return Buffer.concat(out)\n}\n\nDecipher.prototype._final = function () {\n var chunk = this._cache.flush()\n if (this._autopadding) {\n return unpad(this._mode.decrypt(this, chunk))\n } else if (chunk) {\n throw new Error('data not multiple of block length')\n }\n}\n\nDecipher.prototype.setAutoPadding = function (setTo) {\n this._autopadding = !!setTo\n return this\n}\n\nfunction Splitter () {\n this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function (autoPadding) {\n var out\n if (autoPadding) {\n if (this.cache.length > 16) {\n out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n } else {\n if (this.cache.length >= 16) {\n out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n }\n\n return null\n}\n\nSplitter.prototype.flush = function () {\n if (this.cache.length) return this.cache\n}\n\nfunction unpad (last) {\n var padded = last[15]\n if (padded < 1 || padded > 16) {\n throw new Error('unable to decrypt data')\n }\n var i = -1\n while (++i < padded) {\n if (last[(i + (16 - padded))] !== padded) {\n throw new Error('unable to decrypt data')\n }\n }\n if (padded === 16) return\n\n return last.slice(0, 16 - padded)\n}\n\nfunction createDecipheriv (suite, password, iv) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n if (typeof iv === 'string') iv = Buffer.from(iv)\n if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n if (typeof password === 'string') password = Buffer.from(password)\n if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n if (config.type === 'stream') {\n return new StreamCipher(config.module, password, iv, true)\n } else if (config.type === 'auth') {\n return new AuthCipher(config.module, password, iv, true)\n }\n\n return new Decipher(config.module, password, iv)\n}\n\nfunction createDecipher (suite, password) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n var keys = ebtk(password, false, config.key, config.iv)\n return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createDecipher = createDecipher\nexports.createDecipheriv = createDecipheriv\n","var MODES = require('./modes')\nvar AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Cipher (mode, key, iv) {\n Transform.call(this)\n\n this._cache = new Splitter()\n this._cipher = new aes.AES(key)\n this._prev = Buffer.from(iv)\n this._mode = mode\n this._autopadding = true\n}\n\ninherits(Cipher, Transform)\n\nCipher.prototype._update = function (data) {\n this._cache.add(data)\n var chunk\n var thing\n var out = []\n\n while ((chunk = this._cache.get())) {\n thing = this._mode.encrypt(this, chunk)\n out.push(thing)\n }\n\n return Buffer.concat(out)\n}\n\nvar PADDING = Buffer.alloc(16, 0x10)\n\nCipher.prototype._final = function () {\n var chunk = this._cache.flush()\n if (this._autopadding) {\n chunk = this._mode.encrypt(this, chunk)\n this._cipher.scrub()\n return chunk\n }\n\n if (!chunk.equals(PADDING)) {\n this._cipher.scrub()\n throw new Error('data not multiple of block length')\n }\n}\n\nCipher.prototype.setAutoPadding = function (setTo) {\n this._autopadding = !!setTo\n return this\n}\n\nfunction Splitter () {\n this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n return null\n}\n\nSplitter.prototype.flush = function () {\n var len = 16 - this.cache.length\n var padBuff = Buffer.allocUnsafe(len)\n\n var i = -1\n while (++i < len) {\n padBuff.writeUInt8(len, i)\n }\n\n return Buffer.concat([this.cache, padBuff])\n}\n\nfunction createCipheriv (suite, password, iv) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n if (typeof password === 'string') password = Buffer.from(password)\n if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n if (typeof iv === 'string') iv = Buffer.from(iv)\n if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n if (config.type === 'stream') {\n return new StreamCipher(config.module, password, iv)\n } else if (config.type === 'auth') {\n return new AuthCipher(config.module, password, iv)\n }\n\n return new Cipher(config.module, password, iv)\n}\n\nfunction createCipher (suite, password) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n var keys = ebtk(password, false, config.key, config.iv)\n return createCipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createCipheriv = createCipheriv\nexports.createCipher = createCipher\n","var Buffer = require('safe-buffer').Buffer\nvar ZEROES = Buffer.alloc(16, 0)\n\nfunction toArray (buf) {\n return [\n buf.readUInt32BE(0),\n buf.readUInt32BE(4),\n buf.readUInt32BE(8),\n buf.readUInt32BE(12)\n ]\n}\n\nfunction fromArray (out) {\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0] >>> 0, 0)\n buf.writeUInt32BE(out[1] >>> 0, 4)\n buf.writeUInt32BE(out[2] >>> 0, 8)\n buf.writeUInt32BE(out[3] >>> 0, 12)\n return buf\n}\n\nfunction GHASH (key) {\n this.h = key\n this.state = Buffer.alloc(16, 0)\n this.cache = Buffer.allocUnsafe(0)\n}\n\n// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html\n// by Juho Vähä-Herttua\nGHASH.prototype.ghash = function (block) {\n var i = -1\n while (++i < block.length) {\n this.state[i] ^= block[i]\n }\n this._multiply()\n}\n\nGHASH.prototype._multiply = function () {\n var Vi = toArray(this.h)\n var Zi = [0, 0, 0, 0]\n var j, xi, lsbVi\n var i = -1\n while (++i < 128) {\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0\n if (xi) {\n // Z_i+1 = Z_i ^ V_i\n Zi[0] ^= Vi[0]\n Zi[1] ^= Vi[1]\n Zi[2] ^= Vi[2]\n Zi[3] ^= Vi[3]\n }\n\n // Store the value of LSB(V_i)\n lsbVi = (Vi[3] & 1) !== 0\n\n // V_i+1 = V_i >> 1\n for (j = 3; j > 0; j--) {\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31)\n }\n Vi[0] = Vi[0] >>> 1\n\n // If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R\n if (lsbVi) {\n Vi[0] = Vi[0] ^ (0xe1 << 24)\n }\n }\n this.state = fromArray(Zi)\n}\n\nGHASH.prototype.update = function (buf) {\n this.cache = Buffer.concat([this.cache, buf])\n var chunk\n while (this.cache.length >= 16) {\n chunk = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n this.ghash(chunk)\n }\n}\n\nGHASH.prototype.final = function (abl, bl) {\n if (this.cache.length) {\n this.ghash(Buffer.concat([this.cache, ZEROES], 16))\n }\n\n this.ghash(fromArray([0, abl, 0, bl]))\n return this.state\n}\n\nmodule.exports = GHASH\n","function incr32 (iv) {\n var len = iv.length\n var item\n while (len--) {\n item = iv.readUInt8(len)\n if (item === 255) {\n iv.writeUInt8(0, len)\n } else {\n item++\n iv.writeUInt8(item, len)\n break\n }\n }\n}\nmodule.exports = incr32\n","var xor = require('buffer-xor')\n\nexports.encrypt = function (self, block) {\n var data = xor(block, self._prev)\n\n self._prev = self._cipher.encryptBlock(data)\n return self._prev\n}\n\nexports.decrypt = function (self, block) {\n var pad = self._prev\n\n self._prev = block\n var out = self._cipher.decryptBlock(block)\n\n return xor(out, pad)\n}\n","var Buffer = require('safe-buffer').Buffer\nvar xor = require('buffer-xor')\n\nfunction encryptStart (self, data, decrypt) {\n var len = data.length\n var out = xor(data, self._cache)\n self._cache = self._cache.slice(len)\n self._prev = Buffer.concat([self._prev, decrypt ? data : out])\n return out\n}\n\nexports.encrypt = function (self, data, decrypt) {\n var out = Buffer.allocUnsafe(0)\n var len\n\n while (data.length) {\n if (self._cache.length === 0) {\n self._cache = self._cipher.encryptBlock(self._prev)\n self._prev = Buffer.allocUnsafe(0)\n }\n\n if (self._cache.length <= data.length) {\n len = self._cache.length\n out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)])\n data = data.slice(len)\n } else {\n out = Buffer.concat([out, encryptStart(self, data, decrypt)])\n break\n }\n }\n\n return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n var pad\n var i = -1\n var len = 8\n var out = 0\n var bit, value\n while (++i < len) {\n pad = self._cipher.encryptBlock(self._prev)\n bit = (byteParam & (1 << (7 - i))) ? 0x80 : 0\n value = pad[0] ^ bit\n out += ((value & 0x80) >> (i % 8))\n self._prev = shiftIn(self._prev, decrypt ? bit : value)\n }\n return out\n}\n\nfunction shiftIn (buffer, value) {\n var len = buffer.length\n var i = -1\n var out = Buffer.allocUnsafe(buffer.length)\n buffer = Buffer.concat([buffer, Buffer.from([value])])\n\n while (++i < len) {\n out[i] = buffer[i] << 1 | buffer[i + 1] >> (7)\n }\n\n return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n var len = chunk.length\n var out = Buffer.allocUnsafe(len)\n var i = -1\n\n while (++i < len) {\n out[i] = encryptByte(self, chunk[i], decrypt)\n }\n\n return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n var pad = self._cipher.encryptBlock(self._prev)\n var out = pad[0] ^ byteParam\n\n self._prev = Buffer.concat([\n self._prev.slice(1),\n Buffer.from([decrypt ? byteParam : out])\n ])\n\n return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n var len = chunk.length\n var out = Buffer.allocUnsafe(len)\n var i = -1\n\n while (++i < len) {\n out[i] = encryptByte(self, chunk[i], decrypt)\n }\n\n return out\n}\n","var xor = require('buffer-xor')\nvar Buffer = require('safe-buffer').Buffer\nvar incr32 = require('../incr32')\n\nfunction getBlock (self) {\n var out = self._cipher.encryptBlockRaw(self._prev)\n incr32(self._prev)\n return out\n}\n\nvar blockSize = 16\nexports.encrypt = function (self, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize)\n var start = self._cache.length\n self._cache = Buffer.concat([\n self._cache,\n 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 self._cache.writeUInt32BE(out[0], offset + 0)\n self._cache.writeUInt32BE(out[1], offset + 4)\n self._cache.writeUInt32BE(out[2], offset + 8)\n self._cache.writeUInt32BE(out[3], offset + 12)\n }\n var pad = self._cache.slice(0, chunk.length)\n self._cache = self._cache.slice(chunk.length)\n return xor(chunk, pad)\n}\n","exports.encrypt = function (self, block) {\n return self._cipher.encryptBlock(block)\n}\n\nexports.decrypt = function (self, block) {\n return self._cipher.decryptBlock(block)\n}\n","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\n","var xor = require('buffer-xor')\n\nfunction getBlock (self) {\n self._prev = self._cipher.encryptBlock(self._prev)\n return self._prev\n}\n\nexports.encrypt = function (self, chunk) {\n while (self._cache.length < chunk.length) {\n self._cache = Buffer.concat([self._cache, getBlock(self)])\n }\n\n var pad = self._cache.slice(0, chunk.length)\n self._cache = self._cache.slice(chunk.length)\n return xor(chunk, pad)\n}\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\n\nfunction StreamCipher (mode, key, iv, decrypt) {\n Transform.call(this)\n\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\n","var DES = require('browserify-des')\nvar aes = require('browserify-aes/browser')\nvar aesModes = require('browserify-aes/modes')\nvar desModes = require('browserify-des/modes')\nvar ebtk = require('evp_bytestokey')\n\nfunction createCipher (suite, password) {\n suite = suite.toLowerCase()\n\n var keyLen, ivLen\n if (aesModes[suite]) {\n keyLen = aesModes[suite].key\n ivLen = aesModes[suite].iv\n } else if (desModes[suite]) {\n keyLen = desModes[suite].key * 8\n ivLen = desModes[suite].iv\n } else {\n throw new TypeError('invalid suite type')\n }\n\n var keys = ebtk(password, false, keyLen, ivLen)\n return createCipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createDecipher (suite, password) {\n suite = suite.toLowerCase()\n\n var keyLen, ivLen\n if (aesModes[suite]) {\n keyLen = aesModes[suite].key\n ivLen = aesModes[suite].iv\n } else if (desModes[suite]) {\n keyLen = desModes[suite].key * 8\n ivLen = desModes[suite].iv\n } else {\n throw new TypeError('invalid suite type')\n }\n\n var keys = ebtk(password, false, keyLen, ivLen)\n return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createCipheriv (suite, key, iv) {\n suite = suite.toLowerCase()\n if (aesModes[suite]) return aes.createCipheriv(suite, key, iv)\n if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite })\n\n throw new TypeError('invalid suite type')\n}\n\nfunction createDecipheriv (suite, key, iv) {\n suite = suite.toLowerCase()\n if (aesModes[suite]) return aes.createDecipheriv(suite, key, iv)\n if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite, decrypt: true })\n\n throw new TypeError('invalid suite type')\n}\n\nfunction getCiphers () {\n return Object.keys(desModes).concat(aes.getCiphers())\n}\n\nexports.createCipher = exports.Cipher = createCipher\nexports.createCipheriv = exports.Cipheriv = createCipheriv\nexports.createDecipher = exports.Decipher = createDecipher\nexports.createDecipheriv = exports.Decipheriv = createDecipheriv\nexports.listCiphers = exports.getCiphers = getCiphers\n","var CipherBase = require('cipher-base')\nvar des = require('des.js')\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar modes = {\n 'des-ede3-cbc': des.CBC.instantiate(des.EDE),\n 'des-ede3': des.EDE,\n 'des-ede-cbc': des.CBC.instantiate(des.EDE),\n 'des-ede': des.EDE,\n 'des-cbc': des.CBC.instantiate(des.DES),\n 'des-ecb': des.DES\n}\nmodes.des = modes['des-cbc']\nmodes.des3 = modes['des-ede3-cbc']\nmodule.exports = DES\ninherits(DES, CipherBase)\nfunction DES (opts) {\n CipherBase.call(this)\n var modeName = opts.mode.toLowerCase()\n var mode = modes[modeName]\n var type\n if (opts.decrypt) {\n type = 'decrypt'\n } else {\n type = 'encrypt'\n }\n var key = opts.key\n if (!Buffer.isBuffer(key)) {\n key = Buffer.from(key)\n }\n if (modeName === 'des-ede' || modeName === 'des-ede-cbc') {\n key = Buffer.concat([key, key.slice(0, 8)])\n }\n var iv = opts.iv\n if (!Buffer.isBuffer(iv)) {\n iv = Buffer.from(iv)\n }\n this._des = mode.create({\n key: key,\n iv: iv,\n type: type\n })\n}\nDES.prototype._update = function (data) {\n return Buffer.from(this._des.update(data))\n}\nDES.prototype._final = function () {\n return Buffer.from(this._des.final())\n}\n","exports['des-ecb'] = {\n key: 8,\n iv: 0\n}\nexports['des-cbc'] = exports.des = {\n key: 8,\n iv: 8\n}\nexports['des-ede3-cbc'] = exports.des3 = {\n key: 24,\n iv: 8\n}\nexports['des-ede3'] = {\n key: 24,\n iv: 0\n}\nexports['des-ede-cbc'] = {\n key: 16,\n iv: 8\n}\nexports['des-ede'] = {\n key: 16,\n iv: 0\n}\n","var BN = require('bn.js')\nvar randomBytes = require('randombytes')\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 { blinder: blinder, unblinder: r.invm(priv.modulus) }\n}\n\nfunction getr (priv) {\n var len = priv.modulus.byteLength()\n var r\n do {\n r = new BN(randomBytes(len))\n } while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2))\n return r\n}\n\nfunction crt (msg, priv) {\n var blinds = blind(priv)\n var len = priv.modulus.byteLength()\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).fromRed()\n var m2 = c2.redPow(priv.exponent2).fromRed()\n var h = m1.isub(m2).imul(qinv).umod(p).imul(q)\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, 'be', len)\n}\ncrt.getr = getr\n\nmodule.exports = crt\n","module.exports = require('./browser/algorithms.json')\n","var Buffer = require('safe-buffer').Buffer\nvar createHash = require('create-hash')\nvar stream = require('readable-stream')\nvar inherits = require('inherits')\nvar sign = require('./sign')\nvar verify = require('./verify')\n\nvar algorithms = require('./algorithms.json')\nObject.keys(algorithms).forEach(function (key) {\n algorithms[key].id = Buffer.from(algorithms[key].id, 'hex')\n algorithms[key.toLowerCase()] = algorithms[key]\n})\n\nfunction Sign (algorithm) {\n stream.Writable.call(this)\n\n var data = algorithms[algorithm]\n if (!data) throw new Error('Unknown message digest')\n\n this._hashType = data.hash\n this._hash = createHash(data.hash)\n this._tag = data.id\n this._signType = data.sign\n}\ninherits(Sign, stream.Writable)\n\nSign.prototype._write = function _write (data, _, done) {\n this._hash.update(data)\n done()\n}\n\nSign.prototype.update = function update (data, enc) {\n if (typeof data === 'string') data = Buffer.from(data, enc)\n\n this._hash.update(data)\n return this\n}\n\nSign.prototype.sign = function signMethod (key, enc) {\n this.end()\n var hash = this._hash.digest()\n var sig = sign(hash, key, this._hashType, this._signType, this._tag)\n\n return enc ? sig.toString(enc) : sig\n}\n\nfunction Verify (algorithm) {\n stream.Writable.call(this)\n\n var data = algorithms[algorithm]\n if (!data) throw new Error('Unknown message digest')\n\n this._hash = createHash(data.hash)\n this._tag = data.id\n this._signType = data.sign\n}\ninherits(Verify, stream.Writable)\n\nVerify.prototype._write = function _write (data, _, done) {\n this._hash.update(data)\n done()\n}\n\nVerify.prototype.update = function update (data, enc) {\n if (typeof data === 'string') data = Buffer.from(data, enc)\n\n this._hash.update(data)\n return this\n}\n\nVerify.prototype.verify = function verifyMethod (key, sig, enc) {\n if (typeof sig === 'string') sig = Buffer.from(sig, enc)\n\n this.end()\n var hash = this._hash.digest()\n return verify(sig, hash, key, this._signType, this._tag)\n}\n\nfunction createSign (algorithm) {\n return new Sign(algorithm)\n}\n\nfunction createVerify (algorithm) {\n return new Verify(algorithm)\n}\n\nmodule.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign: createSign,\n createVerify: createVerify\n}\n","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer\nvar createHmac = require('create-hmac')\nvar crt = require('browserify-rsa')\nvar EC = require('elliptic').ec\nvar BN = require('bn.js')\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction sign (hash, key, hashType, signType, tag) {\n var priv = parseKeys(key)\n if (priv.curve) {\n // rsa keys can be interpreted as ecdsa ones in openssl\n if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n return ecSign(hash, priv)\n } else if (priv.type === 'dsa') {\n if (signType !== 'dsa') throw new Error('wrong private key type')\n return dsaSign(hash, priv, hashType)\n } else {\n if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n }\n hash = Buffer.concat([tag, hash])\n var len = priv.modulus.byteLength()\n var pad = [0, 1]\n while (hash.length + pad.length + 1 < len) pad.push(0xff)\n pad.push(0x00)\n var i = -1\n while (++i < hash.length) pad.push(hash[i])\n\n var out = crt(pad, priv)\n return out\n}\n\nfunction ecSign (hash, priv) {\n var curveId = curves[priv.curve.join('.')]\n if (!curveId) throw new Error('unknown curve ' + priv.curve.join('.'))\n\n var curve = new EC(curveId)\n var key = curve.keyFromPrivate(priv.privateKey)\n var out = key.sign(hash)\n\n return Buffer.from(out.toDER())\n}\n\nfunction dsaSign (hash, priv, algo) {\n var x = priv.params.priv_key\n var p = priv.params.p\n var q = priv.params.q\n var g = priv.params.g\n var r = new BN(0)\n var k\n var H = bits2int(hash, q).mod(q)\n var s = false\n var kv = getKey(x, q, hash, algo)\n while (s === false) {\n k = makeKey(q, kv, algo)\n r = makeR(g, k, p, q)\n s = k.invm(q).imul(H.add(x.mul(r))).mod(q)\n if (s.cmpn(0) === 0) {\n s = false\n r = new BN(0)\n }\n }\n return toDER(r, s)\n}\n\nfunction toDER (r, s) {\n r = r.toArray()\n s = s.toArray()\n\n // Pad values\n if (r[0] & 0x80) r = [0].concat(r)\n if (s[0] & 0x80) s = [0].concat(s)\n\n var total = r.length + s.length + 4\n var res = [0x30, total, 0x02, r.length]\n res = res.concat(r, [0x02, s.length], s)\n return Buffer.from(res)\n}\n\nfunction getKey (x, q, hash, algo) {\n x = Buffer.from(x.toArray())\n if (x.length < q.byteLength()) {\n var zeros = Buffer.alloc(q.byteLength() - x.length)\n x = Buffer.concat([zeros, x])\n }\n var hlen = hash.length\n var hbits = bits2octets(hash, q)\n var v = Buffer.alloc(hlen)\n v.fill(1)\n var k = Buffer.alloc(hlen)\n k = createHmac(algo, k).update(v).update(Buffer.from([0])).update(x).update(hbits).digest()\n v = createHmac(algo, k).update(v).digest()\n k = createHmac(algo, k).update(v).update(Buffer.from([1])).update(x).update(hbits).digest()\n v = createHmac(algo, k).update(v).digest()\n return { k: k, v: v }\n}\n\nfunction bits2int (obits, q) {\n var bits = new BN(obits)\n var shift = (obits.length << 3) - q.bitLength()\n if (shift > 0) bits.ishrn(shift)\n return bits\n}\n\nfunction bits2octets (bits, q) {\n bits = bits2int(bits, q)\n bits = bits.mod(q)\n var out = Buffer.from(bits.toArray())\n if (out.length < q.byteLength()) {\n var zeros = Buffer.alloc(q.byteLength() - out.length)\n out = Buffer.concat([zeros, out])\n }\n return out\n}\n\nfunction makeKey (q, kv, algo) {\n var t\n var k\n\n do {\n t = Buffer.alloc(0)\n\n while (t.length * 8 < q.bitLength()) {\n kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n t = Buffer.concat([t, kv.v])\n }\n\n k = bits2int(t, q)\n kv.k = createHmac(algo, kv.k).update(kv.v).update(Buffer.from([0])).digest()\n kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n } while (k.cmp(q) !== -1)\n\n return k\n}\n\nfunction makeR (g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q)\n}\n\nmodule.exports = sign\nmodule.exports.getKey = getKey\nmodule.exports.makeKey = makeKey\n","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer\nvar BN = require('bn.js')\nvar EC = require('elliptic').ec\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction verify (sig, hash, key, signType, tag) {\n var pub = parseKeys(key)\n if (pub.type === 'ec') {\n // rsa keys can be interpreted as ecdsa ones in openssl\n if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n return ecVerify(sig, hash, pub)\n } else if (pub.type === 'dsa') {\n if (signType !== 'dsa') throw new Error('wrong public key type')\n return dsaVerify(sig, hash, pub)\n } else {\n if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n }\n hash = Buffer.concat([tag, hash])\n var len = pub.modulus.byteLength()\n var pad = [1]\n var padNum = 0\n while (hash.length + pad.length + 2 < len) {\n pad.push(0xff)\n padNum++\n }\n pad.push(0x00)\n var i = -1\n while (++i < hash.length) {\n pad.push(hash[i])\n }\n pad = Buffer.from(pad)\n var red = BN.mont(pub.modulus)\n sig = new BN(sig).toRed(red)\n\n sig = sig.redPow(new BN(pub.publicExponent))\n sig = Buffer.from(sig.fromRed().toArray())\n var out = padNum < 8 ? 1 : 0\n len = Math.min(sig.length, pad.length)\n if (sig.length !== pad.length) out = 1\n\n i = -1\n while (++i < len) out |= sig[i] ^ pad[i]\n return out === 0\n}\n\nfunction ecVerify (sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join('.')]\n if (!curveId) throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.'))\n\n var curve = new EC(curveId)\n var pubkey = pub.data.subjectPrivateKey.data\n\n return curve.verify(hash, sig, pubkey)\n}\n\nfunction dsaVerify (sig, hash, pub) {\n var p = pub.data.p\n var q = pub.data.q\n var g = pub.data.g\n var y = pub.data.pub_key\n var unpacked = parseKeys.signature.decode(sig, 'der')\n var s = unpacked.s\n var r = unpacked.r\n checkValue(s, q)\n checkValue(r, q)\n var montp = BN.mont(p)\n var w = s.invm(q)\n var v = g.toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q)\n return v.cmp(r) === 0\n}\n\nfunction checkValue (b, q) {\n if (b.cmpn(0) <= 0) throw new Error('invalid sig')\n if (b.cmp(q) >= q) throw new Error('invalid sig')\n}\n\nmodule.exports = verify\n","'use strict';\n/* eslint camelcase: \"off\" */\n\nvar assert = require('assert');\n\nvar Zstream = require('pako/lib/zlib/zstream');\nvar zlib_deflate = require('pako/lib/zlib/deflate.js');\nvar zlib_inflate = require('pako/lib/zlib/inflate.js');\nvar constants = require('pako/lib/zlib/constants');\n\nfor (var key in constants) {\n exports[key] = constants[key];\n}\n\n// zlib modes\nexports.NONE = 0;\nexports.DEFLATE = 1;\nexports.INFLATE = 2;\nexports.GZIP = 3;\nexports.GUNZIP = 4;\nexports.DEFLATERAW = 5;\nexports.INFLATERAW = 6;\nexports.UNZIP = 7;\n\nvar GZIP_HEADER_ID1 = 0x1f;\nvar GZIP_HEADER_ID2 = 0x8b;\n\n/**\n * Emulate Node's zlib C++ layer for use by the JS layer in index.js\n */\nfunction Zlib(mode) {\n if (typeof mode !== 'number' || mode < exports.DEFLATE || mode > exports.UNZIP) {\n throw new TypeError('Bad argument');\n }\n\n this.dictionary = null;\n this.err = 0;\n this.flush = 0;\n this.init_done = false;\n this.level = 0;\n this.memLevel = 0;\n this.mode = mode;\n this.strategy = 0;\n this.windowBits = 0;\n this.write_in_progress = false;\n this.pending_close = false;\n this.gzip_id_bytes_read = 0;\n}\n\nZlib.prototype.close = function () {\n if (this.write_in_progress) {\n this.pending_close = true;\n return;\n }\n\n this.pending_close = false;\n\n assert(this.init_done, 'close before init');\n assert(this.mode <= exports.UNZIP);\n\n if (this.mode === exports.DEFLATE || this.mode === exports.GZIP || this.mode === exports.DEFLATERAW) {\n zlib_deflate.deflateEnd(this.strm);\n } else if (this.mode === exports.INFLATE || this.mode === exports.GUNZIP || this.mode === exports.INFLATERAW || this.mode === exports.UNZIP) {\n zlib_inflate.inflateEnd(this.strm);\n }\n\n this.mode = exports.NONE;\n\n this.dictionary = null;\n};\n\nZlib.prototype.write = function (flush, input, in_off, in_len, out, out_off, out_len) {\n return this._write(true, flush, input, in_off, in_len, out, out_off, out_len);\n};\n\nZlib.prototype.writeSync = function (flush, input, in_off, in_len, out, out_off, out_len) {\n return this._write(false, flush, input, in_off, in_len, out, out_off, out_len);\n};\n\nZlib.prototype._write = function (async, flush, input, in_off, in_len, out, out_off, out_len) {\n assert.equal(arguments.length, 8);\n\n assert(this.init_done, 'write before init');\n assert(this.mode !== exports.NONE, 'already finalized');\n assert.equal(false, this.write_in_progress, 'write already in progress');\n assert.equal(false, this.pending_close, 'close is pending');\n\n this.write_in_progress = true;\n\n assert.equal(false, flush === undefined, 'must provide flush value');\n\n this.write_in_progress = true;\n\n if (flush !== exports.Z_NO_FLUSH && flush !== exports.Z_PARTIAL_FLUSH && flush !== exports.Z_SYNC_FLUSH && flush !== exports.Z_FULL_FLUSH && flush !== exports.Z_FINISH && flush !== exports.Z_BLOCK) {\n throw new Error('Invalid flush value');\n }\n\n if (input == null) {\n input = Buffer.alloc(0);\n in_len = 0;\n in_off = 0;\n }\n\n this.strm.avail_in = in_len;\n this.strm.input = input;\n this.strm.next_in = in_off;\n this.strm.avail_out = out_len;\n this.strm.output = out;\n this.strm.next_out = out_off;\n this.flush = flush;\n\n if (!async) {\n // sync version\n this._process();\n\n if (this._checkError()) {\n return this._afterSync();\n }\n return;\n }\n\n // async version\n var self = this;\n process.nextTick(function () {\n self._process();\n self._after();\n });\n\n return this;\n};\n\nZlib.prototype._afterSync = function () {\n var avail_out = this.strm.avail_out;\n var avail_in = this.strm.avail_in;\n\n this.write_in_progress = false;\n\n return [avail_in, avail_out];\n};\n\nZlib.prototype._process = function () {\n var next_expected_header_byte = null;\n\n // If the avail_out is left at 0, then it means that it ran out\n // of room. If there was avail_out left over, then it means\n // that all of the input was consumed.\n switch (this.mode) {\n case exports.DEFLATE:\n case exports.GZIP:\n case exports.DEFLATERAW:\n this.err = zlib_deflate.deflate(this.strm, this.flush);\n break;\n case exports.UNZIP:\n if (this.strm.avail_in > 0) {\n next_expected_header_byte = this.strm.next_in;\n }\n\n switch (this.gzip_id_bytes_read) {\n case 0:\n if (next_expected_header_byte === null) {\n break;\n }\n\n if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID1) {\n this.gzip_id_bytes_read = 1;\n next_expected_header_byte++;\n\n if (this.strm.avail_in === 1) {\n // The only available byte was already read.\n break;\n }\n } else {\n this.mode = exports.INFLATE;\n break;\n }\n\n // fallthrough\n case 1:\n if (next_expected_header_byte === null) {\n break;\n }\n\n if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID2) {\n this.gzip_id_bytes_read = 2;\n this.mode = exports.GUNZIP;\n } else {\n // There is no actual difference between INFLATE and INFLATERAW\n // (after initialization).\n this.mode = exports.INFLATE;\n }\n\n break;\n default:\n throw new Error('invalid number of gzip magic number bytes read');\n }\n\n // fallthrough\n case exports.INFLATE:\n case exports.GUNZIP:\n case exports.INFLATERAW:\n this.err = zlib_inflate.inflate(this.strm, this.flush\n\n // If data was encoded with dictionary\n );if (this.err === exports.Z_NEED_DICT && this.dictionary) {\n // Load it\n this.err = zlib_inflate.inflateSetDictionary(this.strm, this.dictionary);\n if (this.err === exports.Z_OK) {\n // And try to decode again\n this.err = zlib_inflate.inflate(this.strm, this.flush);\n } else if (this.err === exports.Z_DATA_ERROR) {\n // Both inflateSetDictionary() and inflate() return Z_DATA_ERROR.\n // Make it possible for After() to tell a bad dictionary from bad\n // input.\n this.err = exports.Z_NEED_DICT;\n }\n }\n while (this.strm.avail_in > 0 && this.mode === exports.GUNZIP && this.err === exports.Z_STREAM_END && this.strm.next_in[0] !== 0x00) {\n // Bytes remain in input buffer. Perhaps this is another compressed\n // member in the same archive, or just trailing garbage.\n // Trailing zero bytes are okay, though, since they are frequently\n // used for padding.\n\n this.reset();\n this.err = zlib_inflate.inflate(this.strm, this.flush);\n }\n break;\n default:\n throw new Error('Unknown mode ' + this.mode);\n }\n};\n\nZlib.prototype._checkError = function () {\n // Acceptable error states depend on the type of zlib stream.\n switch (this.err) {\n case exports.Z_OK:\n case exports.Z_BUF_ERROR:\n if (this.strm.avail_out !== 0 && this.flush === exports.Z_FINISH) {\n this._error('unexpected end of file');\n return false;\n }\n break;\n case exports.Z_STREAM_END:\n // normal statuses, not fatal\n break;\n case exports.Z_NEED_DICT:\n if (this.dictionary == null) {\n this._error('Missing dictionary');\n } else {\n this._error('Bad dictionary');\n }\n return false;\n default:\n // something else.\n this._error('Zlib error');\n return false;\n }\n\n return true;\n};\n\nZlib.prototype._after = function () {\n if (!this._checkError()) {\n return;\n }\n\n var avail_out = this.strm.avail_out;\n var avail_in = this.strm.avail_in;\n\n this.write_in_progress = false;\n\n // call the write() cb\n this.callback(avail_in, avail_out);\n\n if (this.pending_close) {\n this.close();\n }\n};\n\nZlib.prototype._error = function (message) {\n if (this.strm.msg) {\n message = this.strm.msg;\n }\n this.onerror(message, this.err\n\n // no hope of rescue.\n );this.write_in_progress = false;\n if (this.pending_close) {\n this.close();\n }\n};\n\nZlib.prototype.init = function (windowBits, level, memLevel, strategy, dictionary) {\n assert(arguments.length === 4 || arguments.length === 5, 'init(windowBits, level, memLevel, strategy, [dictionary])');\n\n assert(windowBits >= 8 && windowBits <= 15, 'invalid windowBits');\n assert(level >= -1 && level <= 9, 'invalid compression level');\n\n assert(memLevel >= 1 && memLevel <= 9, 'invalid memlevel');\n\n assert(strategy === exports.Z_FILTERED || strategy === exports.Z_HUFFMAN_ONLY || strategy === exports.Z_RLE || strategy === exports.Z_FIXED || strategy === exports.Z_DEFAULT_STRATEGY, 'invalid strategy');\n\n this._init(level, windowBits, memLevel, strategy, dictionary);\n this._setDictionary();\n};\n\nZlib.prototype.params = function () {\n throw new Error('deflateParams Not supported');\n};\n\nZlib.prototype.reset = function () {\n this._reset();\n this._setDictionary();\n};\n\nZlib.prototype._init = function (level, windowBits, memLevel, strategy, dictionary) {\n this.level = level;\n this.windowBits = windowBits;\n this.memLevel = memLevel;\n this.strategy = strategy;\n\n this.flush = exports.Z_NO_FLUSH;\n\n this.err = exports.Z_OK;\n\n if (this.mode === exports.GZIP || this.mode === exports.GUNZIP) {\n this.windowBits += 16;\n }\n\n if (this.mode === exports.UNZIP) {\n this.windowBits += 32;\n }\n\n if (this.mode === exports.DEFLATERAW || this.mode === exports.INFLATERAW) {\n this.windowBits = -1 * this.windowBits;\n }\n\n this.strm = new Zstream();\n\n switch (this.mode) {\n case exports.DEFLATE:\n case exports.GZIP:\n case exports.DEFLATERAW:\n this.err = zlib_deflate.deflateInit2(this.strm, this.level, exports.Z_DEFLATED, this.windowBits, this.memLevel, this.strategy);\n break;\n case exports.INFLATE:\n case exports.GUNZIP:\n case exports.INFLATERAW:\n case exports.UNZIP:\n this.err = zlib_inflate.inflateInit2(this.strm, this.windowBits);\n break;\n default:\n throw new Error('Unknown mode ' + this.mode);\n }\n\n if (this.err !== exports.Z_OK) {\n this._error('Init error');\n }\n\n this.dictionary = dictionary;\n\n this.write_in_progress = false;\n this.init_done = true;\n};\n\nZlib.prototype._setDictionary = function () {\n if (this.dictionary == null) {\n return;\n }\n\n this.err = exports.Z_OK;\n\n switch (this.mode) {\n case exports.DEFLATE:\n case exports.DEFLATERAW:\n this.err = zlib_deflate.deflateSetDictionary(this.strm, this.dictionary);\n break;\n default:\n break;\n }\n\n if (this.err !== exports.Z_OK) {\n this._error('Failed to set dictionary');\n }\n};\n\nZlib.prototype._reset = function () {\n this.err = exports.Z_OK;\n\n switch (this.mode) {\n case exports.DEFLATE:\n case exports.DEFLATERAW:\n case exports.GZIP:\n this.err = zlib_deflate.deflateReset(this.strm);\n break;\n case exports.INFLATE:\n case exports.INFLATERAW:\n case exports.GUNZIP:\n this.err = zlib_inflate.inflateReset(this.strm);\n break;\n default:\n break;\n }\n\n if (this.err !== exports.Z_OK) {\n this._error('Failed to reset stream');\n }\n};\n\nexports.Zlib = Zlib;","'use strict';\n\nvar Buffer = require('buffer').Buffer;\nvar Transform = require('stream').Transform;\nvar binding = require('./binding');\nvar util = require('util');\nvar assert = require('assert').ok;\nvar kMaxLength = require('buffer').kMaxLength;\nvar kRangeErrorMessage = 'Cannot create final Buffer. It would be larger ' + 'than 0x' + kMaxLength.toString(16) + ' bytes';\n\n// zlib doesn't provide these, so kludge them in following the same\n// const naming scheme zlib uses.\nbinding.Z_MIN_WINDOWBITS = 8;\nbinding.Z_MAX_WINDOWBITS = 15;\nbinding.Z_DEFAULT_WINDOWBITS = 15;\n\n// fewer than 64 bytes per chunk is stupid.\n// technically it could work with as few as 8, but even 64 bytes\n// is absurdly low. Usually a MB or more is best.\nbinding.Z_MIN_CHUNK = 64;\nbinding.Z_MAX_CHUNK = Infinity;\nbinding.Z_DEFAULT_CHUNK = 16 * 1024;\n\nbinding.Z_MIN_MEMLEVEL = 1;\nbinding.Z_MAX_MEMLEVEL = 9;\nbinding.Z_DEFAULT_MEMLEVEL = 8;\n\nbinding.Z_MIN_LEVEL = -1;\nbinding.Z_MAX_LEVEL = 9;\nbinding.Z_DEFAULT_LEVEL = binding.Z_DEFAULT_COMPRESSION;\n\n// expose all the zlib constants\nvar bkeys = Object.keys(binding);\nfor (var bk = 0; bk < bkeys.length; bk++) {\n var bkey = bkeys[bk];\n if (bkey.match(/^Z/)) {\n Object.defineProperty(exports, bkey, {\n enumerable: true, value: binding[bkey], writable: false\n });\n }\n}\n\n// translation table for return codes.\nvar codes = {\n Z_OK: binding.Z_OK,\n Z_STREAM_END: binding.Z_STREAM_END,\n Z_NEED_DICT: binding.Z_NEED_DICT,\n Z_ERRNO: binding.Z_ERRNO,\n Z_STREAM_ERROR: binding.Z_STREAM_ERROR,\n Z_DATA_ERROR: binding.Z_DATA_ERROR,\n Z_MEM_ERROR: binding.Z_MEM_ERROR,\n Z_BUF_ERROR: binding.Z_BUF_ERROR,\n Z_VERSION_ERROR: binding.Z_VERSION_ERROR\n};\n\nvar ckeys = Object.keys(codes);\nfor (var ck = 0; ck < ckeys.length; ck++) {\n var ckey = ckeys[ck];\n codes[codes[ckey]] = ckey;\n}\n\nObject.defineProperty(exports, 'codes', {\n enumerable: true, value: Object.freeze(codes), writable: false\n});\n\nexports.Deflate = Deflate;\nexports.Inflate = Inflate;\nexports.Gzip = Gzip;\nexports.Gunzip = Gunzip;\nexports.DeflateRaw = DeflateRaw;\nexports.InflateRaw = InflateRaw;\nexports.Unzip = Unzip;\n\nexports.createDeflate = function (o) {\n return new Deflate(o);\n};\n\nexports.createInflate = function (o) {\n return new Inflate(o);\n};\n\nexports.createDeflateRaw = function (o) {\n return new DeflateRaw(o);\n};\n\nexports.createInflateRaw = function (o) {\n return new InflateRaw(o);\n};\n\nexports.createGzip = function (o) {\n return new Gzip(o);\n};\n\nexports.createGunzip = function (o) {\n return new Gunzip(o);\n};\n\nexports.createUnzip = function (o) {\n return new Unzip(o);\n};\n\n// Convenience methods.\n// compress/decompress a string or buffer in one step.\nexports.deflate = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Deflate(opts), buffer, callback);\n};\n\nexports.deflateSync = function (buffer, opts) {\n return zlibBufferSync(new Deflate(opts), buffer);\n};\n\nexports.gzip = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Gzip(opts), buffer, callback);\n};\n\nexports.gzipSync = function (buffer, opts) {\n return zlibBufferSync(new Gzip(opts), buffer);\n};\n\nexports.deflateRaw = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new DeflateRaw(opts), buffer, callback);\n};\n\nexports.deflateRawSync = function (buffer, opts) {\n return zlibBufferSync(new DeflateRaw(opts), buffer);\n};\n\nexports.unzip = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Unzip(opts), buffer, callback);\n};\n\nexports.unzipSync = function (buffer, opts) {\n return zlibBufferSync(new Unzip(opts), buffer);\n};\n\nexports.inflate = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Inflate(opts), buffer, callback);\n};\n\nexports.inflateSync = function (buffer, opts) {\n return zlibBufferSync(new Inflate(opts), buffer);\n};\n\nexports.gunzip = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Gunzip(opts), buffer, callback);\n};\n\nexports.gunzipSync = function (buffer, opts) {\n return zlibBufferSync(new Gunzip(opts), buffer);\n};\n\nexports.inflateRaw = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new InflateRaw(opts), buffer, callback);\n};\n\nexports.inflateRawSync = function (buffer, opts) {\n return zlibBufferSync(new InflateRaw(opts), buffer);\n};\n\nfunction zlibBuffer(engine, buffer, callback) {\n var buffers = [];\n var nread = 0;\n\n engine.on('error', onError);\n engine.on('end', onEnd);\n\n engine.end(buffer);\n flow();\n\n function flow() {\n var chunk;\n while (null !== (chunk = engine.read())) {\n buffers.push(chunk);\n nread += chunk.length;\n }\n engine.once('readable', flow);\n }\n\n function onError(err) {\n engine.removeListener('end', onEnd);\n engine.removeListener('readable', flow);\n callback(err);\n }\n\n function onEnd() {\n var buf;\n var err = null;\n\n if (nread >= kMaxLength) {\n err = new RangeError(kRangeErrorMessage);\n } else {\n buf = Buffer.concat(buffers, nread);\n }\n\n buffers = [];\n engine.close();\n callback(err, buf);\n }\n}\n\nfunction zlibBufferSync(engine, buffer) {\n if (typeof buffer === 'string') buffer = Buffer.from(buffer);\n\n if (!Buffer.isBuffer(buffer)) throw new TypeError('Not a string or buffer');\n\n var flushFlag = engine._finishFlushFlag;\n\n return engine._processChunk(buffer, flushFlag);\n}\n\n// generic zlib\n// minimal 2-byte header\nfunction Deflate(opts) {\n if (!(this instanceof Deflate)) return new Deflate(opts);\n Zlib.call(this, opts, binding.DEFLATE);\n}\n\nfunction Inflate(opts) {\n if (!(this instanceof Inflate)) return new Inflate(opts);\n Zlib.call(this, opts, binding.INFLATE);\n}\n\n// gzip - bigger header, same deflate compression\nfunction Gzip(opts) {\n if (!(this instanceof Gzip)) return new Gzip(opts);\n Zlib.call(this, opts, binding.GZIP);\n}\n\nfunction Gunzip(opts) {\n if (!(this instanceof Gunzip)) return new Gunzip(opts);\n Zlib.call(this, opts, binding.GUNZIP);\n}\n\n// raw - no header\nfunction DeflateRaw(opts) {\n if (!(this instanceof DeflateRaw)) return new DeflateRaw(opts);\n Zlib.call(this, opts, binding.DEFLATERAW);\n}\n\nfunction InflateRaw(opts) {\n if (!(this instanceof InflateRaw)) return new InflateRaw(opts);\n Zlib.call(this, opts, binding.INFLATERAW);\n}\n\n// auto-detect header.\nfunction Unzip(opts) {\n if (!(this instanceof Unzip)) return new Unzip(opts);\n Zlib.call(this, opts, binding.UNZIP);\n}\n\nfunction isValidFlushFlag(flag) {\n return flag === binding.Z_NO_FLUSH || flag === binding.Z_PARTIAL_FLUSH || flag === binding.Z_SYNC_FLUSH || flag === binding.Z_FULL_FLUSH || flag === binding.Z_FINISH || flag === binding.Z_BLOCK;\n}\n\n// the Zlib class they all inherit from\n// This thing manages the queue of requests, and returns\n// true or false if there is anything in the queue when\n// you call the .write() method.\n\nfunction Zlib(opts, mode) {\n var _this = this;\n\n this._opts = opts = opts || {};\n this._chunkSize = opts.chunkSize || exports.Z_DEFAULT_CHUNK;\n\n Transform.call(this, opts);\n\n if (opts.flush && !isValidFlushFlag(opts.flush)) {\n throw new Error('Invalid flush flag: ' + opts.flush);\n }\n if (opts.finishFlush && !isValidFlushFlag(opts.finishFlush)) {\n throw new Error('Invalid flush flag: ' + opts.finishFlush);\n }\n\n this._flushFlag = opts.flush || binding.Z_NO_FLUSH;\n this._finishFlushFlag = typeof opts.finishFlush !== 'undefined' ? opts.finishFlush : binding.Z_FINISH;\n\n if (opts.chunkSize) {\n if (opts.chunkSize < exports.Z_MIN_CHUNK || opts.chunkSize > exports.Z_MAX_CHUNK) {\n throw new Error('Invalid chunk size: ' + opts.chunkSize);\n }\n }\n\n if (opts.windowBits) {\n if (opts.windowBits < exports.Z_MIN_WINDOWBITS || opts.windowBits > exports.Z_MAX_WINDOWBITS) {\n throw new Error('Invalid windowBits: ' + opts.windowBits);\n }\n }\n\n if (opts.level) {\n if (opts.level < exports.Z_MIN_LEVEL || opts.level > exports.Z_MAX_LEVEL) {\n throw new Error('Invalid compression level: ' + opts.level);\n }\n }\n\n if (opts.memLevel) {\n if (opts.memLevel < exports.Z_MIN_MEMLEVEL || opts.memLevel > exports.Z_MAX_MEMLEVEL) {\n throw new Error('Invalid memLevel: ' + opts.memLevel);\n }\n }\n\n if (opts.strategy) {\n if (opts.strategy != exports.Z_FILTERED && opts.strategy != exports.Z_HUFFMAN_ONLY && opts.strategy != exports.Z_RLE && opts.strategy != exports.Z_FIXED && opts.strategy != exports.Z_DEFAULT_STRATEGY) {\n throw new Error('Invalid strategy: ' + opts.strategy);\n }\n }\n\n if (opts.dictionary) {\n if (!Buffer.isBuffer(opts.dictionary)) {\n throw new Error('Invalid dictionary: it should be a Buffer instance');\n }\n }\n\n this._handle = new binding.Zlib(mode);\n\n var self = this;\n this._hadError = false;\n this._handle.onerror = function (message, errno) {\n // there is no way to cleanly recover.\n // continuing only obscures problems.\n _close(self);\n self._hadError = true;\n\n var error = new Error(message);\n error.errno = errno;\n error.code = exports.codes[errno];\n self.emit('error', error);\n };\n\n var level = exports.Z_DEFAULT_COMPRESSION;\n if (typeof opts.level === 'number') level = opts.level;\n\n var strategy = exports.Z_DEFAULT_STRATEGY;\n if (typeof opts.strategy === 'number') strategy = opts.strategy;\n\n this._handle.init(opts.windowBits || exports.Z_DEFAULT_WINDOWBITS, level, opts.memLevel || exports.Z_DEFAULT_MEMLEVEL, strategy, opts.dictionary);\n\n this._buffer = Buffer.allocUnsafe(this._chunkSize);\n this._offset = 0;\n this._level = level;\n this._strategy = strategy;\n\n this.once('end', this.close);\n\n Object.defineProperty(this, '_closed', {\n get: function () {\n return !_this._handle;\n },\n configurable: true,\n enumerable: true\n });\n}\n\nutil.inherits(Zlib, Transform);\n\nZlib.prototype.params = function (level, strategy, callback) {\n if (level < exports.Z_MIN_LEVEL || level > exports.Z_MAX_LEVEL) {\n throw new RangeError('Invalid compression level: ' + level);\n }\n if (strategy != exports.Z_FILTERED && strategy != exports.Z_HUFFMAN_ONLY && strategy != exports.Z_RLE && strategy != exports.Z_FIXED && strategy != exports.Z_DEFAULT_STRATEGY) {\n throw new TypeError('Invalid strategy: ' + strategy);\n }\n\n if (this._level !== level || this._strategy !== strategy) {\n var self = this;\n this.flush(binding.Z_SYNC_FLUSH, function () {\n assert(self._handle, 'zlib binding closed');\n self._handle.params(level, strategy);\n if (!self._hadError) {\n self._level = level;\n self._strategy = strategy;\n if (callback) callback();\n }\n });\n } else {\n process.nextTick(callback);\n }\n};\n\nZlib.prototype.reset = function () {\n assert(this._handle, 'zlib binding closed');\n return this._handle.reset();\n};\n\n// This is the _flush function called by the transform class,\n// internally, when the last chunk has been written.\nZlib.prototype._flush = function (callback) {\n this._transform(Buffer.alloc(0), '', callback);\n};\n\nZlib.prototype.flush = function (kind, callback) {\n var _this2 = this;\n\n var ws = this._writableState;\n\n if (typeof kind === 'function' || kind === undefined && !callback) {\n callback = kind;\n kind = binding.Z_FULL_FLUSH;\n }\n\n if (ws.ended) {\n if (callback) process.nextTick(callback);\n } else if (ws.ending) {\n if (callback) this.once('end', callback);\n } else if (ws.needDrain) {\n if (callback) {\n this.once('drain', function () {\n return _this2.flush(kind, callback);\n });\n }\n } else {\n this._flushFlag = kind;\n this.write(Buffer.alloc(0), '', callback);\n }\n};\n\nZlib.prototype.close = function (callback) {\n _close(this, callback);\n process.nextTick(emitCloseNT, this);\n};\n\nfunction _close(engine, callback) {\n if (callback) process.nextTick(callback);\n\n // Caller may invoke .close after a zlib error (which will null _handle).\n if (!engine._handle) return;\n\n engine._handle.close();\n engine._handle = null;\n}\n\nfunction emitCloseNT(self) {\n self.emit('close');\n}\n\nZlib.prototype._transform = function (chunk, encoding, cb) {\n var flushFlag;\n var ws = this._writableState;\n var ending = ws.ending || ws.ended;\n var last = ending && (!chunk || ws.length === chunk.length);\n\n if (chunk !== null && !Buffer.isBuffer(chunk)) return cb(new Error('invalid input'));\n\n if (!this._handle) return cb(new Error('zlib binding closed'));\n\n // If it's the last chunk, or a final flush, we use the Z_FINISH flush flag\n // (or whatever flag was provided using opts.finishFlush).\n // If it's explicitly flushing at some other time, then we use\n // Z_FULL_FLUSH. Otherwise, use Z_NO_FLUSH for maximum compression\n // goodness.\n if (last) flushFlag = this._finishFlushFlag;else {\n flushFlag = this._flushFlag;\n // once we've flushed the last of the queue, stop flushing and\n // go back to the normal behavior.\n if (chunk.length >= ws.length) {\n this._flushFlag = this._opts.flush || binding.Z_NO_FLUSH;\n }\n }\n\n this._processChunk(chunk, flushFlag, cb);\n};\n\nZlib.prototype._processChunk = function (chunk, flushFlag, cb) {\n var availInBefore = chunk && chunk.length;\n var availOutBefore = this._chunkSize - this._offset;\n var inOff = 0;\n\n var self = this;\n\n var async = typeof cb === 'function';\n\n if (!async) {\n var buffers = [];\n var nread = 0;\n\n var error;\n this.on('error', function (er) {\n error = er;\n });\n\n assert(this._handle, 'zlib binding closed');\n do {\n var res = this._handle.writeSync(flushFlag, chunk, // in\n inOff, // in_off\n availInBefore, // in_len\n this._buffer, // out\n this._offset, //out_off\n availOutBefore); // out_len\n } while (!this._hadError && callback(res[0], res[1]));\n\n if (this._hadError) {\n throw error;\n }\n\n if (nread >= kMaxLength) {\n _close(this);\n throw new RangeError(kRangeErrorMessage);\n }\n\n var buf = Buffer.concat(buffers, nread);\n _close(this);\n\n return buf;\n }\n\n assert(this._handle, 'zlib binding closed');\n var req = this._handle.write(flushFlag, chunk, // in\n inOff, // in_off\n availInBefore, // in_len\n this._buffer, // out\n this._offset, //out_off\n availOutBefore); // out_len\n\n req.buffer = chunk;\n req.callback = callback;\n\n function callback(availInAfter, availOutAfter) {\n // When the callback is used in an async write, the callback's\n // context is the `req` object that was created. The req object\n // is === this._handle, and that's why it's important to null\n // out the values after they are done being used. `this._handle`\n // can stay in memory longer than the callback and buffer are needed.\n if (this) {\n this.buffer = null;\n this.callback = null;\n }\n\n if (self._hadError) return;\n\n var have = availOutBefore - availOutAfter;\n assert(have >= 0, 'have should not go down');\n\n if (have > 0) {\n var out = self._buffer.slice(self._offset, self._offset + have);\n self._offset += have;\n // serve some output to the consumer.\n if (async) {\n self.push(out);\n } else {\n buffers.push(out);\n nread += out.length;\n }\n }\n\n // exhausted the output buffer, or used all the input create a new one.\n if (availOutAfter === 0 || self._offset >= self._chunkSize) {\n availOutBefore = self._chunkSize;\n self._offset = 0;\n self._buffer = Buffer.allocUnsafe(self._chunkSize);\n }\n\n if (availOutAfter === 0) {\n // Not actually done. Need to reprocess.\n // Also, update the availInBefore to the availInAfter value,\n // so that if we have to hit it a third (fourth, etc.) time,\n // it'll have the correct byte counts.\n inOff += availInBefore - availInAfter;\n availInBefore = availInAfter;\n\n if (!async) return true;\n\n var newReq = self._handle.write(flushFlag, chunk, inOff, availInBefore, self._buffer, self._offset, self._chunkSize);\n newReq.callback = callback; // this same function\n newReq.buffer = chunk;\n return;\n }\n\n if (!async) return false;\n\n // finished with the chunk.\n cb();\n }\n};\n\nutil.inherits(Deflate, Zlib);\nutil.inherits(Inflate, Zlib);\nutil.inherits(Gzip, Zlib);\nutil.inherits(Gunzip, Zlib);\nutil.inherits(DeflateRaw, Zlib);\nutil.inherits(InflateRaw, Zlib);\nutil.inherits(Unzip, Zlib);","'use strict';\n\n\nvar TYPED_OK = (typeof Uint8Array !== 'undefined') &&\n (typeof Uint16Array !== 'undefined') &&\n (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n var source = sources.shift();\n if (!source) { continue; }\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 (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n if (buf.length === size) { return buf; }\n if (buf.subarray) { return buf.subarray(0, size); }\n buf.length = size;\n return buf;\n};\n\n\nvar fnTyped = {\n arraySet: function (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 }\n // Fallback to ordinary array\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 (chunks) {\n var i, l, len, pos, chunk, result;\n\n // calculate data length\n len = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n result = new Uint8Array(len);\n pos = 0;\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\nvar fnUntyped = {\n arraySet: function (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 (chunks) {\n return [].concat.apply([], chunks);\n }\n};\n\n\n// Enable/Disable typed arrays use, for testing\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);\n","'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\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\n\nmodule.exports = adler32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\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\n\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\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n","'use strict';\n\n// 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\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n var c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n\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\n\nmodule.exports = crc32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar trees = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar msg = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\nvar Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\n//var Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\n//var Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\n//var Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION = 0;\n//var Z_BEST_SPEED = 1;\n//var Z_BEST_COMPRESSION = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED = 1;\nvar Z_HUFFMAN_ONLY = 2;\nvar Z_RLE = 3;\nvar Z_FIXED = 4;\nvar Z_DEFAULT_STRATEGY = 0;\n\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\nvar Z_UNKNOWN = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES = 30;\n/* number of distance codes */\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n strm.msg = msg[errorCode];\n return errorCode;\n}\n\nfunction rank(f) {\n return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { 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 */\nfunction flush_pending(strm) {\n var s = strm.state;\n\n //_tr_flush_bits(s);\n var len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\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 if (s.pending === 0) {\n s.pending_out = 0;\n }\n}\n\n\nfunction 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 s.block_start = s.strstart;\n flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n s.pending_buf[s.pending++] = b;\n}\n\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 */\nfunction 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\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 */\nfunction read_buf(strm, buf, start, size) {\n var len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n utils.arraySet(buf, strm.input, strm.next_in, len, start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n }\n\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\n return len;\n}\n\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 */\nfunction longest_match(s, cur_match) {\n var chain_length = s.max_chain_length; /* max hash chain length */\n var scan = s.strstart; /* current string */\n var match; /* matched string */\n var len; /* length of current match */\n var best_len = s.prev_length; /* best match length so far */\n var nice_match = s.nice_match; /* stop if match long enough */\n var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n var _win = s.window; // shortcut\n\n var wmask = s.w_mask;\n var prev = s.prev;\n\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\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 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 if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\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 ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\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 scan += 2;\n match++;\n // 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 do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\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 if (len >= nice_match) {\n break;\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 return s.lookahead;\n}\n\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 */\nfunction fill_window(s) {\n var _w_size = s.w_size;\n var p, n, m, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\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\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 if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\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 s.block_start -= _w_size;\n\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 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 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 if (s.strm.avail_in === 0) {\n break;\n }\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 = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\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\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 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\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 */\nfunction 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\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\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\n fill_window(s);\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 s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\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 flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\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 if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\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 if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\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 if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_NEED_MORE;\n}\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 */\nfunction deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* 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 if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\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 hash_head = 0/*NIL*/;\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\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((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 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\n s.lookahead -= s.match_length;\n\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 if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\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 /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\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 s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\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 /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\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 */\nfunction deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\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 if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* 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 hash_head = 0/*NIL*/;\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\n /* Find the longest match, discarding those <= prev_length.\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/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\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 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*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 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\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 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 s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\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 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 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 /*** _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 s.strstart++;\n s.lookahead--;\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 }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\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 s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}\n\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 */\nfunction deflate_rle(s, flush) {\n var bflush; /* set if current block must be flushed */\n var prev; /* byte at distance one to match */\n var scan, strend; /* 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 if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\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 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\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 /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\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 */\nfunction deflate_huff(s, flush) {\n var bflush; /* 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 if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\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 if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\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 */\nfunction 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\nvar configuration_table;\n\nconfiguration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\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\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\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* 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; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* 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; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* 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 /* 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; /* compression level (1..9) */\n this.strategy = 0; /* 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; /* 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\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\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\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\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new utils.Buf16(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\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 zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* 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; /* 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; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\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\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 /* 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\nfunction 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\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 s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = Z_NO_FLUSH;\n trees._tr_init(s);\n return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n var ret = deflateResetKeep(strm);\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n strm.state.gzhead = head;\n return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR;\n }\n var wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n var s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n\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\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\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);\n\n // 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); /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n\n //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n //s->pending_buf = (uchf *) overlay;\n s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n s.d_buf = 1 * s.lit_bufsize;\n\n //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n var old_flush, s;\n var beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n 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 ||\n (!strm.input && strm.avail_in !== 0) ||\n (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; /* just in case */\n old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // 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 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\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 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\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 if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\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 header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* 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 flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* 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 flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\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 if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* 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 flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\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 if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\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 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 s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\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\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 } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n 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 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 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 if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n trees._tr_align(s);\n }\n else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\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 if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/ /* 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 flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK;\n }\n }\n }\n //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n if (flush !== Z_FINISH) { return Z_OK; }\n if (s.wrap <= 0) { return Z_STREAM_END; }\n\n /* Write the trailer */\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 }\n else\n {\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 if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n var status;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var s;\n var str, n;\n var wrap;\n var avail;\n var next;\n var input;\n var tmpDict;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n s = strm.state;\n wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n tmpDict = new utils.Buf8(s.w_size);\n utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n avail = strm.avail_in;\n next = strm.next_in;\n input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n str = s.strstart;\n n = s.lookahead - (MIN_MATCH - 1);\n do {\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\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar TYPE = 12; /* 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 */\nmodule.exports = function inflate_fast(strm, start) {\n var state;\n var _in; /* local strm.input */\n var last; /* have enough input while in < last */\n var _out; /* local strm.output */\n var beg; /* inflate()'s initial strm.output */\n var end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n var dmax; /* maximum distance from zlib header */\n//#endif\n var wsize; /* window size or zero if not using window */\n var whave; /* valid bytes in the window */\n var wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n var s_window; /* allocated sliding window, if wsize != 0 */\n var hold; /* local strm.hold */\n var bits; /* local strm.bits */\n var lcode; /* local strm.lencode */\n var dcode; /* local strm.distcode */\n var lmask; /* mask for first level of length codes */\n var dmask; /* mask for first level of distance codes */\n var here; /* retrieved table entry */\n var op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n var len; /* match length, unused bytes */\n var dist; /* match distance */\n var from; /* where to copy match from */\n var from_source;\n\n\n var input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n state = strm.state;\n //here = state.here;\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);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_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\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n 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:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* 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/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\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 from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\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 if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* 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 if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\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 }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n }\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\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\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","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar inflate_fast = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\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;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\nvar Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\nvar Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar HEAD = 1; /* i: waiting for magic header */\nvar FLAGS = 2; /* i: waiting for method and flags (gzip) */\nvar TIME = 3; /* i: waiting for modification time (gzip) */\nvar OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nvar EXLEN = 5; /* i: waiting for extra length (gzip) */\nvar EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nvar NAME = 7; /* i: waiting for end of file name (gzip) */\nvar COMMENT = 8; /* i: waiting for end of comment (gzip) */\nvar HCRC = 9; /* i: waiting for header crc (gzip) */\nvar DICTID = 10; /* i: waiting for dictionary check value */\nvar DICT = 11; /* waiting for inflateSetDictionary() call */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nvar TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nvar STORED = 14; /* i: waiting for stored size (length and complement) */\nvar COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nvar COPY = 16; /* i/o: waiting for input or output to copy stored block */\nvar TABLE = 17; /* i: waiting for dynamic block table lengths */\nvar LENLENS = 18; /* i: waiting for code length code lengths */\nvar CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nvar LEN_ = 20; /* i: same as LEN below, but only first time in */\nvar LEN = 21; /* i: waiting for length/lit/eob code */\nvar LENEXT = 22; /* i: waiting for length extra bits */\nvar DIST = 23; /* i: waiting for distance code */\nvar DISTEXT = 24; /* i: waiting for distance extra bits */\nvar MATCH = 25; /* o: waiting for output space to copy string */\nvar LIT = 26; /* o: waiting for output space to write literal */\nvar CHECK = 27; /* i: waiting for 32-bit check value */\nvar LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nvar DONE = 29; /* finished check, done -- remain here until reset */\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar MEM = 31; /* got an inflate() memory error -- remain here until reset */\nvar SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n this.work = new utils.Buf16(288); /* 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 this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n}\n\nfunction inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 1;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.window = null/*Z_NULL*/;\n ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n}\n\nfunction inflateInit(strm) {\n return inflateInit2(strm, DEF_WBITS);\n}\n\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 */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n\n /* literal/length table */\n sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n}\n\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 */\nfunction updatewindow(strm, src, end, copy) {\n var dist;\n var state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new utils.Buf8(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\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 }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n copy -= dist;\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 }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n}\n\nfunction inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n var next; /* next input INDEX */\n var put; /* next output INDEX */\n var have, left; /* available input and output */\n var hold; /* bit buffer */\n var bits; /* bits in bit buffer */\n var _in, _out; /* save starting available input and output */\n var copy; /* number of stored or match bytes to copy */\n var from; /* where to copy match bytes from */\n var from_source;\n var here = 0; /* current decoding table entry */\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n var len; /* length to copy for repeats, bits to drop */\n var ret; /* return code */\n var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */\n var opts;\n\n var n; // temporary var for NEED_BITS\n\n var order = /* 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\n if (!strm || !strm.state || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\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\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 }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\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 //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n state.flags = 0; /* expect zlib header */\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n state.dmax = 1 << len;\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\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 //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\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 //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\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 //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\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 //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Array(state.head.extra_len);\n }\n utils.arraySet(\n state.head.extra,\n input,\n next,\n // 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\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\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 if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\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 have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\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 strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\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 strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\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 }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\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 }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\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 state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\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 }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\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 }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\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 len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\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 while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\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 state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // 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;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\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);\n //--- LOAD() ---\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\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\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 for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> 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) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\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 if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\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 for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> 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) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\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 if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\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;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\n }\n }\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\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\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (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 _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if (state.wrap && _out) {\n strm.adler = state.check = /*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 strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n}\n\nfunction inflateEnd(strm) {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n var state;\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var state;\n var dictid;\n var ret;\n\n /* check state */\n if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n var bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n var len = 0; /* a code's length in bits */\n var sym = 0; /* index of code symbols */\n var min = 0, max = 0; /* minimum and maximum code lengths */\n var root = 0; /* number of index bits for root table */\n var curr = 0; /* number of index bits for current table */\n var drop = 0; /* code bits to drop for sub-table */\n var left = 0; /* number of prefix codes available */\n var used = 0; /* code entries in table used */\n var huff = 0; /* Huffman code */\n var incr; /* for incrementing code, index */\n var fill; /* index for replicating entries */\n var low; /* low bits for current root entry */\n var mask; /* mask for low root bits */\n var next; /* next available space in table */\n var base = null; /* base value table to use */\n var base_index = 0;\n// var shoextra; /* extra bits table to use */\n var end; /* use base and extra for symbol > end */\n var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n var extra = null;\n var extra_index = 0;\n\n var here_bits, here_op, here_val;\n\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\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\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\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 for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* 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;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\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 /*\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\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\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\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\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 if (type === CODES) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\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\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\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 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\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED = 1;\n//var Z_HUFFMAN_ONLY = 2;\n//var Z_RLE = 3;\nvar Z_FIXED = 4;\n//var Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY = 0;\nvar Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES = 30;\n/* number of distance codes */\n\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK = 256;\n/* end of block literal code */\n\nvar REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nvar extra_lbits = /* 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\nvar extra_dbits = /* 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\nvar extra_blbits = /* 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\nvar bl_order =\n [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\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\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree = new Array((L_CODES + 2) * 2);\nzero(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\nvar static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code = new Array(DIST_CODE_LEN);\nzero(_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\nvar _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nfunction d_code(dist) {\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction 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\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction 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\nfunction send_code(s, c, tree) {\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n}\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 */\nfunction bi_reverse(code, len) {\n var res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction 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\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\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 */\nfunction gen_bitlen(s, desc)\n// 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; /* heap index */\n var n, m; /* iterate over the tree elements */\n var bits; /* bit length */\n var xbits; /* extra bits */\n var f; /* frequency */\n var overflow = 0; /* 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\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* 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]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Trace((stderr,\"\\nbit length overflow\\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 do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\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 overflow -= 2;\n } while (overflow > 0);\n\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 for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\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 */\nfunction gen_codes(tree, max_code, bl_count)\n// 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); /* next code value for each bit length */\n var code = 0; /* running code value */\n var bits; /* bit index */\n var n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\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 length = 0;\n for (code = 0; code < LENGTH_CODES - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\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 _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 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 gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\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);\n\n //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n var n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\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 s.bi_buf = 0;\n s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//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); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n s.pending += len;\n}\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 */\nfunction smaller(tree, n, m, depth) {\n var _n2 = n * 2;\n var _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\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 */\nfunction pqdownheap(s, tree, k)\n// 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; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{\n var dist; /* distance of matched string */\n var lc; /* match length or unmatched char (if dist == 0) */\n var lx = 0; /* running index in l_buf */\n var code; /* the code to send */\n var extra; /* 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); /* 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); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\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\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 */\nfunction build_tree(s, desc)\n// 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; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var node; /* 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 s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\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 while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n// 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; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\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\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n// 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; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\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]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\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 if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\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 */\nfunction build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\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\n /* Build the bit length tree: */\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 for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}\n\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 */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\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 send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\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]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\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 */\nfunction 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\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\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 return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\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\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//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); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}\n\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 */\nfunction _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\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 */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//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; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\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\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\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 max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // 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) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* 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\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\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 }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\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 */\nfunction _tr_tally(s, dist, lc)\n// 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\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\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 dist--; /* 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 }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\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 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\nexports._tr_init = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nmodule.exports = ZStream;\n","function allocUnsafe (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be a number')\n }\n\n if (size < 0) {\n throw new RangeError('\"size\" argument must not be negative')\n }\n\n if (Buffer.allocUnsafe) {\n return Buffer.allocUnsafe(size)\n } else {\n return new Buffer(size)\n }\n}\n\nmodule.exports = allocUnsafe\n","var bufferFill = require('buffer-fill')\nvar allocUnsafe = require('buffer-alloc-unsafe')\n\nmodule.exports = function alloc (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be a number')\n }\n\n if (size < 0) {\n throw new RangeError('\"size\" argument must not be negative')\n }\n\n if (Buffer.alloc) {\n return Buffer.alloc(size, fill, encoding)\n }\n\n var buffer = allocUnsafe(size)\n\n if (size === 0) {\n return buffer\n }\n\n if (fill === undefined) {\n return bufferFill(buffer, 0)\n }\n\n if (typeof encoding !== 'string') {\n encoding = undefined\n }\n\n return bufferFill(buffer, fill, encoding)\n}\n","/* Node.js 6.4.0 and up has full support */\nvar hasFullSupport = (function () {\n try {\n if (!Buffer.isEncoding('latin1')) {\n return false\n }\n\n var buf = Buffer.alloc ? Buffer.alloc(4) : new Buffer(4)\n\n buf.fill('ab', 'ucs2')\n\n return (buf.toString('hex') === '61006200')\n } catch (_) {\n return false\n }\n}())\n\nfunction isSingleByte (val) {\n return (val.length === 1 && val.charCodeAt(0) < 256)\n}\n\nfunction fillWithNumber (buffer, val, start, end) {\n if (start < 0 || end > buffer.length) {\n throw new RangeError('Out of range index')\n }\n\n start = start >>> 0\n end = end === undefined ? buffer.length : end >>> 0\n\n if (end > start) {\n buffer.fill(val, start, end)\n }\n\n return buffer\n}\n\nfunction fillWithBuffer (buffer, val, start, end) {\n if (start < 0 || end > buffer.length) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return buffer\n }\n\n start = start >>> 0\n end = end === undefined ? buffer.length : end >>> 0\n\n var pos = start\n var len = val.length\n while (pos <= (end - len)) {\n val.copy(buffer, pos)\n pos += len\n }\n\n if (pos !== end) {\n val.copy(buffer, pos, 0, end - pos)\n }\n\n return buffer\n}\n\nfunction fill (buffer, val, start, end, encoding) {\n if (hasFullSupport) {\n return buffer.fill(val, start, end, encoding)\n }\n\n if (typeof val === 'number') {\n return fillWithNumber(buffer, val, start, end)\n }\n\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = buffer.length\n } else if (typeof end === 'string') {\n encoding = end\n end = buffer.length\n }\n\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n\n if (encoding === 'latin1') {\n encoding = 'binary'\n }\n\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n if (val === '') {\n return fillWithNumber(buffer, 0, start, end)\n }\n\n if (isSingleByte(val)) {\n return fillWithNumber(buffer, val.charCodeAt(0), start, end)\n }\n\n val = new Buffer(val, encoding)\n }\n\n if (Buffer.isBuffer(val)) {\n return fillWithBuffer(buffer, val, start, end)\n }\n\n // Other values (e.g. undefined, boolean, object) results in zero-fill\n return fillWithNumber(buffer, 0, start, end)\n}\n\nmodule.exports = fill\n","module.exports = function xor (a, b) {\n var length = Math.min(a.length, b.length)\n var buffer = new Buffer(length)\n\n for (var i = 0; i < length; ++i) {\n buffer[i] = a[i] ^ b[i]\n }\n\n return buffer\n}\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh \n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * 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 * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n const arr = new Uint8Array(1)\n const proto = { foo: function () { return 42 } }\n Object.setPrototypeOf(proto, Uint8Array.prototype)\n Object.setPrototypeOf(arr, proto)\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n const buf = new Uint8Array(length)\n Object.setPrototypeOf(buf, Buffer.prototype)\n return buf\n}\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\nfunction Buffer (arg, encodingOrOffset, length) {\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayView(value)\n }\n\n if (value == null) {\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof SharedArrayBuffer !== 'undefined' &&\n (isInstance(value, SharedArrayBuffer) ||\n (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n const valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n const b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n}\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 **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(size)\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 interpreted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n const length = byteLength(string, encoding) | 0\n let buf = createBuffer(length)\n\n const actual = buf.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 buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n const length = array.length < 0 ? 0 : checked(array.length) | 0\n const buf = createBuffer(length)\n for (let i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayView (arrayView) {\n if (isInstance(arrayView, Uint8Array)) {\n const copy = new Uint8Array(arrayView)\n return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n }\n return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n let buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(buf, Buffer.prototype)\n\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n const len = checked(obj.length) | 0\n const buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return b != null && b._isBuffer === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\n }\n\n if (a === b) return 0\n\n let x = a.length\n let y = b.length\n\n for (let 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 default:\n return false\n }\n}\n\nBuffer.concat = function concat (list, length) {\n if (!Array.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 let i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n const buffer = Buffer.allocUnsafe(length)\n let pos = 0\n for (i = 0; i < list.length; ++i) {\n let buf = list[i]\n if (isInstance(buf, Uint8Array)) {\n if (pos + buf.length > buffer.length) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n buf.copy(buffer, pos)\n } else {\n Uint8Array.prototype.set.call(\n buffer,\n buf,\n pos\n )\n }\n } else if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n } else {\n buf.copy(buffer, pos)\n }\n pos += buf.length\n }\n return buffer\n}\n\nfunction byteLength (string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n const len = string.length\n const mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && len === 0) return 0\n\n // Use a for loop to avoid recursion\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n let loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\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 if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\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 }\n\n // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\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}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n const i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n const len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (let i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n const len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (let i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n const len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (let 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 return this\n}\n\nBuffer.prototype.toString = function toString () {\n const length = this.length\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.toLocaleString = Buffer.prototype.toString\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 let str = ''\n const max = exports.INSPECT_MAX_BYTES\n str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return ''\n}\nif (customInspectSymbol) {\n Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\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 if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n let x = thisEnd - thisStart\n let y = end - start\n const len = Math.min(x, y)\n\n const thisCopy = this.slice(thisStart, thisEnd)\n const targetCopy = target.slice(start, end)\n\n for (let 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}\n\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\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\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 byteOffset = +byteOffset // Coerce to Number.\n if (numberIsNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\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 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 if (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 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 let indexSize = 1\n let arrLength = arr.length\n let valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\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 let i\n if (dir) {\n let foundIndex = -1\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 for (i = byteOffset; i >= 0; i--) {\n let found = true\n for (let j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\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 const remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n const strLen = string.length\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n let i\n for (i = 0; i < length; ++i) {\n const parsed = parseInt(string.substr(i * 2, 2), 16)\n if (numberIsNaN(parsed)) return i\n buf[offset + i] = parsed\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 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\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset >>> 0\n if (isFinite(length)) {\n length = length >>> 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n const 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\n let loweredCase = false\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 case 'latin1':\n case 'binary':\n return asciiWrite(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 const res = []\n\n let i = start\n while (i < end) {\n const firstByte = buf[i]\n let codePoint = null\n let bytesPerSequence = (firstByte > 0xEF)\n ? 4\n : (firstByte > 0xDF)\n ? 3\n : (firstByte > 0xBF)\n ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n let secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\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 if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\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}\n\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\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n const len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n let res = ''\n let i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n const len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n let out = ''\n for (let i = start; i < end; ++i) {\n out += hexSliceLookupTable[buf[i]]\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n const bytes = buf.slice(start, end)\n let res = ''\n // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n for (let i = 0; i < bytes.length - 1; i += 2) {\n res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n }\n return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n const 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\n const newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\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 =\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\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n let val = this[offset + --byteLength]\n let mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const lo = first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24\n\n const hi = this[++offset] +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n last * 2 ** 24\n\n return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const hi = first * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n const lo = this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last\n\n return (BigInt(hi) << BigInt(32)) + BigInt(lo)\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\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\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\n let i = byteLength\n let mul = 1\n let val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n offset = offset >>> 0\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 offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = this[offset + 4] +\n this[offset + 5] * 2 ** 8 +\n this[offset + 6] * 2 ** 16 +\n (last << 24) // Overflow\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = (first << 24) + // Overflow\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let mul = 1\n let i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let i = byteLength - 1\n let mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\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 this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\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 this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\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 this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\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 this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset + 7] = lo\n lo = lo >> 8\n buf[offset + 6] = lo\n lo = lo >> 8\n buf[offset + 5] = lo\n lo = lo >> 8\n buf[offset + 4] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset + 3] = hi\n hi = hi >> 8\n buf[offset + 2] = hi\n hi = hi >> 8\n buf[offset + 1] = hi\n hi = hi >> 8\n buf[offset] = hi\n return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = 0\n let mul = 1\n let sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\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 if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = byteLength - 1\n let mul = 1\n let sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\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 (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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\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 this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\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 this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\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 value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\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 value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\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}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\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\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n const len = end - start\n\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\n targetStart\n )\n }\n\n return len\n}\n\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\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 if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n if (val.length === 1) {\n const code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n } else if (typeof val === 'boolean') {\n val = Number(val)\n }\n\n // Invalid ranges are not set to a default, so can range check early.\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\n if (!val) val = 0\n\n let i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n const bytes = Buffer.isBuffer(val)\n ? val\n : Buffer.from(val, encoding)\n const len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n errors[sym] = class NodeError extends Base {\n constructor () {\n super()\n\n Object.defineProperty(this, 'message', {\n value: getMessage.apply(this, arguments),\n writable: true,\n configurable: true\n })\n\n // Add the error code to the name to include it in the stack trace.\n this.name = `${this.name} [${sym}]`\n // Access the stack to generate the error message including the error code\n // from the name.\n this.stack // eslint-disable-line no-unused-expressions\n // Reset the name to the actual name.\n delete this.name\n }\n\n get code () {\n return sym\n }\n\n set code (value) {\n Object.defineProperty(this, 'code', {\n configurable: true,\n enumerable: true,\n value,\n writable: true\n })\n }\n\n toString () {\n return `${this.name} [${sym}]: ${this.message}`\n }\n }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n function (name) {\n if (name) {\n return `${name} is outside of buffer bounds`\n }\n\n return 'Attempt to access memory outside buffer bounds'\n }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n function (name, actual) {\n return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n }, TypeError)\nE('ERR_OUT_OF_RANGE',\n function (str, range, input) {\n let msg = `The value of \"${str}\" is out of range.`\n let received = input\n if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n received = addNumericalSeparator(String(input))\n } else if (typeof input === 'bigint') {\n received = String(input)\n if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n received = addNumericalSeparator(received)\n }\n received += 'n'\n }\n msg += ` It must be ${range}. Received ${received}`\n return msg\n }, RangeError)\n\nfunction addNumericalSeparator (val) {\n let res = ''\n let i = val.length\n const start = val[0] === '-' ? 1 : 0\n for (; i >= start + 4; i -= 3) {\n res = `_${val.slice(i - 3, i)}${res}`\n }\n return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n validateNumber(offset, 'offset')\n if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n boundsError(offset, buf.length - (byteLength + 1))\n }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n if (value > max || value < min) {\n const n = typeof min === 'bigint' ? 'n' : ''\n let range\n if (byteLength > 3) {\n if (min === 0 || min === BigInt(0)) {\n range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n } else {\n range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n `${(byteLength + 1) * 8 - 1}${n}`\n }\n } else {\n range = `>= ${min}${n} and <= ${max}${n}`\n }\n throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n }\n checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n if (typeof value !== 'number') {\n throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n }\n}\n\nfunction boundsError (value, length, type) {\n if (Math.floor(value) !== value) {\n validateNumber(value, type)\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n }\n\n if (length < 0) {\n throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n }\n\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n `>= ${type ? 1 : 0} and <= ${length}`,\n value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n let codePoint\n const length = string.length\n let leadSurrogate = null\n const bytes = []\n\n for (let i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\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 }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\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\n\n // encode utf8\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(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction asciiToBytes (str) {\n const byteArray = []\n for (let 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 return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n let c, hi, lo\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\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 let i\n for (i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n const alphabet = '0123456789abcdef'\n const table = new Array(256)\n for (let i = 0; i < 16; ++i) {\n const i16 = i * 16\n for (let j = 0; j < 16; ++j) {\n table[i16 + j] = alphabet[i] + alphabet[j]\n }\n }\n return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n throw new Error('BigInt not supported')\n}\n","module.exports = {\n \"100\": \"Continue\",\n \"101\": \"Switching Protocols\",\n \"102\": \"Processing\",\n \"200\": \"OK\",\n \"201\": \"Created\",\n \"202\": \"Accepted\",\n \"203\": \"Non-Authoritative Information\",\n \"204\": \"No Content\",\n \"205\": \"Reset Content\",\n \"206\": \"Partial Content\",\n \"207\": \"Multi-Status\",\n \"208\": \"Already Reported\",\n \"226\": \"IM Used\",\n \"300\": \"Multiple Choices\",\n \"301\": \"Moved Permanently\",\n \"302\": \"Found\",\n \"303\": \"See Other\",\n \"304\": \"Not Modified\",\n \"305\": \"Use Proxy\",\n \"307\": \"Temporary Redirect\",\n \"308\": \"Permanent Redirect\",\n \"400\": \"Bad Request\",\n \"401\": \"Unauthorized\",\n \"402\": \"Payment Required\",\n \"403\": \"Forbidden\",\n \"404\": \"Not Found\",\n \"405\": \"Method Not Allowed\",\n \"406\": \"Not Acceptable\",\n \"407\": \"Proxy Authentication Required\",\n \"408\": \"Request Timeout\",\n \"409\": \"Conflict\",\n \"410\": \"Gone\",\n \"411\": \"Length Required\",\n \"412\": \"Precondition Failed\",\n \"413\": \"Payload Too Large\",\n \"414\": \"URI Too Long\",\n \"415\": \"Unsupported Media Type\",\n \"416\": \"Range Not Satisfiable\",\n \"417\": \"Expectation Failed\",\n \"418\": \"I'm a teapot\",\n \"421\": \"Misdirected Request\",\n \"422\": \"Unprocessable Entity\",\n \"423\": \"Locked\",\n \"424\": \"Failed Dependency\",\n \"425\": \"Unordered Collection\",\n \"426\": \"Upgrade Required\",\n \"428\": \"Precondition Required\",\n \"429\": \"Too Many Requests\",\n \"431\": \"Request Header Fields Too Large\",\n \"451\": \"Unavailable For Legal Reasons\",\n \"500\": \"Internal Server Error\",\n \"501\": \"Not Implemented\",\n \"502\": \"Bad Gateway\",\n \"503\": \"Service Unavailable\",\n \"504\": \"Gateway Timeout\",\n \"505\": \"HTTP Version Not Supported\",\n \"506\": \"Variant Also Negotiates\",\n \"507\": \"Insufficient Storage\",\n \"508\": \"Loop Detected\",\n \"509\": \"Bandwidth Limit Exceeded\",\n \"510\": \"Not Extended\",\n \"511\": \"Network Authentication Required\"\n}\n","/*! cache-chunk-store. MIT License. Feross Aboukhadijeh */\nconst LRU = require('lru')\nconst queueMicrotask = require('queue-microtask')\n\nclass CacheStore {\n constructor (store, opts) {\n this.store = store\n this.chunkLength = store.chunkLength\n this.inProgressGets = new Map() // Map from chunk index to info on callbacks waiting for that chunk\n\n if (!this.store || !this.store.get || !this.store.put) {\n throw new Error('First argument must be abstract-chunk-store compliant')\n }\n\n this.cache = new LRU(opts)\n }\n\n put (index, buf, cb = () => {}) {\n if (!this.cache) {\n return queueMicrotask(() => cb(new Error('CacheStore closed')))\n }\n\n this.cache.remove(index)\n this.store.put(index, buf, cb)\n }\n\n get (index, opts, cb = () => {}) {\n if (typeof opts === 'function') return this.get(index, null, opts)\n\n if (!this.cache) {\n return queueMicrotask(() => cb(new Error('CacheStore closed')))\n }\n\n if (!opts) opts = {}\n\n let buf = this.cache.get(index)\n if (buf) {\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n if (offset !== 0 || len !== buf.length) {\n buf = buf.slice(offset, len + offset)\n }\n return queueMicrotask(() => cb(null, buf))\n }\n\n // See if a get for this index has already started\n let waiters = this.inProgressGets.get(index)\n const getAlreadyStarted = !!waiters\n if (!waiters) {\n waiters = []\n this.inProgressGets.set(index, waiters)\n }\n\n waiters.push({\n opts,\n cb\n })\n\n if (!getAlreadyStarted) {\n this.store.get(index, (err, buf) => {\n if (!err && this.cache != null) this.cache.set(index, buf)\n\n const inProgressEntry = this.inProgressGets.get(index)\n this.inProgressGets.delete(index)\n\n for (const { opts, cb } of inProgressEntry) {\n if (err) {\n cb(err)\n } else {\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n let slicedBuf = buf\n if (offset !== 0 || len !== buf.length) {\n slicedBuf = buf.slice(offset, len + offset)\n }\n cb(null, slicedBuf)\n }\n }\n })\n }\n }\n\n close (cb = () => {}) {\n if (!this.cache) {\n return queueMicrotask(() => cb(new Error('CacheStore closed')))\n }\n\n this.cache = null\n this.store.close(cb)\n }\n\n destroy (cb = () => {}) {\n if (!this.cache) {\n return queueMicrotask(() => cb(new Error('CacheStore closed')))\n }\n\n this.cache = null\n this.store.destroy(cb)\n }\n}\n\nmodule.exports = CacheStore\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBind = require('./');\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $apply = GetIntrinsic('%Function.prototype.apply%');\nvar $call = GetIntrinsic('%Function.prototype.call%');\nvar $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply);\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true);\nvar $max = GetIntrinsic('%Math.max%');\n\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = null;\n\t}\n}\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = $reflectApply(bind, $call, arguments);\n\tif ($gOPD && $defineProperty) {\n\t\tvar desc = $gOPD(func, 'length');\n\t\tif (desc.configurable) {\n\t\t\t// original length, plus the receiver, minus any additional arguments (after the receiver)\n\t\t\t$defineProperty(\n\t\t\t\tfunc,\n\t\t\t\t'length',\n\t\t\t\t{ value: 1 + $max(0, originalFunction.length - (arguments.length - 1)) }\n\t\t\t);\n\t\t}\n\t}\n\treturn func;\n};\n\nvar applyBind = function applyBind() {\n\treturn $reflectApply(bind, $apply, arguments);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","const BlockStream = require('block-stream2')\nconst stream = require('readable-stream')\n\nclass ChunkStoreWriteStream extends stream.Writable {\n constructor (store, chunkLength, opts = {}) {\n super(opts)\n\n if (!store || !store.put || !store.get) {\n throw new Error('First argument must be an abstract-chunk-store compliant store')\n }\n chunkLength = Number(chunkLength)\n if (!chunkLength) throw new Error('Second argument must be a chunk length')\n\n const zeroPadding = opts.zeroPadding === undefined ? false : opts.zeroPadding\n this._blockstream = new BlockStream(chunkLength, { ...opts, zeroPadding })\n this._outstandingPuts = 0\n this._storeMaxOutstandingPuts = opts.storeMaxOutstandingPuts || 16\n\n let index = 0\n const onData = chunk => {\n if (this.destroyed) return\n\n this._outstandingPuts += 1\n if (this._outstandingPuts >= this._storeMaxOutstandingPuts) {\n this._blockstream.pause()\n }\n store.put(index, chunk, (err) => {\n if (err) return this.destroy(err)\n this._outstandingPuts -= 1\n if (this._outstandingPuts < this._storeMaxOutstandingPuts) {\n this._blockstream.resume()\n }\n if (this._outstandingPuts === 0 && typeof this._finalCb === 'function') {\n this._finalCb(null)\n this._finalCb = null\n }\n })\n index += 1\n }\n\n this._blockstream\n .on('data', onData)\n .on('error', err => { this.destroy(err) })\n }\n\n _write (chunk, encoding, callback) {\n this._blockstream.write(chunk, encoding, callback)\n }\n\n _final (cb) {\n this._blockstream.end()\n this._blockstream.once('end', () => {\n if (this._outstandingPuts === 0) cb(null)\n else this._finalCb = cb\n })\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n\n if (err) this.emit('error', err)\n this.emit('close')\n }\n}\n\nmodule.exports = ChunkStoreWriteStream\n","var Buffer = require('safe-buffer').Buffer\nvar Transform = require('stream').Transform\nvar StringDecoder = require('string_decoder').StringDecoder\nvar inherits = require('inherits')\n\nfunction CipherBase (hashMode) {\n Transform.call(this)\n this.hashMode = typeof hashMode === 'string'\n if (this.hashMode) {\n this[hashMode] = this._finalOrDigest\n } else {\n this.final = this._finalOrDigest\n }\n if (this._final) {\n this.__final = this._final\n this._final = null\n }\n this._decoder = null\n this._encoding = null\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 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 () {}\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 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}\nCipherBase.prototype._flush = function (done) {\n var err\n try {\n this.push(this.__final())\n } catch (e) {\n err = e\n }\n\n done(err)\n}\nCipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer.alloc(0)\n if (outputEnc) {\n outData = this._toString(outData, outputEnc, true)\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 if (fin) {\n out += this._decoder.end()\n }\n\n return out\n}\n\nmodule.exports = CipherBase\n","/*global window, global*/\nvar util = require(\"util\")\nvar assert = require(\"assert\")\nfunction now() { return new Date().getTime() }\n\nvar slice = Array.prototype.slice\nvar console\nvar times = {}\n\nif (typeof global !== \"undefined\" && global.console) {\n console = global.console\n} else if (typeof window !== \"undefined\" && window.console) {\n console = window.console\n} else {\n console = {}\n}\n\nvar functions = [\n [log, \"log\"],\n [info, \"info\"],\n [warn, \"warn\"],\n [error, \"error\"],\n [time, \"time\"],\n [timeEnd, \"timeEnd\"],\n [trace, \"trace\"],\n [dir, \"dir\"],\n [consoleAssert, \"assert\"]\n]\n\nfor (var i = 0; i < functions.length; i++) {\n var tuple = functions[i]\n var f = tuple[0]\n var name = tuple[1]\n\n if (!console[name]) {\n console[name] = f\n }\n}\n\nmodule.exports = console\n\nfunction log() {}\n\nfunction info() {\n console.log.apply(console, arguments)\n}\n\nfunction warn() {\n console.log.apply(console, arguments)\n}\n\nfunction error() {\n console.warn.apply(console, arguments)\n}\n\nfunction time(label) {\n times[label] = now()\n}\n\nfunction timeEnd(label) {\n var time = times[label]\n if (!time) {\n throw new Error(\"No such label: \" + label)\n }\n\n delete times[label]\n var duration = now() - time\n console.log(label + \": \" + duration + \"ms\")\n}\n\nfunction trace() {\n var err = new Error()\n err.name = \"Trace\"\n err.message = util.format.apply(null, arguments)\n console.error(err.stack)\n}\n\nfunction dir(object) {\n console.log(util.inspect(object) + \"\\n\")\n}\n\nfunction consoleAssert(expression) {\n if (!expression) {\n var arr = slice.call(arguments, 1)\n assert.ok(false, util.format.apply(null, arr))\n }\n}\n","module.exports = function cpus () {\n var num = navigator.hardwareConcurrency || 1\n var cpus = []\n for (var i = 0; i < num; i++) {\n cpus.push({\n model: '',\n speed: 0,\n times: { user: 0, nice: 0, sys: 0, idle: 0, irq: 0 }\n })\n }\n return cpus\n}\n","var elliptic = require('elliptic')\nvar BN = require('bn.js')\n\nmodule.exports = function createECDH (curve) {\n return new ECDH(curve)\n}\n\nvar aliases = {\n secp256k1: {\n name: 'secp256k1',\n byteLength: 32\n },\n secp224r1: {\n name: 'p224',\n byteLength: 28\n },\n prime256v1: {\n name: 'p256',\n byteLength: 32\n },\n prime192v1: {\n name: 'p192',\n byteLength: 24\n },\n ed25519: {\n name: 'ed25519',\n byteLength: 32\n },\n secp384r1: {\n name: 'p384',\n byteLength: 48\n },\n secp521r1: {\n name: 'p521',\n byteLength: 66\n }\n}\n\naliases.p224 = aliases.secp224r1\naliases.p256 = aliases.secp256r1 = aliases.prime256v1\naliases.p192 = aliases.secp192r1 = aliases.prime192v1\naliases.p384 = aliases.secp384r1\naliases.p521 = aliases.secp521r1\n\nfunction ECDH (curve) {\n this.curveType = aliases[curve]\n if (!this.curveType) {\n this.curveType = {\n name: curve\n }\n }\n this.curve = new elliptic.ec(this.curveType.name) // eslint-disable-line new-cap\n this.keys = void 0\n}\n\nECDH.prototype.generateKeys = function (enc, format) {\n this.keys = this.curve.genKeyPair()\n return this.getPublicKey(enc, format)\n}\n\nECDH.prototype.computeSecret = function (other, inenc, enc) {\n inenc = inenc || 'utf8'\n if (!Buffer.isBuffer(other)) {\n other = new Buffer(other, inenc)\n }\n var otherPub = this.curve.keyFromPublic(other).getPublic()\n var out = otherPub.mul(this.keys.getPrivate()).getX()\n return formatReturnValue(out, enc, this.curveType.byteLength)\n}\n\nECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === 'compressed', true)\n if (format === 'hybrid') {\n if (key[key.length - 1] % 2) {\n key[0] = 7\n } else {\n key[0] = 6\n }\n }\n return formatReturnValue(key, enc)\n}\n\nECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc)\n}\n\nECDH.prototype.setPublicKey = function (pub, enc) {\n enc = enc || 'utf8'\n if (!Buffer.isBuffer(pub)) {\n pub = new Buffer(pub, enc)\n }\n this.keys._importPublic(pub)\n return this\n}\n\nECDH.prototype.setPrivateKey = function (priv, enc) {\n enc = enc || 'utf8'\n if (!Buffer.isBuffer(priv)) {\n priv = new Buffer(priv, enc)\n }\n\n var _priv = new BN(priv)\n _priv = _priv.toString(16)\n this.keys = this.curve.genKeyPair()\n this.keys._importPrivate(_priv)\n return this\n}\n\nfunction formatReturnValue (bn, enc, len) {\n if (!Array.isArray(bn)) {\n bn = bn.toArray()\n }\n var buf = new Buffer(bn)\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length)\n zeros.fill(0)\n buf = Buffer.concat([zeros, buf])\n }\n if (!enc) {\n return buf\n } else {\n return buf.toString(enc)\n }\n}\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","'use strict'\nvar inherits = require('inherits')\nvar MD5 = require('md5.js')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Base = require('cipher-base')\n\nfunction Hash (hash) {\n Base.call(this, 'digest')\n\n this._hash = hash\n}\n\ninherits(Hash, Base)\n\nHash.prototype._update = function (data) {\n this._hash.update(data)\n}\n\nHash.prototype._final = function () {\n return this._hash.digest()\n}\n\nmodule.exports = function createHash (alg) {\n alg = alg.toLowerCase()\n if (alg === 'md5') return new MD5()\n if (alg === 'rmd160' || alg === 'ripemd160') return new RIPEMD160()\n\n return new Hash(sha(alg))\n}\n","var MD5 = require('md5.js')\n\nmodule.exports = function (buffer) {\n return new MD5().update(buffer).digest()\n}\n","'use strict'\nvar inherits = require('inherits')\nvar Legacy = require('./legacy')\nvar Base = require('cipher-base')\nvar Buffer = require('safe-buffer').Buffer\nvar md5 = require('create-hash/md5')\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 if (typeof key === 'string') {\n key = Buffer.from(key)\n }\n\n var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64\n\n this._alg = alg\n this._key = key\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 this._hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg)\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 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 if (alg === 'rmd160' || alg === 'ripemd160') {\n return new Hmac('rmd160', key)\n }\n if (alg === 'md5') {\n return new Legacy(md5, key)\n }\n return new Hmac(alg, key)\n}\n","'use strict'\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar Base = require('cipher-base')\n\nvar ZEROS = Buffer.alloc(128)\nvar blocksize = 64\n\nfunction Hmac (alg, key) {\n Base.call(this, 'digest')\n if (typeof key === 'string') {\n key = Buffer.from(key)\n }\n\n this._alg = alg\n this._key = key\n\n if (key.length > blocksize) {\n key = alg(key)\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 = [ipad]\n}\n\ninherits(Hmac, Base)\n\nHmac.prototype._update = function (data) {\n this._hash.push(data)\n}\n\nHmac.prototype._final = function () {\n var h = this._alg(Buffer.concat(this._hash))\n return this._alg(Buffer.concat([this._opad, h]))\n}\nmodule.exports = Hmac\n","/*! create-torrent. MIT License. WebTorrent LLC */\nconst bencode = require('bencode')\nconst BlockStream = require('block-stream2')\nconst calcPieceLength = require('piece-length')\nconst corePath = require('path')\nconst FileReadStream = require('filestream/read')\nconst isFile = require('is-file')\nconst junk = require('junk')\nconst MultiStream = require('multistream')\nconst once = require('once')\nconst parallel = require('run-parallel')\nconst queueMicrotask = require('queue-microtask')\nconst sha1 = require('simple-sha1')\nconst stream = require('readable-stream')\n\nconst getFiles = require('./get-files') // browser exclude\n\nconst announceList = [\n ['udp://tracker.leechers-paradise.org:6969'],\n ['udp://tracker.coppersurfer.tk:6969'],\n ['udp://tracker.opentrackr.org:1337'],\n ['udp://explodie.org:6969'],\n ['udp://tracker.empire-js.us:1337'],\n ['wss://tracker.btorrent.xyz'],\n ['wss://tracker.openwebtorrent.com']\n]\n\n/**\n * Create a torrent.\n * @param {string|File|FileList|Buffer|Stream|Array.} input\n * @param {Object} opts\n * @param {string=} opts.name\n * @param {Date=} opts.creationDate\n * @param {string=} opts.comment\n * @param {string=} opts.createdBy\n * @param {boolean|number=} opts.private\n * @param {number=} opts.pieceLength\n * @param {Array.>=} opts.announceList\n * @param {Array.=} opts.urlList\n * @param {Object=} opts.info\n * @param {Function} opts.onProgress\n * @param {function} cb\n * @return {Buffer} buffer of .torrent file data\n */\nfunction createTorrent (input, opts, cb) {\n if (typeof opts === 'function') [opts, cb] = [cb, opts]\n opts = opts ? Object.assign({}, opts) : {}\n\n _parseInput(input, opts, (err, files, singleFileTorrent) => {\n if (err) return cb(err)\n opts.singleFileTorrent = singleFileTorrent\n onFiles(files, opts, cb)\n })\n}\n\nfunction parseInput (input, opts, cb) {\n if (typeof opts === 'function') [opts, cb] = [cb, opts]\n opts = opts ? Object.assign({}, opts) : {}\n _parseInput(input, opts, cb)\n}\n\n/**\n * Parse input file and return file information.\n */\nfunction _parseInput (input, opts, cb) {\n if (isFileList(input)) input = Array.from(input)\n if (!Array.isArray(input)) input = [input]\n\n if (input.length === 0) throw new Error('invalid input type')\n\n input.forEach(item => {\n if (item == null) throw new Error(`invalid input type: ${item}`)\n })\n\n // In Electron, use the true file path\n input = input.map(item => {\n if (isBlob(item) && typeof item.path === 'string' && typeof getFiles === 'function') return item.path\n return item\n })\n\n // If there's just one file, allow the name to be set by `opts.name`\n if (input.length === 1 && typeof input[0] !== 'string' && !input[0].name) input[0].name = opts.name\n\n let commonPrefix = null\n input.forEach((item, i) => {\n if (typeof item === 'string') {\n return\n }\n\n let path = item.fullPath || item.name\n if (!path) {\n path = `Unknown File ${i + 1}`\n item.unknownName = true\n }\n\n item.path = path.split('/')\n\n // Remove initial slash\n if (!item.path[0]) {\n item.path.shift()\n }\n\n if (item.path.length < 2) { // No real prefix\n commonPrefix = null\n } else if (i === 0 && input.length > 1) { // The first file has a prefix\n commonPrefix = item.path[0]\n } else if (item.path[0] !== commonPrefix) { // The prefix doesn't match\n commonPrefix = null\n }\n })\n\n const filterJunkFiles = opts.filterJunkFiles === undefined ? true : opts.filterJunkFiles\n if (filterJunkFiles) {\n // Remove junk files\n input = input.filter(item => {\n if (typeof item === 'string') {\n return true\n }\n return !isJunkPath(item.path)\n })\n }\n\n if (commonPrefix) {\n input.forEach(item => {\n const pathless = (Buffer.isBuffer(item) || isReadable(item)) && !item.path\n if (typeof item === 'string' || pathless) return\n item.path.shift()\n })\n }\n\n if (!opts.name && commonPrefix) {\n opts.name = commonPrefix\n }\n\n if (!opts.name) {\n // use first user-set file name\n input.some(item => {\n if (typeof item === 'string') {\n opts.name = corePath.basename(item)\n return true\n } else if (!item.unknownName) {\n opts.name = item.path[item.path.length - 1]\n return true\n }\n return false\n })\n }\n\n if (!opts.name) {\n opts.name = `Unnamed Torrent ${Date.now()}`\n }\n\n const numPaths = input.reduce((sum, item) => sum + Number(typeof item === 'string'), 0)\n\n let isSingleFileTorrent = (input.length === 1)\n\n if (input.length === 1 && typeof input[0] === 'string') {\n if (typeof getFiles !== 'function') {\n throw new Error('filesystem paths do not work in the browser')\n }\n // If there's a single path, verify it's a file before deciding this is a single\n // file torrent\n isFile(input[0], (err, pathIsFile) => {\n if (err) return cb(err)\n isSingleFileTorrent = pathIsFile\n processInput()\n })\n } else {\n queueMicrotask(processInput)\n }\n\n function processInput () {\n parallel(input.map(item => cb => {\n const file = {}\n\n if (isBlob(item)) {\n file.getStream = getBlobStream(item)\n file.length = item.size\n } else if (Buffer.isBuffer(item)) {\n file.getStream = getBufferStream(item)\n file.length = item.length\n } else if (isReadable(item)) {\n file.getStream = getStreamStream(item, file)\n file.length = 0\n } else if (typeof item === 'string') {\n if (typeof getFiles !== 'function') {\n throw new Error('filesystem paths do not work in the browser')\n }\n const keepRoot = numPaths > 1 || isSingleFileTorrent\n getFiles(item, keepRoot, cb)\n return // early return!\n } else {\n throw new Error('invalid input type')\n }\n file.path = item.path\n cb(null, file)\n }), (err, files) => {\n if (err) return cb(err)\n files = files.flat()\n cb(null, files, isSingleFileTorrent)\n })\n }\n}\n\nconst MAX_OUTSTANDING_HASHES = 5\n\nfunction getPieceList (files, pieceLength, estimatedTorrentLength, opts, cb) {\n cb = once(cb)\n const pieces = []\n let length = 0\n let hashedLength = 0\n\n const streams = files.map(file => file.getStream)\n\n let remainingHashes = 0\n let pieceNum = 0\n let ended = false\n\n const multistream = new MultiStream(streams)\n const blockstream = new BlockStream(pieceLength, { zeroPadding: false })\n\n multistream.on('error', onError)\n\n multistream\n .pipe(blockstream)\n .on('data', onData)\n .on('end', onEnd)\n .on('error', onError)\n\n function onData (chunk) {\n length += chunk.length\n\n const i = pieceNum\n sha1(chunk, hash => {\n pieces[i] = hash\n remainingHashes -= 1\n if (remainingHashes < MAX_OUTSTANDING_HASHES) {\n blockstream.resume()\n }\n hashedLength += chunk.length\n if (opts.onProgress) opts.onProgress(hashedLength, estimatedTorrentLength)\n maybeDone()\n })\n remainingHashes += 1\n if (remainingHashes >= MAX_OUTSTANDING_HASHES) {\n blockstream.pause()\n }\n pieceNum += 1\n }\n\n function onEnd () {\n ended = true\n maybeDone()\n }\n\n function onError (err) {\n cleanup()\n cb(err)\n }\n\n function cleanup () {\n multistream.removeListener('error', onError)\n blockstream.removeListener('data', onData)\n blockstream.removeListener('end', onEnd)\n blockstream.removeListener('error', onError)\n }\n\n function maybeDone () {\n if (ended && remainingHashes === 0) {\n cleanup()\n cb(null, Buffer.from(pieces.join(''), 'hex'), length)\n }\n }\n}\n\nfunction onFiles (files, opts, cb) {\n let announceList = opts.announceList\n\n if (!announceList) {\n if (typeof opts.announce === 'string') announceList = [[opts.announce]]\n else if (Array.isArray(opts.announce)) {\n announceList = opts.announce.map(u => [u])\n }\n }\n\n if (!announceList) announceList = []\n\n if (globalThis.WEBTORRENT_ANNOUNCE) {\n if (typeof globalThis.WEBTORRENT_ANNOUNCE === 'string') {\n announceList.push([[globalThis.WEBTORRENT_ANNOUNCE]])\n } else if (Array.isArray(globalThis.WEBTORRENT_ANNOUNCE)) {\n announceList = announceList.concat(globalThis.WEBTORRENT_ANNOUNCE.map(u => [u]))\n }\n }\n\n // When no trackers specified, use some reasonable defaults\n if (opts.announce === undefined && opts.announceList === undefined) {\n announceList = announceList.concat(module.exports.announceList)\n }\n\n if (typeof opts.urlList === 'string') opts.urlList = [opts.urlList]\n\n const torrent = {\n info: {\n name: opts.name\n },\n 'creation date': Math.ceil((Number(opts.creationDate) || Date.now()) / 1000),\n encoding: 'UTF-8'\n }\n\n if (announceList.length !== 0) {\n torrent.announce = announceList[0][0]\n torrent['announce-list'] = announceList\n }\n\n if (opts.comment !== undefined) torrent.comment = opts.comment\n\n if (opts.createdBy !== undefined) torrent['created by'] = opts.createdBy\n\n if (opts.private !== undefined) torrent.info.private = Number(opts.private)\n\n if (opts.info !== undefined) Object.assign(torrent.info, opts.info)\n\n // \"ssl-cert\" key is for SSL torrents, see:\n // - http://blog.libtorrent.org/2012/01/bittorrent-over-ssl/\n // - http://www.libtorrent.org/manual-ref.html#ssl-torrents\n // - http://www.libtorrent.org/reference-Create_Torrents.html\n if (opts.sslCert !== undefined) torrent.info['ssl-cert'] = opts.sslCert\n\n if (opts.urlList !== undefined) torrent['url-list'] = opts.urlList\n\n const estimatedTorrentLength = files.reduce(sumLength, 0)\n const pieceLength = opts.pieceLength || calcPieceLength(estimatedTorrentLength)\n torrent.info['piece length'] = pieceLength\n\n getPieceList(\n files,\n pieceLength,\n estimatedTorrentLength,\n opts,\n (err, pieces, torrentLength) => {\n if (err) return cb(err)\n torrent.info.pieces = pieces\n\n files.forEach(file => {\n delete file.getStream\n })\n\n if (opts.singleFileTorrent) {\n torrent.info.length = torrentLength\n } else {\n torrent.info.files = files\n }\n\n cb(null, bencode.encode(torrent))\n }\n )\n}\n\n/**\n * Determine if a a file is junk based on its path\n * (defined as hidden OR recognized by the `junk` package)\n *\n * @param {string} path\n * @return {boolean}\n */\nfunction isJunkPath (path) {\n const filename = path[path.length - 1]\n return filename[0] === '.' && junk.is(filename)\n}\n\n/**\n * Accumulator to sum file lengths\n * @param {number} sum\n * @param {Object} file\n * @return {number}\n */\nfunction sumLength (sum, file) {\n return sum + file.length\n}\n\n/**\n * Check if `obj` is a W3C `Blob` object (which `File` inherits from)\n * @param {*} obj\n * @return {boolean}\n */\nfunction isBlob (obj) {\n return typeof Blob !== 'undefined' && obj instanceof Blob\n}\n\n/**\n * Check if `obj` is a W3C `FileList` object\n * @param {*} obj\n * @return {boolean}\n */\nfunction isFileList (obj) {\n return typeof FileList !== 'undefined' && obj instanceof FileList\n}\n\n/**\n * Check if `obj` is a node Readable stream\n * @param {*} obj\n * @return {boolean}\n */\nfunction isReadable (obj) {\n return typeof obj === 'object' && obj != null && typeof obj.pipe === 'function'\n}\n\n/**\n * Convert a `File` to a lazy readable stream.\n * @param {File|Blob} file\n * @return {function}\n */\nfunction getBlobStream (file) {\n return () => new FileReadStream(file)\n}\n\n/**\n * Convert a `Buffer` to a lazy readable stream.\n * @param {Buffer} buffer\n * @return {function}\n */\nfunction getBufferStream (buffer) {\n return () => {\n const s = new stream.PassThrough()\n s.end(buffer)\n return s\n }\n}\n\n/**\n * Convert a readable stream to a lazy readable stream. Adds instrumentation to track\n * the number of bytes in the stream and set `file.length`.\n *\n * @param {Stream} readable\n * @param {Object} file\n * @return {function}\n */\nfunction getStreamStream (readable, file) {\n return () => {\n const counter = new stream.Transform()\n counter._transform = function (buf, enc, done) {\n file.length += buf.length\n this.push(buf)\n done()\n }\n readable.pipe(counter)\n return counter\n }\n}\n\nmodule.exports = createTorrent\nmodule.exports.parseInput = parseInput\nmodule.exports.announceList = announceList\nmodule.exports.isJunkPath = isJunkPath\n","'use strict'\n\nexports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require('randombytes')\nexports.createHash = exports.Hash = require('create-hash')\nexports.createHmac = exports.Hmac = require('create-hmac')\n\nvar algos = require('browserify-sign/algos')\nvar algoKeys = Object.keys(algos)\nvar hashes = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160'].concat(algoKeys)\nexports.getHashes = function () {\n return hashes\n}\n\nvar p = require('pbkdf2')\nexports.pbkdf2 = p.pbkdf2\nexports.pbkdf2Sync = p.pbkdf2Sync\n\nvar aes = require('browserify-cipher')\n\nexports.Cipher = aes.Cipher\nexports.createCipher = aes.createCipher\nexports.Cipheriv = aes.Cipheriv\nexports.createCipheriv = aes.createCipheriv\nexports.Decipher = aes.Decipher\nexports.createDecipher = aes.createDecipher\nexports.Decipheriv = aes.Decipheriv\nexports.createDecipheriv = aes.createDecipheriv\nexports.getCiphers = aes.getCiphers\nexports.listCiphers = aes.listCiphers\n\nvar dh = require('diffie-hellman')\n\nexports.DiffieHellmanGroup = dh.DiffieHellmanGroup\nexports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup\nexports.getDiffieHellman = dh.getDiffieHellman\nexports.createDiffieHellman = dh.createDiffieHellman\nexports.DiffieHellman = dh.DiffieHellman\n\nvar sign = require('browserify-sign')\n\nexports.createSign = sign.createSign\nexports.Sign = sign.Sign\nexports.createVerify = sign.createVerify\nexports.Verify = sign.Verify\n\nexports.createECDH = require('create-ecdh')\n\nvar publicEncrypt = require('public-encrypt')\n\nexports.publicEncrypt = publicEncrypt.publicEncrypt\nexports.privateEncrypt = publicEncrypt.privateEncrypt\nexports.publicDecrypt = publicEncrypt.publicDecrypt\nexports.privateDecrypt = publicEncrypt.privateDecrypt\n\n// the least I can do is make error messages for the rest of the node.js/crypto api.\n// ;[\n// 'createCredentials'\n// ].forEach(function (name) {\n// exports[name] = function () {\n// throw new Error([\n// 'sorry, ' + name + ' is not implemented yet',\n// 'we accept pull requests',\n// 'https://github.com/crypto-browserify/crypto-browserify'\n// ].join('\\n'))\n// }\n// })\n\nvar rf = require('randomfill')\n\nexports.randomFill = rf.randomFill\nexports.randomFillSync = rf.randomFillSync\n\nexports.createCredentials = function () {\n throw new Error([\n 'sorry, createCredentials is not implemented yet',\n 'we accept pull requests',\n 'https://github.com/crypto-browserify/crypto-browserify'\n ].join('\\n'))\n}\n\nexports.constants = {\n 'DH_CHECK_P_NOT_SAFE_PRIME': 2,\n 'DH_CHECK_P_NOT_PRIME': 1,\n 'DH_UNABLE_TO_CHECK_GENERATOR': 4,\n 'DH_NOT_SUITABLE_GENERATOR': 8,\n 'NPN_ENABLED': 1,\n 'ALPN_ENABLED': 1,\n 'RSA_PKCS1_PADDING': 1,\n 'RSA_SSLV23_PADDING': 2,\n 'RSA_NO_PADDING': 3,\n 'RSA_PKCS1_OAEP_PADDING': 4,\n 'RSA_X931_PADDING': 5,\n 'RSA_PKCS1_PSS_PADDING': 6,\n 'POINT_CONVERSION_COMPRESSED': 2,\n 'POINT_CONVERSION_UNCOMPRESSED': 4,\n 'POINT_CONVERSION_HYBRID': 6\n}\n","/* eslint-env browser */\n\n/**\n * This is the web browser implementation of `debug()`.\n */\n\nexports.formatArgs = formatArgs;\nexports.save = save;\nexports.load = load;\nexports.useColors = useColors;\nexports.storage = localstorage();\nexports.destroy = (() => {\n\tlet warned = false;\n\n\treturn () => {\n\t\tif (!warned) {\n\t\t\twarned = true;\n\t\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t\t}\n\t};\n})();\n\n/**\n * Colors.\n */\n\nexports.colors = [\n\t'#0000CC',\n\t'#0000FF',\n\t'#0033CC',\n\t'#0033FF',\n\t'#0066CC',\n\t'#0066FF',\n\t'#0099CC',\n\t'#0099FF',\n\t'#00CC00',\n\t'#00CC33',\n\t'#00CC66',\n\t'#00CC99',\n\t'#00CCCC',\n\t'#00CCFF',\n\t'#3300CC',\n\t'#3300FF',\n\t'#3333CC',\n\t'#3333FF',\n\t'#3366CC',\n\t'#3366FF',\n\t'#3399CC',\n\t'#3399FF',\n\t'#33CC00',\n\t'#33CC33',\n\t'#33CC66',\n\t'#33CC99',\n\t'#33CCCC',\n\t'#33CCFF',\n\t'#6600CC',\n\t'#6600FF',\n\t'#6633CC',\n\t'#6633FF',\n\t'#66CC00',\n\t'#66CC33',\n\t'#9900CC',\n\t'#9900FF',\n\t'#9933CC',\n\t'#9933FF',\n\t'#99CC00',\n\t'#99CC33',\n\t'#CC0000',\n\t'#CC0033',\n\t'#CC0066',\n\t'#CC0099',\n\t'#CC00CC',\n\t'#CC00FF',\n\t'#CC3300',\n\t'#CC3333',\n\t'#CC3366',\n\t'#CC3399',\n\t'#CC33CC',\n\t'#CC33FF',\n\t'#CC6600',\n\t'#CC6633',\n\t'#CC9900',\n\t'#CC9933',\n\t'#CCCC00',\n\t'#CCCC33',\n\t'#FF0000',\n\t'#FF0033',\n\t'#FF0066',\n\t'#FF0099',\n\t'#FF00CC',\n\t'#FF00FF',\n\t'#FF3300',\n\t'#FF3333',\n\t'#FF3366',\n\t'#FF3399',\n\t'#FF33CC',\n\t'#FF33FF',\n\t'#FF6600',\n\t'#FF6633',\n\t'#FF9900',\n\t'#FF9933',\n\t'#FFCC00',\n\t'#FFCC33'\n];\n\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n\n// eslint-disable-next-line complexity\nfunction useColors() {\n\t// NB: In an Electron preload script, document will be defined but not fully\n\t// initialized. Since we know we're in Chrome, we'll just detect this case\n\t// explicitly\n\tif (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {\n\t\treturn true;\n\t}\n\n\t// Internet Explorer and Edge do not support colors.\n\tif (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\\/(\\d+)/)) {\n\t\treturn false;\n\t}\n\n\t// Is webkit? http://stackoverflow.com/a/16459606/376773\n\t// document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n\treturn (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||\n\t\t// Is firebug? http://stackoverflow.com/a/398120/376773\n\t\t(typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n\t\t// Is firefox >= v31?\n\t\t// https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/) && parseInt(RegExp.$1, 10) >= 31) ||\n\t\t// Double check webkit in userAgent just in case we are in a worker\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n\n/**\n * Colorize log arguments if enabled.\n *\n * @api public\n */\n\nfunction formatArgs(args) {\n\targs[0] = (this.useColors ? '%c' : '') +\n\t\tthis.namespace +\n\t\t(this.useColors ? ' %c' : ' ') +\n\t\targs[0] +\n\t\t(this.useColors ? '%c ' : ' ') +\n\t\t'+' + module.exports.humanize(this.diff);\n\n\tif (!this.useColors) {\n\t\treturn;\n\t}\n\n\tconst c = 'color: ' + this.color;\n\targs.splice(1, 0, c, 'color: inherit');\n\n\t// The final \"%c\" is somewhat tricky, because there could be other\n\t// arguments passed either before or after the %c, so we need to\n\t// figure out the correct index to insert the CSS into\n\tlet index = 0;\n\tlet lastC = 0;\n\targs[0].replace(/%[a-zA-Z%]/g, match => {\n\t\tif (match === '%%') {\n\t\t\treturn;\n\t\t}\n\t\tindex++;\n\t\tif (match === '%c') {\n\t\t\t// We only are interested in the *last* %c\n\t\t\t// (the user may have provided their own)\n\t\t\tlastC = index;\n\t\t}\n\t});\n\n\targs.splice(lastC, 0, c);\n}\n\n/**\n * Invokes `console.debug()` when available.\n * No-op when `console.debug` is not a \"function\".\n * If `console.debug` is not available, falls back\n * to `console.log`.\n *\n * @api public\n */\nexports.log = console.debug || console.log || (() => {});\n\n/**\n * Save `namespaces`.\n *\n * @param {String} namespaces\n * @api private\n */\nfunction save(namespaces) {\n\ttry {\n\t\tif (namespaces) {\n\t\t\texports.storage.setItem('debug', namespaces);\n\t\t} else {\n\t\t\texports.storage.removeItem('debug');\n\t\t}\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\n/**\n * Load `namespaces`.\n *\n * @return {String} returns the previously persisted debug modes\n * @api private\n */\nfunction load() {\n\tlet r;\n\ttry {\n\t\tr = exports.storage.getItem('debug');\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n\n\t// If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n\tif (!r && typeof process !== 'undefined' && 'env' in process) {\n\t\tr = process.env.DEBUG;\n\t}\n\n\treturn r;\n}\n\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n *\n * @return {LocalStorage}\n * @api private\n */\n\nfunction localstorage() {\n\ttry {\n\t\t// TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context\n\t\t// The Browser also has localStorage in the global context.\n\t\treturn localStorage;\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\nmodule.exports = require('./common')(exports);\n\nconst {formatters} = module.exports;\n\n/**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n\nformatters.j = function (v) {\n\ttry {\n\t\treturn JSON.stringify(v);\n\t} catch (error) {\n\t\treturn '[UnexpectedJSONParseError]: ' + error.message;\n\t}\n};\n","\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n */\n\nfunction setup(env) {\n\tcreateDebug.debug = createDebug;\n\tcreateDebug.default = createDebug;\n\tcreateDebug.coerce = coerce;\n\tcreateDebug.disable = disable;\n\tcreateDebug.enable = enable;\n\tcreateDebug.enabled = enabled;\n\tcreateDebug.humanize = require('ms');\n\tcreateDebug.destroy = destroy;\n\n\tObject.keys(env).forEach(key => {\n\t\tcreateDebug[key] = env[key];\n\t});\n\n\t/**\n\t* The currently active debug mode names, and names to skip.\n\t*/\n\n\tcreateDebug.names = [];\n\tcreateDebug.skips = [];\n\n\t/**\n\t* Map of special \"%n\" handling functions, for the debug \"format\" argument.\n\t*\n\t* Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n\t*/\n\tcreateDebug.formatters = {};\n\n\t/**\n\t* Selects a color for a debug namespace\n\t* @param {String} namespace The namespace string for the for the debug instance to be colored\n\t* @return {Number|String} An ANSI color code for the given namespace\n\t* @api private\n\t*/\n\tfunction selectColor(namespace) {\n\t\tlet hash = 0;\n\n\t\tfor (let i = 0; i < namespace.length; i++) {\n\t\t\thash = ((hash << 5) - hash) + namespace.charCodeAt(i);\n\t\t\thash |= 0; // Convert to 32bit integer\n\t\t}\n\n\t\treturn createDebug.colors[Math.abs(hash) % createDebug.colors.length];\n\t}\n\tcreateDebug.selectColor = selectColor;\n\n\t/**\n\t* Create a debugger with the given `namespace`.\n\t*\n\t* @param {String} namespace\n\t* @return {Function}\n\t* @api public\n\t*/\n\tfunction createDebug(namespace) {\n\t\tlet prevTime;\n\t\tlet enableOverride = null;\n\t\tlet namespacesCache;\n\t\tlet enabledCache;\n\n\t\tfunction debug(...args) {\n\t\t\t// Disabled?\n\t\t\tif (!debug.enabled) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst self = debug;\n\n\t\t\t// Set `diff` timestamp\n\t\t\tconst curr = Number(new Date());\n\t\t\tconst ms = curr - (prevTime || curr);\n\t\t\tself.diff = ms;\n\t\t\tself.prev = prevTime;\n\t\t\tself.curr = curr;\n\t\t\tprevTime = curr;\n\n\t\t\targs[0] = createDebug.coerce(args[0]);\n\n\t\t\tif (typeof args[0] !== 'string') {\n\t\t\t\t// Anything else let's inspect with %O\n\t\t\t\targs.unshift('%O');\n\t\t\t}\n\n\t\t\t// Apply any `formatters` transformations\n\t\t\tlet index = 0;\n\t\t\targs[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {\n\t\t\t\t// If we encounter an escaped % then don't increase the array index\n\t\t\t\tif (match === '%%') {\n\t\t\t\t\treturn '%';\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t\tconst formatter = createDebug.formatters[format];\n\t\t\t\tif (typeof formatter === 'function') {\n\t\t\t\t\tconst val = args[index];\n\t\t\t\t\tmatch = formatter.call(self, val);\n\n\t\t\t\t\t// Now we need to remove `args[index]` since it's inlined in the `format`\n\t\t\t\t\targs.splice(index, 1);\n\t\t\t\t\tindex--;\n\t\t\t\t}\n\t\t\t\treturn match;\n\t\t\t});\n\n\t\t\t// Apply env-specific formatting (colors, etc.)\n\t\t\tcreateDebug.formatArgs.call(self, args);\n\n\t\t\tconst logFn = self.log || createDebug.log;\n\t\t\tlogFn.apply(self, args);\n\t\t}\n\n\t\tdebug.namespace = namespace;\n\t\tdebug.useColors = createDebug.useColors();\n\t\tdebug.color = createDebug.selectColor(namespace);\n\t\tdebug.extend = extend;\n\t\tdebug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.\n\n\t\tObject.defineProperty(debug, 'enabled', {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\tget: () => {\n\t\t\t\tif (enableOverride !== null) {\n\t\t\t\t\treturn enableOverride;\n\t\t\t\t}\n\t\t\t\tif (namespacesCache !== createDebug.namespaces) {\n\t\t\t\t\tnamespacesCache = createDebug.namespaces;\n\t\t\t\t\tenabledCache = createDebug.enabled(namespace);\n\t\t\t\t}\n\n\t\t\t\treturn enabledCache;\n\t\t\t},\n\t\t\tset: v => {\n\t\t\t\tenableOverride = v;\n\t\t\t}\n\t\t});\n\n\t\t// Env-specific initialization logic for debug instances\n\t\tif (typeof createDebug.init === 'function') {\n\t\t\tcreateDebug.init(debug);\n\t\t}\n\n\t\treturn debug;\n\t}\n\n\tfunction extend(namespace, delimiter) {\n\t\tconst newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);\n\t\tnewDebug.log = this.log;\n\t\treturn newDebug;\n\t}\n\n\t/**\n\t* Enables a debug mode by namespaces. This can include modes\n\t* separated by a colon and wildcards.\n\t*\n\t* @param {String} namespaces\n\t* @api public\n\t*/\n\tfunction enable(namespaces) {\n\t\tcreateDebug.save(namespaces);\n\t\tcreateDebug.namespaces = namespaces;\n\n\t\tcreateDebug.names = [];\n\t\tcreateDebug.skips = [];\n\n\t\tlet i;\n\t\tconst split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n\t\tconst len = split.length;\n\n\t\tfor (i = 0; i < len; i++) {\n\t\t\tif (!split[i]) {\n\t\t\t\t// ignore empty strings\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tnamespaces = split[i].replace(/\\*/g, '.*?');\n\n\t\t\tif (namespaces[0] === '-') {\n\t\t\t\tcreateDebug.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));\n\t\t\t} else {\n\t\t\t\tcreateDebug.names.push(new RegExp('^' + namespaces + '$'));\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t* Disable debug output.\n\t*\n\t* @return {String} namespaces\n\t* @api public\n\t*/\n\tfunction disable() {\n\t\tconst namespaces = [\n\t\t\t...createDebug.names.map(toNamespace),\n\t\t\t...createDebug.skips.map(toNamespace).map(namespace => '-' + namespace)\n\t\t].join(',');\n\t\tcreateDebug.enable('');\n\t\treturn namespaces;\n\t}\n\n\t/**\n\t* Returns true if the given mode name is enabled, false otherwise.\n\t*\n\t* @param {String} name\n\t* @return {Boolean}\n\t* @api public\n\t*/\n\tfunction enabled(name) {\n\t\tif (name[name.length - 1] === '*') {\n\t\t\treturn true;\n\t\t}\n\n\t\tlet i;\n\t\tlet len;\n\n\t\tfor (i = 0, len = createDebug.skips.length; i < len; i++) {\n\t\t\tif (createDebug.skips[i].test(name)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (i = 0, len = createDebug.names.length; i < len; i++) {\n\t\t\tif (createDebug.names[i].test(name)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/**\n\t* Convert regexp to namespace\n\t*\n\t* @param {RegExp} regxep\n\t* @return {String} namespace\n\t* @api private\n\t*/\n\tfunction toNamespace(regexp) {\n\t\treturn regexp.toString()\n\t\t\t.substring(2, regexp.toString().length - 2)\n\t\t\t.replace(/\\.\\*\\?$/, '*');\n\t}\n\n\t/**\n\t* Coerce `val`.\n\t*\n\t* @param {Mixed} val\n\t* @return {Mixed}\n\t* @api private\n\t*/\n\tfunction coerce(val) {\n\t\tif (val instanceof Error) {\n\t\t\treturn val.stack || val.message;\n\t\t}\n\t\treturn val;\n\t}\n\n\t/**\n\t* XXX DO NOT USE. This is a temporary stub function.\n\t* XXX It WILL be removed in the next major release.\n\t*/\n\tfunction destroy() {\n\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t}\n\n\tcreateDebug.enable(createDebug.load());\n\n\treturn createDebug;\n}\n\nmodule.exports = setup;\n","'use strict';\n\nvar keys = require('object-keys');\nvar hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol';\n\nvar toStr = Object.prototype.toString;\nvar concat = Array.prototype.concat;\nvar origDefineProperty = Object.defineProperty;\n\nvar isFunction = function (fn) {\n\treturn typeof fn === 'function' && toStr.call(fn) === '[object Function]';\n};\n\nvar arePropertyDescriptorsSupported = function () {\n\tvar obj = {};\n\ttry {\n\t\torigDefineProperty(obj, 'x', { enumerable: false, value: obj });\n\t\t// eslint-disable-next-line no-unused-vars, no-restricted-syntax\n\t\tfor (var _ in obj) { // jscs:ignore disallowUnusedVariables\n\t\t\treturn false;\n\t\t}\n\t\treturn obj.x === obj;\n\t} catch (e) { /* this is IE 8. */\n\t\treturn false;\n\t}\n};\nvar supportsDescriptors = origDefineProperty && arePropertyDescriptorsSupported();\n\nvar defineProperty = function (object, name, value, predicate) {\n\tif (name in object && (!isFunction(predicate) || !predicate())) {\n\t\treturn;\n\t}\n\tif (supportsDescriptors) {\n\t\torigDefineProperty(object, name, {\n\t\t\tconfigurable: true,\n\t\t\tenumerable: false,\n\t\t\tvalue: value,\n\t\t\twritable: true\n\t\t});\n\t} else {\n\t\tobject[name] = value;\n\t}\n};\n\nvar defineProperties = function (object, map) {\n\tvar predicates = arguments.length > 2 ? arguments[2] : {};\n\tvar props = keys(map);\n\tif (hasSymbols) {\n\t\tprops = concat.call(props, Object.getOwnPropertySymbols(map));\n\t}\n\tfor (var i = 0; i < props.length; i += 1) {\n\t\tdefineProperty(object, props[i], map[props[i]], predicates[props[i]]);\n\t}\n};\n\ndefineProperties.supportsDescriptors = !!supportsDescriptors;\n\nmodule.exports = defineProperties;\n","'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');\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar proto = {};\n\nfunction CBCState(iv) {\n assert.equal(iv.length, 8, 'Invalid IV length');\n\n this.iv = new Array(8);\n for (var i = 0; i < this.iv.length; i++)\n this.iv[i] = iv[i];\n}\n\nfunction instantiate(Base) {\n function CBC(options) {\n Base.call(this, options);\n this._cbcInit();\n }\n inherits(CBC, Base);\n\n var keys = Object.keys(proto);\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n\n CBC.create = function create(options) {\n return new CBC(options);\n };\n\n return CBC;\n}\n\nexports.instantiate = instantiate;\n\nproto._cbcInit = function _cbcInit() {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n};\n\nproto._update = function _update(inp, inOff, out, outOff) {\n var state = this._cbcState;\n var superProto = this.constructor.super_.prototype;\n\n var iv = state.iv;\n if (this.type === 'encrypt') {\n for (var i = 0; i < this.blockSize; i++)\n iv[i] ^= inp[inOff + i];\n\n superProto._update.call(this, iv, 0, out, outOff);\n\n for (var i = 0; i < this.blockSize; i++)\n iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n\n for (var i = 0; i < this.blockSize; i++)\n out[outOff + i] ^= iv[i];\n\n for (var i = 0; i < this.blockSize; i++)\n iv[i] = inp[inOff + i];\n }\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\n\nfunction Cipher(options) {\n this.options = options;\n\n this.type = this.options.type;\n this.blockSize = 8;\n this._init();\n\n this.buffer = new Array(this.blockSize);\n this.bufferOff = 0;\n}\nmodule.exports = Cipher;\n\nCipher.prototype._init = function _init() {\n // Might be overrided\n};\n\nCipher.prototype.update = function update(data) {\n if (data.length === 0)\n return [];\n\n if (this.type === 'decrypt')\n return this._updateDecrypt(data);\n else\n return this._updateEncrypt(data);\n};\n\nCipher.prototype._buffer = function _buffer(data, off) {\n // Append data to buffer\n var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);\n for (var i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n this.bufferOff += min;\n\n // Shift next\n return min;\n};\n\nCipher.prototype._flushBuffer = function _flushBuffer(out, off) {\n this._update(this.buffer, 0, out, off);\n this.bufferOff = 0;\n return this.blockSize;\n};\n\nCipher.prototype._updateEncrypt = function _updateEncrypt(data) {\n var inputOff = 0;\n var outputOff = 0;\n\n var count = ((this.bufferOff + data.length) / this.blockSize) | 0;\n var out = new Array(count * this.blockSize);\n\n if (this.bufferOff !== 0) {\n inputOff += this._buffer(data, inputOff);\n\n if (this.bufferOff === this.buffer.length)\n outputOff += this._flushBuffer(out, outputOff);\n }\n\n // Write blocks\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n for (; inputOff < max; inputOff += this.blockSize) {\n this._update(data, inputOff, out, outputOff);\n outputOff += this.blockSize;\n }\n\n // Queue rest\n for (; inputOff < data.length; inputOff++, this.bufferOff++)\n this.buffer[this.bufferOff] = data[inputOff];\n\n return out;\n};\n\nCipher.prototype._updateDecrypt = function _updateDecrypt(data) {\n var inputOff = 0;\n var outputOff = 0;\n\n var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;\n var out = new Array(count * this.blockSize);\n\n // TODO(indutny): optimize it, this is far from optimal\n for (; count > 0; count--) {\n inputOff += this._buffer(data, inputOff);\n outputOff += this._flushBuffer(out, outputOff);\n }\n\n // Buffer rest of the input\n inputOff += this._buffer(data, inputOff);\n\n return out;\n};\n\nCipher.prototype.final = function final(buffer) {\n var first;\n if (buffer)\n first = this.update(buffer);\n\n var last;\n if (this.type === 'encrypt')\n last = this._finalEncrypt();\n else\n last = this._finalDecrypt();\n\n if (first)\n return first.concat(last);\n else\n return last;\n};\n\nCipher.prototype._pad = function _pad(buffer, off) {\n if (off === 0)\n return false;\n\n while (off < buffer.length)\n buffer[off++] = 0;\n\n return true;\n};\n\nCipher.prototype._finalEncrypt = function _finalEncrypt() {\n if (!this._pad(this.buffer, this.bufferOff))\n return [];\n\n var out = new Array(this.blockSize);\n this._update(this.buffer, 0, out, 0);\n return out;\n};\n\nCipher.prototype._unpad = function _unpad(buffer) {\n return buffer;\n};\n\nCipher.prototype._finalDecrypt = function _finalDecrypt() {\n assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');\n var out = new Array(this.blockSize);\n this._flushBuffer(out, 0);\n\n return this._unpad(out);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar utils = require('./utils');\nvar Cipher = require('./cipher');\n\nfunction DESState() {\n this.tmp = new Array(2);\n this.keys = null;\n}\n\nfunction DES(options) {\n Cipher.call(this, options);\n\n var state = new DESState();\n this._desState = state;\n\n this.deriveKeys(state, options.key);\n}\ninherits(DES, Cipher);\nmodule.exports = DES;\n\nDES.create = function create(options) {\n return new DES(options);\n};\n\nvar shiftTable = [\n 1, 1, 2, 2, 2, 2, 2, 2,\n 1, 2, 2, 2, 2, 2, 2, 1\n];\n\nDES.prototype.deriveKeys = function deriveKeys(state, key) {\n state.keys = new Array(16 * 2);\n\n assert.equal(key.length, this.blockSize, 'Invalid key length');\n\n var kL = utils.readUInt32BE(key, 0);\n var kR = utils.readUInt32BE(key, 4);\n\n utils.pc1(kL, kR, state.tmp, 0);\n kL = state.tmp[0];\n kR = state.tmp[1];\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n kL = utils.r28shl(kL, shift);\n kR = utils.r28shl(kR, shift);\n utils.pc2(kL, kR, state.keys, i);\n }\n};\n\nDES.prototype._update = function _update(inp, inOff, out, outOff) {\n var state = this._desState;\n\n var l = utils.readUInt32BE(inp, inOff);\n var r = utils.readUInt32BE(inp, inOff + 4);\n\n // Initial Permutation\n utils.ip(l, r, state.tmp, 0);\n l = state.tmp[0];\n r = state.tmp[1];\n\n if (this.type === 'encrypt')\n this._encrypt(state, l, r, state.tmp, 0);\n else\n this._decrypt(state, l, r, state.tmp, 0);\n\n l = state.tmp[0];\n r = state.tmp[1];\n\n utils.writeUInt32BE(out, l, outOff);\n utils.writeUInt32BE(out, r, outOff + 4);\n};\n\nDES.prototype._pad = function _pad(buffer, off) {\n var value = buffer.length - off;\n for (var i = off; i < buffer.length; i++)\n buffer[i] = value;\n\n return true;\n};\n\nDES.prototype._unpad = function _unpad(buffer) {\n var pad = buffer[buffer.length - 1];\n for (var i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n\n return buffer.slice(0, buffer.length - pad);\n};\n\nDES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {\n var l = lStart;\n var r = rStart;\n\n // Apply f() x16 times\n for (var i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i];\n var keyR = state.keys[i + 1];\n\n // f(r, k)\n utils.expand(r, state.tmp, 0);\n\n keyL ^= state.tmp[0];\n keyR ^= state.tmp[1];\n var s = utils.substitute(keyL, keyR);\n var f = utils.permute(s);\n\n var t = r;\n r = (l ^ f) >>> 0;\n l = t;\n }\n\n // Reverse Initial Permutation\n utils.rip(r, l, out, off);\n};\n\nDES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {\n var l = rStart;\n var r = lStart;\n\n // Apply f() x16 times\n for (var i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i];\n var keyR = state.keys[i + 1];\n\n // f(r, k)\n utils.expand(l, state.tmp, 0);\n\n keyL ^= state.tmp[0];\n keyR ^= state.tmp[1];\n var s = utils.substitute(keyL, keyR);\n var f = utils.permute(s);\n\n var t = l;\n l = (r ^ f) >>> 0;\n r = t;\n }\n\n // Reverse Initial Permutation\n utils.rip(l, r, out, off);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar Cipher = require('./cipher');\nvar DES = require('./des');\n\nfunction EDEState(type, key) {\n assert.equal(key.length, 24, 'Invalid key length');\n\n var k1 = key.slice(0, 8);\n var k2 = key.slice(8, 16);\n var k3 = key.slice(16, 24);\n\n if (type === 'encrypt') {\n this.ciphers = [\n DES.create({ type: 'encrypt', key: k1 }),\n DES.create({ type: 'decrypt', key: k2 }),\n DES.create({ type: 'encrypt', key: k3 })\n ];\n } else {\n this.ciphers = [\n DES.create({ type: 'decrypt', key: k3 }),\n DES.create({ type: 'encrypt', key: k2 }),\n DES.create({ type: 'decrypt', key: k1 })\n ];\n }\n}\n\nfunction EDE(options) {\n Cipher.call(this, options);\n\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n}\ninherits(EDE, Cipher);\n\nmodule.exports = EDE;\n\nEDE.create = function create(options) {\n return new EDE(options);\n};\n\nEDE.prototype._update = function _update(inp, inOff, out, outOff) {\n var state = this._edeState;\n\n state.ciphers[0]._update(inp, inOff, out, outOff);\n state.ciphers[1]._update(out, outOff, out, outOff);\n state.ciphers[2]._update(out, outOff, out, outOff);\n};\n\nEDE.prototype._pad = DES.prototype._pad;\nEDE.prototype._unpad = DES.prototype._unpad;\n","'use strict';\n\nexports.readUInt32BE = function readUInt32BE(bytes, off) {\n var res = (bytes[0 + off] << 24) |\n (bytes[1 + off] << 16) |\n (bytes[2 + off] << 8) |\n bytes[3 + off];\n return res >>> 0;\n};\n\nexports.writeUInt32BE = function writeUInt32BE(bytes, value, off) {\n bytes[0 + off] = value >>> 24;\n bytes[1 + off] = (value >>> 16) & 0xff;\n bytes[2 + off] = (value >>> 8) & 0xff;\n bytes[3 + off] = value & 0xff;\n};\n\nexports.ip = function ip(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >>> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inL >>> (j + i)) & 1;\n }\n }\n\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) {\n outR <<= 1;\n outR |= (inR >>> (j + i)) & 1;\n }\n for (var j = 1; j <= 25; j += 8) {\n outR <<= 1;\n outR |= (inL >>> (j + i)) & 1;\n }\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.rip = function rip(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n for (var i = 0; i < 4; i++) {\n for (var j = 24; j >= 0; j -= 8) {\n outL <<= 1;\n outL |= (inR >>> (j + i)) & 1;\n outL <<= 1;\n outL |= (inL >>> (j + i)) & 1;\n }\n }\n for (var i = 4; i < 8; i++) {\n for (var j = 24; j >= 0; j -= 8) {\n outR <<= 1;\n outR |= (inR >>> (j + i)) & 1;\n outR <<= 1;\n outR |= (inL >>> (j + i)) & 1;\n }\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.pc1 = function pc1(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n // 7, 15, 23, 31, 39, 47, 55, 63\n // 6, 14, 22, 30, 39, 47, 55, 63\n // 5, 13, 21, 29, 39, 47, 55, 63\n // 4, 12, 20, 28\n for (var i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inL >> (j + i)) & 1;\n }\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >> (j + i)) & 1;\n }\n\n // 1, 9, 17, 25, 33, 41, 49, 57\n // 2, 10, 18, 26, 34, 42, 50, 58\n // 3, 11, 19, 27, 35, 43, 51, 59\n // 36, 44, 52, 60\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inR >> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inL >> (j + i)) & 1;\n }\n }\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inL >> (j + i)) & 1;\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.r28shl = function r28shl(num, shift) {\n return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));\n};\n\nvar pc2table = [\n // inL => outL\n 14, 11, 17, 4, 27, 23, 25, 0,\n 13, 22, 7, 18, 5, 9, 16, 24,\n 2, 20, 12, 21, 1, 8, 15, 26,\n\n // inR => outR\n 15, 4, 25, 19, 9, 1, 26, 16,\n 5, 11, 23, 8, 12, 7, 17, 0,\n 22, 3, 10, 14, 6, 20, 27, 24\n];\n\nexports.pc2 = function pc2(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n var len = pc2table.length >>> 1;\n for (var i = 0; i < len; i++) {\n outL <<= 1;\n outL |= (inL >>> pc2table[i]) & 0x1;\n }\n for (var i = len; i < pc2table.length; i++) {\n outR <<= 1;\n outR |= (inR >>> pc2table[i]) & 0x1;\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.expand = function expand(r, out, off) {\n var outL = 0;\n var outR = 0;\n\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) {\n outL <<= 6;\n outL |= (r >>> i) & 0x3f;\n }\n for (var i = 11; i >= 3; i -= 4) {\n outR |= (r >>> i) & 0x3f;\n outR <<= 6;\n }\n outR |= ((r & 0x1f) << 1) | (r >>> 31);\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nvar sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,\n 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,\n 4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,\n 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,\n\n 15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,\n 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,\n 0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,\n 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,\n\n 10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,\n 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,\n 13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,\n 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,\n\n 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,\n 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,\n 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,\n 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,\n\n 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,\n 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,\n 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,\n\n 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,\n 0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,\n 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,\n 7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,\n\n 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,\n 3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,\n 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,\n 10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,\n\n 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,\n 10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,\n 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,\n 0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11\n];\n\nexports.substitute = function substitute(inL, inR) {\n var out = 0;\n for (var i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 0x3f;\n var sb = sTable[i * 0x40 + b];\n\n out <<= 4;\n out |= sb;\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 0x3f;\n var sb = sTable[4 * 0x40 + i * 0x40 + b];\n\n out <<= 4;\n out |= sb;\n }\n return out >>> 0;\n};\n\nvar permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,\n 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7\n];\n\nexports.permute = function permute(num) {\n var out = 0;\n for (var i = 0; i < permuteTable.length; i++) {\n out <<= 1;\n out |= (num >>> permuteTable[i]) & 0x1;\n }\n return out >>> 0;\n};\n\nexports.padSplit = function padSplit(num, size, group) {\n var str = num.toString(2);\n while (str.length < size)\n str = '0' + str;\n\n var out = [];\n for (var i = 0; i < size; i += group)\n out.push(str.slice(i, i + group));\n return out.join(' ');\n};\n","var generatePrime = require('./lib/generatePrime')\nvar primes = require('./lib/primes.json')\n\nvar DH = require('./lib/dh')\n\nfunction getDiffieHellman (mod) {\n var prime = new Buffer(primes[mod].prime, 'hex')\n var gen = new Buffer(primes[mod].gen, 'hex')\n\n return new DH(prime, gen)\n}\n\nvar ENCODINGS = {\n 'binary': true, 'hex': true, 'base64': true\n}\n\nfunction createDiffieHellman (prime, enc, generator, genc) {\n if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {\n return createDiffieHellman(prime, 'binary', enc, generator)\n }\n\n enc = enc || 'binary'\n genc = genc || 'binary'\n generator = generator || new Buffer([2])\n\n if (!Buffer.isBuffer(generator)) {\n generator = new Buffer(generator, genc)\n }\n\n if (typeof prime === 'number') {\n return new DH(generatePrime(prime, generator), generator, true)\n }\n\n if (!Buffer.isBuffer(prime)) {\n prime = new Buffer(prime, enc)\n }\n\n return new DH(prime, generator, true)\n}\n\nexports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman\nexports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman\n","var BN = require('bn.js');\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar TWENTYFOUR = new BN(24);\nvar ELEVEN = new BN(11);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar primes = require('./generatePrime');\nvar randomBytes = require('randombytes');\nmodule.exports = DH;\n\nfunction setPublicKey(pub, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(pub)) {\n pub = new Buffer(pub, enc);\n }\n this._pub = new BN(pub);\n return this;\n}\n\nfunction setPrivateKey(priv, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(priv)) {\n priv = new Buffer(priv, enc);\n }\n this._priv = new BN(priv);\n return this;\n}\n\nvar primeCache = {};\nfunction checkPrime(prime, generator) {\n var gen = generator.toString('hex');\n var hex = [gen, prime.toString(16)].join('_');\n if (hex in primeCache) {\n return primeCache[hex];\n }\n var error = 0;\n\n if (prime.isEven() ||\n !primes.simpleSieve ||\n !primes.fermatTest(prime) ||\n !millerRabin.test(prime)) {\n //not a prime so +1\n error += 1;\n\n if (gen === '02' || gen === '05') {\n // we'd be able to check the generator\n // it would fail so +8\n error += 8;\n } else {\n //we wouldn't be able to test the generator\n // so +4\n error += 4;\n }\n primeCache[hex] = error;\n return error;\n }\n if (!millerRabin.test(prime.shrn(1))) {\n //not a safe prime\n error += 2;\n }\n var rem;\n switch (gen) {\n case '02':\n if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) {\n // unsuidable generator\n error += 8;\n }\n break;\n case '05':\n rem = prime.mod(TEN);\n if (rem.cmp(THREE) && rem.cmp(SEVEN)) {\n // prime mod 10 needs to equal 3 or 7\n error += 8;\n }\n break;\n default:\n error += 4;\n }\n primeCache[hex] = error;\n return error;\n}\n\nfunction DH(prime, generator, malleable) {\n this.setGenerator(generator);\n this.__prime = new BN(prime);\n this._prime = BN.mont(this.__prime);\n this._primeLen = prime.length;\n this._pub = undefined;\n this._priv = undefined;\n this._primeCode = undefined;\n if (malleable) {\n this.setPublicKey = setPublicKey;\n this.setPrivateKey = setPrivateKey;\n } else {\n this._primeCode = 8;\n }\n}\nObject.defineProperty(DH.prototype, 'verifyError', {\n enumerable: true,\n get: function () {\n if (typeof this._primeCode !== 'number') {\n this._primeCode = checkPrime(this.__prime, this.__gen);\n }\n return this._primeCode;\n }\n});\nDH.prototype.generateKeys = function () {\n if (!this._priv) {\n this._priv = new BN(randomBytes(this._primeLen));\n }\n this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();\n return this.getPublicKey();\n};\n\nDH.prototype.computeSecret = function (other) {\n other = new BN(other);\n other = other.toRed(this._prime);\n var secret = other.redPow(this._priv).fromRed();\n var out = new Buffer(secret.toArray());\n var prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0);\n out = Buffer.concat([front, out]);\n }\n return out;\n};\n\nDH.prototype.getPublicKey = function getPublicKey(enc) {\n return formatReturnValue(this._pub, enc);\n};\n\nDH.prototype.getPrivateKey = function getPrivateKey(enc) {\n return formatReturnValue(this._priv, enc);\n};\n\nDH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n};\n\nDH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n};\n\nDH.prototype.setGenerator = function (gen, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(gen)) {\n gen = new Buffer(gen, enc);\n }\n this.__gen = gen;\n this._gen = new BN(gen);\n return this;\n};\n\nfunction formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n if (!enc) {\n return buf;\n } else {\n return buf.toString(enc);\n }\n}\n","var randomBytes = require('randombytes');\nmodule.exports = findPrime;\nfindPrime.simpleSieve = simpleSieve;\nfindPrime.fermatTest = fermatTest;\nvar BN = require('bn.js');\nvar TWENTYFOUR = new BN(24);\nvar MillerRabin = require('miller-rabin');\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)\n return primes;\n\n var limit = 0x100000;\n var res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n var sqrt = Math.ceil(Math.sqrt(k));\n for (var j = 0; j < i && res[j] <= sqrt; j++)\n if (k % res[j] === 0)\n break;\n\n if (i !== j && res[j] <= sqrt)\n continue;\n\n res[i++] = k;\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 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 gen = new BN(gen);\n\n var num, n2;\n\n while (true) {\n num = new BN(randomBytes(Math.ceil(bits / 8)));\n while (num.bitLength() > bits) {\n num.ishrn(1);\n }\n if (num.isEven()) {\n num.iadd(ONE);\n }\n if (!num.testn(1)) {\n num.iadd(TWO);\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 n2 = num.shrn(1);\n if (simpleSieve(n2) && simpleSieve(num) &&\n fermatTest(n2) && fermatTest(num) &&\n millerRabin.test(n2) && millerRabin.test(num)) {\n return num;\n }\n }\n\n}\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst stream_1 = require(\"stream\");\nconst tools_1 = require(\"./tools\");\nconst EbmlElementType_1 = require(\"./models/enums/EbmlElementType\");\nconst EbmlTagPosition_1 = require(\"./models/enums/EbmlTagPosition\");\nconst EbmlTagFactory_1 = require(\"./models/EbmlTagFactory\");\nclass EbmlStreamDecoderOptions {\n constructor() {\n this.bufferTagIds = [];\n }\n}\nexports.EbmlStreamDecoderOptions = EbmlStreamDecoderOptions;\nclass EbmlStreamDecoder extends stream_1.Transform {\n constructor(options = {}) {\n super(Object.assign({}, options, { readableObjectMode: true }));\n this._currentBufferOffset = 0;\n this._tagStack = [];\n this._buffer = Buffer.alloc(0);\n this._bufferTagIds = [];\n this._bufferTagIds = options.bufferTagIds || [];\n }\n get buffer() {\n return this._buffer;\n }\n _transform(chunk, enc, done) {\n this._buffer = Buffer.concat([this._buffer, Buffer.from(chunk)]);\n while (this.parseTags())\n ;\n done();\n }\n parseTags() {\n const currentTag = this.readTagHeader(this._buffer);\n if (!currentTag) {\n return false;\n }\n if (currentTag.type === EbmlElementType_1.EbmlElementType.Master && !this._bufferTagIds.some(i => i === currentTag.id)) {\n this._tagStack.push(currentTag);\n this.emitTag(currentTag, EbmlTagPosition_1.EbmlTagPosition.Start);\n this.advanceBuffer(currentTag.tagHeaderLength);\n return true;\n }\n else {\n if (this._buffer.length < currentTag.tagHeaderLength + currentTag.size) {\n return false;\n }\n const data = this._buffer.slice(currentTag.tagHeaderLength, currentTag.tagHeaderLength + currentTag.size);\n this.emitTag(currentTag, EbmlTagPosition_1.EbmlTagPosition.Content, data);\n this.advanceBuffer(currentTag.tagHeaderLength + currentTag.size);\n while (this._tagStack.length > 0) {\n const nextTag = this._tagStack[this._tagStack.length - 1];\n if (this._currentBufferOffset < (nextTag.absoluteStart + nextTag.tagHeaderLength + nextTag.size)) {\n break;\n }\n this.emitTag(nextTag, EbmlTagPosition_1.EbmlTagPosition.End);\n this._tagStack.pop();\n }\n }\n return true;\n }\n advanceBuffer(length) {\n this._currentBufferOffset += length;\n this._buffer = this._buffer.slice(length);\n }\n readTagHeader(buffer, offset = 0) {\n if (buffer.length == 0) {\n return null;\n }\n const tag = tools_1.Tools.readVint(buffer, offset);\n if (tag == null) {\n return null;\n }\n const size = tools_1.Tools.readVint(buffer, offset + tag.length);\n if (size == null) {\n return null;\n }\n const tagIdHex = tools_1.Tools.readHexString(buffer, offset, offset + tag.length);\n const tagId = Number.parseInt(tagIdHex, 16);\n let tagObject = EbmlTagFactory_1.EbmlTagFactory.create(tagId);\n tagObject.size = size.value;\n return Object.assign(tagObject, {\n absoluteStart: this._currentBufferOffset + offset,\n tagHeaderLength: tag.length + size.length\n });\n }\n emitTag(tag, position, data) {\n let emittedTag = EbmlTagFactory_1.EbmlTagFactory.create(tag.id);\n emittedTag.size = tag.size;\n emittedTag.position = position;\n if (position === EbmlTagPosition_1.EbmlTagPosition.Content) {\n emittedTag.parseContent(data);\n }\n this.push(emittedTag);\n }\n}\nexports.EbmlStreamDecoder = EbmlStreamDecoder;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst stream_1 = require(\"stream\");\nconst EbmlTagPosition_1 = require(\"./models/enums/EbmlTagPosition\");\nconst EbmlTagId_1 = require(\"./models/enums/EbmlTagId\");\nclass EbmlStreamEncoder extends stream_1.Transform {\n constructor(options = {}) {\n super(Object.assign({}, options, { writableObjectMode: true }));\n this.dataBuffer = Buffer.alloc(0);\n this.mCorked = false;\n this.openTags = [];\n }\n _transform(chunk, enc, done) {\n if (chunk) {\n if (!chunk.id) {\n throw new Error(`No id found for ${JSON.stringify(chunk)}`);\n }\n switch (chunk.position) {\n case EbmlTagPosition_1.EbmlTagPosition.Start:\n this.startTag(chunk);\n break;\n case EbmlTagPosition_1.EbmlTagPosition.Content:\n this.writeTag(chunk);\n break;\n case EbmlTagPosition_1.EbmlTagPosition.End:\n this.endTag(chunk);\n break;\n default:\n break;\n }\n }\n done();\n }\n bufferAndFlush(buffer) {\n this.dataBuffer = Buffer.concat([this.dataBuffer, buffer]);\n this._flush(() => { });\n }\n _flush(callback) {\n let chunk = null;\n if (this.dataBuffer.length > 0 && !this.mCorked) {\n chunk = Buffer.from(this.dataBuffer);\n this.dataBuffer = Buffer.alloc(0);\n this.push(chunk);\n }\n callback();\n }\n _bufferAndFlush(buffer) {\n this.bufferAndFlush(buffer);\n }\n flush() {\n this._flush(() => { });\n }\n get buffer() {\n return this.dataBuffer;\n }\n set buffer(val) {\n this.dataBuffer = val;\n }\n get stack() {\n return this.openTags;\n }\n cork() {\n this.mCorked = true;\n }\n uncork() {\n this.mCorked = false;\n this._flush(() => { });\n }\n writeTag(tag) {\n if (this.openTags.length > 0) {\n this.openTags[this.openTags.length - 1].Children.push(tag);\n }\n else {\n this.bufferAndFlush(tag.encode());\n }\n }\n startTag(tag) {\n if (this.openTags.length > 0) {\n this.openTags[this.openTags.length - 1].Children.push(tag);\n }\n this.openTags.push(tag);\n }\n endTag(tag) {\n const inMemoryTag = this.openTags.pop();\n if (tag.id !== inMemoryTag.id) {\n throw `Logic error - closing tag \"${EbmlTagId_1.EbmlTagId[tag.id]}\" is not expected tag \"${EbmlTagId_1.EbmlTagId[inMemoryTag.id]}\"`;\n }\n if (this.openTags.length < 1) {\n this.bufferAndFlush(inMemoryTag.encode());\n }\n }\n}\nexports.EbmlStreamEncoder = EbmlStreamEncoder;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar tools_1 = require(\"./tools\");\nexports.Tools = tools_1.Tools;\nvar EbmlStreamDecoder_1 = require(\"./EbmlStreamDecoder\");\nexports.EbmlStreamDecoder = EbmlStreamDecoder_1.EbmlStreamDecoder;\nvar EbmlStreamEncoder_1 = require(\"./EbmlStreamEncoder\");\nexports.EbmlStreamEncoder = EbmlStreamEncoder_1.EbmlStreamEncoder;\nvar Block_1 = require(\"./models/tags/Block\");\nexports.Block = Block_1.Block;\nvar BlockLacing_1 = require(\"./models/enums/BlockLacing\");\nexports.BlockLacing = BlockLacing_1.BlockLacing;\nvar EbmlDataTag_1 = require(\"./models/tags/EbmlDataTag\");\nexports.EbmlDataTag = EbmlDataTag_1.EbmlDataTag;\nvar EbmlElementType_1 = require(\"./models/enums/EbmlElementType\");\nexports.EbmlElementType = EbmlElementType_1.EbmlElementType;\nvar EbmlMasterTag_1 = require(\"./models/tags/EbmlMasterTag\");\nexports.EbmlMasterTag = EbmlMasterTag_1.EbmlMasterTag;\nvar EbmlTag_1 = require(\"./models/EbmlTag\");\nexports.EbmlTag = EbmlTag_1.EbmlTag;\nvar EbmlTagFactory_1 = require(\"./models/EbmlTagFactory\");\nexports.EbmlTagFactory = EbmlTagFactory_1.EbmlTagFactory;\nvar EbmlTagId_1 = require(\"./models/enums/EbmlTagId\");\nexports.EbmlTagId = EbmlTagId_1.EbmlTagId;\nvar EbmlTagPosition_1 = require(\"./models/enums/EbmlTagPosition\");\nexports.EbmlTagPosition = EbmlTagPosition_1.EbmlTagPosition;\nvar SimpleBlock_1 = require(\"./models/tags/SimpleBlock\");\nexports.SimpleBlock = SimpleBlock_1.SimpleBlock;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlTagId_1 = require(\"./enums/EbmlTagId\");\nconst tools_1 = require(\"../tools\");\nclass EbmlTag {\n constructor(id, type, position) {\n this.id = id;\n this.type = type;\n this.position = position;\n }\n getTagDeclaration() {\n let tagHex = this.id.toString(16);\n if (tagHex.length % 2 !== 0) {\n tagHex = `0${tagHex}`;\n }\n return Buffer.from(tagHex, 'hex');\n }\n encode() {\n let vintSize = null;\n let content = this.encodeContent();\n if (this.size === -1) {\n vintSize = Buffer.from('01ffffffffffffff', 'hex');\n }\n else {\n let specialLength = undefined;\n if ([\n EbmlTagId_1.EbmlTagId.Segment,\n EbmlTagId_1.EbmlTagId.Cluster\n ].some(i => i === this.id)) {\n specialLength = 8;\n }\n vintSize = tools_1.Tools.writeVint(content.length, specialLength);\n }\n return Buffer.concat([\n this.getTagDeclaration(),\n vintSize,\n content\n ]);\n }\n}\nexports.EbmlTag = EbmlTag;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlTagId_1 = require(\"./enums/EbmlTagId\");\nconst EbmlMasterTag_1 = require(\"./tags/EbmlMasterTag\");\nconst EbmlDataTag_1 = require(\"./tags/EbmlDataTag\");\nconst Block_1 = require(\"./tags/Block\");\nconst SimpleBlock_1 = require(\"./tags/SimpleBlock\");\nconst EbmlElementType_1 = require(\"./enums/EbmlElementType\");\nclass EbmlTagFactory {\n static create(id, type) {\n if (EbmlTagId_1.EbmlTagId[id] !== undefined) {\n let foundType;\n switch (id) {\n case EbmlTagId_1.EbmlTagId.Block:\n return new Block_1.Block();\n case EbmlTagId_1.EbmlTagId.SimpleBlock:\n return new SimpleBlock_1.SimpleBlock();\n case EbmlTagId_1.EbmlTagId.ChapterDisplay:\n case EbmlTagId_1.EbmlTagId.ContentCompression:\n case EbmlTagId_1.EbmlTagId.ContentEncryption:\n case EbmlTagId_1.EbmlTagId.SilentTracks:\n case EbmlTagId_1.EbmlTagId.ContentEncoding:\n case EbmlTagId_1.EbmlTagId.TrackTranslate:\n case EbmlTagId_1.EbmlTagId.ChapProcessCommand:\n case EbmlTagId_1.EbmlTagId.ChapterTranslate:\n case EbmlTagId_1.EbmlTagId.ChapProcess:\n case EbmlTagId_1.EbmlTagId.Tag:\n case EbmlTagId_1.EbmlTagId.Segment:\n case EbmlTagId_1.EbmlTagId.SimpleTag:\n case EbmlTagId_1.EbmlTagId.Targets:\n case EbmlTagId_1.EbmlTagId.Tags:\n case EbmlTagId_1.EbmlTagId.ChapterTrack:\n case EbmlTagId_1.EbmlTagId.ChapterAtom:\n case EbmlTagId_1.EbmlTagId.EditionEntry:\n case EbmlTagId_1.EbmlTagId.Chapters:\n case EbmlTagId_1.EbmlTagId.AttachedFile:\n case EbmlTagId_1.EbmlTagId.Attachments:\n case EbmlTagId_1.EbmlTagId.CueReference:\n case EbmlTagId_1.EbmlTagId.CueTrackPositions:\n case EbmlTagId_1.EbmlTagId.CuePoint:\n case EbmlTagId_1.EbmlTagId.Cues:\n case EbmlTagId_1.EbmlTagId.ContentEncAESSettings:\n case EbmlTagId_1.EbmlTagId.ContentEncodings:\n case EbmlTagId_1.EbmlTagId.TrackJoinBlocks:\n case EbmlTagId_1.EbmlTagId.TrackPlane:\n case EbmlTagId_1.EbmlTagId.TrackCombinePlanes:\n case EbmlTagId_1.EbmlTagId.TrackOperation:\n case EbmlTagId_1.EbmlTagId.Audio:\n case EbmlTagId_1.EbmlTagId.Video:\n case EbmlTagId_1.EbmlTagId.TrackEntry:\n case EbmlTagId_1.EbmlTagId.Tracks:\n case EbmlTagId_1.EbmlTagId.ReferenceFrame:\n case EbmlTagId_1.EbmlTagId.TimeSlice:\n case EbmlTagId_1.EbmlTagId.Slices:\n case EbmlTagId_1.EbmlTagId.BlockMore:\n case EbmlTagId_1.EbmlTagId.BlockAdditions:\n case EbmlTagId_1.EbmlTagId.BlockGroup:\n case EbmlTagId_1.EbmlTagId.Cluster:\n case EbmlTagId_1.EbmlTagId.Info:\n case EbmlTagId_1.EbmlTagId.Seek:\n case EbmlTagId_1.EbmlTagId.SeekHead:\n case EbmlTagId_1.EbmlTagId.SignatureElementList:\n case EbmlTagId_1.EbmlTagId.SignatureElements:\n case EbmlTagId_1.EbmlTagId.SignatureSlot:\n case EbmlTagId_1.EbmlTagId.EBML:\n foundType = EbmlElementType_1.EbmlElementType.Master;\n break;\n case EbmlTagId_1.EbmlTagId.TrackType:\n case EbmlTagId_1.EbmlTagId.FlagDefault:\n case EbmlTagId_1.EbmlTagId.ChapterTrackNumber:\n case EbmlTagId_1.EbmlTagId.ChapterTimeStart:\n case EbmlTagId_1.EbmlTagId.ChapterTimeEnd:\n case EbmlTagId_1.EbmlTagId.CueRefTime:\n case EbmlTagId_1.EbmlTagId.CueRefCluster:\n case EbmlTagId_1.EbmlTagId.ChapterFlagHidden:\n case EbmlTagId_1.EbmlTagId.ContentCompAlgo:\n case EbmlTagId_1.EbmlTagId.DocTypeReadVersion:\n case EbmlTagId_1.EbmlTagId.EBMLVersion:\n case EbmlTagId_1.EbmlTagId.DocTypeVersion:\n case EbmlTagId_1.EbmlTagId.TagDefault:\n case EbmlTagId_1.EbmlTagId.ChapterFlagEnabled:\n case EbmlTagId_1.EbmlTagId.FileUsedStartTime:\n case EbmlTagId_1.EbmlTagId.FileUsedEndTime:\n case EbmlTagId_1.EbmlTagId.ContentEncodingOrder:\n case EbmlTagId_1.EbmlTagId.ContentEncodingScope:\n case EbmlTagId_1.EbmlTagId.ContentEncodingType:\n case EbmlTagId_1.EbmlTagId.CueBlockNumber:\n case EbmlTagId_1.EbmlTagId.BitDepth:\n case EbmlTagId_1.EbmlTagId.ChapProcessTime:\n case EbmlTagId_1.EbmlTagId.ChapProcessCodecID:\n case EbmlTagId_1.EbmlTagId.AttachmentLink:\n case EbmlTagId_1.EbmlTagId.TagAttachmentUID:\n case EbmlTagId_1.EbmlTagId.TagChapterUID:\n case EbmlTagId_1.EbmlTagId.TagEditionUID:\n case EbmlTagId_1.EbmlTagId.TagTrackUID:\n case EbmlTagId_1.EbmlTagId.TargetTypeValue:\n case EbmlTagId_1.EbmlTagId.ChapterPhysicalEquiv:\n case EbmlTagId_1.EbmlTagId.ChapterSegmentEditionUID:\n case EbmlTagId_1.EbmlTagId.ChapterUID:\n case EbmlTagId_1.EbmlTagId.EditionFlagOrdered:\n case EbmlTagId_1.EbmlTagId.EditionFlagDefault:\n case EbmlTagId_1.EbmlTagId.EditionFlagHidden:\n case EbmlTagId_1.EbmlTagId.EditionUID:\n case EbmlTagId_1.EbmlTagId.FileUID:\n case EbmlTagId_1.EbmlTagId.CueRefCodecState:\n case EbmlTagId_1.EbmlTagId.CueRefNumber:\n case EbmlTagId_1.EbmlTagId.CueCodecState:\n case EbmlTagId_1.EbmlTagId.CueDuration:\n case EbmlTagId_1.EbmlTagId.CueRelativePosition:\n case EbmlTagId_1.EbmlTagId.CueClusterPosition:\n case EbmlTagId_1.EbmlTagId.CueTrack:\n case EbmlTagId_1.EbmlTagId.CueTime:\n case EbmlTagId_1.EbmlTagId.AESSettingsCipherMode:\n case EbmlTagId_1.EbmlTagId.ContentSigHashAlgo:\n case EbmlTagId_1.EbmlTagId.ContentSigAlgo:\n case EbmlTagId_1.EbmlTagId.ContentEncAlgo:\n case EbmlTagId_1.EbmlTagId.TrickMasterTrackUID:\n case EbmlTagId_1.EbmlTagId.TrickTrackFlag:\n case EbmlTagId_1.EbmlTagId.TrickTrackUID:\n case EbmlTagId_1.EbmlTagId.TrackJoinUID:\n case EbmlTagId_1.EbmlTagId.TrackPlaneType:\n case EbmlTagId_1.EbmlTagId.TrackPlaneUID:\n case EbmlTagId_1.EbmlTagId.Channels:\n case EbmlTagId_1.EbmlTagId.AspectRatioType:\n case EbmlTagId_1.EbmlTagId.DisplayUnit:\n case EbmlTagId_1.EbmlTagId.DisplayHeight:\n case EbmlTagId_1.EbmlTagId.DisplayWidth:\n case EbmlTagId_1.EbmlTagId.PixelCropRight:\n case EbmlTagId_1.EbmlTagId.PixelCropLeft:\n case EbmlTagId_1.EbmlTagId.PixelCropTop:\n case EbmlTagId_1.EbmlTagId.PixelCropBottom:\n case EbmlTagId_1.EbmlTagId.PixelHeight:\n case EbmlTagId_1.EbmlTagId.PixelWidth:\n case EbmlTagId_1.EbmlTagId.OldStereoMode:\n case EbmlTagId_1.EbmlTagId.AlphaMode:\n case EbmlTagId_1.EbmlTagId.StereoMode:\n case EbmlTagId_1.EbmlTagId.FlagInterlaced:\n case EbmlTagId_1.EbmlTagId.TrackTranslateCodec:\n case EbmlTagId_1.EbmlTagId.TrackTranslateEditionUID:\n case EbmlTagId_1.EbmlTagId.SeekPreRoll:\n case EbmlTagId_1.EbmlTagId.CodecDelay:\n case EbmlTagId_1.EbmlTagId.TrackOverlay:\n case EbmlTagId_1.EbmlTagId.CodecDecodeAll:\n case EbmlTagId_1.EbmlTagId.MaxBlockAdditionID:\n case EbmlTagId_1.EbmlTagId.DefaultDecodedFieldDuration:\n case EbmlTagId_1.EbmlTagId.DefaultDuration:\n case EbmlTagId_1.EbmlTagId.MaxCache:\n case EbmlTagId_1.EbmlTagId.MinCache:\n case EbmlTagId_1.EbmlTagId.FlagLacing:\n case EbmlTagId_1.EbmlTagId.FlagForced:\n case EbmlTagId_1.EbmlTagId.FlagEnabled:\n case EbmlTagId_1.EbmlTagId.TrackUID:\n case EbmlTagId_1.EbmlTagId.TrackNumber:\n case EbmlTagId_1.EbmlTagId.ReferenceTimeCode:\n case EbmlTagId_1.EbmlTagId.ReferenceOffset:\n case EbmlTagId_1.EbmlTagId.SliceDuration:\n case EbmlTagId_1.EbmlTagId.Delay:\n case EbmlTagId_1.EbmlTagId.BlockAdditionID:\n case EbmlTagId_1.EbmlTagId.FrameNumber:\n case EbmlTagId_1.EbmlTagId.LaceNumber:\n case EbmlTagId_1.EbmlTagId.ReferencePriority:\n case EbmlTagId_1.EbmlTagId.BlockDuration:\n case EbmlTagId_1.EbmlTagId.BlockAddID:\n case EbmlTagId_1.EbmlTagId.PrevSize:\n case EbmlTagId_1.EbmlTagId.Position:\n case EbmlTagId_1.EbmlTagId.SilentTrackNumber:\n case EbmlTagId_1.EbmlTagId.Timecode:\n case EbmlTagId_1.EbmlTagId.TimecodeScaleDenominator:\n case EbmlTagId_1.EbmlTagId.TimecodeScale:\n case EbmlTagId_1.EbmlTagId.ChapterTranslateCodec:\n case EbmlTagId_1.EbmlTagId.ChapterTranslateEditionUID:\n case EbmlTagId_1.EbmlTagId.SeekPosition:\n case EbmlTagId_1.EbmlTagId.SignatureHash:\n case EbmlTagId_1.EbmlTagId.SignatureAlgo:\n case EbmlTagId_1.EbmlTagId.EBMLMaxSizeLength:\n case EbmlTagId_1.EbmlTagId.EBMLMaxIDLength:\n case EbmlTagId_1.EbmlTagId.EBMLReadVersion:\n foundType = EbmlElementType_1.EbmlElementType.UnsignedInt;\n break;\n case EbmlTagId_1.EbmlTagId.TrackOffset:\n case EbmlTagId_1.EbmlTagId.DiscardPadding:\n case EbmlTagId_1.EbmlTagId.ReferenceVirtual:\n case EbmlTagId_1.EbmlTagId.ReferenceBlock:\n foundType = EbmlElementType_1.EbmlElementType.Integer;\n break;\n case EbmlTagId_1.EbmlTagId.CodecID:\n case EbmlTagId_1.EbmlTagId.DocType:\n case EbmlTagId_1.EbmlTagId.FileMimeType:\n case EbmlTagId_1.EbmlTagId.TagLanguage:\n case EbmlTagId_1.EbmlTagId.TargetType:\n case EbmlTagId_1.EbmlTagId.ChapCountry:\n case EbmlTagId_1.EbmlTagId.ChapLanguage:\n case EbmlTagId_1.EbmlTagId.CodecDownloadURL:\n case EbmlTagId_1.EbmlTagId.CodecInfoURL:\n case EbmlTagId_1.EbmlTagId.Language:\n foundType = EbmlElementType_1.EbmlElementType.String;\n break;\n case EbmlTagId_1.EbmlTagId.ChapString:\n case EbmlTagId_1.EbmlTagId.TagString:\n case EbmlTagId_1.EbmlTagId.ChapterStringUID:\n case EbmlTagId_1.EbmlTagId.WritingApp:\n case EbmlTagId_1.EbmlTagId.SegmentFilename:\n case EbmlTagId_1.EbmlTagId.CodecName:\n case EbmlTagId_1.EbmlTagId.TagName:\n case EbmlTagId_1.EbmlTagId.FileName:\n case EbmlTagId_1.EbmlTagId.FileDescription:\n case EbmlTagId_1.EbmlTagId.CodecSettings:\n case EbmlTagId_1.EbmlTagId.Name:\n case EbmlTagId_1.EbmlTagId.MuxingApp:\n case EbmlTagId_1.EbmlTagId.Title:\n case EbmlTagId_1.EbmlTagId.NextFilename:\n case EbmlTagId_1.EbmlTagId.PrevFilename:\n foundType = EbmlElementType_1.EbmlElementType.UTF8;\n break;\n case EbmlTagId_1.EbmlTagId.ContentCompSettings:\n case EbmlTagId_1.EbmlTagId.SegmentFamily:\n case EbmlTagId_1.EbmlTagId.TagBinary:\n case EbmlTagId_1.EbmlTagId.FileReferral:\n case EbmlTagId_1.EbmlTagId.SignedElement:\n case EbmlTagId_1.EbmlTagId.ChapProcessData:\n case EbmlTagId_1.EbmlTagId.ChapProcessPrivate:\n case EbmlTagId_1.EbmlTagId.ChapterSegmentUID:\n case EbmlTagId_1.EbmlTagId.FileData:\n case EbmlTagId_1.EbmlTagId.ContentSigKeyID:\n case EbmlTagId_1.EbmlTagId.ContentSignature:\n case EbmlTagId_1.EbmlTagId.ContentEncKeyID:\n case EbmlTagId_1.EbmlTagId.TrickMasterTrackSegmentUID:\n case EbmlTagId_1.EbmlTagId.TrickTrackSegmentUID:\n case EbmlTagId_1.EbmlTagId.ChannelPositions:\n case EbmlTagId_1.EbmlTagId.ColourSpace:\n case EbmlTagId_1.EbmlTagId.TrackTranslateTrackID:\n case EbmlTagId_1.EbmlTagId.CodecPrivate:\n case EbmlTagId_1.EbmlTagId.EncryptedBlock:\n case EbmlTagId_1.EbmlTagId.CodecState:\n case EbmlTagId_1.EbmlTagId.BlockAdditional:\n case EbmlTagId_1.EbmlTagId.BlockVirtual:\n case EbmlTagId_1.EbmlTagId.ChapterTranslateID:\n case EbmlTagId_1.EbmlTagId.NextUID:\n case EbmlTagId_1.EbmlTagId.PrevUID:\n case EbmlTagId_1.EbmlTagId.SegmentUID:\n case EbmlTagId_1.EbmlTagId.SeekID:\n case EbmlTagId_1.EbmlTagId.Signature:\n case EbmlTagId_1.EbmlTagId.SignaturePublicKey:\n case EbmlTagId_1.EbmlTagId.CRC32:\n case EbmlTagId_1.EbmlTagId.Void:\n foundType = EbmlElementType_1.EbmlElementType.Binary;\n break;\n case EbmlTagId_1.EbmlTagId.Duration:\n case EbmlTagId_1.EbmlTagId.OutputSamplingFrequency:\n case EbmlTagId_1.EbmlTagId.SamplingFrequency:\n case EbmlTagId_1.EbmlTagId.FrameRate:\n case EbmlTagId_1.EbmlTagId.GammaValue:\n case EbmlTagId_1.EbmlTagId.TrackTimecodeScale:\n foundType = EbmlElementType_1.EbmlElementType.Float;\n break;\n case EbmlTagId_1.EbmlTagId.DateUTC:\n foundType = EbmlElementType_1.EbmlElementType.Date;\n break;\n }\n if (type === undefined) {\n type = foundType;\n }\n else {\n if (type !== foundType) {\n throw new Error(`Trying to create tag of well-known type \"${EbmlTagId_1.EbmlTagId[id]}\" using content type \"${type}\" (which is incorrect). Either pass the correct type or ignore the type parameter to EbmlTag.create()`);\n }\n }\n }\n switch (type) {\n case EbmlElementType_1.EbmlElementType.Master:\n return new EbmlMasterTag_1.EbmlMasterTag(id);\n case EbmlElementType_1.EbmlElementType.UTF8:\n case EbmlElementType_1.EbmlElementType.Binary:\n case EbmlElementType_1.EbmlElementType.Date:\n case EbmlElementType_1.EbmlElementType.Float:\n case EbmlElementType_1.EbmlElementType.Integer:\n case EbmlElementType_1.EbmlElementType.String:\n case EbmlElementType_1.EbmlElementType.UnsignedInt:\n default:\n return new EbmlDataTag_1.EbmlDataTag(id, type);\n }\n }\n}\nexports.EbmlTagFactory = EbmlTagFactory;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar BlockLacing;\n(function (BlockLacing) {\n BlockLacing[BlockLacing[\"None\"] = 0] = \"None\";\n BlockLacing[BlockLacing[\"Xiph\"] = 1] = \"Xiph\";\n BlockLacing[BlockLacing[\"EBML\"] = 2] = \"EBML\";\n BlockLacing[BlockLacing[\"FixedSize\"] = 3] = \"FixedSize\";\n})(BlockLacing = exports.BlockLacing || (exports.BlockLacing = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar EbmlElementType;\n(function (EbmlElementType) {\n EbmlElementType[\"Master\"] = \"m\";\n EbmlElementType[\"UnsignedInt\"] = \"u\";\n EbmlElementType[\"Integer\"] = \"i\";\n EbmlElementType[\"String\"] = \"s\";\n EbmlElementType[\"UTF8\"] = \"8\";\n EbmlElementType[\"Binary\"] = \"b\";\n EbmlElementType[\"Float\"] = \"f\";\n EbmlElementType[\"Date\"] = \"d\";\n})(EbmlElementType = exports.EbmlElementType || (exports.EbmlElementType = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar EbmlTagId;\n(function (EbmlTagId) {\n EbmlTagId[EbmlTagId[\"ChapterDisplay\"] = 128] = \"ChapterDisplay\";\n EbmlTagId[EbmlTagId[\"TrackType\"] = 131] = \"TrackType\";\n EbmlTagId[EbmlTagId[\"ChapString\"] = 133] = \"ChapString\";\n EbmlTagId[EbmlTagId[\"CodecID\"] = 134] = \"CodecID\";\n EbmlTagId[EbmlTagId[\"FlagDefault\"] = 136] = \"FlagDefault\";\n EbmlTagId[EbmlTagId[\"ChapterTrackNumber\"] = 137] = \"ChapterTrackNumber\";\n EbmlTagId[EbmlTagId[\"ChapterTimeStart\"] = 145] = \"ChapterTimeStart\";\n EbmlTagId[EbmlTagId[\"ChapterTimeEnd\"] = 146] = \"ChapterTimeEnd\";\n EbmlTagId[EbmlTagId[\"CueRefTime\"] = 150] = \"CueRefTime\";\n EbmlTagId[EbmlTagId[\"CueRefCluster\"] = 151] = \"CueRefCluster\";\n EbmlTagId[EbmlTagId[\"ChapterFlagHidden\"] = 152] = \"ChapterFlagHidden\";\n EbmlTagId[EbmlTagId[\"ContentCompAlgo\"] = 16980] = \"ContentCompAlgo\";\n EbmlTagId[EbmlTagId[\"ContentCompSettings\"] = 16981] = \"ContentCompSettings\";\n EbmlTagId[EbmlTagId[\"DocType\"] = 17026] = \"DocType\";\n EbmlTagId[EbmlTagId[\"DocTypeReadVersion\"] = 17029] = \"DocTypeReadVersion\";\n EbmlTagId[EbmlTagId[\"EBMLVersion\"] = 17030] = \"EBMLVersion\";\n EbmlTagId[EbmlTagId[\"DocTypeVersion\"] = 17031] = \"DocTypeVersion\";\n EbmlTagId[EbmlTagId[\"SegmentFamily\"] = 17476] = \"SegmentFamily\";\n EbmlTagId[EbmlTagId[\"DateUTC\"] = 17505] = \"DateUTC\";\n EbmlTagId[EbmlTagId[\"TagDefault\"] = 17540] = \"TagDefault\";\n EbmlTagId[EbmlTagId[\"TagBinary\"] = 17541] = \"TagBinary\";\n EbmlTagId[EbmlTagId[\"TagString\"] = 17543] = \"TagString\";\n EbmlTagId[EbmlTagId[\"Duration\"] = 17545] = \"Duration\";\n EbmlTagId[EbmlTagId[\"ChapterFlagEnabled\"] = 17816] = \"ChapterFlagEnabled\";\n EbmlTagId[EbmlTagId[\"FileMimeType\"] = 18016] = \"FileMimeType\";\n EbmlTagId[EbmlTagId[\"FileUsedStartTime\"] = 18017] = \"FileUsedStartTime\";\n EbmlTagId[EbmlTagId[\"FileUsedEndTime\"] = 18018] = \"FileUsedEndTime\";\n EbmlTagId[EbmlTagId[\"FileReferral\"] = 18037] = \"FileReferral\";\n EbmlTagId[EbmlTagId[\"ContentEncodingOrder\"] = 20529] = \"ContentEncodingOrder\";\n EbmlTagId[EbmlTagId[\"ContentEncodingScope\"] = 20530] = \"ContentEncodingScope\";\n EbmlTagId[EbmlTagId[\"ContentEncodingType\"] = 20531] = \"ContentEncodingType\";\n EbmlTagId[EbmlTagId[\"ContentCompression\"] = 20532] = \"ContentCompression\";\n EbmlTagId[EbmlTagId[\"ContentEncryption\"] = 20533] = \"ContentEncryption\";\n EbmlTagId[EbmlTagId[\"CueBlockNumber\"] = 21368] = \"CueBlockNumber\";\n EbmlTagId[EbmlTagId[\"ChapterStringUID\"] = 22100] = \"ChapterStringUID\";\n EbmlTagId[EbmlTagId[\"WritingApp\"] = 22337] = \"WritingApp\";\n EbmlTagId[EbmlTagId[\"SilentTracks\"] = 22612] = \"SilentTracks\";\n EbmlTagId[EbmlTagId[\"ContentEncoding\"] = 25152] = \"ContentEncoding\";\n EbmlTagId[EbmlTagId[\"BitDepth\"] = 25188] = \"BitDepth\";\n EbmlTagId[EbmlTagId[\"SignedElement\"] = 25906] = \"SignedElement\";\n EbmlTagId[EbmlTagId[\"TrackTranslate\"] = 26148] = \"TrackTranslate\";\n EbmlTagId[EbmlTagId[\"ChapProcessCommand\"] = 26897] = \"ChapProcessCommand\";\n EbmlTagId[EbmlTagId[\"ChapProcessTime\"] = 26914] = \"ChapProcessTime\";\n EbmlTagId[EbmlTagId[\"ChapterTranslate\"] = 26916] = \"ChapterTranslate\";\n EbmlTagId[EbmlTagId[\"ChapProcessData\"] = 26931] = \"ChapProcessData\";\n EbmlTagId[EbmlTagId[\"ChapProcess\"] = 26948] = \"ChapProcess\";\n EbmlTagId[EbmlTagId[\"ChapProcessCodecID\"] = 26965] = \"ChapProcessCodecID\";\n EbmlTagId[EbmlTagId[\"Tag\"] = 29555] = \"Tag\";\n EbmlTagId[EbmlTagId[\"SegmentFilename\"] = 29572] = \"SegmentFilename\";\n EbmlTagId[EbmlTagId[\"AttachmentLink\"] = 29766] = \"AttachmentLink\";\n EbmlTagId[EbmlTagId[\"CodecName\"] = 2459272] = \"CodecName\";\n EbmlTagId[EbmlTagId[\"Segment\"] = 408125543] = \"Segment\";\n EbmlTagId[EbmlTagId[\"TagLanguage\"] = 17530] = \"TagLanguage\";\n EbmlTagId[EbmlTagId[\"TagName\"] = 17827] = \"TagName\";\n EbmlTagId[EbmlTagId[\"SimpleTag\"] = 26568] = \"SimpleTag\";\n EbmlTagId[EbmlTagId[\"TagAttachmentUID\"] = 25542] = \"TagAttachmentUID\";\n EbmlTagId[EbmlTagId[\"TagChapterUID\"] = 25540] = \"TagChapterUID\";\n EbmlTagId[EbmlTagId[\"TagEditionUID\"] = 25545] = \"TagEditionUID\";\n EbmlTagId[EbmlTagId[\"TagTrackUID\"] = 25541] = \"TagTrackUID\";\n EbmlTagId[EbmlTagId[\"TargetType\"] = 25546] = \"TargetType\";\n EbmlTagId[EbmlTagId[\"TargetTypeValue\"] = 26826] = \"TargetTypeValue\";\n EbmlTagId[EbmlTagId[\"Targets\"] = 25536] = \"Targets\";\n EbmlTagId[EbmlTagId[\"Tags\"] = 307544935] = \"Tags\";\n EbmlTagId[EbmlTagId[\"ChapProcessPrivate\"] = 17677] = \"ChapProcessPrivate\";\n EbmlTagId[EbmlTagId[\"ChapCountry\"] = 17278] = \"ChapCountry\";\n EbmlTagId[EbmlTagId[\"ChapLanguage\"] = 17276] = \"ChapLanguage\";\n EbmlTagId[EbmlTagId[\"ChapterTrack\"] = 143] = \"ChapterTrack\";\n EbmlTagId[EbmlTagId[\"ChapterPhysicalEquiv\"] = 25539] = \"ChapterPhysicalEquiv\";\n EbmlTagId[EbmlTagId[\"ChapterSegmentEditionUID\"] = 28348] = \"ChapterSegmentEditionUID\";\n EbmlTagId[EbmlTagId[\"ChapterSegmentUID\"] = 28263] = \"ChapterSegmentUID\";\n EbmlTagId[EbmlTagId[\"ChapterUID\"] = 29636] = \"ChapterUID\";\n EbmlTagId[EbmlTagId[\"ChapterAtom\"] = 182] = \"ChapterAtom\";\n EbmlTagId[EbmlTagId[\"EditionFlagOrdered\"] = 17885] = \"EditionFlagOrdered\";\n EbmlTagId[EbmlTagId[\"EditionFlagDefault\"] = 17883] = \"EditionFlagDefault\";\n EbmlTagId[EbmlTagId[\"EditionFlagHidden\"] = 17853] = \"EditionFlagHidden\";\n EbmlTagId[EbmlTagId[\"EditionUID\"] = 17852] = \"EditionUID\";\n EbmlTagId[EbmlTagId[\"EditionEntry\"] = 17849] = \"EditionEntry\";\n EbmlTagId[EbmlTagId[\"Chapters\"] = 272869232] = \"Chapters\";\n EbmlTagId[EbmlTagId[\"FileUID\"] = 18094] = \"FileUID\";\n EbmlTagId[EbmlTagId[\"FileData\"] = 18012] = \"FileData\";\n EbmlTagId[EbmlTagId[\"FileName\"] = 18030] = \"FileName\";\n EbmlTagId[EbmlTagId[\"FileDescription\"] = 18046] = \"FileDescription\";\n EbmlTagId[EbmlTagId[\"AttachedFile\"] = 24999] = \"AttachedFile\";\n EbmlTagId[EbmlTagId[\"Attachments\"] = 423732329] = \"Attachments\";\n EbmlTagId[EbmlTagId[\"CueRefCodecState\"] = 235] = \"CueRefCodecState\";\n EbmlTagId[EbmlTagId[\"CueRefNumber\"] = 21343] = \"CueRefNumber\";\n EbmlTagId[EbmlTagId[\"CueReference\"] = 219] = \"CueReference\";\n EbmlTagId[EbmlTagId[\"CueCodecState\"] = 234] = \"CueCodecState\";\n EbmlTagId[EbmlTagId[\"CueDuration\"] = 178] = \"CueDuration\";\n EbmlTagId[EbmlTagId[\"CueRelativePosition\"] = 240] = \"CueRelativePosition\";\n EbmlTagId[EbmlTagId[\"CueClusterPosition\"] = 241] = \"CueClusterPosition\";\n EbmlTagId[EbmlTagId[\"CueTrack\"] = 247] = \"CueTrack\";\n EbmlTagId[EbmlTagId[\"CueTrackPositions\"] = 183] = \"CueTrackPositions\";\n EbmlTagId[EbmlTagId[\"CueTime\"] = 179] = \"CueTime\";\n EbmlTagId[EbmlTagId[\"CuePoint\"] = 187] = \"CuePoint\";\n EbmlTagId[EbmlTagId[\"Cues\"] = 475249515] = \"Cues\";\n EbmlTagId[EbmlTagId[\"AESSettingsCipherMode\"] = 18408] = \"AESSettingsCipherMode\";\n EbmlTagId[EbmlTagId[\"ContentEncAESSettings\"] = 18407] = \"ContentEncAESSettings\";\n EbmlTagId[EbmlTagId[\"ContentSigHashAlgo\"] = 18406] = \"ContentSigHashAlgo\";\n EbmlTagId[EbmlTagId[\"ContentSigAlgo\"] = 18405] = \"ContentSigAlgo\";\n EbmlTagId[EbmlTagId[\"ContentSigKeyID\"] = 18404] = \"ContentSigKeyID\";\n EbmlTagId[EbmlTagId[\"ContentSignature\"] = 18403] = \"ContentSignature\";\n EbmlTagId[EbmlTagId[\"ContentEncKeyID\"] = 18402] = \"ContentEncKeyID\";\n EbmlTagId[EbmlTagId[\"ContentEncAlgo\"] = 18401] = \"ContentEncAlgo\";\n EbmlTagId[EbmlTagId[\"ContentEncodings\"] = 28032] = \"ContentEncodings\";\n EbmlTagId[EbmlTagId[\"TrickMasterTrackSegmentUID\"] = 196] = \"TrickMasterTrackSegmentUID\";\n EbmlTagId[EbmlTagId[\"TrickMasterTrackUID\"] = 199] = \"TrickMasterTrackUID\";\n EbmlTagId[EbmlTagId[\"TrickTrackFlag\"] = 198] = \"TrickTrackFlag\";\n EbmlTagId[EbmlTagId[\"TrickTrackSegmentUID\"] = 193] = \"TrickTrackSegmentUID\";\n EbmlTagId[EbmlTagId[\"TrickTrackUID\"] = 192] = \"TrickTrackUID\";\n EbmlTagId[EbmlTagId[\"TrackJoinUID\"] = 237] = \"TrackJoinUID\";\n EbmlTagId[EbmlTagId[\"TrackJoinBlocks\"] = 233] = \"TrackJoinBlocks\";\n EbmlTagId[EbmlTagId[\"TrackPlaneType\"] = 230] = \"TrackPlaneType\";\n EbmlTagId[EbmlTagId[\"TrackPlaneUID\"] = 229] = \"TrackPlaneUID\";\n EbmlTagId[EbmlTagId[\"TrackPlane\"] = 228] = \"TrackPlane\";\n EbmlTagId[EbmlTagId[\"TrackCombinePlanes\"] = 227] = \"TrackCombinePlanes\";\n EbmlTagId[EbmlTagId[\"TrackOperation\"] = 226] = \"TrackOperation\";\n EbmlTagId[EbmlTagId[\"ChannelPositions\"] = 32123] = \"ChannelPositions\";\n EbmlTagId[EbmlTagId[\"Channels\"] = 159] = \"Channels\";\n EbmlTagId[EbmlTagId[\"OutputSamplingFrequency\"] = 30901] = \"OutputSamplingFrequency\";\n EbmlTagId[EbmlTagId[\"SamplingFrequency\"] = 181] = \"SamplingFrequency\";\n EbmlTagId[EbmlTagId[\"Audio\"] = 225] = \"Audio\";\n EbmlTagId[EbmlTagId[\"FrameRate\"] = 2327523] = \"FrameRate\";\n EbmlTagId[EbmlTagId[\"GammaValue\"] = 3126563] = \"GammaValue\";\n EbmlTagId[EbmlTagId[\"ColourSpace\"] = 3061028] = \"ColourSpace\";\n EbmlTagId[EbmlTagId[\"AspectRatioType\"] = 21683] = \"AspectRatioType\";\n EbmlTagId[EbmlTagId[\"DisplayUnit\"] = 21682] = \"DisplayUnit\";\n EbmlTagId[EbmlTagId[\"DisplayHeight\"] = 21690] = \"DisplayHeight\";\n EbmlTagId[EbmlTagId[\"DisplayWidth\"] = 21680] = \"DisplayWidth\";\n EbmlTagId[EbmlTagId[\"PixelCropRight\"] = 21725] = \"PixelCropRight\";\n EbmlTagId[EbmlTagId[\"PixelCropLeft\"] = 21708] = \"PixelCropLeft\";\n EbmlTagId[EbmlTagId[\"PixelCropTop\"] = 21691] = \"PixelCropTop\";\n EbmlTagId[EbmlTagId[\"PixelCropBottom\"] = 21674] = \"PixelCropBottom\";\n EbmlTagId[EbmlTagId[\"PixelHeight\"] = 186] = \"PixelHeight\";\n EbmlTagId[EbmlTagId[\"PixelWidth\"] = 176] = \"PixelWidth\";\n EbmlTagId[EbmlTagId[\"OldStereoMode\"] = 21433] = \"OldStereoMode\";\n EbmlTagId[EbmlTagId[\"AlphaMode\"] = 21440] = \"AlphaMode\";\n EbmlTagId[EbmlTagId[\"StereoMode\"] = 21432] = \"StereoMode\";\n EbmlTagId[EbmlTagId[\"FlagInterlaced\"] = 154] = \"FlagInterlaced\";\n EbmlTagId[EbmlTagId[\"Video\"] = 224] = \"Video\";\n EbmlTagId[EbmlTagId[\"TrackTranslateTrackID\"] = 26277] = \"TrackTranslateTrackID\";\n EbmlTagId[EbmlTagId[\"TrackTranslateCodec\"] = 26303] = \"TrackTranslateCodec\";\n EbmlTagId[EbmlTagId[\"TrackTranslateEditionUID\"] = 26364] = \"TrackTranslateEditionUID\";\n EbmlTagId[EbmlTagId[\"SeekPreRoll\"] = 22203] = \"SeekPreRoll\";\n EbmlTagId[EbmlTagId[\"CodecDelay\"] = 22186] = \"CodecDelay\";\n EbmlTagId[EbmlTagId[\"TrackOverlay\"] = 28587] = \"TrackOverlay\";\n EbmlTagId[EbmlTagId[\"CodecDecodeAll\"] = 170] = \"CodecDecodeAll\";\n EbmlTagId[EbmlTagId[\"CodecDownloadURL\"] = 2536000] = \"CodecDownloadURL\";\n EbmlTagId[EbmlTagId[\"CodecInfoURL\"] = 3883072] = \"CodecInfoURL\";\n EbmlTagId[EbmlTagId[\"CodecSettings\"] = 3839639] = \"CodecSettings\";\n EbmlTagId[EbmlTagId[\"CodecPrivate\"] = 25506] = \"CodecPrivate\";\n EbmlTagId[EbmlTagId[\"Language\"] = 2274716] = \"Language\";\n EbmlTagId[EbmlTagId[\"Name\"] = 21358] = \"Name\";\n EbmlTagId[EbmlTagId[\"MaxBlockAdditionID\"] = 21998] = \"MaxBlockAdditionID\";\n EbmlTagId[EbmlTagId[\"TrackOffset\"] = 21375] = \"TrackOffset\";\n EbmlTagId[EbmlTagId[\"TrackTimecodeScale\"] = 2306383] = \"TrackTimecodeScale\";\n EbmlTagId[EbmlTagId[\"DefaultDecodedFieldDuration\"] = 2313850] = \"DefaultDecodedFieldDuration\";\n EbmlTagId[EbmlTagId[\"DefaultDuration\"] = 2352003] = \"DefaultDuration\";\n EbmlTagId[EbmlTagId[\"MaxCache\"] = 28152] = \"MaxCache\";\n EbmlTagId[EbmlTagId[\"MinCache\"] = 28135] = \"MinCache\";\n EbmlTagId[EbmlTagId[\"FlagLacing\"] = 156] = \"FlagLacing\";\n EbmlTagId[EbmlTagId[\"FlagForced\"] = 21930] = \"FlagForced\";\n EbmlTagId[EbmlTagId[\"FlagEnabled\"] = 185] = \"FlagEnabled\";\n EbmlTagId[EbmlTagId[\"TrackUID\"] = 29637] = \"TrackUID\";\n EbmlTagId[EbmlTagId[\"TrackNumber\"] = 215] = \"TrackNumber\";\n EbmlTagId[EbmlTagId[\"TrackEntry\"] = 174] = \"TrackEntry\";\n EbmlTagId[EbmlTagId[\"Tracks\"] = 374648427] = \"Tracks\";\n EbmlTagId[EbmlTagId[\"EncryptedBlock\"] = 175] = \"EncryptedBlock\";\n EbmlTagId[EbmlTagId[\"ReferenceTimeCode\"] = 202] = \"ReferenceTimeCode\";\n EbmlTagId[EbmlTagId[\"ReferenceOffset\"] = 201] = \"ReferenceOffset\";\n EbmlTagId[EbmlTagId[\"ReferenceFrame\"] = 200] = \"ReferenceFrame\";\n EbmlTagId[EbmlTagId[\"SliceDuration\"] = 207] = \"SliceDuration\";\n EbmlTagId[EbmlTagId[\"Delay\"] = 206] = \"Delay\";\n EbmlTagId[EbmlTagId[\"BlockAdditionID\"] = 203] = \"BlockAdditionID\";\n EbmlTagId[EbmlTagId[\"FrameNumber\"] = 205] = \"FrameNumber\";\n EbmlTagId[EbmlTagId[\"LaceNumber\"] = 204] = \"LaceNumber\";\n EbmlTagId[EbmlTagId[\"TimeSlice\"] = 232] = \"TimeSlice\";\n EbmlTagId[EbmlTagId[\"Slices\"] = 142] = \"Slices\";\n EbmlTagId[EbmlTagId[\"DiscardPadding\"] = 30114] = \"DiscardPadding\";\n EbmlTagId[EbmlTagId[\"CodecState\"] = 164] = \"CodecState\";\n EbmlTagId[EbmlTagId[\"ReferenceVirtual\"] = 253] = \"ReferenceVirtual\";\n EbmlTagId[EbmlTagId[\"ReferenceBlock\"] = 251] = \"ReferenceBlock\";\n EbmlTagId[EbmlTagId[\"ReferencePriority\"] = 250] = \"ReferencePriority\";\n EbmlTagId[EbmlTagId[\"BlockDuration\"] = 155] = \"BlockDuration\";\n EbmlTagId[EbmlTagId[\"BlockAdditional\"] = 165] = \"BlockAdditional\";\n EbmlTagId[EbmlTagId[\"BlockAddID\"] = 238] = \"BlockAddID\";\n EbmlTagId[EbmlTagId[\"BlockMore\"] = 166] = \"BlockMore\";\n EbmlTagId[EbmlTagId[\"BlockAdditions\"] = 30113] = \"BlockAdditions\";\n EbmlTagId[EbmlTagId[\"BlockVirtual\"] = 162] = \"BlockVirtual\";\n EbmlTagId[EbmlTagId[\"Block\"] = 161] = \"Block\";\n EbmlTagId[EbmlTagId[\"BlockGroup\"] = 160] = \"BlockGroup\";\n EbmlTagId[EbmlTagId[\"SimpleBlock\"] = 163] = \"SimpleBlock\";\n EbmlTagId[EbmlTagId[\"PrevSize\"] = 171] = \"PrevSize\";\n EbmlTagId[EbmlTagId[\"Position\"] = 167] = \"Position\";\n EbmlTagId[EbmlTagId[\"SilentTrackNumber\"] = 22743] = \"SilentTrackNumber\";\n EbmlTagId[EbmlTagId[\"Timecode\"] = 231] = \"Timecode\";\n EbmlTagId[EbmlTagId[\"Cluster\"] = 524531317] = \"Cluster\";\n EbmlTagId[EbmlTagId[\"MuxingApp\"] = 19840] = \"MuxingApp\";\n EbmlTagId[EbmlTagId[\"Title\"] = 31657] = \"Title\";\n EbmlTagId[EbmlTagId[\"TimecodeScaleDenominator\"] = 2807730] = \"TimecodeScaleDenominator\";\n EbmlTagId[EbmlTagId[\"TimecodeScale\"] = 2807729] = \"TimecodeScale\";\n EbmlTagId[EbmlTagId[\"ChapterTranslateID\"] = 27045] = \"ChapterTranslateID\";\n EbmlTagId[EbmlTagId[\"ChapterTranslateCodec\"] = 27071] = \"ChapterTranslateCodec\";\n EbmlTagId[EbmlTagId[\"ChapterTranslateEditionUID\"] = 27132] = \"ChapterTranslateEditionUID\";\n EbmlTagId[EbmlTagId[\"NextFilename\"] = 4096955] = \"NextFilename\";\n EbmlTagId[EbmlTagId[\"NextUID\"] = 4110627] = \"NextUID\";\n EbmlTagId[EbmlTagId[\"PrevFilename\"] = 3965867] = \"PrevFilename\";\n EbmlTagId[EbmlTagId[\"PrevUID\"] = 3979555] = \"PrevUID\";\n EbmlTagId[EbmlTagId[\"SegmentUID\"] = 29604] = \"SegmentUID\";\n EbmlTagId[EbmlTagId[\"Info\"] = 357149030] = \"Info\";\n EbmlTagId[EbmlTagId[\"SeekPosition\"] = 21420] = \"SeekPosition\";\n EbmlTagId[EbmlTagId[\"SeekID\"] = 21419] = \"SeekID\";\n EbmlTagId[EbmlTagId[\"Seek\"] = 19899] = \"Seek\";\n EbmlTagId[EbmlTagId[\"SeekHead\"] = 290298740] = \"SeekHead\";\n EbmlTagId[EbmlTagId[\"SignatureElementList\"] = 32379] = \"SignatureElementList\";\n EbmlTagId[EbmlTagId[\"SignatureElements\"] = 32347] = \"SignatureElements\";\n EbmlTagId[EbmlTagId[\"Signature\"] = 32437] = \"Signature\";\n EbmlTagId[EbmlTagId[\"SignaturePublicKey\"] = 32421] = \"SignaturePublicKey\";\n EbmlTagId[EbmlTagId[\"SignatureHash\"] = 32410] = \"SignatureHash\";\n EbmlTagId[EbmlTagId[\"SignatureAlgo\"] = 32394] = \"SignatureAlgo\";\n EbmlTagId[EbmlTagId[\"SignatureSlot\"] = 458458727] = \"SignatureSlot\";\n EbmlTagId[EbmlTagId[\"CRC32\"] = 191] = \"CRC32\";\n EbmlTagId[EbmlTagId[\"Void\"] = 236] = \"Void\";\n EbmlTagId[EbmlTagId[\"EBMLMaxSizeLength\"] = 17139] = \"EBMLMaxSizeLength\";\n EbmlTagId[EbmlTagId[\"EBMLMaxIDLength\"] = 17138] = \"EBMLMaxIDLength\";\n EbmlTagId[EbmlTagId[\"EBMLReadVersion\"] = 17143] = \"EBMLReadVersion\";\n EbmlTagId[EbmlTagId[\"EBML\"] = 440786851] = \"EBML\";\n})(EbmlTagId = exports.EbmlTagId || (exports.EbmlTagId = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar EbmlTagPosition;\n(function (EbmlTagPosition) {\n EbmlTagPosition[EbmlTagPosition[\"Start\"] = 0] = \"Start\";\n EbmlTagPosition[EbmlTagPosition[\"Content\"] = 1] = \"Content\";\n EbmlTagPosition[EbmlTagPosition[\"End\"] = 2] = \"End\";\n})(EbmlTagPosition = exports.EbmlTagPosition || (exports.EbmlTagPosition = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlDataTag_1 = require(\"./EbmlDataTag\");\nconst BlockLacing_1 = require(\"../enums/BlockLacing\");\nconst tools_1 = require(\"../../tools\");\nconst EbmlTagId_1 = require(\"../enums/EbmlTagId\");\nconst EbmlElementType_1 = require(\"../enums/EbmlElementType\");\nclass Block extends EbmlDataTag_1.EbmlDataTag {\n constructor(subTypeId) {\n super(subTypeId || EbmlTagId_1.EbmlTagId.Block, EbmlElementType_1.EbmlElementType.Binary);\n }\n writeTrackBuffer() {\n return tools_1.Tools.writeVint(this.track);\n }\n writeValueBuffer() {\n let value = Buffer.alloc(2);\n value.writeInt16BE(this.value, 0);\n return value;\n }\n writeFlagsBuffer() {\n let flags = 0x00;\n if (this.invisible) {\n flags |= 0x10;\n }\n switch (this.lacing) {\n case BlockLacing_1.BlockLacing.None:\n break;\n case BlockLacing_1.BlockLacing.Xiph:\n flags |= 0x04;\n break;\n case BlockLacing_1.BlockLacing.EBML:\n flags |= 0x08;\n break;\n case BlockLacing_1.BlockLacing.FixedSize:\n flags |= 0x0c;\n break;\n }\n return Buffer.of(flags);\n }\n encodeContent() {\n return Buffer.concat([\n this.writeTrackBuffer(),\n this.writeValueBuffer(),\n this.writeFlagsBuffer(),\n this.payload\n ]);\n }\n parseContent(data) {\n const track = tools_1.Tools.readVint(data);\n this.track = track.value;\n this.value = tools_1.Tools.readSigned(data.subarray(track.length, track.length + 2));\n let flags = data[track.length + 2];\n this.invisible = Boolean(flags & 0x10);\n switch (flags & 0x0c) {\n case 0x00:\n this.lacing = BlockLacing_1.BlockLacing.None;\n break;\n case 0x04:\n this.lacing = BlockLacing_1.BlockLacing.Xiph;\n break;\n case 0x08:\n this.lacing = BlockLacing_1.BlockLacing.EBML;\n break;\n case 0x0c:\n this.lacing = BlockLacing_1.BlockLacing.FixedSize;\n break;\n }\n this.payload = data.slice(track.length + 3);\n }\n}\nexports.Block = Block;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlTag_1 = require(\"../EbmlTag\");\nconst EbmlElementType_1 = require(\"../enums/EbmlElementType\");\nconst tools_1 = require(\"../../tools\");\nconst EbmlTagPosition_1 = require(\"../enums/EbmlTagPosition\");\nclass EbmlDataTag extends EbmlTag_1.EbmlTag {\n constructor(id, type) {\n super(id, type, EbmlTagPosition_1.EbmlTagPosition.Content);\n }\n parseContent(data) {\n switch (this.type) {\n case EbmlElementType_1.EbmlElementType.UnsignedInt:\n this.data = tools_1.Tools.readUnsigned(data);\n break;\n case EbmlElementType_1.EbmlElementType.Float:\n this.data = tools_1.Tools.readFloat(data);\n break;\n case EbmlElementType_1.EbmlElementType.Integer:\n this.data = tools_1.Tools.readSigned(data);\n break;\n case EbmlElementType_1.EbmlElementType.String:\n this.data = String.fromCharCode(...data);\n break;\n case EbmlElementType_1.EbmlElementType.UTF8:\n this.data = tools_1.Tools.readUtf8(data);\n break;\n default:\n this.data = data;\n break;\n }\n }\n encodeContent() {\n switch (this.type) {\n case EbmlElementType_1.EbmlElementType.UnsignedInt:\n return tools_1.Tools.writeUnsigned(this.data);\n case EbmlElementType_1.EbmlElementType.Float:\n return tools_1.Tools.writeFloat(this.data);\n case EbmlElementType_1.EbmlElementType.Integer:\n return tools_1.Tools.writeSigned(this.data);\n case EbmlElementType_1.EbmlElementType.String:\n return Buffer.from(this.data, \"ascii\");\n case EbmlElementType_1.EbmlElementType.UTF8:\n return Buffer.from(this.data, \"utf8\");\n case EbmlElementType_1.EbmlElementType.Binary:\n default:\n return this.data;\n }\n }\n}\nexports.EbmlDataTag = EbmlDataTag;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlTag_1 = require(\"../EbmlTag\");\nconst EbmlElementType_1 = require(\"../enums/EbmlElementType\");\nconst EbmlTagPosition_1 = require(\"../enums/EbmlTagPosition\");\nconst tools_1 = require(\"../../tools\");\nconst EbmlTagFactory_1 = require(\"../EbmlTagFactory\");\nclass EbmlMasterTag extends EbmlTag_1.EbmlTag {\n constructor(id, position = EbmlTagPosition_1.EbmlTagPosition.Content) {\n super(id, EbmlElementType_1.EbmlElementType.Master, position);\n this._children = [];\n }\n get Children() {\n return this._children;\n }\n set Children(value) {\n this._children = value;\n }\n encodeContent() {\n return Buffer.concat(this._children.map(child => child.encode()));\n }\n parseContent(content) {\n while (content.length > 0) {\n const tag = tools_1.Tools.readVint(content);\n const size = tools_1.Tools.readVint(content, tag.length);\n const tagIdHex = tools_1.Tools.readHexString(content, 0, tag.length);\n const tagId = Number.parseInt(tagIdHex, 16);\n let tagObject = EbmlTagFactory_1.EbmlTagFactory.create(tagId);\n tagObject.size = size.value;\n let totalTagLength = tag.length + size.length + size.value;\n tagObject.parseContent(content.slice(tag.length + size.length, totalTagLength));\n this._children.push(tagObject);\n content = content.slice(totalTagLength);\n }\n }\n}\nexports.EbmlMasterTag = EbmlMasterTag;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst tools_1 = require(\"../../tools\");\nconst Block_1 = require(\"./Block\");\nconst EbmlTagId_1 = require(\"../enums/EbmlTagId\");\nclass SimpleBlock extends Block_1.Block {\n constructor() {\n super(EbmlTagId_1.EbmlTagId.SimpleBlock);\n }\n encodeContent() {\n let flags = this.writeFlagsBuffer();\n if (this.keyframe) {\n flags[0] |= 0x80;\n }\n if (this.discardable) {\n flags[0] |= 0x01;\n }\n return Buffer.concat([\n this.writeTrackBuffer(),\n this.writeValueBuffer(),\n flags,\n this.payload\n ]);\n }\n parseContent(data) {\n super.parseContent(data);\n const track = tools_1.Tools.readVint(data);\n let flags = data[track.length + 2];\n this.keyframe = Boolean(flags & 0x80);\n this.discardable = Boolean(flags & 0x01);\n }\n}\nexports.SimpleBlock = SimpleBlock;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nclass Tools {\n static readVint(buffer, start = 0) {\n const length = 8 - Math.floor(Math.log2(buffer[start]));\n if (length > 8) {\n const number = Tools.readHexString(buffer, start, start + length);\n throw new Error(`Unrepresentable length: ${length} ${number}`);\n }\n if (isNaN(length) || start + length > buffer.length) {\n return null;\n }\n if (length === 8 && buffer[start + 1] >= 0x20 && buffer.subarray(start + 2, start + 8).some(i => i > 0x00)) {\n return {\n length: 8,\n value: -1\n };\n }\n let value = buffer[start] & ((1 << (8 - length)) - 1);\n for (let i = 1; i < length; i += 1) {\n value *= Math.pow(2, 8);\n value += buffer[start + i];\n }\n if (value === (Math.pow(2, (length * 7)) - 1)) {\n value = -1;\n }\n return {\n length,\n value,\n };\n }\n static writeVint(value, desiredLength) {\n if (value < 0 || value > (Math.pow(2, 53))) {\n throw new Error(`Unrepresentable value: ${value}`);\n }\n let length = desiredLength;\n if (!length) {\n for (length = 1; length <= 8; length += 1) {\n if (value < Math.pow(2, (7 * length)) - 1) {\n break;\n }\n }\n }\n const buffer = Buffer.alloc(length);\n let val = value;\n for (let i = 1; i <= length; i += 1) {\n const b = val & 0xff;\n buffer[length - i] = b;\n val -= b;\n val /= Math.pow(2, 8);\n }\n buffer[0] |= 1 << (8 - length);\n return buffer;\n }\n static padStart(val) {\n if (val.length == 0) {\n return '00';\n }\n if (val.length == 1) {\n return '0' + val;\n }\n return val;\n }\n static readHexString(buff, start = 0, end = buff.byteLength) {\n return Array.from(buff.subarray(start, end))\n .map(q => Number(q).toString(16))\n .reduce((acc, current) => `${acc}${this.padStart(current)}`, '');\n }\n static readUtf8(buff) {\n try {\n return Buffer.from(buff).toString('utf8');\n }\n catch (exception) {\n return null;\n }\n }\n static readUnsigned(buff) {\n const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength);\n switch (buff.byteLength) {\n case 1:\n return b.getUint8(0);\n case 2:\n return b.getUint16(0);\n case 4:\n return b.getUint32(0);\n default:\n break;\n }\n if (buff.byteLength <= 6) {\n return buff.reduce((acc, current) => acc * 256 + current, 0);\n }\n var hex = Tools.readHexString(buff, 0, buff.byteLength);\n var num = parseInt(hex, 16);\n if (num <= Math.pow(256, 6)) {\n return num;\n }\n return hex;\n }\n static writeUnsigned(num) {\n if (typeof num === 'string') {\n return Buffer.from(num, 'hex');\n }\n else {\n var buf = Buffer.alloc(6);\n buf.fill(0);\n buf.writeUIntBE(num, 0, 6);\n let firstValueIndex = buf.findIndex(b => b !== 0);\n if (firstValueIndex === -1) {\n firstValueIndex = buf.length - 1;\n }\n let ret = buf.slice(firstValueIndex);\n return ret;\n }\n }\n static readSigned(buff) {\n const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength);\n switch (buff.byteLength) {\n case 1:\n return b.getInt8(0);\n case 2:\n return b.getInt16(0);\n case 4:\n return b.getInt32(0);\n default:\n return NaN;\n }\n }\n static writeSigned(num) {\n var buf = Buffer.alloc(8);\n buf.writeInt32BE(num, 0);\n return buf;\n }\n static readFloat(buff) {\n const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength);\n switch (buff.byteLength) {\n case 4:\n return b.getFloat32(0);\n case 8:\n return b.getFloat64(0);\n default:\n return NaN;\n }\n }\n static writeFloat(num) {\n let buf = Buffer.alloc(8);\n let written = buf.writeFloatBE(num, 0);\n if (written <= 4) {\n buf = buf.slice(0, 4);\n }\n return buf;\n }\n}\nexports.Tools = Tools;\n","'use strict';\n\nvar elliptic = exports;\n\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');\n\n// Protocols\nelliptic.ec = require('./elliptic/ec');\nelliptic.eddsa = require('./elliptic/eddsa');\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar getNAF = utils.getNAF;\nvar getJSF = utils.getJSF;\nvar assert = utils.assert;\n\nfunction BaseCurve(type, conf) {\n this.type = type;\n this.p = new BN(conf.p, 16);\n\n // Use Montgomery, when there is no fast reduction for the prime\n this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);\n\n // Useful for many curves\n this.zero = new BN(0).toRed(this.red);\n this.one = new BN(1).toRed(this.red);\n this.two = new BN(2).toRed(this.red);\n\n // Curve configuration, optional\n this.n = conf.n && new BN(conf.n, 16);\n this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);\n\n // Temporary arrays\n this._wnafT1 = new Array(4);\n this._wnafT2 = new Array(4);\n this._wnafT3 = new Array(4);\n this._wnafT4 = new Array(4);\n\n this._bitLength = this.n ? this.n.bitLength() : 0;\n\n // Generalized Greg Maxwell's trick\n var adjustCount = this.n && this.p.div(this.n);\n if (!adjustCount || adjustCount.cmpn(100) > 0) {\n this.redN = null;\n } else {\n this._maxwellTrick = true;\n this.redN = this.n.toRed(this.red);\n }\n}\nmodule.exports = BaseCurve;\n\nBaseCurve.prototype.point = function point() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype.validate = function validate() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles();\n\n var naf = getNAF(k, 1, this._bitLength);\n var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n\n // Translate into more windowed form\n var repr = [];\n var j;\n var nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--)\n nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n\n var a = this.jpoint(null, null, null);\n var b = this.jpoint(null, null, null);\n for (var i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++) {\n nafW = repr[j];\n if (nafW === i)\n b = b.mixedAdd(doubles.points[j]);\n else if (nafW === -i)\n b = b.mixedAdd(doubles.points[j].neg());\n }\n a = a.add(b);\n }\n return a.toP();\n};\n\nBaseCurve.prototype._wnafMul = function _wnafMul(p, k) {\n var w = 4;\n\n // Precompute window\n var nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n var wnd = nafPoints.points;\n\n // Get NAF form\n var naf = getNAF(k, w, this._bitLength);\n\n // Add `this`*(N+1) for every w-NAF index\n var acc = this.jpoint(null, null, null);\n for (var i = naf.length - 1; i >= 0; i--) {\n // Count zeroes\n for (var l = 0; i >= 0 && naf[i] === 0; i--)\n l++;\n if (i >= 0)\n l++;\n acc = acc.dblp(l);\n\n if (i < 0)\n break;\n var z = naf[i];\n assert(z !== 0);\n if (p.type === 'affine') {\n // J +- P\n if (z > 0)\n acc = acc.mixedAdd(wnd[(z - 1) >> 1]);\n else\n acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());\n } else {\n // J +- J\n if (z > 0)\n acc = acc.add(wnd[(z - 1) >> 1]);\n else\n acc = acc.add(wnd[(-z - 1) >> 1].neg());\n }\n }\n return p.type === 'affine' ? acc.toP() : acc;\n};\n\nBaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,\n points,\n coeffs,\n len,\n jacobianResult) {\n var wndWidth = this._wnafT1;\n var wnd = this._wnafT2;\n var naf = this._wnafT3;\n\n // Fill all arrays\n var max = 0;\n var i;\n var j;\n var p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n wndWidth[i] = nafPoints.wnd;\n wnd[i] = nafPoints.points;\n }\n\n // Comb small window NAFs\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1;\n var b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength);\n naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength);\n max = Math.max(naf[a].length, max);\n max = Math.max(naf[b].length, max);\n continue;\n }\n\n var comb = [\n points[a], /* 1 */\n null, /* 3 */\n null, /* 5 */\n points[b], /* 7 */\n ];\n\n // Try to avoid Projective points, if possible\n if (points[a].y.cmp(points[b].y) === 0) {\n comb[1] = points[a].add(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].add(points[b].neg());\n } else {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n }\n\n var index = [\n -3, /* -1 -1 */\n -1, /* -1 0 */\n -5, /* -1 1 */\n -7, /* 0 -1 */\n 0, /* 0 0 */\n 7, /* 0 1 */\n 5, /* 1 -1 */\n 1, /* 1 0 */\n 3, /* 1 1 */\n ];\n\n var jsf = getJSF(coeffs[a], coeffs[b]);\n max = Math.max(jsf[0].length, max);\n naf[a] = new Array(max);\n naf[b] = new Array(max);\n for (j = 0; j < max; j++) {\n var ja = jsf[0][j] | 0;\n var jb = jsf[1][j] | 0;\n\n naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];\n naf[b][j] = 0;\n wnd[a] = comb;\n }\n }\n\n var acc = this.jpoint(null, null, null);\n var tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n var k = 0;\n\n while (i >= 0) {\n var zero = true;\n for (j = 0; j < len; j++) {\n tmp[j] = naf[j][i] | 0;\n if (tmp[j] !== 0)\n zero = false;\n }\n if (!zero)\n break;\n k++;\n i--;\n }\n if (i >= 0)\n k++;\n acc = acc.dblp(k);\n if (i < 0)\n break;\n\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n p;\n if (z === 0)\n continue;\n else if (z > 0)\n p = wnd[j][(z - 1) >> 1];\n else if (z < 0)\n p = wnd[j][(-z - 1) >> 1].neg();\n\n if (p.type === 'affine')\n acc = acc.mixedAdd(p);\n else\n acc = acc.add(p);\n }\n }\n // Zeroify references\n for (i = 0; i < len; i++)\n wnd[i] = null;\n\n if (jacobianResult)\n return acc;\n else\n return acc.toP();\n};\n\nfunction BasePoint(curve, type) {\n this.curve = curve;\n this.type = type;\n this.precomputed = null;\n}\nBaseCurve.BasePoint = BasePoint;\n\nBasePoint.prototype.eq = function eq(/*other*/) {\n throw new Error('Not implemented');\n};\n\nBasePoint.prototype.validate = function validate() {\n return this.curve.validate(this);\n};\n\nBaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n\n var len = this.p.byteLength();\n\n // uncompressed, hybrid-odd, hybrid-even\n if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) &&\n bytes.length - 1 === 2 * len) {\n if (bytes[0] === 0x06)\n assert(bytes[bytes.length - 1] % 2 === 0);\n else if (bytes[0] === 0x07)\n assert(bytes[bytes.length - 1] % 2 === 1);\n\n var res = this.point(bytes.slice(1, 1 + len),\n bytes.slice(1 + len, 1 + 2 * len));\n\n return res;\n } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&\n bytes.length - 1 === len) {\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);\n }\n throw new Error('Unknown point format');\n};\n\nBasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {\n return this.encode(enc, true);\n};\n\nBasePoint.prototype._encode = function _encode(compact) {\n var len = this.curve.p.byteLength();\n var x = this.getX().toArray('be', len);\n\n if (compact)\n return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);\n\n return [ 0x04 ].concat(x, this.getY().toArray('be', len));\n};\n\nBasePoint.prototype.encode = function encode(enc, compact) {\n return utils.encode(this._encode(compact), enc);\n};\n\nBasePoint.prototype.precompute = function precompute(power) {\n if (this.precomputed)\n return this;\n\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n precomputed.naf = this._getNAFPoints(8);\n precomputed.doubles = this._getDoubles(4, power);\n precomputed.beta = this._getBeta();\n this.precomputed = precomputed;\n\n return this;\n};\n\nBasePoint.prototype._hasDoubles = function _hasDoubles(k) {\n if (!this.precomputed)\n return false;\n\n var doubles = this.precomputed.doubles;\n if (!doubles)\n return false;\n\n return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);\n};\n\nBasePoint.prototype._getDoubles = function _getDoubles(step, power) {\n if (this.precomputed && this.precomputed.doubles)\n return this.precomputed.doubles;\n\n var doubles = [ this ];\n var acc = this;\n for (var i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++)\n acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step: step,\n points: doubles,\n };\n};\n\nBasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {\n if (this.precomputed && this.precomputed.naf)\n return this.precomputed.naf;\n\n var res = [ this ];\n var max = (1 << wnd) - 1;\n var dbl = max === 1 ? null : this.dbl();\n for (var i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd: wnd,\n points: res,\n };\n};\n\nBasePoint.prototype._getBeta = function _getBeta() {\n return null;\n};\n\nBasePoint.prototype.dblp = function dblp(k) {\n var r = this;\n for (var i = 0; i < k; i++)\n r = r.dbl();\n return r;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction EdwardsCurve(conf) {\n // NOTE: Important as we are creating point in Base.call()\n this.twisted = (conf.a | 0) !== 1;\n this.mOneA = this.twisted && (conf.a | 0) === -1;\n this.extended = this.mOneA;\n\n Base.call(this, 'edwards', conf);\n\n this.a = new BN(conf.a, 16).umod(this.red.m);\n this.a = this.a.toRed(this.red);\n this.c = new BN(conf.c, 16).toRed(this.red);\n this.c2 = this.c.redSqr();\n this.d = new BN(conf.d, 16).toRed(this.red);\n this.dd = this.d.redAdd(this.d);\n\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0);\n this.oneC = (conf.c | 0) === 1;\n}\ninherits(EdwardsCurve, Base);\nmodule.exports = EdwardsCurve;\n\nEdwardsCurve.prototype._mulA = function _mulA(num) {\n if (this.mOneA)\n return num.redNeg();\n else\n return this.a.redMul(num);\n};\n\nEdwardsCurve.prototype._mulC = function _mulC(num) {\n if (this.oneC)\n return num;\n else\n return this.c.redMul(num);\n};\n\n// Just for compatibility with Short curve\nEdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) {\n return this.point(x, y, z, t);\n};\n\nEdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var x2 = x.redSqr();\n var rhs = this.c2.redSub(this.a.redMul(x2));\n var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2));\n\n var y2 = rhs.redMul(lhs.redInvm());\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) {\n y = new BN(y, 16);\n if (!y.red)\n y = y.toRed(this.red);\n\n // x^2 = (y^2 - c^2) / (c^2 d y^2 - a)\n var y2 = y.redSqr();\n var lhs = y2.redSub(this.c2);\n var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a);\n var x2 = lhs.redMul(rhs.redInvm());\n\n if (x2.cmp(this.zero) === 0) {\n if (odd)\n throw new Error('invalid point');\n else\n return this.point(this.zero, y);\n }\n\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n if (x.fromRed().isOdd() !== odd)\n x = x.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.validate = function validate(point) {\n if (point.isInfinity())\n return true;\n\n // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2)\n point.normalize();\n\n var x2 = point.x.redSqr();\n var y2 = point.y.redSqr();\n var lhs = x2.redMul(this.a).redAdd(y2);\n var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n\n return lhs.cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && y === null && z === null) {\n this.x = this.curve.zero;\n this.y = this.curve.one;\n this.z = this.curve.one;\n this.t = this.curve.zero;\n this.zOne = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = z ? new BN(z, 16) : this.curve.one;\n this.t = t && new BN(t, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n if (this.t && !this.t.red)\n this.t = this.t.toRed(this.curve.red);\n this.zOne = this.z === this.curve.one;\n\n // Use extended coordinates\n if (this.curve.extended && !this.t) {\n this.t = this.x.redMul(this.y);\n if (!this.zOne)\n this.t = this.t.redMul(this.z.redInvm());\n }\n }\n}\ninherits(Point, Base.BasePoint);\n\nEdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nEdwardsCurve.prototype.point = function point(x, y, z, t) {\n return new Point(this, x, y, z, t);\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.x.cmpn(0) === 0 &&\n (this.y.cmp(this.z) === 0 ||\n (this.zOne && this.y.cmp(this.curve.c) === 0));\n};\n\nPoint.prototype._extDbl = function _extDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #doubling-dbl-2008-hwcd\n // 4M + 4S\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = 2 * Z1^2\n var c = this.z.redSqr();\n c = c.redIAdd(c);\n // D = a * A\n var d = this.curve._mulA(a);\n // E = (X1 + Y1)^2 - A - B\n var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);\n // G = D + B\n var g = d.redAdd(b);\n // F = G - C\n var f = g.redSub(c);\n // H = D - B\n var h = d.redSub(b);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projDbl = function _projDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #doubling-dbl-2008-bbjlp\n // #doubling-dbl-2007-bl\n // and others\n // Generally 3M + 4S or 2M + 4S\n\n // B = (X1 + Y1)^2\n var b = this.x.redAdd(this.y).redSqr();\n // C = X1^2\n var c = this.x.redSqr();\n // D = Y1^2\n var d = this.y.redSqr();\n\n var nx;\n var ny;\n var nz;\n var e;\n var h;\n var j;\n if (this.curve.twisted) {\n // E = a * C\n e = this.curve._mulA(c);\n // F = E + D\n var f = e.redAdd(d);\n if (this.zOne) {\n // X3 = (B - C - D) * (F - 2)\n nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two));\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F^2 - 2 * F\n nz = f.redSqr().redSub(f).redSub(f);\n } else {\n // H = Z1^2\n h = this.z.redSqr();\n // J = F - 2 * H\n j = f.redSub(h).redISub(h);\n // X3 = (B-C-D)*J\n nx = b.redSub(c).redISub(d).redMul(j);\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F * J\n nz = f.redMul(j);\n }\n } else {\n // E = C + D\n e = c.redAdd(d);\n // H = (c * Z1)^2\n h = this.curve._mulC(this.z).redSqr();\n // J = E - 2 * H\n j = e.redSub(h).redSub(h);\n // X3 = c * (B - E) * J\n nx = this.curve._mulC(b.redISub(e)).redMul(j);\n // Y3 = c * E * (C - D)\n ny = this.curve._mulC(e).redMul(c.redISub(d));\n // Z3 = E * J\n nz = e.redMul(j);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n // Double in extended coordinates\n if (this.curve.extended)\n return this._extDbl();\n else\n return this._projDbl();\n};\n\nPoint.prototype._extAdd = function _extAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #addition-add-2008-hwcd-3\n // 8M\n\n // A = (Y1 - X1) * (Y2 - X2)\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));\n // B = (Y1 + X1) * (Y2 + X2)\n var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));\n // C = T1 * k * T2\n var c = this.t.redMul(this.curve.dd).redMul(p.t);\n // D = Z1 * 2 * Z2\n var d = this.z.redMul(p.z.redAdd(p.z));\n // E = B - A\n var e = b.redSub(a);\n // F = D - C\n var f = d.redSub(c);\n // G = D + C\n var g = d.redAdd(c);\n // H = B + A\n var h = b.redAdd(a);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projAdd = function _projAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #addition-add-2008-bbjlp\n // #addition-add-2007-bl\n // 10M + 1S\n\n // A = Z1 * Z2\n var a = this.z.redMul(p.z);\n // B = A^2\n var b = a.redSqr();\n // C = X1 * X2\n var c = this.x.redMul(p.x);\n // D = Y1 * Y2\n var d = this.y.redMul(p.y);\n // E = d * C * D\n var e = this.curve.d.redMul(c).redMul(d);\n // F = B - E\n var f = b.redSub(e);\n // G = B + E\n var g = b.redAdd(e);\n // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D)\n var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d);\n var nx = a.redMul(f).redMul(tmp);\n var ny;\n var nz;\n if (this.curve.twisted) {\n // Y3 = A * G * (D - a * C)\n ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)));\n // Z3 = F * G\n nz = f.redMul(g);\n } else {\n // Y3 = A * G * (D - C)\n ny = a.redMul(g).redMul(d.redSub(c));\n // Z3 = c * F * G\n nz = this.curve._mulC(f).redMul(g);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.add = function add(p) {\n if (this.isInfinity())\n return p;\n if (p.isInfinity())\n return this;\n\n if (this.curve.extended)\n return this._extAdd(p);\n else\n return this._projAdd(p);\n};\n\nPoint.prototype.mul = function mul(k) {\n if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true);\n};\n\nPoint.prototype.normalize = function normalize() {\n if (this.zOne)\n return this;\n\n // Normalize coordinates\n var zi = this.z.redInvm();\n this.x = this.x.redMul(zi);\n this.y = this.y.redMul(zi);\n if (this.t)\n this.t = this.t.redMul(zi);\n this.z = this.curve.one;\n this.zOne = true;\n return this;\n};\n\nPoint.prototype.neg = function neg() {\n return this.curve.point(this.x.redNeg(),\n this.y,\n this.z,\n this.t && this.t.redNeg());\n};\n\nPoint.prototype.getX = function getX() {\n this.normalize();\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n this.normalize();\n return this.y.fromRed();\n};\n\nPoint.prototype.eq = function eq(other) {\n return this === other ||\n this.getX().cmp(other.getX()) === 0 &&\n this.getY().cmp(other.getY()) === 0;\n};\n\nPoint.prototype.eqXToP = function eqXToP(x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(this.z);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\n// Compatibility with BaseCurve\nPoint.prototype.toP = Point.prototype.normalize;\nPoint.prototype.mixedAdd = Point.prototype.add;\n","'use strict';\n\nvar curve = exports;\n\ncurve.base = require('./base');\ncurve.short = require('./short');\ncurve.mont = require('./mont');\ncurve.edwards = require('./edwards');\n","'use strict';\n\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar utils = require('../utils');\n\nfunction MontCurve(conf) {\n Base.call(this, 'mont', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.i4 = new BN(4).toRed(this.red).redInvm();\n this.two = new BN(2).toRed(this.red);\n this.a24 = this.i4.redMul(this.a.redAdd(this.two));\n}\ninherits(MontCurve, Base);\nmodule.exports = MontCurve;\n\nMontCurve.prototype.validate = function validate(point) {\n var x = point.normalize().x;\n var x2 = x.redSqr();\n var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x);\n var y = rhs.redSqrt();\n\n return y.redSqr().cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, z) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && z === null) {\n this.x = this.curve.one;\n this.z = this.curve.zero;\n } else {\n this.x = new BN(x, 16);\n this.z = new BN(z, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n }\n}\ninherits(Point, Base.BasePoint);\n\nMontCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n};\n\nMontCurve.prototype.point = function point(x, z) {\n return new Point(this, x, z);\n};\n\nMontCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nPoint.prototype.precompute = function precompute() {\n // No-op\n};\n\nPoint.prototype._encode = function _encode() {\n return this.getX().toArray('be', this.curve.p.byteLength());\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n\nPoint.prototype.dbl = function dbl() {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3\n // 2M + 2S + 4A\n\n // A = X1 + Z1\n var a = this.x.redAdd(this.z);\n // AA = A^2\n var aa = a.redSqr();\n // B = X1 - Z1\n var b = this.x.redSub(this.z);\n // BB = B^2\n var bb = b.redSqr();\n // C = AA - BB\n var c = aa.redSub(bb);\n // X3 = AA * BB\n var nx = aa.redMul(bb);\n // Z3 = C * (BB + A24 * C)\n var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.add = function add() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.diffAdd = function diffAdd(p, diff) {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3\n // 4M + 2S + 6A\n\n // A = X2 + Z2\n var a = this.x.redAdd(this.z);\n // B = X2 - Z2\n var b = this.x.redSub(this.z);\n // C = X3 + Z3\n var c = p.x.redAdd(p.z);\n // D = X3 - Z3\n var d = p.x.redSub(p.z);\n // DA = D * A\n var da = d.redMul(a);\n // CB = C * B\n var cb = c.redMul(b);\n // X5 = Z1 * (DA + CB)^2\n var nx = diff.z.redMul(da.redAdd(cb).redSqr());\n // Z5 = X1 * (DA - CB)^2\n var nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.mul = function mul(k) {\n var t = k.clone();\n var a = this; // (N / 2) * Q + Q\n var b = this.curve.point(null, null); // (N / 2) * Q\n var c = this; // Q\n\n for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1))\n bits.push(t.andln(1));\n\n for (var i = bits.length - 1; i >= 0; i--) {\n if (bits[i] === 0) {\n // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q\n a = a.diffAdd(b, c);\n // N * Q = 2 * ((N / 2) * Q + Q))\n b = b.dbl();\n } else {\n // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q)\n b = a.diffAdd(b, c);\n // N * Q + Q = 2 * ((N / 2) * Q + Q)\n a = a.dbl();\n }\n }\n return b;\n};\n\nPoint.prototype.mulAdd = function mulAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.jumlAdd = function jumlAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.eq = function eq(other) {\n return this.getX().cmp(other.getX()) === 0;\n};\n\nPoint.prototype.normalize = function normalize() {\n this.x = this.x.redMul(this.z.redInvm());\n this.z = this.curve.one;\n return this;\n};\n\nPoint.prototype.getX = function getX() {\n // Normalize coordinates\n this.normalize();\n\n return this.x.fromRed();\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction ShortCurve(conf) {\n Base.call(this, 'short', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.tinv = this.two.redInvm();\n\n this.zeroA = this.a.fromRed().cmpn(0) === 0;\n this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;\n\n // If the curve is endomorphic, precalculate beta and lambda\n this.endo = this._getEndomorphism(conf);\n this._endoWnafT1 = new Array(4);\n this._endoWnafT2 = new Array(4);\n}\ninherits(ShortCurve, Base);\nmodule.exports = ShortCurve;\n\nShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {\n // No efficient endomorphism\n if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)\n return;\n\n // Compute beta and lambda, that lambda * P = (beta * Px; Py)\n var beta;\n var lambda;\n if (conf.beta) {\n beta = new BN(conf.beta, 16).toRed(this.red);\n } else {\n var betas = this._getEndoRoots(this.p);\n // Choose the smallest beta\n beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];\n beta = beta.toRed(this.red);\n }\n if (conf.lambda) {\n lambda = new BN(conf.lambda, 16);\n } else {\n // Choose the lambda that is matching selected beta\n var lambdas = this._getEndoRoots(this.n);\n if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {\n lambda = lambdas[0];\n } else {\n lambda = lambdas[1];\n assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);\n }\n }\n\n // Get basis vectors, used for balanced length-two representation\n var basis;\n if (conf.basis) {\n basis = conf.basis.map(function(vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n });\n } else {\n basis = this._getEndoBasis(lambda);\n }\n\n return {\n beta: beta,\n lambda: lambda,\n basis: basis,\n };\n};\n\nShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {\n // Find roots of for x^2 + x + 1 in F\n // Root = (-1 +- Sqrt(-3)) / 2\n //\n var red = num === this.p ? this.red : BN.mont(num);\n var tinv = new BN(2).toRed(red).redInvm();\n var ntinv = tinv.redNeg();\n\n var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv);\n\n var l1 = ntinv.redAdd(s).fromRed();\n var l2 = ntinv.redSub(s).fromRed();\n return [ l1, l2 ];\n};\n\nShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {\n // aprxSqrt >= sqrt(this.n)\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));\n\n // 3.74\n // Run EGCD, until r(L + 1) < aprxSqrt\n var u = lambda;\n var v = this.n.clone();\n var x1 = new BN(1);\n var y1 = new BN(0);\n var x2 = new BN(0);\n var y2 = new BN(1);\n\n // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)\n var a0;\n var b0;\n // First vector\n var a1;\n var b1;\n // Second vector\n var a2;\n var b2;\n\n var prevR;\n var i = 0;\n var r;\n var x;\n while (u.cmpn(0) !== 0) {\n var q = v.div(u);\n r = v.sub(q.mul(u));\n x = x2.sub(q.mul(x1));\n var y = y2.sub(q.mul(y1));\n\n if (!a1 && r.cmp(aprxSqrt) < 0) {\n a0 = prevR.neg();\n b0 = x1;\n a1 = r.neg();\n b1 = x;\n } else if (a1 && ++i === 2) {\n break;\n }\n prevR = r;\n\n v = u;\n u = r;\n x2 = x1;\n x1 = x;\n y2 = y1;\n y1 = y;\n }\n a2 = r.neg();\n b2 = x;\n\n var len1 = a1.sqr().add(b1.sqr());\n var len2 = a2.sqr().add(b2.sqr());\n if (len2.cmp(len1) >= 0) {\n a2 = a0;\n b2 = b0;\n }\n\n // Normalize signs\n if (a1.negative) {\n a1 = a1.neg();\n b1 = b1.neg();\n }\n if (a2.negative) {\n a2 = a2.neg();\n b2 = b2.neg();\n }\n\n return [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ];\n};\n\nShortCurve.prototype._endoSplit = function _endoSplit(k) {\n var basis = this.endo.basis;\n var v1 = basis[0];\n var v2 = basis[1];\n\n var c1 = v2.b.mul(k).divRound(this.n);\n var c2 = v1.b.neg().mul(k).divRound(this.n);\n\n var p1 = c1.mul(v1.a);\n var p2 = c2.mul(v2.a);\n var q1 = c1.mul(v1.b);\n var q2 = c2.mul(v2.b);\n\n // Calculate answer\n var k1 = k.sub(p1).sub(p2);\n var k2 = q1.add(q2).neg();\n return { k1: k1, k2: k2 };\n};\n\nShortCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n // XXX Is there any way to tell if the number is odd without converting it\n // to non-red form?\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nShortCurve.prototype.validate = function validate(point) {\n if (point.inf)\n return true;\n\n var x = point.x;\n var y = point.y;\n\n var ax = this.a.redMul(x);\n var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n};\n\nShortCurve.prototype._endoWnafMulAdd =\n function _endoWnafMulAdd(points, coeffs, jacobianResult) {\n var npoints = this._endoWnafT1;\n var ncoeffs = this._endoWnafT2;\n for (var i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]);\n var p = points[i];\n var beta = p._getBeta();\n\n if (split.k1.negative) {\n split.k1.ineg();\n p = p.neg(true);\n }\n if (split.k2.negative) {\n split.k2.ineg();\n beta = beta.neg(true);\n }\n\n npoints[i * 2] = p;\n npoints[i * 2 + 1] = beta;\n ncoeffs[i * 2] = split.k1;\n ncoeffs[i * 2 + 1] = split.k2;\n }\n var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult);\n\n // Clean-up references to points and coefficients\n for (var j = 0; j < i * 2; j++) {\n npoints[j] = null;\n ncoeffs[j] = null;\n }\n return res;\n };\n\nfunction Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, 'affine');\n if (x === null && y === null) {\n this.x = null;\n this.y = null;\n this.inf = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n // Force redgomery representation when loading from JSON\n if (isRed) {\n this.x.forceRed(this.curve.red);\n this.y.forceRed(this.curve.red);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n this.inf = false;\n }\n}\ninherits(Point, Base.BasePoint);\n\nShortCurve.prototype.point = function point(x, y, isRed) {\n return new Point(this, x, y, isRed);\n};\n\nShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {\n return Point.fromJSON(this, obj, red);\n};\n\nPoint.prototype._getBeta = function _getBeta() {\n if (!this.curve.endo)\n return;\n\n var pre = this.precomputed;\n if (pre && pre.beta)\n return pre.beta;\n\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve;\n var endoMul = function(p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n pre.beta = beta;\n beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n };\n }\n return beta;\n};\n\nPoint.prototype.toJSON = function toJSON() {\n if (!this.precomputed)\n return [ this.x, this.y ];\n\n return [ this.x, this.y, this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n } ];\n};\n\nPoint.fromJSON = function fromJSON(curve, obj, red) {\n if (typeof obj === 'string')\n obj = JSON.parse(obj);\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2])\n return res;\n\n function obj2point(obj) {\n return curve.point(obj[0], obj[1], red);\n }\n\n var pre = obj[2];\n res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [ res ].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [ res ].concat(pre.naf.points.map(obj2point)),\n },\n };\n return res;\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n return this.inf;\n};\n\nPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.inf)\n return p;\n\n // P + O = P\n if (p.inf)\n return this;\n\n // P + P = 2P\n if (this.eq(p))\n return this.dbl();\n\n // P + (-P) = O\n if (this.neg().eq(p))\n return this.curve.point(null, null);\n\n // P + Q = O\n if (this.x.cmp(p.x) === 0)\n return this.curve.point(null, null);\n\n var c = this.y.redSub(p.y);\n if (c.cmpn(0) !== 0)\n c = c.redMul(this.x.redSub(p.x).redInvm());\n var nx = c.redSqr().redISub(this.x).redISub(p.x);\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.inf)\n return this;\n\n // 2P = O\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0)\n return this.curve.point(null, null);\n\n var a = this.curve.a;\n\n var x2 = this.x.redSqr();\n var dyinv = ys1.redInvm();\n var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);\n\n var nx = c.redSqr().redISub(this.x.redAdd(this.x));\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.getX = function getX() {\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n return this.y.fromRed();\n};\n\nPoint.prototype.mul = function mul(k) {\n k = new BN(k, 16);\n if (this.isInfinity())\n return this;\n else if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else if (this.curve.endo)\n return this.curve._endoWnafMulAdd([ this ], [ k ]);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs, true);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2, true);\n};\n\nPoint.prototype.eq = function eq(p) {\n return this === p ||\n this.inf === p.inf &&\n (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);\n};\n\nPoint.prototype.neg = function neg(_precompute) {\n if (this.inf)\n return this;\n\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed;\n var negate = function(p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n};\n\nPoint.prototype.toJ = function toJ() {\n if (this.inf)\n return this.curve.jpoint(null, null, null);\n\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n};\n\nfunction JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, 'jacobian');\n if (x === null && y === null && z === null) {\n this.x = this.curve.one;\n this.y = this.curve.one;\n this.z = new BN(0);\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = new BN(z, 16);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n\n this.zOne = this.z === this.curve.one;\n}\ninherits(JPoint, Base.BasePoint);\n\nShortCurve.prototype.jpoint = function jpoint(x, y, z) {\n return new JPoint(this, x, y, z);\n};\n\nJPoint.prototype.toP = function toP() {\n if (this.isInfinity())\n return this.curve.point(null, null);\n\n var zinv = this.z.redInvm();\n var zinv2 = zinv.redSqr();\n var ax = this.x.redMul(zinv2);\n var ay = this.y.redMul(zinv2).redMul(zinv);\n\n return this.curve.point(ax, ay);\n};\n\nJPoint.prototype.neg = function neg() {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n};\n\nJPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.isInfinity())\n return p;\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 12M + 4S + 7A\n var pz2 = p.z.redSqr();\n var z2 = this.z.redSqr();\n var u1 = this.x.redMul(pz2);\n var u2 = p.x.redMul(z2);\n var s1 = this.y.redMul(pz2.redMul(p.z));\n var s2 = p.y.redMul(z2.redMul(this.z));\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(p.z).redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mixedAdd = function mixedAdd(p) {\n // O + P = P\n if (this.isInfinity())\n return p.toJ();\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 8M + 3S + 7A\n var z2 = this.z.redSqr();\n var u1 = this.x;\n var u2 = p.x.redMul(z2);\n var s1 = this.y;\n var s2 = p.y.redMul(z2).redMul(this.z);\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.dblp = function dblp(pow) {\n if (pow === 0)\n return this;\n if (this.isInfinity())\n return this;\n if (!pow)\n return this.dbl();\n\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++)\n r = r.dbl();\n return r;\n }\n\n // 1M + 2S + 1A + N * (4S + 5M + 8A)\n // N = 1 => 6M + 6S + 9A\n var a = this.curve.a;\n var tinv = this.curve.tinv;\n\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n // Reuse results\n var jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr();\n var jyd2 = jyd.redSqr();\n var jyd4 = jyd2.redSqr();\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var t1 = jx.redMul(jyd2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n var dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n if (i + 1 < pow)\n jz4 = jz4.redMul(jyd4);\n\n jx = nx;\n jz = nz;\n jyd = dny;\n }\n\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n};\n\nJPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n if (this.curve.zeroA)\n return this._zeroDbl();\n else if (this.curve.threeA)\n return this._threeDbl();\n else\n return this._dbl();\n};\n\nJPoint.prototype._zeroDbl = function _zeroDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 14A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // T = M ^ 2 - 2*S\n var t = m.redSqr().redISub(s).redISub(s);\n\n // 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2*Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-dbl-2009-l\n // 2M + 5S + 13A\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = B^2\n var c = b.redSqr();\n // D = 2 * ((X1 + B)^2 - A - C)\n var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n // E = 3 * A\n var e = a.redAdd(a).redIAdd(a);\n // F = E^2\n var f = e.redSqr();\n\n // 8 * C\n var c8 = c.redIAdd(c);\n c8 = c8.redIAdd(c8);\n c8 = c8.redIAdd(c8);\n\n // X3 = F - 2 * D\n nx = f.redISub(d).redISub(d);\n // Y3 = E * (D - X3) - 8 * C\n ny = e.redMul(d.redISub(nx)).redISub(c8);\n // Z3 = 2 * Y1 * Z1\n nz = this.y.redMul(this.z);\n nz = nz.redIAdd(nz);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._threeDbl = function _threeDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 15A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);\n // T = M^2 - 2 * S\n var t = m.redSqr().redISub(s).redISub(s);\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2 * Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b\n // 3M + 5S\n\n // delta = Z1^2\n var delta = this.z.redSqr();\n // gamma = Y1^2\n var gamma = this.y.redSqr();\n // beta = X1 * gamma\n var beta = this.x.redMul(gamma);\n // alpha = 3 * (X1 - delta) * (X1 + delta)\n var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n // X3 = alpha^2 - 8 * beta\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n nx = alpha.redSqr().redISub(beta8);\n // Z3 = (Y1 + Z1)^2 - gamma - delta\n nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);\n // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2\n var ggamma8 = gamma.redSqr();\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._dbl = function _dbl() {\n var a = this.curve.a;\n\n // 4M + 6S + 10A\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n var jx2 = jx.redSqr();\n var jy2 = jy.redSqr();\n\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n\n var jyd8 = jy2.redSqr();\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n var ny = c.redMul(t2).redISub(jyd8);\n var nz = jy.redAdd(jy).redMul(jz);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.trpl = function trpl() {\n if (!this.curve.zeroA)\n return this.dbl().add(this);\n\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl\n // 5M + 10S + ...\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // ZZ = Z1^2\n var zz = this.z.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // M = 3 * XX + a * ZZ2; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // MM = M^2\n var mm = m.redSqr();\n // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM\n var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n e = e.redIAdd(e);\n e = e.redAdd(e).redIAdd(e);\n e = e.redISub(mm);\n // EE = E^2\n var ee = e.redSqr();\n // T = 16*YYYY\n var t = yyyy.redIAdd(yyyy);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n // U = (M + E)^2 - MM - EE - T\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);\n // X3 = 4 * (X1 * EE - 4 * YY * U)\n var yyu4 = yy.redMul(u);\n yyu4 = yyu4.redIAdd(yyu4);\n yyu4 = yyu4.redIAdd(yyu4);\n var nx = this.x.redMul(ee).redISub(yyu4);\n nx = nx.redIAdd(nx);\n nx = nx.redIAdd(nx);\n // Y3 = 8 * Y1 * (U * (T - U) - E * EE)\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n // Z3 = (Z1 + E)^2 - ZZ - EE\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mul = function mul(k, kbase) {\n k = new BN(k, kbase);\n\n return this.curve._wnafMul(this, k);\n};\n\nJPoint.prototype.eq = function eq(p) {\n if (p.type === 'affine')\n return this.eq(p.toJ());\n\n if (this === p)\n return true;\n\n // x1 * z2^2 == x2 * z1^2\n var z2 = this.z.redSqr();\n var pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)\n return false;\n\n // y1 * z2^3 == y2 * z1^3\n var z3 = z2.redMul(this.z);\n var pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n};\n\nJPoint.prototype.eqXToP = function eqXToP(x) {\n var zs = this.z.redSqr();\n var rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(zs);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\nJPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nJPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n","'use strict';\n\nvar curves = exports;\n\nvar hash = require('hash.js');\nvar curve = require('./curve');\nvar utils = require('./utils');\n\nvar assert = utils.assert;\n\nfunction PresetCurve(options) {\n if (options.type === 'short')\n this.curve = new curve.short(options);\n else if (options.type === 'edwards')\n this.curve = new curve.edwards(options);\n else\n this.curve = new curve.mont(options);\n this.g = this.curve.g;\n this.n = this.curve.n;\n this.hash = options.hash;\n\n assert(this.g.validate(), 'Invalid curve');\n assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');\n}\ncurves.PresetCurve = PresetCurve;\n\nfunction defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n get: function() {\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: [\n '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',\n '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811',\n ],\n});\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: [\n 'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',\n 'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34',\n ],\n});\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: [\n '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',\n '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5',\n ],\n});\n\ndefineCurve('p384', {\n type: 'short',\n prime: null,\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 ffffffff',\n a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 fffffffc',\n b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +\n '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',\n n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +\n 'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',\n hash: hash.sha384,\n gRed: false,\n g: [\n 'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +\n '5502f25d bf55296c 3a545e38 72760ab7',\n '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +\n '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f',\n ],\n});\n\ndefineCurve('p521', {\n type: 'short',\n prime: null,\n p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff',\n a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff fffffffc',\n b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +\n '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +\n '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',\n n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +\n 'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',\n hash: hash.sha512,\n gRed: false,\n g: [\n '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +\n '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +\n 'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',\n '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +\n '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +\n '3fad0761 353c7086 a272c240 88be9476 9fd16650',\n ],\n});\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: [\n '9',\n ],\n});\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: [\n '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',\n\n // 4/5\n '6666666666666666666666666666666666666666666666666666666666666658',\n ],\n});\n\nvar pre;\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\n // Precomputed endomorphism\n beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',\n lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',\n basis: [\n {\n a: '3086d221a7d46bcde86c90e49284eb15',\n b: '-e4437ed6010e88286f547fa90abfe4c3',\n },\n {\n a: '114ca50f7a8e2f3f657c1108d9d44cfd8',\n b: '3086d221a7d46bcde86c90e49284eb15',\n },\n ],\n\n gRed: false,\n g: [\n '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',\n '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',\n pre,\n ],\n});\n","'use strict';\n\nvar BN = require('bn.js');\nvar HmacDRBG = require('hmac-drbg');\nvar utils = require('../utils');\nvar curves = require('../curves');\nvar rand = require('brorand');\nvar assert = utils.assert;\n\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EC(options) {\n if (!(this instanceof EC))\n return new EC(options);\n\n // Shortcut `elliptic.ec(curve-name)`\n if (typeof options === 'string') {\n assert(Object.prototype.hasOwnProperty.call(curves, options),\n 'Unknown curve ' + options);\n\n options = curves[options];\n }\n\n // Shortcut for `elliptic.ec(elliptic.curves.curveName)`\n if (options instanceof curves.PresetCurve)\n options = { curve: options };\n\n this.curve = options.curve.curve;\n this.n = this.curve.n;\n this.nh = this.n.ushrn(1);\n this.g = this.curve.g;\n\n // Point on curve\n this.g = options.curve.g;\n this.g.precompute(options.curve.n.bitLength() + 1);\n\n // Hash for function for DRBG\n this.hash = options.hash || options.curve.hash;\n}\nmodule.exports = EC;\n\nEC.prototype.keyPair = function keyPair(options) {\n return new KeyPair(this, options);\n};\n\nEC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n};\n\nEC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n};\n\nEC.prototype.genKeyPair = function genKeyPair(options) {\n if (!options)\n options = {};\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: options.entropy && options.entropyEnc || 'utf8',\n nonce: this.n.toArray(),\n });\n\n var bytes = this.n.byteLength();\n var ns2 = this.n.sub(new BN(2));\n for (;;) {\n var priv = new BN(drbg.generate(bytes));\n if (priv.cmp(ns2) > 0)\n continue;\n\n priv.iaddn(1);\n return this.keyFromPrivate(priv);\n }\n};\n\nEC.prototype._truncateToN = function _truncateToN(msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n if (delta > 0)\n msg = msg.ushrn(delta);\n if (!truncOnly && msg.cmp(this.n) >= 0)\n return msg.sub(this.n);\n else\n return msg;\n};\n\nEC.prototype.sign = function sign(msg, key, enc, options) {\n if (typeof enc === 'object') {\n options = enc;\n enc = null;\n }\n if (!options)\n options = {};\n\n key = this.keyFromPrivate(key, enc);\n msg = this._truncateToN(new BN(msg, 16));\n\n // Zero-extend key to provide enough entropy\n var bytes = this.n.byteLength();\n var bkey = key.getPrivate().toArray('be', bytes);\n\n // Zero-extend nonce to have the same byte size as N\n var nonce = msg.toArray('be', bytes);\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce: nonce,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n });\n\n // Number of bytes to generate\n var ns1 = this.n.sub(new BN(1));\n\n for (var iter = 0; ; iter++) {\n var k = options.k ?\n options.k(iter) :\n new BN(drbg.generate(this.n.byteLength()));\n k = this._truncateToN(k, true);\n if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)\n continue;\n\n var kp = this.g.mul(k);\n if (kp.isInfinity())\n continue;\n\n var kpX = kp.getX();\n var r = kpX.umod(this.n);\n if (r.cmpn(0) === 0)\n continue;\n\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n s = s.umod(this.n);\n if (s.cmpn(0) === 0)\n continue;\n\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |\n (kpX.cmp(r) !== 0 ? 2 : 0);\n\n // Use complement of `s`, if it is > `n / 2`\n if (options.canonical && s.cmp(this.nh) > 0) {\n s = this.n.sub(s);\n recoveryParam ^= 1;\n }\n\n return new Signature({ r: r, s: s, recoveryParam: recoveryParam });\n }\n};\n\nEC.prototype.verify = function verify(msg, signature, key, enc) {\n msg = this._truncateToN(new BN(msg, 16));\n key = this.keyFromPublic(key, enc);\n signature = new Signature(signature, 'hex');\n\n // Perform primitive values validation\n var r = signature.r;\n var s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)\n return false;\n if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)\n return false;\n\n // Validate signature\n var sinv = s.invm(this.n);\n var u1 = sinv.mul(msg).umod(this.n);\n var u2 = sinv.mul(r).umod(this.n);\n var p;\n\n if (!this.curve._maxwellTrick) {\n p = this.g.mulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n return p.getX().umod(this.n).cmp(r) === 0;\n }\n\n // NOTE: Greg Maxwell's trick, inspired by:\n // https://git.io/vad3K\n\n p = this.g.jmulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n // Compare `p.x` of Jacobian point with `r`,\n // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the\n // inverse of `p.z^2`\n return p.eqXToP(r);\n};\n\nEC.prototype.recoverPubKey = function(msg, signature, j, enc) {\n assert((3 & j) === j, 'The recovery param is more than two bits');\n signature = new Signature(signature, enc);\n\n var n = this.n;\n var e = new BN(msg);\n var r = signature.r;\n var s = signature.s;\n\n // A set LSB signifies that the y-coordinate is odd\n var isYOdd = j & 1;\n var isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error('Unable to find sencond key candinate');\n\n // 1.1. Let x = r + jn.\n if (isSecondKey)\n r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);\n else\n r = this.curve.pointFromX(r, isYOdd);\n\n var rInv = signature.r.invm(n);\n var s1 = n.sub(e).mul(rInv).umod(n);\n var s2 = s.mul(rInv).umod(n);\n\n // 1.6.1 Compute Q = r^-1 (sR - eG)\n // Q = r^-1 (sR + -eG)\n return this.g.mulAdd(s1, r, s2);\n};\n\nEC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {\n signature = new Signature(signature, enc);\n if (signature.recoveryParam !== null)\n return signature.recoveryParam;\n\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch (e) {\n continue;\n }\n\n if (Qprime.eq(Q))\n return i;\n }\n throw new Error('Unable to find valid recovery factor');\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction KeyPair(ec, options) {\n this.ec = ec;\n this.priv = null;\n this.pub = null;\n\n // KeyPair(ec, { priv: ..., pub: ... })\n if (options.priv)\n this._importPrivate(options.priv, options.privEnc);\n if (options.pub)\n this._importPublic(options.pub, options.pubEnc);\n}\nmodule.exports = KeyPair;\n\nKeyPair.fromPublic = function fromPublic(ec, pub, enc) {\n if (pub instanceof KeyPair)\n return pub;\n\n return new KeyPair(ec, {\n pub: pub,\n pubEnc: enc,\n });\n};\n\nKeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {\n if (priv instanceof KeyPair)\n return priv;\n\n return new KeyPair(ec, {\n priv: priv,\n privEnc: enc,\n });\n};\n\nKeyPair.prototype.validate = function validate() {\n var pub = this.getPublic();\n\n if (pub.isInfinity())\n return { result: false, reason: 'Invalid public key' };\n if (!pub.validate())\n return { result: false, reason: 'Public key is not a point' };\n if (!pub.mul(this.ec.curve.n).isInfinity())\n return { result: false, reason: 'Public key * N != O' };\n\n return { result: true, reason: null };\n};\n\nKeyPair.prototype.getPublic = function getPublic(compact, enc) {\n // compact is optional argument\n if (typeof compact === 'string') {\n enc = compact;\n compact = null;\n }\n\n if (!this.pub)\n this.pub = this.ec.g.mul(this.priv);\n\n if (!enc)\n return this.pub;\n\n return this.pub.encode(enc, compact);\n};\n\nKeyPair.prototype.getPrivate = function getPrivate(enc) {\n if (enc === 'hex')\n return this.priv.toString(16, 2);\n else\n return this.priv;\n};\n\nKeyPair.prototype._importPrivate = function _importPrivate(key, enc) {\n this.priv = new BN(key, enc || 16);\n\n // Ensure that the priv won't be bigger than n, otherwise we may fail\n // in fixed multiplication method\n this.priv = this.priv.umod(this.ec.curve.n);\n};\n\nKeyPair.prototype._importPublic = function _importPublic(key, enc) {\n if (key.x || key.y) {\n // Montgomery points only have an `x` coordinate.\n // Weierstrass/Edwards points on the other hand have both `x` and\n // `y` coordinates.\n if (this.ec.curve.type === 'mont') {\n assert(key.x, 'Need x coordinate');\n } else if (this.ec.curve.type === 'short' ||\n this.ec.curve.type === 'edwards') {\n assert(key.x && key.y, 'Need both x and y coordinate');\n }\n this.pub = this.ec.curve.point(key.x, key.y);\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n};\n\n// ECDH\nKeyPair.prototype.derive = function derive(pub) {\n if(!pub.validate()) {\n assert(pub.validate(), 'public point not validated');\n }\n return pub.mul(this.priv).getX();\n};\n\n// ECDSA\nKeyPair.prototype.sign = function sign(msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n};\n\nKeyPair.prototype.verify = function verify(msg, signature) {\n return this.ec.verify(msg, signature, this);\n};\n\nKeyPair.prototype.inspect = function inspect() {\n return '';\n};\n","'use strict';\n\nvar BN = require('bn.js');\n\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction Signature(options, enc) {\n if (options instanceof Signature)\n return options;\n\n if (this._importDER(options, enc))\n return;\n\n assert(options.r && options.s, 'Signature without r or s');\n this.r = new BN(options.r, 16);\n this.s = new BN(options.s, 16);\n if (options.recoveryParam === undefined)\n this.recoveryParam = null;\n else\n this.recoveryParam = options.recoveryParam;\n}\nmodule.exports = Signature;\n\nfunction Position() {\n this.place = 0;\n}\n\nfunction getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 0x80)) {\n return initial;\n }\n var octetLen = initial & 0xf;\n\n // Indefinite length or overflow\n if (octetLen === 0 || octetLen > 4) {\n return false;\n }\n\n var val = 0;\n for (var i = 0, off = p.place; i < octetLen; i++, off++) {\n val <<= 8;\n val |= buf[off];\n val >>>= 0;\n }\n\n // Leading zeroes\n if (val <= 0x7f) {\n return false;\n }\n\n p.place = off;\n return val;\n}\n\nfunction rmPadding(buf) {\n var i = 0;\n var len = buf.length - 1;\n while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {\n i++;\n }\n if (i === 0) {\n return buf;\n }\n return buf.slice(i);\n}\n\nSignature.prototype._importDER = function _importDER(data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 0x30) {\n return false;\n }\n var len = getLength(data, p);\n if (len === false) {\n return false;\n }\n if ((len + p.place) !== data.length) {\n return false;\n }\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var rlen = getLength(data, p);\n if (rlen === false) {\n return false;\n }\n var r = data.slice(p.place, rlen + p.place);\n p.place += rlen;\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var slen = getLength(data, p);\n if (slen === false) {\n return false;\n }\n if (data.length !== slen + p.place) {\n return false;\n }\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0) {\n if (r[1] & 0x80) {\n r = r.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n if (s[0] === 0) {\n if (s[1] & 0x80) {\n s = s.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n\n this.r = new BN(r);\n this.s = new BN(s);\n this.recoveryParam = null;\n\n return true;\n};\n\nfunction constructLength(arr, len) {\n if (len < 0x80) {\n arr.push(len);\n return;\n }\n var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);\n arr.push(octets | 0x80);\n while (--octets) {\n arr.push((len >>> (octets << 3)) & 0xff);\n }\n arr.push(len);\n}\n\nSignature.prototype.toDER = function toDER(enc) {\n var r = this.r.toArray();\n var s = this.s.toArray();\n\n // Pad values\n if (r[0] & 0x80)\n r = [ 0 ].concat(r);\n // Pad values\n if (s[0] & 0x80)\n s = [ 0 ].concat(s);\n\n r = rmPadding(r);\n s = rmPadding(s);\n\n while (!s[0] && !(s[1] & 0x80)) {\n s = s.slice(1);\n }\n var arr = [ 0x02 ];\n constructLength(arr, r.length);\n arr = arr.concat(r);\n arr.push(0x02);\n constructLength(arr, s.length);\n var backHalf = arr.concat(s);\n var res = [ 0x30 ];\n constructLength(res, backHalf.length);\n res = res.concat(backHalf);\n return utils.encode(res, enc);\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar curves = require('../curves');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EDDSA(curve) {\n assert(curve === 'ed25519', 'only tested with ed25519 so far');\n\n if (!(this instanceof EDDSA))\n return new EDDSA(curve);\n\n curve = curves[curve].curve;\n this.curve = curve;\n this.g = curve.g;\n this.g.precompute(curve.n.bitLength() + 1);\n\n this.pointClass = curve.point().constructor;\n this.encodingLength = Math.ceil(curve.n.bitLength() / 8);\n this.hash = hash.sha512;\n}\n\nmodule.exports = EDDSA;\n\n/**\n* @param {Array|String} message - message bytes\n* @param {Array|String|KeyPair} secret - secret bytes or a keypair\n* @returns {Signature} - signature\n*/\nEDDSA.prototype.sign = function sign(message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret);\n var r = this.hashInt(key.messagePrefix(), message);\n var R = this.g.mul(r);\n var Rencoded = this.encodePoint(R);\n var s_ = this.hashInt(Rencoded, key.pubBytes(), message)\n .mul(key.priv());\n var S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });\n};\n\n/**\n* @param {Array} message - message bytes\n* @param {Array|String|Signature} sig - sig bytes\n* @param {Array|String|Point|KeyPair} pub - public key\n* @returns {Boolean} - true if public key matches sig of message\n*/\nEDDSA.prototype.verify = function verify(message, sig, pub) {\n message = parseBytes(message);\n sig = this.makeSignature(sig);\n var key = this.keyFromPublic(pub);\n var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);\n var SG = this.g.mul(sig.S());\n var RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n};\n\nEDDSA.prototype.hashInt = function hashInt() {\n var hash = this.hash();\n for (var i = 0; i < arguments.length; i++)\n hash.update(arguments[i]);\n return utils.intFromLE(hash.digest()).umod(this.curve.n);\n};\n\nEDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {\n return KeyPair.fromPublic(this, pub);\n};\n\nEDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {\n return KeyPair.fromSecret(this, secret);\n};\n\nEDDSA.prototype.makeSignature = function makeSignature(sig) {\n if (sig instanceof Signature)\n return sig;\n return new Signature(this, sig);\n};\n\n/**\n* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2\n*\n* EDDSA defines methods for encoding and decoding points and integers. These are\n* helper convenience methods, that pass along to utility functions implied\n* parameters.\n*\n*/\nEDDSA.prototype.encodePoint = function encodePoint(point) {\n var enc = point.getY().toArray('le', this.encodingLength);\n enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;\n return enc;\n};\n\nEDDSA.prototype.decodePoint = function decodePoint(bytes) {\n bytes = utils.parseBytes(bytes);\n\n var lastIx = bytes.length - 1;\n var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);\n var xIsOdd = (bytes[lastIx] & 0x80) !== 0;\n\n var y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n};\n\nEDDSA.prototype.encodeInt = function encodeInt(num) {\n return num.toArray('le', this.encodingLength);\n};\n\nEDDSA.prototype.decodeInt = function decodeInt(bytes) {\n return utils.intFromLE(bytes);\n};\n\nEDDSA.prototype.isPoint = function isPoint(val) {\n return val instanceof this.pointClass;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar cachedProperty = utils.cachedProperty;\n\n/**\n* @param {EDDSA} eddsa - instance\n* @param {Object} params - public/private key parameters\n*\n* @param {Array} [params.secret] - secret seed bytes\n* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)\n* @param {Array} [params.pub] - public key point encoded as bytes\n*\n*/\nfunction KeyPair(eddsa, params) {\n this.eddsa = eddsa;\n this._secret = parseBytes(params.secret);\n if (eddsa.isPoint(params.pub))\n this._pub = params.pub;\n else\n this._pubBytes = parseBytes(params.pub);\n}\n\nKeyPair.fromPublic = function fromPublic(eddsa, pub) {\n if (pub instanceof KeyPair)\n return pub;\n return new KeyPair(eddsa, { pub: pub });\n};\n\nKeyPair.fromSecret = function fromSecret(eddsa, secret) {\n if (secret instanceof KeyPair)\n return secret;\n return new KeyPair(eddsa, { secret: secret });\n};\n\nKeyPair.prototype.secret = function secret() {\n return this._secret;\n};\n\ncachedProperty(KeyPair, 'pubBytes', function pubBytes() {\n return this.eddsa.encodePoint(this.pub());\n});\n\ncachedProperty(KeyPair, 'pub', function pub() {\n if (this._pubBytes)\n return this.eddsa.decodePoint(this._pubBytes);\n return this.eddsa.g.mul(this.priv());\n});\n\ncachedProperty(KeyPair, 'privBytes', function privBytes() {\n var eddsa = this.eddsa;\n var hash = this.hash();\n var lastIx = eddsa.encodingLength - 1;\n\n var a = hash.slice(0, eddsa.encodingLength);\n a[0] &= 248;\n a[lastIx] &= 127;\n a[lastIx] |= 64;\n\n return a;\n});\n\ncachedProperty(KeyPair, 'priv', function priv() {\n return this.eddsa.decodeInt(this.privBytes());\n});\n\ncachedProperty(KeyPair, 'hash', function hash() {\n return this.eddsa.hash().update(this.secret()).digest();\n});\n\ncachedProperty(KeyPair, 'messagePrefix', function messagePrefix() {\n return this.hash().slice(this.eddsa.encodingLength);\n});\n\nKeyPair.prototype.sign = function sign(message) {\n assert(this._secret, 'KeyPair can only verify');\n return this.eddsa.sign(message, this);\n};\n\nKeyPair.prototype.verify = function verify(message, sig) {\n return this.eddsa.verify(message, sig, this);\n};\n\nKeyPair.prototype.getSecret = function getSecret(enc) {\n assert(this._secret, 'KeyPair is public only');\n return utils.encode(this.secret(), enc);\n};\n\nKeyPair.prototype.getPublic = function getPublic(enc) {\n return utils.encode(this.pubBytes(), enc);\n};\n\nmodule.exports = KeyPair;\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar cachedProperty = utils.cachedProperty;\nvar parseBytes = utils.parseBytes;\n\n/**\n* @param {EDDSA} eddsa - eddsa instance\n* @param {Array|Object} sig -\n* @param {Array|Point} [sig.R] - R point as Point or bytes\n* @param {Array|bn} [sig.S] - S scalar as bn or bytes\n* @param {Array} [sig.Rencoded] - R point encoded\n* @param {Array} [sig.Sencoded] - S scalar encoded\n*/\nfunction Signature(eddsa, sig) {\n this.eddsa = eddsa;\n\n if (typeof sig !== 'object')\n sig = parseBytes(sig);\n\n if (Array.isArray(sig)) {\n sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n };\n }\n\n assert(sig.R && sig.S, 'Signature without R or S');\n\n if (eddsa.isPoint(sig.R))\n this._R = sig.R;\n if (sig.S instanceof BN)\n this._S = sig.S;\n\n this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;\n this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;\n}\n\ncachedProperty(Signature, 'S', function S() {\n return this.eddsa.decodeInt(this.Sencoded());\n});\n\ncachedProperty(Signature, 'R', function R() {\n return this.eddsa.decodePoint(this.Rencoded());\n});\n\ncachedProperty(Signature, 'Rencoded', function Rencoded() {\n return this.eddsa.encodePoint(this.R());\n});\n\ncachedProperty(Signature, 'Sencoded', function Sencoded() {\n return this.eddsa.encodeInt(this.S());\n});\n\nSignature.prototype.toBytes = function toBytes() {\n return this.Rencoded().concat(this.Sencoded());\n};\n\nSignature.prototype.toHex = function toHex() {\n return utils.encode(this.toBytes(), 'hex').toUpperCase();\n};\n\nmodule.exports = Signature;\n","module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n 'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a',\n 'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821',\n ],\n [\n '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508',\n '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf',\n ],\n [\n '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739',\n 'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695',\n ],\n [\n '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640',\n '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9',\n ],\n [\n '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c',\n '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36',\n ],\n [\n '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda',\n '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f',\n ],\n [\n 'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa',\n '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999',\n ],\n [\n '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0',\n 'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09',\n ],\n [\n 'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d',\n '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d',\n ],\n [\n 'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d',\n 'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088',\n ],\n [\n 'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1',\n '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d',\n ],\n [\n '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0',\n '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8',\n ],\n [\n '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047',\n '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a',\n ],\n [\n '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862',\n '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453',\n ],\n [\n '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7',\n '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160',\n ],\n [\n '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd',\n '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0',\n ],\n [\n '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83',\n '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6',\n ],\n [\n '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a',\n '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589',\n ],\n [\n '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8',\n 'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17',\n ],\n [\n 'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d',\n '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda',\n ],\n [\n 'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725',\n '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd',\n ],\n [\n '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754',\n '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2',\n ],\n [\n '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c',\n '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6',\n ],\n [\n 'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6',\n '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f',\n ],\n [\n '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39',\n 'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01',\n ],\n [\n 'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891',\n '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3',\n ],\n [\n 'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b',\n 'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f',\n ],\n [\n 'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03',\n '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7',\n ],\n [\n 'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d',\n 'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78',\n ],\n [\n 'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070',\n '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1',\n ],\n [\n '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4',\n 'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150',\n ],\n [\n '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da',\n '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82',\n ],\n [\n 'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11',\n '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc',\n ],\n [\n '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e',\n 'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b',\n ],\n [\n 'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41',\n '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51',\n ],\n [\n 'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef',\n '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45',\n ],\n [\n 'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8',\n 'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120',\n ],\n [\n '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d',\n '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84',\n ],\n [\n '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96',\n '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d',\n ],\n [\n '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd',\n 'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d',\n ],\n [\n '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5',\n '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8',\n ],\n [\n 'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266',\n '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8',\n ],\n [\n '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71',\n '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac',\n ],\n [\n '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac',\n 'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f',\n ],\n [\n '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751',\n '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962',\n ],\n [\n 'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e',\n '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907',\n ],\n [\n '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241',\n 'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec',\n ],\n [\n 'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3',\n 'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d',\n ],\n [\n 'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f',\n '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414',\n ],\n [\n '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19',\n 'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd',\n ],\n [\n '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be',\n 'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0',\n ],\n [\n 'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9',\n '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811',\n ],\n [\n 'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2',\n '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1',\n ],\n [\n 'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13',\n '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c',\n ],\n [\n '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c',\n 'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73',\n ],\n [\n '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba',\n '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd',\n ],\n [\n 'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151',\n 'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405',\n ],\n [\n '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073',\n 'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589',\n ],\n [\n '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458',\n '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e',\n ],\n [\n '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b',\n '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27',\n ],\n [\n 'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366',\n 'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1',\n ],\n [\n '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa',\n '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482',\n ],\n [\n '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0',\n '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945',\n ],\n [\n 'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787',\n '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573',\n ],\n [\n 'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e',\n 'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82',\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n 'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9',\n '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672',\n ],\n [\n '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4',\n 'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6',\n ],\n [\n '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc',\n '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da',\n ],\n [\n 'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe',\n 'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37',\n ],\n [\n '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb',\n 'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b',\n ],\n [\n 'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8',\n 'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81',\n ],\n [\n 'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e',\n '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58',\n ],\n [\n 'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34',\n '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77',\n ],\n [\n '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c',\n '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a',\n ],\n [\n '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5',\n '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c',\n ],\n [\n '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f',\n '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67',\n ],\n [\n '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714',\n '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402',\n ],\n [\n 'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729',\n 'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55',\n ],\n [\n 'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db',\n '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482',\n ],\n [\n '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4',\n 'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82',\n ],\n [\n '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5',\n 'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396',\n ],\n [\n '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479',\n '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49',\n ],\n [\n '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d',\n '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf',\n ],\n [\n '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f',\n '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a',\n ],\n [\n '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb',\n 'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7',\n ],\n [\n 'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9',\n 'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933',\n ],\n [\n '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963',\n '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a',\n ],\n [\n '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74',\n '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6',\n ],\n [\n 'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530',\n 'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37',\n ],\n [\n '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b',\n '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e',\n ],\n [\n 'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247',\n 'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6',\n ],\n [\n 'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1',\n 'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476',\n ],\n [\n '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120',\n '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40',\n ],\n [\n '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435',\n '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61',\n ],\n [\n '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18',\n '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683',\n ],\n [\n 'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8',\n '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5',\n ],\n [\n '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb',\n '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b',\n ],\n [\n 'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f',\n '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417',\n ],\n [\n '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143',\n 'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868',\n ],\n [\n '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba',\n 'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a',\n ],\n [\n 'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45',\n 'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6',\n ],\n [\n '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a',\n '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996',\n ],\n [\n '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e',\n 'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e',\n ],\n [\n 'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8',\n 'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d',\n ],\n [\n '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c',\n '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2',\n ],\n [\n '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519',\n 'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e',\n ],\n [\n '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab',\n '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437',\n ],\n [\n '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca',\n 'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311',\n ],\n [\n 'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf',\n '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4',\n ],\n [\n '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610',\n '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575',\n ],\n [\n '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4',\n 'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d',\n ],\n [\n '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c',\n 'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d',\n ],\n [\n 'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940',\n 'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629',\n ],\n [\n 'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980',\n 'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06',\n ],\n [\n '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3',\n '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374',\n ],\n [\n '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf',\n '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee',\n ],\n [\n 'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63',\n '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1',\n ],\n [\n 'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448',\n 'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b',\n ],\n [\n '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf',\n '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661',\n ],\n [\n '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5',\n '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6',\n ],\n [\n 'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6',\n '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e',\n ],\n [\n '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5',\n '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d',\n ],\n [\n 'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99',\n 'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc',\n ],\n [\n '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51',\n 'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4',\n ],\n [\n '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5',\n '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c',\n ],\n [\n 'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5',\n '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b',\n ],\n [\n 'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997',\n '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913',\n ],\n [\n '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881',\n '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154',\n ],\n [\n '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5',\n '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865',\n ],\n [\n '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66',\n 'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc',\n ],\n [\n '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726',\n 'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224',\n ],\n [\n '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede',\n '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e',\n ],\n [\n '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94',\n '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6',\n ],\n [\n '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31',\n '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511',\n ],\n [\n '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51',\n 'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b',\n ],\n [\n 'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252',\n 'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2',\n ],\n [\n '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5',\n 'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c',\n ],\n [\n 'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b',\n '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3',\n ],\n [\n 'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4',\n '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d',\n ],\n [\n 'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f',\n '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700',\n ],\n [\n 'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889',\n '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4',\n ],\n [\n '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246',\n 'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196',\n ],\n [\n '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984',\n '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4',\n ],\n [\n '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a',\n 'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257',\n ],\n [\n 'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030',\n 'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13',\n ],\n [\n 'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197',\n '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096',\n ],\n [\n 'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593',\n 'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38',\n ],\n [\n 'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef',\n '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f',\n ],\n [\n '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38',\n '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448',\n ],\n [\n 'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a',\n '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a',\n ],\n [\n 'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111',\n '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4',\n ],\n [\n '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502',\n '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437',\n ],\n [\n '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea',\n 'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7',\n ],\n [\n 'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26',\n '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d',\n ],\n [\n 'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986',\n '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a',\n ],\n [\n 'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e',\n '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54',\n ],\n [\n '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4',\n '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77',\n ],\n [\n 'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda',\n 'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517',\n ],\n [\n '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859',\n 'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10',\n ],\n [\n 'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f',\n 'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125',\n ],\n [\n 'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c',\n '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e',\n ],\n [\n '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942',\n 'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1',\n ],\n [\n 'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a',\n '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2',\n ],\n [\n 'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80',\n '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423',\n ],\n [\n 'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d',\n '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8',\n ],\n [\n '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1',\n 'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758',\n ],\n [\n '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63',\n 'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375',\n ],\n [\n 'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352',\n '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d',\n ],\n [\n '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193',\n 'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec',\n ],\n [\n '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00',\n '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0',\n ],\n [\n '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58',\n 'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c',\n ],\n [\n 'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7',\n 'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4',\n ],\n [\n '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8',\n 'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f',\n ],\n [\n '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e',\n '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649',\n ],\n [\n '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d',\n 'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826',\n ],\n [\n '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b',\n '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5',\n ],\n [\n 'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f',\n 'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87',\n ],\n [\n '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6',\n '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b',\n ],\n [\n 'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297',\n '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc',\n ],\n [\n '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a',\n '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c',\n ],\n [\n 'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c',\n 'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f',\n ],\n [\n 'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52',\n '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a',\n ],\n [\n 'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb',\n 'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46',\n ],\n [\n '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065',\n 'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f',\n ],\n [\n '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917',\n '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03',\n ],\n [\n '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9',\n 'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08',\n ],\n [\n '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3',\n '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8',\n ],\n [\n '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57',\n '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373',\n ],\n [\n '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66',\n 'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3',\n ],\n [\n '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8',\n '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8',\n ],\n [\n '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721',\n '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1',\n ],\n [\n '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180',\n '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9',\n ],\n ],\n },\n};\n","'use strict';\n\nvar utils = exports;\nvar BN = require('bn.js');\nvar minAssert = require('minimalistic-assert');\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;\n\n// Represent num in a w-NAF form\nfunction getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\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 if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n 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}\nutils.getNAF = getNAF;\n\n// Represent k1, k2 in a Joint Sparse Form\nfunction getJSF(k1, k2) {\n var jsf = [\n [],\n [],\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n var m8;\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)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\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)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\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)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}\nutils.getJSF = getJSF;\n\nfunction cachedProperty(obj, name, computer) {\n var key = '_' + name;\n obj.prototype[name] = function cachedProperty() {\n return this[key] !== undefined ? this[key] :\n this[key] = computer.call(this);\n };\n}\nutils.cachedProperty = cachedProperty;\n\nfunction parseBytes(bytes) {\n return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :\n bytes;\n}\nutils.parseBytes = parseBytes;\n\nfunction intFromLE(bytes) {\n return new BN(bytes, 'hex', 'le');\n}\nutils.intFromLE = intFromLE;\n\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","var once = require('once');\n\nvar noop = function() {};\n\nvar isRequest = function(stream) {\n\treturn stream.setHeader && typeof stream.abort === 'function';\n};\n\nvar isChildProcess = function(stream) {\n\treturn stream.stdio && Array.isArray(stream.stdio) && stream.stdio.length === 3\n};\n\nvar eos = function(stream, opts, callback) {\n\tif (typeof opts === 'function') return eos(stream, null, opts);\n\tif (!opts) opts = {};\n\n\tcallback = once(callback || noop);\n\n\tvar ws = stream._writableState;\n\tvar rs = stream._readableState;\n\tvar readable = opts.readable || (opts.readable !== false && stream.readable);\n\tvar writable = opts.writable || (opts.writable !== false && stream.writable);\n\tvar cancelled = false;\n\n\tvar onlegacyfinish = function() {\n\t\tif (!stream.writable) onfinish();\n\t};\n\n\tvar onfinish = function() {\n\t\twritable = false;\n\t\tif (!readable) callback.call(stream);\n\t};\n\n\tvar onend = function() {\n\t\treadable = false;\n\t\tif (!writable) callback.call(stream);\n\t};\n\n\tvar onexit = function(exitCode) {\n\t\tcallback.call(stream, exitCode ? new Error('exited with error code: ' + exitCode) : null);\n\t};\n\n\tvar onerror = function(err) {\n\t\tcallback.call(stream, err);\n\t};\n\n\tvar onclose = function() {\n\t\tprocess.nextTick(onclosenexttick);\n\t};\n\n\tvar onclosenexttick = function() {\n\t\tif (cancelled) return;\n\t\tif (readable && !(rs && (rs.ended && !rs.destroyed))) return callback.call(stream, new Error('premature close'));\n\t\tif (writable && !(ws && (ws.ended && !ws.destroyed))) return callback.call(stream, new Error('premature close'));\n\t};\n\n\tvar onrequest = function() {\n\t\tstream.req.on('finish', onfinish);\n\t};\n\n\tif (isRequest(stream)) {\n\t\tstream.on('complete', onfinish);\n\t\tstream.on('abort', onclose);\n\t\tif (stream.req) onrequest();\n\t\telse stream.on('request', onrequest);\n\t} else if (writable && !ws) { // legacy streams\n\t\tstream.on('end', onlegacyfinish);\n\t\tstream.on('close', onlegacyfinish);\n\t}\n\n\tif (isChildProcess(stream)) stream.on('exit', onexit);\n\n\tstream.on('end', onend);\n\tstream.on('finish', onfinish);\n\tif (opts.error !== false) stream.on('error', onerror);\n\tstream.on('close', onclose);\n\n\treturn function() {\n\t\tcancelled = true;\n\t\tstream.removeListener('complete', onfinish);\n\t\tstream.removeListener('abort', onclose);\n\t\tstream.removeListener('request', onrequest);\n\t\tif (stream.req) stream.req.removeListener('finish', onfinish);\n\t\tstream.removeListener('end', onlegacyfinish);\n\t\tstream.removeListener('close', onlegacyfinish);\n\t\tstream.removeListener('finish', onfinish);\n\t\tstream.removeListener('exit', onexit);\n\t\tstream.removeListener('end', onend);\n\t\tstream.removeListener('error', onerror);\n\t\tstream.removeListener('close', onclose);\n\t};\n};\n\nmodule.exports = eos;\n","'use strict';\n\n/**\n * @typedef {{ [key: string]: any }} Extensions\n * @typedef {Error} Err\n * @property {string} message\n */\n\n/**\n *\n * @param {Error} obj\n * @param {Extensions} props\n * @returns {Error & Extensions}\n */\nfunction assign(obj, props) {\n for (const key in props) {\n Object.defineProperty(obj, key, {\n value: props[key],\n enumerable: true,\n configurable: true,\n });\n }\n\n return obj;\n}\n\n/**\n *\n * @param {any} err - An Error\n * @param {string|Extensions} code - A string code or props to set on the error\n * @param {Extensions} [props] - Props to set on the error\n * @returns {Error & Extensions}\n */\nfunction createError(err, code, props) {\n if (!err || typeof err === 'string') {\n throw new TypeError('Please pass an Error to err-code');\n }\n\n if (!props) {\n props = {};\n }\n\n if (typeof code === 'object') {\n props = code;\n code = '';\n }\n\n if (code) {\n props.code = code;\n }\n\n try {\n return assign(err, props);\n } catch (_) {\n props.message = err.message;\n props.stack = err.stack;\n\n const ErrClass = function () {};\n\n ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n // @ts-ignore\n const output = assign(new ErrClass(), props);\n\n return output;\n }\n}\n\nmodule.exports = createError;\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%');\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n","/**\n * Code refactored from Mozilla Developer Network:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/assign\n */\n\n'use strict';\n\nfunction assign(target, firstSource) {\n if (target === undefined || target === null) {\n throw new TypeError('Cannot convert first argument to object');\n }\n\n var to = Object(target);\n for (var i = 1; i < arguments.length; i++) {\n var nextSource = arguments[i];\n if (nextSource === undefined || nextSource === null) {\n continue;\n }\n\n var keysArray = Object.keys(Object(nextSource));\n for (var nextIndex = 0, len = keysArray.length; nextIndex < len; nextIndex++) {\n var nextKey = keysArray[nextIndex];\n var desc = Object.getOwnPropertyDescriptor(nextSource, nextKey);\n if (desc !== undefined && desc.enumerable) {\n to[nextKey] = nextSource[nextKey];\n }\n }\n }\n return to;\n}\n\nfunction polyfill() {\n if (!Object.assign) {\n Object.defineProperty(Object, 'assign', {\n enumerable: false,\n configurable: true,\n writable: true,\n value: assign\n });\n }\n}\n\nmodule.exports = {\n assign: assign,\n polyfill: polyfill\n};\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\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n ? R.apply\n : function ReflectApply(target, receiver, args) {\n return Function.prototype.apply.call(target, receiver, args);\n }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target)\n .concat(Object.getOwnPropertySymbols(target));\n };\n} else {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target);\n };\n}\n\nfunction ProcessEmitWarning(warning) {\n if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n return value !== value;\n}\n\nfunction EventEmitter() {\n EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n if (typeof listener !== 'function') {\n throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n enumerable: true,\n get: function() {\n return defaultMaxListeners;\n },\n set: function(arg) {\n if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n }\n defaultMaxListeners = arg;\n }\n});\n\nEventEmitter.init = function() {\n\n if (this._events === undefined ||\n this._events === Object.getPrototypeOf(this)._events) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n }\n\n this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n }\n this._maxListeners = n;\n return this;\n};\n\nfunction _getMaxListeners(that) {\n if (that._maxListeners === undefined)\n return EventEmitter.defaultMaxListeners;\n return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n var args = [];\n for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n var doError = (type === 'error');\n\n var events = this._events;\n if (events !== undefined)\n doError = (doError && events.error === undefined);\n else if (!doError)\n return false;\n\n // If there is no 'error' event listener then throw.\n if (doError) {\n var er;\n if (args.length > 0)\n er = args[0];\n if (er instanceof Error) {\n // Note: The comments on the `throw` lines are intentional, they show\n // up in Node's output if this results in an unhandled exception.\n throw er; // Unhandled 'error' event\n }\n // At least give some kind of context to the user\n var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n err.context = er;\n throw err; // Unhandled 'error' event\n }\n\n var handler = events[type];\n\n if (handler === undefined)\n return false;\n\n if (typeof handler === 'function') {\n ReflectApply(handler, this, args);\n } else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i)\n ReflectApply(listeners[i], this, args);\n }\n\n return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n var m;\n var events;\n var existing;\n\n checkListener(listener);\n\n events = target._events;\n if (events === undefined) {\n events = target._events = Object.create(null);\n target._eventsCount = 0;\n } else {\n // To avoid recursion in the case that type === \"newListener\"! Before\n // adding it to the listeners, first emit \"newListener\".\n if (events.newListener !== undefined) {\n target.emit('newListener', type,\n listener.listener ? listener.listener : listener);\n\n // Re-assign `events` because a newListener handler could have caused the\n // this._events to be assigned to a new object\n events = target._events;\n }\n existing = events[type];\n }\n\n if (existing === undefined) {\n // Optimize the case of one listener. Don't need the extra array object.\n existing = events[type] = listener;\n ++target._eventsCount;\n } else {\n if (typeof existing === 'function') {\n // Adding the second element, need to change to array.\n existing = events[type] =\n prepend ? [listener, existing] : [existing, listener];\n // If we've already got an array, just append.\n } else if (prepend) {\n existing.unshift(listener);\n } else {\n existing.push(listener);\n }\n\n // Check for listener leak\n m = _getMaxListeners(target);\n if (m > 0 && existing.length > m && !existing.warned) {\n existing.warned = true;\n // No error code for this since it is a Warning\n // eslint-disable-next-line no-restricted-syntax\n var w = new Error('Possible EventEmitter memory leak detected. ' +\n existing.length + ' ' + String(type) + ' listeners ' +\n 'added. Use emitter.setMaxListeners() to ' +\n 'increase limit');\n w.name = 'MaxListenersExceededWarning';\n w.emitter = target;\n w.type = type;\n w.count = existing.length;\n ProcessEmitWarning(w);\n }\n }\n\n return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n function prependListener(type, listener) {\n return _addListener(this, type, listener, true);\n };\n\nfunction onceWrapper() {\n if (!this.fired) {\n this.target.removeListener(this.type, this.wrapFn);\n this.fired = true;\n if (arguments.length === 0)\n return this.listener.call(this.target);\n return this.listener.apply(this.target, arguments);\n }\n}\n\nfunction _onceWrap(target, type, listener) {\n var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n var wrapped = onceWrapper.bind(state);\n wrapped.listener = listener;\n state.wrapFn = wrapped;\n return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n checkListener(listener);\n this.on(type, _onceWrap(this, type, listener));\n return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n function prependOnceListener(type, listener) {\n checkListener(listener);\n this.prependListener(type, _onceWrap(this, type, listener));\n return this;\n };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n function removeListener(type, listener) {\n var list, events, position, i, originalListener;\n\n checkListener(listener);\n\n events = this._events;\n if (events === undefined)\n return this;\n\n list = events[type];\n if (list === undefined)\n return this;\n\n if (list === listener || list.listener === listener) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else {\n delete events[type];\n if (events.removeListener)\n this.emit('removeListener', type, list.listener || listener);\n }\n } else if (typeof list !== 'function') {\n position = -1;\n\n for (i = list.length - 1; i >= 0; i--) {\n if (list[i] === listener || list[i].listener === listener) {\n originalListener = list[i].listener;\n position = i;\n break;\n }\n }\n\n if (position < 0)\n return this;\n\n if (position === 0)\n list.shift();\n else {\n spliceOne(list, position);\n }\n\n if (list.length === 1)\n events[type] = list[0];\n\n if (events.removeListener !== undefined)\n this.emit('removeListener', type, originalListener || listener);\n }\n\n return this;\n };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n function removeAllListeners(type) {\n var listeners, events, i;\n\n events = this._events;\n if (events === undefined)\n return this;\n\n // not listening for removeListener, no need to emit\n if (events.removeListener === undefined) {\n if (arguments.length === 0) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n } else if (events[type] !== undefined) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else\n delete events[type];\n }\n return this;\n }\n\n // emit removeListener for all listeners on all events\n if (arguments.length === 0) {\n var keys = Object.keys(events);\n var key;\n for (i = 0; i < keys.length; ++i) {\n key = keys[i];\n if (key === 'removeListener') continue;\n this.removeAllListeners(key);\n }\n this.removeAllListeners('removeListener');\n this._events = Object.create(null);\n this._eventsCount = 0;\n return this;\n }\n\n listeners = events[type];\n\n if (typeof listeners === 'function') {\n this.removeListener(type, listeners);\n } else if (listeners !== undefined) {\n // LIFO order\n for (i = listeners.length - 1; i >= 0; i--) {\n this.removeListener(type, listeners[i]);\n }\n }\n\n return this;\n };\n\nfunction _listeners(target, type, unwrap) {\n var events = target._events;\n\n if (events === undefined)\n return [];\n\n var evlistener = events[type];\n if (evlistener === undefined)\n return [];\n\n if (typeof evlistener === 'function')\n return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n return unwrap ?\n unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n if (typeof emitter.listenerCount === 'function') {\n return emitter.listenerCount(type);\n } else {\n return listenerCount.call(emitter, type);\n }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n var events = this._events;\n\n if (events !== undefined) {\n var evlistener = events[type];\n\n if (typeof evlistener === 'function') {\n return 1;\n } else if (evlistener !== undefined) {\n return evlistener.length;\n }\n }\n\n return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n var copy = new Array(n);\n for (var i = 0; i < n; ++i)\n copy[i] = arr[i];\n return copy;\n}\n\nfunction spliceOne(list, index) {\n for (; index + 1 < list.length; index++)\n list[index] = list[index + 1];\n list.pop();\n}\n\nfunction unwrapListeners(arr) {\n var ret = new Array(arr.length);\n for (var i = 0; i < ret.length; ++i) {\n ret[i] = arr[i].listener || arr[i];\n }\n return ret;\n}\n\nfunction once(emitter, name) {\n return new Promise(function (resolve, reject) {\n function errorListener(err) {\n emitter.removeListener(name, resolver);\n reject(err);\n }\n\n function resolver() {\n if (typeof emitter.removeListener === 'function') {\n emitter.removeListener('error', errorListener);\n }\n resolve([].slice.call(arguments));\n };\n\n eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n if (name !== 'error') {\n addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n }\n });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n if (typeof emitter.on === 'function') {\n eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n if (typeof emitter.on === 'function') {\n if (flags.once) {\n emitter.once(name, listener);\n } else {\n emitter.on(name, listener);\n }\n } else if (typeof emitter.addEventListener === 'function') {\n // EventTarget does not have `error` event semantics like Node\n // EventEmitters, we do not listen for `error` events here.\n emitter.addEventListener(name, function wrapListener(arg) {\n // IE does not have builtin `{ once: true }` support so we\n // have to do it manually.\n if (flags.once) {\n emitter.removeEventListener(name, wrapListener);\n }\n listener(arg);\n });\n } else {\n throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n }\n}\n","var Buffer = require('safe-buffer').Buffer\nvar MD5 = require('md5.js')\n\n/* eslint-disable camelcase */\nfunction EVP_BytesToKey (password, salt, keyBits, ivLen) {\n if (!Buffer.isBuffer(password)) password = Buffer.from(password, 'binary')\n if (salt) {\n if (!Buffer.isBuffer(salt)) salt = Buffer.from(salt, 'binary')\n if (salt.length !== 8) throw new RangeError('salt should be Buffer with 8 byte length')\n }\n\n var keyLen = keyBits / 8\n var key = Buffer.alloc(keyLen)\n var iv = Buffer.alloc(ivLen || 0)\n var tmp = Buffer.alloc(0)\n\n while (keyLen > 0 || ivLen > 0) {\n var hash = new MD5()\n hash.update(tmp)\n hash.update(password)\n if (salt) hash.update(salt)\n tmp = hash.digest()\n\n var used = 0\n\n if (keyLen > 0) {\n var keyStart = key.length - keyLen\n used = Math.min(keyLen, tmp.length)\n tmp.copy(key, keyStart, 0, used)\n keyLen -= used\n }\n\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen\n var length = Math.min(ivLen, tmp.length - used)\n tmp.copy(iv, ivStart, used, used + length)\n ivLen -= length\n }\n }\n\n tmp.fill(0)\n return { key: key, iv: iv }\n}\n\nmodule.exports = EVP_BytesToKey\n","module.exports = class FixedFIFO {\n constructor (hwm) {\n if (!(hwm > 0) || ((hwm - 1) & hwm) !== 0) throw new Error('Max size for a FixedFIFO should be a power of two')\n this.buffer = new Array(hwm)\n this.mask = hwm - 1\n this.top = 0\n this.btm = 0\n this.next = null\n }\n\n push (data) {\n if (this.buffer[this.top] !== undefined) return false\n this.buffer[this.top] = data\n this.top = (this.top + 1) & this.mask\n return true\n }\n\n shift () {\n const last = this.buffer[this.btm]\n if (last === undefined) return undefined\n this.buffer[this.btm] = undefined\n this.btm = (this.btm + 1) & this.mask\n return last\n }\n\n isEmpty () {\n return this.buffer[this.btm] === undefined\n }\n}\n","const FixedFIFO = require('./fixed-size')\n\nmodule.exports = class FastFIFO {\n constructor (hwm) {\n this.hwm = hwm || 16\n this.head = new FixedFIFO(this.hwm)\n this.tail = this.head\n }\n\n push (val) {\n if (!this.head.push(val)) {\n const prev = this.head\n this.head = prev.next = new FixedFIFO(2 * this.head.buffer.length)\n this.head.push(val)\n }\n }\n\n shift () {\n const val = this.tail.shift()\n if (val === undefined && this.tail.next) {\n const next = this.tail.next\n this.tail.next = null\n this.tail = next\n return this.tail.shift()\n }\n return val\n }\n\n isEmpty () {\n return this.head.isEmpty()\n }\n}\n","/* global FileReader */\n\nconst { Readable } = require('readable-stream')\nconst toBuffer = require('typedarray-to-buffer')\n\nclass FileReadStream extends Readable {\n constructor (file, opts = {}) {\n super(opts)\n\n // save the read offset\n this._offset = 0\n this._ready = false\n this._file = file\n this._size = file.size\n this._chunkSize = opts.chunkSize || Math.max(this._size / 1000, 200 * 1024)\n\n // create the reader\n const reader = new FileReader()\n\n reader.onload = () => {\n // get the data chunk\n this.push(toBuffer(reader.result))\n }\n reader.onerror = () => {\n this.emit('error', reader.error)\n }\n\n this.reader = reader\n\n // generate the header blocks that we will send as part of the initial payload\n this._generateHeaderBlocks(file, opts, (err, blocks) => {\n // if we encountered an error, emit it\n if (err) {\n return this.emit('error', err)\n }\n\n // push the header blocks out to the stream\n if (Array.isArray(blocks)) {\n blocks.forEach(block => this.push(block))\n }\n\n this._ready = true\n this.emit('_ready')\n })\n }\n\n _generateHeaderBlocks (file, opts, callback) {\n callback(null, [])\n }\n\n _read () {\n if (!this._ready) {\n this.once('_ready', this._read.bind(this))\n return\n }\n\n const startOffset = this._offset\n let endOffset = this._offset + this._chunkSize\n if (endOffset > this._size) endOffset = this._size\n\n if (startOffset === this._size) {\n this.destroy()\n this.push(null)\n return\n }\n\n this.reader.readAsArrayBuffer(this._file.slice(startOffset, endOffset))\n\n // update the stream offset\n this._offset = endOffset\n }\n\n destroy () {\n this._file = null\n if (this.reader) {\n this.reader.onload = null\n this.reader.onerror = null\n try { this.reader.abort() } catch (e) {};\n }\n this.reader = null\n }\n}\n\nmodule.exports = FileReadStream\n","\nvar hasOwn = Object.prototype.hasOwnProperty;\nvar toString = Object.prototype.toString;\n\nmodule.exports = function forEach (obj, fn, ctx) {\n if (toString.call(fn) !== '[object Function]') {\n throw new TypeError('iterator must be a function');\n }\n var l = obj.length;\n if (l === +l) {\n for (var i = 0; i < l; i++) {\n fn.call(ctx, obj[i], i, obj);\n }\n } else {\n for (var k in obj) {\n if (hasOwn.call(obj, k)) {\n fn.call(ctx, obj[k], k, obj);\n }\n }\n }\n};\n\n","/* eslint-env browser */\nclass WebFsChunkStore {\n constructor (chunkLength, opts = {}) {\n this.chunkLength = Number(chunkLength)\n\n if (!this.chunkLength) {\n throw new Error('First argument must be a chunk length')\n }\n\n this.closed = false\n\n this.name = opts.name || 'default'\n\n this.rootDirPromise = opts.rootDir || navigator.storage.getDirectory()\n this.storageDirPromise = this._getStorageDirectoryHandle()\n this.chunksDirPromise = ((opts.files && opts.rootDir) && this._getChunksDirHandle()) || this.storageDirPromise\n\n this.chunks = [] // individual chunks, required for reads :/\n this.chunkMap = [] // full files\n this.directoryMap = {}\n\n if (opts.files && opts.rootDir) {\n this.files = opts.files.slice(0).map((file, i, files) => {\n if (file.path == null) throw new Error('File is missing `path` property')\n if (file.length == null) throw new Error('File is missing `length` property')\n if (file.offset == null) {\n if (i === 0) {\n file.offset = 0\n } else {\n const prevFile = files[i - 1]\n file.offset = prevFile.offset + prevFile.length\n }\n }\n\n // file handles\n if (file.handle == null) {\n file.handle = this._createFileHandle({ path: file.path })\n }\n\n // file chunkMap\n const fileStart = file.offset\n const fileEnd = file.offset + file.length\n\n const firstChunk = Math.floor(fileStart / this.chunkLength)\n const lastChunk = Math.floor((fileEnd - 1) / this.chunkLength)\n\n for (let p = firstChunk; p <= lastChunk; ++p) {\n const chunkStart = p * this.chunkLength\n const chunkEnd = chunkStart + this.chunkLength\n\n const from = (fileStart < chunkStart) ? 0 : fileStart - chunkStart\n const to = (fileEnd > chunkEnd) ? this.chunkLength : fileEnd - chunkStart\n const offset = (fileStart > chunkStart) ? 0 : chunkStart - fileStart\n\n if (!this.chunkMap[p]) this.chunkMap[p] = []\n\n this.chunkMap[p].push({ from, to, offset, file })\n }\n\n return file\n })\n\n // close streams is page is frozen/unloaded, they will re-open if the user returns via BFC\n window.addEventListener('pagehide', this.cleanup)\n\n this.length = this.files.reduce((sum, file) => sum + file.length, 0)\n if (opts.length != null && opts.length !== this.length) {\n throw new Error('total `files` length is not equal to explicit `length` option')\n }\n } else {\n this.length = Number(opts.length) || Infinity\n }\n\n if (this.length !== Infinity) {\n this.lastChunkLength = this.length % this.chunkLength || this.chunkLength\n this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1\n }\n }\n\n async _getChunksDirHandle () {\n const storageDir = await this.storageDirPromise\n return await storageDir.getDirectoryHandle('chunks', { create: true })\n }\n\n async _getStorageDirectoryHandle () {\n const rootDir = await this.rootDirPromise\n return await rootDir.getDirectoryHandle(this.name, { create: true })\n }\n\n async _getChunk (index) {\n let chunk = this.chunks[index]\n\n if (!chunk) {\n const fileName = index.toString()\n const storageDir = await this.chunksDirPromise\n\n chunk = this.chunks[index] = { fileHandlePromise: storageDir.getFileHandle(fileName, { create: true }) }\n }\n\n return chunk\n }\n\n async _createFileHandle (opts) {\n const fileName = opts.path.slice(opts.path.lastIndexOf('/') + 1)\n return (await this._getDirectoryHandle(opts)).getFileHandle(fileName, { create: true })\n }\n\n // recursive, equiv of cd and mkdirp\n async _getDirectoryHandle (opts) {\n const lastIndex = opts.path.lastIndexOf('/')\n if (lastIndex === -1 || lastIndex === 0) return this.storageDirPromise\n const path = opts.path = opts.path.slice(0, lastIndex)\n if (!this.directoryMap[path]) {\n const parent = this._getDirectoryHandle(opts)\n this.directoryMap[path] = (await parent).getDirectoryHandle(path.slice(path.lastIndexOf('/') + 1), { create: true })\n }\n return this.directoryMap[path]\n }\n\n put (index, buf, cb = () => {}) {\n if (this.closed) {\n queueMicrotask(() => cb(new Error('Storage is closed')))\n return\n }\n\n const isLastChunk = index === this.lastChunkIndex\n if (isLastChunk && buf.length !== this.lastChunkLength) {\n queueMicrotask(() => {\n cb(new Error(`Last chunk length must be ${this.lastChunkLength}`))\n })\n return\n }\n if (!isLastChunk && buf.length !== this.chunkLength) {\n queueMicrotask(() => {\n cb(new Error(`Chunk length must be ${this.chunkLength}`))\n })\n return\n }\n\n ;(async () => {\n try {\n const chunk = await this._getChunk(index)\n const fileHandle = await chunk.fileHandlePromise\n const stream = await fileHandle.createWritable({\n keepExistingData: false\n })\n await stream.write(buf)\n await stream.close()\n } catch (err) {\n cb(err)\n return\n }\n\n if (!this.files) cb(null)\n })()\n\n if (this.files) {\n const targets = this.chunkMap[index]\n if (!targets) {\n queueMicrotask(() => cb(new Error('No files matching the request range')))\n }\n const promises = targets.map(target => {\n return (async () => {\n try {\n const { file } = target\n if (!file.stream) {\n file.stream = (await file.handle).createWritable({\n keepExistingData: true\n })\n }\n const stream = await file.stream\n await stream.write({ type: 'write', position: target.offset, data: buf.slice(target.from, target.to) })\n return null\n } catch (err) {\n return cb(err)\n }\n })()\n })\n Promise.all(promises).then(() => cb(null))\n }\n }\n\n get (index, opts, cb = () => {}) {\n if (typeof opts === 'function') {\n return this.get(index, null, opts)\n }\n if (this.closed) {\n queueMicrotask(() => cb(new Error('Storage is closed')))\n return\n }\n\n const isLastChunk = index === this.lastChunkIndex\n const chunkLength = isLastChunk ? this.lastChunkLength : this.chunkLength\n\n if (!opts) opts = {}\n\n const rangeFrom = opts.offset || 0\n const rangeTo = opts.length ? rangeFrom + opts.length : chunkLength\n const len = opts.length || chunkLength - rangeFrom\n\n if (!this.files || this.chunks[index]) {\n ;(async () => {\n let buf\n try {\n const chunk = await this._getChunk(index)\n const fileHandle = await chunk.fileHandlePromise\n let file = await fileHandle.getFile()\n if (rangeFrom !== 0 || len !== chunkLength) {\n file = file.slice(rangeFrom, len + rangeFrom)\n }\n buf = await file.arrayBuffer()\n } catch (err) {\n cb(err)\n return\n }\n\n if (buf.byteLength === 0) {\n const err = new Error(`Index ${index} does not exist`)\n err.notFound = true\n cb(err)\n return\n }\n\n cb(null, new Uint8Array(buf))\n })()\n } else {\n let targets = this.chunkMap[index]\n if (!targets) {\n queueMicrotask(() => cb(new Error('No files matching the request range')))\n }\n if (opts) {\n targets = targets.filter(target => {\n return target.to > rangeFrom && target.from < rangeTo\n })\n if (targets.length === 0) {\n queueMicrotask(() => cb(new Error('No files matching the request range')))\n }\n }\n if (rangeFrom === rangeTo) return queueMicrotask(() => cb(null, new Uint8Array(0)))\n\n const promises = targets.map(target => {\n return (async () => {\n let from = target.from\n let to = target.to\n let offset = target.offset\n\n if (opts) {\n if (to > rangeTo) to = rangeTo\n if (from < rangeFrom) {\n offset += (rangeFrom - from)\n from = rangeFrom\n }\n }\n try {\n const handle = await target.file.handle\n const file = (await handle.getFile()).slice(offset, offset + to - from)\n return await file.arrayBuffer()\n } catch (err) {\n return err\n }\n })()\n })\n Promise.all(promises).then(values => {\n if (values.length === 1) {\n cb(null, new Uint8Array(values[0]))\n } else {\n new Blob(values).arrayBuffer().then(buf => {\n cb(null, new Uint8Array(buf))\n })\n }\n })\n }\n }\n\n close (cb = () => {}) {\n if (this.closed) {\n queueMicrotask(() => cb(new Error('Storage is closed')))\n return\n }\n\n this.closed = true\n this.chunkMap = []\n this.directoryMap = {}\n\n this.cleanup()\n\n queueMicrotask(() => {\n cb(null)\n })\n }\n\n async cleanup () {\n if (this.files) {\n for (const file of this.files) {\n if (file.stream) {\n await (await file.stream).close()\n file.stream = null\n }\n }\n const storageDir = await this.storageDirPromise\n await storageDir.removeEntry('chunks', { recursive: true })\n }\n this.chunks = []\n }\n\n destroy (cb = () => {}) {\n if (this.closed) {\n queueMicrotask(() => cb(new Error('Storage is closed')))\n return\n }\n\n const handleClose = async err => {\n if (err) {\n cb(err)\n return\n }\n\n try {\n const rootDir = await this.rootDirPromise\n await rootDir.removeEntry(this.name, { recursive: true })\n } catch (err) {\n cb(err)\n return\n }\n cb(null)\n }\n\n this.close(handleClose)\n }\n}\n\nmodule.exports = WebFsChunkStore\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slice.call(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n args.concat(slice.call(arguments))\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n } else {\n return target.apply(\n that,\n args.concat(slice.call(arguments))\n );\n }\n };\n\n var boundLength = Math.max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs.push('$' + i);\n }\n\n bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n if (target.prototype) {\n var Empty = function Empty() {};\n Empty.prototype = target.prototype;\n bound.prototype = new Empty();\n Empty.prototype = null;\n }\n\n return bound;\n};\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","// originally pulled out of simple-peer\n\nmodule.exports = function getBrowserRTC () {\n if (typeof globalThis === 'undefined') return null\n var wrtc = {\n RTCPeerConnection: globalThis.RTCPeerConnection || globalThis.mozRTCPeerConnection ||\n globalThis.webkitRTCPeerConnection,\n RTCSessionDescription: globalThis.RTCSessionDescription ||\n globalThis.mozRTCSessionDescription || globalThis.webkitRTCSessionDescription,\n RTCIceCandidate: globalThis.RTCIceCandidate || globalThis.mozRTCIceCandidate ||\n globalThis.webkitRTCIceCandidate\n }\n if (!wrtc.RTCPeerConnection) return null\n return wrtc\n}\n","'use strict';\n\nvar undefined;\n\nvar $SyntaxError = SyntaxError;\nvar $Function = Function;\nvar $TypeError = TypeError;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = Object.getOwnPropertyDescriptor;\nif ($gOPD) {\n\ttry {\n\t\t$gOPD({}, '');\n\t} catch (e) {\n\t\t$gOPD = null; // this is IE 8, which has a broken gOPD\n\t}\n}\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\n\nvar getProto = Object.getPrototypeOf || function (x) { return x.__proto__; }; // eslint-disable-line no-proto\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': EvalError,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': Object,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': RangeError,\n\t'%ReferenceError%': ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet\n};\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('has');\nvar $concat = bind.call(Function.call, Array.prototype.concat);\nvar $spliceApply = bind.call(Function.apply, Array.prototype.splice);\nvar $replace = bind.call(Function.call, String.prototype.replace);\nvar $strSlice = bind.call(Function.call, String.prototype.slice);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\nvar bind = require('function-bind');\n\nmodule.exports = bind.call(Function.call, Object.prototype.hasOwnProperty);\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('readable-stream').Transform\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\n this._block = Buffer.allocUnsafe(blockSize)\n this._blockSize = blockSize\n this._blockOffset = 0\n this._length = [0, 0, 0, 0]\n\n this._finalized = false\n}\n\ninherits(HashBase, Transform)\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n var error = null\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 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)\n\n // consume data\n var block = this._block\n var offset = 0\n while (this._blockOffset + data.length - offset >= this._blockSize) {\n for (var i = this._blockOffset; i < this._blockSize;) block[i++] = data[offset++]\n this._update()\n this._blockOffset = 0\n }\n while (offset < data.length) block[this._blockOffset++] = data[offset++]\n\n // update length\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 if (encoding !== undefined) digest = digest.toString(encoding)\n\n // reset state\n this._block.fill(0)\n this._blockOffset = 0\n for (var i = 0; i < 4; ++i) this._length[i] = 0\n\n return digest\n}\n\nHashBase.prototype._digest = function () {\n throw new Error('_digest is not implemented')\n}\n\nmodule.exports = HashBase\n","var hash = exports;\n\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');\n\n// Proxy hash functions to the main object\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;\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction BlockHash() {\n this.pending = null;\n this.pendingTotal = 0;\n this.blockSize = this.constructor.blockSize;\n this.outSize = this.constructor.outSize;\n this.hmacStrength = this.constructor.hmacStrength;\n this.padLength = this.constructor.padLength / 8;\n this.endian = 'big';\n\n this._delta8 = this.blockSize / 8;\n this._delta32 = this.blockSize / 32;\n}\nexports.BlockHash = BlockHash;\n\nBlockHash.prototype.update = function update(msg, enc) {\n // Convert message to array, pad it, and join into 32bit blocks\n msg = utils.toArray(msg, enc);\n if (!this.pending)\n this.pending = msg;\n else\n this.pending = this.pending.concat(msg);\n this.pendingTotal += msg.length;\n\n // Enough data, try updating\n if (this.pending.length >= this._delta8) {\n msg = this.pending;\n\n // Process pending data in blocks\n var r = msg.length % this._delta8;\n this.pending = msg.slice(msg.length - r, msg.length);\n if (this.pending.length === 0)\n this.pending = null;\n\n msg = utils.join32(msg, 0, msg.length - r, this.endian);\n for (var i = 0; i < msg.length; i += this._delta32)\n this._update(msg, i, i + this._delta32);\n }\n\n return this;\n};\n\nBlockHash.prototype.digest = function digest(enc) {\n this.update(this._pad());\n assert(this.pending === null);\n\n return this._digest(enc);\n};\n\nBlockHash.prototype._pad = function pad() {\n var len = this.pendingTotal;\n var bytes = this._delta8;\n var k = bytes - ((len + this.padLength) % bytes);\n var res = new Array(k + this.padLength);\n res[0] = 0x80;\n for (var i = 1; i < k; i++)\n res[i] = 0;\n\n // Append length\n len <<= 3;\n if (this.endian === 'big') {\n for (var t = 8; t < this.padLength; t++)\n res[i++] = 0;\n\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = len & 0xff;\n } else {\n res[i++] = len & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n\n for (t = 8; t < this.padLength; t++)\n res[i++] = 0;\n }\n\n return res;\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction Hmac(hash, key, enc) {\n if (!(this instanceof Hmac))\n return new Hmac(hash, key, enc);\n this.Hash = hash;\n this.blockSize = hash.blockSize / 8;\n this.outSize = hash.outSize / 8;\n this.inner = null;\n this.outer = null;\n\n this._init(utils.toArray(key, enc));\n}\nmodule.exports = Hmac;\n\nHmac.prototype._init = function init(key) {\n // Shorten key, if needed\n if (key.length > this.blockSize)\n key = new this.Hash().update(key).digest();\n assert(key.length <= this.blockSize);\n\n // Add padding to key\n for (var i = key.length; i < this.blockSize; i++)\n key.push(0);\n\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x36;\n this.inner = new this.Hash().update(key);\n\n // 0x36 ^ 0x5c = 0x6a\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x6a;\n this.outer = new this.Hash().update(key);\n};\n\nHmac.prototype.update = function update(msg, enc) {\n this.inner.update(msg, enc);\n return this;\n};\n\nHmac.prototype.digest = function digest(enc) {\n this.outer.update(this.inner.digest());\n return this.outer.digest(enc);\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar common = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_3 = utils.sum32_3;\nvar sum32_4 = utils.sum32_4;\nvar BlockHash = common.BlockHash;\n\nfunction RIPEMD160() {\n if (!(this instanceof RIPEMD160))\n return new RIPEMD160();\n\n BlockHash.call(this);\n\n this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];\n this.endian = 'little';\n}\nutils.inherits(RIPEMD160, BlockHash);\nexports.ripemd160 = RIPEMD160;\n\nRIPEMD160.blockSize = 512;\nRIPEMD160.outSize = 160;\nRIPEMD160.hmacStrength = 192;\nRIPEMD160.padLength = 64;\n\nRIPEMD160.prototype._update = function update(msg, start) {\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 Ah = A;\n var Bh = B;\n var Ch = C;\n var Dh = D;\n var Eh = E;\n for (var j = 0; j < 80; j++) {\n var T = sum32(\n rotl32(\n sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)),\n s[j]),\n E);\n A = E;\n E = D;\n D = rotl32(C, 10);\n C = B;\n B = T;\n T = sum32(\n rotl32(\n sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),\n sh[j]),\n Eh);\n Ah = Eh;\n Eh = Dh;\n Dh = rotl32(Ch, 10);\n Ch = Bh;\n Bh = T;\n }\n T = sum32_3(this.h[1], C, Dh);\n this.h[1] = sum32_3(this.h[2], D, Eh);\n this.h[2] = sum32_3(this.h[3], E, Ah);\n this.h[3] = sum32_3(this.h[4], A, Bh);\n this.h[4] = sum32_3(this.h[0], B, Ch);\n this.h[0] = T;\n};\n\nRIPEMD160.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'little');\n else\n return utils.split32(this.h, 'little');\n};\n\nfunction f(j, x, y, z) {\n if (j <= 15)\n return x ^ y ^ z;\n else if (j <= 31)\n return (x & y) | ((~x) & z);\n else if (j <= 47)\n return (x | (~y)) ^ z;\n else if (j <= 63)\n return (x & z) | (y & (~z));\n else\n return x ^ (y | (~z));\n}\n\nfunction K(j) {\n if (j <= 15)\n return 0x00000000;\n else if (j <= 31)\n return 0x5a827999;\n else if (j <= 47)\n return 0x6ed9eba1;\n else if (j <= 63)\n return 0x8f1bbcdc;\n else\n return 0xa953fd4e;\n}\n\nfunction Kh(j) {\n if (j <= 15)\n return 0x50a28be6;\n else if (j <= 31)\n return 0x5c4dd124;\n else if (j <= 47)\n return 0x6d703ef3;\n else if (j <= 63)\n return 0x7a6d76e9;\n else\n return 0x00000000;\n}\n\nvar r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n];\n\nvar rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n];\n\nvar s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n];\n\nvar sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n];\n","'use strict';\n\nexports.sha1 = require('./sha/1');\nexports.sha224 = require('./sha/224');\nexports.sha256 = require('./sha/256');\nexports.sha384 = require('./sha/384');\nexports.sha512 = require('./sha/512');\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_5 = utils.sum32_5;\nvar ft_1 = shaCommon.ft_1;\nvar BlockHash = common.BlockHash;\n\nvar sha1_K = [\n 0x5A827999, 0x6ED9EBA1,\n 0x8F1BBCDC, 0xCA62C1D6\n];\n\nfunction SHA1() {\n if (!(this instanceof SHA1))\n return new SHA1();\n\n BlockHash.call(this);\n this.h = [\n 0x67452301, 0xefcdab89, 0x98badcfe,\n 0x10325476, 0xc3d2e1f0 ];\n this.W = new Array(80);\n}\n\nutils.inherits(SHA1, BlockHash);\nmodule.exports = SHA1;\n\nSHA1.blockSize = 512;\nSHA1.outSize = 160;\nSHA1.hmacStrength = 80;\nSHA1.padLength = 64;\n\nSHA1.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 for(; i < W.length; i++)\n W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\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\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20);\n var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n e = d;\n d = c;\n c = rotl32(b, 30);\n b = a;\n a = t;\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};\n\nSHA1.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar SHA256 = require('./256');\n\nfunction SHA224() {\n if (!(this instanceof SHA224))\n return new SHA224();\n\n SHA256.call(this);\n this.h = [\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,\n 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];\n}\nutils.inherits(SHA224, SHA256);\nmodule.exports = SHA224;\n\nSHA224.blockSize = 512;\nSHA224.outSize = 224;\nSHA224.hmacStrength = 192;\nSHA224.padLength = 64;\n\nSHA224.prototype._digest = function digest(enc) {\n // Just truncate output\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 7), 'big');\n else\n return utils.split32(this.h.slice(0, 7), 'big');\n};\n\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\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;\n\nvar BlockHash = common.BlockHash;\n\nvar sha256_K = [\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n];\n\nfunction SHA256() {\n if (!(this instanceof SHA256))\n return new SHA256();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,\n 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n ];\n this.k = sha256_K;\n this.W = new Array(64);\n}\nutils.inherits(SHA256, BlockHash);\nmodule.exports = SHA256;\n\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 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 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\n assert(this.k.length === W.length);\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')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\n\nvar SHA512 = require('./512');\n\nfunction SHA384() {\n if (!(this instanceof SHA384))\n return new SHA384();\n\n SHA512.call(this);\n this.h = [\n 0xcbbb9d5d, 0xc1059ed8,\n 0x629a292a, 0x367cd507,\n 0x9159015a, 0x3070dd17,\n 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31,\n 0x8eb44a87, 0x68581511,\n 0xdb0c2e0d, 0x64f98fa7,\n 0x47b5481d, 0xbefa4fa4 ];\n}\nutils.inherits(SHA384, SHA512);\nmodule.exports = SHA384;\n\nSHA384.blockSize = 1024;\nSHA384.outSize = 384;\nSHA384.hmacStrength = 192;\nSHA384.padLength = 128;\n\nSHA384.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 12), 'big');\n else\n return utils.split32(this.h.slice(0, 12), 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\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;\n\nvar BlockHash = common.BlockHash;\n\nvar sha512_K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n];\n\nfunction SHA512() {\n if (!(this instanceof SHA512))\n return new SHA512();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xf3bcc908,\n 0xbb67ae85, 0x84caa73b,\n 0x3c6ef372, 0xfe94f82b,\n 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1,\n 0x9b05688c, 0x2b3e6c1f,\n 0x1f83d9ab, 0xfb41bd6b,\n 0x5be0cd19, 0x137e2179 ];\n this.k = sha512_K;\n this.W = new Array(160);\n}\nutils.inherits(SHA512, BlockHash);\nmodule.exports = SHA512;\n\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;\n\n // 32 x 32bit words\n for (var i = 0; i < 32; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2\n var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);\n var c1_hi = W[i - 14]; // i - 7\n var c1_lo = W[i - 13];\n var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15\n var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);\n var c3_hi = W[i - 32]; // i - 16\n var c3_lo = W[i - 31];\n\n W[i] = sum64_4_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n W[i + 1] = sum64_4_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n 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\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\n assert(this.k.length === W.length);\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\n var T1_hi = sum64_5_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n var T1_lo = sum64_5_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n\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\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\n hh = gh;\n hl = gl;\n\n gh = fh;\n gl = fl;\n\n fh = eh;\n fl = el;\n\n eh = sum64_hi(dh, dl, T1_hi, T1_lo);\n el = sum64_lo(dl, dl, T1_hi, T1_lo);\n\n dh = ch;\n dl = cl;\n\n ch = bh;\n cl = bl;\n\n bh = ah;\n bl = al;\n\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')\n return utils.toHex32(this.h, 'big');\n else\n 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)\n 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)\n 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)\n 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)\n 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 var c2_hi = rotr64_hi(xl, xh, 7); // 39\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n 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 var c2_lo = rotr64_lo(xl, xh, 7); // 39\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n 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)\n 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)\n 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\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n 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\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n 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 var c2_hi = shr64_hi(xh, xl, 6);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n 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 var c2_lo = shr64_lo(xh, xl, 6);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n","'use strict';\n\nvar utils = require('../utils');\nvar rotr32 = utils.rotr32;\n\nfunction ft_1(s, x, y, z) {\n if (s === 0)\n return ch32(x, y, z);\n if (s === 1 || s === 3)\n return p32(x, y, z);\n if (s === 2)\n return maj32(x, y, z);\n}\nexports.ft_1 = ft_1;\n\nfunction ch32(x, y, z) {\n return (x & y) ^ ((~x) & z);\n}\nexports.ch32 = ch32;\n\nfunction maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n}\nexports.maj32 = maj32;\n\nfunction p32(x, y, z) {\n return x ^ y ^ z;\n}\nexports.p32 = p32;\n\nfunction s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n}\nexports.s0_256 = s0_256;\n\nfunction s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n}\nexports.s1_256 = s1_256;\n\nfunction g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n}\nexports.g0_256 = g0_256;\n\nfunction g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n}\nexports.g1_256 = g1_256;\n","'use strict';\n\nvar assert = require('minimalistic-assert');\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 if (i < 0 || i + 1 >= msg.length) {\n return false;\n }\n return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;\n}\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\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 for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\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)\n msg = '0' + msg;\n for (i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n }\n } else {\n for (i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n }\n return res;\n}\nexports.toArray = toArray;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nexports.toHex = toHex;\n\nfunction htonl(w) {\n var res = (w >>> 24) |\n ((w >>> 8) & 0xff00) |\n ((w << 8) & 0xff0000) |\n ((w & 0xff) << 24);\n return res >>> 0;\n}\nexports.htonl = htonl;\n\nfunction toHex32(msg, endian) {\n var res = '';\n for (var i = 0; i < msg.length; i++) {\n var w = msg[i];\n if (endian === 'little')\n w = htonl(w);\n res += zero8(w.toString(16));\n }\n return res;\n}\nexports.toHex32 = toHex32;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nexports.zero2 = zero2;\n\nfunction zero8(word) {\n if (word.length === 7)\n return '0' + word;\n else if (word.length === 6)\n return '00' + word;\n else if (word.length === 5)\n return '000' + word;\n else if (word.length === 4)\n return '0000' + word;\n else if (word.length === 3)\n return '00000' + word;\n else if (word.length === 2)\n return '000000' + word;\n else if (word.length === 1)\n return '0000000' + word;\n else\n return word;\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 for (var i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n if (endian === 'big')\n w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];\n else\n w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];\n res[i] = w >>> 0;\n }\n return res;\n}\nexports.join32 = join32;\n\nfunction split32(msg, endian) {\n var res = new Array(msg.length * 4);\n for (var i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\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 return res;\n}\nexports.split32 = split32;\n\nfunction rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n}\nexports.rotr32 = rotr32;\n\nfunction rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n}\nexports.rotl32 = rotl32;\n\nfunction sum32(a, b) {\n return (a + b) >>> 0;\n}\nexports.sum32 = sum32;\n\nfunction sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n}\nexports.sum32_3 = sum32_3;\n\nfunction sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n}\nexports.sum32_4 = sum32_4;\n\nfunction sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\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\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}\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}\nexports.sum64_hi = sum64_hi;\n\nfunction sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\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\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\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}\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\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\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\n return lo >>> 0;\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}\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}\nexports.rotr64_lo = rotr64_lo;\n\nfunction shr64_hi(ah, al, num) {\n return ah >>> num;\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}\nexports.shr64_lo = shr64_lo;\n","'use strict';\n\nvar hash = require('hash.js');\nvar utils = require('minimalistic-crypto-utils');\nvar assert = require('minimalistic-assert');\n\nfunction HmacDRBG(options) {\n if (!(this instanceof HmacDRBG))\n return new HmacDRBG(options);\n this.hash = options.hash;\n this.predResist = !!options.predResist;\n\n this.outLen = this.hash.outSize;\n this.minEntropy = options.minEntropy || this.hash.hmacStrength;\n\n this._reseed = null;\n this.reseedInterval = null;\n this.K = null;\n this.V = null;\n\n var entropy = utils.toArray(options.entropy, options.entropyEnc || 'hex');\n var nonce = utils.toArray(options.nonce, options.nonceEnc || 'hex');\n var pers = utils.toArray(options.pers, options.persEnc || 'hex');\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n this._init(entropy, nonce, pers);\n}\nmodule.exports = HmacDRBG;\n\nHmacDRBG.prototype._init = function init(entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n\n this.K = new Array(this.outLen / 8);\n this.V = new Array(this.outLen / 8);\n for (var i = 0; i < this.V.length; i++) {\n this.K[i] = 0x00;\n this.V[i] = 0x01;\n }\n\n this._update(seed);\n this._reseed = 1;\n this.reseedInterval = 0x1000000000000; // 2^48\n};\n\nHmacDRBG.prototype._hmac = function hmac() {\n return new hash.hmac(this.hash, this.K);\n};\n\nHmacDRBG.prototype._update = function update(seed) {\n var kmac = this._hmac()\n .update(this.V)\n .update([ 0x00 ]);\n if (seed)\n kmac = kmac.update(seed);\n this.K = kmac.digest();\n this.V = this._hmac().update(this.V).digest();\n if (!seed)\n return;\n\n this.K = this._hmac()\n .update(this.V)\n .update([ 0x01 ])\n .update(seed)\n .digest();\n this.V = this._hmac().update(this.V).digest();\n};\n\nHmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {\n // Optional entropy enc\n if (typeof entropyEnc !== 'string') {\n addEnc = add;\n add = entropyEnc;\n entropyEnc = null;\n }\n\n entropy = utils.toArray(entropy, entropyEnc);\n add = utils.toArray(add, addEnc);\n\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n\n this._update(entropy.concat(add || []));\n this._reseed = 1;\n};\n\nHmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval)\n throw new Error('Reseed is required');\n\n // Optional encoding\n if (typeof enc !== 'string') {\n addEnc = add;\n add = enc;\n enc = null;\n }\n\n // Optional additional data\n if (add) {\n add = utils.toArray(add, addEnc || 'hex');\n this._update(add);\n }\n\n var temp = [];\n while (temp.length < len) {\n this.V = this._hmac().update(this.V).digest();\n temp = temp.concat(this.V);\n }\n\n var res = temp.slice(0, len);\n this._update(add);\n this._reseed++;\n return utils.encode(res, enc);\n};\n","var http = require('http')\nvar url = require('url')\n\nvar https = module.exports\n\nfor (var key in http) {\n if (http.hasOwnProperty(key)) https[key] = http[key]\n}\n\nhttps.request = function (params, cb) {\n params = validateParams(params)\n return http.request.call(this, params, cb)\n}\n\nhttps.get = function (params, cb) {\n params = validateParams(params)\n return http.get.call(this, params, cb)\n}\n\nfunction validateParams (params) {\n if (typeof params === 'string') {\n params = url.parse(params)\n }\n if (!params.protocol) {\n params.protocol = 'https:'\n }\n if (params.protocol !== 'https:') {\n throw new Error('Protocol \"' + params.protocol + '\" not supported. Expected \"https:\"')\n }\n return params\n}\n","/* eslint-env browser */\nconst FSAccessChunkStore = require('fs-access-chunk-store')\nconst IDBChunkStore = require('idb-chunk-store')\nconst MemoryChunkStore = require('memory-chunk-store')\nconst CacheChunkStore = require('cache-chunk-store')\n\nconst isChrome = !!window.chrome\n\nclass HybridChunkStore {\n constructor (chunkLength, opts = {}) {\n this.chunkLength = Number(chunkLength)\n if (!this.chunkLength) throw new Error('First argument must be a chunk length')\n\n this.fallbackStore = null\n this.chunkCount = null\n this.stores = []\n this.chunks = []\n\n // this is kinda stupid, first it makes the fallback store, then the main store\n // creates a store limited by targetLength, then uses memory as fallback/overflow\n const _mapStore = (TargetStore, targetLenght) => {\n const newOpts = opts\n if (targetLenght && targetLenght < opts.length) {\n this.chunkCount = Math.floor(targetLenght / this.chunkLength)\n const newLenght = this.chunkCount * this.chunkLength\n newOpts.length = opts.length - newLenght\n // ideally this should be blob store, some1 make one pls\n this.fallbackStore = new MemoryChunkStore(this.chunkLength, newOpts)\n this.stores.push(this.fallbackStore)\n newOpts.length = newLenght\n }\n const store = new CacheChunkStore(new TargetStore(this.chunkLength, newOpts), { max: opts.max || 20 })\n this.stores.push(store)\n if (this.chunkCount) {\n this.chunks[this.chunkCount - 1] = store\n this.chunks.fill(store)\n } else {\n this.fallbackStore = store\n }\n }\n\n this.registration = navigator.storage.estimate().then(estimate => {\n // use less than available\n const remaining = estimate.quota - estimate.usage - Math.max(Number(opts.reserved) || 0, 16777216)\n if ('getDirectory' in navigator.storage) {\n // lets hope the user isn't stupid enough to specify a directory with barely any storage, forgive me tech support people\n _mapStore(FSAccessChunkStore, !(opts.rootDir) && remaining)\n } else {\n // WAH. https://i.kym-cdn.com/entries/icons/original/000/027/528/519.png\n _mapStore(IDBChunkStore, !(isChrome && estimate.quota === 2147483648) && remaining)\n }\n })\n }\n\n get (index, opts, cb) {\n this.registration.then(() => {\n if (!this.chunks[index]) {\n this.fallbackStore.get(index - this.chunkCount, opts, cb)\n } else {\n this.chunks[index].get(index, opts, cb)\n }\n })\n }\n\n put (index, buf, cb) {\n this.registration.then(() => {\n if (!this.chunks[index]) {\n this.fallbackStore.put(index - this.chunkCount, buf, cb)\n } else {\n this.chunks[index].put(index, buf, cb)\n }\n })\n }\n\n close (cb = () => {}) {\n const promises = []\n for (const store of this.stores) {\n promises.push(new Promise(resolve => store.close(resolve)))\n }\n Promise.all(promises).then(values => {\n values = values.filter(value => value)\n cb(values.length > 1 ? values : values[0])\n })\n }\n\n destroy (cb = () => {}) {\n const promises = []\n for (const store of this.stores) {\n promises.push(new Promise(resolve => store.destroy(resolve)))\n }\n Promise.all(promises).then(values => {\n values = values.filter(value => value)\n cb(values.length > 1 ? values : values[0])\n })\n }\n}\n\nmodule.exports = HybridChunkStore\n","'use strict'\nconst idb = require('idb')\n\nconst EventEmitter = require('events').EventEmitter\nconst queueMicrotask = require('queue-microtask')\n\nclass Storage extends EventEmitter {\n constructor (chunkLength, opts) {\n if (!opts) opts = {}\n super()\n\n this.chunkLength = Number(chunkLength)\n if (!this.chunkLength) throw new Error('First argument must be a chunk length')\n\n this.closed = false\n this.destroyed = false\n this.length = Number(opts.length) || Infinity\n this.name = opts.name || 'idb-chunk-store'\n\n if (this.length !== Infinity) {\n this.lastChunkLength = (this.length % this.chunkLength) || this.chunkLength\n this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1\n }\n\n this.dbPromise = idb.openDB(this.name, undefined, {\n upgrade: (db) => {\n db.createObjectStore('chunks')\n },\n blocking: () => {\n // Fires if the database is deleted from outside this Storage object\n this.close()\n },\n terminated: () => {\n this.closed = true\n this.emit('error', new Error('Database unexpectedly closed'))\n }\n })\n }\n\n put (index, buf, cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n\n const isLastChunk = (index === this.lastChunkIndex)\n if (isLastChunk && buf.length !== this.lastChunkLength) {\n return queueMicrotask(() => cb(new Error('Last chunk length must be ' + this.lastChunkLength)))\n }\n if (!isLastChunk && buf.length !== this.chunkLength) {\n return queueMicrotask(() => cb(new Error('Chunk length must be ' + this.chunkLength)))\n }\n\n // Zero-copy coerce Buffer to Uint8Array\n buf = new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength)\n\n // If the backing buffer is larger, copy out only the relevant slice\n // so extra data doesn't get saved to indexeddb\n if (buf.byteOffset !== 0 || buf.byteLength !== buf.buffer.byteLength) {\n buf = buf.slice()\n }\n\n ;(async () => {\n try {\n const db = await this.dbPromise\n await db.put('chunks', buf, index)\n } catch (err) {\n cb(err)\n return\n }\n\n cb(null)\n })()\n }\n\n get (index, opts, cb = () => {}) {\n if (typeof opts === 'function') return this.get(index, {}, opts)\n if (!opts) opts = {}\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n\n ;(async () => {\n let rawResult\n try {\n const db = await this.dbPromise\n rawResult = await db.get('chunks', index)\n } catch (err) {\n cb(err)\n return\n }\n\n // rawResult should be undefined if the chunk is not found,\n // but some old browsers occasionally return null\n if (rawResult == null) {\n const err = new Error('Chunk not found')\n err.notFound = true\n cb(err)\n return\n }\n\n let buf = Buffer.from(rawResult.buffer, rawResult.byteOffset, rawResult.byteLength)\n\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n\n if (offset !== 0 || len !== buf.length) {\n buf = buf.slice(offset, len + offset)\n }\n\n cb(null, buf)\n })()\n }\n\n close (cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n this.closed = true\n\n ;(async () => {\n try {\n const db = await this.dbPromise\n db.close()\n } catch (err) {\n cb(err)\n return\n }\n\n cb(null)\n })()\n }\n\n destroy (cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n if (this.destroyed) return queueMicrotask(() => cb(new Error('Storage is destroyed')))\n this.destroyed = true\n\n this.close(async (err) => {\n if (err) {\n cb(err)\n return\n }\n\n try {\n await idb.deleteDB(this.name)\n } catch (err) {\n cb(err)\n return\n }\n\n cb(null)\n })\n }\n}\nmodule.exports = Storage\n","import safariFix from 'safari-14-idb-fix';\n\nfunction promisifyRequest(request) {\n return new Promise((resolve, reject) => {\n // @ts-ignore - file size hacks\n request.oncomplete = request.onsuccess = () => resolve(request.result);\n // @ts-ignore - file size hacks\n request.onabort = request.onerror = () => reject(request.error);\n });\n}\nfunction createStore(dbName, storeName) {\n const dbp = safariFix().then(() => {\n const request = indexedDB.open(dbName);\n request.onupgradeneeded = () => request.result.createObjectStore(storeName);\n return promisifyRequest(request);\n });\n return (txMode, callback) => dbp.then((db) => callback(db.transaction(storeName, txMode).objectStore(storeName)));\n}\nlet defaultGetStoreFunc;\nfunction defaultGetStore() {\n if (!defaultGetStoreFunc) {\n defaultGetStoreFunc = createStore('keyval-store', 'keyval');\n }\n return defaultGetStoreFunc;\n}\n/**\n * Get a value by its key.\n *\n * @param key\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction get(key, customStore = defaultGetStore()) {\n return customStore('readonly', (store) => promisifyRequest(store.get(key)));\n}\n/**\n * Set a value with a key.\n *\n * @param key\n * @param value\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction set(key, value, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.put(value, key);\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Set multiple values at once. This is faster than calling set() multiple times.\n * It's also atomic – if one of the pairs can't be added, none will be added.\n *\n * @param entries Array of entries, where each entry is an array of `[key, value]`.\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction setMany(entries, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n entries.forEach((entry) => store.put(entry[1], entry[0]));\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Get multiple values by their keys\n *\n * @param keys\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction getMany(keys, customStore = defaultGetStore()) {\n return customStore('readonly', (store) => Promise.all(keys.map((key) => promisifyRequest(store.get(key)))));\n}\n/**\n * Update a value. This lets you see the old value and update it as an atomic operation.\n *\n * @param key\n * @param updater A callback that takes the old value and returns a new value.\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction update(key, updater, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => \n // Need to create the promise manually.\n // If I try to chain promises, the transaction closes in browsers\n // that use a promise polyfill (IE10/11).\n new Promise((resolve, reject) => {\n store.get(key).onsuccess = function () {\n try {\n store.put(updater(this.result), key);\n resolve(promisifyRequest(store.transaction));\n }\n catch (err) {\n reject(err);\n }\n };\n }));\n}\n/**\n * Delete a particular key from the store.\n *\n * @param key\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction del(key, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.delete(key);\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Clear all values in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction clear(customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.clear();\n return promisifyRequest(store.transaction);\n });\n}\nfunction eachCursor(customStore, callback) {\n return customStore('readonly', (store) => {\n // This would be store.getAllKeys(), but it isn't supported by Edge or Safari.\n // And openKeyCursor isn't supported by Safari.\n store.openCursor().onsuccess = function () {\n if (!this.result)\n return;\n callback(this.result);\n this.result.continue();\n };\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Get all keys in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction keys(customStore = defaultGetStore()) {\n const items = [];\n return eachCursor(customStore, (cursor) => items.push(cursor.key)).then(() => items);\n}\n/**\n * Get all values in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction values(customStore = defaultGetStore()) {\n const items = [];\n return eachCursor(customStore, (cursor) => items.push(cursor.value)).then(() => items);\n}\n/**\n * Get all entries in the store. Each entry is an array of `[key, value]`.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction entries(customStore = defaultGetStore()) {\n const items = [];\n return eachCursor(customStore, (cursor) => items.push([cursor.key, cursor.value])).then(() => items);\n}\n\nexport { clear, createStore, del, entries, get, getMany, keys, promisifyRequest, set, setMany, update, values };\n","import { w as wrap, r as replaceTraps } from './wrap-idb-value.js';\nexport { u as unwrap, w as wrap } from './wrap-idb-value.js';\n\n/**\n * Open a database.\n *\n * @param name Name of the database.\n * @param version Schema version.\n * @param callbacks Additional callbacks.\n */\nfunction openDB(name, version, { blocked, upgrade, blocking, terminated } = {}) {\n const request = indexedDB.open(name, version);\n const openPromise = wrap(request);\n if (upgrade) {\n request.addEventListener('upgradeneeded', (event) => {\n upgrade(wrap(request.result), event.oldVersion, event.newVersion, wrap(request.transaction));\n });\n }\n if (blocked)\n request.addEventListener('blocked', () => blocked());\n openPromise\n .then((db) => {\n if (terminated)\n db.addEventListener('close', () => terminated());\n if (blocking)\n db.addEventListener('versionchange', () => blocking());\n })\n .catch(() => { });\n return openPromise;\n}\n/**\n * Delete a database.\n *\n * @param name Name of the database.\n */\nfunction deleteDB(name, { blocked } = {}) {\n const request = indexedDB.deleteDatabase(name);\n if (blocked)\n request.addEventListener('blocked', () => blocked());\n return wrap(request).then(() => undefined);\n}\n\nconst readMethods = ['get', 'getKey', 'getAll', 'getAllKeys', 'count'];\nconst writeMethods = ['put', 'add', 'delete', 'clear'];\nconst cachedMethods = new Map();\nfunction getMethod(target, prop) {\n if (!(target instanceof IDBDatabase &&\n !(prop in target) &&\n typeof prop === 'string')) {\n return;\n }\n if (cachedMethods.get(prop))\n return cachedMethods.get(prop);\n const targetFuncName = prop.replace(/FromIndex$/, '');\n const useIndex = prop !== targetFuncName;\n const isWrite = writeMethods.includes(targetFuncName);\n if (\n // Bail if the target doesn't exist on the target. Eg, getAll isn't in Edge.\n !(targetFuncName in (useIndex ? IDBIndex : IDBObjectStore).prototype) ||\n !(isWrite || readMethods.includes(targetFuncName))) {\n return;\n }\n const method = async function (storeName, ...args) {\n // isWrite ? 'readwrite' : undefined gzipps better, but fails in Edge :(\n const tx = this.transaction(storeName, isWrite ? 'readwrite' : 'readonly');\n let target = tx.store;\n if (useIndex)\n target = target.index(args.shift());\n // Must reject if op rejects.\n // If it's a write operation, must reject if tx.done rejects.\n // Must reject with op rejection first.\n // Must resolve with op value.\n // Must handle both promises (no unhandled rejections)\n return (await Promise.all([\n target[targetFuncName](...args),\n isWrite && tx.done,\n ]))[0];\n };\n cachedMethods.set(prop, method);\n return method;\n}\nreplaceTraps((oldTraps) => ({\n ...oldTraps,\n get: (target, prop, receiver) => getMethod(target, prop) || oldTraps.get(target, prop, receiver),\n has: (target, prop) => !!getMethod(target, prop) || oldTraps.has(target, prop),\n}));\n\nexport { deleteDB, openDB };\n","const instanceOfAny = (object, constructors) => constructors.some((c) => object instanceof c);\n\nlet idbProxyableTypes;\nlet cursorAdvanceMethods;\n// This is a function to prevent it throwing up in node environments.\nfunction getIdbProxyableTypes() {\n return (idbProxyableTypes ||\n (idbProxyableTypes = [\n IDBDatabase,\n IDBObjectStore,\n IDBIndex,\n IDBCursor,\n IDBTransaction,\n ]));\n}\n// This is a function to prevent it throwing up in node environments.\nfunction getCursorAdvanceMethods() {\n return (cursorAdvanceMethods ||\n (cursorAdvanceMethods = [\n IDBCursor.prototype.advance,\n IDBCursor.prototype.continue,\n IDBCursor.prototype.continuePrimaryKey,\n ]));\n}\nconst cursorRequestMap = new WeakMap();\nconst transactionDoneMap = new WeakMap();\nconst transactionStoreNamesMap = new WeakMap();\nconst transformCache = new WeakMap();\nconst reverseTransformCache = new WeakMap();\nfunction promisifyRequest(request) {\n const promise = new Promise((resolve, reject) => {\n const unlisten = () => {\n request.removeEventListener('success', success);\n request.removeEventListener('error', error);\n };\n const success = () => {\n resolve(wrap(request.result));\n unlisten();\n };\n const error = () => {\n reject(request.error);\n unlisten();\n };\n request.addEventListener('success', success);\n request.addEventListener('error', error);\n });\n promise\n .then((value) => {\n // Since cursoring reuses the IDBRequest (*sigh*), we cache it for later retrieval\n // (see wrapFunction).\n if (value instanceof IDBCursor) {\n cursorRequestMap.set(value, request);\n }\n // Catching to avoid \"Uncaught Promise exceptions\"\n })\n .catch(() => { });\n // This mapping exists in reverseTransformCache but doesn't doesn't exist in transformCache. This\n // is because we create many promises from a single IDBRequest.\n reverseTransformCache.set(promise, request);\n return promise;\n}\nfunction cacheDonePromiseForTransaction(tx) {\n // Early bail if we've already created a done promise for this transaction.\n if (transactionDoneMap.has(tx))\n return;\n const done = new Promise((resolve, reject) => {\n const unlisten = () => {\n tx.removeEventListener('complete', complete);\n tx.removeEventListener('error', error);\n tx.removeEventListener('abort', error);\n };\n const complete = () => {\n resolve();\n unlisten();\n };\n const error = () => {\n reject(tx.error || new DOMException('AbortError', 'AbortError'));\n unlisten();\n };\n tx.addEventListener('complete', complete);\n tx.addEventListener('error', error);\n tx.addEventListener('abort', error);\n });\n // Cache it for later retrieval.\n transactionDoneMap.set(tx, done);\n}\nlet idbProxyTraps = {\n get(target, prop, receiver) {\n if (target instanceof IDBTransaction) {\n // Special handling for transaction.done.\n if (prop === 'done')\n return transactionDoneMap.get(target);\n // Polyfill for objectStoreNames because of Edge.\n if (prop === 'objectStoreNames') {\n return target.objectStoreNames || transactionStoreNamesMap.get(target);\n }\n // Make tx.store return the only store in the transaction, or undefined if there are many.\n if (prop === 'store') {\n return receiver.objectStoreNames[1]\n ? undefined\n : receiver.objectStore(receiver.objectStoreNames[0]);\n }\n }\n // Else transform whatever we get back.\n return wrap(target[prop]);\n },\n set(target, prop, value) {\n target[prop] = value;\n return true;\n },\n has(target, prop) {\n if (target instanceof IDBTransaction &&\n (prop === 'done' || prop === 'store')) {\n return true;\n }\n return prop in target;\n },\n};\nfunction replaceTraps(callback) {\n idbProxyTraps = callback(idbProxyTraps);\n}\nfunction wrapFunction(func) {\n // Due to expected object equality (which is enforced by the caching in `wrap`), we\n // only create one new func per func.\n // Edge doesn't support objectStoreNames (booo), so we polyfill it here.\n if (func === IDBDatabase.prototype.transaction &&\n !('objectStoreNames' in IDBTransaction.prototype)) {\n return function (storeNames, ...args) {\n const tx = func.call(unwrap(this), storeNames, ...args);\n transactionStoreNamesMap.set(tx, storeNames.sort ? storeNames.sort() : [storeNames]);\n return wrap(tx);\n };\n }\n // Cursor methods are special, as the behaviour is a little more different to standard IDB. In\n // IDB, you advance the cursor and wait for a new 'success' on the IDBRequest that gave you the\n // cursor. It's kinda like a promise that can resolve with many values. That doesn't make sense\n // with real promises, so each advance methods returns a new promise for the cursor object, or\n // undefined if the end of the cursor has been reached.\n if (getCursorAdvanceMethods().includes(func)) {\n return function (...args) {\n // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use\n // the original object.\n func.apply(unwrap(this), args);\n return wrap(cursorRequestMap.get(this));\n };\n }\n return function (...args) {\n // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use\n // the original object.\n return wrap(func.apply(unwrap(this), args));\n };\n}\nfunction transformCachableValue(value) {\n if (typeof value === 'function')\n return wrapFunction(value);\n // This doesn't return, it just creates a 'done' promise for the transaction,\n // which is later returned for transaction.done (see idbObjectHandler).\n if (value instanceof IDBTransaction)\n cacheDonePromiseForTransaction(value);\n if (instanceOfAny(value, getIdbProxyableTypes()))\n return new Proxy(value, idbProxyTraps);\n // Return the same value back if we're not going to transform it.\n return value;\n}\nfunction wrap(value) {\n // We sometimes generate multiple promises from a single IDBRequest (eg when cursoring), because\n // IDB is weird and a single IDBRequest can yield many responses, so these can't be cached.\n if (value instanceof IDBRequest)\n return promisifyRequest(value);\n // If we've already transformed this value before, reuse the transformed value.\n // This is faster, but it also provides object equality.\n if (transformCache.has(value))\n return transformCache.get(value);\n const newValue = transformCachableValue(value);\n // Not all types are transformed.\n // These may be primitive types, so they can't be WeakMap keys.\n if (newValue !== value) {\n transformCache.set(value, newValue);\n reverseTransformCache.set(newValue, value);\n }\n return newValue;\n}\nconst unwrap = (value) => reverseTransformCache.get(value);\n\nexport { reverseTransformCache as a, instanceOfAny as i, replaceTraps as r, unwrap as u, wrap as w };\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","/*! immediate-chunk-store. MIT License. Feross Aboukhadijeh */\n// TODO: remove when window.queueMicrotask() is well supported\nconst queueMicrotask = require('queue-microtask')\n\nclass ImmediateStore {\n constructor (store) {\n this.store = store\n this.chunkLength = store.chunkLength\n\n if (!this.store || !this.store.get || !this.store.put) {\n throw new Error('First argument must be abstract-chunk-store compliant')\n }\n\n this.mem = []\n }\n\n put (index, buf, cb = () => {}) {\n this.mem[index] = buf\n this.store.put(index, buf, err => {\n this.mem[index] = null\n cb(err)\n })\n }\n\n get (index, opts, cb = () => {}) {\n if (typeof opts === 'function') return this.get(index, null, opts)\n\n let buf = this.mem[index]\n\n // if the chunk isn't in the immediate memory cache\n if (!buf) {\n return this.store.get(index, opts, cb)\n }\n\n if (!opts) opts = {}\n\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n\n if (offset !== 0 || len !== buf.length) {\n buf = buf.slice(offset, len + offset)\n }\n queueMicrotask(() => cb(null, buf))\n }\n\n close (cb = () => {}) {\n this.store.close(cb)\n }\n\n destroy (cb = () => {}) {\n this.store.destroy(cb)\n }\n}\n\nmodule.exports = ImmediateStore\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 var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n }\n}\n","'use strict';\n\nvar hasToStringTag = typeof Symbol === 'function' && typeof Symbol.toStringTag === 'symbol';\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\n\nvar isStandardArguments = function isArguments(value) {\n\tif (hasToStringTag && value && typeof value === 'object' && Symbol.toStringTag in value) {\n\t\treturn false;\n\t}\n\treturn $toString(value) === '[object Arguments]';\n};\n\nvar isLegacyArguments = function isArguments(value) {\n\tif (isStandardArguments(value)) {\n\t\treturn true;\n\t}\n\treturn value !== null &&\n\t\ttypeof value === 'object' &&\n\t\ttypeof value.length === 'number' &&\n\t\tvalue.length >= 0 &&\n\t\t$toString(value) !== '[object Array]' &&\n\t\t$toString(value.callee) === '[object Function]';\n};\n\nvar supportsStandardArguments = (function () {\n\treturn isStandardArguments(arguments);\n}());\n\nisStandardArguments.isLegacyArguments = isLegacyArguments; // for tests\n\nmodule.exports = supportsStandardArguments ? isStandardArguments : isLegacyArguments;\n","/* (c) 2016 Ari Porad (@ariporad) . License: ariporad.mit-license.org */\n\n// Partially from http://stackoverflow.com/a/94049/1928484, and from another SO answer, which told me that the highest\n// char code that's ascii is 127, but I can't find the link for. Sorry.\n\nvar MAX_ASCII_CHAR_CODE = 127;\n\nmodule.exports = function isAscii(str) {\n for (var i = 0, strLen = str.length; i < strLen; ++i) {\n if (str.charCodeAt(i) > MAX_ASCII_CHAR_CODE) return false;\n }\n return true;\n};\n","'use strict';\n\nvar toStr = Object.prototype.toString;\nvar fnToStr = Function.prototype.toString;\nvar isFnRegex = /^\\s*(?:function)?\\*/;\nvar hasToStringTag = typeof Symbol === 'function' && typeof Symbol.toStringTag === 'symbol';\nvar getProto = Object.getPrototypeOf;\nvar getGeneratorFunc = function () { // eslint-disable-line consistent-return\n\tif (!hasToStringTag) {\n\t\treturn false;\n\t}\n\ttry {\n\t\treturn Function('return function*() {}')();\n\t} catch (e) {\n\t}\n};\nvar GeneratorFunction;\n\nmodule.exports = function isGeneratorFunction(fn) {\n\tif (typeof fn !== 'function') {\n\t\treturn false;\n\t}\n\tif (isFnRegex.test(fnToStr.call(fn))) {\n\t\treturn true;\n\t}\n\tif (!hasToStringTag) {\n\t\tvar str = toStr.call(fn);\n\t\treturn str === '[object GeneratorFunction]';\n\t}\n\tif (!getProto) {\n\t\treturn false;\n\t}\n\tif (typeof GeneratorFunction === 'undefined') {\n\t\tvar generatorFunc = getGeneratorFunc();\n\t\tGeneratorFunction = generatorFunc ? getProto(generatorFunc) : false;\n\t}\n\treturn getProto(fn) === GeneratorFunction;\n};\n","'use strict';\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function isNaN(value) {\n\treturn value !== value;\n};\n","'use strict';\n\nvar callBind = require('call-bind');\nvar define = require('define-properties');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Number);\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\tif (Number.isNaN && Number.isNaN(NaN) && !Number.isNaN('a')) {\n\t\treturn Number.isNaN;\n\t}\n\treturn implementation;\n};\n","'use strict';\n\nvar define = require('define-properties');\nvar getPolyfill = require('./polyfill');\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function shimNumberIsNaN() {\n\tvar polyfill = getPolyfill();\n\tdefine(Number, { isNaN: polyfill }, {\n\t\tisNaN: function testIsNaN() {\n\t\t\treturn Number.isNaN !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","'use strict';\n\nvar forEach = require('foreach');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasSymbols = require('has-symbols')();\nvar hasToStringTag = hasSymbols && typeof Symbol.toStringTag === 'symbol';\n\nvar typedArrays = availableTypedArrays();\n\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\nvar $slice = callBound('String.prototype.slice');\nvar toStrTags = {};\nvar gOPD = require('es-abstract/helpers/getOwnPropertyDescriptor');\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new global[typedArray]();\n\t\tif (!(Symbol.toStringTag in arr)) {\n\t\t\tthrow new EvalError('this engine has support for Symbol.toStringTag, but ' + typedArray + ' does not have the property! Please report this.');\n\t\t}\n\t\tvar proto = getPrototypeOf(arr);\n\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\tif (!descriptor) {\n\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t}\n\t\ttoStrTags[typedArray] = descriptor.get;\n\t});\n}\n\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\tvar anyTrue = false;\n\tforEach(toStrTags, function (getter, typedArray) {\n\t\tif (!anyTrue) {\n\t\t\ttry {\n\t\t\t\tanyTrue = getter.call(value) === typedArray;\n\t\t\t} catch (e) { /**/ }\n\t\t}\n\t});\n\treturn anyTrue;\n};\n\nmodule.exports = function isTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag) {\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\treturn $indexOf(typedArrays, tag) > -1;\n\t}\n\tif (!gOPD) { return false; }\n\treturn tryTypedArrays(value);\n};\n","module.exports = isTypedArray\nisTypedArray.strict = isStrictTypedArray\nisTypedArray.loose = isLooseTypedArray\n\nvar toString = Object.prototype.toString\nvar names = {\n '[object Int8Array]': true\n , '[object Int16Array]': true\n , '[object Int32Array]': true\n , '[object Uint8Array]': true\n , '[object Uint8ClampedArray]': true\n , '[object Uint16Array]': true\n , '[object Uint32Array]': true\n , '[object Float32Array]': true\n , '[object Float64Array]': true\n}\n\nfunction isTypedArray(arr) {\n return (\n isStrictTypedArray(arr)\n || isLooseTypedArray(arr)\n )\n}\n\nfunction isStrictTypedArray(arr) {\n return (\n arr instanceof Int8Array\n || arr instanceof Int16Array\n || arr instanceof Int32Array\n || arr instanceof Uint8Array\n || arr instanceof Uint8ClampedArray\n || arr instanceof Uint16Array\n || arr instanceof Uint32Array\n || arr instanceof Float32Array\n || arr instanceof Float64Array\n )\n}\n\nfunction isLooseTypedArray(arr) {\n return names[toString.call(arr)]\n}\n","'use strict';\n\nconst blacklist = [\n\t// # All\n\t'^npm-debug\\\\.log$', // Error log for npm\n\t'^\\\\..*\\\\.swp$', // Swap file for vim state\n\n\t// # macOS\n\t'^\\\\.DS_Store$', // Stores custom folder attributes\n\t'^\\\\.AppleDouble$', // Stores additional file resources\n\t'^\\\\.LSOverride$', // Contains the absolute path to the app to be used\n\t'^Icon\\\\r$', // Custom Finder icon: http://superuser.com/questions/298785/icon-file-on-os-x-desktop\n\t'^\\\\._.*', // Thumbnail\n\t'^\\\\.Spotlight-V100(?:$|\\\\/)', // Directory that might appear on external disk\n\t'\\\\.Trashes', // File that might appear on external disk\n\t'^__MACOSX$', // Resource fork\n\n\t// # Linux\n\t'~$', // Backup file\n\n\t// # Windows\n\t'^Thumbs\\\\.db$', // Image file cache\n\t'^ehthumbs\\\\.db$', // Folder config file\n\t'^Desktop\\\\.ini$', // Stores custom folder attributes\n\t'@eaDir$' // Synology Diskstation \"hidden\" folder where the server stores thumbnails\n];\n\nexports.re = () => {\n\tthrow new Error('`junk.re` was renamed to `junk.regex`');\n};\n\nexports.regex = new RegExp(blacklist.join('|'));\n\nexports.is = filename => exports.regex.test(filename);\n\nexports.not = filename => !exports.is(filename);\n\n// TODO: Remove this for the next major release\nexports.default = module.exports;\n","\r\nexports.RateLimiter = require('./lib/rateLimiter');\r\nexports.TokenBucket = require('./lib/tokenBucket');\r\n","var getMilliseconds = function() {\r\n if (typeof process !== 'undefined' && process.hrtime) {\r\n var hrtime = process.hrtime();\r\n var seconds = hrtime[0];\r\n var nanoseconds = hrtime[1];\r\n\r\n return seconds * 1e3 + Math.floor(nanoseconds / 1e6);\r\n }\r\n\r\n return new Date().getTime();\r\n}\r\n\r\nmodule.exports = getMilliseconds;\r\n","var TokenBucket = require('./tokenBucket');\r\nvar getMilliseconds = require('./clock');\r\n\r\n/**\r\n * A generic rate limiter. Underneath the hood, this uses a token bucket plus\r\n * an additional check to limit how many tokens we can remove each interval.\r\n * @author John Hurliman \r\n *\r\n * @param {Number} tokensPerInterval Maximum number of tokens that can be\r\n * removed at any given moment and over the course of one interval.\r\n * @param {String|Number} interval The interval length in milliseconds, or as\r\n * one of the following strings: 'second', 'minute', 'hour', day'.\r\n * @param {Boolean} fireImmediately Optional. Whether or not the callback\r\n * will fire immediately when rate limiting is in effect (default is false).\r\n */\r\nvar RateLimiter = function(tokensPerInterval, interval, fireImmediately) {\r\n this.tokenBucket = new TokenBucket(tokensPerInterval, tokensPerInterval,\r\n interval, null);\r\n\r\n // Fill the token bucket to start\r\n this.tokenBucket.content = tokensPerInterval;\r\n\r\n this.curIntervalStart = getMilliseconds();\r\n this.tokensThisInterval = 0;\r\n this.fireImmediately = fireImmediately;\r\n};\r\n\r\nRateLimiter.prototype = {\r\n tokenBucket: null,\r\n curIntervalStart: 0,\r\n tokensThisInterval: 0,\r\n fireImmediately: false,\r\n\r\n /**\r\n * Remove the requested number of tokens and fire the given callback. If the\r\n * rate limiter contains enough tokens and we haven't spent too many tokens\r\n * in this interval already, this will happen immediately. Otherwise, the\r\n * removal and callback will happen when enough tokens become available.\r\n * @param {Number} count The number of tokens to remove.\r\n * @param {Function} callback(err, remainingTokens)\r\n * @returns {Boolean} True if the callback was fired immediately, otherwise\r\n * false.\r\n */\r\n removeTokens: function(count, callback) {\r\n // Make sure the request isn't for more than we can handle\r\n if (count > this.tokenBucket.bucketSize) {\r\n process.nextTick(callback.bind(null, 'Requested tokens ' + count +\r\n ' exceeds maximum tokens per interval ' + this.tokenBucket.bucketSize,\r\n null));\r\n return false;\r\n }\r\n\r\n var self = this;\r\n var now = getMilliseconds();\r\n\r\n // Advance the current interval and reset the current interval token count\r\n // if needed\r\n if (now < this.curIntervalStart\r\n || now - this.curIntervalStart >= this.tokenBucket.interval) {\r\n this.curIntervalStart = now;\r\n this.tokensThisInterval = 0;\r\n }\r\n\r\n // If we don't have enough tokens left in this interval, wait until the\r\n // next interval\r\n if (count > this.tokenBucket.tokensPerInterval - this.tokensThisInterval) {\r\n if (this.fireImmediately) {\r\n process.nextTick(callback.bind(null, null, -1));\r\n } else {\r\n var waitInterval = Math.ceil(\r\n this.curIntervalStart + this.tokenBucket.interval - now);\r\n\r\n setTimeout(function() {\r\n self.tokenBucket.removeTokens(count, afterTokensRemoved);\r\n }, waitInterval);\r\n }\r\n return false;\r\n }\r\n\r\n // Remove the requested number of tokens from the token bucket\r\n return this.tokenBucket.removeTokens(count, afterTokensRemoved);\r\n\r\n function afterTokensRemoved(err, tokensRemaining) {\r\n if (err) return callback(err, null);\r\n\r\n self.tokensThisInterval += count;\r\n callback(null, tokensRemaining);\r\n }\r\n },\r\n\r\n /**\r\n * Attempt to remove the requested number of tokens and return immediately.\r\n * If the bucket (and any parent buckets) contains enough tokens and we\r\n * haven't spent too many tokens in this interval already, this will return\r\n * true. Otherwise, false is returned.\r\n * @param {Number} count The number of tokens to remove.\r\n * @param {Boolean} True if the tokens were successfully removed, otherwise\r\n * false.\r\n */\r\n tryRemoveTokens: function(count) {\r\n // Make sure the request isn't for more than we can handle\r\n if (count > this.tokenBucket.bucketSize)\r\n return false;\r\n\r\n var now = getMilliseconds();\r\n\r\n // Advance the current interval and reset the current interval token count\r\n // if needed\r\n if (now < this.curIntervalStart\r\n || now - this.curIntervalStart >= this.tokenBucket.interval) {\r\n this.curIntervalStart = now;\r\n this.tokensThisInterval = 0;\r\n }\r\n\r\n // If we don't have enough tokens left in this interval, return false\r\n if (count > this.tokenBucket.tokensPerInterval - this.tokensThisInterval)\r\n return false;\r\n\r\n // Try to remove the requested number of tokens from the token bucket\r\n var removed = this.tokenBucket.tryRemoveTokens(count);\r\n if (removed) {\r\n this.tokensThisInterval += count;\r\n }\r\n return removed;\r\n },\r\n\r\n /**\r\n * Returns the number of tokens remaining in the TokenBucket.\r\n * @returns {Number} The number of tokens remaining.\r\n */\r\n getTokensRemaining: function () {\r\n this.tokenBucket.drip();\r\n return this.tokenBucket.content;\r\n }\r\n};\r\n\r\nmodule.exports = RateLimiter;\r\n","\r\n/**\r\n * A hierarchical token bucket for rate limiting. See\r\n * http://en.wikipedia.org/wiki/Token_bucket for more information.\r\n * @author John Hurliman \r\n *\r\n * @param {Number} bucketSize Maximum number of tokens to hold in the bucket.\r\n * Also known as the burst rate.\r\n * @param {Number} tokensPerInterval Number of tokens to drip into the bucket\r\n * over the course of one interval.\r\n * @param {String|Number} interval The interval length in milliseconds, or as\r\n * one of the following strings: 'second', 'minute', 'hour', day'.\r\n * @param {TokenBucket} parentBucket Optional. A token bucket that will act as\r\n * the parent of this bucket.\r\n */\r\nvar TokenBucket = function(bucketSize, tokensPerInterval, interval, parentBucket) {\r\n this.bucketSize = bucketSize;\r\n this.tokensPerInterval = tokensPerInterval;\r\n\r\n if (typeof interval === 'string') {\r\n switch (interval) {\r\n case 'sec': case 'second':\r\n this.interval = 1000; break;\r\n case 'min': case 'minute':\r\n this.interval = 1000 * 60; break;\r\n case 'hr': case 'hour':\r\n this.interval = 1000 * 60 * 60; break;\r\n case 'day':\r\n this.interval = 1000 * 60 * 60 * 24; break;\r\n default:\r\n throw new Error('Invaid interval ' + interval);\r\n }\r\n } else {\r\n this.interval = interval;\r\n }\r\n\r\n this.parentBucket = parentBucket;\r\n this.content = 0;\r\n this.lastDrip = +new Date();\r\n};\r\n\r\nTokenBucket.prototype = {\r\n bucketSize: 1,\r\n tokensPerInterval: 1,\r\n interval: 1000,\r\n parentBucket: null,\r\n content: 0,\r\n lastDrip: 0,\r\n\r\n /**\r\n * Remove the requested number of tokens and fire the given callback. If the\r\n * bucket (and any parent buckets) contains enough tokens this will happen\r\n * immediately. Otherwise, the removal and callback will happen when enough\r\n * tokens become available.\r\n * @param {Number} count The number of tokens to remove.\r\n * @param {Function} callback(err, remainingTokens)\r\n * @returns {Boolean} True if the callback was fired immediately, otherwise\r\n * false.\r\n */\r\n removeTokens: function(count, callback) {\r\n var self = this;\r\n\r\n // Is this an infinite size bucket?\r\n if (!this.bucketSize) {\r\n process.nextTick(callback.bind(null, null, count, Number.POSITIVE_INFINITY));\r\n return true;\r\n }\r\n\r\n // Make sure the bucket can hold the requested number of tokens\r\n if (count > this.bucketSize) {\r\n process.nextTick(callback.bind(null, 'Requested tokens ' + count + ' exceeds bucket size ' +\r\n this.bucketSize, null));\r\n return false;\r\n }\r\n\r\n // Drip new tokens into this bucket\r\n this.drip();\r\n\r\n // If we don't have enough tokens in this bucket, come back later\r\n if (count > this.content)\r\n return comeBackLater();\r\n\r\n if (this.parentBucket) {\r\n // Remove the requested from the parent bucket first\r\n return this.parentBucket.removeTokens(count, function(err, remainingTokens) {\r\n if (err) return callback(err, null);\r\n\r\n // Check that we still have enough tokens in this bucket\r\n if (count > self.content)\r\n return comeBackLater();\r\n\r\n // Tokens were removed from the parent bucket, now remove them from\r\n // this bucket and fire the callback. Note that we look at the current\r\n // bucket and parent bucket's remaining tokens and return the smaller\r\n // of the two values\r\n self.content -= count;\r\n callback(null, Math.min(remainingTokens, self.content));\r\n });\r\n } else {\r\n // Remove the requested tokens from this bucket and fire the callback\r\n this.content -= count;\r\n process.nextTick(callback.bind(null, null, this.content));\r\n return true;\r\n }\r\n\r\n function comeBackLater() {\r\n // How long do we need to wait to make up the difference in tokens?\r\n var waitInterval = Math.ceil(\r\n (count - self.content) * (self.interval / self.tokensPerInterval));\r\n setTimeout(function() { self.removeTokens(count, callback); }, waitInterval);\r\n return false;\r\n }\r\n },\r\n\r\n /**\r\n * Attempt to remove the requested number of tokens and return immediately.\r\n * If the bucket (and any parent buckets) contains enough tokens this will\r\n * return true, otherwise false is returned.\r\n * @param {Number} count The number of tokens to remove.\r\n * @param {Boolean} True if the tokens were successfully removed, otherwise\r\n * false.\r\n */\r\n tryRemoveTokens: function(count) {\r\n // Is this an infinite size bucket?\r\n if (!this.bucketSize)\r\n return true;\r\n\r\n // Make sure the bucket can hold the requested number of tokens\r\n if (count > this.bucketSize)\r\n return false;\r\n\r\n // Drip new tokens into this bucket\r\n this.drip();\r\n\r\n // If we don't have enough tokens in this bucket, return false\r\n if (count > this.content)\r\n return false;\r\n\r\n // Try to remove the requested tokens from the parent bucket\r\n if (this.parentBucket && !this.parentBucket.tryRemoveTokens(count))\r\n return false;\r\n\r\n // Remove the requested tokens from this bucket and return\r\n this.content -= count;\r\n return true;\r\n },\r\n\r\n /**\r\n * Add any new tokens to the bucket since the last drip.\r\n * @returns {Boolean} True if new tokens were added, otherwise false.\r\n */\r\n drip: function() {\r\n if (!this.tokensPerInterval) {\r\n this.content = this.bucketSize;\r\n return;\r\n }\r\n\r\n var now = +new Date();\r\n var deltaMS = Math.max(now - this.lastDrip, 0);\r\n this.lastDrip = now;\r\n\r\n var dripAmount = deltaMS * (this.tokensPerInterval / this.interval);\r\n this.content = Math.min(this.content + dripAmount, this.bucketSize);\r\n }\r\n};\r\n\r\nmodule.exports = TokenBucket;\r\n","var events = require('events')\nvar inherits = require('inherits')\n\nmodule.exports = LRU\n\nfunction LRU (opts) {\n if (!(this instanceof LRU)) return new LRU(opts)\n if (typeof opts === 'number') opts = {max: opts}\n if (!opts) opts = {}\n events.EventEmitter.call(this)\n this.cache = {}\n this.head = this.tail = null\n this.length = 0\n this.max = opts.max || 1000\n this.maxAge = opts.maxAge || 0\n}\n\ninherits(LRU, events.EventEmitter)\n\nObject.defineProperty(LRU.prototype, 'keys', {\n get: function () { return Object.keys(this.cache) }\n})\n\nLRU.prototype.clear = function () {\n this.cache = {}\n this.head = this.tail = null\n this.length = 0\n}\n\nLRU.prototype.remove = function (key) {\n if (typeof key !== 'string') key = '' + key\n if (!this.cache.hasOwnProperty(key)) return\n\n var element = this.cache[key]\n delete this.cache[key]\n this._unlink(key, element.prev, element.next)\n return element.value\n}\n\nLRU.prototype._unlink = function (key, prev, next) {\n this.length--\n\n if (this.length === 0) {\n this.head = this.tail = null\n } else {\n if (this.head === key) {\n this.head = prev\n this.cache[this.head].next = null\n } else if (this.tail === key) {\n this.tail = next\n this.cache[this.tail].prev = null\n } else {\n this.cache[prev].next = next\n this.cache[next].prev = prev\n }\n }\n}\n\nLRU.prototype.peek = function (key) {\n if (!this.cache.hasOwnProperty(key)) return\n\n var element = this.cache[key]\n\n if (!this._checkAge(key, element)) return\n return element.value\n}\n\nLRU.prototype.set = function (key, value) {\n if (typeof key !== 'string') key = '' + key\n\n var element\n\n if (this.cache.hasOwnProperty(key)) {\n element = this.cache[key]\n element.value = value\n if (this.maxAge) element.modified = Date.now()\n\n // If it's already the head, there's nothing more to do:\n if (key === this.head) return value\n this._unlink(key, element.prev, element.next)\n } else {\n element = {value: value, modified: 0, next: null, prev: null}\n if (this.maxAge) element.modified = Date.now()\n this.cache[key] = element\n\n // Eviction is only possible if the key didn't already exist:\n if (this.length === this.max) this.evict()\n }\n\n this.length++\n element.next = null\n element.prev = this.head\n\n if (this.head) this.cache[this.head].next = key\n this.head = key\n\n if (!this.tail) this.tail = key\n return value\n}\n\nLRU.prototype._checkAge = function (key, element) {\n if (this.maxAge && (Date.now() - element.modified) > this.maxAge) {\n this.remove(key)\n this.emit('evict', {key: key, value: element.value})\n return false\n }\n return true\n}\n\nLRU.prototype.get = function (key) {\n if (typeof key !== 'string') key = '' + key\n if (!this.cache.hasOwnProperty(key)) return\n\n var element = this.cache[key]\n\n if (!this._checkAge(key, element)) return\n\n if (this.head !== key) {\n if (key === this.tail) {\n this.tail = element.next\n this.cache[this.tail].prev = null\n } else {\n // Set prev.next -> element.next:\n this.cache[element.prev].next = element.next\n }\n\n // Set element.next.prev -> element.prev:\n this.cache[element.next].prev = element.prev\n\n // Element is the new head\n this.cache[this.head].next = key\n element.prev = this.head\n element.next = null\n this.head = key\n }\n\n return element.value\n}\n\nLRU.prototype.evict = function () {\n if (!this.tail) return\n var key = this.tail\n var value = this.remove(this.tail)\n this.emit('evict', {key: key, value: value})\n}\n","/*! lt_donthave. MIT License. WebTorrent LLC */\nconst arrayRemove = require('unordered-array-remove')\nconst { EventEmitter } = require('events')\nconst debug = require('debug')('lt_donthave')\n\nmodule.exports = () => {\n class ltDontHave extends EventEmitter {\n constructor (wire) {\n super()\n\n this._peerSupports = false\n this._wire = wire\n }\n\n onExtendedHandshake () {\n this._peerSupports = true\n }\n\n onMessage (buf) {\n let index\n try {\n index = buf.readUInt32BE()\n } catch (err) {\n // drop invalid messages\n return\n }\n\n if (!this._wire.peerPieces.get(index)) return\n debug('got donthave %d', index)\n this._wire.peerPieces.set(index, false)\n\n this.emit('donthave', index)\n this._failRequests(index)\n }\n\n donthave (index) {\n if (!this._peerSupports) return\n\n debug('donthave %d', index)\n const buf = Buffer.alloc(4)\n buf.writeUInt32BE(index)\n\n this._wire.extended('lt_donthave', buf)\n }\n\n _failRequests (index) {\n const requests = this._wire.requests\n for (let i = 0; i < requests.length; i++) {\n const req = requests[i]\n if (req.piece === index) {\n arrayRemove(requests, i)\n i -= 1 // Check the new value at the same slot\n this._wire._callback(req, new Error('peer sent donthave'), null)\n }\n }\n }\n }\n\n // Name of the bittorrent-protocol extension\n ltDontHave.prototype.name = 'lt_donthave'\n\n return ltDontHave\n}\n","/*! magnet-uri. MIT License. WebTorrent LLC */\nmodule.exports = magnetURIDecode\nmodule.exports.decode = magnetURIDecode\nmodule.exports.encode = magnetURIEncode\n\nconst base32 = require('thirty-two')\nconst bep53Range = require('bep53-range')\n\n/**\n * Parse a magnet URI and return an object of keys/values\n *\n * @param {string} uri\n * @return {Object} parsed uri\n */\nfunction magnetURIDecode (uri) {\n const result = {}\n\n // Support 'magnet:' and 'stream-magnet:' uris\n const data = uri.split('magnet:?')[1]\n\n const params = (data && data.length >= 0)\n ? data.split('&')\n : []\n\n params.forEach(param => {\n const keyval = param.split('=')\n\n // This keyval is invalid, skip it\n if (keyval.length !== 2) return\n\n const key = keyval[0]\n let val = keyval[1]\n\n // Clean up torrent name\n if (key === 'dn') val = decodeURIComponent(val).replace(/\\+/g, ' ')\n\n // Address tracker (tr), exact source (xs), and acceptable source (as) are encoded\n // URIs, so decode them\n if (key === 'tr' || key === 'xs' || key === 'as' || key === 'ws') {\n val = decodeURIComponent(val)\n }\n\n // Return keywords as an array\n if (key === 'kt') val = decodeURIComponent(val).split('+')\n\n // Cast file index (ix) to a number\n if (key === 'ix') val = Number(val)\n\n // bep53\n if (key === 'so') val = bep53Range.parse(decodeURIComponent(val).split(','))\n\n // If there are repeated parameters, return an array of values\n if (result[key]) {\n if (!Array.isArray(result[key])) {\n result[key] = [result[key]]\n }\n\n result[key].push(val)\n } else {\n result[key] = val\n }\n })\n\n // Convenience properties for parity with `parse-torrent-file` module\n let m\n if (result.xt) {\n const xts = Array.isArray(result.xt) ? result.xt : [result.xt]\n xts.forEach(xt => {\n if ((m = xt.match(/^urn:btih:(.{40})/))) {\n result.infoHash = m[1].toLowerCase()\n } else if ((m = xt.match(/^urn:btih:(.{32})/))) {\n const decodedStr = base32.decode(m[1])\n result.infoHash = Buffer.from(decodedStr, 'binary').toString('hex')\n } else if ((m = xt.match(/^urn:btmh:1220(.{64})/))) {\n result.infoHashV2 = m[1].toLowerCase()\n }\n })\n }\n\n if (result.xs) {\n const xss = Array.isArray(result.xs) ? result.xs : [result.xs]\n xss.forEach(xs => {\n if ((m = xs.match(/^urn:btpk:(.{64})/))) {\n result.publicKey = m[1].toLowerCase()\n }\n })\n }\n\n if (result.infoHash) result.infoHashBuffer = Buffer.from(result.infoHash, 'hex')\n if (result.infoHashV2) result.infoHashV2Buffer = Buffer.from(result.infoHashV2, 'hex')\n if (result.publicKey) result.publicKeyBuffer = Buffer.from(result.publicKey, 'hex')\n\n if (result.dn) result.name = result.dn\n if (result.kt) result.keywords = result.kt\n\n result.announce = []\n if (typeof result.tr === 'string' || Array.isArray(result.tr)) {\n result.announce = result.announce.concat(result.tr)\n }\n\n result.urlList = []\n if (typeof result.as === 'string' || Array.isArray(result.as)) {\n result.urlList = result.urlList.concat(result.as)\n }\n if (typeof result.ws === 'string' || Array.isArray(result.ws)) {\n result.urlList = result.urlList.concat(result.ws)\n }\n\n result.peerAddresses = []\n if (typeof result['x.pe'] === 'string' || Array.isArray(result['x.pe'])) {\n result.peerAddresses = result.peerAddresses.concat(result['x.pe'])\n }\n\n // remove duplicates by converting to Set and back\n result.announce = Array.from(new Set(result.announce))\n result.urlList = Array.from(new Set(result.urlList))\n result.peerAddresses = Array.from(new Set(result.peerAddresses))\n\n return result\n}\n\nfunction magnetURIEncode (obj) {\n obj = Object.assign({}, obj) // clone obj, so we can mutate it\n\n // support using convenience names, in addition to spec names\n // (example: `infoHash` for `xt`, `name` for `dn`)\n\n // Deduplicate xt by using a set\n let xts = new Set()\n if (obj.xt && typeof obj.xt === 'string') xts.add(obj.xt)\n if (obj.xt && Array.isArray(obj.xt)) xts = new Set(obj.xt)\n if (obj.infoHashBuffer) xts.add(`urn:btih:${obj.infoHashBuffer.toString('hex')}`)\n if (obj.infoHash) xts.add(`urn:btih:${obj.infoHash}`)\n if (obj.infoHashV2Buffer) xts.add(obj.xt = `urn:btmh:1220${obj.infoHashV2Buffer.toString('hex')}`)\n if (obj.infoHashV2) xts.add(`urn:btmh:1220${obj.infoHashV2}`)\n const xtsDeduped = Array.from(xts)\n if (xtsDeduped.length === 1) obj.xt = xtsDeduped[0]\n if (xtsDeduped.length > 1) obj.xt = xtsDeduped\n\n if (obj.publicKeyBuffer) obj.xs = `urn:btpk:${obj.publicKeyBuffer.toString('hex')}`\n if (obj.publicKey) obj.xs = `urn:btpk:${obj.publicKey}`\n if (obj.name) obj.dn = obj.name\n if (obj.keywords) obj.kt = obj.keywords\n if (obj.announce) obj.tr = obj.announce\n if (obj.urlList) {\n obj.ws = obj.urlList\n delete obj.as\n }\n if (obj.peerAddresses) obj['x.pe'] = obj.peerAddresses\n\n let result = 'magnet:?'\n Object.keys(obj)\n .filter(key => key.length === 2 || key === 'x.pe')\n .forEach((key, i) => {\n const values = Array.isArray(obj[key]) ? obj[key] : [obj[key]]\n values.forEach((val, j) => {\n if ((i > 0 || j > 0) && ((key !== 'kt' && key !== 'so') || j === 0)) result += '&'\n\n if (key === 'dn') val = encodeURIComponent(val).replace(/%20/g, '+')\n if (key === 'tr' || key === 'as' || key === 'ws') {\n val = encodeURIComponent(val)\n }\n // Don't URI encode BEP46 keys\n if (key === 'xs' && !val.startsWith('urn:btpk:')) {\n val = encodeURIComponent(val)\n }\n if (key === 'kt') val = encodeURIComponent(val)\n if (key === 'so') return\n\n if (key === 'kt' && j > 0) result += `+${val}`\n else result += `${key}=${val}`\n })\n if (key === 'so') result += `${key}=${bep53Range.compose(values)}`\n })\n\n return result\n}\n","import { EbmlStreamDecoder, EbmlTagId } from 'ebml-stream';\nimport { Transform } from 'readable-stream';\nimport { inflateSync } from 'zlib';\n\nconst SSA_TYPES = new Set(['ssa', 'ass']);\nconst SSA_KEYS = ['readOrder', 'layer', 'style', 'name', 'marginL', 'marginR', 'marginV', 'effect', 'text'];\n\nfunction getData(chunk, id) {\n const el = chunk.Children.find(c => c.id === id);\n return el ? el.data : undefined;\n}\n\nclass SubtitleParserBase extends Transform {\n constructor() {\n super();\n this.subtitleTracks = new Map();\n this.timecodeScale = 1;\n this._currentClusterTimecode = null;\n this.decoder = new EbmlStreamDecoder({\n bufferTagIds: [EbmlTagId.TimecodeScale, EbmlTagId.Tracks, EbmlTagId.BlockGroup, EbmlTagId.AttachedFile]\n });\n this.decoder.on('data', this.parseEbmlSubtitles.bind(this));\n }\n\n parseEbmlSubtitles(chunk) {\n // Segment Information\n if (chunk.id === EbmlTagId.TimecodeScale) {\n this.timecodeScale = chunk.data / 1000000;\n } // Assumption: This is a Cluster `Timecode`\n\n\n if (chunk.id === EbmlTagId.Timecode) {\n this._currentClusterTimecode = chunk.data;\n }\n\n if (chunk.id === EbmlTagId.Tracks) {\n for (const entry of chunk.Children.filter(c => c.id === EbmlTagId.TrackEntry)) {\n // Skip non subtitle tracks\n if (getData(entry, EbmlTagId.TrackType) !== 0x11) continue;\n const codecID = getData(entry, EbmlTagId.CodecID) || '';\n\n if (codecID.startsWith('S_TEXT')) {\n const track = {\n number: getData(entry, EbmlTagId.TrackNumber),\n language: getData(entry, EbmlTagId.Language),\n type: codecID.substring(7).toLowerCase()\n };\n const name = getData(entry, EbmlTagId.Name);\n\n if (name) {\n track.name = name;\n }\n\n const header = getData(entry, EbmlTagId.CodecPrivate);\n\n if (header) {\n track.header = header.toString();\n } // TODO: Assume zlib deflate compression\n\n\n const compressed = entry.Children.find(c => c.id === EbmlTagId.ContentEncodings && c.Children.find(cc => cc.id === EbmlTagId.ContentEncoding && cc.Children.find(ccc => ccc.id === EbmlTagId.ContentCompression)));\n\n if (compressed) {\n track._compressed = true;\n }\n\n this.subtitleTracks.set(track.number, track);\n }\n }\n\n this.emit('tracks', Array.from(this.subtitleTracks.values()));\n }\n\n if (chunk.id === EbmlTagId.BlockGroup) {\n const block = chunk.Children.find(c => c.id === EbmlTagId.Block);\n\n if (block && this.subtitleTracks.has(block.track)) {\n const blockDuration = getData(chunk, EbmlTagId.BlockDuration);\n const track = this.subtitleTracks.get(block.track);\n const payload = track._compressed ? inflateSync(Buffer.from(block.payload)) : block.payload;\n const subtitle = {\n text: payload.toString('utf8'),\n time: (block.value + this._currentClusterTimecode) * this.timecodeScale,\n duration: blockDuration * this.timecodeScale\n };\n\n if (SSA_TYPES.has(track.type)) {\n // extract SSA/ASS keys\n const values = subtitle.text.split(','); // ignore read-order, and skip layer if ssa\n\n for (let i = track.type === 'ssa' ? 2 : 1; i < 8; i++) {\n subtitle[SSA_KEYS[i]] = values[i];\n }\n\n subtitle.text = values.slice(8).join(',');\n }\n\n this.emit('subtitle', subtitle, block.track);\n }\n } // Parse attached files, mainly to allow extracting subtitle font files.\n\n\n if (chunk.id === EbmlTagId.AttachedFile) {\n this.emit('file', {\n filename: getData(chunk, EbmlTagId.FileName),\n mimetype: getData(chunk, EbmlTagId.FileMimeType),\n data: getData(chunk, EbmlTagId.FileData)\n });\n }\n }\n\n}\n\nclass SubtitleParser extends SubtitleParserBase {\n constructor() {\n super();\n this.decoder.on('data', chunk => {\n if (chunk.id === EbmlTagId.Tracks) {\n // stop decoding if no subtitle tracks are present\n if (this.subtitleTracks.size === 0) this.end();\n }\n });\n }\n\n _write(chunk, _, callback) {\n this.decoder.write(chunk);\n callback(null, chunk);\n }\n\n}\n\nclass SubtitleStream extends SubtitleParserBase {\n constructor(prevInstance) {\n super();\n\n if (prevInstance instanceof SubtitleStream) {\n prevInstance.once('drain', () => prevInstance.end()); // copy previous metadata\n\n this.subtitleTracks = prevInstance.subtitleTracks;\n this.timecodeScale = prevInstance.timecodeScale; // may not be at ebml tag offset\n\n this.unstable = true;\n }\n } // passthrough stream: data is intercepted but not transformed\n\n\n _transform(chunk, _, callback) {\n if (this.unstable) {\n // the ebml decoder expects to see a tag, so we won't use it until we find a cluster\n for (let i = 0; i < chunk.length - 12; i++) {\n // cluster id\n if (chunk[i] === 0x1f && chunk[i + 1] === 0x43 && chunk[i + 2] === 0xb6 && chunk[i + 3] === 0x75) {\n // length of cluster size tag\n const len = 8 - Math.floor(Math.log2(chunk[i + 4])); // first tag in cluster is cluster timecode\n\n if (chunk[i + 4 + len] === 0xe7) {\n // okay this is probably a cluster\n this.unstable = false;\n this.decoderWrite(chunk.slice(i));\n break;\n }\n }\n }\n } else {\n this.decoderWrite(chunk);\n }\n\n callback(null, chunk);\n }\n\n decoderWrite(chunk) {\n // passthrough stream should allow chained streams to continue on error\n try {\n this.decoder.write(chunk);\n } catch (err) {\n console.warn('[matroska-subtitles] EBML stream decoding error');\n }\n }\n\n}\n\nexport { SubtitleParser, SubtitleStream };\n//# sourceMappingURL=matroska-subtitles.module.js.map\n","'use strict'\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\nvar Buffer = require('safe-buffer').Buffer\n\nvar ARRAY16 = new Array(16)\n\nfunction MD5 () {\n HashBase.call(this, 64)\n\n // state\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n}\n\ninherits(MD5, HashBase)\n\nMD5.prototype._update = function () {\n var M = ARRAY16\n for (var i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4)\n\n var a = this._a\n var b = this._b\n var c = this._c\n var d = this._d\n\n a = fnF(a, b, c, d, M[0], 0xd76aa478, 7)\n d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12)\n c = fnF(c, d, a, b, M[2], 0x242070db, 17)\n b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22)\n a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7)\n d = fnF(d, a, b, c, M[5], 0x4787c62a, 12)\n c = fnF(c, d, a, b, M[6], 0xa8304613, 17)\n b = fnF(b, c, d, a, M[7], 0xfd469501, 22)\n a = fnF(a, b, c, d, M[8], 0x698098d8, 7)\n d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12)\n c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17)\n b = fnF(b, c, d, a, M[11], 0x895cd7be, 22)\n a = fnF(a, b, c, d, M[12], 0x6b901122, 7)\n d = fnF(d, a, b, c, M[13], 0xfd987193, 12)\n c = fnF(c, d, a, b, M[14], 0xa679438e, 17)\n b = fnF(b, c, d, a, M[15], 0x49b40821, 22)\n\n a = fnG(a, b, c, d, M[1], 0xf61e2562, 5)\n d = fnG(d, a, b, c, M[6], 0xc040b340, 9)\n c = fnG(c, d, a, b, M[11], 0x265e5a51, 14)\n b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20)\n a = fnG(a, b, c, d, M[5], 0xd62f105d, 5)\n d = fnG(d, a, b, c, M[10], 0x02441453, 9)\n c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14)\n b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20)\n a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5)\n d = fnG(d, a, b, c, M[14], 0xc33707d6, 9)\n c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14)\n b = fnG(b, c, d, a, M[8], 0x455a14ed, 20)\n a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5)\n d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9)\n c = fnG(c, d, a, b, M[7], 0x676f02d9, 14)\n b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20)\n\n a = fnH(a, b, c, d, M[5], 0xfffa3942, 4)\n d = fnH(d, a, b, c, M[8], 0x8771f681, 11)\n c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16)\n b = fnH(b, c, d, a, M[14], 0xfde5380c, 23)\n a = fnH(a, b, c, d, M[1], 0xa4beea44, 4)\n d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11)\n c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16)\n b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23)\n a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4)\n d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11)\n c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16)\n b = fnH(b, c, d, a, M[6], 0x04881d05, 23)\n a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4)\n d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11)\n c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16)\n b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23)\n\n a = fnI(a, b, c, d, M[0], 0xf4292244, 6)\n d = fnI(d, a, b, c, M[7], 0x432aff97, 10)\n c = fnI(c, d, a, b, M[14], 0xab9423a7, 15)\n b = fnI(b, c, d, a, M[5], 0xfc93a039, 21)\n a = fnI(a, b, c, d, M[12], 0x655b59c3, 6)\n d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10)\n c = fnI(c, d, a, b, M[10], 0xffeff47d, 15)\n b = fnI(b, c, d, a, M[1], 0x85845dd1, 21)\n a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6)\n d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10)\n c = fnI(c, d, a, b, M[6], 0xa3014314, 15)\n b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21)\n a = fnI(a, b, c, d, M[4], 0xf7537e82, 6)\n d = fnI(d, a, b, c, M[11], 0xbd3af235, 10)\n c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15)\n b = fnI(b, c, d, a, M[9], 0xeb86d391, 21)\n\n this._a = (this._a + a) | 0\n this._b = (this._b + b) | 0\n this._c = (this._c + c) | 0\n this._d = (this._d + d) | 0\n}\n\nMD5.prototype._digest = function () {\n // create padding and handle blocks\n this._block[this._blockOffset++] = 0x80\n if (this._blockOffset > 56) {\n this._block.fill(0, this._blockOffset, 64)\n this._update()\n this._blockOffset = 0\n }\n\n this._block.fill(0, this._blockOffset, 56)\n this._block.writeUInt32LE(this._length[0], 56)\n this._block.writeUInt32LE(this._length[1], 60)\n this._update()\n\n // produce result\n var buffer = Buffer.allocUnsafe(16)\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 return buffer\n}\n\nfunction rotl (x, n) {\n return (x << n) | (x >>> (32 - n))\n}\n\nfunction fnF (a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnG (a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnH (a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnI (a, b, c, d, m, k, s) {\n return (rotl((a + ((c ^ (b | (~d)))) + m + k) | 0, s) + b) | 0\n}\n\nmodule.exports = MD5\n","/*! mediasource. MIT License. Feross Aboukhadijeh */\nmodule.exports = MediaElementWrapper\n\nvar inherits = require('inherits')\nvar stream = require('readable-stream')\nvar toArrayBuffer = require('to-arraybuffer')\n\nvar MediaSource = typeof window !== 'undefined' && window.MediaSource\n\nvar DEFAULT_BUFFER_DURATION = 60 // seconds\n\nfunction MediaElementWrapper (elem, opts) {\n var self = this\n if (!(self instanceof MediaElementWrapper)) return new MediaElementWrapper(elem, opts)\n\n if (!MediaSource) throw new Error('web browser lacks MediaSource support')\n\n if (!opts) opts = {}\n self._debug = opts.debug\n self._bufferDuration = opts.bufferDuration || DEFAULT_BUFFER_DURATION\n self._elem = elem\n self._mediaSource = new MediaSource()\n self._streams = []\n self.detailedError = null\n\n self._errorHandler = function () {\n self._elem.removeEventListener('error', self._errorHandler)\n var streams = self._streams.slice()\n streams.forEach(function (stream) {\n stream.destroy(self._elem.error)\n })\n }\n self._elem.addEventListener('error', self._errorHandler)\n\n self._elem.src = window.URL.createObjectURL(self._mediaSource)\n}\n\n/*\n * `obj` can be a previous value returned by this function\n * or a string\n */\nMediaElementWrapper.prototype.createWriteStream = function (obj) {\n var self = this\n\n return new MediaSourceStream(self, obj)\n}\n\n/*\n * Use to trigger an error on the underlying media element\n */\nMediaElementWrapper.prototype.error = function (err) {\n var self = this\n\n // be careful not to overwrite any existing detailedError values\n if (!self.detailedError) {\n self.detailedError = err\n }\n self._dumpDebugData()\n try {\n self._mediaSource.endOfStream('decode')\n } catch (err) {}\n\n try {\n // Attempt to clean up object URL\n window.URL.revokeObjectURL(self._elem.src)\n } catch (err) {}\n}\n\n/*\n * When self._debug is set, dump all data to files\n */\nMediaElementWrapper.prototype._dumpDebugData = function () {\n var self = this\n\n if (self._debug) {\n self._debug = false // prevent multiple dumps on multiple errors\n self._streams.forEach(function (stream, i) {\n downloadBuffers(stream._debugBuffers, 'mediasource-stream-' + i)\n })\n }\n}\n\ninherits(MediaSourceStream, stream.Writable)\n\nfunction MediaSourceStream (wrapper, obj) {\n var self = this\n stream.Writable.call(self)\n\n self._wrapper = wrapper\n self._elem = wrapper._elem\n self._mediaSource = wrapper._mediaSource\n self._allStreams = wrapper._streams\n self._allStreams.push(self)\n self._bufferDuration = wrapper._bufferDuration\n self._sourceBuffer = null\n self._debugBuffers = []\n\n self._openHandler = function () {\n self._onSourceOpen()\n }\n self._flowHandler = function () {\n self._flow()\n }\n self._errorHandler = function (err) {\n if (!self.destroyed) {\n self.emit('error', err)\n }\n }\n\n if (typeof obj === 'string') {\n self._type = obj\n // Need to create a new sourceBuffer\n if (self._mediaSource.readyState === 'open') {\n self._createSourceBuffer()\n } else {\n self._mediaSource.addEventListener('sourceopen', self._openHandler)\n }\n } else if (obj._sourceBuffer === null) {\n obj.destroy()\n self._type = obj._type // The old stream was created but hasn't finished initializing\n self._mediaSource.addEventListener('sourceopen', self._openHandler)\n } else if (obj._sourceBuffer) {\n obj.destroy()\n self._type = obj._type\n self._sourceBuffer = obj._sourceBuffer // Copy over the old sourceBuffer\n self._debugBuffers = obj._debugBuffers // Copy over previous debug data\n self._sourceBuffer.addEventListener('updateend', self._flowHandler)\n self._sourceBuffer.addEventListener('error', self._errorHandler)\n } else {\n throw new Error('The argument to MediaElementWrapper.createWriteStream must be a string or a previous stream returned from that function')\n }\n\n self._elem.addEventListener('timeupdate', self._flowHandler)\n\n self.on('error', function (err) {\n self._wrapper.error(err)\n })\n\n self.on('finish', function () {\n if (self.destroyed) return\n self._finished = true\n if (self._allStreams.every(function (other) { return other._finished })) {\n self._wrapper._dumpDebugData()\n try {\n self._mediaSource.endOfStream()\n } catch (err) {}\n }\n })\n}\n\nMediaSourceStream.prototype._onSourceOpen = function () {\n var self = this\n if (self.destroyed) return\n\n self._mediaSource.removeEventListener('sourceopen', self._openHandler)\n self._createSourceBuffer()\n}\n\nMediaSourceStream.prototype.destroy = function (err) {\n var self = this\n if (self.destroyed) return\n self.destroyed = true\n\n // Remove from allStreams\n self._allStreams.splice(self._allStreams.indexOf(self), 1)\n\n self._mediaSource.removeEventListener('sourceopen', self._openHandler)\n self._elem.removeEventListener('timeupdate', self._flowHandler)\n if (self._sourceBuffer) {\n self._sourceBuffer.removeEventListener('updateend', self._flowHandler)\n self._sourceBuffer.removeEventListener('error', self._errorHandler)\n if (self._mediaSource.readyState === 'open') {\n self._sourceBuffer.abort()\n }\n }\n\n if (err) self.emit('error', err)\n self.emit('close')\n}\n\nMediaSourceStream.prototype._createSourceBuffer = function () {\n var self = this\n if (self.destroyed) return\n\n if (MediaSource.isTypeSupported(self._type)) {\n self._sourceBuffer = self._mediaSource.addSourceBuffer(self._type)\n self._sourceBuffer.addEventListener('updateend', self._flowHandler)\n self._sourceBuffer.addEventListener('error', self._errorHandler)\n if (self._cb) {\n var cb = self._cb\n self._cb = null\n cb()\n }\n } else {\n self.destroy(new Error('The provided type is not supported'))\n }\n}\n\nMediaSourceStream.prototype._write = function (chunk, encoding, cb) {\n var self = this\n if (self.destroyed) return\n if (!self._sourceBuffer) {\n self._cb = function (err) {\n if (err) return cb(err)\n self._write(chunk, encoding, cb)\n }\n return\n }\n\n if (self._sourceBuffer.updating) {\n return cb(new Error('Cannot append buffer while source buffer updating'))\n }\n\n var arr = toArrayBuffer(chunk)\n if (self._wrapper._debug) {\n self._debugBuffers.push(arr)\n }\n\n try {\n self._sourceBuffer.appendBuffer(arr)\n } catch (err) {\n // appendBuffer can throw for a number of reasons, most notably when the data\n // being appended is invalid or if appendBuffer is called after another error\n // already occurred on the media element. In Chrome, there may be useful debugging\n // info in chrome://media-internals\n self.destroy(err)\n return\n }\n self._cb = cb\n}\n\nMediaSourceStream.prototype._flow = function () {\n var self = this\n\n if (self.destroyed || !self._sourceBuffer || self._sourceBuffer.updating) {\n return\n }\n\n if (self._mediaSource.readyState === 'open') {\n // check buffer size\n if (self._getBufferDuration() > self._bufferDuration) {\n return\n }\n }\n\n if (self._cb) {\n var cb = self._cb\n self._cb = null\n cb()\n }\n}\n\n// TODO: if zero actually works in all browsers, remove the logic associated with this below\nvar EPSILON = 0\n\nMediaSourceStream.prototype._getBufferDuration = function () {\n var self = this\n\n var buffered = self._sourceBuffer.buffered\n var currentTime = self._elem.currentTime\n var bufferEnd = -1 // end of the buffer\n // This is a little over complex because some browsers seem to separate the\n // buffered region into multiple sections with slight gaps.\n for (var i = 0; i < buffered.length; i++) {\n var start = buffered.start(i)\n var end = buffered.end(i) + EPSILON\n\n if (start > currentTime) {\n // Reached past the joined buffer\n break\n } else if (bufferEnd >= 0 || currentTime <= end) {\n // Found the start/continuation of the joined buffer\n bufferEnd = end\n }\n }\n\n var bufferedTime = bufferEnd - currentTime\n if (bufferedTime < 0) {\n bufferedTime = 0\n }\n\n return bufferedTime\n}\n\nfunction downloadBuffers (bufs, name) {\n var a = document.createElement('a')\n a.href = window.URL.createObjectURL(new window.Blob(bufs))\n a.download = name\n a.click()\n}\n","module.exports = Storage\n\nconst queueMicrotask = require('queue-microtask')\n\nfunction Storage (chunkLength, opts) {\n if (!(this instanceof Storage)) return new Storage(chunkLength, opts)\n if (!opts) opts = {}\n\n this.chunkLength = Number(chunkLength)\n if (!this.chunkLength) throw new Error('First argument must be a chunk length')\n\n this.chunks = []\n this.closed = false\n this.length = Number(opts.length) || Infinity\n\n if (this.length !== Infinity) {\n this.lastChunkLength = (this.length % this.chunkLength) || this.chunkLength\n this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1\n }\n}\n\nStorage.prototype.put = function (index, buf, cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n\n const isLastChunk = (index === this.lastChunkIndex)\n if (isLastChunk && buf.length !== this.lastChunkLength) {\n return queueMicrotask(() => cb(new Error('Last chunk length must be ' + this.lastChunkLength)))\n }\n if (!isLastChunk && buf.length !== this.chunkLength) {\n return queueMicrotask(() => cb(new Error('Chunk length must be ' + this.chunkLength)))\n }\n this.chunks[index] = buf\n queueMicrotask(() => cb(null))\n}\n\nStorage.prototype.get = function (index, opts, cb = () => {}) {\n if (typeof opts === 'function') return this.get(index, null, opts)\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n\n let buf = this.chunks[index]\n\n if (!buf) {\n const err = new Error('Chunk not found')\n err.notFound = true\n return queueMicrotask(() => cb(err))\n }\n\n if (!opts) opts = {}\n\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n\n if (offset !== 0 || len !== buf.length) {\n buf = buf.slice(offset, len + offset)\n }\n\n queueMicrotask(() => cb(null, buf))\n}\n\nStorage.prototype.close = Storage.prototype.destroy = function (cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n this.closed = true\n this.chunks = null\n queueMicrotask(() => cb(null))\n}\n","var bn = require('bn.js');\nvar brorand = require('brorand');\n\nfunction MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\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);\n\n // 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 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\n if (!k)\n k = Math.max(1, (len / 48) | 0);\n\n // Find d and s, (n - 1) = (2 ^ s) * d;\n var n1 = n.subn(1);\n for (var s = 0; !n1.testn(s); s++) {}\n var d = n.shrn(s);\n\n var rn1 = n1.toRed(red);\n\n var prime = true;\n for (; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n if (cb)\n cb(a);\n\n var x = a.toRed(red).redPow(d);\n if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n continue;\n\n for (var i = 1; i < s; i++) {\n x = x.redSqr();\n\n if (x.cmp(rone) === 0)\n return false;\n if (x.cmp(rn1) === 0)\n break;\n }\n\n if (i === s)\n 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\n if (!k)\n k = Math.max(1, (len / 48) | 0);\n\n // Find d and s, (n - 1) = (2 ^ s) * d;\n var n1 = n.subn(1);\n for (var s = 0; !n1.testn(s); s++) {}\n var d = n.shrn(s);\n\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)\n return g;\n\n var x = a.toRed(red).redPow(d);\n if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n continue;\n\n for (var i = 1; i < s; i++) {\n x = x.redSqr();\n\n if (x.cmp(rone) === 0)\n return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0)\n 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};\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","'use strict';\n\n/**\n * @param typeMap [Object] Map of MIME type -> Array[extensions]\n * @param ...\n */\nfunction Mime() {\n this._types = Object.create(null);\n this._extensions = Object.create(null);\n\n for (let i = 0; i < arguments.length; i++) {\n this.define(arguments[i]);\n }\n\n this.define = this.define.bind(this);\n this.getType = this.getType.bind(this);\n this.getExtension = this.getExtension.bind(this);\n}\n\n/**\n * Define mimetype -> extension mappings. Each key is a mime-type that maps\n * to an array of extensions associated with the type. The first extension is\n * used as the default extension for the type.\n *\n * e.g. mime.define({'audio/ogg', ['oga', 'ogg', 'spx']});\n *\n * If a type declares an extension that has already been defined, an error will\n * be thrown. To suppress this error and force the extension to be associated\n * with the new type, pass `force`=true. Alternatively, you may prefix the\n * extension with \"*\" to map the type to extension, without mapping the\n * extension to the type.\n *\n * e.g. mime.define({'audio/wav', ['wav']}, {'audio/x-wav', ['*wav']});\n *\n *\n * @param map (Object) type definitions\n * @param force (Boolean) if true, force overriding of existing definitions\n */\nMime.prototype.define = function(typeMap, force) {\n for (let type in typeMap) {\n let extensions = typeMap[type].map(function(t) {\n return t.toLowerCase();\n });\n type = type.toLowerCase();\n\n for (let i = 0; i < extensions.length; i++) {\n const ext = extensions[i];\n\n // '*' prefix = not the preferred type for this extension. So fixup the\n // extension, and skip it.\n if (ext[0] === '*') {\n continue;\n }\n\n if (!force && (ext in this._types)) {\n throw new Error(\n 'Attempt to change mapping for \"' + ext +\n '\" extension from \"' + this._types[ext] + '\" to \"' + type +\n '\". Pass `force=true` to allow this, otherwise remove \"' + ext +\n '\" from the list of extensions for \"' + type + '\".'\n );\n }\n\n this._types[ext] = type;\n }\n\n // Use first extension as default\n if (force || !this._extensions[type]) {\n const ext = extensions[0];\n this._extensions[type] = (ext[0] !== '*') ? ext : ext.substr(1);\n }\n }\n};\n\n/**\n * Lookup a mime type based on extension\n */\nMime.prototype.getType = function(path) {\n path = String(path);\n let last = path.replace(/^.*[/\\\\]/, '').toLowerCase();\n let ext = last.replace(/^.*\\./, '').toLowerCase();\n\n let hasPath = last.length < path.length;\n let hasDot = ext.length < last.length - 1;\n\n return (hasDot || !hasPath) && this._types[ext] || null;\n};\n\n/**\n * Return file extension associated with a mime type\n */\nMime.prototype.getExtension = function(type) {\n type = /^\\s*([^;\\s]*)/.test(type) && RegExp.$1;\n return type && this._extensions[type.toLowerCase()] || null;\n};\n\nmodule.exports = Mime;\n","'use strict';\n\nlet Mime = require('./Mime');\nmodule.exports = new Mime(require('./types/standard'), require('./types/other'));\n","module.exports = {\"application/prs.cww\":[\"cww\"],\"application/vnd.1000minds.decision-model+xml\":[\"1km\"],\"application/vnd.3gpp.pic-bw-large\":[\"plb\"],\"application/vnd.3gpp.pic-bw-small\":[\"psb\"],\"application/vnd.3gpp.pic-bw-var\":[\"pvb\"],\"application/vnd.3gpp2.tcap\":[\"tcap\"],\"application/vnd.3m.post-it-notes\":[\"pwn\"],\"application/vnd.accpac.simply.aso\":[\"aso\"],\"application/vnd.accpac.simply.imp\":[\"imp\"],\"application/vnd.acucobol\":[\"acu\"],\"application/vnd.acucorp\":[\"atc\",\"acutc\"],\"application/vnd.adobe.air-application-installer-package+zip\":[\"air\"],\"application/vnd.adobe.formscentral.fcdt\":[\"fcdt\"],\"application/vnd.adobe.fxp\":[\"fxp\",\"fxpl\"],\"application/vnd.adobe.xdp+xml\":[\"xdp\"],\"application/vnd.adobe.xfdf\":[\"xfdf\"],\"application/vnd.ahead.space\":[\"ahead\"],\"application/vnd.airzip.filesecure.azf\":[\"azf\"],\"application/vnd.airzip.filesecure.azs\":[\"azs\"],\"application/vnd.amazon.ebook\":[\"azw\"],\"application/vnd.americandynamics.acc\":[\"acc\"],\"application/vnd.amiga.ami\":[\"ami\"],\"application/vnd.android.package-archive\":[\"apk\"],\"application/vnd.anser-web-certificate-issue-initiation\":[\"cii\"],\"application/vnd.anser-web-funds-transfer-initiation\":[\"fti\"],\"application/vnd.antix.game-component\":[\"atx\"],\"application/vnd.apple.installer+xml\":[\"mpkg\"],\"application/vnd.apple.keynote\":[\"key\"],\"application/vnd.apple.mpegurl\":[\"m3u8\"],\"application/vnd.apple.numbers\":[\"numbers\"],\"application/vnd.apple.pages\":[\"pages\"],\"application/vnd.apple.pkpass\":[\"pkpass\"],\"application/vnd.aristanetworks.swi\":[\"swi\"],\"application/vnd.astraea-software.iota\":[\"iota\"],\"application/vnd.audiograph\":[\"aep\"],\"application/vnd.balsamiq.bmml+xml\":[\"bmml\"],\"application/vnd.blueice.multipass\":[\"mpm\"],\"application/vnd.bmi\":[\"bmi\"],\"application/vnd.businessobjects\":[\"rep\"],\"application/vnd.chemdraw+xml\":[\"cdxml\"],\"application/vnd.chipnuts.karaoke-mmd\":[\"mmd\"],\"application/vnd.cinderella\":[\"cdy\"],\"application/vnd.citationstyles.style+xml\":[\"csl\"],\"application/vnd.claymore\":[\"cla\"],\"application/vnd.cloanto.rp9\":[\"rp9\"],\"application/vnd.clonk.c4group\":[\"c4g\",\"c4d\",\"c4f\",\"c4p\",\"c4u\"],\"application/vnd.cluetrust.cartomobile-config\":[\"c11amc\"],\"application/vnd.cluetrust.cartomobile-config-pkg\":[\"c11amz\"],\"application/vnd.commonspace\":[\"csp\"],\"application/vnd.contact.cmsg\":[\"cdbcmsg\"],\"application/vnd.cosmocaller\":[\"cmc\"],\"application/vnd.crick.clicker\":[\"clkx\"],\"application/vnd.crick.clicker.keyboard\":[\"clkk\"],\"application/vnd.crick.clicker.palette\":[\"clkp\"],\"application/vnd.crick.clicker.template\":[\"clkt\"],\"application/vnd.crick.clicker.wordbank\":[\"clkw\"],\"application/vnd.criticaltools.wbs+xml\":[\"wbs\"],\"application/vnd.ctc-posml\":[\"pml\"],\"application/vnd.cups-ppd\":[\"ppd\"],\"application/vnd.curl.car\":[\"car\"],\"application/vnd.curl.pcurl\":[\"pcurl\"],\"application/vnd.dart\":[\"dart\"],\"application/vnd.data-vision.rdz\":[\"rdz\"],\"application/vnd.dbf\":[\"dbf\"],\"application/vnd.dece.data\":[\"uvf\",\"uvvf\",\"uvd\",\"uvvd\"],\"application/vnd.dece.ttml+xml\":[\"uvt\",\"uvvt\"],\"application/vnd.dece.unspecified\":[\"uvx\",\"uvvx\"],\"application/vnd.dece.zip\":[\"uvz\",\"uvvz\"],\"application/vnd.denovo.fcselayout-link\":[\"fe_launch\"],\"application/vnd.dna\":[\"dna\"],\"application/vnd.dolby.mlp\":[\"mlp\"],\"application/vnd.dpgraph\":[\"dpg\"],\"application/vnd.dreamfactory\":[\"dfac\"],\"application/vnd.ds-keypoint\":[\"kpxx\"],\"application/vnd.dvb.ait\":[\"ait\"],\"application/vnd.dvb.service\":[\"svc\"],\"application/vnd.dynageo\":[\"geo\"],\"application/vnd.ecowin.chart\":[\"mag\"],\"application/vnd.enliven\":[\"nml\"],\"application/vnd.epson.esf\":[\"esf\"],\"application/vnd.epson.msf\":[\"msf\"],\"application/vnd.epson.quickanime\":[\"qam\"],\"application/vnd.epson.salt\":[\"slt\"],\"application/vnd.epson.ssf\":[\"ssf\"],\"application/vnd.eszigno3+xml\":[\"es3\",\"et3\"],\"application/vnd.ezpix-album\":[\"ez2\"],\"application/vnd.ezpix-package\":[\"ez3\"],\"application/vnd.fdf\":[\"fdf\"],\"application/vnd.fdsn.mseed\":[\"mseed\"],\"application/vnd.fdsn.seed\":[\"seed\",\"dataless\"],\"application/vnd.flographit\":[\"gph\"],\"application/vnd.fluxtime.clip\":[\"ftc\"],\"application/vnd.framemaker\":[\"fm\",\"frame\",\"maker\",\"book\"],\"application/vnd.frogans.fnc\":[\"fnc\"],\"application/vnd.frogans.ltf\":[\"ltf\"],\"application/vnd.fsc.weblaunch\":[\"fsc\"],\"application/vnd.fujitsu.oasys\":[\"oas\"],\"application/vnd.fujitsu.oasys2\":[\"oa2\"],\"application/vnd.fujitsu.oasys3\":[\"oa3\"],\"application/vnd.fujitsu.oasysgp\":[\"fg5\"],\"application/vnd.fujitsu.oasysprs\":[\"bh2\"],\"application/vnd.fujixerox.ddd\":[\"ddd\"],\"application/vnd.fujixerox.docuworks\":[\"xdw\"],\"application/vnd.fujixerox.docuworks.binder\":[\"xbd\"],\"application/vnd.fuzzysheet\":[\"fzs\"],\"application/vnd.genomatix.tuxedo\":[\"txd\"],\"application/vnd.geogebra.file\":[\"ggb\"],\"application/vnd.geogebra.tool\":[\"ggt\"],\"application/vnd.geometry-explorer\":[\"gex\",\"gre\"],\"application/vnd.geonext\":[\"gxt\"],\"application/vnd.geoplan\":[\"g2w\"],\"application/vnd.geospace\":[\"g3w\"],\"application/vnd.gmx\":[\"gmx\"],\"application/vnd.google-apps.document\":[\"gdoc\"],\"application/vnd.google-apps.presentation\":[\"gslides\"],\"application/vnd.google-apps.spreadsheet\":[\"gsheet\"],\"application/vnd.google-earth.kml+xml\":[\"kml\"],\"application/vnd.google-earth.kmz\":[\"kmz\"],\"application/vnd.grafeq\":[\"gqf\",\"gqs\"],\"application/vnd.groove-account\":[\"gac\"],\"application/vnd.groove-help\":[\"ghf\"],\"application/vnd.groove-identity-message\":[\"gim\"],\"application/vnd.groove-injector\":[\"grv\"],\"application/vnd.groove-tool-message\":[\"gtm\"],\"application/vnd.groove-tool-template\":[\"tpl\"],\"application/vnd.groove-vcard\":[\"vcg\"],\"application/vnd.hal+xml\":[\"hal\"],\"application/vnd.handheld-entertainment+xml\":[\"zmm\"],\"application/vnd.hbci\":[\"hbci\"],\"application/vnd.hhe.lesson-player\":[\"les\"],\"application/vnd.hp-hpgl\":[\"hpgl\"],\"application/vnd.hp-hpid\":[\"hpid\"],\"application/vnd.hp-hps\":[\"hps\"],\"application/vnd.hp-jlyt\":[\"jlt\"],\"application/vnd.hp-pcl\":[\"pcl\"],\"application/vnd.hp-pclxl\":[\"pclxl\"],\"application/vnd.hydrostatix.sof-data\":[\"sfd-hdstx\"],\"application/vnd.ibm.minipay\":[\"mpy\"],\"application/vnd.ibm.modcap\":[\"afp\",\"listafp\",\"list3820\"],\"application/vnd.ibm.rights-management\":[\"irm\"],\"application/vnd.ibm.secure-container\":[\"sc\"],\"application/vnd.iccprofile\":[\"icc\",\"icm\"],\"application/vnd.igloader\":[\"igl\"],\"application/vnd.immervision-ivp\":[\"ivp\"],\"application/vnd.immervision-ivu\":[\"ivu\"],\"application/vnd.insors.igm\":[\"igm\"],\"application/vnd.intercon.formnet\":[\"xpw\",\"xpx\"],\"application/vnd.intergeo\":[\"i2g\"],\"application/vnd.intu.qbo\":[\"qbo\"],\"application/vnd.intu.qfx\":[\"qfx\"],\"application/vnd.ipunplugged.rcprofile\":[\"rcprofile\"],\"application/vnd.irepository.package+xml\":[\"irp\"],\"application/vnd.is-xpr\":[\"xpr\"],\"application/vnd.isac.fcs\":[\"fcs\"],\"application/vnd.jam\":[\"jam\"],\"application/vnd.jcp.javame.midlet-rms\":[\"rms\"],\"application/vnd.jisp\":[\"jisp\"],\"application/vnd.joost.joda-archive\":[\"joda\"],\"application/vnd.kahootz\":[\"ktz\",\"ktr\"],\"application/vnd.kde.karbon\":[\"karbon\"],\"application/vnd.kde.kchart\":[\"chrt\"],\"application/vnd.kde.kformula\":[\"kfo\"],\"application/vnd.kde.kivio\":[\"flw\"],\"application/vnd.kde.kontour\":[\"kon\"],\"application/vnd.kde.kpresenter\":[\"kpr\",\"kpt\"],\"application/vnd.kde.kspread\":[\"ksp\"],\"application/vnd.kde.kword\":[\"kwd\",\"kwt\"],\"application/vnd.kenameaapp\":[\"htke\"],\"application/vnd.kidspiration\":[\"kia\"],\"application/vnd.kinar\":[\"kne\",\"knp\"],\"application/vnd.koan\":[\"skp\",\"skd\",\"skt\",\"skm\"],\"application/vnd.kodak-descriptor\":[\"sse\"],\"application/vnd.las.las+xml\":[\"lasxml\"],\"application/vnd.llamagraphics.life-balance.desktop\":[\"lbd\"],\"application/vnd.llamagraphics.life-balance.exchange+xml\":[\"lbe\"],\"application/vnd.lotus-1-2-3\":[\"123\"],\"application/vnd.lotus-approach\":[\"apr\"],\"application/vnd.lotus-freelance\":[\"pre\"],\"application/vnd.lotus-notes\":[\"nsf\"],\"application/vnd.lotus-organizer\":[\"org\"],\"application/vnd.lotus-screencam\":[\"scm\"],\"application/vnd.lotus-wordpro\":[\"lwp\"],\"application/vnd.macports.portpkg\":[\"portpkg\"],\"application/vnd.mcd\":[\"mcd\"],\"application/vnd.medcalcdata\":[\"mc1\"],\"application/vnd.mediastation.cdkey\":[\"cdkey\"],\"application/vnd.mfer\":[\"mwf\"],\"application/vnd.mfmp\":[\"mfm\"],\"application/vnd.micrografx.flo\":[\"flo\"],\"application/vnd.micrografx.igx\":[\"igx\"],\"application/vnd.mif\":[\"mif\"],\"application/vnd.mobius.daf\":[\"daf\"],\"application/vnd.mobius.dis\":[\"dis\"],\"application/vnd.mobius.mbk\":[\"mbk\"],\"application/vnd.mobius.mqy\":[\"mqy\"],\"application/vnd.mobius.msl\":[\"msl\"],\"application/vnd.mobius.plc\":[\"plc\"],\"application/vnd.mobius.txf\":[\"txf\"],\"application/vnd.mophun.application\":[\"mpn\"],\"application/vnd.mophun.certificate\":[\"mpc\"],\"application/vnd.mozilla.xul+xml\":[\"xul\"],\"application/vnd.ms-artgalry\":[\"cil\"],\"application/vnd.ms-cab-compressed\":[\"cab\"],\"application/vnd.ms-excel\":[\"xls\",\"xlm\",\"xla\",\"xlc\",\"xlt\",\"xlw\"],\"application/vnd.ms-excel.addin.macroenabled.12\":[\"xlam\"],\"application/vnd.ms-excel.sheet.binary.macroenabled.12\":[\"xlsb\"],\"application/vnd.ms-excel.sheet.macroenabled.12\":[\"xlsm\"],\"application/vnd.ms-excel.template.macroenabled.12\":[\"xltm\"],\"application/vnd.ms-fontobject\":[\"eot\"],\"application/vnd.ms-htmlhelp\":[\"chm\"],\"application/vnd.ms-ims\":[\"ims\"],\"application/vnd.ms-lrm\":[\"lrm\"],\"application/vnd.ms-officetheme\":[\"thmx\"],\"application/vnd.ms-outlook\":[\"msg\"],\"application/vnd.ms-pki.seccat\":[\"cat\"],\"application/vnd.ms-pki.stl\":[\"*stl\"],\"application/vnd.ms-powerpoint\":[\"ppt\",\"pps\",\"pot\"],\"application/vnd.ms-powerpoint.addin.macroenabled.12\":[\"ppam\"],\"application/vnd.ms-powerpoint.presentation.macroenabled.12\":[\"pptm\"],\"application/vnd.ms-powerpoint.slide.macroenabled.12\":[\"sldm\"],\"application/vnd.ms-powerpoint.slideshow.macroenabled.12\":[\"ppsm\"],\"application/vnd.ms-powerpoint.template.macroenabled.12\":[\"potm\"],\"application/vnd.ms-project\":[\"mpp\",\"mpt\"],\"application/vnd.ms-word.document.macroenabled.12\":[\"docm\"],\"application/vnd.ms-word.template.macroenabled.12\":[\"dotm\"],\"application/vnd.ms-works\":[\"wps\",\"wks\",\"wcm\",\"wdb\"],\"application/vnd.ms-wpl\":[\"wpl\"],\"application/vnd.ms-xpsdocument\":[\"xps\"],\"application/vnd.mseq\":[\"mseq\"],\"application/vnd.musician\":[\"mus\"],\"application/vnd.muvee.style\":[\"msty\"],\"application/vnd.mynfc\":[\"taglet\"],\"application/vnd.neurolanguage.nlu\":[\"nlu\"],\"application/vnd.nitf\":[\"ntf\",\"nitf\"],\"application/vnd.noblenet-directory\":[\"nnd\"],\"application/vnd.noblenet-sealer\":[\"nns\"],\"application/vnd.noblenet-web\":[\"nnw\"],\"application/vnd.nokia.n-gage.ac+xml\":[\"*ac\"],\"application/vnd.nokia.n-gage.data\":[\"ngdat\"],\"application/vnd.nokia.n-gage.symbian.install\":[\"n-gage\"],\"application/vnd.nokia.radio-preset\":[\"rpst\"],\"application/vnd.nokia.radio-presets\":[\"rpss\"],\"application/vnd.novadigm.edm\":[\"edm\"],\"application/vnd.novadigm.edx\":[\"edx\"],\"application/vnd.novadigm.ext\":[\"ext\"],\"application/vnd.oasis.opendocument.chart\":[\"odc\"],\"application/vnd.oasis.opendocument.chart-template\":[\"otc\"],\"application/vnd.oasis.opendocument.database\":[\"odb\"],\"application/vnd.oasis.opendocument.formula\":[\"odf\"],\"application/vnd.oasis.opendocument.formula-template\":[\"odft\"],\"application/vnd.oasis.opendocument.graphics\":[\"odg\"],\"application/vnd.oasis.opendocument.graphics-template\":[\"otg\"],\"application/vnd.oasis.opendocument.image\":[\"odi\"],\"application/vnd.oasis.opendocument.image-template\":[\"oti\"],\"application/vnd.oasis.opendocument.presentation\":[\"odp\"],\"application/vnd.oasis.opendocument.presentation-template\":[\"otp\"],\"application/vnd.oasis.opendocument.spreadsheet\":[\"ods\"],\"application/vnd.oasis.opendocument.spreadsheet-template\":[\"ots\"],\"application/vnd.oasis.opendocument.text\":[\"odt\"],\"application/vnd.oasis.opendocument.text-master\":[\"odm\"],\"application/vnd.oasis.opendocument.text-template\":[\"ott\"],\"application/vnd.oasis.opendocument.text-web\":[\"oth\"],\"application/vnd.olpc-sugar\":[\"xo\"],\"application/vnd.oma.dd2+xml\":[\"dd2\"],\"application/vnd.openblox.game+xml\":[\"obgx\"],\"application/vnd.openofficeorg.extension\":[\"oxt\"],\"application/vnd.openstreetmap.data+xml\":[\"osm\"],\"application/vnd.openxmlformats-officedocument.presentationml.presentation\":[\"pptx\"],\"application/vnd.openxmlformats-officedocument.presentationml.slide\":[\"sldx\"],\"application/vnd.openxmlformats-officedocument.presentationml.slideshow\":[\"ppsx\"],\"application/vnd.openxmlformats-officedocument.presentationml.template\":[\"potx\"],\"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet\":[\"xlsx\"],\"application/vnd.openxmlformats-officedocument.spreadsheetml.template\":[\"xltx\"],\"application/vnd.openxmlformats-officedocument.wordprocessingml.document\":[\"docx\"],\"application/vnd.openxmlformats-officedocument.wordprocessingml.template\":[\"dotx\"],\"application/vnd.osgeo.mapguide.package\":[\"mgp\"],\"application/vnd.osgi.dp\":[\"dp\"],\"application/vnd.osgi.subsystem\":[\"esa\"],\"application/vnd.palm\":[\"pdb\",\"pqa\",\"oprc\"],\"application/vnd.pawaafile\":[\"paw\"],\"application/vnd.pg.format\":[\"str\"],\"application/vnd.pg.osasli\":[\"ei6\"],\"application/vnd.picsel\":[\"efif\"],\"application/vnd.pmi.widget\":[\"wg\"],\"application/vnd.pocketlearn\":[\"plf\"],\"application/vnd.powerbuilder6\":[\"pbd\"],\"application/vnd.previewsystems.box\":[\"box\"],\"application/vnd.proteus.magazine\":[\"mgz\"],\"application/vnd.publishare-delta-tree\":[\"qps\"],\"application/vnd.pvi.ptid1\":[\"ptid\"],\"application/vnd.quark.quarkxpress\":[\"qxd\",\"qxt\",\"qwd\",\"qwt\",\"qxl\",\"qxb\"],\"application/vnd.rar\":[\"rar\"],\"application/vnd.realvnc.bed\":[\"bed\"],\"application/vnd.recordare.musicxml\":[\"mxl\"],\"application/vnd.recordare.musicxml+xml\":[\"musicxml\"],\"application/vnd.rig.cryptonote\":[\"cryptonote\"],\"application/vnd.rim.cod\":[\"cod\"],\"application/vnd.rn-realmedia\":[\"rm\"],\"application/vnd.rn-realmedia-vbr\":[\"rmvb\"],\"application/vnd.route66.link66+xml\":[\"link66\"],\"application/vnd.sailingtracker.track\":[\"st\"],\"application/vnd.seemail\":[\"see\"],\"application/vnd.sema\":[\"sema\"],\"application/vnd.semd\":[\"semd\"],\"application/vnd.semf\":[\"semf\"],\"application/vnd.shana.informed.formdata\":[\"ifm\"],\"application/vnd.shana.informed.formtemplate\":[\"itp\"],\"application/vnd.shana.informed.interchange\":[\"iif\"],\"application/vnd.shana.informed.package\":[\"ipk\"],\"application/vnd.simtech-mindmapper\":[\"twd\",\"twds\"],\"application/vnd.smaf\":[\"mmf\"],\"application/vnd.smart.teacher\":[\"teacher\"],\"application/vnd.software602.filler.form+xml\":[\"fo\"],\"application/vnd.solent.sdkm+xml\":[\"sdkm\",\"sdkd\"],\"application/vnd.spotfire.dxp\":[\"dxp\"],\"application/vnd.spotfire.sfs\":[\"sfs\"],\"application/vnd.stardivision.calc\":[\"sdc\"],\"application/vnd.stardivision.draw\":[\"sda\"],\"application/vnd.stardivision.impress\":[\"sdd\"],\"application/vnd.stardivision.math\":[\"smf\"],\"application/vnd.stardivision.writer\":[\"sdw\",\"vor\"],\"application/vnd.stardivision.writer-global\":[\"sgl\"],\"application/vnd.stepmania.package\":[\"smzip\"],\"application/vnd.stepmania.stepchart\":[\"sm\"],\"application/vnd.sun.wadl+xml\":[\"wadl\"],\"application/vnd.sun.xml.calc\":[\"sxc\"],\"application/vnd.sun.xml.calc.template\":[\"stc\"],\"application/vnd.sun.xml.draw\":[\"sxd\"],\"application/vnd.sun.xml.draw.template\":[\"std\"],\"application/vnd.sun.xml.impress\":[\"sxi\"],\"application/vnd.sun.xml.impress.template\":[\"sti\"],\"application/vnd.sun.xml.math\":[\"sxm\"],\"application/vnd.sun.xml.writer\":[\"sxw\"],\"application/vnd.sun.xml.writer.global\":[\"sxg\"],\"application/vnd.sun.xml.writer.template\":[\"stw\"],\"application/vnd.sus-calendar\":[\"sus\",\"susp\"],\"application/vnd.svd\":[\"svd\"],\"application/vnd.symbian.install\":[\"sis\",\"sisx\"],\"application/vnd.syncml+xml\":[\"xsm\"],\"application/vnd.syncml.dm+wbxml\":[\"bdm\"],\"application/vnd.syncml.dm+xml\":[\"xdm\"],\"application/vnd.syncml.dmddf+xml\":[\"ddf\"],\"application/vnd.tao.intent-module-archive\":[\"tao\"],\"application/vnd.tcpdump.pcap\":[\"pcap\",\"cap\",\"dmp\"],\"application/vnd.tmobile-livetv\":[\"tmo\"],\"application/vnd.trid.tpt\":[\"tpt\"],\"application/vnd.triscape.mxs\":[\"mxs\"],\"application/vnd.trueapp\":[\"tra\"],\"application/vnd.ufdl\":[\"ufd\",\"ufdl\"],\"application/vnd.uiq.theme\":[\"utz\"],\"application/vnd.umajin\":[\"umj\"],\"application/vnd.unity\":[\"unityweb\"],\"application/vnd.uoml+xml\":[\"uoml\"],\"application/vnd.vcx\":[\"vcx\"],\"application/vnd.visio\":[\"vsd\",\"vst\",\"vss\",\"vsw\"],\"application/vnd.visionary\":[\"vis\"],\"application/vnd.vsf\":[\"vsf\"],\"application/vnd.wap.wbxml\":[\"wbxml\"],\"application/vnd.wap.wmlc\":[\"wmlc\"],\"application/vnd.wap.wmlscriptc\":[\"wmlsc\"],\"application/vnd.webturbo\":[\"wtb\"],\"application/vnd.wolfram.player\":[\"nbp\"],\"application/vnd.wordperfect\":[\"wpd\"],\"application/vnd.wqd\":[\"wqd\"],\"application/vnd.wt.stf\":[\"stf\"],\"application/vnd.xara\":[\"xar\"],\"application/vnd.xfdl\":[\"xfdl\"],\"application/vnd.yamaha.hv-dic\":[\"hvd\"],\"application/vnd.yamaha.hv-script\":[\"hvs\"],\"application/vnd.yamaha.hv-voice\":[\"hvp\"],\"application/vnd.yamaha.openscoreformat\":[\"osf\"],\"application/vnd.yamaha.openscoreformat.osfpvg+xml\":[\"osfpvg\"],\"application/vnd.yamaha.smaf-audio\":[\"saf\"],\"application/vnd.yamaha.smaf-phrase\":[\"spf\"],\"application/vnd.yellowriver-custom-menu\":[\"cmp\"],\"application/vnd.zul\":[\"zir\",\"zirz\"],\"application/vnd.zzazz.deck+xml\":[\"zaz\"],\"application/x-7z-compressed\":[\"7z\"],\"application/x-abiword\":[\"abw\"],\"application/x-ace-compressed\":[\"ace\"],\"application/x-apple-diskimage\":[\"*dmg\"],\"application/x-arj\":[\"arj\"],\"application/x-authorware-bin\":[\"aab\",\"x32\",\"u32\",\"vox\"],\"application/x-authorware-map\":[\"aam\"],\"application/x-authorware-seg\":[\"aas\"],\"application/x-bcpio\":[\"bcpio\"],\"application/x-bdoc\":[\"*bdoc\"],\"application/x-bittorrent\":[\"torrent\"],\"application/x-blorb\":[\"blb\",\"blorb\"],\"application/x-bzip\":[\"bz\"],\"application/x-bzip2\":[\"bz2\",\"boz\"],\"application/x-cbr\":[\"cbr\",\"cba\",\"cbt\",\"cbz\",\"cb7\"],\"application/x-cdlink\":[\"vcd\"],\"application/x-cfs-compressed\":[\"cfs\"],\"application/x-chat\":[\"chat\"],\"application/x-chess-pgn\":[\"pgn\"],\"application/x-chrome-extension\":[\"crx\"],\"application/x-cocoa\":[\"cco\"],\"application/x-conference\":[\"nsc\"],\"application/x-cpio\":[\"cpio\"],\"application/x-csh\":[\"csh\"],\"application/x-debian-package\":[\"*deb\",\"udeb\"],\"application/x-dgc-compressed\":[\"dgc\"],\"application/x-director\":[\"dir\",\"dcr\",\"dxr\",\"cst\",\"cct\",\"cxt\",\"w3d\",\"fgd\",\"swa\"],\"application/x-doom\":[\"wad\"],\"application/x-dtbncx+xml\":[\"ncx\"],\"application/x-dtbook+xml\":[\"dtb\"],\"application/x-dtbresource+xml\":[\"res\"],\"application/x-dvi\":[\"dvi\"],\"application/x-envoy\":[\"evy\"],\"application/x-eva\":[\"eva\"],\"application/x-font-bdf\":[\"bdf\"],\"application/x-font-ghostscript\":[\"gsf\"],\"application/x-font-linux-psf\":[\"psf\"],\"application/x-font-pcf\":[\"pcf\"],\"application/x-font-snf\":[\"snf\"],\"application/x-font-type1\":[\"pfa\",\"pfb\",\"pfm\",\"afm\"],\"application/x-freearc\":[\"arc\"],\"application/x-futuresplash\":[\"spl\"],\"application/x-gca-compressed\":[\"gca\"],\"application/x-glulx\":[\"ulx\"],\"application/x-gnumeric\":[\"gnumeric\"],\"application/x-gramps-xml\":[\"gramps\"],\"application/x-gtar\":[\"gtar\"],\"application/x-hdf\":[\"hdf\"],\"application/x-httpd-php\":[\"php\"],\"application/x-install-instructions\":[\"install\"],\"application/x-iso9660-image\":[\"*iso\"],\"application/x-java-archive-diff\":[\"jardiff\"],\"application/x-java-jnlp-file\":[\"jnlp\"],\"application/x-keepass2\":[\"kdbx\"],\"application/x-latex\":[\"latex\"],\"application/x-lua-bytecode\":[\"luac\"],\"application/x-lzh-compressed\":[\"lzh\",\"lha\"],\"application/x-makeself\":[\"run\"],\"application/x-mie\":[\"mie\"],\"application/x-mobipocket-ebook\":[\"prc\",\"mobi\"],\"application/x-ms-application\":[\"application\"],\"application/x-ms-shortcut\":[\"lnk\"],\"application/x-ms-wmd\":[\"wmd\"],\"application/x-ms-wmz\":[\"wmz\"],\"application/x-ms-xbap\":[\"xbap\"],\"application/x-msaccess\":[\"mdb\"],\"application/x-msbinder\":[\"obd\"],\"application/x-mscardfile\":[\"crd\"],\"application/x-msclip\":[\"clp\"],\"application/x-msdos-program\":[\"*exe\"],\"application/x-msdownload\":[\"*exe\",\"*dll\",\"com\",\"bat\",\"*msi\"],\"application/x-msmediaview\":[\"mvb\",\"m13\",\"m14\"],\"application/x-msmetafile\":[\"*wmf\",\"*wmz\",\"*emf\",\"emz\"],\"application/x-msmoney\":[\"mny\"],\"application/x-mspublisher\":[\"pub\"],\"application/x-msschedule\":[\"scd\"],\"application/x-msterminal\":[\"trm\"],\"application/x-mswrite\":[\"wri\"],\"application/x-netcdf\":[\"nc\",\"cdf\"],\"application/x-ns-proxy-autoconfig\":[\"pac\"],\"application/x-nzb\":[\"nzb\"],\"application/x-perl\":[\"pl\",\"pm\"],\"application/x-pilot\":[\"*prc\",\"*pdb\"],\"application/x-pkcs12\":[\"p12\",\"pfx\"],\"application/x-pkcs7-certificates\":[\"p7b\",\"spc\"],\"application/x-pkcs7-certreqresp\":[\"p7r\"],\"application/x-rar-compressed\":[\"*rar\"],\"application/x-redhat-package-manager\":[\"rpm\"],\"application/x-research-info-systems\":[\"ris\"],\"application/x-sea\":[\"sea\"],\"application/x-sh\":[\"sh\"],\"application/x-shar\":[\"shar\"],\"application/x-shockwave-flash\":[\"swf\"],\"application/x-silverlight-app\":[\"xap\"],\"application/x-sql\":[\"sql\"],\"application/x-stuffit\":[\"sit\"],\"application/x-stuffitx\":[\"sitx\"],\"application/x-subrip\":[\"srt\"],\"application/x-sv4cpio\":[\"sv4cpio\"],\"application/x-sv4crc\":[\"sv4crc\"],\"application/x-t3vm-image\":[\"t3\"],\"application/x-tads\":[\"gam\"],\"application/x-tar\":[\"tar\"],\"application/x-tcl\":[\"tcl\",\"tk\"],\"application/x-tex\":[\"tex\"],\"application/x-tex-tfm\":[\"tfm\"],\"application/x-texinfo\":[\"texinfo\",\"texi\"],\"application/x-tgif\":[\"*obj\"],\"application/x-ustar\":[\"ustar\"],\"application/x-virtualbox-hdd\":[\"hdd\"],\"application/x-virtualbox-ova\":[\"ova\"],\"application/x-virtualbox-ovf\":[\"ovf\"],\"application/x-virtualbox-vbox\":[\"vbox\"],\"application/x-virtualbox-vbox-extpack\":[\"vbox-extpack\"],\"application/x-virtualbox-vdi\":[\"vdi\"],\"application/x-virtualbox-vhd\":[\"vhd\"],\"application/x-virtualbox-vmdk\":[\"vmdk\"],\"application/x-wais-source\":[\"src\"],\"application/x-web-app-manifest+json\":[\"webapp\"],\"application/x-x509-ca-cert\":[\"der\",\"crt\",\"pem\"],\"application/x-xfig\":[\"fig\"],\"application/x-xliff+xml\":[\"*xlf\"],\"application/x-xpinstall\":[\"xpi\"],\"application/x-xz\":[\"xz\"],\"application/x-zmachine\":[\"z1\",\"z2\",\"z3\",\"z4\",\"z5\",\"z6\",\"z7\",\"z8\"],\"audio/vnd.dece.audio\":[\"uva\",\"uvva\"],\"audio/vnd.digital-winds\":[\"eol\"],\"audio/vnd.dra\":[\"dra\"],\"audio/vnd.dts\":[\"dts\"],\"audio/vnd.dts.hd\":[\"dtshd\"],\"audio/vnd.lucent.voice\":[\"lvp\"],\"audio/vnd.ms-playready.media.pya\":[\"pya\"],\"audio/vnd.nuera.ecelp4800\":[\"ecelp4800\"],\"audio/vnd.nuera.ecelp7470\":[\"ecelp7470\"],\"audio/vnd.nuera.ecelp9600\":[\"ecelp9600\"],\"audio/vnd.rip\":[\"rip\"],\"audio/x-aac\":[\"aac\"],\"audio/x-aiff\":[\"aif\",\"aiff\",\"aifc\"],\"audio/x-caf\":[\"caf\"],\"audio/x-flac\":[\"flac\"],\"audio/x-m4a\":[\"*m4a\"],\"audio/x-matroska\":[\"mka\"],\"audio/x-mpegurl\":[\"m3u\"],\"audio/x-ms-wax\":[\"wax\"],\"audio/x-ms-wma\":[\"wma\"],\"audio/x-pn-realaudio\":[\"ram\",\"ra\"],\"audio/x-pn-realaudio-plugin\":[\"rmp\"],\"audio/x-realaudio\":[\"*ra\"],\"audio/x-wav\":[\"*wav\"],\"chemical/x-cdx\":[\"cdx\"],\"chemical/x-cif\":[\"cif\"],\"chemical/x-cmdf\":[\"cmdf\"],\"chemical/x-cml\":[\"cml\"],\"chemical/x-csml\":[\"csml\"],\"chemical/x-xyz\":[\"xyz\"],\"image/prs.btif\":[\"btif\"],\"image/prs.pti\":[\"pti\"],\"image/vnd.adobe.photoshop\":[\"psd\"],\"image/vnd.airzip.accelerator.azv\":[\"azv\"],\"image/vnd.dece.graphic\":[\"uvi\",\"uvvi\",\"uvg\",\"uvvg\"],\"image/vnd.djvu\":[\"djvu\",\"djv\"],\"image/vnd.dvb.subtitle\":[\"*sub\"],\"image/vnd.dwg\":[\"dwg\"],\"image/vnd.dxf\":[\"dxf\"],\"image/vnd.fastbidsheet\":[\"fbs\"],\"image/vnd.fpx\":[\"fpx\"],\"image/vnd.fst\":[\"fst\"],\"image/vnd.fujixerox.edmics-mmr\":[\"mmr\"],\"image/vnd.fujixerox.edmics-rlc\":[\"rlc\"],\"image/vnd.microsoft.icon\":[\"ico\"],\"image/vnd.ms-dds\":[\"dds\"],\"image/vnd.ms-modi\":[\"mdi\"],\"image/vnd.ms-photo\":[\"wdp\"],\"image/vnd.net-fpx\":[\"npx\"],\"image/vnd.pco.b16\":[\"b16\"],\"image/vnd.tencent.tap\":[\"tap\"],\"image/vnd.valve.source.texture\":[\"vtf\"],\"image/vnd.wap.wbmp\":[\"wbmp\"],\"image/vnd.xiff\":[\"xif\"],\"image/vnd.zbrush.pcx\":[\"pcx\"],\"image/x-3ds\":[\"3ds\"],\"image/x-cmu-raster\":[\"ras\"],\"image/x-cmx\":[\"cmx\"],\"image/x-freehand\":[\"fh\",\"fhc\",\"fh4\",\"fh5\",\"fh7\"],\"image/x-icon\":[\"*ico\"],\"image/x-jng\":[\"jng\"],\"image/x-mrsid-image\":[\"sid\"],\"image/x-ms-bmp\":[\"*bmp\"],\"image/x-pcx\":[\"*pcx\"],\"image/x-pict\":[\"pic\",\"pct\"],\"image/x-portable-anymap\":[\"pnm\"],\"image/x-portable-bitmap\":[\"pbm\"],\"image/x-portable-graymap\":[\"pgm\"],\"image/x-portable-pixmap\":[\"ppm\"],\"image/x-rgb\":[\"rgb\"],\"image/x-tga\":[\"tga\"],\"image/x-xbitmap\":[\"xbm\"],\"image/x-xpixmap\":[\"xpm\"],\"image/x-xwindowdump\":[\"xwd\"],\"message/vnd.wfa.wsc\":[\"wsc\"],\"model/vnd.collada+xml\":[\"dae\"],\"model/vnd.dwf\":[\"dwf\"],\"model/vnd.gdl\":[\"gdl\"],\"model/vnd.gtw\":[\"gtw\"],\"model/vnd.mts\":[\"mts\"],\"model/vnd.opengex\":[\"ogex\"],\"model/vnd.parasolid.transmit.binary\":[\"x_b\"],\"model/vnd.parasolid.transmit.text\":[\"x_t\"],\"model/vnd.usdz+zip\":[\"usdz\"],\"model/vnd.valve.source.compiled-map\":[\"bsp\"],\"model/vnd.vtu\":[\"vtu\"],\"text/prs.lines.tag\":[\"dsc\"],\"text/vnd.curl\":[\"curl\"],\"text/vnd.curl.dcurl\":[\"dcurl\"],\"text/vnd.curl.mcurl\":[\"mcurl\"],\"text/vnd.curl.scurl\":[\"scurl\"],\"text/vnd.dvb.subtitle\":[\"sub\"],\"text/vnd.fly\":[\"fly\"],\"text/vnd.fmi.flexstor\":[\"flx\"],\"text/vnd.graphviz\":[\"gv\"],\"text/vnd.in3d.3dml\":[\"3dml\"],\"text/vnd.in3d.spot\":[\"spot\"],\"text/vnd.sun.j2me.app-descriptor\":[\"jad\"],\"text/vnd.wap.wml\":[\"wml\"],\"text/vnd.wap.wmlscript\":[\"wmls\"],\"text/x-asm\":[\"s\",\"asm\"],\"text/x-c\":[\"c\",\"cc\",\"cxx\",\"cpp\",\"h\",\"hh\",\"dic\"],\"text/x-component\":[\"htc\"],\"text/x-fortran\":[\"f\",\"for\",\"f77\",\"f90\"],\"text/x-handlebars-template\":[\"hbs\"],\"text/x-java-source\":[\"java\"],\"text/x-lua\":[\"lua\"],\"text/x-markdown\":[\"mkd\"],\"text/x-nfo\":[\"nfo\"],\"text/x-opml\":[\"opml\"],\"text/x-org\":[\"*org\"],\"text/x-pascal\":[\"p\",\"pas\"],\"text/x-processing\":[\"pde\"],\"text/x-sass\":[\"sass\"],\"text/x-scss\":[\"scss\"],\"text/x-setext\":[\"etx\"],\"text/x-sfv\":[\"sfv\"],\"text/x-suse-ymp\":[\"ymp\"],\"text/x-uuencode\":[\"uu\"],\"text/x-vcalendar\":[\"vcs\"],\"text/x-vcard\":[\"vcf\"],\"video/vnd.dece.hd\":[\"uvh\",\"uvvh\"],\"video/vnd.dece.mobile\":[\"uvm\",\"uvvm\"],\"video/vnd.dece.pd\":[\"uvp\",\"uvvp\"],\"video/vnd.dece.sd\":[\"uvs\",\"uvvs\"],\"video/vnd.dece.video\":[\"uvv\",\"uvvv\"],\"video/vnd.dvb.file\":[\"dvb\"],\"video/vnd.fvt\":[\"fvt\"],\"video/vnd.mpegurl\":[\"mxu\",\"m4u\"],\"video/vnd.ms-playready.media.pyv\":[\"pyv\"],\"video/vnd.uvvu.mp4\":[\"uvu\",\"uvvu\"],\"video/vnd.vivo\":[\"viv\"],\"video/x-f4v\":[\"f4v\"],\"video/x-fli\":[\"fli\"],\"video/x-flv\":[\"flv\"],\"video/x-m4v\":[\"m4v\"],\"video/x-matroska\":[\"mkv\",\"mk3d\",\"mks\"],\"video/x-mng\":[\"mng\"],\"video/x-ms-asf\":[\"asf\",\"asx\"],\"video/x-ms-vob\":[\"vob\"],\"video/x-ms-wm\":[\"wm\"],\"video/x-ms-wmv\":[\"wmv\"],\"video/x-ms-wmx\":[\"wmx\"],\"video/x-ms-wvx\":[\"wvx\"],\"video/x-msvideo\":[\"avi\"],\"video/x-sgi-movie\":[\"movie\"],\"video/x-smv\":[\"smv\"],\"x-conference/x-cooltalk\":[\"ice\"]};","module.exports = {\"application/andrew-inset\":[\"ez\"],\"application/applixware\":[\"aw\"],\"application/atom+xml\":[\"atom\"],\"application/atomcat+xml\":[\"atomcat\"],\"application/atomdeleted+xml\":[\"atomdeleted\"],\"application/atomsvc+xml\":[\"atomsvc\"],\"application/atsc-dwd+xml\":[\"dwd\"],\"application/atsc-held+xml\":[\"held\"],\"application/atsc-rsat+xml\":[\"rsat\"],\"application/bdoc\":[\"bdoc\"],\"application/calendar+xml\":[\"xcs\"],\"application/ccxml+xml\":[\"ccxml\"],\"application/cdfx+xml\":[\"cdfx\"],\"application/cdmi-capability\":[\"cdmia\"],\"application/cdmi-container\":[\"cdmic\"],\"application/cdmi-domain\":[\"cdmid\"],\"application/cdmi-object\":[\"cdmio\"],\"application/cdmi-queue\":[\"cdmiq\"],\"application/cu-seeme\":[\"cu\"],\"application/dash+xml\":[\"mpd\"],\"application/davmount+xml\":[\"davmount\"],\"application/docbook+xml\":[\"dbk\"],\"application/dssc+der\":[\"dssc\"],\"application/dssc+xml\":[\"xdssc\"],\"application/ecmascript\":[\"ecma\",\"es\"],\"application/emma+xml\":[\"emma\"],\"application/emotionml+xml\":[\"emotionml\"],\"application/epub+zip\":[\"epub\"],\"application/exi\":[\"exi\"],\"application/fdt+xml\":[\"fdt\"],\"application/font-tdpfr\":[\"pfr\"],\"application/geo+json\":[\"geojson\"],\"application/gml+xml\":[\"gml\"],\"application/gpx+xml\":[\"gpx\"],\"application/gxf\":[\"gxf\"],\"application/gzip\":[\"gz\"],\"application/hjson\":[\"hjson\"],\"application/hyperstudio\":[\"stk\"],\"application/inkml+xml\":[\"ink\",\"inkml\"],\"application/ipfix\":[\"ipfix\"],\"application/its+xml\":[\"its\"],\"application/java-archive\":[\"jar\",\"war\",\"ear\"],\"application/java-serialized-object\":[\"ser\"],\"application/java-vm\":[\"class\"],\"application/javascript\":[\"js\",\"mjs\"],\"application/json\":[\"json\",\"map\"],\"application/json5\":[\"json5\"],\"application/jsonml+json\":[\"jsonml\"],\"application/ld+json\":[\"jsonld\"],\"application/lgr+xml\":[\"lgr\"],\"application/lost+xml\":[\"lostxml\"],\"application/mac-binhex40\":[\"hqx\"],\"application/mac-compactpro\":[\"cpt\"],\"application/mads+xml\":[\"mads\"],\"application/manifest+json\":[\"webmanifest\"],\"application/marc\":[\"mrc\"],\"application/marcxml+xml\":[\"mrcx\"],\"application/mathematica\":[\"ma\",\"nb\",\"mb\"],\"application/mathml+xml\":[\"mathml\"],\"application/mbox\":[\"mbox\"],\"application/mediaservercontrol+xml\":[\"mscml\"],\"application/metalink+xml\":[\"metalink\"],\"application/metalink4+xml\":[\"meta4\"],\"application/mets+xml\":[\"mets\"],\"application/mmt-aei+xml\":[\"maei\"],\"application/mmt-usd+xml\":[\"musd\"],\"application/mods+xml\":[\"mods\"],\"application/mp21\":[\"m21\",\"mp21\"],\"application/mp4\":[\"mp4s\",\"m4p\"],\"application/mrb-consumer+xml\":[\"*xdf\"],\"application/mrb-publish+xml\":[\"*xdf\"],\"application/msword\":[\"doc\",\"dot\"],\"application/mxf\":[\"mxf\"],\"application/n-quads\":[\"nq\"],\"application/n-triples\":[\"nt\"],\"application/node\":[\"cjs\"],\"application/octet-stream\":[\"bin\",\"dms\",\"lrf\",\"mar\",\"so\",\"dist\",\"distz\",\"pkg\",\"bpk\",\"dump\",\"elc\",\"deploy\",\"exe\",\"dll\",\"deb\",\"dmg\",\"iso\",\"img\",\"msi\",\"msp\",\"msm\",\"buffer\"],\"application/oda\":[\"oda\"],\"application/oebps-package+xml\":[\"opf\"],\"application/ogg\":[\"ogx\"],\"application/omdoc+xml\":[\"omdoc\"],\"application/onenote\":[\"onetoc\",\"onetoc2\",\"onetmp\",\"onepkg\"],\"application/oxps\":[\"oxps\"],\"application/p2p-overlay+xml\":[\"relo\"],\"application/patch-ops-error+xml\":[\"*xer\"],\"application/pdf\":[\"pdf\"],\"application/pgp-encrypted\":[\"pgp\"],\"application/pgp-signature\":[\"asc\",\"sig\"],\"application/pics-rules\":[\"prf\"],\"application/pkcs10\":[\"p10\"],\"application/pkcs7-mime\":[\"p7m\",\"p7c\"],\"application/pkcs7-signature\":[\"p7s\"],\"application/pkcs8\":[\"p8\"],\"application/pkix-attr-cert\":[\"ac\"],\"application/pkix-cert\":[\"cer\"],\"application/pkix-crl\":[\"crl\"],\"application/pkix-pkipath\":[\"pkipath\"],\"application/pkixcmp\":[\"pki\"],\"application/pls+xml\":[\"pls\"],\"application/postscript\":[\"ai\",\"eps\",\"ps\"],\"application/provenance+xml\":[\"provx\"],\"application/pskc+xml\":[\"pskcxml\"],\"application/raml+yaml\":[\"raml\"],\"application/rdf+xml\":[\"rdf\",\"owl\"],\"application/reginfo+xml\":[\"rif\"],\"application/relax-ng-compact-syntax\":[\"rnc\"],\"application/resource-lists+xml\":[\"rl\"],\"application/resource-lists-diff+xml\":[\"rld\"],\"application/rls-services+xml\":[\"rs\"],\"application/route-apd+xml\":[\"rapd\"],\"application/route-s-tsid+xml\":[\"sls\"],\"application/route-usd+xml\":[\"rusd\"],\"application/rpki-ghostbusters\":[\"gbr\"],\"application/rpki-manifest\":[\"mft\"],\"application/rpki-roa\":[\"roa\"],\"application/rsd+xml\":[\"rsd\"],\"application/rss+xml\":[\"rss\"],\"application/rtf\":[\"rtf\"],\"application/sbml+xml\":[\"sbml\"],\"application/scvp-cv-request\":[\"scq\"],\"application/scvp-cv-response\":[\"scs\"],\"application/scvp-vp-request\":[\"spq\"],\"application/scvp-vp-response\":[\"spp\"],\"application/sdp\":[\"sdp\"],\"application/senml+xml\":[\"senmlx\"],\"application/sensml+xml\":[\"sensmlx\"],\"application/set-payment-initiation\":[\"setpay\"],\"application/set-registration-initiation\":[\"setreg\"],\"application/shf+xml\":[\"shf\"],\"application/sieve\":[\"siv\",\"sieve\"],\"application/smil+xml\":[\"smi\",\"smil\"],\"application/sparql-query\":[\"rq\"],\"application/sparql-results+xml\":[\"srx\"],\"application/srgs\":[\"gram\"],\"application/srgs+xml\":[\"grxml\"],\"application/sru+xml\":[\"sru\"],\"application/ssdl+xml\":[\"ssdl\"],\"application/ssml+xml\":[\"ssml\"],\"application/swid+xml\":[\"swidtag\"],\"application/tei+xml\":[\"tei\",\"teicorpus\"],\"application/thraud+xml\":[\"tfi\"],\"application/timestamped-data\":[\"tsd\"],\"application/toml\":[\"toml\"],\"application/ttml+xml\":[\"ttml\"],\"application/ubjson\":[\"ubj\"],\"application/urc-ressheet+xml\":[\"rsheet\"],\"application/urc-targetdesc+xml\":[\"td\"],\"application/voicexml+xml\":[\"vxml\"],\"application/wasm\":[\"wasm\"],\"application/widget\":[\"wgt\"],\"application/winhlp\":[\"hlp\"],\"application/wsdl+xml\":[\"wsdl\"],\"application/wspolicy+xml\":[\"wspolicy\"],\"application/xaml+xml\":[\"xaml\"],\"application/xcap-att+xml\":[\"xav\"],\"application/xcap-caps+xml\":[\"xca\"],\"application/xcap-diff+xml\":[\"xdf\"],\"application/xcap-el+xml\":[\"xel\"],\"application/xcap-error+xml\":[\"xer\"],\"application/xcap-ns+xml\":[\"xns\"],\"application/xenc+xml\":[\"xenc\"],\"application/xhtml+xml\":[\"xhtml\",\"xht\"],\"application/xliff+xml\":[\"xlf\"],\"application/xml\":[\"xml\",\"xsl\",\"xsd\",\"rng\"],\"application/xml-dtd\":[\"dtd\"],\"application/xop+xml\":[\"xop\"],\"application/xproc+xml\":[\"xpl\"],\"application/xslt+xml\":[\"*xsl\",\"xslt\"],\"application/xspf+xml\":[\"xspf\"],\"application/xv+xml\":[\"mxml\",\"xhvml\",\"xvml\",\"xvm\"],\"application/yang\":[\"yang\"],\"application/yin+xml\":[\"yin\"],\"application/zip\":[\"zip\"],\"audio/3gpp\":[\"*3gpp\"],\"audio/adpcm\":[\"adp\"],\"audio/amr\":[\"amr\"],\"audio/basic\":[\"au\",\"snd\"],\"audio/midi\":[\"mid\",\"midi\",\"kar\",\"rmi\"],\"audio/mobile-xmf\":[\"mxmf\"],\"audio/mp3\":[\"*mp3\"],\"audio/mp4\":[\"m4a\",\"mp4a\"],\"audio/mpeg\":[\"mpga\",\"mp2\",\"mp2a\",\"mp3\",\"m2a\",\"m3a\"],\"audio/ogg\":[\"oga\",\"ogg\",\"spx\",\"opus\"],\"audio/s3m\":[\"s3m\"],\"audio/silk\":[\"sil\"],\"audio/wav\":[\"wav\"],\"audio/wave\":[\"*wav\"],\"audio/webm\":[\"weba\"],\"audio/xm\":[\"xm\"],\"font/collection\":[\"ttc\"],\"font/otf\":[\"otf\"],\"font/ttf\":[\"ttf\"],\"font/woff\":[\"woff\"],\"font/woff2\":[\"woff2\"],\"image/aces\":[\"exr\"],\"image/apng\":[\"apng\"],\"image/avif\":[\"avif\"],\"image/bmp\":[\"bmp\"],\"image/cgm\":[\"cgm\"],\"image/dicom-rle\":[\"drle\"],\"image/emf\":[\"emf\"],\"image/fits\":[\"fits\"],\"image/g3fax\":[\"g3\"],\"image/gif\":[\"gif\"],\"image/heic\":[\"heic\"],\"image/heic-sequence\":[\"heics\"],\"image/heif\":[\"heif\"],\"image/heif-sequence\":[\"heifs\"],\"image/hej2k\":[\"hej2\"],\"image/hsj2\":[\"hsj2\"],\"image/ief\":[\"ief\"],\"image/jls\":[\"jls\"],\"image/jp2\":[\"jp2\",\"jpg2\"],\"image/jpeg\":[\"jpeg\",\"jpg\",\"jpe\"],\"image/jph\":[\"jph\"],\"image/jphc\":[\"jhc\"],\"image/jpm\":[\"jpm\"],\"image/jpx\":[\"jpx\",\"jpf\"],\"image/jxr\":[\"jxr\"],\"image/jxra\":[\"jxra\"],\"image/jxrs\":[\"jxrs\"],\"image/jxs\":[\"jxs\"],\"image/jxsc\":[\"jxsc\"],\"image/jxsi\":[\"jxsi\"],\"image/jxss\":[\"jxss\"],\"image/ktx\":[\"ktx\"],\"image/ktx2\":[\"ktx2\"],\"image/png\":[\"png\"],\"image/sgi\":[\"sgi\"],\"image/svg+xml\":[\"svg\",\"svgz\"],\"image/t38\":[\"t38\"],\"image/tiff\":[\"tif\",\"tiff\"],\"image/tiff-fx\":[\"tfx\"],\"image/webp\":[\"webp\"],\"image/wmf\":[\"wmf\"],\"message/disposition-notification\":[\"disposition-notification\"],\"message/global\":[\"u8msg\"],\"message/global-delivery-status\":[\"u8dsn\"],\"message/global-disposition-notification\":[\"u8mdn\"],\"message/global-headers\":[\"u8hdr\"],\"message/rfc822\":[\"eml\",\"mime\"],\"model/3mf\":[\"3mf\"],\"model/gltf+json\":[\"gltf\"],\"model/gltf-binary\":[\"glb\"],\"model/iges\":[\"igs\",\"iges\"],\"model/mesh\":[\"msh\",\"mesh\",\"silo\"],\"model/mtl\":[\"mtl\"],\"model/obj\":[\"obj\"],\"model/stl\":[\"stl\"],\"model/vrml\":[\"wrl\",\"vrml\"],\"model/x3d+binary\":[\"*x3db\",\"x3dbz\"],\"model/x3d+fastinfoset\":[\"x3db\"],\"model/x3d+vrml\":[\"*x3dv\",\"x3dvz\"],\"model/x3d+xml\":[\"x3d\",\"x3dz\"],\"model/x3d-vrml\":[\"x3dv\"],\"text/cache-manifest\":[\"appcache\",\"manifest\"],\"text/calendar\":[\"ics\",\"ifb\"],\"text/coffeescript\":[\"coffee\",\"litcoffee\"],\"text/css\":[\"css\"],\"text/csv\":[\"csv\"],\"text/html\":[\"html\",\"htm\",\"shtml\"],\"text/jade\":[\"jade\"],\"text/jsx\":[\"jsx\"],\"text/less\":[\"less\"],\"text/markdown\":[\"markdown\",\"md\"],\"text/mathml\":[\"mml\"],\"text/mdx\":[\"mdx\"],\"text/n3\":[\"n3\"],\"text/plain\":[\"txt\",\"text\",\"conf\",\"def\",\"list\",\"log\",\"in\",\"ini\"],\"text/richtext\":[\"rtx\"],\"text/rtf\":[\"*rtf\"],\"text/sgml\":[\"sgml\",\"sgm\"],\"text/shex\":[\"shex\"],\"text/slim\":[\"slim\",\"slm\"],\"text/spdx\":[\"spdx\"],\"text/stylus\":[\"stylus\",\"styl\"],\"text/tab-separated-values\":[\"tsv\"],\"text/troff\":[\"t\",\"tr\",\"roff\",\"man\",\"me\",\"ms\"],\"text/turtle\":[\"ttl\"],\"text/uri-list\":[\"uri\",\"uris\",\"urls\"],\"text/vcard\":[\"vcard\"],\"text/vtt\":[\"vtt\"],\"text/xml\":[\"*xml\"],\"text/yaml\":[\"yaml\",\"yml\"],\"video/3gpp\":[\"3gp\",\"3gpp\"],\"video/3gpp2\":[\"3g2\"],\"video/h261\":[\"h261\"],\"video/h263\":[\"h263\"],\"video/h264\":[\"h264\"],\"video/iso.segment\":[\"m4s\"],\"video/jpeg\":[\"jpgv\"],\"video/jpm\":[\"*jpm\",\"jpgm\"],\"video/mj2\":[\"mj2\",\"mjp2\"],\"video/mp2t\":[\"ts\"],\"video/mp4\":[\"mp4\",\"mp4v\",\"mpg4\"],\"video/mpeg\":[\"mpeg\",\"mpg\",\"mpe\",\"m1v\",\"m2v\"],\"video/ogg\":[\"ogv\"],\"video/quicktime\":[\"qt\",\"mov\"],\"video/webm\":[\"webm\"]};","module.exports = assert;\n\nfunction assert(val, msg) {\n if (!val)\n throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n if (l != r)\n throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));\n};\n","'use strict';\n\nvar utils = exports;\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg !== 'string') {\n for (var i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n return res;\n }\n if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (var i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\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)\n res.push(hi, lo);\n else\n res.push(lo);\n }\n }\n return res;\n}\nutils.toArray = toArray;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nutils.zero2 = zero2;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nutils.toHex = toHex;\n\nutils.encode = function encode(arr, enc) {\n if (enc === 'hex')\n return toHex(arr);\n else\n return arr;\n};\n","// This is an intentionally recursive require. I don't like it either.\nvar Box = require('./index')\nvar Descriptor = require('./descriptor')\nvar uint64be = require('uint64be')\n\nvar TIME_OFFSET = 2082844800000\n\n/*\nTODO:\ntest these\nadd new box versions\n*/\n\n// These have 'version' and 'flags' fields in the headers\nexports.fullBoxes = {}\nvar fullBoxes = [\n 'mvhd',\n 'tkhd',\n 'mdhd',\n 'vmhd',\n 'smhd',\n 'stsd',\n 'esds',\n 'stsz',\n 'stco',\n 'co64',\n 'stss',\n 'stts',\n 'ctts',\n 'stsc',\n 'dref',\n 'elst',\n 'hdlr',\n 'mehd',\n 'trex',\n 'mfhd',\n 'tfhd',\n 'tfdt',\n 'trun'\n]\nfullBoxes.forEach(function (type) {\n exports.fullBoxes[type] = true\n})\n\nexports.ftyp = {}\nexports.ftyp.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.ftyp.encodingLength(box))\n var brands = box.compatibleBrands || []\n buf.write(box.brand, 0, 4, 'ascii')\n buf.writeUInt32BE(box.brandVersion, 4)\n for (var i = 0; i < brands.length; i++) buf.write(brands[i], 8 + (i * 4), 4, 'ascii')\n exports.ftyp.encode.bytes = 8 + brands.length * 4\n return buf\n}\nexports.ftyp.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var brand = buf.toString('ascii', 0, 4)\n var version = buf.readUInt32BE(4)\n var compatibleBrands = []\n for (var i = 8; i < buf.length; i += 4) compatibleBrands.push(buf.toString('ascii', i, i + 4))\n return {\n brand: brand,\n brandVersion: version,\n compatibleBrands: compatibleBrands\n }\n}\nexports.ftyp.encodingLength = function (box) {\n return 8 + (box.compatibleBrands || []).length * 4\n}\n\nexports.mvhd = {}\nexports.mvhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(96)\n writeDate(box.ctime || new Date(), buf, 0)\n writeDate(box.mtime || new Date(), buf, 4)\n buf.writeUInt32BE(box.timeScale || 0, 8)\n buf.writeUInt32BE(box.duration || 0, 12)\n writeFixed32(box.preferredRate || 0, buf, 16)\n writeFixed16(box.preferredVolume || 0, buf, 20)\n writeReserved(buf, 22, 32)\n writeMatrix(box.matrix, buf, 32)\n buf.writeUInt32BE(box.previewTime || 0, 68)\n buf.writeUInt32BE(box.previewDuration || 0, 72)\n buf.writeUInt32BE(box.posterTime || 0, 76)\n buf.writeUInt32BE(box.selectionTime || 0, 80)\n buf.writeUInt32BE(box.selectionDuration || 0, 84)\n buf.writeUInt32BE(box.currentTime || 0, 88)\n buf.writeUInt32BE(box.nextTrackId || 0, 92)\n exports.mvhd.encode.bytes = 96\n return buf\n}\nexports.mvhd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n ctime: readDate(buf, 0),\n mtime: readDate(buf, 4),\n timeScale: buf.readUInt32BE(8),\n duration: buf.readUInt32BE(12),\n preferredRate: readFixed32(buf, 16),\n preferredVolume: readFixed16(buf, 20),\n matrix: readMatrix(buf.slice(32, 68)),\n previewTime: buf.readUInt32BE(68),\n previewDuration: buf.readUInt32BE(72),\n posterTime: buf.readUInt32BE(76),\n selectionTime: buf.readUInt32BE(80),\n selectionDuration: buf.readUInt32BE(84),\n currentTime: buf.readUInt32BE(88),\n nextTrackId: buf.readUInt32BE(92)\n }\n}\nexports.mvhd.encodingLength = function (box) {\n return 96\n}\n\nexports.tkhd = {}\nexports.tkhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(80)\n writeDate(box.ctime || new Date(), buf, 0)\n writeDate(box.mtime || new Date(), buf, 4)\n buf.writeUInt32BE(box.trackId || 0, 8)\n writeReserved(buf, 12, 16)\n buf.writeUInt32BE(box.duration || 0, 16)\n writeReserved(buf, 20, 28)\n buf.writeUInt16BE(box.layer || 0, 28)\n buf.writeUInt16BE(box.alternateGroup || 0, 30)\n buf.writeUInt16BE(box.volume || 0, 32)\n writeMatrix(box.matrix, buf, 36)\n buf.writeUInt32BE(box.trackWidth || 0, 72)\n buf.writeUInt32BE(box.trackHeight || 0, 76)\n exports.tkhd.encode.bytes = 80\n return buf\n}\nexports.tkhd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n ctime: readDate(buf, 0),\n mtime: readDate(buf, 4),\n trackId: buf.readUInt32BE(8),\n duration: buf.readUInt32BE(16),\n layer: buf.readUInt16BE(28),\n alternateGroup: buf.readUInt16BE(30),\n volume: buf.readUInt16BE(32),\n matrix: readMatrix(buf.slice(36, 72)),\n trackWidth: buf.readUInt32BE(72),\n trackHeight: buf.readUInt32BE(76)\n }\n}\nexports.tkhd.encodingLength = function (box) {\n return 80\n}\n\nexports.mdhd = {}\nexports.mdhd.encode = function (box, buf, offset) {\n if (box.version === 1) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(32)\n writeDate64(box.ctime || new Date(), buf, 0)\n writeDate64(box.mtime || new Date(), buf, 8)\n buf.writeUInt32BE(box.timeScale || 0, 16)\n // Node only supports integer <= 48bit. Waiting for BigInt!\n buf.writeUIntBE(box.duration || 0, 20, 6)\n buf.writeUInt16BE(box.language || 0, 28)\n buf.writeUInt16BE(box.quality || 0, 30)\n exports.mdhd.encode.bytes = 32\n return buf\n }\n\n buf = buf ? buf.slice(offset) : Buffer.alloc(20)\n writeDate(box.ctime || new Date(), buf, 0)\n writeDate(box.mtime || new Date(), buf, 4)\n buf.writeUInt32BE(box.timeScale || 0, 8)\n buf.writeUInt32BE(box.duration || 0, 12)\n buf.writeUInt16BE(box.language || 0, 16)\n buf.writeUInt16BE(box.quality || 0, 18)\n exports.mdhd.encode.bytes = 20\n return buf\n}\n\nexports.mdhd.decode = function (buf, offset, end) {\n buf = buf.slice(offset)\n\n var version1 = (end - offset) !== 20\n\n // In version 1 creation time and modification time are unsigned long\n if (version1) {\n return {\n ctime: readDate64(buf, 0),\n mtime: readDate64(buf, 8),\n timeScale: buf.readUInt32BE(16),\n // Node only supports integer <= 48bit. Waiting for BigInt!\n duration: buf.readUIntBE(20, 6),\n language: buf.readUInt16BE(28),\n quality: buf.readUInt16BE(30)\n }\n }\n\n return {\n ctime: readDate(buf, 0),\n mtime: readDate(buf, 4),\n timeScale: buf.readUInt32BE(8),\n duration: buf.readUInt32BE(12),\n language: buf.readUInt16BE(16),\n quality: buf.readUInt16BE(18)\n }\n}\nexports.mdhd.encodingLength = function (box) {\n if (box.version === 1) return 32\n\n return 20\n}\n\nexports.vmhd = {}\nexports.vmhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(8)\n buf.writeUInt16BE(box.graphicsMode || 0, 0)\n var opcolor = box.opcolor || [0, 0, 0]\n buf.writeUInt16BE(opcolor[0], 2)\n buf.writeUInt16BE(opcolor[1], 4)\n buf.writeUInt16BE(opcolor[2], 6)\n exports.vmhd.encode.bytes = 8\n return buf\n}\nexports.vmhd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n graphicsMode: buf.readUInt16BE(0),\n opcolor: [buf.readUInt16BE(2), buf.readUInt16BE(4), buf.readUInt16BE(6)]\n }\n}\nexports.vmhd.encodingLength = function (box) {\n return 8\n}\n\nexports.smhd = {}\nexports.smhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n buf.writeUInt16BE(box.balance || 0, 0)\n writeReserved(buf, 2, 4)\n exports.smhd.encode.bytes = 4\n return buf\n}\nexports.smhd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n balance: buf.readUInt16BE(0)\n }\n}\nexports.smhd.encodingLength = function (box) {\n return 4\n}\n\nexports.stsd = {}\nexports.stsd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsd.encodingLength(box))\n var entries = box.entries || []\n\n buf.writeUInt32BE(entries.length, 0)\n\n var ptr = 4\n for (var i = 0; i < entries.length; i++) {\n var entry = entries[i]\n Box.encode(entry, buf, ptr)\n ptr += Box.encode.bytes\n }\n\n exports.stsd.encode.bytes = ptr\n return buf\n}\nexports.stsd.decode = function (buf, offset, end) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n var ptr = 4\n\n for (var i = 0; i < num; i++) {\n var entry = Box.decode(buf, ptr, end)\n entries[i] = entry\n ptr += entry.length\n }\n\n return {\n entries: entries\n }\n}\nexports.stsd.encodingLength = function (box) {\n var totalSize = 4\n if (!box.entries) return totalSize\n for (var i = 0; i < box.entries.length; i++) {\n totalSize += Box.encodingLength(box.entries[i])\n }\n return totalSize\n}\n\nexports.avc1 = exports.VisualSampleEntry = {}\nexports.VisualSampleEntry.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.VisualSampleEntry.encodingLength(box))\n\n writeReserved(buf, 0, 6)\n buf.writeUInt16BE(box.dataReferenceIndex || 0, 6)\n writeReserved(buf, 8, 24)\n buf.writeUInt16BE(box.width || 0, 24)\n buf.writeUInt16BE(box.height || 0, 26)\n buf.writeUInt32BE(box.hResolution || 0x480000, 28)\n buf.writeUInt32BE(box.vResolution || 0x480000, 32)\n writeReserved(buf, 36, 40)\n buf.writeUInt16BE(box.frameCount || 1, 40)\n var compressorName = box.compressorName || ''\n var nameLen = Math.min(compressorName.length, 31)\n buf.writeUInt8(nameLen, 42)\n buf.write(compressorName, 43, nameLen, 'utf8')\n buf.writeUInt16BE(box.depth || 0x18, 74)\n buf.writeInt16BE(-1, 76)\n\n var ptr = 78\n var children = box.children || []\n children.forEach(function (child) {\n Box.encode(child, buf, ptr)\n ptr += Box.encode.bytes\n })\n exports.VisualSampleEntry.encode.bytes = ptr\n}\nexports.VisualSampleEntry.decode = function (buf, offset, end) {\n buf = buf.slice(offset)\n var length = end - offset\n var nameLen = Math.min(buf.readUInt8(42), 31)\n var box = {\n dataReferenceIndex: buf.readUInt16BE(6),\n width: buf.readUInt16BE(24),\n height: buf.readUInt16BE(26),\n hResolution: buf.readUInt32BE(28),\n vResolution: buf.readUInt32BE(32),\n frameCount: buf.readUInt16BE(40),\n compressorName: buf.toString('utf8', 43, 43 + nameLen),\n depth: buf.readUInt16BE(74),\n children: []\n }\n\n var ptr = 78\n while (length - ptr >= 8) {\n var child = Box.decode(buf, ptr, length)\n box.children.push(child)\n box[child.type] = child\n ptr += child.length\n }\n\n return box\n}\nexports.VisualSampleEntry.encodingLength = function (box) {\n var len = 78\n var children = box.children || []\n children.forEach(function (child) {\n len += Box.encodingLength(child)\n })\n return len\n}\n\nexports.avcC = {}\nexports.avcC.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(box.buffer.length)\n\n box.buffer.copy(buf)\n exports.avcC.encode.bytes = box.buffer.length\n}\nexports.avcC.decode = function (buf, offset, end) {\n buf = buf.slice(offset, end)\n\n return {\n mimeCodec: buf.toString('hex', 1, 4),\n buffer: Buffer.from(buf)\n }\n}\nexports.avcC.encodingLength = function (box) {\n return box.buffer.length\n}\n\nexports.mp4a = exports.AudioSampleEntry = {}\nexports.AudioSampleEntry.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.AudioSampleEntry.encodingLength(box))\n\n writeReserved(buf, 0, 6)\n buf.writeUInt16BE(box.dataReferenceIndex || 0, 6)\n writeReserved(buf, 8, 16)\n buf.writeUInt16BE(box.channelCount || 2, 16)\n buf.writeUInt16BE(box.sampleSize || 16, 18)\n writeReserved(buf, 20, 24)\n buf.writeUInt32BE(box.sampleRate || 0, 24)\n\n var ptr = 28\n var children = box.children || []\n children.forEach(function (child) {\n Box.encode(child, buf, ptr)\n ptr += Box.encode.bytes\n })\n exports.AudioSampleEntry.encode.bytes = ptr\n}\nexports.AudioSampleEntry.decode = function (buf, offset, end) {\n buf = buf.slice(offset, end)\n var length = end - offset\n var box = {\n dataReferenceIndex: buf.readUInt16BE(6),\n channelCount: buf.readUInt16BE(16),\n sampleSize: buf.readUInt16BE(18),\n sampleRate: buf.readUInt32BE(24),\n children: []\n }\n\n var ptr = 28\n while (length - ptr >= 8) {\n var child = Box.decode(buf, ptr, length)\n box.children.push(child)\n box[child.type] = child\n ptr += child.length\n }\n\n return box\n}\nexports.AudioSampleEntry.encodingLength = function (box) {\n var len = 28\n var children = box.children || []\n children.forEach(function (child) {\n len += Box.encodingLength(child)\n })\n return len\n}\n\nexports.esds = {}\nexports.esds.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(box.buffer.length)\n\n box.buffer.copy(buf, 0)\n exports.esds.encode.bytes = box.buffer.length\n}\nexports.esds.decode = function (buf, offset, end) {\n buf = buf.slice(offset, end)\n\n var desc = Descriptor.Descriptor.decode(buf, 0, buf.length)\n var esd = (desc.tagName === 'ESDescriptor') ? desc : {}\n var dcd = esd.DecoderConfigDescriptor || {}\n var oti = dcd.oti || 0\n var dsi = dcd.DecoderSpecificInfo\n var audioConfig = dsi ? (dsi.buffer.readUInt8(0) & 0xf8) >> 3 : 0\n\n var mimeCodec = null\n if (oti) {\n mimeCodec = oti.toString(16)\n if (audioConfig) {\n mimeCodec += '.' + audioConfig\n }\n }\n\n return {\n mimeCodec: mimeCodec,\n buffer: Buffer.from(buf.slice(0))\n }\n}\nexports.esds.encodingLength = function (box) {\n return box.buffer.length\n}\n\n// TODO: integrate the two versions in a saner way\nexports.stsz = {}\nexports.stsz.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsz.encodingLength(box))\n\n buf.writeUInt32BE(0, 0)\n buf.writeUInt32BE(entries.length, 4)\n\n for (var i = 0; i < entries.length; i++) {\n buf.writeUInt32BE(entries[i], i * 4 + 8)\n }\n\n exports.stsz.encode.bytes = 8 + entries.length * 4\n return buf\n}\nexports.stsz.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var size = buf.readUInt32BE(0)\n var num = buf.readUInt32BE(4)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n if (size === 0) {\n entries[i] = buf.readUInt32BE(i * 4 + 8)\n } else {\n entries[i] = size\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.stsz.encodingLength = function (box) {\n return 8 + box.entries.length * 4\n}\n\nexports.stss =\nexports.stco = {}\nexports.stco.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stco.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n buf.writeUInt32BE(entries[i], i * 4 + 4)\n }\n\n exports.stco.encode.bytes = 4 + entries.length * 4\n return buf\n}\nexports.stco.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n entries[i] = buf.readUInt32BE(i * 4 + 4)\n }\n\n return {\n entries: entries\n }\n}\nexports.stco.encodingLength = function (box) {\n return 4 + box.entries.length * 4\n}\n\nexports.co64 = {}\nexports.co64.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.co64.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n uint64be.encode(entries[i], buf, i * 8 + 4)\n }\n\n exports.co64.encode.bytes = 4 + entries.length * 8\n return buf\n}\nexports.co64.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n entries[i] = uint64be.decode(buf, i * 8 + 4)\n }\n\n return {\n entries: entries\n }\n}\nexports.co64.encodingLength = function (box) {\n return 4 + box.entries.length * 8\n}\n\nexports.stts = {}\nexports.stts.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stts.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n var ptr = i * 8 + 4\n buf.writeUInt32BE(entries[i].count || 0, ptr)\n buf.writeUInt32BE(entries[i].duration || 0, ptr + 4)\n }\n\n exports.stts.encode.bytes = 4 + box.entries.length * 8\n return buf\n}\nexports.stts.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n var ptr = i * 8 + 4\n entries[i] = {\n count: buf.readUInt32BE(ptr),\n duration: buf.readUInt32BE(ptr + 4)\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.stts.encodingLength = function (box) {\n return 4 + box.entries.length * 8\n}\n\nexports.ctts = {}\nexports.ctts.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.ctts.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n var ptr = i * 8 + 4\n buf.writeUInt32BE(entries[i].count || 0, ptr)\n buf.writeUInt32BE(entries[i].compositionOffset || 0, ptr + 4)\n }\n\n exports.ctts.encode.bytes = 4 + entries.length * 8\n return buf\n}\nexports.ctts.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n var ptr = i * 8 + 4\n entries[i] = {\n count: buf.readUInt32BE(ptr),\n compositionOffset: buf.readInt32BE(ptr + 4)\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.ctts.encodingLength = function (box) {\n return 4 + box.entries.length * 8\n}\n\nexports.stsc = {}\nexports.stsc.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsc.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n var ptr = i * 12 + 4\n buf.writeUInt32BE(entries[i].firstChunk || 0, ptr)\n buf.writeUInt32BE(entries[i].samplesPerChunk || 0, ptr + 4)\n buf.writeUInt32BE(entries[i].sampleDescriptionId || 0, ptr + 8)\n }\n\n exports.stsc.encode.bytes = 4 + entries.length * 12\n return buf\n}\nexports.stsc.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n var ptr = i * 12 + 4\n entries[i] = {\n firstChunk: buf.readUInt32BE(ptr),\n samplesPerChunk: buf.readUInt32BE(ptr + 4),\n sampleDescriptionId: buf.readUInt32BE(ptr + 8)\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.stsc.encodingLength = function (box) {\n return 4 + box.entries.length * 12\n}\n\nexports.dref = {}\nexports.dref.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.dref.encodingLength(box))\n var entries = box.entries || []\n\n buf.writeUInt32BE(entries.length, 0)\n\n var ptr = 4\n for (var i = 0; i < entries.length; i++) {\n var entry = entries[i]\n var size = (entry.buf ? entry.buf.length : 0) + 4 + 4\n\n buf.writeUInt32BE(size, ptr)\n ptr += 4\n\n buf.write(entry.type, ptr, 4, 'ascii')\n ptr += 4\n\n if (entry.buf) {\n entry.buf.copy(buf, ptr)\n ptr += entry.buf.length\n }\n }\n\n exports.dref.encode.bytes = ptr\n return buf\n}\nexports.dref.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n var ptr = 4\n\n for (var i = 0; i < num; i++) {\n var size = buf.readUInt32BE(ptr)\n var type = buf.toString('ascii', ptr + 4, ptr + 8)\n var tmp = buf.slice(ptr + 8, ptr + size)\n ptr += size\n\n entries[i] = {\n type: type,\n buf: tmp\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.dref.encodingLength = function (box) {\n var totalSize = 4\n if (!box.entries) return totalSize\n for (var i = 0; i < box.entries.length; i++) {\n var buf = box.entries[i].buf\n totalSize += (buf ? buf.length : 0) + 4 + 4\n }\n return totalSize\n}\n\nexports.elst = {}\nexports.elst.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.elst.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n var ptr = i * 12 + 4\n buf.writeUInt32BE(entries[i].trackDuration || 0, ptr)\n buf.writeUInt32BE(entries[i].mediaTime || 0, ptr + 4)\n writeFixed32(entries[i].mediaRate || 0, buf, ptr + 8)\n }\n\n exports.elst.encode.bytes = 4 + entries.length * 12\n return buf\n}\nexports.elst.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n var ptr = i * 12 + 4\n entries[i] = {\n trackDuration: buf.readUInt32BE(ptr),\n mediaTime: buf.readInt32BE(ptr + 4),\n mediaRate: readFixed32(buf, ptr + 8)\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.elst.encodingLength = function (box) {\n return 4 + box.entries.length * 12\n}\n\nexports.hdlr = {}\nexports.hdlr.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.hdlr.encodingLength(box))\n\n var len = 21 + (box.name || '').length\n buf.fill(0, 0, len)\n\n buf.write(box.handlerType || '', 4, 4, 'ascii')\n writeString(box.name || '', buf, 20)\n\n exports.hdlr.encode.bytes = len\n return buf\n}\nexports.hdlr.decode = function (buf, offset, end) {\n buf = buf.slice(offset)\n return {\n handlerType: buf.toString('ascii', 4, 8),\n name: readString(buf, 20, end)\n }\n}\nexports.hdlr.encodingLength = function (box) {\n return 21 + (box.name || '').length\n}\n\nexports.mehd = {}\nexports.mehd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n\n buf.writeUInt32BE(box.fragmentDuration || 0, 0)\n exports.mehd.encode.bytes = 4\n return buf\n}\nexports.mehd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n fragmentDuration: buf.readUInt32BE(0)\n }\n}\nexports.mehd.encodingLength = function (box) {\n return 4\n}\n\nexports.trex = {}\nexports.trex.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(20)\n\n buf.writeUInt32BE(box.trackId || 0, 0)\n buf.writeUInt32BE(box.defaultSampleDescriptionIndex || 0, 4)\n buf.writeUInt32BE(box.defaultSampleDuration || 0, 8)\n buf.writeUInt32BE(box.defaultSampleSize || 0, 12)\n buf.writeUInt32BE(box.defaultSampleFlags || 0, 16)\n exports.trex.encode.bytes = 20\n return buf\n}\nexports.trex.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n trackId: buf.readUInt32BE(0),\n defaultSampleDescriptionIndex: buf.readUInt32BE(4),\n defaultSampleDuration: buf.readUInt32BE(8),\n defaultSampleSize: buf.readUInt32BE(12),\n defaultSampleFlags: buf.readUInt32BE(16)\n }\n}\nexports.trex.encodingLength = function (box) {\n return 20\n}\n\nexports.mfhd = {}\nexports.mfhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n\n buf.writeUInt32BE(box.sequenceNumber || 0, 0)\n exports.mfhd.encode.bytes = 4\n return buf\n}\nexports.mfhd.decode = function (buf, offset) {\n return {\n sequenceNumber: buf.readUInt32BE(0)\n }\n}\nexports.mfhd.encodingLength = function (box) {\n return 4\n}\n\nexports.tfhd = {}\nexports.tfhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n buf.writeUInt32BE(box.trackId, 0)\n exports.tfhd.encode.bytes = 4\n return buf\n}\nexports.tfhd.decode = function (buf, offset) {\n // TODO: this\n}\nexports.tfhd.encodingLength = function (box) {\n // TODO: this is wrong!\n return 4\n}\n\nexports.tfdt = {}\nexports.tfdt.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n\n buf.writeUInt32BE(box.baseMediaDecodeTime || 0, 0)\n exports.tfdt.encode.bytes = 4\n return buf\n}\nexports.tfdt.decode = function (buf, offset) {\n // TODO: this\n}\nexports.tfdt.encodingLength = function (box) {\n return 4\n}\n\nexports.trun = {}\nexports.trun.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(8 + box.entries.length * 16)\n\n // TODO: this is wrong\n buf.writeUInt32BE(box.entries.length, 0)\n buf.writeInt32BE(box.dataOffset, 4)\n var ptr = 8\n for (var i = 0; i < box.entries.length; i++) {\n var entry = box.entries[i]\n buf.writeUInt32BE(entry.sampleDuration, ptr)\n ptr += 4\n\n buf.writeUInt32BE(entry.sampleSize, ptr)\n ptr += 4\n\n buf.writeUInt32BE(entry.sampleFlags, ptr)\n ptr += 4\n\n if ((box.version || 0) === 0) {\n buf.writeUInt32BE(entry.sampleCompositionTimeOffset, ptr)\n } else {\n buf.writeInt32BE(entry.sampleCompositionTimeOffset, ptr)\n }\n ptr += 4\n }\n exports.trun.encode.bytes = ptr\n}\nexports.trun.decode = function (buf, offset) {\n // TODO: this\n}\nexports.trun.encodingLength = function (box) {\n // TODO: this is wrong\n return 8 + box.entries.length * 16\n}\n\nexports.mdat = {}\nexports.mdat.encode = function (box, buf, offset) {\n if (box.buffer) {\n box.buffer.copy(buf, offset)\n exports.mdat.encode.bytes = box.buffer.length\n } else {\n exports.mdat.encode.bytes = exports.mdat.encodingLength(box)\n }\n}\nexports.mdat.decode = function (buf, start, end) {\n return {\n buffer: Buffer.from(buf.slice(start, end))\n }\n}\nexports.mdat.encodingLength = function (box) {\n return box.buffer ? box.buffer.length : box.contentLength\n}\n\nfunction writeReserved (buf, offset, end) {\n for (var i = offset; i < end; i++) buf[i] = 0\n}\n\nfunction writeDate (date, buf, offset) {\n buf.writeUInt32BE(Math.floor((date.getTime() + TIME_OFFSET) / 1000), offset)\n}\n\nfunction writeDate64 (date, buf, offset) {\n // Node only supports integer <= 48bit. Waiting for BigInt!\n buf.writeUIntBE(Math.floor((date.getTime() + TIME_OFFSET) / 1000), offset, 6)\n}\n\n// TODO: think something is wrong here\nfunction writeFixed32 (num, buf, offset) {\n buf.writeUInt16BE(Math.floor(num) % (256 * 256), offset)\n buf.writeUInt16BE(Math.floor(num * 256 * 256) % (256 * 256), offset + 2)\n}\n\nfunction writeFixed16 (num, buf, offset) {\n buf[offset] = Math.floor(num) % 256\n buf[offset + 1] = Math.floor(num * 256) % 256\n}\n\nfunction writeMatrix (list, buf, offset) {\n if (!list) list = [0, 0, 0, 0, 0, 0, 0, 0, 0]\n for (var i = 0; i < list.length; i++) {\n writeFixed32(list[i], buf, offset + i * 4)\n }\n}\n\nfunction writeString (str, buf, offset) {\n var strBuffer = Buffer.from(str, 'utf8')\n strBuffer.copy(buf, offset)\n buf[offset + strBuffer.length] = 0\n}\n\nfunction readMatrix (buf) {\n var list = new Array(buf.length / 4)\n for (var i = 0; i < list.length; i++) list[i] = readFixed32(buf, i * 4)\n return list\n}\n\nfunction readDate64 (buf, offset) {\n // Node only supports integer <= 48bit. Waiting for BigInt!\n return new Date(buf.readUIntBE(offset, 6) * 1000 - TIME_OFFSET)\n}\n\nfunction readDate (buf, offset) {\n return new Date(buf.readUInt32BE(offset) * 1000 - TIME_OFFSET)\n}\n\nfunction readFixed32 (buf, offset) {\n return buf.readUInt16BE(offset) + buf.readUInt16BE(offset + 2) / (256 * 256)\n}\n\nfunction readFixed16 (buf, offset) {\n return buf[offset] + buf[offset + 1] / 256\n}\n\nfunction readString (buf, offset, length) {\n var i\n for (i = 0; i < length; i++) {\n if (buf[offset + i] === 0) {\n break\n }\n }\n return buf.toString('utf8', offset, offset + i)\n}\n","var tagToName = {\n 0x03: 'ESDescriptor',\n 0x04: 'DecoderConfigDescriptor',\n 0x05: 'DecoderSpecificInfo',\n 0x06: 'SLConfigDescriptor'\n}\n\nexports.Descriptor = {}\nexports.Descriptor.decode = function (buf, start, end) {\n var tag = buf.readUInt8(start)\n var ptr = start + 1\n var lenByte\n var len = 0\n do {\n lenByte = buf.readUInt8(ptr++)\n len = (len << 7) | (lenByte & 0x7f)\n } while (lenByte & 0x80)\n\n var obj\n var tagName = tagToName[tag] // May be undefined; that's ok\n if (exports[tagName]) {\n obj = exports[tagName].decode(buf, ptr, end)\n } else {\n obj = {\n buffer: Buffer.from(buf.slice(ptr, ptr + len))\n }\n }\n\n obj.tag = tag\n obj.tagName = tagName\n obj.length = (ptr - start) + len\n obj.contentsLen = len\n return obj\n}\n\nexports.DescriptorArray = {}\nexports.DescriptorArray.decode = function (buf, start, end) {\n var ptr = start\n var obj = {}\n while (ptr + 2 <= end) {\n var descriptor = exports.Descriptor.decode(buf, ptr, end)\n ptr += descriptor.length\n var tagName = tagToName[descriptor.tag] || ('Descriptor' + descriptor.tag)\n obj[tagName] = descriptor\n }\n return obj\n}\n\nexports.ESDescriptor = {}\nexports.ESDescriptor.decode = function (buf, start, end) {\n var flags = buf.readUInt8(start + 2)\n var ptr = start + 3\n if (flags & 0x80) {\n ptr += 2\n }\n if (flags & 0x40) {\n var len = buf.readUInt8(ptr)\n ptr += len + 1\n }\n if (flags & 0x20) {\n ptr += 2\n }\n return exports.DescriptorArray.decode(buf, ptr, end)\n}\n\nexports.DecoderConfigDescriptor = {}\nexports.DecoderConfigDescriptor.decode = function (buf, start, end) {\n var oti = buf.readUInt8(start)\n var obj = exports.DescriptorArray.decode(buf, start + 13, end)\n obj.oti = oti\n return obj\n}\n","// var assert = require('assert')\nvar uint64be = require('uint64be')\n\nvar boxes = require('./boxes')\n\nvar UINT32_MAX = 4294967295\n\nvar Box = exports\n\n/*\n * Lists the proper order for boxes inside containers.\n * Five-character names ending in 's' indicate arrays instead of single elements.\n */\nvar containers = exports.containers = {\n 'moov': ['mvhd', 'meta', 'traks', 'mvex'],\n 'trak': ['tkhd', 'tref', 'trgr', 'edts', 'meta', 'mdia', 'udta'],\n 'edts': ['elst'],\n 'mdia': ['mdhd', 'hdlr', 'elng', 'minf'],\n 'minf': ['vmhd', 'smhd', 'hmhd', 'sthd', 'nmhd', 'dinf', 'stbl'],\n 'dinf': ['dref'],\n 'stbl': ['stsd', 'stts', 'ctts', 'cslg', 'stsc', 'stsz', 'stz2', 'stco', 'co64', 'stss', 'stsh', 'padb', 'stdp', 'sdtp', 'sbgps', 'sgpds', 'subss', 'saizs', 'saios'],\n 'mvex': ['mehd', 'trexs', 'leva'],\n 'moof': ['mfhd', 'meta', 'trafs'],\n 'traf': ['tfhd', 'tfdt', 'trun', 'sbgps', 'sgpds', 'subss', 'saizs', 'saios', 'meta']\n}\n\nBox.encode = function (obj, buffer, offset) {\n Box.encodingLength(obj) // sets every level appropriately\n offset = offset || 0\n buffer = buffer || Buffer.alloc(obj.length)\n return Box._encode(obj, buffer, offset)\n}\n\nBox._encode = function (obj, buffer, offset) {\n var type = obj.type\n var len = obj.length\n if (len > UINT32_MAX) {\n len = 1\n }\n buffer.writeUInt32BE(len, offset)\n buffer.write(obj.type, offset + 4, 4, 'ascii')\n var ptr = offset + 8\n if (len === 1) {\n uint64be.encode(obj.length, buffer, ptr)\n ptr += 8\n }\n if (boxes.fullBoxes[type]) {\n buffer.writeUInt32BE(obj.flags || 0, ptr)\n buffer.writeUInt8(obj.version || 0, ptr)\n ptr += 4\n }\n\n if (containers[type]) {\n var contents = containers[type]\n contents.forEach(function (childType) {\n if (childType.length === 5) {\n var entry = obj[childType] || []\n childType = childType.substr(0, 4)\n entry.forEach(function (child) {\n Box._encode(child, buffer, ptr)\n ptr += Box.encode.bytes\n })\n } else if (obj[childType]) {\n Box._encode(obj[childType], buffer, ptr)\n ptr += Box.encode.bytes\n }\n })\n if (obj.otherBoxes) {\n obj.otherBoxes.forEach(function (child) {\n Box._encode(child, buffer, ptr)\n ptr += Box.encode.bytes\n })\n }\n } else if (boxes[type]) {\n var encode = boxes[type].encode\n encode(obj, buffer, ptr)\n ptr += encode.bytes\n } else if (obj.buffer) {\n var buf = obj.buffer\n buf.copy(buffer, ptr)\n ptr += obj.buffer.length\n } else {\n throw new Error('Either `type` must be set to a known type (not\\'' + type + '\\') or `buffer` must be set')\n }\n\n Box.encode.bytes = ptr - offset\n // assert.equal(ptr - offset, obj.length, 'Error encoding \\'' + type + '\\': wrote ' + ptr - offset + ' bytes, expecting ' + obj.length)\n return buffer\n}\n\n/*\n * Returns an object with `type` and `size` fields,\n * or if there isn't enough data, returns the total\n * number of bytes needed to read the headers\n */\nBox.readHeaders = function (buffer, start, end) {\n start = start || 0\n end = end || buffer.length\n if (end - start < 8) {\n return 8\n }\n\n var len = buffer.readUInt32BE(start)\n var type = buffer.toString('ascii', start + 4, start + 8)\n var ptr = start + 8\n\n if (len === 1) {\n if (end - start < 16) {\n return 16\n }\n\n len = uint64be.decode(buffer, ptr)\n ptr += 8\n }\n\n var version\n var flags\n if (boxes.fullBoxes[type]) {\n version = buffer.readUInt8(ptr)\n flags = buffer.readUInt32BE(ptr) & 0xffffff\n ptr += 4\n }\n\n return {\n length: len,\n headersLen: ptr - start,\n contentLen: len - (ptr - start),\n type: type,\n version: version,\n flags: flags\n }\n}\n\nBox.decode = function (buffer, start, end) {\n start = start || 0\n end = end || buffer.length\n var headers = Box.readHeaders(buffer, start, end)\n if (!headers || headers.length > end - start) {\n throw new Error('Data too short')\n }\n\n return Box.decodeWithoutHeaders(headers, buffer, start + headers.headersLen, start + headers.length)\n}\n\nBox.decodeWithoutHeaders = function (headers, buffer, start, end) {\n start = start || 0\n end = end || buffer.length\n var type = headers.type\n var obj = {}\n if (containers[type]) {\n obj.otherBoxes = []\n var contents = containers[type]\n var ptr = start\n while (end - ptr >= 8) {\n var child = Box.decode(buffer, ptr, end)\n ptr += child.length\n if (contents.indexOf(child.type) >= 0) {\n obj[child.type] = child\n } else if (contents.indexOf(child.type + 's') >= 0) {\n var childType = child.type + 's'\n var entry = obj[childType] = obj[childType] || []\n entry.push(child)\n } else {\n obj.otherBoxes.push(child)\n }\n }\n } else if (boxes[type]) {\n var decode = boxes[type].decode\n obj = decode(buffer, start, end)\n } else {\n obj.buffer = Buffer.from(buffer.slice(start, end))\n }\n\n obj.length = headers.length\n obj.contentLen = headers.contentLen\n obj.type = headers.type\n obj.version = headers.version\n obj.flags = headers.flags\n return obj\n}\n\nBox.encodingLength = function (obj) {\n var type = obj.type\n\n var len = 8\n if (boxes.fullBoxes[type]) {\n len += 4\n }\n\n if (containers[type]) {\n var contents = containers[type]\n contents.forEach(function (childType) {\n if (childType.length === 5) {\n var entry = obj[childType] || []\n childType = childType.substr(0, 4)\n entry.forEach(function (child) {\n child.type = childType\n len += Box.encodingLength(child)\n })\n } else if (obj[childType]) {\n var child = obj[childType]\n child.type = childType\n len += Box.encodingLength(child)\n }\n })\n if (obj.otherBoxes) {\n obj.otherBoxes.forEach(function (child) {\n len += Box.encodingLength(child)\n })\n }\n } else if (boxes[type]) {\n len += boxes[type].encodingLength(obj)\n } else if (obj.buffer) {\n len += obj.buffer.length\n } else {\n throw new Error('Either `type` must be set to a known type (not\\'' + type + '\\') or `buffer` must be set')\n }\n\n if (len > UINT32_MAX) {\n len += 8\n }\n\n obj.length = len\n return len\n}\n","var stream = require('readable-stream')\nvar nextEvent = require('next-event')\nvar Box = require('mp4-box-encoding')\n\nvar EMPTY = Buffer.alloc(0)\n\nclass Decoder extends stream.Writable {\n constructor (opts) {\n super(opts)\n\n this.destroyed = false\n\n this._pending = 0\n this._missing = 0\n this._ignoreEmpty = false\n this._buf = null\n this._str = null\n this._cb = null\n this._ondrain = null\n this._writeBuffer = null\n this._writeCb = null\n\n this._ondrain = null\n this._kick()\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n if (err) this.emit('error', err)\n this.emit('close')\n }\n\n _write (data, enc, next) {\n if (this.destroyed) return\n var drained = !this._str || !this._str._writableState.needDrain\n\n while (data.length && !this.destroyed) {\n if (!this._missing && !this._ignoreEmpty) {\n this._writeBuffer = data\n this._writeCb = next\n return\n }\n\n var consumed = data.length < this._missing ? data.length : this._missing\n if (this._buf) data.copy(this._buf, this._buf.length - this._missing)\n else if (this._str) drained = this._str.write(consumed === data.length ? data : data.slice(0, consumed))\n\n this._missing -= consumed\n\n if (!this._missing) {\n var buf = this._buf\n var cb = this._cb\n var stream = this._str\n\n this._buf = this._cb = this._str = this._ondrain = null\n drained = true\n\n this._ignoreEmpty = false\n if (stream) stream.end()\n if (cb) cb(buf)\n }\n\n data = consumed === data.length ? EMPTY : data.slice(consumed)\n }\n\n if (this._pending && !this._missing) {\n this._writeBuffer = data\n this._writeCb = next\n return\n }\n\n if (drained) next()\n else this._ondrain(next)\n }\n\n _buffer (size, cb) {\n this._missing = size\n this._buf = Buffer.alloc(size)\n this._cb = cb\n }\n\n _stream (size, cb) {\n this._missing = size\n this._str = new MediaData(this)\n this._ondrain = nextEvent(this._str, 'drain')\n this._pending++\n this._str.on('end', () => {\n this._pending--\n this._kick()\n })\n this._cb = cb\n return this._str\n }\n\n _readBox () {\n const bufferHeaders = (len, buf) => {\n this._buffer(len, additionalBuf => {\n if (buf) {\n buf = Buffer.concat([buf, additionalBuf])\n } else {\n buf = additionalBuf\n }\n var headers = Box.readHeaders(buf)\n if (typeof headers === 'number') {\n bufferHeaders(headers - buf.length, buf)\n } else {\n this._pending++\n this._headers = headers\n this.emit('box', headers)\n }\n })\n }\n\n bufferHeaders(8)\n }\n\n stream () {\n if (!this._headers) throw new Error('this function can only be called once after \\'box\\' is emitted')\n var headers = this._headers\n this._headers = null\n\n return this._stream(headers.contentLen, () => {\n this._pending--\n this._kick()\n })\n }\n\n decode (cb) {\n if (!this._headers) throw new Error('this function can only be called once after \\'box\\' is emitted')\n var headers = this._headers\n this._headers = null\n\n this._buffer(headers.contentLen, buf => {\n var box = Box.decodeWithoutHeaders(headers, buf)\n cb(box)\n this._pending--\n this._kick()\n })\n }\n\n ignore () {\n if (!this._headers) throw new Error('this function can only be called once after \\'box\\' is emitted')\n var headers = this._headers\n this._headers = null\n\n this._missing = headers.contentLen\n if (this._missing === 0) {\n this._ignoreEmpty = true\n }\n this._cb = () => {\n this._pending--\n this._kick()\n }\n }\n\n _kick () {\n if (this._pending) return\n if (!this._buf && !this._str) this._readBox()\n if (this._writeBuffer) {\n var next = this._writeCb\n var buffer = this._writeBuffer\n this._writeBuffer = null\n this._writeCb = null\n this._write(buffer, null, next)\n }\n }\n}\n\nclass MediaData extends stream.PassThrough {\n constructor (parent) {\n super()\n this._parent = parent\n this.destroyed = false\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n this._parent.destroy(err)\n if (err) this.emit('error', err)\n this.emit('close')\n }\n}\n\nmodule.exports = Decoder\n","var stream = require('readable-stream')\nvar Box = require('mp4-box-encoding')\nvar queueMicrotask = require('queue-microtask')\n\nfunction noop () {}\n\nclass Encoder extends stream.Readable {\n constructor (opts) {\n super(opts)\n\n this.destroyed = false\n\n this._finalized = false\n this._reading = false\n this._stream = null\n this._drain = null\n this._want = false\n\n this._onreadable = () => {\n if (!this._want) return\n this._want = false\n this._read()\n }\n\n this._onend = () => {\n this._stream = null\n }\n }\n\n mdat (size, cb) {\n this.mediaData(size, cb)\n }\n\n mediaData (size, cb) {\n var stream = new MediaData(this)\n this.box({ type: 'mdat', contentLength: size, encodeBufferLen: 8, stream: stream }, cb)\n return stream\n }\n\n box (box, cb) {\n if (!cb) cb = noop\n if (this.destroyed) return cb(new Error('Encoder is destroyed'))\n\n var buf\n if (box.encodeBufferLen) {\n buf = Buffer.alloc(box.encodeBufferLen)\n }\n if (box.stream) {\n box.buffer = null\n buf = Box.encode(box, buf)\n this.push(buf)\n this._stream = box.stream\n this._stream.on('readable', this._onreadable)\n this._stream.on('end', this._onend)\n this._stream.on('end', cb)\n this._forward()\n } else {\n buf = Box.encode(box, buf)\n var drained = this.push(buf)\n if (drained) return queueMicrotask(cb)\n this._drain = cb\n }\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n if (this._stream && this._stream.destroy) this._stream.destroy()\n this._stream = null\n if (this._drain) {\n var cb = this._drain\n this._drain = null\n cb(err)\n }\n if (err) this.emit('error', err)\n this.emit('close')\n }\n\n finalize () {\n this._finalized = true\n if (!this._stream && !this._drain) {\n this.push(null)\n }\n }\n\n _forward () {\n if (!this._stream) return\n\n while (!this.destroyed) {\n var buf = this._stream.read()\n\n if (!buf) {\n this._want = !!this._stream\n return\n }\n\n if (!this.push(buf)) return\n }\n }\n\n _read () {\n if (this._reading || this.destroyed) return\n this._reading = true\n\n if (this._stream) this._forward()\n if (this._drain) {\n var drain = this._drain\n this._drain = null\n drain()\n }\n\n this._reading = false\n if (this._finalized) {\n this.push(null)\n }\n }\n}\n\nclass MediaData extends stream.PassThrough {\n constructor (parent) {\n super()\n this._parent = parent\n this.destroyed = false\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n this._parent.destroy(err)\n if (err) this.emit('error', err)\n this.emit('close')\n }\n}\n\nmodule.exports = Encoder\n","const Decoder = require('./decode')\nconst Encoder = require('./encode')\n\nexports.decode = opts => new Decoder(opts)\nexports.encode = opts => new Encoder(opts)\n","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar w = d * 7;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n * - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function(val, options) {\n options = options || {};\n var type = typeof val;\n if (type === 'string' && val.length > 0) {\n return parse(val);\n } else if (type === 'number' && isFinite(val)) {\n return options.long ? fmtLong(val) : fmtShort(val);\n }\n throw new Error(\n 'val is not a non-empty string or a valid number. val=' +\n JSON.stringify(val)\n );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n str = String(str);\n if (str.length > 100) {\n return;\n }\n var match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(\n str\n );\n if (!match) {\n return;\n }\n var n = parseFloat(match[1]);\n var type = (match[2] || 'ms').toLowerCase();\n switch (type) {\n case 'years':\n case 'year':\n case 'yrs':\n case 'yr':\n case 'y':\n return n * y;\n case 'weeks':\n case 'week':\n case 'w':\n return n * w;\n case 'days':\n case 'day':\n case 'd':\n return n * d;\n case 'hours':\n case 'hour':\n case 'hrs':\n case 'hr':\n case 'h':\n return n * h;\n case 'minutes':\n case 'minute':\n case 'mins':\n case 'min':\n case 'm':\n return n * m;\n case 'seconds':\n case 'second':\n case 'secs':\n case 'sec':\n case 's':\n return n * s;\n case 'milliseconds':\n case 'millisecond':\n case 'msecs':\n case 'msec':\n case 'ms':\n return n;\n default:\n return undefined;\n }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n var msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return Math.round(ms / d) + 'd';\n }\n if (msAbs >= h) {\n return Math.round(ms / h) + 'h';\n }\n if (msAbs >= m) {\n return Math.round(ms / m) + 'm';\n }\n if (msAbs >= s) {\n return Math.round(ms / s) + 's';\n }\n return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n var msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return plural(ms, msAbs, d, 'day');\n }\n if (msAbs >= h) {\n return plural(ms, msAbs, h, 'hour');\n }\n if (msAbs >= m) {\n return plural(ms, msAbs, m, 'minute');\n }\n if (msAbs >= s) {\n return plural(ms, msAbs, s, 'second');\n }\n return ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, msAbs, n, name) {\n var isPlural = msAbs >= n * 1.5;\n return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');\n}\n","/*! multistream. MIT License. Feross Aboukhadijeh */\nconst stream = require('readable-stream')\nconst once = require('once')\n\nfunction toStreams2Obj (s) {\n return toStreams2(s, { objectMode: true, highWaterMark: 16 })\n}\n\nfunction toStreams2Buf (s) {\n return toStreams2(s)\n}\n\nfunction toStreams2 (s, opts) {\n if (!s || typeof s === 'function' || s._readableState) return s\n\n const wrap = new stream.Readable(opts).wrap(s)\n if (s.destroy) {\n wrap.destroy = s.destroy.bind(s)\n }\n return wrap\n}\n\nclass MultiStream extends stream.Readable {\n constructor (streams, opts) {\n super({ ...opts, autoDestroy: true })\n\n this._drained = false\n this._forwarding = false\n this._current = null\n this._toStreams2 = (opts && opts.objectMode) ? toStreams2Obj : toStreams2Buf\n\n if (typeof streams === 'function') {\n this._queue = streams\n } else {\n this._queue = streams.map(this._toStreams2)\n this._queue.forEach(stream => {\n if (typeof stream !== 'function') this._attachErrorListener(stream)\n })\n }\n\n this._next()\n }\n\n _read () {\n this._drained = true\n this._forward()\n }\n\n _forward () {\n if (this._forwarding || !this._drained || !this._current) return\n this._forwarding = true\n\n let chunk\n while (this._drained && (chunk = this._current.read()) !== null) {\n this._drained = this.push(chunk)\n }\n\n this._forwarding = false\n }\n\n _destroy (err, cb) {\n let streams = []\n if (this._current) streams.push(this._current)\n if (typeof this._queue !== 'function') streams = streams.concat(this._queue)\n\n if (streams.length === 0) {\n cb(err)\n } else {\n let counter = streams.length\n let er = err\n streams.forEach(stream => {\n destroy(stream, err, err => {\n er = er || err\n if (--counter === 0) {\n cb(er)\n }\n })\n })\n }\n }\n\n _next () {\n this._current = null\n\n if (typeof this._queue === 'function') {\n this._queue((err, stream) => {\n if (err) return this.destroy(err)\n stream = this._toStreams2(stream)\n this._attachErrorListener(stream)\n this._gotNextStream(stream)\n })\n } else {\n let stream = this._queue.shift()\n if (typeof stream === 'function') {\n stream = this._toStreams2(stream())\n this._attachErrorListener(stream)\n }\n this._gotNextStream(stream)\n }\n }\n\n _gotNextStream (stream) {\n if (!stream) {\n this.push(null)\n return\n }\n\n this._current = stream\n this._forward()\n\n const onReadable = () => {\n this._forward()\n }\n\n const onClose = () => {\n if (!stream._readableState.ended && !stream.destroyed) {\n const err = new Error('ERR_STREAM_PREMATURE_CLOSE')\n err.code = 'ERR_STREAM_PREMATURE_CLOSE'\n this.destroy(err)\n }\n }\n\n const onEnd = () => {\n this._current = null\n stream.removeListener('readable', onReadable)\n stream.removeListener('end', onEnd)\n stream.removeListener('close', onClose)\n stream.destroy()\n this._next()\n }\n\n stream.on('readable', onReadable)\n stream.once('end', onEnd)\n stream.once('close', onClose)\n }\n\n _attachErrorListener (stream) {\n if (!stream) return\n\n const onError = (err) => {\n stream.removeListener('error', onError)\n this.destroy(err)\n }\n\n stream.once('error', onError)\n }\n}\n\nMultiStream.obj = streams => (\n new MultiStream(streams, { objectMode: true, highWaterMark: 16 })\n)\n\nmodule.exports = MultiStream\n\n// Normalize stream destroy w/ callback.\nfunction destroy (stream, err, cb) {\n if (!stream.destroy || stream.destroyed) {\n cb(err)\n } else {\n const callback = once(er => cb(er || err))\n stream\n .on('error', callback)\n .on('close', () => callback())\n .destroy(err, callback)\n }\n}\n","module.exports = nextEvent\n\nfunction nextEvent (emitter, name) {\n var next = null\n emitter.on(name, function (data) {\n if (!next) return\n var fn = next\n next = null\n fn(data)\n })\n\n return function (once) {\n next = once\n }\n}\n","'use strict';\n\nvar numberIsNaN = function (value) {\n\treturn value !== value;\n};\n\nmodule.exports = function is(a, b) {\n\tif (a === 0 && b === 0) {\n\t\treturn 1 / a === 1 / b;\n\t}\n\tif (a === b) {\n\t\treturn true;\n\t}\n\tif (numberIsNaN(a) && numberIsNaN(b)) {\n\t\treturn true;\n\t}\n\treturn false;\n};\n\n","'use strict';\n\nvar define = require('define-properties');\nvar callBind = require('call-bind');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Object);\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\treturn typeof Object.is === 'function' ? Object.is : implementation;\n};\n","'use strict';\n\nvar getPolyfill = require('./polyfill');\nvar define = require('define-properties');\n\nmodule.exports = function shimObjectIs() {\n\tvar polyfill = getPolyfill();\n\tdefine(Object, { is: polyfill }, {\n\t\tis: function testObjectIs() {\n\t\t\treturn Object.is !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","'use strict';\n\nvar keysShim;\nif (!Object.keys) {\n\t// modified from https://github.com/es-shims/es5-shim\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar toStr = Object.prototype.toString;\n\tvar isArgs = require('./isArguments'); // eslint-disable-line global-require\n\tvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\tvar hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString');\n\tvar hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype');\n\tvar dontEnums = [\n\t\t'toString',\n\t\t'toLocaleString',\n\t\t'valueOf',\n\t\t'hasOwnProperty',\n\t\t'isPrototypeOf',\n\t\t'propertyIsEnumerable',\n\t\t'constructor'\n\t];\n\tvar equalsConstructorPrototype = function (o) {\n\t\tvar ctor = o.constructor;\n\t\treturn ctor && ctor.prototype === o;\n\t};\n\tvar excludedKeys = {\n\t\t$applicationCache: true,\n\t\t$console: true,\n\t\t$external: true,\n\t\t$frame: true,\n\t\t$frameElement: true,\n\t\t$frames: true,\n\t\t$innerHeight: true,\n\t\t$innerWidth: true,\n\t\t$onmozfullscreenchange: true,\n\t\t$onmozfullscreenerror: true,\n\t\t$outerHeight: true,\n\t\t$outerWidth: true,\n\t\t$pageXOffset: true,\n\t\t$pageYOffset: true,\n\t\t$parent: true,\n\t\t$scrollLeft: true,\n\t\t$scrollTop: true,\n\t\t$scrollX: true,\n\t\t$scrollY: true,\n\t\t$self: true,\n\t\t$webkitIndexedDB: true,\n\t\t$webkitStorageInfo: true,\n\t\t$window: true\n\t};\n\tvar hasAutomationEqualityBug = (function () {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined') { return false; }\n\t\tfor (var k in window) {\n\t\t\ttry {\n\t\t\t\tif (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tequalsConstructorPrototype(window[k]);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (e) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}());\n\tvar equalsConstructorPrototypeIfNotBuggy = function (o) {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined' || !hasAutomationEqualityBug) {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t}\n\t\ttry {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tkeysShim = function keys(object) {\n\t\tvar isObject = object !== null && typeof object === 'object';\n\t\tvar isFunction = toStr.call(object) === '[object Function]';\n\t\tvar isArguments = isArgs(object);\n\t\tvar isString = isObject && toStr.call(object) === '[object String]';\n\t\tvar theKeys = [];\n\n\t\tif (!isObject && !isFunction && !isArguments) {\n\t\t\tthrow new TypeError('Object.keys called on a non-object');\n\t\t}\n\n\t\tvar skipProto = hasProtoEnumBug && isFunction;\n\t\tif (isString && object.length > 0 && !has.call(object, 0)) {\n\t\t\tfor (var i = 0; i < object.length; ++i) {\n\t\t\t\ttheKeys.push(String(i));\n\t\t\t}\n\t\t}\n\n\t\tif (isArguments && object.length > 0) {\n\t\t\tfor (var j = 0; j < object.length; ++j) {\n\t\t\t\ttheKeys.push(String(j));\n\t\t\t}\n\t\t} else {\n\t\t\tfor (var name in object) {\n\t\t\t\tif (!(skipProto && name === 'prototype') && has.call(object, name)) {\n\t\t\t\t\ttheKeys.push(String(name));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (hasDontEnumBug) {\n\t\t\tvar skipConstructor = equalsConstructorPrototypeIfNotBuggy(object);\n\n\t\t\tfor (var k = 0; k < dontEnums.length; ++k) {\n\t\t\t\tif (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) {\n\t\t\t\t\ttheKeys.push(dontEnums[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn theKeys;\n\t};\n}\nmodule.exports = keysShim;\n","'use strict';\n\nvar slice = Array.prototype.slice;\nvar isArgs = require('./isArguments');\n\nvar origKeys = Object.keys;\nvar keysShim = origKeys ? function keys(o) { return origKeys(o); } : require('./implementation');\n\nvar originalKeys = Object.keys;\n\nkeysShim.shim = function shimObjectKeys() {\n\tif (Object.keys) {\n\t\tvar keysWorksWithArguments = (function () {\n\t\t\t// Safari 5.0 bug\n\t\t\tvar args = Object.keys(arguments);\n\t\t\treturn args && args.length === arguments.length;\n\t\t}(1, 2));\n\t\tif (!keysWorksWithArguments) {\n\t\t\tObject.keys = function keys(object) { // eslint-disable-line func-name-matching\n\t\t\t\tif (isArgs(object)) {\n\t\t\t\t\treturn originalKeys(slice.call(object));\n\t\t\t\t}\n\t\t\t\treturn originalKeys(object);\n\t\t\t};\n\t\t}\n\t} else {\n\t\tObject.keys = keysShim;\n\t}\n\treturn Object.keys || keysShim;\n};\n\nmodule.exports = keysShim;\n","'use strict';\n\nvar toStr = Object.prototype.toString;\n\nmodule.exports = function isArguments(value) {\n\tvar str = toStr.call(value);\n\tvar isArgs = str === '[object Arguments]';\n\tif (!isArgs) {\n\t\tisArgs = str !== '[object Array]' &&\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\ttypeof value.length === 'number' &&\n\t\t\tvalue.length >= 0 &&\n\t\t\ttoStr.call(value.callee) === '[object Function]';\n\t}\n\treturn isArgs;\n};\n","var wrappy = require('wrappy')\nmodule.exports = wrappy(once)\nmodule.exports.strict = wrappy(onceStrict)\n\nonce.proto = once(function () {\n Object.defineProperty(Function.prototype, 'once', {\n value: function () {\n return once(this)\n },\n configurable: true\n })\n\n Object.defineProperty(Function.prototype, 'onceStrict', {\n value: function () {\n return onceStrict(this)\n },\n configurable: true\n })\n})\n\nfunction once (fn) {\n var f = function () {\n if (f.called) return f.value\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n f.called = false\n return f\n}\n\nfunction onceStrict (fn) {\n var f = function () {\n if (f.called)\n throw new Error(f.onceError)\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n var name = fn.name || 'Function wrapped with `once`'\n f.onceError = name + \" shouldn't be called more than once\"\n f.called = false\n return f\n}\n","// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js\n// Fedor, you are amazing.\n'use strict'\n\nvar asn1 = require('asn1.js')\n\nexports.certificate = require('./certificate')\n\nvar RSAPrivateKey = asn1.define('RSAPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('modulus').int(),\n this.key('publicExponent').int(),\n this.key('privateExponent').int(),\n this.key('prime1').int(),\n this.key('prime2').int(),\n this.key('exponent1').int(),\n this.key('exponent2').int(),\n this.key('coefficient').int()\n )\n})\nexports.RSAPrivateKey = RSAPrivateKey\n\nvar RSAPublicKey = asn1.define('RSAPublicKey', function () {\n this.seq().obj(\n this.key('modulus').int(),\n this.key('publicExponent').int()\n )\n})\nexports.RSAPublicKey = RSAPublicKey\n\nvar PublicKey = asn1.define('SubjectPublicKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPublicKey').bitstr()\n )\n})\nexports.PublicKey = PublicKey\n\nvar AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function () {\n this.seq().obj(\n this.key('algorithm').objid(),\n this.key('none').null_().optional(),\n this.key('curve').objid().optional(),\n this.key('params').seq().obj(\n this.key('p').int(),\n this.key('q').int(),\n this.key('g').int()\n ).optional()\n )\n})\n\nvar PrivateKeyInfo = asn1.define('PrivateKeyInfo', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPrivateKey').octstr()\n )\n})\nexports.PrivateKey = PrivateKeyInfo\nvar EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').seq().obj(\n this.key('id').objid(),\n this.key('decrypt').seq().obj(\n this.key('kde').seq().obj(\n this.key('id').objid(),\n this.key('kdeparams').seq().obj(\n this.key('salt').octstr(),\n this.key('iters').int()\n )\n ),\n this.key('cipher').seq().obj(\n this.key('algo').objid(),\n this.key('iv').octstr()\n )\n )\n ),\n this.key('subjectPrivateKey').octstr()\n )\n})\n\nexports.EncryptedPrivateKey = EncryptedPrivateKeyInfo\n\nvar DSAPrivateKey = asn1.define('DSAPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('p').int(),\n this.key('q').int(),\n this.key('g').int(),\n this.key('pub_key').int(),\n this.key('priv_key').int()\n )\n})\nexports.DSAPrivateKey = DSAPrivateKey\n\nexports.DSAparam = asn1.define('DSAparam', function () {\n this.int()\n})\n\nvar ECPrivateKey = asn1.define('ECPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('privateKey').octstr(),\n this.key('parameters').optional().explicit(0).use(ECParameters),\n this.key('publicKey').optional().explicit(1).bitstr()\n )\n})\nexports.ECPrivateKey = ECPrivateKey\n\nvar ECParameters = asn1.define('ECParameters', function () {\n this.choice({\n namedCurve: this.objid()\n })\n})\n\nexports.signature = asn1.define('signature', function () {\n this.seq().obj(\n this.key('r').int(),\n this.key('s').int()\n )\n})\n","// from https://github.com/Rantanen/node-dtls/blob/25a7dc861bda38cfeac93a723500eea4f0ac2e86/Certificate.js\n// thanks to @Rantanen\n\n'use strict'\n\nvar asn = require('asn1.js')\n\nvar Time = asn.define('Time', function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime()\n })\n})\n\nvar AttributeTypeValue = asn.define('AttributeTypeValue', function () {\n this.seq().obj(\n this.key('type').objid(),\n this.key('value').any()\n )\n})\n\nvar AlgorithmIdentifier = asn.define('AlgorithmIdentifier', function () {\n this.seq().obj(\n this.key('algorithm').objid(),\n this.key('parameters').optional(),\n this.key('curve').objid().optional()\n )\n})\n\nvar SubjectPublicKeyInfo = asn.define('SubjectPublicKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPublicKey').bitstr()\n )\n})\n\nvar RelativeDistinguishedName = asn.define('RelativeDistinguishedName', function () {\n this.setof(AttributeTypeValue)\n})\n\nvar RDNSequence = asn.define('RDNSequence', function () {\n this.seqof(RelativeDistinguishedName)\n})\n\nvar Name = asn.define('Name', function () {\n this.choice({\n rdnSequence: this.use(RDNSequence)\n })\n})\n\nvar Validity = asn.define('Validity', function () {\n this.seq().obj(\n this.key('notBefore').use(Time),\n this.key('notAfter').use(Time)\n )\n})\n\nvar Extension = asn.define('Extension', function () {\n this.seq().obj(\n this.key('extnID').objid(),\n this.key('critical').bool().def(false),\n this.key('extnValue').octstr()\n )\n})\n\nvar TBSCertificate = asn.define('TBSCertificate', function () {\n this.seq().obj(\n this.key('version').explicit(0).int().optional(),\n this.key('serialNumber').int(),\n this.key('signature').use(AlgorithmIdentifier),\n this.key('issuer').use(Name),\n this.key('validity').use(Validity),\n this.key('subject').use(Name),\n this.key('subjectPublicKeyInfo').use(SubjectPublicKeyInfo),\n this.key('issuerUniqueID').implicit(1).bitstr().optional(),\n this.key('subjectUniqueID').implicit(2).bitstr().optional(),\n this.key('extensions').explicit(3).seqof(Extension).optional()\n )\n})\n\nvar X509Certificate = asn.define('X509Certificate', function () {\n this.seq().obj(\n this.key('tbsCertificate').use(TBSCertificate),\n this.key('signatureAlgorithm').use(AlgorithmIdentifier),\n this.key('signatureValue').bitstr()\n )\n})\n\nmodule.exports = X509Certificate\n","// adapted from https://github.com/apatil/pemstrip\nvar findProc = /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m\nvar startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m\nvar fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m\nvar evp = require('evp_bytestokey')\nvar ciphers = require('browserify-aes')\nvar Buffer = require('safe-buffer').Buffer\nmodule.exports = function (okey, password) {\n var key = okey.toString()\n var match = key.match(findProc)\n var decrypted\n if (!match) {\n var match2 = key.match(fullRegex)\n decrypted = Buffer.from(match2[2].replace(/[\\r\\n]/g, ''), 'base64')\n } else {\n var suite = 'aes' + match[1]\n var iv = Buffer.from(match[2], 'hex')\n var cipherText = Buffer.from(match[3].replace(/[\\r\\n]/g, ''), 'base64')\n var cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key\n var out = []\n var cipher = ciphers.createDecipheriv(suite, cipherKey, iv)\n out.push(cipher.update(cipherText))\n out.push(cipher.final())\n decrypted = Buffer.concat(out)\n }\n var tag = key.match(startRegex)[1]\n return {\n tag: tag,\n data: decrypted\n }\n}\n","var asn1 = require('./asn1')\nvar aesid = require('./aesid.json')\nvar fixProc = require('./fixProc')\nvar ciphers = require('browserify-aes')\nvar compat = require('pbkdf2')\nvar Buffer = require('safe-buffer').Buffer\nmodule.exports = parseKeys\n\nfunction parseKeys (buffer) {\n var password\n if (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) {\n password = buffer.passphrase\n buffer = buffer.key\n }\n if (typeof buffer === 'string') {\n buffer = Buffer.from(buffer)\n }\n\n var stripped = fixProc(buffer, password)\n\n var type = stripped.tag\n var data = stripped.data\n var subtype, ndata\n switch (type) {\n case 'CERTIFICATE':\n ndata = asn1.certificate.decode(data, 'der').tbsCertificate.subjectPublicKeyInfo\n // falls through\n case 'PUBLIC KEY':\n if (!ndata) {\n ndata = asn1.PublicKey.decode(data, 'der')\n }\n subtype = ndata.algorithm.algorithm.join('.')\n switch (subtype) {\n case '1.2.840.113549.1.1.1':\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der')\n case '1.2.840.10045.2.1':\n ndata.subjectPrivateKey = ndata.subjectPublicKey\n return {\n type: 'ec',\n data: ndata\n }\n case '1.2.840.10040.4.1':\n ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der')\n return {\n type: 'dsa',\n data: ndata.algorithm.params\n }\n default: throw new Error('unknown key id ' + subtype)\n }\n // throw new Error('unknown key type ' + type)\n case 'ENCRYPTED PRIVATE KEY':\n data = asn1.EncryptedPrivateKey.decode(data, 'der')\n data = decrypt(data, password)\n // falls through\n case 'PRIVATE KEY':\n ndata = asn1.PrivateKey.decode(data, 'der')\n subtype = ndata.algorithm.algorithm.join('.')\n switch (subtype) {\n case '1.2.840.113549.1.1.1':\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der')\n case '1.2.840.10045.2.1':\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey\n }\n case '1.2.840.10040.4.1':\n ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der')\n return {\n type: 'dsa',\n params: ndata.algorithm.params\n }\n default: throw new Error('unknown key id ' + subtype)\n }\n // throw new Error('unknown key type ' + type)\n case 'RSA PUBLIC KEY':\n return asn1.RSAPublicKey.decode(data, 'der')\n case 'RSA PRIVATE KEY':\n return asn1.RSAPrivateKey.decode(data, 'der')\n case 'DSA PRIVATE KEY':\n return {\n type: 'dsa',\n params: asn1.DSAPrivateKey.decode(data, 'der')\n }\n case 'EC PRIVATE KEY':\n data = asn1.ECPrivateKey.decode(data, 'der')\n return {\n curve: data.parameters.value,\n privateKey: data.privateKey\n }\n default: throw new Error('unknown key type ' + type)\n }\n}\nparseKeys.signature = asn1.signature\nfunction decrypt (data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt\n var iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10)\n var algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')]\n var iv = data.algorithm.decrypt.cipher.iv\n var cipherText = data.subjectPrivateKey\n var keylen = parseInt(algo.split('-')[1], 10) / 8\n var key = compat.pbkdf2Sync(password, salt, iters, keylen, 'sha1')\n var cipher = ciphers.createDecipheriv(algo, key, iv)\n var out = []\n out.push(cipher.update(cipherText))\n out.push(cipher.final())\n return Buffer.concat(out)\n}\n","/*! parse-torrent. MIT License. WebTorrent LLC */\n/* global Blob */\n\nconst bencode = require('bencode')\nconst blobToBuffer = require('blob-to-buffer')\nconst fs = require('fs') // browser exclude\nconst get = require('simple-get')\nconst magnet = require('magnet-uri')\nconst path = require('path')\nconst sha1 = require('simple-sha1')\nconst queueMicrotask = require('queue-microtask')\n\nmodule.exports = parseTorrent\nmodule.exports.remote = parseTorrentRemote\n\nmodule.exports.toMagnetURI = magnet.encode\nmodule.exports.toTorrentFile = encodeTorrentFile\n\n/**\n * Parse a torrent identifier (magnet uri, .torrent file, info hash)\n * @param {string|Buffer|Object} torrentId\n * @return {Object}\n */\nfunction parseTorrent (torrentId) {\n if (typeof torrentId === 'string' && /^(stream-)?magnet:/.test(torrentId)) {\n // if magnet uri (string)\n const torrentObj = magnet(torrentId)\n\n // infoHash won't be defined if a non-bittorrent magnet is passed\n if (!torrentObj.infoHash) {\n throw new Error('Invalid torrent identifier')\n }\n\n return torrentObj\n } else if (typeof torrentId === 'string' && (/^[a-f0-9]{40}$/i.test(torrentId) || /^[a-z2-7]{32}$/i.test(torrentId))) {\n // if info hash (hex/base-32 string)\n return magnet(`magnet:?xt=urn:btih:${torrentId}`)\n } else if (Buffer.isBuffer(torrentId) && torrentId.length === 20) {\n // if info hash (buffer)\n return magnet(`magnet:?xt=urn:btih:${torrentId.toString('hex')}`)\n } else if (Buffer.isBuffer(torrentId)) {\n // if .torrent file (buffer)\n return decodeTorrentFile(torrentId) // might throw\n } else if (torrentId && torrentId.infoHash) {\n // if parsed torrent (from `parse-torrent` or `magnet-uri`)\n torrentId.infoHash = torrentId.infoHash.toLowerCase()\n\n if (!torrentId.announce) torrentId.announce = []\n\n if (typeof torrentId.announce === 'string') {\n torrentId.announce = [torrentId.announce]\n }\n\n if (!torrentId.urlList) torrentId.urlList = []\n\n return torrentId\n } else {\n throw new Error('Invalid torrent identifier')\n }\n}\n\nfunction parseTorrentRemote (torrentId, opts, cb) {\n if (typeof opts === 'function') return parseTorrentRemote(torrentId, {}, opts)\n if (typeof cb !== 'function') throw new Error('second argument must be a Function')\n\n let parsedTorrent\n try {\n parsedTorrent = parseTorrent(torrentId)\n } catch (err) {\n // If torrent fails to parse, it could be a Blob, http/https URL or\n // filesystem path, so don't consider it an error yet.\n }\n\n if (parsedTorrent && parsedTorrent.infoHash) {\n queueMicrotask(() => {\n cb(null, parsedTorrent)\n })\n } else if (isBlob(torrentId)) {\n blobToBuffer(torrentId, (err, torrentBuf) => {\n if (err) return cb(new Error(`Error converting Blob: ${err.message}`))\n parseOrThrow(torrentBuf)\n })\n } else if (typeof get === 'function' && /^https?:/.test(torrentId)) {\n // http, or https url to torrent file\n opts = Object.assign({\n url: torrentId,\n timeout: 30 * 1000,\n headers: { 'user-agent': 'WebTorrent (https://webtorrent.io)' }\n }, opts)\n get.concat(opts, (err, res, torrentBuf) => {\n if (err) return cb(new Error(`Error downloading torrent: ${err.message}`))\n parseOrThrow(torrentBuf)\n })\n } else if (typeof fs.readFile === 'function' && typeof torrentId === 'string') {\n // assume it's a filesystem path\n fs.readFile(torrentId, (err, torrentBuf) => {\n if (err) return cb(new Error('Invalid torrent identifier'))\n parseOrThrow(torrentBuf)\n })\n } else {\n queueMicrotask(() => {\n cb(new Error('Invalid torrent identifier'))\n })\n }\n\n function parseOrThrow (torrentBuf) {\n try {\n parsedTorrent = parseTorrent(torrentBuf)\n } catch (err) {\n return cb(err)\n }\n if (parsedTorrent && parsedTorrent.infoHash) cb(null, parsedTorrent)\n else cb(new Error('Invalid torrent identifier'))\n }\n}\n\n/**\n * Parse a torrent. Throws an exception if the torrent is missing required fields.\n * @param {Buffer|Object} torrent\n * @return {Object} parsed torrent\n */\nfunction decodeTorrentFile (torrent) {\n if (Buffer.isBuffer(torrent)) {\n torrent = bencode.decode(torrent)\n }\n\n // sanity check\n ensure(torrent.info, 'info')\n ensure(torrent.info['name.utf-8'] || torrent.info.name, 'info.name')\n ensure(torrent.info['piece length'], 'info[\\'piece length\\']')\n ensure(torrent.info.pieces, 'info.pieces')\n\n if (torrent.info.files) {\n torrent.info.files.forEach(file => {\n ensure(typeof file.length === 'number', 'info.files[0].length')\n ensure(file['path.utf-8'] || file.path, 'info.files[0].path')\n })\n } else {\n ensure(typeof torrent.info.length === 'number', 'info.length')\n }\n\n const result = {\n info: torrent.info,\n infoBuffer: bencode.encode(torrent.info),\n name: (torrent.info['name.utf-8'] || torrent.info.name).toString(),\n announce: []\n }\n\n result.infoHash = sha1.sync(result.infoBuffer)\n result.infoHashBuffer = Buffer.from(result.infoHash, 'hex')\n\n if (torrent.info.private !== undefined) result.private = !!torrent.info.private\n\n if (torrent['creation date']) result.created = new Date(torrent['creation date'] * 1000)\n if (torrent['created by']) result.createdBy = torrent['created by'].toString()\n\n if (Buffer.isBuffer(torrent.comment)) result.comment = torrent.comment.toString()\n\n // announce and announce-list will be missing if metadata fetched via ut_metadata\n if (Array.isArray(torrent['announce-list']) && torrent['announce-list'].length > 0) {\n torrent['announce-list'].forEach(urls => {\n urls.forEach(url => {\n result.announce.push(url.toString())\n })\n })\n } else if (torrent.announce) {\n result.announce.push(torrent.announce.toString())\n }\n\n // handle url-list (BEP19 / web seeding)\n if (Buffer.isBuffer(torrent['url-list'])) {\n // some clients set url-list to empty string\n torrent['url-list'] = torrent['url-list'].length > 0\n ? [torrent['url-list']]\n : []\n }\n result.urlList = (torrent['url-list'] || []).map(url => url.toString())\n\n // remove duplicates by converting to Set and back\n result.announce = Array.from(new Set(result.announce))\n result.urlList = Array.from(new Set(result.urlList))\n\n const files = torrent.info.files || [torrent.info]\n result.files = files.map((file, i) => {\n const parts = [].concat(result.name, file['path.utf-8'] || file.path || []).map(p => p.toString())\n return {\n path: path.join.apply(null, [path.sep].concat(parts)).slice(1),\n name: parts[parts.length - 1],\n length: file.length,\n offset: files.slice(0, i).reduce(sumLength, 0)\n }\n })\n\n result.length = files.reduce(sumLength, 0)\n\n const lastFile = result.files[result.files.length - 1]\n\n result.pieceLength = torrent.info['piece length']\n result.lastPieceLength = ((lastFile.offset + lastFile.length) % result.pieceLength) || result.pieceLength\n result.pieces = splitPieces(torrent.info.pieces)\n\n return result\n}\n\n/**\n * Convert a parsed torrent object back into a .torrent file buffer.\n * @param {Object} parsed parsed torrent\n * @return {Buffer}\n */\nfunction encodeTorrentFile (parsed) {\n const torrent = {\n info: parsed.info\n }\n\n torrent['announce-list'] = (parsed.announce || []).map(url => {\n if (!torrent.announce) torrent.announce = url\n url = Buffer.from(url, 'utf8')\n return [url]\n })\n\n torrent['url-list'] = parsed.urlList || []\n\n if (parsed.private !== undefined) {\n torrent.private = Number(parsed.private)\n }\n\n if (parsed.created) {\n torrent['creation date'] = (parsed.created.getTime() / 1000) | 0\n }\n\n if (parsed.createdBy) {\n torrent['created by'] = parsed.createdBy\n }\n\n if (parsed.comment) {\n torrent.comment = parsed.comment\n }\n\n return bencode.encode(torrent)\n}\n\n/**\n * Check if `obj` is a W3C `Blob` or `File` object\n * @param {*} obj\n * @return {boolean}\n */\nfunction isBlob (obj) {\n return typeof Blob !== 'undefined' && obj instanceof Blob\n}\n\nfunction sumLength (sum, file) {\n return sum + file.length\n}\n\nfunction splitPieces (buf) {\n const pieces = []\n for (let i = 0; i < buf.length; i += 20) {\n pieces.push(buf.slice(i, i + 20).toString('hex'))\n }\n return pieces\n}\n\nfunction ensure (bool, fieldName) {\n if (!bool) throw new Error(`Torrent is missing required field: ${fieldName}`)\n}\n\n// Workaround Browserify v13 bug\n// https://github.com/substack/node-browserify/issues/1483\n;(() => { Buffer.alloc(0) })()\n","// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\n\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\n'use strict';\n\nfunction assertPath(path) {\n if (typeof path !== 'string') {\n throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n var res = '';\n var lastSegmentLength = 0;\n var lastSlash = -1;\n var dots = 0;\n var code;\n for (var i = 0; i <= path.length; ++i) {\n if (i < path.length)\n code = path.charCodeAt(i);\n else if (code === 47 /*/*/)\n break;\n else\n code = 47 /*/*/;\n if (code === 47 /*/*/) {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (lastSlash !== i - 1 && dots === 2) {\n if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n if (res.length > 2) {\n var lastSlashIndex = res.lastIndexOf('/');\n if (lastSlashIndex !== res.length - 1) {\n if (lastSlashIndex === -1) {\n res = '';\n lastSegmentLength = 0;\n } else {\n res = res.slice(0, lastSlashIndex);\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n }\n lastSlash = i;\n dots = 0;\n continue;\n }\n } else if (res.length === 2 || res.length === 1) {\n res = '';\n lastSegmentLength = 0;\n lastSlash = i;\n dots = 0;\n continue;\n }\n }\n if (allowAboveRoot) {\n if (res.length > 0)\n res += '/..';\n else\n res = '..';\n lastSegmentLength = 2;\n }\n } else {\n if (res.length > 0)\n res += '/' + path.slice(lastSlash + 1, i);\n else\n res = path.slice(lastSlash + 1, i);\n lastSegmentLength = i - lastSlash - 1;\n }\n lastSlash = i;\n dots = 0;\n } else if (code === 46 /*.*/ && dots !== -1) {\n ++dots;\n } else {\n dots = -1;\n }\n }\n return res;\n}\n\nfunction _format(sep, pathObject) {\n var dir = pathObject.dir || pathObject.root;\n var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n if (!dir) {\n return base;\n }\n if (dir === pathObject.root) {\n return dir + base;\n }\n return dir + sep + base;\n}\n\nvar posix = {\n // path.resolve([from ...], to)\n resolve: function resolve() {\n var resolvedPath = '';\n var resolvedAbsolute = false;\n var cwd;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path;\n if (i >= 0)\n path = arguments[i];\n else {\n if (cwd === undefined)\n cwd = process.cwd();\n path = cwd;\n }\n\n assertPath(path);\n\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n if (resolvedAbsolute) {\n if (resolvedPath.length > 0)\n return '/' + resolvedPath;\n else\n return '/';\n } else if (resolvedPath.length > 0) {\n return resolvedPath;\n } else {\n return '.';\n }\n },\n\n normalize: function normalize(path) {\n assertPath(path);\n\n if (path.length === 0) return '.';\n\n var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n // Normalize the path\n path = normalizeStringPosix(path, !isAbsolute);\n\n if (path.length === 0 && !isAbsolute) path = '.';\n if (path.length > 0 && trailingSeparator) path += '/';\n\n if (isAbsolute) return '/' + path;\n return path;\n },\n\n isAbsolute: function isAbsolute(path) {\n assertPath(path);\n return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n },\n\n join: function join() {\n if (arguments.length === 0)\n return '.';\n var joined;\n for (var i = 0; i < arguments.length; ++i) {\n var arg = arguments[i];\n assertPath(arg);\n if (arg.length > 0) {\n if (joined === undefined)\n joined = arg;\n else\n joined += '/' + arg;\n }\n }\n if (joined === undefined)\n return '.';\n return posix.normalize(joined);\n },\n\n relative: function relative(from, to) {\n assertPath(from);\n assertPath(to);\n\n if (from === to) return '';\n\n from = posix.resolve(from);\n to = posix.resolve(to);\n\n if (from === to) return '';\n\n // Trim any leading backslashes\n var fromStart = 1;\n for (; fromStart < from.length; ++fromStart) {\n if (from.charCodeAt(fromStart) !== 47 /*/*/)\n break;\n }\n var fromEnd = from.length;\n var fromLen = fromEnd - fromStart;\n\n // Trim any leading backslashes\n var toStart = 1;\n for (; toStart < to.length; ++toStart) {\n if (to.charCodeAt(toStart) !== 47 /*/*/)\n break;\n }\n var toEnd = to.length;\n var toLen = toEnd - toStart;\n\n // Compare paths to find the longest common path from root\n var length = fromLen < toLen ? fromLen : toLen;\n var lastCommonSep = -1;\n var i = 0;\n for (; i <= length; ++i) {\n if (i === length) {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='/foo/bar'; to='/foo/bar/baz'\n return to.slice(toStart + i + 1);\n } else if (i === 0) {\n // We get here if `from` is the root\n // For example: from='/'; to='/foo'\n return to.slice(toStart + i);\n }\n } else if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='/foo/bar/baz'; to='/foo/bar'\n lastCommonSep = i;\n } else if (i === 0) {\n // We get here if `to` is the root.\n // For example: from='/foo'; to='/'\n lastCommonSep = 0;\n }\n }\n break;\n }\n var fromCode = from.charCodeAt(fromStart + i);\n var toCode = to.charCodeAt(toStart + i);\n if (fromCode !== toCode)\n break;\n else if (fromCode === 47 /*/*/)\n lastCommonSep = i;\n }\n\n var out = '';\n // Generate the relative path based on the path difference between `to`\n // and `from`\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n if (out.length === 0)\n out += '..';\n else\n out += '/..';\n }\n }\n\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts\n if (out.length > 0)\n return out + to.slice(toStart + lastCommonSep);\n else {\n toStart += lastCommonSep;\n if (to.charCodeAt(toStart) === 47 /*/*/)\n ++toStart;\n return to.slice(toStart);\n }\n },\n\n _makeLong: function _makeLong(path) {\n return path;\n },\n\n dirname: function dirname(path) {\n assertPath(path);\n if (path.length === 0) return '.';\n var code = path.charCodeAt(0);\n var hasRoot = code === 47 /*/*/;\n var end = -1;\n var matchedSlash = true;\n for (var i = path.length - 1; i >= 1; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n } else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n\n if (end === -1) return hasRoot ? '/' : '.';\n if (hasRoot && end === 1) return '//';\n return path.slice(0, end);\n },\n\n basename: function basename(path, ext) {\n if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n assertPath(path);\n\n var start = 0;\n var end = -1;\n var matchedSlash = true;\n var i;\n\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext.length === path.length && ext === path) return '';\n var extIdx = ext.length - 1;\n var firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n } else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n\n if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n return path.slice(start, end);\n } else {\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n\n if (end === -1) return '';\n return path.slice(start, end);\n }\n },\n\n extname: function extname(path) {\n assertPath(path);\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n for (var i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1)\n startDot = i;\n else if (preDotState !== 1)\n preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n return '';\n }\n return path.slice(startDot, end);\n },\n\n format: function format(pathObject) {\n if (pathObject === null || typeof pathObject !== 'object') {\n throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n }\n return _format('/', pathObject);\n },\n\n parse: function parse(path) {\n assertPath(path);\n\n var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) return ret;\n var code = path.charCodeAt(0);\n var isAbsolute = code === 47 /*/*/;\n var start;\n if (isAbsolute) {\n ret.root = '/';\n start = 1;\n } else {\n start = 0;\n }\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n var i = path.length - 1;\n\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n\n // Get non-dir info\n for (; i >= start; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n if (end !== -1) {\n if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n }\n } else {\n if (startPart === 0 && isAbsolute) {\n ret.name = path.slice(1, startDot);\n ret.base = path.slice(1, end);\n } else {\n ret.name = path.slice(startPart, startDot);\n ret.base = path.slice(startPart, end);\n }\n ret.ext = path.slice(startDot, end);\n }\n\n if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n return ret;\n },\n\n sep: '/',\n delimiter: ':',\n win32: null,\n posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n","exports.pbkdf2 = require('./lib/async')\nexports.pbkdf2Sync = require('./lib/sync')\n","var Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar sync = require('./sync')\nvar toBuffer = require('./to-buffer')\n\nvar ZERO_BUF\nvar subtle = global.crypto && global.crypto.subtle\nvar toBrowser = {\n sha: 'SHA-1',\n 'sha-1': 'SHA-1',\n sha1: 'SHA-1',\n sha256: 'SHA-256',\n 'sha-256': 'SHA-256',\n sha384: 'SHA-384',\n 'sha-384': 'SHA-384',\n 'sha-512': 'SHA-512',\n sha512: 'SHA-512'\n}\nvar checks = []\nfunction checkNative (algo) {\n if (global.process && !global.process.browser) {\n return Promise.resolve(false)\n }\n if (!subtle || !subtle.importKey || !subtle.deriveBits) {\n return Promise.resolve(false)\n }\n if (checks[algo] !== undefined) {\n return checks[algo]\n }\n ZERO_BUF = ZERO_BUF || Buffer.alloc(8)\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return true\n }).catch(function () {\n return false\n })\n checks[algo] = prom\n return prom\n}\nvar nextTick\nfunction getNextTick () {\n if (nextTick) {\n return nextTick\n }\n if (global.process && global.process.nextTick) {\n nextTick = global.process.nextTick\n } else if (global.queueMicrotask) {\n nextTick = global.queueMicrotask\n } else if (global.setImmediate) {\n nextTick = global.setImmediate\n } else {\n nextTick = global.setTimeout\n }\n return nextTick\n}\nfunction browserPbkdf2 (password, salt, iterations, length, algo) {\n return subtle.importKey(\n 'raw', password, { name: 'PBKDF2' }, false, ['deriveBits']\n ).then(function (key) {\n return subtle.deriveBits({\n name: 'PBKDF2',\n salt: salt,\n iterations: iterations,\n hash: {\n name: algo\n }\n }, key, length << 3)\n }).then(function (res) {\n return Buffer.from(res)\n })\n}\n\nfunction resolvePromise (promise, callback) {\n promise.then(function (out) {\n getNextTick()(function () {\n callback(null, out)\n })\n }, function (e) {\n getNextTick()(function () {\n callback(e)\n })\n })\n}\nmodule.exports = function (password, salt, iterations, keylen, digest, callback) {\n if (typeof digest === 'function') {\n callback = digest\n digest = undefined\n }\n\n digest = digest || 'sha1'\n var algo = toBrowser[digest.toLowerCase()]\n\n if (!algo || typeof global.Promise !== 'function') {\n getNextTick()(function () {\n var out\n try {\n out = sync(password, salt, iterations, keylen, digest)\n } catch (e) {\n return callback(e)\n }\n callback(null, out)\n })\n return\n }\n\n checkParameters(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2')\n\n resolvePromise(checkNative(algo).then(function (resp) {\n if (resp) return browserPbkdf2(password, salt, iterations, keylen, algo)\n\n return sync(password, salt, iterations, keylen, digest)\n }), callback)\n}\n","var defaultEncoding\n/* istanbul ignore next */\nif (global.process && global.process.browser) {\n defaultEncoding = 'utf-8'\n} else if (global.process && global.process.version) {\n var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10)\n\n defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary'\n} else {\n defaultEncoding = 'utf-8'\n}\nmodule.exports = defaultEncoding\n","var MAX_ALLOC = Math.pow(2, 30) - 1 // default in iojs\n\nmodule.exports = function (iterations, keylen) {\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) { /* eslint no-self-compare: 0 */\n throw new TypeError('Bad key length')\n }\n}\n","var md5 = require('create-hash/md5')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar toBuffer = require('./to-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 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 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(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n\n digest = digest || 'sha1'\n\n var hmac = new Hmac(digest, password, salt.length)\n\n var DK = Buffer.allocUnsafe(keylen)\n var block1 = Buffer.allocUnsafe(salt.length + 4)\n salt.copy(block1, 0, 0, salt.length)\n\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\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 for (var k = 0; k < hLen; k++) T[k] ^= U[k]\n }\n\n T.copy(DK, destPos)\n destPos += hLen\n }\n\n return DK\n}\n\nmodule.exports = pbkdf2\n","var Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (thing, encoding, name) {\n if (Buffer.isBuffer(thing)) {\n return thing\n } else if (typeof thing === 'string') {\n return Buffer.from(thing, encoding)\n } else if (ArrayBuffer.isView(thing)) {\n return Buffer.from(thing.buffer)\n } else {\n throw new TypeError(name + ' must be a string, a Buffer, a typed array or a DataView')\n }\n}\n","module.exports = length\n\nfunction length (bytes) {\n return Math.max(16384, 1 << Math.log2(bytes < 1024 ? 1 : bytes / 1024) + 0.5 | 0)\n}\n","const process = module.exports = {}\n\nprocess.title = 'browser'\nprocess.browser = true\nprocess.env = {}\nprocess.argv = []\nprocess.version = ''\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.nextTick = (func, ...args) => window.queueMicrotask(() => func(...args))\n\nprocess.listeners = (name) => []\n\nprocess.cwd = () => '/'\nprocess.umask = () => 0\nprocess.binding = (name) => { throw new Error('process.binding is not supported') }\nprocess.chdir = (dir) => { throw new Error('process.chdir is not supported') }\n","exports.publicEncrypt = require('./publicEncrypt')\nexports.privateDecrypt = require('./privateDecrypt')\n\nexports.privateEncrypt = function privateEncrypt (key, buf) {\n return exports.publicEncrypt(key, buf, true)\n}\n\nexports.publicDecrypt = function publicDecrypt (key, buf) {\n return exports.privateDecrypt(key, buf, true)\n}\n","var createHash = require('create-hash')\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 while (t.length < len) {\n c = i2ops(i++)\n t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()])\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}\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","var parseKeys = require('parse-asn1')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar crt = require('browserify-rsa')\nvar createHash = require('create-hash')\nvar withPublic = require('./withPublic')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function privateDecrypt (privateKey, enc, reverse) {\n var padding\n if (privateKey.padding) {\n padding = privateKey.padding\n } else if (reverse) {\n padding = 1\n } else {\n padding = 4\n }\n\n var key = parseKeys(privateKey)\n var k = key.modulus.byteLength()\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) {\n throw new Error('decryption error')\n }\n var msg\n if (reverse) {\n msg = withPublic(new BN(enc), key)\n } else {\n msg = crt(enc, key)\n }\n var zBuffer = Buffer.alloc(k - msg.length)\n msg = Buffer.concat([zBuffer, msg], k)\n if (padding === 4) {\n return oaep(key, msg)\n } else if (padding === 1) {\n return pkcs1(key, msg, reverse)\n } else if (padding === 3) {\n return msg\n } else {\n throw new Error('unknown padding')\n }\n}\n\nfunction oaep (key, msg) {\n var k = key.modulus.byteLength()\n var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n var hLen = iHash.length\n if (msg[0] !== 0) {\n throw new Error('decryption error')\n }\n var maskedSeed = msg.slice(1, hLen + 1)\n var maskedDb = msg.slice(hLen + 1)\n var seed = xor(maskedSeed, mgf(maskedDb, hLen))\n var db = xor(maskedDb, mgf(seed, k - hLen - 1))\n if (compare(iHash, db.slice(0, hLen))) {\n throw new Error('decryption error')\n }\n var i = hLen\n while (db[i] === 0) {\n i++\n }\n if (db[i++] !== 1) {\n throw new Error('decryption error')\n }\n return db.slice(i)\n}\n\nfunction pkcs1 (key, msg, reverse) {\n var p1 = msg.slice(0, 2)\n var i = 2\n var status = 0\n while (msg[i++] !== 0) {\n if (i >= msg.length) {\n status++\n break\n }\n }\n var ps = msg.slice(2, i - 1)\n\n if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)) {\n status++\n }\n if (ps.length < 8) {\n status++\n }\n if (status) {\n throw new Error('decryption error')\n }\n return msg.slice(i)\n}\nfunction compare (a, b) {\n a = Buffer.from(a)\n b = Buffer.from(b)\n var dif = 0\n var len = a.length\n if (a.length !== b.length) {\n dif++\n len = Math.min(a.length, b.length)\n }\n var i = -1\n while (++i < len) {\n dif += (a[i] ^ b[i])\n }\n return dif\n}\n","var parseKeys = require('parse-asn1')\nvar randomBytes = require('randombytes')\nvar createHash = require('create-hash')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar withPublic = require('./withPublic')\nvar crt = require('browserify-rsa')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function publicEncrypt (publicKey, msg, reverse) {\n var padding\n if (publicKey.padding) {\n padding = publicKey.padding\n } else if (reverse) {\n padding = 1\n } else {\n padding = 4\n }\n var key = parseKeys(publicKey)\n var paddedMsg\n if (padding === 4) {\n paddedMsg = oaep(key, msg)\n } else if (padding === 1) {\n paddedMsg = pkcs1(key, msg, reverse)\n } else if (padding === 3) {\n paddedMsg = new BN(msg)\n if (paddedMsg.cmp(key.modulus) >= 0) {\n throw new Error('data too long for modulus')\n }\n } else {\n throw new Error('unknown padding')\n }\n if (reverse) {\n return crt(paddedMsg, key)\n } else {\n return withPublic(paddedMsg, key)\n }\n}\n\nfunction oaep (key, msg) {\n var k = key.modulus.byteLength()\n var mLen = msg.length\n var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n var hLen = iHash.length\n var hLen2 = 2 * hLen\n if (mLen > k - hLen2 - 2) {\n throw new Error('message too long')\n }\n var ps = Buffer.alloc(k - mLen - hLen2 - 2)\n var dblen = k - hLen - 1\n var seed = randomBytes(hLen)\n var maskedDb = xor(Buffer.concat([iHash, ps, Buffer.alloc(1, 1), msg], dblen), mgf(seed, dblen))\n var maskedSeed = xor(seed, mgf(maskedDb, hLen))\n return new BN(Buffer.concat([Buffer.alloc(1), maskedSeed, maskedDb], k))\n}\nfunction pkcs1 (key, msg, reverse) {\n var mLen = msg.length\n var k = key.modulus.byteLength()\n if (mLen > k - 11) {\n throw new Error('message too long')\n }\n var ps\n if (reverse) {\n ps = Buffer.alloc(k - mLen - 3, 0xff)\n } else {\n ps = nonZero(k - mLen - 3)\n }\n return new BN(Buffer.concat([Buffer.from([0, reverse ? 1 : 2]), ps, Buffer.alloc(1), msg], k))\n}\nfunction nonZero (len) {\n var out = Buffer.allocUnsafe(len)\n var i = 0\n var cache = randomBytes(len * 2)\n var cur = 0\n var num\n while (i < len) {\n if (cur === cache.length) {\n cache = randomBytes(len * 2)\n cur = 0\n }\n num = cache[cur++]\n if (num) {\n out[i++] = num\n }\n }\n return out\n}\n","var BN = require('bn.js')\nvar Buffer = require('safe-buffer').Buffer\n\nfunction withPublic (paddedMsg, key) {\n return Buffer.from(paddedMsg\n .toRed(BN.mont(key.modulus))\n .redPow(new BN(key.publicExponent))\n .fromRed()\n .toArray())\n}\n\nmodule.exports = withPublic\n","module.exports = function xor (a, b) {\n var len = a.length\n var i = -1\n while (++i < len) {\n a[i] ^= b[i]\n }\n return a\n}\n","var once = require('once')\nvar eos = require('end-of-stream')\nvar fs = require('fs') // we only need fs to get the ReadStream and WriteStream prototypes\n\nvar noop = function () {}\nvar ancient = /^v?\\.0/.test(process.version)\n\nvar isFn = function (fn) {\n return typeof fn === 'function'\n}\n\nvar isFS = function (stream) {\n if (!ancient) return false // newer node version do not need to care about fs is a special way\n if (!fs) return false // browser\n return (stream instanceof (fs.ReadStream || noop) || stream instanceof (fs.WriteStream || noop)) && isFn(stream.close)\n}\n\nvar isRequest = function (stream) {\n return stream.setHeader && isFn(stream.abort)\n}\n\nvar destroyer = function (stream, reading, writing, callback) {\n callback = once(callback)\n\n var closed = false\n stream.on('close', function () {\n closed = true\n })\n\n eos(stream, {readable: reading, writable: writing}, function (err) {\n if (err) return callback(err)\n closed = true\n callback()\n })\n\n var destroyed = false\n return function (err) {\n if (closed) return\n if (destroyed) return\n destroyed = true\n\n if (isFS(stream)) return stream.close(noop) // use close for fs streams to avoid fd leaks\n if (isRequest(stream)) return stream.abort() // request.destroy just do .end - .abort is what we want\n\n if (isFn(stream.destroy)) return stream.destroy()\n\n callback(err || new Error('stream was destroyed'))\n }\n}\n\nvar call = function (fn) {\n fn()\n}\n\nvar pipe = function (from, to) {\n return from.pipe(to)\n}\n\nvar pump = function () {\n var streams = Array.prototype.slice.call(arguments)\n var callback = isFn(streams[streams.length - 1] || noop) && streams.pop() || noop\n\n if (Array.isArray(streams[0])) streams = streams[0]\n if (streams.length < 2) throw new Error('pump requires two streams per minimum')\n\n var error\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1\n var writing = i > 0\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err\n if (err) destroys.forEach(call)\n if (reading) return\n destroys.forEach(call)\n callback(error)\n })\n })\n\n return streams.reduce(pipe)\n}\n\nmodule.exports = pump\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\n'use strict';\n\n// If obj.hasOwnProperty has been overridden, then calling\n// obj.hasOwnProperty(prop) will break.\n// See: https://github.com/joyent/node/issues/1707\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nmodule.exports = function(qs, sep, eq, options) {\n sep = sep || '&';\n eq = eq || '=';\n var obj = {};\n\n if (typeof qs !== 'string' || qs.length === 0) {\n return obj;\n }\n\n var regexp = /\\+/g;\n qs = qs.split(sep);\n\n var maxKeys = 1000;\n if (options && typeof options.maxKeys === 'number') {\n maxKeys = options.maxKeys;\n }\n\n var len = qs.length;\n // maxKeys <= 0 means that we should not limit keys count\n if (maxKeys > 0 && len > maxKeys) {\n len = maxKeys;\n }\n\n for (var i = 0; i < len; ++i) {\n var x = qs[i].replace(regexp, '%20'),\n idx = x.indexOf(eq),\n kstr, vstr, k, v;\n\n if (idx >= 0) {\n kstr = x.substr(0, idx);\n vstr = x.substr(idx + 1);\n } else {\n kstr = x;\n vstr = '';\n }\n\n k = decodeURIComponent(kstr);\n v = decodeURIComponent(vstr);\n\n if (!hasOwnProperty(obj, k)) {\n obj[k] = v;\n } else if (Array.isArray(obj[k])) {\n obj[k].push(v);\n } else {\n obj[k] = [obj[k], v];\n }\n }\n\n return obj;\n};\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\n'use strict';\n\nvar stringifyPrimitive = function(v) {\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 isFinite(v) ? v : '';\n\n default:\n return '';\n }\n};\n\nmodule.exports = function(obj, sep, eq, name) {\n sep = sep || '&';\n eq = eq || '=';\n if (obj === null) {\n obj = undefined;\n }\n\n if (typeof obj === 'object') {\n return Object.keys(obj).map(function(k) {\n var ks = encodeURIComponent(stringifyPrimitive(k)) + eq;\n if (Array.isArray(obj[k])) {\n return obj[k].map(function(v) {\n return ks + encodeURIComponent(stringifyPrimitive(v));\n }).join(sep);\n } else {\n return ks + encodeURIComponent(stringifyPrimitive(obj[k]));\n }\n }).join(sep);\n\n }\n\n if (!name) return '';\n return encodeURIComponent(stringifyPrimitive(name)) + eq +\n encodeURIComponent(stringifyPrimitive(obj));\n};\n","'use strict';\n\nexports.decode = exports.parse = require('./decode');\nexports.encode = exports.stringify = require('./encode');\n","/*! queue-microtask. MIT License. Feross Aboukhadijeh */\nlet promise\n\nmodule.exports = typeof queueMicrotask === 'function'\n ? queueMicrotask.bind(typeof window !== 'undefined' ? window : global)\n // reuse resolved promise, and allocate it lazily\n : cb => (promise || (promise = Promise.resolve()))\n .then(cb)\n .catch(err => setTimeout(() => { throw err }, 0))\n","module.exports = typeof queueMicrotask === 'function' ? queueMicrotask : (fn) => Promise.resolve().then(fn)\n","var iterate = function (list) {\n var offset = 0\n return function () {\n if (offset === list.length) return null\n\n var len = list.length - offset\n var i = (Math.random() * len) | 0\n var el = list[offset + i]\n\n var tmp = list[offset]\n list[offset] = el\n list[offset + i] = tmp\n offset++\n\n return el\n }\n}\n\nmodule.exports = iterate\n","'use strict'\n\n// limit of Crypto.getRandomValues()\n// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues\nvar MAX_BYTES = 65536\n\n// Node supports requesting up to this number of bytes\n// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48\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\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\n var bytes = Buffer.allocUnsafe(size)\n\n if (size > 0) { // getRandomValues fails on IE if size == 0\n if (size > MAX_BYTES) { // 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}\n","'use strict'\n\nfunction oldBrowser () {\n throw new Error('secure random number generation not supported by this browser\\nuse chrome, FireFox or Internet Explorer 11')\n}\nvar safeBuffer = require('safe-buffer')\nvar randombytes = require('randombytes')\nvar Buffer = safeBuffer.Buffer\nvar kBufferMaxLength = safeBuffer.kMaxLength\nvar crypto = global.crypto || global.msCrypto\nvar kMaxUint32 = Math.pow(2, 32) - 1\nfunction assertOffset (offset, length) {\n if (typeof offset !== 'number' || offset !== offset) { // eslint-disable-line no-self-compare\n throw new TypeError('offset must be a number')\n }\n\n if (offset > kMaxUint32 || offset < 0) {\n throw new TypeError('offset must be a uint32')\n }\n\n if (offset > kBufferMaxLength || offset > length) {\n throw new RangeError('offset out of range')\n }\n}\n\nfunction assertSize (size, offset, length) {\n if (typeof size !== 'number' || size !== size) { // eslint-disable-line no-self-compare\n throw new TypeError('size must be a number')\n }\n\n if (size > kMaxUint32 || size < 0) {\n throw new TypeError('size must be a uint32')\n }\n\n if (size + offset > length || size > kBufferMaxLength) {\n throw new RangeError('buffer too small')\n }\n}\nif ((crypto && crypto.getRandomValues) || !process.browser) {\n exports.randomFill = randomFill\n exports.randomFillSync = randomFillSync\n} else {\n exports.randomFill = oldBrowser\n exports.randomFillSync = oldBrowser\n}\nfunction randomFill (buf, offset, size, cb) {\n if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n }\n\n if (typeof offset === 'function') {\n cb = offset\n offset = 0\n size = buf.length\n } else if (typeof size === 'function') {\n cb = size\n size = buf.length - offset\n } else if (typeof cb !== 'function') {\n throw new TypeError('\"cb\" argument must be a function')\n }\n assertOffset(offset, buf.length)\n assertSize(size, offset, buf.length)\n return actualFill(buf, offset, size, cb)\n}\n\nfunction actualFill (buf, offset, size, cb) {\n if (process.browser) {\n var ourBuf = buf.buffer\n var uint = new Uint8Array(ourBuf, offset, size)\n crypto.getRandomValues(uint)\n if (cb) {\n process.nextTick(function () {\n cb(null, buf)\n })\n return\n }\n return buf\n }\n if (cb) {\n randombytes(size, function (err, bytes) {\n if (err) {\n return cb(err)\n }\n bytes.copy(buf, offset)\n cb(null, buf)\n })\n return\n }\n var bytes = randombytes(size)\n bytes.copy(buf, offset)\n return buf\n}\nfunction randomFillSync (buf, offset, size) {\n if (typeof offset === 'undefined') {\n offset = 0\n }\n if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n }\n\n assertOffset(offset, buf.length)\n\n if (size === undefined) size = buf.length - offset\n\n assertSize(size, offset, buf.length)\n\n return actualFill(buf, offset, size)\n}\n","/*!\n * range-parser\n * Copyright(c) 2012-2014 TJ Holowaychuk\n * Copyright(c) 2015-2016 Douglas Christopher Wilson\n * MIT Licensed\n */\n\n'use strict'\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = rangeParser\n\n/**\n * Parse \"Range\" header `str` relative to the given file `size`.\n *\n * @param {Number} size\n * @param {String} str\n * @param {Object} [options]\n * @return {Array}\n * @public\n */\n\nfunction rangeParser (size, str, options) {\n if (typeof str !== 'string') {\n throw new TypeError('argument str must be a string')\n }\n\n var index = str.indexOf('=')\n\n if (index === -1) {\n return -2\n }\n\n // split the range string\n var arr = str.slice(index + 1).split(',')\n var ranges = []\n\n // add ranges type\n ranges.type = str.slice(0, index)\n\n // parse all ranges\n for (var i = 0; i < arr.length; i++) {\n var range = arr[i].split('-')\n var start = parseInt(range[0], 10)\n var end = parseInt(range[1], 10)\n\n // -nnn\n if (isNaN(start)) {\n start = size - end\n end = size - 1\n // nnn-\n } else if (isNaN(end)) {\n end = size - 1\n }\n\n // limit last-byte-pos to current length\n if (end > size - 1) {\n end = size - 1\n }\n\n // invalid or unsatisifiable\n if (isNaN(start) || isNaN(end) || start > end || start < 0) {\n continue\n }\n\n // add range\n ranges.push({\n start: start,\n end: end\n })\n }\n\n if (ranges.length < 1) {\n // unsatisifiable\n return -1\n }\n\n return options && options.combine\n ? combineRanges(ranges)\n : ranges\n}\n\n/**\n * Combine overlapping & adjacent ranges.\n * @private\n */\n\nfunction combineRanges (ranges) {\n var ordered = ranges.map(mapWithIndex).sort(sortByRangeStart)\n\n for (var j = 0, i = 1; i < ordered.length; i++) {\n var range = ordered[i]\n var current = ordered[j]\n\n if (range.start > current.end + 1) {\n // next range\n ordered[++j] = range\n } else if (range.end > current.end) {\n // extend range\n current.end = range.end\n current.index = Math.min(current.index, range.index)\n }\n }\n\n // trim ordered array\n ordered.length = j + 1\n\n // generate combined range\n var combined = ordered.sort(sortByRangeIndex).map(mapWithoutIndex)\n\n // copy ranges type\n combined.type = ranges.type\n\n return combined\n}\n\n/**\n * Map function to add index value to ranges.\n * @private\n */\n\nfunction mapWithIndex (range, index) {\n return {\n start: range.start,\n end: range.end,\n index: index\n }\n}\n\n/**\n * Map function to remove index value from ranges.\n * @private\n */\n\nfunction mapWithoutIndex (range) {\n return {\n start: range.start,\n end: range.end\n }\n}\n\n/**\n * Sort function to sort ranges by index.\n * @private\n */\n\nfunction sortByRangeIndex (a, b) {\n return a.index - b.index\n}\n\n/**\n * Sort function to sort ranges by start position.\n * @private\n */\n\nfunction sortByRangeStart (a, b) {\n return a.start - b.start\n}\n","/*\nInstance of writable stream.\n\ncall .get(length) or .discard(length) to get a stream (relative to the last end)\n\nemits 'stalled' once everything is written\n\n*/\nconst { Writable, PassThrough } = require('readable-stream')\n\nclass RangeSliceStream extends Writable {\n constructor (offset, opts = {}) {\n super(opts)\n\n this.destroyed = false\n this._queue = []\n this._position = offset || 0\n this._cb = null\n this._buffer = null\n this._out = null\n }\n\n _write (chunk, encoding, cb) {\n let drained = true\n\n while (true) {\n if (this.destroyed) {\n return\n }\n\n // Wait for more queue entries\n if (this._queue.length === 0) {\n this._buffer = chunk\n this._cb = cb\n return\n }\n\n this._buffer = null\n var currRange = this._queue[0]\n // Relative to the start of chunk, what data do we need?\n const writeStart = Math.max(currRange.start - this._position, 0)\n const writeEnd = currRange.end - this._position\n\n // Check if we need to throw it all away\n if (writeStart >= chunk.length) {\n this._position += chunk.length\n return cb(null)\n }\n\n // Check if we need to use it all\n let toWrite\n if (writeEnd > chunk.length) {\n this._position += chunk.length\n if (writeStart === 0) {\n toWrite = chunk\n } else {\n toWrite = chunk.slice(writeStart)\n }\n drained = currRange.stream.write(toWrite) && drained\n break\n }\n\n this._position += writeEnd\n\n toWrite = (writeStart === 0 && writeEnd === chunk.length)\n ? chunk\n : chunk.slice(writeStart, writeEnd)\n\n drained = currRange.stream.write(toWrite) && drained\n if (currRange.last) {\n currRange.stream.end()\n }\n chunk = chunk.slice(writeEnd)\n this._queue.shift()\n }\n\n if (drained) {\n cb(null)\n } else {\n currRange.stream.once('drain', cb.bind(null, null))\n }\n }\n\n slice (ranges) {\n if (this.destroyed) return null\n\n if (!Array.isArray(ranges)) ranges = [ranges]\n\n const str = new PassThrough()\n\n ranges.forEach((range, i) => {\n this._queue.push({\n start: range.start,\n end: range.end,\n stream: str,\n last: i === ranges.length - 1\n })\n })\n\n if (this._buffer) {\n this._write(this._buffer, null, this._cb)\n }\n\n return str\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n\n if (err) this.emit('error', err)\n }\n}\n\nmodule.exports = RangeSliceStream\n","\"use strict\";\n\n// Based on RC4 algorithm, as described in\n// http://en.wikipedia.org/wiki/RC4\n\nfunction isInteger(n) {\n return parseInt(n, 10) === n;\n}\n\nfunction createRC4(N) {\n function identityPermutation() {\n var s = new Array(N);\n for (var i = 0; i < N; i++) {\n s[i] = i;\n }\n return s;\n }\n\n // :: string | array integer -> array integer\n function seed(key) {\n if (key === undefined) {\n key = new Array(N);\n for (var k = 0; k < N; k++) {\n key[k] = Math.floor(Math.random() * N);\n }\n } else if (typeof key === \"string\") {\n // to string\n key = \"\" + key;\n key = key.split(\"\").map(function (c) { return c.charCodeAt(0) % N; });\n } else if (Array.isArray(key)) {\n if (!key.every(function (v) {\n return typeof v === \"number\" && v === (v | 0);\n })) {\n throw new TypeError(\"invalid seed key specified: not array of integers\");\n }\n } else {\n throw new TypeError(\"invalid seed key specified\");\n }\n\n var keylen = key.length;\n\n // resed state\n var s = identityPermutation();\n\n var j = 0;\n for (var i = 0; i < N; i++) {\n j = (j + s[i] + key[i % keylen]) % N;\n var tmp = s[i];\n s[i] = s[j];\n s[j] = tmp;\n }\n\n return s;\n }\n\n /* eslint-disable no-shadow */\n function RC4(key) {\n this.s = seed(key);\n this.i = 0;\n this.j = 0;\n }\n /* eslint-enable no-shadow */\n\n RC4.prototype.randomNative = function () {\n this.i = (this.i + 1) % N;\n this.j = (this.j + this.s[this.i]) % N;\n\n var tmp = this.s[this.i];\n this.s[this.i] = this.s[this.j];\n this.s[this.j] = tmp;\n\n var k = this.s[(this.s[this.i] + this.s[this.j]) % N];\n\n return k;\n };\n\n RC4.prototype.randomUInt32 = function () {\n var a = this.randomByte();\n var b = this.randomByte();\n var c = this.randomByte();\n var d = this.randomByte();\n\n return ((a * 256 + b) * 256 + c) * 256 + d;\n };\n\n RC4.prototype.randomFloat = function () {\n return this.randomUInt32() / 0x100000000;\n };\n\n RC4.prototype.random = function () {\n var a;\n var b;\n\n if (arguments.length === 1) {\n a = 0;\n b = arguments[0];\n } else if (arguments.length === 2) {\n a = arguments[0];\n b = arguments[1];\n } else {\n throw new TypeError(\"random takes one or two integer arguments\");\n }\n\n if (!isInteger(a) || !isInteger(b)) {\n throw new TypeError(\"random takes one or two integer arguments\");\n }\n\n return a + this.randomUInt32() % (b - a + 1);\n };\n\n RC4.prototype.currentState = function () {\n return {\n i: this.i,\n j: this.j,\n s: this.s.slice(), // copy\n };\n };\n\n RC4.prototype.setState = function (state) {\n var s = state.s;\n var i = state.i;\n var j = state.j;\n\n /* eslint-disable yoda */\n if (!(i === (i | 0) && 0 <= i && i < N)) {\n throw new Error(\"state.i should be integer [0, \" + (N - 1) + \"]\");\n }\n\n if (!(j === (j | 0) && 0 <= j && j < N)) {\n throw new Error(\"state.j should be integer [0, \" + (N - 1) + \"]\");\n }\n /* eslint-enable yoda */\n\n // check length\n if (!Array.isArray(s) || s.length !== N) {\n throw new Error(\"state should be array of length \" + N);\n }\n\n // check that all params are there\n for (var k = 0; k < N; k++) {\n if (s.indexOf(k) === -1) {\n throw new Error(\"state should be permutation of 0..\" + (N - 1) + \": \" + k + \" is missing\");\n }\n }\n\n this.i = i;\n this.j = j;\n this.s = s.slice(); // assign copy\n };\n\n return RC4;\n}\n\nvar RC4 = createRC4(256);\nRC4.prototype.randomByte = RC4.prototype.randomNative;\n\nvar RC4small = createRC4(16);\nRC4small.prototype.randomByte = function () {\n var a = this.randomNative();\n var b = this.randomNative();\n\n return a * 16 + b;\n};\n\nvar ordA = \"a\".charCodeAt(0);\nvar ord0 = \"0\".charCodeAt(0);\n\nfunction toHex(n) {\n return n < 10 ? String.fromCharCode(ord0 + n) : String.fromCharCode(ordA + n - 10);\n}\n\nfunction fromHex(c) {\n return parseInt(c, 16);\n}\n\nRC4small.prototype.currentStateString = function () {\n var state = this.currentState();\n\n var i = toHex(state.i);\n var j = toHex(state.j);\n\n var res = i + j + state.s.map(toHex).join(\"\");\n return res;\n};\n\nRC4small.prototype.setStateString = function (stateString) {\n if (!stateString.match(/^[0-9a-f]{18}$/)) {\n throw new TypeError(\"RC4small stateString should be 18 hex character string\");\n }\n\n var i = fromHex(stateString[0]);\n var j = fromHex(stateString[1]);\n var s = stateString.split(\"\").slice(2).map(fromHex);\n\n this.setState({\n i: i,\n j: j,\n s: s,\n });\n};\n\nRC4.RC4small = RC4small;\n\nmodule.exports = RC4;\n","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inheritsLoose(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n }\n\n return NodeError;\n }(Base);\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n }\n\n msg += \". Received type \".concat(typeof actual);\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\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 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 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\nvar Readable = require('./_stream_readable');\n\nvar Writable = require('./_stream_writable');\n\nrequire('inherits')(Duplex, Readable);\n\n{\n // Allow the keys array to be GC'ed.\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 this.allowHalfOpen = true;\n\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\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});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\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 && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\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.length;\n }\n}); // the no-half-open enforcer\n\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return; // no more data can be written.\n // But allow more writes to happen in this tick.\n\n process.nextTick(onEndNT, this);\n}\n\nfunction onEndNT(self) {\n self.end();\n}\n\nObject.defineProperty(Duplex.prototype, 'destroyed', {\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 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});","// 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 passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n'use strict';\n\nmodule.exports = PassThrough;\n\nvar Transform = require('./_stream_transform');\n\nrequire('inherits')(PassThrough, Transform);\n\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\n\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\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\nmodule.exports = Readable;\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\nvar Buffer = require('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 debugUtil = require('util');\n\nvar debug;\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/buffer_list');\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\n\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT; // Lazy loaded to improve the startup performance.\n\n\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\n\nrequire('inherits')(Readable, Stream);\n\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\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 (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\n\nfunction ReadableState(options, stream, isDuplex) {\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 if (typeof isDuplex !== 'boolean') 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 this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex); // 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;\n this.paused = true; // Should close be emitted on destroy. Defaults to true.\n\n this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'end' (and potentially 'finish')\n\n this.autoDestroy = !!options.autoDestroy; // 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); // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex); // 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 // 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 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 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 debug('readableAddChunk', chunk);\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 errorOrDestroy(stream, 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) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\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 maybeReadMore(stream, state);\n }\n } // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n\n\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\n\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\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 ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n\n return er;\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 var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder; // If setEncoding(null), decoder.encoding equals utf8\n\n this._readableState.encoding = this._readableState.decoder.encoding; // Iterate over current buffer to convert already stored Buffers:\n\n var p = this._readableState.buffer.head;\n var content = '';\n\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n\n this._readableState.buffer.clear();\n\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n}; // Don't raise the hwm > 1GB\n\n\nvar MAX_HWM = 0x40000000;\n\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\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.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || 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 = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\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 debug('onEofChunk');\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;\n\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\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 debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\n\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n } // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n\n\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\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 process.nextTick(maybeReadMore_, stream, state);\n }\n}\n\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length) // didn't get any data, stop spinning.\n break;\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 errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\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) process.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 }\n\n src.on('data', ondata);\n\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n\n if (ret === false) {\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', state.awaitDrain);\n state.awaitDrain++;\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) errorOrDestroy(dest, 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 pipeOnDrainFunctionResult() {\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, {\n hasUnpiped: false\n });\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 var state = this._readableState;\n\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0; // Try start flowing on next tick if stream isn't explicitly paused\n\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n\n return res;\n};\n\nReadable.prototype.addListener = Readable.prototype.on;\n\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n\n return res;\n};\n\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n\n return res;\n};\n\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true; // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\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'); // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n\n state.paused = false;\n return this;\n};\n\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\n\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n\n if (!state.reading) {\n stream.read(0);\n }\n\n state.resumeScheduled = false;\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 (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n\n this._readableState.paused = true;\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 ;\n }\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 methodWrap(method) {\n return function methodWrapReturnFunction() {\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\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n\n return createReadableStreamAsyncIterator(this);\n };\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});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\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 && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\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.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n}); // exposed for testing purposes only.\n\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\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.length;\n }\n}); // 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.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\n\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\n\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length); // Check that we didn't get one last unshift.\n\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\n\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n\n return from(Readable, iterable, opts);\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}","// 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 _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\n\nvar Duplex = require('./_stream_duplex');\n\nrequire('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 === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\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' && !this._readableState.destroyed) {\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 cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\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.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 Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\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); // TODO(BridgeAR): Write a test for these two error cases\n // 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 ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\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 bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n'use strict';\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 Duplex;\n/**/\n\nWritable.WritableState = WritableState;\n/**/\n\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/**/\n\n/**/\n\nvar Stream = require('./internal/streams/stream');\n/**/\n\n\nvar Buffer = require('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\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\n\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\n\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\n\nrequire('inherits')(Writable, Stream);\n\nfunction nop() {}\n\nfunction WritableState(options, stream, isDuplex) {\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 // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n\n if (typeof isDuplex !== 'boolean') 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 this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex); // 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; // Should close be emitted on destroy. Defaults to true.\n\n this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'finish' (and potentially 'end')\n\n this.autoDestroy = !!options.autoDestroy; // 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 writableStateBufferGetter() {\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 // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex); // 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 errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\n\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END(); // TODO: defer error events consistently everywhere, not just the cb\n\n errorOrDestroy(stream, er);\n process.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 er;\n\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n\n return true;\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.ending) 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 this._writableState.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.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 ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\n\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\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 && this._writableState.getBuffer();\n }\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 (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else 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 process.nextTick(cb, er); // this can emit finish, and it will always happen\n // after error\n\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, 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 errorOrDestroy(stream, 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 if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\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) || stream.destroyed;\n\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\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 ERR_METHOD_NOT_IMPLEMENTED('_write()'));\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) endWritable(this, state, cb);\n return this;\n};\n\nObject.defineProperty(Writable.prototype, 'writableLength', {\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.length;\n }\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 errorOrDestroy(stream, 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' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.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 if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\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) process.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 } // reuse the free corkReq.\n\n\n state.corkedRequestsFree.next = corkReq;\n}\n\nObject.defineProperty(Writable.prototype, 'destroyed', {\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 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 cb(err);\n};","'use strict';\n\nvar _Object$setPrototypeO;\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nvar finished = require('./end-of-stream');\n\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\n\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\n\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n\n if (resolve !== null) {\n var data = iter[kStream].read(); // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\n\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\n\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\n\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n\n next: function next() {\n var _this = this;\n\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n\n if (error !== null) {\n return Promise.reject(error);\n }\n\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n } // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n\n\n var lastPromise = this[kLastPromise];\n var promise;\n\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n\n promise = new Promise(this[kHandlePromise]);\n }\n\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\n\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject]; // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n\n iterator[kError] = err;\n return;\n }\n\n var resolve = iterator[kLastResolve];\n\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\n\nmodule.exports = createReadableStreamAsyncIterator;","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\n\nvar _require2 = require('util'),\n inspect = _require2.inspect;\n\nvar custom = inspect && inspect.custom || 'inspect';\n\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\n\nmodule.exports =\n/*#__PURE__*/\nfunction () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n\n while (p = p.next) {\n ret += s + p.data;\n }\n\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n\n return ret;\n } // Consumes a specified amount of bytes or characters from the buffered data.\n\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n } // Consumes a specified amount of characters from the buffered data.\n\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.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) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n\n break;\n }\n\n ++c;\n }\n\n this.length -= c;\n return ret;\n } // Consumes a specified amount of bytes from the buffered data.\n\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.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) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n\n break;\n }\n\n ++c;\n }\n\n this.length -= c;\n return ret;\n } // Make sure the linked list only shows the minimal necessary information.\n\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread({}, options, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n\n return BufferList;\n}();","'use strict'; // undocumented cb() API, needed for core, not for public API\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) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\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 if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n\n return this;\n}\n\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\n\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\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.finalCalled = false;\n this._writableState.prefinished = 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\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\n\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\n\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n callback.apply(this, args);\n };\n}\n\nfunction noop() {}\n\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\n\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n\n var writableEnded = stream._writableState && stream._writableState.finished;\n\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n\n var onclose = function onclose() {\n var err;\n\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\n\nmodule.exports = eos;","module.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n'use strict';\n\nvar eos;\n\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\n\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\n\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\n\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\n\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true; // request.destroy just do .end - .abort is what we want\n\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\n\nfunction call(fn) {\n fn();\n}\n\nfunction pipe(from, to) {\n return from.pipe(to);\n}\n\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\n\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\n\nmodule.exports = pipeline;","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\n\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\n\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n\n return Math.floor(hwm);\n } // Default value\n\n\n return state.objectMode ? 16 : 16 * 1024;\n}\n\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","module.exports = require('events').EventEmitter;\n","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\n","/*! render-media. MIT License. Feross Aboukhadijeh */\nexports.render = render\nexports.append = append\nexports.mime = require('./lib/mime.json')\n\nconst debug = require('debug')('render-media')\nconst isAscii = require('is-ascii')\nconst MediaElementWrapper = require('mediasource')\nconst path = require('path')\nconst streamToBlobURL = require('stream-to-blob-url')\nconst VideoStream = require('videostream')\n\n// Note: Everything listed in VIDEOSTREAM_EXTS should also appear in either\n// MEDIASOURCE_VIDEO_EXTS or MEDIASOURCE_AUDIO_EXTS.\nconst VIDEOSTREAM_EXTS = [\n '.m4a',\n '.m4b',\n '.m4p',\n '.m4v',\n '.mp4'\n]\n\nconst MEDIASOURCE_VIDEO_EXTS = [\n '.m4v',\n '.mkv',\n '.mp4',\n '.webm'\n]\n\nconst MEDIASOURCE_AUDIO_EXTS = [\n '.m4a',\n '.m4b',\n '.m4p',\n '.mp3'\n]\n\nconst MEDIASOURCE_EXTS = [].concat(\n MEDIASOURCE_VIDEO_EXTS,\n MEDIASOURCE_AUDIO_EXTS\n)\n\nconst VIDEO_EXTS = [\n '.mov',\n '.ogv'\n]\n\nconst AUDIO_EXTS = [\n '.aac',\n '.oga',\n '.ogg',\n '.wav',\n '.flac'\n]\n\nconst IMAGE_EXTS = [\n '.bmp',\n '.gif',\n '.jpeg',\n '.jpg',\n '.png',\n '.svg'\n]\n\nconst IFRAME_EXTS = [\n '.css',\n '.html',\n '.js',\n '.md',\n '.pdf',\n '.srt',\n '.txt'\n]\n\n// Maximum file length for which the Blob URL strategy will be attempted\n// See: https://github.com/feross/render-media/issues/18\nconst MAX_BLOB_LENGTH = 200 * 1000 * 1000 // 200 MB\n\nconst MediaSource = typeof window !== 'undefined' && window.MediaSource\n\nfunction render (file, elem, opts, cb) {\n if (typeof opts === 'function') {\n cb = opts\n opts = {}\n }\n if (!opts) opts = {}\n if (!cb) cb = () => {}\n\n validateFile(file)\n parseOpts(opts)\n\n if (typeof elem === 'string') elem = document.querySelector(elem)\n\n renderMedia(file, tagName => {\n if (elem.nodeName !== tagName.toUpperCase()) {\n const extname = path.extname(file.name).toLowerCase()\n\n throw new Error(\n `Cannot render \"${extname}\" inside a \"${elem.nodeName.toLowerCase()}\" element, expected \"${tagName}\"`\n )\n }\n\n if (tagName === 'video' || tagName === 'audio') setMediaOpts(elem, opts)\n\n return elem\n }, opts, cb)\n}\n\nfunction append (file, rootElem, opts, cb) {\n if (typeof opts === 'function') {\n cb = opts\n opts = {}\n }\n if (!opts) opts = {}\n if (!cb) cb = () => {}\n\n validateFile(file)\n parseOpts(opts)\n\n if (typeof rootElem === 'string') rootElem = document.querySelector(rootElem)\n\n if (rootElem && (rootElem.nodeName === 'VIDEO' || rootElem.nodeName === 'AUDIO')) {\n throw new Error(\n 'Invalid video/audio node argument. Argument must be root element that ' +\n 'video/audio tag will be appended to.'\n )\n }\n\n renderMedia(file, getElem, opts, done)\n\n function getElem (tagName) {\n if (tagName === 'video' || tagName === 'audio') return createMedia(tagName)\n else return createElem(tagName)\n }\n\n function createMedia (tagName) {\n const elem = createElem(tagName)\n setMediaOpts(elem, opts)\n rootElem.appendChild(elem)\n return elem\n }\n\n function createElem (tagName) {\n const elem = document.createElement(tagName)\n rootElem.appendChild(elem)\n return elem\n }\n\n function done (err, elem) {\n if (err && elem) elem.remove()\n cb(err, elem)\n }\n}\n\nfunction renderMedia (file, getElem, opts, cb) {\n const extname = path.extname(file.name).toLowerCase()\n let currentTime = 0\n let elem\n\n if (MEDIASOURCE_EXTS.includes(extname)) {\n renderMediaSource()\n } else if (VIDEO_EXTS.includes(extname)) {\n renderMediaElement('video')\n } else if (AUDIO_EXTS.includes(extname)) {\n renderMediaElement('audio')\n } else if (IMAGE_EXTS.includes(extname)) {\n renderImage()\n } else if (IFRAME_EXTS.includes(extname)) {\n renderIframe()\n } else {\n tryRenderIframe()\n }\n\n function renderMediaSource () {\n const tagName = MEDIASOURCE_VIDEO_EXTS.includes(extname) ? 'video' : 'audio'\n\n if (MediaSource) {\n if (VIDEOSTREAM_EXTS.includes(extname)) {\n useVideostream()\n } else {\n useMediaSource()\n }\n } else {\n useBlobURL()\n }\n\n function useVideostream () {\n debug(`Use \\`videostream\\` package for ${file.name}`)\n prepareElem()\n elem.addEventListener('error', fallbackToMediaSource)\n elem.addEventListener('loadstart', onLoadStart)\n elem.addEventListener('loadedmetadata', onLoadedMetadata)\n new VideoStream(file, elem) /* eslint-disable-line no-new */\n }\n\n function useMediaSource () {\n debug(`Use MediaSource API for ${file.name}`)\n prepareElem()\n elem.addEventListener('error', fallbackToBlobURL)\n elem.addEventListener('loadstart', onLoadStart)\n elem.addEventListener('loadedmetadata', onLoadedMetadata)\n\n const wrapper = new MediaElementWrapper(elem)\n const writable = wrapper.createWriteStream(getCodec(file.name))\n file.createReadStream().pipe(writable)\n\n if (currentTime) elem.currentTime = currentTime\n }\n\n function useBlobURL () {\n debug(`Use Blob URL for ${file.name}`)\n prepareElem()\n elem.addEventListener('error', fatalError)\n elem.addEventListener('loadstart', onLoadStart)\n elem.addEventListener('loadedmetadata', onLoadedMetadata)\n getBlobURL(file, (err, url) => {\n if (err) return fatalError(err)\n elem.src = url\n if (currentTime) elem.currentTime = currentTime\n })\n }\n\n function fallbackToMediaSource (err) {\n debug('videostream error: fallback to MediaSource API: %o', err.message || err)\n elem.removeEventListener('error', fallbackToMediaSource)\n elem.removeEventListener('loadedmetadata', onLoadedMetadata)\n\n useMediaSource()\n }\n\n function fallbackToBlobURL (err) {\n debug('MediaSource API error: fallback to Blob URL: %o', err.message || err)\n if (!checkBlobLength()) return\n\n elem.removeEventListener('error', fallbackToBlobURL)\n elem.removeEventListener('loadedmetadata', onLoadedMetadata)\n\n useBlobURL()\n }\n\n function prepareElem () {\n if (!elem) {\n elem = getElem(tagName)\n\n elem.addEventListener('progress', () => {\n currentTime = elem.currentTime\n })\n }\n }\n }\n\n function checkBlobLength () {\n if (typeof file.length === 'number' && file.length > opts.maxBlobLength) {\n debug(\n 'File length too large for Blob URL approach: %d (max: %d)',\n file.length, opts.maxBlobLength\n )\n fatalError(new Error(\n `File length too large for Blob URL approach: ${file.length} (max: ${opts.maxBlobLength})`\n ))\n return false\n }\n return true\n }\n\n function renderMediaElement (type) {\n if (!checkBlobLength()) return\n\n elem = getElem(type)\n getBlobURL(file, (err, url) => {\n if (err) return fatalError(err)\n elem.addEventListener('error', fatalError)\n elem.addEventListener('loadstart', onLoadStart)\n elem.addEventListener('loadedmetadata', onLoadedMetadata)\n elem.src = url\n })\n }\n\n function onLoadStart () {\n elem.removeEventListener('loadstart', onLoadStart)\n if (opts.autoplay) {\n const playPromise = elem.play()\n if (typeof playPromise !== 'undefined') playPromise.catch(fatalError)\n }\n }\n\n function onLoadedMetadata () {\n elem.removeEventListener('loadedmetadata', onLoadedMetadata)\n cb(null, elem)\n }\n\n function renderImage () {\n elem = getElem('img')\n getBlobURL(file, (err, url) => {\n if (err) return fatalError(err)\n elem.src = url\n elem.alt = file.name\n cb(null, elem)\n })\n }\n\n function renderIframe () {\n getBlobURL(file, (err, url) => {\n if (err) return fatalError(err)\n\n if (extname !== '.pdf') {\n // Render iframe\n elem = getElem('iframe')\n elem.sandbox = 'allow-forms allow-scripts'\n elem.src = url\n } else {\n // Render .pdf\n elem = getElem('object')\n // Firefox-only: `typemustmatch` keeps the embedded file from running unless\n // its content type matches the specified `type` attribute\n elem.setAttribute('typemustmatch', true)\n elem.setAttribute('type', 'application/pdf')\n elem.setAttribute('data', url)\n }\n cb(null, elem)\n })\n }\n\n function tryRenderIframe () {\n debug('Unknown file extension \"%s\" - will attempt to render into iframe', extname)\n\n let str = ''\n file.createReadStream({ start: 0, end: 1000 })\n .setEncoding('utf8')\n .on('data', chunk => {\n str += chunk\n })\n .on('end', done)\n .on('error', cb)\n\n function done () {\n if (isAscii(str)) {\n debug('File extension \"%s\" appears ascii, so will render.', extname)\n renderIframe()\n } else {\n debug('File extension \"%s\" appears non-ascii, will not render.', extname)\n cb(new Error(`Unsupported file type \"${extname}\": Cannot append to DOM`))\n }\n }\n }\n\n function fatalError (err) {\n err.message = `Error rendering file \"${file.name}\": ${err.message}`\n debug(err.message)\n cb(err)\n }\n}\n\nfunction getBlobURL (file, cb) {\n const extname = path.extname(file.name).toLowerCase()\n streamToBlobURL(file.createReadStream(), exports.mime[extname])\n .then(\n blobUrl => cb(null, blobUrl),\n err => cb(err)\n )\n}\n\nfunction validateFile (file) {\n if (file == null) {\n throw new Error('file cannot be null or undefined')\n }\n if (typeof file.name !== 'string') {\n throw new Error('missing or invalid file.name property')\n }\n if (typeof file.createReadStream !== 'function') {\n throw new Error('missing or invalid file.createReadStream property')\n }\n}\n\nfunction getCodec (name) {\n const extname = path.extname(name).toLowerCase()\n return {\n '.m4a': 'audio/mp4; codecs=\"mp4a.40.5\"',\n '.m4b': 'audio/mp4; codecs=\"mp4a.40.5\"',\n '.m4p': 'audio/mp4; codecs=\"mp4a.40.5\"',\n '.m4v': 'video/mp4; codecs=\"avc1.640029, mp4a.40.5\"',\n '.mkv': 'video/webm; codecs=\"avc1.640029, mp4a.40.5\"',\n '.mp3': 'audio/mpeg',\n '.mp4': 'video/mp4; codecs=\"avc1.640029, mp4a.40.5\"',\n '.webm': 'video/webm; codecs=\"vorbis, vp8\"'\n }[extname]\n}\n\nfunction parseOpts (opts) {\n if (opts.autoplay == null) opts.autoplay = false\n if (opts.muted == null) opts.muted = false\n if (opts.controls == null) opts.controls = true\n if (opts.maxBlobLength == null) opts.maxBlobLength = MAX_BLOB_LENGTH\n}\n\nfunction setMediaOpts (elem, opts) {\n elem.autoplay = !!opts.autoplay\n elem.muted = !!opts.muted\n elem.controls = !!opts.controls\n}\n","'use strict'\nvar Buffer = require('buffer').Buffer\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\n\nvar ARRAY16 = new Array(16)\n\nvar zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n]\n\nvar zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n]\n\nvar sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n]\n\nvar sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n]\n\nvar hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]\nvar hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]\n\nfunction RIPEMD160 () {\n HashBase.call(this, 64)\n\n // state\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 for (var j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4)\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\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\n\n // computation\n for (var i = 0; i < 80; i += 1) {\n var tl\n var tr\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 { // 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\n ar = er\n er = dr\n dr = rotl(cr, 10)\n cr = br\n br = tr\n }\n\n // update state\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 if (this._blockOffset > 56) {\n this._block.fill(0, this._blockOffset, 64)\n this._update()\n this._blockOffset = 0\n }\n\n this._block.fill(0, this._blockOffset, 56)\n this._block.writeUInt32LE(this._length[0], 56)\n this._block.writeUInt32LE(this._length[1], 60)\n this._update()\n\n // produce result\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\n","/*! run-parallel-limit. MIT License. Feross Aboukhadijeh */\nmodule.exports = runParallelLimit\n\nconst queueMicrotask = require('queue-microtask')\n\nfunction runParallelLimit (tasks, limit, cb) {\n if (typeof limit !== 'number') throw new Error('second argument must be a Number')\n let results, len, pending, keys, isErrored\n let isSync = true\n let next\n\n if (Array.isArray(tasks)) {\n results = []\n pending = len = tasks.length\n } else {\n keys = Object.keys(tasks)\n results = {}\n pending = len = keys.length\n }\n\n function done (err) {\n function end () {\n if (cb) cb(err, results)\n cb = null\n }\n if (isSync) queueMicrotask(end)\n else end()\n }\n\n function each (i, err, result) {\n results[i] = result\n if (err) isErrored = true\n if (--pending === 0 || err) {\n done(err)\n } else if (!isErrored && next < len) {\n let key\n if (keys) {\n key = keys[next]\n next += 1\n tasks[key](function (err, result) { each(key, err, result) })\n } else {\n key = next\n next += 1\n tasks[key](function (err, result) { each(key, err, result) })\n }\n }\n }\n\n next = limit\n if (!pending) {\n // empty\n done(null)\n } else if (keys) {\n // object\n keys.some(function (key, i) {\n tasks[key](function (err, result) { each(key, err, result) })\n if (i === limit - 1) return true // early return\n return false\n })\n } else {\n // array\n tasks.some(function (task, i) {\n task(function (err, result) { each(i, err, result) })\n if (i === limit - 1) return true // early return\n return false\n })\n }\n\n isSync = false\n}\n","/*! run-parallel. MIT License. Feross Aboukhadijeh */\nmodule.exports = runParallel\n\nconst queueMicrotask = require('queue-microtask')\n\nfunction runParallel (tasks, cb) {\n let results, pending, keys\n let isSync = true\n\n if (Array.isArray(tasks)) {\n results = []\n pending = tasks.length\n } else {\n keys = Object.keys(tasks)\n results = {}\n pending = keys.length\n }\n\n function done (err) {\n function end () {\n if (cb) cb(err, results)\n cb = null\n }\n if (isSync) queueMicrotask(end)\n else end()\n }\n\n function each (i, err, result) {\n results[i] = result\n if (--pending === 0 || err) {\n done(err)\n }\n }\n\n if (!pending) {\n // empty\n done(null)\n } else if (keys) {\n // object\n keys.forEach(function (key) {\n tasks[key](function (err, result) { each(key, err, result) })\n })\n } else {\n // array\n tasks.forEach(function (task, i) {\n task(function (err, result) { each(i, err, result) })\n })\n }\n\n isSync = false\n}\n","(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Rusha\"] = factory();\n\telse\n\t\troot[\"Rusha\"] = factory();\n})(typeof self !== 'undefined' ? self : this, function() {\nreturn /******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId]) {\n/******/ \t\t\treturn installedModules[moduleId].exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\ti: moduleId,\n/******/ \t\t\tl: false,\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.l = true;\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/******/\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n/******/\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n/******/\n/******/ \t// define getter function for harmony exports\n/******/ \t__webpack_require__.d = function(exports, name, getter) {\n/******/ \t\tif(!__webpack_require__.o(exports, name)) {\n/******/ \t\t\tObject.defineProperty(exports, name, {\n/******/ \t\t\t\tconfigurable: false,\n/******/ \t\t\t\tenumerable: true,\n/******/ \t\t\t\tget: getter\n/******/ \t\t\t});\n/******/ \t\t}\n/******/ \t};\n/******/\n/******/ \t// getDefaultExport function for compatibility with non-harmony modules\n/******/ \t__webpack_require__.n = function(module) {\n/******/ \t\tvar getter = module && module.__esModule ?\n/******/ \t\t\tfunction getDefault() { return module['default']; } :\n/******/ \t\t\tfunction getModuleExports() { return module; };\n/******/ \t\t__webpack_require__.d(getter, 'a', getter);\n/******/ \t\treturn getter;\n/******/ \t};\n/******/\n/******/ \t// Object.prototype.hasOwnProperty.call\n/******/ \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n/******/\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"\";\n/******/\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(__webpack_require__.s = 3);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ (function(module, exports, __webpack_require__) {\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\n/* eslint-env commonjs, browser */\n\nvar RushaCore = __webpack_require__(5);\n\nvar _require = __webpack_require__(1),\n toHex = _require.toHex,\n ceilHeapSize = _require.ceilHeapSize;\n\nvar conv = __webpack_require__(6);\n\n// Calculate the length of buffer that the sha1 routine uses\n// including the padding.\nvar padlen = function (len) {\n for (len += 9; len % 64 > 0; len += 1) {}\n return len;\n};\n\nvar padZeroes = function (bin, len) {\n var h8 = new Uint8Array(bin.buffer);\n var om = len % 4,\n align = len - om;\n switch (om) {\n case 0:\n h8[align + 3] = 0;\n case 1:\n h8[align + 2] = 0;\n case 2:\n h8[align + 1] = 0;\n case 3:\n h8[align + 0] = 0;\n }\n for (var i = (len >> 2) + 1; i < bin.length; i++) {\n bin[i] = 0;\n }\n};\n\nvar padData = function (bin, chunkLen, msgLen) {\n bin[chunkLen >> 2] |= 0x80 << 24 - (chunkLen % 4 << 3);\n // To support msgLen >= 2 GiB, use a float division when computing the\n // high 32-bits of the big-endian message length in bits.\n bin[((chunkLen >> 2) + 2 & ~0x0f) + 14] = msgLen / (1 << 29) | 0;\n bin[((chunkLen >> 2) + 2 & ~0x0f) + 15] = msgLen << 3;\n};\n\nvar getRawDigest = function (heap, padMaxChunkLen) {\n var io = new Int32Array(heap, padMaxChunkLen + 320, 5);\n var out = new Int32Array(5);\n var arr = new DataView(out.buffer);\n arr.setInt32(0, io[0], false);\n arr.setInt32(4, io[1], false);\n arr.setInt32(8, io[2], false);\n arr.setInt32(12, io[3], false);\n arr.setInt32(16, io[4], false);\n return out;\n};\n\nvar Rusha = function () {\n function Rusha(chunkSize) {\n _classCallCheck(this, Rusha);\n\n chunkSize = chunkSize || 64 * 1024;\n if (chunkSize % 64 > 0) {\n throw new Error('Chunk size must be a multiple of 128 bit');\n }\n this._offset = 0;\n this._maxChunkLen = chunkSize;\n this._padMaxChunkLen = padlen(chunkSize);\n // The size of the heap is the sum of:\n // 1. The padded input message size\n // 2. The extended space the algorithm needs (320 byte)\n // 3. The 160 bit state the algoritm uses\n this._heap = new ArrayBuffer(ceilHeapSize(this._padMaxChunkLen + 320 + 20));\n this._h32 = new Int32Array(this._heap);\n this._h8 = new Int8Array(this._heap);\n this._core = new RushaCore({ Int32Array: Int32Array }, {}, this._heap);\n }\n\n Rusha.prototype._initState = function _initState(heap, padMsgLen) {\n this._offset = 0;\n var io = new Int32Array(heap, padMsgLen + 320, 5);\n io[0] = 1732584193;\n io[1] = -271733879;\n io[2] = -1732584194;\n io[3] = 271733878;\n io[4] = -1009589776;\n };\n\n Rusha.prototype._padChunk = function _padChunk(chunkLen, msgLen) {\n var padChunkLen = padlen(chunkLen);\n var view = new Int32Array(this._heap, 0, padChunkLen >> 2);\n padZeroes(view, chunkLen);\n padData(view, chunkLen, msgLen);\n return padChunkLen;\n };\n\n Rusha.prototype._write = function _write(data, chunkOffset, chunkLen, off) {\n conv(data, this._h8, this._h32, chunkOffset, chunkLen, off || 0);\n };\n\n Rusha.prototype._coreCall = function _coreCall(data, chunkOffset, chunkLen, msgLen, finalize) {\n var padChunkLen = chunkLen;\n this._write(data, chunkOffset, chunkLen);\n if (finalize) {\n padChunkLen = this._padChunk(chunkLen, msgLen);\n }\n this._core.hash(padChunkLen, this._padMaxChunkLen);\n };\n\n Rusha.prototype.rawDigest = function rawDigest(str) {\n var msgLen = str.byteLength || str.length || str.size || 0;\n this._initState(this._heap, this._padMaxChunkLen);\n var chunkOffset = 0,\n chunkLen = this._maxChunkLen;\n for (chunkOffset = 0; msgLen > chunkOffset + chunkLen; chunkOffset += chunkLen) {\n this._coreCall(str, chunkOffset, chunkLen, msgLen, false);\n }\n this._coreCall(str, chunkOffset, msgLen - chunkOffset, msgLen, true);\n return getRawDigest(this._heap, this._padMaxChunkLen);\n };\n\n Rusha.prototype.digest = function digest(str) {\n return toHex(this.rawDigest(str).buffer);\n };\n\n Rusha.prototype.digestFromString = function digestFromString(str) {\n return this.digest(str);\n };\n\n Rusha.prototype.digestFromBuffer = function digestFromBuffer(str) {\n return this.digest(str);\n };\n\n Rusha.prototype.digestFromArrayBuffer = function digestFromArrayBuffer(str) {\n return this.digest(str);\n };\n\n Rusha.prototype.resetState = function resetState() {\n this._initState(this._heap, this._padMaxChunkLen);\n return this;\n };\n\n Rusha.prototype.append = function append(chunk) {\n var chunkOffset = 0;\n var chunkLen = chunk.byteLength || chunk.length || chunk.size || 0;\n var turnOffset = this._offset % this._maxChunkLen;\n var inputLen = void 0;\n\n this._offset += chunkLen;\n while (chunkOffset < chunkLen) {\n inputLen = Math.min(chunkLen - chunkOffset, this._maxChunkLen - turnOffset);\n this._write(chunk, chunkOffset, inputLen, turnOffset);\n turnOffset += inputLen;\n chunkOffset += inputLen;\n if (turnOffset === this._maxChunkLen) {\n this._core.hash(this._maxChunkLen, this._padMaxChunkLen);\n turnOffset = 0;\n }\n }\n return this;\n };\n\n Rusha.prototype.getState = function getState() {\n var turnOffset = this._offset % this._maxChunkLen;\n var heap = void 0;\n if (!turnOffset) {\n var io = new Int32Array(this._heap, this._padMaxChunkLen + 320, 5);\n heap = io.buffer.slice(io.byteOffset, io.byteOffset + io.byteLength);\n } else {\n heap = this._heap.slice(0);\n }\n return {\n offset: this._offset,\n heap: heap\n };\n };\n\n Rusha.prototype.setState = function setState(state) {\n this._offset = state.offset;\n if (state.heap.byteLength === 20) {\n var io = new Int32Array(this._heap, this._padMaxChunkLen + 320, 5);\n io.set(new Int32Array(state.heap));\n } else {\n this._h32.set(new Int32Array(state.heap));\n }\n return this;\n };\n\n Rusha.prototype.rawEnd = function rawEnd() {\n var msgLen = this._offset;\n var chunkLen = msgLen % this._maxChunkLen;\n var padChunkLen = this._padChunk(chunkLen, msgLen);\n this._core.hash(padChunkLen, this._padMaxChunkLen);\n var result = getRawDigest(this._heap, this._padMaxChunkLen);\n this._initState(this._heap, this._padMaxChunkLen);\n return result;\n };\n\n Rusha.prototype.end = function end() {\n return toHex(this.rawEnd().buffer);\n };\n\n return Rusha;\n}();\n\nmodule.exports = Rusha;\nmodule.exports._core = RushaCore;\n\n/***/ }),\n/* 1 */\n/***/ (function(module, exports) {\n\n/* eslint-env commonjs, browser */\n\n//\n// toHex\n//\n\nvar precomputedHex = new Array(256);\nfor (var i = 0; i < 256; i++) {\n precomputedHex[i] = (i < 0x10 ? '0' : '') + i.toString(16);\n}\n\nmodule.exports.toHex = function (arrayBuffer) {\n var binarray = new Uint8Array(arrayBuffer);\n var res = new Array(arrayBuffer.byteLength);\n for (var _i = 0; _i < res.length; _i++) {\n res[_i] = precomputedHex[binarray[_i]];\n }\n return res.join('');\n};\n\n//\n// ceilHeapSize\n//\n\nmodule.exports.ceilHeapSize = function (v) {\n // The asm.js spec says:\n // The heap object's byteLength must be either\n // 2^n for n in [12, 24) or 2^24 * n for n ≥ 1.\n // Also, byteLengths smaller than 2^16 are deprecated.\n var p = 0;\n // If v is smaller than 2^16, the smallest possible solution\n // is 2^16.\n if (v <= 65536) return 65536;\n // If v < 2^24, we round up to 2^n,\n // otherwise we round up to 2^24 * n.\n if (v < 16777216) {\n for (p = 1; p < v; p = p << 1) {}\n } else {\n for (p = 16777216; p < v; p += 16777216) {}\n }\n return p;\n};\n\n//\n// isDedicatedWorkerScope\n//\n\nmodule.exports.isDedicatedWorkerScope = function (self) {\n var isRunningInWorker = 'WorkerGlobalScope' in self && self instanceof self.WorkerGlobalScope;\n var isRunningInSharedWorker = 'SharedWorkerGlobalScope' in self && self instanceof self.SharedWorkerGlobalScope;\n var isRunningInServiceWorker = 'ServiceWorkerGlobalScope' in self && self instanceof self.ServiceWorkerGlobalScope;\n\n // Detects whether we run inside a dedicated worker or not.\n //\n // We can't just check for `DedicatedWorkerGlobalScope`, since IE11\n // has a bug where it only supports `WorkerGlobalScope`.\n //\n // Therefore, we consider us as running inside a dedicated worker\n // when we are running inside a worker, but not in a shared or service worker.\n //\n // When new types of workers are introduced, we will need to adjust this code.\n return isRunningInWorker && !isRunningInSharedWorker && !isRunningInServiceWorker;\n};\n\n/***/ }),\n/* 2 */\n/***/ (function(module, exports, __webpack_require__) {\n\n/* eslint-env commonjs, worker */\n\nmodule.exports = function () {\n var Rusha = __webpack_require__(0);\n\n var hashData = function (hasher, data, cb) {\n try {\n return cb(null, hasher.digest(data));\n } catch (e) {\n return cb(e);\n }\n };\n\n var hashFile = function (hasher, readTotal, blockSize, file, cb) {\n var reader = new self.FileReader();\n reader.onloadend = function onloadend() {\n if (reader.error) {\n return cb(reader.error);\n }\n var buffer = reader.result;\n readTotal += reader.result.byteLength;\n try {\n hasher.append(buffer);\n } catch (e) {\n cb(e);\n return;\n }\n if (readTotal < file.size) {\n hashFile(hasher, readTotal, blockSize, file, cb);\n } else {\n cb(null, hasher.end());\n }\n };\n reader.readAsArrayBuffer(file.slice(readTotal, readTotal + blockSize));\n };\n\n var workerBehaviourEnabled = true;\n\n self.onmessage = function (event) {\n if (!workerBehaviourEnabled) {\n return;\n }\n\n var data = event.data.data,\n file = event.data.file,\n id = event.data.id;\n if (typeof id === 'undefined') return;\n if (!file && !data) return;\n var blockSize = event.data.blockSize || 4 * 1024 * 1024;\n var hasher = new Rusha(blockSize);\n hasher.resetState();\n var done = function (err, hash) {\n if (!err) {\n self.postMessage({ id: id, hash: hash });\n } else {\n self.postMessage({ id: id, error: err.name });\n }\n };\n if (data) hashData(hasher, data, done);\n if (file) hashFile(hasher, 0, blockSize, file, done);\n };\n\n return function () {\n workerBehaviourEnabled = false;\n };\n};\n\n/***/ }),\n/* 3 */\n/***/ (function(module, exports, __webpack_require__) {\n\n/* eslint-env commonjs, browser */\n\nvar work = __webpack_require__(4);\nvar Rusha = __webpack_require__(0);\nvar createHash = __webpack_require__(7);\nvar runWorker = __webpack_require__(2);\n\nvar _require = __webpack_require__(1),\n isDedicatedWorkerScope = _require.isDedicatedWorkerScope;\n\nvar isRunningInDedicatedWorker = typeof self !== 'undefined' && isDedicatedWorkerScope(self);\n\nRusha.disableWorkerBehaviour = isRunningInDedicatedWorker ? runWorker() : function () {};\n\nRusha.createWorker = function () {\n var worker = work(/*require.resolve*/(2));\n var terminate = worker.terminate;\n worker.terminate = function () {\n URL.revokeObjectURL(worker.objectURL);\n terminate.call(worker);\n };\n return worker;\n};\n\nRusha.createHash = createHash;\n\nmodule.exports = Rusha;\n\n/***/ }),\n/* 4 */\n/***/ (function(module, exports, __webpack_require__) {\n\nfunction webpackBootstrapFunc (modules) {\n/******/ // The module cache\n/******/ var installedModules = {};\n\n/******/ // The require function\n/******/ function __webpack_require__(moduleId) {\n\n/******/ // Check if module is in cache\n/******/ if(installedModules[moduleId])\n/******/ return installedModules[moduleId].exports;\n\n/******/ // Create a new module (and put it into the cache)\n/******/ var module = installedModules[moduleId] = {\n/******/ i: moduleId,\n/******/ l: false,\n/******/ exports: {}\n/******/ };\n\n/******/ // Execute the module function\n/******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n/******/ // Flag the module as loaded\n/******/ module.l = true;\n\n/******/ // Return the exports of the module\n/******/ return module.exports;\n/******/ }\n\n/******/ // expose the modules object (__webpack_modules__)\n/******/ __webpack_require__.m = modules;\n\n/******/ // expose the module cache\n/******/ __webpack_require__.c = installedModules;\n\n/******/ // identity function for calling harmony imports with the correct context\n/******/ __webpack_require__.i = function(value) { return value; };\n\n/******/ // define getter function for harmony exports\n/******/ __webpack_require__.d = function(exports, name, getter) {\n/******/ if(!__webpack_require__.o(exports, name)) {\n/******/ Object.defineProperty(exports, name, {\n/******/ configurable: false,\n/******/ enumerable: true,\n/******/ get: getter\n/******/ });\n/******/ }\n/******/ };\n\n/******/ // define __esModule on exports\n/******/ __webpack_require__.r = function(exports) {\n/******/ Object.defineProperty(exports, '__esModule', { value: true });\n/******/ };\n\n/******/ // getDefaultExport function for compatibility with non-harmony modules\n/******/ __webpack_require__.n = function(module) {\n/******/ var getter = module && module.__esModule ?\n/******/ function getDefault() { return module['default']; } :\n/******/ function getModuleExports() { return module; };\n/******/ __webpack_require__.d(getter, 'a', getter);\n/******/ return getter;\n/******/ };\n\n/******/ // Object.prototype.hasOwnProperty.call\n/******/ __webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n/******/ // __webpack_public_path__\n/******/ __webpack_require__.p = \"/\";\n\n/******/ // on error function for async loading\n/******/ __webpack_require__.oe = function(err) { console.error(err); throw err; };\n\n var f = __webpack_require__(__webpack_require__.s = ENTRY_MODULE)\n return f.default || f // try to call default if defined to also support babel esmodule exports\n}\n\nvar moduleNameReqExp = '[\\\\.|\\\\-|\\\\+|\\\\w|\\/|@]+'\nvar dependencyRegExp = '\\\\((\\/\\\\*.*?\\\\*\\/)?\\s?.*?(' + moduleNameReqExp + ').*?\\\\)' // additional chars when output.pathinfo is true\n\n// http://stackoverflow.com/a/2593661/130442\nfunction quoteRegExp (str) {\n return (str + '').replace(/[.?*+^$[\\]\\\\(){}|-]/g, '\\\\$&')\n}\n\nfunction getModuleDependencies (sources, module, queueName) {\n var retval = {}\n retval[queueName] = []\n\n var fnString = module.toString()\n var wrapperSignature = fnString.match(/^function\\s?\\(\\w+,\\s*\\w+,\\s*(\\w+)\\)/)\n if (!wrapperSignature) return retval\n var webpackRequireName = wrapperSignature[1]\n\n // main bundle deps\n var re = new RegExp('(\\\\\\\\n|\\\\W)' + quoteRegExp(webpackRequireName) + dependencyRegExp, 'g')\n var match\n while ((match = re.exec(fnString))) {\n if (match[3] === 'dll-reference') continue\n retval[queueName].push(match[3])\n }\n\n // dll deps\n re = new RegExp('\\\\(' + quoteRegExp(webpackRequireName) + '\\\\(\"(dll-reference\\\\s(' + moduleNameReqExp + '))\"\\\\)\\\\)' + dependencyRegExp, 'g')\n while ((match = re.exec(fnString))) {\n if (!sources[match[2]]) {\n retval[queueName].push(match[1])\n sources[match[2]] = __webpack_require__(match[1]).m\n }\n retval[match[2]] = retval[match[2]] || []\n retval[match[2]].push(match[4])\n }\n\n return retval\n}\n\nfunction hasValuesInQueues (queues) {\n var keys = Object.keys(queues)\n return keys.reduce(function (hasValues, key) {\n return hasValues || queues[key].length > 0\n }, false)\n}\n\nfunction getRequiredModules (sources, moduleId) {\n var modulesQueue = {\n main: [moduleId]\n }\n var requiredModules = {\n main: []\n }\n var seenModules = {\n main: {}\n }\n\n while (hasValuesInQueues(modulesQueue)) {\n var queues = Object.keys(modulesQueue)\n for (var i = 0; i < queues.length; i++) {\n var queueName = queues[i]\n var queue = modulesQueue[queueName]\n var moduleToCheck = queue.pop()\n seenModules[queueName] = seenModules[queueName] || {}\n if (seenModules[queueName][moduleToCheck] || !sources[queueName][moduleToCheck]) continue\n seenModules[queueName][moduleToCheck] = true\n requiredModules[queueName] = requiredModules[queueName] || []\n requiredModules[queueName].push(moduleToCheck)\n var newModules = getModuleDependencies(sources, sources[queueName][moduleToCheck], queueName)\n var newModulesKeys = Object.keys(newModules)\n for (var j = 0; j < newModulesKeys.length; j++) {\n modulesQueue[newModulesKeys[j]] = modulesQueue[newModulesKeys[j]] || []\n modulesQueue[newModulesKeys[j]] = modulesQueue[newModulesKeys[j]].concat(newModules[newModulesKeys[j]])\n }\n }\n }\n\n return requiredModules\n}\n\nmodule.exports = function (moduleId, options) {\n options = options || {}\n var sources = {\n main: __webpack_require__.m\n }\n\n var requiredModules = options.all ? { main: Object.keys(sources) } : getRequiredModules(sources, moduleId)\n\n var src = ''\n\n Object.keys(requiredModules).filter(function (m) { return m !== 'main' }).forEach(function (module) {\n var entryModule = 0\n while (requiredModules[module][entryModule]) {\n entryModule++\n }\n requiredModules[module].push(entryModule)\n sources[module][entryModule] = '(function(module, exports, __webpack_require__) { module.exports = __webpack_require__; })'\n src = src + 'var ' + module + ' = (' + webpackBootstrapFunc.toString().replace('ENTRY_MODULE', JSON.stringify(entryModule)) + ')({' + requiredModules[module].map(function (id) { return '' + JSON.stringify(id) + ': ' + sources[module][id].toString() }).join(',') + '});\\n'\n })\n\n src = src + '(' + webpackBootstrapFunc.toString().replace('ENTRY_MODULE', JSON.stringify(moduleId)) + ')({' + requiredModules.main.map(function (id) { return '' + JSON.stringify(id) + ': ' + sources.main[id].toString() }).join(',') + '})(self);'\n\n var blob = new window.Blob([src], { type: 'text/javascript' })\n if (options.bare) { return blob }\n\n var URL = window.URL || window.webkitURL || window.mozURL || window.msURL\n\n var workerUrl = URL.createObjectURL(blob)\n var worker = new window.Worker(workerUrl)\n worker.objectURL = workerUrl\n\n return worker\n}\n\n\n/***/ }),\n/* 5 */\n/***/ (function(module, exports) {\n\n// The low-level RushCore module provides the heart of Rusha,\n// a high-speed sha1 implementation working on an Int32Array heap.\n// At first glance, the implementation seems complicated, however\n// with the SHA1 spec at hand, it is obvious this almost a textbook\n// implementation that has a few functions hand-inlined and a few loops\n// hand-unrolled.\nmodule.exports = function RushaCore(stdlib$840, foreign$841, heap$842) {\n 'use asm';\n var H$843 = new stdlib$840.Int32Array(heap$842);\n function hash$844(k$845, x$846) {\n // k in bytes\n k$845 = k$845 | 0;\n x$846 = x$846 | 0;\n var i$847 = 0, j$848 = 0, y0$849 = 0, z0$850 = 0, y1$851 = 0, z1$852 = 0, y2$853 = 0, z2$854 = 0, y3$855 = 0, z3$856 = 0, y4$857 = 0, z4$858 = 0, t0$859 = 0, t1$860 = 0;\n y0$849 = H$843[x$846 + 320 >> 2] | 0;\n y1$851 = H$843[x$846 + 324 >> 2] | 0;\n y2$853 = H$843[x$846 + 328 >> 2] | 0;\n y3$855 = H$843[x$846 + 332 >> 2] | 0;\n y4$857 = H$843[x$846 + 336 >> 2] | 0;\n for (i$847 = 0; (i$847 | 0) < (k$845 | 0); i$847 = i$847 + 64 | 0) {\n z0$850 = y0$849;\n z1$852 = y1$851;\n z2$854 = y2$853;\n z3$856 = y3$855;\n z4$858 = y4$857;\n for (j$848 = 0; (j$848 | 0) < 64; j$848 = j$848 + 4 | 0) {\n t1$860 = H$843[i$847 + j$848 >> 2] | 0;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | ~y1$851 & y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1518500249 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[k$845 + j$848 >> 2] = t1$860;\n }\n for (j$848 = k$845 + 64 | 0; (j$848 | 0) < (k$845 + 80 | 0); j$848 = j$848 + 4 | 0) {\n t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | ~y1$851 & y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1518500249 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[j$848 >> 2] = t1$860;\n }\n for (j$848 = k$845 + 80 | 0; (j$848 | 0) < (k$845 + 160 | 0); j$848 = j$848 + 4 | 0) {\n t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 ^ y2$853 ^ y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1859775393 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[j$848 >> 2] = t1$860;\n }\n for (j$848 = k$845 + 160 | 0; (j$848 | 0) < (k$845 + 240 | 0); j$848 = j$848 + 4 | 0) {\n t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | y1$851 & y3$855 | y2$853 & y3$855) | 0) + ((t1$860 + y4$857 | 0) - 1894007588 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[j$848 >> 2] = t1$860;\n }\n for (j$848 = k$845 + 240 | 0; (j$848 | 0) < (k$845 + 320 | 0); j$848 = j$848 + 4 | 0) {\n t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 ^ y2$853 ^ y3$855) | 0) + ((t1$860 + y4$857 | 0) - 899497514 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[j$848 >> 2] = t1$860;\n }\n y0$849 = y0$849 + z0$850 | 0;\n y1$851 = y1$851 + z1$852 | 0;\n y2$853 = y2$853 + z2$854 | 0;\n y3$855 = y3$855 + z3$856 | 0;\n y4$857 = y4$857 + z4$858 | 0;\n }\n H$843[x$846 + 320 >> 2] = y0$849;\n H$843[x$846 + 324 >> 2] = y1$851;\n H$843[x$846 + 328 >> 2] = y2$853;\n H$843[x$846 + 332 >> 2] = y3$855;\n H$843[x$846 + 336 >> 2] = y4$857;\n }\n return { hash: hash$844 };\n};\n\n/***/ }),\n/* 6 */\n/***/ (function(module, exports) {\n\nvar _this = this;\n\n/* eslint-env commonjs, browser */\n\nvar reader = void 0;\nif (typeof self !== 'undefined' && typeof self.FileReaderSync !== 'undefined') {\n reader = new self.FileReaderSync();\n}\n\n// Convert a binary string and write it to the heap.\n// A binary string is expected to only contain char codes < 256.\nvar convStr = function (str, H8, H32, start, len, off) {\n var i = void 0,\n om = off % 4,\n lm = (len + om) % 4,\n j = len - lm;\n switch (om) {\n case 0:\n H8[off] = str.charCodeAt(start + 3);\n case 1:\n H8[off + 1 - (om << 1) | 0] = str.charCodeAt(start + 2);\n case 2:\n H8[off + 2 - (om << 1) | 0] = str.charCodeAt(start + 1);\n case 3:\n H8[off + 3 - (om << 1) | 0] = str.charCodeAt(start);\n }\n if (len < lm + (4 - om)) {\n return;\n }\n for (i = 4 - om; i < j; i = i + 4 | 0) {\n H32[off + i >> 2] = str.charCodeAt(start + i) << 24 | str.charCodeAt(start + i + 1) << 16 | str.charCodeAt(start + i + 2) << 8 | str.charCodeAt(start + i + 3);\n }\n switch (lm) {\n case 3:\n H8[off + j + 1 | 0] = str.charCodeAt(start + j + 2);\n case 2:\n H8[off + j + 2 | 0] = str.charCodeAt(start + j + 1);\n case 1:\n H8[off + j + 3 | 0] = str.charCodeAt(start + j);\n }\n};\n\n// Convert a buffer or array and write it to the heap.\n// The buffer or array is expected to only contain elements < 256.\nvar convBuf = function (buf, H8, H32, start, len, off) {\n var i = void 0,\n om = off % 4,\n lm = (len + om) % 4,\n j = len - lm;\n switch (om) {\n case 0:\n H8[off] = buf[start + 3];\n case 1:\n H8[off + 1 - (om << 1) | 0] = buf[start + 2];\n case 2:\n H8[off + 2 - (om << 1) | 0] = buf[start + 1];\n case 3:\n H8[off + 3 - (om << 1) | 0] = buf[start];\n }\n if (len < lm + (4 - om)) {\n return;\n }\n for (i = 4 - om; i < j; i = i + 4 | 0) {\n H32[off + i >> 2 | 0] = buf[start + i] << 24 | buf[start + i + 1] << 16 | buf[start + i + 2] << 8 | buf[start + i + 3];\n }\n switch (lm) {\n case 3:\n H8[off + j + 1 | 0] = buf[start + j + 2];\n case 2:\n H8[off + j + 2 | 0] = buf[start + j + 1];\n case 1:\n H8[off + j + 3 | 0] = buf[start + j];\n }\n};\n\nvar convBlob = function (blob, H8, H32, start, len, off) {\n var i = void 0,\n om = off % 4,\n lm = (len + om) % 4,\n j = len - lm;\n var buf = new Uint8Array(reader.readAsArrayBuffer(blob.slice(start, start + len)));\n switch (om) {\n case 0:\n H8[off] = buf[3];\n case 1:\n H8[off + 1 - (om << 1) | 0] = buf[2];\n case 2:\n H8[off + 2 - (om << 1) | 0] = buf[1];\n case 3:\n H8[off + 3 - (om << 1) | 0] = buf[0];\n }\n if (len < lm + (4 - om)) {\n return;\n }\n for (i = 4 - om; i < j; i = i + 4 | 0) {\n H32[off + i >> 2 | 0] = buf[i] << 24 | buf[i + 1] << 16 | buf[i + 2] << 8 | buf[i + 3];\n }\n switch (lm) {\n case 3:\n H8[off + j + 1 | 0] = buf[j + 2];\n case 2:\n H8[off + j + 2 | 0] = buf[j + 1];\n case 1:\n H8[off + j + 3 | 0] = buf[j];\n }\n};\n\nmodule.exports = function (data, H8, H32, start, len, off) {\n if (typeof data === 'string') {\n return convStr(data, H8, H32, start, len, off);\n }\n if (data instanceof Array) {\n return convBuf(data, H8, H32, start, len, off);\n }\n // Safely doing a Buffer check using \"this\" to avoid Buffer polyfill to be included in the dist\n if (_this && _this.Buffer && _this.Buffer.isBuffer(data)) {\n return convBuf(data, H8, H32, start, len, off);\n }\n if (data instanceof ArrayBuffer) {\n return convBuf(new Uint8Array(data), H8, H32, start, len, off);\n }\n if (data.buffer instanceof ArrayBuffer) {\n return convBuf(new Uint8Array(data.buffer, data.byteOffset, data.byteLength), H8, H32, start, len, off);\n }\n if (data instanceof Blob) {\n return convBlob(data, H8, H32, start, len, off);\n }\n throw new Error('Unsupported data type.');\n};\n\n/***/ }),\n/* 7 */\n/***/ (function(module, exports, __webpack_require__) {\n\nvar _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\n/* eslint-env commonjs, browser */\n\nvar Rusha = __webpack_require__(0);\n\nvar _require = __webpack_require__(1),\n toHex = _require.toHex;\n\nvar Hash = function () {\n function Hash() {\n _classCallCheck(this, Hash);\n\n this._rusha = new Rusha();\n this._rusha.resetState();\n }\n\n Hash.prototype.update = function update(data) {\n this._rusha.append(data);\n return this;\n };\n\n Hash.prototype.digest = function digest(encoding) {\n var digest = this._rusha.rawEnd().buffer;\n if (!encoding) {\n return digest;\n }\n if (encoding === 'hex') {\n return toHex(digest);\n }\n throw new Error('unsupported digest encoding');\n };\n\n _createClass(Hash, [{\n key: 'state',\n get: function () {\n return this._rusha.getState();\n },\n set: function (state) {\n this._rusha.setState(state);\n }\n }]);\n\n return Hash;\n}();\n\nmodule.exports = function () {\n return new Hash();\n};\n\n/***/ })\n/******/ ]);\n});","/**\n * https://bugs.webkit.org/show_bug.cgi?id=226547\n * Safari has a horrible bug where IDB requests can hang while the browser is starting up.\n * The only solution is to keep nudging it until it's awake.\n * This probably creates garbage, but garbage is better than totally failing.\n */\nfunction idbReady() {\n const isSafari = !navigator.userAgentData &&\n /Safari\\//.test(navigator.userAgent) &&\n !/Chrom(e|ium)\\//.test(navigator.userAgent);\n // No point putting other browsers or older versions of Safari through this mess.\n if (!isSafari || !indexedDB.databases)\n return Promise.resolve();\n let intervalId;\n return new Promise((resolve) => {\n const tryIdb = () => indexedDB.databases().finally(resolve);\n intervalId = setInterval(tryIdb, 100);\n tryIdb();\n }).finally(() => clearInterval(intervalId));\n}\n\nexport default idbReady;\n","/*! safe-buffer. MIT License. Feross Aboukhadijeh */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\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}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\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 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 var buf = Buffer(size)\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 return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\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 return buffer.SlowBuffer(size)\n}\n","/* eslint-disable node/no-deprecated-api */\n\n'use strict'\n\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\nvar safer = {}\n\nvar key\n\nfor (key in buffer) {\n if (!buffer.hasOwnProperty(key)) continue\n if (key === 'SlowBuffer' || key === 'Buffer') continue\n safer[key] = buffer[key]\n}\n\nvar Safer = safer.Buffer = {}\nfor (key in Buffer) {\n if (!Buffer.hasOwnProperty(key)) continue\n if (key === 'allocUnsafe' || key === 'allocUnsafeSlow') continue\n Safer[key] = Buffer[key]\n}\n\nsafer.Buffer.prototype = Buffer.prototype\n\nif (!Safer.from || Safer.from === Uint8Array.from) {\n Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value === 'number') {\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value)\n }\n if (value && typeof value.length === 'undefined') {\n throw new TypeError('The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type ' + typeof value)\n }\n return Buffer(value, encodingOrOffset, length)\n }\n}\n\nif (!Safer.alloc) {\n Safer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size)\n }\n if (size < 0 || size >= 2 * (1 << 30)) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n var buf = Buffer(size)\n if (!fill || fill.length === 0) {\n buf.fill(0)\n } else if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n return buf\n }\n}\n\nif (!safer.kStringMaxLength) {\n try {\n safer.kStringMaxLength = process.binding('buffer').kStringMaxLength\n } catch (e) {\n // we can't determine kStringMaxLength in environments where process.binding\n // is unsupported, so let's not set it\n }\n}\n\nif (!safer.constants) {\n safer.constants = {\n MAX_LENGTH: safer.kMaxLength\n }\n if (safer.kStringMaxLength) {\n safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength\n }\n}\n\nmodule.exports = safer\n","var Buffer = require('safe-buffer').Buffer\n\n// prototype class for hash functions\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\n this._block[rem] = 0x80\n\n // 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 this._block.fill(0, rem + 1)\n\n if (rem >= this._finalSize) {\n this._update(this._block)\n this._block.fill(0)\n }\n\n var bits = this._len * 8\n\n // uint32\n if (bits <= 0xffffffff) {\n this._block.writeUInt32BE(bits, this._blockSize - 4)\n\n // uint64\n } else {\n var lowBits = (bits & 0xffffffff) >>> 0\n var highBits = (bits - lowBits) / 0x100000000\n\n this._block.writeUInt32BE(highBits, this._blockSize - 8)\n this._block.writeUInt32BE(lowBits, this._blockSize - 4)\n }\n\n this._update(this._block)\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\n","var exports = module.exports = function SHA (algorithm) {\n algorithm = algorithm.toLowerCase()\n\n var Algorithm = exports[algorithm]\n if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)')\n\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')\n","/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined\n * in FIPS PUB 180-1\n * This source code is derived from sha1.js of the same repository.\n * The difference between SHA-0 and SHA-1 is just a bitwise rotate left\n * operation was added.\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n]\n\nvar W = new Array(80)\n\nfunction Sha () {\n this.init()\n this._w = W\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha, Hash)\n\nSha.prototype.init = function () {\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n this._e = 0xc3d2e1f0\n\n return this\n}\n\nfunction rotl5 (num) {\n return (num << 5) | (num >>> 27)\n}\n\nfunction rotl30 (num) {\n return (num << 30) | (num >>> 2)\n}\n\nfunction ft (s, b, c, d) {\n if (s === 0) return (b & c) | ((~b) & d)\n if (s === 2) return (b & c) | (b & d) | (c & d)\n return b ^ c ^ d\n}\n\nSha.prototype._update = function (M) {\n var W = this._w\n\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\n for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n for (; i < 80; ++i) W[i] = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]\n\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20)\n var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0\n\n e = d\n d = c\n c = rotl30(b)\n b = a\n a = t\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}\n\nSha.prototype._hash = function () {\n var H = Buffer.allocUnsafe(20)\n\n H.writeInt32BE(this._a | 0, 0)\n H.writeInt32BE(this._b | 0, 4)\n H.writeInt32BE(this._c | 0, 8)\n H.writeInt32BE(this._d | 0, 12)\n H.writeInt32BE(this._e | 0, 16)\n\n return H\n}\n\nmodule.exports = Sha\n","/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\n * in FIPS PUB 180-1\n * Version 2.1a Copyright Paul Johnston 2000 - 2002.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n]\n\nvar W = new Array(80)\n\nfunction Sha1 () {\n this.init()\n this._w = W\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha1, Hash)\n\nSha1.prototype.init = function () {\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n this._e = 0xc3d2e1f0\n\n return this\n}\n\nfunction rotl1 (num) {\n return (num << 1) | (num >>> 31)\n}\n\nfunction rotl5 (num) {\n return (num << 5) | (num >>> 27)\n}\n\nfunction rotl30 (num) {\n return (num << 30) | (num >>> 2)\n}\n\nfunction ft (s, b, c, d) {\n if (s === 0) return (b & c) | ((~b) & d)\n if (s === 2) return (b & c) | (b & d) | (c & d)\n return b ^ c ^ d\n}\n\nSha1.prototype._update = function (M) {\n var W = this._w\n\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\n for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n for (; i < 80; ++i) W[i] = rotl1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16])\n\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20)\n var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0\n\n e = d\n d = c\n c = rotl30(b)\n b = a\n a = t\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}\n\nSha1.prototype._hash = function () {\n var H = Buffer.allocUnsafe(20)\n\n H.writeInt32BE(this._a | 0, 0)\n H.writeInt32BE(this._b | 0, 4)\n H.writeInt32BE(this._c | 0, 8)\n H.writeInt32BE(this._d | 0, 12)\n H.writeInt32BE(this._e | 0, 16)\n\n return H\n}\n\nmodule.exports = Sha1\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 */\n\nvar inherits = require('inherits')\nvar Sha256 = require('./sha256')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar W = new Array(64)\n\nfunction Sha224 () {\n this.init()\n\n this._w = W // new Array(64)\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha224, Sha256)\n\nSha224.prototype.init = function () {\n this._a = 0xc1059ed8\n this._b = 0x367cd507\n this._c = 0x3070dd17\n this._d = 0xf70e5939\n this._e = 0xffc00b31\n this._f = 0x68581511\n this._g = 0x64f98fa7\n this._h = 0xbefa4fa4\n\n return this\n}\n\nSha224.prototype._hash = function () {\n var H = Buffer.allocUnsafe(28)\n\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\n return H\n}\n\nmodule.exports = Sha224\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 */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,\n 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,\n 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,\n 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,\n 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,\n 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,\n 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,\n 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,\n 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,\n 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,\n 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,\n 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,\n 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,\n 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,\n 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,\n 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2\n]\n\nvar W = new Array(64)\n\nfunction Sha256 () {\n this.init()\n\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\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\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) W[i] = M.readInt32BE(i * 4)\n for (; i < 64; ++i) W[i] = (gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16]) | 0\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\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\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\n return H\n}\n\nmodule.exports = Sha256\n","var inherits = require('inherits')\nvar SHA512 = require('./sha512')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar W = new Array(160)\n\nfunction Sha384 () {\n this.init()\n this._w = W\n\n Hash.call(this, 128, 112)\n}\n\ninherits(Sha384, SHA512)\n\nSha384.prototype.init = function () {\n this._ah = 0xcbbb9d5d\n this._bh = 0x629a292a\n this._ch = 0x9159015a\n this._dh = 0x152fecd8\n this._eh = 0x67332667\n this._fh = 0x8eb44a87\n this._gh = 0xdb0c2e0d\n this._hh = 0x47b5481d\n\n this._al = 0xc1059ed8\n this._bl = 0x367cd507\n this._cl = 0x3070dd17\n this._dl = 0xf70e5939\n this._el = 0xffc00b31\n this._fl = 0x68581511\n this._gl = 0x64f98fa7\n this._hl = 0xbefa4fa4\n\n return this\n}\n\nSha384.prototype._hash = function () {\n var H = Buffer.allocUnsafe(48)\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\n return H\n}\n\nmodule.exports = Sha384\n","var inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n]\n\nvar W = new Array(160)\n\nfunction Sha512 () {\n this.init()\n this._w = W\n\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\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\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\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\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 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\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)\n\n // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]\n var Wi7h = W[i - 7 * 2]\n var Wi7l = W[i - 7 * 2 + 1]\n\n var Wi16h = W[i - 16 * 2]\n var Wi16l = W[i - 16 * 2 + 1]\n\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\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\n var majh = maj(ah, bh, ch)\n var majl = maj(al, bl, cl)\n\n var sigma0h = sigma0(ah, al)\n var sigma0l = sigma0(al, ah)\n var sigma1h = sigma1(eh, el)\n var sigma1l = sigma1(el, eh)\n\n // t1 = h + sigma1 + ch + K[j] + W[j]\n var Kih = K[j]\n var Kil = K[j + 1]\n\n var chh = Ch(eh, fh, gh)\n var chl = Ch(el, fl, gl)\n\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\n\n // t2 = sigma0 + maj\n var t2l = (sigma0l + majl) | 0\n var t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0\n\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\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\n return H\n}\n\nmodule.exports = Sha512\n","/*! simple-concat. MIT License. Feross Aboukhadijeh */\nmodule.exports = function (stream, cb) {\n var chunks = []\n stream.on('data', function (chunk) {\n chunks.push(chunk)\n })\n stream.once('end', function () {\n if (cb) cb(null, Buffer.concat(chunks))\n cb = null\n })\n stream.once('error', function (err) {\n if (cb) cb(err)\n cb = null\n })\n}\n","/*! simple-get. MIT License. Feross Aboukhadijeh */\nmodule.exports = simpleGet\n\nconst concat = require('simple-concat')\nconst decompressResponse = require('decompress-response') // excluded from browser build\nconst http = require('http')\nconst https = require('https')\nconst once = require('once')\nconst querystring = require('querystring')\nconst url = require('url')\n\nconst isStream = o => o !== null && typeof o === 'object' && typeof o.pipe === 'function'\n\nfunction simpleGet (opts, cb) {\n opts = Object.assign({ maxRedirects: 10 }, typeof opts === 'string' ? { url: opts } : opts)\n cb = once(cb)\n\n if (opts.url) {\n const { hostname, port, protocol, auth, path } = url.parse(opts.url) // eslint-disable-line node/no-deprecated-api\n delete opts.url\n if (!hostname && !port && !protocol && !auth) opts.path = path // Relative redirect\n else Object.assign(opts, { hostname, port, protocol, auth, path }) // Absolute redirect\n }\n\n const headers = { 'accept-encoding': 'gzip, deflate' }\n if (opts.headers) Object.keys(opts.headers).forEach(k => (headers[k.toLowerCase()] = opts.headers[k]))\n opts.headers = headers\n\n let body\n if (opts.body) {\n body = opts.json && !isStream(opts.body) ? JSON.stringify(opts.body) : opts.body\n } else if (opts.form) {\n body = typeof opts.form === 'string' ? opts.form : querystring.stringify(opts.form)\n opts.headers['content-type'] = 'application/x-www-form-urlencoded'\n }\n\n if (body) {\n if (!opts.method) opts.method = 'POST'\n if (!isStream(body)) opts.headers['content-length'] = Buffer.byteLength(body)\n if (opts.json && !opts.form) opts.headers['content-type'] = 'application/json'\n }\n delete opts.body; delete opts.form\n\n if (opts.json) opts.headers.accept = 'application/json'\n if (opts.method) opts.method = opts.method.toUpperCase()\n\n const protocol = opts.protocol === 'https:' ? https : http // Support http/https urls\n const req = protocol.request(opts, res => {\n if (opts.followRedirects !== false && res.statusCode >= 300 && res.statusCode < 400 && res.headers.location) {\n opts.url = res.headers.location // Follow 3xx redirects\n delete opts.headers.host // Discard `host` header on redirect (see #32)\n res.resume() // Discard response\n\n if (opts.method === 'POST' && [301, 302].includes(res.statusCode)) {\n opts.method = 'GET' // On 301/302 redirect, change POST to GET (see #35)\n delete opts.headers['content-length']; delete opts.headers['content-type']\n }\n\n if (opts.maxRedirects-- === 0) return cb(new Error('too many redirects'))\n else return simpleGet(opts, cb)\n }\n\n const tryUnzip = typeof decompressResponse === 'function' && opts.method !== 'HEAD'\n cb(null, tryUnzip ? decompressResponse(res) : res)\n })\n req.on('timeout', () => {\n req.abort()\n cb(new Error('Request timed out'))\n })\n req.on('error', cb)\n\n if (isStream(body)) body.on('error', cb).pipe(req)\n else req.end(body)\n\n return req\n}\n\nsimpleGet.concat = (opts, cb) => {\n return simpleGet(opts, (err, res) => {\n if (err) return cb(err)\n concat(res, (err, data) => {\n if (err) return cb(err)\n if (opts.json) {\n try {\n data = JSON.parse(data.toString())\n } catch (err) {\n return cb(err, res, data)\n }\n }\n cb(null, res, data)\n })\n })\n}\n\n;['get', 'post', 'put', 'patch', 'head', 'delete'].forEach(method => {\n simpleGet[method] = (opts, cb) => {\n if (typeof opts === 'string') opts = { url: opts }\n return simpleGet(Object.assign({ method: method.toUpperCase() }, opts), cb)\n }\n})\n","/*! simple-peer. MIT License. Feross Aboukhadijeh */\nconst debug = require('debug')('simple-peer')\nconst getBrowserRTC = require('get-browser-rtc')\nconst randombytes = require('randombytes')\nconst stream = require('readable-stream')\nconst queueMicrotask = require('queue-microtask') // TODO: remove when Node 10 is not supported\nconst errCode = require('err-code')\nconst { Buffer } = require('buffer')\n\nconst MAX_BUFFERED_AMOUNT = 64 * 1024\nconst ICECOMPLETE_TIMEOUT = 5 * 1000\nconst CHANNEL_CLOSING_TIMEOUT = 5 * 1000\n\n// HACK: Filter trickle lines when trickle is disabled #354\nfunction filterTrickle (sdp) {\n return sdp.replace(/a=ice-options:trickle\\s\\n/g, '')\n}\n\nfunction warn (message) {\n console.warn(message)\n}\n\n/**\n * WebRTC peer connection. Same API as node core `net.Socket`, plus a few extra methods.\n * Duplex stream.\n * @param {Object} opts\n */\nclass Peer extends stream.Duplex {\n constructor (opts) {\n opts = Object.assign({\n allowHalfOpen: false\n }, opts)\n\n super(opts)\n\n this._id = randombytes(4).toString('hex').slice(0, 7)\n this._debug('new peer %o', opts)\n\n this.channelName = opts.initiator\n ? opts.channelName || randombytes(20).toString('hex')\n : null\n\n this.initiator = opts.initiator || false\n this.channelConfig = opts.channelConfig || Peer.channelConfig\n this.channelNegotiated = this.channelConfig.negotiated\n this.config = Object.assign({}, Peer.config, opts.config)\n this.offerOptions = opts.offerOptions || {}\n this.answerOptions = opts.answerOptions || {}\n this.sdpTransform = opts.sdpTransform || (sdp => sdp)\n this.streams = opts.streams || (opts.stream ? [opts.stream] : []) // support old \"stream\" option\n this.trickle = opts.trickle !== undefined ? opts.trickle : true\n this.allowHalfTrickle = opts.allowHalfTrickle !== undefined ? opts.allowHalfTrickle : false\n this.iceCompleteTimeout = opts.iceCompleteTimeout || ICECOMPLETE_TIMEOUT\n\n this.destroyed = false\n this.destroying = false\n this._connected = false\n\n this.remoteAddress = undefined\n this.remoteFamily = undefined\n this.remotePort = undefined\n this.localAddress = undefined\n this.localFamily = undefined\n this.localPort = undefined\n\n this._wrtc = (opts.wrtc && typeof opts.wrtc === 'object')\n ? opts.wrtc\n : getBrowserRTC()\n\n if (!this._wrtc) {\n if (typeof window === 'undefined') {\n throw errCode(new Error('No WebRTC support: Specify `opts.wrtc` option in this environment'), 'ERR_WEBRTC_SUPPORT')\n } else {\n throw errCode(new Error('No WebRTC support: Not a supported browser'), 'ERR_WEBRTC_SUPPORT')\n }\n }\n\n this._pcReady = false\n this._channelReady = false\n this._iceComplete = false // ice candidate trickle done (got null candidate)\n this._iceCompleteTimer = null // send an offer/answer anyway after some timeout\n this._channel = null\n this._pendingCandidates = []\n\n this._isNegotiating = false // is this peer waiting for negotiation to complete?\n this._firstNegotiation = true\n this._batchedNegotiation = false // batch synchronous negotiations\n this._queuedNegotiation = false // is there a queued negotiation request?\n this._sendersAwaitingStable = []\n this._senderMap = new Map()\n this._closingInterval = null\n\n this._remoteTracks = []\n this._remoteStreams = []\n\n this._chunk = null\n this._cb = null\n this._interval = null\n\n try {\n this._pc = new (this._wrtc.RTCPeerConnection)(this.config)\n } catch (err) {\n this.destroy(errCode(err, 'ERR_PC_CONSTRUCTOR'))\n return\n }\n\n // We prefer feature detection whenever possible, but sometimes that's not\n // possible for certain implementations.\n this._isReactNativeWebrtc = typeof this._pc._peerConnectionId === 'number'\n\n this._pc.oniceconnectionstatechange = () => {\n this._onIceStateChange()\n }\n this._pc.onicegatheringstatechange = () => {\n this._onIceStateChange()\n }\n this._pc.onconnectionstatechange = () => {\n this._onConnectionStateChange()\n }\n this._pc.onsignalingstatechange = () => {\n this._onSignalingStateChange()\n }\n this._pc.onicecandidate = event => {\n this._onIceCandidate(event)\n }\n\n // HACK: Fix for odd Firefox behavior, see: https://github.com/feross/simple-peer/pull/783\n if (typeof this._pc.peerIdentity === 'object') {\n this._pc.peerIdentity.catch(err => {\n this.destroy(errCode(err, 'ERR_PC_PEER_IDENTITY'))\n })\n }\n\n // Other spec events, unused by this implementation:\n // - onconnectionstatechange\n // - onicecandidateerror\n // - onfingerprintfailure\n // - onnegotiationneeded\n\n if (this.initiator || this.channelNegotiated) {\n this._setupData({\n channel: this._pc.createDataChannel(this.channelName, this.channelConfig)\n })\n } else {\n this._pc.ondatachannel = event => {\n this._setupData(event)\n }\n }\n\n if (this.streams) {\n this.streams.forEach(stream => {\n this.addStream(stream)\n })\n }\n this._pc.ontrack = event => {\n this._onTrack(event)\n }\n\n this._debug('initial negotiation')\n this._needsNegotiation()\n\n this._onFinishBound = () => {\n this._onFinish()\n }\n this.once('finish', this._onFinishBound)\n }\n\n get bufferSize () {\n return (this._channel && this._channel.bufferedAmount) || 0\n }\n\n // HACK: it's possible channel.readyState is \"closing\" before peer.destroy() fires\n // https://bugs.chromium.org/p/chromium/issues/detail?id=882743\n get connected () {\n return (this._connected && this._channel.readyState === 'open')\n }\n\n address () {\n return { port: this.localPort, family: this.localFamily, address: this.localAddress }\n }\n\n signal (data) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot signal after peer is destroyed'), 'ERR_DESTROYED')\n if (typeof data === 'string') {\n try {\n data = JSON.parse(data)\n } catch (err) {\n data = {}\n }\n }\n this._debug('signal()')\n\n if (data.renegotiate && this.initiator) {\n this._debug('got request to renegotiate')\n this._needsNegotiation()\n }\n if (data.transceiverRequest && this.initiator) {\n this._debug('got request for transceiver')\n this.addTransceiver(data.transceiverRequest.kind, data.transceiverRequest.init)\n }\n if (data.candidate) {\n if (this._pc.remoteDescription && this._pc.remoteDescription.type) {\n this._addIceCandidate(data.candidate)\n } else {\n this._pendingCandidates.push(data.candidate)\n }\n }\n if (data.sdp) {\n this._pc.setRemoteDescription(new (this._wrtc.RTCSessionDescription)(data))\n .then(() => {\n if (this.destroyed) return\n\n this._pendingCandidates.forEach(candidate => {\n this._addIceCandidate(candidate)\n })\n this._pendingCandidates = []\n\n if (this._pc.remoteDescription.type === 'offer') this._createAnswer()\n })\n .catch(err => {\n this.destroy(errCode(err, 'ERR_SET_REMOTE_DESCRIPTION'))\n })\n }\n if (!data.sdp && !data.candidate && !data.renegotiate && !data.transceiverRequest) {\n this.destroy(errCode(new Error('signal() called with invalid signal data'), 'ERR_SIGNALING'))\n }\n }\n\n _addIceCandidate (candidate) {\n const iceCandidateObj = new this._wrtc.RTCIceCandidate(candidate)\n this._pc.addIceCandidate(iceCandidateObj)\n .catch(err => {\n if (!iceCandidateObj.address || iceCandidateObj.address.endsWith('.local')) {\n warn('Ignoring unsupported ICE candidate.')\n } else {\n this.destroy(errCode(err, 'ERR_ADD_ICE_CANDIDATE'))\n }\n })\n }\n\n /**\n * Send text/binary data to the remote peer.\n * @param {ArrayBufferView|ArrayBuffer|Buffer|string|Blob} chunk\n */\n send (chunk) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot send after peer is destroyed'), 'ERR_DESTROYED')\n this._channel.send(chunk)\n }\n\n /**\n * Add a Transceiver to the connection.\n * @param {String} kind\n * @param {Object} init\n */\n addTransceiver (kind, init) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot addTransceiver after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('addTransceiver()')\n\n if (this.initiator) {\n try {\n this._pc.addTransceiver(kind, init)\n this._needsNegotiation()\n } catch (err) {\n this.destroy(errCode(err, 'ERR_ADD_TRANSCEIVER'))\n }\n } else {\n this.emit('signal', { // request initiator to renegotiate\n type: 'transceiverRequest',\n transceiverRequest: { kind, init }\n })\n }\n }\n\n /**\n * Add a MediaStream to the connection.\n * @param {MediaStream} stream\n */\n addStream (stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot addStream after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('addStream()')\n\n stream.getTracks().forEach(track => {\n this.addTrack(track, stream)\n })\n }\n\n /**\n * Add a MediaStreamTrack to the connection.\n * @param {MediaStreamTrack} track\n * @param {MediaStream} stream\n */\n addTrack (track, stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot addTrack after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('addTrack()')\n\n const submap = this._senderMap.get(track) || new Map() // nested Maps map [track, stream] to sender\n let sender = submap.get(stream)\n if (!sender) {\n sender = this._pc.addTrack(track, stream)\n submap.set(stream, sender)\n this._senderMap.set(track, submap)\n this._needsNegotiation()\n } else if (sender.removed) {\n throw errCode(new Error('Track has been removed. You should enable/disable tracks that you want to re-add.'), 'ERR_SENDER_REMOVED')\n } else {\n throw errCode(new Error('Track has already been added to that stream.'), 'ERR_SENDER_ALREADY_ADDED')\n }\n }\n\n /**\n * Replace a MediaStreamTrack by another in the connection.\n * @param {MediaStreamTrack} oldTrack\n * @param {MediaStreamTrack} newTrack\n * @param {MediaStream} stream\n */\n replaceTrack (oldTrack, newTrack, stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot replaceTrack after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('replaceTrack()')\n\n const submap = this._senderMap.get(oldTrack)\n const sender = submap ? submap.get(stream) : null\n if (!sender) {\n throw errCode(new Error('Cannot replace track that was never added.'), 'ERR_TRACK_NOT_ADDED')\n }\n if (newTrack) this._senderMap.set(newTrack, submap)\n\n if (sender.replaceTrack != null) {\n sender.replaceTrack(newTrack)\n } else {\n this.destroy(errCode(new Error('replaceTrack is not supported in this browser'), 'ERR_UNSUPPORTED_REPLACETRACK'))\n }\n }\n\n /**\n * Remove a MediaStreamTrack from the connection.\n * @param {MediaStreamTrack} track\n * @param {MediaStream} stream\n */\n removeTrack (track, stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot removeTrack after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('removeSender()')\n\n const submap = this._senderMap.get(track)\n const sender = submap ? submap.get(stream) : null\n if (!sender) {\n throw errCode(new Error('Cannot remove track that was never added.'), 'ERR_TRACK_NOT_ADDED')\n }\n try {\n sender.removed = true\n this._pc.removeTrack(sender)\n } catch (err) {\n if (err.name === 'NS_ERROR_UNEXPECTED') {\n this._sendersAwaitingStable.push(sender) // HACK: Firefox must wait until (signalingState === stable) https://bugzilla.mozilla.org/show_bug.cgi?id=1133874\n } else {\n this.destroy(errCode(err, 'ERR_REMOVE_TRACK'))\n }\n }\n this._needsNegotiation()\n }\n\n /**\n * Remove a MediaStream from the connection.\n * @param {MediaStream} stream\n */\n removeStream (stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot removeStream after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('removeSenders()')\n\n stream.getTracks().forEach(track => {\n this.removeTrack(track, stream)\n })\n }\n\n _needsNegotiation () {\n this._debug('_needsNegotiation')\n if (this._batchedNegotiation) return // batch synchronous renegotiations\n this._batchedNegotiation = true\n queueMicrotask(() => {\n this._batchedNegotiation = false\n if (this.initiator || !this._firstNegotiation) {\n this._debug('starting batched negotiation')\n this.negotiate()\n } else {\n this._debug('non-initiator initial negotiation request discarded')\n }\n this._firstNegotiation = false\n })\n }\n\n negotiate () {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot negotiate after peer is destroyed'), 'ERR_DESTROYED')\n\n if (this.initiator) {\n if (this._isNegotiating) {\n this._queuedNegotiation = true\n this._debug('already negotiating, queueing')\n } else {\n this._debug('start negotiation')\n setTimeout(() => { // HACK: Chrome crashes if we immediately call createOffer\n this._createOffer()\n }, 0)\n }\n } else {\n if (this._isNegotiating) {\n this._queuedNegotiation = true\n this._debug('already negotiating, queueing')\n } else {\n this._debug('requesting negotiation from initiator')\n this.emit('signal', { // request initiator to renegotiate\n type: 'renegotiate',\n renegotiate: true\n })\n }\n }\n this._isNegotiating = true\n }\n\n // TODO: Delete this method once readable-stream is updated to contain a default\n // implementation of destroy() that automatically calls _destroy()\n // See: https://github.com/nodejs/readable-stream/issues/283\n destroy (err) {\n this._destroy(err, () => {})\n }\n\n _destroy (err, cb) {\n if (this.destroyed || this.destroying) return\n this.destroying = true\n\n this._debug('destroying (error: %s)', err && (err.message || err))\n\n queueMicrotask(() => { // allow events concurrent with the call to _destroy() to fire (see #692)\n this.destroyed = true\n this.destroying = false\n\n this._debug('destroy (error: %s)', err && (err.message || err))\n\n this.readable = this.writable = false\n\n if (!this._readableState.ended) this.push(null)\n if (!this._writableState.finished) this.end()\n\n this._connected = false\n this._pcReady = false\n this._channelReady = false\n this._remoteTracks = null\n this._remoteStreams = null\n this._senderMap = null\n\n clearInterval(this._closingInterval)\n this._closingInterval = null\n\n clearInterval(this._interval)\n this._interval = null\n this._chunk = null\n this._cb = null\n\n if (this._onFinishBound) this.removeListener('finish', this._onFinishBound)\n this._onFinishBound = null\n\n if (this._channel) {\n try {\n this._channel.close()\n } catch (err) {}\n\n // allow events concurrent with destruction to be handled\n this._channel.onmessage = null\n this._channel.onopen = null\n this._channel.onclose = null\n this._channel.onerror = null\n }\n if (this._pc) {\n try {\n this._pc.close()\n } catch (err) {}\n\n // allow events concurrent with destruction to be handled\n this._pc.oniceconnectionstatechange = null\n this._pc.onicegatheringstatechange = null\n this._pc.onsignalingstatechange = null\n this._pc.onicecandidate = null\n this._pc.ontrack = null\n this._pc.ondatachannel = null\n }\n this._pc = null\n this._channel = null\n\n if (err) this.emit('error', err)\n this.emit('close')\n cb()\n })\n }\n\n _setupData (event) {\n if (!event.channel) {\n // In some situations `pc.createDataChannel()` returns `undefined` (in wrtc),\n // which is invalid behavior. Handle it gracefully.\n // See: https://github.com/feross/simple-peer/issues/163\n return this.destroy(errCode(new Error('Data channel event is missing `channel` property'), 'ERR_DATA_CHANNEL'))\n }\n\n this._channel = event.channel\n this._channel.binaryType = 'arraybuffer'\n\n if (typeof this._channel.bufferedAmountLowThreshold === 'number') {\n this._channel.bufferedAmountLowThreshold = MAX_BUFFERED_AMOUNT\n }\n\n this.channelName = this._channel.label\n\n this._channel.onmessage = event => {\n this._onChannelMessage(event)\n }\n this._channel.onbufferedamountlow = () => {\n this._onChannelBufferedAmountLow()\n }\n this._channel.onopen = () => {\n this._onChannelOpen()\n }\n this._channel.onclose = () => {\n this._onChannelClose()\n }\n this._channel.onerror = event => {\n const err = event.error instanceof Error\n ? event.error\n : new Error(`Datachannel error: ${event.message} ${event.filename}:${event.lineno}:${event.colno}`)\n this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n }\n\n // HACK: Chrome will sometimes get stuck in readyState \"closing\", let's check for this condition\n // https://bugs.chromium.org/p/chromium/issues/detail?id=882743\n let isClosing = false\n this._closingInterval = setInterval(() => { // No \"onclosing\" event\n if (this._channel && this._channel.readyState === 'closing') {\n if (isClosing) this._onChannelClose() // closing timed out: equivalent to onclose firing\n isClosing = true\n } else {\n isClosing = false\n }\n }, CHANNEL_CLOSING_TIMEOUT)\n }\n\n _read () {}\n\n _write (chunk, encoding, cb) {\n if (this.destroyed) return cb(errCode(new Error('cannot write after peer is destroyed'), 'ERR_DATA_CHANNEL'))\n\n if (this._connected) {\n try {\n this.send(chunk)\n } catch (err) {\n return this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n }\n if (this._channel.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n this._debug('start backpressure: bufferedAmount %d', this._channel.bufferedAmount)\n this._cb = cb\n } else {\n cb(null)\n }\n } else {\n this._debug('write before connect')\n this._chunk = chunk\n this._cb = cb\n }\n }\n\n // When stream finishes writing, close socket. Half open connections are not\n // supported.\n _onFinish () {\n if (this.destroyed) return\n\n // Wait a bit before destroying so the socket flushes.\n // TODO: is there a more reliable way to accomplish this?\n const destroySoon = () => {\n setTimeout(() => this.destroy(), 1000)\n }\n\n if (this._connected) {\n destroySoon()\n } else {\n this.once('connect', destroySoon)\n }\n }\n\n _startIceCompleteTimeout () {\n if (this.destroyed) return\n if (this._iceCompleteTimer) return\n this._debug('started iceComplete timeout')\n this._iceCompleteTimer = setTimeout(() => {\n if (!this._iceComplete) {\n this._iceComplete = true\n this._debug('iceComplete timeout completed')\n this.emit('iceTimeout')\n this.emit('_iceComplete')\n }\n }, this.iceCompleteTimeout)\n }\n\n _createOffer () {\n if (this.destroyed) return\n\n this._pc.createOffer(this.offerOptions)\n .then(offer => {\n if (this.destroyed) return\n if (!this.trickle && !this.allowHalfTrickle) offer.sdp = filterTrickle(offer.sdp)\n offer.sdp = this.sdpTransform(offer.sdp)\n\n const sendOffer = () => {\n if (this.destroyed) return\n const signal = this._pc.localDescription || offer\n this._debug('signal')\n this.emit('signal', {\n type: signal.type,\n sdp: signal.sdp\n })\n }\n\n const onSuccess = () => {\n this._debug('createOffer success')\n if (this.destroyed) return\n if (this.trickle || this._iceComplete) sendOffer()\n else this.once('_iceComplete', sendOffer) // wait for candidates\n }\n\n const onError = err => {\n this.destroy(errCode(err, 'ERR_SET_LOCAL_DESCRIPTION'))\n }\n\n this._pc.setLocalDescription(offer)\n .then(onSuccess)\n .catch(onError)\n })\n .catch(err => {\n this.destroy(errCode(err, 'ERR_CREATE_OFFER'))\n })\n }\n\n _requestMissingTransceivers () {\n if (this._pc.getTransceivers) {\n this._pc.getTransceivers().forEach(transceiver => {\n if (!transceiver.mid && transceiver.sender.track && !transceiver.requested) {\n transceiver.requested = true // HACK: Safari returns negotiated transceivers with a null mid\n this.addTransceiver(transceiver.sender.track.kind)\n }\n })\n }\n }\n\n _createAnswer () {\n if (this.destroyed) return\n\n this._pc.createAnswer(this.answerOptions)\n .then(answer => {\n if (this.destroyed) return\n if (!this.trickle && !this.allowHalfTrickle) answer.sdp = filterTrickle(answer.sdp)\n answer.sdp = this.sdpTransform(answer.sdp)\n\n const sendAnswer = () => {\n if (this.destroyed) return\n const signal = this._pc.localDescription || answer\n this._debug('signal')\n this.emit('signal', {\n type: signal.type,\n sdp: signal.sdp\n })\n if (!this.initiator) this._requestMissingTransceivers()\n }\n\n const onSuccess = () => {\n if (this.destroyed) return\n if (this.trickle || this._iceComplete) sendAnswer()\n else this.once('_iceComplete', sendAnswer)\n }\n\n const onError = err => {\n this.destroy(errCode(err, 'ERR_SET_LOCAL_DESCRIPTION'))\n }\n\n this._pc.setLocalDescription(answer)\n .then(onSuccess)\n .catch(onError)\n })\n .catch(err => {\n this.destroy(errCode(err, 'ERR_CREATE_ANSWER'))\n })\n }\n\n _onConnectionStateChange () {\n if (this.destroyed) return\n if (this._pc.connectionState === 'failed') {\n this.destroy(errCode(new Error('Connection failed.'), 'ERR_CONNECTION_FAILURE'))\n }\n }\n\n _onIceStateChange () {\n if (this.destroyed) return\n const iceConnectionState = this._pc.iceConnectionState\n const iceGatheringState = this._pc.iceGatheringState\n\n this._debug(\n 'iceStateChange (connection: %s) (gathering: %s)',\n iceConnectionState,\n iceGatheringState\n )\n this.emit('iceStateChange', iceConnectionState, iceGatheringState)\n\n if (iceConnectionState === 'connected' || iceConnectionState === 'completed') {\n this._pcReady = true\n this._maybeReady()\n }\n if (iceConnectionState === 'failed') {\n this.destroy(errCode(new Error('Ice connection failed.'), 'ERR_ICE_CONNECTION_FAILURE'))\n }\n if (iceConnectionState === 'closed') {\n this.destroy(errCode(new Error('Ice connection closed.'), 'ERR_ICE_CONNECTION_CLOSED'))\n }\n }\n\n getStats (cb) {\n // statreports can come with a value array instead of properties\n const flattenValues = report => {\n if (Object.prototype.toString.call(report.values) === '[object Array]') {\n report.values.forEach(value => {\n Object.assign(report, value)\n })\n }\n return report\n }\n\n // Promise-based getStats() (standard)\n if (this._pc.getStats.length === 0 || this._isReactNativeWebrtc) {\n this._pc.getStats()\n .then(res => {\n const reports = []\n res.forEach(report => {\n reports.push(flattenValues(report))\n })\n cb(null, reports)\n }, err => cb(err))\n\n // Single-parameter callback-based getStats() (non-standard)\n } else if (this._pc.getStats.length > 0) {\n this._pc.getStats(res => {\n // If we destroy connection in `connect` callback this code might happen to run when actual connection is already closed\n if (this.destroyed) return\n\n const reports = []\n res.result().forEach(result => {\n const report = {}\n result.names().forEach(name => {\n report[name] = result.stat(name)\n })\n report.id = result.id\n report.type = result.type\n report.timestamp = result.timestamp\n reports.push(flattenValues(report))\n })\n cb(null, reports)\n }, err => cb(err))\n\n // Unknown browser, skip getStats() since it's anyone's guess which style of\n // getStats() they implement.\n } else {\n cb(null, [])\n }\n }\n\n _maybeReady () {\n this._debug('maybeReady pc %s channel %s', this._pcReady, this._channelReady)\n if (this._connected || this._connecting || !this._pcReady || !this._channelReady) return\n\n this._connecting = true\n\n // HACK: We can't rely on order here, for details see https://github.com/js-platform/node-webrtc/issues/339\n const findCandidatePair = () => {\n if (this.destroyed) return\n\n this.getStats((err, items) => {\n if (this.destroyed) return\n\n // Treat getStats error as non-fatal. It's not essential.\n if (err) items = []\n\n const remoteCandidates = {}\n const localCandidates = {}\n const candidatePairs = {}\n let foundSelectedCandidatePair = false\n\n items.forEach(item => {\n // TODO: Once all browsers support the hyphenated stats report types, remove\n // the non-hypenated ones\n if (item.type === 'remotecandidate' || item.type === 'remote-candidate') {\n remoteCandidates[item.id] = item\n }\n if (item.type === 'localcandidate' || item.type === 'local-candidate') {\n localCandidates[item.id] = item\n }\n if (item.type === 'candidatepair' || item.type === 'candidate-pair') {\n candidatePairs[item.id] = item\n }\n })\n\n const setSelectedCandidatePair = selectedCandidatePair => {\n foundSelectedCandidatePair = true\n\n let local = localCandidates[selectedCandidatePair.localCandidateId]\n\n if (local && (local.ip || local.address)) {\n // Spec\n this.localAddress = local.ip || local.address\n this.localPort = Number(local.port)\n } else if (local && local.ipAddress) {\n // Firefox\n this.localAddress = local.ipAddress\n this.localPort = Number(local.portNumber)\n } else if (typeof selectedCandidatePair.googLocalAddress === 'string') {\n // TODO: remove this once Chrome 58 is released\n local = selectedCandidatePair.googLocalAddress.split(':')\n this.localAddress = local[0]\n this.localPort = Number(local[1])\n }\n if (this.localAddress) {\n this.localFamily = this.localAddress.includes(':') ? 'IPv6' : 'IPv4'\n }\n\n let remote = remoteCandidates[selectedCandidatePair.remoteCandidateId]\n\n if (remote && (remote.ip || remote.address)) {\n // Spec\n this.remoteAddress = remote.ip || remote.address\n this.remotePort = Number(remote.port)\n } else if (remote && remote.ipAddress) {\n // Firefox\n this.remoteAddress = remote.ipAddress\n this.remotePort = Number(remote.portNumber)\n } else if (typeof selectedCandidatePair.googRemoteAddress === 'string') {\n // TODO: remove this once Chrome 58 is released\n remote = selectedCandidatePair.googRemoteAddress.split(':')\n this.remoteAddress = remote[0]\n this.remotePort = Number(remote[1])\n }\n if (this.remoteAddress) {\n this.remoteFamily = this.remoteAddress.includes(':') ? 'IPv6' : 'IPv4'\n }\n\n this._debug(\n 'connect local: %s:%s remote: %s:%s',\n this.localAddress,\n this.localPort,\n this.remoteAddress,\n this.remotePort\n )\n }\n\n items.forEach(item => {\n // Spec-compliant\n if (item.type === 'transport' && item.selectedCandidatePairId) {\n setSelectedCandidatePair(candidatePairs[item.selectedCandidatePairId])\n }\n\n // Old implementations\n if (\n (item.type === 'googCandidatePair' && item.googActiveConnection === 'true') ||\n ((item.type === 'candidatepair' || item.type === 'candidate-pair') && item.selected)\n ) {\n setSelectedCandidatePair(item)\n }\n })\n\n // Ignore candidate pair selection in browsers like Safari 11 that do not have any local or remote candidates\n // But wait until at least 1 candidate pair is available\n if (!foundSelectedCandidatePair && (!Object.keys(candidatePairs).length || Object.keys(localCandidates).length)) {\n setTimeout(findCandidatePair, 100)\n return\n } else {\n this._connecting = false\n this._connected = true\n }\n\n if (this._chunk) {\n try {\n this.send(this._chunk)\n } catch (err) {\n return this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n }\n this._chunk = null\n this._debug('sent chunk from \"write before connect\"')\n\n const cb = this._cb\n this._cb = null\n cb(null)\n }\n\n // If `bufferedAmountLowThreshold` and 'onbufferedamountlow' are unsupported,\n // fallback to using setInterval to implement backpressure.\n if (typeof this._channel.bufferedAmountLowThreshold !== 'number') {\n this._interval = setInterval(() => this._onInterval(), 150)\n if (this._interval.unref) this._interval.unref()\n }\n\n this._debug('connect')\n this.emit('connect')\n })\n }\n findCandidatePair()\n }\n\n _onInterval () {\n if (!this._cb || !this._channel || this._channel.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n return\n }\n this._onChannelBufferedAmountLow()\n }\n\n _onSignalingStateChange () {\n if (this.destroyed) return\n\n if (this._pc.signalingState === 'stable') {\n this._isNegotiating = false\n\n // HACK: Firefox doesn't yet support removing tracks when signalingState !== 'stable'\n this._debug('flushing sender queue', this._sendersAwaitingStable)\n this._sendersAwaitingStable.forEach(sender => {\n this._pc.removeTrack(sender)\n this._queuedNegotiation = true\n })\n this._sendersAwaitingStable = []\n\n if (this._queuedNegotiation) {\n this._debug('flushing negotiation queue')\n this._queuedNegotiation = false\n this._needsNegotiation() // negotiate again\n } else {\n this._debug('negotiated')\n this.emit('negotiated')\n }\n }\n\n this._debug('signalingStateChange %s', this._pc.signalingState)\n this.emit('signalingStateChange', this._pc.signalingState)\n }\n\n _onIceCandidate (event) {\n if (this.destroyed) return\n if (event.candidate && this.trickle) {\n this.emit('signal', {\n type: 'candidate',\n candidate: {\n candidate: event.candidate.candidate,\n sdpMLineIndex: event.candidate.sdpMLineIndex,\n sdpMid: event.candidate.sdpMid\n }\n })\n } else if (!event.candidate && !this._iceComplete) {\n this._iceComplete = true\n this.emit('_iceComplete')\n }\n // as soon as we've received one valid candidate start timeout\n if (event.candidate) {\n this._startIceCompleteTimeout()\n }\n }\n\n _onChannelMessage (event) {\n if (this.destroyed) return\n let data = event.data\n if (data instanceof ArrayBuffer) data = Buffer.from(data)\n this.push(data)\n }\n\n _onChannelBufferedAmountLow () {\n if (this.destroyed || !this._cb) return\n this._debug('ending backpressure: bufferedAmount %d', this._channel.bufferedAmount)\n const cb = this._cb\n this._cb = null\n cb(null)\n }\n\n _onChannelOpen () {\n if (this._connected || this.destroyed) return\n this._debug('on channel open')\n this._channelReady = true\n this._maybeReady()\n }\n\n _onChannelClose () {\n if (this.destroyed) return\n this._debug('on channel close')\n this.destroy()\n }\n\n _onTrack (event) {\n if (this.destroyed) return\n\n event.streams.forEach(eventStream => {\n this._debug('on track')\n this.emit('track', event.track, eventStream)\n\n this._remoteTracks.push({\n track: event.track,\n stream: eventStream\n })\n\n if (this._remoteStreams.some(remoteStream => {\n return remoteStream.id === eventStream.id\n })) return // Only fire one 'stream' event, even though there may be multiple tracks per stream\n\n this._remoteStreams.push(eventStream)\n queueMicrotask(() => {\n this._debug('on stream')\n this.emit('stream', eventStream) // ensure all tracks have been added\n })\n })\n }\n\n _debug () {\n const args = [].slice.call(arguments)\n args[0] = '[' + this._id + '] ' + args[0]\n debug.apply(null, args)\n }\n}\n\nPeer.WEBRTC_SUPPORT = !!getBrowserRTC()\n\n/**\n * Expose peer and data channel config for overriding all Peer\n * instances. Otherwise, just set opts.config or opts.channelConfig\n * when constructing a Peer.\n */\nPeer.config = {\n iceServers: [\n {\n urls: [\n 'stun:stun.l.google.com:19302',\n 'stun:global.stun.twilio.com:3478'\n ]\n }\n ],\n sdpSemantics: 'unified-plan'\n}\n\nPeer.channelConfig = {}\n\nmodule.exports = Peer\n","/* global self */\n\nconst Rusha = require('rusha')\nconst rushaWorkerSha1 = require('./rusha-worker-sha1')\n\nconst rusha = new Rusha()\nconst scope = typeof window !== 'undefined' ? window : self\nconst crypto = scope.crypto || scope.msCrypto || {}\nlet subtle = crypto.subtle || crypto.webkitSubtle\n\nfunction sha1sync (buf) {\n return rusha.digest(buf)\n}\n\n// Browsers throw if they lack support for an algorithm.\n// Promise will be rejected on non-secure origins. (http://goo.gl/lq4gCo)\ntry {\n subtle.digest({ name: 'sha-1' }, new Uint8Array()).catch(function () {\n subtle = false\n })\n} catch (err) { subtle = false }\n\nfunction sha1 (buf, cb) {\n if (!subtle) {\n if (typeof window !== 'undefined') {\n rushaWorkerSha1(buf, function onRushaWorkerSha1 (err, hash) {\n if (err) {\n // On error, fallback to synchronous method which cannot fail\n cb(sha1sync(buf))\n return\n }\n\n cb(hash)\n })\n } else {\n queueMicrotask(() => cb(sha1sync(buf)))\n }\n return\n }\n\n if (typeof buf === 'string') {\n buf = uint8array(buf)\n }\n\n subtle.digest({ name: 'sha-1' }, buf)\n .then(function succeed (result) {\n cb(hex(new Uint8Array(result)))\n },\n function fail () {\n // On error, fallback to synchronous method which cannot fail\n cb(sha1sync(buf))\n })\n}\n\nfunction uint8array (s) {\n const l = s.length\n const array = new Uint8Array(l)\n for (let i = 0; i < l; i++) {\n array[i] = s.charCodeAt(i)\n }\n return array\n}\n\nfunction hex (buf) {\n const l = buf.length\n const chars = []\n for (let i = 0; i < l; i++) {\n const bite = buf[i]\n chars.push((bite >>> 4).toString(16))\n chars.push((bite & 0x0f).toString(16))\n }\n return chars.join('')\n}\n\nmodule.exports = sha1\nmodule.exports.sync = sha1sync\n","const Rusha = require('rusha')\n\nlet worker\nlet nextTaskId\nlet cbs\n\nfunction init () {\n worker = Rusha.createWorker()\n nextTaskId = 1\n cbs = {} // taskId -> cb\n\n worker.onmessage = function onRushaMessage (e) {\n const taskId = e.data.id\n const cb = cbs[taskId]\n delete cbs[taskId]\n\n if (e.data.error != null) {\n cb(new Error('Rusha worker error: ' + e.data.error))\n } else {\n cb(null, e.data.hash)\n }\n }\n}\n\nfunction sha1 (buf, cb) {\n if (!worker) init()\n\n cbs[nextTaskId] = cb\n worker.postMessage({ id: nextTaskId, data: buf })\n nextTaskId += 1\n}\n\nmodule.exports = sha1\n","/*! simple-websocket. MIT License. Feross Aboukhadijeh */\n/* global WebSocket */\n\nconst debug = require('debug')('simple-websocket')\nconst randombytes = require('randombytes')\nconst stream = require('readable-stream')\nconst queueMicrotask = require('queue-microtask') // TODO: remove when Node 10 is not supported\nconst ws = require('ws') // websockets in node - will be empty object in browser\n\nconst _WebSocket = typeof ws !== 'function' ? WebSocket : ws\n\nconst MAX_BUFFERED_AMOUNT = 64 * 1024\n\n/**\n * WebSocket. Same API as node core `net.Socket`. Duplex stream.\n * @param {Object} opts\n * @param {string=} opts.url websocket server url\n * @param {string=} opts.socket raw websocket instance to wrap\n */\nclass Socket extends stream.Duplex {\n constructor (opts = {}) {\n // Support simple usage: `new Socket(url)`\n if (typeof opts === 'string') {\n opts = { url: opts }\n }\n\n opts = Object.assign({\n allowHalfOpen: false\n }, opts)\n\n super(opts)\n\n if (opts.url == null && opts.socket == null) {\n throw new Error('Missing required `url` or `socket` option')\n }\n if (opts.url != null && opts.socket != null) {\n throw new Error('Must specify either `url` or `socket` option, not both')\n }\n\n this._id = randombytes(4).toString('hex').slice(0, 7)\n this._debug('new websocket: %o', opts)\n\n this.connected = false\n this.destroyed = false\n\n this._chunk = null\n this._cb = null\n this._interval = null\n\n if (opts.socket) {\n this.url = opts.socket.url\n this._ws = opts.socket\n this.connected = opts.socket.readyState === _WebSocket.OPEN\n } else {\n this.url = opts.url\n try {\n if (typeof ws === 'function') {\n // `ws` package accepts options\n this._ws = new _WebSocket(opts.url, null, {\n ...opts,\n encoding: undefined // encoding option breaks ws internals\n })\n } else {\n this._ws = new _WebSocket(opts.url)\n }\n } catch (err) {\n queueMicrotask(() => this.destroy(err))\n return\n }\n }\n\n this._ws.binaryType = 'arraybuffer'\n\n if (opts.socket && this.connected) {\n queueMicrotask(() => this._handleOpen())\n } else {\n this._ws.onopen = () => this._handleOpen()\n }\n\n this._ws.onmessage = event => this._handleMessage(event)\n this._ws.onclose = () => this._handleClose()\n this._ws.onerror = err => this._handleError(err)\n\n this._handleFinishBound = () => this._handleFinish()\n this.once('finish', this._handleFinishBound)\n }\n\n /**\n * Send text/binary data to the WebSocket server.\n * @param {TypedArrayView|ArrayBuffer|Buffer|string|Blob|Object} chunk\n */\n send (chunk) {\n this._ws.send(chunk)\n }\n\n // TODO: Delete this method once readable-stream is updated to contain a default\n // implementation of destroy() that automatically calls _destroy()\n // See: https://github.com/nodejs/readable-stream/issues/283\n destroy (err) {\n this._destroy(err, () => {})\n }\n\n _destroy (err, cb) {\n if (this.destroyed) return\n\n this._debug('destroy (error: %s)', err && (err.message || err))\n\n this.readable = this.writable = false\n if (!this._readableState.ended) this.push(null)\n if (!this._writableState.finished) this.end()\n\n this.connected = false\n this.destroyed = true\n\n clearInterval(this._interval)\n this._interval = null\n this._chunk = null\n this._cb = null\n\n if (this._handleFinishBound) {\n this.removeListener('finish', this._handleFinishBound)\n }\n this._handleFinishBound = null\n\n if (this._ws) {\n const ws = this._ws\n const onClose = () => {\n ws.onclose = null\n }\n if (ws.readyState === _WebSocket.CLOSED) {\n onClose()\n } else {\n try {\n ws.onclose = onClose\n ws.close()\n } catch (err) {\n onClose()\n }\n }\n\n ws.onopen = null\n ws.onmessage = null\n ws.onerror = () => {}\n }\n this._ws = null\n\n if (err) this.emit('error', err)\n this.emit('close')\n cb()\n }\n\n _read () {}\n\n _write (chunk, encoding, cb) {\n if (this.destroyed) return cb(new Error('cannot write after socket is destroyed'))\n\n if (this.connected) {\n try {\n this.send(chunk)\n } catch (err) {\n return this.destroy(err)\n }\n if (typeof ws !== 'function' && this._ws.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n this._debug('start backpressure: bufferedAmount %d', this._ws.bufferedAmount)\n this._cb = cb\n } else {\n cb(null)\n }\n } else {\n this._debug('write before connect')\n this._chunk = chunk\n this._cb = cb\n }\n }\n\n _handleOpen () {\n if (this.connected || this.destroyed) return\n this.connected = true\n\n if (this._chunk) {\n try {\n this.send(this._chunk)\n } catch (err) {\n return this.destroy(err)\n }\n this._chunk = null\n this._debug('sent chunk from \"write before connect\"')\n\n const cb = this._cb\n this._cb = null\n cb(null)\n }\n\n // Backpressure is not implemented in Node.js. The `ws` module has a buggy\n // `bufferedAmount` property. See: https://github.com/websockets/ws/issues/492\n if (typeof ws !== 'function') {\n this._interval = setInterval(() => this._onInterval(), 150)\n if (this._interval.unref) this._interval.unref()\n }\n\n this._debug('connect')\n this.emit('connect')\n }\n\n _handleMessage (event) {\n if (this.destroyed) return\n let data = event.data\n if (data instanceof ArrayBuffer) data = Buffer.from(data)\n this.push(data)\n }\n\n _handleClose () {\n if (this.destroyed) return\n this._debug('on close')\n this.destroy()\n }\n\n _handleError (_) {\n this.destroy(new Error(`Error connecting to ${this.url}`))\n }\n\n // When stream finishes writing, close socket. Half open connections are not\n // supported.\n _handleFinish () {\n if (this.destroyed) return\n\n // Wait a bit before destroying so the socket flushes.\n // TODO: is there a more reliable way to accomplish this?\n const destroySoon = () => {\n setTimeout(() => this.destroy(), 1000)\n }\n\n if (this.connected) {\n destroySoon()\n } else {\n this.once('connect', destroySoon)\n }\n }\n\n _onInterval () {\n if (!this._cb || !this._ws || this._ws.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n return\n }\n this._debug('ending backpressure: bufferedAmount %d', this._ws.bufferedAmount)\n const cb = this._cb\n this._cb = null\n cb(null)\n }\n\n _debug () {\n const args = [].slice.call(arguments)\n args[0] = '[' + this._id + '] ' + args[0]\n debug.apply(null, args)\n }\n}\n\nSocket.WEBSOCKET_SUPPORT = !!_WebSocket\n\nmodule.exports = Socket\n","const Throttle = require('./lib/throttle')\nconst ThrottleGroup = require('./lib/throttle-group')\n\nmodule.exports = {\n Throttle,\n ThrottleGroup\n}\n","const { TokenBucket } = require('limiter')\nconst Throttle = require('./throttle')\n\nclass ThrottleGroup {\n constructor (opts = {}) {\n if (typeof opts !== 'object') throw new Error('Options must be an object')\n\n this.throttles = []\n this.setEnabled(opts.enabled)\n this.setRate(opts.rate, opts.chunksize)\n }\n\n getEnabled () {\n return this._enabled\n }\n\n getRate () {\n // Note: bucketSize === tokensPerInterval\n return this.bucket.tokensPerInterval\n }\n\n getChunksize () {\n return this.chunksize\n }\n\n setEnabled (val = true) {\n if (typeof val !== 'boolean') throw new Error('Enabled must be a boolean')\n\n this._enabled = val\n for (const throttle of this.throttles) {\n throttle.setEnabled(val)\n }\n }\n\n setRate (rate, chunksize = null) {\n // Note: rate = 0, means we should stop processing chunks\n if (!Number.isInteger(rate) || rate < 0) throw new Error('Rate must be an integer bigger than zero')\n rate = parseInt(rate)\n\n if (chunksize && (typeof chunksize !== 'number' || chunksize <= 0)) throw new Error('Chunksize must be bigger than zero')\n chunksize = chunksize || Math.max(parseInt(rate / 10), 1)\n chunksize = parseInt(chunksize)\n if (rate > 0 && chunksize > rate) throw new Error('Chunk size must be smaller than rate')\n\n if (!this.bucket) this.bucket = new TokenBucket(rate, rate, 'second', null)\n\n this.bucket.bucketSize = rate\n this.bucket.tokensPerInterval = rate\n this.chunksize = chunksize\n }\n\n setChunksize (chunksize) {\n if (!Number.isInteger(chunksize) || chunksize <= 0) throw new Error('Chunk size must be an integer bigger than zero')\n const rate = this.getRate()\n chunksize = parseInt(chunksize)\n if (rate > 0 && chunksize > rate) throw new Error('Chunk size must be smaller than rate')\n this.chunksize = chunksize\n }\n\n throttle (opts = {}) {\n if (typeof opts !== 'object') throw new Error('Options must be an object')\n\n const newThrottle = new Throttle({\n ...opts,\n group: this\n })\n\n return newThrottle\n }\n\n destroy () {\n for (const throttle of this.throttles) {\n throttle.destroy()\n }\n\n this.throttles = []\n }\n\n _addThrottle (throttle) {\n if (!(throttle instanceof Throttle)) throw new Error('Throttle must be an instance of Throttle')\n\n this.throttles.push(throttle)\n }\n\n _removeThrottle (throttle) {\n const index = this.throttles.indexOf(throttle)\n if (index > -1) this.throttles.splice(index, 1)\n }\n}\n\nmodule.exports = ThrottleGroup\n","const { EventEmitter } = require('events')\nconst { Transform } = require('streamx')\nconst { wait } = require('./utils')\n\nclass Throttle extends Transform {\n constructor (opts = {}) {\n super()\n\n if (typeof opts !== 'object') throw new Error('Options must be an object')\n\n const params = Object.assign({}, opts)\n\n if (params.group && !(params.group instanceof ThrottleGroup)) throw new Error('Group must be an instanece of ThrottleGroup')\n else if (!params.group) params.group = new ThrottleGroup(params)\n\n this._setEnabled(params.enabled || params.group.enabled)\n this._group = params.group\n this._emitter = new EventEmitter()\n this._destroyed = false\n\n this._group._addThrottle(this)\n }\n\n getEnabled () {\n return this._enabled\n }\n\n getGroup () {\n return this._group\n }\n\n _setEnabled (val = true) {\n if (typeof val !== 'boolean') throw new Error('Enabled must be a boolean')\n this._enabled = val\n }\n\n setEnabled (val) {\n this._setEnabled(val)\n if (this._enabled) this._emitter.emit('enabled')\n else this._emitter.emit('disabled')\n }\n\n _transform (chunk, done) {\n this._processChunk(chunk, done)\n }\n\n /* async _waitForPositiveRate () {\n // Stop pushing chunks if rate is zero\n while (this._group.getRate() === 0 && !this._destroyed && this._areBothEnabled()) {\n await wait(1 * 1000) // wait 1 second\n }\n } */\n\n async _waitForTokens (amount) {\n // Wait for enabled, destroyed or tokens\n return new Promise((resolve, reject) => {\n let done = false\n const self = this\n function isDone (err) {\n self._emitter.removeListener('disabled', isDone)\n self._emitter.removeListener('destroyed', isDone)\n\n if (done) return\n done = true\n if (err) return reject(err)\n resolve()\n }\n this._emitter.once('disabled', isDone)\n this._emitter.once('destroyed', isDone)\n // TODO: next version remove lisener in \"isDone\"\n this._group.bucket.removeTokens(amount, isDone)\n })\n }\n\n _areBothEnabled () {\n return this._enabled && this._group.getEnabled()\n }\n\n /* async _throttleChunk (size) {\n // Stop pushing chunks if rate is zero\n await this._waitForPositiveRate()\n if (this._destroyed) return\n if (!this._areBothEnabled()) return\n\n // Get tokens from bucket\n await this._waitForTokens(size)\n } */\n\n async _processChunk (chunk, done) {\n if (!this._areBothEnabled()) return done(null, chunk)\n\n let pos = 0\n let chunksize = this._group.getChunksize()\n let slice = chunk.slice(pos, pos + chunksize)\n while (slice.length > 0) {\n // Check here again because we might be in the middle of a big chunk\n // with a lot of small slices\n if (this._areBothEnabled()) {\n try {\n // WAIT FOR POSITIVE RATE\n // Stop pushing chunks if rate is zero\n while (this._group.getRate() === 0 && !this._destroyed && this._areBothEnabled()) {\n await wait(1000) // wait 1 second\n if (this._destroyed) return\n }\n\n // WAIT FOR TOKENS\n if (this._areBothEnabled() && !this._group.bucket.tryRemoveTokens(slice.length)) {\n await this._waitForTokens(slice.length)\n if (this._destroyed) return\n }\n } catch (err) {\n return done(err)\n }\n }\n\n this.push(slice)\n pos += chunksize\n\n // Calculate params for next slice\n chunksize = (this._areBothEnabled())\n ? this._group.getChunksize() // Chunksize might have changed\n : chunk.length - pos // Get the rest of the chunk\n slice = chunk.slice(pos, pos + chunksize)\n }\n\n return done()\n }\n\n destroy (...args) {\n this._group._removeThrottle(this)\n\n this._destroyed = true\n this._emitter.emit('destroyed')\n\n super.destroy(...args)\n }\n}\n\nmodule.exports = Throttle\n\n// Fix circular dependency\nconst ThrottleGroup = require('./throttle-group')\n","function wait (time) {\n return new Promise((resolve) => setTimeout(resolve, time))\n}\n\nmodule.exports = {\n wait\n}\n","var tick = 1\nvar maxTick = 65535\nvar resolution = 4\nvar timer\nvar inc = function () {\n tick = (tick + 1) & maxTick\n}\n\n\nmodule.exports = function (seconds) {\n if (!timer) {\n timer = setInterval(inc, (1000 / resolution) | 0)\n if (timer.unref) timer.unref()\n }\n\n var size = resolution * (seconds || 5)\n var buffer = [0]\n var pointer = 1\n var last = (tick - 1) & maxTick\n\n return function (delta) {\n var dist = (tick - last) & maxTick\n if (dist > size) dist = size\n last = tick\n\n while (dist--) {\n if (pointer === size) pointer = 0\n buffer[pointer] = buffer[pointer === 0 ? size - 1 : pointer - 1]\n pointer++\n }\n\n if (delta) buffer[pointer - 1] += delta\n\n var top = buffer[pointer - 1]\n var btm = buffer.length < size ? 0 : buffer[pointer === size ? 0 : pointer]\n\n return buffer.length < resolution ? top : (top - btm) * resolution / buffer.length\n }\n}\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\nmodule.exports = Stream;\n\nvar EE = require('events').EventEmitter;\nvar inherits = require('inherits');\n\ninherits(Stream, EE);\nStream.Readable = require('readable-stream/lib/_stream_readable.js');\nStream.Writable = require('readable-stream/lib/_stream_writable.js');\nStream.Duplex = require('readable-stream/lib/_stream_duplex.js');\nStream.Transform = require('readable-stream/lib/_stream_transform.js');\nStream.PassThrough = require('readable-stream/lib/_stream_passthrough.js');\nStream.finished = require('readable-stream/lib/internal/streams/end-of-stream.js')\nStream.pipeline = require('readable-stream/lib/internal/streams/pipeline.js')\n\n// Backwards-compat with node 0.4.x\nStream.Stream = Stream;\n\n\n\n// old-style streams. Note that the pipe method (the only relevant\n// part of this class) is overridden in the Readable class.\n\nfunction Stream() {\n EE.call(this);\n}\n\nStream.prototype.pipe = function(dest, options) {\n var source = this;\n\n function ondata(chunk) {\n if (dest.writable) {\n if (false === dest.write(chunk) && source.pause) {\n source.pause();\n }\n }\n }\n\n source.on('data', ondata);\n\n function ondrain() {\n if (source.readable && source.resume) {\n source.resume();\n }\n }\n\n dest.on('drain', ondrain);\n\n // If the 'end' option is not supplied, dest.end() will be called when\n // source gets the 'end' or 'close' events. Only dest.end() once.\n if (!dest._isStdio && (!options || options.end !== false)) {\n source.on('end', onend);\n source.on('close', onclose);\n }\n\n var didOnEnd = false;\n function onend() {\n if (didOnEnd) return;\n didOnEnd = true;\n\n dest.end();\n }\n\n\n function onclose() {\n if (didOnEnd) return;\n didOnEnd = true;\n\n if (typeof dest.destroy === 'function') dest.destroy();\n }\n\n // don't leave dangling pipes when there are errors.\n function onerror(er) {\n cleanup();\n if (EE.listenerCount(this, 'error') === 0) {\n throw er; // Unhandled stream error in pipe.\n }\n }\n\n source.on('error', onerror);\n dest.on('error', onerror);\n\n // remove all the event listeners that were added.\n function cleanup() {\n source.removeListener('data', ondata);\n dest.removeListener('drain', ondrain);\n\n source.removeListener('end', onend);\n source.removeListener('close', onclose);\n\n source.removeListener('error', onerror);\n dest.removeListener('error', onerror);\n\n source.removeListener('end', cleanup);\n source.removeListener('close', cleanup);\n\n dest.removeListener('close', cleanup);\n }\n\n source.on('end', cleanup);\n source.on('close', cleanup);\n\n dest.on('close', cleanup);\n\n dest.emit('pipe', source);\n\n // Allow for unix-like usage: A.pipe(B).pipe(C)\n return dest;\n};\n","var ClientRequest = require('./lib/request')\nvar response = require('./lib/response')\nvar extend = require('xtend')\nvar statusCodes = require('builtin-status-codes')\nvar url = require('url')\n\nvar http = exports\n\nhttp.request = function (opts, cb) {\n\tif (typeof opts === 'string')\n\t\topts = url.parse(opts)\n\telse\n\t\topts = extend(opts)\n\n\t// Normally, the page is loaded from http or https, so not specifying a protocol\n\t// will result in a (valid) protocol-relative url. However, this won't work if\n\t// the protocol is something else, like 'file:'\n\tvar defaultProtocol = global.location.protocol.search(/^https?:$/) === -1 ? 'http:' : ''\n\n\tvar protocol = opts.protocol || defaultProtocol\n\tvar host = opts.hostname || opts.host\n\tvar port = opts.port\n\tvar path = opts.path || '/'\n\n\t// Necessary for IPv6 addresses\n\tif (host && host.indexOf(':') !== -1)\n\t\thost = '[' + host + ']'\n\n\t// This may be a relative url. The browser should always be able to interpret it correctly.\n\topts.url = (host ? (protocol + '//' + host) : '') + (port ? ':' + port : '') + path\n\topts.method = (opts.method || 'GET').toUpperCase()\n\topts.headers = opts.headers || {}\n\n\t// Also valid opts.auth, opts.mode\n\n\tvar req = new ClientRequest(opts)\n\tif (cb)\n\t\treq.on('response', cb)\n\treturn req\n}\n\nhttp.get = function get (opts, cb) {\n\tvar req = http.request(opts, cb)\n\treq.end()\n\treturn req\n}\n\nhttp.ClientRequest = ClientRequest\nhttp.IncomingMessage = response.IncomingMessage\n\nhttp.Agent = function () {}\nhttp.Agent.defaultMaxSockets = 4\n\nhttp.globalAgent = new http.Agent()\n\nhttp.STATUS_CODES = statusCodes\n\nhttp.METHODS = [\n\t'CHECKOUT',\n\t'CONNECT',\n\t'COPY',\n\t'DELETE',\n\t'GET',\n\t'HEAD',\n\t'LOCK',\n\t'M-SEARCH',\n\t'MERGE',\n\t'MKACTIVITY',\n\t'MKCOL',\n\t'MOVE',\n\t'NOTIFY',\n\t'OPTIONS',\n\t'PATCH',\n\t'POST',\n\t'PROPFIND',\n\t'PROPPATCH',\n\t'PURGE',\n\t'PUT',\n\t'REPORT',\n\t'SEARCH',\n\t'SUBSCRIBE',\n\t'TRACE',\n\t'UNLOCK',\n\t'UNSUBSCRIBE'\n]","exports.fetch = isFunction(global.fetch) && isFunction(global.ReadableStream)\n\nexports.writableStream = isFunction(global.WritableStream)\n\nexports.abortController = isFunction(global.AbortController)\n\n// The xhr request to example.com may violate some restrictive CSP configurations,\n// so if we're running in a browser that supports `fetch`, avoid calling getXHR()\n// and assume support for certain features below.\nvar xhr\nfunction getXHR () {\n\t// Cache the xhr value\n\tif (xhr !== undefined) return xhr\n\n\tif (global.XMLHttpRequest) {\n\t\txhr = new global.XMLHttpRequest()\n\t\t// If XDomainRequest is available (ie only, where xhr might not work\n\t\t// cross domain), use the page location. Otherwise use example.com\n\t\t// Note: this doesn't actually make an http request.\n\t\ttry {\n\t\t\txhr.open('GET', global.XDomainRequest ? '/' : 'https://example.com')\n\t\t} catch(e) {\n\t\t\txhr = null\n\t\t}\n\t} else {\n\t\t// Service workers don't have XHR\n\t\txhr = null\n\t}\n\treturn xhr\n}\n\nfunction checkTypeSupport (type) {\n\tvar xhr = getXHR()\n\tif (!xhr) return false\n\ttry {\n\t\txhr.responseType = type\n\t\treturn xhr.responseType === type\n\t} catch (e) {}\n\treturn false\n}\n\n// If fetch is supported, then arraybuffer will be supported too. Skip calling\n// checkTypeSupport(), since that calls getXHR().\nexports.arraybuffer = exports.fetch || checkTypeSupport('arraybuffer')\n\n// These next two tests unavoidably show warnings in Chrome. Since fetch will always\n// be used if it's available, just return false for these to avoid the warnings.\nexports.msstream = !exports.fetch && checkTypeSupport('ms-stream')\nexports.mozchunkedarraybuffer = !exports.fetch && checkTypeSupport('moz-chunked-arraybuffer')\n\n// If fetch is supported, then overrideMimeType will be supported too. Skip calling\n// getXHR().\nexports.overrideMimeType = exports.fetch || (getXHR() ? isFunction(getXHR().overrideMimeType) : false)\n\nfunction isFunction (value) {\n\treturn typeof value === 'function'\n}\n\nxhr = null // Help gc\n","var capability = require('./capability')\nvar inherits = require('inherits')\nvar response = require('./response')\nvar stream = require('readable-stream')\n\nvar IncomingMessage = response.IncomingMessage\nvar rStates = response.readyStates\n\nfunction decideMode (preferBinary, useFetch) {\n\tif (capability.fetch && useFetch) {\n\t\treturn 'fetch'\n\t} else if (capability.mozchunkedarraybuffer) {\n\t\treturn 'moz-chunked-arraybuffer'\n\t} else if (capability.msstream) {\n\t\treturn 'ms-stream'\n\t} else if (capability.arraybuffer && preferBinary) {\n\t\treturn 'arraybuffer'\n\t} else {\n\t\treturn 'text'\n\t}\n}\n\nvar ClientRequest = module.exports = function (opts) {\n\tvar self = this\n\tstream.Writable.call(self)\n\n\tself._opts = opts\n\tself._body = []\n\tself._headers = {}\n\tif (opts.auth)\n\t\tself.setHeader('Authorization', 'Basic ' + Buffer.from(opts.auth).toString('base64'))\n\tObject.keys(opts.headers).forEach(function (name) {\n\t\tself.setHeader(name, opts.headers[name])\n\t})\n\n\tvar preferBinary\n\tvar useFetch = true\n\tif (opts.mode === 'disable-fetch' || ('requestTimeout' in opts && !capability.abortController)) {\n\t\t// If the use of XHR should be preferred. Not typically needed.\n\t\tuseFetch = false\n\t\tpreferBinary = true\n\t} else if (opts.mode === 'prefer-streaming') {\n\t\t// If streaming is a high priority but binary compatibility and\n\t\t// the accuracy of the 'content-type' header aren't\n\t\tpreferBinary = false\n\t} else if (opts.mode === 'allow-wrong-content-type') {\n\t\t// If streaming is more important than preserving the 'content-type' header\n\t\tpreferBinary = !capability.overrideMimeType\n\t} else if (!opts.mode || opts.mode === 'default' || opts.mode === 'prefer-fast') {\n\t\t// Use binary if text streaming may corrupt data or the content-type header, or for speed\n\t\tpreferBinary = true\n\t} else {\n\t\tthrow new Error('Invalid value for opts.mode')\n\t}\n\tself._mode = decideMode(preferBinary, useFetch)\n\tself._fetchTimer = null\n\tself._socketTimeout = null\n\tself._socketTimer = null\n\n\tself.on('finish', function () {\n\t\tself._onFinish()\n\t})\n}\n\ninherits(ClientRequest, stream.Writable)\n\nClientRequest.prototype.setHeader = function (name, value) {\n\tvar self = this\n\tvar lowerName = name.toLowerCase()\n\t// This check is not necessary, but it prevents warnings from browsers about setting unsafe\n\t// headers. To be honest I'm not entirely sure hiding these warnings is a good thing, but\n\t// http-browserify did it, so I will too.\n\tif (unsafeHeaders.indexOf(lowerName) !== -1)\n\t\treturn\n\n\tself._headers[lowerName] = {\n\t\tname: name,\n\t\tvalue: value\n\t}\n}\n\nClientRequest.prototype.getHeader = function (name) {\n\tvar header = this._headers[name.toLowerCase()]\n\tif (header)\n\t\treturn header.value\n\treturn null\n}\n\nClientRequest.prototype.removeHeader = function (name) {\n\tvar self = this\n\tdelete self._headers[name.toLowerCase()]\n}\n\nClientRequest.prototype._onFinish = function () {\n\tvar self = this\n\n\tif (self._destroyed)\n\t\treturn\n\tvar opts = self._opts\n\n\tif ('timeout' in opts && opts.timeout !== 0) {\n\t\tself.setTimeout(opts.timeout)\n\t}\n\n\tvar headersObj = self._headers\n\tvar body = null\n\tif (opts.method !== 'GET' && opts.method !== 'HEAD') {\n body = new Blob(self._body, {\n type: (headersObj['content-type'] || {}).value || ''\n });\n }\n\n\t// create flattened list of headers\n\tvar headersList = []\n\tObject.keys(headersObj).forEach(function (keyName) {\n\t\tvar name = headersObj[keyName].name\n\t\tvar value = headersObj[keyName].value\n\t\tif (Array.isArray(value)) {\n\t\t\tvalue.forEach(function (v) {\n\t\t\t\theadersList.push([name, v])\n\t\t\t})\n\t\t} else {\n\t\t\theadersList.push([name, value])\n\t\t}\n\t})\n\n\tif (self._mode === 'fetch') {\n\t\tvar signal = null\n\t\tif (capability.abortController) {\n\t\t\tvar controller = new AbortController()\n\t\t\tsignal = controller.signal\n\t\t\tself._fetchAbortController = controller\n\n\t\t\tif ('requestTimeout' in opts && opts.requestTimeout !== 0) {\n\t\t\t\tself._fetchTimer = global.setTimeout(function () {\n\t\t\t\t\tself.emit('requestTimeout')\n\t\t\t\t\tif (self._fetchAbortController)\n\t\t\t\t\t\tself._fetchAbortController.abort()\n\t\t\t\t}, opts.requestTimeout)\n\t\t\t}\n\t\t}\n\n\t\tglobal.fetch(self._opts.url, {\n\t\t\tmethod: self._opts.method,\n\t\t\theaders: headersList,\n\t\t\tbody: body || undefined,\n\t\t\tmode: 'cors',\n\t\t\tcredentials: opts.withCredentials ? 'include' : 'same-origin',\n\t\t\tsignal: signal\n\t\t}).then(function (response) {\n\t\t\tself._fetchResponse = response\n\t\t\tself._resetTimers(false)\n\t\t\tself._connect()\n\t\t}, function (reason) {\n\t\t\tself._resetTimers(true)\n\t\t\tif (!self._destroyed)\n\t\t\t\tself.emit('error', reason)\n\t\t})\n\t} else {\n\t\tvar xhr = self._xhr = new global.XMLHttpRequest()\n\t\ttry {\n\t\t\txhr.open(self._opts.method, self._opts.url, true)\n\t\t} catch (err) {\n\t\t\tprocess.nextTick(function () {\n\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t\treturn\n\t\t}\n\n\t\t// Can't set responseType on really old browsers\n\t\tif ('responseType' in xhr)\n\t\t\txhr.responseType = self._mode\n\n\t\tif ('withCredentials' in xhr)\n\t\t\txhr.withCredentials = !!opts.withCredentials\n\n\t\tif (self._mode === 'text' && 'overrideMimeType' in xhr)\n\t\t\txhr.overrideMimeType('text/plain; charset=x-user-defined')\n\n\t\tif ('requestTimeout' in opts) {\n\t\t\txhr.timeout = opts.requestTimeout\n\t\t\txhr.ontimeout = function () {\n\t\t\t\tself.emit('requestTimeout')\n\t\t\t}\n\t\t}\n\n\t\theadersList.forEach(function (header) {\n\t\t\txhr.setRequestHeader(header[0], header[1])\n\t\t})\n\n\t\tself._response = null\n\t\txhr.onreadystatechange = function () {\n\t\t\tswitch (xhr.readyState) {\n\t\t\t\tcase rStates.LOADING:\n\t\t\t\tcase rStates.DONE:\n\t\t\t\t\tself._onXHRProgress()\n\t\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\t// Necessary for streaming in Firefox, since xhr.response is ONLY defined\n\t\t// in onprogress, not in onreadystatechange with xhr.readyState = 3\n\t\tif (self._mode === 'moz-chunked-arraybuffer') {\n\t\t\txhr.onprogress = function () {\n\t\t\t\tself._onXHRProgress()\n\t\t\t}\n\t\t}\n\n\t\txhr.onerror = function () {\n\t\t\tif (self._destroyed)\n\t\t\t\treturn\n\t\t\tself._resetTimers(true)\n\t\t\tself.emit('error', new Error('XHR error'))\n\t\t}\n\n\t\ttry {\n\t\t\txhr.send(body)\n\t\t} catch (err) {\n\t\t\tprocess.nextTick(function () {\n\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t\treturn\n\t\t}\n\t}\n}\n\n/**\n * Checks if xhr.status is readable and non-zero, indicating no error.\n * Even though the spec says it should be available in readyState 3,\n * accessing it throws an exception in IE8\n */\nfunction statusValid (xhr) {\n\ttry {\n\t\tvar status = xhr.status\n\t\treturn (status !== null && status !== 0)\n\t} catch (e) {\n\t\treturn false\n\t}\n}\n\nClientRequest.prototype._onXHRProgress = function () {\n\tvar self = this\n\n\tself._resetTimers(false)\n\n\tif (!statusValid(self._xhr) || self._destroyed)\n\t\treturn\n\n\tif (!self._response)\n\t\tself._connect()\n\n\tself._response._onXHRProgress(self._resetTimers.bind(self))\n}\n\nClientRequest.prototype._connect = function () {\n\tvar self = this\n\n\tif (self._destroyed)\n\t\treturn\n\n\tself._response = new IncomingMessage(self._xhr, self._fetchResponse, self._mode, self._resetTimers.bind(self))\n\tself._response.on('error', function(err) {\n\t\tself.emit('error', err)\n\t})\n\n\tself.emit('response', self._response)\n}\n\nClientRequest.prototype._write = function (chunk, encoding, cb) {\n\tvar self = this\n\n\tself._body.push(chunk)\n\tcb()\n}\n\nClientRequest.prototype._resetTimers = function (done) {\n\tvar self = this\n\n\tglobal.clearTimeout(self._socketTimer)\n\tself._socketTimer = null\n\n\tif (done) {\n\t\tglobal.clearTimeout(self._fetchTimer)\n\t\tself._fetchTimer = null\n\t} else if (self._socketTimeout) {\n\t\tself._socketTimer = global.setTimeout(function () {\n\t\t\tself.emit('timeout')\n\t\t}, self._socketTimeout)\n\t}\n}\n\nClientRequest.prototype.abort = ClientRequest.prototype.destroy = function (err) {\n\tvar self = this\n\tself._destroyed = true\n\tself._resetTimers(true)\n\tif (self._response)\n\t\tself._response._destroyed = true\n\tif (self._xhr)\n\t\tself._xhr.abort()\n\telse if (self._fetchAbortController)\n\t\tself._fetchAbortController.abort()\n\n\tif (err)\n\t\tself.emit('error', err)\n}\n\nClientRequest.prototype.end = function (data, encoding, cb) {\n\tvar self = this\n\tif (typeof data === 'function') {\n\t\tcb = data\n\t\tdata = undefined\n\t}\n\n\tstream.Writable.prototype.end.call(self, data, encoding, cb)\n}\n\nClientRequest.prototype.setTimeout = function (timeout, cb) {\n\tvar self = this\n\n\tif (cb)\n\t\tself.once('timeout', cb)\n\n\tself._socketTimeout = timeout\n\tself._resetTimers(false)\n}\n\nClientRequest.prototype.flushHeaders = function () {}\nClientRequest.prototype.setNoDelay = function () {}\nClientRequest.prototype.setSocketKeepAlive = function () {}\n\n// Taken from http://www.w3.org/TR/XMLHttpRequest/#the-setrequestheader%28%29-method\nvar unsafeHeaders = [\n\t'accept-charset',\n\t'accept-encoding',\n\t'access-control-request-headers',\n\t'access-control-request-method',\n\t'connection',\n\t'content-length',\n\t'cookie',\n\t'cookie2',\n\t'date',\n\t'dnt',\n\t'expect',\n\t'host',\n\t'keep-alive',\n\t'origin',\n\t'referer',\n\t'te',\n\t'trailer',\n\t'transfer-encoding',\n\t'upgrade',\n\t'via'\n]\n","var capability = require('./capability')\nvar inherits = require('inherits')\nvar stream = require('readable-stream')\n\nvar rStates = exports.readyStates = {\n\tUNSENT: 0,\n\tOPENED: 1,\n\tHEADERS_RECEIVED: 2,\n\tLOADING: 3,\n\tDONE: 4\n}\n\nvar IncomingMessage = exports.IncomingMessage = function (xhr, response, mode, resetTimers) {\n\tvar self = this\n\tstream.Readable.call(self)\n\n\tself._mode = mode\n\tself.headers = {}\n\tself.rawHeaders = []\n\tself.trailers = {}\n\tself.rawTrailers = []\n\n\t// Fake the 'close' event, but only once 'end' fires\n\tself.on('end', function () {\n\t\t// The nextTick is necessary to prevent the 'request' module from causing an infinite loop\n\t\tprocess.nextTick(function () {\n\t\t\tself.emit('close')\n\t\t})\n\t})\n\n\tif (mode === 'fetch') {\n\t\tself._fetchResponse = response\n\n\t\tself.url = response.url\n\t\tself.statusCode = response.status\n\t\tself.statusMessage = response.statusText\n\t\t\n\t\tresponse.headers.forEach(function (header, key){\n\t\t\tself.headers[key.toLowerCase()] = header\n\t\t\tself.rawHeaders.push(key, header)\n\t\t})\n\n\t\tif (capability.writableStream) {\n\t\t\tvar writable = new WritableStream({\n\t\t\t\twrite: function (chunk) {\n\t\t\t\t\tresetTimers(false)\n\t\t\t\t\treturn new Promise(function (resolve, reject) {\n\t\t\t\t\t\tif (self._destroyed) {\n\t\t\t\t\t\t\treject()\n\t\t\t\t\t\t} else if(self.push(Buffer.from(chunk))) {\n\t\t\t\t\t\t\tresolve()\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tself._resumeFetch = resolve\n\t\t\t\t\t\t}\n\t\t\t\t\t})\n\t\t\t\t},\n\t\t\t\tclose: function () {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.push(null)\n\t\t\t\t},\n\t\t\t\tabort: function (err) {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.emit('error', err)\n\t\t\t\t}\n\t\t\t})\n\n\t\t\ttry {\n\t\t\t\tresponse.body.pipeTo(writable).catch(function (err) {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.emit('error', err)\n\t\t\t\t})\n\t\t\t\treturn\n\t\t\t} catch (e) {} // pipeTo method isn't defined. Can't find a better way to feature test this\n\t\t}\n\t\t// fallback for when writableStream or pipeTo aren't available\n\t\tvar reader = response.body.getReader()\n\t\tfunction read () {\n\t\t\treader.read().then(function (result) {\n\t\t\t\tif (self._destroyed)\n\t\t\t\t\treturn\n\t\t\t\tresetTimers(result.done)\n\t\t\t\tif (result.done) {\n\t\t\t\t\tself.push(null)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tself.push(Buffer.from(result.value))\n\t\t\t\tread()\n\t\t\t}).catch(function (err) {\n\t\t\t\tresetTimers(true)\n\t\t\t\tif (!self._destroyed)\n\t\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t}\n\t\tread()\n\t} else {\n\t\tself._xhr = xhr\n\t\tself._pos = 0\n\n\t\tself.url = xhr.responseURL\n\t\tself.statusCode = xhr.status\n\t\tself.statusMessage = xhr.statusText\n\t\tvar headers = xhr.getAllResponseHeaders().split(/\\r?\\n/)\n\t\theaders.forEach(function (header) {\n\t\t\tvar matches = header.match(/^([^:]+):\\s*(.*)/)\n\t\t\tif (matches) {\n\t\t\t\tvar key = matches[1].toLowerCase()\n\t\t\t\tif (key === 'set-cookie') {\n\t\t\t\t\tif (self.headers[key] === undefined) {\n\t\t\t\t\t\tself.headers[key] = []\n\t\t\t\t\t}\n\t\t\t\t\tself.headers[key].push(matches[2])\n\t\t\t\t} else if (self.headers[key] !== undefined) {\n\t\t\t\t\tself.headers[key] += ', ' + matches[2]\n\t\t\t\t} else {\n\t\t\t\t\tself.headers[key] = matches[2]\n\t\t\t\t}\n\t\t\t\tself.rawHeaders.push(matches[1], matches[2])\n\t\t\t}\n\t\t})\n\n\t\tself._charset = 'x-user-defined'\n\t\tif (!capability.overrideMimeType) {\n\t\t\tvar mimeType = self.rawHeaders['mime-type']\n\t\t\tif (mimeType) {\n\t\t\t\tvar charsetMatch = mimeType.match(/;\\s*charset=([^;])(;|$)/)\n\t\t\t\tif (charsetMatch) {\n\t\t\t\t\tself._charset = charsetMatch[1].toLowerCase()\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!self._charset)\n\t\t\t\tself._charset = 'utf-8' // best guess\n\t\t}\n\t}\n}\n\ninherits(IncomingMessage, stream.Readable)\n\nIncomingMessage.prototype._read = function () {\n\tvar self = this\n\n\tvar resolve = self._resumeFetch\n\tif (resolve) {\n\t\tself._resumeFetch = null\n\t\tresolve()\n\t}\n}\n\nIncomingMessage.prototype._onXHRProgress = function (resetTimers) {\n\tvar self = this\n\n\tvar xhr = self._xhr\n\n\tvar response = null\n\tswitch (self._mode) {\n\t\tcase 'text':\n\t\t\tresponse = xhr.responseText\n\t\t\tif (response.length > self._pos) {\n\t\t\t\tvar newData = response.substr(self._pos)\n\t\t\t\tif (self._charset === 'x-user-defined') {\n\t\t\t\t\tvar buffer = Buffer.alloc(newData.length)\n\t\t\t\t\tfor (var i = 0; i < newData.length; i++)\n\t\t\t\t\t\tbuffer[i] = newData.charCodeAt(i) & 0xff\n\n\t\t\t\t\tself.push(buffer)\n\t\t\t\t} else {\n\t\t\t\t\tself.push(newData, self._charset)\n\t\t\t\t}\n\t\t\t\tself._pos = response.length\n\t\t\t}\n\t\t\tbreak\n\t\tcase 'arraybuffer':\n\t\t\tif (xhr.readyState !== rStates.DONE || !xhr.response)\n\t\t\t\tbreak\n\t\t\tresponse = xhr.response\n\t\t\tself.push(Buffer.from(new Uint8Array(response)))\n\t\t\tbreak\n\t\tcase 'moz-chunked-arraybuffer': // take whole\n\t\t\tresponse = xhr.response\n\t\t\tif (xhr.readyState !== rStates.LOADING || !response)\n\t\t\t\tbreak\n\t\t\tself.push(Buffer.from(new Uint8Array(response)))\n\t\t\tbreak\n\t\tcase 'ms-stream':\n\t\t\tresponse = xhr.response\n\t\t\tif (xhr.readyState !== rStates.LOADING)\n\t\t\t\tbreak\n\t\t\tvar reader = new global.MSStreamReader()\n\t\t\treader.onprogress = function () {\n\t\t\t\tif (reader.result.byteLength > self._pos) {\n\t\t\t\t\tself.push(Buffer.from(new Uint8Array(reader.result.slice(self._pos))))\n\t\t\t\t\tself._pos = reader.result.byteLength\n\t\t\t\t}\n\t\t\t}\n\t\t\treader.onload = function () {\n\t\t\t\tresetTimers(true)\n\t\t\t\tself.push(null)\n\t\t\t}\n\t\t\t// reader.onerror = ??? // TODO: this\n\t\t\treader.readAsArrayBuffer(response)\n\t\t\tbreak\n\t}\n\n\t// The ms-stream case handles end separately in reader.onload()\n\tif (self._xhr.readyState === rStates.DONE && self._mode !== 'ms-stream') {\n\t\tresetTimers(true)\n\t\tself.push(null)\n\t}\n}\n","/*! stream-to-blob-url. MIT License. Feross Aboukhadijeh */\nmodule.exports = getBlobURL\n\nconst getBlob = require('stream-to-blob')\n\nasync function getBlobURL (stream, mimeType) {\n const blob = await getBlob(stream, mimeType)\n const url = URL.createObjectURL(blob)\n return url\n}\n","/*! stream-to-blob. MIT License. Feross Aboukhadijeh */\n/* global Blob */\n\nmodule.exports = streamToBlob\n\nfunction streamToBlob (stream, mimeType) {\n if (mimeType != null && typeof mimeType !== 'string') {\n throw new Error('Invalid mimetype, expected string.')\n }\n return new Promise((resolve, reject) => {\n const chunks = []\n stream\n .on('data', chunk => chunks.push(chunk))\n .once('end', () => {\n const blob = mimeType != null\n ? new Blob(chunks, { type: mimeType })\n : new Blob(chunks)\n resolve(blob)\n })\n .once('error', reject)\n })\n}\n","/*! stream-with-known-length-to-buffer. MIT License. Feross Aboukhadijeh */\nvar once = require('once')\n\nmodule.exports = function getBuffer (stream, length, cb) {\n cb = once(cb)\n var buf = Buffer.alloc(length)\n var offset = 0\n stream\n .on('data', function (chunk) {\n chunk.copy(buf, offset)\n offset += chunk.length\n })\n .on('end', function () { cb(null, buf) })\n .on('error', cb)\n}\n","const { EventEmitter } = require('events')\nconst STREAM_DESTROYED = new Error('Stream was destroyed')\nconst PREMATURE_CLOSE = new Error('Premature close')\n\nconst queueTick = require('queue-tick')\nconst FIFO = require('fast-fifo')\n\n/* eslint-disable no-multi-spaces */\n\nconst MAX = ((1 << 25) - 1)\n\n// Shared state\nconst OPENING = 0b001\nconst DESTROYING = 0b010\nconst DESTROYED = 0b100\n\nconst NOT_OPENING = MAX ^ OPENING\n\n// Read state\nconst READ_ACTIVE = 0b0000000000001 << 3\nconst READ_PRIMARY = 0b0000000000010 << 3\nconst READ_SYNC = 0b0000000000100 << 3\nconst READ_QUEUED = 0b0000000001000 << 3\nconst READ_RESUMED = 0b0000000010000 << 3\nconst READ_PIPE_DRAINED = 0b0000000100000 << 3\nconst READ_ENDING = 0b0000001000000 << 3\nconst READ_EMIT_DATA = 0b0000010000000 << 3\nconst READ_EMIT_READABLE = 0b0000100000000 << 3\nconst READ_EMITTED_READABLE = 0b0001000000000 << 3\nconst READ_DONE = 0b0010000000000 << 3\nconst READ_NEXT_TICK = 0b0100000000001 << 3 // also active\nconst READ_NEEDS_PUSH = 0b1000000000000 << 3\n\nconst READ_NOT_ACTIVE = MAX ^ READ_ACTIVE\nconst READ_NON_PRIMARY = MAX ^ READ_PRIMARY\nconst READ_NON_PRIMARY_AND_PUSHED = MAX ^ (READ_PRIMARY | READ_NEEDS_PUSH)\nconst READ_NOT_SYNC = MAX ^ READ_SYNC\nconst READ_PUSHED = MAX ^ READ_NEEDS_PUSH\nconst READ_PAUSED = MAX ^ READ_RESUMED\nconst READ_NOT_QUEUED = MAX ^ (READ_QUEUED | READ_EMITTED_READABLE)\nconst READ_NOT_ENDING = MAX ^ READ_ENDING\nconst READ_PIPE_NOT_DRAINED = MAX ^ (READ_RESUMED | READ_PIPE_DRAINED)\nconst READ_NOT_NEXT_TICK = MAX ^ READ_NEXT_TICK\n\n// Write state\nconst WRITE_ACTIVE = 0b000000001 << 16\nconst WRITE_PRIMARY = 0b000000010 << 16\nconst WRITE_SYNC = 0b000000100 << 16\nconst WRITE_QUEUED = 0b000001000 << 16\nconst WRITE_UNDRAINED = 0b000010000 << 16\nconst WRITE_DONE = 0b000100000 << 16\nconst WRITE_EMIT_DRAIN = 0b001000000 << 16\nconst WRITE_NEXT_TICK = 0b010000001 << 16 // also active\nconst WRITE_FINISHING = 0b100000000 << 16\n\nconst WRITE_NOT_ACTIVE = MAX ^ WRITE_ACTIVE\nconst WRITE_NOT_SYNC = MAX ^ WRITE_SYNC\nconst WRITE_NON_PRIMARY = MAX ^ WRITE_PRIMARY\nconst WRITE_NOT_FINISHING = MAX ^ WRITE_FINISHING\nconst WRITE_DRAINED = MAX ^ WRITE_UNDRAINED\nconst WRITE_NOT_QUEUED = MAX ^ WRITE_QUEUED\nconst WRITE_NOT_NEXT_TICK = MAX ^ WRITE_NEXT_TICK\n\n// Combined shared state\nconst ACTIVE = READ_ACTIVE | WRITE_ACTIVE\nconst NOT_ACTIVE = MAX ^ ACTIVE\nconst DONE = READ_DONE | WRITE_DONE\nconst DESTROY_STATUS = DESTROYING | DESTROYED\nconst OPEN_STATUS = DESTROY_STATUS | OPENING\nconst AUTO_DESTROY = DESTROY_STATUS | DONE\nconst NON_PRIMARY = WRITE_NON_PRIMARY & READ_NON_PRIMARY\nconst TICKING = (WRITE_NEXT_TICK | READ_NEXT_TICK) & NOT_ACTIVE\nconst ACTIVE_OR_TICKING = ACTIVE | TICKING\nconst IS_OPENING = OPEN_STATUS | TICKING\n\n// Combined read state\nconst READ_PRIMARY_STATUS = OPEN_STATUS | READ_ENDING | READ_DONE\nconst READ_STATUS = OPEN_STATUS | READ_DONE | READ_QUEUED\nconst READ_FLOWING = READ_RESUMED | READ_PIPE_DRAINED\nconst READ_ACTIVE_AND_SYNC = READ_ACTIVE | READ_SYNC\nconst READ_ACTIVE_AND_SYNC_AND_NEEDS_PUSH = READ_ACTIVE | READ_SYNC | READ_NEEDS_PUSH\nconst READ_PRIMARY_AND_ACTIVE = READ_PRIMARY | READ_ACTIVE\nconst READ_ENDING_STATUS = OPEN_STATUS | READ_ENDING | READ_QUEUED\nconst READ_EMIT_READABLE_AND_QUEUED = READ_EMIT_READABLE | READ_QUEUED\nconst READ_READABLE_STATUS = OPEN_STATUS | READ_EMIT_READABLE | READ_QUEUED | READ_EMITTED_READABLE\nconst SHOULD_NOT_READ = OPEN_STATUS | READ_ACTIVE | READ_ENDING | READ_DONE | READ_NEEDS_PUSH\nconst READ_BACKPRESSURE_STATUS = DESTROY_STATUS | READ_ENDING | READ_DONE\n\n// Combined write state\nconst WRITE_PRIMARY_STATUS = OPEN_STATUS | WRITE_FINISHING | WRITE_DONE\nconst WRITE_QUEUED_AND_UNDRAINED = WRITE_QUEUED | WRITE_UNDRAINED\nconst WRITE_QUEUED_AND_ACTIVE = WRITE_QUEUED | WRITE_ACTIVE\nconst WRITE_DRAIN_STATUS = WRITE_QUEUED | WRITE_UNDRAINED | OPEN_STATUS | WRITE_ACTIVE\nconst WRITE_STATUS = OPEN_STATUS | WRITE_ACTIVE | WRITE_QUEUED\nconst WRITE_PRIMARY_AND_ACTIVE = WRITE_PRIMARY | WRITE_ACTIVE\nconst WRITE_ACTIVE_AND_SYNC = WRITE_ACTIVE | WRITE_SYNC\nconst WRITE_FINISHING_STATUS = OPEN_STATUS | WRITE_FINISHING | WRITE_QUEUED\nconst WRITE_BACKPRESSURE_STATUS = WRITE_UNDRAINED | DESTROY_STATUS | WRITE_FINISHING | WRITE_DONE\n\nconst asyncIterator = Symbol.asyncIterator || Symbol('asyncIterator')\n\nclass WritableState {\n constructor (stream, { highWaterMark = 16384, map = null, mapWritable, byteLength, byteLengthWritable } = {}) {\n this.stream = stream\n this.queue = new FIFO()\n this.highWaterMark = highWaterMark\n this.buffered = 0\n this.error = null\n this.pipeline = null\n this.byteLength = byteLengthWritable || byteLength || defaultByteLength\n this.map = mapWritable || map\n this.afterWrite = afterWrite.bind(this)\n this.afterUpdateNextTick = updateWriteNT.bind(this)\n }\n\n get ended () {\n return (this.stream._duplexState & WRITE_DONE) !== 0\n }\n\n push (data) {\n if (this.map !== null) data = this.map(data)\n\n this.buffered += this.byteLength(data)\n this.queue.push(data)\n\n if (this.buffered < this.highWaterMark) {\n this.stream._duplexState |= WRITE_QUEUED\n return true\n }\n\n this.stream._duplexState |= WRITE_QUEUED_AND_UNDRAINED\n return false\n }\n\n shift () {\n const data = this.queue.shift()\n const stream = this.stream\n\n this.buffered -= this.byteLength(data)\n if (this.buffered === 0) stream._duplexState &= WRITE_NOT_QUEUED\n\n return data\n }\n\n end (data) {\n if (typeof data === 'function') this.stream.once('finish', data)\n else if (data !== undefined && data !== null) this.push(data)\n this.stream._duplexState = (this.stream._duplexState | WRITE_FINISHING) & WRITE_NON_PRIMARY\n }\n\n autoBatch (data, cb) {\n const buffer = []\n const stream = this.stream\n\n buffer.push(data)\n while ((stream._duplexState & WRITE_STATUS) === WRITE_QUEUED_AND_ACTIVE) {\n buffer.push(stream._writableState.shift())\n }\n\n if ((stream._duplexState & OPEN_STATUS) !== 0) return cb(null)\n stream._writev(buffer, cb)\n }\n\n update () {\n const stream = this.stream\n\n while ((stream._duplexState & WRITE_STATUS) === WRITE_QUEUED) {\n const data = this.shift()\n stream._duplexState |= WRITE_ACTIVE_AND_SYNC\n stream._write(data, this.afterWrite)\n stream._duplexState &= WRITE_NOT_SYNC\n }\n\n if ((stream._duplexState & WRITE_PRIMARY_AND_ACTIVE) === 0) this.updateNonPrimary()\n }\n\n updateNonPrimary () {\n const stream = this.stream\n\n if ((stream._duplexState & WRITE_FINISHING_STATUS) === WRITE_FINISHING) {\n stream._duplexState = (stream._duplexState | WRITE_ACTIVE) & WRITE_NOT_FINISHING\n stream._final(afterFinal.bind(this))\n return\n }\n\n if ((stream._duplexState & DESTROY_STATUS) === DESTROYING) {\n if ((stream._duplexState & ACTIVE_OR_TICKING) === 0) {\n stream._duplexState |= ACTIVE\n stream._destroy(afterDestroy.bind(this))\n }\n return\n }\n\n if ((stream._duplexState & IS_OPENING) === OPENING) {\n stream._duplexState = (stream._duplexState | ACTIVE) & NOT_OPENING\n stream._open(afterOpen.bind(this))\n }\n }\n\n updateNextTick () {\n if ((this.stream._duplexState & WRITE_NEXT_TICK) !== 0) return\n this.stream._duplexState |= WRITE_NEXT_TICK\n queueTick(this.afterUpdateNextTick)\n }\n}\n\nclass ReadableState {\n constructor (stream, { highWaterMark = 16384, map = null, mapReadable, byteLength, byteLengthReadable } = {}) {\n this.stream = stream\n this.queue = new FIFO()\n this.highWaterMark = highWaterMark\n this.buffered = 0\n this.error = null\n this.pipeline = null\n this.byteLength = byteLengthReadable || byteLength || defaultByteLength\n this.map = mapReadable || map\n this.pipeTo = null\n this.afterRead = afterRead.bind(this)\n this.afterUpdateNextTick = updateReadNT.bind(this)\n }\n\n get ended () {\n return (this.stream._duplexState & READ_DONE) !== 0\n }\n\n pipe (pipeTo, cb) {\n if (this.pipeTo !== null) throw new Error('Can only pipe to one destination')\n\n this.stream._duplexState |= READ_PIPE_DRAINED\n this.pipeTo = pipeTo\n this.pipeline = new Pipeline(this.stream, pipeTo, cb || null)\n\n if (cb) this.stream.on('error', noop) // We already error handle this so supress crashes\n\n if (isStreamx(pipeTo)) {\n pipeTo._writableState.pipeline = this.pipeline\n if (cb) pipeTo.on('error', noop) // We already error handle this so supress crashes\n pipeTo.on('finish', this.pipeline.finished.bind(this.pipeline)) // TODO: just call finished from pipeTo itself\n } else {\n const onerror = this.pipeline.done.bind(this.pipeline, pipeTo)\n const onclose = this.pipeline.done.bind(this.pipeline, pipeTo, null) // onclose has a weird bool arg\n pipeTo.on('error', onerror)\n pipeTo.on('close', onclose)\n pipeTo.on('finish', this.pipeline.finished.bind(this.pipeline))\n }\n\n pipeTo.on('drain', afterDrain.bind(this))\n this.stream.emit('piping', pipeTo)\n pipeTo.emit('pipe', this.stream)\n }\n\n push (data) {\n const stream = this.stream\n\n if (data === null) {\n this.highWaterMark = 0\n stream._duplexState = (stream._duplexState | READ_ENDING) & READ_NON_PRIMARY_AND_PUSHED\n return false\n }\n\n if (this.map !== null) data = this.map(data)\n this.buffered += this.byteLength(data)\n this.queue.push(data)\n\n stream._duplexState = (stream._duplexState | READ_QUEUED) & READ_PUSHED\n\n return this.buffered < this.highWaterMark\n }\n\n shift () {\n const data = this.queue.shift()\n\n this.buffered -= this.byteLength(data)\n if (this.buffered === 0) this.stream._duplexState &= READ_NOT_QUEUED\n return data\n }\n\n unshift (data) {\n let tail\n const pending = []\n\n while ((tail = this.queue.shift()) !== undefined) {\n pending.push(tail)\n }\n\n this.push(data)\n\n for (let i = 0; i < pending.length; i++) {\n this.queue.push(pending[i])\n }\n }\n\n read () {\n const stream = this.stream\n\n if ((stream._duplexState & READ_STATUS) === READ_QUEUED) {\n const data = this.shift()\n if ((stream._duplexState & READ_EMIT_DATA) !== 0) stream.emit('data', data)\n if (this.pipeTo !== null && this.pipeTo.write(data) === false) stream._duplexState &= READ_PIPE_NOT_DRAINED\n return data\n }\n\n return null\n }\n\n drain () {\n const stream = this.stream\n\n while ((stream._duplexState & READ_STATUS) === READ_QUEUED && (stream._duplexState & READ_FLOWING) !== 0) {\n const data = this.shift()\n if ((stream._duplexState & READ_EMIT_DATA) !== 0) stream.emit('data', data)\n if (this.pipeTo !== null && this.pipeTo.write(data) === false) stream._duplexState &= READ_PIPE_NOT_DRAINED\n }\n }\n\n update () {\n const stream = this.stream\n\n this.drain()\n\n while (this.buffered < this.highWaterMark && (stream._duplexState & SHOULD_NOT_READ) === 0) {\n stream._duplexState |= READ_ACTIVE_AND_SYNC_AND_NEEDS_PUSH\n stream._read(this.afterRead)\n stream._duplexState &= READ_NOT_SYNC\n if ((stream._duplexState & READ_ACTIVE) === 0) this.drain()\n }\n\n if ((stream._duplexState & READ_READABLE_STATUS) === READ_EMIT_READABLE_AND_QUEUED) {\n stream._duplexState |= READ_EMITTED_READABLE\n stream.emit('readable')\n }\n\n if ((stream._duplexState & READ_PRIMARY_AND_ACTIVE) === 0) this.updateNonPrimary()\n }\n\n updateNonPrimary () {\n const stream = this.stream\n\n if ((stream._duplexState & READ_ENDING_STATUS) === READ_ENDING) {\n stream._duplexState = (stream._duplexState | READ_DONE) & READ_NOT_ENDING\n stream.emit('end')\n if ((stream._duplexState & AUTO_DESTROY) === DONE) stream._duplexState |= DESTROYING\n if (this.pipeTo !== null) this.pipeTo.end()\n }\n\n if ((stream._duplexState & DESTROY_STATUS) === DESTROYING) {\n if ((stream._duplexState & ACTIVE_OR_TICKING) === 0) {\n stream._duplexState |= ACTIVE\n stream._destroy(afterDestroy.bind(this))\n }\n return\n }\n\n if ((stream._duplexState & IS_OPENING) === OPENING) {\n stream._duplexState = (stream._duplexState | ACTIVE) & NOT_OPENING\n stream._open(afterOpen.bind(this))\n }\n }\n\n updateNextTick () {\n if ((this.stream._duplexState & READ_NEXT_TICK) !== 0) return\n this.stream._duplexState |= READ_NEXT_TICK\n queueTick(this.afterUpdateNextTick)\n }\n}\n\nclass TransformState {\n constructor (stream) {\n this.data = null\n this.afterTransform = afterTransform.bind(stream)\n this.afterFinal = null\n }\n}\n\nclass Pipeline {\n constructor (src, dst, cb) {\n this.from = src\n this.to = dst\n this.afterPipe = cb\n this.error = null\n this.pipeToFinished = false\n }\n\n finished () {\n this.pipeToFinished = true\n }\n\n done (stream, err) {\n if (err) this.error = err\n\n if (stream === this.to) {\n this.to = null\n\n if (this.from !== null) {\n if ((this.from._duplexState & READ_DONE) === 0 || !this.pipeToFinished) {\n this.from.destroy(this.error || new Error('Writable stream closed prematurely'))\n }\n return\n }\n }\n\n if (stream === this.from) {\n this.from = null\n\n if (this.to !== null) {\n if ((stream._duplexState & READ_DONE) === 0) {\n this.to.destroy(this.error || new Error('Readable stream closed before ending'))\n }\n return\n }\n }\n\n if (this.afterPipe !== null) this.afterPipe(this.error)\n this.to = this.from = this.afterPipe = null\n }\n}\n\nfunction afterDrain () {\n this.stream._duplexState |= READ_PIPE_DRAINED\n if ((this.stream._duplexState & READ_ACTIVE_AND_SYNC) === 0) this.updateNextTick()\n}\n\nfunction afterFinal (err) {\n const stream = this.stream\n if (err) stream.destroy(err)\n if ((stream._duplexState & DESTROY_STATUS) === 0) {\n stream._duplexState |= WRITE_DONE\n stream.emit('finish')\n }\n if ((stream._duplexState & AUTO_DESTROY) === DONE) {\n stream._duplexState |= DESTROYING\n }\n\n stream._duplexState &= WRITE_NOT_ACTIVE\n this.update()\n}\n\nfunction afterDestroy (err) {\n const stream = this.stream\n\n if (!err && this.error !== STREAM_DESTROYED) err = this.error\n if (err) stream.emit('error', err)\n stream._duplexState |= DESTROYED\n stream.emit('close')\n\n const rs = stream._readableState\n const ws = stream._writableState\n\n if (rs !== null && rs.pipeline !== null) rs.pipeline.done(stream, err)\n if (ws !== null && ws.pipeline !== null) ws.pipeline.done(stream, err)\n}\n\nfunction afterWrite (err) {\n const stream = this.stream\n\n if (err) stream.destroy(err)\n stream._duplexState &= WRITE_NOT_ACTIVE\n\n if ((stream._duplexState & WRITE_DRAIN_STATUS) === WRITE_UNDRAINED) {\n stream._duplexState &= WRITE_DRAINED\n if ((stream._duplexState & WRITE_EMIT_DRAIN) === WRITE_EMIT_DRAIN) {\n stream.emit('drain')\n }\n }\n\n if ((stream._duplexState & WRITE_SYNC) === 0) this.update()\n}\n\nfunction afterRead (err) {\n if (err) this.stream.destroy(err)\n this.stream._duplexState &= READ_NOT_ACTIVE\n if ((this.stream._duplexState & READ_SYNC) === 0) this.update()\n}\n\nfunction updateReadNT () {\n this.stream._duplexState &= READ_NOT_NEXT_TICK\n this.update()\n}\n\nfunction updateWriteNT () {\n this.stream._duplexState &= WRITE_NOT_NEXT_TICK\n this.update()\n}\n\nfunction afterOpen (err) {\n const stream = this.stream\n\n if (err) stream.destroy(err)\n\n if ((stream._duplexState & DESTROYING) === 0) {\n if ((stream._duplexState & READ_PRIMARY_STATUS) === 0) stream._duplexState |= READ_PRIMARY\n if ((stream._duplexState & WRITE_PRIMARY_STATUS) === 0) stream._duplexState |= WRITE_PRIMARY\n stream.emit('open')\n }\n\n stream._duplexState &= NOT_ACTIVE\n\n if (stream._writableState !== null) {\n stream._writableState.update()\n }\n\n if (stream._readableState !== null) {\n stream._readableState.update()\n }\n}\n\nfunction afterTransform (err, data) {\n if (data !== undefined && data !== null) this.push(data)\n this._writableState.afterWrite(err)\n}\n\nclass Stream extends EventEmitter {\n constructor (opts) {\n super()\n\n this._duplexState = 0\n this._readableState = null\n this._writableState = null\n\n if (opts) {\n if (opts.open) this._open = opts.open\n if (opts.destroy) this._destroy = opts.destroy\n if (opts.predestroy) this._predestroy = opts.predestroy\n if (opts.signal) {\n opts.signal.addEventListener('abort', abort.bind(this))\n }\n }\n }\n\n _open (cb) {\n cb(null)\n }\n\n _destroy (cb) {\n cb(null)\n }\n\n _predestroy () {\n // does nothing\n }\n\n get readable () {\n return this._readableState !== null ? true : undefined\n }\n\n get writable () {\n return this._writableState !== null ? true : undefined\n }\n\n get destroyed () {\n return (this._duplexState & DESTROYED) !== 0\n }\n\n get destroying () {\n return (this._duplexState & DESTROY_STATUS) !== 0\n }\n\n destroy (err) {\n if ((this._duplexState & DESTROY_STATUS) === 0) {\n if (!err) err = STREAM_DESTROYED\n this._duplexState = (this._duplexState | DESTROYING) & NON_PRIMARY\n if (this._readableState !== null) {\n this._readableState.error = err\n this._readableState.updateNextTick()\n }\n if (this._writableState !== null) {\n this._writableState.error = err\n this._writableState.updateNextTick()\n }\n this._predestroy()\n }\n }\n\n on (name, fn) {\n if (this._readableState !== null) {\n if (name === 'data') {\n this._duplexState |= (READ_EMIT_DATA | READ_RESUMED)\n this._readableState.updateNextTick()\n }\n if (name === 'readable') {\n this._duplexState |= READ_EMIT_READABLE\n this._readableState.updateNextTick()\n }\n }\n\n if (this._writableState !== null) {\n if (name === 'drain') {\n this._duplexState |= WRITE_EMIT_DRAIN\n this._writableState.updateNextTick()\n }\n }\n\n return super.on(name, fn)\n }\n}\n\nclass Readable extends Stream {\n constructor (opts) {\n super(opts)\n\n this._duplexState |= OPENING | WRITE_DONE\n this._readableState = new ReadableState(this, opts)\n\n if (opts) {\n if (opts.read) this._read = opts.read\n }\n }\n\n _read (cb) {\n cb(null)\n }\n\n pipe (dest, cb) {\n this._readableState.pipe(dest, cb)\n this._readableState.updateNextTick()\n return dest\n }\n\n read () {\n this._readableState.updateNextTick()\n return this._readableState.read()\n }\n\n push (data) {\n this._readableState.updateNextTick()\n return this._readableState.push(data)\n }\n\n unshift (data) {\n this._readableState.updateNextTick()\n return this._readableState.unshift(data)\n }\n\n resume () {\n this._duplexState |= READ_RESUMED\n this._readableState.updateNextTick()\n return this\n }\n\n pause () {\n this._duplexState &= READ_PAUSED\n return this\n }\n\n static _fromAsyncIterator (ite, opts) {\n let destroy\n\n const rs = new Readable({\n ...opts,\n read (cb) {\n ite.next().then(push).then(cb.bind(null, null)).catch(cb)\n },\n predestroy () {\n destroy = ite.return()\n },\n destroy (cb) {\n destroy.then(cb.bind(null, null)).catch(cb)\n }\n })\n\n return rs\n\n function push (data) {\n if (data.done) rs.push(null)\n else rs.push(data.value)\n }\n }\n\n static from (data, opts) {\n if (isReadStreamx(data)) return data\n if (data[asyncIterator]) return this._fromAsyncIterator(data[asyncIterator](), opts)\n if (!Array.isArray(data)) data = data === undefined ? [] : [data]\n\n let i = 0\n return new Readable({\n ...opts,\n read (cb) {\n this.push(i === data.length ? null : data[i++])\n cb(null)\n }\n })\n }\n\n static isBackpressured (rs) {\n return (rs._duplexState & READ_BACKPRESSURE_STATUS) !== 0 || rs._readableState.buffered >= rs._readableState.highWaterMark\n }\n\n static isPaused (rs) {\n return (rs._duplexState & READ_RESUMED) === 0\n }\n\n [asyncIterator] () {\n const stream = this\n\n let error = null\n let promiseResolve = null\n let promiseReject = null\n\n this.on('error', (err) => { error = err })\n this.on('readable', onreadable)\n this.on('close', onclose)\n\n return {\n [asyncIterator] () {\n return this\n },\n next () {\n return new Promise(function (resolve, reject) {\n promiseResolve = resolve\n promiseReject = reject\n const data = stream.read()\n if (data !== null) ondata(data)\n else if ((stream._duplexState & DESTROYED) !== 0) ondata(null)\n })\n },\n return () {\n return destroy(null)\n },\n throw (err) {\n return destroy(err)\n }\n }\n\n function onreadable () {\n if (promiseResolve !== null) ondata(stream.read())\n }\n\n function onclose () {\n if (promiseResolve !== null) ondata(null)\n }\n\n function ondata (data) {\n if (promiseReject === null) return\n if (error) promiseReject(error)\n else if (data === null && (stream._duplexState & READ_DONE) === 0) promiseReject(STREAM_DESTROYED)\n else promiseResolve({ value: data, done: data === null })\n promiseReject = promiseResolve = null\n }\n\n function destroy (err) {\n stream.destroy(err)\n return new Promise((resolve, reject) => {\n if (stream._duplexState & DESTROYED) return resolve({ value: undefined, done: true })\n stream.once('close', function () {\n if (err) reject(err)\n else resolve({ value: undefined, done: true })\n })\n })\n }\n }\n}\n\nclass Writable extends Stream {\n constructor (opts) {\n super(opts)\n\n this._duplexState |= OPENING | READ_DONE\n this._writableState = new WritableState(this, opts)\n\n if (opts) {\n if (opts.writev) this._writev = opts.writev\n if (opts.write) this._write = opts.write\n if (opts.final) this._final = opts.final\n }\n }\n\n _writev (batch, cb) {\n cb(null)\n }\n\n _write (data, cb) {\n this._writableState.autoBatch(data, cb)\n }\n\n _final (cb) {\n cb(null)\n }\n\n static isBackpressured (ws) {\n return (ws._duplexState & WRITE_BACKPRESSURE_STATUS) !== 0\n }\n\n write (data) {\n this._writableState.updateNextTick()\n return this._writableState.push(data)\n }\n\n end (data) {\n this._writableState.updateNextTick()\n this._writableState.end(data)\n return this\n }\n}\n\nclass Duplex extends Readable { // and Writable\n constructor (opts) {\n super(opts)\n\n this._duplexState = OPENING\n this._writableState = new WritableState(this, opts)\n\n if (opts) {\n if (opts.writev) this._writev = opts.writev\n if (opts.write) this._write = opts.write\n if (opts.final) this._final = opts.final\n }\n }\n\n _writev (batch, cb) {\n cb(null)\n }\n\n _write (data, cb) {\n this._writableState.autoBatch(data, cb)\n }\n\n _final (cb) {\n cb(null)\n }\n\n write (data) {\n this._writableState.updateNextTick()\n return this._writableState.push(data)\n }\n\n end (data) {\n this._writableState.updateNextTick()\n this._writableState.end(data)\n return this\n }\n}\n\nclass Transform extends Duplex {\n constructor (opts) {\n super(opts)\n this._transformState = new TransformState(this)\n\n if (opts) {\n if (opts.transform) this._transform = opts.transform\n if (opts.flush) this._flush = opts.flush\n }\n }\n\n _write (data, cb) {\n if (this._readableState.buffered >= this._readableState.highWaterMark) {\n this._transformState.data = data\n } else {\n this._transform(data, this._transformState.afterTransform)\n }\n }\n\n _read (cb) {\n if (this._transformState.data !== null) {\n const data = this._transformState.data\n this._transformState.data = null\n cb(null)\n this._transform(data, this._transformState.afterTransform)\n } else {\n cb(null)\n }\n }\n\n _transform (data, cb) {\n cb(null, data)\n }\n\n _flush (cb) {\n cb(null)\n }\n\n _final (cb) {\n this._transformState.afterFinal = cb\n this._flush(transformAfterFlush.bind(this))\n }\n}\n\nclass PassThrough extends Transform {}\n\nfunction transformAfterFlush (err, data) {\n const cb = this._transformState.afterFinal\n if (err) return cb(err)\n if (data !== null && data !== undefined) this.push(data)\n this.push(null)\n cb(null)\n}\n\nfunction pipelinePromise (...streams) {\n return new Promise((resolve, reject) => {\n return pipeline(...streams, (err) => {\n if (err) return reject(err)\n resolve()\n })\n })\n}\n\nfunction pipeline (stream, ...streams) {\n const all = Array.isArray(stream) ? [...stream, ...streams] : [stream, ...streams]\n const done = (all.length && typeof all[all.length - 1] === 'function') ? all.pop() : null\n\n if (all.length < 2) throw new Error('Pipeline requires at least 2 streams')\n\n let src = all[0]\n let dest = null\n let error = null\n\n for (let i = 1; i < all.length; i++) {\n dest = all[i]\n\n if (isStreamx(src)) {\n src.pipe(dest, onerror)\n } else {\n errorHandle(src, true, i > 1, onerror)\n src.pipe(dest)\n }\n\n src = dest\n }\n\n if (done) {\n let fin = false\n\n dest.on('finish', () => { fin = true })\n dest.on('error', err => { error = error || err })\n dest.on('close', () => done(error || (fin ? null : PREMATURE_CLOSE)))\n }\n\n return dest\n\n function errorHandle (s, rd, wr, onerror) {\n s.on('error', onerror)\n s.on('close', onclose)\n\n function onclose () {\n if (rd && s._readableState && !s._readableState.ended) return onerror(PREMATURE_CLOSE)\n if (wr && s._writableState && !s._writableState.ended) return onerror(PREMATURE_CLOSE)\n }\n }\n\n function onerror (err) {\n if (!err || error) return\n error = err\n\n for (const s of all) {\n s.destroy(err)\n }\n }\n}\n\nfunction isStream (stream) {\n return !!stream._readableState || !!stream._writableState\n}\n\nfunction isStreamx (stream) {\n return typeof stream._duplexState === 'number' && isStream(stream)\n}\n\nfunction isReadStreamx (stream) {\n return isStreamx(stream) && stream.readable\n}\n\nfunction isTypedArray (data) {\n return typeof data === 'object' && data !== null && typeof data.byteLength === 'number'\n}\n\nfunction defaultByteLength (data) {\n return isTypedArray(data) ? data.byteLength : 1024\n}\n\nfunction noop () {}\n\nfunction abort () {\n this.destroy(new Error('Stream aborted.'))\n}\n\nmodule.exports = {\n pipeline,\n pipelinePromise,\n isStream,\n isStreamx,\n Stream,\n Writable,\n Readable,\n Duplex,\n Transform,\n // Export PassThrough for compatibility with Node.js core's stream module\n PassThrough\n}\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\n'use strict';\n\n/**/\n\nvar Buffer = require('safe-buffer').Buffer;\n/**/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n return true;\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n case 'latin1':\n case 'binary':\n return 'latin1';\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n default:\n if (retried) return; // undefined\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\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n}\n\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.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\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 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 if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\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 buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n};\n\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.\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}\n\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.\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n}\n\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.\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return '\\ufffd';\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return '\\ufffd';\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}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\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 buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n}\n\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.\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}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + '\\ufffd';\n return r;\n}\n\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.\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\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 return r;\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}\n\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.\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\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 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 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}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}","/* \nCopyright (c) 2011, Chris Umbel\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in \nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN \nTHE SOFTWARE.\n*/\n\nvar base32 = require('./thirty-two');\n\nexports.encode = base32.encode;\nexports.decode = base32.decode;\n","/*\nCopyright (c) 2011, Chris Umbel\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n'use strict';\n\nvar charTable = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\nvar byteTable = [\n 0xff, 0xff, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f,\n 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,\n 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e,\n 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,\n 0x17, 0x18, 0x19, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,\n 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e,\n 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,\n 0x17, 0x18, 0x19, 0xff, 0xff, 0xff, 0xff, 0xff\n];\n\nfunction quintetCount(buff) {\n var quintets = Math.floor(buff.length / 5);\n return buff.length % 5 === 0 ? quintets: quintets + 1;\n}\n\nexports.encode = function(plain) {\n if(!Buffer.isBuffer(plain)){\n \tplain = new Buffer(plain);\n }\n var i = 0;\n var j = 0;\n var shiftIndex = 0;\n var digit = 0;\n var encoded = new Buffer(quintetCount(plain) * 8);\n\n /* byte by byte isn't as pretty as quintet by quintet but tests a bit\n faster. will have to revisit. */\n while(i < plain.length) {\n var current = plain[i];\n\n if(shiftIndex > 3) {\n digit = current & (0xff >> shiftIndex);\n shiftIndex = (shiftIndex + 5) % 8;\n digit = (digit << shiftIndex) | ((i + 1 < plain.length) ?\n plain[i + 1] : 0) >> (8 - shiftIndex);\n i++;\n } else {\n digit = (current >> (8 - (shiftIndex + 5))) & 0x1f;\n shiftIndex = (shiftIndex + 5) % 8;\n if(shiftIndex === 0) i++;\n }\n\n encoded[j] = charTable.charCodeAt(digit);\n j++;\n }\n\n for(i = j; i < encoded.length; i++) {\n encoded[i] = 0x3d; //'='.charCodeAt(0)\n }\n\n return encoded;\n};\n\nexports.decode = function(encoded) {\n var shiftIndex = 0;\n var plainDigit = 0;\n var plainChar;\n var plainPos = 0;\n if(!Buffer.isBuffer(encoded)){\n \tencoded = new Buffer(encoded);\n }\n var decoded = new Buffer(Math.ceil(encoded.length * 5 / 8));\n\n /* byte by byte isn't as pretty as octet by octet but tests a bit\n faster. will have to revisit. */\n for(var i = 0; i < encoded.length; i++) {\n \tif(encoded[i] === 0x3d){ //'='\n \t\tbreak;\n \t}\n\n var encodedByte = encoded[i] - 0x30;\n\n if(encodedByte < byteTable.length) {\n plainDigit = byteTable[encodedByte];\n\n if(shiftIndex <= 3) {\n shiftIndex = (shiftIndex + 5) % 8;\n\n if(shiftIndex === 0) {\n plainChar |= plainDigit;\n decoded[plainPos] = plainChar;\n plainPos++;\n plainChar = 0;\n } else {\n plainChar |= 0xff & (plainDigit << (8 - shiftIndex));\n }\n } else {\n shiftIndex = (shiftIndex + 5) % 8;\n plainChar |= 0xff & (plainDigit >>> shiftIndex);\n decoded[plainPos] = plainChar;\n plainPos++;\n\n plainChar = 0xff & (plainDigit << (8 - shiftIndex));\n }\n } else {\n \tthrow new Error('Invalid input - it is not base32 encoded string');\n }\n }\n\n return decoded.slice(0, plainPos);\n};\n","var Buffer = require('buffer').Buffer\n\nmodule.exports = function (buf) {\n\t// If the buffer is backed by a Uint8Array, a faster version will work\n\tif (buf instanceof Uint8Array) {\n\t\t// If the buffer isn't a subarray, return the underlying ArrayBuffer\n\t\tif (buf.byteOffset === 0 && buf.byteLength === buf.buffer.byteLength) {\n\t\t\treturn buf.buffer\n\t\t} else if (typeof buf.buffer.slice === 'function') {\n\t\t\t// Otherwise we need to get a proper copy\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength)\n\t\t}\n\t}\n\n\tif (Buffer.isBuffer(buf)) {\n\t\t// This is the slow version that will work with any Buffer\n\t\t// implementation (even in old browsers)\n\t\tvar arrayCopy = new Uint8Array(buf.length)\n\t\tvar len = buf.length\n\t\tfor (var i = 0; i < len; i++) {\n\t\t\tarrayCopy[i] = buf[i]\n\t\t}\n\t\treturn arrayCopy.buffer\n\t} else {\n\t\tthrow new Error('Argument must be a Buffer')\n\t}\n}\n","/*! torrent-discovery. MIT License. WebTorrent LLC */\nconst debug = require('debug')('torrent-discovery')\nconst DHT = require('bittorrent-dht/client') // empty object in browser\nconst EventEmitter = require('events').EventEmitter\nconst parallel = require('run-parallel')\nconst Tracker = require('bittorrent-tracker/client')\nconst LSD = require('bittorrent-lsd')\n\nclass Discovery extends EventEmitter {\n constructor (opts) {\n super()\n\n if (!opts.peerId) throw new Error('Option `peerId` is required')\n if (!opts.infoHash) throw new Error('Option `infoHash` is required')\n if (!process.browser && !opts.port) throw new Error('Option `port` is required')\n\n this.peerId = typeof opts.peerId === 'string'\n ? opts.peerId\n : opts.peerId.toString('hex')\n this.infoHash = typeof opts.infoHash === 'string'\n ? opts.infoHash.toLowerCase()\n : opts.infoHash.toString('hex')\n this._port = opts.port // torrent port\n this._userAgent = opts.userAgent // User-Agent header for http requests\n\n this.destroyed = false\n\n this._announce = opts.announce || []\n this._intervalMs = opts.intervalMs || (15 * 60 * 1000)\n this._trackerOpts = null\n this._dhtAnnouncing = false\n this._dhtTimeout = false\n this._internalDHT = false // is the DHT created internally?\n\n this._onWarning = err => {\n this.emit('warning', err)\n }\n this._onError = err => {\n this.emit('error', err)\n }\n this._onDHTPeer = (peer, infoHash) => {\n if (infoHash.toString('hex') !== this.infoHash) return\n this.emit('peer', `${peer.host}:${peer.port}`, 'dht')\n }\n this._onTrackerPeer = peer => {\n this.emit('peer', peer, 'tracker')\n }\n this._onTrackerAnnounce = () => {\n this.emit('trackerAnnounce')\n }\n this._onLSDPeer = (peer, infoHash) => {\n this.emit('peer', peer, 'lsd')\n }\n\n const createDHT = (port, opts) => {\n const dht = new DHT(opts)\n dht.on('warning', this._onWarning)\n dht.on('error', this._onError)\n dht.listen(port)\n this._internalDHT = true\n return dht\n }\n\n if (opts.tracker === false) {\n this.tracker = null\n } else if (opts.tracker && typeof opts.tracker === 'object') {\n this._trackerOpts = Object.assign({}, opts.tracker)\n this.tracker = this._createTracker()\n } else {\n this.tracker = this._createTracker()\n }\n\n if (opts.dht === false || typeof DHT !== 'function') {\n this.dht = null\n } else if (opts.dht && typeof opts.dht.addNode === 'function') {\n this.dht = opts.dht\n } else if (opts.dht && typeof opts.dht === 'object') {\n this.dht = createDHT(opts.dhtPort, opts.dht)\n } else {\n this.dht = createDHT(opts.dhtPort)\n }\n\n if (this.dht) {\n this.dht.on('peer', this._onDHTPeer)\n this._dhtAnnounce()\n }\n\n if (opts.lsd === false || typeof LSD !== 'function') {\n this.lsd = null\n } else {\n this.lsd = this._createLSD()\n }\n }\n\n updatePort (port) {\n if (port === this._port) return\n this._port = port\n\n if (this.dht) this._dhtAnnounce()\n\n if (this.tracker) {\n this.tracker.stop()\n this.tracker.destroy(() => {\n this.tracker = this._createTracker()\n })\n }\n }\n\n complete (opts) {\n if (this.tracker) {\n this.tracker.complete(opts)\n }\n }\n\n destroy (cb) {\n if (this.destroyed) return\n this.destroyed = true\n\n clearTimeout(this._dhtTimeout)\n\n const tasks = []\n\n if (this.tracker) {\n this.tracker.stop()\n this.tracker.removeListener('warning', this._onWarning)\n this.tracker.removeListener('error', this._onError)\n this.tracker.removeListener('peer', this._onTrackerPeer)\n this.tracker.removeListener('update', this._onTrackerAnnounce)\n tasks.push(cb => {\n this.tracker.destroy(cb)\n })\n }\n\n if (this.dht) {\n this.dht.removeListener('peer', this._onDHTPeer)\n }\n\n if (this._internalDHT) {\n this.dht.removeListener('warning', this._onWarning)\n this.dht.removeListener('error', this._onError)\n tasks.push(cb => {\n this.dht.destroy(cb)\n })\n }\n\n if (this.lsd) {\n this.lsd.removeListener('warning', this._onWarning)\n this.lsd.removeListener('error', this._onError)\n this.lsd.removeListener('peer', this._onLSDPeer)\n tasks.push(cb => {\n this.lsd.destroy(cb)\n })\n }\n\n parallel(tasks, cb)\n\n // cleanup\n this.dht = null\n this.tracker = null\n this.lsd = null\n this._announce = null\n }\n\n _createTracker () {\n const opts = Object.assign({}, this._trackerOpts, {\n infoHash: this.infoHash,\n announce: this._announce,\n peerId: this.peerId,\n port: this._port,\n userAgent: this._userAgent\n })\n\n const tracker = new Tracker(opts)\n tracker.on('warning', this._onWarning)\n tracker.on('error', this._onError)\n tracker.on('peer', this._onTrackerPeer)\n tracker.on('update', this._onTrackerAnnounce)\n tracker.setInterval(this._intervalMs)\n tracker.start()\n return tracker\n }\n\n _dhtAnnounce () {\n if (this._dhtAnnouncing) return\n debug('dht announce')\n\n this._dhtAnnouncing = true\n clearTimeout(this._dhtTimeout)\n\n this.dht.announce(this.infoHash, this._port, err => {\n this._dhtAnnouncing = false\n debug('dht announce complete')\n\n if (err) this.emit('warning', err)\n this.emit('dhtAnnounce')\n\n if (!this.destroyed) {\n this._dhtTimeout = setTimeout(() => {\n this._dhtAnnounce()\n }, this._intervalMs + Math.floor(Math.random() * this._intervalMs / 5))\n if (this._dhtTimeout.unref) this._dhtTimeout.unref()\n }\n })\n }\n\n _createLSD () {\n const opts = Object.assign({}, {\n infoHash: this.infoHash,\n peerId: this.peerId,\n port: this._port\n })\n\n const lsd = new LSD(opts)\n lsd.on('warning', this._onWarning)\n lsd.on('error', this._onError)\n lsd.on('peer', this._onLSDPeer)\n lsd.start()\n return lsd\n }\n}\n\nmodule.exports = Discovery\n","/*! torrent-piece. MIT License. WebTorrent LLC */\nconst BLOCK_LENGTH = 1 << 14\n\nclass Piece {\n constructor (length) {\n this.length = length\n this.missing = length\n this.sources = null\n\n this._chunks = Math.ceil(length / BLOCK_LENGTH)\n this._remainder = (length % BLOCK_LENGTH) || BLOCK_LENGTH\n this._buffered = 0\n this._buffer = null\n this._cancellations = null\n this._reservations = 0\n this._flushed = false\n }\n\n chunkLength (i) {\n return i === this._chunks - 1 ? this._remainder : BLOCK_LENGTH\n }\n\n chunkLengthRemaining (i) {\n return this.length - (i * BLOCK_LENGTH)\n }\n\n chunkOffset (i) {\n return i * BLOCK_LENGTH\n }\n\n reserve () {\n if (!this.init()) return -1\n if (this._cancellations.length) return this._cancellations.pop()\n if (this._reservations < this._chunks) return this._reservations++\n return -1\n }\n\n reserveRemaining () {\n if (!this.init()) return -1\n if (this._cancellations.length || this._reservations < this._chunks) {\n let min = this._reservations\n while (this._cancellations.length) {\n min = Math.min(min, this._cancellations.pop())\n }\n this._reservations = this._chunks\n return min\n }\n return -1\n }\n\n cancel (i) {\n if (!this.init()) return\n this._cancellations.push(i)\n }\n\n cancelRemaining (i) {\n if (!this.init()) return\n this._reservations = i\n }\n\n get (i) {\n if (!this.init()) return null\n return this._buffer[i]\n }\n\n set (i, data, source) {\n if (!this.init()) return false\n const len = data.length\n const blocks = Math.ceil(len / BLOCK_LENGTH)\n for (let j = 0; j < blocks; j++) {\n if (!this._buffer[i + j]) {\n const offset = j * BLOCK_LENGTH\n const splitData = data.slice(offset, offset + BLOCK_LENGTH)\n this._buffered++\n this._buffer[i + j] = splitData\n this.missing -= splitData.length\n if (!this.sources.includes(source)) {\n this.sources.push(source)\n }\n }\n }\n return this._buffered === this._chunks\n }\n\n flush () {\n if (!this._buffer || this._chunks !== this._buffered) return null\n const buffer = Buffer.concat(this._buffer, this.length)\n this._buffer = null\n this._cancellations = null\n this.sources = null\n this._flushed = true\n return buffer\n }\n\n init () {\n if (this._flushed) return false\n if (this._buffer) return true\n this._buffer = new Array(this._chunks)\n this._cancellations = []\n this.sources = []\n return true\n }\n}\n\nObject.defineProperty(Piece, 'BLOCK_LENGTH', { value: BLOCK_LENGTH })\n\nmodule.exports = Piece\n","/**\n * Convert a typed array to a Buffer without a copy\n *\n * Author: Feross Aboukhadijeh \n * License: MIT\n *\n * `npm install typedarray-to-buffer`\n */\n\nvar isTypedArray = require('is-typedarray').strict\n\nmodule.exports = function typedarrayToBuffer (arr) {\n if (isTypedArray(arr)) {\n // To avoid a copy, use the typed array's underlying ArrayBuffer to back new Buffer\n var buf = Buffer.from(arr.buffer)\n if (arr.byteLength !== arr.buffer.byteLength) {\n // Respect the \"view\", i.e. byteOffset and byteLength, without doing a copy\n buf = buf.slice(arr.byteOffset, arr.byteOffset + arr.byteLength)\n }\n return buf\n } else {\n // Pass through all other types to `Buffer.from`\n return Buffer.from(arr)\n }\n}\n","var bufferAlloc = require('buffer-alloc')\n\nvar UINT_32_MAX = Math.pow(2, 32)\n\nexports.encodingLength = function () {\n return 8\n}\n\nexports.encode = function (num, buf, offset) {\n if (!buf) buf = bufferAlloc(8)\n if (!offset) offset = 0\n\n var top = Math.floor(num / UINT_32_MAX)\n var rem = num - top * UINT_32_MAX\n\n buf.writeUInt32BE(top, offset)\n buf.writeUInt32BE(rem, offset + 4)\n return buf\n}\n\nexports.decode = function (buf, offset) {\n if (!offset) offset = 0\n\n var top = buf.readUInt32BE(offset)\n var rem = buf.readUInt32BE(offset + 4)\n\n return top * UINT_32_MAX + rem\n}\n\nexports.encode.bytes = 8\nexports.decode.bytes = 8\n","module.exports = remove\n\nfunction remove (arr, i) {\n if (i >= arr.length || i < 0) return\n var last = arr.pop()\n if (i < arr.length) {\n var tmp = arr[i]\n arr[i] = last\n return tmp\n }\n return last\n}\n","/*! https://mths.be/punycode v1.3.2 by @mathias */\n;(function(root) {\n\n\t/** Detect free variables */\n\tvar freeExports = typeof exports == 'object' && exports &&\n\t\t!exports.nodeType && exports;\n\tvar freeModule = typeof module == 'object' && module &&\n\t\t!module.nodeType && module;\n\tvar freeGlobal = typeof global == 'object' && global;\n\tif (\n\t\tfreeGlobal.global === freeGlobal ||\n\t\tfreeGlobal.window === freeGlobal ||\n\t\tfreeGlobal.self === freeGlobal\n\t) {\n\t\troot = freeGlobal;\n\t}\n\n\t/**\n\t * The `punycode` object.\n\t * @name punycode\n\t * @type Object\n\t */\n\tvar punycode,\n\n\t/** Highest positive signed 32-bit float value */\n\tmaxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1\n\n\t/** Bootstring parameters */\n\tbase = 36,\n\ttMin = 1,\n\ttMax = 26,\n\tskew = 38,\n\tdamp = 700,\n\tinitialBias = 72,\n\tinitialN = 128, // 0x80\n\tdelimiter = '-', // '\\x2D'\n\n\t/** Regular expressions */\n\tregexPunycode = /^xn--/,\n\tregexNonASCII = /[^\\x20-\\x7E]/, // unprintable ASCII chars + non-ASCII chars\n\tregexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g, // RFC 3490 separators\n\n\t/** Error messages */\n\terrors = {\n\t\t'overflow': 'Overflow: input needs wider integers to process',\n\t\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t\t'invalid-input': 'Invalid input'\n\t},\n\n\t/** Convenience shortcuts */\n\tbaseMinusTMin = base - tMin,\n\tfloor = Math.floor,\n\tstringFromCharCode = String.fromCharCode,\n\n\t/** Temporary variable */\n\tkey;\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/**\n\t * A generic error utility function.\n\t * @private\n\t * @param {String} type The error type.\n\t * @returns {Error} Throws a `RangeError` with the applicable error message.\n\t */\n\tfunction error(type) {\n\t\tthrow RangeError(errors[type]);\n\t}\n\n\t/**\n\t * A generic `Array#map` utility function.\n\t * @private\n\t * @param {Array} array The array to iterate over.\n\t * @param {Function} callback The function that gets called for every array\n\t * item.\n\t * @returns {Array} A new array of values returned by the callback function.\n\t */\n\tfunction map(array, fn) {\n\t\tvar length = array.length;\n\t\tvar result = [];\n\t\twhile (length--) {\n\t\t\tresult[length] = fn(array[length]);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * A simple `Array#map`-like wrapper to work with domain name strings or email\n\t * addresses.\n\t * @private\n\t * @param {String} domain The domain name or email address.\n\t * @param {Function} callback The function that gets called for every\n\t * character.\n\t * @returns {Array} A new string of characters returned by the callback\n\t * function.\n\t */\n\tfunction mapDomain(string, fn) {\n\t\tvar parts = string.split('@');\n\t\tvar result = '';\n\t\tif (parts.length > 1) {\n\t\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t\t// the local part (i.e. everything up to `@`) intact.\n\t\t\tresult = parts[0] + '@';\n\t\t\tstring = parts[1];\n\t\t}\n\t\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\t\tstring = string.replace(regexSeparators, '\\x2E');\n\t\tvar labels = string.split('.');\n\t\tvar encoded = map(labels, fn).join('.');\n\t\treturn result + encoded;\n\t}\n\n\t/**\n\t * Creates an array containing the numeric code points of each Unicode\n\t * character in the string. While JavaScript uses UCS-2 internally,\n\t * this function will convert a pair of surrogate halves (each of which\n\t * UCS-2 exposes as separate characters) into a single code point,\n\t * matching UTF-16.\n\t * @see `punycode.ucs2.encode`\n\t * @see \n\t * @memberOf punycode.ucs2\n\t * @name decode\n\t * @param {String} string The Unicode input string (UCS-2).\n\t * @returns {Array} The new array of code points.\n\t */\n\tfunction ucs2decode(string) {\n\t\tvar output = [],\n\t\t counter = 0,\n\t\t length = string.length,\n\t\t value,\n\t\t extra;\n\t\twhile (counter < length) {\n\t\t\tvalue = string.charCodeAt(counter++);\n\t\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t\t// high surrogate, and there is a next character\n\t\t\t\textra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) { // low surrogate\n\t\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t\t} else {\n\t\t\t\t\t// unmatched surrogate; only append this code unit, in case the next\n\t\t\t\t\t// code unit is the high surrogate of a surrogate pair\n\t\t\t\t\toutput.push(value);\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\toutput.push(value);\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\t/**\n\t * Creates a string based on an array of numeric code points.\n\t * @see `punycode.ucs2.decode`\n\t * @memberOf punycode.ucs2\n\t * @name encode\n\t * @param {Array} codePoints The array of numeric code points.\n\t * @returns {String} The new Unicode string (UCS-2).\n\t */\n\tfunction ucs2encode(array) {\n\t\treturn map(array, function(value) {\n\t\t\tvar output = '';\n\t\t\tif (value > 0xFFFF) {\n\t\t\t\tvalue -= 0x10000;\n\t\t\t\toutput += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);\n\t\t\t\tvalue = 0xDC00 | value & 0x3FF;\n\t\t\t}\n\t\t\toutput += stringFromCharCode(value);\n\t\t\treturn output;\n\t\t}).join('');\n\t}\n\n\t/**\n\t * Converts a basic code point into a digit/integer.\n\t * @see `digitToBasic()`\n\t * @private\n\t * @param {Number} codePoint The basic numeric code point value.\n\t * @returns {Number} The numeric value of a basic code point (for use in\n\t * representing integers) in the range `0` to `base - 1`, or `base` if\n\t * the code point does not represent a value.\n\t */\n\tfunction basicToDigit(codePoint) {\n\t\tif (codePoint - 48 < 10) {\n\t\t\treturn codePoint - 22;\n\t\t}\n\t\tif (codePoint - 65 < 26) {\n\t\t\treturn codePoint - 65;\n\t\t}\n\t\tif (codePoint - 97 < 26) {\n\t\t\treturn codePoint - 97;\n\t\t}\n\t\treturn base;\n\t}\n\n\t/**\n\t * Converts a digit/integer into a basic code point.\n\t * @see `basicToDigit()`\n\t * @private\n\t * @param {Number} digit The numeric value of a basic code point.\n\t * @returns {Number} The basic code point whose value (when used for\n\t * representing integers) is `digit`, which needs to be in the range\n\t * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n\t * used; else, the lowercase form is used. The behavior is undefined\n\t * if `flag` is non-zero and `digit` has no uppercase form.\n\t */\n\tfunction digitToBasic(digit, flag) {\n\t\t// 0..25 map to ASCII a..z or A..Z\n\t\t// 26..35 map to ASCII 0..9\n\t\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n\t}\n\n\t/**\n\t * Bias adaptation function as per section 3.4 of RFC 3492.\n\t * http://tools.ietf.org/html/rfc3492#section-3.4\n\t * @private\n\t */\n\tfunction adapt(delta, numPoints, firstTime) {\n\t\tvar k = 0;\n\t\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\t\tdelta += floor(delta / numPoints);\n\t\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\t\tdelta = floor(delta / baseMinusTMin);\n\t\t}\n\t\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n\t}\n\n\t/**\n\t * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n\t * symbols.\n\t * @memberOf punycode\n\t * @param {String} input The Punycode string of ASCII-only symbols.\n\t * @returns {String} The resulting string of Unicode symbols.\n\t */\n\tfunction decode(input) {\n\t\t// Don't use UCS-2\n\t\tvar output = [],\n\t\t inputLength = input.length,\n\t\t out,\n\t\t i = 0,\n\t\t n = initialN,\n\t\t bias = initialBias,\n\t\t basic,\n\t\t j,\n\t\t index,\n\t\t oldi,\n\t\t w,\n\t\t k,\n\t\t digit,\n\t\t t,\n\t\t /** Cached calculation results */\n\t\t baseMinusT;\n\n\t\t// Handle the basic code points: let `basic` be the number of input code\n\t\t// points before the last delimiter, or `0` if there is none, then copy\n\t\t// the first basic code points to the output.\n\n\t\tbasic = input.lastIndexOf(delimiter);\n\t\tif (basic < 0) {\n\t\t\tbasic = 0;\n\t\t}\n\n\t\tfor (j = 0; j < basic; ++j) {\n\t\t\t// if it's not a basic code point\n\t\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\t\terror('not-basic');\n\t\t\t}\n\t\t\toutput.push(input.charCodeAt(j));\n\t\t}\n\n\t\t// Main decoding loop: start just after the last delimiter if any basic code\n\t\t// points were copied; start at the beginning otherwise.\n\n\t\tfor (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t\t// `index` is the index of the next character to be consumed.\n\t\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t\t// which gets added to `i`. The overflow checking is easier\n\t\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t\t// value at the end to obtain `delta`.\n\t\t\tfor (oldi = i, w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\t\tif (index >= inputLength) {\n\t\t\t\t\terror('invalid-input');\n\t\t\t\t}\n\n\t\t\t\tdigit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\ti += digit * w;\n\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\t\tif (digit < t) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbaseMinusT = base - t;\n\t\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tw *= baseMinusT;\n\n\t\t\t}\n\n\t\t\tout = output.length + 1;\n\t\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t\t// incrementing `n` each time, so we'll fix that now:\n\t\t\tif (floor(i / out) > maxInt - n) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tn += floor(i / out);\n\t\t\ti %= out;\n\n\t\t\t// Insert `n` at position `i` of the output\n\t\t\toutput.splice(i++, 0, n);\n\n\t\t}\n\n\t\treturn ucs2encode(output);\n\t}\n\n\t/**\n\t * Converts a string of Unicode symbols (e.g. a domain name label) to a\n\t * Punycode string of ASCII-only symbols.\n\t * @memberOf punycode\n\t * @param {String} input The string of Unicode symbols.\n\t * @returns {String} The resulting Punycode string of ASCII-only symbols.\n\t */\n\tfunction encode(input) {\n\t\tvar n,\n\t\t delta,\n\t\t handledCPCount,\n\t\t basicLength,\n\t\t bias,\n\t\t j,\n\t\t m,\n\t\t q,\n\t\t k,\n\t\t t,\n\t\t currentValue,\n\t\t output = [],\n\t\t /** `inputLength` will hold the number of code points in `input`. */\n\t\t inputLength,\n\t\t /** Cached calculation results */\n\t\t handledCPCountPlusOne,\n\t\t baseMinusT,\n\t\t qMinusT;\n\n\t\t// Convert the input in UCS-2 to Unicode\n\t\tinput = ucs2decode(input);\n\n\t\t// Cache the length\n\t\tinputLength = input.length;\n\n\t\t// Initialize the state\n\t\tn = initialN;\n\t\tdelta = 0;\n\t\tbias = initialBias;\n\n\t\t// Handle the basic code points\n\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\tcurrentValue = input[j];\n\t\t\tif (currentValue < 0x80) {\n\t\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t\t}\n\t\t}\n\n\t\thandledCPCount = basicLength = output.length;\n\n\t\t// `handledCPCount` is the number of code points that have been handled;\n\t\t// `basicLength` is the number of basic code points.\n\n\t\t// Finish the basic string - if it is not empty - with a delimiter\n\t\tif (basicLength) {\n\t\t\toutput.push(delimiter);\n\t\t}\n\n\t\t// Main encoding loop:\n\t\twhile (handledCPCount < inputLength) {\n\n\t\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t\t// larger one:\n\t\t\tfor (m = maxInt, j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\t\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\t\tm = currentValue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Increase `delta` enough to advance the decoder's state to ,\n\t\t\t// but guard against overflow\n\t\t\thandledCPCountPlusOne = handledCPCount + 1;\n\t\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\t\tn = m;\n\n\t\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\n\t\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tif (currentValue == n) {\n\t\t\t\t\t// Represent delta as a generalized variable-length integer\n\t\t\t\t\tfor (q = delta, k = base; /* no condition */; k += base) {\n\t\t\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tqMinusT = q - t;\n\t\t\t\t\t\tbaseMinusT = base - t;\n\t\t\t\t\t\toutput.push(\n\t\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t\t);\n\t\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t\t}\n\n\t\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\t\tdelta = 0;\n\t\t\t\t\t++handledCPCount;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t++delta;\n\t\t\t++n;\n\n\t\t}\n\t\treturn output.join('');\n\t}\n\n\t/**\n\t * Converts a Punycode string representing a domain name or an email address\n\t * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n\t * it doesn't matter if you call it on a string that has already been\n\t * converted to Unicode.\n\t * @memberOf punycode\n\t * @param {String} input The Punycoded domain name or email address to\n\t * convert to Unicode.\n\t * @returns {String} The Unicode representation of the given Punycode\n\t * string.\n\t */\n\tfunction toUnicode(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexPunycode.test(string)\n\t\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/**\n\t * Converts a Unicode string representing a domain name or an email address to\n\t * Punycode. Only the non-ASCII parts of the domain name will be converted,\n\t * i.e. it doesn't matter if you call it with a domain that's already in\n\t * ASCII.\n\t * @memberOf punycode\n\t * @param {String} input The domain name or email address to convert, as a\n\t * Unicode string.\n\t * @returns {String} The Punycode representation of the given domain name or\n\t * email address.\n\t */\n\tfunction toASCII(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexNonASCII.test(string)\n\t\t\t\t? 'xn--' + encode(string)\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/** Define the public API */\n\tpunycode = {\n\t\t/**\n\t\t * A string representing the current Punycode.js version number.\n\t\t * @memberOf punycode\n\t\t * @type String\n\t\t */\n\t\t'version': '1.3.2',\n\t\t/**\n\t\t * An object of methods to convert from JavaScript's internal character\n\t\t * representation (UCS-2) to Unicode code points, and back.\n\t\t * @see \n\t\t * @memberOf punycode\n\t\t * @type Object\n\t\t */\n\t\t'ucs2': {\n\t\t\t'decode': ucs2decode,\n\t\t\t'encode': ucs2encode\n\t\t},\n\t\t'decode': decode,\n\t\t'encode': encode,\n\t\t'toASCII': toASCII,\n\t\t'toUnicode': toUnicode\n\t};\n\n\t/** Expose `punycode` */\n\t// Some AMD build optimizers, like r.js, check for specific condition patterns\n\t// like the following:\n\tif (\n\t\ttypeof define == 'function' &&\n\t\ttypeof define.amd == 'object' &&\n\t\tdefine.amd\n\t) {\n\t\tdefine('punycode', function() {\n\t\t\treturn punycode;\n\t\t});\n\t} else if (freeExports && freeModule) {\n\t\tif (module.exports == freeExports) { // in Node.js or RingoJS v0.8.0+\n\t\t\tfreeModule.exports = punycode;\n\t\t} else { // in Narwhal or RingoJS v0.7.0-\n\t\t\tfor (key in punycode) {\n\t\t\t\tpunycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]);\n\t\t\t}\n\t\t}\n\t} else { // in Rhino or a web browser\n\t\troot.punycode = punycode;\n\t}\n\n}(this));\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\n'use strict';\n\nvar punycode = require('punycode');\nvar util = require('./util');\n\nexports.parse = urlParse;\nexports.resolve = urlResolve;\nexports.resolveObject = urlResolveObject;\nexports.format = urlFormat;\n\nexports.Url = Url;\n\nfunction Url() {\n this.protocol = null;\n this.slashes = null;\n this.auth = null;\n this.host = null;\n this.port = null;\n this.hostname = null;\n this.hash = null;\n this.search = null;\n this.query = null;\n this.pathname = null;\n this.path = null;\n this.href = null;\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nvar protocolPattern = /^([a-z0-9.+-]+:)/i,\n portPattern = /:[0-9]*$/,\n\n // Special case for a simple path URL\n simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/,\n\n // RFC 2396: characters reserved for delimiting URLs.\n // We actually just auto-escape these.\n delims = ['<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t'],\n\n // RFC 2396: characters not allowed for various reasons.\n unwise = ['{', '}', '|', '\\\\', '^', '`'].concat(delims),\n\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = ['\\''].concat(unwise),\n // Characters that are never ever allowed in a hostname.\n // Note that any invalid chars are also handled, but these\n // are the ones that are *expected* to be seen, so we fast-path\n // them.\n nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape),\n hostEndingChars = ['/', '?', '#'],\n hostnameMaxLen = 255,\n hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,\n hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,\n // protocols that can allow \"unsafe\" and \"unwise\" chars.\n unsafeProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that never have a hostname.\n hostlessProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that always contain a // bit.\n slashedProtocol = {\n 'http': true,\n 'https': true,\n 'ftp': true,\n 'gopher': true,\n 'file': true,\n 'http:': true,\n 'https:': true,\n 'ftp:': true,\n 'gopher:': true,\n 'file:': true\n },\n querystring = require('querystring');\n\nfunction urlParse(url, parseQueryString, slashesDenoteHost) {\n if (url && util.isObject(url) && url instanceof Url) return url;\n\n var u = new Url;\n u.parse(url, parseQueryString, slashesDenoteHost);\n return u;\n}\n\nUrl.prototype.parse = function(url, parseQueryString, slashesDenoteHost) {\n if (!util.isString(url)) {\n throw new TypeError(\"Parameter 'url' must be a string, not \" + typeof url);\n }\n\n // Copy chrome, IE, opera backslash-handling behavior.\n // Back slashes before the query string get converted to forward slashes\n // See: https://code.google.com/p/chromium/issues/detail?id=25916\n var queryIndex = url.indexOf('?'),\n splitter =\n (queryIndex !== -1 && queryIndex < url.indexOf('#')) ? '?' : '#',\n uSplit = url.split(splitter),\n slashRegex = /\\\\/g;\n uSplit[0] = uSplit[0].replace(slashRegex, '/');\n url = uSplit.join(splitter);\n\n var rest = url;\n\n // trim before proceeding.\n // This is to support parse stuff like \" http://foo.com \\n\"\n rest = rest.trim();\n\n if (!slashesDenoteHost && url.split('#').length === 1) {\n // Try fast path regexp\n var simplePath = simplePathPattern.exec(rest);\n if (simplePath) {\n this.path = rest;\n this.href = rest;\n this.pathname = simplePath[1];\n if (simplePath[2]) {\n this.search = simplePath[2];\n if (parseQueryString) {\n this.query = querystring.parse(this.search.substr(1));\n } else {\n this.query = this.search.substr(1);\n }\n } else if (parseQueryString) {\n this.search = '';\n this.query = {};\n }\n return this;\n }\n }\n\n var proto = protocolPattern.exec(rest);\n if (proto) {\n proto = proto[0];\n var lowerProto = proto.toLowerCase();\n this.protocol = lowerProto;\n rest = rest.substr(proto.length);\n }\n\n // figure out if it's got a host\n // user@server is *always* interpreted as a hostname, and url\n // resolution will treat //foo/bar as host=foo,path=bar because that's\n // how the browser resolves relative URLs.\n if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n var slashes = rest.substr(0, 2) === '//';\n if (slashes && !(proto && hostlessProtocol[proto])) {\n rest = rest.substr(2);\n this.slashes = true;\n }\n }\n\n if (!hostlessProtocol[proto] &&\n (slashes || (proto && !slashedProtocol[proto]))) {\n\n // there's a hostname.\n // the first instance of /, ?, ;, or # ends the host.\n //\n // If there is an @ in the hostname, then non-host chars *are* allowed\n // to the left of the last @ sign, unless some host-ending character\n // comes *before* the @-sign.\n // URLs are obnoxious.\n //\n // ex:\n // http://a@b@c/ => user:a@b host:c\n // http://a@b?@c => user:a host:c path:/?@c\n\n // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n // Review our test case against browsers more comprehensively.\n\n // find the first instance of any hostEndingChars\n var hostEnd = -1;\n for (var i = 0; i < hostEndingChars.length; i++) {\n var hec = rest.indexOf(hostEndingChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n\n // at this point, either we have an explicit point where the\n // auth portion cannot go past, or the last @ char is the decider.\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf('@');\n } else {\n // atSign must be in auth portion.\n // http://a@b/c@d => host:b auth:a path:/c@d\n atSign = rest.lastIndexOf('@', hostEnd);\n }\n\n // Now we have a portion which is definitely the auth.\n // Pull that off.\n if (atSign !== -1) {\n auth = rest.slice(0, atSign);\n rest = rest.slice(atSign + 1);\n this.auth = decodeURIComponent(auth);\n }\n\n // the host is the remaining to the left of the first non-host char\n hostEnd = -1;\n for (var i = 0; i < nonHostChars.length; i++) {\n var hec = rest.indexOf(nonHostChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1)\n hostEnd = rest.length;\n\n this.host = rest.slice(0, hostEnd);\n rest = rest.slice(hostEnd);\n\n // pull out port.\n this.parseHost();\n\n // we've indicated that there is a hostname,\n // so even if it's empty, it has to be present.\n this.hostname = this.hostname || '';\n\n // if hostname begins with [ and ends with ]\n // assume that it's an IPv6 address.\n var ipv6Hostname = this.hostname[0] === '[' &&\n this.hostname[this.hostname.length - 1] === ']';\n\n // validate a little.\n if (!ipv6Hostname) {\n var hostparts = this.hostname.split(/\\./);\n for (var i = 0, l = hostparts.length; i < l; i++) {\n var part = hostparts[i];\n if (!part) continue;\n if (!part.match(hostnamePartPattern)) {\n var newpart = '';\n for (var j = 0, k = part.length; j < k; j++) {\n if (part.charCodeAt(j) > 127) {\n // we replace non-ASCII char with a temporary placeholder\n // we need this to make sure size of hostname is not\n // broken by replacing non-ASCII by nothing\n newpart += 'x';\n } else {\n newpart += part[j];\n }\n }\n // we test again with ASCII char only\n if (!newpart.match(hostnamePartPattern)) {\n var validParts = hostparts.slice(0, i);\n var notHost = hostparts.slice(i + 1);\n var bit = part.match(hostnamePartStart);\n if (bit) {\n validParts.push(bit[1]);\n notHost.unshift(bit[2]);\n }\n if (notHost.length) {\n rest = '/' + notHost.join('.') + rest;\n }\n this.hostname = validParts.join('.');\n break;\n }\n }\n }\n }\n\n if (this.hostname.length > hostnameMaxLen) {\n this.hostname = '';\n } else {\n // hostnames are always lower case.\n this.hostname = this.hostname.toLowerCase();\n }\n\n if (!ipv6Hostname) {\n // IDNA Support: Returns a punycoded representation of \"domain\".\n // It only converts parts of the domain name that\n // have non-ASCII characters, i.e. it doesn't matter if\n // you call it with a domain that already is ASCII-only.\n this.hostname = punycode.toASCII(this.hostname);\n }\n\n var p = this.port ? ':' + this.port : '';\n var h = this.hostname || '';\n this.host = h + p;\n this.href += this.host;\n\n // strip [ and ] from the hostname\n // the host field still retains them, though\n if (ipv6Hostname) {\n this.hostname = this.hostname.substr(1, this.hostname.length - 2);\n if (rest[0] !== '/') {\n rest = '/' + rest;\n }\n }\n }\n\n // now rest is set to the post-host stuff.\n // chop off any delim chars.\n if (!unsafeProtocol[lowerProto]) {\n\n // First, make 100% sure that any \"autoEscape\" chars get\n // escaped, even if encodeURIComponent doesn't think they\n // need to be.\n for (var i = 0, l = autoEscape.length; i < l; i++) {\n var ae = autoEscape[i];\n if (rest.indexOf(ae) === -1)\n continue;\n var esc = encodeURIComponent(ae);\n if (esc === ae) {\n esc = escape(ae);\n }\n rest = rest.split(ae).join(esc);\n }\n }\n\n\n // chop off from the tail first.\n var hash = rest.indexOf('#');\n if (hash !== -1) {\n // got a fragment string.\n this.hash = rest.substr(hash);\n rest = rest.slice(0, hash);\n }\n var qm = rest.indexOf('?');\n if (qm !== -1) {\n this.search = rest.substr(qm);\n this.query = rest.substr(qm + 1);\n if (parseQueryString) {\n this.query = querystring.parse(this.query);\n }\n rest = rest.slice(0, qm);\n } else if (parseQueryString) {\n // no query string, but parseQueryString still requested\n this.search = '';\n this.query = {};\n }\n if (rest) this.pathname = rest;\n if (slashedProtocol[lowerProto] &&\n this.hostname && !this.pathname) {\n this.pathname = '/';\n }\n\n //to support http.request\n if (this.pathname || this.search) {\n var p = this.pathname || '';\n var s = this.search || '';\n this.path = p + s;\n }\n\n // finally, reconstruct the href based on what has been validated.\n this.href = this.format();\n return this;\n};\n\n// format a parsed object into a url string\nfunction urlFormat(obj) {\n // ensure it's an object, and not a string url.\n // If it's an obj, this is a no-op.\n // this way, you can call url_format() on strings\n // to clean up potentially wonky urls.\n if (util.isString(obj)) obj = urlParse(obj);\n if (!(obj instanceof Url)) return Url.prototype.format.call(obj);\n return obj.format();\n}\n\nUrl.prototype.format = function() {\n var auth = this.auth || '';\n if (auth) {\n auth = encodeURIComponent(auth);\n auth = auth.replace(/%3A/i, ':');\n auth += '@';\n }\n\n var protocol = this.protocol || '',\n pathname = this.pathname || '',\n hash = this.hash || '',\n host = false,\n query = '';\n\n if (this.host) {\n host = auth + this.host;\n } else if (this.hostname) {\n host = auth + (this.hostname.indexOf(':') === -1 ?\n this.hostname :\n '[' + this.hostname + ']');\n if (this.port) {\n host += ':' + this.port;\n }\n }\n\n if (this.query &&\n util.isObject(this.query) &&\n Object.keys(this.query).length) {\n query = querystring.stringify(this.query);\n }\n\n var search = this.search || (query && ('?' + query)) || '';\n\n if (protocol && protocol.substr(-1) !== ':') protocol += ':';\n\n // only the slashedProtocols get the //. Not mailto:, xmpp:, etc.\n // unless they had them to begin with.\n if (this.slashes ||\n (!protocol || slashedProtocol[protocol]) && host !== false) {\n host = '//' + (host || '');\n if (pathname && pathname.charAt(0) !== '/') pathname = '/' + pathname;\n } else if (!host) {\n host = '';\n }\n\n if (hash && hash.charAt(0) !== '#') hash = '#' + hash;\n if (search && search.charAt(0) !== '?') search = '?' + search;\n\n pathname = pathname.replace(/[?#]/g, function(match) {\n return encodeURIComponent(match);\n });\n search = search.replace('#', '%23');\n\n return protocol + host + pathname + search + hash;\n};\n\nfunction urlResolve(source, relative) {\n return urlParse(source, false, true).resolve(relative);\n}\n\nUrl.prototype.resolve = function(relative) {\n return this.resolveObject(urlParse(relative, false, true)).format();\n};\n\nfunction urlResolveObject(source, relative) {\n if (!source) return relative;\n return urlParse(source, false, true).resolveObject(relative);\n}\n\nUrl.prototype.resolveObject = function(relative) {\n if (util.isString(relative)) {\n var rel = new Url();\n rel.parse(relative, false, true);\n relative = rel;\n }\n\n var result = new Url();\n var tkeys = Object.keys(this);\n for (var tk = 0; tk < tkeys.length; tk++) {\n var tkey = tkeys[tk];\n result[tkey] = this[tkey];\n }\n\n // hash is always overridden, no matter what.\n // even href=\"\" will remove it.\n result.hash = relative.hash;\n\n // if the relative url is empty, then there's nothing left to do here.\n if (relative.href === '') {\n result.href = result.format();\n return result;\n }\n\n // hrefs like //foo/bar always cut to the protocol.\n if (relative.slashes && !relative.protocol) {\n // take everything except the protocol from relative\n var rkeys = Object.keys(relative);\n for (var rk = 0; rk < rkeys.length; rk++) {\n var rkey = rkeys[rk];\n if (rkey !== 'protocol')\n result[rkey] = relative[rkey];\n }\n\n //urlParse appends trailing / to urls like http://www.example.com\n if (slashedProtocol[result.protocol] &&\n result.hostname && !result.pathname) {\n result.path = result.pathname = '/';\n }\n\n result.href = result.format();\n return result;\n }\n\n if (relative.protocol && relative.protocol !== result.protocol) {\n // if it's a known url protocol, then changing\n // the protocol does weird things\n // first, if it's not file:, then we MUST have a host,\n // and if there was a path\n // to begin with, then we MUST have a path.\n // if it is file:, then the host is dropped,\n // because that's known to be hostless.\n // anything else is assumed to be absolute.\n if (!slashedProtocol[relative.protocol]) {\n var keys = Object.keys(relative);\n for (var v = 0; v < keys.length; v++) {\n var k = keys[v];\n result[k] = relative[k];\n }\n result.href = result.format();\n return result;\n }\n\n result.protocol = relative.protocol;\n if (!relative.host && !hostlessProtocol[relative.protocol]) {\n var relPath = (relative.pathname || '').split('/');\n while (relPath.length && !(relative.host = relPath.shift()));\n if (!relative.host) relative.host = '';\n if (!relative.hostname) relative.hostname = '';\n if (relPath[0] !== '') relPath.unshift('');\n if (relPath.length < 2) relPath.unshift('');\n result.pathname = relPath.join('/');\n } else {\n result.pathname = relative.pathname;\n }\n result.search = relative.search;\n result.query = relative.query;\n result.host = relative.host || '';\n result.auth = relative.auth;\n result.hostname = relative.hostname || relative.host;\n result.port = relative.port;\n // to support http.request\n if (result.pathname || result.search) {\n var p = result.pathname || '';\n var s = result.search || '';\n result.path = p + s;\n }\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n }\n\n var isSourceAbs = (result.pathname && result.pathname.charAt(0) === '/'),\n isRelAbs = (\n relative.host ||\n relative.pathname && relative.pathname.charAt(0) === '/'\n ),\n mustEndAbs = (isRelAbs || isSourceAbs ||\n (result.host && relative.pathname)),\n removeAllDots = mustEndAbs,\n srcPath = result.pathname && result.pathname.split('/') || [],\n relPath = relative.pathname && relative.pathname.split('/') || [],\n psychotic = result.protocol && !slashedProtocol[result.protocol];\n\n // if the url is a non-slashed url, then relative\n // links like ../.. should be able\n // to crawl up to the hostname, as well. This is strange.\n // result.protocol has already been set by now.\n // Later on, put the first path part into the host field.\n if (psychotic) {\n result.hostname = '';\n result.port = null;\n if (result.host) {\n if (srcPath[0] === '') srcPath[0] = result.host;\n else srcPath.unshift(result.host);\n }\n result.host = '';\n if (relative.protocol) {\n relative.hostname = null;\n relative.port = null;\n if (relative.host) {\n if (relPath[0] === '') relPath[0] = relative.host;\n else relPath.unshift(relative.host);\n }\n relative.host = null;\n }\n mustEndAbs = mustEndAbs && (relPath[0] === '' || srcPath[0] === '');\n }\n\n if (isRelAbs) {\n // it's absolute.\n result.host = (relative.host || relative.host === '') ?\n relative.host : result.host;\n result.hostname = (relative.hostname || relative.hostname === '') ?\n relative.hostname : result.hostname;\n result.search = relative.search;\n result.query = relative.query;\n srcPath = relPath;\n // fall through to the dot-handling below.\n } else if (relPath.length) {\n // it's relative\n // throw away the existing file, and take the new path instead.\n if (!srcPath) srcPath = [];\n srcPath.pop();\n srcPath = srcPath.concat(relPath);\n result.search = relative.search;\n result.query = relative.query;\n } else if (!util.isNullOrUndefined(relative.search)) {\n // just pull out the search.\n // like href='?foo'.\n // Put this after the other two cases because it simplifies the booleans\n if (psychotic) {\n result.hostname = result.host = srcPath.shift();\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n result.search = relative.search;\n result.query = relative.query;\n //to support http.request\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.href = result.format();\n return result;\n }\n\n if (!srcPath.length) {\n // no path at all. easy.\n // we've already handled the other stuff above.\n result.pathname = null;\n //to support http.request\n if (result.search) {\n result.path = '/' + result.search;\n } else {\n result.path = null;\n }\n result.href = result.format();\n return result;\n }\n\n // if a url ENDs in . or .., then it must get a trailing slash.\n // however, if it ends in anything else non-slashy,\n // then it must NOT get a trailing slash.\n var last = srcPath.slice(-1)[0];\n var hasTrailingSlash = (\n (result.host || relative.host || srcPath.length > 1) &&\n (last === '.' || last === '..') || last === '');\n\n // strip single dots, resolve double dots to parent dir\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = srcPath.length; i >= 0; i--) {\n last = srcPath[i];\n if (last === '.') {\n srcPath.splice(i, 1);\n } else if (last === '..') {\n srcPath.splice(i, 1);\n up++;\n } else if (up) {\n srcPath.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (!mustEndAbs && !removeAllDots) {\n for (; up--; up) {\n srcPath.unshift('..');\n }\n }\n\n if (mustEndAbs && srcPath[0] !== '' &&\n (!srcPath[0] || srcPath[0].charAt(0) !== '/')) {\n srcPath.unshift('');\n }\n\n if (hasTrailingSlash && (srcPath.join('/').substr(-1) !== '/')) {\n srcPath.push('');\n }\n\n var isAbsolute = srcPath[0] === '' ||\n (srcPath[0] && srcPath[0].charAt(0) === '/');\n\n // put the host back\n if (psychotic) {\n result.hostname = result.host = isAbsolute ? '' :\n srcPath.length ? srcPath.shift() : '';\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n\n mustEndAbs = mustEndAbs || (result.host && srcPath.length);\n\n if (mustEndAbs && !isAbsolute) {\n srcPath.unshift('');\n }\n\n if (!srcPath.length) {\n result.pathname = null;\n result.path = null;\n } else {\n result.pathname = srcPath.join('/');\n }\n\n //to support request.http\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.auth = relative.auth || result.auth;\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n};\n\nUrl.prototype.parseHost = function() {\n var host = this.host;\n var port = portPattern.exec(host);\n if (port) {\n port = port[0];\n if (port !== ':') {\n this.port = port.substr(1);\n }\n host = host.substr(0, host.length - port.length);\n }\n if (host) this.hostname = host;\n};\n","'use strict';\n\nmodule.exports = {\n isString: function(arg) {\n return typeof(arg) === 'string';\n },\n isObject: function(arg) {\n return typeof(arg) === 'object' && arg !== null;\n },\n isNull: function(arg) {\n return arg === null;\n },\n isNullOrUndefined: function(arg) {\n return arg == null;\n }\n};\n","/*! ut_metadata. MIT License. WebTorrent LLC */\nconst { EventEmitter } = require('events')\nconst bencode = require('bencode')\nconst BitField = require('bitfield').default\nconst debug = require('debug')('ut_metadata')\nconst sha1 = require('simple-sha1')\n\nconst MAX_METADATA_SIZE = 1E7 // 10 MB\nconst BITFIELD_GROW = 1E3\nconst PIECE_LENGTH = 1 << 14 // 16 KiB\n\nmodule.exports = metadata => {\n class utMetadata extends EventEmitter {\n constructor (wire) {\n super()\n\n this._wire = wire\n\n this._fetching = false\n this._metadataComplete = false\n this._metadataSize = null\n // how many reject messages to tolerate before quitting\n this._remainingRejects = null\n\n // The largest torrent file that I know of is ~1-2MB, which is ~100\n // pieces. Therefore, cap the bitfield to 10x that (1000 pieces) so a\n // malicious peer can't make it grow to fill all memory.\n this._bitfield = new BitField(0, { grow: BITFIELD_GROW })\n\n if (Buffer.isBuffer(metadata)) {\n this.setMetadata(metadata)\n }\n }\n\n onHandshake (infoHash, peerId, extensions) {\n this._infoHash = infoHash\n }\n\n onExtendedHandshake (handshake) {\n if (!handshake.m || !handshake.m.ut_metadata) {\n return this.emit('warning', new Error('Peer does not support ut_metadata'))\n }\n if (!handshake.metadata_size) {\n return this.emit('warning', new Error('Peer does not have metadata'))\n }\n if (typeof handshake.metadata_size !== 'number' ||\n MAX_METADATA_SIZE < handshake.metadata_size ||\n handshake.metadata_size <= 0) {\n return this.emit('warning', new Error('Peer gave invalid metadata size'))\n }\n\n this._metadataSize = handshake.metadata_size\n this._numPieces = Math.ceil(this._metadataSize / PIECE_LENGTH)\n this._remainingRejects = this._numPieces * 2\n\n this._requestPieces()\n }\n\n onMessage (buf) {\n let dict\n let trailer\n try {\n const str = buf.toString()\n const trailerIndex = str.indexOf('ee') + 2\n dict = bencode.decode(str.substring(0, trailerIndex))\n trailer = buf.slice(trailerIndex)\n } catch (err) {\n // drop invalid messages\n return\n }\n\n switch (dict.msg_type) {\n case 0:\n // ut_metadata request (from peer)\n // example: { 'msg_type': 0, 'piece': 0 }\n this._onRequest(dict.piece)\n break\n case 1:\n // ut_metadata data (in response to our request)\n // example: { 'msg_type': 1, 'piece': 0, 'total_size': 3425 }\n this._onData(dict.piece, trailer, dict.total_size)\n break\n case 2:\n // ut_metadata reject (peer doesn't have piece we requested)\n // { 'msg_type': 2, 'piece': 0 }\n this._onReject(dict.piece)\n break\n }\n }\n\n /**\n * Ask the peer to send metadata.\n * @public\n */\n fetch () {\n if (this._metadataComplete) {\n return\n }\n this._fetching = true\n if (this._metadataSize) {\n this._requestPieces()\n }\n }\n\n /**\n * Stop asking the peer to send metadata.\n * @public\n */\n cancel () {\n this._fetching = false\n }\n\n setMetadata (metadata) {\n if (this._metadataComplete) return true\n debug('set metadata')\n\n // if full torrent dictionary was passed in, pull out just `info` key\n try {\n const info = bencode.decode(metadata).info\n if (info) {\n metadata = bencode.encode(info)\n }\n } catch (err) {}\n\n // check hash\n if (this._infoHash && this._infoHash !== sha1.sync(metadata)) {\n return false\n }\n\n this.cancel()\n\n this.metadata = metadata\n this._metadataComplete = true\n this._metadataSize = this.metadata.length\n this._wire.extendedHandshake.metadata_size = this._metadataSize\n\n this.emit('metadata', bencode.encode({\n info: bencode.decode(this.metadata)\n }))\n\n return true\n }\n\n _send (dict, trailer) {\n let buf = bencode.encode(dict)\n if (Buffer.isBuffer(trailer)) {\n buf = Buffer.concat([buf, trailer])\n }\n this._wire.extended('ut_metadata', buf)\n }\n\n _request (piece) {\n this._send({ msg_type: 0, piece })\n }\n\n _data (piece, buf, totalSize) {\n const msg = { msg_type: 1, piece }\n if (typeof totalSize === 'number') {\n msg.total_size = totalSize\n }\n this._send(msg, buf)\n }\n\n _reject (piece) {\n this._send({ msg_type: 2, piece })\n }\n\n _onRequest (piece) {\n if (!this._metadataComplete) {\n this._reject(piece)\n return\n }\n const start = piece * PIECE_LENGTH\n let end = start + PIECE_LENGTH\n if (end > this._metadataSize) {\n end = this._metadataSize\n }\n const buf = this.metadata.slice(start, end)\n this._data(piece, buf, this._metadataSize)\n }\n\n _onData (piece, buf, totalSize) {\n if (buf.length > PIECE_LENGTH || !this._fetching) {\n return\n }\n buf.copy(this.metadata, piece * PIECE_LENGTH)\n this._bitfield.set(piece)\n this._checkDone()\n }\n\n _onReject (piece) {\n if (this._remainingRejects > 0 && this._fetching) {\n // If we haven't been rejected too much,\n // then try to request the piece again\n this._request(piece)\n this._remainingRejects -= 1\n } else {\n this.emit('warning', new Error('Peer sent \"reject\" too much'))\n }\n }\n\n _requestPieces () {\n if (!this._fetching) return\n this.metadata = Buffer.alloc(this._metadataSize)\n for (let piece = 0; piece < this._numPieces; piece++) {\n this._request(piece)\n }\n }\n\n _checkDone () {\n let done = true\n for (let piece = 0; piece < this._numPieces; piece++) {\n if (!this._bitfield.get(piece)) {\n done = false\n break\n }\n }\n if (!done) return\n\n // attempt to set metadata -- may fail sha1 check\n const success = this.setMetadata(this.metadata)\n\n if (!success) {\n this._failedMetadata()\n }\n }\n\n _failedMetadata () {\n // reset bitfield & try again\n this._bitfield = new BitField(0, { grow: BITFIELD_GROW })\n this._remainingRejects -= this._numPieces\n if (this._remainingRejects > 0) {\n this._requestPieces()\n } else {\n this.emit('warning', new Error('Peer sent invalid metadata'))\n }\n }\n }\n\n // Name of the bittorrent-protocol extension\n utMetadata.prototype.name = 'ut_metadata'\n\n return utMetadata\n}\n","\n/**\n * Module exports.\n */\n\nmodule.exports = deprecate;\n\n/**\n * Mark that a method should not be used.\n * Returns a modified function which warns once by default.\n *\n * If `localStorage.noDeprecation = true` is set, then it is a no-op.\n *\n * If `localStorage.throwDeprecation = true` is set, then deprecated functions\n * will throw an Error when invoked.\n *\n * If `localStorage.traceDeprecation = true` is set, then deprecated functions\n * will invoke `console.trace()` instead of `console.error()`.\n *\n * @param {Function} fn - the function to deprecate\n * @param {String} msg - the string to print to the console when `fn` is invoked\n * @returns {Function} a new \"deprecated\" version of `fn`\n * @api public\n */\n\nfunction deprecate (fn, msg) {\n if (config('noDeprecation')) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (config('throwDeprecation')) {\n throw new Error(msg);\n } else if (config('traceDeprecation')) {\n console.trace(msg);\n } else {\n console.warn(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n}\n\n/**\n * Checks `localStorage` for boolean values for the given `name`.\n *\n * @param {String} name\n * @returns {Boolean}\n * @api private\n */\n\nfunction config (name) {\n // accessing global.localStorage can trigger a DOMException in sandboxed iframes\n try {\n if (!global.localStorage) return false;\n } catch (_) {\n return false;\n }\n var val = global.localStorage[name];\n if (null == val) return false;\n return String(val).toLowerCase() === 'true';\n}\n","module.exports = function isBuffer(arg) {\n return arg && typeof arg === 'object'\n && typeof arg.copy === 'function'\n && typeof arg.fill === 'function'\n && typeof arg.readUInt8 === 'function';\n}","// Currently in sync with Node.js lib/internal/util/types.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n\n'use strict';\n\nvar isArgumentsObject = require('is-arguments');\nvar isGeneratorFunction = require('is-generator-function');\nvar whichTypedArray = require('which-typed-array');\nvar isTypedArray = require('is-typed-array');\n\nfunction uncurryThis(f) {\n return f.call.bind(f);\n}\n\nvar BigIntSupported = typeof BigInt !== 'undefined';\nvar SymbolSupported = typeof Symbol !== 'undefined';\n\nvar ObjectToString = uncurryThis(Object.prototype.toString);\n\nvar numberValue = uncurryThis(Number.prototype.valueOf);\nvar stringValue = uncurryThis(String.prototype.valueOf);\nvar booleanValue = uncurryThis(Boolean.prototype.valueOf);\n\nif (BigIntSupported) {\n var bigIntValue = uncurryThis(BigInt.prototype.valueOf);\n}\n\nif (SymbolSupported) {\n var symbolValue = uncurryThis(Symbol.prototype.valueOf);\n}\n\nfunction checkBoxedPrimitive(value, prototypeValueOf) {\n if (typeof value !== 'object') {\n return false;\n }\n try {\n prototypeValueOf(value);\n return true;\n } catch(e) {\n return false;\n }\n}\n\nexports.isArgumentsObject = isArgumentsObject;\nexports.isGeneratorFunction = isGeneratorFunction;\nexports.isTypedArray = isTypedArray;\n\n// Taken from here and modified for better browser support\n// https://github.com/sindresorhus/p-is-promise/blob/cda35a513bda03f977ad5cde3a079d237e82d7ef/index.js\nfunction isPromise(input) {\n\treturn (\n\t\t(\n\t\t\ttypeof Promise !== 'undefined' &&\n\t\t\tinput instanceof Promise\n\t\t) ||\n\t\t(\n\t\t\tinput !== null &&\n\t\t\ttypeof input === 'object' &&\n\t\t\ttypeof input.then === 'function' &&\n\t\t\ttypeof input.catch === 'function'\n\t\t)\n\t);\n}\nexports.isPromise = isPromise;\n\nfunction isArrayBufferView(value) {\n if (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView) {\n return ArrayBuffer.isView(value);\n }\n\n return (\n isTypedArray(value) ||\n isDataView(value)\n );\n}\nexports.isArrayBufferView = isArrayBufferView;\n\n\nfunction isUint8Array(value) {\n return whichTypedArray(value) === 'Uint8Array';\n}\nexports.isUint8Array = isUint8Array;\n\nfunction isUint8ClampedArray(value) {\n return whichTypedArray(value) === 'Uint8ClampedArray';\n}\nexports.isUint8ClampedArray = isUint8ClampedArray;\n\nfunction isUint16Array(value) {\n return whichTypedArray(value) === 'Uint16Array';\n}\nexports.isUint16Array = isUint16Array;\n\nfunction isUint32Array(value) {\n return whichTypedArray(value) === 'Uint32Array';\n}\nexports.isUint32Array = isUint32Array;\n\nfunction isInt8Array(value) {\n return whichTypedArray(value) === 'Int8Array';\n}\nexports.isInt8Array = isInt8Array;\n\nfunction isInt16Array(value) {\n return whichTypedArray(value) === 'Int16Array';\n}\nexports.isInt16Array = isInt16Array;\n\nfunction isInt32Array(value) {\n return whichTypedArray(value) === 'Int32Array';\n}\nexports.isInt32Array = isInt32Array;\n\nfunction isFloat32Array(value) {\n return whichTypedArray(value) === 'Float32Array';\n}\nexports.isFloat32Array = isFloat32Array;\n\nfunction isFloat64Array(value) {\n return whichTypedArray(value) === 'Float64Array';\n}\nexports.isFloat64Array = isFloat64Array;\n\nfunction isBigInt64Array(value) {\n return whichTypedArray(value) === 'BigInt64Array';\n}\nexports.isBigInt64Array = isBigInt64Array;\n\nfunction isBigUint64Array(value) {\n return whichTypedArray(value) === 'BigUint64Array';\n}\nexports.isBigUint64Array = isBigUint64Array;\n\nfunction isMapToString(value) {\n return ObjectToString(value) === '[object Map]';\n}\nisMapToString.working = (\n typeof Map !== 'undefined' &&\n isMapToString(new Map())\n);\n\nfunction isMap(value) {\n if (typeof Map === 'undefined') {\n return false;\n }\n\n return isMapToString.working\n ? isMapToString(value)\n : value instanceof Map;\n}\nexports.isMap = isMap;\n\nfunction isSetToString(value) {\n return ObjectToString(value) === '[object Set]';\n}\nisSetToString.working = (\n typeof Set !== 'undefined' &&\n isSetToString(new Set())\n);\nfunction isSet(value) {\n if (typeof Set === 'undefined') {\n return false;\n }\n\n return isSetToString.working\n ? isSetToString(value)\n : value instanceof Set;\n}\nexports.isSet = isSet;\n\nfunction isWeakMapToString(value) {\n return ObjectToString(value) === '[object WeakMap]';\n}\nisWeakMapToString.working = (\n typeof WeakMap !== 'undefined' &&\n isWeakMapToString(new WeakMap())\n);\nfunction isWeakMap(value) {\n if (typeof WeakMap === 'undefined') {\n return false;\n }\n\n return isWeakMapToString.working\n ? isWeakMapToString(value)\n : value instanceof WeakMap;\n}\nexports.isWeakMap = isWeakMap;\n\nfunction isWeakSetToString(value) {\n return ObjectToString(value) === '[object WeakSet]';\n}\nisWeakSetToString.working = (\n typeof WeakSet !== 'undefined' &&\n isWeakSetToString(new WeakSet())\n);\nfunction isWeakSet(value) {\n return isWeakSetToString(value);\n}\nexports.isWeakSet = isWeakSet;\n\nfunction isArrayBufferToString(value) {\n return ObjectToString(value) === '[object ArrayBuffer]';\n}\nisArrayBufferToString.working = (\n typeof ArrayBuffer !== 'undefined' &&\n isArrayBufferToString(new ArrayBuffer())\n);\nfunction isArrayBuffer(value) {\n if (typeof ArrayBuffer === 'undefined') {\n return false;\n }\n\n return isArrayBufferToString.working\n ? isArrayBufferToString(value)\n : value instanceof ArrayBuffer;\n}\nexports.isArrayBuffer = isArrayBuffer;\n\nfunction isDataViewToString(value) {\n return ObjectToString(value) === '[object DataView]';\n}\nisDataViewToString.working = (\n typeof ArrayBuffer !== 'undefined' &&\n typeof DataView !== 'undefined' &&\n isDataViewToString(new DataView(new ArrayBuffer(1), 0, 1))\n);\nfunction isDataView(value) {\n if (typeof DataView === 'undefined') {\n return false;\n }\n\n return isDataViewToString.working\n ? isDataViewToString(value)\n : value instanceof DataView;\n}\nexports.isDataView = isDataView;\n\n// Store a copy of SharedArrayBuffer in case it's deleted elsewhere\nvar SharedArrayBufferCopy = typeof SharedArrayBuffer !== 'undefined' ? SharedArrayBuffer : undefined;\nfunction isSharedArrayBufferToString(value) {\n return ObjectToString(value) === '[object SharedArrayBuffer]';\n}\nfunction isSharedArrayBuffer(value) {\n if (typeof SharedArrayBufferCopy === 'undefined') {\n return false;\n }\n\n if (typeof isSharedArrayBufferToString.working === 'undefined') {\n isSharedArrayBufferToString.working = isSharedArrayBufferToString(new SharedArrayBufferCopy());\n }\n\n return isSharedArrayBufferToString.working\n ? isSharedArrayBufferToString(value)\n : value instanceof SharedArrayBufferCopy;\n}\nexports.isSharedArrayBuffer = isSharedArrayBuffer;\n\nfunction isAsyncFunction(value) {\n return ObjectToString(value) === '[object AsyncFunction]';\n}\nexports.isAsyncFunction = isAsyncFunction;\n\nfunction isMapIterator(value) {\n return ObjectToString(value) === '[object Map Iterator]';\n}\nexports.isMapIterator = isMapIterator;\n\nfunction isSetIterator(value) {\n return ObjectToString(value) === '[object Set Iterator]';\n}\nexports.isSetIterator = isSetIterator;\n\nfunction isGeneratorObject(value) {\n return ObjectToString(value) === '[object Generator]';\n}\nexports.isGeneratorObject = isGeneratorObject;\n\nfunction isWebAssemblyCompiledModule(value) {\n return ObjectToString(value) === '[object WebAssembly.Module]';\n}\nexports.isWebAssemblyCompiledModule = isWebAssemblyCompiledModule;\n\nfunction isNumberObject(value) {\n return checkBoxedPrimitive(value, numberValue);\n}\nexports.isNumberObject = isNumberObject;\n\nfunction isStringObject(value) {\n return checkBoxedPrimitive(value, stringValue);\n}\nexports.isStringObject = isStringObject;\n\nfunction isBooleanObject(value) {\n return checkBoxedPrimitive(value, booleanValue);\n}\nexports.isBooleanObject = isBooleanObject;\n\nfunction isBigIntObject(value) {\n return BigIntSupported && checkBoxedPrimitive(value, bigIntValue);\n}\nexports.isBigIntObject = isBigIntObject;\n\nfunction isSymbolObject(value) {\n return SymbolSupported && checkBoxedPrimitive(value, symbolValue);\n}\nexports.isSymbolObject = isSymbolObject;\n\nfunction isBoxedPrimitive(value) {\n return (\n isNumberObject(value) ||\n isStringObject(value) ||\n isBooleanObject(value) ||\n isBigIntObject(value) ||\n isSymbolObject(value)\n );\n}\nexports.isBoxedPrimitive = isBoxedPrimitive;\n\nfunction isAnyArrayBuffer(value) {\n return typeof Uint8Array !== 'undefined' && (\n isArrayBuffer(value) ||\n isSharedArrayBuffer(value)\n );\n}\nexports.isAnyArrayBuffer = isAnyArrayBuffer;\n\n['isProxy', 'isExternal', 'isModuleNamespaceObject'].forEach(function(method) {\n Object.defineProperty(exports, method, {\n enumerable: false,\n value: function() {\n throw new Error(method + ' is not supported in userland');\n }\n });\n});\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\nvar getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors ||\n function getOwnPropertyDescriptors(obj) {\n var keys = Object.keys(obj);\n var descriptors = {};\n for (var i = 0; i < keys.length; i++) {\n descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]);\n }\n return descriptors;\n };\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n if (!isString(f)) {\n var objects = [];\n for (var i = 0; i < arguments.length; i++) {\n objects.push(inspect(arguments[i]));\n }\n return objects.join(' ');\n }\n\n var i = 1;\n var args = arguments;\n var len = args.length;\n var str = String(f).replace(formatRegExp, function(x) {\n if (x === '%%') return '%';\n if (i >= len) return x;\n switch (x) {\n case '%s': return String(args[i++]);\n case '%d': return Number(args[i++]);\n case '%j':\n try {\n return JSON.stringify(args[i++]);\n } catch (_) {\n return '[Circular]';\n }\n default:\n return x;\n }\n });\n for (var x = args[i]; i < len; x = args[++i]) {\n if (isNull(x) || !isObject(x)) {\n str += ' ' + x;\n } else {\n str += ' ' + inspect(x);\n }\n }\n return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n if (typeof process !== 'undefined' && process.noDeprecation === true) {\n return fn;\n }\n\n // Allow for deprecating things in the process of starting up.\n if (typeof process === 'undefined') {\n return function() {\n return exports.deprecate(fn, msg).apply(this, arguments);\n };\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (process.throwDeprecation) {\n throw new Error(msg);\n } else if (process.traceDeprecation) {\n console.trace(msg);\n } else {\n console.error(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnvRegex = /^$/;\n\nif (process.env.NODE_DEBUG) {\n var debugEnv = process.env.NODE_DEBUG;\n debugEnv = debugEnv.replace(/[|\\\\{}()[\\]^$+?.]/g, '\\\\$&')\n .replace(/\\*/g, '.*')\n .replace(/,/g, '$|^')\n .toUpperCase();\n debugEnvRegex = new RegExp('^' + debugEnv + '$', 'i');\n}\nexports.debuglog = function(set) {\n set = set.toUpperCase();\n if (!debugs[set]) {\n if (debugEnvRegex.test(set)) {\n var pid = process.pid;\n debugs[set] = function() {\n var msg = exports.format.apply(exports, arguments);\n console.error('%s %d: %s', set, pid, msg);\n };\n } else {\n debugs[set] = function() {};\n }\n }\n return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n // default options\n var ctx = {\n seen: [],\n stylize: stylizeNoColor\n };\n // legacy...\n if (arguments.length >= 3) ctx.depth = arguments[2];\n if (arguments.length >= 4) ctx.colors = arguments[3];\n if (isBoolean(opts)) {\n // legacy...\n ctx.showHidden = opts;\n } else if (opts) {\n // got an \"options\" object\n exports._extend(ctx, opts);\n }\n // set default options\n if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n if (isUndefined(ctx.depth)) ctx.depth = 2;\n if (isUndefined(ctx.colors)) ctx.colors = false;\n if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n if (ctx.colors) ctx.stylize = stylizeWithColor;\n return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n 'bold' : [1, 22],\n 'italic' : [3, 23],\n 'underline' : [4, 24],\n 'inverse' : [7, 27],\n 'white' : [37, 39],\n 'grey' : [90, 39],\n 'black' : [30, 39],\n 'blue' : [34, 39],\n 'cyan' : [36, 39],\n 'green' : [32, 39],\n 'magenta' : [35, 39],\n 'red' : [31, 39],\n 'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n 'special': 'cyan',\n 'number': 'yellow',\n 'boolean': 'yellow',\n 'undefined': 'grey',\n 'null': 'bold',\n 'string': 'green',\n 'date': 'magenta',\n // \"name\": intentionally not styling\n 'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n var style = inspect.styles[styleType];\n\n if (style) {\n return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n '\\u001b[' + inspect.colors[style][1] + 'm';\n } else {\n return str;\n }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n return str;\n}\n\n\nfunction arrayToHash(array) {\n var hash = {};\n\n array.forEach(function(val, idx) {\n hash[val] = true;\n });\n\n return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n // Provide a hook for user-specified inspect functions.\n // Check that value is an object with an inspect function on it\n if (ctx.customInspect &&\n value &&\n isFunction(value.inspect) &&\n // Filter out the util module, it's inspect function is special\n value.inspect !== exports.inspect &&\n // Also filter out any prototype objects using the circular check.\n !(value.constructor && value.constructor.prototype === value)) {\n var ret = value.inspect(recurseTimes, ctx);\n if (!isString(ret)) {\n ret = formatValue(ctx, ret, recurseTimes);\n }\n return ret;\n }\n\n // Primitive types cannot have properties\n var primitive = formatPrimitive(ctx, value);\n if (primitive) {\n return primitive;\n }\n\n // Look up the keys of the object.\n var keys = Object.keys(value);\n var visibleKeys = arrayToHash(keys);\n\n if (ctx.showHidden) {\n keys = Object.getOwnPropertyNames(value);\n }\n\n // IE doesn't make error fields non-enumerable\n // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n if (isError(value)\n && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n return formatError(value);\n }\n\n // Some type of object without properties can be shortcutted.\n if (keys.length === 0) {\n if (isFunction(value)) {\n var name = value.name ? ': ' + value.name : '';\n return ctx.stylize('[Function' + name + ']', 'special');\n }\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n }\n if (isDate(value)) {\n return ctx.stylize(Date.prototype.toString.call(value), 'date');\n }\n if (isError(value)) {\n return formatError(value);\n }\n }\n\n var base = '', array = false, braces = ['{', '}'];\n\n // Make Array say that they are Array\n if (isArray(value)) {\n array = true;\n braces = ['[', ']'];\n }\n\n // Make functions say that they are functions\n if (isFunction(value)) {\n var n = value.name ? ': ' + value.name : '';\n base = ' [Function' + n + ']';\n }\n\n // Make RegExps say that they are RegExps\n if (isRegExp(value)) {\n base = ' ' + RegExp.prototype.toString.call(value);\n }\n\n // Make dates with properties first say the date\n if (isDate(value)) {\n base = ' ' + Date.prototype.toUTCString.call(value);\n }\n\n // Make error with message first say the error\n if (isError(value)) {\n base = ' ' + formatError(value);\n }\n\n if (keys.length === 0 && (!array || value.length == 0)) {\n return braces[0] + base + braces[1];\n }\n\n if (recurseTimes < 0) {\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n } else {\n return ctx.stylize('[Object]', 'special');\n }\n }\n\n ctx.seen.push(value);\n\n var output;\n if (array) {\n output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n } else {\n output = keys.map(function(key) {\n return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n });\n }\n\n ctx.seen.pop();\n\n return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n if (isUndefined(value))\n return ctx.stylize('undefined', 'undefined');\n if (isString(value)) {\n var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n .replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"') + '\\'';\n return ctx.stylize(simple, 'string');\n }\n if (isNumber(value))\n return ctx.stylize('' + value, 'number');\n if (isBoolean(value))\n return ctx.stylize('' + value, 'boolean');\n // For some reason typeof null is \"object\", so special case here.\n if (isNull(value))\n return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n var output = [];\n for (var i = 0, l = value.length; i < l; ++i) {\n if (hasOwnProperty(value, String(i))) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n String(i), true));\n } else {\n output.push('');\n }\n }\n keys.forEach(function(key) {\n if (!key.match(/^\\d+$/)) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n key, true));\n }\n });\n return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n var name, str, desc;\n desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n if (desc.get) {\n if (desc.set) {\n str = ctx.stylize('[Getter/Setter]', 'special');\n } else {\n str = ctx.stylize('[Getter]', 'special');\n }\n } else {\n if (desc.set) {\n str = ctx.stylize('[Setter]', 'special');\n }\n }\n if (!hasOwnProperty(visibleKeys, key)) {\n name = '[' + key + ']';\n }\n if (!str) {\n if (ctx.seen.indexOf(desc.value) < 0) {\n if (isNull(recurseTimes)) {\n str = formatValue(ctx, desc.value, null);\n } else {\n str = formatValue(ctx, desc.value, recurseTimes - 1);\n }\n if (str.indexOf('\\n') > -1) {\n if (array) {\n str = str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n').substr(2);\n } else {\n str = '\\n' + str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n');\n }\n }\n } else {\n str = ctx.stylize('[Circular]', 'special');\n }\n }\n if (isUndefined(name)) {\n if (array && key.match(/^\\d+$/)) {\n return str;\n }\n name = JSON.stringify('' + key);\n if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n name = name.substr(1, name.length - 2);\n name = ctx.stylize(name, 'name');\n } else {\n name = name.replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"')\n .replace(/(^\"|\"$)/g, \"'\");\n name = ctx.stylize(name, 'string');\n }\n }\n\n return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n var numLinesEst = 0;\n var length = output.reduce(function(prev, cur) {\n numLinesEst++;\n if (cur.indexOf('\\n') >= 0) numLinesEst++;\n return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n }, 0);\n\n if (length > 60) {\n return braces[0] +\n (base === '' ? '' : base + '\\n ') +\n ' ' +\n output.join(',\\n ') +\n ' ' +\n braces[1];\n }\n\n return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nexports.types = require('./support/types');\n\nfunction isArray(ar) {\n return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\nexports.types.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\nexports.types.isDate = isDate;\n\nfunction isError(e) {\n return isObject(e) &&\n (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\nexports.types.isNativeError = isError;\n\nfunction isFunction(arg) {\n return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n return arg === null ||\n typeof arg === 'boolean' ||\n typeof arg === 'number' ||\n typeof arg === 'string' ||\n typeof arg === 'symbol' || // ES6 symbol\n typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n 'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n var d = new Date();\n var time = [pad(d.getHours()),\n pad(d.getMinutes()),\n pad(d.getSeconds())].join(':');\n return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n * prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n // Don't do anything if add isn't an object\n if (!add || !isObject(add)) return origin;\n\n var keys = Object.keys(add);\n var i = keys.length;\n while (i--) {\n origin[keys[i]] = add[keys[i]];\n }\n return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nvar kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined;\n\nexports.promisify = function promisify(original) {\n if (typeof original !== 'function')\n throw new TypeError('The \"original\" argument must be of type Function');\n\n if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) {\n var fn = original[kCustomPromisifiedSymbol];\n if (typeof fn !== 'function') {\n throw new TypeError('The \"util.promisify.custom\" argument must be of type Function');\n }\n Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n value: fn, enumerable: false, writable: false, configurable: true\n });\n return fn;\n }\n\n function fn() {\n var promiseResolve, promiseReject;\n var promise = new Promise(function (resolve, reject) {\n promiseResolve = resolve;\n promiseReject = reject;\n });\n\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args.push(arguments[i]);\n }\n args.push(function (err, value) {\n if (err) {\n promiseReject(err);\n } else {\n promiseResolve(value);\n }\n });\n\n try {\n original.apply(this, args);\n } catch (err) {\n promiseReject(err);\n }\n\n return promise;\n }\n\n Object.setPrototypeOf(fn, Object.getPrototypeOf(original));\n\n if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n value: fn, enumerable: false, writable: false, configurable: true\n });\n return Object.defineProperties(\n fn,\n getOwnPropertyDescriptors(original)\n );\n}\n\nexports.promisify.custom = kCustomPromisifiedSymbol\n\nfunction callbackifyOnRejected(reason, cb) {\n // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M).\n // Because `null` is a special error value in callbacks which means \"no error\n // occurred\", we error-wrap so the callback consumer can distinguish between\n // \"the promise rejected with null\" or \"the promise fulfilled with undefined\".\n if (!reason) {\n var newReason = new Error('Promise was rejected with a falsy value');\n newReason.reason = reason;\n reason = newReason;\n }\n return cb(reason);\n}\n\nfunction callbackify(original) {\n if (typeof original !== 'function') {\n throw new TypeError('The \"original\" argument must be of type Function');\n }\n\n // We DO NOT return the promise as it gives the user a false sense that\n // the promise is actually somehow related to the callback's execution\n // and that the callback throwing will reject the promise.\n function callbackified() {\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args.push(arguments[i]);\n }\n\n var maybeCb = args.pop();\n if (typeof maybeCb !== 'function') {\n throw new TypeError('The last argument must be of type Function');\n }\n var self = this;\n var cb = function() {\n return maybeCb.apply(self, arguments);\n };\n // In true node style we process the callback on `nextTick` with all the\n // implications (stack, `uncaughtException`, `async_hooks`)\n original.apply(this, args)\n .then(function(ret) { process.nextTick(cb.bind(null, null, ret)) },\n function(rej) { process.nextTick(callbackifyOnRejected.bind(null, rej, cb)) });\n }\n\n Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original));\n Object.defineProperties(callbackified,\n getOwnPropertyDescriptors(original));\n return callbackified;\n}\nexports.callbackify = callbackify;\n","const bs = require('binary-search')\nconst EventEmitter = require('events')\nconst mp4 = require('mp4-stream')\nconst Box = require('mp4-box-encoding')\nconst RangeSliceStream = require('range-slice-stream')\n\n// if we want to ignore more than this many bytes, request a new stream.\n// if we want to ignore fewer, just skip them.\nconst FIND_MOOV_SEEK_SIZE = 4096\n\nclass MP4Remuxer extends EventEmitter {\n constructor (file) {\n super()\n\n this._tracks = []\n this._file = file\n this._decoder = null\n this._findMoov(0)\n }\n\n _findMoov (offset) {\n if (this._decoder) {\n this._decoder.destroy()\n }\n\n let toSkip = 0\n this._decoder = mp4.decode()\n const fileStream = this._file.createReadStream({\n start: offset\n })\n fileStream.pipe(this._decoder)\n\n const boxHandler = headers => {\n if (headers.type === 'moov') {\n this._decoder.removeListener('box', boxHandler)\n this._decoder.decode(moov => {\n fileStream.destroy()\n try {\n this._processMoov(moov)\n } catch (err) {\n err.message = `Cannot parse mp4 file: ${err.message}`\n this.emit('error', err)\n }\n })\n } else if (headers.length < FIND_MOOV_SEEK_SIZE) {\n toSkip += headers.length\n this._decoder.ignore()\n } else {\n this._decoder.removeListener('box', boxHandler)\n toSkip += headers.length\n fileStream.destroy()\n this._decoder.destroy()\n this._findMoov(offset + toSkip)\n }\n }\n this._decoder.on('box', boxHandler)\n\n }\n\n _processMoov (moov) {\n const traks = moov.traks\n this._tracks = []\n this._hasVideo = false\n this._hasAudio = false\n for (let i = 0; i < traks.length; i++) {\n const trak = traks[i]\n const stbl = trak.mdia.minf.stbl\n const stsdEntry = stbl.stsd.entries[0]\n const handlerType = trak.mdia.hdlr.handlerType\n let codec\n let mime\n if (handlerType === 'vide' && stsdEntry.type === 'avc1') {\n if (this._hasVideo) {\n continue\n }\n this._hasVideo = true\n codec = 'avc1'\n if (stsdEntry.avcC) {\n codec += `.${stsdEntry.avcC.mimeCodec}`\n }\n mime = `video/mp4; codecs=\"${codec}\"`\n } else if (handlerType === 'soun' && stsdEntry.type === 'mp4a') {\n if (this._hasAudio) {\n continue\n }\n this._hasAudio = true\n codec = 'mp4a'\n if (stsdEntry.esds && stsdEntry.esds.mimeCodec) {\n codec += `.${stsdEntry.esds.mimeCodec}`\n }\n mime = `audio/mp4; codecs=\"${codec}\"`\n } else {\n continue\n }\n\n const samples = []\n let sample = 0\n\n // Chunk/position data\n let sampleInChunk = 0\n let chunk = 0\n let offsetInChunk = 0\n let sampleToChunkIndex = 0\n\n // Time data\n let dts = 0\n const decodingTimeEntry = new RunLengthIndex(stbl.stts.entries)\n let presentationOffsetEntry = null\n if (stbl.ctts) {\n presentationOffsetEntry = new RunLengthIndex(stbl.ctts.entries)\n }\n\n // Sync table index\n let syncSampleIndex = 0\n\n while (true) {\n var currChunkEntry = stbl.stsc.entries[sampleToChunkIndex]\n\n // Compute size\n const size = stbl.stsz.entries[sample]\n\n // Compute time data\n const duration = decodingTimeEntry.value.duration\n const presentationOffset = presentationOffsetEntry ? presentationOffsetEntry.value.compositionOffset : 0\n\n // Compute sync\n let sync = true\n if (stbl.stss) {\n sync = stbl.stss.entries[syncSampleIndex] === sample + 1\n }\n\n // Create new sample entry\n const chunkOffsetTable = stbl.stco || stbl.co64\n samples.push({\n size,\n duration,\n dts,\n presentationOffset,\n sync,\n offset: offsetInChunk + chunkOffsetTable.entries[chunk]\n })\n\n // Go to next sample\n sample++\n if (sample >= stbl.stsz.entries.length) {\n break\n }\n\n // Move position/chunk\n sampleInChunk++\n offsetInChunk += size\n if (sampleInChunk >= currChunkEntry.samplesPerChunk) {\n // Move to new chunk\n sampleInChunk = 0\n offsetInChunk = 0\n chunk++\n // Move sample to chunk box index\n const nextChunkEntry = stbl.stsc.entries[sampleToChunkIndex + 1]\n if (nextChunkEntry && chunk + 1 >= nextChunkEntry.firstChunk) {\n sampleToChunkIndex++\n }\n }\n\n // Move time forward\n dts += duration\n decodingTimeEntry.inc()\n presentationOffsetEntry && presentationOffsetEntry.inc()\n\n // Move sync table index\n if (sync) {\n syncSampleIndex++\n }\n }\n\n trak.mdia.mdhd.duration = 0\n trak.tkhd.duration = 0\n\n const defaultSampleDescriptionIndex = currChunkEntry.sampleDescriptionId\n\n const trackMoov = {\n type: 'moov',\n mvhd: moov.mvhd,\n traks: [{\n tkhd: trak.tkhd,\n mdia: {\n mdhd: trak.mdia.mdhd,\n hdlr: trak.mdia.hdlr,\n elng: trak.mdia.elng,\n minf: {\n vmhd: trak.mdia.minf.vmhd,\n smhd: trak.mdia.minf.smhd,\n dinf: trak.mdia.minf.dinf,\n stbl: {\n stsd: stbl.stsd,\n stts: empty(),\n ctts: empty(),\n stsc: empty(),\n stsz: empty(),\n stco: empty(),\n stss: empty()\n }\n }\n }\n }],\n mvex: {\n mehd: {\n fragmentDuration: moov.mvhd.duration\n },\n trexs: [{\n trackId: trak.tkhd.trackId,\n defaultSampleDescriptionIndex,\n defaultSampleDuration: 0,\n defaultSampleSize: 0,\n defaultSampleFlags: 0\n }]\n }\n }\n\n this._tracks.push({\n fragmentSequence: 1,\n trackId: trak.tkhd.trackId,\n timeScale: trak.mdia.mdhd.timeScale,\n samples,\n currSample: null,\n currTime: null,\n moov: trackMoov,\n mime\n })\n }\n\n if (this._tracks.length === 0) {\n this.emit('error', new Error('no playable tracks'))\n return\n }\n\n // Must be set last since this is used above\n moov.mvhd.duration = 0\n\n this._ftyp = {\n type: 'ftyp',\n brand: 'iso5',\n brandVersion: 0,\n compatibleBrands: [\n 'iso5'\n ]\n }\n\n const ftypBuf = Box.encode(this._ftyp)\n const data = this._tracks.map(track => {\n const moovBuf = Box.encode(track.moov)\n return {\n mime: track.mime,\n init: Buffer.concat([ftypBuf, moovBuf])\n }\n })\n\n this.emit('ready', data)\n }\n\n seek (time) {\n if (!this._tracks) {\n throw new Error('Not ready yet; wait for \\'ready\\' event')\n }\n\n if (this._fileStream) {\n this._fileStream.destroy()\n this._fileStream = null\n }\n\n let startOffset = -1\n this._tracks.map((track, i) => {\n // find the keyframe before the time\n // stream from there\n if (track.outStream) {\n track.outStream.destroy()\n }\n if (track.inStream) {\n track.inStream.destroy()\n track.inStream = null\n }\n const outStream = track.outStream = mp4.encode()\n const fragment = this._generateFragment(i, time)\n if (!fragment) {\n return outStream.finalize()\n }\n\n if (startOffset === -1 || fragment.ranges[0].start < startOffset) {\n startOffset = fragment.ranges[0].start\n }\n\n const writeFragment = (frag) => {\n if (outStream.destroyed) return\n outStream.box(frag.moof, err => {\n if (err) return this.emit('error', err)\n if (outStream.destroyed) return\n const slicedStream = track.inStream.slice(frag.ranges)\n slicedStream.pipe(outStream.mediaData(frag.length, err => {\n if (err) return this.emit('error', err)\n if (outStream.destroyed) return\n const nextFrag = this._generateFragment(i)\n if (!nextFrag) {\n return outStream.finalize()\n }\n writeFragment(nextFrag)\n }))\n })\n }\n writeFragment(fragment)\n })\n\n if (startOffset >= 0) {\n const fileStream = this._fileStream = this._file.createReadStream({\n start: startOffset\n })\n\n this._tracks.forEach(track => {\n track.inStream = new RangeSliceStream(startOffset, {\n // Allow up to a 10MB offset between audio and video,\n // which should be fine for any reasonable interleaving\n // interval and bitrate\n highWaterMark: 10000000\n })\n fileStream.pipe(track.inStream)\n })\n }\n\n return this._tracks.map(track => {\n return track.outStream\n })\n }\n\n _findSampleBefore (trackInd, time) {\n const track = this._tracks[trackInd]\n const scaledTime = Math.floor(track.timeScale * time)\n let sample = bs(track.samples, scaledTime, (sample, t) => {\n const pts = sample.dts + sample.presentationOffset// - track.editShift\n return pts - t\n })\n if (sample === -1) {\n sample = 0\n } else if (sample < 0) {\n sample = -sample - 2\n }\n // sample is now the last sample with dts <= time\n // Find the preceeding sync sample\n while (!track.samples[sample].sync) {\n sample--\n }\n return sample\n }\n\n _generateFragment (track, time) {\n /*\n 1. Find correct sample\n 2. Process backward until sync sample found\n 3. Process forward until next sync sample after MIN_FRAGMENT_DURATION found\n */\n const currTrack = this._tracks[track]\n let firstSample\n if (time !== undefined) {\n firstSample = this._findSampleBefore(track, time)\n } else {\n firstSample = currTrack.currSample\n }\n\n if (firstSample >= currTrack.samples.length) { return null }\n\n const startDts = currTrack.samples[firstSample].dts\n\n let totalLen = 0\n const ranges = []\n for (var currSample = firstSample; currSample < currTrack.samples.length; currSample++) {\n const sample = currTrack.samples[currSample]\n if (sample.sync && sample.dts - startDts >= currTrack.timeScale * MIN_FRAGMENT_DURATION) {\n break // This is a reasonable place to end the fragment\n }\n\n totalLen += sample.size\n const currRange = ranges.length - 1\n if (currRange < 0 || ranges[currRange].end !== sample.offset) {\n // Push a new range\n ranges.push({\n start: sample.offset,\n end: sample.offset + sample.size\n })\n } else {\n ranges[currRange].end += sample.size\n }\n }\n\n currTrack.currSample = currSample\n\n return {\n moof: this._generateMoof(track, firstSample, currSample),\n ranges,\n length: totalLen\n }\n }\n\n _generateMoof (track, firstSample, lastSample) {\n const currTrack = this._tracks[track]\n\n const entries = []\n let trunVersion = 0\n for (let j = firstSample; j < lastSample; j++) {\n const currSample = currTrack.samples[j]\n if (currSample.presentationOffset < 0) { trunVersion = 1 }\n entries.push({\n sampleDuration: currSample.duration,\n sampleSize: currSample.size,\n sampleFlags: currSample.sync ? 0x2000000 : 0x1010000,\n sampleCompositionTimeOffset: currSample.presentationOffset\n })\n }\n\n const moof = {\n type: 'moof',\n mfhd: {\n sequenceNumber: currTrack.fragmentSequence++\n },\n trafs: [{\n tfhd: {\n flags: 0x20000, // default-base-is-moof\n trackId: currTrack.trackId\n },\n tfdt: {\n baseMediaDecodeTime: currTrack.samples[firstSample].dts\n },\n trun: {\n flags: 0xf01,\n dataOffset: 8, // The moof size has to be added to this later as well\n entries,\n version: trunVersion\n }\n }]\n }\n\n // Update the offset\n moof.trafs[0].trun.dataOffset += Box.encodingLength(moof)\n\n return moof\n }\n}\n\nclass RunLengthIndex {\n constructor (entries, countName) {\n this._entries = entries\n this._countName = countName || 'count'\n this._index = 0\n this._offset = 0\n\n this.value = this._entries[0]\n }\n\n inc () {\n this._offset++\n if (this._offset >= this._entries[this._index][this._countName]) {\n this._index++\n this._offset = 0\n }\n\n this.value = this._entries[this._index]\n }\n}\n\nfunction empty () {\n return {\n version: 0,\n flags: 0,\n entries: []\n }\n}\n\nconst MIN_FRAGMENT_DURATION = 1 // second\n\nmodule.exports = MP4Remuxer\n","const MediaElementWrapper = require('mediasource')\nconst pump = require('pump')\n\nconst MP4Remuxer = require('./mp4-remuxer')\n\nfunction VideoStream (file, mediaElem, opts = {}) {\n if (!(this instanceof VideoStream)) {\n console.warn(\"Don't invoke VideoStream without the 'new' keyword.\")\n return new VideoStream(file, mediaElem, opts)\n }\n\n this.detailedError = null\n\n this._elem = mediaElem\n this._elemWrapper = new MediaElementWrapper(mediaElem)\n this._waitingFired = false\n this._trackMeta = null\n this._file = file\n this._tracks = null\n\n if (this._elem.preload !== 'none') {\n this._createMuxer()\n }\n\n this._onError = () => {\n this.detailedError = this._elemWrapper.detailedError\n this.destroy() // don't pass err though so the user doesn't need to listen for errors\n }\n\n this._onWaiting = () => {\n this._waitingFired = true\n if (!this._muxer) {\n this._createMuxer()\n } else if (this._tracks) {\n this._pump()\n }\n }\n\n if (mediaElem.autoplay) { mediaElem.preload = 'auto' }\n mediaElem.addEventListener('waiting', this._onWaiting)\n mediaElem.addEventListener('error', this._onError)\n}\n\nVideoStream.prototype = {\n _createMuxer () {\n this._muxer = new MP4Remuxer(this._file)\n this._muxer.on('ready', data => {\n this._tracks = data.map(trackData => {\n const mediaSource = this._elemWrapper.createWriteStream(trackData.mime)\n mediaSource.on('error', err => {\n this._elemWrapper.error(err)\n })\n const track = {\n muxed: null,\n mediaSource,\n initFlushed: false,\n onInitFlushed: null\n }\n mediaSource.write(trackData.init, err => {\n track.initFlushed = true\n if (track.onInitFlushed) {\n track.onInitFlushed(err)\n }\n })\n return track\n })\n\n if (this._waitingFired || this._elem.preload === 'auto') {\n this._pump()\n }\n })\n\n this._muxer.on('error', err => {\n this._elemWrapper.error(err)\n })\n },\n _pump () {\n const muxed = this._muxer.seek(this._elem.currentTime, !this._tracks)\n\n this._tracks.forEach((track, i) => {\n const pumpTrack = () => {\n if (track.muxed) {\n track.muxed.destroy()\n track.mediaSource = this._elemWrapper.createWriteStream(track.mediaSource)\n track.mediaSource.on('error', err => {\n this._elemWrapper.error(err)\n })\n }\n track.muxed = muxed[i]\n pump(track.muxed, track.mediaSource)\n }\n if (!track.initFlushed) {\n track.onInitFlushed = err => {\n if (err) {\n this._elemWrapper.error(err)\n return\n }\n pumpTrack()\n }\n } else {\n pumpTrack()\n }\n })\n },\n destroy () {\n if (this.destroyed) {\n return\n }\n this.destroyed = true\n\n this._elem.removeEventListener('waiting', this._onWaiting)\n this._elem.removeEventListener('error', this._onError)\n\n if (this._tracks) {\n this._tracks.forEach(track => {\n if (track.muxed) {\n track.muxed.destroy()\n }\n })\n }\n\n this._elem.src = ''\n }\n}\n\nmodule.exports = VideoStream\n","/* global MediaMetadata, navNowPlaying */\r\nimport WebTorrent from 'webtorrent'\r\nimport { SubtitleParser, SubtitleStream } from 'matroska-subtitles'\r\nimport HybridChunkStore from 'hybrid-chunk-store'\r\nimport SubtitlesOctopus from './lib/subtitles-octopus.js'\r\nimport Peer from './lib/peer.js'\r\n\r\nconst units = [' B', ' KB', ' MB', ' GB', ' TB']\r\n\r\nexport default class WebTorrentPlayer extends WebTorrent {\r\n constructor (options = {}) {\r\n super(options.WebTorrentOpts)\r\n\r\n this.storeOpts = options.storeOpts || {}\r\n\r\n const scope = location.pathname.substr(0, location.pathname.lastIndexOf('/') + 1)\r\n const worker = location.origin + scope + 'sw.js' === navigator.serviceWorker?.controller?.scriptURL && navigator.serviceWorker.controller\r\n const handleWorker = worker => {\r\n const checkState = worker => {\r\n return worker.state === 'activated' && this.loadWorker(worker)\r\n }\r\n if (!checkState(worker)) {\r\n worker.addEventListener('statechange', ({ target }) => checkState(target))\r\n }\r\n }\r\n if (worker) {\r\n handleWorker(worker)\r\n } else {\r\n navigator.serviceWorker.register('sw.js', { scope }).then(reg => {\r\n handleWorker(reg.active || reg.waiting || reg.installing)\r\n }).catch(e => {\r\n if (String(e) === 'InvalidStateError: Failed to register a ServiceWorker: The document is in an invalid state.') {\r\n location.reload() // weird workaround for a weird bug\r\n } else {\r\n throw e\r\n }\r\n })\r\n }\r\n window.addEventListener('unload', () => {\r\n this.destroy()\r\n this.cleanupVideo()\r\n })\r\n\r\n this.video = options.video\r\n this.controls = options.controls || {} // object of controls\r\n // playPause, playNext, playLast, openPlaylist, toggleMute, setVolume, setProgress, selectCaptions, selectAudio, toggleTheatre, toggleFullscreen, togglePopout, forward, rewind\r\n\r\n if (this.controls.setVolume) {\r\n this.controls.setVolume.addEventListener('input', e => this.setVolume(e.target.value))\r\n this.setVolume()\r\n this.oldVolume = undefined\r\n if ('audioTracks' in HTMLVideoElement.prototype && this.controls.audioButton) {\r\n this.video.addEventListener('loadedmetadata', () => {\r\n if (this.video.audioTracks.length > 1) {\r\n this.controls.audioButton.removeAttribute('disabled')\r\n for (const track of this.video.audioTracks) {\r\n this.createRadioElement(track, 'audio')\r\n }\r\n } else {\r\n this.controls.audioButton.setAttribute('disabled', '')\r\n }\r\n })\r\n }\r\n }\r\n if (this.controls.ppToggle) {\r\n this.controls.ppToggle.addEventListener('click', () => this.playPause())\r\n this.controls.ppToggle.addEventListener('dblclick', () => this.toggleFullscreen())\r\n }\r\n\r\n if (this.controls.setProgress) {\r\n this.controls.setProgress.addEventListener('input', e => this.setProgress(e.target.value))\r\n this.controls.setProgress.addEventListener('mouseup', e => this.dragBarEnd(e.target.value))\r\n this.controls.setProgress.addEventListener('touchend', e => this.dragBarEnd(e.target.value))\r\n this.controls.setProgress.addEventListener('mousedown', e => this.dragBarStart(e.target.value))\r\n this.video.addEventListener('timeupdate', e => {\r\n if (this.immerseTimeout && document.location.hash === '#player' && !this.video.paused) this.setProgress(e.target.currentTime / e.target.duration * 100)\r\n })\r\n this.video.addEventListener('ended', () => this.setProgress(100))\r\n }\r\n\r\n this.video.addEventListener('loadedmetadata', () => this.findSubtitleFiles(this.currentFile))\r\n this.subtitleData = {\r\n fonts: [],\r\n headers: [],\r\n tracks: [],\r\n current: undefined,\r\n renderer: undefined,\r\n stream: undefined,\r\n parser: undefined,\r\n parsed: undefined,\r\n timeout: undefined,\r\n defaultHeader: `[V4+ Styles]\r\nFormat: Name, Fontname, Fontsize, PrimaryColour, SecondaryColour, OutlineColour, BackColour, Bold, Italic, Underline, StrikeOut, ScaleX, ScaleY, Spacing, Angle, BorderStyle, Outline, Shadow, Alignment, MarginL, MarginR, MarginV, Encoding\r\nStyle: Default,${options.defaultSSAStyles || 'Roboto Medium,26,&H00FFFFFF,&H000000FF,&H00020713,&H00000000,0,0,0,0,100,100,0,0,1,1.3,0,2,20,20,23,1'}\r\n[Events]\r\n\r\n`\r\n }\r\n\r\n this.completed = false\r\n this.video.addEventListener('timeupdate', () => this.checkCompletion())\r\n\r\n this.nextTimeout = undefined\r\n if (options.autoNext) this.video.addEventListener('ended', () => this.playNext())\r\n\r\n this.resolveFileMedia = options.resolveFileMedia\r\n this.currentFile = undefined\r\n this.videoFile = undefined\r\n\r\n if (this.controls.thumbnail) {\r\n this.generateThumbnails = options.generateThumbnails\r\n const thumbCanvas = document.createElement('canvas')\r\n thumbCanvas.width = options.thumbnailWidth || 150\r\n this.thumbnailData = {\r\n thumbnails: [],\r\n canvas: thumbCanvas,\r\n context: thumbCanvas.getContext('2d'),\r\n interval: undefined,\r\n video: undefined\r\n }\r\n this.video.addEventListener('loadedmetadata', () => this.initThumbnail())\r\n this.video.addEventListener('timeupdate', () => this.createThumbnail(this.video))\r\n }\r\n\r\n if (options.visibilityLossPause) {\r\n document.addEventListener('visibilitychange', () => {\r\n if (!this.video.ended) document.visibilityState === 'hidden' ? this.video.pause() : this.playPause()\r\n })\r\n }\r\n\r\n this.onDone = undefined\r\n\r\n this.destroyStore = !!options.destroyStore\r\n\r\n this.immerseTimeout = undefined\r\n this.immerseTime = options.immerseTime || 5\r\n\r\n this.playerWrapper = options.playerWrapper\r\n this.player = options.player\r\n if (this.player) {\r\n this.player.addEventListener('fullscreenchange', () => this.updateFullscreen())\r\n this.player.addEventListener('mousemove', () => requestAnimationFrame(() => this.resetImmerse()))\r\n this.player.addEventListener('touchmove', () => requestAnimationFrame(() => this.resetImmerse()))\r\n this.player.addEventListener('keypress', () => requestAnimationFrame(() => this.resetImmerse()))\r\n this.player.addEventListener('mouseleave', () => requestAnimationFrame(() => this.immersePlayer()))\r\n\r\n this.doubleTapTimeout = undefined\r\n this.player.addEventListener('touchend', e => {\r\n if (this.doubleTapTimeout) {\r\n e.preventDefault()\r\n clearTimeout(this.doubleTapTimeout)\r\n this.doubleTapTimeout = undefined\r\n this.toggleFullscreen()\r\n } else {\r\n this.doubleTapTimeout = setTimeout(() => {\r\n this.doubleTapTimeout = undefined\r\n }, 200)\r\n }\r\n })\r\n }\r\n\r\n this.bufferTimeout = undefined\r\n this.video.addEventListener('playing', () => this.hideBuffering())\r\n this.video.addEventListener('canplay', () => this.hideBuffering())\r\n this.video.addEventListener('loadeddata', () => this.hideBuffering())\r\n this.video.addEventListener('waiting', () => this.showBuffering())\r\n\r\n const handleAvailability = aval => {\r\n if (aval) {\r\n this.controls.toggleCast.removeAttribute('disabled')\r\n } else {\r\n this.controls.toggleCast.setAttribute('disabled', '')\r\n }\r\n }\r\n if ('PresentationRequest' in window) {\r\n this.presentationRequest = new PresentationRequest(['lib/cast.html'])\r\n this.presentationRequest.addEventListener('connectionavailable', e => this.initCast(e))\r\n this.presentationConnection = null\r\n navigator.presentation.defaultRequest = this.presentationRequest\r\n this.presentationRequest.getAvailability().then(aval => {\r\n aval.onchange = e => handleAvailability(e.target.value)\r\n handleAvailability(aval.value)\r\n })\r\n } else {\r\n this.controls.toggleCast.setAttribute('disabled', '')\r\n }\r\n\r\n if ('pictureInPictureEnabled' in document) {\r\n this.burnIn = options.burnIn\r\n if (this.controls.togglePopout) this.controls.togglePopout.removeAttribute('disabled')\r\n if (this.burnIn) this.video.addEventListener('enterpictureinpicture', () => { if (this.subtitleData.renderer) this.togglePopout() })\r\n } else {\r\n this.video.setAttribute('disablePictureInPicture', '')\r\n if (this.controls.togglePopout) this.controls.togglePopout.setAttribute('disabled', '')\r\n }\r\n\r\n this.seekTime = options.seekTime || 5\r\n if ('mediaSession' in navigator) {\r\n navigator.mediaSession.setActionHandler('play', () => this.playPause())\r\n navigator.mediaSession.setActionHandler('pause', () => this.playPause())\r\n navigator.mediaSession.setActionHandler('seekbackward', () => this.seek(this.seekTime))\r\n navigator.mediaSession.setActionHandler('seekforward', () => this.seek(this.seekTime))\r\n navigator.mediaSession.setActionHandler('nexttrack', () => this.playNext())\r\n if ('setPositionState' in navigator.mediaSession) this.video.addEventListener('timeupdate', () => this.updatePositionState())\r\n }\r\n\r\n this.subtitleExtensions = ['.srt', '.vtt', '.ass', '.ssa']\r\n this.videoExtensions = ['.3g2', '.3gp', '.asf', '.avi', '.dv', '.flv', '.gxf', '.m2ts', '.m4a', '.m4b', '.m4p', '.m4r', '.m4v', '.mkv', '.mov', '.mp4', '.mpd', '.mpeg', '.mpg', '.mxf', '.nut', '.ogm', '.ogv', '.swf', '.ts', '.vob', '.webm', '.wmv', '.wtv']\r\n this.videoFiles = undefined\r\n\r\n this.updateDisplay()\r\n this.offlineTorrents = JSON.parse(localStorage.getItem('offlineTorrents')) || {}\r\n // adds all offline store torrents to the client\r\n Object.values(this.offlineTorrents).forEach(torrentID => this.offlineDownload(new Blob([new Uint8Array(torrentID)])))\r\n\r\n this.streamedDownload = options.streamedDownload\r\n\r\n this.fps = 23.976\r\n this.video.addEventListener('loadedmetadata', () => {\r\n if ('requestVideoFrameCallback' in HTMLVideoElement.prototype) {\r\n this.fps = new Promise(resolve => {\r\n const resolveFps = () => {\r\n this.video.removeEventListener('timeupdate', resolveFps)\r\n if (!this.video.paused) {\r\n setTimeout(() => this.video.requestVideoFrameCallback((now, metaData) => {\r\n let duration = 0\r\n for (let index = this.video.played.length; index--;) {\r\n duration += this.video.played.end(index) - this.video.played.start(index)\r\n }\r\n const rawFPS = metaData.presentedFrames / duration\r\n if (rawFPS < 28) {\r\n resolve(23.976)\r\n } else if (rawFPS <= 35) {\r\n resolve(29.97)\r\n } else if (rawFPS <= 70) {\r\n resolve(59.94)\r\n } else {\r\n resolve(23.976) // smth went VERY wrong\r\n }\r\n }), 2000)\r\n }\r\n }\r\n this.video.addEventListener('timeupdate', resolveFps)\r\n })\r\n }\r\n })\r\n\r\n for (const [functionName, elements] of Object.entries(this.controls)) {\r\n if (this[functionName]) {\r\n if (elements.constructor === Array) {\r\n for (const element of elements) {\r\n element.addEventListener('click', e => {\r\n this[functionName](e.target.value)\r\n })\r\n }\r\n } else {\r\n elements.addEventListener('click', e => {\r\n this[functionName](e.target.value)\r\n })\r\n }\r\n }\r\n }\r\n document.addEventListener('keydown', a => {\r\n if (a.key === 'F5') {\r\n a.preventDefault()\r\n }\r\n if (location.hash === '#player') {\r\n switch (a.key) {\r\n case ' ':\r\n this.playPause()\r\n break\r\n case 'n':\r\n this.playNext()\r\n break\r\n case 'm':\r\n this.toggleMute()\r\n break\r\n case 'p':\r\n this.togglePopout()\r\n break\r\n case 't':\r\n this.toggleTheatre()\r\n break\r\n case 'c':\r\n this.captions()\r\n break\r\n case 'f':\r\n this.toggleFullscreen()\r\n break\r\n case 's':\r\n this.seek(85)\r\n break\r\n case 'ArrowLeft':\r\n this.seek(-this.seekTime)\r\n break\r\n case 'ArrowRight':\r\n this.seek(this.seekTime)\r\n break\r\n case 'ArrowUp':\r\n this.setVolume(Number(this.controls.setVolume.value) + 5)\r\n break\r\n case 'ArrowDown':\r\n this.setVolume(Number(this.controls.setVolume.value) - 5)\r\n break\r\n case 'Escape':\r\n location.hash = '#home'\r\n break\r\n }\r\n }\r\n })\r\n }\r\n\r\n async buildVideo (torrent, opts = {}) { // sets video source and creates a bunch of other media stuff\r\n // play wanted episode from opts, or the 1st episode, or 1st file [batches: plays wanted episode, single: plays the only episode, manually added: plays first or only file]\r\n this.cleanupVideo()\r\n if (opts.file) {\r\n this.currentFile = opts.file\r\n } else if (this.videoFiles.length > 1) {\r\n this.currentFile = this.videoFiles.filter(async file => await this.resolveFileMedia({ fileName: file.name }).then(FileMedia => (Number(FileMedia.episodeNumber) === Number(opts.episode || 1)) || (FileMedia === opts.media)))[0] || this.videoFiles[0]\r\n } else {\r\n this.currentFile = this.videoFiles[0]\r\n }\r\n // opts.media: mediaTitle, episodeNumber, episodeTitle, episodeThumbnail, mediaCover, name\r\n this.nowPlaying = (opts.media && (this.videoFiles.length === 1 || (opts.forceMedia && opts.file))) ? opts.media : this.resolveFileMedia ? await this.resolveFileMedia({ fileName: this.currentFile.name, method: 'SearchName' }) : undefined\r\n\r\n if (this.nowPlaying) {\r\n if (navNowPlaying) navNowPlaying.classList.remove('d-none')\r\n\r\n const episodeInfo = [this.nowPlaying.episodeNumber, this.nowPlaying.episodeTitle].filter(s => s).join(' - ')\r\n\r\n if ('mediaSession' in navigator) {\r\n navigator.mediaSession.metadata = new MediaMetadata({\r\n title: this.nowPlaying.mediaTitle || this.nowPlaying.name || 'WebTorrentPlayer',\r\n artist: 'Episode ' + episodeInfo,\r\n album: this.nowPlaying.name || 'WebTorrentPlayer',\r\n artwork: [{\r\n src: this.nowPlaying.episodeThumbnail || this.nowPlaying.mediaCover || '',\r\n sizes: '256x256',\r\n type: 'image/jpg'\r\n }]\r\n })\r\n }\r\n if (this.nowPlaying.episodeThumbnail) this.video.poster = this.nowPlaying.episodeThumbnail\r\n\r\n this.changeControlsIcon('nowPlaying', 'EP ' + episodeInfo)\r\n document.title = [this.nowPlaying.mediaTitle, episodeInfo ? 'EP ' + episodeInfo : false, this.nowPlaying.name || 'WebTorrentPlayer'].filter(s => s).join(' - ')\r\n }\r\n if (!this.currentFile.done && this.currentFile.name.endsWith('.mkv')) await this.initParser(this.currentFile)\r\n await navigator.serviceWorker.ready\r\n if (this.currentFile.done) {\r\n this.postDownload()\r\n } else {\r\n this.onDone = this.currentFile.on('done', () => {\r\n this.postDownload(true)\r\n })\r\n }\r\n this.currentFile.on('stream', ({ stream, file, req }, cb) => {\r\n if (req.destination === 'video' && file.name.endsWith('.mkv') && !this.subtitleData.parsed) {\r\n this.subtitleData.stream = new SubtitleStream(this.subtitleData.stream)\r\n this.handleSubtitleParser(this.subtitleData.stream, true)\r\n stream.pipe(this.subtitleData.stream)\r\n cb(this.subtitleData.stream)\r\n }\r\n })\r\n this.currentFile.streamTo(this.video)\r\n this.video.load()\r\n this.playVideo()\r\n\r\n if (this.controls.downloadFile) {\r\n this.currentFile.getStreamURL((_err, url) => {\r\n this.controls.downloadFile.href = url\r\n })\r\n }\r\n }\r\n\r\n cleanupVideo () { // cleans up objects, attemps to clear as much video caching as possible\r\n this.presentationConnection?.terminate()\r\n if (document.pictureInPictureElement) document.exitPictureInPicture()\r\n this.subtitleData.renderer?.destroy()\r\n this.subtitleData.parser?.destroy()\r\n this.subtitleData.stream?.destroy()\r\n this.subtitleData.fonts?.forEach(file => URL.revokeObjectURL(file)) // ideally this should clean up after its been downloaded by the sw renderer, but oh well\r\n if (this.controls.downloadFile) this.controls.downloadFile.href = ''\r\n this.currentFile = undefined\r\n this.video.poster = ''\r\n // some attemt at cache clearing\r\n this.video.pause()\r\n this.video.src = ''\r\n this.video.load()\r\n this.onDone = undefined\r\n document.title = this.nowPlaying?.name || 'WebTorrentPlayer'\r\n this.setProgress(0)\r\n // look for file and delete its store, idk how to do this\r\n Object.assign(this.subtitleData, {\r\n fonts: [],\r\n headers: [],\r\n tracks: [],\r\n current: undefined,\r\n renderer: undefined,\r\n stream: undefined,\r\n parser: undefined,\r\n parsed: undefined,\r\n timeout: undefined\r\n })\r\n\r\n if (this.controls.thumbnail) {\r\n Object.assign(this.thumbnailData, {\r\n thumbnails: [],\r\n interval: undefined,\r\n video: undefined\r\n })\r\n }\r\n this.completed = false\r\n this.changeControlsIcon('nowPlaying', '')\r\n if (this.controls.captionsButton) this.controls.captionsButton.setAttribute('disabled', '')\r\n this.changeControlsIcon('selectCaptions', '')\r\n this.changeControlsIcon('selectAudio', '')\r\n if (this.controls.openPlaylist) this.controls.openPlaylist.setAttribute('disabled', '')\r\n if (navNowPlaying) navNowPlaying.classList.add('d-none')\r\n if ('mediaSession' in navigator) navigator.mediaSession.metadata = undefined\r\n this.fps = 23.976\r\n }\r\n\r\n changeControlsIcon (type, text) {\r\n if (this.controls[type]) {\r\n if (this.controls[type].constructor === Array) {\r\n for (const element of this.controls[type]) {\r\n element.textContent = text\r\n }\r\n } else {\r\n this.controls[type].textContent = text\r\n }\r\n }\r\n }\r\n\r\n async playVideo () {\r\n try {\r\n await this.video.play()\r\n this.changeControlsIcon('playPause', 'pause')\r\n } catch (err) {\r\n this.changeControlsIcon('playPause', 'play_arrow')\r\n }\r\n }\r\n\r\n playPause () {\r\n if (this.video.paused) {\r\n this.playVideo()\r\n } else {\r\n this.changeControlsIcon('playPause', 'play_arrow')\r\n this.video.pause()\r\n }\r\n }\r\n\r\n setVolume (volume) {\r\n const level = volume === undefined ? Number(this.controls.setVolume.value) : volume\r\n this.controls.setVolume.value = level\r\n this.controls.setVolume.style.setProperty('--volume-level', level + '%')\r\n this.changeControlsIcon('toggleMute', level === 0 ? 'volume_off' : 'volume_up')\r\n this.video.volume = level / 100\r\n }\r\n\r\n toggleMute () {\r\n if (this.video.volume === 0) {\r\n this.setVolume(this.oldVolume)\r\n } else {\r\n this.oldVolume = this.video.volume * 100\r\n this.setVolume(0)\r\n }\r\n }\r\n\r\n toggleTheatre () {\r\n this.playerWrapper.classList.toggle('nav-hidden')\r\n }\r\n\r\n toggleFullscreen () {\r\n document.fullscreenElement ? document.exitFullscreen() : this.player.requestFullscreen()\r\n }\r\n\r\n updateFullscreen () {\r\n this.changeControlsIcon('toggleFullscreen', document.fullscreenElement ? 'fullscreen_exit' : 'fullscreen')\r\n }\r\n\r\n openPlaylist () {\r\n this.emit('playlist', { files: this.videoFiles })\r\n }\r\n\r\n playNext () {\r\n clearTimeout(this.nextTimeout)\r\n this.nextTimeout = setTimeout(() => {\r\n if (this.videoFiles?.indexOf(this.currentFile) < this.videoFiles?.length - 1) {\r\n const nowPlaying = this.nowPlaying\r\n nowPlaying.episodeNumber += 1\r\n const torrent = this.currentFile._torrent\r\n this.buildVideo(torrent, { media: nowPlaying, file: this.videoFiles[this.videoFiles.indexOf(this.currentFile) + 1] })\r\n } else {\r\n this.emit('next', { file: this.currentFile, filemedia: this.nowPlaying })\r\n }\r\n }, 200)\r\n }\r\n\r\n playLast () {\r\n clearTimeout(this.nextTimeout)\r\n this.nextTimeout = setTimeout(() => {\r\n if (this.videoFiles?.indexOf(this.currentFile)) {\r\n const nowPlaying = this.nowPlaying\r\n nowPlaying.episodeNumber -= 1\r\n const torrent = this.currentFile._torrent\r\n this.buildVideo(torrent, { media: nowPlaying, file: this.videoFiles[this.videoFiles.indexOf(this.currentFile) - 1] })\r\n } else {\r\n this.emit('prev', { file: this.currentFile, filemedia: this.nowPlaying })\r\n }\r\n }, 200)\r\n }\r\n\r\n toggleCast () {\r\n if (this.video.readyState) {\r\n if (this.presentationConnection) {\r\n this.presentationConnection?.terminate()\r\n } else {\r\n this.presentationRequest.start()\r\n }\r\n }\r\n }\r\n\r\n initCast (event) {\r\n let peer = new Peer({ polite: true })\r\n\r\n this.presentationConnection = event.connection\r\n this.presentationConnection.addEventListener('terminate', () => {\r\n this.presentationConnection = null\r\n this.changeControlsIcon('toggleCast', 'cast')\r\n this.player.classList.remove('pip')\r\n peer = null\r\n })\r\n\r\n peer.signalingPort.onmessage = ({ data }) => {\r\n this.presentationConnection.send(data)\r\n }\r\n\r\n this.presentationConnection.addEventListener('message', ({ data }) => {\r\n peer.signalingPort.postMessage(data)\r\n })\r\n\r\n peer.dc.onopen = async () => {\r\n await this.fps\r\n if (peer && this.presentationConnection) {\r\n this.changeControlsIcon('toggleCast', 'cast_connected')\r\n this.player.classList.add('pip')\r\n const tracks = []\r\n const videostream = this.video.captureStream(await this.fps)\r\n if (this.burnIn) {\r\n const { stream, destroy } = await this.getBurnIn(!this.subtitleData.renderer)\r\n tracks.push(stream.getVideoTracks()[0], videostream.getAudioTracks()[0])\r\n this.presentationConnection.addEventListener('terminate', destroy)\r\n } else {\r\n tracks.push(videostream.getVideoTracks()[0], videostream.getAudioTracks()[0])\r\n }\r\n for (const track of tracks) {\r\n peer.pc.addTrack(track, videostream)\r\n }\r\n this.video.play() // video pauses for some reason\r\n }\r\n }\r\n }\r\n\r\n async togglePopout () {\r\n if (this.video.readyState) {\r\n if (this.burnIn) {\r\n await this.fps\r\n if (!this.subtitleData.renderer) {\r\n this.video !== document.pictureInPictureElement ? this.video.requestPictureInPicture() : document.exitPictureInPicture()\r\n } else {\r\n if (document.pictureInPictureElement && !document.pictureInPictureElement.id) { // only exit if pip is the custom one, else overwrite existing pip with custom\r\n document.exitPictureInPicture()\r\n } else {\r\n const canvasVideo = document.createElement('video')\r\n const { stream, destroy } = await this.getBurnIn()\r\n canvasVideo.srcObject = stream\r\n canvasVideo.onloadedmetadata = () => {\r\n canvasVideo.play()\r\n canvasVideo.requestPictureInPicture().then(\r\n this.player.classList.add('pip')\r\n ).catch(e => {\r\n console.warn('Failed To Burn In Subtitles ' + e)\r\n destroy()\r\n canvasVideo.remove()\r\n this.player.classList.remove('pip')\r\n })\r\n }\r\n canvasVideo.onleavepictureinpicture = () => {\r\n destroy()\r\n canvasVideo.remove()\r\n this.player.classList.remove('pip')\r\n }\r\n }\r\n }\r\n } else {\r\n this.video !== document.pictureInPictureElement ? this.video.requestPictureInPicture() : document.exitPictureInPicture()\r\n }\r\n }\r\n }\r\n\r\n async getBurnIn (noSubs) {\r\n const canvas = document.createElement('canvas')\r\n const context = canvas.getContext('2d', { alpha: false })\r\n let running = true\r\n canvas.width = this.video.videoWidth\r\n canvas.height = this.video.videoHeight\r\n\r\n const renderFrame = () => {\r\n if (running === true) {\r\n context.drawImage(this.video, 0, 0)\r\n if (!noSubs) context.drawImage(this.subtitleData.renderer?.canvas, 0, 0, canvas.width, canvas.height)\r\n requestAnimationFrame(renderFrame)\r\n }\r\n }\r\n requestAnimationFrame(renderFrame)\r\n const destroy = () => {\r\n running = false\r\n canvas.remove()\r\n }\r\n return { stream: canvas.captureStream(await this.fps), destroy }\r\n }\r\n\r\n toTS (sec, full) {\r\n if (isNaN(sec) || sec < 0) {\r\n return full ? '0:00:00.00' : '00:00'\r\n }\r\n const hours = Math.floor(sec / 3600)\r\n let minutes = Math.floor(sec / 60) - (hours * 60)\r\n let seconds = full ? (sec % 60).toFixed(2) : Math.floor(sec % 60)\r\n if (minutes < 10) minutes = '0' + minutes\r\n if (seconds < 10) seconds = '0' + seconds\r\n return (hours > 0 || full) ? hours + ':' + minutes + ':' + seconds : minutes + ':' + seconds\r\n }\r\n\r\n prettyBytes (num) {\r\n if (isNaN(num)) return '0 B'\r\n if (num < 1) return num + ' B'\r\n const exponent = Math.min(Math.floor(Math.log(num) / Math.log(1000)), units.length - 1)\r\n return Number((num / Math.pow(1000, exponent)).toFixed(2)) + units[exponent]\r\n }\r\n\r\n getBytes (str) {\r\n const units = ['B', 'KiB', 'MiB', 'GiB', 'TiB', 'Bytes', 'KB', 'MB', 'GB', 'TB']\r\n const split = str.split(' ')\r\n return split[0] * 1024 ** (units.indexOf(split[1] || 'B') % 5) // this is so lazy\r\n }\r\n\r\n seek (time) {\r\n if (time === 85 && this.video.currentTime < 10) {\r\n this.video.currentTime = 90\r\n } else if (time === 85 && (this.video.duration - this.video.currentTime) < 90) {\r\n this.video.currentTime = this.video.duration\r\n } else {\r\n this.video.currentTime += time\r\n }\r\n this.setProgress(this.video.currentTime / this.video.duration * 100)\r\n }\r\n\r\n forward () {\r\n this.seek(this.seekTime)\r\n }\r\n\r\n rewind () {\r\n this.seek(-this.seekTime)\r\n }\r\n\r\n immersePlayer () {\r\n this.player.classList.add('immersed')\r\n this.immerseTimeout = undefined\r\n }\r\n\r\n resetImmerse () {\r\n if (this.immerseTimeout) {\r\n clearTimeout(this.immerseTimeout)\r\n } else {\r\n this.player.classList.remove('immersed')\r\n }\r\n this.immerseTimeout = setTimeout(() => this.immersePlayer(), this.immerseTime * 1000)\r\n }\r\n\r\n hideBuffering () {\r\n if (this.bufferTimeout) {\r\n clearTimeout(this.bufferTimeout)\r\n this.bufferTimeout = undefined\r\n this.player.classList.remove('buffering')\r\n }\r\n }\r\n\r\n showBuffering () {\r\n this.bufferTimeout = setTimeout(() => {\r\n this.player.classList.add('buffering')\r\n this.resetImmerse()\r\n }, 150)\r\n }\r\n\r\n checkCompletion () {\r\n if (!this.completed && this.video.duration - 180 < this.video.currentTime) {\r\n this.completed = true\r\n this.emit('watched', { file: this.currentFile, filemedia: this.nowPlaying })\r\n }\r\n }\r\n\r\n updatePositionState () {\r\n if (this.video.duration) {\r\n navigator.mediaSession.setPositionState({\r\n duration: this.video.duration || 0,\r\n playbackRate: this.video.playbackRate || 0,\r\n position: this.video.currentTime || 0\r\n })\r\n }\r\n }\r\n\r\n initThumbnail () {\r\n const height = this.thumbnailData.canvas.width / (this.video.videoWidth / this.video.videoHeight)\r\n this.thumbnailData.interval = this.video.duration / 300 < 5 ? 5 : this.video.duration / 300\r\n this.thumbnailData.canvas.height = height\r\n this.controls.thumbnail.style.setProperty('height', height + 'px')\r\n }\r\n\r\n createThumbnail (video) {\r\n if (video?.readyState >= 2) {\r\n const index = Math.floor(video.currentTime / this.thumbnailData.interval)\r\n if (!this.thumbnailData.thumbnails[index]) {\r\n this.thumbnailData.context.fillRect(0, 0, 150, this.thumbnailData.canvas.height)\r\n this.thumbnailData.context.drawImage(video, 0, 0, 150, this.thumbnailData.canvas.height)\r\n this.thumbnailData.thumbnails[index] = this.thumbnailData.canvas.toDataURL('image/jpeg')\r\n }\r\n }\r\n }\r\n\r\n finishThumbnails (src) {\r\n const t0 = performance.now()\r\n const video = document.createElement('video')\r\n let index = 0\r\n video.preload = 'none'\r\n video.volume = 0\r\n video.playbackRate = 0\r\n video.addEventListener('loadeddata', () => loadTime())\r\n video.addEventListener('canplay', () => {\r\n this.createThumbnail(this.thumbnailData.video)\r\n loadTime()\r\n })\r\n this.thumbnailData.video = video\r\n const loadTime = () => {\r\n while (this.thumbnailData.thumbnails[index] && index <= Math.floor(this.thumbnailData.video.duration / this.thumbnailData.interval)) { // only create thumbnails that are missing\r\n index++\r\n }\r\n if (this.thumbnailData.video?.currentTime !== this.thumbnailData.video?.duration) {\r\n this.thumbnailData.video.currentTime = index * this.thumbnailData.interval\r\n } else {\r\n this.thumbnailData.video?.removeAttribute('src')\r\n this.thumbnailData.video?.load()\r\n this.thumbnailData.video?.remove()\r\n delete this.thumbnailData.video\r\n console.log('Thumbnail creating finished', index, this.toTS((performance.now() - t0) / 1000))\r\n }\r\n index++\r\n }\r\n this.thumbnailData.video.src = src\r\n this.thumbnailData.video.play()\r\n console.log('Thumbnail creating started')\r\n }\r\n\r\n dragBarEnd (progressPercent) {\r\n this.video.currentTime = this.video.duration * progressPercent / 100 || 0\r\n this.playVideo()\r\n }\r\n\r\n dragBarStart (progressPercent) {\r\n this.video.pause()\r\n this.setProgress(progressPercent)\r\n }\r\n\r\n setProgress (progressPercent) {\r\n progressPercent = progressPercent || 0\r\n const currentTime = this.video.duration * progressPercent / 100 || 0\r\n if (this.controls.progressWrapper) this.controls.progressWrapper.style.setProperty('--progress', progressPercent + '%')\r\n if (this.controls.thumbnail) this.controls.thumbnail.src = this.thumbnailData.thumbnails[Math.floor(currentTime / this.thumbnailData.interval)] || ' '\r\n if (this.controls.setProgress) {\r\n this.controls.setProgress.dataset.elapsed = this.toTS(currentTime)\r\n this.controls.setProgress.value = progressPercent\r\n }\r\n if (this.controls.progressWrapper) {\r\n this.controls.progressWrapper.dataset.elapsed = this.toTS(currentTime)\r\n this.controls.progressWrapper.dataset.remaining = this.toTS(this.video.duration - currentTime)\r\n }\r\n }\r\n\r\n updateDisplay () {\r\n if (this.currentFile && this.currentFile._torrent) {\r\n if (this.player) this.player.style.setProperty('--download', this.currentFile.progress * 100 + '%')\r\n if (this.controls.peers) this.controls.peers.dataset.value = this.currentFile._torrent.numPeers\r\n if (this.controls.downSpeed) this.controls.downSpeed.dataset.value = this.prettyBytes(this.currentFile._torrent.downloadSpeed) + '/s'\r\n if (this.controls.upSpeed) this.controls.upSpeed.dataset.value = this.prettyBytes(this.currentFile._torrent.uploadSpeed) + '/s'\r\n }\r\n setTimeout(() => requestAnimationFrame(() => this.updateDisplay()), 200)\r\n }\r\n\r\n createRadioElement (track, type) {\r\n // type: captions audio\r\n if ((type === 'captions' && this.controls.selectCaptions && this.controls.captionsButton) || (type === 'audio' && this.controls.selectAudio)) {\r\n const frag = document.createDocumentFragment()\r\n const input = document.createElement('input')\r\n const label = document.createElement('label')\r\n input.name = `${type}-radio-set`\r\n input.type = 'radio'\r\n input.id = type === 'captions' ? `${type}-${track ? track.number : 'off'}-radio` : `${type}-${track.id}-radio`\r\n input.value = type === 'captions' ? track ? track.number : -1 : track.id\r\n input.checked = type === 'captions' ? track?.number === this.subtitleData.current : track.enabled\r\n label.htmlFor = type === 'captions' ? `${type}-${track ? track.number : 'off'}-radio` : `${type}-${track.id}-radio`\r\n label.textContent = track\r\n ? type === 'captions'\r\n ? (track.language || (!Object.values(this.subtitleData.headers).some(header => header.language === 'eng' || header.language === 'en') ? 'eng' : track.type)) + (track.name ? ' - ' + track.name : '')\r\n : (track.language || (!Object.values(this.video.audioTracks).some(track => track.language === 'eng' || track.language === 'en') ? 'eng' : track.label)) + (track.label ? ' - ' + track.label : '')\r\n : 'OFF' // TODO: clean this up, TLDR assume english track if track lang is undefined || 'und' and there isnt an existing eng track already\r\n frag.append(input)\r\n frag.append(label)\r\n if (type === 'captions') {\r\n this.controls.selectCaptions.append(frag)\r\n this.controls.captionsButton.removeAttribute('disabled')\r\n } else {\r\n this.controls.selectAudio.append(frag)\r\n }\r\n }\r\n }\r\n\r\n selectAudio (id) {\r\n if (id !== undefined) {\r\n for (const track of this.video.audioTracks) {\r\n track.enabled = track.id === id\r\n }\r\n this.seek(-0.5) // stupid fix because video freezes up when chaging tracks\r\n }\r\n }\r\n\r\n selectCaptions (trackNumber) {\r\n if (trackNumber !== undefined) {\r\n trackNumber = Number(trackNumber)\r\n this.subtitleData.current = trackNumber\r\n if (!this.subtitleData.timeout) {\r\n this.subtitleData.timeout = setTimeout(() => {\r\n this.subtitleData.timeout = undefined\r\n if (this.subtitleData.renderer) {\r\n this.subtitleData.renderer.setTrack(trackNumber !== -1 ? this.subtitleData.headers[trackNumber].header.slice(0, -1) + Array.from(this.subtitleData.tracks[trackNumber]).join('\\n') : this.subtitleData.defaultHeader)\r\n }\r\n }, 1000)\r\n }\r\n }\r\n }\r\n\r\n constructSub (subtitle, isNotAss) {\r\n if (isNotAss === true) { // converts VTT or other to SSA\r\n const matches = subtitle.text.match(/<[^>]+>/g) // create array of all tags\r\n if (matches) {\r\n matches.forEach(match => {\r\n if (/<\\//.test(match)) { // check if its a closing tag\r\n subtitle.text = subtitle.text.replace(match, match.replace('', '0}'))\r\n } else {\r\n subtitle.text = subtitle.text.replace(match, match.replace('<', '{\\\\').replace('>', '1}'))\r\n }\r\n })\r\n }\r\n // replace all html special tags with normal ones\r\n subtitle.text.replace(/&/g, '&').replace(/</g, '<').replace(/>/g, '>').replace(/ /g, '\\\\h')\r\n }\r\n return 'Dialogue: ' +\r\n (subtitle.layer || 0) + ',' +\r\n this.toTS(subtitle.time / 1000, true) + ',' +\r\n this.toTS((subtitle.time + subtitle.duration) / 1000, true) + ',' +\r\n (subtitle.style || 'Default') + ',' +\r\n (subtitle.name || '') + ',' +\r\n (subtitle.marginL || '0') + ',' +\r\n (subtitle.marginR || '0') + ',' +\r\n (subtitle.marginV || '0') + ',' +\r\n (subtitle.effect || '') + ',' +\r\n subtitle.text || ''\r\n }\r\n\r\n parseSubtitles (file, skipFiles) { // parse subtitles fully after a download is finished\r\n return new Promise((resolve) => {\r\n if (file.name.endsWith('.mkv')) {\r\n let parser = new SubtitleParser()\r\n this.handleSubtitleParser(parser, skipFiles)\r\n parser.on('finish', () => {\r\n console.log('Sub parsing finished', this.toTS((performance.now() - t0) / 1000))\r\n this.subtitleData.parsed = true\r\n this.subtitleData.stream?.destroy()\r\n this.subtitleData.stream = undefined\r\n this.subtitleData.parser.destroy()\r\n this.subtitleData.parser = undefined\r\n this.selectCaptions(this.subtitleData.current)\r\n parser = undefined\r\n if (!this.video.paused) {\r\n this.video.pause()\r\n this.playVideo()\r\n }\r\n resolve()\r\n })\r\n const t0 = performance.now()\r\n console.log('Sub parsing started')\r\n this.subtitleData.parser = file.createReadStream().pipe(parser)\r\n } else {\r\n resolve()\r\n }\r\n })\r\n }\r\n\r\n initParser (file) {\r\n return new Promise(resolve => {\r\n this.subtitleData.stream = new SubtitleParser()\r\n this.handleSubtitleParser(this.subtitleData.stream)\r\n this.subtitleData.stream.once('tracks', tracks => {\r\n if (!tracks.length) {\r\n this.subtitleData.parsed = true\r\n resolve()\r\n this.subtitleData.stream.destroy()\r\n fileStreamStream.destroy()\r\n }\r\n })\r\n this.subtitleData.stream.once('subtitle', () => {\r\n resolve()\r\n fileStreamStream.destroy()\r\n })\r\n const fileStreamStream = file.createReadStream()\r\n fileStreamStream.pipe(this.subtitleData.stream)\r\n })\r\n }\r\n\r\n handleSubtitleParser (parser, skipFile) {\r\n parser.once('tracks', tracks => {\r\n if (!tracks.length) {\r\n this.subtitleData.parsed = true\r\n } else {\r\n tracks.forEach(track => {\r\n if (!this.subtitleData.tracks[track.number]) {\r\n // overwrite webvtt or other header with custom one\r\n if (track.type !== 'ass') track.header = this.subtitleData.defaultHeader\r\n if (!this.subtitleData.current) {\r\n this.subtitleData.current = track.number\r\n this.createRadioElement(undefined, 'captions')\r\n }\r\n this.subtitleData.tracks[track.number] = new Set()\r\n this.subtitleData.headers[track.number] = track\r\n this.createRadioElement(track, 'captions')\r\n }\r\n })\r\n }\r\n })\r\n parser.on('subtitle', (subtitle, trackNumber) => {\r\n if (!this.subtitleData.parsed) {\r\n if (!this.subtitleData.renderer) this.initSubtitleRenderer()\r\n this.subtitleData.tracks[trackNumber].add(this.constructSub(subtitle, this.subtitleData.headers[trackNumber].type !== 'ass'))\r\n if (this.subtitleData.current === trackNumber) this.selectCaptions(trackNumber)\r\n }\r\n })\r\n if (!skipFile) {\r\n parser.on('file', file => {\r\n if (file.mimetype === 'application/x-truetype-font' || file.mimetype === 'application/font-woff' || file.mimetype === 'application/vnd.ms-opentype') {\r\n this.subtitleData.fonts.push(URL.createObjectURL(new Blob([file.data], { type: file.mimetype })))\r\n }\r\n })\r\n }\r\n }\r\n\r\n async initSubtitleRenderer () {\r\n if (!this.subtitleData.renderer) {\r\n const options = {\r\n video: this.video,\r\n targetFps: await this.fps,\r\n subContent: this.subtitleData.headers[this.subtitleData.current].header.slice(0, -1),\r\n renderMode: 'offscreen',\r\n fonts: this.subtitleData.fonts,\r\n fallbackFont: 'https://fonts.gstatic.com/s/roboto/v20/KFOlCnqEu92Fr1MmEU9fBBc4.woff2',\r\n workerUrl: 'lib/subtitles-octopus-worker.js',\r\n onReady: () => { // weird hack for laggy subtitles, this is some issue in SO\r\n if (!this.video.paused) {\r\n this.video.pause()\r\n this.playVideo()\r\n }\r\n }\r\n }\r\n if (!this.subtitleData.renderer) {\r\n this.subtitleData.renderer = new SubtitlesOctopus(options)\r\n this.selectCaptions(this.subtitleData.current)\r\n }\r\n }\r\n }\r\n\r\n convertSubFile (file, isAss, callback) {\r\n const regex = /(?:\\d+\\n)?(\\S{9,12})\\s?-->\\s?(\\S{9,12})(.*)\\n([\\s\\S]*)$/i\r\n file.getBuffer((_err, buffer) => {\r\n const subtitles = isAss ? buffer.toString() : []\r\n if (isAss) {\r\n callback(subtitles)\r\n } else {\r\n const text = buffer.toString().replace(/\\r/g, '')\r\n for (const split of text.split('\\n\\n')) {\r\n const match = split.match(regex)\r\n if (match) {\r\n match[1] = match[1].match(/.*[.,]\\d{2}/)[0]\r\n match[2] = match[2].match(/.*[.,]\\d{2}/)[0]\r\n if (match[1].length === 9) {\r\n match[1] = '0:' + match[1]\r\n } else {\r\n if (match[1][0] === '0') {\r\n match[1] = match[1].substring(1)\r\n }\r\n }\r\n match[1].replace(',', '.')\r\n if (match[2].length === 9) {\r\n match[2] = '0:' + match[2]\r\n } else {\r\n if (match[2][0] === '0') {\r\n match[2] = match[2].substring(1)\r\n }\r\n }\r\n match[2].replace(',', '.')\r\n const matches = match[4].match(/<[^>]+>/g) // create array of all tags\r\n if (matches) {\r\n matches.forEach(matched => {\r\n if (/<\\//.test(matched)) { // check if its a closing tag\r\n match[4] = match[4].replace(matched, matched.replace('', '0}'))\r\n } else {\r\n match[4] = match[4].replace(matched, matched.replace('<', '{\\\\').replace('>', '1}'))\r\n }\r\n })\r\n }\r\n subtitles.push('Dialogue: 0,' + match[1].replace(',', '.') + ',' + match[2].replace(',', '.') + ',Default,,0,0,0,,' + match[4])\r\n }\r\n }\r\n callback(subtitles)\r\n }\r\n })\r\n }\r\n\r\n findSubtitleFiles (targetFile) {\r\n const path = targetFile.path.split(targetFile.name)[0]\r\n // array of subtitle files that match video name, or all subtitle files when only 1 vid file\r\n const subtitleFiles = targetFile._torrent.files.filter(file => {\r\n return this.subtitleExtensions.some(ext => file.name.endsWith(ext)) && (this.videoFiles.length === 1 ? true : file.path.split(path).length === 2)\r\n })\r\n if (subtitleFiles.length) {\r\n this.createRadioElement(undefined, 'captions')\r\n this.subtitleData.parsed = true\r\n this.subtitleData.current = 0\r\n for (const [index, file] of subtitleFiles.entries()) {\r\n const isAss = file.name.endsWith('.ass') || file.name.endsWith('.ssa')\r\n const extension = /\\.(\\w+)$/\r\n const name = file.name.replace(targetFile.name, '') === file.name\r\n ? file.name.replace(targetFile.name.replace(extension, ''), '').slice(0, -4).replace(/[,._-]/g, ' ').trim()\r\n : file.name.replace(targetFile.name, '').slice(0, -4).replace(/[,._-]/g, ' ').trim()\r\n const header = {\r\n header: this.subtitleData.defaultHeader,\r\n language: name,\r\n number: index,\r\n type: file.name.match(extension)[1]\r\n }\r\n this.subtitleData.headers.push(header)\r\n this.subtitleData.tracks[index] = []\r\n this.createRadioElement(header, 'captions')\r\n this.convertSubFile(file, isAss, subtitles => {\r\n if (isAss) {\r\n this.subtitleData.headers[index].header = subtitles\r\n } else {\r\n this.subtitleData.tracks[index] = subtitles\r\n }\r\n if (this.subtitleData.current === index) this.selectCaptions(this.subtitleData.current)\r\n })\r\n this.initSubtitleRenderer()\r\n }\r\n }\r\n }\r\n\r\n postDownload (skipFiles) {\r\n this.emit('download-done', { file: this.currentFile })\r\n this.parseSubtitles(this.currentFile, skipFiles).then(() => {\r\n if (this.generateThumbnails) {\r\n this.finishThumbnails(this.video.src)\r\n }\r\n })\r\n }\r\n\r\n playTorrent (torrentID, opts = {}) { // TODO: clean this up\r\n const handleTorrent = (torrent, opts) => {\r\n torrent.on('noPeers', () => {\r\n this.emit('no-peers', torrent)\r\n })\r\n if (this.streamedDownload) {\r\n torrent.files.forEach(file => file.deselect())\r\n torrent.deselect(0, torrent.pieces.length - 1, false)\r\n }\r\n this.videoFiles = torrent.files.filter(file => this.videoExtensions.some(ext => file.name.endsWith(ext)))\r\n this.emit('video-files', { files: this.videoFiles, torrent: torrent })\r\n if (this.videoFiles.length > 1) {\r\n torrent.files.forEach(file => file.deselect())\r\n }\r\n if (this.videoFiles) {\r\n this.buildVideo(torrent, opts)\r\n } else {\r\n this.emit('no-file', torrent)\r\n this.cleanupTorrents()\r\n }\r\n }\r\n document.location.hash = '#player'\r\n this.cleanupVideo()\r\n this.cleanupTorrents()\r\n if (torrentID instanceof Object) {\r\n handleTorrent(torrentID, opts)\r\n } else if (this.get(torrentID)) {\r\n handleTorrent(this.get(torrentID), opts)\r\n } else {\r\n this.add(torrentID, {\r\n destroyStoreOnDestroy: this.destroyStore,\r\n storeOpts: this.storeOpts,\r\n storeCacheSlots: 0,\r\n store: HybridChunkStore,\r\n announce: this.tracker.announce || [\r\n 'wss://tracker.openwebtorrent.com',\r\n 'wss://spacetradersapi-chatbox.herokuapp.com:443/announce',\r\n 'wss://peertube.cpy.re:443/tracker/socket'\r\n ]\r\n }, torrent => {\r\n handleTorrent(torrent, opts)\r\n })\r\n }\r\n }\r\n\r\n // cleanup torrent and store\r\n cleanupTorrents () {\r\n // creates an array of all non-offline store torrents and removes them\r\n this.torrents.filter(torrent => !this.offlineTorrents[torrent.infoHash]).forEach(torrent => torrent.destroy())\r\n }\r\n\r\n // add torrent for offline download\r\n offlineDownload (torrentID) {\r\n const torrent = this.add(torrentID, {\r\n storeOpts: this.storeOpts,\r\n store: HybridChunkStore,\r\n storeCacheSlots: 0,\r\n announce: this.tracker.announce || [\r\n 'wss://tracker.openwebtorrent.com',\r\n 'wss://spacetradersapi-chatbox.herokuapp.com:443/announce',\r\n 'wss://peertube.cpy.re:443/tracker/socket'\r\n ]\r\n })\r\n torrent.on('metadata', () => {\r\n if (!this.offlineTorrents[torrent.infoHash]) {\r\n this.offlineTorrents[torrent.infoHash] = Array.from(torrent.torrentFile)\r\n localStorage.setItem('offlineTorrents', JSON.stringify(this.offlineTorrents))\r\n }\r\n this.emit('offline-torrent', torrent)\r\n })\r\n }\r\n}\r\n","function waitToCompleteIceGathering (pc, state = pc.iceGatheringState) {\n return state !== 'complete' && new Promise(resolve => {\n pc.addEventListener('icegatheringstatechange', () => (pc.iceGatheringState === 'complete') && resolve())\n })\n}\n\n/**\n * @typedef {AddEventListenerOptions} Test~options\n * @property {AbortSignal} signal - funkis?\n */\n\nexport default class Peer {\n /**\n * @param {{\n * polite: boolean,\n * trickle: boolean,\n * iceServers: RTCIceServer[]\n * signal: AbortSignal\n * }} [options]\n */\n constructor (options = {}) {\n let { polite = true, trickle = true } = options\n\n let { port1, port2 } = new MessageChannel()\n let send = msg => port2.postMessage(JSON.stringify(msg))\n\n const pc = new RTCPeerConnection({\n iceServers: options?.iceServers || [{\n urls: [\n 'stun:stun.l.google.com:19302',\n 'stun:global.stun.twilio.com:3478'\n ]\n }]\n })\n\n const ctrl = new AbortController()\n\n /** @type {any} dummy alias for AbortSignal to make TS happy */\n const signal = { signal: ctrl.signal }\n\n pc.addEventListener('iceconnectionstatechange', () => {\n if (\n pc.iceConnectionState === 'disconnected' ||\n pc.iceConnectionState === 'failed'\n ) {\n ctrl.abort()\n }\n }, signal)\n\n const dc = pc.createDataChannel('both', { negotiated: true, id: 0 })\n\n this.pc = pc\n this.dc = dc\n this.signal = ctrl.signal\n this.polite = polite\n this.signalingPort = port1\n\n this.ready = new Promise(resolve => {\n dc.addEventListener('open', () => {\n // At this point we start to trickle over datachannel instead\n // we also close the message channel as we do not need it anymore\n trickle = true\n send = (msg) => dc.send(JSON.stringify(msg))\n port1.close()\n port2.close()\n this.ready = port2 = port1 = port2.onmessage = null\n resolve()\n }, { once: true, ...signal })\n })\n\n pc.addEventListener('icecandidate', ({ candidate }) => {\n trickle && send({ candidate })\n }, { ...signal })\n\n // The rest is the polite peer negotiation logic, copied from this blog\n\n let makingOffer = false; let ignoreOffer = false\n\n pc.addEventListener('negotiationneeded', async () => {\n makingOffer = true\n const offer = await pc.createOffer()\n if (pc.signalingState !== 'stable') return\n await pc.setLocalDescription(offer)\n makingOffer = false\n if (trickle) {\n send({ description: pc.localDescription })\n } else {\n await waitToCompleteIceGathering(pc)\n const description = pc.localDescription.toJSON()\n description.sdp = description.sdp.replace(/a=ice-options:trickle\\s\\n/g, '')\n send({ description })\n }\n }, { ...signal })\n\n async function onmessage ({ data }) {\n const { description, candidate } = typeof data === 'string' ? JSON.parse(data) : data\n\n if (description) {\n const offerCollision = description.type === 'offer' &&\n (makingOffer || pc.signalingState !== 'stable')\n\n ignoreOffer = !this.polite && offerCollision\n if (ignoreOffer) {\n return\n }\n\n if (offerCollision) {\n await Promise.all([\n pc.setLocalDescription({ type: 'rollback' }),\n pc.setRemoteDescription(description)\n ])\n } else {\n try {\n (description.type === 'answer' && pc.signalingState === 'stable') ||\n await pc.setRemoteDescription(description)\n } catch (err) { }\n }\n if (description.type === 'offer') {\n await pc.setLocalDescription(await pc.createAnswer())\n // Edge didn't set the state to 'new' after calling the above :[\n if (!trickle) await waitToCompleteIceGathering(pc, 'new')\n send({ description: pc.localDescription })\n }\n } else if (candidate) {\n await pc.addIceCandidate(candidate)\n }\n }\n\n port2.onmessage = onmessage.bind(this)\n dc.addEventListener('message', onmessage.bind(this), { ...signal })\n }\n}\nwindow.Peer = Peer\n","/*\r\n author: Daodor, libass\r\n license: MIT\r\n\r\n re-written by: ThaUnknown_\r\n license: GPL3\r\n*/\r\nclass SubtitlesOctopus {\r\n constructor (options = {}) {\r\n if (!window.Worker) {\r\n this.workerError('worker not supported')\r\n return\r\n }\r\n // opts\r\n this.canvas = options.canvas // HTML canvas element (optional if video specified)\r\n\r\n // choose best render mode based on browser support\r\n this.renderMode = options.renderMode || 'offscreen'\r\n if (this.renderMode !== 'blend' && this.renderMode !== 'normal') {\r\n if (typeof createImageBitmap === 'undefined') {\r\n this.renderMode = 'normal'\r\n } else if (typeof OffscreenCanvas !== 'undefined') {\r\n this.renderMode = 'offscreen'\r\n }\r\n }\r\n\r\n // play with those when you need some speed, e.g. for slow devices\r\n this.targetFps = options.targetFps || 23.976\r\n this.prescaleTradeoff = options.prescaleTradeoff || null // render subtitles less than viewport when less than 1.0 to improve speed, render to more than 1.0 to improve quality; set to null to disable scaling\r\n this.softHeightLimit = options.softHeightLimit || 1080 // don't apply prescaleTradeoff < 1 when viewport height is less that this limit\r\n this.hardHeightLimit = options.hardHeightLimit || 2160 // don't ever go above this limit\r\n this.resizeVariation = options.resizeVariation || 0.2 // by how many a size can vary before it would cause clearance of prerendered buffer\r\n\r\n this.video = options.video // HTML video element (optional if canvas specified)\r\n this.canvasParent = null // (internal) HTML canvas parent element\r\n this.onReadyEvent = options.onReady // Function called when SubtitlesOctopus is ready (optional)\r\n this.onErrorEvent = options.onError // Function called in case of critical error meaning sub wouldn't be shown and you should use alternative method (for instance it occurs if browser doesn't support web workers).\r\n this.debug = !!options.debug // When debug enabled, some performance info printed in console.\r\n this.lastRenderTime = 0 // (internal) Last time we got some frame from worker\r\n\r\n this.timeOffset = options.timeOffset || 0 // Time offset would be applied to currentTime from video (option)\r\n\r\n this.renderedItems = [] // used to store items rendered ahead when renderAhead > 0\r\n // how many MiB to render ahead and store; 0 to disable (approximate)\r\n this.renderAhead = (options.renderAhead || 0) * 1024 * 1024 * 0.9 // try to eat less than requested\r\n this.oneshotState = {\r\n eventStart: null,\r\n eventOver: false,\r\n iteration: 0,\r\n renderRequested: false,\r\n requestNextTimestamp: -1,\r\n prevWidth: null,\r\n prevHeight: null\r\n }\r\n\r\n this.renderFrameData = null\r\n this.workerActive = false\r\n this.frameId = 0\r\n this.workerActive = false\r\n\r\n // init worker\r\n if (!this.worker) {\r\n this.worker = new Worker(options.workerUrl || 'subtitles-octopus-worker.js')\r\n this.worker.onmessage = event => this.onWorkerMessage(event)\r\n this.worker.onerror = event => this.workerError(event)\r\n }\r\n\r\n this.createCanvas()\r\n this.setVideo(options.video)\r\n this.worker.postMessage({\r\n target: 'worker-init',\r\n width: this.canvas.width,\r\n height: this.canvas.height,\r\n URL: document.URL,\r\n currentScript: options.workerUrl || 'subtitles-octopus-worker.js', // Link to WebAssembly worker\r\n preMain: true,\r\n renderMode: this.renderMode,\r\n subUrl: options.subUrl, // Link to sub file (optional if subContent specified)\r\n subContent: options.subContent || null, // Sub content (optional if subUrl specified)\r\n fallbackFont: options.fallbackFont || null, // Override fallback font, for example, with a CJK one. Default fallback font is Liberation Sans\r\n lazyFontLoading: options.lazyFontLoading || false, // Load fonts in a lazy way. Requires Access-Control-Expose-Headers for Accept-Ranges, Content-Length, and Content-Encoding. If Content-Encoding is compressed, file will be fully fetched instead of just a HEAD request.\r\n fonts: options.fonts || [], // Array with links to fonts used in sub (optional)\r\n availableFonts: options.availableFonts || [], // Object with all available fonts (optional). Key is font name in lower case, value is link: {\"arial\": \"/font1.ttf\"}\r\n debug: this.debug,\r\n targetFps: this.targetFps,\r\n libassMemoryLimit: options.libassMemoryLimit || 0, // set libass bitmap cache memory limit in MiB (approximate)\r\n libassGlyphLimit: options.libassGlyphLimit || 0, // set libass glyph cache memory limit in MiB (approximate)\r\n renderOnDemand: this.renderAhead > 0,\r\n dropAllAnimations: !!options.dropAllAnimations\r\n })\r\n if (this.renderMode === 'offscreen') this.pushOffscreenCanvas()\r\n this.initDone = true\r\n\r\n // test ImageData constructor\r\n ;(() => {\r\n if (typeof ImageData.prototype.constructor === 'function') {\r\n try {\r\n // try actually calling ImageData, as on some browsers it's reported\r\n // as existing but calling it errors out as \"TypeError: Illegal constructor\"\r\n return new ImageData(new Uint8ClampedArray([0, 0, 0, 0]), 1, 1)\r\n } catch (e) {\r\n console.log('detected that ImageData is not constructable despite browser saying so')\r\n }\r\n }\r\n\r\n const canvas = document.createElement('canvas')\r\n const ctx = canvas.getContext('2d')\r\n\r\n window.ImageData = () => {\r\n let i = 0\r\n let data\r\n if (arguments[0] instanceof Uint8ClampedArray) data = arguments[i++]\r\n const width = arguments[i++]\r\n const height = arguments[i]\r\n\r\n const imageData = ctx.createImageData(width, height)\r\n if (data) imageData.data.set(data)\r\n return imageData\r\n }\r\n })()\r\n\r\n // test alpha bug\r\n if (this.renderMode !== 'offscreen') {\r\n this.ctx = this.canvas.getContext('2d')\r\n this.bufferCanvas = document.createElement('canvas')\r\n this.bufferCanvasCtx = this.bufferCanvas.getContext('2d')\r\n\r\n // test for alpha bug, where e.g. WebKit can render a transparent pixel\r\n // (with alpha == 0) as non-black which then leads to visual artifacts\r\n this.bufferCanvas.width = 1\r\n this.bufferCanvas.height = 1\r\n const testBuf = new Uint8ClampedArray([0, 255, 0, 0])\r\n const testImage = new ImageData(testBuf, 1, 1)\r\n this.bufferCanvasCtx.clearRect(0, 0, 1, 1)\r\n this.ctx.clearRect(0, 0, 1, 1)\r\n const prePut = this.ctx.getImageData(0, 0, 1, 1).data\r\n this.bufferCanvasCtx.putImageData(testImage, 0, 0)\r\n this.ctx.drawImage(this.bufferCanvas, 0, 0)\r\n const postPut = this.ctx.getImageData(0, 0, 1, 1).data\r\n this.hasAlphaBug = prePut[1] !== postPut[1]\r\n if (this.hasAlphaBug) console.log('Detected a browser having issue with transparent pixels, applying workaround')\r\n }\r\n }\r\n\r\n workerError (error) {\r\n console.error('Worker error: ', error)\r\n if (this.onErrorEvent) this.onErrorEvent(error)\r\n if (!this.debug) {\r\n this.dispose()\r\n throw new Error('Worker error: ' + error)\r\n }\r\n }\r\n\r\n pushOffscreenCanvas () {\r\n const canvasControl = this.canvas.transferControlToOffscreen()\r\n this.worker.postMessage({\r\n target: 'offscreenCanvas',\r\n canvas: canvasControl\r\n }, [canvasControl])\r\n }\r\n\r\n createCanvas () {\r\n if (this.video) {\r\n this.canvas = document.createElement('canvas')\r\n this.canvas.className = 'subtitles-octopus-canvas'\r\n this.canvas.style.display = 'none'\r\n\r\n this.canvasParent = document.createElement('div')\r\n this.canvasParent.className = 'subtitles-octopus-canvas-parent'\r\n this.canvasParent.appendChild(this.canvas)\r\n\r\n if (this.video.nextSibling) {\r\n this.video.parentNode.insertBefore(this.canvasParent, this.video.nextSibling)\r\n } else {\r\n this.video.parentNode.appendChild(this.canvasParent)\r\n }\r\n } else {\r\n if (!this.canvas) {\r\n this.workerError('Don\\'t know where to render: you should give video or canvas in options.')\r\n }\r\n }\r\n }\r\n\r\n setVideo (video) {\r\n this.video = video\r\n if (this.video) {\r\n let state = this.video.paused\r\n const timeupdate = playing => {\r\n if (playing != null) state = playing\r\n this.setCurrentTime(this.video.paused || state, video.currentTime + this.timeOffset)\r\n }\r\n this.video.addEventListener('timeupdate', () => timeupdate(), false)\r\n this.video.addEventListener('progress', () => timeupdate(), false)\r\n\r\n this.video.addEventListener('waiting', () => timeupdate(true), false)\r\n this.video.addEventListener('pause', () => timeupdate(true), false)\r\n this.video.addEventListener('seeking', () => timeupdate(true), false)\r\n\r\n this.video.addEventListener('playing', () => timeupdate(false), false)\r\n\r\n this.video.addEventListener('seeked', () => {\r\n timeupdate(false)\r\n if (this.renderAhead > 0) {\r\n this._cleanPastRendered(this.video.currentTime + this.timeOffset, true)\r\n }\r\n }, false)\r\n\r\n this.video.addEventListener('ratechange', this.setRate.bind(this), false)\r\n\r\n // Support Element Resize Observer\r\n if (typeof ResizeObserver !== 'undefined') {\r\n this.ro = new ResizeObserver(this.resize.bind(this, 0, 0, 0, 0))\r\n this.ro.observe(this.video)\r\n }\r\n\r\n if (this.video.videoWidth > 0) {\r\n this.resize()\r\n } else {\r\n this.video.addEventListener('loadedmetadata', this.resize.bind(this, 0, 0, 0, 0), false)\r\n }\r\n }\r\n }\r\n\r\n getVideoPosition () {\r\n const videoRatio = this.video.videoWidth / this.video.videoHeight\r\n const { offsetWidth, offsetHeight } = this.video\r\n const elementRatio = offsetWidth / offsetHeight\r\n let width = offsetWidth\r\n let height = offsetHeight\r\n if (elementRatio > videoRatio) {\r\n width = Math.floor(offsetHeight * videoRatio)\r\n } else {\r\n height = Math.floor(offsetWidth / videoRatio)\r\n }\r\n\r\n const x = (offsetWidth - width) / 2\r\n const y = (offsetHeight - height) / 2\r\n\r\n return { width, height, x, y }\r\n }\r\n\r\n _cleanPastRendered (currentTime, seekClean) {\r\n let retainedItems = []\r\n for (const item of this.renderedItems) {\r\n if (item.emptyFinish < 0 || item.emptyFinish >= currentTime) {\r\n // item is not yet finished, retain it\r\n retainedItems.push(item)\r\n }\r\n }\r\n\r\n if (seekClean && retainedItems.length > 0) {\r\n // items are ordered by event start time when we push to this.renderedItems,\r\n // so first item is the earliest\r\n if (currentTime < retainedItems[0].eventStart) {\r\n if (retainedItems[0].eventStart - currentTime > 60) {\r\n console.info('seeked back too far, cleaning prerender buffer')\r\n retainedItems = []\r\n } else {\r\n console.info('seeked backwards, need to free up some buffer')\r\n let size = 0; const limit = this.renderAhead * 0.3 /* try to take no more than 1/3 of buffer */\r\n const retain = []\r\n for (const item of retainedItems) {\r\n size += item.size\r\n if (size >= limit) break\r\n retain.push(item)\r\n }\r\n retainedItems = retain\r\n }\r\n }\r\n }\r\n\r\n const removed = retainedItems.length < this.renderedItems\r\n this.renderedItems = retainedItems\r\n return removed\r\n }\r\n\r\n // Oneshot stuff\r\n processOneshot (data) {\r\n if (data.iteration !== this.oneshotState.iteration) {\r\n console.debug('received stale prerender, ignoring')\r\n return\r\n }\r\n\r\n if (this.debug) {\r\n console.info('oneshot received (start=' +\r\n data.eventStart + ', empty=' + data.emptyFinish +\r\n '), render: ' + Math.round(data.spentTime) + ' ms')\r\n }\r\n this.oneshotState.renderRequested = false\r\n if (Math.abs(data.lastRenderedTime - this.oneshotState.requestNextTimestamp) < 0.01) {\r\n this.oneshotState.requestNextTimestamp = -1\r\n }\r\n if (data.eventStart - data.lastRenderedTime > 0.01) {\r\n // generate bogus empty element, so all timeline is covered anyway\r\n this.renderedItems.push({\r\n eventStart: data.lastRenderedTime,\r\n eventFinish: data.lastRenderedTime - 0.001,\r\n emptyFinish: data.eventStart,\r\n viewport: data.viewport,\r\n spentTime: 0,\r\n blendTime: 0,\r\n items: [],\r\n animated: false,\r\n size: 0\r\n })\r\n }\r\n\r\n const items = []\r\n let size = 0\r\n for (const item of data.canvases) {\r\n items.push({\r\n ...item,\r\n image: new ImageData(new Uint8ClampedArray(item.buffer), item.w, item.h)\r\n })\r\n size += item.buffer.byteLength\r\n }\r\n\r\n let eventSplitted = false\r\n if ((data.emptyFinish > 0 && data.emptyFinish - data.eventStart < 1.0 / this.targetFps) || data.animated) {\r\n const newFinish = data.eventStart + 1.0 / this.targetFps\r\n data.emptyFinish = newFinish\r\n data.eventFinish = newFinish\r\n eventSplitted = true\r\n }\r\n this.renderedItems.push({\r\n ...data,\r\n items: items,\r\n size: size\r\n })\r\n\r\n this.renderedItems.sort((a, b) => a.eventStart - b.eventStart)\r\n\r\n if (this.oneshotState.requestNextTimestamp >= 0) {\r\n // requesting an out of order event render\r\n this.tryRequestOneshot(this.oneshotState.requestNextTimestamp, true)\r\n } else if (data.eventStart < 0) {\r\n console.info('oneshot received \"end of frames\" event')\r\n } else if (data.emptyFinish >= 0) {\r\n // there's some more event to render, try requesting next event\r\n this.tryRequestOneshot(data.emptyFinish, eventSplitted)\r\n } else {\r\n console.info('there are no more events to prerender')\r\n }\r\n }\r\n\r\n tryRequestOneshot (currentTime, renderNow) {\r\n if (!this.renderAhead || this.renderAhead <= 0) return\r\n if (this.oneshotState.renderRequested && !renderNow) return\r\n\r\n if (typeof currentTime === 'undefined') {\r\n if (!this.video) return\r\n currentTime = this.video.currentTime + this.timeOffset\r\n }\r\n\r\n let size = 0\r\n for (const item of this.renderedItems) {\r\n if (item.emptyFinish < 0) {\r\n console.info('oneshot already reached end-of-events')\r\n return\r\n }\r\n if (currentTime >= item.eventStart && currentTime < item.emptyFinish) {\r\n // an event for requested time already exists\r\n console.debug('not requesting a render for ' + currentTime +\r\n ' as event already covering it exists (start=' +\r\n item.eventStart + ', empty=' + item.emptyFinish + ')')\r\n return\r\n }\r\n size += item.size\r\n }\r\n\r\n if (size <= this.renderAhead) {\r\n const lastRendered = currentTime - (renderNow ? 0 : 0.001)\r\n if (!this.oneshotState.renderRequested) {\r\n this.oneshotState.renderRequested = true\r\n this.worker.postMessage({\r\n target: 'oneshot-render',\r\n lastRendered: lastRendered,\r\n renderNow: renderNow,\r\n iteration: this.oneshotState.iteration\r\n })\r\n } else {\r\n if (this.workerActive) console.info('worker busy, requesting to seek')\r\n this.oneshotState.requestNextTimestamp = lastRendered\r\n }\r\n }\r\n }\r\n\r\n _renderSubtitleEvent (event, currentTime) {\r\n const eventOver = event.eventFinish < currentTime\r\n if (this.oneshotState.eventStart === event.eventStart && this.oneshotState.eventOver === eventOver) return\r\n this.oneshotState.eventStart = event.eventStart\r\n this.oneshotState.eventOver = eventOver\r\n\r\n const beforeDrawTime = performance.now()\r\n if (event.viewport.width !== this.canvas.width || event.viewport.height !== this.canvas.height) {\r\n this.canvas.width = event.viewport.width\r\n this.canvas.height = event.viewport.height\r\n }\r\n this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height)\r\n if (!eventOver) {\r\n for (const image of event.items) {\r\n this.bufferCanvas.width = image.w\r\n this.bufferCanvas.height = image.h\r\n this.bufferCanvasCtx.putImageData(image.image, 0, 0)\r\n this.ctx.drawImage(this.bufferCanvas, image.x, image.y)\r\n }\r\n }\r\n if (this.debug) {\r\n const drawTime = Math.round(performance.now() - beforeDrawTime)\r\n console.log('render: ' + Math.round(event.spentTime - event.blendTime) + ' ms, blend: ' + Math.round(event.blendTime) + ' ms, draw: ' + drawTime + ' ms')\r\n }\r\n }\r\n\r\n oneshotRender () {\r\n window.requestAnimationFrame(this.oneshotRender)\r\n if (!this.video) return\r\n\r\n const currentTime = this.video.currentTime + this.timeOffset\r\n let finishTime = -1; let eventShown = false; let animated = false\r\n for (const item of this.renderedItems) {\r\n if (!eventShown && item.eventStart <= currentTime && (item.emptyFinish < 0 || item.emptyFinish > currentTime)) {\r\n this._renderSubtitleEvent(item, currentTime)\r\n eventShown = true\r\n finishTime = item.emptyFinish\r\n } else if (finishTime >= 0) {\r\n // we've already found a known event, now find\r\n // the farthest point of consequent events\r\n // NOTE: this.renderedItems may have gaps due to seeking\r\n if (item.eventStart - finishTime < 0.01) {\r\n finishTime = item.emptyFinish\r\n animated = item.animated\r\n } else {\r\n break\r\n }\r\n }\r\n }\r\n\r\n if (!eventShown) {\r\n if (Math.abs(this.oneshotState.requestNextTimestamp - currentTime) > 0.01) {\r\n this._cleanPastRendered(currentTime)\r\n this.tryRequestOneshot(currentTime, true)\r\n }\r\n } else if (this._cleanPastRendered(currentTime) && finishTime >= 0) {\r\n this.tryRequestOneshot(finishTime, animated)\r\n }\r\n }\r\n\r\n resetRenderAheadCache (isResizing) {\r\n if (this.renderAhead > 0) {\r\n const newCache = []\r\n if (isResizing && this.oneshotState.prevHeight && this.oneshotState.prevWidth) {\r\n if (this.oneshotState.prevHeight === this.canvas.height && this.oneshotState.prevWidth === this.canvas.width) return\r\n let timeLimit = 10; let sizeLimit = this.renderAhead * 0.3\r\n if (this.canvas.height >= this.oneshotState.prevHeight * (1.0 - this.resizeVariation) &&\r\n this.canvas.height <= this.oneshotState.prevHeight * (1.0 + this.resizeVariation) &&\r\n this.canvas.width >= this.oneshotState.prevWidth * (1.0 - this.resizeVariation) &&\r\n this.canvas.width <= this.oneshotState.prevWidth * (1.0 + this.resizeVariation)) {\r\n console.debug('viewport changes are small, leaving more of prerendered buffer')\r\n timeLimit = 30\r\n sizeLimit = this.renderAhead * 0.5\r\n }\r\n const stopTime = this.video.currentTime + this.timeOffset + timeLimit\r\n let size = 0\r\n for (const item of this.renderedItems) {\r\n if (item.emptyFinish < 0 || item.emptyFinish >= stopTime) break\r\n size += item.size\r\n if (size >= sizeLimit) break\r\n newCache.push(item)\r\n }\r\n }\r\n\r\n console.info('resetting prerender cache')\r\n this.renderedItems = newCache\r\n this.oneshotState.eventStart = null\r\n this.oneshotState.iteration++\r\n this.oneshotState.renderRequested = false\r\n this.oneshotState.prevHeight = this.canvas.height\r\n this.oneshotState.prevWidth = this.canvas.width\r\n\r\n window.requestAnimationFrame(this.oneshotRender)\r\n this.tryRequestOneshot(undefined, true)\r\n }\r\n }\r\n\r\n // Rendering\r\n renderFrames (data) {\r\n const beforeDrawTime = performance.now()\r\n this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height)\r\n for (const image of data.canvases) {\r\n this.bufferCanvas.width = image.w\r\n this.bufferCanvas.height = image.h\r\n const imageBuffer = new Uint8ClampedArray(image.buffer)\r\n if (this.hasAlphaBug) {\r\n for (let j = 3; j < imageBuffer.length; j += 4) {\r\n imageBuffer[j] = (imageBuffer[j] >= 1) ? imageBuffer[j] : 1\r\n }\r\n }\r\n const imageData = new ImageData(imageBuffer, image.w, image.h)\r\n this.bufferCanvasCtx.putImageData(imageData, 0, 0)\r\n this.ctx.drawImage(this.bufferCanvas, image.x, image.y)\r\n }\r\n if (this.debug) {\r\n const drawTime = performance.now() - beforeDrawTime\r\n const blendTime = data.blendTime\r\n if (typeof blendTime !== 'undefined') {\r\n console.log('render: ' + Math.round(data.spentTime - blendTime) + ' ms, blend: ' + Math.round(blendTime) + ' ms, draw: ' + drawTime + ' ms; TOTAL=' + Math.round(data.spentTime + drawTime) + ' ms')\r\n } else {\r\n console.log({ length: data.canvases.length, sum: data.libassTime + data.decodeTime + drawTime, libassTime: data.libassTime, decodeTime: data.decodeTime, drawTime })\r\n }\r\n this.renderStart = performance.now()\r\n }\r\n }\r\n\r\n renderFastFrames (data) {\r\n const beforeDrawTime = performance.now()\r\n this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height)\r\n for (const image of data.bitmaps) {\r\n this.ctx.drawImage(image.bitmap, image.x, image.y)\r\n }\r\n if (this.debug) {\r\n const drawTime = performance.now() - beforeDrawTime\r\n console.log({ length: data.bitmaps.length, sum: data.libassTime + data.decodeTime + drawTime, libassTime: data.libassTime, decodeTime: data.decodeTime, drawTime })\r\n this.renderStart = performance.now()\r\n }\r\n }\r\n\r\n _computeCanvasSize (width, height) {\r\n if (this.prescaleTradeoff === null) {\r\n if (height > this.hardHeightLimit) {\r\n width = width * this.hardHeightLimit / height\r\n height = this.hardHeightLimit\r\n }\r\n } else if (this.prescaleTradeoff > 1) {\r\n if (height * this.prescaleTradeoff <= this.softHeightLimit) {\r\n width *= this.prescaleTradeoff\r\n height *= this.prescaleTradeoff\r\n } else if (height < this.softHeightLimit) {\r\n width = width * this.softHeightLimit / height\r\n height = this.softHeightLimit\r\n } else if (height >= this.hardHeightLimit) {\r\n width = width * this.hardHeightLimit / height\r\n height = this.hardHeightLimit\r\n }\r\n } else if (height >= this.softHeightLimit) {\r\n if (height * this.prescaleTradeoff <= this.softHeightLimit) {\r\n width = width * this.softHeightLimit / height\r\n height = this.softHeightLimit\r\n } else if (height * this.prescaleTradeoff <= this.hardHeightLimit) {\r\n width *= this.prescaleTradeoff\r\n height *= this.prescaleTradeoff\r\n } else {\r\n width = width * this.hardHeightLimit / height\r\n height = this.hardHeightLimit\r\n }\r\n }\r\n\r\n return { width, height }\r\n }\r\n\r\n resize (width = 0, height = 0, top = 0, left = 0) {\r\n let videoSize = null\r\n if ((!width || !height) && this.video) {\r\n videoSize = this.getVideoPosition()\r\n const newsize = this._computeCanvasSize(videoSize.width * (window.devicePixelRatio || 1), videoSize.height * (window.devicePixelRatio || 1))\r\n width = newsize.width\r\n height = newsize.height\r\n const offset = this.canvasParent.getBoundingClientRect().top - this.video.getBoundingClientRect().top\r\n top = videoSize.y - offset\r\n left = videoSize.x\r\n }\r\n\r\n if (this.canvas.style.top !== top || this.canvas.style.left !== left) {\r\n if (videoSize != null) {\r\n this.canvasParent.style.position = 'relative'\r\n this.canvas.style.display = 'block'\r\n this.canvas.style.position = 'absolute'\r\n this.canvas.style.top = top + 'px'\r\n this.canvas.style.left = left + 'px'\r\n this.canvas.style.pointerEvents = 'none'\r\n this.canvas.style.width = videoSize.width + 'px'\r\n this.canvas.style.height = videoSize.height + 'px'\r\n }\r\n if (!(this.canvas.width === width && this.canvas.height === height)) {\r\n // only re-paint if dimensions actually changed\r\n if (this.renderMode === 'offscreen' && this.initDone) {\r\n this.canvasParent.remove()\r\n this.canvasParent = undefined\r\n this.createCanvas()\r\n }\r\n // dont spam re-paints like crazy when re-sizing with animations, but still update instantly without them\r\n if (this.resizeTimeoutBuffer) {\r\n clearTimeout(this.resizeTimeoutBuffer)\r\n this.resizeTimeoutBuffer = setTimeout(() => {\r\n this.resizeTimeoutBuffer = undefined\r\n this.rePaint(width, height, top, left, videoSize)\r\n }, 50)\r\n } else {\r\n this.rePaint(width, height, top, left, videoSize)\r\n this.resizeTimeoutBuffer = setTimeout(() => {\r\n this.resizeTimeoutBuffer = undefined\r\n }, 50)\r\n }\r\n }\r\n }\r\n }\r\n\r\n rePaint (width = 0, height = 0, top = 0, left = 0, videoSize) {\r\n if (this.renderMode === 'offscreen' && this.canvasParent && this.initDone) {\r\n this.canvasParent.remove()\r\n this.canvasParent = undefined\r\n this.createCanvas()\r\n }\r\n this.canvas.width = width\r\n this.canvas.height = height\r\n\r\n if (videoSize != null) {\r\n this.canvasParent.style.position = 'relative'\r\n this.canvas.style.display = 'block'\r\n this.canvas.style.position = 'absolute'\r\n this.canvas.style.top = top + 'px'\r\n this.canvas.style.left = left + 'px'\r\n this.canvas.style.pointerEvents = 'none'\r\n this.canvas.style.width = videoSize.width + 'px'\r\n this.canvas.style.height = videoSize.height + 'px'\r\n }\r\n\r\n if (this.renderMode === 'offscreen' && this.initDone) {\r\n this.pushOffscreenCanvas()\r\n }\r\n this.worker.postMessage({\r\n target: 'canvas',\r\n width: this.canvas.width,\r\n height: this.canvas.height\r\n })\r\n this.resetRenderAheadCache(true)\r\n }\r\n\r\n onWorkerMessage (event) {\r\n if (!this.workerActive) {\r\n this.workerActive = true\r\n if (this.onReadyEvent) {\r\n this.onReadyEvent()\r\n }\r\n }\r\n const data = event.data\r\n switch (data.target) {\r\n case 'stdout': {\r\n console.log(data.content)\r\n break\r\n }\r\n case 'stderr': {\r\n console.error(data.content)\r\n break\r\n }\r\n case 'canvas': {\r\n switch (data.op) {\r\n case 'renderCanvas': {\r\n if (this.lastRenderTime < data.time) {\r\n this.lastRenderTime = data.time\r\n window.requestAnimationFrame(this.renderFrames.bind(this, data))\r\n }\r\n break\r\n }\r\n case 'renderFastCanvas': {\r\n if (this.lastRenderTime < data.time) {\r\n this.lastRenderTime = data.time\r\n window.requestAnimationFrame(this.renderFastFrames.bind(this, data))\r\n }\r\n break\r\n }\r\n case 'oneshot-result': {\r\n this.processOneshot(data)\r\n break\r\n }\r\n default:\r\n throw data.target\r\n }\r\n break\r\n }\r\n case 'tick': {\r\n this.frameId = data.id\r\n this.worker.postMessage({\r\n target: 'tock',\r\n id: this.frameId\r\n })\r\n break\r\n }\r\n case 'custom': {\r\n if (this.onCustomMessage) {\r\n this.onCustomMessage(event)\r\n } else {\r\n console.error('Custom message received but client onCustomMessage not implemented.')\r\n }\r\n break\r\n }\r\n case 'ready': {\r\n break\r\n }\r\n default:\r\n console.log(data)\r\n break\r\n }\r\n }\r\n\r\n runBenchmark () {\r\n this.worker.postMessage({\r\n target: 'runBenchmark'\r\n })\r\n }\r\n\r\n customMessage (data, options = {}) {\r\n this.worker.postMessage({\r\n target: 'custom',\r\n userData: data,\r\n preMain: options.preMain\r\n })\r\n }\r\n\r\n setCurrentTime (isPaused, currentTime) {\r\n this.worker.postMessage({\r\n target: 'video',\r\n isPaused: isPaused,\r\n currentTime: currentTime\r\n })\r\n }\r\n\r\n setTrackByUrl (url) {\r\n this.worker.postMessage({\r\n target: 'set-track-by-url',\r\n url: url\r\n })\r\n this.resetRenderAheadCache(false)\r\n }\r\n\r\n setTrack (content) {\r\n this.worker.postMessage({\r\n target: 'set-track',\r\n content: content\r\n })\r\n this.resetRenderAheadCache(false)\r\n }\r\n\r\n freeTrack () {\r\n this.worker.postMessage({\r\n target: 'free-track'\r\n })\r\n this.resetRenderAheadCache(false)\r\n }\r\n\r\n setRate () {\r\n this.worker.postMessage({\r\n target: 'video',\r\n rate: this.video.playbackRate\r\n })\r\n }\r\n\r\n destroy () {\r\n this.worker.postMessage({\r\n target: 'destroy'\r\n })\r\n\r\n this.worker.terminate()\r\n this.workerActive = false\r\n // Remove the canvas element to remove residual subtitles rendered on player\r\n if (this.video) this.video.parentNode.removeChild(this.canvasParent)\r\n }\r\n\r\n createEvent (event) {\r\n this.worker.postMessage({\r\n target: 'create-event',\r\n event: event\r\n })\r\n }\r\n\r\n getEvents () {\r\n this.worker.postMessage({\r\n target: 'get-events'\r\n })\r\n }\r\n\r\n setEvent (event, index) {\r\n this.worker.postMessage({\r\n target: 'set-event',\r\n event: event,\r\n index: index\r\n })\r\n }\r\n\r\n removeEvent (index) {\r\n this.worker.postMessage({\r\n target: 'remove-event',\r\n index: index\r\n })\r\n }\r\n\r\n createStyle (style) {\r\n this.worker.postMessage({\r\n target: 'create-style',\r\n style: style\r\n })\r\n }\r\n\r\n getStyles () {\r\n this.worker.postMessage({\r\n target: 'get-styles'\r\n })\r\n }\r\n\r\n setStyle (style, index) {\r\n this.worker.postMessage({\r\n target: 'set-style',\r\n style: style,\r\n index: index\r\n })\r\n }\r\n\r\n removeStyle (index) {\r\n this.worker.postMessage({\r\n target: 'remove-style',\r\n index: index\r\n })\r\n }\r\n}\r\n\r\nif (typeof module !== 'undefined') {\r\n module.exports = SubtitlesOctopus\r\n}\r\n","/*! webtorrent. MIT License. WebTorrent LLC */\n/* global FileList, ServiceWorker */\n/* eslint-env browser */\n\nconst { EventEmitter } = require('events')\nconst concat = require('simple-concat')\nconst createTorrent = require('create-torrent')\nconst debug = require('debug')('webtorrent')\nconst DHT = require('bittorrent-dht/client') // browser exclude\nconst loadIPSet = require('load-ip-set') // browser exclude\nconst parallel = require('run-parallel')\nconst parseTorrent = require('parse-torrent')\nconst path = require('path')\nconst Peer = require('simple-peer')\nconst queueMicrotask = require('queue-microtask')\nconst randombytes = require('randombytes')\nconst sha1 = require('simple-sha1')\nconst speedometer = require('speedometer')\nconst { ThrottleGroup } = require('speed-limiter')\n\nconst ConnPool = require('./lib/conn-pool') // browser exclude\nconst Torrent = require('./lib/torrent')\nconst VERSION = require('./package.json').version\n\n/**\n * Version number in Azureus-style. Generated from major and minor semver version.\n * For example:\n * '0.16.1' -> '0016'\n * '1.2.5' -> '0102'\n */\nconst VERSION_STR = VERSION\n .replace(/\\d*./g, v => `0${v % 100}`.slice(-2))\n .slice(0, 4)\n\n/**\n * Version prefix string (used in peer ID). WebTorrent uses the Azureus-style\n * encoding: '-', two characters for client id ('WW'), four ascii digits for version\n * number, '-', followed by random numbers.\n * For example:\n * '-WW0102-'...\n */\nconst VERSION_PREFIX = `-WW${VERSION_STR}-`\n\n/**\n * WebTorrent Client\n * @param {Object=} opts\n */\nclass WebTorrent extends EventEmitter {\n constructor (opts = {}) {\n super()\n\n if (typeof opts.peerId === 'string') {\n this.peerId = opts.peerId\n } else if (Buffer.isBuffer(opts.peerId)) {\n this.peerId = opts.peerId.toString('hex')\n } else {\n this.peerId = Buffer.from(VERSION_PREFIX + randombytes(9).toString('base64')).toString('hex')\n }\n this.peerIdBuffer = Buffer.from(this.peerId, 'hex')\n\n if (typeof opts.nodeId === 'string') {\n this.nodeId = opts.nodeId\n } else if (Buffer.isBuffer(opts.nodeId)) {\n this.nodeId = opts.nodeId.toString('hex')\n } else {\n this.nodeId = randombytes(20).toString('hex')\n }\n this.nodeIdBuffer = Buffer.from(this.nodeId, 'hex')\n\n this._debugId = this.peerId.toString('hex').substring(0, 7)\n\n this.destroyed = false\n this.listening = false\n this.torrentPort = opts.torrentPort || 0\n this.dhtPort = opts.dhtPort || 0\n this.tracker = opts.tracker !== undefined ? opts.tracker : {}\n this.lsd = opts.lsd !== false\n this.torrents = []\n this.maxConns = Number(opts.maxConns) || 55\n this.utp = WebTorrent.UTP_SUPPORT && opts.utp !== false\n\n this._downloadLimit = Math.max((typeof opts.downloadLimit === 'number') ? opts.downloadLimit : -1, -1)\n this._uploadLimit = Math.max((typeof opts.uploadLimit === 'number') ? opts.uploadLimit : -1, -1)\n\n this.serviceWorker = null\n this.workerKeepAliveInterval = null\n this.workerPortCount = 0\n\n if (opts.secure === true) {\n require('./lib/peer').enableSecure()\n }\n\n this._debug(\n 'new webtorrent (peerId %s, nodeId %s, port %s)',\n this.peerId, this.nodeId, this.torrentPort\n )\n\n this.throttleGroups = {\n down: new ThrottleGroup({ rate: Math.max(this._downloadLimit, 0), enabled: this._downloadLimit >= 0 }),\n up: new ThrottleGroup({ rate: Math.max(this._uploadLimit, 0), enabled: this._uploadLimit >= 0 })\n }\n\n if (this.tracker) {\n if (typeof this.tracker !== 'object') this.tracker = {}\n if (globalThis.WRTC && !this.tracker.wrtc) this.tracker.wrtc = globalThis.WRTC\n }\n\n if (typeof ConnPool === 'function') {\n this._connPool = new ConnPool(this)\n } else {\n queueMicrotask(() => {\n this._onListening()\n })\n }\n\n // stats\n this._downloadSpeed = speedometer()\n this._uploadSpeed = speedometer()\n\n if (opts.dht !== false && typeof DHT === 'function' /* browser exclude */) {\n // use a single DHT instance for all torrents, so the routing table can be reused\n this.dht = new DHT(Object.assign({}, { nodeId: this.nodeId }, opts.dht))\n\n this.dht.once('error', err => {\n this._destroy(err)\n })\n\n this.dht.once('listening', () => {\n const address = this.dht.address()\n if (address) this.dhtPort = address.port\n })\n\n // Ignore warning when there are > 10 torrents in the client\n this.dht.setMaxListeners(0)\n\n this.dht.listen(this.dhtPort)\n } else {\n this.dht = false\n }\n\n // Enable or disable BEP19 (Web Seeds). Enabled by default:\n this.enableWebSeeds = opts.webSeeds !== false\n\n const ready = () => {\n if (this.destroyed) return\n this.ready = true\n this.emit('ready')\n }\n\n if (typeof loadIPSet === 'function' && opts.blocklist != null) {\n loadIPSet(opts.blocklist, {\n headers: {\n 'user-agent': `WebTorrent/${VERSION} (https://webtorrent.io)`\n }\n }, (err, ipSet) => {\n if (err) return console.error(`Failed to load blocklist: ${err.message}`)\n this.blocked = ipSet\n ready()\n })\n } else {\n queueMicrotask(ready)\n }\n }\n\n /**\n * Accepts an existing service worker registration [navigator.serviceWorker.controller]\n * which must be activated, \"creates\" a file server for streamed file rendering to use.\n *\n * @param {ServiceWorker} controller\n * @param {function=} cb\n * @return {null}\n */\n loadWorker (controller, cb = () => {}) {\n if (!(controller instanceof ServiceWorker)) throw new Error('Invalid worker registration')\n if (controller.state !== 'activated') throw new Error('Worker isn\\'t activated')\n const keepAliveTime = 20000\n\n this.serviceWorker = controller\n\n navigator.serviceWorker.addEventListener('message', event => {\n const { data } = event\n if (!data.type || !data.type === 'webtorrent' || !data.url) return null\n let [infoHash, ...filePath] = data.url.slice(data.url.indexOf(data.scope + 'webtorrent/') + 11 + data.scope.length).split('/')\n filePath = decodeURI(filePath.join('/'))\n if (!infoHash || !filePath) return null\n\n const [port] = event.ports\n\n const file = this.get(infoHash) && this.get(infoHash).files.find(file => file.path === filePath)\n if (!file) return null\n\n const [response, stream, raw] = file._serve(data)\n const asyncIterator = stream && stream[Symbol.asyncIterator]()\n\n const cleanup = () => {\n port.onmessage = null\n if (stream) stream.destroy()\n if (raw) raw.destroy()\n this.workerPortCount--\n if (!this.workerPortCount) {\n clearInterval(this.workerKeepAliveInterval)\n this.workerKeepAliveInterval = null\n }\n }\n\n port.onmessage = async msg => {\n if (msg.data) {\n let chunk\n try {\n chunk = (await asyncIterator.next()).value\n } catch (e) {\n // chunk is yet to be downloaded or it somehow failed, should this be logged?\n }\n port.postMessage(chunk)\n if (!chunk) cleanup()\n if (!this.workerKeepAliveInterval) this.workerKeepAliveInterval = setInterval(() => fetch(`${this.serviceWorker.scriptURL.substr(0, this.serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length)}webtorrent/keepalive/`), keepAliveTime)\n } else {\n cleanup()\n }\n }\n this.workerPortCount++\n port.postMessage(response)\n })\n cb(this.serviceWorker)\n }\n\n get downloadSpeed () { return this._downloadSpeed() }\n\n get uploadSpeed () { return this._uploadSpeed() }\n\n get progress () {\n const torrents = this.torrents.filter(torrent => torrent.progress !== 1)\n const downloaded = torrents.reduce((total, torrent) => total + torrent.downloaded, 0)\n const length = torrents.reduce((total, torrent) => total + (torrent.length || 0), 0) || 1\n return downloaded / length\n }\n\n get ratio () {\n const uploaded = this.torrents.reduce((total, torrent) => total + torrent.uploaded, 0)\n const received = this.torrents.reduce((total, torrent) => total + torrent.received, 0) || 1\n return uploaded / received\n }\n\n /**\n * Returns the torrent with the given `torrentId`. Convenience method. Easier than\n * searching through the `client.torrents` array. Returns `null` if no matching torrent\n * found.\n *\n * @param {string|Buffer|Object|Torrent} torrentId\n * @return {Torrent|null}\n */\n get (torrentId) {\n if (torrentId instanceof Torrent) {\n if (this.torrents.includes(torrentId)) return torrentId\n } else {\n let parsed\n try { parsed = parseTorrent(torrentId) } catch (err) {}\n\n if (!parsed) return null\n if (!parsed.infoHash) throw new Error('Invalid torrent identifier')\n\n for (const torrent of this.torrents) {\n if (torrent.infoHash === parsed.infoHash) return torrent\n }\n }\n return null\n }\n\n /**\n * Start downloading a new torrent. Aliased as `client.download`.\n * @param {string|Buffer|Object} torrentId\n * @param {Object} opts torrent-specific options\n * @param {function=} ontorrent called when the torrent is ready (has metadata)\n */\n add (torrentId, opts = {}, ontorrent = () => {}) {\n if (this.destroyed) throw new Error('client is destroyed')\n if (typeof opts === 'function') [opts, ontorrent] = [{}, opts]\n\n const onInfoHash = () => {\n if (this.destroyed) return\n for (const t of this.torrents) {\n if (t.infoHash === torrent.infoHash && t !== torrent) {\n torrent._destroy(new Error(`Cannot add duplicate torrent ${torrent.infoHash}`))\n return\n }\n }\n }\n\n const onReady = () => {\n if (this.destroyed) return\n ontorrent(torrent)\n this.emit('torrent', torrent)\n }\n\n function onClose () {\n torrent.removeListener('_infoHash', onInfoHash)\n torrent.removeListener('ready', onReady)\n torrent.removeListener('close', onClose)\n }\n\n this._debug('add')\n opts = opts ? Object.assign({}, opts) : {}\n\n const torrent = new Torrent(torrentId, this, opts)\n this.torrents.push(torrent)\n\n torrent.once('_infoHash', onInfoHash)\n torrent.once('ready', onReady)\n torrent.once('close', onClose)\n\n return torrent\n }\n\n /**\n * Start seeding a new file/folder.\n * @param {string|File|FileList|Buffer|Array.} input\n * @param {Object=} opts\n * @param {function=} onseed called when torrent is seeding\n */\n seed (input, opts, onseed) {\n if (this.destroyed) throw new Error('client is destroyed')\n if (typeof opts === 'function') [opts, onseed] = [{}, opts]\n\n this._debug('seed')\n opts = opts ? Object.assign({}, opts) : {}\n\n // no need to verify the hashes we create\n opts.skipVerify = true\n\n const isFilePath = typeof input === 'string'\n\n // When seeding from fs path, initialize store from that path to avoid a copy\n if (isFilePath) opts.path = path.dirname(input)\n if (!opts.createdBy) opts.createdBy = `WebTorrent/${VERSION_STR}`\n\n const onTorrent = torrent => {\n const tasks = [\n cb => {\n // when a filesystem path is specified or the store is preloaded, files are already in the FS store\n if (isFilePath || opts.preloadedStore) return cb()\n torrent.load(streams, cb)\n }\n ]\n if (this.dht) {\n tasks.push(cb => {\n torrent.once('dhtAnnounce', cb)\n })\n }\n parallel(tasks, err => {\n if (this.destroyed) return\n if (err) return torrent._destroy(err)\n _onseed(torrent)\n })\n }\n\n const _onseed = torrent => {\n this._debug('on seed')\n if (typeof onseed === 'function') onseed(torrent)\n torrent.emit('seed')\n this.emit('seed', torrent)\n }\n\n const torrent = this.add(null, opts, onTorrent)\n let streams\n\n if (isFileList(input)) input = Array.from(input)\n else if (!Array.isArray(input)) input = [input]\n\n parallel(input.map(item => cb => {\n if (!opts.preloadedStore && isReadable(item)) {\n concat(item, (err, buf) => {\n if (err) return cb(err)\n buf.name = item.name\n cb(null, buf)\n })\n } else {\n cb(null, item)\n }\n }), (err, input) => {\n if (this.destroyed) return\n if (err) return torrent._destroy(err)\n\n createTorrent.parseInput(input, opts, (err, files) => {\n if (this.destroyed) return\n if (err) return torrent._destroy(err)\n\n streams = files.map(file => file.getStream)\n\n createTorrent(input, opts, (err, torrentBuf) => {\n if (this.destroyed) return\n if (err) return torrent._destroy(err)\n\n const existingTorrent = this.get(torrentBuf)\n if (existingTorrent) {\n torrent._destroy(new Error(`Cannot add duplicate torrent ${existingTorrent.infoHash}`))\n } else {\n torrent._onTorrentId(torrentBuf)\n }\n })\n })\n })\n\n return torrent\n }\n\n /**\n * Remove a torrent from the client.\n * @param {string|Buffer|Torrent} torrentId\n * @param {function} cb\n */\n remove (torrentId, opts, cb) {\n if (typeof opts === 'function') return this.remove(torrentId, null, opts)\n\n this._debug('remove')\n const torrent = this.get(torrentId)\n if (!torrent) throw new Error(`No torrent with id ${torrentId}`)\n this._remove(torrentId, opts, cb)\n }\n\n _remove (torrentId, opts, cb) {\n if (typeof opts === 'function') return this._remove(torrentId, null, opts)\n\n const torrent = this.get(torrentId)\n if (!torrent) return\n this.torrents.splice(this.torrents.indexOf(torrent), 1)\n torrent.destroy(opts, cb)\n }\n\n address () {\n if (!this.listening) return null\n return this._connPool\n ? this._connPool.tcpServer.address()\n : { address: '0.0.0.0', family: 'IPv4', port: 0 }\n }\n\n /**\n * Set global download throttle rate.\n * @param {Number} rate (must be bigger or equal than zero, or -1 to disable throttling)\n */\n throttleDownload (rate) {\n rate = Number(rate)\n if (isNaN(rate) || !isFinite(rate) || rate < -1) return false\n this._downloadLimit = rate\n if (this._downloadLimit < 0) return this.throttleGroups.down.setEnabled(false)\n this.throttleGroups.down.setEnabled(true)\n this.throttleGroups.down.setRate(this._downloadLimit)\n }\n\n /**\n * Set global upload throttle rate\n * @param {Number} rate (must be bigger or equal than zero, or -1 to disable throttling)\n */\n throttleUpload (rate) {\n rate = Number(rate)\n if (isNaN(rate) || !isFinite(rate) || rate < -1) return false\n this._uploadLimit = rate\n if (this._uploadLimit < 0) return this.throttleGroups.up.setEnabled(false)\n this.throttleGroups.up.setEnabled(true)\n this.throttleGroups.up.setRate(this._uploadLimit)\n }\n\n /**\n * Destroy the client, including all torrents and connections to peers.\n * @param {function} cb\n */\n destroy (cb) {\n if (this.destroyed) throw new Error('client already destroyed')\n this._destroy(null, cb)\n }\n\n _destroy (err, cb) {\n this._debug('client destroy')\n this.destroyed = true\n\n const tasks = this.torrents.map(torrent => cb => {\n torrent.destroy(cb)\n })\n\n if (this._connPool) {\n tasks.push(cb => {\n this._connPool.destroy(cb)\n })\n }\n\n if (this.dht) {\n tasks.push(cb => {\n this.dht.destroy(cb)\n })\n }\n\n parallel(tasks, cb)\n\n if (err) this.emit('error', err)\n\n this.torrents = []\n this._connPool = null\n this.dht = null\n\n this.throttleGroups.down.destroy()\n this.throttleGroups.up.destroy()\n }\n\n _onListening () {\n this._debug('listening')\n this.listening = true\n\n if (this._connPool) {\n // Sometimes server.address() returns `null` in Docker.\n const address = this._connPool.tcpServer.address()\n if (address) this.torrentPort = address.port\n }\n\n this.emit('listening')\n }\n\n _debug () {\n const args = [].slice.call(arguments)\n args[0] = `[${this._debugId}] ${args[0]}`\n debug(...args)\n }\n\n _getByHash (infoHashHash) {\n for (const torrent of this.torrents) {\n if (!torrent.infoHashHash) {\n torrent.infoHashHash = sha1.sync(Buffer.from('72657132' /* 'req2' */ + torrent.infoHash, 'hex'))\n }\n if (infoHashHash === torrent.infoHashHash) {\n return torrent\n }\n }\n\n return null\n }\n}\n\nWebTorrent.WEBRTC_SUPPORT = Peer.WEBRTC_SUPPORT\nWebTorrent.UTP_SUPPORT = ConnPool.UTP_SUPPORT\nWebTorrent.VERSION = VERSION\n\n/**\n * Check if `obj` is a node Readable stream\n * @param {*} obj\n * @return {boolean}\n */\nfunction isReadable (obj) {\n return typeof obj === 'object' && obj != null && typeof obj.pipe === 'function'\n}\n\n/**\n * Check if `obj` is a W3C `FileList` object\n * @param {*} obj\n * @return {boolean}\n */\nfunction isFileList (obj) {\n return typeof FileList !== 'undefined' && obj instanceof FileList\n}\n\nmodule.exports = WebTorrent\n","const debug = require('debug')('webtorrent:file-stream')\nconst stream = require('readable-stream')\nconst eos = require('end-of-stream')\n\n/**\n * Readable stream of a torrent file\n *\n * @param {File} file\n * @param {Object} opts\n * @param {number} opts.start stream slice of file, starting from this byte (inclusive)\n * @param {number} opts.end stream slice of file, ending with this byte (inclusive)\n */\nclass FileStream extends stream.Readable {\n constructor (file, opts) {\n super(opts)\n\n this._torrent = file._torrent\n\n const start = (opts && opts.start) || 0\n const end = (opts && opts.end && opts.end < file.length)\n ? opts.end\n : file.length - 1\n\n const pieceLength = file._torrent.pieceLength\n\n this._startPiece = (start + file.offset) / pieceLength | 0\n this._endPiece = (end + file.offset) / pieceLength | 0\n\n this._piece = this._startPiece\n this._offset = (start + file.offset) - (this._startPiece * pieceLength)\n\n this._missing = end - start + 1\n this._reading = false\n this._notifying = false\n this._criticalLength = Math.min((1024 * 1024 / pieceLength) | 0, 2)\n\n this._torrent.select(this._startPiece, this._endPiece, true, () => {\n this._notify()\n })\n\n // Ensure that cleanup happens even if destroy() is never called (readable-stream v3 currently doesn't call it automaticallly)\n eos(this, (err) => {\n this.destroy(err)\n })\n }\n\n _read () {\n if (this._reading) return\n this._reading = true\n this._notify()\n }\n\n _notify () {\n if (!this._reading || this._missing === 0) return\n if (!this._torrent.bitfield.get(this._piece)) {\n return this._torrent.critical(this._piece, this._piece + this._criticalLength)\n }\n\n if (this._notifying) return\n this._notifying = true\n\n if (this._torrent.destroyed) return this.destroy(new Error('Torrent removed'))\n\n const p = this._piece\n\n const getOpts = {}\n // Specify length for the last piece in case it is zero-padded\n if (p === this._torrent.pieces.length - 1) {\n getOpts.length = this._torrent.lastPieceLength\n }\n this._torrent.store.get(p, getOpts, (err, buffer) => {\n this._notifying = false\n if (this.destroyed) return\n debug('read %s (length %s) (err %s)', p, buffer && buffer.length, err && err.message)\n\n if (err) return this.destroy(err)\n\n if (this._offset) {\n buffer = buffer.slice(this._offset)\n this._offset = 0\n }\n\n if (this._missing < buffer.length) {\n buffer = buffer.slice(0, this._missing)\n }\n this._missing -= buffer.length\n\n debug('pushing buffer of length %s', buffer.length)\n this._reading = false\n this.push(buffer)\n\n if (this._missing === 0) this.push(null)\n })\n this._piece += 1\n }\n\n _destroy (err, cb) {\n if (!this._torrent.destroyed) {\n this._torrent.deselect(this._startPiece, this._endPiece, true)\n }\n cb(err)\n }\n}\n\nmodule.exports = FileStream\n","const { EventEmitter } = require('events')\nconst { PassThrough } = require('readable-stream')\nconst path = require('path')\nconst render = require('render-media')\nconst streamToBlob = require('stream-to-blob')\nconst streamToBlobURL = require('stream-to-blob-url')\nconst streamToBuffer = require('stream-with-known-length-to-buffer')\nconst FileStream = require('./file-stream')\nconst queueMicrotask = require('queue-microtask')\nconst rangeParser = require('range-parser')\nconst mime = require('mime')\nconst eos = require('end-of-stream')\n\nclass File extends EventEmitter {\n constructor (torrent, file) {\n super()\n\n this._torrent = torrent\n this._destroyed = false\n this._fileStreams = new Set()\n\n this.name = file.name\n this.path = file.path\n this.length = file.length\n this.offset = file.offset\n\n this.done = false\n\n const start = file.offset\n const end = start + file.length - 1\n\n this._startPiece = start / this._torrent.pieceLength | 0\n this._endPiece = end / this._torrent.pieceLength | 0\n\n if (this.length === 0) {\n this.done = true\n this.emit('done')\n }\n\n this._serviceWorker = torrent.client.serviceWorker\n }\n\n get downloaded () {\n if (this._destroyed || !this._torrent.bitfield) return 0\n\n const { pieces, bitfield, pieceLength, lastPieceLength } = this._torrent\n const { _startPiece: start, _endPiece: end } = this\n\n const getPieceLength = (pieceIndex) => (\n pieceIndex === pieces.length - 1 ? lastPieceLength : pieceLength\n )\n\n const getPieceDownloaded = (pieceIndex) => {\n const len = pieceIndex === pieces.length - 1 ? lastPieceLength : pieceLength\n if (bitfield.get(pieceIndex)) {\n // verified data\n return len\n } else {\n // \"in progress\" data\n return len - pieces[pieceIndex].missing\n }\n }\n\n let downloaded = 0\n for (let index = start; index <= end; index += 1) {\n const pieceDownloaded = getPieceDownloaded(index)\n downloaded += pieceDownloaded\n\n if (index === start) {\n // First piece may have an offset, e.g. irrelevant bytes from the end of\n // the previous file\n const irrelevantFirstPieceBytes = this.offset % pieceLength\n downloaded -= Math.min(irrelevantFirstPieceBytes, pieceDownloaded)\n }\n\n if (index === end) {\n // Last piece may have an offset, e.g. irrelevant bytes from the start\n // of the next file\n const irrelevantLastPieceBytes = getPieceLength(end) - (this.offset + this.length) % pieceLength\n downloaded -= Math.min(irrelevantLastPieceBytes, pieceDownloaded)\n }\n }\n\n return downloaded\n }\n\n get progress () {\n return this.length ? this.downloaded / this.length : 0\n }\n\n select (priority) {\n if (this.length === 0) return\n this._torrent.select(this._startPiece, this._endPiece, priority)\n }\n\n deselect () {\n if (this.length === 0) return\n this._torrent.deselect(this._startPiece, this._endPiece, false)\n }\n\n createReadStream (opts) {\n if (this.length === 0) {\n const empty = new PassThrough()\n queueMicrotask(() => {\n empty.end()\n })\n return empty\n }\n\n const fileStream = new FileStream(this, opts)\n\n this._fileStreams.add(fileStream)\n fileStream.once('close', () => {\n this._fileStreams.delete(fileStream)\n })\n\n return fileStream\n }\n\n getBuffer (cb) {\n streamToBuffer(this.createReadStream(), this.length, cb)\n }\n\n getBlob (cb) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n streamToBlob(this.createReadStream(), this._getMimeType())\n .then(\n blob => cb(null, blob),\n err => cb(err)\n )\n }\n\n getBlobURL (cb) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n streamToBlobURL(this.createReadStream(), this._getMimeType())\n .then(\n blobUrl => cb(null, blobUrl),\n err => cb(err)\n )\n }\n\n appendTo (elem, opts, cb) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n render.append(this, elem, opts, cb)\n }\n\n renderTo (elem, opts, cb) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n render.render(this, elem, opts, cb)\n }\n\n _serve (req) {\n const res = {\n status: 200,\n headers: {\n // Support range-requests\n 'Accept-Ranges': 'bytes',\n 'Content-Type': mime.getType(this.name),\n 'Cache-Control': 'no-cache, no-store, must-revalidate, max-age=0',\n Expires: '0'\n },\n body: req.method === 'HEAD' ? '' : 'STREAM'\n }\n // force the browser to download the file if if it's opened in a new tab\n if (req.destination === 'document') {\n res.headers['Content-Type'] = 'application/octet-stream'\n res.headers['Content-Disposition'] = 'attachment'\n res.body = 'DOWNLOAD'\n }\n\n // `rangeParser` returns an array of ranges, or an error code (number) if\n // there was an error parsing the range.\n let range = rangeParser(this.length, req.headers.range || '')\n\n if (range.constructor === Array) {\n res.status = 206 // indicates that range-request was understood\n\n // no support for multi-range request, just use the first range\n range = range[0]\n\n res.headers['Content-Range'] = `bytes ${range.start}-${range.end}/${this.length}`\n res.headers['Content-Length'] = `${range.end - range.start + 1}`\n } else {\n res.headers['Content-Length'] = this.length\n }\n\n const stream = req.method === 'GET' && this.createReadStream(range)\n\n let pipe = null\n if (stream) {\n this.emit('stream', { stream, req, file: this }, piped => {\n pipe = piped\n\n // piped stream might not close the original filestream on close/error, this is agressive but necessary\n eos(piped, () => {\n if (piped) piped.destroy()\n stream.destroy()\n })\n })\n }\n\n return [res, pipe || stream, pipe && stream]\n }\n\n getStreamURL (cb = () => {}) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n if (!this._serviceWorker) throw new Error('No worker registered')\n if (this._serviceWorker.state !== 'activated') throw new Error('Worker isn\\'t activated')\n const workerPath = this._serviceWorker.scriptURL.substr(0, this._serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length)\n const url = `${workerPath}webtorrent/${this._torrent.infoHash}/${encodeURI(this.path)}`\n cb(null, url)\n }\n\n streamTo (elem, cb = () => {}) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n if (!this._serviceWorker) throw new Error('No worker registered')\n if (this._serviceWorker.state !== 'activated') throw new Error('Worker isn\\'t activated')\n const workerPath = this._serviceWorker.scriptURL.substr(0, this._serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length)\n elem.src = `${workerPath}webtorrent/${this._torrent.infoHash}/${encodeURI(this.path)}`\n cb(null, elem)\n }\n\n _getMimeType () {\n return render.mime[path.extname(this.name).toLowerCase()]\n }\n\n _destroy () {\n this._destroyed = true\n this._torrent = null\n\n for (const fileStream of this._fileStreams) {\n fileStream.destroy()\n }\n this._fileStreams.clear()\n }\n}\n\nmodule.exports = File\n","const { EventEmitter } = require('events')\nconst { Transform } = require('stream')\nconst arrayRemove = require('unordered-array-remove')\nconst debug = require('debug')('webtorrent:peer')\nconst Wire = require('bittorrent-protocol')\n\nconst CONNECT_TIMEOUT_TCP = 5000\nconst CONNECT_TIMEOUT_UTP = 5000\nconst CONNECT_TIMEOUT_WEBRTC = 25000\nconst HANDSHAKE_TIMEOUT = 25000\n\nlet secure = false\n\nexports.enableSecure = () => {\n secure = true\n}\n\n/**\n * WebRTC peer connections start out connected, because WebRTC peers require an\n * \"introduction\" (i.e. WebRTC signaling), and there's no equivalent to an IP address\n * that lets you refer to a WebRTC endpoint.\n */\nexports.createWebRTCPeer = (conn, swarm, throttleGroups) => {\n const peer = new Peer(conn.id, 'webrtc')\n peer.conn = conn\n peer.swarm = swarm\n peer.throttleGroups = throttleGroups\n\n if (peer.conn.connected) {\n peer.onConnect()\n } else {\n const cleanup = () => {\n peer.conn.removeListener('connect', onConnect)\n peer.conn.removeListener('error', onError)\n }\n const onConnect = () => {\n cleanup()\n peer.onConnect()\n }\n const onError = err => {\n cleanup()\n peer.destroy(err)\n }\n peer.conn.once('connect', onConnect)\n peer.conn.once('error', onError)\n peer.startConnectTimeout()\n }\n\n return peer\n}\n\n/**\n * Incoming TCP peers start out connected, because the remote peer connected to the\n * listening port of the TCP server. Until the remote peer sends a handshake, we don't\n * know what swarm the connection is intended for.\n */\nexports.createTCPIncomingPeer = (conn, throttleGroups) => {\n return _createIncomingPeer(conn, 'tcpIncoming', throttleGroups)\n}\n\n/**\n * Incoming uTP peers start out connected, because the remote peer connected to the\n * listening port of the uTP server. Until the remote peer sends a handshake, we don't\n * know what swarm the connection is intended for.\n */\nexports.createUTPIncomingPeer = (conn, throttleGroups) => {\n return _createIncomingPeer(conn, 'utpIncoming', throttleGroups)\n}\n\n/**\n * Outgoing TCP peers start out with just an IP address. At some point (when there is an\n * available connection), the client can attempt to connect to the address.\n */\nexports.createTCPOutgoingPeer = (addr, swarm, throttleGroups) => {\n return _createOutgoingPeer(addr, swarm, 'tcpOutgoing', throttleGroups)\n}\n\n/**\n * Outgoing uTP peers start out with just an IP address. At some point (when there is an\n * available connection), the client can attempt to connect to the address.\n */\nexports.createUTPOutgoingPeer = (addr, swarm, throttleGroups) => {\n return _createOutgoingPeer(addr, swarm, 'utpOutgoing', throttleGroups)\n}\n\nconst _createIncomingPeer = (conn, type, throttleGroups) => {\n const addr = `${conn.remoteAddress}:${conn.remotePort}`\n const peer = new Peer(addr, type)\n peer.conn = conn\n peer.addr = addr\n peer.throttleGroups = throttleGroups\n\n peer.onConnect()\n\n return peer\n}\n\nconst _createOutgoingPeer = (addr, swarm, type, throttleGroups) => {\n const peer = new Peer(addr, type)\n peer.addr = addr\n peer.swarm = swarm\n peer.throttleGroups = throttleGroups\n\n return peer\n}\n\n/**\n * Peer that represents a Web Seed (BEP17 / BEP19).\n */\nexports.createWebSeedPeer = (conn, id, swarm, throttleGroups) => {\n const peer = new Peer(id, 'webSeed')\n peer.swarm = swarm\n peer.conn = conn\n peer.throttleGroups = throttleGroups\n\n peer.onConnect()\n\n return peer\n}\n\n/**\n * Peer. Represents a peer in the torrent swarm.\n *\n * @param {string} id \"ip:port\" string, peer id (for WebRTC peers), or url (for Web Seeds)\n * @param {string} type the type of the peer\n */\nclass Peer extends EventEmitter {\n constructor (id, type) {\n super()\n\n this.id = id\n this.type = type\n\n debug('new %s Peer %s', type, id)\n\n this.addr = null\n this.conn = null\n this.swarm = null\n this.wire = null\n\n this.connected = false\n this.destroyed = false\n this.timeout = null // handshake timeout\n this.retries = 0 // outgoing TCP connection retry count\n\n this.sentPe1 = false\n this.sentPe2 = false\n this.sentPe3 = false\n this.sentPe4 = false\n this.sentHandshake = false\n }\n\n /**\n * Called once the peer is connected (i.e. fired 'connect' event)\n * @param {Socket} conn\n */\n onConnect () {\n if (this.destroyed) return\n this.connected = true\n\n debug('Peer %s connected', this.id)\n\n clearTimeout(this.connectTimeout)\n\n const conn = this.conn\n conn.once('end', () => {\n this.destroy()\n })\n conn.once('close', () => {\n this.destroy()\n })\n conn.once('finish', () => {\n this.destroy()\n })\n conn.once('error', err => {\n this.destroy(err)\n })\n\n const wire = this.wire = new Wire(this.type, this.retries, secure)\n\n wire.once('end', () => {\n this.destroy()\n })\n wire.once('close', () => {\n this.destroy()\n })\n wire.once('finish', () => {\n this.destroy()\n })\n wire.once('error', err => {\n this.destroy(err)\n })\n\n wire.once('pe1', () => {\n this.onPe1()\n })\n wire.once('pe2', () => {\n this.onPe2()\n })\n wire.once('pe3', () => {\n this.onPe3()\n })\n wire.once('pe4', () => {\n this.onPe4()\n })\n wire.once('handshake', (infoHash, peerId) => {\n this.onHandshake(infoHash, peerId)\n })\n this.startHandshakeTimeout()\n\n this.setThrottlePipes()\n\n if (this.swarm) {\n if (this.type === 'tcpOutgoing') {\n if (secure && this.retries === 0 && !this.sentPe1) this.sendPe1()\n else if (!this.sentHandshake) this.handshake()\n } else if (this.type !== 'tcpIncoming' && !this.sentHandshake) this.handshake()\n }\n }\n\n sendPe1 () {\n this.wire.sendPe1()\n this.sentPe1 = true\n }\n\n onPe1 () {\n this.sendPe2()\n }\n\n sendPe2 () {\n this.wire.sendPe2()\n this.sentPe2 = true\n }\n\n onPe2 () {\n this.sendPe3()\n }\n\n sendPe3 () {\n this.wire.sendPe3(this.swarm.infoHash)\n this.sentPe3 = true\n }\n\n onPe3 (infoHashHash) {\n if (this.swarm) {\n if (this.swarm.infoHashHash !== infoHashHash) {\n this.destroy(new Error('unexpected crypto handshake info hash for this swarm'))\n }\n this.sendPe4()\n }\n }\n\n sendPe4 () {\n this.wire.sendPe4(this.swarm.infoHash)\n this.sentPe4 = true\n }\n\n onPe4 () {\n if (!this.sentHandshake) this.handshake()\n }\n\n clearPipes () {\n this.conn.unpipe()\n this.wire.unpipe()\n }\n\n setThrottlePipes () {\n const self = this\n this.conn\n .pipe(this.throttleGroups.down.throttle())\n .pipe(new Transform({\n transform (chunk, _, callback) {\n self.emit('download', chunk.length)\n if (self.destroyed) return\n callback(null, chunk)\n }\n }))\n .pipe(this.wire)\n .pipe(this.throttleGroups.up.throttle())\n .pipe(new Transform({\n transform (chunk, _, callback) {\n self.emit('upload', chunk.length)\n if (self.destroyed) return\n callback(null, chunk)\n }\n }))\n .pipe(this.conn)\n }\n\n /**\n * Called when handshake is received from remote peer.\n * @param {string} infoHash\n * @param {string} peerId\n */\n onHandshake (infoHash, peerId) {\n if (!this.swarm) return // `this.swarm` not set yet, so do nothing\n if (this.destroyed) return\n\n if (this.swarm.destroyed) {\n return this.destroy(new Error('swarm already destroyed'))\n }\n if (infoHash !== this.swarm.infoHash) {\n return this.destroy(new Error('unexpected handshake info hash for this swarm'))\n }\n if (peerId === this.swarm.peerId) {\n return this.destroy(new Error('refusing to connect to ourselves'))\n }\n\n debug('Peer %s got handshake %s', this.id, infoHash)\n\n clearTimeout(this.handshakeTimeout)\n\n this.retries = 0\n\n let addr = this.addr\n if (!addr && this.conn.remoteAddress && this.conn.remotePort) {\n addr = `${this.conn.remoteAddress}:${this.conn.remotePort}`\n }\n this.swarm._onWire(this.wire, addr)\n\n // swarm could be destroyed in user's 'wire' event handler\n if (!this.swarm || this.swarm.destroyed) return\n\n if (!this.sentHandshake) this.handshake()\n }\n\n handshake () {\n const opts = {\n dht: this.swarm.private ? false : !!this.swarm.client.dht\n }\n this.wire.handshake(this.swarm.infoHash, this.swarm.client.peerId, opts)\n this.sentHandshake = true\n }\n\n startConnectTimeout () {\n clearTimeout(this.connectTimeout)\n\n const connectTimeoutValues = {\n webrtc: CONNECT_TIMEOUT_WEBRTC,\n tcpOutgoing: CONNECT_TIMEOUT_TCP,\n utpOutgoing: CONNECT_TIMEOUT_UTP\n }\n\n this.connectTimeout = setTimeout(() => {\n this.destroy(new Error('connect timeout'))\n }, connectTimeoutValues[this.type])\n if (this.connectTimeout.unref) this.connectTimeout.unref()\n }\n\n startHandshakeTimeout () {\n clearTimeout(this.handshakeTimeout)\n this.handshakeTimeout = setTimeout(() => {\n this.destroy(new Error('handshake timeout'))\n }, HANDSHAKE_TIMEOUT)\n if (this.handshakeTimeout.unref) this.handshakeTimeout.unref()\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n this.connected = false\n\n debug('destroy %s %s (error: %s)', this.type, this.id, err && (err.message || err))\n\n clearTimeout(this.connectTimeout)\n clearTimeout(this.handshakeTimeout)\n\n const swarm = this.swarm\n const conn = this.conn\n const wire = this.wire\n\n this.swarm = null\n this.conn = null\n this.wire = null\n\n if (swarm && wire) {\n arrayRemove(swarm.wires, swarm.wires.indexOf(wire))\n }\n if (conn) {\n conn.on('error', () => {})\n conn.destroy()\n }\n if (wire) wire.destroy()\n if (swarm) swarm.removePeer(this.id)\n }\n}\n","\n/**\n * Mapping of torrent pieces to their respective availability in the torrent swarm. Used\n * by the torrent manager for implementing the rarest piece first selection strategy.\n */\nclass RarityMap {\n constructor (torrent) {\n this._torrent = torrent\n this._numPieces = torrent.pieces.length\n this._pieces = new Array(this._numPieces)\n\n this._onWire = wire => {\n this.recalculate()\n this._initWire(wire)\n }\n this._onWireHave = index => {\n this._pieces[index] += 1\n }\n this._onWireBitfield = () => {\n this.recalculate()\n }\n\n this._torrent.wires.forEach(wire => {\n this._initWire(wire)\n })\n this._torrent.on('wire', this._onWire)\n this.recalculate()\n }\n\n /**\n * Get the index of the rarest piece. Optionally, pass a filter function to exclude\n * certain pieces (for instance, those that we already have).\n *\n * @param {function} pieceFilterFunc\n * @return {number} index of rarest piece, or -1\n */\n getRarestPiece (pieceFilterFunc) {\n let candidates = []\n let min = Infinity\n\n for (let i = 0; i < this._numPieces; ++i) {\n if (pieceFilterFunc && !pieceFilterFunc(i)) continue\n\n const availability = this._pieces[i]\n if (availability === min) {\n candidates.push(i)\n } else if (availability < min) {\n candidates = [i]\n min = availability\n }\n }\n\n if (candidates.length) {\n // if there are multiple pieces with the same availability, choose one randomly\n return candidates[Math.random() * candidates.length | 0]\n } else {\n return -1\n }\n }\n\n destroy () {\n this._torrent.removeListener('wire', this._onWire)\n this._torrent.wires.forEach(wire => {\n this._cleanupWireEvents(wire)\n })\n this._torrent = null\n this._pieces = null\n\n this._onWire = null\n this._onWireHave = null\n this._onWireBitfield = null\n }\n\n _initWire (wire) {\n wire._onClose = () => {\n this._cleanupWireEvents(wire)\n for (let i = 0; i < this._numPieces; ++i) {\n this._pieces[i] -= wire.peerPieces.get(i)\n }\n }\n\n wire.on('have', this._onWireHave)\n wire.on('bitfield', this._onWireBitfield)\n wire.once('close', wire._onClose)\n }\n\n /**\n * Recalculates piece availability across all peers in the torrent.\n */\n recalculate () {\n this._pieces.fill(0)\n\n for (const wire of this._torrent.wires) {\n for (let i = 0; i < this._numPieces; ++i) {\n this._pieces[i] += wire.peerPieces.get(i)\n }\n }\n }\n\n _cleanupWireEvents (wire) {\n wire.removeListener('have', this._onWireHave)\n wire.removeListener('bitfield', this._onWireBitfield)\n if (wire._onClose) wire.removeListener('close', wire._onClose)\n wire._onClose = null\n }\n}\n\nmodule.exports = RarityMap\n","/* global Blob */\n\nconst addrToIPPort = require('addr-to-ip-port')\nconst BitField = require('bitfield').default\nconst CacheChunkStore = require('cache-chunk-store')\nconst ChunkStoreWriteStream = require('chunk-store-stream/write')\nconst cpus = require('cpus')\nconst debug = require('debug')('webtorrent:torrent')\nconst Discovery = require('torrent-discovery')\nconst EventEmitter = require('events').EventEmitter\nconst fs = require('fs')\nconst FSChunkStore = require('fs-chunk-store') // browser: `memory-chunk-store`\nconst get = require('simple-get')\nconst ImmediateChunkStore = require('immediate-chunk-store')\nconst ltDontHave = require('lt_donthave')\nconst MemoryChunkStore = require('memory-chunk-store')\nconst MultiStream = require('multistream')\nconst net = require('net') // browser exclude\nconst os = require('os') // browser exclude\nconst parallel = require('run-parallel')\nconst parallelLimit = require('run-parallel-limit')\nconst parseTorrent = require('parse-torrent')\nconst path = require('path')\nconst Piece = require('torrent-piece')\nconst pump = require('pump')\nconst queueMicrotask = require('queue-microtask')\nconst randomIterate = require('random-iterate')\nconst sha1 = require('simple-sha1')\nconst speedometer = require('speedometer')\nconst utMetadata = require('ut_metadata')\nconst utPex = require('ut_pex') // browser exclude\n\nconst File = require('./file')\nconst Peer = require('./peer')\nconst RarityMap = require('./rarity-map')\nconst Server = require('./server') // browser exclude\nconst utp = require('./utp') // browser exclude\nconst WebConn = require('./webconn')\n\nconst MAX_BLOCK_LENGTH = 128 * 1024\nconst PIECE_TIMEOUT = 30000\nconst CHOKE_TIMEOUT = 5000\nconst SPEED_THRESHOLD = 3 * Piece.BLOCK_LENGTH\n\nconst PIPELINE_MIN_DURATION = 0.5\nconst PIPELINE_MAX_DURATION = 1\n\nconst RECHOKE_INTERVAL = 10000 // 10 seconds\nconst RECHOKE_OPTIMISTIC_DURATION = 2 // 30 seconds\n\n// IndexedDB chunk stores used in the browser benefit from high concurrency\nconst FILESYSTEM_CONCURRENCY = process.browser ? cpus().length : 2\n\nconst RECONNECT_WAIT = [1000, 5000, 15000]\n\nconst VERSION = require('../package.json').version\nconst USER_AGENT = `WebTorrent/${VERSION} (https://webtorrent.io)`\n\nlet TMP\ntry {\n TMP = path.join(fs.statSync('/tmp') && '/tmp', 'webtorrent')\n} catch (err) {\n TMP = path.join(typeof os.tmpdir === 'function' ? os.tmpdir() : '/', 'webtorrent')\n}\n\nclass Torrent extends EventEmitter {\n constructor (torrentId, client, opts) {\n super()\n\n this._debugId = 'unknown infohash'\n this.client = client\n\n this.announce = opts.announce\n this.urlList = opts.urlList\n\n this.path = opts.path\n this.skipVerify = !!opts.skipVerify\n this._store = opts.store || FSChunkStore\n this._preloadedStore = opts.preloadedStore || null\n this._storeCacheSlots = opts.storeCacheSlots !== undefined ? opts.storeCacheSlots : 20\n this._destroyStoreOnDestroy = opts.destroyStoreOnDestroy || false\n this._getAnnounceOpts = opts.getAnnounceOpts\n\n // if defined, `opts.private` overrides default privacy of torrent\n if (typeof opts.private === 'boolean') this.private = opts.private\n\n this.strategy = opts.strategy || 'sequential'\n\n this.maxWebConns = opts.maxWebConns || 4\n\n this._rechokeNumSlots = (opts.uploads === false || opts.uploads === 0)\n ? 0\n : (+opts.uploads || 10)\n this._rechokeOptimisticWire = null\n this._rechokeOptimisticTime = 0\n this._rechokeIntervalId = null\n\n this.ready = false\n this.destroyed = false\n this.paused = opts.paused || false\n this.done = false\n\n this.metadata = null\n this.store = null\n this.files = []\n this.pieces = []\n\n this._amInterested = false\n this._selections = []\n this._critical = []\n\n this.wires = [] // open wires (added *after* handshake)\n\n this._queue = [] // queue of outgoing tcp peers to connect to\n this._peers = {} // connected peers (addr/peerId -> Peer)\n this._peersLength = 0 // number of elements in `this._peers` (cache, for perf)\n\n // stats\n this.received = 0\n this.uploaded = 0\n this._downloadSpeed = speedometer()\n this._uploadSpeed = speedometer()\n\n // for cleanup\n this._servers = []\n this._xsRequests = []\n\n // TODO: remove this and expose a hook instead\n // optimization: don't recheck every file if it hasn't changed\n this._fileModtimes = opts.fileModtimes\n\n if (torrentId !== null) this._onTorrentId(torrentId)\n\n this._debug('new torrent')\n }\n\n get timeRemaining () {\n if (this.done) return 0\n if (this.downloadSpeed === 0) return Infinity\n return ((this.length - this.downloaded) / this.downloadSpeed) * 1000\n }\n\n get downloaded () {\n if (!this.bitfield) return 0\n let downloaded = 0\n for (let index = 0, len = this.pieces.length; index < len; ++index) {\n if (this.bitfield.get(index)) { // verified data\n downloaded += (index === len - 1) ? this.lastPieceLength : this.pieceLength\n } else { // \"in progress\" data\n const piece = this.pieces[index]\n downloaded += (piece.length - piece.missing)\n }\n }\n return downloaded\n }\n\n // TODO: re-enable this. The number of missing pieces. Used to implement 'end game' mode.\n // Object.defineProperty(Storage.prototype, 'numMissing', {\n // get: function () {\n // var self = this\n // var numMissing = self.pieces.length\n // for (var index = 0, len = self.pieces.length; index < len; index++) {\n // numMissing -= self.bitfield.get(index)\n // }\n // return numMissing\n // }\n // })\n\n get downloadSpeed () { return this._downloadSpeed() }\n\n get uploadSpeed () { return this._uploadSpeed() }\n\n get progress () { return this.length ? this.downloaded / this.length : 0 }\n\n get ratio () { return this.uploaded / (this.received || this.length) }\n\n get numPeers () { return this.wires.length }\n\n get torrentFileBlobURL () {\n if (typeof window === 'undefined') throw new Error('browser-only property')\n if (!this.torrentFile) return null\n return URL.createObjectURL(\n new Blob([this.torrentFile], { type: 'application/x-bittorrent' })\n )\n }\n\n get _numQueued () {\n return this._queue.length + (this._peersLength - this._numConns)\n }\n\n get _numConns () {\n let numConns = 0\n for (const id in this._peers) {\n if (this._peers[id].connected) numConns += 1\n }\n return numConns\n }\n\n _onTorrentId (torrentId) {\n if (this.destroyed) return\n\n let parsedTorrent\n try { parsedTorrent = parseTorrent(torrentId) } catch (err) {}\n if (parsedTorrent) {\n // Attempt to set infoHash property synchronously\n this.infoHash = parsedTorrent.infoHash\n this._debugId = parsedTorrent.infoHash.toString('hex').substring(0, 7)\n queueMicrotask(() => {\n if (this.destroyed) return\n this._onParsedTorrent(parsedTorrent)\n })\n } else {\n // If torrentId failed to parse, it could be in a form that requires an async\n // operation, i.e. http/https link, filesystem path, or Blob.\n parseTorrent.remote(torrentId, (err, parsedTorrent) => {\n if (this.destroyed) return\n if (err) return this._destroy(err)\n this._onParsedTorrent(parsedTorrent)\n })\n }\n }\n\n _onParsedTorrent (parsedTorrent) {\n if (this.destroyed) return\n\n this._processParsedTorrent(parsedTorrent)\n\n if (!this.infoHash) {\n return this._destroy(new Error('Malformed torrent data: No info hash'))\n }\n\n if (!this.path) this.path = path.join(TMP, this.infoHash)\n\n this._rechokeIntervalId = setInterval(() => {\n this._rechoke()\n }, RECHOKE_INTERVAL)\n if (this._rechokeIntervalId.unref) this._rechokeIntervalId.unref()\n\n // Private 'infoHash' event allows client.add to check for duplicate torrents and\n // destroy them before the normal 'infoHash' event is emitted. Prevents user\n // applications from needing to deal with duplicate 'infoHash' events.\n this.emit('_infoHash', this.infoHash)\n if (this.destroyed) return\n\n this.emit('infoHash', this.infoHash)\n if (this.destroyed) return // user might destroy torrent in event handler\n\n if (this.client.listening) {\n this._onListening()\n } else {\n this.client.once('listening', () => {\n this._onListening()\n })\n }\n }\n\n _processParsedTorrent (parsedTorrent) {\n this._debugId = parsedTorrent.infoHash.toString('hex').substring(0, 7)\n\n if (typeof this.private !== 'undefined') {\n // `private` option overrides default, only if it's defined\n parsedTorrent.private = this.private\n }\n\n if (this.announce) {\n // Allow specifying trackers via `opts` parameter\n parsedTorrent.announce = parsedTorrent.announce.concat(this.announce)\n }\n\n if (this.client.tracker && global.WEBTORRENT_ANNOUNCE && !parsedTorrent.private) {\n // So `webtorrent-hybrid` can force specific trackers to be used\n parsedTorrent.announce = parsedTorrent.announce.concat(global.WEBTORRENT_ANNOUNCE)\n }\n\n if (this.urlList) {\n // Allow specifying web seeds via `opts` parameter\n parsedTorrent.urlList = parsedTorrent.urlList.concat(this.urlList)\n }\n\n // remove duplicates by converting to Set and back\n parsedTorrent.announce = Array.from(new Set(parsedTorrent.announce))\n parsedTorrent.urlList = Array.from(new Set(parsedTorrent.urlList))\n\n Object.assign(this, parsedTorrent)\n\n this.magnetURI = parseTorrent.toMagnetURI(parsedTorrent)\n this.torrentFile = parseTorrent.toTorrentFile(parsedTorrent)\n }\n\n _onListening () {\n if (this.destroyed) return\n\n if (this.info) {\n // if full metadata was included in initial torrent id, use it immediately. Otherwise,\n // wait for torrent-discovery to find peers and ut_metadata to get the metadata.\n this._onMetadata(this)\n } else {\n if (this.xs) this._getMetadataFromServer()\n this._startDiscovery()\n }\n }\n\n _startDiscovery () {\n if (this.discovery || this.destroyed) return\n\n let trackerOpts = this.client.tracker\n if (trackerOpts) {\n trackerOpts = Object.assign({}, this.client.tracker, {\n getAnnounceOpts: () => {\n if (this.destroyed) return\n\n const opts = {\n uploaded: this.uploaded,\n downloaded: this.downloaded,\n left: Math.max(this.length - this.downloaded, 0)\n }\n if (this.client.tracker.getAnnounceOpts) {\n Object.assign(opts, this.client.tracker.getAnnounceOpts())\n }\n if (this._getAnnounceOpts) {\n // TODO: consider deprecating this, as it's redundant with the former case\n Object.assign(opts, this._getAnnounceOpts())\n }\n return opts\n }\n })\n }\n\n // add BEP09 peer-address\n if (this.peerAddresses) {\n this.peerAddresses.forEach(peer => this.addPeer(peer))\n }\n\n // begin discovering peers via DHT and trackers\n this.discovery = new Discovery({\n infoHash: this.infoHash,\n announce: this.announce,\n peerId: this.client.peerId,\n dht: !this.private && this.client.dht,\n tracker: trackerOpts,\n port: this.client.torrentPort,\n userAgent: USER_AGENT,\n lsd: this.client.lsd\n })\n\n this.discovery.on('error', (err) => {\n this._destroy(err)\n })\n\n this.discovery.on('peer', (peer, source) => {\n this._debug('peer %s discovered via %s', peer, source)\n // Don't create new outgoing TCP connections when torrent is done\n if (typeof peer === 'string' && this.done) return\n this.addPeer(peer)\n })\n\n this.discovery.on('trackerAnnounce', () => {\n this.emit('trackerAnnounce')\n if (this.numPeers === 0) this.emit('noPeers', 'tracker')\n })\n\n this.discovery.on('dhtAnnounce', () => {\n this.emit('dhtAnnounce')\n if (this.numPeers === 0) this.emit('noPeers', 'dht')\n })\n\n this.discovery.on('warning', (err) => {\n this.emit('warning', err)\n })\n }\n\n _getMetadataFromServer () {\n // to allow function hoisting\n const self = this\n\n const urls = Array.isArray(this.xs) ? this.xs : [this.xs]\n\n const tasks = urls.map(url => cb => {\n getMetadataFromURL(url, cb)\n })\n parallel(tasks)\n\n function getMetadataFromURL (url, cb) {\n if (url.indexOf('http://') !== 0 && url.indexOf('https://') !== 0) {\n self.emit('warning', new Error(`skipping non-http xs param: ${url}`))\n return cb(null)\n }\n\n const opts = {\n url,\n method: 'GET',\n headers: {\n 'user-agent': USER_AGENT\n }\n }\n let req\n try {\n req = get.concat(opts, onResponse)\n } catch (err) {\n self.emit('warning', new Error(`skipping invalid url xs param: ${url}`))\n return cb(null)\n }\n\n self._xsRequests.push(req)\n\n function onResponse (err, res, torrent) {\n if (self.destroyed) return cb(null)\n if (self.metadata) return cb(null)\n\n if (err) {\n self.emit('warning', new Error(`http error from xs param: ${url}`))\n return cb(null)\n }\n if (res.statusCode !== 200) {\n self.emit('warning', new Error(`non-200 status code ${res.statusCode} from xs param: ${url}`))\n return cb(null)\n }\n\n let parsedTorrent\n try {\n parsedTorrent = parseTorrent(torrent)\n } catch (err) {}\n\n if (!parsedTorrent) {\n self.emit('warning', new Error(`got invalid torrent file from xs param: ${url}`))\n return cb(null)\n }\n\n if (parsedTorrent.infoHash !== self.infoHash) {\n self.emit('warning', new Error(`got torrent file with incorrect info hash from xs param: ${url}`))\n return cb(null)\n }\n\n self._onMetadata(parsedTorrent)\n cb(null)\n }\n }\n }\n\n /**\n * Called when the full torrent metadata is received.\n */\n _onMetadata (metadata) {\n if (this.metadata || this.destroyed) return\n this._debug('got metadata')\n\n this._xsRequests.forEach(req => {\n req.abort()\n })\n this._xsRequests = []\n\n let parsedTorrent\n if (metadata && metadata.infoHash) {\n // `metadata` is a parsed torrent (from parse-torrent module)\n parsedTorrent = metadata\n } else {\n try {\n parsedTorrent = parseTorrent(metadata)\n } catch (err) {\n return this._destroy(err)\n }\n }\n\n this._processParsedTorrent(parsedTorrent)\n this.metadata = this.torrentFile\n\n // add web seed urls (BEP19)\n if (this.client.enableWebSeeds) {\n this.urlList.forEach(url => {\n this.addWebSeed(url)\n })\n }\n\n this._rarityMap = new RarityMap(this)\n\n let rawStore = this._preloadedStore\n if (!rawStore) {\n rawStore = new this._store(this.pieceLength, {\n // opts.torrent is deprecated (replaced by the name property).\n // it doesn't appear to be used by current versions of any stores on npm.\n torrent: {\n infoHash: this.infoHash\n },\n files: this.files.map(file => ({\n path: path.join(this.path, file.path),\n length: file.length,\n offset: file.offset\n })),\n length: this.length,\n name: this.infoHash\n })\n }\n\n // don't use the cache if the store is already in memory\n if (this._storeCacheSlots > 0 && !(rawStore instanceof MemoryChunkStore)) {\n rawStore = new CacheChunkStore(rawStore, {\n max: this._storeCacheSlots\n })\n }\n\n this.store = new ImmediateChunkStore(\n rawStore\n )\n\n this.files = this.files.map(file => new File(this, file))\n\n // Select only specified files (BEP53) http://www.bittorrent.org/beps/bep_0053.html\n if (this.so) {\n this.files.forEach((v, i) => {\n if (this.so.includes(i)) {\n this.files[i].select()\n } else {\n this.files[i].deselect()\n }\n })\n } else {\n // start off selecting the entire torrent with low priority\n if (this.pieces.length !== 0) {\n this.select(0, this.pieces.length - 1, false)\n }\n }\n\n this._hashes = this.pieces\n\n this.pieces = this.pieces.map((hash, i) => {\n const pieceLength = (i === this.pieces.length - 1)\n ? this.lastPieceLength\n : this.pieceLength\n return new Piece(pieceLength)\n })\n\n this._reservations = this.pieces.map(() => [])\n\n this.bitfield = new BitField(this.pieces.length)\n\n this.wires.forEach(wire => {\n // If we didn't have the metadata at the time ut_metadata was initialized for this\n // wire, we still want to make it available to the peer in case they request it.\n if (wire.ut_metadata) wire.ut_metadata.setMetadata(this.metadata)\n\n this._onWireWithMetadata(wire)\n })\n\n // Emit 'metadata' before 'ready' and 'done'\n this.emit('metadata')\n\n // User might destroy torrent in response to 'metadata' event\n if (this.destroyed) return\n\n if (this.skipVerify) {\n // Skip verifying exisitng data and just assume it's correct\n this._markAllVerified()\n this._onStore()\n } else {\n const onPiecesVerified = (err) => {\n if (err) return this._destroy(err)\n this._debug('done verifying')\n this._onStore()\n }\n\n this._debug('verifying existing torrent data')\n if (this._fileModtimes && this._store === FSChunkStore) {\n // don't verify if the files haven't been modified since we last checked\n this.getFileModtimes((err, fileModtimes) => {\n if (err) return this._destroy(err)\n\n const unchanged = this.files.map((_, index) => fileModtimes[index] === this._fileModtimes[index]).every(x => x)\n\n if (unchanged) {\n this._markAllVerified()\n this._onStore()\n } else {\n this._verifyPieces(onPiecesVerified)\n }\n })\n } else {\n this._verifyPieces(onPiecesVerified)\n }\n }\n }\n\n /*\n * TODO: remove this\n * Gets the last modified time of every file on disk for this torrent.\n * Only valid in Node, not in the browser.\n */\n getFileModtimes (cb) {\n const ret = []\n parallelLimit(this.files.map((file, index) => cb => {\n fs.stat(path.join(this.path, file.path), (err, stat) => {\n if (err && err.code !== 'ENOENT') return cb(err)\n ret[index] = stat && stat.mtime.getTime()\n cb(null)\n })\n }), FILESYSTEM_CONCURRENCY, err => {\n this._debug('done getting file modtimes')\n cb(err, ret)\n })\n }\n\n _verifyPieces (cb) {\n parallelLimit(this.pieces.map((piece, index) => cb => {\n if (this.destroyed) return cb(new Error('torrent is destroyed'))\n\n const getOpts = {}\n // Specify length for the last piece in case it is zero-padded\n if (index === this.pieces.length - 1) {\n getOpts.length = this.lastPieceLength\n }\n this.store.get(index, getOpts, (err, buf) => {\n if (this.destroyed) return cb(new Error('torrent is destroyed'))\n\n if (err) return queueMicrotask(() => cb(null)) // ignore error\n sha1(buf, hash => {\n if (this.destroyed) return cb(new Error('torrent is destroyed'))\n\n if (hash === this._hashes[index]) {\n this._debug('piece verified %s', index)\n this._markVerified(index)\n } else {\n this._debug('piece invalid %s', index)\n }\n cb(null)\n })\n })\n }), FILESYSTEM_CONCURRENCY, cb)\n }\n\n rescanFiles (cb) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n if (!cb) cb = noop\n\n this._verifyPieces((err) => {\n if (err) {\n this._destroy(err)\n return cb(err)\n }\n\n this._checkDone()\n cb(null)\n })\n }\n\n _markAllVerified () {\n for (let index = 0; index < this.pieces.length; index++) {\n this._markVerified(index)\n }\n }\n\n _markVerified (index) {\n this.pieces[index] = null\n this._reservations[index] = null\n this.bitfield.set(index, true)\n }\n\n /**\n * Called when the metadata, listening server, and underlying chunk store is initialized.\n */\n _onStore () {\n if (this.destroyed) return\n this._debug('on store')\n\n // Start discovery before emitting 'ready'\n this._startDiscovery()\n\n this.ready = true\n this.emit('ready')\n\n // Files may start out done if the file was already in the store\n this._checkDone()\n\n // In case any selections were made before torrent was ready\n this._updateSelections()\n }\n\n destroy (opts, cb) {\n if (typeof opts === 'function') return this.destroy(null, opts)\n\n this._destroy(null, opts, cb)\n }\n\n _destroy (err, opts, cb) {\n if (typeof opts === 'function') return this._destroy(err, null, opts)\n if (this.destroyed) return\n this.destroyed = true\n this._debug('destroy')\n\n this.client._remove(this)\n\n clearInterval(this._rechokeIntervalId)\n\n this._xsRequests.forEach(req => {\n req.abort()\n })\n\n if (this._rarityMap) {\n this._rarityMap.destroy()\n }\n\n for (const id in this._peers) {\n this.removePeer(id)\n }\n\n this.files.forEach(file => {\n if (file instanceof File) file._destroy()\n })\n\n const tasks = this._servers.map(server => cb => {\n server.destroy(cb)\n })\n\n if (this.discovery) {\n tasks.push(cb => {\n this.discovery.destroy(cb)\n })\n }\n\n if (this.store) {\n let destroyStore = this._destroyStoreOnDestroy\n if (opts && opts.destroyStore !== undefined) {\n destroyStore = opts.destroyStore\n }\n tasks.push(cb => {\n if (destroyStore) {\n this.store.destroy(cb)\n } else {\n this.store.close(cb)\n }\n })\n }\n\n parallel(tasks, cb)\n\n if (err) {\n // Torrent errors are emitted at `torrent.on('error')`. If there are no 'error'\n // event handlers on the torrent instance, then the error will be emitted at\n // `client.on('error')`. This prevents throwing an uncaught exception\n // (unhandled 'error' event), but it makes it impossible to distinguish client\n // errors versus torrent errors. Torrent errors are not fatal, and the client\n // is still usable afterwards. Therefore, always listen for errors in both\n // places (`client.on('error')` and `torrent.on('error')`).\n if (this.listenerCount('error') === 0) {\n this.client.emit('error', err)\n } else {\n this.emit('error', err)\n }\n }\n\n this.emit('close')\n\n this.client = null\n this.files = []\n this.discovery = null\n this.store = null\n this._rarityMap = null\n this._peers = null\n this._servers = null\n this._xsRequests = null\n }\n\n addPeer (peer) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n if (!this.infoHash) throw new Error('addPeer() must not be called before the `infoHash` event')\n\n let host\n\n if (this.client.blocked) {\n if (typeof peer === 'string') {\n let parts\n try {\n parts = addrToIPPort(peer)\n } catch (e) {\n this._debug('ignoring peer: invalid %s', peer)\n this.emit('invalidPeer', peer)\n return false\n }\n host = parts[0]\n } else if (typeof peer.remoteAddress === 'string') {\n host = peer.remoteAddress\n }\n\n if (host && this.client.blocked.contains(host)) {\n this._debug('ignoring peer: blocked %s', peer)\n if (typeof peer !== 'string') peer.destroy()\n this.emit('blockedPeer', peer)\n return false\n }\n }\n\n // if the utp connection fails to connect, then it is replaced with a tcp connection to the same ip:port\n\n const type = (this.client.utp && this._isIPv4(host)) ? 'utp' : 'tcp'\n const wasAdded = !!this._addPeer(peer, type)\n\n if (wasAdded) {\n this.emit('peer', peer)\n } else {\n this.emit('invalidPeer', peer)\n }\n return wasAdded\n }\n\n _addPeer (peer, type) {\n if (this.destroyed) {\n if (typeof peer !== 'string') peer.destroy()\n return null\n }\n if (typeof peer === 'string' && !this._validAddr(peer)) {\n this._debug('ignoring peer: invalid %s', peer)\n return null\n }\n\n const id = (peer && peer.id) || peer\n if (this._peers[id]) {\n this._debug('ignoring peer: duplicate (%s)', id)\n if (typeof peer !== 'string') peer.destroy()\n return null\n }\n\n if (this.paused) {\n this._debug('ignoring peer: torrent is paused')\n if (typeof peer !== 'string') peer.destroy()\n return null\n }\n\n this._debug('add peer %s', id)\n\n let newPeer\n if (typeof peer === 'string') {\n // `peer` is an addr (\"ip:port\" string)\n newPeer = type === 'utp'\n ? Peer.createUTPOutgoingPeer(peer, this, this.client.throttleGroups)\n : Peer.createTCPOutgoingPeer(peer, this, this.client.throttleGroups)\n } else {\n // `peer` is a WebRTC connection (simple-peer)\n newPeer = Peer.createWebRTCPeer(peer, this, this.client.throttleGroups)\n }\n\n this._registerPeer(newPeer)\n\n if (typeof peer === 'string') {\n // `peer` is an addr (\"ip:port\" string)\n this._queue.push(newPeer)\n this._drain()\n }\n\n return newPeer\n }\n\n addWebSeed (urlOrConn) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n\n let id\n let conn\n if (typeof urlOrConn === 'string') {\n id = urlOrConn\n\n if (!/^https?:\\/\\/.+/.test(id)) {\n this.emit('warning', new Error(`ignoring invalid web seed: ${id}`))\n this.emit('invalidPeer', id)\n return\n }\n\n if (this._peers[id]) {\n this.emit('warning', new Error(`ignoring duplicate web seed: ${id}`))\n this.emit('invalidPeer', id)\n return\n }\n\n conn = new WebConn(id, this)\n } else if (urlOrConn && typeof urlOrConn.connId === 'string') {\n conn = urlOrConn\n id = conn.connId\n\n if (this._peers[id]) {\n this.emit('warning', new Error(`ignoring duplicate web seed: ${id}`))\n this.emit('invalidPeer', id)\n return\n }\n } else {\n this.emit('warning', new Error('addWebSeed must be passed a string or connection object with id property'))\n return\n }\n\n this._debug('add web seed %s', id)\n\n const newPeer = Peer.createWebSeedPeer(conn, id, this, this.client.throttleGroups)\n\n this._registerPeer(newPeer)\n\n this.emit('peer', id)\n }\n\n /**\n * Called whenever a new incoming TCP peer connects to this torrent swarm. Called with a\n * peer that has already sent a handshake.\n */\n _addIncomingPeer (peer) {\n if (this.destroyed) return peer.destroy(new Error('torrent is destroyed'))\n if (this.paused) return peer.destroy(new Error('torrent is paused'))\n\n this._debug('add incoming peer %s', peer.id)\n\n this._registerPeer(peer)\n }\n\n _registerPeer (newPeer) {\n newPeer.on('download', downloaded => {\n if (this.destroyed) return\n this.received += downloaded\n this._downloadSpeed(downloaded)\n this.client._downloadSpeed(downloaded)\n this.emit('download', downloaded)\n if (this.destroyed) return\n this.client.emit('download', downloaded)\n })\n\n newPeer.on('upload', uploaded => {\n if (this.destroyed) return\n this.uploaded += uploaded\n this._uploadSpeed(uploaded)\n this.client._uploadSpeed(uploaded)\n this.emit('upload', uploaded)\n if (this.destroyed) return\n this.client.emit('upload', uploaded)\n })\n\n this._peers[newPeer.id] = newPeer\n this._peersLength += 1\n }\n\n removePeer (peer) {\n const id = (peer && peer.id) || peer\n peer = this._peers[id]\n\n if (!peer) return\n\n this._debug('removePeer %s', id)\n\n delete this._peers[id]\n this._peersLength -= 1\n\n peer.destroy()\n\n // If torrent swarm was at capacity before, try to open a new connection now\n this._drain()\n }\n\n select (start, end, priority, notify) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n\n if (start < 0 || end < start || this.pieces.length <= end) {\n throw new Error(`invalid selection ${start} : ${end}`)\n }\n priority = Number(priority) || 0\n\n this._debug('select %s-%s (priority %s)', start, end, priority)\n\n this._selections.push({\n from: start,\n to: end,\n offset: 0,\n priority,\n notify: notify || noop\n })\n\n this._selections.sort((a, b) => b.priority - a.priority)\n\n this._updateSelections()\n }\n\n deselect (start, end, priority) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n\n priority = Number(priority) || 0\n this._debug('deselect %s-%s (priority %s)', start, end, priority)\n\n for (let i = 0; i < this._selections.length; ++i) {\n const s = this._selections[i]\n if (s.from === start && s.to === end && s.priority === priority) {\n this._selections.splice(i, 1)\n break\n }\n }\n\n this._updateSelections()\n }\n\n critical (start, end) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n\n this._debug('critical %s-%s', start, end)\n\n for (let i = start; i <= end; ++i) {\n this._critical[i] = true\n }\n\n this._updateSelections()\n }\n\n _onWire (wire, addr) {\n this._debug('got wire %s (%s)', wire._debugId, addr || 'Unknown')\n\n this.wires.push(wire)\n\n if (addr) {\n // Sometimes RTCPeerConnection.getStats() doesn't return an ip:port for peers\n const parts = addrToIPPort(addr)\n wire.remoteAddress = parts[0]\n wire.remotePort = parts[1]\n }\n\n // When peer sends PORT message, add that DHT node to routing table\n if (this.client.dht && this.client.dht.listening) {\n wire.on('port', port => {\n if (this.destroyed || this.client.dht.destroyed) {\n return\n }\n if (!wire.remoteAddress) {\n return this._debug('ignoring PORT from peer with no address')\n }\n if (port === 0 || port > 65536) {\n return this._debug('ignoring invalid PORT from peer')\n }\n\n this._debug('port: %s (from %s)', port, addr)\n this.client.dht.addNode({ host: wire.remoteAddress, port })\n })\n }\n\n wire.on('timeout', () => {\n this._debug('wire timeout (%s)', addr)\n // TODO: this might be destroying wires too eagerly\n wire.destroy()\n })\n\n // Timeout for piece requests to this peer\n if (wire.type !== 'webSeed') { // webseeds always send 'unhave' on http timeout\n wire.setTimeout(PIECE_TIMEOUT, true)\n }\n\n // Send KEEP-ALIVE (every 60s) so peers will not disconnect the wire\n wire.setKeepAlive(true)\n\n // use ut_metadata extension\n wire.use(utMetadata(this.metadata))\n\n wire.ut_metadata.on('warning', err => {\n this._debug('ut_metadata warning: %s', err.message)\n })\n\n if (!this.metadata) {\n wire.ut_metadata.on('metadata', metadata => {\n this._debug('got metadata via ut_metadata')\n this._onMetadata(metadata)\n })\n wire.ut_metadata.fetch()\n }\n\n // use ut_pex extension if the torrent is not flagged as private\n if (typeof utPex === 'function' && !this.private) {\n wire.use(utPex())\n\n wire.ut_pex.on('peer', peer => {\n // Only add potential new peers when we're not seeding\n if (this.done) return\n this._debug('ut_pex: got peer: %s (from %s)', peer, addr)\n this.addPeer(peer)\n })\n\n wire.ut_pex.on('dropped', peer => {\n // the remote peer believes a given peer has been dropped from the torrent swarm.\n // if we're not currently connected to it, then remove it from the queue.\n const peerObj = this._peers[peer]\n if (peerObj && !peerObj.connected) {\n this._debug('ut_pex: dropped peer: %s (from %s)', peer, addr)\n this.removePeer(peer)\n }\n })\n\n wire.once('close', () => {\n // Stop sending updates to remote peer\n wire.ut_pex.reset()\n })\n }\n\n wire.use(ltDontHave())\n\n // Hook to allow user-defined `bittorrent-protocol` extensions\n // More info: https://github.com/webtorrent/bittorrent-protocol#extension-api\n this.emit('wire', wire, addr)\n\n if (this.metadata) {\n queueMicrotask(() => {\n // This allows wire.handshake() to be called (by Peer.onHandshake) before any\n // messages get sent on the wire\n this._onWireWithMetadata(wire)\n })\n }\n }\n\n _onWireWithMetadata (wire) {\n let timeoutId = null\n\n const onChokeTimeout = () => {\n if (this.destroyed || wire.destroyed) return\n\n if (this._numQueued > 2 * (this._numConns - this.numPeers) &&\n wire.amInterested) {\n wire.destroy()\n } else {\n timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT)\n if (timeoutId.unref) timeoutId.unref()\n }\n }\n\n let i\n const updateSeedStatus = () => {\n if (wire.peerPieces.buffer.length !== this.bitfield.buffer.length) return\n for (i = 0; i < this.pieces.length; ++i) {\n if (!wire.peerPieces.get(i)) return\n }\n wire.isSeeder = true\n wire.choke() // always choke seeders\n }\n\n wire.on('bitfield', () => {\n updateSeedStatus()\n this._update()\n this._updateWireInterest(wire)\n })\n\n wire.on('have', () => {\n updateSeedStatus()\n this._update()\n this._updateWireInterest(wire)\n })\n\n wire.lt_donthave.on('donthave', () => {\n updateSeedStatus()\n this._update()\n this._updateWireInterest(wire)\n })\n\n wire.once('interested', () => {\n wire.unchoke()\n })\n\n wire.once('close', () => {\n clearTimeout(timeoutId)\n })\n\n wire.on('choke', () => {\n clearTimeout(timeoutId)\n timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT)\n if (timeoutId.unref) timeoutId.unref()\n })\n\n wire.on('unchoke', () => {\n clearTimeout(timeoutId)\n this._update()\n })\n\n wire.on('request', (index, offset, length, cb) => {\n if (length > MAX_BLOCK_LENGTH) {\n // Per spec, disconnect from peers that request >128KB\n return wire.destroy()\n }\n if (this.pieces[index]) return\n this.store.get(index, { offset, length }, cb)\n })\n\n wire.bitfield(this.bitfield) // always send bitfield (required)\n\n // initialize interest in case bitfield message was already received before above handler was registered\n this._updateWireInterest(wire)\n\n // Send PORT message to peers that support DHT\n if (wire.peerExtensions.dht && this.client.dht && this.client.dht.listening) {\n wire.port(this.client.dht.address().port)\n }\n\n if (wire.type !== 'webSeed') { // do not choke on webseeds\n timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT)\n if (timeoutId.unref) timeoutId.unref()\n }\n\n wire.isSeeder = false\n updateSeedStatus()\n }\n\n /**\n * Called on selection changes.\n */\n _updateSelections () {\n if (!this.ready || this.destroyed) return\n\n queueMicrotask(() => {\n this._gcSelections()\n })\n this._updateInterest()\n this._update()\n }\n\n /**\n * Garbage collect selections with respect to the store's current state.\n */\n _gcSelections () {\n for (let i = 0; i < this._selections.length; ++i) {\n const s = this._selections[i]\n const oldOffset = s.offset\n\n // check for newly downloaded pieces in selection\n while (this.bitfield.get(s.from + s.offset) && s.from + s.offset < s.to) {\n s.offset += 1\n }\n\n if (oldOffset !== s.offset) s.notify()\n if (s.to !== s.from + s.offset) continue\n if (!this.bitfield.get(s.from + s.offset)) continue\n\n this._selections.splice(i, 1) // remove fully downloaded selection\n i -= 1 // decrement i to offset splice\n\n s.notify()\n this._updateInterest()\n }\n\n if (!this._selections.length) this.emit('idle')\n }\n\n /**\n * Update interested status for all peers.\n */\n _updateInterest () {\n const prev = this._amInterested\n this._amInterested = !!this._selections.length\n\n this.wires.forEach(wire => this._updateWireInterest(wire))\n\n if (prev === this._amInterested) return\n if (this._amInterested) this.emit('interested')\n else this.emit('uninterested')\n }\n\n _updateWireInterest (wire) {\n let interested = false\n for (let index = 0; index < this.pieces.length; ++index) {\n if (this.pieces[index] && wire.peerPieces.get(index)) {\n interested = true\n break\n }\n }\n\n if (interested) wire.interested()\n else wire.uninterested()\n }\n\n /**\n * Heartbeat to update all peers and their requests.\n */\n _update () {\n if (this.destroyed) return\n\n // update wires in random order for better request distribution\n const ite = randomIterate(this.wires)\n let wire\n while ((wire = ite())) {\n this._updateWireWrapper(wire)\n }\n }\n\n _updateWireWrapper (wire) {\n const self = this\n\n if (typeof window !== 'undefined' && typeof window.requestIdleCallback === 'function') {\n window.requestIdleCallback(() => { self._updateWire(wire) }, { timeout: 250 })\n } else {\n self._updateWire(wire)\n }\n }\n\n /**\n * Attempts to update a peer's requests\n */\n _updateWire (wire) {\n // to allow function hoisting\n const self = this\n\n if (wire.peerChoking) return\n if (!wire.downloaded) return validateWire()\n\n const minOutstandingRequests = getBlockPipelineLength(wire, PIPELINE_MIN_DURATION)\n if (wire.requests.length >= minOutstandingRequests) return\n const maxOutstandingRequests = getBlockPipelineLength(wire, PIPELINE_MAX_DURATION)\n\n trySelectWire(false) || trySelectWire(true)\n\n function genPieceFilterFunc (start, end, tried, rank) {\n return i => i >= start && i <= end && !(i in tried) && wire.peerPieces.get(i) && (!rank || rank(i))\n }\n\n // TODO: Do we need both validateWire and trySelectWire?\n function validateWire () {\n if (wire.requests.length) return\n\n let i = self._selections.length\n while (i--) {\n const next = self._selections[i]\n let piece\n if (self.strategy === 'rarest') {\n const start = next.from + next.offset\n const end = next.to\n const len = end - start + 1\n const tried = {}\n let tries = 0\n const filter = genPieceFilterFunc(start, end, tried)\n\n while (tries < len) {\n piece = self._rarityMap.getRarestPiece(filter)\n if (piece < 0) break\n if (self._request(wire, piece, false)) return\n tried[piece] = true\n tries += 1\n }\n } else {\n for (piece = next.to; piece >= next.from + next.offset; --piece) {\n if (!wire.peerPieces.get(piece)) continue\n if (self._request(wire, piece, false)) return\n }\n }\n }\n\n // TODO: wire failed to validate as useful; should we close it?\n // probably not, since 'have' and 'bitfield' messages might be coming\n }\n\n function speedRanker () {\n const speed = wire.downloadSpeed() || 1\n if (speed > SPEED_THRESHOLD) return () => true\n\n const secs = Math.max(1, wire.requests.length) * Piece.BLOCK_LENGTH / speed\n let tries = 10\n let ptr = 0\n\n return index => {\n if (!tries || self.bitfield.get(index)) return true\n\n let missing = self.pieces[index].missing\n\n for (; ptr < self.wires.length; ptr++) {\n const otherWire = self.wires[ptr]\n const otherSpeed = otherWire.downloadSpeed()\n\n if (otherSpeed < SPEED_THRESHOLD) continue\n if (otherSpeed <= speed) continue\n if (!otherWire.peerPieces.get(index)) continue\n if ((missing -= otherSpeed * secs) > 0) continue\n\n tries--\n return false\n }\n\n return true\n }\n }\n\n function shufflePriority (i) {\n let last = i\n for (let j = i; j < self._selections.length && self._selections[j].priority; j++) {\n last = j\n }\n const tmp = self._selections[i]\n self._selections[i] = self._selections[last]\n self._selections[last] = tmp\n }\n\n function trySelectWire (hotswap) {\n if (wire.requests.length >= maxOutstandingRequests) return true\n const rank = speedRanker()\n\n for (let i = 0; i < self._selections.length; i++) {\n const next = self._selections[i]\n\n let piece\n if (self.strategy === 'rarest') {\n const start = next.from + next.offset\n const end = next.to\n const len = end - start + 1\n const tried = {}\n let tries = 0\n const filter = genPieceFilterFunc(start, end, tried, rank)\n\n while (tries < len) {\n piece = self._rarityMap.getRarestPiece(filter)\n if (piece < 0) break\n\n while (self._request(wire, piece, self._critical[piece] || hotswap)) {\n // body intentionally empty\n // request all non-reserved blocks in this piece\n }\n\n if (wire.requests.length < maxOutstandingRequests) {\n tried[piece] = true\n tries++\n continue\n }\n\n if (next.priority) shufflePriority(i)\n return true\n }\n } else {\n for (piece = next.from + next.offset; piece <= next.to; piece++) {\n if (!wire.peerPieces.get(piece) || !rank(piece)) continue\n\n while (self._request(wire, piece, self._critical[piece] || hotswap)) {\n // body intentionally empty\n // request all non-reserved blocks in piece\n }\n\n if (wire.requests.length < maxOutstandingRequests) continue\n\n if (next.priority) shufflePriority(i)\n return true\n }\n }\n }\n\n return false\n }\n }\n\n /**\n * Called periodically to update the choked status of all peers, handling optimistic\n * unchoking as described in BEP3.\n */\n _rechoke () {\n if (!this.ready) return\n\n // wires in increasing order of quality (pop() gives next best peer)\n const wireStack =\n this.wires\n .map(wire => ({ wire, random: Math.random() })) // insert a random seed for randomizing the sort\n .sort((objA, objB) => {\n const wireA = objA.wire\n const wireB = objB.wire\n\n // prefer peers that send us data faster\n if (wireA.downloadSpeed() !== wireB.downloadSpeed()) {\n return wireA.downloadSpeed() - wireB.downloadSpeed()\n }\n\n // then prefer peers that can download data from us faster\n if (wireA.uploadSpeed() !== wireB.uploadSpeed()) {\n return wireA.uploadSpeed() - wireB.uploadSpeed()\n }\n\n // then prefer already unchoked peers (to minimize fibrillation)\n if (wireA.amChoking !== wireB.amChoking) {\n return wireA.amChoking ? -1 : 1 // choking < unchoked\n }\n\n // otherwise random order\n return objA.random - objB.random\n })\n .map(obj => obj.wire) // return array of wires (remove random seed)\n\n if (this._rechokeOptimisticTime <= 0) {\n // clear old optimistic peer, so it can be rechoked normally and then replaced\n this._rechokeOptimisticWire = null\n } else {\n this._rechokeOptimisticTime -= 1\n }\n\n let numInterestedUnchoked = 0\n // leave one rechoke slot open for optimistic unchoking\n while (wireStack.length > 0 && numInterestedUnchoked < this._rechokeNumSlots - 1) {\n const wire = wireStack.pop() // next best quality peer\n\n if (wire.isSeeder || wire === this._rechokeOptimisticWire) {\n continue\n }\n\n wire.unchoke()\n\n // only stop unchoking once we fill the slots with interested peers that will actually download\n if (wire.peerInterested) {\n numInterestedUnchoked++\n }\n }\n\n // fill optimistic unchoke slot if empty\n if (this._rechokeOptimisticWire === null && this._rechokeNumSlots > 0) {\n // don't optimistically unchoke uninterested peers\n const remaining = wireStack.filter(wire => wire.peerInterested)\n\n if (remaining.length > 0) {\n // select random remaining (not yet unchoked) peer\n const newOptimisticPeer = remaining[randomInt(remaining.length)]\n\n newOptimisticPeer.unchoke()\n\n this._rechokeOptimisticWire = newOptimisticPeer\n\n this._rechokeOptimisticTime = RECHOKE_OPTIMISTIC_DURATION\n }\n }\n\n // choke the rest\n wireStack\n .filter(wire => wire !== this._rechokeOptimisticWire) // except the optimistically unchoked peer\n .forEach(wire => wire.choke())\n }\n\n /**\n * Attempts to cancel a slow block request from another wire such that the\n * given wire may effectively swap out the request for one of its own.\n */\n _hotswap (wire, index) {\n const speed = wire.downloadSpeed()\n if (speed < Piece.BLOCK_LENGTH) return false\n if (!this._reservations[index]) return false\n\n const r = this._reservations[index]\n if (!r) {\n return false\n }\n\n let minSpeed = Infinity\n let minWire\n\n let i\n for (i = 0; i < r.length; i++) {\n const otherWire = r[i]\n if (!otherWire || otherWire === wire) continue\n\n const otherSpeed = otherWire.downloadSpeed()\n if (otherSpeed >= SPEED_THRESHOLD) continue\n if (2 * otherSpeed > speed || otherSpeed > minSpeed) continue\n\n minWire = otherWire\n minSpeed = otherSpeed\n }\n\n if (!minWire) return false\n\n for (i = 0; i < r.length; i++) {\n if (r[i] === minWire) r[i] = null\n }\n\n for (i = 0; i < minWire.requests.length; i++) {\n const req = minWire.requests[i]\n if (req.piece !== index) continue\n\n this.pieces[index].cancel((req.offset / Piece.BLOCK_LENGTH) | 0)\n }\n\n this.emit('hotswap', minWire, wire, index)\n return true\n }\n\n /**\n * Attempts to request a block from the given wire.\n */\n _request (wire, index, hotswap) {\n const self = this\n const numRequests = wire.requests.length\n const isWebSeed = wire.type === 'webSeed'\n\n if (self.bitfield.get(index)) return false\n\n const maxOutstandingRequests = isWebSeed\n ? Math.min(\n getPiecePipelineLength(wire, PIPELINE_MAX_DURATION, self.pieceLength),\n self.maxWebConns\n )\n : getBlockPipelineLength(wire, PIPELINE_MAX_DURATION)\n\n if (numRequests >= maxOutstandingRequests) return false\n // var endGame = (wire.requests.length === 0 && self.store.numMissing < 30)\n\n const piece = self.pieces[index]\n let reservation = isWebSeed ? piece.reserveRemaining() : piece.reserve()\n\n if (reservation === -1 && hotswap && self._hotswap(wire, index)) {\n reservation = isWebSeed ? piece.reserveRemaining() : piece.reserve()\n }\n if (reservation === -1) return false\n\n let r = self._reservations[index]\n if (!r) r = self._reservations[index] = []\n let i = r.indexOf(null)\n if (i === -1) i = r.length\n r[i] = wire\n\n const chunkOffset = piece.chunkOffset(reservation)\n const chunkLength = isWebSeed ? piece.chunkLengthRemaining(reservation) : piece.chunkLength(reservation)\n\n wire.request(index, chunkOffset, chunkLength, function onChunk (err, chunk) {\n if (self.destroyed) return\n\n // TODO: what is this for?\n if (!self.ready) return self.once('ready', () => { onChunk(err, chunk) })\n\n if (r[i] === wire) r[i] = null\n\n if (piece !== self.pieces[index]) return onUpdateTick()\n\n if (err) {\n self._debug(\n 'error getting piece %s (offset: %s length: %s) from %s: %s',\n index, chunkOffset, chunkLength, `${wire.remoteAddress}:${wire.remotePort}`,\n err.message\n )\n isWebSeed ? piece.cancelRemaining(reservation) : piece.cancel(reservation)\n onUpdateTick()\n return\n }\n\n self._debug(\n 'got piece %s (offset: %s length: %s) from %s',\n index, chunkOffset, chunkLength, `${wire.remoteAddress}:${wire.remotePort}`\n )\n\n if (!piece.set(reservation, chunk, wire)) return onUpdateTick()\n\n const buf = piece.flush()\n\n // TODO: might need to set self.pieces[index] = null here since sha1 is async\n\n sha1(buf, hash => {\n if (self.destroyed) return\n\n if (hash === self._hashes[index]) {\n self._debug('piece verified %s', index)\n\n self.store.put(index, buf, err => {\n if (err) {\n self._destroy(err)\n return\n } else {\n self.pieces[index] = null\n self._markVerified(index)\n self.wires.forEach(wire => {\n wire.have(index)\n })\n }\n // We also check `self.destroyed` since `torrent.destroy()` could have been\n // called in the `torrent.on('done')` handler, triggered by `_checkDone()`.\n if (self._checkDone() && !self.destroyed) self.discovery.complete()\n onUpdateTick()\n })\n } else {\n self.pieces[index] = new Piece(piece.length)\n self.emit('warning', new Error(`Piece ${index} failed verification`))\n onUpdateTick()\n }\n })\n })\n\n function onUpdateTick () {\n queueMicrotask(() => { self._update() })\n }\n\n return true\n }\n\n _checkDone () {\n if (this.destroyed) return\n\n // are any new files done?\n this.files.forEach(file => {\n if (file.done) return\n for (let i = file._startPiece; i <= file._endPiece; ++i) {\n if (!this.bitfield.get(i)) return\n }\n file.done = true\n file.emit('done')\n this._debug(`file done: ${file.name}`)\n })\n\n // is the torrent done? (if all current selections are satisfied, or there are\n // no selections, then torrent is done)\n let done = true\n\n for (const selection of this._selections) {\n for (let piece = selection.from; piece <= selection.to; piece++) {\n if (!this.bitfield.get(piece)) {\n done = false\n break\n }\n }\n if (!done) break\n }\n\n if (!this.done && done) {\n this.done = true\n this._debug(`torrent done: ${this.infoHash}`)\n this.emit('done')\n }\n this._gcSelections()\n\n return done\n }\n\n load (streams, cb) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n if (!this.ready) return this.once('ready', () => { this.load(streams, cb) })\n\n if (!Array.isArray(streams)) streams = [streams]\n if (!cb) cb = noop\n\n const readable = new MultiStream(streams)\n const writable = new ChunkStoreWriteStream(this.store, this.pieceLength)\n\n pump(readable, writable, err => {\n if (err) return cb(err)\n this._markAllVerified()\n this._checkDone()\n cb(null)\n })\n }\n\n createServer (requestListener) {\n if (typeof Server !== 'function') throw new Error('node.js-only method')\n if (this.destroyed) throw new Error('torrent is destroyed')\n const server = new Server(this, requestListener)\n this._servers.push(server)\n return server\n }\n\n pause () {\n if (this.destroyed) return\n this._debug('pause')\n this.paused = true\n }\n\n resume () {\n if (this.destroyed) return\n this._debug('resume')\n this.paused = false\n this._drain()\n }\n\n _debug () {\n const args = [].slice.call(arguments)\n args[0] = `[${this.client ? this.client._debugId : 'No Client'}] [${this._debugId}] ${args[0]}`\n debug(...args)\n }\n\n /**\n * Pop a peer off the FIFO queue and connect to it. When _drain() gets called,\n * the queue will usually have only one peer in it, except when there are too\n * many peers (over `this.maxConns`) in which case they will just sit in the\n * queue until another connection closes.\n */\n _drain () {\n this._debug('_drain numConns %s maxConns %s', this._numConns, this.client.maxConns)\n if (typeof net.connect !== 'function' || this.destroyed || this.paused ||\n this._numConns >= this.client.maxConns) {\n return\n }\n this._debug('drain (%s queued, %s/%s peers)', this._numQueued, this.numPeers, this.client.maxConns)\n\n const peer = this._queue.shift()\n if (!peer) return // queue could be empty\n\n this._debug('%s connect attempt to %s', peer.type, peer.addr)\n\n const parts = addrToIPPort(peer.addr)\n const opts = {\n host: parts[0],\n port: parts[1]\n }\n\n if (this.client.utp && peer.type === 'utpOutgoing') {\n peer.conn = utp.connect(opts.port, opts.host)\n } else {\n peer.conn = net.connect(opts)\n }\n\n const conn = peer.conn\n\n conn.once('connect', () => { peer.onConnect() })\n conn.once('error', err => { peer.destroy(err) })\n peer.startConnectTimeout()\n\n // When connection closes, attempt reconnect after timeout (with exponential backoff)\n conn.on('close', () => {\n if (this.destroyed) return\n\n if (peer.retries >= RECONNECT_WAIT.length) {\n if (this.client.utp) {\n const newPeer = this._addPeer(peer.addr, 'tcp')\n if (newPeer) newPeer.retries = 0\n } else {\n this._debug(\n 'conn %s closed: will not re-add (max %s attempts)',\n peer.addr, RECONNECT_WAIT.length\n )\n }\n return\n }\n\n const ms = RECONNECT_WAIT[peer.retries]\n this._debug(\n 'conn %s closed: will re-add to queue in %sms (attempt %s)',\n peer.addr, ms, peer.retries + 1\n )\n\n const reconnectTimeout = setTimeout(() => {\n if (this.destroyed) return\n const host = addrToIPPort(peer.addr)[0]\n const type = (this.client.utp && this._isIPv4(host)) ? 'utp' : 'tcp'\n const newPeer = this._addPeer(peer.addr, type)\n if (newPeer) newPeer.retries = peer.retries + 1\n }, ms)\n if (reconnectTimeout.unref) reconnectTimeout.unref()\n })\n }\n\n /**\n * Returns `true` if string is valid IPv4/6 address.\n * @param {string} addr\n * @return {boolean}\n */\n _validAddr (addr) {\n let parts\n try {\n parts = addrToIPPort(addr)\n } catch (e) {\n return false\n }\n const host = parts[0]\n const port = parts[1]\n return port > 0 && port < 65535 &&\n !(host === '127.0.0.1' && port === this.client.torrentPort)\n }\n\n /**\n * Return `true` if string is a valid IPv4 address.\n * @param {string} addr\n * @return {boolean}\n */\n _isIPv4 (addr) {\n const IPv4Pattern = /^((?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])[.]){3}(?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])$/\n return IPv4Pattern.test(addr)\n }\n}\n\nfunction getBlockPipelineLength (wire, duration) {\n return 2 + Math.ceil(duration * wire.downloadSpeed() / Piece.BLOCK_LENGTH)\n}\n\nfunction getPiecePipelineLength (wire, duration, pieceLength) {\n return 1 + Math.ceil(duration * wire.downloadSpeed() / pieceLength)\n}\n\n/**\n * Returns a random integer in [0,high)\n */\nfunction randomInt (high) {\n return Math.random() * high | 0\n}\n\nfunction noop () {}\n\nmodule.exports = Torrent\n","const BitField = require('bitfield').default\nconst debug = require('debug')('webtorrent:webconn')\nconst get = require('simple-get')\nconst ltDontHave = require('lt_donthave')\nconst sha1 = require('simple-sha1')\nconst Wire = require('bittorrent-protocol')\n\nconst VERSION = require('../package.json').version\n\nconst SOCKET_TIMEOUT = 60000\nconst RETRY_DELAY = 10000\n\n/**\n * Converts requests for torrent blocks into http range requests.\n * @param {string} url web seed url\n * @param {Object} torrent\n */\nclass WebConn extends Wire {\n constructor (url, torrent) {\n super()\n\n this.url = url\n this.connId = url // Unique id to deduplicate web seeds\n this.webPeerId = sha1.sync(url) // Used as the peerId for this fake remote peer\n this._torrent = torrent\n\n this._init()\n }\n\n _init () {\n this.setKeepAlive(true)\n\n this.use(ltDontHave())\n\n this.once('handshake', (infoHash, peerId) => {\n if (this.destroyed) return\n this.handshake(infoHash, this.webPeerId)\n const numPieces = this._torrent.pieces.length\n const bitfield = new BitField(numPieces)\n for (let i = 0; i <= numPieces; i++) {\n bitfield.set(i, true)\n }\n this.bitfield(bitfield)\n })\n\n this.once('interested', () => {\n debug('interested')\n this.unchoke()\n })\n\n this.on('uninterested', () => { debug('uninterested') })\n this.on('choke', () => { debug('choke') })\n this.on('unchoke', () => { debug('unchoke') })\n this.on('bitfield', () => { debug('bitfield') })\n this.lt_donthave.on('donthave', () => { debug('donthave') })\n\n this.on('request', (pieceIndex, offset, length, callback) => {\n debug('request pieceIndex=%d offset=%d length=%d', pieceIndex, offset, length)\n this.httpRequest(pieceIndex, offset, length, (err, data) => {\n if (err) {\n // Cancel all in progress requests for this piece\n this.lt_donthave.donthave(pieceIndex)\n\n // Wait a little while before saying the webseed has the failed piece again\n const retryTimeout = setTimeout(() => {\n if (this.destroyed) return\n\n this.have(pieceIndex)\n }, RETRY_DELAY)\n if (retryTimeout.unref) retryTimeout.unref()\n }\n\n callback(err, data)\n })\n })\n }\n\n httpRequest (pieceIndex, offset, length, cb) {\n const pieceOffset = pieceIndex * this._torrent.pieceLength\n const rangeStart = pieceOffset + offset /* offset within whole torrent */\n const rangeEnd = rangeStart + length - 1\n\n // Web seed URL format:\n // For single-file torrents, make HTTP range requests directly to the web seed URL\n // For multi-file torrents, add the torrent folder and file name to the URL\n const files = this._torrent.files\n let requests\n if (files.length <= 1) {\n requests = [{\n url: this.url,\n start: rangeStart,\n end: rangeEnd\n }]\n } else {\n const requestedFiles = files.filter(file => file.offset <= rangeEnd && (file.offset + file.length) > rangeStart)\n if (requestedFiles.length < 1) {\n return cb(new Error('Could not find file corresponding to web seed range request'))\n }\n\n requests = requestedFiles.map(requestedFile => {\n const fileEnd = requestedFile.offset + requestedFile.length - 1\n const url = this.url +\n (this.url[this.url.length - 1] === '/' ? '' : '/') +\n requestedFile.path\n return {\n url,\n fileOffsetInRange: Math.max(requestedFile.offset - rangeStart, 0),\n start: Math.max(rangeStart - requestedFile.offset, 0),\n end: Math.min(fileEnd, rangeEnd - requestedFile.offset)\n }\n })\n }\n\n // Now make all the HTTP requests we need in order to load this piece\n // Usually that's one requests, but sometimes it will be multiple\n // Send requests in parallel and wait for them all to come back\n let numRequestsSucceeded = 0\n let hasError = false\n\n let ret\n if (requests.length > 1) {\n ret = Buffer.alloc(length)\n }\n\n requests.forEach(request => {\n const url = request.url\n const start = request.start\n const end = request.end\n debug(\n 'Requesting url=%s pieceIndex=%d offset=%d length=%d start=%d end=%d',\n url, pieceIndex, offset, length, start, end\n )\n const opts = {\n url,\n method: 'GET',\n headers: {\n 'user-agent': `WebTorrent/${VERSION} (https://webtorrent.io)`,\n range: `bytes=${start}-${end}`\n },\n timeout: SOCKET_TIMEOUT\n }\n function onResponse (res, data) {\n if (res.statusCode < 200 || res.statusCode >= 300) {\n if (hasError) return\n hasError = true\n return cb(new Error(`Unexpected HTTP status code ${res.statusCode}`))\n }\n debug('Got data of length %d', data.length)\n\n if (requests.length === 1) {\n // Common case: fetch piece in a single HTTP request, return directly\n cb(null, data)\n } else {\n // Rare case: reconstruct multiple HTTP requests across 2+ files into one\n // piece buffer\n data.copy(ret, request.fileOffsetInRange)\n if (++numRequestsSucceeded === requests.length) {\n cb(null, ret)\n }\n }\n }\n get.concat(opts, (err, res, data) => {\n if (hasError) return\n if (err) {\n // Browsers allow HTTP redirects for simple cross-origin\n // requests but not for requests that require preflight.\n // Use a simple request to unravel any redirects and get the\n // final URL. Retry the original request with the new URL if\n // it's different.\n //\n // This test is imperfect but it's simple and good for common\n // cases. It catches all cross-origin cases but matches a few\n // same-origin cases too.\n if (typeof window === 'undefined' || url.startsWith(`${window.location.origin}/`)) {\n hasError = true\n return cb(err)\n }\n\n return get.head(url, (errHead, res) => {\n if (hasError) return\n if (errHead) {\n hasError = true\n return cb(errHead)\n }\n if (res.statusCode < 200 || res.statusCode >= 300) {\n hasError = true\n return cb(new Error(`Unexpected HTTP status code ${res.statusCode}`))\n }\n if (res.url === url) {\n hasError = true\n return cb(err)\n }\n\n opts.url = res.url\n get.concat(opts, (err, res, data) => {\n if (hasError) return\n if (err) {\n hasError = true\n return cb(err)\n }\n onResponse(res, data)\n })\n })\n }\n onResponse(res, data)\n })\n })\n }\n\n destroy () {\n super.destroy()\n this._torrent = null\n }\n}\n\nmodule.exports = WebConn\n","'use strict';\n\nvar forEach = require('foreach');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasSymbols = require('has-symbols')();\nvar hasToStringTag = hasSymbols && typeof Symbol.toStringTag === 'symbol';\n\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\nvar toStrTags = {};\nvar gOPD = require('es-abstract/helpers/getOwnPropertyDescriptor');\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tif (typeof global[typedArray] === 'function') {\n\t\t\tvar arr = new global[typedArray]();\n\t\t\tif (!(Symbol.toStringTag in arr)) {\n\t\t\t\tthrow new EvalError('this engine has support for Symbol.toStringTag, but ' + typedArray + ' does not have the property! Please report this.');\n\t\t\t}\n\t\t\tvar proto = getPrototypeOf(arr);\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor) {\n\t\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\ttoStrTags[typedArray] = descriptor.get;\n\t\t}\n\t});\n}\n\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\tvar foundName = false;\n\tforEach(toStrTags, function (getter, typedArray) {\n\t\tif (!foundName) {\n\t\t\ttry {\n\t\t\t\tvar name = getter.call(value);\n\t\t\t\tif (name === typedArray) {\n\t\t\t\t\tfoundName = name;\n\t\t\t\t}\n\t\t\t} catch (e) {}\n\t\t}\n\t});\n\treturn foundName;\n};\n\nvar isTypedArray = require('is-typed-array');\n\nmodule.exports = function whichTypedArray(value) {\n\tif (!isTypedArray(value)) { return false; }\n\tif (!hasToStringTag) { return $slice($toString(value), 8, -1); }\n\treturn tryTypedArrays(value);\n};\n","// Returns a wrapper function that returns a wrapped callback\n// The wrapper function should do some stuff, and return a\n// presumably different callback function.\n// This makes sure that own properties are retained, so that\n// decorations and such are not lost along the way.\nmodule.exports = wrappy\nfunction wrappy (fn, cb) {\n if (fn && cb) return wrappy(fn)(cb)\n\n if (typeof fn !== 'function')\n throw new TypeError('need wrapper function')\n\n Object.keys(fn).forEach(function (k) {\n wrapper[k] = fn[k]\n })\n\n return wrapper\n\n function wrapper() {\n var args = new Array(arguments.length)\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i]\n }\n var ret = fn.apply(this, args)\n var cb = args[args.length-1]\n if (typeof ret === 'function' && ret !== cb) {\n Object.keys(cb).forEach(function (k) {\n ret[k] = cb[k]\n })\n }\n return ret\n }\n}\n","module.exports = extend\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nfunction extend() {\n var target = {}\n\n for (var i = 0; i < arguments.length; i++) {\n var source = arguments[i]\n\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n target[key] = source[key]\n }\n }\n }\n\n return target\n}\n","module.exports = anitomyscript;","module.exports = halfmoon;","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","/* (ignored) */","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","","// startup\n// Load entry module and return exports\n// This entry module is referenced by other modules so it can't be inlined\nvar __webpack_exports__ = __webpack_require__(\"./app/js/main.js\");\n",""],"names":[],"sourceRoot":""} \ No newline at end of file +{"version":3,"file":"bundle.js","mappings":";sBAAA,MAAMA,EAAU,wBAEhB,IAAIC,EAAQ,IAAIC,IAIhBC,EAAOC,QAAU,SAAuBC,GAEtC,GADmB,MAAfJ,EAAMK,MAAiBL,EAAMM,SAC5BN,EAAMO,IAAIH,GAAO,CACpB,MAAMI,EAAIT,EAAQU,KAAKL,GACvB,IAAKI,EAAG,MAAM,IAAIE,MAAM,iBAAiBN,KACzCJ,EAAMW,IAAIP,EAAM,CAAEI,EAAE,GAAII,OAAOJ,EAAE,MAEnC,OAAOR,EAAMa,IAAIT,iCCXnB,MAAMU,EAAOX,EAEbW,EAAKC,OAAS,EAAQ,MAEtBD,EAAKE,OAAS,eACdF,EAAKG,KAAO,EAAQ,MACpBH,EAAKI,UAAY,EAAQ,MACzBJ,EAAKK,SAAW,EAAQ,MACxBL,EAAKM,SAAW,EAAQ,mCCRxB,MAAMA,EAAW,EAAQ,MACnBD,EAAW,EAAQ,MACnBE,EAAW,EAAQ,MAQzB,SAASC,EAAOC,EAAMC,GACpBC,KAAKF,KAAOA,EACZE,KAAKD,KAAOA,EAEZC,KAAKN,SAAW,GAChBM,KAAKL,SAAW,GAXNjB,EAERa,OAAS,SAAgBO,EAAMC,GACjC,OAAO,IAAIF,EAAOC,EAAMC,IAW1BF,EAAOI,UAAUC,aAAe,SAAqBC,GACnD,MAAML,EAAOE,KAAKF,KAElB,SAASM,EAAUC,GACjBL,KAAKM,WAAWD,EAAQP,GAO1B,OALAF,EAASQ,EAAWD,GACpBC,EAAUH,UAAUK,WAAa,SAAoBD,EAAQP,GAC3DK,EAAKI,KAAKP,KAAMK,EAAQP,IAGnB,IAAIM,EAAUJ,OAGvBH,EAAOI,UAAUO,YAAc,SAAqBC,GAKlD,OAJAA,EAAMA,GAAO,MAERT,KAAKN,SAASgB,eAAeD,KAChCT,KAAKN,SAASe,GAAOT,KAAKE,aAAaR,EAASe,KAC3CT,KAAKN,SAASe,IAGvBZ,EAAOI,UAAUU,OAAS,SAAgBC,EAAMH,EAAKI,GACnD,OAAOb,KAAKQ,YAAYC,GAAKE,OAAOC,EAAMC,IAG5ChB,EAAOI,UAAUa,YAAc,SAAqBL,GAKlD,OAJAA,EAAMA,GAAO,MAERT,KAAKL,SAASe,eAAeD,KAChCT,KAAKL,SAASc,GAAOT,KAAKE,aAAaP,EAASc,KAC3CT,KAAKL,SAASc,IAGvBZ,EAAOI,UAAUc,OAAS,SAAgBH,EAAMH,EAAoBO,GAClE,OAAOhB,KAAKc,YAAYL,GAAKM,OAAOH,EAAMI,iCCrD5C,MAAMpB,EAAW,EAAQ,MACnBqB,EAAW,UACXC,EAAS,eAEf,SAASC,EAAc3B,EAAMqB,GAC3BI,EAASV,KAAKP,KAAMa,GACfK,EAAOE,SAAS5B,IAKrBQ,KAAKR,KAAOA,EACZQ,KAAKqB,OAAS,EACdrB,KAAKsB,OAAS9B,EAAK8B,QANjBtB,KAAKuB,MAAM,oBA8Ef,SAASC,EAAcC,EAAOT,GAC5B,GAAIU,MAAMC,QAAQF,GAChBzB,KAAKsB,OAAS,EACdtB,KAAKyB,MAAQA,EAAMG,KAAI,SAASC,GAI9B,OAHKL,EAAcM,gBAAgBD,KACjCA,EAAO,IAAIL,EAAcK,EAAMb,IACjChB,KAAKsB,QAAUO,EAAKP,OACbO,IACN7B,WACE,GAAqB,iBAAVyB,EAAoB,CACpC,KAAM,GAAKA,GAASA,GAAS,KAC3B,OAAOT,EAASO,MAAM,gCACxBvB,KAAKyB,MAAQA,EACbzB,KAAKsB,OAAS,OACT,GAAqB,iBAAVG,EAChBzB,KAAKyB,MAAQA,EACbzB,KAAKsB,OAASJ,EAAOa,WAAWN,OAC3B,KAAIP,EAAOE,SAASK,GAIzB,OAAOT,EAASO,MAAM,4BAA8BE,GAHpDzB,KAAKyB,MAAQA,EACbzB,KAAKsB,OAASG,EAAMH,QAzFxB1B,EAASuB,EAAeF,GACxBvC,EAAQ,EAAgByC,EAExBA,EAAca,gBAAkB,SAAyBpB,GACvD,OAAIA,aAAgBO,GAKiB,iBAATP,GAC1BM,EAAOE,SAASR,EAAKpB,OACK,kBAA1BoB,EAAKqB,YAAYnC,MACM,iBAAhBc,EAAKS,QACW,iBAAhBT,EAAKU,QACS,mBAAdV,EAAKsB,MACY,mBAAjBtB,EAAKuB,SACY,mBAAjBvB,EAAKwB,SACc,mBAAnBxB,EAAKyB,WACS,mBAAdzB,EAAK0B,MACQ,mBAAb1B,EAAK2B,KAKhBpB,EAAclB,UAAUiC,KAAO,WAC7B,MAAO,CAAEb,OAAQrB,KAAKqB,OAAQL,SAAUC,EAAShB,UAAUiC,KAAK3B,KAAKP,QAGvEmB,EAAclB,UAAUkC,QAAU,SAAiBD,GAEjD,MAAMM,EAAM,IAAIrB,EAAcnB,KAAKR,MAOnC,OANAgD,EAAInB,OAASa,EAAKb,OAClBmB,EAAIlB,OAAStB,KAAKqB,OAElBrB,KAAKqB,OAASa,EAAKb,OACnBJ,EAAShB,UAAUkC,QAAQ5B,KAAKP,KAAMkC,EAAKlB,UAEpCwB,GAGTrB,EAAclB,UAAUmC,QAAU,WAChC,OAAOpC,KAAKqB,SAAWrB,KAAKsB,QAG9BH,EAAclB,UAAUoC,UAAY,SAAmBI,GACrD,OAAIzC,KAAKqB,OAAS,GAAKrB,KAAKsB,OACnBtB,KAAKR,KAAK6C,UAAUrC,KAAKqB,UAAU,GAEnCrB,KAAKuB,MAAMkB,GAAQ,0BAG9BtB,EAAclB,UAAUqC,KAAO,SAAcI,EAAOD,GAClD,KAAMzC,KAAKqB,OAASqB,GAAS1C,KAAKsB,QAChC,OAAOtB,KAAKuB,MAAMkB,GAAQ,yBAE5B,MAAMD,EAAM,IAAIrB,EAAcnB,KAAKR,MAQnC,OALAgD,EAAIG,eAAiB3C,KAAK2C,eAE1BH,EAAInB,OAASrB,KAAKqB,OAClBmB,EAAIlB,OAAStB,KAAKqB,OAASqB,EAC3B1C,KAAKqB,QAAUqB,EACRF,GAGTrB,EAAclB,UAAUsC,IAAM,SAAaL,GACzC,OAAOlC,KAAKR,KAAKoD,MAAMV,EAAOA,EAAKb,OAASrB,KAAKqB,OAAQrB,KAAKsB,SA2BhE5C,EAAQ,EAAgB8C,EAExBA,EAAcM,gBAAkB,SAAyBlB,GACvD,OAAIA,aAAgBY,GAKiB,iBAATZ,GACA,kBAA1BA,EAAKqB,YAAYnC,MACM,iBAAhBc,EAAKU,QACS,mBAAdV,EAAKiC,MAKhBrB,EAAcvB,UAAU4C,KAAO,SAAcC,EAAKzB,GAMhD,OALKyB,IACHA,EAAM5B,EAAO6B,MAAM/C,KAAKsB,SACrBD,IACHA,EAAS,GAES,IAAhBrB,KAAKsB,SAGLI,MAAMC,QAAQ3B,KAAKyB,OACrBzB,KAAKyB,MAAMuB,SAAQ,SAASnB,GAC1BA,EAAKgB,KAAKC,EAAKzB,GACfA,GAAUQ,EAAKP,WAGS,iBAAftB,KAAKyB,MACdqB,EAAIzB,GAAUrB,KAAKyB,MACU,iBAAfzB,KAAKyB,MACnBqB,EAAIG,MAAMjD,KAAKyB,MAAOJ,GACfH,EAAOE,SAASpB,KAAKyB,QAC5BzB,KAAKyB,MAAMyB,KAAKJ,EAAKzB,GACvBA,GAAUrB,KAAKsB,SAdRwB,gCCpIX,MAAMtD,EAAOd,EAEbc,EAAKyB,SAAW,UAChBzB,EAAK2B,cAAgB,UACrB3B,EAAKgC,cAAgB,UACrBhC,EAAK2D,KAAO,EAAQ,mCCLpB,MAAMlC,EAAW,UACXO,EAAgB,UAChBL,EAAgB,UAChBiC,EAAS,EAAQ,MAGjBC,EAAO,CACX,MAAO,QAAS,MAAO,QAAS,QAAS,OACzC,UAAW,UAAW,QAAS,OAAQ,MAAO,UAC9C,SAAU,SAAU,UAAW,SAAU,WAAY,SAAU,YAC/D,SAAU,SAAU,WAAY,SAAU,SAAU,UAAW,YAI3DC,EAAU,CACd,MAAO,MAAO,MAAO,WAAY,WAAY,WAAY,MAAO,SAChE,MAAO,YACPC,OAAOF,GAYT,SAASF,EAAK1C,EAAK+C,EAAQ1D,GACzB,MAAM2D,EAAQ,GACdzD,KAAK0D,WAAaD,EAElBA,EAAM3D,KAAOA,EACb2D,EAAMhD,IAAMA,EAEZgD,EAAMD,OAASA,GAAU,KACzBC,EAAME,SAAW,KAGjBF,EAAMG,IAAM,KACZH,EAAMI,KAAO,KACbJ,EAAMK,YAAc,KACpBL,EAAMM,OAAS,KACfN,EAAMO,UAAW,EACjBP,EAAMQ,KAAM,EACZR,EAAMS,KAAM,EACZT,EAAMU,IAAM,KACZV,EAAMW,WAAa,KACnBX,EAAMY,IAAM,KACZZ,EAAe,QAAI,KACnBA,EAAMa,SAAW,KACjBb,EAAMc,SAAW,KACjBd,EAAMe,SAAW,KAGZf,EAAMD,SACTC,EAAME,SAAW,GACjB3D,KAAKyE,SAGThG,EAAOC,QAAUyE,EAEjB,MAAMuB,EAAa,CACjB,MAAO,SAAU,WAAY,MAAO,OAAQ,cAAe,SAC3D,WAAY,MAAO,MAAO,MAAO,aAAc,MAAO,UAAW,WACjE,WAAY,YAGdvB,EAAKlD,UAAU0E,MAAQ,WACrB,MAAMlB,EAAQzD,KAAK0D,WACbkB,EAAS,GACfF,EAAW1B,SAAQ,SAAS6B,GAC1BD,EAAOC,GAAQpB,EAAMoB,MAEvB,MAAMrC,EAAM,IAAIxC,KAAKiC,YAAY2C,EAAOpB,QAExC,OADAhB,EAAIkB,WAAakB,EACVpC,GAGTW,EAAKlD,UAAUwE,MAAQ,WACrB,MAAMhB,EAAQzD,KAAK0D,WACnBJ,EAAQN,SAAQ,SAAS8B,GACvB9E,KAAK8E,GAAU,WACb,MAAMH,EAAQ,IAAI3E,KAAKiC,YAAYjC,MAEnC,OADAyD,EAAME,SAASoB,KAAKJ,GACbA,EAAMG,GAAQE,MAAML,EAAOM,cAEnCjF,OAGLmD,EAAKlD,UAAUiF,MAAQ,SAAcnF,GACnC,MAAM0D,EAAQzD,KAAK0D,WAEnBN,EAAwB,OAAjBK,EAAMD,QACbzD,EAAKQ,KAAKP,MAGVyD,EAAME,SAAWF,EAAME,SAASwB,QAAO,SAASC,GAC9C,OAAOA,EAAM1B,WAAWF,SAAWxD,OAClCA,MACHoD,EAAOiC,MAAM5B,EAAME,SAASrC,OAAQ,EAAG,sCAGzC6B,EAAKlD,UAAUqF,SAAW,SAAiBzB,GACzC,MAAMJ,EAAQzD,KAAK0D,WAGbC,EAAWE,EAAKsB,QAAO,SAASI,GACpC,OAAOA,aAAevF,KAAKiC,cAC1BjC,MACH6D,EAAOA,EAAKsB,QAAO,SAASI,GAC1B,QAASA,aAAevF,KAAKiC,eAC5BjC,MAEqB,IAApB2D,EAASrC,SACX8B,EAA0B,OAAnBK,EAAME,UACbF,EAAME,SAAWA,EAGjBA,EAASX,SAAQ,SAASoC,GACxBA,EAAM1B,WAAWF,OAASxD,OACzBA,OAEe,IAAhB6D,EAAKvC,SACP8B,EAAsB,OAAfK,EAAMI,MACbJ,EAAMI,KAAOA,EACbJ,EAAMK,YAAcD,EAAKjC,KAAI,SAAS2D,GACpC,GAAmB,iBAARA,GAAoBA,EAAItD,cAAgBuD,OACjD,OAAOD,EAET,MAAM/C,EAAM,GAOZ,OANAgD,OAAOC,KAAKF,GAAKvC,SAAQ,SAASqB,GAC5BA,IAAc,EAANA,KACVA,GAAO,GACT,MAAM5C,EAAQ8D,EAAIlB,GAClB7B,EAAIf,GAAS4C,KAER7B,OAtHK,CAChB,WAAY,aAAc,OAC1B,aAAc,eAAgB,cAC9B,cAAe,aAAc,cAAe,cAE5C,mBAAoB,aAAc,eAAgB,cAClD,cAAe,aAAc,eAyHrBQ,SAAQ,SAAS8B,GACzB3B,EAAKlD,UAAU6E,GAAU,WACvB,MAAMrB,EAAQzD,KAAK0D,WACnB,MAAM,IAAIzE,MAAM6F,EAAS,kCAAoCrB,EAAMhD,SAQvE4C,EAAKL,SAAQ,SAASY,GACpBT,EAAKlD,UAAU2D,GAAO,WACpB,MAAMH,EAAQzD,KAAK0D,WACbG,EAAOnC,MAAMzB,UAAU2C,MAAMrC,KAAK0E,WAOxC,OALA7B,EAAqB,OAAdK,EAAMG,KACbH,EAAMG,IAAMA,EAEZ5D,KAAKsF,SAASzB,GAEP7D,SAIXmD,EAAKlD,UAAUkE,IAAM,SAAatC,GAChCuB,EAAOvB,GACP,MAAM4B,EAAQzD,KAAK0D,WAKnB,OAHAN,EAAqB,OAAdK,EAAMU,KACbV,EAAMU,IAAMtC,EAEL7B,MAGTmD,EAAKlD,UAAU+D,SAAW,WAKxB,OAJchE,KAAK0D,WAEbM,UAAW,EAEVhE,MAGTmD,EAAKlD,UAAUyF,IAAM,SAAaC,GAChC,MAAMlC,EAAQzD,KAAK0D,WAMnB,OAJAN,EAA4B,OAArBK,EAAe,SACtBA,EAAe,QAAIkC,EACnBlC,EAAMO,UAAW,EAEVhE,MAGTmD,EAAKlD,UAAUqE,SAAW,SAAkBsB,GAC1C,MAAMnC,EAAQzD,KAAK0D,WAKnB,OAHAN,EAA0B,OAAnBK,EAAMa,UAAwC,OAAnBb,EAAMc,UACxCd,EAAMa,SAAWsB,EAEV5F,MAGTmD,EAAKlD,UAAUsE,SAAW,SAAkBqB,GAC1C,MAAMnC,EAAQzD,KAAK0D,WAKnB,OAHAN,EAA0B,OAAnBK,EAAMa,UAAwC,OAAnBb,EAAMc,UACxCd,EAAMc,SAAWqB,EAEV5F,MAGTmD,EAAKlD,UAAUiE,IAAM,WACnB,MAAMT,EAAQzD,KAAK0D,WACbG,EAAOnC,MAAMzB,UAAU2C,MAAMrC,KAAK0E,WAOxC,OALAxB,EAAMS,KAAM,EAEQ,IAAhBL,EAAKvC,QACPtB,KAAKsF,SAASzB,GAET7D,MAGTmD,EAAKlD,UAAUoE,IAAM,SAAawB,GAChC,MAAMpC,EAAQzD,KAAK0D,WAKnB,OAHAN,EAAqB,OAAdK,EAAMY,KACbZ,EAAMY,IAAMwB,EAEL7F,MAGTmD,EAAKlD,UAAUgE,IAAM,WAKnB,OAJcjE,KAAK0D,WAEbO,KAAM,EAELjE,MAGTmD,EAAKlD,UAAU8D,OAAS,SAAgBG,GACtC,MAAMT,EAAQzD,KAAK0D,WAQnB,OANAN,EAAwB,OAAjBK,EAAMM,QACbN,EAAMM,OAASG,EACflE,KAAKsF,SAASE,OAAOC,KAAKvB,GAAKtC,KAAI,SAASyC,GAC1C,OAAOH,EAAIG,OAGNrE,MAGTmD,EAAKlD,UAAUuE,SAAW,SAAkB3C,GAC1C,MAAM4B,EAAQzD,KAAK0D,WAKnB,OAHAN,EAAqB,OAAdK,EAAMU,KACbV,EAAMe,SAAW3C,EAEV7B,MAOTmD,EAAKlD,UAAU6F,QAAU,SAAgBC,EAAOlF,GAC9C,MAAM4C,EAAQzD,KAAK0D,WAGnB,GAAqB,OAAjBD,EAAMD,OACR,OAAOuC,EAAMC,WAAWvC,EAAME,SAAS,GAAGmC,QAAQC,EAAOlF,IAE3D,IAuCIoF,EAvCAC,EAASzC,EAAe,QACxB0C,GAAU,EAEVC,EAAU,KAKd,GAJkB,OAAd3C,EAAMY,MACR+B,EAAUL,EAAMM,SAAS5C,EAAMY,MAG7BZ,EAAMO,SAAU,CAClB,IAAIJ,EAAM,KAQV,GAPuB,OAAnBH,EAAMa,SACRV,EAAMH,EAAMa,SACc,OAAnBb,EAAMc,SACbX,EAAMH,EAAMc,SACS,OAAdd,EAAMG,MACbA,EAAMH,EAAMG,KAEF,OAARA,GAAiBH,EAAMQ,KAgBzB,GAFAkC,EAAUnG,KAAKsG,SAASP,EAAOnC,EAAKH,EAAMQ,KAEtC8B,EAAMQ,QAAQJ,GAChB,OAAOA,MAjBqB,CAE9B,MAAMjE,EAAO6D,EAAM7D,OACnB,IACuB,OAAjBuB,EAAMM,OACR/D,KAAKwG,eAAe/C,EAAMG,IAAKmC,EAAOlF,GAEtCb,KAAKyG,cAAcV,EAAOlF,GAC5BsF,GAAU,EACV,MAAOO,GACPP,GAAU,EAEZJ,EAAM5D,QAAQD,IAclB,GAHIuB,EAAMS,KAAOiC,IACfF,EAAUF,EAAMY,eAEdR,EAAS,CAEX,GAAuB,OAAnB1C,EAAMa,SAAmB,CAC3B,MAAMA,EAAWtE,KAAK4G,WAAWb,EAAOtC,EAAMa,UAC9C,GAAIyB,EAAMQ,QAAQjC,GAChB,OAAOA,EACTyB,EAAQzB,EAGV,MAAMuC,EAAQd,EAAM1E,OAGpB,GAAkB,OAAdoC,EAAMU,KAAiC,OAAjBV,EAAMM,OAAiB,CAC/C,IAAI7B,EACAuB,EAAMQ,MACR/B,EAAO6D,EAAM7D,QACf,MAAMnC,EAAOC,KAAK4G,WAChBb,EACmB,OAAnBtC,EAAMc,SAAoBd,EAAMc,SAAWd,EAAMG,IACjDH,EAAMQ,KAER,GAAI8B,EAAMQ,QAAQxG,GAChB,OAAOA,EAEL0D,EAAMQ,IACRiC,EAASH,EAAMxD,IAAIL,GAEnB6D,EAAQhG,EAkBZ,GAfIc,GAAWA,EAAQiG,OAAuB,OAAdrD,EAAMG,KACpC/C,EAAQiG,MAAMf,EAAMgB,OAAQF,EAAOd,EAAMzE,OAAQ,UAE/CT,GAAWA,EAAQiG,OAAuB,OAAdrD,EAAMG,KACpC/C,EAAQiG,MAAMf,EAAMgB,OAAQhB,EAAM1E,OAAQ0E,EAAMzE,OAAQ,WAGtDmC,EAAMQ,MAGRiC,EAD0B,OAAjBzC,EAAMM,OACN/D,KAAKwG,eAAe/C,EAAMG,IAAKmC,EAAOlF,GAEtCb,KAAKyG,cAAcV,EAAOlF,IAGjCkF,EAAMQ,QAAQL,GAChB,OAAOA,EAYT,GATKzC,EAAMQ,KAAwB,OAAjBR,EAAMM,QAAsC,OAAnBN,EAAME,UAC/CF,EAAME,SAASX,SAAQ,SAAwBoC,GAG7CA,EAAMU,QAAQC,EAAOlF,MAKrB4C,EAAMe,WAA2B,WAAdf,EAAMG,KAAkC,WAAdH,EAAMG,KAAmB,CACxE,MAAMhD,EAAO,IAAIO,EAAc+E,GAC/BA,EAASlG,KAAKgH,QAAQvD,EAAMe,SAAUuB,EAAMpD,eAAeuB,KACxD4B,QAAQlF,EAAMC,IAcrB,OATI4C,EAAMS,KAAOiC,IACfD,EAASH,EAAMkB,YAAYhB,IAGX,OAAdxC,EAAMY,KAA4B,OAAX6B,IAA+B,IAAZC,EAEzB,OAAZC,GACPL,EAAMmB,QAAQd,GAFdL,EAAMoB,SAASf,EAAS3C,EAAMY,IAAK6B,GAI9BA,GAGT/C,EAAKlD,UAAUuG,eAAiB,SAAuB5C,EAAKmC,EAAOlF,GACjE,MAAM4C,EAAQzD,KAAK0D,WAEnB,MAAY,QAARE,GAAyB,QAARA,EACZ,KACG,UAARA,GAA2B,UAARA,EACd5D,KAAKoH,YAAYrB,EAAOnC,EAAKH,EAAMI,KAAK,GAAIhD,GAC5C,OAAOwG,KAAKzD,GACZ5D,KAAKsH,WAAWvB,EAAOnC,EAAK/C,GACpB,UAAR+C,GAAmBH,EAAMI,KACzB7D,KAAKuH,aAAaxB,EAAOtC,EAAMI,KAAK,GAAIJ,EAAMI,KAAK,GAAIhD,GAC/C,UAAR+C,EACA5D,KAAKuH,aAAaxB,EAAO,KAAM,KAAMlF,GAC7B,YAAR+C,GAA6B,YAARA,EACrB5D,KAAKwH,YAAYzB,EAAOnC,EAAK/C,GACrB,UAAR+C,EACA5D,KAAKyH,YAAY1B,EAAOlF,GAChB,SAAR+C,EACA5D,KAAK0H,YAAY3B,EAAOlF,GAChB,YAAR+C,EACA5D,KAAKsH,WAAWvB,EAAOnC,EAAK/C,GACpB,QAAR+C,GAAyB,SAARA,EACjB5D,KAAK2H,WAAW5B,EAAOtC,EAAMI,MAAQJ,EAAMI,KAAK,GAAIhD,GAE3C,OAAd4C,EAAMU,IACDnE,KAAKgH,QAAQvD,EAAMU,IAAK4B,EAAMpD,eAAeuB,KACjD4B,QAAQC,EAAOlF,GAEXkF,EAAMxE,MAAM,gBAAkBqC,IAIzCT,EAAKlD,UAAU+G,QAAU,SAAiB3G,EAAQ6D,GAEhD,MAAMT,EAAQzD,KAAK0D,WASnB,OAPAD,EAAMW,WAAapE,KAAK4H,KAAKvH,EAAQ6D,GACrCd,EAA8C,OAAvCK,EAAMW,WAAWV,WAAWF,QACnCC,EAAMW,WAAaX,EAAMW,WAAWV,WAAWC,SAAS,GACpDF,EAAMc,WAAad,EAAMW,WAAWV,WAAWa,WACjDd,EAAMW,WAAaX,EAAMW,WAAWO,QACpClB,EAAMW,WAAWV,WAAWa,SAAWd,EAAMc,UAExCd,EAAMW,YAGfjB,EAAKlD,UAAUwG,cAAgB,SAAsBV,EAAOlF,GAC1D,MAAM4C,EAAQzD,KAAK0D,WACnB,IAAIwC,EAAS,KACT2B,GAAQ,EAmBZ,OAjBArC,OAAOC,KAAKhC,EAAMM,QAAQ+D,MAAK,SAASzD,GACtC,MAAMnC,EAAO6D,EAAM7D,OACb6F,EAAOtE,EAAMM,OAAOM,GAC1B,IACE,MAAM5C,EAAQsG,EAAKjC,QAAQC,EAAOlF,GAClC,GAAIkF,EAAMQ,QAAQ9E,GAChB,OAAO,EAETyE,EAAS,CAAE8B,KAAM3D,EAAK5C,MAAOA,GAC7BoG,GAAQ,EACR,MAAOnB,GAEP,OADAX,EAAM5D,QAAQD,IACP,EAET,OAAO,IACNlC,MAEE6H,EAGE3B,EAFEH,EAAMxE,MAAM,uBASvB4B,EAAKlD,UAAUgI,qBAAuB,SAA6BrH,GACjE,OAAO,IAAIY,EAAcZ,EAAMZ,KAAKgB,WAGtCmC,EAAKlD,UAAUiI,QAAU,SAAgBtH,EAAMI,EAAUwC,GACvD,MAAMC,EAAQzD,KAAK0D,WACnB,GAAyB,OAArBD,EAAe,SAAcA,EAAe,UAAM7C,EACpD,OAEF,MAAMsF,EAASlG,KAAKmI,aAAavH,EAAMI,EAAUwC,GACjD,YAAe4E,IAAXlC,GAGAlG,KAAKqI,aAAanC,EAAQlF,EAAUwC,QAHxC,EAMO0C,GAGT/C,EAAKlD,UAAUkI,aAAe,SAAgBvH,EAAMI,EAAUwC,GAC5D,MAAMC,EAAQzD,KAAK0D,WAGnB,GAAqB,OAAjBD,EAAMD,OACR,OAAOC,EAAME,SAAS,GAAGuE,QAAQtH,EAAMI,GAAY,IAAIC,GAEzD,IAAIiF,EAAS,KAMb,GAHAlG,KAAKgB,SAAWA,EAGZyC,EAAMO,eAAqBoE,IAATxH,EAAoB,CACxC,GAAyB,OAArB6C,EAAe,QAGjB,OAFA7C,EAAO6C,EAAe,QAM1B,IAAI6E,EAAU,KACVC,GAAY,EAChB,GAAI9E,EAAMQ,IAERiC,EAASlG,KAAKiI,qBAAqBrH,QAC9B,GAAI6C,EAAMM,OACfmC,EAASlG,KAAKwI,cAAc5H,EAAMI,QAC7B,GAAIyC,EAAMe,SACf8D,EAAUtI,KAAKgH,QAAQvD,EAAMe,SAAUhB,GAAQ0E,QAAQtH,EAAMI,GAC7DuH,GAAY,OACP,GAAI9E,EAAME,SACf2E,EAAU7E,EAAME,SAAS/B,KAAI,SAASwD,GACpC,GAA6B,UAAzBA,EAAM1B,WAAWE,IACnB,OAAOwB,EAAM8C,QAAQ,KAAMlH,EAAUJ,GAEvC,GAA6B,OAAzBwE,EAAM1B,WAAWW,IACnB,OAAOrD,EAASO,MAAM,2BACxB,MAAM6E,EAAUpF,EAASqF,SAASjB,EAAM1B,WAAWW,KAEnD,GAAoB,iBAATzD,EACT,OAAOI,EAASO,MAAM,2CAExB,MAAMiB,EAAM4C,EAAM8C,QAAQtH,EAAKwE,EAAM1B,WAAWW,KAAMrD,EAAUJ,GAGhE,OAFAI,EAASmG,SAASf,GAEX5D,IACNxC,MAAMmF,QAAO,SAASC,GACvB,OAAOA,KAETkD,EAAUtI,KAAKiI,qBAAqBK,QAEpC,GAAkB,UAAd7E,EAAMG,KAAiC,UAAdH,EAAMG,IAAiB,CAElD,IAAMH,EAAMI,MAA8B,IAAtBJ,EAAMI,KAAKvC,OAC7B,OAAON,EAASO,MAAM,uBAAyBkC,EAAMG,KAEvD,IAAKlC,MAAMC,QAAQf,GACjB,OAAOI,EAASO,MAAM,sCAExB,MAAM6D,EAAQpF,KAAK2E,QACnBS,EAAM1B,WAAWa,SAAW,KAC5B+D,EAAUtI,KAAKiI,qBAAqBrH,EAAKgB,KAAI,SAASC,GACpD,MAAM4B,EAAQzD,KAAK0D,WAEnB,OAAO1D,KAAKgH,QAAQvD,EAAMI,KAAK,GAAIjD,GAAMsH,QAAQrG,EAAMb,KACtDoE,SACoB,OAAd3B,EAAMU,IACf+B,EAASlG,KAAKgH,QAAQvD,EAAMU,IAAKX,GAAQ0E,QAAQtH,EAAMI,IAEvDsH,EAAUtI,KAAKyI,iBAAiBhF,EAAMG,IAAKhD,GAC3C2H,GAAY,GAKhB,IAAK9E,EAAMQ,KAAwB,OAAjBR,EAAMM,OAAiB,CACvC,MAAMH,EAAyB,OAAnBH,EAAMc,SAAoBd,EAAMc,SAAWd,EAAMG,IACvD8E,EAAyB,OAAnBjF,EAAMc,SAAoB,YAAc,UAExC,OAARX,EACgB,OAAdH,EAAMU,KACRnD,EAASO,MAAM,wCAEC,OAAdkC,EAAMU,MACR+B,EAASlG,KAAK2I,iBAAiB/E,EAAK2E,EAAWG,EAAKJ,IAQ1D,OAHuB,OAAnB7E,EAAMa,WACR4B,EAASlG,KAAK2I,iBAAiBlF,EAAMa,UAAU,EAAO,UAAW4B,IAE5DA,GAGT/C,EAAKlD,UAAUuI,cAAgB,SAAsB5H,EAAMI,GACzD,MAAMyC,EAAQzD,KAAK0D,WAEbqE,EAAOtE,EAAMM,OAAOnD,EAAKoH,MAO/B,OANKD,GACH3E,GACE,EACAxC,EAAKoH,KAAO,iBACNY,KAAKC,UAAUrD,OAAOC,KAAKhC,EAAMM,UAEpCgE,EAAKG,QAAQtH,EAAKa,MAAOT,IAGlCmC,EAAKlD,UAAUwI,iBAAmB,SAAyB7E,EAAKhD,GAC9D,MAAM6C,EAAQzD,KAAK0D,WAEnB,GAAI,OAAO2D,KAAKzD,GACd,OAAO5D,KAAK8I,WAAWlI,EAAMgD,GAC1B,GAAY,UAARA,GAAmBH,EAAMI,KAChC,OAAO7D,KAAK+I,aAAanI,EAAM6C,EAAMK,YAAY,GAAIL,EAAMI,KAAK,IAC7D,GAAY,UAARD,EACP,OAAO5D,KAAK+I,aAAanI,EAAM,KAAM,MAClC,GAAY,YAARgD,GAA6B,YAARA,EAC5B,OAAO5D,KAAKgJ,YAAYpI,EAAMgD,GAC3B,GAAY,UAARA,EACP,OAAO5D,KAAKiJ,cACT,GAAY,QAARrF,GAAyB,SAARA,EACxB,OAAO5D,KAAKkJ,WAAWtI,EAAM6C,EAAMI,MAAQJ,EAAMK,YAAY,IAC1D,GAAY,SAARF,EACP,OAAO5D,KAAKmJ,YAAYvI,GACrB,GAAY,YAARgD,EACP,OAAO5D,KAAK8I,WAAWlI,EAAMgD,GAE7B,MAAM,IAAI3E,MAAM,oBAAsB2E,IAG1CT,EAAKlD,UAAUmJ,UAAY,SAAkBC,GAC3C,MAAO,YAAYhC,KAAKgC,IAG1BlG,EAAKlD,UAAUqJ,YAAc,SAAoBD,GAC/C,MAAO,6BAA6BhC,KAAKgC,iCC1nB3C,MAAMzJ,EAAW,EAAQ,MAEzB,SAASqB,EAASJ,GAChBb,KAAK2C,eAAiB,CACpBuB,IAAK,KACL6C,KAAM,GACNlG,QAASA,GAAW,GACpB0I,OAAQ,IA6FZ,SAASC,EAAczC,EAAM0C,GAC3BzJ,KAAK+G,KAAOA,EACZ/G,KAAK0J,QAAQD,GA5Ff/K,EAAQ,EAAWuC,EAEnBA,EAAShB,UAAUsG,QAAU,SAAiBrC,GAC5C,OAAOA,aAAesF,GAGxBvI,EAAShB,UAAUiC,KAAO,WACxB,MAAMuB,EAAQzD,KAAK2C,eAEnB,MAAO,CAAEuB,IAAKT,EAAMS,IAAKyF,QAASlG,EAAMsD,KAAKzF,SAG/CL,EAAShB,UAAUkC,QAAU,SAAiBvB,GAC5C,MAAM6C,EAAQzD,KAAK2C,eAEnBc,EAAMS,IAAMtD,EAAKsD,IACjBT,EAAMsD,KAAOtD,EAAMsD,KAAKnE,MAAM,EAAGhC,EAAK+I,UAGxC1I,EAAShB,UAAUoG,SAAW,SAAkBhC,GAC9C,OAAOrE,KAAK2C,eAAeoE,KAAKhC,KAAKV,IAGvCpD,EAAShB,UAAUiH,QAAU,SAAiB0C,GAC5C,MAAMnG,EAAQzD,KAAK2C,eAEnBc,EAAMsD,KAAOtD,EAAMsD,KAAKnE,MAAM,EAAGgH,EAAQ,IAG3C3I,EAAShB,UAAUkH,SAAW,SAAkByC,EAAOvF,EAAK5C,GAC1D,MAAMgC,EAAQzD,KAAK2C,eAEnB3C,KAAKkH,QAAQ0C,GACK,OAAdnG,EAAMS,MACRT,EAAMS,IAAIG,GAAO5C,IAGrBR,EAAShB,UAAU8G,KAAO,WACxB,OAAO/G,KAAK2C,eAAeoE,KAAKlE,KAAK,MAGvC5B,EAAShB,UAAU0G,YAAc,WAC/B,MAAMlD,EAAQzD,KAAK2C,eAEbkH,EAAOpG,EAAMS,IAEnB,OADAT,EAAMS,IAAM,GACL2F,GAGT5I,EAAShB,UAAUgH,YAAc,SAAqB4C,GACpD,MAAMpG,EAAQzD,KAAK2C,eAEbmH,EAAMrG,EAAMS,IAElB,OADAT,EAAMS,IAAM2F,EACLC,GAGT7I,EAAShB,UAAUsB,MAAQ,SAAekI,GACxC,IAAIM,EACJ,MAAMtG,EAAQzD,KAAK2C,eAEbqH,EAAYP,aAAeD,EASjC,GAPEO,EADEC,EACIP,EAEA,IAAID,EAAc/F,EAAMsD,KAAKnF,KAAI,SAASqI,GAC9C,MAAO,IAAMrB,KAAKC,UAAUoB,GAAQ,OACnCpH,KAAK,IAAK4G,EAAIS,SAAWT,EAAKA,EAAIU,QAGlC1G,EAAM5C,QAAQuJ,QACjB,MAAML,EAKR,OAHKC,GACHvG,EAAM8F,OAAOxE,KAAKgF,GAEbA,GAGT9I,EAAShB,UAAU+F,WAAa,SAAoBE,GAClD,MAAMzC,EAAQzD,KAAK2C,eACnB,OAAKc,EAAM5C,QAAQuJ,QAGZ,CACLlE,OAAQlG,KAAKuG,QAAQL,GAAU,KAAOA,EACtCqD,OAAQ9F,EAAM8F,QAJPrD,GAYXtG,EAAS4J,EAAevK,OAExBuK,EAAcvJ,UAAUyJ,QAAU,SAAiBD,GAKjD,GAJAzJ,KAAKkK,QAAUT,EAAM,SAAWzJ,KAAK+G,MAAQ,aACzC9H,MAAMoL,mBACRpL,MAAMoL,kBAAkBrK,KAAMwJ,IAE3BxJ,KAAKmK,MACR,IAEE,MAAM,IAAIlL,MAAMe,KAAKkK,SACrB,MAAOxD,GACP1G,KAAKmK,MAAQzD,EAAEyD,MAGnB,OAAOnK,gCCtHT,SAASsK,EAAQ1I,GACf,MAAMY,EAAM,GAWZ,OATAgD,OAAOC,KAAK7D,GAAKoB,SAAQ,SAASqB,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAM5C,EAAQG,EAAIyC,GAClB7B,EAAIf,GAAS4C,KAGR7B,EAGT9D,EAAQ6L,SAAW,CACjB,EAAG,YACH,EAAG,cACH,EAAG,UACH,EAAG,WAEL7L,EAAQ8L,eAAiBF,EAAQ5L,EAAQ6L,UAEzC7L,EAAQkF,IAAM,CACZ,EAAM,MACN,EAAM,OACN,EAAM,MACN,EAAM,SACN,EAAM,SACN,EAAM,QACN,EAAM,QACN,EAAM,UACN,EAAM,WACN,EAAM,OACN,GAAM,OACN,GAAM,QACN,GAAM,UACN,GAAM,cACN,GAAM,MACN,GAAM,MACN,GAAM,SACN,GAAM,WACN,GAAM,SACN,GAAM,WACN,GAAM,SACN,GAAM,UACN,GAAM,UACN,GAAM,WACN,GAAM,YACN,GAAM,SACN,GAAM,SACN,GAAM,UACN,GAAM,UAERlF,EAAQ+L,UAAYH,EAAQ5L,EAAQkF,kCCvDpC,MAAMnE,EAAYf,EAGlBe,EAAUiL,SAAW,SAAiB9I,GACpC,MAAMY,EAAM,GAWZ,OATAgD,OAAOC,KAAK7D,GAAKoB,SAAQ,SAASqB,IAErB,EAANA,IAAYA,IACfA,GAAY,GAEd,MAAM5C,EAAQG,EAAIyC,GAClB7B,EAAIf,GAAS4C,KAGR7B,GAGT/C,EAAUkL,IAAM,EAAQ,kCClBxB,MAAM/K,EAAW,EAAQ,MAEnBN,EAAS,EAAQ,MACjB6B,EAAgB,UAChBgC,EAAO,EAAQ,MAGfwH,EAAM,EAAQ,KAEpB,SAASC,EAAWvK,GAClBL,KAAKS,IAAM,MACXT,KAAKF,KAAOO,EAAOP,KACnBE,KAAKK,OAASA,EAGdL,KAAK6K,KAAO,IAAIC,EAChB9K,KAAK6K,KAAK3F,MAAM7E,EAAON,MAczB,SAAS+K,EAAQtH,GACfL,EAAK5C,KAAKP,KAAM,MAAOwD,GA8OzB,SAASuH,EAAaC,EAAKvI,GACzB,IAAImB,EAAMoH,EAAI3I,UAAUI,GACxB,GAAIuI,EAAIzE,QAAQ3C,GACd,OAAOA,EAET,MAAM8E,EAAMiC,EAAIJ,SAAS3G,GAAO,GAC1B2E,EAA6B,IAAV,GAAN3E,GAGnB,GAAqB,KAAV,GAANA,GAAsB,CACzB,IAAIqH,EAAMrH,EAEV,IADAA,EAAM,EACkB,MAAV,IAANqH,IAAsB,CAE5B,GADAA,EAAMD,EAAI3I,UAAUI,GAChBuI,EAAIzE,QAAQ0E,GACd,OAAOA,EAETrH,IAAQ,EACRA,GAAa,IAANqH,QAGTrH,GAAO,GAIT,MAAO,CACL8E,IAAKA,EACLH,UAAWA,EACX3E,IAAKA,EACLsH,OANaP,EAAI/G,IAAIA,IAUzB,SAASuH,EAAaH,EAAKzC,EAAW9F,GACpC,IAAI2I,EAAMJ,EAAI3I,UAAUI,GACxB,GAAIuI,EAAIzE,QAAQ6E,GACd,OAAOA,EAGT,IAAK7C,GAAqB,MAAR6C,EAChB,OAAO,KAGT,GAAqB,IAAV,IAANA,GAEH,OAAOA,EAIT,MAAMxF,EAAY,IAANwF,EACZ,GAAIxF,EAAM,EACR,OAAOoF,EAAIzJ,MAAM,6BAEnB6J,EAAM,EACN,IAAK,IAAIC,EAAI,EAAGA,EAAIzF,EAAKyF,IAAK,CAC5BD,IAAQ,EACR,MAAME,EAAIN,EAAI3I,UAAUI,GACxB,GAAIuI,EAAIzE,QAAQ+E,GACd,OAAOA,EACTF,GAAOE,EAGT,OAAOF,EAzTT3M,EAAOC,QAAUkM,EAEjBA,EAAW3K,UAAUU,OAAS,SAAgBC,EAAMC,GAKlD,OAJKM,EAAca,gBAAgBpB,KACjCA,EAAO,IAAIO,EAAcP,EAAMC,IAG1Bb,KAAK6K,KAAK/E,QAAQlF,EAAMC,IAQjCjB,EAASkL,EAAS3H,GAElB2H,EAAQ7K,UAAUqG,SAAW,SAAiBiF,EAAQ3H,EAAKK,GACzD,GAAIsH,EAAOnJ,UACT,OAAO,EAET,MAAMqB,EAAQ8H,EAAOrJ,OACfsJ,EAAaT,EAAaQ,EAAQ,wBAA0B3H,EAAM,KACxE,OAAI2H,EAAOhF,QAAQiF,GACVA,GAETD,EAAOpJ,QAAQsB,GAER+H,EAAW5H,MAAQA,GAAO4H,EAAWN,SAAWtH,GACpD4H,EAAWN,OAAS,OAAUtH,GAAOK,IAG1C6G,EAAQ7K,UAAU2G,WAAa,SAAmB2E,EAAQ3H,EAAKK,GAC7D,MAAMuH,EAAaT,EAAaQ,EAC9B,4BAA8B3H,EAAM,KACtC,GAAI2H,EAAOhF,QAAQiF,GACjB,OAAOA,EAET,IAAIJ,EAAMD,EAAaI,EACrBC,EAAWjD,UACX,4BAA8B3E,EAAM,KAGtC,GAAI2H,EAAOhF,QAAQ6E,GACjB,OAAOA,EAET,IAAKnH,GACDuH,EAAW5H,MAAQA,GACnB4H,EAAWN,SAAWtH,GACtB4H,EAAWN,OAAS,OAAStH,EAC/B,OAAO2H,EAAOhK,MAAM,yBAA2BqC,EAAM,KAGvD,GAAI4H,EAAWjD,WAAqB,OAAR6C,EAC1B,OAAOG,EAAOjJ,KAAK8I,EAAK,6BAA+BxH,EAAM,KAG/D,MAAMH,EAAQ8H,EAAOrJ,OACfM,EAAMxC,KAAKyL,cACfF,EACA,2CAA6CvL,KAAK4D,IAAM,KAC1D,OAAI2H,EAAOhF,QAAQ/D,GACVA,GAET4I,EAAMG,EAAOlK,OAASoC,EAAMpC,OAC5BkK,EAAOpJ,QAAQsB,GACR8H,EAAOjJ,KAAK8I,EAAK,6BAA+BxH,EAAM,OAG/DkH,EAAQ7K,UAAUwL,cAAgB,SAAsBF,EAAQ9I,GAC9D,OAAS,CACP,MAAMmB,EAAMmH,EAAaQ,EAAQ9I,GACjC,GAAI8I,EAAOhF,QAAQ3C,GACjB,OAAOA,EACT,MAAMwH,EAAMD,EAAaI,EAAQ3H,EAAI2E,UAAW9F,GAChD,GAAI8I,EAAOhF,QAAQ6E,GACjB,OAAOA,EAET,IAAI5I,EAOJ,GALEA,EADEoB,EAAI2E,WAAqB,OAAR6C,EACbG,EAAOjJ,KAAK8I,GAEZpL,KAAKyL,cAAcF,EAAQ9I,GAG/B8I,EAAOhF,QAAQ/D,GACjB,OAAOA,EAET,GAAmB,QAAfoB,EAAIsH,OACN,QAINJ,EAAQ7K,UAAUmH,YAAc,SAAoBmE,EAAQ3H,EAAK8H,EAC/D7K,GACA,MAAMqF,EAAS,GACf,MAAQqF,EAAOnJ,WAAW,CACxB,MAAMuJ,EAAc3L,KAAKsG,SAASiF,EAAQ,OAC1C,GAAIA,EAAOhF,QAAQoF,GACjB,OAAOA,EAET,MAAMnJ,EAAMkJ,EAAQ/K,OAAO4K,EAAQ,MAAO1K,GAC1C,GAAI0K,EAAOhF,QAAQ/D,IAAQmJ,EACzB,MACFzF,EAAOnB,KAAKvC,GAEd,OAAO0D,GAGT4E,EAAQ7K,UAAUqH,WAAa,SAAmBiE,EAAQ3H,GACxD,GAAY,WAARA,EAAkB,CACpB,MAAMgI,EAASL,EAAOlJ,YACtB,OAAIkJ,EAAOhF,QAAQqF,GACVA,EACF,CAAEA,OAAQA,EAAQhL,KAAM2K,EAAOhJ,OACjC,GAAY,WAARqB,EAAkB,CAC3B,MAAMrB,EAAMgJ,EAAOhJ,MACnB,GAAIA,EAAIjB,OAAS,GAAM,EACrB,OAAOiK,EAAOhK,MAAM,mDAEtB,IAAI8H,EAAM,GACV,IAAK,IAAIgC,EAAI,EAAGA,EAAI9I,EAAIjB,OAAS,EAAG+J,IAClChC,GAAOwC,OAAOC,aAAavJ,EAAIwJ,aAAiB,EAAJV,IAE9C,OAAOhC,EACF,GAAY,WAARzF,EAAkB,CAC3B,MAAMoI,EAAST,EAAOhJ,MAAM0J,SAAS,SACrC,OAAKjM,KAAKoJ,UAAU4C,GAIbA,EAHET,EAAOhK,MAAM,0DAIjB,GAAY,WAARqC,EACT,OAAO2H,EAAOhJ,MACT,GAAY,YAARqB,EACT,OAAO2H,EAAOhJ,MACT,GAAY,aAARqB,EAAoB,CAC7B,MAAMsI,EAAWX,EAAOhJ,MAAM0J,SAAS,SACvC,OAAKjM,KAAKsJ,YAAY4C,GAIfA,EAHEX,EAAOhK,MAAM,4DAIjB,MAAI,OAAO8F,KAAKzD,GACd2H,EAAOhJ,MAAM0J,WAEbV,EAAOhK,MAAM,4BAA8BqC,EAAM,iBAI5DkH,EAAQ7K,UAAUsH,aAAe,SAAqBgE,EAAQY,EAAQC,GACpE,IAAIlG,EACJ,MAAMmG,EAAc,GACpB,IAAIC,EAAQ,EACRC,EAAW,EACf,MAAQhB,EAAOnJ,WACbmK,EAAWhB,EAAOlJ,YAClBiK,IAAU,EACVA,GAAoB,IAAXC,EACiB,IAAV,IAAXA,KACHF,EAAYtH,KAAKuH,GACjBA,EAAQ,GAGG,IAAXC,GACFF,EAAYtH,KAAKuH,GAEnB,MAAME,EAASH,EAAY,GAAK,GAAM,EAChCI,EAASJ,EAAY,GAAK,GAOhC,GAJEnG,EADEkG,EACOC,EAEA,CAACG,EAAOC,GAAQlJ,OAAO8I,EAAYzJ,MAAM,IAEhDuJ,EAAQ,CACV,IAAIO,EAAMP,EAAOjG,EAAOrD,KAAK,WACjBuF,IAARsE,IACFA,EAAMP,EAAOjG,EAAOrD,KAAK,YACfuF,IAARsE,IACFxG,EAASwG,GAGb,OAAOxG,GAGT4E,EAAQ7K,UAAUuH,YAAc,SAAoB+D,EAAQ3H,GAC1D,MAAMyF,EAAMkC,EAAOhJ,MAAM0J,WAEzB,IAAIU,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,GAAY,YAARpJ,EACF+I,EAAyB,EAAlBtD,EAAIzG,MAAM,EAAG,GACpBgK,EAAwB,EAAlBvD,EAAIzG,MAAM,EAAG,GACnBiK,EAAwB,EAAlBxD,EAAIzG,MAAM,EAAG,GACnBkK,EAA0B,EAAnBzD,EAAIzG,MAAM,EAAG,IACpBmK,EAA0B,EAApB1D,EAAIzG,MAAM,GAAI,IACpBoK,EAA0B,EAApB3D,EAAIzG,MAAM,GAAI,QACf,IAAY,YAARgB,EAYT,OAAO2H,EAAOhK,MAAM,YAAcqC,EAAM,8BAXxC+I,EAAyB,EAAlBtD,EAAIzG,MAAM,EAAG,GACpBgK,EAAwB,EAAlBvD,EAAIzG,MAAM,EAAG,GACnBiK,EAAwB,EAAlBxD,EAAIzG,MAAM,EAAG,GACnBkK,EAAyB,EAAlBzD,EAAIzG,MAAM,EAAG,GACpBmK,EAAyB,EAAnB1D,EAAIzG,MAAM,EAAG,IACnBoK,EAA0B,EAApB3D,EAAIzG,MAAM,GAAI,IAElB+J,EADEA,EAAO,GACF,IAAOA,EAEP,KAAOA,EAKlB,OAAOM,KAAKC,IAAIP,EAAMC,EAAM,EAAGC,EAAKC,EAAMC,EAAKC,EAAK,IAGtDlC,EAAQ7K,UAAUwH,YAAc,WAC9B,OAAO,MAGTqD,EAAQ7K,UAAUyH,YAAc,SAAoB6D,GAClD,MAAM/I,EAAM+I,EAAOlJ,YACnB,OAAIkJ,EAAOhF,QAAQ/D,GACVA,EAEQ,IAARA,GAGXsI,EAAQ7K,UAAU0H,WAAa,SAAmB4D,EAAQY,GAExD,MAAM5J,EAAMgJ,EAAOhJ,MACnB,IAAIC,EAAM,IAAIlD,EAAOiD,GAKrB,OAHI4J,IACF3J,EAAM2J,EAAO3J,EAAIyJ,SAAS,MAAQzJ,GAE7BA,GAGTsI,EAAQ7K,UAAU2H,KAAO,SAAavH,EAAQ6D,GAG5C,MAFsB,mBAAX7D,IACTA,EAASA,EAAO6D,IACX7D,EAAOG,YAAY,OAAOqK,mCCxQnC,MAAMnL,EAAWhB,EAEjBgB,EAASiL,IAAM,EAAQ,MACvBjL,EAASyN,IAAM,EAAQ,mCCHvB,MAAMvN,EAAW,EAAQ,MACnBsB,EAAS,eAET0J,EAAa,EAAQ,MAE3B,SAASwC,EAAW/M,GAClBuK,EAAWrK,KAAKP,KAAMK,GACtBL,KAAKS,IAAM,MAEbb,EAASwN,EAAYxC,GACrBnM,EAAOC,QAAU0O,EAEjBA,EAAWnN,UAAUU,OAAS,SAAgBC,EAAMC,GAClD,MAAMwM,EAAQzM,EAAKqL,WAAWqB,MAAM,YAE9BC,EAAQ1M,EAAQ0M,MAAMC,cAEtBC,EAAK,kCACX,IAAI5G,GAAS,EACT6G,GAAO,EACX,IAAK,IAAIrC,EAAI,EAAGA,EAAIgC,EAAM/L,OAAQ+J,IAAK,CACrC,MAAMxD,EAAQwF,EAAMhC,GAAGxD,MAAM4F,GAC7B,GAAc,OAAV5F,GAGAA,EAAM,KAAO0F,EAAjB,CAGA,IAAe,IAAX1G,EAIG,CACL,GAAiB,QAAbgB,EAAM,GACR,MACF6F,EAAMrC,EACN,MAPA,GAAiB,UAAbxD,EAAM,GACR,MACFhB,EAAQwE,GAQZ,IAAe,IAAXxE,IAAyB,IAAT6G,EAClB,MAAM,IAAIzO,MAAM,8BAAgCsO,GAElD,MAAMI,EAASN,EAAMzK,MAAMiE,EAAQ,EAAG6G,GAAK7K,KAAK,IAEhD8K,EAAOC,QAAQ,kBAAmB,IAElC,MAAM7H,EAAQ7E,EAAO2M,KAAKF,EAAQ,UAClC,OAAO/C,EAAW3K,UAAUU,OAAOJ,KAAKP,KAAM+F,EAAOlF,iCC/CvD,MAAMjB,EAAW,EAAQ,MACnBsB,EAAS,eACTiC,EAAO,EAAQ,MAGfwH,EAAM,EAAQ,KAEpB,SAASmD,EAAWzN,GAClBL,KAAKS,IAAM,MACXT,KAAKF,KAAOO,EAAOP,KACnBE,KAAKK,OAASA,EAGdL,KAAK6K,KAAO,IAAIC,EAChB9K,KAAK6K,KAAK3F,MAAM7E,EAAON,MAUzB,SAAS+K,EAAQtH,GACfL,EAAK5C,KAAKP,KAAM,MAAOwD,GAmHzB,SAASuK,EAAInI,GACX,OAAIA,EAAM,GACD,IAAMA,EAENA,EAhIXnH,EAAOC,QAAUoP,EAEjBA,EAAW7N,UAAUc,OAAS,SAAgBH,EAAMI,GAClD,OAAOhB,KAAK6K,KAAK3C,QAAQtH,EAAMI,GAAU6B,QAQ3CjD,EAASkL,EAAS3H,GAElB2H,EAAQ7K,UAAU0I,iBAAmB,SAAyB/E,EAC5D2E,EACAG,EACAJ,GACA,MAAM0F,EA2OR,SAAmBpK,EAAK2E,EAAWG,EAAK1H,GACtC,IAAIwB,EAOJ,GALY,UAARoB,EACFA,EAAM,MACS,UAARA,IACPA,EAAM,OAEJ+G,EAAIF,UAAU/J,eAAekD,GAC/BpB,EAAMmI,EAAIF,UAAU7G,OACjB,IAAmB,iBAARA,IAA2B,EAANA,KAAaA,EAGhD,OAAO5C,EAASO,MAAM,gBAAkBqC,GAFxCpB,EAAMoB,EAIR,OAAIpB,GAAO,GACFxB,EAASO,MAAM,yCAEnBgH,IACH/F,GAAO,IAETA,GAAQmI,EAAIH,eAAe9B,GAAO,cAAgB,EAE3ClG,GAlQYyL,CAAUrK,EAAK2E,EAAWG,EAAK1I,KAAKgB,UAGvD,GAAIsH,EAAQhH,OAAS,IAAM,CACzB,MAAM4M,EAAShN,EAAO6B,MAAM,GAG5B,OAFAmL,EAAO,GAAKF,EACZE,EAAO,GAAK5F,EAAQhH,OACbtB,KAAKiI,qBAAqB,CAAEiG,EAAQ5F,IAK7C,IAAI6F,EAAY,EAChB,IAAK,IAAI9C,EAAI/C,EAAQhH,OAAQ+J,GAAK,IAAOA,IAAM,EAC7C8C,IAEF,MAAMD,EAAShN,EAAO6B,MAAM,EAAQoL,GACpCD,EAAO,GAAKF,EACZE,EAAO,GAAK,IAAOC,EAEnB,IAAK,IAAI9C,EAAI,EAAI8C,EAAW7C,EAAIhD,EAAQhH,OAAQgK,EAAI,EAAGD,IAAKC,IAAM,EAChE4C,EAAO7C,GAAS,IAAJC,EAEd,OAAOtL,KAAKiI,qBAAqB,CAAEiG,EAAQ5F,KAG7CwC,EAAQ7K,UAAU6I,WAAa,SAAmBO,EAAKzF,GACrD,GAAY,WAARA,EACF,OAAO5D,KAAKiI,qBAAqB,CAAe,EAAboB,EAAIuC,OAAYvC,EAAIzI,OAClD,GAAY,WAARgD,EAAkB,CAC3B,MAAMoH,EAAM9J,EAAO6B,MAAmB,EAAbsG,EAAI/H,QAC7B,IAAK,IAAI+J,EAAI,EAAGA,EAAIhC,EAAI/H,OAAQ+J,IAC9BL,EAAIoD,cAAc/E,EAAIgF,WAAWhD,GAAQ,EAAJA,GAEvC,OAAOrL,KAAKiI,qBAAqB+C,GAC5B,MAAY,WAARpH,EACJ5D,KAAKoJ,UAAUC,GAIbrJ,KAAKiI,qBAAqBoB,GAHxBrJ,KAAKgB,SAASO,MAAM,kEAIZ,aAARqC,EACJ5D,KAAKsJ,YAAYD,GAQfrJ,KAAKiI,qBAAqBoB,GAPxBrJ,KAAKgB,SAASO,MAAM,qNAQpB,OAAO8F,KAAKzD,IAEJ,YAARA,EADF5D,KAAKiI,qBAAqBoB,GAI1BrJ,KAAKgB,SAASO,MAAM,4BAA8BqC,EAC9B,iBAI/BkH,EAAQ7K,UAAU8I,aAAe,SAAqBuF,EAAInC,EAAQC,GAChE,GAAkB,iBAAPkC,EAAiB,CAC1B,IAAKnC,EACH,OAAOnM,KAAKgB,SAASO,MAAM,+CAC7B,IAAK4K,EAAOzL,eAAe4N,GACzB,OAAOtO,KAAKgB,SAASO,MAAM,iCAC7B+M,EAAKnC,EAAOmC,GAAIhB,MAAM,WACtB,IAAK,IAAIjC,EAAI,EAAGA,EAAIiD,EAAGhN,OAAQ+J,IAC7BiD,EAAGjD,IAAM,OACN,GAAI3J,MAAMC,QAAQ2M,GAAK,CAC5BA,EAAKA,EAAG1L,QACR,IAAK,IAAIyI,EAAI,EAAGA,EAAIiD,EAAGhN,OAAQ+J,IAC7BiD,EAAGjD,IAAM,EAGb,IAAK3J,MAAMC,QAAQ2M,GACjB,OAAOtO,KAAKgB,SAASO,MAAM,kDACUqH,KAAKC,UAAUyF,IAGtD,IAAKlC,EAAU,CACb,GAAIkC,EAAG,IAAM,GACX,OAAOtO,KAAKgB,SAASO,MAAM,+BAC7B+M,EAAGC,OAAO,EAAG,EAAW,GAARD,EAAG,GAAUA,EAAG,IAIlC,IAAI1P,EAAO,EACX,IAAK,IAAIyM,EAAI,EAAGA,EAAIiD,EAAGhN,OAAQ+J,IAAK,CAClC,IAAIiB,EAAQgC,EAAGjD,GACf,IAAKzM,IAAQ0N,GAAS,IAAMA,IAAU,EACpC1N,IAGJ,MAAM4P,EAAQtN,EAAO6B,MAAMnE,GAC3B,IAAIyC,EAASmN,EAAMlN,OAAS,EAC5B,IAAK,IAAI+J,EAAIiD,EAAGhN,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACvC,IAAIiB,EAAQgC,EAAGjD,GAEf,IADAmD,EAAMnN,KAAoB,IAARiL,GACVA,IAAU,GAAK,GACrBkC,EAAMnN,KAAY,IAAgB,IAARiL,EAG9B,OAAOtM,KAAKiI,qBAAqBuG,IAUnC1D,EAAQ7K,UAAU+I,YAAc,SAAoByF,EAAM7K,GACxD,IAAIyF,EACJ,MAAMqF,EAAO,IAAIzB,KAAKwB,GA0BtB,MAxBY,YAAR7K,EACFyF,EAAM,CACJ0E,EAAIW,EAAKC,kBACTZ,EAAIW,EAAKE,cAAgB,GACzBb,EAAIW,EAAKG,cACTd,EAAIW,EAAKI,eACTf,EAAIW,EAAKK,iBACThB,EAAIW,EAAKM,iBACT,KACAnM,KAAK,IACU,YAARe,EACTyF,EAAM,CACJ0E,EAAIW,EAAKC,iBAAmB,KAC5BZ,EAAIW,EAAKE,cAAgB,GACzBb,EAAIW,EAAKG,cACTd,EAAIW,EAAKI,eACTf,EAAIW,EAAKK,iBACThB,EAAIW,EAAKM,iBACT,KACAnM,KAAK,IAEP7C,KAAKgB,SAASO,MAAM,YAAcqC,EAAM,8BAGnC5D,KAAK8I,WAAWO,EAAK,WAG9ByB,EAAQ7K,UAAUgJ,YAAc,WAC9B,OAAOjJ,KAAKiI,qBAAqB,KAGnC6C,EAAQ7K,UAAUiJ,WAAa,SAAmBtD,EAAKuG,GACrD,GAAmB,iBAARvG,EAAkB,CAC3B,IAAKuG,EACH,OAAOnM,KAAKgB,SAASO,MAAM,+CAC7B,IAAK4K,EAAOzL,eAAekF,GACzB,OAAO5F,KAAKgB,SAASO,MAAM,+BACAqH,KAAKC,UAAUjD,IAE5CA,EAAMuG,EAAOvG,GAIf,GAAmB,iBAARA,IAAqB1E,EAAOE,SAASwE,GAAM,CACpD,MAAMqJ,EAAWrJ,EAAIsJ,WAChBtJ,EAAIuJ,MAAsB,IAAdF,EAAS,IACxBA,EAASG,QAAQ,GAEnBxJ,EAAM1E,EAAO2M,KAAKoB,GAGpB,GAAI/N,EAAOE,SAASwE,GAAM,CACxB,IAAIhH,EAAOgH,EAAItE,OACI,IAAfsE,EAAItE,QACN1C,IAEF,MAAMkE,EAAM5B,EAAO6B,MAAMnE,GAIzB,OAHAgH,EAAI1C,KAAKJ,GACU,IAAf8C,EAAItE,SACNwB,EAAI,GAAK,GACJ9C,KAAKiI,qBAAqBnF,GAGnC,GAAI8C,EAAM,IACR,OAAO5F,KAAKiI,qBAAqBrC,GAEnC,GAAIA,EAAM,IACR,OAAO5F,KAAKiI,qBAAqB,CAAC,EAAGrC,IAEvC,IAAIhH,EAAO,EACX,IAAK,IAAIyM,EAAIzF,EAAKyF,GAAK,IAAOA,IAAM,EAClCzM,IAEF,MAAMkE,EAAM,IAAIpB,MAAM9C,GACtB,IAAK,IAAIyM,EAAIvI,EAAIxB,OAAS,EAAG+J,GAAK,EAAGA,IACnCvI,EAAIuI,GAAW,IAANzF,EACTA,IAAQ,EAMV,OAJY,IAAT9C,EAAI,IACLA,EAAIsM,QAAQ,GAGPpP,KAAKiI,qBAAqB/G,EAAO2M,KAAK/K,KAG/CgI,EAAQ7K,UAAUkJ,YAAc,SAAoB1H,GAClD,OAAOzB,KAAKiI,qBAAqBxG,EAAQ,IAAO,IAGlDqJ,EAAQ7K,UAAU2H,KAAO,SAAavH,EAAQ6D,GAG5C,MAFsB,mBAAX7D,IACTA,EAASA,EAAO6D,IACX7D,EAAOS,YAAY,OAAO+J,MAGnCC,EAAQ7K,UAAUoI,aAAe,SAAqBgH,EAAYrO,EAAUwC,GAC1E,MAAMC,EAAQzD,KAAK0D,WACnB,IAAI2H,EACJ,GAAyB,OAArB5H,EAAe,QACjB,OAAO,EAET,MAAM7C,EAAOyO,EAAWxM,OAIxB,QAH4BuF,IAAxB3E,EAAM6L,gBACR7L,EAAM6L,cAAgBtP,KAAKmI,aAAa1E,EAAe,QAAGzC,EAAUwC,GAAQX,QAE1EjC,EAAKU,SAAWmC,EAAM6L,cAAchO,OACtC,OAAO,EAET,IAAK+J,EAAE,EAAGA,EAAIzK,EAAKU,OAAQ+J,IACzB,GAAIzK,EAAKyK,KAAO5H,EAAM6L,cAAcjE,GAClC,OAAO,EAEX,OAAO,gCCvQT,MAAM1L,EAAWjB,EAEjBiB,EAASgL,IAAM,EAAQ,MACvBhL,EAASwN,IAAM,EAAQ,mCCHvB,MAAMvN,EAAW,EAAQ,MAEnBkO,EAAa,EAAQ,MAE3B,SAASyB,EAAWlP,GAClByN,EAAWvN,KAAKP,KAAMK,GACtBL,KAAKS,IAAM,MAEbb,EAAS2P,EAAYzB,GACrBrP,EAAOC,QAAU6Q,EAEjBA,EAAWtP,UAAUc,OAAS,SAAgBH,EAAMC,GAClD,MAEM2O,EAFM1B,EAAW7N,UAAUc,OAAOR,KAAKP,KAAMY,GAErCqL,SAAS,UACjBnJ,EAAM,CAAE,cAAgBjC,EAAQ0M,MAAQ,SAC9C,IAAK,IAAIlC,EAAI,EAAGA,EAAImE,EAAElO,OAAQ+J,GAAK,GACjCvI,EAAIiC,KAAKyK,EAAE5M,MAAMyI,EAAGA,EAAI,KAE1B,OADAvI,EAAIiC,KAAK,YAAclE,EAAQ0M,MAAQ,SAChCzK,EAAID,KAAK,8BCrBlB,SAAWpE,EAAQC,GACjB,aAGA,SAAS0E,EAAQuC,EAAK8D,GACpB,IAAK9D,EAAK,MAAM,IAAI1G,MAAMwK,GAAO,oBAKnC,SAAS7J,EAAU6P,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS3P,UAAYyP,EAAUzP,UAC/BwP,EAAKxP,UAAY,IAAI2P,EACrBH,EAAKxP,UAAUgC,YAAcwN,EAK/B,SAASI,EAAIC,EAAQtQ,EAAMuQ,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT9P,KAAKiQ,SAAW,EAChBjQ,KAAKkQ,MAAQ,KACblQ,KAAKsB,OAAS,EAGdtB,KAAKmQ,IAAM,KAEI,OAAXL,IACW,OAATtQ,GAA0B,OAATA,IACnBuQ,EAASvQ,EACTA,EAAO,IAGTQ,KAAKkF,MAAM4K,GAAU,EAAGtQ,GAAQ,GAAIuQ,GAAU,OAYlD,IAAI7O,EATkB,iBAAXzC,EACTA,EAAOC,QAAUmR,EAEjBnR,EAAQmR,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IAEIlP,EADoB,oBAAXmP,aAAmD,IAAlBA,OAAOnP,OACxCmP,OAAOnP,OAEP,cAEX,MAAOwF,IAgIT,SAAS4J,EAAeC,EAAQ3G,GAC9B,IAAI4G,EAAID,EAAOlC,WAAWzE,GAE1B,OAAI4G,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASC,EAAcF,EAAQG,EAAY9G,GACzC,IAAI+G,EAAIL,EAAcC,EAAQ3G,GAI9B,OAHIA,EAAQ,GAAK8G,IACfC,GAAKL,EAAcC,EAAQ3G,EAAQ,IAAM,GAEpC+G,EA8CT,SAASC,EAAWvH,EAAKxC,EAAO6G,EAAKmD,GAGnC,IAFA,IAAIF,EAAI,EACJvF,EAAM0F,KAAK/D,IAAI1D,EAAI/H,OAAQoM,GACtBrC,EAAIxE,EAAOwE,EAAID,EAAKC,IAAK,CAChC,IAAImF,EAAInH,EAAIgF,WAAWhD,GAAK,GAE5BsF,GAAKE,EAIHF,GADEH,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOG,EAnNTd,EAAGG,KAAO,SAAepK,GACvB,OAAIA,aAAeiK,GAIJ,OAARjK,GAA+B,iBAARA,GAC5BA,EAAI3D,YAAYmO,WAAaP,EAAGO,UAAY1O,MAAMC,QAAQiE,EAAIsK,QAGlEL,EAAGkB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG9C,IAAM,SAAciE,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG5P,UAAUiF,MAAQ,SAAe4K,EAAQtQ,EAAMuQ,GAChD,GAAsB,iBAAXD,EACT,OAAO9P,KAAKmR,YAAYrB,EAAQtQ,EAAMuQ,GAGxC,GAAsB,iBAAXD,EACT,OAAO9P,KAAKoR,WAAWtB,EAAQtQ,EAAMuQ,GAG1B,QAATvQ,IACFA,EAAO,IAET4D,EAAO5D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqH,EAAQ,EACM,OAFlBiJ,EAASA,EAAO7D,WAAW2B,QAAQ,OAAQ,KAEhC,KACT/G,IACA7G,KAAKiQ,SAAW,GAGdpJ,EAAQiJ,EAAOxO,SACJ,KAAT9B,EACFQ,KAAKqR,UAAUvB,EAAQjJ,EAAOkJ,IAE9B/P,KAAKsR,WAAWxB,EAAQtQ,EAAMqH,GACf,OAAXkJ,GACF/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,MAM9CF,EAAG5P,UAAUkR,YAAc,SAAsBrB,EAAQtQ,EAAMuQ,GACzDD,EAAS,IACX9P,KAAKiQ,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX9P,KAAKkQ,MAAQ,CAAW,SAATJ,GACf9P,KAAKsB,OAAS,GACLwO,EAAS,kBAClB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB9P,KAAKsB,OAAS,IAEd8B,EAAO0M,EAAS,kBAChB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF9P,KAAKsB,OAAS,GAGD,OAAXyO,GAGJ/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,IAGxCF,EAAG5P,UAAUmR,WAAa,SAAqBtB,EAAQtQ,EAAMuQ,GAG3D,GADA3M,EAAgC,iBAAlB0M,EAAOxO,QACjBwO,EAAOxO,QAAU,EAGnB,OAFAtB,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EACPtB,KAGTA,KAAKsB,OAASwP,KAAKS,KAAKzB,EAAOxO,OAAS,GACxCtB,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAGlB,IAAIC,EAAGkG,EACHC,EAAM,EACV,GAAe,OAAX1B,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAGgK,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,UAGC,GAAe,OAAXyE,EACT,IAAK1E,EAAI,EAAGC,EAAI,EAAGD,EAAIyE,EAAOxO,OAAQ+J,GAAK,EACzCmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,KAIN,OAAOtL,KAAK0R,SAyBd7B,EAAG5P,UAAUoR,UAAY,SAAoBvB,EAAQjJ,EAAOkJ,GAE1D/P,KAAKsB,OAASwP,KAAKS,MAAMzB,EAAOxO,OAASuF,GAAS,GAClD7G,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAIlB,IAGImG,EAHAC,EAAM,EACNnG,EAAI,EAGR,GAAe,OAAXyE,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAG+J,GAAKxE,EAAOwE,GAAK,EAC3CmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,OAKX,IAAKpG,GADayE,EAAOxO,OAASuF,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOwE,EAAIyE,EAAOxO,OAAQ+J,GAAK,EAC1EmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,EAKbzR,KAAK0R,SA2BP7B,EAAG5P,UAAUqR,WAAa,SAAqBxB,EAAQtQ,EAAMqH,GAE3D7G,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EAGd,IAAK,IAAIqQ,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWpS,EAClEmS,IAEFA,IACAC,EAAWA,EAAUpS,EAAQ,EAO7B,IALA,IAAIqS,EAAQ/B,EAAOxO,OAASuF,EACxBiL,EAAMD,EAAQF,EACdjE,EAAMoD,KAAK/D,IAAI8E,EAAOA,EAAQC,GAAOjL,EAErCkL,EAAO,EACF1G,EAAIxE,EAAOwE,EAAIqC,EAAKrC,GAAKsG,EAChCI,EAAOnB,EAAUd,EAAQzE,EAAGA,EAAIsG,EAASnS,GAEzCQ,KAAKgS,MAAMJ,GACP5R,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOnB,EAAUd,EAAQzE,EAAGyE,EAAOxO,OAAQ9B,GAEtC6L,EAAI,EAAGA,EAAIyG,EAAKzG,IACnB6G,GAAO1S,EAGTQ,KAAKgS,MAAME,GACPlS,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB/R,KAAK0R,SAGP7B,EAAG5P,UAAUiD,KAAO,SAAeiP,GACjCA,EAAKjC,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/B8G,EAAKjC,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAE7B8G,EAAK7Q,OAAStB,KAAKsB,OACnB6Q,EAAKlC,SAAWjQ,KAAKiQ,SACrBkC,EAAKhC,IAAMnQ,KAAKmQ,KAGlBN,EAAG5P,UAAU0E,MAAQ,WACnB,IAAIgM,EAAI,IAAId,EAAG,MAEf,OADA7P,KAAKkD,KAAKyN,GACHA,GAGTd,EAAG5P,UAAUmS,QAAU,SAAkBxT,GACvC,KAAOoB,KAAKsB,OAAS1C,GACnBoB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAE9B,OAAOtB,MAIT6P,EAAG5P,UAAUyR,MAAQ,WACnB,KAAO1R,KAAKsB,OAAS,GAAqC,IAAhCtB,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IACjDtB,KAAKsB,SAEP,OAAOtB,KAAKqS,aAGdxC,EAAG5P,UAAUoS,UAAY,WAKvB,OAHoB,IAAhBrS,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,KAClClQ,KAAKiQ,SAAW,GAEXjQ,MAGT6P,EAAG5P,UAAUqS,QAAU,WACrB,OAAQtS,KAAKmQ,IAAM,UAAY,SAAWnQ,KAAKiM,SAAS,IAAM,KAiChE,IAAIsG,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAsjB9D,SAASC,EAAYC,EAAM/M,EAAK9C,GAC9BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnC,IAAI7E,EAAOuH,EAAKrR,OAASsE,EAAItE,OAAU,EACvCwB,EAAIxB,OAAS8J,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIwH,EAAoB,EAAhBD,EAAKzC,MAAM,GACf2C,EAAmB,EAAfjN,EAAIsK,MAAM,GACdS,EAAIiC,EAAIC,EAERC,EAAS,SAAJnC,EACLoC,EAASpC,EAAI,SAAa,EAC9B7N,EAAIoN,MAAM,GAAK4C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI5H,EAAK4H,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAK2H,EAAI1H,EAAK,EAIlB2H,IADAtC,GAFAiC,EAAoB,EAAhBD,EAAKzC,MAAM7E,KACfwH,EAAmB,EAAfjN,EAAIsK,MAAM5E,IACF4H,GACG,SAAa,EAC5BA,EAAY,SAAJvC,EAEV7N,EAAIoN,MAAM8C,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFjQ,EAAIoN,MAAM8C,GAAa,EAARD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAzlBb7B,EAAG5P,UAAUgM,SAAW,SAAmBzM,EAAM4T,GAI/C,IAAItQ,EACJ,GAHAsQ,EAAoB,EAAVA,GAAe,EAGZ,MAJb5T,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCsD,EAAM,GAGN,IAFA,IAAI2O,EAAM,EACNsB,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,EAAIxR,KAAKkQ,MAAM7E,GACf0G,GAA+B,UAArBP,GAAKC,EAAOsB,IAAmB9G,SAAS,IAGpDnJ,EADY,IADdiQ,EAASvB,IAAO,GAAKC,EAAQ,WACVpG,IAAMrL,KAAKsB,OAAS,EAC/BiR,EAAM,EAAIR,EAAKzQ,QAAUyQ,EAAOjP,EAEhCiP,EAAOjP,GAEf2O,GAAO,IACI,KACTA,GAAO,GACPpG,KAMJ,IAHc,IAAV0H,IACFjQ,EAAMiQ,EAAM9G,SAAS,IAAMnJ,GAEtBA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGT,GAAItD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI6T,EAAYb,EAAWhT,GAEvB8T,EAAYb,EAAWjT,GAC3BsD,EAAM,GACN,IAAI0N,EAAIxQ,KAAK2E,QAEb,IADA6L,EAAEP,SAAW,GACLO,EAAE+C,UAAU,CAClB,IAAI5C,EAAIH,EAAEgD,KAAKF,GAAWrH,SAASzM,GAMjCsD,GALF0N,EAAIA,EAAEiD,MAAMH,IAELC,SAGC5C,EAAI7N,EAFJyP,EAAMc,EAAY1C,EAAErP,QAAUqP,EAAI7N,EAQ5C,IAHI9C,KAAKuT,WACPzQ,EAAM,IAAMA,GAEPA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGTM,GAAO,EAAO,oCAGhByM,EAAG5P,UAAUyT,SAAW,WACtB,IAAIC,EAAM3T,KAAKkQ,MAAM,GASrB,OARoB,IAAhBlQ,KAAKsB,OACPqS,GAAuB,SAAhB3T,KAAKkQ,MAAM,GACO,IAAhBlQ,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,GAEzCyD,GAAO,iBAAoC,SAAhB3T,KAAKkQ,MAAM,GAC7BlQ,KAAKsB,OAAS,GACvB8B,GAAO,EAAO,8CAEU,IAAlBpD,KAAKiQ,UAAmB0D,EAAMA,GAGxC9D,EAAG5P,UAAU2T,OAAS,WACpB,OAAO5T,KAAKiM,SAAS,KAGvB4D,EAAG5P,UAAU4T,SAAW,SAAmB9D,EAAQzO,GAEjD,OADA8B,OAAyB,IAAXlC,GACPlB,KAAK8T,YAAY5S,EAAQ6O,EAAQzO,IAG1CuO,EAAG5P,UAAUiP,QAAU,SAAkBa,EAAQzO,GAC/C,OAAOtB,KAAK8T,YAAYpS,MAAOqO,EAAQzO,IAGzCuO,EAAG5P,UAAU6T,YAAc,SAAsBC,EAAWhE,EAAQzO,GAClE,IAAIS,EAAa/B,KAAK+B,aAClBiS,EAAY1S,GAAUwP,KAAKC,IAAI,EAAGhP,GACtCqB,EAAOrB,GAAciS,EAAW,yCAChC5Q,EAAO4Q,EAAY,EAAG,+BAEtBhU,KAAK0R,QACL,IAGImB,EAAGxH,EAHH4I,EAA0B,OAAXlE,EACfvN,EAAM,IAAIuR,EAAUC,GAGpBE,EAAIlU,KAAK2E,QACb,GAAKsP,EAYE,CACL,IAAK5I,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAI6I,GAAKwH,EAGX,KAAOxH,EAAI2I,EAAW3I,IACpB7I,EAAI6I,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI2I,EAAYjS,EAAYsJ,IACtC7I,EAAI6I,GAAK,EAGX,IAAKA,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAIwR,EAAY3I,EAAI,GAAKwH,EAe7B,OAAOrQ,GAGLsO,KAAKuD,MACPxE,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,OAAO,GAAKV,KAAKuD,MAAM7C,IAGzB3B,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,IAAI+C,EAAI/C,EACJb,EAAI,EAiBR,OAhBI4D,GAAK,OACP5D,GAAK,GACL4D,KAAO,IAELA,GAAK,KACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAEF5D,EAAI4D,GAIf1E,EAAG5P,UAAUuU,UAAY,SAAoBhD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAI+C,EAAI/C,EACJb,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ4D,KACH5D,GAAK,GACL4D,KAAO,IAEU,IAAV,IAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,GAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,IACH5D,IAEKA,GAITd,EAAG5P,UAAUwU,UAAY,WACvB,IAAIjD,EAAIxR,KAAKkQ,MAAMlQ,KAAKsB,OAAS,GAC7BoT,EAAK1U,KAAKsU,WAAW9C,GACzB,OAA2B,IAAnBxR,KAAKsB,OAAS,GAAUoT,GAiBlC7E,EAAG5P,UAAU0U,SAAW,WACtB,GAAI3U,KAAKuT,SAAU,OAAO,EAG1B,IADA,IAAI5C,EAAI,EACCtF,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAIwH,EAAI7S,KAAKwU,UAAUxU,KAAKkQ,MAAM7E,IAElC,GADAsF,GAAKkC,EACK,KAANA,EAAU,MAEhB,OAAOlC,GAGTd,EAAG5P,UAAU8B,WAAa,WACxB,OAAO+O,KAAKS,KAAKvR,KAAKyU,YAAc,IAGtC5E,EAAG5P,UAAU2U,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7U,KAAKiQ,SACAjQ,KAAK8U,MAAMC,MAAMF,GAAOG,MAAM,GAEhChV,KAAK2E,SAGdkL,EAAG5P,UAAUgV,SAAW,SAAmBJ,GACzC,OAAI7U,KAAKkV,MAAML,EAAQ,GACd7U,KAAKmV,KAAKN,GAAOG,MAAM,GAAGI,OAE5BpV,KAAK2E,SAGdkL,EAAG5P,UAAUoV,MAAQ,WACnB,OAAyB,IAAlBrV,KAAKiQ,UAIdJ,EAAG5P,UAAUqV,IAAM,WACjB,OAAOtV,KAAK2E,QAAQyQ,QAGtBvF,EAAG5P,UAAUmV,KAAO,WAKlB,OAJKpV,KAAKuT,WACRvT,KAAKiQ,UAAY,GAGZjQ,MAIT6P,EAAG5P,UAAUsV,KAAO,SAAe3P,GACjC,KAAO5F,KAAKsB,OAASsE,EAAItE,QACvBtB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAG9B,IAAK,IAAI+J,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAC9BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAG5C,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUuV,IAAM,SAAc5P,GAE/B,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAKuV,KAAK3P,IAInBiK,EAAG5P,UAAUwV,GAAK,SAAa7P,GAC7B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6Q,IAAI5P,GAC/CA,EAAIjB,QAAQ6Q,IAAIxV,OAGzB6P,EAAG5P,UAAUyV,IAAM,SAAc9P,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ4Q,KAAK3P,GAChDA,EAAIjB,QAAQ4Q,KAAKvV,OAI1B6P,EAAG5P,UAAU0V,MAAQ,SAAgB/P,GAEnC,IAAIiN,EAEFA,EADE7S,KAAKsB,OAASsE,EAAItE,OAChBsE,EAEA5F,KAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAK5C,OAFArL,KAAKsB,OAASuR,EAAEvR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU2V,KAAO,SAAehQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK2V,MAAM/P,IAIpBiK,EAAG5P,UAAU4V,IAAM,SAAcjQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQiR,KAAKhQ,GAChDA,EAAIjB,QAAQiR,KAAK5V,OAG1B6P,EAAG5P,UAAU6V,KAAO,SAAelQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQgR,MAAM/P,GACjDA,EAAIjB,QAAQgR,MAAM3V,OAI3B6P,EAAG5P,UAAU8V,MAAQ,SAAgBnQ,GAEnC,IAAIgN,EACAC,EACA7S,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAAKwH,EAAE3C,MAAM7E,GAGvC,GAAIrL,OAAS4S,EACX,KAAOvH,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAM5B,OAFArL,KAAKsB,OAASsR,EAAEtR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU+V,KAAO,SAAepQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK+V,MAAMnQ,IAIpBiK,EAAG5P,UAAUgW,IAAM,SAAcrQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQqR,KAAKpQ,GAChDA,EAAIjB,QAAQqR,KAAKhW,OAG1B6P,EAAG5P,UAAUiW,KAAO,SAAetQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQoR,MAAMnQ,GACjDA,EAAIjB,QAAQoR,MAAM/V,OAI3B6P,EAAG5P,UAAU8U,MAAQ,SAAgBF,GACnCzR,EAAwB,iBAAVyR,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBrF,KAAKS,KAAKsD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7U,KAAKoS,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAa9K,IAC/BrL,KAAKkQ,MAAM7E,GAAsB,UAAhBrL,KAAKkQ,MAAM7E,GAS9B,OALI+K,EAAW,IACbpW,KAAKkQ,MAAM7E,IAAMrL,KAAKkQ,MAAM7E,GAAM,UAAc,GAAK+K,GAIhDpW,KAAK0R,SAGd7B,EAAG5P,UAAUkV,KAAO,SAAeN,GACjC,OAAO7U,KAAK2E,QAAQoQ,MAAMF,IAI5BhF,EAAG5P,UAAUoW,KAAO,SAAeC,EAAK3Q,GACtCvC,EAAsB,iBAARkT,GAAoBA,GAAO,GAEzC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtW,KAAKoS,QAAQX,EAAM,GAGjBzR,KAAKkQ,MAAMuB,GADT9L,EACgB3F,KAAKkQ,MAAMuB,GAAQ,GAAK8E,EAExBvW,KAAKkQ,MAAMuB,KAAS,GAAK8E,GAGtCvW,KAAK0R,SAId7B,EAAG5P,UAAUuW,KAAO,SAAe5Q,GACjC,IAAI+K,EAkBAiC,EAAGC,EAfP,GAAsB,IAAlB7S,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAI7B,OAHAjQ,KAAKiQ,SAAW,EAChBU,EAAI3Q,KAAKyW,KAAK7Q,GACd5F,KAAKiQ,UAAY,EACVjQ,KAAKqS,YAGP,GAAsB,IAAlBrS,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAIpC,OAHArK,EAAIqK,SAAW,EACfU,EAAI3Q,KAAKyW,KAAK7Q,GACdA,EAAIqK,SAAW,EACRU,EAAE0B,YAKPrS,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,EAC1C/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAEhB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAClCsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,EACvB/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAIhB,GADA3Q,KAAKsB,OAASsR,EAAEtR,OACF,IAAVyR,EACF/S,KAAKkQ,MAAMlQ,KAAKsB,QAAUyR,EAC1B/S,KAAKsB,cAEA,GAAIsR,IAAM5S,KACf,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAI5B,OAAOrL,MAIT6P,EAAG5P,UAAUyW,IAAM,SAAc9Q,GAC/B,IAAIpD,EACJ,OAAqB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UAC7BrK,EAAIqK,SAAW,EACfzN,EAAMxC,KAAK2W,IAAI/Q,GACfA,EAAIqK,UAAY,EACTzN,GACmB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UACpCjQ,KAAKiQ,SAAW,EAChBzN,EAAMoD,EAAI+Q,IAAI3W,MACdA,KAAKiQ,SAAW,EACTzN,GAGLxC,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6R,KAAK5Q,GAEhDA,EAAIjB,QAAQ6R,KAAKxW,OAI1B6P,EAAG5P,UAAUwW,KAAO,SAAe7Q,GAEjC,GAAqB,IAAjBA,EAAIqK,SAAgB,CACtBrK,EAAIqK,SAAW,EACf,IAAIU,EAAI3Q,KAAKwW,KAAK5Q,GAElB,OADAA,EAAIqK,SAAW,EACRU,EAAE0B,YAGJ,GAAsB,IAAlBrS,KAAKiQ,SAId,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKwW,KAAK5Q,GACV5F,KAAKiQ,SAAW,EACTjQ,KAAKqS,YAId,IAWIO,EAAGC,EAXH3B,EAAMlR,KAAKkR,IAAItL,GAGnB,GAAY,IAARsL,EAIF,OAHAlR,KAAKiQ,SAAW,EAChBjQ,KAAKsB,OAAS,EACdtB,KAAKkQ,MAAM,GAAK,EACTlQ,KAKLkR,EAAM,GACR0B,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAE5B0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,IAC7B,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAElB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAElC0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,IACV,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAIlB,GAAc,IAAVoC,GAAe1H,EAAIuH,EAAEtR,QAAUsR,IAAM5S,KACvC,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAU5B,OANArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,GAEhCuH,IAAM5S,OACRA,KAAKiQ,SAAW,GAGXjQ,KAAK0R,SAId7B,EAAG5P,UAAU0W,IAAM,SAAc/Q,GAC/B,OAAO5F,KAAK2E,QAAQ8R,KAAK7Q,IA+C3B,IAAIgR,EAAc,SAAsBjE,EAAM/M,EAAK9C,GACjD,IAIIgQ,EACA+D,EACAnC,EANA9B,EAAID,EAAKzC,MACT2C,EAAIjN,EAAIsK,MACR4G,EAAIhU,EAAIoN,MACRM,EAAI,EAIJuG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnG,EAAE,GACPoG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtG,EAAE,GACPuG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzG,EAAE,GACP0G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5G,EAAE,GACP6G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP/G,EAAE,GACPgH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlH,EAAE,GACPmH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrH,EAAE,GACPsH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxH,EAAE,GACPyH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3H,EAAE,GACP4H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB1X,EAAImN,SAAW0C,EAAK1C,SAAWrK,EAAIqK,SACnCnN,EAAIxB,OAAS,GAMb,IAAIqZ,IAAQnK,GAJZsC,EAAKhC,KAAK8J,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM/F,KAAK8J,KAAK5D,EAAK+B,IACRjI,KAAK8J,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDtI,IAFAkE,EAAK5D,KAAK8J,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKhC,KAAK8J,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKzD,EAAK4B,IACRjI,KAAK8J,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQrK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKkC,GAAQ,GACvBpI,KAAK8J,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDzI,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKhC,KAAK8J,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKtD,EAAKyB,IACRjI,KAAK8J,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKrD,EAAKwB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK+B,GAAQ,GACvBpI,KAAK8J,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQtK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKqC,GAAQ,GACvBvI,KAAK8J,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD5I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKhC,KAAK8J,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKnD,EAAKsB,IACRjI,KAAK8J,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKlD,EAAKqB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK4B,GAAQ,GACvBpI,KAAK8J,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKkC,GAAQ,GACvBvI,KAAK8J,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQvK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKwC,GAAQ,GACvB1I,KAAK8J,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD/I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKhC,KAAK8J,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKhD,EAAKmB,IACRjI,KAAK8J,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK/C,EAAKkB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKyB,GAAQ,GACvBpI,KAAK8J,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK+B,GAAQ,GACvBvI,KAAK8J,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKqC,GAAQ,GACvB1I,KAAK8J,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQxK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK2C,IAAQ,GACvB7I,KAAK8J,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDlJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKhC,KAAK8J,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK7C,EAAKgB,IACRjI,KAAK8J,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK5C,EAAKe,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKsB,GAAQ,GACvBpI,KAAK8J,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK4B,GAAQ,GACvBvI,KAAK8J,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKkC,GAAQ,GACvB1I,KAAK8J,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKiC,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKwC,IAAQ,GACvB7I,KAAK8J,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQzK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK8C,IAAQ,GACvBhJ,KAAK8J,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDrJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKhC,KAAK8J,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK1C,EAAKa,IACRjI,KAAK8J,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKzC,EAAKY,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKmB,GAAQ,GACvBpI,KAAK8J,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKyB,GAAQ,GACvBvI,KAAK8J,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK+B,GAAQ,GACvB1I,KAAK8J,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK8B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKqC,IAAQ,GACvB7I,KAAK8J,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK2C,IAAQ,GACvBhJ,KAAK8J,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ1K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKiD,IAAQ,GACvBnJ,KAAK8J,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDxJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKhC,KAAK8J,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKvC,EAAKU,IACRjI,KAAK8J,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKtC,EAAKS,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKgB,GAAQ,GACvBpI,KAAK8J,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKsB,GAAQ,GACvBvI,KAAK8J,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK4B,GAAQ,GACvB1I,KAAK8J,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK2B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKkC,IAAQ,GACvB7I,KAAK8J,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKwC,IAAQ,GACvBhJ,KAAK8J,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK8C,IAAQ,GACvBnJ,KAAK8J,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ3K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKoD,IAAQ,GACvBtJ,KAAK8J,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD3J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKhC,KAAK8J,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKpC,EAAKO,IACRjI,KAAK8J,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKnC,EAAKM,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKa,GAAQ,GACvBpI,KAAK8J,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKmB,GAAQ,GACvBvI,KAAK8J,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKyB,GAAQ,GACvB1I,KAAK8J,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKwB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK+B,IAAQ,GACvB7I,KAAK8J,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKqC,IAAQ,GACvBhJ,KAAK8J,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKoC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK2C,IAAQ,GACvBnJ,KAAK8J,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKiD,IAAQ,GACvBtJ,KAAK8J,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ5K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKuD,IAAQ,GACvBzJ,KAAK8J,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD9J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKhC,KAAK8J,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKI,IACRjI,KAAK8J,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKhC,EAAKG,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKU,GAAQ,GACvBpI,KAAK8J,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKS,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKgB,GAAQ,GACvBvI,KAAK8J,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKsB,GAAQ,GACvB1I,KAAK8J,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKqB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK4B,IAAQ,GACvB7I,KAAK8J,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKkC,IAAQ,GACvBhJ,KAAK8J,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKwC,IAAQ,GACvBnJ,KAAK8J,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK8C,IAAQ,GACvBtJ,KAAK8J,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK6C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKoD,IAAQ,GACvBzJ,KAAK8J,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQ7K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK0D,IAAQ,GACvB5J,KAAK8J,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKhC,KAAK8J,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKO,IACRpI,KAAK8J,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK5D,KAAK8J,KAAKhC,EAAKM,GACpBpG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKa,GAAQ,GACvBvI,KAAK8J,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKY,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKmB,GAAQ,GACvB1I,KAAK8J,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKkB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKyB,IAAQ,GACvB7I,KAAK8J,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK+B,IAAQ,GACvBhJ,KAAK8J,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK8B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKqC,IAAQ,GACvBnJ,KAAK8J,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK2C,IAAQ,GACvBtJ,KAAK8J,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK0C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKiD,IAAQ,GACvBzJ,KAAK8J,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS9K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKuD,IAAQ,GACvB5J,KAAK8J,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKhC,KAAK8J,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKU,IACRvI,KAAK8J,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK5D,KAAK8J,KAAKhC,EAAKS,GACpBvG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKgB,GAAQ,GACvB1I,KAAK8J,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKe,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKsB,IAAQ,GACvB7I,KAAK8J,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK4B,IAAQ,GACvBhJ,KAAK8J,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKkC,IAAQ,GACvBnJ,KAAK8J,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKwC,IAAQ,GACvBtJ,KAAK8J,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKuC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK8C,IAAQ,GACvBzJ,KAAK8J,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS/K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKoD,IAAQ,GACvB5J,KAAK8J,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKhC,KAAK8J,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKa,IACR1I,KAAK8J,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK5D,KAAK8J,KAAKhC,EAAKY,GACpB1G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKmB,IAAQ,GACvB7I,KAAK8J,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKkB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKyB,IAAQ,GACvBhJ,KAAK8J,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK+B,IAAQ,GACvBnJ,KAAK8J,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKqC,IAAQ,GACvBtJ,KAAK8J,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKoC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK2C,IAAQ,GACvBzJ,KAAK8J,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAShL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKiD,IAAQ,GACvB5J,KAAK8J,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKhC,KAAK8J,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKgB,KACR7I,KAAK8J,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK5D,KAAK8J,KAAKhC,EAAKe,IACpB7G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKsB,IAAQ,GACvBhJ,KAAK8J,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKqB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK4B,IAAQ,GACvBnJ,KAAK8J,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKkC,IAAQ,GACvBtJ,KAAK8J,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKiC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKwC,IAAQ,GACvBzJ,KAAK8J,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASjL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK8C,IAAQ,GACvB5J,KAAK8J,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKhC,KAAK8J,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKmB,KACRhJ,KAAK8J,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK5D,KAAK8J,KAAKhC,EAAKkB,IACpBhH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKyB,IAAQ,GACvBnJ,KAAK8J,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKwB,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK+B,IAAQ,GACvBtJ,KAAK8J,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK8B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKqC,IAAQ,GACvBzJ,KAAK8J,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASlL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK2C,IAAQ,GACvB5J,KAAK8J,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKhC,KAAK8J,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKsB,KACRnJ,KAAK8J,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK5D,KAAK8J,KAAKhC,EAAKqB,IACpBnH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK4B,IAAQ,GACvBtJ,KAAK8J,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK2B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKkC,IAAQ,GACvBzJ,KAAK8J,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASnL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKwC,IAAQ,GACvB5J,KAAK8J,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKhC,KAAK8J,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKyB,KACRtJ,KAAK8J,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK5D,KAAK8J,KAAKhC,EAAKwB,IACpBtH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK+B,IAAQ,GACvBzJ,KAAK8J,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASpL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKqC,IAAQ,GACvB5J,KAAK8J,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKhC,KAAK8J,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK4B,KACRzJ,KAAK8J,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK5D,KAAK8J,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASrL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKkC,IAAQ,GACvB5J,KAAK8J,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAStL,GAJbsC,EAAKhC,KAAK8J,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK+B,KACR5J,KAAK8J,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAjK,IAFAkE,EAAK5D,KAAK8J,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANtL,IACFsG,EAAE,IAAMtG,EACR1N,EAAIxB,UAECwB,GAiDT,SAASiZ,EAAYpJ,EAAM/M,EAAK9C,GAE9B,OADW,IAAIkZ,GACHC,KAAKtJ,EAAM/M,EAAK9C,GAsB9B,SAASkZ,EAAME,EAAGC,GAChBnc,KAAKkc,EAAIA,EACTlc,KAAKmc,EAAIA,EAvENrL,KAAK8J,OACRhE,EAAclE,GAiDhB7C,EAAG5P,UAAUmc,MAAQ,SAAgBxW,EAAK9C,GACxC,IAAIN,EACA4I,EAAMpL,KAAKsB,OAASsE,EAAItE,OAW5B,OATEkB,EADkB,KAAhBxC,KAAKsB,QAAgC,KAAfsE,EAAItE,OACtBsV,EAAY5W,KAAM4F,EAAK9C,GACpBsI,EAAM,GACTsH,EAAW1S,KAAM4F,EAAK9C,GACnBsI,EAAM,KArDnB,SAAmBuH,EAAM/M,EAAK9C,GAC5BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnCnN,EAAIxB,OAASqR,EAAKrR,OAASsE,EAAItE,OAI/B,IAFA,IAAIyR,EAAQ,EACRsJ,EAAU,EACLrJ,EAAI,EAAGA,EAAIlQ,EAAIxB,OAAS,EAAG0R,IAAK,CAGvC,IAAIC,EAASoJ,EACbA,EAAU,EAGV,IAFA,IAAInJ,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAI2H,EAAI1H,EAGRqF,GAFoB,EAAhBgC,EAAKzC,MAAM7E,KACI,EAAfzF,EAAIsK,MAAM5E,IAGdwH,EAAS,SAAJnC,EAGTuC,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBmJ,IAFApJ,GAHAA,EAAUA,GAAWtC,EAAI,SAAa,GAAM,IAGxBmC,IAAO,IAAO,KAEZ,GACtBG,GAAU,SAEZnQ,EAAIoN,MAAM8C,GAAKE,EACfH,EAAQE,EACRA,EAASoJ,EAQX,OANc,IAAVtJ,EACFjQ,EAAIoN,MAAM8C,GAAKD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAgBH4K,CAAStc,KAAM4F,EAAK9C,GAEpBiZ,EAAW/b,KAAM4F,EAAK9C,GAGvBN,GAWTwZ,EAAK/b,UAAUsc,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAI7S,MAAM8a,GACdC,EAAI5M,EAAG5P,UAAUqU,WAAWkI,GAAK,EAC5BnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBkJ,EAAElJ,GAAKrL,KAAK0c,OAAOrR,EAAGoR,EAAGD,GAG3B,OAAOjI,GAITyH,EAAK/b,UAAUyc,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAtR,EAAI,EAAGA,EAAIoR,EAAGpR,IACrBsR,IAAW,EAAJT,IAAWO,EAAIpR,EAAI,EAC1B6Q,IAAM,EAGR,OAAOS,GAKTX,EAAK/b,UAAU2c,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAGnR,IACrB2R,EAAK3R,GAAKyR,EAAID,EAAIxR,IAClB4R,EAAK5R,GAAK0R,EAAIF,EAAIxR,KAItB2Q,EAAK/b,UAAUid,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE7c,KAAK4c,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQtM,KAAKuM,IAAI,EAAIvM,KAAKwM,GAAKb,GAC/Bc,EAAQzM,KAAK0M,IAAI,EAAI1M,KAAKwM,GAAKb,GAE1BjN,EAAI,EAAGA,EAAIgN,EAAGhN,GAAKiN,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJjS,EAAI,EAAGA,EAAI6R,EAAG7R,IAAK,CAC1B,IAAImC,EAAKuP,EAAKxN,EAAIlE,GACdqS,EAAKV,EAAKzN,EAAIlE,GAEdsS,EAAKZ,EAAKxN,EAAIlE,EAAI6R,GAClBU,EAAKZ,EAAKzN,EAAIlE,EAAI6R,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAKxN,EAAIlE,GAAKmC,EAAKmQ,EACnBX,EAAKzN,EAAIlE,GAAKqS,EAAKE,EAEnBb,EAAKxN,EAAIlE,EAAI6R,GAAK1P,EAAKmQ,EACvBX,EAAKzN,EAAIlE,EAAI6R,GAAKQ,EAAKE,EAGnBvS,IAAMmR,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB9B,EAAK/b,UAAU8d,YAAc,SAAsBC,EAAGjf,GACpD,IAAIyd,EAAqB,EAAjB1L,KAAKC,IAAIhS,EAAGif,GAChBC,EAAU,EAAJzB,EACNnR,EAAI,EACR,IAAKmR,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BnR,IAGF,OAAO,GAAKA,EAAI,EAAI4S,GAGtBjC,EAAK/b,UAAUie,UAAY,SAAoBpB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAIkJ,EAAIuI,EAAIzR,GAEZyR,EAAIzR,GAAKyR,EAAIN,EAAInR,EAAI,GACrByR,EAAIN,EAAInR,EAAI,GAAKkJ,EAEjBA,EAAIwI,EAAI1R,GAER0R,EAAI1R,IAAM0R,EAAIP,EAAInR,EAAI,GACtB0R,EAAIP,EAAInR,EAAI,IAAMkJ,IAItByH,EAAK/b,UAAUke,aAAe,SAAuBC,EAAI5B,GAEvD,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAImG,EAAoC,KAAhCV,KAAKuN,MAAMD,EAAG,EAAI/S,EAAI,GAAKmR,GACjC1L,KAAKuN,MAAMD,EAAG,EAAI/S,GAAKmR,GACvBzJ,EAEFqL,EAAG/S,GAAS,SAAJmG,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO4M,GAGTpC,EAAK/b,UAAUqe,WAAa,SAAqBF,EAAIhT,EAAK0R,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAID,EAAKC,IACvB0H,GAAyB,EAARqL,EAAG/S,GAEpByR,EAAI,EAAIzR,GAAa,KAAR0H,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAIzR,EAAI,GAAa,KAAR0H,EAAgBA,KAAkB,GAIrD,IAAK1H,EAAI,EAAID,EAAKC,EAAImR,IAAKnR,EACzByR,EAAIzR,GAAK,EAGXjI,EAAiB,IAAV2P,GACP3P,EAA6B,KAAb,KAAR2P,KAGViJ,EAAK/b,UAAUse,KAAO,SAAe/B,GAEnC,IADA,IAAIgC,EAAK,IAAI9c,MAAM8a,GACVnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBmT,EAAGnT,GAAK,EAGV,OAAOmT,GAGTxC,EAAK/b,UAAUgc,KAAO,SAAeC,EAAGC,EAAGrZ,GACzC,IAAI0Z,EAAI,EAAIxc,KAAK+d,YAAY7B,EAAE5a,OAAQ6a,EAAE7a,QAErCub,EAAM7c,KAAKuc,QAAQC,GAEnBiC,EAAIze,KAAKue,KAAK/B,GAEdM,EAAM,IAAIpb,MAAM8a,GAChBkC,EAAO,IAAIhd,MAAM8a,GACjBmC,EAAO,IAAIjd,MAAM8a,GAEjBoC,EAAO,IAAIld,MAAM8a,GACjBqC,EAAQ,IAAInd,MAAM8a,GAClBsC,EAAQ,IAAIpd,MAAM8a,GAElBuC,EAAOjc,EAAIoN,MACf6O,EAAKzd,OAASkb,EAEdxc,KAAKse,WAAWpC,EAAEhM,MAAOgM,EAAE5a,OAAQwb,EAAKN,GACxCxc,KAAKse,WAAWnC,EAAEjM,MAAOiM,EAAE7a,OAAQsd,EAAMpC,GAEzCxc,KAAKkd,UAAUJ,EAAK2B,EAAGC,EAAMC,EAAMnC,EAAGK,GACtC7c,KAAKkd,UAAU0B,EAAMH,EAAGI,EAAOC,EAAOtC,EAAGK,GAEzC,IAAK,IAAIxR,EAAI,EAAGA,EAAImR,EAAGnR,IAAK,CAC1B,IAAIyS,EAAKY,EAAKrT,GAAKwT,EAAMxT,GAAKsT,EAAKtT,GAAKyT,EAAMzT,GAC9CsT,EAAKtT,GAAKqT,EAAKrT,GAAKyT,EAAMzT,GAAKsT,EAAKtT,GAAKwT,EAAMxT,GAC/CqT,EAAKrT,GAAKyS,EAUZ,OAPA9d,KAAKke,UAAUQ,EAAMC,EAAMnC,GAC3Bxc,KAAKkd,UAAUwB,EAAMC,EAAMI,EAAMN,EAAGjC,EAAGK,GACvC7c,KAAKke,UAAUa,EAAMN,EAAGjC,GACxBxc,KAAKme,aAAaY,EAAMvC,GAExB1Z,EAAImN,SAAWiM,EAAEjM,SAAWkM,EAAElM,SAC9BnN,EAAIxB,OAAS4a,EAAE5a,OAAS6a,EAAE7a,OACnBwB,EAAI4O,SAIb7B,EAAG5P,UAAU4Q,IAAM,SAAcjL,GAC/B,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCtB,KAAKoc,MAAMxW,EAAK9C,IAIzB+M,EAAG5P,UAAU+e,KAAO,SAAepZ,GACjC,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCya,EAAW/b,KAAM4F,EAAK9C,IAI/B+M,EAAG5P,UAAU2a,KAAO,SAAehV,GACjC,OAAO5F,KAAK2E,QAAQyX,MAAMxW,EAAK5F,OAGjC6P,EAAG5P,UAAU+R,MAAQ,SAAgBpM,GACnCxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UAIb,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAUzF,EAC1BkN,GAAU,SAAJtB,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASD,IAAO,GAChB9S,KAAKkQ,MAAM7E,GAAU,SAALyH,EAQlB,OALc,IAAVC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAGAtB,MAGT6P,EAAG5P,UAAUgf,KAAO,SAAerZ,GACjC,OAAO5F,KAAK2E,QAAQqN,MAAMpM,IAI5BiK,EAAG5P,UAAUif,IAAM,WACjB,OAAOlf,KAAK6Q,IAAI7Q,OAIlB6P,EAAG5P,UAAUkf,KAAO,WAClB,OAAOnf,KAAK4a,KAAK5a,KAAK2E,UAIxBkL,EAAG5P,UAAUiS,IAAM,SAActM,GAC/B,IAAI4L,EAxxCN,SAAqB5L,GAGnB,IAFA,IAAI4L,EAAI,IAAI9P,MAAMkE,EAAI6O,aAEb6B,EAAM,EAAGA,EAAM9E,EAAElQ,OAAQgV,IAAO,CACvC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB9E,EAAE8E,IAAQ1Q,EAAIsK,MAAMuB,GAAQ,GAAK8E,KAAWA,EAG9C,OAAO/E,EA8wCC4N,CAAWxZ,GACnB,GAAiB,IAAb4L,EAAElQ,OAAc,OAAO,IAAIuO,EAAG,GAIlC,IADA,IAAIrN,EAAMxC,KACDqL,EAAI,EAAGA,EAAImG,EAAElQ,QACP,IAATkQ,EAAEnG,GADsBA,IAAK7I,EAAMA,EAAI0c,OAI7C,KAAM7T,EAAImG,EAAElQ,OACV,IAAK,IAAI4S,EAAI1R,EAAI0c,MAAO7T,EAAImG,EAAElQ,OAAQ+J,IAAK6I,EAAIA,EAAEgL,MAClC,IAAT1N,EAAEnG,KAEN7I,EAAMA,EAAIqO,IAAIqD,IAIlB,OAAO1R,GAITqN,EAAG5P,UAAUof,OAAS,SAAiBC,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAGIjU,EAHAsF,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GACjB4O,EAAa,WAAe,GAAK5O,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoC,EAAQ,EAEZ,IAAK1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAChC,IAAImU,EAAWxf,KAAKkQ,MAAM7E,GAAKkU,EAC3B/O,GAAsB,EAAhBxQ,KAAKkQ,MAAM7E,IAAUmU,GAAa7O,EAC5C3Q,KAAKkQ,MAAM7E,GAAKmF,EAAIuC,EACpBA,EAAQyM,IAAc,GAAK7O,EAGzBoC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAIT,GAAU,IAAN6b,EAAS,CACX,IAAK9R,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAChCrL,KAAKkQ,MAAM7E,EAAI8R,GAAKnd,KAAKkQ,MAAM7E,GAGjC,IAAKA,EAAI,EAAGA,EAAI8R,EAAG9R,IACjBrL,KAAKkQ,MAAM7E,GAAK,EAGlBrL,KAAKsB,QAAU6b,EAGjB,OAAOnd,KAAK0R,SAGd7B,EAAG5P,UAAUwf,MAAQ,SAAgBH,GAGnC,OADAlc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKqf,OAAOC,IAMrBzP,EAAG5P,UAAUmU,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJxc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/O,EAAI2O,EAAO,GACXnC,EAAIrM,KAAK/D,KAAKuS,EAAO3O,GAAK,GAAI3Q,KAAKsB,QACnCue,EAAO,SAAc,WAAclP,GAAMA,EACzCmP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAI9O,KAAKC,IAAI,EAAG6O,GAGZE,EAAa,CACf,IAAK,IAAIzU,EAAI,EAAGA,EAAI8R,EAAG9R,IACrByU,EAAY5P,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAEpCyU,EAAYxe,OAAS6b,EAGvB,GAAU,IAANA,QAEG,GAAInd,KAAKsB,OAAS6b,EAEvB,IADAnd,KAAKsB,QAAU6b,EACV9R,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC3BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,EAAI8R,QAGjCnd,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,EAGhB,IAAIyR,EAAQ,EACZ,IAAK1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,IAAgB,IAAV0H,GAAe1H,GAAKuU,GAAIvU,IAAK,CAChE,IAAI0G,EAAuB,EAAhB/R,KAAKkQ,MAAM7E,GACtBrL,KAAKkQ,MAAM7E,GAAM0H,GAAU,GAAKpC,EAAOoB,IAASpB,EAChDoC,EAAQhB,EAAO8N,EAajB,OATIC,GAAyB,IAAV/M,IACjB+M,EAAY5P,MAAM4P,EAAYxe,UAAYyR,GAGxB,IAAhB/S,KAAKsB,SACPtB,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,GAGTtB,KAAK0R,SAGd7B,EAAG5P,UAAU8f,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAvc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKoU,OAAOkL,EAAMI,EAAMC,IAIjC9P,EAAG5P,UAAU+f,KAAO,SAAeV,GACjC,OAAOtf,KAAK2E,QAAQ8a,MAAMH,IAG5BzP,EAAG5P,UAAUggB,MAAQ,SAAgBX,GACnC,OAAOtf,KAAK2E,QAAQ0a,OAAOC,IAI7BzP,EAAG5P,UAAUigB,KAAO,SAAeZ,GACjC,OAAOtf,KAAK2E,QAAQob,MAAMT,IAG5BzP,EAAG5P,UAAUkgB,MAAQ,SAAgBb,GACnC,OAAOtf,KAAK2E,QAAQyP,OAAOkL,IAI7BzP,EAAG5P,UAAUiV,MAAQ,SAAgBoB,GACnClT,EAAsB,iBAARkT,GAAoBA,GAAO,GACzC,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,QAAI3Q,KAAKsB,QAAU6b,KAGXnd,KAAKkQ,MAAMiN,GAELjJ,KAIhBrE,EAAG5P,UAAUmgB,OAAS,SAAiBd,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAAI3O,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GAIrB,GAFAvN,EAAyB,IAAlBpD,KAAKiQ,SAAgB,2CAExBjQ,KAAKsB,QAAU6b,EACjB,OAAOnd,KAQT,GALU,IAAN2Q,GACFwM,IAEFnd,KAAKsB,OAASwP,KAAK/D,IAAIoQ,EAAGnd,KAAKsB,QAErB,IAANqP,EAAS,CACX,IAAIkP,EAAO,SAAc,WAAclP,GAAMA,EAC7C3Q,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IAAMue,EAGjC,OAAO7f,KAAK0R,SAId7B,EAAG5P,UAAUogB,MAAQ,SAAgBf,GACnC,OAAOtf,KAAK2E,QAAQyb,OAAOd,IAI7BzP,EAAG5P,UAAU+U,MAAQ,SAAgBpP,GAGnC,OAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAU5F,KAAKsgB,OAAO1a,GAGV,IAAlB5F,KAAKiQ,SACa,IAAhBjQ,KAAKsB,SAAiC,EAAhBtB,KAAKkQ,MAAM,IAAUtK,GAC7C5F,KAAKkQ,MAAM,GAAKtK,GAAuB,EAAhB5F,KAAKkQ,MAAM,IAClClQ,KAAKiQ,SAAW,EACTjQ,OAGTA,KAAKiQ,SAAW,EAChBjQ,KAAKsgB,MAAM1a,GACX5F,KAAKiQ,SAAW,EACTjQ,MAIFA,KAAKiS,OAAOrM,IAGrBiK,EAAG5P,UAAUgS,OAAS,SAAiBrM,GACrC5F,KAAKkQ,MAAM,IAAMtK,EAGjB,IAAK,IAAIyF,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,IAAM,SAAWA,IAC7DrL,KAAKkQ,MAAM7E,IAAM,SACbA,IAAMrL,KAAKsB,OAAS,EACtBtB,KAAKkQ,MAAM7E,EAAI,GAAK,EAEpBrL,KAAKkQ,MAAM7E,EAAI,KAKnB,OAFArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,EAAI,GAEjCrL,MAIT6P,EAAG5P,UAAUqgB,MAAQ,SAAgB1a,GAGnC,GAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAG,OAAO5F,KAAKgV,OAAOpP,GAEhC,GAAsB,IAAlB5F,KAAKiQ,SAIP,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKgV,MAAMpP,GACX5F,KAAKiQ,SAAW,EACTjQ,KAKT,GAFAA,KAAKkQ,MAAM,IAAMtK,EAEG,IAAhB5F,KAAKsB,QAAgBtB,KAAKkQ,MAAM,GAAK,EACvClQ,KAAKkQ,MAAM,IAAMlQ,KAAKkQ,MAAM,GAC5BlQ,KAAKiQ,SAAW,OAGhB,IAAK,IAAI5E,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,GAAK,EAAGA,IACpDrL,KAAKkQ,MAAM7E,IAAM,SACjBrL,KAAKkQ,MAAM7E,EAAI,IAAM,EAIzB,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUsgB,KAAO,SAAe3a,GACjC,OAAO5F,KAAK2E,QAAQqQ,MAAMpP,IAG5BiK,EAAG5P,UAAUugB,KAAO,SAAe5a,GACjC,OAAO5F,KAAK2E,QAAQ2b,MAAM1a,IAG5BiK,EAAG5P,UAAUwgB,KAAO,WAGlB,OAFAzgB,KAAKiQ,SAAW,EAETjQ,MAGT6P,EAAG5P,UAAU6U,IAAM,WACjB,OAAO9U,KAAK2E,QAAQ8b,QAGtB5Q,EAAG5P,UAAUygB,aAAe,SAAuB9a,EAAKiL,EAAK8P,GAC3D,IACItV,EAIAmG,EALApG,EAAMxF,EAAItE,OAASqf,EAGvB3gB,KAAKoS,QAAQhH,GAGb,IAAI2H,EAAQ,EACZ,IAAK1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CAC/BmG,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,EAClC,IAAI9B,GAAwB,EAAfrL,EAAIsK,MAAM7E,IAAUwF,EAEjCkC,IADAvB,GAAa,SAARP,IACS,KAAQA,EAAQ,SAAa,GAC3CjR,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAE1B,KAAOnG,EAAIrL,KAAKsB,OAASqf,EAAOtV,IAE9B0H,GADAvB,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,IACrB,GACb/S,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAG1B,GAAc,IAAVuB,EAAa,OAAO/S,KAAK0R,QAK7B,IAFAtO,GAAkB,IAAX2P,GACPA,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAE3B0H,GADAvB,IAAsB,EAAhBxR,KAAKkQ,MAAM7E,IAAU0H,IACd,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJmG,EAIlB,OAFAxR,KAAKiQ,SAAW,EAETjQ,KAAK0R,SAGd7B,EAAG5P,UAAU2gB,SAAW,SAAmBhb,EAAKib,GAC9C,IAAIF,GAAQ3gB,KAAKsB,OAASsE,EAAItE,QAE1BsR,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAGJkb,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,GAGf,IADdqf,EAAQ,GADM3gB,KAAKsU,WAAWwM,MAG5BjO,EAAIA,EAAEoN,MAAMU,GACZ/N,EAAEyM,OAAOsB,GACTG,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,IAI3B,IACI4S,EADAnV,EAAI6T,EAAEtR,OAASuR,EAAEvR,OAGrB,GAAa,QAATuf,EAAgB,EAClB3M,EAAI,IAAIrE,EAAG,OACTvO,OAASvC,EAAI,EACfmV,EAAEhE,MAAQ,IAAIxO,MAAMwS,EAAE5S,QACtB,IAAK,IAAI+J,EAAI,EAAGA,EAAI6I,EAAE5S,OAAQ+J,IAC5B6I,EAAEhE,MAAM7E,GAAK,EAIjB,IAAI0V,EAAOnO,EAAEjO,QAAQ+b,aAAa7N,EAAG,EAAG9T,GAClB,IAAlBgiB,EAAK9Q,WACP2C,EAAImO,EACA7M,IACFA,EAAEhE,MAAMnR,GAAK,IAIjB,IAAK,IAAIuM,EAAIvM,EAAI,EAAGuM,GAAK,EAAGA,IAAK,CAC/B,IAAI0V,EAAmC,UAAL,EAAxBpO,EAAE1C,MAAM2C,EAAEvR,OAASgK,KACE,EAA5BsH,EAAE1C,MAAM2C,EAAEvR,OAASgK,EAAI,IAO1B,IAHA0V,EAAKlQ,KAAK/D,IAAKiU,EAAKF,EAAO,EAAG,UAE9BlO,EAAE8N,aAAa7N,EAAGmO,EAAI1V,GACA,IAAfsH,EAAE3C,UACP+Q,IACApO,EAAE3C,SAAW,EACb2C,EAAE8N,aAAa7N,EAAG,EAAGvH,GAChBsH,EAAEW,WACLX,EAAE3C,UAAY,GAGdiE,IACFA,EAAEhE,MAAM5E,GAAK0V,GAajB,OAVI9M,GACFA,EAAExC,QAEJkB,EAAElB,QAGW,QAATmP,GAA4B,IAAVF,GACpB/N,EAAEwB,OAAOuM,GAGJ,CACLM,IAAK/M,GAAK,KACVpC,IAAKc,IAQT/C,EAAG5P,UAAUihB,OAAS,SAAiBtb,EAAKib,EAAMM,GAGhD,OAFA/d,GAAQwC,EAAI2N,UAERvT,KAAKuT,SACA,CACL0N,IAAK,IAAIpR,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB7P,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAKib,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGH,QAATuL,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI0E,KAAK5Q,IAIN,CACLqb,IAAKA,EACLnP,IAAKA,IAIa,IAAlB9R,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKkhB,OAAOtb,EAAI0P,MAAOuL,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGT,CACL2L,IAAKA,EACLnP,IAAKtP,EAAIsP,MAI0B,IAAlC9R,KAAKiQ,SAAWrK,EAAIqK,WACvBzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAI0P,MAAOuL,GAEtB,QAATA,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI2E,KAAK7Q,IAIN,CACLqb,IAAKze,EAAIye,IACTnP,IAAKA,IAOLlM,EAAItE,OAAStB,KAAKsB,QAAUtB,KAAKkR,IAAItL,GAAO,EACvC,CACLqb,IAAK,IAAIpR,EAAG,GACZiC,IAAK9R,MAKU,IAAf4F,EAAItE,OACO,QAATuf,EACK,CACLI,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,MAII,QAAT+O,EACK,CACLI,IAAK,KACLnP,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7B,CACL+Q,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7BlQ,KAAK4gB,SAAShb,EAAKib,GAlF1B,IAAII,EAAKnP,EAAKtP,GAsFhBqN,EAAG5P,UAAUghB,IAAM,SAAcrb,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOqb,KAIxCpR,EAAG5P,UAAU6R,IAAM,SAAclM,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOkM,KAGxCjC,EAAG5P,UAAUohB,KAAO,SAAezb,GACjC,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAMkM,KAIvCjC,EAAG5P,UAAUqhB,SAAW,SAAmB1b,GACzC,IAAI2b,EAAKvhB,KAAKkhB,OAAOtb,GAGrB,GAAI2b,EAAGzP,IAAIyB,SAAU,OAAOgO,EAAGN,IAE/B,IAAInP,EAA0B,IAApByP,EAAGN,IAAIhR,SAAiBsR,EAAGzP,IAAI2E,KAAK7Q,GAAO2b,EAAGzP,IAEpD0P,EAAO5b,EAAIua,MAAM,GACjBsB,EAAK7b,EAAIuO,MAAM,GACfjD,EAAMY,EAAIZ,IAAIsQ,GAGlB,OAAItQ,EAAM,GAAY,IAAPuQ,GAAoB,IAARvQ,EAAkBqQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAG5P,UAAUuT,KAAO,SAAe5N,GACjCxC,EAAOwC,GAAO,UAId,IAHA,IAAI4J,GAAK,GAAK,IAAM5J,EAEhB8b,EAAM,EACDrW,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IACpCqW,GAAOlS,EAAIkS,GAAuB,EAAhB1hB,KAAKkQ,MAAM7E,KAAWzF,EAG1C,OAAO8b,GAIT7R,EAAG5P,UAAUwT,MAAQ,SAAgB7N,GACnCxC,EAAOwC,GAAO,UAGd,IADA,IAAImN,EAAQ,EACH1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAkB,SAAR0H,EAC9B/S,KAAKkQ,MAAM7E,GAAMmG,EAAI5L,EAAO,EAC5BmN,EAAQvB,EAAI5L,EAGd,OAAO5F,KAAK0R,SAGd7B,EAAG5P,UAAUmhB,KAAO,SAAexb,GACjC,OAAO5F,KAAK2E,QAAQ8O,MAAM7N,IAG5BiK,EAAG5P,UAAU0hB,KAAO,SAAenS,GACjCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAI2I,EAAIlc,KACJmc,EAAI3M,EAAE7K,QAGRuX,EADiB,IAAfA,EAAEjM,SACAiM,EAAEmF,KAAK7R,GAEP0M,EAAEvX,QAaR,IATA,IAAIid,EAAI,IAAI/R,EAAG,GACXgS,EAAI,IAAIhS,EAAG,GAGXiS,EAAI,IAAIjS,EAAG,GACXkS,EAAI,IAAIlS,EAAG,GAEXmS,EAAI,EAED9F,EAAE+F,UAAY9F,EAAE8F,UACrB/F,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP4N,EAMJ,IAHA,IAAIE,EAAK/F,EAAExX,QACPwd,EAAKjG,EAAEvX,SAEHuX,EAAE3I,UAAU,CAClB,IAAK,IAAIlI,EAAI,EAAG+W,EAAK,EAAyB,IAArBlG,EAAEhM,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADA6Q,EAAE9H,OAAO/I,GACFA,KAAM,IACPuW,EAAES,SAAWR,EAAEQ,WACjBT,EAAEpL,KAAK0L,GACPL,EAAEpL,KAAK0L,IAGTP,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIb,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBnG,EAAEjM,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADA6Q,EAAE/H,OAAO9I,GACFA,KAAM,IACPwW,EAAEO,SAAWN,EAAEM,WACjBP,EAAEtL,KAAK0L,GACPH,EAAEtL,KAAK0L,IAGTL,EAAE1N,OAAO,GACT2N,EAAE3N,OAAO,GAIT8H,EAAEhL,IAAIiL,IAAM,GACdD,EAAEzF,KAAK0F,GACPyF,EAAEnL,KAAKqL,GACPD,EAAEpL,KAAKsL,KAEP5F,EAAE1F,KAAKyF,GACP4F,EAAErL,KAAKmL,GACPG,EAAEtL,KAAKoL,IAIX,MAAO,CACLjP,EACAC,EAAGkP,EACHQ,IAAKpG,EAAEkD,OAAO2C,KAOlBnS,EAAG5P,UAAUuiB,OAAS,SAAiBhT,GACrCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAIX,EAAI5S,KACJ6S,EAAIrD,EAAE7K,QAGRiO,EADiB,IAAfA,EAAE3C,SACA2C,EAAEyO,KAAK7R,GAEPoD,EAAEjO,QAQR,IALA,IAuCInC,EAvCAigB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ9P,EAAElO,QAEPiO,EAAEgQ,KAAK,GAAK,GAAK/P,EAAE+P,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIvX,EAAI,EAAG+W,EAAK,EAAyB,IAArBxP,EAAE1C,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADAuH,EAAEwB,OAAO/I,GACFA,KAAM,GACPoX,EAAGJ,SACLI,EAAGjM,KAAKmM,GAGVF,EAAGrO,OAAO,GAId,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBzP,EAAE3C,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADAuH,EAAEuB,OAAO9I,GACFA,KAAM,GACPoX,EAAGL,SACLK,EAAGlM,KAAKmM,GAGVD,EAAGtO,OAAO,GAIVxB,EAAE1B,IAAI2B,IAAM,GACdD,EAAE6D,KAAK5D,GACP4P,EAAGhM,KAAKiM,KAER7P,EAAE4D,KAAK7D,GACP8P,EAAGjM,KAAKgM,IAeZ,OATEjgB,EADgB,IAAdoQ,EAAEgQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKhH,GAGJhN,GAGTqN,EAAG5P,UAAUsiB,IAAM,SAAc3c,GAC/B,GAAI5F,KAAKuT,SAAU,OAAO3N,EAAIkP,MAC9B,GAAIlP,EAAI2N,SAAU,OAAOvT,KAAK8U,MAE9B,IAAIlC,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAAIjB,QACZiO,EAAE3C,SAAW,EACb4C,EAAE5C,SAAW,EAGb,IAAK,IAAI0Q,EAAQ,EAAG/N,EAAEqP,UAAYpP,EAAEoP,SAAUtB,IAC5C/N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,OAAG,CACD,KAAOxB,EAAEqP,UACPrP,EAAEwB,OAAO,GAEX,KAAOvB,EAAEoP,UACPpP,EAAEuB,OAAO,GAGX,IAAIzD,EAAIiC,EAAE1B,IAAI2B,GACd,GAAIlC,EAAI,EAAG,CAET,IAAI4D,EAAI3B,EACRA,EAAIC,EACJA,EAAI0B,OACC,GAAU,IAAN5D,GAAyB,IAAdkC,EAAE+P,KAAK,GAC3B,MAGFhQ,EAAE6D,KAAK5D,GAGT,OAAOA,EAAEwM,OAAOsB,IAIlB9Q,EAAG5P,UAAU4iB,KAAO,SAAejd,GACjC,OAAO5F,KAAK2hB,KAAK/b,GAAKgN,EAAEyO,KAAKzb,IAG/BiK,EAAG5P,UAAUgiB,OAAS,WACpB,OAA+B,IAAP,EAAhBjiB,KAAKkQ,MAAM,KAGrBL,EAAG5P,UAAUoiB,MAAQ,WACnB,OAA+B,IAAP,EAAhBriB,KAAKkQ,MAAM,KAIrBL,EAAG5P,UAAUkU,MAAQ,SAAgBvO,GACnC,OAAO5F,KAAKkQ,MAAM,GAAKtK,GAIzBiK,EAAG5P,UAAU6iB,MAAQ,SAAgBxM,GACnClT,EAAsB,iBAARkT,GACd,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,GAAI3Q,KAAKsB,QAAU6b,EAGjB,OAFAnd,KAAKoS,QAAQ+K,EAAI,GACjBnd,KAAKkQ,MAAMiN,IAAMjJ,EACVlU,KAKT,IADA,IAAI+S,EAAQmB,EACH7I,EAAI8R,EAAa,IAAVpK,GAAe1H,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACnD,IAAImG,EAAoB,EAAhBxR,KAAKkQ,MAAM7E,GAEnB0H,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACLxR,KAAKkQ,MAAM7E,GAAKmG,EAMlB,OAJc,IAAVuB,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAEAtB,MAGT6P,EAAG5P,UAAUsT,OAAS,WACpB,OAAuB,IAAhBvT,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,IAGzCL,EAAG5P,UAAU2iB,KAAO,SAAehd,GACjC,IAOIpD,EAPAyN,EAAWrK,EAAM,EAErB,GAAsB,IAAlB5F,KAAKiQ,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBjQ,KAAKiQ,UAAkBA,EAAU,OAAO,EAK5C,GAHAjQ,KAAK0R,QAGD1R,KAAKsB,OAAS,EAChBkB,EAAM,MACD,CACDyN,IACFrK,GAAOA,GAGTxC,EAAOwC,GAAO,SAAW,qBAEzB,IAAI4L,EAAoB,EAAhBxR,KAAKkQ,MAAM,GACnB1N,EAAMgP,IAAM5L,EAAM,EAAI4L,EAAI5L,GAAO,EAAI,EAEvC,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAOTqN,EAAG5P,UAAUiR,IAAM,SAActL,GAC/B,GAAsB,IAAlB5F,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAQ,EACvD,GAAsB,IAAlBjQ,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAO,EAEtD,IAAIzN,EAAMxC,KAAK+iB,KAAKnd,GACpB,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAITqN,EAAG5P,UAAU8iB,KAAO,SAAend,GAEjC,GAAI5F,KAAKsB,OAASsE,EAAItE,OAAQ,OAAO,EACrC,GAAItB,KAAKsB,OAASsE,EAAItE,OAAQ,OAAQ,EAGtC,IADA,IAAIkB,EAAM,EACD6I,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAIuH,EAAoB,EAAhB5S,KAAKkQ,MAAM7E,GACfwH,EAAmB,EAAfjN,EAAIsK,MAAM7E,GAElB,GAAIuH,IAAMC,EAAV,CACID,EAAIC,EACNrQ,GAAO,EACEoQ,EAAIC,IACbrQ,EAAM,GAER,OAEF,OAAOA,GAGTqN,EAAG5P,UAAU+iB,IAAM,SAAcpd,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUgjB,GAAK,SAAard,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUijB,KAAO,SAAetd,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUkjB,IAAM,SAAcvd,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUmjB,IAAM,SAAcxd,GAC/B,OAA2B,IAApB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUojB,GAAK,SAAazd,GAC7B,OAA0B,IAAnB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUqjB,KAAO,SAAe1d,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUsjB,IAAM,SAAc3d,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUujB,IAAM,SAAc5d,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUwjB,GAAK,SAAa7d,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAOlBiK,EAAGM,IAAM,SAAcvK,GACrB,OAAO,IAAI8d,EAAI9d,IAGjBiK,EAAG5P,UAAU0jB,MAAQ,SAAgBC,GAGnC,OAFAxgB,GAAQpD,KAAKmQ,IAAK,yCAClB/M,EAAyB,IAAlBpD,KAAKiQ,SAAgB,iCACrB2T,EAAIC,UAAU7jB,MAAM8jB,UAAUF,IAGvC/T,EAAG5P,UAAU8jB,QAAU,WAErB,OADA3gB,EAAOpD,KAAKmQ,IAAK,wDACVnQ,KAAKmQ,IAAI6T,YAAYhkB,OAG9B6P,EAAG5P,UAAU6jB,UAAY,SAAoBF,GAE3C,OADA5jB,KAAKmQ,IAAMyT,EACJ5jB,MAGT6P,EAAG5P,UAAUgkB,SAAW,SAAmBL,GAEzC,OADAxgB,GAAQpD,KAAKmQ,IAAK,yCACXnQ,KAAK8jB,UAAUF,IAGxB/T,EAAG5P,UAAUikB,OAAS,SAAiBte,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIuG,IAAI1W,KAAM4F,IAG5BiK,EAAG5P,UAAUkkB,QAAU,SAAkBve,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIqG,KAAKxW,KAAM4F,IAG7BiK,EAAG5P,UAAUmkB,OAAS,SAAiBxe,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIwG,IAAI3W,KAAM4F,IAG5BiK,EAAG5P,UAAUokB,QAAU,SAAkBze,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIsG,KAAKzW,KAAM4F,IAG7BiK,EAAG5P,UAAUqkB,OAAS,SAAiB1e,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIoU,IAAIvkB,KAAM4F,IAG5BiK,EAAG5P,UAAUukB,OAAS,SAAiB5e,GAGrC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIU,IAAI7Q,KAAM4F,IAG5BiK,EAAG5P,UAAUykB,QAAU,SAAkB9e,GAGvC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIyK,KAAK5a,KAAM4F,IAG7BiK,EAAG5P,UAAU0kB,OAAS,WAGpB,OAFAvhB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+O,IAAIlf,OAGtB6P,EAAG5P,UAAU4kB,QAAU,WAGrB,OAFAzhB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAIgP,KAAKnf,OAIvB6P,EAAG5P,UAAU6kB,QAAU,WAGrB,OAFA1hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI4U,KAAK/kB,OAGvB6P,EAAG5P,UAAU+kB,QAAU,WAGrB,OAFA5hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI0S,KAAK7iB,OAIvB6P,EAAG5P,UAAUglB,OAAS,WAGpB,OAFA7hB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAImF,IAAItV,OAGtB6P,EAAG5P,UAAUilB,OAAS,SAAiBtf,GAGrC,OAFAxC,EAAOpD,KAAKmQ,MAAQvK,EAAIuK,IAAK,qBAC7BnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+B,IAAIlS,KAAM4F,IAI5B,IAAIuf,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ1lB,EAAM0P,GAErBxP,KAAKF,KAAOA,EACZE,KAAKwP,EAAI,IAAIK,EAAGL,EAAG,IACnBxP,KAAKge,EAAIhe,KAAKwP,EAAEiF,YAChBzU,KAAKgT,EAAI,IAAInD,EAAG,GAAGwP,OAAOrf,KAAKge,GAAGvH,KAAKzW,KAAKwP,GAE5CxP,KAAK0M,IAAM1M,KAAKylB,OAiDlB,SAASC,IACPF,EAAOjlB,KACLP,KACA,OACA,2EA+DJ,SAAS2lB,IACPH,EAAOjlB,KACLP,KACA,OACA,kEAIJ,SAAS4lB,IACPJ,EAAOjlB,KACLP,KACA,OACA,yDAIJ,SAAS6lB,IAEPL,EAAOjlB,KACLP,KACA,QACA,uEA8CJ,SAAS0jB,EAAK3kB,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAI+mB,EAAQjW,EAAGkW,OAAOhnB,GACtBiB,KAAKjB,EAAI+mB,EAAMtW,EACfxP,KAAK8lB,MAAQA,OAEb1iB,EAAOrE,EAAEikB,IAAI,GAAI,kCACjBhjB,KAAKjB,EAAIA,EACTiB,KAAK8lB,MAAQ,KAkOjB,SAASE,EAAMjnB,GACb2kB,EAAInjB,KAAKP,KAAMjB,GAEfiB,KAAK2gB,MAAQ3gB,KAAKjB,EAAE0V,YAChBzU,KAAK2gB,MAAQ,IAAO,IACtB3gB,KAAK2gB,OAAS,GAAM3gB,KAAK2gB,MAAQ,IAGnC3gB,KAAK2Q,EAAI,IAAId,EAAG,GAAGwP,OAAOrf,KAAK2gB,OAC/B3gB,KAAKyhB,GAAKzhB,KAAKimB,KAAKjmB,KAAK2Q,EAAEuO,OAC3Blf,KAAKkmB,KAAOlmB,KAAK2Q,EAAE6R,OAAOxiB,KAAKjB,GAE/BiB,KAAKmmB,KAAOnmB,KAAKkmB,KAAKrV,IAAI7Q,KAAK2Q,GAAG2P,MAAM,GAAGW,IAAIjhB,KAAKjB,GACpDiB,KAAKmmB,KAAOnmB,KAAKmmB,KAAK9E,KAAKrhB,KAAK2Q,GAChC3Q,KAAKmmB,KAAOnmB,KAAK2Q,EAAEgG,IAAI3W,KAAKmmB,MA5a9BX,EAAOvlB,UAAUwlB,KAAO,WACtB,IAAI/Y,EAAM,IAAImD,EAAG,MAEjB,OADAnD,EAAIwD,MAAQ,IAAIxO,MAAMoP,KAAKS,KAAKvR,KAAKge,EAAI,KAClCtR,GAGT8Y,EAAOvlB,UAAUmmB,QAAU,SAAkBxgB,GAG3C,IACIygB,EADA1V,EAAI/K,EAGR,GACE5F,KAAKsN,MAAMqD,EAAG3Q,KAAK0M,KAGnB2Z,GADA1V,GADAA,EAAI3Q,KAAKsmB,MAAM3V,IACT6F,KAAKxW,KAAK0M,MACP+H,kBACF4R,EAAOrmB,KAAKge,GAErB,IAAI9M,EAAMmV,EAAOrmB,KAAKge,GAAK,EAAIrN,EAAEoS,KAAK/iB,KAAKwP,GAgB3C,OAfY,IAAR0B,GACFP,EAAET,MAAM,GAAK,EACbS,EAAErP,OAAS,GACF4P,EAAM,EACfP,EAAE8F,KAAKzW,KAAKwP,QAEIpH,IAAZuI,EAAEe,MAEJf,EAAEe,QAGFf,EAAE4V,SAIC5V,GAGT6U,EAAOvlB,UAAUqN,MAAQ,SAAgBvH,EAAOjD,GAC9CiD,EAAMqO,OAAOpU,KAAKge,EAAG,EAAGlb,IAG1B0iB,EAAOvlB,UAAUqmB,MAAQ,SAAgB1gB,GACvC,OAAOA,EAAIgV,KAAK5a,KAAKgT,IASvBpT,EAAS8lB,EAAMF,GAEfE,EAAKzlB,UAAUqN,MAAQ,SAAgBvH,EAAOygB,GAK5C,IAHA,IAAI3G,EAAO,QAEP4G,EAAS3V,KAAK/D,IAAIhH,EAAMzE,OAAQ,GAC3B+J,EAAI,EAAGA,EAAIob,EAAQpb,IAC1Bmb,EAAOtW,MAAM7E,GAAKtF,EAAMmK,MAAM7E,GAIhC,GAFAmb,EAAOllB,OAASmlB,EAEZ1gB,EAAMzE,QAAU,EAGlB,OAFAyE,EAAMmK,MAAM,GAAK,OACjBnK,EAAMzE,OAAS,GAKjB,IAAIuI,EAAO9D,EAAMmK,MAAM,GAGvB,IAFAsW,EAAOtW,MAAMsW,EAAOllB,UAAYuI,EAAOgW,EAElCxU,EAAI,GAAIA,EAAItF,EAAMzE,OAAQ+J,IAAK,CAClC,IAAIqb,EAAwB,EAAjB3gB,EAAMmK,MAAM7E,GACvBtF,EAAMmK,MAAM7E,EAAI,KAAQqb,EAAO7G,IAAS,EAAMhW,IAAS,GACvDA,EAAO6c,EAET7c,KAAU,GACV9D,EAAMmK,MAAM7E,EAAI,IAAMxB,EACT,IAATA,GAAc9D,EAAMzE,OAAS,GAC/ByE,EAAMzE,QAAU,GAEhByE,EAAMzE,QAAU,GAIpBokB,EAAKzlB,UAAUqmB,MAAQ,SAAgB1gB,GAErCA,EAAIsK,MAAMtK,EAAItE,QAAU,EACxBsE,EAAIsK,MAAMtK,EAAItE,OAAS,GAAK,EAC5BsE,EAAItE,QAAU,EAId,IADA,IAAIwR,EAAK,EACAzH,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAImG,EAAmB,EAAf5L,EAAIsK,MAAM7E,GAClByH,GAAU,IAAJtB,EACN5L,EAAIsK,MAAM7E,GAAU,SAALyH,EACfA,EAAS,GAAJtB,GAAasB,EAAK,SAAa,GAUtC,OANkC,IAA9BlN,EAAIsK,MAAMtK,EAAItE,OAAS,KACzBsE,EAAItE,SAC8B,IAA9BsE,EAAIsK,MAAMtK,EAAItE,OAAS,IACzBsE,EAAItE,UAGDsE,GASThG,EAAS+lB,EAAMH,GAQf5lB,EAASgmB,EAAMJ,GASf5lB,EAASimB,EAAQL,GAEjBK,EAAO5lB,UAAUqmB,MAAQ,SAAgB1gB,GAGvC,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAIqJ,EAA0B,IAAL,EAAf9O,EAAIsK,MAAM7E,IAAiB0H,EACjCD,EAAU,SAAL4B,EACTA,KAAQ,GAER9O,EAAIsK,MAAM7E,GAAKyH,EACfC,EAAQ2B,EAKV,OAHc,IAAV3B,IACFnN,EAAIsK,MAAMtK,EAAItE,UAAYyR,GAErBnN,GAITiK,EAAGkW,OAAS,SAAgBjmB,GAE1B,GAAIqlB,EAAOrlB,GAAO,OAAOqlB,EAAOrlB,GAEhC,IAAIgmB,EACJ,GAAa,SAAThmB,EACFgmB,EAAQ,IAAIJ,OACP,GAAa,SAAT5lB,EACTgmB,EAAQ,IAAIH,OACP,GAAa,SAAT7lB,EACTgmB,EAAQ,IAAIF,MACP,IAAa,WAAT9lB,EAGT,MAAM,IAAIb,MAAM,iBAAmBa,GAFnCgmB,EAAQ,IAAID,EAMd,OAFAV,EAAOrlB,GAAQgmB,EAERA,GAkBTpC,EAAIzjB,UAAU2kB,SAAW,SAAmBhS,GAC1CxP,EAAsB,IAAfwP,EAAE3C,SAAgB,iCACzB7M,EAAOwP,EAAEzC,IAAK,oCAGhBuT,EAAIzjB,UAAUwkB,SAAW,SAAmB7R,EAAGC,GAC7CzP,EAAqC,IAA7BwP,EAAE3C,SAAW4C,EAAE5C,UAAiB,iCACxC7M,EAAOwP,EAAEzC,KAAOyC,EAAEzC,MAAQ0C,EAAE1C,IAC1B,oCAGJuT,EAAIzjB,UAAUgmB,KAAO,SAAerT,GAClC,OAAI5S,KAAK8lB,MAAc9lB,KAAK8lB,MAAMM,QAAQxT,GAAGkR,UAAU9jB,MAChD4S,EAAEyO,KAAKrhB,KAAKjB,GAAG+kB,UAAU9jB,OAGlC0jB,EAAIzjB,UAAUqV,IAAM,SAAc1C,GAChC,OAAIA,EAAEW,SACGX,EAAEjO,QAGJ3E,KAAKjB,EAAE4X,IAAI/D,GAAGkR,UAAU9jB,OAGjC0jB,EAAIzjB,UAAUyW,IAAM,SAAc9D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE8D,IAAI7D,GAIhB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUuW,KAAO,SAAe5D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE4D,KAAK3D,GAIjB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAU0W,IAAM,SAAc/D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE+D,IAAI9D,GAIhB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUwW,KAAO,SAAe7D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE6D,KAAK5D,GAIjB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAUskB,IAAM,SAAc3R,EAAGhN,GAEnC,OADA5F,KAAK4kB,SAAShS,GACP5S,KAAKimB,KAAKrT,EAAEqN,MAAMra,KAG3B8d,EAAIzjB,UAAU2a,KAAO,SAAehI,EAAGC,GAErC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAEgI,KAAK/H,KAG1B6Q,EAAIzjB,UAAU4Q,IAAM,SAAc+B,EAAGC,GAEnC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAE/B,IAAIgC,KAGzB6Q,EAAIzjB,UAAUkf,KAAO,SAAevM,GAClC,OAAO5S,KAAK4a,KAAKhI,EAAGA,EAAEjO,UAGxB+e,EAAIzjB,UAAUif,IAAM,SAActM,GAChC,OAAO5S,KAAK6Q,IAAI+B,EAAGA,IAGrB8Q,EAAIzjB,UAAU8kB,KAAO,SAAenS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEjO,QAEzB,IAAIgiB,EAAO3mB,KAAKjB,EAAEoV,MAAM,GAIxB,GAHA/Q,EAAOujB,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIzU,EAAMlS,KAAKjB,EAAE2X,IAAI,IAAI7G,EAAG,IAAIuE,OAAO,GACvC,OAAOpU,KAAKkS,IAAIU,EAAGV,GAQrB,IAFA,IAAIgC,EAAIlU,KAAKjB,EAAEyhB,KAAK,GAChBrD,EAAI,GACAjJ,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXhR,GAAQ8Q,EAAEX,UAEV,IAAIqT,EAAM,IAAI/W,EAAG,GAAG8T,MAAM3jB,MACtB6mB,EAAOD,EAAI3B,SAIX6B,EAAO9mB,KAAKjB,EAAEyhB,KAAK,GAAGpM,OAAO,GAC7B2S,EAAI/mB,KAAKjB,EAAE0V,YAGf,IAFAsS,EAAI,IAAIlX,EAAG,EAAIkX,EAAIA,GAAGpD,MAAM3jB,MAEW,IAAhCA,KAAKkS,IAAI6U,EAAGD,GAAM5V,IAAI2V,IAC3BE,EAAE5C,QAAQ0C,GAOZ,IAJA,IAAIrW,EAAIxQ,KAAKkS,IAAI6U,EAAG7S,GAChBvD,EAAI3Q,KAAKkS,IAAIU,EAAGsB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAIvU,KAAKkS,IAAIU,EAAGsB,GAChBnV,EAAIoe,EACc,IAAf5I,EAAErD,IAAI0V,IAAY,CAEvB,IADA,IAAIla,EAAM6H,EACDlJ,EAAI,EAAoB,IAAjBqB,EAAIwE,IAAI0V,GAAYvb,IAClCqB,EAAMA,EAAIiY,SAEZvhB,EAAOiI,EAAItM,GACX,IAAI8T,EAAI7S,KAAKkS,IAAI1B,EAAG,IAAIX,EAAG,GAAGwP,OAAOtgB,EAAIsM,EAAI,IAE7CsF,EAAIA,EAAE6T,OAAO3R,GACbrC,EAAIqC,EAAE8R,SACNpQ,EAAIA,EAAEiQ,OAAOhU,GACbzR,EAAIsM,EAGN,OAAOsF,GAGT+S,EAAIzjB,UAAU4iB,KAAO,SAAejQ,GAClC,IAAIoU,EAAMpU,EAAE4P,OAAOxiB,KAAKjB,GACxB,OAAqB,IAAjBioB,EAAI/W,UACN+W,EAAI/W,SAAW,EACRjQ,KAAKimB,KAAKe,GAAK/B,UAEfjlB,KAAKimB,KAAKe,IAIrBtD,EAAIzjB,UAAUiS,IAAM,SAAcU,EAAGhN,GACnC,GAAIA,EAAI2N,SAAU,OAAO,IAAI1D,EAAG,GAAG8T,MAAM3jB,MACzC,GAAoB,IAAhB4F,EAAIgd,KAAK,GAAU,OAAOhQ,EAAEjO,QAEhC,IACIsiB,EAAM,IAAIvlB,MAAM,IACpBulB,EAAI,GAAK,IAAIpX,EAAG,GAAG8T,MAAM3jB,MACzBinB,EAAI,GAAKrU,EACT,IAAK,IAAIvH,EAAI,EAAGA,EAAI4b,EAAI3lB,OAAQ+J,IAC9B4b,EAAI5b,GAAKrL,KAAK6Q,IAAIoW,EAAI5b,EAAI,GAAIuH,GAGhC,IAAIpQ,EAAMykB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtgB,EAAQjB,EAAI6O,YAAc,GAK9B,IAJc,IAAV5N,IACFA,EAAQ,IAGLwE,EAAIzF,EAAItE,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI0G,EAAOnM,EAAIsK,MAAM7E,GACZC,EAAIzE,EAAQ,EAAGyE,GAAK,EAAGA,IAAK,CACnC,IAAIgL,EAAOvE,GAAQzG,EAAK,EACpB9I,IAAQykB,EAAI,KACdzkB,EAAMxC,KAAKkf,IAAI1c,IAGL,IAAR8T,GAAyB,IAAZ4Q,GAKjBA,IAAY,EACZA,GAAW5Q,GA9BE,KA+Bb6Q,GACwC,IAAN9b,GAAiB,IAANC,KAE7C9I,EAAMxC,KAAK6Q,IAAIrO,EAAKykB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtgB,EAAQ,GAGV,OAAOrE,GAGTkhB,EAAIzjB,UAAU4jB,UAAY,SAAoBje,GAC5C,IAAI+K,EAAI/K,EAAIyb,KAAKrhB,KAAKjB,GAEtB,OAAO4R,IAAM/K,EAAM+K,EAAEhM,QAAUgM,GAGjC+S,EAAIzjB,UAAU+jB,YAAc,SAAsBpe,GAChD,IAAIpD,EAAMoD,EAAIjB,QAEd,OADAnC,EAAI2N,IAAM,KACH3N,GAOTqN,EAAGuX,KAAO,SAAexhB,GACvB,OAAO,IAAIogB,EAAKpgB,IAmBlBhG,EAASomB,EAAMtC,GAEfsC,EAAK/lB,UAAU4jB,UAAY,SAAoBje,GAC7C,OAAO5F,KAAKimB,KAAKrgB,EAAIqa,MAAMjgB,KAAK2gB,SAGlCqF,EAAK/lB,UAAU+jB,YAAc,SAAsBpe,GACjD,IAAI+K,EAAI3Q,KAAKimB,KAAKrgB,EAAIiL,IAAI7Q,KAAKkmB,OAE/B,OADAvV,EAAER,IAAM,KACDQ,GAGTqV,EAAK/lB,UAAU2a,KAAO,SAAehI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE1C,MAAM,GAAK,EACb0C,EAAEtR,OAAS,EACJsR,EAGT,IAAI2B,EAAI3B,EAAEgI,KAAK/H,GACXrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAQV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4Q,IAAM,SAAc+B,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI1D,EAAG,GAAGiU,UAAU9jB,MAEzD,IAAIuU,EAAI3B,EAAE/B,IAAIgC,GACVrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAOV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4iB,KAAO,SAAejQ,GAGnC,OADU5S,KAAKimB,KAAKrT,EAAE4P,OAAOxiB,KAAKjB,GAAG8R,IAAI7Q,KAAKyhB,KACnCqC,UAAU9jB,OAn3GzB,YAq3G4CA,2DC91G5C,SAASsnB,EAAQpjB,GAAwT,OAAtOojB,EAArD,mBAAXC,QAAoD,iBAApBA,OAAOC,SAAmC,SAAiBtjB,GAAO,cAAcA,GAA2B,SAAiBA,GAAO,OAAOA,GAAyB,mBAAXqjB,QAAyBrjB,EAAIjC,cAAgBslB,QAAUrjB,IAAQqjB,OAAOtnB,UAAY,gBAAkBiE,GAAiBojB,EAAQpjB,GAIxV,IAoBIujB,EACAC,EApBAC,EADW,EAAQ,MACOC,MAC1BC,EAAyBF,EAAeE,uBACxCC,EAAuBH,EAAeG,qBACtCC,EAAwBJ,EAAeI,sBACvCC,EAA2BL,EAAeK,yBAC1CC,EAAmBN,EAAeM,iBAElCC,EAAiB,EAAQ,MAGzB5V,EADY,EAAQ,MACAA,QAEpB6V,EAAiB,cACjBC,EAAYD,EAAeC,UAC3BC,EAAWF,EAAeE,SAE1BC,EAAe9iB,OAAO+iB,OAAS/iB,OAAO+iB,OAAS,eAC/CC,EAAWhjB,OAAOijB,GAAKjjB,OAAOijB,GAAK,EAAQ,KAQ/C,SAASC,IACP,IAAIC,EAAa,EAAQ,MAEzBlB,EAAckB,EAAWlB,YACzBC,EAAoBiB,EAAWjB,kBAXhB,IAAIlpB,IAiBrB,IAOIoqB,GAAS,EAITxlB,EAAS3E,EAAOC,QAAUmqB,EAC1BC,EAAwB,GAM5B,SAASC,EAAU7kB,GACjB,GAAIA,EAAIgG,mBAAmBjL,MAAO,MAAMiF,EAAIgG,QAC5C,MAAM,IAAIge,EAAehkB,GAgD3B,SAAS8kB,EAAQC,EAAIC,EAAQznB,EAAOyI,GAClC,IAAKzI,EAAO,CACV,IAAI0nB,GAAmB,EAEvB,GAAe,IAAXD,EACFC,GAAmB,EACnBjf,EAAU,iDACL,GAAIA,aAAmBjL,MAC5B,MAAMiL,EAGR,IAAIH,EAAM,IAAIme,EAAe,CAC3BkB,OAAQ3nB,EACR4nB,UAAU,EACVnf,QAASA,EACTof,SAAU,KACVC,aAAcN,IAGhB,MADAlf,EAAIof,iBAAmBA,EACjBpf,GAMV,SAAS8e,IACP,IAAK,IAAIW,EAAOvkB,UAAU3D,OAAQuC,EAAO,IAAInC,MAAM8nB,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E5lB,EAAK4lB,GAAQxkB,UAAUwkB,GAGzBT,EAAQhkB,WAAM,EAAQ,CAAC6jB,EAAIhlB,EAAKvC,QAAQiC,OAAOM,IAlCjDT,EAAOX,KAzCP,SAASA,EAAK2mB,EAAQC,EAAUnf,EAASof,EAAUC,GACjD,IACIG,EADAC,EAAU1kB,UAAU3D,OAGxB,GAAgB,IAAZqoB,EACFD,EAAkB,cACb,GAAgB,IAAZC,EACTzf,EAAUkf,EACVA,OAAShhB,MACJ,CACL,IAAe,IAAXwgB,EAAkB,CACpBA,GAAS,EACT,IAAIgB,EAAOC,EAAQC,YAAcD,EAAQC,YAAcC,EAAQH,KAAKI,KAAKD,GACzEH,EAAK,2HAAiI,qBAAsB,WAG9I,IAAZD,IAAeL,EAAW,MAGhC,GAAIpf,aAAmBjL,MAAO,MAAMiL,EACpC,IAAI+f,EAAU,CACZb,OAAQA,EACRC,SAAUA,EACVC,cAAuBlhB,IAAbkhB,EAAyB,OAASA,EAC5CC,aAAcA,GAAgB9mB,QAGhB2F,IAAZ8B,IACF+f,EAAQ/f,QAAUA,GAGpB,IAAIH,EAAM,IAAIme,EAAe+B,GAO7B,MALIP,IACF3f,EAAIG,QAAUwf,EACd3f,EAAIof,kBAAmB,GAGnBpf,GAKR3G,EAAO8kB,eAAiBA,EAmCxB9kB,EAAOylB,GAAKA,EAIZzlB,EAAOiC,MAAQ,SAASA,EAAM+jB,EAAQC,EAAUnf,GAC9C,GAAIjF,UAAU3D,OAAS,EACrB,MAAM,IAAI2mB,EAAiB,SAAU,YAInCmB,GAAUC,GACZN,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAU,KACVC,aAAclkB,KAOpBjC,EAAO8mB,SAAW,SAASA,EAASd,EAAQC,EAAUnf,GACpD,GAAIjF,UAAU3D,OAAS,EACrB,MAAM,IAAI2mB,EAAiB,SAAU,YAInCmB,GAAUC,GACZN,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAU,KACVC,aAAcW,KAMpB9mB,EAAO+mB,UAAY,SAASA,EAAUf,EAAQC,EAAUnf,GACtD,GAAIjF,UAAU3D,OAAS,EACrB,MAAM,IAAI2mB,EAAiB,SAAU,iBAGnB7f,IAAhBqf,GAA2BiB,IAE1BjB,EAAY2B,EAAQC,IACvBN,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAU,YACVC,aAAcY,KAMpB/mB,EAAOgnB,aAAe,SAASA,EAAahB,EAAQC,EAAUnf,GAC5D,GAAIjF,UAAU3D,OAAS,EACrB,MAAM,IAAI2mB,EAAiB,SAAU,iBAGnB7f,IAAhBqf,GAA2BiB,IAE3BjB,EAAY2B,EAAQC,IACtBN,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAU,eACVC,aAAca,KAOpBhnB,EAAOinB,gBAAkB,SAASA,EAAgBjB,EAAQC,EAAUnf,GAClE,GAAIjF,UAAU3D,OAAS,EACrB,MAAM,IAAI2mB,EAAiB,SAAU,iBAGnB7f,IAAhBqf,GAA2BiB,IAE1BhB,EAAkB0B,EAAQC,IAC7BN,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAU,kBACVC,aAAcc,KAKpBjnB,EAAOknB,mBAEP,SAASA,EAAmBlB,EAAQC,EAAUnf,GAC5C,GAAIjF,UAAU3D,OAAS,EACrB,MAAM,IAAI2mB,EAAiB,SAAU,iBAGnB7f,IAAhBqf,GAA2BiB,IAE3BhB,EAAkB0B,EAAQC,IAC5BN,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAU,qBACVC,aAAce,KAKpBlnB,EAAOmnB,YAAc,SAASA,EAAYnB,EAAQC,EAAUnf,GAC1D,GAAIjF,UAAU3D,OAAS,EACrB,MAAM,IAAI2mB,EAAiB,SAAU,YAGlCO,EAASY,EAAQC,IACpBN,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAU,cACVC,aAAcgB,KAKpBnnB,EAAOonB,eAAiB,SAASA,EAAepB,EAAQC,EAAUnf,GAChE,GAAIjF,UAAU3D,OAAS,EACrB,MAAM,IAAI2mB,EAAiB,SAAU,YAGnCO,EAASY,EAAQC,IACnBN,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAU,iBACVC,aAAciB,KAKpB,IAAIC,EAAa,SAASA,EAAWvmB,EAAKuB,EAAM2jB,GAC9C,IAAIsB,EAAQ1qB,MAlSd,SAAyB2qB,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAIC,UAAU,qCAoS9GC,CAAgB9qB,KAAMyqB,GAEtBhlB,EAAKzC,SAAQ,SAAUqB,GACjBA,KAAOH,SACMkE,IAAXghB,GAA+C,iBAAhBA,EAAO/kB,IAAqBgkB,EAASnkB,EAAIG,KAASH,EAAIG,GAAKgD,KAAK+hB,EAAO/kB,IACxGqmB,EAAMrmB,GAAO+kB,EAAO/kB,GAEpBqmB,EAAMrmB,GAAOH,EAAIG,QAMzB,SAAS0mB,EAAoB3B,EAAQC,EAAUhlB,EAAK6F,EAASzE,EAAMwjB,GACjE,KAAM5kB,KAAO+kB,KAAY1B,EAAkB0B,EAAO/kB,GAAMglB,EAAShlB,IAAO,CACtE,IAAK6F,EAAS,CAEZ,IAAI0I,EAAI,IAAI6X,EAAWrB,EAAQ3jB,GAC3BoN,EAAI,IAAI4X,EAAWpB,EAAU5jB,EAAM2jB,GACnCrf,EAAM,IAAIme,EAAe,CAC3BkB,OAAQxW,EACRyW,SAAUxW,EACVyW,SAAU,kBACVC,aAAcN,IAKhB,MAHAlf,EAAIqf,OAASA,EACbrf,EAAIsf,SAAWA,EACftf,EAAIuf,SAAWL,EAAGnpB,KACZiK,EAGRgf,EAAU,CACRK,OAAQA,EACRC,SAAUA,EACVnf,QAASA,EACTof,SAAUL,EAAGnpB,KACbypB,aAAcN,KAKpB,SAAS+B,EAAkB5B,EAAQC,EAAU5f,EAAKwf,GAChD,GAAwB,mBAAbI,EAAyB,CAClC,GAAIhB,EAASgB,GAAW,OAAOA,EAAShiB,KAAK+hB,GAE7C,GAAyB,IAArBnkB,UAAU3D,OACZ,MAAM,IAAIwmB,EAAqB,WAAY,CAAC,WAAY,UAAWuB,GAIrE,GAAwB,WAApB/B,EAAQ8B,IAAmC,OAAXA,EAAiB,CACnD,IAAIrf,EAAM,IAAIme,EAAe,CAC3BkB,OAAQA,EACRC,SAAUA,EACVnf,QAAST,EACT6f,SAAU,kBACVC,aAAcN,IAGhB,MADAlf,EAAIuf,SAAWL,EAAGnpB,KACZiK,EAGR,IAAItE,EAAOD,OAAOC,KAAK4jB,GAGvB,GAAIA,aAAoBpqB,MACtBwG,EAAKV,KAAK,OAAQ,gBACb,GAAoB,IAAhBU,EAAKnE,OACd,MAAM,IAAIymB,EAAsB,QAASsB,EAAU,8BAWrD,YARoBjhB,IAAhBqf,GAA2BiB,IAC/BjjB,EAAKzC,SAAQ,SAAUqB,GACM,iBAAhB+kB,EAAO/kB,IAAqBgkB,EAASgB,EAAShlB,KAASglB,EAAShlB,GAAKgD,KAAK+hB,EAAO/kB,KAI5F0mB,EAAoB3B,EAAQC,EAAUhlB,EAAKoF,EAAKhE,EAAMwjB,OAEjD,EAIT,YAA2B7gB,IAAvBihB,EAASppB,WAA2BmpB,aAAkBC,IAItDpqB,MAAMgsB,cAAc5B,KAIa,IAA9BA,EAAS9oB,KAAK,GAAI6oB,GAG3B,SAAS8B,EAAUjC,GACjB,GAAkB,mBAAPA,EACT,MAAM,IAAInB,EAAqB,KAAM,WAAYmB,GAGnD,IACEA,IACA,MAAOviB,GACP,OAAOA,EAGT,OAAOoiB,EAGT,SAASqC,EAAejnB,GAOtB,OAAOkkB,EAAUlkB,IAAgB,OAARA,GAAiC,WAAjBojB,EAAQpjB,IAAyC,mBAAbA,EAAIknB,MAA4C,mBAAdlnB,EAAImnB,MAGrH,SAASC,EAAcC,GACrB,OAAOC,QAAQC,UAAUL,MAAK,WAC5B,IAAIM,EAEJ,GAAyB,mBAAdH,GAIT,IAAKJ,EAFLO,EAAgBH,KAGd,MAAM,IAAIvD,EAAyB,sBAAuB,YAAa0D,OAEpE,KAAIP,EAAeI,GAGxB,MAAM,IAAIzD,EAAqB,YAAa,CAAC,WAAY,WAAYyD,GAFrEG,EAAgBH,EAKlB,OAAOC,QAAQC,UAAUL,MAAK,WAC5B,OAAOM,KACNN,MAAK,WACN,OAAOtC,KACNuC,OAAM,SAAU3kB,GACjB,OAAOA,QAKb,SAASilB,EAAapC,EAAcH,EAAQ7nB,EAAO2I,GACjD,GAAqB,iBAAV3I,EAAoB,CAC7B,GAAyB,IAArB0D,UAAU3D,OACZ,MAAM,IAAIwmB,EAAqB,QAAS,CAAC,SAAU,QAAS,WAAY,UAAWvmB,GAGrF,GAAwB,WAApB+lB,EAAQ8B,IAAmC,OAAXA,GAClC,GAAIA,EAAOlf,UAAY3I,EACrB,MAAM,IAAIsmB,EAAuB,gBAAiB,sBAAuBtkB,OAAO6lB,EAAOlf,QAAS,wCAE7F,GAAIkf,IAAW7nB,EACpB,MAAM,IAAIsmB,EAAuB,gBAAiB,cAAetkB,OAAO6lB,EAAQ,mCAGlFlf,EAAU3I,EACVA,OAAQ6G,OACH,GAAa,MAAT7G,GAAoC,WAAnB+lB,EAAQ/lB,IAAwC,mBAAVA,EAChE,MAAM,IAAIumB,EAAqB,QAAS,CAAC,SAAU,QAAS,WAAY,UAAWvmB,GAGrF,GAAI6nB,IAAWN,EAAuB,CACpC,IAAI8C,EAAU,GAEVrqB,GAASA,EAAMzB,OACjB8rB,GAAW,KAAKroB,OAAOhC,EAAMzB,KAAM,MAGrC8rB,GAAW1hB,EAAU,KAAK3G,OAAO2G,GAAW,IAC5C,IAAI2hB,EAA+B,YAAtBtC,EAAazpB,KAAqB,YAAc,YAC7DipB,EAAU,CACRK,YAAQhhB,EACRihB,SAAU9nB,EACV+nB,SAAUC,EAAazpB,KACvBoK,QAAS,oBAAoB3G,OAAOsoB,GAAQtoB,OAAOqoB,GACnDrC,aAAcA,IAIlB,GAAIhoB,IAAUypB,EAAkB5B,EAAQ7nB,EAAO2I,EAASqf,GACtD,MAAMH,EAIV,SAAS0C,EAAevC,EAAcH,EAAQ7nB,EAAO2I,GACnD,GAAIkf,IAAWN,EAAf,CAOA,GALqB,iBAAVvnB,IACT2I,EAAU3I,EACVA,OAAQ6G,IAGL7G,GAASypB,EAAkB5B,EAAQ7nB,GAAQ,CAC9C,IAAIqqB,EAAU1hB,EAAU,KAAK3G,OAAO2G,GAAW,IAC3C2hB,EAA+B,kBAAtBtC,EAAazpB,KAA2B,YAAc,YACnEipB,EAAU,CACRK,OAAQA,EACRC,SAAU9nB,EACV+nB,SAAUC,EAAazpB,KACvBoK,QAAS,gBAAgB3G,OAAOsoB,GAAQtoB,OAAOqoB,EAAS,MAAQ,oBAAqBroB,OAAO6lB,GAAUA,EAAOlf,QAAS,KACtHqf,aAAcA,IAIlB,MAAMH,GA2FR,SAAS2C,IACP,IAAK,IAAIC,EAAQ/mB,UAAU3D,OAAQuC,EAAO,IAAInC,MAAMsqB,GAAQC,EAAQ,EAAGA,EAAQD,EAAOC,IACpFpoB,EAAKooB,GAAShnB,UAAUgnB,GAG1BjD,EAAQhkB,WAAM,EAAQ,CAAC+mB,EAAQloB,EAAKvC,QAAQiC,OAAOM,IA7FrDT,EAAO8oB,OAAS,SAASA,EAAOX,GAC9B,IAAK,IAAIY,EAAQlnB,UAAU3D,OAAQuC,EAAO,IAAInC,MAAMyqB,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IACxGvoB,EAAKuoB,EAAQ,GAAKnnB,UAAUmnB,GAG9BT,EAAa3mB,WAAM,EAAQ,CAACknB,EAAQhB,EAAUK,IAAYhoB,OAAOM,KAGnET,EAAOipB,QAAU,SAASA,EAAQd,GAChC,IAAK,IAAIe,EAAQrnB,UAAU3D,OAAQuC,EAAO,IAAInC,MAAM4qB,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IACxG1oB,EAAK0oB,EAAQ,GAAKtnB,UAAUsnB,GAG9B,OAAOjB,EAAcC,GAAWH,MAAK,SAAUllB,GAC7C,OAAOylB,EAAa3mB,WAAM,EAAQ,CAACqnB,EAASnmB,GAAQ3C,OAAOM,QAI/DT,EAAOopB,aAAe,SAASA,EAAavD,GAC1C,IAAK,IAAIwD,EAAQxnB,UAAU3D,OAAQuC,EAAO,IAAInC,MAAM+qB,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IACxG7oB,EAAK6oB,EAAQ,GAAKznB,UAAUynB,GAG9BZ,EAAe9mB,WAAM,EAAQ,CAACwnB,EAActB,EAAUjC,IAAK1lB,OAAOM,KAGpET,EAAOupB,cAAgB,SAASA,EAAc1D,GAC5C,IAAK,IAAI2D,EAAQ3nB,UAAU3D,OAAQuC,EAAO,IAAInC,MAAMkrB,EAAQ,EAAIA,EAAQ,EAAI,GAAIC,EAAQ,EAAGA,EAAQD,EAAOC,IACxGhpB,EAAKgpB,EAAQ,GAAK5nB,UAAU4nB,GAG9B,OAAOvB,EAAcrC,GAAImC,MAAK,SAAUllB,GACtC,OAAO4lB,EAAe9mB,WAAM,EAAQ,CAAC2nB,EAAezmB,GAAQ3C,OAAOM,QAIvET,EAAO0pB,QAAU,SAASA,EAAQ/iB,GAChC,GAAIA,MAAAA,EAAmC,CACrC,IAAIG,EAAU,mCAEO,WAAjBod,EAAQvd,IAA4C,iBAAhBA,EAAIG,QACf,IAAvBH,EAAIG,QAAQ5I,QAAgByI,EAAI9H,YAClCiI,GAAWH,EAAI9H,YAAYnC,KAE3BoK,GAAWH,EAAIG,QAGjBA,GAAWoI,EAAQvI,GAGrB,IAAIgjB,EAAS,IAAI7E,EAAe,CAC9BkB,OAAQrf,EACRsf,SAAU,KACVC,SAAU,UACVpf,QAASA,EACTqf,aAAcuD,IAGZE,EAAYjjB,EAAII,MAEpB,GAAyB,iBAAd6iB,EAAwB,CAIjC,IAAIC,EAAOD,EAAU1f,MAAM,MAC3B2f,EAAKtM,QAIL,IAFA,IAAIuM,EAAOH,EAAO5iB,MAAMmD,MAAM,MAErBjC,EAAI,EAAGA,EAAI4hB,EAAK3rB,OAAQ+J,IAAK,CAEpC,IAAI8hB,EAAMD,EAAKE,QAAQH,EAAK5hB,IAE5B,IAAa,IAAT8hB,EAAY,CAEdD,EAAOA,EAAKtqB,MAAM,EAAGuqB,GACrB,OAIJJ,EAAO5iB,MAAQ,GAAG5G,OAAO2pB,EAAKrqB,KAAK,MAAO,MAAMU,OAAO0pB,EAAKpqB,KAAK,OAGnE,MAAMkqB,IAaV3pB,EAAO2oB,OAASzD,EAAayD,EAAQ3oB,EAAQ,CAC3CiC,MAAOjC,EAAOmnB,YACdJ,UAAW/mB,EAAOinB,gBAClBH,SAAU9mB,EAAOonB,eACjBJ,aAAchnB,EAAOknB,qBAEvBlnB,EAAO2oB,OAAOA,OAAS3oB,EAAO2oB,kDChnB9B,SAASsB,EAAgBnpB,EAAKG,EAAK5C,GAAiK,OAApJ4C,KAAOH,EAAOsB,OAAO8nB,eAAeppB,EAAKG,EAAK,CAAE5C,MAAOA,EAAO8rB,YAAY,EAAMC,cAAc,EAAMC,UAAU,IAAkBvpB,EAAIG,GAAO5C,EAAgByC,EAI3M,SAASwpB,EAAkBC,EAAQC,GAAS,IAAK,IAAIviB,EAAI,EAAGA,EAAIuiB,EAAMtsB,OAAQ+J,IAAK,CAAE,IAAIwiB,EAAaD,EAAMviB,GAAIwiB,EAAWN,WAAaM,EAAWN,aAAc,EAAOM,EAAWL,cAAe,EAAU,UAAWK,IAAYA,EAAWJ,UAAW,GAAMjoB,OAAO8nB,eAAeK,EAAQE,EAAWxpB,IAAKwpB,IAI7S,SAASC,EAA2Bnb,EAAMpS,GAAQ,OAAIA,GAA2B,WAAlB+mB,EAAQ/mB,IAAsC,mBAATA,EAA8CwtB,EAAuBpb,GAAtCpS,EAEnI,SAASwtB,EAAuBpb,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIqb,eAAe,6DAAgE,OAAOrb,EAI/J,SAASsb,EAAiBC,GAAS,IAAIC,EAAwB,mBAAR3vB,IAAqB,IAAIA,SAAQ4J,EAA8nB,OAAnnB6lB,EAAmB,SAA0BC,GAAS,GAAc,OAAVA,IAMlIjF,EANuKiF,GAMjG,IAAzDE,SAASniB,SAAS1L,KAAK0oB,GAAImE,QAAQ,kBAN+H,OAAOc,EAMjN,IAA2BjF,EAN6L,GAAqB,mBAAViF,EAAwB,MAAM,IAAIrD,UAAU,sDAAyD,QAAsB,IAAXsD,EAAwB,CAAE,GAAIA,EAAOrvB,IAAIovB,GAAQ,OAAOC,EAAO/uB,IAAI8uB,GAAQC,EAAOjvB,IAAIgvB,EAAOG,GAAY,SAASA,IAAY,OAAOC,EAAWJ,EAAOjpB,UAAWspB,EAAgBvuB,MAAMiC,aAAgK,OAAhJosB,EAAQpuB,UAAYuF,OAAOgpB,OAAON,EAAMjuB,UAAW,CAAEgC,YAAa,CAAER,MAAO4sB,EAASd,YAAY,EAAOE,UAAU,EAAMD,cAAc,KAAkBiB,EAAgBJ,EAASH,IAAkBD,EAAiBC,GAE9uB,SAASQ,IAA6B,GAAuB,oBAAZC,UAA4BA,QAAQC,UAAW,OAAO,EAAO,GAAID,QAAQC,UAAUC,KAAM,OAAO,EAAO,GAAqB,mBAAVC,MAAsB,OAAO,EAAM,IAAiF,OAA3E7hB,KAAKhN,UAAUgM,SAAS1L,KAAKouB,QAAQC,UAAU3hB,KAAM,IAAI,iBAAyB,EAAQ,MAAOvG,GAAK,OAAO,GAEzT,SAAS4nB,EAAWS,EAAQlrB,EAAMqqB,GAAoV,OAAzSI,EAA9BI,IAA2CC,QAAQC,UAAiC,SAAoBG,EAAQlrB,EAAMqqB,GAAS,IAAItb,EAAI,CAAC,MAAOA,EAAE7N,KAAKC,MAAM4N,EAAG/O,GAAO,IAAsD8mB,EAAW,IAA/CyD,SAASpE,KAAKhlB,MAAM+pB,EAAQnc,IAA6F,OAAnDsb,GAAOO,EAAgB9D,EAAUuD,EAAMjuB,WAAmB0qB,GAAsB2D,EAAWtpB,MAAM,KAAMC,WAIpZ,SAASwpB,EAAgB3X,EAAGtH,GAA+G,OAA1Gif,EAAkBjpB,OAAOwpB,gBAAkB,SAAyBlY,EAAGtH,GAAsB,OAAjBsH,EAAEmY,UAAYzf,EAAUsH,GAAa2X,EAAgB3X,EAAGtH,GAErK,SAAS+e,EAAgBzX,GAAwJ,OAAnJyX,EAAkB/oB,OAAOwpB,eAAiBxpB,OAAO0pB,eAAiB,SAAyBpY,GAAK,OAAOA,EAAEmY,WAAazpB,OAAO0pB,eAAepY,IAAcyX,EAAgBzX,GAExM,SAASwQ,EAAQpjB,GAAwT,OAAtOojB,EAArD,mBAAXC,QAAoD,iBAApBA,OAAOC,SAAmC,SAAiBtjB,GAAO,cAAcA,GAA2B,SAAiBA,GAAO,OAAOA,GAAyB,mBAAXqjB,QAAyBrjB,EAAIjC,cAAgBslB,QAAUrjB,IAAQqjB,OAAOtnB,UAAY,gBAAkBiE,GAAiBojB,EAAQpjB,GAExV,IACIoO,EADW,EAAQ,MACAA,QAGnBwV,EADY,EAAQ,MACaF,MAAME,qBAG3C,SAASqH,EAAS9lB,EAAK+lB,EAAQC,GAK7B,YAJiBjnB,IAAbinB,GAA0BA,EAAWhmB,EAAI/H,UAC3C+tB,EAAWhmB,EAAI/H,QAGV+H,EAAIimB,UAAUD,EAAWD,EAAO9tB,OAAQ+tB,KAAcD,EAmB/D,IAAIG,EAAO,GACPC,EAAQ,GACRrf,EAAM,GACNsf,EAAQ,GACRC,EAAoB,CACtBrF,gBAAiB,6CACjBE,YAAa,wCACboF,kBAAmB,yDACnBxF,UAAW,4CACX9kB,MAAO,uCACPilB,mBAAoB,sDACpBE,eAAgB,+CAChBoF,qBAAsB,6DACtBxF,aAAc,qDACdF,SAAU,8CACV2F,aAAc,6CAMhB,SAASC,EAAUC,GACjB,IAAItqB,EAAOD,OAAOC,KAAKsqB,GACnBpC,EAASnoB,OAAOgpB,OAAOhpB,OAAO0pB,eAAea,IAOjD,OANAtqB,EAAKzC,SAAQ,SAAUqB,GACrBspB,EAAOtpB,GAAO0rB,EAAO1rB,MAEvBmB,OAAO8nB,eAAeK,EAAQ,UAAW,CACvClsB,MAAOsuB,EAAO7lB,UAETyjB,EAGT,SAASqC,EAAarqB,GAGpB,OAAO2M,EAAQ3M,EAAK,CAClBsqB,SAAS,EACTC,eAAe,EACfC,MAAO,IACPC,eAAgBC,EAAAA,EAEhBC,YAAY,EAMZC,YAAaF,EAAAA,EAEbG,WAAW,EACXC,QAAQ,EAERC,SAAS,IAgOb,IAAIxI,EAEJ,SAAUyI,GAGR,SAASzI,EAAernB,GACtB,IAAI6pB,EAIJ,GAxVJ,SAAyBC,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAIC,UAAU,qCAsV5GC,CAAgB9qB,KAAMkoB,GAEG,WAArBZ,EAAQzmB,IAAqC,OAAZA,EACnC,MAAM,IAAIinB,EAAqB,UAAW,SAAUjnB,GAGtD,IAAIqJ,EAAUrJ,EAAQqJ,QAClBof,EAAWzoB,EAAQyoB,SACnBC,EAAe1oB,EAAQ0oB,aACvBH,EAASvoB,EAAQuoB,OACjBC,EAAWxoB,EAAQwoB,SACnBuH,EAAQ3xB,MAAM4xB,gBAGlB,GAFA5xB,MAAM4xB,gBAAkB,EAET,MAAX3mB,EACFwgB,EAAQoD,EAA2B9tB,KAAMuuB,EAAgBrG,GAAgB3nB,KAAKP,KAAM6L,OAAO3B,UA0B3F,GAxBI2f,EAAQiH,QAAUjH,EAAQiH,OAAOC,QAG/BlH,EAAQiH,QAAUjH,EAAQiH,OAAOE,eAAoD,IAAnCnH,EAAQiH,OAAOE,iBACnEzB,EAAO,QACPC,EAAQ,QACRC,EAAQ,QACRtf,EAAM,UAENof,EAAO,GACPC,EAAQ,GACRC,EAAQ,GACRtf,EAAM,KAOc,WAApBmX,EAAQ8B,IAAmC,OAAXA,GAAyC,WAAtB9B,EAAQ+B,IAAuC,OAAbA,GAAqB,UAAWD,GAAUA,aAAkBnqB,OAAS,UAAWoqB,GAAYA,aAAoBpqB,QACvMmqB,EAAS0G,EAAU1G,GACnBC,EAAWyG,EAAUzG,IAGN,oBAAbC,GAA+C,gBAAbA,EACpCoB,EAAQoD,EAA2B9tB,KAAMuuB,EAAgBrG,GAAgB3nB,KAAKP,KA9QtF,SAAuBopB,EAAQC,EAAUC,GACvC,IAAI2H,EAAQ,GACRzuB,EAAM,GACN0uB,EAAU,EACVxjB,EAAM,GACNyjB,GAAU,EACVC,EAAkBpB,EAAa5G,GAC/BiI,EAAcD,EAAgB9jB,MAAM,MACpCgkB,EAAgBtB,EAAa3G,GAAU/b,MAAM,MAC7CjC,EAAI,EACJkmB,EAAY,GAShB,GANiB,gBAAbjI,GAAkD,WAApBhC,EAAQ8B,IAA8C,WAAtB9B,EAAQ+B,IAAqC,OAAXD,GAAgC,OAAbC,IACrHC,EAAW,qBAKc,IAAvB+H,EAAY/vB,QAAyC,IAAzBgwB,EAAchwB,QAAgB+vB,EAAY,KAAOC,EAAc,GAAI,CACjG,IAAIE,EAAcH,EAAY,GAAG/vB,OAASgwB,EAAc,GAAGhwB,OAI3D,GAAIkwB,GA9Dc,IA+DhB,KAAyB,WAApBlK,EAAQ8B,IAAmC,OAAXA,GAA2C,WAAtB9B,EAAQ+B,IAAuC,OAAbA,GAAkC,IAAXD,GAA6B,IAAbC,GAEjI,MAAO,GAAG9lB,OAAOmsB,EAAkBpG,GAAW,QAAU,GAAG/lB,OAAO8tB,EAAY,GAAI,SAAS9tB,OAAO+tB,EAAc,GAAI,WAEjH,GAAiB,sBAAbhI,GAMLkI,GAFY3H,EAAQiH,QAAUjH,EAAQiH,OAAOC,MAAQlH,EAAQiH,OAAOW,QAAU,IAErD,CAC3B,KAAOJ,EAAY,GAAGhmB,KAAOimB,EAAc,GAAGjmB,IAC5CA,IAIEA,EAAI,IAGNkmB,EAAY,OAAOhuB,OApH7B,SAAgB8F,EAAKqoB,GAEnB,GADAA,EAAQ5gB,KAAK6gB,MAAMD,GACD,GAAdroB,EAAI/H,QAAwB,GAATowB,EAAY,MAAO,GAC1C,IAAIE,EAAWvoB,EAAI/H,OAASowB,EAG5B,IAFAA,EAAQ5gB,KAAK6gB,MAAM7gB,KAAK+gB,IAAIH,GAAS5gB,KAAK+gB,IAAI,IAEvCH,GACLroB,GAAOA,EACPqoB,IAIF,OADAroB,EAAOA,EAAIimB,UAAU,EAAGsC,EAAWvoB,EAAI/H,QAyGLwwB,CAAO,IAAKzmB,GAAI,KAC1CA,EAAI,IAWZ,IAHA,IAAIuH,EAAIye,EAAYA,EAAY/vB,OAAS,GACrCuR,EAAIye,EAAcA,EAAchwB,OAAS,GAEtCsR,IAAMC,IACPxH,IAAM,EACRqC,EAAM,OAAOnK,OAAOqP,GAAGrP,OAAOmK,GAE9BujB,EAAQre,EAGVye,EAAYU,MACZT,EAAcS,MACa,IAAvBV,EAAY/vB,QAAyC,IAAzBgwB,EAAchwB,SAC9CsR,EAAIye,EAAYA,EAAY/vB,OAAS,GACrCuR,EAAIye,EAAcA,EAAchwB,OAAS,GAG3C,IAAI0wB,EAAWlhB,KAAKC,IAAIsgB,EAAY/vB,OAAQgwB,EAAchwB,QAG1D,GAAiB,IAAb0wB,EAAgB,CAElB,IAAIC,EAAeb,EAAgB9jB,MAAM,MAIzC,GAAI2kB,EAAa3wB,OAAS,GAGxB,IAFA2wB,EAAa,IAAM,GAAG1uB,OAAOgsB,EAAM,OAAOhsB,OAAOksB,GAE1CwC,EAAa3wB,OAAS,IAC3B2wB,EAAaF,MAIjB,MAAO,GAAGxuB,OAAOmsB,EAAkBG,aAAc,QAAQtsB,OAAO0uB,EAAapvB,KAAK,MAAO,MAGvFwI,EAAI,IACNqC,EAAM,KAAKnK,OAAOgsB,EAAM,OAAOhsB,OAAOksB,GAAOlsB,OAAOmK,GACpDyjB,GAAU,GAGE,KAAVF,IACFvjB,EAAM,OAAOnK,OAAO0tB,GAAO1tB,OAAOmK,GAClCujB,EAAQ,IAGV,IAAIiB,EAAe,EACfzoB,EAAMimB,EAAkBpG,GAAY,KAAK/lB,OAAOisB,EAAO,YAAYjsB,OAAOksB,EAAO,KAAKlsB,OAAO4M,EAAK,cAAc5M,OAAOksB,GACvH0C,EAAa,IAAI5uB,OAAOgsB,EAAM,OAAOhsB,OAAOksB,EAAO,kBAEvD,IAAKpkB,EAAI,EAAGA,EAAI2mB,EAAU3mB,IAAK,CAE7B,IAAI+mB,EAAM/mB,EAAI6lB,EAEd,GAAIG,EAAY/vB,OAAS+J,EAAI,EAIvB+mB,EAAM,GAAK/mB,EAAI,IACb+mB,EAAM,GACR5vB,GAAO,KAAKe,OAAOgsB,EAAM,OAAOhsB,OAAOksB,GACvC0B,GAAU,GACDiB,EAAM,IACf5vB,GAAO,OAAOe,OAAO+tB,EAAcjmB,EAAI,IACvC6mB,KAGF1vB,GAAO,OAAOe,OAAO+tB,EAAcjmB,EAAI,IACvC6mB,KAIFhB,EAAU7lB,EAEV4lB,GAAS,KAAK1tB,OAAO4M,EAAK,KAAK5M,OAAOksB,EAAO,KAAKlsB,OAAO+tB,EAAcjmB,IACvE6mB,SACK,GAAIZ,EAAchwB,OAAS+J,EAAI,EAIhC+mB,EAAM,GAAK/mB,EAAI,IACb+mB,EAAM,GACR5vB,GAAO,KAAKe,OAAOgsB,EAAM,OAAOhsB,OAAOksB,GACvC0B,GAAU,GACDiB,EAAM,IACf5vB,GAAO,OAAOe,OAAO8tB,EAAYhmB,EAAI,IACrC6mB,KAGF1vB,GAAO,OAAOe,OAAO8tB,EAAYhmB,EAAI,IACrC6mB,KAIFhB,EAAU7lB,EAEV7I,GAAO,KAAKe,OAAOisB,EAAO,KAAKjsB,OAAOksB,EAAO,KAAKlsB,OAAO8tB,EAAYhmB,IACrE6mB,QACK,CACL,IAAIG,EAAef,EAAcjmB,GAC7BinB,EAAajB,EAAYhmB,GAIzBknB,EAAiBD,IAAeD,KAAkBlD,EAASmD,EAAY,MAAQA,EAAW1vB,MAAM,GAAI,KAAOyvB,GAU3GE,GAAkBpD,EAASkD,EAAc,MAAQA,EAAazvB,MAAM,GAAI,KAAO0vB,IACjFC,GAAiB,EACjBD,GAAc,KAGZC,GAIEH,EAAM,GAAK/mB,EAAI,IACb+mB,EAAM,GACR5vB,GAAO,KAAKe,OAAOgsB,EAAM,OAAOhsB,OAAOksB,GACvC0B,GAAU,GACDiB,EAAM,IACf5vB,GAAO,OAAOe,OAAO8tB,EAAYhmB,EAAI,IACrC6mB,KAGF1vB,GAAO,OAAOe,OAAO8tB,EAAYhmB,EAAI,IACrC6mB,KAIFhB,EAAU7lB,EAGV7I,GAAO,KAAKe,OAAOisB,EAAO,KAAKjsB,OAAOksB,EAAO,KAAKlsB,OAAO+uB,GACzDrB,GAAS,KAAK1tB,OAAO4M,EAAK,KAAK5M,OAAOksB,EAAO,KAAKlsB,OAAO8uB,GACzDH,GAAgB,IAIhB1vB,GAAOyuB,EACPA,EAAQ,GAGI,IAARmB,GAAmB,IAAN/mB,IACf7I,GAAO,OAAOe,OAAO+uB,GACrBJ,MAMN,GAAIA,EAAe,IAAM7mB,EAAI2mB,EAAW,EACtC,MAAO,GAAGzuB,OAAOkG,GAAKlG,OAAO4uB,EAAY,MAAM5uB,OAAOf,EAAK,MAAMe,OAAOgsB,EAAM,OAAOhsB,OAAOksB,GAAOlsB,OAAO0tB,EAAO,MAAQ,GAAG1tB,OAAOgsB,EAAM,OAAOhsB,OAAOksB,GAI3J,MAAO,GAAGlsB,OAAOkG,GAAKlG,OAAO4tB,EAAUgB,EAAa,GAAI,MAAM5uB,OAAOf,GAAKe,OAAO0tB,GAAO1tB,OAAOmK,GAAKnK,OAAOguB,GAqDjBiB,CAAcpJ,EAAQC,EAAUC,UAC/G,GAAiB,uBAAbA,GAAkD,mBAAbA,EAA+B,CAG7E,IAAI9pB,EAAOkwB,EAAkBpG,GACzB9mB,EAAMwtB,EAAa5G,GAAQ9b,MAAM,MAQrC,GANiB,mBAAbgc,GAAqD,WAApBhC,EAAQ8B,IAAmC,OAAXA,IACnE5pB,EAAOkwB,EAAkBE,sBAKvBptB,EAAIlB,OAAS,GAGf,IAFAkB,EAAI,IAAM,GAAGe,OAAOgsB,EAAM,OAAOhsB,OAAOksB,GAEjCjtB,EAAIlB,OAAS,IAClBkB,EAAIuvB,MAMNrH,EADiB,IAAfloB,EAAIlB,OACEwsB,EAA2B9tB,KAAMuuB,EAAgBrG,GAAgB3nB,KAAKP,KAAM,GAAGuD,OAAO/D,EAAM,KAAK+D,OAAOf,EAAI,MAE5GsrB,EAA2B9tB,KAAMuuB,EAAgBrG,GAAgB3nB,KAAKP,KAAM,GAAGuD,OAAO/D,EAAM,QAAQ+D,OAAOf,EAAIK,KAAK,MAAO,YAEhI,CACL,IAAI4vB,EAAOzC,EAAa5G,GAEpB6H,EAAQ,GACRyB,EAAiBhD,EAAkBpG,GAEtB,iBAAbA,GAA4C,aAAbA,GACjCmJ,EAAO,GAAGlvB,OAAOmsB,EAAkBpG,GAAW,QAAQ/lB,OAAOkvB,IAEpDnxB,OAAS,OAChBmxB,EAAO,GAAGlvB,OAAOkvB,EAAK7vB,MAAM,EAAG,MAAO,SAGxCquB,EAAQ,GAAG1tB,OAAOysB,EAAa3G,IAE3BoJ,EAAKnxB,OAAS,MAChBmxB,EAAO,GAAGlvB,OAAOkvB,EAAK7vB,MAAM,EAAG,KAAM,QAGnCquB,EAAM3vB,OAAS,MACjB2vB,EAAQ,GAAG1tB,OAAO0tB,EAAMruB,MAAM,EAAG,KAAM,QAGxB,cAAb0mB,GAAyC,UAAbA,EAC9BmJ,EAAO,GAAGlvB,OAAOmvB,EAAgB,QAAQnvB,OAAOkvB,EAAM,wBAEtDxB,EAAQ,IAAI1tB,OAAO+lB,EAAU,KAAK/lB,OAAO0tB,IAI7CvG,EAAQoD,EAA2B9tB,KAAMuuB,EAAgBrG,GAAgB3nB,KAAKP,KAAM,GAAGuD,OAAOkvB,GAAMlvB,OAAO0tB,KA0B/G,OAtBAhyB,MAAM4xB,gBAAkBD,EACxBlG,EAAMvB,kBAAoBjf,EAC1B1E,OAAO8nB,eAAeS,EAAuBrD,GAAQ,OAAQ,CAC3DjpB,MAAO,iCACP8rB,YAAY,EACZE,UAAU,EACVD,cAAc,IAEhB9C,EAAMiI,KAAO,gBACbjI,EAAMtB,OAASA,EACfsB,EAAMrB,SAAWA,EACjBqB,EAAMpB,SAAWA,EAEbrqB,MAAMoL,mBAERpL,MAAMoL,kBAAkB0jB,EAAuBrD,GAAQnB,GAIzDmB,EAAMvgB,MAENugB,EAAM5qB,KAAO,iBACNguB,EAA2BpD,GA/ctC,IAAsBE,EAAagI,EAqejC,OA/dF,SAAmBC,EAAUC,GAAc,GAA0B,mBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIjI,UAAU,sDAAyDgI,EAAS5yB,UAAYuF,OAAOgpB,OAAOsE,GAAcA,EAAW7yB,UAAW,CAAEgC,YAAa,CAAER,MAAOoxB,EAAUpF,UAAU,EAAMD,cAAc,KAAesF,GAAYrE,EAAgBoE,EAAUC,GAuUjXC,CAAU7K,EAAgByI,GA7UN/F,EAkdP1C,EAldoB0K,EAkdJ,CAAC,CAC5BvuB,IAAK,WACL5C,MAAO,WACL,MAAO,GAAG8B,OAAOvD,KAAKF,KAAM,MAAMyD,OAAOvD,KAAK2yB,KAAM,OAAOpvB,OAAOvD,KAAKkK,WAExE,CACD7F,IAAKiO,EAAQ0gB,OACbvxB,MAAO,SAAewxB,EAAcrP,GAKlC,OAAOtR,EAAQtS,KAterB,SAAuB2tB,GAAU,IAAK,IAAItiB,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IAAK,CAAE,IAAI0kB,EAAyB,MAAhB9qB,UAAUoG,GAAapG,UAAUoG,GAAK,GAAQ6nB,EAAU1tB,OAAOC,KAAKsqB,GAAqD,mBAAjCvqB,OAAO2tB,wBAAwCD,EAAUA,EAAQ3vB,OAAOiC,OAAO2tB,sBAAsBpD,GAAQ5qB,QAAO,SAAUiuB,GAAO,OAAO5tB,OAAO6tB,yBAAyBtD,EAAQqD,GAAK7F,gBAAmB2F,EAAQlwB,SAAQ,SAAUqB,GAAOgpB,EAAgBM,EAAQtpB,EAAK0rB,EAAO1rB,OAAa,OAAOspB,EAse7b2F,CAAc,GAAI1P,EAAK,CAC1CsM,eAAe,EACfC,MAAO,QAhemDyC,GAAYlF,EAAkB9C,EAAY3qB,UAAW2yB,GAqe9G1K,EAzJT,CA0JE+F,EAAiBhvB,QAEnBR,EAAOC,QAAUwpB,+BCtejB,SAASZ,EAAQpjB,GAAwT,OAAtOojB,EAArD,mBAAXC,QAAoD,iBAApBA,OAAOC,SAAmC,SAAiBtjB,GAAO,cAAcA,GAA2B,SAAiBA,GAAO,OAAOA,GAAyB,mBAAXqjB,QAAyBrjB,EAAIjC,cAAgBslB,QAAUrjB,IAAQqjB,OAAOtnB,UAAY,gBAAkBiE,GAAiBojB,EAAQpjB,GAQxV,SAASqqB,EAAgBzX,GAAwJ,OAAnJyX,EAAkB/oB,OAAOwpB,eAAiBxpB,OAAO0pB,eAAiB,SAAyBpY,GAAK,OAAOA,EAAEmY,WAAazpB,OAAO0pB,eAAepY,IAAcyX,EAAgBzX,GAIxM,SAAS2X,EAAgB3X,EAAGtH,GAA+G,OAA1Gif,EAAkBjpB,OAAOwpB,gBAAkB,SAAyBlY,EAAGtH,GAAsB,OAAjBsH,EAAEmY,UAAYzf,EAAUsH,GAAa2X,EAAgB3X,EAAGtH,GAErK,IAEIpM,EACAmwB,EAHA3L,EAAQ,GAKZ,SAAS4L,EAAgBb,EAAMzoB,EAAS/J,GACjCA,IACHA,EAAOlB,OAWT,IAAIw0B,EAEJ,SAAUC,GAGR,SAASD,EAAUE,EAAMC,EAAMC,GAC7B,IAAInJ,EAMJ,OA1CN,SAAyBC,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAIC,UAAU,qCAsC1GC,CAAgB9qB,KAAMyzB,GAEtB/I,EAtCN,SAAoC/X,EAAMpS,GAAQ,OAAIA,GAA2B,WAAlB+mB,EAAQ/mB,IAAsC,mBAATA,EAEpG,SAAgCoS,GAAQ,QAAa,IAATA,EAAmB,MAAM,IAAIqb,eAAe,6DAAgE,OAAOrb,EAFbob,CAAuBpb,GAAtCpS,EAsCrHutB,CAA2B9tB,KAAMuuB,EAAgBkF,GAAWlzB,KAAKP,KAlB7E,SAAoB2zB,EAAMC,EAAMC,GAC9B,MAAuB,iBAAZ3pB,EACFA,EAEAA,EAAQypB,EAAMC,EAAMC,GAcoDC,CAAWH,EAAMC,EAAMC,KACtGnJ,EAAMiI,KAAOA,EACNjI,EAGT,OArCJ,SAAmBmI,EAAUC,GAAc,GAA0B,mBAAfA,GAA4C,OAAfA,EAAuB,MAAM,IAAIjI,UAAU,sDAAyDgI,EAAS5yB,UAAYuF,OAAOgpB,OAAOsE,GAAcA,EAAW7yB,UAAW,CAAEgC,YAAa,CAAER,MAAOoxB,EAAUpF,UAAU,EAAMD,cAAc,KAAesF,GAAYrE,EAAgBoE,EAAUC,GAyB/WC,CAAUU,EAAWC,GAYdD,EAbT,CAcEtzB,GAEFynB,EAAM+K,GAAQc,EAIhB,SAASM,EAAM1K,EAAU2K,GACvB,GAAItyB,MAAMC,QAAQ0nB,GAAW,CAC3B,IAAIje,EAAMie,EAAS/nB,OAKnB,OAJA+nB,EAAWA,EAASznB,KAAI,SAAUyJ,GAChC,OAAOQ,OAAOR,MAGZD,EAAM,EACD,UAAU7H,OAAOywB,EAAO,KAAKzwB,OAAO8lB,EAASzmB,MAAM,EAAGwI,EAAM,GAAGvI,KAAK,MAAO,SAAWwmB,EAASje,EAAM,GAC3F,IAARA,EACF,UAAU7H,OAAOywB,EAAO,KAAKzwB,OAAO8lB,EAAS,GAAI,QAAQ9lB,OAAO8lB,EAAS,IAEzE,MAAM9lB,OAAOywB,EAAO,KAAKzwB,OAAO8lB,EAAS,IAGlD,MAAO,MAAM9lB,OAAOywB,EAAO,KAAKzwB,OAAOsI,OAAOwd,IA+BlDmK,EAAgB,yBAA0B,qCAAsC3I,WAChF2I,EAAgB,wBAAwB,SAAU1zB,EAAMupB,EAAUD,GAIhE,IAAI6K,EA/BmB7E,EAwCnB3lB,EA1BYJ,EAAaxC,EA4B7B,QAdeuB,IAAXhF,IAAsBA,EAAS,EAAQ,OAC3CA,EAAuB,iBAATtD,EAAmB,2BAIT,iBAAbupB,IAjCY+F,EAiCkC,OAAV/F,EAhCpC6K,OAAyB,EAAU9E,EAAO9tB,UAAY8tB,IAiC/D6E,EAAa,cACb5K,EAAWA,EAASzb,QAAQ,QAAS,KAErCqmB,EAAa,UAhCjB,SAAkB5qB,EAAK+lB,EAAQC,GAK7B,YAJiBjnB,IAAbinB,GAA0BA,EAAWhmB,EAAI/H,UAC3C+tB,EAAWhmB,EAAI/H,QAGV+H,EAAIimB,UAAUD,EAAWD,EAAO9tB,OAAQ+tB,KAAcD,EAgCzDD,CAASrvB,EAAM,aAEjB2J,EAAM,OAAOlG,OAAOzD,EAAM,KAAKyD,OAAO0wB,EAAY,KAAK1wB,OAAOwwB,EAAM1K,EAAU,aACzE,CACL,IAAIrhB,GA/Be,iBAAVnB,IACTA,EAAQ,GAGNA,EA2BwB,IA3BTvF,QALH+H,EAgCMvJ,GA3BUwB,SAGS,IAAhC+H,EAAI+jB,QAwBe,IAxBCvmB,GAwBmB,WAAb,YACjC4C,EAAM,QAASlG,OAAOzD,EAAM,MAAOyD,OAAOyE,EAAM,KAAKzE,OAAO0wB,EAAY,KAAK1wB,OAAOwwB,EAAM1K,EAAU,SAKtG,OADA5f,EAAO,mBAAmBlG,OAAO+jB,EAAQ8B,MAExCyB,WACH2I,EAAgB,yBAAyB,SAAU1zB,EAAM2B,GACvD,IAAI0yB,EAASlvB,UAAU3D,OAAS,QAAsB8G,IAAjBnD,UAAU,GAAmBA,UAAU,GAAK,kBACpEmD,IAATmrB,IAAoBA,EAAO,EAAQ,OACvC,IAAIa,EAAYb,EAAKjhB,QAAQ7Q,GAM7B,OAJI2yB,EAAU9yB,OAAS,MACrB8yB,EAAY,GAAG7wB,OAAO6wB,EAAUxxB,MAAM,EAAG,KAAM,QAG1C,iBAAiBW,OAAOzD,EAAM,MAAMyD,OAAO4wB,EAAQ,eAAe5wB,OAAO6wB,KAC/EvJ,UAAWwJ,YACdb,EAAgB,4BAA4B,SAAUztB,EAAOjG,EAAM2B,GACjE,IAAIuG,EAQJ,OALEA,EADEvG,GAASA,EAAMQ,aAAeR,EAAMQ,YAAYnC,KAC3C,eAAeyD,OAAO9B,EAAMQ,YAAYnC,MAExC,QAAQyD,OAAO+jB,EAAQ7lB,IAGzB,YAAY8B,OAAOwC,EAAO,8BAA+BxC,OAAOzD,EAAM,KAAQ,qBAAqByD,OAAOyE,EAAM,OACtH6iB,WACH2I,EAAgB,oBAAoB,WAClC,IAAK,IAAIhK,EAAOvkB,UAAU3D,OAAQuC,EAAO,IAAInC,MAAM8nB,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E5lB,EAAK4lB,GAAQxkB,UAAUwkB,QAGVrhB,IAAXhF,IAAsBA,EAAS,EAAQ,OAC3CA,EAAOS,EAAKvC,OAAS,EAAG,0CACxB,IAAImI,EAAM,OACN2B,EAAMvH,EAAKvC,OAKf,OAJAuC,EAAOA,EAAKjC,KAAI,SAAUgR,GACxB,MAAO,IAAKrP,OAAOqP,EAAG,QAGhBxH,GACN,KAAK,EACH3B,GAAO,GAAGlG,OAAOM,EAAK,GAAI,aAC1B,MAEF,KAAK,EACH4F,GAAO,GAAGlG,OAAOM,EAAK,GAAI,SAASN,OAAOM,EAAK,GAAI,cACnD,MAEF,QACE4F,GAAO5F,EAAKjB,MAAM,EAAGwI,EAAM,GAAGvI,KAAK,MACnC4G,GAAO,SAASlG,OAAOM,EAAKuH,EAAM,GAAI,cAI1C,MAAO,GAAG7H,OAAOkG,EAAK,wBACrBohB,WACHpsB,EAAOC,QAAQkpB,MAAQA,+BC9LvB,SAAS0M,EAAeC,EAAKlpB,GAAK,OAMlC,SAAyBkpB,GAAO,GAAI7yB,MAAMC,QAAQ4yB,GAAM,OAAOA,EANtBC,CAAgBD,IAIzD,SAA+BA,EAAKlpB,GAAK,IAAIopB,EAAO,GAAQC,GAAK,EAAUC,GAAK,EAAWC,OAAKxsB,EAAW,IAAM,IAAK,IAAiCysB,EAA7BC,EAAKP,EAAIhN,OAAOC,cAAmBkN,GAAMG,EAAKC,EAAGpO,QAAQqO,QAAoBN,EAAK1vB,KAAK8vB,EAAGpzB,QAAY4J,GAAKopB,EAAKnzB,SAAW+J,GAA3DqpB,GAAK,IAAoE,MAAO3qB,GAAO4qB,GAAK,EAAMC,EAAK7qB,EAAO,QAAU,IAAW2qB,GAAsB,MAAhBI,EAAW,QAAWA,EAAW,SAAO,QAAU,GAAIH,EAAI,MAAMC,GAAQ,OAAOH,EAJjVO,CAAsBT,EAAKlpB,IAE5F,WAA8B,MAAM,IAAIwf,UAAU,wDAFgDoK,GAQlG,SAAS3N,EAAQpjB,GAAwT,OAAtOojB,EAArD,mBAAXC,QAAoD,iBAApBA,OAAOC,SAAmC,SAAiBtjB,GAAO,cAAcA,GAA2B,SAAiBA,GAAO,OAAOA,GAAyB,mBAAXqjB,QAAyBrjB,EAAIjC,cAAgBslB,QAAUrjB,IAAQqjB,OAAOtnB,UAAY,gBAAkBiE,GAAiBojB,EAAQpjB,GAExV,IAAIgxB,OAAqC9sB,IAAf,KAAK+sB,MAE3BC,EAAe,SAAsBl2B,GACvC,IAAIm2B,EAAQ,GAIZ,OAHAn2B,EAAI8D,SAAQ,SAAUvB,GACpB,OAAO4zB,EAAMtwB,KAAKtD,MAEb4zB,GAGLC,EAAe,SAAsB1zB,GACvC,IAAIyzB,EAAQ,GAIZ,OAHAzzB,EAAIoB,SAAQ,SAAUvB,EAAO4C,GAC3B,OAAOgxB,EAAMtwB,KAAK,CAACV,EAAK5C,OAEnB4zB,GAGL7M,EAAWhjB,OAAOijB,GAAKjjB,OAAOijB,GAAK,EAAQ,KAC3C8M,EAA8B/vB,OAAO2tB,sBAAwB3tB,OAAO2tB,sBAAwB,WAC9F,MAAO,IAELqC,EAAcr2B,OAAOs2B,MAAQt2B,OAAOs2B,MAAQ,EAAQ,KAExD,SAASC,EAAYC,GACnB,OAAOA,EAAEp1B,KAAKypB,KAAK2L,GAGrB,IAAIj1B,EAAiBg1B,EAAYlwB,OAAOvF,UAAUS,gBAC9Ck1B,EAAuBF,EAAYlwB,OAAOvF,UAAU21B,sBACpDC,EAAiBH,EAAYlwB,OAAOvF,UAAUgM,UAE9Ckc,EAAiB,cACjB2N,EAAmB3N,EAAe2N,iBAClCC,EAAoB5N,EAAe4N,kBACnCC,EAAS7N,EAAe6N,OACxBC,EAAQ9N,EAAe8N,MACvB5N,EAAWF,EAAeE,SAC1B6N,EAAQ/N,EAAe+N,MACvBC,EAAgBhO,EAAegO,cAC/BC,EAAmBjO,EAAeiO,iBAClCC,EAAiBlO,EAAekO,eAChCC,EAAiBnO,EAAemO,eAChCC,EAAkBpO,EAAeoO,gBACjCC,EAAiBrO,EAAeqO,eAChCC,EAAiBtO,EAAesO,eAChCC,EAAiBvO,EAAeuO,eAChCC,EAAiBxO,EAAewO,eAEpC,SAASC,EAAWvyB,GAClB,GAAmB,IAAfA,EAAI/C,QAAgB+C,EAAI/C,OAAS,GAAI,OAAO,EAEhD,IAAK,IAAI+J,EAAI,EAAGA,EAAIhH,EAAI/C,OAAQ+J,IAAK,CACnC,IAAIsnB,EAAOtuB,EAAIgK,WAAWhD,GAC1B,GAAIsnB,EAAO,IAAMA,EAAO,GAAI,OAAO,EAIrC,OAAsB,KAAftuB,EAAI/C,QAAiB+C,GAAOyM,KAAKoB,IAAI,EAAG,IAGjD,SAAS2kB,EAAyBp1B,GAChC,OAAO+D,OAAOC,KAAKhE,GAAO0D,OAAOyxB,GAAYrzB,OAAOgyB,EAA4B9zB,GAAO0D,OAAOK,OAAOvF,UAAU21B,qBAAqB5L,KAAKvoB,KAY3I,SAASq1B,EAAQlkB,EAAGC,GAClB,GAAID,IAAMC,EACR,OAAO,EAMT,IAHA,IAAIqJ,EAAItJ,EAAEtR,OACN6a,EAAItJ,EAAEvR,OAED+J,EAAI,EAAGD,EAAM0F,KAAK/D,IAAImP,EAAGC,GAAI9Q,EAAID,IAAOC,EAC/C,GAAIuH,EAAEvH,KAAOwH,EAAExH,GAAI,CACjB6Q,EAAItJ,EAAEvH,GACN8Q,EAAItJ,EAAExH,GACN,MAIJ,OAAI6Q,EAAIC,GACE,EAGNA,EAAID,EACC,EAGF,EA+ET,SAAS6a,EAAeC,EAAMC,EAAMlL,EAAQmL,GAE1C,GAAIF,IAASC,EACX,OAAa,IAATD,IACGjL,GAASvD,EAASwO,EAAMC,GAIjC,GAAIlL,EAAQ,CACV,GAAsB,WAAlBzE,EAAQ0P,GACV,MAAuB,iBAATA,GAAqBxB,EAAYwB,IAASxB,EAAYyB,GAGtE,GAAsB,WAAlB3P,EAAQ2P,IAA+B,OAATD,GAA0B,OAATC,EACjD,OAAO,EAGT,GAAIzxB,OAAO0pB,eAAe8H,KAAUxxB,OAAO0pB,eAAe+H,GACxD,OAAO,MAEJ,CACL,GAAa,OAATD,GAAmC,WAAlB1P,EAAQ0P,GAC3B,OAAa,OAATC,GAAmC,WAAlB3P,EAAQ2P,KAEpBD,GAAQC,EAMnB,GAAa,OAATA,GAAmC,WAAlB3P,EAAQ2P,GAC3B,OAAO,EAIX,IA7E4BE,EAAMC,EA1BTxkB,EAAGC,EAuGxBwkB,EAAUxB,EAAemB,GAG7B,GAAIK,IAFUxB,EAAeoB,GAG3B,OAAO,EAGT,GAAIv1B,MAAMC,QAAQq1B,GAAO,CAEvB,GAAIA,EAAK11B,SAAW21B,EAAK31B,OACvB,OAAO,EAGT,IAAIg2B,EAAQT,EAAyBG,GACjCO,EAAQV,EAAyBI,GAErC,OAAIK,EAAMh2B,SAAWi2B,EAAMj2B,QAIpBk2B,EAASR,EAAMC,EAAMlL,EAAQmL,EA/HzB,EA+H0CI,GAMvD,GAAgB,oBAAZD,KAEGpB,EAAMe,IAASf,EAAMgB,KAAUf,EAAMc,IAASd,EAAMe,IACvD,OAAO,EAIX,GAAIjB,EAAOgB,IACT,IAAKhB,EAAOiB,IAAShqB,KAAKhN,UAAUw3B,QAAQl3B,KAAKy2B,KAAU/pB,KAAKhN,UAAUw3B,QAAQl3B,KAAK02B,GACrF,OAAO,OAEJ,GAAI5O,EAAS2O,IAClB,IAAK3O,EAAS4O,KA7ISrkB,EA6ImBokB,EA7IhBnkB,EA6IsBokB,IA5I3C/B,EAAsBtiB,EAAEmd,SAAWld,EAAEkd,QAAUnd,EAAEuiB,QAAUtiB,EAAEsiB,MAAQuC,OAAOz3B,UAAUgM,SAAS1L,KAAKqS,KAAO8kB,OAAOz3B,UAAUgM,SAAS1L,KAAKsS,KA6I7I,OAAO,OAEJ,GAAIsjB,EAAca,IAASA,aAAgB/3B,OAGhD,GAAI+3B,EAAK9sB,UAAY+sB,EAAK/sB,SAAW8sB,EAAKl3B,OAASm3B,EAAKn3B,KACtD,OAAO,MAEJ,IAAIi2B,EAAkBiB,GAAO,CAClC,GAAKjL,IAAW2K,EAAeM,KAASL,EAAeK,IAIhD,IAzIX,SAA+BpkB,EAAGC,GAChC,OAAID,EAAE7Q,aAAe8Q,EAAE9Q,YAIwG,IAAxH+0B,EAAQ,IAAIa,WAAW/kB,EAAErH,OAAQqH,EAAEglB,WAAYhlB,EAAE7Q,YAAa,IAAI41B,WAAW9kB,EAAEtH,OAAQsH,EAAE+kB,WAAY/kB,EAAE9Q,aAoIhG81B,CAAsBb,EAAMC,GACtC,OAAO,OAJP,IApJN,SAA+BrkB,EAAGC,GAChC,GAAID,EAAE7Q,aAAe8Q,EAAE9Q,WACrB,OAAO,EAGT,IAAK,IAAIV,EAAS,EAAGA,EAASuR,EAAE7Q,WAAYV,IAC1C,GAAIuR,EAAEvR,KAAYwR,EAAExR,GAClB,OAAO,EAIX,OAAO,EAyIEy2B,CAAsBd,EAAMC,GAC/B,OAAO,EASX,IAAIc,EAAQlB,EAAyBG,GAEjCgB,EAASnB,EAAyBI,GAEtC,OAAIc,EAAMz2B,SAAW02B,EAAO12B,QAIrBk2B,EAASR,EAAMC,EAAMlL,EAAQmL,EA/KtB,EA+K0Ca,GACnD,GAAI7B,EAAMc,GACf,SAAKd,EAAMe,IAASD,EAAKp4B,OAASq4B,EAAKr4B,OAIhC44B,EAASR,EAAMC,EAAMlL,EAAQmL,EAnL3B,GAoLJ,GAAIjB,EAAMe,GACf,SAAKf,EAAMgB,IAASD,EAAKp4B,OAASq4B,EAAKr4B,OAIhC44B,EAASR,EAAMC,EAAMlL,EAAQmL,EAxL3B,GAyLJ,GAAIpB,EAAiBkB,IAC1B,GA9JgCI,EA8JAH,GA9JNE,EA8JAH,GA7JhBj1B,aAAeq1B,EAAKr1B,YAAsE,IAAxD+0B,EAAQ,IAAIa,WAAWR,GAAO,IAAIQ,WAAWP,IA8JvF,OAAO,OAEJ,GAAIhB,EAAiBY,KA7J9B,SAA+BA,EAAMC,GACnC,OAAIZ,EAAeW,GACVX,EAAeY,IAASzO,EAASrpB,OAAOc,UAAUg4B,QAAQ13B,KAAKy2B,GAAO73B,OAAOc,UAAUg4B,QAAQ13B,KAAK02B,IAGzGX,EAAeU,GACVV,EAAeW,IAASprB,OAAO5L,UAAUg4B,QAAQ13B,KAAKy2B,KAAUnrB,OAAO5L,UAAUg4B,QAAQ13B,KAAK02B,GAGnGV,EAAgBS,GACXT,EAAgBU,IAASiB,QAAQj4B,UAAUg4B,QAAQ13B,KAAKy2B,KAAUkB,QAAQj4B,UAAUg4B,QAAQ13B,KAAK02B,GAGtGT,EAAeQ,GACVR,EAAeS,IAASkB,OAAOl4B,UAAUg4B,QAAQ13B,KAAKy2B,KAAUmB,OAAOl4B,UAAUg4B,QAAQ13B,KAAK02B,GAGhGR,EAAeQ,IAAS1P,OAAOtnB,UAAUg4B,QAAQ13B,KAAKy2B,KAAUzP,OAAOtnB,UAAUg4B,QAAQ13B,KAAK02B,GA4I/DmB,CAAsBpB,EAAMC,GAChE,OAAO,EAGT,OAAOO,EAASR,EAAMC,EAAMlL,EAAQmL,EApMpB,GAuMlB,SAASmB,EAAe1yB,EAAKF,GAC3B,OAAOA,EAAKN,QAAO,SAAU6N,GAC3B,OAAO4iB,EAAqBjwB,EAAKqN,MAIrC,SAASwkB,EAASR,EAAMC,EAAMlL,EAAQmL,EAAOoB,EAAeC,GAQ1D,GAAyB,IAArBtzB,UAAU3D,OAAc,CAC1Bi3B,EAAQ/yB,OAAOC,KAAKuxB,GACpB,IAAIwB,EAAQhzB,OAAOC,KAAKwxB,GAExB,GAAIsB,EAAMj3B,SAAWk3B,EAAMl3B,OACzB,OAAO,EAOX,IAFA,IAAI+J,EAAI,EAEDA,EAAIktB,EAAMj3B,OAAQ+J,IACvB,IAAK3K,EAAeu2B,EAAMsB,EAAMltB,IAC9B,OAAO,EAIX,GAAI0gB,GAA+B,IAArB9mB,UAAU3D,OAAc,CACpC,IAAIm3B,EAAclD,EAA4ByB,GAE9C,GAA2B,IAAvByB,EAAYn3B,OAAc,CAC5B,IAAIowB,EAAQ,EAEZ,IAAKrmB,EAAI,EAAGA,EAAIotB,EAAYn3B,OAAQ+J,IAAK,CACvC,IAAIhH,EAAMo0B,EAAYptB,GAEtB,GAAIuqB,EAAqBoB,EAAM3yB,GAAM,CACnC,IAAKuxB,EAAqBqB,EAAM5yB,GAC9B,OAAO,EAGTk0B,EAAMxzB,KAAKV,GACXqtB,SACK,GAAIkE,EAAqBqB,EAAM5yB,GACpC,OAAO,EAIX,IAAIq0B,EAAcnD,EAA4B0B,GAE9C,GAAIwB,EAAYn3B,SAAWo3B,EAAYp3B,QAAU+2B,EAAepB,EAAMyB,GAAap3B,SAAWowB,EAC5F,OAAO,MAEJ,CACL,IAAIiH,EAAepD,EAA4B0B,GAE/C,GAA4B,IAAxB0B,EAAar3B,QAA8D,IAA9C+2B,EAAepB,EAAM0B,GAAcr3B,OAClE,OAAO,GAKb,GAAqB,IAAjBi3B,EAAMj3B,SA1QM,IA0QWg3B,GAzQd,IAyQ+CA,GAA8C,IAAhBtB,EAAK11B,QAA8B,IAAd01B,EAAKp4B,MAClH,OAAO,EAIT,QAAcwJ,IAAV8uB,EACFA,EAAQ,CACNF,KAAM,IAAIx4B,IACVy4B,KAAM,IAAIz4B,IACVo6B,SAAU,OAEP,CAIL,IAAIC,EAAY3B,EAAMF,KAAK53B,IAAI43B,GAE/B,QAAkB5uB,IAAdywB,EAAyB,CAC3B,IAAIC,EAAY5B,EAAMD,KAAK73B,IAAI63B,GAE/B,QAAkB7uB,IAAd0wB,EACF,OAAOD,IAAcC,EAIzB5B,EAAM0B,WAGR1B,EAAMF,KAAK93B,IAAI83B,EAAME,EAAM0B,UAC3B1B,EAAMD,KAAK/3B,IAAI+3B,EAAMC,EAAM0B,UAC3B,IAAIG,EAAQC,EAAShC,EAAMC,EAAMlL,EAAQwM,EAAOrB,EAAOoB,GAGvD,OAFApB,EAAMF,KAAKiC,OAAOjC,GAClBE,EAAMD,KAAKgC,OAAOhC,GACX8B,EAGT,SAASG,EAAmBh6B,EAAK83B,EAAMjL,EAAQoN,GAI7C,IAFA,IAAIC,EAAYhE,EAAal2B,GAEpBmM,EAAI,EAAGA,EAAI+tB,EAAU93B,OAAQ+J,IAAK,CACzC,IAAI4rB,EAAOmC,EAAU/tB,GAErB,GAAI0rB,EAAeC,EAAMC,EAAMlL,EAAQoN,GAGrC,OADAj6B,EAAI+5B,OAAOhC,IACJ,EAIX,OAAO,EAOT,SAASoC,EAA4BC,GACnC,OAAQhS,EAAQgS,IACd,IAAK,YACH,OAAO,KAET,IAAK,SAEH,OAEF,IAAK,SACH,OAAO,EAET,IAAK,SACHA,GAAQA,EAKV,IAAK,SACH,GAAI9D,EAAY8D,GACd,OAAO,EAKb,OAAO,EAGT,SAASC,EAAsB3mB,EAAGC,EAAGymB,GACnC,IAAIE,EAAWH,EAA4BC,GAC3C,OAAgB,MAAZE,EAAyBA,EACtB3mB,EAAE/T,IAAI06B,KAAc5mB,EAAE9T,IAAI06B,GAGnC,SAASC,EAAsB7mB,EAAGC,EAAGymB,EAAMz3B,EAAMs3B,GAC/C,IAAIK,EAAWH,EAA4BC,GAE3C,GAAgB,MAAZE,EACF,OAAOA,EAGT,IAAIE,EAAO7mB,EAAEzT,IAAIo6B,GAEjB,aAAapxB,IAATsxB,IAAuB7mB,EAAE/T,IAAI06B,KAAczC,EAAel1B,EAAM63B,GAAM,EAAOP,MAIzEvmB,EAAE9T,IAAI06B,IAAazC,EAAel1B,EAAM63B,GAAM,EAAOP,GA2D/D,SAASQ,EAAiBz6B,EAAK0C,EAAKg4B,EAAMC,EAAO9N,EAAQoN,GAMvD,IAFA,IAAIC,EAAYhE,EAAal2B,GAEpBmM,EAAI,EAAGA,EAAI+tB,EAAU93B,OAAQ+J,IAAK,CACzC,IAAIyuB,EAAOV,EAAU/tB,GAErB,GAAI0rB,EAAe6C,EAAME,EAAM/N,EAAQoN,IAASpC,EAAe8C,EAAOj4B,EAAIxC,IAAI06B,GAAO/N,EAAQoN,GAE3F,OADAj6B,EAAI+5B,OAAOa,IACJ,EAIX,OAAO,EA2DT,SAASd,EAASpmB,EAAGC,EAAGkZ,EAAQtmB,EAAMyxB,EAAOoB,GAG3C,IAAIjtB,EAAI,EAER,GA1fW,IA0fPitB,GACF,IAxIJ,SAAkB1lB,EAAGC,EAAGkZ,EAAQoN,GAM9B,IAHA,IAAIj6B,EAAM,KACN66B,EAAU3E,EAAaxiB,GAElBvH,EAAI,EAAGA,EAAI0uB,EAAQz4B,OAAQ+J,IAAK,CACvC,IAAI1F,EAAMo0B,EAAQ1uB,GAIlB,GAAqB,WAAjBic,EAAQ3hB,IAA6B,OAARA,EACnB,OAARzG,IACFA,EAAM,IAAI86B,KAOZ96B,EAAIwX,IAAI/Q,QACH,IAAKkN,EAAE/T,IAAI6G,GAAM,CACtB,GAAIomB,EAAQ,OAAO,EAEnB,IAAKwN,EAAsB3mB,EAAGC,EAAGlN,GAC/B,OAAO,EAGG,OAARzG,IACFA,EAAM,IAAI86B,KAGZ96B,EAAIwX,IAAI/Q,IAIZ,GAAY,OAARzG,EAAc,CAGhB,IAFA,IAAI+6B,EAAU7E,EAAaviB,GAElBiiB,EAAK,EAAGA,EAAKmF,EAAQ34B,OAAQwzB,IAAM,CAC1C,IAAIoF,EAAOD,EAAQnF,GAGnB,GAAsB,WAAlBxN,EAAQ4S,IAA+B,OAATA,GAChC,IAAKhB,EAAmBh6B,EAAKg7B,EAAMnO,EAAQoN,GAAO,OAAO,OACpD,IAAKpN,IAAWnZ,EAAE9T,IAAIo7B,KAAUhB,EAAmBh6B,EAAKg7B,EAAMnO,EAAQoN,GAC3E,OAAO,EAIX,OAAoB,IAAbj6B,EAAIN,KAGb,OAAO,EAmFAu7B,CAASvnB,EAAGC,EAAGkZ,EAAQmL,GAC1B,OAAO,OAEJ,GA7fI,IA6fAoB,GACT,IAlEJ,SAAkB1lB,EAAGC,EAAGkZ,EAAQoN,GAI9B,IAHA,IAAIj6B,EAAM,KACNk7B,EAAW9E,EAAa1iB,GAEnBvH,EAAI,EAAGA,EAAI+uB,EAAS94B,OAAQ+J,IAAK,CACxC,IAAIgvB,EAAc/F,EAAe8F,EAAS/uB,GAAI,GAC1ChH,EAAMg2B,EAAY,GAClBR,EAAQQ,EAAY,GAExB,GAAqB,WAAjB/S,EAAQjjB,IAA6B,OAARA,EACnB,OAARnF,IACFA,EAAM,IAAI86B,KAGZ96B,EAAIwX,IAAIrS,OACH,CAGL,IAAIi2B,EAAQznB,EAAEzT,IAAIiF,GAElB,QAAc+D,IAAVkyB,IAAwBznB,EAAE/T,IAAIuF,KAAS0yB,EAAe8C,EAAOS,EAAOvO,EAAQoN,GAAO,CACrF,GAAIpN,EAAQ,OAAO,EAGnB,IAAK0N,EAAsB7mB,EAAGC,EAAGxO,EAAKw1B,EAAOV,GAAO,OAAO,EAE/C,OAARj6B,IACFA,EAAM,IAAI86B,KAGZ96B,EAAIwX,IAAIrS,KAKd,GAAY,OAARnF,EAAc,CAGhB,IAFA,IAAIq7B,EAAWjF,EAAaziB,GAEnB2nB,EAAM,EAAGA,EAAMD,EAASj5B,OAAQk5B,IAAO,CAC9C,IAAIC,EAAenG,EAAeiG,EAASC,GAAM,GAE7C34B,GADAwC,EAAMo2B,EAAa,GACZA,EAAa,IAExB,GAAqB,WAAjBnT,EAAQjjB,IAA6B,OAARA,GAC/B,IAAKs1B,EAAiBz6B,EAAK0T,EAAGvO,EAAKxC,EAAMkqB,EAAQoN,GAAO,OAAO,OAC1D,KAAKpN,GAAYnZ,EAAE9T,IAAIuF,IAAS0yB,EAAenkB,EAAExT,IAAIiF,GAAMxC,GAAM,EAAOs3B,IAAWQ,EAAiBz6B,EAAK0T,EAAGvO,EAAKxC,GAAM,EAAOs3B,IACnI,OAAO,EAIX,OAAoB,IAAbj6B,EAAIN,KAGb,OAAO,EAaA87B,CAAS9nB,EAAGC,EAAGkZ,EAAQmL,GAC1B,OAAO,OAEJ,GAngBM,IAmgBFoB,EACT,KAAOjtB,EAAIuH,EAAEtR,OAAQ+J,IAAK,CACxB,IAAI3K,EAAekS,EAAGvH,GAIf,IAAI3K,EAAemS,EAAGxH,GAC3B,OAAO,EAKP,IAFA,IAAIsvB,EAAQn1B,OAAOC,KAAKmN,GAEjBvH,EAAIsvB,EAAMr5B,OAAQ+J,IAAK,CAC5B,IAAIhH,EAAMs2B,EAAMtvB,GAEhB,IAAK3K,EAAemS,EAAGxO,KAAS0yB,EAAenkB,EAAEvO,GAAMwO,EAAExO,GAAM0nB,EAAQmL,GACrE,OAAO,EAIX,OAAIyD,EAAMr5B,SAAWkE,OAAOC,KAAKoN,GAAGvR,OAjBpC,IAAKZ,EAAemS,EAAGxH,KAAO0rB,EAAenkB,EAAEvH,GAAIwH,EAAExH,GAAI0gB,EAAQmL,GAC/D,OAAO,EA2Bf,IAAK7rB,EAAI,EAAGA,EAAI5F,EAAKnE,OAAQ+J,IAAK,CAChC,IAAIoe,EAAOhkB,EAAK4F,GAEhB,IAAK0rB,EAAenkB,EAAE6W,GAAO5W,EAAE4W,GAAOsC,EAAQmL,GAC5C,OAAO,EAIX,OAAO,EAWTz4B,EAAOC,QAAU,CACf+oB,YATF,SAAqBuP,EAAMC,GACzB,OAAOF,EAAeC,EAAMC,GAhjBjB,IAyjBXvP,kBANF,SAA2BsP,EAAMC,GAC/B,OAAOF,EAAeC,EAAMC,GArjBhB,gCClHdv4B,EAAQqD,WAuCR,SAAqB64B,GACnB,IAAIC,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAC3B,OAAuC,GAA9BE,EAAWC,GAAuB,EAAKA,GA1ClDt8B,EAAQu8B,YAiDR,SAAsBL,GACpB,IAAIluB,EAcArB,EAbAwvB,EAAOC,EAAQF,GACfG,EAAWF,EAAK,GAChBG,EAAkBH,EAAK,GAEvBtG,EAAM,IAAI2G,EAVhB,SAAsBN,EAAKG,EAAUC,GACnC,OAAuC,GAA9BD,EAAWC,GAAuB,EAAKA,EAS9BG,CAAYP,EAAKG,EAAUC,IAEzCI,EAAU,EAGVhwB,EAAM4vB,EAAkB,EACxBD,EAAW,EACXA,EAGJ,IAAK1vB,EAAI,EAAGA,EAAID,EAAKC,GAAK,EACxBqB,EACG2uB,EAAUT,EAAIvsB,WAAWhD,KAAO,GAChCgwB,EAAUT,EAAIvsB,WAAWhD,EAAI,KAAO,GACpCgwB,EAAUT,EAAIvsB,WAAWhD,EAAI,KAAO,EACrCgwB,EAAUT,EAAIvsB,WAAWhD,EAAI,IAC/BkpB,EAAI6G,KAAc1uB,GAAO,GAAM,IAC/B6nB,EAAI6G,KAAc1uB,GAAO,EAAK,IAC9B6nB,EAAI6G,KAAmB,IAAN1uB,EAmBnB,OAhBwB,IAApBsuB,IACFtuB,EACG2uB,EAAUT,EAAIvsB,WAAWhD,KAAO,EAChCgwB,EAAUT,EAAIvsB,WAAWhD,EAAI,KAAO,EACvCkpB,EAAI6G,KAAmB,IAAN1uB,GAGK,IAApBsuB,IACFtuB,EACG2uB,EAAUT,EAAIvsB,WAAWhD,KAAO,GAChCgwB,EAAUT,EAAIvsB,WAAWhD,EAAI,KAAO,EACpCgwB,EAAUT,EAAIvsB,WAAWhD,EAAI,KAAO,EACvCkpB,EAAI6G,KAAc1uB,GAAO,EAAK,IAC9B6nB,EAAI6G,KAAmB,IAAN1uB,GAGZ6nB,GA3FT71B,EAAQ48B,cAkHR,SAAwBC,GAQtB,IAPA,IAAI7uB,EACAtB,EAAMmwB,EAAMj6B,OACZk6B,EAAapwB,EAAM,EACnBqwB,EAAQ,GACRC,EAAiB,MAGZrwB,EAAI,EAAGswB,EAAOvwB,EAAMowB,EAAYnwB,EAAIswB,EAAMtwB,GAAKqwB,EACtDD,EAAM12B,KAAK62B,EAAYL,EAAOlwB,EAAIA,EAAIqwB,EAAkBC,EAAOA,EAAQtwB,EAAIqwB,IAqB7E,OAjBmB,IAAfF,GACF9uB,EAAM6uB,EAAMnwB,EAAM,GAClBqwB,EAAM12B,KACJ82B,EAAOnvB,GAAO,GACdmvB,EAAQnvB,GAAO,EAAK,IACpB,OAEsB,IAAf8uB,IACT9uB,GAAO6uB,EAAMnwB,EAAM,IAAM,GAAKmwB,EAAMnwB,EAAM,GAC1CqwB,EAAM12B,KACJ82B,EAAOnvB,GAAO,IACdmvB,EAAQnvB,GAAO,EAAK,IACpBmvB,EAAQnvB,GAAO,EAAK,IACpB,MAIG+uB,EAAM54B,KAAK,KAzIpB,IALA,IAAIg5B,EAAS,GACTR,EAAY,GACZH,EAA4B,oBAAfvD,WAA6BA,WAAaj2B,MAEvDixB,EAAO,mEACFtnB,EAAI,EAAGD,EAAMunB,EAAKrxB,OAAQ+J,EAAID,IAAOC,EAC5CwwB,EAAOxwB,GAAKsnB,EAAKtnB,GACjBgwB,EAAU1I,EAAKtkB,WAAWhD,IAAMA,EAQlC,SAASyvB,EAASF,GAChB,IAAIxvB,EAAMwvB,EAAIt5B,OAEd,GAAI8J,EAAM,EAAI,EACZ,MAAM,IAAInM,MAAM,kDAKlB,IAAI87B,EAAWH,EAAIxN,QAAQ,KAO3B,OANkB,IAAd2N,IAAiBA,EAAW3vB,GAMzB,CAAC2vB,EAJcA,IAAa3vB,EAC/B,EACA,EAAK2vB,EAAW,GAsEtB,SAASa,EAAaL,EAAO10B,EAAO6G,GAGlC,IAFA,IAAIhB,EARoB9G,EASpB4gB,EAAS,GACJnb,EAAIxE,EAAOwE,EAAIqC,EAAKrC,GAAK,EAChCqB,GACI6uB,EAAMlwB,IAAM,GAAM,WAClBkwB,EAAMlwB,EAAI,IAAM,EAAK,QACP,IAAfkwB,EAAMlwB,EAAI,IACbmb,EAAOzhB,KAdF82B,GADiBj2B,EAeM8G,IAdT,GAAK,IACxBmvB,EAAOj2B,GAAO,GAAK,IACnBi2B,EAAOj2B,GAAO,EAAI,IAClBi2B,EAAa,GAANj2B,IAaT,OAAO4gB,EAAO3jB,KAAK,IAjGrBw4B,EAAU,IAAIhtB,WAAW,IAAM,GAC/BgtB,EAAU,IAAIhtB,WAAW,IAAM,wCCJ/B,SAASytB,EAAkBvwB,EAAQ1E,EAAO6G,GACxC,IAAIquB,EAAM,EACN5sB,EAAO,EAEX,IAAK,IAAI9D,EAAIxE,EAAOwE,EAAIqC,EAAKrC,IAAK,CAChC,MAAMzF,EAAM2F,EAAOF,GAEnB,GAAIzF,EAAM,IAAMA,GAAO,GACrBm2B,EAAY,GAANA,GAAYn2B,EAAM,SAI1B,GAAIyF,IAAMxE,GAAiB,KAARjB,EAAnB,CAIA,GAAIyF,IAAMxE,GAAiB,KAARjB,EAAnB,CAKA,GAAY,KAARA,EAEF,MAGF,MAAM,IAAI3G,MAAM,wBAA0BoM,EAAI,OAASzF,GATrDuJ,GAAQ,GAYZ,OAAO4sB,EAAM5sB,EAYf,SAASxO,EAAQC,EAAMiG,EAAO6G,EAAKsuB,GACjC,OAAY,MAARp7B,GAAgC,IAAhBA,EAAKU,OAChB,MAGY,iBAAVuF,GAAkC,MAAZm1B,IAC/BA,EAAWn1B,EACXA,OAAQuB,GAGS,iBAARsF,GAAgC,MAAZsuB,IAC7BA,EAAWtuB,EACXA,OAAMtF,GAGRzH,EAAOi4B,SAAW,EAClBj4B,EAAOq7B,SAAWA,GAAY,KAE9Br7B,EAAOC,KAASM,EAAOE,SAASR,GAE5BA,EAAKgC,MAAMiE,EAAO6G,GADlBxM,EAAO2M,KAAKjN,GAGhBD,EAAO+B,MAAQ/B,EAAOC,KAAKU,OAEpBX,EAAO+lB,QAGhB/lB,EAAO+B,MAAQ,EACf/B,EAAOi4B,SAAW,EAClBj4B,EAAOC,KAAO,KACdD,EAAOq7B,SAAW,KAElBr7B,EAAO+lB,KAAO,WACZ,OAAQ/lB,EAAOC,KAAKD,EAAOi4B,WACzB,KAxFqB,IAyFnB,OAAOj4B,EAAOs7B,aAChB,KAzFe,IA0Fb,OAAOt7B,EAAOu7B,OAChB,KA9FkB,IA+FhB,OAAOv7B,EAAOw7B,UAChB,QACE,OAAOx7B,EAAO4K,WAIpB5K,EAAOy7B,KAAO,SAAUC,GACtB,IAAIhxB,EAAI1K,EAAOi4B,SACf,MAAMpoB,EAAI7P,EAAOC,KAAKU,OAChBg7B,EAAI37B,EAAOC,KAEjB,KAAOyK,EAAImF,GAAG,CACZ,GAAI8rB,EAAEjxB,KAAOgxB,EAAK,OAAOhxB,EACzBA,IAGF,MAAM,IAAIpM,MACR,oCACA4M,OAAOC,aAAauwB,GAAO,QAC3BA,EAAIpwB,SAAS,IAAM,MAIvBtL,EAAOs7B,WAAa,WAClBt7B,EAAOi4B,WAEP,MAAM2D,EAAO,GAEb,KAvHkB,MAuHX57B,EAAOC,KAAKD,EAAOi4B,WACxB2D,EAAK57B,EAAO4K,UAAY5K,EAAO+lB,OAKjC,OAFA/lB,EAAOi4B,WAEA2D,GAGT57B,EAAOu7B,KAAO,WACZv7B,EAAOi4B,WAEP,MAAM4D,EAAM,GAEZ,KArIkB,MAqIX77B,EAAOC,KAAKD,EAAOi4B,WACxB4D,EAAIz3B,KAAKpE,EAAO+lB,QAKlB,OAFA/lB,EAAOi4B,WAEA4D,GAGT77B,EAAOw7B,QAAU,WACf,MAAMzuB,EAAM/M,EAAOy7B,KA/ID,KAgJZtsB,EAASgsB,EAAiBn7B,EAAOC,KAAMD,EAAOi4B,SAAW,EAAGlrB,GAIlE,OAFA/M,EAAOi4B,UAAYlrB,EAAM,EAAI/M,EAAOi4B,SAE7B9oB,GAGTnP,EAAO4K,OAAS,WACd,IAAIkxB,EAAM97B,EAAOy7B,KA3JE,IA4JnB,MAAM96B,EAASw6B,EAAiBn7B,EAAOC,KAAMD,EAAOi4B,SAAU6D,GACxD/uB,IAAQ+uB,EAAMn7B,EAIpB,OAFAX,EAAOi4B,SAAWlrB,EAEX/M,EAAOq7B,SACVr7B,EAAOC,KAAKqL,SAAStL,EAAOq7B,SAAUS,EAAK/uB,GAC3C/M,EAAOC,KAAKgC,MAAM65B,EAAK/uB,IAG7BjP,EAAOC,QAAUiC,iDCvKjB,MAAM,QAAE+7B,GAAY,EAAQ,MAQ5B,SAAS37B,EAAQH,EAAM2K,EAAQlK,GAC7B,MAAMs7B,EAAU,GAChB,IAAIz2B,EAAS,KAMb,OAJAnF,EAAOmH,QAAQy0B,EAAS/7B,GACxBsF,EAAShF,EAAOqC,OAAOo5B,GACvB57B,EAAO2B,MAAQwD,EAAO5E,OAElBJ,EAAOE,SAASmK,IAClBrF,EAAOhD,KAAKqI,EAAQlK,GACbkK,GAGFrF,EAGTnF,EAAO2B,OAAS,EAChB3B,EAAO67B,0BAA2B,EAElC77B,EAAOmH,QAAU,SAAUy0B,EAAS/7B,GAClC,GAAY,MAARA,EAEJ,OAAQ87B,EAAQ97B,IACd,IAAK,SAAUG,EAAOwK,OAAOoxB,EAAS/7B,GAAO,MAC7C,IAAK,SAAUG,EAAOw7B,KAAKI,EAAS/7B,GAAO,MAC3C,IAAK,MAAOG,EAAO87B,QAAQF,EAAS/7B,GAAO,MAC3C,IAAK,QAASG,EAAOm7B,KAAKS,EAAS/7B,GAAO,MAC1C,IAAK,MAAOG,EAAO+7B,QAAQH,EAAS/7B,GAAO,MAC3C,IAAK,SAAUG,EAAOwP,OAAOosB,EAAS/7B,GAAO,MAC7C,IAAK,SACL,IAAK,UAAWG,EAAO+O,OAAO6sB,EAAS/7B,GAAO,MAC9C,IAAK,kBAAmBG,EAAOwK,OAAOoxB,EAASz7B,EAAO2M,KAAKjN,EAAK2K,OAAQ3K,EAAKg3B,WAAYh3B,EAAKmB,aAAc,MAC5G,IAAK,cAAehB,EAAOwK,OAAOoxB,EAASz7B,EAAO2M,KAAKjN,MAI3D,MAAMm8B,EAAQ77B,EAAO2M,KAAK,KACpBmvB,EAAQ97B,EAAO2M,KAAK,KACpBovB,EAAQ/7B,EAAO2M,KAAK,KAE1B9M,EAAOwK,OAAS,SAAUoxB,EAAS/7B,GACjC+7B,EAAQ53B,KAAK7D,EAAO2M,KAAKjN,EAAKU,OAAS,KAAMV,IAG/CG,EAAOwP,OAAS,SAAUosB,EAAS/7B,GACjC+7B,EAAQ53B,KAAK7D,EAAO2M,KAAK3M,EAAOa,WAAWnB,GAAQ,IAAMA,KAG3DG,EAAO+O,OAAS,SAAU6sB,EAAS/7B,GACjC,MAAMs8B,EAAQ,WAGRv3B,GAFM/E,EAAOs8B,GAAU,GAEZA,GADLt8B,EAAOs8B,GAAU,GAG7BP,EAAQ53B,KAAK7D,EAAO2M,KAAK,IAAMlI,EAAM,MAEjCA,IAAQ/E,GAASG,EAAO67B,2BAC1B77B,EAAO67B,0BAA2B,EAClC7S,EAAQH,KACN,0DAA4DhpB,EAAO,KACnE,wEAA0E+E,EAAM,KAElFokB,EAAQoT,UAIZp8B,EAAOw7B,KAAO,SAAUI,EAAS/7B,GAC/B+7B,EAAQ53B,KAAKi4B,GAEb,IACIhqB,EADA1H,EAAI,EAGR,MAAM7F,EAAOD,OAAOC,KAAK7E,GAAMw8B,OACzBC,EAAK53B,EAAKnE,OAEhB,KAAOgK,EAAI+xB,EAAI/xB,IACb0H,EAAIvN,EAAK6F,GACM,MAAX1K,EAAKoS,KACTjS,EAAOwP,OAAOosB,EAAS3pB,GACvBjS,EAAOmH,QAAQy0B,EAAS/7B,EAAKoS,KAG/B2pB,EAAQ53B,KAAKg4B,IAGfh8B,EAAO87B,QAAU,SAAUF,EAAS/7B,GAClC+7B,EAAQ53B,KAAKi4B,GAEb,MAAMv3B,EAAO/D,MAAMmM,KAAKjN,EAAK6E,QAAQ23B,OAErC,IAAK,MAAM/4B,KAAOoB,EACK,MAAjB7E,EAAKxB,IAAIiF,KACbnD,EAAOE,SAASiD,GACZtD,EAAOmH,QAAQy0B,EAASt4B,GACxBtD,EAAOwP,OAAOosB,EAAS9wB,OAAOxH,IAClCtD,EAAOmH,QAAQy0B,EAAS/7B,EAAKxB,IAAIiF,KAGnCs4B,EAAQ53B,KAAKg4B,IAGfh8B,EAAOm7B,KAAO,SAAUS,EAAS/7B,GAC/B,IAAIyK,EAAI,EACR,MAAMmF,EAAI5P,EAAKU,OAGf,IAFAq7B,EAAQ53B,KAAKk4B,GAEN5xB,EAAImF,EAAGnF,IACG,MAAXzK,EAAKyK,IACTtK,EAAOmH,QAAQy0B,EAAS/7B,EAAKyK,IAG/BsxB,EAAQ53B,KAAKg4B,IAGfh8B,EAAO+7B,QAAU,SAAUH,EAAS/7B,GAClC+7B,EAAQ53B,KAAKk4B,GAEb,IAAK,MAAMp7B,KAAQjB,EACL,MAARiB,GACJd,EAAOmH,QAAQy0B,EAAS96B,GAG1B86B,EAAQ53B,KAAKg4B,IAGft+B,EAAOC,QAAUqC,uCCrIjB,MAAM,WAAEu8B,EAAU,QAAEZ,GAAY,EAAQ,MAoExCj+B,EAAOC,QArBP,SAAS6+B,EAAgB97B,GAGvB,GAAa,MAATA,EAAe,OAFJ,EAIf,MAAMuG,EAAO00B,EAAQj7B,GAErB,OAAQuG,GACN,IAAK,SAAU,OAAOs1B,EAAW77B,EAAMH,QAAU,EAAIG,EAAMH,OAC3D,IAAK,kBAAmB,OAd5B,SAA4BG,GAC1B,MAAMH,EAASG,EAAMM,WAAaN,EAAMm2B,WACxC,OAAO0F,EAAWh8B,GAAU,EAAIA,EAYCk8B,CAAkB/7B,GACjD,IAAK,SAAU,OApBnB,SAAuBA,GACrB,MAAMH,EAASJ,EAAOa,WAAWN,GACjC,OAAO67B,EAAWh8B,GAAU,EAAIA,EAkBRm8B,CAAah8B,GACnC,IAAK,QAAS,IAAK,MAAO,OAxD9B,SAAqBy6B,GACnB,IAAI56B,EAAS,EAEb,IAAK,MAAMG,KAASy6B,EAClB56B,GAAUi8B,EAAe97B,GAG3B,OAAOH,EAiD4Bo8B,CAAWj8B,GAC5C,IAAK,SAAU,OAAO,EAAI67B,EAAWxsB,KAAK6gB,MAAMlwB,IAAU,EAC1D,IAAK,SAAU,OAAO,EAAIA,EAAMwK,WAAW3K,OAAS,EACpD,IAAK,SAAU,OArCnB,SAAuBG,GACrB,IAAIH,EAAS,EACb,MAAMmE,EAAOD,OAAOC,KAAKhE,GAEzB,IAAK,IAAI4J,EAAI,EAAGA,EAAI5F,EAAKnE,OAAQ+J,IAAK,CACpC,MAAMsyB,EAAYz8B,EAAOa,WAAW0D,EAAK4F,IACzC/J,GAAUg8B,EAAWK,GAAa,EAAIA,EACtCr8B,GAAUi8B,EAAe97B,EAAMgE,EAAK4F,KAGtC,OAAO/J,EA2BiBs8B,CAAan8B,GACnC,IAAK,MAAO,OAlDhB,SAAoBG,GAClB,IAAIN,EAAS,EAEb,IAAK,MAAO+C,EAAK5C,KAAUG,EAAK,CAC9B,MAAM+7B,EAAYz8B,EAAOa,WAAWsC,GACpC/C,GAAUg8B,EAAWK,GAAa,EAAIA,EACtCr8B,GAAUi8B,EAAe97B,GAG3B,OAAOH,EAyCcu8B,CAAUp8B,GAC7B,QACE,MAAM,IAAIopB,UAAU,8BAA8B7iB,wBChExD,MAAM81B,EAAUr/B,EAAOC,QAEvBo/B,EAAQ/8B,OAAS,EAAQ,MACzB+8B,EAAQn9B,OAAS,EAAQ,MAQzBm9B,EAAQ/7B,WAAa+7B,EAAQP,eAAiB,EAAQ,2CCXtD,MAAMhK,EAAO90B,EAAOC,QAEpB60B,EAAK+J,WAAa,SAAqB77B,GAErC,MAAM0N,EAAO1N,EAAQ,EAAI,EAAI,EAI7B,OADAA,EAAQqP,KAAKgE,IAAI3V,OAAOsC,GAAS,IAC1BqP,KAAK6gB,MAAM7gB,KAAKitB,MAAMt8B,IAAU,EAAI0N,GAG7CokB,EAAKmJ,QAAU,SAAkBj7B,GAC/B,OAAIP,EAAOE,SAASK,GAAe,SAC/Bu8B,YAAYC,OAAOx8B,GAAe,kBAClCC,MAAMC,QAAQF,GAAe,QAC7BA,aAAiBtC,OAAe,SAChCsC,aAAiBy2B,QAAgB,UACjCz2B,aAAiBu4B,IAAY,MAC7Bv4B,aAAiBjD,IAAY,MAC7BiD,aAAiBoK,OAAe,SAChCpK,aAAiBu8B,YAAoB,qBAC3Bv8B,aCLhB,SAASy8B,EAAYC,GAGnB,OAAOA,EACJC,QAAO,CAAC1c,EAAK0Q,EAAKiM,EAAK9J,KACtB,MAAM5jB,EAAIyhB,EAAI9kB,MAAM,KAAK1L,KAAIwwB,GAAOkM,SAASlM,KAC7C,OAAO1Q,EAAIne,OALO,EAACsD,EAAO6G,EAAM7G,IAAUnF,MAAMmM,KAAK,CAAEvM,OAAQoM,EAAM7G,EAAQ,IAAK,CAACurB,EAAKiM,IAAQA,EAAMx3B,IAKpF03B,IAAiB5tB,MAClC,IAvBPlS,EAAOC,QAAUw/B,EACjBz/B,EAAOC,QAAQ8/B,MAAQN,EACvBz/B,EAAOC,QAAQ+/B,QAEf,SAAuBN,GACrB,OAAOA,EACJC,QAAO,CAAC1c,EAAK0Q,EAAKiM,EAAK9J,KACV,IAAR8J,GAAajM,IAAQmC,EAAI8J,EAAM,GAAK,GAAG3c,EAAI3c,KAAK,IACpD2c,EAAIA,EAAIpgB,OAAS,GAAGyD,KAAKqtB,GAClB1Q,IACN,IACF9f,KAAKwwB,GACGA,EAAI9wB,OAAS,EAAI,GAAG8wB,EAAI,MAAMA,EAAIA,EAAI9wB,OAAS,KAAO,GAAG8wB,EAAI,kBCZ1E3zB,EAAOC,QAAU,SAASggC,EAAUC,EAAQC,EAAYC,EAAKC,GAC3D,IAAIjoB,EAAK3F,EAET,QAAW9I,IAARy2B,EACDA,EAAM,OAIN,IADAA,GAAU,GACD,GAAKA,GAAOH,EAASp9B,OAC5B,MAAM,IAAI+yB,WAAW,uBAGzB,QAAYjsB,IAAT02B,EACDA,EAAOJ,EAASp9B,OAAS,OAIzB,IADAw9B,GAAY,GACFD,GAAOC,GAAQJ,EAASp9B,OAChC,MAAM,IAAI+yB,WAAW,uBAGzB,KAAMwK,GAAOC,GASX,IAHA5tB,GAAO0tB,EAAWF,EADlB7nB,EAAMgoB,GAAQC,EAAOD,IAAS,IACGF,EAAQ9nB,EAAK6nB,IAGrC,EACPG,EAAOhoB,EAAM,MAGV,MAAG3F,EAAM,GAKZ,OAAO2F,EAJPioB,EAAOjoB,EAAM,EAQjB,OAAQgoB,8BCzCV,SAASE,EAAYn5B,GACjB,IAAI9C,EAAM8C,GAAO,EAGjB,OAFIA,EAAM,GAAM,GACZ9C,IACGA,EALX0C,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IAOtD,IAAIu9B,EAA0B,WAO1B,SAASA,EAASp+B,EAAMq+B,QACP,IAATr+B,IAAmBA,EAAO,GAC9B,IAAIs+B,EAAOD,MAAAA,OAAmC,EAASA,EAAKC,KAC5Dl/B,KAAKk/B,KAAQA,GAAQC,SAASD,IAASH,EAAYG,IAAUA,GAAQ,EACrEl/B,KAAKuL,OACe,iBAAT3K,EAAoB,IAAI+2B,WAAWoH,EAAYn+B,IAASA,EAuDvE,OA/CAo+B,EAAS/+B,UAAUb,IAAM,SAAUiM,GAC/B,IAAIC,EAAID,GAAK,EACb,OAAOC,EAAItL,KAAKuL,OAAOjK,WAAatB,KAAKuL,OAAOD,GAAM,KAAOD,EAAI,IAUrE2zB,EAAS/+B,UAAUf,IAAM,SAAUmM,EAAG5J,QACpB,IAAVA,IAAoBA,GAAQ,GAChC,IAAI6J,EAAID,GAAK,EACb,GAAI5J,EAAO,CACP,GAAIzB,KAAKuL,OAAOjK,OAASgK,EAAI,EAAG,CAC5B,IAAI8zB,EAAWtuB,KAAKC,IAAIzF,EAAI,EAAGwF,KAAK/D,IAAI,EAAI/M,KAAKuL,OAAOjK,OAAQtB,KAAKk/B,OACrE,GAAIE,GAAYp/B,KAAKk/B,KAAM,CACvB,IAAIG,EAAY,IAAI1H,WAAWyH,GAC/BC,EAAUngC,IAAIc,KAAKuL,QACnBvL,KAAKuL,OAAS8zB,GAItBr/B,KAAKuL,OAAOD,IAAM,KAAOD,EAAI,OAExBC,EAAItL,KAAKuL,OAAOjK,SAErBtB,KAAKuL,OAAOD,MAAQ,KAAOD,EAAI,KAUvC2zB,EAAS/+B,UAAU+C,QAAU,SAAUimB,EAAIpiB,EAAO6G,QAChC,IAAV7G,IAAoBA,EAAQ,QACpB,IAAR6G,IAAkBA,EAA2B,EAArB1N,KAAKuL,OAAOjK,QACxC,IAAK,IAAI+J,EAAIxE,EAAOyE,EAAID,GAAK,EAAG8Q,EAAI,KAAO9Q,EAAI,EAAGi0B,EAAOt/B,KAAKuL,OAAOD,GAAID,EAAIqC,EAAKrC,IAC9E4d,KAAMqW,EAAOnjB,GAAI9Q,GACjB8Q,EAAU,IAANA,GAAYmjB,EAAOt/B,KAAKuL,SAASD,GAAK,KAAO6Q,GAAK,GAGvD6iB,EAnEkB,GAqE7BtgC,EAAA,QAAkBsgC,uCC5ElB,MAAMO,EAAc,EAAQ,MACtBzB,EAAU,EAAQ,MAClBkB,EAAW,gBACXQ,EAAS,EAAQ,MACjBC,EAAQ,EAAQ,KAAR,CAAiB,uBACzBC,EAAc,EAAQ,MACtBC,EAAO,EAAQ,MACfC,EAAc,EAAQ,MACtBC,EAAS,EAAQ,MACjBC,EAAM,EAAQ,MAMdC,EAAmB7+B,EAAO2M,KAAK,wBAC/BmyB,EAAqB9+B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,IACpDoyB,EAAgB/+B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,EAAM,IACrDqyB,EAAkBh/B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,EAAM,IACvDsyB,EAAqBj/B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,EAAM,IAC1DuyB,EAAuBl/B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,EAAM,IAE5DwyB,EAAmB,CAAC,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,GAC9DC,EAAe,CAAC,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,GAGpDC,EAAmBr/B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,EAAM,KACxD2yB,EAAoBt/B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,EAAM,KAIzD4yB,EAAKv/B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,IAC5D6yB,EAAiBx/B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,IAChD8yB,EAAgBz/B,EAAO2M,KAAK,CAAC,EAAM,EAAM,EAAM,IAErD,SAASoI,EAAKrD,EAAGC,GACf,IAAK,IAAIzH,EAAMwH,EAAEtR,OAAQ8J,KAAQwH,EAAExH,IAAQyH,EAAEzH,GAC7C,OAAOwH,EAGT,MAAMguB,EACJ3+B,YAAa4+B,EAAOx/B,EAAQC,EAAQw/B,GAClC9gC,KAAK6gC,MAAQA,EACb7gC,KAAKqB,OAASA,EACdrB,KAAKsB,OAASA,EACdtB,KAAK8gC,SAAWA,GAIpB,MAAMC,EACJ9+B,cACEjC,KAAKuL,OAAS,IAAIosB,WAGpBv4B,IAAKwK,GACH,OAAO,EAGT1K,IAAK0K,KAGP,MAAMo3B,UAAanB,EAAOoB,OACxBh/B,YAAa+F,EAAO,KAAMk5B,EAAU,EAAGC,GAAY,GACjDC,QAEAphC,KAAKqhC,SAAW3B,EAAY,GAAGzzB,SAAS,OACxCjM,KAAKshC,OAAO,YAEZthC,KAAKuhC,OAAS,KACdvhC,KAAKwhC,aAAe,KACpBxhC,KAAKgI,KAAOA,EAEZhI,KAAKyhC,WAAY,EACjBzhC,KAAK0hC,cAAe,EAEpB1hC,KAAK2hC,aAAc,EACnB3hC,KAAK4hC,gBAAiB,EAKtB5hC,KAAK6hC,WAAa,IAAI7C,EAAS,EAAG,CAAEE,KAtElB,MAwElBl/B,KAAK8hC,WAAa,GAClB9hC,KAAK+hC,eAAiB,GAEtB/hC,KAAKgiC,SAAW,GAChBhiC,KAAKiiC,aAAe,GAEpBjiC,KAAKkiC,gBAAkB,GACvBliC,KAAKmiC,oBAAsB,GAI3BniC,KAAKoiC,kBAAoB,GAEzBpiC,KAAKqiC,sBAAwB,GAG7BriC,KAAKsiC,SAAU,EACftiC,KAAKuiC,eAAiB,GACtBviC,KAAKwiC,mBAAqB,GAE1BxiC,KAAKyiC,KAAO,GACZziC,KAAK0iC,SAAW,EAEhB1iC,KAAK2iC,SAAW,EAChB3iC,KAAK4iC,WAAa,EAClB5iC,KAAK6iC,YAAcjD,IACnB5/B,KAAK8iC,cAAgBlD,IAErB5/B,KAAK+iC,mBAAqB,KAC1B/iC,KAAKgjC,SAAW,KAChBhjC,KAAKijC,WAAa,EAClBjjC,KAAKkjC,kBAAoB,KAEzBljC,KAAKmjC,WAAY,EACjBnjC,KAAKojC,WAAY,EAEjBpjC,KAAKqjC,YAAc,EACnBrjC,KAAKsjC,QAAU,KAEftjC,KAAKujC,QAAU,GACfvjC,KAAKwjC,YAAc,EAEnBxjC,KAAKyjC,WAAatC,EACdA,GACFnhC,KAAK0jC,IAAMlE,EAAOmE,oBAlGP,mMAkGqC,MAjGjC,GAkGf3jC,KAAK4jC,UAAY5jC,KAAK0jC,IAAIG,aAAa,QAEvC7jC,KAAK4jC,UAAY,KAEnB5jC,KAAK8jC,YAAc,KACnB9jC,KAAK+jC,cAAgB,KACrB/jC,KAAKgkC,mBAAqB,GAC1BhkC,KAAKikC,sBAAuB,EAE5BjkC,KAAKkkC,mBAAqB,KAC1BlkC,KAAKmkC,cAAgB,KACrBnkC,KAAKokC,kBAAoB,KACzBpkC,KAAKqkC,kBAAoB,KACzBrkC,KAAKskC,kBAAoB,KACzBtkC,KAAKukC,gBAAiB,EAEtBvkC,KAAKwkC,KAAK,UAAU,IAAMxkC,KAAKykC,cAE/BzkC,KAAK0kC,GAAG,SAAU1kC,KAAKykC,WACvBzkC,KAAKshC,OAAO,QAASthC,KAAKgI,MAER,gBAAdhI,KAAKgI,MAA0BhI,KAAKyjC,WAGtCzjC,KAAK2kC,0BACkB,gBAAd3kC,KAAKgI,MAA0BhI,KAAKyjC,YAA0B,IAAZvC,EAC3DlhC,KAAK4kC,YAEL5kC,KAAK6kC,gBAAgB,MAQzBC,aAAcC,GACZ/kC,KAAKshC,OAAO,kBAAmByD,GAC/BC,cAAchlC,KAAK+iC,qBACJ,IAAXgC,IACJ/kC,KAAK+iC,mBAAqBkC,aAAY,KACpCjlC,KAAKklC,cA7JgB,OAsKzBC,WAAYC,EAAIC,GACdrlC,KAAKshC,OAAO,4BAA6B8D,EAAIC,GAC7CrlC,KAAKijC,WAAamC,EAClBplC,KAAKslC,gBAAkBD,EACvBrlC,KAAKulC,eAAc,GAGrBC,UACE,IAAIxlC,KAAKmjC,UAKT,OAJAnjC,KAAKmjC,WAAY,EACjBnjC,KAAKshC,OAAO,WACZthC,KAAKylC,KAAK,SACVzlC,KAAK0N,MACE1N,KAGT0N,OAAQ7J,GAIN,OAHA7D,KAAKshC,OAAO,OACZthC,KAAK0lC,kBACL1lC,KAAK2lC,WACEvE,MAAM1zB,OAAO7J,GAOtBM,IAAKyhC,GACH,MAAM9lC,EAAO8lC,EAAU3lC,UAAUH,KACjC,IAAKA,EACH,MAAM,IAAIb,MAAM,+DAElBe,KAAKshC,OAAO,wBAAyBxhC,GAErC,MAAM+lC,EAAM7lC,KAAK0iC,SACXoD,EAAU,IAAIF,EAAU5lC,MAE9B,SAAS+lC,KAE0B,mBAAxBD,EAAQE,cACjBF,EAAQE,YAAcD,GAEmB,mBAAhCD,EAAQG,sBACjBH,EAAQG,oBAAsBF,GAEC,mBAAtBD,EAAQI,YACjBJ,EAAQI,UAAYH,GAGtB/lC,KAAKkiC,gBAAgB2D,GAAO/lC,EAC5BE,KAAKyiC,KAAK3iC,GAAQgmC,EAClB9lC,KAAKF,GAAQgmC,EAEb9lC,KAAK0iC,UAAY,EAUnBwC,YACEllC,KAAKshC,OAAO,cACZthC,KAAKmmC,MAAMnG,GAGboG,UACE,GAAIpmC,KAAKyjC,WAAY,CACnB,MAAM4C,EAAUv1B,KAAK6gB,MAAsB,IAAhB7gB,KAAKw1B,UAC1BC,EAAO7G,EAAY2G,GACzBrmC,KAAKmmC,MAAMjlC,EAAOqC,OAAO,CAACrC,EAAO2M,KAAK7N,KAAK4jC,UAAW,OAAQ2C,MAIlEC,UACE,MAAMC,EAAU31B,KAAK6gB,MAAsB,IAAhB7gB,KAAKw1B,UAC1BI,EAAOhH,EAAY+G,GACzBzmC,KAAKmmC,MAAMjlC,EAAOqC,OAAO,CAACrC,EAAO2M,KAAK7N,KAAK4jC,UAAW,OAAQ8C,KAGhEC,QAASC,GACP5mC,KAAK6mC,WAAW7mC,KAAK+jC,cAAe6C,GAEpC,MAAME,EAAc5lC,EAAO2M,KAAK8xB,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUhnC,KAAK+jC,cAAe,QAAS,OAItGkD,EAAkBhxB,EAFJ/U,EAAO2M,KAAK8xB,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUJ,EAAU,QAAS,OAC9E1lC,EAAO2M,KAAK8xB,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUhnC,KAAK+jC,cAAe,QAAS,QAGtGmD,EAAUxH,EAAY,GAAG3zB,aAAa,GAAK,IAC3Co7B,EAAazH,EAAYwH,GAE/B,IAAIE,EAAqBlmC,EAAO6B,MAAM,GAAYmkC,EAAU,GAC5DzG,EAAGv9B,KAAKkkC,GACR1G,EAAex9B,KAAKkkC,EAAoB,GAExCA,EAAmBC,aAAaH,EAAS,IACzCC,EAAWjkC,KAAKkkC,EAAoB,IACpCA,EAAmBC,aAAa,EAAG,GAAKH,GACxCE,EAAqBpnC,KAAKsnC,kBAAkBF,GAE5CpnC,KAAKmmC,MAAMjlC,EAAOqC,OAAO,CAACujC,EAAaG,EAAiBG,KAG1DG,QAASX,GACP5mC,KAAK6mC,WAAW7mC,KAAK+jC,cAAe6C,GAEpC,MAAMY,EAAU9H,EAAY,GAAG3zB,aAAa,GAAK,IAC3C07B,EAAa/H,EAAY8H,GAC/B,IAAIE,EAAoBxmC,EAAO6B,MAAM,GAAYykC,GACjD/G,EAAGv9B,KAAKwkC,GACR/G,EAAcz9B,KAAKwkC,EAAmB,GACtCA,EAAkBL,aAAaG,EAAS,IACxCC,EAAWvkC,KAAKwkC,EAAmB,IACnCA,EAAoB1nC,KAAKsnC,kBAAkBI,GAC3C1nC,KAAKmmC,MAAMuB,GACX1nC,KAAKikC,sBAAuB,EAC5BjkC,KAAKshC,OAAO,8BASdqG,UAAWf,EAAUrF,EAAQO,GAC3B,IAAI8F,EACApG,EAiBJ,GAhBwB,iBAAboF,GACTA,EAAWA,EAASiB,cACpBD,EAAiB1mC,EAAO2M,KAAK+4B,EAAU,SAEvCgB,EAAiBhB,EACjBA,EAAWgB,EAAe37B,SAAS,QAEf,iBAAXs1B,EACTC,EAAetgC,EAAO2M,KAAK0zB,EAAQ,QAEnCC,EAAeD,EACfA,EAASC,EAAav1B,SAAS,QAGjCjM,KAAK8nC,UAAYF,EAEa,KAA1BA,EAAetmC,QAAyC,KAAxBkgC,EAAalgC,OAC/C,MAAM,IAAIrC,MAAM,2CAGlBe,KAAKshC,OAAO,8BAA+BsF,EAAUrF,EAAQO,GAE7D,MAAMiG,EAAW7mC,EAAO2M,KAAKwyB,GAE7BrgC,KAAK8hC,WAAa,CAChBniB,UAAU,EACVqoB,OAAQlG,IAAcA,EAAWkG,KACjCC,QAASnG,IAAcA,EAAWmG,OAGpCF,EAAS,IAAM,GACX/nC,KAAK8hC,WAAWkG,MAAKD,EAAS,IAAM,GACpC/nC,KAAK8hC,WAAWmG,OAAMF,EAAS,IAAM,GAGrC/nC,KAAK8hC,WAAWmG,MAAQjoC,KAAK+hC,eAAekG,OAC9CjoC,KAAKshC,OAAO,6BACZthC,KAAKsiC,SAAU,GAGjBtiC,KAAKmmC,MAAMjlC,EAAOqC,OAAO,CAACw8B,EAAkBgI,EAAUH,EAAgBpG,KACtExhC,KAAKkoC,gBAAiB,EAElBloC,KAAK+hC,eAAepiB,WAAa3f,KAAKmoC,wBAGxCnoC,KAAKooC,yBAUTA,yBAEE,MAAM3+B,EAAMjE,OAAO+iB,OAAO,GAAIvoB,KAAKoiC,mBACnC34B,EAAI1K,EAAI,GACR,IAAK,MAAM8mC,KAAO7lC,KAAKkiC,gBAAiB,CACtC,MAAMpiC,EAAOE,KAAKkiC,gBAAgB2D,GAClCp8B,EAAI1K,EAAEe,GAAQX,OAAO0mC,GAIvB7lC,KAAK2f,SAAS,EAAGme,EAAQ/8B,OAAO0I,IAChCzJ,KAAKmoC,wBAAyB,EAMhCE,QACE,IAAIroC,KAAKyhC,UAKT,GAJAzhC,KAAKyhC,WAAY,EACjBzhC,KAAKshC,OAAO,SACZthC,KAAKmmC,MAAMlG,GAEPjgC,KAAKsiC,QAGP,KAAOtiC,KAAKiiC,aAAa3gC,QAAQ,CAC/B,MAAMgnC,EAAUtoC,KAAKiiC,aAAa,GAC7BjiC,KAAKuiC,eAAegG,SAASD,EAAQzH,QACxC7gC,KAAKwoC,OAAOF,EAAQzH,MAAOyH,EAAQjnC,OAAQinC,EAAQhnC,aAIvD,KAAOtB,KAAKiiC,aAAa3gC,QACvBtB,KAAKiiC,aAAalQ,MAQxB0W,UACOzoC,KAAKyhC,YACVzhC,KAAKyhC,WAAY,EACjBzhC,KAAKshC,OAAO,WACZthC,KAAKmmC,MAAMjG,IAMbwI,aACM1oC,KAAK0hC,eACT1hC,KAAK0hC,cAAe,EACpB1hC,KAAKshC,OAAO,cACZthC,KAAKmmC,MAAMhG,IAMbwI,eACO3oC,KAAK0hC,eACV1hC,KAAK0hC,cAAe,EACpB1hC,KAAKshC,OAAO,gBACZthC,KAAKmmC,MAAM/F,IAObwI,KAAMh/B,GACJ5J,KAAKshC,OAAO,UAAW13B,GACvB5J,KAAK6oC,SAAS,EAAG,CAACj/B,GAAQ,MAO5Bk/B,SAAUA,GACR9oC,KAAKshC,OAAO,YACPpgC,EAAOE,SAAS0nC,KAAWA,EAAWA,EAASv9B,QACpDvL,KAAK6oC,SAAS,EAAG,GAAIC,GAUvBR,QAAS1+B,EAAOvI,EAAQC,EAAQynC,GAE9B,OADKA,IAAIA,EAAK,QACV/oC,KAAKojC,UAAkB2F,EAAG,IAAI9pC,MAAM,oBAEpCe,KAAK2hC,aAAiB3hC,KAAKsiC,SAAWtiC,KAAKwiC,mBAAmB+F,SAAS3+B,IAI3E5J,KAAKshC,OAAO,uCAAwC13B,EAAOvI,EAAQC,GAEnEtB,KAAKgiC,SAASj9B,KAAK,IAAI67B,EAAQh3B,EAAOvI,EAAQC,EAAQynC,IACjD/oC,KAAKgjC,UACRhjC,KAAKulC,eAAc,QAErBvlC,KAAK6oC,SAAS,EAAG,CAACj/B,EAAOvI,EAAQC,GAAS,OATjCynC,EAAG,IAAI9pC,MAAM,oBAkBxB4hC,MAAOj3B,EAAOvI,EAAQkK,GACpBvL,KAAKshC,OAAO,2BAA4B13B,EAAOvI,GAC/CrB,KAAK6oC,SAAS,EAAG,CAACj/B,EAAOvI,GAASkK,GAClCvL,KAAK2iC,UAAYp3B,EAAOjK,OACxBtB,KAAK6iC,YAAYt3B,EAAOjK,QACxBtB,KAAKylC,KAAK,SAAUl6B,EAAOjK,QAS7B0nC,OAAQp/B,EAAOvI,EAAQC,GACrBtB,KAAKshC,OAAO,sCAAuC13B,EAAOvI,EAAQC,GAClEtB,KAAKipC,UACHjpC,KAAKkpC,MAAMlpC,KAAKgiC,SAAUp4B,EAAOvI,EAAQC,GACzC,IAAIrC,MAAM,yBACV,MAEFe,KAAK6oC,SAAS,EAAG,CAACj/B,EAAOvI,EAAQC,GAAS,MAO5C6nC,KAAMA,GACJnpC,KAAKshC,OAAO,UAAW6H,GACvB,MAAMj/B,EAAUhJ,EAAO2M,KAAKyyB,GAC5Bp2B,EAAQkE,cAAc+6B,EAAM,GAC5BnpC,KAAKmmC,MAAMj8B,GAObk/B,QAASx/B,GACP,IAAK5J,KAAKsiC,QAAS,MAAMrjC,MAAM,8BAC/Be,KAAKshC,OAAO,aAAc13B,GAC1B5J,KAAK6oC,SAAS,GAAM,CAACj/B,GAAQ,MAM/By/B,UACE,IAAKrpC,KAAKsiC,QAAS,MAAMrjC,MAAM,8BAC/Be,KAAKshC,OAAO,YACZthC,KAAKmmC,MAAM5F,GAMb+I,WACE,IAAKtpC,KAAKsiC,QAAS,MAAMrjC,MAAM,8BAC/Be,KAAKshC,OAAO,aACZthC,KAAKmmC,MAAM3F,GASbgI,OAAQ5+B,EAAOvI,EAAQC,GACrB,IAAKtB,KAAKsiC,QAAS,MAAMrjC,MAAM,8BAC/Be,KAAKshC,OAAO,sCAAuC13B,EAAOvI,EAAQC,GAClEtB,KAAKkpC,MAAMlpC,KAAKiiC,aAAcr4B,EAAOvI,EAAQC,GAC7CtB,KAAK6oC,SAAS,GAAM,CAACj/B,EAAOvI,EAAQC,GAAS,MAO/CioC,YAAa3/B,GACX,IAAK5J,KAAKsiC,QAAS,MAAMrjC,MAAM,8BAC/Be,KAAKshC,OAAO,kBAAmB13B,GAC1B5J,KAAKuiC,eAAegG,SAAS3+B,IAAQ5J,KAAKuiC,eAAex9B,KAAK6E,GACnE5J,KAAK6oC,SAAS,GAAM,CAACj/B,GAAQ,MAQ/B+V,SAAUkmB,EAAK3hC,GAKb,GAJAlE,KAAKshC,OAAO,kBAAmBuE,GACZ,iBAARA,GAAoB7lC,KAAKmiC,oBAAoB0D,KACtDA,EAAM7lC,KAAKmiC,oBAAoB0D,IAEd,iBAARA,EAMT,MAAM,IAAI5mC,MAAM,2BAA2B4mC,KANhB,CAC3B,MAAM2D,EAAQtoC,EAAO2M,KAAK,CAACg4B,IACrB76B,EAAM9J,EAAOE,SAAS8C,GAAOA,EAAM45B,EAAQ/8B,OAAOmD,GAExDlE,KAAK6oC,SAAS,GAAI,GAAI3nC,EAAOqC,OAAO,CAACimC,EAAOx+B,MAchD67B,WAAY4C,EAAc7C,GACxB,IAAI8C,EACAC,EACAC,EACAC,EACAC,EACAC,EACJ,OAAQ/pC,KAAKgI,MACX,IAAK,cACH0hC,EAAa/J,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUyC,EAAe7C,EAAU,QACrF+C,EAAahK,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUyC,EAAe7C,EAAU,QACrFgD,EAAgB1oC,EAAO2M,KAAK67B,EAAY,OACxCG,EAAqB,GACrB,IAAK,MAAMpoC,KAASmoC,EAAcz9B,SAChC09B,EAAmB9kC,KAAKtD,GAE1BqoC,EAAgB5oC,EAAO2M,KAAK87B,EAAY,OACxCI,EAAqB,GACrB,IAAK,MAAMtoC,KAASqoC,EAAc39B,SAChC49B,EAAmBhlC,KAAKtD,GAE1BzB,KAAKqkC,kBAAoB,IAAIvE,EAAI+J,GACjC7pC,KAAKskC,kBAAoB,IAAIxE,EAAIiK,GACjC,MACF,IAAK,cACHL,EAAa/J,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUyC,EAAe7C,EAAU,QACrF+C,EAAahK,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUyC,EAAe7C,EAAU,QACrFgD,EAAgB1oC,EAAO2M,KAAK67B,EAAY,OACxCG,EAAqB,GACrB,IAAK,MAAMpoC,KAASmoC,EAAcz9B,SAChC09B,EAAmB9kC,KAAKtD,GAE1BqoC,EAAgB5oC,EAAO2M,KAAK87B,EAAY,OACxCI,EAAqB,GACrB,IAAK,MAAMtoC,KAASqoC,EAAc39B,SAChC49B,EAAmBhlC,KAAKtD,GAE1BzB,KAAKqkC,kBAAoB,IAAIvE,EAAI+J,GACjC7pC,KAAKskC,kBAAoB,IAAIxE,EAAIiK,GACjC,MACF,QACE,OAAO,EAIX,IAAK,IAAI1+B,EAAI,EAAGA,EAAI,KAAMA,IACxBrL,KAAKqkC,kBAAkB2F,aACvBhqC,KAAKskC,kBAAkB0F,aAIzB,OADAhqC,KAAKukC,gBAAiB,GACf,EAOT0F,SAKApB,SAAUv6B,EAAI47B,EAAStpC,GACrB,MAAMupC,EAAavpC,EAAOA,EAAKU,OAAS,EAClCiK,EAASrK,EAAOkpC,YAAY,EAAK,EAAIF,EAAQ5oC,QAEnDiK,EAAO8+B,cAAc9+B,EAAOjK,OAAS6oC,EAAa,EAAG,GACrD5+B,EAAO,GAAK+C,EACZ,IAAK,IAAIjD,EAAI,EAAGA,EAAI6+B,EAAQ5oC,OAAQ+J,IAClCE,EAAO8+B,cAAcH,EAAQ7+B,GAAI,EAAK,EAAIA,GAG5CrL,KAAKmmC,MAAM56B,GACP3K,GAAMZ,KAAKmmC,MAAMvlC,GAGvBulC,MAAOvlC,GACL,IAAIZ,KAAKojC,UAIT,OAH+B,IAA3BpjC,KAAKokC,mBAA2BpkC,KAAKikC,uBACvCrjC,EAAOZ,KAAKsqC,SAAS1pC,IAEhBZ,KAAK+E,KAAKnE,GAOnB2pC,eACEvqC,KAAKshC,OAAO,kBACZthC,KAAKylC,KAAK,cAGZ+E,OAAQC,GACNzqC,KAAK8jC,YAAc2G,EAAax+B,SAAS,OACzCjM,KAAK+jC,cAAgB/jC,KAAK0jC,IAAIgH,cAAc1qC,KAAK8jC,YAAa,MAAO,OACrE9jC,KAAKylC,KAAK,OAGZkF,OAAQF,GACNzqC,KAAK8jC,YAAc2G,EAAax+B,SAAS,OACzCjM,KAAK+jC,cAAgB/jC,KAAK0jC,IAAIgH,cAAc1qC,KAAK8jC,YAAa,MAAO,OACrE9jC,KAAKylC,KAAK,OAGZmF,OAAQ3D,GACN,MAAM4D,EAAQlL,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUhnC,KAAK+jC,cAAe,QAC3E+G,EAAW70B,EAAI/U,EAAO2M,KAAKg9B,EAAO,OAAQ5D,GAAiBh7B,SAAS,OAC1EjM,KAAKylC,KAAK,MAAOqF,GAGnBC,gBAAiBC,EAAUC,GACzB,IAAKD,EAASE,OAAOzK,GAGnB,OAFAzgC,KAAKshC,OAAO,mDACZthC,KAAKwlC,UAIP,IAAK,MAAM2F,KAAeF,EAAkB9+B,SACtB,IAAhBg/B,GACFnrC,KAAKgkC,mBAAmBj/B,KAAKomC,GAG7BnrC,KAAKgkC,mBAAmBuE,SAAS,GACnCvoC,KAAKokC,kBAAoB,GAEzBpkC,KAAKshC,OAAO,qDACZthC,KAAKwlC,WAIT4F,OAAQC,GACNrrC,KAAKokC,kBAAoBiH,EAAiBhpC,UAAU,GAC/Cq+B,EAAe6H,SAASvoC,KAAKokC,qBAChCpkC,KAAKshC,OAAO,8CACZthC,KAAKwlC,WAEPxlC,KAAKikC,sBAAuB,EAC5BjkC,KAAKshC,OAAO,yBACZthC,KAAKylC,KAAK,OAGZ6F,aAAc1D,EAAgBpG,EAAcM,GAC1C,MAAM8E,EAAWgB,EAAe37B,SAAS,OACnCs1B,EAASC,EAAav1B,SAAS,OAErCjM,KAAKshC,OAAO,kCAAmCsF,EAAUrF,EAAQO,GAEjE9hC,KAAKuhC,OAASA,EACdvhC,KAAKwhC,aAAeA,EACpBxhC,KAAK+hC,eAAiBD,EAGlB9hC,KAAK8hC,WAAWmG,MAAQjoC,KAAK+hC,eAAekG,OAC9CjoC,KAAKshC,OAAO,6BACZthC,KAAKsiC,SAAU,GAGjBtiC,KAAKylC,KAAK,YAAamB,EAAUrF,EAAQO,GAEzC,IAAK,MAAMhiC,KAAQE,KAAKyiC,KACtBziC,KAAKyiC,KAAK3iC,GAAMkmC,YAAYY,EAAUrF,EAAQO,GAG5CA,EAAWniB,UAAY3f,KAAKkoC,iBAC3BloC,KAAKmoC,wBAERnoC,KAAKooC,yBAITzC,WAIE,GAHA3lC,KAAK2hC,aAAc,EACnB3hC,KAAKshC,OAAO,aACZthC,KAAKylC,KAAK,UACLzlC,KAAKsiC,QAER,KAAOtiC,KAAKgiC,SAAS1gC,QACnBtB,KAAKipC,UAAUjpC,KAAKgiC,SAASjQ,MAAO,IAAI9yB,MAAM,mBAAoB,MAKxEssC,aACEvrC,KAAK2hC,aAAc,EACnB3hC,KAAKshC,OAAO,eACZthC,KAAKylC,KAAK,WAGZ+F,gBACExrC,KAAK4hC,gBAAiB,EACtB5hC,KAAKshC,OAAO,kBACZthC,KAAKylC,KAAK,cAGZC,kBACE1lC,KAAK4hC,gBAAiB,EACtB5hC,KAAKshC,OAAO,oBACZthC,KAAKylC,KAAK,gBAGZgG,QAAS7hC,GACH5J,KAAK6hC,WAAWziC,IAAIwK,KACxB5J,KAAKshC,OAAO,cAAe13B,GAE3B5J,KAAK6hC,WAAW3iC,IAAI0K,GAAO,GAC3B5J,KAAKylC,KAAK,OAAQ77B,IAGpB8hC,YAAangC,GACXvL,KAAK6hC,WAAa,IAAI7C,EAASzzB,GAC/BvL,KAAKshC,OAAO,gBACZthC,KAAKylC,KAAK,WAAYzlC,KAAK6hC,YAG7B8J,WAAY/hC,EAAOvI,EAAQC,GACzB,GAAItB,KAAKyhC,aAAezhC,KAAKsiC,UAAWtiC,KAAKuiC,eAAegG,SAAS3+B,IAInE,YADI5J,KAAKsiC,SAAStiC,KAAKwoC,OAAO5+B,EAAOvI,EAAQC,IAG/CtB,KAAKshC,OAAO,2CAA4C13B,EAAOvI,EAAQC,GAEvE,MAAMsqC,EAAU,CAAC7hC,EAAKwB,KACpB,GAAI+8B,IAAYtoC,KAAKkpC,MAAMlpC,KAAKiiC,aAAcr4B,EAAOvI,EAAQC,GAC7D,OAAIyI,GACF/J,KAAKshC,OAAO,6DAA8D13B,EAAOvI,EAAQC,EAAQyI,EAAIG,cACjGlK,KAAKsiC,SAAStiC,KAAKwoC,OAAO5+B,EAAOvI,EAAQC,UAG/CtB,KAAK6gC,MAAMj3B,EAAOvI,EAAQkK,IAGtB+8B,EAAU,IAAI1H,EAAQh3B,EAAOvI,EAAQC,EAAQsqC,GACnD5rC,KAAKiiC,aAAal9B,KAAKujC,GACvBtoC,KAAKylC,KAAK,UAAW77B,EAAOvI,EAAQC,EAAQsqC,GAG9CC,SAAUjiC,EAAOvI,EAAQkK,GACvBvL,KAAKshC,OAAO,+BAAgC13B,EAAOvI,GACnDrB,KAAKipC,UAAUjpC,KAAKkpC,MAAMlpC,KAAKgiC,SAAUp4B,EAAOvI,EAAQkK,EAAOjK,QAAS,KAAMiK,GAC9EvL,KAAK4iC,YAAcr3B,EAAOjK,OAC1BtB,KAAK8iC,cAAcv3B,EAAOjK,QAC1BtB,KAAKylC,KAAK,WAAYl6B,EAAOjK,QAC7BtB,KAAKylC,KAAK,QAAS77B,EAAOvI,EAAQkK,GAGpCugC,UAAWliC,EAAOvI,EAAQC,GACxBtB,KAAKshC,OAAO,0CAA2C13B,EAAOvI,EAAQC,GACtEtB,KAAKkpC,MAAMlpC,KAAKiiC,aAAcr4B,EAAOvI,EAAQC,GAC7CtB,KAAKylC,KAAK,SAAU77B,EAAOvI,EAAQC,GAGrCyqC,QAAS5C,GACPnpC,KAAKshC,OAAO,cAAe6H,GAC3BnpC,KAAKylC,KAAK,OAAQ0D,GAGpB6C,WAAYpiC,GACV,IAAK5J,KAAKsiC,QAIR,OAFAtiC,KAAKshC,OAAO,8DACZthC,KAAKwlC,UAGPxlC,KAAKshC,OAAO,iBAAkB13B,GAC9B5J,KAAKylC,KAAK,UAAW77B,GAGvBqiC,aACE,IAAKjsC,KAAKsiC,QAIR,OAFAtiC,KAAKshC,OAAO,+DACZthC,KAAKwlC,UAGPxlC,KAAKshC,OAAO,gBACZthC,KAAK6hC,WAAa,IAAId,EACtB/gC,KAAKylC,KAAK,YAGZyG,cACE,IAAKlsC,KAAKsiC,QAIR,OAFAtiC,KAAKshC,OAAO,gEACZthC,KAAKwlC,UAGPxlC,KAAKshC,OAAO,iBACZthC,KAAKylC,KAAK,aAGZ0G,UAAWviC,EAAOvI,EAAQC,GACxB,IAAKtB,KAAKsiC,QAIR,OAFAtiC,KAAKshC,OAAO,6DACZthC,KAAKwlC,UAGPxlC,KAAKshC,OAAO,0CAA2C13B,EAAOvI,EAAQC,GACtEtB,KAAKipC,UACHjpC,KAAKkpC,MAAMlpC,KAAKgiC,SAAUp4B,EAAOvI,EAAQC,GACzC,IAAIrC,MAAM,wBACV,MAEFe,KAAKylC,KAAK,SAAU77B,EAAOvI,EAAQC,GAGrC8qC,eAAgBxiC,GACd,IAAK5J,KAAKsiC,QAIR,OAFAtiC,KAAKshC,OAAO,mEACZthC,KAAKwlC,UAGPxlC,KAAKshC,OAAO,sBAAuB13B,GAC9B5J,KAAKwiC,mBAAmB+F,SAAS3+B,IAAQ5J,KAAKwiC,mBAAmBz9B,KAAK6E,GACvE5J,KAAKwiC,mBAAmBlhC,OAx4BI,KAw4BkCtB,KAAKwiC,mBAAmB7hB,QAC1F3gB,KAAKylC,KAAK,eAAgB77B,GAG5ByiC,YAAaxG,EAAK76B,GAChB,GAAY,IAAR66B,EAAW,CACb,IAAIyG,EACJ,IACEA,EAAOxO,EAAQn9B,OAAOqK,GACtB,MAAOjB,GACP/J,KAAKshC,OAAO,0CAA2Cv3B,EAAIG,SAAWH,GAGxE,IAAKuiC,EAAM,OAGX,GAFAtsC,KAAKqiC,sBAAwBiK,EAEP,iBAAXA,EAAKvtC,EACd,IAAK,MAAMe,KAAQwsC,EAAKvtC,EACtBiB,KAAKmiC,oBAAoBriC,GAAQX,OAAOmtC,EAAKvtC,EAAEe,GAAMmM,YAGzD,IAAK,MAAMnM,KAAQE,KAAKyiC,KAClBziC,KAAKmiC,oBAAoBriC,IAC3BE,KAAKyiC,KAAK3iC,GAAMmmC,oBAAoBjmC,KAAKqiC,uBAG7CriC,KAAKshC,OAAO,0BACZthC,KAAKylC,KAAK,WAAY,YAAazlC,KAAKqiC,4BAEpCriC,KAAKkiC,gBAAgB2D,KACvBA,EAAM7lC,KAAKkiC,gBAAgB2D,GACvB7lC,KAAKyiC,KAAKoD,IAEZ7lC,KAAKyiC,KAAKoD,GAAKK,UAAUl7B,IAG7BhL,KAAKshC,OAAO,8BAA+BuE,GAC3C7lC,KAAKylC,KAAK,WAAYI,EAAK76B,GAI/BuhC,aACEvsC,KAAKshC,OAAO,qBACZthC,KAAKipC,UAAUjpC,KAAKgiC,SAASrhB,QAAS,IAAI1hB,MAAM,yBAA0B,MAC1Ee,KAAKylC,KAAK,WAaZ+G,OAAQ5rC,EAAMo7B,EAAU+M,GAUtB,GAT+B,IAA3B/oC,KAAKokC,mBAA2BpkC,KAAKikC,uBACvCrjC,EAAOZ,KAAKysC,SAAS7rC,IAEvBZ,KAAKwjC,aAAe5iC,EAAKU,OACzBtB,KAAKujC,QAAQx+B,KAAKnE,GACdZ,KAAKujC,QAAQjiC,OAAS,IACxBtB,KAAKujC,QAAU,CAACriC,EAAOqC,OAAOvD,KAAKujC,QAASvjC,KAAKwjC,eAG/CxjC,KAAKkkC,mBAAoB,CAC3B,MAAMt6B,EAAQ5J,KAAKujC,QAAQ,GAAGnW,QAAQptB,KAAKkkC,oBAC3C,IAAe,IAAXt6B,EACF5J,KAAKujC,QAAQ,GAAKvjC,KAAKujC,QAAQ,GAAG3gC,MAAMgH,EAAQ5J,KAAKkkC,mBAAmB5iC,QACxEtB,KAAKwjC,aAAgB55B,EAAQ5J,KAAKkkC,mBAAmB5iC,OACrDtB,KAAKkkC,mBAAqB,UACrB,GAAIlkC,KAAKwjC,YAAc5iC,EAAKU,OAAStB,KAAKmkC,cAAgBnkC,KAAKkkC,mBAAmB5iC,OAGvF,OAFAtB,KAAKshC,OAAO,uCACZthC,KAAKwlC,UAKT,KAAOxlC,KAAKwjC,aAAexjC,KAAKqjC,cAAgBrjC,KAAKkkC,oBACnD,GAAyB,IAArBlkC,KAAKqjC,YACPrjC,KAAKsjC,QAAQpiC,EAAO2M,KAAK,SACpB,CACL,MAAMtC,EAASvL,KAAKujC,QAAQ,GAE5BvjC,KAAKwjC,aAAexjC,KAAKqjC,YACzBrjC,KAAKujC,QAAUvjC,KAAKwjC,YAChB,CAACj4B,EAAO3I,MAAM5C,KAAKqjC,cACnB,GACJrjC,KAAKsjC,QAAQ/3B,EAAO3I,MAAM,EAAG5C,KAAKqjC,cAItC0F,EAAG,MAGLE,UAAWX,EAASv+B,EAAKwB,GAClB+8B,IAELtoC,KAAKulC,eAAevlC,KAAK2hC,cAAgB3hC,KAAKojC,WAE9CkF,EAAQxH,SAAS/2B,EAAKwB,IAGxBg6B,cAAemH,GACb,IAAKA,IAAa1sC,KAAKijC,aAAejjC,KAAKgiC,SAAS1gC,OAIlD,OAHAqrC,aAAa3sC,KAAKgjC,UAClBhjC,KAAKgjC,SAAW,UAChBhjC,KAAKkjC,kBAAoB,MAI3B,MAAM0J,EAAmB3/B,KAAKnD,MAAQ9J,KAAKijC,WAE3C,GAAIjjC,KAAKgjC,SAAU,CAEjB,GAAI4J,EAAmB5sC,KAAKkjC,kBAAsC,IAAlBljC,KAAKijC,WACnD,OAEF0J,aAAa3sC,KAAKgjC,UAGpBhjC,KAAKkjC,kBAAoB0J,EACzB5sC,KAAKgjC,SAAWmC,YAAW,IAAMnlC,KAAKusC,cAAcvsC,KAAKijC,YACrDjjC,KAAKslC,eAAiBtlC,KAAKgjC,SAASqC,OAAOrlC,KAAKgjC,SAASqC,QAU/DwH,OAAQjuC,EAAMkuC,GACZ9sC,KAAKqjC,YAAczkC,EACnBoB,KAAKsjC,QAAUwJ,EAGjBC,YAAaC,EAASC,GACpBjtC,KAAKkkC,mBAAqB8I,EAC1BhtC,KAAKmkC,cAAgB8I,EAQvBC,iBAAkB3hC,GAChB,MAAMjK,EAASiK,EAAO4hC,aAAa,GAC/B7rC,EAAS,EACXtB,KAAK6sC,OAAOvrC,EAAQtB,KAAKotC,aAEzBptC,KAAKuqC,eACLvqC,KAAK6sC,OAAO,EAAG7sC,KAAKktC,mBAQxBE,WAAY7hC,GAEV,OADAvL,KAAK6sC,OAAO,EAAG7sC,KAAKktC,kBACZ3hC,EAAO,IACb,KAAK,EACH,OAAOvL,KAAK2lC,WACd,KAAK,EACH,OAAO3lC,KAAKurC,aACd,KAAK,EACH,OAAOvrC,KAAKwrC,gBACd,KAAK,EACH,OAAOxrC,KAAK0lC,kBACd,KAAK,EACH,OAAO1lC,KAAKyrC,QAAQlgC,EAAO4hC,aAAa,IAC1C,KAAK,EACH,OAAOntC,KAAK0rC,YAAYngC,EAAO3I,MAAM,IACvC,KAAK,EACH,OAAO5C,KAAK2rC,WACVpgC,EAAO4hC,aAAa,GACpB5hC,EAAO4hC,aAAa,GACpB5hC,EAAO4hC,aAAa,IAExB,KAAK,EACH,OAAOntC,KAAK6rC,SACVtgC,EAAO4hC,aAAa,GACpB5hC,EAAO4hC,aAAa,GACpB5hC,EAAO3I,MAAM,IAEjB,KAAK,EACH,OAAO5C,KAAK8rC,UACVvgC,EAAO4hC,aAAa,GACpB5hC,EAAO4hC,aAAa,GACpB5hC,EAAO4hC,aAAa,IAExB,KAAK,EACH,OAAOntC,KAAK+rC,QAAQxgC,EAAOQ,aAAa,IAC1C,KAAK,GACH,OAAO/L,KAAKgsC,WAAWzgC,EAAO4hC,aAAa,IAC7C,KAAK,GACH,OAAOntC,KAAKisC,aACd,KAAK,GACH,OAAOjsC,KAAKksC,cACd,KAAK,GACH,OAAOlsC,KAAKmsC,UACV5gC,EAAO4hC,aAAa,GACpB5hC,EAAO4hC,aAAa,GACpB5hC,EAAO4hC,aAAa,IAExB,KAAK,GACH,OAAOntC,KAAKosC,eAAe7gC,EAAO4hC,aAAa,IACjD,KAAK,GACH,OAAOntC,KAAKqsC,YAAY9gC,EAAOlJ,UAAU,GAAIkJ,EAAO3I,MAAM,IAC5D,QAEE,OADA5C,KAAKshC,OAAO,uBACLthC,KAAKylC,KAAK,iBAAkBl6B,IAIzCo5B,0BACE3kC,KAAK6sC,OAAO,GAAGQ,IACb,MAAMC,EAAUD,EAAchrC,UAAU,GACxB,KAAZirC,EACFttC,KAAK6sC,OAAOS,EAAU,GAAIttC,KAAKutC,oBAE/BvtC,KAAKwtC,UAAUH,MAKrBG,UAAWC,GACTztC,KAAK6sC,OAAO,IAAIa,IACd1tC,KAAKwqC,OAAOtpC,EAAOqC,OAAO,CAACkqC,EAAcC,KACzC1tC,KAAK2tC,eAIT/I,YACE5kC,KAAK6sC,OAAO,IAAIe,IAEd,IADA5tC,KAAK2qC,OAAOiD,IACJ5tC,KAAKukC,iBAGbvkC,KAAK6tC,eAKTF,YACE,MAAM7G,EAAc5lC,EAAO2M,KAAK8xB,EAAKoH,KAAK7lC,EAAO2M,KAAK7N,KAAKgnC,UAAU,QAAUhnC,KAAK+jC,cAAe,QAAS,OAE5G/jC,KAAK+sC,YAAYjG,EAAa,KAC9B9mC,KAAK6sC,OAAO,IAAIthC,IAEd,IADAvL,KAAK4qC,OAAOr/B,IACJvL,KAAKukC,iBAGbvkC,KAAK8tC,wBAITA,qBACE9tC,KAAK6sC,OAAO,IAAIthC,IACd,MAAMy/B,EAAWhrC,KAAK+tC,kBAAkBxiC,EAAO3I,MAAM,EAAG,IAClDqoC,EAAoBjrC,KAAK+tC,kBAAkBxiC,EAAO3I,MAAM,EAAG,KAC3DskC,EAAUlnC,KAAK+tC,kBAAkBxiC,EAAO3I,MAAM,GAAI,KAAKmJ,aAAa,GAC1E/L,KAAK6sC,OAAO3F,GAASC,IACnBA,EAAannC,KAAK+tC,kBAAkB5G,GACpCnnC,KAAK6sC,OAAO,GAAGmB,IACb,MAAMC,EAAQjuC,KAAK+tC,kBAAkBC,GAAUjiC,aAAa,GAC5D/L,KAAK6sC,OAAOoB,GAAOC,IACjBA,EAAWluC,KAAK+tC,kBAAkBG,GAClCluC,KAAK+qC,gBAAgBC,EAAUC,EAAmB9D,EAAY+G,GAC9D,MAAMZ,EAAUW,EAAQC,EAAS7rC,UAAU,GAAK,KAC1C8rC,EAAWF,EAAQC,EAAStrC,MAAM,EAAG,IAAM,KACjC,KAAZ0qC,GAA0C,wBAAxBa,EAASliC,WAC7BjM,KAAKutC,mBAAmBW,EAAStrC,MAAM,IAEvC5C,KAAK6kC,8BAQjBgJ,YAIE,MAAMO,EAAoBpuC,KAAK+tC,kBAAkBtN,GACjDzgC,KAAK+sC,YAAYqB,EAAmB,KACpCpuC,KAAK6sC,OAAO,GAAGthC,IACb,MAAM8/B,EAAmBrrC,KAAK+tC,kBAAkBxiC,EAAO3I,MAAM,EAAG,IAC1D4kC,EAAUxnC,KAAK+tC,kBAAkBxiC,EAAO3I,MAAM,EAAG,IAAImJ,aAAa,GACxE/L,KAAK6sC,OAAOrF,GAAS6G,IACnBruC,KAAK+tC,kBAAkBM,GACvBruC,KAAKorC,OAAOC,GACZrrC,KAAK6kC,gBAAgB,YAQ3BA,kBACE7kC,KAAK6sC,OAAO,GAAGthC,IACb,MAAM+hC,EAAU/hC,EAAOlJ,UAAU,GACjC,GAAgB,KAAZirC,EAGF,OAFAttC,KAAKshC,OAAO,oDAAqDgM,EAAQrhC,iBACzEjM,KAAK0N,MAGP1N,KAAK6sC,OAAOS,EAAU,GAAIttC,KAAKutC,uBAInCA,mBAAoB5F,GAClB,MAAMwG,EAAWxG,EAAU/kC,MAAM,EAAG,IACpC,GAA4B,wBAAxBurC,EAASliC,WAGX,OAFAjM,KAAKshC,OAAO,oDAAqD6M,EAASliC,iBAC1EjM,KAAK0N,MAGPi6B,EAAYA,EAAU/kC,MAAM,IAC5B5C,KAAKsrC,aAAa3D,EAAU/kC,MAAM,EAAG,IAAK+kC,EAAU/kC,MAAM,GAAI,IAAK,CACjEolC,OAAuB,EAAfL,EAAU,IAClBM,QAAwB,EAAfN,EAAU,IACnBhoB,YAA4B,GAAfgoB,EAAU,MAEzB3nC,KAAK6sC,OAAO,EAAG7sC,KAAKktC,kBAGtBzI,YAIE,IAHAzkC,KAAKojC,WAAY,EAEjBpjC,KAAK+E,KAAK,MACH/E,KAAKsuC,SAOZ,IAFAtJ,cAAchlC,KAAK+iC,oBACnB/iC,KAAK6sC,OAAO1tC,OAAOovC,WAAW,SACvBvuC,KAAKiiC,aAAa3gC,QACvBtB,KAAKiiC,aAAalQ,MAEpB,KAAO/xB,KAAKgiC,SAAS1gC,QACnBtB,KAAKipC,UAAUjpC,KAAKgiC,SAASjQ,MAAO,IAAI9yB,MAAM,mBAAoB,MAItEqiC,UAAWz9B,GACTA,EAAK,GAAK,IAAI7D,KAAKqhC,aAAax9B,EAAK,KACrC47B,KAAS57B,GAGXqlC,MAAOlH,EAAUnB,EAAOx/B,EAAQC,GAC9B,IAAK,IAAI+J,EAAI,EAAGA,EAAI22B,EAAS1gC,OAAQ+J,IAAK,CACxC,MAAMmjC,EAAMxM,EAAS32B,GACrB,GAAImjC,EAAI3N,QAAUA,GAAS2N,EAAIntC,SAAWA,GAAUmtC,EAAIltC,SAAWA,EAEjE,OADAi+B,EAAYyC,EAAU32B,GACfmjC,EAGX,OAAO,KAGTlH,kBAAmBt8B,GACjB,MAAMyjC,EAAQvtC,EAAO2M,KAAK7C,GAC1B,IAAKhL,KAAKqkC,kBAER,OADArkC,KAAKshC,OAAO,6CACLmN,EAGT,IAAK,IAAIpjC,EAAI,EAAGA,EAAIL,EAAI1J,OAAQ+J,IAAK,CACnC,MAAMqjC,EAAY1uC,KAAKqkC,kBAAkB2F,aACzCyE,EAAMpjC,GAAKojC,EAAMpjC,GAAKqjC,EAGxB,OAAOD,EAGTnE,SAAUt/B,GACR,MAAMyjC,EAAQvtC,EAAO2M,KAAK7C,GAE1B,IAAKhL,KAAKqkC,mBAAgD,IAA3BrkC,KAAKokC,kBAClC,OAAOqK,EAET,IAAK,IAAIpjC,EAAI,EAAGA,EAAIL,EAAI1J,OAAQ+J,IAAK,CACnC,MAAMqjC,EAAY1uC,KAAKqkC,kBAAkB2F,aACzCyE,EAAMpjC,GAAKojC,EAAMpjC,GAAKqjC,EAGxB,OAAOD,EAGTV,kBAAmB/iC,GACjB,MAAM2jC,EAAUztC,EAAO2M,KAAK7C,GAE5B,IAAKhL,KAAKskC,kBAER,OADAtkC,KAAKshC,OAAO,6CACLqN,EAET,IAAK,IAAItjC,EAAI,EAAGA,EAAIL,EAAI1J,OAAQ+J,IAAK,CACnC,MAAMqjC,EAAY1uC,KAAKskC,kBAAkB0F,aACzC2E,EAAQtjC,GAAKsjC,EAAQtjC,GAAKqjC,EAG5B,OAAOC,EAGTlC,SAAUzhC,GACR,MAAM2jC,EAAUztC,EAAO2M,KAAK7C,GAE5B,IAAKhL,KAAKskC,mBAAgD,IAA3BtkC,KAAKokC,kBAClC,OAAOuK,EAET,IAAK,IAAItjC,EAAI,EAAGA,EAAIL,EAAI1J,OAAQ+J,IAAK,CACnC,MAAMqjC,EAAY1uC,KAAKskC,kBAAkB0F,aACzC2E,EAAQtjC,GAAKsjC,EAAQtjC,GAAKqjC,EAG5B,OAAOC,EAGT3H,UAAW39B,GACT,OAAOnI,EAAO2M,KAAKxE,EAAK,QAAQ4C,SAAS,QAI7CxN,EAAOC,QAAUsiC,iDCx0CjB,MAAMvB,EAAQ,EAAQ,KAAR,CAAiB,6BACzBmP,EAAe,EAAQ,MACvBpK,EAAO,EAAQ,KACfqK,EAAW,EAAQ,MACnBC,EAAO,EAAQ,MACfC,EAAiB,EAAQ,MAEzBC,EAAS,EAAQ,MACjBC,EAAc,EAAQ,MACtBC,EAAa,EAAQ,IACrBC,EAAmB,EAAQ,MAkBjC,MAAMC,UAAeR,EACnB3sC,YAAag9B,EAAO,IAGlB,GAFAmC,SAEKnC,EAAKsC,OAAQ,MAAM,IAAItiC,MAAM,+BAClC,IAAKggC,EAAK2H,SAAU,MAAM,IAAI3nC,MAAM,iCACpC,IAAKggC,EAAKoQ,SAAU,MAAM,IAAIpwC,MAAM,iCACpC,IAAK4qB,EAAQylB,UAAYrQ,EAAKkK,KAAM,MAAM,IAAIlqC,MAAM,6BAEpDe,KAAKuhC,OAAgC,iBAAhBtC,EAAKsC,OACtBtC,EAAKsC,OACLtC,EAAKsC,OAAOt1B,SAAS,OACzBjM,KAAKuvC,cAAgBruC,EAAO2M,KAAK7N,KAAKuhC,OAAQ,OAC9CvhC,KAAKwvC,cAAgBxvC,KAAKuvC,cAActjC,SAAS,UAEjDjM,KAAK4mC,SAAoC,iBAAlB3H,EAAK2H,SACxB3H,EAAK2H,SAASiB,cACd5I,EAAK2H,SAAS36B,SAAS,OAC3BjM,KAAKyvC,gBAAkBvuC,EAAO2M,KAAK7N,KAAK4mC,SAAU,OAClD5mC,KAAK0vC,gBAAkB1vC,KAAKyvC,gBAAgBxjC,SAAS,UAErDwzB,EAAM,gBAAiBz/B,KAAK4mC,UAE5B5mC,KAAKmjC,WAAY,EAEjBnjC,KAAK2vC,MAAQ1Q,EAAKkK,KAClBnpC,KAAK4vC,iBAAmB3Q,EAAK4Q,gBAC7B7vC,KAAK8vC,WAAa7Q,EAAK8Q,UACvB/vC,KAAKgwC,WAAa/Q,EAAKgR,UACvBjwC,KAAKkwC,WAAajR,EAAKkR,UAIvBnwC,KAAKowC,MAA6B,mBAAdnR,EAAKoR,KAAsBpR,EAAKoR,OAASpR,EAAKoR,KAElE,IAAIhB,EAAoC,iBAAlBpQ,EAAKoQ,SACvB,CAACpQ,EAAKoQ,UACW,MAAjBpQ,EAAKoQ,SAAmB,GAAKpQ,EAAKoQ,SAGtCA,EAAWA,EAASztC,KAAI0uC,IAEsB,OAD5CA,EAAcA,EAAYrkC,YACVqkC,EAAYhvC,OAAS,KACnCgvC,EAAcA,EAAYhhB,UAAU,EAAGghB,EAAYhvC,OAAS,IAEvDgvC,KAGTjB,EAAW3tC,MAAMmM,KAAK,IAAImsB,IAAIqV,IAE9B,MAAMkB,GAA+B,IAAfvwC,KAAKowC,UAAsBpwC,KAAKowC,OAAStB,EAAK0B,gBAE9DC,EAAe1mC,IACnBglC,GAAe,KACb/uC,KAAKylC,KAAK,UAAW17B,OAIzB/J,KAAK0wC,UAAYrB,EACdztC,KAAI0uC,IACH,IAAIK,EACJ,IACEA,EAAY3B,EAAO4B,SAASN,GAC5B,MAAOvmC,GAEP,OADA0mC,EAAa,IAAIxxC,MAAM,wBAAwBqxC,MACxC,KAGT,MAAMnH,EAAOwH,EAAUxH,KACvB,GAAIA,EAAO,GAAKA,EAAO,MAErB,OADAsH,EAAa,IAAIxxC,MAAM,yBAAyBqxC,MACzC,KAGT,MAAMnC,EAAWwC,EAAUxC,SAC3B,MAAkB,UAAbA,GAAqC,WAAbA,GACF,mBAAhBc,EAEa,SAAbd,GAA6C,mBAAfe,EAChC,IAAIA,EAAWlvC,KAAMswC,GACL,QAAbnC,GAAmC,SAAbA,IAAwBoC,GAEvC,QAAbpC,GAAwC,oBAAX99B,QACA,WAA7BA,OAAOwgC,SAAS1C,UAMpBsC,EAAa,IAAIxxC,MAAM,iCAAiCqxC,MACjD,MAHA,IAAInB,EAAiBnvC,KAAMswC,GAV3B,IAAIrB,EAAYjvC,KAAMswC,MAgBhCnrC,OAAO+yB,SAUZrxB,MAAOo4B,IACLA,EAAOj/B,KAAK8wC,qBAAqB7R,IAC5B8R,MAAQ,UACbtR,EAAM,kBAAmBR,GACzBj/B,KAAKgxC,UAAU/R,GAGfj/B,KAAK0wC,UAAU1tC,SAAQiuC,IACrBA,EAAQhM,iBAYZiM,KAAMjS,IACJA,EAAOj/B,KAAK8wC,qBAAqB7R,IAC5B8R,MAAQ,UACbtR,EAAM,iBAAkBR,GACxBj/B,KAAKgxC,UAAU/R,GAWjBkS,SAAUlS,GACHA,IAAMA,EAAO,KAClBA,EAAOj/B,KAAK8wC,qBAAqB7R,IAC5B8R,MAAQ,YACbtR,EAAM,qBAAsBR,GAC5Bj/B,KAAKgxC,UAAU/R,GAWjBmS,OAAQnS,IACNA,EAAOj/B,KAAK8wC,qBAAqB7R,IACxB8R,cAAc9R,EAAK8R,MAC5BtR,EAAM,mBAAoBR,GAC1Bj/B,KAAKgxC,UAAU/R,GAGjB+R,UAAW/R,GACTj/B,KAAK0wC,UAAU1tC,SAAQiuC,IAErBA,EAAQ5B,SAASpQ,MAQrBoS,OAAQpS,GACNQ,EAAM,iBACDR,IAAMA,EAAO,IAClBj/B,KAAK0wC,UAAU1tC,SAAQiuC,IAErBA,EAAQI,OAAOpS,MAInBgG,YAAaqM,GACX7R,EAAM,iBAAkB6R,GACxBtxC,KAAK0wC,UAAU1tC,SAAQiuC,IACrBA,EAAQhM,YAAYqM,MAIxB9L,QAASuD,GACP,GAAI/oC,KAAKmjC,UAAW,OACpBnjC,KAAKmjC,WAAY,EACjB1D,EAAM,WAEN,MAAM8R,EAAQvxC,KAAK0wC,UAAU9uC,KAAIqvC,GAAWlI,IAC1CkI,EAAQzL,QAAQuD,MAGlB8F,EAAS0C,EAAOxI,GAEhB/oC,KAAK0wC,UAAY,GACjB1wC,KAAK4vC,iBAAmB,KAG1BkB,qBAAsB7R,EAAO,IAQ3B,OAPoB,MAAhBA,EAAKuS,UAAiBvS,EAAKuS,QAAUxC,EAAOyC,wBAE3B,MAAjBxS,EAAK0D,WAAkB1D,EAAK0D,SAAW,GACpB,MAAnB1D,EAAK2D,aAAoB3D,EAAK2D,WAAa,GAE3C5iC,KAAK4vC,mBAAkB3Q,EAAOz5B,OAAO+iB,OAAO,GAAI0W,EAAMj/B,KAAK4vC,qBAExD3Q,GAaXmQ,EAAOiC,OAAS,CAACpS,EAAM8J,KAGrB,GAFAA,EAAKvE,EAAKuE,IAEL9J,EAAK2H,SAAU,MAAM,IAAI3nC,MAAM,iCACpC,IAAKggC,EAAKoQ,SAAU,MAAM,IAAIpwC,MAAM,iCAEpC,MAAMyyC,EAAalsC,OAAO+iB,OAAO,GAAI0W,EAAM,CACzC2H,SAAUllC,MAAMC,QAAQs9B,EAAK2H,UAAY3H,EAAK2H,SAAS,GAAK3H,EAAK2H,SACjErF,OAAQrgC,EAAO2M,KAAK,wBACpBs7B,KAAM,OAGFwI,EAAS,IAAIvC,EAAOsC,GAC1BC,EAAOnN,KAAK,QAASuE,GACrB4I,EAAOnN,KAAK,UAAWuE,GAEvB,IAAI39B,EAAM1J,MAAMC,QAAQs9B,EAAK2H,UAAY3H,EAAK2H,SAAStlC,OAAS,EAChE,MAAMswC,EAAU,GAmBhB,OAlBAD,EAAOjN,GAAG,UAAU9jC,IAGlB,GAFAwK,GAAO,EACPwmC,EAAQhxC,EAAKgmC,UAAYhmC,EACb,IAARwK,EAAW,CACbumC,EAAOnM,UACP,MAAM//B,EAAOD,OAAOC,KAAKmsC,GACL,IAAhBnsC,EAAKnE,OACPynC,EAAG,KAAM6I,EAAQnsC,EAAK,KAEtBsjC,EAAG,KAAM6I,OAKf3S,EAAK2H,SAAWllC,MAAMC,QAAQs9B,EAAK2H,UAC/B3H,EAAK2H,SAAShlC,KAAIglC,GAAY1lC,EAAO2M,KAAK+4B,EAAU,SACpD1lC,EAAO2M,KAAKoxB,EAAK2H,SAAU,OAC/B+K,EAAON,OAAO,CAAEzK,SAAU3H,EAAK2H,WACxB+K,GAGTlzC,EAAOC,QAAU0wC,kBCnSjB,MAAMR,EAAe,EAAQ,MA2B7BnwC,EAAOC,QAzBP,cAAsBkwC,EACpB3sC,YAAa0vC,EAAQrB,GACnBlP,QAEAphC,KAAK2xC,OAASA,EACd3xC,KAAKswC,YAAcA,EAEnBtwC,KAAK6xC,SAAW,KAChB7xC,KAAKmjC,WAAY,EAGnB8B,YAAaqM,GACO,MAAdA,IAAoBA,EAAatxC,KAAK8xC,2BAE1C9M,cAAchlC,KAAK6xC,UAEfP,IACFtxC,KAAK6xC,SAAW5M,aAAY,KAC1BjlC,KAAKqvC,SAASrvC,KAAK2xC,OAAOb,0BACzBQ,GACCtxC,KAAK6xC,SAASxM,OAAOrlC,KAAK6xC,SAASxM,2BCtB7C,MAAM1gC,EAAQ,EAAQ,MAChB86B,EAAQ,EAAQ,KAAR,CAAiB,wCACzBqP,EAAO,EAAQ,MACfpP,EAAc,EAAQ,MACtBqS,EAAS,EAAQ,KACjBC,EAAQ,EAAQ,MAEhBhD,EAAS,EAAQ,MACjBiD,EAAU,EAAQ,MAKlBC,EAAa,GAOnB,MAAM/C,UAAyB8C,EAC7BhwC,YAAa0vC,EAAQrB,GACnBlP,MAAMuQ,EAAQrB,GACd7Q,EAAM,2BAA4B6Q,GAElCtwC,KAAKmyC,MAAQ,GACbnyC,KAAKoyC,OAAS,KAEdpyC,KAAKqyC,cAAe,EACpBryC,KAAKkhC,QAAU,EACflhC,KAAKsyC,eAAiB,KAItBtyC,KAAKuyC,mBAAoB,EAEzBvyC,KAAKwyC,cAGPnD,SAAUpQ,GACR,GAAIj/B,KAAKmjC,WAAanjC,KAAKqyC,aAAc,OACzC,IAAKryC,KAAKoyC,OAAOK,UAIf,YAHAzyC,KAAKoyC,OAAO5N,KAAK,WAAW,KAC1BxkC,KAAKqvC,SAASpQ,MAKlB,MAAMyT,EAASltC,OAAO+iB,OAAO,GAAI0W,EAAM,CACrC0T,OAAQ,WACRC,UAAW5yC,KAAK2xC,OAAOjC,gBACvBmD,QAAS7yC,KAAK2xC,OAAOnC,gBAIvB,GAFIxvC,KAAK8yC,aAAYJ,EAAOK,UAAY/yC,KAAK8yC,YAE1B,YAAf7T,EAAK8R,OAAsC,cAAf9R,EAAK8R,MAEnC/wC,KAAKgzC,MAAMN,OACN,CAEL,MAAMlB,EAAU1gC,KAAK/D,IAAIkyB,EAAKuS,QAAS,GAEvCxxC,KAAKizC,gBAAgBzB,GAAS0B,IAC5BR,EAAOlB,QAAUA,EACjBkB,EAAOQ,OAASA,EAChBlzC,KAAKgzC,MAAMN,OAKjBrB,OAAQpS,GACN,GAAIj/B,KAAKmjC,WAAanjC,KAAKqyC,aAAc,OACzC,IAAKryC,KAAKoyC,OAAOK,UAIf,YAHAzyC,KAAKoyC,OAAO5N,KAAK,WAAW,KAC1BxkC,KAAKqxC,OAAOpS,MAKhB,MAGMyT,EAAS,CACbC,OAAQ,SACRC,UALkBlxC,MAAMC,QAAQs9B,EAAK2H,WAAa3H,EAAK2H,SAAStlC,OAAS,EACvE29B,EAAK2H,SAAShlC,KAAIglC,GAAYA,EAAS36B,SAAS,YAC/CgzB,EAAK2H,UAAY3H,EAAK2H,SAAS36B,SAAS,WAAcjM,KAAK2xC,OAAOjC,iBAMvE1vC,KAAKgzC,MAAMN,GAGblN,QAASuD,EAAKhD,GACZ,GAAI/lC,KAAKmjC,UAAW,OAAO4F,EAAG,MAE9B/oC,KAAKmjC,WAAY,EAEjB6B,cAAchlC,KAAK6xC,UACnBlF,aAAa3sC,KAAKsyC,gBAGlB,IAAK,MAAM/Q,KAAUvhC,KAAKmyC,MAAO,CAC/B,MAAMgB,EAAOnzC,KAAKmyC,MAAM5Q,GACxBoL,aAAawG,EAAKC,gBAClBD,EAAK3N,UAsBP,GApBAxlC,KAAKmyC,MAAQ,KAETnyC,KAAKoyC,SACPpyC,KAAKoyC,OAAOiB,eAAe,UAAWrzC,KAAKszC,uBAC3CtzC,KAAKoyC,OAAOiB,eAAe,OAAQrzC,KAAKuzC,oBACxCvzC,KAAKoyC,OAAOiB,eAAe,QAASrzC,KAAKwzC,qBACzCxzC,KAAKoyC,OAAOiB,eAAe,QAASrzC,KAAKyzC,qBACzCzzC,KAAKoyC,OAAS,MAGhBpyC,KAAKszC,sBAAwB,KAC7BtzC,KAAKyzC,oBAAsB,KAC3BzzC,KAAKuzC,mBAAqB,KAC1BvzC,KAAKwzC,oBAAsB,KAEvBtB,EAAWlyC,KAAKswC,eAClB4B,EAAWlyC,KAAKswC,aAAaoD,WAAa,GAIxCxB,EAAWlyC,KAAKswC,aAAaoD,UAAY,EAAG,OAAO3K,IAEvD,IAKI4K,EALAvB,EAASF,EAAWlyC,KAAKswC,aAQ7B,UAPO4B,EAAWlyC,KAAKswC,aACvB8B,EAAO1N,GAAG,QAASqB,GACnBqM,EAAO5N,KAAK,QAASuE,IAKhB/oC,KAAKuyC,kBAAmB,OAAOqB,IAUpC,SAASA,IACHD,IACFhH,aAAagH,GACbA,EAAU,MAEZvB,EAAOiB,eAAe,OAAQO,GAC9BxB,EAAO5M,UACP4M,EAAS,KAbXuB,EAAUxO,WAAWyO,EAAgB5E,EAAO6E,iBAI5CzB,EAAO5N,KAAK,OAAQoP,GAatBpB,cAmBE,GAlBAxyC,KAAKmjC,WAAY,EAEZnjC,KAAKmyC,QAAOnyC,KAAKmyC,MAAQ,IAE9BnyC,KAAKszC,sBAAwB,KAC3BtzC,KAAK8zC,oBAEP9zC,KAAKyzC,oBAAsB1pC,IACzB/J,KAAK+zC,eAAehqC,IAEtB/J,KAAKuzC,mBAAqB3yC,IACxBZ,KAAKg0C,cAAcpzC,IAErBZ,KAAKwzC,oBAAsB,KACzBxzC,KAAKi0C,kBAGPj0C,KAAKoyC,OAASF,EAAWlyC,KAAKswC,aAC1BtwC,KAAKoyC,OACPF,EAAWlyC,KAAKswC,aAAaoD,WAAa,EACtC1zC,KAAKoyC,OAAOK,WACdzyC,KAAKszC,4BAEF,CACL,MAAM3C,EAAY,IAAIuD,IAAIl0C,KAAKswC,aAC/B,IAAI6D,EACAn0C,KAAK2xC,OAAOzB,aACdiE,EAA+B,SAAvBxD,EAAUxC,SAAsBnuC,KAAK2xC,OAAOzB,WAAWkE,WAAap0C,KAAK2xC,OAAOzB,WAAWmE,WAC9FF,GAASn0C,KAAK2xC,OAAOzB,WAAWoE,aACnCH,EAAQ,IAAInC,EAAMuC,MAAM5vC,EAAM3E,KAAK2xC,OAAOzB,WAAWoE,YAAqC,SAAvB3D,EAAUxC,YAGjFnuC,KAAKoyC,OAASF,EAAWlyC,KAAKswC,aAAe,IAAIyB,EAAO,CAAEyC,IAAKx0C,KAAKswC,YAAa6D,MAAAA,IACjFn0C,KAAKoyC,OAAOsB,UAAY,EACxB1zC,KAAKoyC,OAAO5N,KAAK,UAAWxkC,KAAKszC,uBAGnCtzC,KAAKoyC,OAAO1N,GAAG,OAAQ1kC,KAAKuzC,oBAC5BvzC,KAAKoyC,OAAO5N,KAAK,QAASxkC,KAAKwzC,qBAC/BxzC,KAAKoyC,OAAO5N,KAAK,QAASxkC,KAAKyzC,qBAGjCK,mBACM9zC,KAAKmjC,WAELnjC,KAAKqyC,eACPryC,KAAKqyC,cAAe,EACpBryC,KAAKkhC,QAAU,EACflhC,KAAKqvC,SAASrvC,KAAK2xC,OAAOb,yBAI9BkD,cAAepzC,GACb,IAAIZ,KAAKmjC,UAAT,CAEAnjC,KAAKuyC,mBAAoB,EAEzB,IACE3xC,EAAOgI,KAAK41B,MAAM59B,GAClB,MAAOmJ,GAEP,YADA/J,KAAK2xC,OAAOlM,KAAK,UAAW,IAAIxmC,MAAM,6BAIpB,aAAhB2B,EAAK+xC,OACP3yC,KAAKy0C,oBAAoB7zC,GACA,WAAhBA,EAAK+xC,OACd3yC,KAAK00C,kBAAkB9zC,GAEvBZ,KAAK+zC,eAAe,IAAI90C,MAAM,kCAAkC2B,EAAK+xC,YAIzE8B,oBAAqB7zC,GACnB,GAAIA,EAAKgyC,YAAc5yC,KAAK2xC,OAAOjC,gBAKjC,YAJAjQ,EACE,yEACAz/B,KAAKswC,YAAatB,EAAO2F,YAAY/zC,EAAKgyC,WAAY5yC,KAAK2xC,OAAO/K,UAKtE,GAAIhmC,EAAKiyC,SAAWjyC,EAAKiyC,UAAY7yC,KAAK2xC,OAAOnC,cAE/C,OAGF/P,EACE,6BACA72B,KAAKC,UAAUjI,GAAOZ,KAAKswC,YAAatwC,KAAK2xC,OAAO/K,UAGtD,MAAMgO,EAAUh0C,EAAK,kBACrB,GAAIg0C,EAAS,OAAO50C,KAAK2xC,OAAOlM,KAAK,UAAW,IAAIxmC,MAAM21C,IAE1D,MAAMC,EAAUj0C,EAAK,mBACjBi0C,GAAS70C,KAAK2xC,OAAOlM,KAAK,UAAW,IAAIxmC,MAAM41C,IAEnD,MAAMhD,EAAWjxC,EAAKixC,UAAYjxC,EAAK,gBACnCixC,GAAU7xC,KAAKilC,YAAuB,IAAX4M,GAE/B,MAAMiD,EAAYl0C,EAAK,cAMvB,GALIk0C,IAEF90C,KAAK8yC,WAAagC,GAGC,MAAjBl0C,EAAKuwC,SAAkB,CACzB,MAAM4D,EAAWvvC,OAAO+iB,OAAO,GAAI3nB,EAAM,CACvCyuC,SAAUrvC,KAAKswC,YACf1J,SAAUoI,EAAO2F,YAAY/zC,EAAKgyC,aAEpC5yC,KAAK2xC,OAAOlM,KAAK,SAAUsP,GAG7B,IAAI5B,EAqBJ,GApBIvyC,EAAKo0C,OAASp0C,EAAKiyC,UACrBpT,EAAM,qCACN0T,EAAOnzC,KAAKi1C,cACZ9B,EAAK7kC,GAAK0gC,EAAO2F,YAAY/zC,EAAKiyC,SAClCM,EAAK3O,KAAK,UAAU0Q,IAClB,MAAMxC,EAAS,CACbC,OAAQ,WACRC,UAAW5yC,KAAK2xC,OAAOjC,gBACvBmD,QAAS7yC,KAAK2xC,OAAOnC,cACrB2F,WAAYv0C,EAAKiyC,QACjBqC,OAAAA,EACAE,SAAUx0C,EAAKw0C,UAEbp1C,KAAK8yC,aAAYJ,EAAOK,UAAY/yC,KAAK8yC,YAC7C9yC,KAAKgzC,MAAMN,MAEb1yC,KAAK2xC,OAAOlM,KAAK,OAAQ0N,GACzBA,EAAKkC,OAAOz0C,EAAKo0C,QAGfp0C,EAAKs0C,QAAUt0C,EAAKiyC,QAAS,CAC/B,MAAMyC,EAAUtG,EAAO2F,YAAY/zC,EAAKw0C,UACxCjC,EAAOnzC,KAAKmyC,MAAMmD,GACdnC,GACFA,EAAK7kC,GAAK0gC,EAAO2F,YAAY/zC,EAAKiyC,SAClC7yC,KAAK2xC,OAAOlM,KAAK,OAAQ0N,GACzBA,EAAKkC,OAAOz0C,EAAKs0C,QAEjBvI,aAAawG,EAAKC,gBAClBD,EAAKC,eAAiB,YACfpzC,KAAKmyC,MAAMmD,IAElB7V,EAAM,0BAA0B72B,KAAKC,UAAUjI,EAAKs0C,YAK1DR,kBAAmB9zC,GACjBA,EAAOA,EAAK20C,OAAS,GAErB,MAAM9vC,EAAOD,OAAOC,KAAK7E,GACL,IAAhB6E,EAAKnE,OAKTmE,EAAKzC,SAAQ4jC,IAGX,MAAMmO,EAAWvvC,OAAO+iB,OAAO3nB,EAAKgmC,GAAW,CAC7CyI,SAAUrvC,KAAKswC,YACf1J,SAAUoI,EAAO2F,YAAY/N,KAE/B5mC,KAAK2xC,OAAOlM,KAAK,SAAUsP,MAX3B/0C,KAAK2xC,OAAOlM,KAAK,UAAW,IAAIxmC,MAAM,4BAe1Cg1C,iBACMj0C,KAAKmjC,YACTnjC,KAAKwlC,UACLxlC,KAAKw1C,wBAGPzB,eAAgBhqC,GACV/J,KAAKmjC,YACTnjC,KAAKwlC,UAELxlC,KAAK2xC,OAAOlM,KAAK,UAAW17B,GAC5B/J,KAAKw1C,wBAGPA,uBACE,MAAMpQ,EAAKt0B,KAAK6gB,MAvUO,IAuUD7gB,KAAKw1B,UAAiCx1B,KAAK/D,IAzU3C,IAyU+C+D,KAAKoB,IAAI,EAAGlS,KAAKkhC,SAxUhE,MA0UtBlhC,KAAKqyC,cAAe,EACpB1F,aAAa3sC,KAAKsyC,gBAClBtyC,KAAKsyC,eAAiBnN,YAAW,KAC/BnlC,KAAKkhC,UACLlhC,KAAKwyC,gBACJpN,GACCplC,KAAKsyC,eAAejN,OAAOrlC,KAAKsyC,eAAejN,QAEnD5F,EAAM,+BAAgC2F,GAGxC4N,MAAON,GACL,GAAI1yC,KAAKmjC,UAAW,OACpBnjC,KAAKuyC,mBAAoB,EACzB,MAAMroC,EAAUtB,KAAKC,UAAU6pC,GAC/BjT,EAAM,UAAWv1B,GACjBlK,KAAKoyC,OAAOqD,KAAKvrC,GAGnB+oC,gBAAiBzB,EAASzI,GACxB,MAAMp2B,EAAO3S,KACPkzC,EAAS,GACfzT,EAAM,uBAAwB+R,GAE9B,IAAK,IAAInmC,EAAI,EAAGA,EAAImmC,IAAWnmC,EAC7BqqC,IAIF,SAASA,IACP,MAAMJ,EAAU5V,EAAY,IAAIzzB,SAAS,OACzCwzB,EAAM,wCACN,MAAM0T,EAAOxgC,EAAKw/B,MAAMmD,GAAW3iC,EAAKsiC,YAAY,CAAEU,WAAW,IACjExC,EAAK3O,KAAK,UAAUwQ,IAClB9B,EAAOnuC,KAAK,CACViwC,MAAAA,EACAI,SAAUpG,EAAO4G,YAAYN,KAE/BO,OAEF1C,EAAKC,eAAiBjO,YAAW,KAC/B1F,EAAM,oCACN0T,EAAKC,eAAiB,YACfzgC,EAAKw/B,MAAMmD,GAClBnC,EAAK3N,YApXS,KAsXZ2N,EAAKC,eAAe/N,OAAO8N,EAAKC,eAAe/N,QAGrD,SAASwQ,IACH3C,EAAO5xC,SAAWkwC,IACpB/R,EAAM,sBAAuB+R,GAC7BzI,EAAGmK,IAzBP2C,IA8BFZ,YAAahW,GACX,MAAMtsB,EAAO3S,KAEbi/B,EAAOz5B,OAAO+iB,OAAO,CACnButB,SAAS,EACTC,OAAQpjC,EAAKg/B,OAAO7B,WACpBO,KAAM19B,EAAKg/B,OAAOvB,OACjBnR,GAEH,MAAMkU,EAAO,IAAIrE,EAAK7P,GAKtB,OAHAkU,EAAK3O,KAAK,QAASwR,GACnB7C,EAAK3O,KAAK,WAaV,SAASyR,IACP9C,EAAKE,eAAe,QAAS2C,GAC7B7C,EAAKE,eAAe,UAAW4C,MAb1B9C,EAIP,SAAS6C,EAASjsC,GAChB4I,EAAKg/B,OAAOlM,KAAK,UAAW,IAAIxmC,MAAM,qBAAqB8K,EAAIG,YAC/DipC,EAAK3N,YAgBX,SAASO,KAJToJ,EAAiBlvC,UAAU6xC,0BAA4B,IAEvD3C,EAAiB+G,YAAchE,EAI/BzzC,EAAOC,QAAUywC,uCCrbjBzwC,EAAQ+yC,uBAAyB,GACjC/yC,EAAQy3C,mBAAqB,GAE7Bz3C,EAAQi2C,YAActrC,IACD,iBAARA,IACTA,EAAMwC,OAAOxC,IAERnI,EAAO2M,KAAKxE,EAAK,UAAU4C,SAAS,QAG7CvN,EAAQk3C,YAAcvsC,IACD,iBAARA,IACTA,EAAMwC,OAAOxC,IAERnI,EAAO2M,KAAKxE,EAAK,OAAO4C,SAAS,WAe1CvN,EAAQkyC,SAAWvnC,IACjB,MAAMmrC,EAAM,IAAIN,IAAI7qC,EAAIuE,QAAQ,QAAS,UAUzC,OARIvE,EAAIxB,MAAM,UACZrC,OAAO4wC,iBAAiB5B,EAAK,CAC3B6B,KAAM,CAAE50C,MAAO+yC,EAAI6B,KAAKzoC,QAAQ,QAAS,QACzCugC,SAAU,CAAE1sC,MAAO+yC,EAAIrG,SAASvgC,QAAQ,QAAS,QACjD0oC,OAAQ,CAAE70C,MAAO+yC,EAAI8B,OAAO1oC,QAAQ,QAAS,UAI1C4mC,GAGT,MAAMuB,EAAS,EAAQ,MACvBvwC,OAAO+iB,OAAO7pB,EAASq3C,wCC7CvBt3C,EAAOC,QAAU,SAAuB63C,EAAMxN,GAC5C,GAAoB,oBAATyN,QAA0BD,aAAgBC,MACnD,MAAM,IAAIv3C,MAAM,iCAElB,GAAkB,mBAAP8pC,EACT,MAAM,IAAI9pC,MAAM,sCAGlB,MAAMw3C,EAAS,IAAIC,WAQnBD,EAAOE,iBAAiB,WANxB,SAASC,EAAWlwC,GAClB+vC,EAAOI,oBAAoB,UAAWD,GAAW,GAC7ClwC,EAAEnF,MAAOwnC,EAAGriC,EAAEnF,OACbwnC,EAAG,KAAM7nC,EAAO2M,KAAK4oC,EAAOvwC,YAGW,GAC9CuwC,EAAOK,kBAAkBP,wCCpB3B,MAAM,UAAEQ,GAAc,EAAQ,MAoE9Bt4C,EAAOC,QAlEP,cAAoBq4C,EAClB90C,YAAarD,EAAMqgC,EAAO,IACxBmC,MAAMnC,GAEc,iBAATrgC,IAETA,GADAqgC,EAAOrgC,GACKA,MAGdoB,KAAKpB,KAAOA,GAAQ,IAEpB,MAAM,MAAEo4C,EAAK,YAAEC,GAAc,GAAShY,EAE3Bj/B,KAAKk3C,cAAZF,KACuBC,EAE3Bj3C,KAAKm3C,UAAY,GACjBn3C,KAAKo3C,eAAiB,EAGxBC,WAAYrsC,EAAKvK,EAAKimB,GAIpB,IAHA1mB,KAAKo3C,gBAAkBpsC,EAAI1J,OAC3BtB,KAAKm3C,UAAUpyC,KAAKiG,GAEbhL,KAAKo3C,gBAAkBp3C,KAAKpB,MAAM,CACvCoB,KAAKo3C,gBAAkBp3C,KAAKpB,KAG5B,MAAM04C,EAAY,GAClB,IAAIC,EAAiB,EACrB,KAAOA,EAAiBv3C,KAAKpB,MAAM,CACjC,MAAMiU,EAAI7S,KAAKm3C,UAAUx2B,QAEzB,GAAI42B,EAAiB1kC,EAAEvR,QAAUtB,KAAKpB,KACpC04C,EAAUvyC,KAAK8N,GACf0kC,GAAkB1kC,EAAEvR,WACf,CAGL,MAAMk2C,EAAax3C,KAAKpB,KAAO24C,EAC/BD,EAAUvyC,KAAK8N,EAAEjQ,MAAM,EAAG40C,IAC1BD,GAAkBC,EAClBx3C,KAAKm3C,UAAU/nC,QAAQyD,EAAEjQ,MAAM40C,KAKnCx3C,KAAK+E,KAAK7D,EAAOqC,OAAO+zC,EAAWt3C,KAAKpB,OAE1C8nB,IAGF+wB,SACE,GAAIz3C,KAAKo3C,gBAAkBp3C,KAAKk3C,aAAc,CAC5C,MAAMQ,EAASx2C,EAAO6B,MAAM/C,KAAKpB,KAAOoB,KAAKo3C,gBAC7Cp3C,KAAKm3C,UAAUpyC,KAAK2yC,GACpB13C,KAAK+E,KAAK7D,EAAOqC,OAAOvD,KAAKm3C,YAC7Bn3C,KAAKm3C,UAAY,UACRn3C,KAAKo3C,iBACdp3C,KAAK+E,KAAK7D,EAAOqC,OAAOvD,KAAKm3C,YAC7Bn3C,KAAKm3C,UAAY,MAEnBn3C,KAAK+E,KAAK,+BChEd,SAAWtG,EAAQC,GACjB,aAGA,SAAS0E,EAAQuC,EAAK8D,GACpB,IAAK9D,EAAK,MAAM,IAAI1G,MAAMwK,GAAO,oBAKnC,SAAS7J,EAAU6P,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS3P,UAAYyP,EAAUzP,UAC/BwP,EAAKxP,UAAY,IAAI2P,EACrBH,EAAKxP,UAAUgC,YAAcwN,EAK/B,SAASI,EAAIC,EAAQtQ,EAAMuQ,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT9P,KAAKiQ,SAAW,EAChBjQ,KAAKkQ,MAAQ,KACblQ,KAAKsB,OAAS,EAGdtB,KAAKmQ,IAAM,KAEI,OAAXL,IACW,OAATtQ,GAA0B,OAATA,IACnBuQ,EAASvQ,EACTA,EAAO,IAGTQ,KAAKkF,MAAM4K,GAAU,EAAGtQ,GAAQ,GAAIuQ,GAAU,OAYlD,IAAI7O,EATkB,iBAAXzC,EACTA,EAAOC,QAAUmR,EAEjBnR,EAAQmR,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IAEIlP,EADoB,oBAAXmP,aAAmD,IAAlBA,OAAOnP,OACxCmP,OAAOnP,OAEP,eAEX,MAAOwF,IAgIT,SAAS4J,EAAeC,EAAQ3G,GAC9B,IAAI4G,EAAID,EAAOlC,WAAWzE,GAE1B,OAAI4G,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEXpN,GAAO,EAAO,wBAA0BmN,GAI5C,SAASE,EAAcF,EAAQG,EAAY9G,GACzC,IAAI+G,EAAIL,EAAcC,EAAQ3G,GAI9B,OAHIA,EAAQ,GAAK8G,IACfC,GAAKL,EAAcC,EAAQ3G,EAAQ,IAAM,GAEpC+G,EA8CT,SAASC,EAAWvH,EAAKxC,EAAO6G,EAAKmD,GAInC,IAHA,IAAIF,EAAI,EACJkC,EAAI,EACJzH,EAAM0F,KAAK/D,IAAI1D,EAAI/H,OAAQoM,GACtBrC,EAAIxE,EAAOwE,EAAID,EAAKC,IAAK,CAChC,IAAImF,EAAInH,EAAIgF,WAAWhD,GAAK,GAE5BsF,GAAKE,EAIHgC,EADErC,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAENpN,EAAOoN,GAAK,GAAKqC,EAAIhC,EAAK,qBAC1BF,GAAKkC,EAEP,OAAOlC,EA4DT,SAASgnC,EAAMxlC,EAAMylC,GACnBzlC,EAAKjC,MAAQ0nC,EAAI1nC,MACjBiC,EAAK7Q,OAASs2C,EAAIt2C,OAClB6Q,EAAKlC,SAAW2nC,EAAI3nC,SACpBkC,EAAKhC,IAAMynC,EAAIznC,IAsCjB,GA9TAN,EAAGG,KAAO,SAAepK,GACvB,OAAIA,aAAeiK,GAIJ,OAARjK,GAA+B,iBAARA,GAC5BA,EAAI3D,YAAYmO,WAAaP,EAAGO,UAAY1O,MAAMC,QAAQiE,EAAIsK,QAGlEL,EAAGkB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG9C,IAAM,SAAciE,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG5P,UAAUiF,MAAQ,SAAe4K,EAAQtQ,EAAMuQ,GAChD,GAAsB,iBAAXD,EACT,OAAO9P,KAAKmR,YAAYrB,EAAQtQ,EAAMuQ,GAGxC,GAAsB,iBAAXD,EACT,OAAO9P,KAAKoR,WAAWtB,EAAQtQ,EAAMuQ,GAG1B,QAATvQ,IACFA,EAAO,IAET4D,EAAO5D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqH,EAAQ,EACM,OAFlBiJ,EAASA,EAAO7D,WAAW2B,QAAQ,OAAQ,KAEhC,KACT/G,IACA7G,KAAKiQ,SAAW,GAGdpJ,EAAQiJ,EAAOxO,SACJ,KAAT9B,EACFQ,KAAKqR,UAAUvB,EAAQjJ,EAAOkJ,IAE9B/P,KAAKsR,WAAWxB,EAAQtQ,EAAMqH,GACf,OAAXkJ,GACF/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,MAM9CF,EAAG5P,UAAUkR,YAAc,SAAsBrB,EAAQtQ,EAAMuQ,GACzDD,EAAS,IACX9P,KAAKiQ,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX9P,KAAKkQ,MAAQ,CAAU,SAATJ,GACd9P,KAAKsB,OAAS,GACLwO,EAAS,kBAClB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB9P,KAAKsB,OAAS,IAEd8B,EAAO0M,EAAS,kBAChB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF9P,KAAKsB,OAAS,GAGD,OAAXyO,GAGJ/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,IAGxCF,EAAG5P,UAAUmR,WAAa,SAAqBtB,EAAQtQ,EAAMuQ,GAG3D,GADA3M,EAAgC,iBAAlB0M,EAAOxO,QACjBwO,EAAOxO,QAAU,EAGnB,OAFAtB,KAAKkQ,MAAQ,CAAC,GACdlQ,KAAKsB,OAAS,EACPtB,KAGTA,KAAKsB,OAASwP,KAAKS,KAAKzB,EAAOxO,OAAS,GACxCtB,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAGlB,IAAIC,EAAGkG,EACHC,EAAM,EACV,GAAe,OAAX1B,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAGgK,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,UAGC,GAAe,OAAXyE,EACT,IAAK1E,EAAI,EAAGC,EAAI,EAAGD,EAAIyE,EAAOxO,OAAQ+J,GAAK,EACzCmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,KAIN,OAAOtL,KAAKumB,UA2Bd1W,EAAG5P,UAAUoR,UAAY,SAAoBvB,EAAQjJ,EAAOkJ,GAE1D/P,KAAKsB,OAASwP,KAAKS,MAAMzB,EAAOxO,OAASuF,GAAS,GAClD7G,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAIlB,IAGImG,EAHAC,EAAM,EACNnG,EAAI,EAGR,GAAe,OAAXyE,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAG+J,GAAKxE,EAAOwE,GAAK,EAC3CmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,OAKX,IAAKpG,GADayE,EAAOxO,OAASuF,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOwE,EAAIyE,EAAOxO,OAAQ+J,GAAK,EAC1EmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,EAKbzR,KAAKumB,UA8BP1W,EAAG5P,UAAUqR,WAAa,SAAqBxB,EAAQtQ,EAAMqH,GAE3D7G,KAAKkQ,MAAQ,CAAC,GACdlQ,KAAKsB,OAAS,EAGd,IAAK,IAAIqQ,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWpS,EAClEmS,IAEFA,IACAC,EAAWA,EAAUpS,EAAQ,EAO7B,IALA,IAAIqS,EAAQ/B,EAAOxO,OAASuF,EACxBiL,EAAMD,EAAQF,EACdjE,EAAMoD,KAAK/D,IAAI8E,EAAOA,EAAQC,GAAOjL,EAErCkL,EAAO,EACF1G,EAAIxE,EAAOwE,EAAIqC,EAAKrC,GAAKsG,EAChCI,EAAOnB,EAAUd,EAAQzE,EAAGA,EAAIsG,EAASnS,GAEzCQ,KAAKgS,MAAMJ,GACP5R,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOnB,EAAUd,EAAQzE,EAAGyE,EAAOxO,OAAQ9B,GAEtC6L,EAAI,EAAGA,EAAIyG,EAAKzG,IACnB6G,GAAO1S,EAGTQ,KAAKgS,MAAME,GACPlS,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB/R,KAAKumB,UAGP1W,EAAG5P,UAAUiD,KAAO,SAAeiP,GACjCA,EAAKjC,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/B8G,EAAKjC,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAE7B8G,EAAK7Q,OAAStB,KAAKsB,OACnB6Q,EAAKlC,SAAWjQ,KAAKiQ,SACrBkC,EAAKhC,IAAMnQ,KAAKmQ,KAUlBN,EAAG5P,UAAU43C,MAAQ,SAAgB1lC,GACnCwlC,EAAKxlC,EAAMnS,OAGb6P,EAAG5P,UAAU0E,MAAQ,WACnB,IAAIgM,EAAI,IAAId,EAAG,MAEf,OADA7P,KAAKkD,KAAKyN,GACHA,GAGTd,EAAG5P,UAAUmS,QAAU,SAAkBxT,GACvC,KAAOoB,KAAKsB,OAAS1C,GACnBoB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAE9B,OAAOtB,MAIT6P,EAAG5P,UAAUsmB,OAAS,WACpB,KAAOvmB,KAAKsB,OAAS,GAAqC,IAAhCtB,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IACjDtB,KAAKsB,SAEP,OAAOtB,KAAKqS,aAGdxC,EAAG5P,UAAUoS,UAAY,WAKvB,OAHoB,IAAhBrS,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,KAClClQ,KAAKiQ,SAAW,GAEXjQ,MAKa,oBAAXunB,QAAgD,mBAAfA,OAAOuwB,IACjD,IACEjoC,EAAG5P,UAAUsnB,OAAOuwB,IAAI,+BAAiCxlC,EACzD,MAAO5L,GACPmJ,EAAG5P,UAAUqS,QAAUA,OAGzBzC,EAAG5P,UAAUqS,QAAUA,EAGzB,SAASA,IACP,OAAQtS,KAAKmQ,IAAM,UAAY,SAAWnQ,KAAKiM,SAAS,IAAM,IAiChE,IAAIsG,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UA4mB9D,SAASC,EAAYC,EAAM/M,EAAK9C,GAC9BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnC,IAAI7E,EAAOuH,EAAKrR,OAASsE,EAAItE,OAAU,EACvCwB,EAAIxB,OAAS8J,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIwH,EAAoB,EAAhBD,EAAKzC,MAAM,GACf2C,EAAmB,EAAfjN,EAAIsK,MAAM,GACdS,EAAIiC,EAAIC,EAERC,EAAS,SAAJnC,EACLoC,EAASpC,EAAI,SAAa,EAC9B7N,EAAIoN,MAAM,GAAK4C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI5H,EAAK4H,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAK2H,EAAI1H,EAAK,EAIlB2H,IADAtC,GAFAiC,EAAoB,EAAhBD,EAAKzC,MAAM7E,KACfwH,EAAmB,EAAfjN,EAAIsK,MAAM5E,IACF4H,GACG,SAAa,EAC5BA,EAAY,SAAJvC,EAEV7N,EAAIoN,MAAM8C,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFjQ,EAAIoN,MAAM8C,GAAa,EAARD,EAEfjQ,EAAIxB,SAGCwB,EAAIyjB,SA/oBb1W,EAAG5P,UAAUgM,SAAW,SAAmBzM,EAAM4T,GAI/C,IAAItQ,EACJ,GAHAsQ,EAAoB,EAAVA,GAAe,EAGZ,MAJb5T,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCsD,EAAM,GAGN,IAFA,IAAI2O,EAAM,EACNsB,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,EAAIxR,KAAKkQ,MAAM7E,GACf0G,GAA+B,UAArBP,GAAKC,EAAOsB,IAAmB9G,SAAS,IAGpDnJ,EADY,IADdiQ,EAASvB,IAAO,GAAKC,EAAQ,WACVpG,IAAMrL,KAAKsB,OAAS,EAC/BiR,EAAM,EAAIR,EAAKzQ,QAAUyQ,EAAOjP,EAEhCiP,EAAOjP,GAEf2O,GAAO,IACI,KACTA,GAAO,GACPpG,KAMJ,IAHc,IAAV0H,IACFjQ,EAAMiQ,EAAM9G,SAAS,IAAMnJ,GAEtBA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGT,GAAItD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI6T,EAAYb,EAAWhT,GAEvB8T,EAAYb,EAAWjT,GAC3BsD,EAAM,GACN,IAAI0N,EAAIxQ,KAAK2E,QAEb,IADA6L,EAAEP,SAAW,GACLO,EAAE+C,UAAU,CAClB,IAAI5C,EAAIH,EAAEunC,MAAMzkC,GAAWrH,SAASzM,GAMlCsD,GALF0N,EAAIA,EAAEiD,MAAMH,IAELC,SAGC5C,EAAI7N,EAFJyP,EAAMc,EAAY1C,EAAErP,QAAUqP,EAAI7N,EAQ5C,IAHI9C,KAAKuT,WACPzQ,EAAM,IAAMA,GAEPA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGTM,GAAO,EAAO,oCAGhByM,EAAG5P,UAAUyT,SAAW,WACtB,IAAIC,EAAM3T,KAAKkQ,MAAM,GASrB,OARoB,IAAhBlQ,KAAKsB,OACPqS,GAAuB,SAAhB3T,KAAKkQ,MAAM,GACO,IAAhBlQ,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,GAEzCyD,GAAO,iBAAoC,SAAhB3T,KAAKkQ,MAAM,GAC7BlQ,KAAKsB,OAAS,GACvB8B,GAAO,EAAO,8CAEU,IAAlBpD,KAAKiQ,UAAmB0D,EAAMA,GAGxC9D,EAAG5P,UAAU2T,OAAS,WACpB,OAAO5T,KAAKiM,SAAS,GAAI,IAGvB/K,IACF2O,EAAG5P,UAAU4T,SAAW,SAAmB9D,EAAQzO,GACjD,OAAOtB,KAAK8T,YAAY5S,EAAQ6O,EAAQzO,KAI5CuO,EAAG5P,UAAUiP,QAAU,SAAkBa,EAAQzO,GAC/C,OAAOtB,KAAK8T,YAAYpS,MAAOqO,EAAQzO,IAUzCuO,EAAG5P,UAAU6T,YAAc,SAAsBC,EAAWhE,EAAQzO,GAClEtB,KAAKumB,SAEL,IAAIxkB,EAAa/B,KAAK+B,aAClBiS,EAAY1S,GAAUwP,KAAKC,IAAI,EAAGhP,GACtCqB,EAAOrB,GAAciS,EAAW,yCAChC5Q,EAAO4Q,EAAY,EAAG,+BAEtB,IAAIxR,EAfS,SAAmBuR,EAAWnV,GAC3C,OAAImV,EAAUq2B,YACLr2B,EAAUq2B,YAAYxrC,GAExB,IAAImV,EAAUnV,GAWXo5C,CAASjkC,EAAWC,GAG9B,OADAhU,KAAK,gBADoB,OAAX+P,EAAkB,KAAO,OACRvN,EAAKT,GAC7BS,GAGTqN,EAAG5P,UAAUg4C,eAAiB,SAAyBz1C,EAAKT,GAI1D,IAHA,IAAI62B,EAAW,EACX7lB,EAAQ,EAEH1H,EAAI,EAAGsV,EAAQ,EAAGtV,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAC/C,IAAI0G,EAAQ/R,KAAKkQ,MAAM7E,IAAMsV,EAAS5N,EAEtCvQ,EAAIo2B,KAAqB,IAAP7mB,EACd6mB,EAAWp2B,EAAIlB,SACjBkB,EAAIo2B,KAAe7mB,GAAQ,EAAK,KAE9B6mB,EAAWp2B,EAAIlB,SACjBkB,EAAIo2B,KAAe7mB,GAAQ,GAAM,KAGrB,IAAV4O,GACEiY,EAAWp2B,EAAIlB,SACjBkB,EAAIo2B,KAAe7mB,GAAQ,GAAM,KAEnCgB,EAAQ,EACR4N,EAAQ,IAER5N,EAAQhB,IAAS,GACjB4O,GAAS,GAIb,GAAIiY,EAAWp2B,EAAIlB,OAGjB,IAFAkB,EAAIo2B,KAAc7lB,EAEX6lB,EAAWp2B,EAAIlB,QACpBkB,EAAIo2B,KAAc,GAKxB/oB,EAAG5P,UAAUi4C,eAAiB,SAAyB11C,EAAKT,GAI1D,IAHA,IAAI62B,EAAWp2B,EAAIlB,OAAS,EACxByR,EAAQ,EAEH1H,EAAI,EAAGsV,EAAQ,EAAGtV,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAC/C,IAAI0G,EAAQ/R,KAAKkQ,MAAM7E,IAAMsV,EAAS5N,EAEtCvQ,EAAIo2B,KAAqB,IAAP7mB,EACd6mB,GAAY,IACdp2B,EAAIo2B,KAAe7mB,GAAQ,EAAK,KAE9B6mB,GAAY,IACdp2B,EAAIo2B,KAAe7mB,GAAQ,GAAM,KAGrB,IAAV4O,GACEiY,GAAY,IACdp2B,EAAIo2B,KAAe7mB,GAAQ,GAAM,KAEnCgB,EAAQ,EACR4N,EAAQ,IAER5N,EAAQhB,IAAS,GACjB4O,GAAS,GAIb,GAAIiY,GAAY,EAGd,IAFAp2B,EAAIo2B,KAAc7lB,EAEX6lB,GAAY,GACjBp2B,EAAIo2B,KAAc,GAKpB9nB,KAAKuD,MACPxE,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,OAAO,GAAKV,KAAKuD,MAAM7C,IAGzB3B,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,IAAI+C,EAAI/C,EACJb,EAAI,EAiBR,OAhBI4D,GAAK,OACP5D,GAAK,GACL4D,KAAO,IAELA,GAAK,KACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAEF5D,EAAI4D,GAIf1E,EAAG5P,UAAUuU,UAAY,SAAoBhD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAI+C,EAAI/C,EACJb,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ4D,KACH5D,GAAK,GACL4D,KAAO,IAEU,IAAV,IAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,GAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,IACH5D,IAEKA,GAITd,EAAG5P,UAAUwU,UAAY,WACvB,IAAIjD,EAAIxR,KAAKkQ,MAAMlQ,KAAKsB,OAAS,GAC7BoT,EAAK1U,KAAKsU,WAAW9C,GACzB,OAA2B,IAAnBxR,KAAKsB,OAAS,GAAUoT,GAiBlC7E,EAAG5P,UAAU0U,SAAW,WACtB,GAAI3U,KAAKuT,SAAU,OAAO,EAG1B,IADA,IAAI5C,EAAI,EACCtF,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAIwH,EAAI7S,KAAKwU,UAAUxU,KAAKkQ,MAAM7E,IAElC,GADAsF,GAAKkC,EACK,KAANA,EAAU,MAEhB,OAAOlC,GAGTd,EAAG5P,UAAU8B,WAAa,WACxB,OAAO+O,KAAKS,KAAKvR,KAAKyU,YAAc,IAGtC5E,EAAG5P,UAAU2U,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7U,KAAKiQ,SACAjQ,KAAK8U,MAAMC,MAAMF,GAAOG,MAAM,GAEhChV,KAAK2E,SAGdkL,EAAG5P,UAAUgV,SAAW,SAAmBJ,GACzC,OAAI7U,KAAKkV,MAAML,EAAQ,GACd7U,KAAKmV,KAAKN,GAAOG,MAAM,GAAGI,OAE5BpV,KAAK2E,SAGdkL,EAAG5P,UAAUoV,MAAQ,WACnB,OAAyB,IAAlBrV,KAAKiQ,UAIdJ,EAAG5P,UAAUqV,IAAM,WACjB,OAAOtV,KAAK2E,QAAQyQ,QAGtBvF,EAAG5P,UAAUmV,KAAO,WAKlB,OAJKpV,KAAKuT,WACRvT,KAAKiQ,UAAY,GAGZjQ,MAIT6P,EAAG5P,UAAUsV,KAAO,SAAe3P,GACjC,KAAO5F,KAAKsB,OAASsE,EAAItE,QACvBtB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAG9B,IAAK,IAAI+J,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAC9BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAG5C,OAAOrL,KAAKumB,UAGd1W,EAAG5P,UAAUuV,IAAM,SAAc5P,GAE/B,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAKuV,KAAK3P,IAInBiK,EAAG5P,UAAUwV,GAAK,SAAa7P,GAC7B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6Q,IAAI5P,GAC/CA,EAAIjB,QAAQ6Q,IAAIxV,OAGzB6P,EAAG5P,UAAUyV,IAAM,SAAc9P,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ4Q,KAAK3P,GAChDA,EAAIjB,QAAQ4Q,KAAKvV,OAI1B6P,EAAG5P,UAAU0V,MAAQ,SAAgB/P,GAEnC,IAAIiN,EAEFA,EADE7S,KAAKsB,OAASsE,EAAItE,OAChBsE,EAEA5F,KAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAK5C,OAFArL,KAAKsB,OAASuR,EAAEvR,OAETtB,KAAKumB,UAGd1W,EAAG5P,UAAU2V,KAAO,SAAehQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK2V,MAAM/P,IAIpBiK,EAAG5P,UAAU4V,IAAM,SAAcjQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQiR,KAAKhQ,GAChDA,EAAIjB,QAAQiR,KAAK5V,OAG1B6P,EAAG5P,UAAU6V,KAAO,SAAelQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQgR,MAAM/P,GACjDA,EAAIjB,QAAQgR,MAAM3V,OAI3B6P,EAAG5P,UAAU8V,MAAQ,SAAgBnQ,GAEnC,IAAIgN,EACAC,EACA7S,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAAKwH,EAAE3C,MAAM7E,GAGvC,GAAIrL,OAAS4S,EACX,KAAOvH,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAM5B,OAFArL,KAAKsB,OAASsR,EAAEtR,OAETtB,KAAKumB,UAGd1W,EAAG5P,UAAU+V,KAAO,SAAepQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK+V,MAAMnQ,IAIpBiK,EAAG5P,UAAUgW,IAAM,SAAcrQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQqR,KAAKpQ,GAChDA,EAAIjB,QAAQqR,KAAKhW,OAG1B6P,EAAG5P,UAAUiW,KAAO,SAAetQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQoR,MAAMnQ,GACjDA,EAAIjB,QAAQoR,MAAM/V,OAI3B6P,EAAG5P,UAAU8U,MAAQ,SAAgBF,GACnCzR,EAAwB,iBAAVyR,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBrF,KAAKS,KAAKsD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7U,KAAKoS,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAa9K,IAC/BrL,KAAKkQ,MAAM7E,GAAsB,UAAhBrL,KAAKkQ,MAAM7E,GAS9B,OALI+K,EAAW,IACbpW,KAAKkQ,MAAM7E,IAAMrL,KAAKkQ,MAAM7E,GAAM,UAAc,GAAK+K,GAIhDpW,KAAKumB,UAGd1W,EAAG5P,UAAUkV,KAAO,SAAeN,GACjC,OAAO7U,KAAK2E,QAAQoQ,MAAMF,IAI5BhF,EAAG5P,UAAUoW,KAAO,SAAeC,EAAK3Q,GACtCvC,EAAsB,iBAARkT,GAAoBA,GAAO,GAEzC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtW,KAAKoS,QAAQX,EAAM,GAGjBzR,KAAKkQ,MAAMuB,GADT9L,EACgB3F,KAAKkQ,MAAMuB,GAAQ,GAAK8E,EAExBvW,KAAKkQ,MAAMuB,KAAS,GAAK8E,GAGtCvW,KAAKumB,UAId1W,EAAG5P,UAAUuW,KAAO,SAAe5Q,GACjC,IAAI+K,EAkBAiC,EAAGC,EAfP,GAAsB,IAAlB7S,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAI7B,OAHAjQ,KAAKiQ,SAAW,EAChBU,EAAI3Q,KAAKyW,KAAK7Q,GACd5F,KAAKiQ,UAAY,EACVjQ,KAAKqS,YAGP,GAAsB,IAAlBrS,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAIpC,OAHArK,EAAIqK,SAAW,EACfU,EAAI3Q,KAAKyW,KAAK7Q,GACdA,EAAIqK,SAAW,EACRU,EAAE0B,YAKPrS,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,EAC1C/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAEhB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAClCsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,EACvB/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAIhB,GADA3Q,KAAKsB,OAASsR,EAAEtR,OACF,IAAVyR,EACF/S,KAAKkQ,MAAMlQ,KAAKsB,QAAUyR,EAC1B/S,KAAKsB,cAEA,GAAIsR,IAAM5S,KACf,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAI5B,OAAOrL,MAIT6P,EAAG5P,UAAUyW,IAAM,SAAc9Q,GAC/B,IAAIpD,EACJ,OAAqB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UAC7BrK,EAAIqK,SAAW,EACfzN,EAAMxC,KAAK2W,IAAI/Q,GACfA,EAAIqK,UAAY,EACTzN,GACmB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UACpCjQ,KAAKiQ,SAAW,EAChBzN,EAAMoD,EAAI+Q,IAAI3W,MACdA,KAAKiQ,SAAW,EACTzN,GAGLxC,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6R,KAAK5Q,GAEhDA,EAAIjB,QAAQ6R,KAAKxW,OAI1B6P,EAAG5P,UAAUwW,KAAO,SAAe7Q,GAEjC,GAAqB,IAAjBA,EAAIqK,SAAgB,CACtBrK,EAAIqK,SAAW,EACf,IAAIU,EAAI3Q,KAAKwW,KAAK5Q,GAElB,OADAA,EAAIqK,SAAW,EACRU,EAAE0B,YAGJ,GAAsB,IAAlBrS,KAAKiQ,SAId,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKwW,KAAK5Q,GACV5F,KAAKiQ,SAAW,EACTjQ,KAAKqS,YAId,IAWIO,EAAGC,EAXH3B,EAAMlR,KAAKkR,IAAItL,GAGnB,GAAY,IAARsL,EAIF,OAHAlR,KAAKiQ,SAAW,EAChBjQ,KAAKsB,OAAS,EACdtB,KAAKkQ,MAAM,GAAK,EACTlQ,KAKLkR,EAAM,GACR0B,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAE5B0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,IAC7B,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAElB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAElC0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,IACV,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAIlB,GAAc,IAAVoC,GAAe1H,EAAIuH,EAAEtR,QAAUsR,IAAM5S,KACvC,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAU5B,OANArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,GAEhCuH,IAAM5S,OACRA,KAAKiQ,SAAW,GAGXjQ,KAAKumB,UAId1W,EAAG5P,UAAU0W,IAAM,SAAc/Q,GAC/B,OAAO5F,KAAK2E,QAAQ8R,KAAK7Q,IA+C3B,IAAIgR,EAAc,SAAsBjE,EAAM/M,EAAK9C,GACjD,IAIIgQ,EACA+D,EACAnC,EANA9B,EAAID,EAAKzC,MACT2C,EAAIjN,EAAIsK,MACR4G,EAAIhU,EAAIoN,MACRM,EAAI,EAIJuG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnG,EAAE,GACPoG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtG,EAAE,GACPuG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzG,EAAE,GACP0G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5G,EAAE,GACP6G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP/G,EAAE,GACPgH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlH,EAAE,GACPmH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrH,EAAE,GACPsH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxH,EAAE,GACPyH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3H,EAAE,GACP4H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB1X,EAAImN,SAAW0C,EAAK1C,SAAWrK,EAAIqK,SACnCnN,EAAIxB,OAAS,GAMb,IAAIqZ,IAAQnK,GAJZsC,EAAKhC,KAAK8J,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM/F,KAAK8J,KAAK5D,EAAK+B,IACRjI,KAAK8J,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDtI,IAFAkE,EAAK5D,KAAK8J,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKhC,KAAK8J,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKzD,EAAK4B,IACRjI,KAAK8J,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQrK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKkC,GAAQ,GACvBpI,KAAK8J,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDzI,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKhC,KAAK8J,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKtD,EAAKyB,IACRjI,KAAK8J,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKrD,EAAKwB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK+B,GAAQ,GACvBpI,KAAK8J,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQtK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKqC,GAAQ,GACvBvI,KAAK8J,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD5I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKhC,KAAK8J,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKnD,EAAKsB,IACRjI,KAAK8J,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKlD,EAAKqB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK4B,GAAQ,GACvBpI,KAAK8J,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKkC,GAAQ,GACvBvI,KAAK8J,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQvK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKwC,GAAQ,GACvB1I,KAAK8J,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD/I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKhC,KAAK8J,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKhD,EAAKmB,IACRjI,KAAK8J,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK/C,EAAKkB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKyB,GAAQ,GACvBpI,KAAK8J,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK+B,GAAQ,GACvBvI,KAAK8J,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKqC,GAAQ,GACvB1I,KAAK8J,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQxK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK2C,IAAQ,GACvB7I,KAAK8J,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDlJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKhC,KAAK8J,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK7C,EAAKgB,IACRjI,KAAK8J,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK5C,EAAKe,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKsB,GAAQ,GACvBpI,KAAK8J,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK4B,GAAQ,GACvBvI,KAAK8J,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKkC,GAAQ,GACvB1I,KAAK8J,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKiC,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKwC,IAAQ,GACvB7I,KAAK8J,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQzK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK8C,IAAQ,GACvBhJ,KAAK8J,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDrJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKhC,KAAK8J,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK1C,EAAKa,IACRjI,KAAK8J,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKzC,EAAKY,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKmB,GAAQ,GACvBpI,KAAK8J,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKyB,GAAQ,GACvBvI,KAAK8J,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK+B,GAAQ,GACvB1I,KAAK8J,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK8B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKqC,IAAQ,GACvB7I,KAAK8J,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK2C,IAAQ,GACvBhJ,KAAK8J,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ1K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKiD,IAAQ,GACvBnJ,KAAK8J,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDxJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKhC,KAAK8J,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKvC,EAAKU,IACRjI,KAAK8J,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKtC,EAAKS,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKgB,GAAQ,GACvBpI,KAAK8J,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKsB,GAAQ,GACvBvI,KAAK8J,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK4B,GAAQ,GACvB1I,KAAK8J,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK2B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKkC,IAAQ,GACvB7I,KAAK8J,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKwC,IAAQ,GACvBhJ,KAAK8J,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK8C,IAAQ,GACvBnJ,KAAK8J,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ3K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKoD,IAAQ,GACvBtJ,KAAK8J,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD3J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKhC,KAAK8J,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKpC,EAAKO,IACRjI,KAAK8J,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKnC,EAAKM,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKa,GAAQ,GACvBpI,KAAK8J,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKmB,GAAQ,GACvBvI,KAAK8J,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKyB,GAAQ,GACvB1I,KAAK8J,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKwB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK+B,IAAQ,GACvB7I,KAAK8J,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKqC,IAAQ,GACvBhJ,KAAK8J,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKoC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK2C,IAAQ,GACvBnJ,KAAK8J,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKiD,IAAQ,GACvBtJ,KAAK8J,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ5K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKuD,IAAQ,GACvBzJ,KAAK8J,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD9J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKhC,KAAK8J,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKI,IACRjI,KAAK8J,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKhC,EAAKG,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKU,GAAQ,GACvBpI,KAAK8J,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKS,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKgB,GAAQ,GACvBvI,KAAK8J,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKsB,GAAQ,GACvB1I,KAAK8J,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKqB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK4B,IAAQ,GACvB7I,KAAK8J,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKkC,IAAQ,GACvBhJ,KAAK8J,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKwC,IAAQ,GACvBnJ,KAAK8J,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK8C,IAAQ,GACvBtJ,KAAK8J,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK6C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKoD,IAAQ,GACvBzJ,KAAK8J,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQ7K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK0D,IAAQ,GACvB5J,KAAK8J,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKhC,KAAK8J,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKO,IACRpI,KAAK8J,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK5D,KAAK8J,KAAKhC,EAAKM,GACpBpG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKa,GAAQ,GACvBvI,KAAK8J,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKY,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKmB,GAAQ,GACvB1I,KAAK8J,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKkB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKyB,IAAQ,GACvB7I,KAAK8J,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK+B,IAAQ,GACvBhJ,KAAK8J,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK8B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKqC,IAAQ,GACvBnJ,KAAK8J,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK2C,IAAQ,GACvBtJ,KAAK8J,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK0C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKiD,IAAQ,GACvBzJ,KAAK8J,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS9K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKuD,IAAQ,GACvB5J,KAAK8J,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKhC,KAAK8J,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKU,IACRvI,KAAK8J,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK5D,KAAK8J,KAAKhC,EAAKS,GACpBvG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKgB,GAAQ,GACvB1I,KAAK8J,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKe,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKsB,IAAQ,GACvB7I,KAAK8J,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK4B,IAAQ,GACvBhJ,KAAK8J,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKkC,IAAQ,GACvBnJ,KAAK8J,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKwC,IAAQ,GACvBtJ,KAAK8J,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKuC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK8C,IAAQ,GACvBzJ,KAAK8J,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS/K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKoD,IAAQ,GACvB5J,KAAK8J,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKhC,KAAK8J,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKa,IACR1I,KAAK8J,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK5D,KAAK8J,KAAKhC,EAAKY,GACpB1G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKmB,IAAQ,GACvB7I,KAAK8J,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKkB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKyB,IAAQ,GACvBhJ,KAAK8J,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK+B,IAAQ,GACvBnJ,KAAK8J,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKqC,IAAQ,GACvBtJ,KAAK8J,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKoC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK2C,IAAQ,GACvBzJ,KAAK8J,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAShL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKiD,IAAQ,GACvB5J,KAAK8J,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKhC,KAAK8J,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKgB,KACR7I,KAAK8J,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK5D,KAAK8J,KAAKhC,EAAKe,IACpB7G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKsB,IAAQ,GACvBhJ,KAAK8J,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKqB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK4B,IAAQ,GACvBnJ,KAAK8J,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKkC,IAAQ,GACvBtJ,KAAK8J,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKiC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKwC,IAAQ,GACvBzJ,KAAK8J,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASjL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK8C,IAAQ,GACvB5J,KAAK8J,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKhC,KAAK8J,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKmB,KACRhJ,KAAK8J,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK5D,KAAK8J,KAAKhC,EAAKkB,IACpBhH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKyB,IAAQ,GACvBnJ,KAAK8J,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKwB,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK+B,IAAQ,GACvBtJ,KAAK8J,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK8B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKqC,IAAQ,GACvBzJ,KAAK8J,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASlL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK2C,IAAQ,GACvB5J,KAAK8J,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKhC,KAAK8J,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKsB,KACRnJ,KAAK8J,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK5D,KAAK8J,KAAKhC,EAAKqB,IACpBnH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK4B,IAAQ,GACvBtJ,KAAK8J,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK2B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKkC,IAAQ,GACvBzJ,KAAK8J,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASnL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKwC,IAAQ,GACvB5J,KAAK8J,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKhC,KAAK8J,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKyB,KACRtJ,KAAK8J,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK5D,KAAK8J,KAAKhC,EAAKwB,IACpBtH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK+B,IAAQ,GACvBzJ,KAAK8J,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASpL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKqC,IAAQ,GACvB5J,KAAK8J,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKhC,KAAK8J,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK4B,KACRzJ,KAAK8J,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK5D,KAAK8J,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASrL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKkC,IAAQ,GACvB5J,KAAK8J,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAStL,GAJbsC,EAAKhC,KAAK8J,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK+B,KACR5J,KAAK8J,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAjK,IAFAkE,EAAK5D,KAAK8J,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANtL,IACFsG,EAAE,IAAMtG,EACR1N,EAAIxB,UAECwB,GAQT,SAASwZ,EAAU3J,EAAM/M,EAAK9C,GAC5BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnCnN,EAAIxB,OAASqR,EAAKrR,OAASsE,EAAItE,OAI/B,IAFA,IAAIyR,EAAQ,EACRsJ,EAAU,EACLrJ,EAAI,EAAGA,EAAIlQ,EAAIxB,OAAS,EAAG0R,IAAK,CAGvC,IAAIC,EAASoJ,EACbA,EAAU,EAGV,IAFA,IAAInJ,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAI2H,EAAI1H,EAGRqF,GAFoB,EAAhBgC,EAAKzC,MAAM7E,KACI,EAAfzF,EAAIsK,MAAM5E,IAGdwH,EAAS,SAAJnC,EAGTuC,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBmJ,IAFApJ,GAHAA,EAAUA,GAAWtC,EAAI,SAAa,GAAM,IAGxBmC,IAAO,IAAO,KAEZ,GACtBG,GAAU,SAEZnQ,EAAIoN,MAAM8C,GAAKE,EACfH,EAAQE,EACRA,EAASoJ,EAQX,OANc,IAAVtJ,EACFjQ,EAAIoN,MAAM8C,GAAKD,EAEfjQ,EAAIxB,SAGCwB,EAAIyjB,SAGb,SAASxK,EAAYpJ,EAAM/M,EAAK9C,GAI9B,OAAOwZ,EAAS3J,EAAM/M,EAAK9C,GAsB7B,SAASkZ,EAAME,EAAGC,GAChBnc,KAAKkc,EAAIA,EACTlc,KAAKmc,EAAIA,EAzENrL,KAAK8J,OACRhE,EAAclE,GAmDhB7C,EAAG5P,UAAUmc,MAAQ,SAAgBxW,EAAK9C,GACxC,IACIsI,EAAMpL,KAAKsB,OAASsE,EAAItE,OAW5B,OAVoB,KAAhBtB,KAAKsB,QAAgC,KAAfsE,EAAItE,OACtBsV,EAAY5W,KAAM4F,EAAK9C,GACpBsI,EAAM,GACTsH,EAAW1S,KAAM4F,EAAK9C,GACnBsI,EAAM,KACTkR,EAAStc,KAAM4F,EAAK9C,GAEpBiZ,EAAW/b,KAAM4F,EAAK9C,IAchCkZ,EAAK/b,UAAUsc,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAI7S,MAAM8a,GACdC,EAAI5M,EAAG5P,UAAUqU,WAAWkI,GAAK,EAC5BnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBkJ,EAAElJ,GAAKrL,KAAK0c,OAAOrR,EAAGoR,EAAGD,GAG3B,OAAOjI,GAITyH,EAAK/b,UAAUyc,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAtR,EAAI,EAAGA,EAAIoR,EAAGpR,IACrBsR,IAAW,EAAJT,IAAWO,EAAIpR,EAAI,EAC1B6Q,IAAM,EAGR,OAAOS,GAKTX,EAAK/b,UAAU2c,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAGnR,IACrB2R,EAAK3R,GAAKyR,EAAID,EAAIxR,IAClB4R,EAAK5R,GAAK0R,EAAIF,EAAIxR,KAItB2Q,EAAK/b,UAAUid,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE7c,KAAK4c,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQtM,KAAKuM,IAAI,EAAIvM,KAAKwM,GAAKb,GAC/Bc,EAAQzM,KAAK0M,IAAI,EAAI1M,KAAKwM,GAAKb,GAE1BjN,EAAI,EAAGA,EAAIgN,EAAGhN,GAAKiN,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJjS,EAAI,EAAGA,EAAI6R,EAAG7R,IAAK,CAC1B,IAAImC,EAAKuP,EAAKxN,EAAIlE,GACdqS,EAAKV,EAAKzN,EAAIlE,GAEdsS,EAAKZ,EAAKxN,EAAIlE,EAAI6R,GAClBU,EAAKZ,EAAKzN,EAAIlE,EAAI6R,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAKxN,EAAIlE,GAAKmC,EAAKmQ,EACnBX,EAAKzN,EAAIlE,GAAKqS,EAAKE,EAEnBb,EAAKxN,EAAIlE,EAAI6R,GAAK1P,EAAKmQ,EACvBX,EAAKzN,EAAIlE,EAAI6R,GAAKQ,EAAKE,EAGnBvS,IAAMmR,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB9B,EAAK/b,UAAU8d,YAAc,SAAsBC,EAAGjf,GACpD,IAAIyd,EAAqB,EAAjB1L,KAAKC,IAAIhS,EAAGif,GAChBC,EAAU,EAAJzB,EACNnR,EAAI,EACR,IAAKmR,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BnR,IAGF,OAAO,GAAKA,EAAI,EAAI4S,GAGtBjC,EAAK/b,UAAUie,UAAY,SAAoBpB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAIkJ,EAAIuI,EAAIzR,GAEZyR,EAAIzR,GAAKyR,EAAIN,EAAInR,EAAI,GACrByR,EAAIN,EAAInR,EAAI,GAAKkJ,EAEjBA,EAAIwI,EAAI1R,GAER0R,EAAI1R,IAAM0R,EAAIP,EAAInR,EAAI,GACtB0R,EAAIP,EAAInR,EAAI,IAAMkJ,IAItByH,EAAK/b,UAAUke,aAAe,SAAuBC,EAAI5B,GAEvD,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAImG,EAAoC,KAAhCV,KAAKuN,MAAMD,EAAG,EAAI/S,EAAI,GAAKmR,GACjC1L,KAAKuN,MAAMD,EAAG,EAAI/S,GAAKmR,GACvBzJ,EAEFqL,EAAG/S,GAAS,SAAJmG,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO4M,GAGTpC,EAAK/b,UAAUqe,WAAa,SAAqBF,EAAIhT,EAAK0R,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAID,EAAKC,IACvB0H,GAAyB,EAARqL,EAAG/S,GAEpByR,EAAI,EAAIzR,GAAa,KAAR0H,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAIzR,EAAI,GAAa,KAAR0H,EAAgBA,KAAkB,GAIrD,IAAK1H,EAAI,EAAID,EAAKC,EAAImR,IAAKnR,EACzByR,EAAIzR,GAAK,EAGXjI,EAAiB,IAAV2P,GACP3P,EAA6B,KAAb,KAAR2P,KAGViJ,EAAK/b,UAAUse,KAAO,SAAe/B,GAEnC,IADA,IAAIgC,EAAK,IAAI9c,MAAM8a,GACVnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBmT,EAAGnT,GAAK,EAGV,OAAOmT,GAGTxC,EAAK/b,UAAUgc,KAAO,SAAeC,EAAGC,EAAGrZ,GACzC,IAAI0Z,EAAI,EAAIxc,KAAK+d,YAAY7B,EAAE5a,OAAQ6a,EAAE7a,QAErCub,EAAM7c,KAAKuc,QAAQC,GAEnBiC,EAAIze,KAAKue,KAAK/B,GAEdM,EAAM,IAAIpb,MAAM8a,GAChBkC,EAAO,IAAIhd,MAAM8a,GACjBmC,EAAO,IAAIjd,MAAM8a,GAEjBoC,EAAO,IAAIld,MAAM8a,GACjBqC,EAAQ,IAAInd,MAAM8a,GAClBsC,EAAQ,IAAIpd,MAAM8a,GAElBuC,EAAOjc,EAAIoN,MACf6O,EAAKzd,OAASkb,EAEdxc,KAAKse,WAAWpC,EAAEhM,MAAOgM,EAAE5a,OAAQwb,EAAKN,GACxCxc,KAAKse,WAAWnC,EAAEjM,MAAOiM,EAAE7a,OAAQsd,EAAMpC,GAEzCxc,KAAKkd,UAAUJ,EAAK2B,EAAGC,EAAMC,EAAMnC,EAAGK,GACtC7c,KAAKkd,UAAU0B,EAAMH,EAAGI,EAAOC,EAAOtC,EAAGK,GAEzC,IAAK,IAAIxR,EAAI,EAAGA,EAAImR,EAAGnR,IAAK,CAC1B,IAAIyS,EAAKY,EAAKrT,GAAKwT,EAAMxT,GAAKsT,EAAKtT,GAAKyT,EAAMzT,GAC9CsT,EAAKtT,GAAKqT,EAAKrT,GAAKyT,EAAMzT,GAAKsT,EAAKtT,GAAKwT,EAAMxT,GAC/CqT,EAAKrT,GAAKyS,EAUZ,OAPA9d,KAAKke,UAAUQ,EAAMC,EAAMnC,GAC3Bxc,KAAKkd,UAAUwB,EAAMC,EAAMI,EAAMN,EAAGjC,EAAGK,GACvC7c,KAAKke,UAAUa,EAAMN,EAAGjC,GACxBxc,KAAKme,aAAaY,EAAMvC,GAExB1Z,EAAImN,SAAWiM,EAAEjM,SAAWkM,EAAElM,SAC9BnN,EAAIxB,OAAS4a,EAAE5a,OAAS6a,EAAE7a,OACnBwB,EAAIyjB,UAIb1W,EAAG5P,UAAU4Q,IAAM,SAAcjL,GAC/B,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCtB,KAAKoc,MAAMxW,EAAK9C,IAIzB+M,EAAG5P,UAAU+e,KAAO,SAAepZ,GACjC,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCya,EAAW/b,KAAM4F,EAAK9C,IAI/B+M,EAAG5P,UAAU2a,KAAO,SAAehV,GACjC,OAAO5F,KAAK2E,QAAQyX,MAAMxW,EAAK5F,OAGjC6P,EAAG5P,UAAU+R,MAAQ,SAAgBpM,GACnC,IAAIuyC,EAAWvyC,EAAM,EACjBuyC,IAAUvyC,GAAOA,GAErBxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UAIb,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAUzF,EAC1BkN,GAAU,SAAJtB,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASD,IAAO,GAChB9S,KAAKkQ,MAAM7E,GAAU,SAALyH,EAQlB,OALc,IAAVC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAGA62C,EAAWn4C,KAAKoV,OAASpV,MAGlC6P,EAAG5P,UAAUgf,KAAO,SAAerZ,GACjC,OAAO5F,KAAK2E,QAAQqN,MAAMpM,IAI5BiK,EAAG5P,UAAUif,IAAM,WACjB,OAAOlf,KAAK6Q,IAAI7Q,OAIlB6P,EAAG5P,UAAUkf,KAAO,WAClB,OAAOnf,KAAK4a,KAAK5a,KAAK2E,UAIxBkL,EAAG5P,UAAUiS,IAAM,SAActM,GAC/B,IAAI4L,EA7xCN,SAAqB5L,GAGnB,IAFA,IAAI4L,EAAI,IAAI9P,MAAMkE,EAAI6O,aAEb6B,EAAM,EAAGA,EAAM9E,EAAElQ,OAAQgV,IAAO,CACvC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB9E,EAAE8E,GAAQ1Q,EAAIsK,MAAMuB,KAAS8E,EAAQ,EAGvC,OAAO/E,EAmxCC4N,CAAWxZ,GACnB,GAAiB,IAAb4L,EAAElQ,OAAc,OAAO,IAAIuO,EAAG,GAIlC,IADA,IAAIrN,EAAMxC,KACDqL,EAAI,EAAGA,EAAImG,EAAElQ,QACP,IAATkQ,EAAEnG,GADsBA,IAAK7I,EAAMA,EAAI0c,OAI7C,KAAM7T,EAAImG,EAAElQ,OACV,IAAK,IAAI4S,EAAI1R,EAAI0c,MAAO7T,EAAImG,EAAElQ,OAAQ+J,IAAK6I,EAAIA,EAAEgL,MAClC,IAAT1N,EAAEnG,KAEN7I,EAAMA,EAAIqO,IAAIqD,IAIlB,OAAO1R,GAITqN,EAAG5P,UAAUof,OAAS,SAAiBC,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAGIjU,EAHAsF,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GACjB4O,EAAa,WAAe,GAAK5O,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoC,EAAQ,EAEZ,IAAK1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAChC,IAAImU,EAAWxf,KAAKkQ,MAAM7E,GAAKkU,EAC3B/O,GAAsB,EAAhBxQ,KAAKkQ,MAAM7E,IAAUmU,GAAa7O,EAC5C3Q,KAAKkQ,MAAM7E,GAAKmF,EAAIuC,EACpBA,EAAQyM,IAAc,GAAK7O,EAGzBoC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAIT,GAAU,IAAN6b,EAAS,CACX,IAAK9R,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAChCrL,KAAKkQ,MAAM7E,EAAI8R,GAAKnd,KAAKkQ,MAAM7E,GAGjC,IAAKA,EAAI,EAAGA,EAAI8R,EAAG9R,IACjBrL,KAAKkQ,MAAM7E,GAAK,EAGlBrL,KAAKsB,QAAU6b,EAGjB,OAAOnd,KAAKumB,UAGd1W,EAAG5P,UAAUwf,MAAQ,SAAgBH,GAGnC,OADAlc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKqf,OAAOC,IAMrBzP,EAAG5P,UAAUmU,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJxc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/O,EAAI2O,EAAO,GACXnC,EAAIrM,KAAK/D,KAAKuS,EAAO3O,GAAK,GAAI3Q,KAAKsB,QACnCue,EAAO,SAAc,WAAclP,GAAMA,EACzCmP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAI9O,KAAKC,IAAI,EAAG6O,GAGZE,EAAa,CACf,IAAK,IAAIzU,EAAI,EAAGA,EAAI8R,EAAG9R,IACrByU,EAAY5P,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAEpCyU,EAAYxe,OAAS6b,EAGvB,GAAU,IAANA,QAEG,GAAInd,KAAKsB,OAAS6b,EAEvB,IADAnd,KAAKsB,QAAU6b,EACV9R,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC3BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,EAAI8R,QAGjCnd,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,EAGhB,IAAIyR,EAAQ,EACZ,IAAK1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,IAAgB,IAAV0H,GAAe1H,GAAKuU,GAAIvU,IAAK,CAChE,IAAI0G,EAAuB,EAAhB/R,KAAKkQ,MAAM7E,GACtBrL,KAAKkQ,MAAM7E,GAAM0H,GAAU,GAAKpC,EAAOoB,IAASpB,EAChDoC,EAAQhB,EAAO8N,EAajB,OATIC,GAAyB,IAAV/M,IACjB+M,EAAY5P,MAAM4P,EAAYxe,UAAYyR,GAGxB,IAAhB/S,KAAKsB,SACPtB,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,GAGTtB,KAAKumB,UAGd1W,EAAG5P,UAAU8f,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAvc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKoU,OAAOkL,EAAMI,EAAMC,IAIjC9P,EAAG5P,UAAU+f,KAAO,SAAeV,GACjC,OAAOtf,KAAK2E,QAAQ8a,MAAMH,IAG5BzP,EAAG5P,UAAUggB,MAAQ,SAAgBX,GACnC,OAAOtf,KAAK2E,QAAQ0a,OAAOC,IAI7BzP,EAAG5P,UAAUigB,KAAO,SAAeZ,GACjC,OAAOtf,KAAK2E,QAAQob,MAAMT,IAG5BzP,EAAG5P,UAAUkgB,MAAQ,SAAgBb,GACnC,OAAOtf,KAAK2E,QAAQyP,OAAOkL,IAI7BzP,EAAG5P,UAAUiV,MAAQ,SAAgBoB,GACnClT,EAAsB,iBAARkT,GAAoBA,GAAO,GACzC,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,QAAI3Q,KAAKsB,QAAU6b,KAGXnd,KAAKkQ,MAAMiN,GAELjJ,KAIhBrE,EAAG5P,UAAUmgB,OAAS,SAAiBd,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAAI3O,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GAIrB,GAFAvN,EAAyB,IAAlBpD,KAAKiQ,SAAgB,2CAExBjQ,KAAKsB,QAAU6b,EACjB,OAAOnd,KAQT,GALU,IAAN2Q,GACFwM,IAEFnd,KAAKsB,OAASwP,KAAK/D,IAAIoQ,EAAGnd,KAAKsB,QAErB,IAANqP,EAAS,CACX,IAAIkP,EAAO,SAAc,WAAclP,GAAMA,EAC7C3Q,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IAAMue,EAGjC,OAAO7f,KAAKumB,UAId1W,EAAG5P,UAAUogB,MAAQ,SAAgBf,GACnC,OAAOtf,KAAK2E,QAAQyb,OAAOd,IAI7BzP,EAAG5P,UAAU+U,MAAQ,SAAgBpP,GAGnC,OAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAU5F,KAAKsgB,OAAO1a,GAGV,IAAlB5F,KAAKiQ,SACa,IAAhBjQ,KAAKsB,SAAiC,EAAhBtB,KAAKkQ,MAAM,KAAWtK,GAC9C5F,KAAKkQ,MAAM,GAAKtK,GAAuB,EAAhB5F,KAAKkQ,MAAM,IAClClQ,KAAKiQ,SAAW,EACTjQ,OAGTA,KAAKiQ,SAAW,EAChBjQ,KAAKsgB,MAAM1a,GACX5F,KAAKiQ,SAAW,EACTjQ,MAIFA,KAAKiS,OAAOrM,IAGrBiK,EAAG5P,UAAUgS,OAAS,SAAiBrM,GACrC5F,KAAKkQ,MAAM,IAAMtK,EAGjB,IAAK,IAAIyF,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,IAAM,SAAWA,IAC7DrL,KAAKkQ,MAAM7E,IAAM,SACbA,IAAMrL,KAAKsB,OAAS,EACtBtB,KAAKkQ,MAAM7E,EAAI,GAAK,EAEpBrL,KAAKkQ,MAAM7E,EAAI,KAKnB,OAFArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,EAAI,GAEjCrL,MAIT6P,EAAG5P,UAAUqgB,MAAQ,SAAgB1a,GAGnC,GAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAG,OAAO5F,KAAKgV,OAAOpP,GAEhC,GAAsB,IAAlB5F,KAAKiQ,SAIP,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKgV,MAAMpP,GACX5F,KAAKiQ,SAAW,EACTjQ,KAKT,GAFAA,KAAKkQ,MAAM,IAAMtK,EAEG,IAAhB5F,KAAKsB,QAAgBtB,KAAKkQ,MAAM,GAAK,EACvClQ,KAAKkQ,MAAM,IAAMlQ,KAAKkQ,MAAM,GAC5BlQ,KAAKiQ,SAAW,OAGhB,IAAK,IAAI5E,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,GAAK,EAAGA,IACpDrL,KAAKkQ,MAAM7E,IAAM,SACjBrL,KAAKkQ,MAAM7E,EAAI,IAAM,EAIzB,OAAOrL,KAAKumB,UAGd1W,EAAG5P,UAAUsgB,KAAO,SAAe3a,GACjC,OAAO5F,KAAK2E,QAAQqQ,MAAMpP,IAG5BiK,EAAG5P,UAAUugB,KAAO,SAAe5a,GACjC,OAAO5F,KAAK2E,QAAQ2b,MAAM1a,IAG5BiK,EAAG5P,UAAUwgB,KAAO,WAGlB,OAFAzgB,KAAKiQ,SAAW,EAETjQ,MAGT6P,EAAG5P,UAAU6U,IAAM,WACjB,OAAO9U,KAAK2E,QAAQ8b,QAGtB5Q,EAAG5P,UAAUygB,aAAe,SAAuB9a,EAAKiL,EAAK8P,GAC3D,IACItV,EAIAmG,EALApG,EAAMxF,EAAItE,OAASqf,EAGvB3gB,KAAKoS,QAAQhH,GAGb,IAAI2H,EAAQ,EACZ,IAAK1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CAC/BmG,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,EAClC,IAAI9B,GAAwB,EAAfrL,EAAIsK,MAAM7E,IAAUwF,EAEjCkC,IADAvB,GAAa,SAARP,IACS,KAAQA,EAAQ,SAAa,GAC3CjR,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAE1B,KAAOnG,EAAIrL,KAAKsB,OAASqf,EAAOtV,IAE9B0H,GADAvB,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,IACrB,GACb/S,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAG1B,GAAc,IAAVuB,EAAa,OAAO/S,KAAKumB,SAK7B,IAFAnjB,GAAkB,IAAX2P,GACPA,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAE3B0H,GADAvB,IAAsB,EAAhBxR,KAAKkQ,MAAM7E,IAAU0H,IACd,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJmG,EAIlB,OAFAxR,KAAKiQ,SAAW,EAETjQ,KAAKumB,UAGd1W,EAAG5P,UAAU2gB,SAAW,SAAmBhb,EAAKib,GAC9C,IAAIF,GAAQ3gB,KAAKsB,OAASsE,EAAItE,QAE1BsR,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAGJkb,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,GAGf,IADdqf,EAAQ,GADM3gB,KAAKsU,WAAWwM,MAG5BjO,EAAIA,EAAEoN,MAAMU,GACZ/N,EAAEyM,OAAOsB,GACTG,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,IAI3B,IACI4S,EADAnV,EAAI6T,EAAEtR,OAASuR,EAAEvR,OAGrB,GAAa,QAATuf,EAAgB,EAClB3M,EAAI,IAAIrE,EAAG,OACTvO,OAASvC,EAAI,EACfmV,EAAEhE,MAAQ,IAAIxO,MAAMwS,EAAE5S,QACtB,IAAK,IAAI+J,EAAI,EAAGA,EAAI6I,EAAE5S,OAAQ+J,IAC5B6I,EAAEhE,MAAM7E,GAAK,EAIjB,IAAI0V,EAAOnO,EAAEjO,QAAQ+b,aAAa7N,EAAG,EAAG9T,GAClB,IAAlBgiB,EAAK9Q,WACP2C,EAAImO,EACA7M,IACFA,EAAEhE,MAAMnR,GAAK,IAIjB,IAAK,IAAIuM,EAAIvM,EAAI,EAAGuM,GAAK,EAAGA,IAAK,CAC/B,IAAI0V,EAAmC,UAAL,EAAxBpO,EAAE1C,MAAM2C,EAAEvR,OAASgK,KACE,EAA5BsH,EAAE1C,MAAM2C,EAAEvR,OAASgK,EAAI,IAO1B,IAHA0V,EAAKlQ,KAAK/D,IAAKiU,EAAKF,EAAO,EAAG,UAE9BlO,EAAE8N,aAAa7N,EAAGmO,EAAI1V,GACA,IAAfsH,EAAE3C,UACP+Q,IACApO,EAAE3C,SAAW,EACb2C,EAAE8N,aAAa7N,EAAG,EAAGvH,GAChBsH,EAAEW,WACLX,EAAE3C,UAAY,GAGdiE,IACFA,EAAEhE,MAAM5E,GAAK0V,GAajB,OAVI9M,GACFA,EAAEqS,SAEJ3T,EAAE2T,SAGW,QAAT1F,GAA4B,IAAVF,GACpB/N,EAAEwB,OAAOuM,GAGJ,CACLM,IAAK/M,GAAK,KACVpC,IAAKc,IAQT/C,EAAG5P,UAAUihB,OAAS,SAAiBtb,EAAKib,EAAMM,GAGhD,OAFA/d,GAAQwC,EAAI2N,UAERvT,KAAKuT,SACA,CACL0N,IAAK,IAAIpR,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB7P,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAKib,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGH,QAATuL,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI0E,KAAK5Q,IAIN,CACLqb,IAAKA,EACLnP,IAAKA,IAIa,IAAlB9R,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKkhB,OAAOtb,EAAI0P,MAAOuL,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGT,CACL2L,IAAKA,EACLnP,IAAKtP,EAAIsP,MAI0B,IAAlC9R,KAAKiQ,SAAWrK,EAAIqK,WACvBzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAI0P,MAAOuL,GAEtB,QAATA,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI2E,KAAK7Q,IAIN,CACLqb,IAAKze,EAAIye,IACTnP,IAAKA,IAOLlM,EAAItE,OAAStB,KAAKsB,QAAUtB,KAAKkR,IAAItL,GAAO,EACvC,CACLqb,IAAK,IAAIpR,EAAG,GACZiC,IAAK9R,MAKU,IAAf4F,EAAItE,OACO,QAATuf,EACK,CACLI,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,MAII,QAAT+O,EACK,CACLI,IAAK,KACLnP,IAAK,IAAIjC,EAAG7P,KAAK+3C,MAAMnyC,EAAIsK,MAAM,MAI9B,CACL+Q,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,IAAIjC,EAAG7P,KAAK+3C,MAAMnyC,EAAIsK,MAAM,MAI9BlQ,KAAK4gB,SAAShb,EAAKib,GAlF1B,IAAII,EAAKnP,EAAKtP,GAsFhBqN,EAAG5P,UAAUghB,IAAM,SAAcrb,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOqb,KAIxCpR,EAAG5P,UAAU6R,IAAM,SAAclM,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOkM,KAGxCjC,EAAG5P,UAAUohB,KAAO,SAAezb,GACjC,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAMkM,KAIvCjC,EAAG5P,UAAUqhB,SAAW,SAAmB1b,GACzC,IAAI2b,EAAKvhB,KAAKkhB,OAAOtb,GAGrB,GAAI2b,EAAGzP,IAAIyB,SAAU,OAAOgO,EAAGN,IAE/B,IAAInP,EAA0B,IAApByP,EAAGN,IAAIhR,SAAiBsR,EAAGzP,IAAI2E,KAAK7Q,GAAO2b,EAAGzP,IAEpD0P,EAAO5b,EAAIua,MAAM,GACjBsB,EAAK7b,EAAIuO,MAAM,GACfjD,EAAMY,EAAIZ,IAAIsQ,GAGlB,OAAItQ,EAAM,GAAa,IAAPuQ,GAAoB,IAARvQ,EAAmBqQ,EAAGN,IAGvB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAG5P,UAAU83C,MAAQ,SAAgBnyC,GACnC,IAAIuyC,EAAWvyC,EAAM,EACjBuyC,IAAUvyC,GAAOA,GAErBxC,EAAOwC,GAAO,UAId,IAHA,IAAI4J,GAAK,GAAK,IAAM5J,EAEhB8b,EAAM,EACDrW,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IACpCqW,GAAOlS,EAAIkS,GAAuB,EAAhB1hB,KAAKkQ,MAAM7E,KAAWzF,EAG1C,OAAOuyC,GAAYz2B,EAAMA,GAI3B7R,EAAG5P,UAAUuT,KAAO,SAAe5N,GACjC,OAAO5F,KAAK+3C,MAAMnyC,IAIpBiK,EAAG5P,UAAUwT,MAAQ,SAAgB7N,GACnC,IAAIuyC,EAAWvyC,EAAM,EACjBuyC,IAAUvyC,GAAOA,GAErBxC,EAAOwC,GAAO,UAGd,IADA,IAAImN,EAAQ,EACH1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAkB,SAAR0H,EAC9B/S,KAAKkQ,MAAM7E,GAAMmG,EAAI5L,EAAO,EAC5BmN,EAAQvB,EAAI5L,EAId,OADA5F,KAAKumB,SACE4xB,EAAWn4C,KAAKoV,OAASpV,MAGlC6P,EAAG5P,UAAUmhB,KAAO,SAAexb,GACjC,OAAO5F,KAAK2E,QAAQ8O,MAAM7N,IAG5BiK,EAAG5P,UAAU0hB,KAAO,SAAenS,GACjCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAI2I,EAAIlc,KACJmc,EAAI3M,EAAE7K,QAGRuX,EADiB,IAAfA,EAAEjM,SACAiM,EAAEmF,KAAK7R,GAEP0M,EAAEvX,QAaR,IATA,IAAIid,EAAI,IAAI/R,EAAG,GACXgS,EAAI,IAAIhS,EAAG,GAGXiS,EAAI,IAAIjS,EAAG,GACXkS,EAAI,IAAIlS,EAAG,GAEXmS,EAAI,EAED9F,EAAE+F,UAAY9F,EAAE8F,UACrB/F,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP4N,EAMJ,IAHA,IAAIE,EAAK/F,EAAExX,QACPwd,EAAKjG,EAAEvX,SAEHuX,EAAE3I,UAAU,CAClB,IAAK,IAAIlI,EAAI,EAAG+W,EAAK,EAAyB,IAArBlG,EAAEhM,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADA6Q,EAAE9H,OAAO/I,GACFA,KAAM,IACPuW,EAAES,SAAWR,EAAEQ,WACjBT,EAAEpL,KAAK0L,GACPL,EAAEpL,KAAK0L,IAGTP,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIb,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBnG,EAAEjM,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADA6Q,EAAE/H,OAAO9I,GACFA,KAAM,IACPwW,EAAEO,SAAWN,EAAEM,WACjBP,EAAEtL,KAAK0L,GACPH,EAAEtL,KAAK0L,IAGTL,EAAE1N,OAAO,GACT2N,EAAE3N,OAAO,GAIT8H,EAAEhL,IAAIiL,IAAM,GACdD,EAAEzF,KAAK0F,GACPyF,EAAEnL,KAAKqL,GACPD,EAAEpL,KAAKsL,KAEP5F,EAAE1F,KAAKyF,GACP4F,EAAErL,KAAKmL,GACPG,EAAEtL,KAAKoL,IAIX,MAAO,CACLjP,EACAC,EAAGkP,EACHQ,IAAKpG,EAAEkD,OAAO2C,KAOlBnS,EAAG5P,UAAUuiB,OAAS,SAAiBhT,GACrCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAIX,EAAI5S,KACJ6S,EAAIrD,EAAE7K,QAGRiO,EADiB,IAAfA,EAAE3C,SACA2C,EAAEyO,KAAK7R,GAEPoD,EAAEjO,QAQR,IALA,IAuCInC,EAvCAigB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ9P,EAAElO,QAEPiO,EAAEgQ,KAAK,GAAK,GAAK/P,EAAE+P,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIvX,EAAI,EAAG+W,EAAK,EAAyB,IAArBxP,EAAE1C,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADAuH,EAAEwB,OAAO/I,GACFA,KAAM,GACPoX,EAAGJ,SACLI,EAAGjM,KAAKmM,GAGVF,EAAGrO,OAAO,GAId,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBzP,EAAE3C,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADAuH,EAAEuB,OAAO9I,GACFA,KAAM,GACPoX,EAAGL,SACLK,EAAGlM,KAAKmM,GAGVD,EAAGtO,OAAO,GAIVxB,EAAE1B,IAAI2B,IAAM,GACdD,EAAE6D,KAAK5D,GACP4P,EAAGhM,KAAKiM,KAER7P,EAAE4D,KAAK7D,GACP8P,EAAGjM,KAAKgM,IAeZ,OATEjgB,EADgB,IAAdoQ,EAAEgQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKhH,GAGJhN,GAGTqN,EAAG5P,UAAUsiB,IAAM,SAAc3c,GAC/B,GAAI5F,KAAKuT,SAAU,OAAO3N,EAAIkP,MAC9B,GAAIlP,EAAI2N,SAAU,OAAOvT,KAAK8U,MAE9B,IAAIlC,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAAIjB,QACZiO,EAAE3C,SAAW,EACb4C,EAAE5C,SAAW,EAGb,IAAK,IAAI0Q,EAAQ,EAAG/N,EAAEqP,UAAYpP,EAAEoP,SAAUtB,IAC5C/N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,OAAG,CACD,KAAOxB,EAAEqP,UACPrP,EAAEwB,OAAO,GAEX,KAAOvB,EAAEoP,UACPpP,EAAEuB,OAAO,GAGX,IAAIzD,EAAIiC,EAAE1B,IAAI2B,GACd,GAAIlC,EAAI,EAAG,CAET,IAAI4D,EAAI3B,EACRA,EAAIC,EACJA,EAAI0B,OACC,GAAU,IAAN5D,GAAyB,IAAdkC,EAAE+P,KAAK,GAC3B,MAGFhQ,EAAE6D,KAAK5D,GAGT,OAAOA,EAAEwM,OAAOsB,IAIlB9Q,EAAG5P,UAAU4iB,KAAO,SAAejd,GACjC,OAAO5F,KAAK2hB,KAAK/b,GAAKgN,EAAEyO,KAAKzb,IAG/BiK,EAAG5P,UAAUgiB,OAAS,WACpB,OAA+B,IAAP,EAAhBjiB,KAAKkQ,MAAM,KAGrBL,EAAG5P,UAAUoiB,MAAQ,WACnB,OAA+B,IAAP,EAAhBriB,KAAKkQ,MAAM,KAIrBL,EAAG5P,UAAUkU,MAAQ,SAAgBvO,GACnC,OAAO5F,KAAKkQ,MAAM,GAAKtK,GAIzBiK,EAAG5P,UAAU6iB,MAAQ,SAAgBxM,GACnClT,EAAsB,iBAARkT,GACd,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,GAAI3Q,KAAKsB,QAAU6b,EAGjB,OAFAnd,KAAKoS,QAAQ+K,EAAI,GACjBnd,KAAKkQ,MAAMiN,IAAMjJ,EACVlU,KAKT,IADA,IAAI+S,EAAQmB,EACH7I,EAAI8R,EAAa,IAAVpK,GAAe1H,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACnD,IAAImG,EAAoB,EAAhBxR,KAAKkQ,MAAM7E,GAEnB0H,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACLxR,KAAKkQ,MAAM7E,GAAKmG,EAMlB,OAJc,IAAVuB,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAEAtB,MAGT6P,EAAG5P,UAAUsT,OAAS,WACpB,OAAuB,IAAhBvT,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,IAGzCL,EAAG5P,UAAU2iB,KAAO,SAAehd,GACjC,IAOIpD,EAPAyN,EAAWrK,EAAM,EAErB,GAAsB,IAAlB5F,KAAKiQ,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBjQ,KAAKiQ,UAAkBA,EAAU,OAAO,EAK5C,GAHAjQ,KAAKumB,SAGDvmB,KAAKsB,OAAS,EAChBkB,EAAM,MACD,CACDyN,IACFrK,GAAOA,GAGTxC,EAAOwC,GAAO,SAAW,qBAEzB,IAAI4L,EAAoB,EAAhBxR,KAAKkQ,MAAM,GACnB1N,EAAMgP,IAAM5L,EAAM,EAAI4L,EAAI5L,GAAO,EAAI,EAEvC,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAOTqN,EAAG5P,UAAUiR,IAAM,SAActL,GAC/B,GAAsB,IAAlB5F,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAQ,EACvD,GAAsB,IAAlBjQ,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAO,EAEtD,IAAIzN,EAAMxC,KAAK+iB,KAAKnd,GACpB,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAITqN,EAAG5P,UAAU8iB,KAAO,SAAend,GAEjC,GAAI5F,KAAKsB,OAASsE,EAAItE,OAAQ,OAAO,EACrC,GAAItB,KAAKsB,OAASsE,EAAItE,OAAQ,OAAQ,EAGtC,IADA,IAAIkB,EAAM,EACD6I,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAIuH,EAAoB,EAAhB5S,KAAKkQ,MAAM7E,GACfwH,EAAmB,EAAfjN,EAAIsK,MAAM7E,GAElB,GAAIuH,IAAMC,EAAV,CACID,EAAIC,EACNrQ,GAAO,EACEoQ,EAAIC,IACbrQ,EAAM,GAER,OAEF,OAAOA,GAGTqN,EAAG5P,UAAU+iB,IAAM,SAAcpd,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUgjB,GAAK,SAAard,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUijB,KAAO,SAAetd,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUkjB,IAAM,SAAcvd,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUmjB,IAAM,SAAcxd,GAC/B,OAA2B,IAApB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUojB,GAAK,SAAazd,GAC7B,OAA0B,IAAnB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUqjB,KAAO,SAAe1d,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUsjB,IAAM,SAAc3d,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUujB,IAAM,SAAc5d,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUwjB,GAAK,SAAa7d,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAOlBiK,EAAGM,IAAM,SAAcvK,GACrB,OAAO,IAAI8d,EAAI9d,IAGjBiK,EAAG5P,UAAU0jB,MAAQ,SAAgBC,GAGnC,OAFAxgB,GAAQpD,KAAKmQ,IAAK,yCAClB/M,EAAyB,IAAlBpD,KAAKiQ,SAAgB,iCACrB2T,EAAIC,UAAU7jB,MAAM8jB,UAAUF,IAGvC/T,EAAG5P,UAAU8jB,QAAU,WAErB,OADA3gB,EAAOpD,KAAKmQ,IAAK,wDACVnQ,KAAKmQ,IAAI6T,YAAYhkB,OAG9B6P,EAAG5P,UAAU6jB,UAAY,SAAoBF,GAE3C,OADA5jB,KAAKmQ,IAAMyT,EACJ5jB,MAGT6P,EAAG5P,UAAUgkB,SAAW,SAAmBL,GAEzC,OADAxgB,GAAQpD,KAAKmQ,IAAK,yCACXnQ,KAAK8jB,UAAUF,IAGxB/T,EAAG5P,UAAUikB,OAAS,SAAiBte,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIuG,IAAI1W,KAAM4F,IAG5BiK,EAAG5P,UAAUkkB,QAAU,SAAkBve,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIqG,KAAKxW,KAAM4F,IAG7BiK,EAAG5P,UAAUmkB,OAAS,SAAiBxe,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIwG,IAAI3W,KAAM4F,IAG5BiK,EAAG5P,UAAUokB,QAAU,SAAkBze,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIsG,KAAKzW,KAAM4F,IAG7BiK,EAAG5P,UAAUqkB,OAAS,SAAiB1e,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIoU,IAAIvkB,KAAM4F,IAG5BiK,EAAG5P,UAAUukB,OAAS,SAAiB5e,GAGrC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIU,IAAI7Q,KAAM4F,IAG5BiK,EAAG5P,UAAUykB,QAAU,SAAkB9e,GAGvC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIyK,KAAK5a,KAAM4F,IAG7BiK,EAAG5P,UAAU0kB,OAAS,WAGpB,OAFAvhB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+O,IAAIlf,OAGtB6P,EAAG5P,UAAU4kB,QAAU,WAGrB,OAFAzhB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAIgP,KAAKnf,OAIvB6P,EAAG5P,UAAU6kB,QAAU,WAGrB,OAFA1hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI4U,KAAK/kB,OAGvB6P,EAAG5P,UAAU+kB,QAAU,WAGrB,OAFA5hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI0S,KAAK7iB,OAIvB6P,EAAG5P,UAAUglB,OAAS,WAGpB,OAFA7hB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAImF,IAAItV,OAGtB6P,EAAG5P,UAAUilB,OAAS,SAAiBtf,GAGrC,OAFAxC,EAAOpD,KAAKmQ,MAAQvK,EAAIuK,IAAK,qBAC7BnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+B,IAAIlS,KAAM4F,IAI5B,IAAIuf,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ1lB,EAAM0P,GAErBxP,KAAKF,KAAOA,EACZE,KAAKwP,EAAI,IAAIK,EAAGL,EAAG,IACnBxP,KAAKge,EAAIhe,KAAKwP,EAAEiF,YAChBzU,KAAKgT,EAAI,IAAInD,EAAG,GAAGwP,OAAOrf,KAAKge,GAAGvH,KAAKzW,KAAKwP,GAE5CxP,KAAK0M,IAAM1M,KAAKylB,OAiDlB,SAASC,IACPF,EAAOjlB,KACLP,KACA,OACA,2EA+DJ,SAAS2lB,IACPH,EAAOjlB,KACLP,KACA,OACA,kEAIJ,SAAS4lB,IACPJ,EAAOjlB,KACLP,KACA,OACA,yDAIJ,SAAS6lB,IAEPL,EAAOjlB,KACLP,KACA,QACA,uEA8CJ,SAAS0jB,EAAK3kB,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAI+mB,EAAQjW,EAAGkW,OAAOhnB,GACtBiB,KAAKjB,EAAI+mB,EAAMtW,EACfxP,KAAK8lB,MAAQA,OAEb1iB,EAAOrE,EAAEikB,IAAI,GAAI,kCACjBhjB,KAAKjB,EAAIA,EACTiB,KAAK8lB,MAAQ,KAoOjB,SAASE,EAAMjnB,GACb2kB,EAAInjB,KAAKP,KAAMjB,GAEfiB,KAAK2gB,MAAQ3gB,KAAKjB,EAAE0V,YAChBzU,KAAK2gB,MAAQ,IAAO,IACtB3gB,KAAK2gB,OAAS,GAAM3gB,KAAK2gB,MAAQ,IAGnC3gB,KAAK2Q,EAAI,IAAId,EAAG,GAAGwP,OAAOrf,KAAK2gB,OAC/B3gB,KAAKyhB,GAAKzhB,KAAKimB,KAAKjmB,KAAK2Q,EAAEuO,OAC3Blf,KAAKkmB,KAAOlmB,KAAK2Q,EAAE6R,OAAOxiB,KAAKjB,GAE/BiB,KAAKmmB,KAAOnmB,KAAKkmB,KAAKrV,IAAI7Q,KAAK2Q,GAAG2P,MAAM,GAAGW,IAAIjhB,KAAKjB,GACpDiB,KAAKmmB,KAAOnmB,KAAKmmB,KAAK9E,KAAKrhB,KAAK2Q,GAChC3Q,KAAKmmB,KAAOnmB,KAAK2Q,EAAEgG,IAAI3W,KAAKmmB,MA9a9BX,EAAOvlB,UAAUwlB,KAAO,WACtB,IAAI/Y,EAAM,IAAImD,EAAG,MAEjB,OADAnD,EAAIwD,MAAQ,IAAIxO,MAAMoP,KAAKS,KAAKvR,KAAKge,EAAI,KAClCtR,GAGT8Y,EAAOvlB,UAAUmmB,QAAU,SAAkBxgB,GAG3C,IACIygB,EADA1V,EAAI/K,EAGR,GACE5F,KAAKsN,MAAMqD,EAAG3Q,KAAK0M,KAGnB2Z,GADA1V,GADAA,EAAI3Q,KAAKsmB,MAAM3V,IACT6F,KAAKxW,KAAK0M,MACP+H,kBACF4R,EAAOrmB,KAAKge,GAErB,IAAI9M,EAAMmV,EAAOrmB,KAAKge,GAAK,EAAIrN,EAAEoS,KAAK/iB,KAAKwP,GAgB3C,OAfY,IAAR0B,GACFP,EAAET,MAAM,GAAK,EACbS,EAAErP,OAAS,GACF4P,EAAM,EACfP,EAAE8F,KAAKzW,KAAKwP,QAEIpH,IAAZuI,EAAEe,MAEJf,EAAEe,QAGFf,EAAE4V,SAIC5V,GAGT6U,EAAOvlB,UAAUqN,MAAQ,SAAgBvH,EAAOjD,GAC9CiD,EAAMqO,OAAOpU,KAAKge,EAAG,EAAGlb,IAG1B0iB,EAAOvlB,UAAUqmB,MAAQ,SAAgB1gB,GACvC,OAAOA,EAAIgV,KAAK5a,KAAKgT,IASvBpT,EAAS8lB,EAAMF,GAEfE,EAAKzlB,UAAUqN,MAAQ,SAAgBvH,EAAOygB,GAK5C,IAHA,IAAI3G,EAAO,QAEP4G,EAAS3V,KAAK/D,IAAIhH,EAAMzE,OAAQ,GAC3B+J,EAAI,EAAGA,EAAIob,EAAQpb,IAC1Bmb,EAAOtW,MAAM7E,GAAKtF,EAAMmK,MAAM7E,GAIhC,GAFAmb,EAAOllB,OAASmlB,EAEZ1gB,EAAMzE,QAAU,EAGlB,OAFAyE,EAAMmK,MAAM,GAAK,OACjBnK,EAAMzE,OAAS,GAKjB,IAAIuI,EAAO9D,EAAMmK,MAAM,GAGvB,IAFAsW,EAAOtW,MAAMsW,EAAOllB,UAAYuI,EAAOgW,EAElCxU,EAAI,GAAIA,EAAItF,EAAMzE,OAAQ+J,IAAK,CAClC,IAAIqb,EAAwB,EAAjB3gB,EAAMmK,MAAM7E,GACvBtF,EAAMmK,MAAM7E,EAAI,KAAQqb,EAAO7G,IAAS,EAAMhW,IAAS,GACvDA,EAAO6c,EAET7c,KAAU,GACV9D,EAAMmK,MAAM7E,EAAI,IAAMxB,EACT,IAATA,GAAc9D,EAAMzE,OAAS,GAC/ByE,EAAMzE,QAAU,GAEhByE,EAAMzE,QAAU,GAIpBokB,EAAKzlB,UAAUqmB,MAAQ,SAAgB1gB,GAErCA,EAAIsK,MAAMtK,EAAItE,QAAU,EACxBsE,EAAIsK,MAAMtK,EAAItE,OAAS,GAAK,EAC5BsE,EAAItE,QAAU,EAId,IADA,IAAIwR,EAAK,EACAzH,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAImG,EAAmB,EAAf5L,EAAIsK,MAAM7E,GAClByH,GAAU,IAAJtB,EACN5L,EAAIsK,MAAM7E,GAAU,SAALyH,EACfA,EAAS,GAAJtB,GAAasB,EAAK,SAAa,GAUtC,OANkC,IAA9BlN,EAAIsK,MAAMtK,EAAItE,OAAS,KACzBsE,EAAItE,SAC8B,IAA9BsE,EAAIsK,MAAMtK,EAAItE,OAAS,IACzBsE,EAAItE,UAGDsE,GASThG,EAAS+lB,EAAMH,GAQf5lB,EAASgmB,EAAMJ,GASf5lB,EAASimB,EAAQL,GAEjBK,EAAO5lB,UAAUqmB,MAAQ,SAAgB1gB,GAGvC,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAIqJ,EAA0B,IAAL,EAAf9O,EAAIsK,MAAM7E,IAAiB0H,EACjCD,EAAU,SAAL4B,EACTA,KAAQ,GAER9O,EAAIsK,MAAM7E,GAAKyH,EACfC,EAAQ2B,EAKV,OAHc,IAAV3B,IACFnN,EAAIsK,MAAMtK,EAAItE,UAAYyR,GAErBnN,GAITiK,EAAGkW,OAAS,SAAgBjmB,GAE1B,GAAIqlB,EAAOrlB,GAAO,OAAOqlB,EAAOrlB,GAEhC,IAAIgmB,EACJ,GAAa,SAAThmB,EACFgmB,EAAQ,IAAIJ,OACP,GAAa,SAAT5lB,EACTgmB,EAAQ,IAAIH,OACP,GAAa,SAAT7lB,EACTgmB,EAAQ,IAAIF,MACP,IAAa,WAAT9lB,EAGT,MAAM,IAAIb,MAAM,iBAAmBa,GAFnCgmB,EAAQ,IAAID,EAMd,OAFAV,EAAOrlB,GAAQgmB,EAERA,GAkBTpC,EAAIzjB,UAAU2kB,SAAW,SAAmBhS,GAC1CxP,EAAsB,IAAfwP,EAAE3C,SAAgB,iCACzB7M,EAAOwP,EAAEzC,IAAK,oCAGhBuT,EAAIzjB,UAAUwkB,SAAW,SAAmB7R,EAAGC,GAC7CzP,EAAqC,IAA7BwP,EAAE3C,SAAW4C,EAAE5C,UAAiB,iCACxC7M,EAAOwP,EAAEzC,KAAOyC,EAAEzC,MAAQ0C,EAAE1C,IAC1B,oCAGJuT,EAAIzjB,UAAUgmB,KAAO,SAAerT,GAClC,OAAI5S,KAAK8lB,MAAc9lB,KAAK8lB,MAAMM,QAAQxT,GAAGkR,UAAU9jB,OAEvD23C,EAAK/kC,EAAGA,EAAEyO,KAAKrhB,KAAKjB,GAAG+kB,UAAU9jB,OAC1B4S,IAGT8Q,EAAIzjB,UAAUqV,IAAM,SAAc1C,GAChC,OAAIA,EAAEW,SACGX,EAAEjO,QAGJ3E,KAAKjB,EAAE4X,IAAI/D,GAAGkR,UAAU9jB,OAGjC0jB,EAAIzjB,UAAUyW,IAAM,SAAc9D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE8D,IAAI7D,GAIhB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUuW,KAAO,SAAe5D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE4D,KAAK3D,GAIjB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAU0W,IAAM,SAAc/D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE+D,IAAI9D,GAIhB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUwW,KAAO,SAAe7D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE6D,KAAK5D,GAIjB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAUskB,IAAM,SAAc3R,EAAGhN,GAEnC,OADA5F,KAAK4kB,SAAShS,GACP5S,KAAKimB,KAAKrT,EAAEqN,MAAMra,KAG3B8d,EAAIzjB,UAAU2a,KAAO,SAAehI,EAAGC,GAErC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAEgI,KAAK/H,KAG1B6Q,EAAIzjB,UAAU4Q,IAAM,SAAc+B,EAAGC,GAEnC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAE/B,IAAIgC,KAGzB6Q,EAAIzjB,UAAUkf,KAAO,SAAevM,GAClC,OAAO5S,KAAK4a,KAAKhI,EAAGA,EAAEjO,UAGxB+e,EAAIzjB,UAAUif,IAAM,SAActM,GAChC,OAAO5S,KAAK6Q,IAAI+B,EAAGA,IAGrB8Q,EAAIzjB,UAAU8kB,KAAO,SAAenS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEjO,QAEzB,IAAIgiB,EAAO3mB,KAAKjB,EAAEoV,MAAM,GAIxB,GAHA/Q,EAAOujB,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIzU,EAAMlS,KAAKjB,EAAE2X,IAAI,IAAI7G,EAAG,IAAIuE,OAAO,GACvC,OAAOpU,KAAKkS,IAAIU,EAAGV,GAQrB,IAFA,IAAIgC,EAAIlU,KAAKjB,EAAEyhB,KAAK,GAChBrD,EAAI,GACAjJ,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXhR,GAAQ8Q,EAAEX,UAEV,IAAIqT,EAAM,IAAI/W,EAAG,GAAG8T,MAAM3jB,MACtB6mB,EAAOD,EAAI3B,SAIX6B,EAAO9mB,KAAKjB,EAAEyhB,KAAK,GAAGpM,OAAO,GAC7B2S,EAAI/mB,KAAKjB,EAAE0V,YAGf,IAFAsS,EAAI,IAAIlX,EAAG,EAAIkX,EAAIA,GAAGpD,MAAM3jB,MAEW,IAAhCA,KAAKkS,IAAI6U,EAAGD,GAAM5V,IAAI2V,IAC3BE,EAAE5C,QAAQ0C,GAOZ,IAJA,IAAIrW,EAAIxQ,KAAKkS,IAAI6U,EAAG7S,GAChBvD,EAAI3Q,KAAKkS,IAAIU,EAAGsB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAIvU,KAAKkS,IAAIU,EAAGsB,GAChBnV,EAAIoe,EACc,IAAf5I,EAAErD,IAAI0V,IAAY,CAEvB,IADA,IAAIla,EAAM6H,EACDlJ,EAAI,EAAoB,IAAjBqB,EAAIwE,IAAI0V,GAAYvb,IAClCqB,EAAMA,EAAIiY,SAEZvhB,EAAOiI,EAAItM,GACX,IAAI8T,EAAI7S,KAAKkS,IAAI1B,EAAG,IAAIX,EAAG,GAAGwP,OAAOtgB,EAAIsM,EAAI,IAE7CsF,EAAIA,EAAE6T,OAAO3R,GACbrC,EAAIqC,EAAE8R,SACNpQ,EAAIA,EAAEiQ,OAAOhU,GACbzR,EAAIsM,EAGN,OAAOsF,GAGT+S,EAAIzjB,UAAU4iB,KAAO,SAAejQ,GAClC,IAAIoU,EAAMpU,EAAE4P,OAAOxiB,KAAKjB,GACxB,OAAqB,IAAjBioB,EAAI/W,UACN+W,EAAI/W,SAAW,EACRjQ,KAAKimB,KAAKe,GAAK/B,UAEfjlB,KAAKimB,KAAKe,IAIrBtD,EAAIzjB,UAAUiS,IAAM,SAAcU,EAAGhN,GACnC,GAAIA,EAAI2N,SAAU,OAAO,IAAI1D,EAAG,GAAG8T,MAAM3jB,MACzC,GAAoB,IAAhB4F,EAAIgd,KAAK,GAAU,OAAOhQ,EAAEjO,QAEhC,IACIsiB,EAAM,IAAIvlB,MAAM,IACpBulB,EAAI,GAAK,IAAIpX,EAAG,GAAG8T,MAAM3jB,MACzBinB,EAAI,GAAKrU,EACT,IAAK,IAAIvH,EAAI,EAAGA,EAAI4b,EAAI3lB,OAAQ+J,IAC9B4b,EAAI5b,GAAKrL,KAAK6Q,IAAIoW,EAAI5b,EAAI,GAAIuH,GAGhC,IAAIpQ,EAAMykB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtgB,EAAQjB,EAAI6O,YAAc,GAK9B,IAJc,IAAV5N,IACFA,EAAQ,IAGLwE,EAAIzF,EAAItE,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI0G,EAAOnM,EAAIsK,MAAM7E,GACZC,EAAIzE,EAAQ,EAAGyE,GAAK,EAAGA,IAAK,CACnC,IAAIgL,EAAOvE,GAAQzG,EAAK,EACpB9I,IAAQykB,EAAI,KACdzkB,EAAMxC,KAAKkf,IAAI1c,IAGL,IAAR8T,GAAyB,IAAZ4Q,GAKjBA,IAAY,EACZA,GAAW5Q,GA9BE,KA+Bb6Q,GACwC,IAAN9b,GAAiB,IAANC,KAE7C9I,EAAMxC,KAAK6Q,IAAIrO,EAAKykB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtgB,EAAQ,GAGV,OAAOrE,GAGTkhB,EAAIzjB,UAAU4jB,UAAY,SAAoBje,GAC5C,IAAI+K,EAAI/K,EAAIyb,KAAKrhB,KAAKjB,GAEtB,OAAO4R,IAAM/K,EAAM+K,EAAEhM,QAAUgM,GAGjC+S,EAAIzjB,UAAU+jB,YAAc,SAAsBpe,GAChD,IAAIpD,EAAMoD,EAAIjB,QAEd,OADAnC,EAAI2N,IAAM,KACH3N,GAOTqN,EAAGuX,KAAO,SAAexhB,GACvB,OAAO,IAAIogB,EAAKpgB,IAmBlBhG,EAASomB,EAAMtC,GAEfsC,EAAK/lB,UAAU4jB,UAAY,SAAoBje,GAC7C,OAAO5F,KAAKimB,KAAKrgB,EAAIqa,MAAMjgB,KAAK2gB,SAGlCqF,EAAK/lB,UAAU+jB,YAAc,SAAsBpe,GACjD,IAAI+K,EAAI3Q,KAAKimB,KAAKrgB,EAAIiL,IAAI7Q,KAAKkmB,OAE/B,OADAvV,EAAER,IAAM,KACDQ,GAGTqV,EAAK/lB,UAAU2a,KAAO,SAAehI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE1C,MAAM,GAAK,EACb0C,EAAEtR,OAAS,EACJsR,EAGT,IAAI2B,EAAI3B,EAAEgI,KAAK/H,GACXrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAQV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4Q,IAAM,SAAc+B,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI1D,EAAG,GAAGiU,UAAU9jB,MAEzD,IAAIuU,EAAI3B,EAAE/B,IAAIgC,GACVrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAOV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4iB,KAAO,SAAejQ,GAGnC,OADU5S,KAAKimB,KAAKrT,EAAE4P,OAAOxiB,KAAKjB,GAAG8R,IAAI7Q,KAAKyhB,KACnCqC,UAAU9jB,OAx9GzB,YA09G4CA,sBC19G5C,IAAI2Q,EASJ,SAASynC,EAAKC,GACZr4C,KAAKq4C,KAAOA,EAmBd,GA3BA55C,EAAOC,QAAU,SAAc0M,GAI7B,OAHKuF,IACHA,EAAI,IAAIynC,EAAK,OAERznC,EAAE2nC,SAASltC,IAMpB3M,EAAOC,QAAQ05C,KAAOA,EAEtBA,EAAKn4C,UAAUq4C,SAAW,SAAkBltC,GAC1C,OAAOpL,KAAKu4C,MAAMntC,IAIpBgtC,EAAKn4C,UAAUs4C,MAAQ,SAAev6B,GACpC,GAAIhe,KAAKq4C,KAAKG,SACZ,OAAOx4C,KAAKq4C,KAAKG,SAASx6B,GAG5B,IADA,IAAIxb,EAAM,IAAIm1B,WAAW3Z,GAChB3S,EAAI,EAAGA,EAAI7I,EAAIlB,OAAQ+J,IAC9B7I,EAAI6I,GAAKrL,KAAKq4C,KAAKI,UACrB,OAAOj2C,GAGW,iBAATmQ,KACLA,KAAK6sB,QAAU7sB,KAAK6sB,OAAOkZ,gBAE7BN,EAAKn4C,UAAUs4C,MAAQ,SAAev6B,GACpC,IAAIuW,EAAM,IAAIoD,WAAW3Z,GAEzB,OADArL,KAAK6sB,OAAOkZ,gBAAgBnkB,GACrBA,GAEA5hB,KAAKgmC,UAAYhmC,KAAKgmC,SAASD,gBAExCN,EAAKn4C,UAAUs4C,MAAQ,SAAev6B,GACpC,IAAIuW,EAAM,IAAIoD,WAAW3Z,GAEzB,OADArL,KAAKgmC,SAASD,gBAAgBnkB,GACvBA,GAIkB,iBAAXlkB,SAEhB+nC,EAAKn4C,UAAUs4C,MAAQ,WACrB,MAAM,IAAIt5C,MAAM,8BAKpB,IACE,IAAIugC,EAAS,EAAQ,MACrB,GAAkC,mBAAvBA,EAAOoZ,YAChB,MAAM,IAAI35C,MAAM,iBAElBm5C,EAAKn4C,UAAUs4C,MAAQ,SAAev6B,GACpC,OAAOwhB,EAAOoZ,YAAY56B,IAE5B,MAAOtX,qBCzDX,IAAIxF,EAAS,eAEb,SAAS23C,EAAe7tC,GACjB9J,EAAOE,SAAS4J,KAAMA,EAAM9J,EAAO2M,KAAK7C,IAK7C,IAHA,IAAII,EAAOJ,EAAI1J,OAAS,EAAK,EACzBwB,EAAM,IAAIpB,MAAM0J,GAEXC,EAAI,EAAGA,EAAID,EAAKC,IACvBvI,EAAIuI,GAAKL,EAAImiC,aAAiB,EAAJ9hC,GAG5B,OAAOvI,EAGT,SAASg2C,EAAUC,GACjB,KAAa,EAAOA,EAAEz3C,OAAQy3C,IAC5BA,EADW,GACJ,EAIX,SAASC,EAAYC,EAAGC,EAAaC,EAASC,EAAMC,GAalD,IAZA,IASIC,EAAIC,EAAIC,EAAIC,EATZC,EAAWP,EAAQ,GACnBQ,EAAWR,EAAQ,GACnBS,EAAWT,EAAQ,GACnBU,EAAWV,EAAQ,GAEnBW,EAAKb,EAAE,GAAKC,EAAY,GACxBa,EAAKd,EAAE,GAAKC,EAAY,GACxBc,EAAKf,EAAE,GAAKC,EAAY,GACxBe,EAAKhB,EAAE,GAAKC,EAAY,GAExBgB,EAAQ,EAEH77B,EAAQ,EAAGA,EAAQg7B,EAASh7B,IACnCi7B,EAAKI,EAASI,IAAO,IAAMH,EAAUI,IAAO,GAAM,KAAQH,EAAUI,IAAO,EAAK,KAAQH,EAAc,IAALI,GAAaf,EAAYgB,KAC1HX,EAAKG,EAASK,IAAO,IAAMJ,EAAUK,IAAO,GAAM,KAAQJ,EAAUK,IAAO,EAAK,KAAQJ,EAAc,IAALC,GAAaZ,EAAYgB,KAC1HV,EAAKE,EAASM,IAAO,IAAML,EAAUM,IAAO,GAAM,KAAQL,EAAUE,IAAO,EAAK,KAAQD,EAAc,IAALE,GAAab,EAAYgB,KAC1HT,EAAKC,EAASO,IAAO,IAAMN,EAAUG,IAAO,GAAM,KAAQF,EAAUG,IAAO,EAAK,KAAQF,EAAc,IAALG,GAAad,EAAYgB,KAC1HJ,EAAKR,EACLS,EAAKR,EACLS,EAAKR,EACLS,EAAKR,EAYP,OATAH,GAAOF,EAAKU,IAAO,KAAO,GAAOV,EAAMW,IAAO,GAAM,MAAS,GAAOX,EAAMY,IAAO,EAAK,MAAS,EAAKZ,EAAU,IAALa,IAAcf,EAAYgB,KACnIX,GAAOH,EAAKW,IAAO,KAAO,GAAOX,EAAMY,IAAO,GAAM,MAAS,GAAOZ,EAAMa,IAAO,EAAK,MAAS,EAAKb,EAAU,IAALU,IAAcZ,EAAYgB,KACnIV,GAAOJ,EAAKY,IAAO,KAAO,GAAOZ,EAAMa,IAAO,GAAM,MAAS,GAAOb,EAAMU,IAAO,EAAK,MAAS,EAAKV,EAAU,IAALW,IAAcb,EAAYgB,KACnIT,GAAOL,EAAKa,IAAO,KAAO,GAAOb,EAAMU,IAAO,GAAM,MAAS,GAAOV,EAAMW,IAAO,EAAK,MAAS,EAAKX,EAAU,IAALY,IAAcd,EAAYgB,KAM5H,CALPZ,KAAY,EACZC,KAAY,EACZC,KAAY,EACZC,KAAY,GAMd,IAAIU,EAAO,CAAC,EAAM,EAAM,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,IAAM,GAAM,IACpEC,EAAI,WAGN,IADA,IAAI9d,EAAI,IAAI56B,MAAM,KACT4J,EAAI,EAAGA,EAAI,IAAKA,IAErBgxB,EAAEhxB,GADAA,EAAI,IACCA,GAAK,EAEJA,GAAK,EAAK,IAYtB,IARA,IAAI8tC,EAAO,GACPiB,EAAW,GACXlB,EAAU,CAAC,GAAI,GAAI,GAAI,IACvBmB,EAAc,CAAC,GAAI,GAAI,GAAI,IAG3Bp+B,EAAI,EACJq+B,EAAK,EACAlvC,EAAI,EAAGA,EAAI,MAAOA,EAAG,CAE5B,IAAImvC,EAAKD,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EAAMA,GAAM,EACzDC,EAAMA,IAAO,EAAW,IAALA,EAAa,GAChCpB,EAAKl9B,GAAKs+B,EACVH,EAASG,GAAMt+B,EAGf,IAAIwG,EAAK4Z,EAAEpgB,GACPu+B,EAAKne,EAAE5Z,GACPg4B,EAAKpe,EAAEme,GAGPlmC,EAAa,IAAR+nB,EAAEke,GAAqB,SAALA,EAC3BrB,EAAQ,GAAGj9B,GAAM3H,GAAK,GAAOA,IAAM,EACnC4kC,EAAQ,GAAGj9B,GAAM3H,GAAK,GAAOA,IAAM,GACnC4kC,EAAQ,GAAGj9B,GAAM3H,GAAK,EAAMA,IAAM,GAClC4kC,EAAQ,GAAGj9B,GAAK3H,EAGhBA,EAAU,SAALmmC,EAAwB,MAALD,EAAsB,IAAL/3B,EAAmB,SAAJxG,EACxDo+B,EAAY,GAAGE,GAAOjmC,GAAK,GAAOA,IAAM,EACxC+lC,EAAY,GAAGE,GAAOjmC,GAAK,GAAOA,IAAM,GACxC+lC,EAAY,GAAGE,GAAOjmC,GAAK,EAAMA,IAAM,GACvC+lC,EAAY,GAAGE,GAAMjmC,EAEX,IAAN2H,EACFA,EAAIq+B,EAAK,GAETr+B,EAAIwG,EAAK4Z,EAAEA,EAAEA,EAAEoe,EAAKh4B,KACpB63B,GAAMje,EAAEA,EAAEie,KAId,MAAO,CACLnB,KAAMA,EACNiB,SAAUA,EACVlB,QAASA,EACTmB,YAAaA,GAzDT,GA6DR,SAASK,EAAKt2C,GACZrE,KAAKypB,KAAOovB,EAAcx0C,GAC1BrE,KAAK46C,SAGPD,EAAIE,UAAY,GAChBF,EAAIG,QAAU,GACdH,EAAI16C,UAAU46C,UAAYF,EAAIE,UAC9BF,EAAI16C,UAAU66C,QAAUH,EAAIG,QAC5BH,EAAI16C,UAAU26C,OAAS,WAOrB,IANA,IAAIG,EAAW/6C,KAAKypB,KAChBqxB,EAAUC,EAASz5C,OACnB+3C,EAAUyB,EAAU,EACpBE,EAAyB,GAAf3B,EAAU,GAEpBH,EAAc,GACTlmC,EAAI,EAAGA,EAAI8nC,EAAS9nC,IAC3BkmC,EAAYlmC,GAAK+nC,EAAS/nC,GAG5B,IAAKA,EAAI8nC,EAAS9nC,EAAIgoC,EAAQhoC,IAAK,CACjC,IAAIuB,EAAI2kC,EAAYlmC,EAAI,GAEpBA,EAAI8nC,GAAY,GAClBvmC,EAAKA,GAAK,EAAMA,IAAM,GACtBA,EACG6lC,EAAEhB,KAAK7kC,IAAM,KAAO,GACpB6lC,EAAEhB,KAAM7kC,IAAM,GAAM,MAAS,GAC7B6lC,EAAEhB,KAAM7kC,IAAM,EAAK,MAAS,EAC5B6lC,EAAEhB,KAAS,IAAJ7kC,GAEVA,GAAK4lC,EAAMnnC,EAAI8nC,EAAW,IAAM,IACvBA,EAAU,GAAK9nC,EAAI8nC,GAAY,IACxCvmC,EACG6lC,EAAEhB,KAAK7kC,IAAM,KAAO,GACpB6lC,EAAEhB,KAAM7kC,IAAM,GAAM,MAAS,GAC7B6lC,EAAEhB,KAAM7kC,IAAM,EAAK,MAAS,EAC5B6lC,EAAEhB,KAAS,IAAJ7kC,IAGZ2kC,EAAYlmC,GAAKkmC,EAAYlmC,EAAI8nC,GAAWvmC,EAI9C,IADA,IAAI0mC,EAAiB,GACZC,EAAK,EAAGA,EAAKF,EAAQE,IAAM,CAClC,IAAIC,EAAMH,EAASE,EACfE,EAAKlC,EAAYiC,GAAOD,EAAK,EAAI,EAAI,IAGvCD,EAAeC,GADbA,EAAK,GAAKC,GAAO,EACEC,EAGnBhB,EAAEE,YAAY,GAAGF,EAAEhB,KAAKgC,IAAO,KAC/BhB,EAAEE,YAAY,GAAGF,EAAEhB,KAAMgC,IAAO,GAAM,MACtChB,EAAEE,YAAY,GAAGF,EAAEhB,KAAMgC,IAAO,EAAK,MACrChB,EAAEE,YAAY,GAAGF,EAAEhB,KAAU,IAALgC,IAI9Bp7C,KAAKq7C,SAAWhC,EAChBr5C,KAAKs7C,aAAepC,EACpBl5C,KAAKu7C,gBAAkBN,GAGzBN,EAAI16C,UAAUu7C,gBAAkB,SAAUvC,GAExC,OAAOD,EADPC,EAAIJ,EAAcI,GACGj5C,KAAKs7C,aAAclB,EAAEjB,QAASiB,EAAEhB,KAAMp5C,KAAKq7C,WAGlEV,EAAI16C,UAAUw7C,aAAe,SAAUxC,GACrC,IAAIn2C,EAAM9C,KAAKw7C,gBAAgBvC,GAC3BjuC,EAAM9J,EAAOkpC,YAAY,IAK7B,OAJAp/B,EAAIq/B,cAAcvnC,EAAI,GAAI,GAC1BkI,EAAIq/B,cAAcvnC,EAAI,GAAI,GAC1BkI,EAAIq/B,cAAcvnC,EAAI,GAAI,GAC1BkI,EAAIq/B,cAAcvnC,EAAI,GAAI,IACnBkI,GAGT2vC,EAAI16C,UAAUy7C,aAAe,SAAUzC,GAIrC,IAAI0C,GAHJ1C,EAAIJ,EAAcI,IAGP,GACXA,EAAE,GAAKA,EAAE,GACTA,EAAE,GAAK0C,EAEP,IAAI74C,EAAMk2C,EAAWC,EAAGj5C,KAAKu7C,gBAAiBnB,EAAEE,YAAaF,EAAEC,SAAUr6C,KAAKq7C,UAC1ErwC,EAAM9J,EAAOkpC,YAAY,IAK7B,OAJAp/B,EAAIq/B,cAAcvnC,EAAI,GAAI,GAC1BkI,EAAIq/B,cAAcvnC,EAAI,GAAI,GAC1BkI,EAAIq/B,cAAcvnC,EAAI,GAAI,GAC1BkI,EAAIq/B,cAAcvnC,EAAI,GAAI,IACnBkI,GAGT2vC,EAAI16C,UAAU27C,MAAQ,WACpB9C,EAAS94C,KAAKs7C,cACdxC,EAAS94C,KAAKu7C,iBACdzC,EAAS94C,KAAKypB,OAGhBhrB,EAAOC,QAAQi8C,IAAMA,kBCnOrB,IAAIkB,EAAM,EAAQ,MACd36C,EAAS,eACT61C,EAAY,EAAQ,MACpBn3C,EAAW,EAAQ,MACnBk8C,EAAQ,EAAQ,MAChB7lC,EAAM,EAAQ,MACd8lC,EAAS,EAAQ,KAqCrB,SAASC,EAAcn7B,EAAMxc,EAAK43C,EAAItN,GACpCoI,EAAUx2C,KAAKP,MAEf,IAAI4f,EAAI1e,EAAO6B,MAAM,EAAG,GAExB/C,KAAKk8C,QAAU,IAAIL,EAAIlB,IAAIt2C,GAC3B,IAAI83C,EAAKn8C,KAAKk8C,QAAQT,aAAa77B,GACnC5f,KAAKo8C,OAAS,IAAIN,EAAMK,GACxBF,EA/BF,SAAiBtpC,EAAMspC,EAAIE,GACzB,GAAkB,KAAdF,EAAG36C,OAEL,OADAqR,EAAK0pC,OAASn7C,EAAOqC,OAAO,CAAC04C,EAAI/6C,EAAO2M,KAAK,CAAC,EAAG,EAAG,EAAG,MAChD3M,EAAOqC,OAAO,CAAC04C,EAAI/6C,EAAO2M,KAAK,CAAC,EAAG,EAAG,EAAG,MAElD,IAAIyuC,EAAQ,IAAIR,EAAMK,GAClB/wC,EAAM6wC,EAAG36C,OACTi7C,EAAQnxC,EAAM,GAClBkxC,EAAMlL,OAAO6K,GACTM,IACFA,EAAQ,GAAKA,EACbD,EAAMlL,OAAOlwC,EAAO6B,MAAMw5C,EAAO,KAEnCD,EAAMlL,OAAOlwC,EAAO6B,MAAM,EAAG,IAC7B,IAAIy5C,EAAe,EAANpxC,EACTqxC,EAAOv7C,EAAO6B,MAAM,GACxB05C,EAAKC,YAAYF,EAAQ,EAAG,GAC5BF,EAAMlL,OAAOqL,GACb9pC,EAAK0pC,OAASC,EAAM74C,MACpB,IAAIX,EAAM5B,EAAO2M,KAAK8E,EAAK0pC,QAE3B,OADAN,EAAOj5C,GACAA,EAUF65C,CAAO38C,KAAMi8C,EAAIE,GAEtBn8C,KAAK48C,MAAQ17C,EAAO2M,KAAKouC,GACzBj8C,KAAKmuB,OAASjtB,EAAOkpC,YAAY,GACjCpqC,KAAK68C,UAAY37C,EAAOkpC,YAAY,GACpCpqC,KAAKysC,SAAWkC,EAChB3uC,KAAK88C,MAAQ,EACb98C,KAAKwpB,KAAO,EACZxpB,KAAK+8C,MAAQl8B,EAEb7gB,KAAKg9C,SAAW,KAChBh9C,KAAKi9C,SAAU,EAGjBr9C,EAASo8C,EAAcjF,GAEvBiF,EAAa/7C,UAAUi9C,QAAU,SAAUC,GACzC,IAAKn9C,KAAKi9C,SAAWj9C,KAAK88C,MAAO,CAC/B,IAAIM,EAAO,GAAMp9C,KAAK88C,MAAQ,GAC1BM,EAAO,KACTA,EAAOl8C,EAAO6B,MAAMq6C,EAAM,GAC1Bp9C,KAAKo8C,OAAOhL,OAAOgM,IAIvBp9C,KAAKi9C,SAAU,EACf,IAAIn6C,EAAM9C,KAAK+8C,MAAMM,QAAQr9C,KAAMm9C,GAOnC,OANIn9C,KAAKysC,SACPzsC,KAAKo8C,OAAOhL,OAAO+L,GAEnBn9C,KAAKo8C,OAAOhL,OAAOtuC,GAErB9C,KAAKwpB,MAAQ2zB,EAAM77C,OACZwB,GAGTk5C,EAAa/7C,UAAUq9C,OAAS,WAC9B,GAAIt9C,KAAKysC,WAAazsC,KAAKg9C,SAAU,MAAM,IAAI/9C,MAAM,oDAErD,IAAI2E,EAAMqS,EAAIjW,KAAKo8C,OAAOmB,MAAmB,EAAbv9C,KAAK88C,MAAuB,EAAZ98C,KAAKwpB,MAAWxpB,KAAKk8C,QAAQT,aAAaz7C,KAAKq8C,SAC/F,GAAIr8C,KAAKysC,UAnFX,SAAkB75B,EAAGC,GACnB,IAAI/P,EAAM,EACN8P,EAAEtR,SAAWuR,EAAEvR,QAAQwB,IAG3B,IADA,IAAIsI,EAAM0F,KAAK/D,IAAI6F,EAAEtR,OAAQuR,EAAEvR,QACtB+J,EAAI,EAAGA,EAAID,IAAOC,EACzBvI,GAAQ8P,EAAEvH,GAAKwH,EAAExH,GAGnB,OAAOvI,EA0Ec06C,CAAQ55C,EAAK5D,KAAKg9C,UAAW,MAAM,IAAI/9C,MAAM,oDAElEe,KAAKg9C,SAAWp5C,EAChB5D,KAAKk8C,QAAQN,SAGfI,EAAa/7C,UAAUw9C,WAAa,WAClC,GAAIz9C,KAAKysC,WAAavrC,EAAOE,SAASpB,KAAKg9C,UAAW,MAAM,IAAI/9C,MAAM,mDAEtE,OAAOe,KAAKg9C,UAGdhB,EAAa/7C,UAAUy9C,WAAa,SAAqB95C,GACvD,IAAK5D,KAAKysC,SAAU,MAAM,IAAIxtC,MAAM,mDAEpCe,KAAKg9C,SAAWp5C,GAGlBo4C,EAAa/7C,UAAU09C,OAAS,SAAiB3yC,GAC/C,GAAIhL,KAAKi9C,QAAS,MAAM,IAAIh+C,MAAM,8CAElCe,KAAKo8C,OAAOhL,OAAOpmC,GACnBhL,KAAK88C,OAAS9xC,EAAI1J,QAGpB7C,EAAOC,QAAUs9C,kBCpHjB,IAAI4B,EAAU,EAAQ,MAClBC,EAAY,EAAQ,MACpBC,EAAQ,EAAQ,MAMpBp/C,EAAQq/C,aAAer/C,EAAQs/C,OAASJ,EAAQG,aAChDr/C,EAAQu/C,eAAiBv/C,EAAQw/C,SAAWN,EAAQK,eACpDv/C,EAAQy/C,eAAiBz/C,EAAQ0/C,SAAWP,EAAUM,eACtDz/C,EAAQ2/C,iBAAmB3/C,EAAQ4/C,WAAaT,EAAUQ,iBAC1D3/C,EAAQ6/C,YAAc7/C,EAAQ8/C,WAR9B,WACE,OAAOh5C,OAAOC,KAAKq4C,oBCLrB,IAAIW,EAAa,EAAQ,MACrBv9C,EAAS,eACTw9C,EAAQ,EAAQ,IAChB1C,EAAe,EAAQ,MACvBjF,EAAY,EAAQ,MACpB8E,EAAM,EAAQ,MACd8C,EAAO,EAAQ,MAGnB,SAASP,EAAUv9B,EAAMxc,EAAK43C,GAC5BlF,EAAUx2C,KAAKP,MAEfA,KAAKmuB,OAAS,IAAIywB,EAClB5+C,KAAK6+C,WAAQ,EACb7+C,KAAKk8C,QAAU,IAAIL,EAAIlB,IAAIt2C,GAC3BrE,KAAK48C,MAAQ17C,EAAO2M,KAAKouC,GACzBj8C,KAAK+8C,MAAQl8B,EACb7gB,KAAK8+C,cAAe,EA+BtB,SAASF,IACP5+C,KAAKzB,MAAQ2C,EAAOkpC,YAAY,GA8ClC,SAASiU,EAAkBU,EAAOC,EAAU/C,GAC1C,IAAIlG,EAAS2I,EAAMK,EAAMlX,eACzB,IAAKkO,EAAQ,MAAM,IAAIlrB,UAAU,sBAGjC,GADkB,iBAAPoxB,IAAiBA,EAAK/6C,EAAO2M,KAAKouC,IACzB,QAAhBlG,EAAOl1B,MAAkBo7B,EAAG36C,SAAWy0C,EAAOkG,GAAI,MAAM,IAAIpxB,UAAU,qBAAuBoxB,EAAG36C,QAGpG,GADwB,iBAAb09C,IAAuBA,EAAW99C,EAAO2M,KAAKmxC,IACrDA,EAAS19C,SAAWy0C,EAAO1xC,IAAM,EAAG,MAAM,IAAIwmB,UAAU,sBAAwBm0B,EAAS19C,QAE7F,MAAoB,WAAhBy0C,EAAO/tC,KACF,IAAIg0C,EAAajG,EAAOt3C,OAAQugD,EAAU/C,GAAI,GAC5B,SAAhBlG,EAAO/tC,KACT,IAAIy2C,EAAW1I,EAAOt3C,OAAQugD,EAAU/C,GAAI,GAG9C,IAAImC,EAASrI,EAAOt3C,OAAQugD,EAAU/C,GAxGhC,EAAQ,KAavBr8C,CAASw+C,EAAUrH,GAEnBqH,EAASn+C,UAAUi9C,QAAU,SAAUt8C,GAErC,IAAIu8C,EACAnpB,EAFJh0B,KAAKmuB,OAAOzX,IAAI9V,GAIhB,IADA,IAAIkC,EAAM,GACFq6C,EAAQn9C,KAAKmuB,OAAO/uB,IAAIY,KAAK8+C,eACnC9qB,EAAQh0B,KAAK+8C,MAAMpO,QAAQ3uC,KAAMm9C,GACjCr6C,EAAIiC,KAAKivB,GAEX,OAAO9yB,EAAOqC,OAAOT,IAGvBs7C,EAASn+C,UAAUq9C,OAAS,WAC1B,IAAIH,EAAQn9C,KAAKmuB,OAAO8wB,QACxB,GAAIj/C,KAAK8+C,aACP,OA0CJ,SAAgBI,GACd,IAAIC,EAASD,EAAK,IAClB,GAAIC,EAAS,GAAKA,EAAS,GACzB,MAAM,IAAIlgD,MAAM,0BAGlB,IADA,IAAIoM,GAAK,IACAA,EAAI8zC,GACX,GAAID,EAAM7zC,GAAK,GAAK8zC,MAAcA,EAChC,MAAM,IAAIlgD,MAAM,0BAGpB,GAAe,KAAXkgD,EAEJ,OAAOD,EAAKt8C,MAAM,EAAG,GAAKu8C,GAvDjBC,CAAMp/C,KAAK+8C,MAAMpO,QAAQ3uC,KAAMm9C,IACjC,GAAIA,EACT,MAAM,IAAIl+C,MAAM,sCAIpBm/C,EAASn+C,UAAUo/C,eAAiB,SAAUC,GAE5C,OADAt/C,KAAK8+C,eAAiBQ,EACft/C,MAOT4+C,EAAS3+C,UAAUyW,IAAM,SAAU9V,GACjCZ,KAAKzB,MAAQ2C,EAAOqC,OAAO,CAACvD,KAAKzB,MAAOqC,KAG1Cg+C,EAAS3+C,UAAUb,IAAM,SAAUmgD,GACjC,IAAIz8C,EACJ,GAAIy8C,GACF,GAAIv/C,KAAKzB,MAAM+C,OAAS,GAGtB,OAFAwB,EAAM9C,KAAKzB,MAAMqE,MAAM,EAAG,IAC1B5C,KAAKzB,MAAQyB,KAAKzB,MAAMqE,MAAM,IACvBE,OAGT,GAAI9C,KAAKzB,MAAM+C,QAAU,GAGvB,OAFAwB,EAAM9C,KAAKzB,MAAMqE,MAAM,EAAG,IAC1B5C,KAAKzB,MAAQyB,KAAKzB,MAAMqE,MAAM,IACvBE,EAIX,OAAO,MAGT87C,EAAS3+C,UAAUg/C,MAAQ,WACzB,GAAIj/C,KAAKzB,MAAM+C,OAAQ,OAAOtB,KAAKzB,OA8CrCG,EAAQy/C,eARR,SAAyBY,EAAOC,GAC9B,IAAIjJ,EAAS2I,EAAMK,EAAMlX,eACzB,IAAKkO,EAAQ,MAAM,IAAIlrB,UAAU,sBAEjC,IAAIplB,EAAOk5C,EAAKK,GAAU,EAAOjJ,EAAO1xC,IAAK0xC,EAAOkG,IACpD,OAAOoC,EAAiBU,EAAOt5C,EAAKpB,IAAKoB,EAAKw2C,KAIhDv9C,EAAQ2/C,iBAAmBA,kBC3H3B,IAAIK,EAAQ,EAAQ,IAChBD,EAAa,EAAQ,MACrBv9C,EAAS,eACT86C,EAAe,EAAQ,MACvBjF,EAAY,EAAQ,MACpB8E,EAAM,EAAQ,MACd8C,EAAO,EAAQ,MAGnB,SAASX,EAAQn9B,EAAMxc,EAAK43C,GAC1BlF,EAAUx2C,KAAKP,MAEfA,KAAKmuB,OAAS,IAAIywB,EAClB5+C,KAAKk8C,QAAU,IAAIL,EAAIlB,IAAIt2C,GAC3BrE,KAAK48C,MAAQ17C,EAAO2M,KAAKouC,GACzBj8C,KAAK+8C,MAAQl8B,EACb7gB,KAAK8+C,cAAe,EATP,EAAQ,KAYvBl/C,CAASo+C,EAAQjH,GAEjBiH,EAAO/9C,UAAUi9C,QAAU,SAAUt8C,GAEnC,IAAIu8C,EACAnpB,EAFJh0B,KAAKmuB,OAAOzX,IAAI9V,GAKhB,IAFA,IAAIkC,EAAM,GAEFq6C,EAAQn9C,KAAKmuB,OAAO/uB,OAC1B40B,EAAQh0B,KAAK+8C,MAAMM,QAAQr9C,KAAMm9C,GACjCr6C,EAAIiC,KAAKivB,GAGX,OAAO9yB,EAAOqC,OAAOT,IAGvB,IAAI08C,EAAUt+C,EAAO6B,MAAM,GAAI,IAqB/B,SAAS67C,IACP5+C,KAAKzB,MAAQ2C,EAAOkpC,YAAY,GA4BlC,SAAS6T,EAAgBc,EAAOC,EAAU/C,GACxC,IAAIlG,EAAS2I,EAAMK,EAAMlX,eACzB,IAAKkO,EAAQ,MAAM,IAAIlrB,UAAU,sBAGjC,GADwB,iBAAbm0B,IAAuBA,EAAW99C,EAAO2M,KAAKmxC,IACrDA,EAAS19C,SAAWy0C,EAAO1xC,IAAM,EAAG,MAAM,IAAIwmB,UAAU,sBAAwBm0B,EAAS19C,QAG7F,GADkB,iBAAP26C,IAAiBA,EAAK/6C,EAAO2M,KAAKouC,IACzB,QAAhBlG,EAAOl1B,MAAkBo7B,EAAG36C,SAAWy0C,EAAOkG,GAAI,MAAM,IAAIpxB,UAAU,qBAAuBoxB,EAAG36C,QAEpG,MAAoB,WAAhBy0C,EAAO/tC,KACF,IAAIg0C,EAAajG,EAAOt3C,OAAQugD,EAAU/C,GACxB,SAAhBlG,EAAO/tC,KACT,IAAIy2C,EAAW1I,EAAOt3C,OAAQugD,EAAU/C,GAG1C,IAAI+B,EAAOjI,EAAOt3C,OAAQugD,EAAU/C,GAhE7C+B,EAAO/9C,UAAUq9C,OAAS,WACxB,IAAIH,EAAQn9C,KAAKmuB,OAAO8wB,QACxB,GAAIj/C,KAAK8+C,aAGP,OAFA3B,EAAQn9C,KAAK+8C,MAAMM,QAAQr9C,KAAMm9C,GACjCn9C,KAAKk8C,QAAQN,QACNuB,EAGT,IAAKA,EAAMjS,OAAOsU,GAEhB,MADAx/C,KAAKk8C,QAAQN,QACP,IAAI38C,MAAM,sCAIpB++C,EAAO/9C,UAAUo/C,eAAiB,SAAUC,GAE1C,OADAt/C,KAAK8+C,eAAiBQ,EACft/C,MAOT4+C,EAAS3+C,UAAUyW,IAAM,SAAU9V,GACjCZ,KAAKzB,MAAQ2C,EAAOqC,OAAO,CAACvD,KAAKzB,MAAOqC,KAG1Cg+C,EAAS3+C,UAAUb,IAAM,WACvB,GAAIY,KAAKzB,MAAM+C,OAAS,GAAI,CAC1B,IAAIwB,EAAM9C,KAAKzB,MAAMqE,MAAM,EAAG,IAE9B,OADA5C,KAAKzB,MAAQyB,KAAKzB,MAAMqE,MAAM,IACvBE,EAET,OAAO,MAGT87C,EAAS3+C,UAAUg/C,MAAQ,WAKzB,IAJA,IAAI7zC,EAAM,GAAKpL,KAAKzB,MAAM+C,OACtBm+C,EAAUv+C,EAAOkpC,YAAYh/B,GAE7BC,GAAK,IACAA,EAAID,GACXq0C,EAAQC,WAAWt0C,EAAKC,GAG1B,OAAOnK,EAAOqC,OAAO,CAACvD,KAAKzB,MAAOkhD,KA8BpC/gD,EAAQu/C,eAAiBA,EACzBv/C,EAAQq/C,aATR,SAAuBgB,EAAOC,GAC5B,IAAIjJ,EAAS2I,EAAMK,EAAMlX,eACzB,IAAKkO,EAAQ,MAAM,IAAIlrB,UAAU,sBAEjC,IAAIplB,EAAOk5C,EAAKK,GAAU,EAAOjJ,EAAO1xC,IAAK0xC,EAAOkG,IACpD,OAAOgC,EAAec,EAAOt5C,EAAKpB,IAAKoB,EAAKw2C,qBC7G9C,IAAI/6C,EAAS,eACTy+C,EAASz+C,EAAO6B,MAAM,GAAI,GAW9B,SAAS68C,EAAW98C,GAClB,IAAIkI,EAAM9J,EAAOkpC,YAAY,IAK7B,OAJAp/B,EAAIq/B,cAAcvnC,EAAI,KAAO,EAAG,GAChCkI,EAAIq/B,cAAcvnC,EAAI,KAAO,EAAG,GAChCkI,EAAIq/B,cAAcvnC,EAAI,KAAO,EAAG,GAChCkI,EAAIq/B,cAAcvnC,EAAI,KAAO,EAAG,IACzBkI,EAGT,SAAS8wC,EAAOz3C,GACdrE,KAAK4f,EAAIvb,EACTrE,KAAKyD,MAAQvC,EAAO6B,MAAM,GAAI,GAC9B/C,KAAKzB,MAAQ2C,EAAOkpC,YAAY,GAKlC0R,EAAM77C,UAAUq8C,MAAQ,SAAUuD,GAEhC,IADA,IAAIx0C,GAAK,IACAA,EAAIw0C,EAAMv+C,QACjBtB,KAAKyD,MAAM4H,IAAMw0C,EAAMx0C,GAEzBrL,KAAK8/C,aAGPhE,EAAM77C,UAAU6/C,UAAY,WAK1B,IAJA,IAnCgB90C,EAqCZM,EAAOy0C,EAFPC,EAlCG,EADSh1C,EAmCChL,KAAK4f,GAjChButB,aAAa,GACjBniC,EAAImiC,aAAa,GACjBniC,EAAImiC,aAAa,GACjBniC,EAAImiC,aAAa,KA+Bf8S,EAAK,CAAC,EAAG,EAAG,EAAG,GAEf50C,GAAK,IACAA,EAAI,KAAK,CAchB,IAbwD,IAAlDrL,KAAKyD,SAAS4H,EAAI,IAAO,GAAM,EAAKA,EAAI,KAG5C40C,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,GACZC,EAAG,IAAMD,EAAG,IAIdD,EAAwB,IAAP,EAARC,EAAG,IAGP10C,EAAI,EAAGA,EAAI,EAAGA,IACjB00C,EAAG10C,GAAM00C,EAAG10C,KAAO,GAAmB,EAAZ00C,EAAG10C,EAAI,KAAW,GAE9C00C,EAAG,GAAKA,EAAG,KAAO,EAGdD,IACFC,EAAG,GAAKA,EAAG,GAAM,KAAQ,IAG7BhgD,KAAKyD,MAAQm8C,EAAUK,IAGzBnE,EAAM77C,UAAUmxC,OAAS,SAAUpmC,GAEjC,IAAImyC,EACJ,IAFAn9C,KAAKzB,MAAQ2C,EAAOqC,OAAO,CAACvD,KAAKzB,MAAOyM,IAEjChL,KAAKzB,MAAM+C,QAAU,IAC1B67C,EAAQn9C,KAAKzB,MAAMqE,MAAM,EAAG,IAC5B5C,KAAKzB,MAAQyB,KAAKzB,MAAMqE,MAAM,IAC9B5C,KAAKs8C,MAAMa,IAIfrB,EAAM77C,UAAUs9C,MAAQ,SAAU2C,EAAKC,GAMrC,OALIngD,KAAKzB,MAAM+C,QACbtB,KAAKs8C,MAAMp7C,EAAOqC,OAAO,CAACvD,KAAKzB,MAAOohD,GAAS,KAGjD3/C,KAAKs8C,MAAMsD,EAAU,CAAC,EAAGM,EAAK,EAAGC,KAC1BngD,KAAKyD,OAGdhF,EAAOC,QAAUo9C,WC1EjBr9C,EAAOC,QAdP,SAAiBu9C,GAGf,IAFA,IACIp6C,EADAuJ,EAAM6wC,EAAG36C,OAEN8J,KAAO,CAEZ,GAAa,OADbvJ,EAAOo6C,EAAG55C,UAAU+I,IAGb,CACLvJ,IACAo6C,EAAGyD,WAAW79C,EAAMuJ,GACpB,MAJA6wC,EAAGyD,WAAW,EAAGt0C,qBCNvB,IAAI6K,EAAM,EAAQ,MAElBvX,EAAQ2+C,QAAU,SAAU1qC,EAAMktC,GAChC,IAAIj/C,EAAOqV,EAAI4pC,EAAOltC,EAAKiqC,OAG3B,OADAjqC,EAAKiqC,MAAQjqC,EAAKupC,QAAQT,aAAa76C,GAChC+R,EAAKiqC,OAGdl+C,EAAQiwC,QAAU,SAAUh8B,EAAMktC,GAChC,IAAIO,EAAMztC,EAAKiqC,MAEfjqC,EAAKiqC,MAAQiD,EACb,IAAI/8C,EAAM6P,EAAKupC,QAAQR,aAAamE,GAEpC,OAAO5pC,EAAInT,EAAKs9C,oBCflB,IAAIl/C,EAAS,eACT+U,EAAM,EAAQ,MAElB,SAASoqC,EAAc1tC,EAAM/R,EAAM+tC,GACjC,IAAIvjC,EAAMxK,EAAKU,OACXwB,EAAMmT,EAAIrV,EAAM+R,EAAKwb,QAGzB,OAFAxb,EAAKwb,OAASxb,EAAKwb,OAAOvrB,MAAMwI,GAChCuH,EAAKiqC,MAAQ17C,EAAOqC,OAAO,CAACoP,EAAKiqC,MAAOjO,EAAU/tC,EAAOkC,IAClDA,EAGTpE,EAAQ2+C,QAAU,SAAU1qC,EAAM/R,EAAM+tC,GAItC,IAHA,IACIvjC,EADAtI,EAAM5B,EAAOkpC,YAAY,GAGtBxpC,EAAKU,QAAQ,CAMlB,GAL2B,IAAvBqR,EAAKwb,OAAO7sB,SACdqR,EAAKwb,OAASxb,EAAKupC,QAAQT,aAAa9oC,EAAKiqC,OAC7CjqC,EAAKiqC,MAAQ17C,EAAOkpC,YAAY,MAG9Bz3B,EAAKwb,OAAO7sB,QAAUV,EAAKU,QAIxB,CACLwB,EAAM5B,EAAOqC,OAAO,CAACT,EAAKu9C,EAAa1tC,EAAM/R,EAAM+tC,KACnD,MALAvjC,EAAMuH,EAAKwb,OAAO7sB,OAClBwB,EAAM5B,EAAOqC,OAAO,CAACT,EAAKu9C,EAAa1tC,EAAM/R,EAAKgC,MAAM,EAAGwI,GAAMujC,KACjE/tC,EAAOA,EAAKgC,MAAMwI,GAOtB,OAAOtI,mBC/BT,IAAI5B,EAAS,eAEb,SAASo/C,EAAa3tC,EAAM4tC,EAAW5R,GAMrC,IALA,IAIIr4B,EAAK7U,EAHL4J,GAAK,EAELvI,EAAM,IAEDuI,EAHC,GAKRiL,EAAOiqC,EAAa,GAAM,EAAIl1C,EAAO,IAAO,EAE5CvI,IAAiB,KADjBrB,EAFMkR,EAAKupC,QAAQT,aAAa9oC,EAAKiqC,OAEzB,GAAKtmC,KACUjL,EAAI,EAC/BsH,EAAKiqC,MAAQ4D,EAAQ7tC,EAAKiqC,MAAOjO,EAAUr4B,EAAM7U,GAEnD,OAAOqB,EAGT,SAAS09C,EAASj1C,EAAQ9J,GACxB,IAAI2J,EAAMG,EAAOjK,OACb+J,GAAK,EACLvI,EAAM5B,EAAOkpC,YAAY7+B,EAAOjK,QAGpC,IAFAiK,EAASrK,EAAOqC,OAAO,CAACgI,EAAQrK,EAAO2M,KAAK,CAACpM,QAEpC4J,EAAID,GACXtI,EAAIuI,GAAKE,EAAOF,IAAM,EAAIE,EAAOF,EAAI,IAAM,EAG7C,OAAOvI,EAGTpE,EAAQ2+C,QAAU,SAAU1qC,EAAMwqC,EAAOxO,GAKvC,IAJA,IAAIvjC,EAAM+xC,EAAM77C,OACZwB,EAAM5B,EAAOkpC,YAAYh/B,GACzBC,GAAK,IAEAA,EAAID,GACXtI,EAAIuI,GAAKi1C,EAAY3tC,EAAMwqC,EAAM9xC,GAAIsjC,GAGvC,OAAO7rC,mBCxCT,IAAI5B,EAAS,eAEb,SAASo/C,EAAa3tC,EAAM4tC,EAAW5R,GACrC,IACI7rC,EADM6P,EAAKupC,QAAQT,aAAa9oC,EAAKiqC,OAC3B,GAAK2D,EAOnB,OALA5tC,EAAKiqC,MAAQ17C,EAAOqC,OAAO,CACzBoP,EAAKiqC,MAAMh6C,MAAM,GACjB1B,EAAO2M,KAAK,CAAC8gC,EAAU4R,EAAYz9C,MAG9BA,EAGTpE,EAAQ2+C,QAAU,SAAU1qC,EAAMwqC,EAAOxO,GAKvC,IAJA,IAAIvjC,EAAM+xC,EAAM77C,OACZwB,EAAM5B,EAAOkpC,YAAYh/B,GACzBC,GAAK,IAEAA,EAAID,GACXtI,EAAIuI,GAAKi1C,EAAY3tC,EAAMwqC,EAAM9xC,GAAIsjC,GAGvC,OAAO7rC,mBCvBT,IAAImT,EAAM,EAAQ,MACd/U,EAAS,eACT66C,EAAS,EAAQ,KAErB,SAAS0E,EAAU9tC,GACjB,IAAI7P,EAAM6P,EAAKupC,QAAQV,gBAAgB7oC,EAAKiqC,OAE5C,OADAb,EAAOppC,EAAKiqC,OACL95C,EAITpE,EAAQ2+C,QAAU,SAAU1qC,EAAMwqC,GAChC,IAAIuD,EAAW5vC,KAAKS,KAAK4rC,EAAM77C,OAFjB,IAGVuF,EAAQ8L,EAAKwb,OAAO7sB,OACxBqR,EAAKwb,OAASjtB,EAAOqC,OAAO,CAC1BoP,EAAKwb,OACLjtB,EAAOkpC,YANK,GAMOsW,KAErB,IAAK,IAAIr1C,EAAI,EAAGA,EAAIq1C,EAAUr1C,IAAK,CACjC,IAAIvI,EAAM29C,EAAS9tC,GACftR,EAASwF,EAVD,GAUSwE,EACrBsH,EAAKwb,OAAOkc,cAAcvnC,EAAI,GAAIzB,EAAS,GAC3CsR,EAAKwb,OAAOkc,cAAcvnC,EAAI,GAAIzB,EAAS,GAC3CsR,EAAKwb,OAAOkc,cAAcvnC,EAAI,GAAIzB,EAAS,GAC3CsR,EAAKwb,OAAOkc,cAAcvnC,EAAI,GAAIzB,EAAS,IAE7C,IAAI++C,EAAMztC,EAAKwb,OAAOvrB,MAAM,EAAGu6C,EAAM77C,QAErC,OADAqR,EAAKwb,OAASxb,EAAKwb,OAAOvrB,MAAMu6C,EAAM77C,QAC/B2U,EAAIknC,EAAOiD,kBC5BpB1hD,EAAQ2+C,QAAU,SAAU1qC,EAAMktC,GAChC,OAAOltC,EAAKupC,QAAQT,aAAaoE,IAGnCnhD,EAAQiwC,QAAU,SAAUh8B,EAAMktC,GAChC,OAAOltC,EAAKupC,QAAQR,aAAamE,kBCLnC,IAAIc,EAAc,CAChBC,IAAK,EAAQ,MACbC,IAAK,EAAQ,MACbC,IAAK,EAAQ,MACbC,KAAM,EAAQ,MACdC,KAAM,EAAQ,MACdC,IAAK,EAAQ,MACbC,IAAK,EAAQ,MACbC,IAAK,EAAQ,OAGXrD,EAAQ,EAAQ,MAEpB,IAAK,IAAIz5C,KAAOy5C,EACdA,EAAMz5C,GAAK5F,OAASkiD,EAAY7C,EAAMz5C,GAAKwc,MAG7CpiB,EAAOC,QAAUo/C,uCCjBb7nC,EAAM,EAAQ,MAElB,SAASwqC,EAAU9tC,GAEjB,OADAA,EAAKiqC,MAAQjqC,EAAKupC,QAAQT,aAAa9oC,EAAKiqC,OACrCjqC,EAAKiqC,MAGdl+C,EAAQ2+C,QAAU,SAAU1qC,EAAMwqC,GAChC,KAAOxqC,EAAKwb,OAAO7sB,OAAS67C,EAAM77C,QAChCqR,EAAKwb,OAASjtB,EAAOqC,OAAO,CAACoP,EAAKwb,OAAQsyB,EAAS9tC,KAGrD,IAAIytC,EAAMztC,EAAKwb,OAAOvrB,MAAM,EAAGu6C,EAAM77C,QAErC,OADAqR,EAAKwb,OAASxb,EAAKwb,OAAOvrB,MAAMu6C,EAAM77C,QAC/B2U,EAAIknC,EAAOiD,oBCdpB,IAAIvE,EAAM,EAAQ,MACd36C,EAAS,eACT61C,EAAY,EAAQ,MAGxB,SAASiF,EAAcn7B,EAAMxc,EAAK43C,EAAItN,GACpCoI,EAAUx2C,KAAKP,MAEfA,KAAKk8C,QAAU,IAAIL,EAAIlB,IAAIt2C,GAC3BrE,KAAK48C,MAAQ17C,EAAO2M,KAAKouC,GACzBj8C,KAAKmuB,OAASjtB,EAAOkpC,YAAY,GACjCpqC,KAAK68C,UAAY37C,EAAOkpC,YAAY,GACpCpqC,KAAKysC,SAAWkC,EAChB3uC,KAAK+8C,MAAQl8B,EAVA,EAAQ,KAavBjhB,CAASo8C,EAAcjF,GAEvBiF,EAAa/7C,UAAUi9C,QAAU,SAAUC,GACzC,OAAOn9C,KAAK+8C,MAAMM,QAAQr9C,KAAMm9C,EAAOn9C,KAAKysC,WAG9CuP,EAAa/7C,UAAUq9C,OAAS,WAC9Bt9C,KAAKk8C,QAAQN,SAGfn9C,EAAOC,QAAUs9C,kBC1BjB,IAAIoF,EAAM,EAAQ,MACdvF,EAAM,EAAQ,MACdwF,EAAW,EAAQ,IACnBC,EAAW,EAAQ,MACnB3C,EAAO,EAAQ,MAsCnB,SAASV,EAAgBc,EAAO16C,EAAK43C,GAEnC,GADA8C,EAAQA,EAAMlX,cACVwZ,EAAStC,GAAQ,OAAOlD,EAAIoC,eAAec,EAAO16C,EAAK43C,GAC3D,GAAIqF,EAASvC,GAAQ,OAAO,IAAIqC,EAAI,CAAE/8C,IAAKA,EAAK43C,GAAIA,EAAIp7B,KAAMk+B,IAE9D,MAAM,IAAIl0B,UAAU,sBAGtB,SAASwzB,EAAkBU,EAAO16C,EAAK43C,GAErC,GADA8C,EAAQA,EAAMlX,cACVwZ,EAAStC,GAAQ,OAAOlD,EAAIwC,iBAAiBU,EAAO16C,EAAK43C,GAC7D,GAAIqF,EAASvC,GAAQ,OAAO,IAAIqC,EAAI,CAAE/8C,IAAKA,EAAK43C,GAAIA,EAAIp7B,KAAMk+B,EAAOpQ,SAAS,IAE9E,MAAM,IAAI9jB,UAAU,sBAOtBnsB,EAAQq/C,aAAer/C,EAAQs/C,OAxD/B,SAAuBe,EAAOC,GAG5B,IAAIuC,EAAQC,EACZ,GAHAzC,EAAQA,EAAMlX,cAGVwZ,EAAStC,GACXwC,EAASF,EAAStC,GAAO16C,IACzBm9C,EAAQH,EAAStC,GAAO9C,OACnB,KAAIqF,EAASvC,GAIlB,MAAM,IAAIl0B,UAAU,sBAHpB02B,EAA+B,EAAtBD,EAASvC,GAAO16C,IACzBm9C,EAAQF,EAASvC,GAAO9C,GAK1B,IAAIx2C,EAAOk5C,EAAKK,GAAU,EAAOuC,EAAQC,GACzC,OAAOvD,EAAec,EAAOt5C,EAAKpB,IAAKoB,EAAKw2C,KA0C9Cv9C,EAAQu/C,eAAiBv/C,EAAQw/C,SAAWD,EAC5Cv/C,EAAQy/C,eAAiBz/C,EAAQ0/C,SAxCjC,SAAyBW,EAAOC,GAG9B,IAAIuC,EAAQC,EACZ,GAHAzC,EAAQA,EAAMlX,cAGVwZ,EAAStC,GACXwC,EAASF,EAAStC,GAAO16C,IACzBm9C,EAAQH,EAAStC,GAAO9C,OACnB,KAAIqF,EAASvC,GAIlB,MAAM,IAAIl0B,UAAU,sBAHpB02B,EAA+B,EAAtBD,EAASvC,GAAO16C,IACzBm9C,EAAQF,EAASvC,GAAO9C,GAK1B,IAAIx2C,EAAOk5C,EAAKK,GAAU,EAAOuC,EAAQC,GACzC,OAAOnD,EAAiBU,EAAOt5C,EAAKpB,IAAKoB,EAAKw2C,KA0BhDv9C,EAAQ2/C,iBAAmB3/C,EAAQ4/C,WAAaD,EAChD3/C,EAAQ6/C,YAAc7/C,EAAQ8/C,WAR9B,WACE,OAAOh5C,OAAOC,KAAK67C,GAAU/9C,OAAOs4C,EAAI2C,+BC3D1C,IAAIiD,EAAa,EAAQ,MACrBC,EAAM,EAAQ,MACd9hD,EAAW,EAAQ,MACnBsB,EAAS,eAET48C,EAAQ,CACV,eAAgB4D,EAAIb,IAAIc,YAAYD,EAAIE,KACxC,WAAYF,EAAIE,IAChB,cAAeF,EAAIb,IAAIc,YAAYD,EAAIE,KACvC,UAAWF,EAAIE,IACf,UAAWF,EAAIb,IAAIc,YAAYD,EAAIN,KACnC,UAAWM,EAAIN,KAMjB,SAASA,EAAKniB,GACZwiB,EAAWlhD,KAAKP,MAChB,IAEIgI,EAFA65C,EAAW5iB,EAAKpe,KAAKgnB,cACrBhnB,EAAOi9B,EAAM+D,GAGf75C,EADEi3B,EAAK0P,QACA,UAEA,UAET,IAAItqC,EAAM46B,EAAK56B,IACVnD,EAAOE,SAASiD,KACnBA,EAAMnD,EAAO2M,KAAKxJ,IAEH,YAAbw9C,GAAuC,gBAAbA,IAC5Bx9C,EAAMnD,EAAOqC,OAAO,CAACc,EAAKA,EAAIzB,MAAM,EAAG,MAEzC,IAAIq5C,EAAKhd,EAAKgd,GACT/6C,EAAOE,SAAS66C,KACnBA,EAAK/6C,EAAO2M,KAAKouC,IAEnBj8C,KAAK8hD,KAAOjhC,EAAK2N,OAAO,CACtBnqB,IAAKA,EACL43C,GAAIA,EACJj0C,KAAMA,IA5BV81C,EAAM4D,IAAM5D,EAAM,WAClBA,EAAMiE,KAAOjE,EAAM,gBACnBr/C,EAAOC,QAAU0iD,EACjBxhD,EAASwhD,EAAKK,GA4BdL,EAAInhD,UAAUi9C,QAAU,SAAUt8C,GAChC,OAAOM,EAAO2M,KAAK7N,KAAK8hD,KAAK1Q,OAAOxwC,KAEtCwgD,EAAInhD,UAAUq9C,OAAS,WACrB,OAAOp8C,EAAO2M,KAAK7N,KAAK8hD,KAAKvE,wBChD/B7+C,EAAQ,WAAa,CACnB2F,IAAK,EACL43C,GAAI,GAENv9C,EAAQ,WAAaA,EAAQgjD,IAAM,CACjCr9C,IAAK,EACL43C,GAAI,GAENv9C,EAAQ,gBAAkBA,EAAQqjD,KAAO,CACvC19C,IAAK,GACL43C,GAAI,GAENv9C,EAAQ,YAAc,CACpB2F,IAAK,GACL43C,GAAI,GAENv9C,EAAQ,eAAiB,CACvB2F,IAAK,GACL43C,GAAI,GAENv9C,EAAQ,WAAa,CACnB2F,IAAK,GACL43C,GAAI,wCCtBFpsC,EAAK,EAAQ,MACb+oC,EAAc,EAAQ,MAQ1B,SAASoJ,EAAMC,GACb,IACItxC,EADAvF,EAAM62C,EAAKC,QAAQngD,aAEvB,GACE4O,EAAI,IAAId,EAAG+oC,EAAYxtC,UAChBuF,EAAEO,IAAI+wC,EAAKC,UAAY,IAAMvxC,EAAE0Q,KAAK4gC,EAAKE,UAAYxxC,EAAE0Q,KAAK4gC,EAAKG,SAC1E,OAAOzxC,EAGT,SAAS0xC,EAAK54C,EAAKw4C,GACjB,IAAIK,EAhBN,SAAgBL,GACd,IAAItxC,EAAIqxC,EAAKC,GAEb,MAAO,CAAEM,QADK5xC,EAAEgT,MAAM9T,EAAGuX,KAAK66B,EAAKC,UAAUh9B,OAAO,IAAIrV,EAAGoyC,EAAKO,iBAAiBz+B,UACtD0+B,UAAW9xC,EAAEkS,KAAKo/B,EAAKC,UAarCQ,CAAMT,GACf72C,EAAM62C,EAAKC,QAAQngD,aACnB4gD,EAAU,IAAI9yC,EAAGpG,GAAKoH,IAAIyxC,EAAOC,SAASlhC,KAAK4gC,EAAKC,SACpDU,EAAKD,EAAQh/B,MAAM9T,EAAGuX,KAAK66B,EAAKE,SAChCU,EAAKF,EAAQh/B,MAAM9T,EAAGuX,KAAK66B,EAAKG,SAChCU,EAAOb,EAAKc,YACZvzC,EAAIyyC,EAAKE,OACTjuC,EAAI+tC,EAAKG,OACTzG,EAAKiH,EAAG19B,OAAO+8B,EAAKe,WAAWj/B,UAC/Bk/B,EAAKJ,EAAG39B,OAAO+8B,EAAKiB,WAAWn/B,UAC/BnE,EAAI+7B,EAAGllC,KAAKwsC,GAAIroC,KAAKkoC,GAAMzhC,KAAK7R,GAAGoL,KAAK1G,GAC5C,OAAO+uC,EAAGzsC,KAAKoJ,GAAGhF,KAAK0nC,EAAOG,WAAWphC,KAAK4gC,EAAKC,SAASpuC,YAAY5S,EAAQ,KAAMkK,GAExFi3C,EAAIL,KAAOA,EAEXvjD,EAAOC,QAAU2jD,kBClCjB5jD,EAAOC,QAAU,EAAjB,sBCAA,IAAIwC,EAAS,eACTiiD,EAAa,EAAQ,MACrBtjB,EAAS,EAAQ,MACjBjgC,EAAW,EAAQ,MACnBuP,EAAO,EAAQ,MACfi0C,EAAS,EAAQ,MAEjBC,EAAa,EAAQ,MAMzB,SAASC,EAAMC,GACb1jB,EAAO2jB,SAASjjD,KAAKP,MAErB,IAAIY,EAAOyiD,EAAWE,GACtB,IAAK3iD,EAAM,MAAM,IAAI3B,MAAM,0BAE3Be,KAAKyjD,UAAY7iD,EAAK8iD,KACtB1jD,KAAK2jD,MAAQR,EAAWviD,EAAK8iD,MAC7B1jD,KAAK4jD,KAAOhjD,EAAK0N,GACjBtO,KAAK6jD,UAAYjjD,EAAKuO,KAwBxB,SAAS20C,EAAQP,GACf1jB,EAAO2jB,SAASjjD,KAAKP,MAErB,IAAIY,EAAOyiD,EAAWE,GACtB,IAAK3iD,EAAM,MAAM,IAAI3B,MAAM,0BAE3Be,KAAK2jD,MAAQR,EAAWviD,EAAK8iD,MAC7B1jD,KAAK4jD,KAAOhjD,EAAK0N,GACjBtO,KAAK6jD,UAAYjjD,EAAKuO,KAwBxB,SAAS40C,EAAYR,GACnB,OAAO,IAAID,EAAKC,GAGlB,SAASS,EAAcT,GACrB,OAAO,IAAIO,EAAOP,GA3EpB/9C,OAAOC,KAAK49C,GAAYrgD,SAAQ,SAAUqB,GACxCg/C,EAAWh/C,GAAKiK,GAAKpN,EAAO2M,KAAKw1C,EAAWh/C,GAAKiK,GAAI,OACrD+0C,EAAWh/C,EAAIwjC,eAAiBwb,EAAWh/C,MAc7CzE,EAAS0jD,EAAMzjB,EAAO2jB,UAEtBF,EAAKrjD,UAAUusC,OAAS,SAAiB5rC,EAAM6d,EAAGsW,GAChD/0B,KAAK2jD,MAAMvS,OAAOxwC,GAClBm0B,KAGFuuB,EAAKrjD,UAAUmxC,OAAS,SAAiBxwC,EAAMH,GAI7C,MAHoB,iBAATG,IAAmBA,EAAOM,EAAO2M,KAAKjN,EAAMH,IAEvDT,KAAK2jD,MAAMvS,OAAOxwC,GACXZ,MAGTsjD,EAAKrjD,UAAUkP,KAAO,SAAqB9K,EAAK5D,GAC9CT,KAAK0N,MACL,IAAIg2C,EAAO1jD,KAAK2jD,MAAMM,SAClBC,EAAM/0C,EAAKu0C,EAAMr/C,EAAKrE,KAAKyjD,UAAWzjD,KAAK6jD,UAAW7jD,KAAK4jD,MAE/D,OAAOnjD,EAAMyjD,EAAIj4C,SAASxL,GAAOyjD,GAanCtkD,EAASkkD,EAAQjkB,EAAO2jB,UAExBM,EAAO7jD,UAAUusC,OAAS,SAAiB5rC,EAAM6d,EAAGsW,GAClD/0B,KAAK2jD,MAAMvS,OAAOxwC,GAClBm0B,KAGF+uB,EAAO7jD,UAAUmxC,OAAS,SAAiBxwC,EAAMH,GAI/C,MAHoB,iBAATG,IAAmBA,EAAOM,EAAO2M,KAAKjN,EAAMH,IAEvDT,KAAK2jD,MAAMvS,OAAOxwC,GACXZ,MAGT8jD,EAAO7jD,UAAUmjD,OAAS,SAAuB/+C,EAAK6/C,EAAKzjD,GACtC,iBAARyjD,IAAkBA,EAAMhjD,EAAO2M,KAAKq2C,EAAKzjD,IAEpDT,KAAK0N,MACL,IAAIg2C,EAAO1jD,KAAK2jD,MAAMM,SACtB,OAAOb,EAAOc,EAAKR,EAAMr/C,EAAKrE,KAAK6jD,UAAW7jD,KAAK4jD,OAWrDnlD,EAAOC,QAAU,CACf4kD,KAAMS,EACND,OAAQE,EACRD,WAAYA,EACZC,aAAcA,mBCzFhB,IAAI9iD,EAAS,eACTijD,EAAa,EAAQ,MACrB9B,EAAM,EAAQ,MACd+B,EAAK,WACLv0C,EAAK,EAAQ,MACbw0C,EAAY,EAAQ,KACpBC,EAAS,EAAQ,MAyErB,SAASC,EAAQroC,EAAGhI,EAAGwvC,EAAMc,GAE3B,IADAtoC,EAAIhb,EAAO2M,KAAKqO,EAAEhN,YACZ5N,OAAS4S,EAAEnS,aAAc,CAC7B,IAAIwQ,EAAQrR,EAAO6B,MAAMmR,EAAEnS,aAAema,EAAE5a,QAC5C4a,EAAIhb,EAAOqC,OAAO,CAACgP,EAAO2J,IAE5B,IAAIuoC,EAAOf,EAAKpiD,OACZojD,EAkBN,SAAsBplC,EAAMpL,GAE1BoL,GADAA,EAAOqlC,EAASrlC,EAAMpL,IACVpC,IAAIoC,GAChB,IAAIpR,EAAM5B,EAAO2M,KAAKyR,EAAKpQ,WAC3B,GAAIpM,EAAIxB,OAAS4S,EAAEnS,aAAc,CAC/B,IAAIwQ,EAAQrR,EAAO6B,MAAMmR,EAAEnS,aAAee,EAAIxB,QAC9CwB,EAAM5B,EAAOqC,OAAO,CAACgP,EAAOzP,IAE9B,OAAOA,EA1BK8hD,CAAYlB,EAAMxvC,GAC1B6kC,EAAI73C,EAAO6B,MAAM0hD,GACrB1L,EAAE8L,KAAK,GACP,IAAI7xC,EAAI9R,EAAO6B,MAAM0hD,GAKrB,OAJAzxC,EAAImxC,EAAWK,EAAMxxC,GAAGo+B,OAAO2H,GAAG3H,OAAOlwC,EAAO2M,KAAK,CAAC,KAAKujC,OAAOl1B,GAAGk1B,OAAOsT,GAAOT,SACnFlL,EAAIoL,EAAWK,EAAMxxC,GAAGo+B,OAAO2H,GAAGkL,SAG3B,CAAEjxC,EAFTA,EAAImxC,EAAWK,EAAMxxC,GAAGo+B,OAAO2H,GAAG3H,OAAOlwC,EAAO2M,KAAK,CAAC,KAAKujC,OAAOl1B,GAAGk1B,OAAOsT,GAAOT,SAEpElL,EADfA,EAAIoL,EAAWK,EAAMxxC,GAAGo+B,OAAO2H,GAAGkL,UAIpC,SAASU,EAAUG,EAAO5wC,GACxB,IAAIoL,EAAO,IAAIzP,EAAGi1C,GACdnkC,GAASmkC,EAAMxjD,QAAU,GAAK4S,EAAEO,YAEpC,OADIkM,EAAQ,GAAGrB,EAAKS,MAAMY,GACnBrB,EAcT,SAASylC,EAAS7wC,EAAG8wC,EAAIR,GACvB,IAAIjwC,EACAvB,EAEJ,EAAG,CAGD,IAFAuB,EAAIrT,EAAO6B,MAAM,GAEC,EAAXwR,EAAEjT,OAAa4S,EAAEO,aACtBuwC,EAAGjM,EAAIoL,EAAWK,EAAMQ,EAAGhyC,GAAGo+B,OAAO4T,EAAGjM,GAAGkL,SAC3C1vC,EAAIrT,EAAOqC,OAAO,CAACgR,EAAGywC,EAAGjM,IAG3B/lC,EAAI2xC,EAASpwC,EAAGL,GAChB8wC,EAAGhyC,EAAImxC,EAAWK,EAAMQ,EAAGhyC,GAAGo+B,OAAO4T,EAAGjM,GAAG3H,OAAOlwC,EAAO2M,KAAK,CAAC,KAAKo2C,SACpEe,EAAGjM,EAAIoL,EAAWK,EAAMQ,EAAGhyC,GAAGo+B,OAAO4T,EAAGjM,GAAGkL,gBACtB,IAAdjxC,EAAE9B,IAAIgD,IAEf,OAAOlB,EAGT,SAASiyC,EAAOjjC,EAAGhP,EAAGxD,EAAG0E,GACvB,OAAO8N,EAAE2B,MAAM9T,EAAGuX,KAAK5X,IAAI0V,OAAOlS,GAAG+Q,UAAUjS,IAAIoC,GAGrDzV,EAAOC,QAnIP,SAAeglD,EAAMr/C,EAAK6gD,EAAUC,EAAUvhD,GAC5C,IAAIq+C,EAAOoC,EAAUhgD,GACrB,GAAI49C,EAAKmD,MAAO,CAEd,GAAiB,UAAbD,GAAqC,cAAbA,EAA0B,MAAM,IAAIlmD,MAAM,0BACtE,OAmBJ,SAAiBykD,EAAMzB,GACrB,IAAIoD,EAAUf,EAAOrC,EAAKmD,MAAMviD,KAAK,MACrC,IAAKwiD,EAAS,MAAM,IAAIpmD,MAAM,iBAAmBgjD,EAAKmD,MAAMviD,KAAK,MAEjE,IAEIC,EAFQ,IAAIshD,EAAGiB,GACHC,eAAerD,EAAKsD,YACtBp2C,KAAKu0C,GAEnB,OAAOxiD,EAAO2M,KAAK/K,EAAI0iD,SA3BdC,CAAO/B,EAAMzB,GACf,GAAkB,QAAdA,EAAKj6C,KAAgB,CAC9B,GAAiB,QAAbm9C,EAAoB,MAAM,IAAIlmD,MAAM,0BACxC,OA2BJ,SAAkBykD,EAAMzB,EAAMuC,GAU5B,IATA,IAKIxxC,EALAkJ,EAAI+lC,EAAKvP,OAAOgT,SAChBl2C,EAAIyyC,EAAKvP,OAAOljC,EAChB0E,EAAI+tC,EAAKvP,OAAOx+B,EAChB8N,EAAIigC,EAAKvP,OAAO1wB,EAChBrR,EAAI,IAAId,EAAG,GAEX81C,EAAIhB,EAASjB,EAAMxvC,GAAGpC,IAAIoC,GAC1BiJ,GAAI,EACJ6nC,EAAKT,EAAOroC,EAAGhI,EAAGwvC,EAAMc,IACf,IAANrnC,GAELxM,EAAIs0C,EAAMjjC,EADVhP,EAAI+xC,EAAQ7wC,EAAG8wC,EAAIR,GACHh1C,EAAG0E,GAED,KADlBiJ,EAAInK,EAAE6P,KAAK3O,GAAG0G,KAAK+qC,EAAEjvC,IAAIwF,EAAErL,IAAIF,KAAKmB,IAAIoC,IAClC0O,KAAK,KACTzF,GAAI,EACJxM,EAAI,IAAId,EAAG,IAGf,OAGF,SAAgBc,EAAGwM,GACjBxM,EAAIA,EAAEzB,UACNiO,EAAIA,EAAEjO,UAGK,IAAPyB,EAAE,KAAWA,EAAI,CAAC,GAAGpN,OAAOoN,IACrB,IAAPwM,EAAE,KAAWA,EAAI,CAAC,GAAG5Z,OAAO4Z,IAEhC,IACI3a,EAAM,CAAC,GADCmO,EAAErP,OAAS6b,EAAE7b,OAAS,EACV,EAAMqP,EAAErP,QAEhC,OADAkB,EAAMA,EAAIe,OAAOoN,EAAG,CAAC,EAAMwM,EAAE7b,QAAS6b,GAC/Bjc,EAAO2M,KAAKrL,GAdZgjD,CAAM70C,EAAGwM,GA9CPyoC,CAAQlC,EAAMzB,EAAMiD,GAE3B,GAAiB,QAAbC,GAAmC,cAAbA,EAA0B,MAAM,IAAIlmD,MAAM,0BAEtEykD,EAAOxiD,EAAOqC,OAAO,CAACK,EAAK8/C,IAG3B,IAFA,IAAIt4C,EAAM62C,EAAKC,QAAQngD,aACnBq+C,EAAM,CAAC,EAAG,GACPsD,EAAKpiD,OAAS8+C,EAAI9+C,OAAS,EAAI8J,GAAKg1C,EAAIr7C,KAAK,KACpDq7C,EAAIr7C,KAAK,GAET,IADA,IAAIsG,GAAK,IACAA,EAAIq4C,EAAKpiD,QAAQ8+C,EAAIr7C,KAAK2+C,EAAKr4C,IAGxC,OADUg3C,EAAIjC,EAAK6B,IAgHrBxjD,EAAOC,QAAQ6lD,OAASA,EACxB9lD,EAAOC,QAAQqmD,QAAUA,kBC7IzB,IAAI7jD,EAAS,eACT2O,EAAK,EAAQ,MACbu0C,EAAK,WACLC,EAAY,EAAQ,KACpBC,EAAS,EAAQ,MAyErB,SAASuB,EAAYhzC,EAAGqB,GACtB,GAAIrB,EAAE+P,KAAK,IAAM,EAAG,MAAM,IAAI3jB,MAAM,eACpC,GAAI4T,EAAE3B,IAAIgD,IAAMA,EAAG,MAAM,IAAIjV,MAAM,eAGrCR,EAAOC,QA5EP,SAAiBwlD,EAAKR,EAAMr/C,EAAK8gD,EAAUvhD,GACzC,IAAIkiD,EAAMzB,EAAUhgD,GACpB,GAAiB,OAAbyhD,EAAI99C,KAAe,CAErB,GAAiB,UAAbm9C,GAAqC,cAAbA,EAA0B,MAAM,IAAIlmD,MAAM,yBACtE,OAmCJ,SAAmBilD,EAAKR,EAAMoC,GAC5B,IAAIT,EAAUf,EAAOwB,EAAIllD,KAAK2iD,UAAU6B,MAAMviD,KAAK,MACnD,IAAKwiD,EAAS,MAAM,IAAIpmD,MAAM,iBAAmB6mD,EAAIllD,KAAK2iD,UAAU6B,MAAMviD,KAAK,MAE/E,IAAIuiD,EAAQ,IAAIhB,EAAGiB,GACfU,EAASD,EAAIllD,KAAKolD,kBAAkBplD,KAExC,OAAOwkD,EAAMhC,OAAOM,EAAMQ,EAAK6B,GA1CtBE,CAAS/B,EAAKR,EAAMoC,GACtB,GAAiB,QAAbA,EAAI99C,KAAgB,CAC7B,GAAiB,QAAbm9C,EAAoB,MAAM,IAAIlmD,MAAM,yBACxC,OA0CJ,SAAoBilD,EAAKR,EAAMoC,GAC7B,IAAIt2C,EAAIs2C,EAAIllD,KAAK4O,EACb0E,EAAI4xC,EAAIllD,KAAKsT,EACb8N,EAAI8jC,EAAIllD,KAAKohB,EACb7F,EAAI2pC,EAAIllD,KAAKslD,QACbC,EAAW9B,EAAU+B,UAAUzlD,OAAOujD,EAAK,OAC3C/mC,EAAIgpC,EAAShpC,EACbxM,EAAIw1C,EAASx1C,EACjBk1C,EAAW1oC,EAAGjJ,GACd2xC,EAAWl1C,EAAGuD,GACd,IAAImyC,EAAQx2C,EAAGuX,KAAK5X,GAChBgC,EAAI2L,EAAE0F,KAAK3O,GAOf,OAAoB,IANZ8N,EAAE2B,MAAM0iC,GACbnhC,OAAO,IAAIrV,EAAG6zC,GAAM7yC,IAAIW,GAAGM,IAAIoC,IAC/B6P,UACAlT,IAAIsL,EAAEwH,MAAM0iC,GAAOnhC,OAAOvU,EAAEE,IAAIW,GAAGM,IAAIoC,IAAI6P,WAC3CjS,IAAItC,GACJsC,IAAIoC,GACEhD,IAAIP,GA5DJ21C,CAAUpC,EAAKR,EAAMoC,GAE5B,GAAiB,QAAbX,GAAmC,cAAbA,EAA0B,MAAM,IAAIlmD,MAAM,yBAEtEykD,EAAOxiD,EAAOqC,OAAO,CAACK,EAAK8/C,IAI3B,IAHA,IAAIt4C,EAAM06C,EAAI5D,QAAQngD,aAClBq+C,EAAM,CAAC,GACPmG,EAAS,EACN7C,EAAKpiD,OAAS8+C,EAAI9+C,OAAS,EAAI8J,GACpCg1C,EAAIr7C,KAAK,KACTwhD,IAEFnG,EAAIr7C,KAAK,GAET,IADA,IAAIsG,GAAK,IACAA,EAAIq4C,EAAKpiD,QAChB8+C,EAAIr7C,KAAK2+C,EAAKr4C,IAEhB+0C,EAAMl/C,EAAO2M,KAAKuyC,GAClB,IAAIjwC,EAAMN,EAAGuX,KAAK0+B,EAAI5D,SAGtBgC,GAFAA,EAAM,IAAIr0C,EAAGq0C,GAAKvgC,MAAMxT,IAEd+U,OAAO,IAAIrV,EAAGi2C,EAAItD,iBAC5B0B,EAAMhjD,EAAO2M,KAAKq2C,EAAIngC,UAAU7U,WAChC,IAAIpM,EAAMyjD,EAAS,EAAI,EAAI,EAK3B,IAJAn7C,EAAM0F,KAAK/D,IAAIm3C,EAAI5iD,OAAQ8+C,EAAI9+C,QAC3B4iD,EAAI5iD,SAAW8+C,EAAI9+C,SAAQwB,EAAM,GAErCuI,GAAK,IACIA,EAAID,GAAKtI,GAAOohD,EAAI74C,GAAK+0C,EAAI/0C,GACtC,OAAe,IAARvI,+DCzCLM,EAAS,EAAQ,MAEjBojD,EAAU,EAAQ,MAClBC,EAAe,EAAQ,KACvBC,EAAe,EAAQ,MACvBjnD,EAAY,EAAQ,MAExB,IAAK,IAAI4E,KAAO5E,EACdf,EAAQ2F,GAAO5E,EAAU4E,GAmB3B,SAASsiD,EAAK9lC,GACZ,GAAoB,iBAATA,GAAqBA,EAAOniB,EAAQkoD,SAAW/lC,EAAOniB,EAAQmoD,MACvE,MAAM,IAAIh8B,UAAU,gBAGtB7qB,KAAKi8B,WAAa,KAClBj8B,KAAK+J,IAAM,EACX/J,KAAKi/C,MAAQ,EACbj/C,KAAK8mD,WAAY,EACjB9mD,KAAK+mD,MAAQ,EACb/mD,KAAKgnD,SAAW,EAChBhnD,KAAK6gB,KAAOA,EACZ7gB,KAAKinD,SAAW,EAChBjnD,KAAKknD,WAAa,EAClBlnD,KAAKmnD,mBAAoB,EACzBnnD,KAAKonD,eAAgB,EACrBpnD,KAAKqnD,mBAAqB,EA/B5B3oD,EAAQ4oD,KAAO,EACf5oD,EAAQkoD,QAAU,EAClBloD,EAAQ6oD,QAAU,EAClB7oD,EAAQ8oD,KAAO,EACf9oD,EAAQ+oD,OAAS,EACjB/oD,EAAQgpD,WAAa,EACrBhpD,EAAQipD,WAAa,EACrBjpD,EAAQmoD,MAAQ,EA2BhBF,EAAK1mD,UAAU2nD,MAAQ,WACjB5nD,KAAKmnD,kBACPnnD,KAAKonD,eAAgB,GAIvBpnD,KAAKonD,eAAgB,EAErBhkD,EAAOpD,KAAK8mD,UAAW,qBACvB1jD,EAAOpD,KAAK6gB,MAAQniB,EAAQmoD,OAExB7mD,KAAK6gB,OAASniB,EAAQkoD,SAAW5mD,KAAK6gB,OAASniB,EAAQ8oD,MAAQxnD,KAAK6gB,OAASniB,EAAQgpD,WACvFjB,EAAaoB,WAAW7nD,KAAK8nD,MACpB9nD,KAAK6gB,OAASniB,EAAQ6oD,SAAWvnD,KAAK6gB,OAASniB,EAAQ+oD,QAAUznD,KAAK6gB,OAASniB,EAAQipD,YAAc3nD,KAAK6gB,OAASniB,EAAQmoD,OACpIH,EAAaqB,WAAW/nD,KAAK8nD,MAG/B9nD,KAAK6gB,KAAOniB,EAAQ4oD,KAEpBtnD,KAAKi8B,WAAa,OAGpB0qB,EAAK1mD,UAAUgD,MAAQ,SAAUg8C,EAAOl5C,EAAOiiD,EAAQC,EAAQnlD,EAAKolD,EAASC,GAC3E,OAAOnoD,KAAKwsC,QAAO,EAAMyS,EAAOl5C,EAAOiiD,EAAQC,EAAQnlD,EAAKolD,EAASC,IAGvExB,EAAK1mD,UAAUmoD,UAAY,SAAUnJ,EAAOl5C,EAAOiiD,EAAQC,EAAQnlD,EAAKolD,EAASC,GAC/E,OAAOnoD,KAAKwsC,QAAO,EAAOyS,EAAOl5C,EAAOiiD,EAAQC,EAAQnlD,EAAKolD,EAASC,IAGxExB,EAAK1mD,UAAUusC,OAAS,SAAU6b,EAAOpJ,EAAOl5C,EAAOiiD,EAAQC,EAAQnlD,EAAKolD,EAASC,GAcnF,GAbA/kD,EAAOiC,MAAMJ,UAAU3D,OAAQ,GAE/B8B,EAAOpD,KAAK8mD,UAAW,qBACvB1jD,EAAOpD,KAAK6gB,OAASniB,EAAQ4oD,KAAM,qBACnClkD,EAAOiC,OAAM,EAAOrF,KAAKmnD,kBAAmB,6BAC5C/jD,EAAOiC,OAAM,EAAOrF,KAAKonD,cAAe,oBAExCpnD,KAAKmnD,mBAAoB,EAEzB/jD,EAAOiC,OAAM,OAAiB+C,IAAV62C,EAAqB,4BAEzCj/C,KAAKmnD,mBAAoB,EAErBlI,IAAUvgD,EAAQ4pD,YAAcrJ,IAAUvgD,EAAQ6pD,iBAAmBtJ,IAAUvgD,EAAQ8pD,cAAgBvJ,IAAUvgD,EAAQ+pD,cAAgBxJ,IAAUvgD,EAAQgqD,UAAYzJ,IAAUvgD,EAAQiqD,QAC3L,MAAM,IAAI1pD,MAAM,uBAiBlB,GAda,MAAT8G,IACFA,EAAQ7E,EAAO6B,MAAM,GACrBklD,EAAS,EACTD,EAAS,GAGXhoD,KAAK8nD,KAAKc,SAAWX,EACrBjoD,KAAK8nD,KAAK/hD,MAAQA,EAClB/F,KAAK8nD,KAAKe,QAAUb,EACpBhoD,KAAK8nD,KAAKgB,UAAYX,EACtBnoD,KAAK8nD,KAAKthC,OAAS1jB,EACnB9C,KAAK8nD,KAAKiB,SAAWb,EACrBloD,KAAKi/C,MAAQA,GAERoJ,EAIH,OAFAroD,KAAKgpD,WAEDhpD,KAAKipD,cACAjpD,KAAKkpD,kBAEd,EAIF,IAAIv2C,EAAO3S,KAMX,OALA6pB,EAAQs/B,UAAS,WACfx2C,EAAKq2C,WACLr2C,EAAKy2C,YAGAppD,MAGT2mD,EAAK1mD,UAAUipD,WAAa,WAC1B,IAAIJ,EAAY9oD,KAAK8nD,KAAKgB,UACtBF,EAAW5oD,KAAK8nD,KAAKc,SAIzB,OAFA5oD,KAAKmnD,mBAAoB,EAElB,CAACyB,EAAUE,IAGpBnC,EAAK1mD,UAAU+oD,SAAW,WACxB,IAAIK,EAA4B,KAKhC,OAAQrpD,KAAK6gB,MACX,KAAKniB,EAAQkoD,QACb,KAAKloD,EAAQ8oD,KACb,KAAK9oD,EAAQgpD,WACX1nD,KAAK+J,IAAM08C,EAAa6C,QAAQtpD,KAAK8nD,KAAM9nD,KAAKi/C,OAChD,MACF,KAAKvgD,EAAQmoD,MAKX,OAJI7mD,KAAK8nD,KAAKc,SAAW,IACvBS,EAA4BrpD,KAAK8nD,KAAKe,SAGhC7oD,KAAKqnD,oBACX,KAAK,EACH,GAAkC,OAA9BgC,EACF,MAGF,GA3IY,KA2IRrpD,KAAK8nD,KAAK/hD,MAAMsjD,GAQb,CACLrpD,KAAK6gB,KAAOniB,EAAQ6oD,QACpB,MANA,GAHAvnD,KAAKqnD,mBAAqB,EAC1BgC,IAE2B,IAAvBrpD,KAAK8nD,KAAKc,SAEZ,MAQN,KAAK,EACH,GAAkC,OAA9BS,EACF,MA1JU,MA6JRrpD,KAAK8nD,KAAK/hD,MAAMsjD,IAClBrpD,KAAKqnD,mBAAqB,EAC1BrnD,KAAK6gB,KAAOniB,EAAQ+oD,QAIpBznD,KAAK6gB,KAAOniB,EAAQ6oD,QAGtB,MACF,QACE,MAAM,IAAItoD,MAAM,kDAItB,KAAKP,EAAQ6oD,QACb,KAAK7oD,EAAQ+oD,OACb,KAAK/oD,EAAQipD,WAiBX,IAhBA3nD,KAAK+J,IAAM28C,EAAa6C,QAAQvpD,KAAK8nD,KAAM9nD,KAAKi/C,OAG1Cj/C,KAAK+J,MAAQrL,EAAQ8qD,aAAexpD,KAAKi8B,aAE7Cj8B,KAAK+J,IAAM28C,EAAa+C,qBAAqBzpD,KAAK8nD,KAAM9nD,KAAKi8B,YACzDj8B,KAAK+J,MAAQrL,EAAQgrD,KAEvB1pD,KAAK+J,IAAM28C,EAAa6C,QAAQvpD,KAAK8nD,KAAM9nD,KAAKi/C,OACvCj/C,KAAK+J,MAAQrL,EAAQirD,eAI9B3pD,KAAK+J,IAAMrL,EAAQ8qD,cAGhBxpD,KAAK8nD,KAAKc,SAAW,GAAK5oD,KAAK6gB,OAASniB,EAAQ+oD,QAAUznD,KAAK+J,MAAQrL,EAAQkrD,cAAyC,IAAzB5pD,KAAK8nD,KAAKe,QAAQ,IAMtH7oD,KAAK6pD,QACL7pD,KAAK+J,IAAM28C,EAAa6C,QAAQvpD,KAAK8nD,KAAM9nD,KAAKi/C,OAElD,MACF,QACE,MAAM,IAAIhgD,MAAM,gBAAkBe,KAAK6gB,QAI7C8lC,EAAK1mD,UAAUgpD,YAAc,WAE3B,OAAQjpD,KAAK+J,KACX,KAAKrL,EAAQgrD,KACb,KAAKhrD,EAAQorD,YACX,GAA4B,IAAxB9pD,KAAK8nD,KAAKgB,WAAmB9oD,KAAKi/C,QAAUvgD,EAAQgqD,SAEtD,OADA1oD,KAAK+pD,OAAO,2BACL,EAET,MACF,KAAKrrD,EAAQkrD,aAEX,MACF,KAAKlrD,EAAQ8qD,YAMX,OALuB,MAAnBxpD,KAAKi8B,WACPj8B,KAAK+pD,OAAO,sBAEZ/pD,KAAK+pD,OAAO,mBAEP,EACT,QAGE,OADA/pD,KAAK+pD,OAAO,eACL,EAGX,OAAO,GAGTpD,EAAK1mD,UAAUmpD,OAAS,WACtB,GAAKppD,KAAKipD,cAAV,CAIA,IAAIH,EAAY9oD,KAAK8nD,KAAKgB,UACtBF,EAAW5oD,KAAK8nD,KAAKc,SAEzB5oD,KAAKmnD,mBAAoB,EAGzBnnD,KAAK8gC,SAAS8nB,EAAUE,GAEpB9oD,KAAKonD,eACPpnD,KAAK4nD,UAITjB,EAAK1mD,UAAU8pD,OAAS,SAAU7/C,GAC5BlK,KAAK8nD,KAAKr+C,MACZS,EAAUlK,KAAK8nD,KAAKr+C,KAEtBzJ,KAAKgqD,QAAQ9/C,EAASlK,KAAK+J,KAGzB/J,KAAKmnD,mBAAoB,EACvBnnD,KAAKonD,eACPpnD,KAAK4nD,SAITjB,EAAK1mD,UAAUgqD,KAAO,SAAU/C,EAAYH,EAAOC,EAAUC,EAAUhrB,GACrE74B,EAA4B,IAArB6B,UAAU3D,QAAqC,IAArB2D,UAAU3D,OAAc,6DAEzD8B,EAAO8jD,GAAc,GAAKA,GAAc,GAAI,sBAC5C9jD,EAAO2jD,IAAU,GAAKA,GAAS,EAAG,6BAElC3jD,EAAO4jD,GAAY,GAAKA,GAAY,EAAG,oBAEvC5jD,EAAO6jD,IAAavoD,EAAQwrD,YAAcjD,IAAavoD,EAAQyrD,gBAAkBlD,IAAavoD,EAAQ0rD,OAASnD,IAAavoD,EAAQ2rD,SAAWpD,IAAavoD,EAAQ4rD,mBAAoB,oBAExLtqD,KAAKkF,MAAM6hD,EAAOG,EAAYF,EAAUC,EAAUhrB,GAClDj8B,KAAKuqD,kBAGP5D,EAAK1mD,UAAUyyC,OAAS,WACtB,MAAM,IAAIzzC,MAAM,gCAGlB0nD,EAAK1mD,UAAU4pD,MAAQ,WACrB7pD,KAAK46C,SACL56C,KAAKuqD,kBAGP5D,EAAK1mD,UAAUiF,MAAQ,SAAU6hD,EAAOG,EAAYF,EAAUC,EAAUhrB,GAwBtE,OAvBAj8B,KAAK+mD,MAAQA,EACb/mD,KAAKknD,WAAaA,EAClBlnD,KAAKgnD,SAAWA,EAChBhnD,KAAKinD,SAAWA,EAEhBjnD,KAAKi/C,MAAQvgD,EAAQ4pD,WAErBtoD,KAAK+J,IAAMrL,EAAQgrD,KAEf1pD,KAAK6gB,OAASniB,EAAQ8oD,MAAQxnD,KAAK6gB,OAASniB,EAAQ+oD,SACtDznD,KAAKknD,YAAc,IAGjBlnD,KAAK6gB,OAASniB,EAAQmoD,QACxB7mD,KAAKknD,YAAc,IAGjBlnD,KAAK6gB,OAASniB,EAAQgpD,YAAc1nD,KAAK6gB,OAASniB,EAAQipD,aAC5D3nD,KAAKknD,YAAc,EAAIlnD,KAAKknD,YAG9BlnD,KAAK8nD,KAAO,IAAItB,EAERxmD,KAAK6gB,MACX,KAAKniB,EAAQkoD,QACb,KAAKloD,EAAQ8oD,KACb,KAAK9oD,EAAQgpD,WACX1nD,KAAK+J,IAAM08C,EAAa+D,aAAaxqD,KAAK8nD,KAAM9nD,KAAK+mD,MAAOroD,EAAQ+rD,WAAYzqD,KAAKknD,WAAYlnD,KAAKgnD,SAAUhnD,KAAKinD,UACrH,MACF,KAAKvoD,EAAQ6oD,QACb,KAAK7oD,EAAQ+oD,OACb,KAAK/oD,EAAQipD,WACb,KAAKjpD,EAAQmoD,MACX7mD,KAAK+J,IAAM28C,EAAagE,aAAa1qD,KAAK8nD,KAAM9nD,KAAKknD,YACrD,MACF,QACE,MAAM,IAAIjoD,MAAM,gBAAkBe,KAAK6gB,MAGvC7gB,KAAK+J,MAAQrL,EAAQgrD,MACvB1pD,KAAK+pD,OAAO,cAGd/pD,KAAKi8B,WAAaA,EAElBj8B,KAAKmnD,mBAAoB,EACzBnnD,KAAK8mD,WAAY,GAGnBH,EAAK1mD,UAAUsqD,eAAiB,WAC9B,GAAuB,MAAnBvqD,KAAKi8B,WAAT,CAMA,OAFAj8B,KAAK+J,IAAMrL,EAAQgrD,KAEX1pD,KAAK6gB,MACX,KAAKniB,EAAQkoD,QACb,KAAKloD,EAAQgpD,WACX1nD,KAAK+J,IAAM08C,EAAakE,qBAAqB3qD,KAAK8nD,KAAM9nD,KAAKi8B,YAM7Dj8B,KAAK+J,MAAQrL,EAAQgrD,MACvB1pD,KAAK+pD,OAAO,8BAIhBpD,EAAK1mD,UAAU26C,OAAS,WAGtB,OAFA56C,KAAK+J,IAAMrL,EAAQgrD,KAEX1pD,KAAK6gB,MACX,KAAKniB,EAAQkoD,QACb,KAAKloD,EAAQgpD,WACb,KAAKhpD,EAAQ8oD,KACXxnD,KAAK+J,IAAM08C,EAAamE,aAAa5qD,KAAK8nD,MAC1C,MACF,KAAKppD,EAAQ6oD,QACb,KAAK7oD,EAAQipD,WACb,KAAKjpD,EAAQ+oD,OACXznD,KAAK+J,IAAM28C,EAAamE,aAAa7qD,KAAK8nD,MAM1C9nD,KAAK+J,MAAQrL,EAAQgrD,MACvB1pD,KAAK+pD,OAAO,2BAIhBrrD,EAAQioD,KAAOA,6CCtZXzlD,EAAS,eACT61C,EAAY,kBACZ+T,EAAU,EAAQ,MAClBv3B,EAAO,EAAQ,MACfnwB,EAAS,WACT2nD,EAAa,mBACbC,EAAqB,yDAAgED,EAAW9+C,SAAS,IAAM,SAInH6+C,EAAQG,iBAAmB,EAC3BH,EAAQI,iBAAmB,GAC3BJ,EAAQK,qBAAuB,GAK/BL,EAAQM,YAAc,GACtBN,EAAQO,YAAch7B,EAAAA,EACtBy6B,EAAQQ,gBAAkB,MAE1BR,EAAQS,eAAiB,EACzBT,EAAQU,eAAiB,EACzBV,EAAQW,mBAAqB,EAE7BX,EAAQY,aAAe,EACvBZ,EAAQa,YAAc,EACtBb,EAAQc,gBAAkBd,EAAQe,sBAIlC,IADA,IAAIC,EAAQtmD,OAAOC,KAAKqlD,GACfiB,EAAK,EAAGA,EAAKD,EAAMxqD,OAAQyqD,IAAM,CACxC,IAAIC,EAAOF,EAAMC,GACbC,EAAKnkD,MAAM,OACbrC,OAAO8nB,eAAe5uB,EAASstD,EAAM,CACnCz+B,YAAY,EAAM9rB,MAAOqpD,EAAQkB,GAAOv+B,UAAU,IAmBxD,IAbA,IAAI7F,EAAQ,CACV8hC,KAAMoB,EAAQpB,KACdE,aAAckB,EAAQlB,aACtBJ,YAAasB,EAAQtB,YACrByC,QAASnB,EAAQmB,QACjBC,eAAgBpB,EAAQoB,eACxBvC,aAAcmB,EAAQnB,aACtBwC,YAAarB,EAAQqB,YACrBrC,YAAagB,EAAQhB,YACrBsC,gBAAiBtB,EAAQsB,iBAGvBC,EAAQ7mD,OAAOC,KAAKmiB,GACfu0B,EAAK,EAAGA,EAAKkQ,EAAM/qD,OAAQ66C,IAAM,CACxC,IAAImQ,EAAOD,EAAMlQ,GACjBv0B,EAAMA,EAAM0kC,IAASA,EAiIvB,SAASC,EAAWC,EAAQjhD,EAAQu1B,GAClC,IAAInE,EAAU,GACV8vB,EAAQ,EAQZ,SAASC,IAEP,IADA,IAAIvP,EACG,QAAUA,EAAQqP,EAAOle,SAC9B3R,EAAQ53B,KAAKo4C,GACbsP,GAAStP,EAAM77C,OAEjBkrD,EAAOhoB,KAAK,WAAYkoB,GAS1B,SAASC,IACP,IAAI3hD,EACAjB,EAAM,KAEN0iD,GAAS1B,EACXhhD,EAAM,IAAIsqB,WAAW22B,GAErBhgD,EAAM9J,EAAOqC,OAAOo5B,EAAS8vB,GAG/B9vB,EAAU,GACV6vB,EAAO5E,QACP9mB,EAAS/2B,EAAKiB,GAjChBwhD,EAAO9nB,GAAG,SAeV,SAAiB36B,GACfyiD,EAAOnZ,eAAe,MAAOsZ,GAC7BH,EAAOnZ,eAAe,WAAYqZ,GAClC5rB,EAAS/2B,MAjBXyiD,EAAO9nB,GAAG,MAAOioB,GAEjBH,EAAO9+C,IAAInC,GACXmhD,IAiCF,SAASE,EAAeJ,EAAQjhD,GAG9B,GAFsB,iBAAXA,IAAqBA,EAASrK,EAAO2M,KAAKtC,KAEhDrK,EAAOE,SAASmK,GAAS,MAAM,IAAIsf,UAAU,0BAElD,IAAIgiC,EAAYL,EAAOM,iBAEvB,OAAON,EAAOO,cAAcxhD,EAAQshD,GAKtC,SAASG,EAAQ/tB,GACf,KAAMj/B,gBAAgBgtD,GAAU,OAAO,IAAIA,EAAQ/tB,GACnD0nB,EAAKpmD,KAAKP,KAAMi/B,EAAM6rB,EAAQlE,SAGhC,SAASqG,EAAQhuB,GACf,KAAMj/B,gBAAgBitD,GAAU,OAAO,IAAIA,EAAQhuB,GACnD0nB,EAAKpmD,KAAKP,KAAMi/B,EAAM6rB,EAAQvD,SAIhC,SAAS2F,EAAKjuB,GACZ,KAAMj/B,gBAAgBktD,GAAO,OAAO,IAAIA,EAAKjuB,GAC7C0nB,EAAKpmD,KAAKP,KAAMi/B,EAAM6rB,EAAQtD,MAGhC,SAAS2F,EAAOluB,GACd,KAAMj/B,gBAAgBmtD,GAAS,OAAO,IAAIA,EAAOluB,GACjD0nB,EAAKpmD,KAAKP,KAAMi/B,EAAM6rB,EAAQrD,QAIhC,SAAS2F,EAAWnuB,GAClB,KAAMj/B,gBAAgBotD,GAAa,OAAO,IAAIA,EAAWnuB,GACzD0nB,EAAKpmD,KAAKP,KAAMi/B,EAAM6rB,EAAQpD,YAGhC,SAAS2F,EAAWpuB,GAClB,KAAMj/B,gBAAgBqtD,GAAa,OAAO,IAAIA,EAAWpuB,GACzD0nB,EAAKpmD,KAAKP,KAAMi/B,EAAM6rB,EAAQnD,YAIhC,SAAS2F,EAAMruB,GACb,KAAMj/B,gBAAgBstD,GAAQ,OAAO,IAAIA,EAAMruB,GAC/C0nB,EAAKpmD,KAAKP,KAAMi/B,EAAM6rB,EAAQjE,OAGhC,SAAS0G,EAAiBC,GACxB,OAAOA,IAAS1C,EAAQxC,YAAckF,IAAS1C,EAAQvC,iBAAmBiF,IAAS1C,EAAQtC,cAAgBgF,IAAS1C,EAAQrC,cAAgB+E,IAAS1C,EAAQpC,UAAY8E,IAAS1C,EAAQnC,QAQ5L,SAAShC,EAAK1nB,EAAMpe,GAClB,IAAI6J,EAAQ1qB,KAOZ,GALAA,KAAKytD,MAAQxuB,EAAOA,GAAQ,GAC5Bj/B,KAAK0tD,WAAazuB,EAAK0uB,WAAajvD,EAAQ4sD,gBAE5CvU,EAAUx2C,KAAKP,KAAMi/B,GAEjBA,EAAKggB,QAAUsO,EAAiBtuB,EAAKggB,OACvC,MAAM,IAAIhgD,MAAM,uBAAyBggC,EAAKggB,OAEhD,GAAIhgB,EAAK2uB,cAAgBL,EAAiBtuB,EAAK2uB,aAC7C,MAAM,IAAI3uD,MAAM,uBAAyBggC,EAAK2uB,aAMhD,GAHA5tD,KAAK6tD,WAAa5uB,EAAKggB,OAAS6L,EAAQxC,WACxCtoD,KAAK8sD,sBAA+C,IAArB7tB,EAAK2uB,YAA8B3uB,EAAK2uB,YAAc9C,EAAQpC,SAEzFzpB,EAAK0uB,YACH1uB,EAAK0uB,UAAYjvD,EAAQ0sD,aAAensB,EAAK0uB,UAAYjvD,EAAQ2sD,aACnE,MAAM,IAAIpsD,MAAM,uBAAyBggC,EAAK0uB,WAIlD,GAAI1uB,EAAKioB,aACHjoB,EAAKioB,WAAaxoD,EAAQusD,kBAAoBhsB,EAAKioB,WAAaxoD,EAAQwsD,kBAC1E,MAAM,IAAIjsD,MAAM,uBAAyBggC,EAAKioB,YAIlD,GAAIjoB,EAAK8nB,QACH9nB,EAAK8nB,MAAQroD,EAAQgtD,aAAezsB,EAAK8nB,MAAQroD,EAAQitD,aAC3D,MAAM,IAAI1sD,MAAM,8BAAgCggC,EAAK8nB,OAIzD,GAAI9nB,EAAK+nB,WACH/nB,EAAK+nB,SAAWtoD,EAAQ6sD,gBAAkBtsB,EAAK+nB,SAAWtoD,EAAQ8sD,gBACpE,MAAM,IAAIvsD,MAAM,qBAAuBggC,EAAK+nB,UAIhD,GAAI/nB,EAAKgoB,UACHhoB,EAAKgoB,UAAYvoD,EAAQwrD,YAAcjrB,EAAKgoB,UAAYvoD,EAAQyrD,gBAAkBlrB,EAAKgoB,UAAYvoD,EAAQ0rD,OAASnrB,EAAKgoB,UAAYvoD,EAAQ2rD,SAAWprB,EAAKgoB,UAAYvoD,EAAQ4rD,mBACnL,MAAM,IAAIrrD,MAAM,qBAAuBggC,EAAKgoB,UAIhD,GAAIhoB,EAAKhD,aACF/6B,EAAOE,SAAS69B,EAAKhD,YACxB,MAAM,IAAIh9B,MAAM,sDAIpBe,KAAK8tD,QAAU,IAAIhD,EAAQnE,KAAK9lC,GAEhC,IAAIlO,EAAO3S,KACXA,KAAK+tD,WAAY,EACjB/tD,KAAK8tD,QAAQ9D,QAAU,SAAU9/C,EAAS8jD,GAGxCC,EAAOt7C,GACPA,EAAKo7C,WAAY,EAEjB,IAAIxsD,EAAQ,IAAItC,MAAMiL,GACtB3I,EAAMysD,MAAQA,EACdzsD,EAAMoxB,KAAOj0B,EAAQkpB,MAAMomC,GAC3Br7C,EAAK8yB,KAAK,QAASlkC,IAGrB,IAAIwlD,EAAQroD,EAAQmtD,sBACM,iBAAf5sB,EAAK8nB,QAAoBA,EAAQ9nB,EAAK8nB,OAEjD,IAAIE,EAAWvoD,EAAQ4rD,mBACM,iBAAlBrrB,EAAKgoB,WAAuBA,EAAWhoB,EAAKgoB,UAEvDjnD,KAAK8tD,QAAQ7D,KAAKhrB,EAAKioB,YAAcxoD,EAAQysD,qBAAsBpE,EAAO9nB,EAAK+nB,UAAYtoD,EAAQ+sD,mBAAoBxE,EAAUhoB,EAAKhD,YAEtIj8B,KAAKujC,QAAUriC,EAAOkpC,YAAYpqC,KAAK0tD,YACvC1tD,KAAKkuD,QAAU,EACfluD,KAAKmuD,OAASpH,EACd/mD,KAAKouD,UAAYnH,EAEjBjnD,KAAKwkC,KAAK,MAAOxkC,KAAK4nD,OAEtBpiD,OAAO8nB,eAAettB,KAAM,UAAW,CACrCZ,IAAK,WACH,OAAQsrB,EAAMojC,SAEhBtgC,cAAc,EACdD,YAAY,IAwEhB,SAAS0gC,EAAOzB,EAAQ1rB,GAClBA,GAAUjX,EAAQs/B,SAASroB,GAG1B0rB,EAAOsB,UAEZtB,EAAOsB,QAAQlG,QACf4E,EAAOsB,QAAU,MAGnB,SAASO,EAAY17C,GACnBA,EAAK8yB,KAAK,SA/YZjgC,OAAO8nB,eAAe5uB,EAAS,QAA/B,CACE6uB,YAAY,EAAM9rB,MAAO+D,OAAO8oD,OAAO1mC,GAAQ6F,UAAU,IAG3D/uB,EAAQsuD,QAAUA,EAClBtuD,EAAQuuD,QAAUA,EAClBvuD,EAAQwuD,KAAOA,EACfxuD,EAAQyuD,OAASA,EACjBzuD,EAAQ0uD,WAAaA,EACrB1uD,EAAQ2uD,WAAaA,EACrB3uD,EAAQ4uD,MAAQA,EAEhB5uD,EAAQ6vD,cAAgB,SAAUz3C,GAChC,OAAO,IAAIk2C,EAAQl2C,IAGrBpY,EAAQ8vD,cAAgB,SAAU13C,GAChC,OAAO,IAAIm2C,EAAQn2C,IAGrBpY,EAAQ+vD,iBAAmB,SAAU33C,GACnC,OAAO,IAAIs2C,EAAWt2C,IAGxBpY,EAAQgwD,iBAAmB,SAAU53C,GACnC,OAAO,IAAIu2C,EAAWv2C,IAGxBpY,EAAQiwD,WAAa,SAAU73C,GAC7B,OAAO,IAAIo2C,EAAKp2C,IAGlBpY,EAAQkwD,aAAe,SAAU93C,GAC/B,OAAO,IAAIq2C,EAAOr2C,IAGpBpY,EAAQmwD,YAAc,SAAU/3C,GAC9B,OAAO,IAAIw2C,EAAMx2C,IAKnBpY,EAAQ4qD,QAAU,SAAU/9C,EAAQ0zB,EAAM6B,GAKxC,MAJoB,mBAAT7B,IACT6B,EAAW7B,EACXA,EAAO,IAEFstB,EAAW,IAAIS,EAAQ/tB,GAAO1zB,EAAQu1B,IAG/CpiC,EAAQowD,YAAc,SAAUvjD,EAAQ0zB,GACtC,OAAO2tB,EAAe,IAAII,EAAQ/tB,GAAO1zB,IAG3C7M,EAAQqwD,KAAO,SAAUxjD,EAAQ0zB,EAAM6B,GAKrC,MAJoB,mBAAT7B,IACT6B,EAAW7B,EACXA,EAAO,IAEFstB,EAAW,IAAIW,EAAKjuB,GAAO1zB,EAAQu1B,IAG5CpiC,EAAQswD,SAAW,SAAUzjD,EAAQ0zB,GACnC,OAAO2tB,EAAe,IAAIM,EAAKjuB,GAAO1zB,IAGxC7M,EAAQuwD,WAAa,SAAU1jD,EAAQ0zB,EAAM6B,GAK3C,MAJoB,mBAAT7B,IACT6B,EAAW7B,EACXA,EAAO,IAEFstB,EAAW,IAAIa,EAAWnuB,GAAO1zB,EAAQu1B,IAGlDpiC,EAAQwwD,eAAiB,SAAU3jD,EAAQ0zB,GACzC,OAAO2tB,EAAe,IAAIQ,EAAWnuB,GAAO1zB,IAG9C7M,EAAQywD,MAAQ,SAAU5jD,EAAQ0zB,EAAM6B,GAKtC,MAJoB,mBAAT7B,IACT6B,EAAW7B,EACXA,EAAO,IAEFstB,EAAW,IAAIe,EAAMruB,GAAO1zB,EAAQu1B,IAG7CpiC,EAAQ0wD,UAAY,SAAU7jD,EAAQ0zB,GACpC,OAAO2tB,EAAe,IAAIU,EAAMruB,GAAO1zB,IAGzC7M,EAAQ6qD,QAAU,SAAUh+C,EAAQ0zB,EAAM6B,GAKxC,MAJoB,mBAAT7B,IACT6B,EAAW7B,EACXA,EAAO,IAEFstB,EAAW,IAAIU,EAAQhuB,GAAO1zB,EAAQu1B,IAG/CpiC,EAAQ2wD,YAAc,SAAU9jD,EAAQ0zB,GACtC,OAAO2tB,EAAe,IAAIK,EAAQhuB,GAAO1zB,IAG3C7M,EAAQ4wD,OAAS,SAAU/jD,EAAQ0zB,EAAM6B,GAKvC,MAJoB,mBAAT7B,IACT6B,EAAW7B,EACXA,EAAO,IAEFstB,EAAW,IAAIY,EAAOluB,GAAO1zB,EAAQu1B,IAG9CpiC,EAAQ6wD,WAAa,SAAUhkD,EAAQ0zB,GACrC,OAAO2tB,EAAe,IAAIO,EAAOluB,GAAO1zB,IAG1C7M,EAAQ8wD,WAAa,SAAUjkD,EAAQ0zB,EAAM6B,GAK3C,MAJoB,mBAAT7B,IACT6B,EAAW7B,EACXA,EAAO,IAEFstB,EAAW,IAAIc,EAAWpuB,GAAO1zB,EAAQu1B,IAGlDpiC,EAAQ+wD,eAAiB,SAAUlkD,EAAQ0zB,GACzC,OAAO2tB,EAAe,IAAIS,EAAWpuB,GAAO1zB,IAqM9CgoB,EAAK3zB,SAAS+mD,EAAM5P,GAEpB4P,EAAK1mD,UAAUyyC,OAAS,SAAUqU,EAAOE,EAAUnmB,GACjD,GAAIimB,EAAQroD,EAAQgtD,aAAe3E,EAAQroD,EAAQitD,YACjD,MAAM,IAAIt3B,WAAW,8BAAgC0yB,GAEvD,GAAIE,GAAYvoD,EAAQwrD,YAAcjD,GAAYvoD,EAAQyrD,gBAAkBlD,GAAYvoD,EAAQ0rD,OAASnD,GAAYvoD,EAAQ2rD,SAAWpD,GAAYvoD,EAAQ4rD,mBAC1J,MAAM,IAAIz/B,UAAU,qBAAuBo8B,GAG7C,GAAIjnD,KAAKmuD,SAAWpH,GAAS/mD,KAAKouD,YAAcnH,EAAU,CACxD,IAAIt0C,EAAO3S,KACXA,KAAKi/C,MAAM6L,EAAQtC,cAAc,WAC/BplD,EAAOuP,EAAKm7C,QAAS,uBACrBn7C,EAAKm7C,QAAQpb,OAAOqU,EAAOE,GACtBt0C,EAAKo7C,YACRp7C,EAAKw7C,OAASpH,EACdp0C,EAAKy7C,UAAYnH,EACbnmB,GAAUA,aAIlBjX,EAAQs/B,SAASroB,IAIrB6lB,EAAK1mD,UAAU4pD,MAAQ,WAErB,OADAzmD,EAAOpD,KAAK8tD,QAAS,uBACd9tD,KAAK8tD,QAAQjE,SAKtBlD,EAAK1mD,UAAUw3C,OAAS,SAAU3W,GAChC9gC,KAAKq3C,WAAWn2C,EAAO6B,MAAM,GAAI,GAAI+9B,IAGvC6lB,EAAK1mD,UAAUg/C,MAAQ,SAAUyQ,EAAM5uB,GACrC,IAAI6uB,EAAS3vD,KAEToe,EAAKpe,KAAK4vD,gBAEM,mBAATF,QAAgCtnD,IAATsnD,IAAuB5uB,KACvDA,EAAW4uB,EACXA,EAAO5E,EAAQrC,cAGbrqC,EAAGyxC,MACD/uB,GAAUjX,EAAQs/B,SAASroB,GACtB1iB,EAAG0xC,OACRhvB,GAAU9gC,KAAKwkC,KAAK,MAAO1D,GACtB1iB,EAAG2xC,UACRjvB,GACF9gC,KAAKwkC,KAAK,SAAS,WACjB,OAAOmrB,EAAO1Q,MAAMyQ,EAAM5uB,OAI9B9gC,KAAK6tD,WAAa6B,EAClB1vD,KAAKiD,MAAM/B,EAAO6B,MAAM,GAAI,GAAI+9B,KAIpC6lB,EAAK1mD,UAAU2nD,MAAQ,SAAU9mB,GAC/BmtB,EAAOjuD,KAAM8gC,GACbjX,EAAQs/B,SAASkF,EAAaruD,OAiBhC2mD,EAAK1mD,UAAUo3C,WAAa,SAAU8F,EAAOnhB,EAAU+M,GACrD,IAAI8jB,EACAzuC,EAAKpe,KAAK4vD,eAEV1Q,GADS9gC,EAAG0xC,QAAU1xC,EAAGyxC,UACN1S,GAAS/+B,EAAG9c,SAAW67C,EAAM77C,QAEpD,OAAc,OAAV67C,GAAmBj8C,EAAOE,SAAS+7C,GAElCn9C,KAAK8tD,SAON5O,EAAM2N,EAAY7sD,KAAK8sD,kBACzBD,EAAY7sD,KAAK6tD,WAGb1Q,EAAM77C,QAAU8c,EAAG9c,SACrBtB,KAAK6tD,WAAa7tD,KAAKytD,MAAMxO,OAAS6L,EAAQxC,kBAIlDtoD,KAAK+sD,cAAc5P,EAAO0P,EAAW9jB,IAhBXA,EAAG,IAAI9pC,MAAM,wBAFe8pC,EAAG,IAAI9pC,MAAM,mBAqBrE0nD,EAAK1mD,UAAU8sD,cAAgB,SAAU5P,EAAO0P,EAAW9jB,GACzD,IAAIinB,EAAgB7S,GAASA,EAAM77C,OAC/B2uD,EAAiBjwD,KAAK0tD,WAAa1tD,KAAKkuD,QACxCgC,EAAQ,EAERv9C,EAAO3S,KAEPqoD,EAAsB,mBAAPtf,EAEnB,IAAKsf,EAAO,CACV,IAGI9mD,EAHAo7B,EAAU,GACV8vB,EAAQ,EAGZzsD,KAAK0kC,GAAG,SAAS,SAAUyrB,GACzB5uD,EAAQ4uD,KAGV/sD,EAAOpD,KAAK8tD,QAAS,uBACrB,GACE,IAAItrD,EAAMxC,KAAK8tD,QAAQ1F,UAAUyE,EAAW1P,EAC5C+S,EACAF,EACAhwD,KAAKujC,QACLvjC,KAAKkuD,QACL+B,UACQjwD,KAAK+tD,WAAajtB,EAASt+B,EAAI,GAAIA,EAAI,KAEjD,GAAIxC,KAAK+tD,UACP,MAAMxsD,EAGR,GAAIkrD,GAAS1B,EAEX,MADAkD,EAAOjuD,MACD,IAAIq0B,WAAW22B,GAGvB,IAAIhgD,EAAM9J,EAAOqC,OAAOo5B,EAAS8vB,GAGjC,OAFAwB,EAAOjuD,MAEAgL,EAGT5H,EAAOpD,KAAK8tD,QAAS,uBACrB,IAAItf,EAAMxuC,KAAK8tD,QAAQ7qD,MAAM4pD,EAAW1P,EACxC+S,EACAF,EACAhwD,KAAKujC,QACLvjC,KAAKkuD,QACL+B,GAKA,SAASnvB,EAASsvB,EAAcC,GAW9B,GALIrwD,OACFA,KAAKuL,OAAS,KACdvL,KAAK8gC,SAAW,OAGdnuB,EAAKo7C,UAAT,CAEA,IAAInlB,EAAOqnB,EAAiBI,EAG5B,GAFAjtD,EAAOwlC,GAAQ,EAAG,2BAEdA,EAAO,EAAG,CACZ,IAAI9lC,EAAM6P,EAAK4wB,QAAQ3gC,MAAM+P,EAAKu7C,QAASv7C,EAAKu7C,QAAUtlB,GAC1Dj2B,EAAKu7C,SAAWtlB,EAEZyf,EACF11C,EAAK5N,KAAKjC,IAEV65B,EAAQ53B,KAAKjC,GACb2pD,GAAS3pD,EAAIxB,QAWjB,IANsB,IAAlB+uD,GAAuB19C,EAAKu7C,SAAWv7C,EAAK+6C,cAC9CuC,EAAiBt9C,EAAK+6C,WACtB/6C,EAAKu7C,QAAU,EACfv7C,EAAK4wB,QAAUriC,EAAOkpC,YAAYz3B,EAAK+6C,aAGnB,IAAlB2C,EAAqB,CAQvB,GAHAH,GAASF,EAAgBI,EACzBJ,EAAgBI,GAEX/H,EAAO,OAAO,EAEnB,IAAIiI,EAAS39C,EAAKm7C,QAAQ7qD,MAAM4pD,EAAW1P,EAAO+S,EAAOF,EAAer9C,EAAK4wB,QAAS5wB,EAAKu7C,QAASv7C,EAAK+6C,YAGzG,OAFA4C,EAAOxvB,SAAWA,OAClBwvB,EAAO/kD,OAAS4xC,GAIlB,IAAKkL,EAAO,OAAO,EAGnBtf,KAzDFyF,EAAIjjC,OAAS4xC,EACb3O,EAAI1N,SAAWA,GA4DjBvN,EAAK3zB,SAASotD,EAASrG,GACvBpzB,EAAK3zB,SAASqtD,EAAStG,GACvBpzB,EAAK3zB,SAASstD,EAAMvG,GACpBpzB,EAAK3zB,SAASutD,EAAQxG,GACtBpzB,EAAK3zB,SAASwtD,EAAYzG,GAC1BpzB,EAAK3zB,SAASytD,EAAY1G,GAC1BpzB,EAAK3zB,SAAS0tD,EAAO3G,wCChlBrBloD,EAAOC,QAhBP,SAAsBE,GACpB,GAAoB,iBAATA,EACT,MAAM,IAAIisB,UAAU,oCAGtB,GAAIjsB,EAAO,EACT,MAAM,IAAIy1B,WAAW,wCAGvB,OAAInzB,EAAOkpC,YACFlpC,EAAOkpC,YAAYxrC,GAEnB,IAAIsC,EAAOtC,yCCZlB2xD,EAAa,EAAQ,MACrBnmB,EAAc,EAAQ,MAE1B3rC,EAAOC,QAAU,SAAgBE,EAAMimD,EAAM7oB,GAC3C,GAAoB,iBAATp9B,EACT,MAAM,IAAIisB,UAAU,oCAGtB,GAAIjsB,EAAO,EACT,MAAM,IAAIy1B,WAAW,wCAGvB,GAAInzB,EAAO6B,MACT,OAAO7B,EAAO6B,MAAMnE,EAAMimD,EAAM7oB,GAGlC,IAAIzwB,EAAS6+B,EAAYxrC,GAEzB,OAAa,IAATA,EACK2M,OAGInD,IAATy8C,EACK0L,EAAWhlD,EAAQ,IAGJ,iBAAbywB,IACTA,OAAW5zB,GAGNmoD,EAAWhlD,EAAQs5C,EAAM7oB,0CC7B9Bw0B,EAAkB,WACpB,IACE,IAAKtvD,EAAOuvD,WAAW,UACrB,OAAO,EAGT,IAAIzlD,EAAM9J,EAAO6B,MAAQ7B,EAAO6B,MAAM,GAAK,IAAI7B,EAAO,GAItD,OAFA8J,EAAI65C,KAAK,KAAM,QAEiB,aAAxB75C,EAAIiB,SAAS,OACrB,MAAOwS,GACP,OAAO,GAZU,GAoBrB,SAASiyC,EAAgBnlD,EAAQ5F,EAAKkB,EAAO6G,GAC3C,GAAI7G,EAAQ,GAAK6G,EAAMnC,EAAOjK,OAC5B,MAAM,IAAI+yB,WAAW,sBAUvB,OAPAxtB,KAAkB,GAClB6G,OAActF,IAARsF,EAAoBnC,EAAOjK,OAASoM,IAAQ,GAExC7G,GACR0E,EAAOs5C,KAAKl/C,EAAKkB,EAAO6G,GAGnBnC,EA+ET9M,EAAOC,QAlDP,SAAe6M,EAAQ5F,EAAKkB,EAAO6G,EAAKsuB,GACtC,GAAIw0B,EACF,OAAOjlD,EAAOs5C,KAAKl/C,EAAKkB,EAAO6G,EAAKsuB,GAGtC,GAAmB,iBAARr2B,EACT,OAAO+qD,EAAenlD,EAAQ5F,EAAKkB,EAAO6G,GAG5C,GAAmB,iBAAR/H,EAAkB,CAU3B,GATqB,iBAAVkB,GACTm1B,EAAWn1B,EACXA,EAAQ,EACR6G,EAAMnC,EAAOjK,QACW,iBAARoM,IAChBsuB,EAAWtuB,EACXA,EAAMnC,EAAOjK,aAGE8G,IAAb4zB,GAA8C,iBAAbA,EACnC,MAAM,IAAInR,UAAU,6BAOtB,GAJiB,WAAbmR,IACFA,EAAW,UAGW,iBAAbA,IAA0B96B,EAAOuvD,WAAWz0B,GACrD,MAAM,IAAInR,UAAU,qBAAuBmR,GAG7C,GAAY,KAARr2B,EACF,OAAO+qD,EAAenlD,EAAQ,EAAG1E,EAAO6G,GAG1C,GAhFJ,SAAuB/H,GACrB,OAAuB,IAAfA,EAAIrE,QAAgBqE,EAAI0I,WAAW,GAAK,IA+E1CsiD,CAAahrD,GACf,OAAO+qD,EAAenlD,EAAQ5F,EAAI0I,WAAW,GAAIxH,EAAO6G,GAG1D/H,EAAM,IAAIzE,EAAOyE,EAAKq2B,GAGxB,OAAI96B,EAAOE,SAASuE,GApEtB,SAAyB4F,EAAQ5F,EAAKkB,EAAO6G,GAC3C,GAAI7G,EAAQ,GAAK6G,EAAMnC,EAAOjK,OAC5B,MAAM,IAAI+yB,WAAW,sBAGvB,GAAI3mB,GAAO7G,EACT,OAAO0E,EAGT1E,KAAkB,EAClB6G,OAActF,IAARsF,EAAoBnC,EAAOjK,OAASoM,IAAQ,EAIlD,IAFA,IAAIyf,EAAMtmB,EACNuE,EAAMzF,EAAIrE,OACP6rB,GAAQzf,EAAMtC,GACnBzF,EAAIzC,KAAKqI,EAAQ4hB,GACjBA,GAAO/hB,EAOT,OAJI+hB,IAAQzf,GACV/H,EAAIzC,KAAKqI,EAAQ4hB,EAAK,EAAGzf,EAAMyf,GAG1B5hB,EA8CEqlD,CAAerlD,EAAQ5F,EAAKkB,EAAO6G,GAIrCgjD,EAAenlD,EAAQ,EAAG1E,EAAO6G,yCC7G1CjP,EAAOC,QAAU,SAAckU,EAAGC,GAIhC,IAHA,IAAIvR,EAASwP,KAAK/D,IAAI6F,EAAEtR,OAAQuR,EAAEvR,QAC9BiK,EAAS,IAAIrK,EAAOI,GAEf+J,EAAI,EAAGA,EAAI/J,IAAU+J,EAC5BE,EAAOF,GAAKuH,EAAEvH,GAAKwH,EAAExH,GAGvB,OAAOE,8CCET,MAAMoC,EAAS,EAAQ,MACjBkjD,EAAU,EAAQ,KAClBC,EACe,mBAAXvpC,QAAkD,mBAAlBA,OAAY,IAChDA,OAAY,IAAE,8BACd,KAEN7oB,EAAQwC,OAASA,EACjBxC,EAAQqyD,WAyTR,SAAqBzvD,GAInB,OAHKA,GAAUA,IACbA,EAAS,GAEJJ,EAAO6B,OAAOzB,IA5TvB5C,EAAQsyD,kBAAoB,GAE5B,MAAMC,EAAe,WAwDrB,SAASC,EAAc5vD,GACrB,GAAIA,EAAS2vD,EACX,MAAM,IAAI58B,WAAW,cAAgB/yB,EAAS,kCAGhD,MAAM0J,EAAM,IAAI2sB,WAAWr2B,GAE3B,OADAkE,OAAOwpB,eAAehkB,EAAK9J,EAAOjB,WAC3B+K,EAaT,SAAS9J,EAAQqE,EAAK4rD,EAAkB7vD,GAEtC,GAAmB,iBAARiE,EAAkB,CAC3B,GAAgC,iBAArB4rD,EACT,MAAM,IAAItmC,UACR,sEAGJ,OAAOuf,EAAY7kC,GAErB,OAAOsI,EAAKtI,EAAK4rD,EAAkB7vD,GAKrC,SAASuM,EAAMpM,EAAO0vD,EAAkB7vD,GACtC,GAAqB,iBAAVG,EACT,OAqHJ,SAAqB8O,EAAQyrB,GAK3B,GAJwB,iBAAbA,GAAsC,KAAbA,IAClCA,EAAW,SAGR96B,EAAOuvD,WAAWz0B,GACrB,MAAM,IAAInR,UAAU,qBAAuBmR,GAG7C,MAAM16B,EAAwC,EAA/BS,EAAWwO,EAAQyrB,GAClC,IAAIhxB,EAAMkmD,EAAa5vD,GAEvB,MAAM8nB,EAASpe,EAAI/H,MAAMsN,EAAQyrB,GASjC,OAPI5S,IAAW9nB,IAIb0J,EAAMA,EAAIpI,MAAM,EAAGwmB,IAGdpe,EA1IEomD,CAAW3vD,EAAO0vD,GAG3B,GAAInzB,YAAYC,OAAOx8B,GACrB,OAkJJ,SAAwB4vD,GACtB,GAAIC,EAAWD,EAAW15B,YAAa,CACrC,MAAMz0B,EAAO,IAAIy0B,WAAW05B,GAC5B,OAAOE,EAAgBruD,EAAKqI,OAAQrI,EAAK00B,WAAY10B,EAAKnB,YAE5D,OAAOyvD,EAAcH,GAvJZI,CAAchwD,GAGvB,GAAa,MAATA,EACF,MAAM,IAAIopB,UACR,yHACiDppB,GAIrD,GAAI6vD,EAAW7vD,EAAOu8B,cACjBv8B,GAAS6vD,EAAW7vD,EAAM8J,OAAQyyB,aACrC,OAAOuzB,EAAgB9vD,EAAO0vD,EAAkB7vD,GAGlD,GAAiC,oBAAtBowD,oBACNJ,EAAW7vD,EAAOiwD,oBAClBjwD,GAAS6vD,EAAW7vD,EAAM8J,OAAQmmD,oBACrC,OAAOH,EAAgB9vD,EAAO0vD,EAAkB7vD,GAGlD,GAAqB,iBAAVG,EACT,MAAM,IAAIopB,UACR,yEAIJ,MAAMoN,EAAUx2B,EAAMw2B,SAAWx2B,EAAMw2B,UACvC,GAAe,MAAXA,GAAmBA,IAAYx2B,EACjC,OAAOP,EAAO2M,KAAKoqB,EAASk5B,EAAkB7vD,GAGhD,MAAMuR,EAkJR,SAAqB3O,GACnB,GAAIhD,EAAOE,SAAS8C,GAAM,CACxB,MAAMkH,EAA4B,EAAtBumD,EAAQztD,EAAI5C,QAClB0J,EAAMkmD,EAAa9lD,GAEzB,OAAmB,IAAfJ,EAAI1J,QAIR4C,EAAIhB,KAAK8H,EAAK,EAAG,EAAGI,GAHXJ,EAOX,YAAmB5C,IAAflE,EAAI5C,OACoB,iBAAf4C,EAAI5C,QAAuBk0B,EAAYtxB,EAAI5C,QAC7C4vD,EAAa,GAEfM,EAActtD,GAGN,WAAbA,EAAI8D,MAAqBtG,MAAMC,QAAQuC,EAAItD,MACtC4wD,EAActtD,EAAItD,WAD3B,EAtKUgxD,CAAWnwD,GACrB,GAAIoR,EAAG,OAAOA,EAEd,GAAsB,oBAAX0U,QAAgD,MAAtBA,OAAOsqC,aACH,mBAA9BpwD,EAAM8lB,OAAOsqC,aACtB,OAAO3wD,EAAO2M,KAAKpM,EAAM8lB,OAAOsqC,aAAa,UAAWV,EAAkB7vD,GAG5E,MAAM,IAAIupB,UACR,yHACiDppB,GAqBrD,SAASqwD,EAAYlzD,GACnB,GAAoB,iBAATA,EACT,MAAM,IAAIisB,UAAU,0CACf,GAAIjsB,EAAO,EAChB,MAAM,IAAIy1B,WAAW,cAAgBz1B,EAAO,kCA4BhD,SAASwrC,EAAaxrC,GAEpB,OADAkzD,EAAWlzD,GACJsyD,EAAatyD,EAAO,EAAI,EAAoB,EAAhB+yD,EAAQ/yD,IAwC7C,SAAS4yD,EAAen8B,GACtB,MAAM/zB,EAAS+zB,EAAM/zB,OAAS,EAAI,EAA4B,EAAxBqwD,EAAQt8B,EAAM/zB,QAC9C0J,EAAMkmD,EAAa5vD,GACzB,IAAK,IAAI+J,EAAI,EAAGA,EAAI/J,EAAQ+J,GAAK,EAC/BL,EAAIK,GAAgB,IAAXgqB,EAAMhqB,GAEjB,OAAOL,EAWT,SAASumD,EAAiBl8B,EAAOuC,EAAYt2B,GAC3C,GAAIs2B,EAAa,GAAKvC,EAAMtzB,WAAa61B,EACvC,MAAM,IAAIvD,WAAW,wCAGvB,GAAIgB,EAAMtzB,WAAa61B,GAAct2B,GAAU,GAC7C,MAAM,IAAI+yB,WAAW,wCAGvB,IAAIrpB,EAYJ,OAVEA,OADiB5C,IAAfwvB,QAAuCxvB,IAAX9G,EACxB,IAAIq2B,WAAWtC,QACDjtB,IAAX9G,EACH,IAAIq2B,WAAWtC,EAAOuC,GAEtB,IAAID,WAAWtC,EAAOuC,EAAYt2B,GAI1CkE,OAAOwpB,eAAehkB,EAAK9J,EAAOjB,WAE3B+K,EA4BT,SAAS2mD,EAASrwD,GAGhB,GAAIA,GAAU2vD,EACZ,MAAM,IAAI58B,WAAW,0DACa48B,EAAahlD,SAAS,IAAM,UAEhE,OAAgB,EAAT3K,EAuGT,SAASS,EAAYwO,EAAQyrB,GAC3B,GAAI96B,EAAOE,SAASmP,GAClB,OAAOA,EAAOjP,OAEhB,GAAI08B,YAAYC,OAAO1tB,IAAW+gD,EAAW/gD,EAAQytB,aACnD,OAAOztB,EAAOxO,WAEhB,GAAsB,iBAAXwO,EACT,MAAM,IAAIsa,UACR,kGAC0Bta,GAI9B,MAAMnF,EAAMmF,EAAOjP,OACbywD,EAAa9sD,UAAU3D,OAAS,IAAsB,IAAjB2D,UAAU,GACrD,IAAK8sD,GAAqB,IAAR3mD,EAAW,OAAO,EAGpC,IAAI4mD,GAAc,EAClB,OACE,OAAQh2B,GACN,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAO5wB,EACT,IAAK,OACL,IAAK,QACH,OAAO6mD,EAAY1hD,GAAQjP,OAC7B,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAa,EAAN8J,EACT,IAAK,MACH,OAAOA,IAAQ,EACjB,IAAK,SACH,OAAO8mD,EAAc3hD,GAAQjP,OAC/B,QACE,GAAI0wD,EACF,OAAOD,GAAa,EAAIE,EAAY1hD,GAAQjP,OAE9C06B,GAAY,GAAKA,GAAU6L,cAC3BmqB,GAAc,GAMtB,SAASG,EAAcn2B,EAAUn1B,EAAO6G,GACtC,IAAIskD,GAAc,EAclB,SALc5pD,IAAVvB,GAAuBA,EAAQ,KACjCA,EAAQ,GAINA,EAAQ7G,KAAKsB,OACf,MAAO,GAOT,SAJY8G,IAARsF,GAAqBA,EAAM1N,KAAKsB,UAClCoM,EAAM1N,KAAKsB,QAGToM,GAAO,EACT,MAAO,GAOT,IAHAA,KAAS,KACT7G,KAAW,GAGT,MAAO,GAKT,IAFKm1B,IAAUA,EAAW,UAGxB,OAAQA,GACN,IAAK,MACH,OAAOo2B,EAASpyD,KAAM6G,EAAO6G,GAE/B,IAAK,OACL,IAAK,QACH,OAAO2kD,EAAUryD,KAAM6G,EAAO6G,GAEhC,IAAK,QACH,OAAO4kD,EAAWtyD,KAAM6G,EAAO6G,GAEjC,IAAK,SACL,IAAK,SACH,OAAO6kD,EAAYvyD,KAAM6G,EAAO6G,GAElC,IAAK,SACH,OAAO8kD,EAAYxyD,KAAM6G,EAAO6G,GAElC,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO+kD,EAAazyD,KAAM6G,EAAO6G,GAEnC,QACE,GAAIskD,EAAa,MAAM,IAAInnC,UAAU,qBAAuBmR,GAC5DA,GAAYA,EAAW,IAAI6L,cAC3BmqB,GAAc,GAatB,SAASU,EAAM7/C,EAAGmL,EAAGjf,GACnB,MAAMsM,EAAIwH,EAAEmL,GACZnL,EAAEmL,GAAKnL,EAAE9T,GACT8T,EAAE9T,GAAKsM,EA4IT,SAASsnD,EAAsBpnD,EAAQ5F,EAAKiyB,EAAYoE,EAAU42B,GAEhE,GAAsB,IAAlBrnD,EAAOjK,OAAc,OAAQ,EAmBjC,GAhB0B,iBAAfs2B,GACToE,EAAWpE,EACXA,EAAa,GACJA,EAAa,WACtBA,EAAa,WACJA,GAAc,aACvBA,GAAc,YAGZpC,EADJoC,GAAcA,KAGZA,EAAag7B,EAAM,EAAKrnD,EAAOjK,OAAS,GAItCs2B,EAAa,IAAGA,EAAarsB,EAAOjK,OAASs2B,GAC7CA,GAAcrsB,EAAOjK,OAAQ,CAC/B,GAAIsxD,EAAK,OAAQ,EACZh7B,EAAarsB,EAAOjK,OAAS,OAC7B,GAAIs2B,EAAa,EAAG,CACzB,IAAIg7B,EACC,OAAQ,EADJh7B,EAAa,EAUxB,GALmB,iBAARjyB,IACTA,EAAMzE,EAAO2M,KAAKlI,EAAKq2B,IAIrB96B,EAAOE,SAASuE,GAElB,OAAmB,IAAfA,EAAIrE,QACE,EAEHuxD,EAAatnD,EAAQ5F,EAAKiyB,EAAYoE,EAAU42B,GAClD,GAAmB,iBAARjtD,EAEhB,OADAA,GAAY,IACgC,mBAAjCgyB,WAAW13B,UAAUmtB,QAC1BwlC,EACKj7B,WAAW13B,UAAUmtB,QAAQ7sB,KAAKgL,EAAQ5F,EAAKiyB,GAE/CD,WAAW13B,UAAU6yD,YAAYvyD,KAAKgL,EAAQ5F,EAAKiyB,GAGvDi7B,EAAatnD,EAAQ,CAAC5F,GAAMiyB,EAAYoE,EAAU42B,GAG3D,MAAM,IAAI/nC,UAAU,wCAGtB,SAASgoC,EAAct+B,EAAK5uB,EAAKiyB,EAAYoE,EAAU42B,GACrD,IA0BIvnD,EA1BA0nD,EAAY,EACZC,EAAYz+B,EAAIjzB,OAChB2xD,EAAYttD,EAAIrE,OAEpB,QAAiB8G,IAAb4zB,IAEe,UADjBA,EAAWnwB,OAAOmwB,GAAU6L,gBACY,UAAb7L,GACV,YAAbA,GAAuC,aAAbA,GAAyB,CACrD,GAAIzH,EAAIjzB,OAAS,GAAKqE,EAAIrE,OAAS,EACjC,OAAQ,EAEVyxD,EAAY,EACZC,GAAa,EACbC,GAAa,EACbr7B,GAAc,EAIlB,SAAS0W,EAAMtjC,EAAKK,GAClB,OAAkB,IAAd0nD,EACK/nD,EAAIK,GAEJL,EAAIe,aAAaV,EAAI0nD,GAKhC,GAAIH,EAAK,CACP,IAAIM,GAAc,EAClB,IAAK7nD,EAAIusB,EAAYvsB,EAAI2nD,EAAW3nD,IAClC,GAAIijC,EAAK/Z,EAAKlpB,KAAOijC,EAAK3oC,GAAqB,IAAhButD,EAAoB,EAAI7nD,EAAI6nD,IAEzD,IADoB,IAAhBA,IAAmBA,EAAa7nD,GAChCA,EAAI6nD,EAAa,IAAMD,EAAW,OAAOC,EAAaH,OAEtC,IAAhBG,IAAmB7nD,GAAKA,EAAI6nD,GAChCA,GAAc,OAKlB,IADIt7B,EAAaq7B,EAAYD,IAAWp7B,EAAao7B,EAAYC,GAC5D5nD,EAAIusB,EAAYvsB,GAAK,EAAGA,IAAK,CAChC,IAAI8nD,GAAQ,EACZ,IAAK,IAAI7nD,EAAI,EAAGA,EAAI2nD,EAAW3nD,IAC7B,GAAIgjC,EAAK/Z,EAAKlpB,EAAIC,KAAOgjC,EAAK3oC,EAAK2F,GAAI,CACrC6nD,GAAQ,EACR,MAGJ,GAAIA,EAAO,OAAO9nD,EAItB,OAAQ,EAeV,SAAS+nD,EAAUpoD,EAAKuF,EAAQlP,EAAQC,GACtCD,EAASlC,OAAOkC,IAAW,EAC3B,MAAMgyD,EAAYroD,EAAI1J,OAASD,EAC1BC,GAGHA,EAASnC,OAAOmC,IACH+xD,IACX/xD,EAAS+xD,GAJX/xD,EAAS+xD,EAQX,MAAMC,EAAS/iD,EAAOjP,OAKtB,IAAI+J,EACJ,IAJI/J,EAASgyD,EAAS,IACpBhyD,EAASgyD,EAAS,GAGfjoD,EAAI,EAAGA,EAAI/J,IAAU+J,EAAG,CAC3B,MAAMkoD,EAASj1B,SAAS/tB,EAAO2jB,OAAW,EAAJ7oB,EAAO,GAAI,IACjD,GAAImqB,EAAY+9B,GAAS,OAAOloD,EAChCL,EAAI3J,EAASgK,GAAKkoD,EAEpB,OAAOloD,EAGT,SAASmoD,EAAWxoD,EAAKuF,EAAQlP,EAAQC,GACvC,OAAOmyD,EAAWxB,EAAY1hD,EAAQvF,EAAI1J,OAASD,GAAS2J,EAAK3J,EAAQC,GAG3E,SAASoyD,EAAY1oD,EAAKuF,EAAQlP,EAAQC,GACxC,OAAOmyD,EAypCT,SAAuBpqD,GACrB,MAAMsqD,EAAY,GAClB,IAAK,IAAItoD,EAAI,EAAGA,EAAIhC,EAAI/H,SAAU+J,EAEhCsoD,EAAU5uD,KAAyB,IAApBsE,EAAIgF,WAAWhD,IAEhC,OAAOsoD,EA/pCWC,CAAarjD,GAASvF,EAAK3J,EAAQC,GAGvD,SAASuyD,EAAa7oD,EAAKuF,EAAQlP,EAAQC,GACzC,OAAOmyD,EAAWvB,EAAc3hD,GAASvF,EAAK3J,EAAQC,GAGxD,SAASwyD,EAAW9oD,EAAKuF,EAAQlP,EAAQC,GACvC,OAAOmyD,EA0pCT,SAAyBpqD,EAAK0qD,GAC5B,IAAIvjD,EAAGkE,EAAI5B,EACX,MAAM6gD,EAAY,GAClB,IAAK,IAAItoD,EAAI,EAAGA,EAAIhC,EAAI/H,WACjByyD,GAAS,GAAK,KADa1oD,EAGhCmF,EAAInH,EAAIgF,WAAWhD,GACnBqJ,EAAKlE,GAAK,EACVsC,EAAKtC,EAAI,IACTmjD,EAAU5uD,KAAK+N,GACf6gD,EAAU5uD,KAAK2P,GAGjB,OAAOi/C,EAvqCWK,CAAezjD,EAAQvF,EAAI1J,OAASD,GAAS2J,EAAK3J,EAAQC,GA+E9E,SAASkxD,EAAaxnD,EAAKnE,EAAO6G,GAChC,OAAc,IAAV7G,GAAe6G,IAAQ1C,EAAI1J,OACtBqM,EAAO2tB,cAActwB,GAErB2C,EAAO2tB,cAActwB,EAAIpI,MAAMiE,EAAO6G,IAIjD,SAAS2kD,EAAWrnD,EAAKnE,EAAO6G,GAC9BA,EAAMoD,KAAK/D,IAAI/B,EAAI1J,OAAQoM,GAC3B,MAAMlL,EAAM,GAEZ,IAAI6I,EAAIxE,EACR,KAAOwE,EAAIqC,GAAK,CACd,MAAMumD,EAAYjpD,EAAIK,GACtB,IAAI6oD,EAAY,KACZC,EAAoBF,EAAY,IAChC,EACCA,EAAY,IACT,EACCA,EAAY,IACT,EACA,EAEZ,GAAI5oD,EAAI8oD,GAAoBzmD,EAAK,CAC/B,IAAI0mD,EAAYC,EAAWC,EAAYC,EAEvC,OAAQJ,GACN,KAAK,EACCF,EAAY,MACdC,EAAYD,GAEd,MACF,KAAK,EACHG,EAAappD,EAAIK,EAAI,GACO,MAAV,IAAb+oD,KACHG,GAA6B,GAAZN,IAAqB,EAAoB,GAAbG,EACzCG,EAAgB,MAClBL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAappD,EAAIK,EAAI,GACrBgpD,EAAYrpD,EAAIK,EAAI,GACQ,MAAV,IAAb+oD,IAAsD,MAAV,IAAZC,KACnCE,GAA6B,GAAZN,IAAoB,IAAoB,GAAbG,IAAsB,EAAmB,GAAZC,EACrEE,EAAgB,OAAUA,EAAgB,OAAUA,EAAgB,SACtEL,EAAYK,IAGhB,MACF,KAAK,EACHH,EAAappD,EAAIK,EAAI,GACrBgpD,EAAYrpD,EAAIK,EAAI,GACpBipD,EAAatpD,EAAIK,EAAI,GACO,MAAV,IAAb+oD,IAAsD,MAAV,IAAZC,IAAsD,MAAV,IAAbC,KAClEC,GAA6B,GAAZN,IAAoB,IAAqB,GAAbG,IAAsB,IAAmB,GAAZC,IAAqB,EAAoB,GAAbC,EAClGC,EAAgB,OAAUA,EAAgB,UAC5CL,EAAYK,KAMJ,OAAdL,GAGFA,EAAY,MACZC,EAAmB,GACVD,EAAY,QAErBA,GAAa,MACb1xD,EAAIuC,KAAKmvD,IAAc,GAAK,KAAQ,OACpCA,EAAY,MAAqB,KAAZA,GAGvB1xD,EAAIuC,KAAKmvD,GACT7oD,GAAK8oD,EAGP,OAQF,SAAgCK,GAC9B,MAAMppD,EAAMopD,EAAWlzD,OACvB,GAAI8J,GAAOqpD,EACT,OAAO5oD,OAAOC,aAAa9G,MAAM6G,OAAQ2oD,GAI3C,IAAIhyD,EAAM,GACN6I,EAAI,EACR,KAAOA,EAAID,GACT5I,GAAOqJ,OAAOC,aAAa9G,MACzB6G,OACA2oD,EAAW5xD,MAAMyI,EAAGA,GAAKopD,IAG7B,OAAOjyD,EAvBAkyD,CAAsBlyD,GA1+B/B9D,EAAQqsD,WAAakG,EAgBrB/vD,EAAOyzD,oBAUP,WAEE,IACE,MAAMpgC,EAAM,IAAIoD,WAAW,GACrBi9B,EAAQ,CAAEC,IAAK,WAAc,OAAO,KAG1C,OAFArvD,OAAOwpB,eAAe4lC,EAAOj9B,WAAW13B,WACxCuF,OAAOwpB,eAAeuF,EAAKqgC,GACN,KAAdrgC,EAAIsgC,MACX,MAAOnuD,GACP,OAAO,GAnBkBouD,GAExB5zD,EAAOyzD,0BAA0C,IAAZ5qC,GACb,mBAAlBA,EAAQxoB,OACjBwoB,EAAQxoB,MACN,iJAkBJiE,OAAO8nB,eAAepsB,EAAOjB,UAAW,SAAU,CAChDstB,YAAY,EACZnuB,IAAK,WACH,GAAK8B,EAAOE,SAASpB,MACrB,OAAOA,KAAKuL,UAIhB/F,OAAO8nB,eAAepsB,EAAOjB,UAAW,SAAU,CAChDstB,YAAY,EACZnuB,IAAK,WACH,GAAK8B,EAAOE,SAASpB,MACrB,OAAOA,KAAK43B,cAqChB12B,EAAO6zD,SAAW,KA8DlB7zD,EAAO2M,KAAO,SAAUpM,EAAO0vD,EAAkB7vD,GAC/C,OAAOuM,EAAKpM,EAAO0vD,EAAkB7vD,IAKvCkE,OAAOwpB,eAAe9tB,EAAOjB,UAAW03B,WAAW13B,WACnDuF,OAAOwpB,eAAe9tB,EAAQy2B,YA8B9Bz2B,EAAO6B,MAAQ,SAAUnE,EAAMimD,EAAM7oB,GACnC,OArBF,SAAgBp9B,EAAMimD,EAAM7oB,GAE1B,OADA81B,EAAWlzD,GACPA,GAAQ,EACHsyD,EAAatyD,QAETwJ,IAATy8C,EAIyB,iBAAb7oB,EACVk1B,EAAatyD,GAAMimD,KAAKA,EAAM7oB,GAC9Bk1B,EAAatyD,GAAMimD,KAAKA,GAEvBqM,EAAatyD,GAQbmE,CAAMnE,EAAMimD,EAAM7oB,IAW3B96B,EAAOkpC,YAAc,SAAUxrC,GAC7B,OAAOwrC,EAAYxrC,IAKrBsC,EAAO8zD,gBAAkB,SAAUp2D,GACjC,OAAOwrC,EAAYxrC,IA8GrBsC,EAAOE,SAAW,SAAmByR,GACnC,OAAY,MAALA,IAA6B,IAAhBA,EAAEoiD,WACpBpiD,IAAM3R,EAAOjB,WAGjBiB,EAAO41B,QAAU,SAAkBlkB,EAAGC,GAGpC,GAFIy+C,EAAW1+C,EAAG+kB,cAAa/kB,EAAI1R,EAAO2M,KAAK+E,EAAGA,EAAEvR,OAAQuR,EAAE7Q,aAC1DuvD,EAAWz+C,EAAG8kB,cAAa9kB,EAAI3R,EAAO2M,KAAKgF,EAAGA,EAAExR,OAAQwR,EAAE9Q,cACzDb,EAAOE,SAASwR,KAAO1R,EAAOE,SAASyR,GAC1C,MAAM,IAAIgY,UACR,yEAIJ,GAAIjY,IAAMC,EAAG,OAAO,EAEpB,IAAIqJ,EAAItJ,EAAEtR,OACN6a,EAAItJ,EAAEvR,OAEV,IAAK,IAAI+J,EAAI,EAAGD,EAAM0F,KAAK/D,IAAImP,EAAGC,GAAI9Q,EAAID,IAAOC,EAC/C,GAAIuH,EAAEvH,KAAOwH,EAAExH,GAAI,CACjB6Q,EAAItJ,EAAEvH,GACN8Q,EAAItJ,EAAExH,GACN,MAIJ,OAAI6Q,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GAGThb,EAAOuvD,WAAa,SAAqBz0B,GACvC,OAAQnwB,OAAOmwB,GAAU6L,eACvB,IAAK,MACL,IAAK,OACL,IAAK,QACL,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,SACL,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAO,EACT,QACE,OAAO,IAIb3mC,EAAOqC,OAAS,SAAiB24B,EAAM56B,GACrC,IAAKI,MAAMC,QAAQu6B,GACjB,MAAM,IAAIrR,UAAU,+CAGtB,GAAoB,IAAhBqR,EAAK56B,OACP,OAAOJ,EAAO6B,MAAM,GAGtB,IAAIsI,EACJ,QAAejD,IAAX9G,EAEF,IADAA,EAAS,EACJ+J,EAAI,EAAGA,EAAI6wB,EAAK56B,SAAU+J,EAC7B/J,GAAU46B,EAAK7wB,GAAG/J,OAItB,MAAMiK,EAASrK,EAAOkpC,YAAY9oC,GAClC,IAAI6rB,EAAM,EACV,IAAK9hB,EAAI,EAAGA,EAAI6wB,EAAK56B,SAAU+J,EAAG,CAChC,IAAIL,EAAMkxB,EAAK7wB,GACf,GAAIimD,EAAWtmD,EAAK2sB,YACdxK,EAAMniB,EAAI1J,OAASiK,EAAOjK,QACvBJ,EAAOE,SAAS4J,KAAMA,EAAM9J,EAAO2M,KAAK7C,IAC7CA,EAAI9H,KAAKqI,EAAQ4hB,IAEjBwK,WAAW13B,UAAUf,IAAIqB,KACvBgL,EACAP,EACAmiB,OAGC,KAAKjsB,EAAOE,SAAS4J,GAC1B,MAAM,IAAI6f,UAAU,+CAEpB7f,EAAI9H,KAAKqI,EAAQ4hB,GAEnBA,GAAOniB,EAAI1J,OAEb,OAAOiK,GAkDTrK,EAAOa,WAAaA,EA8EpBb,EAAOjB,UAAUg1D,WAAY,EAQ7B/zD,EAAOjB,UAAUi1D,OAAS,WACxB,MAAM9pD,EAAMpL,KAAKsB,OACjB,GAAI8J,EAAM,GAAM,EACd,MAAM,IAAIipB,WAAW,6CAEvB,IAAK,IAAIhpB,EAAI,EAAGA,EAAID,EAAKC,GAAK,EAC5BqnD,EAAK1yD,KAAMqL,EAAGA,EAAI,GAEpB,OAAOrL,MAGTkB,EAAOjB,UAAUk1D,OAAS,WACxB,MAAM/pD,EAAMpL,KAAKsB,OACjB,GAAI8J,EAAM,GAAM,EACd,MAAM,IAAIipB,WAAW,6CAEvB,IAAK,IAAIhpB,EAAI,EAAGA,EAAID,EAAKC,GAAK,EAC5BqnD,EAAK1yD,KAAMqL,EAAGA,EAAI,GAClBqnD,EAAK1yD,KAAMqL,EAAI,EAAGA,EAAI,GAExB,OAAOrL,MAGTkB,EAAOjB,UAAUm1D,OAAS,WACxB,MAAMhqD,EAAMpL,KAAKsB,OACjB,GAAI8J,EAAM,GAAM,EACd,MAAM,IAAIipB,WAAW,6CAEvB,IAAK,IAAIhpB,EAAI,EAAGA,EAAID,EAAKC,GAAK,EAC5BqnD,EAAK1yD,KAAMqL,EAAGA,EAAI,GAClBqnD,EAAK1yD,KAAMqL,EAAI,EAAGA,EAAI,GACtBqnD,EAAK1yD,KAAMqL,EAAI,EAAGA,EAAI,GACtBqnD,EAAK1yD,KAAMqL,EAAI,EAAGA,EAAI,GAExB,OAAOrL,MAGTkB,EAAOjB,UAAUgM,SAAW,WAC1B,MAAM3K,EAAStB,KAAKsB,OACpB,OAAe,IAAXA,EAAqB,GACA,IAArB2D,UAAU3D,OAAqB+wD,EAAUryD,KAAM,EAAGsB,GAC/C6wD,EAAantD,MAAMhF,KAAMiF,YAGlC/D,EAAOjB,UAAUo1D,eAAiBn0D,EAAOjB,UAAUgM,SAEnD/K,EAAOjB,UAAUirC,OAAS,SAAiBr4B,GACzC,IAAK3R,EAAOE,SAASyR,GAAI,MAAM,IAAIgY,UAAU,6BAC7C,OAAI7qB,OAAS6S,GACsB,IAA5B3R,EAAO41B,QAAQ92B,KAAM6S,IAG9B3R,EAAOjB,UAAUqS,QAAU,WACzB,IAAIjJ,EAAM,GACV,MAAM0H,EAAMrS,EAAQsyD,kBAGpB,OAFA3nD,EAAMrJ,KAAKiM,SAAS,MAAO,EAAG8E,GAAKnD,QAAQ,UAAW,OAAO0nD,OACzDt1D,KAAKsB,OAASyP,IAAK1H,GAAO,SACvB,WAAaA,EAAM,KAExBynD,IACF5vD,EAAOjB,UAAU6wD,GAAuB5vD,EAAOjB,UAAUqS,SAG3DpR,EAAOjB,UAAU62B,QAAU,SAAkBnJ,EAAQ9mB,EAAO6G,EAAK6nD,EAAWC,GAI1E,GAHIlE,EAAW3jC,EAAQgK,cACrBhK,EAASzsB,EAAO2M,KAAK8f,EAAQA,EAAOtsB,OAAQssB,EAAO5rB,cAEhDb,EAAOE,SAASusB,GACnB,MAAM,IAAI9C,UACR,wFAC2B8C,GAiB/B,QAbcvlB,IAAVvB,IACFA,EAAQ,QAEEuB,IAARsF,IACFA,EAAMigB,EAASA,EAAOrsB,OAAS,QAEf8G,IAAdmtD,IACFA,EAAY,QAEEntD,IAAZotD,IACFA,EAAUx1D,KAAKsB,QAGbuF,EAAQ,GAAK6G,EAAMigB,EAAOrsB,QAAUi0D,EAAY,GAAKC,EAAUx1D,KAAKsB,OACtE,MAAM,IAAI+yB,WAAW,sBAGvB,GAAIkhC,GAAaC,GAAW3uD,GAAS6G,EACnC,OAAO,EAET,GAAI6nD,GAAaC,EACf,OAAQ,EAEV,GAAI3uD,GAAS6G,EACX,OAAO,EAQT,GAAI1N,OAAS2tB,EAAQ,OAAO,EAE5B,IAAIzR,GAJJs5C,KAAa,IADbD,KAAe,GAMXp5C,GAPJzO,KAAS,IADT7G,KAAW,GASX,MAAMuE,EAAM0F,KAAK/D,IAAImP,EAAGC,GAElBs5C,EAAWz1D,KAAK4C,MAAM2yD,EAAWC,GACjCE,EAAa/nC,EAAO/qB,MAAMiE,EAAO6G,GAEvC,IAAK,IAAIrC,EAAI,EAAGA,EAAID,IAAOC,EACzB,GAAIoqD,EAASpqD,KAAOqqD,EAAWrqD,GAAI,CACjC6Q,EAAIu5C,EAASpqD,GACb8Q,EAAIu5C,EAAWrqD,GACf,MAIJ,OAAI6Q,EAAIC,GAAW,EACfA,EAAID,EAAU,EACX,GA4HThb,EAAOjB,UAAUsoC,SAAW,SAAmB5iC,EAAKiyB,EAAYoE,GAC9D,OAAoD,IAA7Ch8B,KAAKotB,QAAQznB,EAAKiyB,EAAYoE,IAGvC96B,EAAOjB,UAAUmtB,QAAU,SAAkBznB,EAAKiyB,EAAYoE,GAC5D,OAAO22B,EAAqB3yD,KAAM2F,EAAKiyB,EAAYoE,GAAU,IAG/D96B,EAAOjB,UAAU6yD,YAAc,SAAsBntD,EAAKiyB,EAAYoE,GACpE,OAAO22B,EAAqB3yD,KAAM2F,EAAKiyB,EAAYoE,GAAU,IA6C/D96B,EAAOjB,UAAUgD,MAAQ,SAAgBsN,EAAQlP,EAAQC,EAAQ06B,GAE/D,QAAe5zB,IAAX/G,EACF26B,EAAW,OACX16B,EAAStB,KAAKsB,OACdD,EAAS,OAEJ,QAAe+G,IAAX9G,GAA0C,iBAAXD,EACxC26B,EAAW36B,EACXC,EAAStB,KAAKsB,OACdD,EAAS,MAEJ,KAAI89B,SAAS99B,GAUlB,MAAM,IAAIpC,MACR,2EAVFoC,KAAoB,EAChB89B,SAAS79B,IACXA,KAAoB,OACH8G,IAAb4zB,IAAwBA,EAAW,UAEvCA,EAAW16B,EACXA,OAAS8G,GAQb,MAAMirD,EAAYrzD,KAAKsB,OAASD,EAGhC,SAFe+G,IAAX9G,GAAwBA,EAAS+xD,KAAW/xD,EAAS+xD,GAEpD9iD,EAAOjP,OAAS,IAAMA,EAAS,GAAKD,EAAS,IAAOA,EAASrB,KAAKsB,OACrE,MAAM,IAAI+yB,WAAW,0CAGlB2H,IAAUA,EAAW,QAE1B,IAAIg2B,GAAc,EAClB,OACE,OAAQh2B,GACN,IAAK,MACH,OAAOo3B,EAASpzD,KAAMuQ,EAAQlP,EAAQC,GAExC,IAAK,OACL,IAAK,QACH,OAAOkyD,EAAUxzD,KAAMuQ,EAAQlP,EAAQC,GAEzC,IAAK,QACL,IAAK,SACL,IAAK,SACH,OAAOoyD,EAAW1zD,KAAMuQ,EAAQlP,EAAQC,GAE1C,IAAK,SAEH,OAAOuyD,EAAY7zD,KAAMuQ,EAAQlP,EAAQC,GAE3C,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,OAAOwyD,EAAU9zD,KAAMuQ,EAAQlP,EAAQC,GAEzC,QACE,GAAI0wD,EAAa,MAAM,IAAInnC,UAAU,qBAAuBmR,GAC5DA,GAAY,GAAKA,GAAU6L,cAC3BmqB,GAAc,IAKtB9wD,EAAOjB,UAAU2T,OAAS,WACxB,MAAO,CACL5L,KAAM,SACNpH,KAAMc,MAAMzB,UAAU2C,MAAMrC,KAAKP,KAAKy0B,MAAQz0B,KAAM,KA2FxD,MAAMy0D,EAAuB,KAoB7B,SAASnC,EAAYtnD,EAAKnE,EAAO6G,GAC/B,IAAIiG,EAAM,GACVjG,EAAMoD,KAAK/D,IAAI/B,EAAI1J,OAAQoM,GAE3B,IAAK,IAAIrC,EAAIxE,EAAOwE,EAAIqC,IAAOrC,EAC7BsI,GAAO9H,OAAOC,aAAsB,IAATd,EAAIK,IAEjC,OAAOsI,EAGT,SAAS4+C,EAAavnD,EAAKnE,EAAO6G,GAChC,IAAIiG,EAAM,GACVjG,EAAMoD,KAAK/D,IAAI/B,EAAI1J,OAAQoM,GAE3B,IAAK,IAAIrC,EAAIxE,EAAOwE,EAAIqC,IAAOrC,EAC7BsI,GAAO9H,OAAOC,aAAad,EAAIK,IAEjC,OAAOsI,EAGT,SAASy+C,EAAUpnD,EAAKnE,EAAO6G,GAC7B,MAAMtC,EAAMJ,EAAI1J,SAEXuF,GAASA,EAAQ,KAAGA,EAAQ,KAC5B6G,GAAOA,EAAM,GAAKA,EAAMtC,KAAKsC,EAAMtC,GAExC,IAAItI,EAAM,GACV,IAAK,IAAIuI,EAAIxE,EAAOwE,EAAIqC,IAAOrC,EAC7BvI,GAAO6yD,EAAoB3qD,EAAIK,IAEjC,OAAOvI,EAGT,SAAS2vD,EAAcznD,EAAKnE,EAAO6G,GACjC,MAAMhL,EAAQsI,EAAIpI,MAAMiE,EAAO6G,GAC/B,IAAIlL,EAAM,GAEV,IAAK,IAAI6I,EAAI,EAAGA,EAAI3I,EAAMpB,OAAS,EAAG+J,GAAK,EACzC7I,GAAOqJ,OAAOC,aAAapJ,EAAM2I,GAAqB,IAAf3I,EAAM2I,EAAI,IAEnD,OAAO7I,EAkCT,SAASozD,EAAav0D,EAAQwkC,EAAKvkC,GACjC,GAAKD,EAAS,GAAO,GAAKA,EAAS,EAAG,MAAM,IAAIgzB,WAAW,sBAC3D,GAAIhzB,EAASwkC,EAAMvkC,EAAQ,MAAM,IAAI+yB,WAAW,yCA0QlD,SAASwhC,EAAU7qD,EAAKvJ,EAAOJ,EAAQwkC,EAAK90B,EAAKhE,GAC/C,IAAK7L,EAAOE,SAAS4J,GAAM,MAAM,IAAI6f,UAAU,+CAC/C,GAAIppB,EAAQsP,GAAOtP,EAAQsL,EAAK,MAAM,IAAIsnB,WAAW,qCACrD,GAAIhzB,EAASwkC,EAAM76B,EAAI1J,OAAQ,MAAM,IAAI+yB,WAAW,sBAgGtD,SAASyhC,EAAgB9qD,EAAKvJ,EAAOJ,EAAQ0L,EAAKgE,GAChDglD,EAAWt0D,EAAOsL,EAAKgE,EAAK/F,EAAK3J,EAAQ,GAEzC,IAAIyR,EAAK3T,OAAOsC,EAAQ02B,OAAO,aAC/BntB,EAAI3J,KAAYyR,EAChBA,IAAW,EACX9H,EAAI3J,KAAYyR,EAChBA,IAAW,EACX9H,EAAI3J,KAAYyR,EAChBA,IAAW,EACX9H,EAAI3J,KAAYyR,EAChB,IAAI4B,EAAKvV,OAAOsC,GAAS02B,OAAO,IAAMA,OAAO,aAQ7C,OAPAntB,EAAI3J,KAAYqT,EAChBA,IAAW,EACX1J,EAAI3J,KAAYqT,EAChBA,IAAW,EACX1J,EAAI3J,KAAYqT,EAChBA,IAAW,EACX1J,EAAI3J,KAAYqT,EACTrT,EAGT,SAAS20D,EAAgBhrD,EAAKvJ,EAAOJ,EAAQ0L,EAAKgE,GAChDglD,EAAWt0D,EAAOsL,EAAKgE,EAAK/F,EAAK3J,EAAQ,GAEzC,IAAIyR,EAAK3T,OAAOsC,EAAQ02B,OAAO,aAC/BntB,EAAI3J,EAAS,GAAKyR,EAClBA,IAAW,EACX9H,EAAI3J,EAAS,GAAKyR,EAClBA,IAAW,EACX9H,EAAI3J,EAAS,GAAKyR,EAClBA,IAAW,EACX9H,EAAI3J,EAAS,GAAKyR,EAClB,IAAI4B,EAAKvV,OAAOsC,GAAS02B,OAAO,IAAMA,OAAO,aAQ7C,OAPAntB,EAAI3J,EAAS,GAAKqT,EAClBA,IAAW,EACX1J,EAAI3J,EAAS,GAAKqT,EAClBA,IAAW,EACX1J,EAAI3J,EAAS,GAAKqT,EAClBA,IAAW,EACX1J,EAAI3J,GAAUqT,EACPrT,EAAS,EAmHlB,SAAS40D,EAAcjrD,EAAKvJ,EAAOJ,EAAQwkC,EAAK90B,EAAKhE,GACnD,GAAI1L,EAASwkC,EAAM76B,EAAI1J,OAAQ,MAAM,IAAI+yB,WAAW,sBACpD,GAAIhzB,EAAS,EAAG,MAAM,IAAIgzB,WAAW,sBAGvC,SAAS6hC,EAAYlrD,EAAKvJ,EAAOJ,EAAQ4S,EAAckiD,GAOrD,OANA10D,GAASA,EACTJ,KAAoB,EACf80D,GACHF,EAAajrD,EAAKvJ,EAAOJ,EAAQ,GAEnCwvD,EAAQ5tD,MAAM+H,EAAKvJ,EAAOJ,EAAQ4S,EAAc,GAAI,GAC7C5S,EAAS,EAWlB,SAAS+0D,EAAaprD,EAAKvJ,EAAOJ,EAAQ4S,EAAckiD,GAOtD,OANA10D,GAASA,EACTJ,KAAoB,EACf80D,GACHF,EAAajrD,EAAKvJ,EAAOJ,EAAQ,GAEnCwvD,EAAQ5tD,MAAM+H,EAAKvJ,EAAOJ,EAAQ4S,EAAc,GAAI,GAC7C5S,EAAS,EAxkBlBH,EAAOjB,UAAU2C,MAAQ,SAAgBiE,EAAO6G,GAC9C,MAAMtC,EAAMpL,KAAKsB,QACjBuF,IAAUA,GAGE,GACVA,GAASuE,GACG,IAAGvE,EAAQ,GACdA,EAAQuE,IACjBvE,EAAQuE,IANVsC,OAActF,IAARsF,EAAoBtC,IAAQsC,GASxB,GACRA,GAAOtC,GACG,IAAGsC,EAAM,GACVA,EAAMtC,IACfsC,EAAMtC,GAGJsC,EAAM7G,IAAO6G,EAAM7G,GAEvB,MAAMwvD,EAASr2D,KAAKs2D,SAASzvD,EAAO6G,GAIpC,OAFAlI,OAAOwpB,eAAeqnC,EAAQn1D,EAAOjB,WAE9Bo2D,GAWTn1D,EAAOjB,UAAUs2D,WACjBr1D,EAAOjB,UAAUu2D,WAAa,SAAqBn1D,EAAQU,EAAYo0D,GACrE90D,KAAoB,EACpBU,KAA4B,EACvBo0D,GAAUP,EAAYv0D,EAAQU,EAAY/B,KAAKsB,QAEpD,IAAIqE,EAAM3F,KAAKqB,GACXwP,EAAM,EACNxF,EAAI,EACR,OAASA,EAAItJ,IAAe8O,GAAO,MACjClL,GAAO3F,KAAKqB,EAASgK,GAAKwF,EAG5B,OAAOlL,GAGTzE,EAAOjB,UAAUw2D,WACjBv1D,EAAOjB,UAAUy2D,WAAa,SAAqBr1D,EAAQU,EAAYo0D,GACrE90D,KAAoB,EACpBU,KAA4B,EACvBo0D,GACHP,EAAYv0D,EAAQU,EAAY/B,KAAKsB,QAGvC,IAAIqE,EAAM3F,KAAKqB,IAAWU,GACtB8O,EAAM,EACV,KAAO9O,EAAa,IAAM8O,GAAO,MAC/BlL,GAAO3F,KAAKqB,IAAWU,GAAc8O,EAGvC,OAAOlL,GAGTzE,EAAOjB,UAAU02D,UACjBz1D,EAAOjB,UAAUoC,UAAY,SAAoBhB,EAAQ80D,GAGvD,OAFA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QACpCtB,KAAKqB,IAGdH,EAAOjB,UAAU22D,aACjB11D,EAAOjB,UAAU42D,aAAe,SAAuBx1D,EAAQ80D,GAG7D,OAFA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QACpCtB,KAAKqB,GAAWrB,KAAKqB,EAAS,IAAM,GAG7CH,EAAOjB,UAAU62D,aACjB51D,EAAOjB,UAAU8L,aAAe,SAAuB1K,EAAQ80D,GAG7D,OAFA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QACnCtB,KAAKqB,IAAW,EAAKrB,KAAKqB,EAAS,IAG7CH,EAAOjB,UAAU82D,aACjB71D,EAAOjB,UAAU+2D,aAAe,SAAuB31D,EAAQ80D,GAI7D,OAHA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,SAElCtB,KAAKqB,GACTrB,KAAKqB,EAAS,IAAM,EACpBrB,KAAKqB,EAAS,IAAM,IACD,SAAnBrB,KAAKqB,EAAS,IAGrBH,EAAOjB,UAAUg3D,aACjB/1D,EAAOjB,UAAUktC,aAAe,SAAuB9rC,EAAQ80D,GAI7D,OAHA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QAEpB,SAAftB,KAAKqB,IACTrB,KAAKqB,EAAS,IAAM,GACrBrB,KAAKqB,EAAS,IAAM,EACrBrB,KAAKqB,EAAS,KAGlBH,EAAOjB,UAAUi3D,gBAAkBC,GAAmB,SAA0B91D,GAE9E+1D,EADA/1D,KAAoB,EACG,UACvB,MAAMmL,EAAQxM,KAAKqB,GACb69C,EAAOl/C,KAAKqB,EAAS,QACb+G,IAAVoE,QAAgCpE,IAAT82C,GACzBmY,EAAYh2D,EAAQrB,KAAKsB,OAAS,GAGpC,MAAMwR,EAAKtG,EACQ,IAAjBxM,OAAOqB,GACU,MAAjBrB,OAAOqB,GACPrB,OAAOqB,GAAU,GAAK,GAElBqT,EAAK1U,OAAOqB,GACC,IAAjBrB,OAAOqB,GACU,MAAjBrB,OAAOqB,GACP69C,EAAO,GAAK,GAEd,OAAO/mB,OAAOrlB,IAAOqlB,OAAOzjB,IAAOyjB,OAAO,QAG5Cj3B,EAAOjB,UAAUq3D,gBAAkBH,GAAmB,SAA0B91D,GAE9E+1D,EADA/1D,KAAoB,EACG,UACvB,MAAMmL,EAAQxM,KAAKqB,GACb69C,EAAOl/C,KAAKqB,EAAS,QACb+G,IAAVoE,QAAgCpE,IAAT82C,GACzBmY,EAAYh2D,EAAQrB,KAAKsB,OAAS,GAGpC,MAAMoT,EAAKlI,EAAQ,GAAK,GACL,MAAjBxM,OAAOqB,GACU,IAAjBrB,OAAOqB,GACPrB,OAAOqB,GAEHyR,EAAK9S,OAAOqB,GAAU,GAAK,GACd,MAAjBrB,OAAOqB,GACU,IAAjBrB,OAAOqB,GACP69C,EAEF,OAAQ/mB,OAAOzjB,IAAOyjB,OAAO,KAAOA,OAAOrlB,MAG7C5R,EAAOjB,UAAUs3D,UAAY,SAAoBl2D,EAAQU,EAAYo0D,GACnE90D,KAAoB,EACpBU,KAA4B,EACvBo0D,GAAUP,EAAYv0D,EAAQU,EAAY/B,KAAKsB,QAEpD,IAAIqE,EAAM3F,KAAKqB,GACXwP,EAAM,EACNxF,EAAI,EACR,OAASA,EAAItJ,IAAe8O,GAAO,MACjClL,GAAO3F,KAAKqB,EAASgK,GAAKwF,EAM5B,OAJAA,GAAO,IAEHlL,GAAOkL,IAAKlL,GAAOmL,KAAKoB,IAAI,EAAG,EAAInQ,IAEhC4D,GAGTzE,EAAOjB,UAAUu3D,UAAY,SAAoBn2D,EAAQU,EAAYo0D,GACnE90D,KAAoB,EACpBU,KAA4B,EACvBo0D,GAAUP,EAAYv0D,EAAQU,EAAY/B,KAAKsB,QAEpD,IAAI+J,EAAItJ,EACJ8O,EAAM,EACNlL,EAAM3F,KAAKqB,IAAWgK,GAC1B,KAAOA,EAAI,IAAMwF,GAAO,MACtBlL,GAAO3F,KAAKqB,IAAWgK,GAAKwF,EAM9B,OAJAA,GAAO,IAEHlL,GAAOkL,IAAKlL,GAAOmL,KAAKoB,IAAI,EAAG,EAAInQ,IAEhC4D,GAGTzE,EAAOjB,UAAUw3D,SAAW,SAAmBp2D,EAAQ80D,GAGrD,OAFA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QACtB,IAAftB,KAAKqB,IAC0B,GAA5B,IAAOrB,KAAKqB,GAAU,GADKrB,KAAKqB,IAI3CH,EAAOjB,UAAUy3D,YAAc,SAAsBr2D,EAAQ80D,GAC3D90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QAC3C,MAAMqE,EAAM3F,KAAKqB,GAAWrB,KAAKqB,EAAS,IAAM,EAChD,OAAc,MAANsE,EAAsB,WAANA,EAAmBA,GAG7CzE,EAAOjB,UAAU03D,YAAc,SAAsBt2D,EAAQ80D,GAC3D90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QAC3C,MAAMqE,EAAM3F,KAAKqB,EAAS,GAAMrB,KAAKqB,IAAW,EAChD,OAAc,MAANsE,EAAsB,WAANA,EAAmBA,GAG7CzE,EAAOjB,UAAU23D,YAAc,SAAsBv2D,EAAQ80D,GAI3D,OAHA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QAEnCtB,KAAKqB,GACVrB,KAAKqB,EAAS,IAAM,EACpBrB,KAAKqB,EAAS,IAAM,GACpBrB,KAAKqB,EAAS,IAAM,IAGzBH,EAAOjB,UAAU43D,YAAc,SAAsBx2D,EAAQ80D,GAI3D,OAHA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QAEnCtB,KAAKqB,IAAW,GACrBrB,KAAKqB,EAAS,IAAM,GACpBrB,KAAKqB,EAAS,IAAM,EACpBrB,KAAKqB,EAAS,IAGnBH,EAAOjB,UAAU63D,eAAiBX,GAAmB,SAAyB91D,GAE5E+1D,EADA/1D,KAAoB,EACG,UACvB,MAAMmL,EAAQxM,KAAKqB,GACb69C,EAAOl/C,KAAKqB,EAAS,QACb+G,IAAVoE,QAAgCpE,IAAT82C,GACzBmY,EAAYh2D,EAAQrB,KAAKsB,OAAS,GAGpC,MAAMqE,EAAM3F,KAAKqB,EAAS,GACL,IAAnBrB,KAAKqB,EAAS,GACK,MAAnBrB,KAAKqB,EAAS,IACb69C,GAAQ,IAEX,OAAQ/mB,OAAOxyB,IAAQwyB,OAAO,KAC5BA,OAAO3rB,EACU,IAAjBxM,OAAOqB,GACU,MAAjBrB,OAAOqB,GACPrB,OAAOqB,GAAU,GAAK,OAG1BH,EAAOjB,UAAU83D,eAAiBZ,GAAmB,SAAyB91D,GAE5E+1D,EADA/1D,KAAoB,EACG,UACvB,MAAMmL,EAAQxM,KAAKqB,GACb69C,EAAOl/C,KAAKqB,EAAS,QACb+G,IAAVoE,QAAgCpE,IAAT82C,GACzBmY,EAAYh2D,EAAQrB,KAAKsB,OAAS,GAGpC,MAAMqE,GAAO6G,GAAS,IACH,MAAjBxM,OAAOqB,GACU,IAAjBrB,OAAOqB,GACPrB,OAAOqB,GAET,OAAQ82B,OAAOxyB,IAAQwyB,OAAO,KAC5BA,OAAOn4B,OAAOqB,GAAU,GAAK,GACZ,MAAjBrB,OAAOqB,GACU,IAAjBrB,OAAOqB,GACP69C,MAGJh+C,EAAOjB,UAAU+3D,YAAc,SAAsB32D,EAAQ80D,GAG3D,OAFA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QACpCuvD,EAAQviB,KAAKtuC,KAAMqB,GAAQ,EAAM,GAAI,IAG9CH,EAAOjB,UAAUg4D,YAAc,SAAsB52D,EAAQ80D,GAG3D,OAFA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QACpCuvD,EAAQviB,KAAKtuC,KAAMqB,GAAQ,EAAO,GAAI,IAG/CH,EAAOjB,UAAUi4D,aAAe,SAAuB72D,EAAQ80D,GAG7D,OAFA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QACpCuvD,EAAQviB,KAAKtuC,KAAMqB,GAAQ,EAAM,GAAI,IAG9CH,EAAOjB,UAAUk4D,aAAe,SAAuB92D,EAAQ80D,GAG7D,OAFA90D,KAAoB,EACf80D,GAAUP,EAAYv0D,EAAQ,EAAGrB,KAAKsB,QACpCuvD,EAAQviB,KAAKtuC,KAAMqB,GAAQ,EAAO,GAAI,IAS/CH,EAAOjB,UAAUm4D,YACjBl3D,EAAOjB,UAAUo4D,YAAc,SAAsB52D,EAAOJ,EAAQU,EAAYo0D,GAC9E10D,GAASA,EACTJ,KAAoB,EACpBU,KAA4B,EACvBo0D,GAEHN,EAAS71D,KAAMyB,EAAOJ,EAAQU,EADb+O,KAAKoB,IAAI,EAAG,EAAInQ,GAAc,EACK,GAGtD,IAAI8O,EAAM,EACNxF,EAAI,EAER,IADArL,KAAKqB,GAAkB,IAARI,IACN4J,EAAItJ,IAAe8O,GAAO,MACjC7Q,KAAKqB,EAASgK,GAAM5J,EAAQoP,EAAO,IAGrC,OAAOxP,EAASU,GAGlBb,EAAOjB,UAAUq4D,YACjBp3D,EAAOjB,UAAUy8C,YAAc,SAAsBj7C,EAAOJ,EAAQU,EAAYo0D,GAC9E10D,GAASA,EACTJ,KAAoB,EACpBU,KAA4B,EACvBo0D,GAEHN,EAAS71D,KAAMyB,EAAOJ,EAAQU,EADb+O,KAAKoB,IAAI,EAAG,EAAInQ,GAAc,EACK,GAGtD,IAAIsJ,EAAItJ,EAAa,EACjB8O,EAAM,EAEV,IADA7Q,KAAKqB,EAASgK,GAAa,IAAR5J,IACV4J,GAAK,IAAMwF,GAAO,MACzB7Q,KAAKqB,EAASgK,GAAM5J,EAAQoP,EAAO,IAGrC,OAAOxP,EAASU,GAGlBb,EAAOjB,UAAUs4D,WACjBr3D,EAAOjB,UAAUy/C,WAAa,SAAqBj+C,EAAOJ,EAAQ80D,GAKhE,OAJA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,IAAM,GACtDrB,KAAKqB,GAAmB,IAARI,EACTJ,EAAS,GAGlBH,EAAOjB,UAAUu4D,cACjBt3D,EAAOjB,UAAUw4D,cAAgB,SAAwBh3D,EAAOJ,EAAQ80D,GAMtE,OALA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,MAAQ,GACxDrB,KAAKqB,GAAmB,IAARI,EAChBzB,KAAKqB,EAAS,GAAMI,IAAU,EACvBJ,EAAS,GAGlBH,EAAOjB,UAAUy4D,cACjBx3D,EAAOjB,UAAUmO,cAAgB,SAAwB3M,EAAOJ,EAAQ80D,GAMtE,OALA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,MAAQ,GACxDrB,KAAKqB,GAAWI,IAAU,EAC1BzB,KAAKqB,EAAS,GAAc,IAARI,EACbJ,EAAS,GAGlBH,EAAOjB,UAAU04D,cACjBz3D,EAAOjB,UAAU24D,cAAgB,SAAwBn3D,EAAOJ,EAAQ80D,GAQtE,OAPA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,WAAY,GAC5DrB,KAAKqB,EAAS,GAAMI,IAAU,GAC9BzB,KAAKqB,EAAS,GAAMI,IAAU,GAC9BzB,KAAKqB,EAAS,GAAMI,IAAU,EAC9BzB,KAAKqB,GAAmB,IAARI,EACTJ,EAAS,GAGlBH,EAAOjB,UAAU44D,cACjB33D,EAAOjB,UAAUoqC,cAAgB,SAAwB5oC,EAAOJ,EAAQ80D,GAQtE,OAPA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,WAAY,GAC5DrB,KAAKqB,GAAWI,IAAU,GAC1BzB,KAAKqB,EAAS,GAAMI,IAAU,GAC9BzB,KAAKqB,EAAS,GAAMI,IAAU,EAC9BzB,KAAKqB,EAAS,GAAc,IAARI,EACbJ,EAAS,GA+ClBH,EAAOjB,UAAU64D,iBAAmB3B,GAAmB,SAA2B11D,EAAOJ,EAAS,GAChG,OAAOy0D,EAAe91D,KAAMyB,EAAOJ,EAAQ82B,OAAO,GAAIA,OAAO,0BAG/Dj3B,EAAOjB,UAAU84D,iBAAmB5B,GAAmB,SAA2B11D,EAAOJ,EAAS,GAChG,OAAO20D,EAAeh2D,KAAMyB,EAAOJ,EAAQ82B,OAAO,GAAIA,OAAO,0BAG/Dj3B,EAAOjB,UAAU+4D,WAAa,SAAqBv3D,EAAOJ,EAAQU,EAAYo0D,GAG5E,GAFA10D,GAASA,EACTJ,KAAoB,GACf80D,EAAU,CACb,MAAMvlC,EAAQ9f,KAAKoB,IAAI,EAAI,EAAInQ,EAAc,GAE7C8zD,EAAS71D,KAAMyB,EAAOJ,EAAQU,EAAY6uB,EAAQ,GAAIA,GAGxD,IAAIvlB,EAAI,EACJwF,EAAM,EACN8F,EAAM,EAEV,IADA3W,KAAKqB,GAAkB,IAARI,IACN4J,EAAItJ,IAAe8O,GAAO,MAC7BpP,EAAQ,GAAa,IAARkV,GAAsC,IAAzB3W,KAAKqB,EAASgK,EAAI,KAC9CsL,EAAM,GAER3W,KAAKqB,EAASgK,IAAO5J,EAAQoP,GAAQ,GAAK8F,EAAM,IAGlD,OAAOtV,EAASU,GAGlBb,EAAOjB,UAAUg5D,WAAa,SAAqBx3D,EAAOJ,EAAQU,EAAYo0D,GAG5E,GAFA10D,GAASA,EACTJ,KAAoB,GACf80D,EAAU,CACb,MAAMvlC,EAAQ9f,KAAKoB,IAAI,EAAI,EAAInQ,EAAc,GAE7C8zD,EAAS71D,KAAMyB,EAAOJ,EAAQU,EAAY6uB,EAAQ,GAAIA,GAGxD,IAAIvlB,EAAItJ,EAAa,EACjB8O,EAAM,EACN8F,EAAM,EAEV,IADA3W,KAAKqB,EAASgK,GAAa,IAAR5J,IACV4J,GAAK,IAAMwF,GAAO,MACrBpP,EAAQ,GAAa,IAARkV,GAAsC,IAAzB3W,KAAKqB,EAASgK,EAAI,KAC9CsL,EAAM,GAER3W,KAAKqB,EAASgK,IAAO5J,EAAQoP,GAAQ,GAAK8F,EAAM,IAGlD,OAAOtV,EAASU,GAGlBb,EAAOjB,UAAUi5D,UAAY,SAAoBz3D,EAAOJ,EAAQ80D,GAM9D,OALA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,KAAO,KACnDI,EAAQ,IAAGA,EAAQ,IAAOA,EAAQ,GACtCzB,KAAKqB,GAAmB,IAARI,EACTJ,EAAS,GAGlBH,EAAOjB,UAAUk5D,aAAe,SAAuB13D,EAAOJ,EAAQ80D,GAMpE,OALA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,OAAS,OACzDrB,KAAKqB,GAAmB,IAARI,EAChBzB,KAAKqB,EAAS,GAAMI,IAAU,EACvBJ,EAAS,GAGlBH,EAAOjB,UAAUonC,aAAe,SAAuB5lC,EAAOJ,EAAQ80D,GAMpE,OALA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,OAAS,OACzDrB,KAAKqB,GAAWI,IAAU,EAC1BzB,KAAKqB,EAAS,GAAc,IAARI,EACbJ,EAAS,GAGlBH,EAAOjB,UAAUm5D,aAAe,SAAuB33D,EAAOJ,EAAQ80D,GAQpE,OAPA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,YAAa,YAC7DrB,KAAKqB,GAAmB,IAARI,EAChBzB,KAAKqB,EAAS,GAAMI,IAAU,EAC9BzB,KAAKqB,EAAS,GAAMI,IAAU,GAC9BzB,KAAKqB,EAAS,GAAMI,IAAU,GACvBJ,EAAS,GAGlBH,EAAOjB,UAAUo5D,aAAe,SAAuB53D,EAAOJ,EAAQ80D,GASpE,OARA10D,GAASA,EACTJ,KAAoB,EACf80D,GAAUN,EAAS71D,KAAMyB,EAAOJ,EAAQ,EAAG,YAAa,YACzDI,EAAQ,IAAGA,EAAQ,WAAaA,EAAQ,GAC5CzB,KAAKqB,GAAWI,IAAU,GAC1BzB,KAAKqB,EAAS,GAAMI,IAAU,GAC9BzB,KAAKqB,EAAS,GAAMI,IAAU,EAC9BzB,KAAKqB,EAAS,GAAc,IAARI,EACbJ,EAAS,GAGlBH,EAAOjB,UAAUq5D,gBAAkBnC,GAAmB,SAA0B11D,EAAOJ,EAAS,GAC9F,OAAOy0D,EAAe91D,KAAMyB,EAAOJ,GAAS82B,OAAO,sBAAuBA,OAAO,0BAGnFj3B,EAAOjB,UAAUs5D,gBAAkBpC,GAAmB,SAA0B11D,EAAOJ,EAAS,GAC9F,OAAO20D,EAAeh2D,KAAMyB,EAAOJ,GAAS82B,OAAO,sBAAuBA,OAAO,0BAkBnFj3B,EAAOjB,UAAUu5D,aAAe,SAAuB/3D,EAAOJ,EAAQ80D,GACpE,OAAOD,EAAWl2D,KAAMyB,EAAOJ,GAAQ,EAAM80D,IAG/Cj1D,EAAOjB,UAAUw5D,aAAe,SAAuBh4D,EAAOJ,EAAQ80D,GACpE,OAAOD,EAAWl2D,KAAMyB,EAAOJ,GAAQ,EAAO80D,IAahDj1D,EAAOjB,UAAUy5D,cAAgB,SAAwBj4D,EAAOJ,EAAQ80D,GACtE,OAAOC,EAAYp2D,KAAMyB,EAAOJ,GAAQ,EAAM80D,IAGhDj1D,EAAOjB,UAAU05D,cAAgB,SAAwBl4D,EAAOJ,EAAQ80D,GACtE,OAAOC,EAAYp2D,KAAMyB,EAAOJ,GAAQ,EAAO80D,IAIjDj1D,EAAOjB,UAAUiD,KAAO,SAAeyqB,EAAQisC,EAAa/yD,EAAO6G,GACjE,IAAKxM,EAAOE,SAASusB,GAAS,MAAM,IAAI9C,UAAU,+BAQlD,GAPKhkB,IAAOA,EAAQ,GACf6G,GAAe,IAARA,IAAWA,EAAM1N,KAAKsB,QAC9Bs4D,GAAejsC,EAAOrsB,SAAQs4D,EAAcjsC,EAAOrsB,QAClDs4D,IAAaA,EAAc,GAC5BlsD,EAAM,GAAKA,EAAM7G,IAAO6G,EAAM7G,GAG9B6G,IAAQ7G,EAAO,OAAO,EAC1B,GAAsB,IAAlB8mB,EAAOrsB,QAAgC,IAAhBtB,KAAKsB,OAAc,OAAO,EAGrD,GAAIs4D,EAAc,EAChB,MAAM,IAAIvlC,WAAW,6BAEvB,GAAIxtB,EAAQ,GAAKA,GAAS7G,KAAKsB,OAAQ,MAAM,IAAI+yB,WAAW,sBAC5D,GAAI3mB,EAAM,EAAG,MAAM,IAAI2mB,WAAW,2BAG9B3mB,EAAM1N,KAAKsB,SAAQoM,EAAM1N,KAAKsB,QAC9BqsB,EAAOrsB,OAASs4D,EAAclsD,EAAM7G,IACtC6G,EAAMigB,EAAOrsB,OAASs4D,EAAc/yD,GAGtC,MAAMuE,EAAMsC,EAAM7G,EAalB,OAXI7G,OAAS2tB,GAAqD,mBAApCgK,WAAW13B,UAAU45D,WAEjD75D,KAAK65D,WAAWD,EAAa/yD,EAAO6G,GAEpCiqB,WAAW13B,UAAUf,IAAIqB,KACvBotB,EACA3tB,KAAKs2D,SAASzvD,EAAO6G,GACrBksD,GAIGxuD,GAOTlK,EAAOjB,UAAU4kD,KAAO,SAAel/C,EAAKkB,EAAO6G,EAAKsuB,GAEtD,GAAmB,iBAARr2B,EAAkB,CAS3B,GARqB,iBAAVkB,GACTm1B,EAAWn1B,EACXA,EAAQ,EACR6G,EAAM1N,KAAKsB,QACa,iBAARoM,IAChBsuB,EAAWtuB,EACXA,EAAM1N,KAAKsB,aAEI8G,IAAb4zB,GAA8C,iBAAbA,EACnC,MAAM,IAAInR,UAAU,6BAEtB,GAAwB,iBAAbmR,IAA0B96B,EAAOuvD,WAAWz0B,GACrD,MAAM,IAAInR,UAAU,qBAAuBmR,GAE7C,GAAmB,IAAfr2B,EAAIrE,OAAc,CACpB,MAAMqxB,EAAOhtB,EAAI0I,WAAW,IACV,SAAb2tB,GAAuBrJ,EAAO,KAClB,WAAbqJ,KAEFr2B,EAAMgtB,QAGc,iBAARhtB,EAChBA,GAAY,IACY,kBAARA,IAChBA,EAAMxG,OAAOwG,IAIf,GAAIkB,EAAQ,GAAK7G,KAAKsB,OAASuF,GAAS7G,KAAKsB,OAASoM,EACpD,MAAM,IAAI2mB,WAAW,sBAGvB,GAAI3mB,GAAO7G,EACT,OAAO7G,KAQT,IAAIqL,EACJ,GANAxE,KAAkB,EAClB6G,OAActF,IAARsF,EAAoB1N,KAAKsB,OAASoM,IAAQ,EAE3C/H,IAAKA,EAAM,GAGG,iBAARA,EACT,IAAK0F,EAAIxE,EAAOwE,EAAIqC,IAAOrC,EACzBrL,KAAKqL,GAAK1F,MAEP,CACL,MAAMjD,EAAQxB,EAAOE,SAASuE,GAC1BA,EACAzE,EAAO2M,KAAKlI,EAAKq2B,GACf5wB,EAAM1I,EAAMpB,OAClB,GAAY,IAAR8J,EACF,MAAM,IAAIyf,UAAU,cAAgBllB,EAClC,qCAEJ,IAAK0F,EAAI,EAAGA,EAAIqC,EAAM7G,IAASwE,EAC7BrL,KAAKqL,EAAIxE,GAASnE,EAAM2I,EAAID,GAIhC,OAAOpL,MAOT,MAAMuJ,EAAS,GACf,SAASuwD,EAAG1mC,EAAKU,EAAY3zB,GAC3BoJ,EAAO6pB,GAAO,cAAwBjzB,EACpC8B,cACEm/B,QAEA57B,OAAO8nB,eAAettB,KAAM,UAAW,CACrCyB,MAAOqyB,EAAW9uB,MAAMhF,KAAMiF,WAC9BwoB,UAAU,EACVD,cAAc,IAIhBxtB,KAAKF,KAAO,GAAGE,KAAKF,SAASszB,KAG7BpzB,KAAKmK,aAEEnK,KAAKF,KAGV6yB,WACF,OAAOS,EAGLT,SAAMlxB,GACR+D,OAAO8nB,eAAettB,KAAM,OAAQ,CAClCwtB,cAAc,EACdD,YAAY,EACZ9rB,MAAAA,EACAgsB,UAAU,IAIdxhB,WACE,MAAO,GAAGjM,KAAKF,SAASszB,OAASpzB,KAAKkK,YAkC5C,SAAS6vD,EAAuBp0D,GAC9B,IAAInD,EAAM,GACN6I,EAAI1F,EAAIrE,OACZ,MAAMuF,EAAmB,MAAXlB,EAAI,GAAa,EAAI,EACnC,KAAO0F,GAAKxE,EAAQ,EAAGwE,GAAK,EAC1B7I,EAAM,IAAImD,EAAI/C,MAAMyI,EAAI,EAAGA,KAAK7I,IAElC,MAAO,GAAGmD,EAAI/C,MAAM,EAAGyI,KAAK7I,IAa9B,SAASuzD,EAAYt0D,EAAOsL,EAAKgE,EAAK/F,EAAK3J,EAAQU,GACjD,GAAIN,EAAQsP,GAAOtP,EAAQsL,EAAK,CAC9B,MAAMiR,EAAmB,iBAARjR,EAAmB,IAAM,GAC1C,IAAIoxB,EAWJ,MARIA,EAFAp8B,EAAa,EACH,IAARgL,GAAaA,IAAQorB,OAAO,GACtB,OAAOna,YAAYA,QAA2B,GAAlBjc,EAAa,KAASic,IAElD,SAASA,QAA2B,GAAlBjc,EAAa,GAAS,IAAIic,iBACtB,GAAlBjc,EAAa,GAAS,IAAIic,IAGhC,MAAMjR,IAAMiR,YAAYjN,IAAMiN,IAElC,IAAIzU,EAAOywD,iBAAiB,QAAS77B,EAAO18B,IArBtD,SAAsBuJ,EAAK3J,EAAQU,GACjCq1D,EAAe/1D,EAAQ,eACH+G,IAAhB4C,EAAI3J,SAAsD+G,IAA7B4C,EAAI3J,EAASU,IAC5Cs1D,EAAYh2D,EAAQ2J,EAAI1J,QAAUS,EAAa,IAoBjDk4D,CAAYjvD,EAAK3J,EAAQU,GAG3B,SAASq1D,EAAgB31D,EAAO3B,GAC9B,GAAqB,iBAAV2B,EACT,MAAM,IAAI8H,EAAOue,qBAAqBhoB,EAAM,SAAU2B,GAI1D,SAAS41D,EAAa51D,EAAOH,EAAQ0G,GACnC,GAAI8I,KAAK6gB,MAAMlwB,KAAWA,EAExB,MADA21D,EAAe31D,EAAOuG,GAChB,IAAIuB,EAAOywD,iBAAiBhyD,GAAQ,SAAU,aAAcvG,GAGpE,GAAIH,EAAS,EACX,MAAM,IAAIiI,EAAO2wD,yBAGnB,MAAM,IAAI3wD,EAAOywD,iBAAiBhyD,GAAQ,SACR,MAAMA,EAAO,EAAI,YAAY1G,IAC7BG,GAtFpCq4D,EAAE,4BACA,SAAUh6D,GACR,OAAIA,EACK,GAAGA,gCAGL,mDACNu0B,YACLylC,EAAE,wBACA,SAAUh6D,EAAMspB,GACd,MAAO,QAAQtpB,4DAA+DspB,MAC7EyB,WACLivC,EAAE,oBACA,SAAUzwD,EAAK80B,EAAOp4B,GACpB,IAAI0D,EAAM,iBAAiBJ,sBACvB8wD,EAAWp0D,EAWf,OAVI5G,OAAOi7D,UAAUr0D,IAAU+K,KAAKgE,IAAI/O,GAAS,GAAK,GACpDo0D,EAAWJ,EAAsBluD,OAAO9F,IACd,iBAAVA,IAChBo0D,EAAWtuD,OAAO9F,IACdA,EAAQoyB,OAAO,IAAMA,OAAO,KAAOpyB,IAAUoyB,OAAO,IAAMA,OAAO,QACnEgiC,EAAWJ,EAAsBI,IAEnCA,GAAY,KAEd1wD,GAAO,eAAe00B,eAAmBg8B,IAClC1wD,IACN4qB,YAiEL,MAAMgmC,EAAoB,oBAgB1B,SAASpI,EAAa1hD,EAAQwjD,GAE5B,IAAIG,EADJH,EAAQA,GAAS1jC,EAAAA,EAEjB,MAAM/uB,EAASiP,EAAOjP,OACtB,IAAIg5D,EAAgB,KACpB,MAAM53D,EAAQ,GAEd,IAAK,IAAI2I,EAAI,EAAGA,EAAI/J,IAAU+J,EAAG,CAI/B,GAHA6oD,EAAY3jD,EAAOlC,WAAWhD,GAG1B6oD,EAAY,OAAUA,EAAY,MAAQ,CAE5C,IAAKoG,EAAe,CAElB,GAAIpG,EAAY,MAAQ,EAEjBH,GAAS,IAAM,GAAGrxD,EAAMqC,KAAK,IAAM,IAAM,KAC9C,SACK,GAAIsG,EAAI,IAAM/J,EAAQ,EAEtByyD,GAAS,IAAM,GAAGrxD,EAAMqC,KAAK,IAAM,IAAM,KAC9C,SAIFu1D,EAAgBpG,EAEhB,SAIF,GAAIA,EAAY,MAAQ,EACjBH,GAAS,IAAM,GAAGrxD,EAAMqC,KAAK,IAAM,IAAM,KAC9Cu1D,EAAgBpG,EAChB,SAIFA,EAAkE,OAArDoG,EAAgB,OAAU,GAAKpG,EAAY,YAC/CoG,IAEJvG,GAAS,IAAM,GAAGrxD,EAAMqC,KAAK,IAAM,IAAM,KAMhD,GAHAu1D,EAAgB,KAGZpG,EAAY,IAAM,CACpB,IAAKH,GAAS,GAAK,EAAG,MACtBrxD,EAAMqC,KAAKmvD,QACN,GAAIA,EAAY,KAAO,CAC5B,IAAKH,GAAS,GAAK,EAAG,MACtBrxD,EAAMqC,KACJmvD,GAAa,EAAM,IACP,GAAZA,EAAmB,UAEhB,GAAIA,EAAY,MAAS,CAC9B,IAAKH,GAAS,GAAK,EAAG,MACtBrxD,EAAMqC,KACJmvD,GAAa,GAAM,IACnBA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,SAEhB,MAAIA,EAAY,SASrB,MAAM,IAAIj1D,MAAM,sBARhB,IAAK80D,GAAS,GAAK,EAAG,MACtBrxD,EAAMqC,KACJmvD,GAAa,GAAO,IACpBA,GAAa,GAAM,GAAO,IAC1BA,GAAa,EAAM,GAAO,IACd,GAAZA,EAAmB,MAOzB,OAAOxxD,EA4BT,SAASwvD,EAAe7oD,GACtB,OAAOsE,EAAOstB,YAxHhB,SAAsB5xB,GAMpB,IAFAA,GAFAA,EAAMA,EAAIiE,MAAM,KAAK,IAEXgoD,OAAO1nD,QAAQysD,EAAmB,KAEpC/4D,OAAS,EAAG,MAAO,GAE3B,KAAO+H,EAAI/H,OAAS,GAAM,GACxB+H,GAAY,IAEd,OAAOA,EA6GmBkxD,CAAYlxD,IAGxC,SAASoqD,EAAY7b,EAAK4iB,EAAKn5D,EAAQC,GACrC,IAAI+J,EACJ,IAAKA,EAAI,EAAGA,EAAI/J,KACT+J,EAAIhK,GAAUm5D,EAAIl5D,QAAY+J,GAAKusC,EAAIt2C,UADpB+J,EAExBmvD,EAAInvD,EAAIhK,GAAUu2C,EAAIvsC,GAExB,OAAOA,EAMT,SAASimD,EAAYptD,EAAK8D,GACxB,OAAO9D,aAAe8D,GACZ,MAAP9D,GAAkC,MAAnBA,EAAIjC,aAA+C,MAAxBiC,EAAIjC,YAAYnC,MACzDoE,EAAIjC,YAAYnC,OAASkI,EAAKlI,KAEpC,SAAS01B,EAAatxB,GAEpB,OAAOA,GAAQA,EAKjB,MAAMyxD,EAAsB,WAC1B,MAAM8E,EAAW,mBACXC,EAAQ,IAAIh5D,MAAM,KACxB,IAAK,IAAI2J,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,MAAMsvD,EAAU,GAAJtvD,EACZ,IAAK,IAAIC,EAAI,EAAGA,EAAI,KAAMA,EACxBovD,EAAMC,EAAMrvD,GAAKmvD,EAASpvD,GAAKovD,EAASnvD,GAG5C,OAAOovD,EATmB,GAa5B,SAASvD,EAAoBluC,GAC3B,MAAyB,oBAAXkP,OAAyByiC,GAAyB3xC,EAGlE,SAAS2xC,KACP,MAAM,IAAI37D,MAAM,kCCxjElBR,EAAOC,QAAU,CACf,IAAO,WACP,IAAO,sBACP,IAAO,aACP,IAAO,KACP,IAAO,UACP,IAAO,WACP,IAAO,gCACP,IAAO,aACP,IAAO,gBACP,IAAO,kBACP,IAAO,eACP,IAAO,mBACP,IAAO,UACP,IAAO,mBACP,IAAO,oBACP,IAAO,QACP,IAAO,YACP,IAAO,eACP,IAAO,YACP,IAAO,qBACP,IAAO,qBACP,IAAO,cACP,IAAO,eACP,IAAO,mBACP,IAAO,YACP,IAAO,YACP,IAAO,qBACP,IAAO,iBACP,IAAO,gCACP,IAAO,kBACP,IAAO,WACP,IAAO,OACP,IAAO,kBACP,IAAO,sBACP,IAAO,oBACP,IAAO,eACP,IAAO,yBACP,IAAO,wBACP,IAAO,qBACP,IAAO,eACP,IAAO,sBACP,IAAO,uBACP,IAAO,SACP,IAAO,oBACP,IAAO,uBACP,IAAO,mBACP,IAAO,wBACP,IAAO,oBACP,IAAO,kCACP,IAAO,gCACP,IAAO,wBACP,IAAO,kBACP,IAAO,cACP,IAAO,sBACP,IAAO,kBACP,IAAO,6BACP,IAAO,0BACP,IAAO,uBACP,IAAO,gBACP,IAAO,2BACP,IAAO,eACP,IAAO,mDC7DT,MAAMm8D,EAAM,EAAQ,MACd9rB,EAAiB,EAAQ,MAmG/BtwC,EAAOC,QAjGP,MACEuD,YAAa64D,EAAO77B,GAKlB,GAJAj/B,KAAK86D,MAAQA,EACb96D,KAAK+6D,YAAcD,EAAMC,YACzB/6D,KAAKg7D,eAAiB,IAAIx8D,KAErBwB,KAAK86D,QAAU96D,KAAK86D,MAAM17D,MAAQY,KAAK86D,MAAMG,IAChD,MAAM,IAAIh8D,MAAM,yDAGlBe,KAAKzB,MAAQ,IAAIs8D,EAAI57B,GAGvBg8B,IAAKrxD,EAAOoB,EAAK+9B,EAAK,UACpB,IAAK/oC,KAAKzB,MACR,OAAOwwC,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAG3Ce,KAAKzB,MAAM28D,OAAOtxD,GAClB5J,KAAK86D,MAAMG,IAAIrxD,EAAOoB,EAAK+9B,GAG7B3pC,IAAKwK,EAAOq1B,EAAM8J,EAAK,UACrB,GAAoB,mBAAT9J,EAAqB,OAAOj/B,KAAKZ,IAAIwK,EAAO,KAAMq1B,GAE7D,IAAKj/B,KAAKzB,MACR,OAAOwwC,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAGtCggC,IAAMA,EAAO,IAElB,IAAIj0B,EAAMhL,KAAKzB,MAAMa,IAAIwK,GACzB,GAAIoB,EAAK,CACP,MAAM3J,EAAS49B,EAAK59B,QAAU,EACxB+J,EAAM6zB,EAAK39B,QAAW0J,EAAI1J,OAASD,EAIzC,OAHe,IAAXA,GAAgB+J,IAAQJ,EAAI1J,SAC9B0J,EAAMA,EAAIpI,MAAMvB,EAAQ+J,EAAM/J,IAEzB0tC,GAAe,IAAMhG,EAAG,KAAM/9B,KAIvC,IAAImwD,EAAUn7D,KAAKg7D,eAAe57D,IAAIwK,GACtC,MAAMwxD,IAAsBD,EACvBA,IACHA,EAAU,GACVn7D,KAAKg7D,eAAe97D,IAAI0K,EAAOuxD,IAGjCA,EAAQp2D,KAAK,CACXk6B,KAAAA,EACA8J,GAAAA,IAGGqyB,GACHp7D,KAAK86D,MAAM17D,IAAIwK,GAAO,CAACG,EAAKiB,KACrBjB,GAAqB,MAAd/J,KAAKzB,OAAeyB,KAAKzB,MAAMW,IAAI0K,EAAOoB,GAEtD,MAAMqwD,EAAkBr7D,KAAKg7D,eAAe57D,IAAIwK,GAChD5J,KAAKg7D,eAAe/hC,OAAOrvB,GAE3B,IAAK,MAAM,KAAEq1B,EAAI,GAAE8J,KAAQsyB,EACzB,GAAItxD,EACFg/B,EAAGh/B,OACE,CACL,MAAM1I,EAAS49B,EAAK59B,QAAU,EACxB+J,EAAM6zB,EAAK39B,QAAW0J,EAAI1J,OAASD,EACzC,IAAIi6D,EAAYtwD,EACD,IAAX3J,GAAgB+J,IAAQJ,EAAI1J,SAC9Bg6D,EAAYtwD,EAAIpI,MAAMvB,EAAQ+J,EAAM/J,IAEtC0nC,EAAG,KAAMuyB,OAOnB1T,MAAO7e,EAAK,UACV,IAAK/oC,KAAKzB,MACR,OAAOwwC,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAG3Ce,KAAKzB,MAAQ,KACbyB,KAAK86D,MAAMlT,MAAM7e,GAGnBvD,QAASuD,EAAK,UACZ,IAAK/oC,KAAKzB,MACR,OAAOwwC,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAG3Ce,KAAKzB,MAAQ,KACbyB,KAAK86D,MAAMt1B,QAAQuD,kCC/FvB,IAAIwyB,EAAe,EAAQ,KAEvBC,EAAW,EAAQ,MAEnBC,EAAWD,EAASD,EAAa,6BAErC98D,EAAOC,QAAU,SAA4BoB,EAAM47D,GAClD,IAAIC,EAAYJ,EAAaz7D,IAAQ47D,GACrC,MAAyB,mBAAdC,GAA4BF,EAAS37D,EAAM,gBAAkB,EAChE07D,EAASG,GAEVA,gCCXR,IAAI3xC,EAAO,EAAQ,MACfuxC,EAAe,EAAQ,KAEvBK,EAASL,EAAa,8BACtBM,EAAQN,EAAa,6BACrBO,EAAgBP,EAAa,mBAAmB,IAASvxC,EAAKzpB,KAAKs7D,EAAOD,GAE1EG,EAAQR,EAAa,qCAAqC,GAC1DS,EAAkBT,EAAa,2BAA2B,GAC1DU,EAAOV,EAAa,cAExB,GAAIS,EACH,IACCA,EAAgB,GAAI,IAAK,CAAEv6D,MAAO,IACjC,MAAOiF,GAERs1D,EAAkB,KAIpBv9D,EAAOC,QAAU,SAAkBw9D,GAClC,IAAIC,EAAOL,EAAc9xC,EAAM6xC,EAAO52D,WACtC,GAAI82D,GAASC,EAAiB,CAC7B,IAAII,EAAOL,EAAMI,EAAM,UACnBC,EAAK5uC,cAERwuC,EACCG,EACA,SACA,CAAE16D,MAAO,EAAIw6D,EAAK,EAAGC,EAAiB56D,QAAU2D,UAAU3D,OAAS,MAItE,OAAO66D,GAGR,IAAIE,EAAY,WACf,OAAOP,EAAc9xC,EAAM4xC,EAAQ32D,YAGhC+2D,EACHA,EAAgBv9D,EAAOC,QAAS,QAAS,CAAE+C,MAAO46D,IAElD59D,EAAOC,QAAQsG,MAAQq3D,kBC7CxB,MAAMC,EAAc,EAAQ,KACtBz8B,EAAS,EAAQ,MAEvB,MAAM08B,UAA8B18B,EAAO2jB,SACzCvhD,YAAa64D,EAAOC,EAAa97B,EAAO,IAGtC,GAFAmC,MAAMnC,IAED67B,IAAUA,EAAMG,MAAQH,EAAM17D,IACjC,MAAM,IAAIH,MAAM,kEAGlB,KADA87D,EAAc57D,OAAO47D,IACH,MAAM,IAAI97D,MAAM,0CAElC,MAAMg4C,OAAmC7uC,IAArB62B,EAAKgY,aAAoChY,EAAKgY,YAClEj3C,KAAKw8D,aAAe,IAAIF,EAAYvB,EAAa,IAAK97B,EAAMgY,YAAAA,IAC5Dj3C,KAAKy8D,iBAAmB,EACxBz8D,KAAK08D,yBAA2Bz9B,EAAK09B,yBAA2B,GAEhE,IAAI/yD,EAAQ,EAsBZ5J,KAAKw8D,aACF93B,GAAG,QAtBSyY,IACTn9C,KAAKmjC,YAETnjC,KAAKy8D,kBAAoB,EACrBz8D,KAAKy8D,kBAAoBz8D,KAAK08D,0BAChC18D,KAAKw8D,aAAaI,QAEpB9B,EAAMG,IAAIrxD,EAAOuzC,GAAQpzC,IACvB,GAAIA,EAAK,OAAO/J,KAAKwlC,QAAQz7B,GAC7B/J,KAAKy8D,kBAAoB,EACrBz8D,KAAKy8D,iBAAmBz8D,KAAK08D,0BAC/B18D,KAAKw8D,aAAaK,SAEU,IAA1B78D,KAAKy8D,kBAAmD,mBAAlBz8D,KAAK88D,WAC7C98D,KAAK88D,SAAS,MACd98D,KAAK88D,SAAW,SAGpBlzD,GAAS,MAKR86B,GAAG,SAAS36B,IAAS/J,KAAKwlC,QAAQz7B,MAGvCyiC,OAAQ2Q,EAAOnhB,EAAU8E,GACvB9gC,KAAKw8D,aAAav5D,MAAMk6C,EAAOnhB,EAAU8E,GAG3Cwc,OAAQvU,GACN/oC,KAAKw8D,aAAa9uD,MAClB1N,KAAKw8D,aAAah4B,KAAK,OAAO,KACE,IAA1BxkC,KAAKy8D,iBAAwB1zB,EAAG,MAC/B/oC,KAAK88D,SAAW/zB,KAIzBvD,QAASz7B,GACH/J,KAAKmjC,YACTnjC,KAAKmjC,WAAY,EAEbp5B,GAAK/J,KAAKylC,KAAK,QAAS17B,GAC5B/J,KAAKylC,KAAK,WAIdhnC,EAAOC,QAAU69D,kBClEjB,IAAIr7D,EAAS,eACT61C,EAAY,kBACZgmB,EAAgB,UAGpB,SAAStb,EAAYub,GACnBjmB,EAAUx2C,KAAKP,MACfA,KAAKg9D,SAA+B,iBAAbA,EACnBh9D,KAAKg9D,SACPh9D,KAAKg9D,GAAYh9D,KAAKi9D,eAEtBj9D,KAAKu9C,MAAQv9C,KAAKi9D,eAEhBj9D,KAAKs9C,SACPt9C,KAAKk9D,QAAUl9D,KAAKs9C,OACpBt9C,KAAKs9C,OAAS,MAEhBt9C,KAAKm9D,SAAW,KAChBn9D,KAAKo9D,UAAY,KAfJ,EAAQ,KAiBvBx9D,CAAS6hD,EAAY1K,GAErB0K,EAAWxhD,UAAUmxC,OAAS,SAAUxwC,EAAMy8D,EAAUC,GAClC,iBAAT18D,IACTA,EAAOM,EAAO2M,KAAKjN,EAAMy8D,IAG3B,IAAIE,EAAUv9D,KAAKk9C,QAAQt8C,GAC3B,OAAIZ,KAAKg9D,SAAiBh9D,MAEtBs9D,IACFC,EAAUv9D,KAAKw9D,UAAUD,EAASD,IAG7BC,IAGT9b,EAAWxhD,UAAUo/C,eAAiB,aACtCoC,EAAWxhD,UAAUw9C,WAAa,WAChC,MAAM,IAAIx+C,MAAM,gDAGlBwiD,EAAWxhD,UAAUy9C,WAAa,WAChC,MAAM,IAAIz+C,MAAM,gDAGlBwiD,EAAWxhD,UAAU09C,OAAS,WAC5B,MAAM,IAAI1+C,MAAM,2CAGlBwiD,EAAWxhD,UAAUo3C,WAAa,SAAUz2C,EAAM6d,EAAGiI,GACnD,IAAI3c,EACJ,IACM/J,KAAKg9D,SACPh9D,KAAKk9C,QAAQt8C,GAEbZ,KAAK+E,KAAK/E,KAAKk9C,QAAQt8C,IAEzB,MAAO8F,GACPqD,EAAMrD,EACN,QACAggB,EAAK3c,KAGT03C,EAAWxhD,UAAUw3C,OAAS,SAAU1iB,GACtC,IAAIhrB,EACJ,IACE/J,KAAK+E,KAAK/E,KAAKk9D,WACf,MAAOx2D,GACPqD,EAAMrD,EAGRquB,EAAKhrB,IAEP03C,EAAWxhD,UAAUg9D,eAAiB,SAAUK,GAC9C,IAAIC,EAAUv9D,KAAKk9D,WAAah8D,EAAO6B,MAAM,GAI7C,OAHIu6D,IACFC,EAAUv9D,KAAKw9D,UAAUD,EAASD,GAAW,IAExCC,GAGT9b,EAAWxhD,UAAUu9D,UAAY,SAAU/7D,EAAOhB,EAAKg9D,GAMrD,GALKz9D,KAAKm9D,WACRn9D,KAAKm9D,SAAW,IAAIJ,EAAct8D,GAClCT,KAAKo9D,UAAY38D,GAGfT,KAAKo9D,YAAc38D,EAAK,MAAM,IAAIxB,MAAM,0BAE5C,IAAI6D,EAAM9C,KAAKm9D,SAASl6D,MAAMxB,GAK9B,OAJIg8D,IACF36D,GAAO9C,KAAKm9D,SAASzvD,OAGhB5K,GAGTrE,EAAOC,QAAU+iD,uCClGb98C,EAAQ,WACZ,aAEA,SAAS+4D,EAAYx5D,EAAK8D,GACxB,OAAe,MAARA,GAAgB9D,aAAe8D,EAGxC,IAAI21D,EASAC,EAOAC,EAfJ,IACEF,EAAYn/D,IACZ,MAAMigB,GAGNk/C,EAAY,aAId,IACEC,EAAY5jC,IACZ,MAAMvb,GACNm/C,EAAY,aAId,IACEC,EAAgBryC,QAChB,MAAM/M,GACNo/C,EAAgB,aAwBlB,SAASl5D,EAAMnB,EAAQs6D,EAAU3tC,EAAOlwB,EAAW89D,GACzB,iBAAbD,IACT3tC,EAAQ2tC,EAAS3tC,MACjBlwB,EAAY69D,EAAS79D,UACrB89D,EAAuBD,EAASC,qBAChCD,EAAWA,EAASA,UAItB,IAAIE,EAAa,GACbC,EAAc,GAEdC,OAA6B,IAAVh9D,EA0IvB,YAxIuB,IAAZ48D,IACTA,GAAW,QAEO,IAAT3tC,IACTA,EAAQE,EAAAA,GAGV,SAAS8tC,EAAO36D,EAAQ2sB,GAEtB,GAAe,OAAX3sB,EACF,OAAO,KAET,GAAc,IAAV2sB,EACF,OAAO3sB,EAET,IAAI4B,EACAwvD,EACJ,GAAqB,iBAAVpxD,EACT,OAAOA,EAGT,GAAIk6D,EAAYl6D,EAAQm6D,GACtBv4D,EAAQ,IAAIu4D,OACP,GAAID,EAAYl6D,EAAQo6D,GAC7Bx4D,EAAQ,IAAIw4D,OACP,GAAIF,EAAYl6D,EAAQq6D,GAC7Bz4D,EAAQ,IAAIy4D,GAAc,SAAUpyC,EAAS+c,GAC3ChlC,EAAO4nB,MAAK,SAAS3pB,GACnBgqB,EAAQ0yC,EAAO18D,EAAO0uB,EAAQ,OAC7B,SAASpmB,GACVy+B,EAAO21B,EAAOp0D,EAAKomB,EAAQ,eAG1B,GAAIxrB,EAAMy5D,UAAU56D,GACzB4B,EAAQ,QACH,GAAIT,EAAM05D,WAAW76D,GAC1B4B,EAAQ,IAAIsyB,OAAOl0B,EAAOusB,OAAQuuC,EAAiB96D,IAC/CA,EAAO+6D,YAAWn5D,EAAMm5D,UAAY/6D,EAAO+6D,gBAC1C,GAAI55D,EAAM65D,SAASh7D,GACxB4B,EAAQ,IAAI6H,KAAKzJ,EAAOi0B,eACnB,IAAIymC,GAAah9D,EAAOE,SAASoC,GAStC,OANE4B,EAFElE,EAAOkpC,YAEDlpC,EAAOkpC,YAAY5mC,EAAOlC,QAG1B,IAAIJ,EAAOsC,EAAOlC,QAE5BkC,EAAON,KAAKkC,GACLA,EACEs4D,EAAYl6D,EAAQvE,OAC7BmG,EAAQI,OAAOgpB,OAAOhrB,QAEE,IAAbvD,GACT20D,EAAQpvD,OAAO0pB,eAAe1rB,GAC9B4B,EAAQI,OAAOgpB,OAAOomC,KAGtBxvD,EAAQI,OAAOgpB,OAAOvuB,GACtB20D,EAAQ30D,GAIZ,GAAI69D,EAAU,CACZ,IAAIl0D,EAAQo0D,EAAW5wC,QAAQ5pB,GAE/B,IAAc,GAAVoG,EACF,OAAOq0D,EAAYr0D,GAErBo0D,EAAWj5D,KAAKvB,GAChBy6D,EAAYl5D,KAAKK,GAiBnB,IAAK,IAAIiG,KAdLqyD,EAAYl6D,EAAQm6D,IACtBn6D,EAAOR,SAAQ,SAASvB,EAAO4C,GAC7B,IAAIo6D,EAAWN,EAAO95D,EAAK8rB,EAAQ,GAC/BuuC,EAAaP,EAAO18D,EAAO0uB,EAAQ,GACvC/qB,EAAMlG,IAAIu/D,EAAUC,MAGpBhB,EAAYl6D,EAAQo6D,IACtBp6D,EAAOR,SAAQ,SAASvB,GACtB,IAAIk9D,EAAaR,EAAO18D,EAAO0uB,EAAQ,GACvC/qB,EAAMsR,IAAIioD,MAIAn7D,EAAQ,CACpB,IAAIo7D,EACAhK,IACFgK,EAAQp5D,OAAO6tB,yBAAyBuhC,EAAOvpD,IAG7CuzD,GAAsB,MAAbA,EAAM1/D,MAGnBkG,EAAMiG,GAAK8yD,EAAO36D,EAAO6H,GAAI8kB,EAAQ,IAGvC,GAAI3qB,OAAO2tB,sBACT,KAAI0rC,EAAUr5D,OAAO2tB,sBAAsB3vB,GAC3C,IAAS6H,EAAI,EAAGA,EAAIwzD,EAAQv9D,OAAQ+J,IAAK,CAGvC,IAAIyzD,EAASD,EAAQxzD,MACjBwiB,EAAaroB,OAAO6tB,yBAAyB7vB,EAAQs7D,KACtCjxC,EAAWN,YAAewwC,KAG7C34D,EAAM05D,GAAUX,EAAO36D,EAAOs7D,GAAS3uC,EAAQ,GAC1CtC,EAAWN,YACd/nB,OAAO8nB,eAAeloB,EAAO05D,EAAQ,CACnCvxC,YAAY,MAMpB,GAAIwwC,EACF,KAAIgB,EAAmBv5D,OAAOw5D,oBAAoBx7D,GAClD,IAAS6H,EAAI,EAAGA,EAAI0zD,EAAiBz9D,OAAQ+J,IAAK,CAChD,IACIwiB,EADAoxC,EAAeF,EAAiB1zD,IAChCwiB,EAAaroB,OAAO6tB,yBAAyB7vB,EAAQy7D,KACvCpxC,EAAWN,aAG7BnoB,EAAM65D,GAAgBd,EAAO36D,EAAOy7D,GAAe9uC,EAAQ,GAC3D3qB,OAAO8nB,eAAeloB,EAAO65D,EAAc,CACzC1xC,YAAY,MAKlB,OAAOnoB,EAGF+4D,CAAO36D,EAAQ2sB,GAqBxB,SAAS+uC,EAAWpoD,GAClB,OAAOtR,OAAOvF,UAAUgM,SAAS1L,KAAKuW,GAmBxC,SAASwnD,EAAiB7wD,GACxB,IAAI0nB,EAAQ,GAIZ,OAHI1nB,EAAG0xD,SAAQhqC,GAAS,KACpB1nB,EAAG2xD,aAAYjqC,GAAS,KACxB1nB,EAAG4xD,YAAWlqC,GAAS,KACpBA,EAIT,OAxCAxwB,EAAM26D,eAAiB,SAAwB97D,GAC7C,GAAe,OAAXA,EACF,OAAO,KAET,IAAIgN,EAAI,aAER,OADAA,EAAEvQ,UAAYuD,EACP,IAAIgN,GAQb7L,EAAMu6D,WAAaA,EAKnBv6D,EAAM65D,SAHN,SAAkB1nD,GAChB,MAAoB,iBAANA,GAAoC,kBAAlBooD,EAAWpoD,IAO7CnS,EAAMy5D,UAHN,SAAmBtnD,GACjB,MAAoB,iBAANA,GAAoC,mBAAlBooD,EAAWpoD,IAO7CnS,EAAM05D,WAHN,SAAoBvnD,GAClB,MAAoB,iBAANA,GAAoC,oBAAlBooD,EAAWpoD,IAW7CnS,EAAM25D,iBAAmBA,EAElB35D,EA3PK,GA8PsBlG,EAAOC,UACvCD,EAAOC,QAAUiG,mBC9PnB,IAAI4uB,EAAO,EAAQ,MACfnwB,EAAS,EAAQ,MACrB,SAAS0G,IAAQ,OAAO,IAAImD,MAAOwqB,UAEnC,IACI1N,EADAnnB,EAAQlB,MAAMzB,UAAU2C,MAExB28D,EAAQ,GAGRx1C,OADkB,IAAX,EAAA/H,GAA0B,EAAAA,EAAO+H,QAC9B,EAAA/H,EAAO+H,QACQ,oBAAX1Z,QAA0BA,OAAO0Z,QACrC1Z,OAAO0Z,QAEP,GAed,IAZA,IAAIy1C,EAAY,CACZ,CAuBJ,aAvBU,OACN,CAwBJ,WACIz1C,EAAQ8H,IAAI7sB,MAAM+kB,EAAS9kB,YAzBpB,QACP,CA2BJ,WACI8kB,EAAQ8H,IAAI7sB,MAAM+kB,EAAS9kB,YA5BpB,QACP,CA8BJ,WACI8kB,EAAQH,KAAK5kB,MAAM+kB,EAAS9kB,YA/BpB,SACR,CAiCJ,SAAcsI,GACVgyD,EAAMhyD,GAASzD,KAlCR,QACP,CAoCJ,SAAiByD,GACb,IAAIkB,EAAO8wD,EAAMhyD,GACjB,IAAKkB,EACD,MAAM,IAAIxP,MAAM,kBAAoBsO,UAGjCgyD,EAAMhyD,GACb,IAAIkyD,EAAW31D,IAAQ2E,EACvBsb,EAAQ8H,IAAItkB,EAAQ,KAAOkyD,EAAW,OA5C5B,WACV,CA8CJ,WACI,IAAI11D,EAAM,IAAI9K,MACd8K,EAAIjK,KAAO,QACXiK,EAAIG,QAAUqpB,EAAKmsC,OAAO16D,MAAM,KAAMC,WACtC8kB,EAAQxoB,MAAMwI,EAAII,QAlDV,SACR,CAoDJ,SAAaw1D,GACT51C,EAAQ8H,IAAI0B,EAAKjhB,QAAQqtD,GAAU,OArD7B,OACN,CAuDJ,SAAuBC,GACnB,IAAKA,EAAY,CACb,IAAIrrC,EAAM3xB,EAAMrC,KAAK0E,UAAW,GAChC7B,EAAOylB,IAAG,EAAO0K,EAAKmsC,OAAO16D,MAAM,KAAMuvB,MA1D7B,WAGXlpB,EAAI,EAAGA,EAAIm0D,EAAUl+D,OAAQ+J,IAAK,CACvC,IAAIw0D,EAAQL,EAAUn0D,GAClBsqB,EAAIkqC,EAAM,GACV//D,EAAO+/D,EAAM,GAEZ91C,EAAQjqB,KACTiqB,EAAQjqB,GAAQ61B,GAIxBl3B,EAAOC,QAAUqrB,YCvCjBtrB,EAAOC,QAAU,WAGf,IAFA,IAAIkH,EAAMk6D,UAAUC,qBAAuB,EACvCC,EAAO,GACF30D,EAAI,EAAGA,EAAIzF,EAAKyF,IACvB20D,EAAKj7D,KAAK,CACRk7D,MAAO,GACPC,MAAO,EACPX,MAAO,CAAEY,KAAM,EAAGC,KAAM,EAAGC,IAAK,EAAGC,KAAM,EAAGC,IAAK,KAGrD,OAAOP,wCCVLQ,EAAW,EAAQ,MACnB3wD,EAAK,EAAQ,MAEjBpR,EAAOC,QAAU,SAAqB0mD,GACpC,OAAO,IAAIqb,EAAKrb,IAGlB,IAAIsb,EAAU,CACZC,UAAW,CACT7gE,KAAM,YACNiC,WAAY,IAEd6+D,UAAW,CACT9gE,KAAM,OACNiC,WAAY,IAEd8+D,WAAY,CACV/gE,KAAM,OACNiC,WAAY,IAEd++D,WAAY,CACVhhE,KAAM,OACNiC,WAAY,IAEdg/D,QAAS,CACPjhE,KAAM,UACNiC,WAAY,IAEdi/D,UAAW,CACTlhE,KAAM,OACNiC,WAAY,IAEdk/D,UAAW,CACTnhE,KAAM,OACNiC,WAAY,KAUhB,SAAS0+D,EAAMrb,GACbplD,KAAKkhE,UAAYR,EAAQtb,GACpBplD,KAAKkhE,YACRlhE,KAAKkhE,UAAY,CACfphE,KAAMslD,IAGVplD,KAAKolD,MAAQ,IAAIob,EAASW,GAAGnhE,KAAKkhE,UAAUphE,MAC5CE,KAAKyF,UAAO,EAwDd,SAAS27D,EAAmBC,EAAI5gE,EAAK2K,GAC9B1J,MAAMC,QAAQ0/D,KACjBA,EAAKA,EAAGnyD,WAEV,IAAIlE,EAAM,IAAI9J,EAAOmgE,GACrB,GAAIj2D,GAAOJ,EAAI1J,OAAS8J,EAAK,CAC3B,IAAImH,EAAQ,IAAIrR,EAAOkK,EAAMJ,EAAI1J,QACjCiR,EAAMsyC,KAAK,GACX75C,EAAM9J,EAAOqC,OAAO,CAACgP,EAAOvH,IAE9B,OAAKvK,EAGIuK,EAAIiB,SAASxL,GAFbuK,EAjFX01D,EAAQr7C,KAAOq7C,EAAQE,UACvBF,EAAQY,KAAOZ,EAAQa,UAAYb,EAAQG,WAC3CH,EAAQp7C,KAAOo7C,EAAQc,UAAYd,EAAQI,WAC3CJ,EAAQe,KAAOf,EAAQM,UACvBN,EAAQgB,KAAOhB,EAAQO,UAavBR,EAAKxgE,UAAU4jC,aAAe,SAAUpjC,EAAKi/D,GAE3C,OADA1/D,KAAKyF,KAAOzF,KAAKolD,MAAMuc,aAChB3hE,KAAK4hE,aAAanhE,EAAKi/D,IAGhCe,EAAKxgE,UAAUyqC,cAAgB,SAAUzZ,EAAO4wC,EAAOphE,GAOrD,OANAohE,EAAQA,GAAS,OACZ3gE,EAAOE,SAAS6vB,KACnBA,EAAQ,IAAI/vB,EAAO+vB,EAAO4wC,IAIrBT,EAFQphE,KAAKolD,MAAM0c,cAAc7wC,GAAO8wC,YAC5BlxD,IAAI7Q,KAAKyF,KAAKu8D,cAAcC,OACjBxhE,EAAKT,KAAKkhE,UAAUn/D,aAGpD0+D,EAAKxgE,UAAU2hE,aAAe,SAAUnhE,EAAKi/D,GAC3C,IAAIr7D,EAAMrE,KAAKyF,KAAKs8D,UAAqB,eAAXrC,GAAyB,GAQvD,MAPe,WAAXA,IACEr7D,EAAIA,EAAI/C,OAAS,GAAK,EACxB+C,EAAI,GAAK,EAETA,EAAI,GAAK,GAGN+8D,EAAkB/8D,EAAK5D,IAGhCggE,EAAKxgE,UAAUiiE,cAAgB,SAAUzhE,GACvC,OAAO2gE,EAAkBphE,KAAKyF,KAAKu8D,aAAcvhE,IAGnDggE,EAAKxgE,UAAUkiE,aAAe,SAAUrc,EAAKrlD,GAM3C,OALAA,EAAMA,GAAO,OACRS,EAAOE,SAAS0kD,KACnBA,EAAM,IAAI5kD,EAAO4kD,EAAKrlD,IAExBT,KAAKyF,KAAK28D,cAActc,GACjB9lD,MAGTygE,EAAKxgE,UAAUoiE,cAAgB,SAAUpgB,EAAMxhD,GAC7CA,EAAMA,GAAO,OACRS,EAAOE,SAAS6gD,KACnBA,EAAO,IAAI/gD,EAAO+gD,EAAMxhD,IAG1B,IAAI6hE,EAAQ,IAAIzyD,EAAGoyC,GAInB,OAHAqgB,EAAQA,EAAMr2D,SAAS,IACvBjM,KAAKyF,KAAOzF,KAAKolD,MAAMuc,aACvB3hE,KAAKyF,KAAK88D,eAAeD,GAClBtiE,6BCzGT,SAAWvB,EAAQC,GACjB,aAGA,SAAS0E,EAAQuC,EAAK8D,GACpB,IAAK9D,EAAK,MAAM,IAAI1G,MAAMwK,GAAO,oBAKnC,SAAS7J,EAAU6P,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS3P,UAAYyP,EAAUzP,UAC/BwP,EAAKxP,UAAY,IAAI2P,EACrBH,EAAKxP,UAAUgC,YAAcwN,EAK/B,SAASI,EAAIC,EAAQtQ,EAAMuQ,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT9P,KAAKiQ,SAAW,EAChBjQ,KAAKkQ,MAAQ,KACblQ,KAAKsB,OAAS,EAGdtB,KAAKmQ,IAAM,KAEI,OAAXL,IACW,OAATtQ,GAA0B,OAATA,IACnBuQ,EAASvQ,EACTA,EAAO,IAGTQ,KAAKkF,MAAM4K,GAAU,EAAGtQ,GAAQ,GAAIuQ,GAAU,OAYlD,IAAI7O,EATkB,iBAAXzC,EACTA,EAAOC,QAAUmR,EAEjBnR,EAAQmR,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IAEIlP,EADoB,oBAAXmP,aAAmD,IAAlBA,OAAOnP,OACxCmP,OAAOnP,OAEP,eAEX,MAAOwF,IAgIT,SAAS4J,EAAeC,EAAQ3G,GAC9B,IAAI4G,EAAID,EAAOlC,WAAWzE,GAE1B,OAAI4G,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASC,EAAcF,EAAQG,EAAY9G,GACzC,IAAI+G,EAAIL,EAAcC,EAAQ3G,GAI9B,OAHIA,EAAQ,GAAK8G,IACfC,GAAKL,EAAcC,EAAQ3G,EAAQ,IAAM,GAEpC+G,EA8CT,SAASC,EAAWvH,EAAKxC,EAAO6G,EAAKmD,GAGnC,IAFA,IAAIF,EAAI,EACJvF,EAAM0F,KAAK/D,IAAI1D,EAAI/H,OAAQoM,GACtBrC,EAAIxE,EAAOwE,EAAID,EAAKC,IAAK,CAChC,IAAImF,EAAInH,EAAIgF,WAAWhD,GAAK,GAE5BsF,GAAKE,EAIHF,GADEH,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOG,EAnNTd,EAAGG,KAAO,SAAepK,GACvB,OAAIA,aAAeiK,GAIJ,OAARjK,GAA+B,iBAARA,GAC5BA,EAAI3D,YAAYmO,WAAaP,EAAGO,UAAY1O,MAAMC,QAAQiE,EAAIsK,QAGlEL,EAAGkB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG9C,IAAM,SAAciE,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG5P,UAAUiF,MAAQ,SAAe4K,EAAQtQ,EAAMuQ,GAChD,GAAsB,iBAAXD,EACT,OAAO9P,KAAKmR,YAAYrB,EAAQtQ,EAAMuQ,GAGxC,GAAsB,iBAAXD,EACT,OAAO9P,KAAKoR,WAAWtB,EAAQtQ,EAAMuQ,GAG1B,QAATvQ,IACFA,EAAO,IAET4D,EAAO5D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqH,EAAQ,EACM,OAFlBiJ,EAASA,EAAO7D,WAAW2B,QAAQ,OAAQ,KAEhC,KACT/G,IACA7G,KAAKiQ,SAAW,GAGdpJ,EAAQiJ,EAAOxO,SACJ,KAAT9B,EACFQ,KAAKqR,UAAUvB,EAAQjJ,EAAOkJ,IAE9B/P,KAAKsR,WAAWxB,EAAQtQ,EAAMqH,GACf,OAAXkJ,GACF/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,MAM9CF,EAAG5P,UAAUkR,YAAc,SAAsBrB,EAAQtQ,EAAMuQ,GACzDD,EAAS,IACX9P,KAAKiQ,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX9P,KAAKkQ,MAAQ,CAAW,SAATJ,GACf9P,KAAKsB,OAAS,GACLwO,EAAS,kBAClB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB9P,KAAKsB,OAAS,IAEd8B,EAAO0M,EAAS,kBAChB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF9P,KAAKsB,OAAS,GAGD,OAAXyO,GAGJ/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,IAGxCF,EAAG5P,UAAUmR,WAAa,SAAqBtB,EAAQtQ,EAAMuQ,GAG3D,GADA3M,EAAgC,iBAAlB0M,EAAOxO,QACjBwO,EAAOxO,QAAU,EAGnB,OAFAtB,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EACPtB,KAGTA,KAAKsB,OAASwP,KAAKS,KAAKzB,EAAOxO,OAAS,GACxCtB,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAGlB,IAAIC,EAAGkG,EACHC,EAAM,EACV,GAAe,OAAX1B,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAGgK,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,UAGC,GAAe,OAAXyE,EACT,IAAK1E,EAAI,EAAGC,EAAI,EAAGD,EAAIyE,EAAOxO,OAAQ+J,GAAK,EACzCmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,KAIN,OAAOtL,KAAK0R,SAyBd7B,EAAG5P,UAAUoR,UAAY,SAAoBvB,EAAQjJ,EAAOkJ,GAE1D/P,KAAKsB,OAASwP,KAAKS,MAAMzB,EAAOxO,OAASuF,GAAS,GAClD7G,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAIlB,IAGImG,EAHAC,EAAM,EACNnG,EAAI,EAGR,GAAe,OAAXyE,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAG+J,GAAKxE,EAAOwE,GAAK,EAC3CmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,OAKX,IAAKpG,GADayE,EAAOxO,OAASuF,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOwE,EAAIyE,EAAOxO,OAAQ+J,GAAK,EAC1EmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,EAKbzR,KAAK0R,SA2BP7B,EAAG5P,UAAUqR,WAAa,SAAqBxB,EAAQtQ,EAAMqH,GAE3D7G,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EAGd,IAAK,IAAIqQ,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWpS,EAClEmS,IAEFA,IACAC,EAAWA,EAAUpS,EAAQ,EAO7B,IALA,IAAIqS,EAAQ/B,EAAOxO,OAASuF,EACxBiL,EAAMD,EAAQF,EACdjE,EAAMoD,KAAK/D,IAAI8E,EAAOA,EAAQC,GAAOjL,EAErCkL,EAAO,EACF1G,EAAIxE,EAAOwE,EAAIqC,EAAKrC,GAAKsG,EAChCI,EAAOnB,EAAUd,EAAQzE,EAAGA,EAAIsG,EAASnS,GAEzCQ,KAAKgS,MAAMJ,GACP5R,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOnB,EAAUd,EAAQzE,EAAGyE,EAAOxO,OAAQ9B,GAEtC6L,EAAI,EAAGA,EAAIyG,EAAKzG,IACnB6G,GAAO1S,EAGTQ,KAAKgS,MAAME,GACPlS,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB/R,KAAK0R,SAGP7B,EAAG5P,UAAUiD,KAAO,SAAeiP,GACjCA,EAAKjC,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/B8G,EAAKjC,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAE7B8G,EAAK7Q,OAAStB,KAAKsB,OACnB6Q,EAAKlC,SAAWjQ,KAAKiQ,SACrBkC,EAAKhC,IAAMnQ,KAAKmQ,KAGlBN,EAAG5P,UAAU0E,MAAQ,WACnB,IAAIgM,EAAI,IAAId,EAAG,MAEf,OADA7P,KAAKkD,KAAKyN,GACHA,GAGTd,EAAG5P,UAAUmS,QAAU,SAAkBxT,GACvC,KAAOoB,KAAKsB,OAAS1C,GACnBoB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAE9B,OAAOtB,MAIT6P,EAAG5P,UAAUyR,MAAQ,WACnB,KAAO1R,KAAKsB,OAAS,GAAqC,IAAhCtB,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IACjDtB,KAAKsB,SAEP,OAAOtB,KAAKqS,aAGdxC,EAAG5P,UAAUoS,UAAY,WAKvB,OAHoB,IAAhBrS,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,KAClClQ,KAAKiQ,SAAW,GAEXjQ,MAGT6P,EAAG5P,UAAUqS,QAAU,WACrB,OAAQtS,KAAKmQ,IAAM,UAAY,SAAWnQ,KAAKiM,SAAS,IAAM,KAiChE,IAAIsG,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAsjB9D,SAASC,EAAYC,EAAM/M,EAAK9C,GAC9BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnC,IAAI7E,EAAOuH,EAAKrR,OAASsE,EAAItE,OAAU,EACvCwB,EAAIxB,OAAS8J,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIwH,EAAoB,EAAhBD,EAAKzC,MAAM,GACf2C,EAAmB,EAAfjN,EAAIsK,MAAM,GACdS,EAAIiC,EAAIC,EAERC,EAAS,SAAJnC,EACLoC,EAASpC,EAAI,SAAa,EAC9B7N,EAAIoN,MAAM,GAAK4C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI5H,EAAK4H,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAK2H,EAAI1H,EAAK,EAIlB2H,IADAtC,GAFAiC,EAAoB,EAAhBD,EAAKzC,MAAM7E,KACfwH,EAAmB,EAAfjN,EAAIsK,MAAM5E,IACF4H,GACG,SAAa,EAC5BA,EAAY,SAAJvC,EAEV7N,EAAIoN,MAAM8C,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFjQ,EAAIoN,MAAM8C,GAAa,EAARD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAzlBb7B,EAAG5P,UAAUgM,SAAW,SAAmBzM,EAAM4T,GAI/C,IAAItQ,EACJ,GAHAsQ,EAAoB,EAAVA,GAAe,EAGZ,MAJb5T,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCsD,EAAM,GAGN,IAFA,IAAI2O,EAAM,EACNsB,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,EAAIxR,KAAKkQ,MAAM7E,GACf0G,GAA+B,UAArBP,GAAKC,EAAOsB,IAAmB9G,SAAS,IAGpDnJ,EADY,IADdiQ,EAASvB,IAAO,GAAKC,EAAQ,WACVpG,IAAMrL,KAAKsB,OAAS,EAC/BiR,EAAM,EAAIR,EAAKzQ,QAAUyQ,EAAOjP,EAEhCiP,EAAOjP,GAEf2O,GAAO,IACI,KACTA,GAAO,GACPpG,KAMJ,IAHc,IAAV0H,IACFjQ,EAAMiQ,EAAM9G,SAAS,IAAMnJ,GAEtBA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGT,GAAItD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI6T,EAAYb,EAAWhT,GAEvB8T,EAAYb,EAAWjT,GAC3BsD,EAAM,GACN,IAAI0N,EAAIxQ,KAAK2E,QAEb,IADA6L,EAAEP,SAAW,GACLO,EAAE+C,UAAU,CAClB,IAAI5C,EAAIH,EAAEgD,KAAKF,GAAWrH,SAASzM,GAMjCsD,GALF0N,EAAIA,EAAEiD,MAAMH,IAELC,SAGC5C,EAAI7N,EAFJyP,EAAMc,EAAY1C,EAAErP,QAAUqP,EAAI7N,EAQ5C,IAHI9C,KAAKuT,WACPzQ,EAAM,IAAMA,GAEPA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGTM,GAAO,EAAO,oCAGhByM,EAAG5P,UAAUyT,SAAW,WACtB,IAAIC,EAAM3T,KAAKkQ,MAAM,GASrB,OARoB,IAAhBlQ,KAAKsB,OACPqS,GAAuB,SAAhB3T,KAAKkQ,MAAM,GACO,IAAhBlQ,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,GAEzCyD,GAAO,iBAAoC,SAAhB3T,KAAKkQ,MAAM,GAC7BlQ,KAAKsB,OAAS,GACvB8B,GAAO,EAAO,8CAEU,IAAlBpD,KAAKiQ,UAAmB0D,EAAMA,GAGxC9D,EAAG5P,UAAU2T,OAAS,WACpB,OAAO5T,KAAKiM,SAAS,KAGvB4D,EAAG5P,UAAU4T,SAAW,SAAmB9D,EAAQzO,GAEjD,OADA8B,OAAyB,IAAXlC,GACPlB,KAAK8T,YAAY5S,EAAQ6O,EAAQzO,IAG1CuO,EAAG5P,UAAUiP,QAAU,SAAkBa,EAAQzO,GAC/C,OAAOtB,KAAK8T,YAAYpS,MAAOqO,EAAQzO,IAGzCuO,EAAG5P,UAAU6T,YAAc,SAAsBC,EAAWhE,EAAQzO,GAClE,IAAIS,EAAa/B,KAAK+B,aAClBiS,EAAY1S,GAAUwP,KAAKC,IAAI,EAAGhP,GACtCqB,EAAOrB,GAAciS,EAAW,yCAChC5Q,EAAO4Q,EAAY,EAAG,+BAEtBhU,KAAK0R,QACL,IAGImB,EAAGxH,EAHH4I,EAA0B,OAAXlE,EACfvN,EAAM,IAAIuR,EAAUC,GAGpBE,EAAIlU,KAAK2E,QACb,GAAKsP,EAYE,CACL,IAAK5I,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAI6I,GAAKwH,EAGX,KAAOxH,EAAI2I,EAAW3I,IACpB7I,EAAI6I,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI2I,EAAYjS,EAAYsJ,IACtC7I,EAAI6I,GAAK,EAGX,IAAKA,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAIwR,EAAY3I,EAAI,GAAKwH,EAe7B,OAAOrQ,GAGLsO,KAAKuD,MACPxE,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,OAAO,GAAKV,KAAKuD,MAAM7C,IAGzB3B,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,IAAI+C,EAAI/C,EACJb,EAAI,EAiBR,OAhBI4D,GAAK,OACP5D,GAAK,GACL4D,KAAO,IAELA,GAAK,KACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAEF5D,EAAI4D,GAIf1E,EAAG5P,UAAUuU,UAAY,SAAoBhD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAI+C,EAAI/C,EACJb,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ4D,KACH5D,GAAK,GACL4D,KAAO,IAEU,IAAV,IAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,GAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,IACH5D,IAEKA,GAITd,EAAG5P,UAAUwU,UAAY,WACvB,IAAIjD,EAAIxR,KAAKkQ,MAAMlQ,KAAKsB,OAAS,GAC7BoT,EAAK1U,KAAKsU,WAAW9C,GACzB,OAA2B,IAAnBxR,KAAKsB,OAAS,GAAUoT,GAiBlC7E,EAAG5P,UAAU0U,SAAW,WACtB,GAAI3U,KAAKuT,SAAU,OAAO,EAG1B,IADA,IAAI5C,EAAI,EACCtF,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAIwH,EAAI7S,KAAKwU,UAAUxU,KAAKkQ,MAAM7E,IAElC,GADAsF,GAAKkC,EACK,KAANA,EAAU,MAEhB,OAAOlC,GAGTd,EAAG5P,UAAU8B,WAAa,WACxB,OAAO+O,KAAKS,KAAKvR,KAAKyU,YAAc,IAGtC5E,EAAG5P,UAAU2U,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7U,KAAKiQ,SACAjQ,KAAK8U,MAAMC,MAAMF,GAAOG,MAAM,GAEhChV,KAAK2E,SAGdkL,EAAG5P,UAAUgV,SAAW,SAAmBJ,GACzC,OAAI7U,KAAKkV,MAAML,EAAQ,GACd7U,KAAKmV,KAAKN,GAAOG,MAAM,GAAGI,OAE5BpV,KAAK2E,SAGdkL,EAAG5P,UAAUoV,MAAQ,WACnB,OAAyB,IAAlBrV,KAAKiQ,UAIdJ,EAAG5P,UAAUqV,IAAM,WACjB,OAAOtV,KAAK2E,QAAQyQ,QAGtBvF,EAAG5P,UAAUmV,KAAO,WAKlB,OAJKpV,KAAKuT,WACRvT,KAAKiQ,UAAY,GAGZjQ,MAIT6P,EAAG5P,UAAUsV,KAAO,SAAe3P,GACjC,KAAO5F,KAAKsB,OAASsE,EAAItE,QACvBtB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAG9B,IAAK,IAAI+J,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAC9BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAG5C,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUuV,IAAM,SAAc5P,GAE/B,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAKuV,KAAK3P,IAInBiK,EAAG5P,UAAUwV,GAAK,SAAa7P,GAC7B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6Q,IAAI5P,GAC/CA,EAAIjB,QAAQ6Q,IAAIxV,OAGzB6P,EAAG5P,UAAUyV,IAAM,SAAc9P,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ4Q,KAAK3P,GAChDA,EAAIjB,QAAQ4Q,KAAKvV,OAI1B6P,EAAG5P,UAAU0V,MAAQ,SAAgB/P,GAEnC,IAAIiN,EAEFA,EADE7S,KAAKsB,OAASsE,EAAItE,OAChBsE,EAEA5F,KAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAK5C,OAFArL,KAAKsB,OAASuR,EAAEvR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU2V,KAAO,SAAehQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK2V,MAAM/P,IAIpBiK,EAAG5P,UAAU4V,IAAM,SAAcjQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQiR,KAAKhQ,GAChDA,EAAIjB,QAAQiR,KAAK5V,OAG1B6P,EAAG5P,UAAU6V,KAAO,SAAelQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQgR,MAAM/P,GACjDA,EAAIjB,QAAQgR,MAAM3V,OAI3B6P,EAAG5P,UAAU8V,MAAQ,SAAgBnQ,GAEnC,IAAIgN,EACAC,EACA7S,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAAKwH,EAAE3C,MAAM7E,GAGvC,GAAIrL,OAAS4S,EACX,KAAOvH,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAM5B,OAFArL,KAAKsB,OAASsR,EAAEtR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU+V,KAAO,SAAepQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK+V,MAAMnQ,IAIpBiK,EAAG5P,UAAUgW,IAAM,SAAcrQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQqR,KAAKpQ,GAChDA,EAAIjB,QAAQqR,KAAKhW,OAG1B6P,EAAG5P,UAAUiW,KAAO,SAAetQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQoR,MAAMnQ,GACjDA,EAAIjB,QAAQoR,MAAM/V,OAI3B6P,EAAG5P,UAAU8U,MAAQ,SAAgBF,GACnCzR,EAAwB,iBAAVyR,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBrF,KAAKS,KAAKsD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7U,KAAKoS,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAa9K,IAC/BrL,KAAKkQ,MAAM7E,GAAsB,UAAhBrL,KAAKkQ,MAAM7E,GAS9B,OALI+K,EAAW,IACbpW,KAAKkQ,MAAM7E,IAAMrL,KAAKkQ,MAAM7E,GAAM,UAAc,GAAK+K,GAIhDpW,KAAK0R,SAGd7B,EAAG5P,UAAUkV,KAAO,SAAeN,GACjC,OAAO7U,KAAK2E,QAAQoQ,MAAMF,IAI5BhF,EAAG5P,UAAUoW,KAAO,SAAeC,EAAK3Q,GACtCvC,EAAsB,iBAARkT,GAAoBA,GAAO,GAEzC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtW,KAAKoS,QAAQX,EAAM,GAGjBzR,KAAKkQ,MAAMuB,GADT9L,EACgB3F,KAAKkQ,MAAMuB,GAAQ,GAAK8E,EAExBvW,KAAKkQ,MAAMuB,KAAS,GAAK8E,GAGtCvW,KAAK0R,SAId7B,EAAG5P,UAAUuW,KAAO,SAAe5Q,GACjC,IAAI+K,EAkBAiC,EAAGC,EAfP,GAAsB,IAAlB7S,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAI7B,OAHAjQ,KAAKiQ,SAAW,EAChBU,EAAI3Q,KAAKyW,KAAK7Q,GACd5F,KAAKiQ,UAAY,EACVjQ,KAAKqS,YAGP,GAAsB,IAAlBrS,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAIpC,OAHArK,EAAIqK,SAAW,EACfU,EAAI3Q,KAAKyW,KAAK7Q,GACdA,EAAIqK,SAAW,EACRU,EAAE0B,YAKPrS,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,EAC1C/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAEhB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAClCsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,EACvB/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAIhB,GADA3Q,KAAKsB,OAASsR,EAAEtR,OACF,IAAVyR,EACF/S,KAAKkQ,MAAMlQ,KAAKsB,QAAUyR,EAC1B/S,KAAKsB,cAEA,GAAIsR,IAAM5S,KACf,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAI5B,OAAOrL,MAIT6P,EAAG5P,UAAUyW,IAAM,SAAc9Q,GAC/B,IAAIpD,EACJ,OAAqB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UAC7BrK,EAAIqK,SAAW,EACfzN,EAAMxC,KAAK2W,IAAI/Q,GACfA,EAAIqK,UAAY,EACTzN,GACmB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UACpCjQ,KAAKiQ,SAAW,EAChBzN,EAAMoD,EAAI+Q,IAAI3W,MACdA,KAAKiQ,SAAW,EACTzN,GAGLxC,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6R,KAAK5Q,GAEhDA,EAAIjB,QAAQ6R,KAAKxW,OAI1B6P,EAAG5P,UAAUwW,KAAO,SAAe7Q,GAEjC,GAAqB,IAAjBA,EAAIqK,SAAgB,CACtBrK,EAAIqK,SAAW,EACf,IAAIU,EAAI3Q,KAAKwW,KAAK5Q,GAElB,OADAA,EAAIqK,SAAW,EACRU,EAAE0B,YAGJ,GAAsB,IAAlBrS,KAAKiQ,SAId,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKwW,KAAK5Q,GACV5F,KAAKiQ,SAAW,EACTjQ,KAAKqS,YAId,IAWIO,EAAGC,EAXH3B,EAAMlR,KAAKkR,IAAItL,GAGnB,GAAY,IAARsL,EAIF,OAHAlR,KAAKiQ,SAAW,EAChBjQ,KAAKsB,OAAS,EACdtB,KAAKkQ,MAAM,GAAK,EACTlQ,KAKLkR,EAAM,GACR0B,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAE5B0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,IAC7B,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAElB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAElC0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,IACV,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAIlB,GAAc,IAAVoC,GAAe1H,EAAIuH,EAAEtR,QAAUsR,IAAM5S,KACvC,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAU5B,OANArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,GAEhCuH,IAAM5S,OACRA,KAAKiQ,SAAW,GAGXjQ,KAAK0R,SAId7B,EAAG5P,UAAU0W,IAAM,SAAc/Q,GAC/B,OAAO5F,KAAK2E,QAAQ8R,KAAK7Q,IA+C3B,IAAIgR,EAAc,SAAsBjE,EAAM/M,EAAK9C,GACjD,IAIIgQ,EACA+D,EACAnC,EANA9B,EAAID,EAAKzC,MACT2C,EAAIjN,EAAIsK,MACR4G,EAAIhU,EAAIoN,MACRM,EAAI,EAIJuG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnG,EAAE,GACPoG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtG,EAAE,GACPuG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzG,EAAE,GACP0G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5G,EAAE,GACP6G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP/G,EAAE,GACPgH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlH,EAAE,GACPmH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrH,EAAE,GACPsH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxH,EAAE,GACPyH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3H,EAAE,GACP4H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB1X,EAAImN,SAAW0C,EAAK1C,SAAWrK,EAAIqK,SACnCnN,EAAIxB,OAAS,GAMb,IAAIqZ,IAAQnK,GAJZsC,EAAKhC,KAAK8J,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM/F,KAAK8J,KAAK5D,EAAK+B,IACRjI,KAAK8J,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDtI,IAFAkE,EAAK5D,KAAK8J,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKhC,KAAK8J,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKzD,EAAK4B,IACRjI,KAAK8J,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQrK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKkC,GAAQ,GACvBpI,KAAK8J,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDzI,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKhC,KAAK8J,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKtD,EAAKyB,IACRjI,KAAK8J,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKrD,EAAKwB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK+B,GAAQ,GACvBpI,KAAK8J,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQtK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKqC,GAAQ,GACvBvI,KAAK8J,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD5I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKhC,KAAK8J,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKnD,EAAKsB,IACRjI,KAAK8J,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKlD,EAAKqB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK4B,GAAQ,GACvBpI,KAAK8J,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKkC,GAAQ,GACvBvI,KAAK8J,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQvK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKwC,GAAQ,GACvB1I,KAAK8J,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD/I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKhC,KAAK8J,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKhD,EAAKmB,IACRjI,KAAK8J,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK/C,EAAKkB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKyB,GAAQ,GACvBpI,KAAK8J,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK+B,GAAQ,GACvBvI,KAAK8J,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKqC,GAAQ,GACvB1I,KAAK8J,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQxK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK2C,IAAQ,GACvB7I,KAAK8J,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDlJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKhC,KAAK8J,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK7C,EAAKgB,IACRjI,KAAK8J,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK5C,EAAKe,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKsB,GAAQ,GACvBpI,KAAK8J,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK4B,GAAQ,GACvBvI,KAAK8J,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKkC,GAAQ,GACvB1I,KAAK8J,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKiC,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKwC,IAAQ,GACvB7I,KAAK8J,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQzK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK8C,IAAQ,GACvBhJ,KAAK8J,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDrJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKhC,KAAK8J,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK1C,EAAKa,IACRjI,KAAK8J,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKzC,EAAKY,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKmB,GAAQ,GACvBpI,KAAK8J,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKyB,GAAQ,GACvBvI,KAAK8J,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK+B,GAAQ,GACvB1I,KAAK8J,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK8B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKqC,IAAQ,GACvB7I,KAAK8J,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK2C,IAAQ,GACvBhJ,KAAK8J,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ1K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKiD,IAAQ,GACvBnJ,KAAK8J,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDxJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKhC,KAAK8J,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKvC,EAAKU,IACRjI,KAAK8J,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKtC,EAAKS,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKgB,GAAQ,GACvBpI,KAAK8J,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKsB,GAAQ,GACvBvI,KAAK8J,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK4B,GAAQ,GACvB1I,KAAK8J,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK2B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKkC,IAAQ,GACvB7I,KAAK8J,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKwC,IAAQ,GACvBhJ,KAAK8J,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK8C,IAAQ,GACvBnJ,KAAK8J,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ3K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKoD,IAAQ,GACvBtJ,KAAK8J,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD3J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKhC,KAAK8J,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKpC,EAAKO,IACRjI,KAAK8J,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKnC,EAAKM,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKa,GAAQ,GACvBpI,KAAK8J,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKmB,GAAQ,GACvBvI,KAAK8J,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKyB,GAAQ,GACvB1I,KAAK8J,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKwB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK+B,IAAQ,GACvB7I,KAAK8J,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKqC,IAAQ,GACvBhJ,KAAK8J,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKoC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK2C,IAAQ,GACvBnJ,KAAK8J,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKiD,IAAQ,GACvBtJ,KAAK8J,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ5K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKuD,IAAQ,GACvBzJ,KAAK8J,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD9J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKhC,KAAK8J,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKI,IACRjI,KAAK8J,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKhC,EAAKG,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKU,GAAQ,GACvBpI,KAAK8J,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKS,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKgB,GAAQ,GACvBvI,KAAK8J,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKsB,GAAQ,GACvB1I,KAAK8J,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKqB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK4B,IAAQ,GACvB7I,KAAK8J,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKkC,IAAQ,GACvBhJ,KAAK8J,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKwC,IAAQ,GACvBnJ,KAAK8J,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK8C,IAAQ,GACvBtJ,KAAK8J,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK6C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKoD,IAAQ,GACvBzJ,KAAK8J,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQ7K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK0D,IAAQ,GACvB5J,KAAK8J,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKhC,KAAK8J,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKO,IACRpI,KAAK8J,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK5D,KAAK8J,KAAKhC,EAAKM,GACpBpG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKa,GAAQ,GACvBvI,KAAK8J,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKY,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKmB,GAAQ,GACvB1I,KAAK8J,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKkB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKyB,IAAQ,GACvB7I,KAAK8J,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK+B,IAAQ,GACvBhJ,KAAK8J,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK8B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKqC,IAAQ,GACvBnJ,KAAK8J,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK2C,IAAQ,GACvBtJ,KAAK8J,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK0C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKiD,IAAQ,GACvBzJ,KAAK8J,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS9K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKuD,IAAQ,GACvB5J,KAAK8J,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKhC,KAAK8J,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKU,IACRvI,KAAK8J,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK5D,KAAK8J,KAAKhC,EAAKS,GACpBvG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKgB,GAAQ,GACvB1I,KAAK8J,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKe,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKsB,IAAQ,GACvB7I,KAAK8J,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK4B,IAAQ,GACvBhJ,KAAK8J,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKkC,IAAQ,GACvBnJ,KAAK8J,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKwC,IAAQ,GACvBtJ,KAAK8J,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKuC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK8C,IAAQ,GACvBzJ,KAAK8J,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS/K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKoD,IAAQ,GACvB5J,KAAK8J,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKhC,KAAK8J,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKa,IACR1I,KAAK8J,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK5D,KAAK8J,KAAKhC,EAAKY,GACpB1G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKmB,IAAQ,GACvB7I,KAAK8J,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKkB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKyB,IAAQ,GACvBhJ,KAAK8J,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK+B,IAAQ,GACvBnJ,KAAK8J,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKqC,IAAQ,GACvBtJ,KAAK8J,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKoC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK2C,IAAQ,GACvBzJ,KAAK8J,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAShL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKiD,IAAQ,GACvB5J,KAAK8J,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKhC,KAAK8J,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKgB,KACR7I,KAAK8J,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK5D,KAAK8J,KAAKhC,EAAKe,IACpB7G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKsB,IAAQ,GACvBhJ,KAAK8J,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKqB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK4B,IAAQ,GACvBnJ,KAAK8J,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKkC,IAAQ,GACvBtJ,KAAK8J,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKiC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKwC,IAAQ,GACvBzJ,KAAK8J,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASjL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK8C,IAAQ,GACvB5J,KAAK8J,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKhC,KAAK8J,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKmB,KACRhJ,KAAK8J,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK5D,KAAK8J,KAAKhC,EAAKkB,IACpBhH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKyB,IAAQ,GACvBnJ,KAAK8J,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKwB,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK+B,IAAQ,GACvBtJ,KAAK8J,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK8B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKqC,IAAQ,GACvBzJ,KAAK8J,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASlL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK2C,IAAQ,GACvB5J,KAAK8J,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKhC,KAAK8J,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKsB,KACRnJ,KAAK8J,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK5D,KAAK8J,KAAKhC,EAAKqB,IACpBnH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK4B,IAAQ,GACvBtJ,KAAK8J,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK2B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKkC,IAAQ,GACvBzJ,KAAK8J,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASnL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKwC,IAAQ,GACvB5J,KAAK8J,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKhC,KAAK8J,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKyB,KACRtJ,KAAK8J,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK5D,KAAK8J,KAAKhC,EAAKwB,IACpBtH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK+B,IAAQ,GACvBzJ,KAAK8J,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASpL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKqC,IAAQ,GACvB5J,KAAK8J,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKhC,KAAK8J,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK4B,KACRzJ,KAAK8J,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK5D,KAAK8J,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASrL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKkC,IAAQ,GACvB5J,KAAK8J,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAStL,GAJbsC,EAAKhC,KAAK8J,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK+B,KACR5J,KAAK8J,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAjK,IAFAkE,EAAK5D,KAAK8J,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANtL,IACFsG,EAAE,IAAMtG,EACR1N,EAAIxB,UAECwB,GAiDT,SAASiZ,EAAYpJ,EAAM/M,EAAK9C,GAE9B,OADW,IAAIkZ,GACHC,KAAKtJ,EAAM/M,EAAK9C,GAsB9B,SAASkZ,EAAME,EAAGC,GAChBnc,KAAKkc,EAAIA,EACTlc,KAAKmc,EAAIA,EAvENrL,KAAK8J,OACRhE,EAAclE,GAiDhB7C,EAAG5P,UAAUmc,MAAQ,SAAgBxW,EAAK9C,GACxC,IAAIN,EACA4I,EAAMpL,KAAKsB,OAASsE,EAAItE,OAW5B,OATEkB,EADkB,KAAhBxC,KAAKsB,QAAgC,KAAfsE,EAAItE,OACtBsV,EAAY5W,KAAM4F,EAAK9C,GACpBsI,EAAM,GACTsH,EAAW1S,KAAM4F,EAAK9C,GACnBsI,EAAM,KArDnB,SAAmBuH,EAAM/M,EAAK9C,GAC5BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnCnN,EAAIxB,OAASqR,EAAKrR,OAASsE,EAAItE,OAI/B,IAFA,IAAIyR,EAAQ,EACRsJ,EAAU,EACLrJ,EAAI,EAAGA,EAAIlQ,EAAIxB,OAAS,EAAG0R,IAAK,CAGvC,IAAIC,EAASoJ,EACbA,EAAU,EAGV,IAFA,IAAInJ,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAI2H,EAAI1H,EAGRqF,GAFoB,EAAhBgC,EAAKzC,MAAM7E,KACI,EAAfzF,EAAIsK,MAAM5E,IAGdwH,EAAS,SAAJnC,EAGTuC,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBmJ,IAFApJ,GAHAA,EAAUA,GAAWtC,EAAI,SAAa,GAAM,IAGxBmC,IAAO,IAAO,KAEZ,GACtBG,GAAU,SAEZnQ,EAAIoN,MAAM8C,GAAKE,EACfH,EAAQE,EACRA,EAASoJ,EAQX,OANc,IAAVtJ,EACFjQ,EAAIoN,MAAM8C,GAAKD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAgBH4K,CAAStc,KAAM4F,EAAK9C,GAEpBiZ,EAAW/b,KAAM4F,EAAK9C,GAGvBN,GAWTwZ,EAAK/b,UAAUsc,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAI7S,MAAM8a,GACdC,EAAI5M,EAAG5P,UAAUqU,WAAWkI,GAAK,EAC5BnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBkJ,EAAElJ,GAAKrL,KAAK0c,OAAOrR,EAAGoR,EAAGD,GAG3B,OAAOjI,GAITyH,EAAK/b,UAAUyc,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAtR,EAAI,EAAGA,EAAIoR,EAAGpR,IACrBsR,IAAW,EAAJT,IAAWO,EAAIpR,EAAI,EAC1B6Q,IAAM,EAGR,OAAOS,GAKTX,EAAK/b,UAAU2c,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAGnR,IACrB2R,EAAK3R,GAAKyR,EAAID,EAAIxR,IAClB4R,EAAK5R,GAAK0R,EAAIF,EAAIxR,KAItB2Q,EAAK/b,UAAUid,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE7c,KAAK4c,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQtM,KAAKuM,IAAI,EAAIvM,KAAKwM,GAAKb,GAC/Bc,EAAQzM,KAAK0M,IAAI,EAAI1M,KAAKwM,GAAKb,GAE1BjN,EAAI,EAAGA,EAAIgN,EAAGhN,GAAKiN,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJjS,EAAI,EAAGA,EAAI6R,EAAG7R,IAAK,CAC1B,IAAImC,EAAKuP,EAAKxN,EAAIlE,GACdqS,EAAKV,EAAKzN,EAAIlE,GAEdsS,EAAKZ,EAAKxN,EAAIlE,EAAI6R,GAClBU,EAAKZ,EAAKzN,EAAIlE,EAAI6R,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAKxN,EAAIlE,GAAKmC,EAAKmQ,EACnBX,EAAKzN,EAAIlE,GAAKqS,EAAKE,EAEnBb,EAAKxN,EAAIlE,EAAI6R,GAAK1P,EAAKmQ,EACvBX,EAAKzN,EAAIlE,EAAI6R,GAAKQ,EAAKE,EAGnBvS,IAAMmR,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB9B,EAAK/b,UAAU8d,YAAc,SAAsBC,EAAGjf,GACpD,IAAIyd,EAAqB,EAAjB1L,KAAKC,IAAIhS,EAAGif,GAChBC,EAAU,EAAJzB,EACNnR,EAAI,EACR,IAAKmR,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BnR,IAGF,OAAO,GAAKA,EAAI,EAAI4S,GAGtBjC,EAAK/b,UAAUie,UAAY,SAAoBpB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAIkJ,EAAIuI,EAAIzR,GAEZyR,EAAIzR,GAAKyR,EAAIN,EAAInR,EAAI,GACrByR,EAAIN,EAAInR,EAAI,GAAKkJ,EAEjBA,EAAIwI,EAAI1R,GAER0R,EAAI1R,IAAM0R,EAAIP,EAAInR,EAAI,GACtB0R,EAAIP,EAAInR,EAAI,IAAMkJ,IAItByH,EAAK/b,UAAUke,aAAe,SAAuBC,EAAI5B,GAEvD,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAImG,EAAoC,KAAhCV,KAAKuN,MAAMD,EAAG,EAAI/S,EAAI,GAAKmR,GACjC1L,KAAKuN,MAAMD,EAAG,EAAI/S,GAAKmR,GACvBzJ,EAEFqL,EAAG/S,GAAS,SAAJmG,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO4M,GAGTpC,EAAK/b,UAAUqe,WAAa,SAAqBF,EAAIhT,EAAK0R,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAID,EAAKC,IACvB0H,GAAyB,EAARqL,EAAG/S,GAEpByR,EAAI,EAAIzR,GAAa,KAAR0H,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAIzR,EAAI,GAAa,KAAR0H,EAAgBA,KAAkB,GAIrD,IAAK1H,EAAI,EAAID,EAAKC,EAAImR,IAAKnR,EACzByR,EAAIzR,GAAK,EAGXjI,EAAiB,IAAV2P,GACP3P,EAA6B,KAAb,KAAR2P,KAGViJ,EAAK/b,UAAUse,KAAO,SAAe/B,GAEnC,IADA,IAAIgC,EAAK,IAAI9c,MAAM8a,GACVnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBmT,EAAGnT,GAAK,EAGV,OAAOmT,GAGTxC,EAAK/b,UAAUgc,KAAO,SAAeC,EAAGC,EAAGrZ,GACzC,IAAI0Z,EAAI,EAAIxc,KAAK+d,YAAY7B,EAAE5a,OAAQ6a,EAAE7a,QAErCub,EAAM7c,KAAKuc,QAAQC,GAEnBiC,EAAIze,KAAKue,KAAK/B,GAEdM,EAAM,IAAIpb,MAAM8a,GAChBkC,EAAO,IAAIhd,MAAM8a,GACjBmC,EAAO,IAAIjd,MAAM8a,GAEjBoC,EAAO,IAAIld,MAAM8a,GACjBqC,EAAQ,IAAInd,MAAM8a,GAClBsC,EAAQ,IAAIpd,MAAM8a,GAElBuC,EAAOjc,EAAIoN,MACf6O,EAAKzd,OAASkb,EAEdxc,KAAKse,WAAWpC,EAAEhM,MAAOgM,EAAE5a,OAAQwb,EAAKN,GACxCxc,KAAKse,WAAWnC,EAAEjM,MAAOiM,EAAE7a,OAAQsd,EAAMpC,GAEzCxc,KAAKkd,UAAUJ,EAAK2B,EAAGC,EAAMC,EAAMnC,EAAGK,GACtC7c,KAAKkd,UAAU0B,EAAMH,EAAGI,EAAOC,EAAOtC,EAAGK,GAEzC,IAAK,IAAIxR,EAAI,EAAGA,EAAImR,EAAGnR,IAAK,CAC1B,IAAIyS,EAAKY,EAAKrT,GAAKwT,EAAMxT,GAAKsT,EAAKtT,GAAKyT,EAAMzT,GAC9CsT,EAAKtT,GAAKqT,EAAKrT,GAAKyT,EAAMzT,GAAKsT,EAAKtT,GAAKwT,EAAMxT,GAC/CqT,EAAKrT,GAAKyS,EAUZ,OAPA9d,KAAKke,UAAUQ,EAAMC,EAAMnC,GAC3Bxc,KAAKkd,UAAUwB,EAAMC,EAAMI,EAAMN,EAAGjC,EAAGK,GACvC7c,KAAKke,UAAUa,EAAMN,EAAGjC,GACxBxc,KAAKme,aAAaY,EAAMvC,GAExB1Z,EAAImN,SAAWiM,EAAEjM,SAAWkM,EAAElM,SAC9BnN,EAAIxB,OAAS4a,EAAE5a,OAAS6a,EAAE7a,OACnBwB,EAAI4O,SAIb7B,EAAG5P,UAAU4Q,IAAM,SAAcjL,GAC/B,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCtB,KAAKoc,MAAMxW,EAAK9C,IAIzB+M,EAAG5P,UAAU+e,KAAO,SAAepZ,GACjC,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCya,EAAW/b,KAAM4F,EAAK9C,IAI/B+M,EAAG5P,UAAU2a,KAAO,SAAehV,GACjC,OAAO5F,KAAK2E,QAAQyX,MAAMxW,EAAK5F,OAGjC6P,EAAG5P,UAAU+R,MAAQ,SAAgBpM,GACnCxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UAIb,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAUzF,EAC1BkN,GAAU,SAAJtB,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASD,IAAO,GAChB9S,KAAKkQ,MAAM7E,GAAU,SAALyH,EAQlB,OALc,IAAVC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAGAtB,MAGT6P,EAAG5P,UAAUgf,KAAO,SAAerZ,GACjC,OAAO5F,KAAK2E,QAAQqN,MAAMpM,IAI5BiK,EAAG5P,UAAUif,IAAM,WACjB,OAAOlf,KAAK6Q,IAAI7Q,OAIlB6P,EAAG5P,UAAUkf,KAAO,WAClB,OAAOnf,KAAK4a,KAAK5a,KAAK2E,UAIxBkL,EAAG5P,UAAUiS,IAAM,SAActM,GAC/B,IAAI4L,EAxxCN,SAAqB5L,GAGnB,IAFA,IAAI4L,EAAI,IAAI9P,MAAMkE,EAAI6O,aAEb6B,EAAM,EAAGA,EAAM9E,EAAElQ,OAAQgV,IAAO,CACvC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB9E,EAAE8E,IAAQ1Q,EAAIsK,MAAMuB,GAAQ,GAAK8E,KAAWA,EAG9C,OAAO/E,EA8wCC4N,CAAWxZ,GACnB,GAAiB,IAAb4L,EAAElQ,OAAc,OAAO,IAAIuO,EAAG,GAIlC,IADA,IAAIrN,EAAMxC,KACDqL,EAAI,EAAGA,EAAImG,EAAElQ,QACP,IAATkQ,EAAEnG,GADsBA,IAAK7I,EAAMA,EAAI0c,OAI7C,KAAM7T,EAAImG,EAAElQ,OACV,IAAK,IAAI4S,EAAI1R,EAAI0c,MAAO7T,EAAImG,EAAElQ,OAAQ+J,IAAK6I,EAAIA,EAAEgL,MAClC,IAAT1N,EAAEnG,KAEN7I,EAAMA,EAAIqO,IAAIqD,IAIlB,OAAO1R,GAITqN,EAAG5P,UAAUof,OAAS,SAAiBC,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAGIjU,EAHAsF,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GACjB4O,EAAa,WAAe,GAAK5O,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoC,EAAQ,EAEZ,IAAK1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAChC,IAAImU,EAAWxf,KAAKkQ,MAAM7E,GAAKkU,EAC3B/O,GAAsB,EAAhBxQ,KAAKkQ,MAAM7E,IAAUmU,GAAa7O,EAC5C3Q,KAAKkQ,MAAM7E,GAAKmF,EAAIuC,EACpBA,EAAQyM,IAAc,GAAK7O,EAGzBoC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAIT,GAAU,IAAN6b,EAAS,CACX,IAAK9R,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAChCrL,KAAKkQ,MAAM7E,EAAI8R,GAAKnd,KAAKkQ,MAAM7E,GAGjC,IAAKA,EAAI,EAAGA,EAAI8R,EAAG9R,IACjBrL,KAAKkQ,MAAM7E,GAAK,EAGlBrL,KAAKsB,QAAU6b,EAGjB,OAAOnd,KAAK0R,SAGd7B,EAAG5P,UAAUwf,MAAQ,SAAgBH,GAGnC,OADAlc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKqf,OAAOC,IAMrBzP,EAAG5P,UAAUmU,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJxc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/O,EAAI2O,EAAO,GACXnC,EAAIrM,KAAK/D,KAAKuS,EAAO3O,GAAK,GAAI3Q,KAAKsB,QACnCue,EAAO,SAAc,WAAclP,GAAMA,EACzCmP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAI9O,KAAKC,IAAI,EAAG6O,GAGZE,EAAa,CACf,IAAK,IAAIzU,EAAI,EAAGA,EAAI8R,EAAG9R,IACrByU,EAAY5P,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAEpCyU,EAAYxe,OAAS6b,EAGvB,GAAU,IAANA,QAEG,GAAInd,KAAKsB,OAAS6b,EAEvB,IADAnd,KAAKsB,QAAU6b,EACV9R,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC3BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,EAAI8R,QAGjCnd,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,EAGhB,IAAIyR,EAAQ,EACZ,IAAK1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,IAAgB,IAAV0H,GAAe1H,GAAKuU,GAAIvU,IAAK,CAChE,IAAI0G,EAAuB,EAAhB/R,KAAKkQ,MAAM7E,GACtBrL,KAAKkQ,MAAM7E,GAAM0H,GAAU,GAAKpC,EAAOoB,IAASpB,EAChDoC,EAAQhB,EAAO8N,EAajB,OATIC,GAAyB,IAAV/M,IACjB+M,EAAY5P,MAAM4P,EAAYxe,UAAYyR,GAGxB,IAAhB/S,KAAKsB,SACPtB,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,GAGTtB,KAAK0R,SAGd7B,EAAG5P,UAAU8f,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAvc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKoU,OAAOkL,EAAMI,EAAMC,IAIjC9P,EAAG5P,UAAU+f,KAAO,SAAeV,GACjC,OAAOtf,KAAK2E,QAAQ8a,MAAMH,IAG5BzP,EAAG5P,UAAUggB,MAAQ,SAAgBX,GACnC,OAAOtf,KAAK2E,QAAQ0a,OAAOC,IAI7BzP,EAAG5P,UAAUigB,KAAO,SAAeZ,GACjC,OAAOtf,KAAK2E,QAAQob,MAAMT,IAG5BzP,EAAG5P,UAAUkgB,MAAQ,SAAgBb,GACnC,OAAOtf,KAAK2E,QAAQyP,OAAOkL,IAI7BzP,EAAG5P,UAAUiV,MAAQ,SAAgBoB,GACnClT,EAAsB,iBAARkT,GAAoBA,GAAO,GACzC,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,QAAI3Q,KAAKsB,QAAU6b,KAGXnd,KAAKkQ,MAAMiN,GAELjJ,KAIhBrE,EAAG5P,UAAUmgB,OAAS,SAAiBd,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAAI3O,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GAIrB,GAFAvN,EAAyB,IAAlBpD,KAAKiQ,SAAgB,2CAExBjQ,KAAKsB,QAAU6b,EACjB,OAAOnd,KAQT,GALU,IAAN2Q,GACFwM,IAEFnd,KAAKsB,OAASwP,KAAK/D,IAAIoQ,EAAGnd,KAAKsB,QAErB,IAANqP,EAAS,CACX,IAAIkP,EAAO,SAAc,WAAclP,GAAMA,EAC7C3Q,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IAAMue,EAGjC,OAAO7f,KAAK0R,SAId7B,EAAG5P,UAAUogB,MAAQ,SAAgBf,GACnC,OAAOtf,KAAK2E,QAAQyb,OAAOd,IAI7BzP,EAAG5P,UAAU+U,MAAQ,SAAgBpP,GAGnC,OAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAU5F,KAAKsgB,OAAO1a,GAGV,IAAlB5F,KAAKiQ,SACa,IAAhBjQ,KAAKsB,SAAiC,EAAhBtB,KAAKkQ,MAAM,IAAUtK,GAC7C5F,KAAKkQ,MAAM,GAAKtK,GAAuB,EAAhB5F,KAAKkQ,MAAM,IAClClQ,KAAKiQ,SAAW,EACTjQ,OAGTA,KAAKiQ,SAAW,EAChBjQ,KAAKsgB,MAAM1a,GACX5F,KAAKiQ,SAAW,EACTjQ,MAIFA,KAAKiS,OAAOrM,IAGrBiK,EAAG5P,UAAUgS,OAAS,SAAiBrM,GACrC5F,KAAKkQ,MAAM,IAAMtK,EAGjB,IAAK,IAAIyF,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,IAAM,SAAWA,IAC7DrL,KAAKkQ,MAAM7E,IAAM,SACbA,IAAMrL,KAAKsB,OAAS,EACtBtB,KAAKkQ,MAAM7E,EAAI,GAAK,EAEpBrL,KAAKkQ,MAAM7E,EAAI,KAKnB,OAFArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,EAAI,GAEjCrL,MAIT6P,EAAG5P,UAAUqgB,MAAQ,SAAgB1a,GAGnC,GAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAG,OAAO5F,KAAKgV,OAAOpP,GAEhC,GAAsB,IAAlB5F,KAAKiQ,SAIP,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKgV,MAAMpP,GACX5F,KAAKiQ,SAAW,EACTjQ,KAKT,GAFAA,KAAKkQ,MAAM,IAAMtK,EAEG,IAAhB5F,KAAKsB,QAAgBtB,KAAKkQ,MAAM,GAAK,EACvClQ,KAAKkQ,MAAM,IAAMlQ,KAAKkQ,MAAM,GAC5BlQ,KAAKiQ,SAAW,OAGhB,IAAK,IAAI5E,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,GAAK,EAAGA,IACpDrL,KAAKkQ,MAAM7E,IAAM,SACjBrL,KAAKkQ,MAAM7E,EAAI,IAAM,EAIzB,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUsgB,KAAO,SAAe3a,GACjC,OAAO5F,KAAK2E,QAAQqQ,MAAMpP,IAG5BiK,EAAG5P,UAAUugB,KAAO,SAAe5a,GACjC,OAAO5F,KAAK2E,QAAQ2b,MAAM1a,IAG5BiK,EAAG5P,UAAUwgB,KAAO,WAGlB,OAFAzgB,KAAKiQ,SAAW,EAETjQ,MAGT6P,EAAG5P,UAAU6U,IAAM,WACjB,OAAO9U,KAAK2E,QAAQ8b,QAGtB5Q,EAAG5P,UAAUygB,aAAe,SAAuB9a,EAAKiL,EAAK8P,GAC3D,IACItV,EAIAmG,EALApG,EAAMxF,EAAItE,OAASqf,EAGvB3gB,KAAKoS,QAAQhH,GAGb,IAAI2H,EAAQ,EACZ,IAAK1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CAC/BmG,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,EAClC,IAAI9B,GAAwB,EAAfrL,EAAIsK,MAAM7E,IAAUwF,EAEjCkC,IADAvB,GAAa,SAARP,IACS,KAAQA,EAAQ,SAAa,GAC3CjR,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAE1B,KAAOnG,EAAIrL,KAAKsB,OAASqf,EAAOtV,IAE9B0H,GADAvB,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,IACrB,GACb/S,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAG1B,GAAc,IAAVuB,EAAa,OAAO/S,KAAK0R,QAK7B,IAFAtO,GAAkB,IAAX2P,GACPA,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAE3B0H,GADAvB,IAAsB,EAAhBxR,KAAKkQ,MAAM7E,IAAU0H,IACd,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJmG,EAIlB,OAFAxR,KAAKiQ,SAAW,EAETjQ,KAAK0R,SAGd7B,EAAG5P,UAAU2gB,SAAW,SAAmBhb,EAAKib,GAC9C,IAAIF,GAAQ3gB,KAAKsB,OAASsE,EAAItE,QAE1BsR,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAGJkb,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,GAGf,IADdqf,EAAQ,GADM3gB,KAAKsU,WAAWwM,MAG5BjO,EAAIA,EAAEoN,MAAMU,GACZ/N,EAAEyM,OAAOsB,GACTG,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,IAI3B,IACI4S,EADAnV,EAAI6T,EAAEtR,OAASuR,EAAEvR,OAGrB,GAAa,QAATuf,EAAgB,EAClB3M,EAAI,IAAIrE,EAAG,OACTvO,OAASvC,EAAI,EACfmV,EAAEhE,MAAQ,IAAIxO,MAAMwS,EAAE5S,QACtB,IAAK,IAAI+J,EAAI,EAAGA,EAAI6I,EAAE5S,OAAQ+J,IAC5B6I,EAAEhE,MAAM7E,GAAK,EAIjB,IAAI0V,EAAOnO,EAAEjO,QAAQ+b,aAAa7N,EAAG,EAAG9T,GAClB,IAAlBgiB,EAAK9Q,WACP2C,EAAImO,EACA7M,IACFA,EAAEhE,MAAMnR,GAAK,IAIjB,IAAK,IAAIuM,EAAIvM,EAAI,EAAGuM,GAAK,EAAGA,IAAK,CAC/B,IAAI0V,EAAmC,UAAL,EAAxBpO,EAAE1C,MAAM2C,EAAEvR,OAASgK,KACE,EAA5BsH,EAAE1C,MAAM2C,EAAEvR,OAASgK,EAAI,IAO1B,IAHA0V,EAAKlQ,KAAK/D,IAAKiU,EAAKF,EAAO,EAAG,UAE9BlO,EAAE8N,aAAa7N,EAAGmO,EAAI1V,GACA,IAAfsH,EAAE3C,UACP+Q,IACApO,EAAE3C,SAAW,EACb2C,EAAE8N,aAAa7N,EAAG,EAAGvH,GAChBsH,EAAEW,WACLX,EAAE3C,UAAY,GAGdiE,IACFA,EAAEhE,MAAM5E,GAAK0V,GAajB,OAVI9M,GACFA,EAAExC,QAEJkB,EAAElB,QAGW,QAATmP,GAA4B,IAAVF,GACpB/N,EAAEwB,OAAOuM,GAGJ,CACLM,IAAK/M,GAAK,KACVpC,IAAKc,IAQT/C,EAAG5P,UAAUihB,OAAS,SAAiBtb,EAAKib,EAAMM,GAGhD,OAFA/d,GAAQwC,EAAI2N,UAERvT,KAAKuT,SACA,CACL0N,IAAK,IAAIpR,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB7P,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAKib,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGH,QAATuL,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI0E,KAAK5Q,IAIN,CACLqb,IAAKA,EACLnP,IAAKA,IAIa,IAAlB9R,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKkhB,OAAOtb,EAAI0P,MAAOuL,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGT,CACL2L,IAAKA,EACLnP,IAAKtP,EAAIsP,MAI0B,IAAlC9R,KAAKiQ,SAAWrK,EAAIqK,WACvBzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAI0P,MAAOuL,GAEtB,QAATA,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI2E,KAAK7Q,IAIN,CACLqb,IAAKze,EAAIye,IACTnP,IAAKA,IAOLlM,EAAItE,OAAStB,KAAKsB,QAAUtB,KAAKkR,IAAItL,GAAO,EACvC,CACLqb,IAAK,IAAIpR,EAAG,GACZiC,IAAK9R,MAKU,IAAf4F,EAAItE,OACO,QAATuf,EACK,CACLI,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,MAII,QAAT+O,EACK,CACLI,IAAK,KACLnP,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7B,CACL+Q,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7BlQ,KAAK4gB,SAAShb,EAAKib,GAlF1B,IAAII,EAAKnP,EAAKtP,GAsFhBqN,EAAG5P,UAAUghB,IAAM,SAAcrb,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOqb,KAIxCpR,EAAG5P,UAAU6R,IAAM,SAAclM,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOkM,KAGxCjC,EAAG5P,UAAUohB,KAAO,SAAezb,GACjC,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAMkM,KAIvCjC,EAAG5P,UAAUqhB,SAAW,SAAmB1b,GACzC,IAAI2b,EAAKvhB,KAAKkhB,OAAOtb,GAGrB,GAAI2b,EAAGzP,IAAIyB,SAAU,OAAOgO,EAAGN,IAE/B,IAAInP,EAA0B,IAApByP,EAAGN,IAAIhR,SAAiBsR,EAAGzP,IAAI2E,KAAK7Q,GAAO2b,EAAGzP,IAEpD0P,EAAO5b,EAAIua,MAAM,GACjBsB,EAAK7b,EAAIuO,MAAM,GACfjD,EAAMY,EAAIZ,IAAIsQ,GAGlB,OAAItQ,EAAM,GAAY,IAAPuQ,GAAoB,IAARvQ,EAAkBqQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAG5P,UAAUuT,KAAO,SAAe5N,GACjCxC,EAAOwC,GAAO,UAId,IAHA,IAAI4J,GAAK,GAAK,IAAM5J,EAEhB8b,EAAM,EACDrW,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IACpCqW,GAAOlS,EAAIkS,GAAuB,EAAhB1hB,KAAKkQ,MAAM7E,KAAWzF,EAG1C,OAAO8b,GAIT7R,EAAG5P,UAAUwT,MAAQ,SAAgB7N,GACnCxC,EAAOwC,GAAO,UAGd,IADA,IAAImN,EAAQ,EACH1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAkB,SAAR0H,EAC9B/S,KAAKkQ,MAAM7E,GAAMmG,EAAI5L,EAAO,EAC5BmN,EAAQvB,EAAI5L,EAGd,OAAO5F,KAAK0R,SAGd7B,EAAG5P,UAAUmhB,KAAO,SAAexb,GACjC,OAAO5F,KAAK2E,QAAQ8O,MAAM7N,IAG5BiK,EAAG5P,UAAU0hB,KAAO,SAAenS,GACjCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAI2I,EAAIlc,KACJmc,EAAI3M,EAAE7K,QAGRuX,EADiB,IAAfA,EAAEjM,SACAiM,EAAEmF,KAAK7R,GAEP0M,EAAEvX,QAaR,IATA,IAAIid,EAAI,IAAI/R,EAAG,GACXgS,EAAI,IAAIhS,EAAG,GAGXiS,EAAI,IAAIjS,EAAG,GACXkS,EAAI,IAAIlS,EAAG,GAEXmS,EAAI,EAED9F,EAAE+F,UAAY9F,EAAE8F,UACrB/F,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP4N,EAMJ,IAHA,IAAIE,EAAK/F,EAAExX,QACPwd,EAAKjG,EAAEvX,SAEHuX,EAAE3I,UAAU,CAClB,IAAK,IAAIlI,EAAI,EAAG+W,EAAK,EAAyB,IAArBlG,EAAEhM,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADA6Q,EAAE9H,OAAO/I,GACFA,KAAM,IACPuW,EAAES,SAAWR,EAAEQ,WACjBT,EAAEpL,KAAK0L,GACPL,EAAEpL,KAAK0L,IAGTP,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIb,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBnG,EAAEjM,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADA6Q,EAAE/H,OAAO9I,GACFA,KAAM,IACPwW,EAAEO,SAAWN,EAAEM,WACjBP,EAAEtL,KAAK0L,GACPH,EAAEtL,KAAK0L,IAGTL,EAAE1N,OAAO,GACT2N,EAAE3N,OAAO,GAIT8H,EAAEhL,IAAIiL,IAAM,GACdD,EAAEzF,KAAK0F,GACPyF,EAAEnL,KAAKqL,GACPD,EAAEpL,KAAKsL,KAEP5F,EAAE1F,KAAKyF,GACP4F,EAAErL,KAAKmL,GACPG,EAAEtL,KAAKoL,IAIX,MAAO,CACLjP,EACAC,EAAGkP,EACHQ,IAAKpG,EAAEkD,OAAO2C,KAOlBnS,EAAG5P,UAAUuiB,OAAS,SAAiBhT,GACrCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAIX,EAAI5S,KACJ6S,EAAIrD,EAAE7K,QAGRiO,EADiB,IAAfA,EAAE3C,SACA2C,EAAEyO,KAAK7R,GAEPoD,EAAEjO,QAQR,IALA,IAuCInC,EAvCAigB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ9P,EAAElO,QAEPiO,EAAEgQ,KAAK,GAAK,GAAK/P,EAAE+P,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIvX,EAAI,EAAG+W,EAAK,EAAyB,IAArBxP,EAAE1C,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADAuH,EAAEwB,OAAO/I,GACFA,KAAM,GACPoX,EAAGJ,SACLI,EAAGjM,KAAKmM,GAGVF,EAAGrO,OAAO,GAId,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBzP,EAAE3C,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADAuH,EAAEuB,OAAO9I,GACFA,KAAM,GACPoX,EAAGL,SACLK,EAAGlM,KAAKmM,GAGVD,EAAGtO,OAAO,GAIVxB,EAAE1B,IAAI2B,IAAM,GACdD,EAAE6D,KAAK5D,GACP4P,EAAGhM,KAAKiM,KAER7P,EAAE4D,KAAK7D,GACP8P,EAAGjM,KAAKgM,IAeZ,OATEjgB,EADgB,IAAdoQ,EAAEgQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKhH,GAGJhN,GAGTqN,EAAG5P,UAAUsiB,IAAM,SAAc3c,GAC/B,GAAI5F,KAAKuT,SAAU,OAAO3N,EAAIkP,MAC9B,GAAIlP,EAAI2N,SAAU,OAAOvT,KAAK8U,MAE9B,IAAIlC,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAAIjB,QACZiO,EAAE3C,SAAW,EACb4C,EAAE5C,SAAW,EAGb,IAAK,IAAI0Q,EAAQ,EAAG/N,EAAEqP,UAAYpP,EAAEoP,SAAUtB,IAC5C/N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,OAAG,CACD,KAAOxB,EAAEqP,UACPrP,EAAEwB,OAAO,GAEX,KAAOvB,EAAEoP,UACPpP,EAAEuB,OAAO,GAGX,IAAIzD,EAAIiC,EAAE1B,IAAI2B,GACd,GAAIlC,EAAI,EAAG,CAET,IAAI4D,EAAI3B,EACRA,EAAIC,EACJA,EAAI0B,OACC,GAAU,IAAN5D,GAAyB,IAAdkC,EAAE+P,KAAK,GAC3B,MAGFhQ,EAAE6D,KAAK5D,GAGT,OAAOA,EAAEwM,OAAOsB,IAIlB9Q,EAAG5P,UAAU4iB,KAAO,SAAejd,GACjC,OAAO5F,KAAK2hB,KAAK/b,GAAKgN,EAAEyO,KAAKzb,IAG/BiK,EAAG5P,UAAUgiB,OAAS,WACpB,OAA+B,IAAP,EAAhBjiB,KAAKkQ,MAAM,KAGrBL,EAAG5P,UAAUoiB,MAAQ,WACnB,OAA+B,IAAP,EAAhBriB,KAAKkQ,MAAM,KAIrBL,EAAG5P,UAAUkU,MAAQ,SAAgBvO,GACnC,OAAO5F,KAAKkQ,MAAM,GAAKtK,GAIzBiK,EAAG5P,UAAU6iB,MAAQ,SAAgBxM,GACnClT,EAAsB,iBAARkT,GACd,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,GAAI3Q,KAAKsB,QAAU6b,EAGjB,OAFAnd,KAAKoS,QAAQ+K,EAAI,GACjBnd,KAAKkQ,MAAMiN,IAAMjJ,EACVlU,KAKT,IADA,IAAI+S,EAAQmB,EACH7I,EAAI8R,EAAa,IAAVpK,GAAe1H,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACnD,IAAImG,EAAoB,EAAhBxR,KAAKkQ,MAAM7E,GAEnB0H,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACLxR,KAAKkQ,MAAM7E,GAAKmG,EAMlB,OAJc,IAAVuB,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAEAtB,MAGT6P,EAAG5P,UAAUsT,OAAS,WACpB,OAAuB,IAAhBvT,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,IAGzCL,EAAG5P,UAAU2iB,KAAO,SAAehd,GACjC,IAOIpD,EAPAyN,EAAWrK,EAAM,EAErB,GAAsB,IAAlB5F,KAAKiQ,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBjQ,KAAKiQ,UAAkBA,EAAU,OAAO,EAK5C,GAHAjQ,KAAK0R,QAGD1R,KAAKsB,OAAS,EAChBkB,EAAM,MACD,CACDyN,IACFrK,GAAOA,GAGTxC,EAAOwC,GAAO,SAAW,qBAEzB,IAAI4L,EAAoB,EAAhBxR,KAAKkQ,MAAM,GACnB1N,EAAMgP,IAAM5L,EAAM,EAAI4L,EAAI5L,GAAO,EAAI,EAEvC,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAOTqN,EAAG5P,UAAUiR,IAAM,SAActL,GAC/B,GAAsB,IAAlB5F,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAQ,EACvD,GAAsB,IAAlBjQ,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAO,EAEtD,IAAIzN,EAAMxC,KAAK+iB,KAAKnd,GACpB,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAITqN,EAAG5P,UAAU8iB,KAAO,SAAend,GAEjC,GAAI5F,KAAKsB,OAASsE,EAAItE,OAAQ,OAAO,EACrC,GAAItB,KAAKsB,OAASsE,EAAItE,OAAQ,OAAQ,EAGtC,IADA,IAAIkB,EAAM,EACD6I,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAIuH,EAAoB,EAAhB5S,KAAKkQ,MAAM7E,GACfwH,EAAmB,EAAfjN,EAAIsK,MAAM7E,GAElB,GAAIuH,IAAMC,EAAV,CACID,EAAIC,EACNrQ,GAAO,EACEoQ,EAAIC,IACbrQ,EAAM,GAER,OAEF,OAAOA,GAGTqN,EAAG5P,UAAU+iB,IAAM,SAAcpd,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUgjB,GAAK,SAAard,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUijB,KAAO,SAAetd,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUkjB,IAAM,SAAcvd,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUmjB,IAAM,SAAcxd,GAC/B,OAA2B,IAApB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUojB,GAAK,SAAazd,GAC7B,OAA0B,IAAnB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUqjB,KAAO,SAAe1d,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUsjB,IAAM,SAAc3d,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUujB,IAAM,SAAc5d,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUwjB,GAAK,SAAa7d,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAOlBiK,EAAGM,IAAM,SAAcvK,GACrB,OAAO,IAAI8d,EAAI9d,IAGjBiK,EAAG5P,UAAU0jB,MAAQ,SAAgBC,GAGnC,OAFAxgB,GAAQpD,KAAKmQ,IAAK,yCAClB/M,EAAyB,IAAlBpD,KAAKiQ,SAAgB,iCACrB2T,EAAIC,UAAU7jB,MAAM8jB,UAAUF,IAGvC/T,EAAG5P,UAAU8jB,QAAU,WAErB,OADA3gB,EAAOpD,KAAKmQ,IAAK,wDACVnQ,KAAKmQ,IAAI6T,YAAYhkB,OAG9B6P,EAAG5P,UAAU6jB,UAAY,SAAoBF,GAE3C,OADA5jB,KAAKmQ,IAAMyT,EACJ5jB,MAGT6P,EAAG5P,UAAUgkB,SAAW,SAAmBL,GAEzC,OADAxgB,GAAQpD,KAAKmQ,IAAK,yCACXnQ,KAAK8jB,UAAUF,IAGxB/T,EAAG5P,UAAUikB,OAAS,SAAiBte,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIuG,IAAI1W,KAAM4F,IAG5BiK,EAAG5P,UAAUkkB,QAAU,SAAkBve,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIqG,KAAKxW,KAAM4F,IAG7BiK,EAAG5P,UAAUmkB,OAAS,SAAiBxe,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIwG,IAAI3W,KAAM4F,IAG5BiK,EAAG5P,UAAUokB,QAAU,SAAkBze,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIsG,KAAKzW,KAAM4F,IAG7BiK,EAAG5P,UAAUqkB,OAAS,SAAiB1e,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIoU,IAAIvkB,KAAM4F,IAG5BiK,EAAG5P,UAAUukB,OAAS,SAAiB5e,GAGrC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIU,IAAI7Q,KAAM4F,IAG5BiK,EAAG5P,UAAUykB,QAAU,SAAkB9e,GAGvC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIyK,KAAK5a,KAAM4F,IAG7BiK,EAAG5P,UAAU0kB,OAAS,WAGpB,OAFAvhB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+O,IAAIlf,OAGtB6P,EAAG5P,UAAU4kB,QAAU,WAGrB,OAFAzhB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAIgP,KAAKnf,OAIvB6P,EAAG5P,UAAU6kB,QAAU,WAGrB,OAFA1hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI4U,KAAK/kB,OAGvB6P,EAAG5P,UAAU+kB,QAAU,WAGrB,OAFA5hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI0S,KAAK7iB,OAIvB6P,EAAG5P,UAAUglB,OAAS,WAGpB,OAFA7hB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAImF,IAAItV,OAGtB6P,EAAG5P,UAAUilB,OAAS,SAAiBtf,GAGrC,OAFAxC,EAAOpD,KAAKmQ,MAAQvK,EAAIuK,IAAK,qBAC7BnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+B,IAAIlS,KAAM4F,IAI5B,IAAIuf,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ1lB,EAAM0P,GAErBxP,KAAKF,KAAOA,EACZE,KAAKwP,EAAI,IAAIK,EAAGL,EAAG,IACnBxP,KAAKge,EAAIhe,KAAKwP,EAAEiF,YAChBzU,KAAKgT,EAAI,IAAInD,EAAG,GAAGwP,OAAOrf,KAAKge,GAAGvH,KAAKzW,KAAKwP,GAE5CxP,KAAK0M,IAAM1M,KAAKylB,OAiDlB,SAASC,IACPF,EAAOjlB,KACLP,KACA,OACA,2EA+DJ,SAAS2lB,IACPH,EAAOjlB,KACLP,KACA,OACA,kEAIJ,SAAS4lB,IACPJ,EAAOjlB,KACLP,KACA,OACA,yDAIJ,SAAS6lB,IAEPL,EAAOjlB,KACLP,KACA,QACA,uEA8CJ,SAAS0jB,EAAK3kB,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAI+mB,EAAQjW,EAAGkW,OAAOhnB,GACtBiB,KAAKjB,EAAI+mB,EAAMtW,EACfxP,KAAK8lB,MAAQA,OAEb1iB,EAAOrE,EAAEikB,IAAI,GAAI,kCACjBhjB,KAAKjB,EAAIA,EACTiB,KAAK8lB,MAAQ,KAkOjB,SAASE,EAAMjnB,GACb2kB,EAAInjB,KAAKP,KAAMjB,GAEfiB,KAAK2gB,MAAQ3gB,KAAKjB,EAAE0V,YAChBzU,KAAK2gB,MAAQ,IAAO,IACtB3gB,KAAK2gB,OAAS,GAAM3gB,KAAK2gB,MAAQ,IAGnC3gB,KAAK2Q,EAAI,IAAId,EAAG,GAAGwP,OAAOrf,KAAK2gB,OAC/B3gB,KAAKyhB,GAAKzhB,KAAKimB,KAAKjmB,KAAK2Q,EAAEuO,OAC3Blf,KAAKkmB,KAAOlmB,KAAK2Q,EAAE6R,OAAOxiB,KAAKjB,GAE/BiB,KAAKmmB,KAAOnmB,KAAKkmB,KAAKrV,IAAI7Q,KAAK2Q,GAAG2P,MAAM,GAAGW,IAAIjhB,KAAKjB,GACpDiB,KAAKmmB,KAAOnmB,KAAKmmB,KAAK9E,KAAKrhB,KAAK2Q,GAChC3Q,KAAKmmB,KAAOnmB,KAAK2Q,EAAEgG,IAAI3W,KAAKmmB,MA5a9BX,EAAOvlB,UAAUwlB,KAAO,WACtB,IAAI/Y,EAAM,IAAImD,EAAG,MAEjB,OADAnD,EAAIwD,MAAQ,IAAIxO,MAAMoP,KAAKS,KAAKvR,KAAKge,EAAI,KAClCtR,GAGT8Y,EAAOvlB,UAAUmmB,QAAU,SAAkBxgB,GAG3C,IACIygB,EADA1V,EAAI/K,EAGR,GACE5F,KAAKsN,MAAMqD,EAAG3Q,KAAK0M,KAGnB2Z,GADA1V,GADAA,EAAI3Q,KAAKsmB,MAAM3V,IACT6F,KAAKxW,KAAK0M,MACP+H,kBACF4R,EAAOrmB,KAAKge,GAErB,IAAI9M,EAAMmV,EAAOrmB,KAAKge,GAAK,EAAIrN,EAAEoS,KAAK/iB,KAAKwP,GAgB3C,OAfY,IAAR0B,GACFP,EAAET,MAAM,GAAK,EACbS,EAAErP,OAAS,GACF4P,EAAM,EACfP,EAAE8F,KAAKzW,KAAKwP,QAEIpH,IAAZuI,EAAEe,MAEJf,EAAEe,QAGFf,EAAE4V,SAIC5V,GAGT6U,EAAOvlB,UAAUqN,MAAQ,SAAgBvH,EAAOjD,GAC9CiD,EAAMqO,OAAOpU,KAAKge,EAAG,EAAGlb,IAG1B0iB,EAAOvlB,UAAUqmB,MAAQ,SAAgB1gB,GACvC,OAAOA,EAAIgV,KAAK5a,KAAKgT,IASvBpT,EAAS8lB,EAAMF,GAEfE,EAAKzlB,UAAUqN,MAAQ,SAAgBvH,EAAOygB,GAK5C,IAHA,IAAI3G,EAAO,QAEP4G,EAAS3V,KAAK/D,IAAIhH,EAAMzE,OAAQ,GAC3B+J,EAAI,EAAGA,EAAIob,EAAQpb,IAC1Bmb,EAAOtW,MAAM7E,GAAKtF,EAAMmK,MAAM7E,GAIhC,GAFAmb,EAAOllB,OAASmlB,EAEZ1gB,EAAMzE,QAAU,EAGlB,OAFAyE,EAAMmK,MAAM,GAAK,OACjBnK,EAAMzE,OAAS,GAKjB,IAAIuI,EAAO9D,EAAMmK,MAAM,GAGvB,IAFAsW,EAAOtW,MAAMsW,EAAOllB,UAAYuI,EAAOgW,EAElCxU,EAAI,GAAIA,EAAItF,EAAMzE,OAAQ+J,IAAK,CAClC,IAAIqb,EAAwB,EAAjB3gB,EAAMmK,MAAM7E,GACvBtF,EAAMmK,MAAM7E,EAAI,KAAQqb,EAAO7G,IAAS,EAAMhW,IAAS,GACvDA,EAAO6c,EAET7c,KAAU,GACV9D,EAAMmK,MAAM7E,EAAI,IAAMxB,EACT,IAATA,GAAc9D,EAAMzE,OAAS,GAC/ByE,EAAMzE,QAAU,GAEhByE,EAAMzE,QAAU,GAIpBokB,EAAKzlB,UAAUqmB,MAAQ,SAAgB1gB,GAErCA,EAAIsK,MAAMtK,EAAItE,QAAU,EACxBsE,EAAIsK,MAAMtK,EAAItE,OAAS,GAAK,EAC5BsE,EAAItE,QAAU,EAId,IADA,IAAIwR,EAAK,EACAzH,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAImG,EAAmB,EAAf5L,EAAIsK,MAAM7E,GAClByH,GAAU,IAAJtB,EACN5L,EAAIsK,MAAM7E,GAAU,SAALyH,EACfA,EAAS,GAAJtB,GAAasB,EAAK,SAAa,GAUtC,OANkC,IAA9BlN,EAAIsK,MAAMtK,EAAItE,OAAS,KACzBsE,EAAItE,SAC8B,IAA9BsE,EAAIsK,MAAMtK,EAAItE,OAAS,IACzBsE,EAAItE,UAGDsE,GASThG,EAAS+lB,EAAMH,GAQf5lB,EAASgmB,EAAMJ,GASf5lB,EAASimB,EAAQL,GAEjBK,EAAO5lB,UAAUqmB,MAAQ,SAAgB1gB,GAGvC,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAIqJ,EAA0B,IAAL,EAAf9O,EAAIsK,MAAM7E,IAAiB0H,EACjCD,EAAU,SAAL4B,EACTA,KAAQ,GAER9O,EAAIsK,MAAM7E,GAAKyH,EACfC,EAAQ2B,EAKV,OAHc,IAAV3B,IACFnN,EAAIsK,MAAMtK,EAAItE,UAAYyR,GAErBnN,GAITiK,EAAGkW,OAAS,SAAgBjmB,GAE1B,GAAIqlB,EAAOrlB,GAAO,OAAOqlB,EAAOrlB,GAEhC,IAAIgmB,EACJ,GAAa,SAAThmB,EACFgmB,EAAQ,IAAIJ,OACP,GAAa,SAAT5lB,EACTgmB,EAAQ,IAAIH,OACP,GAAa,SAAT7lB,EACTgmB,EAAQ,IAAIF,MACP,IAAa,WAAT9lB,EAGT,MAAM,IAAIb,MAAM,iBAAmBa,GAFnCgmB,EAAQ,IAAID,EAMd,OAFAV,EAAOrlB,GAAQgmB,EAERA,GAkBTpC,EAAIzjB,UAAU2kB,SAAW,SAAmBhS,GAC1CxP,EAAsB,IAAfwP,EAAE3C,SAAgB,iCACzB7M,EAAOwP,EAAEzC,IAAK,oCAGhBuT,EAAIzjB,UAAUwkB,SAAW,SAAmB7R,EAAGC,GAC7CzP,EAAqC,IAA7BwP,EAAE3C,SAAW4C,EAAE5C,UAAiB,iCACxC7M,EAAOwP,EAAEzC,KAAOyC,EAAEzC,MAAQ0C,EAAE1C,IAC1B,oCAGJuT,EAAIzjB,UAAUgmB,KAAO,SAAerT,GAClC,OAAI5S,KAAK8lB,MAAc9lB,KAAK8lB,MAAMM,QAAQxT,GAAGkR,UAAU9jB,MAChD4S,EAAEyO,KAAKrhB,KAAKjB,GAAG+kB,UAAU9jB,OAGlC0jB,EAAIzjB,UAAUqV,IAAM,SAAc1C,GAChC,OAAIA,EAAEW,SACGX,EAAEjO,QAGJ3E,KAAKjB,EAAE4X,IAAI/D,GAAGkR,UAAU9jB,OAGjC0jB,EAAIzjB,UAAUyW,IAAM,SAAc9D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE8D,IAAI7D,GAIhB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUuW,KAAO,SAAe5D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE4D,KAAK3D,GAIjB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAU0W,IAAM,SAAc/D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE+D,IAAI9D,GAIhB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUwW,KAAO,SAAe7D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE6D,KAAK5D,GAIjB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAUskB,IAAM,SAAc3R,EAAGhN,GAEnC,OADA5F,KAAK4kB,SAAShS,GACP5S,KAAKimB,KAAKrT,EAAEqN,MAAMra,KAG3B8d,EAAIzjB,UAAU2a,KAAO,SAAehI,EAAGC,GAErC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAEgI,KAAK/H,KAG1B6Q,EAAIzjB,UAAU4Q,IAAM,SAAc+B,EAAGC,GAEnC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAE/B,IAAIgC,KAGzB6Q,EAAIzjB,UAAUkf,KAAO,SAAevM,GAClC,OAAO5S,KAAK4a,KAAKhI,EAAGA,EAAEjO,UAGxB+e,EAAIzjB,UAAUif,IAAM,SAActM,GAChC,OAAO5S,KAAK6Q,IAAI+B,EAAGA,IAGrB8Q,EAAIzjB,UAAU8kB,KAAO,SAAenS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEjO,QAEzB,IAAIgiB,EAAO3mB,KAAKjB,EAAEoV,MAAM,GAIxB,GAHA/Q,EAAOujB,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIzU,EAAMlS,KAAKjB,EAAE2X,IAAI,IAAI7G,EAAG,IAAIuE,OAAO,GACvC,OAAOpU,KAAKkS,IAAIU,EAAGV,GAQrB,IAFA,IAAIgC,EAAIlU,KAAKjB,EAAEyhB,KAAK,GAChBrD,EAAI,GACAjJ,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXhR,GAAQ8Q,EAAEX,UAEV,IAAIqT,EAAM,IAAI/W,EAAG,GAAG8T,MAAM3jB,MACtB6mB,EAAOD,EAAI3B,SAIX6B,EAAO9mB,KAAKjB,EAAEyhB,KAAK,GAAGpM,OAAO,GAC7B2S,EAAI/mB,KAAKjB,EAAE0V,YAGf,IAFAsS,EAAI,IAAIlX,EAAG,EAAIkX,EAAIA,GAAGpD,MAAM3jB,MAEW,IAAhCA,KAAKkS,IAAI6U,EAAGD,GAAM5V,IAAI2V,IAC3BE,EAAE5C,QAAQ0C,GAOZ,IAJA,IAAIrW,EAAIxQ,KAAKkS,IAAI6U,EAAG7S,GAChBvD,EAAI3Q,KAAKkS,IAAIU,EAAGsB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAIvU,KAAKkS,IAAIU,EAAGsB,GAChBnV,EAAIoe,EACc,IAAf5I,EAAErD,IAAI0V,IAAY,CAEvB,IADA,IAAIla,EAAM6H,EACDlJ,EAAI,EAAoB,IAAjBqB,EAAIwE,IAAI0V,GAAYvb,IAClCqB,EAAMA,EAAIiY,SAEZvhB,EAAOiI,EAAItM,GACX,IAAI8T,EAAI7S,KAAKkS,IAAI1B,EAAG,IAAIX,EAAG,GAAGwP,OAAOtgB,EAAIsM,EAAI,IAE7CsF,EAAIA,EAAE6T,OAAO3R,GACbrC,EAAIqC,EAAE8R,SACNpQ,EAAIA,EAAEiQ,OAAOhU,GACbzR,EAAIsM,EAGN,OAAOsF,GAGT+S,EAAIzjB,UAAU4iB,KAAO,SAAejQ,GAClC,IAAIoU,EAAMpU,EAAE4P,OAAOxiB,KAAKjB,GACxB,OAAqB,IAAjBioB,EAAI/W,UACN+W,EAAI/W,SAAW,EACRjQ,KAAKimB,KAAKe,GAAK/B,UAEfjlB,KAAKimB,KAAKe,IAIrBtD,EAAIzjB,UAAUiS,IAAM,SAAcU,EAAGhN,GACnC,GAAIA,EAAI2N,SAAU,OAAO,IAAI1D,EAAG,GAAG8T,MAAM3jB,MACzC,GAAoB,IAAhB4F,EAAIgd,KAAK,GAAU,OAAOhQ,EAAEjO,QAEhC,IACIsiB,EAAM,IAAIvlB,MAAM,IACpBulB,EAAI,GAAK,IAAIpX,EAAG,GAAG8T,MAAM3jB,MACzBinB,EAAI,GAAKrU,EACT,IAAK,IAAIvH,EAAI,EAAGA,EAAI4b,EAAI3lB,OAAQ+J,IAC9B4b,EAAI5b,GAAKrL,KAAK6Q,IAAIoW,EAAI5b,EAAI,GAAIuH,GAGhC,IAAIpQ,EAAMykB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtgB,EAAQjB,EAAI6O,YAAc,GAK9B,IAJc,IAAV5N,IACFA,EAAQ,IAGLwE,EAAIzF,EAAItE,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI0G,EAAOnM,EAAIsK,MAAM7E,GACZC,EAAIzE,EAAQ,EAAGyE,GAAK,EAAGA,IAAK,CACnC,IAAIgL,EAAOvE,GAAQzG,EAAK,EACpB9I,IAAQykB,EAAI,KACdzkB,EAAMxC,KAAKkf,IAAI1c,IAGL,IAAR8T,GAAyB,IAAZ4Q,GAKjBA,IAAY,EACZA,GAAW5Q,GA9BE,KA+Bb6Q,GACwC,IAAN9b,GAAiB,IAANC,KAE7C9I,EAAMxC,KAAK6Q,IAAIrO,EAAKykB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtgB,EAAQ,GAGV,OAAOrE,GAGTkhB,EAAIzjB,UAAU4jB,UAAY,SAAoBje,GAC5C,IAAI+K,EAAI/K,EAAIyb,KAAKrhB,KAAKjB,GAEtB,OAAO4R,IAAM/K,EAAM+K,EAAEhM,QAAUgM,GAGjC+S,EAAIzjB,UAAU+jB,YAAc,SAAsBpe,GAChD,IAAIpD,EAAMoD,EAAIjB,QAEd,OADAnC,EAAI2N,IAAM,KACH3N,GAOTqN,EAAGuX,KAAO,SAAexhB,GACvB,OAAO,IAAIogB,EAAKpgB,IAmBlBhG,EAASomB,EAAMtC,GAEfsC,EAAK/lB,UAAU4jB,UAAY,SAAoBje,GAC7C,OAAO5F,KAAKimB,KAAKrgB,EAAIqa,MAAMjgB,KAAK2gB,SAGlCqF,EAAK/lB,UAAU+jB,YAAc,SAAsBpe,GACjD,IAAI+K,EAAI3Q,KAAKimB,KAAKrgB,EAAIiL,IAAI7Q,KAAKkmB,OAE/B,OADAvV,EAAER,IAAM,KACDQ,GAGTqV,EAAK/lB,UAAU2a,KAAO,SAAehI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE1C,MAAM,GAAK,EACb0C,EAAEtR,OAAS,EACJsR,EAGT,IAAI2B,EAAI3B,EAAEgI,KAAK/H,GACXrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAQV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4Q,IAAM,SAAc+B,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI1D,EAAG,GAAGiU,UAAU9jB,MAEzD,IAAIuU,EAAI3B,EAAE/B,IAAIgC,GACVrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAOV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4iB,KAAO,SAAejQ,GAGnC,OADU5S,KAAKimB,KAAKrT,EAAE4P,OAAOxiB,KAAKjB,GAAG8R,IAAI7Q,KAAKyhB,KACnCqC,UAAU9jB,OAn3GzB,YAq3G4CA,mCCp3G5C,IAAIJ,EAAW,EAAQ,MACnB4iE,EAAM,EAAQ,MACdC,EAAY,EAAQ,MACpBC,EAAM,EAAQ,MACdviE,EAAO,EAAQ,MAEnB,SAASwiE,EAAMjf,GACbvjD,EAAKI,KAAKP,KAAM,UAEhBA,KAAK2jD,MAAQD,EAGf9jD,EAAS+iE,EAAMxiE,GAEfwiE,EAAK1iE,UAAUi9C,QAAU,SAAUt8C,GACjCZ,KAAK2jD,MAAMvS,OAAOxwC,IAGpB+hE,EAAK1iE,UAAUq9C,OAAS,WACtB,OAAOt9C,KAAK2jD,MAAMM,UAGpBxlD,EAAOC,QAAU,SAAqBkkE,GAEpC,MAAY,SADZA,EAAMA,EAAI/6B,eACgB,IAAI26B,EAClB,WAARI,GAA4B,cAARA,EAA4B,IAAIH,EAEjD,IAAIE,EAAKD,EAAIE,qBC5BtB,IAAIJ,EAAM,EAAQ,MAElB/jE,EAAOC,QAAU,SAAU6M,GACzB,OAAO,IAAIi3D,GAAMpxB,OAAO7lC,GAAQ04C,uCCFlC,IAAIrkD,EAAW,EAAQ,MACnBijE,EAAS,EAAQ,MACjB1iE,EAAO,EAAQ,MACfe,EAAS,eACT4hE,EAAM,EAAQ,MACdL,EAAY,EAAQ,MAEpBC,EAAM,EAAQ,MAEdK,EAAQ7hE,EAAO6B,MAAM,KAEzB,SAASigE,EAAMJ,EAAKv+D,GAClBlE,EAAKI,KAAKP,KAAM,UACG,iBAARqE,IACTA,EAAMnD,EAAO2M,KAAKxJ,IAGpB,IAAI4+D,EAAqB,WAARL,GAA4B,WAARA,EAAoB,IAAM,GAE/D5iE,KAAKkjE,KAAON,EACZ5iE,KAAKypB,KAAOplB,EACRA,EAAI/C,OAAS2hE,EAEf5+D,GADmB,WAARu+D,EAAmB,IAAIH,EAAcC,EAAIE,IACzCxxB,OAAO/sC,GAAK4/C,SACd5/C,EAAI/C,OAAS2hE,IACtB5+D,EAAMnD,EAAOqC,OAAO,CAACc,EAAK0+D,GAAQE,IAMpC,IAHA,IAAIE,EAAOnjE,KAAKojE,MAAQliE,EAAOkpC,YAAY64B,GACvCI,EAAOrjE,KAAKsjE,MAAQpiE,EAAOkpC,YAAY64B,GAElC53D,EAAI,EAAGA,EAAI43D,EAAW53D,IAC7B83D,EAAK93D,GAAc,GAAThH,EAAIgH,GACdg4D,EAAKh4D,GAAc,GAAThH,EAAIgH,GAEhBrL,KAAK2jD,MAAgB,WAARif,EAAmB,IAAIH,EAAcC,EAAIE,GACtD5iE,KAAK2jD,MAAMvS,OAAO+xB,GAGpBvjE,EAASojE,EAAM7iE,GAEf6iE,EAAK/iE,UAAUi9C,QAAU,SAAUt8C,GACjCZ,KAAK2jD,MAAMvS,OAAOxwC,IAGpBoiE,EAAK/iE,UAAUq9C,OAAS,WACtB,IAAI19B,EAAI5f,KAAK2jD,MAAMM,SAEnB,OADyB,WAAdjkD,KAAKkjE,KAAoB,IAAIT,EAAcC,EAAI1iE,KAAKkjE,OACnD9xB,OAAOpxC,KAAKsjE,OAAOlyB,OAAOxxB,GAAGqkC,UAG3CxlD,EAAOC,QAAU,SAAqBkkE,EAAKv+D,GAEzC,MAAY,YADZu+D,EAAMA,EAAI/6B,gBACsB,cAAR+6B,EACf,IAAII,EAAK,SAAU3+D,GAEhB,QAARu+D,EACK,IAAIC,EAAOC,EAAKz+D,GAElB,IAAI2+D,EAAKJ,EAAKv+D,iCC3DvB,IAAIzE,EAAW,EAAQ,MACnBsB,EAAS,eAETf,EAAO,EAAQ,MAEf4iE,EAAQ7hE,EAAO6B,MAAM,KACrBkgE,EAAY,GAEhB,SAASD,EAAMJ,EAAKv+D,GAClBlE,EAAKI,KAAKP,KAAM,UACG,iBAARqE,IACTA,EAAMnD,EAAO2M,KAAKxJ,IAGpBrE,KAAKkjE,KAAON,EACZ5iE,KAAKypB,KAAOplB,EAERA,EAAI/C,OAAS2hE,EACf5+D,EAAMu+D,EAAIv+D,GACDA,EAAI/C,OAAS2hE,IACtB5+D,EAAMnD,EAAOqC,OAAO,CAACc,EAAK0+D,GAAQE,IAMpC,IAHA,IAAIE,EAAOnjE,KAAKojE,MAAQliE,EAAOkpC,YAAY64B,GACvCI,EAAOrjE,KAAKsjE,MAAQpiE,EAAOkpC,YAAY64B,GAElC53D,EAAI,EAAGA,EAAI43D,EAAW53D,IAC7B83D,EAAK93D,GAAc,GAAThH,EAAIgH,GACdg4D,EAAKh4D,GAAc,GAAThH,EAAIgH,GAGhBrL,KAAK2jD,MAAQ,CAACwf,GAGhBvjE,EAASojE,EAAM7iE,GAEf6iE,EAAK/iE,UAAUi9C,QAAU,SAAUt8C,GACjCZ,KAAK2jD,MAAM5+C,KAAKnE,IAGlBoiE,EAAK/iE,UAAUq9C,OAAS,WACtB,IAAI19B,EAAI5f,KAAKkjE,KAAKhiE,EAAOqC,OAAOvD,KAAK2jD,QACrC,OAAO3jD,KAAKkjE,KAAKhiE,EAAOqC,OAAO,CAACvD,KAAKsjE,MAAO1jD,MAE9CnhB,EAAOC,QAAUskE,uCC5CjB,MAAMllC,EAAU,EAAQ,MAClBw+B,EAAc,EAAQ,KACtBiH,EAAkB,EAAQ,MAC1BC,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,KACzBC,EAAS,EAAQ,KACjBC,EAAO,EAAQ,MACfC,EAAc,EAAQ,MACtBp/B,EAAO,EAAQ,KACfqK,EAAW,EAAQ,MACnBE,EAAiB,EAAQ,MACzBpP,EAAO,EAAQ,MACfE,EAAS,EAAQ,MAEjBgkC,EAAW,EAAQ,MAiDzB,SAASC,EAAa/9D,EAAOk5B,EAAM8J,GAIjC,GAwU2B,oBAAbg7B,UA3UCh+D,aA2U0Cg+D,WA3UlCh+D,EAAQrE,MAAMmM,KAAK9H,IACrCrE,MAAMC,QAAQoE,KAAQA,EAAQ,CAACA,IAEf,IAAjBA,EAAMzE,OAAc,MAAM,IAAIrC,MAAM,sBAExC8G,EAAM/C,SAAQnB,IACZ,GAAY,MAARA,EAAc,MAAM,IAAI5C,MAAM,uBAAuB4C,QAUtC,KANrBkE,EAAQA,EAAMnE,KAAIC,GACZmiE,EAAOniE,IAA8B,iBAAdA,EAAKkF,MAAyC,mBAAb88D,EAAgChiE,EAAKkF,KAC1FlF,KAICP,QAAoC,iBAAbyE,EAAM,IAAoBA,EAAM,GAAGjG,OAAMiG,EAAM,GAAGjG,KAAOm/B,EAAKn/B,MAE/F,IAAImkE,EAAe,KACnBl+D,EAAM/C,SAAQ,CAACnB,EAAMwJ,KACnB,GAAoB,iBAATxJ,EACT,OAGF,IAAIkF,EAAOlF,EAAKqiE,UAAYriE,EAAK/B,KAC5BiH,IACHA,EAAO,gBAAgBsE,EAAI,IAC3BxJ,EAAKsiE,aAAc,GAGrBtiE,EAAKkF,KAAOA,EAAKuG,MAAM,KAGlBzL,EAAKkF,KAAK,IACblF,EAAKkF,KAAK4Z,QAGR9e,EAAKkF,KAAKzF,OAAS,EACrB2iE,EAAe,KACA,IAAN54D,GAAWtF,EAAMzE,OAAS,EACnC2iE,EAAepiE,EAAKkF,KAAK,GAChBlF,EAAKkF,KAAK,KAAOk9D,IAC1BA,EAAe,eAI8B77D,IAAzB62B,EAAKmlC,iBAAuCnlC,EAAKmlC,mBAGvEr+D,EAAQA,EAAMZ,QAAOtD,GACC,iBAATA,IAGHwiE,EAAWxiE,EAAKkF,SAIxBk9D,GACFl+D,EAAM/C,SAAQnB,IACZ,MAAMyiE,GAAYpjE,EAAOE,SAASS,IAAS0iE,EAAW1iE,MAAWA,EAAKkF,KAClD,iBAATlF,GAAqByiE,GAChCziE,EAAKkF,KAAK4Z,YAITse,EAAKn/B,MAAQmkE,IAChBhlC,EAAKn/B,KAAOmkE,GAGThlC,EAAKn/B,MAERiG,EAAM+B,MAAKjG,GACW,iBAATA,GACTo9B,EAAKn/B,KAAO0jE,EAASgB,SAAS3iE,IACvB,IACGA,EAAKsiE,cACfllC,EAAKn/B,KAAO+B,EAAKkF,KAAKlF,EAAKkF,KAAKzF,OAAS,IAClC,KAMR29B,EAAKn/B,OACRm/B,EAAKn/B,KAAO,mBAAmBmN,KAAKnD,SAGtC,MAAM26D,EAAW1+D,EAAMq4B,QAAO,CAACrC,EAAKl6B,IAASk6B,EAAM58B,OAAuB,iBAAT0C,IAAoB,GAErF,IAAI6iE,EAAwC,IAAjB3+D,EAAMzE,OAEjC,GAAqB,IAAjByE,EAAMzE,QAAoC,iBAAbyE,EAAM,GAAiB,CACtD,GAAwB,mBAAb89D,EACT,MAAM,IAAI5kE,MAAM,+CAIlBykE,EAAO39D,EAAM,IAAI,CAACgE,EAAK46D,KACrB,GAAI56D,EAAK,OAAOg/B,EAAGh/B,GACnB26D,EAAsBC,EACtBC,YAGF71B,EAAe61B,GAGjB,SAASA,IACP/1B,EAAS9oC,EAAMnE,KAAIC,GAAQknC,IACzB,MAAM87B,EAAO,GAEb,GAAIb,EAAOniE,GACTgjE,EAAKC,UA6Ob,SAAwBD,GACtB,MAAO,IAAM,IAAIpB,EAAeoB,GA9OTE,CAAcljE,GAC/BgjE,EAAKvjE,OAASO,EAAKjD,UACd,GAAIsC,EAAOE,SAASS,GACzBgjE,EAAKC,WAmPav5D,EAnPe1J,EAoPhC,KACL,MAAMsb,EAAI,IAAI0iB,EAAOmlC,YAErB,OADA7nD,EAAEzP,IAAInC,GACC4R,IAtPH0nD,EAAKvjE,OAASO,EAAKP,WACd,KAAIijE,EAAW1iE,GAGf,IAAoB,iBAATA,EAAmB,CACnC,GAAwB,mBAAbgiE,EACT,MAAM,IAAI5kE,MAAM,+CAIlB,YADA4kE,EAAShiE,EADQ4iE,EAAW,GAAKC,EACR37B,GAGzB,MAAM,IAAI9pC,MAAM,sBAVhB4lE,EAAKC,UAgQb,SAA0BG,EAAUJ,GAClC,MAAO,KACL,MAAMK,EAAU,IAAIrlC,EAAOkX,UAO3B,OANAmuB,EAAQ7tB,WAAa,SAAUrsC,EAAKvK,EAAKs0B,GACvC8vC,EAAKvjE,QAAU0J,EAAI1J,OACnBtB,KAAK+E,KAAKiG,GACV+pB,KAEFkwC,EAASE,KAAKD,GACPA,GAzQcE,CAAgBvjE,EAAMgjE,GACvCA,EAAKvjE,OAAS,EA+OtB,IAA0BiK,EApOpBs5D,EAAK99D,KAAOlF,EAAKkF,KACjBgiC,EAAG,KAAM87B,OACP,CAAC96D,EAAKwrC,KACR,GAAIxrC,EAAK,OAAOg/B,EAAGh/B,GACnBwrC,EAAQA,EAAM8vB,OACdt8B,EAAG,KAAMwM,EAAOmvB,OAuKtB,SAASL,EAAYt9D,GACnB,MAAMu+D,EAAWv+D,EAAKA,EAAKzF,OAAS,GACpC,MAAuB,MAAhBgkE,EAAS,IAAc3B,EAAKl7C,GAAG68C,GASxC,SAASC,EAAWxpC,EAAK8oC,GACvB,OAAO9oC,EAAM8oC,EAAKvjE,OAQpB,SAAS0iE,EAAQ9/D,GACf,MAAuB,oBAATsyC,MAAwBtyC,aAAesyC,KAiBvD,SAAS+tB,EAAYrgE,GACnB,MAAsB,iBAARA,GAA2B,MAAPA,GAAmC,mBAAbA,EAAIihE,KA8C9D1mE,EAAOC,QAvZP,SAAwBqH,EAAOk5B,EAAM8J,GACf,mBAAT9J,KAAsBA,EAAM8J,GAAM,CAACA,EAAI9J,IAGlD6kC,EAAY/9D,EAFZk5B,EAAOA,EAAOz5B,OAAO+iB,OAAO,GAAI0W,GAAQ,IAEf,CAACl1B,EAAKwrC,EAAOiwB,KACpC,GAAIz7D,EAAK,OAAOg/B,EAAGh/B,GACnBk1B,EAAKumC,kBAAoBA,EAiO7B,SAAkBjwB,EAAOtW,EAAM8J,GAC7B,IAAI08B,EAAexmC,EAAKwmC,aAEnBA,IAC0B,iBAAlBxmC,EAAKoQ,SAAuBo2B,EAAe,CAAC,CAACxmC,EAAKoQ,WACpD3tC,MAAMC,QAAQs9B,EAAKoQ,YAC1Bo2B,EAAexmC,EAAKoQ,SAASztC,KAAIylB,GAAK,CAACA,OAItCo+C,IAAcA,EAAe,IAE9BC,WAAWC,sBACiC,iBAAnCD,WAAWC,oBACpBF,EAAa1gE,KAAK,CAAC,CAAC2gE,WAAWC,uBACtBjkE,MAAMC,QAAQ+jE,WAAWC,uBAClCF,EAAeA,EAAaliE,OAAOmiE,WAAWC,oBAAoB/jE,KAAIylB,GAAK,CAACA,aAK1Djf,IAAlB62B,EAAKoQ,eAAgDjnC,IAAtB62B,EAAKwmC,eACtCA,EAAeA,EAAaliE,OAAO9E,EAAOC,QAAQ+mE,eAGxB,iBAAjBxmC,EAAK2mC,UAAsB3mC,EAAK2mC,QAAU,CAAC3mC,EAAK2mC,UAE3D,MAAMC,EAAU,CACdv5B,KAAM,CACJxsC,KAAMm/B,EAAKn/B,MAEb,gBAAiBgR,KAAKS,MAAMpS,OAAO8/B,EAAK6mC,eAAiB74D,KAAKnD,OAAS,KACvEkyB,SAAU,SAGgB,IAAxBypC,EAAankE,SACfukE,EAAQx2B,SAAWo2B,EAAa,GAAG,GACnCI,EAAQ,iBAAmBJ,QAGRr9D,IAAjB62B,EAAK8mC,UAAuBF,EAAQE,QAAU9mC,EAAK8mC,cAEhC39D,IAAnB62B,EAAK+mC,YAAyBH,EAAQ,cAAgB5mC,EAAK+mC,gBAE1C59D,IAAjB62B,EAAKgnC,UAAuBJ,EAAQv5B,KAAK25B,QAAU9mE,OAAO8/B,EAAKgnC,eAEjD79D,IAAd62B,EAAKqN,MAAoB9mC,OAAO+iB,OAAOs9C,EAAQv5B,KAAMrN,EAAKqN,WAMzClkC,IAAjB62B,EAAKinC,UAAuBL,EAAQv5B,KAAK,YAAcrN,EAAKinC,cAE3C99D,IAAjB62B,EAAK2mC,UAAuBC,EAAQ,YAAc5mC,EAAK2mC,SAE3D,MAAMO,EAAyB5wB,EAAMnX,OAAOmnC,EAAW,GACjDa,EAAcnnC,EAAKmnC,aAAe7C,EAAgB4C,GACxDN,EAAQv5B,KAAK,gBAAkB85B,EA/HjC,SAAuB7wB,EAAO6wB,EAAaD,EAAwBlnC,EAAM8J,GACvEA,EAAKvE,EAAKuE,GACV,MAAMs9B,EAAS,GACf,IAAI/kE,EAAS,EACTglE,EAAe,EAEnB,MAAMC,EAAUhxB,EAAM3zC,KAAIijE,GAAQA,EAAKC,YAEvC,IAAI0B,EAAkB,EAClBC,EAAW,EACX5W,GAAQ,EAEZ,MAAM6W,EAAc,IAAI9C,EAAY2C,GAC9BI,EAAc,IAAIrK,EAAY8J,EAAa,CAAEnvB,aAAa,IAUhE,SAAS2vB,EAAQzpB,GACf77C,GAAU67C,EAAM77C,OAEhB,MAAM+J,EAAIo7D,EACV9mC,EAAKwd,GAAOuG,IACV2iB,EAAOh7D,GAAKq4C,EACZ8iB,GAAmB,EACfA,EAhCqB,GAiCvBG,EAAY9J,SAEdyJ,GAAgBnpB,EAAM77C,OAClB29B,EAAK4nC,YAAY5nC,EAAK4nC,WAAWP,EAAcH,GACnDW,OAEFN,GAAmB,EACfA,GAxCuB,GAyCzBG,EAAY/J,QAEd6J,GAAY,EAGd,SAAS9Z,IACPkD,GAAQ,EACRiX,IAGF,SAAS9wB,EAASjsC,GAChBg9D,IACAh+B,EAAGh/B,GAGL,SAASg9D,IACPL,EAAYrzB,eAAe,QAAS2C,GACpC2wB,EAAYtzB,eAAe,OAAQuzB,GACnCD,EAAYtzB,eAAe,MAAOsZ,GAClCga,EAAYtzB,eAAe,QAAS2C,GAGtC,SAAS8wB,IACHjX,GAA6B,IAApB2W,IACXO,IACAh+B,EAAG,KAAM7nC,EAAO2M,KAAKw4D,EAAOxjE,KAAK,IAAK,OAAQvB,IAjDlDolE,EAAYhiC,GAAG,QAASsR,GAExB0wB,EACGvB,KAAKwB,GACLjiC,GAAG,OAAQkiC,GACXliC,GAAG,MAAOioB,GACVjoB,GAAG,QAASsR,GA4GfgxB,CACEzxB,EACA6wB,EACAD,EACAlnC,GACA,CAACl1B,EAAKs8D,EAAQY,KACZ,GAAIl9D,EAAK,OAAOg/B,EAAGh/B,GACnB87D,EAAQv5B,KAAK+5B,OAASA,EAEtB9wB,EAAMvyC,SAAQ6hE,WACLA,EAAKC,aAGV7lC,EAAKumC,kBACPK,EAAQv5B,KAAKhrC,OAAS2lE,EAEtBpB,EAAQv5B,KAAKiJ,MAAQA,EAGvBxM,EAAG,KAAMjL,EAAQ/8B,OAAO8kE,OA/S1BqB,CAAQ3xB,EAAOtW,EAAM8J,OAiZzBtqC,EAAOC,QAAQyoE,WA7Yf,SAAqBphE,EAAOk5B,EAAM8J,GACZ,mBAAT9J,KAAsBA,EAAM8J,GAAM,CAACA,EAAI9J,IAElD6kC,EAAY/9D,EADZk5B,EAAOA,EAAOz5B,OAAO+iB,OAAO,GAAI0W,GAAQ,GACf8J,IA2Y3BtqC,EAAOC,QAAQ+mE,aApbM,CACnB,CAAC,4CACD,CAAC,sCACD,CAAC,qCACD,CAAC,2BACD,CAAC,mCACD,CAAC,8BACD,CAAC,qCA8aHhnE,EAAOC,QAAQ2lE,WAAaA,+BCpc5B3lE,EAAQk6C,YAAcl6C,EAAQ0oE,IAAM1oE,EAAQ2oE,kBAAoB3oE,EAAQ4oE,KAAO,EAAf,MAChE5oE,EAAQykD,WAAazkD,EAAQikE,KAAO,EAAf,MACrBjkE,EAAQylD,WAAazlD,EAAQskE,KAAO,EAAf,MAErB,IAAIuE,EAAQ,EAAQ,MAChBC,EAAWhiE,OAAOC,KAAK8hE,GACvBE,EAAS,CAAC,OAAQ,SAAU,SAAU,SAAU,SAAU,MAAO,UAAUlkE,OAAOikE,GACtF9oE,EAAQgpE,UAAY,WAClB,OAAOD,GAGT,IAAIj4D,EAAI,EAAQ,MAChB9Q,EAAQipE,OAASn4D,EAAEm4D,OACnBjpE,EAAQkpE,WAAap4D,EAAEo4D,WAEvB,IAAI/rB,EAAM,EAAQ,MAElBn9C,EAAQs/C,OAASnC,EAAImC,OACrBt/C,EAAQq/C,aAAelC,EAAIkC,aAC3Br/C,EAAQw/C,SAAWrC,EAAIqC,SACvBx/C,EAAQu/C,eAAiBpC,EAAIoC,eAC7Bv/C,EAAQ0/C,SAAWvC,EAAIuC,SACvB1/C,EAAQy/C,eAAiBtC,EAAIsC,eAC7Bz/C,EAAQ4/C,WAAazC,EAAIyC,WACzB5/C,EAAQ2/C,iBAAmBxC,EAAIwC,iBAC/B3/C,EAAQ8/C,WAAa3C,EAAI2C,WACzB9/C,EAAQ6/C,YAAc1C,EAAI0C,YAE1B,IAAIspB,EAAK,EAAQ,MAEjBnpE,EAAQopE,mBAAqBD,EAAGC,mBAChCppE,EAAQqpE,yBAA2BF,EAAGE,yBACtCrpE,EAAQspE,iBAAmBH,EAAGG,iBAC9BtpE,EAAQilC,oBAAsBkkC,EAAGlkC,oBACjCjlC,EAAQupE,cAAgBJ,EAAGI,cAE3B,IAAI94D,EAAO,EAAQ,MAEnBzQ,EAAQqlD,WAAa50C,EAAK40C,WAC1BrlD,EAAQ4kD,KAAOn0C,EAAKm0C,KACpB5kD,EAAQslD,aAAe70C,EAAK60C,aAC5BtlD,EAAQolD,OAAS30C,EAAK20C,OAEtBplD,EAAQwpE,WAAa,EAArB,MAEA,IAAIC,EAAgB,EAAQ,MAE5BzpE,EAAQypE,cAAgBA,EAAcA,cACtCzpE,EAAQ0pE,eAAiBD,EAAcC,eACvC1pE,EAAQ2pE,cAAgBF,EAAcE,cACtC3pE,EAAQ4pE,eAAiBH,EAAcG,eAevC,IAAIC,EAAK,EAAQ,MAEjB7pE,EAAQ8pE,WAAaD,EAAGC,WACxB9pE,EAAQ+pE,eAAiBF,EAAGE,eAE5B/pE,EAAQgqE,kBAAoB,WAC1B,MAAM,IAAIzpE,MAAM,CACd,kDACA,0BACA,0DACA4D,KAAK,QAGTnE,EAAQe,UAAY,CAClB,0BAA6B,EAC7B,qBAAwB,EACxB,6BAAgC,EAChC,0BAA6B,EAC7B,YAAe,EACf,aAAgB,EAChB,kBAAqB,EACrB,mBAAsB,EACtB,eAAkB,EAClB,uBAA0B,EAC1B,iBAAoB,EACpB,sBAAyB,EACzB,4BAA+B,EAC/B,8BAAiC,EACjC,wBAA2B,2CCzF7Bf,EAAQiqE,WA2IR,SAAoB9kE,GAQnB,GAPAA,EAAK,IAAM7D,KAAK4oE,UAAY,KAAO,IAClC5oE,KAAK6oE,WACJ7oE,KAAK4oE,UAAY,MAAQ,KAC1B/kE,EAAK,IACJ7D,KAAK4oE,UAAY,MAAQ,KAC1B,IAAMnqE,EAAOC,QAAQoqE,SAAS9oE,KAAK+gB,OAE/B/gB,KAAK4oE,UACT,OAGD,MAAMp4D,EAAI,UAAYxQ,KAAK+oE,MAC3BllE,EAAK0K,OAAO,EAAG,EAAGiC,EAAG,kBAKrB,IAAI5G,EAAQ,EACRo/D,EAAQ,EACZnlE,EAAK,GAAG+J,QAAQ,eAAe/F,IAChB,OAAVA,IAGJ+B,IACc,OAAV/B,IAGHmhE,EAAQp/D,OAIV/F,EAAK0K,OAAOy6D,EAAO,EAAGx4D,IA1KvB9R,EAAQwD,KA6LR,SAAc+mE,GACb,IACKA,EACHvqE,EAAQwqE,QAAQC,QAAQ,QAASF,GAEjCvqE,EAAQwqE,QAAQE,WAAW,SAE3B,MAAO7nE,MAnMV7C,EAAQ2qE,KA+MR,WACC,IAAI14D,EACJ,IACCA,EAAIjS,EAAQwqE,QAAQI,QAAQ,SAC3B,MAAO/nE,IAUT,OAJKoP,QAAwB,IAAZkZ,GAA2B,QAASA,IACpDlZ,EAAIkZ,EAAQ0/C,IAAIC,OAGV74D,GA5NRjS,EAAQkqE,UAyGR,WAIC,QAAsB,oBAAXv4D,SAA0BA,OAAOwZ,SAAoC,aAAxBxZ,OAAOwZ,QAAQ7hB,OAAuBqI,OAAOwZ,QAAQ4/C,UAKpF,oBAAd3J,YAA6BA,UAAU7vB,YAAa6vB,UAAU7vB,UAAUpI,cAAchgC,MAAM,4BAM3E,oBAAb6hE,UAA4BA,SAASC,iBAAmBD,SAASC,gBAAgBC,OAASF,SAASC,gBAAgBC,MAAMC,kBAEpH,oBAAXx5D,QAA0BA,OAAO0Z,UAAY1Z,OAAO0Z,QAAQ+/C,SAAYz5D,OAAO0Z,QAAQggD,WAAa15D,OAAO0Z,QAAQ2wC,QAGrG,oBAAdoF,WAA6BA,UAAU7vB,WAAa6vB,UAAU7vB,UAAUpI,cAAchgC,MAAM,mBAAqBy2B,SAAS5G,OAAOsyC,GAAI,KAAO,IAE9H,oBAAdlK,WAA6BA,UAAU7vB,WAAa6vB,UAAU7vB,UAAUpI,cAAchgC,MAAM,wBA9HtGnJ,EAAQwqE,QAyOR,WACC,IAGC,OAAOe,aACN,MAAO1oE,KA9OQ2oE,GAClBxrE,EAAQ8mC,QAAU,MACjB,IAAI5c,GAAS,EAEb,MAAO,KACDA,IACJA,GAAS,EACTmB,EAAQH,KAAK,4IANE,GAelBlrB,EAAQyrE,OAAS,CAChB,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,UACA,WAsFDzrE,EAAQmzB,IAAM9H,EAAQ0V,OAAS1V,EAAQ8H,KAAO,SAkE9CpzB,EAAOC,QAAU,EAAQ,KAAR,CAAoBA,GAErC,MAAM,WAAC0rE,GAAc3rE,EAAOC,QAM5B0rE,EAAW9+D,EAAI,SAAUytC,GACxB,IACC,OAAOnwC,KAAKC,UAAUkwC,GACrB,MAAOx3C,GACR,MAAO,+BAAiCA,EAAM2I,wCCOhDzL,EAAOC,QA3QP,SAAe6qE,GAqDd,SAASc,EAAYxB,GACpB,IAAIyB,EAEAC,EACAC,EAFAC,EAAiB,KAIrB,SAAShrC,KAAS57B,GAEjB,IAAK47B,EAAMirC,QACV,OAGD,MAAM/3D,EAAO8sB,EAGPkrC,EAAOxrE,OAAO,IAAI8N,MAClBm4B,EAAKulC,GAAQL,GAAYK,GAC/Bh4D,EAAKoO,KAAOqkB,EACZzyB,EAAK9I,KAAOygE,EACZ33D,EAAKg4D,KAAOA,EACZL,EAAWK,EAEX9mE,EAAK,GAAKwmE,EAAYO,OAAO/mE,EAAK,IAEX,iBAAZA,EAAK,IAEfA,EAAKuL,QAAQ,MAId,IAAIxF,EAAQ,EACZ/F,EAAK,GAAKA,EAAK,GAAG+J,QAAQ,iBAAiB,CAAC/F,EAAO63D,KAElD,GAAc,OAAV73D,EACH,MAAO,IAER+B,IACA,MAAMihE,EAAYR,EAAYD,WAAW1K,GACzC,GAAyB,mBAAdmL,EAA0B,CACpC,MAAMllE,EAAM9B,EAAK+F,GACjB/B,EAAQgjE,EAAUtqE,KAAKoS,EAAMhN,GAG7B9B,EAAK0K,OAAO3E,EAAO,GACnBA,IAED,OAAO/B,KAIRwiE,EAAY1B,WAAWpoE,KAAKoS,EAAM9O,IAEpB8O,EAAKkf,KAAOw4C,EAAYx4C,KAChC7sB,MAAM2N,EAAM9O,GAiCnB,OA9BA47B,EAAMopC,UAAYA,EAClBppC,EAAMmpC,UAAYyB,EAAYzB,YAC9BnpC,EAAMspC,MAAQsB,EAAYS,YAAYjC,GACtCppC,EAAMsrC,OAASA,EACftrC,EAAM+F,QAAU6kC,EAAY7kC,QAE5BhgC,OAAO8nB,eAAemS,EAAO,UAAW,CACvClS,YAAY,EACZC,cAAc,EACdpuB,IAAK,IACmB,OAAnBqrE,EACIA,GAEJF,IAAoBF,EAAYpB,aACnCsB,EAAkBF,EAAYpB,WAC9BuB,EAAeH,EAAYK,QAAQ7B,IAG7B2B,GAERtrE,IAAK65C,IACJ0xB,EAAiB1xB,KAKa,mBAArBsxB,EAAYpgB,MACtBogB,EAAYpgB,KAAKxqB,GAGXA,EAGR,SAASsrC,EAAOlC,EAAWmC,GAC1B,MAAMC,EAAWZ,EAAYrqE,KAAK6oE,gBAAkC,IAAdmC,EAA4B,IAAMA,GAAanC,GAErG,OADAoC,EAASp5C,IAAM7xB,KAAK6xB,IACbo5C,EAyFR,SAASC,EAAYC,GACpB,OAAOA,EAAOl/D,WACZqjB,UAAU,EAAG67C,EAAOl/D,WAAW3K,OAAS,GACxCsM,QAAQ,UAAW,KA2BtB,OAvQAy8D,EAAY5qC,MAAQ4qC,EACpBA,EAAYe,QAAUf,EACtBA,EAAYO,OAoPZ,SAAgBjlE,GACf,OAAIA,aAAe1G,MACX0G,EAAIwE,OAASxE,EAAIuE,QAElBvE,GAvPR0kE,EAAYgB,QAwLZ,WACC,MAAMpC,EAAa,IACfoB,EAAYiB,MAAM1pE,IAAIspE,MACtBb,EAAYkB,MAAM3pE,IAAIspE,GAAatpE,KAAIinE,GAAa,IAAMA,KAC5DhmE,KAAK,KAEP,OADAwnE,EAAYtlC,OAAO,IACZkkC,GA7LRoB,EAAYtlC,OAsJZ,SAAgBkkC,GAOf,IAAI59D,EANJg/D,EAAYnoE,KAAK+mE,GACjBoB,EAAYpB,WAAaA,EAEzBoB,EAAYiB,MAAQ,GACpBjB,EAAYkB,MAAQ,GAGpB,MAAMj+D,GAA+B,iBAAf27D,EAA0BA,EAAa,IAAI37D,MAAM,UACjElC,EAAMkC,EAAMhM,OAElB,IAAK+J,EAAI,EAAGA,EAAID,EAAKC,IACfiC,EAAMjC,KAOW,OAFtB49D,EAAa37D,EAAMjC,GAAGuC,QAAQ,MAAO,QAEtB,GACdy8D,EAAYkB,MAAMxmE,KAAK,IAAI2yB,OAAO,IAAMuxC,EAAW/0C,OAAO,GAAK,MAE/Dm2C,EAAYiB,MAAMvmE,KAAK,IAAI2yB,OAAO,IAAMuxC,EAAa,QA3KxDoB,EAAYK,QAsMZ,SAAiB5qE,GAChB,GAA8B,MAA1BA,EAAKA,EAAKwB,OAAS,GACtB,OAAO,EAGR,IAAI+J,EACAD,EAEJ,IAAKC,EAAI,EAAGD,EAAMi/D,EAAYkB,MAAMjqE,OAAQ+J,EAAID,EAAKC,IACpD,GAAIg/D,EAAYkB,MAAMlgE,GAAGhE,KAAKvH,GAC7B,OAAO,EAIT,IAAKuL,EAAI,EAAGD,EAAMi/D,EAAYiB,MAAMhqE,OAAQ+J,EAAID,EAAKC,IACpD,GAAIg/D,EAAYiB,MAAMjgE,GAAGhE,KAAKvH,GAC7B,OAAO,EAIT,OAAO,GAzNRuqE,EAAYvB,SAAW,EAAQ,MAC/BuB,EAAY7kC,QA0PZ,WACCzb,EAAQH,KAAK,0IAzPdpkB,OAAOC,KAAK8jE,GAAKvmE,SAAQqB,IACxBgmE,EAAYhmE,GAAOklE,EAAIllE,MAOxBgmE,EAAYiB,MAAQ,GACpBjB,EAAYkB,MAAQ,GAOpBlB,EAAYD,WAAa,GAkBzBC,EAAYS,YAVZ,SAAqBjC,GACpB,IAAInlB,EAAO,EAEX,IAAK,IAAIr4C,EAAI,EAAGA,EAAIw9D,EAAUvnE,OAAQ+J,IACrCq4C,GAASA,GAAQ,GAAKA,EAAQmlB,EAAUx6D,WAAWhD,GACnDq4C,GAAQ,EAGT,OAAO2mB,EAAYF,OAAOr5D,KAAKgE,IAAI4uC,GAAQ2mB,EAAYF,OAAO7oE,SA4N/D+oE,EAAYtlC,OAAOslC,EAAYhB,QAExBgB,gCC5QR,IAAI5kE,EAAO,EAAQ,MACf+lE,EAA+B,mBAAXjkD,QAAkD,iBAAlBA,OAAO,OAE3DkkD,EAAQjmE,OAAOvF,UAAUgM,SACzB1I,EAAS7B,MAAMzB,UAAUsD,OACzBmoE,EAAqBlmE,OAAO8nB,eAmB5Bq+C,EAAsBD,GAbY,WACrC,IAAIxnE,EAAM,GACV,IAGC,IAAK,IAAIua,KAFTitD,EAAmBxnE,EAAK,IAAK,CAAEqpB,YAAY,EAAO9rB,MAAOyC,IAE3CA,EACb,OAAO,EAER,OAAOA,EAAIgY,IAAMhY,EAChB,MAAOwC,GACR,OAAO,GAGuCklE,GAE5Ct+C,EAAiB,SAAUqyC,EAAQ7/D,EAAM2B,EAAOoqE,GAnBnC,IAAU5iD,KAoBtBnpB,KAAQ6/D,IAnBS,mBADK12C,EAoBS4iD,IAnBmB,sBAAnBJ,EAAMlrE,KAAK0oB,IAmBI4iD,OAG9CF,EACHD,EAAmB/L,EAAQ7/D,EAAM,CAChC0tB,cAAc,EACdD,YAAY,EACZ9rB,MAAOA,EACPgsB,UAAU,IAGXkyC,EAAO7/D,GAAQ2B,IAIb20C,EAAmB,SAAUupB,EAAQ/9D,GACxC,IAAIkqE,EAAa7mE,UAAU3D,OAAS,EAAI2D,UAAU,GAAK,GACnD2oB,EAAQnoB,EAAK7D,GACb4pE,IACH59C,EAAQrqB,EAAOhD,KAAKqtB,EAAOpoB,OAAO2tB,sBAAsBvxB,KAEzD,IAAK,IAAIyJ,EAAI,EAAGA,EAAIuiB,EAAMtsB,OAAQ+J,GAAK,EACtCiiB,EAAeqyC,EAAQ/xC,EAAMviB,GAAIzJ,EAAIgsB,EAAMviB,IAAKygE,EAAWl+C,EAAMviB,MAInE+qC,EAAiBu1B,sBAAwBA,EAEzCltE,EAAOC,QAAU03C,+BCvDjB13C,EAAQqtE,MAAQ,EAAhB,MACArtE,EAAQs/C,OAAS,EAAjB,MACAt/C,EAAQ0iD,IAAM,EAAd,KACA1iD,EAAQmiD,IAAM,EAAd,MACAniD,EAAQkjD,IAAM,EAAd,kCCJA,IAAIx+C,EAAS,EAAQ,MACjBxD,EAAW,EAAQ,MAEnBg1D,EAAQ,GAEZ,SAASoX,EAAS/vB,GAChB74C,EAAOiC,MAAM42C,EAAG36C,OAAQ,EAAG,qBAE3BtB,KAAKi8C,GAAK,IAAIv6C,MAAM,GACpB,IAAK,IAAI2J,EAAI,EAAGA,EAAIrL,KAAKi8C,GAAG36C,OAAQ+J,IAClCrL,KAAKi8C,GAAG5wC,GAAK4wC,EAAG5wC,GAuBpB3M,EAAQijD,YApBR,SAAqBxhD,GACnB,SAAS0gD,EAAIhgD,GACXV,EAAKI,KAAKP,KAAMa,GAChBb,KAAKisE,WAEPrsE,EAASihD,EAAK1gD,GAGd,IADA,IAAIsF,EAAOD,OAAOC,KAAKmvD,GACdvpD,EAAI,EAAGA,EAAI5F,EAAKnE,OAAQ+J,IAAK,CACpC,IAAIhH,EAAMoB,EAAK4F,GACfw1C,EAAI5gD,UAAUoE,GAAOuwD,EAAMvwD,GAO7B,OAJAw8C,EAAIryB,OAAS,SAAgB3tB,GAC3B,OAAO,IAAIggD,EAAIhgD,IAGVggD,GAKT+T,EAAMqX,SAAW,WACf,IAAIxoE,EAAQ,IAAIuoE,EAAShsE,KAAKa,QAAQo7C,IACtCj8C,KAAKksE,UAAYzoE,GAGnBmxD,EAAM1X,QAAU,SAAiBivB,EAAKjc,EAAOptD,EAAKspE,GAChD,IAAI3oE,EAAQzD,KAAKksE,UACbG,EAAarsE,KAAKiC,YAAY0N,OAAO1P,UAErCg8C,EAAKx4C,EAAMw4C,GACf,GAAkB,YAAdj8C,KAAKgI,KAAoB,CAC3B,IAAK,IAAIqD,EAAI,EAAGA,EAAIrL,KAAK66C,UAAWxvC,IAClC4wC,EAAG5wC,IAAM8gE,EAAIjc,EAAQ7kD,GAIvB,IAFAghE,EAAWnvB,QAAQ38C,KAAKP,KAAMi8C,EAAI,EAAGn5C,EAAKspE,GAEjC/gE,EAAI,EAAGA,EAAIrL,KAAK66C,UAAWxvC,IAClC4wC,EAAG5wC,GAAKvI,EAAIspE,EAAS/gE,OAClB,CAGL,IAFAghE,EAAWnvB,QAAQ38C,KAAKP,KAAMmsE,EAAKjc,EAAOptD,EAAKspE,GAEtC/gE,EAAI,EAAGA,EAAIrL,KAAK66C,UAAWxvC,IAClCvI,EAAIspE,EAAS/gE,IAAM4wC,EAAG5wC,GAExB,IAASA,EAAI,EAAGA,EAAIrL,KAAK66C,UAAWxvC,IAClC4wC,EAAG5wC,GAAK8gE,EAAIjc,EAAQ7kD,kCC5D1B,IAAIjI,EAAS,EAAQ,MAErB,SAAS46C,EAAOn9C,GACdb,KAAKa,QAAUA,EAEfb,KAAKgI,KAAOhI,KAAKa,QAAQmH,KACzBhI,KAAK66C,UAAY,EACjB76C,KAAKkF,QAELlF,KAAKuL,OAAS,IAAI7J,MAAM1B,KAAK66C,WAC7B76C,KAAKssE,UAAY,EAEnB7tE,EAAOC,QAAUs/C,EAEjBA,EAAO/9C,UAAUiF,MAAQ,aAIzB84C,EAAO/9C,UAAUmxC,OAAS,SAAgBxwC,GACxC,OAAoB,IAAhBA,EAAKU,OACA,GAES,YAAdtB,KAAKgI,KACAhI,KAAKusE,eAAe3rE,GAEpBZ,KAAKwsE,eAAe5rE,IAG/Bo9C,EAAO/9C,UAAUsjC,QAAU,SAAiB3iC,EAAM6Q,GAGhD,IADA,IAAI1E,EAAM+D,KAAK/D,IAAI/M,KAAKuL,OAAOjK,OAAStB,KAAKssE,UAAW1rE,EAAKU,OAASmQ,GAC7DpG,EAAI,EAAGA,EAAI0B,EAAK1B,IACvBrL,KAAKuL,OAAOvL,KAAKssE,UAAYjhE,GAAKzK,EAAK6Q,EAAMpG,GAI/C,OAHArL,KAAKssE,WAAav/D,EAGXA,GAGTixC,EAAO/9C,UAAUwsE,aAAe,SAAsB3pE,EAAK2O,GAGzD,OAFAzR,KAAKk9C,QAAQl9C,KAAKuL,OAAQ,EAAGzI,EAAK2O,GAClCzR,KAAKssE,UAAY,EACVtsE,KAAK66C,WAGdmD,EAAO/9C,UAAUusE,eAAiB,SAAwB5rE,GACxD,IAAI8rE,EAAW,EACXC,EAAY,EAEZj7C,GAAU1xB,KAAKssE,UAAY1rE,EAAKU,QAAUtB,KAAK66C,UAAa,EAC5D/3C,EAAM,IAAIpB,MAAMgwB,EAAQ1xB,KAAK66C,WAEV,IAAnB76C,KAAKssE,YACPI,GAAY1sE,KAAKujC,QAAQ3iC,EAAM8rE,GAE3B1sE,KAAKssE,YAActsE,KAAKuL,OAAOjK,SACjCqrE,GAAa3sE,KAAKysE,aAAa3pE,EAAK6pE,KAKxC,IADA,IAAI57D,EAAMnQ,EAAKU,QAAWV,EAAKU,OAASorE,GAAY1sE,KAAK66C,UAClD6xB,EAAW37D,EAAK27D,GAAY1sE,KAAK66C,UACtC76C,KAAKk9C,QAAQt8C,EAAM8rE,EAAU5pE,EAAK6pE,GAClCA,GAAa3sE,KAAK66C,UAIpB,KAAO6xB,EAAW9rE,EAAKU,OAAQorE,IAAY1sE,KAAKssE,YAC9CtsE,KAAKuL,OAAOvL,KAAKssE,WAAa1rE,EAAK8rE,GAErC,OAAO5pE,GAGTk7C,EAAO/9C,UAAUssE,eAAiB,SAAwB3rE,GAQxD,IAPA,IAAI8rE,EAAW,EACXC,EAAY,EAEZj7C,EAAQ5gB,KAAKS,MAAMvR,KAAKssE,UAAY1rE,EAAKU,QAAUtB,KAAK66C,WAAa,EACrE/3C,EAAM,IAAIpB,MAAMgwB,EAAQ1xB,KAAK66C,WAG1BnpB,EAAQ,EAAGA,IAChBg7C,GAAY1sE,KAAKujC,QAAQ3iC,EAAM8rE,GAC/BC,GAAa3sE,KAAKysE,aAAa3pE,EAAK6pE,GAMtC,OAFAD,GAAY1sE,KAAKujC,QAAQ3iC,EAAM8rE,GAExB5pE,GAGTk7C,EAAO/9C,UAAUs9C,MAAQ,SAAehyC,GACtC,IAAIiB,EAIA0yC,EAMJ,OATI3zC,IACFiB,EAAQxM,KAAKoxC,OAAO7lC,IAIpB2zC,EADgB,YAAdl/C,KAAKgI,KACAhI,KAAK4sE,gBAEL5sE,KAAK6sE,gBAEVrgE,EACKA,EAAMjJ,OAAO27C,GAEbA,GAGXlB,EAAO/9C,UAAU6sE,KAAO,SAAcvhE,EAAQkG,GAC5C,GAAY,IAARA,EACF,OAAO,EAET,KAAOA,EAAMlG,EAAOjK,QAClBiK,EAAOkG,KAAS,EAElB,OAAO,GAGTusC,EAAO/9C,UAAU2sE,cAAgB,WAC/B,IAAK5sE,KAAK8sE,KAAK9sE,KAAKuL,OAAQvL,KAAKssE,WAC/B,MAAO,GAET,IAAIxpE,EAAM,IAAIpB,MAAM1B,KAAK66C,WAEzB,OADA76C,KAAKk9C,QAAQl9C,KAAKuL,OAAQ,EAAGzI,EAAK,GAC3BA,GAGTk7C,EAAO/9C,UAAU8sE,OAAS,SAAgBxhE,GACxC,OAAOA,GAGTyyC,EAAO/9C,UAAU4sE,cAAgB,WAC/BzpE,EAAOiC,MAAMrF,KAAKssE,UAAWtsE,KAAK66C,UAAW,8BAC7C,IAAI/3C,EAAM,IAAIpB,MAAM1B,KAAK66C,WAGzB,OAFA76C,KAAKysE,aAAa3pE,EAAK,GAEhB9C,KAAK+sE,OAAOjqE,gCCzIrB,IAAIM,EAAS,EAAQ,MACjBxD,EAAW,EAAQ,MAEnBmsE,EAAQ,EAAQ,MAChB/tB,EAAS,EAAQ,MAErB,SAASgvB,IACPhtE,KAAK0M,IAAM,IAAIhL,MAAM,GACrB1B,KAAKyF,KAAO,KAGd,SAAS27C,EAAIvgD,GACXm9C,EAAOz9C,KAAKP,KAAMa,GAElB,IAAI4C,EAAQ,IAAIupE,EAChBhtE,KAAKitE,UAAYxpE,EAEjBzD,KAAKktE,WAAWzpE,EAAO5C,EAAQwD,KAEjCzE,EAASwhD,EAAKpD,GACdv/C,EAAOC,QAAU0iD,EAEjBA,EAAI5yB,OAAS,SAAgB3tB,GAC3B,OAAO,IAAIugD,EAAIvgD,IAGjB,IAAIssE,EAAa,CACf,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EACrB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGvB/rB,EAAInhD,UAAUitE,WAAa,SAAoBzpE,EAAOY,GACpDZ,EAAMgC,KAAO,IAAI/D,MAAM,IAEvB0B,EAAOiC,MAAMhB,EAAI/C,OAAQtB,KAAK66C,UAAW,sBAEzC,IAAIuyB,EAAKrB,EAAM5+B,aAAa9oC,EAAK,GAC7BgpE,EAAKtB,EAAM5+B,aAAa9oC,EAAK,GAEjC0nE,EAAMuB,IAAIF,EAAIC,EAAI5pE,EAAMiJ,IAAK,GAC7B0gE,EAAK3pE,EAAMiJ,IAAI,GACf2gE,EAAK5pE,EAAMiJ,IAAI,GACf,IAAK,IAAIrB,EAAI,EAAGA,EAAI5H,EAAMgC,KAAKnE,OAAQ+J,GAAK,EAAG,CAC7C,IAAIsV,EAAQwsD,EAAW9hE,IAAM,GAC7B+hE,EAAKrB,EAAMwB,OAAOH,EAAIzsD,GACtB0sD,EAAKtB,EAAMwB,OAAOF,EAAI1sD,GACtBorD,EAAMyB,IAAIJ,EAAIC,EAAI5pE,EAAMgC,KAAM4F,KAIlC+1C,EAAInhD,UAAUi9C,QAAU,SAAiBivB,EAAKjc,EAAOptD,EAAKspE,GACxD,IAAI3oE,EAAQzD,KAAKitE,UAEbxwD,EAAIsvD,EAAM5+B,aAAag/B,EAAKjc,GAC5Bv/C,EAAIo7D,EAAM5+B,aAAag/B,EAAKjc,EAAQ,GAGxC6b,EAAM0B,GAAGhxD,EAAG9L,EAAGlN,EAAMiJ,IAAK,GAC1B+P,EAAIhZ,EAAMiJ,IAAI,GACdiE,EAAIlN,EAAMiJ,IAAI,GAEI,YAAd1M,KAAKgI,KACPhI,KAAKsqC,SAAS7mC,EAAOgZ,EAAG9L,EAAGlN,EAAMiJ,IAAK,GAEtC1M,KAAKysC,SAAShpC,EAAOgZ,EAAG9L,EAAGlN,EAAMiJ,IAAK,GAExC+P,EAAIhZ,EAAMiJ,IAAI,GACdiE,EAAIlN,EAAMiJ,IAAI,GAEdq/D,EAAM1hC,cAAcvnC,EAAK2Z,EAAG2vD,GAC5BL,EAAM1hC,cAAcvnC,EAAK6N,EAAGy7D,EAAS,IAGvChrB,EAAInhD,UAAU6sE,KAAO,SAAcvhE,EAAQkG,GAEzC,IADA,IAAIhQ,EAAQ8J,EAAOjK,OAASmQ,EACnBpG,EAAIoG,EAAKpG,EAAIE,EAAOjK,OAAQ+J,IACnCE,EAAOF,GAAK5J,EAEd,OAAO,GAGT2/C,EAAInhD,UAAU8sE,OAAS,SAAgBxhE,GAErC,IADA,IAAI60C,EAAM70C,EAAOA,EAAOjK,OAAS,GACxB+J,EAAIE,EAAOjK,OAAS8+C,EAAK/0C,EAAIE,EAAOjK,OAAQ+J,IACnDjI,EAAOiC,MAAMkG,EAAOF,GAAI+0C,GAE1B,OAAO70C,EAAO3I,MAAM,EAAG2I,EAAOjK,OAAS8+C,IAGzCgB,EAAInhD,UAAUqqC,SAAW,SAAkB7mC,EAAOiqE,EAAQC,EAAQ7qE,EAAK2O,GAKrE,IAJA,IAAIgL,EAAIixD,EACJ/8D,EAAIg9D,EAGCtiE,EAAI,EAAGA,EAAI5H,EAAMgC,KAAKnE,OAAQ+J,GAAK,EAAG,CAC7C,IAAIuiE,EAAOnqE,EAAMgC,KAAK4F,GAClBwiE,EAAOpqE,EAAMgC,KAAK4F,EAAI,GAG1B0gE,EAAM+B,OAAOn9D,EAAGlN,EAAMiJ,IAAK,GAE3BkhE,GAAQnqE,EAAMiJ,IAAI,GAClBmhE,GAAQpqE,EAAMiJ,IAAI,GAClB,IAAIyQ,EAAI4uD,EAAMgC,WAAWH,EAAMC,GAG3Bt5D,EAAI5D,EACRA,GAAK8L,EAHGsvD,EAAMnvD,QAAQO,MAGN,EAChBV,EAAIlI,EAINw3D,EAAMiC,IAAIr9D,EAAG8L,EAAG3Z,EAAK2O,IAGvB2vC,EAAInhD,UAAUwsC,SAAW,SAAkBhpC,EAAOiqE,EAAQC,EAAQ7qE,EAAK2O,GAKrE,IAJA,IAAIgL,EAAIkxD,EACJh9D,EAAI+8D,EAGCriE,EAAI5H,EAAMgC,KAAKnE,OAAS,EAAG+J,GAAK,EAAGA,GAAK,EAAG,CAClD,IAAIuiE,EAAOnqE,EAAMgC,KAAK4F,GAClBwiE,EAAOpqE,EAAMgC,KAAK4F,EAAI,GAG1B0gE,EAAM+B,OAAOrxD,EAAGhZ,EAAMiJ,IAAK,GAE3BkhE,GAAQnqE,EAAMiJ,IAAI,GAClBmhE,GAAQpqE,EAAMiJ,IAAI,GAClB,IAAIyQ,EAAI4uD,EAAMgC,WAAWH,EAAMC,GAG3Bt5D,EAAIkI,EACRA,GAAK9L,EAHGo7D,EAAMnvD,QAAQO,MAGN,EAChBxM,EAAI4D,EAINw3D,EAAMiC,IAAIvxD,EAAG9L,EAAG7N,EAAK2O,gCC1IvB,IAAIrO,EAAS,EAAQ,MACjBxD,EAAW,EAAQ,MAEnBo+C,EAAS,EAAQ,MACjBoD,EAAM,EAAQ,KAElB,SAAS6sB,EAASjmE,EAAM3D,GACtBjB,EAAOiC,MAAMhB,EAAI/C,OAAQ,GAAI,sBAE7B,IAAI4sE,EAAK7pE,EAAIzB,MAAM,EAAG,GAClBurE,EAAK9pE,EAAIzB,MAAM,EAAG,IAClBwrE,EAAK/pE,EAAIzB,MAAM,GAAI,IAGrB5C,KAAK49C,QADM,YAAT51C,EACa,CACbo5C,EAAI5yB,OAAO,CAAExmB,KAAM,UAAW3D,IAAK6pE,IACnC9sB,EAAI5yB,OAAO,CAAExmB,KAAM,UAAW3D,IAAK8pE,IACnC/sB,EAAI5yB,OAAO,CAAExmB,KAAM,UAAW3D,IAAK+pE,KAGtB,CACbhtB,EAAI5yB,OAAO,CAAExmB,KAAM,UAAW3D,IAAK+pE,IACnChtB,EAAI5yB,OAAO,CAAExmB,KAAM,UAAW3D,IAAK8pE,IACnC/sB,EAAI5yB,OAAO,CAAExmB,KAAM,UAAW3D,IAAK6pE,KAKzC,SAAStsB,EAAI/gD,GACXm9C,EAAOz9C,KAAKP,KAAMa,GAElB,IAAI4C,EAAQ,IAAIwqE,EAASjuE,KAAKgI,KAAMhI,KAAKa,QAAQwD,KACjDrE,KAAKquE,UAAY5qE,EAEnB7D,EAASgiD,EAAK5D,GAEdv/C,EAAOC,QAAUkjD,EAEjBA,EAAIpzB,OAAS,SAAgB3tB,GAC3B,OAAO,IAAI+gD,EAAI/gD,IAGjB+gD,EAAI3hD,UAAUi9C,QAAU,SAAiBivB,EAAKjc,EAAOptD,EAAKspE,GACxD,IAAI3oE,EAAQzD,KAAKquE,UAEjB5qE,EAAMm6C,QAAQ,GAAGV,QAAQivB,EAAKjc,EAAOptD,EAAKspE,GAC1C3oE,EAAMm6C,QAAQ,GAAGV,QAAQp6C,EAAKspE,EAAQtpE,EAAKspE,GAC3C3oE,EAAMm6C,QAAQ,GAAGV,QAAQp6C,EAAKspE,EAAQtpE,EAAKspE,IAG7CxqB,EAAI3hD,UAAU6sE,KAAO1rB,EAAInhD,UAAU6sE,KACnClrB,EAAI3hD,UAAU8sE,OAAS3rB,EAAInhD,UAAU8sE,kCCnDrCruE,EAAQyuC,aAAe,SAAsBzqC,EAAO+O,GAKlD,OAJY/O,EAAM,EAAI+O,IAAQ,GAClB/O,EAAM,EAAI+O,IAAQ,GAClB/O,EAAM,EAAI+O,IAAQ,EACnB/O,EAAM,EAAI+O,MACN,GAGjB/S,EAAQ2rC,cAAgB,SAAuB3nC,EAAOjB,EAAOgQ,GAC3D/O,EAAM,EAAI+O,GAAOhQ,IAAU,GAC3BiB,EAAM,EAAI+O,GAAQhQ,IAAU,GAAM,IAClCiB,EAAM,EAAI+O,GAAQhQ,IAAU,EAAK,IACjCiB,EAAM,EAAI+O,GAAe,IAARhQ,GAGnB/C,EAAQ+uE,GAAK,SAAYa,EAAKC,EAAKzrE,EAAK2O,GAItC,IAHA,IAAI+8D,EAAO,EACPC,EAAO,EAEFpjE,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAC9B,IAAK,IAAIC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BkjE,IAAS,EACTA,GAASD,IAASjjE,EAAID,EAAM,EAE9B,IAASC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BkjE,IAAS,EACTA,GAASF,IAAShjE,EAAID,EAAM,EAIhC,IAASA,EAAI,EAAGA,GAAK,EAAGA,GAAK,EAAG,CAC9B,IAASC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BmjE,IAAS,EACTA,GAASF,IAASjjE,EAAID,EAAM,EAE9B,IAASC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BmjE,IAAS,EACTA,GAASH,IAAShjE,EAAID,EAAM,EAIhCvI,EAAI2O,EAAM,GAAK+8D,IAAS,EACxB1rE,EAAI2O,EAAM,GAAKg9D,IAAS,GAG1B/vE,EAAQsvE,IAAM,SAAaM,EAAKC,EAAKzrE,EAAK2O,GAIxC,IAHA,IAAI+8D,EAAO,EACPC,EAAO,EAEFpjE,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAIC,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5BkjE,IAAS,EACTA,GAASD,IAASjjE,EAAID,EAAM,EAC5BmjE,IAAS,EACTA,GAASF,IAAShjE,EAAID,EAAM,EAGhC,IAASA,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAASC,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5BmjE,IAAS,EACTA,GAASF,IAASjjE,EAAID,EAAM,EAC5BojE,IAAS,EACTA,GAASH,IAAShjE,EAAID,EAAM,EAIhCvI,EAAI2O,EAAM,GAAK+8D,IAAS,EACxB1rE,EAAI2O,EAAM,GAAKg9D,IAAS,GAG1B/vE,EAAQ4uE,IAAM,SAAagB,EAAKC,EAAKzrE,EAAK2O,GAQxC,IAPA,IAAI+8D,EAAO,EACPC,EAAO,EAMFpjE,EAAI,EAAGA,GAAK,EAAGA,IAAK,CAC3B,IAAK,IAAIC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BkjE,IAAS,EACTA,GAASD,GAAQjjE,EAAID,EAAM,EAE7B,IAASC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BkjE,IAAS,EACTA,GAASF,GAAQhjE,EAAID,EAAM,EAG/B,IAASC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BkjE,IAAS,EACTA,GAASD,GAAQjjE,EAAID,EAAM,EAO7B,IAASA,EAAI,EAAGA,GAAK,EAAGA,IAAK,CAC3B,IAASC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BmjE,IAAS,EACTA,GAASF,GAAQjjE,EAAID,EAAM,EAE7B,IAASC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BmjE,IAAS,EACTA,GAASH,GAAQhjE,EAAID,EAAM,EAG/B,IAASC,EAAI,EAAGA,GAAK,GAAIA,GAAK,EAC5BmjE,IAAS,EACTA,GAASH,GAAQhjE,EAAID,EAAM,EAG7BvI,EAAI2O,EAAM,GAAK+8D,IAAS,EACxB1rE,EAAI2O,EAAM,GAAKg9D,IAAS,GAG1B/vE,EAAQ6uE,OAAS,SAAgB3nE,EAAK+a,GACpC,OAAS/a,GAAO+a,EAAS,UAAc/a,IAAS,GAAK+a,GAGvD,IAAI+tD,EAAW,CAEb,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAC3B,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GACzB,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAGzB,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GACzB,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EACzB,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,IAG5BhwE,EAAQ8uE,IAAM,SAAac,EAAKC,EAAKzrE,EAAK2O,GAKxC,IAJA,IAAI+8D,EAAO,EACPC,EAAO,EAEPrjE,EAAMsjE,EAASptE,SAAW,EACrB+J,EAAI,EAAGA,EAAID,EAAKC,IACvBmjE,IAAS,EACTA,GAASF,IAAQI,EAASrjE,GAAM,EAElC,IAASA,EAAID,EAAKC,EAAIqjE,EAASptE,OAAQ+J,IACrCojE,IAAS,EACTA,GAASF,IAAQG,EAASrjE,GAAM,EAGlCvI,EAAI2O,EAAM,GAAK+8D,IAAS,EACxB1rE,EAAI2O,EAAM,GAAKg9D,IAAS,GAG1B/vE,EAAQovE,OAAS,SAAgBn9D,EAAG7N,EAAK2O,GACvC,IAAI+8D,EAAO,EACPC,EAAO,EAEXD,GAAa,EAAJ79D,IAAU,EAAMA,IAAM,GAC/B,IAAK,IAAItF,EAAI,GAAIA,GAAK,GAAIA,GAAK,EAC7BmjE,IAAS,EACTA,GAAS79D,IAAMtF,EAAK,GAEtB,IAASA,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5BojE,GAAS99D,IAAMtF,EAAK,GACpBojE,IAAS,EAEXA,IAAc,GAAJ99D,IAAa,EAAMA,IAAM,GAEnC7N,EAAI2O,EAAM,GAAK+8D,IAAS,EACxB1rE,EAAI2O,EAAM,GAAKg9D,IAAS,GAG1B,IAAIE,EAAS,CACX,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EACpD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClD,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAClD,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAEnD,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACpD,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAElD,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GACjD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EACpD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EACjD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAEpD,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,EACnD,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EACpD,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAEjD,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EACpD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GACnD,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAElD,GAAI,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EACnD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAElD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GACnD,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,EAClD,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACpD,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAEjD,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EACnD,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAClD,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAGpDjwE,EAAQqvE,WAAa,SAAoBO,EAAKC,GAE5C,IADA,IAAIzrE,EAAM,EACDuI,EAAI,EAAGA,EAAI,EAAGA,IAIrBvI,IAAQ,EACRA,GAHS6rE,EAAW,GAAJtjE,GADPijE,IAAS,GAAS,EAAJjjE,EAAU,KAMnC,IAASA,EAAI,EAAGA,EAAI,EAAGA,IAIrBvI,IAAQ,EACRA,GAHS6rE,EAAO,IAAe,GAAJtjE,GADlBkjE,IAAS,GAAS,EAAJljE,EAAU,KAMnC,OAAOvI,IAAQ,GAGjB,IAAI8rE,EAAe,CACjB,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GACvD,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,GAG1DlwE,EAAQke,QAAU,SAAiBhX,GAEjC,IADA,IAAI9C,EAAM,EACDuI,EAAI,EAAGA,EAAIujE,EAAattE,OAAQ+J,IACvCvI,IAAQ,EACRA,GAAQ8C,IAAQgpE,EAAavjE,GAAM,EAErC,OAAOvI,IAAQ,GAGjBpE,EAAQmwE,SAAW,SAAkBjpE,EAAKhH,EAAMkwE,GAE9C,IADA,IAAIzlE,EAAMzD,EAAIqG,SAAS,GAChB5C,EAAI/H,OAAS1C,GAClByK,EAAM,IAAMA,EAGd,IADA,IAAIvG,EAAM,GACDuI,EAAI,EAAGA,EAAIzM,EAAMyM,GAAKyjE,EAC7BhsE,EAAIiC,KAAKsE,EAAIzG,MAAMyI,EAAGA,EAAIyjE,IAC5B,OAAOhsE,EAAID,KAAK,2CC9PdksE,EAAgB,EAAQ,MACxB5pD,EAAS,EAAQ,MAEjB6pD,EAAK,EAAQ,MASbC,EAAY,CACd,QAAU,EAAM,KAAO,EAAM,QAAU,GA2BzCvwE,EAAQopE,mBAAqBppE,EAAQqpE,yBAA2BrpE,EAAQspE,iBAnCxE,SAA2Bl2D,GACzB,IAAIgU,EAAQ,IAAI5kB,EAAOikB,EAAOrT,GAAKgU,MAAO,OACtCopD,EAAM,IAAIhuE,EAAOikB,EAAOrT,GAAKo9D,IAAK,OAEtC,OAAO,IAAIF,EAAGlpD,EAAOopD,IAgCvBxwE,EAAQilC,oBAAsBjlC,EAAQupE,cAzBtC,SAAStkC,EAAqB7d,EAAOrlB,EAAK0uE,EAAWC,GACnD,OAAIluE,EAAOE,SAASX,SAA2B2H,IAAnB6mE,EAAUxuE,GAC7BkjC,EAAoB7d,EAAO,SAAUrlB,EAAK0uE,IAGnD1uE,EAAMA,GAAO,SACb2uE,EAAOA,GAAQ,SACfD,EAAYA,GAAa,IAAIjuE,EAAO,CAAC,IAEhCA,EAAOE,SAAS+tE,KACnBA,EAAY,IAAIjuE,EAAOiuE,EAAWC,IAGf,iBAAVtpD,EACF,IAAIkpD,EAAGD,EAAcjpD,EAAOqpD,GAAYA,GAAW,IAGvDjuE,EAAOE,SAAS0kB,KACnBA,EAAQ,IAAI5kB,EAAO4kB,EAAOrlB,IAGrB,IAAIuuE,EAAGlpD,EAAOqpD,GAAW,2CCrC9Bt/D,EAAK,EAAQ,MAEbw/D,EAAc,IADA,EAAQ,OAEtBC,EAAa,IAAIz/D,EAAG,IACpB0/D,EAAS,IAAI1/D,EAAG,IAChB2/D,EAAM,IAAI3/D,EAAG,IACb4/D,EAAQ,IAAI5/D,EAAG,GACf6/D,EAAQ,IAAI7/D,EAAG,GACfsV,EAAS,EAAQ,MACjByzB,EAAc,EAAQ,MAG1B,SAASupB,EAAarc,EAAKrlD,GAMzB,OALAA,EAAMA,GAAO,OACRS,EAAOE,SAAS0kD,KACnBA,EAAM,IAAI5kD,EAAO4kD,EAAKrlD,IAExBT,KAAK2vE,KAAO,IAAI9/D,EAAGi2C,GACZ9lD,KAGT,SAASqiE,EAAcpgB,EAAMxhD,GAM3B,OALAA,EAAMA,GAAO,OACRS,EAAOE,SAAS6gD,KACnBA,EAAO,IAAI/gD,EAAO+gD,EAAMxhD,IAE1BT,KAAKsiE,MAAQ,IAAIzyD,EAAGoyC,GACbjiD,KAjBTvB,EAAOC,QAAUswE,EAoBjB,IAAIY,EAAa,GAsDjB,SAASZ,EAAGlpD,EAAOqpD,EAAWU,GAC5B7vE,KAAK8vE,aAAaX,GAClBnvE,KAAK+vE,QAAU,IAAIlgE,EAAGiW,GACtB9lB,KAAK+lB,OAASlW,EAAGuX,KAAKpnB,KAAK+vE,SAC3B/vE,KAAKgwE,UAAYlqD,EAAMxkB,OACvBtB,KAAK2vE,UAAOvnE,EACZpI,KAAKsiE,WAAQl6D,EACbpI,KAAKiwE,gBAAa7nE,EACdynE,GACF7vE,KAAKmiE,aAAeA,EACpBniE,KAAKqiE,cAAgBA,GAErBriE,KAAKiwE,WAAa,EA4DtB,SAAS7O,EAAkBC,EAAI5gE,GAC7B,IAAIuK,EAAM,IAAI9J,EAAOmgE,EAAGnyD,WACxB,OAAKzO,EAGIuK,EAAIiB,SAASxL,GAFbuK,EA5DXxF,OAAO8nB,eAAe0hD,EAAG/uE,UAAW,cAAe,CACjDstB,YAAY,EACZnuB,IAAK,WAIH,MAH+B,iBAApBY,KAAKiwE,aACdjwE,KAAKiwE,WAxEX,SAAoBnqD,EAAOqpD,GACzB,IAAID,EAAMC,EAAUljE,SAAS,OACzBikE,EAAM,CAAChB,EAAKppD,EAAM7Z,SAAS,KAAKpJ,KAAK,KACzC,GAAIqtE,KAAON,EACT,OAAOA,EAAWM,GAEpB,IAyBIC,EAzBA5uE,EAAQ,EAEZ,GAAIukB,EAAM7D,WACPkD,EAAOirD,cACPjrD,EAAOkrD,WAAWvqD,KAClBupD,EAAYhoE,KAAKye,GAclB,OAZAvkB,GAAS,EAKPA,GAHU,OAAR2tE,GAAwB,OAARA,EAGT,EAIA,EAEXU,EAAWM,GAAO3uE,EACXA,EAOT,OALK8tE,EAAYhoE,KAAKye,EAAM5F,KAAK,MAE/B3e,GAAS,GAGH2tE,GACN,IAAK,KACCppD,EAAMhU,IAAIw9D,GAAYp+D,IAAIq+D,KAE5BhuE,GAAS,GAEX,MACF,IAAK,MACH4uE,EAAMrqD,EAAMhU,IAAI09D,IACRt+D,IAAIu+D,IAAUU,EAAIj/D,IAAIw+D,KAE5BnuE,GAAS,GAEX,MACF,QACEA,GAAS,EAGb,OADAquE,EAAWM,GAAO3uE,EACXA,EAsBe+uE,CAAWtwE,KAAK+vE,QAAS/vE,KAAKuwE,QAE3CvwE,KAAKiwE,cAGhBjB,EAAG/uE,UAAU4jC,aAAe,WAK1B,OAJK7jC,KAAKsiE,QACRtiE,KAAKsiE,MAAQ,IAAIzyD,EAAG+oC,EAAY54C,KAAKgwE,aAEvChwE,KAAK2vE,KAAO3vE,KAAKwwE,KAAK7sD,MAAM3jB,KAAK+lB,QAAQb,OAAOllB,KAAKsiE,OAAOv+C,UACrD/jB,KAAK4hE,gBAGdoN,EAAG/uE,UAAUyqC,cAAgB,SAAUzZ,GAGrC,IAAIw/C,GADJx/C,GADAA,EAAQ,IAAIphB,EAAGohB,IACDtN,MAAM3jB,KAAK+lB,SACNb,OAAOllB,KAAKsiE,OAAOv+C,UAClCjhB,EAAM,IAAI5B,EAAOuvE,EAAOvhE,WACxB4W,EAAQ9lB,KAAK0wE,WACjB,GAAI5tE,EAAIxB,OAASwkB,EAAMxkB,OAAQ,CAC7B,IAAIqvE,EAAQ,IAAIzvE,EAAO4kB,EAAMxkB,OAASwB,EAAIxB,QAC1CqvE,EAAM9rB,KAAK,GACX/hD,EAAM5B,EAAOqC,OAAO,CAACotE,EAAO7tE,IAE9B,OAAOA,GAGTksE,EAAG/uE,UAAU2hE,aAAe,SAAsBnhE,GAChD,OAAO2gE,EAAkBphE,KAAK2vE,KAAMlvE,IAGtCuuE,EAAG/uE,UAAUiiE,cAAgB,SAAuBzhE,GAClD,OAAO2gE,EAAkBphE,KAAKsiE,MAAO7hE,IAGvCuuE,EAAG/uE,UAAUywE,SAAW,SAAUjwE,GAChC,OAAO2gE,EAAkBphE,KAAK+vE,QAAStvE,IAGzCuuE,EAAG/uE,UAAU2wE,aAAe,SAAUnwE,GACpC,OAAO2gE,EAAkBphE,KAAKwwE,KAAM/vE,IAGtCuuE,EAAG/uE,UAAU6vE,aAAe,SAAUZ,EAAKzuE,GAOzC,OANAA,EAAMA,GAAO,OACRS,EAAOE,SAAS8tE,KACnBA,EAAM,IAAIhuE,EAAOguE,EAAKzuE,IAExBT,KAAKuwE,MAAQrB,EACblvE,KAAKwwE,KAAO,IAAI3gE,EAAGq/D,GACZlvE,sBCzJT,IAAI44C,EAAc,EAAQ,MAC1Bn6C,EAAOC,QAAUmyE,EACjBA,EAAUT,YAAcA,EACxBS,EAAUR,WAAaA,EACvB,IAAIxgE,EAAK,EAAQ,MACby/D,EAAa,IAAIz/D,EAAG,IAEpBw/D,EAAc,IADA,EAAQ,OAEtByB,EAAM,IAAIjhE,EAAG,GACbkhE,EAAM,IAAIlhE,EAAG,GACbmhE,EAAO,IAAInhE,EAAG,GAGd2/D,GAFU,IAAI3/D,EAAG,IACT,IAAIA,EAAG,GACT,IAAIA,EAAG,KACb4/D,EAAQ,IAAI5/D,EAAG,GAEf0/D,GADQ,IAAI1/D,EAAG,GACN,IAAIA,EAAG,KAChBohE,EAAO,IAAIphE,EAAG,GAEdsV,GADS,IAAItV,EAAG,IACP,MAEb,SAASqhE,IACP,GAAe,OAAX/rD,EACF,OAAOA,EAET,IACI3iB,EAAM,GACVA,EAAI,GAAK,EACT,IAAK,IAAI6I,EAAI,EAAG2H,EAAI,EAAGA,EAHX,QAGsBA,GAAK,EAAG,CAExC,IADA,IAAI+R,EAAOjU,KAAKS,KAAKT,KAAKiU,KAAK/R,IACtB1H,EAAI,EAAGA,EAAID,GAAK7I,EAAI8I,IAAMyZ,GAC7B/R,EAAIxQ,EAAI8I,IAAO,EADoBA,KAIrCD,IAAMC,GAAK9I,EAAI8I,IAAMyZ,IAGzBviB,EAAI6I,KAAO2H,GAGb,OADAmS,EAAS3iB,EACFA,EAGT,SAAS4tE,EAAY5gE,GAGnB,IAFA,IAAI2V,EAAS+rD,IAEJ7lE,EAAI,EAAGA,EAAI8Z,EAAO7jB,OAAQ+J,IACjC,GAA0B,IAAtBmE,EAAEgE,KAAK2R,EAAO9Z,IAChB,OAA0B,IAAtBmE,EAAEoT,KAAKuC,EAAO9Z,IAOtB,OAAO,EAGT,SAASglE,EAAW7gE,GAClB,IAAIW,EAAMN,EAAGuX,KAAK5X,GAClB,OAA8D,IAAvDuhE,EAAIptD,MAAMxT,GAAK+U,OAAO1V,EAAEgR,KAAK,IAAIuD,UAAUnB,KAAK,GAGzD,SAASiuD,EAAUvxD,EAAM4vD,GACvB,GAAI5vD,EAAO,GAET,OACS,IAAIzP,EADD,IAARq/D,GAAqB,IAARA,EACD,CAAC,IAAM,KAEP,CAAC,IAAM,KAKzB,IAAItpE,EAAKurE,EAET,IAJAjC,EAAM,IAAIr/D,EAAGq/D,KAIA,CAEX,IADAtpE,EAAM,IAAIiK,EAAG+oC,EAAY9nC,KAAKS,KAAK+N,EAAO,KACnC1Z,EAAI6O,YAAc6K,GACvB1Z,EAAIma,MAAM,GAQZ,GANIna,EAAIqc,UACNrc,EAAI4Q,KAAKs6D,GAENlrE,EAAIsP,MAAM,IACbtP,EAAI4Q,KAAKu6D,GAEN7B,EAAIh+D,IAAI6/D,IAIN,IAAK7B,EAAIh+D,IAAI8/D,GAClB,KAAOprE,EAAIkM,IAAI09D,GAAKt+D,IAAIu+D,IACtB7pE,EAAI4Q,KAAKy6D,QALX,KAAOrrE,EAAIkM,IAAIw9D,GAAYp+D,IAAIq+D,IAC7B3pE,EAAI4Q,KAAKy6D,GAQb,GAAIb,EADJe,EAAKvrE,EAAIsa,KAAK,KACSkwD,EAAYxqE,IACjCyqE,EAAWc,IAAOd,EAAWzqE,IAC7BypE,EAAYhoE,KAAK8pE,IAAO9B,EAAYhoE,KAAKzB,GACzC,OAAOA,2BCpGb,SAAWnH,EAAQC,GACjB,aAGA,SAAS0E,EAAQuC,EAAK8D,GACpB,IAAK9D,EAAK,MAAM,IAAI1G,MAAMwK,GAAO,oBAKnC,SAAS7J,EAAU6P,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS3P,UAAYyP,EAAUzP,UAC/BwP,EAAKxP,UAAY,IAAI2P,EACrBH,EAAKxP,UAAUgC,YAAcwN,EAK/B,SAASI,EAAIC,EAAQtQ,EAAMuQ,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT9P,KAAKiQ,SAAW,EAChBjQ,KAAKkQ,MAAQ,KACblQ,KAAKsB,OAAS,EAGdtB,KAAKmQ,IAAM,KAEI,OAAXL,IACW,OAATtQ,GAA0B,OAATA,IACnBuQ,EAASvQ,EACTA,EAAO,IAGTQ,KAAKkF,MAAM4K,GAAU,EAAGtQ,GAAQ,GAAIuQ,GAAU,OAYlD,IAAI7O,EATkB,iBAAXzC,EACTA,EAAOC,QAAUmR,EAEjBnR,EAAQmR,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IAEIlP,EADoB,oBAAXmP,aAAmD,IAAlBA,OAAOnP,OACxCmP,OAAOnP,OAEP,eAEX,MAAOwF,IAgIT,SAAS4J,EAAeC,EAAQ3G,GAC9B,IAAI4G,EAAID,EAAOlC,WAAWzE,GAE1B,OAAI4G,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASC,EAAcF,EAAQG,EAAY9G,GACzC,IAAI+G,EAAIL,EAAcC,EAAQ3G,GAI9B,OAHIA,EAAQ,GAAK8G,IACfC,GAAKL,EAAcC,EAAQ3G,EAAQ,IAAM,GAEpC+G,EA8CT,SAASC,EAAWvH,EAAKxC,EAAO6G,EAAKmD,GAGnC,IAFA,IAAIF,EAAI,EACJvF,EAAM0F,KAAK/D,IAAI1D,EAAI/H,OAAQoM,GACtBrC,EAAIxE,EAAOwE,EAAID,EAAKC,IAAK,CAChC,IAAImF,EAAInH,EAAIgF,WAAWhD,GAAK,GAE5BsF,GAAKE,EAIHF,GADEH,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOG,EAnNTd,EAAGG,KAAO,SAAepK,GACvB,OAAIA,aAAeiK,GAIJ,OAARjK,GAA+B,iBAARA,GAC5BA,EAAI3D,YAAYmO,WAAaP,EAAGO,UAAY1O,MAAMC,QAAQiE,EAAIsK,QAGlEL,EAAGkB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG9C,IAAM,SAAciE,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG5P,UAAUiF,MAAQ,SAAe4K,EAAQtQ,EAAMuQ,GAChD,GAAsB,iBAAXD,EACT,OAAO9P,KAAKmR,YAAYrB,EAAQtQ,EAAMuQ,GAGxC,GAAsB,iBAAXD,EACT,OAAO9P,KAAKoR,WAAWtB,EAAQtQ,EAAMuQ,GAG1B,QAATvQ,IACFA,EAAO,IAET4D,EAAO5D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqH,EAAQ,EACM,OAFlBiJ,EAASA,EAAO7D,WAAW2B,QAAQ,OAAQ,KAEhC,KACT/G,IACA7G,KAAKiQ,SAAW,GAGdpJ,EAAQiJ,EAAOxO,SACJ,KAAT9B,EACFQ,KAAKqR,UAAUvB,EAAQjJ,EAAOkJ,IAE9B/P,KAAKsR,WAAWxB,EAAQtQ,EAAMqH,GACf,OAAXkJ,GACF/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,MAM9CF,EAAG5P,UAAUkR,YAAc,SAAsBrB,EAAQtQ,EAAMuQ,GACzDD,EAAS,IACX9P,KAAKiQ,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX9P,KAAKkQ,MAAQ,CAAW,SAATJ,GACf9P,KAAKsB,OAAS,GACLwO,EAAS,kBAClB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB9P,KAAKsB,OAAS,IAEd8B,EAAO0M,EAAS,kBAChB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF9P,KAAKsB,OAAS,GAGD,OAAXyO,GAGJ/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,IAGxCF,EAAG5P,UAAUmR,WAAa,SAAqBtB,EAAQtQ,EAAMuQ,GAG3D,GADA3M,EAAgC,iBAAlB0M,EAAOxO,QACjBwO,EAAOxO,QAAU,EAGnB,OAFAtB,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EACPtB,KAGTA,KAAKsB,OAASwP,KAAKS,KAAKzB,EAAOxO,OAAS,GACxCtB,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAGlB,IAAIC,EAAGkG,EACHC,EAAM,EACV,GAAe,OAAX1B,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAGgK,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,UAGC,GAAe,OAAXyE,EACT,IAAK1E,EAAI,EAAGC,EAAI,EAAGD,EAAIyE,EAAOxO,OAAQ+J,GAAK,EACzCmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,KAIN,OAAOtL,KAAK0R,SAyBd7B,EAAG5P,UAAUoR,UAAY,SAAoBvB,EAAQjJ,EAAOkJ,GAE1D/P,KAAKsB,OAASwP,KAAKS,MAAMzB,EAAOxO,OAASuF,GAAS,GAClD7G,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAIlB,IAGImG,EAHAC,EAAM,EACNnG,EAAI,EAGR,GAAe,OAAXyE,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAG+J,GAAKxE,EAAOwE,GAAK,EAC3CmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,OAKX,IAAKpG,GADayE,EAAOxO,OAASuF,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOwE,EAAIyE,EAAOxO,OAAQ+J,GAAK,EAC1EmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,EAKbzR,KAAK0R,SA2BP7B,EAAG5P,UAAUqR,WAAa,SAAqBxB,EAAQtQ,EAAMqH,GAE3D7G,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EAGd,IAAK,IAAIqQ,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWpS,EAClEmS,IAEFA,IACAC,EAAWA,EAAUpS,EAAQ,EAO7B,IALA,IAAIqS,EAAQ/B,EAAOxO,OAASuF,EACxBiL,EAAMD,EAAQF,EACdjE,EAAMoD,KAAK/D,IAAI8E,EAAOA,EAAQC,GAAOjL,EAErCkL,EAAO,EACF1G,EAAIxE,EAAOwE,EAAIqC,EAAKrC,GAAKsG,EAChCI,EAAOnB,EAAUd,EAAQzE,EAAGA,EAAIsG,EAASnS,GAEzCQ,KAAKgS,MAAMJ,GACP5R,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOnB,EAAUd,EAAQzE,EAAGyE,EAAOxO,OAAQ9B,GAEtC6L,EAAI,EAAGA,EAAIyG,EAAKzG,IACnB6G,GAAO1S,EAGTQ,KAAKgS,MAAME,GACPlS,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB/R,KAAK0R,SAGP7B,EAAG5P,UAAUiD,KAAO,SAAeiP,GACjCA,EAAKjC,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/B8G,EAAKjC,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAE7B8G,EAAK7Q,OAAStB,KAAKsB,OACnB6Q,EAAKlC,SAAWjQ,KAAKiQ,SACrBkC,EAAKhC,IAAMnQ,KAAKmQ,KAGlBN,EAAG5P,UAAU0E,MAAQ,WACnB,IAAIgM,EAAI,IAAId,EAAG,MAEf,OADA7P,KAAKkD,KAAKyN,GACHA,GAGTd,EAAG5P,UAAUmS,QAAU,SAAkBxT,GACvC,KAAOoB,KAAKsB,OAAS1C,GACnBoB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAE9B,OAAOtB,MAIT6P,EAAG5P,UAAUyR,MAAQ,WACnB,KAAO1R,KAAKsB,OAAS,GAAqC,IAAhCtB,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IACjDtB,KAAKsB,SAEP,OAAOtB,KAAKqS,aAGdxC,EAAG5P,UAAUoS,UAAY,WAKvB,OAHoB,IAAhBrS,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,KAClClQ,KAAKiQ,SAAW,GAEXjQ,MAGT6P,EAAG5P,UAAUqS,QAAU,WACrB,OAAQtS,KAAKmQ,IAAM,UAAY,SAAWnQ,KAAKiM,SAAS,IAAM,KAiChE,IAAIsG,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAsjB9D,SAASC,EAAYC,EAAM/M,EAAK9C,GAC9BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnC,IAAI7E,EAAOuH,EAAKrR,OAASsE,EAAItE,OAAU,EACvCwB,EAAIxB,OAAS8J,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIwH,EAAoB,EAAhBD,EAAKzC,MAAM,GACf2C,EAAmB,EAAfjN,EAAIsK,MAAM,GACdS,EAAIiC,EAAIC,EAERC,EAAS,SAAJnC,EACLoC,EAASpC,EAAI,SAAa,EAC9B7N,EAAIoN,MAAM,GAAK4C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI5H,EAAK4H,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAK2H,EAAI1H,EAAK,EAIlB2H,IADAtC,GAFAiC,EAAoB,EAAhBD,EAAKzC,MAAM7E,KACfwH,EAAmB,EAAfjN,EAAIsK,MAAM5E,IACF4H,GACG,SAAa,EAC5BA,EAAY,SAAJvC,EAEV7N,EAAIoN,MAAM8C,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFjQ,EAAIoN,MAAM8C,GAAa,EAARD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAzlBb7B,EAAG5P,UAAUgM,SAAW,SAAmBzM,EAAM4T,GAI/C,IAAItQ,EACJ,GAHAsQ,EAAoB,EAAVA,GAAe,EAGZ,MAJb5T,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCsD,EAAM,GAGN,IAFA,IAAI2O,EAAM,EACNsB,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,EAAIxR,KAAKkQ,MAAM7E,GACf0G,GAA+B,UAArBP,GAAKC,EAAOsB,IAAmB9G,SAAS,IAGpDnJ,EADY,IADdiQ,EAASvB,IAAO,GAAKC,EAAQ,WACVpG,IAAMrL,KAAKsB,OAAS,EAC/BiR,EAAM,EAAIR,EAAKzQ,QAAUyQ,EAAOjP,EAEhCiP,EAAOjP,GAEf2O,GAAO,IACI,KACTA,GAAO,GACPpG,KAMJ,IAHc,IAAV0H,IACFjQ,EAAMiQ,EAAM9G,SAAS,IAAMnJ,GAEtBA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGT,GAAItD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI6T,EAAYb,EAAWhT,GAEvB8T,EAAYb,EAAWjT,GAC3BsD,EAAM,GACN,IAAI0N,EAAIxQ,KAAK2E,QAEb,IADA6L,EAAEP,SAAW,GACLO,EAAE+C,UAAU,CAClB,IAAI5C,EAAIH,EAAEgD,KAAKF,GAAWrH,SAASzM,GAMjCsD,GALF0N,EAAIA,EAAEiD,MAAMH,IAELC,SAGC5C,EAAI7N,EAFJyP,EAAMc,EAAY1C,EAAErP,QAAUqP,EAAI7N,EAQ5C,IAHI9C,KAAKuT,WACPzQ,EAAM,IAAMA,GAEPA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGTM,GAAO,EAAO,oCAGhByM,EAAG5P,UAAUyT,SAAW,WACtB,IAAIC,EAAM3T,KAAKkQ,MAAM,GASrB,OARoB,IAAhBlQ,KAAKsB,OACPqS,GAAuB,SAAhB3T,KAAKkQ,MAAM,GACO,IAAhBlQ,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,GAEzCyD,GAAO,iBAAoC,SAAhB3T,KAAKkQ,MAAM,GAC7BlQ,KAAKsB,OAAS,GACvB8B,GAAO,EAAO,8CAEU,IAAlBpD,KAAKiQ,UAAmB0D,EAAMA,GAGxC9D,EAAG5P,UAAU2T,OAAS,WACpB,OAAO5T,KAAKiM,SAAS,KAGvB4D,EAAG5P,UAAU4T,SAAW,SAAmB9D,EAAQzO,GAEjD,OADA8B,OAAyB,IAAXlC,GACPlB,KAAK8T,YAAY5S,EAAQ6O,EAAQzO,IAG1CuO,EAAG5P,UAAUiP,QAAU,SAAkBa,EAAQzO,GAC/C,OAAOtB,KAAK8T,YAAYpS,MAAOqO,EAAQzO,IAGzCuO,EAAG5P,UAAU6T,YAAc,SAAsBC,EAAWhE,EAAQzO,GAClE,IAAIS,EAAa/B,KAAK+B,aAClBiS,EAAY1S,GAAUwP,KAAKC,IAAI,EAAGhP,GACtCqB,EAAOrB,GAAciS,EAAW,yCAChC5Q,EAAO4Q,EAAY,EAAG,+BAEtBhU,KAAK0R,QACL,IAGImB,EAAGxH,EAHH4I,EAA0B,OAAXlE,EACfvN,EAAM,IAAIuR,EAAUC,GAGpBE,EAAIlU,KAAK2E,QACb,GAAKsP,EAYE,CACL,IAAK5I,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAI6I,GAAKwH,EAGX,KAAOxH,EAAI2I,EAAW3I,IACpB7I,EAAI6I,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI2I,EAAYjS,EAAYsJ,IACtC7I,EAAI6I,GAAK,EAGX,IAAKA,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAIwR,EAAY3I,EAAI,GAAKwH,EAe7B,OAAOrQ,GAGLsO,KAAKuD,MACPxE,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,OAAO,GAAKV,KAAKuD,MAAM7C,IAGzB3B,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,IAAI+C,EAAI/C,EACJb,EAAI,EAiBR,OAhBI4D,GAAK,OACP5D,GAAK,GACL4D,KAAO,IAELA,GAAK,KACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAEF5D,EAAI4D,GAIf1E,EAAG5P,UAAUuU,UAAY,SAAoBhD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAI+C,EAAI/C,EACJb,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ4D,KACH5D,GAAK,GACL4D,KAAO,IAEU,IAAV,IAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,GAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,IACH5D,IAEKA,GAITd,EAAG5P,UAAUwU,UAAY,WACvB,IAAIjD,EAAIxR,KAAKkQ,MAAMlQ,KAAKsB,OAAS,GAC7BoT,EAAK1U,KAAKsU,WAAW9C,GACzB,OAA2B,IAAnBxR,KAAKsB,OAAS,GAAUoT,GAiBlC7E,EAAG5P,UAAU0U,SAAW,WACtB,GAAI3U,KAAKuT,SAAU,OAAO,EAG1B,IADA,IAAI5C,EAAI,EACCtF,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAIwH,EAAI7S,KAAKwU,UAAUxU,KAAKkQ,MAAM7E,IAElC,GADAsF,GAAKkC,EACK,KAANA,EAAU,MAEhB,OAAOlC,GAGTd,EAAG5P,UAAU8B,WAAa,WACxB,OAAO+O,KAAKS,KAAKvR,KAAKyU,YAAc,IAGtC5E,EAAG5P,UAAU2U,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7U,KAAKiQ,SACAjQ,KAAK8U,MAAMC,MAAMF,GAAOG,MAAM,GAEhChV,KAAK2E,SAGdkL,EAAG5P,UAAUgV,SAAW,SAAmBJ,GACzC,OAAI7U,KAAKkV,MAAML,EAAQ,GACd7U,KAAKmV,KAAKN,GAAOG,MAAM,GAAGI,OAE5BpV,KAAK2E,SAGdkL,EAAG5P,UAAUoV,MAAQ,WACnB,OAAyB,IAAlBrV,KAAKiQ,UAIdJ,EAAG5P,UAAUqV,IAAM,WACjB,OAAOtV,KAAK2E,QAAQyQ,QAGtBvF,EAAG5P,UAAUmV,KAAO,WAKlB,OAJKpV,KAAKuT,WACRvT,KAAKiQ,UAAY,GAGZjQ,MAIT6P,EAAG5P,UAAUsV,KAAO,SAAe3P,GACjC,KAAO5F,KAAKsB,OAASsE,EAAItE,QACvBtB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAG9B,IAAK,IAAI+J,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAC9BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAG5C,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUuV,IAAM,SAAc5P,GAE/B,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAKuV,KAAK3P,IAInBiK,EAAG5P,UAAUwV,GAAK,SAAa7P,GAC7B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6Q,IAAI5P,GAC/CA,EAAIjB,QAAQ6Q,IAAIxV,OAGzB6P,EAAG5P,UAAUyV,IAAM,SAAc9P,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ4Q,KAAK3P,GAChDA,EAAIjB,QAAQ4Q,KAAKvV,OAI1B6P,EAAG5P,UAAU0V,MAAQ,SAAgB/P,GAEnC,IAAIiN,EAEFA,EADE7S,KAAKsB,OAASsE,EAAItE,OAChBsE,EAEA5F,KAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAK5C,OAFArL,KAAKsB,OAASuR,EAAEvR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU2V,KAAO,SAAehQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK2V,MAAM/P,IAIpBiK,EAAG5P,UAAU4V,IAAM,SAAcjQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQiR,KAAKhQ,GAChDA,EAAIjB,QAAQiR,KAAK5V,OAG1B6P,EAAG5P,UAAU6V,KAAO,SAAelQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQgR,MAAM/P,GACjDA,EAAIjB,QAAQgR,MAAM3V,OAI3B6P,EAAG5P,UAAU8V,MAAQ,SAAgBnQ,GAEnC,IAAIgN,EACAC,EACA7S,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAAKwH,EAAE3C,MAAM7E,GAGvC,GAAIrL,OAAS4S,EACX,KAAOvH,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAM5B,OAFArL,KAAKsB,OAASsR,EAAEtR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU+V,KAAO,SAAepQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK+V,MAAMnQ,IAIpBiK,EAAG5P,UAAUgW,IAAM,SAAcrQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQqR,KAAKpQ,GAChDA,EAAIjB,QAAQqR,KAAKhW,OAG1B6P,EAAG5P,UAAUiW,KAAO,SAAetQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQoR,MAAMnQ,GACjDA,EAAIjB,QAAQoR,MAAM/V,OAI3B6P,EAAG5P,UAAU8U,MAAQ,SAAgBF,GACnCzR,EAAwB,iBAAVyR,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBrF,KAAKS,KAAKsD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7U,KAAKoS,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAa9K,IAC/BrL,KAAKkQ,MAAM7E,GAAsB,UAAhBrL,KAAKkQ,MAAM7E,GAS9B,OALI+K,EAAW,IACbpW,KAAKkQ,MAAM7E,IAAMrL,KAAKkQ,MAAM7E,GAAM,UAAc,GAAK+K,GAIhDpW,KAAK0R,SAGd7B,EAAG5P,UAAUkV,KAAO,SAAeN,GACjC,OAAO7U,KAAK2E,QAAQoQ,MAAMF,IAI5BhF,EAAG5P,UAAUoW,KAAO,SAAeC,EAAK3Q,GACtCvC,EAAsB,iBAARkT,GAAoBA,GAAO,GAEzC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtW,KAAKoS,QAAQX,EAAM,GAGjBzR,KAAKkQ,MAAMuB,GADT9L,EACgB3F,KAAKkQ,MAAMuB,GAAQ,GAAK8E,EAExBvW,KAAKkQ,MAAMuB,KAAS,GAAK8E,GAGtCvW,KAAK0R,SAId7B,EAAG5P,UAAUuW,KAAO,SAAe5Q,GACjC,IAAI+K,EAkBAiC,EAAGC,EAfP,GAAsB,IAAlB7S,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAI7B,OAHAjQ,KAAKiQ,SAAW,EAChBU,EAAI3Q,KAAKyW,KAAK7Q,GACd5F,KAAKiQ,UAAY,EACVjQ,KAAKqS,YAGP,GAAsB,IAAlBrS,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAIpC,OAHArK,EAAIqK,SAAW,EACfU,EAAI3Q,KAAKyW,KAAK7Q,GACdA,EAAIqK,SAAW,EACRU,EAAE0B,YAKPrS,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,EAC1C/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAEhB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAClCsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,EACvB/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAIhB,GADA3Q,KAAKsB,OAASsR,EAAEtR,OACF,IAAVyR,EACF/S,KAAKkQ,MAAMlQ,KAAKsB,QAAUyR,EAC1B/S,KAAKsB,cAEA,GAAIsR,IAAM5S,KACf,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAI5B,OAAOrL,MAIT6P,EAAG5P,UAAUyW,IAAM,SAAc9Q,GAC/B,IAAIpD,EACJ,OAAqB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UAC7BrK,EAAIqK,SAAW,EACfzN,EAAMxC,KAAK2W,IAAI/Q,GACfA,EAAIqK,UAAY,EACTzN,GACmB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UACpCjQ,KAAKiQ,SAAW,EAChBzN,EAAMoD,EAAI+Q,IAAI3W,MACdA,KAAKiQ,SAAW,EACTzN,GAGLxC,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6R,KAAK5Q,GAEhDA,EAAIjB,QAAQ6R,KAAKxW,OAI1B6P,EAAG5P,UAAUwW,KAAO,SAAe7Q,GAEjC,GAAqB,IAAjBA,EAAIqK,SAAgB,CACtBrK,EAAIqK,SAAW,EACf,IAAIU,EAAI3Q,KAAKwW,KAAK5Q,GAElB,OADAA,EAAIqK,SAAW,EACRU,EAAE0B,YAGJ,GAAsB,IAAlBrS,KAAKiQ,SAId,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKwW,KAAK5Q,GACV5F,KAAKiQ,SAAW,EACTjQ,KAAKqS,YAId,IAWIO,EAAGC,EAXH3B,EAAMlR,KAAKkR,IAAItL,GAGnB,GAAY,IAARsL,EAIF,OAHAlR,KAAKiQ,SAAW,EAChBjQ,KAAKsB,OAAS,EACdtB,KAAKkQ,MAAM,GAAK,EACTlQ,KAKLkR,EAAM,GACR0B,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAE5B0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,IAC7B,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAElB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAElC0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,IACV,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAIlB,GAAc,IAAVoC,GAAe1H,EAAIuH,EAAEtR,QAAUsR,IAAM5S,KACvC,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAU5B,OANArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,GAEhCuH,IAAM5S,OACRA,KAAKiQ,SAAW,GAGXjQ,KAAK0R,SAId7B,EAAG5P,UAAU0W,IAAM,SAAc/Q,GAC/B,OAAO5F,KAAK2E,QAAQ8R,KAAK7Q,IA+C3B,IAAIgR,EAAc,SAAsBjE,EAAM/M,EAAK9C,GACjD,IAIIgQ,EACA+D,EACAnC,EANA9B,EAAID,EAAKzC,MACT2C,EAAIjN,EAAIsK,MACR4G,EAAIhU,EAAIoN,MACRM,EAAI,EAIJuG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnG,EAAE,GACPoG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtG,EAAE,GACPuG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzG,EAAE,GACP0G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5G,EAAE,GACP6G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP/G,EAAE,GACPgH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlH,EAAE,GACPmH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrH,EAAE,GACPsH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxH,EAAE,GACPyH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3H,EAAE,GACP4H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB1X,EAAImN,SAAW0C,EAAK1C,SAAWrK,EAAIqK,SACnCnN,EAAIxB,OAAS,GAMb,IAAIqZ,IAAQnK,GAJZsC,EAAKhC,KAAK8J,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM/F,KAAK8J,KAAK5D,EAAK+B,IACRjI,KAAK8J,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDtI,IAFAkE,EAAK5D,KAAK8J,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKhC,KAAK8J,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKzD,EAAK4B,IACRjI,KAAK8J,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQrK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKkC,GAAQ,GACvBpI,KAAK8J,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDzI,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKhC,KAAK8J,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKtD,EAAKyB,IACRjI,KAAK8J,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKrD,EAAKwB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK+B,GAAQ,GACvBpI,KAAK8J,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQtK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKqC,GAAQ,GACvBvI,KAAK8J,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD5I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKhC,KAAK8J,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKnD,EAAKsB,IACRjI,KAAK8J,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKlD,EAAKqB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK4B,GAAQ,GACvBpI,KAAK8J,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKkC,GAAQ,GACvBvI,KAAK8J,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQvK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKwC,GAAQ,GACvB1I,KAAK8J,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD/I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKhC,KAAK8J,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKhD,EAAKmB,IACRjI,KAAK8J,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK/C,EAAKkB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKyB,GAAQ,GACvBpI,KAAK8J,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK+B,GAAQ,GACvBvI,KAAK8J,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKqC,GAAQ,GACvB1I,KAAK8J,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQxK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK2C,IAAQ,GACvB7I,KAAK8J,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDlJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKhC,KAAK8J,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK7C,EAAKgB,IACRjI,KAAK8J,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK5C,EAAKe,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKsB,GAAQ,GACvBpI,KAAK8J,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK4B,GAAQ,GACvBvI,KAAK8J,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKkC,GAAQ,GACvB1I,KAAK8J,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKiC,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKwC,IAAQ,GACvB7I,KAAK8J,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQzK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK8C,IAAQ,GACvBhJ,KAAK8J,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDrJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKhC,KAAK8J,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK1C,EAAKa,IACRjI,KAAK8J,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKzC,EAAKY,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKmB,GAAQ,GACvBpI,KAAK8J,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKyB,GAAQ,GACvBvI,KAAK8J,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK+B,GAAQ,GACvB1I,KAAK8J,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK8B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKqC,IAAQ,GACvB7I,KAAK8J,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK2C,IAAQ,GACvBhJ,KAAK8J,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ1K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKiD,IAAQ,GACvBnJ,KAAK8J,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDxJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKhC,KAAK8J,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKvC,EAAKU,IACRjI,KAAK8J,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKtC,EAAKS,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKgB,GAAQ,GACvBpI,KAAK8J,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKsB,GAAQ,GACvBvI,KAAK8J,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK4B,GAAQ,GACvB1I,KAAK8J,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK2B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKkC,IAAQ,GACvB7I,KAAK8J,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKwC,IAAQ,GACvBhJ,KAAK8J,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK8C,IAAQ,GACvBnJ,KAAK8J,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ3K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKoD,IAAQ,GACvBtJ,KAAK8J,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD3J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKhC,KAAK8J,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKpC,EAAKO,IACRjI,KAAK8J,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKnC,EAAKM,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKa,GAAQ,GACvBpI,KAAK8J,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKmB,GAAQ,GACvBvI,KAAK8J,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKyB,GAAQ,GACvB1I,KAAK8J,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKwB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK+B,IAAQ,GACvB7I,KAAK8J,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKqC,IAAQ,GACvBhJ,KAAK8J,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKoC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK2C,IAAQ,GACvBnJ,KAAK8J,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKiD,IAAQ,GACvBtJ,KAAK8J,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ5K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKuD,IAAQ,GACvBzJ,KAAK8J,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD9J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKhC,KAAK8J,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKI,IACRjI,KAAK8J,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKhC,EAAKG,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKU,GAAQ,GACvBpI,KAAK8J,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKS,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKgB,GAAQ,GACvBvI,KAAK8J,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKsB,GAAQ,GACvB1I,KAAK8J,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKqB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK4B,IAAQ,GACvB7I,KAAK8J,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKkC,IAAQ,GACvBhJ,KAAK8J,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKwC,IAAQ,GACvBnJ,KAAK8J,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK8C,IAAQ,GACvBtJ,KAAK8J,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK6C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKoD,IAAQ,GACvBzJ,KAAK8J,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQ7K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK0D,IAAQ,GACvB5J,KAAK8J,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKhC,KAAK8J,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKO,IACRpI,KAAK8J,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK5D,KAAK8J,KAAKhC,EAAKM,GACpBpG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKa,GAAQ,GACvBvI,KAAK8J,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKY,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKmB,GAAQ,GACvB1I,KAAK8J,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKkB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKyB,IAAQ,GACvB7I,KAAK8J,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK+B,IAAQ,GACvBhJ,KAAK8J,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK8B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKqC,IAAQ,GACvBnJ,KAAK8J,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK2C,IAAQ,GACvBtJ,KAAK8J,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK0C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKiD,IAAQ,GACvBzJ,KAAK8J,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS9K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKuD,IAAQ,GACvB5J,KAAK8J,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKhC,KAAK8J,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKU,IACRvI,KAAK8J,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK5D,KAAK8J,KAAKhC,EAAKS,GACpBvG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKgB,GAAQ,GACvB1I,KAAK8J,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKe,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKsB,IAAQ,GACvB7I,KAAK8J,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK4B,IAAQ,GACvBhJ,KAAK8J,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKkC,IAAQ,GACvBnJ,KAAK8J,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKwC,IAAQ,GACvBtJ,KAAK8J,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKuC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK8C,IAAQ,GACvBzJ,KAAK8J,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS/K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKoD,IAAQ,GACvB5J,KAAK8J,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKhC,KAAK8J,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKa,IACR1I,KAAK8J,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK5D,KAAK8J,KAAKhC,EAAKY,GACpB1G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKmB,IAAQ,GACvB7I,KAAK8J,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKkB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKyB,IAAQ,GACvBhJ,KAAK8J,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK+B,IAAQ,GACvBnJ,KAAK8J,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKqC,IAAQ,GACvBtJ,KAAK8J,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKoC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK2C,IAAQ,GACvBzJ,KAAK8J,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAShL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKiD,IAAQ,GACvB5J,KAAK8J,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKhC,KAAK8J,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKgB,KACR7I,KAAK8J,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK5D,KAAK8J,KAAKhC,EAAKe,IACpB7G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKsB,IAAQ,GACvBhJ,KAAK8J,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKqB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK4B,IAAQ,GACvBnJ,KAAK8J,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKkC,IAAQ,GACvBtJ,KAAK8J,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKiC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKwC,IAAQ,GACvBzJ,KAAK8J,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASjL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK8C,IAAQ,GACvB5J,KAAK8J,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKhC,KAAK8J,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKmB,KACRhJ,KAAK8J,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK5D,KAAK8J,KAAKhC,EAAKkB,IACpBhH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKyB,IAAQ,GACvBnJ,KAAK8J,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKwB,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK+B,IAAQ,GACvBtJ,KAAK8J,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK8B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKqC,IAAQ,GACvBzJ,KAAK8J,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASlL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK2C,IAAQ,GACvB5J,KAAK8J,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKhC,KAAK8J,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKsB,KACRnJ,KAAK8J,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK5D,KAAK8J,KAAKhC,EAAKqB,IACpBnH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK4B,IAAQ,GACvBtJ,KAAK8J,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK2B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKkC,IAAQ,GACvBzJ,KAAK8J,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASnL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKwC,IAAQ,GACvB5J,KAAK8J,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKhC,KAAK8J,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKyB,KACRtJ,KAAK8J,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK5D,KAAK8J,KAAKhC,EAAKwB,IACpBtH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK+B,IAAQ,GACvBzJ,KAAK8J,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASpL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKqC,IAAQ,GACvB5J,KAAK8J,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKhC,KAAK8J,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK4B,KACRzJ,KAAK8J,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK5D,KAAK8J,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASrL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKkC,IAAQ,GACvB5J,KAAK8J,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAStL,GAJbsC,EAAKhC,KAAK8J,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK+B,KACR5J,KAAK8J,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAjK,IAFAkE,EAAK5D,KAAK8J,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANtL,IACFsG,EAAE,IAAMtG,EACR1N,EAAIxB,UAECwB,GAiDT,SAASiZ,EAAYpJ,EAAM/M,EAAK9C,GAE9B,OADW,IAAIkZ,GACHC,KAAKtJ,EAAM/M,EAAK9C,GAsB9B,SAASkZ,EAAME,EAAGC,GAChBnc,KAAKkc,EAAIA,EACTlc,KAAKmc,EAAIA,EAvENrL,KAAK8J,OACRhE,EAAclE,GAiDhB7C,EAAG5P,UAAUmc,MAAQ,SAAgBxW,EAAK9C,GACxC,IAAIN,EACA4I,EAAMpL,KAAKsB,OAASsE,EAAItE,OAW5B,OATEkB,EADkB,KAAhBxC,KAAKsB,QAAgC,KAAfsE,EAAItE,OACtBsV,EAAY5W,KAAM4F,EAAK9C,GACpBsI,EAAM,GACTsH,EAAW1S,KAAM4F,EAAK9C,GACnBsI,EAAM,KArDnB,SAAmBuH,EAAM/M,EAAK9C,GAC5BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnCnN,EAAIxB,OAASqR,EAAKrR,OAASsE,EAAItE,OAI/B,IAFA,IAAIyR,EAAQ,EACRsJ,EAAU,EACLrJ,EAAI,EAAGA,EAAIlQ,EAAIxB,OAAS,EAAG0R,IAAK,CAGvC,IAAIC,EAASoJ,EACbA,EAAU,EAGV,IAFA,IAAInJ,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAI2H,EAAI1H,EAGRqF,GAFoB,EAAhBgC,EAAKzC,MAAM7E,KACI,EAAfzF,EAAIsK,MAAM5E,IAGdwH,EAAS,SAAJnC,EAGTuC,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBmJ,IAFApJ,GAHAA,EAAUA,GAAWtC,EAAI,SAAa,GAAM,IAGxBmC,IAAO,IAAO,KAEZ,GACtBG,GAAU,SAEZnQ,EAAIoN,MAAM8C,GAAKE,EACfH,EAAQE,EACRA,EAASoJ,EAQX,OANc,IAAVtJ,EACFjQ,EAAIoN,MAAM8C,GAAKD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAgBH4K,CAAStc,KAAM4F,EAAK9C,GAEpBiZ,EAAW/b,KAAM4F,EAAK9C,GAGvBN,GAWTwZ,EAAK/b,UAAUsc,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAI7S,MAAM8a,GACdC,EAAI5M,EAAG5P,UAAUqU,WAAWkI,GAAK,EAC5BnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBkJ,EAAElJ,GAAKrL,KAAK0c,OAAOrR,EAAGoR,EAAGD,GAG3B,OAAOjI,GAITyH,EAAK/b,UAAUyc,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAtR,EAAI,EAAGA,EAAIoR,EAAGpR,IACrBsR,IAAW,EAAJT,IAAWO,EAAIpR,EAAI,EAC1B6Q,IAAM,EAGR,OAAOS,GAKTX,EAAK/b,UAAU2c,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAGnR,IACrB2R,EAAK3R,GAAKyR,EAAID,EAAIxR,IAClB4R,EAAK5R,GAAK0R,EAAIF,EAAIxR,KAItB2Q,EAAK/b,UAAUid,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE7c,KAAK4c,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQtM,KAAKuM,IAAI,EAAIvM,KAAKwM,GAAKb,GAC/Bc,EAAQzM,KAAK0M,IAAI,EAAI1M,KAAKwM,GAAKb,GAE1BjN,EAAI,EAAGA,EAAIgN,EAAGhN,GAAKiN,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJjS,EAAI,EAAGA,EAAI6R,EAAG7R,IAAK,CAC1B,IAAImC,EAAKuP,EAAKxN,EAAIlE,GACdqS,EAAKV,EAAKzN,EAAIlE,GAEdsS,EAAKZ,EAAKxN,EAAIlE,EAAI6R,GAClBU,EAAKZ,EAAKzN,EAAIlE,EAAI6R,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAKxN,EAAIlE,GAAKmC,EAAKmQ,EACnBX,EAAKzN,EAAIlE,GAAKqS,EAAKE,EAEnBb,EAAKxN,EAAIlE,EAAI6R,GAAK1P,EAAKmQ,EACvBX,EAAKzN,EAAIlE,EAAI6R,GAAKQ,EAAKE,EAGnBvS,IAAMmR,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB9B,EAAK/b,UAAU8d,YAAc,SAAsBC,EAAGjf,GACpD,IAAIyd,EAAqB,EAAjB1L,KAAKC,IAAIhS,EAAGif,GAChBC,EAAU,EAAJzB,EACNnR,EAAI,EACR,IAAKmR,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BnR,IAGF,OAAO,GAAKA,EAAI,EAAI4S,GAGtBjC,EAAK/b,UAAUie,UAAY,SAAoBpB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAIkJ,EAAIuI,EAAIzR,GAEZyR,EAAIzR,GAAKyR,EAAIN,EAAInR,EAAI,GACrByR,EAAIN,EAAInR,EAAI,GAAKkJ,EAEjBA,EAAIwI,EAAI1R,GAER0R,EAAI1R,IAAM0R,EAAIP,EAAInR,EAAI,GACtB0R,EAAIP,EAAInR,EAAI,IAAMkJ,IAItByH,EAAK/b,UAAUke,aAAe,SAAuBC,EAAI5B,GAEvD,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAImG,EAAoC,KAAhCV,KAAKuN,MAAMD,EAAG,EAAI/S,EAAI,GAAKmR,GACjC1L,KAAKuN,MAAMD,EAAG,EAAI/S,GAAKmR,GACvBzJ,EAEFqL,EAAG/S,GAAS,SAAJmG,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO4M,GAGTpC,EAAK/b,UAAUqe,WAAa,SAAqBF,EAAIhT,EAAK0R,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAID,EAAKC,IACvB0H,GAAyB,EAARqL,EAAG/S,GAEpByR,EAAI,EAAIzR,GAAa,KAAR0H,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAIzR,EAAI,GAAa,KAAR0H,EAAgBA,KAAkB,GAIrD,IAAK1H,EAAI,EAAID,EAAKC,EAAImR,IAAKnR,EACzByR,EAAIzR,GAAK,EAGXjI,EAAiB,IAAV2P,GACP3P,EAA6B,KAAb,KAAR2P,KAGViJ,EAAK/b,UAAUse,KAAO,SAAe/B,GAEnC,IADA,IAAIgC,EAAK,IAAI9c,MAAM8a,GACVnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBmT,EAAGnT,GAAK,EAGV,OAAOmT,GAGTxC,EAAK/b,UAAUgc,KAAO,SAAeC,EAAGC,EAAGrZ,GACzC,IAAI0Z,EAAI,EAAIxc,KAAK+d,YAAY7B,EAAE5a,OAAQ6a,EAAE7a,QAErCub,EAAM7c,KAAKuc,QAAQC,GAEnBiC,EAAIze,KAAKue,KAAK/B,GAEdM,EAAM,IAAIpb,MAAM8a,GAChBkC,EAAO,IAAIhd,MAAM8a,GACjBmC,EAAO,IAAIjd,MAAM8a,GAEjBoC,EAAO,IAAIld,MAAM8a,GACjBqC,EAAQ,IAAInd,MAAM8a,GAClBsC,EAAQ,IAAIpd,MAAM8a,GAElBuC,EAAOjc,EAAIoN,MACf6O,EAAKzd,OAASkb,EAEdxc,KAAKse,WAAWpC,EAAEhM,MAAOgM,EAAE5a,OAAQwb,EAAKN,GACxCxc,KAAKse,WAAWnC,EAAEjM,MAAOiM,EAAE7a,OAAQsd,EAAMpC,GAEzCxc,KAAKkd,UAAUJ,EAAK2B,EAAGC,EAAMC,EAAMnC,EAAGK,GACtC7c,KAAKkd,UAAU0B,EAAMH,EAAGI,EAAOC,EAAOtC,EAAGK,GAEzC,IAAK,IAAIxR,EAAI,EAAGA,EAAImR,EAAGnR,IAAK,CAC1B,IAAIyS,EAAKY,EAAKrT,GAAKwT,EAAMxT,GAAKsT,EAAKtT,GAAKyT,EAAMzT,GAC9CsT,EAAKtT,GAAKqT,EAAKrT,GAAKyT,EAAMzT,GAAKsT,EAAKtT,GAAKwT,EAAMxT,GAC/CqT,EAAKrT,GAAKyS,EAUZ,OAPA9d,KAAKke,UAAUQ,EAAMC,EAAMnC,GAC3Bxc,KAAKkd,UAAUwB,EAAMC,EAAMI,EAAMN,EAAGjC,EAAGK,GACvC7c,KAAKke,UAAUa,EAAMN,EAAGjC,GACxBxc,KAAKme,aAAaY,EAAMvC,GAExB1Z,EAAImN,SAAWiM,EAAEjM,SAAWkM,EAAElM,SAC9BnN,EAAIxB,OAAS4a,EAAE5a,OAAS6a,EAAE7a,OACnBwB,EAAI4O,SAIb7B,EAAG5P,UAAU4Q,IAAM,SAAcjL,GAC/B,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCtB,KAAKoc,MAAMxW,EAAK9C,IAIzB+M,EAAG5P,UAAU+e,KAAO,SAAepZ,GACjC,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCya,EAAW/b,KAAM4F,EAAK9C,IAI/B+M,EAAG5P,UAAU2a,KAAO,SAAehV,GACjC,OAAO5F,KAAK2E,QAAQyX,MAAMxW,EAAK5F,OAGjC6P,EAAG5P,UAAU+R,MAAQ,SAAgBpM,GACnCxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UAIb,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAUzF,EAC1BkN,GAAU,SAAJtB,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASD,IAAO,GAChB9S,KAAKkQ,MAAM7E,GAAU,SAALyH,EAQlB,OALc,IAAVC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAGAtB,MAGT6P,EAAG5P,UAAUgf,KAAO,SAAerZ,GACjC,OAAO5F,KAAK2E,QAAQqN,MAAMpM,IAI5BiK,EAAG5P,UAAUif,IAAM,WACjB,OAAOlf,KAAK6Q,IAAI7Q,OAIlB6P,EAAG5P,UAAUkf,KAAO,WAClB,OAAOnf,KAAK4a,KAAK5a,KAAK2E,UAIxBkL,EAAG5P,UAAUiS,IAAM,SAActM,GAC/B,IAAI4L,EAxxCN,SAAqB5L,GAGnB,IAFA,IAAI4L,EAAI,IAAI9P,MAAMkE,EAAI6O,aAEb6B,EAAM,EAAGA,EAAM9E,EAAElQ,OAAQgV,IAAO,CACvC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB9E,EAAE8E,IAAQ1Q,EAAIsK,MAAMuB,GAAQ,GAAK8E,KAAWA,EAG9C,OAAO/E,EA8wCC4N,CAAWxZ,GACnB,GAAiB,IAAb4L,EAAElQ,OAAc,OAAO,IAAIuO,EAAG,GAIlC,IADA,IAAIrN,EAAMxC,KACDqL,EAAI,EAAGA,EAAImG,EAAElQ,QACP,IAATkQ,EAAEnG,GADsBA,IAAK7I,EAAMA,EAAI0c,OAI7C,KAAM7T,EAAImG,EAAElQ,OACV,IAAK,IAAI4S,EAAI1R,EAAI0c,MAAO7T,EAAImG,EAAElQ,OAAQ+J,IAAK6I,EAAIA,EAAEgL,MAClC,IAAT1N,EAAEnG,KAEN7I,EAAMA,EAAIqO,IAAIqD,IAIlB,OAAO1R,GAITqN,EAAG5P,UAAUof,OAAS,SAAiBC,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAGIjU,EAHAsF,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GACjB4O,EAAa,WAAe,GAAK5O,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoC,EAAQ,EAEZ,IAAK1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAChC,IAAImU,EAAWxf,KAAKkQ,MAAM7E,GAAKkU,EAC3B/O,GAAsB,EAAhBxQ,KAAKkQ,MAAM7E,IAAUmU,GAAa7O,EAC5C3Q,KAAKkQ,MAAM7E,GAAKmF,EAAIuC,EACpBA,EAAQyM,IAAc,GAAK7O,EAGzBoC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAIT,GAAU,IAAN6b,EAAS,CACX,IAAK9R,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAChCrL,KAAKkQ,MAAM7E,EAAI8R,GAAKnd,KAAKkQ,MAAM7E,GAGjC,IAAKA,EAAI,EAAGA,EAAI8R,EAAG9R,IACjBrL,KAAKkQ,MAAM7E,GAAK,EAGlBrL,KAAKsB,QAAU6b,EAGjB,OAAOnd,KAAK0R,SAGd7B,EAAG5P,UAAUwf,MAAQ,SAAgBH,GAGnC,OADAlc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKqf,OAAOC,IAMrBzP,EAAG5P,UAAUmU,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJxc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/O,EAAI2O,EAAO,GACXnC,EAAIrM,KAAK/D,KAAKuS,EAAO3O,GAAK,GAAI3Q,KAAKsB,QACnCue,EAAO,SAAc,WAAclP,GAAMA,EACzCmP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAI9O,KAAKC,IAAI,EAAG6O,GAGZE,EAAa,CACf,IAAK,IAAIzU,EAAI,EAAGA,EAAI8R,EAAG9R,IACrByU,EAAY5P,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAEpCyU,EAAYxe,OAAS6b,EAGvB,GAAU,IAANA,QAEG,GAAInd,KAAKsB,OAAS6b,EAEvB,IADAnd,KAAKsB,QAAU6b,EACV9R,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC3BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,EAAI8R,QAGjCnd,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,EAGhB,IAAIyR,EAAQ,EACZ,IAAK1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,IAAgB,IAAV0H,GAAe1H,GAAKuU,GAAIvU,IAAK,CAChE,IAAI0G,EAAuB,EAAhB/R,KAAKkQ,MAAM7E,GACtBrL,KAAKkQ,MAAM7E,GAAM0H,GAAU,GAAKpC,EAAOoB,IAASpB,EAChDoC,EAAQhB,EAAO8N,EAajB,OATIC,GAAyB,IAAV/M,IACjB+M,EAAY5P,MAAM4P,EAAYxe,UAAYyR,GAGxB,IAAhB/S,KAAKsB,SACPtB,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,GAGTtB,KAAK0R,SAGd7B,EAAG5P,UAAU8f,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAvc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKoU,OAAOkL,EAAMI,EAAMC,IAIjC9P,EAAG5P,UAAU+f,KAAO,SAAeV,GACjC,OAAOtf,KAAK2E,QAAQ8a,MAAMH,IAG5BzP,EAAG5P,UAAUggB,MAAQ,SAAgBX,GACnC,OAAOtf,KAAK2E,QAAQ0a,OAAOC,IAI7BzP,EAAG5P,UAAUigB,KAAO,SAAeZ,GACjC,OAAOtf,KAAK2E,QAAQob,MAAMT,IAG5BzP,EAAG5P,UAAUkgB,MAAQ,SAAgBb,GACnC,OAAOtf,KAAK2E,QAAQyP,OAAOkL,IAI7BzP,EAAG5P,UAAUiV,MAAQ,SAAgBoB,GACnClT,EAAsB,iBAARkT,GAAoBA,GAAO,GACzC,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,QAAI3Q,KAAKsB,QAAU6b,KAGXnd,KAAKkQ,MAAMiN,GAELjJ,KAIhBrE,EAAG5P,UAAUmgB,OAAS,SAAiBd,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAAI3O,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GAIrB,GAFAvN,EAAyB,IAAlBpD,KAAKiQ,SAAgB,2CAExBjQ,KAAKsB,QAAU6b,EACjB,OAAOnd,KAQT,GALU,IAAN2Q,GACFwM,IAEFnd,KAAKsB,OAASwP,KAAK/D,IAAIoQ,EAAGnd,KAAKsB,QAErB,IAANqP,EAAS,CACX,IAAIkP,EAAO,SAAc,WAAclP,GAAMA,EAC7C3Q,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IAAMue,EAGjC,OAAO7f,KAAK0R,SAId7B,EAAG5P,UAAUogB,MAAQ,SAAgBf,GACnC,OAAOtf,KAAK2E,QAAQyb,OAAOd,IAI7BzP,EAAG5P,UAAU+U,MAAQ,SAAgBpP,GAGnC,OAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAU5F,KAAKsgB,OAAO1a,GAGV,IAAlB5F,KAAKiQ,SACa,IAAhBjQ,KAAKsB,SAAiC,EAAhBtB,KAAKkQ,MAAM,IAAUtK,GAC7C5F,KAAKkQ,MAAM,GAAKtK,GAAuB,EAAhB5F,KAAKkQ,MAAM,IAClClQ,KAAKiQ,SAAW,EACTjQ,OAGTA,KAAKiQ,SAAW,EAChBjQ,KAAKsgB,MAAM1a,GACX5F,KAAKiQ,SAAW,EACTjQ,MAIFA,KAAKiS,OAAOrM,IAGrBiK,EAAG5P,UAAUgS,OAAS,SAAiBrM,GACrC5F,KAAKkQ,MAAM,IAAMtK,EAGjB,IAAK,IAAIyF,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,IAAM,SAAWA,IAC7DrL,KAAKkQ,MAAM7E,IAAM,SACbA,IAAMrL,KAAKsB,OAAS,EACtBtB,KAAKkQ,MAAM7E,EAAI,GAAK,EAEpBrL,KAAKkQ,MAAM7E,EAAI,KAKnB,OAFArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,EAAI,GAEjCrL,MAIT6P,EAAG5P,UAAUqgB,MAAQ,SAAgB1a,GAGnC,GAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAG,OAAO5F,KAAKgV,OAAOpP,GAEhC,GAAsB,IAAlB5F,KAAKiQ,SAIP,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKgV,MAAMpP,GACX5F,KAAKiQ,SAAW,EACTjQ,KAKT,GAFAA,KAAKkQ,MAAM,IAAMtK,EAEG,IAAhB5F,KAAKsB,QAAgBtB,KAAKkQ,MAAM,GAAK,EACvClQ,KAAKkQ,MAAM,IAAMlQ,KAAKkQ,MAAM,GAC5BlQ,KAAKiQ,SAAW,OAGhB,IAAK,IAAI5E,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,GAAK,EAAGA,IACpDrL,KAAKkQ,MAAM7E,IAAM,SACjBrL,KAAKkQ,MAAM7E,EAAI,IAAM,EAIzB,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUsgB,KAAO,SAAe3a,GACjC,OAAO5F,KAAK2E,QAAQqQ,MAAMpP,IAG5BiK,EAAG5P,UAAUugB,KAAO,SAAe5a,GACjC,OAAO5F,KAAK2E,QAAQ2b,MAAM1a,IAG5BiK,EAAG5P,UAAUwgB,KAAO,WAGlB,OAFAzgB,KAAKiQ,SAAW,EAETjQ,MAGT6P,EAAG5P,UAAU6U,IAAM,WACjB,OAAO9U,KAAK2E,QAAQ8b,QAGtB5Q,EAAG5P,UAAUygB,aAAe,SAAuB9a,EAAKiL,EAAK8P,GAC3D,IACItV,EAIAmG,EALApG,EAAMxF,EAAItE,OAASqf,EAGvB3gB,KAAKoS,QAAQhH,GAGb,IAAI2H,EAAQ,EACZ,IAAK1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CAC/BmG,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,EAClC,IAAI9B,GAAwB,EAAfrL,EAAIsK,MAAM7E,IAAUwF,EAEjCkC,IADAvB,GAAa,SAARP,IACS,KAAQA,EAAQ,SAAa,GAC3CjR,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAE1B,KAAOnG,EAAIrL,KAAKsB,OAASqf,EAAOtV,IAE9B0H,GADAvB,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,IACrB,GACb/S,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAG1B,GAAc,IAAVuB,EAAa,OAAO/S,KAAK0R,QAK7B,IAFAtO,GAAkB,IAAX2P,GACPA,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAE3B0H,GADAvB,IAAsB,EAAhBxR,KAAKkQ,MAAM7E,IAAU0H,IACd,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJmG,EAIlB,OAFAxR,KAAKiQ,SAAW,EAETjQ,KAAK0R,SAGd7B,EAAG5P,UAAU2gB,SAAW,SAAmBhb,EAAKib,GAC9C,IAAIF,GAAQ3gB,KAAKsB,OAASsE,EAAItE,QAE1BsR,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAGJkb,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,GAGf,IADdqf,EAAQ,GADM3gB,KAAKsU,WAAWwM,MAG5BjO,EAAIA,EAAEoN,MAAMU,GACZ/N,EAAEyM,OAAOsB,GACTG,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,IAI3B,IACI4S,EADAnV,EAAI6T,EAAEtR,OAASuR,EAAEvR,OAGrB,GAAa,QAATuf,EAAgB,EAClB3M,EAAI,IAAIrE,EAAG,OACTvO,OAASvC,EAAI,EACfmV,EAAEhE,MAAQ,IAAIxO,MAAMwS,EAAE5S,QACtB,IAAK,IAAI+J,EAAI,EAAGA,EAAI6I,EAAE5S,OAAQ+J,IAC5B6I,EAAEhE,MAAM7E,GAAK,EAIjB,IAAI0V,EAAOnO,EAAEjO,QAAQ+b,aAAa7N,EAAG,EAAG9T,GAClB,IAAlBgiB,EAAK9Q,WACP2C,EAAImO,EACA7M,IACFA,EAAEhE,MAAMnR,GAAK,IAIjB,IAAK,IAAIuM,EAAIvM,EAAI,EAAGuM,GAAK,EAAGA,IAAK,CAC/B,IAAI0V,EAAmC,UAAL,EAAxBpO,EAAE1C,MAAM2C,EAAEvR,OAASgK,KACE,EAA5BsH,EAAE1C,MAAM2C,EAAEvR,OAASgK,EAAI,IAO1B,IAHA0V,EAAKlQ,KAAK/D,IAAKiU,EAAKF,EAAO,EAAG,UAE9BlO,EAAE8N,aAAa7N,EAAGmO,EAAI1V,GACA,IAAfsH,EAAE3C,UACP+Q,IACApO,EAAE3C,SAAW,EACb2C,EAAE8N,aAAa7N,EAAG,EAAGvH,GAChBsH,EAAEW,WACLX,EAAE3C,UAAY,GAGdiE,IACFA,EAAEhE,MAAM5E,GAAK0V,GAajB,OAVI9M,GACFA,EAAExC,QAEJkB,EAAElB,QAGW,QAATmP,GAA4B,IAAVF,GACpB/N,EAAEwB,OAAOuM,GAGJ,CACLM,IAAK/M,GAAK,KACVpC,IAAKc,IAQT/C,EAAG5P,UAAUihB,OAAS,SAAiBtb,EAAKib,EAAMM,GAGhD,OAFA/d,GAAQwC,EAAI2N,UAERvT,KAAKuT,SACA,CACL0N,IAAK,IAAIpR,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB7P,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAKib,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGH,QAATuL,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI0E,KAAK5Q,IAIN,CACLqb,IAAKA,EACLnP,IAAKA,IAIa,IAAlB9R,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKkhB,OAAOtb,EAAI0P,MAAOuL,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGT,CACL2L,IAAKA,EACLnP,IAAKtP,EAAIsP,MAI0B,IAAlC9R,KAAKiQ,SAAWrK,EAAIqK,WACvBzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAI0P,MAAOuL,GAEtB,QAATA,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI2E,KAAK7Q,IAIN,CACLqb,IAAKze,EAAIye,IACTnP,IAAKA,IAOLlM,EAAItE,OAAStB,KAAKsB,QAAUtB,KAAKkR,IAAItL,GAAO,EACvC,CACLqb,IAAK,IAAIpR,EAAG,GACZiC,IAAK9R,MAKU,IAAf4F,EAAItE,OACO,QAATuf,EACK,CACLI,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,MAII,QAAT+O,EACK,CACLI,IAAK,KACLnP,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7B,CACL+Q,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7BlQ,KAAK4gB,SAAShb,EAAKib,GAlF1B,IAAII,EAAKnP,EAAKtP,GAsFhBqN,EAAG5P,UAAUghB,IAAM,SAAcrb,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOqb,KAIxCpR,EAAG5P,UAAU6R,IAAM,SAAclM,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOkM,KAGxCjC,EAAG5P,UAAUohB,KAAO,SAAezb,GACjC,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAMkM,KAIvCjC,EAAG5P,UAAUqhB,SAAW,SAAmB1b,GACzC,IAAI2b,EAAKvhB,KAAKkhB,OAAOtb,GAGrB,GAAI2b,EAAGzP,IAAIyB,SAAU,OAAOgO,EAAGN,IAE/B,IAAInP,EAA0B,IAApByP,EAAGN,IAAIhR,SAAiBsR,EAAGzP,IAAI2E,KAAK7Q,GAAO2b,EAAGzP,IAEpD0P,EAAO5b,EAAIua,MAAM,GACjBsB,EAAK7b,EAAIuO,MAAM,GACfjD,EAAMY,EAAIZ,IAAIsQ,GAGlB,OAAItQ,EAAM,GAAY,IAAPuQ,GAAoB,IAARvQ,EAAkBqQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAG5P,UAAUuT,KAAO,SAAe5N,GACjCxC,EAAOwC,GAAO,UAId,IAHA,IAAI4J,GAAK,GAAK,IAAM5J,EAEhB8b,EAAM,EACDrW,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IACpCqW,GAAOlS,EAAIkS,GAAuB,EAAhB1hB,KAAKkQ,MAAM7E,KAAWzF,EAG1C,OAAO8b,GAIT7R,EAAG5P,UAAUwT,MAAQ,SAAgB7N,GACnCxC,EAAOwC,GAAO,UAGd,IADA,IAAImN,EAAQ,EACH1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAkB,SAAR0H,EAC9B/S,KAAKkQ,MAAM7E,GAAMmG,EAAI5L,EAAO,EAC5BmN,EAAQvB,EAAI5L,EAGd,OAAO5F,KAAK0R,SAGd7B,EAAG5P,UAAUmhB,KAAO,SAAexb,GACjC,OAAO5F,KAAK2E,QAAQ8O,MAAM7N,IAG5BiK,EAAG5P,UAAU0hB,KAAO,SAAenS,GACjCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAI2I,EAAIlc,KACJmc,EAAI3M,EAAE7K,QAGRuX,EADiB,IAAfA,EAAEjM,SACAiM,EAAEmF,KAAK7R,GAEP0M,EAAEvX,QAaR,IATA,IAAIid,EAAI,IAAI/R,EAAG,GACXgS,EAAI,IAAIhS,EAAG,GAGXiS,EAAI,IAAIjS,EAAG,GACXkS,EAAI,IAAIlS,EAAG,GAEXmS,EAAI,EAED9F,EAAE+F,UAAY9F,EAAE8F,UACrB/F,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP4N,EAMJ,IAHA,IAAIE,EAAK/F,EAAExX,QACPwd,EAAKjG,EAAEvX,SAEHuX,EAAE3I,UAAU,CAClB,IAAK,IAAIlI,EAAI,EAAG+W,EAAK,EAAyB,IAArBlG,EAAEhM,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADA6Q,EAAE9H,OAAO/I,GACFA,KAAM,IACPuW,EAAES,SAAWR,EAAEQ,WACjBT,EAAEpL,KAAK0L,GACPL,EAAEpL,KAAK0L,IAGTP,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIb,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBnG,EAAEjM,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADA6Q,EAAE/H,OAAO9I,GACFA,KAAM,IACPwW,EAAEO,SAAWN,EAAEM,WACjBP,EAAEtL,KAAK0L,GACPH,EAAEtL,KAAK0L,IAGTL,EAAE1N,OAAO,GACT2N,EAAE3N,OAAO,GAIT8H,EAAEhL,IAAIiL,IAAM,GACdD,EAAEzF,KAAK0F,GACPyF,EAAEnL,KAAKqL,GACPD,EAAEpL,KAAKsL,KAEP5F,EAAE1F,KAAKyF,GACP4F,EAAErL,KAAKmL,GACPG,EAAEtL,KAAKoL,IAIX,MAAO,CACLjP,EACAC,EAAGkP,EACHQ,IAAKpG,EAAEkD,OAAO2C,KAOlBnS,EAAG5P,UAAUuiB,OAAS,SAAiBhT,GACrCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAIX,EAAI5S,KACJ6S,EAAIrD,EAAE7K,QAGRiO,EADiB,IAAfA,EAAE3C,SACA2C,EAAEyO,KAAK7R,GAEPoD,EAAEjO,QAQR,IALA,IAuCInC,EAvCAigB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ9P,EAAElO,QAEPiO,EAAEgQ,KAAK,GAAK,GAAK/P,EAAE+P,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIvX,EAAI,EAAG+W,EAAK,EAAyB,IAArBxP,EAAE1C,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADAuH,EAAEwB,OAAO/I,GACFA,KAAM,GACPoX,EAAGJ,SACLI,EAAGjM,KAAKmM,GAGVF,EAAGrO,OAAO,GAId,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBzP,EAAE3C,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADAuH,EAAEuB,OAAO9I,GACFA,KAAM,GACPoX,EAAGL,SACLK,EAAGlM,KAAKmM,GAGVD,EAAGtO,OAAO,GAIVxB,EAAE1B,IAAI2B,IAAM,GACdD,EAAE6D,KAAK5D,GACP4P,EAAGhM,KAAKiM,KAER7P,EAAE4D,KAAK7D,GACP8P,EAAGjM,KAAKgM,IAeZ,OATEjgB,EADgB,IAAdoQ,EAAEgQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKhH,GAGJhN,GAGTqN,EAAG5P,UAAUsiB,IAAM,SAAc3c,GAC/B,GAAI5F,KAAKuT,SAAU,OAAO3N,EAAIkP,MAC9B,GAAIlP,EAAI2N,SAAU,OAAOvT,KAAK8U,MAE9B,IAAIlC,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAAIjB,QACZiO,EAAE3C,SAAW,EACb4C,EAAE5C,SAAW,EAGb,IAAK,IAAI0Q,EAAQ,EAAG/N,EAAEqP,UAAYpP,EAAEoP,SAAUtB,IAC5C/N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,OAAG,CACD,KAAOxB,EAAEqP,UACPrP,EAAEwB,OAAO,GAEX,KAAOvB,EAAEoP,UACPpP,EAAEuB,OAAO,GAGX,IAAIzD,EAAIiC,EAAE1B,IAAI2B,GACd,GAAIlC,EAAI,EAAG,CAET,IAAI4D,EAAI3B,EACRA,EAAIC,EACJA,EAAI0B,OACC,GAAU,IAAN5D,GAAyB,IAAdkC,EAAE+P,KAAK,GAC3B,MAGFhQ,EAAE6D,KAAK5D,GAGT,OAAOA,EAAEwM,OAAOsB,IAIlB9Q,EAAG5P,UAAU4iB,KAAO,SAAejd,GACjC,OAAO5F,KAAK2hB,KAAK/b,GAAKgN,EAAEyO,KAAKzb,IAG/BiK,EAAG5P,UAAUgiB,OAAS,WACpB,OAA+B,IAAP,EAAhBjiB,KAAKkQ,MAAM,KAGrBL,EAAG5P,UAAUoiB,MAAQ,WACnB,OAA+B,IAAP,EAAhBriB,KAAKkQ,MAAM,KAIrBL,EAAG5P,UAAUkU,MAAQ,SAAgBvO,GACnC,OAAO5F,KAAKkQ,MAAM,GAAKtK,GAIzBiK,EAAG5P,UAAU6iB,MAAQ,SAAgBxM,GACnClT,EAAsB,iBAARkT,GACd,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,GAAI3Q,KAAKsB,QAAU6b,EAGjB,OAFAnd,KAAKoS,QAAQ+K,EAAI,GACjBnd,KAAKkQ,MAAMiN,IAAMjJ,EACVlU,KAKT,IADA,IAAI+S,EAAQmB,EACH7I,EAAI8R,EAAa,IAAVpK,GAAe1H,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACnD,IAAImG,EAAoB,EAAhBxR,KAAKkQ,MAAM7E,GAEnB0H,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACLxR,KAAKkQ,MAAM7E,GAAKmG,EAMlB,OAJc,IAAVuB,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAEAtB,MAGT6P,EAAG5P,UAAUsT,OAAS,WACpB,OAAuB,IAAhBvT,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,IAGzCL,EAAG5P,UAAU2iB,KAAO,SAAehd,GACjC,IAOIpD,EAPAyN,EAAWrK,EAAM,EAErB,GAAsB,IAAlB5F,KAAKiQ,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBjQ,KAAKiQ,UAAkBA,EAAU,OAAO,EAK5C,GAHAjQ,KAAK0R,QAGD1R,KAAKsB,OAAS,EAChBkB,EAAM,MACD,CACDyN,IACFrK,GAAOA,GAGTxC,EAAOwC,GAAO,SAAW,qBAEzB,IAAI4L,EAAoB,EAAhBxR,KAAKkQ,MAAM,GACnB1N,EAAMgP,IAAM5L,EAAM,EAAI4L,EAAI5L,GAAO,EAAI,EAEvC,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAOTqN,EAAG5P,UAAUiR,IAAM,SAActL,GAC/B,GAAsB,IAAlB5F,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAQ,EACvD,GAAsB,IAAlBjQ,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAO,EAEtD,IAAIzN,EAAMxC,KAAK+iB,KAAKnd,GACpB,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAITqN,EAAG5P,UAAU8iB,KAAO,SAAend,GAEjC,GAAI5F,KAAKsB,OAASsE,EAAItE,OAAQ,OAAO,EACrC,GAAItB,KAAKsB,OAASsE,EAAItE,OAAQ,OAAQ,EAGtC,IADA,IAAIkB,EAAM,EACD6I,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAIuH,EAAoB,EAAhB5S,KAAKkQ,MAAM7E,GACfwH,EAAmB,EAAfjN,EAAIsK,MAAM7E,GAElB,GAAIuH,IAAMC,EAAV,CACID,EAAIC,EACNrQ,GAAO,EACEoQ,EAAIC,IACbrQ,EAAM,GAER,OAEF,OAAOA,GAGTqN,EAAG5P,UAAU+iB,IAAM,SAAcpd,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUgjB,GAAK,SAAard,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUijB,KAAO,SAAetd,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUkjB,IAAM,SAAcvd,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUmjB,IAAM,SAAcxd,GAC/B,OAA2B,IAApB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUojB,GAAK,SAAazd,GAC7B,OAA0B,IAAnB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUqjB,KAAO,SAAe1d,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUsjB,IAAM,SAAc3d,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUujB,IAAM,SAAc5d,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUwjB,GAAK,SAAa7d,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAOlBiK,EAAGM,IAAM,SAAcvK,GACrB,OAAO,IAAI8d,EAAI9d,IAGjBiK,EAAG5P,UAAU0jB,MAAQ,SAAgBC,GAGnC,OAFAxgB,GAAQpD,KAAKmQ,IAAK,yCAClB/M,EAAyB,IAAlBpD,KAAKiQ,SAAgB,iCACrB2T,EAAIC,UAAU7jB,MAAM8jB,UAAUF,IAGvC/T,EAAG5P,UAAU8jB,QAAU,WAErB,OADA3gB,EAAOpD,KAAKmQ,IAAK,wDACVnQ,KAAKmQ,IAAI6T,YAAYhkB,OAG9B6P,EAAG5P,UAAU6jB,UAAY,SAAoBF,GAE3C,OADA5jB,KAAKmQ,IAAMyT,EACJ5jB,MAGT6P,EAAG5P,UAAUgkB,SAAW,SAAmBL,GAEzC,OADAxgB,GAAQpD,KAAKmQ,IAAK,yCACXnQ,KAAK8jB,UAAUF,IAGxB/T,EAAG5P,UAAUikB,OAAS,SAAiBte,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIuG,IAAI1W,KAAM4F,IAG5BiK,EAAG5P,UAAUkkB,QAAU,SAAkBve,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIqG,KAAKxW,KAAM4F,IAG7BiK,EAAG5P,UAAUmkB,OAAS,SAAiBxe,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIwG,IAAI3W,KAAM4F,IAG5BiK,EAAG5P,UAAUokB,QAAU,SAAkBze,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIsG,KAAKzW,KAAM4F,IAG7BiK,EAAG5P,UAAUqkB,OAAS,SAAiB1e,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIoU,IAAIvkB,KAAM4F,IAG5BiK,EAAG5P,UAAUukB,OAAS,SAAiB5e,GAGrC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIU,IAAI7Q,KAAM4F,IAG5BiK,EAAG5P,UAAUykB,QAAU,SAAkB9e,GAGvC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIyK,KAAK5a,KAAM4F,IAG7BiK,EAAG5P,UAAU0kB,OAAS,WAGpB,OAFAvhB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+O,IAAIlf,OAGtB6P,EAAG5P,UAAU4kB,QAAU,WAGrB,OAFAzhB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAIgP,KAAKnf,OAIvB6P,EAAG5P,UAAU6kB,QAAU,WAGrB,OAFA1hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI4U,KAAK/kB,OAGvB6P,EAAG5P,UAAU+kB,QAAU,WAGrB,OAFA5hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI0S,KAAK7iB,OAIvB6P,EAAG5P,UAAUglB,OAAS,WAGpB,OAFA7hB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAImF,IAAItV,OAGtB6P,EAAG5P,UAAUilB,OAAS,SAAiBtf,GAGrC,OAFAxC,EAAOpD,KAAKmQ,MAAQvK,EAAIuK,IAAK,qBAC7BnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+B,IAAIlS,KAAM4F,IAI5B,IAAIuf,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ1lB,EAAM0P,GAErBxP,KAAKF,KAAOA,EACZE,KAAKwP,EAAI,IAAIK,EAAGL,EAAG,IACnBxP,KAAKge,EAAIhe,KAAKwP,EAAEiF,YAChBzU,KAAKgT,EAAI,IAAInD,EAAG,GAAGwP,OAAOrf,KAAKge,GAAGvH,KAAKzW,KAAKwP,GAE5CxP,KAAK0M,IAAM1M,KAAKylB,OAiDlB,SAASC,IACPF,EAAOjlB,KACLP,KACA,OACA,2EA+DJ,SAAS2lB,IACPH,EAAOjlB,KACLP,KACA,OACA,kEAIJ,SAAS4lB,IACPJ,EAAOjlB,KACLP,KACA,OACA,yDAIJ,SAAS6lB,IAEPL,EAAOjlB,KACLP,KACA,QACA,uEA8CJ,SAAS0jB,EAAK3kB,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAI+mB,EAAQjW,EAAGkW,OAAOhnB,GACtBiB,KAAKjB,EAAI+mB,EAAMtW,EACfxP,KAAK8lB,MAAQA,OAEb1iB,EAAOrE,EAAEikB,IAAI,GAAI,kCACjBhjB,KAAKjB,EAAIA,EACTiB,KAAK8lB,MAAQ,KAkOjB,SAASE,EAAMjnB,GACb2kB,EAAInjB,KAAKP,KAAMjB,GAEfiB,KAAK2gB,MAAQ3gB,KAAKjB,EAAE0V,YAChBzU,KAAK2gB,MAAQ,IAAO,IACtB3gB,KAAK2gB,OAAS,GAAM3gB,KAAK2gB,MAAQ,IAGnC3gB,KAAK2Q,EAAI,IAAId,EAAG,GAAGwP,OAAOrf,KAAK2gB,OAC/B3gB,KAAKyhB,GAAKzhB,KAAKimB,KAAKjmB,KAAK2Q,EAAEuO,OAC3Blf,KAAKkmB,KAAOlmB,KAAK2Q,EAAE6R,OAAOxiB,KAAKjB,GAE/BiB,KAAKmmB,KAAOnmB,KAAKkmB,KAAKrV,IAAI7Q,KAAK2Q,GAAG2P,MAAM,GAAGW,IAAIjhB,KAAKjB,GACpDiB,KAAKmmB,KAAOnmB,KAAKmmB,KAAK9E,KAAKrhB,KAAK2Q,GAChC3Q,KAAKmmB,KAAOnmB,KAAK2Q,EAAEgG,IAAI3W,KAAKmmB,MA5a9BX,EAAOvlB,UAAUwlB,KAAO,WACtB,IAAI/Y,EAAM,IAAImD,EAAG,MAEjB,OADAnD,EAAIwD,MAAQ,IAAIxO,MAAMoP,KAAKS,KAAKvR,KAAKge,EAAI,KAClCtR,GAGT8Y,EAAOvlB,UAAUmmB,QAAU,SAAkBxgB,GAG3C,IACIygB,EADA1V,EAAI/K,EAGR,GACE5F,KAAKsN,MAAMqD,EAAG3Q,KAAK0M,KAGnB2Z,GADA1V,GADAA,EAAI3Q,KAAKsmB,MAAM3V,IACT6F,KAAKxW,KAAK0M,MACP+H,kBACF4R,EAAOrmB,KAAKge,GAErB,IAAI9M,EAAMmV,EAAOrmB,KAAKge,GAAK,EAAIrN,EAAEoS,KAAK/iB,KAAKwP,GAgB3C,OAfY,IAAR0B,GACFP,EAAET,MAAM,GAAK,EACbS,EAAErP,OAAS,GACF4P,EAAM,EACfP,EAAE8F,KAAKzW,KAAKwP,QAEIpH,IAAZuI,EAAEe,MAEJf,EAAEe,QAGFf,EAAE4V,SAIC5V,GAGT6U,EAAOvlB,UAAUqN,MAAQ,SAAgBvH,EAAOjD,GAC9CiD,EAAMqO,OAAOpU,KAAKge,EAAG,EAAGlb,IAG1B0iB,EAAOvlB,UAAUqmB,MAAQ,SAAgB1gB,GACvC,OAAOA,EAAIgV,KAAK5a,KAAKgT,IASvBpT,EAAS8lB,EAAMF,GAEfE,EAAKzlB,UAAUqN,MAAQ,SAAgBvH,EAAOygB,GAK5C,IAHA,IAAI3G,EAAO,QAEP4G,EAAS3V,KAAK/D,IAAIhH,EAAMzE,OAAQ,GAC3B+J,EAAI,EAAGA,EAAIob,EAAQpb,IAC1Bmb,EAAOtW,MAAM7E,GAAKtF,EAAMmK,MAAM7E,GAIhC,GAFAmb,EAAOllB,OAASmlB,EAEZ1gB,EAAMzE,QAAU,EAGlB,OAFAyE,EAAMmK,MAAM,GAAK,OACjBnK,EAAMzE,OAAS,GAKjB,IAAIuI,EAAO9D,EAAMmK,MAAM,GAGvB,IAFAsW,EAAOtW,MAAMsW,EAAOllB,UAAYuI,EAAOgW,EAElCxU,EAAI,GAAIA,EAAItF,EAAMzE,OAAQ+J,IAAK,CAClC,IAAIqb,EAAwB,EAAjB3gB,EAAMmK,MAAM7E,GACvBtF,EAAMmK,MAAM7E,EAAI,KAAQqb,EAAO7G,IAAS,EAAMhW,IAAS,GACvDA,EAAO6c,EAET7c,KAAU,GACV9D,EAAMmK,MAAM7E,EAAI,IAAMxB,EACT,IAATA,GAAc9D,EAAMzE,OAAS,GAC/ByE,EAAMzE,QAAU,GAEhByE,EAAMzE,QAAU,GAIpBokB,EAAKzlB,UAAUqmB,MAAQ,SAAgB1gB,GAErCA,EAAIsK,MAAMtK,EAAItE,QAAU,EACxBsE,EAAIsK,MAAMtK,EAAItE,OAAS,GAAK,EAC5BsE,EAAItE,QAAU,EAId,IADA,IAAIwR,EAAK,EACAzH,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAImG,EAAmB,EAAf5L,EAAIsK,MAAM7E,GAClByH,GAAU,IAAJtB,EACN5L,EAAIsK,MAAM7E,GAAU,SAALyH,EACfA,EAAS,GAAJtB,GAAasB,EAAK,SAAa,GAUtC,OANkC,IAA9BlN,EAAIsK,MAAMtK,EAAItE,OAAS,KACzBsE,EAAItE,SAC8B,IAA9BsE,EAAIsK,MAAMtK,EAAItE,OAAS,IACzBsE,EAAItE,UAGDsE,GASThG,EAAS+lB,EAAMH,GAQf5lB,EAASgmB,EAAMJ,GASf5lB,EAASimB,EAAQL,GAEjBK,EAAO5lB,UAAUqmB,MAAQ,SAAgB1gB,GAGvC,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAIqJ,EAA0B,IAAL,EAAf9O,EAAIsK,MAAM7E,IAAiB0H,EACjCD,EAAU,SAAL4B,EACTA,KAAQ,GAER9O,EAAIsK,MAAM7E,GAAKyH,EACfC,EAAQ2B,EAKV,OAHc,IAAV3B,IACFnN,EAAIsK,MAAMtK,EAAItE,UAAYyR,GAErBnN,GAITiK,EAAGkW,OAAS,SAAgBjmB,GAE1B,GAAIqlB,EAAOrlB,GAAO,OAAOqlB,EAAOrlB,GAEhC,IAAIgmB,EACJ,GAAa,SAAThmB,EACFgmB,EAAQ,IAAIJ,OACP,GAAa,SAAT5lB,EACTgmB,EAAQ,IAAIH,OACP,GAAa,SAAT7lB,EACTgmB,EAAQ,IAAIF,MACP,IAAa,WAAT9lB,EAGT,MAAM,IAAIb,MAAM,iBAAmBa,GAFnCgmB,EAAQ,IAAID,EAMd,OAFAV,EAAOrlB,GAAQgmB,EAERA,GAkBTpC,EAAIzjB,UAAU2kB,SAAW,SAAmBhS,GAC1CxP,EAAsB,IAAfwP,EAAE3C,SAAgB,iCACzB7M,EAAOwP,EAAEzC,IAAK,oCAGhBuT,EAAIzjB,UAAUwkB,SAAW,SAAmB7R,EAAGC,GAC7CzP,EAAqC,IAA7BwP,EAAE3C,SAAW4C,EAAE5C,UAAiB,iCACxC7M,EAAOwP,EAAEzC,KAAOyC,EAAEzC,MAAQ0C,EAAE1C,IAC1B,oCAGJuT,EAAIzjB,UAAUgmB,KAAO,SAAerT,GAClC,OAAI5S,KAAK8lB,MAAc9lB,KAAK8lB,MAAMM,QAAQxT,GAAGkR,UAAU9jB,MAChD4S,EAAEyO,KAAKrhB,KAAKjB,GAAG+kB,UAAU9jB,OAGlC0jB,EAAIzjB,UAAUqV,IAAM,SAAc1C,GAChC,OAAIA,EAAEW,SACGX,EAAEjO,QAGJ3E,KAAKjB,EAAE4X,IAAI/D,GAAGkR,UAAU9jB,OAGjC0jB,EAAIzjB,UAAUyW,IAAM,SAAc9D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE8D,IAAI7D,GAIhB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUuW,KAAO,SAAe5D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE4D,KAAK3D,GAIjB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAU0W,IAAM,SAAc/D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE+D,IAAI9D,GAIhB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUwW,KAAO,SAAe7D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE6D,KAAK5D,GAIjB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAUskB,IAAM,SAAc3R,EAAGhN,GAEnC,OADA5F,KAAK4kB,SAAShS,GACP5S,KAAKimB,KAAKrT,EAAEqN,MAAMra,KAG3B8d,EAAIzjB,UAAU2a,KAAO,SAAehI,EAAGC,GAErC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAEgI,KAAK/H,KAG1B6Q,EAAIzjB,UAAU4Q,IAAM,SAAc+B,EAAGC,GAEnC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAE/B,IAAIgC,KAGzB6Q,EAAIzjB,UAAUkf,KAAO,SAAevM,GAClC,OAAO5S,KAAK4a,KAAKhI,EAAGA,EAAEjO,UAGxB+e,EAAIzjB,UAAUif,IAAM,SAActM,GAChC,OAAO5S,KAAK6Q,IAAI+B,EAAGA,IAGrB8Q,EAAIzjB,UAAU8kB,KAAO,SAAenS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEjO,QAEzB,IAAIgiB,EAAO3mB,KAAKjB,EAAEoV,MAAM,GAIxB,GAHA/Q,EAAOujB,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIzU,EAAMlS,KAAKjB,EAAE2X,IAAI,IAAI7G,EAAG,IAAIuE,OAAO,GACvC,OAAOpU,KAAKkS,IAAIU,EAAGV,GAQrB,IAFA,IAAIgC,EAAIlU,KAAKjB,EAAEyhB,KAAK,GAChBrD,EAAI,GACAjJ,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXhR,GAAQ8Q,EAAEX,UAEV,IAAIqT,EAAM,IAAI/W,EAAG,GAAG8T,MAAM3jB,MACtB6mB,EAAOD,EAAI3B,SAIX6B,EAAO9mB,KAAKjB,EAAEyhB,KAAK,GAAGpM,OAAO,GAC7B2S,EAAI/mB,KAAKjB,EAAE0V,YAGf,IAFAsS,EAAI,IAAIlX,EAAG,EAAIkX,EAAIA,GAAGpD,MAAM3jB,MAEW,IAAhCA,KAAKkS,IAAI6U,EAAGD,GAAM5V,IAAI2V,IAC3BE,EAAE5C,QAAQ0C,GAOZ,IAJA,IAAIrW,EAAIxQ,KAAKkS,IAAI6U,EAAG7S,GAChBvD,EAAI3Q,KAAKkS,IAAIU,EAAGsB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAIvU,KAAKkS,IAAIU,EAAGsB,GAChBnV,EAAIoe,EACc,IAAf5I,EAAErD,IAAI0V,IAAY,CAEvB,IADA,IAAIla,EAAM6H,EACDlJ,EAAI,EAAoB,IAAjBqB,EAAIwE,IAAI0V,GAAYvb,IAClCqB,EAAMA,EAAIiY,SAEZvhB,EAAOiI,EAAItM,GACX,IAAI8T,EAAI7S,KAAKkS,IAAI1B,EAAG,IAAIX,EAAG,GAAGwP,OAAOtgB,EAAIsM,EAAI,IAE7CsF,EAAIA,EAAE6T,OAAO3R,GACbrC,EAAIqC,EAAE8R,SACNpQ,EAAIA,EAAEiQ,OAAOhU,GACbzR,EAAIsM,EAGN,OAAOsF,GAGT+S,EAAIzjB,UAAU4iB,KAAO,SAAejQ,GAClC,IAAIoU,EAAMpU,EAAE4P,OAAOxiB,KAAKjB,GACxB,OAAqB,IAAjBioB,EAAI/W,UACN+W,EAAI/W,SAAW,EACRjQ,KAAKimB,KAAKe,GAAK/B,UAEfjlB,KAAKimB,KAAKe,IAIrBtD,EAAIzjB,UAAUiS,IAAM,SAAcU,EAAGhN,GACnC,GAAIA,EAAI2N,SAAU,OAAO,IAAI1D,EAAG,GAAG8T,MAAM3jB,MACzC,GAAoB,IAAhB4F,EAAIgd,KAAK,GAAU,OAAOhQ,EAAEjO,QAEhC,IACIsiB,EAAM,IAAIvlB,MAAM,IACpBulB,EAAI,GAAK,IAAIpX,EAAG,GAAG8T,MAAM3jB,MACzBinB,EAAI,GAAKrU,EACT,IAAK,IAAIvH,EAAI,EAAGA,EAAI4b,EAAI3lB,OAAQ+J,IAC9B4b,EAAI5b,GAAKrL,KAAK6Q,IAAIoW,EAAI5b,EAAI,GAAIuH,GAGhC,IAAIpQ,EAAMykB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtgB,EAAQjB,EAAI6O,YAAc,GAK9B,IAJc,IAAV5N,IACFA,EAAQ,IAGLwE,EAAIzF,EAAItE,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI0G,EAAOnM,EAAIsK,MAAM7E,GACZC,EAAIzE,EAAQ,EAAGyE,GAAK,EAAGA,IAAK,CACnC,IAAIgL,EAAOvE,GAAQzG,EAAK,EACpB9I,IAAQykB,EAAI,KACdzkB,EAAMxC,KAAKkf,IAAI1c,IAGL,IAAR8T,GAAyB,IAAZ4Q,GAKjBA,IAAY,EACZA,GAAW5Q,GA9BE,KA+Bb6Q,GACwC,IAAN9b,GAAiB,IAANC,KAE7C9I,EAAMxC,KAAK6Q,IAAIrO,EAAKykB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtgB,EAAQ,GAGV,OAAOrE,GAGTkhB,EAAIzjB,UAAU4jB,UAAY,SAAoBje,GAC5C,IAAI+K,EAAI/K,EAAIyb,KAAKrhB,KAAKjB,GAEtB,OAAO4R,IAAM/K,EAAM+K,EAAEhM,QAAUgM,GAGjC+S,EAAIzjB,UAAU+jB,YAAc,SAAsBpe,GAChD,IAAIpD,EAAMoD,EAAIjB,QAEd,OADAnC,EAAI2N,IAAM,KACH3N,GAOTqN,EAAGuX,KAAO,SAAexhB,GACvB,OAAO,IAAIogB,EAAKpgB,IAmBlBhG,EAASomB,EAAMtC,GAEfsC,EAAK/lB,UAAU4jB,UAAY,SAAoBje,GAC7C,OAAO5F,KAAKimB,KAAKrgB,EAAIqa,MAAMjgB,KAAK2gB,SAGlCqF,EAAK/lB,UAAU+jB,YAAc,SAAsBpe,GACjD,IAAI+K,EAAI3Q,KAAKimB,KAAKrgB,EAAIiL,IAAI7Q,KAAKkmB,OAE/B,OADAvV,EAAER,IAAM,KACDQ,GAGTqV,EAAK/lB,UAAU2a,KAAO,SAAehI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE1C,MAAM,GAAK,EACb0C,EAAEtR,OAAS,EACJsR,EAGT,IAAI2B,EAAI3B,EAAEgI,KAAK/H,GACXrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAQV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4Q,IAAM,SAAc+B,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI1D,EAAG,GAAGiU,UAAU9jB,MAEzD,IAAIuU,EAAI3B,EAAE/B,IAAIgC,GACVrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAOV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4iB,KAAO,SAAejQ,GAGnC,OADU5S,KAAKimB,KAAKrT,EAAE4P,OAAOxiB,KAAKjB,GAAG8R,IAAI7Q,KAAKyhB,KACnCqC,UAAU9jB,OAn3GzB,YAq3G4CA,wDCp3G5CwF,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAM2vE,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAoB,EAAQ,MAC5BC,EAAoB,EAAQ,MAC5BC,EAAmB,EAAQ,MAMjC9yE,EAAQ+yE,yBALR,MACIxvE,cACIjC,KAAK0xE,aAAe,KAI5B,MAAMC,UAA0BP,EAASr6B,UACrC90C,YAAYpB,EAAU,IAClBugC,MAAM57B,OAAO+iB,OAAO,GAAI1nB,EAAS,CAAE+wE,oBAAoB,KACvD5xE,KAAK6xE,qBAAuB,EAC5B7xE,KAAK8xE,UAAY,GACjB9xE,KAAKujC,QAAUriC,EAAO6B,MAAM,GAC5B/C,KAAK+xE,cAAgB,GACrB/xE,KAAK+xE,cAAgBlxE,EAAQ6wE,cAAgB,GAE7CnmE,aACA,OAAOvL,KAAKujC,QAEhB8T,WAAW8F,EAAO18C,EAAKs0B,GAEnB,IADA/0B,KAAKujC,QAAUriC,EAAOqC,OAAO,CAACvD,KAAKujC,QAASriC,EAAO2M,KAAKsvC,KACjDn9C,KAAKgyE,cAEZj9C,IAEJi9C,YACI,MAAMC,EAAajyE,KAAKkyE,cAAclyE,KAAKujC,SAC3C,IAAK0uC,EACD,OAAO,EAEX,GAAIA,EAAWjqE,OAASspE,EAAkBa,gBAAgBC,SAAWpyE,KAAK+xE,cAAcjqE,MAAKuD,GAAKA,IAAM4mE,EAAW3jE,KAI/G,OAHAtO,KAAK8xE,UAAU/sE,KAAKktE,GACpBjyE,KAAKqyE,QAAQJ,EAAYV,EAAkBe,gBAAgBC,OAC3DvyE,KAAKwyE,cAAcP,EAAWQ,kBACvB,EAEN,CACD,GAAIzyE,KAAKujC,QAAQjiC,OAAS2wE,EAAWQ,gBAAkBR,EAAWrzE,KAC9D,OAAO,EAEX,MAAMgC,EAAOZ,KAAKujC,QAAQ3gC,MAAMqvE,EAAWQ,gBAAiBR,EAAWQ,gBAAkBR,EAAWrzE,MAGpG,IAFAoB,KAAKqyE,QAAQJ,EAAYV,EAAkBe,gBAAgBI,QAAS9xE,GACpEZ,KAAKwyE,cAAcP,EAAWQ,gBAAkBR,EAAWrzE,MACpDoB,KAAK8xE,UAAUxwE,OAAS,GAAG,CAC9B,MAAMqxE,EAAU3yE,KAAK8xE,UAAU9xE,KAAK8xE,UAAUxwE,OAAS,GACvD,GAAItB,KAAK6xE,qBAAwBc,EAAQC,cAAgBD,EAAQF,gBAAkBE,EAAQ/zE,KACvF,MAEJoB,KAAKqyE,QAAQM,EAASpB,EAAkBe,gBAAgBO,KACxD7yE,KAAK8xE,UAAU//C,OAGvB,OAAO,EAEXygD,cAAclxE,GACVtB,KAAK6xE,sBAAwBvwE,EAC7BtB,KAAKujC,QAAUvjC,KAAKujC,QAAQ3gC,MAAMtB,GAEtC4wE,cAAc3mE,EAAQlK,EAAS,GAC3B,GAAqB,GAAjBkK,EAAOjK,OACP,OAAO,KAEX,MAAMsC,EAAMytE,EAAQyB,MAAMC,SAASxnE,EAAQlK,GAC3C,GAAW,MAAPuC,EACA,OAAO,KAEX,MAAMhF,EAAOyyE,EAAQyB,MAAMC,SAASxnE,EAAQlK,EAASuC,EAAItC,QACzD,GAAY,MAAR1C,EACA,OAAO,KAEX,MAAMo0E,EAAW3B,EAAQyB,MAAMG,cAAc1nE,EAAQlK,EAAQA,EAASuC,EAAItC,QACpE4xE,EAAQ/zE,OAAOm/B,SAAS00C,EAAU,IACxC,IAAIG,EAAY3B,EAAiB4B,eAAe5kD,OAAO0kD,GAEvD,OADAC,EAAUv0E,KAAOA,EAAK6C,MACf+D,OAAO+iB,OAAO4qD,EAAW,CAC5BP,cAAe5yE,KAAK6xE,qBAAuBxwE,EAC3CoxE,gBAAiB7uE,EAAItC,OAAS1C,EAAK0C,SAG3C+wE,QAAQzuE,EAAKg1B,EAAUh4B,GACnB,IAAIyyE,EAAa7B,EAAiB4B,eAAe5kD,OAAO5qB,EAAI0K,IAC5D+kE,EAAWz0E,KAAOgF,EAAIhF,KACtBy0E,EAAWz6C,SAAWA,EAClBA,IAAa24C,EAAkBe,gBAAgBI,SAC/CW,EAAWC,aAAa1yE,GAE5BZ,KAAK+E,KAAKsuE,IAGlB30E,EAAQizE,kBAAoBA,oDC9F5BnsE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAM2vE,EAAW,EAAQ,MACnBG,EAAoB,EAAQ,MAC5BgC,EAAc,EAAQ,MAC5B,MAAMC,UAA0BpC,EAASr6B,UACrC90C,YAAYpB,EAAU,IAClBugC,MAAM57B,OAAO+iB,OAAO,GAAI1nB,EAAS,CAAE4yE,oBAAoB,KACvDzzE,KAAKqP,WAAanO,EAAO6B,MAAM,GAC/B/C,KAAK0zE,SAAU,EACf1zE,KAAK2zE,SAAW,GAEpBt8B,WAAW8F,EAAO18C,EAAKs0B,GACnB,GAAIooB,EAAO,CACP,IAAKA,EAAM7uC,GACP,MAAM,IAAIrP,MAAM,mBAAmB2J,KAAKC,UAAUs0C,MAEtD,OAAQA,EAAMvkB,UACV,KAAK24C,EAAkBe,gBAAgBC,MACnCvyE,KAAK4zE,SAASz2B,GACd,MACJ,KAAKo0B,EAAkBe,gBAAgBI,QACnC1yE,KAAK6zE,SAAS12B,GACd,MACJ,KAAKo0B,EAAkBe,gBAAgBO,IACnC7yE,KAAK8zE,OAAO32B,IAMxBpoB,IAEJg/C,eAAexoE,GACXvL,KAAKqP,WAAanO,EAAOqC,OAAO,CAACvD,KAAKqP,WAAY9D,IAClDvL,KAAKy3C,QAAO,SAEhBA,OAAO3W,GACH,IAAIqc,EAAQ,KACRn9C,KAAKqP,WAAW/N,OAAS,IAAMtB,KAAK0zE,UACpCv2B,EAAQj8C,EAAO2M,KAAK7N,KAAKqP,YACzBrP,KAAKqP,WAAanO,EAAO6B,MAAM,GAC/B/C,KAAK+E,KAAKo4C,IAEdrc,IAEJkzC,gBAAgBzoE,GACZvL,KAAK+zE,eAAexoE,GAExB0zC,QACIj/C,KAAKy3C,QAAO,SAEZlsC,aACA,OAAOvL,KAAKqP,WAEZ9D,WAAO5F,GACP3F,KAAKqP,WAAa1J,EAElBwE,YACA,OAAOnK,KAAK2zE,SAEhBM,OACIj0E,KAAK0zE,SAAU,EAEnBQ,SACIl0E,KAAK0zE,SAAU,EACf1zE,KAAKy3C,QAAO,SAEhBo8B,SAASjwE,GACD5D,KAAK2zE,SAASryE,OAAS,EACvBtB,KAAK2zE,SAAS3zE,KAAK2zE,SAASryE,OAAS,GAAG6yE,SAASpvE,KAAKnB,GAGtD5D,KAAK+zE,eAAenwE,EAAI7C,UAGhC6yE,SAAShwE,GACD5D,KAAK2zE,SAASryE,OAAS,GACvBtB,KAAK2zE,SAAS3zE,KAAK2zE,SAASryE,OAAS,GAAG6yE,SAASpvE,KAAKnB,GAE1D5D,KAAK2zE,SAAS5uE,KAAKnB,GAEvBkwE,OAAOlwE,GACH,MAAMwwE,EAAcp0E,KAAK2zE,SAAS5hD,MAClC,GAAInuB,EAAI0K,KAAO8lE,EAAY9lE,GACvB,KAAM,8BAA8BilE,EAAYc,UAAUzwE,EAAI0K,6BAA6BilE,EAAYc,UAAUD,EAAY9lE,OAE7HtO,KAAK2zE,SAASryE,OAAS,GACvBtB,KAAK+zE,eAAeK,EAAYrzE,WAI5CrC,EAAQ80E,kBAAoBA,+BC1Fd,EAAQ,MACEV,MACxB,IAAIwB,EAAsB,EAAQ,MAClC51E,EAAQ,GAAoB41E,EAAoB3C,kBACtB,EAAQ,MACc6B,kBAClC,EAAQ,MACEe,MACJ,EAAQ,MACQC,YAChB,EAAQ,MACQC,YACZ,EAAQ,MACYtC,gBACtB,EAAQ,MACUuC,cACxB,EAAQ,MACIC,QACL,EAAQ,MACWvB,eAC1C,IAAIG,EAAc,EAAQ,MAC1B70E,EAAQ,GAAY60E,EAAYc,UACR,EAAQ,MACY/B,gBACxB,EAAQ,MACQsC,8DC1BpCpvE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAM8xE,EAAc,EAAQ,MACtBlC,EAAU,EAAQ,MAqCxB3yE,EAAQi2E,QApCR,MACI1yE,YAAYqM,EAAItG,EAAM4wB,GAClB54B,KAAKsO,GAAKA,EACVtO,KAAKgI,KAAOA,EACZhI,KAAK44B,SAAWA,EAEpBi8C,oBACI,IAAIC,EAAS90E,KAAKsO,GAAGrC,SAAS,IAI9B,OAHI6oE,EAAOxzE,OAAS,GAAM,IACtBwzE,EAAS,IAAIA,KAEV5zE,EAAO2M,KAAKinE,EAAQ,OAE/B/zE,SACI,IAAIg0E,EAAW,KACXzsE,EAAUtI,KAAKg1E,gBACnB,IAAmB,IAAfh1E,KAAKpB,KACLm2E,EAAW7zE,EAAO2M,KAAK,mBAAoB,WAE1C,CACD,IAAIonE,EACA,CACA1B,EAAYc,UAAUa,QACtB3B,EAAYc,UAAUc,SACxBrtE,MAAKuD,GAAKA,IAAMrL,KAAKsO,OACnB2mE,EAAgB,GAEpBF,EAAW1D,EAAQyB,MAAMsC,UAAU9sE,EAAQhH,OAAQ2zE,GAEvD,OAAO/zE,EAAOqC,OAAO,CACjBvD,KAAK60E,oBACLE,EACAzsE,mCCnCZ9C,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAM8xE,EAAc,EAAQ,MACtB8B,EAAkB,EAAQ,MAC1BC,EAAgB,EAAQ,MACxBC,EAAU,EAAQ,MAClBC,EAAgB,EAAQ,MACxBlE,EAAoB,EAAQ,MAoRlC5yE,EAAQ00E,eAnRR,MACIqC,cAAcnnE,EAAItG,GACd,QAAkCI,IAA9BmrE,EAAYc,UAAU/lE,GAAmB,CACzC,IAAIonE,EACJ,OAAQpnE,GACJ,KAAKilE,EAAYc,UAAUE,MACvB,OAAO,IAAIgB,EAAQhB,MACvB,KAAKhB,EAAYc,UAAUO,YACvB,OAAO,IAAIY,EAAcZ,YAC7B,KAAKrB,EAAYc,UAAUsB,eAC3B,KAAKpC,EAAYc,UAAUuB,mBAC3B,KAAKrC,EAAYc,UAAUwB,kBAC3B,KAAKtC,EAAYc,UAAUyB,aAC3B,KAAKvC,EAAYc,UAAU0B,gBAC3B,KAAKxC,EAAYc,UAAU2B,eAC3B,KAAKzC,EAAYc,UAAU4B,mBAC3B,KAAK1C,EAAYc,UAAU6B,iBAC3B,KAAK3C,EAAYc,UAAU8B,YAC3B,KAAK5C,EAAYc,UAAU+B,IAC3B,KAAK7C,EAAYc,UAAUa,QAC3B,KAAK3B,EAAYc,UAAUgC,UAC3B,KAAK9C,EAAYc,UAAUiC,QAC3B,KAAK/C,EAAYc,UAAUkC,KAC3B,KAAKhD,EAAYc,UAAUmC,aAC3B,KAAKjD,EAAYc,UAAUoC,YAC3B,KAAKlD,EAAYc,UAAUqC,aAC3B,KAAKnD,EAAYc,UAAUsC,SAC3B,KAAKpD,EAAYc,UAAUuC,aAC3B,KAAKrD,EAAYc,UAAUwC,YAC3B,KAAKtD,EAAYc,UAAUyC,aAC3B,KAAKvD,EAAYc,UAAU0C,kBAC3B,KAAKxD,EAAYc,UAAU2C,SAC3B,KAAKzD,EAAYc,UAAU4C,KAC3B,KAAK1D,EAAYc,UAAU6C,sBAC3B,KAAK3D,EAAYc,UAAU8C,iBAC3B,KAAK5D,EAAYc,UAAU+C,gBAC3B,KAAK7D,EAAYc,UAAUgD,WAC3B,KAAK9D,EAAYc,UAAUiD,mBAC3B,KAAK/D,EAAYc,UAAUkD,eAC3B,KAAKhE,EAAYc,UAAUmD,MAC3B,KAAKjE,EAAYc,UAAUoD,MAC3B,KAAKlE,EAAYc,UAAUqD,WAC3B,KAAKnE,EAAYc,UAAUsD,OAC3B,KAAKpE,EAAYc,UAAUuD,eAC3B,KAAKrE,EAAYc,UAAUwD,UAC3B,KAAKtE,EAAYc,UAAUyD,OAC3B,KAAKvE,EAAYc,UAAU0D,UAC3B,KAAKxE,EAAYc,UAAU2D,eAC3B,KAAKzE,EAAYc,UAAU4D,WAC3B,KAAK1E,EAAYc,UAAUc,QAC3B,KAAK5B,EAAYc,UAAU6D,KAC3B,KAAK3E,EAAYc,UAAU8D,KAC3B,KAAK5E,EAAYc,UAAU+D,SAC3B,KAAK7E,EAAYc,UAAUgE,qBAC3B,KAAK9E,EAAYc,UAAUiE,kBAC3B,KAAK/E,EAAYc,UAAUkE,cAC3B,KAAKhF,EAAYc,UAAUmE,KACvB9C,EAAYpE,EAAkBa,gBAAgBC,OAC9C,MACJ,KAAKmB,EAAYc,UAAUoE,UAC3B,KAAKlF,EAAYc,UAAUqE,YAC3B,KAAKnF,EAAYc,UAAUsE,mBAC3B,KAAKpF,EAAYc,UAAUuE,iBAC3B,KAAKrF,EAAYc,UAAUwE,eAC3B,KAAKtF,EAAYc,UAAUyE,WAC3B,KAAKvF,EAAYc,UAAU0E,cAC3B,KAAKxF,EAAYc,UAAU2E,kBAC3B,KAAKzF,EAAYc,UAAU4E,gBAC3B,KAAK1F,EAAYc,UAAU6E,mBAC3B,KAAK3F,EAAYc,UAAU8E,YAC3B,KAAK5F,EAAYc,UAAU+E,eAC3B,KAAK7F,EAAYc,UAAUgF,WAC3B,KAAK9F,EAAYc,UAAUiF,mBAC3B,KAAK/F,EAAYc,UAAUkF,kBAC3B,KAAKhG,EAAYc,UAAUmF,gBAC3B,KAAKjG,EAAYc,UAAUoF,qBAC3B,KAAKlG,EAAYc,UAAUqF,qBAC3B,KAAKnG,EAAYc,UAAUsF,oBAC3B,KAAKpG,EAAYc,UAAUuF,eAC3B,KAAKrG,EAAYc,UAAUwF,SAC3B,KAAKtG,EAAYc,UAAUyF,gBAC3B,KAAKvG,EAAYc,UAAU0F,mBAC3B,KAAKxG,EAAYc,UAAU2F,eAC3B,KAAKzG,EAAYc,UAAU4F,iBAC3B,KAAK1G,EAAYc,UAAU6F,cAC3B,KAAK3G,EAAYc,UAAU8F,cAC3B,KAAK5G,EAAYc,UAAU+F,YAC3B,KAAK7G,EAAYc,UAAUgG,gBAC3B,KAAK9G,EAAYc,UAAUiG,qBAC3B,KAAK/G,EAAYc,UAAUkG,yBAC3B,KAAKhH,EAAYc,UAAUmG,WAC3B,KAAKjH,EAAYc,UAAUoG,mBAC3B,KAAKlH,EAAYc,UAAUqG,mBAC3B,KAAKnH,EAAYc,UAAUsG,kBAC3B,KAAKpH,EAAYc,UAAUuG,WAC3B,KAAKrH,EAAYc,UAAUwG,QAC3B,KAAKtH,EAAYc,UAAUyG,iBAC3B,KAAKvH,EAAYc,UAAU0G,aAC3B,KAAKxH,EAAYc,UAAU2G,cAC3B,KAAKzH,EAAYc,UAAU4G,YAC3B,KAAK1H,EAAYc,UAAU6G,oBAC3B,KAAK3H,EAAYc,UAAU8G,mBAC3B,KAAK5H,EAAYc,UAAU+G,SAC3B,KAAK7H,EAAYc,UAAUgH,QAC3B,KAAK9H,EAAYc,UAAUiH,sBAC3B,KAAK/H,EAAYc,UAAUkH,mBAC3B,KAAKhI,EAAYc,UAAUmH,eAC3B,KAAKjI,EAAYc,UAAUoH,eAC3B,KAAKlI,EAAYc,UAAUqH,oBAC3B,KAAKnI,EAAYc,UAAUsH,eAC3B,KAAKpI,EAAYc,UAAUuH,cAC3B,KAAKrI,EAAYc,UAAUwH,aAC3B,KAAKtI,EAAYc,UAAUyH,eAC3B,KAAKvI,EAAYc,UAAU0H,cAC3B,KAAKxI,EAAYc,UAAU2H,SAC3B,KAAKzI,EAAYc,UAAU4H,gBAC3B,KAAK1I,EAAYc,UAAU6H,YAC3B,KAAK3I,EAAYc,UAAU8H,cAC3B,KAAK5I,EAAYc,UAAU+H,aAC3B,KAAK7I,EAAYc,UAAUgI,eAC3B,KAAK9I,EAAYc,UAAUiI,cAC3B,KAAK/I,EAAYc,UAAUkI,aAC3B,KAAKhJ,EAAYc,UAAUmI,gBAC3B,KAAKjJ,EAAYc,UAAUoI,YAC3B,KAAKlJ,EAAYc,UAAUqI,WAC3B,KAAKnJ,EAAYc,UAAUsI,cAC3B,KAAKpJ,EAAYc,UAAUuI,UAC3B,KAAKrJ,EAAYc,UAAUwI,WAC3B,KAAKtJ,EAAYc,UAAUyI,eAC3B,KAAKvJ,EAAYc,UAAU0I,oBAC3B,KAAKxJ,EAAYc,UAAU2I,yBAC3B,KAAKzJ,EAAYc,UAAU4I,YAC3B,KAAK1J,EAAYc,UAAU6I,WAC3B,KAAK3J,EAAYc,UAAU8I,aAC3B,KAAK5J,EAAYc,UAAU+I,eAC3B,KAAK7J,EAAYc,UAAUgJ,mBAC3B,KAAK9J,EAAYc,UAAUiJ,4BAC3B,KAAK/J,EAAYc,UAAUkJ,gBAC3B,KAAKhK,EAAYc,UAAUmJ,SAC3B,KAAKjK,EAAYc,UAAUoJ,SAC3B,KAAKlK,EAAYc,UAAUqJ,WAC3B,KAAKnK,EAAYc,UAAUsJ,WAC3B,KAAKpK,EAAYc,UAAUuJ,YAC3B,KAAKrK,EAAYc,UAAUwJ,SAC3B,KAAKtK,EAAYc,UAAUyJ,YAC3B,KAAKvK,EAAYc,UAAU0J,kBAC3B,KAAKxK,EAAYc,UAAU2J,gBAC3B,KAAKzK,EAAYc,UAAU4J,cAC3B,KAAK1K,EAAYc,UAAU6J,MAC3B,KAAK3K,EAAYc,UAAU8J,gBAC3B,KAAK5K,EAAYc,UAAU+J,YAC3B,KAAK7K,EAAYc,UAAUgK,WAC3B,KAAK9K,EAAYc,UAAUiK,kBAC3B,KAAK/K,EAAYc,UAAUkK,cAC3B,KAAKhL,EAAYc,UAAUmK,WAC3B,KAAKjL,EAAYc,UAAUoK,SAC3B,KAAKlL,EAAYc,UAAUqK,SAC3B,KAAKnL,EAAYc,UAAUsK,kBAC3B,KAAKpL,EAAYc,UAAUuK,SAC3B,KAAKrL,EAAYc,UAAUwK,yBAC3B,KAAKtL,EAAYc,UAAUyK,cAC3B,KAAKvL,EAAYc,UAAU0K,sBAC3B,KAAKxL,EAAYc,UAAU2K,2BAC3B,KAAKzL,EAAYc,UAAU4K,aAC3B,KAAK1L,EAAYc,UAAU6K,cAC3B,KAAK3L,EAAYc,UAAU8K,cAC3B,KAAK5L,EAAYc,UAAU+K,kBAC3B,KAAK7L,EAAYc,UAAUgL,gBAC3B,KAAK9L,EAAYc,UAAUiL,gBACvB5J,EAAYpE,EAAkBa,gBAAgBoN,YAC9C,MACJ,KAAKhM,EAAYc,UAAUmL,YAC3B,KAAKjM,EAAYc,UAAUoL,eAC3B,KAAKlM,EAAYc,UAAUqL,iBAC3B,KAAKnM,EAAYc,UAAUsL,eACvBjK,EAAYpE,EAAkBa,gBAAgByN,QAC9C,MACJ,KAAKrM,EAAYc,UAAUwL,QAC3B,KAAKtM,EAAYc,UAAUyL,QAC3B,KAAKvM,EAAYc,UAAU0L,aAC3B,KAAKxM,EAAYc,UAAU2L,YAC3B,KAAKzM,EAAYc,UAAU4L,WAC3B,KAAK1M,EAAYc,UAAU6L,YAC3B,KAAK3M,EAAYc,UAAU8L,aAC3B,KAAK5M,EAAYc,UAAU+L,iBAC3B,KAAK7M,EAAYc,UAAUgM,aAC3B,KAAK9M,EAAYc,UAAUiM,SACvB5K,EAAYpE,EAAkBa,gBAAgBtmE,OAC9C,MACJ,KAAK0nE,EAAYc,UAAUkM,WAC3B,KAAKhN,EAAYc,UAAUmM,UAC3B,KAAKjN,EAAYc,UAAUoM,iBAC3B,KAAKlN,EAAYc,UAAUqM,WAC3B,KAAKnN,EAAYc,UAAUsM,gBAC3B,KAAKpN,EAAYc,UAAUuM,UAC3B,KAAKrN,EAAYc,UAAUwM,QAC3B,KAAKtN,EAAYc,UAAUyM,SAC3B,KAAKvN,EAAYc,UAAU0M,gBAC3B,KAAKxN,EAAYc,UAAU2M,cAC3B,KAAKzN,EAAYc,UAAU4M,KAC3B,KAAK1N,EAAYc,UAAU6M,UAC3B,KAAK3N,EAAYc,UAAU8M,MAC3B,KAAK5N,EAAYc,UAAU+M,aAC3B,KAAK7N,EAAYc,UAAUgN,aACvB3L,EAAYpE,EAAkBa,gBAAgBmP,KAC9C,MACJ,KAAK/N,EAAYc,UAAUkN,oBAC3B,KAAKhO,EAAYc,UAAUmN,cAC3B,KAAKjO,EAAYc,UAAUoN,UAC3B,KAAKlO,EAAYc,UAAUqN,aAC3B,KAAKnO,EAAYc,UAAUsN,cAC3B,KAAKpO,EAAYc,UAAUuN,gBAC3B,KAAKrO,EAAYc,UAAUwN,mBAC3B,KAAKtO,EAAYc,UAAUyN,kBAC3B,KAAKvO,EAAYc,UAAU0N,SAC3B,KAAKxO,EAAYc,UAAU2N,gBAC3B,KAAKzO,EAAYc,UAAU4N,iBAC3B,KAAK1O,EAAYc,UAAU6N,gBAC3B,KAAK3O,EAAYc,UAAU8N,2BAC3B,KAAK5O,EAAYc,UAAU+N,qBAC3B,KAAK7O,EAAYc,UAAUgO,iBAC3B,KAAK9O,EAAYc,UAAUiO,YAC3B,KAAK/O,EAAYc,UAAUkO,sBAC3B,KAAKhP,EAAYc,UAAUmO,aAC3B,KAAKjP,EAAYc,UAAUoO,eAC3B,KAAKlP,EAAYc,UAAUqO,WAC3B,KAAKnP,EAAYc,UAAUsO,gBAC3B,KAAKpP,EAAYc,UAAUuO,aAC3B,KAAKrP,EAAYc,UAAUwO,mBAC3B,KAAKtP,EAAYc,UAAUyO,QAC3B,KAAKvP,EAAYc,UAAU0O,QAC3B,KAAKxP,EAAYc,UAAU2O,WAC3B,KAAKzP,EAAYc,UAAU4O,OAC3B,KAAK1P,EAAYc,UAAU6O,UAC3B,KAAK3P,EAAYc,UAAU8O,mBAC3B,KAAK5P,EAAYc,UAAU+O,MAC3B,KAAK7P,EAAYc,UAAUgP,KACvB3N,EAAYpE,EAAkBa,gBAAgBmR,OAC9C,MACJ,KAAK/P,EAAYc,UAAUkP,SAC3B,KAAKhQ,EAAYc,UAAUmP,wBAC3B,KAAKjQ,EAAYc,UAAUoP,kBAC3B,KAAKlQ,EAAYc,UAAUqP,UAC3B,KAAKnQ,EAAYc,UAAUsP,WAC3B,KAAKpQ,EAAYc,UAAUuP,mBACvBlO,EAAYpE,EAAkBa,gBAAgB0R,MAC9C,MACJ,KAAKtQ,EAAYc,UAAUyP,QACvBpO,EAAYpE,EAAkBa,gBAAgBllE,KAGtD,QAAa7E,IAATJ,EACAA,EAAO0tE,OAGP,GAAI1tE,IAAS0tE,EACT,MAAM,IAAIz2E,MAAM,4CAA4Cs0E,EAAYc,UAAU/lE,2BAA4BtG,2GAI1H,OAAQA,GACJ,KAAKspE,EAAkBa,gBAAgBC,OACnC,OAAO,IAAIiD,EAAgBX,cAAcpmE,GAC7C,KAAKgjE,EAAkBa,gBAAgBmP,KACvC,KAAKhQ,EAAkBa,gBAAgBmR,OACvC,KAAKhS,EAAkBa,gBAAgBllE,KACvC,KAAKqkE,EAAkBa,gBAAgB0R,MACvC,KAAKvS,EAAkBa,gBAAgByN,QACvC,KAAKtO,EAAkBa,gBAAgBtmE,OACvC,KAAKylE,EAAkBa,gBAAgBoN,YACvC,QACI,OAAO,IAAIjK,EAAcb,YAAYnmE,EAAItG,iCCpRzD,IAAWwsE,EAFXhvE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,KAE3C+yE,EAKM91E,EAAQ81E,cAAgB91E,EAAQ81E,YAAc,KAJ/CA,EAAkB,KAAI,GAAK,OACvCA,EAAYA,EAAkB,KAAI,GAAK,OACvCA,EAAYA,EAAkB,KAAI,GAAK,OACvCA,EAAYA,EAAuB,UAAI,GAAK,uCCJhD,IAAWrC,EAFX3sE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,KAE3C0wE,EASUzzE,EAAQyzE,kBAAoBzzE,EAAQyzE,gBAAkB,KAR/C,OAAI,IAC5BA,EAA6B,YAAI,IACjCA,EAAyB,QAAI,IAC7BA,EAAwB,OAAI,IAC5BA,EAAsB,KAAI,IAC1BA,EAAwB,OAAI,IAC5BA,EAAuB,MAAI,IAC3BA,EAAsB,KAAI,+BCR9B,IAAWkC,EAFX7uE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,KAE3C4yE,EAoOI31E,EAAQ21E,YAAc31E,EAAQ21E,UAAY,KAnO3CA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAAqB,UAAI,KAAO,YAC1CA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAAmB,QAAI,KAAO,UACxCA,EAAUA,EAAuB,YAAI,KAAO,cAC5CA,EAAUA,EAA8B,mBAAI,KAAO,qBACnDA,EAAUA,EAA4B,iBAAI,KAAO,mBACjDA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAAyB,cAAI,KAAO,gBAC9CA,EAAUA,EAA6B,kBAAI,KAAO,oBAClDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAA+B,oBAAI,OAAS,sBACtDA,EAAUA,EAAmB,QAAI,OAAS,UAC1CA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAAuB,YAAI,OAAS,cAC9CA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAAmB,QAAI,OAAS,UAC1CA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAAqB,UAAI,OAAS,YAC5CA,EAAUA,EAAqB,UAAI,OAAS,YAC5CA,EAAUA,EAAoB,SAAI,OAAS,WAC3CA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAA6B,kBAAI,OAAS,oBACpDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAAgC,qBAAI,OAAS,uBACvDA,EAAUA,EAAgC,qBAAI,OAAS,uBACvDA,EAAUA,EAA+B,oBAAI,OAAS,sBACtDA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAA6B,kBAAI,OAAS,oBACpDA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAA4B,iBAAI,OAAS,mBACnDA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAAoB,SAAI,OAAS,WAC3CA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAA4B,iBAAI,OAAS,mBACnDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAAuB,YAAI,OAAS,cAC9CA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAAe,IAAI,OAAS,MACtCA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAAqB,UAAI,SAAW,YAC9CA,EAAUA,EAAmB,QAAI,WAAa,UAC9CA,EAAUA,EAAuB,YAAI,OAAS,cAC9CA,EAAUA,EAAmB,QAAI,OAAS,UAC1CA,EAAUA,EAAqB,UAAI,OAAS,YAC5CA,EAAUA,EAA4B,iBAAI,OAAS,mBACnDA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAAuB,YAAI,OAAS,cAC9CA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAAmB,QAAI,OAAS,UAC1CA,EAAUA,EAAgB,KAAI,WAAa,OAC3CA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAAuB,YAAI,OAAS,cAC9CA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAAwB,aAAI,KAAO,eAC7CA,EAAUA,EAAgC,qBAAI,OAAS,uBACvDA,EAAUA,EAAoC,yBAAI,OAAS,2BAC3DA,EAAUA,EAA6B,kBAAI,OAAS,oBACpDA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAAuB,YAAI,KAAO,cAC5CA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAA6B,kBAAI,OAAS,oBACpDA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAAoB,SAAI,WAAa,WAC/CA,EAAUA,EAAmB,QAAI,OAAS,UAC1CA,EAAUA,EAAoB,SAAI,OAAS,WAC3CA,EAAUA,EAAoB,SAAI,OAAS,WAC3CA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAAuB,YAAI,WAAa,cAClDA,EAAUA,EAA4B,iBAAI,KAAO,mBACjDA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAAwB,aAAI,KAAO,eAC7CA,EAAUA,EAAyB,cAAI,KAAO,gBAC9CA,EAAUA,EAAuB,YAAI,KAAO,cAC5CA,EAAUA,EAA+B,oBAAI,KAAO,sBACpDA,EAAUA,EAA8B,mBAAI,KAAO,qBACnDA,EAAUA,EAAoB,SAAI,KAAO,WACzCA,EAAUA,EAA6B,kBAAI,KAAO,oBAClDA,EAAUA,EAAmB,QAAI,KAAO,UACxCA,EAAUA,EAAoB,SAAI,KAAO,WACzCA,EAAUA,EAAgB,KAAI,WAAa,OAC3CA,EAAUA,EAAiC,sBAAI,OAAS,wBACxDA,EAAUA,EAAiC,sBAAI,OAAS,wBACxDA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAA4B,iBAAI,OAAS,mBACnDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAA4B,iBAAI,OAAS,mBACnDA,EAAUA,EAAsC,2BAAI,KAAO,6BAC3DA,EAAUA,EAA+B,oBAAI,KAAO,sBACpDA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAAgC,qBAAI,KAAO,uBACrDA,EAAUA,EAAyB,cAAI,KAAO,gBAC9CA,EAAUA,EAAwB,aAAI,KAAO,eAC7CA,EAAUA,EAA2B,gBAAI,KAAO,kBAChDA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAAyB,cAAI,KAAO,gBAC9CA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAA8B,mBAAI,KAAO,qBACnDA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAA4B,iBAAI,OAAS,mBACnDA,EAAUA,EAAoB,SAAI,KAAO,WACzCA,EAAUA,EAAmC,wBAAI,OAAS,0BAC1DA,EAAUA,EAA6B,kBAAI,KAAO,oBAClDA,EAAUA,EAAiB,MAAI,KAAO,QACtCA,EAAUA,EAAqB,UAAI,SAAW,YAC9CA,EAAUA,EAAsB,WAAI,SAAW,aAC/CA,EAAUA,EAAuB,YAAI,SAAW,cAChDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAAuB,YAAI,OAAS,cAC9CA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAAuB,YAAI,KAAO,cAC5CA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAAqB,UAAI,OAAS,YAC5CA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAAiB,MAAI,KAAO,QACtCA,EAAUA,EAAiC,sBAAI,OAAS,wBACxDA,EAAUA,EAA+B,oBAAI,OAAS,sBACtDA,EAAUA,EAAoC,yBAAI,OAAS,2BAC3DA,EAAUA,EAAuB,YAAI,OAAS,cAC9CA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAA4B,iBAAI,QAAW,mBACrDA,EAAUA,EAAwB,aAAI,SAAW,eACjDA,EAAUA,EAAyB,cAAI,SAAW,gBAClDA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAAoB,SAAI,SAAW,WAC7CA,EAAUA,EAAgB,KAAI,OAAS,OACvCA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAAuB,YAAI,OAAS,cAC9CA,EAAUA,EAA8B,mBAAI,SAAW,qBACvDA,EAAUA,EAAuC,4BAAI,SAAW,8BAChEA,EAAUA,EAA2B,gBAAI,SAAW,kBACpDA,EAAUA,EAAoB,SAAI,OAAS,WAC3CA,EAAUA,EAAoB,SAAI,OAAS,WAC3CA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAAuB,YAAI,KAAO,cAC5CA,EAAUA,EAAoB,SAAI,OAAS,WAC3CA,EAAUA,EAAuB,YAAI,KAAO,cAC5CA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAAkB,OAAI,WAAa,SAC7CA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAA6B,kBAAI,KAAO,oBAClDA,EAAUA,EAA2B,gBAAI,KAAO,kBAChDA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAAyB,cAAI,KAAO,gBAC9CA,EAAUA,EAAiB,MAAI,KAAO,QACtCA,EAAUA,EAA2B,gBAAI,KAAO,kBAChDA,EAAUA,EAAuB,YAAI,KAAO,cAC5CA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAAqB,UAAI,KAAO,YAC1CA,EAAUA,EAAkB,OAAI,KAAO,SACvCA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAA4B,iBAAI,KAAO,mBACjDA,EAAUA,EAA0B,eAAI,KAAO,iBAC/CA,EAAUA,EAA6B,kBAAI,KAAO,oBAClDA,EAAUA,EAAyB,cAAI,KAAO,gBAC9CA,EAAUA,EAA2B,gBAAI,KAAO,kBAChDA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAAqB,UAAI,KAAO,YAC1CA,EAAUA,EAA0B,eAAI,OAAS,iBACjDA,EAAUA,EAAwB,aAAI,KAAO,eAC7CA,EAAUA,EAAiB,MAAI,KAAO,QACtCA,EAAUA,EAAsB,WAAI,KAAO,aAC3CA,EAAUA,EAAuB,YAAI,KAAO,cAC5CA,EAAUA,EAAoB,SAAI,KAAO,WACzCA,EAAUA,EAAoB,SAAI,KAAO,WACzCA,EAAUA,EAA6B,kBAAI,OAAS,oBACpDA,EAAUA,EAAoB,SAAI,KAAO,WACzCA,EAAUA,EAAmB,QAAI,WAAa,UAC9CA,EAAUA,EAAqB,UAAI,OAAS,YAC5CA,EAAUA,EAAiB,MAAI,OAAS,QACxCA,EAAUA,EAAoC,yBAAI,SAAW,2BAC7DA,EAAUA,EAAyB,cAAI,SAAW,gBAClDA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAAiC,sBAAI,OAAS,wBACxDA,EAAUA,EAAsC,2BAAI,OAAS,6BAC7DA,EAAUA,EAAwB,aAAI,SAAW,eACjDA,EAAUA,EAAmB,QAAI,SAAW,UAC5CA,EAAUA,EAAwB,aAAI,SAAW,eACjDA,EAAUA,EAAmB,QAAI,SAAW,UAC5CA,EAAUA,EAAsB,WAAI,OAAS,aAC7CA,EAAUA,EAAgB,KAAI,WAAa,OAC3CA,EAAUA,EAAwB,aAAI,OAAS,eAC/CA,EAAUA,EAAkB,OAAI,OAAS,SACzCA,EAAUA,EAAgB,KAAI,OAAS,OACvCA,EAAUA,EAAoB,SAAI,WAAa,WAC/CA,EAAUA,EAAgC,qBAAI,OAAS,uBACvDA,EAAUA,EAA6B,kBAAI,OAAS,oBACpDA,EAAUA,EAAqB,UAAI,OAAS,YAC5CA,EAAUA,EAA8B,mBAAI,OAAS,qBACrDA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAAyB,cAAI,OAAS,gBAChDA,EAAUA,EAAyB,cAAI,WAAa,gBACpDA,EAAUA,EAAiB,MAAI,KAAO,QACtCA,EAAUA,EAAgB,KAAI,KAAO,OACrCA,EAAUA,EAA6B,kBAAI,OAAS,oBACpDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAA2B,gBAAI,OAAS,kBAClDA,EAAUA,EAAgB,KAAI,WAAa,kCCnO/C,IAAW/B,EAFX9sE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,KAE3C6wE,EAIU5zE,EAAQ4zE,kBAAoB5zE,EAAQ4zE,gBAAkB,KAHvDA,EAAuB,MAAI,GAAK,QAChDA,EAAgBA,EAAyB,QAAI,GAAK,UAClDA,EAAgBA,EAAqB,IAAI,GAAK,wDCLlD9sE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAM6zE,EAAgB,EAAQ,MACxByO,EAAgB,EAAQ,MACxB1S,EAAU,EAAQ,MAClBkC,EAAc,EAAQ,MACtBjC,EAAoB,EAAQ,MAClC,MAAMiD,UAAce,EAAcb,YAC9BxyE,YAAY+hF,GACR5iD,MAAM4iD,GAAazQ,EAAYc,UAAUE,MAAOjD,EAAkBa,gBAAgBmR,QAEtFW,mBACI,OAAO5S,EAAQyB,MAAMsC,UAAUp1E,KAAK8G,OAExCo9E,mBACI,IAAIziF,EAAQP,EAAO6B,MAAM,GAEzB,OADAtB,EAAM4lC,aAAarnC,KAAKyB,MAAO,GACxBA,EAEX0iF,mBACI,IAAIhvD,EAAQ,EAIZ,OAHIn1B,KAAKokF,YACLjvD,GAAS,IAELn1B,KAAKqkF,QACT,KAAKN,EAAcvP,YAAY8P,KAC3B,MACJ,KAAKP,EAAcvP,YAAY+P,KAC3BpvD,GAAS,EACT,MACJ,KAAK4uD,EAAcvP,YAAYgE,KAC3BrjD,GAAS,EACT,MACJ,KAAK4uD,EAAcvP,YAAYgQ,UAC3BrvD,GAAS,GAGjB,OAAOj0B,EAAOujF,GAAGtvD,GAErB6/C,gBACI,OAAO9zE,EAAOqC,OAAO,CACjBvD,KAAKikF,mBACLjkF,KAAKkkF,mBACLlkF,KAAKmkF,mBACLnkF,KAAK0kF,UAGbpR,aAAa1yE,GACT,MAAMkG,EAAQuqE,EAAQyB,MAAMC,SAASnyE,GACrCZ,KAAK8G,MAAQA,EAAMrF,MACnBzB,KAAKyB,MAAQ4vE,EAAQyB,MAAM6R,WAAW/jF,EAAK01D,SAASxvD,EAAMxF,OAAQwF,EAAMxF,OAAS,IACjF,IAAI6zB,EAAQv0B,EAAKkG,EAAMxF,OAAS,GAEhC,OADAtB,KAAKokF,UAAYlsD,QAAgB,GAAR/C,GACT,GAARA,GACJ,KAAK,EACDn1B,KAAKqkF,OAASN,EAAcvP,YAAY8P,KACxC,MACJ,KAAK,EACDtkF,KAAKqkF,OAASN,EAAcvP,YAAY+P,KACxC,MACJ,KAAK,EACDvkF,KAAKqkF,OAASN,EAAcvP,YAAYgE,KACxC,MACJ,KAAK,GACDx4E,KAAKqkF,OAASN,EAAcvP,YAAYgQ,UAGhDxkF,KAAK0kF,QAAU9jF,EAAKgC,MAAMkE,EAAMxF,OAAS,IAGjD5C,EAAQ61E,MAAQA,oDCrEhB/uE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAMmjF,EAAY,EAAQ,MACpBtT,EAAoB,EAAQ,MAC5BD,EAAU,EAAQ,MAClBE,EAAoB,EAAQ,MAClC,MAAMkD,UAAoBmQ,EAAUjQ,QAChC1yE,YAAYqM,EAAItG,GACZo5B,MAAM9yB,EAAItG,EAAMupE,EAAkBe,gBAAgBI,SAEtDY,aAAa1yE,GACT,OAAQZ,KAAKgI,MACT,KAAKspE,EAAkBa,gBAAgBoN,YACnCv/E,KAAKY,KAAOywE,EAAQyB,MAAM+R,aAAajkF,GACvC,MACJ,KAAK0wE,EAAkBa,gBAAgB0R,MACnC7jF,KAAKY,KAAOywE,EAAQyB,MAAMgS,UAAUlkF,GACpC,MACJ,KAAK0wE,EAAkBa,gBAAgByN,QACnC5/E,KAAKY,KAAOywE,EAAQyB,MAAM6R,WAAW/jF,GACrC,MACJ,KAAK0wE,EAAkBa,gBAAgBtmE,OACnC7L,KAAKY,KAAOiL,OAAOC,gBAAgBlL,GACnC,MACJ,KAAK0wE,EAAkBa,gBAAgBmP,KACnCthF,KAAKY,KAAOywE,EAAQyB,MAAMiS,SAASnkF,GACnC,MACJ,QACIZ,KAAKY,KAAOA,GAIxBo0E,gBACI,OAAQh1E,KAAKgI,MACT,KAAKspE,EAAkBa,gBAAgBoN,YACnC,OAAOlO,EAAQyB,MAAMkS,cAAchlF,KAAKY,MAC5C,KAAK0wE,EAAkBa,gBAAgB0R,MACnC,OAAOxS,EAAQyB,MAAM5c,WAAWl2D,KAAKY,MACzC,KAAK0wE,EAAkBa,gBAAgByN,QACnC,OAAOvO,EAAQyB,MAAMmS,YAAYjlF,KAAKY,MAC1C,KAAK0wE,EAAkBa,gBAAgBtmE,OACnC,OAAO3K,EAAO2M,KAAK7N,KAAKY,KAAM,SAClC,KAAK0wE,EAAkBa,gBAAgBmP,KACnC,OAAOpgF,EAAO2M,KAAK7N,KAAKY,KAAM,QAClC,KAAK0wE,EAAkBa,gBAAgBmR,OACvC,QACI,OAAOtjF,KAAKY,OAI5BlC,EAAQ+1E,YAAcA,oDCjDtBjvE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAMmjF,EAAY,EAAQ,MACpBtT,EAAoB,EAAQ,MAC5BC,EAAoB,EAAQ,MAC5BF,EAAU,EAAQ,MAClBG,EAAmB,EAAQ,MACjC,MAAMkD,UAAsBkQ,EAAUjQ,QAClC1yE,YAAYqM,EAAIsqB,EAAW24C,EAAkBe,gBAAgBI,SACzDtxC,MAAM9yB,EAAIgjE,EAAkBa,gBAAgBC,OAAQx5C,GACpD54B,KAAKklF,UAAY,GAEjB/Q,eACA,OAAOn0E,KAAKklF,UAEZ/Q,aAAS1yE,GACTzB,KAAKklF,UAAYzjF,EAErBuzE,gBACI,OAAO9zE,EAAOqC,OAAOvD,KAAKklF,UAAUtjF,KAAIwD,GAASA,EAAMrE,YAE3DuyE,aAAahrE,GACT,KAAOA,EAAQhH,OAAS,GAAG,CACvB,MAAMsC,EAAMytE,EAAQyB,MAAMC,SAASzqE,GAC7B1J,EAAOyyE,EAAQyB,MAAMC,SAASzqE,EAAS1E,EAAItC,QAC3C0xE,EAAW3B,EAAQyB,MAAMG,cAAc3qE,EAAS,EAAG1E,EAAItC,QACvD4xE,EAAQ/zE,OAAOm/B,SAAS00C,EAAU,IACxC,IAAIG,EAAY3B,EAAiB4B,eAAe5kD,OAAO0kD,GACvDC,EAAUv0E,KAAOA,EAAK6C,MACtB,IAAI0jF,EAAiBvhF,EAAItC,OAAS1C,EAAK0C,OAAS1C,EAAK6C,MACrD0xE,EAAUG,aAAahrE,EAAQ1F,MAAMgB,EAAItC,OAAS1C,EAAK0C,OAAQ6jF,IAC/DnlF,KAAKklF,UAAUngF,KAAKouE,GACpB7qE,EAAUA,EAAQ1F,MAAMuiF,KAIpCzmF,EAAQg2E,cAAgBA,oDCnCxBlvE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAM4vE,EAAU,EAAQ,MAClBkE,EAAU,EAAQ,MAClBhC,EAAc,EAAQ,MAC5B,MAAMqB,UAAoBW,EAAQhB,MAC9BtyE,cACIm/B,MAAMmyC,EAAYc,UAAUO,aAEhCI,gBACI,IAAI7/C,EAAQn1B,KAAKmkF,mBAOjB,OANInkF,KAAKolF,WACLjwD,EAAM,IAAM,KAEZn1B,KAAKqlF,cACLlwD,EAAM,IAAM,GAETj0B,EAAOqC,OAAO,CACjBvD,KAAKikF,mBACLjkF,KAAKkkF,mBACL/uD,EACAn1B,KAAK0kF,UAGbpR,aAAa1yE,GACTwgC,MAAMkyC,aAAa1yE,GAEnB,IAAIu0B,EAAQv0B,EADEywE,EAAQyB,MAAMC,SAASnyE,GACdU,OAAS,GAChCtB,KAAKolF,SAAWltD,QAAgB,IAAR/C,GACxBn1B,KAAKqlF,YAAcntD,QAAgB,EAAR/C,IAGnCz2B,EAAQk2E,YAAcA,oDC/BtBpvE,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,IACtD,MAAMqxE,EACF2C,gBAAgBlqE,EAAQ1E,EAAQ,GAC5B,MAAMvF,EAAS,EAAIwP,KAAK6gB,MAAM7gB,KAAKw0E,KAAK/5E,EAAO1E,KAC/C,GAAIvF,EAAS,EAAG,CACZ,MAAMwO,EAASgjE,EAAMG,cAAc1nE,EAAQ1E,EAAOA,EAAQvF,GAC1D,MAAM,IAAIrC,MAAM,2BAA2BqC,KAAUwO,KAEzD,GAAI2lB,MAAMn0B,IAAWuF,EAAQvF,EAASiK,EAAOjK,OACzC,OAAO,KAEX,GAAe,IAAXA,GAAgBiK,EAAO1E,EAAQ,IAAM,IAAQ0E,EAAO+qD,SAASzvD,EAAQ,EAAGA,EAAQ,GAAGiB,MAAKuD,GAAKA,EAAI,IACjG,MAAO,CACH/J,OAAQ,EACRG,OAAQ,GAGhB,IAAIA,EAAQ8J,EAAO1E,IAAW,GAAM,EAAIvF,GAAW,EACnD,IAAK,IAAI+J,EAAI,EAAGA,EAAI/J,EAAQ+J,GAAK,EAC7B5J,GAASqP,KAAKoB,IAAI,EAAG,GACrBzQ,GAAS8J,EAAO1E,EAAQwE,GAK5B,OAHI5J,IAAWqP,KAAKoB,IAAI,EAAa,EAAT5Q,GAAe,IACvCG,GAAS,GAEN,CACHH,OAAAA,EACAG,MAAAA,GAGRg0E,iBAAiBh0E,EAAO8jF,GACpB,GAAI9jF,EAAQ,GAAKA,EAASqP,KAAKoB,IAAI,EAAG,IAClC,MAAM,IAAIjT,MAAM,0BAA0BwC,KAE9C,IAAIH,EAASikF,EACb,IAAKjkF,EACD,IAAKA,EAAS,EAAGA,GAAU,KACnBG,EAAQqP,KAAKoB,IAAI,EAAI,EAAI5Q,GAAW,GADdA,GAAU,GAM5C,MAAMiK,EAASrK,EAAO6B,MAAMzB,GAC5B,IAAIqE,EAAMlE,EACV,IAAK,IAAI4J,EAAI,EAAGA,GAAK/J,EAAQ+J,GAAK,EAAG,CACjC,MAAMwH,EAAU,IAANlN,EACV4F,EAAOjK,EAAS+J,GAAKwH,EACrBlN,GAAOkN,EACPlN,GAAOmL,KAAKoB,IAAI,EAAG,GAGvB,OADA3G,EAAO,IAAM,GAAM,EAAIjK,EAChBiK,EAEXkqE,gBAAgB9vE,GACZ,OAAkB,GAAdA,EAAIrE,OACG,KAEO,GAAdqE,EAAIrE,OACG,IAAMqE,EAEVA,EAEX8vE,qBAAqB+P,EAAM3+E,EAAQ,EAAG6G,EAAM83E,EAAKzjF,YAC7C,OAAOL,MAAMmM,KAAK23E,EAAKlvB,SAASzvD,EAAO6G,IAClC9L,KAAIsS,GAAK/U,OAAO+U,GAAGjI,SAAS,MAC5BmyB,QAAO,CAAC1c,EAAKwF,IAAY,GAAGxF,IAAM1hB,KAAKylF,SAASv+D,MAAY,IAErEuuD,gBAAgB+P,GACZ,IACI,OAAOtkF,EAAO2M,KAAK23E,GAAMv5E,SAAS,QAEtC,MAAO89D,GACH,OAAO,MAGf0L,oBAAoB+P,GAChB,MAAM3yE,EAAI,IAAI6yE,SAASF,EAAKj6E,OAAQi6E,EAAK5tD,WAAY4tD,EAAKzjF,YAC1D,OAAQyjF,EAAKzjF,YACT,KAAK,EACD,OAAO8Q,EAAE8yE,SAAS,GACtB,KAAK,EACD,OAAO9yE,EAAE+yE,UAAU,GACvB,KAAK,EACD,OAAO/yE,EAAEgzE,UAAU,GAI3B,GAAIL,EAAKzjF,YAAc,EACnB,OAAOyjF,EAAKpnD,QAAO,CAAC1c,EAAKwF,IAAkB,IAANxF,EAAYwF,GAAS,GAE9D,IAAIgpD,EAAM4C,EAAMG,cAAcuS,EAAM,EAAGA,EAAKzjF,YACxC6D,EAAM04B,SAAS4xC,EAAK,IACxB,OAAItqE,GAAOkL,KAAKoB,IAAI,IAAK,GACdtM,EAEJsqE,EAEXuF,qBAAqB7vE,GACjB,GAAmB,iBAARA,EACP,OAAO1E,EAAO2M,KAAKjI,EAAK,OAEvB,CACD,IAAIoF,EAAM9J,EAAO6B,MAAM,GACvBiI,EAAI65C,KAAK,GACT75C,EAAI0xC,YAAY92C,EAAK,EAAG,GACxB,IAAIkgF,EAAkB96E,EAAI+6E,WAAUlzE,GAAW,IAANA,IAKzC,OAJyB,IAArBizE,IACAA,EAAkB96E,EAAI1J,OAAS,GAEzB0J,EAAIpI,MAAMkjF,IAI5BrQ,kBAAkB+P,GACd,MAAM3yE,EAAI,IAAI6yE,SAASF,EAAKj6E,OAAQi6E,EAAK5tD,WAAY4tD,EAAKzjF,YAC1D,OAAQyjF,EAAKzjF,YACT,KAAK,EACD,OAAO8Q,EAAEmzE,QAAQ,GACrB,KAAK,EACD,OAAOnzE,EAAEozE,SAAS,GACtB,KAAK,EACD,OAAOpzE,EAAEqzE,SAAS,GACtB,QACI,OAAOC,KAGnB1Q,mBAAmB7vE,GACf,IAAIoF,EAAM9J,EAAO6B,MAAM,GAEvB,OADAiI,EAAIquD,aAAazzD,EAAK,GACfoF,EAEXyqE,iBAAiB+P,GACb,MAAM3yE,EAAI,IAAI6yE,SAASF,EAAKj6E,OAAQi6E,EAAK5tD,WAAY4tD,EAAKzjF,YAC1D,OAAQyjF,EAAKzjF,YACT,KAAK,EACD,OAAO8Q,EAAEuzE,WAAW,GACxB,KAAK,EACD,OAAOvzE,EAAEwzE,WAAW,GACxB,QACI,OAAOF,KAGnB1Q,kBAAkB7vE,GACd,IAAIoF,EAAM9J,EAAO6B,MAAM,GAKvB,OAJciI,EAAIyuD,aAAa7zD,EAAK,IACrB,IACXoF,EAAMA,EAAIpI,MAAM,EAAG,IAEhBoI,GAGftM,EAAQo0E,MAAQA,+BCtJhB,IAAItS,EAAW9hE,EAEf8hE,EAAS8lB,QAAU,WACnB9lB,EAASuL,MAAQ,EAAQ,KACzBvL,EAASnoB,KAAO,EAAQ,MACxBmoB,EAASpb,MAAQ,EAAQ,MACzBob,EAASlc,OAAS,EAAQ,MAG1Bkc,EAASW,GAAK,EAAQ,MACtBX,EAAS+lB,MAAQ,EAAQ,mCCVzB,IAAI12E,EAAK,EAAQ,MACbk8D,EAAQ,EAAQ,KAChBya,EAASza,EAAMya,OACfC,EAAS1a,EAAM0a,OACfrjF,EAAS2oE,EAAM3oE,OAEnB,SAASsjF,EAAU1+E,EAAM2+E,GACvB3mF,KAAKgI,KAAOA,EACZhI,KAAKwP,EAAI,IAAIK,EAAG82E,EAAKn3E,EAAG,IAGxBxP,KAAKmQ,IAAMw2E,EAAK7gE,MAAQjW,EAAGM,IAAIw2E,EAAK7gE,OAASjW,EAAGuX,KAAKpnB,KAAKwP,GAG1DxP,KAAK4mF,KAAO,IAAI/2E,EAAG,GAAG8T,MAAM3jB,KAAKmQ,KACjCnQ,KAAK4mB,IAAM,IAAI/W,EAAG,GAAG8T,MAAM3jB,KAAKmQ,KAChCnQ,KAAK+N,IAAM,IAAI8B,EAAG,GAAG8T,MAAM3jB,KAAKmQ,KAGhCnQ,KAAKge,EAAI2oE,EAAK3oE,GAAK,IAAInO,EAAG82E,EAAK3oE,EAAG,IAClChe,KAAKgiB,EAAI2kE,EAAK3kE,GAAKhiB,KAAK6mF,cAAcF,EAAK3kE,EAAG2kE,EAAKG,MAGnD9mF,KAAK+mF,QAAU,IAAIrlF,MAAM,GACzB1B,KAAKgnF,QAAU,IAAItlF,MAAM,GACzB1B,KAAKinF,QAAU,IAAIvlF,MAAM,GACzB1B,KAAKknF,QAAU,IAAIxlF,MAAM,GAEzB1B,KAAKmnF,WAAannF,KAAKge,EAAIhe,KAAKge,EAAEvJ,YAAc,EAGhD,IAAI2yE,EAAcpnF,KAAKge,GAAKhe,KAAKwP,EAAEyR,IAAIjhB,KAAKge,IACvCopE,GAAeA,EAAYxkE,KAAK,KAAO,EAC1C5iB,KAAKqnF,KAAO,MAEZrnF,KAAKsnF,eAAgB,EACrBtnF,KAAKqnF,KAAOrnF,KAAKge,EAAE2F,MAAM3jB,KAAKmQ,MAwNlC,SAASo3E,EAAUniC,EAAOp9C,GACxBhI,KAAKolD,MAAQA,EACbplD,KAAKgI,KAAOA,EACZhI,KAAKwnF,YAAc,KAxNrB/oF,EAAOC,QAAUgoF,EAEjBA,EAAUzmF,UAAUwnF,MAAQ,WAC1B,MAAM,IAAIxoF,MAAM,oBAGlBynF,EAAUzmF,UAAUynF,SAAW,WAC7B,MAAM,IAAIzoF,MAAM,oBAGlBynF,EAAUzmF,UAAU0nF,aAAe,SAAsBn4E,EAAGwD,GAC1D5P,EAAOoM,EAAEg4E,aACT,IAAII,EAAUp4E,EAAEq4E,cAEZC,EAAMtB,EAAOxzE,EAAG,EAAGhT,KAAKmnF,YACxBY,GAAK,GAAMH,EAAQI,KAAO,IAAOJ,EAAQI,KAAO,GAAM,EAAI,EAAI,GAClED,GAAK,EAGL,IACIz8E,EACA28E,EAFAC,EAAO,GAGX,IAAK58E,EAAI,EAAGA,EAAIw8E,EAAIxmF,OAAQgK,GAAKs8E,EAAQI,KAAM,CAC7CC,EAAO,EACP,IAAK,IAAIxrE,EAAInR,EAAIs8E,EAAQI,KAAO,EAAGvrE,GAAKnR,EAAGmR,IACzCwrE,GAAQA,GAAQ,GAAKH,EAAIrrE,GAC3ByrE,EAAKnjF,KAAKkjF,GAKZ,IAFA,IAAIr1E,EAAI5S,KAAKmoF,OAAO,KAAM,KAAM,MAC5Bt1E,EAAI7S,KAAKmoF,OAAO,KAAM,KAAM,MACvB98E,EAAI08E,EAAG18E,EAAI,EAAGA,IAAK,CAC1B,IAAKC,EAAI,EAAGA,EAAI48E,EAAK5mF,OAAQgK,KAC3B28E,EAAOC,EAAK58E,MACCD,EACXwH,EAAIA,EAAEu1E,SAASR,EAAQS,OAAO/8E,IACvB28E,KAAU58E,IACjBwH,EAAIA,EAAEu1E,SAASR,EAAQS,OAAO/8E,GAAGgK,QAErC1C,EAAIA,EAAE8D,IAAI7D,GAEZ,OAAOD,EAAE01E,OAGX5B,EAAUzmF,UAAUsoF,SAAW,SAAkB/4E,EAAGwD,GAClD,IAAIxB,EAAI,EAGJg3E,EAAYh5E,EAAEi5E,cAAcj3E,GAChCA,EAAIg3E,EAAUvhE,IAQd,IAPA,IAAIA,EAAMuhE,EAAUH,OAGhBP,EAAMtB,EAAOxzE,EAAGxB,EAAGxR,KAAKmnF,YAGxBzlE,EAAM1hB,KAAKmoF,OAAO,KAAM,KAAM,MACzB98E,EAAIy8E,EAAIxmF,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CAExC,IAAK,IAAIoR,EAAI,EAAGpR,GAAK,GAAgB,IAAXy8E,EAAIz8E,GAAUA,IACtCoR,IAKF,GAJIpR,GAAK,GACPoR,IACFiF,EAAMA,EAAIgnE,KAAKjsE,GAEXpR,EAAI,EACN,MACF,IAAI0b,EAAI+gE,EAAIz8E,GACZjI,EAAa,IAAN2jB,GAIHrF,EAHW,WAAXlS,EAAExH,KAEA+e,EAAI,EACArF,EAAI0mE,SAASnhE,EAAKF,EAAI,GAAM,IAE5BrF,EAAI0mE,SAASnhE,GAAMF,EAAI,GAAM,GAAGzR,OAGpCyR,EAAI,EACArF,EAAIhL,IAAIuQ,EAAKF,EAAI,GAAM,IAEvBrF,EAAIhL,IAAIuQ,GAAMF,EAAI,GAAM,GAAGzR,OAGvC,MAAkB,WAAX9F,EAAExH,KAAoB0Z,EAAI4mE,MAAQ5mE,GAG3CglE,EAAUzmF,UAAU0oF,YAAc,SAAqBC,EACrDP,EACAQ,EACAz9E,EACA09E,GACA,IAMIz9E,EACAC,EACAkE,EARAu5E,EAAW/oF,KAAK+mF,QAChB9/D,EAAMjnB,KAAKgnF,QACXc,EAAM9nF,KAAKinF,QAGXl2E,EAAM,EAIV,IAAK1F,EAAI,EAAGA,EAAID,EAAKC,IAAK,CAExB,IAAIm9E,GADJh5E,EAAI64E,EAAOh9E,IACOo9E,cAAcG,GAChCG,EAAS19E,GAAKm9E,EAAUvhE,IACxBA,EAAI5b,GAAKm9E,EAAUH,OAIrB,IAAKh9E,EAAID,EAAM,EAAGC,GAAK,EAAGA,GAAK,EAAG,CAChC,IAAIuH,EAAIvH,EAAI,EACRwH,EAAIxH,EACR,GAAoB,IAAhB09E,EAASn2E,IAA4B,IAAhBm2E,EAASl2E,GAAlC,CAQA,IAAIm2E,EAAO,CACTX,EAAOz1E,GACP,KACA,KACAy1E,EAAOx1E,IAI4B,IAAjCw1E,EAAOz1E,GAAGuJ,EAAEjL,IAAIm3E,EAAOx1E,GAAGsJ,IAC5B6sE,EAAK,GAAKX,EAAOz1E,GAAG8D,IAAI2xE,EAAOx1E,IAC/Bm2E,EAAK,GAAKX,EAAOz1E,GAAGq2E,MAAMb,SAASC,EAAOx1E,GAAGyC,QACM,IAA1C+yE,EAAOz1E,GAAGuJ,EAAEjL,IAAIm3E,EAAOx1E,GAAGsJ,EAAE8I,WACrC+jE,EAAK,GAAKX,EAAOz1E,GAAGq2E,MAAMb,SAASC,EAAOx1E,IAC1Cm2E,EAAK,GAAKX,EAAOz1E,GAAG8D,IAAI2xE,EAAOx1E,GAAGyC,SAElC0zE,EAAK,GAAKX,EAAOz1E,GAAGq2E,MAAMb,SAASC,EAAOx1E,IAC1Cm2E,EAAK,GAAKX,EAAOz1E,GAAGq2E,MAAMb,SAASC,EAAOx1E,GAAGyC,QAG/C,IAAI1L,EAAQ,EACT,GACA,GACA,GACA,EACD,EACA,EACA,EACA,EACA,GAGEs/E,EAAMzC,EAAOoC,EAAOj2E,GAAIi2E,EAAOh2E,IAInC,IAHA9B,EAAMD,KAAKC,IAAIm4E,EAAI,GAAG5nF,OAAQyP,GAC9B+2E,EAAIl1E,GAAK,IAAIlR,MAAMqP,GACnB+2E,EAAIj1E,GAAK,IAAInR,MAAMqP,GACdzF,EAAI,EAAGA,EAAIyF,EAAKzF,IAAK,CACxB,IAAI69E,EAAiB,EAAZD,EAAI,GAAG59E,GACZ89E,EAAiB,EAAZF,EAAI,GAAG59E,GAEhBw8E,EAAIl1E,GAAGtH,GAAK1B,EAAiB,GAAVu/E,EAAK,IAAUC,EAAK,IACvCtB,EAAIj1E,GAAGvH,GAAK,EACZ2b,EAAIrU,GAAKo2E,QAhDTlB,EAAIl1E,GAAK4zE,EAAOqC,EAAOj2E,GAAIm2E,EAASn2E,GAAI5S,KAAKmnF,YAC7CW,EAAIj1E,GAAK2zE,EAAOqC,EAAOh2E,GAAIk2E,EAASl2E,GAAI7S,KAAKmnF,YAC7Cp2E,EAAMD,KAAKC,IAAI+2E,EAAIl1E,GAAGtR,OAAQyP,GAC9BA,EAAMD,KAAKC,IAAI+2E,EAAIj1E,GAAGvR,OAAQyP,GAiDlC,IAAI2Q,EAAM1hB,KAAKmoF,OAAO,KAAM,KAAM,MAC9Bz7E,EAAM1M,KAAKknF,QACf,IAAK77E,EAAI0F,EAAK1F,GAAK,EAAGA,IAAK,CAGzB,IAFA,IAAI2H,EAAI,EAED3H,GAAK,GAAG,CACb,IAAIu7E,GAAO,EACX,IAAKt7E,EAAI,EAAGA,EAAIF,EAAKE,IACnBoB,EAAIpB,GAAiB,EAAZw8E,EAAIx8E,GAAGD,GACD,IAAXqB,EAAIpB,KACNs7E,GAAO,GAEX,IAAKA,EACH,MACF5zE,IACA3H,IAKF,GAHIA,GAAK,GACP2H,IACF0O,EAAMA,EAAIgnE,KAAK11E,GACX3H,EAAI,EACN,MAEF,IAAKC,EAAI,EAAGA,EAAIF,EAAKE,IAAK,CACxB,IAAIyb,EAAIra,EAAIpB,GAEF,IAANyb,IAEKA,EAAI,EACXvX,EAAIyX,EAAI3b,GAAIyb,EAAI,GAAM,GACfA,EAAI,IACXvX,EAAIyX,EAAI3b,IAAKyb,EAAI,GAAM,GAAGzR,OAG1BoM,EADa,WAAXlS,EAAExH,KACE0Z,EAAI0mE,SAAS54E,GAEbkS,EAAIhL,IAAIlH,KAIpB,IAAKnE,EAAI,EAAGA,EAAID,EAAKC,IACnB4b,EAAI5b,GAAK,KAEX,OAAIy9E,EACKpnE,EAEAA,EAAI4mE,OAQf5B,EAAUa,UAAYA,EAEtBA,EAAUtnF,UAAUwjB,GAAK,WACvB,MAAM,IAAIxkB,MAAM,oBAGlBsoF,EAAUtnF,UAAUynF,SAAW,WAC7B,OAAO1nF,KAAKolD,MAAMsiC,SAAS1nF,OAG7B0mF,EAAUzmF,UAAUopF,YAAc,SAAqB3mF,EAAOjC,GAC5DiC,EAAQqpE,EAAM78D,QAAQxM,EAAOjC,GAE7B,IAAI2K,EAAMpL,KAAKwP,EAAEzN,aAGjB,IAAkB,IAAbW,EAAM,IAA4B,IAAbA,EAAM,IAA4B,IAAbA,EAAM,KACjDA,EAAMpB,OAAS,GAAM,EAAI8J,EAS3B,OARiB,IAAb1I,EAAM,GACRU,EAAOV,EAAMA,EAAMpB,OAAS,GAAK,GAAM,GACnB,IAAboB,EAAM,IACbU,EAAOV,EAAMA,EAAMpB,OAAS,GAAK,GAAM,GAE9BtB,KAAKynF,MAAM/kF,EAAME,MAAM,EAAG,EAAIwI,GACvC1I,EAAME,MAAM,EAAIwI,EAAK,EAAI,EAAIA,IAG1B,IAAkB,IAAb1I,EAAM,IAA4B,IAAbA,EAAM,KAC3BA,EAAMpB,OAAS,IAAM8J,EAC/B,OAAOpL,KAAKspF,WAAW5mF,EAAME,MAAM,EAAG,EAAIwI,GAAmB,IAAb1I,EAAM,IAExD,MAAM,IAAIzD,MAAM,yBAGlBsoF,EAAUtnF,UAAUspF,iBAAmB,SAA0B9oF,GAC/D,OAAOT,KAAKe,OAAON,GAAK,IAG1B8mF,EAAUtnF,UAAUiI,QAAU,SAAiB+nB,GAC7C,IAAI7kB,EAAMpL,KAAKolD,MAAM51C,EAAEzN,aACnBma,EAAIlc,KAAKiiE,OAAO/yD,QAAQ,KAAM9D,GAElC,OAAI6kB,EACK,CAAEjwB,KAAKwpF,OAAOvnE,SAAW,EAAO,GAAO1e,OAAO2Y,GAEhD,CAAE,GAAO3Y,OAAO2Y,EAAGlc,KAAKwpF,OAAOt6E,QAAQ,KAAM9D,KAGtDm8E,EAAUtnF,UAAUc,OAAS,SAAgBN,EAAKwvB,GAChD,OAAO87C,EAAMhrE,OAAOf,KAAKkI,QAAQ+nB,GAAUxvB,IAG7C8mF,EAAUtnF,UAAUwpF,WAAa,SAAoBC,GACnD,GAAI1pF,KAAKwnF,YACP,OAAOxnF,KAET,IAAIwnF,EAAc,CAChBI,QAAS,KACTE,IAAK,KACL6B,KAAM,MAOR,OALAnC,EAAYM,IAAM9nF,KAAKyoF,cAAc,GACrCjB,EAAYI,QAAU5nF,KAAK6nF,YAAY,EAAG6B,GAC1ClC,EAAYmC,KAAO3pF,KAAK4pF,WACxB5pF,KAAKwnF,YAAcA,EAEZxnF,MAGTunF,EAAUtnF,UAAU4pF,YAAc,SAAqB72E,GACrD,IAAKhT,KAAKwnF,YACR,OAAO,EAET,IAAII,EAAU5nF,KAAKwnF,YAAYI,QAC/B,QAAKA,GAGEA,EAAQS,OAAO/mF,QAAUwP,KAAKS,MAAMyB,EAAEyB,YAAc,GAAKmzE,EAAQI,OAG1ET,EAAUtnF,UAAU4nF,YAAc,SAAqBG,EAAM0B,GAC3D,GAAI1pF,KAAKwnF,aAAexnF,KAAKwnF,YAAYI,QACvC,OAAO5nF,KAAKwnF,YAAYI,QAI1B,IAFA,IAAIA,EAAU,CAAE5nF,MACZ0hB,EAAM1hB,KACDqL,EAAI,EAAGA,EAAIq+E,EAAOr+E,GAAK28E,EAAM,CACpC,IAAK,IAAI18E,EAAI,EAAGA,EAAI08E,EAAM18E,IACxBoW,EAAMA,EAAIooE,MACZlC,EAAQ7iF,KAAK2c,GAEf,MAAO,CACLsmE,KAAMA,EACNK,OAAQT,IAIZL,EAAUtnF,UAAUwoF,cAAgB,SAAuBxhE,GACzD,GAAIjnB,KAAKwnF,aAAexnF,KAAKwnF,YAAYM,IACvC,OAAO9nF,KAAKwnF,YAAYM,IAK1B,IAHA,IAAItlF,EAAM,CAAExC,MACR+Q,GAAO,GAAKkW,GAAO,EACnB6iE,EAAc,IAAR/4E,EAAY,KAAO/Q,KAAK8pF,MACzBz+E,EAAI,EAAGA,EAAI0F,EAAK1F,IACvB7I,EAAI6I,GAAK7I,EAAI6I,EAAI,GAAGqL,IAAIozE,GAC1B,MAAO,CACL7iE,IAAKA,EACLohE,OAAQ7lF,IAIZ+kF,EAAUtnF,UAAU2pF,SAAW,WAC7B,OAAO,MAGTrC,EAAUtnF,UAAUyoF,KAAO,SAAc11E,GAEvC,IADA,IAAIrC,EAAI3Q,KACCqL,EAAI,EAAGA,EAAI2H,EAAG3H,IACrBsF,EAAIA,EAAEm5E,MACR,OAAOn5E,gCCzXT,IAAIo7D,EAAQ,EAAQ,KAChBl8D,EAAK,EAAQ,MACbjQ,EAAW,EAAQ,MACnBO,EAAO,EAAQ,MAEfiD,EAAS2oE,EAAM3oE,OAEnB,SAAS2mF,EAAapD,GAEpB3mF,KAAKgqF,QAA2B,IAAP,EAATrD,EAAK/zE,GACrB5S,KAAKiqF,MAAQjqF,KAAKgqF,UAA6B,IAAR,EAATrD,EAAK/zE,GACnC5S,KAAK2f,SAAW3f,KAAKiqF,MAErB9pF,EAAKI,KAAKP,KAAM,UAAW2mF,GAE3B3mF,KAAK4S,EAAI,IAAI/C,EAAG82E,EAAK/zE,EAAG,IAAIyO,KAAKrhB,KAAKmQ,IAAIpR,GAC1CiB,KAAK4S,EAAI5S,KAAK4S,EAAE+Q,MAAM3jB,KAAKmQ,KAC3BnQ,KAAKwQ,EAAI,IAAIX,EAAG82E,EAAKn2E,EAAG,IAAImT,MAAM3jB,KAAKmQ,KACvCnQ,KAAK6iD,GAAK7iD,KAAKwQ,EAAEmU,SACjB3kB,KAAKs8B,EAAI,IAAIzsB,EAAG82E,EAAKrqD,EAAG,IAAI3Y,MAAM3jB,KAAKmQ,KACvCnQ,KAAKkqF,GAAKlqF,KAAKs8B,EAAEpY,OAAOlkB,KAAKs8B,GAE7Bl5B,GAAQpD,KAAKgqF,SAAwC,IAA7BhqF,KAAKwQ,EAAEuT,UAAUnB,KAAK,IAC9C5iB,KAAKmqF,KAAwB,IAAP,EAATxD,EAAKn2E,GAwFpB,SAAS45E,EAAMhlC,EAAOlpC,EAAGC,EAAG4K,EAAGxS,GAC7BpU,EAAKonF,UAAUhnF,KAAKP,KAAMolD,EAAO,cACvB,OAANlpC,GAAoB,OAANC,GAAoB,OAAN4K,GAC9B/mB,KAAKkc,EAAIlc,KAAKolD,MAAMwhC,KACpB5mF,KAAKmc,EAAInc,KAAKolD,MAAMx+B,IACpB5mB,KAAK+mB,EAAI/mB,KAAKolD,MAAMx+B,IACpB5mB,KAAKuU,EAAIvU,KAAKolD,MAAMwhC,KACpB5mF,KAAKqqF,MAAO,IAEZrqF,KAAKkc,EAAI,IAAIrM,EAAGqM,EAAG,IACnBlc,KAAKmc,EAAI,IAAItM,EAAGsM,EAAG,IACnBnc,KAAK+mB,EAAIA,EAAI,IAAIlX,EAAGkX,EAAG,IAAM/mB,KAAKolD,MAAMx+B,IACxC5mB,KAAKuU,EAAIA,GAAK,IAAI1E,EAAG0E,EAAG,IACnBvU,KAAKkc,EAAE/L,MACVnQ,KAAKkc,EAAIlc,KAAKkc,EAAEyH,MAAM3jB,KAAKolD,MAAMj1C,MAC9BnQ,KAAKmc,EAAEhM,MACVnQ,KAAKmc,EAAInc,KAAKmc,EAAEwH,MAAM3jB,KAAKolD,MAAMj1C,MAC9BnQ,KAAK+mB,EAAE5W,MACVnQ,KAAK+mB,EAAI/mB,KAAK+mB,EAAEpD,MAAM3jB,KAAKolD,MAAMj1C,MAC/BnQ,KAAKuU,IAAMvU,KAAKuU,EAAEpE,MACpBnQ,KAAKuU,EAAIvU,KAAKuU,EAAEoP,MAAM3jB,KAAKolD,MAAMj1C,MACnCnQ,KAAKqqF,KAAOrqF,KAAK+mB,IAAM/mB,KAAKolD,MAAMx+B,IAG9B5mB,KAAKolD,MAAMzlC,WAAa3f,KAAKuU,IAC/BvU,KAAKuU,EAAIvU,KAAKkc,EAAEsI,OAAOxkB,KAAKmc,GACvBnc,KAAKqqF,OACRrqF,KAAKuU,EAAIvU,KAAKuU,EAAEiQ,OAAOxkB,KAAK+mB,EAAE/B,cAjHtCplB,EAASmqF,EAAc5pF,GACvB1B,EAAOC,QAAUqrF,EAEjBA,EAAa9pF,UAAUqqF,MAAQ,SAAe1kF,GAC5C,OAAI5F,KAAKiqF,MACArkF,EAAIqf,SAEJjlB,KAAK4S,EAAE4R,OAAO5e,IAGzBmkF,EAAa9pF,UAAUsqF,MAAQ,SAAe3kF,GAC5C,OAAI5F,KAAKmqF,KACAvkF,EAEA5F,KAAKwQ,EAAEgU,OAAO5e,IAIzBmkF,EAAa9pF,UAAUkoF,OAAS,SAAgBjsE,EAAGC,EAAG4K,EAAGxS,GACvD,OAAOvU,KAAKynF,MAAMvrE,EAAGC,EAAG4K,EAAGxS,IAG7Bw1E,EAAa9pF,UAAUqpF,WAAa,SAAoBptE,EAAG+B,IACzD/B,EAAI,IAAIrM,EAAGqM,EAAG,KACP/L,MACL+L,EAAIA,EAAEyH,MAAM3jB,KAAKmQ,MAEnB,IAAIuS,EAAKxG,EAAEyI,SACP6lE,EAAMxqF,KAAK6iD,GAAGz+B,OAAOpkB,KAAK4S,EAAE4R,OAAO9B,IACnC+nE,EAAMzqF,KAAK4mB,IAAIxC,OAAOpkB,KAAK6iD,GAAGr+B,OAAOxkB,KAAKs8B,GAAG9X,OAAO9B,IAEpDgoE,EAAKF,EAAIhmE,OAAOimE,EAAIzlE,WACpB7I,EAAIuuE,EAAG5lE,UACX,GAA6C,IAAzC3I,EAAEwI,SAASP,OAAOsmE,GAAIx5E,IAAIlR,KAAK4mF,MACjC,MAAM,IAAI3nF,MAAM,iBAElB,IAAIojB,EAAQlG,EAAE4H,UAAU1B,QAIxB,OAHIpE,IAAQoE,IAAUpE,GAAOoE,KAC3BlG,EAAIA,EAAE8I,UAEDjlB,KAAKynF,MAAMvrE,EAAGC,IAGvB4tE,EAAa9pF,UAAU0qF,WAAa,SAAoBxuE,EAAG8B,IACzD9B,EAAI,IAAItM,EAAGsM,EAAG,KACPhM,MACLgM,EAAIA,EAAEwH,MAAM3jB,KAAKmQ,MAGnB,IAAIu6E,EAAKvuE,EAAEwI,SACP8lE,EAAMC,EAAGtmE,OAAOpkB,KAAK6iD,IACrB2nC,EAAME,EAAGlmE,OAAOxkB,KAAKs8B,GAAG9X,OAAOxkB,KAAK6iD,IAAIz+B,OAAOpkB,KAAK4S,GACpD8P,EAAK+nE,EAAIjmE,OAAOgmE,EAAIxlE,WAExB,GAA0B,IAAtBtC,EAAGxR,IAAIlR,KAAK4mF,MAAa,CAC3B,GAAI3oE,EACF,MAAM,IAAIhf,MAAM,iBAEhB,OAAOe,KAAKynF,MAAMznF,KAAK4mF,KAAMzqE,GAGjC,IAAID,EAAIwG,EAAGoC,UACX,GAA6C,IAAzC5I,EAAEyI,SAASP,OAAO1B,GAAIxR,IAAIlR,KAAK4mF,MACjC,MAAM,IAAI3nF,MAAM,iBAKlB,OAHIid,EAAE6H,UAAU1B,UAAYpE,IAC1B/B,EAAIA,EAAE+I,UAEDjlB,KAAKynF,MAAMvrE,EAAGC,IAGvB4tE,EAAa9pF,UAAUynF,SAAW,SAAkBD,GAClD,GAAIA,EAAMmD,aACR,OAAO,EAGTnD,EAAMoD,YAEN,IAAInoE,EAAK+kE,EAAMvrE,EAAEyI,SACb+lE,EAAKjD,EAAMtrE,EAAEwI,SACb8lE,EAAM/nE,EAAG8B,OAAOxkB,KAAK4S,GAAGsR,OAAOwmE,GAC/BF,EAAMxqF,KAAK6iD,GAAGr+B,OAAOxkB,KAAK4mB,IAAI1C,OAAOlkB,KAAKs8B,EAAE9X,OAAO9B,GAAI8B,OAAOkmE,KAElE,OAAwB,IAAjBD,EAAIv5E,IAAIs5E,IAkCjB5qF,EAASwqF,EAAOjqF,EAAKonF,WAErBwC,EAAa9pF,UAAU4mF,cAAgB,SAAuB3iF,GAC5D,OAAOkmF,EAAMU,SAAS9qF,KAAMkE,IAG9B6lF,EAAa9pF,UAAUwnF,MAAQ,SAAevrE,EAAGC,EAAG4K,EAAGxS,GACrD,OAAO,IAAI61E,EAAMpqF,KAAMkc,EAAGC,EAAG4K,EAAGxS,IAGlC61E,EAAMU,SAAW,SAAkB1lC,EAAOlhD,GACxC,OAAO,IAAIkmF,EAAMhlC,EAAOlhD,EAAI,GAAIA,EAAI,GAAIA,EAAI,KAG9CkmF,EAAMnqF,UAAUqS,QAAU,WACxB,OAAItS,KAAK4qF,aACA,sBACF,gBAAkB5qF,KAAKkc,EAAE6H,UAAU9X,SAAS,GAAI,GACnD,OAASjM,KAAKmc,EAAE4H,UAAU9X,SAAS,GAAI,GACvC,OAASjM,KAAK+mB,EAAEhD,UAAU9X,SAAS,GAAI,GAAK,KAGlDm+E,EAAMnqF,UAAU2qF,WAAa,WAE3B,OAA0B,IAAnB5qF,KAAKkc,EAAE0G,KAAK,KACO,IAAvB5iB,KAAKmc,EAAEjL,IAAIlR,KAAK+mB,IAChB/mB,KAAKqqF,MAAqC,IAA7BrqF,KAAKmc,EAAEjL,IAAIlR,KAAKolD,MAAM50C,KAGxC45E,EAAMnqF,UAAU8qF,QAAU,WAMxB,IAAIn4E,EAAI5S,KAAKkc,EAAEyI,SAEX9R,EAAI7S,KAAKmc,EAAEwI,SAEXnU,EAAIxQ,KAAK+mB,EAAEpC,SACfnU,EAAIA,EAAE2T,QAAQ3T,GAEd,IAAI8rB,EAAIt8B,KAAKolD,MAAMklC,MAAM13E,GAErBlM,EAAI1G,KAAKkc,EAAEgI,OAAOlkB,KAAKmc,GAAGwI,SAASN,QAAQzR,GAAGyR,QAAQxR,GAEtDmP,EAAIsa,EAAEpY,OAAOrR,GAEb8iB,EAAI3T,EAAEoC,OAAO5T,GAEboP,EAAI0c,EAAElY,OAAOvR,GAEbm4E,EAAKtkF,EAAE8d,OAAOmR,GAEds1D,EAAKjpE,EAAEwC,OAAO5E,GAEdsrE,EAAKxkF,EAAE8d,OAAO5E,GAEdurE,EAAKx1D,EAAEnR,OAAOxC,GAClB,OAAOhiB,KAAKolD,MAAMqiC,MAAMuD,EAAIC,EAAIE,EAAID,IAGtCd,EAAMnqF,UAAUmrF,SAAW,WAQzB,IAMIJ,EACAC,EACAE,EACAzkF,EACAkZ,EACAtU,EAXAuH,EAAI7S,KAAKkc,EAAEgI,OAAOlkB,KAAKmc,GAAGwI,SAE1BnU,EAAIxQ,KAAKkc,EAAEyI,SAEX2X,EAAIt8B,KAAKmc,EAAEwI,SAQf,GAAI3kB,KAAKolD,MAAM4kC,QAAS,CAItB,IAAIr0D,GAFJjvB,EAAI1G,KAAKolD,MAAMklC,MAAM95E,IAEX0T,OAAOoY,GACbt8B,KAAKqqF,MAEPW,EAAKn4E,EAAEuR,OAAO5T,GAAG4T,OAAOkY,GAAG9X,OAAOmR,EAAEvR,OAAOpkB,KAAKolD,MAAMr3C,MAEtDk9E,EAAKt1D,EAAEnR,OAAO9d,EAAE0d,OAAOkY,IAEvB6uD,EAAKx1D,EAAEhR,SAASP,OAAOuR,GAAGvR,OAAOuR,KAGjC/V,EAAI5f,KAAK+mB,EAAEpC,SAEXrZ,EAAIqqB,EAAEvR,OAAOxE,GAAGyE,QAAQzE,GAExBorE,EAAKn4E,EAAEuR,OAAO5T,GAAG6T,QAAQiY,GAAG9X,OAAOlZ,GAEnC2/E,EAAKt1D,EAAEnR,OAAO9d,EAAE0d,OAAOkY,IAEvB6uD,EAAKx1D,EAAEnR,OAAOlZ,SAIhB5E,EAAI8J,EAAE0T,OAAOoY,GAEb1c,EAAI5f,KAAKolD,MAAMmlC,MAAMvqF,KAAK+mB,GAAGpC,SAE7BrZ,EAAI5E,EAAE0d,OAAOxE,GAAGwE,OAAOxE,GAEvBorE,EAAKhrF,KAAKolD,MAAMmlC,MAAM13E,EAAEwR,QAAQ3d,IAAI8d,OAAOlZ,GAE3C2/E,EAAKjrF,KAAKolD,MAAMmlC,MAAM7jF,GAAG8d,OAAOhU,EAAE6T,QAAQiY,IAE1C6uD,EAAKzkF,EAAE8d,OAAOlZ,GAEhB,OAAOtL,KAAKolD,MAAMqiC,MAAMuD,EAAIC,EAAIE,IAGlCf,EAAMnqF,UAAU6pF,IAAM,WACpB,OAAI9pF,KAAK4qF,aACA5qF,KAGLA,KAAKolD,MAAMzlC,SACN3f,KAAK+qF,UAEL/qF,KAAKorF,YAGhBhB,EAAMnqF,UAAUorF,QAAU,SAAiB77E,GAMzC,IAAIoD,EAAI5S,KAAKmc,EAAEiI,OAAOpkB,KAAKkc,GAAGsI,OAAOhV,EAAE2M,EAAEiI,OAAO5U,EAAE0M,IAE9CrJ,EAAI7S,KAAKmc,EAAE+H,OAAOlkB,KAAKkc,GAAGsI,OAAOhV,EAAE2M,EAAE+H,OAAO1U,EAAE0M,IAE9C1L,EAAIxQ,KAAKuU,EAAEiQ,OAAOxkB,KAAKolD,MAAM8kC,IAAI1lE,OAAOhV,EAAE+E,GAE1C+nB,EAAIt8B,KAAK+mB,EAAEvC,OAAOhV,EAAEuX,EAAE7C,OAAO1U,EAAEuX,IAE/BrgB,EAAImM,EAAEuR,OAAOxR,GAEb+iB,EAAI2G,EAAElY,OAAO5T,GAEbwR,EAAIsa,EAAEpY,OAAO1T,GAEboP,EAAI/M,EAAEqR,OAAOtR,GAEbo4E,EAAKtkF,EAAE8d,OAAOmR,GAEds1D,EAAKjpE,EAAEwC,OAAO5E,GAEdsrE,EAAKxkF,EAAE8d,OAAO5E,GAEdurE,EAAKx1D,EAAEnR,OAAOxC,GAClB,OAAOhiB,KAAKolD,MAAMqiC,MAAMuD,EAAIC,EAAIE,EAAID,IAGtCd,EAAMnqF,UAAUqrF,SAAW,SAAkB97E,GAO3C,IAgBIy7E,EACAE,EAjBAv4E,EAAI5S,KAAK+mB,EAAEvC,OAAOhV,EAAEuX,GAEpBlU,EAAID,EAAE+R,SAENnU,EAAIxQ,KAAKkc,EAAEsI,OAAOhV,EAAE0M,GAEpBogB,EAAIt8B,KAAKmc,EAAEqI,OAAOhV,EAAE2M,GAEpBzV,EAAI1G,KAAKolD,MAAM9oB,EAAE9X,OAAOhU,GAAGgU,OAAO8X,GAElC3G,EAAI9iB,EAAEuR,OAAO1d,GAEbsb,EAAInP,EAAEqR,OAAOxd,GAEbgG,EAAM1M,KAAKkc,EAAEgI,OAAOlkB,KAAKmc,GAAGqI,OAAOhV,EAAE0M,EAAEgI,OAAO1U,EAAE2M,IAAIkI,QAAQ7T,GAAG6T,QAAQiY,GACvE0uD,EAAKp4E,EAAE4R,OAAOmR,GAAGnR,OAAO9X,GAc5B,OAXI1M,KAAKolD,MAAM4kC,SAEbiB,EAAKr4E,EAAE4R,OAAOxC,GAAGwC,OAAO8X,EAAElY,OAAOpkB,KAAKolD,MAAMklC,MAAM95E,KAElD26E,EAAKx1D,EAAEnR,OAAOxC,KAGdipE,EAAKr4E,EAAE4R,OAAOxC,GAAGwC,OAAO8X,EAAElY,OAAO5T,IAEjC26E,EAAKnrF,KAAKolD,MAAMmlC,MAAM50D,GAAGnR,OAAOxC,IAE3BhiB,KAAKolD,MAAMqiC,MAAMuD,EAAIC,EAAIE,IAGlCf,EAAMnqF,UAAUyW,IAAM,SAAalH,GACjC,OAAIxP,KAAK4qF,aACAp7E,EACLA,EAAEo7E,aACG5qF,KAELA,KAAKolD,MAAMzlC,SACN3f,KAAKqrF,QAAQ77E,GAEbxP,KAAKsrF,SAAS97E,IAGzB46E,EAAMnqF,UAAU4Q,IAAM,SAAamC,GACjC,OAAIhT,KAAK6pF,YAAY72E,GACZhT,KAAKolD,MAAMuiC,aAAa3nF,KAAMgT,GAE9BhT,KAAKolD,MAAMmjC,SAASvoF,KAAMgT,IAGrCo3E,EAAMnqF,UAAUsrF,OAAS,SAAgBrd,EAAI1+D,EAAG2+D,GAC9C,OAAOnuE,KAAKolD,MAAMujC,YAAY,EAAG,CAAE3oF,KAAMwP,GAAK,CAAE0+D,EAAIC,GAAM,GAAG,IAG/Dic,EAAMnqF,UAAUurF,QAAU,SAAiBtd,EAAI1+D,EAAG2+D,GAChD,OAAOnuE,KAAKolD,MAAMujC,YAAY,EAAG,CAAE3oF,KAAMwP,GAAK,CAAE0+D,EAAIC,GAAM,GAAG,IAG/Dic,EAAMnqF,UAAU4qF,UAAY,WAC1B,GAAI7qF,KAAKqqF,KACP,OAAOrqF,KAGT,IAAIyrF,EAAKzrF,KAAK+mB,EAAE/B,UAOhB,OANAhlB,KAAKkc,EAAIlc,KAAKkc,EAAEsI,OAAOinE,GACvBzrF,KAAKmc,EAAInc,KAAKmc,EAAEqI,OAAOinE,GACnBzrF,KAAKuU,IACPvU,KAAKuU,EAAIvU,KAAKuU,EAAEiQ,OAAOinE,IACzBzrF,KAAK+mB,EAAI/mB,KAAKolD,MAAMx+B,IACpB5mB,KAAKqqF,MAAO,EACLrqF,MAGToqF,EAAMnqF,UAAUqV,IAAM,WACpB,OAAOtV,KAAKolD,MAAMqiC,MAAMznF,KAAKkc,EAAE+I,SAC7BjlB,KAAKmc,EACLnc,KAAK+mB,EACL/mB,KAAKuU,GAAKvU,KAAKuU,EAAE0Q,WAGrBmlE,EAAMnqF,UAAUgiE,KAAO,WAErB,OADAjiE,KAAK6qF,YACE7qF,KAAKkc,EAAE6H,WAGhBqmE,EAAMnqF,UAAUupF,KAAO,WAErB,OADAxpF,KAAK6qF,YACE7qF,KAAKmc,EAAE4H,WAGhBqmE,EAAMnqF,UAAUwjB,GAAK,SAAYwN,GAC/B,OAAOjxB,OAASixB,GACyB,IAAlCjxB,KAAKiiE,OAAO/wD,IAAI+f,EAAMgxC,SACY,IAAlCjiE,KAAKwpF,OAAOt4E,IAAI+f,EAAMu4D,SAG/BY,EAAMnqF,UAAUyrF,OAAS,SAAgBxvE,GACvC,IAAI4B,EAAK5B,EAAEyH,MAAM3jB,KAAKolD,MAAMj1C,KAAKqU,OAAOxkB,KAAK+mB,GAC7C,GAAuB,IAAnB/mB,KAAKkc,EAAEhL,IAAI4M,GACb,OAAO,EAIT,IAFA,IAAI6tE,EAAKzvE,EAAEvX,QACP4P,EAAIvU,KAAKolD,MAAMiiC,KAAK7iE,OAAOxkB,KAAK+mB,KAC3B,CAEP,GADA4kE,EAAGn1E,KAAKxW,KAAKolD,MAAMpnC,GACf2tE,EAAGz6E,IAAIlR,KAAKolD,MAAM51C,IAAM,EAC1B,OAAO,EAGT,GADAsO,EAAGqG,QAAQ5P,GACY,IAAnBvU,KAAKkc,EAAEhL,IAAI4M,GACb,OAAO,IAKbssE,EAAMnqF,UAAUqoF,IAAM8B,EAAMnqF,UAAU4qF,UACtCT,EAAMnqF,UAAUmoF,SAAWgC,EAAMnqF,UAAUyW,iCChb3C,IAAI0uC,EAAQ1mD,EAEZ0mD,EAAM5lD,KAAO,EAAQ,MACrB4lD,EAAMwmC,MAAQ,EAAQ,MACtBxmC,EAAMh+B,KAAO,EAAQ,MACrBg+B,EAAMymC,QAAU,EAAQ,mCCLxB,IAAIh8E,EAAK,EAAQ,MACbjQ,EAAW,EAAQ,MACnBO,EAAO,EAAQ,MAEf4rE,EAAQ,EAAQ,KAEpB,SAAS+f,EAAUnF,GACjBxmF,EAAKI,KAAKP,KAAM,OAAQ2mF,GAExB3mF,KAAK4S,EAAI,IAAI/C,EAAG82E,EAAK/zE,EAAG,IAAI+Q,MAAM3jB,KAAKmQ,KACvCnQ,KAAK6S,EAAI,IAAIhD,EAAG82E,EAAK9zE,EAAG,IAAI8Q,MAAM3jB,KAAKmQ,KACvCnQ,KAAK+rF,GAAK,IAAIl8E,EAAG,GAAG8T,MAAM3jB,KAAKmQ,KAAK6U,UACpChlB,KAAK+N,IAAM,IAAI8B,EAAG,GAAG8T,MAAM3jB,KAAKmQ,KAChCnQ,KAAKgsF,IAAMhsF,KAAK+rF,GAAGvnE,OAAOxkB,KAAK4S,EAAEsR,OAAOlkB,KAAK+N,MAc/C,SAASq8E,EAAMhlC,EAAOlpC,EAAG6K,GACvB5mB,EAAKonF,UAAUhnF,KAAKP,KAAMolD,EAAO,cACvB,OAANlpC,GAAoB,OAAN6K,GAChB/mB,KAAKkc,EAAIlc,KAAKolD,MAAMx+B,IACpB5mB,KAAK+mB,EAAI/mB,KAAKolD,MAAMwhC,OAEpB5mF,KAAKkc,EAAI,IAAIrM,EAAGqM,EAAG,IACnBlc,KAAK+mB,EAAI,IAAIlX,EAAGkX,EAAG,IACd/mB,KAAKkc,EAAE/L,MACVnQ,KAAKkc,EAAIlc,KAAKkc,EAAEyH,MAAM3jB,KAAKolD,MAAMj1C,MAC9BnQ,KAAK+mB,EAAE5W,MACVnQ,KAAK+mB,EAAI/mB,KAAK+mB,EAAEpD,MAAM3jB,KAAKolD,MAAMj1C,OAvBvCvQ,EAASksF,EAAW3rF,GACpB1B,EAAOC,QAAUotF,EAEjBA,EAAU7rF,UAAUynF,SAAW,SAAkBD,GAC/C,IAAIvrE,EAAIurE,EAAMoD,YAAY3uE,EACtBwG,EAAKxG,EAAEyI,SACP6lE,EAAM9nE,EAAG8B,OAAOtI,GAAGgI,OAAOxB,EAAG8B,OAAOxkB,KAAK4S,IAAIsR,OAAOhI,GAGxD,OAA+B,IAFvBsuE,EAAI1lE,UAEHH,SAASzT,IAAIs5E,IAiBxB5qF,EAASwqF,EAAOjqF,EAAKonF,WAErBuE,EAAU7rF,UAAUopF,YAAc,SAAqB3mF,EAAOjC,GAC5D,OAAOT,KAAKynF,MAAM1b,EAAM78D,QAAQxM,EAAOjC,GAAM,IAG/CqrF,EAAU7rF,UAAUwnF,MAAQ,SAAevrE,EAAG6K,GAC5C,OAAO,IAAIqjE,EAAMpqF,KAAMkc,EAAG6K,IAG5B+kE,EAAU7rF,UAAU4mF,cAAgB,SAAuB3iF,GACzD,OAAOkmF,EAAMU,SAAS9qF,KAAMkE,IAG9BkmF,EAAMnqF,UAAUwpF,WAAa,aAI7BW,EAAMnqF,UAAUiI,QAAU,WACxB,OAAOlI,KAAKiiE,OAAO/yD,QAAQ,KAAMlP,KAAKolD,MAAM51C,EAAEzN,eAGhDqoF,EAAMU,SAAW,SAAkB1lC,EAAOlhD,GACxC,OAAO,IAAIkmF,EAAMhlC,EAAOlhD,EAAI,GAAIA,EAAI,IAAMkhD,EAAMx+B,MAGlDwjE,EAAMnqF,UAAUqS,QAAU,WACxB,OAAItS,KAAK4qF,aACA,sBACF,gBAAkB5qF,KAAKkc,EAAE6H,UAAU9X,SAAS,GAAI,GACnD,OAASjM,KAAK+mB,EAAEhD,UAAU9X,SAAS,GAAI,GAAK,KAGlDm+E,EAAMnqF,UAAU2qF,WAAa,WAE3B,OAA0B,IAAnB5qF,KAAK+mB,EAAEnE,KAAK,IAGrBwnE,EAAMnqF,UAAU6pF,IAAM,WAKpB,IAEImC,EAFIjsF,KAAKkc,EAAEgI,OAAOlkB,KAAK+mB,GAEhBpC,SAIPunE,EAFIlsF,KAAKkc,EAAEkI,OAAOpkB,KAAK+mB,GAEhBpC,SAEPnU,EAAIy7E,EAAG7nE,OAAO8nE,GAEdlB,EAAKiB,EAAGznE,OAAO0nE,GAEff,EAAK36E,EAAEgU,OAAO0nE,EAAGhoE,OAAOlkB,KAAKolD,MAAM4mC,IAAIxnE,OAAOhU,KAClD,OAAOxQ,KAAKolD,MAAMqiC,MAAMuD,EAAIG,IAG9Bf,EAAMnqF,UAAUyW,IAAM,WACpB,MAAM,IAAIzX,MAAM,sCAGlBmrF,EAAMnqF,UAAUksF,QAAU,SAAiB38E,EAAGuR,GAK5C,IAAInO,EAAI5S,KAAKkc,EAAEgI,OAAOlkB,KAAK+mB,GAEvBlU,EAAI7S,KAAKkc,EAAEkI,OAAOpkB,KAAK+mB,GAEvBvW,EAAIhB,EAAE0M,EAAEgI,OAAO1U,EAAEuX,GAIjBqlE,EAFI58E,EAAE0M,EAAEkI,OAAO5U,EAAEuX,GAEVvC,OAAO5R,GAEdm2B,EAAKv4B,EAAEgU,OAAO3R,GAEdm4E,EAAKjqE,EAAKgG,EAAEvC,OAAO4nE,EAAGloE,OAAO6kB,GAAIpkB,UAEjCwmE,EAAKpqE,EAAK7E,EAAEsI,OAAO4nE,EAAG/nE,QAAQ0kB,GAAIpkB,UACtC,OAAO3kB,KAAKolD,MAAMqiC,MAAMuD,EAAIG,IAG9Bf,EAAMnqF,UAAU4Q,IAAM,SAAamC,GAMjC,IALA,IAAIuB,EAAIvB,EAAErO,QACNiO,EAAI5S,KACJ6S,EAAI7S,KAAKolD,MAAMqiC,MAAM,KAAM,MAGtBnoE,EAAO,GAAkB,IAAd/K,EAAEqO,KAAK,GAAUrO,EAAEH,OAAO,GAC5CkL,EAAKva,KAAKwP,EAAEJ,MAAM,IAEpB,IAAK,IAAI9I,EAAIiU,EAAKhe,OAAS,EAAG+J,GAAK,EAAGA,IACpB,IAAZiU,EAAKjU,IAEPuH,EAAIA,EAAEu5E,QAAQt5E,EARV7S,MAUJ6S,EAAIA,EAAEi3E,QAGNj3E,EAAID,EAAEu5E,QAAQt5E,EAbV7S,MAeJ4S,EAAIA,EAAEk3E,OAGV,OAAOj3E,GAGTu3E,EAAMnqF,UAAUsrF,OAAS,WACvB,MAAM,IAAItsF,MAAM,sCAGlBmrF,EAAMnqF,UAAUosF,QAAU,WACxB,MAAM,IAAIptF,MAAM,sCAGlBmrF,EAAMnqF,UAAUwjB,GAAK,SAAYwN,GAC/B,OAAyC,IAAlCjxB,KAAKiiE,OAAO/wD,IAAI+f,EAAMgxC,SAG/BmoB,EAAMnqF,UAAU4qF,UAAY,WAG1B,OAFA7qF,KAAKkc,EAAIlc,KAAKkc,EAAEsI,OAAOxkB,KAAK+mB,EAAE/B,WAC9BhlB,KAAK+mB,EAAI/mB,KAAKolD,MAAMx+B,IACb5mB,MAGToqF,EAAMnqF,UAAUgiE,KAAO,WAIrB,OAFAjiE,KAAK6qF,YAEE7qF,KAAKkc,EAAE6H,wCC9KhB,IAAIgoD,EAAQ,EAAQ,KAChBl8D,EAAK,EAAQ,MACbjQ,EAAW,EAAQ,MACnBO,EAAO,EAAQ,MAEfiD,EAAS2oE,EAAM3oE,OAEnB,SAASkpF,EAAW3F,GAClBxmF,EAAKI,KAAKP,KAAM,QAAS2mF,GAEzB3mF,KAAK4S,EAAI,IAAI/C,EAAG82E,EAAK/zE,EAAG,IAAI+Q,MAAM3jB,KAAKmQ,KACvCnQ,KAAK6S,EAAI,IAAIhD,EAAG82E,EAAK9zE,EAAG,IAAI8Q,MAAM3jB,KAAKmQ,KACvCnQ,KAAKusF,KAAOvsF,KAAK+N,IAAIiX,UAErBhlB,KAAKwsF,MAAqC,IAA7BxsF,KAAK4S,EAAEmR,UAAUnB,KAAK,GACnC5iB,KAAKysF,OAAmD,IAA1CzsF,KAAK4S,EAAEmR,UAAUpN,IAAI3W,KAAKwP,GAAGoT,MAAM,GAGjD5iB,KAAK0sF,KAAO1sF,KAAK2sF,iBAAiBhG,GAClC3mF,KAAK4sF,YAAc,IAAIlrF,MAAM,GAC7B1B,KAAK6sF,YAAc,IAAInrF,MAAM,GAoO/B,SAAS0oF,EAAMhlC,EAAOlpC,EAAGC,EAAG2wE,GAC1B3sF,EAAKonF,UAAUhnF,KAAKP,KAAMolD,EAAO,UACvB,OAANlpC,GAAoB,OAANC,GAChBnc,KAAKkc,EAAI,KACTlc,KAAKmc,EAAI,KACTnc,KAAK+sF,KAAM,IAEX/sF,KAAKkc,EAAI,IAAIrM,EAAGqM,EAAG,IACnBlc,KAAKmc,EAAI,IAAItM,EAAGsM,EAAG,IAEf2wE,IACF9sF,KAAKkc,EAAE+H,SAASjkB,KAAKolD,MAAMj1C,KAC3BnQ,KAAKmc,EAAE8H,SAASjkB,KAAKolD,MAAMj1C,MAExBnQ,KAAKkc,EAAE/L,MACVnQ,KAAKkc,EAAIlc,KAAKkc,EAAEyH,MAAM3jB,KAAKolD,MAAMj1C,MAC9BnQ,KAAKmc,EAAEhM,MACVnQ,KAAKmc,EAAInc,KAAKmc,EAAEwH,MAAM3jB,KAAKolD,MAAMj1C,MACnCnQ,KAAK+sF,KAAM,GA6Nf,SAASC,EAAO5nC,EAAOlpC,EAAGC,EAAG4K,GAC3B5mB,EAAKonF,UAAUhnF,KAAKP,KAAMolD,EAAO,YACvB,OAANlpC,GAAoB,OAANC,GAAoB,OAAN4K,GAC9B/mB,KAAKkc,EAAIlc,KAAKolD,MAAMx+B,IACpB5mB,KAAKmc,EAAInc,KAAKolD,MAAMx+B,IACpB5mB,KAAK+mB,EAAI,IAAIlX,EAAG,KAEhB7P,KAAKkc,EAAI,IAAIrM,EAAGqM,EAAG,IACnBlc,KAAKmc,EAAI,IAAItM,EAAGsM,EAAG,IACnBnc,KAAK+mB,EAAI,IAAIlX,EAAGkX,EAAG,KAEhB/mB,KAAKkc,EAAE/L,MACVnQ,KAAKkc,EAAIlc,KAAKkc,EAAEyH,MAAM3jB,KAAKolD,MAAMj1C,MAC9BnQ,KAAKmc,EAAEhM,MACVnQ,KAAKmc,EAAInc,KAAKmc,EAAEwH,MAAM3jB,KAAKolD,MAAMj1C,MAC9BnQ,KAAK+mB,EAAE5W,MACVnQ,KAAK+mB,EAAI/mB,KAAK+mB,EAAEpD,MAAM3jB,KAAKolD,MAAMj1C,MAEnCnQ,KAAKqqF,KAAOrqF,KAAK+mB,IAAM/mB,KAAKolD,MAAMx+B,IAnepChnB,EAAS0sF,EAAYnsF,GACrB1B,EAAOC,QAAU4tF,EAEjBA,EAAWrsF,UAAU0sF,iBAAmB,SAA0BhG,GAEhE,GAAK3mF,KAAKwsF,OAAUxsF,KAAKgiB,GAAMhiB,KAAKge,GAAwB,IAAnBhe,KAAKwP,EAAEgE,KAAK,GAArD,CAIA,IAAIm2E,EACAsD,EACJ,GAAItG,EAAKgD,KACPA,EAAO,IAAI95E,EAAG82E,EAAKgD,KAAM,IAAIhmE,MAAM3jB,KAAKmQ,SACnC,CACL,IAAI+8E,EAAQltF,KAAKmtF,cAAcntF,KAAKwP,GAGpCm6E,GADAA,EAAOuD,EAAM,GAAGh8E,IAAIg8E,EAAM,IAAM,EAAIA,EAAM,GAAKA,EAAM,IACzCvpE,MAAM3jB,KAAKmQ,KAEzB,GAAIw2E,EAAKsG,OACPA,EAAS,IAAIp9E,EAAG82E,EAAKsG,OAAQ,QACxB,CAEL,IAAIG,EAAUptF,KAAKmtF,cAAcntF,KAAKge,GACsB,IAAxDhe,KAAKgiB,EAAEnR,IAAIu8E,EAAQ,IAAIlxE,EAAEhL,IAAIlR,KAAKgiB,EAAE9F,EAAEsI,OAAOmlE,IAC/CsD,EAASG,EAAQ,IAEjBH,EAASG,EAAQ,GACjBhqF,EAA2D,IAApDpD,KAAKgiB,EAAEnR,IAAIo8E,GAAQ/wE,EAAEhL,IAAIlR,KAAKgiB,EAAE9F,EAAEsI,OAAOmlE,MAiBpD,MAAO,CACLA,KAAMA,EACNsD,OAAQA,EACRI,MAdE1G,EAAK0G,MACC1G,EAAK0G,MAAMzrF,KAAI,SAAS0rF,GAC9B,MAAO,CACL16E,EAAG,IAAI/C,EAAGy9E,EAAI16E,EAAG,IACjBC,EAAG,IAAIhD,EAAGy9E,EAAIz6E,EAAG,QAIb7S,KAAKutF,cAAcN,MAU/BX,EAAWrsF,UAAUktF,cAAgB,SAAuBvnF,GAI1D,IAAIuK,EAAMvK,IAAQ5F,KAAKwP,EAAIxP,KAAKmQ,IAAMN,EAAGuX,KAAKxhB,GAC1C2mF,EAAO,IAAI18E,EAAG,GAAG8T,MAAMxT,GAAK6U,UAC5BwoE,EAAQjB,EAAKtnE,SAEb9H,EAAI,IAAItN,EAAG,GAAG8T,MAAMxT,GAAK8U,SAASH,UAAUN,OAAO+nE,GAIvD,MAAO,CAFEiB,EAAMtpE,OAAO/G,GAAG4G,UAChBypE,EAAMppE,OAAOjH,GAAG4G,YAI3BuoE,EAAWrsF,UAAUstF,cAAgB,SAAuBN,GA2B1D,IAzBA,IAYIl2E,EACA8B,EAEA3B,EACA8B,EAEA3B,EACA8B,EAEAs0E,EAEA98E,EACAuL,EAxBAwxE,EAAW1tF,KAAKge,EAAEmC,MAAMrP,KAAK6gB,MAAM3xB,KAAKge,EAAEvJ,YAAc,IAIxD4S,EAAI4lE,EACJl0C,EAAI/4C,KAAKge,EAAErZ,QACX8d,EAAK,IAAI5S,EAAG,GACZ89E,EAAK,IAAI99E,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GACZ66E,EAAK,IAAI76E,EAAG,GAaZxE,EAAI,EAGa,IAAdgc,EAAEzE,KAAK,IAAU,CACtB,IAAI1O,EAAI6kC,EAAE93B,IAAIoG,GACd1W,EAAIooC,EAAEpiC,IAAIzC,EAAErD,IAAIwW,IAChBnL,EAAIwG,EAAG/L,IAAIzC,EAAErD,IAAI4R,IACjB,IAAItG,EAAIuuE,EAAG/zE,IAAIzC,EAAErD,IAAI88E,IAErB,IAAKz2E,GAAMvG,EAAEO,IAAIw8E,GAAY,EAC3B32E,EAAK02E,EAAMn4E,MACXuD,EAAK4J,EACLvL,EAAKvG,EAAE2E,MACP0D,EAAKkD,OACA,GAAIhF,GAAc,KAAN7L,EACjB,MAEFoiF,EAAQ98E,EAERooC,EAAI1xB,EACJA,EAAI1W,EACJ+R,EAAKD,EACLA,EAAKvG,EACLwuE,EAAKiD,EACLA,EAAKxxE,EAEP9E,EAAK1G,EAAE2E,MACP6D,EAAK+C,EAEL,IAAI0xE,EAAO12E,EAAGgI,MAAMxI,IAAIsC,EAAGkG,OAiB3B,OAhBW7H,EAAG6H,MAAMxI,IAAIyC,EAAG+F,OAClBhO,IAAI08E,IAAS,IACpBv2E,EAAKN,EACLoC,EAAKN,GAIH3B,EAAGjH,WACLiH,EAAKA,EAAG5B,MACR0D,EAAKA,EAAG1D,OAEN+B,EAAGpH,WACLoH,EAAKA,EAAG/B,MACR6D,EAAKA,EAAG7D,OAGH,CACL,CAAE1C,EAAGsE,EAAIrE,EAAGmG,GACZ,CAAEpG,EAAGyE,EAAIxE,EAAGsG,KAIhBmzE,EAAWrsF,UAAU4tF,WAAa,SAAoB76E,GACpD,IAAIq6E,EAAQrtF,KAAK0sF,KAAKW,MAClBS,EAAKT,EAAM,GACXU,EAAKV,EAAM,GAEXzqC,EAAKmrC,EAAGl7E,EAAEhC,IAAImC,GAAGsO,SAASthB,KAAKge,GAC/B6kC,EAAKirC,EAAGj7E,EAAEyC,MAAMzE,IAAImC,GAAGsO,SAASthB,KAAKge,GAErCgwE,EAAKprC,EAAG/xC,IAAIi9E,EAAGl7E,GACfq7E,EAAKprC,EAAGhyC,IAAIk9E,EAAGn7E,GACfs7E,EAAKtrC,EAAG/xC,IAAIi9E,EAAGj7E,GACfs7E,EAAKtrC,EAAGhyC,IAAIk9E,EAAGl7E,GAKnB,MAAO,CAAEq7D,GAFAl7D,EAAE2D,IAAIq3E,GAAIr3E,IAAIs3E,GAEN9f,GADR+f,EAAGx3E,IAAIy3E,GAAI74E,QAItBg3E,EAAWrsF,UAAUqpF,WAAa,SAAoBptE,EAAG+B,IACvD/B,EAAI,IAAIrM,EAAGqM,EAAG,KACP/L,MACL+L,EAAIA,EAAEyH,MAAM3jB,KAAKmQ,MAEnB,IAAIu6E,EAAKxuE,EAAEyI,SAASH,OAAOtI,GAAGiI,QAAQjI,EAAEsI,OAAOxkB,KAAK4S,IAAIuR,QAAQnkB,KAAK6S,GACjEsJ,EAAIuuE,EAAG5lE,UACX,GAA6C,IAAzC3I,EAAEwI,SAASP,OAAOsmE,GAAIx5E,IAAIlR,KAAK4mF,MACjC,MAAM,IAAI3nF,MAAM,iBAIlB,IAAIojB,EAAQlG,EAAE4H,UAAU1B,QAIxB,OAHIpE,IAAQoE,IAAUpE,GAAOoE,KAC3BlG,EAAIA,EAAE8I,UAEDjlB,KAAKynF,MAAMvrE,EAAGC,IAGvBmwE,EAAWrsF,UAAUynF,SAAW,SAAkBD,GAChD,GAAIA,EAAMsF,IACR,OAAO,EAET,IAAI7wE,EAAIurE,EAAMvrE,EACVC,EAAIsrE,EAAMtrE,EAEViyE,EAAKpuF,KAAK4S,EAAE4R,OAAOtI,GACnBsuE,EAAMtuE,EAAEyI,SAASH,OAAOtI,GAAGiI,QAAQiqE,GAAIjqE,QAAQnkB,KAAK6S,GACxD,OAA2C,IAApCsJ,EAAEwI,SAASN,QAAQmmE,GAAK5nE,KAAK,IAGtC0pE,EAAWrsF,UAAUouF,gBACjB,SAAyBhG,EAAQQ,EAAQC,GAGvC,IAFA,IAAIwF,EAAUtuF,KAAK4sF,YACf2B,EAAUvuF,KAAK6sF,YACVxhF,EAAI,EAAGA,EAAIg9E,EAAO/mF,OAAQ+J,IAAK,CACtC,IAAIiC,EAAQtN,KAAK6tF,WAAWhF,EAAOx9E,IAC/BmE,EAAI64E,EAAOh9E,GACXs+E,EAAOn6E,EAAEo6E,WAETt8E,EAAM4gE,GAAGj+D,WACX3C,EAAM4gE,GAAG94D,OACT5F,EAAIA,EAAE8F,KAAI,IAERhI,EAAM6gE,GAAGl+D,WACX3C,EAAM6gE,GAAG/4D,OACTu0E,EAAOA,EAAKr0E,KAAI,IAGlBg5E,EAAY,EAAJjjF,GAASmE,EACjB8+E,EAAY,EAAJjjF,EAAQ,GAAKs+E,EACrB4E,EAAY,EAAJljF,GAASiC,EAAM4gE,GACvBqgB,EAAY,EAAJljF,EAAQ,GAAKiC,EAAM6gE,GAK7B,IAHA,IAAI3rE,EAAMxC,KAAK2oF,YAAY,EAAG2F,EAASC,EAAa,EAAJljF,EAAOy9E,GAG9Cx9E,EAAI,EAAGA,EAAQ,EAAJD,EAAOC,IACzBgjF,EAAQhjF,GAAK,KACbijF,EAAQjjF,GAAK,KAEf,OAAO9I,GAwBb5C,EAASwqF,EAAOjqF,EAAKonF,WAErB+E,EAAWrsF,UAAUwnF,MAAQ,SAAevrE,EAAGC,EAAG2wE,GAChD,OAAO,IAAI1C,EAAMpqF,KAAMkc,EAAGC,EAAG2wE,IAG/BR,EAAWrsF,UAAU4mF,cAAgB,SAAuB3iF,EAAKiM,GAC/D,OAAOi6E,EAAMU,SAAS9qF,KAAMkE,EAAKiM,IAGnCi6E,EAAMnqF,UAAU2pF,SAAW,WACzB,GAAK5pF,KAAKolD,MAAMsnC,KAAhB,CAGA,IAAI8B,EAAMxuF,KAAKwnF,YACf,GAAIgH,GAAOA,EAAI7E,KACb,OAAO6E,EAAI7E,KAEb,IAAIA,EAAO3pF,KAAKolD,MAAMqiC,MAAMznF,KAAKkc,EAAEsI,OAAOxkB,KAAKolD,MAAMsnC,KAAK/C,MAAO3pF,KAAKmc,GACtE,GAAIqyE,EAAK,CACP,IAAIppC,EAAQplD,KAAKolD,MACbqpC,EAAU,SAASj/E,GACrB,OAAO41C,EAAMqiC,MAAMj4E,EAAE0M,EAAEsI,OAAO4gC,EAAMsnC,KAAK/C,MAAOn6E,EAAE2M,IAEpDqyE,EAAI7E,KAAOA,EACXA,EAAKnC,YAAc,CACjBmC,KAAM,KACN7B,IAAK0G,EAAI1G,KAAO,CACd7gE,IAAKunE,EAAI1G,IAAI7gE,IACbohE,OAAQmG,EAAI1G,IAAIO,OAAOzmF,IAAI6sF,IAE7B7G,QAAS4G,EAAI5G,SAAW,CACtBI,KAAMwG,EAAI5G,QAAQI,KAClBK,OAAQmG,EAAI5G,QAAQS,OAAOzmF,IAAI6sF,KAIrC,OAAO9E,IAGTS,EAAMnqF,UAAU2T,OAAS,WACvB,OAAK5T,KAAKwnF,YAGH,CAAExnF,KAAKkc,EAAGlc,KAAKmc,EAAGnc,KAAKwnF,aAAe,CAC3CI,QAAS5nF,KAAKwnF,YAAYI,SAAW,CACnCI,KAAMhoF,KAAKwnF,YAAYI,QAAQI,KAC/BK,OAAQroF,KAAKwnF,YAAYI,QAAQS,OAAOzlF,MAAM,IAEhDklF,IAAK9nF,KAAKwnF,YAAYM,KAAO,CAC3B7gE,IAAKjnB,KAAKwnF,YAAYM,IAAI7gE,IAC1BohE,OAAQroF,KAAKwnF,YAAYM,IAAIO,OAAOzlF,MAAM,MATrC,CAAE5C,KAAKkc,EAAGlc,KAAKmc,IAc1BiuE,EAAMU,SAAW,SAAkB1lC,EAAOlhD,EAAKiM,GAC1B,iBAARjM,IACTA,EAAM0E,KAAK41B,MAAMt6B,IACnB,IAAI1B,EAAM4iD,EAAMqiC,MAAMvjF,EAAI,GAAIA,EAAI,GAAIiM,GACtC,IAAKjM,EAAI,GACP,OAAO1B,EAET,SAASksF,EAAUxqF,GACjB,OAAOkhD,EAAMqiC,MAAMvjF,EAAI,GAAIA,EAAI,GAAIiM,GAGrC,IAAIq+E,EAAMtqF,EAAI,GAYd,OAXA1B,EAAIglF,YAAc,CAChBmC,KAAM,KACN/B,QAAS4G,EAAI5G,SAAW,CACtBI,KAAMwG,EAAI5G,QAAQI,KAClBK,OAAQ,CAAE7lF,GAAMe,OAAOirF,EAAI5G,QAAQS,OAAOzmF,IAAI8sF,KAEhD5G,IAAK0G,EAAI1G,KAAO,CACd7gE,IAAKunE,EAAI1G,IAAI7gE,IACbohE,OAAQ,CAAE7lF,GAAMe,OAAOirF,EAAI1G,IAAIO,OAAOzmF,IAAI8sF,MAGvClsF,GAGT4nF,EAAMnqF,UAAUqS,QAAU,WACxB,OAAItS,KAAK4qF,aACA,sBACF,gBAAkB5qF,KAAKkc,EAAE6H,UAAU9X,SAAS,GAAI,GACnD,OAASjM,KAAKmc,EAAE4H,UAAU9X,SAAS,GAAI,GAAK,KAGlDm+E,EAAMnqF,UAAU2qF,WAAa,WAC3B,OAAO5qF,KAAK+sF,KAGd3C,EAAMnqF,UAAUyW,IAAM,SAAalH,GAEjC,GAAIxP,KAAK+sF,IACP,OAAOv9E,EAGT,GAAIA,EAAEu9E,IACJ,OAAO/sF,KAGT,GAAIA,KAAKyjB,GAAGjU,GACV,OAAOxP,KAAK8pF,MAGd,GAAI9pF,KAAKsV,MAAMmO,GAAGjU,GAChB,OAAOxP,KAAKolD,MAAMqiC,MAAM,KAAM,MAGhC,GAAwB,IAApBznF,KAAKkc,EAAEhL,IAAI1B,EAAE0M,GACf,OAAOlc,KAAKolD,MAAMqiC,MAAM,KAAM,MAEhC,IAAIj3E,EAAIxQ,KAAKmc,EAAEiI,OAAO5U,EAAE2M,GACN,IAAd3L,EAAEoS,KAAK,KACTpS,EAAIA,EAAEgU,OAAOxkB,KAAKkc,EAAEkI,OAAO5U,EAAE0M,GAAG8I,YAClC,IAAIgmE,EAAKx6E,EAAEmU,SAASN,QAAQrkB,KAAKkc,GAAGmI,QAAQ7U,EAAE0M,GAC1C+uE,EAAKz6E,EAAEgU,OAAOxkB,KAAKkc,EAAEkI,OAAO4mE,IAAK3mE,QAAQrkB,KAAKmc,GAClD,OAAOnc,KAAKolD,MAAMqiC,MAAMuD,EAAIC,IAG9Bb,EAAMnqF,UAAU6pF,IAAM,WACpB,GAAI9pF,KAAK+sF,IACP,OAAO/sF,KAGT,IAAI2uF,EAAM3uF,KAAKmc,EAAE+H,OAAOlkB,KAAKmc,GAC7B,GAAoB,IAAhBwyE,EAAI/rE,KAAK,GACX,OAAO5iB,KAAKolD,MAAMqiC,MAAM,KAAM,MAEhC,IAAI70E,EAAI5S,KAAKolD,MAAMxyC,EAEf8P,EAAK1iB,KAAKkc,EAAEyI,SACZiqE,EAAQD,EAAI3pE,UACZxU,EAAIkS,EAAGwB,OAAOxB,GAAIyB,QAAQzB,GAAIyB,QAAQvR,GAAG4R,OAAOoqE,GAEhD5D,EAAKx6E,EAAEmU,SAASN,QAAQrkB,KAAKkc,EAAEgI,OAAOlkB,KAAKkc,IAC3C+uE,EAAKz6E,EAAEgU,OAAOxkB,KAAKkc,EAAEkI,OAAO4mE,IAAK3mE,QAAQrkB,KAAKmc,GAClD,OAAOnc,KAAKolD,MAAMqiC,MAAMuD,EAAIC,IAG9Bb,EAAMnqF,UAAUgiE,KAAO,WACrB,OAAOjiE,KAAKkc,EAAE6H,WAGhBqmE,EAAMnqF,UAAUupF,KAAO,WACrB,OAAOxpF,KAAKmc,EAAE4H,WAGhBqmE,EAAMnqF,UAAU4Q,IAAM,SAAamC,GAEjC,OADAA,EAAI,IAAInD,EAAGmD,EAAG,IACVhT,KAAK4qF,aACA5qF,KACAA,KAAK6pF,YAAY72E,GACjBhT,KAAKolD,MAAMuiC,aAAa3nF,KAAMgT,GAC9BhT,KAAKolD,MAAMsnC,KACX1sF,KAAKolD,MAAMipC,gBAAgB,CAAEruF,MAAQ,CAAEgT,IAEvChT,KAAKolD,MAAMmjC,SAASvoF,KAAMgT,IAGrCo3E,EAAMnqF,UAAUsrF,OAAS,SAAgBrd,EAAI+f,EAAI9f,GAC/C,IAAIka,EAAS,CAAEroF,KAAMiuF,GACjBpF,EAAS,CAAE3a,EAAIC,GACnB,OAAInuE,KAAKolD,MAAMsnC,KACN1sF,KAAKolD,MAAMipC,gBAAgBhG,EAAQQ,GAEnC7oF,KAAKolD,MAAMujC,YAAY,EAAGN,EAAQQ,EAAQ,IAGrDuB,EAAMnqF,UAAUurF,QAAU,SAAiBtd,EAAI+f,EAAI9f,GACjD,IAAIka,EAAS,CAAEroF,KAAMiuF,GACjBpF,EAAS,CAAE3a,EAAIC,GACnB,OAAInuE,KAAKolD,MAAMsnC,KACN1sF,KAAKolD,MAAMipC,gBAAgBhG,EAAQQ,GAAQ,GAE3C7oF,KAAKolD,MAAMujC,YAAY,EAAGN,EAAQQ,EAAQ,GAAG,IAGxDuB,EAAMnqF,UAAUwjB,GAAK,SAAYjU,GAC/B,OAAOxP,OAASwP,GACTxP,KAAK+sF,MAAQv9E,EAAEu9E,MACV/sF,KAAK+sF,KAA2B,IAApB/sF,KAAKkc,EAAEhL,IAAI1B,EAAE0M,IAAgC,IAApBlc,KAAKmc,EAAEjL,IAAI1B,EAAE2M,KAGhEiuE,EAAMnqF,UAAUqV,IAAM,SAAau5E,GACjC,GAAI7uF,KAAK+sF,IACP,OAAO/sF,KAET,IAAIwC,EAAMxC,KAAKolD,MAAMqiC,MAAMznF,KAAKkc,EAAGlc,KAAKmc,EAAE8I,UAC1C,GAAI4pE,GAAe7uF,KAAKwnF,YAAa,CACnC,IAAIgH,EAAMxuF,KAAKwnF,YACXsH,EAAS,SAASt/E,GACpB,OAAOA,EAAE8F,OAEX9S,EAAIglF,YAAc,CAChBM,IAAK0G,EAAI1G,KAAO,CACd7gE,IAAKunE,EAAI1G,IAAI7gE,IACbohE,OAAQmG,EAAI1G,IAAIO,OAAOzmF,IAAIktF,IAE7BlH,QAAS4G,EAAI5G,SAAW,CACtBI,KAAMwG,EAAI5G,QAAQI,KAClBK,OAAQmG,EAAI5G,QAAQS,OAAOzmF,IAAIktF,KAIrC,OAAOtsF,GAGT4nF,EAAMnqF,UAAUgpF,IAAM,WACpB,OAAIjpF,KAAK+sF,IACA/sF,KAAKolD,MAAM+iC,OAAO,KAAM,KAAM,MAE7BnoF,KAAKolD,MAAM+iC,OAAOnoF,KAAKkc,EAAGlc,KAAKmc,EAAGnc,KAAKolD,MAAMx+B,MAwBzDhnB,EAASotF,EAAQ7sF,EAAKonF,WAEtB+E,EAAWrsF,UAAUkoF,OAAS,SAAgBjsE,EAAGC,EAAG4K,GAClD,OAAO,IAAIimE,EAAOhtF,KAAMkc,EAAGC,EAAG4K,IAGhCimE,EAAO/sF,UAAUqoF,IAAM,WACrB,GAAItoF,KAAK4qF,aACP,OAAO5qF,KAAKolD,MAAMqiC,MAAM,KAAM,MAEhC,IAAIsH,EAAO/uF,KAAK+mB,EAAE/B,UACdgqE,EAAQD,EAAKpqE,SACbypE,EAAKpuF,KAAKkc,EAAEsI,OAAOwqE,GACnBC,EAAKjvF,KAAKmc,EAAEqI,OAAOwqE,GAAOxqE,OAAOuqE,GAErC,OAAO/uF,KAAKolD,MAAMqiC,MAAM2G,EAAIa,IAG9BjC,EAAO/sF,UAAUqV,IAAM,WACrB,OAAOtV,KAAKolD,MAAM+iC,OAAOnoF,KAAKkc,EAAGlc,KAAKmc,EAAE8I,SAAUjlB,KAAK+mB,IAGzDimE,EAAO/sF,UAAUyW,IAAM,SAAalH,GAElC,GAAIxP,KAAK4qF,aACP,OAAOp7E,EAGT,GAAIA,EAAEo7E,aACJ,OAAO5qF,KAGT,IAAIkvF,EAAM1/E,EAAEuX,EAAEpC,SACVwqE,EAAKnvF,KAAK+mB,EAAEpC,SACZyqE,EAAKpvF,KAAKkc,EAAEsI,OAAO0qE,GACnBG,EAAK7/E,EAAE0M,EAAEsI,OAAO2qE,GAChBp1C,EAAK/5C,KAAKmc,EAAEqI,OAAO0qE,EAAI1qE,OAAOhV,EAAEuX,IAChCizB,EAAKxqC,EAAE2M,EAAEqI,OAAO2qE,EAAG3qE,OAAOxkB,KAAK+mB,IAE/BnH,EAAIwvE,EAAGhrE,OAAOirE,GACd1+E,EAAIopC,EAAG31B,OAAO41B,GAClB,GAAkB,IAAdp6B,EAAEgD,KAAK,GACT,OAAkB,IAAdjS,EAAEiS,KAAK,GACF5iB,KAAKolD,MAAM+iC,OAAO,KAAM,KAAM,MAE9BnoF,KAAK8pF,MAGhB,IAAIwF,EAAK1vE,EAAE+E,SACP4qE,EAAKD,EAAG9qE,OAAO5E,GACfm5B,EAAIq2C,EAAG5qE,OAAO8qE,GAEdtE,EAAKr6E,EAAEgU,SAASR,QAAQorE,GAAIlrE,QAAQ00B,GAAG10B,QAAQ00B,GAC/CkyC,EAAKt6E,EAAE6T,OAAOu0B,EAAE10B,QAAQ2mE,IAAK3mE,QAAQ01B,EAAGv1B,OAAO+qE,IAC/CpE,EAAKnrF,KAAK+mB,EAAEvC,OAAOhV,EAAEuX,GAAGvC,OAAO5E,GAEnC,OAAO5f,KAAKolD,MAAM+iC,OAAO6C,EAAIC,EAAIE,IAGnC6B,EAAO/sF,UAAUmoF,SAAW,SAAkB54E,GAE5C,GAAIxP,KAAK4qF,aACP,OAAOp7E,EAAEy5E,MAGX,GAAIz5E,EAAEo7E,aACJ,OAAO5qF,KAGT,IAAImvF,EAAKnvF,KAAK+mB,EAAEpC,SACZyqE,EAAKpvF,KAAKkc,EACVmzE,EAAK7/E,EAAE0M,EAAEsI,OAAO2qE,GAChBp1C,EAAK/5C,KAAKmc,EACV69B,EAAKxqC,EAAE2M,EAAEqI,OAAO2qE,GAAI3qE,OAAOxkB,KAAK+mB,GAEhCnH,EAAIwvE,EAAGhrE,OAAOirE,GACd1+E,EAAIopC,EAAG31B,OAAO41B,GAClB,GAAkB,IAAdp6B,EAAEgD,KAAK,GACT,OAAkB,IAAdjS,EAAEiS,KAAK,GACF5iB,KAAKolD,MAAM+iC,OAAO,KAAM,KAAM,MAE9BnoF,KAAK8pF,MAGhB,IAAIwF,EAAK1vE,EAAE+E,SACP4qE,EAAKD,EAAG9qE,OAAO5E,GACfm5B,EAAIq2C,EAAG5qE,OAAO8qE,GAEdtE,EAAKr6E,EAAEgU,SAASR,QAAQorE,GAAIlrE,QAAQ00B,GAAG10B,QAAQ00B,GAC/CkyC,EAAKt6E,EAAE6T,OAAOu0B,EAAE10B,QAAQ2mE,IAAK3mE,QAAQ01B,EAAGv1B,OAAO+qE,IAC/CpE,EAAKnrF,KAAK+mB,EAAEvC,OAAO5E,GAEvB,OAAO5f,KAAKolD,MAAM+iC,OAAO6C,EAAIC,EAAIE,IAGnC6B,EAAO/sF,UAAUyoF,KAAO,SAAcx2E,GACpC,GAAY,IAARA,EACF,OAAOlS,KACT,GAAIA,KAAK4qF,aACP,OAAO5qF,KACT,IAAKkS,EACH,OAAOlS,KAAK8pF,MAEd,IAAIz+E,EACJ,GAAIrL,KAAKolD,MAAMonC,OAASxsF,KAAKolD,MAAMqnC,OAAQ,CACzC,IAAI97E,EAAI3Q,KACR,IAAKqL,EAAI,EAAGA,EAAI6G,EAAK7G,IACnBsF,EAAIA,EAAEm5E,MACR,OAAOn5E,EAKT,IAAIiC,EAAI5S,KAAKolD,MAAMxyC,EACf25E,EAAOvsF,KAAKolD,MAAMmnC,KAElBiD,EAAKxvF,KAAKkc,EACVuzE,EAAKzvF,KAAKmc,EACVuzE,EAAK1vF,KAAK+mB,EACV4oE,EAAMD,EAAG/qE,SAASA,SAGlBirE,EAAMH,EAAGvrE,OAAOurE,GACpB,IAAKpkF,EAAI,EAAGA,EAAI6G,EAAK7G,IAAK,CACxB,IAAIwkF,EAAML,EAAG7qE,SACTmrE,EAAOF,EAAIjrE,SACXorE,EAAOD,EAAKnrE,SACZnU,EAAIq/E,EAAI3rE,OAAO2rE,GAAK1rE,QAAQ0rE,GAAK1rE,QAAQvR,EAAE4R,OAAOmrE,IAElDp2C,EAAKi2C,EAAGhrE,OAAOsrE,GACf9E,EAAKx6E,EAAEmU,SAASN,QAAQk1B,EAAGr1B,OAAOq1B,IAClCC,EAAKD,EAAGl1B,QAAQ2mE,GAChBgF,EAAMx/E,EAAEgU,OAAOg1B,GACnBw2C,EAAMA,EAAI7rE,QAAQ6rE,GAAK3rE,QAAQ0rE,GAC/B,IAAI5E,EAAKyE,EAAIprE,OAAOkrE,GAChBrkF,EAAI,EAAI6G,IACVy9E,EAAMA,EAAInrE,OAAOurE,IAEnBP,EAAKxE,EACL0E,EAAKvE,EACLyE,EAAMI,EAGR,OAAOhwF,KAAKolD,MAAM+iC,OAAOqH,EAAII,EAAIprE,OAAO+nE,GAAOmD,IAGjD1C,EAAO/sF,UAAU6pF,IAAM,WACrB,OAAI9pF,KAAK4qF,aACA5qF,KAELA,KAAKolD,MAAMonC,MACNxsF,KAAKiwF,WACLjwF,KAAKolD,MAAMqnC,OACXzsF,KAAKkwF,YAELlwF,KAAKmwF,QAGhBnD,EAAO/sF,UAAUgwF,SAAW,WAC1B,IAAIjF,EACAC,EACAE,EAEJ,GAAInrF,KAAKqqF,KAAM,CAMb,IAAI+F,EAAKpwF,KAAKkc,EAAEyI,SAEZ0rE,EAAKrwF,KAAKmc,EAAEwI,SAEZ2rE,EAAOD,EAAG1rE,SAEVxH,EAAInd,KAAKkc,EAAEgI,OAAOmsE,GAAI1rE,SAASN,QAAQ+rE,GAAI/rE,QAAQisE,GACvDnzE,EAAIA,EAAEgH,QAAQhH,GAEd,IAAIpe,EAAIqxF,EAAGlsE,OAAOksE,GAAIjsE,QAAQisE,GAE1B77E,EAAIxV,EAAE4lB,SAASN,QAAQlH,GAAGkH,QAAQlH,GAGlCozE,EAAQD,EAAKnsE,QAAQmsE,GAEzBC,GADAA,EAAQA,EAAMpsE,QAAQosE,IACRpsE,QAAQosE,GAGtBvF,EAAKz2E,EAEL02E,EAAKlsF,EAAEylB,OAAOrH,EAAEkH,QAAQ9P,IAAI8P,QAAQksE,GAEpCpF,EAAKnrF,KAAKmc,EAAE+H,OAAOlkB,KAAKmc,OACnB,CAML,IAAIvJ,EAAI5S,KAAKkc,EAAEyI,SAEX9R,EAAI7S,KAAKmc,EAAEwI,SAEXnU,EAAIqC,EAAE8R,SAEN2X,EAAIt8B,KAAKkc,EAAEgI,OAAOrR,GAAG8R,SAASN,QAAQzR,GAAGyR,QAAQ7T,GACrD8rB,EAAIA,EAAEnY,QAAQmY,GAEd,IAAI51B,EAAIkM,EAAEsR,OAAOtR,GAAGuR,QAAQvR,GAExB+iB,EAAIjvB,EAAEie,SAGN6rE,EAAKhgF,EAAE2T,QAAQ3T,GAEnBggF,GADAA,EAAKA,EAAGrsE,QAAQqsE,IACRrsE,QAAQqsE,GAGhBxF,EAAKr1D,EAAEtR,QAAQiY,GAAGjY,QAAQiY,GAE1B2uD,EAAKvkF,EAAE8d,OAAO8X,EAAEjY,QAAQ2mE,IAAK3mE,QAAQmsE,GAGrCrF,GADAA,EAAKnrF,KAAKmc,EAAEqI,OAAOxkB,KAAK+mB,IAChB5C,QAAQgnE,GAGlB,OAAOnrF,KAAKolD,MAAM+iC,OAAO6C,EAAIC,EAAIE,IAGnC6B,EAAO/sF,UAAUiwF,UAAY,WAC3B,IAAIlF,EACAC,EACAE,EAEJ,GAAInrF,KAAKqqF,KAAM,CAMb,IAAI+F,EAAKpwF,KAAKkc,EAAEyI,SAEZ0rE,EAAKrwF,KAAKmc,EAAEwI,SAEZ2rE,EAAOD,EAAG1rE,SAEVxH,EAAInd,KAAKkc,EAAEgI,OAAOmsE,GAAI1rE,SAASN,QAAQ+rE,GAAI/rE,QAAQisE,GACvDnzE,EAAIA,EAAEgH,QAAQhH,GAEd,IAAIpe,EAAIqxF,EAAGlsE,OAAOksE,GAAIjsE,QAAQisE,GAAIjsE,QAAQnkB,KAAKolD,MAAMxyC,GAEjD2B,EAAIxV,EAAE4lB,SAASN,QAAQlH,GAAGkH,QAAQlH,GAEtC6tE,EAAKz2E,EAEL,IAAIg8E,EAAQD,EAAKnsE,QAAQmsE,GAEzBC,GADAA,EAAQA,EAAMpsE,QAAQosE,IACRpsE,QAAQosE,GACtBtF,EAAKlsF,EAAEylB,OAAOrH,EAAEkH,QAAQ9P,IAAI8P,QAAQksE,GAEpCpF,EAAKnrF,KAAKmc,EAAE+H,OAAOlkB,KAAKmc,OACnB,CAKL,IAAIwG,EAAQ3iB,KAAK+mB,EAAEpC,SAEf8rE,EAAQzwF,KAAKmc,EAAEwI,SAEfglE,EAAO3pF,KAAKkc,EAAEsI,OAAOisE,GAErBC,EAAQ1wF,KAAKkc,EAAEkI,OAAOzB,GAAO6B,OAAOxkB,KAAKkc,EAAEgI,OAAOvB,IACtD+tE,EAAQA,EAAMxsE,OAAOwsE,GAAOvsE,QAAQusE,GAEpC,IAAIC,EAAQhH,EAAKxlE,QAAQwlE,GAErBiH,GADJD,EAAQA,EAAMxsE,QAAQwsE,IACJzsE,OAAOysE,GACzB3F,EAAK0F,EAAM/rE,SAASN,QAAQusE,GAE5BzF,EAAKnrF,KAAKmc,EAAE+H,OAAOlkB,KAAK+mB,GAAGpC,SAASN,QAAQosE,GAAOpsE,QAAQ1B,GAE3D,IAAIkuE,EAAUJ,EAAM9rE,SAGpBksE,GADAA,GADAA,EAAUA,EAAQ1sE,QAAQ0sE,IACR1sE,QAAQ0sE,IACR1sE,QAAQ0sE,GAC1B5F,EAAKyF,EAAMlsE,OAAOmsE,EAAMtsE,QAAQ2mE,IAAK3mE,QAAQwsE,GAG/C,OAAO7wF,KAAKolD,MAAM+iC,OAAO6C,EAAIC,EAAIE,IAGnC6B,EAAO/sF,UAAUkwF,KAAO,WACtB,IAAIv9E,EAAI5S,KAAKolD,MAAMxyC,EAGf48E,EAAKxvF,KAAKkc,EACVuzE,EAAKzvF,KAAKmc,EACVuzE,EAAK1vF,KAAK+mB,EACV4oE,EAAMD,EAAG/qE,SAASA,SAElBkrE,EAAML,EAAG7qE,SACTmsE,EAAMrB,EAAG9qE,SAETnU,EAAIq/E,EAAI3rE,OAAO2rE,GAAK1rE,QAAQ0rE,GAAK1rE,QAAQvR,EAAE4R,OAAOmrE,IAElDoB,EAAOvB,EAAGtrE,OAAOsrE,GAEjBj2C,GADJw3C,EAAOA,EAAK5sE,QAAQ4sE,IACNvsE,OAAOssE,GACjB9F,EAAKx6E,EAAEmU,SAASN,QAAQk1B,EAAGr1B,OAAOq1B,IAClCC,EAAKD,EAAGl1B,QAAQ2mE,GAEhBgG,EAAOF,EAAInsE,SAGfqsE,GADAA,GADAA,EAAOA,EAAK7sE,QAAQ6sE,IACR7sE,QAAQ6sE,IACR7sE,QAAQ6sE,GACpB,IAAI/F,EAAKz6E,EAAEgU,OAAOg1B,GAAIn1B,QAAQ2sE,GAC1B7F,EAAKsE,EAAGvrE,OAAOurE,GAAIjrE,OAAOkrE,GAE9B,OAAO1vF,KAAKolD,MAAM+iC,OAAO6C,EAAIC,EAAIE,IAGnC6B,EAAO/sF,UAAUgxF,KAAO,WACtB,IAAKjxF,KAAKolD,MAAMonC,MACd,OAAOxsF,KAAK8pF,MAAMpzE,IAAI1W,MAMxB,IAAIowF,EAAKpwF,KAAKkc,EAAEyI,SAEZ0rE,EAAKrwF,KAAKmc,EAAEwI,SAEZusE,EAAKlxF,KAAK+mB,EAAEpC,SAEZ2rE,EAAOD,EAAG1rE,SAEV5lB,EAAIqxF,EAAGlsE,OAAOksE,GAAIjsE,QAAQisE,GAE1Be,EAAKpyF,EAAE4lB,SAEPje,EAAI1G,KAAKkc,EAAEgI,OAAOmsE,GAAI1rE,SAASN,QAAQ+rE,GAAI/rE,QAAQisE,GAKnDc,GAFJ1qF,GADAA,GADAA,EAAIA,EAAEyd,QAAQzd,IACRwd,OAAOxd,GAAGyd,QAAQzd,IAClB2d,QAAQ8sE,IAEHxsE,SAEPpQ,EAAI+7E,EAAKnsE,QAAQmsE,GAGrB/7E,GADAA,GADAA,EAAIA,EAAE4P,QAAQ5P,IACR4P,QAAQ5P,IACR4P,QAAQ5P,GAEd,IAAI8S,EAAItoB,EAAEolB,QAAQzd,GAAGie,SAASN,QAAQ8sE,GAAI9sE,QAAQ+sE,GAAI/sE,QAAQ9P,GAE1D88E,EAAOhB,EAAG7rE,OAAO6C,GAErBgqE,GADAA,EAAOA,EAAKltE,QAAQktE,IACRltE,QAAQktE,GACpB,IAAIrG,EAAKhrF,KAAKkc,EAAEsI,OAAO4sE,GAAI/sE,QAAQgtE,GAEnCrG,GADAA,EAAKA,EAAG7mE,QAAQ6mE,IACR7mE,QAAQ6mE,GAEhB,IAAIC,EAAKjrF,KAAKmc,EAAEqI,OAAO6C,EAAE7C,OAAOjQ,EAAE8P,QAAQgD,IAAIhD,QAAQ3d,EAAE8d,OAAO4sE,KAG/DnG,GADAA,GADAA,EAAKA,EAAG9mE,QAAQ8mE,IACR9mE,QAAQ8mE,IACR9mE,QAAQ8mE,GAEhB,IAAIE,EAAKnrF,KAAK+mB,EAAE7C,OAAOxd,GAAGie,SAASN,QAAQ6sE,GAAI7sE,QAAQ+sE,GAEvD,OAAOpxF,KAAKolD,MAAM+iC,OAAO6C,EAAIC,EAAIE,IAGnC6B,EAAO/sF,UAAU4Q,IAAM,SAAamC,EAAGs+E,GAGrC,OAFAt+E,EAAI,IAAInD,EAAGmD,EAAGs+E,GAEPtxF,KAAKolD,MAAMmjC,SAASvoF,KAAMgT,IAGnCg6E,EAAO/sF,UAAUwjB,GAAK,SAAYjU,GAChC,GAAe,WAAXA,EAAExH,KACJ,OAAOhI,KAAKyjB,GAAGjU,EAAEy5E,OAEnB,GAAIjpF,OAASwP,EACX,OAAO,EAGT,IAAI2/E,EAAKnvF,KAAK+mB,EAAEpC,SACZuqE,EAAM1/E,EAAEuX,EAAEpC,SACd,GAA2D,IAAvD3kB,KAAKkc,EAAEsI,OAAO0qE,GAAK7qE,QAAQ7U,EAAE0M,EAAEsI,OAAO2qE,IAAKvsE,KAAK,GAClD,OAAO,EAGT,IAAI2uE,EAAKpC,EAAG3qE,OAAOxkB,KAAK+mB,GACpByqE,EAAMtC,EAAI1qE,OAAOhV,EAAEuX,GACvB,OAA8D,IAAvD/mB,KAAKmc,EAAEqI,OAAOgtE,GAAKntE,QAAQ7U,EAAE2M,EAAEqI,OAAO+sE,IAAK3uE,KAAK,IAGzDoqE,EAAO/sF,UAAUyrF,OAAS,SAAgBxvE,GACxC,IAAIu1E,EAAKzxF,KAAK+mB,EAAEpC,SACZ7G,EAAK5B,EAAEyH,MAAM3jB,KAAKolD,MAAMj1C,KAAKqU,OAAOitE,GACxC,GAAuB,IAAnBzxF,KAAKkc,EAAEhL,IAAI4M,GACb,OAAO,EAIT,IAFA,IAAI6tE,EAAKzvE,EAAEvX,QACP4P,EAAIvU,KAAKolD,MAAMiiC,KAAK7iE,OAAOitE,KACtB,CAEP,GADA9F,EAAGn1E,KAAKxW,KAAKolD,MAAMpnC,GACf2tE,EAAGz6E,IAAIlR,KAAKolD,MAAM51C,IAAM,EAC1B,OAAO,EAGT,GADAsO,EAAGqG,QAAQ5P,GACY,IAAnBvU,KAAKkc,EAAEhL,IAAI4M,GACb,OAAO,IAIbkvE,EAAO/sF,UAAUqS,QAAU,WACzB,OAAItS,KAAK4qF,aACA,uBACF,iBAAmB5qF,KAAKkc,EAAEjQ,SAAS,GAAI,GAC1C,OAASjM,KAAKmc,EAAElQ,SAAS,GAAI,GAC7B,OAASjM,KAAK+mB,EAAE9a,SAAS,GAAI,GAAK,KAGxC+gF,EAAO/sF,UAAU2qF,WAAa,WAE5B,OAA0B,IAAnB5qF,KAAK+mB,EAAEnE,KAAK,iCCt6BrB,IAsKI4rE,EAtKAlqC,EAAS5lD,EAETglD,EAAO,EAAQ,MACf0B,EAAQ,EAAQ,MAGhBhiD,EAFQ,EAAQ,KAEDA,OAEnB,SAASsuF,EAAY7wF,GACE,UAAjBA,EAAQmH,KACVhI,KAAKolD,MAAQ,IAAIA,EAAMwmC,MAAM/qF,GACL,YAAjBA,EAAQmH,KACfhI,KAAKolD,MAAQ,IAAIA,EAAMymC,QAAQhrF,GAE/Bb,KAAKolD,MAAQ,IAAIA,EAAMh+B,KAAKvmB,GAC9Bb,KAAKgiB,EAAIhiB,KAAKolD,MAAMpjC,EACpBhiB,KAAKge,EAAIhe,KAAKolD,MAAMpnC,EACpBhe,KAAK0jD,KAAO7iD,EAAQ6iD,KAEpBtgD,EAAOpD,KAAKgiB,EAAE0lE,WAAY,iBAC1BtkF,EAAOpD,KAAKgiB,EAAEnR,IAAI7Q,KAAKge,GAAG4sE,aAAc,2BAI1C,SAAS+G,EAAY7xF,EAAMe,GACzB2E,OAAO8nB,eAAeg3B,EAAQxkD,EAAM,CAClC0tB,cAAc,EACdD,YAAY,EACZnuB,IAAK,WACH,IAAIgmD,EAAQ,IAAIssC,EAAY7wF,GAM5B,OALA2E,OAAO8nB,eAAeg3B,EAAQxkD,EAAM,CAClC0tB,cAAc,EACdD,YAAY,EACZ9rB,MAAO2jD,IAEFA,KAbbd,EAAOotC,YAAcA,EAkBrBC,EAAY,OAAQ,CAClB3pF,KAAM,QACN8d,MAAO,OACPtW,EAAG,wDACHoD,EAAG,wDACHC,EAAG,wDACHmL,EAAG,wDACH0lC,KAAMA,EAAKkuC,OACX9K,MAAM,EACN9kE,EAAG,CACD,wDACA,2DAIJ2vE,EAAY,OAAQ,CAClB3pF,KAAM,QACN8d,MAAO,OACPtW,EAAG,iEACHoD,EAAG,iEACHC,EAAG,iEACHmL,EAAG,iEACH0lC,KAAMA,EAAKkuC,OACX9K,MAAM,EACN9kE,EAAG,CACD,iEACA,oEAIJ2vE,EAAY,OAAQ,CAClB3pF,KAAM,QACN8d,MAAO,KACPtW,EAAG,0EACHoD,EAAG,0EACHC,EAAG,0EACHmL,EAAG,0EACH0lC,KAAMA,EAAKkuC,OACX9K,MAAM,EACN9kE,EAAG,CACD,0EACA,6EAIJ2vE,EAAY,OAAQ,CAClB3pF,KAAM,QACN8d,MAAO,KACPtW,EAAG,8GAEHoD,EAAG,8GAEHC,EAAG,8GAEHmL,EAAG,8GAEH0lC,KAAMA,EAAKmuC,OACX/K,MAAM,EACN9kE,EAAG,CACD,8GAEA,iHAKJ2vE,EAAY,OAAQ,CAClB3pF,KAAM,QACN8d,MAAO,KACPtW,EAAG,2JAGHoD,EAAG,2JAGHC,EAAG,2JAGHmL,EAAG,2JAGH0lC,KAAMA,EAAKouC,OACXhL,MAAM,EACN9kE,EAAG,CACD,2JAGA,8JAMJ2vE,EAAY,aAAc,CACxB3pF,KAAM,OACN8d,MAAO,SACPtW,EAAG,sEACHoD,EAAG,QACHC,EAAG,IACHmL,EAAG,sEACH0lC,KAAMA,EAAKkuC,OACX9K,MAAM,EACN9kE,EAAG,CACD,OAIJ2vE,EAAY,UAAW,CACrB3pF,KAAM,UACN8d,MAAO,SACPtW,EAAG,sEACHoD,EAAG,KACHpC,EAAG,IAEH8rB,EAAG,sEACHte,EAAG,sEACH0lC,KAAMA,EAAKkuC,OACX9K,MAAM,EACN9kE,EAAG,CACD,mEAGA,sEAKJ,IACEwsE,EAAM,EAAQ,MACd,MAAO9nF,GACP8nF,OAAMpmF,EAGRupF,EAAY,YAAa,CACvB3pF,KAAM,QACN8d,MAAO,OACPtW,EAAG,0EACHoD,EAAG,IACHC,EAAG,IACHmL,EAAG,0EACH4B,EAAG,IACH8jC,KAAMA,EAAKkuC,OAGXjI,KAAM,mEACNsD,OAAQ,mEACRI,MAAO,CACL,CACEz6E,EAAG,mCACHC,EAAG,qCAEL,CACED,EAAG,oCACHC,EAAG,qCAIPi0E,MAAM,EACN9kE,EAAG,CACD,mEACA,mEACAwsE,kCCzMJ,IAAI3+E,EAAK,EAAQ,MACbkiF,EAAW,EAAQ,MACnBhmB,EAAQ,EAAQ,KAChBznB,EAAS,EAAQ,MACjBjM,EAAO,EAAQ,MACfj1C,EAAS2oE,EAAM3oE,OAEf4uF,EAAU,EAAQ,MAClB9O,EAAY,EAAQ,KAExB,SAAS9+B,EAAGvjD,GACV,KAAMb,gBAAgBokD,GACpB,OAAO,IAAIA,EAAGvjD,GAGO,iBAAZA,IACTuC,EAAOoC,OAAOvF,UAAUS,eAAeH,KAAK+jD,EAAQzjD,GAClD,iBAAmBA,GAErBA,EAAUyjD,EAAOzjD,IAIfA,aAAmByjD,EAAOotC,cAC5B7wF,EAAU,CAAEukD,MAAOvkD,IAErBb,KAAKolD,MAAQvkD,EAAQukD,MAAMA,MAC3BplD,KAAKge,EAAIhe,KAAKolD,MAAMpnC,EACpBhe,KAAKiyF,GAAKjyF,KAAKge,EAAEmC,MAAM,GACvBngB,KAAKgiB,EAAIhiB,KAAKolD,MAAMpjC,EAGpBhiB,KAAKgiB,EAAInhB,EAAQukD,MAAMpjC,EACvBhiB,KAAKgiB,EAAEynE,WAAW5oF,EAAQukD,MAAMpnC,EAAEvJ,YAAc,GAGhDzU,KAAK0jD,KAAO7iD,EAAQ6iD,MAAQ7iD,EAAQukD,MAAM1B,KAE5CjlD,EAAOC,QAAU0lD,EAEjBA,EAAGnkD,UAAUiyF,QAAU,SAAiBrxF,GACtC,OAAO,IAAImxF,EAAQhyF,KAAMa,IAG3BujD,EAAGnkD,UAAUqlD,eAAiB,SAAwBrD,EAAMxhD,GAC1D,OAAOuxF,EAAQG,YAAYnyF,KAAMiiD,EAAMxhD,IAGzC2jD,EAAGnkD,UAAU6hE,cAAgB,SAAuBhc,EAAKrlD,GACvD,OAAOuxF,EAAQI,WAAWpyF,KAAM8lD,EAAKrlD,IAGvC2jD,EAAGnkD,UAAU0hE,WAAa,SAAoB9gE,GACvCA,IACHA,EAAU,IAcZ,IAXA,IAAIwxF,EAAO,IAAIN,EAAS,CACtBruC,KAAM1jD,KAAK0jD,KACX4uC,KAAMzxF,EAAQyxF,KACdC,QAAS1xF,EAAQ0xF,SAAW,OAC5BC,QAAS3xF,EAAQ2xF,SAAWn6C,EAAKr4C,KAAK0jD,KAAK+uC,cAC3CC,WAAY7xF,EAAQ2xF,SAAW3xF,EAAQ6xF,YAAc,OACrDC,MAAO3yF,KAAKge,EAAE9O,YAGZxM,EAAQ1C,KAAKge,EAAEjc,aACf6wF,EAAM5yF,KAAKge,EAAErH,IAAI,IAAI9G,EAAG,MACnB,CACP,IAAIoyC,EAAO,IAAIpyC,EAAGwiF,EAAK/5C,SAAS51C,IAChC,KAAIu/C,EAAK/wC,IAAI0hF,GAAO,GAIpB,OADA3wC,EAAKjtC,MAAM,GACJhV,KAAKslD,eAAerD,KAI/BmC,EAAGnkD,UAAU4yF,aAAe,SAAsBppF,EAAKqpF,GACrD,IAAInwE,EAA2B,EAAnBlZ,EAAI1H,aAAmB/B,KAAKge,EAAEvJ,YAG1C,OAFIkO,EAAQ,IACVlZ,EAAMA,EAAI0W,MAAMwC,KACbmwE,GAAarpF,EAAIyH,IAAIlR,KAAKge,IAAM,EAC5BvU,EAAIkN,IAAI3W,KAAKge,GAEbvU,GAGX26C,EAAGnkD,UAAUkP,KAAO,SAAc1F,EAAKpF,EAAK5D,EAAKI,GAC5B,iBAARJ,IACTI,EAAUJ,EACVA,EAAM,MAEHI,IACHA,EAAU,IAEZwD,EAAMrE,KAAKslD,eAAejhD,EAAK5D,GAC/BgJ,EAAMzJ,KAAK6yF,aAAa,IAAIhjF,EAAGpG,EAAK,KAqBpC,IAlBA,IAAI/G,EAAQ1C,KAAKge,EAAEjc,aACfiqD,EAAO3nD,EAAI29D,aAAa9yD,QAAQ,KAAMxM,GAGtCiwF,EAAQlpF,EAAIyF,QAAQ,KAAMxM,GAG1B2vF,EAAO,IAAIN,EAAS,CACtBruC,KAAM1jD,KAAK0jD,KACX8uC,QAASxmC,EACT2mC,MAAOA,EACPL,KAAMzxF,EAAQyxF,KACdC,QAAS1xF,EAAQ0xF,SAAW,SAI1BQ,EAAM/yF,KAAKge,EAAErH,IAAI,IAAI9G,EAAG,IAEnBmjF,EAAO,GAAKA,IAAQ,CAC3B,IAAIhgF,EAAInS,EAAQmS,EACdnS,EAAQmS,EAAEggF,GACV,IAAInjF,EAAGwiF,EAAK/5C,SAASt4C,KAAKge,EAAEjc,eAE9B,MADAiR,EAAIhT,KAAK6yF,aAAa7/E,GAAG,IACnB4P,KAAK,IAAM,GAAK5P,EAAE9B,IAAI6hF,IAAQ,GAApC,CAGA,IAAIE,EAAKjzF,KAAKgiB,EAAEnR,IAAImC,GACpB,IAAIigF,EAAGrI,aAAP,CAGA,IAAIsI,EAAMD,EAAGhxB,OACTtxD,EAAIuiF,EAAI7xE,KAAKrhB,KAAKge,GACtB,GAAkB,IAAdrN,EAAEiS,KAAK,GAAX,CAGA,IAAIzF,EAAInK,EAAE6P,KAAK7iB,KAAKge,GAAGnN,IAAIF,EAAEE,IAAIxM,EAAI29D,cAAcxrD,KAAK/M,IAExD,GAAkB,KADlB0T,EAAIA,EAAEkE,KAAKrhB,KAAKge,IACV4E,KAAK,GAAX,CAGA,IAAIuwE,GAAiBF,EAAGzJ,OAAOnnE,QAAU,EAAI,IACT,IAAf6wE,EAAIhiF,IAAIP,GAAW,EAAI,GAQ5C,OALI9P,EAAQuyF,WAAaj2E,EAAEjM,IAAIlR,KAAKiyF,IAAM,IACxC90E,EAAInd,KAAKge,EAAErH,IAAIwG,GACfg2E,GAAiB,GAGZ,IAAIjQ,EAAU,CAAEvyE,EAAGA,EAAGwM,EAAGA,EAAGg2E,cAAeA,UAItD/uC,EAAGnkD,UAAUmjD,OAAS,SAAgB35C,EAAK28C,EAAW/hD,EAAK5D,GACzDgJ,EAAMzJ,KAAK6yF,aAAa,IAAIhjF,EAAGpG,EAAK,KACpCpF,EAAMrE,KAAK8hE,cAAcz9D,EAAK5D,GAI9B,IAAIkQ,GAHJy1C,EAAY,IAAI88B,EAAU98B,EAAW,QAGnBz1C,EACdwM,EAAIipC,EAAUjpC,EAClB,GAAIxM,EAAEiS,KAAK,GAAK,GAAKjS,EAAEO,IAAIlR,KAAKge,IAAM,EACpC,OAAO,EACT,GAAIb,EAAEyF,KAAK,GAAK,GAAKzF,EAAEjM,IAAIlR,KAAKge,IAAM,EACpC,OAAO,EAGT,IAGIxO,EAHA6jF,EAAOl2E,EAAE0F,KAAK7iB,KAAKge,GACnBoxE,EAAKiE,EAAKxiF,IAAIpH,GAAK4X,KAAKrhB,KAAKge,GAC7BqxE,EAAKgE,EAAKxiF,IAAIF,GAAG0Q,KAAKrhB,KAAKge,GAG/B,OAAKhe,KAAKolD,MAAMkiC,gBAWhB93E,EAAIxP,KAAKgiB,EAAEwpE,QAAQ4D,EAAI/qF,EAAI09D,YAAastB,IAClCzE,cAMCp7E,EAAEk8E,OAAO/6E,KAjBdnB,EAAIxP,KAAKgiB,EAAEupE,OAAO6D,EAAI/qF,EAAI09D,YAAastB,IACjCzE,cAGkC,IAAjCp7E,EAAEyyD,OAAO5gD,KAAKrhB,KAAKge,GAAG9M,IAAIP,IAgBrCyzC,EAAGnkD,UAAUqzF,cAAgB,SAAS7pF,EAAK28C,EAAW96C,EAAG7K,GACvD2C,GAAQ,EAAIkI,KAAOA,EAAG,4CACtB86C,EAAY,IAAI88B,EAAU98B,EAAW3lD,GAErC,IAAIud,EAAIhe,KAAKge,EACTtX,EAAI,IAAImJ,EAAGpG,GACXkH,EAAIy1C,EAAUz1C,EACdwM,EAAIipC,EAAUjpC,EAGdo2E,EAAa,EAAJjoF,EACTkoF,EAAcloF,GAAK,EACvB,GAAIqF,EAAEO,IAAIlR,KAAKolD,MAAM51C,EAAE6R,KAAKrhB,KAAKolD,MAAMpnC,KAAO,GAAKw1E,EACjD,MAAM,IAAIv0F,MAAM,wCAIhB0R,EADE6iF,EACExzF,KAAKolD,MAAMkkC,WAAW34E,EAAE+F,IAAI1W,KAAKolD,MAAMpnC,GAAIu1E,GAE3CvzF,KAAKolD,MAAMkkC,WAAW34E,EAAG4iF,GAE/B,IAAIE,EAAOrtC,EAAUz1C,EAAEkS,KAAK7E,GACxB+7B,EAAK/7B,EAAErH,IAAIjQ,GAAGmK,IAAI4iF,GAAMpyE,KAAKrD,GAC7Bg8B,EAAK78B,EAAEtM,IAAI4iF,GAAMpyE,KAAKrD,GAI1B,OAAOhe,KAAKgiB,EAAEupE,OAAOxxC,EAAIppC,EAAGqpC,IAG9BoK,EAAGnkD,UAAUyzF,oBAAsB,SAAShtF,EAAG0/C,EAAWutC,EAAGlzF,GAE3D,GAAgC,QADhC2lD,EAAY,IAAI88B,EAAU98B,EAAW3lD,IACvB0yF,cACZ,OAAO/sC,EAAU+sC,cAEnB,IAAK,IAAI9nF,EAAI,EAAGA,EAAI,EAAGA,IAAK,CAC1B,IAAIuoF,EACJ,IACEA,EAAS5zF,KAAKszF,cAAc5sF,EAAG0/C,EAAW/6C,GAC1C,MAAO3E,GACP,SAGF,GAAIktF,EAAOnwE,GAAGkwE,GACZ,OAAOtoF,EAEX,MAAM,IAAIpM,MAAM,sEC/OlB,IAAI4Q,EAAK,EAAQ,MAEbzM,EADQ,EAAQ,KACDA,OAEnB,SAAS4uF,EAAQ7wB,EAAItgE,GACnBb,KAAKmhE,GAAKA,EACVnhE,KAAKiiD,KAAO,KACZjiD,KAAK8lD,IAAM,KAGPjlD,EAAQohD,MACVjiD,KAAKuiE,eAAe1hE,EAAQohD,KAAMphD,EAAQgzF,SACxChzF,EAAQilD,KACV9lD,KAAKoiE,cAAcvhE,EAAQilD,IAAKjlD,EAAQizF,QAE5Cr1F,EAAOC,QAAUszF,EAEjBA,EAAQI,WAAa,SAAoBjxB,EAAIrb,EAAKrlD,GAChD,OAAIqlD,aAAeksC,EACVlsC,EAEF,IAAIksC,EAAQ7wB,EAAI,CACrBrb,IAAKA,EACLguC,OAAQrzF,KAIZuxF,EAAQG,YAAc,SAAqBhxB,EAAIlf,EAAMxhD,GACnD,OAAIwhD,aAAgB+vC,EACX/vC,EAEF,IAAI+vC,EAAQ7wB,EAAI,CACrBlf,KAAMA,EACN4xC,QAASpzF,KAIbuxF,EAAQ/xF,UAAUynF,SAAW,WAC3B,IAAI5hC,EAAM9lD,KAAK+hE,YAEf,OAAIjc,EAAI8kC,aACC,CAAE1kF,QAAQ,EAAOiuB,OAAQ,sBAC7B2xB,EAAI4hC,WAEJ5hC,EAAIj1C,IAAI7Q,KAAKmhE,GAAG/b,MAAMpnC,GAAG4sE,aAGvB,CAAE1kF,QAAQ,EAAMiuB,OAAQ,MAFtB,CAAEjuB,QAAQ,EAAOiuB,OAAQ,uBAFzB,CAAEjuB,QAAQ,EAAOiuB,OAAQ,8BAOpC69D,EAAQ/xF,UAAU8hE,UAAY,SAAmB9xC,EAASxvB,GAUxD,MARuB,iBAAZwvB,IACTxvB,EAAMwvB,EACNA,EAAU,MAGPjwB,KAAK8lD,MACR9lD,KAAK8lD,IAAM9lD,KAAKmhE,GAAGn/C,EAAEnR,IAAI7Q,KAAKiiD,OAE3BxhD,EAGET,KAAK8lD,IAAI/kD,OAAON,EAAKwvB,GAFnBjwB,KAAK8lD,KAKhBksC,EAAQ/xF,UAAU+hE,WAAa,SAAoBvhE,GACjD,MAAY,QAARA,EACKT,KAAKiiD,KAAKh2C,SAAS,GAAI,GAEvBjM,KAAKiiD,MAGhB+vC,EAAQ/xF,UAAUsiE,eAAiB,SAAwBl+D,EAAK5D,GAC9DT,KAAKiiD,KAAO,IAAIpyC,EAAGxL,EAAK5D,GAAO,IAI/BT,KAAKiiD,KAAOjiD,KAAKiiD,KAAK5gC,KAAKrhB,KAAKmhE,GAAG/b,MAAMpnC,IAG3Cg0E,EAAQ/xF,UAAUmiE,cAAgB,SAAuB/9D,EAAK5D,GAC5D,GAAI4D,EAAI6X,GAAK7X,EAAI8X,EAWf,MAP2B,SAAvBnc,KAAKmhE,GAAG/b,MAAMp9C,KAChB5E,EAAOiB,EAAI6X,EAAG,qBACkB,UAAvBlc,KAAKmhE,GAAG/b,MAAMp9C,MACS,YAAvBhI,KAAKmhE,GAAG/b,MAAMp9C,MACvB5E,EAAOiB,EAAI6X,GAAK7X,EAAI8X,EAAG,qCAEzBnc,KAAK8lD,IAAM9lD,KAAKmhE,GAAG/b,MAAMqiC,MAAMpjF,EAAI6X,EAAG7X,EAAI8X,IAG5Cnc,KAAK8lD,IAAM9lD,KAAKmhE,GAAG/b,MAAMikC,YAAYhlF,EAAK5D,IAI5CuxF,EAAQ/xF,UAAU8zF,OAAS,SAAgBjuC,GAIzC,OAHIA,EAAI4hC,YACNtkF,EAAO0iD,EAAI4hC,WAAY,8BAElB5hC,EAAIj1C,IAAI7Q,KAAKiiD,MAAMggB,QAI5B+vB,EAAQ/xF,UAAUkP,KAAO,SAAc1F,EAAKhJ,EAAKI,GAC/C,OAAOb,KAAKmhE,GAAGhyD,KAAK1F,EAAKzJ,KAAMS,EAAKI,IAGtCmxF,EAAQ/xF,UAAUmjD,OAAS,SAAgB35C,EAAK28C,GAC9C,OAAOpmD,KAAKmhE,GAAG/d,OAAO35C,EAAK28C,EAAWpmD,OAGxCgyF,EAAQ/xF,UAAUqS,QAAU,WAC1B,MAAO,eAAiBtS,KAAKiiD,MAAQjiD,KAAKiiD,KAAKh2C,SAAS,GAAI,IACrD,UAAYjM,KAAK8lD,KAAO9lD,KAAK8lD,IAAIxzC,WAAa,kCCrHvD,IAAIzC,EAAK,EAAQ,MAEbk8D,EAAQ,EAAQ,KAChB3oE,EAAS2oE,EAAM3oE,OAEnB,SAAS8/E,EAAUriF,EAASJ,GAC1B,GAAII,aAAmBqiF,EACrB,OAAOriF,EAELb,KAAKg0F,WAAWnzF,EAASJ,KAG7B2C,EAAOvC,EAAQ8P,GAAK9P,EAAQsc,EAAG,4BAC/Bnd,KAAK2Q,EAAI,IAAId,EAAGhP,EAAQ8P,EAAG,IAC3B3Q,KAAKmd,EAAI,IAAItN,EAAGhP,EAAQsc,EAAG,SACG/U,IAA1BvH,EAAQsyF,cACVnzF,KAAKmzF,cAAgB,KAErBnzF,KAAKmzF,cAAgBtyF,EAAQsyF,eAIjC,SAASzU,IACP1+E,KAAKi0F,MAAQ,EAGf,SAASC,EAAUlpF,EAAKwE,GACtB,IAAI2kF,EAAUnpF,EAAIwE,EAAEykF,SACpB,KAAgB,IAAVE,GACJ,OAAOA,EAET,IAAIC,EAAqB,GAAVD,EAGf,GAAiB,IAAbC,GAAkBA,EAAW,EAC/B,OAAO,EAIT,IADA,IAAIzuF,EAAM,EACD0F,EAAI,EAAGoG,EAAMjC,EAAEykF,MAAO5oF,EAAI+oF,EAAU/oF,IAAKoG,IAChD9L,IAAQ,EACRA,GAAOqF,EAAIyG,GACX9L,KAAS,EAIX,QAAIA,GAAO,OAIX6J,EAAEykF,MAAQxiF,EACH9L,GAGT,SAAS0uF,EAAUrpF,GAGjB,IAFA,IAAIK,EAAI,EACJD,EAAMJ,EAAI1J,OAAS,GACf0J,EAAIK,MAAqB,IAAbL,EAAIK,EAAI,KAAcA,EAAID,GAC5CC,IAEF,OAAU,IAANA,EACKL,EAEFA,EAAIpI,MAAMyI,GA4DnB,SAASipF,EAAgB//D,EAAKnpB,GAC5B,GAAIA,EAAM,IACRmpB,EAAIxvB,KAAKqG,OADX,CAIA,IAAImpF,EAAS,GAAKzjF,KAAK+gB,IAAIzmB,GAAO0F,KAAK0jF,MAAQ,GAE/C,IADAjgE,EAAIxvB,KAAc,IAATwvF,KACAA,GACPhgE,EAAIxvB,KAAMqG,KAASmpF,GAAU,GAAM,KAErChgE,EAAIxvB,KAAKqG,IAjHX3M,EAAOC,QAAUwkF,EA8CjBA,EAAUjjF,UAAU+zF,WAAa,SAAoBpzF,EAAMH,GACzDG,EAAOmrE,EAAM78D,QAAQtO,EAAMH,GAC3B,IAAI+O,EAAI,IAAIkvE,EACZ,GAAwB,KAApB99E,EAAK4O,EAAEykF,SACT,OAAO,EAET,IAAI7oF,EAAM8oF,EAAUtzF,EAAM4O,GAC1B,IAAY,IAARpE,EACF,OAAO,EAET,GAAKA,EAAMoE,EAAEykF,QAAWrzF,EAAKU,OAC3B,OAAO,EAET,GAAwB,IAApBV,EAAK4O,EAAEykF,SACT,OAAO,EAET,IAAI5tE,EAAO6tE,EAAUtzF,EAAM4O,GAC3B,IAAa,IAAT6W,EACF,OAAO,EAET,IAAI1V,EAAI/P,EAAKgC,MAAM4M,EAAEykF,MAAO5tE,EAAO7W,EAAEykF,OAErC,GADAzkF,EAAEykF,OAAS5tE,EACa,IAApBzlB,EAAK4O,EAAEykF,SACT,OAAO,EAET,IAAIQ,EAAOP,EAAUtzF,EAAM4O,GAC3B,IAAa,IAATilF,EACF,OAAO,EAET,GAAI7zF,EAAKU,SAAWmzF,EAAOjlF,EAAEykF,MAC3B,OAAO,EAET,IAAI92E,EAAIvc,EAAKgC,MAAM4M,EAAEykF,MAAOQ,EAAOjlF,EAAEykF,OACrC,GAAa,IAATtjF,EAAE,GAAU,CACd,KAAW,IAAPA,EAAE,IAIJ,OAAO,EAHPA,EAAIA,EAAE/N,MAAM,GAMhB,GAAa,IAATua,EAAE,GAAU,CACd,KAAW,IAAPA,EAAE,IAIJ,OAAO,EAHPA,EAAIA,EAAEva,MAAM,GAWhB,OAJA5C,KAAK2Q,EAAI,IAAId,EAAGc,GAChB3Q,KAAKmd,EAAI,IAAItN,EAAGsN,GAChBnd,KAAKmzF,cAAgB,MAEd,GAgBTjQ,EAAUjjF,UAAUulD,MAAQ,SAAe/kD,GACzC,IAAIkQ,EAAI3Q,KAAK2Q,EAAEzB,UACXiO,EAAInd,KAAKmd,EAAEjO,UAYf,IATW,IAAPyB,EAAE,KACJA,EAAI,CAAE,GAAIpN,OAAOoN,IAER,IAAPwM,EAAE,KACJA,EAAI,CAAE,GAAI5Z,OAAO4Z,IAEnBxM,EAAI0jF,EAAU1jF,GACdwM,EAAIk3E,EAAUl3E,KAENA,EAAE,IAAe,IAAPA,EAAE,KAClBA,EAAIA,EAAEva,MAAM,GAEd,IAAI2xB,EAAM,CAAE,GACZ+/D,EAAgB//D,EAAK5jB,EAAErP,SACvBizB,EAAMA,EAAIhxB,OAAOoN,IACb5L,KAAK,GACTuvF,EAAgB//D,EAAKpX,EAAE7b,QACvB,IAAIozF,EAAWngE,EAAIhxB,OAAO4Z,GACtB3a,EAAM,CAAE,IAGZ,OAFA8xF,EAAgB9xF,EAAKkyF,EAASpzF,QAC9BkB,EAAMA,EAAIe,OAAOmxF,GACV3oB,EAAMhrE,OAAOyB,EAAK/B,iCClK3B,IAAIijD,EAAO,EAAQ,MACfY,EAAS,EAAQ,MACjBynB,EAAQ,EAAQ,KAChB3oE,EAAS2oE,EAAM3oE,OACfuxF,EAAa5oB,EAAM4oB,WACnB3C,EAAU,EAAQ,MAClB9O,EAAY,EAAQ,MAExB,SAAS0R,EAAMxvC,GAGb,GAFAhiD,EAAiB,YAAVgiD,EAAqB,qCAEtBplD,gBAAgB40F,GACpB,OAAO,IAAIA,EAAMxvC,GAEnBA,EAAQd,EAAOc,GAAOA,MACtBplD,KAAKolD,MAAQA,EACbplD,KAAKgiB,EAAIojC,EAAMpjC,EACfhiB,KAAKgiB,EAAEynE,WAAWrkC,EAAMpnC,EAAEvJ,YAAc,GAExCzU,KAAK60F,WAAazvC,EAAMqiC,QAAQxlF,YAChCjC,KAAKu9B,eAAiBzsB,KAAKS,KAAK6zC,EAAMpnC,EAAEvJ,YAAc,GACtDzU,KAAK0jD,KAAOA,EAAKouC,OAGnBrzF,EAAOC,QAAUk2F,EAOjBA,EAAM30F,UAAUkP,KAAO,SAAcjF,EAASumE,GAC5CvmE,EAAUyqF,EAAWzqF,GACrB,IAAI7F,EAAMrE,KAAK80F,cAAcrkB,GACzB9/D,EAAI3Q,KAAK+0F,QAAQ1wF,EAAI2wF,gBAAiB9qF,GACtC+qF,EAAIj1F,KAAKgiB,EAAEnR,IAAIF,GACfukF,EAAWl1F,KAAKm1F,YAAYF,GAC5BG,EAAKp1F,KAAK+0F,QAAQG,EAAU7wF,EAAIgxF,WAAYnrF,GAC7C2G,IAAIxM,EAAI49C,QACPqzC,EAAI3kF,EAAE+F,IAAI0+E,GAAI/zE,KAAKrhB,KAAKolD,MAAMpnC,GAClC,OAAOhe,KAAKu1F,cAAc,CAAEN,EAAGA,EAAGK,EAAGA,EAAGJ,SAAUA,KASpDN,EAAM30F,UAAUmjD,OAAS,SAAgBl5C,EAASg6C,EAAK4B,GACrD57C,EAAUyqF,EAAWzqF,GACrBg6C,EAAMlkD,KAAKu1F,cAAcrxC,GACzB,IAAI7/C,EAAMrE,KAAK8hE,cAAchc,GACzBlmC,EAAI5f,KAAK+0F,QAAQ7wC,EAAIgxC,WAAY7wF,EAAIgxF,WAAYnrF,GACjDsrF,EAAKx1F,KAAKgiB,EAAEnR,IAAIqzC,EAAIoxC,KAExB,OADcpxC,EAAI+wC,IAAIv+E,IAAIrS,EAAIyhD,MAAMj1C,IAAI+O,IACzB6D,GAAG+xE,IAGpBZ,EAAM30F,UAAU80F,QAAU,WAExB,IADA,IAAIrxC,EAAO1jD,KAAK0jD,OACPr4C,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IACpCq4C,EAAKtS,OAAOnsC,UAAUoG,IACxB,OAAO0gE,EAAM0pB,UAAU/xC,EAAKO,UAAU5iC,KAAKrhB,KAAKolD,MAAMpnC,IAGxD42E,EAAM30F,UAAU6hE,cAAgB,SAAuBhc,GACrD,OAAOksC,EAAQI,WAAWpyF,KAAM8lD,IAGlC8uC,EAAM30F,UAAU60F,cAAgB,SAAuBrkB,GACrD,OAAOuhB,EAAQ0D,WAAW11F,KAAMywE,IAGlCmkB,EAAM30F,UAAUs1F,cAAgB,SAAuBrxC,GACrD,OAAIA,aAAeg/B,EACVh/B,EACF,IAAIg/B,EAAUljF,KAAMkkD,IAW7B0wC,EAAM30F,UAAUk1F,YAAc,SAAqB1N,GACjD,IAAIhnF,EAAMgnF,EAAM+B,OAAOt6E,QAAQ,KAAMlP,KAAKu9B,gBAE1C,OADA98B,EAAIT,KAAKu9B,eAAiB,IAAMkqD,EAAMxlB,OAAO5/C,QAAU,IAAO,EACvD5hB,GAGTm0F,EAAM30F,UAAUopF,YAAc,SAAqB3mF,GAGjD,IAAIizF,GAFJjzF,EAAQqpE,EAAM4oB,WAAWjyF,IAENpB,OAAS,EACxBs0F,EAASlzF,EAAME,MAAM,EAAG+yF,GAAQpyF,QAAuB,IAAhBb,EAAMizF,IAC7CE,EAAoC,IAAV,IAAhBnzF,EAAMizF,IAEhBx5E,EAAI4vD,EAAM0pB,UAAUG,GACxB,OAAO51F,KAAKolD,MAAMulC,WAAWxuE,EAAG05E,IAGlCjB,EAAM30F,UAAU61F,UAAY,SAAmBlwF,GAC7C,OAAOA,EAAIsJ,QAAQ,KAAMlP,KAAKu9B,iBAGhCq3D,EAAM30F,UAAU81F,UAAY,SAAmBrzF,GAC7C,OAAOqpE,EAAM0pB,UAAU/yF,IAGzBkyF,EAAM30F,UAAU+1F,QAAU,SAAiBrwF,GACzC,OAAOA,aAAe3F,KAAK60F,yCClH7B,IAAI9oB,EAAQ,EAAQ,KAChB3oE,EAAS2oE,EAAM3oE,OACfuxF,EAAa5oB,EAAM4oB,WACnBsB,EAAiBlqB,EAAMkqB,eAW3B,SAASjE,EAAQzL,EAAO7zC,GACtB1yC,KAAKumF,MAAQA,EACbvmF,KAAKk2F,QAAUvB,EAAWjiD,EAAO+9B,QAC7B8V,EAAMyP,QAAQtjD,EAAOoT,KACvB9lD,KAAK2vE,KAAOj9B,EAAOoT,IAEnB9lD,KAAKm2F,UAAYxB,EAAWjiD,EAAOoT,KAGvCksC,EAAQI,WAAa,SAAoB7L,EAAOzgC,GAC9C,OAAIA,aAAeksC,EACVlsC,EACF,IAAIksC,EAAQzL,EAAO,CAAEzgC,IAAKA,KAGnCksC,EAAQ0D,WAAa,SAAoBnP,EAAO9V,GAC9C,OAAIA,aAAkBuhB,EACbvhB,EACF,IAAIuhB,EAAQzL,EAAO,CAAE9V,OAAQA,KAGtCuhB,EAAQ/xF,UAAUwwE,OAAS,WACzB,OAAOzwE,KAAKk2F,SAGdD,EAAejE,EAAS,YAAY,WAClC,OAAOhyF,KAAKumF,MAAM4O,YAAYn1F,KAAK8lD,UAGrCmwC,EAAejE,EAAS,OAAO,WAC7B,OAAIhyF,KAAKm2F,UACAn2F,KAAKumF,MAAM8C,YAAYrpF,KAAKm2F,WAC9Bn2F,KAAKumF,MAAMvkE,EAAEnR,IAAI7Q,KAAKiiD,WAG/Bg0C,EAAejE,EAAS,aAAa,WACnC,IAAIzL,EAAQvmF,KAAKumF,MACb7iC,EAAO1jD,KAAK0jD,OACZiyC,EAASpP,EAAMhpD,eAAiB,EAEhC3qB,EAAI8wC,EAAK9gD,MAAM,EAAG2jF,EAAMhpD,gBAK5B,OAJA3qB,EAAE,IAAM,IACRA,EAAE+iF,IAAW,IACb/iF,EAAE+iF,IAAW,GAEN/iF,KAGTqjF,EAAejE,EAAS,QAAQ,WAC9B,OAAOhyF,KAAKumF,MAAMwP,UAAU/1F,KAAKo2F,gBAGnCH,EAAejE,EAAS,QAAQ,WAC9B,OAAOhyF,KAAKumF,MAAM7iC,OAAOtS,OAAOpxC,KAAKywE,UAAUxsB,YAGjDgyC,EAAejE,EAAS,iBAAiB,WACvC,OAAOhyF,KAAK0jD,OAAO9gD,MAAM5C,KAAKumF,MAAMhpD,mBAGtCy0D,EAAQ/xF,UAAUkP,KAAO,SAAcjF,GAErC,OADA9G,EAAOpD,KAAKk2F,QAAS,2BACdl2F,KAAKumF,MAAMp3E,KAAKjF,EAASlK,OAGlCgyF,EAAQ/xF,UAAUmjD,OAAS,SAAgBl5C,EAASg6C,GAClD,OAAOlkD,KAAKumF,MAAMnjC,OAAOl5C,EAASg6C,EAAKlkD,OAGzCgyF,EAAQ/xF,UAAUo2F,UAAY,SAAmB51F,GAE/C,OADA2C,EAAOpD,KAAKk2F,QAAS,0BACdnqB,EAAMhrE,OAAOf,KAAKywE,SAAUhwE,IAGrCuxF,EAAQ/xF,UAAU8hE,UAAY,SAAmBthE,GAC/C,OAAOsrE,EAAMhrE,OAAOf,KAAKq1F,WAAY50F,IAGvChC,EAAOC,QAAUszF,+BC5FjB,IAAIniF,EAAK,EAAQ,MACbk8D,EAAQ,EAAQ,KAChB3oE,EAAS2oE,EAAM3oE,OACf6yF,EAAiBlqB,EAAMkqB,eACvBtB,EAAa5oB,EAAM4oB,WAUvB,SAASzR,EAAUqD,EAAOriC,GACxBlkD,KAAKumF,MAAQA,EAEM,iBAARriC,IACTA,EAAMywC,EAAWzwC,IAEfxiD,MAAMC,QAAQuiD,KAChBA,EAAM,CACJ+wC,EAAG/wC,EAAIthD,MAAM,EAAG2jF,EAAMhpD,gBACtB+3D,EAAGpxC,EAAIthD,MAAM2jF,EAAMhpD,kBAIvBn6B,EAAO8gD,EAAI+wC,GAAK/wC,EAAIoxC,EAAG,4BAEnB/O,EAAMyP,QAAQ9xC,EAAI+wC,KACpBj1F,KAAKs2F,GAAKpyC,EAAI+wC,GACZ/wC,EAAIoxC,aAAazlF,IACnB7P,KAAKu2F,GAAKryC,EAAIoxC,GAEhBt1F,KAAKw2F,UAAY90F,MAAMC,QAAQuiD,EAAI+wC,GAAK/wC,EAAI+wC,EAAI/wC,EAAIgxC,SACpDl1F,KAAKy2F,UAAY/0F,MAAMC,QAAQuiD,EAAIoxC,GAAKpxC,EAAIoxC,EAAIpxC,EAAIwyC,SAGtDT,EAAe/S,EAAW,KAAK,WAC7B,OAAOljF,KAAKumF,MAAMwP,UAAU/1F,KAAK02F,eAGnCT,EAAe/S,EAAW,KAAK,WAC7B,OAAOljF,KAAKumF,MAAM8C,YAAYrpF,KAAKk1F,eAGrCe,EAAe/S,EAAW,YAAY,WACpC,OAAOljF,KAAKumF,MAAM4O,YAAYn1F,KAAKi1F,QAGrCgB,EAAe/S,EAAW,YAAY,WACpC,OAAOljF,KAAKumF,MAAMuP,UAAU91F,KAAKs1F,QAGnCpS,EAAUjjF,UAAU02F,QAAU,WAC5B,OAAO32F,KAAKk1F,WAAW3xF,OAAOvD,KAAK02F,aAGrCxT,EAAUjjF,UAAU22F,MAAQ,WAC1B,OAAO7qB,EAAMhrE,OAAOf,KAAK22F,UAAW,OAAOnpF,eAG7C/O,EAAOC,QAAUwkF,YChEjBzkF,EAAOC,QAAU,CACfkpF,QAAS,CACPI,KAAM,EACNK,OAAQ,CACN,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,kEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,sEAINP,IAAK,CACH7gE,IAAK,EACLohE,OAAQ,CACN,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,iEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,kEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,oEAEF,CACE,mEACA,mGCrwBR,IAAItc,EAAQrtE,EACRmR,EAAK,EAAQ,MACbgnF,EAAY,EAAQ,MACpBC,EAAW,EAAQ,MAEvB/qB,EAAM3oE,OAASyzF,EACf9qB,EAAM78D,QAAU4nF,EAAS5nF,QACzB68D,EAAMgrB,MAAQD,EAASC,MACvBhrB,EAAM6qB,MAAQE,EAASF,MACvB7qB,EAAMhrE,OAAS+1F,EAAS/1F,OA6BxBgrE,EAAMya,OA1BN,SAAgB5gF,EAAK4L,EAAG8N,GACtB,IAAIwoE,EAAM,IAAIpmF,MAAMoP,KAAKC,IAAInL,EAAI6O,YAAa6K,GAAQ,GACtDwoE,EAAIjjC,KAAK,GAKT,IAHA,IAAIzmC,EAAK,GAAM5M,EAAI,EACfwB,EAAIpN,EAAIjB,QAEH0G,EAAI,EAAGA,EAAIy8E,EAAIxmF,OAAQ+J,IAAK,CACnC,IAAI0b,EACAjV,EAAMkB,EAAEmB,MAAMiK,EAAK,GACnBpL,EAAEqP,SAEF0E,EADEjV,GAAOsM,GAAM,GAAK,GACfA,GAAM,GAAKtM,EAEZA,EACNkB,EAAEsN,MAAMyG,IAERA,EAAI,EAGN+gE,EAAIz8E,GAAK0b,EACT/T,EAAEoB,OAAO,GAGX,OAAO0zE,GA2DT/b,EAAM0a,OAtDN,SAAgBvY,EAAIC,GAClB,IAAI+a,EAAM,CACR,GACA,IAGFhb,EAAKA,EAAGvpE,QACRwpE,EAAKA,EAAGxpE,QAIR,IAHA,IAEIqyF,EAFAC,EAAK,EACLC,EAAK,EAEFhpB,EAAGtrD,MAAMq0E,GAAM,GAAK9oB,EAAGvrD,MAAMs0E,GAAM,GAAG,CAE3C,IAMI9H,EAYAC,EAlBA8H,EAAOjpB,EAAG/5D,MAAM,GAAK8iF,EAAM,EAC3BG,EAAOjpB,EAAGh6D,MAAM,GAAK+iF,EAAM,EACnB,IAARC,IACFA,GAAO,GACG,IAARC,IACFA,GAAO,GAGPhI,EADgB,IAAP,EAAN+H,GACE,EAGO,IADZH,EAAM9oB,EAAG/5D,MAAM,GAAK8iF,EAAM,IACF,IAAPD,GAAqB,IAARI,EAGvBD,GAFCA,EAIVjO,EAAI,GAAGnkF,KAAKqqF,GAIVC,EADgB,IAAP,EAAN+H,GACE,EAGO,IADZJ,EAAM7oB,EAAGh6D,MAAM,GAAK+iF,EAAM,IACF,IAAPF,GAAqB,IAARG,EAGvBC,GAFCA,EAIVlO,EAAI,GAAGnkF,KAAKsqF,GAGR,EAAI4H,IAAO7H,EAAK,IAClB6H,EAAK,EAAIA,GACP,EAAIC,IAAO7H,EAAK,IAClB6H,EAAK,EAAIA,GACXhpB,EAAG95D,OAAO,GACV+5D,EAAG/5D,OAAO,GAGZ,OAAO80E,GAWTnd,EAAMkqB,eAPN,SAAwB/xF,EAAKpE,EAAMu3F,GACjC,IAAIhzF,EAAM,IAAMvE,EAChBoE,EAAIjE,UAAUH,GAAQ,WACpB,YAAqBsI,IAAdpI,KAAKqE,GAAqBrE,KAAKqE,GACpCrE,KAAKqE,GAAOgzF,EAAS92F,KAAKP,QAShC+rE,EAAM4oB,WAJN,SAAoBjyF,GAClB,MAAwB,iBAAVA,EAAqBqpE,EAAM78D,QAAQxM,EAAO,OACtDA,GAOJqpE,EAAM0pB,UAHN,SAAmB/yF,GACjB,OAAO,IAAImN,EAAGnN,EAAO,MAAO,8BCnH9B,SAAWjE,EAAQC,GACjB,aAGA,SAAS0E,EAAQuC,EAAK8D,GACpB,IAAK9D,EAAK,MAAM,IAAI1G,MAAMwK,GAAO,oBAKnC,SAAS7J,EAAU6P,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS3P,UAAYyP,EAAUzP,UAC/BwP,EAAKxP,UAAY,IAAI2P,EACrBH,EAAKxP,UAAUgC,YAAcwN,EAK/B,SAASI,EAAIC,EAAQtQ,EAAMuQ,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT9P,KAAKiQ,SAAW,EAChBjQ,KAAKkQ,MAAQ,KACblQ,KAAKsB,OAAS,EAGdtB,KAAKmQ,IAAM,KAEI,OAAXL,IACW,OAATtQ,GAA0B,OAATA,IACnBuQ,EAASvQ,EACTA,EAAO,IAGTQ,KAAKkF,MAAM4K,GAAU,EAAGtQ,GAAQ,GAAIuQ,GAAU,OAYlD,IAAI7O,EATkB,iBAAXzC,EACTA,EAAOC,QAAUmR,EAEjBnR,EAAQmR,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IAEIlP,EADoB,oBAAXmP,aAAmD,IAAlBA,OAAOnP,OACxCmP,OAAOnP,OAEP,eAEX,MAAOwF,IAgIT,SAAS4J,EAAeC,EAAQ3G,GAC9B,IAAI4G,EAAID,EAAOlC,WAAWzE,GAE1B,OAAI4G,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASC,EAAcF,EAAQG,EAAY9G,GACzC,IAAI+G,EAAIL,EAAcC,EAAQ3G,GAI9B,OAHIA,EAAQ,GAAK8G,IACfC,GAAKL,EAAcC,EAAQ3G,EAAQ,IAAM,GAEpC+G,EA8CT,SAASC,EAAWvH,EAAKxC,EAAO6G,EAAKmD,GAGnC,IAFA,IAAIF,EAAI,EACJvF,EAAM0F,KAAK/D,IAAI1D,EAAI/H,OAAQoM,GACtBrC,EAAIxE,EAAOwE,EAAID,EAAKC,IAAK,CAChC,IAAImF,EAAInH,EAAIgF,WAAWhD,GAAK,GAE5BsF,GAAKE,EAIHF,GADEH,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOG,EAnNTd,EAAGG,KAAO,SAAepK,GACvB,OAAIA,aAAeiK,GAIJ,OAARjK,GAA+B,iBAARA,GAC5BA,EAAI3D,YAAYmO,WAAaP,EAAGO,UAAY1O,MAAMC,QAAQiE,EAAIsK,QAGlEL,EAAGkB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG9C,IAAM,SAAciE,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG5P,UAAUiF,MAAQ,SAAe4K,EAAQtQ,EAAMuQ,GAChD,GAAsB,iBAAXD,EACT,OAAO9P,KAAKmR,YAAYrB,EAAQtQ,EAAMuQ,GAGxC,GAAsB,iBAAXD,EACT,OAAO9P,KAAKoR,WAAWtB,EAAQtQ,EAAMuQ,GAG1B,QAATvQ,IACFA,EAAO,IAET4D,EAAO5D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqH,EAAQ,EACM,OAFlBiJ,EAASA,EAAO7D,WAAW2B,QAAQ,OAAQ,KAEhC,KACT/G,IACA7G,KAAKiQ,SAAW,GAGdpJ,EAAQiJ,EAAOxO,SACJ,KAAT9B,EACFQ,KAAKqR,UAAUvB,EAAQjJ,EAAOkJ,IAE9B/P,KAAKsR,WAAWxB,EAAQtQ,EAAMqH,GACf,OAAXkJ,GACF/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,MAM9CF,EAAG5P,UAAUkR,YAAc,SAAsBrB,EAAQtQ,EAAMuQ,GACzDD,EAAS,IACX9P,KAAKiQ,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX9P,KAAKkQ,MAAQ,CAAW,SAATJ,GACf9P,KAAKsB,OAAS,GACLwO,EAAS,kBAClB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB9P,KAAKsB,OAAS,IAEd8B,EAAO0M,EAAS,kBAChB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF9P,KAAKsB,OAAS,GAGD,OAAXyO,GAGJ/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,IAGxCF,EAAG5P,UAAUmR,WAAa,SAAqBtB,EAAQtQ,EAAMuQ,GAG3D,GADA3M,EAAgC,iBAAlB0M,EAAOxO,QACjBwO,EAAOxO,QAAU,EAGnB,OAFAtB,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EACPtB,KAGTA,KAAKsB,OAASwP,KAAKS,KAAKzB,EAAOxO,OAAS,GACxCtB,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAGlB,IAAIC,EAAGkG,EACHC,EAAM,EACV,GAAe,OAAX1B,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAGgK,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,UAGC,GAAe,OAAXyE,EACT,IAAK1E,EAAI,EAAGC,EAAI,EAAGD,EAAIyE,EAAOxO,OAAQ+J,GAAK,EACzCmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,KAIN,OAAOtL,KAAK0R,SAyBd7B,EAAG5P,UAAUoR,UAAY,SAAoBvB,EAAQjJ,EAAOkJ,GAE1D/P,KAAKsB,OAASwP,KAAKS,MAAMzB,EAAOxO,OAASuF,GAAS,GAClD7G,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAIlB,IAGImG,EAHAC,EAAM,EACNnG,EAAI,EAGR,GAAe,OAAXyE,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAG+J,GAAKxE,EAAOwE,GAAK,EAC3CmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,OAKX,IAAKpG,GADayE,EAAOxO,OAASuF,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOwE,EAAIyE,EAAOxO,OAAQ+J,GAAK,EAC1EmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,EAKbzR,KAAK0R,SA2BP7B,EAAG5P,UAAUqR,WAAa,SAAqBxB,EAAQtQ,EAAMqH,GAE3D7G,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EAGd,IAAK,IAAIqQ,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWpS,EAClEmS,IAEFA,IACAC,EAAWA,EAAUpS,EAAQ,EAO7B,IALA,IAAIqS,EAAQ/B,EAAOxO,OAASuF,EACxBiL,EAAMD,EAAQF,EACdjE,EAAMoD,KAAK/D,IAAI8E,EAAOA,EAAQC,GAAOjL,EAErCkL,EAAO,EACF1G,EAAIxE,EAAOwE,EAAIqC,EAAKrC,GAAKsG,EAChCI,EAAOnB,EAAUd,EAAQzE,EAAGA,EAAIsG,EAASnS,GAEzCQ,KAAKgS,MAAMJ,GACP5R,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOnB,EAAUd,EAAQzE,EAAGyE,EAAOxO,OAAQ9B,GAEtC6L,EAAI,EAAGA,EAAIyG,EAAKzG,IACnB6G,GAAO1S,EAGTQ,KAAKgS,MAAME,GACPlS,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB/R,KAAK0R,SAGP7B,EAAG5P,UAAUiD,KAAO,SAAeiP,GACjCA,EAAKjC,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/B8G,EAAKjC,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAE7B8G,EAAK7Q,OAAStB,KAAKsB,OACnB6Q,EAAKlC,SAAWjQ,KAAKiQ,SACrBkC,EAAKhC,IAAMnQ,KAAKmQ,KAGlBN,EAAG5P,UAAU0E,MAAQ,WACnB,IAAIgM,EAAI,IAAId,EAAG,MAEf,OADA7P,KAAKkD,KAAKyN,GACHA,GAGTd,EAAG5P,UAAUmS,QAAU,SAAkBxT,GACvC,KAAOoB,KAAKsB,OAAS1C,GACnBoB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAE9B,OAAOtB,MAIT6P,EAAG5P,UAAUyR,MAAQ,WACnB,KAAO1R,KAAKsB,OAAS,GAAqC,IAAhCtB,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IACjDtB,KAAKsB,SAEP,OAAOtB,KAAKqS,aAGdxC,EAAG5P,UAAUoS,UAAY,WAKvB,OAHoB,IAAhBrS,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,KAClClQ,KAAKiQ,SAAW,GAEXjQ,MAGT6P,EAAG5P,UAAUqS,QAAU,WACrB,OAAQtS,KAAKmQ,IAAM,UAAY,SAAWnQ,KAAKiM,SAAS,IAAM,KAiChE,IAAIsG,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAsjB9D,SAASC,EAAYC,EAAM/M,EAAK9C,GAC9BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnC,IAAI7E,EAAOuH,EAAKrR,OAASsE,EAAItE,OAAU,EACvCwB,EAAIxB,OAAS8J,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIwH,EAAoB,EAAhBD,EAAKzC,MAAM,GACf2C,EAAmB,EAAfjN,EAAIsK,MAAM,GACdS,EAAIiC,EAAIC,EAERC,EAAS,SAAJnC,EACLoC,EAASpC,EAAI,SAAa,EAC9B7N,EAAIoN,MAAM,GAAK4C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI5H,EAAK4H,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAK2H,EAAI1H,EAAK,EAIlB2H,IADAtC,GAFAiC,EAAoB,EAAhBD,EAAKzC,MAAM7E,KACfwH,EAAmB,EAAfjN,EAAIsK,MAAM5E,IACF4H,GACG,SAAa,EAC5BA,EAAY,SAAJvC,EAEV7N,EAAIoN,MAAM8C,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFjQ,EAAIoN,MAAM8C,GAAa,EAARD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAzlBb7B,EAAG5P,UAAUgM,SAAW,SAAmBzM,EAAM4T,GAI/C,IAAItQ,EACJ,GAHAsQ,EAAoB,EAAVA,GAAe,EAGZ,MAJb5T,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCsD,EAAM,GAGN,IAFA,IAAI2O,EAAM,EACNsB,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,EAAIxR,KAAKkQ,MAAM7E,GACf0G,GAA+B,UAArBP,GAAKC,EAAOsB,IAAmB9G,SAAS,IAGpDnJ,EADY,IADdiQ,EAASvB,IAAO,GAAKC,EAAQ,WACVpG,IAAMrL,KAAKsB,OAAS,EAC/BiR,EAAM,EAAIR,EAAKzQ,QAAUyQ,EAAOjP,EAEhCiP,EAAOjP,GAEf2O,GAAO,IACI,KACTA,GAAO,GACPpG,KAMJ,IAHc,IAAV0H,IACFjQ,EAAMiQ,EAAM9G,SAAS,IAAMnJ,GAEtBA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGT,GAAItD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI6T,EAAYb,EAAWhT,GAEvB8T,EAAYb,EAAWjT,GAC3BsD,EAAM,GACN,IAAI0N,EAAIxQ,KAAK2E,QAEb,IADA6L,EAAEP,SAAW,GACLO,EAAE+C,UAAU,CAClB,IAAI5C,EAAIH,EAAEgD,KAAKF,GAAWrH,SAASzM,GAMjCsD,GALF0N,EAAIA,EAAEiD,MAAMH,IAELC,SAGC5C,EAAI7N,EAFJyP,EAAMc,EAAY1C,EAAErP,QAAUqP,EAAI7N,EAQ5C,IAHI9C,KAAKuT,WACPzQ,EAAM,IAAMA,GAEPA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGTM,GAAO,EAAO,oCAGhByM,EAAG5P,UAAUyT,SAAW,WACtB,IAAIC,EAAM3T,KAAKkQ,MAAM,GASrB,OARoB,IAAhBlQ,KAAKsB,OACPqS,GAAuB,SAAhB3T,KAAKkQ,MAAM,GACO,IAAhBlQ,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,GAEzCyD,GAAO,iBAAoC,SAAhB3T,KAAKkQ,MAAM,GAC7BlQ,KAAKsB,OAAS,GACvB8B,GAAO,EAAO,8CAEU,IAAlBpD,KAAKiQ,UAAmB0D,EAAMA,GAGxC9D,EAAG5P,UAAU2T,OAAS,WACpB,OAAO5T,KAAKiM,SAAS,KAGvB4D,EAAG5P,UAAU4T,SAAW,SAAmB9D,EAAQzO,GAEjD,OADA8B,OAAyB,IAAXlC,GACPlB,KAAK8T,YAAY5S,EAAQ6O,EAAQzO,IAG1CuO,EAAG5P,UAAUiP,QAAU,SAAkBa,EAAQzO,GAC/C,OAAOtB,KAAK8T,YAAYpS,MAAOqO,EAAQzO,IAGzCuO,EAAG5P,UAAU6T,YAAc,SAAsBC,EAAWhE,EAAQzO,GAClE,IAAIS,EAAa/B,KAAK+B,aAClBiS,EAAY1S,GAAUwP,KAAKC,IAAI,EAAGhP,GACtCqB,EAAOrB,GAAciS,EAAW,yCAChC5Q,EAAO4Q,EAAY,EAAG,+BAEtBhU,KAAK0R,QACL,IAGImB,EAAGxH,EAHH4I,EAA0B,OAAXlE,EACfvN,EAAM,IAAIuR,EAAUC,GAGpBE,EAAIlU,KAAK2E,QACb,GAAKsP,EAYE,CACL,IAAK5I,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAI6I,GAAKwH,EAGX,KAAOxH,EAAI2I,EAAW3I,IACpB7I,EAAI6I,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI2I,EAAYjS,EAAYsJ,IACtC7I,EAAI6I,GAAK,EAGX,IAAKA,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAIwR,EAAY3I,EAAI,GAAKwH,EAe7B,OAAOrQ,GAGLsO,KAAKuD,MACPxE,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,OAAO,GAAKV,KAAKuD,MAAM7C,IAGzB3B,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,IAAI+C,EAAI/C,EACJb,EAAI,EAiBR,OAhBI4D,GAAK,OACP5D,GAAK,GACL4D,KAAO,IAELA,GAAK,KACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAEF5D,EAAI4D,GAIf1E,EAAG5P,UAAUuU,UAAY,SAAoBhD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAI+C,EAAI/C,EACJb,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ4D,KACH5D,GAAK,GACL4D,KAAO,IAEU,IAAV,IAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,GAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,IACH5D,IAEKA,GAITd,EAAG5P,UAAUwU,UAAY,WACvB,IAAIjD,EAAIxR,KAAKkQ,MAAMlQ,KAAKsB,OAAS,GAC7BoT,EAAK1U,KAAKsU,WAAW9C,GACzB,OAA2B,IAAnBxR,KAAKsB,OAAS,GAAUoT,GAiBlC7E,EAAG5P,UAAU0U,SAAW,WACtB,GAAI3U,KAAKuT,SAAU,OAAO,EAG1B,IADA,IAAI5C,EAAI,EACCtF,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAIwH,EAAI7S,KAAKwU,UAAUxU,KAAKkQ,MAAM7E,IAElC,GADAsF,GAAKkC,EACK,KAANA,EAAU,MAEhB,OAAOlC,GAGTd,EAAG5P,UAAU8B,WAAa,WACxB,OAAO+O,KAAKS,KAAKvR,KAAKyU,YAAc,IAGtC5E,EAAG5P,UAAU2U,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7U,KAAKiQ,SACAjQ,KAAK8U,MAAMC,MAAMF,GAAOG,MAAM,GAEhChV,KAAK2E,SAGdkL,EAAG5P,UAAUgV,SAAW,SAAmBJ,GACzC,OAAI7U,KAAKkV,MAAML,EAAQ,GACd7U,KAAKmV,KAAKN,GAAOG,MAAM,GAAGI,OAE5BpV,KAAK2E,SAGdkL,EAAG5P,UAAUoV,MAAQ,WACnB,OAAyB,IAAlBrV,KAAKiQ,UAIdJ,EAAG5P,UAAUqV,IAAM,WACjB,OAAOtV,KAAK2E,QAAQyQ,QAGtBvF,EAAG5P,UAAUmV,KAAO,WAKlB,OAJKpV,KAAKuT,WACRvT,KAAKiQ,UAAY,GAGZjQ,MAIT6P,EAAG5P,UAAUsV,KAAO,SAAe3P,GACjC,KAAO5F,KAAKsB,OAASsE,EAAItE,QACvBtB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAG9B,IAAK,IAAI+J,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAC9BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAG5C,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUuV,IAAM,SAAc5P,GAE/B,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAKuV,KAAK3P,IAInBiK,EAAG5P,UAAUwV,GAAK,SAAa7P,GAC7B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6Q,IAAI5P,GAC/CA,EAAIjB,QAAQ6Q,IAAIxV,OAGzB6P,EAAG5P,UAAUyV,IAAM,SAAc9P,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ4Q,KAAK3P,GAChDA,EAAIjB,QAAQ4Q,KAAKvV,OAI1B6P,EAAG5P,UAAU0V,MAAQ,SAAgB/P,GAEnC,IAAIiN,EAEFA,EADE7S,KAAKsB,OAASsE,EAAItE,OAChBsE,EAEA5F,KAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAK5C,OAFArL,KAAKsB,OAASuR,EAAEvR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU2V,KAAO,SAAehQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK2V,MAAM/P,IAIpBiK,EAAG5P,UAAU4V,IAAM,SAAcjQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQiR,KAAKhQ,GAChDA,EAAIjB,QAAQiR,KAAK5V,OAG1B6P,EAAG5P,UAAU6V,KAAO,SAAelQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQgR,MAAM/P,GACjDA,EAAIjB,QAAQgR,MAAM3V,OAI3B6P,EAAG5P,UAAU8V,MAAQ,SAAgBnQ,GAEnC,IAAIgN,EACAC,EACA7S,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAAKwH,EAAE3C,MAAM7E,GAGvC,GAAIrL,OAAS4S,EACX,KAAOvH,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAM5B,OAFArL,KAAKsB,OAASsR,EAAEtR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU+V,KAAO,SAAepQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK+V,MAAMnQ,IAIpBiK,EAAG5P,UAAUgW,IAAM,SAAcrQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQqR,KAAKpQ,GAChDA,EAAIjB,QAAQqR,KAAKhW,OAG1B6P,EAAG5P,UAAUiW,KAAO,SAAetQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQoR,MAAMnQ,GACjDA,EAAIjB,QAAQoR,MAAM/V,OAI3B6P,EAAG5P,UAAU8U,MAAQ,SAAgBF,GACnCzR,EAAwB,iBAAVyR,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBrF,KAAKS,KAAKsD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7U,KAAKoS,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAa9K,IAC/BrL,KAAKkQ,MAAM7E,GAAsB,UAAhBrL,KAAKkQ,MAAM7E,GAS9B,OALI+K,EAAW,IACbpW,KAAKkQ,MAAM7E,IAAMrL,KAAKkQ,MAAM7E,GAAM,UAAc,GAAK+K,GAIhDpW,KAAK0R,SAGd7B,EAAG5P,UAAUkV,KAAO,SAAeN,GACjC,OAAO7U,KAAK2E,QAAQoQ,MAAMF,IAI5BhF,EAAG5P,UAAUoW,KAAO,SAAeC,EAAK3Q,GACtCvC,EAAsB,iBAARkT,GAAoBA,GAAO,GAEzC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtW,KAAKoS,QAAQX,EAAM,GAGjBzR,KAAKkQ,MAAMuB,GADT9L,EACgB3F,KAAKkQ,MAAMuB,GAAQ,GAAK8E,EAExBvW,KAAKkQ,MAAMuB,KAAS,GAAK8E,GAGtCvW,KAAK0R,SAId7B,EAAG5P,UAAUuW,KAAO,SAAe5Q,GACjC,IAAI+K,EAkBAiC,EAAGC,EAfP,GAAsB,IAAlB7S,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAI7B,OAHAjQ,KAAKiQ,SAAW,EAChBU,EAAI3Q,KAAKyW,KAAK7Q,GACd5F,KAAKiQ,UAAY,EACVjQ,KAAKqS,YAGP,GAAsB,IAAlBrS,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAIpC,OAHArK,EAAIqK,SAAW,EACfU,EAAI3Q,KAAKyW,KAAK7Q,GACdA,EAAIqK,SAAW,EACRU,EAAE0B,YAKPrS,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,EAC1C/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAEhB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAClCsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,EACvB/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAIhB,GADA3Q,KAAKsB,OAASsR,EAAEtR,OACF,IAAVyR,EACF/S,KAAKkQ,MAAMlQ,KAAKsB,QAAUyR,EAC1B/S,KAAKsB,cAEA,GAAIsR,IAAM5S,KACf,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAI5B,OAAOrL,MAIT6P,EAAG5P,UAAUyW,IAAM,SAAc9Q,GAC/B,IAAIpD,EACJ,OAAqB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UAC7BrK,EAAIqK,SAAW,EACfzN,EAAMxC,KAAK2W,IAAI/Q,GACfA,EAAIqK,UAAY,EACTzN,GACmB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UACpCjQ,KAAKiQ,SAAW,EAChBzN,EAAMoD,EAAI+Q,IAAI3W,MACdA,KAAKiQ,SAAW,EACTzN,GAGLxC,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6R,KAAK5Q,GAEhDA,EAAIjB,QAAQ6R,KAAKxW,OAI1B6P,EAAG5P,UAAUwW,KAAO,SAAe7Q,GAEjC,GAAqB,IAAjBA,EAAIqK,SAAgB,CACtBrK,EAAIqK,SAAW,EACf,IAAIU,EAAI3Q,KAAKwW,KAAK5Q,GAElB,OADAA,EAAIqK,SAAW,EACRU,EAAE0B,YAGJ,GAAsB,IAAlBrS,KAAKiQ,SAId,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKwW,KAAK5Q,GACV5F,KAAKiQ,SAAW,EACTjQ,KAAKqS,YAId,IAWIO,EAAGC,EAXH3B,EAAMlR,KAAKkR,IAAItL,GAGnB,GAAY,IAARsL,EAIF,OAHAlR,KAAKiQ,SAAW,EAChBjQ,KAAKsB,OAAS,EACdtB,KAAKkQ,MAAM,GAAK,EACTlQ,KAKLkR,EAAM,GACR0B,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAE5B0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,IAC7B,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAElB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAElC0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,IACV,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAIlB,GAAc,IAAVoC,GAAe1H,EAAIuH,EAAEtR,QAAUsR,IAAM5S,KACvC,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAU5B,OANArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,GAEhCuH,IAAM5S,OACRA,KAAKiQ,SAAW,GAGXjQ,KAAK0R,SAId7B,EAAG5P,UAAU0W,IAAM,SAAc/Q,GAC/B,OAAO5F,KAAK2E,QAAQ8R,KAAK7Q,IA+C3B,IAAIgR,EAAc,SAAsBjE,EAAM/M,EAAK9C,GACjD,IAIIgQ,EACA+D,EACAnC,EANA9B,EAAID,EAAKzC,MACT2C,EAAIjN,EAAIsK,MACR4G,EAAIhU,EAAIoN,MACRM,EAAI,EAIJuG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnG,EAAE,GACPoG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtG,EAAE,GACPuG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzG,EAAE,GACP0G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5G,EAAE,GACP6G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP/G,EAAE,GACPgH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlH,EAAE,GACPmH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrH,EAAE,GACPsH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxH,EAAE,GACPyH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3H,EAAE,GACP4H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB1X,EAAImN,SAAW0C,EAAK1C,SAAWrK,EAAIqK,SACnCnN,EAAIxB,OAAS,GAMb,IAAIqZ,IAAQnK,GAJZsC,EAAKhC,KAAK8J,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM/F,KAAK8J,KAAK5D,EAAK+B,IACRjI,KAAK8J,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDtI,IAFAkE,EAAK5D,KAAK8J,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKhC,KAAK8J,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKzD,EAAK4B,IACRjI,KAAK8J,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQrK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKkC,GAAQ,GACvBpI,KAAK8J,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDzI,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKhC,KAAK8J,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKtD,EAAKyB,IACRjI,KAAK8J,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKrD,EAAKwB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK+B,GAAQ,GACvBpI,KAAK8J,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQtK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKqC,GAAQ,GACvBvI,KAAK8J,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD5I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKhC,KAAK8J,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKnD,EAAKsB,IACRjI,KAAK8J,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKlD,EAAKqB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK4B,GAAQ,GACvBpI,KAAK8J,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKkC,GAAQ,GACvBvI,KAAK8J,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQvK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKwC,GAAQ,GACvB1I,KAAK8J,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD/I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKhC,KAAK8J,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKhD,EAAKmB,IACRjI,KAAK8J,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK/C,EAAKkB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKyB,GAAQ,GACvBpI,KAAK8J,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK+B,GAAQ,GACvBvI,KAAK8J,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKqC,GAAQ,GACvB1I,KAAK8J,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQxK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK2C,IAAQ,GACvB7I,KAAK8J,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDlJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKhC,KAAK8J,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK7C,EAAKgB,IACRjI,KAAK8J,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK5C,EAAKe,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKsB,GAAQ,GACvBpI,KAAK8J,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK4B,GAAQ,GACvBvI,KAAK8J,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKkC,GAAQ,GACvB1I,KAAK8J,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKiC,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKwC,IAAQ,GACvB7I,KAAK8J,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQzK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK8C,IAAQ,GACvBhJ,KAAK8J,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDrJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKhC,KAAK8J,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK1C,EAAKa,IACRjI,KAAK8J,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKzC,EAAKY,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKmB,GAAQ,GACvBpI,KAAK8J,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKyB,GAAQ,GACvBvI,KAAK8J,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK+B,GAAQ,GACvB1I,KAAK8J,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK8B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKqC,IAAQ,GACvB7I,KAAK8J,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK2C,IAAQ,GACvBhJ,KAAK8J,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ1K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKiD,IAAQ,GACvBnJ,KAAK8J,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDxJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKhC,KAAK8J,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKvC,EAAKU,IACRjI,KAAK8J,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKtC,EAAKS,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKgB,GAAQ,GACvBpI,KAAK8J,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKsB,GAAQ,GACvBvI,KAAK8J,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK4B,GAAQ,GACvB1I,KAAK8J,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK2B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKkC,IAAQ,GACvB7I,KAAK8J,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKwC,IAAQ,GACvBhJ,KAAK8J,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK8C,IAAQ,GACvBnJ,KAAK8J,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ3K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKoD,IAAQ,GACvBtJ,KAAK8J,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD3J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKhC,KAAK8J,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKpC,EAAKO,IACRjI,KAAK8J,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKnC,EAAKM,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKa,GAAQ,GACvBpI,KAAK8J,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKmB,GAAQ,GACvBvI,KAAK8J,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKyB,GAAQ,GACvB1I,KAAK8J,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKwB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK+B,IAAQ,GACvB7I,KAAK8J,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKqC,IAAQ,GACvBhJ,KAAK8J,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKoC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK2C,IAAQ,GACvBnJ,KAAK8J,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKiD,IAAQ,GACvBtJ,KAAK8J,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ5K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKuD,IAAQ,GACvBzJ,KAAK8J,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD9J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKhC,KAAK8J,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKI,IACRjI,KAAK8J,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKhC,EAAKG,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKU,GAAQ,GACvBpI,KAAK8J,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKS,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKgB,GAAQ,GACvBvI,KAAK8J,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKsB,GAAQ,GACvB1I,KAAK8J,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKqB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK4B,IAAQ,GACvB7I,KAAK8J,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKkC,IAAQ,GACvBhJ,KAAK8J,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKwC,IAAQ,GACvBnJ,KAAK8J,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK8C,IAAQ,GACvBtJ,KAAK8J,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK6C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKoD,IAAQ,GACvBzJ,KAAK8J,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQ7K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK0D,IAAQ,GACvB5J,KAAK8J,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKhC,KAAK8J,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKO,IACRpI,KAAK8J,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK5D,KAAK8J,KAAKhC,EAAKM,GACpBpG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKa,GAAQ,GACvBvI,KAAK8J,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKY,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKmB,GAAQ,GACvB1I,KAAK8J,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKkB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKyB,IAAQ,GACvB7I,KAAK8J,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK+B,IAAQ,GACvBhJ,KAAK8J,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK8B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKqC,IAAQ,GACvBnJ,KAAK8J,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK2C,IAAQ,GACvBtJ,KAAK8J,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK0C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKiD,IAAQ,GACvBzJ,KAAK8J,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS9K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKuD,IAAQ,GACvB5J,KAAK8J,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKhC,KAAK8J,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKU,IACRvI,KAAK8J,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK5D,KAAK8J,KAAKhC,EAAKS,GACpBvG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKgB,GAAQ,GACvB1I,KAAK8J,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKe,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKsB,IAAQ,GACvB7I,KAAK8J,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK4B,IAAQ,GACvBhJ,KAAK8J,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKkC,IAAQ,GACvBnJ,KAAK8J,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKwC,IAAQ,GACvBtJ,KAAK8J,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKuC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK8C,IAAQ,GACvBzJ,KAAK8J,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS/K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKoD,IAAQ,GACvB5J,KAAK8J,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKhC,KAAK8J,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKa,IACR1I,KAAK8J,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK5D,KAAK8J,KAAKhC,EAAKY,GACpB1G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKmB,IAAQ,GACvB7I,KAAK8J,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKkB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKyB,IAAQ,GACvBhJ,KAAK8J,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK+B,IAAQ,GACvBnJ,KAAK8J,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKqC,IAAQ,GACvBtJ,KAAK8J,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKoC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK2C,IAAQ,GACvBzJ,KAAK8J,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAShL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKiD,IAAQ,GACvB5J,KAAK8J,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKhC,KAAK8J,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKgB,KACR7I,KAAK8J,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK5D,KAAK8J,KAAKhC,EAAKe,IACpB7G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKsB,IAAQ,GACvBhJ,KAAK8J,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKqB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK4B,IAAQ,GACvBnJ,KAAK8J,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKkC,IAAQ,GACvBtJ,KAAK8J,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKiC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKwC,IAAQ,GACvBzJ,KAAK8J,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASjL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK8C,IAAQ,GACvB5J,KAAK8J,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKhC,KAAK8J,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKmB,KACRhJ,KAAK8J,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK5D,KAAK8J,KAAKhC,EAAKkB,IACpBhH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKyB,IAAQ,GACvBnJ,KAAK8J,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKwB,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK+B,IAAQ,GACvBtJ,KAAK8J,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK8B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKqC,IAAQ,GACvBzJ,KAAK8J,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASlL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK2C,IAAQ,GACvB5J,KAAK8J,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKhC,KAAK8J,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKsB,KACRnJ,KAAK8J,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK5D,KAAK8J,KAAKhC,EAAKqB,IACpBnH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK4B,IAAQ,GACvBtJ,KAAK8J,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK2B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKkC,IAAQ,GACvBzJ,KAAK8J,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASnL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKwC,IAAQ,GACvB5J,KAAK8J,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKhC,KAAK8J,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKyB,KACRtJ,KAAK8J,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK5D,KAAK8J,KAAKhC,EAAKwB,IACpBtH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK+B,IAAQ,GACvBzJ,KAAK8J,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASpL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKqC,IAAQ,GACvB5J,KAAK8J,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKhC,KAAK8J,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK4B,KACRzJ,KAAK8J,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK5D,KAAK8J,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASrL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKkC,IAAQ,GACvB5J,KAAK8J,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAStL,GAJbsC,EAAKhC,KAAK8J,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK+B,KACR5J,KAAK8J,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAjK,IAFAkE,EAAK5D,KAAK8J,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANtL,IACFsG,EAAE,IAAMtG,EACR1N,EAAIxB,UAECwB,GAiDT,SAASiZ,EAAYpJ,EAAM/M,EAAK9C,GAE9B,OADW,IAAIkZ,GACHC,KAAKtJ,EAAM/M,EAAK9C,GAsB9B,SAASkZ,EAAME,EAAGC,GAChBnc,KAAKkc,EAAIA,EACTlc,KAAKmc,EAAIA,EAvENrL,KAAK8J,OACRhE,EAAclE,GAiDhB7C,EAAG5P,UAAUmc,MAAQ,SAAgBxW,EAAK9C,GACxC,IAAIN,EACA4I,EAAMpL,KAAKsB,OAASsE,EAAItE,OAW5B,OATEkB,EADkB,KAAhBxC,KAAKsB,QAAgC,KAAfsE,EAAItE,OACtBsV,EAAY5W,KAAM4F,EAAK9C,GACpBsI,EAAM,GACTsH,EAAW1S,KAAM4F,EAAK9C,GACnBsI,EAAM,KArDnB,SAAmBuH,EAAM/M,EAAK9C,GAC5BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnCnN,EAAIxB,OAASqR,EAAKrR,OAASsE,EAAItE,OAI/B,IAFA,IAAIyR,EAAQ,EACRsJ,EAAU,EACLrJ,EAAI,EAAGA,EAAIlQ,EAAIxB,OAAS,EAAG0R,IAAK,CAGvC,IAAIC,EAASoJ,EACbA,EAAU,EAGV,IAFA,IAAInJ,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAI2H,EAAI1H,EAGRqF,GAFoB,EAAhBgC,EAAKzC,MAAM7E,KACI,EAAfzF,EAAIsK,MAAM5E,IAGdwH,EAAS,SAAJnC,EAGTuC,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBmJ,IAFApJ,GAHAA,EAAUA,GAAWtC,EAAI,SAAa,GAAM,IAGxBmC,IAAO,IAAO,KAEZ,GACtBG,GAAU,SAEZnQ,EAAIoN,MAAM8C,GAAKE,EACfH,EAAQE,EACRA,EAASoJ,EAQX,OANc,IAAVtJ,EACFjQ,EAAIoN,MAAM8C,GAAKD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAgBH4K,CAAStc,KAAM4F,EAAK9C,GAEpBiZ,EAAW/b,KAAM4F,EAAK9C,GAGvBN,GAWTwZ,EAAK/b,UAAUsc,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAI7S,MAAM8a,GACdC,EAAI5M,EAAG5P,UAAUqU,WAAWkI,GAAK,EAC5BnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBkJ,EAAElJ,GAAKrL,KAAK0c,OAAOrR,EAAGoR,EAAGD,GAG3B,OAAOjI,GAITyH,EAAK/b,UAAUyc,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAtR,EAAI,EAAGA,EAAIoR,EAAGpR,IACrBsR,IAAW,EAAJT,IAAWO,EAAIpR,EAAI,EAC1B6Q,IAAM,EAGR,OAAOS,GAKTX,EAAK/b,UAAU2c,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAGnR,IACrB2R,EAAK3R,GAAKyR,EAAID,EAAIxR,IAClB4R,EAAK5R,GAAK0R,EAAIF,EAAIxR,KAItB2Q,EAAK/b,UAAUid,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE7c,KAAK4c,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQtM,KAAKuM,IAAI,EAAIvM,KAAKwM,GAAKb,GAC/Bc,EAAQzM,KAAK0M,IAAI,EAAI1M,KAAKwM,GAAKb,GAE1BjN,EAAI,EAAGA,EAAIgN,EAAGhN,GAAKiN,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJjS,EAAI,EAAGA,EAAI6R,EAAG7R,IAAK,CAC1B,IAAImC,EAAKuP,EAAKxN,EAAIlE,GACdqS,EAAKV,EAAKzN,EAAIlE,GAEdsS,EAAKZ,EAAKxN,EAAIlE,EAAI6R,GAClBU,EAAKZ,EAAKzN,EAAIlE,EAAI6R,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAKxN,EAAIlE,GAAKmC,EAAKmQ,EACnBX,EAAKzN,EAAIlE,GAAKqS,EAAKE,EAEnBb,EAAKxN,EAAIlE,EAAI6R,GAAK1P,EAAKmQ,EACvBX,EAAKzN,EAAIlE,EAAI6R,GAAKQ,EAAKE,EAGnBvS,IAAMmR,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB9B,EAAK/b,UAAU8d,YAAc,SAAsBC,EAAGjf,GACpD,IAAIyd,EAAqB,EAAjB1L,KAAKC,IAAIhS,EAAGif,GAChBC,EAAU,EAAJzB,EACNnR,EAAI,EACR,IAAKmR,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BnR,IAGF,OAAO,GAAKA,EAAI,EAAI4S,GAGtBjC,EAAK/b,UAAUie,UAAY,SAAoBpB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAIkJ,EAAIuI,EAAIzR,GAEZyR,EAAIzR,GAAKyR,EAAIN,EAAInR,EAAI,GACrByR,EAAIN,EAAInR,EAAI,GAAKkJ,EAEjBA,EAAIwI,EAAI1R,GAER0R,EAAI1R,IAAM0R,EAAIP,EAAInR,EAAI,GACtB0R,EAAIP,EAAInR,EAAI,IAAMkJ,IAItByH,EAAK/b,UAAUke,aAAe,SAAuBC,EAAI5B,GAEvD,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAImG,EAAoC,KAAhCV,KAAKuN,MAAMD,EAAG,EAAI/S,EAAI,GAAKmR,GACjC1L,KAAKuN,MAAMD,EAAG,EAAI/S,GAAKmR,GACvBzJ,EAEFqL,EAAG/S,GAAS,SAAJmG,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO4M,GAGTpC,EAAK/b,UAAUqe,WAAa,SAAqBF,EAAIhT,EAAK0R,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAID,EAAKC,IACvB0H,GAAyB,EAARqL,EAAG/S,GAEpByR,EAAI,EAAIzR,GAAa,KAAR0H,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAIzR,EAAI,GAAa,KAAR0H,EAAgBA,KAAkB,GAIrD,IAAK1H,EAAI,EAAID,EAAKC,EAAImR,IAAKnR,EACzByR,EAAIzR,GAAK,EAGXjI,EAAiB,IAAV2P,GACP3P,EAA6B,KAAb,KAAR2P,KAGViJ,EAAK/b,UAAUse,KAAO,SAAe/B,GAEnC,IADA,IAAIgC,EAAK,IAAI9c,MAAM8a,GACVnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBmT,EAAGnT,GAAK,EAGV,OAAOmT,GAGTxC,EAAK/b,UAAUgc,KAAO,SAAeC,EAAGC,EAAGrZ,GACzC,IAAI0Z,EAAI,EAAIxc,KAAK+d,YAAY7B,EAAE5a,OAAQ6a,EAAE7a,QAErCub,EAAM7c,KAAKuc,QAAQC,GAEnBiC,EAAIze,KAAKue,KAAK/B,GAEdM,EAAM,IAAIpb,MAAM8a,GAChBkC,EAAO,IAAIhd,MAAM8a,GACjBmC,EAAO,IAAIjd,MAAM8a,GAEjBoC,EAAO,IAAIld,MAAM8a,GACjBqC,EAAQ,IAAInd,MAAM8a,GAClBsC,EAAQ,IAAIpd,MAAM8a,GAElBuC,EAAOjc,EAAIoN,MACf6O,EAAKzd,OAASkb,EAEdxc,KAAKse,WAAWpC,EAAEhM,MAAOgM,EAAE5a,OAAQwb,EAAKN,GACxCxc,KAAKse,WAAWnC,EAAEjM,MAAOiM,EAAE7a,OAAQsd,EAAMpC,GAEzCxc,KAAKkd,UAAUJ,EAAK2B,EAAGC,EAAMC,EAAMnC,EAAGK,GACtC7c,KAAKkd,UAAU0B,EAAMH,EAAGI,EAAOC,EAAOtC,EAAGK,GAEzC,IAAK,IAAIxR,EAAI,EAAGA,EAAImR,EAAGnR,IAAK,CAC1B,IAAIyS,EAAKY,EAAKrT,GAAKwT,EAAMxT,GAAKsT,EAAKtT,GAAKyT,EAAMzT,GAC9CsT,EAAKtT,GAAKqT,EAAKrT,GAAKyT,EAAMzT,GAAKsT,EAAKtT,GAAKwT,EAAMxT,GAC/CqT,EAAKrT,GAAKyS,EAUZ,OAPA9d,KAAKke,UAAUQ,EAAMC,EAAMnC,GAC3Bxc,KAAKkd,UAAUwB,EAAMC,EAAMI,EAAMN,EAAGjC,EAAGK,GACvC7c,KAAKke,UAAUa,EAAMN,EAAGjC,GACxBxc,KAAKme,aAAaY,EAAMvC,GAExB1Z,EAAImN,SAAWiM,EAAEjM,SAAWkM,EAAElM,SAC9BnN,EAAIxB,OAAS4a,EAAE5a,OAAS6a,EAAE7a,OACnBwB,EAAI4O,SAIb7B,EAAG5P,UAAU4Q,IAAM,SAAcjL,GAC/B,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCtB,KAAKoc,MAAMxW,EAAK9C,IAIzB+M,EAAG5P,UAAU+e,KAAO,SAAepZ,GACjC,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCya,EAAW/b,KAAM4F,EAAK9C,IAI/B+M,EAAG5P,UAAU2a,KAAO,SAAehV,GACjC,OAAO5F,KAAK2E,QAAQyX,MAAMxW,EAAK5F,OAGjC6P,EAAG5P,UAAU+R,MAAQ,SAAgBpM,GACnCxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UAIb,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAUzF,EAC1BkN,GAAU,SAAJtB,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASD,IAAO,GAChB9S,KAAKkQ,MAAM7E,GAAU,SAALyH,EAQlB,OALc,IAAVC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAGAtB,MAGT6P,EAAG5P,UAAUgf,KAAO,SAAerZ,GACjC,OAAO5F,KAAK2E,QAAQqN,MAAMpM,IAI5BiK,EAAG5P,UAAUif,IAAM,WACjB,OAAOlf,KAAK6Q,IAAI7Q,OAIlB6P,EAAG5P,UAAUkf,KAAO,WAClB,OAAOnf,KAAK4a,KAAK5a,KAAK2E,UAIxBkL,EAAG5P,UAAUiS,IAAM,SAActM,GAC/B,IAAI4L,EAxxCN,SAAqB5L,GAGnB,IAFA,IAAI4L,EAAI,IAAI9P,MAAMkE,EAAI6O,aAEb6B,EAAM,EAAGA,EAAM9E,EAAElQ,OAAQgV,IAAO,CACvC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB9E,EAAE8E,IAAQ1Q,EAAIsK,MAAMuB,GAAQ,GAAK8E,KAAWA,EAG9C,OAAO/E,EA8wCC4N,CAAWxZ,GACnB,GAAiB,IAAb4L,EAAElQ,OAAc,OAAO,IAAIuO,EAAG,GAIlC,IADA,IAAIrN,EAAMxC,KACDqL,EAAI,EAAGA,EAAImG,EAAElQ,QACP,IAATkQ,EAAEnG,GADsBA,IAAK7I,EAAMA,EAAI0c,OAI7C,KAAM7T,EAAImG,EAAElQ,OACV,IAAK,IAAI4S,EAAI1R,EAAI0c,MAAO7T,EAAImG,EAAElQ,OAAQ+J,IAAK6I,EAAIA,EAAEgL,MAClC,IAAT1N,EAAEnG,KAEN7I,EAAMA,EAAIqO,IAAIqD,IAIlB,OAAO1R,GAITqN,EAAG5P,UAAUof,OAAS,SAAiBC,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAGIjU,EAHAsF,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GACjB4O,EAAa,WAAe,GAAK5O,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoC,EAAQ,EAEZ,IAAK1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAChC,IAAImU,EAAWxf,KAAKkQ,MAAM7E,GAAKkU,EAC3B/O,GAAsB,EAAhBxQ,KAAKkQ,MAAM7E,IAAUmU,GAAa7O,EAC5C3Q,KAAKkQ,MAAM7E,GAAKmF,EAAIuC,EACpBA,EAAQyM,IAAc,GAAK7O,EAGzBoC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAIT,GAAU,IAAN6b,EAAS,CACX,IAAK9R,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAChCrL,KAAKkQ,MAAM7E,EAAI8R,GAAKnd,KAAKkQ,MAAM7E,GAGjC,IAAKA,EAAI,EAAGA,EAAI8R,EAAG9R,IACjBrL,KAAKkQ,MAAM7E,GAAK,EAGlBrL,KAAKsB,QAAU6b,EAGjB,OAAOnd,KAAK0R,SAGd7B,EAAG5P,UAAUwf,MAAQ,SAAgBH,GAGnC,OADAlc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKqf,OAAOC,IAMrBzP,EAAG5P,UAAUmU,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJxc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/O,EAAI2O,EAAO,GACXnC,EAAIrM,KAAK/D,KAAKuS,EAAO3O,GAAK,GAAI3Q,KAAKsB,QACnCue,EAAO,SAAc,WAAclP,GAAMA,EACzCmP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAI9O,KAAKC,IAAI,EAAG6O,GAGZE,EAAa,CACf,IAAK,IAAIzU,EAAI,EAAGA,EAAI8R,EAAG9R,IACrByU,EAAY5P,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAEpCyU,EAAYxe,OAAS6b,EAGvB,GAAU,IAANA,QAEG,GAAInd,KAAKsB,OAAS6b,EAEvB,IADAnd,KAAKsB,QAAU6b,EACV9R,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC3BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,EAAI8R,QAGjCnd,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,EAGhB,IAAIyR,EAAQ,EACZ,IAAK1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,IAAgB,IAAV0H,GAAe1H,GAAKuU,GAAIvU,IAAK,CAChE,IAAI0G,EAAuB,EAAhB/R,KAAKkQ,MAAM7E,GACtBrL,KAAKkQ,MAAM7E,GAAM0H,GAAU,GAAKpC,EAAOoB,IAASpB,EAChDoC,EAAQhB,EAAO8N,EAajB,OATIC,GAAyB,IAAV/M,IACjB+M,EAAY5P,MAAM4P,EAAYxe,UAAYyR,GAGxB,IAAhB/S,KAAKsB,SACPtB,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,GAGTtB,KAAK0R,SAGd7B,EAAG5P,UAAU8f,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAvc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKoU,OAAOkL,EAAMI,EAAMC,IAIjC9P,EAAG5P,UAAU+f,KAAO,SAAeV,GACjC,OAAOtf,KAAK2E,QAAQ8a,MAAMH,IAG5BzP,EAAG5P,UAAUggB,MAAQ,SAAgBX,GACnC,OAAOtf,KAAK2E,QAAQ0a,OAAOC,IAI7BzP,EAAG5P,UAAUigB,KAAO,SAAeZ,GACjC,OAAOtf,KAAK2E,QAAQob,MAAMT,IAG5BzP,EAAG5P,UAAUkgB,MAAQ,SAAgBb,GACnC,OAAOtf,KAAK2E,QAAQyP,OAAOkL,IAI7BzP,EAAG5P,UAAUiV,MAAQ,SAAgBoB,GACnClT,EAAsB,iBAARkT,GAAoBA,GAAO,GACzC,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,QAAI3Q,KAAKsB,QAAU6b,KAGXnd,KAAKkQ,MAAMiN,GAELjJ,KAIhBrE,EAAG5P,UAAUmgB,OAAS,SAAiBd,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAAI3O,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GAIrB,GAFAvN,EAAyB,IAAlBpD,KAAKiQ,SAAgB,2CAExBjQ,KAAKsB,QAAU6b,EACjB,OAAOnd,KAQT,GALU,IAAN2Q,GACFwM,IAEFnd,KAAKsB,OAASwP,KAAK/D,IAAIoQ,EAAGnd,KAAKsB,QAErB,IAANqP,EAAS,CACX,IAAIkP,EAAO,SAAc,WAAclP,GAAMA,EAC7C3Q,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IAAMue,EAGjC,OAAO7f,KAAK0R,SAId7B,EAAG5P,UAAUogB,MAAQ,SAAgBf,GACnC,OAAOtf,KAAK2E,QAAQyb,OAAOd,IAI7BzP,EAAG5P,UAAU+U,MAAQ,SAAgBpP,GAGnC,OAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAU5F,KAAKsgB,OAAO1a,GAGV,IAAlB5F,KAAKiQ,SACa,IAAhBjQ,KAAKsB,SAAiC,EAAhBtB,KAAKkQ,MAAM,IAAUtK,GAC7C5F,KAAKkQ,MAAM,GAAKtK,GAAuB,EAAhB5F,KAAKkQ,MAAM,IAClClQ,KAAKiQ,SAAW,EACTjQ,OAGTA,KAAKiQ,SAAW,EAChBjQ,KAAKsgB,MAAM1a,GACX5F,KAAKiQ,SAAW,EACTjQ,MAIFA,KAAKiS,OAAOrM,IAGrBiK,EAAG5P,UAAUgS,OAAS,SAAiBrM,GACrC5F,KAAKkQ,MAAM,IAAMtK,EAGjB,IAAK,IAAIyF,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,IAAM,SAAWA,IAC7DrL,KAAKkQ,MAAM7E,IAAM,SACbA,IAAMrL,KAAKsB,OAAS,EACtBtB,KAAKkQ,MAAM7E,EAAI,GAAK,EAEpBrL,KAAKkQ,MAAM7E,EAAI,KAKnB,OAFArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,EAAI,GAEjCrL,MAIT6P,EAAG5P,UAAUqgB,MAAQ,SAAgB1a,GAGnC,GAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAG,OAAO5F,KAAKgV,OAAOpP,GAEhC,GAAsB,IAAlB5F,KAAKiQ,SAIP,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKgV,MAAMpP,GACX5F,KAAKiQ,SAAW,EACTjQ,KAKT,GAFAA,KAAKkQ,MAAM,IAAMtK,EAEG,IAAhB5F,KAAKsB,QAAgBtB,KAAKkQ,MAAM,GAAK,EACvClQ,KAAKkQ,MAAM,IAAMlQ,KAAKkQ,MAAM,GAC5BlQ,KAAKiQ,SAAW,OAGhB,IAAK,IAAI5E,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,GAAK,EAAGA,IACpDrL,KAAKkQ,MAAM7E,IAAM,SACjBrL,KAAKkQ,MAAM7E,EAAI,IAAM,EAIzB,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUsgB,KAAO,SAAe3a,GACjC,OAAO5F,KAAK2E,QAAQqQ,MAAMpP,IAG5BiK,EAAG5P,UAAUugB,KAAO,SAAe5a,GACjC,OAAO5F,KAAK2E,QAAQ2b,MAAM1a,IAG5BiK,EAAG5P,UAAUwgB,KAAO,WAGlB,OAFAzgB,KAAKiQ,SAAW,EAETjQ,MAGT6P,EAAG5P,UAAU6U,IAAM,WACjB,OAAO9U,KAAK2E,QAAQ8b,QAGtB5Q,EAAG5P,UAAUygB,aAAe,SAAuB9a,EAAKiL,EAAK8P,GAC3D,IACItV,EAIAmG,EALApG,EAAMxF,EAAItE,OAASqf,EAGvB3gB,KAAKoS,QAAQhH,GAGb,IAAI2H,EAAQ,EACZ,IAAK1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CAC/BmG,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,EAClC,IAAI9B,GAAwB,EAAfrL,EAAIsK,MAAM7E,IAAUwF,EAEjCkC,IADAvB,GAAa,SAARP,IACS,KAAQA,EAAQ,SAAa,GAC3CjR,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAE1B,KAAOnG,EAAIrL,KAAKsB,OAASqf,EAAOtV,IAE9B0H,GADAvB,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,IACrB,GACb/S,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAG1B,GAAc,IAAVuB,EAAa,OAAO/S,KAAK0R,QAK7B,IAFAtO,GAAkB,IAAX2P,GACPA,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAE3B0H,GADAvB,IAAsB,EAAhBxR,KAAKkQ,MAAM7E,IAAU0H,IACd,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJmG,EAIlB,OAFAxR,KAAKiQ,SAAW,EAETjQ,KAAK0R,SAGd7B,EAAG5P,UAAU2gB,SAAW,SAAmBhb,EAAKib,GAC9C,IAAIF,GAAQ3gB,KAAKsB,OAASsE,EAAItE,QAE1BsR,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAGJkb,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,GAGf,IADdqf,EAAQ,GADM3gB,KAAKsU,WAAWwM,MAG5BjO,EAAIA,EAAEoN,MAAMU,GACZ/N,EAAEyM,OAAOsB,GACTG,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,IAI3B,IACI4S,EADAnV,EAAI6T,EAAEtR,OAASuR,EAAEvR,OAGrB,GAAa,QAATuf,EAAgB,EAClB3M,EAAI,IAAIrE,EAAG,OACTvO,OAASvC,EAAI,EACfmV,EAAEhE,MAAQ,IAAIxO,MAAMwS,EAAE5S,QACtB,IAAK,IAAI+J,EAAI,EAAGA,EAAI6I,EAAE5S,OAAQ+J,IAC5B6I,EAAEhE,MAAM7E,GAAK,EAIjB,IAAI0V,EAAOnO,EAAEjO,QAAQ+b,aAAa7N,EAAG,EAAG9T,GAClB,IAAlBgiB,EAAK9Q,WACP2C,EAAImO,EACA7M,IACFA,EAAEhE,MAAMnR,GAAK,IAIjB,IAAK,IAAIuM,EAAIvM,EAAI,EAAGuM,GAAK,EAAGA,IAAK,CAC/B,IAAI0V,EAAmC,UAAL,EAAxBpO,EAAE1C,MAAM2C,EAAEvR,OAASgK,KACE,EAA5BsH,EAAE1C,MAAM2C,EAAEvR,OAASgK,EAAI,IAO1B,IAHA0V,EAAKlQ,KAAK/D,IAAKiU,EAAKF,EAAO,EAAG,UAE9BlO,EAAE8N,aAAa7N,EAAGmO,EAAI1V,GACA,IAAfsH,EAAE3C,UACP+Q,IACApO,EAAE3C,SAAW,EACb2C,EAAE8N,aAAa7N,EAAG,EAAGvH,GAChBsH,EAAEW,WACLX,EAAE3C,UAAY,GAGdiE,IACFA,EAAEhE,MAAM5E,GAAK0V,GAajB,OAVI9M,GACFA,EAAExC,QAEJkB,EAAElB,QAGW,QAATmP,GAA4B,IAAVF,GACpB/N,EAAEwB,OAAOuM,GAGJ,CACLM,IAAK/M,GAAK,KACVpC,IAAKc,IAQT/C,EAAG5P,UAAUihB,OAAS,SAAiBtb,EAAKib,EAAMM,GAGhD,OAFA/d,GAAQwC,EAAI2N,UAERvT,KAAKuT,SACA,CACL0N,IAAK,IAAIpR,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB7P,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAKib,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGH,QAATuL,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI0E,KAAK5Q,IAIN,CACLqb,IAAKA,EACLnP,IAAKA,IAIa,IAAlB9R,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKkhB,OAAOtb,EAAI0P,MAAOuL,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGT,CACL2L,IAAKA,EACLnP,IAAKtP,EAAIsP,MAI0B,IAAlC9R,KAAKiQ,SAAWrK,EAAIqK,WACvBzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAI0P,MAAOuL,GAEtB,QAATA,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI2E,KAAK7Q,IAIN,CACLqb,IAAKze,EAAIye,IACTnP,IAAKA,IAOLlM,EAAItE,OAAStB,KAAKsB,QAAUtB,KAAKkR,IAAItL,GAAO,EACvC,CACLqb,IAAK,IAAIpR,EAAG,GACZiC,IAAK9R,MAKU,IAAf4F,EAAItE,OACO,QAATuf,EACK,CACLI,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,MAII,QAAT+O,EACK,CACLI,IAAK,KACLnP,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7B,CACL+Q,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7BlQ,KAAK4gB,SAAShb,EAAKib,GAlF1B,IAAII,EAAKnP,EAAKtP,GAsFhBqN,EAAG5P,UAAUghB,IAAM,SAAcrb,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOqb,KAIxCpR,EAAG5P,UAAU6R,IAAM,SAAclM,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOkM,KAGxCjC,EAAG5P,UAAUohB,KAAO,SAAezb,GACjC,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAMkM,KAIvCjC,EAAG5P,UAAUqhB,SAAW,SAAmB1b,GACzC,IAAI2b,EAAKvhB,KAAKkhB,OAAOtb,GAGrB,GAAI2b,EAAGzP,IAAIyB,SAAU,OAAOgO,EAAGN,IAE/B,IAAInP,EAA0B,IAApByP,EAAGN,IAAIhR,SAAiBsR,EAAGzP,IAAI2E,KAAK7Q,GAAO2b,EAAGzP,IAEpD0P,EAAO5b,EAAIua,MAAM,GACjBsB,EAAK7b,EAAIuO,MAAM,GACfjD,EAAMY,EAAIZ,IAAIsQ,GAGlB,OAAItQ,EAAM,GAAY,IAAPuQ,GAAoB,IAARvQ,EAAkBqQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAG5P,UAAUuT,KAAO,SAAe5N,GACjCxC,EAAOwC,GAAO,UAId,IAHA,IAAI4J,GAAK,GAAK,IAAM5J,EAEhB8b,EAAM,EACDrW,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IACpCqW,GAAOlS,EAAIkS,GAAuB,EAAhB1hB,KAAKkQ,MAAM7E,KAAWzF,EAG1C,OAAO8b,GAIT7R,EAAG5P,UAAUwT,MAAQ,SAAgB7N,GACnCxC,EAAOwC,GAAO,UAGd,IADA,IAAImN,EAAQ,EACH1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAkB,SAAR0H,EAC9B/S,KAAKkQ,MAAM7E,GAAMmG,EAAI5L,EAAO,EAC5BmN,EAAQvB,EAAI5L,EAGd,OAAO5F,KAAK0R,SAGd7B,EAAG5P,UAAUmhB,KAAO,SAAexb,GACjC,OAAO5F,KAAK2E,QAAQ8O,MAAM7N,IAG5BiK,EAAG5P,UAAU0hB,KAAO,SAAenS,GACjCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAI2I,EAAIlc,KACJmc,EAAI3M,EAAE7K,QAGRuX,EADiB,IAAfA,EAAEjM,SACAiM,EAAEmF,KAAK7R,GAEP0M,EAAEvX,QAaR,IATA,IAAIid,EAAI,IAAI/R,EAAG,GACXgS,EAAI,IAAIhS,EAAG,GAGXiS,EAAI,IAAIjS,EAAG,GACXkS,EAAI,IAAIlS,EAAG,GAEXmS,EAAI,EAED9F,EAAE+F,UAAY9F,EAAE8F,UACrB/F,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP4N,EAMJ,IAHA,IAAIE,EAAK/F,EAAExX,QACPwd,EAAKjG,EAAEvX,SAEHuX,EAAE3I,UAAU,CAClB,IAAK,IAAIlI,EAAI,EAAG+W,EAAK,EAAyB,IAArBlG,EAAEhM,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADA6Q,EAAE9H,OAAO/I,GACFA,KAAM,IACPuW,EAAES,SAAWR,EAAEQ,WACjBT,EAAEpL,KAAK0L,GACPL,EAAEpL,KAAK0L,IAGTP,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIb,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBnG,EAAEjM,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADA6Q,EAAE/H,OAAO9I,GACFA,KAAM,IACPwW,EAAEO,SAAWN,EAAEM,WACjBP,EAAEtL,KAAK0L,GACPH,EAAEtL,KAAK0L,IAGTL,EAAE1N,OAAO,GACT2N,EAAE3N,OAAO,GAIT8H,EAAEhL,IAAIiL,IAAM,GACdD,EAAEzF,KAAK0F,GACPyF,EAAEnL,KAAKqL,GACPD,EAAEpL,KAAKsL,KAEP5F,EAAE1F,KAAKyF,GACP4F,EAAErL,KAAKmL,GACPG,EAAEtL,KAAKoL,IAIX,MAAO,CACLjP,EACAC,EAAGkP,EACHQ,IAAKpG,EAAEkD,OAAO2C,KAOlBnS,EAAG5P,UAAUuiB,OAAS,SAAiBhT,GACrCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAIX,EAAI5S,KACJ6S,EAAIrD,EAAE7K,QAGRiO,EADiB,IAAfA,EAAE3C,SACA2C,EAAEyO,KAAK7R,GAEPoD,EAAEjO,QAQR,IALA,IAuCInC,EAvCAigB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ9P,EAAElO,QAEPiO,EAAEgQ,KAAK,GAAK,GAAK/P,EAAE+P,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIvX,EAAI,EAAG+W,EAAK,EAAyB,IAArBxP,EAAE1C,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADAuH,EAAEwB,OAAO/I,GACFA,KAAM,GACPoX,EAAGJ,SACLI,EAAGjM,KAAKmM,GAGVF,EAAGrO,OAAO,GAId,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBzP,EAAE3C,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADAuH,EAAEuB,OAAO9I,GACFA,KAAM,GACPoX,EAAGL,SACLK,EAAGlM,KAAKmM,GAGVD,EAAGtO,OAAO,GAIVxB,EAAE1B,IAAI2B,IAAM,GACdD,EAAE6D,KAAK5D,GACP4P,EAAGhM,KAAKiM,KAER7P,EAAE4D,KAAK7D,GACP8P,EAAGjM,KAAKgM,IAeZ,OATEjgB,EADgB,IAAdoQ,EAAEgQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKhH,GAGJhN,GAGTqN,EAAG5P,UAAUsiB,IAAM,SAAc3c,GAC/B,GAAI5F,KAAKuT,SAAU,OAAO3N,EAAIkP,MAC9B,GAAIlP,EAAI2N,SAAU,OAAOvT,KAAK8U,MAE9B,IAAIlC,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAAIjB,QACZiO,EAAE3C,SAAW,EACb4C,EAAE5C,SAAW,EAGb,IAAK,IAAI0Q,EAAQ,EAAG/N,EAAEqP,UAAYpP,EAAEoP,SAAUtB,IAC5C/N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,OAAG,CACD,KAAOxB,EAAEqP,UACPrP,EAAEwB,OAAO,GAEX,KAAOvB,EAAEoP,UACPpP,EAAEuB,OAAO,GAGX,IAAIzD,EAAIiC,EAAE1B,IAAI2B,GACd,GAAIlC,EAAI,EAAG,CAET,IAAI4D,EAAI3B,EACRA,EAAIC,EACJA,EAAI0B,OACC,GAAU,IAAN5D,GAAyB,IAAdkC,EAAE+P,KAAK,GAC3B,MAGFhQ,EAAE6D,KAAK5D,GAGT,OAAOA,EAAEwM,OAAOsB,IAIlB9Q,EAAG5P,UAAU4iB,KAAO,SAAejd,GACjC,OAAO5F,KAAK2hB,KAAK/b,GAAKgN,EAAEyO,KAAKzb,IAG/BiK,EAAG5P,UAAUgiB,OAAS,WACpB,OAA+B,IAAP,EAAhBjiB,KAAKkQ,MAAM,KAGrBL,EAAG5P,UAAUoiB,MAAQ,WACnB,OAA+B,IAAP,EAAhBriB,KAAKkQ,MAAM,KAIrBL,EAAG5P,UAAUkU,MAAQ,SAAgBvO,GACnC,OAAO5F,KAAKkQ,MAAM,GAAKtK,GAIzBiK,EAAG5P,UAAU6iB,MAAQ,SAAgBxM,GACnClT,EAAsB,iBAARkT,GACd,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,GAAI3Q,KAAKsB,QAAU6b,EAGjB,OAFAnd,KAAKoS,QAAQ+K,EAAI,GACjBnd,KAAKkQ,MAAMiN,IAAMjJ,EACVlU,KAKT,IADA,IAAI+S,EAAQmB,EACH7I,EAAI8R,EAAa,IAAVpK,GAAe1H,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACnD,IAAImG,EAAoB,EAAhBxR,KAAKkQ,MAAM7E,GAEnB0H,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACLxR,KAAKkQ,MAAM7E,GAAKmG,EAMlB,OAJc,IAAVuB,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAEAtB,MAGT6P,EAAG5P,UAAUsT,OAAS,WACpB,OAAuB,IAAhBvT,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,IAGzCL,EAAG5P,UAAU2iB,KAAO,SAAehd,GACjC,IAOIpD,EAPAyN,EAAWrK,EAAM,EAErB,GAAsB,IAAlB5F,KAAKiQ,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBjQ,KAAKiQ,UAAkBA,EAAU,OAAO,EAK5C,GAHAjQ,KAAK0R,QAGD1R,KAAKsB,OAAS,EAChBkB,EAAM,MACD,CACDyN,IACFrK,GAAOA,GAGTxC,EAAOwC,GAAO,SAAW,qBAEzB,IAAI4L,EAAoB,EAAhBxR,KAAKkQ,MAAM,GACnB1N,EAAMgP,IAAM5L,EAAM,EAAI4L,EAAI5L,GAAO,EAAI,EAEvC,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAOTqN,EAAG5P,UAAUiR,IAAM,SAActL,GAC/B,GAAsB,IAAlB5F,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAQ,EACvD,GAAsB,IAAlBjQ,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAO,EAEtD,IAAIzN,EAAMxC,KAAK+iB,KAAKnd,GACpB,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAITqN,EAAG5P,UAAU8iB,KAAO,SAAend,GAEjC,GAAI5F,KAAKsB,OAASsE,EAAItE,OAAQ,OAAO,EACrC,GAAItB,KAAKsB,OAASsE,EAAItE,OAAQ,OAAQ,EAGtC,IADA,IAAIkB,EAAM,EACD6I,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAIuH,EAAoB,EAAhB5S,KAAKkQ,MAAM7E,GACfwH,EAAmB,EAAfjN,EAAIsK,MAAM7E,GAElB,GAAIuH,IAAMC,EAAV,CACID,EAAIC,EACNrQ,GAAO,EACEoQ,EAAIC,IACbrQ,EAAM,GAER,OAEF,OAAOA,GAGTqN,EAAG5P,UAAU+iB,IAAM,SAAcpd,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUgjB,GAAK,SAAard,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUijB,KAAO,SAAetd,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUkjB,IAAM,SAAcvd,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUmjB,IAAM,SAAcxd,GAC/B,OAA2B,IAApB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUojB,GAAK,SAAazd,GAC7B,OAA0B,IAAnB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUqjB,KAAO,SAAe1d,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUsjB,IAAM,SAAc3d,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUujB,IAAM,SAAc5d,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUwjB,GAAK,SAAa7d,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAOlBiK,EAAGM,IAAM,SAAcvK,GACrB,OAAO,IAAI8d,EAAI9d,IAGjBiK,EAAG5P,UAAU0jB,MAAQ,SAAgBC,GAGnC,OAFAxgB,GAAQpD,KAAKmQ,IAAK,yCAClB/M,EAAyB,IAAlBpD,KAAKiQ,SAAgB,iCACrB2T,EAAIC,UAAU7jB,MAAM8jB,UAAUF,IAGvC/T,EAAG5P,UAAU8jB,QAAU,WAErB,OADA3gB,EAAOpD,KAAKmQ,IAAK,wDACVnQ,KAAKmQ,IAAI6T,YAAYhkB,OAG9B6P,EAAG5P,UAAU6jB,UAAY,SAAoBF,GAE3C,OADA5jB,KAAKmQ,IAAMyT,EACJ5jB,MAGT6P,EAAG5P,UAAUgkB,SAAW,SAAmBL,GAEzC,OADAxgB,GAAQpD,KAAKmQ,IAAK,yCACXnQ,KAAK8jB,UAAUF,IAGxB/T,EAAG5P,UAAUikB,OAAS,SAAiBte,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIuG,IAAI1W,KAAM4F,IAG5BiK,EAAG5P,UAAUkkB,QAAU,SAAkBve,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIqG,KAAKxW,KAAM4F,IAG7BiK,EAAG5P,UAAUmkB,OAAS,SAAiBxe,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIwG,IAAI3W,KAAM4F,IAG5BiK,EAAG5P,UAAUokB,QAAU,SAAkBze,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIsG,KAAKzW,KAAM4F,IAG7BiK,EAAG5P,UAAUqkB,OAAS,SAAiB1e,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIoU,IAAIvkB,KAAM4F,IAG5BiK,EAAG5P,UAAUukB,OAAS,SAAiB5e,GAGrC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIU,IAAI7Q,KAAM4F,IAG5BiK,EAAG5P,UAAUykB,QAAU,SAAkB9e,GAGvC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIyK,KAAK5a,KAAM4F,IAG7BiK,EAAG5P,UAAU0kB,OAAS,WAGpB,OAFAvhB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+O,IAAIlf,OAGtB6P,EAAG5P,UAAU4kB,QAAU,WAGrB,OAFAzhB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAIgP,KAAKnf,OAIvB6P,EAAG5P,UAAU6kB,QAAU,WAGrB,OAFA1hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI4U,KAAK/kB,OAGvB6P,EAAG5P,UAAU+kB,QAAU,WAGrB,OAFA5hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI0S,KAAK7iB,OAIvB6P,EAAG5P,UAAUglB,OAAS,WAGpB,OAFA7hB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAImF,IAAItV,OAGtB6P,EAAG5P,UAAUilB,OAAS,SAAiBtf,GAGrC,OAFAxC,EAAOpD,KAAKmQ,MAAQvK,EAAIuK,IAAK,qBAC7BnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+B,IAAIlS,KAAM4F,IAI5B,IAAIuf,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ1lB,EAAM0P,GAErBxP,KAAKF,KAAOA,EACZE,KAAKwP,EAAI,IAAIK,EAAGL,EAAG,IACnBxP,KAAKge,EAAIhe,KAAKwP,EAAEiF,YAChBzU,KAAKgT,EAAI,IAAInD,EAAG,GAAGwP,OAAOrf,KAAKge,GAAGvH,KAAKzW,KAAKwP,GAE5CxP,KAAK0M,IAAM1M,KAAKylB,OAiDlB,SAASC,IACPF,EAAOjlB,KACLP,KACA,OACA,2EA+DJ,SAAS2lB,IACPH,EAAOjlB,KACLP,KACA,OACA,kEAIJ,SAAS4lB,IACPJ,EAAOjlB,KACLP,KACA,OACA,yDAIJ,SAAS6lB,IAEPL,EAAOjlB,KACLP,KACA,QACA,uEA8CJ,SAAS0jB,EAAK3kB,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAI+mB,EAAQjW,EAAGkW,OAAOhnB,GACtBiB,KAAKjB,EAAI+mB,EAAMtW,EACfxP,KAAK8lB,MAAQA,OAEb1iB,EAAOrE,EAAEikB,IAAI,GAAI,kCACjBhjB,KAAKjB,EAAIA,EACTiB,KAAK8lB,MAAQ,KAkOjB,SAASE,EAAMjnB,GACb2kB,EAAInjB,KAAKP,KAAMjB,GAEfiB,KAAK2gB,MAAQ3gB,KAAKjB,EAAE0V,YAChBzU,KAAK2gB,MAAQ,IAAO,IACtB3gB,KAAK2gB,OAAS,GAAM3gB,KAAK2gB,MAAQ,IAGnC3gB,KAAK2Q,EAAI,IAAId,EAAG,GAAGwP,OAAOrf,KAAK2gB,OAC/B3gB,KAAKyhB,GAAKzhB,KAAKimB,KAAKjmB,KAAK2Q,EAAEuO,OAC3Blf,KAAKkmB,KAAOlmB,KAAK2Q,EAAE6R,OAAOxiB,KAAKjB,GAE/BiB,KAAKmmB,KAAOnmB,KAAKkmB,KAAKrV,IAAI7Q,KAAK2Q,GAAG2P,MAAM,GAAGW,IAAIjhB,KAAKjB,GACpDiB,KAAKmmB,KAAOnmB,KAAKmmB,KAAK9E,KAAKrhB,KAAK2Q,GAChC3Q,KAAKmmB,KAAOnmB,KAAK2Q,EAAEgG,IAAI3W,KAAKmmB,MA5a9BX,EAAOvlB,UAAUwlB,KAAO,WACtB,IAAI/Y,EAAM,IAAImD,EAAG,MAEjB,OADAnD,EAAIwD,MAAQ,IAAIxO,MAAMoP,KAAKS,KAAKvR,KAAKge,EAAI,KAClCtR,GAGT8Y,EAAOvlB,UAAUmmB,QAAU,SAAkBxgB,GAG3C,IACIygB,EADA1V,EAAI/K,EAGR,GACE5F,KAAKsN,MAAMqD,EAAG3Q,KAAK0M,KAGnB2Z,GADA1V,GADAA,EAAI3Q,KAAKsmB,MAAM3V,IACT6F,KAAKxW,KAAK0M,MACP+H,kBACF4R,EAAOrmB,KAAKge,GAErB,IAAI9M,EAAMmV,EAAOrmB,KAAKge,GAAK,EAAIrN,EAAEoS,KAAK/iB,KAAKwP,GAgB3C,OAfY,IAAR0B,GACFP,EAAET,MAAM,GAAK,EACbS,EAAErP,OAAS,GACF4P,EAAM,EACfP,EAAE8F,KAAKzW,KAAKwP,QAEIpH,IAAZuI,EAAEe,MAEJf,EAAEe,QAGFf,EAAE4V,SAIC5V,GAGT6U,EAAOvlB,UAAUqN,MAAQ,SAAgBvH,EAAOjD,GAC9CiD,EAAMqO,OAAOpU,KAAKge,EAAG,EAAGlb,IAG1B0iB,EAAOvlB,UAAUqmB,MAAQ,SAAgB1gB,GACvC,OAAOA,EAAIgV,KAAK5a,KAAKgT,IASvBpT,EAAS8lB,EAAMF,GAEfE,EAAKzlB,UAAUqN,MAAQ,SAAgBvH,EAAOygB,GAK5C,IAHA,IAAI3G,EAAO,QAEP4G,EAAS3V,KAAK/D,IAAIhH,EAAMzE,OAAQ,GAC3B+J,EAAI,EAAGA,EAAIob,EAAQpb,IAC1Bmb,EAAOtW,MAAM7E,GAAKtF,EAAMmK,MAAM7E,GAIhC,GAFAmb,EAAOllB,OAASmlB,EAEZ1gB,EAAMzE,QAAU,EAGlB,OAFAyE,EAAMmK,MAAM,GAAK,OACjBnK,EAAMzE,OAAS,GAKjB,IAAIuI,EAAO9D,EAAMmK,MAAM,GAGvB,IAFAsW,EAAOtW,MAAMsW,EAAOllB,UAAYuI,EAAOgW,EAElCxU,EAAI,GAAIA,EAAItF,EAAMzE,OAAQ+J,IAAK,CAClC,IAAIqb,EAAwB,EAAjB3gB,EAAMmK,MAAM7E,GACvBtF,EAAMmK,MAAM7E,EAAI,KAAQqb,EAAO7G,IAAS,EAAMhW,IAAS,GACvDA,EAAO6c,EAET7c,KAAU,GACV9D,EAAMmK,MAAM7E,EAAI,IAAMxB,EACT,IAATA,GAAc9D,EAAMzE,OAAS,GAC/ByE,EAAMzE,QAAU,GAEhByE,EAAMzE,QAAU,GAIpBokB,EAAKzlB,UAAUqmB,MAAQ,SAAgB1gB,GAErCA,EAAIsK,MAAMtK,EAAItE,QAAU,EACxBsE,EAAIsK,MAAMtK,EAAItE,OAAS,GAAK,EAC5BsE,EAAItE,QAAU,EAId,IADA,IAAIwR,EAAK,EACAzH,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAImG,EAAmB,EAAf5L,EAAIsK,MAAM7E,GAClByH,GAAU,IAAJtB,EACN5L,EAAIsK,MAAM7E,GAAU,SAALyH,EACfA,EAAS,GAAJtB,GAAasB,EAAK,SAAa,GAUtC,OANkC,IAA9BlN,EAAIsK,MAAMtK,EAAItE,OAAS,KACzBsE,EAAItE,SAC8B,IAA9BsE,EAAIsK,MAAMtK,EAAItE,OAAS,IACzBsE,EAAItE,UAGDsE,GASThG,EAAS+lB,EAAMH,GAQf5lB,EAASgmB,EAAMJ,GASf5lB,EAASimB,EAAQL,GAEjBK,EAAO5lB,UAAUqmB,MAAQ,SAAgB1gB,GAGvC,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAIqJ,EAA0B,IAAL,EAAf9O,EAAIsK,MAAM7E,IAAiB0H,EACjCD,EAAU,SAAL4B,EACTA,KAAQ,GAER9O,EAAIsK,MAAM7E,GAAKyH,EACfC,EAAQ2B,EAKV,OAHc,IAAV3B,IACFnN,EAAIsK,MAAMtK,EAAItE,UAAYyR,GAErBnN,GAITiK,EAAGkW,OAAS,SAAgBjmB,GAE1B,GAAIqlB,EAAOrlB,GAAO,OAAOqlB,EAAOrlB,GAEhC,IAAIgmB,EACJ,GAAa,SAAThmB,EACFgmB,EAAQ,IAAIJ,OACP,GAAa,SAAT5lB,EACTgmB,EAAQ,IAAIH,OACP,GAAa,SAAT7lB,EACTgmB,EAAQ,IAAIF,MACP,IAAa,WAAT9lB,EAGT,MAAM,IAAIb,MAAM,iBAAmBa,GAFnCgmB,EAAQ,IAAID,EAMd,OAFAV,EAAOrlB,GAAQgmB,EAERA,GAkBTpC,EAAIzjB,UAAU2kB,SAAW,SAAmBhS,GAC1CxP,EAAsB,IAAfwP,EAAE3C,SAAgB,iCACzB7M,EAAOwP,EAAEzC,IAAK,oCAGhBuT,EAAIzjB,UAAUwkB,SAAW,SAAmB7R,EAAGC,GAC7CzP,EAAqC,IAA7BwP,EAAE3C,SAAW4C,EAAE5C,UAAiB,iCACxC7M,EAAOwP,EAAEzC,KAAOyC,EAAEzC,MAAQ0C,EAAE1C,IAC1B,oCAGJuT,EAAIzjB,UAAUgmB,KAAO,SAAerT,GAClC,OAAI5S,KAAK8lB,MAAc9lB,KAAK8lB,MAAMM,QAAQxT,GAAGkR,UAAU9jB,MAChD4S,EAAEyO,KAAKrhB,KAAKjB,GAAG+kB,UAAU9jB,OAGlC0jB,EAAIzjB,UAAUqV,IAAM,SAAc1C,GAChC,OAAIA,EAAEW,SACGX,EAAEjO,QAGJ3E,KAAKjB,EAAE4X,IAAI/D,GAAGkR,UAAU9jB,OAGjC0jB,EAAIzjB,UAAUyW,IAAM,SAAc9D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE8D,IAAI7D,GAIhB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUuW,KAAO,SAAe5D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE4D,KAAK3D,GAIjB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAU0W,IAAM,SAAc/D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE+D,IAAI9D,GAIhB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUwW,KAAO,SAAe7D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE6D,KAAK5D,GAIjB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAUskB,IAAM,SAAc3R,EAAGhN,GAEnC,OADA5F,KAAK4kB,SAAShS,GACP5S,KAAKimB,KAAKrT,EAAEqN,MAAMra,KAG3B8d,EAAIzjB,UAAU2a,KAAO,SAAehI,EAAGC,GAErC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAEgI,KAAK/H,KAG1B6Q,EAAIzjB,UAAU4Q,IAAM,SAAc+B,EAAGC,GAEnC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAE/B,IAAIgC,KAGzB6Q,EAAIzjB,UAAUkf,KAAO,SAAevM,GAClC,OAAO5S,KAAK4a,KAAKhI,EAAGA,EAAEjO,UAGxB+e,EAAIzjB,UAAUif,IAAM,SAActM,GAChC,OAAO5S,KAAK6Q,IAAI+B,EAAGA,IAGrB8Q,EAAIzjB,UAAU8kB,KAAO,SAAenS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEjO,QAEzB,IAAIgiB,EAAO3mB,KAAKjB,EAAEoV,MAAM,GAIxB,GAHA/Q,EAAOujB,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIzU,EAAMlS,KAAKjB,EAAE2X,IAAI,IAAI7G,EAAG,IAAIuE,OAAO,GACvC,OAAOpU,KAAKkS,IAAIU,EAAGV,GAQrB,IAFA,IAAIgC,EAAIlU,KAAKjB,EAAEyhB,KAAK,GAChBrD,EAAI,GACAjJ,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXhR,GAAQ8Q,EAAEX,UAEV,IAAIqT,EAAM,IAAI/W,EAAG,GAAG8T,MAAM3jB,MACtB6mB,EAAOD,EAAI3B,SAIX6B,EAAO9mB,KAAKjB,EAAEyhB,KAAK,GAAGpM,OAAO,GAC7B2S,EAAI/mB,KAAKjB,EAAE0V,YAGf,IAFAsS,EAAI,IAAIlX,EAAG,EAAIkX,EAAIA,GAAGpD,MAAM3jB,MAEW,IAAhCA,KAAKkS,IAAI6U,EAAGD,GAAM5V,IAAI2V,IAC3BE,EAAE5C,QAAQ0C,GAOZ,IAJA,IAAIrW,EAAIxQ,KAAKkS,IAAI6U,EAAG7S,GAChBvD,EAAI3Q,KAAKkS,IAAIU,EAAGsB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAIvU,KAAKkS,IAAIU,EAAGsB,GAChBnV,EAAIoe,EACc,IAAf5I,EAAErD,IAAI0V,IAAY,CAEvB,IADA,IAAIla,EAAM6H,EACDlJ,EAAI,EAAoB,IAAjBqB,EAAIwE,IAAI0V,GAAYvb,IAClCqB,EAAMA,EAAIiY,SAEZvhB,EAAOiI,EAAItM,GACX,IAAI8T,EAAI7S,KAAKkS,IAAI1B,EAAG,IAAIX,EAAG,GAAGwP,OAAOtgB,EAAIsM,EAAI,IAE7CsF,EAAIA,EAAE6T,OAAO3R,GACbrC,EAAIqC,EAAE8R,SACNpQ,EAAIA,EAAEiQ,OAAOhU,GACbzR,EAAIsM,EAGN,OAAOsF,GAGT+S,EAAIzjB,UAAU4iB,KAAO,SAAejQ,GAClC,IAAIoU,EAAMpU,EAAE4P,OAAOxiB,KAAKjB,GACxB,OAAqB,IAAjBioB,EAAI/W,UACN+W,EAAI/W,SAAW,EACRjQ,KAAKimB,KAAKe,GAAK/B,UAEfjlB,KAAKimB,KAAKe,IAIrBtD,EAAIzjB,UAAUiS,IAAM,SAAcU,EAAGhN,GACnC,GAAIA,EAAI2N,SAAU,OAAO,IAAI1D,EAAG,GAAG8T,MAAM3jB,MACzC,GAAoB,IAAhB4F,EAAIgd,KAAK,GAAU,OAAOhQ,EAAEjO,QAEhC,IACIsiB,EAAM,IAAIvlB,MAAM,IACpBulB,EAAI,GAAK,IAAIpX,EAAG,GAAG8T,MAAM3jB,MACzBinB,EAAI,GAAKrU,EACT,IAAK,IAAIvH,EAAI,EAAGA,EAAI4b,EAAI3lB,OAAQ+J,IAC9B4b,EAAI5b,GAAKrL,KAAK6Q,IAAIoW,EAAI5b,EAAI,GAAIuH,GAGhC,IAAIpQ,EAAMykB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtgB,EAAQjB,EAAI6O,YAAc,GAK9B,IAJc,IAAV5N,IACFA,EAAQ,IAGLwE,EAAIzF,EAAItE,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI0G,EAAOnM,EAAIsK,MAAM7E,GACZC,EAAIzE,EAAQ,EAAGyE,GAAK,EAAGA,IAAK,CACnC,IAAIgL,EAAOvE,GAAQzG,EAAK,EACpB9I,IAAQykB,EAAI,KACdzkB,EAAMxC,KAAKkf,IAAI1c,IAGL,IAAR8T,GAAyB,IAAZ4Q,GAKjBA,IAAY,EACZA,GAAW5Q,GA9BE,KA+Bb6Q,GACwC,IAAN9b,GAAiB,IAANC,KAE7C9I,EAAMxC,KAAK6Q,IAAIrO,EAAKykB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtgB,EAAQ,GAGV,OAAOrE,GAGTkhB,EAAIzjB,UAAU4jB,UAAY,SAAoBje,GAC5C,IAAI+K,EAAI/K,EAAIyb,KAAKrhB,KAAKjB,GAEtB,OAAO4R,IAAM/K,EAAM+K,EAAEhM,QAAUgM,GAGjC+S,EAAIzjB,UAAU+jB,YAAc,SAAsBpe,GAChD,IAAIpD,EAAMoD,EAAIjB,QAEd,OADAnC,EAAI2N,IAAM,KACH3N,GAOTqN,EAAGuX,KAAO,SAAexhB,GACvB,OAAO,IAAIogB,EAAKpgB,IAmBlBhG,EAASomB,EAAMtC,GAEfsC,EAAK/lB,UAAU4jB,UAAY,SAAoBje,GAC7C,OAAO5F,KAAKimB,KAAKrgB,EAAIqa,MAAMjgB,KAAK2gB,SAGlCqF,EAAK/lB,UAAU+jB,YAAc,SAAsBpe,GACjD,IAAI+K,EAAI3Q,KAAKimB,KAAKrgB,EAAIiL,IAAI7Q,KAAKkmB,OAE/B,OADAvV,EAAER,IAAM,KACDQ,GAGTqV,EAAK/lB,UAAU2a,KAAO,SAAehI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE1C,MAAM,GAAK,EACb0C,EAAEtR,OAAS,EACJsR,EAGT,IAAI2B,EAAI3B,EAAEgI,KAAK/H,GACXrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAQV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4Q,IAAM,SAAc+B,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI1D,EAAG,GAAGiU,UAAU9jB,MAEzD,IAAIuU,EAAI3B,EAAE/B,IAAIgC,GACVrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAOV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4iB,KAAO,SAAejQ,GAGnC,OADU5S,KAAKimB,KAAKrT,EAAE4P,OAAOxiB,KAAKjB,GAAG8R,IAAI7Q,KAAKyhB,KACnCqC,UAAU9jB,OAn3GzB,YAq3G4CA,oCCr3GxCwkC,EAAO,EAAQ,KAEfuB,EAAO,aAUPuxD,EAAM,SAASz3D,EAAQZ,EAAM6B,GAChC,GAAoB,mBAAT7B,EAAqB,OAAOq4D,EAAIz3D,EAAQ,KAAMZ,GACpDA,IAAMA,EAAO,IAElB6B,EAAW0D,EAAK1D,GAAYiF,GAE5B,IAAI3nB,EAAKyhB,EAAO+vB,eACZ2nC,EAAK13D,EAAO23D,eACZvyB,EAAWhmC,EAAKgmC,WAA+B,IAAlBhmC,EAAKgmC,UAAsBplC,EAAOolC,SAC/Dx3C,EAAWwR,EAAKxR,WAA+B,IAAlBwR,EAAKxR,UAAsBoS,EAAOpS,SAC/DgqE,GAAY,EAEZC,EAAiB,WACf73D,EAAOpS,UAAUkqE,KAGnBA,EAAW,WACdlqE,GAAW,EACNw3C,GAAUnkC,EAASvgC,KAAKs/B,IAG1B+3D,EAAQ,WACX3yB,GAAW,EACNx3C,GAAUqT,EAASvgC,KAAKs/B,IAG1Bg4D,EAAS,SAASC,GACrBh3D,EAASvgC,KAAKs/B,EAAQi4D,EAAW,IAAI74F,MAAM,2BAA6B64F,GAAY,OAGjF9tC,EAAU,SAASjgD,GACtB+2B,EAASvgC,KAAKs/B,EAAQ91B,IAGnBguF,EAAU,WACbluE,EAAQs/B,SAAS6uC,IAGdA,EAAkB,WACrB,IAAIP,EACJ,QAAIxyB,GAAcsyB,GAAOA,EAAG1nC,QAAU0nC,EAAGp0D,cACrC1V,GAAcrP,GAAOA,EAAGyxC,QAAUzxC,EAAG+kB,gBAAzC,EAD6DrC,EAASvgC,KAAKs/B,EAAQ,IAAI5gC,MAAM,qBAI1Fg5F,EAAY,WACfp4D,EAAO2O,IAAI9J,GAAG,SAAUizD,IAoBzB,OAzEe,SAAS93D,GACxB,OAAOA,EAAOq4D,WAAqC,mBAAjBr4D,EAAOs4D,MAuDrCC,CAAUv4D,IACbA,EAAO6E,GAAG,WAAYizD,GACtB93D,EAAO6E,GAAG,QAASqzD,GACfl4D,EAAO2O,IAAKypD,IACXp4D,EAAO6E,GAAG,UAAWuzD,IAChBxqE,IAAarP,IACvByhB,EAAO6E,GAAG,MAAOgzD,GACjB73D,EAAO6E,GAAG,QAASgzD,IA3DA,SAAS73D,GAC7B,OAAOA,EAAOw4D,OAAS32F,MAAMC,QAAQk+B,EAAOw4D,QAAkC,IAAxBx4D,EAAOw4D,MAAM/2F,OA6D/Dg3F,CAAez4D,IAASA,EAAO6E,GAAG,OAAQmzD,GAE9Ch4D,EAAO6E,GAAG,MAAOkzD,GACjB/3D,EAAO6E,GAAG,SAAUizD,IACD,IAAf14D,EAAK19B,OAAiBs+B,EAAO6E,GAAG,QAASslB,GAC7CnqB,EAAO6E,GAAG,QAASqzD,GAEZ,WACNN,GAAY,EACZ53D,EAAOwT,eAAe,WAAYskD,GAClC93D,EAAOwT,eAAe,QAAS0kD,GAC/Bl4D,EAAOwT,eAAe,UAAW4kD,GAC7Bp4D,EAAO2O,KAAK3O,EAAO2O,IAAI6E,eAAe,SAAUskD,GACpD93D,EAAOwT,eAAe,MAAOqkD,GAC7B73D,EAAOwT,eAAe,QAASqkD,GAC/B73D,EAAOwT,eAAe,SAAUskD,GAChC93D,EAAOwT,eAAe,OAAQwkD,GAC9Bh4D,EAAOwT,eAAe,MAAOukD,GAC7B/3D,EAAOwT,eAAe,QAAS2W,GAC/BnqB,EAAOwT,eAAe,QAAS0kD,KAIjCt5F,EAAOC,QAAU44F,yBC/EjB,SAAS/uE,EAAOrkB,EAAK0pB,GACjB,IAAK,MAAMvpB,KAAOupB,EACdpoB,OAAO8nB,eAAeppB,EAAKG,EAAK,CAC5B5C,MAAOmsB,EAAMvpB,GACbkpB,YAAY,EACZC,cAAc,IAItB,OAAOtpB,EA6CXzF,EAAOC,QAnCP,SAAqBqL,EAAK4oB,EAAM/E,GAC5B,IAAK7jB,GAAsB,iBAARA,EACf,MAAM,IAAI8gB,UAAU,oCAGnB+C,IACDA,EAAQ,IAGQ,iBAAT+E,IACP/E,EAAQ+E,EACRA,EAAO,IAGPA,IACA/E,EAAM+E,KAAOA,GAGjB,IACI,OAAOpK,EAAOxe,EAAK6jB,GACrB,MAAOnP,GACLmP,EAAM1jB,QAAUH,EAAIG,QACpB0jB,EAAMzjB,MAAQJ,EAAII,MAElB,MAAMouF,EAAW,aAOjB,OALAA,EAASt4F,UAAYuF,OAAOgpB,OAAOhpB,OAAO0pB,eAAenlB,IAG1Cwe,EAAO,IAAIgwE,EAAY3qE,4BCvD9C,SAASrF,EAAOoF,EAAQ6qE,GACtB,GAAI7qE,MAAAA,EACF,MAAM,IAAI9C,UAAU,2CAItB,IADA,IAAI4tE,EAAKjzF,OAAOmoB,GACPtiB,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IAAK,CACzC,IAAIqtF,EAAazzF,UAAUoG,GAC3B,GAAIqtF,MAAAA,EAKJ,IADA,IAAIC,EAAYnzF,OAAOC,KAAKD,OAAOkzF,IAC1BE,EAAY,EAAGxtF,EAAMutF,EAAUr3F,OAAQs3F,EAAYxtF,EAAKwtF,IAAa,CAC5E,IAAIC,EAAUF,EAAUC,GACpBx8B,EAAO52D,OAAO6tB,yBAAyBqlE,EAAYG,QAC1CzwF,IAATg0D,GAAsBA,EAAK7uC,aAC7BkrE,EAAGI,GAAWH,EAAWG,KAI/B,OAAOJ,EAcTh6F,EAAOC,QAAU,CACf6pB,OAAQA,EACRuwE,SAbF,WACOtzF,OAAO+iB,QACV/iB,OAAO8nB,eAAe9nB,OAAQ,SAAU,CACtC+nB,YAAY,EACZC,cAAc,EACdC,UAAU,EACVhsB,MAAO8mB,uCCPTwwE,YAPA9D,EAAuB,iBAAZtmE,QAAuBA,QAAU,KAC5CqqE,EAAe/D,GAAwB,mBAAZA,EAAEjwF,MAC7BiwF,EAAEjwF,MACF,SAAsB2oB,EAAQsrE,EAAUp1F,GACxC,OAAOuqB,SAASnuB,UAAU+E,MAAMzE,KAAKotB,EAAQsrE,EAAUp1F,IAKzDk1F,EADE9D,GAA0B,mBAAdA,EAAE/hE,QACC+hE,EAAE/hE,QACV1tB,OAAO2tB,sBACC,SAAwBxF,GACvC,OAAOnoB,OAAOw5D,oBAAoBrxC,GAC/BpqB,OAAOiC,OAAO2tB,sBAAsBxF,KAGxB,SAAwBA,GACvC,OAAOnoB,OAAOw5D,oBAAoBrxC,IAQtC,IAAIurE,EAAc/5F,OAAOs2B,OAAS,SAAqBh0B,GACrD,OAAOA,GAAUA,GAGnB,SAASmtC,IACPA,EAAaqb,KAAK1pD,KAAKP,MAEzBvB,EAAOC,QAAUkwC,EACjBnwC,EAAOC,QAAQ8lC,KAwYf,SAAc20D,EAASr5F,GACrB,OAAO,IAAI0rB,SAAQ,SAAUC,EAAS+c,GACpC,SAAS4wD,EAAcrvF,GACrBovF,EAAQ9lD,eAAevzC,EAAMu5F,GAC7B7wD,EAAOz+B,GAGT,SAASsvF,IAC+B,mBAA3BF,EAAQ9lD,gBACjB8lD,EAAQ9lD,eAAe,QAAS+lD,GAElC3tE,EAAQ,GAAG7oB,MAAMrC,KAAK0E,YAGxBq0F,EAA+BH,EAASr5F,EAAMu5F,EAAU,CAAE70D,MAAM,IACnD,UAAT1kC,GAMR,SAAuCq5F,EAASrzD,EAAS3Q,GAC7B,mBAAfgkE,EAAQz0D,IACjB40D,EAA+BH,EAAS,QAASrzD,EAPO,CAAEtB,MAAM,IAA9D+0D,CAA8BJ,EAASC,OArZ7CxqD,EAAaA,aAAeA,EAE5BA,EAAa3uC,UAAUu5F,aAAUpxF,EACjCwmC,EAAa3uC,UAAUw5F,aAAe,EACtC7qD,EAAa3uC,UAAUy5F,mBAAgBtxF,EAIvC,IAAIuxF,EAAsB,GAE1B,SAASC,EAAcC,GACrB,GAAwB,mBAAbA,EACT,MAAM,IAAIhvE,UAAU,0EAA4EgvE,GAsCpG,SAASC,EAAiBC,GACxB,YAA2B3xF,IAAvB2xF,EAAKL,cACA9qD,EAAa+qD,oBACfI,EAAKL,cAmDd,SAASM,EAAarsE,EAAQ3lB,EAAM6xF,EAAUI,GAC5C,IAAIl7F,EACAm7F,EACAC,EA1HsBtlD,EAgJ1B,GApBA+kD,EAAcC,QAGCzxF,KADf8xF,EAASvsE,EAAO6rE,UAEdU,EAASvsE,EAAO6rE,QAAUh0F,OAAOgpB,OAAO,MACxCb,EAAO8rE,aAAe,SAIKrxF,IAAvB8xF,EAAOE,cACTzsE,EAAO8X,KAAK,cAAez9B,EACf6xF,EAASA,SAAWA,EAASA,SAAWA,GAIpDK,EAASvsE,EAAO6rE,SAElBW,EAAWD,EAAOlyF,SAGHI,IAAb+xF,EAEFA,EAAWD,EAAOlyF,GAAQ6xF,IACxBlsE,EAAO8rE,kBAeT,GAbwB,mBAAbU,EAETA,EAAWD,EAAOlyF,GAChBiyF,EAAU,CAACJ,EAAUM,GAAY,CAACA,EAAUN,GAErCI,EACTE,EAAS/qF,QAAQyqF,GAEjBM,EAASp1F,KAAK80F,IAIhB96F,EAAI+6F,EAAiBnsE,IACb,GAAKwsE,EAAS74F,OAASvC,IAAMo7F,EAASvxE,OAAQ,CACpDuxE,EAASvxE,QAAS,EAGlB,IAAIpX,EAAI,IAAIvS,MAAM,+CACEk7F,EAAS74F,OAAS,IAAMuK,OAAO7D,GADjC,qEAIlBwJ,EAAE1R,KAAO,8BACT0R,EAAE2nF,QAAUxrE,EACZnc,EAAExJ,KAAOA,EACTwJ,EAAEkgB,MAAQyoE,EAAS74F,OA7KGuzC,EA8KHrjC,EA7KnBuY,GAAWA,EAAQH,MAAMG,EAAQH,KAAKirB,GAiL1C,OAAOlnB,EAcT,SAAS0sE,IACP,IAAKr6F,KAAKs6F,MAGR,OAFAt6F,KAAK2tB,OAAO0lB,eAAerzC,KAAKgI,KAAMhI,KAAKu6F,QAC3Cv6F,KAAKs6F,OAAQ,EACY,IAArBr1F,UAAU3D,OACLtB,KAAK65F,SAASt5F,KAAKP,KAAK2tB,QAC1B3tB,KAAK65F,SAAS70F,MAAMhF,KAAK2tB,OAAQ1oB,WAI5C,SAASu1F,EAAU7sE,EAAQ3lB,EAAM6xF,GAC/B,IAAIp2F,EAAQ,CAAE62F,OAAO,EAAOC,YAAQnyF,EAAWulB,OAAQA,EAAQ3lB,KAAMA,EAAM6xF,SAAUA,GACjFY,EAAUJ,EAAYrwE,KAAKvmB,GAG/B,OAFAg3F,EAAQZ,SAAWA,EACnBp2F,EAAM82F,OAASE,EACRA,EA0HT,SAASC,EAAW/sE,EAAQ3lB,EAAM2yF,GAChC,IAAIT,EAASvsE,EAAO6rE,QAEpB,QAAepxF,IAAX8xF,EACF,MAAO,GAET,IAAIU,EAAaV,EAAOlyF,GACxB,YAAmBI,IAAfwyF,EACK,GAEiB,mBAAfA,EACFD,EAAS,CAACC,EAAWf,UAAYe,GAAc,CAACA,GAElDD,EAsDT,SAAyBpmE,GAEvB,IADA,IAAI5gB,EAAM,IAAIjS,MAAM6yB,EAAIjzB,QACf+J,EAAI,EAAGA,EAAIsI,EAAIrS,SAAU+J,EAChCsI,EAAItI,GAAKkpB,EAAIlpB,GAAGwuF,UAAYtlE,EAAIlpB,GAElC,OAAOsI,EA1DLknF,CAAgBD,GAAcE,EAAWF,EAAYA,EAAWt5F,QAoBpE,SAASy5F,EAAc/yF,GACrB,IAAIkyF,EAASl6F,KAAKw5F,QAElB,QAAepxF,IAAX8xF,EAAsB,CACxB,IAAIU,EAAaV,EAAOlyF,GAExB,GAA0B,mBAAf4yF,EACT,OAAO,EACF,QAAmBxyF,IAAfwyF,EACT,OAAOA,EAAWt5F,OAItB,OAAO,EAOT,SAASw5F,EAAWvmE,EAAKvW,GAEvB,IADA,IAAI9a,EAAO,IAAIxB,MAAMsc,GACZ3S,EAAI,EAAGA,EAAI2S,IAAK3S,EACvBnI,EAAKmI,GAAKkpB,EAAIlpB,GAChB,OAAOnI,EA4CT,SAASo2F,EAA+BH,EAASr5F,EAAM+5F,EAAU1kE,GAC/D,GAA0B,mBAAfgkE,EAAQz0D,GACbvP,EAAMqP,KACR20D,EAAQ30D,KAAK1kC,EAAM+5F,GAEnBV,EAAQz0D,GAAG5kC,EAAM+5F,OAEd,IAAwC,mBAA7BV,EAAQxiD,iBAYxB,MAAM,IAAI9rB,UAAU,6EAA+EsuE,GATnGA,EAAQxiD,iBAAiB72C,GAAM,SAASk7F,EAAaz1F,GAG/C4vB,EAAMqP,MACR20D,EAAQtiD,oBAAoB/2C,EAAMk7F,GAEpCnB,EAASt0F,OAhafC,OAAO8nB,eAAeshB,EAAc,sBAAuB,CACzDrhB,YAAY,EACZnuB,IAAK,WACH,OAAOu6F,GAETz6F,IAAK,SAASqG,GACZ,GAAmB,iBAARA,GAAoBA,EAAM,GAAK2zF,EAAY3zF,GACpD,MAAM,IAAI8uB,WAAW,kGAAoG9uB,EAAM,KAEjIo0F,EAAsBp0F,KAI1BqpC,EAAaqb,KAAO,gBAEG7hD,IAAjBpI,KAAKw5F,SACLx5F,KAAKw5F,UAAYh0F,OAAO0pB,eAAelvB,MAAMw5F,UAC/Cx5F,KAAKw5F,QAAUh0F,OAAOgpB,OAAO,MAC7BxuB,KAAKy5F,aAAe,GAGtBz5F,KAAK05F,cAAgB15F,KAAK05F,oBAAiBtxF,GAK7CwmC,EAAa3uC,UAAUg7F,gBAAkB,SAAyBj9E,GAChE,GAAiB,iBAANA,GAAkBA,EAAI,GAAKk7E,EAAYl7E,GAChD,MAAM,IAAIqW,WAAW,gFAAkFrW,EAAI,KAG7G,OADAhe,KAAK05F,cAAgB17E,EACdhe,MAST4uC,EAAa3uC,UAAUi7F,gBAAkB,WACvC,OAAOpB,EAAiB95F,OAG1B4uC,EAAa3uC,UAAUwlC,KAAO,SAAcz9B,GAE1C,IADA,IAAInE,EAAO,GACFwH,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IAAKxH,EAAKkB,KAAKE,UAAUoG,IAC/D,IAAI8vF,EAAoB,UAATnzF,EAEXkyF,EAASl6F,KAAKw5F,QAClB,QAAepxF,IAAX8xF,EACFiB,EAAWA,QAA4B/yF,IAAjB8xF,EAAO34F,WAC1B,IAAK45F,EACR,OAAO,EAGT,GAAIA,EAAS,CACX,IAAIhrC,EAGJ,GAFItsD,EAAKvC,OAAS,IAChB6uD,EAAKtsD,EAAK,IACRssD,aAAclxD,MAGhB,MAAMkxD,EAGR,IAAIpmD,EAAM,IAAI9K,MAAM,oBAAsBkxD,EAAK,KAAOA,EAAGjmD,QAAU,IAAM,KAEzE,MADAH,EAAIqxF,QAAUjrC,EACRpmD,EAGR,IAAI+7B,EAAUo0D,EAAOlyF,GAErB,QAAgBI,IAAZ09B,EACF,OAAO,EAET,GAAuB,mBAAZA,EACTkzD,EAAalzD,EAAS9lC,KAAM6D,OAE5B,KAAIuH,EAAM06B,EAAQxkC,OACd+5F,EAAYP,EAAWh1D,EAAS16B,GACpC,IAASC,EAAI,EAAGA,EAAID,IAAOC,EACzB2tF,EAAaqC,EAAUhwF,GAAIrL,KAAM6D,GAGrC,OAAO,GAiET+qC,EAAa3uC,UAAUq7F,YAAc,SAAqBtzF,EAAM6xF,GAC9D,OAAOG,EAAah6F,KAAMgI,EAAM6xF,GAAU,IAG5CjrD,EAAa3uC,UAAUykC,GAAKkK,EAAa3uC,UAAUq7F,YAEnD1sD,EAAa3uC,UAAUs7F,gBACnB,SAAyBvzF,EAAM6xF,GAC7B,OAAOG,EAAah6F,KAAMgI,EAAM6xF,GAAU,IAqBhDjrD,EAAa3uC,UAAUukC,KAAO,SAAcx8B,EAAM6xF,GAGhD,OAFAD,EAAcC,GACd75F,KAAK0kC,GAAG18B,EAAMwyF,EAAUx6F,KAAMgI,EAAM6xF,IAC7B75F,MAGT4uC,EAAa3uC,UAAUu7F,oBACnB,SAA6BxzF,EAAM6xF,GAGjC,OAFAD,EAAcC,GACd75F,KAAKu7F,gBAAgBvzF,EAAMwyF,EAAUx6F,KAAMgI,EAAM6xF,IAC1C75F,MAIb4uC,EAAa3uC,UAAUozC,eACnB,SAAwBrrC,EAAM6xF,GAC5B,IAAI39D,EAAMg+D,EAAQthE,EAAUvtB,EAAGowF,EAK/B,GAHA7B,EAAcC,QAGCzxF,KADf8xF,EAASl6F,KAAKw5F,SAEZ,OAAOx5F,KAGT,QAAaoI,KADb8zB,EAAOg+D,EAAOlyF,IAEZ,OAAOhI,KAET,GAAIk8B,IAAS29D,GAAY39D,EAAK29D,WAAaA,EACb,KAAtB75F,KAAKy5F,aACTz5F,KAAKw5F,QAAUh0F,OAAOgpB,OAAO,cAEtB0rE,EAAOlyF,GACVkyF,EAAO7mD,gBACTrzC,KAAKylC,KAAK,iBAAkBz9B,EAAMk0B,EAAK29D,UAAYA,SAElD,GAAoB,mBAAT39D,EAAqB,CAGrC,IAFAtD,GAAY,EAEPvtB,EAAI6wB,EAAK56B,OAAS,EAAG+J,GAAK,EAAGA,IAChC,GAAI6wB,EAAK7wB,KAAOwuF,GAAY39D,EAAK7wB,GAAGwuF,WAAaA,EAAU,CACzD4B,EAAmBv/D,EAAK7wB,GAAGwuF,SAC3BjhE,EAAWvtB,EACX,MAIJ,GAAIutB,EAAW,EACb,OAAO54B,KAEQ,IAAb44B,EACFsD,EAAKvb,QAiIf,SAAmBub,EAAMtyB,GACvB,KAAOA,EAAQ,EAAIsyB,EAAK56B,OAAQsI,IAC9BsyB,EAAKtyB,GAASsyB,EAAKtyB,EAAQ,GAC7BsyB,EAAKnK,MAlIG2pE,CAAUx/D,EAAMtD,GAGE,IAAhBsD,EAAK56B,SACP44F,EAAOlyF,GAAQk0B,EAAK,SAEQ9zB,IAA1B8xF,EAAO7mD,gBACTrzC,KAAKylC,KAAK,iBAAkBz9B,EAAMyzF,GAAoB5B,GAG1D,OAAO75F,MAGb4uC,EAAa3uC,UAAUwR,IAAMm9B,EAAa3uC,UAAUozC,eAEpDzE,EAAa3uC,UAAU07F,mBACnB,SAA4B3zF,GAC1B,IAAIqzF,EAAWnB,EAAQ7uF,EAGvB,QAAejD,KADf8xF,EAASl6F,KAAKw5F,SAEZ,OAAOx5F,KAGT,QAA8BoI,IAA1B8xF,EAAO7mD,eAUT,OATyB,IAArBpuC,UAAU3D,QACZtB,KAAKw5F,QAAUh0F,OAAOgpB,OAAO,MAC7BxuB,KAAKy5F,aAAe,QACMrxF,IAAjB8xF,EAAOlyF,KACY,KAAtBhI,KAAKy5F,aACTz5F,KAAKw5F,QAAUh0F,OAAOgpB,OAAO,aAEtB0rE,EAAOlyF,IAEXhI,KAIT,GAAyB,IAArBiF,UAAU3D,OAAc,CAC1B,IACI+C,EADAoB,EAAOD,OAAOC,KAAKy0F,GAEvB,IAAK7uF,EAAI,EAAGA,EAAI5F,EAAKnE,SAAU+J,EAEjB,oBADZhH,EAAMoB,EAAK4F,KAEXrL,KAAK27F,mBAAmBt3F,GAK1B,OAHArE,KAAK27F,mBAAmB,kBACxB37F,KAAKw5F,QAAUh0F,OAAOgpB,OAAO,MAC7BxuB,KAAKy5F,aAAe,EACbz5F,KAKT,GAAyB,mBAFzBq7F,EAAYnB,EAAOlyF,IAGjBhI,KAAKqzC,eAAerrC,EAAMqzF,QACrB,QAAkBjzF,IAAdizF,EAET,IAAKhwF,EAAIgwF,EAAU/5F,OAAS,EAAG+J,GAAK,EAAGA,IACrCrL,KAAKqzC,eAAerrC,EAAMqzF,EAAUhwF,IAIxC,OAAOrL,MAoBb4uC,EAAa3uC,UAAUo7F,UAAY,SAAmBrzF,GACpD,OAAO0yF,EAAW16F,KAAMgI,GAAM,IAGhC4mC,EAAa3uC,UAAU27F,aAAe,SAAsB5zF,GAC1D,OAAO0yF,EAAW16F,KAAMgI,GAAM,IAGhC4mC,EAAamsD,cAAgB,SAAS5B,EAASnxF,GAC7C,MAAqC,mBAA1BmxF,EAAQ4B,cACV5B,EAAQ4B,cAAc/yF,GAEtB+yF,EAAcx6F,KAAK44F,EAASnxF,IAIvC4mC,EAAa3uC,UAAU86F,cAAgBA,EAiBvCnsD,EAAa3uC,UAAU47F,WAAa,WAClC,OAAO77F,KAAKy5F,aAAe,EAAIV,EAAe/4F,KAAKw5F,SAAW,oBCxahE,IAAIt4F,EAAS,eACTshE,EAAM,EAAQ,MA2ClB/jE,EAAOC,QAxCP,SAAyBsgD,EAAU88C,EAAMC,EAASv6C,GAEhD,GADKtgD,EAAOE,SAAS49C,KAAWA,EAAW99C,EAAO2M,KAAKmxC,EAAU,WAC7D88C,IACG56F,EAAOE,SAAS06F,KAAOA,EAAO56F,EAAO2M,KAAKiuF,EAAM,WACjC,IAAhBA,EAAKx6F,QAAc,MAAM,IAAI+yB,WAAW,4CAQ9C,IALA,IAAIktB,EAASw6C,EAAU,EACnB13F,EAAMnD,EAAO6B,MAAMw+C,GACnBtF,EAAK/6C,EAAO6B,MAAMy+C,GAAS,GAC3B90C,EAAMxL,EAAO6B,MAAM,GAEhBw+C,EAAS,GAAKC,EAAQ,GAAG,CAC9B,IAAIkC,EAAO,IAAI8e,EACf9e,EAAKtS,OAAO1kC,GACZg3C,EAAKtS,OAAO4N,GACR88C,GAAMp4C,EAAKtS,OAAO0qD,GACtBpvF,EAAMg3C,EAAKO,SAEX,IAAI+3C,EAAO,EAEX,GAAIz6C,EAAS,EAAG,CACd,IAAI06C,EAAW53F,EAAI/C,OAASigD,EAC5By6C,EAAOlrF,KAAK/D,IAAIw0C,EAAQ70C,EAAIpL,QAC5BoL,EAAIxJ,KAAKmB,EAAK43F,EAAU,EAAGD,GAC3Bz6C,GAAUy6C,EAGZ,GAAIA,EAAOtvF,EAAIpL,QAAUkgD,EAAQ,EAAG,CAClC,IAAI06C,EAAUjgD,EAAG36C,OAASkgD,EACtBlgD,EAASwP,KAAK/D,IAAIy0C,EAAO90C,EAAIpL,OAAS06F,GAC1CtvF,EAAIxJ,KAAK+4C,EAAIigD,EAASF,EAAMA,EAAO16F,GACnCkgD,GAASlgD,GAKb,OADAoL,EAAIm4C,KAAK,GACF,CAAExgD,IAAKA,EAAK43C,GAAIA,cCzCzBx9C,EAAOC,QAAU,MACfuD,YAAak6F,GACX,KAAMA,EAAM,IAA4B,IAApBA,EAAM,EAAKA,GAAY,MAAM,IAAIl9F,MAAM,qDAC3De,KAAKuL,OAAS,IAAI7J,MAAMy6F,GACxBn8F,KAAK6f,KAAOs8E,EAAM,EAClBn8F,KAAKo8F,IAAM,EACXp8F,KAAKq8F,IAAM,EACXr8F,KAAK0mB,KAAO,KAGd3hB,KAAMnE,GACJ,YAA8BwH,IAA1BpI,KAAKuL,OAAOvL,KAAKo8F,OACrBp8F,KAAKuL,OAAOvL,KAAKo8F,KAAOx7F,EACxBZ,KAAKo8F,IAAOp8F,KAAKo8F,IAAM,EAAKp8F,KAAK6f,MAC1B,GAGTc,QACE,MAAMu+B,EAAOl/C,KAAKuL,OAAOvL,KAAKq8F,KAC9B,QAAaj0F,IAAT82C,EAGJ,OAFAl/C,KAAKuL,OAAOvL,KAAKq8F,UAAOj0F,EACxBpI,KAAKq8F,IAAOr8F,KAAKq8F,IAAM,EAAKr8F,KAAK6f,KAC1Bq/B,EAGTo9C,OACE,OAAOt8F,KAAKuL,OAAOvL,KAAKq8F,KAG1Bj6F,UACE,YAAiCgG,IAA1BpI,KAAKuL,OAAOvL,KAAKq8F,uBC9B5B,MAAME,EAAY,EAAQ,MAE1B99F,EAAOC,QAAU,MACfuD,YAAak6F,GACXn8F,KAAKm8F,IAAMA,GAAO,GAClBn8F,KAAKw8F,KAAO,IAAID,EAAUv8F,KAAKm8F,KAC/Bn8F,KAAKy8C,KAAOz8C,KAAKw8F,KAGnBz3F,KAAMY,GACJ,IAAK3F,KAAKw8F,KAAKz3F,KAAKY,GAAM,CACxB,MAAMkE,EAAO7J,KAAKw8F,KAClBx8F,KAAKw8F,KAAO3yF,EAAK6c,KAAO,IAAI61E,EAAU,EAAIv8F,KAAKw8F,KAAKjxF,OAAOjK,QAC3DtB,KAAKw8F,KAAKz3F,KAAKY,IAInBgb,QACE,MAAMhb,EAAM3F,KAAKy8C,KAAK97B,QACtB,QAAYvY,IAARzC,GAAqB3F,KAAKy8C,KAAK/1B,KAAM,CACvC,MAAMA,EAAO1mB,KAAKy8C,KAAK/1B,KAGvB,OAFA1mB,KAAKy8C,KAAK/1B,KAAO,KACjB1mB,KAAKy8C,KAAO/1B,EACL1mB,KAAKy8C,KAAK97B,QAEnB,OAAOhb,EAGT22F,OACE,OAAOt8F,KAAKy8C,KAAK6/C,OAGnBl6F,UACE,OAAOpC,KAAKw8F,KAAKp6F,2BC/BrB,MAAM,SAAEq6F,GAAa,EAAQ,MACvB5oF,EAAW,EAAQ,MAgFzBpV,EAAOC,QA9EP,cAA6B+9F,EAC3Bx6F,YAAa4iE,EAAM5lC,EAAO,IACxBmC,MAAMnC,GAGNj/B,KAAKkuD,QAAU,EACfluD,KAAK08F,QAAS,EACd18F,KAAK28F,MAAQ93B,EACb7kE,KAAK48F,MAAQ/3B,EAAKjmE,KAClBoB,KAAK0tD,WAAazuB,EAAK0uB,WAAa78C,KAAKC,IAAI/Q,KAAK48F,MAAQ,IAAM,QAGhE,MAAMnmD,EAAS,IAAIC,WAEnBD,EAAOomD,OAAS,KAEd78F,KAAK+E,KAAK8O,EAAS4iC,EAAOvwC,UAE5BuwC,EAAOuT,QAAU,KACfhqD,KAAKylC,KAAK,QAASgR,EAAOl1C,QAG5BvB,KAAKy2C,OAASA,EAGdz2C,KAAK88F,sBAAsBj4B,EAAM5lC,GAAM,CAACl1B,EAAKgzF,KAE3C,GAAIhzF,EACF,OAAO/J,KAAKylC,KAAK,QAAS17B,GAIxBrI,MAAMC,QAAQo7F,IAChBA,EAAO/5F,SAAQ68C,GAAS7/C,KAAK+E,KAAK86C,KAGpC7/C,KAAK08F,QAAS,EACd18F,KAAKylC,KAAK,aAIdq3D,sBAAuBj4B,EAAM5lC,EAAM6B,GACjCA,EAAS,KAAM,IAGjBmJ,QACE,IAAKjqC,KAAK08F,OAER,YADA18F,KAAKwkC,KAAK,SAAUxkC,KAAKiqC,MAAMjgB,KAAKhqB,OAItC,MAAMg9F,EAAch9F,KAAKkuD,QACzB,IAAI+uC,EAAYj9F,KAAKkuD,QAAUluD,KAAK0tD,WAGpC,GAFIuvC,EAAYj9F,KAAK48F,QAAOK,EAAYj9F,KAAK48F,OAEzCI,IAAgBh9F,KAAK48F,MAGvB,OAFA58F,KAAKwlC,eACLxlC,KAAK+E,KAAK,MAIZ/E,KAAKy2C,OAAOK,kBAAkB92C,KAAK28F,MAAM/5F,MAAMo6F,EAAaC,IAG5Dj9F,KAAKkuD,QAAU+uC,EAGjBz3D,UAEE,GADAxlC,KAAK28F,MAAQ,KACT38F,KAAKy2C,OAAQ,CACfz2C,KAAKy2C,OAAOomD,OAAS,KACrB78F,KAAKy2C,OAAOuT,QAAU,KACtB,IAAMhqD,KAAKy2C,OAAO0hD,QAAU,MAAOzxF,KAErC1G,KAAKy2C,OAAS,iBC9ElB,IAAIymD,EAAS13F,OAAOvF,UAAUS,eAC1BuL,EAAWzG,OAAOvF,UAAUgM,SAEhCxN,EAAOC,QAAU,SAAkBwF,EAAK+kB,EAAIrF,GACxC,GAA0B,sBAAtB3X,EAAS1L,KAAK0oB,GACd,MAAM,IAAI4B,UAAU,+BAExB,IAAIpO,EAAIvY,EAAI5C,OACZ,GAAImb,KAAOA,EACP,IAAK,IAAIpR,EAAI,EAAGA,EAAIoR,EAAGpR,IACnB4d,EAAG1oB,KAAKqjB,EAAK1f,EAAImH,GAAIA,EAAGnH,QAG5B,IAAK,IAAI8O,KAAK9O,EACNg5F,EAAO38F,KAAK2D,EAAK8O,IACjBiW,EAAG1oB,KAAKqjB,EAAK1f,EAAI8O,GAAIA,EAAG9O,2BCZxC,IAAIi5F,EAAgB,kDAChBv6F,EAAQlB,MAAMzB,UAAU2C,MACxB6oE,EAAQjmE,OAAOvF,UAAUgM,SACzBmxF,EAAW,oBAEf3+F,EAAOC,QAAU,SAAcq7F,GAC3B,IAAIpsE,EAAS3tB,KACb,GAAsB,mBAAX2tB,GAAyB89C,EAAMlrE,KAAKotB,KAAYyvE,EACvD,MAAM,IAAIvyE,UAAUsyE,EAAgBxvE,GAyBxC,IAvBA,IAEI0vE,EAFAx5F,EAAOjB,EAAMrC,KAAK0E,UAAW,GAG7Bq4F,EAAS,WACT,GAAIt9F,gBAAgBq9F,EAAO,CACvB,IAAIn3F,EAASynB,EAAO3oB,MAChBhF,KACA6D,EAAKN,OAAOX,EAAMrC,KAAK0E,aAE3B,OAAIO,OAAOU,KAAYA,EACZA,EAEJlG,KAEP,OAAO2tB,EAAO3oB,MACV+0F,EACAl2F,EAAKN,OAAOX,EAAMrC,KAAK0E,cAK/Bs4F,EAAczsF,KAAKC,IAAI,EAAG4c,EAAOrsB,OAASuC,EAAKvC,QAC/Ck8F,EAAY,GACPnyF,EAAI,EAAGA,EAAIkyF,EAAalyF,IAC7BmyF,EAAUz4F,KAAK,IAAMsG,GAKzB,GAFAgyF,EAAQjvE,SAAS,SAAU,oBAAsBovE,EAAU36F,KAAK,KAAO,4CAA/DurB,CAA4GkvE,GAEhH3vE,EAAO1tB,UAAW,CAClB,IAAIw9F,EAAQ,aACZA,EAAMx9F,UAAY0tB,EAAO1tB,UACzBo9F,EAAMp9F,UAAY,IAAIw9F,EACtBA,EAAMx9F,UAAY,KAGtB,OAAOo9F,gCChDX,IAAIK,EAAiB,EAAQ,MAE7Bj/F,EAAOC,QAAU0vB,SAASnuB,UAAU+pB,MAAQ0zE,YCF5Cj/F,EAAOC,QAAU,WACf,GAA0B,oBAAfgnE,WAA4B,OAAO,KAC9C,IAAIr1B,EAAO,CACTstD,kBAAmBj4B,WAAWi4B,mBAAqBj4B,WAAWk4B,sBAC5Dl4B,WAAWm4B,wBACbC,sBAAuBp4B,WAAWo4B,uBAChCp4B,WAAWq4B,0BAA4Br4B,WAAWs4B,4BACpDC,gBAAiBv4B,WAAWu4B,iBAAmBv4B,WAAWw4B,oBACxDx4B,WAAWy4B,uBAEf,OAAK9tD,EAAKstD,kBACHttD,EAD6B,kCCVtC,IAAIjoC,EAEAg2F,EAAeC,YACfC,EAAYlwE,SACZmwE,EAAa1zE,UAGb2zE,EAAwB,SAAUC,GACrC,IACC,OAAOH,EAAU,yBAA2BG,EAAmB,iBAAxDH,GACN,MAAO53F,MAGNq1D,EAAQv2D,OAAO6tB,yBACnB,GAAI0oC,EACH,IACCA,EAAM,GAAI,IACT,MAAOr1D,GACRq1D,EAAQ,KAIV,IAAI2iC,EAAiB,WACpB,MAAM,IAAIH,GAEPI,EAAiB5iC,EACjB,WACF,IAGC,OAAO2iC,EACN,MAAOE,GACR,IAEC,OAAO7iC,EAAM92D,UAAW,UAAU7F,IACjC,MAAOy/F,GACR,OAAOH,IAVR,GAcAA,EAEClzB,EAAa,EAAQ,KAAR,GAEbszB,EAAWt5F,OAAO0pB,gBAAkB,SAAUhT,GAAK,OAAOA,EAAE+S,WAE5D8vE,EAAY,GAEZC,EAAmC,oBAAfrnE,WAA6BvvB,EAAY02F,EAASnnE,YAEtEsnE,EAAa,CAChB,mBAA8C,oBAAnBC,eAAiC92F,EAAY82F,eACxE,UAAWx9F,MACX,gBAAwC,oBAAhBs8B,YAA8B51B,EAAY41B,YAClE,2BAA4BwtC,EAAaszB,EAAS,GAAGv3E,OAAOC,aAAepf,EAC3E,mCAAoCA,EACpC,kBAAmB22F,EACnB,mBAAoBA,EACpB,2BAA4BA,EAC5B,2BAA4BA,EAC5B,YAAgC,oBAAZI,QAA0B/2F,EAAY+2F,QAC1D,WAA8B,oBAAXhnE,OAAyB/vB,EAAY+vB,OACxD,YAAaD,QACb,aAAkC,oBAAbwtD,SAA2Bt9E,EAAYs9E,SAC5D,SAAUz4E,KACV,cAAemyF,UACf,uBAAwBC,mBACxB,cAAeC,UACf,uBAAwBC,mBACxB,UAAWtgG,MACX,SAAUugG,KACV,cAAeC,UACf,iBAA0C,oBAAjBC,aAA+Bt3F,EAAYs3F,aACpE,iBAA0C,oBAAjBC,aAA+Bv3F,EAAYu3F,aACpE,yBAA0D,oBAAzBC,qBAAuCx3F,EAAYw3F,qBACpF,aAActB,EACd,sBAAuBS,EACvB,cAAoC,oBAAdc,UAA4Bz3F,EAAYy3F,UAC9D,eAAsC,oBAAfC,WAA6B13F,EAAY03F,WAChE,eAAsC,oBAAfC,WAA6B33F,EAAY23F,WAChE,aAAc5gE,SACd,UAAW1J,MACX,sBAAuB+1C,EAAaszB,EAASA,EAAS,GAAGv3E,OAAOC,cAAgBpf,EAChF,SAA0B,iBAATQ,KAAoBA,KAAOR,EAC5C,QAAwB,oBAAR5J,IAAsB4J,EAAY5J,IAClD,yBAAyC,oBAARA,KAAwBgtE,EAAyBszB,GAAS,IAAItgG,KAAM+oB,OAAOC,aAAtCpf,EACtE,SAAU0I,KACV,WAAY3R,OACZ,WAAYqG,OACZ,eAAgBw6F,WAChB,aAAc1hE,SACd,YAAgC,oBAAZ9S,QAA0BpjB,EAAYojB,QAC1D,UAA4B,oBAAVsD,MAAwB1mB,EAAY0mB,MACtD,eAAgBuF,WAChB,mBAAoBrG,eACpB,YAAgC,oBAAZW,QAA0BvmB,EAAYumB,QAC1D,WAAY+I,OACZ,QAAwB,oBAARsC,IAAsB5xB,EAAY4xB,IAClD,yBAAyC,oBAARA,KAAwBwxC,EAAyBszB,GAAS,IAAI9kE,KAAMzS,OAAOC,aAAtCpf,EACtE,sBAAoD,oBAAtBspD,kBAAoCtpD,EAAYspD,kBAC9E,WAAY7lD,OACZ,4BAA6B2/D,EAAaszB,EAAS,GAAGv3E,OAAOC,aAAepf,EAC5E,WAAYojE,EAAajkD,OAASnf,EAClC,gBAAiBg2F,EACjB,mBAAoBO,EACpB,eAAgBK,EAChB,cAAeT,EACf,eAAsC,oBAAf5mE,WAA6BvvB,EAAYuvB,WAChE,sBAAoD,oBAAtBsoE,kBAAoC73F,EAAY63F,kBAC9E,gBAAwC,oBAAhBC,YAA8B93F,EAAY83F,YAClE,gBAAwC,oBAAhBC,YAA8B/3F,EAAY+3F,YAClE,aAAcC,SACd,YAAgC,oBAAZC,QAA0Bj4F,EAAYi4F,QAC1D,YAAgC,oBAAZC,QAA0Bl4F,EAAYk4F,QAC1D,YAAgC,oBAAZC,QAA0Bn4F,EAAYm4F,SAGvDC,EAAS,SAASA,EAAO1gG,GAC5B,IAAI2B,EACJ,GAAa,oBAAT3B,EACH2B,EAAQ+8F,EAAsB,6BACxB,GAAa,wBAAT1+F,EACV2B,EAAQ+8F,EAAsB,wBACxB,GAAa,6BAAT1+F,EACV2B,EAAQ+8F,EAAsB,8BACxB,GAAa,qBAAT1+F,EAA6B,CACvC,IAAImpB,EAAKu3E,EAAO,4BACZv3E,IACHxnB,EAAQwnB,EAAGhpB,gBAEN,GAAa,6BAATH,EAAqC,CAC/C,IAAIovE,EAAMsxB,EAAO,oBACbtxB,IACHztE,EAAQq9F,EAAS5vB,EAAIjvE,YAMvB,OAFAg/F,EAAWn/F,GAAQ2B,EAEZA,GAGJg/F,EAAiB,CACpB,yBAA0B,CAAC,cAAe,aAC1C,mBAAoB,CAAC,QAAS,aAC9B,uBAAwB,CAAC,QAAS,YAAa,WAC/C,uBAAwB,CAAC,QAAS,YAAa,WAC/C,oBAAqB,CAAC,QAAS,YAAa,QAC5C,sBAAuB,CAAC,QAAS,YAAa,UAC9C,2BAA4B,CAAC,gBAAiB,aAC9C,mBAAoB,CAAC,yBAA0B,aAC/C,4BAA6B,CAAC,yBAA0B,YAAa,aACrE,qBAAsB,CAAC,UAAW,aAClC,sBAAuB,CAAC,WAAY,aACpC,kBAAmB,CAAC,OAAQ,aAC5B,mBAAoB,CAAC,QAAS,aAC9B,uBAAwB,CAAC,YAAa,aACtC,0BAA2B,CAAC,eAAgB,aAC5C,0BAA2B,CAAC,eAAgB,aAC5C,sBAAuB,CAAC,WAAY,aACpC,cAAe,CAAC,oBAAqB,aACrC,uBAAwB,CAAC,oBAAqB,YAAa,aAC3D,uBAAwB,CAAC,YAAa,aACtC,wBAAyB,CAAC,aAAc,aACxC,wBAAyB,CAAC,aAAc,aACxC,cAAe,CAAC,OAAQ,SACxB,kBAAmB,CAAC,OAAQ,aAC5B,iBAAkB,CAAC,MAAO,aAC1B,oBAAqB,CAAC,SAAU,aAChC,oBAAqB,CAAC,SAAU,aAChC,sBAAuB,CAAC,SAAU,YAAa,YAC/C,qBAAsB,CAAC,SAAU,YAAa,WAC9C,qBAAsB,CAAC,UAAW,aAClC,sBAAuB,CAAC,UAAW,YAAa,QAChD,gBAAiB,CAAC,UAAW,OAC7B,mBAAoB,CAAC,UAAW,UAChC,oBAAqB,CAAC,UAAW,WACjC,wBAAyB,CAAC,aAAc,aACxC,4BAA6B,CAAC,iBAAkB,aAChD,oBAAqB,CAAC,SAAU,aAChC,iBAAkB,CAAC,MAAO,aAC1B,+BAAgC,CAAC,oBAAqB,aACtD,oBAAqB,CAAC,SAAU,aAChC,oBAAqB,CAAC,SAAU,aAChC,yBAA0B,CAAC,cAAe,aAC1C,wBAAyB,CAAC,aAAc,aACxC,uBAAwB,CAAC,YAAa,aACtC,wBAAyB,CAAC,aAAc,aACxC,+BAAgC,CAAC,oBAAqB,aACtD,yBAA0B,CAAC,cAAe,aAC1C,yBAA0B,CAAC,cAAe,aAC1C,sBAAuB,CAAC,WAAY,aACpC,qBAAsB,CAAC,UAAW,aAClC,qBAAsB,CAAC,UAAW,cAG/Bz2E,EAAO,EAAQ,MACfkzE,EAAS,EAAQ,MACjBwD,EAAU12E,EAAKzpB,KAAK6tB,SAAS7tB,KAAMmB,MAAMzB,UAAUsD,QACnDo9F,EAAe32E,EAAKzpB,KAAK6tB,SAASppB,MAAOtD,MAAMzB,UAAUsO,QACzDqyF,EAAW52E,EAAKzpB,KAAK6tB,SAAS7tB,KAAMsL,OAAO5L,UAAU2N,SACrDizF,EAAY72E,EAAKzpB,KAAK6tB,SAAS7tB,KAAMsL,OAAO5L,UAAU2C,OAGtDk+F,EAAa,qGACbC,EAAe,WACfC,EAAe,SAAsBzwF,GACxC,IAAI/D,EAAQq0F,EAAUtwF,EAAQ,EAAG,GAC7B2uC,EAAO2hD,EAAUtwF,GAAS,GAC9B,GAAc,MAAV/D,GAA0B,MAAT0yC,EACpB,MAAM,IAAIk/C,EAAa,kDACjB,GAAa,MAATl/C,GAA0B,MAAV1yC,EAC1B,MAAM,IAAI4xF,EAAa,kDAExB,IAAIl4F,EAAS,GAIb,OAHA06F,EAASrwF,EAAQuwF,GAAY,SAAUj5F,EAAOiI,EAAQmxF,EAAOC,GAC5Dh7F,EAAOA,EAAO5E,QAAU2/F,EAAQL,EAASM,EAAWH,EAAc,MAAQjxF,GAAUjI,KAE9E3B,GAIJi7F,EAAmB,SAA0BrhG,EAAM47D,GACtD,IACI0lC,EADAC,EAAgBvhG,EAOpB,GALIo9F,EAAOuD,EAAgBY,KAE1BA,EAAgB,KADhBD,EAAQX,EAAeY,IACK,GAAK,KAG9BnE,EAAO+B,EAAYoC,GAAgB,CACtC,IAAI5/F,EAAQw9F,EAAWoC,GAIvB,GAHI5/F,IAAUs9F,IACbt9F,EAAQ++F,EAAOa,SAEK,IAAV5/F,IAA0Bi6D,EACpC,MAAM,IAAI6iC,EAAW,aAAez+F,EAAO,wDAG5C,MAAO,CACNshG,MAAOA,EACPthG,KAAMuhG,EACN5/F,MAAOA,GAIT,MAAM,IAAI28F,EAAa,aAAet+F,EAAO,qBAG9CrB,EAAOC,QAAU,SAAsBoB,EAAM47D,GAC5C,GAAoB,iBAAT57D,GAAqC,IAAhBA,EAAKwB,OACpC,MAAM,IAAIi9F,EAAW,6CAEtB,GAAIt5F,UAAU3D,OAAS,GAA6B,kBAAjBo6D,EAClC,MAAM,IAAI6iC,EAAW,6CAGtB,IAAI9iE,EAAQulE,EAAalhG,GACrBwhG,EAAoB7lE,EAAMn6B,OAAS,EAAIm6B,EAAM,GAAK,GAElDkgC,EAAYwlC,EAAiB,IAAMG,EAAoB,IAAK5lC,GAC5D6lC,EAAoB5lC,EAAU77D,KAC9B2B,EAAQk6D,EAAUl6D,MAClB+/F,GAAqB,EAErBJ,EAAQzlC,EAAUylC,MAClBA,IACHE,EAAoBF,EAAM,GAC1BT,EAAallE,EAAOilE,EAAQ,CAAC,EAAG,GAAIU,KAGrC,IAAK,IAAI/1F,EAAI,EAAGo2F,GAAQ,EAAMp2F,EAAIowB,EAAMn6B,OAAQ+J,GAAK,EAAG,CACvD,IAAIq2F,EAAOjmE,EAAMpwB,GACbmB,EAAQq0F,EAAUa,EAAM,EAAG,GAC3BxiD,EAAO2hD,EAAUa,GAAO,GAC5B,IAEa,MAAVl1F,GAA2B,MAAVA,GAA2B,MAAVA,GACtB,MAAT0yC,GAAyB,MAATA,GAAyB,MAATA,IAElC1yC,IAAU0yC,EAEb,MAAM,IAAIk/C,EAAa,wDASxB,GAPa,gBAATsD,GAA2BD,IAC9BD,GAAqB,GAMlBtE,EAAO+B,EAFXsC,EAAoB,KADpBD,GAAqB,IAAMI,GACmB,KAG7CjgG,EAAQw9F,EAAWsC,QACb,GAAa,MAAT9/F,EAAe,CACzB,KAAMigG,KAAQjgG,GAAQ,CACrB,IAAKi6D,EACJ,MAAM,IAAI6iC,EAAW,sBAAwBz+F,EAAO,+CAErD,OAED,GAAIi8D,GAAU1wD,EAAI,GAAMowB,EAAMn6B,OAAQ,CACrC,IAAI86D,EAAOL,EAAMt6D,EAAOigG,GAWvBjgG,GAVDggG,IAAUrlC,IASG,QAASA,KAAU,kBAAmBA,EAAKh9D,KAC/Cg9D,EAAKh9D,IAELqC,EAAMigG,QAGfD,EAAQvE,EAAOz7F,EAAOigG,GACtBjgG,EAAQA,EAAMigG,GAGXD,IAAUD,IACbvC,EAAWsC,GAAqB9/F,IAInC,OAAOA,gCCtUR,IAAIkgG,EAA+B,oBAAXp6E,QAA0BA,OAC9Cq6E,EAAgB,EAAQ,MAE5BnjG,EAAOC,QAAU,WAChB,MAA0B,mBAAfijG,GACW,mBAAXp6E,QACsB,iBAAtBo6E,EAAW,QACO,iBAAlBp6E,OAAO,QAEXq6E,4BCRRnjG,EAAOC,QAAU,WAChB,GAAsB,mBAAX6oB,QAAiE,mBAAjC/hB,OAAO2tB,sBAAwC,OAAO,EACjG,GAA+B,iBAApB5L,OAAOC,SAAyB,OAAO,EAElD,IAAItjB,EAAM,GACNkvB,EAAM7L,OAAO,QACbs6E,EAASr8F,OAAO4tB,GACpB,GAAmB,iBAARA,EAAoB,OAAO,EAEtC,GAA4C,oBAAxC5tB,OAAOvF,UAAUgM,SAAS1L,KAAK6yB,GAA8B,OAAO,EACxE,GAA+C,oBAA3C5tB,OAAOvF,UAAUgM,SAAS1L,KAAKshG,GAAiC,OAAO,EAY3E,IAAKzuE,KADLlvB,EAAIkvB,GADS,GAEDlvB,EAAO,OAAO,EAC1B,GAA2B,mBAAhBsB,OAAOC,MAAmD,IAA5BD,OAAOC,KAAKvB,GAAK5C,OAAgB,OAAO,EAEjF,GAA0C,mBAA/BkE,OAAOw5D,qBAAiF,IAA3Cx5D,OAAOw5D,oBAAoB96D,GAAK5C,OAAgB,OAAO,EAE/G,IAAIwgG,EAAOt8F,OAAO2tB,sBAAsBjvB,GACxC,GAAoB,IAAhB49F,EAAKxgG,QAAgBwgG,EAAK,KAAO1uE,EAAO,OAAO,EAEnD,IAAK5tB,OAAOvF,UAAU21B,qBAAqBr1B,KAAK2D,EAAKkvB,GAAQ,OAAO,EAEpE,GAA+C,mBAApC5tB,OAAO6tB,yBAAyC,CAC1D,IAAIxF,EAAaroB,OAAO6tB,yBAAyBnvB,EAAKkvB,GACtD,GAdY,KAcRvF,EAAWpsB,QAA8C,IAA1BosB,EAAWN,WAAuB,OAAO,EAG7E,OAAO,gCCtCR,IAAIi+C,EAAa,EAAQ,MAEzB/sE,EAAOC,QAAU,WAChB,OAAO8sE,OAAkBjkD,OAAOw6E,0CCHjC,IAAI/3E,EAAO,EAAQ,MAEnBvrB,EAAOC,QAAUsrB,EAAKzpB,KAAK6tB,SAAS7tB,KAAMiF,OAAOvF,UAAUS,6CCH3D,IAAIQ,EAAS,eACT61C,EAAY,kBAShB,SAASirD,EAAUnnD,GACjB9D,EAAUx2C,KAAKP,MAEfA,KAAKiiG,OAAS/gG,EAAOkpC,YAAYyQ,GACjC76C,KAAKkiG,WAAarnD,EAClB76C,KAAKmiG,aAAe,EACpBniG,KAAKoiG,QAAU,CAAC,EAAG,EAAG,EAAG,GAEzBpiG,KAAKqiG,YAAa,EAhBL,EAAQ,KAmBvBziG,CAASoiG,EAAUjrD,GAEnBirD,EAAS/hG,UAAUo3C,WAAa,SAAU8F,EAAOnhB,EAAU8E,GACzD,IAAIv/B,EAAQ,KACZ,IACEvB,KAAKoxC,OAAO+L,EAAOnhB,GACnB,MAAOjyB,GACPxI,EAAQwI,EAGV+2B,EAASv/B,IAGXygG,EAAS/hG,UAAUw3C,OAAS,SAAU3W,GACpC,IAAIv/B,EAAQ,KACZ,IACEvB,KAAK+E,KAAK/E,KAAKikD,UACf,MAAOl6C,GACPxI,EAAQwI,EAGV+2B,EAASv/B,IAGXygG,EAAS/hG,UAAUmxC,OAAS,SAAUxwC,EAAMo7B,GAE1C,GA3CF,SAAmCr2B,EAAK28F,GACtC,IAAKphG,EAAOE,SAASuE,IAAuB,iBAARA,EAClC,MAAM,IAAIklB,UAAUy3E,qCAwCtBC,CAAyB3hG,GACrBZ,KAAKqiG,WAAY,MAAM,IAAIpjG,MAAM,yBAChCiC,EAAOE,SAASR,KAAOA,EAAOM,EAAO2M,KAAKjN,EAAMo7B,IAKrD,IAFA,IAAI6jB,EAAQ7/C,KAAKiiG,OACb5gG,EAAS,EACNrB,KAAKmiG,aAAevhG,EAAKU,OAASD,GAAUrB,KAAKkiG,YAAY,CAClE,IAAK,IAAI72F,EAAIrL,KAAKmiG,aAAc92F,EAAIrL,KAAKkiG,YAAariD,EAAMx0C,KAAOzK,EAAKS,KACxErB,KAAKk9C,UACLl9C,KAAKmiG,aAAe,EAEtB,KAAO9gG,EAAST,EAAKU,QAAQu+C,EAAM7/C,KAAKmiG,gBAAkBvhG,EAAKS,KAG/D,IAAK,IAAIiK,EAAI,EAAGyH,EAAsB,EAAdnS,EAAKU,OAAYyR,EAAQ,IAAKzH,EACpDtL,KAAKoiG,QAAQ92F,IAAMyH,GACnBA,EAAS/S,KAAKoiG,QAAQ92F,GAAK,WAAgB,GAC/B,IAAGtL,KAAKoiG,QAAQ92F,IAAM,WAAeyH,GAGnD,OAAO/S,MAGTgiG,EAAS/hG,UAAUi9C,QAAU,WAC3B,MAAM,IAAIj+C,MAAM,+BAGlB+iG,EAAS/hG,UAAUgkD,OAAS,SAAUjoB,GACpC,GAAIh8B,KAAKqiG,WAAY,MAAM,IAAIpjG,MAAM,yBACrCe,KAAKqiG,YAAa,EAElB,IAAIp+C,EAASjkD,KAAKwiG,eACDp6F,IAAb4zB,IAAwBioB,EAASA,EAAOh4C,SAAS+vB,IAGrDh8B,KAAKiiG,OAAOp9C,KAAK,GACjB7kD,KAAKmiG,aAAe,EACpB,IAAK,IAAI92F,EAAI,EAAGA,EAAI,IAAKA,EAAGrL,KAAKoiG,QAAQ/2F,GAAK,EAE9C,OAAO44C,GAGT+9C,EAAS/hG,UAAUuiG,QAAU,WAC3B,MAAM,IAAIvjG,MAAM,+BAGlBR,EAAOC,QAAUsjG,kBC9FjB,IAAIt+C,EAAOhlD,EAEXglD,EAAKqoB,MAAQ,EAAQ,MACrBroB,EAAK1U,OAAS,EAAQ,MACtB0U,EAAKgf,IAAM,EAAQ,MACnBhf,EAAK++C,OAAS,EAAQ,MACtB/+C,EAAKg/C,KAAO,EAAQ,MAGpBh/C,EAAK/jB,KAAO+jB,EAAKgf,IAAI/iC,KACrB+jB,EAAKkuC,OAASluC,EAAKgf,IAAIkvB,OACvBluC,EAAKi/C,OAASj/C,EAAKgf,IAAIigC,OACvBj/C,EAAKmuC,OAASnuC,EAAKgf,IAAImvB,OACvBnuC,EAAKouC,OAASpuC,EAAKgf,IAAIovB,OACvBpuC,EAAKk/C,UAAYl/C,EAAK++C,OAAOG,uCCZ7B,IAAI72B,EAAQ,EAAQ,MAChB3oE,EAAS,EAAQ,MAErB,SAASy/F,IACP7iG,KAAK8iG,QAAU,KACf9iG,KAAK+iG,aAAe,EACpB/iG,KAAK66C,UAAY76C,KAAKiC,YAAY44C,UAClC76C,KAAKgjG,QAAUhjG,KAAKiC,YAAY+gG,QAChChjG,KAAKyyF,aAAezyF,KAAKiC,YAAYwwF,aACrCzyF,KAAKijG,UAAYjjG,KAAKiC,YAAYghG,UAAY,EAC9CjjG,KAAK+P,OAAS,MAEd/P,KAAKkjG,QAAUljG,KAAK66C,UAAY,EAChC76C,KAAKmjG,SAAWnjG,KAAK66C,UAAY,GAEnCn8C,EAAQmkG,UAAYA,EAEpBA,EAAU5iG,UAAUmxC,OAAS,SAAgB3nC,EAAKhJ,GAUhD,GARAgJ,EAAMsiE,EAAM78D,QAAQzF,EAAKhJ,GACpBT,KAAK8iG,QAGR9iG,KAAK8iG,QAAU9iG,KAAK8iG,QAAQv/F,OAAOkG,GAFnCzJ,KAAK8iG,QAAUr5F,EAGjBzJ,KAAK+iG,cAAgBt5F,EAAInI,OAGrBtB,KAAK8iG,QAAQxhG,QAAUtB,KAAKkjG,QAAS,CAIvC,IAAIvyF,GAHJlH,EAAMzJ,KAAK8iG,SAGCxhG,OAAStB,KAAKkjG,QAC1BljG,KAAK8iG,QAAUr5F,EAAI7G,MAAM6G,EAAInI,OAASqP,EAAGlH,EAAInI,QACjB,IAAxBtB,KAAK8iG,QAAQxhG,SACftB,KAAK8iG,QAAU,MAEjBr5F,EAAMsiE,EAAMq3B,OAAO35F,EAAK,EAAGA,EAAInI,OAASqP,EAAG3Q,KAAK+P,QAChD,IAAK,IAAI1E,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,GAAKrL,KAAKmjG,SACxCnjG,KAAKk9C,QAAQzzC,EAAK4B,EAAGA,EAAIrL,KAAKmjG,UAGlC,OAAOnjG,MAGT6iG,EAAU5iG,UAAUgkD,OAAS,SAAgBxjD,GAI3C,OAHAT,KAAKoxC,OAAOpxC,KAAK8sE,QACjB1pE,EAAwB,OAAjBpD,KAAK8iG,SAEL9iG,KAAKwiG,QAAQ/hG,IAGtBoiG,EAAU5iG,UAAU6sE,KAAO,WACzB,IAAI1hE,EAAMpL,KAAK+iG,aACXrgG,EAAQ1C,KAAKkjG,QACblwF,EAAItQ,GAAU0I,EAAMpL,KAAKijG,WAAavgG,EACtCF,EAAM,IAAId,MAAMsR,EAAIhT,KAAKijG,WAC7BzgG,EAAI,GAAK,IACT,IAAK,IAAI6I,EAAI,EAAGA,EAAI2H,EAAG3H,IACrB7I,EAAI6I,GAAK,EAIX,GADAD,IAAQ,EACY,QAAhBpL,KAAK+P,OAAkB,CACzB,IAAK,IAAIwE,EAAI,EAAGA,EAAIvU,KAAKijG,UAAW1uF,IAClC/R,EAAI6I,KAAO,EAEb7I,EAAI6I,KAAO,EACX7I,EAAI6I,KAAO,EACX7I,EAAI6I,KAAO,EACX7I,EAAI6I,KAAO,EACX7I,EAAI6I,KAAQD,IAAQ,GAAM,IAC1B5I,EAAI6I,KAAQD,IAAQ,GAAM,IAC1B5I,EAAI6I,KAAQD,IAAQ,EAAK,IACzB5I,EAAI6I,KAAa,IAAND,OAWX,IATA5I,EAAI6I,KAAa,IAAND,EACX5I,EAAI6I,KAAQD,IAAQ,EAAK,IACzB5I,EAAI6I,KAAQD,IAAQ,GAAM,IAC1B5I,EAAI6I,KAAQD,IAAQ,GAAM,IAC1B5I,EAAI6I,KAAO,EACX7I,EAAI6I,KAAO,EACX7I,EAAI6I,KAAO,EACX7I,EAAI6I,KAAO,EAENkJ,EAAI,EAAGA,EAAIvU,KAAKijG,UAAW1uF,IAC9B/R,EAAI6I,KAAO,EAGf,OAAO7I,gCCxFT,IAAIupE,EAAQ,EAAQ,MAChB3oE,EAAS,EAAQ,MAErB,SAAS4/D,EAAKtf,EAAMr/C,EAAK5D,GACvB,KAAMT,gBAAgBgjE,GACpB,OAAO,IAAIA,EAAKtf,EAAMr/C,EAAK5D,GAC7BT,KAAK2iE,KAAOjf,EACZ1jD,KAAK66C,UAAY6I,EAAK7I,UAAY,EAClC76C,KAAKgjG,QAAUt/C,EAAKs/C,QAAU,EAC9BhjG,KAAKqjG,MAAQ,KACbrjG,KAAKsjG,MAAQ,KAEbtjG,KAAKkF,MAAM6mE,EAAM78D,QAAQ7K,EAAK5D,IAEhChC,EAAOC,QAAUskE,EAEjBA,EAAK/iE,UAAUiF,MAAQ,SAAcb,GAE/BA,EAAI/C,OAAStB,KAAK66C,YACpBx2C,GAAM,IAAIrE,KAAK2iE,MAAOvxB,OAAO/sC,GAAK4/C,UACpC7gD,EAAOiB,EAAI/C,QAAUtB,KAAK66C,WAG1B,IAAK,IAAIxvC,EAAIhH,EAAI/C,OAAQ+J,EAAIrL,KAAK66C,UAAWxvC,IAC3ChH,EAAIU,KAAK,GAEX,IAAKsG,EAAI,EAAGA,EAAIhH,EAAI/C,OAAQ+J,IAC1BhH,EAAIgH,IAAM,GAIZ,IAHArL,KAAKqjG,OAAQ,IAAIrjG,KAAK2iE,MAAOvxB,OAAO/sC,GAG/BgH,EAAI,EAAGA,EAAIhH,EAAI/C,OAAQ+J,IAC1BhH,EAAIgH,IAAM,IACZrL,KAAKsjG,OAAQ,IAAItjG,KAAK2iE,MAAOvxB,OAAO/sC,IAGtC2+D,EAAK/iE,UAAUmxC,OAAS,SAAgB3nC,EAAKhJ,GAE3C,OADAT,KAAKqjG,MAAMjyD,OAAO3nC,EAAKhJ,GAChBT,MAGTgjE,EAAK/iE,UAAUgkD,OAAS,SAAgBxjD,GAEtC,OADAT,KAAKsjG,MAAMlyD,OAAOpxC,KAAKqjG,MAAMp/C,UACtBjkD,KAAKsjG,MAAMr/C,OAAOxjD,iCC3C3B,IAAIsrE,EAAQ,EAAQ,MAChB/8B,EAAS,EAAQ,MAEjBu0D,EAASx3B,EAAMw3B,OACfC,EAAQz3B,EAAMy3B,MACdC,EAAU13B,EAAM03B,QAChBC,EAAU33B,EAAM23B,QAChBb,EAAY7zD,EAAO6zD,UAEvB,SAASpgC,IACP,KAAMziE,gBAAgByiE,GACpB,OAAO,IAAIA,EAEbogC,EAAUtiG,KAAKP,MAEfA,KAAK4f,EAAI,CAAE,WAAY,WAAY,WAAY,UAAY,YAC3D5f,KAAK+P,OAAS,SA0DhB,SAAS4lB,EAAErqB,EAAG4Q,EAAGC,EAAG4K,GAClB,OAAIzb,GAAK,GACA4Q,EAAIC,EAAI4K,EACRzb,GAAK,GACJ4Q,EAAIC,GAAQD,EAAK6K,EAClBzb,GAAK,IACJ4Q,GAAMC,GAAM4K,EACbzb,GAAK,GACJ4Q,EAAI6K,EAAM5K,GAAM4K,EAEjB7K,GAAKC,GAAM4K,GAGtB,SAAS48E,EAAEr4F,GACT,OAAIA,GAAK,GACA,EACAA,GAAK,GACL,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WAEA,WAGX,SAASs4F,EAAGt4F,GACV,OAAIA,GAAK,GACA,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WACAA,GAAK,GACL,WAEA,EA5FXygE,EAAMnsE,SAAS6iE,EAAWogC,GAC1BnkG,EAAQkkG,UAAYngC,EAEpBA,EAAU5nB,UAAY,IACtB4nB,EAAUugC,QAAU,IACpBvgC,EAAUgwB,aAAe,IACzBhwB,EAAUwgC,UAAY,GAEtBxgC,EAAUxiE,UAAUi9C,QAAU,SAAgBzzC,EAAK5C,GAWjD,IAVA,IAAI+a,EAAI5hB,KAAK4f,EAAE,GACXiC,EAAI7hB,KAAK4f,EAAE,GACXkC,EAAI9hB,KAAK4f,EAAE,GACXmC,EAAI/hB,KAAK4f,EAAE,GACXk6C,EAAI95D,KAAK4f,EAAE,GACXikF,EAAKjiF,EACLkiF,EAAKjiF,EACLkiF,EAAKjiF,EACLkiF,EAAKjiF,EACLkiF,EAAKnqC,EACAxuD,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAC3B,IAAI44F,EAAIV,EACND,EACEG,EAAQ9hF,EAAG+T,EAAErqB,EAAGuW,EAAGC,EAAGC,GAAItY,EAAIkH,EAAErF,GAAKzE,GAAQ88F,EAAEr4F,IAC/C6R,EAAE7R,IACJwuD,GACFl4C,EAAIk4C,EACJA,EAAI/3C,EACJA,EAAIwhF,EAAOzhF,EAAG,IACdA,EAAID,EACJA,EAAIqiF,EACJA,EAAIV,EACFD,EACEG,EAAQG,EAAIluE,EAAE,GAAKrqB,EAAGw4F,EAAIC,EAAIC,GAAKv6F,EAAI06F,EAAG74F,GAAKzE,GAAQ+8F,EAAGt4F,IAC1D84F,EAAG94F,IACL24F,GACFJ,EAAKI,EACLA,EAAKD,EACLA,EAAKT,EAAOQ,EAAI,IAChBA,EAAKD,EACLA,EAAKI,EAEPA,EAAIT,EAAQzjG,KAAK4f,EAAE,GAAIkC,EAAGkiF,GAC1BhkG,KAAK4f,EAAE,GAAK6jF,EAAQzjG,KAAK4f,EAAE,GAAImC,EAAGkiF,GAClCjkG,KAAK4f,EAAE,GAAK6jF,EAAQzjG,KAAK4f,EAAE,GAAIk6C,EAAG+pC,GAClC7jG,KAAK4f,EAAE,GAAK6jF,EAAQzjG,KAAK4f,EAAE,GAAIgC,EAAGkiF,GAClC9jG,KAAK4f,EAAE,GAAK6jF,EAAQzjG,KAAK4f,EAAE,GAAIiC,EAAGkiF,GAClC/jG,KAAK4f,EAAE,GAAKskF,GAGdzhC,EAAUxiE,UAAUuiG,QAAU,SAAgB/hG,GAC5C,MAAY,QAARA,EACKsrE,EAAMs4B,QAAQrkG,KAAK4f,EAAG,UAEtBmsD,EAAMu4B,QAAQtkG,KAAK4f,EAAG,WA0CjC,IAAIjP,EAAI,CACN,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,IAGhDwzF,EAAK,CACP,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAClD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAClD,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,IAGhDhnF,EAAI,CACN,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EACrD,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GACpD,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GACpD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,GAGnDinF,EAAK,CACP,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EACrD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GACpD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EACrD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EACrD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,iCC9ItD1lG,EAAQihC,KAAO,EAAf,MACAjhC,EAAQikG,OAAS,EAAjB,KACAjkG,EAAQkzF,OAAS,EAAjB,MACAlzF,EAAQmzF,OAAS,EAAjB,KACAnzF,EAAQozF,OAAS,EAAjB,mCCJA,IAAI/lB,EAAQ,EAAQ,MAChB/8B,EAAS,EAAQ,MACjBu1D,EAAY,EAAQ,MAEpBhB,EAASx3B,EAAMw3B,OACfC,EAAQz3B,EAAMy3B,MACdgB,EAAUz4B,EAAMy4B,QAChBC,EAAOF,EAAUE,KACjB5B,EAAY7zD,EAAO6zD,UAEnB6B,EAAS,CACX,WAAY,WACZ,WAAY,YAGd,SAASC,IACP,KAAM3kG,gBAAgB2kG,GACpB,OAAO,IAAIA,EAEb9B,EAAUtiG,KAAKP,MACfA,KAAK4f,EAAI,CACP,WAAY,WAAY,WACxB,UAAY,YACd5f,KAAK4kG,EAAI,IAAIljG,MAAM,IAGrBqqE,EAAMnsE,SAAS+kG,EAAM9B,GACrBpkG,EAAOC,QAAUimG,EAEjBA,EAAK9pD,UAAY,IACjB8pD,EAAK3B,QAAU,IACf2B,EAAKlS,aAAe,GACpBkS,EAAK1B,UAAY,GAEjB0B,EAAK1kG,UAAUi9C,QAAU,SAAiBzzC,EAAK5C,GAG7C,IAFA,IAAI+9F,EAAI5kG,KAAK4kG,EAEJv5F,EAAI,EAAGA,EAAI,GAAIA,IACtBu5F,EAAEv5F,GAAK5B,EAAI5C,EAAQwE,GAErB,KAAMA,EAAIu5F,EAAEtjG,OAAQ+J,IAClBu5F,EAAEv5F,GAAKk4F,EAAOqB,EAAEv5F,EAAI,GAAKu5F,EAAEv5F,EAAI,GAAKu5F,EAAEv5F,EAAI,IAAMu5F,EAAEv5F,EAAI,IAAK,GAE7D,IAAIuH,EAAI5S,KAAK4f,EAAE,GACX/M,EAAI7S,KAAK4f,EAAE,GACXpP,EAAIxQ,KAAK4f,EAAE,GACX0c,EAAIt8B,KAAK4f,EAAE,GACXlZ,EAAI1G,KAAK4f,EAAE,GAEf,IAAKvU,EAAI,EAAGA,EAAIu5F,EAAEtjG,OAAQ+J,IAAK,CAC7B,IAAI8R,KAAO9R,EAAI,IACXkJ,EAAIiwF,EAAQjB,EAAO3wF,EAAG,GAAI6xF,EAAKtnF,EAAGtK,EAAGrC,EAAG8rB,GAAI51B,EAAGk+F,EAAEv5F,GAAIq5F,EAAOvnF,IAChEzW,EAAI41B,EACJA,EAAI9rB,EACJA,EAAI+yF,EAAO1wF,EAAG,IACdA,EAAID,EACJA,EAAI2B,EAGNvU,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAIhN,GAC7B5S,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAI/M,GAC7B7S,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAIpP,GAC7BxQ,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAI0c,GAC7Bt8B,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAIlZ,IAG/Bi+F,EAAK1kG,UAAUuiG,QAAU,SAAgB/hG,GACvC,MAAY,QAARA,EACKsrE,EAAMs4B,QAAQrkG,KAAK4f,EAAG,OAEtBmsD,EAAMu4B,QAAQtkG,KAAK4f,EAAG,oCCtEjC,IAAImsD,EAAQ,EAAQ,MAChB84B,EAAS,EAAQ,MAErB,SAASC,IACP,KAAM9kG,gBAAgB8kG,GACpB,OAAO,IAAIA,EAEbD,EAAOtkG,KAAKP,MACZA,KAAK4f,EAAI,CACP,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,YAExCmsD,EAAMnsE,SAASklG,EAAQD,GACvBpmG,EAAOC,QAAUomG,EAEjBA,EAAOjqD,UAAY,IACnBiqD,EAAO9B,QAAU,IACjB8B,EAAOrS,aAAe,IACtBqS,EAAO7B,UAAY,GAEnB6B,EAAO7kG,UAAUuiG,QAAU,SAAgB/hG,GAEzC,MAAY,QAARA,EACKsrE,EAAMs4B,QAAQrkG,KAAK4f,EAAEhd,MAAM,EAAG,GAAI,OAElCmpE,EAAMu4B,QAAQtkG,KAAK4f,EAAEhd,MAAM,EAAG,GAAI,qCCzB7C,IAAImpE,EAAQ,EAAQ,MAChB/8B,EAAS,EAAQ,MACjBu1D,EAAY,EAAQ,MACpBnhG,EAAS,EAAQ,MAEjBogG,EAAQz3B,EAAMy3B,MACdE,EAAU33B,EAAM23B,QAChBc,EAAUz4B,EAAMy4B,QAChBO,EAAOR,EAAUQ,KACjBC,EAAQT,EAAUS,MAClBC,EAASV,EAAUU,OACnBC,EAASX,EAAUW,OACnBC,EAASZ,EAAUY,OACnBC,EAASb,EAAUa,OAEnBvC,EAAY7zD,EAAO6zD,UAEnBwC,EAAW,CACb,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,UAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,YAGtC,SAASR,IACP,KAAM7kG,gBAAgB6kG,GACpB,OAAO,IAAIA,EAEbhC,EAAUtiG,KAAKP,MACfA,KAAK4f,EAAI,CACP,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,YAEtC5f,KAAKgT,EAAIqyF,EACTrlG,KAAK4kG,EAAI,IAAIljG,MAAM,IAErBqqE,EAAMnsE,SAASilG,EAAQhC,GACvBpkG,EAAOC,QAAUmmG,EAEjBA,EAAOhqD,UAAY,IACnBgqD,EAAO7B,QAAU,IACjB6B,EAAOpS,aAAe,IACtBoS,EAAO5B,UAAY,GAEnB4B,EAAO5kG,UAAUi9C,QAAU,SAAiBzzC,EAAK5C,GAG/C,IAFA,IAAI+9F,EAAI5kG,KAAK4kG,EAEJv5F,EAAI,EAAGA,EAAI,GAAIA,IACtBu5F,EAAEv5F,GAAK5B,EAAI5C,EAAQwE,GACrB,KAAOA,EAAIu5F,EAAEtjG,OAAQ+J,IACnBu5F,EAAEv5F,GAAKq4F,EAAQ0B,EAAOR,EAAEv5F,EAAI,IAAKu5F,EAAEv5F,EAAI,GAAI85F,EAAOP,EAAEv5F,EAAI,KAAMu5F,EAAEv5F,EAAI,KAEtE,IAAIuH,EAAI5S,KAAK4f,EAAE,GACX/M,EAAI7S,KAAK4f,EAAE,GACXpP,EAAIxQ,KAAK4f,EAAE,GACX0c,EAAIt8B,KAAK4f,EAAE,GACXlZ,EAAI1G,KAAK4f,EAAE,GACX+V,EAAI31B,KAAK4f,EAAE,GACXoC,EAAIhiB,KAAK4f,EAAE,GACXA,EAAI5f,KAAK4f,EAAE,GAGf,IADAxc,EAAOpD,KAAKgT,EAAE1R,SAAWsjG,EAAEtjG,QACtB+J,EAAI,EAAGA,EAAIu5F,EAAEtjG,OAAQ+J,IAAK,CAC7B,IAAIi6F,EAAKd,EAAQ5kF,EAAGslF,EAAOx+F,GAAIq+F,EAAKr+F,EAAGivB,EAAG3T,GAAIhiB,KAAKgT,EAAE3H,GAAIu5F,EAAEv5F,IACvDk6F,EAAK/B,EAAMyB,EAAOryF,GAAIoyF,EAAMpyF,EAAGC,EAAGrC,IACtCoP,EAAIoC,EACJA,EAAI2T,EACJA,EAAIjvB,EACJA,EAAI88F,EAAMlnE,EAAGgpE,GACbhpE,EAAI9rB,EACJA,EAAIqC,EACJA,EAAID,EACJA,EAAI4wF,EAAM8B,EAAIC,GAGhBvlG,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAIhN,GAC7B5S,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAI/M,GAC7B7S,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAIpP,GAC7BxQ,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAI0c,GAC7Bt8B,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAIlZ,GAC7B1G,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAI+V,GAC7B31B,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAIoC,GAC7BhiB,KAAK4f,EAAE,GAAK4jF,EAAMxjG,KAAK4f,EAAE,GAAIA,IAG/BilF,EAAO5kG,UAAUuiG,QAAU,SAAgB/hG,GACzC,MAAY,QAARA,EACKsrE,EAAMs4B,QAAQrkG,KAAK4f,EAAG,OAEtBmsD,EAAMu4B,QAAQtkG,KAAK4f,EAAG,oCCrGjC,IAAImsD,EAAQ,EAAQ,MAEhBy5B,EAAS,EAAQ,MAErB,SAASC,IACP,KAAMzlG,gBAAgBylG,GACpB,OAAO,IAAIA,EAEbD,EAAOjlG,KAAKP,MACZA,KAAK4f,EAAI,CACP,WAAY,WACZ,WAAY,UACZ,WAAY,UACZ,UAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,YAEhBmsD,EAAMnsE,SAAS6lG,EAAQD,GACvB/mG,EAAOC,QAAU+mG,EAEjBA,EAAO5qD,UAAY,KACnB4qD,EAAOzC,QAAU,IACjByC,EAAOhT,aAAe,IACtBgT,EAAOxC,UAAY,IAEnBwC,EAAOxlG,UAAUuiG,QAAU,SAAgB/hG,GACzC,MAAY,QAARA,EACKsrE,EAAMs4B,QAAQrkG,KAAK4f,EAAEhd,MAAM,EAAG,IAAK,OAEnCmpE,EAAMu4B,QAAQtkG,KAAK4f,EAAEhd,MAAM,EAAG,IAAK,qCC/B9C,IAAImpE,EAAQ,EAAQ,MAChB/8B,EAAS,EAAQ,MACjB5rC,EAAS,EAAQ,MAEjBsiG,EAAY35B,EAAM25B,UAClBC,EAAY55B,EAAM45B,UAClBC,EAAW75B,EAAM65B,SACjBC,EAAW95B,EAAM85B,SACjBC,EAAQ/5B,EAAM+5B,MACdC,EAAWh6B,EAAMg6B,SACjBC,EAAWj6B,EAAMi6B,SACjBC,EAAal6B,EAAMk6B,WACnBC,EAAan6B,EAAMm6B,WACnBC,EAAap6B,EAAMo6B,WACnBC,EAAar6B,EAAMq6B,WAEnBvD,EAAY7zD,EAAO6zD,UAEnBwD,EAAW,CACb,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,UAAY,UAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,YAGtC,SAASb,IACP,KAAMxlG,gBAAgBwlG,GACpB,OAAO,IAAIA,EAEb3C,EAAUtiG,KAAKP,MACfA,KAAK4f,EAAI,CACP,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,WACZ,WAAY,UACZ,UAAY,WACZ,WAAY,WACd5f,KAAKgT,EAAIqzF,EACTrmG,KAAK4kG,EAAI,IAAIljG,MAAM,KAyIrB,SAAS4kG,EAAQC,EAAIC,EAAIC,EAAIC,EAAIC,GAC/B,IAAIh2F,EAAK41F,EAAKE,GAASF,EAAMI,EAG7B,OAFIh2F,EAAI,IACNA,GAAK,YACAA,EAGT,SAASi2F,EAAQL,EAAIC,EAAIC,EAAIC,EAAIC,EAAIE,GACnC,IAAIl2F,EAAK61F,EAAKE,GAASF,EAAMK,EAG7B,OAFIl2F,EAAI,IACNA,GAAK,YACAA,EAGT,SAASm2F,EAASP,EAAIC,EAAIC,EAAIC,EAAIC,GAChC,IAAIh2F,EAAK41F,EAAKE,EAAOF,EAAKI,EAAOF,EAAKE,EAGtC,OAFIh2F,EAAI,IACNA,GAAK,YACAA,EAGT,SAASo2F,EAASR,EAAIC,EAAIC,EAAIC,EAAIC,EAAIE,GACpC,IAAIl2F,EAAK61F,EAAKE,EAAOF,EAAKK,EAAOH,EAAKG,EAGtC,OAFIl2F,EAAI,IACNA,GAAK,YACAA,EAGT,SAASq2F,EAAUT,EAAIC,GACrB,IAII71F,EAJQ+0F,EAAUa,EAAIC,EAAI,IAClBd,EAAUc,EAAID,EAAI,GAClBb,EAAUc,EAAID,EAAI,GAK9B,OAFI51F,EAAI,IACNA,GAAK,YACAA,EAGT,SAASs2F,EAAUV,EAAIC,GACrB,IAII71F,EAJQg1F,EAAUY,EAAIC,EAAI,IAClBb,EAAUa,EAAID,EAAI,GAClBZ,EAAUa,EAAID,EAAI,GAK9B,OAFI51F,EAAI,IACNA,GAAK,YACAA,EAcT,SAASu2F,EAAUX,EAAIC,GACrB,IAII71F,EAJQg1F,EAAUY,EAAIC,EAAI,IAClBb,EAAUY,EAAIC,EAAI,IAClBb,EAAUa,EAAID,EAAI,GAK9B,OAFI51F,EAAI,IACNA,GAAK,YACAA,EAGT,SAASw2F,EAAUZ,EAAIC,GACrB,IAII71F,EAJQ+0F,EAAUa,EAAIC,EAAI,GAClBd,EAAUa,EAAIC,EAAI,GAClBZ,EAASW,EAAIC,EAAI,GAK7B,OAFI71F,EAAI,IACNA,GAAK,YACAA,EAGT,SAASy2F,EAAUb,EAAIC,GACrB,IAII71F,EAJQg1F,EAAUY,EAAIC,EAAI,GAClBb,EAAUY,EAAIC,EAAI,GAClBX,EAASU,EAAIC,EAAI,GAK7B,OAFI71F,EAAI,IACNA,GAAK,YACAA,EAcT,SAAS02F,EAAUd,EAAIC,GACrB,IAII71F,EAJQg1F,EAAUY,EAAIC,EAAI,IAClBb,EAAUa,EAAID,EAAI,IAClBV,EAASU,EAAIC,EAAI,GAK7B,OAFI71F,EAAI,IACNA,GAAK,YACAA,EAxPTo7D,EAAMnsE,SAAS4lG,EAAQ3C,GACvBpkG,EAAOC,QAAU8mG,EAEjBA,EAAO3qD,UAAY,KACnB2qD,EAAOxC,QAAU,IACjBwC,EAAO/S,aAAe,IACtB+S,EAAOvC,UAAY,IAEnBuC,EAAOvlG,UAAUqnG,cAAgB,SAAuB79F,EAAK5C,GAI3D,IAHA,IAAI+9F,EAAI5kG,KAAK4kG,EAGJv5F,EAAI,EAAGA,EAAI,GAAIA,IACtBu5F,EAAEv5F,GAAK5B,EAAI5C,EAAQwE,GACrB,KAAOA,EAAIu5F,EAAEtjG,OAAQ+J,GAAK,EAAG,CAC3B,IAAIk8F,GAsNWhB,EAtNO3B,EAAEv5F,EAAI,GAsNTm7F,EAtNa5B,EAAEv5F,EAAI,GA2NpCsF,OAAAA,GAAAA,EAJQ+0F,EAAUa,EAAIC,EAAI,IAClBd,EAAUc,EAAID,EAAI,IAClBX,EAASW,EAAIC,EAAI,IAGrB,IACN71F,GAAK,YACAA,GA7ND62F,EAAQH,EAAUzC,EAAEv5F,EAAI,GAAIu5F,EAAEv5F,EAAI,IAClCo8F,EAAQ7C,EAAEv5F,EAAI,IACdq8F,EAAQ9C,EAAEv5F,EAAI,IACds8F,EAAQR,EAAUvC,EAAEv5F,EAAI,IAAKu5F,EAAEv5F,EAAI,KACnCu8F,EAAQR,EAAUxC,EAAEv5F,EAAI,IAAKu5F,EAAEv5F,EAAI,KACnCw8F,EAAQjD,EAAEv5F,EAAI,IACdy8F,EAAQlD,EAAEv5F,EAAI,IAElBu5F,EAAEv5F,GAAK46F,EACLsB,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,GACTlD,EAAEv5F,EAAI,GAAK66F,EACTqB,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,GAoMb,IAAmBvB,EAAIC,EAKjB71F,GArMN60F,EAAOvlG,UAAUi9C,QAAU,SAAiBzzC,EAAK5C,GAC/C7G,KAAKsnG,cAAc79F,EAAK5C,GAExB,IAiJiB0/F,EAAIC,EAKjB71F,EAtJAi0F,EAAI5kG,KAAK4kG,EAETmD,EAAK/nG,KAAK4f,EAAE,GACZooF,EAAKhoG,KAAK4f,EAAE,GACZqoF,EAAKjoG,KAAK4f,EAAE,GACZugC,EAAKngD,KAAK4f,EAAE,GACZsoF,EAAKloG,KAAK4f,EAAE,GACZuoF,EAAKnoG,KAAK4f,EAAE,GACZioD,EAAK7nE,KAAK4f,EAAE,GACZwoF,EAAKpoG,KAAK4f,EAAE,GACZyoF,EAAKroG,KAAK4f,EAAE,GACZ0oF,EAAKtoG,KAAK4f,EAAE,GACZ2oF,EAAKvoG,KAAK4f,EAAE,IACZ4oF,EAAKxoG,KAAK4f,EAAE,IACZ6oF,EAAKzoG,KAAK4f,EAAE,IACZ8oF,EAAK1oG,KAAK4f,EAAE,IACZ+oF,EAAK3oG,KAAK4f,EAAE,IACZgpF,EAAK5oG,KAAK4f,EAAE,IAEhBxc,EAAOpD,KAAKgT,EAAE1R,SAAWsjG,EAAEtjG,QAC3B,IAAK,IAAI+J,EAAI,EAAGA,EAAIu5F,EAAEtjG,OAAQ+J,GAAK,EAAG,CACpC,IAAIk8F,EAAQoB,EACRnB,EAAQoB,EACRnB,GA+HF92F,OAAAA,GAAAA,EAJQ+0F,EADKa,EA1HO8B,EA0HH7B,EA1HO8B,EA2HE,IAClB5C,EAAUa,EAAIC,EAAI,IAClBd,EAAUc,EAAID,EAAI,IAGtB,IACN51F,GAAK,YACAA,GAjID+2F,EAAQR,EAAUmB,EAAIC,GACtBX,EAAQrB,EAAQ+B,EAAIC,EAAIC,EAAIC,EAAIC,GAChCb,EAAQhB,EAAQyB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GACpCb,EAAQ7nG,KAAKgT,EAAE3H,GACfy8F,EAAQ9nG,KAAKgT,EAAE3H,EAAI,GACnBw9F,EAAQjE,EAAEv5F,GACVy9F,EAAQlE,EAAEv5F,EAAI,GAEd09F,EAAQ5C,EACVoB,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPe,EAAOC,GACLE,EAAQ5C,EACVmB,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPC,EAAOC,EACPe,EAAOC,GAETvB,EAAQP,EAAUe,EAAIC,GACtBR,EAAQP,EAAUc,EAAIC,GACtBP,EAAQX,EAASiB,EAAIC,EAAIC,EAAI9nD,EAAI+nD,GACjCR,EAAQX,EAASgB,EAAIC,EAAIC,EAAI9nD,EAAI+nD,EAAIC,GAErC,IAAIc,EAAQlD,EAASwB,EAAOC,EAAOC,EAAOC,GACtCwB,EAAQlD,EAASuB,EAAOC,EAAOC,EAAOC,GAE1CiB,EAAKF,EACLG,EAAKF,EAELD,EAAKF,EACLG,EAAKF,EAELD,EAAKF,EACLG,EAAKF,EAELD,EAAKtC,EAASl+B,EAAIugC,EAAIW,EAAOC,GAC7BV,EAAKtC,EAASoC,EAAIA,EAAIW,EAAOC,GAE7BnhC,EAAKqgC,EACLE,EAAKD,EAELD,EAAKD,EACLE,EAAKhoD,EAEL8nD,EAAKF,EACL5nD,EAAK6nD,EAELD,EAAKhC,EAASgD,EAAOC,EAAOC,EAAOC,GACnClB,EAAKhC,EAAS+C,EAAOC,EAAOC,EAAOC,GAGrCpD,EAAM9lG,KAAK4f,EAAG,EAAGmoF,EAAIC,GACrBlC,EAAM9lG,KAAK4f,EAAG,EAAGqoF,EAAI9nD,GACrB2lD,EAAM9lG,KAAK4f,EAAG,EAAGsoF,EAAIC,GACrBrC,EAAM9lG,KAAK4f,EAAG,EAAGioD,EAAIugC,GACrBtC,EAAM9lG,KAAK4f,EAAG,EAAGyoF,EAAIC,GACrBxC,EAAM9lG,KAAK4f,EAAG,GAAI2oF,EAAIC,GACtB1C,EAAM9lG,KAAK4f,EAAG,GAAI6oF,EAAIC,GACtB5C,EAAM9lG,KAAK4f,EAAG,GAAI+oF,EAAIC,IAGxBpD,EAAOvlG,UAAUuiG,QAAU,SAAgB/hG,GACzC,MAAY,QAARA,EACKsrE,EAAMs4B,QAAQrkG,KAAK4f,EAAG,OAEtBmsD,EAAMu4B,QAAQtkG,KAAK4f,EAAG,qCClNjC,IACIupF,EADQ,EAAQ,MACDA,OAYnB,SAASpE,EAAK7oF,EAAGC,EAAG4K,GAClB,OAAQ7K,EAAIC,GAAQD,EAAK6K,EAI3B,SAASi+E,EAAM9oF,EAAGC,EAAG4K,GACnB,OAAQ7K,EAAIC,EAAMD,EAAI6K,EAAM5K,EAAI4K,EAIlC,SAASqiF,EAAIltF,EAAGC,EAAG4K,GACjB,OAAO7K,EAAIC,EAAI4K,EAbjBroB,EAAQ+lG,KARR,SAActnF,EAAGjB,EAAGC,EAAG4K,GACrB,OAAU,IAAN5J,EACK4nF,EAAK7oF,EAAGC,EAAG4K,GACV,IAAN5J,GAAiB,IAANA,EACNisF,EAAIltF,EAAGC,EAAG4K,GACT,IAAN5J,EACK6nF,EAAM9oF,EAAGC,EAAG4K,QADrB,GAQFroB,EAAQqmG,KAAOA,EAKfrmG,EAAQsmG,MAAQA,EAKhBtmG,EAAQ0qG,IAAMA,EAKd1qG,EAAQumG,OAHR,SAAgB/oF,GACd,OAAOitF,EAAOjtF,EAAG,GAAKitF,EAAOjtF,EAAG,IAAMitF,EAAOjtF,EAAG,KAOlDxd,EAAQwmG,OAHR,SAAgBhpF,GACd,OAAOitF,EAAOjtF,EAAG,GAAKitF,EAAOjtF,EAAG,IAAMitF,EAAOjtF,EAAG,KAOlDxd,EAAQymG,OAHR,SAAgBjpF,GACd,OAAOitF,EAAOjtF,EAAG,GAAKitF,EAAOjtF,EAAG,IAAOA,IAAM,GAO/Cxd,EAAQ0mG,OAHR,SAAgBlpF,GACd,OAAOitF,EAAOjtF,EAAG,IAAMitF,EAAOjtF,EAAG,IAAOA,IAAM,iCC5ChD,IAAI9Y,EAAS,EAAQ,MACjBxD,EAAW,EAAQ,MAIvB,SAASypG,EAAgB5/F,EAAK4B,GAC5B,OAAqC,QAAZ,MAApB5B,EAAI4E,WAAWhD,OAGhBA,EAAI,GAAKA,EAAI,GAAK5B,EAAInI,SAGkB,QAAZ,MAAxBmI,EAAI4E,WAAWhD,EAAI,IA0D7B,SAASi+F,EAAM93F,GAKb,OAJWA,IAAM,GACLA,IAAM,EAAK,MACXA,GAAK,EAAK,UACN,IAAJA,IAAa,MACV,EAgBjB,SAASulF,EAAMhlF,GACb,OAAoB,IAAhBA,EAAKzQ,OACA,IAAMyQ,EAENA,EAIX,SAASw3F,EAAMx3F,GACb,OAAoB,IAAhBA,EAAKzQ,OACA,IAAMyQ,EACU,IAAhBA,EAAKzQ,OACL,KAAOyQ,EACS,IAAhBA,EAAKzQ,OACL,MAAQyQ,EACQ,IAAhBA,EAAKzQ,OACL,OAASyQ,EACO,IAAhBA,EAAKzQ,OACL,QAAUyQ,EACM,IAAhBA,EAAKzQ,OACL,SAAWyQ,EACK,IAAhBA,EAAKzQ,OACL,UAAYyQ,EAEZA,EAhHXrT,EAAQkB,SAAWA,EAyDnBlB,EAAQwQ,QA7CR,SAAiBzF,EAAKhJ,GACpB,GAAIiB,MAAMC,QAAQ8H,GAChB,OAAOA,EAAI7G,QACb,IAAK6G,EACH,MAAO,GACT,IAAIjH,EAAM,GACV,GAAmB,iBAARiH,EACT,GAAKhJ,GAyBE,GAAY,QAARA,EAIT,KAHAgJ,EAAMA,EAAImE,QAAQ,eAAgB,KAC1BtM,OAAS,GAAM,IACrBmI,EAAM,IAAMA,GACT4B,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,GAAK,EAC/B7I,EAAIuC,KAAKu5B,SAAS70B,EAAI4B,GAAK5B,EAAI4B,EAAI,GAAI,UAxBzC,IADA,IAAImE,EAAI,EACCnE,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,IAAK,CACnC,IAAImF,EAAI/G,EAAI4E,WAAWhD,GACnBmF,EAAI,IACNhO,EAAIgN,KAAOgB,EACFA,EAAI,MACbhO,EAAIgN,KAAQgB,GAAK,EAAK,IACtBhO,EAAIgN,KAAY,GAAJgB,EAAU,KACb64F,EAAgB5/F,EAAK4B,IAC9BmF,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtB/G,EAAI4E,aAAahD,IACvD7I,EAAIgN,KAAQgB,GAAK,GAAM,IACvBhO,EAAIgN,KAASgB,GAAK,GAAM,GAAM,IAC9BhO,EAAIgN,KAASgB,GAAK,EAAK,GAAM,IAC7BhO,EAAIgN,KAAY,GAAJgB,EAAU,MAEtBhO,EAAIgN,KAAQgB,GAAK,GAAM,IACvBhO,EAAIgN,KAASgB,GAAK,EAAK,GAAM,IAC7BhO,EAAIgN,KAAY,GAAJgB,EAAU,UAW5B,IAAKnF,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,IAC1B7I,EAAI6I,GAAc,EAAT5B,EAAI4B,GAEjB,OAAO7I,GAUT9D,EAAQk4F,MANR,SAAentF,GAEb,IADA,IAAIjH,EAAM,GACD6I,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,IAC9B7I,GAAOu0F,EAAMttF,EAAI4B,GAAGY,SAAS,KAC/B,OAAOzJ,GAWT9D,EAAQ4qG,MAAQA,EAYhB5qG,EAAQ2lG,QAVR,SAAiB56F,EAAKsG,GAEpB,IADA,IAAIvN,EAAM,GACD6I,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,IAAK,CACnC,IAAImG,EAAI/H,EAAI4B,GACG,WAAX0E,IACFyB,EAAI83F,EAAM93F,IACZhP,GAAO+mG,EAAM/3F,EAAEvF,SAAS,KAE1B,OAAOzJ,GAUT9D,EAAQq4F,MAAQA,EAoBhBr4F,EAAQ6qG,MAAQA,EAgBhB7qG,EAAQ0kG,OAdR,SAAgB35F,EAAK5C,EAAO6G,EAAKqC,GAC/B,IAAI3E,EAAMsC,EAAM7G,EAChBzD,EAAOgI,EAAM,GAAM,GAEnB,IADA,IAAI5I,EAAM,IAAId,MAAM0J,EAAM,GACjBC,EAAI,EAAG2H,EAAInM,EAAOwE,EAAI7I,EAAIlB,OAAQ+J,IAAK2H,GAAK,EAAG,CACtD,IAAIxB,EAEFA,EADa,QAAXzB,EACGtG,EAAIuJ,IAAM,GAAOvJ,EAAIuJ,EAAI,IAAM,GAAOvJ,EAAIuJ,EAAI,IAAM,EAAKvJ,EAAIuJ,EAAI,GAEjEvJ,EAAIuJ,EAAI,IAAM,GAAOvJ,EAAIuJ,EAAI,IAAM,GAAOvJ,EAAIuJ,EAAI,IAAM,EAAKvJ,EAAIuJ,GACxExQ,EAAI6I,GAAKmG,IAAM,EAEjB,OAAOhP,GAsBT9D,EAAQ4lG,QAlBR,SAAiB76F,EAAKsG,GAEpB,IADA,IAAIvN,EAAM,IAAId,MAAmB,EAAb+H,EAAInI,QACf+J,EAAI,EAAG2H,EAAI,EAAG3H,EAAI5B,EAAInI,OAAQ+J,IAAK2H,GAAK,EAAG,CAClD,IAAIjU,EAAI0K,EAAI4B,GACG,QAAX0E,GACFvN,EAAIwQ,GAAKjU,IAAM,GACfyD,EAAIwQ,EAAI,GAAMjU,IAAM,GAAM,IAC1ByD,EAAIwQ,EAAI,GAAMjU,IAAM,EAAK,IACzByD,EAAIwQ,EAAI,GAAS,IAAJjU,IAEbyD,EAAIwQ,EAAI,GAAKjU,IAAM,GACnByD,EAAIwQ,EAAI,GAAMjU,IAAM,GAAM,IAC1ByD,EAAIwQ,EAAI,GAAMjU,IAAM,EAAK,IACzByD,EAAIwQ,GAAS,IAAJjU,GAGb,OAAOyD,GAOT9D,EAAQyqG,OAHR,SAAgB33F,EAAGqB,GACjB,OAAQrB,IAAMqB,EAAMrB,GAAM,GAAKqB,GAOjCnU,EAAQ6kG,OAHR,SAAgB/xF,EAAGqB,GACjB,OAAQrB,GAAKqB,EAAMrB,IAAO,GAAKqB,GAOjCnU,EAAQ8kG,MAHR,SAAe5wF,EAAGC,GAChB,OAAQD,EAAIC,IAAO,GAOrBnU,EAAQ+kG,QAHR,SAAiB7wF,EAAGC,EAAGrC,GACrB,OAAQoC,EAAIC,EAAIrC,IAAO,GAOzB9R,EAAQglG,QAHR,SAAiB9wF,EAAGC,EAAGrC,EAAG8rB,GACxB,OAAQ1pB,EAAIC,EAAIrC,EAAI8rB,IAAO,GAO7B59B,EAAQ8lG,QAHR,SAAiB5xF,EAAGC,EAAGrC,EAAG8rB,EAAG51B,GAC3B,OAAQkM,EAAIC,EAAIrC,EAAI8rB,EAAI51B,IAAO,GAajChI,EAAQonG,MATR,SAAe96F,EAAKmiB,EAAK46E,EAAIC,GAC3B,IAAIC,EAAKj9F,EAAImiB,GAGTra,EAAMk1F,EAFDh9F,EAAImiB,EAAM,KAEI,EACnBzY,GAAM5B,EAAKk1F,EAAK,EAAI,GAAKD,EAAKE,EAClCj9F,EAAImiB,GAAOzY,IAAO,EAClB1J,EAAImiB,EAAM,GAAKra,GASjBpU,EAAQqnG,SALR,SAAkBgC,EAAIC,EAAIC,EAAI9nD,GAG5B,OAFU6nD,EAAK7nD,IAAQ,EACR6nD,EAAK,EAAI,GAAKD,EAAKE,IACpB,GAQhBvpG,EAAQsnG,SAJR,SAAkB+B,EAAIC,EAAIC,EAAI9nD,GAE5B,OADS6nD,EAAK7nD,IACA,GAiBhBzhD,EAAQunG,WAbR,SAAoB8B,EAAIC,EAAIC,EAAI9nD,EAAI+nD,EAAIC,EAAItgC,EAAIugC,GAC9C,IAAIr1F,EAAQ,EACRD,EAAKk1F,EAST,OAPAj1F,IADAD,EAAMA,EAAKqtC,IAAQ,GACL6nD,EAAK,EAAI,EAEvBj1F,IADAD,EAAMA,EAAKq1F,IAAQ,GACLA,EAAK,EAAI,EAIdJ,EAAKE,EAAKC,EAAKrgC,GAFxB90D,IADAD,EAAMA,EAAKs1F,IAAQ,GACLA,EAAK,EAAI,KAGT,GAQhB1pG,EAAQwnG,WAJR,SAAoB6B,EAAIC,EAAIC,EAAI9nD,EAAI+nD,EAAIC,EAAItgC,EAAIugC,GAE9C,OADSJ,EAAK7nD,EAAKgoD,EAAKC,IACV,GAmBhB1pG,EAAQynG,WAfR,SAAoB4B,EAAIC,EAAIC,EAAI9nD,EAAI+nD,EAAIC,EAAItgC,EAAIugC,EAAIC,EAAIC,GACtD,IAAIv1F,EAAQ,EACRD,EAAKk1F,EAWT,OATAj1F,IADAD,EAAMA,EAAKqtC,IAAQ,GACL6nD,EAAK,EAAI,EAEvBj1F,IADAD,EAAMA,EAAKq1F,IAAQ,GACLA,EAAK,EAAI,EAEvBp1F,IADAD,EAAMA,EAAKs1F,IAAQ,GACLA,EAAK,EAAI,EAIdL,EAAKE,EAAKC,EAAKrgC,EAAKwgC,GAF7Bt1F,IADAD,EAAMA,EAAKw1F,IAAQ,GACLA,EAAK,EAAI,KAGT,GAShB5pG,EAAQ0nG,WALR,SAAoB2B,EAAIC,EAAIC,EAAI9nD,EAAI+nD,EAAIC,EAAItgC,EAAIugC,EAAIC,EAAIC,GAGtD,OAFSN,EAAK7nD,EAAKgoD,EAAKC,EAAKE,IAEf,GAQhB5pG,EAAQgnG,UAJR,SAAmBqC,EAAIC,EAAIpiG,GAEzB,OADSoiG,GAAO,GAAKpiG,EAASmiG,IAAOniG,KACxB,GAQflH,EAAQinG,UAJR,SAAmBoC,EAAIC,EAAIpiG,GAEzB,OADSmiG,GAAO,GAAKniG,EAASoiG,IAAOpiG,KACxB,GAOflH,EAAQknG,SAHR,SAAkBmC,EAAIC,EAAIpiG,GACxB,OAAOmiG,IAAOniG,GAQhBlH,EAAQmnG,SAJR,SAAkBkC,EAAIC,EAAIpiG,GAExB,OADSmiG,GAAO,GAAKniG,EAASoiG,IAAOpiG,KACxB,gCCjRf,IAAI89C,EAAO,EAAQ,MACfqoB,EAAQ,EAAQ,MAChB3oE,EAAS,EAAQ,MAErB,SAAS2uF,EAASlxF,GAChB,KAAMb,gBAAgB+xF,GACpB,OAAO,IAAIA,EAASlxF,GACtBb,KAAK0jD,KAAO7iD,EAAQ6iD,KACpB1jD,KAAKwpG,aAAe3oG,EAAQ2oG,WAE5BxpG,KAAKymB,OAASzmB,KAAK0jD,KAAKs/C,QACxBhjG,KAAKypG,WAAa5oG,EAAQ4oG,YAAczpG,KAAK0jD,KAAK+uC,aAElDzyF,KAAK0pG,QAAU,KACf1pG,KAAK2pG,eAAiB,KACtB3pG,KAAK2jG,EAAI,KACT3jG,KAAK4pG,EAAI,KAET,IAAIpX,EAAUzmB,EAAM78D,QAAQrO,EAAQ2xF,QAAS3xF,EAAQ6xF,YAAc,OAC/DC,EAAQ5mB,EAAM78D,QAAQrO,EAAQ8xF,MAAO9xF,EAAQgpG,UAAY,OACzDvX,EAAOvmB,EAAM78D,QAAQrO,EAAQyxF,KAAMzxF,EAAQ0xF,SAAW,OAC1DnvF,EAAOovF,EAAQlxF,QAAWtB,KAAKypG,WAAa,EACrC,mCAAqCzpG,KAAKypG,WAAa,SAC9DzpG,KAAKkF,MAAMstF,EAASG,EAAOL,GAE7B7zF,EAAOC,QAAUqzF,EAEjBA,EAAS9xF,UAAUiF,MAAQ,SAAcstF,EAASG,EAAOL,GACvD,IAAIwX,EAAOtX,EAAQjvF,OAAOovF,GAAOpvF,OAAO+uF,GAExCtyF,KAAK2jG,EAAI,IAAIjiG,MAAM1B,KAAKymB,OAAS,GACjCzmB,KAAK4pG,EAAI,IAAIloG,MAAM1B,KAAKymB,OAAS,GACjC,IAAK,IAAIpb,EAAI,EAAGA,EAAIrL,KAAK4pG,EAAEtoG,OAAQ+J,IACjCrL,KAAK2jG,EAAEt4F,GAAK,EACZrL,KAAK4pG,EAAEv+F,GAAK,EAGdrL,KAAKk9C,QAAQ4sD,GACb9pG,KAAK0pG,QAAU,EACf1pG,KAAK2pG,eAAiB,iBAGxB5X,EAAS9xF,UAAU8pG,MAAQ,WACzB,OAAO,IAAIrmD,EAAKg/C,KAAK1iG,KAAK0jD,KAAM1jD,KAAK2jG,IAGvC5R,EAAS9xF,UAAUi9C,QAAU,SAAgB4sD,GAC3C,IAAIE,EAAOhqG,KAAK+pG,QACA34D,OAAOpxC,KAAK4pG,GACZx4D,OAAO,CAAE,IACrB04D,IACFE,EAAOA,EAAK54D,OAAO04D,IACrB9pG,KAAK2jG,EAAIqG,EAAK/lD,SACdjkD,KAAK4pG,EAAI5pG,KAAK+pG,QAAQ34D,OAAOpxC,KAAK4pG,GAAG3lD,SAChC6lD,IAGL9pG,KAAK2jG,EAAI3jG,KAAK+pG,QACA34D,OAAOpxC,KAAK4pG,GACZx4D,OAAO,CAAE,IACTA,OAAO04D,GACP7lD,SACdjkD,KAAK4pG,EAAI5pG,KAAK+pG,QAAQ34D,OAAOpxC,KAAK4pG,GAAG3lD,WAGvC8tC,EAAS9xF,UAAUgqG,OAAS,SAAgBzX,EAASE,EAAYh8E,EAAKwzF,GAE1C,iBAAfxX,IACTwX,EAASxzF,EACTA,EAAMg8E,EACNA,EAAa,MAGfF,EAAUzmB,EAAM78D,QAAQsjF,EAASE,GACjCh8E,EAAMq1D,EAAM78D,QAAQwH,EAAKwzF,GAEzB9mG,EAAOovF,EAAQlxF,QAAWtB,KAAKypG,WAAa,EACrC,mCAAqCzpG,KAAKypG,WAAa,SAE9DzpG,KAAKk9C,QAAQs1C,EAAQjvF,OAAOmT,GAAO,KACnC1W,KAAK0pG,QAAU,GAGjB3X,EAAS9xF,UAAUq4C,SAAW,SAAkBltC,EAAK3K,EAAKiW,EAAKwzF,GAC7D,GAAIlqG,KAAK0pG,QAAU1pG,KAAK2pG,eACtB,MAAM,IAAI1qG,MAAM,sBAGC,iBAARwB,IACTypG,EAASxzF,EACTA,EAAMjW,EACNA,EAAM,MAIJiW,IACFA,EAAMq1D,EAAM78D,QAAQwH,EAAKwzF,GAAU,OACnClqG,KAAKk9C,QAAQxmC,IAIf,IADA,IAAIyzF,EAAO,GACJA,EAAK7oG,OAAS8J,GACnBpL,KAAK4pG,EAAI5pG,KAAK+pG,QAAQ34D,OAAOpxC,KAAK4pG,GAAG3lD,SACrCkmD,EAAOA,EAAK5mG,OAAOvD,KAAK4pG,GAG1B,IAAIpnG,EAAM2nG,EAAKvnG,MAAM,EAAGwI,GAGxB,OAFApL,KAAKk9C,QAAQxmC,GACb1W,KAAK0pG,UACE39B,EAAMhrE,OAAOyB,EAAK/B,oBC/G3B,IAAI2pG,EAAO,EAAQ,MACf51D,EAAM,EAAQ,MAEd61D,EAAQ5rG,EAAOC,QAEnB,IAAK,IAAI2F,KAAO+lG,EACVA,EAAK1pG,eAAe2D,KAAMgmG,EAAMhmG,GAAO+lG,EAAK/lG,IAalD,SAASimG,EAAgB53D,GAOvB,GANsB,iBAAXA,IACTA,EAAS8B,EAAIhW,MAAMkU,IAEhBA,EAAOvE,WACVuE,EAAOvE,SAAW,UAEI,WAApBuE,EAAOvE,SACT,MAAM,IAAIlvC,MAAM,aAAeyzC,EAAOvE,SAAW,sCAEnD,OAAOuE,EApBT23D,EAAM/hE,QAAU,SAAUoK,EAAQ3J,GAEhC,OADA2J,EAAS43D,EAAe53D,GACjB03D,EAAK9hE,QAAQ/nC,KAAKP,KAAM0yC,EAAQ3J,IAGzCshE,EAAMjrG,IAAM,SAAUszC,EAAQ3J,GAE5B,OADA2J,EAAS43D,EAAe53D,GACjB03D,EAAKhrG,IAAImB,KAAKP,KAAM0yC,EAAQ3J,sDCfrC,MAAMwhE,EAAM,EAAQ,MAEd37D,EAAe,qBACfG,EAAiB,EAAQ,MAgJ/BtwC,EAAOC,QA9IP,cAAsBkwC,EACpB3sC,YAAa84D,EAAa97B,GAKxB,GAJKA,IAAMA,EAAO,IAClBmC,QAEAphC,KAAK+6D,YAAc57D,OAAO47D,IACrB/6D,KAAK+6D,YAAa,MAAM,IAAI97D,MAAM,yCAEvCe,KAAKwqG,QAAS,EACdxqG,KAAKmjC,WAAY,EACjBnjC,KAAKsB,OAASnC,OAAO8/B,EAAK39B,SAAW+uB,EAAAA,EACrCrwB,KAAKF,KAAOm/B,EAAKn/B,MAAQ,kBAErBE,KAAKsB,SAAW+uB,EAAAA,IAClBrwB,KAAKyqG,gBAAmBzqG,KAAKsB,OAAStB,KAAK+6D,aAAgB/6D,KAAK+6D,YAChE/6D,KAAK0qG,eAAiB55F,KAAKS,KAAKvR,KAAKsB,OAAStB,KAAK+6D,aAAe,GAGpE/6D,KAAK2qG,UAAYJ,EAAIK,OAAO5qG,KAAKF,UAAMsI,EAAW,CAChDyiG,QAAUC,IACRA,EAAGC,kBAAkB,WAEvBC,SAAU,KAERhrG,KAAK4nD,SAEPqjD,WAAY,KACVjrG,KAAKwqG,QAAS,EACdxqG,KAAKylC,KAAK,QAAS,IAAIxmC,MAAM,oCAKnCg8D,IAAKrxD,EAAOoB,EAAK+9B,EAAK,UACpB,GAAI/oC,KAAKwqG,OAAQ,OAAOz7D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAE1D,MAAMisG,EAAethG,IAAU5J,KAAK0qG,eACpC,OAAIQ,GAAelgG,EAAI1J,SAAWtB,KAAKyqG,gBAC9B17D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,6BAA+Be,KAAKyqG,oBAE1ES,GAAelgG,EAAI1J,SAAWtB,KAAK+6D,aASjB,KAJvB/vD,EAAM,IAAI2sB,WAAW3sB,EAAIO,OAAQP,EAAI4sB,WAAY5sB,EAAIjJ,aAI7C61B,YAAoB5sB,EAAIjJ,aAAeiJ,EAAIO,OAAOxJ,aACxDiJ,EAAMA,EAAIpI,aAGX,WACC,IACE,MAAMkoG,QAAW9qG,KAAK2qG,gBAChBG,EAAG7vC,IAAI,SAAUjwD,EAAKpB,GAC5B,MAAOG,GAEP,YADAg/B,EAAGh/B,GAILg/B,EAAG,OATJ,IAZQgG,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAA0Be,KAAK+6D,gBAyB5E37D,IAAKwK,EAAOq1B,EAAM8J,EAAK,UACrB,MAAoB,mBAAT9J,EAA4Bj/B,KAAKZ,IAAIwK,EAAO,GAAIq1B,IACtDA,IAAMA,EAAO,IACdj/B,KAAKwqG,OAAez7D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,4BAEzD,WACC,IAAIksG,EACJ,IACE,MAAML,QAAW9qG,KAAK2qG,UACtBQ,QAAkBL,EAAG1rG,IAAI,SAAUwK,GACnC,MAAOG,GAEP,YADAg/B,EAAGh/B,GAML,GAAiB,MAAbohG,EAAmB,CACrB,MAAMphG,EAAM,IAAI9K,MAAM,mBAGtB,OAFA8K,EAAIqhG,UAAW,OACfriE,EAAGh/B,GAIL,IAAIiB,EAAM9J,EAAO2M,KAAKs9F,EAAU5/F,OAAQ4/F,EAAUvzE,WAAYuzE,EAAUppG,YAExE,MAAMV,EAAS49B,EAAK59B,QAAU,EACxB+J,EAAM6zB,EAAK39B,QAAW0J,EAAI1J,OAASD,EAE1B,IAAXA,GAAgB+J,IAAQJ,EAAI1J,SAC9B0J,EAAMA,EAAIpI,MAAMvB,EAAQ+J,EAAM/J,IAGhC0nC,EAAG,KAAM/9B,IA5BV,IAgCH48C,MAAO7e,EAAK,UACV,GAAI/oC,KAAKwqG,OAAQ,OAAOz7D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAC1De,KAAKwqG,QAAS,EAEb,WACC,WACmBxqG,KAAK2qG,WACnB/iD,QACH,MAAO79C,GAEP,YADAg/B,EAAGh/B,GAILg/B,EAAG,OATJ,GAaHvD,QAASuD,EAAK,UACZ,OAAI/oC,KAAKwqG,OAAez7D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBACtDe,KAAKmjC,UAAkB4L,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,4BAC7De,KAAKmjC,WAAY,OAEjBnjC,KAAK4nD,OAAMS,MAAOt+C,IAChB,GAAIA,EACFg/B,EAAGh/B,OADL,CAKA,UACQwgG,EAAIc,SAASrrG,KAAKF,MACxB,MAAOiK,GAEP,YADAg/B,EAAGh/B,GAILg/B,EAAG,0CC9IT,IAAIuiE,EACAC,sEAqBJ,MAAMC,EAAmB,IAAInL,QACvBoL,EAAqB,IAAIpL,QACzBqL,EAA2B,IAAIrL,QAC/BsL,EAAiB,IAAItL,QACrBuL,EAAwB,IAAIvL,QA0DlC,IAAIwL,EAAgB,CAChBzsG,IAAIuuB,EAAQ9oB,EAAMo0F,GACd,GAAItrE,aAAkBm+E,eAAgB,CAElC,GAAa,SAATjnG,EACA,OAAO4mG,EAAmBrsG,IAAIuuB,GAElC,GAAa,qBAAT9oB,EACA,OAAO8oB,EAAOo+E,kBAAoBL,EAAyBtsG,IAAIuuB,GAGnE,GAAa,UAAT9oB,EACA,OAAOo0F,EAAS8S,iBAAiB,QAC3B3jG,EACA6wF,EAAS+S,YAAY/S,EAAS8S,iBAAiB,IAI7D,OAAOE,EAAKt+E,EAAO9oB,KAEvB3F,IAAG,CAACyuB,EAAQ9oB,EAAMpD,KACdksB,EAAO9oB,GAAQpD,GACR,GAEX3C,IAAG,CAAC6uB,EAAQ9oB,IACJ8oB,aAAkBm+E,iBACR,SAATjnG,GAA4B,UAATA,IAGjBA,KAAQ8oB,GAqCvB,SAASu+E,EAAuBzqG,GAC5B,MAAqB,mBAAVA,GAhCO06D,EAiCM16D,KA7BX0qG,YAAYlsG,UAAUmsG,aAC7B,qBAAsBN,eAAe7rG,WA7GnCsrG,IACHA,EAAuB,CACpBc,UAAUpsG,UAAUqsG,QACpBD,UAAUpsG,UAAUssG,SACpBF,UAAUpsG,UAAUusG,sBAqHEjkE,SAAS4zB,GAC5B,YAAat4D,GAIhB,OADAs4D,EAAKn3D,MAAM21F,EAAO36F,MAAO6D,GAClBooG,EAAKT,EAAiBpsG,IAAIY,QAGlC,YAAa6D,GAGhB,OAAOooG,EAAK9vC,EAAKn3D,MAAM21F,EAAO36F,MAAO6D,KAtB9B,SAAU4oG,KAAe5oG,GAC5B,MAAM6oG,EAAKvwC,EAAK57D,KAAKo6F,EAAO36F,MAAOysG,KAAe5oG,GAElD,OADA6nG,EAAyBxsG,IAAIwtG,EAAID,EAAWrvE,KAAOqvE,EAAWrvE,OAAS,CAACqvE,IACjER,EAAKS,KA2BhBjrG,aAAiBqqG,gBAhGzB,SAAwCY,GAEpC,GAAIjB,EAAmB3sG,IAAI4tG,GACvB,OACJ,MAAM33E,EAAO,IAAIvJ,SAAQ,CAACC,EAAS+c,KAC/B,MAAMmkE,EAAW,KACbD,EAAG71D,oBAAoB,WAAY1F,GACnCu7D,EAAG71D,oBAAoB,QAASt1C,GAChCmrG,EAAG71D,oBAAoB,QAASt1C,IAE9B4vC,EAAW,KACb1lB,IACAkhF,KAEEprG,EAAQ,KACVinC,EAAOkkE,EAAGnrG,OAAS,IAAIqrG,aAAa,aAAc,eAClDD,KAEJD,EAAG/1D,iBAAiB,WAAYxF,GAChCu7D,EAAG/1D,iBAAiB,QAASp1C,GAC7BmrG,EAAG/1D,iBAAiB,QAASp1C,MAGjCkqG,EAAmBvsG,IAAIwtG,EAAI33E,GA0EvB83E,CAA+BprG,GA9JhBk+D,EA+JDl+D,GAzJV6pG,IACHA,EAAoB,CACjBa,YACAW,eACAC,SACAV,UACAP,kBAZiDhkG,MAAM0I,GAAMmvD,aAAkBnvD,IAgK5E,IAAIse,MAAMrtB,EAAOoqG,GAErBpqG,GAzCX,IAAsB06D,EAzHCwD,EAoKvB,SAASssC,EAAKxqG,GAGV,GAAIA,aAAiBurG,WACjB,OA3IR,SAA0B1kE,GACtB,MAAM2kE,EAAU,IAAIzhF,SAAQ,CAACC,EAAS+c,KAClC,MAAMmkE,EAAW,KACbrkE,EAAQuO,oBAAoB,UAAWq2D,GACvC5kE,EAAQuO,oBAAoB,QAASt1C,IAEnC2rG,EAAU,KACZzhF,EAAQwgF,EAAK3jE,EAAQpiC,SACrBymG,KAEEprG,EAAQ,KACVinC,EAAOF,EAAQ/mC,OACforG,KAEJrkE,EAAQqO,iBAAiB,UAAWu2D,GACpC5kE,EAAQqO,iBAAiB,QAASp1C,MAetC,OAbA0rG,EACK7hF,MAAM3pB,IAGHA,aAAiB4qG,WACjBb,EAAiBtsG,IAAIuC,EAAO6mC,MAI/Bjd,OAAM,SAGXugF,EAAsB1sG,IAAI+tG,EAAS3kE,GAC5B2kE,EA6GIE,CAAiB1rG,GAG5B,GAAIkqG,EAAe7sG,IAAI2C,GACnB,OAAOkqG,EAAevsG,IAAIqC,GAC9B,MAAM2rG,EAAWlB,EAAuBzqG,GAOxC,OAJI2rG,IAAa3rG,IACbkqG,EAAezsG,IAAIuC,EAAO2rG,GAC1BxB,EAAsB1sG,IAAIkuG,EAAU3rG,IAEjC2rG,EAEX,MAAMzS,EAAUl5F,GAAUmqG,EAAsBxsG,IAAIqC,GC5KpD,SAASmpG,EAAO9qG,EAAMwmF,GAAS,QAAE+mB,EAAO,QAAExC,EAAO,SAAEG,EAAQ,WAAEC,GAAe,IACxE,MAAM3iE,EAAUglE,UAAUC,KAAKztG,EAAMwmF,GAC/BknB,EAAcvB,EAAK3jE,GAgBzB,OAfIuiE,GACAviE,EAAQqO,iBAAiB,iBAAkB5F,IACvC85D,EAAQoB,EAAK3jE,EAAQpiC,QAAS6qC,EAAM08D,WAAY18D,EAAM28D,WAAYzB,EAAK3jE,EAAQ8jE,iBAGnFiB,GACA/kE,EAAQqO,iBAAiB,WAAW,IAAM02D,MAC9CG,EACKpiF,MAAM0/E,IACHG,GACAH,EAAGn0D,iBAAiB,SAAS,IAAMs0D,MACnCD,GACAF,EAAGn0D,iBAAiB,iBAAiB,IAAMq0D,SAE9C3/E,OAAM,SACJmiF,EAOX,SAASnC,EAASvrG,GAAM,QAAEutG,GAAY,IAClC,MAAM/kE,EAAUglE,UAAUK,eAAe7tG,GAGzC,OAFIutG,GACA/kE,EAAQqO,iBAAiB,WAAW,IAAM02D,MACvCpB,EAAK3jE,GAASld,MAAK,SAG9B,MAAMwiF,EAAc,CAAC,MAAO,SAAU,SAAU,aAAc,SACxDC,EAAe,CAAC,MAAO,MAAO,SAAU,SACxCC,EAAgB,IAAItvG,IAC1B,SAASuvG,EAAUpgF,EAAQ9oB,GACvB,KAAM8oB,aAAkBw+E,cAClBtnG,KAAQ8oB,GACM,iBAAT9oB,EACP,OAEJ,GAAIipG,EAAc1uG,IAAIyF,GAClB,OAAOipG,EAAc1uG,IAAIyF,GAC7B,MAAMmpG,EAAiBnpG,EAAK+I,QAAQ,aAAc,IAC5CqgG,EAAWppG,IAASmpG,EACpBE,EAAUL,EAAatlE,SAASylE,GACtC,KAEEA,KAAmBC,EAAWlB,SAAWD,gBAAgB7sG,aACrDiuG,IAAWN,EAAYrlE,SAASylE,GAClC,OAEJ,MAAMlpG,EAASujD,eAAgB8lD,KAActqG,GAEzC,MAAM6oG,EAAK1sG,KAAKosG,YAAY+B,EAAWD,EAAU,YAAc,YAC/D,IAAIvgF,EAAS++E,EAAG5xC,MAQhB,OAPImzC,IACAtgF,EAASA,EAAO/jB,MAAM/F,EAAK8c,iBAMjB6K,QAAQ4iF,IAAI,CACtBzgF,EAAOqgF,MAAmBnqG,GAC1BqqG,GAAWxB,EAAG33E,QACd,IAGR,OADA+4E,EAAc5uG,IAAI2F,EAAMC,GACjBA,EAEE,IAACupG,EAAAA,EDsCexC,EAAzBA,ECtCuB,IACpBwC,EACHjvG,IAAK,CAACuuB,EAAQ9oB,EAAMo0F,IAAa8U,EAAUpgF,EAAQ9oB,IAASwpG,EAASjvG,IAAIuuB,EAAQ9oB,EAAMo0F,GACvFn6F,IAAK,CAAC6uB,EAAQ9oB,MAAWkpG,EAAUpgF,EAAQ9oB,IAASwpG,EAASvvG,IAAI6uB,EAAQ9oB,iBCnF7EnG,EAAQ4vC,KAAO,SAAU/iC,EAAQlK,EAAQitG,EAAMC,EAAMC,GACnD,IAAI9nG,EAAG3H,EACH0vG,EAAiB,EAATD,EAAcD,EAAO,EAC7BG,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBE,GAAS,EACTvjG,EAAIijG,EAAQE,EAAS,EAAK,EAC1BlyE,EAAIgyE,GAAQ,EAAI,EAChBnxF,EAAI5R,EAAOlK,EAASgK,GAOxB,IALAA,GAAKixB,EAEL51B,EAAIyW,GAAM,IAAOyxF,GAAU,EAC3BzxF,KAAQyxF,EACRA,GAASH,EACFG,EAAQ,EAAGloG,EAAS,IAAJA,EAAW6E,EAAOlK,EAASgK,GAAIA,GAAKixB,EAAGsyE,GAAS,GAKvE,IAHA7vG,EAAI2H,GAAM,IAAOkoG,GAAU,EAC3BloG,KAAQkoG,EACRA,GAASL,EACFK,EAAQ,EAAG7vG,EAAS,IAAJA,EAAWwM,EAAOlK,EAASgK,GAAIA,GAAKixB,EAAGsyE,GAAS,GAEvE,GAAU,IAANloG,EACFA,EAAI,EAAIioG,MACH,IAAIjoG,IAAMgoG,EACf,OAAO3vG,EAAIonF,IAAsB91D,EAAAA,GAAdlT,GAAK,EAAI,GAE5Bpe,GAAQ+R,KAAKoB,IAAI,EAAGq8F,GACpB7nG,GAAQioG,EAEV,OAAQxxF,GAAK,EAAI,GAAKpe,EAAI+R,KAAKoB,IAAI,EAAGxL,EAAI6nG,IAG5C7vG,EAAQuE,MAAQ,SAAUsI,EAAQ9J,EAAOJ,EAAQitG,EAAMC,EAAMC,GAC3D,IAAI9nG,EAAG3H,EAAGyR,EACNi+F,EAAiB,EAATD,EAAcD,EAAO,EAC7BG,GAAQ,GAAKD,GAAQ,EACrBE,EAAQD,GAAQ,EAChBG,EAAe,KAATN,EAAcz9F,KAAKoB,IAAI,GAAI,IAAMpB,KAAKoB,IAAI,GAAI,IAAM,EAC1D7G,EAAIijG,EAAO,EAAKE,EAAS,EACzBlyE,EAAIgyE,EAAO,GAAK,EAChBnxF,EAAI1b,EAAQ,GAAgB,IAAVA,GAAe,EAAIA,EAAQ,EAAK,EAAI,EAmC1D,IAjCAA,EAAQqP,KAAKgE,IAAIrT,GAEbg0B,MAAMh0B,IAAUA,IAAU4uB,EAAAA,GAC5BtxB,EAAI02B,MAAMh0B,GAAS,EAAI,EACvBiF,EAAIgoG,IAEJhoG,EAAIoK,KAAK6gB,MAAM7gB,KAAK+gB,IAAIpwB,GAASqP,KAAK0jF,KAClC/yF,GAAS+O,EAAIM,KAAKoB,IAAI,GAAIxL,IAAM,IAClCA,IACA8J,GAAK,IAGL/O,GADEiF,EAAIioG,GAAS,EACNE,EAAKr+F,EAELq+F,EAAK/9F,KAAKoB,IAAI,EAAG,EAAIy8F,IAEpBn+F,GAAK,IACf9J,IACA8J,GAAK,GAGH9J,EAAIioG,GAASD,GACf3vG,EAAI,EACJ2H,EAAIgoG,GACKhoG,EAAIioG,GAAS,GACtB5vG,GAAM0C,EAAQ+O,EAAK,GAAKM,KAAKoB,IAAI,EAAGq8F,GACpC7nG,GAAQioG,IAER5vG,EAAI0C,EAAQqP,KAAKoB,IAAI,EAAGy8F,EAAQ,GAAK79F,KAAKoB,IAAI,EAAGq8F,GACjD7nG,EAAI,IAID6nG,GAAQ,EAAGhjG,EAAOlK,EAASgK,GAAS,IAAJtM,EAAUsM,GAAKixB,EAAGv9B,GAAK,IAAKwvG,GAAQ,GAI3E,IAFA7nG,EAAKA,GAAK6nG,EAAQxvG,EAClB0vG,GAAQF,EACDE,EAAO,EAAGljG,EAAOlK,EAASgK,GAAS,IAAJ3E,EAAU2E,GAAKixB,EAAG51B,GAAK,IAAK+nG,GAAQ,GAE1EljG,EAAOlK,EAASgK,EAAIixB,IAAU,IAAJnf,mBCjF5B,MAAM4xB,EAAiB,EAAQ,MAoD/BtwC,EAAOC,QAlDP,MACEuD,YAAa64D,GAIX,GAHA96D,KAAK86D,MAAQA,EACb96D,KAAK+6D,YAAcD,EAAMC,aAEpB/6D,KAAK86D,QAAU96D,KAAK86D,MAAM17D,MAAQY,KAAK86D,MAAMG,IAChD,MAAM,IAAIh8D,MAAM,yDAGlBe,KAAK8uG,IAAM,GAGb7zC,IAAKrxD,EAAOoB,EAAK+9B,EAAK,UACpB/oC,KAAK8uG,IAAIllG,GAASoB,EAClBhL,KAAK86D,MAAMG,IAAIrxD,EAAOoB,GAAKjB,IACzB/J,KAAK8uG,IAAIllG,GAAS,KAClBm/B,EAAGh/B,MAIP3K,IAAKwK,EAAOq1B,EAAM8J,EAAK,UACrB,GAAoB,mBAAT9J,EAAqB,OAAOj/B,KAAKZ,IAAIwK,EAAO,KAAMq1B,GAE7D,IAAIj0B,EAAMhL,KAAK8uG,IAAIllG,GAGnB,IAAKoB,EACH,OAAOhL,KAAK86D,MAAM17D,IAAIwK,EAAOq1B,EAAM8J,GAGhC9J,IAAMA,EAAO,IAElB,MAAM59B,EAAS49B,EAAK59B,QAAU,EACxB+J,EAAM6zB,EAAK39B,QAAW0J,EAAI1J,OAASD,EAE1B,IAAXA,GAAgB+J,IAAQJ,EAAI1J,SAC9B0J,EAAMA,EAAIpI,MAAMvB,EAAQ+J,EAAM/J,IAEhC0tC,GAAe,IAAMhG,EAAG,KAAM/9B,KAGhC48C,MAAO7e,EAAK,UACV/oC,KAAK86D,MAAMlT,MAAM7e,GAGnBvD,QAASuD,EAAK,UACZ/oC,KAAK86D,MAAMt1B,QAAQuD,eClDM,mBAAlBvjC,OAAOgpB,OAEhB/vB,EAAOC,QAAU,SAAkB+Q,EAAMC,GACnCA,IACFD,EAAKE,OAASD,EACdD,EAAKxP,UAAYuF,OAAOgpB,OAAO9e,EAAUzP,UAAW,CAClDgC,YAAa,CACXR,MAAOgO,EACP8d,YAAY,EACZE,UAAU,EACVD,cAAc,OAOtB/uB,EAAOC,QAAU,SAAkB+Q,EAAMC,GACvC,GAAIA,EAAW,CACbD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS3P,UAAYyP,EAAUzP,UAC/BwP,EAAKxP,UAAY,IAAI2P,EACrBH,EAAKxP,UAAUgC,YAAcwN,iCCrBnC,IAAIs/F,EAAiB,EAAQ,KAAR,GAGjBC,EAFY,EAAQ,KAERC,CAAU,6BAEtBC,EAAsB,SAAqBztG,GAC9C,QAAIstG,GAAkBttG,GAA0B,iBAAVA,GAAsB8lB,OAAOw6E,eAAetgG,IAGtD,uBAArButG,EAAUvtG,IAGd0tG,EAAoB,SAAqB1tG,GAC5C,QAAIytG,EAAoBztG,IAGP,OAAVA,GACW,iBAAVA,GACiB,iBAAjBA,EAAMH,QACbG,EAAMH,QAAU,GACK,mBAArB0tG,EAAUvtG,IACkB,sBAA5ButG,EAAUvtG,EAAM2tG,SAGdC,EAA6B,WAChC,OAAOH,EAAoBjqG,WADI,GAIhCiqG,EAAoBC,kBAAoBA,EAExC1wG,EAAOC,QAAU2wG,EAA4BH,EAAsBC,YCzBnE1wG,EAAOC,QAAU,SAAiB2K,GAChC,IAAK,IAAIgC,EAAI,EAAGioD,EAASjqD,EAAI/H,OAAQ+J,EAAIioD,IAAUjoD,EACjD,GAAIhC,EAAIgF,WAAWhD,GAJG,IAIuB,OAAO,EAEtD,OAAO,gCCTT,IAcIikG,EAdA7jC,EAAQjmE,OAAOvF,UAAUgM,SACzBsjG,EAAUnhF,SAASnuB,UAAUgM,SAC7BujG,EAAY,sBACZT,EAAiB,EAAQ,KAAR,GACjBjQ,EAAWt5F,OAAO0pB,eAYtBzwB,EAAOC,QAAU,SAA6BuqB,GAC7C,GAAkB,mBAAPA,EACV,OAAO,EAER,GAAIumF,EAAUnoG,KAAKkoG,EAAQhvG,KAAK0oB,IAC/B,OAAO,EAER,IAAK8lF,EAEJ,MAAe,+BADLtjC,EAAMlrE,KAAK0oB,GAGtB,IAAK61E,EACJ,OAAO,EAER,QAAiC,IAAtBwQ,EAAmC,CAC7C,IAAIG,EA1BiB,WACtB,IAAKV,EACJ,OAAO,EAER,IACC,OAAO3gF,SAAS,wBAATA,GACN,MAAO1nB,KAoBYgpG,GACpBJ,IAAoBG,GAAgB3Q,EAAS2Q,GAE9C,OAAO3Q,EAAS71E,KAAQqmF,0BChCzB7wG,EAAOC,QAAU,SAAe+C,GAC/B,OAAOA,GAAUA,+BCHlB,IAAI+5D,EAAW,EAAQ,MACnBj8D,EAAS,EAAQ,MAEjBm+F,EAAiB,EAAQ,MACzBiS,EAAc,EAAQ,MACtBC,EAAO,EAAQ,MAEf9W,EAAWt9B,EAASm0C,IAAexwG,QAIvCI,EAAOu5F,EAAU,CAChB6W,YAAaA,EACbjS,eAAgBA,EAChBkS,KAAMA,IAGPnxG,EAAOC,QAAUo6F,+BCjBjB,IAAI4E,EAAiB,EAAQ,MAE7Bj/F,EAAOC,QAAU,WAChB,OAAIS,OAAOs2B,OAASt2B,OAAOs2B,MAAM0wD,OAAShnF,OAAOs2B,MAAM,KAC/Ct2B,OAAOs2B,MAERioE,gCCNR,IAAIn+F,EAAS,EAAQ,MACjBowG,EAAc,EAAQ,MAI1BlxG,EAAOC,QAAU,WAChB,IAAIo6F,EAAW6W,IAMf,OALApwG,EAAOJ,OAAQ,CAAEs2B,MAAOqjE,GAAY,CACnCrjE,MAAO,WACN,OAAOt2B,OAAOs2B,QAAUqjE,KAGnBA,gCCZR,IAAI91F,EAAU,EAAQ,MAClB6sG,EAAuB,EAAQ,MAC/BZ,EAAY,EAAQ,MAEpBD,EAAYC,EAAU,6BACtBF,EAAiB,EAAQ,KAAR,GAEjB/sF,EAA0B,oBAAf0jD,WAA6B,EAAA1jD,EAAS0jD,WACjDoqC,EAAcD,IAEdp0C,EAAWwzC,EAAU,2BAA2B,IAAS,SAAiB55E,EAAO5zB,GACpF,IAAK,IAAI4J,EAAI,EAAGA,EAAIgqB,EAAM/zB,OAAQ+J,GAAK,EACtC,GAAIgqB,EAAMhqB,KAAO5J,EAChB,OAAO4J,EAGT,OAAQ,GAEL0kG,EAASd,EAAU,0BACnBe,EAAY,GACZC,EAAO,EAAQ,KACf/gF,EAAiB1pB,OAAO0pB,eACxB6/E,GAAkBkB,GAAQ/gF,GAC7BlsB,EAAQ8sG,GAAa,SAAUI,GAC9B,IAAI37E,EAAM,IAAIvS,EAAEkuF,GAChB,GAAI3oF,OAAOw6E,eAAextE,EAAK,CAC9B,IAAIqgC,EAAQ1lC,EAAeqF,GACvB1G,EAAaoiF,EAAKr7C,EAAOrtC,OAAOw6E,aACpC,IAAKl0E,EAAY,CAChB,IAAIw+C,EAAan9C,EAAe0lC,GAChC/mC,EAAaoiF,EAAK5jC,EAAY9kD,OAAOw6E,aAEtCiO,EAAUE,GAAcriF,EAAWzuB,QAiBtCX,EAAOC,QAAU,SAAsB+C,GACtC,IAAKA,GAA0B,iBAAVA,EAAsB,OAAO,EAClD,IAAKstG,KAAoBxnF,OAAOw6E,eAAetgG,GAAQ,CACtD,IAAImC,EAAMmsG,EAAOf,EAAUvtG,GAAQ,GAAI,GACvC,OAAOg6D,EAASq0C,EAAalsG,IAAQ,EAEtC,QAAKqsG,GAlBe,SAA2BxuG,GAC/C,IAAI0uG,GAAU,EAQd,OAPAntG,EAAQgtG,GAAW,SAAUI,EAAQF,GACpC,IAAKC,EACJ,IACCA,EAAUC,EAAO7vG,KAAKkB,KAAWyuG,EAChC,MAAOxpG,QAGJypG,EAUAE,CAAe5uG,cC1DvBhD,EAAOC,QAAe4xG,EACtBA,EAAavkF,OAASwkF,EACtBD,EAAaE,MAASC,EAEtB,IAAIxkG,EAAWzG,OAAOvF,UAAUgM,SAC5Bq/D,EAAQ,CACR,sBAAsB,EACtB,uBAAuB,EACvB,uBAAuB,EACvB,uBAAuB,EACvB,8BAA8B,EAC9B,wBAAwB,EACxB,wBAAwB,EACxB,yBAAyB,EACzB,yBAAyB,GAG7B,SAASglC,EAAa/7E,GACpB,OACKg8E,EAAmBh8E,IACnBk8E,EAAkBl8E,GAIzB,SAASg8E,EAAmBh8E,GAC1B,OACKA,aAAesrE,WACftrE,aAAeurE,YACfvrE,aAAewrE,YACfxrE,aAAeoD,YACfpD,aAAe0rE,mBACf1rE,aAAe2rE,aACf3rE,aAAe4rE,aACf5rE,aAAemrE,cACfnrE,aAAeorE,aAItB,SAAS8Q,EAAkBl8E,GACzB,OAAO+2C,EAAMr/D,EAAS1L,KAAKg0B,gCCZ7B71B,EAAQ+O,GAAK,KACZ,MAAM,IAAIxO,MAAM,0CAGjBP,EAAQgyG,MAAQ,IAAIh5E,OA7BF,CAEjB,oBACA,gBAGA,gBACA,mBACA,kBACA,YACA,UACA,8BACA,aACA,aAGA,KAGA,gBACA,kBACA,kBACA,WAOoC70B,KAAK,MAE1CnE,EAAQ+pB,GAAK68C,GAAY5mE,EAAQgyG,MAAMrpG,KAAKi+D,GAE5C5mE,EAAQiyG,IAAMrrC,IAAa5mE,EAAQ+pB,GAAG68C,GAGtC5mE,EAAA,QAAkBD,EAAOC,wBCrCzBA,EAAQkyG,YAAc,EAAtB,MACAlyG,EAAQmyG,YAAc,EAAtB,oCCUApyG,EAAOC,QAZe,WACpB,QAAuB,IAAZmrB,GAA2BA,EAAQinF,OAAQ,CACpD,IAAIA,EAASjnF,EAAQinF,SACjBC,EAAUD,EAAO,GACjBE,EAAcF,EAAO,GAEzB,OAAiB,IAAVC,EAAiBjgG,KAAK6gB,MAAMq/E,EAAc,KAGnD,OAAO,IAAI/jG,MAAOwqB,yCCThBo5E,EAAc,EAAQ,MACtBI,EAAkB,EAAQ,MAc1BL,EAAc,SAASM,EAAmBr/D,EAAUs/D,GACtDnxG,KAAKoxG,YAAc,IAAIP,EAAYK,EAAmBA,EACpDr/D,EAAU,MAGZ7xC,KAAKoxG,YAAY9oG,QAAU4oG,EAE3BlxG,KAAKqxG,iBAAmBJ,IACxBjxG,KAAKsxG,mBAAqB,EAC1BtxG,KAAKmxG,gBAAkBA,GAGzBP,EAAY3wG,UAAY,CACtBmxG,YAAa,KACbC,iBAAkB,EAClBC,mBAAoB,EACpBH,iBAAiB,EAYjBI,aAAc,SAAS7/E,EAAOoP,GAE5B,GAAIpP,EAAQ1xB,KAAKoxG,YAAYI,WAI3B,OAHA3nF,EAAQs/B,SAASroB,EAAS9W,KAAK,KAAM,oBAAsB0H,EACzD,wCAA0C1xB,KAAKoxG,YAAYI,WAC3D,QACK,EAGT,IAAI7+F,EAAO3S,KACP8J,EAAMmnG,IAYV,IARInnG,EAAM9J,KAAKqxG,kBACVvnG,EAAM9J,KAAKqxG,kBAAoBrxG,KAAKoxG,YAAYv/D,YACnD7xC,KAAKqxG,iBAAmBvnG,EACxB9J,KAAKsxG,mBAAqB,GAKxB5/E,EAAQ1xB,KAAKoxG,YAAYF,kBAAoBlxG,KAAKsxG,mBAAoB,CACxE,GAAItxG,KAAKmxG,gBACPtnF,EAAQs/B,SAASroB,EAAS9W,KAAK,KAAM,MAAO,QACvC,CACL,IAAIynF,EAAe3gG,KAAKS,KACtBvR,KAAKqxG,iBAAmBrxG,KAAKoxG,YAAYv/D,SAAW/nC,GAEtDq7B,YAAW,WACTxyB,EAAKy+F,YAAYG,aAAa7/E,EAAOggF,KACpCD,GAEL,OAAO,EAIT,OAAOzxG,KAAKoxG,YAAYG,aAAa7/E,EAAOggF,GAE5C,SAASA,EAAmB3nG,EAAK4nG,GAC/B,GAAI5nG,EAAK,OAAO+2B,EAAS/2B,EAAK,MAE9B4I,EAAK2+F,oBAAsB5/E,EAC3BoP,EAAS,KAAM6wE,KAanBC,gBAAiB,SAASlgF,GAExB,GAAIA,EAAQ1xB,KAAKoxG,YAAYI,WAC3B,OAAO,EAET,IAAI1nG,EAAMmnG,IAWV,IAPInnG,EAAM9J,KAAKqxG,kBACVvnG,EAAM9J,KAAKqxG,kBAAoBrxG,KAAKoxG,YAAYv/D,YACnD7xC,KAAKqxG,iBAAmBvnG,EACxB9J,KAAKsxG,mBAAqB,GAIxB5/E,EAAQ1xB,KAAKoxG,YAAYF,kBAAoBlxG,KAAKsxG,mBACpD,OAAO,EAGT,IAAIO,EAAU7xG,KAAKoxG,YAAYQ,gBAAgBlgF,GAI/C,OAHImgF,IACF7xG,KAAKsxG,oBAAsB5/E,GAEtBmgF,GAOTC,mBAAoB,WAElB,OADA9xG,KAAKoxG,YAAYW,OACV/xG,KAAKoxG,YAAY9oG,UAI5B7J,EAAOC,QAAUkyG,gCCzHbC,EAAc,SAASW,EAAYN,EAAmBr/D,EAAUmgE,GAIlE,GAHAhyG,KAAKwxG,WAAaA,EAClBxxG,KAAKkxG,kBAAoBA,EAED,iBAAbr/D,EACT,OAAQA,GACN,IAAK,MAAO,IAAK,SACf7xC,KAAK6xC,SAAW,IAAM,MACxB,IAAK,MAAO,IAAK,SACf7xC,KAAK6xC,SAAW,IAAW,MAC7B,IAAK,KAAM,IAAK,OACd7xC,KAAK6xC,SAAW,KAAgB,MAClC,IAAK,MACH7xC,KAAK6xC,SAAW,MAAqB,MACvC,QACE,MAAM,IAAI5yC,MAAM,mBAAqB4yC,QAGzC7xC,KAAK6xC,SAAWA,EAGlB7xC,KAAKgyG,aAAeA,EACpBhyG,KAAKsI,QAAU,EACftI,KAAKiyG,UAAY,IAAIhlG,MAGvB4jG,EAAY5wG,UAAY,CACtBuxG,WAAY,EACZN,kBAAmB,EACnBr/D,SAAU,IACVmgE,aAAc,KACd1pG,QAAS,EACT2pG,SAAU,EAYVV,aAAc,SAAS7/E,EAAOoP,GAC5B,IAAInuB,EAAO3S,KAGX,OAAKA,KAAKwxG,WAMN9/E,EAAQ1xB,KAAKwxG,YACf3nF,EAAQs/B,SAASroB,EAAS9W,KAAK,KAAM,oBAAsB0H,EAAQ,wBACjE1xB,KAAKwxG,WAAY,QACZ,IAITxxG,KAAK+xG,OAGDrgF,EAAQ1xB,KAAKsI,QACR4pG,IAELlyG,KAAKgyG,aAEAhyG,KAAKgyG,aAAaT,aAAa7/E,GAAO,SAAS3nB,EAAKooG,GACzD,OAAIpoG,EAAY+2B,EAAS/2B,EAAK,MAG1B2nB,EAAQ/e,EAAKrK,QACR4pG,KAMTv/F,EAAKrK,SAAWopB,OAChBoP,EAAS,KAAMhwB,KAAK/D,IAAIolG,EAAiBx/F,EAAKrK,eAIhDtI,KAAKsI,SAAWopB,EAChB7H,EAAQs/B,SAASroB,EAAS9W,KAAK,KAAM,KAAMhqB,KAAKsI,WACzC,KAtCPuhB,EAAQs/B,SAASroB,EAAS9W,KAAK,KAAM,KAAM0H,EAAOvyB,OAAOizG,qBAClD,GAwCT,SAASF,IAEP,IAAIT,EAAe3gG,KAAKS,MACrBmgB,EAAQ/e,EAAKrK,UAAYqK,EAAKk/B,SAAWl/B,EAAKu+F,oBAEjD,OADA/rE,YAAW,WAAaxyB,EAAK4+F,aAAa7/E,EAAOoP,KAAc2wE,IACxD,IAYXG,gBAAiB,SAASlgF,GAExB,QAAK1xB,KAAKwxG,aAIN9/E,EAAQ1xB,KAAKwxG,aAIjBxxG,KAAK+xG,OAGDrgF,EAAQ1xB,KAAKsI,SAIbtI,KAAKgyG,eAAiBhyG,KAAKgyG,aAAaJ,gBAAgBlgF,KAI5D1xB,KAAKsI,SAAWopB,EACT,OAOTqgF,KAAM,WACJ,GAAK/xG,KAAKkxG,kBAAV,CAKA,IAAIpnG,GAAO,IAAImD,KACXolG,EAAUvhG,KAAKC,IAAIjH,EAAM9J,KAAKiyG,SAAU,GAC5CjyG,KAAKiyG,SAAWnoG,EAEhB,IAAIwoG,EAAaD,GAAWryG,KAAKkxG,kBAAoBlxG,KAAK6xC,UAC1D7xC,KAAKsI,QAAUwI,KAAK/D,IAAI/M,KAAKsI,QAAUgqG,EAAYtyG,KAAKwxG,iBATtDxxG,KAAKsI,QAAUtI,KAAKwxG,aAa1B/yG,EAAOC,QAAUmyG,kBCtKjB,IAAI3W,EAAS,EAAQ,MACjBt6F,EAAW,EAAQ,MAIvB,SAASi7D,EAAK57B,GACZ,KAAMj/B,gBAAgB66D,GAAM,OAAO,IAAIA,EAAI57B,GACvB,iBAATA,IAAmBA,EAAO,CAACluB,IAAKkuB,IACtCA,IAAMA,EAAO,IAClBi7D,EAAOtrD,aAAaruC,KAAKP,MACzBA,KAAKzB,MAAQ,GACbyB,KAAKw8F,KAAOx8F,KAAKy8C,KAAO,KACxBz8C,KAAKsB,OAAS,EACdtB,KAAK+Q,IAAMkuB,EAAKluB,KAAO,IACvB/Q,KAAKuyG,OAAStzE,EAAKszE,QAAU,EAX/B9zG,EAAOC,QAAUm8D,EAcjBj7D,EAASi7D,EAAKq/B,EAAOtrD,cAErBppC,OAAO8nB,eAAeutC,EAAI56D,UAAW,OAAQ,CAC3Cb,IAAK,WAAc,OAAOoG,OAAOC,KAAKzF,KAAKzB,UAG7Cs8D,EAAI56D,UAAUpB,MAAQ,WACpBmB,KAAKzB,MAAQ,GACbyB,KAAKw8F,KAAOx8F,KAAKy8C,KAAO,KACxBz8C,KAAKsB,OAAS,GAGhBu5D,EAAI56D,UAAUi7D,OAAS,SAAU72D,GAE/B,GADmB,iBAARA,IAAkBA,EAAM,GAAKA,GACnCrE,KAAKzB,MAAMmC,eAAe2D,GAA/B,CAEA,IAAImuG,EAAUxyG,KAAKzB,MAAM8F,GAGzB,cAFOrE,KAAKzB,MAAM8F,GAClBrE,KAAKyyG,QAAQpuG,EAAKmuG,EAAQ3oG,KAAM2oG,EAAQ9rF,MACjC8rF,EAAQ/wG,QAGjBo5D,EAAI56D,UAAUwyG,QAAU,SAAUpuG,EAAKwF,EAAM6c,GAC3C1mB,KAAKsB,SAEe,IAAhBtB,KAAKsB,OACPtB,KAAKw8F,KAAOx8F,KAAKy8C,KAAO,KAEpBz8C,KAAKw8F,OAASn4F,GAChBrE,KAAKw8F,KAAO3yF,EACZ7J,KAAKzB,MAAMyB,KAAKw8F,MAAM91E,KAAO,MACpB1mB,KAAKy8C,OAASp4C,GACvBrE,KAAKy8C,KAAO/1B,EACZ1mB,KAAKzB,MAAMyB,KAAKy8C,MAAM5yC,KAAO,OAE7B7J,KAAKzB,MAAMsL,GAAM6c,KAAOA,EACxB1mB,KAAKzB,MAAMmoB,GAAM7c,KAAOA,IAK9BgxD,EAAI56D,UAAUq8F,KAAO,SAAUj4F,GAC7B,GAAKrE,KAAKzB,MAAMmC,eAAe2D,GAA/B,CAEA,IAAImuG,EAAUxyG,KAAKzB,MAAM8F,GAEzB,GAAKrE,KAAK0yG,UAAUruG,EAAKmuG,GACzB,OAAOA,EAAQ/wG,QAGjBo5D,EAAI56D,UAAUf,IAAM,SAAUmF,EAAK5C,GAGjC,IAAI+wG,EAEJ,GAJmB,iBAARnuG,IAAkBA,EAAM,GAAKA,GAIpCrE,KAAKzB,MAAMmC,eAAe2D,GAAM,CAMlC,IALAmuG,EAAUxyG,KAAKzB,MAAM8F,IACb5C,MAAQA,EACZzB,KAAKuyG,SAAQC,EAAQG,SAAW1lG,KAAKnD,OAGrCzF,IAAQrE,KAAKw8F,KAAM,OAAO/6F,EAC9BzB,KAAKyyG,QAAQpuG,EAAKmuG,EAAQ3oG,KAAM2oG,EAAQ9rF,WAExC8rF,EAAU,CAAC/wG,MAAOA,EAAOkxG,SAAU,EAAGjsF,KAAM,KAAM7c,KAAM,MACpD7J,KAAKuyG,SAAQC,EAAQG,SAAW1lG,KAAKnD,OACzC9J,KAAKzB,MAAM8F,GAAOmuG,EAGdxyG,KAAKsB,SAAWtB,KAAK+Q,KAAK/Q,KAAK4yG,QAWrC,OARA5yG,KAAKsB,SACLkxG,EAAQ9rF,KAAO,KACf8rF,EAAQ3oG,KAAO7J,KAAKw8F,KAEhBx8F,KAAKw8F,OAAMx8F,KAAKzB,MAAMyB,KAAKw8F,MAAM91E,KAAOriB,GAC5CrE,KAAKw8F,KAAOn4F,EAEPrE,KAAKy8C,OAAMz8C,KAAKy8C,KAAOp4C,GACrB5C,GAGTo5D,EAAI56D,UAAUyyG,UAAY,SAAUruG,EAAKmuG,GACvC,QAAIxyG,KAAKuyG,QAAWtlG,KAAKnD,MAAQ0oG,EAAQG,SAAY3yG,KAAKuyG,SACxDvyG,KAAKk7D,OAAO72D,GACZrE,KAAKylC,KAAK,QAAS,CAACphC,IAAKA,EAAK5C,MAAO+wG,EAAQ/wG,QACtC,KAKXo5D,EAAI56D,UAAUb,IAAM,SAAUiF,GAE5B,GADmB,iBAARA,IAAkBA,EAAM,GAAKA,GACnCrE,KAAKzB,MAAMmC,eAAe2D,GAA/B,CAEA,IAAImuG,EAAUxyG,KAAKzB,MAAM8F,GAEzB,GAAKrE,KAAK0yG,UAAUruG,EAAKmuG,GAqBzB,OAnBIxyG,KAAKw8F,OAASn4F,IACZA,IAAQrE,KAAKy8C,MACfz8C,KAAKy8C,KAAO+1D,EAAQ9rF,KACpB1mB,KAAKzB,MAAMyB,KAAKy8C,MAAM5yC,KAAO,MAG7B7J,KAAKzB,MAAMi0G,EAAQ3oG,MAAM6c,KAAO8rF,EAAQ9rF,KAI1C1mB,KAAKzB,MAAMi0G,EAAQ9rF,MAAM7c,KAAO2oG,EAAQ3oG,KAGxC7J,KAAKzB,MAAMyB,KAAKw8F,MAAM91E,KAAOriB,EAC7BmuG,EAAQ3oG,KAAO7J,KAAKw8F,KACpBgW,EAAQ9rF,KAAO,KACf1mB,KAAKw8F,KAAOn4F,GAGPmuG,EAAQ/wG,QAGjBo5D,EAAI56D,UAAU2yG,MAAQ,WACpB,GAAK5yG,KAAKy8C,KAAV,CACA,IAAIp4C,EAAMrE,KAAKy8C,KACXh7C,EAAQzB,KAAKk7D,OAAOl7D,KAAKy8C,MAC7Bz8C,KAAKylC,KAAK,QAAS,CAACphC,IAAKA,EAAK5C,MAAOA,2CC9IvC,MAAM89B,EAAc,EAAQ,OACtB,aAAEqP,GAAiB,EAAQ,MAC3BnP,EAAQ,EAAQ,KAAR,CAAiB,eAE/BhhC,EAAOC,QAAU,KACf,MAAMm0G,UAAmBjkE,EACvB3sC,YAAa6wG,GACX1xE,QAEAphC,KAAK+yG,eAAgB,EACrB/yG,KAAKgzG,MAAQF,EAGf7sE,sBACEjmC,KAAK+yG,eAAgB,EAGvB7sE,UAAWl7B,GACT,IAAIpB,EACJ,IACEA,EAAQoB,EAAImiC,eACZ,MAAOpjC,GAEP,OAGG/J,KAAKgzG,MAAMnxE,WAAWziC,IAAIwK,KAC/B61B,EAAM,kBAAmB71B,GACzB5J,KAAKgzG,MAAMnxE,WAAW3iC,IAAI0K,GAAO,GAEjC5J,KAAKylC,KAAK,WAAY77B,GACtB5J,KAAKizG,cAAcrpG,IAGrBspG,SAAUtpG,GACR,IAAK5J,KAAK+yG,cAAe,OAEzBtzE,EAAM,cAAe71B,GACrB,MAAMoB,EAAM9J,EAAO6B,MAAM,GACzBiI,EAAIq/B,cAAczgC,GAElB5J,KAAKgzG,MAAMrzF,SAAS,cAAe3U,GAGrCioG,cAAerpG,GACb,MAAMo4B,EAAWhiC,KAAKgzG,MAAMhxE,SAC5B,IAAK,IAAI32B,EAAI,EAAGA,EAAI22B,EAAS1gC,OAAQ+J,IAAK,CACxC,MAAMmjC,EAAMxM,EAAS32B,GACjBmjC,EAAI3N,QAAUj3B,IAChB21B,EAAYyC,EAAU32B,GACtBA,GAAK,EACLrL,KAAKgzG,MAAM/pE,UAAUuF,EAAK,IAAIvvC,MAAM,sBAAuB,SASnE,OAFA4zG,EAAW5yG,UAAUH,KAAO,cAErB+yG,wCC5DTp0G,EAAOC,QAAUy0G,EACjB10G,EAAOC,QAAQiC,OAASwyG,EACxB10G,EAAOC,QAAQqC,OAsHf,SAA0BmD,GACxBA,EAAMsB,OAAO+iB,OAAO,GAAIrkB,GAMxB,IAAIkvG,EAAM,IAAIp5E,IACV91B,EAAImvG,IAAwB,iBAAXnvG,EAAImvG,IAAiBD,EAAI18F,IAAIxS,EAAImvG,IAClDnvG,EAAImvG,IAAM3xG,MAAMC,QAAQuC,EAAImvG,MAAKD,EAAM,IAAIp5E,IAAI91B,EAAImvG,KACnDnvG,EAAI0jC,gBAAgBwrE,EAAI18F,IAAI,YAAYxS,EAAI0jC,eAAe37B,SAAS,UACpE/H,EAAI0iC,UAAUwsE,EAAI18F,IAAI,YAAYxS,EAAI0iC,YACtC1iC,EAAIovG,kBAAkBF,EAAI18F,IAAIxS,EAAImvG,GAAK,gBAAgBnvG,EAAIovG,iBAAiBrnG,SAAS,UACrF/H,EAAIqvG,YAAYH,EAAI18F,IAAI,gBAAgBxS,EAAIqvG,cAChD,MAAMC,EAAa9xG,MAAMmM,KAAKulG,GACJ,IAAtBI,EAAWlyG,SAAc4C,EAAImvG,GAAKG,EAAW,IAC7CA,EAAWlyG,OAAS,IAAG4C,EAAImvG,GAAKG,GAEhCtvG,EAAIuvG,kBAAiBvvG,EAAIwvG,GAAK,YAAYxvG,EAAIuvG,gBAAgBxnG,SAAS,UACvE/H,EAAIyvG,YAAWzvG,EAAIwvG,GAAK,YAAYxvG,EAAIyvG,aACxCzvG,EAAIpE,OAAMoE,EAAI0vG,GAAK1vG,EAAIpE,MACvBoE,EAAI2vG,WAAU3vG,EAAI4vG,GAAK5vG,EAAI2vG,UAC3B3vG,EAAImrC,WAAUnrC,EAAI6vG,GAAK7vG,EAAImrC,UAC3BnrC,EAAI0hE,UACN1hE,EAAIka,GAAKla,EAAI0hE,eACN1hE,EAAI8vG,IAET9vG,EAAI+vG,gBAAe/vG,EAAI,QAAUA,EAAI+vG,eAEzC,IAAI/tG,EAAS,WAyBb,OAxBAV,OAAOC,KAAKvB,GACTiB,QAAOd,GAAsB,IAAfA,EAAI/C,QAAwB,SAAR+C,IAClCrB,SAAQ,CAACqB,EAAKgH,KACb,MAAMc,EAASzK,MAAMC,QAAQuC,EAAIG,IAAQH,EAAIG,GAAO,CAACH,EAAIG,IACzD8H,EAAOnJ,SAAQ,CAAC2C,EAAK2F,MACdD,EAAI,GAAKC,EAAI,KAAgB,OAARjH,GAAwB,OAARA,GAAuB,IAANiH,KAAUpF,GAAU,KAEnE,OAAR7B,IAAcsB,EAAM45F,mBAAmB55F,GAAKiI,QAAQ,OAAQ,MACpD,OAARvJ,GAAwB,OAARA,GAAwB,OAARA,IAClCsB,EAAM45F,mBAAmB55F,IAGf,OAARtB,GAAiBsB,EAAIuuG,WAAW,eAClCvuG,EAAM45F,mBAAmB55F,IAEf,OAARtB,IAAcsB,EAAM45F,mBAAmB55F,IAC/B,OAARtB,IAEuB6B,GAAf,OAAR7B,GAAgBiH,EAAI,EAAa,IAAI3F,IAC1B,GAAGtB,KAAOsB,QAEf,OAARtB,IAAc6B,GAAU,GAAG7B,KAAO8vG,EAAW11E,QAAQtyB,SAGtDjG,GA1KT,MAAMkuG,EAAS,EAAQ,MACjBD,EAAa,EAAQ,MAQ3B,SAAShB,EAAiBkB,GACxB,MAAMnuG,EAAS,GAGTtF,EAAOyzG,EAAI/mG,MAAM,YAAY,GA8CnC,IAAIvO,EAsDJ,OAlGgB6B,GAAQA,EAAKU,QAAU,EACnCV,EAAK0M,MAAM,KACX,IAEGtK,SAAQsxG,IACb,MAAMC,EAASD,EAAMhnG,MAAM,KAG3B,GAAsB,IAAlBinG,EAAOjzG,OAAc,OAEzB,MAAM+C,EAAMkwG,EAAO,GACnB,IAAI5uG,EAAM4uG,EAAO,GAGL,OAARlwG,IAAcsB,EAAM05F,mBAAmB15F,GAAKiI,QAAQ,MAAO,MAInD,OAARvJ,GAAwB,OAARA,GAAwB,OAARA,GAAwB,OAARA,IAClDsB,EAAM05F,mBAAmB15F,IAIf,OAARtB,IAAcsB,EAAM05F,mBAAmB15F,GAAK2H,MAAM,MAG1C,OAARjJ,IAAcsB,EAAMxG,OAAOwG,IAGnB,OAARtB,IAAcsB,EAAMwuG,EAAW31E,MAAM6gE,mBAAmB15F,GAAK2H,MAAM,OAGnEpH,EAAO7B,IACJ3C,MAAMC,QAAQuE,EAAO7B,MACxB6B,EAAO7B,GAAO,CAAC6B,EAAO7B,KAGxB6B,EAAO7B,GAAKU,KAAKY,IAEjBO,EAAO7B,GAAOsB,KAMdO,EAAOmtG,KACG3xG,MAAMC,QAAQuE,EAAOmtG,IAAMntG,EAAOmtG,GAAK,CAACntG,EAAOmtG,KACvDrwG,SAAQqwG,IACV,GAAKt0G,EAAIs0G,EAAGxrG,MAAM,qBAChB3B,EAAO0gC,SAAW7nC,EAAE,GAAG8oC,mBAClB,GAAK9oC,EAAIs0G,EAAGxrG,MAAM,qBAAuB,CAC9C,MAAM2sG,EAAaJ,EAAOzzG,OAAO5B,EAAE,IACnCmH,EAAO0gC,SAAW1lC,EAAO2M,KAAK2mG,EAAY,UAAUvoG,SAAS,YACnDlN,EAAIs0G,EAAGxrG,MAAM,4BACvB3B,EAAOqtG,WAAax0G,EAAE,GAAG8oC,kBAK3B3hC,EAAOwtG,KACGhyG,MAAMC,QAAQuE,EAAOwtG,IAAMxtG,EAAOwtG,GAAK,CAACxtG,EAAOwtG,KACvD1wG,SAAQ0wG,KACL30G,EAAI20G,EAAG7rG,MAAM,wBAChB3B,EAAOytG,UAAY50G,EAAE,GAAG8oC,kBAK1B3hC,EAAO0gC,WAAU1gC,EAAO0hC,eAAiB1mC,EAAO2M,KAAK3H,EAAO0gC,SAAU,QACtE1gC,EAAOqtG,aAAYrtG,EAAOotG,iBAAmBpyG,EAAO2M,KAAK3H,EAAOqtG,WAAY,QAC5ErtG,EAAOytG,YAAWztG,EAAOutG,gBAAkBvyG,EAAO2M,KAAK3H,EAAOytG,UAAW,QAEzEztG,EAAO0tG,KAAI1tG,EAAOpG,KAAOoG,EAAO0tG,IAChC1tG,EAAO4tG,KAAI5tG,EAAO2tG,SAAW3tG,EAAO4tG,IAExC5tG,EAAOmpC,SAAW,IACO,iBAAdnpC,EAAO6tG,IAAmBryG,MAAMC,QAAQuE,EAAO6tG,OACxD7tG,EAAOmpC,SAAWnpC,EAAOmpC,SAAS9rC,OAAO2C,EAAO6tG,KAGlD7tG,EAAO0/D,QAAU,IACQ,iBAAd1/D,EAAO8tG,IAAmBtyG,MAAMC,QAAQuE,EAAO8tG,OACxD9tG,EAAO0/D,QAAU1/D,EAAO0/D,QAAQriE,OAAO2C,EAAO8tG,MAEvB,iBAAd9tG,EAAOkY,IAAmB1c,MAAMC,QAAQuE,EAAOkY,OACxDlY,EAAO0/D,QAAU1/D,EAAO0/D,QAAQriE,OAAO2C,EAAOkY,KAGhDlY,EAAO+tG,cAAgB,IACO,iBAAnB/tG,EAAO,SAAwBxE,MAAMC,QAAQuE,EAAO,YAC7DA,EAAO+tG,cAAgB/tG,EAAO+tG,cAAc1wG,OAAO2C,EAAO,UAI5DA,EAAOmpC,SAAW3tC,MAAMmM,KAAK,IAAImsB,IAAI9zB,EAAOmpC,WAC5CnpC,EAAO0/D,QAAUlkE,MAAMmM,KAAK,IAAImsB,IAAI9zB,EAAO0/D,UAC3C1/D,EAAO+tG,cAAgBvyG,MAAMmM,KAAK,IAAImsB,IAAI9zB,EAAO+tG,gBAE1C/tG,gCCrHT,IAAItG,EAAW,EAAQ,MACnBoiG,EAAW,EAAQ,MACnB9gG,EAAS,eAETuzG,EAAU,IAAI/yG,MAAM,IAExB,SAAS8gE,IACPw/B,EAASzhG,KAAKP,KAAM,IAGpBA,KAAK00G,GAAK,WACV10G,KAAK20G,GAAK,WACV30G,KAAK40G,GAAK,WACV50G,KAAK20B,GAAK,UA+GZ,SAASkgF,EAAM34F,EAAG8B,GAChB,OAAQ9B,GAAK8B,EAAM9B,IAAO,GAAK8B,EAGjC,SAAS82F,EAAKliG,EAAGC,EAAGrC,EAAG8rB,EAAGv9B,EAAGiU,EAAGmK,GAC9B,OAAQ03F,EAAMjiG,GAAMC,EAAIrC,GAAQqC,EAAKypB,GAAMv9B,EAAIiU,EAAK,EAAGmK,GAAKtK,EAAK,EAGnE,SAASkiG,EAAKniG,EAAGC,EAAGrC,EAAG8rB,EAAGv9B,EAAGiU,EAAGmK,GAC9B,OAAQ03F,EAAMjiG,GAAMC,EAAIypB,EAAM9rB,GAAM8rB,GAAOv9B,EAAIiU,EAAK,EAAGmK,GAAKtK,EAAK,EAGnE,SAASmiG,EAAKpiG,EAAGC,EAAGrC,EAAG8rB,EAAGv9B,EAAGiU,EAAGmK,GAC9B,OAAQ03F,EAAMjiG,GAAKC,EAAIrC,EAAI8rB,GAAKv9B,EAAIiU,EAAK,EAAGmK,GAAKtK,EAAK,EAGxD,SAASoiG,EAAKriG,EAAGC,EAAGrC,EAAG8rB,EAAGv9B,EAAGiU,EAAGmK,GAC9B,OAAQ03F,EAAMjiG,GAAMpC,GAAKqC,GAAMypB,IAAQv9B,EAAIiU,EAAK,EAAGmK,GAAKtK,EAAK,EA7H/DjT,EAAS4iE,EAAKw/B,GAEdx/B,EAAIviE,UAAUi9C,QAAU,WAEtB,IADA,IAAIjE,EAAIw7D,EACCppG,EAAI,EAAGA,EAAI,KAAMA,EAAG4tC,EAAE5tC,GAAKrL,KAAKiiG,OAAOrqC,YAAgB,EAAJvsD,GAE5D,IAAIuH,EAAI5S,KAAK00G,GACT7hG,EAAI7S,KAAK20G,GACTnkG,EAAIxQ,KAAK40G,GACTt4E,EAAIt8B,KAAK20B,GAEb/hB,EAAIkiG,EAAIliG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAIw4E,EAAIx4E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,IACtCzoC,EAAIskG,EAAItkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,GAAI,UAAY,IACtCpmC,EAAIiiG,EAAIjiG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IACtCrmC,EAAIkiG,EAAIliG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAIw4E,EAAIx4E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,IACtCzoC,EAAIskG,EAAItkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,GAAI,WAAY,IACtCpmC,EAAIiiG,EAAIjiG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IACtCrmC,EAAIkiG,EAAIliG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAIw4E,EAAIx4E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,IACtCzoC,EAAIskG,EAAItkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,IAAK,WAAY,IACvCpmC,EAAIiiG,EAAIjiG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,IAAK,WAAY,IACvCrmC,EAAIkiG,EAAIliG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,IAAK,WAAY,GACvC3c,EAAIw4E,EAAIx4E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,IAAK,WAAY,IACvCzoC,EAAIskG,EAAItkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,IAAK,WAAY,IAGvCrmC,EAAImiG,EAAIniG,EAFRC,EAAIiiG,EAAIjiG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,IAAK,WAAY,IAEzBzoC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAIy4E,EAAIz4E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,GACtCzoC,EAAIukG,EAAIvkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,IAAK,UAAY,IACvCpmC,EAAIkiG,EAAIliG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IACtCrmC,EAAImiG,EAAIniG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAIy4E,EAAIz4E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,IAAK,SAAY,GACvCzoC,EAAIukG,EAAIvkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,IAAK,WAAY,IACvCpmC,EAAIkiG,EAAIliG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IACtCrmC,EAAImiG,EAAIniG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,UAAY,GACtC3c,EAAIy4E,EAAIz4E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,IAAK,WAAY,GACvCzoC,EAAIukG,EAAIvkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,GAAI,WAAY,IACtCpmC,EAAIkiG,EAAIliG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IACtCrmC,EAAImiG,EAAIniG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,IAAK,WAAY,GACvC3c,EAAIy4E,EAAIz4E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,GACtCzoC,EAAIukG,EAAIvkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,GAAI,WAAY,IAGtCrmC,EAAIoiG,EAAIpiG,EAFRC,EAAIkiG,EAAIliG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,IAAK,WAAY,IAEzBzoC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAI04E,EAAI14E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,IACtCzoC,EAAIwkG,EAAIxkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,IAAK,WAAY,IACvCpmC,EAAImiG,EAAIniG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,IAAK,WAAY,IACvCrmC,EAAIoiG,EAAIpiG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAI04E,EAAI14E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,IACtCzoC,EAAIwkG,EAAIxkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,GAAI,WAAY,IACtCpmC,EAAImiG,EAAIniG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,IAAK,WAAY,IACvCrmC,EAAIoiG,EAAIpiG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,IAAK,UAAY,GACvC3c,EAAI04E,EAAI14E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,IACtCzoC,EAAIwkG,EAAIxkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,GAAI,WAAY,IACtCpmC,EAAImiG,EAAIniG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,SAAY,IACtCrmC,EAAIoiG,EAAIpiG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAI04E,EAAI14E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,IAAK,WAAY,IACvCzoC,EAAIwkG,EAAIxkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,IAAK,UAAY,IAGvCrmC,EAAIqiG,EAAIriG,EAFRC,EAAImiG,EAAIniG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IAExBzoC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAI24E,EAAI34E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,IACtCzoC,EAAIykG,EAAIzkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,IAAK,WAAY,IACvCpmC,EAAIoiG,EAAIpiG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IACtCrmC,EAAIqiG,EAAIriG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,IAAK,WAAY,GACvC3c,EAAI24E,EAAI34E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,GAAI,WAAY,IACtCzoC,EAAIykG,EAAIzkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,IAAK,WAAY,IACvCpmC,EAAIoiG,EAAIpiG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IACtCrmC,EAAIqiG,EAAIriG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAI24E,EAAI34E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,IAAK,WAAY,IACvCzoC,EAAIykG,EAAIzkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,GAAI,WAAY,IACtCpmC,EAAIoiG,EAAIpiG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,IAAK,WAAY,IACvCrmC,EAAIqiG,EAAIriG,EAAGC,EAAGrC,EAAG8rB,EAAG2c,EAAE,GAAI,WAAY,GACtC3c,EAAI24E,EAAI34E,EAAG1pB,EAAGC,EAAGrC,EAAGyoC,EAAE,IAAK,WAAY,IACvCzoC,EAAIykG,EAAIzkG,EAAG8rB,EAAG1pB,EAAGC,EAAGomC,EAAE,GAAI,UAAY,IACtCpmC,EAAIoiG,EAAIpiG,EAAGrC,EAAG8rB,EAAG1pB,EAAGqmC,EAAE,GAAI,WAAY,IAEtCj5C,KAAK00G,GAAM10G,KAAK00G,GAAK9hG,EAAK,EAC1B5S,KAAK20G,GAAM30G,KAAK20G,GAAK9hG,EAAK,EAC1B7S,KAAK40G,GAAM50G,KAAK40G,GAAKpkG,EAAK,EAC1BxQ,KAAK20B,GAAM30B,KAAK20B,GAAK2H,EAAK,GAG5BkmC,EAAIviE,UAAUuiG,QAAU,WAEtBxiG,KAAKiiG,OAAOjiG,KAAKmiG,gBAAkB,IAC/BniG,KAAKmiG,aAAe,KACtBniG,KAAKiiG,OAAOp9C,KAAK,EAAG7kD,KAAKmiG,aAAc,IACvCniG,KAAKk9C,UACLl9C,KAAKmiG,aAAe,GAGtBniG,KAAKiiG,OAAOp9C,KAAK,EAAG7kD,KAAKmiG,aAAc,IACvCniG,KAAKiiG,OAAOrpC,cAAc54D,KAAKoiG,QAAQ,GAAI,IAC3CpiG,KAAKiiG,OAAOrpC,cAAc54D,KAAKoiG,QAAQ,GAAI,IAC3CpiG,KAAKk9C,UAGL,IAAI3xC,EAASrK,EAAOkpC,YAAY,IAKhC,OAJA7+B,EAAO6tD,aAAap5D,KAAK00G,GAAI,GAC7BnpG,EAAO6tD,aAAap5D,KAAK20G,GAAI,GAC7BppG,EAAO6tD,aAAap5D,KAAK40G,GAAI,GAC7BrpG,EAAO6tD,aAAap5D,KAAK20B,GAAI,IACtBppB,GAuBT9M,EAAOC,QAAU8jE,kBChJjB/jE,EAAOC,QAAUw2G,EAEjB,IAAIt1G,EAAW,EAAQ,MACnBigC,EAAS,EAAQ,MACjBs1E,EAAgB,EAAQ,MAExBC,EAAgC,oBAAX/kG,QAA0BA,OAAO+kG,YAI1D,SAASF,EAAqBjrG,EAAMg1B,GAClC,IAAItsB,EAAO3S,KACX,KAAM2S,aAAgBuiG,GAAsB,OAAO,IAAIA,EAAoBjrG,EAAMg1B,GAEjF,IAAKm2E,EAAa,MAAM,IAAIn2G,MAAM,yCAE7BggC,IAAMA,EAAO,IAClBtsB,EAAK2uB,OAASrC,EAAKQ,MACnB9sB,EAAK0iG,gBAAkBp2E,EAAKq2E,gBAVA,GAW5B3iG,EAAK4iG,MAAQtrG,EACb0I,EAAK6iG,aAAe,IAAIJ,EACxBziG,EAAK8iG,SAAW,GAChB9iG,EAAK+iG,cAAgB,KAErB/iG,EAAKgjG,cAAgB,WACnBhjG,EAAK4iG,MAAM1+D,oBAAoB,QAASlkC,EAAKgjG,eAC/BhjG,EAAK8iG,SAAS7yG,QACpBI,SAAQ,SAAU68B,GACxBA,EAAO2F,QAAQ7yB,EAAK4iG,MAAMh0G,WAG9BoR,EAAK4iG,MAAM5+D,iBAAiB,QAAShkC,EAAKgjG,eAE1ChjG,EAAK4iG,MAAM39D,IAAMvnC,OAAO6jC,IAAI0hE,gBAAgBjjG,EAAK6iG,cAkDnD,SAASK,EAAmBC,EAAS5xG,GACnC,IAAIyO,EAAO3S,KAwBX,GAvBA6/B,EAAO2jB,SAASjjD,KAAKoS,GAErBA,EAAKojG,SAAWD,EAChBnjG,EAAK4iG,MAAQO,EAAQP,MACrB5iG,EAAK6iG,aAAeM,EAAQN,aAC5B7iG,EAAKqjG,YAAcF,EAAQL,SAC3B9iG,EAAKqjG,YAAYjxG,KAAK4N,GACtBA,EAAK0iG,gBAAkBS,EAAQT,gBAC/B1iG,EAAKsjG,cAAgB,KACrBtjG,EAAKujG,cAAgB,GAErBvjG,EAAKwjG,aAAe,WAClBxjG,EAAKyjG,iBAEPzjG,EAAK0jG,aAAe,WAClB1jG,EAAK2jG,SAEP3jG,EAAKgjG,cAAgB,SAAU5rG,GACxB4I,EAAKwwB,WACRxwB,EAAK8yB,KAAK,QAAS17B,IAIJ,iBAAR7F,EACTyO,EAAK4jG,MAAQryG,EAEwB,SAAjCyO,EAAK6iG,aAAagB,WACpB7jG,EAAK8jG,sBAEL9jG,EAAK6iG,aAAa7+D,iBAAiB,aAAchkC,EAAKwjG,mBAEnD,GAA0B,OAAtBjyG,EAAI+xG,cACb/xG,EAAIshC,UACJ7yB,EAAK4jG,MAAQryG,EAAIqyG,MACjB5jG,EAAK6iG,aAAa7+D,iBAAiB,aAAchkC,EAAKwjG,kBACjD,KAAIjyG,EAAI+xG,cAQb,MAAM,IAAIh3G,MAAM,2HAPhBiF,EAAIshC,UACJ7yB,EAAK4jG,MAAQryG,EAAIqyG,MACjB5jG,EAAKsjG,cAAgB/xG,EAAI+xG,cACzBtjG,EAAKujG,cAAgBhyG,EAAIgyG,cACzBvjG,EAAKsjG,cAAct/D,iBAAiB,YAAahkC,EAAK0jG,cACtD1jG,EAAKsjG,cAAct/D,iBAAiB,QAAShkC,EAAKgjG,eAKpDhjG,EAAK4iG,MAAM5+D,iBAAiB,aAAchkC,EAAK0jG,cAE/C1jG,EAAK+xB,GAAG,SAAS,SAAU36B,GACzB4I,EAAKojG,SAASx0G,MAAMwI,MAGtB4I,EAAK+xB,GAAG,UAAU,WAChB,IAAI/xB,EAAKwwB,YACTxwB,EAAKywB,WAAY,EACbzwB,EAAKqjG,YAAYU,OAAM,SAAUzlF,GAAS,OAAOA,EAAMmS,cAAc,CACvEzwB,EAAKojG,SAASY,iBACd,IACEhkG,EAAK6iG,aAAaoB,cAClB,MAAO7sG,SAxGfmrG,EAAoBj1G,UAAU42G,kBAAoB,SAAU3yG,GAG1D,OAAO,IAAI2xG,EAFA71G,KAEwBkE,IAMrCgxG,EAAoBj1G,UAAUsB,MAAQ,SAAUwI,GAC9C,IAAI4I,EAAO3S,KAGN2S,EAAK+iG,gBACR/iG,EAAK+iG,cAAgB3rG,GAEvB4I,EAAKgkG,iBACL,IACEhkG,EAAK6iG,aAAaoB,YAAY,UAC9B,MAAO7sG,IAET,IAEEsG,OAAO6jC,IAAI4iE,gBAAgBnkG,EAAK4iG,MAAM39D,KACtC,MAAO7tC,MAMXmrG,EAAoBj1G,UAAU02G,eAAiB,WAC7C,IAAIhkG,EAAO3S,KAEP2S,EAAK2uB,SACP3uB,EAAK2uB,QAAS,EACd3uB,EAAK8iG,SAASzyG,SAAQ,SAAU68B,EAAQx0B,GAgN5C,IAA0B0rG,EAAMj3G,EAC1B8S,EADoBmkG,EA/MJl3E,EAAOq2E,cA+MGp2G,EA/MY,sBAAwBuL,GAgN9DuH,EAAI82D,SAASstC,cAAc,MAC7B3gE,KAAOhmC,OAAO6jC,IAAI0hE,gBAAgB,IAAIvlG,OAAOmmC,KAAKugE,IACpDnkG,EAAEqkG,SAAWn3G,EACb8S,EAAEskG,aA9MJt3G,EAASi2G,EAAmBh2E,EAAO2jB,UAoEnCqyD,EAAkB51G,UAAUm2G,cAAgB,WAC1C,IAAIzjG,EAAO3S,KACP2S,EAAKwwB,YAETxwB,EAAK6iG,aAAa3+D,oBAAoB,aAAclkC,EAAKwjG,cACzDxjG,EAAK8jG,wBAGPZ,EAAkB51G,UAAUulC,QAAU,SAAUz7B,GAC9C,IAAI4I,EAAO3S,KACP2S,EAAKwwB,YACTxwB,EAAKwwB,WAAY,EAGjBxwB,EAAKqjG,YAAYznG,OAAOoE,EAAKqjG,YAAY5oF,QAAQza,GAAO,GAExDA,EAAK6iG,aAAa3+D,oBAAoB,aAAclkC,EAAKwjG,cACzDxjG,EAAK4iG,MAAM1+D,oBAAoB,aAAclkC,EAAK0jG,cAC9C1jG,EAAKsjG,gBACPtjG,EAAKsjG,cAAcp/D,oBAAoB,YAAalkC,EAAK0jG,cACzD1jG,EAAKsjG,cAAcp/D,oBAAoB,QAASlkC,EAAKgjG,eAChB,SAAjChjG,EAAK6iG,aAAagB,YACpB7jG,EAAKsjG,cAAc9d,SAInBpuF,GAAK4I,EAAK8yB,KAAK,QAAS17B,GAC5B4I,EAAK8yB,KAAK,WAGZowE,EAAkB51G,UAAUw2G,oBAAsB,WAChD,IAAI9jG,EAAO3S,KACX,IAAI2S,EAAKwwB,UAET,GAAIiyE,EAAY+B,gBAAgBxkG,EAAK4jG,QAInC,GAHA5jG,EAAKsjG,cAAgBtjG,EAAK6iG,aAAa4B,gBAAgBzkG,EAAK4jG,OAC5D5jG,EAAKsjG,cAAct/D,iBAAiB,YAAahkC,EAAK0jG,cACtD1jG,EAAKsjG,cAAct/D,iBAAiB,QAAShkC,EAAKgjG,eAC9ChjG,EAAK0kG,IAAK,CACZ,IAAItuE,EAAKp2B,EAAK0kG,IACd1kG,EAAK0kG,IAAM,KACXtuE,UAGFp2B,EAAK6yB,QAAQ,IAAIvmC,MAAM,wCAI3B42G,EAAkB51G,UAAUusC,OAAS,SAAU2Q,EAAOnhB,EAAU+M,GAC9D,IAAIp2B,EAAO3S,KACX,IAAI2S,EAAKwwB,UACT,GAAKxwB,EAAKsjG,cAAV,CAQA,GAAItjG,EAAKsjG,cAAcqB,SACrB,OAAOvuE,EAAG,IAAI9pC,MAAM,sDAGtB,IAAIs1B,EAAM4gF,EAAch4D,GACpBxqC,EAAKojG,SAASz0E,QAChB3uB,EAAKujG,cAAcnxG,KAAKwvB,GAG1B,IACE5hB,EAAKsjG,cAAcsB,aAAahjF,GAChC,MAAOxqB,GAMP,YADA4I,EAAK6yB,QAAQz7B,GAGf4I,EAAK0kG,IAAMtuE,OA1BTp2B,EAAK0kG,IAAM,SAAUttG,GACnB,GAAIA,EAAK,OAAOg/B,EAAGh/B,GACnB4I,EAAK65B,OAAO2Q,EAAOnhB,EAAU+M,KA2BnC8sE,EAAkB51G,UAAUq2G,MAAQ,WAClC,IAAI3jG,EAAO3S,KAEX,IAAI2S,EAAKwwB,WAAcxwB,EAAKsjG,gBAAiBtjG,EAAKsjG,cAAcqB,YAI3B,SAAjC3kG,EAAK6iG,aAAagB,YAEhB7jG,EAAK6kG,qBAAuB7kG,EAAK0iG,kBAKnC1iG,EAAK0kG,IAAK,CACZ,IAAItuE,EAAKp2B,EAAK0kG,IACd1kG,EAAK0kG,IAAM,KACXtuE,MAOJ8sE,EAAkB51G,UAAUu3G,mBAAqB,WAQ/C,IAPA,IAEIC,EAFOz3G,KAESi2G,cAAcwB,SAC9BC,EAHO13G,KAGYu1G,MAAMmC,YACzBC,GAAa,EAGRtsG,EAAI,EAAGA,EAAIosG,EAASn2G,OAAQ+J,IAAK,CACxC,IAAIxE,EAAQ4wG,EAAS5wG,MAAMwE,GACvBqC,EAAM+pG,EAAS/pG,IAAIrC,GAZb,EAcV,GAAIxE,EAAQ6wG,EAEV,OACSC,GAAa,GAAKD,GAAehqG,KAE1CiqG,EAAYjqG,GAIhB,IAAIkqG,EAAeD,EAAYD,EAK/B,OAJIE,EAAe,IACjBA,EAAe,GAGVA,mBCzRTn5G,EAAOC,QAAUm5G,EAEjB,MAAM9oE,EAAiB,EAAQ,MAE/B,SAAS8oE,EAAS98C,EAAa97B,GAC7B,KAAMj/B,gBAAgB63G,GAAU,OAAO,IAAIA,EAAQ98C,EAAa97B,GAIhE,GAHKA,IAAMA,EAAO,IAElBj/B,KAAK+6D,YAAc57D,OAAO47D,IACrB/6D,KAAK+6D,YAAa,MAAM,IAAI97D,MAAM,yCAEvCe,KAAK83G,OAAS,GACd93G,KAAKwqG,QAAS,EACdxqG,KAAKsB,OAASnC,OAAO8/B,EAAK39B,SAAW+uB,EAAAA,EAEjCrwB,KAAKsB,SAAW+uB,EAAAA,IAClBrwB,KAAKyqG,gBAAmBzqG,KAAKsB,OAAStB,KAAK+6D,aAAgB/6D,KAAK+6D,YAChE/6D,KAAK0qG,eAAiB55F,KAAKS,KAAKvR,KAAKsB,OAAStB,KAAK+6D,aAAe,GAItE88C,EAAQ53G,UAAUg7D,IAAM,SAAUrxD,EAAOoB,EAAK+9B,EAAK,UACjD,GAAI/oC,KAAKwqG,OAAQ,OAAOz7D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAE1D,MAAMisG,EAAethG,IAAU5J,KAAK0qG,eACpC,OAAIQ,GAAelgG,EAAI1J,SAAWtB,KAAKyqG,gBAC9B17D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,6BAA+Be,KAAKyqG,oBAE1ES,GAAelgG,EAAI1J,SAAWtB,KAAK+6D,aAGxC/6D,KAAK83G,OAAOluG,GAASoB,OACrB+jC,GAAe,IAAMhG,EAAG,SAHfgG,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAA0Be,KAAK+6D,iBAM5E88C,EAAQ53G,UAAUb,IAAM,SAAUwK,EAAOq1B,EAAM8J,EAAK,UAClD,GAAoB,mBAAT9J,EAAqB,OAAOj/B,KAAKZ,IAAIwK,EAAO,KAAMq1B,GAC7D,GAAIj/B,KAAKwqG,OAAQ,OAAOz7D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAE1D,IAAI+L,EAAMhL,KAAK83G,OAAOluG,GAEtB,IAAKoB,EAAK,CACR,MAAMjB,EAAM,IAAI9K,MAAM,mBAEtB,OADA8K,EAAIqhG,UAAW,EACRr8D,GAAe,IAAMhG,EAAGh/B,KAG5Bk1B,IAAMA,EAAO,IAElB,MAAM59B,EAAS49B,EAAK59B,QAAU,EACxB+J,EAAM6zB,EAAK39B,QAAW0J,EAAI1J,OAASD,EAE1B,IAAXA,GAAgB+J,IAAQJ,EAAI1J,SAC9B0J,EAAMA,EAAIpI,MAAMvB,EAAQ+J,EAAM/J,IAGhC0tC,GAAe,IAAMhG,EAAG,KAAM/9B,MAGhC6sG,EAAQ53G,UAAU2nD,MAAQiwD,EAAQ53G,UAAUulC,QAAU,SAAUuD,EAAK,UACnE,GAAI/oC,KAAKwqG,OAAQ,OAAOz7D,GAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAC1De,KAAKwqG,QAAS,EACdxqG,KAAK83G,OAAS,KACd/oE,GAAe,IAAMhG,EAAG,yBC/D1B,IAAIs4B,EAAK,EAAQ,MACb02C,EAAU,EAAQ,MAEtB,SAASC,EAAY3/D,GACnBr4C,KAAKq4C,KAAOA,GAAQ,IAAI0/D,EAAQ3/D,KAElC35C,EAAOC,QAAUs5G,EAEjBA,EAAYxpF,OAAS,SAAgB6pB,GACnC,OAAO,IAAI2/D,EAAY3/D,IAGzB2/D,EAAY/3G,UAAUg4G,WAAa,SAAoBj6F,GACrD,IAAI5S,EAAM4S,EAAEvJ,YACRyjG,EAAYpnG,KAAKS,KAAKnG,EAAM,GAIhC,GACE,IAAIwH,EAAI,IAAIyuD,EAAGrhE,KAAKq4C,KAAKC,SAAS4/D,UAC7BtlG,EAAE1B,IAAI8M,IAAM,GAEnB,OAAOpL,GAGTolG,EAAY/3G,UAAUk4G,WAAa,SAAoBtxG,EAAOqqC,GAE5D,IAAItyC,EAAOsyC,EAAKv6B,IAAI9P,GACpB,OAAOA,EAAM6P,IAAI1W,KAAKi4G,WAAWr5G,KAGnCo5G,EAAY/3G,UAAUoH,KAAO,SAAc2W,EAAGhL,EAAG+1B,GAC/C,IAAI39B,EAAM4S,EAAEvJ,YACRtE,EAAMkxD,EAAGj6C,KAAKpJ,GACdo6F,EAAO,IAAI/2C,EAAG,GAAG19C,MAAMxT,GAEtB6C,IACHA,EAAIlC,KAAKC,IAAI,EAAI3F,EAAM,GAAM,IAI/B,IADA,IAAIitG,EAAKr6F,EAAEwC,KAAK,GACPrD,EAAI,GAAIk7F,EAAGnjG,MAAMiI,GAAIA,KAM9B,IALA,IAAImf,EAAIte,EAAEkC,KAAK/C,GAEXm7F,EAAMD,EAAG10F,MAAMxT,GAGZ6C,EAAI,EAAGA,IAAK,CACjB,IAAIJ,EAAI5S,KAAKm4G,WAAW,IAAI92C,EAAG,GAAIg3C,GAC/BtvE,GACFA,EAAGn2B,GAEL,IAAIsJ,EAAItJ,EAAE+Q,MAAMxT,GAAK+U,OAAOoX,GAC5B,GAAoB,IAAhBpgB,EAAEhL,IAAIknG,IAA8B,IAAfl8F,EAAEhL,IAAIonG,GAA/B,CAGA,IAAK,IAAIjtG,EAAI,EAAGA,EAAI8R,EAAG9R,IAAK,CAG1B,GAAoB,KAFpB6Q,EAAIA,EAAEyI,UAEAzT,IAAIknG,GACR,OAAO,EACT,GAAmB,IAAfl8F,EAAEhL,IAAIonG,GACR,MAGJ,GAAIjtG,IAAM8R,EACR,OAAO,GAGX,OAvBY,GA0Bd66F,EAAY/3G,UAAUs4G,WAAa,SAAoBv6F,EAAGhL,GACxD,IAAI5H,EAAM4S,EAAEvJ,YACRtE,EAAMkxD,EAAGj6C,KAAKpJ,GACdo6F,EAAO,IAAI/2C,EAAG,GAAG19C,MAAMxT,GAEtB6C,IACHA,EAAIlC,KAAKC,IAAI,EAAI3F,EAAM,GAAM,IAI/B,IADA,IAAIitG,EAAKr6F,EAAEwC,KAAK,GACPrD,EAAI,GAAIk7F,EAAGnjG,MAAMiI,GAAIA,KAK9B,IAJA,IAAImf,EAAIte,EAAEkC,KAAK/C,GAEXm7F,EAAMD,EAAG10F,MAAMxT,GAEZ6C,EAAI,EAAGA,IAAK,CACjB,IAAIJ,EAAI5S,KAAKm4G,WAAW,IAAI92C,EAAG,GAAIg3C,GAE/Br2F,EAAIhE,EAAEuE,IAAI3P,GACd,GAAkB,IAAdoP,EAAEY,KAAK,GACT,OAAOZ,EAET,IAAI9F,EAAItJ,EAAE+Q,MAAMxT,GAAK+U,OAAOoX,GAC5B,GAAoB,IAAhBpgB,EAAEhL,IAAIknG,IAA8B,IAAfl8F,EAAEhL,IAAIonG,GAA/B,CAGA,IAAK,IAAIjtG,EAAI,EAAGA,EAAI8R,EAAG9R,IAAK,CAG1B,GAAoB,KAFpB6Q,EAAIA,EAAEyI,UAEAzT,IAAIknG,GACR,OAAOl8F,EAAE6H,UAAUvD,KAAK,GAAG+B,IAAIvE,GACjC,GAAmB,IAAf9B,EAAEhL,IAAIonG,GACR,MAGJ,GAAIjtG,IAAM8R,EAER,OADAjB,EAAIA,EAAEyI,UACGZ,UAAUvD,KAAK,GAAG+B,IAAIvE,IAInC,OAAO,0BCjHT,SAAWvf,EAAQC,GACjB,aAGA,SAAS0E,EAAQuC,EAAK8D,GACpB,IAAK9D,EAAK,MAAM,IAAI1G,MAAMwK,GAAO,oBAKnC,SAAS7J,EAAU6P,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS3P,UAAYyP,EAAUzP,UAC/BwP,EAAKxP,UAAY,IAAI2P,EACrBH,EAAKxP,UAAUgC,YAAcwN,EAK/B,SAASI,EAAIC,EAAQtQ,EAAMuQ,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT9P,KAAKiQ,SAAW,EAChBjQ,KAAKkQ,MAAQ,KACblQ,KAAKsB,OAAS,EAGdtB,KAAKmQ,IAAM,KAEI,OAAXL,IACW,OAATtQ,GAA0B,OAATA,IACnBuQ,EAASvQ,EACTA,EAAO,IAGTQ,KAAKkF,MAAM4K,GAAU,EAAGtQ,GAAQ,GAAIuQ,GAAU,OAYlD,IAAI7O,EATkB,iBAAXzC,EACTA,EAAOC,QAAUmR,EAEjBnR,EAAQmR,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IAEIlP,EADoB,oBAAXmP,aAAmD,IAAlBA,OAAOnP,OACxCmP,OAAOnP,OAEP,eAEX,MAAOwF,IAgIT,SAAS4J,EAAeC,EAAQ3G,GAC9B,IAAI4G,EAAID,EAAOlC,WAAWzE,GAE1B,OAAI4G,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASC,EAAcF,EAAQG,EAAY9G,GACzC,IAAI+G,EAAIL,EAAcC,EAAQ3G,GAI9B,OAHIA,EAAQ,GAAK8G,IACfC,GAAKL,EAAcC,EAAQ3G,EAAQ,IAAM,GAEpC+G,EA8CT,SAASC,EAAWvH,EAAKxC,EAAO6G,EAAKmD,GAGnC,IAFA,IAAIF,EAAI,EACJvF,EAAM0F,KAAK/D,IAAI1D,EAAI/H,OAAQoM,GACtBrC,EAAIxE,EAAOwE,EAAID,EAAKC,IAAK,CAChC,IAAImF,EAAInH,EAAIgF,WAAWhD,GAAK,GAE5BsF,GAAKE,EAIHF,GADEH,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOG,EAnNTd,EAAGG,KAAO,SAAepK,GACvB,OAAIA,aAAeiK,GAIJ,OAARjK,GAA+B,iBAARA,GAC5BA,EAAI3D,YAAYmO,WAAaP,EAAGO,UAAY1O,MAAMC,QAAQiE,EAAIsK,QAGlEL,EAAGkB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG9C,IAAM,SAAciE,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG5P,UAAUiF,MAAQ,SAAe4K,EAAQtQ,EAAMuQ,GAChD,GAAsB,iBAAXD,EACT,OAAO9P,KAAKmR,YAAYrB,EAAQtQ,EAAMuQ,GAGxC,GAAsB,iBAAXD,EACT,OAAO9P,KAAKoR,WAAWtB,EAAQtQ,EAAMuQ,GAG1B,QAATvQ,IACFA,EAAO,IAET4D,EAAO5D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqH,EAAQ,EACM,OAFlBiJ,EAASA,EAAO7D,WAAW2B,QAAQ,OAAQ,KAEhC,KACT/G,IACA7G,KAAKiQ,SAAW,GAGdpJ,EAAQiJ,EAAOxO,SACJ,KAAT9B,EACFQ,KAAKqR,UAAUvB,EAAQjJ,EAAOkJ,IAE9B/P,KAAKsR,WAAWxB,EAAQtQ,EAAMqH,GACf,OAAXkJ,GACF/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,MAM9CF,EAAG5P,UAAUkR,YAAc,SAAsBrB,EAAQtQ,EAAMuQ,GACzDD,EAAS,IACX9P,KAAKiQ,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX9P,KAAKkQ,MAAQ,CAAW,SAATJ,GACf9P,KAAKsB,OAAS,GACLwO,EAAS,kBAClB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB9P,KAAKsB,OAAS,IAEd8B,EAAO0M,EAAS,kBAChB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF9P,KAAKsB,OAAS,GAGD,OAAXyO,GAGJ/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,IAGxCF,EAAG5P,UAAUmR,WAAa,SAAqBtB,EAAQtQ,EAAMuQ,GAG3D,GADA3M,EAAgC,iBAAlB0M,EAAOxO,QACjBwO,EAAOxO,QAAU,EAGnB,OAFAtB,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EACPtB,KAGTA,KAAKsB,OAASwP,KAAKS,KAAKzB,EAAOxO,OAAS,GACxCtB,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAGlB,IAAIC,EAAGkG,EACHC,EAAM,EACV,GAAe,OAAX1B,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAGgK,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,UAGC,GAAe,OAAXyE,EACT,IAAK1E,EAAI,EAAGC,EAAI,EAAGD,EAAIyE,EAAOxO,OAAQ+J,GAAK,EACzCmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,KAIN,OAAOtL,KAAK0R,SAyBd7B,EAAG5P,UAAUoR,UAAY,SAAoBvB,EAAQjJ,EAAOkJ,GAE1D/P,KAAKsB,OAASwP,KAAKS,MAAMzB,EAAOxO,OAASuF,GAAS,GAClD7G,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAIlB,IAGImG,EAHAC,EAAM,EACNnG,EAAI,EAGR,GAAe,OAAXyE,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAG+J,GAAKxE,EAAOwE,GAAK,EAC3CmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,OAKX,IAAKpG,GADayE,EAAOxO,OAASuF,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOwE,EAAIyE,EAAOxO,OAAQ+J,GAAK,EAC1EmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,EAKbzR,KAAK0R,SA2BP7B,EAAG5P,UAAUqR,WAAa,SAAqBxB,EAAQtQ,EAAMqH,GAE3D7G,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EAGd,IAAK,IAAIqQ,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWpS,EAClEmS,IAEFA,IACAC,EAAWA,EAAUpS,EAAQ,EAO7B,IALA,IAAIqS,EAAQ/B,EAAOxO,OAASuF,EACxBiL,EAAMD,EAAQF,EACdjE,EAAMoD,KAAK/D,IAAI8E,EAAOA,EAAQC,GAAOjL,EAErCkL,EAAO,EACF1G,EAAIxE,EAAOwE,EAAIqC,EAAKrC,GAAKsG,EAChCI,EAAOnB,EAAUd,EAAQzE,EAAGA,EAAIsG,EAASnS,GAEzCQ,KAAKgS,MAAMJ,GACP5R,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOnB,EAAUd,EAAQzE,EAAGyE,EAAOxO,OAAQ9B,GAEtC6L,EAAI,EAAGA,EAAIyG,EAAKzG,IACnB6G,GAAO1S,EAGTQ,KAAKgS,MAAME,GACPlS,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB/R,KAAK0R,SAGP7B,EAAG5P,UAAUiD,KAAO,SAAeiP,GACjCA,EAAKjC,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/B8G,EAAKjC,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAE7B8G,EAAK7Q,OAAStB,KAAKsB,OACnB6Q,EAAKlC,SAAWjQ,KAAKiQ,SACrBkC,EAAKhC,IAAMnQ,KAAKmQ,KAGlBN,EAAG5P,UAAU0E,MAAQ,WACnB,IAAIgM,EAAI,IAAId,EAAG,MAEf,OADA7P,KAAKkD,KAAKyN,GACHA,GAGTd,EAAG5P,UAAUmS,QAAU,SAAkBxT,GACvC,KAAOoB,KAAKsB,OAAS1C,GACnBoB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAE9B,OAAOtB,MAIT6P,EAAG5P,UAAUyR,MAAQ,WACnB,KAAO1R,KAAKsB,OAAS,GAAqC,IAAhCtB,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IACjDtB,KAAKsB,SAEP,OAAOtB,KAAKqS,aAGdxC,EAAG5P,UAAUoS,UAAY,WAKvB,OAHoB,IAAhBrS,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,KAClClQ,KAAKiQ,SAAW,GAEXjQ,MAGT6P,EAAG5P,UAAUqS,QAAU,WACrB,OAAQtS,KAAKmQ,IAAM,UAAY,SAAWnQ,KAAKiM,SAAS,IAAM,KAiChE,IAAIsG,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAsjB9D,SAASC,EAAYC,EAAM/M,EAAK9C,GAC9BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnC,IAAI7E,EAAOuH,EAAKrR,OAASsE,EAAItE,OAAU,EACvCwB,EAAIxB,OAAS8J,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIwH,EAAoB,EAAhBD,EAAKzC,MAAM,GACf2C,EAAmB,EAAfjN,EAAIsK,MAAM,GACdS,EAAIiC,EAAIC,EAERC,EAAS,SAAJnC,EACLoC,EAASpC,EAAI,SAAa,EAC9B7N,EAAIoN,MAAM,GAAK4C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI5H,EAAK4H,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAK2H,EAAI1H,EAAK,EAIlB2H,IADAtC,GAFAiC,EAAoB,EAAhBD,EAAKzC,MAAM7E,KACfwH,EAAmB,EAAfjN,EAAIsK,MAAM5E,IACF4H,GACG,SAAa,EAC5BA,EAAY,SAAJvC,EAEV7N,EAAIoN,MAAM8C,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFjQ,EAAIoN,MAAM8C,GAAa,EAARD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAzlBb7B,EAAG5P,UAAUgM,SAAW,SAAmBzM,EAAM4T,GAI/C,IAAItQ,EACJ,GAHAsQ,EAAoB,EAAVA,GAAe,EAGZ,MAJb5T,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCsD,EAAM,GAGN,IAFA,IAAI2O,EAAM,EACNsB,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,EAAIxR,KAAKkQ,MAAM7E,GACf0G,GAA+B,UAArBP,GAAKC,EAAOsB,IAAmB9G,SAAS,IAGpDnJ,EADY,IADdiQ,EAASvB,IAAO,GAAKC,EAAQ,WACVpG,IAAMrL,KAAKsB,OAAS,EAC/BiR,EAAM,EAAIR,EAAKzQ,QAAUyQ,EAAOjP,EAEhCiP,EAAOjP,GAEf2O,GAAO,IACI,KACTA,GAAO,GACPpG,KAMJ,IAHc,IAAV0H,IACFjQ,EAAMiQ,EAAM9G,SAAS,IAAMnJ,GAEtBA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGT,GAAItD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI6T,EAAYb,EAAWhT,GAEvB8T,EAAYb,EAAWjT,GAC3BsD,EAAM,GACN,IAAI0N,EAAIxQ,KAAK2E,QAEb,IADA6L,EAAEP,SAAW,GACLO,EAAE+C,UAAU,CAClB,IAAI5C,EAAIH,EAAEgD,KAAKF,GAAWrH,SAASzM,GAMjCsD,GALF0N,EAAIA,EAAEiD,MAAMH,IAELC,SAGC5C,EAAI7N,EAFJyP,EAAMc,EAAY1C,EAAErP,QAAUqP,EAAI7N,EAQ5C,IAHI9C,KAAKuT,WACPzQ,EAAM,IAAMA,GAEPA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGTM,GAAO,EAAO,oCAGhByM,EAAG5P,UAAUyT,SAAW,WACtB,IAAIC,EAAM3T,KAAKkQ,MAAM,GASrB,OARoB,IAAhBlQ,KAAKsB,OACPqS,GAAuB,SAAhB3T,KAAKkQ,MAAM,GACO,IAAhBlQ,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,GAEzCyD,GAAO,iBAAoC,SAAhB3T,KAAKkQ,MAAM,GAC7BlQ,KAAKsB,OAAS,GACvB8B,GAAO,EAAO,8CAEU,IAAlBpD,KAAKiQ,UAAmB0D,EAAMA,GAGxC9D,EAAG5P,UAAU2T,OAAS,WACpB,OAAO5T,KAAKiM,SAAS,KAGvB4D,EAAG5P,UAAU4T,SAAW,SAAmB9D,EAAQzO,GAEjD,OADA8B,OAAyB,IAAXlC,GACPlB,KAAK8T,YAAY5S,EAAQ6O,EAAQzO,IAG1CuO,EAAG5P,UAAUiP,QAAU,SAAkBa,EAAQzO,GAC/C,OAAOtB,KAAK8T,YAAYpS,MAAOqO,EAAQzO,IAGzCuO,EAAG5P,UAAU6T,YAAc,SAAsBC,EAAWhE,EAAQzO,GAClE,IAAIS,EAAa/B,KAAK+B,aAClBiS,EAAY1S,GAAUwP,KAAKC,IAAI,EAAGhP,GACtCqB,EAAOrB,GAAciS,EAAW,yCAChC5Q,EAAO4Q,EAAY,EAAG,+BAEtBhU,KAAK0R,QACL,IAGImB,EAAGxH,EAHH4I,EAA0B,OAAXlE,EACfvN,EAAM,IAAIuR,EAAUC,GAGpBE,EAAIlU,KAAK2E,QACb,GAAKsP,EAYE,CACL,IAAK5I,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAI6I,GAAKwH,EAGX,KAAOxH,EAAI2I,EAAW3I,IACpB7I,EAAI6I,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI2I,EAAYjS,EAAYsJ,IACtC7I,EAAI6I,GAAK,EAGX,IAAKA,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAIwR,EAAY3I,EAAI,GAAKwH,EAe7B,OAAOrQ,GAGLsO,KAAKuD,MACPxE,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,OAAO,GAAKV,KAAKuD,MAAM7C,IAGzB3B,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,IAAI+C,EAAI/C,EACJb,EAAI,EAiBR,OAhBI4D,GAAK,OACP5D,GAAK,GACL4D,KAAO,IAELA,GAAK,KACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAEF5D,EAAI4D,GAIf1E,EAAG5P,UAAUuU,UAAY,SAAoBhD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAI+C,EAAI/C,EACJb,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ4D,KACH5D,GAAK,GACL4D,KAAO,IAEU,IAAV,IAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,GAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,IACH5D,IAEKA,GAITd,EAAG5P,UAAUwU,UAAY,WACvB,IAAIjD,EAAIxR,KAAKkQ,MAAMlQ,KAAKsB,OAAS,GAC7BoT,EAAK1U,KAAKsU,WAAW9C,GACzB,OAA2B,IAAnBxR,KAAKsB,OAAS,GAAUoT,GAiBlC7E,EAAG5P,UAAU0U,SAAW,WACtB,GAAI3U,KAAKuT,SAAU,OAAO,EAG1B,IADA,IAAI5C,EAAI,EACCtF,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAIwH,EAAI7S,KAAKwU,UAAUxU,KAAKkQ,MAAM7E,IAElC,GADAsF,GAAKkC,EACK,KAANA,EAAU,MAEhB,OAAOlC,GAGTd,EAAG5P,UAAU8B,WAAa,WACxB,OAAO+O,KAAKS,KAAKvR,KAAKyU,YAAc,IAGtC5E,EAAG5P,UAAU2U,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7U,KAAKiQ,SACAjQ,KAAK8U,MAAMC,MAAMF,GAAOG,MAAM,GAEhChV,KAAK2E,SAGdkL,EAAG5P,UAAUgV,SAAW,SAAmBJ,GACzC,OAAI7U,KAAKkV,MAAML,EAAQ,GACd7U,KAAKmV,KAAKN,GAAOG,MAAM,GAAGI,OAE5BpV,KAAK2E,SAGdkL,EAAG5P,UAAUoV,MAAQ,WACnB,OAAyB,IAAlBrV,KAAKiQ,UAIdJ,EAAG5P,UAAUqV,IAAM,WACjB,OAAOtV,KAAK2E,QAAQyQ,QAGtBvF,EAAG5P,UAAUmV,KAAO,WAKlB,OAJKpV,KAAKuT,WACRvT,KAAKiQ,UAAY,GAGZjQ,MAIT6P,EAAG5P,UAAUsV,KAAO,SAAe3P,GACjC,KAAO5F,KAAKsB,OAASsE,EAAItE,QACvBtB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAG9B,IAAK,IAAI+J,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAC9BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAG5C,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUuV,IAAM,SAAc5P,GAE/B,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAKuV,KAAK3P,IAInBiK,EAAG5P,UAAUwV,GAAK,SAAa7P,GAC7B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6Q,IAAI5P,GAC/CA,EAAIjB,QAAQ6Q,IAAIxV,OAGzB6P,EAAG5P,UAAUyV,IAAM,SAAc9P,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ4Q,KAAK3P,GAChDA,EAAIjB,QAAQ4Q,KAAKvV,OAI1B6P,EAAG5P,UAAU0V,MAAQ,SAAgB/P,GAEnC,IAAIiN,EAEFA,EADE7S,KAAKsB,OAASsE,EAAItE,OAChBsE,EAEA5F,KAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAK5C,OAFArL,KAAKsB,OAASuR,EAAEvR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU2V,KAAO,SAAehQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK2V,MAAM/P,IAIpBiK,EAAG5P,UAAU4V,IAAM,SAAcjQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQiR,KAAKhQ,GAChDA,EAAIjB,QAAQiR,KAAK5V,OAG1B6P,EAAG5P,UAAU6V,KAAO,SAAelQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQgR,MAAM/P,GACjDA,EAAIjB,QAAQgR,MAAM3V,OAI3B6P,EAAG5P,UAAU8V,MAAQ,SAAgBnQ,GAEnC,IAAIgN,EACAC,EACA7S,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAAKwH,EAAE3C,MAAM7E,GAGvC,GAAIrL,OAAS4S,EACX,KAAOvH,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAM5B,OAFArL,KAAKsB,OAASsR,EAAEtR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU+V,KAAO,SAAepQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK+V,MAAMnQ,IAIpBiK,EAAG5P,UAAUgW,IAAM,SAAcrQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQqR,KAAKpQ,GAChDA,EAAIjB,QAAQqR,KAAKhW,OAG1B6P,EAAG5P,UAAUiW,KAAO,SAAetQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQoR,MAAMnQ,GACjDA,EAAIjB,QAAQoR,MAAM/V,OAI3B6P,EAAG5P,UAAU8U,MAAQ,SAAgBF,GACnCzR,EAAwB,iBAAVyR,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBrF,KAAKS,KAAKsD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7U,KAAKoS,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAa9K,IAC/BrL,KAAKkQ,MAAM7E,GAAsB,UAAhBrL,KAAKkQ,MAAM7E,GAS9B,OALI+K,EAAW,IACbpW,KAAKkQ,MAAM7E,IAAMrL,KAAKkQ,MAAM7E,GAAM,UAAc,GAAK+K,GAIhDpW,KAAK0R,SAGd7B,EAAG5P,UAAUkV,KAAO,SAAeN,GACjC,OAAO7U,KAAK2E,QAAQoQ,MAAMF,IAI5BhF,EAAG5P,UAAUoW,KAAO,SAAeC,EAAK3Q,GACtCvC,EAAsB,iBAARkT,GAAoBA,GAAO,GAEzC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtW,KAAKoS,QAAQX,EAAM,GAGjBzR,KAAKkQ,MAAMuB,GADT9L,EACgB3F,KAAKkQ,MAAMuB,GAAQ,GAAK8E,EAExBvW,KAAKkQ,MAAMuB,KAAS,GAAK8E,GAGtCvW,KAAK0R,SAId7B,EAAG5P,UAAUuW,KAAO,SAAe5Q,GACjC,IAAI+K,EAkBAiC,EAAGC,EAfP,GAAsB,IAAlB7S,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAI7B,OAHAjQ,KAAKiQ,SAAW,EAChBU,EAAI3Q,KAAKyW,KAAK7Q,GACd5F,KAAKiQ,UAAY,EACVjQ,KAAKqS,YAGP,GAAsB,IAAlBrS,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAIpC,OAHArK,EAAIqK,SAAW,EACfU,EAAI3Q,KAAKyW,KAAK7Q,GACdA,EAAIqK,SAAW,EACRU,EAAE0B,YAKPrS,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,EAC1C/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAEhB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAClCsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,EACvB/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAIhB,GADA3Q,KAAKsB,OAASsR,EAAEtR,OACF,IAAVyR,EACF/S,KAAKkQ,MAAMlQ,KAAKsB,QAAUyR,EAC1B/S,KAAKsB,cAEA,GAAIsR,IAAM5S,KACf,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAI5B,OAAOrL,MAIT6P,EAAG5P,UAAUyW,IAAM,SAAc9Q,GAC/B,IAAIpD,EACJ,OAAqB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UAC7BrK,EAAIqK,SAAW,EACfzN,EAAMxC,KAAK2W,IAAI/Q,GACfA,EAAIqK,UAAY,EACTzN,GACmB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UACpCjQ,KAAKiQ,SAAW,EAChBzN,EAAMoD,EAAI+Q,IAAI3W,MACdA,KAAKiQ,SAAW,EACTzN,GAGLxC,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6R,KAAK5Q,GAEhDA,EAAIjB,QAAQ6R,KAAKxW,OAI1B6P,EAAG5P,UAAUwW,KAAO,SAAe7Q,GAEjC,GAAqB,IAAjBA,EAAIqK,SAAgB,CACtBrK,EAAIqK,SAAW,EACf,IAAIU,EAAI3Q,KAAKwW,KAAK5Q,GAElB,OADAA,EAAIqK,SAAW,EACRU,EAAE0B,YAGJ,GAAsB,IAAlBrS,KAAKiQ,SAId,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKwW,KAAK5Q,GACV5F,KAAKiQ,SAAW,EACTjQ,KAAKqS,YAId,IAWIO,EAAGC,EAXH3B,EAAMlR,KAAKkR,IAAItL,GAGnB,GAAY,IAARsL,EAIF,OAHAlR,KAAKiQ,SAAW,EAChBjQ,KAAKsB,OAAS,EACdtB,KAAKkQ,MAAM,GAAK,EACTlQ,KAKLkR,EAAM,GACR0B,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAE5B0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,IAC7B,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAElB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAElC0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,IACV,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAIlB,GAAc,IAAVoC,GAAe1H,EAAIuH,EAAEtR,QAAUsR,IAAM5S,KACvC,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAU5B,OANArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,GAEhCuH,IAAM5S,OACRA,KAAKiQ,SAAW,GAGXjQ,KAAK0R,SAId7B,EAAG5P,UAAU0W,IAAM,SAAc/Q,GAC/B,OAAO5F,KAAK2E,QAAQ8R,KAAK7Q,IA+C3B,IAAIgR,EAAc,SAAsBjE,EAAM/M,EAAK9C,GACjD,IAIIgQ,EACA+D,EACAnC,EANA9B,EAAID,EAAKzC,MACT2C,EAAIjN,EAAIsK,MACR4G,EAAIhU,EAAIoN,MACRM,EAAI,EAIJuG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnG,EAAE,GACPoG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtG,EAAE,GACPuG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzG,EAAE,GACP0G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5G,EAAE,GACP6G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP/G,EAAE,GACPgH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlH,EAAE,GACPmH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrH,EAAE,GACPsH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxH,EAAE,GACPyH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3H,EAAE,GACP4H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB1X,EAAImN,SAAW0C,EAAK1C,SAAWrK,EAAIqK,SACnCnN,EAAIxB,OAAS,GAMb,IAAIqZ,IAAQnK,GAJZsC,EAAKhC,KAAK8J,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM/F,KAAK8J,KAAK5D,EAAK+B,IACRjI,KAAK8J,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDtI,IAFAkE,EAAK5D,KAAK8J,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKhC,KAAK8J,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKzD,EAAK4B,IACRjI,KAAK8J,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQrK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKkC,GAAQ,GACvBpI,KAAK8J,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDzI,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKhC,KAAK8J,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKtD,EAAKyB,IACRjI,KAAK8J,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKrD,EAAKwB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK+B,GAAQ,GACvBpI,KAAK8J,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQtK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKqC,GAAQ,GACvBvI,KAAK8J,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD5I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKhC,KAAK8J,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKnD,EAAKsB,IACRjI,KAAK8J,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKlD,EAAKqB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK4B,GAAQ,GACvBpI,KAAK8J,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKkC,GAAQ,GACvBvI,KAAK8J,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQvK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKwC,GAAQ,GACvB1I,KAAK8J,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD/I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKhC,KAAK8J,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKhD,EAAKmB,IACRjI,KAAK8J,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK/C,EAAKkB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKyB,GAAQ,GACvBpI,KAAK8J,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK+B,GAAQ,GACvBvI,KAAK8J,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKqC,GAAQ,GACvB1I,KAAK8J,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQxK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK2C,IAAQ,GACvB7I,KAAK8J,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDlJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKhC,KAAK8J,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK7C,EAAKgB,IACRjI,KAAK8J,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK5C,EAAKe,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKsB,GAAQ,GACvBpI,KAAK8J,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK4B,GAAQ,GACvBvI,KAAK8J,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKkC,GAAQ,GACvB1I,KAAK8J,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKiC,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKwC,IAAQ,GACvB7I,KAAK8J,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQzK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK8C,IAAQ,GACvBhJ,KAAK8J,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDrJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKhC,KAAK8J,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK1C,EAAKa,IACRjI,KAAK8J,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKzC,EAAKY,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKmB,GAAQ,GACvBpI,KAAK8J,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKyB,GAAQ,GACvBvI,KAAK8J,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK+B,GAAQ,GACvB1I,KAAK8J,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK8B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKqC,IAAQ,GACvB7I,KAAK8J,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK2C,IAAQ,GACvBhJ,KAAK8J,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ1K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKiD,IAAQ,GACvBnJ,KAAK8J,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDxJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKhC,KAAK8J,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKvC,EAAKU,IACRjI,KAAK8J,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKtC,EAAKS,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKgB,GAAQ,GACvBpI,KAAK8J,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKsB,GAAQ,GACvBvI,KAAK8J,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK4B,GAAQ,GACvB1I,KAAK8J,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK2B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKkC,IAAQ,GACvB7I,KAAK8J,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKwC,IAAQ,GACvBhJ,KAAK8J,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK8C,IAAQ,GACvBnJ,KAAK8J,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ3K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKoD,IAAQ,GACvBtJ,KAAK8J,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD3J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKhC,KAAK8J,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKpC,EAAKO,IACRjI,KAAK8J,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKnC,EAAKM,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKa,GAAQ,GACvBpI,KAAK8J,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKmB,GAAQ,GACvBvI,KAAK8J,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKyB,GAAQ,GACvB1I,KAAK8J,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKwB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK+B,IAAQ,GACvB7I,KAAK8J,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKqC,IAAQ,GACvBhJ,KAAK8J,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKoC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK2C,IAAQ,GACvBnJ,KAAK8J,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKiD,IAAQ,GACvBtJ,KAAK8J,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ5K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKuD,IAAQ,GACvBzJ,KAAK8J,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD9J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKhC,KAAK8J,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKI,IACRjI,KAAK8J,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKhC,EAAKG,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKU,GAAQ,GACvBpI,KAAK8J,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKS,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKgB,GAAQ,GACvBvI,KAAK8J,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKsB,GAAQ,GACvB1I,KAAK8J,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKqB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK4B,IAAQ,GACvB7I,KAAK8J,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKkC,IAAQ,GACvBhJ,KAAK8J,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKwC,IAAQ,GACvBnJ,KAAK8J,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK8C,IAAQ,GACvBtJ,KAAK8J,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK6C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKoD,IAAQ,GACvBzJ,KAAK8J,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQ7K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK0D,IAAQ,GACvB5J,KAAK8J,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKhC,KAAK8J,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKO,IACRpI,KAAK8J,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK5D,KAAK8J,KAAKhC,EAAKM,GACpBpG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKa,GAAQ,GACvBvI,KAAK8J,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKY,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKmB,GAAQ,GACvB1I,KAAK8J,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKkB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKyB,IAAQ,GACvB7I,KAAK8J,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK+B,IAAQ,GACvBhJ,KAAK8J,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK8B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKqC,IAAQ,GACvBnJ,KAAK8J,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK2C,IAAQ,GACvBtJ,KAAK8J,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK0C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKiD,IAAQ,GACvBzJ,KAAK8J,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS9K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKuD,IAAQ,GACvB5J,KAAK8J,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKhC,KAAK8J,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKU,IACRvI,KAAK8J,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK5D,KAAK8J,KAAKhC,EAAKS,GACpBvG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKgB,GAAQ,GACvB1I,KAAK8J,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKe,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKsB,IAAQ,GACvB7I,KAAK8J,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK4B,IAAQ,GACvBhJ,KAAK8J,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKkC,IAAQ,GACvBnJ,KAAK8J,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKwC,IAAQ,GACvBtJ,KAAK8J,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKuC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK8C,IAAQ,GACvBzJ,KAAK8J,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS/K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKoD,IAAQ,GACvB5J,KAAK8J,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKhC,KAAK8J,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKa,IACR1I,KAAK8J,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK5D,KAAK8J,KAAKhC,EAAKY,GACpB1G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKmB,IAAQ,GACvB7I,KAAK8J,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKkB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKyB,IAAQ,GACvBhJ,KAAK8J,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK+B,IAAQ,GACvBnJ,KAAK8J,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKqC,IAAQ,GACvBtJ,KAAK8J,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKoC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK2C,IAAQ,GACvBzJ,KAAK8J,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAShL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKiD,IAAQ,GACvB5J,KAAK8J,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKhC,KAAK8J,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKgB,KACR7I,KAAK8J,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK5D,KAAK8J,KAAKhC,EAAKe,IACpB7G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKsB,IAAQ,GACvBhJ,KAAK8J,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKqB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK4B,IAAQ,GACvBnJ,KAAK8J,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKkC,IAAQ,GACvBtJ,KAAK8J,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKiC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKwC,IAAQ,GACvBzJ,KAAK8J,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASjL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK8C,IAAQ,GACvB5J,KAAK8J,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKhC,KAAK8J,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKmB,KACRhJ,KAAK8J,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK5D,KAAK8J,KAAKhC,EAAKkB,IACpBhH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKyB,IAAQ,GACvBnJ,KAAK8J,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKwB,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK+B,IAAQ,GACvBtJ,KAAK8J,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK8B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKqC,IAAQ,GACvBzJ,KAAK8J,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASlL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK2C,IAAQ,GACvB5J,KAAK8J,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKhC,KAAK8J,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKsB,KACRnJ,KAAK8J,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK5D,KAAK8J,KAAKhC,EAAKqB,IACpBnH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK4B,IAAQ,GACvBtJ,KAAK8J,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK2B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKkC,IAAQ,GACvBzJ,KAAK8J,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASnL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKwC,IAAQ,GACvB5J,KAAK8J,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKhC,KAAK8J,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKyB,KACRtJ,KAAK8J,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK5D,KAAK8J,KAAKhC,EAAKwB,IACpBtH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK+B,IAAQ,GACvBzJ,KAAK8J,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASpL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKqC,IAAQ,GACvB5J,KAAK8J,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKhC,KAAK8J,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK4B,KACRzJ,KAAK8J,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK5D,KAAK8J,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASrL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKkC,IAAQ,GACvB5J,KAAK8J,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAStL,GAJbsC,EAAKhC,KAAK8J,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK+B,KACR5J,KAAK8J,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAjK,IAFAkE,EAAK5D,KAAK8J,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANtL,IACFsG,EAAE,IAAMtG,EACR1N,EAAIxB,UAECwB,GAiDT,SAASiZ,EAAYpJ,EAAM/M,EAAK9C,GAE9B,OADW,IAAIkZ,GACHC,KAAKtJ,EAAM/M,EAAK9C,GAsB9B,SAASkZ,EAAME,EAAGC,GAChBnc,KAAKkc,EAAIA,EACTlc,KAAKmc,EAAIA,EAvENrL,KAAK8J,OACRhE,EAAclE,GAiDhB7C,EAAG5P,UAAUmc,MAAQ,SAAgBxW,EAAK9C,GACxC,IAAIN,EACA4I,EAAMpL,KAAKsB,OAASsE,EAAItE,OAW5B,OATEkB,EADkB,KAAhBxC,KAAKsB,QAAgC,KAAfsE,EAAItE,OACtBsV,EAAY5W,KAAM4F,EAAK9C,GACpBsI,EAAM,GACTsH,EAAW1S,KAAM4F,EAAK9C,GACnBsI,EAAM,KArDnB,SAAmBuH,EAAM/M,EAAK9C,GAC5BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnCnN,EAAIxB,OAASqR,EAAKrR,OAASsE,EAAItE,OAI/B,IAFA,IAAIyR,EAAQ,EACRsJ,EAAU,EACLrJ,EAAI,EAAGA,EAAIlQ,EAAIxB,OAAS,EAAG0R,IAAK,CAGvC,IAAIC,EAASoJ,EACbA,EAAU,EAGV,IAFA,IAAInJ,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAI2H,EAAI1H,EAGRqF,GAFoB,EAAhBgC,EAAKzC,MAAM7E,KACI,EAAfzF,EAAIsK,MAAM5E,IAGdwH,EAAS,SAAJnC,EAGTuC,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBmJ,IAFApJ,GAHAA,EAAUA,GAAWtC,EAAI,SAAa,GAAM,IAGxBmC,IAAO,IAAO,KAEZ,GACtBG,GAAU,SAEZnQ,EAAIoN,MAAM8C,GAAKE,EACfH,EAAQE,EACRA,EAASoJ,EAQX,OANc,IAAVtJ,EACFjQ,EAAIoN,MAAM8C,GAAKD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAgBH4K,CAAStc,KAAM4F,EAAK9C,GAEpBiZ,EAAW/b,KAAM4F,EAAK9C,GAGvBN,GAWTwZ,EAAK/b,UAAUsc,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAI7S,MAAM8a,GACdC,EAAI5M,EAAG5P,UAAUqU,WAAWkI,GAAK,EAC5BnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBkJ,EAAElJ,GAAKrL,KAAK0c,OAAOrR,EAAGoR,EAAGD,GAG3B,OAAOjI,GAITyH,EAAK/b,UAAUyc,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAtR,EAAI,EAAGA,EAAIoR,EAAGpR,IACrBsR,IAAW,EAAJT,IAAWO,EAAIpR,EAAI,EAC1B6Q,IAAM,EAGR,OAAOS,GAKTX,EAAK/b,UAAU2c,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAGnR,IACrB2R,EAAK3R,GAAKyR,EAAID,EAAIxR,IAClB4R,EAAK5R,GAAK0R,EAAIF,EAAIxR,KAItB2Q,EAAK/b,UAAUid,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE7c,KAAK4c,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQtM,KAAKuM,IAAI,EAAIvM,KAAKwM,GAAKb,GAC/Bc,EAAQzM,KAAK0M,IAAI,EAAI1M,KAAKwM,GAAKb,GAE1BjN,EAAI,EAAGA,EAAIgN,EAAGhN,GAAKiN,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJjS,EAAI,EAAGA,EAAI6R,EAAG7R,IAAK,CAC1B,IAAImC,EAAKuP,EAAKxN,EAAIlE,GACdqS,EAAKV,EAAKzN,EAAIlE,GAEdsS,EAAKZ,EAAKxN,EAAIlE,EAAI6R,GAClBU,EAAKZ,EAAKzN,EAAIlE,EAAI6R,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAKxN,EAAIlE,GAAKmC,EAAKmQ,EACnBX,EAAKzN,EAAIlE,GAAKqS,EAAKE,EAEnBb,EAAKxN,EAAIlE,EAAI6R,GAAK1P,EAAKmQ,EACvBX,EAAKzN,EAAIlE,EAAI6R,GAAKQ,EAAKE,EAGnBvS,IAAMmR,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB9B,EAAK/b,UAAU8d,YAAc,SAAsBC,EAAGjf,GACpD,IAAIyd,EAAqB,EAAjB1L,KAAKC,IAAIhS,EAAGif,GAChBC,EAAU,EAAJzB,EACNnR,EAAI,EACR,IAAKmR,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BnR,IAGF,OAAO,GAAKA,EAAI,EAAI4S,GAGtBjC,EAAK/b,UAAUie,UAAY,SAAoBpB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAIkJ,EAAIuI,EAAIzR,GAEZyR,EAAIzR,GAAKyR,EAAIN,EAAInR,EAAI,GACrByR,EAAIN,EAAInR,EAAI,GAAKkJ,EAEjBA,EAAIwI,EAAI1R,GAER0R,EAAI1R,IAAM0R,EAAIP,EAAInR,EAAI,GACtB0R,EAAIP,EAAInR,EAAI,IAAMkJ,IAItByH,EAAK/b,UAAUke,aAAe,SAAuBC,EAAI5B,GAEvD,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAImG,EAAoC,KAAhCV,KAAKuN,MAAMD,EAAG,EAAI/S,EAAI,GAAKmR,GACjC1L,KAAKuN,MAAMD,EAAG,EAAI/S,GAAKmR,GACvBzJ,EAEFqL,EAAG/S,GAAS,SAAJmG,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO4M,GAGTpC,EAAK/b,UAAUqe,WAAa,SAAqBF,EAAIhT,EAAK0R,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAID,EAAKC,IACvB0H,GAAyB,EAARqL,EAAG/S,GAEpByR,EAAI,EAAIzR,GAAa,KAAR0H,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAIzR,EAAI,GAAa,KAAR0H,EAAgBA,KAAkB,GAIrD,IAAK1H,EAAI,EAAID,EAAKC,EAAImR,IAAKnR,EACzByR,EAAIzR,GAAK,EAGXjI,EAAiB,IAAV2P,GACP3P,EAA6B,KAAb,KAAR2P,KAGViJ,EAAK/b,UAAUse,KAAO,SAAe/B,GAEnC,IADA,IAAIgC,EAAK,IAAI9c,MAAM8a,GACVnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBmT,EAAGnT,GAAK,EAGV,OAAOmT,GAGTxC,EAAK/b,UAAUgc,KAAO,SAAeC,EAAGC,EAAGrZ,GACzC,IAAI0Z,EAAI,EAAIxc,KAAK+d,YAAY7B,EAAE5a,OAAQ6a,EAAE7a,QAErCub,EAAM7c,KAAKuc,QAAQC,GAEnBiC,EAAIze,KAAKue,KAAK/B,GAEdM,EAAM,IAAIpb,MAAM8a,GAChBkC,EAAO,IAAIhd,MAAM8a,GACjBmC,EAAO,IAAIjd,MAAM8a,GAEjBoC,EAAO,IAAIld,MAAM8a,GACjBqC,EAAQ,IAAInd,MAAM8a,GAClBsC,EAAQ,IAAIpd,MAAM8a,GAElBuC,EAAOjc,EAAIoN,MACf6O,EAAKzd,OAASkb,EAEdxc,KAAKse,WAAWpC,EAAEhM,MAAOgM,EAAE5a,OAAQwb,EAAKN,GACxCxc,KAAKse,WAAWnC,EAAEjM,MAAOiM,EAAE7a,OAAQsd,EAAMpC,GAEzCxc,KAAKkd,UAAUJ,EAAK2B,EAAGC,EAAMC,EAAMnC,EAAGK,GACtC7c,KAAKkd,UAAU0B,EAAMH,EAAGI,EAAOC,EAAOtC,EAAGK,GAEzC,IAAK,IAAIxR,EAAI,EAAGA,EAAImR,EAAGnR,IAAK,CAC1B,IAAIyS,EAAKY,EAAKrT,GAAKwT,EAAMxT,GAAKsT,EAAKtT,GAAKyT,EAAMzT,GAC9CsT,EAAKtT,GAAKqT,EAAKrT,GAAKyT,EAAMzT,GAAKsT,EAAKtT,GAAKwT,EAAMxT,GAC/CqT,EAAKrT,GAAKyS,EAUZ,OAPA9d,KAAKke,UAAUQ,EAAMC,EAAMnC,GAC3Bxc,KAAKkd,UAAUwB,EAAMC,EAAMI,EAAMN,EAAGjC,EAAGK,GACvC7c,KAAKke,UAAUa,EAAMN,EAAGjC,GACxBxc,KAAKme,aAAaY,EAAMvC,GAExB1Z,EAAImN,SAAWiM,EAAEjM,SAAWkM,EAAElM,SAC9BnN,EAAIxB,OAAS4a,EAAE5a,OAAS6a,EAAE7a,OACnBwB,EAAI4O,SAIb7B,EAAG5P,UAAU4Q,IAAM,SAAcjL,GAC/B,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCtB,KAAKoc,MAAMxW,EAAK9C,IAIzB+M,EAAG5P,UAAU+e,KAAO,SAAepZ,GACjC,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCya,EAAW/b,KAAM4F,EAAK9C,IAI/B+M,EAAG5P,UAAU2a,KAAO,SAAehV,GACjC,OAAO5F,KAAK2E,QAAQyX,MAAMxW,EAAK5F,OAGjC6P,EAAG5P,UAAU+R,MAAQ,SAAgBpM,GACnCxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UAIb,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAUzF,EAC1BkN,GAAU,SAAJtB,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASD,IAAO,GAChB9S,KAAKkQ,MAAM7E,GAAU,SAALyH,EAQlB,OALc,IAAVC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAGAtB,MAGT6P,EAAG5P,UAAUgf,KAAO,SAAerZ,GACjC,OAAO5F,KAAK2E,QAAQqN,MAAMpM,IAI5BiK,EAAG5P,UAAUif,IAAM,WACjB,OAAOlf,KAAK6Q,IAAI7Q,OAIlB6P,EAAG5P,UAAUkf,KAAO,WAClB,OAAOnf,KAAK4a,KAAK5a,KAAK2E,UAIxBkL,EAAG5P,UAAUiS,IAAM,SAActM,GAC/B,IAAI4L,EAxxCN,SAAqB5L,GAGnB,IAFA,IAAI4L,EAAI,IAAI9P,MAAMkE,EAAI6O,aAEb6B,EAAM,EAAGA,EAAM9E,EAAElQ,OAAQgV,IAAO,CACvC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB9E,EAAE8E,IAAQ1Q,EAAIsK,MAAMuB,GAAQ,GAAK8E,KAAWA,EAG9C,OAAO/E,EA8wCC4N,CAAWxZ,GACnB,GAAiB,IAAb4L,EAAElQ,OAAc,OAAO,IAAIuO,EAAG,GAIlC,IADA,IAAIrN,EAAMxC,KACDqL,EAAI,EAAGA,EAAImG,EAAElQ,QACP,IAATkQ,EAAEnG,GADsBA,IAAK7I,EAAMA,EAAI0c,OAI7C,KAAM7T,EAAImG,EAAElQ,OACV,IAAK,IAAI4S,EAAI1R,EAAI0c,MAAO7T,EAAImG,EAAElQ,OAAQ+J,IAAK6I,EAAIA,EAAEgL,MAClC,IAAT1N,EAAEnG,KAEN7I,EAAMA,EAAIqO,IAAIqD,IAIlB,OAAO1R,GAITqN,EAAG5P,UAAUof,OAAS,SAAiBC,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAGIjU,EAHAsF,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GACjB4O,EAAa,WAAe,GAAK5O,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoC,EAAQ,EAEZ,IAAK1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAChC,IAAImU,EAAWxf,KAAKkQ,MAAM7E,GAAKkU,EAC3B/O,GAAsB,EAAhBxQ,KAAKkQ,MAAM7E,IAAUmU,GAAa7O,EAC5C3Q,KAAKkQ,MAAM7E,GAAKmF,EAAIuC,EACpBA,EAAQyM,IAAc,GAAK7O,EAGzBoC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAIT,GAAU,IAAN6b,EAAS,CACX,IAAK9R,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAChCrL,KAAKkQ,MAAM7E,EAAI8R,GAAKnd,KAAKkQ,MAAM7E,GAGjC,IAAKA,EAAI,EAAGA,EAAI8R,EAAG9R,IACjBrL,KAAKkQ,MAAM7E,GAAK,EAGlBrL,KAAKsB,QAAU6b,EAGjB,OAAOnd,KAAK0R,SAGd7B,EAAG5P,UAAUwf,MAAQ,SAAgBH,GAGnC,OADAlc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKqf,OAAOC,IAMrBzP,EAAG5P,UAAUmU,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJxc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/O,EAAI2O,EAAO,GACXnC,EAAIrM,KAAK/D,KAAKuS,EAAO3O,GAAK,GAAI3Q,KAAKsB,QACnCue,EAAO,SAAc,WAAclP,GAAMA,EACzCmP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAI9O,KAAKC,IAAI,EAAG6O,GAGZE,EAAa,CACf,IAAK,IAAIzU,EAAI,EAAGA,EAAI8R,EAAG9R,IACrByU,EAAY5P,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAEpCyU,EAAYxe,OAAS6b,EAGvB,GAAU,IAANA,QAEG,GAAInd,KAAKsB,OAAS6b,EAEvB,IADAnd,KAAKsB,QAAU6b,EACV9R,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC3BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,EAAI8R,QAGjCnd,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,EAGhB,IAAIyR,EAAQ,EACZ,IAAK1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,IAAgB,IAAV0H,GAAe1H,GAAKuU,GAAIvU,IAAK,CAChE,IAAI0G,EAAuB,EAAhB/R,KAAKkQ,MAAM7E,GACtBrL,KAAKkQ,MAAM7E,GAAM0H,GAAU,GAAKpC,EAAOoB,IAASpB,EAChDoC,EAAQhB,EAAO8N,EAajB,OATIC,GAAyB,IAAV/M,IACjB+M,EAAY5P,MAAM4P,EAAYxe,UAAYyR,GAGxB,IAAhB/S,KAAKsB,SACPtB,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,GAGTtB,KAAK0R,SAGd7B,EAAG5P,UAAU8f,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAvc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKoU,OAAOkL,EAAMI,EAAMC,IAIjC9P,EAAG5P,UAAU+f,KAAO,SAAeV,GACjC,OAAOtf,KAAK2E,QAAQ8a,MAAMH,IAG5BzP,EAAG5P,UAAUggB,MAAQ,SAAgBX,GACnC,OAAOtf,KAAK2E,QAAQ0a,OAAOC,IAI7BzP,EAAG5P,UAAUigB,KAAO,SAAeZ,GACjC,OAAOtf,KAAK2E,QAAQob,MAAMT,IAG5BzP,EAAG5P,UAAUkgB,MAAQ,SAAgBb,GACnC,OAAOtf,KAAK2E,QAAQyP,OAAOkL,IAI7BzP,EAAG5P,UAAUiV,MAAQ,SAAgBoB,GACnClT,EAAsB,iBAARkT,GAAoBA,GAAO,GACzC,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,QAAI3Q,KAAKsB,QAAU6b,KAGXnd,KAAKkQ,MAAMiN,GAELjJ,KAIhBrE,EAAG5P,UAAUmgB,OAAS,SAAiBd,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAAI3O,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GAIrB,GAFAvN,EAAyB,IAAlBpD,KAAKiQ,SAAgB,2CAExBjQ,KAAKsB,QAAU6b,EACjB,OAAOnd,KAQT,GALU,IAAN2Q,GACFwM,IAEFnd,KAAKsB,OAASwP,KAAK/D,IAAIoQ,EAAGnd,KAAKsB,QAErB,IAANqP,EAAS,CACX,IAAIkP,EAAO,SAAc,WAAclP,GAAMA,EAC7C3Q,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IAAMue,EAGjC,OAAO7f,KAAK0R,SAId7B,EAAG5P,UAAUogB,MAAQ,SAAgBf,GACnC,OAAOtf,KAAK2E,QAAQyb,OAAOd,IAI7BzP,EAAG5P,UAAU+U,MAAQ,SAAgBpP,GAGnC,OAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAU5F,KAAKsgB,OAAO1a,GAGV,IAAlB5F,KAAKiQ,SACa,IAAhBjQ,KAAKsB,SAAiC,EAAhBtB,KAAKkQ,MAAM,IAAUtK,GAC7C5F,KAAKkQ,MAAM,GAAKtK,GAAuB,EAAhB5F,KAAKkQ,MAAM,IAClClQ,KAAKiQ,SAAW,EACTjQ,OAGTA,KAAKiQ,SAAW,EAChBjQ,KAAKsgB,MAAM1a,GACX5F,KAAKiQ,SAAW,EACTjQ,MAIFA,KAAKiS,OAAOrM,IAGrBiK,EAAG5P,UAAUgS,OAAS,SAAiBrM,GACrC5F,KAAKkQ,MAAM,IAAMtK,EAGjB,IAAK,IAAIyF,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,IAAM,SAAWA,IAC7DrL,KAAKkQ,MAAM7E,IAAM,SACbA,IAAMrL,KAAKsB,OAAS,EACtBtB,KAAKkQ,MAAM7E,EAAI,GAAK,EAEpBrL,KAAKkQ,MAAM7E,EAAI,KAKnB,OAFArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,EAAI,GAEjCrL,MAIT6P,EAAG5P,UAAUqgB,MAAQ,SAAgB1a,GAGnC,GAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAG,OAAO5F,KAAKgV,OAAOpP,GAEhC,GAAsB,IAAlB5F,KAAKiQ,SAIP,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKgV,MAAMpP,GACX5F,KAAKiQ,SAAW,EACTjQ,KAKT,GAFAA,KAAKkQ,MAAM,IAAMtK,EAEG,IAAhB5F,KAAKsB,QAAgBtB,KAAKkQ,MAAM,GAAK,EACvClQ,KAAKkQ,MAAM,IAAMlQ,KAAKkQ,MAAM,GAC5BlQ,KAAKiQ,SAAW,OAGhB,IAAK,IAAI5E,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,GAAK,EAAGA,IACpDrL,KAAKkQ,MAAM7E,IAAM,SACjBrL,KAAKkQ,MAAM7E,EAAI,IAAM,EAIzB,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUsgB,KAAO,SAAe3a,GACjC,OAAO5F,KAAK2E,QAAQqQ,MAAMpP,IAG5BiK,EAAG5P,UAAUugB,KAAO,SAAe5a,GACjC,OAAO5F,KAAK2E,QAAQ2b,MAAM1a,IAG5BiK,EAAG5P,UAAUwgB,KAAO,WAGlB,OAFAzgB,KAAKiQ,SAAW,EAETjQ,MAGT6P,EAAG5P,UAAU6U,IAAM,WACjB,OAAO9U,KAAK2E,QAAQ8b,QAGtB5Q,EAAG5P,UAAUygB,aAAe,SAAuB9a,EAAKiL,EAAK8P,GAC3D,IACItV,EAIAmG,EALApG,EAAMxF,EAAItE,OAASqf,EAGvB3gB,KAAKoS,QAAQhH,GAGb,IAAI2H,EAAQ,EACZ,IAAK1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CAC/BmG,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,EAClC,IAAI9B,GAAwB,EAAfrL,EAAIsK,MAAM7E,IAAUwF,EAEjCkC,IADAvB,GAAa,SAARP,IACS,KAAQA,EAAQ,SAAa,GAC3CjR,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAE1B,KAAOnG,EAAIrL,KAAKsB,OAASqf,EAAOtV,IAE9B0H,GADAvB,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,IACrB,GACb/S,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAG1B,GAAc,IAAVuB,EAAa,OAAO/S,KAAK0R,QAK7B,IAFAtO,GAAkB,IAAX2P,GACPA,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAE3B0H,GADAvB,IAAsB,EAAhBxR,KAAKkQ,MAAM7E,IAAU0H,IACd,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJmG,EAIlB,OAFAxR,KAAKiQ,SAAW,EAETjQ,KAAK0R,SAGd7B,EAAG5P,UAAU2gB,SAAW,SAAmBhb,EAAKib,GAC9C,IAAIF,GAAQ3gB,KAAKsB,OAASsE,EAAItE,QAE1BsR,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAGJkb,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,GAGf,IADdqf,EAAQ,GADM3gB,KAAKsU,WAAWwM,MAG5BjO,EAAIA,EAAEoN,MAAMU,GACZ/N,EAAEyM,OAAOsB,GACTG,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,IAI3B,IACI4S,EADAnV,EAAI6T,EAAEtR,OAASuR,EAAEvR,OAGrB,GAAa,QAATuf,EAAgB,EAClB3M,EAAI,IAAIrE,EAAG,OACTvO,OAASvC,EAAI,EACfmV,EAAEhE,MAAQ,IAAIxO,MAAMwS,EAAE5S,QACtB,IAAK,IAAI+J,EAAI,EAAGA,EAAI6I,EAAE5S,OAAQ+J,IAC5B6I,EAAEhE,MAAM7E,GAAK,EAIjB,IAAI0V,EAAOnO,EAAEjO,QAAQ+b,aAAa7N,EAAG,EAAG9T,GAClB,IAAlBgiB,EAAK9Q,WACP2C,EAAImO,EACA7M,IACFA,EAAEhE,MAAMnR,GAAK,IAIjB,IAAK,IAAIuM,EAAIvM,EAAI,EAAGuM,GAAK,EAAGA,IAAK,CAC/B,IAAI0V,EAAmC,UAAL,EAAxBpO,EAAE1C,MAAM2C,EAAEvR,OAASgK,KACE,EAA5BsH,EAAE1C,MAAM2C,EAAEvR,OAASgK,EAAI,IAO1B,IAHA0V,EAAKlQ,KAAK/D,IAAKiU,EAAKF,EAAO,EAAG,UAE9BlO,EAAE8N,aAAa7N,EAAGmO,EAAI1V,GACA,IAAfsH,EAAE3C,UACP+Q,IACApO,EAAE3C,SAAW,EACb2C,EAAE8N,aAAa7N,EAAG,EAAGvH,GAChBsH,EAAEW,WACLX,EAAE3C,UAAY,GAGdiE,IACFA,EAAEhE,MAAM5E,GAAK0V,GAajB,OAVI9M,GACFA,EAAExC,QAEJkB,EAAElB,QAGW,QAATmP,GAA4B,IAAVF,GACpB/N,EAAEwB,OAAOuM,GAGJ,CACLM,IAAK/M,GAAK,KACVpC,IAAKc,IAQT/C,EAAG5P,UAAUihB,OAAS,SAAiBtb,EAAKib,EAAMM,GAGhD,OAFA/d,GAAQwC,EAAI2N,UAERvT,KAAKuT,SACA,CACL0N,IAAK,IAAIpR,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB7P,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAKib,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGH,QAATuL,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI0E,KAAK5Q,IAIN,CACLqb,IAAKA,EACLnP,IAAKA,IAIa,IAAlB9R,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKkhB,OAAOtb,EAAI0P,MAAOuL,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGT,CACL2L,IAAKA,EACLnP,IAAKtP,EAAIsP,MAI0B,IAAlC9R,KAAKiQ,SAAWrK,EAAIqK,WACvBzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAI0P,MAAOuL,GAEtB,QAATA,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI2E,KAAK7Q,IAIN,CACLqb,IAAKze,EAAIye,IACTnP,IAAKA,IAOLlM,EAAItE,OAAStB,KAAKsB,QAAUtB,KAAKkR,IAAItL,GAAO,EACvC,CACLqb,IAAK,IAAIpR,EAAG,GACZiC,IAAK9R,MAKU,IAAf4F,EAAItE,OACO,QAATuf,EACK,CACLI,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,MAII,QAAT+O,EACK,CACLI,IAAK,KACLnP,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7B,CACL+Q,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7BlQ,KAAK4gB,SAAShb,EAAKib,GAlF1B,IAAII,EAAKnP,EAAKtP,GAsFhBqN,EAAG5P,UAAUghB,IAAM,SAAcrb,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOqb,KAIxCpR,EAAG5P,UAAU6R,IAAM,SAAclM,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOkM,KAGxCjC,EAAG5P,UAAUohB,KAAO,SAAezb,GACjC,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAMkM,KAIvCjC,EAAG5P,UAAUqhB,SAAW,SAAmB1b,GACzC,IAAI2b,EAAKvhB,KAAKkhB,OAAOtb,GAGrB,GAAI2b,EAAGzP,IAAIyB,SAAU,OAAOgO,EAAGN,IAE/B,IAAInP,EAA0B,IAApByP,EAAGN,IAAIhR,SAAiBsR,EAAGzP,IAAI2E,KAAK7Q,GAAO2b,EAAGzP,IAEpD0P,EAAO5b,EAAIua,MAAM,GACjBsB,EAAK7b,EAAIuO,MAAM,GACfjD,EAAMY,EAAIZ,IAAIsQ,GAGlB,OAAItQ,EAAM,GAAY,IAAPuQ,GAAoB,IAARvQ,EAAkBqQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAG5P,UAAUuT,KAAO,SAAe5N,GACjCxC,EAAOwC,GAAO,UAId,IAHA,IAAI4J,GAAK,GAAK,IAAM5J,EAEhB8b,EAAM,EACDrW,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IACpCqW,GAAOlS,EAAIkS,GAAuB,EAAhB1hB,KAAKkQ,MAAM7E,KAAWzF,EAG1C,OAAO8b,GAIT7R,EAAG5P,UAAUwT,MAAQ,SAAgB7N,GACnCxC,EAAOwC,GAAO,UAGd,IADA,IAAImN,EAAQ,EACH1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAkB,SAAR0H,EAC9B/S,KAAKkQ,MAAM7E,GAAMmG,EAAI5L,EAAO,EAC5BmN,EAAQvB,EAAI5L,EAGd,OAAO5F,KAAK0R,SAGd7B,EAAG5P,UAAUmhB,KAAO,SAAexb,GACjC,OAAO5F,KAAK2E,QAAQ8O,MAAM7N,IAG5BiK,EAAG5P,UAAU0hB,KAAO,SAAenS,GACjCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAI2I,EAAIlc,KACJmc,EAAI3M,EAAE7K,QAGRuX,EADiB,IAAfA,EAAEjM,SACAiM,EAAEmF,KAAK7R,GAEP0M,EAAEvX,QAaR,IATA,IAAIid,EAAI,IAAI/R,EAAG,GACXgS,EAAI,IAAIhS,EAAG,GAGXiS,EAAI,IAAIjS,EAAG,GACXkS,EAAI,IAAIlS,EAAG,GAEXmS,EAAI,EAED9F,EAAE+F,UAAY9F,EAAE8F,UACrB/F,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP4N,EAMJ,IAHA,IAAIE,EAAK/F,EAAExX,QACPwd,EAAKjG,EAAEvX,SAEHuX,EAAE3I,UAAU,CAClB,IAAK,IAAIlI,EAAI,EAAG+W,EAAK,EAAyB,IAArBlG,EAAEhM,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADA6Q,EAAE9H,OAAO/I,GACFA,KAAM,IACPuW,EAAES,SAAWR,EAAEQ,WACjBT,EAAEpL,KAAK0L,GACPL,EAAEpL,KAAK0L,IAGTP,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIb,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBnG,EAAEjM,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADA6Q,EAAE/H,OAAO9I,GACFA,KAAM,IACPwW,EAAEO,SAAWN,EAAEM,WACjBP,EAAEtL,KAAK0L,GACPH,EAAEtL,KAAK0L,IAGTL,EAAE1N,OAAO,GACT2N,EAAE3N,OAAO,GAIT8H,EAAEhL,IAAIiL,IAAM,GACdD,EAAEzF,KAAK0F,GACPyF,EAAEnL,KAAKqL,GACPD,EAAEpL,KAAKsL,KAEP5F,EAAE1F,KAAKyF,GACP4F,EAAErL,KAAKmL,GACPG,EAAEtL,KAAKoL,IAIX,MAAO,CACLjP,EACAC,EAAGkP,EACHQ,IAAKpG,EAAEkD,OAAO2C,KAOlBnS,EAAG5P,UAAUuiB,OAAS,SAAiBhT,GACrCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAIX,EAAI5S,KACJ6S,EAAIrD,EAAE7K,QAGRiO,EADiB,IAAfA,EAAE3C,SACA2C,EAAEyO,KAAK7R,GAEPoD,EAAEjO,QAQR,IALA,IAuCInC,EAvCAigB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ9P,EAAElO,QAEPiO,EAAEgQ,KAAK,GAAK,GAAK/P,EAAE+P,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIvX,EAAI,EAAG+W,EAAK,EAAyB,IAArBxP,EAAE1C,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADAuH,EAAEwB,OAAO/I,GACFA,KAAM,GACPoX,EAAGJ,SACLI,EAAGjM,KAAKmM,GAGVF,EAAGrO,OAAO,GAId,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBzP,EAAE3C,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADAuH,EAAEuB,OAAO9I,GACFA,KAAM,GACPoX,EAAGL,SACLK,EAAGlM,KAAKmM,GAGVD,EAAGtO,OAAO,GAIVxB,EAAE1B,IAAI2B,IAAM,GACdD,EAAE6D,KAAK5D,GACP4P,EAAGhM,KAAKiM,KAER7P,EAAE4D,KAAK7D,GACP8P,EAAGjM,KAAKgM,IAeZ,OATEjgB,EADgB,IAAdoQ,EAAEgQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKhH,GAGJhN,GAGTqN,EAAG5P,UAAUsiB,IAAM,SAAc3c,GAC/B,GAAI5F,KAAKuT,SAAU,OAAO3N,EAAIkP,MAC9B,GAAIlP,EAAI2N,SAAU,OAAOvT,KAAK8U,MAE9B,IAAIlC,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAAIjB,QACZiO,EAAE3C,SAAW,EACb4C,EAAE5C,SAAW,EAGb,IAAK,IAAI0Q,EAAQ,EAAG/N,EAAEqP,UAAYpP,EAAEoP,SAAUtB,IAC5C/N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,OAAG,CACD,KAAOxB,EAAEqP,UACPrP,EAAEwB,OAAO,GAEX,KAAOvB,EAAEoP,UACPpP,EAAEuB,OAAO,GAGX,IAAIzD,EAAIiC,EAAE1B,IAAI2B,GACd,GAAIlC,EAAI,EAAG,CAET,IAAI4D,EAAI3B,EACRA,EAAIC,EACJA,EAAI0B,OACC,GAAU,IAAN5D,GAAyB,IAAdkC,EAAE+P,KAAK,GAC3B,MAGFhQ,EAAE6D,KAAK5D,GAGT,OAAOA,EAAEwM,OAAOsB,IAIlB9Q,EAAG5P,UAAU4iB,KAAO,SAAejd,GACjC,OAAO5F,KAAK2hB,KAAK/b,GAAKgN,EAAEyO,KAAKzb,IAG/BiK,EAAG5P,UAAUgiB,OAAS,WACpB,OAA+B,IAAP,EAAhBjiB,KAAKkQ,MAAM,KAGrBL,EAAG5P,UAAUoiB,MAAQ,WACnB,OAA+B,IAAP,EAAhBriB,KAAKkQ,MAAM,KAIrBL,EAAG5P,UAAUkU,MAAQ,SAAgBvO,GACnC,OAAO5F,KAAKkQ,MAAM,GAAKtK,GAIzBiK,EAAG5P,UAAU6iB,MAAQ,SAAgBxM,GACnClT,EAAsB,iBAARkT,GACd,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,GAAI3Q,KAAKsB,QAAU6b,EAGjB,OAFAnd,KAAKoS,QAAQ+K,EAAI,GACjBnd,KAAKkQ,MAAMiN,IAAMjJ,EACVlU,KAKT,IADA,IAAI+S,EAAQmB,EACH7I,EAAI8R,EAAa,IAAVpK,GAAe1H,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACnD,IAAImG,EAAoB,EAAhBxR,KAAKkQ,MAAM7E,GAEnB0H,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACLxR,KAAKkQ,MAAM7E,GAAKmG,EAMlB,OAJc,IAAVuB,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAEAtB,MAGT6P,EAAG5P,UAAUsT,OAAS,WACpB,OAAuB,IAAhBvT,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,IAGzCL,EAAG5P,UAAU2iB,KAAO,SAAehd,GACjC,IAOIpD,EAPAyN,EAAWrK,EAAM,EAErB,GAAsB,IAAlB5F,KAAKiQ,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBjQ,KAAKiQ,UAAkBA,EAAU,OAAO,EAK5C,GAHAjQ,KAAK0R,QAGD1R,KAAKsB,OAAS,EAChBkB,EAAM,MACD,CACDyN,IACFrK,GAAOA,GAGTxC,EAAOwC,GAAO,SAAW,qBAEzB,IAAI4L,EAAoB,EAAhBxR,KAAKkQ,MAAM,GACnB1N,EAAMgP,IAAM5L,EAAM,EAAI4L,EAAI5L,GAAO,EAAI,EAEvC,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAOTqN,EAAG5P,UAAUiR,IAAM,SAActL,GAC/B,GAAsB,IAAlB5F,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAQ,EACvD,GAAsB,IAAlBjQ,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAO,EAEtD,IAAIzN,EAAMxC,KAAK+iB,KAAKnd,GACpB,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAITqN,EAAG5P,UAAU8iB,KAAO,SAAend,GAEjC,GAAI5F,KAAKsB,OAASsE,EAAItE,OAAQ,OAAO,EACrC,GAAItB,KAAKsB,OAASsE,EAAItE,OAAQ,OAAQ,EAGtC,IADA,IAAIkB,EAAM,EACD6I,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAIuH,EAAoB,EAAhB5S,KAAKkQ,MAAM7E,GACfwH,EAAmB,EAAfjN,EAAIsK,MAAM7E,GAElB,GAAIuH,IAAMC,EAAV,CACID,EAAIC,EACNrQ,GAAO,EACEoQ,EAAIC,IACbrQ,EAAM,GAER,OAEF,OAAOA,GAGTqN,EAAG5P,UAAU+iB,IAAM,SAAcpd,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUgjB,GAAK,SAAard,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUijB,KAAO,SAAetd,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUkjB,IAAM,SAAcvd,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUmjB,IAAM,SAAcxd,GAC/B,OAA2B,IAApB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUojB,GAAK,SAAazd,GAC7B,OAA0B,IAAnB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUqjB,KAAO,SAAe1d,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUsjB,IAAM,SAAc3d,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUujB,IAAM,SAAc5d,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUwjB,GAAK,SAAa7d,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAOlBiK,EAAGM,IAAM,SAAcvK,GACrB,OAAO,IAAI8d,EAAI9d,IAGjBiK,EAAG5P,UAAU0jB,MAAQ,SAAgBC,GAGnC,OAFAxgB,GAAQpD,KAAKmQ,IAAK,yCAClB/M,EAAyB,IAAlBpD,KAAKiQ,SAAgB,iCACrB2T,EAAIC,UAAU7jB,MAAM8jB,UAAUF,IAGvC/T,EAAG5P,UAAU8jB,QAAU,WAErB,OADA3gB,EAAOpD,KAAKmQ,IAAK,wDACVnQ,KAAKmQ,IAAI6T,YAAYhkB,OAG9B6P,EAAG5P,UAAU6jB,UAAY,SAAoBF,GAE3C,OADA5jB,KAAKmQ,IAAMyT,EACJ5jB,MAGT6P,EAAG5P,UAAUgkB,SAAW,SAAmBL,GAEzC,OADAxgB,GAAQpD,KAAKmQ,IAAK,yCACXnQ,KAAK8jB,UAAUF,IAGxB/T,EAAG5P,UAAUikB,OAAS,SAAiBte,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIuG,IAAI1W,KAAM4F,IAG5BiK,EAAG5P,UAAUkkB,QAAU,SAAkBve,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIqG,KAAKxW,KAAM4F,IAG7BiK,EAAG5P,UAAUmkB,OAAS,SAAiBxe,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIwG,IAAI3W,KAAM4F,IAG5BiK,EAAG5P,UAAUokB,QAAU,SAAkBze,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIsG,KAAKzW,KAAM4F,IAG7BiK,EAAG5P,UAAUqkB,OAAS,SAAiB1e,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIoU,IAAIvkB,KAAM4F,IAG5BiK,EAAG5P,UAAUukB,OAAS,SAAiB5e,GAGrC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIU,IAAI7Q,KAAM4F,IAG5BiK,EAAG5P,UAAUykB,QAAU,SAAkB9e,GAGvC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIyK,KAAK5a,KAAM4F,IAG7BiK,EAAG5P,UAAU0kB,OAAS,WAGpB,OAFAvhB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+O,IAAIlf,OAGtB6P,EAAG5P,UAAU4kB,QAAU,WAGrB,OAFAzhB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAIgP,KAAKnf,OAIvB6P,EAAG5P,UAAU6kB,QAAU,WAGrB,OAFA1hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI4U,KAAK/kB,OAGvB6P,EAAG5P,UAAU+kB,QAAU,WAGrB,OAFA5hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI0S,KAAK7iB,OAIvB6P,EAAG5P,UAAUglB,OAAS,WAGpB,OAFA7hB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAImF,IAAItV,OAGtB6P,EAAG5P,UAAUilB,OAAS,SAAiBtf,GAGrC,OAFAxC,EAAOpD,KAAKmQ,MAAQvK,EAAIuK,IAAK,qBAC7BnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+B,IAAIlS,KAAM4F,IAI5B,IAAIuf,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ1lB,EAAM0P,GAErBxP,KAAKF,KAAOA,EACZE,KAAKwP,EAAI,IAAIK,EAAGL,EAAG,IACnBxP,KAAKge,EAAIhe,KAAKwP,EAAEiF,YAChBzU,KAAKgT,EAAI,IAAInD,EAAG,GAAGwP,OAAOrf,KAAKge,GAAGvH,KAAKzW,KAAKwP,GAE5CxP,KAAK0M,IAAM1M,KAAKylB,OAiDlB,SAASC,IACPF,EAAOjlB,KACLP,KACA,OACA,2EA+DJ,SAAS2lB,IACPH,EAAOjlB,KACLP,KACA,OACA,kEAIJ,SAAS4lB,IACPJ,EAAOjlB,KACLP,KACA,OACA,yDAIJ,SAAS6lB,IAEPL,EAAOjlB,KACLP,KACA,QACA,uEA8CJ,SAAS0jB,EAAK3kB,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAI+mB,EAAQjW,EAAGkW,OAAOhnB,GACtBiB,KAAKjB,EAAI+mB,EAAMtW,EACfxP,KAAK8lB,MAAQA,OAEb1iB,EAAOrE,EAAEikB,IAAI,GAAI,kCACjBhjB,KAAKjB,EAAIA,EACTiB,KAAK8lB,MAAQ,KAkOjB,SAASE,EAAMjnB,GACb2kB,EAAInjB,KAAKP,KAAMjB,GAEfiB,KAAK2gB,MAAQ3gB,KAAKjB,EAAE0V,YAChBzU,KAAK2gB,MAAQ,IAAO,IACtB3gB,KAAK2gB,OAAS,GAAM3gB,KAAK2gB,MAAQ,IAGnC3gB,KAAK2Q,EAAI,IAAId,EAAG,GAAGwP,OAAOrf,KAAK2gB,OAC/B3gB,KAAKyhB,GAAKzhB,KAAKimB,KAAKjmB,KAAK2Q,EAAEuO,OAC3Blf,KAAKkmB,KAAOlmB,KAAK2Q,EAAE6R,OAAOxiB,KAAKjB,GAE/BiB,KAAKmmB,KAAOnmB,KAAKkmB,KAAKrV,IAAI7Q,KAAK2Q,GAAG2P,MAAM,GAAGW,IAAIjhB,KAAKjB,GACpDiB,KAAKmmB,KAAOnmB,KAAKmmB,KAAK9E,KAAKrhB,KAAK2Q,GAChC3Q,KAAKmmB,KAAOnmB,KAAK2Q,EAAEgG,IAAI3W,KAAKmmB,MA5a9BX,EAAOvlB,UAAUwlB,KAAO,WACtB,IAAI/Y,EAAM,IAAImD,EAAG,MAEjB,OADAnD,EAAIwD,MAAQ,IAAIxO,MAAMoP,KAAKS,KAAKvR,KAAKge,EAAI,KAClCtR,GAGT8Y,EAAOvlB,UAAUmmB,QAAU,SAAkBxgB,GAG3C,IACIygB,EADA1V,EAAI/K,EAGR,GACE5F,KAAKsN,MAAMqD,EAAG3Q,KAAK0M,KAGnB2Z,GADA1V,GADAA,EAAI3Q,KAAKsmB,MAAM3V,IACT6F,KAAKxW,KAAK0M,MACP+H,kBACF4R,EAAOrmB,KAAKge,GAErB,IAAI9M,EAAMmV,EAAOrmB,KAAKge,GAAK,EAAIrN,EAAEoS,KAAK/iB,KAAKwP,GAgB3C,OAfY,IAAR0B,GACFP,EAAET,MAAM,GAAK,EACbS,EAAErP,OAAS,GACF4P,EAAM,EACfP,EAAE8F,KAAKzW,KAAKwP,QAEIpH,IAAZuI,EAAEe,MAEJf,EAAEe,QAGFf,EAAE4V,SAIC5V,GAGT6U,EAAOvlB,UAAUqN,MAAQ,SAAgBvH,EAAOjD,GAC9CiD,EAAMqO,OAAOpU,KAAKge,EAAG,EAAGlb,IAG1B0iB,EAAOvlB,UAAUqmB,MAAQ,SAAgB1gB,GACvC,OAAOA,EAAIgV,KAAK5a,KAAKgT,IASvBpT,EAAS8lB,EAAMF,GAEfE,EAAKzlB,UAAUqN,MAAQ,SAAgBvH,EAAOygB,GAK5C,IAHA,IAAI3G,EAAO,QAEP4G,EAAS3V,KAAK/D,IAAIhH,EAAMzE,OAAQ,GAC3B+J,EAAI,EAAGA,EAAIob,EAAQpb,IAC1Bmb,EAAOtW,MAAM7E,GAAKtF,EAAMmK,MAAM7E,GAIhC,GAFAmb,EAAOllB,OAASmlB,EAEZ1gB,EAAMzE,QAAU,EAGlB,OAFAyE,EAAMmK,MAAM,GAAK,OACjBnK,EAAMzE,OAAS,GAKjB,IAAIuI,EAAO9D,EAAMmK,MAAM,GAGvB,IAFAsW,EAAOtW,MAAMsW,EAAOllB,UAAYuI,EAAOgW,EAElCxU,EAAI,GAAIA,EAAItF,EAAMzE,OAAQ+J,IAAK,CAClC,IAAIqb,EAAwB,EAAjB3gB,EAAMmK,MAAM7E,GACvBtF,EAAMmK,MAAM7E,EAAI,KAAQqb,EAAO7G,IAAS,EAAMhW,IAAS,GACvDA,EAAO6c,EAET7c,KAAU,GACV9D,EAAMmK,MAAM7E,EAAI,IAAMxB,EACT,IAATA,GAAc9D,EAAMzE,OAAS,GAC/ByE,EAAMzE,QAAU,GAEhByE,EAAMzE,QAAU,GAIpBokB,EAAKzlB,UAAUqmB,MAAQ,SAAgB1gB,GAErCA,EAAIsK,MAAMtK,EAAItE,QAAU,EACxBsE,EAAIsK,MAAMtK,EAAItE,OAAS,GAAK,EAC5BsE,EAAItE,QAAU,EAId,IADA,IAAIwR,EAAK,EACAzH,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAImG,EAAmB,EAAf5L,EAAIsK,MAAM7E,GAClByH,GAAU,IAAJtB,EACN5L,EAAIsK,MAAM7E,GAAU,SAALyH,EACfA,EAAS,GAAJtB,GAAasB,EAAK,SAAa,GAUtC,OANkC,IAA9BlN,EAAIsK,MAAMtK,EAAItE,OAAS,KACzBsE,EAAItE,SAC8B,IAA9BsE,EAAIsK,MAAMtK,EAAItE,OAAS,IACzBsE,EAAItE,UAGDsE,GASThG,EAAS+lB,EAAMH,GAQf5lB,EAASgmB,EAAMJ,GASf5lB,EAASimB,EAAQL,GAEjBK,EAAO5lB,UAAUqmB,MAAQ,SAAgB1gB,GAGvC,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAIqJ,EAA0B,IAAL,EAAf9O,EAAIsK,MAAM7E,IAAiB0H,EACjCD,EAAU,SAAL4B,EACTA,KAAQ,GAER9O,EAAIsK,MAAM7E,GAAKyH,EACfC,EAAQ2B,EAKV,OAHc,IAAV3B,IACFnN,EAAIsK,MAAMtK,EAAItE,UAAYyR,GAErBnN,GAITiK,EAAGkW,OAAS,SAAgBjmB,GAE1B,GAAIqlB,EAAOrlB,GAAO,OAAOqlB,EAAOrlB,GAEhC,IAAIgmB,EACJ,GAAa,SAAThmB,EACFgmB,EAAQ,IAAIJ,OACP,GAAa,SAAT5lB,EACTgmB,EAAQ,IAAIH,OACP,GAAa,SAAT7lB,EACTgmB,EAAQ,IAAIF,MACP,IAAa,WAAT9lB,EAGT,MAAM,IAAIb,MAAM,iBAAmBa,GAFnCgmB,EAAQ,IAAID,EAMd,OAFAV,EAAOrlB,GAAQgmB,EAERA,GAkBTpC,EAAIzjB,UAAU2kB,SAAW,SAAmBhS,GAC1CxP,EAAsB,IAAfwP,EAAE3C,SAAgB,iCACzB7M,EAAOwP,EAAEzC,IAAK,oCAGhBuT,EAAIzjB,UAAUwkB,SAAW,SAAmB7R,EAAGC,GAC7CzP,EAAqC,IAA7BwP,EAAE3C,SAAW4C,EAAE5C,UAAiB,iCACxC7M,EAAOwP,EAAEzC,KAAOyC,EAAEzC,MAAQ0C,EAAE1C,IAC1B,oCAGJuT,EAAIzjB,UAAUgmB,KAAO,SAAerT,GAClC,OAAI5S,KAAK8lB,MAAc9lB,KAAK8lB,MAAMM,QAAQxT,GAAGkR,UAAU9jB,MAChD4S,EAAEyO,KAAKrhB,KAAKjB,GAAG+kB,UAAU9jB,OAGlC0jB,EAAIzjB,UAAUqV,IAAM,SAAc1C,GAChC,OAAIA,EAAEW,SACGX,EAAEjO,QAGJ3E,KAAKjB,EAAE4X,IAAI/D,GAAGkR,UAAU9jB,OAGjC0jB,EAAIzjB,UAAUyW,IAAM,SAAc9D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE8D,IAAI7D,GAIhB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUuW,KAAO,SAAe5D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE4D,KAAK3D,GAIjB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAU0W,IAAM,SAAc/D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE+D,IAAI9D,GAIhB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUwW,KAAO,SAAe7D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE6D,KAAK5D,GAIjB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAUskB,IAAM,SAAc3R,EAAGhN,GAEnC,OADA5F,KAAK4kB,SAAShS,GACP5S,KAAKimB,KAAKrT,EAAEqN,MAAMra,KAG3B8d,EAAIzjB,UAAU2a,KAAO,SAAehI,EAAGC,GAErC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAEgI,KAAK/H,KAG1B6Q,EAAIzjB,UAAU4Q,IAAM,SAAc+B,EAAGC,GAEnC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAE/B,IAAIgC,KAGzB6Q,EAAIzjB,UAAUkf,KAAO,SAAevM,GAClC,OAAO5S,KAAK4a,KAAKhI,EAAGA,EAAEjO,UAGxB+e,EAAIzjB,UAAUif,IAAM,SAActM,GAChC,OAAO5S,KAAK6Q,IAAI+B,EAAGA,IAGrB8Q,EAAIzjB,UAAU8kB,KAAO,SAAenS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEjO,QAEzB,IAAIgiB,EAAO3mB,KAAKjB,EAAEoV,MAAM,GAIxB,GAHA/Q,EAAOujB,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIzU,EAAMlS,KAAKjB,EAAE2X,IAAI,IAAI7G,EAAG,IAAIuE,OAAO,GACvC,OAAOpU,KAAKkS,IAAIU,EAAGV,GAQrB,IAFA,IAAIgC,EAAIlU,KAAKjB,EAAEyhB,KAAK,GAChBrD,EAAI,GACAjJ,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXhR,GAAQ8Q,EAAEX,UAEV,IAAIqT,EAAM,IAAI/W,EAAG,GAAG8T,MAAM3jB,MACtB6mB,EAAOD,EAAI3B,SAIX6B,EAAO9mB,KAAKjB,EAAEyhB,KAAK,GAAGpM,OAAO,GAC7B2S,EAAI/mB,KAAKjB,EAAE0V,YAGf,IAFAsS,EAAI,IAAIlX,EAAG,EAAIkX,EAAIA,GAAGpD,MAAM3jB,MAEW,IAAhCA,KAAKkS,IAAI6U,EAAGD,GAAM5V,IAAI2V,IAC3BE,EAAE5C,QAAQ0C,GAOZ,IAJA,IAAIrW,EAAIxQ,KAAKkS,IAAI6U,EAAG7S,GAChBvD,EAAI3Q,KAAKkS,IAAIU,EAAGsB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAIvU,KAAKkS,IAAIU,EAAGsB,GAChBnV,EAAIoe,EACc,IAAf5I,EAAErD,IAAI0V,IAAY,CAEvB,IADA,IAAIla,EAAM6H,EACDlJ,EAAI,EAAoB,IAAjBqB,EAAIwE,IAAI0V,GAAYvb,IAClCqB,EAAMA,EAAIiY,SAEZvhB,EAAOiI,EAAItM,GACX,IAAI8T,EAAI7S,KAAKkS,IAAI1B,EAAG,IAAIX,EAAG,GAAGwP,OAAOtgB,EAAIsM,EAAI,IAE7CsF,EAAIA,EAAE6T,OAAO3R,GACbrC,EAAIqC,EAAE8R,SACNpQ,EAAIA,EAAEiQ,OAAOhU,GACbzR,EAAIsM,EAGN,OAAOsF,GAGT+S,EAAIzjB,UAAU4iB,KAAO,SAAejQ,GAClC,IAAIoU,EAAMpU,EAAE4P,OAAOxiB,KAAKjB,GACxB,OAAqB,IAAjBioB,EAAI/W,UACN+W,EAAI/W,SAAW,EACRjQ,KAAKimB,KAAKe,GAAK/B,UAEfjlB,KAAKimB,KAAKe,IAIrBtD,EAAIzjB,UAAUiS,IAAM,SAAcU,EAAGhN,GACnC,GAAIA,EAAI2N,SAAU,OAAO,IAAI1D,EAAG,GAAG8T,MAAM3jB,MACzC,GAAoB,IAAhB4F,EAAIgd,KAAK,GAAU,OAAOhQ,EAAEjO,QAEhC,IACIsiB,EAAM,IAAIvlB,MAAM,IACpBulB,EAAI,GAAK,IAAIpX,EAAG,GAAG8T,MAAM3jB,MACzBinB,EAAI,GAAKrU,EACT,IAAK,IAAIvH,EAAI,EAAGA,EAAI4b,EAAI3lB,OAAQ+J,IAC9B4b,EAAI5b,GAAKrL,KAAK6Q,IAAIoW,EAAI5b,EAAI,GAAIuH,GAGhC,IAAIpQ,EAAMykB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtgB,EAAQjB,EAAI6O,YAAc,GAK9B,IAJc,IAAV5N,IACFA,EAAQ,IAGLwE,EAAIzF,EAAItE,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI0G,EAAOnM,EAAIsK,MAAM7E,GACZC,EAAIzE,EAAQ,EAAGyE,GAAK,EAAGA,IAAK,CACnC,IAAIgL,EAAOvE,GAAQzG,EAAK,EACpB9I,IAAQykB,EAAI,KACdzkB,EAAMxC,KAAKkf,IAAI1c,IAGL,IAAR8T,GAAyB,IAAZ4Q,GAKjBA,IAAY,EACZA,GAAW5Q,GA9BE,KA+Bb6Q,GACwC,IAAN9b,GAAiB,IAANC,KAE7C9I,EAAMxC,KAAK6Q,IAAIrO,EAAKykB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtgB,EAAQ,GAGV,OAAOrE,GAGTkhB,EAAIzjB,UAAU4jB,UAAY,SAAoBje,GAC5C,IAAI+K,EAAI/K,EAAIyb,KAAKrhB,KAAKjB,GAEtB,OAAO4R,IAAM/K,EAAM+K,EAAEhM,QAAUgM,GAGjC+S,EAAIzjB,UAAU+jB,YAAc,SAAsBpe,GAChD,IAAIpD,EAAMoD,EAAIjB,QAEd,OADAnC,EAAI2N,IAAM,KACH3N,GAOTqN,EAAGuX,KAAO,SAAexhB,GACvB,OAAO,IAAIogB,EAAKpgB,IAmBlBhG,EAASomB,EAAMtC,GAEfsC,EAAK/lB,UAAU4jB,UAAY,SAAoBje,GAC7C,OAAO5F,KAAKimB,KAAKrgB,EAAIqa,MAAMjgB,KAAK2gB,SAGlCqF,EAAK/lB,UAAU+jB,YAAc,SAAsBpe,GACjD,IAAI+K,EAAI3Q,KAAKimB,KAAKrgB,EAAIiL,IAAI7Q,KAAKkmB,OAE/B,OADAvV,EAAER,IAAM,KACDQ,GAGTqV,EAAK/lB,UAAU2a,KAAO,SAAehI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE1C,MAAM,GAAK,EACb0C,EAAEtR,OAAS,EACJsR,EAGT,IAAI2B,EAAI3B,EAAEgI,KAAK/H,GACXrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAQV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4Q,IAAM,SAAc+B,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI1D,EAAG,GAAGiU,UAAU9jB,MAEzD,IAAIuU,EAAI3B,EAAE/B,IAAIgC,GACVrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAOV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4iB,KAAO,SAAejQ,GAGnC,OADU5S,KAAKimB,KAAKrT,EAAE4P,OAAOxiB,KAAKjB,GAAG8R,IAAI7Q,KAAKyhB,KACnCqC,UAAU9jB,OAn3GzB,YAq3G4CA,6BC/2G5C,SAASw4G,IACPx4G,KAAKy4G,OAASjzG,OAAOgpB,OAAO,MAC5BxuB,KAAK04G,YAAclzG,OAAOgpB,OAAO,MAEjC,IAAK,IAAInjB,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IACpCrL,KAAKT,OAAO0F,UAAUoG,IAGxBrL,KAAKT,OAASS,KAAKT,OAAOyqB,KAAKhqB,MAC/BA,KAAK08B,QAAU18B,KAAK08B,QAAQ1S,KAAKhqB,MACjCA,KAAK24G,aAAe34G,KAAK24G,aAAa3uF,KAAKhqB,MAsB7Cw4G,EAAKv4G,UAAUV,OAAS,SAASq5G,EAASC,GACxC,IAAK,IAAI7wG,KAAQ4wG,EAAS,CACxB,IAAI92E,EAAa82E,EAAQ5wG,GAAMpG,KAAI,SAAS2S,GAC1C,OAAOA,EAAEszB,iBAEX7/B,EAAOA,EAAK6/B,cAEZ,IAAK,IAAIx8B,EAAI,EAAGA,EAAIy2B,EAAWxgC,OAAQ+J,IAAK,CAC1C,MAAMw6B,EAAM/D,EAAWz2B,GAIvB,GAAe,MAAXw6B,EAAI,GAAR,CAIA,IAAKgzE,GAAUhzE,KAAO7lC,KAAKy4G,OACzB,MAAM,IAAIx5G,MACR,kCAAoC4mC,EACpC,qBAAuB7lC,KAAKy4G,OAAO5yE,GAAO,SAAW79B,EACrD,yDAA2D69B,EAC3D,sCAAwC79B,EAAO,MAInDhI,KAAKy4G,OAAO5yE,GAAO79B,GAIrB,GAAI6wG,IAAU74G,KAAK04G,YAAY1wG,GAAO,CACpC,MAAM69B,EAAM/D,EAAW,GACvB9hC,KAAK04G,YAAY1wG,GAAoB,MAAX69B,EAAI,GAAcA,EAAMA,EAAI3R,OAAO,MAQnEskF,EAAKv4G,UAAUy8B,QAAU,SAAS31B,GAEhC,IAAIm4C,GADJn4C,EAAO8E,OAAO9E,IACE6G,QAAQ,WAAY,IAAIi6B,cACpChC,EAAMqZ,EAAKtxC,QAAQ,QAAS,IAAIi6B,cAEhCixE,EAAU55D,EAAK59C,OAASyF,EAAKzF,OAGjC,OAFaukC,EAAIvkC,OAAS49C,EAAK59C,OAAS,IAErBw3G,IAAY94G,KAAKy4G,OAAO5yE,IAAQ,MAMrD2yE,EAAKv4G,UAAU04G,aAAe,SAAS3wG,GAErC,OADAA,EAAO,gBAAgBX,KAAKW,IAAS0vB,OAAOsyC,KAC7BhqE,KAAK04G,YAAY1wG,EAAK6/B,gBAAkB,MAGzDppC,EAAOC,QAAU85G,+BC9FjB,IAAIA,EAAO,EAAQ,MACnB/5G,EAAOC,QAAU,IAAI85G,EAAK,EAAQ,MAAqB,EAAQ,iBCH/D/5G,EAAOC,QAAU,CAAC,sBAAsB,CAAC,OAAO,+CAA+C,CAAC,OAAO,oCAAoC,CAAC,OAAO,oCAAoC,CAAC,OAAO,kCAAkC,CAAC,OAAO,6BAA6B,CAAC,QAAQ,mCAAmC,CAAC,OAAO,oCAAoC,CAAC,OAAO,oCAAoC,CAAC,OAAO,2BAA2B,CAAC,OAAO,0BAA0B,CAAC,MAAM,SAAS,8DAA8D,CAAC,OAAO,0CAA0C,CAAC,QAAQ,4BAA4B,CAAC,MAAM,QAAQ,gCAAgC,CAAC,OAAO,6BAA6B,CAAC,QAAQ,8BAA8B,CAAC,SAAS,wCAAwC,CAAC,OAAO,wCAAwC,CAAC,OAAO,+BAA+B,CAAC,OAAO,uCAAuC,CAAC,OAAO,4BAA4B,CAAC,OAAO,0CAA0C,CAAC,OAAO,yDAAyD,CAAC,OAAO,sDAAsD,CAAC,OAAO,uCAAuC,CAAC,OAAO,sCAAsC,CAAC,QAAQ,gCAAgC,CAAC,OAAO,gCAAgC,CAAC,QAAQ,gCAAgC,CAAC,WAAW,8BAA8B,CAAC,SAAS,+BAA+B,CAAC,UAAU,qCAAqC,CAAC,OAAO,wCAAwC,CAAC,QAAQ,6BAA6B,CAAC,OAAO,oCAAoC,CAAC,QAAQ,oCAAoC,CAAC,OAAO,sBAAsB,CAAC,OAAO,kCAAkC,CAAC,OAAO,+BAA+B,CAAC,SAAS,uCAAuC,CAAC,OAAO,6BAA6B,CAAC,OAAO,2CAA2C,CAAC,OAAO,2BAA2B,CAAC,OAAO,8BAA8B,CAAC,OAAO,gCAAgC,CAAC,MAAM,MAAM,MAAM,MAAM,OAAO,+CAA+C,CAAC,UAAU,mDAAmD,CAAC,UAAU,8BAA8B,CAAC,OAAO,+BAA+B,CAAC,WAAW,8BAA8B,CAAC,OAAO,gCAAgC,CAAC,QAAQ,yCAAyC,CAAC,QAAQ,wCAAwC,CAAC,QAAQ,yCAAyC,CAAC,QAAQ,yCAAyC,CAAC,QAAQ,wCAAwC,CAAC,OAAO,4BAA4B,CAAC,OAAO,2BAA2B,CAAC,OAAO,2BAA2B,CAAC,OAAO,6BAA6B,CAAC,SAAS,uBAAuB,CAAC,QAAQ,kCAAkC,CAAC,OAAO,sBAAsB,CAAC,OAAO,4BAA4B,CAAC,MAAM,OAAO,MAAM,QAAQ,gCAAgC,CAAC,MAAM,QAAQ,mCAAmC,CAAC,MAAM,QAAQ,2BAA2B,CAAC,MAAM,QAAQ,yCAAyC,CAAC,aAAa,sBAAsB,CAAC,OAAO,4BAA4B,CAAC,OAAO,0BAA0B,CAAC,OAAO,+BAA+B,CAAC,QAAQ,8BAA8B,CAAC,QAAQ,0BAA0B,CAAC,OAAO,8BAA8B,CAAC,OAAO,0BAA0B,CAAC,OAAO,+BAA+B,CAAC,OAAO,0BAA0B,CAAC,OAAO,4BAA4B,CAAC,OAAO,4BAA4B,CAAC,OAAO,mCAAmC,CAAC,OAAO,6BAA6B,CAAC,OAAO,4BAA4B,CAAC,OAAO,+BAA+B,CAAC,MAAM,OAAO,8BAA8B,CAAC,OAAO,gCAAgC,CAAC,OAAO,sBAAsB,CAAC,OAAO,6BAA6B,CAAC,SAAS,4BAA4B,CAAC,OAAO,YAAY,6BAA6B,CAAC,OAAO,gCAAgC,CAAC,OAAO,6BAA6B,CAAC,KAAK,QAAQ,QAAQ,QAAQ,8BAA8B,CAAC,OAAO,8BAA8B,CAAC,OAAO,gCAAgC,CAAC,OAAO,gCAAgC,CAAC,OAAO,iCAAiC,CAAC,OAAO,iCAAiC,CAAC,OAAO,kCAAkC,CAAC,OAAO,mCAAmC,CAAC,OAAO,gCAAgC,CAAC,OAAO,sCAAsC,CAAC,OAAO,6CAA6C,CAAC,OAAO,6BAA6B,CAAC,OAAO,mCAAmC,CAAC,OAAO,gCAAgC,CAAC,OAAO,gCAAgC,CAAC,OAAO,oCAAoC,CAAC,MAAM,OAAO,0BAA0B,CAAC,OAAO,0BAA0B,CAAC,OAAO,2BAA2B,CAAC,OAAO,sBAAsB,CAAC,OAAO,uCAAuC,CAAC,QAAQ,2CAA2C,CAAC,WAAW,0CAA0C,CAAC,UAAU,uCAAuC,CAAC,OAAO,mCAAmC,CAAC,OAAO,yBAAyB,CAAC,MAAM,OAAO,iCAAiC,CAAC,OAAO,8BAA8B,CAAC,OAAO,0CAA0C,CAAC,OAAO,kCAAkC,CAAC,OAAO,sCAAsC,CAAC,OAAO,uCAAuC,CAAC,OAAO,+BAA+B,CAAC,OAAO,0BAA0B,CAAC,OAAO,6CAA6C,CAAC,OAAO,uBAAuB,CAAC,QAAQ,oCAAoC,CAAC,OAAO,0BAA0B,CAAC,QAAQ,0BAA0B,CAAC,QAAQ,yBAAyB,CAAC,OAAO,0BAA0B,CAAC,OAAO,yBAAyB,CAAC,OAAO,2BAA2B,CAAC,SAAS,uCAAuC,CAAC,aAAa,8BAA8B,CAAC,OAAO,6BAA6B,CAAC,MAAM,UAAU,YAAY,wCAAwC,CAAC,OAAO,uCAAuC,CAAC,MAAM,6BAA6B,CAAC,MAAM,OAAO,2BAA2B,CAAC,OAAO,kCAAkC,CAAC,OAAO,kCAAkC,CAAC,OAAO,6BAA6B,CAAC,OAAO,mCAAmC,CAAC,MAAM,OAAO,2BAA2B,CAAC,OAAO,2BAA2B,CAAC,OAAO,2BAA2B,CAAC,OAAO,wCAAwC,CAAC,aAAa,0CAA0C,CAAC,OAAO,yBAAyB,CAAC,OAAO,2BAA2B,CAAC,OAAO,sBAAsB,CAAC,OAAO,wCAAwC,CAAC,OAAO,uBAAuB,CAAC,QAAQ,qCAAqC,CAAC,QAAQ,0BAA0B,CAAC,MAAM,OAAO,6BAA6B,CAAC,UAAU,6BAA6B,CAAC,QAAQ,+BAA+B,CAAC,OAAO,4BAA4B,CAAC,OAAO,8BAA8B,CAAC,OAAO,iCAAiC,CAAC,MAAM,OAAO,8BAA8B,CAAC,OAAO,4BAA4B,CAAC,MAAM,OAAO,6BAA6B,CAAC,QAAQ,+BAA+B,CAAC,OAAO,wBAAwB,CAAC,MAAM,OAAO,uBAAuB,CAAC,MAAM,MAAM,MAAM,OAAO,mCAAmC,CAAC,OAAO,8BAA8B,CAAC,UAAU,qDAAqD,CAAC,OAAO,0DAA0D,CAAC,OAAO,8BAA8B,CAAC,OAAO,iCAAiC,CAAC,OAAO,kCAAkC,CAAC,OAAO,8BAA8B,CAAC,OAAO,kCAAkC,CAAC,OAAO,kCAAkC,CAAC,OAAO,gCAAgC,CAAC,OAAO,mCAAmC,CAAC,WAAW,qCAAqC,CAAC,OAAO,sBAAsB,CAAC,OAAO,8BAA8B,CAAC,OAAO,qCAAqC,CAAC,SAAS,uBAAuB,CAAC,OAAO,uBAAuB,CAAC,OAAO,iCAAiC,CAAC,OAAO,iCAAiC,CAAC,OAAO,sBAAsB,CAAC,OAAO,6BAA6B,CAAC,OAAO,6BAA6B,CAAC,OAAO,6BAA6B,CAAC,OAAO,6BAA6B,CAAC,OAAO,6BAA6B,CAAC,OAAO,6BAA6B,CAAC,OAAO,6BAA6B,CAAC,OAAO,qCAAqC,CAAC,OAAO,qCAAqC,CAAC,OAAO,kCAAkC,CAAC,OAAO,8BAA8B,CAAC,OAAO,oCAAoC,CAAC,OAAO,2BAA2B,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,iDAAiD,CAAC,QAAQ,wDAAwD,CAAC,QAAQ,iDAAiD,CAAC,QAAQ,oDAAoD,CAAC,QAAQ,gCAAgC,CAAC,OAAO,8BAA8B,CAAC,OAAO,yBAAyB,CAAC,OAAO,yBAAyB,CAAC,OAAO,iCAAiC,CAAC,QAAQ,6BAA6B,CAAC,OAAO,gCAAgC,CAAC,OAAO,6BAA6B,CAAC,QAAQ,gCAAgC,CAAC,MAAM,MAAM,OAAO,sDAAsD,CAAC,QAAQ,6DAA6D,CAAC,QAAQ,sDAAsD,CAAC,QAAQ,0DAA0D,CAAC,QAAQ,yDAAyD,CAAC,QAAQ,6BAA6B,CAAC,MAAM,OAAO,mDAAmD,CAAC,QAAQ,mDAAmD,CAAC,QAAQ,2BAA2B,CAAC,MAAM,MAAM,MAAM,OAAO,yBAAyB,CAAC,OAAO,iCAAiC,CAAC,OAAO,uBAAuB,CAAC,QAAQ,2BAA2B,CAAC,OAAO,8BAA8B,CAAC,QAAQ,wBAAwB,CAAC,UAAU,oCAAoC,CAAC,OAAO,uBAAuB,CAAC,MAAM,QAAQ,qCAAqC,CAAC,OAAO,kCAAkC,CAAC,OAAO,+BAA+B,CAAC,OAAO,sCAAsC,CAAC,OAAO,oCAAoC,CAAC,SAAS,+CAA+C,CAAC,UAAU,qCAAqC,CAAC,QAAQ,sCAAsC,CAAC,QAAQ,+BAA+B,CAAC,OAAO,+BAA+B,CAAC,OAAO,+BAA+B,CAAC,OAAO,2CAA2C,CAAC,OAAO,oDAAoD,CAAC,OAAO,8CAA8C,CAAC,OAAO,6CAA6C,CAAC,OAAO,sDAAsD,CAAC,QAAQ,8CAA8C,CAAC,OAAO,uDAAuD,CAAC,OAAO,2CAA2C,CAAC,OAAO,oDAAoD,CAAC,OAAO,kDAAkD,CAAC,OAAO,2DAA2D,CAAC,OAAO,iDAAiD,CAAC,OAAO,0DAA0D,CAAC,OAAO,0CAA0C,CAAC,OAAO,iDAAiD,CAAC,OAAO,mDAAmD,CAAC,OAAO,8CAA8C,CAAC,OAAO,6BAA6B,CAAC,MAAM,8BAA8B,CAAC,OAAO,oCAAoC,CAAC,QAAQ,0CAA0C,CAAC,OAAO,yCAAyC,CAAC,OAAO,4EAA4E,CAAC,QAAQ,qEAAqE,CAAC,QAAQ,yEAAyE,CAAC,QAAQ,wEAAwE,CAAC,QAAQ,oEAAoE,CAAC,QAAQ,uEAAuE,CAAC,QAAQ,0EAA0E,CAAC,QAAQ,0EAA0E,CAAC,QAAQ,yCAAyC,CAAC,OAAO,0BAA0B,CAAC,MAAM,iCAAiC,CAAC,OAAO,uBAAuB,CAAC,MAAM,MAAM,QAAQ,4BAA4B,CAAC,OAAO,4BAA4B,CAAC,OAAO,4BAA4B,CAAC,OAAO,yBAAyB,CAAC,QAAQ,6BAA6B,CAAC,MAAM,8BAA8B,CAAC,OAAO,gCAAgC,CAAC,OAAO,qCAAqC,CAAC,OAAO,mCAAmC,CAAC,OAAO,wCAAwC,CAAC,OAAO,4BAA4B,CAAC,QAAQ,oCAAoC,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,sBAAsB,CAAC,OAAO,8BAA8B,CAAC,OAAO,qCAAqC,CAAC,OAAO,yCAAyC,CAAC,YAAY,iCAAiC,CAAC,cAAc,0BAA0B,CAAC,OAAO,+BAA+B,CAAC,MAAM,mCAAmC,CAAC,QAAQ,qCAAqC,CAAC,UAAU,uCAAuC,CAAC,MAAM,0BAA0B,CAAC,OAAO,uBAAuB,CAAC,QAAQ,uBAAuB,CAAC,QAAQ,uBAAuB,CAAC,QAAQ,0CAA0C,CAAC,OAAO,8CAA8C,CAAC,OAAO,6CAA6C,CAAC,OAAO,yCAAyC,CAAC,OAAO,qCAAqC,CAAC,MAAM,QAAQ,uBAAuB,CAAC,OAAO,gCAAgC,CAAC,WAAW,8CAA8C,CAAC,MAAM,kCAAkC,CAAC,OAAO,QAAQ,+BAA+B,CAAC,OAAO,+BAA+B,CAAC,OAAO,oCAAoC,CAAC,OAAO,oCAAoC,CAAC,OAAO,uCAAuC,CAAC,OAAO,oCAAoC,CAAC,OAAO,sCAAsC,CAAC,MAAM,OAAO,6CAA6C,CAAC,OAAO,oCAAoC,CAAC,SAAS,sCAAsC,CAAC,MAAM,+BAA+B,CAAC,QAAQ,+BAA+B,CAAC,OAAO,wCAAwC,CAAC,OAAO,+BAA+B,CAAC,OAAO,wCAAwC,CAAC,OAAO,kCAAkC,CAAC,OAAO,2CAA2C,CAAC,OAAO,+BAA+B,CAAC,OAAO,iCAAiC,CAAC,OAAO,wCAAwC,CAAC,OAAO,0CAA0C,CAAC,OAAO,+BAA+B,CAAC,MAAM,QAAQ,sBAAsB,CAAC,OAAO,kCAAkC,CAAC,MAAM,QAAQ,6BAA6B,CAAC,OAAO,kCAAkC,CAAC,OAAO,gCAAgC,CAAC,OAAO,mCAAmC,CAAC,OAAO,4CAA4C,CAAC,OAAO,+BAA+B,CAAC,OAAO,MAAM,OAAO,iCAAiC,CAAC,OAAO,2BAA2B,CAAC,OAAO,+BAA+B,CAAC,OAAO,0BAA0B,CAAC,OAAO,uBAAuB,CAAC,MAAM,QAAQ,4BAA4B,CAAC,OAAO,yBAAyB,CAAC,OAAO,wBAAwB,CAAC,YAAY,2BAA2B,CAAC,QAAQ,sBAAsB,CAAC,OAAO,wBAAwB,CAAC,MAAM,MAAM,MAAM,OAAO,4BAA4B,CAAC,OAAO,sBAAsB,CAAC,OAAO,4BAA4B,CAAC,SAAS,2BAA2B,CAAC,QAAQ,iCAAiC,CAAC,SAAS,2BAA2B,CAAC,OAAO,iCAAiC,CAAC,OAAO,8BAA8B,CAAC,OAAO,sBAAsB,CAAC,OAAO,yBAAyB,CAAC,OAAO,uBAAuB,CAAC,OAAO,uBAAuB,CAAC,QAAQ,gCAAgC,CAAC,OAAO,mCAAmC,CAAC,OAAO,kCAAkC,CAAC,OAAO,yCAAyC,CAAC,OAAO,oDAAoD,CAAC,UAAU,oCAAoC,CAAC,OAAO,qCAAqC,CAAC,OAAO,0CAA0C,CAAC,OAAO,sBAAsB,CAAC,MAAM,QAAQ,iCAAiC,CAAC,OAAO,8BAA8B,CAAC,MAAM,wBAAwB,CAAC,OAAO,+BAA+B,CAAC,OAAO,gCAAgC,CAAC,QAAQ,oBAAoB,CAAC,OAAO,+BAA+B,CAAC,MAAM,MAAM,MAAM,OAAO,+BAA+B,CAAC,OAAO,+BAA+B,CAAC,OAAO,sBAAsB,CAAC,SAAS,qBAAqB,CAAC,SAAS,2BAA2B,CAAC,WAAW,sBAAsB,CAAC,MAAM,SAAS,qBAAqB,CAAC,MAAM,sBAAsB,CAAC,MAAM,OAAO,oBAAoB,CAAC,MAAM,MAAM,MAAM,MAAM,OAAO,uBAAuB,CAAC,OAAO,+BAA+B,CAAC,OAAO,qBAAqB,CAAC,QAAQ,0BAA0B,CAAC,OAAO,iCAAiC,CAAC,OAAO,sBAAsB,CAAC,OAAO,2BAA2B,CAAC,OAAO,qBAAqB,CAAC,QAAQ,oBAAoB,CAAC,OAAO,+BAA+B,CAAC,OAAO,QAAQ,+BAA+B,CAAC,OAAO,yBAAyB,CAAC,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,OAAO,qBAAqB,CAAC,OAAO,2BAA2B,CAAC,OAAO,2BAA2B,CAAC,OAAO,gCAAgC,CAAC,OAAO,oBAAoB,CAAC,OAAO,sBAAsB,CAAC,OAAO,oBAAoB,CAAC,OAAO,yBAAyB,CAAC,OAAO,iCAAiC,CAAC,OAAO,+BAA+B,CAAC,OAAO,yBAAyB,CAAC,OAAO,yBAAyB,CAAC,OAAO,2BAA2B,CAAC,MAAM,MAAM,MAAM,OAAO,wBAAwB,CAAC,OAAO,6BAA6B,CAAC,OAAO,+BAA+B,CAAC,OAAO,sBAAsB,CAAC,OAAO,yBAAyB,CAAC,YAAY,2BAA2B,CAAC,UAAU,qBAAqB,CAAC,QAAQ,oBAAoB,CAAC,OAAO,0BAA0B,CAAC,OAAO,qCAAqC,CAAC,WAAW,8BAA8B,CAAC,QAAQ,qCAAqC,CAAC,QAAQ,yCAAyC,CAAC,YAAY,qCAAqC,CAAC,UAAU,kCAAkC,CAAC,WAAW,+BAA+B,CAAC,QAAQ,yBAAyB,CAAC,QAAQ,sBAAsB,CAAC,SAAS,6BAA6B,CAAC,QAAQ,+BAA+B,CAAC,MAAM,OAAO,yBAAyB,CAAC,OAAO,oBAAoB,CAAC,OAAO,iCAAiC,CAAC,MAAM,QAAQ,+BAA+B,CAAC,eAAe,4BAA4B,CAAC,OAAO,uBAAuB,CAAC,OAAO,uBAAuB,CAAC,OAAO,wBAAwB,CAAC,QAAQ,yBAAyB,CAAC,OAAO,yBAAyB,CAAC,OAAO,2BAA2B,CAAC,OAAO,uBAAuB,CAAC,OAAO,8BAA8B,CAAC,QAAQ,2BAA2B,CAAC,OAAO,OAAO,MAAM,MAAM,QAAQ,4BAA4B,CAAC,MAAM,MAAM,OAAO,2BAA2B,CAAC,OAAO,OAAO,OAAO,OAAO,wBAAwB,CAAC,OAAO,4BAA4B,CAAC,OAAO,2BAA2B,CAAC,OAAO,2BAA2B,CAAC,OAAO,wBAAwB,CAAC,OAAO,uBAAuB,CAAC,KAAK,OAAO,oCAAoC,CAAC,OAAO,oBAAoB,CAAC,OAAO,qBAAqB,CAAC,KAAK,MAAM,sBAAsB,CAAC,OAAO,QAAQ,uBAAuB,CAAC,MAAM,OAAO,mCAAmC,CAAC,MAAM,OAAO,kCAAkC,CAAC,OAAO,+BAA+B,CAAC,QAAQ,uCAAuC,CAAC,OAAO,sCAAsC,CAAC,OAAO,oBAAoB,CAAC,OAAO,mBAAmB,CAAC,MAAM,qBAAqB,CAAC,QAAQ,gCAAgC,CAAC,OAAO,gCAAgC,CAAC,OAAO,oBAAoB,CAAC,OAAO,wBAAwB,CAAC,OAAO,yBAAyB,CAAC,QAAQ,uBAAuB,CAAC,OAAO,wBAAwB,CAAC,WAAW,uBAAuB,CAAC,UAAU,2BAA2B,CAAC,MAAM,qBAAqB,CAAC,OAAO,oBAAoB,CAAC,OAAO,oBAAoB,CAAC,MAAM,MAAM,oBAAoB,CAAC,OAAO,wBAAwB,CAAC,OAAO,wBAAwB,CAAC,UAAU,QAAQ,qBAAqB,CAAC,QAAQ,sBAAsB,CAAC,SAAS,+BAA+B,CAAC,OAAO,+BAA+B,CAAC,OAAO,+BAA+B,CAAC,OAAO,gCAAgC,CAAC,QAAQ,wCAAwC,CAAC,gBAAgB,+BAA+B,CAAC,OAAO,+BAA+B,CAAC,OAAO,gCAAgC,CAAC,QAAQ,4BAA4B,CAAC,OAAO,sCAAsC,CAAC,UAAU,6BAA6B,CAAC,MAAM,MAAM,OAAO,qBAAqB,CAAC,OAAO,0BAA0B,CAAC,QAAQ,0BAA0B,CAAC,OAAO,mBAAmB,CAAC,MAAM,yBAAyB,CAAC,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,uBAAuB,CAAC,MAAM,QAAQ,0BAA0B,CAAC,OAAO,gBAAgB,CAAC,OAAO,gBAAgB,CAAC,OAAO,mBAAmB,CAAC,SAAS,yBAAyB,CAAC,OAAO,mCAAmC,CAAC,OAAO,4BAA4B,CAAC,aAAa,4BAA4B,CAAC,aAAa,4BAA4B,CAAC,aAAa,gBAAgB,CAAC,OAAO,cAAc,CAAC,OAAO,eAAe,CAAC,MAAM,OAAO,QAAQ,cAAc,CAAC,OAAO,eAAe,CAAC,QAAQ,cAAc,CAAC,QAAQ,mBAAmB,CAAC,OAAO,kBAAkB,CAAC,OAAO,iBAAiB,CAAC,OAAO,iBAAiB,CAAC,OAAO,uBAAuB,CAAC,MAAM,MAAM,8BAA8B,CAAC,OAAO,oBAAoB,CAAC,OAAO,cAAc,CAAC,QAAQ,iBAAiB,CAAC,OAAO,iBAAiB,CAAC,OAAO,kBAAkB,CAAC,QAAQ,iBAAiB,CAAC,OAAO,kBAAkB,CAAC,QAAQ,iBAAiB,CAAC,OAAO,iBAAiB,CAAC,QAAQ,gBAAgB,CAAC,OAAO,4BAA4B,CAAC,OAAO,mCAAmC,CAAC,OAAO,yBAAyB,CAAC,MAAM,OAAO,MAAM,QAAQ,iBAAiB,CAAC,OAAO,OAAO,yBAAyB,CAAC,QAAQ,gBAAgB,CAAC,OAAO,gBAAgB,CAAC,OAAO,yBAAyB,CAAC,OAAO,gBAAgB,CAAC,OAAO,gBAAgB,CAAC,OAAO,iCAAiC,CAAC,OAAO,iCAAiC,CAAC,OAAO,2BAA2B,CAAC,OAAO,mBAAmB,CAAC,OAAO,oBAAoB,CAAC,OAAO,qBAAqB,CAAC,OAAO,oBAAoB,CAAC,OAAO,oBAAoB,CAAC,OAAO,wBAAwB,CAAC,OAAO,iCAAiC,CAAC,OAAO,qBAAqB,CAAC,QAAQ,iBAAiB,CAAC,OAAO,uBAAuB,CAAC,OAAO,cAAc,CAAC,OAAO,qBAAqB,CAAC,OAAO,cAAc,CAAC,OAAO,mBAAmB,CAAC,KAAK,MAAM,MAAM,MAAM,OAAO,eAAe,CAAC,QAAQ,cAAc,CAAC,OAAO,sBAAsB,CAAC,OAAO,iBAAiB,CAAC,QAAQ,cAAc,CAAC,QAAQ,eAAe,CAAC,MAAM,OAAO,0BAA0B,CAAC,OAAO,0BAA0B,CAAC,OAAO,2BAA2B,CAAC,OAAO,0BAA0B,CAAC,OAAO,cAAc,CAAC,OAAO,cAAc,CAAC,OAAO,kBAAkB,CAAC,OAAO,kBAAkB,CAAC,OAAO,sBAAsB,CAAC,OAAO,sBAAsB,CAAC,OAAO,wBAAwB,CAAC,OAAO,gBAAgB,CAAC,OAAO,gBAAgB,CAAC,OAAO,gBAAgB,CAAC,OAAO,gBAAgB,CAAC,OAAO,oBAAoB,CAAC,QAAQ,sCAAsC,CAAC,OAAO,oCAAoC,CAAC,OAAO,oBAAoB,CAAC,OAAO,qBAAqB,CAAC,QAAQ,sCAAsC,CAAC,OAAO,gBAAgB,CAAC,OAAO,qBAAqB,CAAC,OAAO,gBAAgB,CAAC,QAAQ,sBAAsB,CAAC,SAAS,sBAAsB,CAAC,SAAS,sBAAsB,CAAC,SAAS,wBAAwB,CAAC,OAAO,eAAe,CAAC,OAAO,wBAAwB,CAAC,OAAO,oBAAoB,CAAC,MAAM,qBAAqB,CAAC,QAAQ,qBAAqB,CAAC,QAAQ,mCAAmC,CAAC,OAAO,mBAAmB,CAAC,OAAO,yBAAyB,CAAC,QAAQ,aAAa,CAAC,IAAI,OAAO,WAAW,CAAC,IAAI,KAAK,MAAM,MAAM,IAAI,KAAK,OAAO,mBAAmB,CAAC,OAAO,iBAAiB,CAAC,IAAI,MAAM,MAAM,OAAO,6BAA6B,CAAC,OAAO,qBAAqB,CAAC,QAAQ,aAAa,CAAC,OAAO,kBAAkB,CAAC,OAAO,aAAa,CAAC,OAAO,cAAc,CAAC,QAAQ,aAAa,CAAC,QAAQ,gBAAgB,CAAC,IAAI,OAAO,oBAAoB,CAAC,OAAO,cAAc,CAAC,QAAQ,cAAc,CAAC,QAAQ,gBAAgB,CAAC,OAAO,aAAa,CAAC,OAAO,kBAAkB,CAAC,OAAO,kBAAkB,CAAC,MAAM,mBAAmB,CAAC,OAAO,eAAe,CAAC,OAAO,oBAAoB,CAAC,MAAM,QAAQ,wBAAwB,CAAC,MAAM,QAAQ,oBAAoB,CAAC,MAAM,QAAQ,oBAAoB,CAAC,MAAM,QAAQ,uBAAuB,CAAC,MAAM,QAAQ,qBAAqB,CAAC,OAAO,gBAAgB,CAAC,OAAO,oBAAoB,CAAC,MAAM,OAAO,mCAAmC,CAAC,OAAO,qBAAqB,CAAC,MAAM,QAAQ,iBAAiB,CAAC,OAAO,cAAc,CAAC,OAAO,cAAc,CAAC,OAAO,cAAc,CAAC,OAAO,cAAc,CAAC,OAAO,mBAAmB,CAAC,MAAM,OAAO,OAAO,cAAc,CAAC,OAAO,iBAAiB,CAAC,MAAM,OAAO,iBAAiB,CAAC,OAAO,gBAAgB,CAAC,MAAM,iBAAiB,CAAC,OAAO,iBAAiB,CAAC,OAAO,iBAAiB,CAAC,OAAO,kBAAkB,CAAC,OAAO,oBAAoB,CAAC,SAAS,cAAc,CAAC,OAAO,0BAA0B,CAAC,kBCA9xyBD,EAAOC,QAAU,CAAC,2BAA2B,CAAC,MAAM,yBAAyB,CAAC,MAAM,uBAAuB,CAAC,QAAQ,0BAA0B,CAAC,WAAW,8BAA8B,CAAC,eAAe,0BAA0B,CAAC,WAAW,2BAA2B,CAAC,OAAO,4BAA4B,CAAC,QAAQ,4BAA4B,CAAC,QAAQ,mBAAmB,CAAC,QAAQ,2BAA2B,CAAC,OAAO,wBAAwB,CAAC,SAAS,uBAAuB,CAAC,QAAQ,8BAA8B,CAAC,SAAS,6BAA6B,CAAC,SAAS,0BAA0B,CAAC,SAAS,0BAA0B,CAAC,SAAS,yBAAyB,CAAC,SAAS,uBAAuB,CAAC,MAAM,uBAAuB,CAAC,OAAO,2BAA2B,CAAC,YAAY,0BAA0B,CAAC,OAAO,uBAAuB,CAAC,QAAQ,uBAAuB,CAAC,SAAS,yBAAyB,CAAC,KAAK,QAAQ,uBAAuB,CAAC,QAAQ,4BAA4B,CAAC,aAAa,uBAAuB,CAAC,QAAQ,kBAAkB,CAAC,OAAO,sBAAsB,CAAC,OAAO,sBAAsB,CAAC,OAAO,yBAAyB,CAAC,OAAO,uBAAuB,CAAC,WAAW,sBAAsB,CAAC,OAAO,sBAAsB,CAAC,OAAO,kBAAkB,CAAC,OAAO,mBAAmB,CAAC,MAAM,oBAAoB,CAAC,SAAS,0BAA0B,CAAC,OAAO,wBAAwB,CAAC,MAAM,SAAS,oBAAoB,CAAC,SAAS,sBAAsB,CAAC,OAAO,2BAA2B,CAAC,MAAM,MAAM,OAAO,qCAAqC,CAAC,OAAO,sBAAsB,CAAC,SAAS,yBAAyB,CAAC,KAAK,OAAO,mBAAmB,CAAC,OAAO,OAAO,oBAAoB,CAAC,SAAS,0BAA0B,CAAC,UAAU,sBAAsB,CAAC,UAAU,sBAAsB,CAAC,OAAO,uBAAuB,CAAC,WAAW,2BAA2B,CAAC,OAAO,6BAA6B,CAAC,OAAO,uBAAuB,CAAC,QAAQ,4BAA4B,CAAC,eAAe,mBAAmB,CAAC,OAAO,0BAA0B,CAAC,QAAQ,0BAA0B,CAAC,KAAK,KAAK,MAAM,yBAAyB,CAAC,UAAU,mBAAmB,CAAC,QAAQ,qCAAqC,CAAC,SAAS,2BAA2B,CAAC,YAAY,4BAA4B,CAAC,SAAS,uBAAuB,CAAC,QAAQ,0BAA0B,CAAC,QAAQ,0BAA0B,CAAC,QAAQ,uBAAuB,CAAC,QAAQ,mBAAmB,CAAC,MAAM,QAAQ,kBAAkB,CAAC,OAAO,OAAO,qBAAqB,CAAC,MAAM,OAAO,kBAAkB,CAAC,OAAO,sBAAsB,CAAC,MAAM,wBAAwB,CAAC,MAAM,mBAAmB,CAAC,OAAO,2BAA2B,CAAC,MAAM,MAAM,MAAM,MAAM,KAAK,OAAO,QAAQ,MAAM,MAAM,OAAO,MAAM,SAAS,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,MAAM,UAAU,kBAAkB,CAAC,OAAO,gCAAgC,CAAC,OAAO,kBAAkB,CAAC,OAAO,wBAAwB,CAAC,SAAS,sBAAsB,CAAC,SAAS,UAAU,SAAS,UAAU,mBAAmB,CAAC,QAAQ,8BAA8B,CAAC,QAAQ,kCAAkC,CAAC,OAAO,kBAAkB,CAAC,OAAO,4BAA4B,CAAC,OAAO,4BAA4B,CAAC,MAAM,OAAO,yBAAyB,CAAC,OAAO,qBAAqB,CAAC,OAAO,yBAAyB,CAAC,MAAM,OAAO,8BAA8B,CAAC,OAAO,oBAAoB,CAAC,MAAM,6BAA6B,CAAC,MAAM,wBAAwB,CAAC,OAAO,uBAAuB,CAAC,OAAO,2BAA2B,CAAC,WAAW,sBAAsB,CAAC,OAAO,sBAAsB,CAAC,OAAO,yBAAyB,CAAC,KAAK,MAAM,MAAM,6BAA6B,CAAC,SAAS,uBAAuB,CAAC,WAAW,wBAAwB,CAAC,QAAQ,sBAAsB,CAAC,MAAM,OAAO,0BAA0B,CAAC,OAAO,sCAAsC,CAAC,OAAO,iCAAiC,CAAC,MAAM,sCAAsC,CAAC,OAAO,+BAA+B,CAAC,MAAM,4BAA4B,CAAC,QAAQ,+BAA+B,CAAC,OAAO,4BAA4B,CAAC,QAAQ,gCAAgC,CAAC,OAAO,4BAA4B,CAAC,OAAO,uBAAuB,CAAC,OAAO,sBAAsB,CAAC,OAAO,sBAAsB,CAAC,OAAO,kBAAkB,CAAC,OAAO,uBAAuB,CAAC,QAAQ,8BAA8B,CAAC,OAAO,+BAA+B,CAAC,OAAO,8BAA8B,CAAC,OAAO,+BAA+B,CAAC,OAAO,kBAAkB,CAAC,OAAO,wBAAwB,CAAC,UAAU,yBAAyB,CAAC,WAAW,qCAAqC,CAAC,UAAU,0CAA0C,CAAC,UAAU,sBAAsB,CAAC,OAAO,oBAAoB,CAAC,MAAM,SAAS,uBAAuB,CAAC,MAAM,QAAQ,2BAA2B,CAAC,MAAM,iCAAiC,CAAC,OAAO,mBAAmB,CAAC,QAAQ,uBAAuB,CAAC,SAAS,sBAAsB,CAAC,OAAO,uBAAuB,CAAC,QAAQ,uBAAuB,CAAC,QAAQ,uBAAuB,CAAC,WAAW,sBAAsB,CAAC,MAAM,aAAa,yBAAyB,CAAC,OAAO,+BAA+B,CAAC,OAAO,mBAAmB,CAAC,QAAQ,mBAAmB,CAAC,QAAQ,uBAAuB,CAAC,QAAQ,qBAAqB,CAAC,OAAO,+BAA+B,CAAC,UAAU,iCAAiC,CAAC,MAAM,2BAA2B,CAAC,QAAQ,mBAAmB,CAAC,QAAQ,qBAAqB,CAAC,OAAO,qBAAqB,CAAC,OAAO,uBAAuB,CAAC,QAAQ,2BAA2B,CAAC,YAAY,uBAAuB,CAAC,QAAQ,2BAA2B,CAAC,OAAO,4BAA4B,CAAC,OAAO,4BAA4B,CAAC,OAAO,0BAA0B,CAAC,OAAO,0BAA0B,CAAC,OAAO,uBAAuB,CAAC,QAAQ,wBAAwB,CAAC,QAAQ,OAAO,wBAAwB,CAAC,OAAO,kBAAkB,CAAC,MAAM,MAAM,MAAM,OAAO,sBAAsB,CAAC,OAAO,sBAAsB,CAAC,OAAO,wBAAwB,CAAC,OAAO,uBAAuB,CAAC,OAAO,QAAQ,uBAAuB,CAAC,QAAQ,qBAAqB,CAAC,OAAO,QAAQ,OAAO,OAAO,mBAAmB,CAAC,QAAQ,sBAAsB,CAAC,OAAO,kBAAkB,CAAC,OAAO,aAAa,CAAC,SAAS,cAAc,CAAC,OAAO,YAAY,CAAC,OAAO,cAAc,CAAC,KAAK,OAAO,aAAa,CAAC,MAAM,OAAO,MAAM,OAAO,mBAAmB,CAAC,QAAQ,YAAY,CAAC,QAAQ,YAAY,CAAC,MAAM,QAAQ,aAAa,CAAC,OAAO,MAAM,OAAO,MAAM,MAAM,OAAO,YAAY,CAAC,MAAM,MAAM,MAAM,QAAQ,YAAY,CAAC,OAAO,aAAa,CAAC,OAAO,YAAY,CAAC,OAAO,aAAa,CAAC,QAAQ,aAAa,CAAC,QAAQ,WAAW,CAAC,MAAM,kBAAkB,CAAC,OAAO,WAAW,CAAC,OAAO,WAAW,CAAC,OAAO,YAAY,CAAC,QAAQ,aAAa,CAAC,SAAS,aAAa,CAAC,OAAO,aAAa,CAAC,QAAQ,aAAa,CAAC,QAAQ,YAAY,CAAC,OAAO,YAAY,CAAC,OAAO,kBAAkB,CAAC,QAAQ,YAAY,CAAC,OAAO,aAAa,CAAC,QAAQ,cAAc,CAAC,MAAM,YAAY,CAAC,OAAO,aAAa,CAAC,QAAQ,sBAAsB,CAAC,SAAS,aAAa,CAAC,QAAQ,sBAAsB,CAAC,SAAS,cAAc,CAAC,QAAQ,aAAa,CAAC,QAAQ,YAAY,CAAC,OAAO,YAAY,CAAC,OAAO,YAAY,CAAC,MAAM,QAAQ,aAAa,CAAC,OAAO,MAAM,OAAO,YAAY,CAAC,OAAO,aAAa,CAAC,OAAO,YAAY,CAAC,OAAO,YAAY,CAAC,MAAM,OAAO,YAAY,CAAC,OAAO,aAAa,CAAC,QAAQ,aAAa,CAAC,QAAQ,YAAY,CAAC,OAAO,aAAa,CAAC,QAAQ,aAAa,CAAC,QAAQ,aAAa,CAAC,QAAQ,YAAY,CAAC,OAAO,aAAa,CAAC,QAAQ,YAAY,CAAC,OAAO,YAAY,CAAC,OAAO,gBAAgB,CAAC,MAAM,QAAQ,YAAY,CAAC,OAAO,aAAa,CAAC,MAAM,QAAQ,gBAAgB,CAAC,OAAO,aAAa,CAAC,QAAQ,YAAY,CAAC,OAAO,mCAAmC,CAAC,4BAA4B,iBAAiB,CAAC,SAAS,iCAAiC,CAAC,SAAS,0CAA0C,CAAC,SAAS,yBAAyB,CAAC,SAAS,iBAAiB,CAAC,MAAM,QAAQ,YAAY,CAAC,OAAO,kBAAkB,CAAC,QAAQ,oBAAoB,CAAC,OAAO,aAAa,CAAC,MAAM,QAAQ,aAAa,CAAC,MAAM,OAAO,QAAQ,YAAY,CAAC,OAAO,YAAY,CAAC,OAAO,iBAAiB,CAAC,QAAQ,iBAAiB,CAAC,QAAQ,qBAAqB,CAAC,SAAS,YAAY,CAAC,OAAO,aAAa,CAAC,MAAM,QAAQ,mBAAmB,CAAC,QAAQ,SAAS,wBAAwB,CAAC,QAAQ,iBAAiB,CAAC,QAAQ,SAAS,gBAAgB,CAAC,MAAM,QAAQ,iBAAiB,CAAC,QAAQ,sBAAsB,CAAC,WAAW,YAAY,gBAAgB,CAAC,MAAM,OAAO,oBAAoB,CAAC,SAAS,aAAa,WAAW,CAAC,OAAO,WAAW,CAAC,OAAO,YAAY,CAAC,OAAO,MAAM,SAAS,YAAY,CAAC,QAAQ,WAAW,CAAC,OAAO,YAAY,CAAC,QAAQ,gBAAgB,CAAC,WAAW,MAAM,cAAc,CAAC,OAAO,WAAW,CAAC,OAAO,UAAU,CAAC,MAAM,aAAa,CAAC,MAAM,OAAO,OAAO,MAAM,OAAO,MAAM,KAAK,OAAO,gBAAgB,CAAC,OAAO,WAAW,CAAC,QAAQ,YAAY,CAAC,OAAO,OAAO,YAAY,CAAC,QAAQ,YAAY,CAAC,OAAO,OAAO,YAAY,CAAC,QAAQ,cAAc,CAAC,SAAS,QAAQ,4BAA4B,CAAC,OAAO,aAAa,CAAC,IAAI,KAAK,OAAO,MAAM,KAAK,MAAM,cAAc,CAAC,OAAO,gBAAgB,CAAC,MAAM,OAAO,QAAQ,aAAa,CAAC,SAAS,WAAW,CAAC,OAAO,WAAW,CAAC,QAAQ,YAAY,CAAC,OAAO,OAAO,aAAa,CAAC,MAAM,QAAQ,cAAc,CAAC,OAAO,aAAa,CAAC,QAAQ,aAAa,CAAC,QAAQ,aAAa,CAAC,QAAQ,oBAAoB,CAAC,OAAO,aAAa,CAAC,QAAQ,YAAY,CAAC,OAAO,QAAQ,YAAY,CAAC,MAAM,QAAQ,aAAa,CAAC,MAAM,YAAY,CAAC,MAAM,OAAO,QAAQ,aAAa,CAAC,OAAO,MAAM,MAAM,MAAM,OAAO,YAAY,CAAC,OAAO,kBAAkB,CAAC,KAAK,OAAO,aAAa,CAAC,mBCEjzS,SAAS0E,EAAOuC,EAAK8D,GACnB,IAAK9D,EACH,MAAM,IAAI1G,MAAMwK,GAAO,oBAJ3BhL,EAAOC,QAAU0E,EAOjBA,EAAOiC,MAAQ,SAAqBoX,EAAG9L,EAAGlH,GACxC,GAAIgT,GAAK9L,EACP,MAAM,IAAI1R,MAAMwK,GAAQ,qBAAuBgT,EAAI,OAAS9L,+BCPhE,IAAIo7D,EAAQrtE,EAkCZ,SAASq4F,EAAMhlF,GACb,OAAoB,IAAhBA,EAAKzQ,OACA,IAAMyQ,EAENA,EAIX,SAAS6kF,EAAMntF,GAEb,IADA,IAAIjH,EAAM,GACD6I,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,IAC9B7I,GAAOu0F,EAAMttF,EAAI4B,GAAGY,SAAS,KAC/B,OAAOzJ,EAdTupE,EAAM78D,QA9BN,SAAiBzF,EAAKhJ,GACpB,GAAIiB,MAAMC,QAAQ8H,GAChB,OAAOA,EAAI7G,QACb,IAAK6G,EACH,MAAO,GACT,IAAIjH,EAAM,GACV,GAAmB,iBAARiH,EAAkB,CAC3B,IAAK,IAAI4B,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,IAC9B7I,EAAI6I,GAAc,EAAT5B,EAAI4B,GACf,OAAO7I,EAET,GAAY,QAAR/B,EAIF,KAHAgJ,EAAMA,EAAImE,QAAQ,eAAgB,KAC1BtM,OAAS,GAAM,IACrBmI,EAAM,IAAMA,GACL4B,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,GAAK,EACnC7I,EAAIuC,KAAKu5B,SAAS70B,EAAI4B,GAAK5B,EAAI4B,EAAI,GAAI,UAEzC,IAASA,EAAI,EAAGA,EAAI5B,EAAInI,OAAQ+J,IAAK,CACnC,IAAImF,EAAI/G,EAAI4E,WAAWhD,GACnBqJ,EAAKlE,GAAK,EACVsC,EAAS,IAAJtC,EACLkE,EACFlS,EAAIuC,KAAK2P,EAAI5B,GAEbtQ,EAAIuC,KAAK+N,GAGf,OAAOtQ,GAUTupE,EAAMgrB,MAAQA,EAQdhrB,EAAM6qB,MAAQA,EAEd7qB,EAAMhrE,OAAS,SAAgBwzB,EAAK9zB,GAClC,MAAY,QAARA,EACKm2F,EAAMriE,GAENA,wCCvDPwkF,EAAM,EAAQ,MACdC,EAAa,EAAQ,MACrBC,EAAW,EAAQ,MAEnBC,EAAc,WAs6BlB,SAASC,EAAenuG,EAAK3J,EAAQqM,GACnC,IAAK,IAAIrC,EAAIhK,EAAQgK,EAAIqC,EAAKrC,IAAKL,EAAIK,GAAK,EAG9C,SAAS+tG,EAAW1qG,EAAM1D,EAAK3J,GAC7B2J,EAAIq/B,cAAcv5B,KAAK6gB,OAAOjjB,EAAK+oB,UAAYyhF,GAAe,KAAO73G,GAGvE,SAASg4G,EAAa3qG,EAAM1D,EAAK3J,GAE/B2J,EAAI0xC,YAAY5rC,KAAK6gB,OAAOjjB,EAAK+oB,UAAYyhF,GAAe,KAAO73G,EAAQ,GAI7E,SAASi4G,EAAc1zG,EAAKoF,EAAK3J,GAC/B2J,EAAIoD,cAAc0C,KAAK6gB,MAAM/rB,GAAO,MAAavE,GACjD2J,EAAIoD,cAAc0C,KAAK6gB,MAAY,IAAN/rB,EAAY,KAAO,MAAavE,EAAS,GAQxE,SAASk4G,EAAar9E,EAAMlxB,EAAK3J,GAC1B66B,IAAMA,EAAO,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAC3C,IAAK,IAAI7wB,EAAI,EAAGA,EAAI6wB,EAAK56B,OAAQ+J,IAC/BiuG,EAAap9E,EAAK7wB,GAAIL,EAAK3J,EAAa,EAAJgK,GAUxC,SAASmuG,EAAYxuG,GAEnB,IADA,IAAIkxB,EAAO,IAAIx6B,MAAMsJ,EAAI1J,OAAS,GACzB+J,EAAI,EAAGA,EAAI6wB,EAAK56B,OAAQ+J,IAAK6wB,EAAK7wB,GAAKouG,EAAYzuG,EAAS,EAAJK,GACjE,OAAO6wB,EAGT,SAASw9E,EAAY1uG,EAAK3J,GAExB,OAAO,IAAI4L,KAAiC,IAA5BjC,EAAI0rD,WAAWr1D,EAAQ,GAAY63G,GAGrD,SAASS,EAAU3uG,EAAK3J,GACtB,OAAO,IAAI4L,KAAgC,IAA3BjC,EAAImiC,aAAa9rC,GAAiB63G,GAGpD,SAASO,EAAazuG,EAAK3J,GACzB,OAAO2J,EAAIe,aAAa1K,GAAU2J,EAAIe,aAAa1K,EAAS,GAAK,MAGnE,SAASu4G,EAAa5uG,EAAK3J,GACzB,OAAO2J,EAAI3J,GAAU2J,EAAI3J,EAAS,GAAK,IAGzC,SAASw4G,EAAY7uG,EAAK3J,EAAQC,GAChC,IAAI+J,EACJ,IAAKA,EAAI,EAAGA,EAAI/J,GACU,IAApB0J,EAAI3J,EAASgK,GADKA,KAKxB,OAAOL,EAAIiB,SAAS,OAAQ5K,EAAQA,EAASgK,GAh+B/C3M,EAAQo7G,UAAY,GACJ,CACd,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,OACA,QAEQ92G,SAAQ,SAAUgF,GAC1BtJ,EAAQo7G,UAAU9xG,IAAQ,KAG5BtJ,EAAQq7G,KAAO,GACfr7G,EAAQq7G,KAAKh5G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQq7G,KAAKx8E,eAAey8E,IACzE,IAAIC,EAASD,EAAIE,kBAAoB,GACrClvG,EAAI/H,MAAM+2G,EAAIG,MAAO,EAAG,EAAG,SAC3BnvG,EAAIq/B,cAAc2vE,EAAII,aAAc,GACpC,IAAK,IAAI/uG,EAAI,EAAGA,EAAI4uG,EAAO34G,OAAQ+J,IAAKL,EAAI/H,MAAMg3G,EAAO5uG,GAAI,EAAS,EAAJA,EAAQ,EAAG,SAE7E,OADA3M,EAAQq7G,KAAKh5G,OAAO2B,MAAQ,EAAoB,EAAhBu3G,EAAO34G,OAChC0J,GAETtM,EAAQq7G,KAAKp5G,OAAS,SAAUqK,EAAK3J,GAKnC,IAHA,IAAI84G,GADJnvG,EAAMA,EAAIpI,MAAMvB,IACA4K,SAAS,QAAS,EAAG,GACjCq6E,EAAUt7E,EAAImiC,aAAa,GAC3B+sE,EAAmB,GACd7uG,EAAI,EAAGA,EAAIL,EAAI1J,OAAQ+J,GAAK,EAAG6uG,EAAiBn1G,KAAKiG,EAAIiB,SAAS,QAASZ,EAAGA,EAAI,IAC3F,MAAO,CACL8uG,MAAOA,EACPC,aAAc9zB,EACd4zB,iBAAkBA,IAGtBx7G,EAAQq7G,KAAKx8E,eAAiB,SAAUy8E,GACtC,OAAO,EAA0C,GAArCA,EAAIE,kBAAoB,IAAI54G,QAG1C5C,EAAQ27G,KAAO,GACf37G,EAAQ27G,KAAKt5G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAkBxC,OAjBA2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IAC7Cq2G,EAAUY,EAAIM,OAAS,IAAIrtG,KAAQjC,EAAK,GACxCouG,EAAUY,EAAIO,OAAS,IAAIttG,KAAQjC,EAAK,GACxCA,EAAIq/B,cAAc2vE,EAAIQ,WAAa,EAAG,GACtCxvG,EAAIq/B,cAAc2vE,EAAIv6C,UAAY,EAAG,IACrC65C,EAAaU,EAAIS,eAAiB,EAAGzvG,EAAK,IAi3B5C,SAAuBpF,EAAKoF,EAAK3J,GAC/B2J,EAj3B4C,IAi3B9B8F,KAAK6gB,MAAM/rB,GAAO,IAChCoF,EAAI3J,IAAcyP,KAAK6gB,MAAY,IAAN/rB,GAAa,IAl3B1C80G,CAAaV,EAAIW,iBAAmB,EAAG3vG,GACvCmuG,EAAcnuG,EAAK,GAAI,IACvBuuG,EAAYS,EAAIY,OAAQ5vG,EAAK,IAC7BA,EAAIq/B,cAAc2vE,EAAIa,aAAe,EAAG,IACxC7vG,EAAIq/B,cAAc2vE,EAAIc,iBAAmB,EAAG,IAC5C9vG,EAAIq/B,cAAc2vE,EAAIe,YAAc,EAAG,IACvC/vG,EAAIq/B,cAAc2vE,EAAIgB,eAAiB,EAAG,IAC1ChwG,EAAIq/B,cAAc2vE,EAAIiB,mBAAqB,EAAG,IAC9CjwG,EAAIq/B,cAAc2vE,EAAItC,aAAe,EAAG,IACxC1sG,EAAIq/B,cAAc2vE,EAAIkB,aAAe,EAAG,IACxCx8G,EAAQ27G,KAAKt5G,OAAO2B,MAAQ,GACrBsI,GAETtM,EAAQ27G,KAAK15G,OAAS,SAAUqK,EAAK3J,GAEnC,MAAO,CACLi5G,MAAOX,EAFT3uG,EAAMA,EAAIpI,MAAMvB,GAEO,GACrBk5G,MAAOZ,EAAS3uG,EAAK,GACrBwvG,UAAWxvG,EAAImiC,aAAa,GAC5BsyB,SAAUz0D,EAAImiC,aAAa,IAC3BstE,cAAehB,EAAYzuG,EAAK,IAChC2vG,gBAAiBf,EAAY5uG,EAAK,IAClC4vG,OAAQpB,EAAWxuG,EAAIpI,MAAM,GAAI,KACjCi4G,YAAa7vG,EAAImiC,aAAa,IAC9B2tE,gBAAiB9vG,EAAImiC,aAAa,IAClC4tE,WAAY/vG,EAAImiC,aAAa,IAC7B6tE,cAAehwG,EAAImiC,aAAa,IAChC8tE,kBAAmBjwG,EAAImiC,aAAa,IACpCuqE,YAAa1sG,EAAImiC,aAAa,IAC9B+tE,YAAalwG,EAAImiC,aAAa,MAGlCzuC,EAAQ27G,KAAK98E,eAAiB,SAAUy8E,GACtC,OAAO,IAGTt7G,EAAQy8G,KAAO,GACfz8G,EAAQy8G,KAAKp6G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAexC,OAdA2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IAC7Cq2G,EAAUY,EAAIM,OAAS,IAAIrtG,KAAQjC,EAAK,GACxCouG,EAAUY,EAAIO,OAAS,IAAIttG,KAAQjC,EAAK,GACxCA,EAAIq/B,cAAc2vE,EAAIoB,SAAW,EAAG,GACpCjC,EAAcnuG,EAAK,GAAI,IACvBA,EAAIq/B,cAAc2vE,EAAIv6C,UAAY,EAAG,IACrC05C,EAAcnuG,EAAK,GAAI,IACvBA,EAAIoD,cAAc4rG,EAAIqB,OAAS,EAAG,IAClCrwG,EAAIoD,cAAc4rG,EAAIsB,gBAAkB,EAAG,IAC3CtwG,EAAIoD,cAAc4rG,EAAIuB,QAAU,EAAG,IACnChC,EAAYS,EAAIY,OAAQ5vG,EAAK,IAC7BA,EAAIq/B,cAAc2vE,EAAIwB,YAAc,EAAG,IACvCxwG,EAAIq/B,cAAc2vE,EAAIyB,aAAe,EAAG,IACxC/8G,EAAQy8G,KAAKp6G,OAAO2B,MAAQ,GACrBsI,GAETtM,EAAQy8G,KAAKx6G,OAAS,SAAUqK,EAAK3J,GAEnC,MAAO,CACLi5G,MAAOX,EAFT3uG,EAAMA,EAAIpI,MAAMvB,GAEO,GACrBk5G,MAAOZ,EAAS3uG,EAAK,GACrBowG,QAASpwG,EAAImiC,aAAa,GAC1BsyB,SAAUz0D,EAAImiC,aAAa,IAC3BkuE,MAAOrwG,EAAIe,aAAa,IACxBuvG,eAAgBtwG,EAAIe,aAAa,IACjCwvG,OAAQvwG,EAAIe,aAAa,IACzB6uG,OAAQpB,EAAWxuG,EAAIpI,MAAM,GAAI,KACjC44G,WAAYxwG,EAAImiC,aAAa,IAC7BsuE,YAAazwG,EAAImiC,aAAa,MAGlCzuC,EAAQy8G,KAAK59E,eAAiB,SAAUy8E,GACtC,OAAO,IAGTt7G,EAAQg9G,KAAO,GACfh9G,EAAQg9G,KAAK36G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC,OAAoB,IAAhB24G,EAAI1zB,SACNt7E,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IAC7Cs2G,EAAYW,EAAIM,OAAS,IAAIrtG,KAAQjC,EAAK,GAC1CquG,EAAYW,EAAIO,OAAS,IAAIttG,KAAQjC,EAAK,GAC1CA,EAAIq/B,cAAc2vE,EAAIQ,WAAa,EAAG,IAEtCxvG,EAAI0xC,YAAYs9D,EAAIv6C,UAAY,EAAG,GAAI,GACvCz0D,EAAIoD,cAAc4rG,EAAI2B,UAAY,EAAG,IACrC3wG,EAAIoD,cAAc4rG,EAAI4B,SAAW,EAAG,IACpCl9G,EAAQg9G,KAAK36G,OAAO2B,MAAQ,GACrBsI,IAGTA,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IAC7Cq2G,EAAUY,EAAIM,OAAS,IAAIrtG,KAAQjC,EAAK,GACxCouG,EAAUY,EAAIO,OAAS,IAAIttG,KAAQjC,EAAK,GACxCA,EAAIq/B,cAAc2vE,EAAIQ,WAAa,EAAG,GACtCxvG,EAAIq/B,cAAc2vE,EAAIv6C,UAAY,EAAG,IACrCz0D,EAAIoD,cAAc4rG,EAAI2B,UAAY,EAAG,IACrC3wG,EAAIoD,cAAc4rG,EAAI4B,SAAW,EAAG,IACpCl9G,EAAQg9G,KAAK36G,OAAO2B,MAAQ,GACrBsI,IAGTtM,EAAQg9G,KAAK/6G,OAAS,SAAUqK,EAAK3J,EAAQqM,GAM3C,OALA1C,EAAMA,EAAIpI,MAAMvB,GAEAqM,EAAMrM,GAAY,GAIzB,CACLi5G,MAAOZ,EAAW1uG,EAAK,GACvBuvG,MAAOb,EAAW1uG,EAAK,GACvBwvG,UAAWxvG,EAAImiC,aAAa,IAE5BsyB,SAAUz0D,EAAI0rD,WAAW,GAAI,GAC7BilD,SAAU3wG,EAAIe,aAAa,IAC3B6vG,QAAS5wG,EAAIe,aAAa,KAIvB,CACLuuG,MAAOX,EAAS3uG,EAAK,GACrBuvG,MAAOZ,EAAS3uG,EAAK,GACrBwvG,UAAWxvG,EAAImiC,aAAa,GAC5BsyB,SAAUz0D,EAAImiC,aAAa,IAC3BwuE,SAAU3wG,EAAIe,aAAa,IAC3B6vG,QAAS5wG,EAAIe,aAAa,MAG9BrN,EAAQg9G,KAAKn+E,eAAiB,SAAUy8E,GACtC,OAAoB,IAAhBA,EAAI1zB,QAAsB,GAEvB,IAGT5nF,EAAQm9G,KAAO,GACfn9G,EAAQm9G,KAAK96G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,IACxC2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IACzCqL,cAAc4rG,EAAI8B,cAAgB,EAAG,GACzC,IAAIC,EAAU/B,EAAI+B,SAAW,CAAC,EAAG,EAAG,GAKpC,OAJA/wG,EAAIoD,cAAc2tG,EAAQ,GAAI,GAC9B/wG,EAAIoD,cAAc2tG,EAAQ,GAAI,GAC9B/wG,EAAIoD,cAAc2tG,EAAQ,GAAI,GAC9Br9G,EAAQm9G,KAAK96G,OAAO2B,MAAQ,EACrBsI,GAETtM,EAAQm9G,KAAKl7G,OAAS,SAAUqK,EAAK3J,GAEnC,MAAO,CACLy6G,cAFF9wG,EAAMA,EAAIpI,MAAMvB,IAEI0K,aAAa,GAC/BgwG,QAAS,CAAC/wG,EAAIe,aAAa,GAAIf,EAAIe,aAAa,GAAIf,EAAIe,aAAa,MAGzErN,EAAQm9G,KAAKt+E,eAAiB,SAAUy8E,GACtC,OAAO,GAGTt7G,EAAQs9G,KAAO,GACft9G,EAAQs9G,KAAKj7G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAKxC,OAJA2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IACzCqL,cAAc4rG,EAAIiC,SAAW,EAAG,GACpC9C,EAAcnuG,EAAK,EAAG,GACtBtM,EAAQs9G,KAAKj7G,OAAO2B,MAAQ,EACrBsI,GAETtM,EAAQs9G,KAAKr7G,OAAS,SAAUqK,EAAK3J,GAEnC,MAAO,CACL46G,SAFFjxG,EAAMA,EAAIpI,MAAMvB,IAED0K,aAAa,KAG9BrN,EAAQs9G,KAAKz+E,eAAiB,SAAUy8E,GACtC,OAAO,GAGTt7G,EAAQw9G,KAAO,GACfx9G,EAAQw9G,KAAKn7G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQw9G,KAAK3+E,eAAey8E,IACzE,IAAImC,EAAUnC,EAAImC,SAAW,GAE7BnxG,EAAIq/B,cAAc8xE,EAAQ76G,OAAQ,GAGlC,IADA,IAAI86G,EAAM,EACD/wG,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAAK,CACvC,IAAIgxG,EAAQF,EAAQ9wG,GACpB0tG,EAAIh4G,OAAOs7G,EAAOrxG,EAAKoxG,GACvBA,GAAOrD,EAAIh4G,OAAO2B,MAIpB,OADAhE,EAAQw9G,KAAKn7G,OAAO2B,MAAQ05G,EACrBpxG,GAETtM,EAAQw9G,KAAKv7G,OAAS,SAAUqK,EAAK3J,EAAQqM,GAM3C,IAJA,IAAI9H,GADJoF,EAAMA,EAAIpI,MAAMvB,IACF8rC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GACpBw2G,EAAM,EAED/wG,EAAI,EAAGA,EAAIzF,EAAKyF,IAAK,CAC5B,IAAIgxG,EAAQtD,EAAIp4G,OAAOqK,EAAKoxG,EAAK1uG,GACjCyuG,EAAQ9wG,GAAKgxG,EACbD,GAAOC,EAAM/6G,OAGf,MAAO,CACL66G,QAASA,IAGbz9G,EAAQw9G,KAAK3+E,eAAiB,SAAUy8E,GACtC,IAAIsC,EAAY,EAChB,IAAKtC,EAAImC,QAAS,OAAOG,EACzB,IAAK,IAAIjxG,EAAI,EAAGA,EAAI2uG,EAAImC,QAAQ76G,OAAQ+J,IACtCixG,GAAavD,EAAIx7E,eAAey8E,EAAImC,QAAQ9wG,IAE9C,OAAOixG,GAGT59G,EAAQ69G,KAAO79G,EAAQ89G,kBAAoB,GAC3C99G,EAAQ89G,kBAAkBz7G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAGrD83G,EAFAnuG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQ89G,kBAAkBj/E,eAAey8E,IAEnE,EAAG,GACtBhvG,EAAIoD,cAAc4rG,EAAIyC,oBAAsB,EAAG,GAC/CtD,EAAcnuG,EAAK,EAAG,IACtBA,EAAIoD,cAAc4rG,EAAInlG,OAAS,EAAG,IAClC7J,EAAIoD,cAAc4rG,EAAI0C,QAAU,EAAG,IACnC1xG,EAAIq/B,cAAc2vE,EAAI2C,aAAe,QAAU,IAC/C3xG,EAAIq/B,cAAc2vE,EAAI4C,aAAe,QAAU,IAC/CzD,EAAcnuG,EAAK,GAAI,IACvBA,EAAIoD,cAAc4rG,EAAI6C,YAAc,EAAG,IACvC,IAAIC,EAAiB9C,EAAI8C,gBAAkB,GACvCC,EAAUjsG,KAAK/D,IAAI+vG,EAAex7G,OAAQ,IAC9C0J,EAAI00C,WAAWq9D,EAAS,IACxB/xG,EAAI/H,MAAM65G,EAAgB,GAAIC,EAAS,QACvC/xG,EAAIoD,cAAc4rG,EAAI7pF,OAAS,GAAM,IACrCnlB,EAAIq8B,cAAc,EAAG,IAErB,IAAI+0E,EAAM,IACKpC,EAAIr2G,UAAY,IACtBX,SAAQ,SAAUoC,GACzB2zG,EAAIh4G,OAAOqE,EAAO4F,EAAKoxG,GACvBA,GAAOrD,EAAIh4G,OAAO2B,SAEpBhE,EAAQ89G,kBAAkBz7G,OAAO2B,MAAQ05G,GAE3C19G,EAAQ89G,kBAAkB77G,OAAS,SAAUqK,EAAK3J,EAAQqM,GACxD1C,EAAMA,EAAIpI,MAAMvB,GAgBhB,IAfA,IAAIC,EAASoM,EAAMrM,EACf07G,EAAUjsG,KAAK/D,IAAI/B,EAAI3I,UAAU,IAAK,IACtC23G,EAAM,CACRyC,mBAAoBzxG,EAAIe,aAAa,GACrC8I,MAAO7J,EAAIe,aAAa,IACxB2wG,OAAQ1xG,EAAIe,aAAa,IACzB4wG,YAAa3xG,EAAImiC,aAAa,IAC9ByvE,YAAa5xG,EAAImiC,aAAa,IAC9B0vE,WAAY7xG,EAAIe,aAAa,IAC7B+wG,eAAgB9xG,EAAIiB,SAAS,OAAQ,GAAI,GAAK8wG,GAC9C5sF,MAAOnlB,EAAIe,aAAa,IACxBpI,SAAU,IAGRy4G,EAAM,GACH96G,EAAS86G,GAAO,GAAG,CACxB,IAAIh3G,EAAQ2zG,EAAIp4G,OAAOqK,EAAKoxG,EAAK96G,GACjC04G,EAAIr2G,SAASoB,KAAKK,GAClB40G,EAAI50G,EAAM4C,MAAQ5C,EAClBg3G,GAAOh3G,EAAM9D,OAGf,OAAO04G,GAETt7G,EAAQ89G,kBAAkBj/E,eAAiB,SAAUy8E,GACnD,IAAI5uG,EAAM,GAKV,OAJe4uG,EAAIr2G,UAAY,IACtBX,SAAQ,SAAUoC,GACzBgG,GAAO2tG,EAAIx7E,eAAen4B,MAErBgG,GAGT1M,EAAQs+G,KAAO,GACft+G,EAAQs+G,KAAKj8G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMi3G,EAAIzuG,OAAOjK,QAExD04G,EAAIzuG,OAAOrI,KAAK8H,GAChBtM,EAAQs+G,KAAKj8G,OAAO2B,MAAQs3G,EAAIzuG,OAAOjK,QAEzC5C,EAAQs+G,KAAKr8G,OAAS,SAAUqK,EAAK3J,EAAQqM,GAG3C,MAAO,CACLuvG,WAHFjyG,EAAMA,EAAIpI,MAAMvB,EAAQqM,IAGPzB,SAAS,MAAO,EAAG,GAClCV,OAAQrK,EAAO2M,KAAK7C,KAGxBtM,EAAQs+G,KAAKz/E,eAAiB,SAAUy8E,GACtC,OAAOA,EAAIzuG,OAAOjK,QAGpB5C,EAAQw+G,KAAOx+G,EAAQy+G,iBAAmB,GAC1Cz+G,EAAQy+G,iBAAiBp8G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAGpD83G,EAFAnuG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQy+G,iBAAiB5/E,eAAey8E,IAElE,EAAG,GACtBhvG,EAAIoD,cAAc4rG,EAAIyC,oBAAsB,EAAG,GAC/CtD,EAAcnuG,EAAK,EAAG,IACtBA,EAAIoD,cAAc4rG,EAAIoD,cAAgB,EAAG,IACzCpyG,EAAIoD,cAAc4rG,EAAIqD,YAAc,GAAI,IACxClE,EAAcnuG,EAAK,GAAI,IACvBA,EAAIq/B,cAAc2vE,EAAIsD,YAAc,EAAG,IAEvC,IAAIlB,EAAM,IACKpC,EAAIr2G,UAAY,IACtBX,SAAQ,SAAUoC,GACzB2zG,EAAIh4G,OAAOqE,EAAO4F,EAAKoxG,GACvBA,GAAOrD,EAAIh4G,OAAO2B,SAEpBhE,EAAQy+G,iBAAiBp8G,OAAO2B,MAAQ05G,GAE1C19G,EAAQy+G,iBAAiBx8G,OAAS,SAAUqK,EAAK3J,EAAQqM,GAYvD,IAVA,IAAIpM,EAASoM,EAAMrM,EACf24G,EAAM,CACRyC,oBAHFzxG,EAAMA,EAAIpI,MAAMvB,EAAQqM,IAGE3B,aAAa,GACrCqxG,aAAcpyG,EAAIe,aAAa,IAC/BsxG,WAAYryG,EAAIe,aAAa,IAC7BuxG,WAAYtyG,EAAImiC,aAAa,IAC7BxpC,SAAU,IAGRy4G,EAAM,GACH96G,EAAS86G,GAAO,GAAG,CACxB,IAAIh3G,EAAQ2zG,EAAIp4G,OAAOqK,EAAKoxG,EAAK96G,GACjC04G,EAAIr2G,SAASoB,KAAKK,GAClB40G,EAAI50G,EAAM4C,MAAQ5C,EAClBg3G,GAAOh3G,EAAM9D,OAGf,OAAO04G,GAETt7G,EAAQy+G,iBAAiB5/E,eAAiB,SAAUy8E,GAClD,IAAI5uG,EAAM,GAKV,OAJe4uG,EAAIr2G,UAAY,IACtBX,SAAQ,SAAUoC,GACzBgG,GAAO2tG,EAAIx7E,eAAen4B,MAErBgG,GAGT1M,EAAQ6+G,KAAO,GACf7+G,EAAQ6+G,KAAKx8G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMi3G,EAAIzuG,OAAOjK,QAExD04G,EAAIzuG,OAAOrI,KAAK8H,EAAK,GACrBtM,EAAQ6+G,KAAKx8G,OAAO2B,MAAQs3G,EAAIzuG,OAAOjK,QAEzC5C,EAAQ6+G,KAAK58G,OAAS,SAAUqK,EAAK3J,EAAQqM,GAC3C1C,EAAMA,EAAIpI,MAAMvB,EAAQqM,GAExB,IAAI0uD,EAAO48C,EAAWA,WAAWr4G,OAAOqK,EAAK,EAAGA,EAAI1J,QAEhDk8G,GADwB,iBAAjBphD,EAAKqhD,QAA8BrhD,EAAO,IACvCshD,yBAA2B,GACrCC,EAAMH,EAAIG,KAAO,EACjBC,EAAMJ,EAAIK,oBACVC,EAAcF,GAAiC,IAA1BA,EAAIryG,OAAOlJ,UAAU,KAAc,EAAI,EAE5D46G,EAAY,KAQhB,OAPIU,IACFV,EAAYU,EAAI1xG,SAAS,IACrB6xG,IACFb,GAAa,IAAMa,IAIhB,CACLb,UAAWA,EACX1xG,OAAQrK,EAAO2M,KAAK7C,EAAIpI,MAAM,MAGlClE,EAAQ6+G,KAAKhgF,eAAiB,SAAUy8E,GACtC,OAAOA,EAAIzuG,OAAOjK,QAIpB5C,EAAQq/G,KAAO,GACfr/G,EAAQq/G,KAAKh9G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC,IAAI86G,EAAUnC,EAAImC,SAAW,IAC7BnxG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQq/G,KAAKxgF,eAAey8E,KAErE3vE,cAAc,EAAG,GACrBr/B,EAAIq/B,cAAc8xE,EAAQ76G,OAAQ,GAElC,IAAK,IAAI+J,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAClCL,EAAIq/B,cAAc8xE,EAAQ9wG,GAAQ,EAAJA,EAAQ,GAIxC,OADA3M,EAAQq/G,KAAKh9G,OAAO2B,MAAQ,EAAqB,EAAjBy5G,EAAQ76G,OACjC0J,GAETtM,EAAQq/G,KAAKp9G,OAAS,SAAUqK,EAAK3J,GAMnC,IAJA,IAAIzC,GADJoM,EAAMA,EAAIpI,MAAMvB,IACD8rC,aAAa,GACxBvnC,EAAMoF,EAAImiC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GAEfyF,EAAI,EAAGA,EAAIzF,EAAKyF,IAErB8wG,EAAQ9wG,GADG,IAATzM,EACWoM,EAAImiC,aAAiB,EAAJ9hC,EAAQ,GAEzBzM,EAIjB,MAAO,CACLu9G,QAASA,IAGbz9G,EAAQq/G,KAAKxgF,eAAiB,SAAUy8E,GACtC,OAAO,EAAyB,EAArBA,EAAImC,QAAQ76G,QAGzB5C,EAAQs/G,KACRt/G,EAAQu/G,KAAO,GACfv/G,EAAQu/G,KAAKl9G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC,IAAI86G,EAAUnC,EAAImC,SAAW,IAC7BnxG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQu/G,KAAK1gF,eAAey8E,KAErE3vE,cAAc8xE,EAAQ76G,OAAQ,GAElC,IAAK,IAAI+J,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAClCL,EAAIq/B,cAAc8xE,EAAQ9wG,GAAQ,EAAJA,EAAQ,GAIxC,OADA3M,EAAQu/G,KAAKl9G,OAAO2B,MAAQ,EAAqB,EAAjBy5G,EAAQ76G,OACjC0J,GAETtM,EAAQu/G,KAAKt9G,OAAS,SAAUqK,EAAK3J,GAKnC,IAHA,IAAIuE,GADJoF,EAAMA,EAAIpI,MAAMvB,IACF8rC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GAEfyF,EAAI,EAAGA,EAAIzF,EAAKyF,IACvB8wG,EAAQ9wG,GAAKL,EAAImiC,aAAiB,EAAJ9hC,EAAQ,GAGxC,MAAO,CACL8wG,QAASA,IAGbz9G,EAAQu/G,KAAK1gF,eAAiB,SAAUy8E,GACtC,OAAO,EAAyB,EAArBA,EAAImC,QAAQ76G,QAGzB5C,EAAQw/G,KAAO,GACfx/G,EAAQw/G,KAAKn9G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC,IAAI86G,EAAUnC,EAAImC,SAAW,IAC7BnxG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQw/G,KAAK3gF,eAAey8E,KAErE3vE,cAAc8xE,EAAQ76G,OAAQ,GAElC,IAAK,IAAI+J,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAClC4tG,EAASl4G,OAAOo7G,EAAQ9wG,GAAIL,EAAS,EAAJK,EAAQ,GAI3C,OADA3M,EAAQw/G,KAAKn9G,OAAO2B,MAAQ,EAAqB,EAAjBy5G,EAAQ76G,OACjC0J,GAETtM,EAAQw/G,KAAKv9G,OAAS,SAAUqK,EAAK3J,GAKnC,IAHA,IAAIuE,GADJoF,EAAMA,EAAIpI,MAAMvB,IACF8rC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GAEfyF,EAAI,EAAGA,EAAIzF,EAAKyF,IACvB8wG,EAAQ9wG,GAAK4tG,EAASt4G,OAAOqK,EAAS,EAAJK,EAAQ,GAG5C,MAAO,CACL8wG,QAASA,IAGbz9G,EAAQw/G,KAAK3gF,eAAiB,SAAUy8E,GACtC,OAAO,EAAyB,EAArBA,EAAImC,QAAQ76G,QAGzB5C,EAAQy/G,KAAO,GACfz/G,EAAQy/G,KAAKp9G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC,IAAI86G,EAAUnC,EAAImC,SAAW,IAC7BnxG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQy/G,KAAK5gF,eAAey8E,KAErE3vE,cAAc8xE,EAAQ76G,OAAQ,GAElC,IAAK,IAAI+J,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAAK,CACvC,IAAI+wG,EAAU,EAAJ/wG,EAAQ,EAClBL,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGqmB,OAAS,EAAG0qF,GACzCpxG,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGo0D,UAAY,EAAG28C,EAAM,GAIpD,OADA19G,EAAQy/G,KAAKp9G,OAAO2B,MAAQ,EAAyB,EAArBs3G,EAAImC,QAAQ76G,OACrC0J,GAETtM,EAAQy/G,KAAKx9G,OAAS,SAAUqK,EAAK3J,GAKnC,IAHA,IAAIuE,GADJoF,EAAMA,EAAIpI,MAAMvB,IACF8rC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GAEfyF,EAAI,EAAGA,EAAIzF,EAAKyF,IAAK,CAC5B,IAAI+wG,EAAU,EAAJ/wG,EAAQ,EAClB8wG,EAAQ9wG,GAAK,CACXqmB,MAAO1mB,EAAImiC,aAAaivE,GACxB38C,SAAUz0D,EAAImiC,aAAaivE,EAAM,IAIrC,MAAO,CACLD,QAASA,IAGbz9G,EAAQy/G,KAAK5gF,eAAiB,SAAUy8E,GACtC,OAAO,EAAyB,EAArBA,EAAImC,QAAQ76G,QAGzB5C,EAAQ0/G,KAAO,GACf1/G,EAAQ0/G,KAAKr9G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC,IAAI86G,EAAUnC,EAAImC,SAAW,IAC7BnxG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQ0/G,KAAK7gF,eAAey8E,KAErE3vE,cAAc8xE,EAAQ76G,OAAQ,GAElC,IAAK,IAAI+J,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAAK,CACvC,IAAI+wG,EAAU,EAAJ/wG,EAAQ,EAClBL,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGqmB,OAAS,EAAG0qF,GACzCpxG,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGgzG,mBAAqB,EAAGjC,EAAM,GAI7D,OADA19G,EAAQ0/G,KAAKr9G,OAAO2B,MAAQ,EAAqB,EAAjBy5G,EAAQ76G,OACjC0J,GAETtM,EAAQ0/G,KAAKz9G,OAAS,SAAUqK,EAAK3J,GAKnC,IAHA,IAAIuE,GADJoF,EAAMA,EAAIpI,MAAMvB,IACF8rC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GAEfyF,EAAI,EAAGA,EAAIzF,EAAKyF,IAAK,CAC5B,IAAI+wG,EAAU,EAAJ/wG,EAAQ,EAClB8wG,EAAQ9wG,GAAK,CACXqmB,MAAO1mB,EAAImiC,aAAaivE,GACxBiC,kBAAmBrzG,EAAI6sD,YAAYukD,EAAM,IAI7C,MAAO,CACLD,QAASA,IAGbz9G,EAAQ0/G,KAAK7gF,eAAiB,SAAUy8E,GACtC,OAAO,EAAyB,EAArBA,EAAImC,QAAQ76G,QAGzB5C,EAAQ4/G,KAAO,GACf5/G,EAAQ4/G,KAAKv9G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC,IAAI86G,EAAUnC,EAAImC,SAAW,IAC7BnxG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQ4/G,KAAK/gF,eAAey8E,KAErE3vE,cAAc8xE,EAAQ76G,OAAQ,GAElC,IAAK,IAAI+J,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAAK,CACvC,IAAI+wG,EAAU,GAAJ/wG,EAAS,EACnBL,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGkzG,YAAc,EAAGnC,GAC9CpxG,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGmzG,iBAAmB,EAAGpC,EAAM,GACzDpxG,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGozG,qBAAuB,EAAGrC,EAAM,GAI/D,OADA19G,EAAQ4/G,KAAKv9G,OAAO2B,MAAQ,EAAqB,GAAjBy5G,EAAQ76G,OACjC0J,GAETtM,EAAQ4/G,KAAK39G,OAAS,SAAUqK,EAAK3J,GAKnC,IAHA,IAAIuE,GADJoF,EAAMA,EAAIpI,MAAMvB,IACF8rC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GAEfyF,EAAI,EAAGA,EAAIzF,EAAKyF,IAAK,CAC5B,IAAI+wG,EAAU,GAAJ/wG,EAAS,EACnB8wG,EAAQ9wG,GAAK,CACXkzG,WAAYvzG,EAAImiC,aAAaivE,GAC7BoC,gBAAiBxzG,EAAImiC,aAAaivE,EAAM,GACxCqC,oBAAqBzzG,EAAImiC,aAAaivE,EAAM,IAIhD,MAAO,CACLD,QAASA,IAGbz9G,EAAQ4/G,KAAK/gF,eAAiB,SAAUy8E,GACtC,OAAO,EAAyB,GAArBA,EAAImC,QAAQ76G,QAGzB5C,EAAQggH,KAAO,GACfhgH,EAAQggH,KAAK39G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQggH,KAAKnhF,eAAey8E,IACzE,IAAImC,EAAUnC,EAAImC,SAAW,GAE7BnxG,EAAIq/B,cAAc8xE,EAAQ76G,OAAQ,GAGlC,IADA,IAAI86G,EAAM,EACD/wG,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAAK,CACvC,IAAIgxG,EAAQF,EAAQ9wG,GAChBzM,GAAQy9G,EAAMrxG,IAAMqxG,EAAMrxG,IAAI1J,OAAS,GAAK,EAAI,EAEpD0J,EAAIq/B,cAAczrC,EAAMw9G,GACxBA,GAAO,EAEPpxG,EAAI/H,MAAMo5G,EAAMr0G,KAAMo0G,EAAK,EAAG,SAC9BA,GAAO,EAEHC,EAAMrxG,MACRqxG,EAAMrxG,IAAI9H,KAAK8H,EAAKoxG,GACpBA,GAAOC,EAAMrxG,IAAI1J,QAKrB,OADA5C,EAAQggH,KAAK39G,OAAO2B,MAAQ05G,EACrBpxG,GAETtM,EAAQggH,KAAK/9G,OAAS,SAAUqK,EAAK3J,GAMnC,IAJA,IAAIuE,GADJoF,EAAMA,EAAIpI,MAAMvB,IACF8rC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GACpBw2G,EAAM,EAED/wG,EAAI,EAAGA,EAAIzF,EAAKyF,IAAK,CAC5B,IAAIzM,EAAOoM,EAAImiC,aAAaivE,GACxBp0G,EAAOgD,EAAIiB,SAAS,QAASmwG,EAAM,EAAGA,EAAM,GAC5C1vG,EAAM1B,EAAIpI,MAAMw5G,EAAM,EAAGA,EAAMx9G,GACnCw9G,GAAOx9G,EAEPu9G,EAAQ9wG,GAAK,CACXrD,KAAMA,EACNgD,IAAK0B,GAIT,MAAO,CACLyvG,QAASA,IAGbz9G,EAAQggH,KAAKnhF,eAAiB,SAAUy8E,GACtC,IAAIsC,EAAY,EAChB,IAAKtC,EAAImC,QAAS,OAAOG,EACzB,IAAK,IAAIjxG,EAAI,EAAGA,EAAI2uG,EAAImC,QAAQ76G,OAAQ+J,IAAK,CAC3C,IAAIL,EAAMgvG,EAAImC,QAAQ9wG,GAAGL,IACzBsxG,IAActxG,EAAMA,EAAI1J,OAAS,GAAK,EAAI,EAE5C,OAAOg7G,GAGT59G,EAAQigH,KAAO,GACfjgH,EAAQigH,KAAK59G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC,IAAI86G,EAAUnC,EAAImC,SAAW,IAC7BnxG,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQigH,KAAKphF,eAAey8E,KAErE3vE,cAAc8xE,EAAQ76G,OAAQ,GAElC,IAAK,IAAI+J,EAAI,EAAGA,EAAI8wG,EAAQ76G,OAAQ+J,IAAK,CACvC,IAAI+wG,EAAU,GAAJ/wG,EAAS,EACnBL,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGuzG,eAAiB,EAAGxC,GACjDpxG,EAAIq/B,cAAc8xE,EAAQ9wG,GAAGwzG,WAAa,EAAGzC,EAAM,GACnD9C,EAAa6C,EAAQ9wG,GAAGyzG,WAAa,EAAG9zG,EAAKoxG,EAAM,GAIrD,OADA19G,EAAQigH,KAAK59G,OAAO2B,MAAQ,EAAqB,GAAjBy5G,EAAQ76G,OACjC0J,GAETtM,EAAQigH,KAAKh+G,OAAS,SAAUqK,EAAK3J,GAKnC,IAHA,IAAIuE,GADJoF,EAAMA,EAAIpI,MAAMvB,IACF8rC,aAAa,GACvBgvE,EAAU,IAAIz6G,MAAMkE,GAEfyF,EAAI,EAAGA,EAAIzF,EAAKyF,IAAK,CAC5B,IAAI+wG,EAAU,GAAJ/wG,EAAS,EACnB8wG,EAAQ9wG,GAAK,CACXuzG,cAAe5zG,EAAImiC,aAAaivE,GAChCyC,UAAW7zG,EAAI6sD,YAAYukD,EAAM,GACjC0C,UAAWrF,EAAYzuG,EAAKoxG,EAAM,IAItC,MAAO,CACLD,QAASA,IAGbz9G,EAAQigH,KAAKphF,eAAiB,SAAUy8E,GACtC,OAAO,EAAyB,GAArBA,EAAImC,QAAQ76G,QAGzB5C,EAAQqgH,KAAO,GACfrgH,EAAQqgH,KAAKh+G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACxC2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAMrE,EAAQqgH,KAAKxhF,eAAey8E,IAEzE,IAAI5uG,EAAM,IAAM4uG,EAAIl6G,MAAQ,IAAIwB,OAOhC,OANA0J,EAAI65C,KAAK,EAAG,EAAGz5C,GAEfJ,EAAI/H,MAAM+2G,EAAIgF,aAAe,GAAI,EAAG,EAAG,SAiMzC,SAAsB31G,EAAK2B,EAAK3J,GAC9B,IAAI49G,EAAY/9G,EAAO2M,KAAKxE,EAAK,QACjC41G,EAAU/7G,KAAK8H,EAlMkB,IAmMjCA,EAnMiC,GAmMpBi0G,EAAU39G,QAAU,EAnMjC49G,CAAYlF,EAAIl6G,MAAQ,GAAIkL,GAE5BtM,EAAQqgH,KAAKh+G,OAAO2B,MAAQ0I,EACrBJ,GAETtM,EAAQqgH,KAAKp+G,OAAS,SAAUqK,EAAK3J,EAAQqM,GAE3C,MAAO,CACLsxG,aAFFh0G,EAAMA,EAAIpI,MAAMvB,IAEG4K,SAAS,QAAS,EAAG,GACtCnM,KAAM+5G,EAAW7uG,EAAK,GAAI0C,KAG9BhP,EAAQqgH,KAAKxhF,eAAiB,SAAUy8E,GACtC,OAAO,IAAMA,EAAIl6G,MAAQ,IAAIwB,QAG/B5C,EAAQygH,KAAO,GACfzgH,EAAQygH,KAAKp+G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAKxC,OAJA2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IAEzCsnC,cAAc2vE,EAAIoF,kBAAoB,EAAG,GAC7C1gH,EAAQygH,KAAKp+G,OAAO2B,MAAQ,EACrBsI,GAETtM,EAAQygH,KAAKx+G,OAAS,SAAUqK,EAAK3J,GAEnC,MAAO,CACL+9G,kBAFFp0G,EAAMA,EAAIpI,MAAMvB,IAEQ8rC,aAAa,KAGvCzuC,EAAQygH,KAAK5hF,eAAiB,SAAUy8E,GACtC,OAAO,GAGTt7G,EAAQ2gH,KAAO,GACf3gH,EAAQ2gH,KAAKt+G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GASxC,OARA2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,KAEzCsnC,cAAc2vE,EAAIoB,SAAW,EAAG,GACpCpwG,EAAIq/B,cAAc2vE,EAAIsF,+BAAiC,EAAG,GAC1Dt0G,EAAIq/B,cAAc2vE,EAAIuF,uBAAyB,EAAG,GAClDv0G,EAAIq/B,cAAc2vE,EAAIwF,mBAAqB,EAAG,IAC9Cx0G,EAAIq/B,cAAc2vE,EAAIyF,oBAAsB,EAAG,IAC/C/gH,EAAQ2gH,KAAKt+G,OAAO2B,MAAQ,GACrBsI,GAETtM,EAAQ2gH,KAAK1+G,OAAS,SAAUqK,EAAK3J,GAEnC,MAAO,CACL+5G,SAFFpwG,EAAMA,EAAIpI,MAAMvB,IAED8rC,aAAa,GAC1BmyE,8BAA+Bt0G,EAAImiC,aAAa,GAChDoyE,sBAAuBv0G,EAAImiC,aAAa,GACxCqyE,kBAAmBx0G,EAAImiC,aAAa,IACpCsyE,mBAAoBz0G,EAAImiC,aAAa,MAGzCzuC,EAAQ2gH,KAAK9hF,eAAiB,SAAUy8E,GACtC,OAAO,IAGTt7G,EAAQghH,KAAO,GACfhhH,EAAQghH,KAAK3+G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAKxC,OAJA2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IAEzCsnC,cAAc2vE,EAAI2F,gBAAkB,EAAG,GAC3CjhH,EAAQghH,KAAK3+G,OAAO2B,MAAQ,EACrBsI,GAETtM,EAAQghH,KAAK/+G,OAAS,SAAUqK,EAAK3J,GACnC,MAAO,CACLs+G,eAAgB30G,EAAImiC,aAAa,KAGrCzuC,EAAQghH,KAAKniF,eAAiB,SAAUy8E,GACtC,OAAO,GAGTt7G,EAAQkhH,KAAO,GACflhH,EAAQkhH,KAAK7+G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAIxC,OAHA2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IACzCsnC,cAAc2vE,EAAIoB,QAAS,GAC/B18G,EAAQkhH,KAAK7+G,OAAO2B,MAAQ,EACrBsI,GAETtM,EAAQkhH,KAAKj/G,OAAS,SAAUqK,EAAK3J,KAGrC3C,EAAQkhH,KAAKriF,eAAiB,SAAUy8E,GAEtC,OAAO,GAGTt7G,EAAQmhH,KAAO,GACfnhH,EAAQmhH,KAAK9+G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GAKxC,OAJA2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,IAEzCsnC,cAAc2vE,EAAI8F,qBAAuB,EAAG,GAChDphH,EAAQmhH,KAAK9+G,OAAO2B,MAAQ,EACrBsI,GAETtM,EAAQmhH,KAAKl/G,OAAS,SAAUqK,EAAK3J,KAGrC3C,EAAQmhH,KAAKtiF,eAAiB,SAAUy8E,GACtC,OAAO,GAGTt7G,EAAQqhH,KAAO,GACfrhH,EAAQqhH,KAAKh/G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,IACxC2J,EAAMA,EAAMA,EAAIpI,MAAMvB,GAAUH,EAAO6B,MAAM,EAAyB,GAArBi3G,EAAImC,QAAQ76G,SAGzD+oC,cAAc2vE,EAAImC,QAAQ76G,OAAQ,GACtC0J,EAAIquD,aAAa2gD,EAAIgG,WAAY,GAEjC,IADA,IAAI5D,EAAM,EACD/wG,EAAI,EAAGA,EAAI2uG,EAAImC,QAAQ76G,OAAQ+J,IAAK,CAC3C,IAAIgxG,EAAQrC,EAAImC,QAAQ9wG,GACxBL,EAAIq/B,cAAcgyE,EAAM4D,eAAgB7D,GACxCA,GAAO,EAEPpxG,EAAIq/B,cAAcgyE,EAAMgB,WAAYjB,GACpCA,GAAO,EAEPpxG,EAAIq/B,cAAcgyE,EAAM6D,YAAa9D,GACrCA,GAAO,EAEoB,KAAtBpC,EAAI1zB,SAAW,GAClBt7E,EAAIq/B,cAAcgyE,EAAM8D,4BAA6B/D,GAErDpxG,EAAIquD,aAAagjD,EAAM8D,4BAA6B/D,GAEtDA,GAAO,EAET19G,EAAQqhH,KAAKh/G,OAAO2B,MAAQ05G,GAE9B19G,EAAQqhH,KAAKp/G,OAAS,SAAUqK,EAAK3J,KAGrC3C,EAAQqhH,KAAKxiF,eAAiB,SAAUy8E,GAEtC,OAAO,EAAyB,GAArBA,EAAImC,QAAQ76G,QAGzB5C,EAAQ0hH,KAAO,GACf1hH,EAAQ0hH,KAAKr/G,OAAS,SAAUi5G,EAAKhvG,EAAK3J,GACpC24G,EAAIzuG,QACNyuG,EAAIzuG,OAAOrI,KAAK8H,EAAK3J,GACrB3C,EAAQ0hH,KAAKr/G,OAAO2B,MAAQs3G,EAAIzuG,OAAOjK,QAEvC5C,EAAQ0hH,KAAKr/G,OAAO2B,MAAQhE,EAAQ0hH,KAAK7iF,eAAey8E,IAG5Dt7G,EAAQ0hH,KAAKz/G,OAAS,SAAUqK,EAAKnE,EAAO6G,GAC1C,MAAO,CACLnC,OAAQrK,EAAO2M,KAAK7C,EAAIpI,MAAMiE,EAAO6G,MAGzChP,EAAQ0hH,KAAK7iF,eAAiB,SAAUy8E,GACtC,OAAOA,EAAIzuG,OAASyuG,EAAIzuG,OAAOjK,OAAS04G,EAAIqG,oDCx6B1CC,EAAY,CACd,EAAM,eACN,EAAM,0BACN,EAAM,sBACN,EAAM,sBAGR5hH,EAAQs6G,WAAa,GACrBt6G,EAAQs6G,WAAWr4G,OAAS,SAAUqK,EAAKnE,EAAO6G,GAChD,IAEI6yG,EAOAr8G,EATAN,EAAMoH,EAAI3I,UAAUwE,GACpBu1G,EAAMv1G,EAAQ,EAEduE,EAAM,EACV,GAEEA,EAAOA,GAAO,EAAgB,KAD9Bm1G,EAAUv1G,EAAI3I,UAAU+5G,YAEP,IAAVmE,GAGT,IAAI9C,EAAU6C,EAAU18G,GAaxB,OAXEM,EADExF,EAAQ++G,GACJ/+G,EAAQ++G,GAAS98G,OAAOqK,EAAKoxG,EAAK1uG,GAElC,CACJnC,OAAQrK,EAAO2M,KAAK7C,EAAIpI,MAAMw5G,EAAKA,EAAMhxG,MAIzCxH,IAAMA,EACVM,EAAIu5G,QAAUA,EACdv5G,EAAI5C,OAAU86G,EAAMv1G,EAASuE,EAC7BlH,EAAIs8G,YAAcp1G,EACXlH,GAGTxF,EAAQ+hH,gBAAkB,GAC1B/hH,EAAQ+hH,gBAAgB9/G,OAAS,SAAUqK,EAAKnE,EAAO6G,GAGrD,IAFA,IAAI0uG,EAAMv1G,EACN3C,EAAM,GACHk4G,EAAM,GAAK1uG,GAAK,CACrB,IAAImgB,EAAanvB,EAAQs6G,WAAWr4G,OAAOqK,EAAKoxG,EAAK1uG,GACrD0uG,GAAOvuF,EAAWvsB,OAElB4C,EADco8G,EAAUzyF,EAAWjqB,MAAS,aAAeiqB,EAAWjqB,KACvDiqB,EAEjB,OAAO3pB,GAGTxF,EAAQgiH,aAAe,GACvBhiH,EAAQgiH,aAAa//G,OAAS,SAAUqK,EAAKnE,EAAO6G,GAClD,IAAIynB,EAAQnqB,EAAI3I,UAAUwE,EAAQ,GAC9Bu1G,EAAMv1G,EAAQ,EAWlB,OAVY,IAARsuB,IACFinF,GAAO,GAEG,GAARjnF,IAEFinF,GADUpxG,EAAI3I,UAAU+5G,GACX,GAEH,GAARjnF,IACFinF,GAAO,GAEF19G,EAAQ+hH,gBAAgB9/G,OAAOqK,EAAKoxG,EAAK1uG,IAGlDhP,EAAQg/G,wBAA0B,GAClCh/G,EAAQg/G,wBAAwB/8G,OAAS,SAAUqK,EAAKnE,EAAO6G,GAC7D,IAAIiwG,EAAM3yG,EAAI3I,UAAUwE,GACpB3C,EAAMxF,EAAQ+hH,gBAAgB9/G,OAAOqK,EAAKnE,EAAQ,GAAI6G,GAE1D,OADAxJ,EAAIy5G,IAAMA,EACHz5G,wCCrEL+0G,EAAW,EAAQ,MAEnB0H,EAAQ,EAAQ,MAEhBC,EAAa,WAEb7H,EAAMr6G,EAMNmiH,EAAaniH,EAAQmiH,WAAa,CACpC,KAAQ,CAAC,OAAQ,OAAQ,QAAS,QAClC,KAAQ,CAAC,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,QACzD,KAAQ,CAAC,QACT,KAAQ,CAAC,OAAQ,OAAQ,OAAQ,QACjC,KAAQ,CAAC,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,QACzD,KAAQ,CAAC,QACT,KAAQ,CAAC,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,QAAS,QAAS,QAAS,SAC7J,KAAQ,CAAC,OAAQ,QAAS,QAC1B,KAAQ,CAAC,OAAQ,OAAQ,SACzB,KAAQ,CAAC,OAAQ,OAAQ,OAAQ,QAAS,QAAS,QAAS,QAAS,QAAS,SAGhF9H,EAAIh4G,OAAS,SAAUmD,EAAKqH,EAAQlK,GAIlC,OAHA03G,EAAIx7E,eAAer5B,GACnB7C,EAASA,GAAU,EACnBkK,EAASA,GAAUrK,EAAO6B,MAAMmB,EAAI5C,QAC7By3G,EAAI7wG,QAAQhE,EAAKqH,EAAQlK,IAGlC03G,EAAI7wG,QAAU,SAAUhE,EAAKqH,EAAQlK,GACnC,IAAI2G,EAAO9D,EAAI8D,KACXoD,EAAMlH,EAAI5C,OACV8J,EAAMw1G,IACRx1G,EAAM,GAERG,EAAO8+B,cAAcj/B,EAAK/J,GAC1BkK,EAAOtI,MAAMiB,EAAI8D,KAAM3G,EAAS,EAAG,EAAG,SACtC,IAAI+6G,EAAM/6G,EAAS,EAWnB,GAVY,IAAR+J,IACF6tG,EAASl4G,OAAOmD,EAAI5C,OAAQiK,EAAQ6wG,GACpCA,GAAO,GAELuE,EAAM7G,UAAU9xG,KAClBuD,EAAO8+B,cAAcnmC,EAAIixB,OAAS,EAAGinF,GACrC7wG,EAAOm0C,WAAWx7C,EAAIoiF,SAAW,EAAG81B,GACpCA,GAAO,GAGLyE,EAAW74G,GACE64G,EAAW74G,GACjBhF,SAAQ,SAAU89G,GACzB,GAAyB,IAArBA,EAAUx/G,OAAc,CAC1B,IAAI+6G,EAAQn4G,EAAI48G,IAAc,GAC9BA,EAAYA,EAAU5sF,OAAO,EAAG,GAChCmoF,EAAMr5G,SAAQ,SAAUoC,GACtB2zG,EAAI7wG,QAAQ9C,EAAOmG,EAAQ6wG,GAC3BA,GAAOrD,EAAIh4G,OAAO2B,cAEXwB,EAAI48G,KACb/H,EAAI7wG,QAAQhE,EAAI48G,GAAYv1G,EAAQ6wG,GACpCA,GAAOrD,EAAIh4G,OAAO2B,UAGlBwB,EAAI68G,YACN78G,EAAI68G,WAAW/9G,SAAQ,SAAUoC,GAC/B2zG,EAAI7wG,QAAQ9C,EAAOmG,EAAQ6wG,GAC3BA,GAAOrD,EAAIh4G,OAAO2B,cAGjB,GAAIi+G,EAAM34G,GAAO,CACtB,IAAIjH,EAAS4/G,EAAM34G,GAAMjH,OACzBA,EAAOmD,EAAKqH,EAAQ6wG,GACpBA,GAAOr7G,EAAO2B,UACT,KAAIwB,EAAIqH,OAKb,MAAM,IAAItM,MAAM,kDAAqD+I,EAAO,8BAJlE9D,EAAIqH,OACVrI,KAAKqI,EAAQ6wG,GACjBA,GAAOl4G,EAAIqH,OAAOjK,OAOpB,OAFAy3G,EAAIh4G,OAAO2B,MAAQ05G,EAAM/6G,EAElBkK,GAQTwtG,EAAIiI,YAAc,SAAUz1G,EAAQ1E,EAAO6G,GAGzC,GAFA7G,EAAQA,GAAS,GACjB6G,EAAMA,GAAOnC,EAAOjK,QACVuF,EAAQ,EAChB,OAAO,EAGT,IAaIy/E,EACAnxD,EAdA/pB,EAAMG,EAAO4hC,aAAatmC,GAC1BmB,EAAOuD,EAAOU,SAAS,QAASpF,EAAQ,EAAGA,EAAQ,GACnDu1G,EAAMv1G,EAAQ,EAElB,GAAY,IAARuE,EAAW,CACb,GAAIsC,EAAM7G,EAAQ,GAChB,OAAO,GAGTuE,EAAM6tG,EAASt4G,OAAO4K,EAAQ6wG,GAC9BA,GAAO,EAWT,OANIuE,EAAM7G,UAAU9xG,KAClBs+E,EAAU/6E,EAAOlJ,UAAU+5G,GAC3BjnF,EAAmC,SAA3B5pB,EAAO4hC,aAAaivE,GAC5BA,GAAO,GAGF,CACL96G,OAAQ8J,EACR61G,WAAY7E,EAAMv1G,EAClBq6G,WAAY91G,GAAOgxG,EAAMv1G,GACzBmB,KAAMA,EACNs+E,QAASA,EACTnxD,MAAOA,IAIX4jF,EAAIp4G,OAAS,SAAU4K,EAAQ1E,EAAO6G,GACpC7G,EAAQA,GAAS,EACjB6G,EAAMA,GAAOnC,EAAOjK,OACpB,IAAI6/G,EAAUpI,EAAIiI,YAAYz1G,EAAQ1E,EAAO6G,GAC7C,IAAKyzG,GAAWA,EAAQ7/G,OAASoM,EAAM7G,EACrC,MAAM,IAAI5H,MAAM,kBAGlB,OAAO85G,EAAIqI,qBAAqBD,EAAS51G,EAAQ1E,EAAQs6G,EAAQF,WAAYp6G,EAAQs6G,EAAQ7/G,SAG/Fy3G,EAAIqI,qBAAuB,SAAUD,EAAS51G,EAAQ1E,EAAO6G,GAC3D7G,EAAQA,GAAS,EACjB6G,EAAMA,GAAOnC,EAAOjK,OACpB,IAAI0G,EAAOm5G,EAAQn5G,KACf9D,EAAM,GACV,GAAI28G,EAAW74G,GAAO,CACpB9D,EAAI68G,WAAa,GAGjB,IAFA,IAAIM,EAAWR,EAAW74G,GACtBo0G,EAAMv1G,EACH6G,EAAM0uG,GAAO,GAAG,CACrB,IAAIh3G,EAAQ2zG,EAAIp4G,OAAO4K,EAAQ6wG,EAAK1uG,GAEpC,GADA0uG,GAAOh3G,EAAM9D,OACT+/G,EAASj0F,QAAQhoB,EAAM4C,OAAS,EAClC9D,EAAIkB,EAAM4C,MAAQ5C,OACb,GAAIi8G,EAASj0F,QAAQhoB,EAAM4C,KAAO,MAAQ,EAAG,CAClD,IAAI84G,EAAY17G,EAAM4C,KAAO,KACjB9D,EAAI48G,GAAa58G,EAAI48G,IAAc,IACzC/7G,KAAKK,QAEXlB,EAAI68G,WAAWh8G,KAAKK,SAGfu7G,EAAM34G,GAEf9D,GAAMvD,EADOggH,EAAM34G,GAAMrH,QACZ4K,EAAQ1E,EAAO6G,GAE5BxJ,EAAIqH,OAASrK,EAAO2M,KAAKtC,EAAO3I,MAAMiE,EAAO6G,IAQ/C,OALAxJ,EAAI5C,OAAS6/G,EAAQ7/G,OACrB4C,EAAIg9G,WAAaC,EAAQD,WACzBh9G,EAAI8D,KAAOm5G,EAAQn5G,KACnB9D,EAAIoiF,QAAU66B,EAAQ76B,QACtBpiF,EAAIixB,MAAQgsF,EAAQhsF,MACbjxB,GAGT60G,EAAIx7E,eAAiB,SAAUr5B,GAC7B,IAAI8D,EAAO9D,EAAI8D,KAEXoD,EAAM,EAKV,GAJIu1G,EAAM7G,UAAU9xG,KAClBoD,GAAO,GAGLy1G,EAAW74G,GACE64G,EAAW74G,GACjBhF,SAAQ,SAAU89G,GACzB,GAAyB,IAArBA,EAAUx/G,OAAc,CAC1B,IAAI+6G,EAAQn4G,EAAI48G,IAAc,GAC9BA,EAAYA,EAAU5sF,OAAO,EAAG,GAChCmoF,EAAMr5G,SAAQ,SAAUoC,GACtBA,EAAM4C,KAAO84G,EACb11G,GAAO2tG,EAAIx7E,eAAen4B,WAEvB,GAAIlB,EAAI48G,GAAY,CACzB,IAAI17G,EAAQlB,EAAI48G,GAChB17G,EAAM4C,KAAO84G,EACb11G,GAAO2tG,EAAIx7E,eAAen4B,OAG1BlB,EAAI68G,YACN78G,EAAI68G,WAAW/9G,SAAQ,SAAUoC,GAC/BgG,GAAO2tG,EAAIx7E,eAAen4B,WAGzB,GAAIu7G,EAAM34G,GACfoD,GAAOu1G,EAAM34G,GAAMu1B,eAAer5B,OAC7B,KAAIA,EAAIqH,OAGb,MAAM,IAAItM,MAAM,kDAAqD+I,EAAO,8BAF5EoD,GAAOlH,EAAIqH,OAAOjK,OAUpB,OALI8J,EAAMw1G,IACRx1G,GAAO,GAGTlH,EAAI5C,OAAS8J,EACNA,wCC/NLy0B,EAAS,EAAQ,MACjByhF,EAAY,EAAQ,KACpBvI,EAAM,EAAQ,MAEdwI,EAAQrgH,EAAO6B,MAAM,GAEzB,MAAMy+G,UAAgB3hF,EAAO2jB,SAC3BvhD,YAAag9B,GACXmC,MAAMnC,GAENj/B,KAAKmjC,WAAY,EAEjBnjC,KAAKyhH,SAAW,EAChBzhH,KAAK0hH,SAAW,EAChB1hH,KAAK2hH,cAAe,EACpB3hH,KAAK4hH,KAAO,KACZ5hH,KAAK6hH,KAAO,KACZ7hH,KAAKq3G,IAAM,KACXr3G,KAAK8hH,SAAW,KAChB9hH,KAAK+hH,aAAe,KACpB/hH,KAAKgiH,SAAW,KAEhBhiH,KAAK8hH,SAAW,KAChB9hH,KAAKiiH,QAGPz8E,QAASz7B,GACH/J,KAAKmjC,YACTnjC,KAAKmjC,WAAY,EACbp5B,GAAK/J,KAAKylC,KAAK,QAAS17B,GAC5B/J,KAAKylC,KAAK,UAGZ+G,OAAQ5rC,EAAMH,EAAKimB,GACjB,IAAI1mB,KAAKmjC,UAAT,CAGA,IAFA,IAAI++E,GAAWliH,KAAK6hH,OAAS7hH,KAAK6hH,KAAKjyD,eAAeG,UAE/CnvD,EAAKU,SAAWtB,KAAKmjC,WAAW,CACrC,IAAKnjC,KAAK0hH,WAAa1hH,KAAK2hH,aAG1B,OAFA3hH,KAAK+hH,aAAenhH,OACpBZ,KAAKgiH,SAAWt7F,GAIlB,IAAIy7F,EAAWvhH,EAAKU,OAAStB,KAAK0hH,SAAW9gH,EAAKU,OAAStB,KAAK0hH,SAMhE,GALI1hH,KAAK4hH,KAAMhhH,EAAKsC,KAAKlD,KAAK4hH,KAAM5hH,KAAK4hH,KAAKtgH,OAAStB,KAAK0hH,UACnD1hH,KAAK6hH,OAAMK,EAAUliH,KAAK6hH,KAAK5+G,MAAMk/G,IAAavhH,EAAKU,OAASV,EAAOA,EAAKgC,MAAM,EAAGu/G,KAE9FniH,KAAK0hH,UAAYS,GAEZniH,KAAK0hH,SAAU,CAClB,IAAI12G,EAAMhL,KAAK4hH,KACX74E,EAAK/oC,KAAKq3G,IACVx3E,EAAS7/B,KAAK6hH,KAElB7hH,KAAK4hH,KAAO5hH,KAAKq3G,IAAMr3G,KAAK6hH,KAAO7hH,KAAK8hH,SAAW,KACnDI,GAAU,EAEVliH,KAAK2hH,cAAe,EAChB9hF,GAAQA,EAAOnyB,MACfq7B,GAAIA,EAAG/9B,GAGbpK,EAAOuhH,IAAavhH,EAAKU,OAASigH,EAAQ3gH,EAAKgC,MAAMu/G,GAGvD,GAAIniH,KAAKyhH,WAAazhH,KAAK0hH,SAGzB,OAFA1hH,KAAK+hH,aAAenhH,OACpBZ,KAAKgiH,SAAWt7F,GAIdw7F,EAASx7F,IACR1mB,KAAK8hH,SAASp7F,IAGrB6c,QAAS3kC,EAAMmqC,GACb/oC,KAAK0hH,SAAW9iH,EAChBoB,KAAK4hH,KAAO1gH,EAAO6B,MAAMnE,GACzBoB,KAAKq3G,IAAMtuE,EAGbq5E,QAASxjH,EAAMmqC,GAUb,OATA/oC,KAAK0hH,SAAW9iH,EAChBoB,KAAK6hH,KAAO,IAAIQ,EAAUriH,MAC1BA,KAAK8hH,SAAWR,EAAUthH,KAAK6hH,KAAM,SACrC7hH,KAAKyhH,WACLzhH,KAAK6hH,KAAKn9E,GAAG,OAAO,KAClB1kC,KAAKyhH,WACLzhH,KAAKiiH,WAEPjiH,KAAKq3G,IAAMtuE,EACJ/oC,KAAK6hH,KAGdS,WACE,MAAMC,EAAgB,CAACn3G,EAAKJ,KAC1BhL,KAAKujC,QAAQn4B,GAAKo3G,IAEdx3G,EADEA,EACI9J,EAAOqC,OAAO,CAACyH,EAAKw3G,IAEpBA,EAER,IAAIrB,EAAUpI,EAAIiI,YAAYh2G,GACP,iBAAZm2G,EACToB,EAAcpB,EAAUn2G,EAAI1J,OAAQ0J,IAEpChL,KAAKyhH,WACLzhH,KAAKyiH,SAAWtB,EAChBnhH,KAAKylC,KAAK,MAAO07E,QAKvBoB,EAAc,GAGhB1iF,SACE,IAAK7/B,KAAKyiH,SAAU,MAAM,IAAIxjH,MAAM,gEACpC,IAAIkiH,EAAUnhH,KAAKyiH,SAGnB,OAFAziH,KAAKyiH,SAAW,KAETziH,KAAKoiH,QAAQjB,EAAQD,YAAY,KACtClhH,KAAKyhH,WACLzhH,KAAKiiH,WAITthH,OAAQooC,GACN,IAAK/oC,KAAKyiH,SAAU,MAAM,IAAIxjH,MAAM,gEACpC,IAAIkiH,EAAUnhH,KAAKyiH,SACnBziH,KAAKyiH,SAAW,KAEhBziH,KAAKujC,QAAQ49E,EAAQD,YAAYl2G,IAC/B,IAAIgvG,EAAMjB,EAAIqI,qBAAqBD,EAASn2G,GAC5C+9B,EAAGixE,GACHh6G,KAAKyhH,WACLzhH,KAAKiiH,WAITS,SACE,IAAK1iH,KAAKyiH,SAAU,MAAM,IAAIxjH,MAAM,gEACpC,IAAIkiH,EAAUnhH,KAAKyiH,SACnBziH,KAAKyiH,SAAW,KAEhBziH,KAAK0hH,SAAWP,EAAQD,WACF,IAAlBlhH,KAAK0hH,WACP1hH,KAAK2hH,cAAe,GAEtB3hH,KAAKq3G,IAAM,KACTr3G,KAAKyhH,WACLzhH,KAAKiiH,SAITA,QACE,IAAIjiH,KAAKyhH,WACJzhH,KAAK4hH,MAAS5hH,KAAK6hH,MAAM7hH,KAAKsiH,WAC/BtiH,KAAK+hH,cAAc,CACrB,IAAIr7F,EAAO1mB,KAAKgiH,SACZz2G,EAASvL,KAAK+hH,aAClB/hH,KAAK+hH,aAAe,KACpB/hH,KAAKgiH,SAAW,KAChBhiH,KAAKwsC,OAAOjhC,EAAQ,KAAMmb,KAKhC,MAAM27F,UAAkBxiF,EAAOmlC,YAC7B/iE,YAAauB,GACX49B,QACAphC,KAAK2iH,QAAUn/G,EACfxD,KAAKmjC,WAAY,EAGnBqC,QAASz7B,GACH/J,KAAKmjC,YACTnjC,KAAKmjC,WAAY,EACjBnjC,KAAK2iH,QAAQn9E,QAAQz7B,GACjBA,GAAK/J,KAAKylC,KAAK,QAAS17B,GAC5B/J,KAAKylC,KAAK,WAIdhnC,EAAOC,QAAU8iH,uCCzLb3hF,EAAS,EAAQ,MACjBk5E,EAAM,EAAQ,MACdhqE,EAAiB,EAAQ,MAE7B,SAAShJ,KAET,MAAM68E,UAAgB/iF,EAAO48D,SAC3Bx6F,YAAag9B,GACXmC,MAAMnC,GAENj/B,KAAKmjC,WAAY,EAEjBnjC,KAAKqiG,YAAa,EAClBriG,KAAK6iH,UAAW,EAChB7iH,KAAKoiH,QAAU,KACfpiH,KAAK8iH,OAAS,KACd9iH,KAAK+iH,OAAQ,EAEb/iH,KAAKgjH,YAAc,KACZhjH,KAAK+iH,QACV/iH,KAAK+iH,OAAQ,EACb/iH,KAAKiqC,UAGPjqC,KAAKijH,OAAS,KACZjjH,KAAKoiH,QAAU,MAInBhC,KAAMxhH,EAAMmqC,GACV/oC,KAAKkjH,UAAUtkH,EAAMmqC,GAGvBm6E,UAAWtkH,EAAMmqC,GACf,IAAIlJ,EAAS,IAAIwiF,EAAUriH,MAE3B,OADAA,KAAKg6G,IAAI,CAAEhyG,KAAM,OAAQq4G,cAAezhH,EAAMukH,gBAAiB,EAAGtjF,OAAQA,GAAUkJ,GAC7ElJ,EAGTm6E,IAAKA,EAAKjxE,GAER,GADKA,IAAIA,EAAKhD,GACV/lC,KAAKmjC,UAAW,OAAO4F,EAAG,IAAI9pC,MAAM,yBAExC,IAAI+L,EAIJ,GAHIgvG,EAAImJ,kBACNn4G,EAAM9J,EAAO6B,MAAMi3G,EAAImJ,kBAErBnJ,EAAIn6E,OACNm6E,EAAIzuG,OAAS,KACbP,EAAM+tG,EAAIh4G,OAAOi5G,EAAKhvG,GACtBhL,KAAK+E,KAAKiG,GACVhL,KAAKoiH,QAAUpI,EAAIn6E,OACnB7/B,KAAKoiH,QAAQ19E,GAAG,WAAY1kC,KAAKgjH,aACjChjH,KAAKoiH,QAAQ19E,GAAG,MAAO1kC,KAAKijH,QAC5BjjH,KAAKoiH,QAAQ19E,GAAG,MAAOqE,GACvB/oC,KAAKojH,eACA,CAGL,GAFAp4G,EAAM+tG,EAAIh4G,OAAOi5G,EAAKhvG,GACRhL,KAAK+E,KAAKiG,GACX,OAAO+jC,EAAehG,GACnC/oC,KAAK8iH,OAAS/5E,GAIlBvD,QAASz7B,GACP,IAAI/J,KAAKmjC,UAAT,CAIA,GAHAnjC,KAAKmjC,WAAY,EACbnjC,KAAKoiH,SAAWpiH,KAAKoiH,QAAQ58E,SAASxlC,KAAKoiH,QAAQ58E,UACvDxlC,KAAKoiH,QAAU,KACXpiH,KAAK8iH,OAAQ,CACf,IAAI/5E,EAAK/oC,KAAK8iH,OACd9iH,KAAK8iH,OAAS,KACd/5E,EAAGh/B,GAEDA,GAAK/J,KAAKylC,KAAK,QAAS17B,GAC5B/J,KAAKylC,KAAK,UAGZ49E,WACErjH,KAAKqiG,YAAa,EACbriG,KAAKoiH,SAAYpiH,KAAK8iH,QACzB9iH,KAAK+E,KAAK,MAIdq+G,WACE,GAAKpjH,KAAKoiH,QAEV,MAAQpiH,KAAKmjC,WAAW,CACtB,IAAIn4B,EAAMhL,KAAKoiH,QAAQ9zE,OAEvB,IAAKtjC,EAEH,YADAhL,KAAK+iH,QAAU/iH,KAAKoiH,SAItB,IAAKpiH,KAAK+E,KAAKiG,GAAM,QAIzBi/B,QACE,IAAIjqC,KAAK6iH,WAAY7iH,KAAKmjC,UAA1B,CAIA,GAHAnjC,KAAK6iH,UAAW,EAEZ7iH,KAAKoiH,SAASpiH,KAAKojH,WACnBpjH,KAAK8iH,OAAQ,CACf,IAAIQ,EAAQtjH,KAAK8iH,OACjB9iH,KAAK8iH,OAAS,KACdQ,IAGFtjH,KAAK6iH,UAAW,EACZ7iH,KAAKqiG,YACPriG,KAAK+E,KAAK,QAKhB,MAAMs9G,UAAkBxiF,EAAOmlC,YAC7B/iE,YAAauB,GACX49B,QACAphC,KAAK2iH,QAAUn/G,EACfxD,KAAKmjC,WAAY,EAGnBqC,QAASz7B,GACH/J,KAAKmjC,YACTnjC,KAAKmjC,WAAY,EACjBnjC,KAAK2iH,QAAQn9E,QAAQz7B,GACjBA,GAAK/J,KAAKylC,KAAK,QAAS17B,GAC5B/J,KAAKylC,KAAK,WAIdhnC,EAAOC,QAAUkkH,kBCtIjB,MAAMpB,EAAU,EAAQ,MAClBoB,EAAU,EAAQ,MAExBlkH,EAAQiC,OAASs+B,GAAQ,IAAIuiF,EAAQviF,GACrCvgC,EAAQqC,OAASk+B,GAAQ,IAAI2jF,EAAQ3jF,aCArC,IAAI9hB,EAAI,IACJpe,EAAQ,GAAJoe,EACJyC,EAAQ,GAAJ7gB,EACJu9B,EAAQ,GAAJ1c,EAuJR,SAAS2jG,EAAOn+E,EAAIo+E,EAAOxlG,EAAGle,GAC5B,IAAI2jH,EAAWD,GAAa,IAAJxlG,EACxB,OAAOlN,KAAKuN,MAAM+mB,EAAKpnB,GAAK,IAAMle,GAAQ2jH,EAAW,IAAM,IAvI7DhlH,EAAOC,QAAU,SAASiH,EAAK9E,GAC7BA,EAAUA,GAAW,GACrB,IA8GeukC,EACXo+E,EA/GAx7G,SAAcrC,EAClB,GAAa,WAATqC,GAAqBrC,EAAIrE,OAAS,EACpC,OAkBJ,SAAe+H,GAEb,MADAA,EAAMwC,OAAOxC,IACL/H,OAAS,KAAjB,CAGA,IAAIuG,EAAQ,mIAAmI7I,KAC7IqK,GAEF,GAAKxB,EAAL,CAGA,IAAImW,EAAIgiF,WAAWn4F,EAAM,IAEzB,QADYA,EAAM,IAAM,MAAMggC,eAE5B,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAzDEvL,SAyDKte,EACT,IAAK,QACL,IAAK,OACL,IAAK,IACH,OA9DEse,OA8DKte,EACT,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOA,EAAIse,EACb,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAAOte,EAAI4B,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAO5B,EAAIjf,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOif,EAAIb,EACb,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACH,OAAOa,EACT,QACE,UAvEKwgB,CAAM74B,GACR,GAAa,WAATqC,GAAqBm3B,SAASx5B,GACvC,OAAO9E,EAAQ6iH,MA0GFt+E,EA1GiBz/B,GA2G5B69G,EAAQ1yG,KAAKgE,IAAIswB,KACR9I,EACJinF,EAAOn+E,EAAIo+E,EAAOlnF,EAAG,OAE1BknF,GAAS5jG,EACJ2jG,EAAOn+E,EAAIo+E,EAAO5jG,EAAG,QAE1B4jG,GAASzkH,EACJwkH,EAAOn+E,EAAIo+E,EAAOzkH,EAAG,UAE1BykH,GAASrmG,EACJomG,EAAOn+E,EAAIo+E,EAAOrmG,EAAG,UAEvBioB,EAAK,OAvCd,SAAkBA,GAChB,IAAIo+E,EAAQ1yG,KAAKgE,IAAIswB,GACrB,OAAIo+E,GAASlnF,EACJxrB,KAAKuN,MAAM+mB,EAAK9I,GAAK,IAE1BknF,GAAS5jG,EACJ9O,KAAKuN,MAAM+mB,EAAKxlB,GAAK,IAE1B4jG,GAASzkH,EACJ+R,KAAKuN,MAAM+mB,EAAKrmC,GAAK,IAE1BykH,GAASrmG,EACJrM,KAAKuN,MAAM+mB,EAAKjoB,GAAK,IAEvBioB,EAAK,KA/F2Bu+E,CAASh+G,GAEhD,MAAM,IAAI1G,MACR,wDACE2J,KAAKC,UAAUlD,qBClCrB,MAAMk6B,EAAS,EAAQ,MACjB2E,EAAO,EAAQ,KAErB,SAASo/E,EAAezmG,GACtB,OAAO0mG,EAAW1mG,EAAG,CAAE2mG,YAAY,EAAMC,cAAe,KAG1D,SAASC,EAAe7mG,GACtB,OAAO0mG,EAAW1mG,GAGpB,SAAS0mG,EAAY1mG,EAAG8hB,GACtB,IAAK9hB,GAAkB,mBAANA,GAAoBA,EAAEq6E,eAAgB,OAAOr6E,EAE9D,MAAM8uF,EAAO,IAAIpsE,EAAO48D,SAASx9D,GAAMgtE,KAAK9uF,GAI5C,OAHIA,EAAEqoB,UACJymE,EAAKzmE,QAAUroB,EAAEqoB,QAAQxb,KAAK7M,IAEzB8uF,EAGT,MAAMroC,UAAoB/jC,EAAO48D,SAC/Bx6F,YAAaskE,EAAStnC,GACpBmC,MAAM,IAAKnC,EAAMglF,aAAa,IAE9BjkH,KAAKkkH,UAAW,EAChBlkH,KAAKmkH,aAAc,EACnBnkH,KAAKokH,SAAW,KAChBpkH,KAAKqkH,YAAeplF,GAAQA,EAAK6kF,WAAcF,EAAgBI,EAExC,mBAAZz9C,EACTvmE,KAAKskH,OAAS/9C,GAEdvmE,KAAKskH,OAAS/9C,EAAQ3kE,IAAI5B,KAAKqkH,aAC/BrkH,KAAKskH,OAAOthH,SAAQ68B,IACI,mBAAXA,GAAuB7/B,KAAKukH,qBAAqB1kF,OAIhE7/B,KAAKwkH,QAGPv6E,QACEjqC,KAAKkkH,UAAW,EAChBlkH,KAAKojH,WAGPA,WACE,GAAIpjH,KAAKmkH,cAAgBnkH,KAAKkkH,WAAalkH,KAAKokH,SAAU,OAG1D,IAAIjnE,EACJ,IAHAn9C,KAAKmkH,aAAc,EAGZnkH,KAAKkkH,UAA+C,QAAlC/mE,EAAQn9C,KAAKokH,SAAS91E,SAC7CtuC,KAAKkkH,SAAWlkH,KAAK+E,KAAKo4C,GAG5Bn9C,KAAKmkH,aAAc,EAGrBM,SAAU16G,EAAKg/B,GACb,IAAIw9B,EAAU,GAId,GAHIvmE,KAAKokH,UAAU79C,EAAQxhE,KAAK/E,KAAKokH,UACV,mBAAhBpkH,KAAKskH,SAAuB/9C,EAAUA,EAAQhjE,OAAOvD,KAAKskH,SAE9C,IAAnB/9C,EAAQjlE,OACVynC,EAAGh/B,OACE,CACL,IAAIm7D,EAAUqB,EAAQjlE,OAClB6uD,EAAKpmD,EACTw8D,EAAQvjE,SAAQ68B,KAqFtB,SAAkBA,EAAQ91B,EAAKg/B,GAC7B,IAAKlJ,EAAO2F,SAAW3F,EAAOsD,UAC5B4F,EAAGh/B,OACE,CACL,MAAM+2B,EAAW0D,GAAK2rB,GAAMpnB,EAAGonB,GAAMpmD,KACrC81B,EACG6E,GAAG,QAAS5D,GACZ4D,GAAG,SAAS,IAAM5D,MAClB0E,QAAQz7B,EAAK+2B,IA5FZ0E,CAAQ3F,EAAQ91B,GAAKA,IACnBomD,EAAKA,GAAMpmD,EACO,KAAZm7D,GACJn8B,EAAGonB,UAObq0D,QAGE,GAFAxkH,KAAKokH,SAAW,KAEW,mBAAhBpkH,KAAKskH,OACdtkH,KAAKskH,QAAO,CAACv6G,EAAK81B,KAChB,GAAI91B,EAAK,OAAO/J,KAAKwlC,QAAQz7B,GAC7B81B,EAAS7/B,KAAKqkH,YAAYxkF,GAC1B7/B,KAAKukH,qBAAqB1kF,GAC1B7/B,KAAK0kH,eAAe7kF,UAEjB,CACL,IAAIA,EAAS7/B,KAAKskH,OAAO3jG,QACH,mBAAXkf,IACTA,EAAS7/B,KAAKqkH,YAAYxkF,KAC1B7/B,KAAKukH,qBAAqB1kF,IAE5B7/B,KAAK0kH,eAAe7kF,IAIxB6kF,eAAgB7kF,GACd,IAAKA,EAEH,YADA7/B,KAAK+E,KAAK,MAIZ/E,KAAKokH,SAAWvkF,EAChB7/B,KAAKojH,WAEL,MAAMuB,EAAa,KACjB3kH,KAAKojH,YAGDwB,EAAU,KACd,IAAK/kF,EAAO23D,eAAe3nC,QAAUhwB,EAAOsD,UAAW,CACrD,MAAMp5B,EAAM,IAAI9K,MAAM,8BACtB8K,EAAI4oB,KAAO,6BACX3yB,KAAKwlC,QAAQz7B,KAIX4iD,EAAQ,KACZ3sD,KAAKokH,SAAW,KAChBvkF,EAAOwT,eAAe,WAAYsxE,GAClC9kF,EAAOwT,eAAe,MAAOsZ,GAC7B9sB,EAAOwT,eAAe,QAASuxE,GAC/B/kF,EAAO2F,UACPxlC,KAAKwkH,SAGP3kF,EAAO6E,GAAG,WAAYigF,GACtB9kF,EAAO2E,KAAK,MAAOmoB,GACnB9sB,EAAO2E,KAAK,QAASogF,GAGvBL,qBAAsB1kF,GACpB,IAAKA,EAAQ,OAEb,MAAMmW,EAAWjsC,IACf81B,EAAOwT,eAAe,QAAS2C,GAC/Bh2C,KAAKwlC,QAAQz7B,IAGf81B,EAAO2E,KAAK,QAASwR,IAIzB4tB,EAAY1/D,IAAMqiE,GAAW,IACvB3C,EAAY2C,EAAS,CAAEu9C,YAAY,EAAMC,cAAe,KAG9DtlH,EAAOC,QAAUklE,WCxJjBnlE,EAAOC,QAEP,SAAoBy6F,EAASr5F,GAC3B,IAAI4mB,EAAO,KAQX,OAPAyyE,EAAQz0D,GAAG5kC,GAAM,SAAUc,GACzB,GAAK8lB,EAAL,CACA,IAAIuC,EAAKvC,EACTA,EAAO,KACPuC,EAAGroB,OAGE,SAAU4jC,GACf9d,EAAO8d,2BCVX,IAAIhP,EAAc,SAAU/zB,GAC3B,OAAOA,GAAUA,GAGlBhD,EAAOC,QAAU,SAAYkU,EAAGC,GAC/B,OAAU,IAAND,GAAiB,IAANC,EACP,EAAID,GAAM,EAAIC,EAElBD,IAAMC,MAGN2iB,EAAY5iB,KAAM4iB,EAAY3iB,iCCXnC,IAAItT,EAAS,EAAQ,MACjBi8D,EAAW,EAAQ,MAEnBkiC,EAAiB,EAAQ,MACzBiS,EAAc,EAAQ,MACtBC,EAAO,EAAQ,MAEf9W,EAAWt9B,EAASm0C,IAAenqG,QAEvCjG,EAAOu5F,EAAU,CAChB6W,YAAaA,EACbjS,eAAgBA,EAChBkS,KAAMA,IAGPnxG,EAAOC,QAAUo6F,+BCfjB,IAAI4E,EAAiB,EAAQ,MAE7Bj/F,EAAOC,QAAU,WAChB,MAA4B,mBAAd8G,OAAOijB,GAAoBjjB,OAAOijB,GAAKi1E,gCCHtD,IAAIiS,EAAc,EAAQ,MACtBpwG,EAAS,EAAQ,MAErBd,EAAOC,QAAU,WAChB,IAAIo6F,EAAW6W,IAMf,OALApwG,EAAOiG,OAAQ,CAAEijB,GAAIqwE,GAAY,CAChCrwE,GAAI,WACH,OAAOjjB,OAAOijB,KAAOqwE,KAGhBA,gCCVR,IAAI+rB,EACJ,IAAKr/G,OAAOC,KAAM,CAEjB,IAAI3G,EAAM0G,OAAOvF,UAAUS,eACvB+qE,EAAQjmE,OAAOvF,UAAUgM,SACzB64G,EAAS,EAAQ,MACjBC,EAAev/G,OAAOvF,UAAU21B,qBAChCovF,GAAkBD,EAAaxkH,KAAK,CAAE0L,SAAU,MAAQ,YACxDg5G,EAAkBF,EAAaxkH,MAAK,cAAgB,aACpD2kH,EAAY,CACf,WACA,iBACA,UACA,iBACA,gBACA,uBACA,eAEGC,EAA6B,SAAUruG,GAC1C,IAAIrH,EAAOqH,EAAE7U,YACb,OAAOwN,GAAQA,EAAKxP,YAAc6W,GAE/BsuG,EAAe,CAClBC,mBAAmB,EACnBC,UAAU,EACVC,WAAW,EACXC,QAAQ,EACRC,eAAe,EACfC,SAAS,EACTC,cAAc,EACdC,aAAa,EACbC,wBAAwB,EACxBC,uBAAuB,EACvBC,cAAc,EACdC,aAAa,EACbC,cAAc,EACdC,cAAc,EACdC,SAAS,EACTC,aAAa,EACbC,YAAY,EACZC,UAAU,EACVC,UAAU,EACVC,OAAO,EACPC,kBAAkB,EAClBC,oBAAoB,EACpBC,SAAS,GAENC,EAA4B,WAE/B,GAAsB,oBAAXv2G,OAA0B,OAAO,EAC5C,IAAK,IAAI2C,KAAK3C,OACb,IACC,IAAK+0G,EAAa,IAAMpyG,IAAMlU,EAAIyB,KAAK8P,OAAQ2C,IAAoB,OAAd3C,OAAO2C,IAAoC,iBAAd3C,OAAO2C,GACxF,IACCmyG,EAA2B90G,OAAO2C,IACjC,MAAOtM,GACR,OAAO,GAGR,MAAOA,GACR,OAAO,EAGT,OAAO,EAhBuB,GA8B/Bm+G,EAAW,SAAcllD,GACxB,IAAIknD,EAAsB,OAAXlnD,GAAqC,iBAAXA,EACrCmnD,EAAoC,sBAAvBr7C,EAAMlrE,KAAKo/D,GACxBonD,EAAcjC,EAAOnlD,GACrBqnD,EAAWH,GAAmC,oBAAvBp7C,EAAMlrE,KAAKo/D,GAClCsnD,EAAU,GAEd,IAAKJ,IAAaC,IAAeC,EAChC,MAAM,IAAIl8F,UAAU,sCAGrB,IAAIq8F,EAAYjC,GAAmB6B,EACnC,GAAIE,GAAYrnD,EAAOr+D,OAAS,IAAMxC,EAAIyB,KAAKo/D,EAAQ,GACtD,IAAK,IAAIt0D,EAAI,EAAGA,EAAIs0D,EAAOr+D,SAAU+J,EACpC47G,EAAQliH,KAAK8G,OAAOR,IAItB,GAAI07G,GAAepnD,EAAOr+D,OAAS,EAClC,IAAK,IAAIgK,EAAI,EAAGA,EAAIq0D,EAAOr+D,SAAUgK,EACpC27G,EAAQliH,KAAK8G,OAAOP,SAGrB,IAAK,IAAIxL,KAAQ6/D,EACVunD,GAAsB,cAATpnH,IAAyBhB,EAAIyB,KAAKo/D,EAAQ7/D,IAC5DmnH,EAAQliH,KAAK8G,OAAO/L,IAKvB,GAAIklH,EAGH,IAFA,IAAImC,EA3CqC,SAAUrwG,GAEpD,GAAsB,oBAAXzG,SAA2Bu2G,EACrC,OAAOzB,EAA2BruG,GAEnC,IACC,OAAOquG,EAA2BruG,GACjC,MAAOpQ,GACR,OAAO,GAmCe0gH,CAAqCznD,GAElD3sD,EAAI,EAAGA,EAAIkyG,EAAU5jH,SAAU0R,EACjCm0G,GAAoC,gBAAjBjC,EAAUlyG,KAAyBlU,EAAIyB,KAAKo/D,EAAQulD,EAAUlyG,KACtFi0G,EAAQliH,KAAKmgH,EAAUlyG,IAI1B,OAAOi0G,GAGTxoH,EAAOC,QAAUmmH,+BCvHjB,IAAIjiH,EAAQlB,MAAMzB,UAAU2C,MACxBkiH,EAAS,EAAQ,MAEjBuC,EAAW7hH,OAAOC,KAClBo/G,EAAWwC,EAAW,SAAcvwG,GAAK,OAAOuwG,EAASvwG,IAAQ,EAAQ,MAEzEwwG,EAAe9hH,OAAOC,KAE1Bo/G,EAASjV,KAAO,WACf,GAAIpqG,OAAOC,KAAM,CAChB,IAAI8hH,EAA0B,WAE7B,IAAI1jH,EAAO2B,OAAOC,KAAKR,WACvB,OAAOpB,GAAQA,EAAKvC,SAAW2D,UAAU3D,OAHb,CAI3B,EAAG,GACAimH,IACJ/hH,OAAOC,KAAO,SAAck6D,GAC3B,OAAImlD,EAAOnlD,GACH2nD,EAAa1kH,EAAMrC,KAAKo/D,IAEzB2nD,EAAa3nD,UAItBn6D,OAAOC,KAAOo/G,EAEf,OAAOr/G,OAAOC,MAAQo/G,GAGvBpmH,EAAOC,QAAUmmH,yBC7BjB,IAAIp5C,EAAQjmE,OAAOvF,UAAUgM,SAE7BxN,EAAOC,QAAU,SAAqB+C,GACrC,IAAI4H,EAAMoiE,EAAMlrE,KAAKkB,GACjBqjH,EAAiB,uBAARz7G,EASb,OARKy7G,IACJA,EAAiB,mBAARz7G,GACE,OAAV5H,GACiB,iBAAVA,GACiB,iBAAjBA,EAAMH,QACbG,EAAMH,QAAU,GACa,sBAA7BmqE,EAAMlrE,KAAKkB,EAAM2tG,SAEZ0V,kBCfR,IAAI0C,EAAS,EAAQ,MAoBrB,SAAShjF,EAAMvb,GACb,IAAI0M,EAAI,WACN,OAAIA,EAAE8xF,OAAe9xF,EAAEl0B,OACvBk0B,EAAE8xF,QAAS,EACJ9xF,EAAEl0B,MAAQwnB,EAAGjkB,MAAMhF,KAAMiF,aAGlC,OADA0wB,EAAE8xF,QAAS,EACJ9xF,EAGT,SAAS+xF,EAAYz+F,GACnB,IAAI0M,EAAI,WACN,GAAIA,EAAE8xF,OACJ,MAAM,IAAIxoH,MAAM02B,EAAEgyF,WAEpB,OADAhyF,EAAE8xF,QAAS,EACJ9xF,EAAEl0B,MAAQwnB,EAAGjkB,MAAMhF,KAAMiF,YAE9BnF,EAAOmpB,EAAGnpB,MAAQ,+BAGtB,OAFA61B,EAAEgyF,UAAY7nH,EAAO,sCACrB61B,EAAE8xF,QAAS,EACJ9xF,EAvCTl3B,EAAOC,QAAU8oH,EAAOhjF,GACxB/lC,EAAOC,QAAQqtB,OAASy7F,EAAOE,GAE/BljF,EAAKowB,MAAQpwB,GAAK,WAChBh/B,OAAO8nB,eAAec,SAASnuB,UAAW,OAAQ,CAChDwB,MAAO,WACL,OAAO+iC,EAAKxkC,OAEdwtB,cAAc,IAGhBhoB,OAAO8nB,eAAec,SAASnuB,UAAW,aAAc,CACtDwB,MAAO,WACL,OAAOimH,EAAW1nH,OAEpBwtB,cAAc,kCCblB,IAAIo6F,EAAmC,oBAAfjwF,YACgB,oBAAhBuoE,aACe,oBAAfH,WAExB,SAAS8nB,EAAK3jH,EAAKG,GACjB,OAAOmB,OAAOvF,UAAUS,eAAeH,KAAK2D,EAAKG,GAGnD3F,EAAQ6pB,OAAS,SAAUrkB,GAEzB,IADA,IAAI4jH,EAAUpmH,MAAMzB,UAAU2C,MAAMrC,KAAK0E,UAAW,GAC7C6iH,EAAQxmH,QAAQ,CACrB,IAAIyuB,EAAS+3F,EAAQnnG,QACrB,GAAKoP,EAAL,CAEA,GAAsB,iBAAXA,EACT,MAAM,IAAIlF,UAAUkF,EAAS,sBAG/B,IAAK,IAAIvgB,KAAKugB,EACR83F,EAAK93F,EAAQvgB,KACftL,EAAIsL,GAAKugB,EAAOvgB,KAKtB,OAAOtL,GAKTxF,EAAQqpH,UAAY,SAAU/8G,EAAKpM,GACjC,OAAIoM,EAAI1J,SAAW1C,EAAeoM,EAC9BA,EAAIsrD,SAAmBtrD,EAAIsrD,SAAS,EAAG13D,IAC3CoM,EAAI1J,OAAS1C,EACNoM,IAIT,IAAIg9G,EAAU,CACZC,SAAU,SAAU91G,EAAMylC,EAAKswE,EAAU98G,EAAK+8G,GAC5C,GAAIvwE,EAAI0e,UAAYnkD,EAAKmkD,SACvBnkD,EAAKjT,IAAI04C,EAAI0e,SAAS4xD,EAAUA,EAAW98G,GAAM+8G,QAInD,IAAK,IAAI98G,EAAI,EAAGA,EAAID,EAAKC,IACvB8G,EAAKg2G,EAAY98G,GAAKusC,EAAIswE,EAAW78G,IAIzC+8G,cAAe,SAAUtQ,GACvB,IAAIzsG,EAAGoR,EAAGrR,EAAK+hB,EAAKgwB,EAAOj3C,EAI3B,IADAkF,EAAM,EACDC,EAAI,EAAGoR,EAAIq7F,EAAOx2G,OAAQ+J,EAAIoR,EAAGpR,IACpCD,GAAO0sG,EAAOzsG,GAAG/J,OAMnB,IAFA4E,EAAS,IAAIyxB,WAAWvsB,GACxB+hB,EAAM,EACD9hB,EAAI,EAAGoR,EAAIq7F,EAAOx2G,OAAQ+J,EAAIoR,EAAGpR,IACpC8xC,EAAQ26D,EAAOzsG,GACfnF,EAAOhH,IAAIi+C,EAAOhwB,GAClBA,GAAOgwB,EAAM77C,OAGf,OAAO4E,IAIPmiH,EAAY,CACdJ,SAAU,SAAU91G,EAAMylC,EAAKswE,EAAU98G,EAAK+8G,GAC5C,IAAK,IAAI98G,EAAI,EAAGA,EAAID,EAAKC,IACvB8G,EAAKg2G,EAAY98G,GAAKusC,EAAIswE,EAAW78G,IAIzC+8G,cAAe,SAAUtQ,GACvB,MAAO,GAAGv0G,OAAOyB,MAAM,GAAI8yG,KAO/Bp5G,EAAQ4pH,SAAW,SAAU5jF,GACvBA,GACFhmC,EAAQ6pH,KAAQ5wF,WAChBj5B,EAAQ8pH,MAAQtoB,YAChBxhG,EAAQ+pH,MAAQ1oB,WAChBrhG,EAAQ6pB,OAAO7pB,EAASspH,KAExBtpH,EAAQ6pH,KAAQ7mH,MAChBhD,EAAQ8pH,MAAQ9mH,MAChBhD,EAAQ+pH,MAAQ/mH,MAChBhD,EAAQ6pB,OAAO7pB,EAAS2pH,KAI5B3pH,EAAQ4pH,SAASV,0BCtDjBnpH,EAAOC,QAzBP,SAAiBgqH,EAAO19G,EAAKI,EAAK+hB,GAKhC,IAJA,IAAI4sB,EAAc,MAAR2uE,EAAiB,EACvB1uE,EAAO0uE,IAAU,GAAM,MAAS,EAChC1qG,EAAI,EAEO,IAAR5S,GAAW,CAKhBA,GADA4S,EAAI5S,EAAM,IAAO,IAAOA,EAGxB,GAEE4uC,EAAMA,GADND,EAAMA,EAAK/uC,EAAImiB,KAAS,GACR,UACPnP,GAEX+7B,GAAM,MACNC,GAAM,MAGR,OAAQD,EAAMC,GAAM,GAAM,0BCzB5Bv7C,EAAOC,QAAU,CAGf4pD,WAAoB,EACpBC,gBAAoB,EACpBC,aAAoB,EACpBC,aAAoB,EACpBC,SAAoB,EACpBC,QAAoB,EACpBggE,QAAoB,EAKpBj/D,KAAoB,EACpBE,aAAoB,EACpBJ,YAAoB,EACpByC,SAAoB,EACpBC,gBAAoB,EACpBvC,cAAoB,EAEpBG,aAAoB,EAIpB8+D,iBAA0B,EAC1BC,aAA0B,EAC1BC,mBAA0B,EAC1Bj9D,uBAA0B,EAG1B3B,WAA0B,EAC1BC,eAA0B,EAC1BC,MAA0B,EAC1BC,QAA0B,EAC1BC,mBAA0B,EAG1By+D,SAA0B,EAC1BC,OAA0B,EAE1BC,UAA0B,EAG1Bx+D,WAA0B,0BCxB5B,IAAIy+D,EAfJ,WAGE,IAFA,IAAI14G,EAAGkqD,EAAQ,GAEN18C,EAAI,EAAGA,EAAI,IAAKA,IAAK,CAC5BxN,EAAIwN,EACJ,IAAK,IAAIhL,EAAI,EAAGA,EAAI,EAAGA,IACrBxC,EAAU,EAAJA,EAAU,WAAcA,IAAM,EAAOA,IAAM,EAEnDkqD,EAAM18C,GAAKxN,EAGb,OAAOkqD,EAIMyuD,GAiBf1qH,EAAOC,QAdP,SAAe0qH,EAAKp+G,EAAKI,EAAK+hB,GAC5B,IAAI5Y,EAAI20G,EACJx7G,EAAMyf,EAAM/hB,EAEhBg+G,IAAQ,EAER,IAAK,IAAI/9G,EAAI8hB,EAAK9hB,EAAIqC,EAAKrC,IACzB+9G,EAAOA,IAAQ,EAAK70G,EAAmB,KAAhB60G,EAAMp+G,EAAIK,KAGnC,OAAgB,EAAR+9G,+BCjCV,IAkgCIC,EAlgCAt9C,EAAU,EAAQ,MAClBu9C,EAAU,EAAQ,KAClBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAClB//G,EAAU,EAAQ,MAuBlByiD,GAAmB,EAwDnBu9D,EAAY,IACZC,EAAgB,IAQhBC,EAAa,IACbC,EAAa,IACbC,EAAe,IASnB,SAAS9/G,EAAI+9C,EAAMgiE,GAEjB,OADAhiE,EAAKr+C,IAAMA,EAAIqgH,GACRA,EAGT,SAASC,EAAKp0F,GACZ,OAAQ,GAAO,IAAM,EAAM,EAAI,EAAI,GAGrC,SAASixD,EAAK57E,GAA6B,IAAtB,IAAII,EAAMJ,EAAI1J,SAAiB8J,GAAO,GAAKJ,EAAII,GAAO,EAS3E,SAAS4+G,EAAcliE,GACrB,IAAI3qC,EAAI2qC,EAAKrkD,MAGT2H,EAAM+R,EAAE2lF,QACR13F,EAAM08C,EAAKgB,YACb19C,EAAM08C,EAAKgB,WAED,IAAR19C,IAEJ2gE,EAAMk8C,SAASngE,EAAKthC,OAAQrJ,EAAE8sG,YAAa9sG,EAAE+sG,YAAa9+G,EAAK08C,EAAKiB,UACpEjB,EAAKiB,UAAY39C,EACjB+R,EAAE+sG,aAAe9+G,EACjB08C,EAAKqiE,WAAa/+G,EAClB08C,EAAKgB,WAAa19C,EAClB+R,EAAE2lF,SAAW13F,EACK,IAAd+R,EAAE2lF,UACJ3lF,EAAE+sG,YAAc,IAKpB,SAASE,EAAiBjtG,EAAG+hC,GAC3BoqE,EAAMe,gBAAgBltG,EAAIA,EAAEmtG,aAAe,EAAIntG,EAAEmtG,aAAe,EAAIntG,EAAEotG,SAAWptG,EAAEmtG,YAAaprE,GAChG/hC,EAAEmtG,YAAcntG,EAAEotG,SAClBP,EAAc7sG,EAAE2qC,MAIlB,SAAS0iE,EAASrtG,EAAGtK,GACnBsK,EAAE8sG,YAAY9sG,EAAE2lF,WAAajwF,EAS/B,SAAS43G,EAAYttG,EAAGtK,GAGtBsK,EAAE8sG,YAAY9sG,EAAE2lF,WAAcjwF,IAAM,EAAK,IACzCsK,EAAE8sG,YAAY9sG,EAAE2lF,WAAiB,IAAJjwF,EA6C/B,SAAS63G,EAAcvtG,EAAGwtG,GACxB,IAEI9iH,EACAuD,EAHAw/G,EAAeztG,EAAE0tG,iBACjBC,EAAO3tG,EAAEotG,SAGTQ,EAAW5tG,EAAE6tG,YACbC,EAAa9tG,EAAE8tG,WACfr6F,EAASzT,EAAEotG,SAAYptG,EAAE+tG,OAASxB,EAClCvsG,EAAEotG,UAAYptG,EAAE+tG,OAASxB,GAAiB,EAE1CyB,EAAOhuG,EAAE9M,OAET+6G,EAAQjuG,EAAEkuG,OACVxhH,EAAQsT,EAAEtT,KAMVyhH,EAASnuG,EAAEotG,SAAWd,EACtB8B,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,GAQzB5tG,EAAE6tG,aAAe7tG,EAAEsuG,aACrBb,IAAiB,GAKfK,EAAa9tG,EAAEuuG,YAAaT,EAAa9tG,EAAEuuG,WAI/C,GAaE,GAAIP,GAXJtjH,EAAQ8iH,GAWSI,KAAkBS,GAC/BL,EAAKtjH,EAAQkjH,EAAW,KAAOQ,GAC/BJ,EAAKtjH,KAA0BsjH,EAAKL,IACpCK,IAAOtjH,KAAwBsjH,EAAKL,EAAO,GAH/C,CAaAA,GAAQ,EACRjjH,IAMA,UAESsjH,IAAOL,KAAUK,IAAOtjH,IAAUsjH,IAAOL,KAAUK,IAAOtjH,IAC1DsjH,IAAOL,KAAUK,IAAOtjH,IAAUsjH,IAAOL,KAAUK,IAAOtjH,IAC1DsjH,IAAOL,KAAUK,IAAOtjH,IAAUsjH,IAAOL,KAAUK,IAAOtjH,IAC1DsjH,IAAOL,KAAUK,IAAOtjH,IAAUsjH,IAAOL,KAAUK,IAAOtjH,IAC1DijH,EAAOQ,GAOhB,GAHAlgH,EAAMq+G,GAAa6B,EAASR,GAC5BA,EAAOQ,EAAS7B,EAEZr+G,EAAM2/G,EAAU,CAGlB,GAFA5tG,EAAEwuG,YAAchB,EAChBI,EAAW3/G,EACPA,GAAO6/G,EACT,MAEFM,EAAaJ,EAAKL,EAAOC,EAAW,GACpCS,EAAaL,EAAKL,EAAOC,YAEnBJ,EAAY9gH,EAAK8gH,EAAYS,IAAUx6F,GAA4B,KAAjBg6F,GAE5D,OAAIG,GAAY5tG,EAAEuuG,UACTX,EAEF5tG,EAAEuuG,UAcX,SAASE,EAAYzuG,GACnB,IACI3N,EAAGwO,EAAGjf,EAAG8sH,EAAMxiH,EArJHy+C,EAAM98C,EAAKnE,EAAOjI,EAC9BwM,EAmJA0gH,EAAU3uG,EAAE+tG,OAKhB,EAAG,CAqBD,GApBAW,EAAO1uG,EAAE4uG,YAAc5uG,EAAEuuG,UAAYvuG,EAAEotG,SAoBnCptG,EAAEotG,UAAYuB,GAAWA,EAAUpC,GAAgB,CAErD39C,EAAMk8C,SAAS9qG,EAAE9M,OAAQ8M,EAAE9M,OAAQy7G,EAASA,EAAS,GACrD3uG,EAAEwuG,aAAeG,EACjB3uG,EAAEotG,UAAYuB,EAEd3uG,EAAEmtG,aAAewB,EAUjBt8G,EADAwO,EAAIb,EAAE6uG,UAEN,GACEjtH,EAAIoe,EAAEq/E,OAAOhtF,GACb2N,EAAEq/E,KAAKhtF,GAAMzQ,GAAK+sH,EAAU/sH,EAAI+sH,EAAU,UACjC9tG,GAGXxO,EADAwO,EAAI8tG,EAEJ,GACE/sH,EAAIoe,EAAEtT,OAAO2F,GACb2N,EAAEtT,KAAK2F,GAAMzQ,GAAK+sH,EAAU/sH,EAAI+sH,EAAU,UAIjC9tG,GAEX6tG,GAAQC,EAEV,GAAwB,IAApB3uG,EAAE2qC,KAAKc,SACT,MAmBF,GApOcd,EAgOD3qC,EAAE2qC,KAhOK98C,EAgOCmS,EAAE9M,OAhOExJ,EAgOMsW,EAAEotG,SAAWptG,EAAEuuG,UAhOd9sH,EAgOyBitH,EA/NvDzgH,OAAAA,GAAAA,EAAM08C,EAAKc,UAELhqD,IAAQwM,EAAMxM,GA6NtBof,EA5NU,IAAR5S,EAAoB,GAExB08C,EAAKc,UAAYx9C,EAGjB2gE,EAAMk8C,SAASj9G,EAAK88C,EAAK/hD,MAAO+hD,EAAKe,QAASz9C,EAAKvE,GAC3B,IAApBihD,EAAKrkD,MAAMwoG,KACbnkD,EAAK4gE,MAAQa,EAAQzhE,EAAK4gE,MAAO19G,EAAKI,EAAKvE,GAGhB,IAApBihD,EAAKrkD,MAAMwoG,OAClBnkD,EAAK4gE,MAAQc,EAAM1hE,EAAK4gE,MAAO19G,EAAKI,EAAKvE,IAG3CihD,EAAKe,SAAWz9C,EAChB08C,EAAKmkE,UAAY7gH,EAEVA,GA4ML+R,EAAEuuG,WAAa1tG,EAGXb,EAAEuuG,UAAYvuG,EAAE+uG,QAjUR,EA0UV,IARA7iH,EAAM8T,EAAEotG,SAAWptG,EAAE+uG,OACrB/uG,EAAEgvG,MAAQhvG,EAAE9M,OAAOhH,GAGnB8T,EAAEgvG,OAAUhvG,EAAEgvG,OAAShvG,EAAEivG,WAAcjvG,EAAE9M,OAAOhH,EAAM,IAAM8T,EAAEkvG,UAIvDlvG,EAAE+uG,SAEP/uG,EAAEgvG,OAAUhvG,EAAEgvG,OAAShvG,EAAEivG,WAAcjvG,EAAE9M,OAAOhH,EA5UxC,EA4U0D,IAAM8T,EAAEkvG,UAE1ElvG,EAAEtT,KAAKR,EAAM8T,EAAEkuG,QAAUluG,EAAEq/E,KAAKr/E,EAAEgvG,OAClChvG,EAAEq/E,KAAKr/E,EAAEgvG,OAAS9iH,EAClBA,IACA8T,EAAE+uG,WACE/uG,EAAEuuG,UAAYvuG,EAAE+uG,OAlVZ,aA2VL/uG,EAAEuuG,UAAYhC,GAAqC,IAApBvsG,EAAE2qC,KAAKc,UAmJjD,SAAS0jE,EAAanvG,EAAG8hC,GAIvB,IAHA,IAAIstE,EACAC,IAEK,CAMP,GAAIrvG,EAAEuuG,UAAYhC,EAAe,CAE/B,GADAkC,EAAYzuG,GACRA,EAAEuuG,UAAYhC,GAjkBF,IAikBmBzqE,EACjC,OA7egB,EA+elB,GAAoB,IAAhB9hC,EAAEuuG,UACJ,MA2BJ,GApBAa,EAAY,EACRpvG,EAAEuuG,WAtgBM,IAwgBVvuG,EAAEgvG,OAAUhvG,EAAEgvG,OAAShvG,EAAEivG,WAAcjvG,EAAE9M,OAAO8M,EAAEotG,SAxgBxC,EAwgB+D,IAAMptG,EAAEkvG,UACjFE,EAAYpvG,EAAEtT,KAAKsT,EAAEotG,SAAWptG,EAAEkuG,QAAUluG,EAAEq/E,KAAKr/E,EAAEgvG,OACrDhvG,EAAEq/E,KAAKr/E,EAAEgvG,OAAShvG,EAAEotG,UAOJ,IAAdgC,GAA4BpvG,EAAEotG,SAAWgC,GAAepvG,EAAE+tG,OAASxB,IAKrEvsG,EAAEsvG,aAAe/B,EAAcvtG,EAAGovG,IAGhCpvG,EAAEsvG,cAzhBM,EAqiBV,GAPAD,EAASlD,EAAMoD,UAAUvvG,EAAGA,EAAEotG,SAAWptG,EAAEwuG,YAAaxuG,EAAEsvG,aA9hBhD,GAgiBVtvG,EAAEuuG,WAAavuG,EAAEsvG,aAKbtvG,EAAEsvG,cAAgBtvG,EAAEwvG,gBAAuCxvG,EAAEuuG,WAriBvD,EAqiB+E,CACvFvuG,EAAEsvG,eACF,GACEtvG,EAAEotG,WAEFptG,EAAEgvG,OAAUhvG,EAAEgvG,OAAShvG,EAAEivG,WAAcjvG,EAAE9M,OAAO8M,EAAEotG,SA1iB5C,EA0iBmE,IAAMptG,EAAEkvG,UACjFE,EAAYpvG,EAAEtT,KAAKsT,EAAEotG,SAAWptG,EAAEkuG,QAAUluG,EAAEq/E,KAAKr/E,EAAEgvG,OACrDhvG,EAAEq/E,KAAKr/E,EAAEgvG,OAAShvG,EAAEotG,eAKQ,KAAnBptG,EAAEsvG,cACbtvG,EAAEotG,gBAGFptG,EAAEotG,UAAYptG,EAAEsvG,aAChBtvG,EAAEsvG,aAAe,EACjBtvG,EAAEgvG,MAAQhvG,EAAE9M,OAAO8M,EAAEotG,UAErBptG,EAAEgvG,OAAUhvG,EAAEgvG,OAAShvG,EAAEivG,WAAcjvG,EAAE9M,OAAO8M,EAAEotG,SAAW,IAAMptG,EAAEkvG,eAavEG,EAASlD,EAAMoD,UAAUvvG,EAAG,EAAGA,EAAE9M,OAAO8M,EAAEotG,WAE1CptG,EAAEuuG,YACFvuG,EAAEotG,WAEJ,GAAIiC,IAEFpC,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WACT,OAjkBgB,EAukBtB,OADA3rC,EAAE+uG,OAAW/uG,EAAEotG,SAAW,EAAmBptG,EAAEotG,SAAWqC,EAvpBtC,IAwpBhB3tE,GAEFmrE,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,UAxkBS,EACA,GA6kBlB3rC,EAAE0vG,WAEJzC,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WAnlBS,EACA,EA+lBxB,SAASgkE,EAAa3vG,EAAG8hC,GAOvB,IANA,IAAIstE,EACAC,EAEAO,IAGK,CAMP,GAAI5vG,EAAEuuG,UAAYhC,EAAe,CAE/B,GADAkC,EAAYzuG,GACRA,EAAEuuG,UAAYhC,GApsBF,IAosBmBzqE,EACjC,OAhnBgB,EAknBlB,GAAoB,IAAhB9hC,EAAEuuG,UAAmB,MA0C3B,GApCAa,EAAY,EACRpvG,EAAEuuG,WAvoBM,IAyoBVvuG,EAAEgvG,OAAUhvG,EAAEgvG,OAAShvG,EAAEivG,WAAcjvG,EAAE9M,OAAO8M,EAAEotG,SAzoBxC,EAyoB+D,IAAMptG,EAAEkvG,UACjFE,EAAYpvG,EAAEtT,KAAKsT,EAAEotG,SAAWptG,EAAEkuG,QAAUluG,EAAEq/E,KAAKr/E,EAAEgvG,OACrDhvG,EAAEq/E,KAAKr/E,EAAEgvG,OAAShvG,EAAEotG,UAMtBptG,EAAE6tG,YAAc7tG,EAAEsvG,aAClBtvG,EAAE6vG,WAAa7vG,EAAEwuG,YACjBxuG,EAAEsvG,aAAeG,EAEC,IAAdL,GAA0BpvG,EAAE6tG,YAAc7tG,EAAEwvG,gBAC5CxvG,EAAEotG,SAAWgC,GAAcpvG,EAAE+tG,OAASxB,IAKxCvsG,EAAEsvG,aAAe/B,EAAcvtG,EAAGovG,GAG9BpvG,EAAEsvG,cAAgB,IAvsBA,IAwsBlBtvG,EAAE8pC,UA/pBI,IA+pBwB9pC,EAAEsvG,cAA8BtvG,EAAEotG,SAAWptG,EAAEwuG,YAAc,QAK7FxuG,EAAEsvG,aAAeG,IAMjBzvG,EAAE6tG,aA1qBM,GA0qBsB7tG,EAAEsvG,cAAgBtvG,EAAE6tG,YAAa,CACjE+B,EAAa5vG,EAAEotG,SAAWptG,EAAEuuG,UA3qBlB,EAkrBVc,EAASlD,EAAMoD,UAAUvvG,EAAGA,EAAEotG,SAAW,EAAIptG,EAAE6vG,WAAY7vG,EAAE6tG,YAlrBnD,GAwrBV7tG,EAAEuuG,WAAavuG,EAAE6tG,YAAc,EAC/B7tG,EAAE6tG,aAAe,EACjB,KACQ7tG,EAAEotG,UAAYwC,IAElB5vG,EAAEgvG,OAAUhvG,EAAEgvG,OAAShvG,EAAEivG,WAAcjvG,EAAE9M,OAAO8M,EAAEotG,SA7rB5C,EA6rBmE,IAAMptG,EAAEkvG,UACjFE,EAAYpvG,EAAEtT,KAAKsT,EAAEotG,SAAWptG,EAAEkuG,QAAUluG,EAAEq/E,KAAKr/E,EAAEgvG,OACrDhvG,EAAEq/E,KAAKr/E,EAAEgvG,OAAShvG,EAAEotG,gBAGK,KAAlBptG,EAAE6tG,aAKb,GAJA7tG,EAAE8vG,gBAAkB,EACpB9vG,EAAEsvG,aAAeG,EACjBzvG,EAAEotG,WAEEiC,IAEFpC,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WACT,OA7rBc,OAksBb,GAAI3rC,EAAE8vG,iBAgBX,IATAT,EAASlD,EAAMoD,UAAUvvG,EAAG,EAAGA,EAAE9M,OAAO8M,EAAEotG,SAAW,MAInDH,EAAiBjtG,GAAG,GAGtBA,EAAEotG,WACFptG,EAAEuuG,YACuB,IAArBvuG,EAAE2qC,KAAKgB,UACT,OAntBgB,OAytBlB3rC,EAAE8vG,gBAAkB,EACpB9vG,EAAEotG,WACFptG,EAAEuuG,YAYN,OARIvuG,EAAE8vG,kBAGJT,EAASlD,EAAMoD,UAAUvvG,EAAG,EAAGA,EAAE9M,OAAO8M,EAAEotG,SAAW,IAErDptG,EAAE8vG,gBAAkB,GAEtB9vG,EAAE+uG,OAAS/uG,EAAEotG,SAAWqC,EAAgBzvG,EAAEotG,SAAWqC,EAvzBjC,IAwzBhB3tE,GAEFmrE,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,UAxuBS,EACA,GA6uBlB3rC,EAAE0vG,WAEJzC,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WAnvBS,EACA,EAy5BxB,SAASokE,EAAOC,EAAaC,EAAUC,EAAaC,EAAWnxD,GAC7Dn8D,KAAKmtH,YAAcA,EACnBntH,KAAKotH,SAAWA,EAChBptH,KAAKqtH,YAAcA,EACnBrtH,KAAKstH,UAAYA,EACjBttH,KAAKm8D,KAAOA,EA+Cd,SAASoxD,IACPvtH,KAAK8nD,KAAO,KACZ9nD,KAAKwtH,OAAS,EACdxtH,KAAKiqH,YAAc,KACnBjqH,KAAKytH,iBAAmB,EACxBztH,KAAKkqH,YAAc,EACnBlqH,KAAK8iG,QAAU,EACf9iG,KAAKisG,KAAO,EACZjsG,KAAK0tH,OAAS,KACd1tH,KAAK2tH,QAAU,EACf3tH,KAAK8E,OAjgCW,EAkgChB9E,KAAK4tH,YAAc,EAEnB5tH,KAAKkrH,OAAS,EACdlrH,KAAK6tH,OAAS,EACd7tH,KAAKqrH,OAAS,EAEdrrH,KAAKqQ,OAAS,KAQdrQ,KAAK+rH,YAAc,EAKnB/rH,KAAK6J,KAAO,KAMZ7J,KAAKw8F,KAAO,KAEZx8F,KAAKmsH,MAAQ,EACbnsH,KAAKgsH,UAAY,EACjBhsH,KAAK8tH,UAAY,EACjB9tH,KAAKqsH,UAAY,EAEjBrsH,KAAKosH,WAAa,EAOlBpsH,KAAKsqH,YAAc,EAKnBtqH,KAAKysH,aAAe,EACpBzsH,KAAKgtH,WAAa,EAClBhtH,KAAKitH,gBAAkB,EACvBjtH,KAAKuqH,SAAW,EAChBvqH,KAAK2rH,YAAc,EACnB3rH,KAAK0rH,UAAY,EAEjB1rH,KAAKgrH,YAAc,EAKnBhrH,KAAK6qH,iBAAmB,EAMxB7qH,KAAK2sH,eAAiB,EAYtB3sH,KAAK+mD,MAAQ,EACb/mD,KAAKinD,SAAW,EAEhBjnD,KAAKyrH,WAAa,EAGlBzrH,KAAKirH,WAAa,EAYlBjrH,KAAK+tH,UAAa,IAAIhiD,EAAMy8C,MAAMwF,MAClChuH,KAAKiuH,UAAa,IAAIliD,EAAMy8C,MAAM,KAClCxoH,KAAKkuH,QAAa,IAAIniD,EAAMy8C,MAAM,IAClC5hC,EAAK5mF,KAAK+tH,WACVnnC,EAAK5mF,KAAKiuH,WACVrnC,EAAK5mF,KAAKkuH,SAEVluH,KAAKmuH,OAAW,KAChBnuH,KAAKouH,OAAW,KAChBpuH,KAAKquH,QAAW,KAGhBruH,KAAKsuH,SAAW,IAAIviD,EAAMy8C,MAAM+F,IAIhCvuH,KAAKwuH,KAAO,IAAIziD,EAAMy8C,MAAM,KAC5B5hC,EAAK5mF,KAAKwuH,MAEVxuH,KAAKyuH,SAAW,EAChBzuH,KAAK0uH,SAAW,EAKhB1uH,KAAKmwB,MAAQ,IAAI47C,EAAMy8C,MAAM,KAC7B5hC,EAAK5mF,KAAKmwB,OAIVnwB,KAAK2uH,MAAQ,EAEb3uH,KAAK4uH,YAAc,EAoBnB5uH,KAAK6sH,SAAW,EAEhB7sH,KAAK6uH,MAAQ,EAMb7uH,KAAK8uH,QAAU,EACf9uH,KAAK+uH,WAAa,EAClB/uH,KAAKgvH,QAAU,EACfhvH,KAAKksH,OAAS,EAGdlsH,KAAKivH,OAAS,EAIdjvH,KAAKkvH,SAAW,EAgBlB,SAASC,EAAiBrnE,GACxB,IAAI3qC,EAEJ,OAAK2qC,GAASA,EAAKrkD,OAInBqkD,EAAKmkE,SAAWnkE,EAAKqiE,UAAY,EACjCriE,EAAKsnE,UAhsCqB,GAksC1BjyG,EAAI2qC,EAAKrkD,OACPq/F,QAAU,EACZ3lF,EAAE+sG,YAAc,EAEZ/sG,EAAE8uF,KAAO,IACX9uF,EAAE8uF,MAAQ9uF,EAAE8uF,MAGd9uF,EAAEqwG,OAAUrwG,EAAE8uF,KArqCC,GAqqCmB2d,EAClC9hE,EAAK4gE,MAAoB,IAAXvrG,EAAE8uF,KACd,EAEA,EACF9uF,EAAEywG,WAvvCkB,EAwvCpBtE,EAAM+F,SAASlyG,GA5uCK,GAwtCXpT,EAAI+9C,EAAMoE,GAyBrB,SAAStB,EAAa9C,GACpB,IAlPe3qC,EAkPXxJ,EAAMw7G,EAAiBrnE,GAI3B,OAtvCoB,IAmvChBn0C,KAnPWwJ,EAoPL2qC,EAAKrkD,OAnPbsoH,YAAc,EAAI5uG,EAAE+tG,OAGtBtkC,EAAKzpE,EAAEq/E,MAIPr/E,EAAEwvG,eAAiBtD,EAAoBlsG,EAAE4pC,OAAOqmE,SAChDjwG,EAAEsuG,WAAapC,EAAoBlsG,EAAE4pC,OAAOomE,YAC5ChwG,EAAE8tG,WAAa5B,EAAoBlsG,EAAE4pC,OAAOsmE,YAC5ClwG,EAAE0tG,iBAAmBxB,EAAoBlsG,EAAE4pC,OAAOumE,UAElDnwG,EAAEotG,SAAW,EACbptG,EAAEmtG,YAAc,EAChBntG,EAAEuuG,UAAY,EACdvuG,EAAE+uG,OAAS,EACX/uG,EAAEsvG,aAAetvG,EAAE6tG,YAAc4B,EACjCzvG,EAAE8vG,gBAAkB,EACpB9vG,EAAEgvG,MAAQ,GAmOHx4G,EAYT,SAAS62C,EAAa1C,EAAMf,EAAOjiD,EAAQoiD,EAAYF,EAAUC,GAC/D,IAAKa,EACH,OAAOoE,EAET,IAAI+/C,EAAO,EAiBX,IAxwC0B,IAyvCtBllD,IACFA,EAAQ,GAGNG,EAAa,GACf+kD,EAAO,EACP/kD,GAAcA,GAGPA,EAAa,KACpB+kD,EAAO,EACP/kD,GAAc,IAIZF,EAAW,GAAKA,EAlvCF,GALF,IAuvCgCliD,GAC9CoiD,EAAa,GAAKA,EAAa,IAAMH,EAAQ,GAAKA,EAAQ,GAC1DE,EAAW,GAAKA,EApwCQ,EAqwCxB,OAAOl9C,EAAI+9C,EAAMoE,GAIA,IAAfhF,IACFA,EAAa,GAIf,IAAI/pC,EAAI,IAAIowG,EA0CZ,OAxCAzlE,EAAKrkD,MAAQ0Z,EACbA,EAAE2qC,KAAOA,EAET3qC,EAAE8uF,KAAOA,EACT9uF,EAAEuwG,OAAS,KACXvwG,EAAE0wG,OAAS3mE,EACX/pC,EAAE+tG,OAAS,GAAK/tG,EAAE0wG,OAClB1wG,EAAEkuG,OAASluG,EAAE+tG,OAAS,EAEtB/tG,EAAE2wG,UAAY9mE,EAAW,EACzB7pC,EAAE6uG,UAAY,GAAK7uG,EAAE2wG,UACrB3wG,EAAEkvG,UAAYlvG,EAAE6uG,UAAY,EAC5B7uG,EAAEivG,eAAiBjvG,EAAE2wG,UAtvCP,EAsvC+B,GAtvC/B,GAwvCd3wG,EAAE9M,OAAS,IAAI07D,EAAMw8C,KAAgB,EAAXprG,EAAE+tG,QAC5B/tG,EAAEq/E,KAAO,IAAIzwB,EAAMy8C,MAAMrrG,EAAE6uG,WAC3B7uG,EAAEtT,KAAO,IAAIkiE,EAAMy8C,MAAMrrG,EAAE+tG,QAK3B/tG,EAAEyxG,YAAc,GAAM5nE,EAAW,EAEjC7pC,EAAEswG,iBAAmC,EAAhBtwG,EAAEyxG,YAIvBzxG,EAAE8sG,YAAc,IAAIl+C,EAAMw8C,KAAKprG,EAAEswG,kBAIjCtwG,EAAE0xG,MAAQ,EAAI1xG,EAAEyxG,YAGhBzxG,EAAEwxG,MAAQ,EAAUxxG,EAAEyxG,YAEtBzxG,EAAE4pC,MAAQA,EACV5pC,EAAE8pC,SAAWA,EACb9pC,EAAErY,OAASA,EAEJ8lD,EAAa9C,GAhWtBuhE,EAAsB,CAEpB,IAAI6D,EAAO,EAAG,EAAG,EAAG,GAxiBtB,SAAwB/vG,EAAG8hC,GAIzB,IAAIqwE,EAAiB,MAOrB,IALIA,EAAiBnyG,EAAEswG,iBAAmB,IACxC6B,EAAiBnyG,EAAEswG,iBAAmB,KAI/B,CAEP,GAAItwG,EAAEuuG,WAAa,EAAG,CAUpB,GADAE,EAAYzuG,GACQ,IAAhBA,EAAEuuG,WA1eU,IA0eSzsE,EACvB,OAtZgB,EAyZlB,GAAoB,IAAhB9hC,EAAEuuG,UACJ,MAOJvuG,EAAEotG,UAAYptG,EAAEuuG,UAChBvuG,EAAEuuG,UAAY,EAGd,IAAI6D,EAAYpyG,EAAEmtG,YAAcgF,EAEhC,IAAmB,IAAfnyG,EAAEotG,UAAkBptG,EAAEotG,UAAYgF,KAEpCpyG,EAAEuuG,UAAYvuG,EAAEotG,SAAWgF,EAC3BpyG,EAAEotG,SAAWgF,EAEbnF,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WACT,OA9agB,EAubpB,GAAI3rC,EAAEotG,SAAWptG,EAAEmtG,aAAgBntG,EAAE+tG,OAASxB,IAE5CU,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WACT,OA3bgB,EAmctB,OAFA3rC,EAAE+uG,OAAS,EAlhBS,IAohBhBjtE,GAEFmrE,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,UApcS,EACA,IA0clB3rC,EAAEotG,SAAWptG,EAAEmtG,cAEjBF,EAAiBjtG,GAAG,GAChBA,EAAE2qC,KAAKgB,WAhdS,MAu6BtB,IAAIokE,EAAO,EAAG,EAAG,EAAG,EAAGZ,GACvB,IAAIY,EAAO,EAAG,EAAG,GAAI,EAAGZ,GACxB,IAAIY,EAAO,EAAG,EAAG,GAAI,GAAIZ,GAEzB,IAAIY,EAAO,EAAG,EAAG,GAAI,GAAIJ,GACzB,IAAII,EAAO,EAAG,GAAI,GAAI,GAAIJ,GAC1B,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,GAC5B,IAAII,EAAO,EAAG,GAAI,IAAK,IAAKJ,GAC5B,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,GAC/B,IAAII,EAAO,GAAI,IAAK,IAAK,KAAMJ,IA2xBjCpuH,EAAQ8wH,YApcR,SAAqB1nE,EAAMf,GACzB,OAAOyD,EAAa1C,EAAMf,EAjzCV,EAOF,GAEI,EAnBQ,IA+vD5BroD,EAAQ8rD,aAAeA,EACvB9rD,EAAQksD,aAAeA,EACvBlsD,EAAQywH,iBAAmBA,EAC3BzwH,EAAQ+wH,iBA9hBR,SAA0B3nE,EAAM00C,GAC9B,OAAK10C,GAASA,EAAKrkD,MACK,IAApBqkD,EAAKrkD,MAAMwoG,KAAqB//C,GACpCpE,EAAKrkD,MAAMiqH,OAASlxB,EA7vCA,GA2vCetwC,GA8hBrCxtD,EAAQ4qD,QApcR,SAAiBxB,EAAM7I,GACrB,IAAIywE,EAAWvyG,EACXwyG,EAAKhqH,EAET,IAAKmiD,IAASA,EAAKrkD,OACjBw7C,EAj2CkB,GAi2CCA,EAAQ,EAC3B,OAAO6I,EAAO/9C,EAAI+9C,EAAMoE,GAAkBA,EAK5C,GAFA/uC,EAAI2qC,EAAKrkD,OAEJqkD,EAAKthC,SACJshC,EAAK/hD,OAA2B,IAAlB+hD,EAAKc,UACpBzrC,EAAEqwG,SAAW3D,GA12CE,IA02Cc5qE,EAChC,OAAOl1C,EAAI+9C,EAA0B,IAAnBA,EAAKgB,WA51CL,EA41CsCoD,GAQ1D,GALA/uC,EAAE2qC,KAAOA,EACT4nE,EAAYvyG,EAAEywG,WACdzwG,EAAEywG,WAAa3uE,EAvyCA,KA0yCX9hC,EAAEqwG,OAEJ,GAAe,IAAXrwG,EAAE8uF,KACJnkD,EAAK4gE,MAAQ,EACb8B,EAASrtG,EAAG,IACZqtG,EAASrtG,EAAG,KACZqtG,EAASrtG,EAAG,GACPA,EAAEuwG,QAaLlD,EAASrtG,GAAIA,EAAEuwG,OAAOkC,KAAO,EAAI,IACpBzyG,EAAEuwG,OAAOmC,KAAO,EAAI,IACnB1yG,EAAEuwG,OAAOoC,MAAY,EAAJ,IACjB3yG,EAAEuwG,OAAO5tH,KAAW,EAAJ,IAChBqd,EAAEuwG,OAAO3nD,QAAc,GAAJ,IAEjCykD,EAASrtG,EAAmB,IAAhBA,EAAEuwG,OAAOj/G,MACrB+7G,EAASrtG,EAAIA,EAAEuwG,OAAOj/G,MAAQ,EAAK,KACnC+7G,EAASrtG,EAAIA,EAAEuwG,OAAOj/G,MAAQ,GAAM,KACpC+7G,EAASrtG,EAAIA,EAAEuwG,OAAOj/G,MAAQ,GAAM,KACpC+7G,EAASrtG,EAAe,IAAZA,EAAE4pC,MAAc,EACf5pC,EAAE8pC,UAv3CK,GAu3CyB9pC,EAAE4pC,MAAQ,EAC1C,EAAI,GACjByjE,EAASrtG,EAAiB,IAAdA,EAAEuwG,OAAOqC,IACjB5yG,EAAEuwG,OAAOoC,OAAS3yG,EAAEuwG,OAAOoC,MAAMxuH,SACnCkpH,EAASrtG,EAA2B,IAAxBA,EAAEuwG,OAAOoC,MAAMxuH,QAC3BkpH,EAASrtG,EAAIA,EAAEuwG,OAAOoC,MAAMxuH,QAAU,EAAK,MAEzC6b,EAAEuwG,OAAOmC,OACX/nE,EAAK4gE,MAAQc,EAAM1hE,EAAK4gE,MAAOvrG,EAAE8sG,YAAa9sG,EAAE2lF,QAAS,IAE3D3lF,EAAEwwG,QAAU,EACZxwG,EAAEqwG,OAn1CQ,KAizCVhD,EAASrtG,EAAG,GACZqtG,EAASrtG,EAAG,GACZqtG,EAASrtG,EAAG,GACZqtG,EAASrtG,EAAG,GACZqtG,EAASrtG,EAAG,GACZqtG,EAASrtG,EAAe,IAAZA,EAAE4pC,MAAc,EACf5pC,EAAE8pC,UAt2CK,GAs2CyB9pC,EAAE4pC,MAAQ,EAC1C,EAAI,GACjByjE,EAASrtG,EA7yCH,GA8yCNA,EAAEqwG,OAAS5D,OA6Bf,CACE,IAAI17G,EA13CQ,GA03CiBiP,EAAE0wG,OAAS,GAAM,IAAO,EAYrD3/G,IATIiP,EAAE8pC,UA14CgB,GA04Cc9pC,EAAE4pC,MAAQ,EAC9B,EACL5pC,EAAE4pC,MAAQ,EACL,EACO,IAAZ5pC,EAAE4pC,MACG,EAEA,IAEU,EACP,IAAf5pC,EAAEotG,WAAkBr8G,GAx2CZ,IAy2CZA,GAAU,GAAMA,EAAS,GAEzBiP,EAAEqwG,OAAS5D,EACXa,EAAYttG,EAAGjP,GAGI,IAAfiP,EAAEotG,WACJE,EAAYttG,EAAG2qC,EAAK4gE,QAAU,IAC9B+B,EAAYttG,EAAgB,MAAb2qC,EAAK4gE,QAEtB5gE,EAAK4gE,MAAQ,EAKjB,GAr3CgB,KAq3CZvrG,EAAEqwG,OACJ,GAAIrwG,EAAEuwG,OAAOoC,MAAqB,CAGhC,IAFAH,EAAMxyG,EAAE2lF,QAED3lF,EAAEwwG,SAAmC,MAAxBxwG,EAAEuwG,OAAOoC,MAAMxuH,UAC7B6b,EAAE2lF,UAAY3lF,EAAEswG,mBACdtwG,EAAEuwG,OAAOmC,MAAQ1yG,EAAE2lF,QAAU6sB,IAC/B7nE,EAAK4gE,MAAQc,EAAM1hE,EAAK4gE,MAAOvrG,EAAE8sG,YAAa9sG,EAAE2lF,QAAU6sB,EAAKA,IAEjE3F,EAAcliE,GACd6nE,EAAMxyG,EAAE2lF,QACJ3lF,EAAE2lF,UAAY3lF,EAAEswG,oBAItBjD,EAASrtG,EAA+B,IAA5BA,EAAEuwG,OAAOoC,MAAM3yG,EAAEwwG,UAC7BxwG,EAAEwwG,UAEAxwG,EAAEuwG,OAAOmC,MAAQ1yG,EAAE2lF,QAAU6sB,IAC/B7nE,EAAK4gE,MAAQc,EAAM1hE,EAAK4gE,MAAOvrG,EAAE8sG,YAAa9sG,EAAE2lF,QAAU6sB,EAAKA,IAE7DxyG,EAAEwwG,UAAYxwG,EAAEuwG,OAAOoC,MAAMxuH,SAC/B6b,EAAEwwG,QAAU,EACZxwG,EAAEqwG,OA34CO,SA+4CXrwG,EAAEqwG,OA/4CS,GAk5Cf,GAl5Ce,KAk5CXrwG,EAAEqwG,OACJ,GAAIrwG,EAAEuwG,OAAO5tH,KAAoB,CAC/B6vH,EAAMxyG,EAAE2lF,QAGR,EAAG,CACD,GAAI3lF,EAAE2lF,UAAY3lF,EAAEswG,mBACdtwG,EAAEuwG,OAAOmC,MAAQ1yG,EAAE2lF,QAAU6sB,IAC/B7nE,EAAK4gE,MAAQc,EAAM1hE,EAAK4gE,MAAOvrG,EAAE8sG,YAAa9sG,EAAE2lF,QAAU6sB,EAAKA,IAEjE3F,EAAcliE,GACd6nE,EAAMxyG,EAAE2lF,QACJ3lF,EAAE2lF,UAAY3lF,EAAEswG,kBAAkB,CACpC9nH,EAAM,EACN,MAKFA,EADEwX,EAAEwwG,QAAUxwG,EAAEuwG,OAAO5tH,KAAKwB,OACkB,IAAxC6b,EAAEuwG,OAAO5tH,KAAKuO,WAAW8O,EAAEwwG,WAE3B,EAERnD,EAASrtG,EAAGxX,SACG,IAARA,GAELwX,EAAEuwG,OAAOmC,MAAQ1yG,EAAE2lF,QAAU6sB,IAC/B7nE,EAAK4gE,MAAQc,EAAM1hE,EAAK4gE,MAAOvrG,EAAE8sG,YAAa9sG,EAAE2lF,QAAU6sB,EAAKA,IAErD,IAARhqH,IACFwX,EAAEwwG,QAAU,EACZxwG,EAAEqwG,OAh7CU,SAo7CdrwG,EAAEqwG,OAp7CY,GAu7ClB,GAv7CkB,KAu7CdrwG,EAAEqwG,OACJ,GAAIrwG,EAAEuwG,OAAO3nD,QAAuB,CAClC4pD,EAAMxyG,EAAE2lF,QAGR,EAAG,CACD,GAAI3lF,EAAE2lF,UAAY3lF,EAAEswG,mBACdtwG,EAAEuwG,OAAOmC,MAAQ1yG,EAAE2lF,QAAU6sB,IAC/B7nE,EAAK4gE,MAAQc,EAAM1hE,EAAK4gE,MAAOvrG,EAAE8sG,YAAa9sG,EAAE2lF,QAAU6sB,EAAKA,IAEjE3F,EAAcliE,GACd6nE,EAAMxyG,EAAE2lF,QACJ3lF,EAAE2lF,UAAY3lF,EAAEswG,kBAAkB,CACpC9nH,EAAM,EACN,MAKFA,EADEwX,EAAEwwG,QAAUxwG,EAAEuwG,OAAO3nD,QAAQzkE,OACkB,IAA3C6b,EAAEuwG,OAAO3nD,QAAQ13D,WAAW8O,EAAEwwG,WAE9B,EAERnD,EAASrtG,EAAGxX,SACG,IAARA,GAELwX,EAAEuwG,OAAOmC,MAAQ1yG,EAAE2lF,QAAU6sB,IAC/B7nE,EAAK4gE,MAAQc,EAAM1hE,EAAK4gE,MAAOvrG,EAAE8sG,YAAa9sG,EAAE2lF,QAAU6sB,EAAKA,IAErD,IAARhqH,IACFwX,EAAEqwG,OAAS7D,QAIbxsG,EAAEqwG,OAAS7D,EAsBf,GAnBIxsG,EAAEqwG,SAAW7D,IACXxsG,EAAEuwG,OAAOmC,MACP1yG,EAAE2lF,QAAU,EAAI3lF,EAAEswG,kBACpBzD,EAAcliE,GAEZ3qC,EAAE2lF,QAAU,GAAK3lF,EAAEswG,mBACrBjD,EAASrtG,EAAgB,IAAb2qC,EAAK4gE,OACjB8B,EAASrtG,EAAI2qC,EAAK4gE,OAAS,EAAK,KAChC5gE,EAAK4gE,MAAQ,EACbvrG,EAAEqwG,OAAS5D,IAIbzsG,EAAEqwG,OAAS5D,GAMG,IAAdzsG,EAAE2lF,SAEJ,GADAknB,EAAcliE,GACS,IAAnBA,EAAKgB,UAQP,OADA3rC,EAAEywG,YAAc,EA5jDA,OAokDb,GAAsB,IAAlB9lE,EAAKc,UAAkBmhE,EAAK9qE,IAAU8qE,EAAK2F,IA5kDlC,IA6kDlBzwE,EACA,OAAOl1C,EAAI+9C,GA/jDO,GAmkDpB,GAAI3qC,EAAEqwG,SAAW3D,GAAkC,IAAlB/hE,EAAKc,SACpC,OAAO7+C,EAAI+9C,GApkDO,GAykDpB,GAAsB,IAAlBA,EAAKc,UAAkC,IAAhBzrC,EAAEuuG,WA5lDT,IA6lDjBzsE,GAAwB9hC,EAAEqwG,SAAW3D,EAAe,CACrD,IAAImG,EA/jDoB,IA+jDV7yG,EAAE8pC,SAxqBpB,SAAsB9pC,EAAG8hC,GAGvB,IAFA,IAAIutE,IAEK,CAEP,GAAoB,IAAhBrvG,EAAEuuG,YACJE,EAAYzuG,GACQ,IAAhBA,EAAEuuG,WAAiB,CACrB,GA97Bc,IA87BVzsE,EACF,OA12Bc,EA42BhB,MAWJ,GANA9hC,EAAEsvG,aAAe,EAGjBD,EAASlD,EAAMoD,UAAUvvG,EAAG,EAAGA,EAAE9M,OAAO8M,EAAEotG,WAC1CptG,EAAEuuG,YACFvuG,EAAEotG,WACEiC,IAEFpC,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WACT,OA33BgB,EAi4BtB,OADA3rC,EAAE+uG,OAAS,EAj9BS,IAk9BhBjtE,GAEFmrE,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,UAl4BS,EACA,GAu4BlB3rC,EAAE0vG,WAEJzC,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WA74BS,EACA,EAwgD2BmnE,CAAa9yG,EAAG8hC,GA9jDvC,IA+jDrB9hC,EAAE8pC,SAxwBT,SAAqB9pC,EAAG8hC,GAOtB,IANA,IAAIutE,EACA3iH,EACAihH,EAAMQ,EAENH,EAAOhuG,EAAE9M,SAEJ,CAKP,GAAI8M,EAAEuuG,WAAajC,EAAW,CAE5B,GADAmC,EAAYzuG,GACRA,EAAEuuG,WAAajC,GAr2BH,IAq2BgBxqE,EAC9B,OAjxBgB,EAmxBlB,GAAoB,IAAhB9hC,EAAEuuG,UAAmB,MAK3B,GADAvuG,EAAEsvG,aAAe,EACbtvG,EAAEuuG,WAtyBM,GAsyBoBvuG,EAAEotG,SAAW,IAE3C1gH,EAAOshH,EADPL,EAAO3tG,EAAEotG,SAAW,MAEPY,IAAOL,IAASjhH,IAASshH,IAAOL,IAASjhH,IAASshH,IAAOL,GAAO,CAC3EQ,EAASnuG,EAAEotG,SAAWd,EACtB,UAES5/G,IAASshH,IAAOL,IAASjhH,IAASshH,IAAOL,IACzCjhH,IAASshH,IAAOL,IAASjhH,IAASshH,IAAOL,IACzCjhH,IAASshH,IAAOL,IAASjhH,IAASshH,IAAOL,IACzCjhH,IAASshH,IAAOL,IAASjhH,IAASshH,IAAOL,IACzCA,EAAOQ,GAChBnuG,EAAEsvG,aAAehD,GAAa6B,EAASR,GACnC3tG,EAAEsvG,aAAetvG,EAAEuuG,YACrBvuG,EAAEsvG,aAAetvG,EAAEuuG,WAyBzB,GAlBIvuG,EAAEsvG,cA3zBM,GA+zBVD,EAASlD,EAAMoD,UAAUvvG,EAAG,EAAGA,EAAEsvG,aA/zBvB,GAi0BVtvG,EAAEuuG,WAAavuG,EAAEsvG,aACjBtvG,EAAEotG,UAAYptG,EAAEsvG,aAChBtvG,EAAEsvG,aAAe,IAKjBD,EAASlD,EAAMoD,UAAUvvG,EAAG,EAAGA,EAAE9M,OAAO8M,EAAEotG,WAE1CptG,EAAEuuG,YACFvuG,EAAEotG,YAEAiC,IAEFpC,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WACT,OAn0BgB,EAy0BtB,OADA3rC,EAAE+uG,OAAS,EAz5BS,IA05BhBjtE,GAEFmrE,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,UA10BS,EACA,GA+0BlB3rC,EAAE0vG,WAEJzC,EAAiBjtG,GAAG,GACK,IAArBA,EAAE2qC,KAAKgB,WAr1BS,EACA,EAygDMonE,CAAY/yG,EAAG8hC,GACrCoqE,EAAoBlsG,EAAE4pC,OAAOoV,KAAKh/C,EAAG8hC,GAKzC,GA9gDoB,IA2gDhB+wE,GA1gDgB,IA0gDgBA,IAClC7yG,EAAEqwG,OAAS3D,GA9gDO,IAghDhBmG,GA9gDgB,IA8gDWA,EAK7B,OAJuB,IAAnBloE,EAAKgB,YACP3rC,EAAEywG,YAAc,GA3lDF,EAumDlB,GA7hDoB,IA6hDhBoC,IAlnDc,IAmnDZ/wE,EACFqqE,EAAM6G,UAAUhzG,GAhnDF,IAknDP8hC,IAEPqqE,EAAM8G,iBAAiBjzG,EAAG,EAAG,GAAG,GAtnDlB,IA0nDV8hC,IAEF2nC,EAAKzpE,EAAEq/E,MAEa,IAAhBr/E,EAAEuuG,YACJvuG,EAAEotG,SAAW,EACbptG,EAAEmtG,YAAc,EAChBntG,EAAE+uG,OAAS,KAIjBlC,EAAcliE,GACS,IAAnBA,EAAKgB,WAEP,OADA3rC,EAAEywG,YAAc,EA9nDF,EAsoDpB,OA9oDoB,IA8oDhB3uE,EAtoDgB,EAuoDhB9hC,EAAE8uF,MAAQ,EAtoDM,GAyoDL,IAAX9uF,EAAE8uF,MACJue,EAASrtG,EAAgB,IAAb2qC,EAAK4gE,OACjB8B,EAASrtG,EAAI2qC,EAAK4gE,OAAS,EAAK,KAChC8B,EAASrtG,EAAI2qC,EAAK4gE,OAAS,GAAM,KACjC8B,EAASrtG,EAAI2qC,EAAK4gE,OAAS,GAAM,KACjC8B,EAASrtG,EAAmB,IAAhB2qC,EAAKmkE,UACjBzB,EAASrtG,EAAI2qC,EAAKmkE,UAAY,EAAK,KACnCzB,EAASrtG,EAAI2qC,EAAKmkE,UAAY,GAAM,KACpCzB,EAASrtG,EAAI2qC,EAAKmkE,UAAY,GAAM,OAIpCxB,EAAYttG,EAAG2qC,EAAK4gE,QAAU,IAC9B+B,EAAYttG,EAAgB,MAAb2qC,EAAK4gE,QAGtBsB,EAAcliE,GAIV3qC,EAAE8uF,KAAO,IAAK9uF,EAAE8uF,MAAQ9uF,EAAE8uF,MAET,IAAd9uF,EAAE2lF,QAhqDW,EACA,IAyxDtBpkG,EAAQmpD,WAvHR,SAAoBC,GAClB,IAAI0lE,EAEJ,OAAK1lE,GAAsBA,EAAKrkD,MArmDjB,MAymDf+pH,EAAS1lE,EAAKrkD,MAAM+pH,SAxmDJ,KA0mDdA,GAzmDa,KA0mDbA,GAzmDgB,KA0mDhBA,GACAA,IAAW7D,GACX6D,IAAW5D,GACX4D,IAAW3D,EAEJ9/G,EAAI+9C,EAAMoE,IAGnBpE,EAAKrkD,MAAQ,KAEN+pH,IAAW5D,EAAa7/G,EAAI+9C,GAnrDf,GALA,GAuqDXoE,GAoHXxtD,EAAQisD,qBA3FR,SAA8B7C,EAAM7rB,GAClC,IAEI9e,EACA9T,EAAK2U,EACLiuF,EACAokB,EACA3pG,EACA3gB,EACAuqH,EARAC,EAAat0F,EAAW36B,OAU5B,IAAKwmD,IAAsBA,EAAKrkD,MAC9B,OAAOyoD,EAMT,GAAa,KAFb+/C,GADA9uF,EAAI2qC,EAAKrkD,OACAwoG,OAEmB,IAATA,GAjpDJ,KAipDkB9uF,EAAEqwG,QAA0BrwG,EAAEuuG,UAC7D,OAAOx/D,EAmCT,IA/Ba,IAAT+/C,IAEFnkD,EAAK4gE,MAAQa,EAAQzhE,EAAK4gE,MAAOzsF,EAAYs0F,EAAY,IAG3DpzG,EAAE8uF,KAAO,EAGLskB,GAAcpzG,EAAE+tG,SACL,IAATjf,IAEFrlB,EAAKzpE,EAAEq/E,MACPr/E,EAAEotG,SAAW,EACbptG,EAAEmtG,YAAc,EAChBntG,EAAE+uG,OAAS,GAIboE,EAAU,IAAIvkD,EAAMw8C,KAAKprG,EAAE+tG,QAC3Bn/C,EAAMk8C,SAASqI,EAASr0F,EAAYs0F,EAAapzG,EAAE+tG,OAAQ/tG,EAAE+tG,OAAQ,GACrEjvF,EAAaq0F,EACbC,EAAapzG,EAAE+tG,QAGjBmF,EAAQvoE,EAAKc,SACbliC,EAAOohC,EAAKe,QACZ9iD,EAAQ+hD,EAAK/hD,MACb+hD,EAAKc,SAAW2nE,EAChBzoE,EAAKe,QAAU,EACff,EAAK/hD,MAAQk2B,EACb2vF,EAAYzuG,GACLA,EAAEuuG,WA3rDK,GA2rDmB,CAC/BriH,EAAM8T,EAAEotG,SACRvsG,EAAIb,EAAEuuG,UAAY,EAClB,GAEEvuG,EAAEgvG,OAAUhvG,EAAEgvG,OAAShvG,EAAEivG,WAAcjvG,EAAE9M,OAAOhH,EAhsDtC,EAgsDwD,IAAM8T,EAAEkvG,UAE1ElvG,EAAEtT,KAAKR,EAAM8T,EAAEkuG,QAAUluG,EAAEq/E,KAAKr/E,EAAEgvG,OAElChvG,EAAEq/E,KAAKr/E,EAAEgvG,OAAS9iH,EAClBA,YACS2U,GACXb,EAAEotG,SAAWlhH,EACb8T,EAAEuuG,UAAYkB,EACdhB,EAAYzuG,GAYd,OAVAA,EAAEotG,UAAYptG,EAAEuuG,UAChBvuG,EAAEmtG,YAAcntG,EAAEotG,SAClBptG,EAAE+uG,OAAS/uG,EAAEuuG,UACbvuG,EAAEuuG,UAAY,EACdvuG,EAAEsvG,aAAetvG,EAAE6tG,YAAc4B,EACjCzvG,EAAE8vG,gBAAkB,EACpBnlE,EAAKe,QAAUniC,EACfohC,EAAK/hD,MAAQA,EACb+hD,EAAKc,SAAWynE,EAChBlzG,EAAE8uF,KAAOA,EA/wDW,GA4xDtBvtG,EAAQ8xH,YAAc,4DC5wDtB/xH,EAAOC,QAAU,SAAsBopD,EAAMjhD,GAC3C,IAAIpD,EACAgtH,EACAvxE,EACAwxE,EACAf,EACAjiH,EAEAijH,EAEAC,EACAC,EACAC,EAEAC,EACAC,EACA1xG,EACA2xG,EACAC,EACAC,EACAC,EACAC,EACAC,EAEAlmH,EACAmmH,EACA1jH,EACA2jH,EAGAzrH,EAAOygB,EAGX/iB,EAAQqkD,EAAKrkD,MAEbgtH,EAAM3oE,EAAKe,QACX9iD,EAAQ+hD,EAAK/hD,MACbm5C,EAAOuxE,GAAO3oE,EAAKc,SAAW,GAC9B8nE,EAAO5oE,EAAKiB,SACZviC,EAASshC,EAAKthC,OACdmpG,EAAMe,GAAQ7pH,EAAQihD,EAAKgB,WAC3Bp7C,EAAMgjH,GAAQ5oE,EAAKgB,UAAY,KAE/B6nE,EAAOltH,EAAMktH,KAEbC,EAAQntH,EAAMmtH,MACdC,EAAQptH,EAAMotH,MACdC,EAAQrtH,EAAMqtH,MACdC,EAAWttH,EAAM4M,OACjB2gH,EAAOvtH,EAAMutH,KACb1xG,EAAO7b,EAAM6b,KACb2xG,EAAQxtH,EAAMguH,QACdP,EAAQztH,EAAMiuH,SACdP,GAAS,GAAK1tH,EAAMkuH,SAAW,EAC/BP,GAAS,GAAK3tH,EAAMmuH,UAAY,EAMhCx1B,EACA,EAAG,CACG98E,EAAO,KACT0xG,GAAQjrH,EAAM0qH,MAAUnxG,EACxBA,GAAQ,EACR0xG,GAAQjrH,EAAM0qH,MAAUnxG,EACxBA,GAAQ,GAGV+xG,EAAOJ,EAAMD,EAAOG,GAEpBU,EACA,OAAS,CAKP,GAHAb,KADAM,EAAKD,IAAS,GAEd/xG,GAAQgyG,EAEG,IADXA,EAAMD,IAAS,GAAM,KAKnB7qG,EAAOkqG,KAAiB,MAAPW,MAEd,MAAS,GAALC,GAwKJ,IAAkB,IAAR,GAALA,GAAgB,CACxBD,EAAOJ,GAAc,MAAPI,IAA8BL,GAAS,GAAKM,GAAM,IAChE,SAASO,EAEN,GAAS,GAALP,EAAS,CAEhB7tH,EAAMod,KAtSH,GAuSH,MAAMu7E,EAGNt0C,EAAKr+C,IAAM,8BACXhG,EAAMod,KA5SJ,GA6SF,MAAMu7E,EAnLNhxF,EAAa,MAAPimH,GACNC,GAAM,MAEAhyG,EAAOgyG,IACTN,GAAQjrH,EAAM0qH,MAAUnxG,EACxBA,GAAQ,GAEVlU,GAAO4lH,GAAS,GAAKM,GAAM,EAC3BN,KAAUM,EACVhyG,GAAQgyG,GAGNhyG,EAAO,KACT0xG,GAAQjrH,EAAM0qH,MAAUnxG,EACxBA,GAAQ,EACR0xG,GAAQjrH,EAAM0qH,MAAUnxG,EACxBA,GAAQ,GAEV+xG,EAAOH,EAAMF,EAAOI,GAEpBU,EACA,OAAS,CAMP,GAJAd,KADAM,EAAKD,IAAS,GAEd/xG,GAAQgyG,IAGC,IAFTA,EAAMD,IAAS,GAAM,MAiIhB,IAAkB,IAAR,GAALC,GAAgB,CACxBD,EAAOH,GAAc,MAAPG,IAA8BL,GAAS,GAAKM,GAAM,IAChE,SAASQ,EAGThqE,EAAKr+C,IAAM,wBACXhG,EAAMod,KA1RR,GA2RE,MAAMu7E,EAzHN,GAZAm1B,EAAc,MAAPF,EAEH/xG,GADJgyG,GAAM,MAEJN,GAAQjrH,EAAM0qH,MAAUnxG,GACxBA,GAAQ,GACGgyG,IACTN,GAAQjrH,EAAM0qH,MAAUnxG,EACxBA,GAAQ,KAGZiyG,GAAQP,GAAS,GAAKM,GAAM,GAEjBX,EAAM,CACf7oE,EAAKr+C,IAAM,gCACXhG,EAAMod,KApKV,GAqKI,MAAMu7E,EAOR,GAJA40B,KAAUM,EACVhyG,GAAQgyG,EAGJC,GADJD,EAAKZ,EAAOf,GACG,CAEb,IADA2B,EAAKC,EAAOD,GACHT,GACHptH,EAAMsuH,KAAM,CACdjqE,EAAKr+C,IAAM,gCACXhG,EAAMod,KAjLd,GAkLQ,MAAMu7E,EA2BV,GAFAvuF,EAAO,EACP2jH,EAAcT,EACA,IAAVD,GAEF,GADAjjH,GAAQ+iH,EAAQU,EACZA,EAAKlmH,EAAK,CACZA,GAAOkmH,EACP,GACE9qG,EAAOkqG,KAAUK,EAASljH,aACjByjH,GACXzjH,EAAO6iH,EAAOa,EACdC,EAAchrG,QAGb,GAAIsqG,EAAQQ,GAGf,GAFAzjH,GAAQ+iH,EAAQE,EAAQQ,GACxBA,GAAMR,GACG1lH,EAAK,CACZA,GAAOkmH,EACP,GACE9qG,EAAOkqG,KAAUK,EAASljH,aACjByjH,GAEX,GADAzjH,EAAO,EACHijH,EAAQ1lH,EAAK,CAEfA,GADAkmH,EAAKR,EAEL,GACEtqG,EAAOkqG,KAAUK,EAASljH,aACjByjH,GACXzjH,EAAO6iH,EAAOa,EACdC,EAAchrG,SAMlB,GADA3Y,GAAQijH,EAAQQ,EACZA,EAAKlmH,EAAK,CACZA,GAAOkmH,EACP,GACE9qG,EAAOkqG,KAAUK,EAASljH,aACjByjH,GACXzjH,EAAO6iH,EAAOa,EACdC,EAAchrG,EAGlB,KAAOpb,EAAM,GACXob,EAAOkqG,KAAUc,EAAY3jH,KAC7B2Y,EAAOkqG,KAAUc,EAAY3jH,KAC7B2Y,EAAOkqG,KAAUc,EAAY3jH,KAC7BzC,GAAO,EAELA,IACFob,EAAOkqG,KAAUc,EAAY3jH,KACzBzC,EAAM,IACRob,EAAOkqG,KAAUc,EAAY3jH,WAI9B,CACHA,EAAO6iH,EAAOa,EACd,GACE/qG,EAAOkqG,KAAUlqG,EAAO3Y,KACxB2Y,EAAOkqG,KAAUlqG,EAAO3Y,KACxB2Y,EAAOkqG,KAAUlqG,EAAO3Y,KACxBzC,GAAO,QACAA,EAAM,GACXA,IACFob,EAAOkqG,KAAUlqG,EAAO3Y,KACpBzC,EAAM,IACRob,EAAOkqG,KAAUlqG,EAAO3Y,OAehC,OAkBJ,aAEK4iH,EAAMvxE,GAAQwxE,EAAOhjH,GAI9B+iH,GADArlH,EAAMkU,GAAQ,EAGd0xG,IAAS,IADT1xG,GAAQlU,GAAO,IACO,EAGtB08C,EAAKe,QAAU4nE,EACf3oE,EAAKiB,SAAW2nE,EAChB5oE,EAAKc,SAAY6nE,EAAMvxE,EAAYA,EAAOuxE,EAAZ,EAAmB,GAAKA,EAAMvxE,GAC5D4I,EAAKgB,UAAa4nE,EAAOhjH,EAAaA,EAAMgjH,EAAb,IAAqB,KAAOA,EAAOhjH,GAClEjK,EAAMutH,KAAOA,EACbvtH,EAAM6b,KAAOA,gCCjUf,IAAIysD,EAAgB,EAAQ,MACxBw9C,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MACxBwI,EAAgB,EAAQ,MACxBC,EAAgB,EAAQ,MA2BxB/lE,GAAmB,EAyBZgmE,EAAO,GAkBXC,EAAM,GAiBb,SAASC,EAAQl+G,GACf,OAAWA,IAAM,GAAM,MACbA,IAAM,EAAK,SACP,MAAJA,IAAe,KACX,IAAJA,IAAa,IAIzB,SAASm+G,IACPryH,KAAK6gB,KAAO,EACZ7gB,KAAKk/C,MAAO,EACZl/C,KAAKisG,KAAO,EACZjsG,KAAKsyH,UAAW,EAChBtyH,KAAKm1B,MAAQ,EACbn1B,KAAK2wH,KAAO,EACZ3wH,KAAKuyH,MAAQ,EACbvyH,KAAK6R,MAAQ,EAEb7R,KAAKw8F,KAAO,KAGZx8F,KAAKwyH,MAAQ,EACbxyH,KAAK4wH,MAAQ,EACb5wH,KAAK6wH,MAAQ,EACb7wH,KAAK8wH,MAAQ,EACb9wH,KAAKqQ,OAAS,KAGdrQ,KAAKgxH,KAAO,EACZhxH,KAAKsf,KAAO,EAGZtf,KAAKsB,OAAS,EACdtB,KAAKqB,OAAS,EAGdrB,KAAK8vH,MAAQ,EAGb9vH,KAAKyxH,QAAU,KACfzxH,KAAK0xH,SAAW,KAChB1xH,KAAK2xH,QAAU,EACf3xH,KAAK4xH,SAAW,EAGhB5xH,KAAKyyH,MAAQ,EACbzyH,KAAK0yH,KAAO,EACZ1yH,KAAK2yH,MAAQ,EACb3yH,KAAK4oC,KAAO,EACZ5oC,KAAK0mB,KAAO,KAEZ1mB,KAAK66B,KAAO,IAAIkxC,EAAMy8C,MAAM,KAC5BxoH,KAAK4yH,KAAO,IAAI7mD,EAAMy8C,MAAM,KAO5BxoH,KAAK6yH,OAAS,KACd7yH,KAAK8yH,QAAU,KACf9yH,KAAK+xH,KAAO,EACZ/xH,KAAK+yH,KAAO,EACZ/yH,KAAKgzH,IAAM,EAGb,SAASC,EAAiBnrE,GACxB,IAAIrkD,EAEJ,OAAKqkD,GAASA,EAAKrkD,OACnBA,EAAQqkD,EAAKrkD,MACbqkD,EAAKmkE,SAAWnkE,EAAKqiE,UAAY1mH,EAAMoO,MAAQ,EAC/Ci2C,EAAKr+C,IAAM,GACPhG,EAAMwoG,OACRnkD,EAAK4gE,MAAqB,EAAbjlH,EAAMwoG,MAErBxoG,EAAMod,KA1HM,EA2HZpd,EAAMy7C,KAAO,EACbz7C,EAAM6uH,SAAW,EACjB7uH,EAAMktH,KAAO,MACbltH,EAAM+4F,KAAO,KACb/4F,EAAMutH,KAAO,EACbvtH,EAAM6b,KAAO,EAEb7b,EAAMguH,QAAUhuH,EAAMovH,OAAS,IAAI9mD,EAAM08C,MA7FzB,KA8FhBhlH,EAAMiuH,SAAWjuH,EAAMqvH,QAAU,IAAI/mD,EAAM08C,MA7F1B,KA+FjBhlH,EAAMsuH,KAAO,EACbtuH,EAAMsvH,MAAQ,EAxJM,GAqIe7mE,EAwBrC,SAASrB,EAAa/C,GACpB,IAAIrkD,EAEJ,OAAKqkD,GAASA,EAAKrkD,QACnBA,EAAQqkD,EAAKrkD,OACPmtH,MAAQ,EACdntH,EAAMotH,MAAQ,EACdptH,EAAMqtH,MAAQ,EACPmC,EAAiBnrE,IALWoE,EASrC,SAASgnE,EAAcprE,EAAMZ,GAC3B,IAAI+kD,EACAxoG,EAGJ,OAAKqkD,GAASA,EAAKrkD,OACnBA,EAAQqkD,EAAKrkD,MAGTyjD,EAAa,GACf+kD,EAAO,EACP/kD,GAAcA,IAGd+kD,EAA2B,GAAnB/kD,GAAc,GAClBA,EAAa,KACfA,GAAc,KAKdA,IAAeA,EAAa,GAAKA,EAAa,IACzCgF,GAEY,OAAjBzoD,EAAM4M,QAAmB5M,EAAM+uH,QAAUtrE,IAC3CzjD,EAAM4M,OAAS,MAIjB5M,EAAMwoG,KAAOA,EACbxoG,EAAM+uH,MAAQtrE,EACP2D,EAAa/C,KA1BeoE,EA6BrC,SAASxB,EAAa5C,EAAMZ,GAC1B,IAAIvzC,EACAlQ,EAEJ,OAAKqkD,GAGLrkD,EAAQ,IAAI4uH,EAIZvqE,EAAKrkD,MAAQA,EACbA,EAAM4M,OAAS,KAvNK,KAwNpBsD,EAAMu/G,EAAcprE,EAAMZ,MAExBY,EAAKrkD,MAAQ,MAERkQ,GAbau4C,EA+BtB,IAEIinE,EAAQC,EAFRC,GAAS,EAIb,SAASC,EAAY7vH,GAEnB,GAAI4vH,EAAQ,CACV,IAAIjgG,EAOJ,IALA+/F,EAAS,IAAIpnD,EAAM08C,MAAM,KACzB2K,EAAU,IAAIrnD,EAAM08C,MAAM,IAG1Br1F,EAAM,EACCA,EAAM,KAAO3vB,EAAMo3B,KAAKzH,KAAS,EACxC,KAAOA,EAAM,KAAO3vB,EAAMo3B,KAAKzH,KAAS,EACxC,KAAOA,EAAM,KAAO3vB,EAAMo3B,KAAKzH,KAAS,EACxC,KAAOA,EAAM,KAAO3vB,EAAMo3B,KAAKzH,KAAS,EAMxC,IAJA6+F,EArRO,EAqRcxuH,EAAMo3B,KAAM,EAAG,IAAKs4F,EAAU,EAAG1vH,EAAMmvH,KAAM,CAAEtzG,KAAM,IAG1E8T,EAAM,EACCA,EAAM,IAAM3vB,EAAMo3B,KAAKzH,KAAS,EAEvC6+F,EA1RQ,EA0RaxuH,EAAMo3B,KAAM,EAAG,GAAMu4F,EAAS,EAAG3vH,EAAMmvH,KAAM,CAAEtzG,KAAM,IAG1E+zG,GAAS,EAGX5vH,EAAMguH,QAAU0B,EAChB1vH,EAAMkuH,QAAU,EAChBluH,EAAMiuH,SAAW0B,EACjB3vH,EAAMmuH,SAAW,EAkBnB,SAAS2B,EAAazrE,EAAMlQ,EAAKlqC,EAAKxK,GACpC,IAAIquH,EACA9tH,EAAQqkD,EAAKrkD,MAqCjB,OAlCqB,OAAjBA,EAAM4M,SACR5M,EAAMmtH,MAAQ,GAAKntH,EAAM+uH,MACzB/uH,EAAMqtH,MAAQ,EACdrtH,EAAMotH,MAAQ,EAEdptH,EAAM4M,OAAS,IAAI07D,EAAMw8C,KAAK9kH,EAAMmtH,QAIlC1tH,GAAQO,EAAMmtH,OAChB7kD,EAAMk8C,SAASxkH,EAAM4M,OAAQunC,EAAKlqC,EAAMjK,EAAMmtH,MAAOntH,EAAMmtH,MAAO,GAClEntH,EAAMqtH,MAAQ,EACdrtH,EAAMotH,MAAQptH,EAAMmtH,SAGpBW,EAAO9tH,EAAMmtH,MAAQntH,EAAMqtH,OAChB5tH,IACTquH,EAAOruH,GAGT6oE,EAAMk8C,SAASxkH,EAAM4M,OAAQunC,EAAKlqC,EAAMxK,EAAMquH,EAAM9tH,EAAMqtH,QAC1D5tH,GAAQquH,IAGNxlD,EAAMk8C,SAASxkH,EAAM4M,OAAQunC,EAAKlqC,EAAMxK,EAAMA,EAAM,GACpDO,EAAMqtH,MAAQ5tH,EACdO,EAAMotH,MAAQptH,EAAMmtH,QAGpBntH,EAAMqtH,OAASS,EACX9tH,EAAMqtH,QAAUrtH,EAAMmtH,QAASntH,EAAMqtH,MAAQ,GAC7CrtH,EAAMotH,MAAQptH,EAAMmtH,QAASntH,EAAMotH,OAASU,KAG7C,EAuoCT7yH,EAAQmsD,aAAeA,EACvBnsD,EAAQw0H,cAAgBA,EACxBx0H,EAAQu0H,iBAAmBA,EAC3Bv0H,EAAQ80H,YApvCR,SAAqB1rE,GACnB,OAAO4C,EAAa5C,EArKN,KAy5ChBppD,EAAQgsD,aAAeA,EACvBhsD,EAAQ6qD,QAzoCR,SAAiBzB,EAAM7I,GACrB,IAAIx7C,EACAsC,EAAOygB,EACPE,EACAu0C,EACAryB,EAAM53B,EACNggH,EACA1xG,EACAmxG,EAAKC,EACLxtH,EACA2K,EACA2jH,EAEAiC,EAAWC,EAASC,EAEpBC,EAAWC,EAASC,EACpB1oH,EACAuI,EAEAsrB,EAEAjhB,EATAqzG,EAAO,EAMP0C,EAAO,IAAIhoD,EAAMw8C,KAAK,GAKtByL,EACF,CAAE,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,IAGlE,IAAKlsE,IAASA,EAAKrkD,QAAUqkD,EAAKthC,SAC5BshC,EAAK/hD,OAA2B,IAAlB+hD,EAAKc,SACvB,OAAOsD,GAGTzoD,EAAQqkD,EAAKrkD,OACHod,OAASqxG,IAAQzuH,EAAMod,KA/Uf,IAmVlBo6C,EAAMnT,EAAKiB,SACXviC,EAASshC,EAAKthC,OACdxV,EAAO82C,EAAKgB,UACZpiC,EAAOohC,EAAKe,QACZ9iD,EAAQ+hD,EAAK/hD,MACb6iC,EAAOkf,EAAKc,SACZooE,EAAOvtH,EAAMutH,KACb1xG,EAAO7b,EAAM6b,KAGbmxG,EAAM7nF,EACN8nF,EAAO1/G,EACP2C,EA7XoB,EA+XpBsgH,EACA,OACE,OAAQxwH,EAAMod,MACZ,KAhXQ,EAiXN,GAAmB,IAAfpd,EAAMwoG,KAAY,CACpBxoG,EAAMod,KAtWI,GAuWV,MAGF,KAAOvB,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV,GAAkB,EAAb7b,EAAMwoG,MAAsB,QAAT+kB,EAAiB,CACvCvtH,EAAM8uH,MAAQ,EAEdwB,EAAK,GAAY,IAAP/C,EACV+C,EAAK,GAAM/C,IAAS,EAAK,IACzBvtH,EAAM8uH,MAAQ/I,EAAM/lH,EAAM8uH,MAAOwB,EAAM,EAAG,GAI1C/C,EAAO,EACP1xG,EAAO,EAEP7b,EAAMod,KAxYD,EAyYL,MAMF,GAJApd,EAAM0xB,MAAQ,EACV1xB,EAAM+4F,OACR/4F,EAAM+4F,KAAKznE,MAAO,KAED,EAAbtxB,EAAMwoG,UACA,IAAP+kB,IAA2B,IAAMA,GAAQ,IAAM,GAAI,CACtDlpE,EAAKr+C,IAAM,yBACXhG,EAAMod,KAAOsxG,EACb,MAEF,GA7ZU,IA6ZE,GAAPnB,GAAwC,CAC3ClpE,EAAKr+C,IAAM,6BACXhG,EAAMod,KAAOsxG,EACb,MAOF,GAHA7yG,GAAQ,EAERlU,EAAiC,GAAnB,IAHd4lH,KAAU,IAIU,IAAhBvtH,EAAM+uH,MACR/uH,EAAM+uH,MAAQpnH,OAEX,GAAIA,EAAM3H,EAAM+uH,MAAO,CAC1B1qE,EAAKr+C,IAAM,sBACXhG,EAAMod,KAAOsxG,EACb,MAEF1uH,EAAMktH,KAAO,GAAKvlH,EAElB08C,EAAK4gE,MAAQjlH,EAAM8uH,MAAQ,EAC3B9uH,EAAMod,KAAc,IAAPmwG,EAlaL,GAka6BkB,EAErClB,EAAO,EACP1xG,EAAO,EAEP,MACF,KAhbS,EAkbP,KAAOA,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAIV,GADA7b,EAAM0xB,MAAQ67F,EAjcJ,IAkcS,IAAdvtH,EAAM0xB,OAA8B,CACvC2yB,EAAKr+C,IAAM,6BACXhG,EAAMod,KAAOsxG,EACb,MAEF,GAAkB,MAAd1uH,EAAM0xB,MAAgB,CACxB2yB,EAAKr+C,IAAM,2BACXhG,EAAMod,KAAOsxG,EACb,MAEE1uH,EAAM+4F,OACR/4F,EAAM+4F,KAAKozB,KAASoB,GAAQ,EAAK,GAEjB,IAAdvtH,EAAM0xB,QAER4+F,EAAK,GAAY,IAAP/C,EACV+C,EAAK,GAAM/C,IAAS,EAAK,IACzBvtH,EAAM8uH,MAAQ/I,EAAM/lH,EAAM8uH,MAAOwB,EAAM,EAAG,IAI5C/C,EAAO,EACP1xG,EAAO,EAEP7b,EAAMod,KAjdA,EAmdR,KAndQ,EAqdN,KAAOvB,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGN7b,EAAM+4F,OACR/4F,EAAM+4F,KAAK/tF,KAAOuiH,GAEF,IAAdvtH,EAAM0xB,QAER4+F,EAAK,GAAY,IAAP/C,EACV+C,EAAK,GAAM/C,IAAS,EAAK,IACzB+C,EAAK,GAAM/C,IAAS,GAAM,IAC1B+C,EAAK,GAAM/C,IAAS,GAAM,IAC1BvtH,EAAM8uH,MAAQ/I,EAAM/lH,EAAM8uH,MAAOwB,EAAM,EAAG,IAI5C/C,EAAO,EACP1xG,EAAO,EAEP7b,EAAMod,KA3eF,EA6eN,KA7eM,EA+eJ,KAAOvB,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGN7b,EAAM+4F,OACR/4F,EAAM+4F,KAAK03B,OAAiB,IAAPlD,EACrBvtH,EAAM+4F,KAAKuzB,GAAMiB,GAAQ,GAET,IAAdvtH,EAAM0xB,QAER4+F,EAAK,GAAY,IAAP/C,EACV+C,EAAK,GAAM/C,IAAS,EAAK,IACzBvtH,EAAM8uH,MAAQ/I,EAAM/lH,EAAM8uH,MAAOwB,EAAM,EAAG,IAI5C/C,EAAO,EACP1xG,EAAO,EAEP7b,EAAMod,KApgBC,EAsgBT,KAtgBS,EAugBP,GAAkB,KAAdpd,EAAM0xB,MAAgB,CAExB,KAAO7V,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV7b,EAAMnC,OAAS0vH,EACXvtH,EAAM+4F,OACR/4F,EAAM+4F,KAAK23B,UAAYnD,GAEP,IAAdvtH,EAAM0xB,QAER4+F,EAAK,GAAY,IAAP/C,EACV+C,EAAK,GAAM/C,IAAS,EAAK,IACzBvtH,EAAM8uH,MAAQ/I,EAAM/lH,EAAM8uH,MAAOwB,EAAM,EAAG,IAI5C/C,EAAO,EACP1xG,EAAO,OAGA7b,EAAM+4F,OACb/4F,EAAM+4F,KAAKszB,MAAQ,MAErBrsH,EAAMod,KAliBC,EAoiBT,KApiBS,EAqiBP,GAAkB,KAAdpd,EAAM0xB,SACRjyB,EAAOO,EAAMnC,QACFsnC,IAAQ1lC,EAAO0lC,GACtB1lC,IACEO,EAAM+4F,OACRpxF,EAAM3H,EAAM+4F,KAAK23B,UAAY1wH,EAAMnC,OAC9BmC,EAAM+4F,KAAKszB,QAEdrsH,EAAM+4F,KAAKszB,MAAQ,IAAIpuH,MAAM+B,EAAM+4F,KAAK23B,YAE1CpoD,EAAMk8C,SACJxkH,EAAM+4F,KAAKszB,MACX/pH,EACA2gB,EAGAxjB,EAEAkI,IAMc,IAAd3H,EAAM0xB,QACR1xB,EAAM8uH,MAAQ/I,EAAM/lH,EAAM8uH,MAAOxsH,EAAO7C,EAAMwjB,IAEhDkiB,GAAQ1lC,EACRwjB,GAAQxjB,EACRO,EAAMnC,QAAU4B,GAEdO,EAAMnC,QAAU,MAAM2yH,EAE5BxwH,EAAMnC,OAAS,EACfmC,EAAMod,KAtkBA,EAwkBR,KAxkBQ,EAykBN,GAAkB,KAAdpd,EAAM0xB,MAAgB,CACxB,GAAa,IAATyT,EAAc,MAAMqrF,EACxB/wH,EAAO,EACP,GAEEkI,EAAMrF,EAAM2gB,EAAOxjB,KAEfO,EAAM+4F,MAAQpxF,GACb3H,EAAMnC,OAAS,QAClBmC,EAAM+4F,KAAK18F,MAAQ+L,OAAOC,aAAaV,UAElCA,GAAOlI,EAAO0lC,GAOvB,GALkB,IAAdnlC,EAAM0xB,QACR1xB,EAAM8uH,MAAQ/I,EAAM/lH,EAAM8uH,MAAOxsH,EAAO7C,EAAMwjB,IAEhDkiB,GAAQ1lC,EACRwjB,GAAQxjB,EACJkI,EAAO,MAAM6oH,OAEVxwH,EAAM+4F,OACb/4F,EAAM+4F,KAAK18F,KAAO,MAEpB2D,EAAMnC,OAAS,EACfmC,EAAMod,KAhmBG,EAkmBX,KAlmBW,EAmmBT,GAAkB,KAAdpd,EAAM0xB,MAAgB,CACxB,GAAa,IAATyT,EAAc,MAAMqrF,EACxB/wH,EAAO,EACP,GACEkI,EAAMrF,EAAM2gB,EAAOxjB,KAEfO,EAAM+4F,MAAQpxF,GACb3H,EAAMnC,OAAS,QAClBmC,EAAM+4F,KAAKz2B,SAAWl6D,OAAOC,aAAaV,UAErCA,GAAOlI,EAAO0lC,GAMvB,GALkB,IAAdnlC,EAAM0xB,QACR1xB,EAAM8uH,MAAQ/I,EAAM/lH,EAAM8uH,MAAOxsH,EAAO7C,EAAMwjB,IAEhDkiB,GAAQ1lC,EACRwjB,GAAQxjB,EACJkI,EAAO,MAAM6oH,OAEVxwH,EAAM+4F,OACb/4F,EAAM+4F,KAAKz2B,QAAU,MAEvBtiE,EAAMod,KAvnBA,EAynBR,KAznBQ,EA0nBN,GAAkB,IAAdpd,EAAM0xB,MAAgB,CAExB,KAAO7V,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV,GAAI0xG,KAAwB,MAAdvtH,EAAM8uH,OAAiB,CACnCzqE,EAAKr+C,IAAM,sBACXhG,EAAMod,KAAOsxG,EACb,MAGFnB,EAAO,EACP1xG,EAAO,EAGL7b,EAAM+4F,OACR/4F,EAAM+4F,KAAKqzB,KAASpsH,EAAM0xB,OAAS,EAAK,EACxC1xB,EAAM+4F,KAAKznE,MAAO,GAEpB+yB,EAAK4gE,MAAQjlH,EAAM8uH,MAAQ,EAC3B9uH,EAAMod,KAAOqxG,EACb,MACF,KAnpBU,GAqpBR,KAAO5yG,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGVwoC,EAAK4gE,MAAQjlH,EAAM8uH,MAAQH,EAAQpB,GAEnCA,EAAO,EACP1xG,EAAO,EAEP7b,EAAMod,KAhqBA,GAkqBR,KAlqBQ,GAmqBN,GAAuB,IAAnBpd,EAAM6uH,SASR,OAPAxqE,EAAKiB,SAAWkS,EAChBnT,EAAKgB,UAAY93C,EACjB82C,EAAKe,QAAUniC,EACfohC,EAAKc,SAAWhgB,EAChBnlC,EAAMutH,KAAOA,EACbvtH,EAAM6b,KAAOA,EApsBD,EAwsBdwoC,EAAK4gE,MAAQjlH,EAAM8uH,MAAQ,EAC3B9uH,EAAMod,KAAOqxG,EAEf,KAAKA,EACH,GArtBc,IAqtBVjzE,GAptBU,IAotBWA,EAAqB,MAAMg1E,EAEtD,KAlrBc,GAmrBZ,GAAIxwH,EAAMy7C,KAAM,CAEd8xE,KAAiB,EAAP1xG,EACVA,GAAe,EAAPA,EAER7b,EAAMod,KA1qBD,GA2qBL,MAGF,KAAOvB,EAAO,GAAG,CACf,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EASV,OANA7b,EAAMy7C,KAAe,EAAP8xE,EAGd1xG,GAAQ,EAGQ,GAJhB0xG,KAAU,IAKR,KAAK,EAGHvtH,EAAMod,KA5sBE,GA6sBR,MACF,KAAK,EAKH,GAJAyyG,EAAY7vH,GAGZA,EAAMod,KA5sBI,GA3CA,IAwvBNo+B,EAAmB,CAErB+xE,KAAU,EACV1xG,GAAQ,EAER,MAAM20G,EAER,MACF,KAAK,EAGHxwH,EAAMod,KA3tBC,GA4tBP,MACF,KAAK,EACHinC,EAAKr+C,IAAM,qBACXhG,EAAMod,KAAOsxG,EAGjBnB,KAAU,EACV1xG,GAAQ,EAER,MACF,KAzuBc,GA+uBZ,IAJA0xG,KAAiB,EAAP1xG,EACVA,GAAe,EAAPA,EAGDA,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV,IAAY,MAAP0xG,KAAqBA,IAAS,GAAM,OAAS,CAChDlpE,EAAKr+C,IAAM,+BACXhG,EAAMod,KAAOsxG,EACb,MAUF,GARA1uH,EAAMnC,OAAgB,MAAP0vH,EAIfA,EAAO,EACP1xG,EAAO,EAEP7b,EAAMod,KAjwBK,GAtCG,IAwyBVo+B,EAAqB,MAAMg1E,EAEjC,KApwBa,GAqwBXxwH,EAAMod,KApwBI,GAswBZ,KAtwBY,GAwwBV,GADA3d,EAAOO,EAAMnC,OACH,CAGR,GAFI4B,EAAO0lC,IAAQ1lC,EAAO0lC,GACtB1lC,EAAO8N,IAAQ9N,EAAO8N,GACb,IAAT9N,EAAc,MAAM+wH,EAExBloD,EAAMk8C,SAASzhG,EAAQzgB,EAAO2gB,EAAMxjB,EAAM+3D,GAE1CryB,GAAQ1lC,EACRwjB,GAAQxjB,EACR8N,GAAQ9N,EACR+3D,GAAO/3D,EACPO,EAAMnC,QAAU4B,EAChB,MAGFO,EAAMod,KAAOqxG,EACb,MACF,KAxxBa,GA0xBX,KAAO5yG,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAmBV,GAhBA7b,EAAMivH,KAAkC,KAAnB,GAAP1B,GAEdA,KAAU,EACV1xG,GAAQ,EAER7b,EAAMkvH,MAAmC,GAAnB,GAAP3B,GAEfA,KAAU,EACV1xG,GAAQ,EAER7b,EAAMgvH,MAAmC,GAAnB,GAAPzB,GAEfA,KAAU,EACV1xG,GAAQ,EAGJ7b,EAAMivH,KAAO,KAAOjvH,EAAMkvH,MAAQ,GAAI,CACxC7qE,EAAKr+C,IAAM,sCACXhG,EAAMod,KAAOsxG,EACb,MAIF1uH,EAAMmlC,KAAO,EACbnlC,EAAMod,KAxzBO,GA0zBf,KA1zBe,GA2zBb,KAAOpd,EAAMmlC,KAAOnlC,EAAMgvH,OAAO,CAE/B,KAAOnzG,EAAO,GAAG,CACf,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV7b,EAAMo3B,KAAKm5F,EAAMvwH,EAAMmlC,SAAmB,EAAPooF,EAEnCA,KAAU,EACV1xG,GAAQ,EAGV,KAAO7b,EAAMmlC,KAAO,IAClBnlC,EAAMo3B,KAAKm5F,EAAMvwH,EAAMmlC,SAAW,EAapC,GAPAnlC,EAAMguH,QAAUhuH,EAAMovH,OACtBpvH,EAAMkuH,QAAU,EAEhB1yF,EAAO,CAAE3f,KAAM7b,EAAMkuH,SACrBh+G,EAAMs+G,EA74BF,EA64BuBxuH,EAAMo3B,KAAM,EAAG,GAAIp3B,EAAMguH,QAAS,EAAGhuH,EAAMmvH,KAAM3zF,GAC5Ex7B,EAAMkuH,QAAU1yF,EAAK3f,KAEjB3L,EAAK,CACPm0C,EAAKr+C,IAAM,2BACXhG,EAAMod,KAAOsxG,EACb,MAGF1uH,EAAMmlC,KAAO,EACbnlC,EAAMod,KA91BQ,GAg2BhB,KAh2BgB,GAi2Bd,KAAOpd,EAAMmlC,KAAOnlC,EAAMivH,KAAOjvH,EAAMkvH,OAAO,CAC5C,KAGEe,GAFArC,EAAO5tH,EAAMguH,QAAQT,GAAS,GAAKvtH,EAAMkuH,SAAW,MAEhC,GAAM,IAC1BgC,EAAkB,MAAPtC,KAFXoC,EAAYpC,IAAS,KAIF/xG,IANZ,CAQP,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV,GAAIq0G,EAAW,GAEb3C,KAAUyC,EACVn0G,GAAQm0G,EAERhwH,EAAMo3B,KAAKp3B,EAAMmlC,QAAU+qF,MAExB,CACH,GAAiB,KAAbA,EAAiB,CAGnB,IADA31G,EAAIy1G,EAAY,EACTn0G,EAAOtB,GAAG,CACf,GAAa,IAAT4qB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAOV,GAHA0xG,KAAUyC,EACVn0G,GAAQm0G,EAEW,IAAfhwH,EAAMmlC,KAAY,CACpBkf,EAAKr+C,IAAM,4BACXhG,EAAMod,KAAOsxG,EACb,MAEF/mH,EAAM3H,EAAMo3B,KAAKp3B,EAAMmlC,KAAO,GAC9B1lC,EAAO,GAAY,EAAP8tH,GAEZA,KAAU,EACV1xG,GAAQ,OAGL,GAAiB,KAAbq0G,EAAiB,CAGxB,IADA31G,EAAIy1G,EAAY,EACTn0G,EAAOtB,GAAG,CACf,GAAa,IAAT4qB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAKVA,GAAQm0G,EAERroH,EAAM,EACNlI,EAAO,GAAY,GAJnB8tH,KAAUyC,IAMVzC,KAAU,EACV1xG,GAAQ,MAGL,CAGH,IADAtB,EAAIy1G,EAAY,EACTn0G,EAAOtB,GAAG,CACf,GAAa,IAAT4qB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAKVA,GAAQm0G,EAERroH,EAAM,EACNlI,EAAO,IAAa,KAJpB8tH,KAAUyC,IAMVzC,KAAU,EACV1xG,GAAQ,EAGV,GAAI7b,EAAMmlC,KAAO1lC,EAAOO,EAAMivH,KAAOjvH,EAAMkvH,MAAO,CAChD7qE,EAAKr+C,IAAM,4BACXhG,EAAMod,KAAOsxG,EACb,MAEF,KAAOjvH,KACLO,EAAMo3B,KAAKp3B,EAAMmlC,QAAUx9B,GAMjC,GAAI3H,EAAMod,OAASsxG,EAAO,MAG1B,GAAwB,IAApB1uH,EAAMo3B,KAAK,KAAY,CACzBitB,EAAKr+C,IAAM,uCACXhG,EAAMod,KAAOsxG,EACb,MAeF,GATA1uH,EAAMkuH,QAAU,EAEhB1yF,EAAO,CAAE3f,KAAM7b,EAAMkuH,SACrBh+G,EAAMs+G,EA/gCH,EA+gCuBxuH,EAAMo3B,KAAM,EAAGp3B,EAAMivH,KAAMjvH,EAAMguH,QAAS,EAAGhuH,EAAMmvH,KAAM3zF,GAGnFx7B,EAAMkuH,QAAU1yF,EAAK3f,KAGjB3L,EAAK,CACPm0C,EAAKr+C,IAAM,8BACXhG,EAAMod,KAAOsxG,EACb,MAcF,GAXA1uH,EAAMmuH,SAAW,EAGjBnuH,EAAMiuH,SAAWjuH,EAAMqvH,QACvB7zF,EAAO,CAAE3f,KAAM7b,EAAMmuH,UACrBj+G,EAAMs+G,EA/hCF,EA+hCuBxuH,EAAMo3B,KAAMp3B,EAAMivH,KAAMjvH,EAAMkvH,MAAOlvH,EAAMiuH,SAAU,EAAGjuH,EAAMmvH,KAAM3zF,GAG/Fx7B,EAAMmuH,SAAW3yF,EAAK3f,KAGlB3L,EAAK,CACPm0C,EAAKr+C,IAAM,wBACXhG,EAAMod,KAAOsxG,EACb,MAIF,GADA1uH,EAAMod,KAn/BQ,GA3CA,IA+hCVo+B,EAAqB,MAAMg1E,EAEjC,KAt/BgB,GAu/BdxwH,EAAMod,KAt/BO,GAw/Bf,KAx/Be,GAy/Bb,GAAI+nB,GAAQ,GAAK53B,GAAQ,IAAK,CAE5B82C,EAAKiB,SAAWkS,EAChBnT,EAAKgB,UAAY93C,EACjB82C,EAAKe,QAAUniC,EACfohC,EAAKc,SAAWhgB,EAChBnlC,EAAMutH,KAAOA,EACbvtH,EAAM6b,KAAOA,EAEb0yG,EAAalqE,EAAM4oE,GAEnBz1D,EAAMnT,EAAKiB,SACXviC,EAASshC,EAAKthC,OACdxV,EAAO82C,EAAKgB,UACZpiC,EAAOohC,EAAKe,QACZ9iD,EAAQ+hD,EAAK/hD,MACb6iC,EAAOkf,EAAKc,SACZooE,EAAOvtH,EAAMutH,KACb1xG,EAAO7b,EAAM6b,KAGT7b,EAAMod,OAASqxG,IACjBzuH,EAAMsvH,MAAQ,GAEhB,MAGF,IADAtvH,EAAMsvH,KAAO,EAIXW,GAFArC,EAAO5tH,EAAMguH,QAAQT,GAAS,GAAKvtH,EAAMkuH,SAAW,MAEhC,GAAM,IAC1BgC,EAAkB,MAAPtC,KAFXoC,EAAYpC,IAAS,KAIJ/xG,IANV,CAQP,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV,GAAIo0G,GAAgC,IAAV,IAAVA,GAAuB,CAIrC,IAHAE,EAAYH,EACZI,EAAUH,EACVI,EAAWH,EAKTD,GAHArC,EAAO5tH,EAAMguH,QAAQqC,IACX9C,GAAS,GAAM4C,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1BD,EAAkB,MAAPtC,IAENuC,GAJLH,EAAYpC,IAAS,KAIU/xG,IAPxB,CASP,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAIV0xG,KAAU4C,EACVt0G,GAAQs0G,EAERnwH,EAAMsvH,MAAQa,EAQhB,GALA5C,KAAUyC,EACVn0G,GAAQm0G,EAERhwH,EAAMsvH,MAAQU,EACdhwH,EAAMnC,OAASqyH,EACC,IAAZD,EAAe,CAIjBjwH,EAAMod,KAhkCK,GAikCX,MAEF,GAAc,GAAV6yG,EAAc,CAEhBjwH,EAAMsvH,MAAQ,EACdtvH,EAAMod,KAAOqxG,EACb,MAEF,GAAc,GAAVwB,EAAc,CAChB5rE,EAAKr+C,IAAM,8BACXhG,EAAMod,KAAOsxG,EACb,MAEF1uH,EAAMqsH,MAAkB,GAAV4D,EACdjwH,EAAMod,KAnlCU,GAqlClB,KArlCkB,GAslChB,GAAIpd,EAAMqsH,MAAO,CAGf,IADA9xG,EAAIva,EAAMqsH,MACHxwG,EAAOtB,GAAG,CACf,GAAa,IAAT4qB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV7b,EAAMnC,QAAU0vH,GAAS,GAAKvtH,EAAMqsH,OAAS,EAE7CkB,KAAUvtH,EAAMqsH,MAChBxwG,GAAQ7b,EAAMqsH,MAEdrsH,EAAMsvH,MAAQtvH,EAAMqsH,MAGtBrsH,EAAMuvH,IAAMvvH,EAAMnC,OAClBmC,EAAMod,KAxmCQ,GA0mChB,KA1mCgB,GA2mCd,KAGE6yG,GAFArC,EAAO5tH,EAAMiuH,SAASV,GAAS,GAAKvtH,EAAMmuH,UAAY,MAElC,GAAM,IAC1B+B,EAAkB,MAAPtC,KAFXoC,EAAYpC,IAAS,KAIF/xG,IANZ,CAQP,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV,GAAyB,IAAV,IAAVo0G,GAAuB,CAI1B,IAHAE,EAAYH,EACZI,EAAUH,EACVI,EAAWH,EAKTD,GAHArC,EAAO5tH,EAAMiuH,SAASoC,IACZ9C,GAAS,GAAM4C,EAAYC,GAAY,IAAoCD,OAEjE,GAAM,IAC1BD,EAAkB,MAAPtC,IAENuC,GAJLH,EAAYpC,IAAS,KAIU/xG,IAPxB,CASP,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAIV0xG,KAAU4C,EACVt0G,GAAQs0G,EAERnwH,EAAMsvH,MAAQa,EAOhB,GAJA5C,KAAUyC,EACVn0G,GAAQm0G,EAERhwH,EAAMsvH,MAAQU,EACA,GAAVC,EAAc,CAChB5rE,EAAKr+C,IAAM,wBACXhG,EAAMod,KAAOsxG,EACb,MAEF1uH,EAAMpC,OAASsyH,EACflwH,EAAMqsH,MAAoB,GAAZ,EACdrsH,EAAMod,KA7pCW,GA+pCnB,KA/pCmB,GAgqCjB,GAAIpd,EAAMqsH,MAAO,CAGf,IADA9xG,EAAIva,EAAMqsH,MACHxwG,EAAOtB,GAAG,CACf,GAAa,IAAT4qB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV7b,EAAMpC,QAAU2vH,GAAS,GAAKvtH,EAAMqsH,OAAS,EAE7CkB,KAAUvtH,EAAMqsH,MAChBxwG,GAAQ7b,EAAMqsH,MAEdrsH,EAAMsvH,MAAQtvH,EAAMqsH,MAGtB,GAAIrsH,EAAMpC,OAASoC,EAAMktH,KAAM,CAC7B7oE,EAAKr+C,IAAM,gCACXhG,EAAMod,KAAOsxG,EACb,MAIF1uH,EAAMod,KAxrCS,GA0rCjB,KA1rCiB,GA2rCf,GAAa,IAAT7P,EAAc,MAAMijH,EAExB,GADA/wH,EAAOwtH,EAAO1/G,EACVvN,EAAMpC,OAAS6B,EAAM,CAEvB,IADAA,EAAOO,EAAMpC,OAAS6B,GACXO,EAAMotH,OACXptH,EAAMsuH,KAAM,CACdjqE,EAAKr+C,IAAM,gCACXhG,EAAMod,KAAOsxG,EACb,MAkBAjvH,EAAOO,EAAMqtH,OACf5tH,GAAQO,EAAMqtH,MACdjjH,EAAOpK,EAAMmtH,MAAQ1tH,GAGrB2K,EAAOpK,EAAMqtH,MAAQ5tH,EAEnBA,EAAOO,EAAMnC,SAAU4B,EAAOO,EAAMnC,QACxCkwH,EAAc/tH,EAAM4M,YAGpBmhH,EAAchrG,EACd3Y,EAAOotD,EAAMx3D,EAAMpC,OACnB6B,EAAOO,EAAMnC,OAEX4B,EAAO8N,IAAQ9N,EAAO8N,GAC1BA,GAAQ9N,EACRO,EAAMnC,QAAU4B,EAChB,GACEsjB,EAAOy0C,KAASu2D,EAAY3jH,aACnB3K,GACU,IAAjBO,EAAMnC,SAAgBmC,EAAMod,KA9uCnB,IA+uCb,MACF,KA3uCe,GA4uCb,GAAa,IAAT7P,EAAc,MAAMijH,EACxBztG,EAAOy0C,KAASx3D,EAAMnC,OACtB0P,IACAvN,EAAMod,KApvCO,GAqvCb,MACF,KAhvCS,GAivCP,GAAIpd,EAAMwoG,KAAM,CAEd,KAAO3sF,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IAEAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAcV,GAXAoxG,GAAQ1/G,EACR82C,EAAKqiE,WAAauG,EAClBjtH,EAAMoO,OAAS6+G,EACXA,IACF5oE,EAAK4gE,MAAQjlH,EAAM8uH,MAEd9uH,EAAM0xB,MAAQq0F,EAAM/lH,EAAM8uH,MAAO/rG,EAAQkqG,EAAMz1D,EAAMy1D,GAAQnH,EAAQ9lH,EAAM8uH,MAAO/rG,EAAQkqG,EAAMz1D,EAAMy1D,IAG7GA,EAAO1/G,GAEFvN,EAAM0xB,MAAQ67F,EAAOoB,EAAQpB,MAAWvtH,EAAM8uH,MAAO,CACxDzqE,EAAKr+C,IAAM,uBACXhG,EAAMod,KAAOsxG,EACb,MAGFnB,EAAO,EACP1xG,EAAO,EAIT7b,EAAMod,KAhxCE,GAkxCV,KAlxCU,GAmxCR,GAAIpd,EAAMwoG,MAAQxoG,EAAM0xB,MAAO,CAE7B,KAAO7V,EAAO,IAAI,CAChB,GAAa,IAATspB,EAAc,MAAMqrF,EACxBrrF,IACAooF,GAAQjrH,EAAM2gB,MAAWpH,EACzBA,GAAQ,EAGV,GAAI0xG,KAAwB,WAAdvtH,EAAMoO,OAAqB,CACvCi2C,EAAKr+C,IAAM,yBACXhG,EAAMod,KAAOsxG,EACb,MAGFnB,EAAO,EACP1xG,EAAO,EAIT7b,EAAMod,KAtyCA,GAwyCR,KAxyCQ,GAyyCNlN,EAt1Cc,EAu1Cd,MAAMsgH,EACR,KAAK9B,EACHx+G,GAr1Cc,EAs1Cd,MAAMsgH,EACR,KA5yCO,GA6yCL,OAv1Cc,EA01ChB,QACE,OAAO/nE,EAsBb,OARApE,EAAKiB,SAAWkS,EAChBnT,EAAKgB,UAAY93C,EACjB82C,EAAKe,QAAUniC,EACfohC,EAAKc,SAAWhgB,EAChBnlC,EAAMutH,KAAOA,EACbvtH,EAAM6b,KAAOA,GAGT7b,EAAMmtH,OAAUF,IAAS5oE,EAAKgB,WAAarlD,EAAMod,KAAOsxG,IACvC1uH,EAAMod,KA50Cd,IApDO,IAg4CuBo+B,KACrCs0E,EAAazrE,EAAMA,EAAKthC,OAAQshC,EAAKiB,SAAU2nE,EAAO5oE,EAAKgB,YAC7DrlD,EAAMod,KA10CC,IA1CS,IAw3CpB4vG,GAAO3oE,EAAKc,SACZ8nE,GAAQ5oE,EAAKgB,UACbhB,EAAKmkE,UAAYwE,EACjB3oE,EAAKqiE,WAAauG,EAClBjtH,EAAMoO,OAAS6+G,EACXjtH,EAAMwoG,MAAQykB,IAChB5oE,EAAK4gE,MAAQjlH,EAAM8uH,MAChB9uH,EAAM0xB,MAAQq0F,EAAM/lH,EAAM8uH,MAAO/rG,EAAQkqG,EAAM5oE,EAAKiB,SAAW2nE,GAAQnH,EAAQ9lH,EAAM8uH,MAAO/rG,EAAQkqG,EAAM5oE,EAAKiB,SAAW2nE,IAE/H5oE,EAAKsnE,UAAY3rH,EAAM6b,MAAQ7b,EAAMy7C,KAAO,GAAK,IAC9Bz7C,EAAMod,OAASqxG,EAAO,IAAM,IAn2C3B,KAo2CDzuH,EAAMod,MAz2CR,KAy2CyBpd,EAAMod,KAAiB,IAAM,IACzD,IAAR4vG,GAAsB,IAATC,GAl5CC,IAk5CczxE,IA14Cd,IA04CqCtrC,IACvDA,GAp4CkB,GAs4CbA,IAyETjV,EAAQqpD,WAtER,SAAoBD,GAElB,IAAKA,IAASA,EAAKrkD,MACjB,OAAOyoD,EAGT,IAAIzoD,EAAQqkD,EAAKrkD,MAKjB,OAJIA,EAAM4M,SACR5M,EAAM4M,OAAS,MAEjBy3C,EAAKrkD,MAAQ,KA15CO,GAu9CtB/E,EAAQ01H,iBAzDR,SAA0BtsE,EAAM00C,GAC9B,IAAI/4F,EAGJ,OAAKqkD,GAASA,EAAKrkD,MAEM,IAAP,GADlBA,EAAQqkD,EAAKrkD,OACFwoG,MAA0B//C,GAGrCzoD,EAAM+4F,KAAOA,EACbA,EAAKznE,MAAO,EAx6CQ,GAk6Cem3B,GAsDrCxtD,EAAQ+qD,qBA5CR,SAA8B3B,EAAM7rB,GAClC,IAEIx4B,EAFA8sH,EAAat0F,EAAW36B,OAO5B,OAAKwmD,GAAyBA,EAAKrkD,MAGhB,KAFnBA,EAAQqkD,EAAKrkD,OAEHwoG,MA35CE,KA25CYxoG,EAAMod,KACrBqrC,EA55CG,KAg6CRzoD,EAAMod,MAGC0oG,EAFA,EAEgBttF,EAAYs0F,EAAY,KAClC9sH,EAAM8uH,OA37CH,EAi8CdgB,EAAazrE,EAAM7rB,EAAYs0F,EAAYA,IAE/C9sH,EAAMod,KAx5CG,IA1CS,IAq8CpBpd,EAAM6uH,SAAW,EA38CG,GAo7C+CpmE,GAqCrExtD,EAAQ21H,YAAc,kECp/CtB,IAAItoD,EAAQ,EAAQ,MAWhBuoD,EAAQ,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,EAAG,GAG3DC,EAAO,CACT,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAGtDC,EAAQ,CACV,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,IAAK,IACtD,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,KAAM,KAAM,KAAM,KAClD,KAAM,MAAO,MAAO,MAAO,EAAG,GAG5BC,EAAO,CACT,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAC5D,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,GACpC,GAAI,GAAI,GAAI,GAAI,GAAI,IAGtBh2H,EAAOC,QAAU,SAAuBsJ,EAAM6yB,EAAM65F,EAAY9sG,EAAO8yC,EAAOi6D,EAAa/B,EAAM3zF,GAE/F,IAYI21F,EACA/vE,EACAhmB,EACAhf,EACA6G,EAIAhZ,EAMA+lH,EAAWC,EAASC,EA1BpBr0G,EAAO2f,EAAK3f,KAGZlU,EAAM,EACNgoB,EAAM,EACNrmB,EAAM,EAAGgE,EAAM,EACf8jH,EAAO,EACPlqD,EAAO,EACPmqD,EAAO,EACP9jH,EAAO,EACPgrF,EAAO,EACP+4B,EAAO,EAMPv1H,EAAO,KACPw1H,EAAa,EAGbtjG,EAAQ,IAAIq6C,EAAMy8C,MAAMyM,IACxBC,EAAO,IAAInpD,EAAMy8C,MAAMyM,IACvBnF,EAAQ,KACRqF,EAAc,EAoClB,IAAK/pH,EAAM,EAAGA,GA7FF,GA6FkBA,IAC5BsmB,EAAMtmB,GAAO,EAEf,IAAKgoB,EAAM,EAAGA,EAAMxL,EAAOwL,IACzB1B,EAAMmJ,EAAK65F,EAAathG,MAK1B,IADAyhG,EAAOv1G,EACFvO,EAtGO,GAsGQA,GAAO,GACN,IAAf2gB,EAAM3gB,GADkBA,KAM9B,GAHI8jH,EAAO9jH,IACT8jH,EAAO9jH,GAEG,IAARA,EAaF,OATA2pD,EAAMi6D,KAAiB,SAMvBj6D,EAAMi6D,KAAiB,SAEvB11F,EAAK3f,KAAO,EACL,EAET,IAAKvS,EAAM,EAAGA,EAAMgE,GACC,IAAf2gB,EAAM3kB,GADaA,KASzB,IANI8nH,EAAO9nH,IACT8nH,EAAO9nH,GAITiE,EAAO,EACF5F,EAAM,EAAGA,GApIF,GAoIkBA,IAG5B,GAFA4F,IAAS,GACTA,GAAQ0gB,EAAMtmB,IACH,EACT,OAAQ,EAGZ,GAAI4F,EAAO,IAtID,IAsIOhJ,GAA0B,IAAR+I,GACjC,OAAQ,EAKV,IADAmkH,EAAK,GAAK,EACL9pH,EAAM,EAAGA,EAjJF,GAiJiBA,IAC3B8pH,EAAK9pH,EAAM,GAAK8pH,EAAK9pH,GAAOsmB,EAAMtmB,GAIpC,IAAKgoB,EAAM,EAAGA,EAAMxL,EAAOwL,IACM,IAA3ByH,EAAK65F,EAAathG,KACpBw/F,EAAKsC,EAAKr6F,EAAK65F,EAAathG,OAAWA,GAmE3C,GAtNU,IAyLNprB,GACFxI,EAAOswH,EAAQ8C,EACfllH,EAAM,IA1LC,IA4LE1F,GACTxI,EAAO80H,EACPU,GAAc,IACdlF,EAAQyE,EACRY,GAAe,IACfznH,EAAM,MAGNlO,EAAOg1H,EACP1E,EAAQ2E,EACR/mH,GAAO,GAITqnH,EAAO,EACP3hG,EAAM,EACNhoB,EAAM2B,EACN2Z,EAAOiuG,EACPhqD,EAAOkqD,EACPC,EAAO,EACPj2F,GAAO,EAEPhf,GADAm8E,EAAO,GAAK64B,GACE,EAlNL,IAqNJ7sH,GAAiBg0F,EA1NN,KAMN,IAqNPh0F,GAAkBg0F,EA1NJ,IA2Nf,OAAO,EAIT,OAAS,CAEPy3B,EAAYroH,EAAM0pH,EACdlC,EAAKx/F,GAAO1lB,GACdgmH,EAAU,EACVC,EAAWf,EAAKx/F,IAETw/F,EAAKx/F,GAAO1lB,GACnBgmH,EAAU5D,EAAMqF,EAAcvC,EAAKx/F,IACnCugG,EAAWn0H,EAAKw1H,EAAapC,EAAKx/F,MAGlCsgG,EAAU,GACVC,EAAW,GAIbiB,EAAO,GAAMxpH,EAAM0pH,EAEnB/nH,EADA83C,EAAO,GAAK8lB,EAEZ,GAEEjQ,EAAMh0C,GAAQquG,GAAQD,IADtBjwE,GAAQ+vE,IAC+BnB,GAAa,GAAOC,GAAW,GAAMC,EAAU,QACtE,IAAT9uE,GAIT,IADA+vE,EAAO,GAAMxpH,EAAM,EACZ2pH,EAAOH,GACZA,IAAS,EAWX,GATa,IAATA,GACFG,GAAQH,EAAO,EACfG,GAAQH,GAERG,EAAO,EAIT3hG,IACqB,KAAf1B,EAAMtmB,GAAY,CACtB,GAAIA,IAAQ2F,EAAO,MACnB3F,EAAMyvB,EAAK65F,EAAa9B,EAAKx/F,IAI/B,GAAIhoB,EAAMypH,IAASE,EAAOl1G,KAAUgf,EAAK,CAYvC,IAVa,IAATi2F,IACFA,EAAOD,GAITnuG,GAAQ3Z,EAIRiE,EAAO,IADP25D,EAAOv/D,EAAM0pH,GAENnqD,EAAOmqD,EAAO/jH,MACnBC,GAAQ0gB,EAAMi5C,EAAOmqD,KACT,IACZnqD,IACA35D,IAAS,EAKX,GADAgrF,GAAQ,GAAKrxB,EA5RR,IA6RA3iE,GAAiBg0F,EAlSV,KAMN,IA6RHh0F,GAAkBg0F,EAlSR,IAmSX,OAAO,EAQTthC,EAJA77B,EAAMk2F,EAAOl1G,GAICg1G,GAAQ,GAAOlqD,GAAQ,GAAOjkD,EAAOiuG,EAAc,GAiBrE,OAVa,IAATI,IAIFr6D,EAAMh0C,EAAOquG,GAAU3pH,EAAM0pH,GAAS,GAAO,IAAM,GAAK,GAK1D71F,EAAK3f,KAAOu1G,EACL,0BChUTp2H,EAAOC,QAAU,CACf,EAAQ,kBACR,EAAQ,aACR,EAAQ,GACR,KAAQ,aACR,KAAQ,eACR,KAAQ,aACR,KAAQ,sBACR,KAAQ,eACR,KAAQ,oDCPV,IAAIqtE,EAAQ,EAAQ,MAqBpB,SAAS6a,EAAK57E,GAA6B,IAAtB,IAAII,EAAMJ,EAAI1J,SAAiB8J,GAAO,GAAKJ,EAAII,GAAO,EAI3E,IA2DIgqH,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEvDC,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAEhEC,EACF,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,GAEnCC,EACF,CAAC,GAAG,GAAG,GAAG,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAgB3CC,EAAgB,IAAI9zH,MAAM,KAC9BklF,EAAK4uC,GAOL,IAAIC,EAAgB,IAAI/zH,MAAMg0H,IAC9B9uC,EAAK6uC,GAKL,IAAIE,EAAgB,IAAIj0H,MAjBJ,KAkBpBklF,EAAK+uC,GAML,IAAIC,EAAgB,IAAIl0H,MAAM+nH,KAC9B7iC,EAAKgvC,GAGL,IAAIC,EAAgB,IAAIn0H,MAhGJ,IAiGpBklF,EAAKivC,GAGL,IAkBIC,EACAC,EACAC,EApBAC,EAAgB,IAAIv0H,MA3FJ,IAgGpB,SAASw0H,EAAeC,EAAaC,EAAYC,EAAYC,EAAOC,GAElEv2H,KAAKm2H,YAAeA,EACpBn2H,KAAKo2H,WAAeA,EACpBp2H,KAAKq2H,WAAeA,EACpBr2H,KAAKs2H,MAAeA,EACpBt2H,KAAKu2H,WAAeA,EAGpBv2H,KAAKw2H,UAAeL,GAAeA,EAAY70H,OASjD,SAASm1H,EAASC,EAAUC,GAC1B32H,KAAK02H,SAAWA,EAChB12H,KAAK42H,SAAW,EAChB52H,KAAK22H,UAAYA,EAKnB,SAASE,EAAOtF,GACd,OAAOA,EAAO,IAAMoE,EAAWpE,GAAQoE,EAAW,KAAOpE,IAAS,IAQpE,SAASuF,EAAU35G,EAAG3L,GAGpB2L,EAAE8sG,YAAY9sG,EAAE2lF,WAAmB,IAAN,EAC7B3lF,EAAE8sG,YAAY9sG,EAAE2lF,WAActxF,IAAM,EAAK,IAQ3C,SAASulH,EAAU55G,EAAG1b,EAAOH,GACvB6b,EAAE+xG,SApIY,GAoIW5tH,GAC3B6b,EAAE8xG,QAAWxtH,GAAS0b,EAAE+xG,SAAY,MACpC4H,EAAU35G,EAAGA,EAAE8xG,QACf9xG,EAAE8xG,OAASxtH,GAvIK,GAuIgB0b,EAAE+xG,SAClC/xG,EAAE+xG,UAAY5tH,EAxIE,KA0IhB6b,EAAE8xG,QAAWxtH,GAAS0b,EAAE+xG,SAAY,MACpC/xG,EAAE+xG,UAAY5tH,GAKlB,SAAS01H,EAAU75G,EAAG3M,EAAG3F,GACvBksH,EAAU55G,EAAGtS,EAAS,EAAJ2F,GAAiB3F,EAAS,EAAJ2F,EAAQ,IASlD,SAASymH,EAAWtkG,EAAMvnB,GACxB,IAAI5I,EAAM,EACV,GACEA,GAAc,EAAPmwB,EACPA,KAAU,EACVnwB,IAAQ,UACC4I,EAAM,GACjB,OAAO5I,IAAQ,EAgIjB,SAAS00H,EAAUrsH,EAAM+rH,EAAUtI,GAKjC,IAEIhvG,EACAtB,EAHAm5G,EAAY,IAAIz1H,MAAM6sH,IACtB57F,EAAO,EAOX,IAAKrT,EAAO,EAAGA,GAjTG,GAiTeA,IAC/B63G,EAAU73G,GAAQqT,EAAQA,EAAO27F,EAAShvG,EAAO,IAAO,EAS1D,IAAKtB,EAAI,EAAIA,GAAK44G,EAAU54G,IAAK,CAC/B,IAAI5S,EAAMP,EAAS,EAAJmT,EAAQ,GACX,IAAR5S,IAEJP,EAAS,EAAJmT,GAAkBi5G,EAAWE,EAAU/rH,KAAQA,KAmHxD,SAASgsH,EAAWj6G,GAClB,IAAIa,EAGJ,IAAKA,EAAI,EAAGA,EAlcMq5G,IAkcQr5G,IAAOb,EAAE4wG,UAAc,EAAJ/vG,GAAkB,EAC/D,IAAKA,EAAI,EAAGA,EAhcM,GAgcQA,IAAOb,EAAE8wG,UAAc,EAAJjwG,GAAkB,EAC/D,IAAKA,EAAI,EAAGA,EA9bM,GA8bQA,IAAOb,EAAE+wG,QAAY,EAAJlwG,GAAkB,EAE7Db,EAAE4wG,UAAUuJ,KAA0B,EACtCn6G,EAAE2xG,QAAU3xG,EAAE4xG,WAAa,EAC3B5xG,EAAE0vG,SAAW1vG,EAAE6xG,QAAU,EAO3B,SAASuI,EAAUp6G,GAEbA,EAAE+xG,SAAW,EACf4H,EAAU35G,EAAGA,EAAE8xG,QACN9xG,EAAE+xG,SAAW,IAEtB/xG,EAAE8sG,YAAY9sG,EAAE2lF,WAAa3lF,EAAE8xG,QAEjC9xG,EAAE8xG,OAAS,EACX9xG,EAAE+xG,SAAW,EA8Bf,SAASsI,EAAQ3sH,EAAMmT,EAAGjf,EAAGoxB,GAC3B,IAAIsnG,EAAU,EAAJz5G,EACN05G,EAAU,EAAJ34H,EACV,OAAQ8L,EAAK4sH,GAAgB5sH,EAAK6sH,IAC1B7sH,EAAK4sH,KAAkB5sH,EAAK6sH,IAAiBvnG,EAAMnS,IAAMmS,EAAMpxB,GASzE,SAAS44H,EAAWx6G,EAAGtS,EAAMmI,GAO3B,IAFA,IAAI+lC,EAAI57B,EAAEqxG,KAAKx7G,GACX1H,EAAI0H,GAAK,EACN1H,GAAK6R,EAAEsxG,WAERnjH,EAAI6R,EAAEsxG,UACR+I,EAAQ3sH,EAAMsS,EAAEqxG,KAAKljH,EAAI,GAAI6R,EAAEqxG,KAAKljH,GAAI6R,EAAEgT,QAC1C7kB,KAGEksH,EAAQ3sH,EAAMkuC,EAAG57B,EAAEqxG,KAAKljH,GAAI6R,EAAEgT,SAGlChT,EAAEqxG,KAAKx7G,GAAKmK,EAAEqxG,KAAKljH,GACnB0H,EAAI1H,EAGJA,IAAM,EAER6R,EAAEqxG,KAAKx7G,GAAK+lC,EAUd,SAAS6+E,EAAez6G,EAAG06G,EAAOC,GAKhC,IAAIvG,EACAwG,EAEAplG,EACAm9F,EAFAkI,EAAK,EAIT,GAAmB,IAAf76G,EAAE0vG,SACJ,GACE0E,EAAQp0G,EAAE8sG,YAAY9sG,EAAE0xG,MAAa,EAALmJ,IAAW,EAAM76G,EAAE8sG,YAAY9sG,EAAE0xG,MAAa,EAALmJ,EAAS,GAClFD,EAAK56G,EAAE8sG,YAAY9sG,EAAEwxG,MAAQqJ,GAC7BA,IAEa,IAATzG,EACFyF,EAAU75G,EAAG46G,EAAIF,IAKjBb,EAAU75G,GADVwV,EAAOijG,EAAamC,IA7jBR,IA8jBmB,EAAGF,GAEpB,KADd/H,EAAQsF,EAAYziG,KAGlBokG,EAAU55G,EADV46G,GAAMlC,EAAYljG,GACDm9F,GAMnBkH,EAAU75G,EAHVwV,EAAOkkG,IADPtF,GAImBuG,GAEL,KADdhI,EAAQuF,EAAY1iG,KAGlBokG,EAAU55G,EADVo0G,GAAQ0E,EAAUtjG,GACCm9F,UAQhBkI,EAAK76G,EAAE0vG,UAGlBmK,EAAU75G,EA1jBM,IA0jBQ06G,GAY1B,SAASI,EAAW96G,EAAGi/C,GAIrB,IAIIp+C,EAAGjf,EAEHgJ,EANA8C,EAAWuxD,EAAKs6D,SAChBwB,EAAW97D,EAAKu6D,UAAUR,YAC1BK,EAAYp6D,EAAKu6D,UAAUH,UAC3BF,EAAWl6D,EAAKu6D,UAAUL,MAE1BM,GAAY,EAUhB,IAHAz5G,EAAEsxG,SAAW,EACbtxG,EAAEuxG,SAxmBgB,IA0mBb1wG,EAAI,EAAGA,EAAIs4G,EAAOt4G,IACQ,IAAzBnT,EAAS,EAAJmT,IACPb,EAAEqxG,OAAOrxG,EAAEsxG,UAAYmI,EAAW54G,EAClCb,EAAEgT,MAAMnS,GAAK,GAGbnT,EAAS,EAAJmT,EAAQ,GAAa,EAS9B,KAAOb,EAAEsxG,SAAW,GAElB5jH,EAAY,GADZ9C,EAAOoV,EAAEqxG,OAAOrxG,EAAEsxG,UAAamI,EAAW,IAAMA,EAAW,IACjC,EAC1Bz5G,EAAEgT,MAAMpoB,GAAQ,EAChBoV,EAAE2xG,UAEE0H,IACFr5G,EAAE4xG,YAAcmJ,EAAa,EAAPnwH,EAAW,IASrC,IALAq0D,EAAKw6D,SAAWA,EAKX54G,EAAKb,EAAEsxG,UAAY,EAAczwG,GAAK,EAAGA,IAAO25G,EAAWx6G,EAAGtS,EAAMmT,GAKzEjW,EAAOuuH,EACP,GAGEt4G,EAAIb,EAAEqxG,KAAK,GACXrxG,EAAEqxG,KAAK,GAAiBrxG,EAAEqxG,KAAKrxG,EAAEsxG,YACjCkJ,EAAWx6G,EAAGtS,EAAM,GAGpB9L,EAAIoe,EAAEqxG,KAAK,GAEXrxG,EAAEqxG,OAAOrxG,EAAEuxG,UAAY1wG,EACvBb,EAAEqxG,OAAOrxG,EAAEuxG,UAAY3vH,EAGvB8L,EAAY,EAAP9C,GAAqB8C,EAAS,EAAJmT,GAAkBnT,EAAS,EAAJ9L,GACtDoe,EAAEgT,MAAMpoB,IAASoV,EAAEgT,MAAMnS,IAAMb,EAAEgT,MAAMpxB,GAAKoe,EAAEgT,MAAMnS,GAAKb,EAAEgT,MAAMpxB,IAAM,EACvE8L,EAAS,EAAJmT,EAAQ,GAAanT,EAAS,EAAJ9L,EAAQ,GAAagJ,EAGpDoV,EAAEqxG,KAAK,GAAiBzmH,IACxB4vH,EAAWx6G,EAAGtS,EAAM,SAEbsS,EAAEsxG,UAAY,GAEvBtxG,EAAEqxG,OAAOrxG,EAAEuxG,UAAYvxG,EAAEqxG,KAAK,GAjehC,SAAoBrxG,EAAGi/C,GAIrB,IAOIx8C,EACA5B,EAAGjf,EACHugB,EACA64G,EACAxiG,EAXA9qB,EAAkBuxD,EAAKs6D,SACvBE,EAAkBx6D,EAAKw6D,SACvBsB,EAAkB97D,EAAKu6D,UAAUR,YACjCK,EAAkBp6D,EAAKu6D,UAAUH,UACjC1G,EAAkB1zD,EAAKu6D,UAAUP,WACjC52H,EAAkB48D,EAAKu6D,UAAUN,WACjCE,EAAkBn6D,EAAKu6D,UAAUJ,WAMjC6B,EAAW,EAEf,IAAK94G,EAAO,EAAGA,GArNG,GAqNeA,IAC/BnC,EAAEmxG,SAAShvG,GAAQ,EAQrB,IAFAzU,EAA0B,EAArBsS,EAAEqxG,KAAKrxG,EAAEuxG,UAAgB,GAAa,EAEtC9uG,EAAIzC,EAAEuxG,SAAW,EAAG9uG,EAjOP,IAiOsBA,KAEtCN,EAAOzU,EAA+B,EAA1BA,EAAS,GADrBmT,EAAIb,EAAEqxG,KAAK5uG,IACc,GAAiB,GAAa,GAC5C22G,IACTj3G,EAAOi3G,EACP6B,KAEFvtH,EAAS,EAAJmT,EAAQ,GAAasB,EAGtBtB,EAAI44G,IAERz5G,EAAEmxG,SAAShvG,KACX64G,EAAQ,EACJn6G,GAAKxe,IACP24H,EAAQrI,EAAM9xG,EAAIxe,IAEpBm2B,EAAI9qB,EAAS,EAAJmT,GACTb,EAAE2xG,SAAWn5F,GAAKrW,EAAO64G,GACrB3B,IACFr5G,EAAE4xG,YAAcp5F,GAAKuiG,EAAU,EAAJl6G,EAAQ,GAAam6G,KAGpD,GAAiB,IAAbC,EAAJ,CAMA,EAAG,CAED,IADA94G,EAAOi3G,EAAa,EACQ,IAArBp5G,EAAEmxG,SAAShvG,IAAeA,IACjCnC,EAAEmxG,SAAShvG,KACXnC,EAAEmxG,SAAShvG,EAAO,IAAM,EACxBnC,EAAEmxG,SAASiI,KAIX6B,GAAY,QACLA,EAAW,GAOpB,IAAK94G,EAAOi3G,EAAqB,IAATj3G,EAAYA,IAElC,IADAtB,EAAIb,EAAEmxG,SAAShvG,GACF,IAANtB,IACLjf,EAAIoe,EAAEqxG,OAAO5uG,IACLg3G,IACJ/rH,EAAS,EAAJ9L,EAAQ,KAAeugB,IAE9BnC,EAAE2xG,UAAYxvG,EAAOzU,EAAS,EAAJ9L,EAAQ,IAAc8L,EAAS,EAAJ9L,GACrD8L,EAAS,EAAJ9L,EAAQ,GAAaugB,GAE5BtB,MAmZJq6G,CAAWl7G,EAAGi/C,GAGd86D,EAAUrsH,EAAM+rH,EAAUz5G,EAAEmxG,UAQ9B,SAASgK,EAAUn7G,EAAGtS,EAAM+rH,GAK1B,IAAI54G,EAEAu6G,EADAC,GAAW,EAGXC,EAAU5tH,EAAK,GAEf6mB,EAAQ,EACRgnG,EAAY,EACZC,EAAY,EAQhB,IANgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAEd9tH,EAAsB,GAAhB+rH,EAAW,GAAS,GAAa,MAElC54G,EAAI,EAAGA,GAAK44G,EAAU54G,IACzBu6G,EAASE,EACTA,EAAU5tH,EAAe,GAATmT,EAAI,GAAS,KAEvB0T,EAAQgnG,GAAaH,IAAWE,IAG3B/mG,EAAQinG,EACjBx7G,EAAE+wG,QAAiB,EAATqK,IAAwB7mG,EAEd,IAAX6mG,GAELA,IAAWC,GAAWr7G,EAAE+wG,QAAiB,EAATqK,KACpCp7G,EAAE+wG,QAAQ0K,OAEDlnG,GAAS,GAClBvU,EAAE+wG,QAAQ2K,MAGV17G,EAAE+wG,QAAQ4K,MAGZpnG,EAAQ,EACR8mG,EAAUD,EAEM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,IAUlB,SAASI,EAAU57G,EAAGtS,EAAM+rH,GAK1B,IAAI54G,EAEAu6G,EADAC,GAAW,EAGXC,EAAU5tH,EAAK,GAEf6mB,EAAQ,EACRgnG,EAAY,EACZC,EAAY,EAQhB,IALgB,IAAZF,IACFC,EAAY,IACZC,EAAY,GAGT36G,EAAI,EAAGA,GAAK44G,EAAU54G,IAIzB,GAHAu6G,EAASE,EACTA,EAAU5tH,EAAe,GAATmT,EAAI,GAAS,OAEvB0T,EAAQgnG,GAAaH,IAAWE,GAAtC,CAGO,GAAI/mG,EAAQinG,EACjB,GAAK3B,EAAU75G,EAAGo7G,EAAQp7G,EAAE+wG,eAA+B,KAAVx8F,QAE7B,IAAX6mG,GACLA,IAAWC,IACbxB,EAAU75G,EAAGo7G,EAAQp7G,EAAE+wG,SACvBx8F,KAGFslG,EAAU75G,EA1wBE,GA0wBUA,EAAE+wG,SACxB6I,EAAU55G,EAAGuU,EAAQ,EAAG,IAEfA,GAAS,IAClBslG,EAAU75G,EA3wBE,GA2wBYA,EAAE+wG,SAC1B6I,EAAU55G,EAAGuU,EAAQ,EAAG,KAGxBslG,EAAU75G,EA5wBE,GA4wBcA,EAAE+wG,SAC5B6I,EAAU55G,EAAGuU,EAAQ,GAAI,IAG3BA,EAAQ,EACR8mG,EAAUD,EACM,IAAZE,GACFC,EAAY,IACZC,EAAY,GAEHJ,IAAWE,GACpBC,EAAY,EACZC,EAAY,IAGZD,EAAY,EACZC,EAAY,IAhuBlB/xC,EAAKqvC,GAu1BL,IAAI+C,GAAmB,EA4BvB,SAAS5I,EAAiBjzG,EAAGnS,EAAKiuH,EAAY/5E,GAM5C63E,EAAU55G,EAAG,GAAuB+hC,EAAO,EAAI,GAAI,GAzfrD,SAAoB/hC,EAAGnS,EAAKI,EAAK8C,GAM/BqpH,EAAUp6G,GAGR25G,EAAU35G,EAAG/R,GACb0rH,EAAU35G,GAAI/R,GAKhB2gE,EAAMk8C,SAAS9qG,EAAE8sG,YAAa9sG,EAAE9M,OAAQrF,EAAKI,EAAK+R,EAAE2lF,SACpD3lF,EAAE2lF,SAAW13F,EA0eb8tH,CAAW/7G,EAAGnS,EAAKiuH,GAoKrBv6H,EAAQ2wH,SAlMR,SAAkBlyG,GAGX67G,IAxmBP,WACE,IAAIh7G,EACAsB,EACAhe,EACAqxB,EACA4+F,EACAjD,EAAW,IAAI5sH,MAAM6sH,IAiBzB,IADAjtH,EAAS,EACJqxB,EAAO,EAAGA,EAAOwmG,GAAkBxmG,IAEtC,IADAkjG,EAAYljG,GAAQrxB,EACf0c,EAAI,EAAGA,EAAK,GAAKo3G,EAAYziG,GAAQ3U,IACxC43G,EAAat0H,KAAYqxB,EAY7B,IAJAijG,EAAat0H,EAAS,GAAKqxB,EAG3B4+F,EAAO,EACF5+F,EAAO,EAAGA,EAAO,GAAIA,IAExB,IADAsjG,EAAUtjG,GAAQ4+F,EACbvzG,EAAI,EAAGA,EAAK,GAAKq3G,EAAY1iG,GAAQ3U,IACxC23G,EAAWpE,KAAU5+F,EAKzB,IADA4+F,IAAS,EACF5+F,EAjYW,GAiYKA,IAErB,IADAsjG,EAAUtjG,GAAQ4+F,GAAQ,EACrBvzG,EAAI,EAAGA,EAAK,GAAMq3G,EAAY1iG,GAAQ,EAAK3U,IAC9C23G,EAAW,IAAMpE,KAAU5+F,EAM/B,IAAKrT,EAAO,EAAGA,GAjYG,GAiYeA,IAC/BgvG,EAAShvG,GAAQ,EAInB,IADAtB,EAAI,EACGA,GAAK,KACVw3G,EAAiB,EAAJx3G,EAAQ,GAAa,EAClCA,IACAswG,EAAS,KAEX,KAAOtwG,GAAK,KACVw3G,EAAiB,EAAJx3G,EAAQ,GAAa,EAClCA,IACAswG,EAAS,KAEX,KAAOtwG,GAAK,KACVw3G,EAAiB,EAAJx3G,EAAQ,GAAa,EAClCA,IACAswG,EAAS,KAEX,KAAOtwG,GAAK,KACVw3G,EAAiB,EAAJx3G,EAAQ,GAAa,EAClCA,IACAswG,EAAS,KASX,IAHA4I,EAAU1B,EAAc4D,IAAa9K,GAGhCtwG,EAAI,EAAGA,EA1aM,GA0aOA,IACvBy3G,EAAiB,EAAJz3G,EAAQ,GAAa,EAClCy3G,EAAiB,EAAJz3G,GAAkBi5G,EAAWj5G,EAAG,GAI/C83G,EAAgB,IAAII,EAAeV,EAAcJ,EAAaiC,IAnb5CA,IAYA,IAwalBtB,EAAgB,IAAIG,EAAeT,EAAcJ,EAAa,EAjb5C,GASA,IAyalBW,EAAiB,IAAIE,EAAe,IAAIx0H,MAAM,GAAI4zH,EAAc,EA/a9C,GAiBF,GAw6Bd+D,GACAL,GAAmB,GAGrB77G,EAAEgxG,OAAU,IAAIsI,EAASt5G,EAAE4wG,UAAW+H,GACtC34G,EAAEixG,OAAU,IAAIqI,EAASt5G,EAAE8wG,UAAW8H,GACtC54G,EAAEkxG,QAAU,IAAIoI,EAASt5G,EAAE+wG,QAAS8H,GAEpC74G,EAAE8xG,OAAS,EACX9xG,EAAE+xG,SAAW,EAGbkI,EAAWj6G,IAmLbze,EAAQ0xH,iBAAmBA,EAC3B1xH,EAAQ2rH,gBAnJR,SAAyBltG,EAAGnS,EAAKiuH,EAAY/5E,GAM3C,IAAIo6E,EAAUC,EACVC,EAAc,EAGdr8G,EAAE4pC,MAAQ,GAnhCY,IAshCpB5pC,EAAE2qC,KAAKsnE,YACTjyG,EAAE2qC,KAAKsnE,UArGb,SAA0BjyG,GAKxB,IACIa,EADAy7G,EAAa,WAIjB,IAAKz7G,EAAI,EAAGA,GAAK,GAAIA,IAAKy7G,KAAgB,EACxC,GAAkB,EAAbA,GAAoD,IAAhCt8G,EAAE4wG,UAAc,EAAJ/vG,GACnC,OAh8BsB,EAq8B1B,GAAoC,IAAhCb,EAAE4wG,UAAU,KAA0D,IAAjC5wG,EAAE4wG,UAAU,KAChB,IAAjC5wG,EAAE4wG,UAAU,IACd,OAt8BwB,EAw8B1B,IAAK/vG,EAAI,GAAIA,EA56BK,IA46BSA,IACzB,GAAoC,IAAhCb,EAAE4wG,UAAc,EAAJ/vG,GACd,OA18BsB,EAi9B1B,OAl9B0B,EA0hCH07G,CAAiBv8G,IAItC86G,EAAW96G,EAAGA,EAAEgxG,QAIhB8J,EAAW96G,EAAGA,EAAEixG,QAUhBoL,EAnMJ,SAAuBr8G,GACrB,IAAIq8G,EAgBJ,IAbAlB,EAAUn7G,EAAGA,EAAE4wG,UAAW5wG,EAAEgxG,OAAOyI,UACnC0B,EAAUn7G,EAAGA,EAAE8wG,UAAW9wG,EAAEixG,OAAOwI,UAGnCqB,EAAW96G,EAAGA,EAAEkxG,SASXmL,EAAcG,GAAcH,GAAe,GACW,IAArDr8G,EAAE+wG,QAAgC,EAAxBqH,EAASiE,GAAmB,GADOA,KAUnD,OAJAr8G,EAAE2xG,SAAW,GAAK0K,EAAc,GAAK,EAAI,EAAI,EAItCA,EAwKSI,CAAcz8G,GAG5Bm8G,EAAYn8G,EAAE2xG,QAAU,EAAI,IAAO,GACnCyK,EAAep8G,EAAE4xG,WAAa,EAAI,IAAO,IAMtBuK,IAAYA,EAAWC,IAI1CD,EAAWC,EAAcN,EAAa,EAGnCA,EAAa,GAAKK,IAAuB,IAATtuH,EASnColH,EAAiBjzG,EAAGnS,EAAKiuH,EAAY/5E,GA1kCb,IA4kCf/hC,EAAE8pC,UAAwBsyE,IAAgBD,GAEnDvC,EAAU55G,EAAG,GAAuB+hC,EAAO,EAAI,GAAI,GACnD04E,EAAez6G,EAAGq4G,EAAcC,KAGhCsB,EAAU55G,EAAG,GAAoB+hC,EAAO,EAAI,GAAI,GAjMpD,SAAwB/hC,EAAG08G,EAAQC,EAAQC,GAIzC,IAAIhQ,EASJ,IAHAgN,EAAU55G,EAAG08G,EAAS,IAAK,GAC3B9C,EAAU55G,EAAG28G,EAAS,EAAK,GAC3B/C,EAAU55G,EAAG48G,EAAU,EAAI,GACtBhQ,EAAO,EAAGA,EAAOgQ,EAAShQ,IAE7BgN,EAAU55G,EAAGA,EAAE+wG,QAAyB,EAAjBqH,EAASxL,GAAY,GAAY,GAI1DgP,EAAU57G,EAAGA,EAAE4wG,UAAW8L,EAAS,GAGnCd,EAAU57G,EAAGA,EAAE8wG,UAAW6L,EAAS,GA4KjCE,CAAe78G,EAAGA,EAAEgxG,OAAOyI,SAAW,EAAGz5G,EAAEixG,OAAOwI,SAAW,EAAG4C,EAAc,GAC9E5B,EAAez6G,EAAGA,EAAE4wG,UAAW5wG,EAAE8wG,YAMnCmJ,EAAWj6G,GAEP+hC,GACFq4E,EAAUp6G,IAuEdze,EAAQguH,UA7DR,SAAmBvvG,EAAGo0G,EAAMwG,GAmD1B,OA5CA56G,EAAE8sG,YAAY9sG,EAAE0xG,MAAqB,EAAb1xG,EAAE0vG,UAAqB0E,IAAS,EAAK,IAC7Dp0G,EAAE8sG,YAAY9sG,EAAE0xG,MAAqB,EAAb1xG,EAAE0vG,SAAe,GAAY,IAAP0E,EAE9Cp0G,EAAE8sG,YAAY9sG,EAAEwxG,MAAQxxG,EAAE0vG,UAAiB,IAALkL,EACtC56G,EAAE0vG,WAEW,IAAT0E,EAEFp0G,EAAE4wG,UAAe,EAALgK,MAEZ56G,EAAE6xG,UAEFuC,IAKAp0G,EAAE4wG,UAA8C,GAAnC6H,EAAamC,GA9lCV,IA8lC2B,MAC3C56G,EAAE8wG,UAAyB,EAAf4I,EAAOtF,OA0Bbp0G,EAAE0vG,WAAa1vG,EAAEyxG,YAAc,GAWzClwH,EAAQyxH,UAhKR,SAAmBhzG,GACjB45G,EAAU55G,EAAG88G,EAAmB,GAChCjD,EAAU75G,EAz8BM,IAy8BQq4G,GA5yB1B,SAAkBr4G,GACG,KAAfA,EAAE+xG,UACJ4H,EAAU35G,EAAGA,EAAE8xG,QACf9xG,EAAE8xG,OAAS,EACX9xG,EAAE+xG,SAAW,GAEJ/xG,EAAE+xG,UAAY,IACvB/xG,EAAE8sG,YAAY9sG,EAAE2lF,WAAwB,IAAX3lF,EAAE8xG,OAC/B9xG,EAAE8xG,SAAW,EACb9xG,EAAE+xG,UAAY,GAoyBhBgL,CAAS/8G,2BC1/BX1e,EAAOC,QAzBP,WAEEsB,KAAK+F,MAAQ,KACb/F,KAAK6oD,QAAU,EAEf7oD,KAAK4oD,SAAW,EAEhB5oD,KAAKisH,SAAW,EAEhBjsH,KAAKwmB,OAAS,KACdxmB,KAAK+oD,SAAW,EAEhB/oD,KAAK8oD,UAAY,EAEjB9oD,KAAKmqH,UAAY,EAEjBnqH,KAAKyJ,IAAM,GAEXzJ,KAAKyD,MAAQ,KAEbzD,KAAKovH,UAAY,EAEjBpvH,KAAK0oH,MAAQ,gCCvCf,IAAIrpH,EAAO,EAAQ,MAEnBX,EAAQy7H,YAAc,EAAtB,MAEA,IAAIC,EAAgB/6H,EAAKE,OAAO,iBAAiB,WAC/CS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,WAAWi2H,MACpBt6H,KAAKqE,IAAI,WAAWi2H,MACpBt6H,KAAKqE,IAAI,kBAAkBi2H,MAC3Bt6H,KAAKqE,IAAI,mBAAmBi2H,MAC5Bt6H,KAAKqE,IAAI,UAAUi2H,MACnBt6H,KAAKqE,IAAI,UAAUi2H,MACnBt6H,KAAKqE,IAAI,aAAai2H,MACtBt6H,KAAKqE,IAAI,aAAai2H,MACtBt6H,KAAKqE,IAAI,eAAei2H,UAG5B57H,EAAQ07H,cAAgBA,EAExB,IAAIG,EAAel7H,EAAKE,OAAO,gBAAgB,WAC7CS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,WAAWi2H,MACpBt6H,KAAKqE,IAAI,kBAAkBi2H,UAG/B57H,EAAQ67H,aAAeA,EAEvB,IAAIC,EAAYn7H,EAAKE,OAAO,wBAAwB,WAClDS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,aAAaF,IAAIs2H,GAC1Bz6H,KAAKqE,IAAI,oBAAoBq2H,aAGjCh8H,EAAQ87H,UAAYA,EAEpB,IAAIC,EAAsBp7H,EAAKE,OAAO,uBAAuB,WAC3DS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,aAAamK,QACtBxO,KAAKqE,IAAI,QAAQs2H,QAAQ32H,WACzBhE,KAAKqE,IAAI,SAASmK,QAAQxK,WAC1BhE,KAAKqE,IAAI,UAAUg2H,MAAMn2H,IACvBlE,KAAKqE,IAAI,KAAKi2H,MACdt6H,KAAKqE,IAAI,KAAKi2H,MACdt6H,KAAKqE,IAAI,KAAKi2H,OACdt2H,eAIF42H,EAAiBv7H,EAAKE,OAAO,kBAAkB,WACjDS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,WAAWi2H,MACpBt6H,KAAKqE,IAAI,aAAaF,IAAIs2H,GAC1Bz6H,KAAKqE,IAAI,qBAAqBw2H,aAGlCn8H,EAAQo8H,WAAaF,EACrB,IAAIG,EAA0B17H,EAAKE,OAAO,2BAA2B,WACnES,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,aAAag2H,MAAMn2H,IAC1BlE,KAAKqE,IAAI,MAAMmK,QACfxO,KAAKqE,IAAI,WAAWg2H,MAAMn2H,IACxBlE,KAAKqE,IAAI,OAAOg2H,MAAMn2H,IACpBlE,KAAKqE,IAAI,MAAMmK,QACfxO,KAAKqE,IAAI,aAAag2H,MAAMn2H,IAC1BlE,KAAKqE,IAAI,QAAQw2H,SACjB76H,KAAKqE,IAAI,SAASi2H,QAGtBt6H,KAAKqE,IAAI,UAAUg2H,MAAMn2H,IACvBlE,KAAKqE,IAAI,QAAQmK,QACjBxO,KAAKqE,IAAI,MAAMw2H,YAIrB76H,KAAKqE,IAAI,qBAAqBw2H,aAIlCn8H,EAAQs8H,oBAAsBD,EAE9B,IAAIE,EAAgB57H,EAAKE,OAAO,iBAAiB,WAC/CS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,WAAWi2H,MACpBt6H,KAAKqE,IAAI,KAAKi2H,MACdt6H,KAAKqE,IAAI,KAAKi2H,MACdt6H,KAAKqE,IAAI,KAAKi2H,MACdt6H,KAAKqE,IAAI,WAAWi2H,MACpBt6H,KAAKqE,IAAI,YAAYi2H,UAGzB57H,EAAQu8H,cAAgBA,EAExBv8H,EAAQw8H,SAAW77H,EAAKE,OAAO,YAAY,WACzCS,KAAKs6H,SAGP,IAAIa,EAAe97H,EAAKE,OAAO,gBAAgB,WAC7CS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,WAAWi2H,MACpBt6H,KAAKqE,IAAI,cAAcw2H,SACvB76H,KAAKqE,IAAI,cAAcL,WAAWM,SAAS,GAAGH,IAAIi3H,GAClDp7H,KAAKqE,IAAI,aAAaL,WAAWM,SAAS,GAAGo2H,aAGjDh8H,EAAQy8H,aAAeA,EAEvB,IAAIC,EAAe/7H,EAAKE,OAAO,gBAAgB,WAC7CS,KAAK+D,OAAO,CACVs3H,WAAYr7H,KAAKwO,aAIrB9P,EAAQ0nD,UAAY/mD,EAAKE,OAAO,aAAa,WAC3CS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,KAAKi2H,MACdt6H,KAAKqE,IAAI,KAAKi2H,uCClHlB,IAAIgB,EAAM,EAAQ,MAEdC,EAAOD,EAAI/7H,OAAO,QAAQ,WAC5BS,KAAK+D,OAAO,CACVy3H,QAASx7H,KAAKy7H,UACdC,YAAa17H,KAAK27H,eAIlBC,EAAqBN,EAAI/7H,OAAO,sBAAsB,WACxDS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,QAAQmK,QACjBxO,KAAKqE,IAAI,SAASJ,UAIlBw2H,EAAsBa,EAAI/7H,OAAO,uBAAuB,WAC1DS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,aAAamK,QACtBxO,KAAKqE,IAAI,cAAcL,WACvBhE,KAAKqE,IAAI,SAASmK,QAAQxK,eAI1B63H,EAAuBP,EAAI/7H,OAAO,wBAAwB,WAC5DS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,aAAaF,IAAIs2H,GAC1Bz6H,KAAKqE,IAAI,oBAAoBq2H,aAI7BoB,EAA4BR,EAAI/7H,OAAO,6BAA6B,WACtES,KAAK+7H,MAAMH,MAGTI,EAAcV,EAAI/7H,OAAO,eAAe,WAC1CS,KAAKi8H,MAAMH,MAGT76C,EAAOq6C,EAAI/7H,OAAO,QAAQ,WAC5BS,KAAK+D,OAAO,CACVm4H,YAAal8H,KAAKmE,IAAI63H,QAItBG,EAAWb,EAAI/7H,OAAO,YAAY,WACpCS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,aAAaF,IAAIo3H,GAC1Bv7H,KAAKqE,IAAI,YAAYF,IAAIo3H,OAIzB31F,EAAY01F,EAAI/7H,OAAO,aAAa,WACtCS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,UAAUmK,QACnBxO,KAAKqE,IAAI,YAAY+3H,OAAO12H,KAAI,GAChC1F,KAAKqE,IAAI,aAAaw2H,aAItBwB,EAAiBf,EAAI/7H,OAAO,kBAAkB,WAChDS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,WAAWC,SAAS,GAAGg2H,MAAMt2H,WACtChE,KAAKqE,IAAI,gBAAgBi2H,MACzBt6H,KAAKqE,IAAI,aAAaF,IAAIs2H,GAC1Bz6H,KAAKqE,IAAI,UAAUF,IAAI88E,GACvBjhF,KAAKqE,IAAI,YAAYF,IAAIg4H,GACzBn8H,KAAKqE,IAAI,WAAWF,IAAI88E,GACxBjhF,KAAKqE,IAAI,wBAAwBF,IAAI03H,GACrC77H,KAAKqE,IAAI,kBAAkBE,SAAS,GAAGm2H,SAAS12H,WAChDhE,KAAKqE,IAAI,mBAAmBE,SAAS,GAAGm2H,SAAS12H,WACjDhE,KAAKqE,IAAI,cAAcC,SAAS,GAAG23H,MAAMr2F,GAAW5hC,eAIpDs4H,EAAkBhB,EAAI/7H,OAAO,mBAAmB,WAClDS,KAAKq6H,MAAMn2H,IACTlE,KAAKqE,IAAI,kBAAkBF,IAAIk4H,GAC/Br8H,KAAKqE,IAAI,sBAAsBF,IAAIs2H,GACnCz6H,KAAKqE,IAAI,kBAAkBq2H,aAI/Bj8H,EAAOC,QAAU49H,kBCvFjB,IAAIC,EAAW,wHACXC,EAAa,8CACbC,EAAY,iFACZC,EAAM,EAAQ,MACd9+E,EAAU,EAAQ,MAClB18C,EAAS,eACbzC,EAAOC,QAAU,SAAUi+H,EAAM39E,GAC/B,IAEI49E,EAFAv4H,EAAMs4H,EAAK1wH,WACXpE,EAAQxD,EAAIwD,MAAM00H,GAEtB,GAAK10H,EAGE,CACL,IAAIk3C,EAAQ,MAAQl3C,EAAM,GACtBo0C,EAAK/6C,EAAO2M,KAAKhG,EAAM,GAAI,OAC3Bg1H,EAAa37H,EAAO2M,KAAKhG,EAAM,GAAG+F,QAAQ,UAAW,IAAK,UAC1DkvH,EAAYJ,EAAI19E,EAAU/C,EAAGr5C,MAAM,EAAG,GAAI07B,SAASz2B,EAAM,GAAI,KAAKxD,IAClEvB,EAAM,GACNi6H,EAASn/E,EAAQS,iBAAiBU,EAAO+9E,EAAW7gF,GACxDn5C,EAAIiC,KAAKg4H,EAAO3rF,OAAOyrF,IACvB/5H,EAAIiC,KAAKg4H,EAAOx/E,SAChBq/E,EAAY17H,EAAOqC,OAAOT,OAZhB,CACV,IAAIk6H,EAAS34H,EAAIwD,MAAM40H,GACvBG,EAAY17H,EAAO2M,KAAKmvH,EAAO,GAAGpvH,QAAQ,UAAW,IAAK,UAa5D,MAAO,CACLhK,IAFQS,EAAIwD,MAAM20H,GAAY,GAG9B57H,KAAMg8H,mBC5BV,IAAIv9H,EAAO,EAAQ,MACf49H,EAAQ,EAAQ,MAChBC,EAAU,EAAQ,MAClBt/E,EAAU,EAAQ,MAClBu/E,EAAS,EAAQ,MACjBj8H,EAAS,eAGb,SAASmjD,EAAW94C,GAClB,IAAIyzC,EACkB,iBAAXzzC,GAAwBrK,EAAOE,SAASmK,KACjDyzC,EAAWzzC,EAAO6xH,WAClB7xH,EAASA,EAAOlH,KAEI,iBAAXkH,IACTA,EAASrK,EAAO2M,KAAKtC,IAGvB,IAII8xH,EAASC,EAJTC,EAAWL,EAAQ3xH,EAAQyzC,GAE3Bh3C,EAAOu1H,EAAS35H,IAChBhD,EAAO28H,EAAS38H,KAEpB,OAAQoH,GACN,IAAK,cACHs1H,EAAQj+H,EAAK86H,YAAYx5H,OAAOC,EAAM,OAAO48H,eAAeC,qBAE9D,IAAK,aAKH,OAJKH,IACHA,EAAQj+H,EAAKm7H,UAAU75H,OAAOC,EAAM,QAEtCy8H,EAAUC,EAAM/5E,UAAUA,UAAU1gD,KAAK,MAEvC,IAAK,uBACH,OAAOxD,EAAKk7H,aAAa55H,OAAO28H,EAAMI,iBAAiB98H,KAAM,OAC/D,IAAK,oBAEH,OADA08H,EAAMt3E,kBAAoBs3E,EAAMI,iBACzB,CACL11H,KAAM,KACNpH,KAAM08H,GAEV,IAAK,oBAEH,OADAA,EAAM/5E,UAAU7Q,OAAOwT,QAAU7mD,EAAK67H,SAASv6H,OAAO28H,EAAMI,iBAAiB98H,KAAM,OAC5E,CACLoH,KAAM,MACNpH,KAAM08H,EAAM/5E,UAAU7Q,QAE1B,QAAS,MAAM,IAAIzzC,MAAM,kBAAoBo+H,GAGjD,IAAK,wBAEHz8H,EAyCN,SAAkBA,EAAMo+C,GACtB,IAAI88C,EAAOl7F,EAAK2iD,UAAU5U,QAAQgvF,IAAIC,UAAU9hC,KAC5C+hC,EAAQv/F,SAAS19B,EAAK2iD,UAAU5U,QAAQgvF,IAAIC,UAAUC,MAAM5xH,WAAY,IACxEu4C,EAAOy4E,EAAMr8H,EAAK2iD,UAAU5U,QAAQouF,OAAOv4E,KAAK3hD,KAAK,MACrDo5C,EAAKr7C,EAAK2iD,UAAU5U,QAAQouF,OAAO9gF,GACnC4gF,EAAaj8H,EAAKolD,kBAClB83E,EAASx/F,SAASkmB,EAAKl3C,MAAM,KAAK,GAAI,IAAM,EAC5CjJ,EAAM84H,EAAOv1D,WAAW5oB,EAAU88C,EAAM+hC,EAAOC,EAAQ,QACvDf,EAASn/E,EAAQS,iBAAiBmG,EAAMngD,EAAK43C,GAC7Cn5C,EAAM,GAGV,OAFAA,EAAIiC,KAAKg4H,EAAO3rF,OAAOyrF,IACvB/5H,EAAIiC,KAAKg4H,EAAOx/E,SACTr8C,EAAOqC,OAAOT,GArDV6rC,CADP/tC,EAAOvB,EAAK27H,oBAAoBr6H,OAAOC,EAAM,OACxBo+C,GAEvB,IAAK,cAGH,OADAq+E,GADAC,EAAQj+H,EAAKy7H,WAAWn6H,OAAOC,EAAM,QACrB2iD,UAAUA,UAAU1gD,KAAK,MAEvC,IAAK,uBACH,OAAOxD,EAAK+6H,cAAcz5H,OAAO28H,EAAMt3E,kBAAmB,OAC5D,IAAK,oBACH,MAAO,CACLZ,MAAOk4E,EAAM/5E,UAAU6B,MACvBG,WAAYlmD,EAAK87H,aAAax6H,OAAO28H,EAAMt3E,kBAAmB,OAAOT,YAEzE,IAAK,oBAEH,OADA+3E,EAAM/5E,UAAU7Q,OAAOgT,SAAWrmD,EAAK67H,SAASv6H,OAAO28H,EAAMt3E,kBAAmB,OACzE,CACLh+C,KAAM,MACN0qC,OAAQ4qF,EAAM/5E,UAAU7Q,QAE5B,QAAS,MAAM,IAAIzzC,MAAM,kBAAoBo+H,GAGjD,IAAK,iBACH,OAAOh+H,EAAKk7H,aAAa55H,OAAOC,EAAM,OACxC,IAAK,kBACH,OAAOvB,EAAK+6H,cAAcz5H,OAAOC,EAAM,OACzC,IAAK,kBACH,MAAO,CACLoH,KAAM,MACN0qC,OAAQrzC,EAAK47H,cAAct6H,OAAOC,EAAM,QAE5C,IAAK,iBAEH,MAAO,CACLwkD,OAFFxkD,EAAOvB,EAAK87H,aAAax6H,OAAOC,EAAM,QAExBm9H,WAAWt8H,MACvB8jD,WAAY3kD,EAAK2kD,YAErB,QAAS,MAAM,IAAItmD,MAAM,oBAAsB+I,IAnFnDvJ,EAAOC,QAAU2lD,EAsFjBA,EAAU+B,UAAY/mD,EAAK+mD,+CCzF3B,MAAMtoB,EAAU,EAAQ,MAClBkgG,EAAe,EAAQ,MACvBC,EAAK,EAAQ,MACb7+H,EAAM,EAAQ,MACd8+H,EAAS,EAAQ,MACjBn3H,EAAO,EAAQ,MACf44B,EAAO,EAAQ,MACfoP,EAAiB,EAAQ,MAa/B,SAASovF,EAAcC,GACrB,GAAyB,iBAAdA,GAA0B,qBAAqB/2H,KAAK+2H,GAAY,CAEzE,MAAMC,EAAaH,EAAOE,GAG1B,IAAKC,EAAWz3F,SACd,MAAM,IAAI3nC,MAAM,8BAGlB,OAAOo/H,EACF,GAAyB,iBAAdD,IAA2B,kBAAkB/2H,KAAK+2H,IAAc,kBAAkB/2H,KAAK+2H,IAEvG,OAAOF,EAAO,uBAAuBE,KAChC,GAAIl9H,EAAOE,SAASg9H,IAAmC,KAArBA,EAAU98H,OAEjD,OAAO48H,EAAO,uBAAuBE,EAAUnyH,SAAS,UACnD,GAAI/K,EAAOE,SAASg9H,GAEzB,OA+EJ,SAA4Bv4D,GACtB3kE,EAAOE,SAASykE,KAClBA,EAAU/nC,EAAQn9B,OAAOklE,IAI3By4D,EAAOz4D,EAAQv5B,KAAM,QACrBgyF,EAAOz4D,EAAQv5B,KAAK,eAAiBu5B,EAAQv5B,KAAKxsC,KAAM,aACxDw+H,EAAOz4D,EAAQv5B,KAAK,gBAAiB,wBACrCgyF,EAAOz4D,EAAQv5B,KAAK+5B,OAAQ,eAExBR,EAAQv5B,KAAKiJ,MACfswB,EAAQv5B,KAAKiJ,MAAMvyC,SAAQ6hE,IACzBy5D,EAA8B,iBAAhBz5D,EAAKvjE,OAAqB,wBACxCg9H,EAAOz5D,EAAK,eAAiBA,EAAK99D,KAAM,yBAG1Cu3H,EAAsC,iBAAxBz4D,EAAQv5B,KAAKhrC,OAAqB,eAGlD,MAAM4E,EAAS,CACbomC,KAAMu5B,EAAQv5B,KACdiyF,WAAYzgG,EAAQ/8B,OAAO8kE,EAAQv5B,MACnCxsC,MAAO+lE,EAAQv5B,KAAK,eAAiBu5B,EAAQv5B,KAAKxsC,MAAMmM,WACxDojC,SAAU,IAGZnpC,EAAO0gC,SAAWjH,EAAKoH,KAAK7gC,EAAOq4H,YACnCr4H,EAAO0hC,eAAiB1mC,EAAO2M,KAAK3H,EAAO0gC,SAAU,YAExBx+B,IAAzBy9D,EAAQv5B,KAAK25B,UAAuB//D,EAAO+/D,UAAYJ,EAAQv5B,KAAK25B,SAEpEJ,EAAQ,mBAAkB3/D,EAAOs4H,QAAU,IAAIvxH,KAAgC,IAA3B44D,EAAQ,mBAC5DA,EAAQ,gBAAe3/D,EAAO8/D,UAAYH,EAAQ,cAAc55D,YAEhE/K,EAAOE,SAASykE,EAAQE,WAAU7/D,EAAO6/D,QAAUF,EAAQE,QAAQ95D,YAGnEvK,MAAMC,QAAQkkE,EAAQ,mBAAqBA,EAAQ,iBAAiBvkE,OAAS,EAC/EukE,EAAQ,iBAAiB7iE,SAAQy7H,IAC/BA,EAAKz7H,SAAQwxC,IACXtuC,EAAOmpC,SAAStqC,KAAKyvC,EAAIvoC,kBAGpB45D,EAAQx2B,UACjBnpC,EAAOmpC,SAAStqC,KAAK8gE,EAAQx2B,SAASpjC,YAIpC/K,EAAOE,SAASykE,EAAQ,eAE1BA,EAAQ,YAAcA,EAAQ,YAAYvkE,OAAS,EAC/C,CAACukE,EAAQ,aACT,IAEN3/D,EAAO0/D,SAAWC,EAAQ,aAAe,IAAIjkE,KAAI4yC,GAAOA,EAAIvoC,aAG5D/F,EAAOmpC,SAAW3tC,MAAMmM,KAAK,IAAImsB,IAAI9zB,EAAOmpC,WAC5CnpC,EAAO0/D,QAAUlkE,MAAMmM,KAAK,IAAImsB,IAAI9zB,EAAO0/D,UAE3C,MAAMrwB,EAAQswB,EAAQv5B,KAAKiJ,OAAS,CAACswB,EAAQv5B,MAC7CpmC,EAAOqvC,MAAQA,EAAM3zC,KAAI,CAACijE,EAAMx5D,KAC9B,MAAMowB,EAAQ,GAAGl4B,OAAO2C,EAAOpG,KAAM+kE,EAAK,eAAiBA,EAAK99D,MAAQ,IAAInF,KAAI4N,GAAKA,EAAEvD,aACvF,MAAO,CACLlF,KAAMA,EAAKlE,KAAKmC,MAAM,KAAM,CAAC+B,EAAK01B,KAAKl5B,OAAOk4B,IAAQ74B,MAAM,GAC5D9C,KAAM27B,EAAMA,EAAMn6B,OAAS,GAC3BA,OAAQujE,EAAKvjE,OACbD,OAAQk0C,EAAM3yC,MAAM,EAAGyI,GAAG+yB,OAAOmnC,EAAW,OAIhDr/D,EAAO5E,OAASi0C,EAAMnX,OAAOmnC,EAAW,GAExC,MAAMm5D,EAAWx4H,EAAOqvC,MAAMrvC,EAAOqvC,MAAMj0C,OAAS,GAMpD,OAJA4E,EAAOkgE,YAAcP,EAAQv5B,KAAK,gBAClCpmC,EAAOy4H,iBAAoBD,EAASr9H,OAASq9H,EAASp9H,QAAU4E,EAAOkgE,aAAgBlgE,EAAOkgE,YAC9FlgE,EAAOmgE,OAuDT,SAAsBr7D,GACpB,MAAMq7D,EAAS,GACf,IAAK,IAAIh7D,EAAI,EAAGA,EAAIL,EAAI1J,OAAQ+J,GAAK,GACnCg7D,EAAOthE,KAAKiG,EAAIpI,MAAMyI,EAAGA,EAAI,IAAIY,SAAS,QAE5C,OAAOo6D,EA5DSu4D,CAAY/4D,EAAQv5B,KAAK+5B,QAElCngE,EA/JE24H,CAAkBT,GACpB,GAAIA,GAAaA,EAAUx3F,SAYhC,OAVAw3F,EAAUx3F,SAAWw3F,EAAUx3F,SAASiB,cAEnCu2F,EAAU/uF,WAAU+uF,EAAU/uF,SAAW,IAEZ,iBAAvB+uF,EAAU/uF,WACnB+uF,EAAU/uF,SAAW,CAAC+uF,EAAU/uF,WAG7B+uF,EAAUx4D,UAASw4D,EAAUx4D,QAAU,IAErCw4D,EAEP,MAAM,IAAIn/H,MAAM,8BAiMpB,SAASsmE,EAAWxpC,EAAK8oC,GACvB,OAAO9oC,EAAM8oC,EAAKvjE,OAWpB,SAASg9H,EAAQlC,EAAM0C,GACrB,IAAK1C,EAAM,MAAM,IAAIn9H,MAAM,sCAAsC6/H,KA3PnErgI,EAAOC,QAAUy/H,EACjB1/H,EAAOC,QAAQqgI,OAgDf,SAASC,EAAoBZ,EAAWn/F,EAAM8J,GAC5C,GAAoB,mBAAT9J,EAAqB,OAAO+/F,EAAmBZ,EAAW,GAAIn/F,GACzE,GAAkB,mBAAP8J,EAAmB,MAAM,IAAI9pC,MAAM,sCAE9C,IAAIggI,EACJ,IACEA,EAAgBd,EAAaC,GAC7B,MAAOr0H,IAqCT,SAASm1H,EAAcC,GACrB,IACEF,EAAgBd,EAAagB,GAC7B,MAAOp1H,GACP,OAAOg/B,EAAGh/B,GAERk1H,GAAiBA,EAAcr4F,SAAUmC,EAAG,KAAMk2F,GACjDl2F,EAAG,IAAI9pC,MAAM,+BAvChBggI,GAAiBA,EAAcr4F,SACjCmI,GAAe,KACbhG,EAAG,KAAMk2F,MA4KU,oBAATzoF,MA1KI4nF,aA0KmC5nF,KAzKnDwnF,EAAaI,GAAW,CAACr0H,EAAKo1H,KAC5B,GAAIp1H,EAAK,OAAOg/B,EAAG,IAAI9pC,MAAM,0BAA0B8K,EAAIG,YAC3Dg1H,EAAaC,MAES,mBAAR//H,GAAsB,WAAWiI,KAAK+2H,IAEtDn/F,EAAOz5B,OAAO+iB,OAAO,CACnBisB,IAAK4pF,EACLzqF,QAAS,IACTwtE,QAAS,CAAE,aAAc,uCACxBliF,GACH7/B,EAAImE,OAAO07B,GAAM,CAACl1B,EAAKvH,EAAK28H,KAC1B,GAAIp1H,EAAK,OAAOg/B,EAAG,IAAI9pC,MAAM,8BAA8B8K,EAAIG,YAC/Dg1H,EAAaC,OAEiB,mBAAhBlB,EAAGmB,UAAgD,iBAAdhB,EAErDH,EAAGmB,SAAShB,GAAW,CAACr0H,EAAKo1H,KAC3B,GAAIp1H,EAAK,OAAOg/B,EAAG,IAAI9pC,MAAM,+BAC7BigI,EAAaC,MAGfpwF,GAAe,KACbhG,EAAG,IAAI9pC,MAAM,mCAtFnBR,EAAOC,QAAQ2gI,YAAcnB,EAAOn9H,OACpCtC,EAAOC,QAAQ4gI,cAiMf,SAA4B/rE,GAC1B,MAAMsS,EAAU,CACdv5B,KAAMinB,EAAOjnB,MA2Bf,OAxBAu5B,EAAQ,kBAAoBtS,EAAOlkB,UAAY,IAAIztC,KAAI4yC,IAChDqxB,EAAQx2B,WAAUw2B,EAAQx2B,SAAWmF,GAEnC,CADPA,EAAMtzC,EAAO2M,KAAK2mC,EAAK,YAIzBqxB,EAAQ,YAActS,EAAOqS,SAAW,QAEjBx9D,IAAnBmrD,EAAO0S,UACTJ,EAAQI,QAAU9mE,OAAOo0D,EAAO0S,UAG9B1S,EAAOirE,UACT34D,EAAQ,iBAAoBtS,EAAOirE,QAAQ/mG,UAAY,IAAQ,GAG7D87B,EAAOyS,YACTH,EAAQ,cAAgBtS,EAAOyS,WAG7BzS,EAAOwS,UACTF,EAAQE,QAAUxS,EAAOwS,SAGpBjoC,EAAQ/8B,OAAO8kE,IA8Bd3kE,EAAO6B,MAAM,8CClPvB,SAASw8H,EAAWx4H,GAClB,GAAoB,iBAATA,EACT,MAAM,IAAI8jB,UAAU,mCAAqCjiB,KAAKC,UAAU9B,IAK5E,SAASy4H,EAAqBz4H,EAAM04H,GAMlC,IALA,IAII9sG,EAJAnwB,EAAM,GACNk9H,EAAoB,EACpBC,GAAa,EACbC,EAAO,EAEFv0H,EAAI,EAAGA,GAAKtE,EAAKzF,SAAU+J,EAAG,CACrC,GAAIA,EAAItE,EAAKzF,OACXqxB,EAAO5rB,EAAKsH,WAAWhD,OACpB,IAAa,KAATsnB,EACP,MAEAA,EAAO,GACT,GAAa,KAATA,EAAmB,CACrB,GAAIgtG,IAAct0H,EAAI,GAAc,IAATu0H,QAEpB,GAAID,IAAct0H,EAAI,GAAc,IAATu0H,EAAY,CAC5C,GAAIp9H,EAAIlB,OAAS,GAA2B,IAAtBo+H,GAA8D,KAAnCl9H,EAAI6L,WAAW7L,EAAIlB,OAAS,IAAsD,KAAnCkB,EAAI6L,WAAW7L,EAAIlB,OAAS,GAC1H,GAAIkB,EAAIlB,OAAS,EAAG,CAClB,IAAIu+H,EAAiBr9H,EAAIswD,YAAY,KACrC,GAAI+sE,IAAmBr9H,EAAIlB,OAAS,EAAG,EACb,IAApBu+H,GACFr9H,EAAM,GACNk9H,EAAoB,GAGpBA,GADAl9H,EAAMA,EAAII,MAAM,EAAGi9H,IACKv+H,OAAS,EAAIkB,EAAIswD,YAAY,KAEvD6sE,EAAYt0H,EACZu0H,EAAO,EACP,eAEG,GAAmB,IAAfp9H,EAAIlB,QAA+B,IAAfkB,EAAIlB,OAAc,CAC/CkB,EAAM,GACNk9H,EAAoB,EACpBC,EAAYt0H,EACZu0H,EAAO,EACP,SAGAH,IACEj9H,EAAIlB,OAAS,EACfkB,GAAO,MAEPA,EAAM,KACRk9H,EAAoB,QAGlBl9H,EAAIlB,OAAS,EACfkB,GAAO,IAAMuE,EAAKnE,MAAM+8H,EAAY,EAAGt0H,GAEvC7I,EAAMuE,EAAKnE,MAAM+8H,EAAY,EAAGt0H,GAClCq0H,EAAoBr0H,EAAIs0H,EAAY,EAEtCA,EAAYt0H,EACZu0H,EAAO,OACW,KAATjtG,IAA+B,IAAVitG,IAC5BA,EAEFA,GAAQ,EAGZ,OAAOp9H,EAeT,IAAIs9H,EAAQ,CAEVr0G,QAAS,WAKP,IAJA,IAEIs0G,EAFAC,EAAe,GACfC,GAAmB,EAGd50H,EAAIpG,UAAU3D,OAAS,EAAG+J,IAAM,IAAM40H,EAAkB50H,IAAK,CACpE,IAAItE,EACAsE,GAAK,EACPtE,EAAO9B,UAAUoG,SAELjD,IAAR23H,IACFA,EAAMl2G,EAAQk2G,OAChBh5H,EAAOg5H,GAGTR,EAAWx4H,GAGS,IAAhBA,EAAKzF,SAIT0+H,EAAej5H,EAAO,IAAMi5H,EAC5BC,EAA0C,KAAvBl5H,EAAKsH,WAAW,IASrC,OAFA2xH,EAAeR,EAAqBQ,GAAeC,GAE/CA,EACED,EAAa1+H,OAAS,EACjB,IAAM0+H,EAEN,IACAA,EAAa1+H,OAAS,EACxB0+H,EAEA,KAIXn1C,UAAW,SAAmB9jF,GAG5B,GAFAw4H,EAAWx4H,GAES,IAAhBA,EAAKzF,OAAc,MAAO,IAE9B,IAAI4+H,EAAoC,KAAvBn5H,EAAKsH,WAAW,GAC7B8xH,EAAyD,KAArCp5H,EAAKsH,WAAWtH,EAAKzF,OAAS,GAQtD,OAHoB,KAFpByF,EAAOy4H,EAAqBz4H,GAAOm5H,IAE1B5+H,QAAiB4+H,IAAYn5H,EAAO,KACzCA,EAAKzF,OAAS,GAAK6+H,IAAmBp5H,GAAQ,KAE9Cm5H,EAAmB,IAAMn5H,EACtBA,GAGTm5H,WAAY,SAAoBn5H,GAE9B,OADAw4H,EAAWx4H,GACJA,EAAKzF,OAAS,GAA4B,KAAvByF,EAAKsH,WAAW,IAG5CxL,KAAM,WACJ,GAAyB,IAArBoC,UAAU3D,OACZ,MAAO,IAET,IADA,IAAI8+H,EACK/0H,EAAI,EAAGA,EAAIpG,UAAU3D,SAAU+J,EAAG,CACzC,IAAI9F,EAAMN,UAAUoG,GACpBk0H,EAAWh6H,GACPA,EAAIjE,OAAS,SACA8G,IAAXg4H,EACFA,EAAS76H,EAET66H,GAAU,IAAM76H,GAGtB,YAAe6C,IAAXg4H,EACK,IACFN,EAAMj1C,UAAUu1C,IAGzBh0H,SAAU,SAAkByB,EAAM4qF,GAIhC,GAHA8mC,EAAW1xH,GACX0xH,EAAW9mC,GAEP5qF,IAAS4qF,EAAI,MAAO,GAKxB,IAHA5qF,EAAOiyH,EAAMr0G,QAAQ5d,OACrB4qF,EAAKqnC,EAAMr0G,QAAQgtE,IAEF,MAAO,GAIxB,IADA,IAAI4nC,EAAY,EACTA,EAAYxyH,EAAKvM,QACa,KAA/BuM,EAAKQ,WAAWgyH,KADYA,GASlC,IALA,IAAIC,EAAUzyH,EAAKvM,OACfi/H,EAAUD,EAAUD,EAGpBG,EAAU,EACPA,EAAU/nC,EAAGn3F,QACa,KAA3Bm3F,EAAGpqF,WAAWmyH,KADUA,GAW9B,IAPA,IACIC,EADQhoC,EAAGn3F,OACKk/H,EAGhBl/H,EAASi/H,EAAUE,EAAQF,EAAUE,EACrCC,GAAiB,EACjBr1H,EAAI,EACDA,GAAK/J,IAAU+J,EAAG,CACvB,GAAIA,IAAM/J,EAAQ,CAChB,GAAIm/H,EAAQn/H,EAAQ,CAClB,GAAmC,KAA/Bm3F,EAAGpqF,WAAWmyH,EAAUn1H,GAG1B,OAAOotF,EAAG71F,MAAM49H,EAAUn1H,EAAI,GACzB,GAAU,IAANA,EAGT,OAAOotF,EAAG71F,MAAM49H,EAAUn1H,QAEnBk1H,EAAUj/H,IACoB,KAAnCuM,EAAKQ,WAAWgyH,EAAYh1H,GAG9Bq1H,EAAgBr1H,EACD,IAANA,IAGTq1H,EAAgB,IAGpB,MAEF,IAAIC,EAAW9yH,EAAKQ,WAAWgyH,EAAYh1H,GAE3C,GAAIs1H,IADSloC,EAAGpqF,WAAWmyH,EAAUn1H,GAEnC,MACoB,KAAbs1H,IACPD,EAAgBr1H,GAGpB,IAAIvI,EAAM,GAGV,IAAKuI,EAAIg1H,EAAYK,EAAgB,EAAGr1H,GAAKi1H,IAAWj1H,EAClDA,IAAMi1H,GAAkC,KAAvBzyH,EAAKQ,WAAWhD,KAChB,IAAfvI,EAAIxB,OACNwB,GAAO,KAEPA,GAAO,OAMb,OAAIA,EAAIxB,OAAS,EACRwB,EAAM21F,EAAG71F,MAAM49H,EAAUE,IAEhCF,GAAWE,EACoB,KAA3BjoC,EAAGpqF,WAAWmyH,MACdA,EACG/nC,EAAG71F,MAAM49H,KAIpBI,UAAW,SAAmB75H,GAC5B,OAAOA,GAGT85H,QAAS,SAAiB95H,GAExB,GADAw4H,EAAWx4H,GACS,IAAhBA,EAAKzF,OAAc,MAAO,IAK9B,IAJA,IAAIqxB,EAAO5rB,EAAKsH,WAAW,GACvByyH,EAAmB,KAATnuG,EACVjlB,GAAO,EACPqzH,GAAe,EACV11H,EAAItE,EAAKzF,OAAS,EAAG+J,GAAK,IAAKA,EAEtC,GAAa,MADbsnB,EAAO5rB,EAAKsH,WAAWhD,KAEnB,IAAK01H,EAAc,CACjBrzH,EAAMrC,EACN,YAIJ01H,GAAe,EAInB,OAAa,IAATrzH,EAAmBozH,EAAU,IAAM,IACnCA,GAAmB,IAARpzH,EAAkB,KAC1B3G,EAAKnE,MAAM,EAAG8K,IAGvB82D,SAAU,SAAkBz9D,EAAM8+B,GAChC,QAAYz9B,IAARy9B,GAAoC,iBAARA,EAAkB,MAAM,IAAIhb,UAAU,mCACtE00G,EAAWx4H,GAEX,IAGIsE,EAHAxE,EAAQ,EACR6G,GAAO,EACPqzH,GAAe,EAGnB,QAAY34H,IAARy9B,GAAqBA,EAAIvkC,OAAS,GAAKukC,EAAIvkC,QAAUyF,EAAKzF,OAAQ,CACpE,GAAIukC,EAAIvkC,SAAWyF,EAAKzF,QAAUukC,IAAQ9+B,EAAM,MAAO,GACvD,IAAIi6H,EAASn7F,EAAIvkC,OAAS,EACtB2/H,GAAoB,EACxB,IAAK51H,EAAItE,EAAKzF,OAAS,EAAG+J,GAAK,IAAKA,EAAG,CACrC,IAAIsnB,EAAO5rB,EAAKsH,WAAWhD,GAC3B,GAAa,KAATsnB,GAGA,IAAKouG,EAAc,CACjBl6H,EAAQwE,EAAI,EACZ,YAGsB,IAAtB41H,IAGFF,GAAe,EACfE,EAAmB51H,EAAI,GAErB21H,GAAU,IAERruG,IAASkT,EAAIx3B,WAAW2yH,IACR,KAAZA,IAGJtzH,EAAMrC,IAKR21H,GAAU,EACVtzH,EAAMuzH,IAOd,OADIp6H,IAAU6G,EAAKA,EAAMuzH,GAAmC,IAATvzH,IAAYA,EAAM3G,EAAKzF,QACnEyF,EAAKnE,MAAMiE,EAAO6G,GAEzB,IAAKrC,EAAItE,EAAKzF,OAAS,EAAG+J,GAAK,IAAKA,EAClC,GAA2B,KAAvBtE,EAAKsH,WAAWhD,IAGhB,IAAK01H,EAAc,CACjBl6H,EAAQwE,EAAI,EACZ,YAEgB,IAATqC,IAGXqzH,GAAe,EACfrzH,EAAMrC,EAAI,GAId,OAAa,IAATqC,EAAmB,GAChB3G,EAAKnE,MAAMiE,EAAO6G,IAI7BwzH,QAAS,SAAiBn6H,GACxBw4H,EAAWx4H,GAQX,IAPA,IAAIo6H,GAAY,EACZC,EAAY,EACZ1zH,GAAO,EACPqzH,GAAe,EAGfM,EAAc,EACTh2H,EAAItE,EAAKzF,OAAS,EAAG+J,GAAK,IAAKA,EAAG,CACzC,IAAIsnB,EAAO5rB,EAAKsH,WAAWhD,GAC3B,GAAa,KAATsnB,GASS,IAATjlB,IAGFqzH,GAAe,EACfrzH,EAAMrC,EAAI,GAEC,KAATsnB,GAEkB,IAAdwuG,EACFA,EAAW91H,EACY,IAAhBg2H,IACPA,EAAc,IACK,IAAdF,IAGTE,GAAe,QArBb,IAAKN,EAAc,CACjBK,EAAY/1H,EAAI,EAChB,OAuBR,OAAkB,IAAd81H,IAA4B,IAATzzH,GAEH,IAAhB2zH,GAEgB,IAAhBA,GAAqBF,IAAazzH,EAAM,GAAKyzH,IAAaC,EAAY,EACjE,GAEFr6H,EAAKnE,MAAMu+H,EAAUzzH,IAG9BgyD,OAAQ,SAAgB4hE,GACtB,GAAmB,OAAfA,GAA6C,iBAAfA,EAChC,MAAM,IAAIz2G,UAAU,0EAA4Ey2G,GAElG,OAvVJ,SAAiB7kG,EAAK6kG,GACpB,IAAI1uE,EAAM0uE,EAAW1uE,KAAO0uE,EAAWzM,KACnCr1H,EAAO8hI,EAAW9hI,OAAS8hI,EAAWxhI,MAAQ,KAAOwhI,EAAWz7F,KAAO,IAC3E,OAAK+sB,EAGDA,IAAQ0uE,EAAWzM,KACdjiE,EAAMpzD,EAERozD,EA8UU,IA9UEpzD,EALVA,EAmVA+hI,CAAQ,EAAKD,IAGtB9iG,MAAO,SAAez3B,GACpBw4H,EAAWx4H,GAEX,IAAI4M,EAAM,CAAEkhH,KAAM,GAAIjiE,IAAK,GAAIpzD,KAAM,GAAIqmC,IAAK,GAAI/lC,KAAM,IACxD,GAAoB,IAAhBiH,EAAKzF,OAAc,OAAOqS,EAC9B,IAEI9M,EAFA8rB,EAAO5rB,EAAKsH,WAAW,GACvB6xH,EAAsB,KAATvtG,EAEbutG,GACFvsH,EAAIkhH,KAAO,IACXhuH,EAAQ,GAERA,EAAQ,EAaV,IAXA,IAAIs6H,GAAY,EACZC,EAAY,EACZ1zH,GAAO,EACPqzH,GAAe,EACf11H,EAAItE,EAAKzF,OAAS,EAIlB+/H,EAAc,EAGXh2H,GAAKxE,IAASwE,EAEnB,GAAa,MADbsnB,EAAO5rB,EAAKsH,WAAWhD,KAUV,IAATqC,IAGFqzH,GAAe,EACfrzH,EAAMrC,EAAI,GAEC,KAATsnB,GAEkB,IAAdwuG,EAAiBA,EAAW91H,EAA2B,IAAhBg2H,IAAmBA,EAAc,IACrD,IAAdF,IAGXE,GAAe,QAlBb,IAAKN,EAAc,CACjBK,EAAY/1H,EAAI,EAChB,MAyCR,OArBkB,IAAd81H,IAA4B,IAATzzH,GAEP,IAAhB2zH,GAEgB,IAAhBA,GAAqBF,IAAazzH,EAAM,GAAKyzH,IAAaC,EAAY,GACvD,IAAT1zH,IACiCiG,EAAInU,KAAOmU,EAAI7T,KAAhC,IAAdshI,GAAmBlB,EAAkCn5H,EAAKnE,MAAM,EAAG8K,GAAgC3G,EAAKnE,MAAMw+H,EAAW1zH,KAG7G,IAAd0zH,GAAmBlB,GACrBvsH,EAAI7T,KAAOiH,EAAKnE,MAAM,EAAGu+H,GACzBxtH,EAAInU,KAAOuH,EAAKnE,MAAM,EAAG8K,KAEzBiG,EAAI7T,KAAOiH,EAAKnE,MAAMw+H,EAAWD,GACjCxtH,EAAInU,KAAOuH,EAAKnE,MAAMw+H,EAAW1zH,IAEnCiG,EAAIkyB,IAAM9+B,EAAKnE,MAAMu+H,EAAUzzH,IAG7B0zH,EAAY,EAAGztH,EAAIi/C,IAAM7rD,EAAKnE,MAAM,EAAGw+H,EAAY,GAAYlB,IAAYvsH,EAAIi/C,IAAM,KAElFj/C,GAGT8oB,IAAK,IACLuuC,UAAW,IACXw2D,MAAO,KACP1B,MAAO,MAGTA,EAAMA,MAAQA,EAEdrhI,EAAOC,QAAUohI,kBChhBjBphI,EAAQipE,OAAS,EAAjB,MACAjpE,EAAQkpE,WAAa,EAArB,sBCDA,IAOI65D,EAkCAt4E,EAzCAjoD,EAAS,eAETwgI,EAAkB,EAAQ,MAC1BC,EAAkB,EAAQ,MAC1B56F,EAAO,EAAQ,MACflzB,EAAW,EAAQ,MAGnB+tH,EAAS,EAAA5/G,EAAOwd,QAAU,EAAAxd,EAAOwd,OAAOoiG,OACxCC,EAAY,CACdn/D,IAAK,QACL,QAAS,QACT/iC,KAAM,QACNiyD,OAAQ,UACR,UAAW,UACXC,OAAQ,UACR,UAAW,UACX,UAAW,UACXC,OAAQ,WAENgwC,EAAS,GAsBb,SAASC,IACP,OAAI54E,IAIFA,EADE,EAAAnnC,EAAO6H,SAAW,EAAA7H,EAAO6H,QAAQs/B,SACxB,EAAAnnC,EAAO6H,QAAQs/B,SACjB,EAAAnnC,EAAO+sB,eACL,EAAA/sB,EAAO+sB,eACT,EAAA/sB,EAAOggH,aACL,EAAAhgH,EAAOggH,aAEP,EAAAhgH,EAAOmjB,YAItB,SAAS88F,EAAejjF,EAAU88C,EAAMomC,EAAY5gI,EAAQkjD,GAC1D,OAAOo9E,EAAOO,UACZ,MAAOnjF,EAAU,CAAEl/C,KAAM,WAAY,EAAO,CAAC,eAC7CsrB,MAAK,SAAU/mB,GACf,OAAOu9H,EAAOQ,WAAW,CACvBtiI,KAAM,SACNg8F,KAAMA,EACNomC,WAAYA,EACZx+E,KAAM,CACJ5jD,KAAM0kD,IAEPngD,EAAK/C,GAAU,MACjB8pB,MAAK,SAAU5oB,GAChB,OAAOtB,EAAO2M,KAAKrL,MAevB/D,EAAOC,QAAU,SAAUsgD,EAAU88C,EAAMomC,EAAYpE,EAAQ75E,EAAQnjB,GAC/C,mBAAXmjB,IACTnjB,EAAWmjB,EACXA,OAAS77C,GAIX,IAAIo8C,EAAOq9E,GADX59E,EAASA,GAAU,QACSpc,eAE5B,GAAK2c,GAAkC,mBAAnB,EAAAxiC,EAAOwJ,QAA3B,CAgBA,GAHAk2G,EAAgBQ,EAAYpE,GAC5B9+E,EAAWnrC,EAASmrC,EAAU2iF,EAAiB,YAC/C7lC,EAAOjoF,EAASioF,EAAM6lC,EAAiB,QACf,mBAAb7gG,EAAyB,MAAM,IAAI7hC,MAAM,mCApCtD,SAAyBguG,EAASnsE,GAChCmsE,EAAQ7hF,MAAK,SAAUtoB,GACrBi/H,GAAAA,EAAc,WACZjhG,EAAS,KAAMh+B,SAEhB,SAAU4D,GACXq7H,GAAAA,EAAc,WACZjhG,EAASp6B,SA+Bb27H,CA3FF,SAAsB79E,GACpB,GAAI,EAAAxiC,EAAO6H,UAAY,EAAA7H,EAAO6H,QAAQylB,QACpC,OAAO9jB,QAAQC,SAAQ,GAEzB,IAAKm2G,IAAWA,EAAOO,YAAcP,EAAOQ,WAC1C,OAAO52G,QAAQC,SAAQ,GAEzB,QAAqBrjB,IAAjB05H,EAAOt9E,GACT,OAAOs9E,EAAOt9E,GAGhB,IAAI89E,EAAOL,EADXR,EAAWA,GAAYvgI,EAAO6B,MAAM,GACD0+H,EAAU,GAAI,IAAKj9E,GACnDp5B,MAAK,WACJ,OAAO,KACNC,OAAM,WACP,OAAO,KAGX,OADAy2G,EAAOt9E,GAAQ89E,EACRA,EAyEQC,CAAY/9E,GAAMp5B,MAAK,SAAUo3G,GAC9C,OAAIA,EAAaP,EAAcjjF,EAAU88C,EAAMomC,EAAYpE,EAAQt5E,GAE5Dzd,EAAKiY,EAAU88C,EAAMomC,EAAYpE,EAAQ75E,MAC9CnjB,QArBFihG,GAAAA,EAAc,WACZ,IAAIj/H,EACJ,IACEA,EAAMikC,EAAKiY,EAAU88C,EAAMomC,EAAYpE,EAAQ75E,GAC/C,MAAOv9C,GACP,OAAOo6B,EAASp6B,GAElBo6B,EAAS,KAAMh+B,2BCtGjB6+H,YAGFA,EADE,EAAA3/G,EAAO6H,SAAW,EAAA7H,EAAO6H,QAAQylB,QACjB,QACT,EAAAttB,EAAO6H,SAAW,EAAA7H,EAAO6H,QAAQy8D,QACtBhoD,SAASzU,EAAQy8D,QAAQh5E,MAAM,KAAK,GAAG1K,MAAM,GAAI,KAElC,EAAI,QAAU,SAE/B,QAEpBnE,EAAOC,QAAUijI,YCXjB,IAAIc,EAAY3xH,KAAKoB,IAAI,EAAG,IAAM,EAElCzT,EAAOC,QAAU,SAAUwjI,EAAYpE,GACrC,GAA0B,iBAAfoE,EACT,MAAM,IAAIr3G,UAAU,2BAGtB,GAAIq3G,EAAa,EACf,MAAM,IAAIr3G,UAAU,kBAGtB,GAAsB,iBAAXizG,EACT,MAAM,IAAIjzG,UAAU,2BAGtB,GAAIizG,EAAS,GAAKA,EAAS2E,GAAa3E,GAAWA,EACjD,MAAM,IAAIjzG,UAAU,mCChBxB,IAAIi4C,EAAM,EAAQ,MACdL,EAAY,EAAQ,MACpBC,EAAM,EAAQ,MACdxhE,EAAS,eAETwgI,EAAkB,EAAQ,MAC1BC,EAAkB,EAAQ,MAC1B9tH,EAAW,EAAQ,MAEnBkvD,EAAQ7hE,EAAO6B,MAAM,KACrB2/H,EAAQ,CACV5/D,IAAK,GACLnjC,KAAM,GACNgjE,OAAQ,GACR/Q,OAAQ,GACRC,OAAQ,GACRC,OAAQ,GACR6wC,OAAQ,GACR//B,UAAW,IAGb,SAAS5/B,EAAMJ,EAAKv+D,EAAKu+H,GACvB,IAAIl/E,EAkCN,SAAoBkf,GAQlB,MAAY,WAARA,GAA4B,cAARA,EAJxB,SAAqBhiE,GACnB,OAAO,IAAI6hE,GAAYrxB,OAAOxwC,GAAMqjD,UAI1B,QAAR2e,EAAsBE,EAR1B,SAAkBliE,GAChB,OAAO8hE,EAAIE,GAAKxxB,OAAOxwC,GAAMqjD,UApCpB4+E,CAAUjgE,GACjBK,EAAqB,WAARL,GAA4B,WAARA,EAAoB,IAAM,GAE3Dv+D,EAAI/C,OAAS2hE,EACf5+D,EAAMq/C,EAAKr/C,GACFA,EAAI/C,OAAS2hE,IACtB5+D,EAAMnD,EAAOqC,OAAO,CAACc,EAAK0+D,GAAQE,IAKpC,IAFA,IAAIE,EAAOjiE,EAAOkpC,YAAY64B,EAAYy/D,EAAM9/D,IAC5CS,EAAOniE,EAAOkpC,YAAY64B,EAAYy/D,EAAM9/D,IACvCv3D,EAAI,EAAGA,EAAI43D,EAAW53D,IAC7B83D,EAAK93D,GAAc,GAAThH,EAAIgH,GACdg4D,EAAKh4D,GAAc,GAAThH,EAAIgH,GAGhB,IAAIy3H,EAAQ5hI,EAAOkpC,YAAY64B,EAAY2/D,EAAU,GACrDz/D,EAAKjgE,KAAK4/H,EAAO,EAAG,EAAG7/D,GACvBjjE,KAAK8iI,MAAQA,EACb9iI,KAAK+iI,MAAQ5/D,EACbnjE,KAAKqjE,KAAOA,EACZrjE,KAAK4iE,IAAMA,EACX5iE,KAAKijE,UAAYA,EACjBjjE,KAAK0jD,KAAOA,EACZ1jD,KAAKpB,KAAO8jI,EAAM9/D,GAGpBI,EAAK/iE,UAAU+iI,IAAM,SAAUpiI,EAAMuiE,GAInC,OAHAviE,EAAKsC,KAAKigE,EAAMnjE,KAAKijE,WACbjjE,KAAK0jD,KAAKyf,GAChBjgE,KAAKlD,KAAKqjE,KAAMrjE,KAAKijE,WAChBjjE,KAAK0jD,KAAK1jD,KAAKqjE,OAmDxB5kE,EAAOC,QAnCP,SAAiBsgD,EAAU88C,EAAMomC,EAAYpE,EAAQ75E,GACnDy9E,EAAgBQ,EAAYpE,GAM5B,IAAIp7B,EAAO,IAAI1/B,EAFf/e,EAASA,GAAU,OAHnBjF,EAAWnrC,EAASmrC,EAAU2iF,EAAiB,aAC/C7lC,EAAOjoF,EAASioF,EAAM6lC,EAAiB,SAIIrgI,QAEvC2hI,EAAK/hI,EAAOkpC,YAAY0zF,GACxBoF,EAAShiI,EAAOkpC,YAAY0xD,EAAKx6F,OAAS,GAC9Cw6F,EAAK54F,KAAKggI,EAAQ,EAAG,EAAGpnC,EAAKx6F,QAM7B,IAJA,IAAI6hI,EAAU,EACVC,EAAOV,EAAMz+E,GACbxnC,EAAI3L,KAAKS,KAAKusH,EAASsF,GAElB/3H,EAAI,EAAGA,GAAKoR,EAAGpR,IAAK,CAC3B63H,EAAO74F,cAAch/B,EAAGywF,EAAKx6F,QAK7B,IAHA,IAAI4iG,EAAIxB,EAAKsgC,IAAIE,EAAQxgC,EAAKogC,OAC1BO,EAAIn/B,EAEC54F,EAAI,EAAGA,EAAI42H,EAAY52H,IAAK,CACnC+3H,EAAI3gC,EAAKsgC,IAAIK,EAAG3gC,EAAKqgC,OACrB,IAAK,IAAI/vH,EAAI,EAAGA,EAAIowH,EAAMpwH,IAAKkxF,EAAElxF,IAAMqwH,EAAErwH,GAG3CkxF,EAAEhhG,KAAK+/H,EAAIE,GACXA,GAAWC,EAGb,OAAOH,mBCrGT,IAAI/hI,EAAS,eAEbzC,EAAOC,QAAU,SAAUs1B,EAAOgI,EAAUl8B,GAC1C,GAAIoB,EAAOE,SAAS4yB,GAClB,OAAOA,EACF,GAAqB,iBAAVA,EAChB,OAAO9yB,EAAO2M,KAAKmmB,EAAOgI,GACrB,GAAIgC,YAAYC,OAAOjK,GAC5B,OAAO9yB,EAAO2M,KAAKmmB,EAAMzoB,QAEzB,MAAM,IAAIsf,UAAU/qB,EAAO,uECV/BrB,EAAOC,QAEP,SAAiBgE,GACf,OAAOoO,KAAKC,IAAI,MAAO,GAAKD,KAAKw0E,KAAK5iF,EAAQ,KAAO,EAAIA,EAAQ,MAAQ,GAAM,cCHjF,MAAMmnB,EAAUprB,EAAOC,QAAU,GASjC,SAASqnC,KAPTlc,EAAQy5G,MAAQ,UAChBz5G,EAAQylB,SAAU,EAClBzlB,EAAQ0/C,IAAM,GACd1/C,EAAQ05G,KAAO,GACf15G,EAAQy8D,QAAU,GAClBz8D,EAAQ25G,SAAW,GAInB35G,EAAQ6a,GAAKqB,EACblc,EAAQyxE,YAAcv1D,EACtBlc,EAAQ2a,KAAOuB,EACflc,EAAQpY,IAAMs0B,EACdlc,EAAQwpB,eAAiBtN,EACzBlc,EAAQ8xE,mBAAqB51D,EAC7Blc,EAAQ4b,KAAOM,EACflc,EAAQ0xE,gBAAkBx1D,EAC1Blc,EAAQ2xE,oBAAsBz1D,EAE9Blc,EAAQs/B,SAAW,CAACgT,KAASt4D,IAASwM,OAAO0+B,gBAAe,IAAMotB,KAAQt4D,KAE1EgmB,EAAQwxE,UAAav7F,GAAS,GAE9B+pB,EAAQk2G,IAAM,IAAM,IACpBl2G,EAAQ45G,MAAQ,IAAM,EACtB55G,EAAQihC,QAAWhrD,IAAW,MAAM,IAAIb,MAAM,qCAC9C4qB,EAAQ65G,MAAS9wE,IAAU,MAAM,IAAI3zD,MAAM,mDC5B3CP,EAAQypE,cAAgB,EAAxB,MACAzpE,EAAQ4pE,eAAiB,EAAzB,MAEA5pE,EAAQ0pE,eAAiB,SAAyB/jE,EAAK2G,GACrD,OAAOtM,EAAQypE,cAAc9jE,EAAK2G,GAAK,IAGzCtM,EAAQ2pE,cAAgB,SAAwBhkE,EAAK2G,GACnD,OAAOtM,EAAQ4pE,eAAejkE,EAAK2G,GAAK,oBCR1C,IAAIm4C,EAAa,EAAQ,MACrBjiD,EAAS,eAab,SAASyiI,EAAOnzH,GACd,IAAI1N,EAAM5B,EAAOkpC,YAAY,GAE7B,OADAtnC,EAAIunC,cAAc75B,EAAG,GACd1N,EAdTrE,EAAOC,QAAU,SAAUorG,EAAM1+F,GAI/B,IAHA,IAEIoF,EAFA+D,EAAIrT,EAAO6B,MAAM,GACjBsI,EAAI,EAEDkJ,EAAEjT,OAAS8J,GAChBoF,EAAImzH,EAAMt4H,KACVkJ,EAAIrT,EAAOqC,OAAO,CAACgR,EAAG4uC,EAAW,QAAQ/R,OAAO04D,GAAM14D,OAAO5gC,GAAGyzC,WAElE,OAAO1vC,EAAE3R,MAAM,EAAGwI,2BCXpB,SAAW3M,EAAQC,GACjB,aAGA,SAAS0E,EAAQuC,EAAK8D,GACpB,IAAK9D,EAAK,MAAM,IAAI1G,MAAMwK,GAAO,oBAKnC,SAAS7J,EAAU6P,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAS3P,UAAYyP,EAAUzP,UAC/BwP,EAAKxP,UAAY,IAAI2P,EACrBH,EAAKxP,UAAUgC,YAAcwN,EAK/B,SAASI,EAAIC,EAAQtQ,EAAMuQ,GACzB,GAAIF,EAAGG,KAAKF,GACV,OAAOA,EAGT9P,KAAKiQ,SAAW,EAChBjQ,KAAKkQ,MAAQ,KACblQ,KAAKsB,OAAS,EAGdtB,KAAKmQ,IAAM,KAEI,OAAXL,IACW,OAATtQ,GAA0B,OAATA,IACnBuQ,EAASvQ,EACTA,EAAO,IAGTQ,KAAKkF,MAAM4K,GAAU,EAAGtQ,GAAQ,GAAIuQ,GAAU,OAYlD,IAAI7O,EATkB,iBAAXzC,EACTA,EAAOC,QAAUmR,EAEjBnR,EAAQmR,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGO,SAAW,GAGd,IAEIlP,EADoB,oBAAXmP,aAAmD,IAAlBA,OAAOnP,OACxCmP,OAAOnP,OAEP,eAEX,MAAOwF,IAgIT,SAAS4J,EAAeC,EAAQ3G,GAC9B,IAAI4G,EAAID,EAAOlC,WAAWzE,GAE1B,OAAI4G,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,GAGHA,EAAI,GAAM,GAItB,SAASC,EAAcF,EAAQG,EAAY9G,GACzC,IAAI+G,EAAIL,EAAcC,EAAQ3G,GAI9B,OAHIA,EAAQ,GAAK8G,IACfC,GAAKL,EAAcC,EAAQ3G,EAAQ,IAAM,GAEpC+G,EA8CT,SAASC,EAAWvH,EAAKxC,EAAO6G,EAAKmD,GAGnC,IAFA,IAAIF,EAAI,EACJvF,EAAM0F,KAAK/D,IAAI1D,EAAI/H,OAAQoM,GACtBrC,EAAIxE,EAAOwE,EAAID,EAAKC,IAAK,CAChC,IAAImF,EAAInH,EAAIgF,WAAWhD,GAAK,GAE5BsF,GAAKE,EAIHF,GADEH,GAAK,GACFA,EAAI,GAAK,GAGLA,GAAK,GACTA,EAAI,GAAK,GAITA,EAGT,OAAOG,EAnNTd,EAAGG,KAAO,SAAepK,GACvB,OAAIA,aAAeiK,GAIJ,OAARjK,GAA+B,iBAARA,GAC5BA,EAAI3D,YAAYmO,WAAaP,EAAGO,UAAY1O,MAAMC,QAAQiE,EAAIsK,QAGlEL,EAAGkB,IAAM,SAAcC,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG9C,IAAM,SAAciE,EAAMC,GAC3B,OAAID,EAAKE,IAAID,GAAS,EAAUD,EACzBC,GAGTpB,EAAG5P,UAAUiF,MAAQ,SAAe4K,EAAQtQ,EAAMuQ,GAChD,GAAsB,iBAAXD,EACT,OAAO9P,KAAKmR,YAAYrB,EAAQtQ,EAAMuQ,GAGxC,GAAsB,iBAAXD,EACT,OAAO9P,KAAKoR,WAAWtB,EAAQtQ,EAAMuQ,GAG1B,QAATvQ,IACFA,EAAO,IAET4D,EAAO5D,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAIqH,EAAQ,EACM,OAFlBiJ,EAASA,EAAO7D,WAAW2B,QAAQ,OAAQ,KAEhC,KACT/G,IACA7G,KAAKiQ,SAAW,GAGdpJ,EAAQiJ,EAAOxO,SACJ,KAAT9B,EACFQ,KAAKqR,UAAUvB,EAAQjJ,EAAOkJ,IAE9B/P,KAAKsR,WAAWxB,EAAQtQ,EAAMqH,GACf,OAAXkJ,GACF/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,MAM9CF,EAAG5P,UAAUkR,YAAc,SAAsBrB,EAAQtQ,EAAMuQ,GACzDD,EAAS,IACX9P,KAAKiQ,SAAW,EAChBH,GAAUA,GAERA,EAAS,UACX9P,KAAKkQ,MAAQ,CAAW,SAATJ,GACf9P,KAAKsB,OAAS,GACLwO,EAAS,kBAClB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,UAEzB9P,KAAKsB,OAAS,IAEd8B,EAAO0M,EAAS,kBAChB9P,KAAKkQ,MAAQ,CACF,SAATJ,EACCA,EAAS,SAAa,SACvB,GAEF9P,KAAKsB,OAAS,GAGD,OAAXyO,GAGJ/P,KAAKoR,WAAWpR,KAAKkP,UAAW1P,EAAMuQ,IAGxCF,EAAG5P,UAAUmR,WAAa,SAAqBtB,EAAQtQ,EAAMuQ,GAG3D,GADA3M,EAAgC,iBAAlB0M,EAAOxO,QACjBwO,EAAOxO,QAAU,EAGnB,OAFAtB,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EACPtB,KAGTA,KAAKsB,OAASwP,KAAKS,KAAKzB,EAAOxO,OAAS,GACxCtB,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAGlB,IAAIC,EAAGkG,EACHC,EAAM,EACV,GAAe,OAAX1B,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAGgK,EAAI,EAAGD,GAAK,EAAGA,GAAK,EAC9CmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,UAGC,GAAe,OAAXyE,EACT,IAAK1E,EAAI,EAAGC,EAAI,EAAGD,EAAIyE,EAAOxO,OAAQ+J,GAAK,EACzCmG,EAAI1B,EAAOzE,GAAMyE,EAAOzE,EAAI,IAAM,EAAMyE,EAAOzE,EAAI,IAAM,GACzDrL,KAAKkQ,MAAM5E,IAAOkG,GAAKC,EAAO,SAC9BzR,KAAKkQ,MAAM5E,EAAI,GAAMkG,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPnG,KAIN,OAAOtL,KAAK0R,SAyBd7B,EAAG5P,UAAUoR,UAAY,SAAoBvB,EAAQjJ,EAAOkJ,GAE1D/P,KAAKsB,OAASwP,KAAKS,MAAMzB,EAAOxO,OAASuF,GAAS,GAClD7G,KAAKkQ,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/BrL,KAAKkQ,MAAM7E,GAAK,EAIlB,IAGImG,EAHAC,EAAM,EACNnG,EAAI,EAGR,GAAe,OAAXyE,EACF,IAAK1E,EAAIyE,EAAOxO,OAAS,EAAG+J,GAAKxE,EAAOwE,GAAK,EAC3CmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,OAKX,IAAKpG,GADayE,EAAOxO,OAASuF,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOwE,EAAIyE,EAAOxO,OAAQ+J,GAAK,EAC1EmG,EAAIf,EAAaX,EAAQjJ,EAAOwE,IAAMoG,EACtCzR,KAAKkQ,MAAM5E,IAAU,SAAJkG,EACbC,GAAO,IACTA,GAAO,GACPnG,GAAK,EACLtL,KAAKkQ,MAAM5E,IAAMkG,IAAM,IAEvBC,GAAO,EAKbzR,KAAK0R,SA2BP7B,EAAG5P,UAAUqR,WAAa,SAAqBxB,EAAQtQ,EAAMqH,GAE3D7G,KAAKkQ,MAAQ,CAAE,GACflQ,KAAKsB,OAAS,EAGd,IAAK,IAAIqQ,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWpS,EAClEmS,IAEFA,IACAC,EAAWA,EAAUpS,EAAQ,EAO7B,IALA,IAAIqS,EAAQ/B,EAAOxO,OAASuF,EACxBiL,EAAMD,EAAQF,EACdjE,EAAMoD,KAAK/D,IAAI8E,EAAOA,EAAQC,GAAOjL,EAErCkL,EAAO,EACF1G,EAAIxE,EAAOwE,EAAIqC,EAAKrC,GAAKsG,EAChCI,EAAOnB,EAAUd,EAAQzE,EAAGA,EAAIsG,EAASnS,GAEzCQ,KAAKgS,MAAMJ,GACP5R,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB,GAAY,IAARD,EAAW,CACb,IAAII,EAAM,EAGV,IAFAH,EAAOnB,EAAUd,EAAQzE,EAAGyE,EAAOxO,OAAQ9B,GAEtC6L,EAAI,EAAGA,EAAIyG,EAAKzG,IACnB6G,GAAO1S,EAGTQ,KAAKgS,MAAME,GACPlS,KAAKkQ,MAAM,GAAK6B,EAAO,SACzB/R,KAAKkQ,MAAM,IAAM6B,EAEjB/R,KAAKiS,OAAOF,GAIhB/R,KAAK0R,SAGP7B,EAAG5P,UAAUiD,KAAO,SAAeiP,GACjCA,EAAKjC,MAAQ,IAAIxO,MAAM1B,KAAKsB,QAC5B,IAAK,IAAI+J,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC/B8G,EAAKjC,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAE7B8G,EAAK7Q,OAAStB,KAAKsB,OACnB6Q,EAAKlC,SAAWjQ,KAAKiQ,SACrBkC,EAAKhC,IAAMnQ,KAAKmQ,KAGlBN,EAAG5P,UAAU0E,MAAQ,WACnB,IAAIgM,EAAI,IAAId,EAAG,MAEf,OADA7P,KAAKkD,KAAKyN,GACHA,GAGTd,EAAG5P,UAAUmS,QAAU,SAAkBxT,GACvC,KAAOoB,KAAKsB,OAAS1C,GACnBoB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAE9B,OAAOtB,MAIT6P,EAAG5P,UAAUyR,MAAQ,WACnB,KAAO1R,KAAKsB,OAAS,GAAqC,IAAhCtB,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IACjDtB,KAAKsB,SAEP,OAAOtB,KAAKqS,aAGdxC,EAAG5P,UAAUoS,UAAY,WAKvB,OAHoB,IAAhBrS,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,KAClClQ,KAAKiQ,SAAW,GAEXjQ,MAGT6P,EAAG5P,UAAUqS,QAAU,WACrB,OAAQtS,KAAKmQ,IAAM,UAAY,SAAWnQ,KAAKiM,SAAS,IAAM,KAiChE,IAAIsG,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UAsjB9D,SAASC,EAAYC,EAAM/M,EAAK9C,GAC9BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnC,IAAI7E,EAAOuH,EAAKrR,OAASsE,EAAItE,OAAU,EACvCwB,EAAIxB,OAAS8J,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAIwH,EAAoB,EAAhBD,EAAKzC,MAAM,GACf2C,EAAmB,EAAfjN,EAAIsK,MAAM,GACdS,EAAIiC,EAAIC,EAERC,EAAS,SAAJnC,EACLoC,EAASpC,EAAI,SAAa,EAC9B7N,EAAIoN,MAAM,GAAK4C,EAEf,IAAK,IAAIE,EAAI,EAAGA,EAAI5H,EAAK4H,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAK2H,EAAI1H,EAAK,EAIlB2H,IADAtC,GAFAiC,EAAoB,EAAhBD,EAAKzC,MAAM7E,KACfwH,EAAmB,EAAfjN,EAAIsK,MAAM5E,IACF4H,GACG,SAAa,EAC5BA,EAAY,SAAJvC,EAEV7N,EAAIoN,MAAM8C,GAAa,EAARE,EACfH,EAAiB,EAATE,EAQV,OANc,IAAVF,EACFjQ,EAAIoN,MAAM8C,GAAa,EAARD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAzlBb7B,EAAG5P,UAAUgM,SAAW,SAAmBzM,EAAM4T,GAI/C,IAAItQ,EACJ,GAHAsQ,EAAoB,EAAVA,GAAe,EAGZ,MAJb5T,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCsD,EAAM,GAGN,IAFA,IAAI2O,EAAM,EACNsB,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,EAAIxR,KAAKkQ,MAAM7E,GACf0G,GAA+B,UAArBP,GAAKC,EAAOsB,IAAmB9G,SAAS,IAGpDnJ,EADY,IADdiQ,EAASvB,IAAO,GAAKC,EAAQ,WACVpG,IAAMrL,KAAKsB,OAAS,EAC/BiR,EAAM,EAAIR,EAAKzQ,QAAUyQ,EAAOjP,EAEhCiP,EAAOjP,GAEf2O,GAAO,IACI,KACTA,GAAO,GACPpG,KAMJ,IAHc,IAAV0H,IACFjQ,EAAMiQ,EAAM9G,SAAS,IAAMnJ,GAEtBA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGT,GAAItD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI6T,EAAYb,EAAWhT,GAEvB8T,EAAYb,EAAWjT,GAC3BsD,EAAM,GACN,IAAI0N,EAAIxQ,KAAK2E,QAEb,IADA6L,EAAEP,SAAW,GACLO,EAAE+C,UAAU,CAClB,IAAI5C,EAAIH,EAAEgD,KAAKF,GAAWrH,SAASzM,GAMjCsD,GALF0N,EAAIA,EAAEiD,MAAMH,IAELC,SAGC5C,EAAI7N,EAFJyP,EAAMc,EAAY1C,EAAErP,QAAUqP,EAAI7N,EAQ5C,IAHI9C,KAAKuT,WACPzQ,EAAM,IAAMA,GAEPA,EAAIxB,OAAS8R,GAAY,GAC9BtQ,EAAM,IAAMA,EAKd,OAHsB,IAAlB9C,KAAKiQ,WACPnN,EAAM,IAAMA,GAEPA,EAGTM,GAAO,EAAO,oCAGhByM,EAAG5P,UAAUyT,SAAW,WACtB,IAAIC,EAAM3T,KAAKkQ,MAAM,GASrB,OARoB,IAAhBlQ,KAAKsB,OACPqS,GAAuB,SAAhB3T,KAAKkQ,MAAM,GACO,IAAhBlQ,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,GAEzCyD,GAAO,iBAAoC,SAAhB3T,KAAKkQ,MAAM,GAC7BlQ,KAAKsB,OAAS,GACvB8B,GAAO,EAAO,8CAEU,IAAlBpD,KAAKiQ,UAAmB0D,EAAMA,GAGxC9D,EAAG5P,UAAU2T,OAAS,WACpB,OAAO5T,KAAKiM,SAAS,KAGvB4D,EAAG5P,UAAU4T,SAAW,SAAmB9D,EAAQzO,GAEjD,OADA8B,OAAyB,IAAXlC,GACPlB,KAAK8T,YAAY5S,EAAQ6O,EAAQzO,IAG1CuO,EAAG5P,UAAUiP,QAAU,SAAkBa,EAAQzO,GAC/C,OAAOtB,KAAK8T,YAAYpS,MAAOqO,EAAQzO,IAGzCuO,EAAG5P,UAAU6T,YAAc,SAAsBC,EAAWhE,EAAQzO,GAClE,IAAIS,EAAa/B,KAAK+B,aAClBiS,EAAY1S,GAAUwP,KAAKC,IAAI,EAAGhP,GACtCqB,EAAOrB,GAAciS,EAAW,yCAChC5Q,EAAO4Q,EAAY,EAAG,+BAEtBhU,KAAK0R,QACL,IAGImB,EAAGxH,EAHH4I,EAA0B,OAAXlE,EACfvN,EAAM,IAAIuR,EAAUC,GAGpBE,EAAIlU,KAAK2E,QACb,GAAKsP,EAYE,CACL,IAAK5I,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAI6I,GAAKwH,EAGX,KAAOxH,EAAI2I,EAAW3I,IACpB7I,EAAI6I,GAAK,MArBM,CAEjB,IAAKA,EAAI,EAAGA,EAAI2I,EAAYjS,EAAYsJ,IACtC7I,EAAI6I,GAAK,EAGX,IAAKA,EAAI,GAAI6I,EAAEX,SAAUlI,IACvBwH,EAAIqB,EAAEC,MAAM,KACZD,EAAEE,OAAO,GAET5R,EAAIwR,EAAY3I,EAAI,GAAKwH,EAe7B,OAAOrQ,GAGLsO,KAAKuD,MACPxE,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,OAAO,GAAKV,KAAKuD,MAAM7C,IAGzB3B,EAAG5P,UAAUqU,WAAa,SAAqB9C,GAC7C,IAAI+C,EAAI/C,EACJb,EAAI,EAiBR,OAhBI4D,GAAK,OACP5D,GAAK,GACL4D,KAAO,IAELA,GAAK,KACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAELA,GAAK,IACP5D,GAAK,EACL4D,KAAO,GAEF5D,EAAI4D,GAIf1E,EAAG5P,UAAUuU,UAAY,SAAoBhD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAI+C,EAAI/C,EACJb,EAAI,EAoBR,OAnBqB,IAAZ,KAAJ4D,KACH5D,GAAK,GACL4D,KAAO,IAEU,IAAV,IAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,GAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,KACH5D,GAAK,EACL4D,KAAO,GAES,IAAT,EAAJA,IACH5D,IAEKA,GAITd,EAAG5P,UAAUwU,UAAY,WACvB,IAAIjD,EAAIxR,KAAKkQ,MAAMlQ,KAAKsB,OAAS,GAC7BoT,EAAK1U,KAAKsU,WAAW9C,GACzB,OAA2B,IAAnBxR,KAAKsB,OAAS,GAAUoT,GAiBlC7E,EAAG5P,UAAU0U,SAAW,WACtB,GAAI3U,KAAKuT,SAAU,OAAO,EAG1B,IADA,IAAI5C,EAAI,EACCtF,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAIwH,EAAI7S,KAAKwU,UAAUxU,KAAKkQ,MAAM7E,IAElC,GADAsF,GAAKkC,EACK,KAANA,EAAU,MAEhB,OAAOlC,GAGTd,EAAG5P,UAAU8B,WAAa,WACxB,OAAO+O,KAAKS,KAAKvR,KAAKyU,YAAc,IAGtC5E,EAAG5P,UAAU2U,OAAS,SAAiBC,GACrC,OAAsB,IAAlB7U,KAAKiQ,SACAjQ,KAAK8U,MAAMC,MAAMF,GAAOG,MAAM,GAEhChV,KAAK2E,SAGdkL,EAAG5P,UAAUgV,SAAW,SAAmBJ,GACzC,OAAI7U,KAAKkV,MAAML,EAAQ,GACd7U,KAAKmV,KAAKN,GAAOG,MAAM,GAAGI,OAE5BpV,KAAK2E,SAGdkL,EAAG5P,UAAUoV,MAAQ,WACnB,OAAyB,IAAlBrV,KAAKiQ,UAIdJ,EAAG5P,UAAUqV,IAAM,WACjB,OAAOtV,KAAK2E,QAAQyQ,QAGtBvF,EAAG5P,UAAUmV,KAAO,WAKlB,OAJKpV,KAAKuT,WACRvT,KAAKiQ,UAAY,GAGZjQ,MAIT6P,EAAG5P,UAAUsV,KAAO,SAAe3P,GACjC,KAAO5F,KAAKsB,OAASsE,EAAItE,QACvBtB,KAAKkQ,MAAMlQ,KAAKsB,UAAY,EAG9B,IAAK,IAAI+J,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAC9BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAG5C,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUuV,IAAM,SAAc5P,GAE/B,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAKuV,KAAK3P,IAInBiK,EAAG5P,UAAUwV,GAAK,SAAa7P,GAC7B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6Q,IAAI5P,GAC/CA,EAAIjB,QAAQ6Q,IAAIxV,OAGzB6P,EAAG5P,UAAUyV,IAAM,SAAc9P,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ4Q,KAAK3P,GAChDA,EAAIjB,QAAQ4Q,KAAKvV,OAI1B6P,EAAG5P,UAAU0V,MAAQ,SAAgB/P,GAEnC,IAAIiN,EAEFA,EADE7S,KAAKsB,OAASsE,EAAItE,OAChBsE,EAEA5F,KAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAAKzF,EAAIsK,MAAM7E,GAK5C,OAFArL,KAAKsB,OAASuR,EAAEvR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU2V,KAAO,SAAehQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK2V,MAAM/P,IAIpBiK,EAAG5P,UAAU4V,IAAM,SAAcjQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQiR,KAAKhQ,GAChDA,EAAIjB,QAAQiR,KAAK5V,OAG1B6P,EAAG5P,UAAU6V,KAAO,SAAelQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQgR,MAAM/P,GACjDA,EAAIjB,QAAQgR,MAAM3V,OAI3B6P,EAAG5P,UAAU8V,MAAQ,SAAgBnQ,GAEnC,IAAIgN,EACAC,EACA7S,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAGN,IAAK,IAAIqL,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAAKwH,EAAE3C,MAAM7E,GAGvC,GAAIrL,OAAS4S,EACX,KAAOvH,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAM5B,OAFArL,KAAKsB,OAASsR,EAAEtR,OAETtB,KAAK0R,SAGd7B,EAAG5P,UAAU+V,KAAO,SAAepQ,GAEjC,OADAxC,EAA0C,IAAlCpD,KAAKiQ,SAAWrK,EAAIqK,WACrBjQ,KAAK+V,MAAMnQ,IAIpBiK,EAAG5P,UAAUgW,IAAM,SAAcrQ,GAC/B,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQqR,KAAKpQ,GAChDA,EAAIjB,QAAQqR,KAAKhW,OAG1B6P,EAAG5P,UAAUiW,KAAO,SAAetQ,GACjC,OAAI5F,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQoR,MAAMnQ,GACjDA,EAAIjB,QAAQoR,MAAM/V,OAI3B6P,EAAG5P,UAAU8U,MAAQ,SAAgBF,GACnCzR,EAAwB,iBAAVyR,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBrF,KAAKS,KAAKsD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvB7U,KAAKoS,QAAQ+D,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI9K,EAAI,EAAGA,EAAI8K,EAAa9K,IAC/BrL,KAAKkQ,MAAM7E,GAAsB,UAAhBrL,KAAKkQ,MAAM7E,GAS9B,OALI+K,EAAW,IACbpW,KAAKkQ,MAAM7E,IAAMrL,KAAKkQ,MAAM7E,GAAM,UAAc,GAAK+K,GAIhDpW,KAAK0R,SAGd7B,EAAG5P,UAAUkV,KAAO,SAAeN,GACjC,OAAO7U,KAAK2E,QAAQoQ,MAAMF,IAI5BhF,EAAG5P,UAAUoW,KAAO,SAAeC,EAAK3Q,GACtCvC,EAAsB,iBAARkT,GAAoBA,GAAO,GAEzC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARAtW,KAAKoS,QAAQX,EAAM,GAGjBzR,KAAKkQ,MAAMuB,GADT9L,EACgB3F,KAAKkQ,MAAMuB,GAAQ,GAAK8E,EAExBvW,KAAKkQ,MAAMuB,KAAS,GAAK8E,GAGtCvW,KAAK0R,SAId7B,EAAG5P,UAAUuW,KAAO,SAAe5Q,GACjC,IAAI+K,EAkBAiC,EAAGC,EAfP,GAAsB,IAAlB7S,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAI7B,OAHAjQ,KAAKiQ,SAAW,EAChBU,EAAI3Q,KAAKyW,KAAK7Q,GACd5F,KAAKiQ,UAAY,EACVjQ,KAAKqS,YAGP,GAAsB,IAAlBrS,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAIpC,OAHArK,EAAIqK,SAAW,EACfU,EAAI3Q,KAAKyW,KAAK7Q,GACdA,EAAIqK,SAAW,EACRU,EAAE0B,YAKPrS,KAAKsB,OAASsE,EAAItE,QACpBsR,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAC5BsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,EAC1C/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAEhB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAClCsF,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,EACvB/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAChBoC,EAAQpC,IAAM,GAIhB,GADA3Q,KAAKsB,OAASsR,EAAEtR,OACF,IAAVyR,EACF/S,KAAKkQ,MAAMlQ,KAAKsB,QAAUyR,EAC1B/S,KAAKsB,cAEA,GAAIsR,IAAM5S,KACf,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAI5B,OAAOrL,MAIT6P,EAAG5P,UAAUyW,IAAM,SAAc9Q,GAC/B,IAAIpD,EACJ,OAAqB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UAC7BrK,EAAIqK,SAAW,EACfzN,EAAMxC,KAAK2W,IAAI/Q,GACfA,EAAIqK,UAAY,EACTzN,GACmB,IAAjBoD,EAAIqK,UAAoC,IAAlBjQ,KAAKiQ,UACpCjQ,KAAKiQ,SAAW,EAChBzN,EAAMoD,EAAI+Q,IAAI3W,MACdA,KAAKiQ,SAAW,EACTzN,GAGLxC,KAAKsB,OAASsE,EAAItE,OAAetB,KAAK2E,QAAQ6R,KAAK5Q,GAEhDA,EAAIjB,QAAQ6R,KAAKxW,OAI1B6P,EAAG5P,UAAUwW,KAAO,SAAe7Q,GAEjC,GAAqB,IAAjBA,EAAIqK,SAAgB,CACtBrK,EAAIqK,SAAW,EACf,IAAIU,EAAI3Q,KAAKwW,KAAK5Q,GAElB,OADAA,EAAIqK,SAAW,EACRU,EAAE0B,YAGJ,GAAsB,IAAlBrS,KAAKiQ,SAId,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKwW,KAAK5Q,GACV5F,KAAKiQ,SAAW,EACTjQ,KAAKqS,YAId,IAWIO,EAAGC,EAXH3B,EAAMlR,KAAKkR,IAAItL,GAGnB,GAAY,IAARsL,EAIF,OAHAlR,KAAKiQ,SAAW,EAChBjQ,KAAKsB,OAAS,EACdtB,KAAKkQ,MAAM,GAAK,EACTlQ,KAKLkR,EAAM,GACR0B,EAAI5S,KACJ6S,EAAIjN,IAEJgN,EAAIhN,EACJiN,EAAI7S,MAIN,IADA,IAAI+S,EAAQ,EACH1H,EAAI,EAAGA,EAAIwH,EAAEvR,OAAQ+J,IAE5B0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,KAAwB,EAAbwH,EAAE3C,MAAM7E,IAAU0H,IAC7B,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAElB,KAAiB,IAAVoC,GAAe1H,EAAIuH,EAAEtR,OAAQ+J,IAElC0H,GADApC,GAAkB,EAAbiC,EAAE1C,MAAM7E,IAAU0H,IACV,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJsF,EAIlB,GAAc,IAAVoC,GAAe1H,EAAIuH,EAAEtR,QAAUsR,IAAM5S,KACvC,KAAOqL,EAAIuH,EAAEtR,OAAQ+J,IACnBrL,KAAKkQ,MAAM7E,GAAKuH,EAAE1C,MAAM7E,GAU5B,OANArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,GAEhCuH,IAAM5S,OACRA,KAAKiQ,SAAW,GAGXjQ,KAAK0R,SAId7B,EAAG5P,UAAU0W,IAAM,SAAc/Q,GAC/B,OAAO5F,KAAK2E,QAAQ8R,KAAK7Q,IA+C3B,IAAIgR,EAAc,SAAsBjE,EAAM/M,EAAK9C,GACjD,IAIIgQ,EACA+D,EACAnC,EANA9B,EAAID,EAAKzC,MACT2C,EAAIjN,EAAIsK,MACR4G,EAAIhU,EAAIoN,MACRM,EAAI,EAIJuG,EAAY,EAAPnE,EAAE,GACPoE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtE,EAAE,GACPuE,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzE,EAAE,GACP0E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5E,EAAE,GACP6E,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/E,EAAE,GACPgF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlF,EAAE,GACPmF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrF,EAAE,GACPsF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxF,EAAE,GACPyF,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3F,EAAE,GACP4F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9F,EAAE,GACP+F,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPhG,EAAE,GACPiG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPnG,EAAE,GACPoG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPtG,EAAE,GACPuG,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPzG,EAAE,GACP0G,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5G,EAAE,GACP6G,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP/G,EAAE,GACPgH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPlH,EAAE,GACPmH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPrH,EAAE,GACPsH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPxH,EAAE,GACPyH,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP3H,EAAE,GACP4H,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB1X,EAAImN,SAAW0C,EAAK1C,SAAWrK,EAAIqK,SACnCnN,EAAIxB,OAAS,GAMb,IAAIqZ,IAAQnK,GAJZsC,EAAKhC,KAAK8J,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM/F,KAAK8J,KAAK5D,EAAK+B,IACRjI,KAAK8J,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrDtI,IAFAkE,EAAK5D,KAAK8J,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAEN7H,EAAKhC,KAAK8J,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKzD,EAAK4B,IACRjI,KAAK8J,KAAKxD,EAAK0B,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQrK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKkC,GAAQ,GACvBpI,KAAK8J,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrDzI,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAEN/H,EAAKhC,KAAK8J,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKtD,EAAKyB,IACRjI,KAAK8J,KAAKrD,EAAKuB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKrD,EAAKwB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK+B,GAAQ,GACvBpI,KAAK8J,KAAKxD,EAAK6B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQtK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKqC,GAAQ,GACvBvI,KAAK8J,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrD5I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENhI,EAAKhC,KAAK8J,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKnD,EAAKsB,IACRjI,KAAK8J,KAAKlD,EAAKoB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKlD,EAAKqB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK4B,GAAQ,GACvBpI,KAAK8J,KAAKrD,EAAK0B,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK2B,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKkC,GAAQ,GACvBvI,KAAK8J,KAAKxD,EAAKgC,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQvK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKwC,GAAQ,GACvB1I,KAAK8J,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrD/I,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENjI,EAAKhC,KAAK8J,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKhD,EAAKmB,IACRjI,KAAK8J,KAAK/C,EAAKiB,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK/C,EAAKkB,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKyB,GAAQ,GACvBpI,KAAK8J,KAAKlD,EAAKuB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKwB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK+B,GAAQ,GACvBvI,KAAK8J,KAAKrD,EAAK6B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK8B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKqC,GAAQ,GACvB1I,KAAK8J,KAAKxD,EAAKmC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQxK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK2C,IAAQ,GACvB7I,KAAK8J,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDlJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENlI,EAAKhC,KAAK8J,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK7C,EAAKgB,IACRjI,KAAK8J,KAAK5C,EAAKc,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAK5C,EAAKe,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKsB,GAAQ,GACvBpI,KAAK8J,KAAK/C,EAAKoB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKqB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK4B,GAAQ,GACvBvI,KAAK8J,KAAKlD,EAAK0B,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK2B,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKkC,GAAQ,GACvB1I,KAAK8J,KAAKrD,EAAKgC,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKiC,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKwC,IAAQ,GACvB7I,KAAK8J,KAAKxD,EAAKsC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQzK,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK8C,IAAQ,GACvBhJ,KAAK8J,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDrJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENnI,EAAKhC,KAAK8J,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAK1C,EAAKa,IACRjI,KAAK8J,KAAKzC,EAAKW,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKzC,EAAKY,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKmB,GAAQ,GACvBpI,KAAK8J,KAAK5C,EAAKiB,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKkB,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKyB,GAAQ,GACvBvI,KAAK8J,KAAK/C,EAAKuB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKwB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK+B,GAAQ,GACvB1I,KAAK8J,KAAKlD,EAAK6B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK8B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKqC,IAAQ,GACvB7I,KAAK8J,KAAKrD,EAAKmC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKoC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK2C,IAAQ,GACvBhJ,KAAK8J,KAAKxD,EAAKyC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ1K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKiD,IAAQ,GACvBnJ,KAAK8J,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrDxJ,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENpI,EAAKhC,KAAK8J,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKvC,EAAKU,IACRjI,KAAK8J,KAAKtC,EAAKQ,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKtC,EAAKS,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKgB,GAAQ,GACvBpI,KAAK8J,KAAKzC,EAAKc,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKe,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKsB,GAAQ,GACvBvI,KAAK8J,KAAK5C,EAAKoB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKqB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK4B,GAAQ,GACvB1I,KAAK8J,KAAK/C,EAAK0B,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK2B,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKkC,IAAQ,GACvB7I,KAAK8J,KAAKlD,EAAKgC,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKiC,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKwC,IAAQ,GACvBhJ,KAAK8J,KAAKrD,EAAKsC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKuC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAK8C,IAAQ,GACvBnJ,KAAK8J,KAAKxD,EAAK4C,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ3K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKoD,IAAQ,GACvBtJ,KAAK8J,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD3J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENrI,EAAKhC,KAAK8J,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKpC,EAAKO,IACRjI,KAAK8J,KAAKnC,EAAKK,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKnC,EAAKM,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKa,GAAQ,GACvBpI,KAAK8J,KAAKtC,EAAKW,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKY,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKmB,GAAQ,GACvBvI,KAAK8J,KAAKzC,EAAKiB,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKkB,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKyB,GAAQ,GACvB1I,KAAK8J,KAAK5C,EAAKuB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKwB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK+B,IAAQ,GACvB7I,KAAK8J,KAAK/C,EAAK6B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK8B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKqC,IAAQ,GACvBhJ,KAAK8J,KAAKlD,EAAKmC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKoC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK2C,IAAQ,GACvBnJ,KAAK8J,KAAKrD,EAAKyC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK0C,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKiD,IAAQ,GACvBtJ,KAAK8J,KAAKxD,EAAK+C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQ5K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAKuD,IAAQ,GACvBzJ,KAAK8J,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrD9J,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENtI,EAAKhC,KAAK8J,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKI,IACRjI,KAAK8J,KAAKhC,EAAKE,GAAQ,EACpCpE,EAAK5D,KAAK8J,KAAKhC,EAAKG,GACpBjG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKU,GAAQ,GACvBpI,KAAK8J,KAAKnC,EAAKQ,GAAQ,EACpCvE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKS,GAAQ,EAClCpG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKgB,GAAQ,GACvBvI,KAAK8J,KAAKtC,EAAKc,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKe,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKsB,GAAQ,GACvB1I,KAAK8J,KAAKzC,EAAKoB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKqB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK4B,IAAQ,GACvB7I,KAAK8J,KAAK5C,EAAK0B,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK2B,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKkC,IAAQ,GACvBhJ,KAAK8J,KAAK/C,EAAKgC,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKiC,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKwC,IAAQ,GACvBnJ,KAAK8J,KAAKlD,EAAKsC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKuC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAK8C,IAAQ,GACvBtJ,KAAK8J,KAAKrD,EAAK4C,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAK6C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKoD,IAAQ,GACvBzJ,KAAK8J,KAAKxD,EAAKkD,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQ7K,GAJZsC,EAAMA,EAAKhC,KAAK8J,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK5D,EAAK0D,IAAQ,GACvB5J,KAAK8J,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAENvI,EAAKhC,KAAK8J,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKO,IACRpI,KAAK8J,KAAKhC,EAAKK,GAAQ,EACpCvE,EAAK5D,KAAK8J,KAAKhC,EAAKM,GACpBpG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKa,GAAQ,GACvBvI,KAAK8J,KAAKnC,EAAKW,GAAQ,EACpC1E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKY,GAAQ,EAClCvG,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKmB,GAAQ,GACvB1I,KAAK8J,KAAKtC,EAAKiB,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKkB,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKyB,IAAQ,GACvB7I,KAAK8J,KAAKzC,EAAKuB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKwB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK+B,IAAQ,GACvBhJ,KAAK8J,KAAK5C,EAAK6B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK8B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKqC,IAAQ,GACvBnJ,KAAK8J,KAAK/C,EAAKmC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKoC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK2C,IAAQ,GACvBtJ,KAAK8J,KAAKlD,EAAKyC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK0C,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKiD,IAAQ,GACvBzJ,KAAK8J,KAAKrD,EAAK+C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAAS9K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKzD,EAAKuD,IAAQ,GACvB5J,KAAK8J,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEPxI,EAAKhC,KAAK8J,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKU,IACRvI,KAAK8J,KAAKhC,EAAKQ,GAAQ,EACpC1E,EAAK5D,KAAK8J,KAAKhC,EAAKS,GACpBvG,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKgB,GAAQ,GACvB1I,KAAK8J,KAAKnC,EAAKc,GAAQ,EACpC7E,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKe,GAAQ,EAClC1G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKsB,IAAQ,GACvB7I,KAAK8J,KAAKtC,EAAKoB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKqB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK4B,IAAQ,GACvBhJ,KAAK8J,KAAKzC,EAAK0B,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK2B,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKkC,IAAQ,GACvBnJ,KAAK8J,KAAK5C,EAAKgC,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKiC,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAKwC,IAAQ,GACvBtJ,KAAK8J,KAAK/C,EAAKsC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAKuC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAK8C,IAAQ,GACvBzJ,KAAK8J,KAAKlD,EAAK4C,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAAS/K,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKtD,EAAKoD,IAAQ,GACvB5J,KAAK8J,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEPzI,EAAKhC,KAAK8J,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKa,IACR1I,KAAK8J,KAAKhC,EAAKW,GAAQ,EACpC7E,EAAK5D,KAAK8J,KAAKhC,EAAKY,GACpB1G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKmB,IAAQ,GACvB7I,KAAK8J,KAAKnC,EAAKiB,GAAQ,EACpChF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKkB,IAAQ,EAClC7G,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKyB,IAAQ,GACvBhJ,KAAK8J,KAAKtC,EAAKuB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKwB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAK+B,IAAQ,GACvBnJ,KAAK8J,KAAKzC,EAAK6B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAK8B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKqC,IAAQ,GACvBtJ,KAAK8J,KAAK5C,EAAKmC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKoC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK2C,IAAQ,GACvBzJ,KAAK8J,KAAK/C,EAAKyC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAAShL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKnD,EAAKiD,IAAQ,GACvB5J,KAAK8J,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP1I,EAAKhC,KAAK8J,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKgB,KACR7I,KAAK8J,KAAKhC,EAAKc,GAAQ,EACpChF,EAAK5D,KAAK8J,KAAKhC,EAAKe,IACpB7G,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKsB,IAAQ,GACvBhJ,KAAK8J,KAAKnC,EAAKoB,IAAQ,EACpCnF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKqB,IAAQ,EAClChH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK4B,IAAQ,GACvBnJ,KAAK8J,KAAKtC,EAAK0B,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK2B,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKkC,IAAQ,GACvBtJ,KAAK8J,KAAKzC,EAAKgC,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKiC,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAKwC,IAAQ,GACvBzJ,KAAK8J,KAAK5C,EAAKsC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASjL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKhD,EAAK8C,IAAQ,GACvB5J,KAAK8J,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP3I,EAAKhC,KAAK8J,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKmB,KACRhJ,KAAK8J,KAAKhC,EAAKiB,IAAQ,EACpCnF,EAAK5D,KAAK8J,KAAKhC,EAAKkB,IACpBhH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKyB,IAAQ,GACvBnJ,KAAK8J,KAAKnC,EAAKuB,IAAQ,EACpCtF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKwB,IAAQ,EAClCnH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAK+B,IAAQ,GACvBtJ,KAAK8J,KAAKtC,EAAK6B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAK8B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKqC,IAAQ,GACvBzJ,KAAK8J,KAAKzC,EAAKmC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAASlL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK7C,EAAK2C,IAAQ,GACvB5J,KAAK8J,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP5I,EAAKhC,KAAK8J,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKsB,KACRnJ,KAAK8J,KAAKhC,EAAKoB,IAAQ,EACpCtF,EAAK5D,KAAK8J,KAAKhC,EAAKqB,IACpBnH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK4B,IAAQ,GACvBtJ,KAAK8J,KAAKnC,EAAK0B,IAAQ,EACpCzF,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK2B,IAAQ,EAClCtH,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKkC,IAAQ,GACvBzJ,KAAK8J,KAAKtC,EAAKgC,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASnL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAK1C,EAAKwC,IAAQ,GACvB5J,KAAK8J,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEP7I,EAAKhC,KAAK8J,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAKyB,KACRtJ,KAAK8J,KAAKhC,EAAKuB,IAAQ,EACpCzF,EAAK5D,KAAK8J,KAAKhC,EAAKwB,IACpBtH,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAK+B,IAAQ,GACvBzJ,KAAK8J,KAAKnC,EAAK6B,IAAQ,EACpC5F,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASpL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKvC,EAAKqC,IAAQ,GACvB5J,KAAK8J,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEP9I,EAAKhC,KAAK8J,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK4B,KACRzJ,KAAK8J,KAAKhC,EAAK0B,IAAQ,EACpC5F,EAAK5D,KAAK8J,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASrL,GAJbsC,EAAMA,EAAKhC,KAAK8J,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM/F,KAAK8J,KAAKpC,EAAKkC,IAAQ,GACvB5J,KAAK8J,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDjK,IAFAkE,EAAMA,EAAK5D,KAAK8J,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAStL,GAJbsC,EAAKhC,KAAK8J,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM/F,KAAK8J,KAAKjC,EAAK+B,KACR5J,KAAK8J,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBAjK,IAFAkE,EAAK5D,KAAK8J,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAANtL,IACFsG,EAAE,IAAMtG,EACR1N,EAAIxB,UAECwB,GAiDT,SAASiZ,EAAYpJ,EAAM/M,EAAK9C,GAE9B,OADW,IAAIkZ,GACHC,KAAKtJ,EAAM/M,EAAK9C,GAsB9B,SAASkZ,EAAME,EAAGC,GAChBnc,KAAKkc,EAAIA,EACTlc,KAAKmc,EAAIA,EAvENrL,KAAK8J,OACRhE,EAAclE,GAiDhB7C,EAAG5P,UAAUmc,MAAQ,SAAgBxW,EAAK9C,GACxC,IAAIN,EACA4I,EAAMpL,KAAKsB,OAASsE,EAAItE,OAW5B,OATEkB,EADkB,KAAhBxC,KAAKsB,QAAgC,KAAfsE,EAAItE,OACtBsV,EAAY5W,KAAM4F,EAAK9C,GACpBsI,EAAM,GACTsH,EAAW1S,KAAM4F,EAAK9C,GACnBsI,EAAM,KArDnB,SAAmBuH,EAAM/M,EAAK9C,GAC5BA,EAAImN,SAAWrK,EAAIqK,SAAW0C,EAAK1C,SACnCnN,EAAIxB,OAASqR,EAAKrR,OAASsE,EAAItE,OAI/B,IAFA,IAAIyR,EAAQ,EACRsJ,EAAU,EACLrJ,EAAI,EAAGA,EAAIlQ,EAAIxB,OAAS,EAAG0R,IAAK,CAGvC,IAAIC,EAASoJ,EACbA,EAAU,EAGV,IAFA,IAAInJ,EAAgB,SAARH,EACRI,EAAOrC,KAAK/D,IAAIiG,EAAGpN,EAAItE,OAAS,GAC3BgK,EAAIwF,KAAKC,IAAI,EAAGiC,EAAIL,EAAKrR,OAAS,GAAIgK,GAAK6H,EAAM7H,IAAK,CAC7D,IAAID,EAAI2H,EAAI1H,EAGRqF,GAFoB,EAAhBgC,EAAKzC,MAAM7E,KACI,EAAfzF,EAAIsK,MAAM5E,IAGdwH,EAAS,SAAJnC,EAGTuC,EAAa,UADbJ,EAAMA,EAAKI,EAAS,GAIpBmJ,IAFApJ,GAHAA,EAAUA,GAAWtC,EAAI,SAAa,GAAM,IAGxBmC,IAAO,IAAO,KAEZ,GACtBG,GAAU,SAEZnQ,EAAIoN,MAAM8C,GAAKE,EACfH,EAAQE,EACRA,EAASoJ,EAQX,OANc,IAAVtJ,EACFjQ,EAAIoN,MAAM8C,GAAKD,EAEfjQ,EAAIxB,SAGCwB,EAAI4O,QAgBH4K,CAAStc,KAAM4F,EAAK9C,GAEpBiZ,EAAW/b,KAAM4F,EAAK9C,GAGvBN,GAWTwZ,EAAK/b,UAAUsc,QAAU,SAAkBC,GAGzC,IAFA,IAAIjI,EAAI,IAAI7S,MAAM8a,GACdC,EAAI5M,EAAG5P,UAAUqU,WAAWkI,GAAK,EAC5BnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBkJ,EAAElJ,GAAKrL,KAAK0c,OAAOrR,EAAGoR,EAAGD,GAG3B,OAAOjI,GAITyH,EAAK/b,UAAUyc,OAAS,SAAiBR,EAAGO,EAAGD,GAC7C,GAAU,IAANN,GAAWA,IAAMM,EAAI,EAAG,OAAON,EAGnC,IADA,IAAIS,EAAK,EACAtR,EAAI,EAAGA,EAAIoR,EAAGpR,IACrBsR,IAAW,EAAJT,IAAWO,EAAIpR,EAAI,EAC1B6Q,IAAM,EAGR,OAAOS,GAKTX,EAAK/b,UAAU2c,QAAU,SAAkBC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GACpE,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAGnR,IACrB2R,EAAK3R,GAAKyR,EAAID,EAAIxR,IAClB4R,EAAK5R,GAAK0R,EAAIF,EAAIxR,KAItB2Q,EAAK/b,UAAUid,UAAY,SAAoBJ,EAAKC,EAAKC,EAAMC,EAAMT,EAAGK,GACtE7c,KAAK4c,QAAQC,EAAKC,EAAKC,EAAKC,EAAMC,EAAMT,GAExC,IAAK,IAAIW,EAAI,EAAGA,EAAIX,EAAGW,IAAM,EAM3B,IALA,IAAIV,EAAIU,GAAK,EAETC,EAAQtM,KAAKuM,IAAI,EAAIvM,KAAKwM,GAAKb,GAC/Bc,EAAQzM,KAAK0M,IAAI,EAAI1M,KAAKwM,GAAKb,GAE1BjN,EAAI,EAAGA,EAAIgN,EAAGhN,GAAKiN,EAI1B,IAHA,IAAIgB,EAASL,EACTM,EAASH,EAEJjS,EAAI,EAAGA,EAAI6R,EAAG7R,IAAK,CAC1B,IAAImC,EAAKuP,EAAKxN,EAAIlE,GACdqS,EAAKV,EAAKzN,EAAIlE,GAEdsS,EAAKZ,EAAKxN,EAAIlE,EAAI6R,GAClBU,EAAKZ,EAAKzN,EAAIlE,EAAI6R,GAElBW,EAAKL,EAASG,EAAKF,EAASG,EAEhCA,EAAKJ,EAASI,EAAKH,EAASE,EAC5BA,EAAKE,EAELd,EAAKxN,EAAIlE,GAAKmC,EAAKmQ,EACnBX,EAAKzN,EAAIlE,GAAKqS,EAAKE,EAEnBb,EAAKxN,EAAIlE,EAAI6R,GAAK1P,EAAKmQ,EACvBX,EAAKzN,EAAIlE,EAAI6R,GAAKQ,EAAKE,EAGnBvS,IAAMmR,IACRqB,EAAKV,EAAQK,EAASF,EAAQG,EAE9BA,EAASN,EAAQM,EAASH,EAAQE,EAClCA,EAASK,KAOnB9B,EAAK/b,UAAU8d,YAAc,SAAsBC,EAAGjf,GACpD,IAAIyd,EAAqB,EAAjB1L,KAAKC,IAAIhS,EAAGif,GAChBC,EAAU,EAAJzB,EACNnR,EAAI,EACR,IAAKmR,EAAIA,EAAI,EAAI,EAAGA,EAAGA,KAAU,EAC/BnR,IAGF,OAAO,GAAKA,EAAI,EAAI4S,GAGtBjC,EAAK/b,UAAUie,UAAY,SAAoBpB,EAAKC,EAAKP,GACvD,KAAIA,GAAK,GAET,IAAK,IAAInR,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAIkJ,EAAIuI,EAAIzR,GAEZyR,EAAIzR,GAAKyR,EAAIN,EAAInR,EAAI,GACrByR,EAAIN,EAAInR,EAAI,GAAKkJ,EAEjBA,EAAIwI,EAAI1R,GAER0R,EAAI1R,IAAM0R,EAAIP,EAAInR,EAAI,GACtB0R,EAAIP,EAAInR,EAAI,IAAMkJ,IAItByH,EAAK/b,UAAUke,aAAe,SAAuBC,EAAI5B,GAEvD,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAImR,EAAI,EAAGnR,IAAK,CAC9B,IAAImG,EAAoC,KAAhCV,KAAKuN,MAAMD,EAAG,EAAI/S,EAAI,GAAKmR,GACjC1L,KAAKuN,MAAMD,EAAG,EAAI/S,GAAKmR,GACvBzJ,EAEFqL,EAAG/S,GAAS,SAAJmG,EAGNuB,EADEvB,EAAI,SACE,EAEAA,EAAI,SAAY,EAI5B,OAAO4M,GAGTpC,EAAK/b,UAAUqe,WAAa,SAAqBF,EAAIhT,EAAK0R,EAAKN,GAE7D,IADA,IAAIzJ,EAAQ,EACH1H,EAAI,EAAGA,EAAID,EAAKC,IACvB0H,GAAyB,EAARqL,EAAG/S,GAEpByR,EAAI,EAAIzR,GAAa,KAAR0H,EAAgBA,KAAkB,GAC/C+J,EAAI,EAAIzR,EAAI,GAAa,KAAR0H,EAAgBA,KAAkB,GAIrD,IAAK1H,EAAI,EAAID,EAAKC,EAAImR,IAAKnR,EACzByR,EAAIzR,GAAK,EAGXjI,EAAiB,IAAV2P,GACP3P,EAA6B,KAAb,KAAR2P,KAGViJ,EAAK/b,UAAUse,KAAO,SAAe/B,GAEnC,IADA,IAAIgC,EAAK,IAAI9c,MAAM8a,GACVnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrBmT,EAAGnT,GAAK,EAGV,OAAOmT,GAGTxC,EAAK/b,UAAUgc,KAAO,SAAeC,EAAGC,EAAGrZ,GACzC,IAAI0Z,EAAI,EAAIxc,KAAK+d,YAAY7B,EAAE5a,OAAQ6a,EAAE7a,QAErCub,EAAM7c,KAAKuc,QAAQC,GAEnBiC,EAAIze,KAAKue,KAAK/B,GAEdM,EAAM,IAAIpb,MAAM8a,GAChBkC,EAAO,IAAIhd,MAAM8a,GACjBmC,EAAO,IAAIjd,MAAM8a,GAEjBoC,EAAO,IAAIld,MAAM8a,GACjBqC,EAAQ,IAAInd,MAAM8a,GAClBsC,EAAQ,IAAIpd,MAAM8a,GAElBuC,EAAOjc,EAAIoN,MACf6O,EAAKzd,OAASkb,EAEdxc,KAAKse,WAAWpC,EAAEhM,MAAOgM,EAAE5a,OAAQwb,EAAKN,GACxCxc,KAAKse,WAAWnC,EAAEjM,MAAOiM,EAAE7a,OAAQsd,EAAMpC,GAEzCxc,KAAKkd,UAAUJ,EAAK2B,EAAGC,EAAMC,EAAMnC,EAAGK,GACtC7c,KAAKkd,UAAU0B,EAAMH,EAAGI,EAAOC,EAAOtC,EAAGK,GAEzC,IAAK,IAAIxR,EAAI,EAAGA,EAAImR,EAAGnR,IAAK,CAC1B,IAAIyS,EAAKY,EAAKrT,GAAKwT,EAAMxT,GAAKsT,EAAKtT,GAAKyT,EAAMzT,GAC9CsT,EAAKtT,GAAKqT,EAAKrT,GAAKyT,EAAMzT,GAAKsT,EAAKtT,GAAKwT,EAAMxT,GAC/CqT,EAAKrT,GAAKyS,EAUZ,OAPA9d,KAAKke,UAAUQ,EAAMC,EAAMnC,GAC3Bxc,KAAKkd,UAAUwB,EAAMC,EAAMI,EAAMN,EAAGjC,EAAGK,GACvC7c,KAAKke,UAAUa,EAAMN,EAAGjC,GACxBxc,KAAKme,aAAaY,EAAMvC,GAExB1Z,EAAImN,SAAWiM,EAAEjM,SAAWkM,EAAElM,SAC9BnN,EAAIxB,OAAS4a,EAAE5a,OAAS6a,EAAE7a,OACnBwB,EAAI4O,SAIb7B,EAAG5P,UAAU4Q,IAAM,SAAcjL,GAC/B,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCtB,KAAKoc,MAAMxW,EAAK9C,IAIzB+M,EAAG5P,UAAU+e,KAAO,SAAepZ,GACjC,IAAI9C,EAAM,IAAI+M,EAAG,MAEjB,OADA/M,EAAIoN,MAAQ,IAAIxO,MAAM1B,KAAKsB,OAASsE,EAAItE,QACjCya,EAAW/b,KAAM4F,EAAK9C,IAI/B+M,EAAG5P,UAAU2a,KAAO,SAAehV,GACjC,OAAO5F,KAAK2E,QAAQyX,MAAMxW,EAAK5F,OAGjC6P,EAAG5P,UAAU+R,MAAQ,SAAgBpM,GACnCxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UAIb,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACpC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAUzF,EAC1BkN,GAAU,SAAJtB,IAA0B,SAARuB,GAC5BA,IAAU,GACVA,GAAUvB,EAAI,SAAa,EAE3BuB,GAASD,IAAO,GAChB9S,KAAKkQ,MAAM7E,GAAU,SAALyH,EAQlB,OALc,IAAVC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAGAtB,MAGT6P,EAAG5P,UAAUgf,KAAO,SAAerZ,GACjC,OAAO5F,KAAK2E,QAAQqN,MAAMpM,IAI5BiK,EAAG5P,UAAUif,IAAM,WACjB,OAAOlf,KAAK6Q,IAAI7Q,OAIlB6P,EAAG5P,UAAUkf,KAAO,WAClB,OAAOnf,KAAK4a,KAAK5a,KAAK2E,UAIxBkL,EAAG5P,UAAUiS,IAAM,SAActM,GAC/B,IAAI4L,EAxxCN,SAAqB5L,GAGnB,IAFA,IAAI4L,EAAI,IAAI9P,MAAMkE,EAAI6O,aAEb6B,EAAM,EAAGA,EAAM9E,EAAElQ,OAAQgV,IAAO,CACvC,IAAI7E,EAAO6E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB9E,EAAE8E,IAAQ1Q,EAAIsK,MAAMuB,GAAQ,GAAK8E,KAAWA,EAG9C,OAAO/E,EA8wCC4N,CAAWxZ,GACnB,GAAiB,IAAb4L,EAAElQ,OAAc,OAAO,IAAIuO,EAAG,GAIlC,IADA,IAAIrN,EAAMxC,KACDqL,EAAI,EAAGA,EAAImG,EAAElQ,QACP,IAATkQ,EAAEnG,GADsBA,IAAK7I,EAAMA,EAAI0c,OAI7C,KAAM7T,EAAImG,EAAElQ,OACV,IAAK,IAAI4S,EAAI1R,EAAI0c,MAAO7T,EAAImG,EAAElQ,OAAQ+J,IAAK6I,EAAIA,EAAEgL,MAClC,IAAT1N,EAAEnG,KAEN7I,EAAMA,EAAIqO,IAAIqD,IAIlB,OAAO1R,GAITqN,EAAG5P,UAAUof,OAAS,SAAiBC,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAGIjU,EAHAsF,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GACjB4O,EAAa,WAAe,GAAK5O,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIoC,EAAQ,EAEZ,IAAK1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAAK,CAChC,IAAImU,EAAWxf,KAAKkQ,MAAM7E,GAAKkU,EAC3B/O,GAAsB,EAAhBxQ,KAAKkQ,MAAM7E,IAAUmU,GAAa7O,EAC5C3Q,KAAKkQ,MAAM7E,GAAKmF,EAAIuC,EACpBA,EAAQyM,IAAc,GAAK7O,EAGzBoC,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAIT,GAAU,IAAN6b,EAAS,CACX,IAAK9R,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAChCrL,KAAKkQ,MAAM7E,EAAI8R,GAAKnd,KAAKkQ,MAAM7E,GAGjC,IAAKA,EAAI,EAAGA,EAAI8R,EAAG9R,IACjBrL,KAAKkQ,MAAM7E,GAAK,EAGlBrL,KAAKsB,QAAU6b,EAGjB,OAAOnd,KAAK0R,SAGd7B,EAAG5P,UAAUwf,MAAQ,SAAgBH,GAGnC,OADAlc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKqf,OAAOC,IAMrBzP,EAAG5P,UAAUmU,OAAS,SAAiBkL,EAAMI,EAAMC,GAEjD,IAAIC,EADJxc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAGzCM,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAI/O,EAAI2O,EAAO,GACXnC,EAAIrM,KAAK/D,KAAKuS,EAAO3O,GAAK,GAAI3Q,KAAKsB,QACnCue,EAAO,SAAc,WAAclP,GAAMA,EACzCmP,EAAcH,EAMlB,GAJAC,GAAKzC,EACLyC,EAAI9O,KAAKC,IAAI,EAAG6O,GAGZE,EAAa,CACf,IAAK,IAAIzU,EAAI,EAAGA,EAAI8R,EAAG9R,IACrByU,EAAY5P,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,GAEpCyU,EAAYxe,OAAS6b,EAGvB,GAAU,IAANA,QAEG,GAAInd,KAAKsB,OAAS6b,EAEvB,IADAnd,KAAKsB,QAAU6b,EACV9R,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAC3BrL,KAAKkQ,MAAM7E,GAAKrL,KAAKkQ,MAAM7E,EAAI8R,QAGjCnd,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,EAGhB,IAAIyR,EAAQ,EACZ,IAAK1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,IAAgB,IAAV0H,GAAe1H,GAAKuU,GAAIvU,IAAK,CAChE,IAAI0G,EAAuB,EAAhB/R,KAAKkQ,MAAM7E,GACtBrL,KAAKkQ,MAAM7E,GAAM0H,GAAU,GAAKpC,EAAOoB,IAASpB,EAChDoC,EAAQhB,EAAO8N,EAajB,OATIC,GAAyB,IAAV/M,IACjB+M,EAAY5P,MAAM4P,EAAYxe,UAAYyR,GAGxB,IAAhB/S,KAAKsB,SACPtB,KAAKkQ,MAAM,GAAK,EAChBlQ,KAAKsB,OAAS,GAGTtB,KAAK0R,SAGd7B,EAAG5P,UAAU8f,MAAQ,SAAgBT,EAAMI,EAAMC,GAG/C,OADAvc,EAAyB,IAAlBpD,KAAKiQ,UACLjQ,KAAKoU,OAAOkL,EAAMI,EAAMC,IAIjC9P,EAAG5P,UAAU+f,KAAO,SAAeV,GACjC,OAAOtf,KAAK2E,QAAQ8a,MAAMH,IAG5BzP,EAAG5P,UAAUggB,MAAQ,SAAgBX,GACnC,OAAOtf,KAAK2E,QAAQ0a,OAAOC,IAI7BzP,EAAG5P,UAAUigB,KAAO,SAAeZ,GACjC,OAAOtf,KAAK2E,QAAQob,MAAMT,IAG5BzP,EAAG5P,UAAUkgB,MAAQ,SAAgBb,GACnC,OAAOtf,KAAK2E,QAAQyP,OAAOkL,IAI7BzP,EAAG5P,UAAUiV,MAAQ,SAAgBoB,GACnClT,EAAsB,iBAARkT,GAAoBA,GAAO,GACzC,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,QAAI3Q,KAAKsB,QAAU6b,KAGXnd,KAAKkQ,MAAMiN,GAELjJ,KAIhBrE,EAAG5P,UAAUmgB,OAAS,SAAiBd,GACrClc,EAAuB,iBAATkc,GAAqBA,GAAQ,GAC3C,IAAI3O,EAAI2O,EAAO,GACXnC,GAAKmC,EAAO3O,GAAK,GAIrB,GAFAvN,EAAyB,IAAlBpD,KAAKiQ,SAAgB,2CAExBjQ,KAAKsB,QAAU6b,EACjB,OAAOnd,KAQT,GALU,IAAN2Q,GACFwM,IAEFnd,KAAKsB,OAASwP,KAAK/D,IAAIoQ,EAAGnd,KAAKsB,QAErB,IAANqP,EAAS,CACX,IAAIkP,EAAO,SAAc,WAAclP,GAAMA,EAC7C3Q,KAAKkQ,MAAMlQ,KAAKsB,OAAS,IAAMue,EAGjC,OAAO7f,KAAK0R,SAId7B,EAAG5P,UAAUogB,MAAQ,SAAgBf,GACnC,OAAOtf,KAAK2E,QAAQyb,OAAOd,IAI7BzP,EAAG5P,UAAU+U,MAAQ,SAAgBpP,GAGnC,OAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAU5F,KAAKsgB,OAAO1a,GAGV,IAAlB5F,KAAKiQ,SACa,IAAhBjQ,KAAKsB,SAAiC,EAAhBtB,KAAKkQ,MAAM,IAAUtK,GAC7C5F,KAAKkQ,MAAM,GAAKtK,GAAuB,EAAhB5F,KAAKkQ,MAAM,IAClClQ,KAAKiQ,SAAW,EACTjQ,OAGTA,KAAKiQ,SAAW,EAChBjQ,KAAKsgB,MAAM1a,GACX5F,KAAKiQ,SAAW,EACTjQ,MAIFA,KAAKiS,OAAOrM,IAGrBiK,EAAG5P,UAAUgS,OAAS,SAAiBrM,GACrC5F,KAAKkQ,MAAM,IAAMtK,EAGjB,IAAK,IAAIyF,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,IAAM,SAAWA,IAC7DrL,KAAKkQ,MAAM7E,IAAM,SACbA,IAAMrL,KAAKsB,OAAS,EACtBtB,KAAKkQ,MAAM7E,EAAI,GAAK,EAEpBrL,KAAKkQ,MAAM7E,EAAI,KAKnB,OAFArL,KAAKsB,OAASwP,KAAKC,IAAI/Q,KAAKsB,OAAQ+J,EAAI,GAEjCrL,MAIT6P,EAAG5P,UAAUqgB,MAAQ,SAAgB1a,GAGnC,GAFAxC,EAAsB,iBAARwC,GACdxC,EAAOwC,EAAM,UACTA,EAAM,EAAG,OAAO5F,KAAKgV,OAAOpP,GAEhC,GAAsB,IAAlB5F,KAAKiQ,SAIP,OAHAjQ,KAAKiQ,SAAW,EAChBjQ,KAAKgV,MAAMpP,GACX5F,KAAKiQ,SAAW,EACTjQ,KAKT,GAFAA,KAAKkQ,MAAM,IAAMtK,EAEG,IAAhB5F,KAAKsB,QAAgBtB,KAAKkQ,MAAM,GAAK,EACvClQ,KAAKkQ,MAAM,IAAMlQ,KAAKkQ,MAAM,GAC5BlQ,KAAKiQ,SAAW,OAGhB,IAAK,IAAI5E,EAAI,EAAGA,EAAIrL,KAAKsB,QAAUtB,KAAKkQ,MAAM7E,GAAK,EAAGA,IACpDrL,KAAKkQ,MAAM7E,IAAM,SACjBrL,KAAKkQ,MAAM7E,EAAI,IAAM,EAIzB,OAAOrL,KAAK0R,SAGd7B,EAAG5P,UAAUsgB,KAAO,SAAe3a,GACjC,OAAO5F,KAAK2E,QAAQqQ,MAAMpP,IAG5BiK,EAAG5P,UAAUugB,KAAO,SAAe5a,GACjC,OAAO5F,KAAK2E,QAAQ2b,MAAM1a,IAG5BiK,EAAG5P,UAAUwgB,KAAO,WAGlB,OAFAzgB,KAAKiQ,SAAW,EAETjQ,MAGT6P,EAAG5P,UAAU6U,IAAM,WACjB,OAAO9U,KAAK2E,QAAQ8b,QAGtB5Q,EAAG5P,UAAUygB,aAAe,SAAuB9a,EAAKiL,EAAK8P,GAC3D,IACItV,EAIAmG,EALApG,EAAMxF,EAAItE,OAASqf,EAGvB3gB,KAAKoS,QAAQhH,GAGb,IAAI2H,EAAQ,EACZ,IAAK1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CAC/BmG,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,EAClC,IAAI9B,GAAwB,EAAfrL,EAAIsK,MAAM7E,IAAUwF,EAEjCkC,IADAvB,GAAa,SAARP,IACS,KAAQA,EAAQ,SAAa,GAC3CjR,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAE1B,KAAOnG,EAAIrL,KAAKsB,OAASqf,EAAOtV,IAE9B0H,GADAvB,GAA6B,EAAxBxR,KAAKkQ,MAAM7E,EAAIsV,IAAc5N,IACrB,GACb/S,KAAKkQ,MAAM7E,EAAIsV,GAAa,SAAJnP,EAG1B,GAAc,IAAVuB,EAAa,OAAO/S,KAAK0R,QAK7B,IAFAtO,GAAkB,IAAX2P,GACPA,EAAQ,EACH1H,EAAI,EAAGA,EAAIrL,KAAKsB,OAAQ+J,IAE3B0H,GADAvB,IAAsB,EAAhBxR,KAAKkQ,MAAM7E,IAAU0H,IACd,GACb/S,KAAKkQ,MAAM7E,GAAS,SAAJmG,EAIlB,OAFAxR,KAAKiQ,SAAW,EAETjQ,KAAK0R,SAGd7B,EAAG5P,UAAU2gB,SAAW,SAAmBhb,EAAKib,GAC9C,IAAIF,GAAQ3gB,KAAKsB,OAASsE,EAAItE,QAE1BsR,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAGJkb,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,GAGf,IADdqf,EAAQ,GADM3gB,KAAKsU,WAAWwM,MAG5BjO,EAAIA,EAAEoN,MAAMU,GACZ/N,EAAEyM,OAAOsB,GACTG,EAA8B,EAAxBjO,EAAE3C,MAAM2C,EAAEvR,OAAS,IAI3B,IACI4S,EADAnV,EAAI6T,EAAEtR,OAASuR,EAAEvR,OAGrB,GAAa,QAATuf,EAAgB,EAClB3M,EAAI,IAAIrE,EAAG,OACTvO,OAASvC,EAAI,EACfmV,EAAEhE,MAAQ,IAAIxO,MAAMwS,EAAE5S,QACtB,IAAK,IAAI+J,EAAI,EAAGA,EAAI6I,EAAE5S,OAAQ+J,IAC5B6I,EAAEhE,MAAM7E,GAAK,EAIjB,IAAI0V,EAAOnO,EAAEjO,QAAQ+b,aAAa7N,EAAG,EAAG9T,GAClB,IAAlBgiB,EAAK9Q,WACP2C,EAAImO,EACA7M,IACFA,EAAEhE,MAAMnR,GAAK,IAIjB,IAAK,IAAIuM,EAAIvM,EAAI,EAAGuM,GAAK,EAAGA,IAAK,CAC/B,IAAI0V,EAAmC,UAAL,EAAxBpO,EAAE1C,MAAM2C,EAAEvR,OAASgK,KACE,EAA5BsH,EAAE1C,MAAM2C,EAAEvR,OAASgK,EAAI,IAO1B,IAHA0V,EAAKlQ,KAAK/D,IAAKiU,EAAKF,EAAO,EAAG,UAE9BlO,EAAE8N,aAAa7N,EAAGmO,EAAI1V,GACA,IAAfsH,EAAE3C,UACP+Q,IACApO,EAAE3C,SAAW,EACb2C,EAAE8N,aAAa7N,EAAG,EAAGvH,GAChBsH,EAAEW,WACLX,EAAE3C,UAAY,GAGdiE,IACFA,EAAEhE,MAAM5E,GAAK0V,GAajB,OAVI9M,GACFA,EAAExC,QAEJkB,EAAElB,QAGW,QAATmP,GAA4B,IAAVF,GACpB/N,EAAEwB,OAAOuM,GAGJ,CACLM,IAAK/M,GAAK,KACVpC,IAAKc,IAQT/C,EAAG5P,UAAUihB,OAAS,SAAiBtb,EAAKib,EAAMM,GAGhD,OAFA/d,GAAQwC,EAAI2N,UAERvT,KAAKuT,SACA,CACL0N,IAAK,IAAIpR,EAAG,GACZiC,IAAK,IAAIjC,EAAG,IAKM,IAAlB7P,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAKib,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGH,QAATuL,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI0E,KAAK5Q,IAIN,CACLqb,IAAKA,EACLnP,IAAKA,IAIa,IAAlB9R,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,UAC7BzN,EAAMxC,KAAKkhB,OAAOtb,EAAI0P,MAAOuL,GAEhB,QAATA,IACFI,EAAMze,EAAIye,IAAI3L,OAGT,CACL2L,IAAKA,EACLnP,IAAKtP,EAAIsP,MAI0B,IAAlC9R,KAAKiQ,SAAWrK,EAAIqK,WACvBzN,EAAMxC,KAAKsV,MAAM4L,OAAOtb,EAAI0P,MAAOuL,GAEtB,QAATA,IACF/O,EAAMtP,EAAIsP,IAAIwD,MACV6L,GAA6B,IAAjBrP,EAAI7B,UAClB6B,EAAI2E,KAAK7Q,IAIN,CACLqb,IAAKze,EAAIye,IACTnP,IAAKA,IAOLlM,EAAItE,OAAStB,KAAKsB,QAAUtB,KAAKkR,IAAItL,GAAO,EACvC,CACLqb,IAAK,IAAIpR,EAAG,GACZiC,IAAK9R,MAKU,IAAf4F,EAAItE,OACO,QAATuf,EACK,CACLI,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,MAII,QAAT+O,EACK,CACLI,IAAK,KACLnP,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7B,CACL+Q,IAAKjhB,KAAKohB,KAAKxb,EAAIsK,MAAM,IACzB4B,IAAK,IAAIjC,EAAG7P,KAAKwT,KAAK5N,EAAIsK,MAAM,MAI7BlQ,KAAK4gB,SAAShb,EAAKib,GAlF1B,IAAII,EAAKnP,EAAKtP,GAsFhBqN,EAAG5P,UAAUghB,IAAM,SAAcrb,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOqb,KAIxCpR,EAAG5P,UAAU6R,IAAM,SAAclM,GAC/B,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAOkM,KAGxCjC,EAAG5P,UAAUohB,KAAO,SAAezb,GACjC,OAAO5F,KAAKkhB,OAAOtb,EAAK,OAAO,GAAMkM,KAIvCjC,EAAG5P,UAAUqhB,SAAW,SAAmB1b,GACzC,IAAI2b,EAAKvhB,KAAKkhB,OAAOtb,GAGrB,GAAI2b,EAAGzP,IAAIyB,SAAU,OAAOgO,EAAGN,IAE/B,IAAInP,EAA0B,IAApByP,EAAGN,IAAIhR,SAAiBsR,EAAGzP,IAAI2E,KAAK7Q,GAAO2b,EAAGzP,IAEpD0P,EAAO5b,EAAIua,MAAM,GACjBsB,EAAK7b,EAAIuO,MAAM,GACfjD,EAAMY,EAAIZ,IAAIsQ,GAGlB,OAAItQ,EAAM,GAAY,IAAPuQ,GAAoB,IAARvQ,EAAkBqQ,EAAGN,IAGrB,IAApBM,EAAGN,IAAIhR,SAAiBsR,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAIjM,MAAM,IAGhEnF,EAAG5P,UAAUuT,KAAO,SAAe5N,GACjCxC,EAAOwC,GAAO,UAId,IAHA,IAAI4J,GAAK,GAAK,IAAM5J,EAEhB8b,EAAM,EACDrW,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IACpCqW,GAAOlS,EAAIkS,GAAuB,EAAhB1hB,KAAKkQ,MAAM7E,KAAWzF,EAG1C,OAAO8b,GAIT7R,EAAG5P,UAAUwT,MAAQ,SAAgB7N,GACnCxC,EAAOwC,GAAO,UAGd,IADA,IAAImN,EAAQ,EACH1H,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAImG,GAAqB,EAAhBxR,KAAKkQ,MAAM7E,IAAkB,SAAR0H,EAC9B/S,KAAKkQ,MAAM7E,GAAMmG,EAAI5L,EAAO,EAC5BmN,EAAQvB,EAAI5L,EAGd,OAAO5F,KAAK0R,SAGd7B,EAAG5P,UAAUmhB,KAAO,SAAexb,GACjC,OAAO5F,KAAK2E,QAAQ8O,MAAM7N,IAG5BiK,EAAG5P,UAAU0hB,KAAO,SAAenS,GACjCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAI2I,EAAIlc,KACJmc,EAAI3M,EAAE7K,QAGRuX,EADiB,IAAfA,EAAEjM,SACAiM,EAAEmF,KAAK7R,GAEP0M,EAAEvX,QAaR,IATA,IAAIid,EAAI,IAAI/R,EAAG,GACXgS,EAAI,IAAIhS,EAAG,GAGXiS,EAAI,IAAIjS,EAAG,GACXkS,EAAI,IAAIlS,EAAG,GAEXmS,EAAI,EAED9F,EAAE+F,UAAY9F,EAAE8F,UACrB/F,EAAE9H,OAAO,GACT+H,EAAE/H,OAAO,KACP4N,EAMJ,IAHA,IAAIE,EAAK/F,EAAExX,QACPwd,EAAKjG,EAAEvX,SAEHuX,EAAE3I,UAAU,CAClB,IAAK,IAAIlI,EAAI,EAAG+W,EAAK,EAAyB,IAArBlG,EAAEhM,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADA6Q,EAAE9H,OAAO/I,GACFA,KAAM,IACPuW,EAAES,SAAWR,EAAEQ,WACjBT,EAAEpL,KAAK0L,GACPL,EAAEpL,KAAK0L,IAGTP,EAAExN,OAAO,GACTyN,EAAEzN,OAAO,GAIb,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBnG,EAAEjM,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADA6Q,EAAE/H,OAAO9I,GACFA,KAAM,IACPwW,EAAEO,SAAWN,EAAEM,WACjBP,EAAEtL,KAAK0L,GACPH,EAAEtL,KAAK0L,IAGTL,EAAE1N,OAAO,GACT2N,EAAE3N,OAAO,GAIT8H,EAAEhL,IAAIiL,IAAM,GACdD,EAAEzF,KAAK0F,GACPyF,EAAEnL,KAAKqL,GACPD,EAAEpL,KAAKsL,KAEP5F,EAAE1F,KAAKyF,GACP4F,EAAErL,KAAKmL,GACPG,EAAEtL,KAAKoL,IAIX,MAAO,CACLjP,EACAC,EAAGkP,EACHQ,IAAKpG,EAAEkD,OAAO2C,KAOlBnS,EAAG5P,UAAUuiB,OAAS,SAAiBhT,GACrCpM,EAAsB,IAAfoM,EAAES,UACT7M,GAAQoM,EAAE+D,UAEV,IAAIX,EAAI5S,KACJ6S,EAAIrD,EAAE7K,QAGRiO,EADiB,IAAfA,EAAE3C,SACA2C,EAAEyO,KAAK7R,GAEPoD,EAAEjO,QAQR,IALA,IAuCInC,EAvCAigB,EAAK,IAAI5S,EAAG,GACZ6S,EAAK,IAAI7S,EAAG,GAEZ8S,EAAQ9P,EAAElO,QAEPiO,EAAEgQ,KAAK,GAAK,GAAK/P,EAAE+P,KAAK,GAAK,GAAG,CACrC,IAAK,IAAIvX,EAAI,EAAG+W,EAAK,EAAyB,IAArBxP,EAAE1C,MAAM,GAAKkS,IAAa/W,EAAI,KAAMA,EAAG+W,IAAO,GACvE,GAAI/W,EAAI,EAEN,IADAuH,EAAEwB,OAAO/I,GACFA,KAAM,GACPoX,EAAGJ,SACLI,EAAGjM,KAAKmM,GAGVF,EAAGrO,OAAO,GAId,IAAK,IAAI9I,EAAI,EAAGgX,EAAK,EAAyB,IAArBzP,EAAE3C,MAAM,GAAKoS,IAAahX,EAAI,KAAMA,EAAGgX,IAAO,GACvE,GAAIhX,EAAI,EAEN,IADAuH,EAAEuB,OAAO9I,GACFA,KAAM,GACPoX,EAAGL,SACLK,EAAGlM,KAAKmM,GAGVD,EAAGtO,OAAO,GAIVxB,EAAE1B,IAAI2B,IAAM,GACdD,EAAE6D,KAAK5D,GACP4P,EAAGhM,KAAKiM,KAER7P,EAAE4D,KAAK7D,GACP8P,EAAGjM,KAAKgM,IAeZ,OATEjgB,EADgB,IAAdoQ,EAAEgQ,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKhH,GAGJhN,GAGTqN,EAAG5P,UAAUsiB,IAAM,SAAc3c,GAC/B,GAAI5F,KAAKuT,SAAU,OAAO3N,EAAIkP,MAC9B,GAAIlP,EAAI2N,SAAU,OAAOvT,KAAK8U,MAE9B,IAAIlC,EAAI5S,KAAK2E,QACTkO,EAAIjN,EAAIjB,QACZiO,EAAE3C,SAAW,EACb4C,EAAE5C,SAAW,EAGb,IAAK,IAAI0Q,EAAQ,EAAG/N,EAAEqP,UAAYpP,EAAEoP,SAAUtB,IAC5C/N,EAAEwB,OAAO,GACTvB,EAAEuB,OAAO,GAGX,OAAG,CACD,KAAOxB,EAAEqP,UACPrP,EAAEwB,OAAO,GAEX,KAAOvB,EAAEoP,UACPpP,EAAEuB,OAAO,GAGX,IAAIzD,EAAIiC,EAAE1B,IAAI2B,GACd,GAAIlC,EAAI,EAAG,CAET,IAAI4D,EAAI3B,EACRA,EAAIC,EACJA,EAAI0B,OACC,GAAU,IAAN5D,GAAyB,IAAdkC,EAAE+P,KAAK,GAC3B,MAGFhQ,EAAE6D,KAAK5D,GAGT,OAAOA,EAAEwM,OAAOsB,IAIlB9Q,EAAG5P,UAAU4iB,KAAO,SAAejd,GACjC,OAAO5F,KAAK2hB,KAAK/b,GAAKgN,EAAEyO,KAAKzb,IAG/BiK,EAAG5P,UAAUgiB,OAAS,WACpB,OAA+B,IAAP,EAAhBjiB,KAAKkQ,MAAM,KAGrBL,EAAG5P,UAAUoiB,MAAQ,WACnB,OAA+B,IAAP,EAAhBriB,KAAKkQ,MAAM,KAIrBL,EAAG5P,UAAUkU,MAAQ,SAAgBvO,GACnC,OAAO5F,KAAKkQ,MAAM,GAAKtK,GAIzBiK,EAAG5P,UAAU6iB,MAAQ,SAAgBxM,GACnClT,EAAsB,iBAARkT,GACd,IAAI3F,EAAI2F,EAAM,GACV6G,GAAK7G,EAAM3F,GAAK,GAChBuD,EAAI,GAAKvD,EAGb,GAAI3Q,KAAKsB,QAAU6b,EAGjB,OAFAnd,KAAKoS,QAAQ+K,EAAI,GACjBnd,KAAKkQ,MAAMiN,IAAMjJ,EACVlU,KAKT,IADA,IAAI+S,EAAQmB,EACH7I,EAAI8R,EAAa,IAAVpK,GAAe1H,EAAIrL,KAAKsB,OAAQ+J,IAAK,CACnD,IAAImG,EAAoB,EAAhBxR,KAAKkQ,MAAM7E,GAEnB0H,GADAvB,GAAKuB,KACS,GACdvB,GAAK,SACLxR,KAAKkQ,MAAM7E,GAAKmG,EAMlB,OAJc,IAAVuB,IACF/S,KAAKkQ,MAAM7E,GAAK0H,EAChB/S,KAAKsB,UAEAtB,MAGT6P,EAAG5P,UAAUsT,OAAS,WACpB,OAAuB,IAAhBvT,KAAKsB,QAAkC,IAAlBtB,KAAKkQ,MAAM,IAGzCL,EAAG5P,UAAU2iB,KAAO,SAAehd,GACjC,IAOIpD,EAPAyN,EAAWrK,EAAM,EAErB,GAAsB,IAAlB5F,KAAKiQ,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBjQ,KAAKiQ,UAAkBA,EAAU,OAAO,EAK5C,GAHAjQ,KAAK0R,QAGD1R,KAAKsB,OAAS,EAChBkB,EAAM,MACD,CACDyN,IACFrK,GAAOA,GAGTxC,EAAOwC,GAAO,SAAW,qBAEzB,IAAI4L,EAAoB,EAAhBxR,KAAKkQ,MAAM,GACnB1N,EAAMgP,IAAM5L,EAAM,EAAI4L,EAAI5L,GAAO,EAAI,EAEvC,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAOTqN,EAAG5P,UAAUiR,IAAM,SAActL,GAC/B,GAAsB,IAAlB5F,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAQ,EACvD,GAAsB,IAAlBjQ,KAAKiQ,UAAmC,IAAjBrK,EAAIqK,SAAgB,OAAO,EAEtD,IAAIzN,EAAMxC,KAAK+iB,KAAKnd,GACpB,OAAsB,IAAlB5F,KAAKiQ,SAA8B,GAANzN,EAC1BA,GAITqN,EAAG5P,UAAU8iB,KAAO,SAAend,GAEjC,GAAI5F,KAAKsB,OAASsE,EAAItE,OAAQ,OAAO,EACrC,GAAItB,KAAKsB,OAASsE,EAAItE,OAAQ,OAAQ,EAGtC,IADA,IAAIkB,EAAM,EACD6I,EAAIrL,KAAKsB,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CACzC,IAAIuH,EAAoB,EAAhB5S,KAAKkQ,MAAM7E,GACfwH,EAAmB,EAAfjN,EAAIsK,MAAM7E,GAElB,GAAIuH,IAAMC,EAAV,CACID,EAAIC,EACNrQ,GAAO,EACEoQ,EAAIC,IACbrQ,EAAM,GAER,OAEF,OAAOA,GAGTqN,EAAG5P,UAAU+iB,IAAM,SAAcpd,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUgjB,GAAK,SAAard,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUijB,KAAO,SAAetd,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUkjB,IAAM,SAAcvd,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUmjB,IAAM,SAAcxd,GAC/B,OAA2B,IAApB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUojB,GAAK,SAAazd,GAC7B,OAA0B,IAAnB5F,KAAKkR,IAAItL,IAGlBiK,EAAG5P,UAAUqjB,KAAO,SAAe1d,GACjC,OAAO5F,KAAK4iB,KAAKhd,IAAQ,GAG3BiK,EAAG5P,UAAUsjB,IAAM,SAAc3d,GAC/B,OAAO5F,KAAKkR,IAAItL,IAAQ,GAG1BiK,EAAG5P,UAAUujB,IAAM,SAAc5d,GAC/B,OAA0B,IAAnB5F,KAAK4iB,KAAKhd,IAGnBiK,EAAG5P,UAAUwjB,GAAK,SAAa7d,GAC7B,OAAyB,IAAlB5F,KAAKkR,IAAItL,IAOlBiK,EAAGM,IAAM,SAAcvK,GACrB,OAAO,IAAI8d,EAAI9d,IAGjBiK,EAAG5P,UAAU0jB,MAAQ,SAAgBC,GAGnC,OAFAxgB,GAAQpD,KAAKmQ,IAAK,yCAClB/M,EAAyB,IAAlBpD,KAAKiQ,SAAgB,iCACrB2T,EAAIC,UAAU7jB,MAAM8jB,UAAUF,IAGvC/T,EAAG5P,UAAU8jB,QAAU,WAErB,OADA3gB,EAAOpD,KAAKmQ,IAAK,wDACVnQ,KAAKmQ,IAAI6T,YAAYhkB,OAG9B6P,EAAG5P,UAAU6jB,UAAY,SAAoBF,GAE3C,OADA5jB,KAAKmQ,IAAMyT,EACJ5jB,MAGT6P,EAAG5P,UAAUgkB,SAAW,SAAmBL,GAEzC,OADAxgB,GAAQpD,KAAKmQ,IAAK,yCACXnQ,KAAK8jB,UAAUF,IAGxB/T,EAAG5P,UAAUikB,OAAS,SAAiBte,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIuG,IAAI1W,KAAM4F,IAG5BiK,EAAG5P,UAAUkkB,QAAU,SAAkBve,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIqG,KAAKxW,KAAM4F,IAG7BiK,EAAG5P,UAAUmkB,OAAS,SAAiBxe,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIwG,IAAI3W,KAAM4F,IAG5BiK,EAAG5P,UAAUokB,QAAU,SAAkBze,GAEvC,OADAxC,EAAOpD,KAAKmQ,IAAK,uCACVnQ,KAAKmQ,IAAIsG,KAAKzW,KAAM4F,IAG7BiK,EAAG5P,UAAUqkB,OAAS,SAAiB1e,GAErC,OADAxC,EAAOpD,KAAKmQ,IAAK,sCACVnQ,KAAKmQ,IAAIoU,IAAIvkB,KAAM4F,IAG5BiK,EAAG5P,UAAUukB,OAAS,SAAiB5e,GAGrC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIU,IAAI7Q,KAAM4F,IAG5BiK,EAAG5P,UAAUykB,QAAU,SAAkB9e,GAGvC,OAFAxC,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIsU,SAASzkB,KAAM4F,GACjB5F,KAAKmQ,IAAIyK,KAAK5a,KAAM4F,IAG7BiK,EAAG5P,UAAU0kB,OAAS,WAGpB,OAFAvhB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+O,IAAIlf,OAGtB6P,EAAG5P,UAAU4kB,QAAU,WAGrB,OAFAzhB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAIgP,KAAKnf,OAIvB6P,EAAG5P,UAAU6kB,QAAU,WAGrB,OAFA1hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI4U,KAAK/kB,OAGvB6P,EAAG5P,UAAU+kB,QAAU,WAGrB,OAFA5hB,EAAOpD,KAAKmQ,IAAK,uCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI0S,KAAK7iB,OAIvB6P,EAAG5P,UAAUglB,OAAS,WAGpB,OAFA7hB,EAAOpD,KAAKmQ,IAAK,sCACjBnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAImF,IAAItV,OAGtB6P,EAAG5P,UAAUilB,OAAS,SAAiBtf,GAGrC,OAFAxC,EAAOpD,KAAKmQ,MAAQvK,EAAIuK,IAAK,qBAC7BnQ,KAAKmQ,IAAIyU,SAAS5kB,MACXA,KAAKmQ,IAAI+B,IAAIlS,KAAM4F,IAI5B,IAAIuf,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQ1lB,EAAM0P,GAErBxP,KAAKF,KAAOA,EACZE,KAAKwP,EAAI,IAAIK,EAAGL,EAAG,IACnBxP,KAAKge,EAAIhe,KAAKwP,EAAEiF,YAChBzU,KAAKgT,EAAI,IAAInD,EAAG,GAAGwP,OAAOrf,KAAKge,GAAGvH,KAAKzW,KAAKwP,GAE5CxP,KAAK0M,IAAM1M,KAAKylB,OAiDlB,SAASC,IACPF,EAAOjlB,KACLP,KACA,OACA,2EA+DJ,SAAS2lB,IACPH,EAAOjlB,KACLP,KACA,OACA,kEAIJ,SAAS4lB,IACPJ,EAAOjlB,KACLP,KACA,OACA,yDAIJ,SAAS6lB,IAEPL,EAAOjlB,KACLP,KACA,QACA,uEA8CJ,SAAS0jB,EAAK3kB,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAI+mB,EAAQjW,EAAGkW,OAAOhnB,GACtBiB,KAAKjB,EAAI+mB,EAAMtW,EACfxP,KAAK8lB,MAAQA,OAEb1iB,EAAOrE,EAAEikB,IAAI,GAAI,kCACjBhjB,KAAKjB,EAAIA,EACTiB,KAAK8lB,MAAQ,KAkOjB,SAASE,EAAMjnB,GACb2kB,EAAInjB,KAAKP,KAAMjB,GAEfiB,KAAK2gB,MAAQ3gB,KAAKjB,EAAE0V,YAChBzU,KAAK2gB,MAAQ,IAAO,IACtB3gB,KAAK2gB,OAAS,GAAM3gB,KAAK2gB,MAAQ,IAGnC3gB,KAAK2Q,EAAI,IAAId,EAAG,GAAGwP,OAAOrf,KAAK2gB,OAC/B3gB,KAAKyhB,GAAKzhB,KAAKimB,KAAKjmB,KAAK2Q,EAAEuO,OAC3Blf,KAAKkmB,KAAOlmB,KAAK2Q,EAAE6R,OAAOxiB,KAAKjB,GAE/BiB,KAAKmmB,KAAOnmB,KAAKkmB,KAAKrV,IAAI7Q,KAAK2Q,GAAG2P,MAAM,GAAGW,IAAIjhB,KAAKjB,GACpDiB,KAAKmmB,KAAOnmB,KAAKmmB,KAAK9E,KAAKrhB,KAAK2Q,GAChC3Q,KAAKmmB,KAAOnmB,KAAK2Q,EAAEgG,IAAI3W,KAAKmmB,MA5a9BX,EAAOvlB,UAAUwlB,KAAO,WACtB,IAAI/Y,EAAM,IAAImD,EAAG,MAEjB,OADAnD,EAAIwD,MAAQ,IAAIxO,MAAMoP,KAAKS,KAAKvR,KAAKge,EAAI,KAClCtR,GAGT8Y,EAAOvlB,UAAUmmB,QAAU,SAAkBxgB,GAG3C,IACIygB,EADA1V,EAAI/K,EAGR,GACE5F,KAAKsN,MAAMqD,EAAG3Q,KAAK0M,KAGnB2Z,GADA1V,GADAA,EAAI3Q,KAAKsmB,MAAM3V,IACT6F,KAAKxW,KAAK0M,MACP+H,kBACF4R,EAAOrmB,KAAKge,GAErB,IAAI9M,EAAMmV,EAAOrmB,KAAKge,GAAK,EAAIrN,EAAEoS,KAAK/iB,KAAKwP,GAgB3C,OAfY,IAAR0B,GACFP,EAAET,MAAM,GAAK,EACbS,EAAErP,OAAS,GACF4P,EAAM,EACfP,EAAE8F,KAAKzW,KAAKwP,QAEIpH,IAAZuI,EAAEe,MAEJf,EAAEe,QAGFf,EAAE4V,SAIC5V,GAGT6U,EAAOvlB,UAAUqN,MAAQ,SAAgBvH,EAAOjD,GAC9CiD,EAAMqO,OAAOpU,KAAKge,EAAG,EAAGlb,IAG1B0iB,EAAOvlB,UAAUqmB,MAAQ,SAAgB1gB,GACvC,OAAOA,EAAIgV,KAAK5a,KAAKgT,IASvBpT,EAAS8lB,EAAMF,GAEfE,EAAKzlB,UAAUqN,MAAQ,SAAgBvH,EAAOygB,GAK5C,IAHA,IAAI3G,EAAO,QAEP4G,EAAS3V,KAAK/D,IAAIhH,EAAMzE,OAAQ,GAC3B+J,EAAI,EAAGA,EAAIob,EAAQpb,IAC1Bmb,EAAOtW,MAAM7E,GAAKtF,EAAMmK,MAAM7E,GAIhC,GAFAmb,EAAOllB,OAASmlB,EAEZ1gB,EAAMzE,QAAU,EAGlB,OAFAyE,EAAMmK,MAAM,GAAK,OACjBnK,EAAMzE,OAAS,GAKjB,IAAIuI,EAAO9D,EAAMmK,MAAM,GAGvB,IAFAsW,EAAOtW,MAAMsW,EAAOllB,UAAYuI,EAAOgW,EAElCxU,EAAI,GAAIA,EAAItF,EAAMzE,OAAQ+J,IAAK,CAClC,IAAIqb,EAAwB,EAAjB3gB,EAAMmK,MAAM7E,GACvBtF,EAAMmK,MAAM7E,EAAI,KAAQqb,EAAO7G,IAAS,EAAMhW,IAAS,GACvDA,EAAO6c,EAET7c,KAAU,GACV9D,EAAMmK,MAAM7E,EAAI,IAAMxB,EACT,IAATA,GAAc9D,EAAMzE,OAAS,GAC/ByE,EAAMzE,QAAU,GAEhByE,EAAMzE,QAAU,GAIpBokB,EAAKzlB,UAAUqmB,MAAQ,SAAgB1gB,GAErCA,EAAIsK,MAAMtK,EAAItE,QAAU,EACxBsE,EAAIsK,MAAMtK,EAAItE,OAAS,GAAK,EAC5BsE,EAAItE,QAAU,EAId,IADA,IAAIwR,EAAK,EACAzH,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAImG,EAAmB,EAAf5L,EAAIsK,MAAM7E,GAClByH,GAAU,IAAJtB,EACN5L,EAAIsK,MAAM7E,GAAU,SAALyH,EACfA,EAAS,GAAJtB,GAAasB,EAAK,SAAa,GAUtC,OANkC,IAA9BlN,EAAIsK,MAAMtK,EAAItE,OAAS,KACzBsE,EAAItE,SAC8B,IAA9BsE,EAAIsK,MAAMtK,EAAItE,OAAS,IACzBsE,EAAItE,UAGDsE,GASThG,EAAS+lB,EAAMH,GAQf5lB,EAASgmB,EAAMJ,GASf5lB,EAASimB,EAAQL,GAEjBK,EAAO5lB,UAAUqmB,MAAQ,SAAgB1gB,GAGvC,IADA,IAAImN,EAAQ,EACH1H,EAAI,EAAGA,EAAIzF,EAAItE,OAAQ+J,IAAK,CACnC,IAAIqJ,EAA0B,IAAL,EAAf9O,EAAIsK,MAAM7E,IAAiB0H,EACjCD,EAAU,SAAL4B,EACTA,KAAQ,GAER9O,EAAIsK,MAAM7E,GAAKyH,EACfC,EAAQ2B,EAKV,OAHc,IAAV3B,IACFnN,EAAIsK,MAAMtK,EAAItE,UAAYyR,GAErBnN,GAITiK,EAAGkW,OAAS,SAAgBjmB,GAE1B,GAAIqlB,EAAOrlB,GAAO,OAAOqlB,EAAOrlB,GAEhC,IAAIgmB,EACJ,GAAa,SAAThmB,EACFgmB,EAAQ,IAAIJ,OACP,GAAa,SAAT5lB,EACTgmB,EAAQ,IAAIH,OACP,GAAa,SAAT7lB,EACTgmB,EAAQ,IAAIF,MACP,IAAa,WAAT9lB,EAGT,MAAM,IAAIb,MAAM,iBAAmBa,GAFnCgmB,EAAQ,IAAID,EAMd,OAFAV,EAAOrlB,GAAQgmB,EAERA,GAkBTpC,EAAIzjB,UAAU2kB,SAAW,SAAmBhS,GAC1CxP,EAAsB,IAAfwP,EAAE3C,SAAgB,iCACzB7M,EAAOwP,EAAEzC,IAAK,oCAGhBuT,EAAIzjB,UAAUwkB,SAAW,SAAmB7R,EAAGC,GAC7CzP,EAAqC,IAA7BwP,EAAE3C,SAAW4C,EAAE5C,UAAiB,iCACxC7M,EAAOwP,EAAEzC,KAAOyC,EAAEzC,MAAQ0C,EAAE1C,IAC1B,oCAGJuT,EAAIzjB,UAAUgmB,KAAO,SAAerT,GAClC,OAAI5S,KAAK8lB,MAAc9lB,KAAK8lB,MAAMM,QAAQxT,GAAGkR,UAAU9jB,MAChD4S,EAAEyO,KAAKrhB,KAAKjB,GAAG+kB,UAAU9jB,OAGlC0jB,EAAIzjB,UAAUqV,IAAM,SAAc1C,GAChC,OAAIA,EAAEW,SACGX,EAAEjO,QAGJ3E,KAAKjB,EAAE4X,IAAI/D,GAAGkR,UAAU9jB,OAGjC0jB,EAAIzjB,UAAUyW,IAAM,SAAc9D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE8D,IAAI7D,GAIhB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUuW,KAAO,SAAe5D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE4D,KAAK3D,GAIjB,OAHIrQ,EAAI0O,IAAIlR,KAAKjB,IAAM,GACrByD,EAAIiU,KAAKzW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAU0W,IAAM,SAAc/D,EAAGC,GACnC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE+D,IAAI9D,GAIhB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,EAAIshB,UAAU9jB,OAGvB0jB,EAAIzjB,UAAUwW,KAAO,SAAe7D,EAAGC,GACrC7S,KAAKykB,SAAS7R,EAAGC,GAEjB,IAAIrQ,EAAMoQ,EAAE6D,KAAK5D,GAIjB,OAHIrQ,EAAIogB,KAAK,GAAK,GAChBpgB,EAAIgU,KAAKxW,KAAKjB,GAETyD,GAGTkhB,EAAIzjB,UAAUskB,IAAM,SAAc3R,EAAGhN,GAEnC,OADA5F,KAAK4kB,SAAShS,GACP5S,KAAKimB,KAAKrT,EAAEqN,MAAMra,KAG3B8d,EAAIzjB,UAAU2a,KAAO,SAAehI,EAAGC,GAErC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAEgI,KAAK/H,KAG1B6Q,EAAIzjB,UAAU4Q,IAAM,SAAc+B,EAAGC,GAEnC,OADA7S,KAAKykB,SAAS7R,EAAGC,GACV7S,KAAKimB,KAAKrT,EAAE/B,IAAIgC,KAGzB6Q,EAAIzjB,UAAUkf,KAAO,SAAevM,GAClC,OAAO5S,KAAK4a,KAAKhI,EAAGA,EAAEjO,UAGxB+e,EAAIzjB,UAAUif,IAAM,SAActM,GAChC,OAAO5S,KAAK6Q,IAAI+B,EAAGA,IAGrB8Q,EAAIzjB,UAAU8kB,KAAO,SAAenS,GAClC,GAAIA,EAAEW,SAAU,OAAOX,EAAEjO,QAEzB,IAAIgiB,EAAO3mB,KAAKjB,EAAEoV,MAAM,GAIxB,GAHA/Q,EAAOujB,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAIzU,EAAMlS,KAAKjB,EAAE2X,IAAI,IAAI7G,EAAG,IAAIuE,OAAO,GACvC,OAAOpU,KAAKkS,IAAIU,EAAGV,GAQrB,IAFA,IAAIgC,EAAIlU,KAAKjB,EAAEyhB,KAAK,GAChBrD,EAAI,GACAjJ,EAAEX,UAA2B,IAAfW,EAAEC,MAAM,IAC5BgJ,IACAjJ,EAAEE,OAAO,GAEXhR,GAAQ8Q,EAAEX,UAEV,IAAIqT,EAAM,IAAI/W,EAAG,GAAG8T,MAAM3jB,MACtB6mB,EAAOD,EAAI3B,SAIX6B,EAAO9mB,KAAKjB,EAAEyhB,KAAK,GAAGpM,OAAO,GAC7B2S,EAAI/mB,KAAKjB,EAAE0V,YAGf,IAFAsS,EAAI,IAAIlX,EAAG,EAAIkX,EAAIA,GAAGpD,MAAM3jB,MAEW,IAAhCA,KAAKkS,IAAI6U,EAAGD,GAAM5V,IAAI2V,IAC3BE,EAAE5C,QAAQ0C,GAOZ,IAJA,IAAIrW,EAAIxQ,KAAKkS,IAAI6U,EAAG7S,GAChBvD,EAAI3Q,KAAKkS,IAAIU,EAAGsB,EAAEqM,KAAK,GAAGnM,OAAO,IACjCG,EAAIvU,KAAKkS,IAAIU,EAAGsB,GAChBnV,EAAIoe,EACc,IAAf5I,EAAErD,IAAI0V,IAAY,CAEvB,IADA,IAAIla,EAAM6H,EACDlJ,EAAI,EAAoB,IAAjBqB,EAAIwE,IAAI0V,GAAYvb,IAClCqB,EAAMA,EAAIiY,SAEZvhB,EAAOiI,EAAItM,GACX,IAAI8T,EAAI7S,KAAKkS,IAAI1B,EAAG,IAAIX,EAAG,GAAGwP,OAAOtgB,EAAIsM,EAAI,IAE7CsF,EAAIA,EAAE6T,OAAO3R,GACbrC,EAAIqC,EAAE8R,SACNpQ,EAAIA,EAAEiQ,OAAOhU,GACbzR,EAAIsM,EAGN,OAAOsF,GAGT+S,EAAIzjB,UAAU4iB,KAAO,SAAejQ,GAClC,IAAIoU,EAAMpU,EAAE4P,OAAOxiB,KAAKjB,GACxB,OAAqB,IAAjBioB,EAAI/W,UACN+W,EAAI/W,SAAW,EACRjQ,KAAKimB,KAAKe,GAAK/B,UAEfjlB,KAAKimB,KAAKe,IAIrBtD,EAAIzjB,UAAUiS,IAAM,SAAcU,EAAGhN,GACnC,GAAIA,EAAI2N,SAAU,OAAO,IAAI1D,EAAG,GAAG8T,MAAM3jB,MACzC,GAAoB,IAAhB4F,EAAIgd,KAAK,GAAU,OAAOhQ,EAAEjO,QAEhC,IACIsiB,EAAM,IAAIvlB,MAAM,IACpBulB,EAAI,GAAK,IAAIpX,EAAG,GAAG8T,MAAM3jB,MACzBinB,EAAI,GAAKrU,EACT,IAAK,IAAIvH,EAAI,EAAGA,EAAI4b,EAAI3lB,OAAQ+J,IAC9B4b,EAAI5b,GAAKrL,KAAK6Q,IAAIoW,EAAI5b,EAAI,GAAIuH,GAGhC,IAAIpQ,EAAMykB,EAAI,GACVC,EAAU,EACVC,EAAa,EACbtgB,EAAQjB,EAAI6O,YAAc,GAK9B,IAJc,IAAV5N,IACFA,EAAQ,IAGLwE,EAAIzF,EAAItE,OAAS,EAAG+J,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAI0G,EAAOnM,EAAIsK,MAAM7E,GACZC,EAAIzE,EAAQ,EAAGyE,GAAK,EAAGA,IAAK,CACnC,IAAIgL,EAAOvE,GAAQzG,EAAK,EACpB9I,IAAQykB,EAAI,KACdzkB,EAAMxC,KAAKkf,IAAI1c,IAGL,IAAR8T,GAAyB,IAAZ4Q,GAKjBA,IAAY,EACZA,GAAW5Q,GA9BE,KA+Bb6Q,GACwC,IAAN9b,GAAiB,IAANC,KAE7C9I,EAAMxC,KAAK6Q,IAAIrO,EAAKykB,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,EAajBtgB,EAAQ,GAGV,OAAOrE,GAGTkhB,EAAIzjB,UAAU4jB,UAAY,SAAoBje,GAC5C,IAAI+K,EAAI/K,EAAIyb,KAAKrhB,KAAKjB,GAEtB,OAAO4R,IAAM/K,EAAM+K,EAAEhM,QAAUgM,GAGjC+S,EAAIzjB,UAAU+jB,YAAc,SAAsBpe,GAChD,IAAIpD,EAAMoD,EAAIjB,QAEd,OADAnC,EAAI2N,IAAM,KACH3N,GAOTqN,EAAGuX,KAAO,SAAexhB,GACvB,OAAO,IAAIogB,EAAKpgB,IAmBlBhG,EAASomB,EAAMtC,GAEfsC,EAAK/lB,UAAU4jB,UAAY,SAAoBje,GAC7C,OAAO5F,KAAKimB,KAAKrgB,EAAIqa,MAAMjgB,KAAK2gB,SAGlCqF,EAAK/lB,UAAU+jB,YAAc,SAAsBpe,GACjD,IAAI+K,EAAI3Q,KAAKimB,KAAKrgB,EAAIiL,IAAI7Q,KAAKkmB,OAE/B,OADAvV,EAAER,IAAM,KACDQ,GAGTqV,EAAK/lB,UAAU2a,KAAO,SAAehI,EAAGC,GACtC,GAAID,EAAEW,UAAYV,EAAEU,SAGlB,OAFAX,EAAE1C,MAAM,GAAK,EACb0C,EAAEtR,OAAS,EACJsR,EAGT,IAAI2B,EAAI3B,EAAEgI,KAAK/H,GACXrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAQV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4Q,IAAM,SAAc+B,EAAGC,GACpC,GAAID,EAAEW,UAAYV,EAAEU,SAAU,OAAO,IAAI1D,EAAG,GAAGiU,UAAU9jB,MAEzD,IAAIuU,EAAI3B,EAAE/B,IAAIgC,GACVrC,EAAI+D,EAAE8L,MAAMrgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKmmB,MAAM/F,OAAOpgB,KAAK2gB,OAAO9P,IAAI7Q,KAAKjB,GACnEsoB,EAAI9S,EAAEkC,KAAKjG,GAAG4D,OAAOpU,KAAK2gB,OAC1Bne,EAAM6kB,EAOV,OANIA,EAAEnW,IAAIlR,KAAKjB,IAAM,EACnByD,EAAM6kB,EAAE5Q,KAAKzW,KAAKjB,GACTsoB,EAAEzE,KAAK,GAAK,IACrBpgB,EAAM6kB,EAAE7Q,KAAKxW,KAAKjB,IAGbyD,EAAIshB,UAAU9jB,OAGvBgmB,EAAK/lB,UAAU4iB,KAAO,SAAejQ,GAGnC,OADU5S,KAAKimB,KAAKrT,EAAE4P,OAAOxiB,KAAKjB,GAAG8R,IAAI7Q,KAAKyhB,KACnCqC,UAAU9jB,OAn3GzB,YAq3G4CA,sBCr3G5C,IAAIqkD,EAAY,EAAQ,KACpBu/E,EAAM,EAAQ,MACd3tH,EAAM,EAAQ,MACdpG,EAAK,EAAQ,MACbwyC,EAAM,EAAQ,MACdc,EAAa,EAAQ,MACrB0gF,EAAa,EAAQ,MACrB3iI,EAAS,eAEbzC,EAAOC,QAAU,SAAyB6mD,EAAY9kD,EAAK6J,GACzD,IAAI8I,EAEFA,EADEmyC,EAAWnyC,QACHmyC,EAAWnyC,QACZ9I,EACC,EAEA,EAGZ,IAKIb,EALApF,EAAMggD,EAAUkB,GAChBvyC,EAAI3O,EAAI69C,QAAQngD,aACpB,GAAItB,EAAIa,OAAS0R,GAAK,IAAInD,EAAGpP,GAAKyQ,IAAI7M,EAAI69C,UAAY,EACpD,MAAM,IAAIjjD,MAAM,oBAIhBwK,EADEa,EACIu5H,EAAW,IAAIh0H,EAAGpP,GAAM4D,GAExBg+C,EAAI5hD,EAAK4D,GAEjB,IAAIy/H,EAAU5iI,EAAO6B,MAAMiQ,EAAIvJ,EAAInI,QAEnC,GADAmI,EAAMvI,EAAOqC,OAAO,CAACugI,EAASr6H,GAAMuJ,GACpB,IAAZI,EACF,OAUJ,SAAe/O,EAAKoF,GAClB,IAAIuJ,EAAI3O,EAAI69C,QAAQngD,aAChBgiI,EAAQ5gF,EAAW,QAAQ/R,OAAOlwC,EAAO6B,MAAM,IAAIkhD,SACnDm/E,EAAOW,EAAMziI,OACjB,GAAe,IAAXmI,EAAI,GACN,MAAM,IAAIxK,MAAM,oBAElB,IAAI+kI,EAAav6H,EAAI7G,MAAM,EAAGwgI,EAAO,GACjCa,EAAWx6H,EAAI7G,MAAMwgI,EAAO,GAC5Bt5B,EAAO7zF,EAAI+tH,EAAYJ,EAAIK,EAAUb,IACrCt4B,EAAK70F,EAAIguH,EAAUL,EAAI95B,EAAM92F,EAAIowH,EAAO,IAC5C,GAoCF,SAAkBxwH,EAAGC,GACnBD,EAAI1R,EAAO2M,KAAK+E,GAChBC,EAAI3R,EAAO2M,KAAKgF,GAChB,IAAIqxH,EAAM,EACN94H,EAAMwH,EAAEtR,OACRsR,EAAEtR,SAAWuR,EAAEvR,SACjB4iI,IACA94H,EAAM0F,KAAK/D,IAAI6F,EAAEtR,OAAQuR,EAAEvR,SAG7B,IADA,IAAI+J,GAAK,IACAA,EAAID,GACX84H,GAAQtxH,EAAEvH,GAAKwH,EAAExH,GAEnB,OAAO64H,EAjDHptG,CAAQitG,EAAOj5B,EAAGloG,MAAM,EAAGwgI,IAC7B,MAAM,IAAInkI,MAAM,oBAGlB,IADA,IAAIoM,EAAI+3H,EACS,IAAVt4B,EAAGz/F,IACRA,IAEF,GAAgB,IAAZy/F,EAAGz/F,KACL,MAAM,IAAIpM,MAAM,oBAElB,OAAO6rG,EAAGloG,MAAMyI,GA/BP84H,CAAK9/H,EAAKoF,GACZ,GAAgB,IAAZ2J,EACT,OAgCJ,SAAgB/O,EAAKoF,EAAKa,GAIxB,IAHA,IAAI0jF,EAAKvkF,EAAI7G,MAAM,EAAG,GAClByI,EAAI,EACJmiH,EAAS,EACO,IAAb/jH,EAAI4B,MACT,GAAIA,GAAK5B,EAAInI,OAAQ,CACnBksH,IACA,MAGJ,IAAI4W,EAAK36H,EAAI7G,MAAM,EAAGyI,EAAI,GAQ1B,IAN4B,SAAvB2iF,EAAG/hF,SAAS,SAAsB3B,GAAoC,SAAvB0jF,EAAG/hF,SAAS,QAAqB3B,IACnFkjH,IAEE4W,EAAG9iI,OAAS,GACdksH,IAEEA,EACF,MAAM,IAAIvuH,MAAM,oBAElB,OAAOwK,EAAI7G,MAAMyI,GArDRg5H,CAAMhgI,EAAKoF,EAAKa,GAClB,GAAgB,IAAZ8I,EACT,OAAO3J,EAEP,MAAM,IAAIxK,MAAM,oCCvCpB,IAAIolD,EAAY,EAAQ,KACpBzL,EAAc,EAAQ,MACtBuK,EAAa,EAAQ,MACrBygF,EAAM,EAAQ,MACd3tH,EAAM,EAAQ,MACdpG,EAAK,EAAQ,MACbg0H,EAAa,EAAQ,MACrBxhF,EAAM,EAAQ,MACdnhD,EAAS,eAEbzC,EAAOC,QAAU,SAAwBi1G,EAAWlqG,EAAKa,GACvD,IAAI8I,EAEFA,EADEugG,EAAUvgG,QACFugG,EAAUvgG,QACX9I,EACC,EAEA,EAEZ,IACIg6H,EADAjgI,EAAMggD,EAAUsvD,GAEpB,GAAgB,IAAZvgG,EACFkxH,EAkBJ,SAAejgI,EAAKoF,GAClB,IAAIuJ,EAAI3O,EAAI69C,QAAQngD,aAChBwsG,EAAO9kG,EAAInI,OACXyiI,EAAQ5gF,EAAW,QAAQ/R,OAAOlwC,EAAO6B,MAAM,IAAIkhD,SACnDm/E,EAAOW,EAAMziI,OACbijI,EAAQ,EAAInB,EAChB,GAAI70B,EAAOv7F,EAAIuxH,EAAQ,EACrB,MAAM,IAAItlI,MAAM,oBAElB,IAAImlI,EAAKljI,EAAO6B,MAAMiQ,EAAIu7F,EAAOg2B,EAAQ,GACrCC,EAAQxxH,EAAIowH,EAAO,EACnBt5B,EAAOlxD,EAAYwqF,GACnBa,EAAWhuH,EAAI/U,EAAOqC,OAAO,CAACwgI,EAAOK,EAAIljI,EAAO6B,MAAM,EAAG,GAAI0G,GAAM+6H,GAAQZ,EAAI95B,EAAM06B,IACrFR,EAAa/tH,EAAI6zF,EAAM85B,EAAIK,EAAUb,IACzC,OAAO,IAAIvzH,EAAG3O,EAAOqC,OAAO,CAACrC,EAAO6B,MAAM,GAAIihI,EAAYC,GAAWjxH,IAhCvDmxH,CAAK9/H,EAAKoF,QACjB,GAAgB,IAAZ2J,EACTkxH,EAgCJ,SAAgBjgI,EAAKoF,EAAKa,GACxB,IAKI85H,EALA71B,EAAO9kG,EAAInI,OACX0R,EAAI3O,EAAI69C,QAAQngD,aACpB,GAAIwsG,EAAOv7F,EAAI,GACb,MAAM,IAAI/T,MAAM,oBAQlB,OAJEmlI,EADE95H,EACGpJ,EAAO6B,MAAMiQ,EAAIu7F,EAAO,EAAG,KAMpC,SAAkBnjG,GAMhB,IALA,IAIIxF,EAJA9C,EAAM5B,EAAOkpC,YAAYh/B,GACzBC,EAAI,EACJ9M,EAAQq6C,EAAkB,EAANxtC,GACpBgnB,EAAM,EAEH/mB,EAAID,GACLgnB,IAAQ7zB,EAAM+C,SAChB/C,EAAQq6C,EAAkB,EAANxtC,GACpBgnB,EAAM,IAERxsB,EAAMrH,EAAM6zB,QAEVtvB,EAAIuI,KAAOzF,GAGf,OAAO9C,EApBA2hI,CAAQzxH,EAAIu7F,EAAO,GAEnB,IAAI1+F,EAAG3O,EAAOqC,OAAO,CAACrC,EAAO2M,KAAK,CAAC,EAAGvD,EAAU,EAAI,IAAK85H,EAAIljI,EAAO6B,MAAM,GAAI0G,GAAMuJ,IA5C7EqxH,CAAMhgI,EAAKoF,EAAKa,OACvB,IAAgB,IAAZ8I,EAMT,MAAM,IAAInU,MAAM,mBAJhB,IADAqlI,EAAY,IAAIz0H,EAAGpG,IACLyH,IAAI7M,EAAI69C,UAAY,EAChC,MAAM,IAAIjjD,MAAM,6BAKpB,OAAIqL,EACK+3C,EAAIiiF,EAAWjgI,GAEfw/H,EAAWS,EAAWjgI,oBCpCjC,IAAIwL,EAAK,EAAQ,MACb3O,EAAS,eAUbzC,EAAOC,QARP,SAAqB4lI,EAAWjgI,GAC9B,OAAOnD,EAAO2M,KAAKy2H,EAChB3gH,MAAM9T,EAAGuX,KAAK/iB,EAAI69C,UAClBh9B,OAAO,IAAIrV,EAAGxL,EAAIm+C,iBAClBz+B,UACA7U,sBCRLzQ,EAAOC,QAAU,SAAckU,EAAGC,GAGhC,IAFA,IAAIzH,EAAMwH,EAAEtR,OACR+J,GAAK,IACAA,EAAID,GACXwH,EAAEvH,IAAMwH,EAAExH,GAEZ,OAAOuH,iCCNL4xB,EAAO,EAAQ,KACf8yD,EAAM,EAAQ,MACd2mC,EAAK,EAAQ,MAEbl4F,EAAO,aACP2+F,EAAU,SAASr9H,KAAKwiB,EAAQy8D,SAEhCq+C,EAAO,SAAU17G,GACnB,MAAqB,mBAAPA,GAaZ27G,EAAY,SAAU/kG,EAAQglG,EAASC,EAAShkG,GAClDA,EAAW0D,EAAK1D,GAEhB,IAAI0pE,GAAS,EACb3qE,EAAO6E,GAAG,SAAS,WACjB8lE,GAAS,KAGXlT,EAAIz3D,EAAQ,CAAColC,SAAU4/D,EAASp3G,SAAUq3G,IAAU,SAAU/6H,GAC5D,GAAIA,EAAK,OAAO+2B,EAAS/2B,GACzBygG,GAAS,EACT1pE,OAGF,IAAIqC,GAAY,EAChB,OAAO,SAAUp5B,GACf,IAAIygG,IACArnE,EAGJ,OAFAA,GAAY,EA5BL,SAAUtD,GACnB,QAAK6kG,KACAzG,IACGp+F,aAAmBo+F,EAAG8G,YAAch/F,IAASlG,aAAmBo+F,EAAG+G,aAAej/F,KAAU4+F,EAAK9kG,EAAO+nB,OA2B1Gq9E,CAAKplG,GAAgBA,EAAO+nB,MAAM7hB,GAxB1B,SAAUlG,GACxB,OAAOA,EAAOq4D,WAAaysC,EAAK9kG,EAAOs4D,OAwBjCC,CAAUv4D,GAAgBA,EAAOs4D,QAEjCwsC,EAAK9kG,EAAO2F,SAAiB3F,EAAO2F,eAExC1E,EAAS/2B,GAAO,IAAI9K,MAAM,2BAI1BsB,EAAO,SAAU0oB,GACnBA,KAGEk8C,EAAO,SAAUt3D,EAAM4qF,GACzB,OAAO5qF,EAAKs3D,KAAKszB,IA0BnBh6F,EAAOC,QAvBI,WACT,IAMI6C,EANAglE,EAAU7kE,MAAMzB,UAAU2C,MAAMrC,KAAK0E,WACrC67B,EAAW6jG,EAAKp+D,EAAQA,EAAQjlE,OAAS,IAAMykC,IAASwgC,EAAQx0C,OAASgU,EAG7E,GADIrkC,MAAMC,QAAQ4kE,EAAQ,MAAKA,EAAUA,EAAQ,IAC7CA,EAAQjlE,OAAS,EAAG,MAAM,IAAIrC,MAAM,yCAGxC,IAAIimI,EAAW3+D,EAAQ3kE,KAAI,SAAUi+B,EAAQx0B,GAC3C,IAAIw5H,EAAUx5H,EAAIk7D,EAAQjlE,OAAS,EAEnC,OAAOsjI,EAAU/kG,EAAQglG,EADXx5H,EAAI,GACyB,SAAUtB,GAC9CxI,IAAOA,EAAQwI,GAChBA,GAAKm7H,EAASliI,QAAQzC,GACtBskI,IACJK,EAASliI,QAAQzC,GACjBugC,EAASv/B,UAIb,OAAOglE,EAAQnoC,OAAO+mC,2BCpDxB,SAASzkE,EAAewD,EAAKW,GAC3B,OAAOW,OAAOvF,UAAUS,eAAeH,KAAK2D,EAAKW,GAGnDpG,EAAOC,QAAU,SAASymI,EAAI1oG,EAAKhZ,EAAI5iB,GACrC47B,EAAMA,GAAO,IACbhZ,EAAKA,GAAM,IACX,IAAIvf,EAAM,GAEV,GAAkB,iBAAPihI,GAAiC,IAAdA,EAAG7jI,OAC/B,OAAO4C,EAGT,IAAIinE,EAAS,MACbg6D,EAAKA,EAAG73H,MAAMmvB,GAEd,IAAI2oG,EAAU,IACVvkI,GAAsC,iBAApBA,EAAQukI,UAC5BA,EAAUvkI,EAAQukI,SAGpB,IAAIh6H,EAAM+5H,EAAG7jI,OAET8jI,EAAU,GAAKh6H,EAAMg6H,IACvBh6H,EAAMg6H,GAGR,IAAK,IAAI/5H,EAAI,EAAGA,EAAID,IAAOC,EAAG,CAC5B,IAEIg6H,EAAMC,EAAMtyH,EAAG+lC,EAFf78B,EAAIipH,EAAG95H,GAAGuC,QAAQu9D,EAAQ,OAC1B9sC,EAAMniB,EAAEkR,QAAQ3J,GAGhB4a,GAAO,GACTgnG,EAAOnpH,EAAEgY,OAAO,EAAGmK,GACnBinG,EAAOppH,EAAEgY,OAAOmK,EAAM,KAEtBgnG,EAAOnpH,EACPopH,EAAO,IAGTtyH,EAAIqsF,mBAAmBgmC,GACvBtsF,EAAIsmD,mBAAmBimC,GAElB5kI,EAAewD,EAAK8O,GAEdtR,MAAMC,QAAQuC,EAAI8O,IAC3B9O,EAAI8O,GAAGjO,KAAKg0C,GAEZ70C,EAAI8O,GAAK,CAAC9O,EAAI8O,GAAI+lC,GAJlB70C,EAAI8O,GAAK+lC,EAQb,OAAO70C,0BCvDT,IAAIqhI,EAAqB,SAASxsF,GAChC,cAAeA,GACb,IAAK,SACH,OAAOA,EAET,IAAK,UACH,OAAOA,EAAI,OAAS,QAEtB,IAAK,SACH,OAAO5Z,SAAS4Z,GAAKA,EAAI,GAE3B,QACE,MAAO,KAIbt6C,EAAOC,QAAU,SAASwF,EAAKu4B,EAAKhZ,EAAI3jB,GAOtC,OANA28B,EAAMA,GAAO,IACbhZ,EAAKA,GAAM,IACC,OAARvf,IACFA,OAAMkE,GAGW,iBAARlE,EACFsB,OAAOC,KAAKvB,GAAKtC,KAAI,SAASoR,GACnC,IAAIwyH,EAAKjmC,mBAAmBgmC,EAAmBvyH,IAAMyQ,EACrD,OAAI/hB,MAAMC,QAAQuC,EAAI8O,IACb9O,EAAI8O,GAAGpR,KAAI,SAASm3C,GACzB,OAAOysF,EAAKjmC,mBAAmBgmC,EAAmBxsF,OACjDl2C,KAAK45B,GAED+oG,EAAKjmC,mBAAmBgmC,EAAmBrhI,EAAI8O,QAEvDnQ,KAAK45B,GAIL38B,EACEy/F,mBAAmBgmC,EAAmBzlI,IAAS2jB,EAC/C87E,mBAAmBgmC,EAAmBrhI,IAF3B,iCC1DpBxF,EAAQiC,OAASjC,EAAQ8/B,MAAQ,EAAhB,MACjB9/B,EAAQqC,OAASrC,EAAQmK,UAAY,EAApB,sBCFjB,IAAIokG,EAEJxuG,EAAOC,QAAoC,mBAAnBqwC,eACpBA,eAAe/kB,KAAuB,oBAAX3Z,OAAyBA,OAAS,EAAA2R,GAE7D+mB,IAAOkkE,IAAYA,EAAUzhF,QAAQC,YACpCL,KAAK2d,GACL1d,OAAMthB,GAAOo7B,YAAW,KAAQ,MAAMp7B,IAAO,eCRlDtL,EAAOC,QAAoC,mBAAnBqwC,eAAgCA,eAAkB9lB,GAAOuC,QAAQC,UAAUL,KAAKnC,aCkBxGxqB,EAAOC,QAlBO,SAAUw9B,GACtB,IAAI76B,EAAS,EACb,OAAO,WACL,GAAIA,IAAW66B,EAAK56B,OAAQ,OAAO,KAEnC,IAAI8J,EAAM8wB,EAAK56B,OAASD,EACpBgK,EAAKyF,KAAKw1B,SAAWl7B,EAAO,EAC5Bk9F,EAAKpsE,EAAK76B,EAASgK,GAEnBqB,EAAMwvB,EAAK76B,GAKf,OAJA66B,EAAK76B,GAAUinG,EACfpsE,EAAK76B,EAASgK,GAAKqB,EACnBrL,IAEOinG,+CCVPm9B,EAAY,MAUZvkI,EAAS,eACTs+B,EAAS,EAAAxd,EAAOwd,QAAU,EAAAxd,EAAO22B,SAEjCnZ,GAAUA,EAAOkZ,gBACnBj6C,EAAOC,QAKT,SAAsBE,EAAMmqC,GAE1B,GAAInqC,EAjBW,WAiBQ,MAAM,IAAIy1B,WAAW,mCAE5C,IAAI3xB,EAAQxB,EAAOkpC,YAAYxrC,GAE/B,GAAIA,EAAO,EACT,GAAIA,EAAO6mI,EAET,IAAK,IAAIC,EAAY,EAAGA,EAAY9mI,EAAM8mI,GAAaD,EAGrDjmG,EAAOkZ,gBAAgBh2C,EAAME,MAAM8iI,EAAWA,EAAYD,SAG5DjmG,EAAOkZ,gBAAgBh2C,GAI3B,MAAkB,mBAAPqmC,EACFlf,EAAQs/B,UAAS,WACtBpgB,EAAG,KAAMrmC,MAINA,GA5BPjE,EAAOC,QAVT,WACE,MAAM,IAAIO,MAAM,8JCTlB,SAAS0mI,IACP,MAAM,IAAI1mI,MAAM,8GAElB,IAAI2mI,EAAa,EAAQ,MACrBlmG,EAAc,EAAQ,MACtBx+B,EAAS0kI,EAAW1kI,OACpB2kI,EAAmBD,EAAW76E,WAC9BvrB,EAAS,EAAAxd,EAAOwd,QAAU,EAAAxd,EAAO22B,SACjCmtF,EAAah1H,KAAKoB,IAAI,EAAG,IAAM,EACnC,SAAS6zH,EAAc1kI,EAAQC,GAC7B,GAAsB,iBAAXD,GAAuBA,GAAWA,EAC3C,MAAM,IAAIwpB,UAAU,2BAGtB,GAAIxpB,EAASykI,GAAczkI,EAAS,EAClC,MAAM,IAAIwpB,UAAU,2BAGtB,GAAIxpB,EAASwkI,GAAoBxkI,EAASC,EACxC,MAAM,IAAI+yB,WAAW,uBAIzB,SAASy9B,EAAYlzD,EAAMyC,EAAQC,GACjC,GAAoB,iBAAT1C,GAAqBA,GAASA,EACvC,MAAM,IAAIisB,UAAU,yBAGtB,GAAIjsB,EAAOknI,GAAclnI,EAAO,EAC9B,MAAM,IAAIisB,UAAU,yBAGtB,GAAIjsB,EAAOyC,EAASC,GAAU1C,EAAOinI,EACnC,MAAM,IAAIxxG,WAAW,oBA8BzB,SAAS2xG,EAAYh7H,EAAK3J,EAAQzC,EAAMmqC,GACtC,GAAIlf,EAAQylB,QAAS,CACnB,IAAI22F,EAASj7H,EAAIO,OACb26H,EAAO,IAAIvuG,WAAWsuG,EAAQ5kI,EAAQzC,GAE1C,OADA4gC,EAAOkZ,gBAAgBwtF,GACnBn9F,OACFlf,EAAQs/B,UAAS,WACfpgB,EAAG,KAAM/9B,MAINA,EAET,IAAI+9B,EAYJ,OAFYrJ,EAAY9gC,GAClBsE,KAAK8H,EAAK3J,GACT2J,EAXL00B,EAAY9gC,GAAM,SAAUmL,EAAKrH,GAC/B,GAAIqH,EACF,OAAOg/B,EAAGh/B,GAEZrH,EAAMQ,KAAK8H,EAAK3J,GAChB0nC,EAAG,KAAM/9B,MA9CVw0B,GAAUA,EAAOkZ,kBAAqB7uB,EAAQylB,SACjD5wC,EAAQ8pE,WAMV,SAAqBx9D,EAAK3J,EAAQzC,EAAMmqC,GACtC,KAAK7nC,EAAOE,SAAS4J,IAAUA,aAAe,EAAAgX,EAAO2V,YACnD,MAAM,IAAI9M,UAAU,iDAGtB,GAAsB,mBAAXxpB,EACT0nC,EAAK1nC,EACLA,EAAS,EACTzC,EAAOoM,EAAI1J,YACN,GAAoB,mBAAT1C,EAChBmqC,EAAKnqC,EACLA,EAAOoM,EAAI1J,OAASD,OACf,GAAkB,mBAAP0nC,EAChB,MAAM,IAAIle,UAAU,oCAItB,OAFAk7G,EAAa1kI,EAAQ2J,EAAI1J,QACzBwwD,EAAWlzD,EAAMyC,EAAQ2J,EAAI1J,QACtB0kI,EAAWh7H,EAAK3J,EAAQzC,EAAMmqC,IAtBrCrqC,EAAQ+pE,eAoDV,SAAyBz9D,EAAK3J,EAAQzC,GAIpC,QAHsB,IAAXyC,IACTA,EAAS,KAENH,EAAOE,SAAS4J,IAAUA,aAAe,EAAAgX,EAAO2V,YACnD,MAAM,IAAI9M,UAAU,iDAStB,OANAk7G,EAAa1kI,EAAQ2J,EAAI1J,aAEZ8G,IAATxJ,IAAoBA,EAAOoM,EAAI1J,OAASD,GAE5CywD,EAAWlzD,EAAMyC,EAAQ2J,EAAI1J,QAEtB0kI,EAAWh7H,EAAK3J,EAAQzC,MAhE/BF,EAAQ8pE,WAAam9D,EACrBjnI,EAAQ+pE,eAAiBk9D,0BCkF3B,SAASQ,EAAchoG,EAAOv0B,GAC5B,MAAO,CACL/C,MAAOs3B,EAAMt3B,MACb6G,IAAKywB,EAAMzwB,IACX9D,MAAOA,GASX,SAASw8H,EAAiBjoG,GACxB,MAAO,CACLt3B,MAAOs3B,EAAMt3B,MACb6G,IAAKywB,EAAMzwB,KASf,SAAS24H,EAAkBzzH,EAAGC,GAC5B,OAAOD,EAAEhJ,MAAQiJ,EAAEjJ,MAQrB,SAAS08H,EAAkB1zH,EAAGC,GAC5B,OAAOD,EAAE/L,MAAQgM,EAAEhM,MAlJrBpI,EAAOC,QAYP,SAAsBE,EAAMyK,EAAKxI,GAC/B,GAAmB,iBAARwI,EACT,MAAM,IAAIwhB,UAAU,iCAGtB,IAAIjhB,EAAQP,EAAI+jB,QAAQ,KAExB,IAAe,IAAXxjB,EACF,OAAQ,EAIV,IAAI2qB,EAAMlrB,EAAIzG,MAAMgH,EAAQ,GAAG0D,MAAM,KACjCi5H,EAAS,GAGbA,EAAOv+H,KAAOqB,EAAIzG,MAAM,EAAGgH,GAG3B,IAAK,IAAIyB,EAAI,EAAGA,EAAIkpB,EAAIjzB,OAAQ+J,IAAK,CACnC,IAAI8yB,EAAQ5J,EAAIlpB,GAAGiC,MAAM,KACrBzG,EAAQy3B,SAASH,EAAM,GAAI,IAC3BzwB,EAAM4wB,SAASH,EAAM,GAAI,IAGzB1I,MAAM5uB,IACRA,EAAQjI,EAAO8O,EACfA,EAAM9O,EAAO,GAEJ62B,MAAM/nB,KACfA,EAAM9O,EAAO,GAIX8O,EAAM9O,EAAO,IACf8O,EAAM9O,EAAO,GAIX62B,MAAM5uB,IAAU4uB,MAAM/nB,IAAQ7G,EAAQ6G,GAAO7G,EAAQ,GAKzD0/H,EAAOxhI,KAAK,CACV8B,MAAOA,EACP6G,IAAKA,IAIT,OAAI64H,EAAOjlI,OAAS,GAEV,EAGHT,GAAWA,EAAQ2lI,QAU5B,SAAwBD,GAGtB,IAFA,IAAIE,EAAUF,EAAO3kI,IAAIukI,GAAc/oG,KAAKkpG,GAEnCh7H,EAAI,EAAGD,EAAI,EAAGA,EAAIo7H,EAAQnlI,OAAQ+J,IAAK,CAC9C,IAAI8yB,EAAQsoG,EAAQp7H,GAChB6b,EAAUu/G,EAAQn7H,GAElB6yB,EAAMt3B,MAAQqgB,EAAQxZ,IAAM,EAE9B+4H,IAAUn7H,GAAK6yB,EACNA,EAAMzwB,IAAMwZ,EAAQxZ,MAE7BwZ,EAAQxZ,IAAMywB,EAAMzwB,IACpBwZ,EAAQtd,MAAQkH,KAAK/D,IAAIma,EAAQtd,MAAOu0B,EAAMv0B,QAKlD68H,EAAQnlI,OAASgK,EAAI,EAGrB,IAAIo7H,EAAWD,EAAQrpG,KAAKipG,GAAkBzkI,IAAIwkI,GAKlD,OAFAM,EAAS1+H,KAAOu+H,EAAOv+H,KAEhB0+H,EAnCHC,CAAcJ,GACdA,mBC3EN,MAAM,SAAE/iF,EAAQ,YAAEwhB,GAAgB,EAAQ,MA0G1CvmE,EAAOC,QAxGP,cAA+B8kD,EAC7BvhD,YAAaZ,EAAQ49B,EAAO,IAC1BmC,MAAMnC,GAENj/B,KAAKmjC,WAAY,EACjBnjC,KAAKskH,OAAS,GACdtkH,KAAK4mI,UAAYvlI,GAAU,EAC3BrB,KAAKq3G,IAAM,KACXr3G,KAAKujC,QAAU,KACfvjC,KAAK0wH,KAAO,KAGdlkF,OAAQ2Q,EAAOnhB,EAAU+M,GACvB,IAAIm5E,GAAU,EAEd,OAAa,CACX,GAAIliH,KAAKmjC,UACP,OAIF,GAA2B,IAAvBnjC,KAAKskH,OAAOhjH,OAGd,OAFAtB,KAAKujC,QAAU4Z,OACfn9C,KAAKq3G,IAAMtuE,GAIb/oC,KAAKujC,QAAU,KACf,IAAIsjG,EAAY7mI,KAAKskH,OAAO,GAE5B,MAAMwiB,EAAah2H,KAAKC,IAAI81H,EAAUhgI,MAAQ7G,KAAK4mI,UAAW,GACxDG,EAAWF,EAAUn5H,IAAM1N,KAAK4mI,UAGtC,GAAIE,GAAc3pF,EAAM77C,OAEtB,OADAtB,KAAK4mI,WAAazpF,EAAM77C,OACjBynC,EAAG,MAIZ,IAAIi+F,EACJ,GAAID,EAAW5pF,EAAM77C,OAAQ,CAC3BtB,KAAK4mI,WAAazpF,EAAM77C,OAEtB0lI,EADiB,IAAfF,EACQ3pF,EAEAA,EAAMv6C,MAAMkkI,GAExB5kB,EAAU2kB,EAAUhnG,OAAO58B,MAAM+jI,IAAY9kB,EAC7C,MAGFliH,KAAK4mI,WAAaG,EAElBC,EAA0B,IAAfF,GAAoBC,IAAa5pF,EAAM77C,OAC9C67C,EACAA,EAAMv6C,MAAMkkI,EAAYC,GAE5B7kB,EAAU2kB,EAAUhnG,OAAO58B,MAAM+jI,IAAY9kB,EACzC2kB,EAAU3nF,MACZ2nF,EAAUhnG,OAAOnyB,MAEnByvC,EAAQA,EAAMv6C,MAAMmkI,GACpB/mI,KAAKskH,OAAO3jG,QAGVuhG,EACFn5E,EAAG,MAEH89F,EAAUhnG,OAAO2E,KAAK,QAASuE,EAAG/e,KAAK,KAAM,OAIjDpnB,MAAO2jI,GACL,GAAIvmI,KAAKmjC,UAAW,OAAO,KAEtBzhC,MAAMC,QAAQ4kI,KAASA,EAAS,CAACA,IAEtC,MAAMl9H,EAAM,IAAI27D,EAehB,OAbAuhE,EAAOvjI,SAAQ,CAACm7B,EAAO9yB,KACrBrL,KAAKskH,OAAOv/G,KAAK,CACf8B,MAAOs3B,EAAMt3B,MACb6G,IAAKywB,EAAMzwB,IACXmyB,OAAQx2B,EACR61C,KAAM7zC,IAAMk7H,EAAOjlI,OAAS,OAI5BtB,KAAKujC,SACPvjC,KAAKwsC,OAAOxsC,KAAKujC,QAAS,KAAMvjC,KAAKq3G,KAGhChuG,EAGTm8B,QAASz7B,GACH/J,KAAKmjC,YACTnjC,KAAKmjC,WAAY,EAEbp5B,GAAK/J,KAAKylC,KAAK,QAAS17B,6BCzGhC,SAASqwD,EAAUp8C,GACjB,OAAOsgB,SAAStgB,EAAG,MAAQA,EAG7B,SAASipH,EAAUzqH,GA+CjB,SAASsjB,EAAIz7B,GACXrE,KAAKmd,EAtCP,SAAc9Y,GACZ,QAAY+D,IAAR/D,EAAmB,CACrBA,EAAM,IAAI3C,MAAM8a,GAChB,IAAK,IAAIxJ,EAAI,EAAGA,EAAIwJ,EAAGxJ,IACrB3O,EAAI2O,GAAKlC,KAAK6gB,MAAM7gB,KAAKw1B,SAAW9pB,QAEjC,GAAmB,iBAARnY,EAGhBA,GADAA,EAAM,GAAKA,GACDiJ,MAAM,IAAI1L,KAAI,SAAU4O,GAAK,OAAOA,EAAEnC,WAAW,GAAKmO,SAC3D,KAAI9a,MAAMC,QAAQ0C,GAOvB,MAAM,IAAIwmB,UAAU,8BANpB,IAAKxmB,EAAIqyG,OAAM,SAAU39D,GACvB,MAAoB,iBAANA,GAAkBA,KAAW,EAAJA,MAEvC,MAAM,IAAIluB,UAAU,qDAYxB,IANA,IAAIizG,EAASz5H,EAAI/C,OAGb6b,EAhCN,WAEE,IADA,IAAIA,EAAI,IAAIzb,MAAM8a,GACTnR,EAAI,EAAGA,EAAImR,EAAGnR,IACrB8R,EAAE9R,GAAKA,EAET,OAAO8R,EA2BC+pH,GAEJ57H,EAAI,EACCD,EAAI,EAAGA,EAAImR,EAAGnR,IAAK,CAC1BC,GAAKA,EAAI6R,EAAE9R,GAAKhH,EAAIgH,EAAIyyH,IAAWthH,EACnC,IAAI9P,EAAMyQ,EAAE9R,GACZ8R,EAAE9R,GAAK8R,EAAE7R,GACT6R,EAAE7R,GAAKoB,EAGT,OAAOyQ,EAKE2sF,CAAKzlG,GACdrE,KAAKqL,EAAI,EACTrL,KAAKsL,EAAI,EA2FX,OAvFAw0B,EAAI7/B,UAAUknI,aAAe,WAC3BnnI,KAAKqL,GAAKrL,KAAKqL,EAAI,GAAKmR,EACxBxc,KAAKsL,GAAKtL,KAAKsL,EAAItL,KAAKmd,EAAEnd,KAAKqL,IAAMmR,EAErC,IAAI9P,EAAM1M,KAAKmd,EAAEnd,KAAKqL,GAMtB,OALArL,KAAKmd,EAAEnd,KAAKqL,GAAKrL,KAAKmd,EAAEnd,KAAKsL,GAC7BtL,KAAKmd,EAAEnd,KAAKsL,GAAKoB,EAET1M,KAAKmd,GAAGnd,KAAKmd,EAAEnd,KAAKqL,GAAKrL,KAAKmd,EAAEnd,KAAKsL,IAAMkR,IAKrDsjB,EAAI7/B,UAAUmnI,aAAe,WAM3B,OAAmC,KAAX,KAAX,IALLpnI,KAAKgqC,aACLhqC,KAAKgqC,cACLhqC,KAAKgqC,cACLhqC,KAAKgqC,cAKflK,EAAI7/B,UAAUonI,YAAc,WAC1B,OAAOrnI,KAAKonI,eAAiB,YAG/BtnG,EAAI7/B,UAAUqmC,OAAS,WACrB,IAAI1zB,EACAC,EAEJ,GAAyB,IAArB5N,UAAU3D,OACZsR,EAAI,EACJC,EAAI5N,UAAU,OACT,IAAyB,IAArBA,UAAU3D,OAInB,MAAM,IAAIupB,UAAU,6CAHpBjY,EAAI3N,UAAU,GACd4N,EAAI5N,UAAU,GAKhB,IAAKm1D,EAAUxnD,KAAOwnD,EAAUvnD,GAC9B,MAAM,IAAIgY,UAAU,6CAGtB,OAAOjY,EAAI5S,KAAKonI,gBAAkBv0H,EAAID,EAAI,IAG5CktB,EAAI7/B,UAAUqnI,aAAe,WAC3B,MAAO,CACLj8H,EAAGrL,KAAKqL,EACRC,EAAGtL,KAAKsL,EACR6R,EAAGnd,KAAKmd,EAAEva,UAIdk9B,EAAI7/B,UAAUsnI,SAAW,SAAU9jI,GACjC,IAAI0Z,EAAI1Z,EAAM0Z,EACV9R,EAAI5H,EAAM4H,EACVC,EAAI7H,EAAM6H,EAGd,KAAMD,KAAW,EAAJA,IAAU,GAAKA,GAAKA,EAAImR,GACnC,MAAM,IAAIvd,MAAM,kCAAoCud,EAAI,GAAK,KAG/D,KAAMlR,KAAW,EAAJA,IAAU,GAAKA,GAAKA,EAAIkR,GACnC,MAAM,IAAIvd,MAAM,kCAAoCud,EAAI,GAAK,KAK/D,IAAK9a,MAAMC,QAAQwb,IAAMA,EAAE7b,SAAWkb,EACpC,MAAM,IAAIvd,MAAM,mCAAqCud,GAIvD,IAAK,IAAIxJ,EAAI,EAAGA,EAAIwJ,EAAGxJ,IACrB,IAAsB,IAAlBmK,EAAEiQ,QAAQpa,GACZ,MAAM,IAAI/T,MAAM,sCAAwCud,EAAI,GAAK,KAAOxJ,EAAI,eAIhFhT,KAAKqL,EAAIA,EACTrL,KAAKsL,EAAIA,EACTtL,KAAKmd,EAAIA,EAAEva,SAGNk9B,EAGT,IAAIA,EAAMmnG,EAAU,KACpBnnG,EAAI7/B,UAAU+pC,WAAalK,EAAI7/B,UAAUknI,aAEzC,IAAIK,EAAWP,EAAU,IACzBO,EAASvnI,UAAU+pC,WAAa,WAI9B,OAAW,GAHHhqC,KAAKmnI,eACLnnI,KAAKmnI,gBAKf,IAAIM,EAAO,IAAIp5H,WAAW,GACtBq5H,EAAO,IAAIr5H,WAAW,GAE1B,SAASuoF,EAAM54E,GACb,OAAOA,EAAI,GAAKnS,OAAOC,aAAa47H,EAAO1pH,GAAKnS,OAAOC,aAAa27H,EAAOzpH,EAAI,IAGjF,SAAS2pH,EAAQn3H,GACf,OAAO8tB,SAAS9tB,EAAG,IAGrBg3H,EAASvnI,UAAU2nI,mBAAqB,WACtC,IAAInkI,EAAQzD,KAAKsnI,eAMjB,OAJQ1wC,EAAMnzF,EAAM4H,GACZurF,EAAMnzF,EAAM6H,GAEF7H,EAAM0Z,EAAEvb,IAAIg1F,GAAO/zF,KAAK,KAI5C2kI,EAASvnI,UAAU4nI,eAAiB,SAAUC,GAC5C,IAAKA,EAAYjgI,MAAM,kBACrB,MAAM,IAAIgjB,UAAU,0DAGtB,IAAIxf,EAAIs8H,EAAQG,EAAY,IACxBx8H,EAAIq8H,EAAQG,EAAY,IACxB3qH,EAAI2qH,EAAYx6H,MAAM,IAAI1K,MAAM,GAAGhB,IAAI+lI,GAE3C3nI,KAAKunI,SAAS,CACZl8H,EAAGA,EACHC,EAAGA,EACH6R,EAAGA,KAIP2iB,EAAI0nG,SAAWA,EAEf/oI,EAAOC,QAAUohC,yBCvMjB,IAAIlY,EAAQ,GAEZ,SAAS4L,EAAgBb,EAAMzoB,EAAS/J,GACjCA,IACHA,EAAOlB,OAWT,IAAIw0B,EAEJ,SAAUC,GAnBZ,IAAwBb,EAAUC,EAsB9B,SAASW,EAAUE,EAAMC,EAAMC,GAC7B,OAAOH,EAAMnzB,KAAKP,KAdtB,SAAoB2zB,EAAMC,EAAMC,GAC9B,MAAuB,iBAAZ3pB,EACFA,EAEAA,EAAQypB,EAAMC,EAAMC,GAUHC,CAAWH,EAAMC,EAAMC,KAAU7zB,KAG3D,OA1B8B8yB,EAoBJY,GApBNb,EAoBLY,GApBsCxzB,UAAYuF,OAAOgpB,OAAOsE,EAAW7yB,WAAY4yB,EAAS5yB,UAAUgC,YAAc4wB,EAAUA,EAAS5D,UAAY6D,EA0B/JW,EAPT,CAQEtzB,GAEFszB,EAAUxzB,UAAUH,KAAOK,EAAKL,KAChC2zB,EAAUxzB,UAAU0yB,KAAOA,EAC3B/K,EAAM+K,GAAQc,EAIhB,SAASM,EAAM1K,EAAU2K,GACvB,GAAItyB,MAAMC,QAAQ0nB,GAAW,CAC3B,IAAIje,EAAMie,EAAS/nB,OAKnB,OAJA+nB,EAAWA,EAASznB,KAAI,SAAUyJ,GAChC,OAAOQ,OAAOR,MAGZD,EAAM,EACD,UAAU7H,OAAOywB,EAAO,KAAKzwB,OAAO8lB,EAASzmB,MAAM,EAAGwI,EAAM,GAAGvI,KAAK,MAAO,SAAWwmB,EAASje,EAAM,GAC3F,IAARA,EACF,UAAU7H,OAAOywB,EAAO,KAAKzwB,OAAO8lB,EAAS,GAAI,QAAQ9lB,OAAO8lB,EAAS,IAEzE,MAAM9lB,OAAOywB,EAAO,KAAKzwB,OAAO8lB,EAAS,IAGlD,MAAO,MAAM9lB,OAAOywB,EAAO,KAAKzwB,OAAOsI,OAAOwd,IA+BlDmK,EAAgB,yBAAyB,SAAU1zB,EAAM2B,GACvD,MAAO,cAAgBA,EAAQ,4BAA8B3B,EAAO,MACnE+qB,WACH2I,EAAgB,wBAAwB,SAAU1zB,EAAMupB,EAAUD,GAEhE,IAAI6K,EA/BmB7E,EAwCnB3lB,EA1BYJ,EAAaxC,EA4B7B,GATwB,iBAAbwiB,IAjCY+F,EAiCkC,OAAV/F,EAhCpC6K,OAAyB,EAAU9E,EAAO9tB,UAAY8tB,IAiC/D6E,EAAa,cACb5K,EAAWA,EAASzb,QAAQ,QAAS,KAErCqmB,EAAa,UAhCjB,SAAkB5qB,EAAK+lB,EAAQC,GAK7B,YAJiBjnB,IAAbinB,GAA0BA,EAAWhmB,EAAI/H,UAC3C+tB,EAAWhmB,EAAI/H,QAGV+H,EAAIimB,UAAUD,EAAWD,EAAO9tB,OAAQ+tB,KAAcD,EAgCzDD,CAASrvB,EAAM,aAEjB2J,EAAM,OAAOlG,OAAOzD,EAAM,KAAKyD,OAAO0wB,EAAY,KAAK1wB,OAAOwwB,EAAM1K,EAAU,aACzE,CACL,IAAIrhB,GA/Be,iBAAVnB,IACTA,EAAQ,GAGNA,EA2BwB,IA3BTvF,QALH+H,EAgCMvJ,GA3BUwB,SAGS,IAAhC+H,EAAI+jB,QAwBe,IAxBCvmB,GAwBmB,WAAb,YACjC4C,EAAM,QAASlG,OAAOzD,EAAM,MAAOyD,OAAOyE,EAAM,KAAKzE,OAAO0wB,EAAY,KAAK1wB,OAAOwwB,EAAM1K,EAAU,SAItG,OADA5f,EAAO,mBAAmBlG,cAAc6lB,KAEvCyB,WACH2I,EAAgB,4BAA6B,2BAC7CA,EAAgB,8BAA8B,SAAU1zB,GACtD,MAAO,OAASA,EAAO,gCAEzB0zB,EAAgB,6BAA8B,mBAC9CA,EAAgB,wBAAwB,SAAU1zB,GAChD,MAAO,eAAiBA,EAAO,mCAEjC0zB,EAAgB,wBAAyB,kCACzCA,EAAgB,yBAA0B,6BAC1CA,EAAgB,6BAA8B,mBAC9CA,EAAgB,yBAA0B,sCAAuC3I,WACjF2I,EAAgB,wBAAwB,SAAUjuB,GAChD,MAAO,qBAAuBA,IAC7BslB,WACH2I,EAAgB,qCAAsC,oCACtD/0B,EAAOC,QAAQ,EAAQkpB,6CCnGnBmgH,EAAaviI,OAAOC,MAAQ,SAAUvB,GACxC,IAAIuB,EAAO,GAEX,IAAK,IAAIpB,KAAOH,EACduB,EAAKV,KAAKV,GAGZ,OAAOoB,GAKThH,EAAOC,QAAUuiC,EAEjB,IAAIw7D,EAAW,EAAQ,MAEnBj5C,EAAW,EAAQ,MAEvB,EAAQ,KAAR,CAAoBviB,EAAQw7D,GAM1B,IAFA,IAAIh3F,EAAOsiI,EAAWvkF,EAASvjD,WAEtB84C,EAAI,EAAGA,EAAItzC,EAAKnE,OAAQy3C,IAAK,CACpC,IAAIj0C,EAASW,EAAKszC,GACb9X,EAAOhhC,UAAU6E,KAASm8B,EAAOhhC,UAAU6E,GAAU0+C,EAASvjD,UAAU6E,IAIjF,SAASm8B,EAAOpgC,GACd,KAAMb,gBAAgBihC,GAAS,OAAO,IAAIA,EAAOpgC,GACjD47F,EAASl8F,KAAKP,KAAMa,GACpB2iD,EAASjjD,KAAKP,KAAMa,GACpBb,KAAKgoI,eAAgB,EAEjBnnI,KACuB,IAArBA,EAAQokE,WAAoBjlE,KAAKilE,UAAW,IACvB,IAArBpkE,EAAQ4sB,WAAoBztB,KAAKytB,UAAW,IAElB,IAA1B5sB,EAAQmnI,gBACVhoI,KAAKgoI,eAAgB,EACrBhoI,KAAKwkC,KAAK,MAAOozD,KAiCvB,SAASA,IAEH53F,KAAK4vD,eAAeC,OAGxBhmC,EAAQs/B,SAAS8+E,EAASjoI,MAG5B,SAASioI,EAAQt1H,GACfA,EAAKjF,MArCPlI,OAAO8nB,eAAe2T,EAAOhhC,UAAW,wBAAyB,CAI/DstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAK4vD,eAAem0D,iBAG/Bv+G,OAAO8nB,eAAe2T,EAAOhhC,UAAW,iBAAkB,CAIxDstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAK4vD,gBAAkB5vD,KAAK4vD,eAAes4E,eAGtD1iI,OAAO8nB,eAAe2T,EAAOhhC,UAAW,iBAAkB,CAIxDstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAK4vD,eAAetuD,UAgB/BkE,OAAO8nB,eAAe2T,EAAOhhC,UAAW,YAAa,CAInDstB,YAAY,EACZnuB,IAAK,WACH,YAA4BgJ,IAAxBpI,KAAKw3F,qBAAwDpvF,IAAxBpI,KAAK4vD,gBAIvC5vD,KAAKw3F,eAAer0D,WAAanjC,KAAK4vD,eAAezsB,WAE9DjkC,IAAK,SAAauC,QAGY2G,IAAxBpI,KAAKw3F,qBAAwDpvF,IAAxBpI,KAAK4vD,iBAM9C5vD,KAAKw3F,eAAer0D,UAAY1hC,EAChCzB,KAAK4vD,eAAezsB,UAAY1hC,mCC/GpChD,EAAOC,QAAUsmE,EAEjB,IAAIjuB,EAAY,EAAQ,MAIxB,SAASiuB,EAAYnkE,GACnB,KAAMb,gBAAgBglE,GAAc,OAAO,IAAIA,EAAYnkE,GAC3Dk2C,EAAUx2C,KAAKP,KAAMa,GAJvB,EAAQ,KAAR,CAAoBmkE,EAAajuB,GAOjCiuB,EAAY/kE,UAAUo3C,WAAa,SAAU8F,EAAOnhB,EAAU+M,GAC5DA,EAAG,KAAMoU,qCCZPlc,YAHJxiC,EAAOC,QAAU+9F,EAMjBA,EAAS0rC,cAAgBA,EAGhB,qBAAT,IA8BI1oG,EA5BA2oG,EAAkB,SAAyBjvC,EAASnxF,GACtD,OAAOmxF,EAAQkC,UAAUrzF,GAAM1G,QAO7B+mI,EAAS,EAAQ,MAIjBnnI,EAAS,eAETonI,EAAgB,EAAAtmH,EAAO2V,YAAc,aAYrC4wG,EAAY,EAAQ,MAKtB9oG,EADE8oG,GAAaA,EAAUC,SACjBD,EAAUC,SAAS,UAEnB,aAKV,IAcIzrE,EACA0rE,EACA56H,EAhBA66H,EAAa,EAAQ,MAErBC,EAAc,EAAQ,MAGtBC,EADW,EAAQ,MACSA,iBAE5BjhH,EAAiB,UACjBG,EAAuBH,EAAeG,qBACtC+gH,EAA4BlhH,EAAekhH,0BAC3CC,EAA6BnhH,EAAemhH,2BAC5CC,EAAqCphH,EAAeohH,mCAOxD,EAAQ,KAAR,CAAoBtsC,EAAU4rC,GAE9B,IAAIW,EAAiBL,EAAYK,eAC7BC,EAAe,CAAC,QAAS,QAAS,UAAW,QAAS,UAa1D,SAASd,EAActnI,EAASg/B,EAAQqpG,GACtCjoG,EAASA,GAAU,EAAQ,MAC3BpgC,EAAUA,GAAW,GAMG,kBAAbqoI,IAAwBA,EAAWrpG,aAAkBoB,GAGhEjhC,KAAK8jH,aAAejjH,EAAQijH,WACxBolB,IAAUlpI,KAAK8jH,WAAa9jH,KAAK8jH,cAAgBjjH,EAAQ+wE,oBAG7D5xE,KAAK+jH,cAAgB6kB,EAAiB5oI,KAAMa,EAAS,wBAAyBqoI,GAI9ElpI,KAAKuL,OAAS,IAAIm9H,EAClB1oI,KAAKsB,OAAS,EACdtB,KAAKmpI,MAAQ,KACbnpI,KAAKopI,WAAa,EAClBppI,KAAKqpI,QAAU,KACfrpI,KAAK6vD,OAAQ,EACb7vD,KAAKspI,YAAa,EAClBtpI,KAAK6kI,SAAU,EAKf7kI,KAAK+mC,MAAO,EAGZ/mC,KAAKupI,cAAe,EACpBvpI,KAAKwpI,iBAAkB,EACvBxpI,KAAKypI,mBAAoB,EACzBzpI,KAAK0pI,iBAAkB,EACvB1pI,KAAK2pI,QAAS,EAEd3pI,KAAK4pI,WAAkC,IAAtB/oI,EAAQ+oI,UAEzB5pI,KAAKikH,cAAgBpjH,EAAQojH,YAE7BjkH,KAAKmjC,WAAY,EAIjBnjC,KAAK2hI,gBAAkB9gI,EAAQ8gI,iBAAmB,OAElD3hI,KAAK6pI,WAAa,EAElB7pI,KAAK8pI,aAAc,EACnB9pI,KAAK0L,QAAU,KACf1L,KAAKg8B,SAAW,KAEZn7B,EAAQm7B,WACL+gC,IAAeA,EAAgB,WACpC/8D,KAAK0L,QAAU,IAAIqxD,EAAcl8D,EAAQm7B,UACzCh8B,KAAKg8B,SAAWn7B,EAAQm7B,UAI5B,SAASygE,EAAS57F,GAEhB,GADAogC,EAASA,GAAU,EAAQ,QACrBjhC,gBAAgBy8F,GAAW,OAAO,IAAIA,EAAS57F,GAGrD,IAAIqoI,EAAWlpI,gBAAgBihC,EAC/BjhC,KAAKw3F,eAAiB,IAAI2wC,EAActnI,EAASb,KAAMkpI,GAEvDlpI,KAAKilE,UAAW,EAEZpkE,IAC0B,mBAAjBA,EAAQytC,OAAqBtuC,KAAKiqC,MAAQppC,EAAQytC,MAC9B,mBAApBztC,EAAQ2kC,UAAwBxlC,KAAKykH,SAAW5jH,EAAQ2kC,UAGrE6iG,EAAO9nI,KAAKP,MAiEd,SAAS+pI,EAAiBlqG,EAAQsd,EAAOnhB,EAAUguG,EAAYC,GAC7DxqG,EAAM,mBAAoB0d,GAC1B,IAMMgT,EANF1sD,EAAQo8B,EAAO23D,eAEnB,GAAc,OAAVr6C,EACF15C,EAAMohI,SAAU,EAyOpB,SAAoBhlG,EAAQp8B,GAE1B,GADAg8B,EAAM,eACFh8B,EAAMosD,MAAV,CAEA,GAAIpsD,EAAMiI,QAAS,CACjB,IAAIyxC,EAAQ15C,EAAMiI,QAAQgC,MAEtByvC,GAASA,EAAM77C,SACjBmC,EAAM8H,OAAOxG,KAAKo4C,GAClB15C,EAAMnC,QAAUmC,EAAMqgH,WAAa,EAAI3mE,EAAM77C,QAIjDmC,EAAMosD,OAAQ,EAEVpsD,EAAMsjC,KAIRmjG,EAAarqG,IAGbp8B,EAAM8lI,cAAe,EAEhB9lI,EAAM+lI,kBACT/lI,EAAM+lI,iBAAkB,EACxBW,EAActqG,MAlQhBuqG,CAAWvqG,EAAQp8B,QAKnB,GAFKwmI,IAAgB95E,EAmDzB,SAAsB1sD,EAAO05C,GAC3B,IAAIgT,EAhQiBjsD,EAsQrB,OAtQqBA,EAkQFi5C,EAjQZj8C,EAAOE,SAAS8C,IAAQA,aAAeokI,GAiQA,iBAAVnrF,QAAgC/0C,IAAV+0C,GAAwB15C,EAAMqgH,aACtF3zD,EAAK,IAAIroC,EAAqB,QAAS,CAAC,SAAU,SAAU,cAAeq1B,IAGtEgT,EA1DqBk6E,CAAa5mI,EAAO05C,IAE1CgT,EACF64E,EAAenpG,EAAQswB,QAClB,GAAI1sD,EAAMqgH,YAAc3mE,GAASA,EAAM77C,OAAS,EAKrD,GAJqB,iBAAV67C,GAAuB15C,EAAMqgH,YAAct+G,OAAO0pB,eAAeiuB,KAAWj8C,EAAOjB,YAC5Fk9C,EAtNR,SAA6BA,GAC3B,OAAOj8C,EAAO2M,KAAKsvC,GAqNLmtF,CAAoBntF,IAG1B6sF,EACEvmI,EAAM6lI,WAAYN,EAAenpG,EAAQ,IAAIkpG,GAA2CwB,EAAS1qG,EAAQp8B,EAAO05C,GAAO,QACtH,GAAI15C,EAAMosD,MACfm5E,EAAenpG,EAAQ,IAAIgpG,OACtB,IAAIplI,EAAM0/B,UACf,OAAO,EAEP1/B,EAAMohI,SAAU,EAEZphI,EAAMiI,UAAYswB,GACpBmhB,EAAQ15C,EAAMiI,QAAQzI,MAAMk6C,GACxB15C,EAAMqgH,YAA+B,IAAjB3mE,EAAM77C,OAAcipI,EAAS1qG,EAAQp8B,EAAO05C,GAAO,GAAYqtF,EAAc3qG,EAAQp8B,IAE7G8mI,EAAS1qG,EAAQp8B,EAAO05C,GAAO,QAGzB6sF,IACVvmI,EAAMohI,SAAU,EAChB2F,EAAc3qG,EAAQp8B,IAO1B,OAAQA,EAAMosD,QAAUpsD,EAAMnC,OAASmC,EAAMsgH,eAAkC,IAAjBtgH,EAAMnC,QAGtE,SAASipI,EAAS1qG,EAAQp8B,EAAO05C,EAAO6sF,GAClCvmI,EAAM4lI,SAA4B,IAAjB5lI,EAAMnC,SAAiBmC,EAAMsjC,MAChDtjC,EAAMomI,WAAa,EACnBhqG,EAAO4F,KAAK,OAAQ0X,KAGpB15C,EAAMnC,QAAUmC,EAAMqgH,WAAa,EAAI3mE,EAAM77C,OACzC0oI,EAAYvmI,EAAM8H,OAAO6D,QAAQ+tC,GAAY15C,EAAM8H,OAAOxG,KAAKo4C,GAC/D15C,EAAM8lI,cAAcW,EAAarqG,IAGvC2qG,EAAc3qG,EAAQp8B,GAvHxB+B,OAAO8nB,eAAemvE,EAASx8F,UAAW,YAAa,CAIrDstB,YAAY,EACZnuB,IAAK,WACH,YAA4BgJ,IAAxBpI,KAAKw3F,gBAIFx3F,KAAKw3F,eAAer0D,WAE7BjkC,IAAK,SAAauC,GAGXzB,KAAKw3F,iBAMVx3F,KAAKw3F,eAAer0D,UAAY1hC,MAGpCg7F,EAASx8F,UAAUulC,QAAUmjG,EAAYnjG,QACzCi3D,EAASx8F,UAAUwqI,WAAa9B,EAAY+B,UAE5CjuC,EAASx8F,UAAUwkH,SAAW,SAAU16G,EAAKg/B,GAC3CA,EAAGh/B,IAOL0yF,EAASx8F,UAAU8E,KAAO,SAAUo4C,EAAOnhB,GACzC,IACIiuG,EADAxmI,EAAQzD,KAAKw3F,eAkBjB,OAfK/zF,EAAMqgH,WAYTmmB,GAAiB,EAXI,iBAAV9sF,KACTnhB,EAAWA,GAAYv4B,EAAMk+H,mBAEZl+H,EAAMu4B,WACrBmhB,EAAQj8C,EAAO2M,KAAKsvC,EAAOnhB,GAC3BA,EAAW,IAGbiuG,GAAiB,GAMdF,EAAiB/pI,KAAMm9C,EAAOnhB,GAAU,EAAOiuG,IAIxDxtC,EAASx8F,UAAUmP,QAAU,SAAU+tC,GACrC,OAAO4sF,EAAiB/pI,KAAMm9C,EAAO,MAAM,GAAM,IAyEnDs/C,EAASx8F,UAAU0qI,SAAW,WAC5B,OAAuC,IAAhC3qI,KAAKw3F,eAAe6xC,SAI7B5sC,EAASx8F,UAAU2qI,YAAc,SAAUnqI,GACpCs8D,IAAeA,EAAgB,WACpC,IAAIrxD,EAAU,IAAIqxD,EAAct8D,GAChCT,KAAKw3F,eAAe9rF,QAAUA,EAE9B1L,KAAKw3F,eAAex7D,SAAWh8B,KAAKw3F,eAAe9rF,QAAQswB,SAK3D,IAHA,IAAIxsB,EAAIxP,KAAKw3F,eAAejsF,OAAOixF,KAC/Bl0F,EAAU,GAED,OAANkH,GACLlH,GAAWoD,EAAQzI,MAAMuM,EAAE5O,MAC3B4O,EAAIA,EAAEkX,KAOR,OAJA1mB,KAAKw3F,eAAejsF,OAAO1M,QAEX,KAAZyJ,GAAgBtI,KAAKw3F,eAAejsF,OAAOxG,KAAKuD,GACpDtI,KAAKw3F,eAAel2F,OAASgH,EAAQhH,OAC9BtB,MAIT,IAAI6qI,EAAU,WAuBd,SAASC,EAAc9sH,EAAGva,GACxB,OAAIua,GAAK,GAAsB,IAAjBva,EAAMnC,QAAgBmC,EAAMosD,MAAc,EACpDpsD,EAAMqgH,WAAmB,EAEzB9lG,GAAMA,EAEJva,EAAM4lI,SAAW5lI,EAAMnC,OAAemC,EAAM8H,OAAOixF,KAAK57F,KAAKU,OAAmBmC,EAAMnC,QAIxF0c,EAAIva,EAAMsgH,gBAAetgH,EAAMsgH,cA/BrC,SAAiC/lG,GAgB/B,OAfIA,GAAK6sH,EAEP7sH,EAAI6sH,GAIJ7sH,IACAA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,EACXA,GAAKA,IAAM,GACXA,KAGKA,EAe4C+sH,CAAwB/sH,IACvEA,GAAKva,EAAMnC,OAAe0c,EAEzBva,EAAMosD,MAKJpsD,EAAMnC,QAJXmC,EAAM8lI,cAAe,EACd,IAwIX,SAASW,EAAarqG,GACpB,IAAIp8B,EAAQo8B,EAAO23D,eACnB/3D,EAAM,eAAgBh8B,EAAM8lI,aAAc9lI,EAAM+lI,iBAChD/lI,EAAM8lI,cAAe,EAEhB9lI,EAAM+lI,kBACT/pG,EAAM,eAAgBh8B,EAAM4lI,SAC5B5lI,EAAM+lI,iBAAkB,EACxB3/G,EAAQs/B,SAASghF,EAAetqG,IAIpC,SAASsqG,EAActqG,GACrB,IAAIp8B,EAAQo8B,EAAO23D,eACnB/3D,EAAM,gBAAiBh8B,EAAM0/B,UAAW1/B,EAAMnC,OAAQmC,EAAMosD,OAEvDpsD,EAAM0/B,YAAc1/B,EAAMnC,SAAUmC,EAAMosD,QAC7ChwB,EAAO4F,KAAK,YACZhiC,EAAM+lI,iBAAkB,GAS1B/lI,EAAM8lI,cAAgB9lI,EAAM4lI,UAAY5lI,EAAMosD,OAASpsD,EAAMnC,QAAUmC,EAAMsgH,cAC7Er3D,EAAK7sB,GASP,SAAS2qG,EAAc3qG,EAAQp8B,GACxBA,EAAMqmI,cACTrmI,EAAMqmI,aAAc,EACpBjgH,EAAQs/B,SAAS6hF,EAAgBnrG,EAAQp8B,IAI7C,SAASunI,EAAenrG,EAAQp8B,GAwB9B,MAAQA,EAAMohI,UAAYphI,EAAMosD,QAAUpsD,EAAMnC,OAASmC,EAAMsgH,eAAiBtgH,EAAM4lI,SAA4B,IAAjB5lI,EAAMnC,SAAe,CACpH,IAAI8J,EAAM3H,EAAMnC,OAGhB,GAFAm+B,EAAM,wBACNI,EAAOyO,KAAK,GACRljC,IAAQ3H,EAAMnC,OAChB,MAGJmC,EAAMqmI,aAAc,EA6QtB,SAASmB,EAAwBt4H,GAC/B,IAAIlP,EAAQkP,EAAK6kF,eACjB/zF,EAAMgmI,kBAAoB92H,EAAKooF,cAAc,YAAc,EAEvDt3F,EAAMimI,kBAAoBjmI,EAAMkmI,OAGlClmI,EAAM4lI,SAAU,EACP12H,EAAKooF,cAAc,QAAU,GACtCpoF,EAAKkqD,SAIT,SAASquE,EAAiBv4H,GACxB8sB,EAAM,4BACN9sB,EAAK27B,KAAK,GA4BZ,SAAS68F,EAAQtrG,EAAQp8B,GACvBg8B,EAAM,SAAUh8B,EAAMohI,SAEjBphI,EAAMohI,SACThlG,EAAOyO,KAAK,GAGd7qC,EAAMimI,iBAAkB,EACxB7pG,EAAO4F,KAAK,UACZinB,EAAK7sB,GACDp8B,EAAM4lI,UAAY5lI,EAAMohI,SAAShlG,EAAOyO,KAAK,GAgBnD,SAASoe,EAAK7sB,GACZ,IAAIp8B,EAAQo8B,EAAO23D,eAGnB,IAFA/3D,EAAM,OAAQh8B,EAAM4lI,SAEb5lI,EAAM4lI,SAA6B,OAAlBxpG,EAAOyO,UA4HjC,SAAS88F,EAASptH,EAAGva,GAEnB,OAAqB,IAAjBA,EAAMnC,OAAqB,MAE3BmC,EAAMqgH,WAAYnwG,EAAMlQ,EAAM8H,OAAOoV,SAAkB3C,GAAKA,GAAKva,EAAMnC,QAEtDqS,EAAflQ,EAAMiI,QAAejI,EAAM8H,OAAO1I,KAAK,IAAqC,IAAxBY,EAAM8H,OAAOjK,OAAoBmC,EAAM8H,OAAOiB,QAAmB/I,EAAM8H,OAAOhI,OAAOE,EAAMnC,QACnJmC,EAAM8H,OAAO1M,SAGb8U,EAAMlQ,EAAM8H,OAAO8/H,QAAQrtH,EAAGva,EAAMiI,SAE/BiI,GATP,IAAIA,EAYN,SAAS23H,EAAYzrG,GACnB,IAAIp8B,EAAQo8B,EAAO23D,eACnB/3D,EAAM,cAAeh8B,EAAM6lI,YAEtB7lI,EAAM6lI,aACT7lI,EAAMosD,OAAQ,EACdhmC,EAAQs/B,SAASoiF,EAAe9nI,EAAOo8B,IAI3C,SAAS0rG,EAAc9nI,EAAOo8B,GAG5B,GAFAJ,EAAM,gBAAiBh8B,EAAM6lI,WAAY7lI,EAAMnC,SAE1CmC,EAAM6lI,YAA+B,IAAjB7lI,EAAMnC,SAC7BmC,EAAM6lI,YAAa,EACnBzpG,EAAOolC,UAAW,EAClBplC,EAAO4F,KAAK,OAERhiC,EAAMwgH,aAAa,CAGrB,IAAIunB,EAAS3rG,EAAO+vB,iBAEf47E,GAAUA,EAAOvnB,aAAeunB,EAAOC,WAC1C5rG,EAAO2F,WAgBf,SAASpY,EAAQsmF,EAAIx3F,GACnB,IAAK,IAAI7Q,EAAI,EAAGoR,EAAIi3F,EAAGpyG,OAAQ+J,EAAIoR,EAAGpR,IACpC,GAAIqoG,EAAGroG,KAAO6Q,EAAG,OAAO7Q,EAG1B,OAAQ,EA3tBVoxF,EAASx8F,UAAUquC,KAAO,SAAUtwB,GAClCyhB,EAAM,OAAQzhB,GACdA,EAAIsgB,SAAStgB,EAAG,IAChB,IAAIva,EAAQzD,KAAKw3F,eACbk0C,EAAQ1tH,EAKZ,GAJU,IAANA,IAASva,EAAM+lI,iBAAkB,GAI3B,IAANxrH,GAAWva,EAAM8lI,gBAA0C,IAAxB9lI,EAAMsgH,cAAsBtgH,EAAMnC,QAAUmC,EAAMsgH,cAAgBtgH,EAAMnC,OAAS,IAAMmC,EAAMosD,OAGlI,OAFApwB,EAAM,qBAAsBh8B,EAAMnC,OAAQmC,EAAMosD,OAC3B,IAAjBpsD,EAAMnC,QAAgBmC,EAAMosD,MAAOy7E,EAAYtrI,MAAWkqI,EAAalqI,MACpE,KAKT,GAAU,KAFVge,EAAI8sH,EAAc9sH,EAAGva,KAENA,EAAMosD,MAEnB,OADqB,IAAjBpsD,EAAMnC,QAAcgqI,EAAYtrI,MAC7B,KAyBT,IA4BI2T,EA5BAg4H,EAASloI,EAAM8lI,aAgDnB,OA/CA9pG,EAAM,gBAAiBksG,IAEF,IAAjBloI,EAAMnC,QAAgBmC,EAAMnC,OAAS0c,EAAIva,EAAMsgH,gBAEjDtkF,EAAM,6BADNksG,GAAS,GAMPloI,EAAMosD,OAASpsD,EAAMohI,QAEvBplG,EAAM,mBADNksG,GAAS,GAEAA,IACTlsG,EAAM,WACNh8B,EAAMohI,SAAU,EAChBphI,EAAMsjC,MAAO,EAEQ,IAAjBtjC,EAAMnC,SAAcmC,EAAM8lI,cAAe,GAE7CvpI,KAAKiqC,MAAMxmC,EAAMsgH,eAEjBtgH,EAAMsjC,MAAO,EAGRtjC,EAAMohI,UAAS7mH,EAAI8sH,EAAcY,EAAOjoI,KAMnC,QAFDkQ,EAAPqK,EAAI,EAASotH,EAASptH,EAAGva,GAAkB,OAG7CA,EAAM8lI,aAAe9lI,EAAMnC,QAAUmC,EAAMsgH,cAC3C/lG,EAAI,IAEJva,EAAMnC,QAAU0c,EAChBva,EAAMomI,WAAa,GAGA,IAAjBpmI,EAAMnC,SAGHmC,EAAMosD,QAAOpsD,EAAM8lI,cAAe,GAEnCmC,IAAU1tH,GAAKva,EAAMosD,OAAOy7E,EAAYtrI,OAGlC,OAAR2T,GAAc3T,KAAKylC,KAAK,OAAQ9xB,GAC7BA,GAwHT8oF,EAASx8F,UAAUgqC,MAAQ,SAAUjsB,GACnCgrH,EAAehpI,KAAM,IAAI8oI,EAA2B,aAGtDrsC,EAASx8F,UAAUklE,KAAO,SAAUhzD,EAAMy5H,GACxC,IAAIh0F,EAAM53C,KACNyD,EAAQzD,KAAKw3F,eAEjB,OAAQ/zF,EAAM2lI,YACZ,KAAK,EACH3lI,EAAM0lI,MAAQh3H,EACd,MAEF,KAAK,EACH1O,EAAM0lI,MAAQ,CAAC1lI,EAAM0lI,MAAOh3H,GAC5B,MAEF,QACE1O,EAAM0lI,MAAMpkI,KAAKoN,GAIrB1O,EAAM2lI,YAAc,EACpB3pG,EAAM,wBAAyBh8B,EAAM2lI,WAAYwC,GACjD,IACIC,EADUD,IAA6B,IAAjBA,EAASl+H,KAAkByE,IAAS0X,EAAQiiH,QAAU35H,IAAS0X,EAAQiH,OACrEi7G,EAARn0C,EAepB,SAASA,IACPn4D,EAAM,SACNttB,EAAKzE,MAhBHjK,EAAM6lI,WAAYz/G,EAAQs/B,SAAS0iF,GAAYj0F,EAAIpT,KAAK,MAAOqnG,GACnE15H,EAAKuyB,GAAG,UAER,SAASsnG,EAAS/mE,EAAUgnE,GAC1BxsG,EAAM,YAEFwlC,IAAartB,GACXq0F,IAAwC,IAA1BA,EAAWC,aAC3BD,EAAWC,YAAa,EAoB5BzsG,EAAM,WAENttB,EAAKkhC,eAAe,QAAS0kD,GAC7B5lF,EAAKkhC,eAAe,SAAUskD,GAC9BxlF,EAAKkhC,eAAe,QAAS84F,GAC7Bh6H,EAAKkhC,eAAe,QAAS2W,GAC7B73C,EAAKkhC,eAAe,SAAU24F,GAC9Bp0F,EAAIvE,eAAe,MAAOukD,GAC1BhgD,EAAIvE,eAAe,MAAO04F,GAC1Bn0F,EAAIvE,eAAe,OAAQ+4F,GAC3BC,GAAY,GAMR5oI,EAAMomI,YAAgB13H,EAAKy9C,iBAAkBz9C,EAAKy9C,eAAeG,WAAYo8E,QArBnF,IAAIA,EAwFN,SAAqBv0F,GACnB,OAAO,WACL,IAAIn0C,EAAQm0C,EAAI4/C,eAChB/3D,EAAM,cAAeh8B,EAAMomI,YACvBpmI,EAAMomI,YAAYpmI,EAAMomI,aAEH,IAArBpmI,EAAMomI,YAAoBzB,EAAgBxwF,EAAK,UACjDn0C,EAAM4lI,SAAU,EAChB38E,EAAK9U,KAhGK00F,CAAY10F,GAC1BzlC,EAAKuyB,GAAG,QAASynG,GACjB,IAAIE,GAAY,EAwBhB,SAASD,EAAOjvF,GACd1d,EAAM,UACN,IAAI9rB,EAAMxB,EAAKlP,MAAMk6C,GACrB1d,EAAM,aAAc9rB,IAER,IAARA,KAKwB,IAArBlQ,EAAM2lI,YAAoB3lI,EAAM0lI,QAAUh3H,GAAQ1O,EAAM2lI,WAAa,IAAqC,IAAhCh8G,EAAQ3pB,EAAM0lI,MAAOh3H,MAAkBk6H,IACpH5sG,EAAM,8BAA+Bh8B,EAAMomI,YAC3CpmI,EAAMomI,cAGRjyF,EAAIglB,SAMR,SAAS5S,EAAQmG,GACf1wB,EAAM,UAAW0wB,GACjB47E,IACA55H,EAAKkhC,eAAe,QAAS2W,GACU,IAAnCo+E,EAAgBj2H,EAAM,UAAgB62H,EAAe72H,EAAMg+C,GAMjE,SAAS4nC,IACP5lF,EAAKkhC,eAAe,SAAUskD,GAC9Bo0C,IAKF,SAASp0C,IACPl4D,EAAM,YACNttB,EAAKkhC,eAAe,QAAS0kD,GAC7Bg0C,IAKF,SAASA,IACPtsG,EAAM,UACNmY,EAAIm0F,OAAO55H,GAWb,OA7DAylC,EAAIlT,GAAG,OAAQ0nG,GAtkBjB,SAAyBjzC,EAASpoD,EAAO9nB,GAGvC,GAAuC,mBAA5BkwE,EAAQoC,gBAAgC,OAAOpC,EAAQoC,gBAAgBxqD,EAAO9nB,GAKpFkwE,EAAQK,SAAYL,EAAQK,QAAa,MAAkC93F,MAAMC,QAAQw3F,EAAQK,QAAa,OAAIL,EAAQK,QAAa,MAAEpqF,QAAQ6Z,GAASkwE,EAAQK,QAAa,MAAI,CAACvwE,EAAIkwE,EAAQK,QAAa,OAAjKL,EAAQz0D,GAAGqM,EAAO9nB,GA6lBnEsyE,CAAgBppF,EAAM,QAAS63C,GAO/B73C,EAAKqyB,KAAK,QAASuzD,GAQnB5lF,EAAKqyB,KAAK,SAAUmzD,GAQpBxlF,EAAKszB,KAAK,OAAQmS,GAEbn0C,EAAM4lI,UACT5pG,EAAM,eACNmY,EAAIilB,UAGC1qD,GAgBTsqF,EAASx8F,UAAU8rI,OAAS,SAAU55H,GACpC,IAAI1O,EAAQzD,KAAKw3F,eACby0C,EAAa,CACfC,YAAY,GAGd,GAAyB,IAArBzoI,EAAM2lI,WAAkB,OAAOppI,KAEnC,GAAyB,IAArByD,EAAM2lI,WAER,OAAIj3H,GAAQA,IAAS1O,EAAM0lI,QACtBh3H,IAAMA,EAAO1O,EAAM0lI,OAExB1lI,EAAM0lI,MAAQ,KACd1lI,EAAM2lI,WAAa,EACnB3lI,EAAM4lI,SAAU,EACZl3H,GAAMA,EAAKszB,KAAK,SAAUzlC,KAAMisI,IANKjsI,KAW3C,IAAKmS,EAAM,CAET,IAAIo6H,EAAQ9oI,EAAM0lI,MACd/9H,EAAM3H,EAAM2lI,WAChB3lI,EAAM0lI,MAAQ,KACd1lI,EAAM2lI,WAAa,EACnB3lI,EAAM4lI,SAAU,EAEhB,IAAK,IAAIh+H,EAAI,EAAGA,EAAID,EAAKC,IACvBkhI,EAAMlhI,GAAGo6B,KAAK,SAAUzlC,KAAM,CAC5BksI,YAAY,IAIhB,OAAOlsI,KAIT,IAAI4J,EAAQwjB,EAAQ3pB,EAAM0lI,MAAOh3H,GACjC,OAAe,IAAXvI,IACJnG,EAAM0lI,MAAM56H,OAAO3E,EAAO,GAC1BnG,EAAM2lI,YAAc,EACK,IAArB3lI,EAAM2lI,aAAkB3lI,EAAM0lI,MAAQ1lI,EAAM0lI,MAAM,IACtDh3H,EAAKszB,KAAK,SAAUzlC,KAAMisI,IAJDjsI,MAU3By8F,EAASx8F,UAAUykC,GAAK,SAAU8nG,EAAIvjH,GACpC,IAAIzmB,EAAM6lI,EAAOpoI,UAAUykC,GAAGnkC,KAAKP,KAAMwsI,EAAIvjH,GACzCxlB,EAAQzD,KAAKw3F,eAuBjB,MArBW,SAAPg1C,GAGF/oI,EAAMgmI,kBAAoBzpI,KAAK+6F,cAAc,YAAc,GAErC,IAAlBt3F,EAAM4lI,SAAmBrpI,KAAK68D,UAClB,aAAP2vE,IACJ/oI,EAAM6lI,YAAe7lI,EAAMgmI,oBAC9BhmI,EAAMgmI,kBAAoBhmI,EAAM8lI,cAAe,EAC/C9lI,EAAM4lI,SAAU,EAChB5lI,EAAM+lI,iBAAkB,EACxB/pG,EAAM,cAAeh8B,EAAMnC,OAAQmC,EAAMohI,SAErCphI,EAAMnC,OACR4oI,EAAalqI,MACHyD,EAAMohI,SAChBh7G,EAAQs/B,SAAS+hF,EAAkBlrI,QAKlCwC,GAGTi6F,EAASx8F,UAAUq7F,YAAcmB,EAASx8F,UAAUykC,GAEpD+3D,EAASx8F,UAAUozC,eAAiB,SAAUm5F,EAAIvjH,GAChD,IAAIzmB,EAAM6lI,EAAOpoI,UAAUozC,eAAe9yC,KAAKP,KAAMwsI,EAAIvjH,GAYzD,MAVW,aAAPujH,GAOF3iH,EAAQs/B,SAAS8hF,EAAyBjrI,MAGrCwC,GAGTi6F,EAASx8F,UAAU07F,mBAAqB,SAAU6wC,GAChD,IAAIhqI,EAAM6lI,EAAOpoI,UAAU07F,mBAAmB32F,MAAMhF,KAAMiF,WAY1D,MAVW,aAAPunI,QAA4BpkI,IAAPokI,GAOvB3iH,EAAQs/B,SAAS8hF,EAAyBjrI,MAGrCwC,GAuBTi6F,EAASx8F,UAAU48D,OAAS,WAC1B,IAAIp5D,EAAQzD,KAAKw3F,eAYjB,OAVK/zF,EAAM4lI,UACT5pG,EAAM,UAINh8B,EAAM4lI,SAAW5lI,EAAMgmI,kBAQ3B,SAAgB5pG,EAAQp8B,GACjBA,EAAMimI,kBACTjmI,EAAMimI,iBAAkB,EACxB7/G,EAAQs/B,SAASgiF,EAAStrG,EAAQp8B,IAVlCo5D,CAAO78D,KAAMyD,IAGfA,EAAMkmI,QAAS,EACR3pI,MAuBTy8F,EAASx8F,UAAU28D,MAAQ,WAUzB,OATAn9B,EAAM,wBAAyBz/B,KAAKw3F,eAAe6xC,UAEf,IAAhCrpI,KAAKw3F,eAAe6xC,UACtB5pG,EAAM,SACNz/B,KAAKw3F,eAAe6xC,SAAU,EAC9BrpI,KAAKylC,KAAK,UAGZzlC,KAAKw3F,eAAemyC,QAAS,EACtB3pI,MAeTy8F,EAASx8F,UAAUgsG,KAAO,SAAUpsE,GAClC,IAAInV,EAAQ1qB,KAERyD,EAAQzD,KAAKw3F,eACbmyC,GAAS,EA0Bb,IAAK,IAAIt+H,KAzBTw0B,EAAO6E,GAAG,OAAO,WAGf,GAFAjF,EAAM,eAEFh8B,EAAMiI,UAAYjI,EAAMosD,MAAO,CACjC,IAAI1S,EAAQ15C,EAAMiI,QAAQgC,MACtByvC,GAASA,EAAM77C,QAAQopB,EAAM3lB,KAAKo4C,GAGxCzyB,EAAM3lB,KAAK,SAEb86B,EAAO6E,GAAG,QAAQ,SAAUyY,GAC1B1d,EAAM,gBACFh8B,EAAMiI,UAASyxC,EAAQ15C,EAAMiI,QAAQzI,MAAMk6C,IAE3C15C,EAAMqgH,YAAc,MAAC3mE,IAAyD15C,EAAMqgH,YAAgB3mE,GAAUA,EAAM77C,UAE9GopB,EAAM3lB,KAAKo4C,KAGnBwsF,GAAS,EACT9pG,EAAO+8B,aAKG/8B,OACIz3B,IAAZpI,KAAKqL,IAAyC,mBAAdw0B,EAAOx0B,KACzCrL,KAAKqL,GAAK,SAAoBvG,GAC5B,OAAO,WACL,OAAO+6B,EAAO/6B,GAAQE,MAAM66B,EAAQ56B,YAF9B,CAIRoG,IAKN,IAAK,IAAI2S,EAAI,EAAGA,EAAIirH,EAAa3nI,OAAQ0c,IACvC6hB,EAAO6E,GAAGukG,EAAajrH,GAAIhe,KAAKylC,KAAKzb,KAAKhqB,KAAMipI,EAAajrH,KAc/D,OATAhe,KAAKiqC,MAAQ,SAAUjsB,GACrByhB,EAAM,gBAAiBzhB,GAEnB2rH,IACFA,GAAS,EACT9pG,EAAOg9B,WAIJ78D,MAGa,mBAAXunB,SACTk1E,EAASx8F,UAAUsnB,OAAOklH,eAAiB,WAKzC,YAJ0CrkI,IAAtCqgI,IACFA,EAAoC,EAAQ,OAGvCA,EAAkCzoI,QAI7CwF,OAAO8nB,eAAemvE,EAASx8F,UAAW,wBAAyB,CAIjEstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAKw3F,eAAeusB,iBAG/Bv+G,OAAO8nB,eAAemvE,EAASx8F,UAAW,iBAAkB,CAI1DstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAKw3F,gBAAkBx3F,KAAKw3F,eAAejsF,UAGtD/F,OAAO8nB,eAAemvE,EAASx8F,UAAW,kBAAmB,CAI3DstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAKw3F,eAAe6xC,SAE7BnqI,IAAK,SAAauE,GACZzD,KAAKw3F,iBACPx3F,KAAKw3F,eAAe6xC,QAAU5lI,MAKpCg5F,EAASiwC,UAAYtB,EACrB5lI,OAAO8nB,eAAemvE,EAASx8F,UAAW,iBAAkB,CAI1DstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAKw3F,eAAel2F,UAoDT,mBAAXimB,SACTk1E,EAAS5uF,KAAO,SAAU8+H,EAAU1tG,GAKlC,YAJa72B,IAATyF,IACFA,EAAO,EAAQ,OAGVA,EAAK4uF,EAAUkwC,EAAU1tG,kCC1hCpCxgC,EAAOC,QAAUq4C,EAEjB,IAAIpvB,EAAiB,UACjBmhH,EAA6BnhH,EAAemhH,2BAC5C8D,EAAwBjlH,EAAeilH,sBACvCC,EAAqCllH,EAAeklH,mCACpDC,EAA8BnlH,EAAemlH,4BAE7C7rG,EAAS,EAAQ,MAIrB,SAAS8rG,EAAe58E,EAAIvvD,GAC1B,IAAIosI,EAAKhtI,KAAKitI,gBACdD,EAAGE,cAAe,EAClB,IAAInkG,EAAKikG,EAAGG,QAEZ,GAAW,OAAPpkG,EACF,OAAO/oC,KAAKylC,KAAK,QAAS,IAAImnG,GAGhCI,EAAGI,WAAa,KAChBJ,EAAGG,QAAU,KACD,MAARvsI,GACFZ,KAAK+E,KAAKnE,GACZmoC,EAAGonB,GACH,IAAIonC,EAAKv3F,KAAKw3F,eACdD,EAAGstC,SAAU,GAETttC,EAAGgyC,cAAgBhyC,EAAGj2F,OAASi2F,EAAGwsB,gBACpC/jH,KAAKiqC,MAAMstD,EAAGwsB,eAIlB,SAAShtE,EAAUl2C,GACjB,KAAMb,gBAAgB+2C,GAAY,OAAO,IAAIA,EAAUl2C,GACvDogC,EAAO1gC,KAAKP,KAAMa,GAClBb,KAAKitI,gBAAkB,CACrBF,eAAgBA,EAAe/iH,KAAKhqB,MACpCqtI,eAAe,EACfH,cAAc,EACdC,QAAS,KACTC,WAAY,KACZE,cAAe,MAGjBttI,KAAKw3F,eAAe+xC,cAAe,EAInCvpI,KAAKw3F,eAAezwD,MAAO,EAEvBlmC,IAC+B,mBAAtBA,EAAQqc,YAA0Bld,KAAKq3C,WAAax2C,EAAQqc,WAC1C,mBAAlBrc,EAAQo+C,QAAsBj/C,KAAKy3C,OAAS52C,EAAQo+C,QAIjEj/C,KAAK0kC,GAAG,YAAa6oG,GAGvB,SAASA,IACP,IAAI7iH,EAAQ1qB,KAEe,mBAAhBA,KAAKy3C,QAA0Bz3C,KAAKw3F,eAAer0D,UAK5DpO,EAAK/0B,KAAM,KAAM,MAJjBA,KAAKy3C,QAAO,SAAU0Y,EAAIvvD,GACxBm0B,EAAKrK,EAAOylC,EAAIvvD,MA6DtB,SAASm0B,EAAK8K,EAAQswB,EAAIvvD,GACxB,GAAIuvD,EAAI,OAAOtwB,EAAO4F,KAAK,QAAS0qB,GAMpC,GALY,MAARvvD,GACFi/B,EAAO96B,KAAKnE,GAIVi/B,EAAO+vB,eAAetuD,OAAQ,MAAM,IAAIwrI,EAC5C,GAAIjtG,EAAOotG,gBAAgBC,aAAc,MAAM,IAAIL,EACnD,OAAOhtG,EAAO96B,KAAK,MA9HrB,EAAQ,KAAR,CAAoBgyC,EAAW9V,GA+D/B8V,EAAU92C,UAAU8E,KAAO,SAAUo4C,EAAOnhB,GAE1C,OADAh8B,KAAKitI,gBAAgBI,eAAgB,EAC9BpsG,EAAOhhC,UAAU8E,KAAKxE,KAAKP,KAAMm9C,EAAOnhB,IAajD+a,EAAU92C,UAAUo3C,WAAa,SAAU8F,EAAOnhB,EAAU+M,GAC1DA,EAAG,IAAI+/F,EAA2B,kBAGpC/xF,EAAU92C,UAAUusC,OAAS,SAAU2Q,EAAOnhB,EAAU+M,GACtD,IAAIikG,EAAKhtI,KAAKitI,gBAKd,GAJAD,EAAGG,QAAUpkG,EACbikG,EAAGI,WAAajwF,EAChB6vF,EAAGM,cAAgBtxG,GAEdgxG,EAAGE,aAAc,CACpB,IAAI31C,EAAKv3F,KAAKw3F,gBACVw1C,EAAGK,eAAiB91C,EAAGgyC,cAAgBhyC,EAAGj2F,OAASi2F,EAAGwsB,gBAAe/jH,KAAKiqC,MAAMstD,EAAGwsB,iBAO3FhtE,EAAU92C,UAAUgqC,MAAQ,SAAUjsB,GACpC,IAAIgvH,EAAKhtI,KAAKitI,gBAEQ,OAAlBD,EAAGI,YAAwBJ,EAAGE,aAOhCF,EAAGK,eAAgB,GANnBL,EAAGE,cAAe,EAElBltI,KAAKq3C,WAAW21F,EAAGI,WAAYJ,EAAGM,cAAeN,EAAGD,kBAQxDh2F,EAAU92C,UAAUwkH,SAAW,SAAU16G,EAAKg/B,GAC5C9H,EAAOhhC,UAAUwkH,SAASlkH,KAAKP,KAAM+J,GAAK,SAAUyjI,GAClDzkG,EAAGykG,wCCtIHvsG,YAfJ,SAASwsG,EAAchqI,GACrB,IAAIinB,EAAQ1qB,KAEZA,KAAK0mB,KAAO,KACZ1mB,KAAKq8G,MAAQ,KAEbr8G,KAAK0tI,OAAS,YAimBhB,SAAwBC,EAASlqI,EAAOsG,GACtC,IAAIsyG,EAAQsxB,EAAQtxB,MAGpB,IAFAsxB,EAAQtxB,MAAQ,KAETA,GAAO,CACZ,IAAItzE,EAAKszE,EAAMv7E,SACfr9B,EAAMmqI,YACN7kG,EAvmBA8kG,WAwmBAxxB,EAAQA,EAAM31F,KAIhBjjB,EAAMqqI,mBAAmBpnH,KAAOinH,EA5mB9BE,CAAenjH,EAAOjnB,IAnB1BhF,EAAOC,QAAU8kD,EA8BjBA,EAASuqF,cAAgBA,EAGzB,IAyJIC,EAzJAC,EAAe,CACjBC,UAAW,EAAQ,OAMjB7F,EAAS,EAAQ,MAIjBnnI,EAAS,eAETonI,EAAgB,EAAAtmH,EAAO2V,YAAc,aAUrCgxG,EAAc,EAAQ,MAGtBC,EADW,EAAQ,MACSA,iBAE5BjhH,EAAiB,UACjBG,EAAuBH,EAAeG,qBACtCghH,EAA6BnhH,EAAemhH,2BAC5C8D,EAAwBjlH,EAAeilH,sBACvCuB,EAAyBxmH,EAAewmH,uBACxCC,EAAuBzmH,EAAeymH,qBACtCC,EAAyB1mH,EAAe0mH,uBACxCC,EAA6B3mH,EAAe2mH,2BAC5CC,EAAuB5mH,EAAe4mH,qBAEtCvF,EAAiBL,EAAYK,eAIjC,SAASwF,KAET,SAAST,EAAcltI,EAASg/B,EAAQqpG,GACtCjoG,EAASA,GAAU,EAAQ,MAC3BpgC,EAAUA,GAAW,GAMG,kBAAbqoI,IAAwBA,EAAWrpG,aAAkBoB,GAGhEjhC,KAAK8jH,aAAejjH,EAAQijH,WACxBolB,IAAUlpI,KAAK8jH,WAAa9jH,KAAK8jH,cAAgBjjH,EAAQ4yE,oBAI7DzzE,KAAK+jH,cAAgB6kB,EAAiB5oI,KAAMa,EAAS,wBAAyBqoI,GAE9ElpI,KAAKyuI,aAAc,EAEnBzuI,KAAK+vD,WAAY,EAEjB/vD,KAAK8vD,QAAS,EAEd9vD,KAAK6vD,OAAQ,EAEb7vD,KAAKyrI,UAAW,EAEhBzrI,KAAKmjC,WAAY,EAIjB,IAAIurG,GAAqC,IAA1B7tI,EAAQ8tI,cACvB3uI,KAAK2uI,eAAiBD,EAItB1uI,KAAK2hI,gBAAkB9gI,EAAQ8gI,iBAAmB,OAIlD3hI,KAAKsB,OAAS,EAEdtB,KAAK8kI,SAAU,EAEf9kI,KAAK4uI,OAAS,EAKd5uI,KAAK+mC,MAAO,EAIZ/mC,KAAK6uI,kBAAmB,EAExB7uI,KAAK8uI,QAAU,SAAU3+E,IA6R3B,SAAiBtwB,EAAQswB,GACvB,IAAI1sD,EAAQo8B,EAAO+vB,eACf7oB,EAAOtjC,EAAMsjC,KACbgC,EAAKtlC,EAAM0pI,QACf,GAAkB,mBAAPpkG,EAAmB,MAAM,IAAI6jG,EAExC,GAbF,SAA4BnpI,GAC1BA,EAAMqhI,SAAU,EAChBrhI,EAAM0pI,QAAU,KAChB1pI,EAAMnC,QAAUmC,EAAMsrI,SACtBtrI,EAAMsrI,SAAW,EAQjBC,CAAmBvrI,GACf0sD,GArCN,SAAsBtwB,EAAQp8B,EAAOsjC,EAAMopB,EAAIpnB,KAC3CtlC,EAAMmqI,UAEJ7mG,GAGFld,EAAQs/B,SAASpgB,EAAIonB,GAGrBtmC,EAAQs/B,SAAS8lF,EAAapvG,EAAQp8B,GACtCo8B,EAAO+vB,eAAes/E,cAAe,EACrClG,EAAenpG,EAAQswB,KAIvBpnB,EAAGonB,GACHtwB,EAAO+vB,eAAes/E,cAAe,EACrClG,EAAenpG,EAAQswB,GAGvB8+E,EAAYpvG,EAAQp8B,IAiBd0rI,CAAatvG,EAAQp8B,EAAOsjC,EAAMopB,EAAIpnB,OAAS,CAErD,IAAI0iG,EAAW2D,EAAW3rI,IAAUo8B,EAAOsD,UAEtCsoG,GAAahoI,EAAMmrI,QAAWnrI,EAAMorI,mBAAoBprI,EAAM4rI,iBACjEC,EAAYzvG,EAAQp8B,GAGlBsjC,EACFld,EAAQs/B,SAASomF,EAAY1vG,EAAQp8B,EAAOgoI,EAAU1iG,GAEtDwmG,EAAW1vG,EAAQp8B,EAAOgoI,EAAU1iG,IA7StC+lG,CAAQjvG,EAAQswB,IAIlBnwD,KAAKmtI,QAAU,KAEfntI,KAAK+uI,SAAW,EAChB/uI,KAAKqvI,gBAAkB,KACvBrvI,KAAKwvI,oBAAsB,KAG3BxvI,KAAK4tI,UAAY,EAGjB5tI,KAAKyvI,aAAc,EAEnBzvI,KAAKkvI,cAAe,EAEpBlvI,KAAK4pI,WAAkC,IAAtB/oI,EAAQ+oI,UAEzB5pI,KAAKikH,cAAgBpjH,EAAQojH,YAE7BjkH,KAAK0vI,qBAAuB,EAG5B1vI,KAAK8tI,mBAAqB,IAAIL,EAAcztI,MA4C9C,SAASwjD,EAAS3iD,GAUhB,IAAIqoI,EAAWlpI,gBATfihC,EAASA,GAAU,EAAQ,OAU3B,IAAKioG,IAAa8E,EAAgBztI,KAAKijD,EAAUxjD,MAAO,OAAO,IAAIwjD,EAAS3iD,GAC5Eb,KAAK4vD,eAAiB,IAAIm+E,EAAcltI,EAASb,KAAMkpI,GAEvDlpI,KAAKytB,UAAW,EAEZ5sB,IAC2B,mBAAlBA,EAAQoC,QAAsBjD,KAAKwsC,OAAS3rC,EAAQoC,OACjC,mBAAnBpC,EAAQ8uI,SAAuB3vI,KAAK4vI,QAAU/uI,EAAQ8uI,QAClC,mBAApB9uI,EAAQ2kC,UAAwBxlC,KAAKykH,SAAW5jH,EAAQ2kC,SACtC,mBAAlB3kC,EAAQ08C,QAAsBv9C,KAAKs9C,OAASz8C,EAAQ08C,QAGjE8qF,EAAO9nI,KAAKP,MAwJd,SAAS6vI,EAAQhwG,EAAQp8B,EAAOksI,EAAQvkI,EAAK+xC,EAAOnhB,EAAU+M,GAC5DtlC,EAAMsrI,SAAW3jI,EACjB3H,EAAM0pI,QAAUpkG,EAChBtlC,EAAMqhI,SAAU,EAChBrhI,EAAMsjC,MAAO,EACTtjC,EAAM0/B,UAAW1/B,EAAMqrI,QAAQ,IAAIV,EAAqB,UAAmBuB,EAAQ9vG,EAAO+vG,QAAQzyF,EAAO15C,EAAMqrI,SAAcjvG,EAAO2M,OAAO2Q,EAAOnhB,EAAUv4B,EAAMqrI,SACtKrrI,EAAMsjC,MAAO,EAwDf,SAASwoG,EAAW1vG,EAAQp8B,EAAOgoI,EAAU1iG,GACtC0iG,GASP,SAAsB5rG,EAAQp8B,GACP,IAAjBA,EAAMnC,QAAgBmC,EAAMssD,YAC9BtsD,EAAMssD,WAAY,EAClBlwB,EAAO4F,KAAK,UAZCqqG,CAAajwG,EAAQp8B,GACpCA,EAAMmqI,YACN7kG,IACAkmG,EAAYpvG,EAAQp8B,GActB,SAAS6rI,EAAYzvG,EAAQp8B,GAC3BA,EAAMorI,kBAAmB,EACzB,IAAIxyB,EAAQ54G,EAAM4rI,gBAElB,GAAIxvG,EAAO+vG,SAAWvzB,GAASA,EAAM31F,KAAM,CAEzC,IAAIjK,EAAIhZ,EAAMisI,qBACVnkI,EAAS,IAAI7J,MAAM+a,GACnBszH,EAAStsI,EAAMqqI,mBACnBiC,EAAO1zB,MAAQA,EAIf,IAHA,IAAI3qF,EAAQ,EACRs+G,GAAa,EAEV3zB,GACL9wG,EAAOmmB,GAAS2qF,EACXA,EAAM4zB,QAAOD,GAAa,GAC/B3zB,EAAQA,EAAM31F,KACdgL,GAAS,EAGXnmB,EAAOykI,WAAaA,EACpBH,EAAQhwG,EAAQp8B,GAAO,EAAMA,EAAMnC,OAAQiK,EAAQ,GAAIwkI,EAAOrC,QAG9DjqI,EAAMmqI,YACNnqI,EAAM+rI,oBAAsB,KAExBO,EAAOrpH,MACTjjB,EAAMqqI,mBAAqBiC,EAAOrpH,KAClCqpH,EAAOrpH,KAAO,MAEdjjB,EAAMqqI,mBAAqB,IAAIL,EAAchqI,GAG/CA,EAAMisI,qBAAuB,MACxB,CAEL,KAAOrzB,GAAO,CACZ,IAAIl/D,EAAQk/D,EAAMl/D,MACdnhB,EAAWqgF,EAAMrgF,SACjB+M,EAAKszE,EAAMv7E,SASf,GAPA+uG,EAAQhwG,EAAQp8B,GAAO,EADbA,EAAMqgH,WAAa,EAAI3mE,EAAM77C,OACJ67C,EAAOnhB,EAAU+M,GACpDszE,EAAQA,EAAM31F,KACdjjB,EAAMisI,uBAKFjsI,EAAMqhI,QACR,MAIU,OAAVzoB,IAAgB54G,EAAM+rI,oBAAsB,MAGlD/rI,EAAM4rI,gBAAkBhzB,EACxB54G,EAAMorI,kBAAmB,EA2C3B,SAASO,EAAW3rI,GAClB,OAAOA,EAAMqsD,QAA2B,IAAjBrsD,EAAMnC,QAA0C,OAA1BmC,EAAM4rI,kBAA6B5rI,EAAMgoI,WAAahoI,EAAMqhI,QAG3G,SAASoL,EAAUrwG,EAAQp8B,GACzBo8B,EAAOyd,QAAO,SAAUvzC,GACtBtG,EAAMmqI,YAEF7jI,GACFi/H,EAAenpG,EAAQ91B,GAGzBtG,EAAMgsI,aAAc,EACpB5vG,EAAO4F,KAAK,aACZwpG,EAAYpvG,EAAQp8B,MAiBxB,SAASwrI,EAAYpvG,EAAQp8B,GAC3B,IAAI0sI,EAAOf,EAAW3rI,GAEtB,GAAI0sI,IAhBN,SAAmBtwG,EAAQp8B,GACpBA,EAAMgsI,aAAgBhsI,EAAMgrI,cACF,mBAAlB5uG,EAAOyd,QAA0B75C,EAAM0/B,WAKhD1/B,EAAMgsI,aAAc,EACpB5vG,EAAO4F,KAAK,eALZhiC,EAAMmqI,YACNnqI,EAAMgrI,aAAc,EACpB5kH,EAAQs/B,SAAS+mF,EAAWrwG,EAAQp8B,KAYtC8pI,CAAU1tG,EAAQp8B,GAEM,IAApBA,EAAMmqI,YACRnqI,EAAMgoI,UAAW,EACjB5rG,EAAO4F,KAAK,UAERhiC,EAAMwgH,cAAa,CAGrB,IAAImsB,EAASvwG,EAAO23D,iBAEf44C,GAAUA,EAAOnsB,aAAemsB,EAAO9G,aAC1CzpG,EAAO2F,UAMf,OAAO2qG,EA3hBT,EAAQ,KAAR,CAAoB3sF,EAAU6kF,GAyF9B0F,EAAc9tI,UAAUioI,UAAY,WAIlC,IAHA,IAAIhhH,EAAUlnB,KAAKqvI,gBACfvsI,EAAM,GAEHokB,GACLpkB,EAAIiC,KAAKmiB,GACTA,EAAUA,EAAQR,KAGpB,OAAO5jB,GAGT,WACE,IACE0C,OAAO8nB,eAAeygH,EAAc9tI,UAAW,SAAU,CACvDb,IAAK6uI,EAAaC,WAAU,WAC1B,OAAOluI,KAAKkoI,cACX,6EAAmF,aAExF,MAAOzpH,KAPX,GAcsB,mBAAX8I,QAAyBA,OAAO8oH,aAAiE,mBAA3CjiH,SAASnuB,UAAUsnB,OAAO8oH,cACzFrC,EAAkB5/G,SAASnuB,UAAUsnB,OAAO8oH,aAC5C7qI,OAAO8nB,eAAek2B,EAAUj8B,OAAO8oH,YAAa,CAClD5uI,MAAO,SAAek+D,GACpB,QAAIquE,EAAgBztI,KAAKP,KAAM2/D,IAC3B3/D,OAASwjD,GACNmc,GAAUA,EAAO/P,0BAA0Bm+E,MAItDC,EAAkB,SAAyBruE,GACzC,OAAOA,aAAkB3/D,MA+B7BwjD,EAASvjD,UAAUklE,KAAO,WACxB6jE,EAAehpI,KAAM,IAAImuI,IA+B3B3qF,EAASvjD,UAAUgD,MAAQ,SAAUk6C,EAAOnhB,EAAU+M,GACpD,IAnNqB7kC,EAmNjBT,EAAQzD,KAAK4vD,eACbj8C,GAAM,EAENs8H,GAASxsI,EAAMqgH,aAtNE5/G,EAsN0Bi5C,EArNxCj8C,EAAOE,SAAS8C,IAAQA,aAAeokI,GAsO9C,OAfI2H,IAAU/uI,EAAOE,SAAS+7C,KAC5BA,EA7NJ,SAA6BA,GAC3B,OAAOj8C,EAAO2M,KAAKsvC,GA4NTmtF,CAAoBntF,IAGN,mBAAbnhB,IACT+M,EAAK/M,EACLA,EAAW,MAGTi0G,EAAOj0G,EAAW,SAAmBA,IAAUA,EAAWv4B,EAAMk+H,iBAClD,mBAAP54F,IAAmBA,EAAKylG,GAC/B/qI,EAAMqsD,OA7CZ,SAAuBjwB,EAAQkJ,GAC7B,IAAIonB,EAAK,IAAIm+E,EAEbtF,EAAenpG,EAAQswB,GACvBtmC,EAAQs/B,SAASpgB,EAAIonB,GAyCHmgF,CAActwI,KAAM+oC,IAAaknG,GAnCrD,SAAoBpwG,EAAQp8B,EAAO05C,EAAOpU,GACxC,IAAIonB,EAQJ,OANc,OAAVhT,EACFgT,EAAK,IAAIk+E,EACiB,iBAAVlxF,GAAuB15C,EAAMqgH,aAC7C3zD,EAAK,IAAIroC,EAAqB,QAAS,CAAC,SAAU,UAAWq1B,KAG3DgT,IACF64E,EAAenpG,EAAQswB,GACvBtmC,EAAQs/B,SAASpgB,EAAIonB,IACd,GAuBmDogF,CAAWvwI,KAAMyD,EAAO05C,EAAOpU,MACzFtlC,EAAMmqI,YACNj6H,EAwDJ,SAAuBksB,EAAQp8B,EAAOwsI,EAAO9yF,EAAOnhB,EAAU+M,GAC5D,IAAKknG,EAAO,CACV,IAAIO,EAtBR,SAAqB/sI,EAAO05C,EAAOnhB,GAKjC,OAJKv4B,EAAMqgH,aAAsC,IAAxBrgH,EAAMkrI,eAA4C,iBAAVxxF,IAC/DA,EAAQj8C,EAAO2M,KAAKsvC,EAAOnhB,IAGtBmhB,EAiBUszF,CAAYhtI,EAAO05C,EAAOnhB,GAErCmhB,IAAUqzF,IACZP,GAAQ,EACRj0G,EAAW,SACXmhB,EAAQqzF,GAIZ,IAAIplI,EAAM3H,EAAMqgH,WAAa,EAAI3mE,EAAM77C,OACvCmC,EAAMnC,QAAU8J,EAChB,IAAIuI,EAAMlQ,EAAMnC,OAASmC,EAAMsgH,cAI/B,GAFKpwG,IAAKlQ,EAAMssD,WAAY,GAExBtsD,EAAMqhI,SAAWrhI,EAAMmrI,OAAQ,CACjC,IAAI1vF,EAAOz7C,EAAM+rI,oBACjB/rI,EAAM+rI,oBAAsB,CAC1BryF,MAAOA,EACPnhB,SAAUA,EACVi0G,MAAOA,EACPnvG,SAAUiI,EACVriB,KAAM,MAGJw4B,EACFA,EAAKx4B,KAAOjjB,EAAM+rI,oBAElB/rI,EAAM4rI,gBAAkB5rI,EAAM+rI,oBAGhC/rI,EAAMisI,sBAAwB,OAE9BG,EAAQhwG,EAAQp8B,GAAO,EAAO2H,EAAK+xC,EAAOnhB,EAAU+M,GAGtD,OAAOp1B,EA9FC+8H,CAAc1wI,KAAMyD,EAAOwsI,EAAO9yF,EAAOnhB,EAAU+M,IAEpDp1B,GAGT6vC,EAASvjD,UAAUg0E,KAAO,WACxBj0E,KAAK4vD,eAAeg/E,UAGtBprF,EAASvjD,UAAUi0E,OAAS,WAC1B,IAAIzwE,EAAQzD,KAAK4vD,eAEbnsD,EAAMmrI,SACRnrI,EAAMmrI,SACDnrI,EAAMqhI,SAAYrhI,EAAMmrI,QAAWnrI,EAAMorI,mBAAoBprI,EAAM4rI,iBAAiBC,EAAYtvI,KAAMyD,KAI/G+/C,EAASvjD,UAAU0wI,mBAAqB,SAA4B30G,GAGlE,GADwB,iBAAbA,IAAuBA,EAAWA,EAAS6L,iBAChD,CAAC,MAAO,OAAQ,QAAS,QAAS,SAAU,SAAU,OAAQ,QAAS,UAAW,WAAY,OAAOza,SAAS4O,EAAW,IAAI6L,gBAAkB,GAAI,MAAM,IAAI0mG,EAAqBvyG,GAExL,OADAh8B,KAAK4vD,eAAe+xE,gBAAkB3lG,EAC/Bh8B,MAGTwF,OAAO8nB,eAAek2B,EAASvjD,UAAW,iBAAkB,CAI1DstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAK4vD,gBAAkB5vD,KAAK4vD,eAAes4E,eAYtD1iI,OAAO8nB,eAAek2B,EAASvjD,UAAW,wBAAyB,CAIjEstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAK4vD,eAAem0D,iBA4L/BvgE,EAASvjD,UAAUusC,OAAS,SAAU2Q,EAAOnhB,EAAU+M,GACrDA,EAAG,IAAI+/F,EAA2B,cAGpCtlF,EAASvjD,UAAU2vI,QAAU,KAE7BpsF,EAASvjD,UAAUyN,IAAM,SAAUyvC,EAAOnhB,EAAU+M,GAClD,IAAItlC,EAAQzD,KAAK4vD,eAoBjB,MAlBqB,mBAAVzS,GACTpU,EAAKoU,EACLA,EAAQ,KACRnhB,EAAW,MACkB,mBAAbA,IAChB+M,EAAK/M,EACLA,EAAW,MAGTmhB,MAAAA,GAAuCn9C,KAAKiD,MAAMk6C,EAAOnhB,GAEzDv4B,EAAMmrI,SACRnrI,EAAMmrI,OAAS,EACf5uI,KAAKk0E,UAIFzwE,EAAMqsD,QAsEb,SAAqBjwB,EAAQp8B,EAAOslC,GAClCtlC,EAAMqsD,QAAS,EACfm/E,EAAYpvG,EAAQp8B,GAEhBslC,IACEtlC,EAAMgoI,SAAU5hH,EAAQs/B,SAASpgB,GAASlJ,EAAO2E,KAAK,SAAUuE,IAGtEtlC,EAAMosD,OAAQ,EACdhwB,EAAOpS,UAAW,EA/ECmjH,CAAY5wI,KAAMyD,EAAOslC,GACrC/oC,MAGTwF,OAAO8nB,eAAek2B,EAASvjD,UAAW,iBAAkB,CAI1DstB,YAAY,EACZnuB,IAAK,WACH,OAAOY,KAAK4vD,eAAetuD,UAuF/BkE,OAAO8nB,eAAek2B,EAASvjD,UAAW,YAAa,CAIrDstB,YAAY,EACZnuB,IAAK,WACH,YAA4BgJ,IAAxBpI,KAAK4vD,gBAIF5vD,KAAK4vD,eAAezsB,WAE7BjkC,IAAK,SAAauC,GAGXzB,KAAK4vD,iBAMV5vD,KAAK4vD,eAAezsB,UAAY1hC,MAGpC+hD,EAASvjD,UAAUulC,QAAUmjG,EAAYnjG,QACzCge,EAASvjD,UAAUwqI,WAAa9B,EAAY+B,UAE5ClnF,EAASvjD,UAAUwkH,SAAW,SAAU16G,EAAKg/B,GAC3CA,EAAGh/B,qCCrrBD8mI,YAEJ,SAASxjH,EAAgBnpB,EAAKG,EAAK5C,GAAiK,OAApJ4C,KAAOH,EAAOsB,OAAO8nB,eAAeppB,EAAKG,EAAK,CAAE5C,MAAOA,EAAO8rB,YAAY,EAAMC,cAAc,EAAMC,UAAU,IAAkBvpB,EAAIG,GAAO5C,EAAgByC,EAE3M,IAAIunI,EAAW,EAAQ,MAEnBqF,EAAevpH,OAAO,eACtBwpH,EAAcxpH,OAAO,cACrBypH,EAASzpH,OAAO,SAChB0pH,EAAS1pH,OAAO,SAChB2pH,EAAe3pH,OAAO,eACtB4pH,EAAiB5pH,OAAO,iBACxB6pH,EAAU7pH,OAAO,UAErB,SAAS8pH,EAAiB5vI,EAAOszB,GAC/B,MAAO,CACLtzB,MAAOA,EACPszB,KAAMA,GAIV,SAASu8G,EAAet+C,GACtB,IAAIvnE,EAAUunE,EAAK89C,GAEnB,GAAgB,OAAZrlH,EAAkB,CACpB,IAAI7qB,EAAOoyF,EAAKo+C,GAAS9iG,OAIZ,OAAT1tC,IACFoyF,EAAKk+C,GAAgB,KACrBl+C,EAAK89C,GAAgB,KACrB99C,EAAK+9C,GAAe,KACpBtlH,EAAQ4lH,EAAiBzwI,GAAM,MAKrC,SAAS+jH,EAAW3xB,GAGlBnpE,EAAQs/B,SAASmoF,EAAgBt+C,GAgBnC,IAAIu+C,EAAyB/rI,OAAO0pB,gBAAe,eAC/CsiH,EAAuChsI,OAAOwpB,gBA4D/C3B,EA5D+DwjH,EAAwB,CACpFhxG,aACF,OAAO7/B,KAAKoxI,IAGd1qH,KAAM,WACJ,IAAIgE,EAAQ1qB,KAIRuB,EAAQvB,KAAKgxI,GAEjB,GAAc,OAAVzvI,EACF,OAAOiqB,QAAQgd,OAAOjnC,GAGxB,GAAIvB,KAAKixI,GACP,OAAOzlH,QAAQC,QAAQ4lH,OAAiBjpI,GAAW,IAGrD,GAAIpI,KAAKoxI,GAASjuG,UAKhB,OAAO,IAAI3X,SAAQ,SAAUC,EAAS+c,GACpC3e,EAAQs/B,UAAS,WACXz+B,EAAMsmH,GACRxoG,EAAO9d,EAAMsmH,IAEbvlH,EAAQ4lH,OAAiBjpI,GAAW,UAU5C,IACI6kG,EADAwkC,EAAczxI,KAAKkxI,GAGvB,GAAIO,EACFxkC,EAAU,IAAIzhF,QA1DpB,SAAqBimH,EAAaz+C,GAChC,OAAO,SAAUvnE,EAAS+c,GACxBipG,EAAYrmH,MAAK,WACX4nE,EAAKi+C,GACPxlH,EAAQ4lH,OAAiBjpI,GAAW,IAItC4qF,EAAKm+C,GAAgB1lH,EAAS+c,KAC7BA,IAiDqBkpG,CAAYD,EAAazxI,WAC1C,CAGL,IAAIY,EAAOZ,KAAKoxI,GAAS9iG,OAEzB,GAAa,OAAT1tC,EACF,OAAO4qB,QAAQC,QAAQ4lH,EAAiBzwI,GAAM,IAGhDqsG,EAAU,IAAIzhF,QAAQxrB,KAAKmxI,IAI7B,OADAnxI,KAAKkxI,GAAgBjkC,EACdA,IAE+B1lF,OAAOklH,eAAe,WAC9D,OAAOzsI,QACLqtB,EAAgBwjH,EAAuB,UAAU,WACnD,IAAIlhF,EAAS3vD,KAKb,OAAO,IAAIwrB,SAAQ,SAAUC,EAAS+c,GACpCmnB,EAAOyhF,GAAS5rG,QAAQ,MAAM,SAAUz7B,GAClCA,EACFy+B,EAAOz+B,GAIT0hB,EAAQ4lH,OAAiBjpI,GAAW,aAGtCyoI,GAAwBU,GAoE5B9yI,EAAOC,QAlEiC,SAA2CmhC,GACjF,IAAI8xG,EAEAnqH,EAAWhiB,OAAOgpB,OAAOgjH,GAA4DnkH,EAArBskH,EAAiB,GAAoCP,EAAS,CAChI3vI,MAAOo+B,EACPpS,UAAU,IACRJ,EAAgBskH,EAAgBb,EAAc,CAChDrvI,MAAO,KACPgsB,UAAU,IACRJ,EAAgBskH,EAAgBZ,EAAa,CAC/CtvI,MAAO,KACPgsB,UAAU,IACRJ,EAAgBskH,EAAgBX,EAAQ,CAC1CvvI,MAAO,KACPgsB,UAAU,IACRJ,EAAgBskH,EAAgBV,EAAQ,CAC1CxvI,MAAOo+B,EAAO23D,eAAe8xC,WAC7B77G,UAAU,IACRJ,EAAgBskH,EAAgBR,EAAgB,CAClD1vI,MAAO,SAAegqB,EAAS+c,GAC7B,IAAI5nC,EAAO4mB,EAAS4pH,GAAS9iG,OAEzB1tC,GACF4mB,EAAS0pH,GAAgB,KACzB1pH,EAASspH,GAAgB,KACzBtpH,EAASupH,GAAe,KACxBtlH,EAAQ4lH,EAAiBzwI,GAAM,MAE/B4mB,EAASspH,GAAgBrlH,EACzBjE,EAASupH,GAAevoG,IAG5B/a,UAAU,IACRkkH,IA8BJ,OA7BAnqH,EAAS0pH,GAAgB,KACzBzF,EAAS5rG,GAAQ,SAAU91B,GACzB,GAAIA,GAAoB,+BAAbA,EAAI4oB,KAAuC,CACpD,IAAI6V,EAAShhB,EAASupH,GAWtB,OARe,OAAXvoG,IACFhhB,EAAS0pH,GAAgB,KACzB1pH,EAASspH,GAAgB,KACzBtpH,EAASupH,GAAe,KACxBvoG,EAAOz+B,SAGTyd,EAASwpH,GAAUjnI,GAIrB,IAAI0hB,EAAUjE,EAASspH,GAEP,OAAZrlH,IACFjE,EAAS0pH,GAAgB,KACzB1pH,EAASspH,GAAgB,KACzBtpH,EAASupH,GAAe,KACxBtlH,EAAQ4lH,OAAiBjpI,GAAW,KAGtCof,EAASypH,IAAU,KAErBpxG,EAAO6E,GAAG,WAAYigF,EAAW36F,KAAK,KAAMxC,IACrCA,gCCzMT,SAAS0L,EAAQysC,EAAQiyE,GAAkB,IAAInsI,EAAOD,OAAOC,KAAKk6D,GAAS,GAAIn6D,OAAO2tB,sBAAuB,CAAE,IAAI0rC,EAAUr5D,OAAO2tB,sBAAsBwsC,GAAaiyE,IAAgB/yE,EAAUA,EAAQ15D,QAAO,SAAUiuB,GAAO,OAAO5tB,OAAO6tB,yBAAyBssC,EAAQvsC,GAAK7F,eAAgB9nB,EAAKV,KAAKC,MAAMS,EAAMo5D,GAAY,OAAOp5D,EAI9U,SAAS4nB,EAAgBnpB,EAAKG,EAAK5C,GAAiK,OAApJ4C,KAAOH,EAAOsB,OAAO8nB,eAAeppB,EAAKG,EAAK,CAAE5C,MAAOA,EAAO8rB,YAAY,EAAMC,cAAc,EAAMC,UAAU,IAAkBvpB,EAAIG,GAAO5C,EAAgByC,EAI3M,SAASwpB,EAAkBC,EAAQC,GAAS,IAAK,IAAIviB,EAAI,EAAGA,EAAIuiB,EAAMtsB,OAAQ+J,IAAK,CAAE,IAAIwiB,EAAaD,EAAMviB,GAAIwiB,EAAWN,WAAaM,EAAWN,aAAc,EAAOM,EAAWL,cAAe,EAAU,UAAWK,IAAYA,EAAWJ,UAAW,GAAMjoB,OAAO8nB,eAAeK,EAAQE,EAAWxpB,IAAKwpB,IAI7S,IACI3sB,EADW,EAAQ,MACDA,OAGlBoR,EADY,EAAQ,MACAA,QAEpB0gB,EAAS1gB,GAAWA,EAAQ0gB,QAAU,UAM1Cv0B,EAAOC,QAEP,WACE,SAASgqI,KArBX,SAAyB/9G,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAIC,UAAU,qCAsB5GC,CAAgB9qB,KAAM0oI,GAEtB1oI,KAAKw8F,KAAO,KACZx8F,KAAKy8C,KAAO,KACZz8C,KAAKsB,OAAS,EAtBlB,IAAsBspB,EAAagI,EAoMjC,OApMoBhI,EAyBP89G,EAzBoB91G,EAyBR,CAAC,CACxBvuB,IAAK,OACL5C,MAAO,SAAcs3C,GACnB,IAAIsjE,EAAQ,CACVz7G,KAAMm4C,EACNryB,KAAM,MAEJ1mB,KAAKsB,OAAS,EAAGtB,KAAKy8C,KAAK/1B,KAAO21F,EAAWr8G,KAAKw8F,KAAO6f,EAC7Dr8G,KAAKy8C,KAAO4/D,IACVr8G,KAAKsB,SAER,CACD+C,IAAK,UACL5C,MAAO,SAAiBs3C,GACtB,IAAIsjE,EAAQ,CACVz7G,KAAMm4C,EACNryB,KAAM1mB,KAAKw8F,MAEO,IAAhBx8F,KAAKsB,SAActB,KAAKy8C,KAAO4/D,GACnCr8G,KAAKw8F,KAAO6f,IACVr8G,KAAKsB,SAER,CACD+C,IAAK,QACL5C,MAAO,WACL,GAAoB,IAAhBzB,KAAKsB,OAAT,CACA,IAAIqS,EAAM3T,KAAKw8F,KAAK57F,KAGpB,OAFoB,IAAhBZ,KAAKsB,OAActB,KAAKw8F,KAAOx8F,KAAKy8C,KAAO,KAAUz8C,KAAKw8F,KAAOx8F,KAAKw8F,KAAK91E,OAC7E1mB,KAAKsB,OACAqS,KAER,CACDtP,IAAK,QACL5C,MAAO,WACLzB,KAAKw8F,KAAOx8F,KAAKy8C,KAAO,KACxBz8C,KAAKsB,OAAS,IAEf,CACD+C,IAAK,OACL5C,MAAO,SAAc0b,GACnB,GAAoB,IAAhBnd,KAAKsB,OAAc,MAAO,GAI9B,IAHA,IAAIkO,EAAIxP,KAAKw8F,KACT7oF,EAAM,GAAKnE,EAAE5O,KAEV4O,EAAIA,EAAEkX,MACX/S,GAAOwJ,EAAI3N,EAAE5O,KAGf,OAAO+S,IAER,CACDtP,IAAK,SACL5C,MAAO,SAAgBuc,GACrB,GAAoB,IAAhBhe,KAAKsB,OAAc,OAAOJ,EAAO6B,MAAM,GAK3C,IAJA,IArEc60C,EAAKjqB,EAAQtsB,EAqEvBsS,EAAMzS,EAAOkpC,YAAYpsB,IAAM,GAC/BxO,EAAIxP,KAAKw8F,KACTnxF,EAAI,EAEDmE,GAzEOooC,EA0EDpoC,EAAE5O,KA1EI+sB,EA0EEha,EA1EMtS,EA0EDgK,EAzE9BnK,EAAOjB,UAAUiD,KAAK3C,KAAKq3C,EAAKjqB,EAAQtsB,GA0ElCgK,GAAKmE,EAAE5O,KAAKU,OACZkO,EAAIA,EAAEkX,KAGR,OAAO/S,IAGR,CACDtP,IAAK,UACL5C,MAAO,SAAiBuc,EAAG6zH,GACzB,IAAIl+H,EAcJ,OAZIqK,EAAIhe,KAAKw8F,KAAK57F,KAAKU,QAErBqS,EAAM3T,KAAKw8F,KAAK57F,KAAKgC,MAAM,EAAGob,GAC9Bhe,KAAKw8F,KAAK57F,KAAOZ,KAAKw8F,KAAK57F,KAAKgC,MAAMob,IAGtCrK,EAFSqK,IAAMhe,KAAKw8F,KAAK57F,KAAKU,OAExBtB,KAAK2gB,QAGLkxH,EAAa7xI,KAAK8xI,WAAW9zH,GAAKhe,KAAK+xI,WAAW/zH,GAGnDrK,IAER,CACDtP,IAAK,QACL5C,MAAO,WACL,OAAOzB,KAAKw8F,KAAK57F,OAGlB,CACDyD,IAAK,aACL5C,MAAO,SAAoBuc,GACzB,IAAIxO,EAAIxP,KAAKw8F,KACThsF,EAAI,EACJmD,EAAMnE,EAAE5O,KAGZ,IAFAod,GAAKrK,EAAIrS,OAEFkO,EAAIA,EAAEkX,MAAM,CACjB,IAAIrd,EAAMmG,EAAE5O,KACRoxI,EAAKh0H,EAAI3U,EAAI/H,OAAS+H,EAAI/H,OAAS0c,EAIvC,GAHIg0H,IAAO3oI,EAAI/H,OAAQqS,GAAOtK,EAASsK,GAAOtK,EAAIzG,MAAM,EAAGob,GAGjD,IAFVA,GAAKg0H,GAEQ,CACPA,IAAO3oI,EAAI/H,UACXkP,EACEhB,EAAEkX,KAAM1mB,KAAKw8F,KAAOhtF,EAAEkX,KAAU1mB,KAAKw8F,KAAOx8F,KAAKy8C,KAAO,OAE5Dz8C,KAAKw8F,KAAOhtF,EACZA,EAAE5O,KAAOyI,EAAIzG,MAAMovI,IAGrB,QAGAxhI,EAIJ,OADAxQ,KAAKsB,QAAUkP,EACRmD,IAGR,CACDtP,IAAK,aACL5C,MAAO,SAAoBuc,GACzB,IAAIrK,EAAMzS,EAAOkpC,YAAYpsB,GACzBxO,EAAIxP,KAAKw8F,KACThsF,EAAI,EAIR,IAHAhB,EAAE5O,KAAKsC,KAAKyQ,GACZqK,GAAKxO,EAAE5O,KAAKU,OAELkO,EAAIA,EAAEkX,MAAM,CACjB,IAAI1b,EAAMwE,EAAE5O,KACRoxI,EAAKh0H,EAAIhT,EAAI1J,OAAS0J,EAAI1J,OAAS0c,EAIvC,GAHAhT,EAAI9H,KAAKyQ,EAAKA,EAAIrS,OAAS0c,EAAG,EAAGg0H,GAGvB,IAFVh0H,GAAKg0H,GAEQ,CACPA,IAAOhnI,EAAI1J,UACXkP,EACEhB,EAAEkX,KAAM1mB,KAAKw8F,KAAOhtF,EAAEkX,KAAU1mB,KAAKw8F,KAAOx8F,KAAKy8C,KAAO,OAE5Dz8C,KAAKw8F,KAAOhtF,EACZA,EAAE5O,KAAOoK,EAAIpI,MAAMovI,IAGrB,QAGAxhI,EAIJ,OADAxQ,KAAKsB,QAAUkP,EACRmD,IAGR,CACDtP,IAAK2uB,EACLvxB,MAAO,SAAegd,EAAG5d,GACvB,OAAOyR,EAAQtS,KAnMrB,SAAuB2tB,GAAU,IAAK,IAAItiB,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IAAK,CAAE,IAAI0kB,EAAyB,MAAhB9qB,UAAUoG,GAAapG,UAAUoG,GAAK,GAAQA,EAAI,EAAK6nB,EAAQ1tB,OAAOuqB,IAAS,GAAM/sB,SAAQ,SAAUqB,GAAOgpB,EAAgBM,EAAQtpB,EAAK0rB,EAAO1rB,OAAsBmB,OAAOysI,0BAA6BzsI,OAAO4wC,iBAAiBzoB,EAAQnoB,OAAOysI,0BAA0BliH,IAAmBmD,EAAQ1tB,OAAOuqB,IAAS/sB,SAAQ,SAAUqB,GAAOmB,OAAO8nB,eAAeK,EAAQtpB,EAAKmB,OAAO6tB,yBAAyBtD,EAAQ1rB,OAAe,OAAOspB,EAmMlf2F,CAAc,GAAIzyB,EAAS,CAE9CsvB,MAAO,EAEPD,eAAe,QA/L2C0C,GAAYlF,EAAkB9C,EAAY3qB,UAAW2yB,GAoM9G81G,EApLT,8CC2BA,SAASwJ,EAAoBv/H,EAAM5I,GACjCooI,EAAYx/H,EAAM5I,GAClBskD,EAAY17C,GAGd,SAAS07C,EAAY17C,GACfA,EAAKi9C,iBAAmBj9C,EAAKi9C,eAAeg6E,WAC5Cj3H,EAAK6kF,iBAAmB7kF,EAAK6kF,eAAeoyC,WAChDj3H,EAAK8yB,KAAK,SAsBZ,SAAS0sG,EAAYx/H,EAAM5I,GACzB4I,EAAK8yB,KAAK,QAAS17B,GAcrBtL,EAAOC,QAAU,CACf8mC,QAnGF,SAAiBz7B,EAAKg/B,GACpB,IAAIre,EAAQ1qB,KAERoyI,EAAoBpyI,KAAKw3F,gBAAkBx3F,KAAKw3F,eAAer0D,UAC/DkvG,EAAoBryI,KAAK4vD,gBAAkB5vD,KAAK4vD,eAAezsB,UAEnE,OAAIivG,GAAqBC,GACnBtpG,EACFA,EAAGh/B,GACMA,IACJ/J,KAAK4vD,eAEE5vD,KAAK4vD,eAAes/E,eAC9BlvI,KAAK4vD,eAAes/E,cAAe,EACnCrlH,EAAQs/B,SAASgpF,EAAanyI,KAAM+J,IAHpC8f,EAAQs/B,SAASgpF,EAAanyI,KAAM+J,IAOjC/J,OAKLA,KAAKw3F,iBACPx3F,KAAKw3F,eAAer0D,WAAY,GAI9BnjC,KAAK4vD,iBACP5vD,KAAK4vD,eAAezsB,WAAY,GAGlCnjC,KAAKykH,SAAS16G,GAAO,MAAM,SAAUA,IAC9Bg/B,GAAMh/B,EACJ2gB,EAAMklC,eAECllC,EAAMklC,eAAes/E,aAI/BrlH,EAAQs/B,SAASkF,EAAa3jC,IAH9BA,EAAMklC,eAAes/E,cAAe,EACpCrlH,EAAQs/B,SAAS+oF,EAAqBxnH,EAAO3gB,IAH7C8f,EAAQs/B,SAAS+oF,EAAqBxnH,EAAO3gB,GAOtCg/B,GACTlf,EAAQs/B,SAASkF,EAAa3jC,GAC9Bqe,EAAGh/B,IAEH8f,EAAQs/B,SAASkF,EAAa3jC,MAI3B1qB,OAkDP0qI,UApCF,WACM1qI,KAAKw3F,iBACPx3F,KAAKw3F,eAAer0D,WAAY,EAChCnjC,KAAKw3F,eAAeqtC,SAAU,EAC9B7kI,KAAKw3F,eAAe3nC,OAAQ,EAC5B7vD,KAAKw3F,eAAe8xC,YAAa,GAG/BtpI,KAAK4vD,iBACP5vD,KAAK4vD,eAAezsB,WAAY,EAChCnjC,KAAK4vD,eAAeC,OAAQ,EAC5B7vD,KAAK4vD,eAAeE,QAAS,EAC7B9vD,KAAK4vD,eAAe6+E,aAAc,EAClCzuI,KAAK4vD,eAAe6/E,aAAc,EAClCzvI,KAAK4vD,eAAe67E,UAAW,EAC/BzrI,KAAK4vD,eAAes/E,cAAe,IAsBrClG,eAdF,SAAwBnpG,EAAQ91B,GAM9B,IAAIqmI,EAASvwG,EAAO23D,eAChBg0C,EAAS3rG,EAAO+vB,eAChBwgF,GAAUA,EAAOnsB,aAAeunB,GAAUA,EAAOvnB,YAAapkF,EAAO2F,QAAQz7B,GAAU81B,EAAO4F,KAAK,QAAS17B,kCC7FlH,IAAIuoI,EAA6B,qCAgBjC,SAASvsG,KAmFTtnC,EAAOC,QA7EP,SAAS44F,EAAIz3D,EAAQZ,EAAM6B,GACzB,GAAoB,mBAAT7B,EAAqB,OAAOq4D,EAAIz3D,EAAQ,KAAMZ,GACpDA,IAAMA,EAAO,IAClB6B,EAvBF,SAAcA,GACZ,IAAI2mF,GAAS,EACb,OAAO,WACL,IAAIA,EAAJ,CACAA,GAAS,EAET,IAAK,IAAIj+F,EAAOvkB,UAAU3D,OAAQuC,EAAO,IAAInC,MAAM8nB,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAC/E5lB,EAAK4lB,GAAQxkB,UAAUwkB,GAGzBqX,EAAS97B,MAAMhF,KAAM6D,KAaZ2gC,CAAK1D,GAAYiF,GAC5B,IAAIk/B,EAAWhmC,EAAKgmC,WAA8B,IAAlBhmC,EAAKgmC,UAAsBplC,EAAOolC,SAC9Dx3C,EAAWwR,EAAKxR,WAA8B,IAAlBwR,EAAKxR,UAAsBoS,EAAOpS,SAE9DiqE,EAAiB,WACd73D,EAAOpS,UAAUkqE,KAGpB46C,EAAgB1yG,EAAO+vB,gBAAkB/vB,EAAO+vB,eAAe67E,SAE/D9zC,EAAW,WACblqE,GAAW,EACX8kH,GAAgB,EACXttE,GAAUnkC,EAASvgC,KAAKs/B,IAG3B2yG,EAAgB3yG,EAAO23D,gBAAkB33D,EAAO23D,eAAe8xC,WAE/D1xC,EAAQ,WACV3yB,GAAW,EACXutE,GAAgB,EACX/kH,GAAUqT,EAASvgC,KAAKs/B,IAG3BmqB,EAAU,SAAiBjgD,GAC7B+2B,EAASvgC,KAAKs/B,EAAQ91B,IAGpBguF,EAAU,WACZ,IAAIhuF,EAEJ,OAAIk7D,IAAautE,GACV3yG,EAAO23D,gBAAmB33D,EAAO23D,eAAe3nC,QAAO9lD,EAAM,IAAIuoI,GAC/DxxG,EAASvgC,KAAKs/B,EAAQ91B,IAG3B0jB,IAAa8kH,GACV1yG,EAAO+vB,gBAAmB/vB,EAAO+vB,eAAeC,QAAO9lD,EAAM,IAAIuoI,GAC/DxxG,EAASvgC,KAAKs/B,EAAQ91B,SAF/B,GAMEkuF,EAAY,WACdp4D,EAAO2O,IAAI9J,GAAG,SAAUizD,IAiB1B,OAnEF,SAAmB93D,GACjB,OAAOA,EAAOq4D,WAAqC,mBAAjBr4D,EAAOs4D,MAoDrCC,CAAUv4D,IACZA,EAAO6E,GAAG,WAAYizD,GACtB93D,EAAO6E,GAAG,QAASqzD,GACfl4D,EAAO2O,IAAKypD,IAAiBp4D,EAAO6E,GAAG,UAAWuzD,IAC7CxqE,IAAaoS,EAAO+vB,iBAE7B/vB,EAAO6E,GAAG,MAAOgzD,GACjB73D,EAAO6E,GAAG,QAASgzD,IAGrB73D,EAAO6E,GAAG,MAAOkzD,GACjB/3D,EAAO6E,GAAG,SAAUizD,IACD,IAAf14D,EAAK19B,OAAiBs+B,EAAO6E,GAAG,QAASslB,GAC7CnqB,EAAO6E,GAAG,QAASqzD,GACZ,WACLl4D,EAAOwT,eAAe,WAAYskD,GAClC93D,EAAOwT,eAAe,QAAS0kD,GAC/Bl4D,EAAOwT,eAAe,UAAW4kD,GAC7Bp4D,EAAO2O,KAAK3O,EAAO2O,IAAI6E,eAAe,SAAUskD,GACpD93D,EAAOwT,eAAe,MAAOqkD,GAC7B73D,EAAOwT,eAAe,QAASqkD,GAC/B73D,EAAOwT,eAAe,SAAUskD,GAChC93D,EAAOwT,eAAe,MAAOukD,GAC7B/3D,EAAOwT,eAAe,QAAS2W,GAC/BnqB,EAAOwT,eAAe,QAAS0kD,eCnGnCt5F,EAAOC,QAAU,WACf,MAAM,IAAIO,MAAM,+ECGlB,IAAIq4F,EAWA3vE,EAAiB,UACjBM,EAAmBN,EAAeM,iBAClCmmH,EAAuBzmH,EAAeymH,qBAE1C,SAASroG,EAAKh8B,GAEZ,GAAIA,EAAK,MAAMA,EAOjB,SAAS66H,EAAU/kG,EAAQglG,EAASC,EAAShkG,GAC3CA,EAvBF,SAAcA,GACZ,IAAI2mF,GAAS,EACb,OAAO,WACDA,IACJA,GAAS,EACT3mF,EAAS97B,WAAM,EAAQC,aAkBdu/B,CAAK1D,GAChB,IAAI0pE,GAAS,EACb3qE,EAAO6E,GAAG,SAAS,WACjB8lE,GAAS,UAECpiG,IAARkvF,IAAmBA,EAAM,EAAQ,OACrCA,EAAIz3D,EAAQ,CACVolC,SAAU4/D,EACVp3G,SAAUq3G,IACT,SAAU/6H,GACX,GAAIA,EAAK,OAAO+2B,EAAS/2B,GACzBygG,GAAS,EACT1pE,OAEF,IAAIqC,GAAY,EAChB,OAAO,SAAUp5B,GACf,IAAIygG,IACArnE,EAGJ,OAFAA,GAAY,EAvBhB,SAAmBtD,GACjB,OAAOA,EAAOq4D,WAAqC,mBAAjBr4D,EAAOs4D,MAwBnCC,CAAUv4D,GAAgBA,EAAOs4D,QACP,mBAAnBt4D,EAAO2F,QAA+B3F,EAAO2F,eACxD1E,EAAS/2B,GAAO,IAAIqkI,EAAqB,UAI7C,SAAS7tI,EAAK0oB,GACZA,IAGF,SAASk8C,EAAKt3D,EAAM4qF,GAClB,OAAO5qF,EAAKs3D,KAAKszB,GAGnB,SAASg6C,EAAYlsE,GACnB,OAAKA,EAAQjlE,OAC8B,mBAAhCilE,EAAQA,EAAQjlE,OAAS,GAA0BykC,EACvDwgC,EAAQx0C,MAFagU,EAgC9BtnC,EAAOC,QA3BP,WACE,IAAK,IAAI8qB,EAAOvkB,UAAU3D,OAAQilE,EAAU,IAAI7kE,MAAM8nB,GAAOC,EAAO,EAAGA,EAAOD,EAAMC,IAClF88C,EAAQ98C,GAAQxkB,UAAUwkB,GAG5B,IAOIloB,EAPAu/B,EAAW2xG,EAAYlsE,GAG3B,GAFI7kE,MAAMC,QAAQ4kE,EAAQ,MAAKA,EAAUA,EAAQ,IAE7CA,EAAQjlE,OAAS,EACnB,MAAM,IAAI2mB,EAAiB,WAI7B,IAAIi9G,EAAW3+D,EAAQ3kE,KAAI,SAAUi+B,EAAQx0B,GAC3C,IAAIw5H,EAAUx5H,EAAIk7D,EAAQjlE,OAAS,EAEnC,OAAOsjI,EAAU/kG,EAAQglG,EADXx5H,EAAI,GACyB,SAAUtB,GAC9CxI,IAAOA,EAAQwI,GAChBA,GAAKm7H,EAASliI,QAAQzC,GACtBskI,IACJK,EAASliI,QAAQzC,GACjBugC,EAASv/B,UAGb,OAAOglE,EAAQnoC,OAAO+mC,iCC3FxB,IAAIutE,EAAwB,gCAsB5Bj0I,EAAOC,QAAU,CACfkqI,iBAjBF,SAA0BnlI,EAAO5C,EAAS8xI,EAAWzJ,GACnD,IAAI/sC,EALN,SAA2Bt7F,EAASqoI,EAAUyJ,GAC5C,OAAgC,MAAzB9xI,EAAQkjH,cAAwBljH,EAAQkjH,cAAgBmlB,EAAWroI,EAAQ8xI,GAAa,KAIrFC,CAAkB/xI,EAASqoI,EAAUyJ,GAE/C,GAAW,MAAPx2C,EAAa,CACf,IAAMh9D,SAASg9D,IAAQrrF,KAAK6gB,MAAMwqE,KAASA,GAAQA,EAAM,EAEvD,MAAM,IAAIu2C,EADCxJ,EAAWyJ,EAAY,gBACIx2C,GAGxC,OAAOrrF,KAAK6gB,MAAMwqE,GAIpB,OAAO14F,EAAMqgH,WAAa,GAAK,wBCrBjCrlH,EAAOC,QAAU,EAAjB,oCCAAA,EAAUD,EAAOC,QAAU,EAAjB,OACF2pI,OAAS3pI,EACjBA,EAAQ+9F,SAAW/9F,EACnBA,EAAQ8kD,SAAW,EAAnB,MACA9kD,EAAQuiC,OAAS,EAAjB,MACAviC,EAAQq4C,UAAY,EAApB,MACAr4C,EAAQsmE,YAAc,EAAtB,MACAtmE,EAAQ+sI,SAAW,EAAnB,MACA/sI,EAAQm0I,SAAW,EAAnB,oBCPAn0I,EAAQo0I,OA8ER,SAAiBjuE,EAAM56D,EAAMg1B,EAAM8J,GACb,mBAAT9J,IACT8J,EAAK9J,EACLA,EAAO,IAEJA,IAAMA,EAAO,IACb8J,IAAIA,EAAK,QAEdgqG,EAAaluE,GACbmuE,EAAU/zG,GAEU,iBAATh1B,IAAmBA,EAAOy/D,SAASupE,cAAchpI,IAE5DipI,EAAYruE,GAAM44C,IAChB,GAAIxzG,EAAKkpI,WAAa11B,EAAQjwG,cAAe,CAC3C,MAAM0zH,EAAUn6H,EAAKm6H,QAAQr8D,EAAK/kE,MAAM+nC,cAExC,MAAM,IAAI5oC,MACR,kBAAkBiiI,gBAAsBj3H,EAAKkpI,SAAStrG,qCAAqC41E,MAM/F,MAFgB,UAAZA,GAAmC,UAAZA,GAAqB21B,EAAanpI,EAAMg1B,GAE5Dh1B,IACNg1B,EAAM8J,IAtGXrqC,EAAQ20I,OAyGR,SAAiBxuE,EAAMyuE,EAAUr0G,EAAM8J,GAarC,GAZoB,mBAAT9J,IACT8J,EAAK9J,EACLA,EAAO,IAEJA,IAAMA,EAAO,IACb8J,IAAIA,EAAK,QAEdgqG,EAAaluE,GACbmuE,EAAU/zG,GAEc,iBAAbq0G,IAAuBA,EAAW5pE,SAASupE,cAAcK,IAEhEA,IAAmC,UAAtBA,EAASH,UAA8C,UAAtBG,EAASH,UACzD,MAAM,IAAIl0I,MACR,8GAmBJ,SAASs0I,EAAY91B,GACnB,MAAMxzG,EAAOy/D,SAASstC,cAAcyG,GAEpC,OADA61B,EAASE,YAAYvpI,GACdA,EAjBTipI,EAAYruE,GAEZ,SAAkB44C,GAChB,MAAgB,UAAZA,GAAmC,UAAZA,EAI7B,SAAsBA,GACpB,MAAMxzG,EAAOspI,EAAW91B,GAGxB,OAFA21B,EAAanpI,EAAMg1B,GACnBq0G,EAASE,YAAYvpI,GACdA,EARgDwpI,CAAYh2B,GACvD81B,EAAW91B,KAJEx+E,GAoB3B,SAAel1B,EAAKE,GACdF,GAAOE,GAAMA,EAAKixD,SACtBnyB,EAAGh/B,EAAKE,OAlJZvL,EAAQg1I,KAAO,EAAf,KAEA,MAAMj0G,EAAQ,EAAQ,KAAR,CAAiB,gBACzBk0G,EAAU,EAAQ,MAClBz+B,EAAsB,EAAQ,MAC9BnuG,EAAO,EAAQ,MACf6sI,EAAkB,EAAQ,MAC1BC,EAAc,EAAQ,MAItBC,EAAmB,CACvB,OACA,OACA,OACA,OACA,QAGIC,EAAyB,CAC7B,OACA,OACA,OACA,SAUIC,EAAmB,GAAGzwI,OAC1BwwI,EAR6B,CAC7B,OACA,OACA,OACA,SAQIE,EAAa,CACjB,OACA,QAGIC,EAAa,CACjB,OACA,OACA,OACA,OACA,SAGIC,EAAa,CACjB,OACA,OACA,QACA,OACA,OACA,QAGIC,EAAc,CAClB,OACA,QACA,MACA,MACA,OACA,OACA,QAOIh/B,EAAgC,oBAAX/kG,QAA0BA,OAAO+kG,YA4E5D,SAAS89B,EAAaruE,EAAMwvE,EAASp1G,EAAM8J,GACzC,MAAMm4F,EAAUn6H,EAAKm6H,QAAQr8D,EAAK/kE,MAAM+nC,cACxC,IACI59B,EADAytG,EAAc,EA+FlB,SAAS48B,IACP,QAA2B,iBAAhBzvE,EAAKvjE,QAAuBujE,EAAKvjE,OAAS29B,EAAKs1G,gBACxD90G,EACE,4DACAolC,EAAKvjE,OAAQ29B,EAAKs1G,eAEpBC,EAAW,IAAIv1I,MACb,gDAAgD4lE,EAAKvjE,gBAAgB29B,EAAKs1G,mBAErE,IAKX,SAASE,EAAoBzsI,GACtBssI,MAELrqI,EAAOoqI,EAAQrsI,GACf0sI,EAAW7vE,GAAM,CAAC96D,EAAKyqC,KACrB,GAAIzqC,EAAK,OAAOyqI,EAAWzqI,GAC3BE,EAAK0sC,iBAAiB,QAAS69F,GAC/BvqI,EAAK0sC,iBAAiB,YAAag+F,GACnC1qI,EAAK0sC,iBAAiB,iBAAkBi+F,GACxC3qI,EAAK2tC,IAAMpD,MAIf,SAASmgG,IAEP,GADA1qI,EAAK4sC,oBAAoB,YAAa89F,GAClC11G,EAAK41G,SAAU,CACjB,MAAMC,EAAc7qI,EAAK8qI,YACE,IAAhBD,GAA6BA,EAAYzpH,MAAMmpH,IAI9D,SAASI,IACP3qI,EAAK4sC,oBAAoB,iBAAkB+9F,GAC3C7rG,EAAG,KAAM9+B,GAaX,SAAS+qI,IACPN,EAAW7vE,GAAM,CAAC96D,EAAKyqC,KACrB,GAAIzqC,EAAK,OAAOyqI,EAAWzqI,GAEX,SAAZm3H,GAEFj3H,EAAOoqI,EAAQ,UACfpqI,EAAKgrI,QAAU,4BACfhrI,EAAK2tC,IAAMpD,IAGXvqC,EAAOoqI,EAAQ,UAGfpqI,EAAKirI,aAAa,iBAAiB,GACnCjrI,EAAKirI,aAAa,OAAQ,mBAC1BjrI,EAAKirI,aAAa,OAAQ1gG,IAE5BzL,EAAG,KAAM9+B,MA2Bb,SAASuqI,EAAYzqI,GACnBA,EAAIG,QAAU,yBAAyB26D,EAAK/kE,UAAUiK,EAAIG,UAC1Du1B,EAAM11B,EAAIG,SACV6+B,EAAGh/B,GA9LDiqI,EAAiBzrG,SAAS24F,GAc9B,WACE,MAAMzjB,EAAUs2B,EAAuBxrG,SAAS24F,GAAW,QAAU,QAqBrE,SAASiU,IACP11G,EAAM,2BAA2BolC,EAAK/kE,QACtCs1I,IACAnrI,EAAK0sC,iBAAiB,QAAS0+F,GAC/BprI,EAAK0sC,iBAAiB,YAAag+F,GACnC1qI,EAAK0sC,iBAAiB,iBAAkBi+F,GAExC,MACMnnH,EADU,IAAIynF,EAAoBjrG,GACf4sG,mBA2KZ/2G,EA3KuC+kE,EAAK/kE,KA6KtD,CACL,OAAQ,gCACR,OAAQ,gCACR,OAAQ,gCACR,OAAQ,6CACR,OAAQ,8CACR,OAAQ,aACR,OAAQ,6CACR,QAAS,oCATKiH,EAAKm6H,QAAQphI,GAAM+nC,iBADrC,IAAmB/nC,EA1Kb+kE,EAAKywE,mBAAmBnwE,KAAK13C,GAEzBiqF,IAAaztG,EAAKytG,YAAcA,GAGtC,SAAS69B,IACP91G,EAAM,oBAAoBolC,EAAK/kE,QAC/Bs1I,IACAnrI,EAAK0sC,iBAAiB,QAAS69F,GAC/BvqI,EAAK0sC,iBAAiB,YAAag+F,GACnC1qI,EAAK0sC,iBAAiB,iBAAkBi+F,GACxCF,EAAW7vE,GAAM,CAAC96D,EAAKyqC,KACrB,GAAIzqC,EAAK,OAAOyqI,EAAWzqI,GAC3BE,EAAK2tC,IAAMpD,EACPkjE,IAAaztG,EAAKytG,YAAcA,MAIxC,SAAS89B,EAAuBzrI,GAC9B01B,EAAM,qDAAsD11B,EAAIG,SAAWH,GAC3EE,EAAK4sC,oBAAoB,QAAS2+F,GAClCvrI,EAAK4sC,oBAAoB,iBAAkB+9F,GAE3CO,IAGF,SAASE,EAAmBtrI,GAC1B01B,EAAM,kDAAmD11B,EAAIG,SAAWH,GACnEuqI,MAELrqI,EAAK4sC,oBAAoB,QAASw+F,GAClCprI,EAAK4sC,oBAAoB,iBAAkB+9F,GAE3CW,KAGF,SAASH,IACFnrI,IACHA,EAAOoqI,EAAQ52B,GAEfxzG,EAAK0sC,iBAAiB,YAAY,KAChC+gE,EAAcztG,EAAKytG,gBArErBtC,EACE0+B,EAAiBvrG,SAAS24F,IAU9BzhG,EAAM,mCAAmColC,EAAK/kE,QAC9Cs1I,IACAnrI,EAAK0sC,iBAAiB,QAAS6+F,GAC/BvrI,EAAK0sC,iBAAiB,YAAag+F,GACnC1qI,EAAK0sC,iBAAiB,iBAAkBi+F,GACxC,IAAIf,EAAYhvE,EAAM56D,IAZpBkrI,IAGFI,IAvBFE,GACSxB,EAAW1rG,SAAS24F,GAC7BuT,EAAmB,SACVP,EAAW3rG,SAAS24F,GAC7BuT,EAAmB,SACVN,EAAW5rG,SAAS24F,IA+H7Bj3H,EAAOoqI,EAAQ,OACfK,EAAW7vE,GAAM,CAAC96D,EAAKyqC,KACrB,GAAIzqC,EAAK,OAAOyqI,EAAWzqI,GAC3BE,EAAK2tC,IAAMpD,EACXvqC,EAAKyrI,IAAM7wE,EAAK/kE,KAChBipC,EAAG,KAAM9+B,OAlIFmqI,EAAY7rG,SAAS24F,GAC9B8T,IA2JF,WACEv1G,EAAM,mEAAoEyhG,GAE1E,IAAI73H,EAAM,GACVw7D,EAAKywE,iBAAiB,CAAEzuI,MAAO,EAAG6G,IAAK,MACpCk9H,YAAY,QACZlmG,GAAG,QAAQyY,IACV9zC,GAAO8zC,KAERzY,GAAG,OAGN,WACMivG,EAAQtqI,IACVo2B,EAAM,qDAAsDyhG,GAC5D8T,MAEAv1G,EAAM,0DAA2DyhG,GACjEn4F,EAAG,IAAI9pC,MAAM,0BAA0BiiI,iCARxCx8F,GAAG,QAASqE,GAnKf4sG,GAuLJ,SAASjB,EAAY7vE,EAAM97B,GACzB,MAAMm4F,EAAUn6H,EAAKm6H,QAAQr8D,EAAK/kE,MAAM+nC,cACxC+rG,EAAgB/uE,EAAKywE,mBAAoB52I,EAAQg1I,KAAKxS,IACnD91G,MACCwqH,GAAW7sG,EAAG,KAAM6sG,KACpB7rI,GAAOg/B,EAAGh/B,KAIhB,SAASgpI,EAAcluE,GACrB,GAAY,MAARA,EACF,MAAM,IAAI5lE,MAAM,oCAElB,GAAyB,iBAAd4lE,EAAK/kE,KACd,MAAM,IAAIb,MAAM,yCAElB,GAAqC,mBAA1B4lE,EAAKywE,iBACd,MAAM,IAAIr2I,MAAM,qDAkBpB,SAAS+zI,EAAW/zG,GACG,MAAjBA,EAAK41G,WAAkB51G,EAAK41G,UAAW,GACzB,MAAd51G,EAAK42G,QAAe52G,EAAK42G,OAAQ,GAChB,MAAjB52G,EAAK62G,WAAkB72G,EAAK62G,UAAW,GACjB,MAAtB72G,EAAKs1G,gBAAuBt1G,EAAKs1G,cA5Tf,KA+TxB,SAASnB,EAAcnpI,EAAMg1B,GAC3Bh1B,EAAK4qI,WAAa51G,EAAK41G,SACvB5qI,EAAK4rI,QAAU52G,EAAK42G,MACpB5rI,EAAK6rI,WAAa72G,EAAK62G,uCC5YzB,IAAI50I,EAAS,eACTtB,EAAW,EAAQ,MACnBoiG,EAAW,EAAQ,MAEnByS,EAAU,IAAI/yG,MAAM,IAEpBmlG,EAAK,CACP,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,GAAI,GAClD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EACnD,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,GAClD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EACnD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,IAGhDkvC,EAAK,CACP,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAClD,EAAG,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,EAAG,EACnD,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAClD,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAClD,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,IAGhDC,EAAK,CACP,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EACrD,EAAG,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,GAAI,GACpD,GAAI,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EACrD,GAAI,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,EAAG,EAAG,EAAG,EAAG,EAAG,GACpD,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,GAGnDC,EAAK,CACP,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EAAG,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,GAAI,EACrD,EAAG,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GACpD,EAAG,EAAG,GAAI,GAAI,EAAG,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,GAAI,GAAI,EAAG,EACrD,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EACrD,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,EAAG,GAAI,GAAI,GAAI,IAGlDrtC,EAAK,CAAC,EAAY,WAAY,WAAY,WAAY,YACtDstC,EAAK,CAAC,WAAY,WAAY,WAAY,WAAY,GAE1D,SAASzzE,IACPu/B,EAASzhG,KAAKP,KAAM,IAGpBA,KAAK00G,GAAK,WACV10G,KAAK20G,GAAK,WACV30G,KAAK40G,GAAK,WACV50G,KAAK20B,GAAK,UACV30B,KAAK40B,GAAK,WAwFZ,SAASigF,EAAM34F,EAAG8B,GAChB,OAAQ9B,GAAK8B,EAAM9B,IAAO,GAAK8B,EAGjC,SAASm4H,EAAKvjI,EAAGC,EAAGrC,EAAG8rB,EAAG51B,EAAG3H,EAAGiU,EAAGmK,GACjC,OAAQ03F,EAAMjiG,GAAKC,EAAIrC,EAAI8rB,GAAKv9B,EAAIiU,EAAK,EAAGmK,GAAKzW,EAAK,EAGxD,SAAS0vI,EAAKxjI,EAAGC,EAAGrC,EAAG8rB,EAAG51B,EAAG3H,EAAGiU,EAAGmK,GACjC,OAAQ03F,EAAMjiG,GAAMC,EAAIrC,GAAQqC,EAAKypB,GAAMv9B,EAAIiU,EAAK,EAAGmK,GAAKzW,EAAK,EAGnE,SAAS2vI,EAAKzjI,EAAGC,EAAGrC,EAAG8rB,EAAG51B,EAAG3H,EAAGiU,EAAGmK,GACjC,OAAQ03F,EAAMjiG,IAAMC,GAAMrC,GAAM8rB,GAAKv9B,EAAIiU,EAAK,EAAGmK,GAAKzW,EAAK,EAG7D,SAAS4vI,EAAK1jI,EAAGC,EAAGrC,EAAG8rB,EAAG51B,EAAG3H,EAAGiU,EAAGmK,GACjC,OAAQ03F,EAAMjiG,GAAMC,EAAIypB,EAAM9rB,GAAM8rB,GAAOv9B,EAAIiU,EAAK,EAAGmK,GAAKzW,EAAK,EAGnE,SAAS6vI,EAAK3jI,EAAGC,EAAGrC,EAAG8rB,EAAG51B,EAAG3H,EAAGiU,EAAGmK,GACjC,OAAQ03F,EAAMjiG,GAAKC,GAAKrC,GAAM8rB,IAAOv9B,EAAIiU,EAAK,EAAGmK,GAAKzW,EAAK,EA1G7D9G,EAAS6iE,EAAWu/B,GAEpBv/B,EAAUxiE,UAAUi9C,QAAU,WAE5B,IADA,IAAIhtC,EAAQukG,EACHnpG,EAAI,EAAGA,EAAI,KAAMA,EAAG4E,EAAM5E,GAAKtL,KAAKiiG,OAAOrqC,YAAgB,EAAJtsD,GAehE,IAbA,IAAI08F,EAAe,EAAVhoG,KAAK00G,GACVv0D,EAAe,EAAVngD,KAAK20G,GACVxM,EAAe,EAAVnoG,KAAK40G,GACVxM,EAAe,EAAVpoG,KAAK20B,GACV2zE,EAAe,EAAVtoG,KAAK40B,GAEV4hH,EAAe,EAAVx2I,KAAK00G,GACV+hC,EAAe,EAAVz2I,KAAK20G,GACV+hC,EAAe,EAAV12I,KAAK40G,GACV+hC,EAAe,EAAV32I,KAAK20B,GACVw7B,EAAe,EAAVnwD,KAAK40B,GAGLvpB,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC9B,IAAIurI,EACA7iC,EACA1oG,EAAI,IACNurI,EAAKT,EAAInuC,EAAI7nD,EAAIgoD,EAAIC,EAAIE,EAAIp4F,EAAM22F,EAAGx7F,IAAKu9F,EAAG,GAAIotC,EAAG3qI,IACrD0oG,EAAKwiC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIxmF,EAAIjgD,EAAM6lI,EAAG1qI,IAAK6qI,EAAG,GAAID,EAAG5qI,KAC5CA,EAAI,IACburI,EAAKR,EAAIpuC,EAAI7nD,EAAIgoD,EAAIC,EAAIE,EAAIp4F,EAAM22F,EAAGx7F,IAAKu9F,EAAG,GAAIotC,EAAG3qI,IACrD0oG,EAAKuiC,EAAIE,EAAIC,EAAIC,EAAIC,EAAIxmF,EAAIjgD,EAAM6lI,EAAG1qI,IAAK6qI,EAAG,GAAID,EAAG5qI,KAC5CA,EAAI,IACburI,EAAKP,EAAIruC,EAAI7nD,EAAIgoD,EAAIC,EAAIE,EAAIp4F,EAAM22F,EAAGx7F,IAAKu9F,EAAG,GAAIotC,EAAG3qI,IACrD0oG,EAAKsiC,EAAIG,EAAIC,EAAIC,EAAIC,EAAIxmF,EAAIjgD,EAAM6lI,EAAG1qI,IAAK6qI,EAAG,GAAID,EAAG5qI,KAC5CA,EAAI,IACburI,EAAKN,EAAItuC,EAAI7nD,EAAIgoD,EAAIC,EAAIE,EAAIp4F,EAAM22F,EAAGx7F,IAAKu9F,EAAG,GAAIotC,EAAG3qI,IACrD0oG,EAAKqiC,EAAII,EAAIC,EAAIC,EAAIC,EAAIxmF,EAAIjgD,EAAM6lI,EAAG1qI,IAAK6qI,EAAG,GAAID,EAAG5qI,MAErDurI,EAAKL,EAAIvuC,EAAI7nD,EAAIgoD,EAAIC,EAAIE,EAAIp4F,EAAM22F,EAAGx7F,IAAKu9F,EAAG,GAAIotC,EAAG3qI,IACrD0oG,EAAKoiC,EAAIK,EAAIC,EAAIC,EAAIC,EAAIxmF,EAAIjgD,EAAM6lI,EAAG1qI,IAAK6qI,EAAG,GAAID,EAAG5qI,KAGvD28F,EAAKM,EACLA,EAAKF,EACLA,EAAKyM,EAAK1M,EAAI,IACdA,EAAKhoD,EACLA,EAAKy2F,EAELJ,EAAKrmF,EACLA,EAAKwmF,EACLA,EAAK9hC,EAAK6hC,EAAI,IACdA,EAAKD,EACLA,EAAK1iC,EAIP,IAAIx/F,EAAKvU,KAAK20G,GAAKxM,EAAKwuC,EAAM,EAC9B32I,KAAK20G,GAAM30G,KAAK40G,GAAKxM,EAAKj4C,EAAM,EAChCnwD,KAAK40G,GAAM50G,KAAK20B,GAAK2zE,EAAKkuC,EAAM,EAChCx2I,KAAK20B,GAAM30B,KAAK40B,GAAKozE,EAAKyuC,EAAM,EAChCz2I,KAAK40B,GAAM50B,KAAK00G,GAAKv0D,EAAKu2F,EAAM,EAChC12I,KAAK00G,GAAKngG,GAGZkuD,EAAUxiE,UAAUuiG,QAAU,WAE5BxiG,KAAKiiG,OAAOjiG,KAAKmiG,gBAAkB,IAC/BniG,KAAKmiG,aAAe,KACtBniG,KAAKiiG,OAAOp9C,KAAK,EAAG7kD,KAAKmiG,aAAc,IACvCniG,KAAKk9C,UACLl9C,KAAKmiG,aAAe,GAGtBniG,KAAKiiG,OAAOp9C,KAAK,EAAG7kD,KAAKmiG,aAAc,IACvCniG,KAAKiiG,OAAOrpC,cAAc54D,KAAKoiG,QAAQ,GAAI,IAC3CpiG,KAAKiiG,OAAOrpC,cAAc54D,KAAKoiG,QAAQ,GAAI,IAC3CpiG,KAAKk9C,UAGL,IAAI3xC,EAASrK,EAAO6B,MAAQ7B,EAAO6B,MAAM,IAAM,IAAI7B,EAAO,IAM1D,OALAqK,EAAO6tD,aAAap5D,KAAK00G,GAAI,GAC7BnpG,EAAO6tD,aAAap5D,KAAK20G,GAAI,GAC7BppG,EAAO6tD,aAAap5D,KAAK40G,GAAI,GAC7BrpG,EAAO6tD,aAAap5D,KAAK20B,GAAI,IAC7BppB,EAAO6tD,aAAap5D,KAAK40B,GAAI,IACtBrpB,GA2BT9M,EAAOC,QAAU+jE,kBCjKjBhkE,EAAOC,QAIP,SAA2B6yC,EAAO3gB,EAAOmY,GACvC,GAAqB,iBAAVnY,EAAoB,MAAM,IAAI3xB,MAAM,oCAC/C,IAAI2yC,EAASxmC,EAAK03F,EAASr9F,EAAMoxI,EAE7BnwH,EADAowH,GAAS,EAYb,SAAS/hH,EAAMhrB,GACb,SAAS2D,IACHq7B,GAAIA,EAAGh/B,EAAK6nC,GAChB7I,EAAK,KAEH+tG,EAAQ/nG,EAAerhC,GACtBA,IAGP,SAASqpI,EAAM1rI,EAAGtB,EAAK7D,GAGrB,GAFA0rC,EAAQvmC,GAAKnF,EACT6D,IAAK8sI,GAAY,GACH,KAAZ/zC,GAAiB/4F,EACrBgrB,EAAKhrB,QACA,IAAK8sI,GAAanwH,EAAOtb,EAAK,CACnC,IAAI/G,EACAoB,GACFpB,EAAMoB,EAAKihB,GACXA,GAAQ,EACR6qB,EAAMltC,IAAK,SAAU0F,EAAK7D,GAAU6wI,EAAK1yI,EAAK0F,EAAK7D,QAEnD7B,EAAMqiB,EACNA,GAAQ,EACR6qB,EAAMltC,IAAK,SAAU0F,EAAK7D,GAAU6wI,EAAK1yI,EAAK0F,EAAK7D,QAhCrDxE,MAAMC,QAAQ4vC,IAChBK,EAAU,GACVkxD,EAAU13F,EAAMmmC,EAAMjwC,SAEtBmE,EAAOD,OAAOC,KAAK8rC,GACnBK,EAAU,GACVkxD,EAAU13F,EAAM3F,EAAKnE,QA+BvBolB,EAAOkK,EACFkyE,EAGMr9F,EAETA,EAAKqC,MAAK,SAAUzD,EAAKgH,GAEvB,OADAkmC,EAAMltC,IAAK,SAAU0F,EAAK7D,GAAU6wI,EAAK1yI,EAAK0F,EAAK7D,MAC/CmF,IAAMulB,EAAQ,KAKpB2gB,EAAMzpC,MAAK,SAAUkvI,EAAM3rI,GAEzB,OADA2rI,GAAK,SAAUjtI,EAAK7D,GAAU6wI,EAAK1rI,EAAGtB,EAAK7D,MACvCmF,IAAMulB,EAAQ,KAZpBmE,EAAK,MAiBP+hH,GAAS,GAjEX,MAAM/nG,EAAiB,EAAQ,sBCF/BtwC,EAAOC,QAIP,SAAsB6yC,EAAOxI,GAC3B,IAAI6I,EAASkxD,EAASr9F,EAClBqxI,GAAS,EAWb,SAAS/hH,EAAMhrB,GACb,SAAS2D,IACHq7B,GAAIA,EAAGh/B,EAAK6nC,GAChB7I,EAAK,KAEH+tG,EAAQ/nG,EAAerhC,GACtBA,IAGP,SAASqpI,EAAM1rI,EAAGtB,EAAK7D,GACrB0rC,EAAQvmC,GAAKnF,GACK,KAAZ48F,GAAiB/4F,IACrBgrB,EAAKhrB,GArBLrI,MAAMC,QAAQ4vC,IAChBK,EAAU,GACVkxD,EAAUvxD,EAAMjwC,SAEhBmE,EAAOD,OAAOC,KAAK8rC,GACnBK,EAAU,GACVkxD,EAAUr9F,EAAKnE,QAmBZwhG,EAGMr9F,EAETA,EAAKzC,SAAQ,SAAUqB,GACrBktC,EAAMltC,IAAK,SAAU0F,EAAK7D,GAAU6wI,EAAK1yI,EAAK0F,EAAK7D,SAIrDqrC,EAAMvuC,SAAQ,SAAUg0I,EAAM3rI,GAC5B2rI,GAAK,SAAUjtI,EAAK7D,GAAU6wI,EAAK1rI,EAAGtB,EAAK7D,SAT7C6uB,EAAK,MAaP+hH,GAAS,GA9CX,MAAM/nG,EAAiB,EAAQ,gCCHkBkoG,YAS9B,oBAATtkI,MAAuBA,KATgBskI,EASH,WAC9C,OAAgB,SAAUC,GAEhB,IAAIC,EAAmB,GAGvB,SAAS,EAAoBC,GAG5B,GAAGD,EAAiBC,GACnB,OAAOD,EAAiBC,GAAU14I,QAGnC,IAAID,EAAS04I,EAAiBC,GAAY,CACzC/rI,EAAG+rI,EACH36H,GAAG,EACH/d,QAAS,IAUV,OANAw4I,EAAQE,GAAU72I,KAAK9B,EAAOC,QAASD,EAAQA,EAAOC,QAAS,GAG/DD,EAAOge,GAAI,EAGJhe,EAAOC,QAqCf,OAhCA,EAAoBK,EAAIm4I,EAGxB,EAAoB1mI,EAAI2mI,EAGxB,EAAoB76G,EAAI,SAAS59B,EAASoB,EAAMswG,GAC3C,EAAoBt5F,EAAEpY,EAASoB,IAClC0F,OAAO8nB,eAAe5uB,EAASoB,EAAM,CACpC0tB,cAAc,EACdD,YAAY,EACZnuB,IAAKgxG,KAMR,EAAoBpyF,EAAI,SAASvf,GAChC,IAAI2xG,EAAS3xG,GAAUA,EAAO44I,WAC7B,WAAwB,OAAO54I,EAAgB,SAC/C,WAA8B,OAAOA,GAEtC,OADA,EAAoB69B,EAAE8zE,EAAQ,IAAKA,GAC5BA,GAIR,EAAoBt5F,EAAI,SAAS6oD,EAAQ23E,GAAY,OAAO9xI,OAAOvF,UAAUS,eAAeH,KAAKo/D,EAAQ23E,IAGzG,EAAoB9nI,EAAI,GAGjB,EAAoB,EAAoB2N,EAAI,GA9D7C,CAiEN,CAEJ,SAAU1e,EAAQC,EAAS,GAMjC,IAAI64I,EAAY,EAAoB,GAEhCC,EAAW,EAAoB,GAC/B5gD,EAAQ4gD,EAAS5gD,MACjB6gD,EAAeD,EAASC,aAExBC,EAAO,EAAoB,GAI3BC,EAAS,SAAUvsI,GACrB,IAAKA,GAAO,EAAGA,EAAM,GAAK,EAAGA,GAAO,GACpC,OAAOA,GA8BLwsI,EAAe,SAAUppB,EAAMqpB,GACjC,IAAIh6H,EAAK,IAAIkiF,WAAWyuB,EAAMqpB,EAAiB,IAAK,GAChD/0I,EAAM,IAAIi9F,WAAW,GACrBxrE,EAAM,IAAImxD,SAAS5iF,EAAIyI,QAM3B,OALAgpB,EAAIujH,SAAS,EAAGj6H,EAAG,IAAI,GACvB0W,EAAIujH,SAAS,EAAGj6H,EAAG,IAAI,GACvB0W,EAAIujH,SAAS,EAAGj6H,EAAG,IAAI,GACvB0W,EAAIujH,SAAS,GAAIj6H,EAAG,IAAI,GACxB0W,EAAIujH,SAAS,GAAIj6H,EAAG,IAAI,GACjB/a,GAGLi1I,EAAQ,WACV,SAASA,EAAMpqF,GAIb,GA/DJ,SAAyBhjC,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAIC,UAAU,qCA4D5GC,CAAgB9qB,KAAM+3I,IAEtBpqF,EAAYA,GAAa,OACT,GAAK,EACnB,MAAM,IAAI1uD,MAAM,4CAElBe,KAAKkuD,QAAU,EACfluD,KAAKg4I,aAAerqF,EACpB3tD,KAAKi4I,gBAAkBN,EAAOhqF,GAK9B3tD,KAAKk4I,MAAQ,IAAIl6G,YAAYy5G,EAAaz3I,KAAKi4I,gBAAkB,IAAM,KACvEj4I,KAAKm4I,KAAO,IAAIp4C,WAAW//F,KAAKk4I,OAChCl4I,KAAKo4I,IAAM,IAAIv4C,UAAU7/F,KAAKk4I,OAC9Bl4I,KAAKq4I,MAAQ,IAAId,EAAU,CAAEx3C,YAA0B,GAAI//F,KAAKk4I,OA+HlE,OA5HAH,EAAM93I,UAAUq4I,WAAa,SAAoB9pB,EAAM+pB,GACrDv4I,KAAKkuD,QAAU,EACf,IAAIrwC,EAAK,IAAIkiF,WAAWyuB,EAAM+pB,EAAY,IAAK,GAC/C16H,EAAG,GAAK,WACRA,EAAG,IAAM,UACTA,EAAG,IAAM,WACTA,EAAG,GAAK,UACRA,EAAG,IAAM,YAGXk6H,EAAM93I,UAAUu4I,UAAY,SAAmBC,EAAUC,GACvD,IAAIC,EAAchB,EAAOc,GACrBG,EAAO,IAAI74C,WAAW//F,KAAKk4I,MAAO,EAAGS,GAAe,GAGxD,OA3EY,SAAUE,EAAKztI,GAC7B,IAAI0tI,EAAK,IAAInhH,WAAWkhH,EAAIttI,QACxBwtI,EAAK3tI,EAAM,EACX4tI,EAAQ5tI,EAAM2tI,EAClB,OAAQA,GACN,KAAK,EACHD,EAAGE,EAAQ,GAAK,EAClB,KAAK,EACHF,EAAGE,EAAQ,GAAK,EAClB,KAAK,EACHF,EAAGE,EAAQ,GAAK,EAClB,KAAK,EACHF,EAAGE,EAAQ,GAAK,EAEpB,IAAK,IAAI3tI,EAAiB,GAAZD,GAAO,GAAQC,EAAIwtI,EAAIv3I,OAAQ+J,IAC3CwtI,EAAIxtI,GAAK,EA0DT4tI,CAAUL,EAAMH,GAtDN,SAAUI,EAAKJ,EAAUC,GACrCG,EAAIJ,GAAY,IAAM,KAAQ,IAAMA,EAAW,GAAK,GAGpDI,EAAoC,IAAb,GAAjBJ,GAAY,IAAS,KAAeC,GAAU,GAAK,IAAM,EAC/DG,EAAoC,IAAb,GAAjBJ,GAAY,IAAS,KAAeC,GAAU,EAkDlDQ,CAAQN,EAAMH,EAAUC,GACjBC,GAGTZ,EAAM93I,UAAUusC,OAAS,SAAgB5rC,EAAMu4I,EAAaV,EAAUhnI,GACpEimI,EAAK92I,EAAMZ,KAAKo4I,IAAKp4I,KAAKm4I,KAAMgB,EAAaV,EAAUhnI,GAAO,IAGhEsmI,EAAM93I,UAAUm5I,UAAY,SAAmBx4I,EAAMu4I,EAAaV,EAAUC,EAAQr1B,GAClF,IAAIs1B,EAAcF,EAClBz4I,KAAKwsC,OAAO5rC,EAAMu4I,EAAaV,GAC3Bp1B,IACFs1B,EAAc34I,KAAKw4I,UAAUC,EAAUC,IAEzC14I,KAAKq4I,MAAM30F,KAAKi1F,EAAa34I,KAAKi4I,kBAGpCF,EAAM93I,UAAUo5I,UAAY,SAAmBhwI,GAC7C,IAAIqvI,EAASrvI,EAAItH,YAAcsH,EAAI/H,QAAU+H,EAAIzK,MAAQ,EACzDoB,KAAKs4I,WAAWt4I,KAAKk4I,MAAOl4I,KAAKi4I,iBACjC,IAAIkB,EAAc,EACdV,EAAWz4I,KAAKg4I,aACpB,IAAKmB,EAAc,EAAGT,EAASS,EAAcV,EAAUU,GAAeV,EACpEz4I,KAAKo5I,UAAU/vI,EAAK8vI,EAAaV,EAAUC,GAAQ,GAGrD,OADA14I,KAAKo5I,UAAU/vI,EAAK8vI,EAAaT,EAASS,EAAaT,GAAQ,GACxDd,EAAa53I,KAAKk4I,MAAOl4I,KAAKi4I,kBAGvCF,EAAM93I,UAAUgkD,OAAS,SAAgB56C,GACvC,OAAOutF,EAAM52F,KAAKq5I,UAAUhwI,GAAKkC,SAGnCwsI,EAAM93I,UAAUq5I,iBAAmB,SAA0BjwI,GAC3D,OAAOrJ,KAAKikD,OAAO56C,IAGrB0uI,EAAM93I,UAAUs5I,iBAAmB,SAA0BlwI,GAC3D,OAAOrJ,KAAKikD,OAAO56C,IAGrB0uI,EAAM93I,UAAUu5I,sBAAwB,SAA+BnwI,GACrE,OAAOrJ,KAAKikD,OAAO56C,IAGrB0uI,EAAM93I,UAAUw5I,WAAa,WAE3B,OADAz5I,KAAKs4I,WAAWt4I,KAAKk4I,MAAOl4I,KAAKi4I,iBAC1Bj4I,MAGT+3I,EAAM93I,UAAUozI,OAAS,SAAgBl2F,GACvC,IAAIg8F,EAAc,EACdV,EAAWt7F,EAAMp7C,YAAco7C,EAAM77C,QAAU67C,EAAMv+C,MAAQ,EAC7D86I,EAAa15I,KAAKkuD,QAAUluD,KAAKg4I,aACjC2B,OAAW,EAGf,IADA35I,KAAKkuD,SAAWuqF,EACTU,EAAcV,GACnBkB,EAAW7oI,KAAK/D,IAAI0rI,EAAWU,EAAan5I,KAAKg4I,aAAe0B,GAChE15I,KAAKwsC,OAAO2Q,EAAOg8F,EAAaQ,EAAUD,GAE1CP,GAAeQ,GADfD,GAAcC,KAEK35I,KAAKg4I,eACtBh4I,KAAKq4I,MAAM30F,KAAK1jD,KAAKg4I,aAAch4I,KAAKi4I,iBACxCyB,EAAa,GAGjB,OAAO15I,MAGT+3I,EAAM93I,UAAU25I,SAAW,WACzB,IACIprB,OAAO,EACX,GAFiBxuH,KAAKkuD,QAAUluD,KAAKg4I,aAMnCxpB,EAAOxuH,KAAKk4I,MAAMt1I,MAAM,OAJT,CACf,IAAIib,EAAK,IAAIkiF,WAAW//F,KAAKk4I,MAAOl4I,KAAKi4I,gBAAkB,IAAK,GAChEzpB,EAAO3wG,EAAGtS,OAAO3I,MAAMib,EAAG+Z,WAAY/Z,EAAG+Z,WAAa/Z,EAAG9b,YAI3D,MAAO,CACLV,OAAQrB,KAAKkuD,QACbsgE,KAAMA,IAIVupB,EAAM93I,UAAUsnI,SAAW,SAAkB9jI,GAQ3C,OAPAzD,KAAKkuD,QAAUzqD,EAAMpC,OACS,KAA1BoC,EAAM+qH,KAAKzsH,WACJ,IAAIg+F,WAAW//F,KAAKk4I,MAAOl4I,KAAKi4I,gBAAkB,IAAK,GAC7D/4I,IAAI,IAAI6gG,WAAWt8F,EAAM+qH,OAE5BxuH,KAAKm4I,KAAKj5I,IAAI,IAAI6gG,WAAWt8F,EAAM+qH,OAE9BxuH,MAGT+3I,EAAM93I,UAAU45I,OAAS,WACvB,IAAInB,EAAS14I,KAAKkuD,QACduqF,EAAWC,EAAS14I,KAAKg4I,aACzBW,EAAc34I,KAAKw4I,UAAUC,EAAUC,GAC3C14I,KAAKq4I,MAAM30F,KAAKi1F,EAAa34I,KAAKi4I,iBAClC,IAAI/xI,EAAS0xI,EAAa53I,KAAKk4I,MAAOl4I,KAAKi4I,iBAE3C,OADAj4I,KAAKs4I,WAAWt4I,KAAKk4I,MAAOl4I,KAAKi4I,iBAC1B/xI,GAGT6xI,EAAM93I,UAAUyN,IAAM,WACpB,OAAOkpF,EAAM52F,KAAK65I,SAAStuI,SAGtBwsI,EAjJG,GAoJZt5I,EAAOC,QAAUq5I,EACjBt5I,EAAOC,QAAQ25I,MAAQd,GAIjB,SAAU94I,EAAQC,GASxB,IADA,IAAIo7I,EAAiB,IAAIp4I,MAAM,KACtB2J,EAAI,EAAGA,EAAI,IAAKA,IACvByuI,EAAezuI,IAAMA,EAAI,GAAO,IAAM,IAAMA,EAAEY,SAAS,IAGzDxN,EAAOC,QAAQk4F,MAAQ,SAAUmjD,GAG/B,IAFA,IAAIC,EAAW,IAAIriH,WAAWoiH,GAC1Bv3I,EAAM,IAAId,MAAMq4I,EAAYh4I,YACvB+yB,EAAK,EAAGA,EAAKtyB,EAAIlB,OAAQwzB,IAChCtyB,EAAIsyB,GAAMglH,EAAeE,EAASllH,IAEpC,OAAOtyB,EAAIK,KAAK,KAOlBpE,EAAOC,QAAQ+4I,aAAe,SAAU1+F,GAKtC,IAAIvpC,EAAI,EAGR,GAAIupC,GAAK,MAAO,OAAO,MAGvB,GAAIA,EAAI,SACN,IAAKvpC,EAAI,EAAGA,EAAIupC,EAAGvpC,IAAS,QAE5B,IAAKA,EAAI,SAAUA,EAAIupC,EAAGvpC,GAAK,UAEjC,OAAOA,GAOT/Q,EAAOC,QAAQu7I,uBAAyB,SAAUtnI,GAChD,IAAIunI,EAAoB,sBAAuBvnI,GAAQA,aAAgBA,EAAKwnI,kBACxEC,EAA0B,4BAA6BznI,GAAQA,aAAgBA,EAAK0nI,wBACpFC,EAA2B,6BAA8B3nI,GAAQA,aAAgBA,EAAK4nI,yBAW1F,OAAOL,IAAsBE,IAA4BE,IAKrD,SAAU77I,EAAQC,EAAS,GAIjCD,EAAOC,QAAU,WACf,IAAIq5I,EAAQ,EAAoB,GAU5ByC,EAAW,SAAUC,EAAQC,EAAW7/F,EAAWgqB,EAAM97B,GAC3D,IAAI0N,EAAS,IAAI9jC,KAAK+jC,WACtBD,EAAOkkG,UAAY,WACjB,GAAIlkG,EAAOl1C,MACT,OAAOwnC,EAAG0N,EAAOl1C,OAEnB,IAAIgK,EAASkrC,EAAOvwC,OACpBw0I,GAAajkG,EAAOvwC,OAAOnE,WAC3B,IACE04I,EAAOpH,OAAO9nI,GACd,MAAO7E,GAEP,YADAqiC,EAAGriC,GAGDg0I,EAAY71E,EAAKjmE,KACnB47I,EAASC,EAAQC,EAAW7/F,EAAWgqB,EAAM97B,GAE7CA,EAAG,KAAM0xG,EAAO/sI,QAGpB+oC,EAAOK,kBAAkB+tB,EAAKjiE,MAAM83I,EAAWA,EAAY7/F,KAGzD+/F,GAAyB,EA0B7B,OAxBAjoI,KAAKkoI,UAAY,SAAU9pG,GACzB,GAAK6pG,EAAL,CAIA,IAAIh6I,EAAOmwC,EAAMnwC,KAAKA,KAClBikE,EAAO9zB,EAAMnwC,KAAKikE,KAClBv2D,EAAKyiC,EAAMnwC,KAAK0N,GACpB,QAAkB,IAAPA,IACNu2D,GAASjkE,GAAd,CACA,IAAIi6C,EAAY9J,EAAMnwC,KAAKi6C,WAAa,QACpC4/F,EAAS,IAAI1C,EAAMl9F,GACvB4/F,EAAOhB,aACP,IAAI1kH,EAAO,SAAUhrB,EAAK25C,GACnB35C,EAGH4I,KAAKmoI,YAAY,CAAExsI,GAAIA,EAAI/M,MAAOwI,EAAIjK,OAFtC6S,KAAKmoI,YAAY,CAAExsI,GAAIA,EAAIo1C,KAAMA,KAKjC9iD,GArDS,SAAU65I,EAAQ75I,EAAMmoC,GACrC,IACSA,EAAG,KAAM0xG,EAAOx2F,OAAOrjD,IAC9B,MAAO8F,GACP,OAAOqiC,EAAGriC,IAiDFq0I,CAASN,EAAQ75I,EAAMm0B,GAC7B8vC,GAAM21E,EAASC,EAAQ,EAAG5/F,EAAWgqB,EAAM9vC,MAG1C,WACL6lH,GAAyB,KAMvB,SAAUn8I,EAAQC,EAAS,GAIjC,IAAIk0H,EAAO,EAAoB,GAC3BmlB,EAAQ,EAAoB,GAC5B50F,EAAa,EAAoB,GACjC63F,EAAY,EAAoB,GAGhCf,EADW,EAAoB,GACGA,uBAElCgB,EAA6C,oBAATtoI,MAAwBsnI,EAAuBtnI,MAEvFolI,EAAMmD,uBAAyBD,EAA6BD,IAAc,aAE1EjD,EAAMoD,aAAe,WACnB,IAAIC,EAASxoB,EAAwB,GACjCyoB,EAAYD,EAAOC,UAKvB,OAJAD,EAAOC,UAAY,WACjBnnG,IAAI4iE,gBAAgBskC,EAAOE,WAC3BD,EAAU96I,KAAK66I,IAEVA,GAGTrD,EAAM50F,WAAaA,EAEnB1kD,EAAOC,QAAUq5I,GAIX,SAAUt5I,EAAQC,EAAS,GAEjC,SAAS68I,EAAsBrE,GAErB,IAAIC,EAAmB,GAGvB,SAAS,EAAoBC,GAG3B,GAAGD,EAAiBC,GAClB,OAAOD,EAAiBC,GAAU14I,QAGpC,IAAID,EAAS04I,EAAiBC,GAAY,CACxC/rI,EAAG+rI,EACH36H,GAAG,EACH/d,QAAS,IAUX,OANAw4I,EAAQE,GAAU72I,KAAK9B,EAAOC,QAASD,EAAQA,EAAOC,QAAS,GAG/DD,EAAOge,GAAI,EAGJhe,EAAOC,QAIhB,EAAoBK,EAAIm4I,EAGxB,EAAoB1mI,EAAI2mI,EAGxB,EAAoB9rI,EAAI,SAAS5J,GAAS,OAAOA,GAGjD,EAAoB66B,EAAI,SAAS59B,EAASoB,EAAMswG,GAC1C,EAAoBt5F,EAAEpY,EAASoB,IACjC0F,OAAO8nB,eAAe5uB,EAASoB,EAAM,CACnC0tB,cAAc,EACdD,YAAY,EACZnuB,IAAKgxG,KAMX,EAAoBz/F,EAAI,SAASjS,GAC/B8G,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,KAIxD,EAAoBuc,EAAI,SAASvf,GAC/B,IAAI2xG,EAAS3xG,GAAUA,EAAO44I,WAC5B,WAAwB,OAAO54I,EAAgB,SAC/C,WAA8B,OAAOA,GAEvC,OADA,EAAoB69B,EAAE8zE,EAAQ,IAAKA,GAC5BA,GAIT,EAAoBt5F,EAAI,SAAS6oD,EAAQ23E,GAAY,OAAO9xI,OAAOvF,UAAUS,eAAeH,KAAKo/D,EAAQ23E,IAGzG,EAAoB9nI,EAAI,IAGxB,EAAoBgsI,GAAK,SAASzxI,GAA2B,MAApBggB,EAAQxoB,MAAMwI,GAAYA,GAE3E,IAAI4rB,EAAI,EAAoB,EAAoBxY,EAAIs+H,cACpD,OAAO9lH,EAAEy1C,SAAWz1C,EAGtB,IACI+lH,EAAmB,uDAGvB,SAASC,EAAatyI,GACpB,OAAQA,EAAM,IAAIuE,QAAQ,uBAAwB,QAGpD,SAASguI,EAAuB9zB,EAASrpH,EAAQo9I,GAC/C,IAAIC,EAAS,GACbA,EAAOD,GAAa,GAEpB,IAAIE,EAAWt9I,EAAOwN,WAClB+vI,EAAmBD,EAASl0I,MAAM,uCACtC,IAAKm0I,EAAkB,OAAOF,EAM9B,IALA,IAIIj0I,EAJAo0I,EAAqBD,EAAiB,GAGtCvuI,EAAK,IAAIiqB,OAAO,cAAgBikH,EAAYM,GAAsBP,EAAkB,KAEhF7zI,EAAQ4F,EAAGzO,KAAK+8I,IACL,kBAAbl0I,EAAM,IACVi0I,EAAOD,GAAW92I,KAAK8C,EAAM,IAK/B,IADA4F,EAAK,IAAIiqB,OAAO,MAAQikH,EAAYM,GAApB,wDAAsGP,EAAkB,KAChI7zI,EAAQ4F,EAAGzO,KAAK+8I,IACjBj0B,EAAQjgH,EAAM,MACjBi0I,EAAOD,GAAW92I,KAAK8C,EAAM,IAC7BigH,EAAQjgH,EAAM,IAAM,EAAoBA,EAAM,IAAI9I,GAEpD+8I,EAAOj0I,EAAM,IAAMi0I,EAAOj0I,EAAM,KAAO,GACvCi0I,EAAOj0I,EAAM,IAAI9C,KAAK8C,EAAM,IAG9B,OAAOi0I,EAGT,SAASI,EAAmBC,GAE1B,OADW32I,OAAOC,KAAK02I,GACX/9G,QAAO,SAAUg+G,EAAW/3I,GACtC,OAAO+3I,GAAaD,EAAO93I,GAAK/C,OAAS,KACxC,GAqCL7C,EAAOC,QAAU,SAAU04I,EAAUv2I,GACnCA,EAAUA,GAAW,GACrB,IAAIinH,EAAU,CACZu0B,KAAM,EAAoBt9I,GAGxBu9I,EAAkBz7I,EAAQutG,IAAM,CAAEiuC,KAAM72I,OAAOC,KAAKqiH,IAxC1D,SAA6BA,EAASsvB,GAWpC,IAVA,IAAImF,EAAe,CACjBF,KAAM,CAACjF,IAELkF,EAAkB,CACpBD,KAAM,IAEJG,EAAc,CAChBH,KAAM,IAGDH,EAAkBK,IAEvB,IADA,IAAIJ,EAAS32I,OAAOC,KAAK82I,GAChBlxI,EAAI,EAAGA,EAAI8wI,EAAO76I,OAAQ+J,IAAK,CACtC,IAAIwwI,EAAYM,EAAO9wI,GAEnBoxI,EADQF,EAAaV,GACC9pH,MAE1B,GADAyqH,EAAYX,GAAaW,EAAYX,IAAc,IAC/CW,EAAYX,GAAWY,IAAmB30B,EAAQ+zB,GAAWY,GAAjE,CACAD,EAAYX,GAAWY,IAAiB,EACxCH,EAAgBT,GAAaS,EAAgBT,IAAc,GAC3DS,EAAgBT,GAAW92I,KAAK03I,GAGhC,IAFA,IAAIC,EAAad,EAAsB9zB,EAASA,EAAQ+zB,GAAWY,GAAgBZ,GAC/Ec,EAAiBn3I,OAAOC,KAAKi3I,GACxBpxI,EAAI,EAAGA,EAAIqxI,EAAer7I,OAAQgK,IACzCixI,EAAaI,EAAerxI,IAAMixI,EAAaI,EAAerxI,KAAO,GACrEixI,EAAaI,EAAerxI,IAAMixI,EAAaI,EAAerxI,IAAI/H,OAAOm5I,EAAWC,EAAerxI,MAKzG,OAAOgxI,EAS8DM,CAAmB90B,EAASsvB,GAE7Fx/F,EAAM,GAEVpyC,OAAOC,KAAK62I,GAAiBn3I,QAAO,SAAUpG,GAAK,MAAa,SAANA,KAAgBiE,SAAQ,SAAUvE,GAE1F,IADA,IAAIo+I,EAAc,EACXP,EAAgB79I,GAAQo+I,IAC7BA,IAEFP,EAAgB79I,GAAQsG,KAAK83I,GAC7B/0B,EAAQrpH,GAAQo+I,GAAe,6FAC/BjlG,EAAMA,EAAM,OAASn5C,EAAS,OAAS88I,EAAqBtvI,WAAW2B,QAAQ,eAAgBhF,KAAKC,UAAUg0I,IAAgB,MAAQP,EAAgB79I,GAAQmD,KAAI,SAAU0M,GAAM,OAAY1F,KAAKC,UAAUyF,GAAM,KAAOw5G,EAAQrpH,GAAQ6P,GAAIrC,cAAcpJ,KAAK,KAAO,WAG1Q+0C,EAAMA,EAAM,IAAM2jG,EAAqBtvI,WAAW2B,QAAQ,eAAgBhF,KAAKC,UAAUuuI,IAAa,MAAQkF,EAAgBD,KAAKz6I,KAAI,SAAU0M,GAAM,OAAY1F,KAAKC,UAAUyF,GAAM,KAAOw5G,EAAQu0B,KAAK/tI,GAAIrC,cAAcpJ,KAAK,KAAO,YAE1O,IAAI0zC,EAAO,IAAIlmC,OAAOmmC,KAAK,CAACoB,GAAM,CAAE5vC,KAAM,oBAC1C,GAAInH,EAAQi8I,KAAQ,OAAOvmG,EAE3B,IAEIwmG,GAFM1sI,OAAO6jC,KAAO7jC,OAAO2sI,WAAa3sI,OAAO4sI,QAAU5sI,OAAO6sI,OAEhDtnC,gBAAgBr/D,GAChC6kG,EAAS,IAAI/qI,OAAO8sI,OAAOJ,GAG/B,OAFA3B,EAAOE,UAAYyB,EAEZ3B,IAMH,SAAU38I,EAAQC,GAQxBD,EAAOC,QAAU,SAAmB0+I,EAAYC,EAAaC,GACzD,UACA,IAAIC,EAAQ,IAAIH,EAAWr9C,WAAWu9C,GACtC,SAASE,EAASC,EAAOC,GAErBD,EAAQA,EAAQ,EAChBC,EAAQA,EAAQ,EAChB,IAAIC,EAAQ,EAAGC,EAAQ,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EAAGC,EAAS,EACvKX,EAASN,EAAMG,EAAQ,KAAO,GAAK,EACnCK,EAASR,EAAMG,EAAQ,KAAO,GAAK,EACnCO,EAASV,EAAMG,EAAQ,KAAO,GAAK,EACnCS,EAASZ,EAAMG,EAAQ,KAAO,GAAK,EACnCW,EAASd,EAAMG,EAAQ,KAAO,GAAK,EACnC,IAAKC,EAAQ,GAAIA,EAAQ,IAAMF,EAAQ,GAAIE,EAAQA,EAAQ,GAAK,EAAG,CAC/DG,EAASD,EACTG,EAASD,EACTG,EAASD,EACTG,EAASD,EACTG,EAASD,EACT,IAAKT,EAAQ,GAAIA,EAAQ,GAAK,GAAIA,EAAQA,EAAQ,EAAI,EAAG,CACrDY,EAASjB,EAAMI,EAAQC,GAAS,GAAK,EACrCW,IAAWV,GAAU,EAAIA,IAAW,KAAOE,EAASE,GAAUF,EAASI,GAAU,KAAOK,EAASH,EAAS,GAAK,WAAa,GAAK,EACjIA,EAASF,EACTA,EAASF,EACTA,EAASF,GAAU,GAAKA,IAAW,EACnCA,EAASF,EACTA,EAASU,EACThB,EAAME,EAAQG,GAAS,GAAKY,EAEhC,IAAKZ,EAAQH,EAAQ,GAAK,GAAIG,EAAQ,IAAMH,EAAQ,GAAK,GAAIG,EAAQA,EAAQ,EAAI,EAAG,CAChFY,GAAUjB,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,KAAO,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,MAAQ,GAC5NW,IAAWV,GAAU,EAAIA,IAAW,KAAOE,EAASE,GAAUF,EAASI,GAAU,KAAOK,EAASH,EAAS,GAAK,WAAa,GAAK,EACjIA,EAASF,EACTA,EAASF,EACTA,EAASF,GAAU,GAAKA,IAAW,EACnCA,EAASF,EACTA,EAASU,EACThB,EAAMK,GAAS,GAAKY,EAExB,IAAKZ,EAAQH,EAAQ,GAAK,GAAIG,EAAQ,IAAMH,EAAQ,IAAM,GAAIG,EAAQA,EAAQ,EAAI,EAAG,CACjFY,GAAUjB,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,KAAO,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,MAAQ,GAC5NW,IAAWV,GAAU,EAAIA,IAAW,KAAOE,EAASE,EAASE,GAAU,KAAOK,EAASH,EAAS,GAAK,WAAa,GAAK,EACvHA,EAASF,EACTA,EAASF,EACTA,EAASF,GAAU,GAAKA,IAAW,EACnCA,EAASF,EACTA,EAASU,EACThB,EAAMK,GAAS,GAAKY,EAExB,IAAKZ,EAAQH,EAAQ,IAAM,GAAIG,EAAQ,IAAMH,EAAQ,IAAM,GAAIG,EAAQA,EAAQ,EAAI,EAAG,CAClFY,GAAUjB,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,KAAO,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,MAAQ,GAC5NW,IAAWV,GAAU,EAAIA,IAAW,KAAOE,EAASE,EAASF,EAASI,EAASF,EAASE,GAAU,KAAOK,EAASH,EAAS,GAAK,WAAa,GAAK,EAClJA,EAASF,EACTA,EAASF,EACTA,EAASF,GAAU,GAAKA,IAAW,EACnCA,EAASF,EACTA,EAASU,EACThB,EAAMK,GAAS,GAAKY,EAExB,IAAKZ,EAAQH,EAAQ,IAAM,GAAIG,EAAQ,IAAMH,EAAQ,IAAM,GAAIG,EAAQA,EAAQ,EAAI,EAAG,CAClFY,GAAUjB,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,KAAO,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,GAAKL,EAAMK,EAAQ,IAAM,MAAQ,GAC5NW,IAAWV,GAAU,EAAIA,IAAW,KAAOE,EAASE,EAASE,GAAU,KAAOK,EAASH,EAAS,GAAK,UAAY,GAAK,EACtHA,EAASF,EACTA,EAASF,EACTA,EAASF,GAAU,GAAKA,IAAW,EACnCA,EAASF,EACTA,EAASU,EACThB,EAAMK,GAAS,GAAKY,EAExBX,EAASA,EAASC,EAAS,EAC3BC,EAASA,EAASC,EAAS,EAC3BC,EAASA,EAASC,EAAS,EAC3BC,EAASA,EAASC,EAAS,EAC3BC,EAASA,EAASC,EAAS,EAE/Bf,EAAMG,EAAQ,KAAO,GAAKG,EAC1BN,EAAMG,EAAQ,KAAO,GAAKK,EAC1BR,EAAMG,EAAQ,KAAO,GAAKO,EAC1BV,EAAMG,EAAQ,KAAO,GAAKS,EAC1BZ,EAAMG,EAAQ,KAAO,GAAKW,EAE9B,MAAO,CAAE36F,KAAM85F,KAKb,SAAU/+I,EAAQC,GAExB,IAAIgsB,EAAQ1qB,KAIRy2C,OAAS,EACO,oBAAT9jC,WAAuD,IAAxBA,KAAK8rI,iBAC7ChoG,EAAS,IAAI9jC,KAAK8rI,gBAKpB,IAiCIC,EAAU,SAAU1zI,EAAK2zI,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAChD,IAAIpG,OAAI,EACJ0tI,EAAKtnI,EAAM,EACXotI,GAAMzzI,EAAM2tI,GAAM,EAClBztI,EAAIF,EAAMyzI,EACd,OAAQ9F,GACN,KAAK,EACH4F,EAAGltI,GAAOzG,EAAInE,EAAQ,GACxB,KAAK,EACH83I,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK/tI,EAAInE,EAAQ,GAC5C,KAAK,EACH83I,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK/tI,EAAInE,EAAQ,GAC5C,KAAK,EACH83I,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK/tI,EAAInE,GAEtC,KAAIuE,EAAMyzI,GAAM,EAAI9F,IAApB,CAGA,IAAK1tI,EAAI,EAAI0tI,EAAI1tI,EAAIC,EAAGD,EAAIA,EAAI,EAAI,EAClCuzI,EAAIntI,EAAMpG,GAAK,EAAI,GAAKL,EAAInE,EAAQwE,IAAM,GAAKL,EAAInE,EAAQwE,EAAI,IAAM,GAAKL,EAAInE,EAAQwE,EAAI,IAAM,EAAIL,EAAInE,EAAQwE,EAAI,GAEtH,OAAQwzI,GACN,KAAK,EACHF,EAAGltI,EAAMnG,EAAI,EAAI,GAAKN,EAAInE,EAAQyE,EAAI,GACxC,KAAK,EACHqzI,EAAGltI,EAAMnG,EAAI,EAAI,GAAKN,EAAInE,EAAQyE,EAAI,GACxC,KAAK,EACHqzI,EAAGltI,EAAMnG,EAAI,EAAI,GAAKN,EAAInE,EAAQyE,MAoCxC7M,EAAOC,QAAU,SAAUkC,EAAM+9I,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GACpD,GAAoB,iBAAT7Q,EACT,OAlGU,SAAUyI,EAAKs1I,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAChD,IAAIpG,OAAI,EACJ0tI,EAAKtnI,EAAM,EACXotI,GAAMzzI,EAAM2tI,GAAM,EAClBztI,EAAIF,EAAMyzI,EACd,OAAQ9F,GACN,KAAK,EACH4F,EAAGltI,GAAOpI,EAAIgF,WAAWxH,EAAQ,GACnC,KAAK,EACH83I,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK1vI,EAAIgF,WAAWxH,EAAQ,GACvD,KAAK,EACH83I,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK1vI,EAAIgF,WAAWxH,EAAQ,GACvD,KAAK,EACH83I,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK1vI,EAAIgF,WAAWxH,GAEjD,KAAIuE,EAAMyzI,GAAM,EAAI9F,IAApB,CAGA,IAAK1tI,EAAI,EAAI0tI,EAAI1tI,EAAIC,EAAGD,EAAIA,EAAI,EAAI,EAClCuzI,EAAIntI,EAAMpG,GAAK,GAAKhC,EAAIgF,WAAWxH,EAAQwE,IAAM,GAAKhC,EAAIgF,WAAWxH,EAAQwE,EAAI,IAAM,GAAKhC,EAAIgF,WAAWxH,EAAQwE,EAAI,IAAM,EAAIhC,EAAIgF,WAAWxH,EAAQwE,EAAI,GAE9J,OAAQwzI,GACN,KAAK,EACHF,EAAGltI,EAAMnG,EAAI,EAAI,GAAKjC,EAAIgF,WAAWxH,EAAQyE,EAAI,GACnD,KAAK,EACHqzI,EAAGltI,EAAMnG,EAAI,EAAI,GAAKjC,EAAIgF,WAAWxH,EAAQyE,EAAI,GACnD,KAAK,EACHqzI,EAAGltI,EAAMnG,EAAI,EAAI,GAAKjC,EAAIgF,WAAWxH,EAAQyE,KAuExCwzI,CAAQl+I,EAAM+9I,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAE5C,GAAI7Q,aAAgBc,MAClB,OAAOg9I,EAAQ99I,EAAM+9I,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAG5C,GAAIiZ,GAASA,EAAMxpB,QAAUwpB,EAAMxpB,OAAOE,SAASR,GACjD,OAAO89I,EAAQ99I,EAAM+9I,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAE5C,GAAI7Q,aAAgBo9B,YAClB,OAAO0gH,EAAQ,IAAI/mH,WAAW/2B,GAAO+9I,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAE5D,GAAI7Q,EAAK2K,kBAAkByyB,YACzB,OAAO0gH,EAAQ,IAAI/mH,WAAW/2B,EAAK2K,OAAQ3K,EAAKg3B,WAAYh3B,EAAKmB,YAAa48I,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAErG,GAAI7Q,aAAgB41C,KAClB,OAlDW,SAAUD,EAAMooG,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAClD,IAAIpG,OAAI,EACJ0tI,EAAKtnI,EAAM,EACXotI,GAAMzzI,EAAM2tI,GAAM,EAClBztI,EAAIF,EAAMyzI,EACV7zI,EAAM,IAAI2sB,WAAW8e,EAAOK,kBAAkBP,EAAK3zC,MAAMiE,EAAOA,EAAQuE,KAC5E,OAAQ2tI,GACN,KAAK,EACH4F,EAAGltI,GAAOzG,EAAI,GAChB,KAAK,EACH2zI,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK/tI,EAAI,GACpC,KAAK,EACH2zI,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK/tI,EAAI,GACpC,KAAK,EACH2zI,EAAGltI,EAAM,GAAKsnI,GAAM,GAAK,GAAK/tI,EAAI,GAEtC,KAAII,EAAMyzI,GAAM,EAAI9F,IAApB,CAGA,IAAK1tI,EAAI,EAAI0tI,EAAI1tI,EAAIC,EAAGD,EAAIA,EAAI,EAAI,EAClCuzI,EAAIntI,EAAMpG,GAAK,EAAI,GAAKL,EAAIK,IAAM,GAAKL,EAAIK,EAAI,IAAM,GAAKL,EAAIK,EAAI,IAAM,EAAIL,EAAIK,EAAI,GAEtF,OAAQwzI,GACN,KAAK,EACHF,EAAGltI,EAAMnG,EAAI,EAAI,GAAKN,EAAIM,EAAI,GAChC,KAAK,EACHqzI,EAAGltI,EAAMnG,EAAI,EAAI,GAAKN,EAAIM,EAAI,GAChC,KAAK,EACHqzI,EAAGltI,EAAMnG,EAAI,EAAI,GAAKN,EAAIM,KAsBrByzI,CAASn+I,EAAM+9I,EAAIC,EAAK/3I,EAAOuE,EAAKqG,GAE7C,MAAM,IAAIxS,MAAM,4BAKZ,SAAUR,EAAQC,EAAS,GAEjC,IAAIsgJ,EAAe,WAAc,SAAS5oG,EAAiBzoB,EAAQC,GAAS,IAAK,IAAIviB,EAAI,EAAGA,EAAIuiB,EAAMtsB,OAAQ+J,IAAK,CAAE,IAAIwiB,EAAaD,EAAMviB,GAAIwiB,EAAWN,WAAaM,EAAWN,aAAc,EAAOM,EAAWL,cAAe,EAAU,UAAWK,IAAYA,EAAWJ,UAAW,GAAMjoB,OAAO8nB,eAAeK,EAAQE,EAAWxpB,IAAKwpB,IAAiB,OAAO,SAAUjD,EAAagI,EAAYqsH,GAAiJ,OAA9HrsH,GAAYwjB,EAAiBxrB,EAAY3qB,UAAW2yB,GAAiBqsH,GAAa7oG,EAAiBxrB,EAAaq0H,GAAqBr0H,GAA7gB,GAMfmtH,EAAQ,EAAoB,GAG5BnhD,EADW,EAAoB,GACdA,MAEjBj0B,EAAO,WACT,SAASA,KAVX,SAAyBh4C,EAAUC,GAAe,KAAMD,aAAoBC,GAAgB,MAAM,IAAIC,UAAU,qCAW5GC,CAAgB9qB,KAAM2iE,GAEtB3iE,KAAKk/I,OAAS,IAAInH,EAClB/3I,KAAKk/I,OAAOzF,aA6Bd,OA1BA92E,EAAK1iE,UAAUmxC,OAAS,SAAgBxwC,GAEtC,OADAZ,KAAKk/I,OAAO7L,OAAOzyI,GACZZ,MAGT2iE,EAAK1iE,UAAUgkD,OAAS,SAAgBjoB,GACtC,IAAIioB,EAASjkD,KAAKk/I,OAAOrF,SAAStuI,OAClC,IAAKywB,EACH,OAAOioB,EAET,GAAiB,QAAbjoB,EACF,OAAO46D,EAAM3yC,GAEf,MAAM,IAAIhlD,MAAM,gCAGlB+/I,EAAar8E,EAAM,CAAC,CAClBt+D,IAAK,QACLjF,IAAK,WACH,OAAOY,KAAKk/I,OAAOtF,YAErB16I,IAAK,SAAUuE,GACbzD,KAAKk/I,OAAO3X,SAAS9jI,OAIlBk/D,EAlCE,GAqCXlkE,EAAOC,QAAU,WACf,OAAO,IAAIikE,OAp6BXlkE,EAAOC,QAAUu4I,oBCAnB,IAAI1rI,EAAS,EAAQ,MACjBrK,EAASqK,EAAOrK,OAGpB,SAASi+I,EAAWvnG,EAAK4iB,GACvB,IAAK,IAAIn2D,KAAOuzC,EACd4iB,EAAIn2D,GAAOuzC,EAAIvzC,GAWnB,SAAS+6I,EAAY75I,EAAK4rD,EAAkB7vD,GAC1C,OAAOJ,EAAOqE,EAAK4rD,EAAkB7vD,GATnCJ,EAAO2M,MAAQ3M,EAAO6B,OAAS7B,EAAOkpC,aAAelpC,EAAO8zD,gBAC9Dv2D,EAAOC,QAAU6M,GAGjB4zI,EAAU5zI,EAAQ7M,GAClBA,EAAQwC,OAASk+I,GAOnBA,EAAWn/I,UAAYuF,OAAOgpB,OAAOttB,EAAOjB,WAG5Ck/I,EAAUj+I,EAAQk+I,GAElBA,EAAWvxI,KAAO,SAAUtI,EAAK4rD,EAAkB7vD,GACjD,GAAmB,iBAARiE,EACT,MAAM,IAAIslB,UAAU,iCAEtB,OAAO3pB,EAAOqE,EAAK4rD,EAAkB7vD,IAGvC89I,EAAWr8I,MAAQ,SAAUnE,EAAMimD,EAAM7oB,GACvC,GAAoB,iBAATp9B,EACT,MAAM,IAAIisB,UAAU,6BAEtB,IAAI7f,EAAM9J,EAAOtC,GAUjB,YATawJ,IAATy8C,EACsB,iBAAb7oB,EACThxB,EAAI65C,KAAKA,EAAM7oB,GAEfhxB,EAAI65C,KAAKA,GAGX75C,EAAI65C,KAAK,GAEJ75C,GAGTo0I,EAAWh1G,YAAc,SAAUxrC,GACjC,GAAoB,iBAATA,EACT,MAAM,IAAIisB,UAAU,6BAEtB,OAAO3pB,EAAOtC,IAGhBwgJ,EAAWpqF,gBAAkB,SAAUp2D,GACrC,GAAoB,iBAATA,EACT,MAAM,IAAIisB,UAAU,6BAEtB,OAAOtf,EAAOwlD,WAAWnyD,qCCtDvByF,YALAkH,EAAS,EAAQ,MACjBrK,EAASqK,EAAOrK,OAEhBm+I,EAAQ,GAIZ,IAAKh7I,KAAOkH,EACLA,EAAO7K,eAAe2D,IACf,eAARA,GAAgC,WAARA,IAC5Bg7I,EAAMh7I,GAAOkH,EAAOlH,IAGtB,IAAIi7I,EAAQD,EAAMn+I,OAAS,GAC3B,IAAKmD,KAAOnD,EACLA,EAAOR,eAAe2D,IACf,gBAARA,GAAiC,oBAARA,IAC7Bi7I,EAAMj7I,GAAOnD,EAAOmD,IAqCtB,GAlCAg7I,EAAMn+I,OAAOjB,UAAYiB,EAAOjB,UAE3Bq/I,EAAMzxI,MAAQyxI,EAAMzxI,OAAS8pB,WAAW9pB,OAC3CyxI,EAAMzxI,KAAO,SAAUpM,EAAO0vD,EAAkB7vD,GAC9C,GAAqB,iBAAVG,EACT,MAAM,IAAIopB,UAAU,yEAA2EppB,GAEjG,GAAIA,QAAiC,IAAjBA,EAAMH,OACxB,MAAM,IAAIupB,UAAU,yHAA2HppB,GAEjJ,OAAOP,EAAOO,EAAO0vD,EAAkB7vD,KAItCg+I,EAAMv8I,QACTu8I,EAAMv8I,MAAQ,SAAUnE,EAAMimD,EAAM7oB,GAClC,GAAoB,iBAATp9B,EACT,MAAM,IAAIisB,UAAU,oEAAsEjsB,GAE5F,GAAIA,EAAO,GAAKA,GAAQ,GAAK,GAAK,IAChC,MAAM,IAAIy1B,WAAW,cAAgBz1B,EAAO,kCAE9C,IAAIoM,EAAM9J,EAAOtC,GAQjB,OAPKimD,GAAwB,IAAhBA,EAAKvjD,OAEa,iBAAb06B,EAChBhxB,EAAI65C,KAAKA,EAAM7oB,GAEfhxB,EAAI65C,KAAKA,GAJT75C,EAAI65C,KAAK,GAMJ75C,KAINq0I,EAAME,iBACT,IACEF,EAAME,iBAAmB11H,EAAQihC,QAAQ,UAAUy0F,iBACnD,MAAO74I,IAMN24I,EAAM5/I,YACT4/I,EAAM5/I,UAAY,CAChB+/I,WAAYH,EAAMt0F,YAEhBs0F,EAAME,mBACRF,EAAM5/I,UAAUggJ,kBAAoBJ,EAAME,mBAI9C9gJ,EAAOC,QAAU2gJ,kBC5EjB,IAAIn+I,EAAS,eAGb,SAASyhE,EAAM9nB,EAAW6kG,GACxB1/I,KAAKiiG,OAAS/gG,EAAO6B,MAAM83C,GAC3B76C,KAAK2/I,WAAaD,EAClB1/I,KAAKkiG,WAAarnD,EAClB76C,KAAKwpB,KAAO,EAGdm5C,EAAK1iE,UAAUmxC,OAAS,SAAUxwC,EAAMH,GAClB,iBAATG,IACTH,EAAMA,GAAO,OACbG,EAAOM,EAAO2M,KAAKjN,EAAMH,IAQ3B,IALA,IAAIo/C,EAAQ7/C,KAAKiiG,OACbpnD,EAAY76C,KAAKkiG,WACjB5gG,EAASV,EAAKU,OACds+I,EAAQ5/I,KAAKwpB,KAERnoB,EAAS,EAAGA,EAASC,GAAS,CAIrC,IAHA,IAAIu+I,EAAWD,EAAQ/kG,EACnBilG,EAAYhvI,KAAK/D,IAAIzL,EAASD,EAAQw5C,EAAYglG,GAE7Cx0I,EAAI,EAAGA,EAAIy0I,EAAWz0I,IAC7Bw0C,EAAMggG,EAAWx0I,GAAKzK,EAAKS,EAASgK,GAItChK,GAAUy+I,GADVF,GAASE,GAGIjlG,GAAe,GAC1B76C,KAAKk9C,QAAQ2C,GAKjB,OADA7/C,KAAKwpB,MAAQloB,EACNtB,MAGT2iE,EAAK1iE,UAAUgkD,OAAS,SAAUxjD,GAChC,IAAI0vE,EAAMnwE,KAAKwpB,KAAOxpB,KAAKkiG,WAE3BliG,KAAKiiG,OAAO9xB,GAAO,IAInBnwE,KAAKiiG,OAAOp9C,KAAK,EAAGsrB,EAAM,GAEtBA,GAAOnwE,KAAK2/I,aACd3/I,KAAKk9C,QAAQl9C,KAAKiiG,QAClBjiG,KAAKiiG,OAAOp9C,KAAK,IAGnB,IAAIvlC,EAAmB,EAAZtf,KAAKwpB,KAGhB,GAAIlK,GAAQ,WACVtf,KAAKiiG,OAAO53D,cAAc/qB,EAAMtf,KAAKkiG,WAAa,OAG7C,CACL,IAAI69C,GAAkB,WAAPzgI,KAAuB,EAClC0gI,GAAY1gI,EAAOygI,GAAW,WAElC//I,KAAKiiG,OAAO53D,cAAc21G,EAAUhgJ,KAAKkiG,WAAa,GACtDliG,KAAKiiG,OAAO53D,cAAc01G,EAAS//I,KAAKkiG,WAAa,GAGvDliG,KAAKk9C,QAAQl9C,KAAKiiG,QAClB,IAAIv+C,EAAO1jD,KAAK2jD,QAEhB,OAAOljD,EAAMijD,EAAKz3C,SAASxL,GAAOijD,GAGpCif,EAAK1iE,UAAUi9C,QAAU,WACvB,MAAM,IAAIj+C,MAAM,4CAGlBR,EAAOC,QAAUikE,kBChFjB,IAAIjkE,EAAUD,EAAOC,QAAU,SAAc6kD,GAC3CA,EAAYA,EAAU1b,cAEtB,IAAIo4G,EAAYvhJ,EAAQ6kD,GACxB,IAAK08F,EAAW,MAAM,IAAIhhJ,MAAMskD,EAAY,+CAE5C,OAAO,IAAI08F,GAGbvhJ,EAAQgkE,IAAM,EAAQ,MACtBhkE,EAAQihC,KAAO,EAAQ,MACvBjhC,EAAQikG,OAAS,EAAQ,MACzBjkG,EAAQkzF,OAAS,EAAQ,MACzBlzF,EAAQmzF,OAAS,EAAQ,MACzBnzF,EAAQozF,OAAS,EAAQ,sBCNzB,IAAIlyF,EAAW,EAAQ,MACnB+iE,EAAO,EAAQ,MACfzhE,EAAS,eAETyiG,EAAI,CACN,WAAY,YAAY,YAAgB,WAGtCiB,EAAI,IAAIljG,MAAM,IAElB,SAASw+I,IACPlgJ,KAAKiqD,OACLjqD,KAAKmgJ,GAAKv7C,EAEVjiC,EAAKpiE,KAAKP,KAAM,GAAI,IAmBtB,SAASogJ,EAAQx6I,GACf,OAAQA,GAAO,GAAOA,IAAQ,EAGhC,SAASy6I,EAAIljI,EAAGtK,EAAGrC,EAAG8rB,GACpB,OAAU,IAANnf,EAAiBtK,EAAIrC,GAAQqC,EAAKypB,EAC5B,IAANnf,EAAiBtK,EAAIrC,EAAMqC,EAAIypB,EAAM9rB,EAAI8rB,EACtCzpB,EAAIrC,EAAI8rB,EAvBjB18B,EAASsgJ,EAAKv9E,GAEdu9E,EAAIjgJ,UAAUgqD,KAAO,WAOnB,OANAjqD,KAAK00G,GAAK,WACV10G,KAAK20G,GAAK,WACV30G,KAAK40G,GAAK,WACV50G,KAAK20B,GAAK,UACV30B,KAAK40B,GAAK,WAEH50B,MAiBTkgJ,EAAIjgJ,UAAUi9C,QAAU,SAAUjE,GAShC,IARA,IAfcrzC,EAeVg/F,EAAI5kG,KAAKmgJ,GAETvtI,EAAc,EAAV5S,KAAK00G,GACT7hG,EAAc,EAAV7S,KAAK20G,GACTnkG,EAAc,EAAVxQ,KAAK40G,GACTt4E,EAAc,EAAVt8B,KAAK20B,GACTjuB,EAAc,EAAV1G,KAAK40B,GAEJvpB,EAAI,EAAGA,EAAI,KAAMA,EAAGu5F,EAAEv5F,GAAK4tC,EAAE4e,YAAgB,EAAJxsD,GAClD,KAAOA,EAAI,KAAMA,EAAGu5F,EAAEv5F,GAAKu5F,EAAEv5F,EAAI,GAAKu5F,EAAEv5F,EAAI,GAAKu5F,EAAEv5F,EAAI,IAAMu5F,EAAEv5F,EAAI,IAEnE,IAAK,IAAIC,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,IAAI6R,KAAO7R,EAAI,IACXiJ,EAAoD,IA5B5C3O,EA4BGgN,IA3BF,EAAMhN,IAAQ,IA2BPy6I,EAAGljI,EAAGtK,EAAGrC,EAAG8rB,GAAK51B,EAAIk+F,EAAEt5F,GAAKq4F,EAAExmF,GAElDzW,EAAI41B,EACJA,EAAI9rB,EACJA,EAAI4vI,EAAOvtI,GACXA,EAAID,EACJA,EAAI2B,EAGNvU,KAAK00G,GAAM9hG,EAAI5S,KAAK00G,GAAM,EAC1B10G,KAAK20G,GAAM9hG,EAAI7S,KAAK20G,GAAM,EAC1B30G,KAAK40G,GAAMpkG,EAAIxQ,KAAK40G,GAAM,EAC1B50G,KAAK20B,GAAM2H,EAAIt8B,KAAK20B,GAAM,EAC1B30B,KAAK40B,GAAMluB,EAAI1G,KAAK40B,GAAM,GAG5BsrH,EAAIjgJ,UAAU0jD,MAAQ,WACpB,IAAIgC,EAAIzkD,EAAOkpC,YAAY,IAQ3B,OANAub,EAAE0T,aAAuB,EAAVr5D,KAAK00G,GAAQ,GAC5B/uD,EAAE0T,aAAuB,EAAVr5D,KAAK20G,GAAQ,GAC5BhvD,EAAE0T,aAAuB,EAAVr5D,KAAK40G,GAAQ,GAC5BjvD,EAAE0T,aAAuB,EAAVr5D,KAAK20B,GAAQ,IAC5BgxB,EAAE0T,aAAuB,EAAVr5D,KAAK40B,GAAQ,IAErB+wB,GAGTlnD,EAAOC,QAAUwhJ,kBCpFjB,IAAItgJ,EAAW,EAAQ,MACnB+iE,EAAO,EAAQ,MACfzhE,EAAS,eAETyiG,EAAI,CACN,WAAY,YAAY,YAAgB,WAGtCiB,EAAI,IAAIljG,MAAM,IAElB,SAAS4+I,IACPtgJ,KAAKiqD,OACLjqD,KAAKmgJ,GAAKv7C,EAEVjiC,EAAKpiE,KAAKP,KAAM,GAAI,IAmBtB,SAASugJ,EAAO36I,GACd,OAAQA,GAAO,EAAMA,IAAQ,GAG/B,SAASw6I,EAAQx6I,GACf,OAAQA,GAAO,GAAOA,IAAQ,EAGhC,SAASy6I,EAAIljI,EAAGtK,EAAGrC,EAAG8rB,GACpB,OAAU,IAANnf,EAAiBtK,EAAIrC,GAAQqC,EAAKypB,EAC5B,IAANnf,EAAiBtK,EAAIrC,EAAMqC,EAAIypB,EAAM9rB,EAAI8rB,EACtCzpB,EAAIrC,EAAI8rB,EA3BjB18B,EAAS0gJ,EAAM39E,GAEf29E,EAAKrgJ,UAAUgqD,KAAO,WAOpB,OANAjqD,KAAK00G,GAAK,WACV10G,KAAK20G,GAAK,WACV30G,KAAK40G,GAAK,WACV50G,KAAK20B,GAAK,UACV30B,KAAK40B,GAAK,WAEH50B,MAqBTsgJ,EAAKrgJ,UAAUi9C,QAAU,SAAUjE,GASjC,IARA,IAnBcrzC,EAmBVg/F,EAAI5kG,KAAKmgJ,GAETvtI,EAAc,EAAV5S,KAAK00G,GACT7hG,EAAc,EAAV7S,KAAK20G,GACTnkG,EAAc,EAAVxQ,KAAK40G,GACTt4E,EAAc,EAAVt8B,KAAK20B,GACTjuB,EAAc,EAAV1G,KAAK40B,GAEJvpB,EAAI,EAAGA,EAAI,KAAMA,EAAGu5F,EAAEv5F,GAAK4tC,EAAE4e,YAAgB,EAAJxsD,GAClD,KAAOA,EAAI,KAAMA,EAAGu5F,EAAEv5F,IA5BRzF,EA4BmBg/F,EAAEv5F,EAAI,GAAKu5F,EAAEv5F,EAAI,GAAKu5F,EAAEv5F,EAAI,IAAMu5F,EAAEv5F,EAAI,MA3B1D,EAAMzF,IAAQ,GA6B7B,IAAK,IAAI0F,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,IAAI6R,KAAO7R,EAAI,IACXiJ,EAAKgsI,EAAM3tI,GAAKytI,EAAGljI,EAAGtK,EAAGrC,EAAG8rB,GAAK51B,EAAIk+F,EAAEt5F,GAAKq4F,EAAExmF,GAAM,EAExDzW,EAAI41B,EACJA,EAAI9rB,EACJA,EAAI4vI,EAAOvtI,GACXA,EAAID,EACJA,EAAI2B,EAGNvU,KAAK00G,GAAM9hG,EAAI5S,KAAK00G,GAAM,EAC1B10G,KAAK20G,GAAM9hG,EAAI7S,KAAK20G,GAAM,EAC1B30G,KAAK40G,GAAMpkG,EAAIxQ,KAAK40G,GAAM,EAC1B50G,KAAK20B,GAAM2H,EAAIt8B,KAAK20B,GAAM,EAC1B30B,KAAK40B,GAAMluB,EAAI1G,KAAK40B,GAAM,GAG5B0rH,EAAKrgJ,UAAU0jD,MAAQ,WACrB,IAAIgC,EAAIzkD,EAAOkpC,YAAY,IAQ3B,OANAub,EAAE0T,aAAuB,EAAVr5D,KAAK00G,GAAQ,GAC5B/uD,EAAE0T,aAAuB,EAAVr5D,KAAK20G,GAAQ,GAC5BhvD,EAAE0T,aAAuB,EAAVr5D,KAAK40G,GAAQ,GAC5BjvD,EAAE0T,aAAuB,EAAVr5D,KAAK20B,GAAQ,IAC5BgxB,EAAE0T,aAAuB,EAAVr5D,KAAK40B,GAAQ,IAErB+wB,GAGTlnD,EAAOC,QAAU4hJ,kBC1FjB,IAAI1gJ,EAAW,EAAQ,MACnB4gJ,EAAS,EAAQ,MACjB79E,EAAO,EAAQ,MACfzhE,EAAS,eAET0jG,EAAI,IAAIljG,MAAM,IAElB,SAAS++I,IACPzgJ,KAAKiqD,OAELjqD,KAAKmgJ,GAAKv7C,EAEVjiC,EAAKpiE,KAAKP,KAAM,GAAI,IAGtBJ,EAAS6gJ,EAAQD,GAEjBC,EAAOxgJ,UAAUgqD,KAAO,WAUtB,OATAjqD,KAAK00G,GAAK,WACV10G,KAAK20G,GAAK,UACV30G,KAAK40G,GAAK,UACV50G,KAAK20B,GAAK,WACV30B,KAAK40B,GAAK,WACV50B,KAAK0gJ,GAAK,WACV1gJ,KAAK2gJ,GAAK,WACV3gJ,KAAK4gJ,GAAK,WAEH5gJ,MAGTygJ,EAAOxgJ,UAAU0jD,MAAQ,WACvB,IAAIgC,EAAIzkD,EAAOkpC,YAAY,IAU3B,OARAub,EAAE0T,aAAar5D,KAAK00G,GAAI,GACxB/uD,EAAE0T,aAAar5D,KAAK20G,GAAI,GACxBhvD,EAAE0T,aAAar5D,KAAK40G,GAAI,GACxBjvD,EAAE0T,aAAar5D,KAAK20B,GAAI,IACxBgxB,EAAE0T,aAAar5D,KAAK40B,GAAI,IACxB+wB,EAAE0T,aAAar5D,KAAK0gJ,GAAI,IACxB/6F,EAAE0T,aAAar5D,KAAK2gJ,GAAI,IAEjBh7F,GAGTlnD,EAAOC,QAAU+hJ,kBC5CjB,IAAI7gJ,EAAW,EAAQ,MACnB+iE,EAAO,EAAQ,MACfzhE,EAAS,eAETyiG,EAAI,CACN,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,UAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,UAAY,UAAY,UACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,YAGlCiB,EAAI,IAAIljG,MAAM,IAElB,SAAS8+I,IACPxgJ,KAAKiqD,OAELjqD,KAAKmgJ,GAAKv7C,EAEVjiC,EAAKpiE,KAAKP,KAAM,GAAI,IAkBtB,SAASkoG,EAAIhsF,EAAGC,EAAG4K,GACjB,OAAOA,EAAK7K,GAAKC,EAAI4K,GAGvB,SAAS85H,EAAK3kI,EAAGC,EAAG4K,GAClB,OAAQ7K,EAAIC,EAAM4K,GAAK7K,EAAIC,GAG7B,SAAS2kI,EAAQ5kI,GACf,OAAQA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAGvE,SAAS6kI,EAAQ7kI,GACf,OAAQA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,KAAOA,IAAM,GAAKA,GAAK,GAGvE,SAAS8kI,EAAQ9kI,GACf,OAAQA,IAAM,EAAIA,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAAOA,IAAM,EAhC7Dtc,EAAS4gJ,EAAQ79E,GAEjB69E,EAAOvgJ,UAAUgqD,KAAO,WAUtB,OATAjqD,KAAK00G,GAAK,WACV10G,KAAK20G,GAAK,WACV30G,KAAK40G,GAAK,WACV50G,KAAK20B,GAAK,WACV30B,KAAK40B,GAAK,WACV50B,KAAK0gJ,GAAK,WACV1gJ,KAAK2gJ,GAAK,UACV3gJ,KAAK4gJ,GAAK,WAEH5gJ,MA2BTwgJ,EAAOvgJ,UAAUi9C,QAAU,SAAUjE,GAYnC,IAXA,IALe/8B,EAKX0oF,EAAI5kG,KAAKmgJ,GAETvtI,EAAc,EAAV5S,KAAK00G,GACT7hG,EAAc,EAAV7S,KAAK20G,GACTnkG,EAAc,EAAVxQ,KAAK40G,GACTt4E,EAAc,EAAVt8B,KAAK20B,GACTjuB,EAAc,EAAV1G,KAAK40B,GACTe,EAAc,EAAV31B,KAAK0gJ,GACT1+H,EAAc,EAAVhiB,KAAK2gJ,GACT/gI,EAAc,EAAV5f,KAAK4gJ,GAEJv1I,EAAI,EAAGA,EAAI,KAAMA,EAAGu5F,EAAEv5F,GAAK4tC,EAAE4e,YAAgB,EAAJxsD,GAClD,KAAOA,EAAI,KAAMA,EAAGu5F,EAAEv5F,GAAqE,KAjB5E6Q,EAiBoB0oF,EAAEv5F,EAAI,MAhB3B,GAAK6Q,GAAK,KAAOA,IAAM,GAAKA,GAAK,IAAOA,IAAM,IAgBb0oF,EAAEv5F,EAAI,GAAK21I,EAAOp8C,EAAEv5F,EAAI,KAAOu5F,EAAEv5F,EAAI,IAEpF,IAAK,IAAIC,EAAI,EAAGA,EAAI,KAAMA,EAAG,CAC3B,IAAIg6F,EAAM1lF,EAAImhI,EAAOr6I,GAAKwhG,EAAGxhG,EAAGivB,EAAG3T,GAAK2hF,EAAEr4F,GAAKs5F,EAAEt5F,GAAM,EACnDi6F,EAAMu7C,EAAOluI,GAAKiuI,EAAIjuI,EAAGC,EAAGrC,GAAM,EAEtCoP,EAAIoC,EACJA,EAAI2T,EACJA,EAAIjvB,EACJA,EAAK41B,EAAIgpE,EAAM,EACfhpE,EAAI9rB,EACJA,EAAIqC,EACJA,EAAID,EACJA,EAAK0yF,EAAKC,EAAM,EAGlBvlG,KAAK00G,GAAM9hG,EAAI5S,KAAK00G,GAAM,EAC1B10G,KAAK20G,GAAM9hG,EAAI7S,KAAK20G,GAAM,EAC1B30G,KAAK40G,GAAMpkG,EAAIxQ,KAAK40G,GAAM,EAC1B50G,KAAK20B,GAAM2H,EAAIt8B,KAAK20B,GAAM,EAC1B30B,KAAK40B,GAAMluB,EAAI1G,KAAK40B,GAAM,EAC1B50B,KAAK0gJ,GAAM/qH,EAAI31B,KAAK0gJ,GAAM,EAC1B1gJ,KAAK2gJ,GAAM3+H,EAAIhiB,KAAK2gJ,GAAM,EAC1B3gJ,KAAK4gJ,GAAMhhI,EAAI5f,KAAK4gJ,GAAM,GAG5BJ,EAAOvgJ,UAAU0jD,MAAQ,WACvB,IAAIgC,EAAIzkD,EAAOkpC,YAAY,IAW3B,OATAub,EAAE0T,aAAar5D,KAAK00G,GAAI,GACxB/uD,EAAE0T,aAAar5D,KAAK20G,GAAI,GACxBhvD,EAAE0T,aAAar5D,KAAK40G,GAAI,GACxBjvD,EAAE0T,aAAar5D,KAAK20B,GAAI,IACxBgxB,EAAE0T,aAAar5D,KAAK40B,GAAI,IACxB+wB,EAAE0T,aAAar5D,KAAK0gJ,GAAI,IACxB/6F,EAAE0T,aAAar5D,KAAK2gJ,GAAI,IACxBh7F,EAAE0T,aAAar5D,KAAK4gJ,GAAI,IAEjBj7F,GAGTlnD,EAAOC,QAAU8hJ,kBCtIjB,IAAI5gJ,EAAW,EAAQ,MACnB4lG,EAAS,EAAQ,MACjB7iC,EAAO,EAAQ,MACfzhE,EAAS,eAET0jG,EAAI,IAAIljG,MAAM,KAElB,SAASu/I,IACPjhJ,KAAKiqD,OACLjqD,KAAKmgJ,GAAKv7C,EAEVjiC,EAAKpiE,KAAKP,KAAM,IAAK,KAGvBJ,EAASqhJ,EAAQz7C,GAEjBy7C,EAAOhhJ,UAAUgqD,KAAO,WAmBtB,OAlBAjqD,KAAKkhJ,IAAM,WACXlhJ,KAAKmhJ,IAAM,WACXnhJ,KAAKohJ,IAAM,WACXphJ,KAAK0jC,IAAM,UACX1jC,KAAKqhJ,IAAM,WACXrhJ,KAAKshJ,IAAM,WACXthJ,KAAKuhJ,IAAM,WACXvhJ,KAAKwhJ,IAAM,WAEXxhJ,KAAKyhJ,IAAM,WACXzhJ,KAAK0hJ,IAAM,UACX1hJ,KAAK2hJ,IAAM,UACX3hJ,KAAK4hJ,IAAM,WACX5hJ,KAAK6hJ,IAAM,WACX7hJ,KAAK8hJ,IAAM,WACX9hJ,KAAK+hJ,IAAM,WACX/hJ,KAAKgiJ,IAAM,WAEJhiJ,MAGTihJ,EAAOhhJ,UAAU0jD,MAAQ,WACvB,IAAIgC,EAAIzkD,EAAOkpC,YAAY,IAE3B,SAAS63G,EAAcriI,EAAGnD,EAAGpb,GAC3BskD,EAAE0T,aAAaz5C,EAAGve,GAClBskD,EAAE0T,aAAa58C,EAAGpb,EAAS,GAU7B,OAPA4gJ,EAAajiJ,KAAKkhJ,IAAKlhJ,KAAKyhJ,IAAK,GACjCQ,EAAajiJ,KAAKmhJ,IAAKnhJ,KAAK0hJ,IAAK,GACjCO,EAAajiJ,KAAKohJ,IAAKphJ,KAAK2hJ,IAAK,IACjCM,EAAajiJ,KAAK0jC,IAAK1jC,KAAK4hJ,IAAK,IACjCK,EAAajiJ,KAAKqhJ,IAAKrhJ,KAAK6hJ,IAAK,IACjCI,EAAajiJ,KAAKshJ,IAAKthJ,KAAK8hJ,IAAK,IAE1Bn8F,GAGTlnD,EAAOC,QAAUuiJ,kBCxDjB,IAAIrhJ,EAAW,EAAQ,MACnB+iE,EAAO,EAAQ,MACfzhE,EAAS,eAETyiG,EAAI,CACN,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,UAAY,UACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,WAAY,WAAY,UACpC,WAAY,WAAY,WAAY,WACpC,UAAY,WAAY,UAAY,WACpC,UAAY,WAAY,UAAY,UACpC,UAAY,UAAY,UAAY,WACpC,WAAY,UAAY,WAAY,WACpC,WAAY,WAAY,WAAY,WACpC,WAAY,UAAY,WAAY,YAGlCiB,EAAI,IAAIljG,MAAM,KAElB,SAASwgJ,IACPliJ,KAAKiqD,OACLjqD,KAAKmgJ,GAAKv7C,EAEVjiC,EAAKpiE,KAAKP,KAAM,IAAK,KA2BvB,SAAS+jG,EAAI7nF,EAAGC,EAAG4K,GACjB,OAAOA,EAAK7K,GAAKC,EAAI4K,GAGvB,SAAS85H,EAAK3kI,EAAGC,EAAG4K,GAClB,OAAQ7K,EAAIC,EAAM4K,GAAK7K,EAAIC,GAG7B,SAAS2kI,EAAQ5kI,EAAGsqF,GAClB,OAAQtqF,IAAM,GAAKsqF,GAAM,IAAMA,IAAO,EAAItqF,GAAK,KAAOsqF,IAAO,EAAItqF,GAAK,IAGxE,SAAS6kI,EAAQ7kI,EAAGsqF,GAClB,OAAQtqF,IAAM,GAAKsqF,GAAM,KAAOtqF,IAAM,GAAKsqF,GAAM,KAAOA,IAAO,EAAItqF,GAAK,IAG1E,SAASimI,EAAQjmI,EAAGsqF,GAClB,OAAQtqF,IAAM,EAAIsqF,GAAM,KAAOtqF,IAAM,EAAIsqF,GAAM,IAAOtqF,IAAM,EAG9D,SAASkmI,EAASlmI,EAAGsqF,GACnB,OAAQtqF,IAAM,EAAIsqF,GAAM,KAAOtqF,IAAM,EAAIsqF,GAAM,KAAOtqF,IAAM,EAAIsqF,GAAM,IAGxE,SAAS67C,EAAQnmI,EAAGsqF,GAClB,OAAQtqF,IAAM,GAAKsqF,GAAM,KAAOA,IAAO,GAAKtqF,GAAK,GAAMA,IAAM,EAG/D,SAASomI,EAASpmI,EAAGsqF,GACnB,OAAQtqF,IAAM,GAAKsqF,GAAM,KAAOA,IAAO,GAAKtqF,GAAK,IAAMA,IAAM,EAAIsqF,GAAM,IAGzE,SAAS+7C,EAAU3vI,EAAGC,GACpB,OAAQD,IAAM,EAAMC,IAAM,EAAK,EAAI,EAzDrCjT,EAASsiJ,EAAQv/E,GAEjBu/E,EAAOjiJ,UAAUgqD,KAAO,WAmBtB,OAlBAjqD,KAAKkhJ,IAAM,WACXlhJ,KAAKmhJ,IAAM,WACXnhJ,KAAKohJ,IAAM,WACXphJ,KAAK0jC,IAAM,WACX1jC,KAAKqhJ,IAAM,WACXrhJ,KAAKshJ,IAAM,WACXthJ,KAAKuhJ,IAAM,UACXvhJ,KAAKwhJ,IAAM,WAEXxhJ,KAAKyhJ,IAAM,WACXzhJ,KAAK0hJ,IAAM,WACX1hJ,KAAK2hJ,IAAM,WACX3hJ,KAAK4hJ,IAAM,WACX5hJ,KAAK6hJ,IAAM,WACX7hJ,KAAK8hJ,IAAM,UACX9hJ,KAAK+hJ,IAAM,WACX/hJ,KAAKgiJ,IAAM,UAEJhiJ,MAuCTkiJ,EAAOjiJ,UAAUi9C,QAAU,SAAUjE,GAqBnC,IApBA,IAAI2rD,EAAI5kG,KAAKmgJ,GAETp4C,EAAgB,EAAX/nG,KAAKkhJ,IACVj5C,EAAgB,EAAXjoG,KAAKmhJ,IACVj5C,EAAgB,EAAXloG,KAAKohJ,IACVv5E,EAAgB,EAAX7nE,KAAK0jC,IACV2kE,EAAgB,EAAXroG,KAAKqhJ,IACV94C,EAAgB,EAAXvoG,KAAKshJ,IACV74C,EAAgB,EAAXzoG,KAAKuhJ,IACV54C,EAAgB,EAAX3oG,KAAKwhJ,IAEVx5C,EAAgB,EAAXhoG,KAAKyhJ,IACVthG,EAAgB,EAAXngD,KAAK0hJ,IACVv5C,EAAgB,EAAXnoG,KAAK2hJ,IACVv5C,EAAgB,EAAXpoG,KAAK4hJ,IACVt5C,EAAgB,EAAXtoG,KAAK6hJ,IACVr5C,EAAgB,EAAXxoG,KAAK8hJ,IACVp5C,EAAgB,EAAX1oG,KAAK+hJ,IACVn5C,EAAgB,EAAX5oG,KAAKgiJ,IAEL32I,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAC3Bu5F,EAAEv5F,GAAK4tC,EAAE4e,YAAgB,EAAJxsD,GACrBu5F,EAAEv5F,EAAI,GAAK4tC,EAAE4e,YAAgB,EAAJxsD,EAAQ,GAEnC,KAAOA,EAAI,IAAKA,GAAK,EAAG,CACtB,IAAIk7F,EAAK3B,EAAEv5F,EAAI,IACXm7F,EAAK5B,EAAEv5F,EAAI,GAAS,GACpB21I,EAASmB,EAAO57C,EAAIC,GACpBg8C,EAAUJ,EAAQ57C,EAAID,GAItBk8C,EAASJ,EAFb97C,EAAK3B,EAAEv5F,EAAI,GACXm7F,EAAK5B,EAAEv5F,EAAI,EAAQ,IAEfq3I,EAAUJ,EAAQ97C,EAAID,GAGtBo8C,EAAO/9C,EAAEv5F,EAAI,IACbu3I,EAAOh+C,EAAEv5F,EAAI,GAAQ,GAErBw3I,EAAQj+C,EAAEv5F,EAAI,IACdy3I,EAAQl+C,EAAEv5F,EAAI,GAAS,GAEvB03I,EAAOP,EAAUI,EAAQ,EACzBI,EAAOhC,EAAS2B,EAAOJ,EAASQ,EAAKP,GAAY,EAIrDQ,GAFAA,EAAOA,EAAMP,EAASF,EADtBQ,EAAOA,EAAML,EAAW,EACYA,GAAY,GAEnCG,EAAQN,EADrBQ,EAAOA,EAAMD,EAAS,EACaA,GAAU,EAE7Cl+C,EAAEv5F,GAAK23I,EACPp+C,EAAEv5F,EAAI,GAAK03I,EAGb,IAAK,IAAIz3I,EAAI,EAAGA,EAAI,IAAKA,GAAK,EAAG,CAC/B03I,EAAMp+C,EAAEt5F,GACRy3I,EAAMn+C,EAAEt5F,EAAI,GAEZ,IAAI23I,EAAOpC,EAAI94C,EAAIE,EAAIC,GACnBg7C,EAAOrC,EAAI74C,EAAI7nD,EAAIgoD,GAEnBg7C,EAAUrC,EAAO/4C,EAAIC,GACrBo7C,EAAUtC,EAAO94C,EAAID,GACrBs7C,EAAUtC,EAAO14C,EAAIC,GACrBg7C,EAAUvC,EAAOz4C,EAAID,GAGrBk7C,EAAM5/C,EAAEr4F,GACRk4I,EAAM7/C,EAAEr4F,EAAI,GAEZm4I,EAAM1/C,EAAGsE,EAAIE,EAAIE,GACjBi7C,EAAM3/C,EAAGuE,EAAIE,EAAIE,GAEjBi7C,EAAO/6C,EAAK06C,EAAW,EACvBM,EAAOj7C,EAAK06C,EAAUd,EAASoB,EAAK/6C,GAAO,EAM/Cg7C,GAFAA,GAFAA,EAAOA,EAAMH,EAAMlB,EADnBoB,EAAOA,EAAMD,EAAO,EACaA,GAAQ,GAE5BH,EAAMhB,EADnBoB,EAAOA,EAAMH,EAAO,EACaA,GAAQ,GAE5BR,EAAMT,EADnBoB,EAAOA,EAAMZ,EAAO,EACaA,GAAQ,EAGzC,IAAIc,GAAOT,EAAUF,EAAQ,EACzBY,GAAOX,EAAUF,EAAOV,EAASsB,GAAKT,GAAY,EAEtDz6C,EAAKF,EACLG,EAAKF,EACLD,EAAKF,EACLG,EAAKF,EACLD,EAAKF,EACLG,EAAKF,EAELD,EAAMxgC,EAAK+7E,EAAMrB,EADjBj6C,EAAMF,EAAKu7C,EAAO,EACYv7C,GAAO,EACrCvgC,EAAKqgC,EACLE,EAAKD,EACLD,EAAKD,EACLE,EAAKhoD,EACL8nD,EAAKF,EACL5nD,EAAK6nD,EAELD,EAAM67C,EAAME,GAAMvB,EADlBv6C,EAAM27C,EAAME,GAAO,EACYF,GAAQ,EAGzC3jJ,KAAKyhJ,IAAOzhJ,KAAKyhJ,IAAMz5C,EAAM,EAC7BhoG,KAAK0hJ,IAAO1hJ,KAAK0hJ,IAAMvhG,EAAM,EAC7BngD,KAAK2hJ,IAAO3hJ,KAAK2hJ,IAAMx5C,EAAM,EAC7BnoG,KAAK4hJ,IAAO5hJ,KAAK4hJ,IAAMx5C,EAAM,EAC7BpoG,KAAK6hJ,IAAO7hJ,KAAK6hJ,IAAMv5C,EAAM,EAC7BtoG,KAAK8hJ,IAAO9hJ,KAAK8hJ,IAAMt5C,EAAM,EAC7BxoG,KAAK+hJ,IAAO/hJ,KAAK+hJ,IAAMr5C,EAAM,EAC7B1oG,KAAKgiJ,IAAOhiJ,KAAKgiJ,IAAMp5C,EAAM,EAE7B5oG,KAAKkhJ,IAAOlhJ,KAAKkhJ,IAAMn5C,EAAKw6C,EAASviJ,KAAKyhJ,IAAKz5C,GAAO,EACtDhoG,KAAKmhJ,IAAOnhJ,KAAKmhJ,IAAMl5C,EAAKs6C,EAASviJ,KAAK0hJ,IAAKvhG,GAAO,EACtDngD,KAAKohJ,IAAOphJ,KAAKohJ,IAAMl5C,EAAKq6C,EAASviJ,KAAK2hJ,IAAKx5C,GAAO,EACtDnoG,KAAK0jC,IAAO1jC,KAAK0jC,IAAMmkC,EAAK06E,EAASviJ,KAAK4hJ,IAAKx5C,GAAO,EACtDpoG,KAAKqhJ,IAAOrhJ,KAAKqhJ,IAAMh5C,EAAKk6C,EAASviJ,KAAK6hJ,IAAKv5C,GAAO,EACtDtoG,KAAKshJ,IAAOthJ,KAAKshJ,IAAM/4C,EAAKg6C,EAASviJ,KAAK8hJ,IAAKt5C,GAAO,EACtDxoG,KAAKuhJ,IAAOvhJ,KAAKuhJ,IAAM94C,EAAK85C,EAASviJ,KAAK+hJ,IAAKr5C,GAAO,EACtD1oG,KAAKwhJ,IAAOxhJ,KAAKwhJ,IAAM74C,EAAK45C,EAASviJ,KAAKgiJ,IAAKp5C,GAAO,GAGxDs5C,EAAOjiJ,UAAU0jD,MAAQ,WACvB,IAAIgC,EAAIzkD,EAAOkpC,YAAY,IAE3B,SAAS63G,EAAcriI,EAAGnD,EAAGpb,GAC3BskD,EAAE0T,aAAaz5C,EAAGve,GAClBskD,EAAE0T,aAAa58C,EAAGpb,EAAS,GAY7B,OATA4gJ,EAAajiJ,KAAKkhJ,IAAKlhJ,KAAKyhJ,IAAK,GACjCQ,EAAajiJ,KAAKmhJ,IAAKnhJ,KAAK0hJ,IAAK,GACjCO,EAAajiJ,KAAKohJ,IAAKphJ,KAAK2hJ,IAAK,IACjCM,EAAajiJ,KAAK0jC,IAAK1jC,KAAK4hJ,IAAK,IACjCK,EAAajiJ,KAAKqhJ,IAAKrhJ,KAAK6hJ,IAAK,IACjCI,EAAajiJ,KAAKshJ,IAAKthJ,KAAK8hJ,IAAK,IACjCG,EAAajiJ,KAAKuhJ,IAAKvhJ,KAAK+hJ,IAAK,IACjCE,EAAajiJ,KAAKwhJ,IAAKxhJ,KAAKgiJ,IAAK,IAE1Br8F,GAGTlnD,EAAOC,QAAUwjJ,uCClQjBzjJ,EAAOC,QAAU,SAAUmhC,EAAQkJ,GACjC,IAAI+uE,EAAS,GACbj4E,EAAO6E,GAAG,QAAQ,SAAUyY,GAC1B26D,EAAO/yG,KAAKo4C,MAEdtd,EAAO2E,KAAK,OAAO,WACbuE,GAAIA,EAAG,KAAM7nC,EAAOqC,OAAOu0G,IAC/B/uE,EAAK,QAEPlJ,EAAO2E,KAAK,SAAS,SAAUz6B,GACzBg/B,GAAIA,EAAGh/B,GACXg/B,EAAK,8CCXTtqC,EAAOC,QAAUqlJ,EAEjB,MAAMxgJ,EAAS,EAAQ,MACjBygJ,EAAqB,EAAQ,MAC7B55C,EAAO,EAAQ,MACfC,EAAQ,EAAQ,MAChB7lE,EAAO,EAAQ,KACfy/G,EAAc,EAAQ,MACtBzvG,EAAM,EAAQ,MAEd0vG,EAAWptI,GAAW,OAANA,GAA2B,iBAANA,GAAoC,mBAAXA,EAAEquD,KAEtE,SAAS4+E,EAAW9kH,EAAM8J,GAIxB,GAHA9J,EAAOz5B,OAAO+iB,OAAO,CAAE47H,aAAc,IAAsB,iBAATllH,EAAoB,CAAEuV,IAAKvV,GAASA,GACtF8J,EAAKvE,EAAKuE,GAEN9J,EAAKuV,IAAK,CACZ,MAAM,SAAE4vG,EAAQ,KAAEj7G,EAAI,SAAEgF,EAAQ,KAAEk2G,EAAI,KAAEt9I,GAASytC,EAAIhW,MAAMS,EAAKuV,YACzDvV,EAAKuV,IACP4vG,GAAaj7G,GAASgF,GAAak2G,EACnC7+I,OAAO+iB,OAAO0W,EAAM,CAAEmlH,SAAAA,EAAUj7G,KAAAA,EAAMgF,SAAAA,EAAUk2G,KAAAA,EAAMt9I,KAAAA,IADbk4B,EAAKl4B,KAAOA,EAI5D,MAAMo6G,EAAU,CAAE,kBAAmB,iBAIrC,IAAIphH,EAHAk/B,EAAKkiF,SAAS37G,OAAOC,KAAKw5B,EAAKkiF,SAASn+G,SAAQgQ,GAAMmuG,EAAQnuG,EAAE60B,eAAiB5I,EAAKkiF,QAAQnuG,KAClGisB,EAAKkiF,QAAUA,EAGXliF,EAAKl/B,KACPA,EAAOk/B,EAAKqlH,OAASJ,EAASjlH,EAAKl/B,MAAQ6I,KAAKC,UAAUo2B,EAAKl/B,MAAQk/B,EAAKl/B,KACnEk/B,EAAKslH,OACdxkJ,EAA4B,iBAAdk/B,EAAKslH,KAAoBtlH,EAAKslH,KAAON,EAAYp7I,UAAUo2B,EAAKslH,MAC9EtlH,EAAKkiF,QAAQ,gBAAkB,qCAG7BphH,IACGk/B,EAAKn6B,SAAQm6B,EAAKn6B,OAAS,QAC3Bo/I,EAASnkJ,KAAOk/B,EAAKkiF,QAAQ,kBAAoBjgH,EAAOa,WAAWhC,IACpEk/B,EAAKqlH,OAASrlH,EAAKslH,OAAMtlH,EAAKkiF,QAAQ,gBAAkB,4BAEvDliF,EAAKl/B,YAAak/B,EAAKslH,KAE1BtlH,EAAKqlH,OAAMrlH,EAAKkiF,QAAQqjC,OAAS,oBACjCvlH,EAAKn6B,SAAQm6B,EAAKn6B,OAASm6B,EAAKn6B,OAAO0I,eAE3C,MAAMi3I,EAAexlH,EAAKmlH,SAEpB51G,GAD6B,WAAlBvP,EAAKkP,SAAwBk8D,EAAQD,GACjC9hE,QAAQrJ,GAAMz8B,IACjC,IAA6B,IAAzBy8B,EAAKylH,iBAA6BliJ,EAAImiJ,YAAc,KAAOniJ,EAAImiJ,WAAa,KAAOniJ,EAAI2+G,QAAQtwE,SAAU,CAC3G5R,EAAKuV,IAAMhyC,EAAI2+G,QAAQtwE,gBAChB5R,EAAKkiF,QAAQyjC,KACpBpiJ,EAAIq6D,SAEJ,MAAMgoF,EAAerwG,EAAIhW,MAAMS,EAAKuV,KAAK4vG,SAYzC,OAVqB,OAAjBS,GAAyBA,IAAiBJ,WACrCxlH,EAAKkiF,QAAQ2jC,cACb7lH,EAAKkiF,QAAQ4jC,eAGF,SAAhB9lH,EAAKn6B,QAAqB,CAAC,IAAK,KAAKyjC,SAAS/lC,EAAImiJ,cACpD1lH,EAAKn6B,OAAS,aACPm6B,EAAKkiF,QAAQ,yBAA0BliF,EAAKkiF,QAAQ,iBAGjC,GAAxBliF,EAAKklH,eAA6Bp7G,EAAG,IAAI9pC,MAAM,uBACvC8kJ,EAAU9kH,EAAM8J,GAG9B,MAAMi8G,EAAyC,mBAAvBhB,GAAqD,SAAhB/kH,EAAKn6B,OAClEikC,EAAG,KAAMi8G,EAAWhB,EAAmBxhJ,GAAOA,MAWhD,OATAgsC,EAAI9J,GAAG,WAAW,KAChB8J,EAAI2pD,QACJpvD,EAAG,IAAI9pC,MAAM,yBAEfuvC,EAAI9J,GAAG,QAASqE,GAEZm7G,EAASnkJ,GAAOA,EAAK2kC,GAAG,QAASqE,GAAIo8B,KAAK32B,GACzCA,EAAI9gC,IAAI3N,GAENyuC,EAGTu1G,EAAUxgJ,OAAS,CAAC07B,EAAM8J,IACjBg7G,EAAU9kH,GAAM,CAACl1B,EAAKvH,KAC3B,GAAIuH,EAAK,OAAOg/B,EAAGh/B,GACnBxG,EAAOf,GAAK,CAACuH,EAAKnJ,KAChB,GAAImJ,EAAK,OAAOg/B,EAAGh/B,GACnB,GAAIk1B,EAAKqlH,KACP,IACE1jJ,EAAOgI,KAAK41B,MAAM59B,EAAKqL,YACvB,MAAOlC,GACP,OAAOg/B,EAAGh/B,EAAKvH,EAAK5B,GAGxBmoC,EAAG,KAAMvmC,EAAK5B,SAKnB,CAAC,MAAO,OAAQ,MAAO,QAAS,OAAQ,UAAUoC,SAAQ8B,IACzDi/I,EAAUj/I,GAAU,CAACm6B,EAAM8J,KACL,iBAAT9J,IAAmBA,EAAO,CAAEuV,IAAKvV,IACrC8kH,EAAUv+I,OAAO+iB,OAAO,CAAEzjB,OAAQA,EAAO0I,eAAiByxB,GAAO8J,qCCxG5E,MAAMtJ,EAAQ,EAAQ,KAAR,CAAiB,eACzBwlH,EAAgB,EAAQ,MACxBvlH,EAAc,EAAQ,MACtBG,EAAS,EAAQ,MACjBkP,EAAiB,EAAQ,MACzBm2G,EAAU,EAAQ,OAClB,OAAEhkJ,GAAW,EAAQ,MAErBikJ,EAAsB,MAK5B,SAASC,EAAeC,GACtB,OAAOA,EAAIz3I,QAAQ,6BAA8B,IAYnD,MAAMkhC,UAAajP,EAAOoB,OACxBh/B,YAAag9B,GAyCX,GApCAmC,MAJAnC,EAAOz5B,OAAO+iB,OAAO,CACnBy/G,eAAe,GACd/oG,IAIHj/B,KAAKslJ,IAAM5lH,EAAY,GAAGzzB,SAAS,OAAOrJ,MAAM,EAAG,GACnD5C,KAAKshC,OAAO,cAAerC,GAE3Bj/B,KAAKulJ,YAActmH,EAAK0W,UACpB1W,EAAKsmH,aAAe7lH,EAAY,IAAIzzB,SAAS,OAC7C,KAEJjM,KAAK21C,UAAY1W,EAAK0W,YAAa,EACnC31C,KAAKwlJ,cAAgBvmH,EAAKumH,eAAiB12G,EAAK02G,cAChDxlJ,KAAKylJ,kBAAoBzlJ,KAAKwlJ,cAAcE,WAC5C1lJ,KAAK+1C,OAASvwC,OAAO+iB,OAAO,GAAIumB,EAAKiH,OAAQ9W,EAAK8W,QAClD/1C,KAAK2lJ,aAAe1mH,EAAK0mH,cAAgB,GACzC3lJ,KAAK4lJ,cAAgB3mH,EAAK2mH,eAAiB,GAC3C5lJ,KAAK6lJ,aAAe5mH,EAAK4mH,cAAgB,CAACR,GAAOA,GACjDrlJ,KAAKumE,QAAUtnC,EAAKsnC,UAAYtnC,EAAKY,OAAS,CAACZ,EAAKY,QAAU,IAC9D7/B,KAAK81C,aAA2B1tC,IAAjB62B,EAAK6W,SAAwB7W,EAAK6W,QACjD91C,KAAK8lJ,sBAA6C19I,IAA1B62B,EAAK6mH,kBAAiC7mH,EAAK6mH,iBACnE9lJ,KAAK+lJ,mBAAqB9mH,EAAK8mH,oBA1CP,IA4CxB/lJ,KAAKmjC,WAAY,EACjBnjC,KAAKgmJ,YAAa,EAClBhmJ,KAAKimJ,YAAa,EAElBjmJ,KAAKkmJ,mBAAgB99I,EACrBpI,KAAKmmJ,kBAAe/9I,EACpBpI,KAAKomJ,gBAAah+I,EAClBpI,KAAKqmJ,kBAAej+I,EACpBpI,KAAKsmJ,iBAAcl+I,EACnBpI,KAAKumJ,eAAYn+I,EAEjBpI,KAAKowC,MAASnR,EAAKoR,MAA6B,iBAAdpR,EAAKoR,KACnCpR,EAAKoR,KACL40G,KAECjlJ,KAAKowC,MACR,KAAsB,oBAAX//B,OACH60I,EAAQ,IAAIjmJ,MAAM,qEAAsE,sBAExFimJ,EAAQ,IAAIjmJ,MAAM,8CAA+C,sBAI3Ee,KAAKwmJ,UAAW,EAChBxmJ,KAAKymJ,eAAgB,EACrBzmJ,KAAK0mJ,cAAe,EACpB1mJ,KAAK2mJ,kBAAoB,KACzB3mJ,KAAK4mJ,SAAW,KAChB5mJ,KAAK6mJ,mBAAqB,GAE1B7mJ,KAAK8mJ,gBAAiB,EACtB9mJ,KAAK+mJ,mBAAoB,EACzB/mJ,KAAKgnJ,qBAAsB,EAC3BhnJ,KAAKinJ,oBAAqB,EAC1BjnJ,KAAKknJ,uBAAyB,GAC9BlnJ,KAAKmnJ,WAAa,IAAI3oJ,IACtBwB,KAAKonJ,iBAAmB,KAExBpnJ,KAAKqnJ,cAAgB,GACrBrnJ,KAAKsnJ,eAAiB,GAEtBtnJ,KAAKunJ,OAAS,KACdvnJ,KAAKq3G,IAAM,KACXr3G,KAAKwnJ,UAAY,KAEjB,IACExnJ,KAAKynJ,IAAM,IAAKznJ,KAAKowC,MAAuB,kBAAEpwC,KAAK+1C,QACnD,MAAOhsC,GAEP,YADA/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,uBAM5B/J,KAAK0nJ,qBAA6D,iBAA/B1nJ,KAAKynJ,IAAIE,kBAE5C3nJ,KAAKynJ,IAAIG,2BAA6B,KACpC5nJ,KAAK6nJ,qBAEP7nJ,KAAKynJ,IAAIK,0BAA4B,KACnC9nJ,KAAK6nJ,qBAEP7nJ,KAAKynJ,IAAIM,wBAA0B,KACjC/nJ,KAAKgoJ,4BAEPhoJ,KAAKynJ,IAAIQ,uBAAyB,KAChCjoJ,KAAKkoJ,2BAEPloJ,KAAKynJ,IAAIU,eAAiBp3G,IACxB/wC,KAAKooJ,gBAAgBr3G,IAIc,iBAA1B/wC,KAAKynJ,IAAIY,cAClBroJ,KAAKynJ,IAAIY,aAAah9H,OAAMthB,IAC1B/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,4BAU1B/J,KAAK21C,WAAa31C,KAAKylJ,kBACzBzlJ,KAAKsoJ,WAAW,CACdC,QAASvoJ,KAAKynJ,IAAIe,kBAAkBxoJ,KAAKulJ,YAAavlJ,KAAKwlJ,iBAG7DxlJ,KAAKynJ,IAAIgB,cAAgB13G,IACvB/wC,KAAKsoJ,WAAWv3G,IAIhB/wC,KAAKumE,SACPvmE,KAAKumE,QAAQvjE,SAAQ68B,IACnB7/B,KAAK0oJ,UAAU7oH,MAGnB7/B,KAAKynJ,IAAIkB,QAAU53G,IACjB/wC,KAAK4oJ,SAAS73G,IAGhB/wC,KAAKshC,OAAO,uBACZthC,KAAK6oJ,oBAEL7oJ,KAAK8oJ,eAAiB,KACpB9oJ,KAAKykC,aAEPzkC,KAAKwkC,KAAK,SAAUxkC,KAAK8oJ,gBAGvBC,iBACF,OAAQ/oJ,KAAK4mJ,UAAY5mJ,KAAK4mJ,SAASoC,gBAAmB,EAKxDv2G,gBACF,OAAQzyC,KAAKimJ,YAA2C,SAA7BjmJ,KAAK4mJ,SAASpwC,WAG3CyyC,UACE,MAAO,CAAE9/G,KAAMnpC,KAAKumJ,UAAW2C,OAAQlpJ,KAAKsmJ,YAAa2C,QAASjpJ,KAAKqmJ,cAGzEhxG,OAAQz0C,GACN,IAAIZ,KAAKgmJ,WAAT,CACA,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,yCAA0C,iBACtF,GAAoB,iBAAT2B,EACT,IACEA,EAAOgI,KAAK41B,MAAM59B,GAClB,MAAOmJ,GACPnJ,EAAO,GAGXZ,KAAKshC,OAAO,YAER1gC,EAAKuoJ,aAAenpJ,KAAK21C,YAC3B31C,KAAKshC,OAAO,8BACZthC,KAAK6oJ,qBAEHjoJ,EAAKwoJ,oBAAsBppJ,KAAK21C,YAClC31C,KAAKshC,OAAO,+BACZthC,KAAKqpJ,eAAezoJ,EAAKwoJ,mBAAmB15F,KAAM9uD,EAAKwoJ,mBAAmBn/F,OAExErpD,EAAK0oJ,YACHtpJ,KAAKynJ,IAAI8B,mBAAqBvpJ,KAAKynJ,IAAI8B,kBAAkBvhJ,KAC3DhI,KAAKwpJ,iBAAiB5oJ,EAAK0oJ,WAE3BtpJ,KAAK6mJ,mBAAmB9hJ,KAAKnE,EAAK0oJ,YAGlC1oJ,EAAKykJ,KACPrlJ,KAAKynJ,IAAIgC,qBAAqB,IAAKzpJ,KAAKowC,MAA2B,sBAAExvC,IAClEwqB,MAAK,KACAprB,KAAKmjC,YAETnjC,KAAK6mJ,mBAAmB7jJ,SAAQsmJ,IAC9BtpJ,KAAKwpJ,iBAAiBF,MAExBtpJ,KAAK6mJ,mBAAqB,GAEc,UAApC7mJ,KAAKynJ,IAAI8B,kBAAkBvhJ,MAAkBhI,KAAK0pJ,oBAEvDr+H,OAAMthB,IACL/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,kCAG3BnJ,EAAKykJ,KAAQzkJ,EAAK0oJ,WAAc1oJ,EAAKuoJ,aAAgBvoJ,EAAKwoJ,oBAC7DppJ,KAAKwlC,QAAQ0/G,EAAQ,IAAIjmJ,MAAM,4CAA6C,mBAIhFuqJ,iBAAkBF,GAChB,MAAMK,EAAkB,IAAI3pJ,KAAKowC,MAAM6tD,gBAAgBqrD,GACvDtpJ,KAAKynJ,IAAImC,gBAAgBD,GACtBt+H,OAAMthB,KACA4/I,EAAgBV,SAAWU,EAAgBV,QAAQ95H,SAAS,WAC1D,sCAvNbpF,EAAQH,KAuNK,wCAEL5pB,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,6BASlC0rC,KAAM0H,GACJ,IAAIn9C,KAAKgmJ,WAAT,CACA,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,uCAAwC,iBACpFe,KAAK4mJ,SAASnxG,KAAK0H,IAQrBksG,eAAgB35F,EAAMzF,GACpB,IAAIjqD,KAAKgmJ,WAAT,CACA,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,iDAAkD,iBAG9F,GAFAe,KAAKshC,OAAO,oBAERthC,KAAK21C,UACP,IACE31C,KAAKynJ,IAAI4B,eAAe35F,EAAMzF,GAC9BjqD,KAAK6oJ,oBACL,MAAO9+I,GACP/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,6BAG5B/J,KAAKylC,KAAK,SAAU,CAClBz9B,KAAM,qBACNohJ,mBAAoB,CAAE15F,KAAAA,EAAMzF,KAAAA,MASlCy+F,UAAW7oH,GACT,IAAI7/B,KAAKgmJ,WAAT,CACA,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,4CAA6C,iBACzFe,KAAKshC,OAAO,eAEZzB,EAAOgqH,YAAY7mJ,SAAQ8D,IACzB9G,KAAK8pJ,SAAShjJ,EAAO+4B,OASzBiqH,SAAUhjJ,EAAO+4B,GACf,GAAI7/B,KAAKgmJ,WAAY,OACrB,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,2CAA4C,iBACxFe,KAAKshC,OAAO,cAEZ,MAAMyoH,EAAS/pJ,KAAKmnJ,WAAW/nJ,IAAI0H,IAAU,IAAItI,IACjD,IAAIwrJ,EAASD,EAAO3qJ,IAAIygC,GACxB,GAAKmqH,EAKE,MAAIA,EAAOn4C,QACVqzC,EAAQ,IAAIjmJ,MAAM,qFAAsF,sBAExGimJ,EAAQ,IAAIjmJ,MAAM,gDAAiD,4BAPzE+qJ,EAAShqJ,KAAKynJ,IAAIqC,SAAShjJ,EAAO+4B,GAClCkqH,EAAO7qJ,IAAI2gC,EAAQmqH,GACnBhqJ,KAAKmnJ,WAAWjoJ,IAAI4H,EAAOijJ,GAC3B/pJ,KAAK6oJ,oBAcToB,aAAcC,EAAUC,EAAUtqH,GAChC,GAAI7/B,KAAKgmJ,WAAY,OACrB,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,+CAAgD,iBAC5Fe,KAAKshC,OAAO,kBAEZ,MAAMyoH,EAAS/pJ,KAAKmnJ,WAAW/nJ,IAAI8qJ,GAC7BF,EAASD,EAASA,EAAO3qJ,IAAIygC,GAAU,KAC7C,IAAKmqH,EACH,MAAM9E,EAAQ,IAAIjmJ,MAAM,8CAA+C,uBAErEkrJ,GAAUnqJ,KAAKmnJ,WAAWjoJ,IAAIirJ,EAAUJ,GAEjB,MAAvBC,EAAOC,aACTD,EAAOC,aAAaE,GAEpBnqJ,KAAKwlC,QAAQ0/G,EAAQ,IAAIjmJ,MAAM,iDAAkD,iCASrFmrJ,YAAatjJ,EAAO+4B,GAClB,GAAI7/B,KAAKgmJ,WAAY,OACrB,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,8CAA+C,iBAC3Fe,KAAKshC,OAAO,kBAEZ,MAAMyoH,EAAS/pJ,KAAKmnJ,WAAW/nJ,IAAI0H,GAC7BkjJ,EAASD,EAASA,EAAO3qJ,IAAIygC,GAAU,KAC7C,IAAKmqH,EACH,MAAM9E,EAAQ,IAAIjmJ,MAAM,6CAA8C,uBAExE,IACE+qJ,EAAOn4C,SAAU,EACjB7xG,KAAKynJ,IAAI2C,YAAYJ,GACrB,MAAOjgJ,GACU,wBAAbA,EAAIjK,KACNE,KAAKknJ,uBAAuBniJ,KAAKilJ,GAEjChqJ,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,qBAG9B/J,KAAK6oJ,oBAOPwB,aAAcxqH,GACZ,IAAI7/B,KAAKgmJ,WAAT,CACA,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,+CAAgD,iBAC5Fe,KAAKshC,OAAO,mBAEZzB,EAAOgqH,YAAY7mJ,SAAQ8D,IACzB9G,KAAKoqJ,YAAYtjJ,EAAO+4B,OAI5BgpH,oBACE7oJ,KAAKshC,OAAO,qBACRthC,KAAKgnJ,sBACThnJ,KAAKgnJ,qBAAsB,EAC3Bj4G,GAAe,KACb/uC,KAAKgnJ,qBAAsB,EACvBhnJ,KAAK21C,YAAc31C,KAAK+mJ,mBAC1B/mJ,KAAKshC,OAAO,gCACZthC,KAAKsqJ,aAELtqJ,KAAKshC,OAAO,uDAEdthC,KAAK+mJ,mBAAoB,MAI7BuD,YACE,IAAItqJ,KAAKgmJ,WAAT,CACA,GAAIhmJ,KAAKmjC,UAAW,MAAM+hH,EAAQ,IAAIjmJ,MAAM,4CAA6C,iBAErFe,KAAK21C,UACH31C,KAAK8mJ,gBACP9mJ,KAAKinJ,oBAAqB,EAC1BjnJ,KAAKshC,OAAO,mCAEZthC,KAAKshC,OAAO,qBACZ6D,YAAW,KACTnlC,KAAKuqJ,iBACJ,IAGDvqJ,KAAK8mJ,gBACP9mJ,KAAKinJ,oBAAqB,EAC1BjnJ,KAAKshC,OAAO,mCAEZthC,KAAKshC,OAAO,yCACZthC,KAAKylC,KAAK,SAAU,CAClBz9B,KAAM,cACNmhJ,aAAa,KAInBnpJ,KAAK8mJ,gBAAiB,GAMxBthH,QAASz7B,GACP/J,KAAKykH,SAAS16G,GAAK,SAGrB06G,SAAU16G,EAAKg/B,GACT/oC,KAAKmjC,WAAanjC,KAAKgmJ,aAC3BhmJ,KAAKgmJ,YAAa,EAElBhmJ,KAAKshC,OAAO,yBAA0Bv3B,IAAQA,EAAIG,SAAWH,IAE7DglC,GAAe,KA6Bb,GA5BA/uC,KAAKmjC,WAAY,EACjBnjC,KAAKgmJ,YAAa,EAElBhmJ,KAAKshC,OAAO,sBAAuBv3B,IAAQA,EAAIG,SAAWH,IAE1D/J,KAAKilE,SAAWjlE,KAAKytB,UAAW,EAE3BztB,KAAKw3F,eAAe3nC,OAAO7vD,KAAK+E,KAAK,MACrC/E,KAAK4vD,eAAe67E,UAAUzrI,KAAK0N,MAExC1N,KAAKimJ,YAAa,EAClBjmJ,KAAKwmJ,UAAW,EAChBxmJ,KAAKymJ,eAAgB,EACrBzmJ,KAAKqnJ,cAAgB,KACrBrnJ,KAAKsnJ,eAAiB,KACtBtnJ,KAAKmnJ,WAAa,KAElBniH,cAAchlC,KAAKonJ,kBACnBpnJ,KAAKonJ,iBAAmB,KAExBpiH,cAAchlC,KAAKwnJ,WACnBxnJ,KAAKwnJ,UAAY,KACjBxnJ,KAAKunJ,OAAS,KACdvnJ,KAAKq3G,IAAM,KAEPr3G,KAAK8oJ,gBAAgB9oJ,KAAKqzC,eAAe,SAAUrzC,KAAK8oJ,gBAC5D9oJ,KAAK8oJ,eAAiB,KAElB9oJ,KAAK4mJ,SAAU,CACjB,IACE5mJ,KAAK4mJ,SAASh/F,QACd,MAAO79C,IAGT/J,KAAK4mJ,SAAS/L,UAAY,KAC1B76I,KAAK4mJ,SAAS4D,OAAS,KACvBxqJ,KAAK4mJ,SAAS7uD,QAAU,KACxB/3F,KAAK4mJ,SAAS58F,QAAU,KAE1B,GAAIhqD,KAAKynJ,IAAK,CACZ,IACEznJ,KAAKynJ,IAAI7/F,QACT,MAAO79C,IAGT/J,KAAKynJ,IAAIG,2BAA6B,KACtC5nJ,KAAKynJ,IAAIK,0BAA4B,KACrC9nJ,KAAKynJ,IAAIQ,uBAAyB,KAClCjoJ,KAAKynJ,IAAIU,eAAiB,KAC1BnoJ,KAAKynJ,IAAIkB,QAAU,KACnB3oJ,KAAKynJ,IAAIgB,cAAgB,KAE3BzoJ,KAAKynJ,IAAM,KACXznJ,KAAK4mJ,SAAW,KAEZ78I,GAAK/J,KAAKylC,KAAK,QAAS17B,GAC5B/J,KAAKylC,KAAK,SACVsD,QAIJu/G,WAAYv3G,GACV,IAAKA,EAAMw3G,QAIT,OAAOvoJ,KAAKwlC,QAAQ0/G,EAAQ,IAAIjmJ,MAAM,oDAAqD,qBAG7Fe,KAAK4mJ,SAAW71G,EAAMw3G,QACtBvoJ,KAAK4mJ,SAAS6D,WAAa,cAE6B,iBAA7CzqJ,KAAK4mJ,SAAS8D,6BACvB1qJ,KAAK4mJ,SAAS8D,2BAA6BvF,GAG7CnlJ,KAAKulJ,YAAcvlJ,KAAK4mJ,SAASr5I,MAEjCvN,KAAK4mJ,SAAS/L,UAAY9pG,IACxB/wC,KAAK2qJ,kBAAkB55G,IAEzB/wC,KAAK4mJ,SAASgE,oBAAsB,KAClC5qJ,KAAK6qJ,+BAEP7qJ,KAAK4mJ,SAAS4D,OAAS,KACrBxqJ,KAAK8qJ,kBAEP9qJ,KAAK4mJ,SAAS7uD,QAAU,KACtB/3F,KAAK+qJ,mBAEP/qJ,KAAK4mJ,SAAS58F,QAAUjZ,IACtB,MAAMhnC,EAAMgnC,EAAMxvC,iBAAiBtC,MAC/B8xC,EAAMxvC,MACN,IAAItC,MAAM,sBAAsB8xC,EAAM7mC,WAAW6mC,EAAMu0B,YAAYv0B,EAAMi6G,UAAUj6G,EAAMk6G,SAC7FjrJ,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,sBAK5B,IAAImhJ,GAAY,EAChBlrJ,KAAKonJ,iBAAmBniH,aAAY,KAC9BjlC,KAAK4mJ,UAAyC,YAA7B5mJ,KAAK4mJ,SAASpwC,YAC7B00C,GAAWlrJ,KAAK+qJ,kBACpBG,GAAY,GAEZA,GAAY,IAthBY,KA2hB9BjhH,SAEAuC,OAAQ2Q,EAAOnhB,EAAU+M,GACvB,GAAI/oC,KAAKmjC,UAAW,OAAO4F,EAAGm8G,EAAQ,IAAIjmJ,MAAM,wCAAyC,qBAEzF,GAAIe,KAAKimJ,WAAY,CACnB,IACEjmJ,KAAKy1C,KAAK0H,GACV,MAAOpzC,GACP,OAAO/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,qBAE/B/J,KAAK4mJ,SAASoC,eAAiB7D,GACjCnlJ,KAAKshC,OAAO,wCAAyCthC,KAAK4mJ,SAASoC,gBACnEhpJ,KAAKq3G,IAAMtuE,GAEXA,EAAG,WAGL/oC,KAAKshC,OAAO,wBACZthC,KAAKunJ,OAASpqG,EACdn9C,KAAKq3G,IAAMtuE,EAMftE,YACE,GAAIzkC,KAAKmjC,UAAW,OAIpB,MAAMgoH,EAAc,KAClBhmH,YAAW,IAAMnlC,KAAKwlC,WAAW,MAG/BxlC,KAAKimJ,WACPkF,IAEAnrJ,KAAKwkC,KAAK,UAAW2mH,GAIzBC,2BACMprJ,KAAKmjC,WACLnjC,KAAK2mJ,oBACT3mJ,KAAKshC,OAAO,+BACZthC,KAAK2mJ,kBAAoBxhH,YAAW,KAC7BnlC,KAAK0mJ,eACR1mJ,KAAK0mJ,cAAe,EACpB1mJ,KAAKshC,OAAO,iCACZthC,KAAKylC,KAAK,cACVzlC,KAAKylC,KAAK,mBAEXzlC,KAAK+lJ,qBAGVwE,eACMvqJ,KAAKmjC,WAETnjC,KAAKynJ,IAAI4D,YAAYrrJ,KAAK2lJ,cACvBv6H,MAAK4pB,IACJ,GAAIh1C,KAAKmjC,UAAW,OACfnjC,KAAK81C,SAAY91C,KAAK8lJ,mBAAkB9wG,EAAMqwG,IAAMD,EAAcpwG,EAAMqwG,MAC7ErwG,EAAMqwG,IAAMrlJ,KAAK6lJ,aAAa7wG,EAAMqwG,KAEpC,MAAMiG,EAAY,KAChB,GAAItrJ,KAAKmjC,UAAW,OACpB,MAAMkS,EAASr1C,KAAKynJ,IAAI8D,kBAAoBv2G,EAC5Ch1C,KAAKshC,OAAO,UACZthC,KAAKylC,KAAK,SAAU,CAClBz9B,KAAMqtC,EAAOrtC,KACbq9I,IAAKhwG,EAAOgwG,OAehBrlJ,KAAKynJ,IAAI+D,oBAAoBx2G,GAC1B5pB,MAZe,KAChBprB,KAAKshC,OAAO,uBACRthC,KAAKmjC,YACLnjC,KAAK81C,SAAW91C,KAAK0mJ,aAAc4E,IAClCtrJ,KAAKwkC,KAAK,eAAgB8mH,OAS9BjgI,OANathB,IACd/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,oCAO7BshB,OAAMthB,IACL/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,wBAIhC0hJ,8BACMzrJ,KAAKynJ,IAAIiE,iBACX1rJ,KAAKynJ,IAAIiE,kBAAkB1oJ,SAAQ2oJ,IAC5BA,EAAY90I,MAAO80I,EAAY3B,OAAOljJ,OAAU6kJ,EAAYC,YAC/DD,EAAYC,WAAY,EACxB5rJ,KAAKqpJ,eAAesC,EAAY3B,OAAOljJ,MAAM4oD,UAMrDg6F,gBACM1pJ,KAAKmjC,WAETnjC,KAAKynJ,IAAIoE,aAAa7rJ,KAAK4lJ,eACxBx6H,MAAK8pB,IACJ,GAAIl1C,KAAKmjC,UAAW,OACfnjC,KAAK81C,SAAY91C,KAAK8lJ,mBAAkB5wG,EAAOmwG,IAAMD,EAAclwG,EAAOmwG,MAC/EnwG,EAAOmwG,IAAMrlJ,KAAK6lJ,aAAa3wG,EAAOmwG,KAEtC,MAAMyG,EAAa,KACjB,GAAI9rJ,KAAKmjC,UAAW,OACpB,MAAMkS,EAASr1C,KAAKynJ,IAAI8D,kBAAoBr2G,EAC5Cl1C,KAAKshC,OAAO,UACZthC,KAAKylC,KAAK,SAAU,CAClBz9B,KAAMqtC,EAAOrtC,KACbq9I,IAAKhwG,EAAOgwG,MAETrlJ,KAAK21C,WAAW31C,KAAKyrJ,+BAa5BzrJ,KAAKynJ,IAAI+D,oBAAoBt2G,GAC1B9pB,MAXe,KACZprB,KAAKmjC,YACLnjC,KAAK81C,SAAW91C,KAAK0mJ,aAAcoF,IAClC9rJ,KAAKwkC,KAAK,eAAgBsnH,OAS9BzgI,OANathB,IACd/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,oCAO7BshB,OAAMthB,IACL/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,yBAIhCi+I,2BACMhoJ,KAAKmjC,WACwB,WAA7BnjC,KAAKynJ,IAAIsE,iBACX/rJ,KAAKwlC,QAAQ0/G,EAAQ,IAAIjmJ,MAAM,sBAAuB,2BAI1D4oJ,oBACE,GAAI7nJ,KAAKmjC,UAAW,OACpB,MAAM6oH,EAAqBhsJ,KAAKynJ,IAAIuE,mBAC9BC,EAAoBjsJ,KAAKynJ,IAAIwE,kBAEnCjsJ,KAAKshC,OACH,kDACA0qH,EACAC,GAEFjsJ,KAAKylC,KAAK,iBAAkBumH,EAAoBC,GAErB,cAAvBD,GAA6D,cAAvBA,IACxChsJ,KAAKwmJ,UAAW,EAChBxmJ,KAAKksJ,eAEoB,WAAvBF,GACFhsJ,KAAKwlC,QAAQ0/G,EAAQ,IAAIjmJ,MAAM,0BAA2B,+BAEjC,WAAvB+sJ,GACFhsJ,KAAKwlC,QAAQ0/G,EAAQ,IAAIjmJ,MAAM,0BAA2B,8BAI9DktJ,SAAUpjH,GAER,MAAMqjH,EAAgBC,IACkC,mBAAlD7mJ,OAAOvF,UAAUgM,SAAS1L,KAAK8rJ,EAAOlgJ,SACxCkgJ,EAAOlgJ,OAAOnJ,SAAQvB,IACpB+D,OAAO+iB,OAAO8jI,EAAQ5qJ,MAGnB4qJ,GAIwB,IAA7BrsJ,KAAKynJ,IAAI0E,SAAS7qJ,QAAgBtB,KAAK0nJ,qBACzC1nJ,KAAKynJ,IAAI0E,WACN/gI,MAAK5oB,IACJ,MAAM8pJ,EAAU,GAChB9pJ,EAAIQ,SAAQqpJ,IACVC,EAAQvnJ,KAAKqnJ,EAAcC,OAE7BtjH,EAAG,KAAMujH,MACRviJ,GAAOg/B,EAAGh/B,KAGN/J,KAAKynJ,IAAI0E,SAAS7qJ,OAAS,EACpCtB,KAAKynJ,IAAI0E,UAAS3pJ,IAEhB,GAAIxC,KAAKmjC,UAAW,OAEpB,MAAMmpH,EAAU,GAChB9pJ,EAAI0D,SAASlD,SAAQkD,IACnB,MAAMmmJ,EAAS,GACfnmJ,EAAOolE,QAAQtoE,SAAQlD,IACrBusJ,EAAOvsJ,GAAQoG,EAAOqmJ,KAAKzsJ,MAE7BusJ,EAAO/9I,GAAKpI,EAAOoI,GACnB+9I,EAAOrkJ,KAAO9B,EAAO8B,KACrBqkJ,EAAOG,UAAYtmJ,EAAOsmJ,UAC1BF,EAAQvnJ,KAAKqnJ,EAAcC,OAE7BtjH,EAAG,KAAMujH,MACRviJ,GAAOg/B,EAAGh/B,KAKbg/B,EAAG,KAAM,IAIbmjH,cAEE,GADAlsJ,KAAKshC,OAAO,8BAA+BthC,KAAKwmJ,SAAUxmJ,KAAKymJ,eAC3DzmJ,KAAKimJ,YAAcjmJ,KAAKysJ,cAAgBzsJ,KAAKwmJ,WAAaxmJ,KAAKymJ,cAAe,OAElFzmJ,KAAKysJ,aAAc,EAGnB,MAAMC,EAAoB,KACpB1sJ,KAAKmjC,WAETnjC,KAAKmsJ,UAAS,CAACpiJ,EAAK4iJ,KAClB,GAAI3sJ,KAAKmjC,UAAW,OAGhBp5B,IAAK4iJ,EAAQ,IAEjB,MAAMC,EAAmB,GACnBC,EAAkB,GAClBC,EAAiB,GACvB,IAAIC,GAA6B,EAEjCJ,EAAM3pJ,SAAQnB,IAGM,oBAAdA,EAAKmG,MAA4C,qBAAdnG,EAAKmG,OAC1C4kJ,EAAiB/qJ,EAAKyM,IAAMzM,GAEZ,mBAAdA,EAAKmG,MAA2C,oBAAdnG,EAAKmG,OACzC6kJ,EAAgBhrJ,EAAKyM,IAAMzM,GAEX,kBAAdA,EAAKmG,MAA0C,mBAAdnG,EAAKmG,OACxC8kJ,EAAejrJ,EAAKyM,IAAMzM,MAI9B,MAAMmrJ,EAA2BC,IAC/BF,GAA6B,EAE7B,IAAIG,EAAQL,EAAgBI,EAAsBE,kBAE9CD,IAAUA,EAAMz/E,IAAMy/E,EAAMjE,UAE9BjpJ,KAAKqmJ,aAAe6G,EAAMz/E,IAAMy/E,EAAMjE,QACtCjpJ,KAAKumJ,UAAYpnJ,OAAO+tJ,EAAM/jH,OACrB+jH,GAASA,EAAME,WAExBptJ,KAAKqmJ,aAAe6G,EAAME,UAC1BptJ,KAAKumJ,UAAYpnJ,OAAO+tJ,EAAMG,aAC6B,iBAA3CJ,EAAsBK,mBAEtCJ,EAAQD,EAAsBK,iBAAiBhgJ,MAAM,KACrDtN,KAAKqmJ,aAAe6G,EAAM,GAC1BltJ,KAAKumJ,UAAYpnJ,OAAO+tJ,EAAM,KAE5BltJ,KAAKqmJ,eACPrmJ,KAAKsmJ,YAActmJ,KAAKqmJ,aAAa99G,SAAS,KAAO,OAAS,QAGhE,IAAIw2F,EAAS6tB,EAAiBK,EAAsBM,mBAEhDxuB,IAAWA,EAAOtxD,IAAMsxD,EAAOkqB,UAEjCjpJ,KAAKkmJ,cAAgBnnB,EAAOtxD,IAAMsxD,EAAOkqB,QACzCjpJ,KAAKomJ,WAAajnJ,OAAO4/H,EAAO51F,OACvB41F,GAAUA,EAAOquB,WAE1BptJ,KAAKkmJ,cAAgBnnB,EAAOquB,UAC5BptJ,KAAKomJ,WAAajnJ,OAAO4/H,EAAOsuB,aAC4B,iBAA5CJ,EAAsBO,oBAEtCzuB,EAASkuB,EAAsBO,kBAAkBlgJ,MAAM,KACvDtN,KAAKkmJ,cAAgBnnB,EAAO,GAC5B/+H,KAAKomJ,WAAajnJ,OAAO4/H,EAAO,KAE9B/+H,KAAKkmJ,gBACPlmJ,KAAKmmJ,aAAenmJ,KAAKkmJ,cAAc39G,SAAS,KAAO,OAAS,QAGlEvoC,KAAKshC,OACH,qCACAthC,KAAKqmJ,aACLrmJ,KAAKumJ,UACLvmJ,KAAKkmJ,cACLlmJ,KAAKomJ,aAqBT,GAjBAuG,EAAM3pJ,SAAQnB,IAEM,cAAdA,EAAKmG,MAAwBnG,EAAK4rJ,yBACpCT,EAAyBF,EAAejrJ,EAAK4rJ,2BAK9B,sBAAd5rJ,EAAKmG,MAA8D,SAA9BnG,EAAK6rJ,uBAC3B,kBAAd7rJ,EAAKmG,MAA0C,mBAAdnG,EAAKmG,OAA8BnG,EAAK8rJ,WAE3EX,EAAyBnrJ,MAMxBkrJ,GAAgCvnJ,OAAOC,KAAKqnJ,GAAgBxrJ,SAAUkE,OAAOC,KAAKonJ,GAAiBvrJ,OAAxG,CAQA,GAJEtB,KAAKysJ,aAAc,EACnBzsJ,KAAKimJ,YAAa,EAGhBjmJ,KAAKunJ,OAAQ,CACf,IACEvnJ,KAAKy1C,KAAKz1C,KAAKunJ,QACf,MAAOx9I,GACP,OAAO/J,KAAKwlC,QAAQ0/G,EAAQn7I,EAAK,qBAEnC/J,KAAKunJ,OAAS,KACdvnJ,KAAKshC,OAAO,0CAEZ,MAAMyH,EAAK/oC,KAAKq3G,IAChBr3G,KAAKq3G,IAAM,KACXtuE,EAAG,MAKmD,iBAA7C/oC,KAAK4mJ,SAAS8D,6BACvB1qJ,KAAKwnJ,UAAYviH,aAAY,IAAMjlC,KAAK4tJ,eAAe,KACnD5tJ,KAAKwnJ,UAAUniH,OAAOrlC,KAAKwnJ,UAAUniH,SAG3CrlC,KAAKshC,OAAO,WACZthC,KAAKylC,KAAK,gBA7BRN,WAAWunH,EAAmB,SAgCpCA,IAGFkB,eACO5tJ,KAAKq3G,MAAQr3G,KAAK4mJ,UAAY5mJ,KAAK4mJ,SAASoC,eAAiB7D,GAGlEnlJ,KAAK6qJ,8BAGP3C,0BACMloJ,KAAKmjC,YAEuB,WAA5BnjC,KAAKynJ,IAAIoG,iBACX7tJ,KAAK8mJ,gBAAiB,EAGtB9mJ,KAAKshC,OAAO,wBAAyBthC,KAAKknJ,wBAC1ClnJ,KAAKknJ,uBAAuBlkJ,SAAQgnJ,IAClChqJ,KAAKynJ,IAAI2C,YAAYJ,GACrBhqJ,KAAKinJ,oBAAqB,KAE5BjnJ,KAAKknJ,uBAAyB,GAE1BlnJ,KAAKinJ,oBACPjnJ,KAAKshC,OAAO,8BACZthC,KAAKinJ,oBAAqB,EAC1BjnJ,KAAK6oJ,sBAEL7oJ,KAAKshC,OAAO,cACZthC,KAAKylC,KAAK,gBAIdzlC,KAAKshC,OAAO,0BAA2BthC,KAAKynJ,IAAIoG,gBAChD7tJ,KAAKylC,KAAK,uBAAwBzlC,KAAKynJ,IAAIoG,iBAG7CzF,gBAAiBr3G,GACX/wC,KAAKmjC,YACL4N,EAAMu4G,WAAatpJ,KAAK81C,QAC1B91C,KAAKylC,KAAK,SAAU,CAClBz9B,KAAM,YACNshJ,UAAW,CACTA,UAAWv4G,EAAMu4G,UAAUA,UAC3BwE,cAAe/8G,EAAMu4G,UAAUwE,cAC/BC,OAAQh9G,EAAMu4G,UAAUyE,UAGlBh9G,EAAMu4G,WAActpJ,KAAK0mJ,eACnC1mJ,KAAK0mJ,cAAe,EACpB1mJ,KAAKylC,KAAK,iBAGRsL,EAAMu4G,WACRtpJ,KAAKorJ,4BAITT,kBAAmB55G,GACjB,GAAI/wC,KAAKmjC,UAAW,OACpB,IAAIviC,EAAOmwC,EAAMnwC,KACbA,aAAgBo9B,cAAap9B,EAAOM,EAAO2M,KAAKjN,IACpDZ,KAAK+E,KAAKnE,GAGZiqJ,8BACE,GAAI7qJ,KAAKmjC,YAAcnjC,KAAKq3G,IAAK,OACjCr3G,KAAKshC,OAAO,yCAA0CthC,KAAK4mJ,SAASoC,gBACpE,MAAMjgH,EAAK/oC,KAAKq3G,IAChBr3G,KAAKq3G,IAAM,KACXtuE,EAAG,MAGL+hH,iBACM9qJ,KAAKimJ,YAAcjmJ,KAAKmjC,YAC5BnjC,KAAKshC,OAAO,mBACZthC,KAAKymJ,eAAgB,EACrBzmJ,KAAKksJ,eAGPnB,kBACM/qJ,KAAKmjC,YACTnjC,KAAKshC,OAAO,oBACZthC,KAAKwlC,WAGPojH,SAAU73G,GACJ/wC,KAAKmjC,WAET4N,EAAMw1B,QAAQvjE,SAAQgrJ,IACpBhuJ,KAAKshC,OAAO,YACZthC,KAAKylC,KAAK,QAASsL,EAAMjqC,MAAOknJ,GAEhChuJ,KAAKqnJ,cAActiJ,KAAK,CACtB+B,MAAOiqC,EAAMjqC,MACb+4B,OAAQmuH,IAGNhuJ,KAAKsnJ,eAAex/I,MAAKmmJ,GACpBA,EAAa3/I,KAAO0/I,EAAY1/I,OAGzCtO,KAAKsnJ,eAAeviJ,KAAKipJ,GACzBj/G,GAAe,KACb/uC,KAAKshC,OAAO,aACZthC,KAAKylC,KAAK,SAAUuoH,UAK1B1sH,SACE,MAAMz9B,EAAO,GAAGjB,MAAMrC,KAAK0E,WAC3BpB,EAAK,GAAK,IAAM7D,KAAKslJ,IAAM,KAAOzhJ,EAAK,GACvC47B,EAAMz6B,MAAM,KAAMnB,IAItBirC,EAAK0B,iBAAmBy0G,IAOxBn2G,EAAKiH,OAAS,CACZm4G,WAAY,CACV,CACEzvB,KAAM,CACJ,+BACA,sCAIN0vB,aAAc,gBAGhBr/G,EAAK02G,cAAgB,GAErB/mJ,EAAOC,QAAUowC,kBCzhCjB,MAAMipG,EAAQ,EAAQ,MAChBqW,EAAkB,EAAQ,MAE1BC,EAAQ,IAAItW,EACZuW,EAA0B,oBAAXj+I,OAAyBA,OAASsC,KACjD6sB,EAAS8uH,EAAM9uH,QAAU8uH,EAAM31G,UAAY,GACjD,IAAIipF,EAASpiG,EAAOoiG,QAAUpiG,EAAO+uH,aAErC,SAASC,EAAUxjJ,GACjB,OAAOqjJ,EAAMpqG,OAAOj5C,GAKtB,IACE42H,EAAO39E,OAAO,CAAEnkD,KAAM,SAAW,IAAI63B,YAActM,OAAM,WACvDu2G,GAAS,KAEX,MAAO73H,GAAO63H,GAAS,EAsDzBnjI,EAAOC,QApDP,SAAesM,EAAK+9B,GACb64F,GAiBc,iBAAR52H,IACTA,EAaJ,SAAqBmS,GACnB,MAAMV,EAAIU,EAAE7b,OACN+zB,EAAQ,IAAIsC,WAAWlb,GAC7B,IAAK,IAAIpR,EAAI,EAAGA,EAAIoR,EAAGpR,IACrBgqB,EAAMhqB,GAAK8R,EAAE9O,WAAWhD,GAE1B,OAAOgqB,EAnBCo5H,CAAWzjJ,IAGnB42H,EAAO39E,OAAO,CAAEnkD,KAAM,SAAWkL,GAC9BogB,MAAK,SAAkBllB,GACtB6iC,EAiBN,SAAc/9B,GACZ,MAAMyR,EAAIzR,EAAI1J,OACRotJ,EAAQ,GACd,IAAK,IAAIrjJ,EAAI,EAAGA,EAAIoR,EAAGpR,IAAK,CAC1B,MAAMsjJ,EAAO3jJ,EAAIK,GACjBqjJ,EAAM3pJ,MAAM4pJ,IAAS,GAAG1iJ,SAAS,KACjCyiJ,EAAM3pJ,MAAa,GAAP4pJ,GAAa1iJ,SAAS,KAEpC,OAAOyiJ,EAAM7rJ,KAAK,IAzBXqtE,CAAI,IAAIv4C,WAAWzxB,QAExB,WAEE6iC,EAAGylH,EAASxjJ,QA1BQ,oBAAXqF,OACT+9I,EAAgBpjJ,GAAK,SAA4BjB,EAAK25C,GAGlD3a,EAFEh/B,EAECykJ,EAASxjJ,GAIX04C,MAGL3U,gBAAe,IAAMhG,EAAGylH,EAASxjJ,OAwCvCvM,EAAOC,QAAQqoC,KAAOynH,kBC3EtB,MAAMzW,EAAQ,EAAQ,MAEtB,IAAIqD,EACAwT,EACAC,EA4BJpwJ,EAAOC,QARP,SAAesM,EAAK+9B,GACbqyG,IAlBLA,EAASrD,EAAMoD,eACfyT,EAAa,EACbC,EAAM,GAENzT,EAAOP,UAAY,SAAyBn0I,GAC1C,MAAMooJ,EAASpoJ,EAAE9F,KAAK0N,GAChBy6B,EAAK8lH,EAAIC,UACRD,EAAIC,GAES,MAAhBpoJ,EAAE9F,KAAKW,MACTwnC,EAAG,IAAI9pC,MAAM,uBAAyByH,EAAE9F,KAAKW,QAE7CwnC,EAAG,KAAMriC,EAAE9F,KAAK8iD,QAQpBmrG,EAAID,GAAc7lH,EAClBqyG,EAAON,YAAY,CAAExsI,GAAIsgJ,EAAYhuJ,KAAMoK,IAC3C4jJ,GAAc,uCC1BhB,MAAMnvH,EAAQ,EAAQ,KAAR,CAAiB,oBACzBC,EAAc,EAAQ,MACtBG,EAAS,EAAQ,MACjBkP,EAAiB,EAAQ,MACzB3wB,EAAK,EAAQ,MAEb2wI,EAA2B,mBAAP3wI,EAAoB4wI,UAAY5wI,EAU1D,MAAM2zB,UAAelS,EAAOoB,OAC1Bh/B,YAAag9B,EAAO,IAYlB,GAVoB,iBAATA,IACTA,EAAO,CAAEuV,IAAKvV,IAOhBmC,MAJAnC,EAAOz5B,OAAO+iB,OAAO,CACnBy/G,eAAe,GACd/oG,IAIa,MAAZA,EAAKuV,KAA8B,MAAfvV,EAAKmT,OAC3B,MAAM,IAAInzC,MAAM,6CAElB,GAAgB,MAAZggC,EAAKuV,KAA8B,MAAfvV,EAAKmT,OAC3B,MAAM,IAAInzC,MAAM,0DAalB,GAVAe,KAAKslJ,IAAM5lH,EAAY,GAAGzzB,SAAS,OAAOrJ,MAAM,EAAG,GACnD5C,KAAKshC,OAAO,oBAAqBrC,GAEjCj/B,KAAKyyC,WAAY,EACjBzyC,KAAKmjC,WAAY,EAEjBnjC,KAAKunJ,OAAS,KACdvnJ,KAAKq3G,IAAM,KACXr3G,KAAKwnJ,UAAY,KAEbvoH,EAAKmT,OACPpyC,KAAKw0C,IAAMvV,EAAKmT,OAAOoC,IACvBx0C,KAAKivJ,IAAMhwH,EAAKmT,OAChBpyC,KAAKyyC,UAAYxT,EAAKmT,OAAOokE,aAAeu4C,EAAWG,SAClD,CACLlvJ,KAAKw0C,IAAMvV,EAAKuV,IAChB,IAGIx0C,KAAKivJ,IAFW,mBAAP7wI,EAEE,IAAI2wI,EAAW9vH,EAAKuV,IAAK,KAAM,IACrCvV,EACHjD,cAAU5zB,IAGD,IAAI2mJ,EAAW9vH,EAAKuV,KAEjC,MAAOzqC,GAEP,YADAglC,GAAe,IAAM/uC,KAAKwlC,QAAQz7B,MAKtC/J,KAAKivJ,IAAIxE,WAAa,cAElBxrH,EAAKmT,QAAUpyC,KAAKyyC,UACtB1D,GAAe,IAAM/uC,KAAKmvJ,gBAE1BnvJ,KAAKivJ,IAAIzE,OAAS,IAAMxqJ,KAAKmvJ,cAG/BnvJ,KAAKivJ,IAAIpU,UAAY9pG,GAAS/wC,KAAKovJ,eAAer+G,GAClD/wC,KAAKivJ,IAAIl3D,QAAU,IAAM/3F,KAAKqvJ,eAC9BrvJ,KAAKivJ,IAAIjlG,QAAUjgD,GAAO/J,KAAKsvJ,aAAavlJ,GAE5C/J,KAAKuvJ,mBAAqB,IAAMvvJ,KAAKwvJ,gBACrCxvJ,KAAKwkC,KAAK,SAAUxkC,KAAKuvJ,oBAO3B95G,KAAM0H,GACJn9C,KAAKivJ,IAAIx5G,KAAK0H,GAMhB3X,QAASz7B,GACP/J,KAAKykH,SAAS16G,GAAK,SAGrB06G,SAAU16G,EAAKg/B,GACb,IAAI/oC,KAAKmjC,UAAT,CAqBA,GAnBAnjC,KAAKshC,OAAO,sBAAuBv3B,IAAQA,EAAIG,SAAWH,IAE1D/J,KAAKilE,SAAWjlE,KAAKytB,UAAW,EAC3BztB,KAAKw3F,eAAe3nC,OAAO7vD,KAAK+E,KAAK,MACrC/E,KAAK4vD,eAAe67E,UAAUzrI,KAAK0N,MAExC1N,KAAKyyC,WAAY,EACjBzyC,KAAKmjC,WAAY,EAEjB6B,cAAchlC,KAAKwnJ,WACnBxnJ,KAAKwnJ,UAAY,KACjBxnJ,KAAKunJ,OAAS,KACdvnJ,KAAKq3G,IAAM,KAEPr3G,KAAKuvJ,oBACPvvJ,KAAKqzC,eAAe,SAAUrzC,KAAKuvJ,oBAErCvvJ,KAAKuvJ,mBAAqB,KAEtBvvJ,KAAKivJ,IAAK,CACZ,MAAM7wI,EAAKpe,KAAKivJ,IACVrqC,EAAU,KACdxmG,EAAG25E,QAAU,MAEf,GAAI35E,EAAGo4F,aAAeu4C,EAAWU,OAC/B7qC,SAEA,IACExmG,EAAG25E,QAAU6sB,EACbxmG,EAAGwpC,QACH,MAAO79C,GACP66G,IAIJxmG,EAAGosI,OAAS,KACZpsI,EAAGy8H,UAAY,KACfz8H,EAAG4rC,QAAU,OAEfhqD,KAAKivJ,IAAM,KAEPllJ,GAAK/J,KAAKylC,KAAK,QAAS17B,GAC5B/J,KAAKylC,KAAK,SACVsD,KAGFkB,SAEAuC,OAAQ2Q,EAAOnhB,EAAU+M,GACvB,GAAI/oC,KAAKmjC,UAAW,OAAO4F,EAAG,IAAI9pC,MAAM,2CAExC,GAAIe,KAAKyyC,UAAW,CAClB,IACEzyC,KAAKy1C,KAAK0H,GACV,MAAOpzC,GACP,OAAO/J,KAAKwlC,QAAQz7B,GAEJ,mBAAPqU,GAAqBpe,KAAKivJ,IAAIjG,eAvJnB,OAwJpBhpJ,KAAKshC,OAAO,wCAAyCthC,KAAKivJ,IAAIjG,gBAC9DhpJ,KAAKq3G,IAAMtuE,GAEXA,EAAG,WAGL/oC,KAAKshC,OAAO,wBACZthC,KAAKunJ,OAASpqG,EACdn9C,KAAKq3G,IAAMtuE,EAIfomH,cACE,IAAInvJ,KAAKyyC,YAAazyC,KAAKmjC,UAA3B,CAGA,GAFAnjC,KAAKyyC,WAAY,EAEbzyC,KAAKunJ,OAAQ,CACf,IACEvnJ,KAAKy1C,KAAKz1C,KAAKunJ,QACf,MAAOx9I,GACP,OAAO/J,KAAKwlC,QAAQz7B,GAEtB/J,KAAKunJ,OAAS,KACdvnJ,KAAKshC,OAAO,0CAEZ,MAAMyH,EAAK/oC,KAAKq3G,IAChBr3G,KAAKq3G,IAAM,KACXtuE,EAAG,MAKa,mBAAP3qB,IACTpe,KAAKwnJ,UAAYviH,aAAY,IAAMjlC,KAAK4tJ,eAAe,KACnD5tJ,KAAKwnJ,UAAUniH,OAAOrlC,KAAKwnJ,UAAUniH,SAG3CrlC,KAAKshC,OAAO,WACZthC,KAAKylC,KAAK,YAGZ2pH,eAAgBr+G,GACd,GAAI/wC,KAAKmjC,UAAW,OACpB,IAAIviC,EAAOmwC,EAAMnwC,KACbA,aAAgBo9B,cAAap9B,EAAOM,EAAO2M,KAAKjN,IACpDZ,KAAK+E,KAAKnE,GAGZyuJ,eACMrvJ,KAAKmjC,YACTnjC,KAAKshC,OAAO,YACZthC,KAAKwlC,WAGP8pH,aAAc7wI,GACZze,KAAKwlC,QAAQ,IAAIvmC,MAAM,uBAAuBe,KAAKw0C,QAKrDg7G,gBACE,GAAIxvJ,KAAKmjC,UAAW,OAIpB,MAAMgoH,EAAc,KAClBhmH,YAAW,IAAMnlC,KAAKwlC,WAAW,MAG/BxlC,KAAKyyC,UACP04G,IAEAnrJ,KAAKwkC,KAAK,UAAW2mH,GAIzByC,cACE,IAAK5tJ,KAAKq3G,MAAQr3G,KAAKivJ,KAAOjvJ,KAAKivJ,IAAIjG,eArOf,MAsOtB,OAEFhpJ,KAAKshC,OAAO,yCAA0CthC,KAAKivJ,IAAIjG,gBAC/D,MAAMjgH,EAAK/oC,KAAKq3G,IAChBr3G,KAAKq3G,IAAM,KACXtuE,EAAG,MAGLzH,SACE,MAAMz9B,EAAO,GAAGjB,MAAMrC,KAAK0E,WAC3BpB,EAAK,GAAK,IAAM7D,KAAKslJ,IAAM,KAAOzhJ,EAAK,GACvC47B,EAAMz6B,MAAM,KAAMnB,IAItBkuC,EAAO29G,oBAAsBX,EAE7BtwJ,EAAOC,QAAUqzC,iBClQjB,MAAM49G,EAAW,EAAQ,MACnBC,EAAgB,EAAQ,MAE9BnxJ,EAAOC,QAAU,CACfixJ,SAAAA,EACAC,cAAAA,mBCLF,MAAM,YAAE/+C,GAAgB,EAAQ,MAC1B8+C,EAAW,EAAQ,MAyFzBlxJ,EAAOC,QAvFP,MACEuD,YAAag9B,EAAO,IAClB,GAAoB,iBAATA,EAAmB,MAAM,IAAIhgC,MAAM,6BAE9Ce,KAAK6vJ,UAAY,GACjB7vJ,KAAK8vJ,WAAW7wH,EAAKyrC,SACrB1qE,KAAK+vJ,QAAQ9wH,EAAK+wH,KAAM/wH,EAAKgxH,WAG/BC,aACE,OAAOlwJ,KAAKmwJ,SAGdC,UAEE,OAAOpwJ,KAAKqwJ,OAAOn/C,kBAGrBo/C,eACE,OAAOtwJ,KAAKiwJ,UAGdH,WAAYnqJ,GAAM,GAChB,GAAmB,kBAARA,EAAmB,MAAM,IAAI1G,MAAM,6BAE9Ce,KAAKmwJ,SAAWxqJ,EAChB,IAAK,MAAM4qJ,KAAYvwJ,KAAK6vJ,UAC1BU,EAAST,WAAWnqJ,GAIxBoqJ,QAASC,EAAMC,EAAY,MAEzB,IAAK9wJ,OAAOi7D,UAAU41F,IAASA,EAAO,EAAG,MAAM,IAAI/wJ,MAAM,4CAGzD,GAFA+wJ,EAAO1xH,SAAS0xH,GAEZC,IAAmC,iBAAdA,GAA0BA,GAAa,GAAI,MAAM,IAAIhxJ,MAAM,sCAGpF,GAFAgxJ,EAAYA,GAAan/I,KAAKC,IAAIutB,SAAS0xH,EAAO,IAAK,GACvDC,EAAY3xH,SAAS2xH,GACjBD,EAAO,GAAKC,EAAYD,EAAM,MAAM,IAAI/wJ,MAAM,wCAE7Ce,KAAKqwJ,SAAQrwJ,KAAKqwJ,OAAS,IAAIx/C,EAAYm/C,EAAMA,EAAM,SAAU,OAEtEhwJ,KAAKqwJ,OAAO7+C,WAAaw+C,EACzBhwJ,KAAKqwJ,OAAOn/C,kBAAoB8+C,EAChChwJ,KAAKiwJ,UAAYA,EAGnBO,aAAcP,GACZ,IAAK9wJ,OAAOi7D,UAAU61F,IAAcA,GAAa,EAAG,MAAM,IAAIhxJ,MAAM,kDACpE,MAAM+wJ,EAAOhwJ,KAAKowJ,UAElB,GADAH,EAAY3xH,SAAS2xH,GACjBD,EAAO,GAAKC,EAAYD,EAAM,MAAM,IAAI/wJ,MAAM,wCAClDe,KAAKiwJ,UAAYA,EAGnBM,SAAUtxH,EAAO,IACf,GAAoB,iBAATA,EAAmB,MAAM,IAAIhgC,MAAM,6BAO9C,OALoB,IAAI0wJ,EAAS,IAC5B1wH,EACH6vC,MAAO9uE,OAMXwlC,UACE,IAAK,MAAM+qH,KAAYvwJ,KAAK6vJ,UAC1BU,EAAS/qH,UAGXxlC,KAAK6vJ,UAAY,GAGnBY,aAAcF,GACZ,KAAMA,aAAoBZ,GAAW,MAAM,IAAI1wJ,MAAM,4CAErDe,KAAK6vJ,UAAU9qJ,KAAKwrJ,GAGtBG,gBAAiBH,GACf,MAAM3mJ,EAAQ5J,KAAK6vJ,UAAUziI,QAAQmjI,GACjC3mJ,GAAS,GAAG5J,KAAK6vJ,UAAUthJ,OAAO3E,EAAO,qBCtFjD,MAAM,aAAEglC,GAAiB,EAAQ,OAC3B,UAAEmI,GAAc,EAAQ,OACxB,KAAE45G,GAAS,EAAQ,MAyIzBlyJ,EAAOC,QAvIP,cAAuBq4C,EACrB90C,YAAag9B,EAAO,IAGlB,GAFAmC,QAEoB,iBAATnC,EAAmB,MAAM,IAAIhgC,MAAM,6BAE9C,MAAMyzC,EAASltC,OAAO+iB,OAAO,GAAI0W,GAEjC,GAAIyT,EAAOo8B,SAAWp8B,EAAOo8B,iBAAiB8gF,GAAgB,MAAM,IAAI3wJ,MAAM,+CACpEyzC,EAAOo8B,QAAOp8B,EAAOo8B,MAAQ,IAAI8gF,EAAcl9G,IAEzD1yC,KAAK4wJ,YAAYl+G,EAAOg4B,SAAWh4B,EAAOo8B,MAAMpE,SAChD1qE,KAAK6wJ,OAASn+G,EAAOo8B,MACrB9uE,KAAK8wJ,SAAW,IAAIliH,EACpB5uC,KAAK+wJ,YAAa,EAElB/wJ,KAAK6wJ,OAAOJ,aAAazwJ,MAG3BkwJ,aACE,OAAOlwJ,KAAKmwJ,SAGda,WACE,OAAOhxJ,KAAK6wJ,OAGdD,YAAajrJ,GAAM,GACjB,GAAmB,kBAARA,EAAmB,MAAM,IAAI1G,MAAM,6BAC9Ce,KAAKmwJ,SAAWxqJ,EAGlBmqJ,WAAYnqJ,GACV3F,KAAK4wJ,YAAYjrJ,GACb3F,KAAKmwJ,SAAUnwJ,KAAK8wJ,SAASrrH,KAAK,WACjCzlC,KAAK8wJ,SAASrrH,KAAK,YAG1B4R,WAAY8F,EAAOpoB,GACjB/0B,KAAK+sD,cAAc5P,EAAOpoB,GAU5BszB,qBAAsB4oG,GAEpB,OAAO,IAAIzlI,SAAQ,CAACC,EAAS+c,KAC3B,IAAIzT,GAAO,EACX,MAAMpiB,EAAO3S,KACb,SAASkxJ,EAAQnnJ,GAIf,GAHA4I,EAAKm+I,SAASz9G,eAAe,WAAY69G,GACzCv+I,EAAKm+I,SAASz9G,eAAe,YAAa69G,IAEtCn8H,EAAJ,CAEA,GADAA,GAAO,EACHhrB,EAAK,OAAOy+B,EAAOz+B,GACvB0hB,KAEFzrB,KAAK8wJ,SAAStsH,KAAK,WAAY0sH,GAC/BlxJ,KAAK8wJ,SAAStsH,KAAK,YAAa0sH,GAEhClxJ,KAAK6wJ,OAAOR,OAAO9+C,aAAa0/C,EAAQC,MAI5CC,kBACE,OAAOnxJ,KAAKmwJ,UAAYnwJ,KAAK6wJ,OAAOX,aAatC7nG,oBAAqBlL,EAAOpoB,GAC1B,IAAK/0B,KAAKmxJ,kBAAmB,OAAOp8H,EAAK,KAAMooB,GAE/C,IAAIhwB,EAAM,EACN8iI,EAAYjwJ,KAAK6wJ,OAAOP,eACxB1tJ,EAAQu6C,EAAMv6C,MAAMuqB,EAAKA,EAAM8iI,GACnC,KAAOrtJ,EAAMtB,OAAS,GAAG,CAGvB,GAAItB,KAAKmxJ,kBACP,IAGE,KAAiC,IAA1BnxJ,KAAK6wJ,OAAOT,YAAoBpwJ,KAAK+wJ,YAAc/wJ,KAAKmxJ,mBAE7D,SADMR,EAAK,KACP3wJ,KAAK+wJ,WAAY,OAIvB,GAAI/wJ,KAAKmxJ,oBAAsBnxJ,KAAK6wJ,OAAOR,OAAOz+C,gBAAgBhvG,EAAMtB,gBAChEtB,KAAKoxJ,eAAexuJ,EAAMtB,QAC5BtB,KAAK+wJ,YAAY,OAEvB,MAAOhnJ,GACP,OAAOgrB,EAAKhrB,GAIhB/J,KAAK+E,KAAKnC,GACVuqB,GAAO8iI,EAGPA,EAAajwJ,KAAKmxJ,kBACdnxJ,KAAK6wJ,OAAOP,eACZnzG,EAAM77C,OAAS6rB,EACnBvqB,EAAQu6C,EAAMv6C,MAAMuqB,EAAKA,EAAM8iI,GAGjC,OAAOl7H,IAGTyQ,WAAY3hC,GACV7D,KAAK6wJ,OAAOH,gBAAgB1wJ,MAE5BA,KAAK+wJ,YAAa,EAClB/wJ,KAAK8wJ,SAASrrH,KAAK,aAEnBrE,MAAMoE,WAAW3hC,KAOrB,MAAM+rJ,EAAgB,EAAQ,gBC1I9BnxJ,EAAOC,QAAU,CACfiyJ,KALF,SAAeliJ,GACb,OAAO,IAAI+c,SAASC,GAAY0Z,WAAW1Z,EAAShd,iBCDtD,IAGI4iJ,EAHAC,EAAO,EACPC,EAAU,MAGVC,EAAM,WACRF,EAAQA,EAAO,EAAKC,GAItB9yJ,EAAOC,QAAU,SAAUqyG,GACpBsgD,IACHA,EAAQpsH,YAAYusH,EAAK,MACfnsH,OAAOgsH,EAAMhsH,QAGzB,IAAIzmC,EAbW,GAaUmyG,GAAW,GAChCxlG,EAAS,CAAC,GACVkmJ,EAAU,EACVvyG,EAAQoyG,EAAO,EAAKC,EAExB,OAAO,SAAU5uI,GACf,IAAI4uG,EAAQ+/B,EAAOpyG,EAAQqyG,EAI3B,IAHIhgC,EAAO3yH,IAAM2yH,EAAO3yH,GACxBsgD,EAAOoyG,EAEA//B,KACDkgC,IAAY7yJ,IAAM6yJ,EAAU,GAChClmJ,EAAOkmJ,GAAWlmJ,EAAmB,IAAZkmJ,EAAgB7yJ,EAAO,EAAI6yJ,EAAU,GAC9DA,IAGE9uI,IAAOpX,EAAOkmJ,EAAU,IAAM9uI,GAElC,IAAIy5E,EAAM7wF,EAAOkmJ,EAAU,GACvBp1D,EAAM9wF,EAAOjK,OAAS1C,EAAO,EAAI2M,EAAOkmJ,IAAY7yJ,EAAO,EAAI6yJ,GAEnE,OAAOlmJ,EAAOjK,OAlCD,EAkCuB86F,EAlCvB,GAkC8BA,EAAMC,GAAoB9wF,EAAOjK,yBCfhF7C,EAAOC,QAAU2pI,EAEjB,IAAIqpB,EAAK,qBAoBT,SAASrpB,IACPqpB,EAAGnxJ,KAAKP,MApBK,EAAQ,KAEvBJ,CAASyoI,EAAQqpB,GACjBrpB,EAAO5rC,SAAW,EAAQ,MAC1B4rC,EAAO7kF,SAAW,EAAQ,MAC1B6kF,EAAOpnG,OAAS,EAAQ,MACxBonG,EAAOtxF,UAAY,EAAQ,MAC3BsxF,EAAOrjE,YAAc,EAAQ,MAC7BqjE,EAAOoD,SAAW,EAAQ,MAC1BpD,EAAOwK,SAAW,EAAQ,MAG1BxK,EAAOA,OAASA,EAWhBA,EAAOpoI,UAAUklE,KAAO,SAAShzD,EAAMtR,GACrC,IAAIkvB,EAAS/vB,KAEb,SAASosI,EAAOjvF,GACVhrC,EAAKsb,WACH,IAAUtb,EAAKlP,MAAMk6C,IAAUptB,EAAO6sC,OACxC7sC,EAAO6sC,QAOb,SAASuvE,IACHp8G,EAAOk1C,UAAYl1C,EAAO8sC,QAC5B9sC,EAAO8sC,SAJX9sC,EAAO2U,GAAG,OAAQ0nG,GAQlBj6H,EAAKuyB,GAAG,QAASynG,GAIZh6H,EAAKw/I,UAAc9wJ,IAA2B,IAAhBA,EAAQ6M,MACzCqiB,EAAO2U,GAAG,MAAOkzD,GACjB7nE,EAAO2U,GAAG,QAASqzD,IAGrB,IAAI65D,GAAW,EACf,SAASh6D,IACHg6D,IACJA,GAAW,EAEXz/I,EAAKzE,OAIP,SAASqqF,IACH65D,IACJA,GAAW,EAEiB,mBAAjBz/I,EAAKqzB,SAAwBrzB,EAAKqzB,WAI/C,SAASwkB,EAAQmG,GAEf,GADA4W,IACwC,IAApC2qF,EAAG32D,cAAc/6F,KAAM,SACzB,MAAMmwD,EAQV,SAAS4W,IACPh3C,EAAOsjB,eAAe,OAAQ+4F,GAC9Bj6H,EAAKkhC,eAAe,QAAS84F,GAE7Bp8G,EAAOsjB,eAAe,MAAOukD,GAC7B7nE,EAAOsjB,eAAe,QAAS0kD,GAE/BhoE,EAAOsjB,eAAe,QAAS2W,GAC/B73C,EAAKkhC,eAAe,QAAS2W,GAE7Bj6B,EAAOsjB,eAAe,MAAO0zB,GAC7Bh3C,EAAOsjB,eAAe,QAAS0zB,GAE/B50D,EAAKkhC,eAAe,QAAS0zB,GAW/B,OA5BAh3C,EAAO2U,GAAG,QAASslB,GACnB73C,EAAKuyB,GAAG,QAASslB,GAmBjBj6B,EAAO2U,GAAG,MAAOqiC,GACjBh3C,EAAO2U,GAAG,QAASqiC,GAEnB50D,EAAKuyB,GAAG,QAASqiC,GAEjB50D,EAAKszB,KAAK,OAAQ1V,GAGX5d,mBC/HT,IAAI0/I,EAAgB,EAAQ,MACxB98G,EAAW,EAAQ,MACnBg2B,EAAS,EAAQ,MACjB+mF,EAAc,EAAQ,KACtBt9G,EAAM,EAAQ,MAEd41D,EAAO1rG,EAEX0rG,EAAK9hE,QAAU,SAAUrJ,EAAM8J,GAE7B9J,EADmB,iBAATA,EACHuV,EAAIhW,MAAMS,GAEV8rC,EAAO9rC,GAKf,IAAI8yH,GAAoE,IAAlD,EAAA/vI,EAAO6uB,SAAS1C,SAAS/e,OAAO,aAAsB,QAAU,GAElF+e,EAAWlP,EAAKkP,UAAY4jH,EAC5BnN,EAAO3lH,EAAKmlH,UAAYnlH,EAAK2lH,KAC7Bz7G,EAAOlK,EAAKkK,KACZpiC,EAAOk4B,EAAKl4B,MAAQ,IAGpB69I,IAA+B,IAAvBA,EAAKx3H,QAAQ,OACxBw3H,EAAO,IAAMA,EAAO,KAGrB3lH,EAAKuV,KAAOowG,EAAQz2G,EAAW,KAAOy2G,EAAQ,KAAOz7G,EAAO,IAAMA,EAAO,IAAMpiC,EAC/Ek4B,EAAKn6B,QAAUm6B,EAAKn6B,QAAU,OAAO0I,cACrCyxB,EAAKkiF,QAAUliF,EAAKkiF,SAAW,GAI/B,IAAI3yE,EAAM,IAAIqjH,EAAc5yH,GAG5B,OAFI8J,GACHyF,EAAI9J,GAAG,WAAYqE,GACbyF,GAGR47D,EAAKhrG,IAAM,SAAc6/B,EAAM8J,GAC9B,IAAIyF,EAAM47D,EAAK9hE,QAAQrJ,EAAM8J,GAE7B,OADAyF,EAAI9gC,MACG8gC,GAGR47D,EAAKynD,cAAgBA,EACrBznD,EAAK4nD,gBAAkBj9G,EAASi9G,gBAEhC5nD,EAAK71D,MAAQ,aACb61D,EAAK71D,MAAM09G,kBAAoB,EAE/B7nD,EAAK8nD,YAAc,IAAI9nD,EAAK71D,MAE5B61D,EAAK+nD,aAAeL,EAEpB1nD,EAAKgoD,QAAU,CACd,WACA,UACA,OACA,SACA,MACA,OACA,OACA,WACA,QACA,aACA,QACA,OACA,SACA,UACA,QACA,OACA,WACA,YACA,QACA,MACA,SACA,SACA,YACA,QACA,SACA,+BC1ED,IAAIC,EACJ,SAASC,IAER,QAAYlqJ,IAARiqJ,EAAmB,OAAOA,EAE9B,GAAI,EAAArwI,EAAOuwI,eAAgB,CAC1BF,EAAM,IAAI,EAAArwI,EAAOuwI,eAIjB,IACCF,EAAI9kD,KAAK,MAAO,EAAAvrF,EAAOwwI,eAAiB,IAAM,uBAC7C,MAAM9rJ,GACP2rJ,EAAM,WAIPA,EAAM,KAEP,OAAOA,EAGR,SAASI,EAAkBzqJ,GAC1B,IAAIqqJ,EAAMC,IACV,IAAKD,EAAK,OAAO,EACjB,IAEC,OADAA,EAAIK,aAAe1qJ,EACZqqJ,EAAIK,eAAiB1qJ,EAC3B,MAAOtB,IACT,OAAO,EAgBR,SAASogH,EAAYrlH,GACpB,MAAwB,mBAAVA,EAvDf/C,EAAQi0J,MAAQ7rC,EAAW,EAAA9kG,EAAO2wI,QAAU7rC,EAAW,EAAA9kG,EAAO4wI,gBAE9Dl0J,EAAQm0J,eAAiB/rC,EAAW,EAAA9kG,EAAO8wI,gBAE3Cp0J,EAAQq0J,gBAAkBjsC,EAAW,EAAA9kG,EAAOgxI,iBAuC5Ct0J,EAAQu0J,YAAcv0J,EAAQi0J,OAASF,EAAiB,eAIxD/zJ,EAAQw0J,UAAYx0J,EAAQi0J,OAASF,EAAiB,aACtD/zJ,EAAQy0J,uBAAyBz0J,EAAQi0J,OAASF,EAAiB,2BAInE/zJ,EAAQ00J,iBAAmB10J,EAAQi0J,SAAUL,KAAWxrC,EAAWwrC,IAASc,kBAM5Ef,EAAM,oDC1DFgB,EAAa,EAAQ,MACrBzzJ,EAAW,EAAQ,MACnBm1C,EAAW,EAAQ,MACnBlV,EAAS,EAAQ,MAEjBmyH,EAAkBj9G,EAASi9G,gBAC3BsB,EAAUv+G,EAASw+G,YAgBnB1B,EAAgBpzJ,EAAOC,QAAU,SAAUugC,GAC9C,IAYIu0H,EAZA7gJ,EAAO3S,KACX6/B,EAAO2jB,SAASjjD,KAAKoS,GAErBA,EAAK86C,MAAQxuB,EACbtsB,EAAK8gJ,MAAQ,GACb9gJ,EAAK8vG,SAAW,GACZxjF,EAAKolH,MACR1xI,EAAKulF,UAAU,gBAAiB,SAAWh3F,EAAO2M,KAAKoxB,EAAKolH,MAAMp4I,SAAS,WAC5EzG,OAAOC,KAAKw5B,EAAKkiF,SAASn+G,SAAQ,SAAUlD,GAC3C6S,EAAKulF,UAAUp4F,EAAMm/B,EAAKkiF,QAAQrhH,OAInC,IAAI4zJ,GAAW,EACf,GAAkB,kBAAdz0H,EAAKpe,MAA6B,mBAAoBoe,IAASo0H,EAAWN,gBAE7EW,GAAW,EACXF,GAAe,OACT,GAAkB,qBAAdv0H,EAAKpe,KAGf2yI,GAAe,OACT,GAAkB,6BAAdv0H,EAAKpe,KAEf2yI,GAAgBH,EAAWD,qBACrB,IAAKn0H,EAAKpe,MAAsB,YAAdoe,EAAKpe,MAAoC,gBAAdoe,EAAKpe,KAIxD,MAAM,IAAI5hB,MAAM,+BAFhBu0J,GAAe,EAIhB7gJ,EAAKoqC,MA9CN,SAAqBy2G,EAAcE,GAClC,OAAIL,EAAWV,OAASe,EAChB,QACGL,EAAWF,sBACd,0BACGE,EAAWH,SACd,YACGG,EAAWJ,aAAeO,EAC7B,cAEA,OAoCKG,CAAWH,EAAcE,GACtC/gJ,EAAKihJ,YAAc,KACnBjhJ,EAAKkhJ,eAAiB,KACtBlhJ,EAAKmhJ,aAAe,KAEpBnhJ,EAAK+xB,GAAG,UAAU,WACjB/xB,EAAK8xB,gBAIP7kC,EAASiyJ,EAAehyH,EAAO2jB,UAE/BquG,EAAc5xJ,UAAUi4F,UAAY,SAAUp4F,EAAM2B,GACnD,IACIsyJ,EAAYj0J,EAAK+nC,eAIqB,IAAtCmsH,EAAc5mI,QAAQ2mI,KALf/zJ,KAQNyiH,SAASsxC,GAAa,CAC1Bj0J,KAAMA,EACN2B,MAAOA,KAITowJ,EAAc5xJ,UAAUg0J,UAAY,SAAUn0J,GAC7C,IAAIoO,EAASlO,KAAKyiH,SAAS3iH,EAAK+nC,eAChC,OAAI35B,EACIA,EAAOzM,MACR,MAGRowJ,EAAc5xJ,UAAUi0J,aAAe,SAAUp0J,UACrCE,KACCyiH,SAAS3iH,EAAK+nC,gBAG3BgqH,EAAc5xJ,UAAUwkC,UAAY,WACnC,IAAI9xB,EAAO3S,KAEX,IAAI2S,EAAKo+I,WAAT,CAEA,IAAI9xH,EAAOtsB,EAAK86C,MAEZ,YAAaxuB,GAAyB,IAAjBA,EAAK0U,SAC7BhhC,EAAKwyB,WAAWlG,EAAK0U,SAGtB,IAAIwgH,EAAaxhJ,EAAK8vG,SAClB1iH,EAAO,KACS,QAAhBk/B,EAAKn6B,QAAoC,SAAhBm6B,EAAKn6B,SAC3B/E,EAAO,IAAIy2C,KAAK7jC,EAAK8gJ,MAAO,CACxBzrJ,MAAOmsJ,EAAW,iBAAmB,IAAI1yJ,OAAS,MAK7D,IAAI2yJ,EAAc,GAalB,GAZA5uJ,OAAOC,KAAK0uJ,GAAYnxJ,SAAQ,SAAUqxJ,GACzC,IAAIv0J,EAAOq0J,EAAWE,GAASv0J,KAC3B2B,EAAQ0yJ,EAAWE,GAAS5yJ,MAC5BC,MAAMC,QAAQF,GACjBA,EAAMuB,SAAQ,SAAU+1C,GACvBq7G,EAAYrvJ,KAAK,CAACjF,EAAMi5C,OAGzBq7G,EAAYrvJ,KAAK,CAACjF,EAAM2B,OAIP,UAAfkR,EAAKoqC,MAAmB,CAC3B,IAAI1H,EAAS,KACb,GAAIg+G,EAAWN,gBAAiB,CAC/B,IAAIuB,EAAa,IAAItB,gBACrB39G,EAASi/G,EAAWj/G,OACpB1iC,EAAK4hJ,sBAAwBD,EAEzB,mBAAoBr1H,GAAgC,IAAxBA,EAAKu1H,iBACpC7hJ,EAAKihJ,YAAc,EAAA5xI,EAAOmjB,YAAW,WACpCxyB,EAAK8yB,KAAK,kBACN9yB,EAAK4hJ,uBACR5hJ,EAAK4hJ,sBAAsBp8D,UAC1Bl5D,EAAKu1H,iBAIV,EAAAxyI,EAAO2wI,MAAMhgJ,EAAK86C,MAAMjZ,IAAK,CAC5B1vC,OAAQ6N,EAAK86C,MAAM3oD,OACnBq8G,QAASizC,EACTr0J,KAAMA,QAAQqI,EACdyY,KAAM,OACN4zI,YAAax1H,EAAKy1H,gBAAkB,UAAY,cAChDr/G,OAAQA,IACNjqB,MAAK,SAAU2pB,GACjBpiC,EAAKgiJ,eAAiB5/G,EACtBpiC,EAAKiiJ,cAAa,GAClBjiJ,EAAKkiJ,cACH,SAAU1gI,GACZxhB,EAAKiiJ,cAAa,GACbjiJ,EAAKo+I,YACTp+I,EAAK8yB,KAAK,QAAStR,UAEf,CACN,IAAIk+H,EAAM1/I,EAAKmiJ,KAAO,IAAI,EAAA9yI,EAAOuwI,eACjC,IACCF,EAAI9kD,KAAK56F,EAAK86C,MAAM3oD,OAAQ6N,EAAK86C,MAAMjZ,KAAK,GAC3C,MAAOzqC,GAIR,YAHA8f,EAAQs/B,UAAS,WAChBx2C,EAAK8yB,KAAK,QAAS17B,MAMjB,iBAAkBsoJ,IACrBA,EAAIK,aAAe//I,EAAKoqC,OAErB,oBAAqBs1G,IACxBA,EAAIqC,kBAAoBz1H,EAAKy1H,iBAEX,SAAf/hJ,EAAKoqC,OAAoB,qBAAsBs1G,GAClDA,EAAIe,iBAAiB,sCAElB,mBAAoBn0H,IACvBozH,EAAI1+G,QAAU1U,EAAKu1H,eACnBnC,EAAI0C,UAAY,WACfpiJ,EAAK8yB,KAAK,oBAIZ2uH,EAAYpxJ,SAAQ,SAAUkL,GAC7BmkJ,EAAI2C,iBAAiB9mJ,EAAO,GAAIA,EAAO,OAGxCyE,EAAKsiJ,UAAY,KACjB5C,EAAI6C,mBAAqB,WACxB,OAAQ7C,EAAI77C,YACX,KAAK88C,EAAQ6B,QACb,KAAK7B,EAAQ8B,KACZziJ,EAAK0iJ,mBAMW,4BAAf1iJ,EAAKoqC,QACRs1G,EAAIiD,WAAa,WAChB3iJ,EAAK0iJ,mBAIPhD,EAAIroG,QAAU,WACTr3C,EAAKo+I,aAETp+I,EAAKiiJ,cAAa,GAClBjiJ,EAAK8yB,KAAK,QAAS,IAAIxmC,MAAM,gBAG9B,IACCozJ,EAAI58G,KAAK11C,GACR,MAAOgK,GAIR,YAHA8f,EAAQs/B,UAAS,WAChBx2C,EAAK8yB,KAAK,QAAS17B,UAqBvB8nJ,EAAc5xJ,UAAUo1J,eAAiB,WACxC,IAAI1iJ,EAAO3S,KAEX2S,EAAKiiJ,cAAa,GAZnB,SAAsBvC,GACrB,IACC,IAAI7kC,EAAS6kC,EAAI7kC,OACjB,OAAmB,OAAXA,GAA8B,IAAXA,EAC1B,MAAO9mH,GACR,OAAO,GASH6uJ,CAAY5iJ,EAAKmiJ,QAASniJ,EAAKo+I,aAG/Bp+I,EAAKsiJ,WACTtiJ,EAAKkiJ,WAENliJ,EAAKsiJ,UAAUI,eAAe1iJ,EAAKiiJ,aAAa5qI,KAAKrX,MAGtDk/I,EAAc5xJ,UAAU40J,SAAW,WAClC,IAAIliJ,EAAO3S,KAEP2S,EAAKo+I,aAGTp+I,EAAKsiJ,UAAY,IAAIjD,EAAgBr/I,EAAKmiJ,KAAMniJ,EAAKgiJ,eAAgBhiJ,EAAKoqC,MAAOpqC,EAAKiiJ,aAAa5qI,KAAKrX,IACxGA,EAAKsiJ,UAAUvwH,GAAG,SAAS,SAAS36B,GACnC4I,EAAK8yB,KAAK,QAAS17B,MAGpB4I,EAAK8yB,KAAK,WAAY9yB,EAAKsiJ,aAG5BpD,EAAc5xJ,UAAUusC,OAAS,SAAU2Q,EAAOnhB,EAAU+M,GAChD/oC,KAENyzJ,MAAM1uJ,KAAKo4C,GAChBpU,KAGD8oH,EAAc5xJ,UAAU20J,aAAe,SAAU7/H,GAChD,IAAIpiB,EAAO3S,KAEX,EAAAgiB,EAAO2qB,aAAah6B,EAAKmhJ,cACzBnhJ,EAAKmhJ,aAAe,KAEhB/+H,GACH,EAAA/S,EAAO2qB,aAAah6B,EAAKihJ,aACzBjhJ,EAAKihJ,YAAc,MACTjhJ,EAAKkhJ,iBACflhJ,EAAKmhJ,aAAe,EAAA9xI,EAAOmjB,YAAW,WACrCxyB,EAAK8yB,KAAK,aACR9yB,EAAKkhJ,kBAIVhC,EAAc5xJ,UAAUk4F,MAAQ05D,EAAc5xJ,UAAUulC,QAAU,SAAUz7B,GAC3E,IAAI4I,EAAO3S,KACX2S,EAAKo+I,YAAa,EAClBp+I,EAAKiiJ,cAAa,GACdjiJ,EAAKsiJ,YACRtiJ,EAAKsiJ,UAAUlE,YAAa,GACzBp+I,EAAKmiJ,KACRniJ,EAAKmiJ,KAAK38D,QACFxlF,EAAK4hJ,uBACb5hJ,EAAK4hJ,sBAAsBp8D,QAExBpuF,GACH4I,EAAK8yB,KAAK,QAAS17B,IAGrB8nJ,EAAc5xJ,UAAUyN,IAAM,SAAU9M,EAAMo7B,EAAU+M,GAEnC,mBAATnoC,IACVmoC,EAAKnoC,EACLA,OAAOwH,GAGRy3B,EAAO2jB,SAASvjD,UAAUyN,IAAInN,KANnBP,KAM8BY,EAAMo7B,EAAU+M,IAG1D8oH,EAAc5xJ,UAAUklC,WAAa,SAAUwO,EAAS5K,GACvD,IAAIp2B,EAAO3S,KAEP+oC,GACHp2B,EAAK6xB,KAAK,UAAWuE,GAEtBp2B,EAAKkhJ,eAAiBlgH,EACtBhhC,EAAKiiJ,cAAa,IAGnB/C,EAAc5xJ,UAAUu1J,aAAe,aACvC3D,EAAc5xJ,UAAUw1J,WAAa,aACrC5D,EAAc5xJ,UAAUy1J,mBAAqB,aAG7C,IAAI1B,EAAgB,CACnB,iBACA,kBACA,iCACA,gCACA,aACA,iBACA,SACA,UACA,OACA,MACA,SACA,OACA,aACA,SACA,UACA,KACA,UACA,oBACA,UACA,sDC9VGX,EAAa,EAAQ,MACrBzzJ,EAAW,EAAQ,MACnBigC,EAAS,EAAQ,MAEjByzH,EAAU50J,EAAQ60J,YAAc,CACnCoC,OAAQ,EACRC,OAAQ,EACRC,iBAAkB,EAClBV,QAAS,EACTC,KAAM,GAGHpD,EAAkBtzJ,EAAQszJ,gBAAkB,SAAUK,EAAKt9G,EAAUl0B,EAAMi1I,GAC9E,IAAInjJ,EAAO3S,KAiBX,GAhBA6/B,EAAO48D,SAASl8F,KAAKoS,GAErBA,EAAKoqC,MAAQl8B,EACblO,EAAKwuG,QAAU,GACfxuG,EAAKojJ,WAAa,GAClBpjJ,EAAKqjJ,SAAW,GAChBrjJ,EAAKsjJ,YAAc,GAGnBtjJ,EAAK+xB,GAAG,OAAO,WAEd7a,EAAQs/B,UAAS,WAChBx2C,EAAK8yB,KAAK,eAIC,UAAT5kB,EAAkB,CAYrB,GAXAlO,EAAKgiJ,eAAiB5/G,EAEtBpiC,EAAK6hC,IAAMO,EAASP,IACpB7hC,EAAKgyI,WAAa5vG,EAASy4E,OAC3B76G,EAAKujJ,cAAgBnhH,EAASohH,WAE9BphH,EAASosE,QAAQn+G,SAAQ,SAAUkL,EAAQ7J,GAC1CsO,EAAKwuG,QAAQ98G,EAAIwjC,eAAiB35B,EAClCyE,EAAKojJ,WAAWhxJ,KAAKV,EAAK6J,MAGvBmlJ,EAAWR,eAAgB,CAC9B,IAAIplI,EAAW,IAAIqlI,eAAe,CACjC7vJ,MAAO,SAAUk6C,GAEhB,OADA24G,GAAY,GACL,IAAItqI,SAAQ,SAAUC,EAAS+c,GACjC71B,EAAKo+I,WACRvoH,IACS71B,EAAK5N,KAAK7D,EAAO2M,KAAKsvC,IAC/B1xB,IAEA9Y,EAAKyjJ,aAAe3qI,MAIvBm8B,MAAO,WACNkuG,GAAY,GACPnjJ,EAAKo+I,YACTp+I,EAAK5N,KAAK,OAEZozF,MAAO,SAAUpuF,GAChB+rJ,GAAY,GACPnjJ,EAAKo+I,YACTp+I,EAAK8yB,KAAK,QAAS17B,MAItB,IAMC,YALAgrC,EAASh1C,KAAKs2J,OAAO5oI,GAAUpC,OAAM,SAAUthB,GAC9C+rJ,GAAY,GACPnjJ,EAAKo+I,YACTp+I,EAAK8yB,KAAK,QAAS17B,MAGpB,MAAOrD,KAGV,IAAI+vC,EAAS1B,EAASh1C,KAAKu2J,aAC3B,SAAShoH,IACRmI,EAAOnI,OAAOljB,MAAK,SAAUllB,GACxByM,EAAKo+I,aAET+E,EAAY5vJ,EAAO6uB,MACf7uB,EAAO6uB,KACVpiB,EAAK5N,KAAK,OAGX4N,EAAK5N,KAAK7D,EAAO2M,KAAK3H,EAAOzE,QAC7B6sC,SACEjjB,OAAM,SAAUthB,GAClB+rJ,GAAY,GACPnjJ,EAAKo+I,YACTp+I,EAAK8yB,KAAK,QAAS17B,MAGtBukC,QA4BA,GA1BA37B,EAAKmiJ,KAAOzC,EACZ1/I,EAAK4jJ,KAAO,EAEZ5jJ,EAAK6hC,IAAM69G,EAAImE,YACf7jJ,EAAKgyI,WAAa0N,EAAI7kC,OACtB76G,EAAKujJ,cAAgB7D,EAAI8D,WACX9D,EAAIoE,wBAAwBnpJ,MAAM,SACxCtK,SAAQ,SAAUkL,GACzB,IAAI8gH,EAAU9gH,EAAOrG,MAAM,oBAC3B,GAAImnH,EAAS,CACZ,IAAI3qH,EAAM2qH,EAAQ,GAAGnnF,cACT,eAARxjC,QACuB+D,IAAtBuK,EAAKwuG,QAAQ98G,KAChBsO,EAAKwuG,QAAQ98G,GAAO,IAErBsO,EAAKwuG,QAAQ98G,GAAKU,KAAKiqH,EAAQ,UACC5mH,IAAtBuK,EAAKwuG,QAAQ98G,GACvBsO,EAAKwuG,QAAQ98G,IAAQ,KAAO2qH,EAAQ,GAEpCr8G,EAAKwuG,QAAQ98G,GAAO2qH,EAAQ,GAE7Br8G,EAAKojJ,WAAWhxJ,KAAKiqH,EAAQ,GAAIA,EAAQ,QAI3Cr8G,EAAK+jJ,SAAW,kBACXrD,EAAWD,iBAAkB,CACjC,IAAIuD,EAAWhkJ,EAAKojJ,WAAW,aAC/B,GAAIY,EAAU,CACb,IAAIC,EAAeD,EAAS9uJ,MAAM,2BAC9B+uJ,IACHjkJ,EAAK+jJ,SAAWE,EAAa,GAAG/uH,eAG7Bl1B,EAAK+jJ,WACT/jJ,EAAK+jJ,SAAW,WAKpB92J,EAASoyJ,EAAiBnyH,EAAO48D,UAEjCu1D,EAAgB/xJ,UAAUgqC,MAAQ,WACjC,IAEIxe,EAFOzrB,KAEQo2J,aACf3qI,IAHOzrB,KAILo2J,aAAe,KACpB3qI,MAIFumI,EAAgB/xJ,UAAUo1J,eAAiB,SAAUS,GACpD,IAAInjJ,EAAO3S,KAEPqyJ,EAAM1/I,EAAKmiJ,KAEX//G,EAAW,KACf,OAAQpiC,EAAKoqC,OACZ,IAAK,OAEJ,IADAhI,EAAWs9G,EAAIwE,cACFv1J,OAASqR,EAAK4jJ,KAAM,CAChC,IAAIO,EAAU/hH,EAAS7gB,OAAOvhB,EAAK4jJ,MACnC,GAAsB,mBAAlB5jJ,EAAK+jJ,SAA+B,CAEvC,IADA,IAAInrJ,EAASrK,EAAO6B,MAAM+zJ,EAAQx1J,QACzB+J,EAAI,EAAGA,EAAIyrJ,EAAQx1J,OAAQ+J,IACnCE,EAAOF,GAA6B,IAAxByrJ,EAAQzoJ,WAAWhD,GAEhCsH,EAAK5N,KAAKwG,QAEVoH,EAAK5N,KAAK+xJ,EAASnkJ,EAAK+jJ,UAEzB/jJ,EAAK4jJ,KAAOxhH,EAASzzC,OAEtB,MACD,IAAK,cACJ,GAAI+wJ,EAAI77C,aAAe88C,EAAQ8B,OAAS/C,EAAIt9G,SAC3C,MACDA,EAAWs9G,EAAIt9G,SACfpiC,EAAK5N,KAAK7D,EAAO2M,KAAK,IAAI8pB,WAAWod,KACrC,MACD,IAAK,0BAEJ,GADAA,EAAWs9G,EAAIt9G,SACXs9G,EAAI77C,aAAe88C,EAAQ6B,UAAYpgH,EAC1C,MACDpiC,EAAK5N,KAAK7D,EAAO2M,KAAK,IAAI8pB,WAAWod,KACrC,MACD,IAAK,YAEJ,GADAA,EAAWs9G,EAAIt9G,SACXs9G,EAAI77C,aAAe88C,EAAQ6B,QAC9B,MACD,IAAI1+G,EAAS,IAAI,EAAAz0B,EAAO+0I,eACxBtgH,EAAO6+G,WAAa,WACf7+G,EAAOvwC,OAAOnE,WAAa4Q,EAAK4jJ,OACnC5jJ,EAAK5N,KAAK7D,EAAO2M,KAAK,IAAI8pB,WAAW8e,EAAOvwC,OAAOtD,MAAM+P,EAAK4jJ,SAC9D5jJ,EAAK4jJ,KAAO9/G,EAAOvwC,OAAOnE,aAG5B00C,EAAOomD,OAAS,WACfi5D,GAAY,GACZnjJ,EAAK5N,KAAK,OAGX0xC,EAAOK,kBAAkB/B,GAKvBpiC,EAAKmiJ,KAAKt+C,aAAe88C,EAAQ8B,MAAuB,cAAfziJ,EAAKoqC,QACjD+4G,GAAY,GACZnjJ,EAAK5N,KAAK,wBC/MZtG,EAAOC,QAIP2pD,eAA2BxoB,EAAQ82H,GACjC,MAAMpgH,QAAaygH,EAAQn3H,EAAQ82H,GAEnC,OADYziH,IAAI0hE,gBAAgBr/D,IAJlC,MAAMygH,EAAU,EAAQ,gBCAxBv4J,EAAOC,QAEP,SAAuBmhC,EAAQ82H,GAC7B,GAAgB,MAAZA,GAAwC,iBAAbA,EAC7B,MAAM,IAAI13J,MAAM,sCAElB,OAAO,IAAIusB,SAAQ,CAACC,EAAS+c,KAC3B,MAAMsvE,EAAS,GACfj4E,EACG6E,GAAG,QAAQyY,GAAS26D,EAAO/yG,KAAKo4C,KAChC3Y,KAAK,OAAO,KACX,MAAM+R,EAAmB,MAAZogH,EACT,IAAIngH,KAAKshE,EAAQ,CAAE9vG,KAAM2uJ,IACzB,IAAIngH,KAAKshE,GACbrsF,EAAQ8qB,MAET/R,KAAK,QAASgE,4CClBjBhE,EAAO,EAAQ,KAEnB/lC,EAAOC,QAAU,SAAoBmhC,EAAQv+B,EAAQynC,GACnDA,EAAKvE,EAAKuE,GACV,IAAI/9B,EAAM9J,EAAO6B,MAAMzB,GACnBD,EAAS,EACbw+B,EACG6E,GAAG,QAAQ,SAAUyY,GACpBA,EAAMj6C,KAAK8H,EAAK3J,GAChBA,GAAU87C,EAAM77C,UAEjBojC,GAAG,OAAO,WAAcqE,EAAG,KAAM/9B,MACjC05B,GAAG,QAASqE,oBCbjB,MAAM,aAAE6F,GAAiB,EAAQ,MAC3BqoH,EAAmB,IAAIh4J,MAAM,wBAC7Bi4J,EAAkB,IAAIj4J,MAAM,mBAE5Bk4J,EAAY,EAAQ,MACpBC,EAAO,EAAQ,MAIfC,EAAM,SAONC,EAJc,EAIAD,EAadE,EAAwB,KAYxBC,EAAoC,IAANH,EAO9BI,EAAmB,GAAe,GAElCC,EAAmB,IAAe,GAClCC,EAAmB,IAAe,GAClCC,EAAmB,QACnBC,EAAmB,KAAe,GAElCC,EAAsBT,SAStBU,EAASC,MAET5C,EAAOmC,QAGPU,EAFiBC,EAEe9C,EAGhC+C,EAAoBJ,QACpBK,EAAaC,QAoBbC,EAAeD,OAMf5rB,EAAgBllH,OAAOklH,eAAiBllH,OAAO,iBAErD,MAAMwmH,EACJ9rI,YAAa49B,GAAQ,cAAEkkF,EAAgB,MAAK,IAAEniH,EAAM,KAAI,YAAE22J,EAAW,WAAEx2J,EAAU,mBAAEy2J,GAAuB,IACxGx4J,KAAK6/B,OAASA,EACd7/B,KAAKy4J,MAAQ,IAAIrB,EACjBp3J,KAAK+jH,cAAgBA,EACrB/jH,KAAKy3G,SAAW,EAChBz3G,KAAKuB,MAAQ,KACbvB,KAAK6yI,SAAW,KAChB7yI,KAAK+B,WAAay2J,GAAsBz2J,GAAc22J,EACtD14J,KAAK4B,IAAM22J,GAAe32J,EAC1B5B,KAAKuvI,WAAaA,EAAWvlH,KAAKhqB,MAClCA,KAAK24J,oBAAsBC,EAAc5uI,KAAKhqB,MAG5C6vD,YACF,OAAmD,IAA3C7vD,KAAK6/B,OAAOg5H,aAAenB,GAGrC3yJ,KAAMnE,GAMJ,OALiB,OAAbZ,KAAK4B,MAAchB,EAAOZ,KAAK4B,IAAIhB,IAEvCZ,KAAKy3G,UAAYz3G,KAAK+B,WAAWnB,GACjCZ,KAAKy4J,MAAM1zJ,KAAKnE,GAEZZ,KAAKy3G,SAAWz3G,KAAK+jH,eACvB/jH,KAAK6/B,OAAOg5H,cAAgBpB,GACrB,IAGTz3J,KAAK6/B,OAAOg5H,cAxCmBpB,SAyCxB,GAGT92I,QACE,MAAM/f,EAAOZ,KAAKy4J,MAAM93I,QAClBkf,EAAS7/B,KAAK6/B,OAKpB,OAHA7/B,KAAKy3G,UAAYz3G,KAAK+B,WAAWnB,GACX,IAAlBZ,KAAKy3G,WAAgB53E,EAAOg5H,cA/ERxB,UAiFjBz2J,EAGT8M,IAAK9M,GACiB,mBAATA,EAAqBZ,KAAK6/B,OAAO2E,KAAK,SAAU5jC,GAClDA,MAAAA,GAAqCZ,KAAK+E,KAAKnE,GACxDZ,KAAK6/B,OAAOg5H,aA1FYxB,UA0FIr3J,KAAK6/B,OAAOg5H,aAAehB,GAGzDiB,UAAWl4J,EAAMmoC,GACf,MAAMx9B,EAAS,GACTs0B,EAAS7/B,KAAK6/B,OAGpB,IADAt0B,EAAOxG,KAAKnE,GA/DgB62J,SAgEpB53H,EAAOg5H,aAAeP,IAC5B/sJ,EAAOxG,KAAK86B,EAAO+vB,eAAejvC,SAGpC,GAA4C,IA3F5Bo4I,EA2FXl5H,EAAOg5H,cAAmC,OAAO9vH,EAAG,MACzDlJ,EAAO+vG,QAAQrkI,EAAQw9B,GAGzBqI,SACE,MAAMvR,EAAS7/B,KAAK6/B,OAEpB,MAAQA,EAAOg5H,aAAeP,KAAkBb,GAAc,CAC5D,MAAM72J,EAAOZ,KAAK2gB,QAClBkf,EAAOg5H,cAzEiBG,OA0ExBn5H,EAAO2M,OAAO5rC,EAAMZ,KAAKuvI,YACzB1vG,EAAOg5H,cAlHexB,SAqHiC,IA/E5B4B,OA+ExBp5H,EAAOg5H,eAAgD74J,KAAKk5J,mBAGnEA,mBACE,MAAMr5H,EAAS7/B,KAAK6/B,OAEpB,IAnF2Bw4H,SAmFtBx4H,EAAOg5H,gBAA2ChB,EAGrD,OAFAh4H,EAAOg5H,aA1HexB,UAbH,MAuIIx3H,EAAOg5H,mBAC9Bh5H,EAAOyd,OAAO67G,EAAWnvI,KAAKhqB,OAxKhB,IAsDGk4J,EAsHdr4H,EAAOg5H,cA7KI,IAqLXh5H,EAAOg5H,aAAeT,KACzBv4H,EAAOg5H,cAAgBh5H,EAAOg5H,aAAed,GAAUT,EACvDz3H,EAAOu5H,MAAMC,EAAUrvI,KAAKhqB,QATsB,IAA7C6/B,EAAOg5H,aAAeV,KACzBt4H,EAAOg5H,cAAgBd,EACvBl4H,EAAO4kF,SAAS60C,EAAatvI,KAAKhqB,QAWxCu5J,iBACuD,IAAhDv5J,KAAK6/B,OAAOg5H,aAAejB,KAChC53J,KAAK6/B,OAAOg5H,cAAgBjB,EAC5BT,EAAUn3J,KAAK24J,uBAInB,MAAMxwB,EACJlmI,YAAa49B,GAAQ,cAAEkkF,EAAgB,MAAK,IAAEniH,EAAM,KAAI,YAAE43J,EAAW,WAAEz3J,EAAU,mBAAE03J,GAAuB,IACxGz5J,KAAK6/B,OAASA,EACd7/B,KAAKy4J,MAAQ,IAAIrB,EACjBp3J,KAAK+jH,cAAgBA,EACrB/jH,KAAKy3G,SAAW,EAChBz3G,KAAKuB,MAAQ,KACbvB,KAAK6yI,SAAW,KAChB7yI,KAAK+B,WAAa03J,GAAsB13J,GAAc22J,EACtD14J,KAAK4B,IAAM43J,GAAe53J,EAC1B5B,KAAKq2J,OAAS,KACdr2J,KAAK05J,UAAYA,EAAU1vI,KAAKhqB,MAChCA,KAAK24J,oBAAsBgB,EAAa3vI,KAAKhqB,MAG3C6vD,YACF,OAAkD,IAA1C7vD,KAAK6/B,OAAOg5H,aAAetB,GAGrCpyF,KAAMkxF,EAAQttH,GACZ,GAAoB,OAAhB/oC,KAAKq2J,OAAiB,MAAM,IAAIp3J,MAAM,oCAQ1C,GANAe,KAAK6/B,OAAOg5H,cA5Mc,IA6M1B74J,KAAKq2J,OAASA,EACdr2J,KAAK6yI,SAAW,IAAI+mB,EAAS55J,KAAK6/B,OAAQw2H,EAAQttH,GAAM,MAEpDA,GAAI/oC,KAAK6/B,OAAO6E,GAAG,QAASqB,GAE5B8zH,EAAUxD,GACZA,EAAOzmG,eAAeijF,SAAW7yI,KAAK6yI,SAClC9pG,GAAIstH,EAAO3xH,GAAG,QAASqB,GAC3BswH,EAAO3xH,GAAG,SAAU1kC,KAAK6yI,SAASpH,SAASzhH,KAAKhqB,KAAK6yI,eAChD,CACL,MAAM7oF,EAAUhqD,KAAK6yI,SAAS99G,KAAK/K,KAAKhqB,KAAK6yI,SAAUwjB,GACjDt+D,EAAU/3F,KAAK6yI,SAAS99G,KAAK/K,KAAKhqB,KAAK6yI,SAAUwjB,EAAQ,MAC/DA,EAAO3xH,GAAG,QAASslB,GACnBqsG,EAAO3xH,GAAG,QAASqzD,GACnBs+D,EAAO3xH,GAAG,SAAU1kC,KAAK6yI,SAASpH,SAASzhH,KAAKhqB,KAAK6yI,WAGvDwjB,EAAO3xH,GAAG,QAASo1H,EAAW9vI,KAAKhqB,OACnCA,KAAK6/B,OAAO4F,KAAK,SAAU4wH,GAC3BA,EAAO5wH,KAAK,OAAQzlC,KAAK6/B,QAG3B96B,KAAMnE,GACJ,MAAMi/B,EAAS7/B,KAAK6/B,OAEpB,OAAa,OAATj/B,GACFZ,KAAK+jH,cAAgB,EACrBlkF,EAAOg5H,aA7NuBxB,UAVN,IAuODx3H,EAAOg5H,eACvB,IAGQ,OAAb74J,KAAK4B,MAAchB,EAAOZ,KAAK4B,IAAIhB,IACvCZ,KAAKy3G,UAAYz3G,KAAK+B,WAAWnB,GACjCZ,KAAKy4J,MAAM1zJ,KAAKnE,GAEhBi/B,EAAOg5H,aAnOyBxB,UAfN,GAkPHx3H,EAAOg5H,cAEvB74J,KAAKy3G,SAAWz3G,KAAK+jH,eAG9BpjG,QACE,MAAM/f,EAAOZ,KAAKy4J,MAAM93I,QAIxB,OAFA3gB,KAAKy3G,UAAYz3G,KAAK+B,WAAWnB,GACX,IAAlBZ,KAAKy3G,WAAgBz3G,KAAK6/B,OAAOg5H,cA1OLxB,UA2OzBz2J,EAGTwO,QAASxO,GACP,IAAI67C,EACJ,MAAMqmD,EAAU,GAEhB,UAAuC16F,KAA/Bq0C,EAAOz8C,KAAKy4J,MAAM93I,UACxBmiF,EAAQ/9F,KAAK03C,GAGfz8C,KAAK+E,KAAKnE,GAEV,IAAK,IAAIyK,EAAI,EAAGA,EAAIy3F,EAAQxhG,OAAQ+J,IAClCrL,KAAKy4J,MAAM1zJ,KAAK+9F,EAAQz3F,IAI5BijC,OACE,MAAMzO,EAAS7/B,KAAK6/B,OAEpB,GAjR0B,KAuDVw4H,KA0NXx4H,EAAOg5H,cAA6C,CACvD,MAAMj4J,EAAOZ,KAAK2gB,QAGlB,OAFoB,OAAhB3gB,KAAKq2J,SAA+C,IAA5Br2J,KAAKq2J,OAAOpzJ,MAAMrC,KAAiBi/B,EAAOg5H,cAAgBrB,GACvC,IAhRvB,KAgRnB33H,EAAOg5H,eAAsCh5H,EAAO4F,KAAK,OAAQ7kC,GAC/DA,EAGT,OAAO,KAGT0iH,QACE,MAAMzjF,EAAS7/B,KAAK6/B,OAEpB,KA9R0B,KAuDVw4H,KAuORx4H,EAAOg5H,eAAwF,IAtOtFkB,IAsO8Cl6H,EAAOg5H,eAAoC,CACxG,MAAMj4J,EAAOZ,KAAK2gB,QACE,OAAhB3gB,KAAKq2J,SAA+C,IAA5Br2J,KAAKq2J,OAAOpzJ,MAAMrC,KAAiBi/B,EAAOg5H,cAAgBrB,GACvC,IA7RvB,KA6RnB33H,EAAOg5H,eAAsCh5H,EAAO4F,KAAK,OAAQ7kC,IAI1EwwC,SACE,MAAMvR,EAAS7/B,KAAK6/B,OAIpB,IAFA7/B,KAAKsjH,QAEEtjH,KAAKy3G,SAAWz3G,KAAK+jH,eAA6D,IA3OrEs0C,MA2O0Bx4H,EAAOg5H,eACnDh5H,EAAOg5H,cAjP+Bb,MAkPtCn4H,EAAOoK,MAAMjqC,KAAK05J,WAClB75H,EAAOg5H,cA/RuBxB,SAgSc,IAjTpB,EAiTnBx3H,EAAOg5H,eAAmC74J,KAAKsjH,QAjPpB02C,OACT3B,KAmPpBx4H,EAAOg5H,gBACVh5H,EAAOg5H,cA5SiB,KA6SxBh5H,EAAO4F,KAAK,aAG0C,IA3P5Bw0H,GA2PvBp6H,EAAOg5H,eAA+C74J,KAAKk5J,mBAGlEA,mBACE,MAAMr5H,EAAS7/B,KAAK6/B,OAvTM,MAyDHw4H,IAgQlBx4H,EAAOg5H,gBACVh5H,EAAOg5H,aA3SuBxB,UA2SPx3H,EAAOg5H,aAAetB,GAC7C13H,EAAO4F,KAAK,QACP5F,EAAOg5H,aAAeZ,KAAkB7C,IAAMv1H,EAAOg5H,cAxU5C,GAyUM,OAAhB74J,KAAKq2J,QAAiBr2J,KAAKq2J,OAAO3oJ,OAzUxB,IAsDGwqJ,EAsRdr4H,EAAOg5H,cA7UI,IAqVXh5H,EAAOg5H,aAAeT,KACzBv4H,EAAOg5H,cAAgBh5H,EAAOg5H,aAAed,GAAUT,EACvDz3H,EAAOu5H,MAAMC,EAAUrvI,KAAKhqB,QATsB,IAA7C6/B,EAAOg5H,aAAeV,KACzBt4H,EAAOg5H,cAAgBd,EACvBl4H,EAAO4kF,SAAS60C,EAAatvI,KAAKhqB,QAWxCu5J,iBACsD,IA1U1B,MA0UrBv5J,KAAK6/B,OAAOg5H,gBACjB74J,KAAK6/B,OAAOg5H,cA3Uc,MA4U1B1B,EAAUn3J,KAAK24J,uBAInB,MAAMuB,EACJj4J,YAAa49B,GACX7/B,KAAKY,KAAO,KACZZ,KAAK+sI,eAAiBA,EAAe/iH,KAAK6V,GAC1C7/B,KAAKm5J,WAAa,MAItB,MAAMS,EACJ33J,YAAa21C,EAAK4iB,EAAKzxB,GACrB/oC,KAAK6N,KAAO+pC,EACZ53C,KAAKy4F,GAAKj+B,EACVx6D,KAAKm6J,UAAYpxH,EACjB/oC,KAAKuB,MAAQ,KACbvB,KAAKo6J,gBAAiB,EAGxB3uB,WACEzrI,KAAKo6J,gBAAiB,EAGxBrlI,KAAM8K,EAAQ91B,GACRA,IAAK/J,KAAKuB,MAAQwI,GAElB81B,IAAW7/B,KAAKy4F,KAClBz4F,KAAKy4F,GAAK,KAEQ,OAAdz4F,KAAK6N,MAQPgyB,IAAW7/B,KAAK6N,OAClB7N,KAAK6N,KAAO,KAEI,OAAZ7N,KAAKy4F,KAQY,OAAnBz4F,KAAKm6J,WAAoBn6J,KAAKm6J,UAAUn6J,KAAKuB,OACjDvB,KAAKy4F,GAAKz4F,KAAK6N,KAAO7N,KAAKm6J,UAAY,MARO,IAArCt6H,EAAOg5H,aAAetB,IACzBv3J,KAAKy4F,GAAGjzD,QAAQxlC,KAAKuB,OAAS,IAAItC,MAAM,yCAZG,IAAxCe,KAAK6N,KAAKgrJ,aAAetB,IAAqBv3J,KAAKo6J,gBACtDp6J,KAAK6N,KAAK23B,QAAQxlC,KAAKuB,OAAS,IAAItC,MAAM,wCAsBpD,SAAS66J,IACP95J,KAAK6/B,OAAOg5H,cA1YgB,IA2Y8B,IApV/Bb,GAoVtBh4J,KAAK6/B,OAAOg5H,cAA4C74J,KAAKu5J,iBAC7Dv5J,KAAKsjH,QAGZ,SAAS61C,EAAYpvJ,GACnB,MAAM81B,EAAS7/B,KAAK6/B,OAChB91B,GAAK81B,EAAO2F,QAAQz7B,GACuB,IAvW1BmuJ,EAuWhBr4H,EAAOg5H,gBACVh5H,EAAOg5H,cAAgBnB,EACvB73H,EAAO4F,KAAK,YAET5F,EAAOg5H,aAAeZ,KAAkB7C,IAC3Cv1H,EAAOg5H,cAlaS,GAqalBh5H,EAAOg5H,cAAgBf,EACvB93J,KAAKoxC,SAGP,SAASkoH,EAAcvvJ,GACrB,MAAM81B,EAAS7/B,KAAK6/B,OAEf91B,GAAO/J,KAAKuB,QAAU01J,IAAkBltJ,EAAM/J,KAAKuB,OACpDwI,GAAK81B,EAAO4F,KAAK,QAAS17B,GAC9B81B,EAAOg5H,cA7aW,EA8alBh5H,EAAO4F,KAAK,SAEZ,MAAM8xD,EAAK13D,EAAO23D,eACZp5E,EAAKyhB,EAAO+vB,eAEP,OAAP2nC,GAA+B,OAAhBA,EAAGs7C,UAAmBt7C,EAAGs7C,SAAS99G,KAAK8K,EAAQ91B,GACvD,OAAPqU,GAA+B,OAAhBA,EAAGy0H,UAAmBz0H,EAAGy0H,SAAS99G,KAAK8K,EAAQ91B,GAGpE,SAASwlI,EAAYxlI,GACnB,MAAM81B,EAAS7/B,KAAK6/B,OAEhB91B,GAAK81B,EAAO2F,QAAQz7B,GACxB81B,EAAOg5H,cAAgBf,EAxZA,UA2CEL,QA+WpB53H,EAAOg5H,gBACVh5H,EAAOg5H,cAjZiBxB,UAkZnBx3H,EAAOg5H,aAAelB,KAAsBA,GAC/C93H,EAAO4F,KAAK,UAI2B,IAnapB,OAmalB5F,EAAOg5H,eAAkC74J,KAAKoxC,SAGrD,SAASsoH,EAAW3vJ,GACdA,GAAK/J,KAAK6/B,OAAO2F,QAAQz7B,GAC7B/J,KAAK6/B,OAAOg5H,cAtbsBxB,SAuba,IAncnB,GAmcvBr3J,KAAK6/B,OAAOg5H,eAAiC74J,KAAKoxC,SAGzD,SAASuoH,IACP35J,KAAK6/B,OAAOg5H,cAlbsBxB,SAmblCr3J,KAAKoxC,SAGP,SAASwnH,IACP54J,KAAK6/B,OAAOg5H,cApacxB,SAqa1Br3J,KAAKoxC,SAGP,SAASioH,EAAWtvJ,GAClB,MAAM81B,EAAS7/B,KAAK6/B,OAEhB91B,GAAK81B,EAAO2F,QAAQz7B,GAEmB,IA7dzB,EA6db81B,EAAOg5H,gBAC0C,IA/Z5BR,KA+ZnBx4H,EAAOg5H,gBAA2Ch5H,EAAOg5H,cAvdpC,IAwd2B,IAnZ5BR,SAmZpBx4H,EAAOg5H,gBAA4Ch5H,EAAOg5H,cA9b1C,QA+brBh5H,EAAO4F,KAAK,SAGd5F,EAAOg5H,cA/aUxB,SAiba,OAA1Bx3H,EAAO+vB,gBACT/vB,EAAO+vB,eAAexe,SAGM,OAA1BvR,EAAO23D,gBACT33D,EAAO23D,eAAepmD,SAI1B,SAAS27F,EAAgBhjI,EAAKnJ,GACxBA,MAAAA,GAAqCZ,KAAK+E,KAAKnE,GACnDZ,KAAK4vD,eAAe2/E,WAAWxlI,GAGjC,MAAMs+H,UAAez5F,EACnB3sC,YAAag9B,GACXmC,QAEAphC,KAAK64J,aAAe,EACpB74J,KAAKw3F,eAAiB,KACtBx3F,KAAK4vD,eAAiB,KAElB3wB,IACEA,EAAKsuE,OAAMvtG,KAAKo5J,MAAQn6H,EAAKsuE,MAC7BtuE,EAAKuG,UAASxlC,KAAKykH,SAAWxlF,EAAKuG,SACnCvG,EAAKo7H,aAAYr6J,KAAKs6J,YAAcr7H,EAAKo7H,YACzCp7H,EAAKoW,QACPpW,EAAKoW,OAAOsB,iBAAiB,QAASwhD,EAAMnuE,KAAKhqB,QAKvDo5J,MAAOrwH,GACLA,EAAG,MAGL07E,SAAU17E,GACRA,EAAG,MAGLuxH,eAIIr1F,eACF,OAA+B,OAAxBjlE,KAAKw3F,qBAAiCpvF,EAG3CqlB,eACF,OAA+B,OAAxBztB,KAAK4vD,qBAAiCxnD,EAG3C+6B,gBACF,OAA2C,IAzhB3B,EAyhBRnjC,KAAK64J,cAGX7S,iBACF,OAAgD,IAxe7BkS,EAweXl4J,KAAK64J,cAGfrzH,QAASz7B,GACsC,IA5e1BmuJ,EA4edl4J,KAAK64J,gBACH9uJ,IAAKA,EAAMktJ,GAChBj3J,KAAK64J,aA3eS0B,UAzDA,EAoiBOv6J,KAAK64J,cACE,OAAxB74J,KAAKw3F,iBACPx3F,KAAKw3F,eAAej2F,MAAQwI,EAC5B/J,KAAKw3F,eAAe+hE,kBAEM,OAAxBv5J,KAAK4vD,iBACP5vD,KAAK4vD,eAAeruD,MAAQwI,EAC5B/J,KAAK4vD,eAAe2pG,kBAEtBv5J,KAAKs6J,eAIT51H,GAAI5kC,EAAMmpB,GAmBR,OAlB4B,OAAxBjpB,KAAKw3F,iBACM,SAAT13F,IACFE,KAAK64J,cAAgB,KACrB74J,KAAKw3F,eAAe+hE,kBAET,aAATz5J,IACFE,KAAK64J,cA1iBiB,KA2iBtB74J,KAAKw3F,eAAe+hE,mBAII,OAAxBv5J,KAAK4vD,gBACM,UAAT9vD,IACFE,KAAK64J,cAAgBlB,EACrB33J,KAAK4vD,eAAe2pG,kBAIjBn4H,MAAMsD,GAAG5kC,EAAMmpB,IAI1B,MAAMwzE,UAAiB4rC,EACrBpmI,YAAag9B,GACXmC,MAAMnC,GAENj/B,KAAK64J,cAAgB2B,QACrBx6J,KAAKw3F,eAAiB,IAAI2wC,EAAcnoI,KAAMi/B,GAE1CA,IACEA,EAAKqP,OAAMtuC,KAAKiqC,MAAQhL,EAAKqP,MAC7BrP,EAAKw7H,WAAWz6J,KAAK68D,SAASD,SAItC3yB,MAAOlB,GACLA,EAAG,MAGLo8B,KAAMhzD,EAAM42B,GAGV,OAFA/oC,KAAKw3F,eAAeryB,KAAKhzD,EAAM42B,GAC/B/oC,KAAKw3F,eAAe+hE,iBACbpnJ,EAGTm8B,OAEE,OADAtuC,KAAKw3F,eAAe+hE,iBACbv5J,KAAKw3F,eAAelpD,OAG7BvpC,KAAMnE,GAEJ,OADAZ,KAAKw3F,eAAe+hE,iBACbv5J,KAAKw3F,eAAezyF,KAAKnE,GAGlCwO,QAASxO,GAEP,OADAZ,KAAKw3F,eAAe+hE,iBACbv5J,KAAKw3F,eAAepoF,QAAQxO,GAGrCi8D,SAGE,OAFA78D,KAAK64J,cArmBqB,IAsmB1B74J,KAAKw3F,eAAe+hE,iBACbv5J,KAGT48D,QAEE,OADA58D,KAAK64J,cA5lB2BxB,SA6lBzBr3J,KAGTy1E,0BAA2BilF,EAAKz7H,GAC9B,IAAIuG,EAEJ,MAAM+xD,EAAK,IAAIkF,EAAS,IACnBx9D,EACHqP,KAAMvF,GACJ2xH,EAAIh0I,OAAO0E,KAAKrmB,GAAMqmB,KAAK2d,EAAG/e,KAAK,KAAM,OAAOqB,MAAM0d,IAExDsxH,aACE70H,EAAUk1H,EAAIC,UAEhBn1H,QAASuD,GACP,IAAKvD,EAAS,OAAOuD,EAAG,MACxBvD,EAAQpa,KAAK2d,EAAG/e,KAAK,KAAM,OAAOqB,MAAM0d,MAI5C,OAAOwuD,EAEP,SAASxyF,EAAMnE,GACTA,EAAKm0B,KAAMwiE,EAAGxyF,KAAK,MAClBwyF,EAAGxyF,KAAKnE,EAAKa,QAItBg0E,YAAa70E,EAAMq+B,GACjB,GAgSK46H,EADeh6H,EA/RFj/B,IAgSQi/B,EAAOolC,SAhSR,OAAOrkE,EA+RpC,IAAwBi/B,EA9RpB,GAAIj/B,EAAK6rI,GAAgB,OAAOzsI,KAAK46J,mBAAmBh6J,EAAK6rI,KAAkBxtG,GAC1Ev9B,MAAMC,QAAQf,KAAOA,OAAgBwH,IAATxH,EAAqB,GAAK,CAACA,IAE5D,IAAIyK,EAAI,EACR,OAAO,IAAIoxF,EAAS,IACfx9D,EACHqP,KAAMvF,GACJ/oC,KAAK+E,KAAKsG,IAAMzK,EAAKU,OAAS,KAAOV,EAAKyK,MAC1C09B,EAAG,SAKT0sC,uBAAwB8hB,GACtB,OAAwD,IAzlB3BwhE,KAylBrBxhE,EAAGshE,eAAkDthE,EAAGC,eAAeigB,UAAYlgB,EAAGC,eAAeusB,cAG/GtuC,gBAAiB8hB,GACf,OAA4C,IA5pBlB,IA4pBlBA,EAAGshE,cAGb,CAACpsB,KACC,MAAM5sG,EAAS7/B,KAEf,IAAIuB,EAAQ,KACRs5J,EAAiB,KACjBC,EAAgB,KAMpB,OAJA96J,KAAK0kC,GAAG,SAAU36B,IAAUxI,EAAQwI,KACpC/J,KAAK0kC,GAAG,YAwBR,WACyB,OAAnBm2H,GAAyBzuB,EAAOvsG,EAAOyO,WAxB7CtuC,KAAK0kC,GAAG,SA2BR,WACyB,OAAnBm2H,GAAyBzuB,EAAO,SA1B/B,CACL,CAACK,KACC,OAAOzsI,MAET0mB,KAAK,IACI,IAAI8E,SAAQ,SAAUC,EAAS+c,GACpCqyH,EAAiBpvI,EACjBqvI,EAAgBtyH,EAChB,MAAM5nC,EAAOi/B,EAAOyO,OACP,OAAT1tC,EAAewrI,EAAOxrI,GACqB,IA7rBrC,EA6rBAi/B,EAAOg5H,eAAiCzsB,EAAO,SAG7DuuB,OAAO,IACEn1H,EAAQ,MAEjBu1H,MAAOhxJ,GACEy7B,EAAQz7B,IAYnB,SAASqiI,EAAQxrI,GACO,OAAlBk6J,IACAv5J,EAAOu5J,EAAcv5J,GACP,OAATX,GAAuD,IAArCi/B,EAAOg5H,aAAetB,GAAkBuD,EAAc7D,GAC5E4D,EAAe,CAAEp5J,MAAOb,EAAMm0B,KAAe,OAATn0B,IACzCk6J,EAAgBD,EAAiB,MAGnC,SAASr1H,EAASz7B,GAEhB,OADA81B,EAAO2F,QAAQz7B,GACR,IAAIyhB,SAAQ,CAACC,EAAS+c,KAC3B,GA3tBY,EA2tBR3I,EAAOg5H,aAA0B,OAAOptI,EAAQ,CAAEhqB,WAAO2G,EAAW2sB,MAAM,IAC9E8K,EAAO2E,KAAK,SAAS,WACfz6B,EAAKy+B,EAAOz+B,GACX0hB,EAAQ,CAAEhqB,WAAO2G,EAAW2sB,MAAM,YAiDjD,MAAMkM,UAAew7D,EACnBx6F,YAAag9B,GACXmC,MAAMnC,GAENj/B,KAAK64J,aArxBW,EAsxBhB74J,KAAK4vD,eAAiB,IAAIm+E,EAAc/tI,KAAMi/B,GAE1CA,IACEA,EAAK0wG,SAAQ3vI,KAAK4vI,QAAU3wG,EAAK0wG,QACjC1wG,EAAKh8B,QAAOjD,KAAKwsC,OAASvN,EAAKh8B,OAC/Bg8B,EAAKse,QAAOv9C,KAAKs9C,OAASre,EAAKse,QAIvCqyF,QAASorB,EAAOjyH,GACdA,EAAG,MAGLyD,OAAQ5rC,EAAMmoC,GACZ/oC,KAAK4vD,eAAekpG,UAAUl4J,EAAMmoC,GAGtCuU,OAAQvU,GACNA,EAAG,MAGL9lC,MAAOrC,GAEL,OADAZ,KAAK4vD,eAAe2pG,iBACbv5J,KAAK4vD,eAAe7qD,KAAKnE,GAGlC8M,IAAK9M,GAGH,OAFAZ,KAAK4vD,eAAe2pG,iBACpBv5J,KAAK4vD,eAAeliD,IAAI9M,GACjBZ,MAIX,MAAM+2C,UAAkB9V,EACtBh/B,YAAag9B,GACXmC,MAAMnC,GACNj/B,KAAKitI,gBAAkB,IAAIitB,EAAel6J,MAEtCi/B,IACEA,EAAK/hB,YAAWld,KAAKq3C,WAAapY,EAAK/hB,WACvC+hB,EAAKggB,QAAOj/C,KAAKy3C,OAASxY,EAAKggB,QAIvCzS,OAAQ5rC,EAAMmoC,GACR/oC,KAAKw3F,eAAeigB,UAAYz3G,KAAKw3F,eAAeusB,cACtD/jH,KAAKitI,gBAAgBrsI,KAAOA,EAE5BZ,KAAKq3C,WAAWz2C,EAAMZ,KAAKitI,gBAAgBF,gBAI/C9iG,MAAOlB,GACL,GAAkC,OAA9B/oC,KAAKitI,gBAAgBrsI,KAAe,CACtC,MAAMA,EAAOZ,KAAKitI,gBAAgBrsI,KAClCZ,KAAKitI,gBAAgBrsI,KAAO,KAC5BmoC,EAAG,MACH/oC,KAAKq3C,WAAWz2C,EAAMZ,KAAKitI,gBAAgBF,qBAE3ChkG,EAAG,MAIPsO,WAAYz2C,EAAMmoC,GAChBA,EAAG,KAAMnoC,GAGX62C,OAAQ1O,GACNA,EAAG,MAGLuU,OAAQvU,GACN/oC,KAAKitI,gBAAgBksB,WAAapwH,EAClC/oC,KAAKy3C,OAAOwjH,EAAoBjxI,KAAKhqB,QAMzC,SAASi7J,EAAqBlxJ,EAAKnJ,GACjC,MAAMmoC,EAAK/oC,KAAKitI,gBAAgBksB,WAChC,GAAIpvJ,EAAK,OAAOg/B,EAAGh/B,GACfnJ,MAAAA,GAAqCZ,KAAK+E,KAAKnE,GACnDZ,KAAK+E,KAAK,MACVgkC,EAAG,MAYL,SAAS8pG,EAAUhzG,KAAW0mC,GAC5B,MAAM6nC,EAAM1sG,MAAMC,QAAQk+B,GAAU,IAAIA,KAAW0mC,GAAW,CAAC1mC,KAAW0mC,GACpExxC,EAAQq5E,EAAI9sG,QAAyC,mBAAxB8sG,EAAIA,EAAI9sG,OAAS,GAAqB8sG,EAAIr8E,MAAQ,KAErF,GAAIq8E,EAAI9sG,OAAS,EAAG,MAAM,IAAIrC,MAAM,wCAEpC,IAAI24C,EAAMw2D,EAAI,GACVj8F,EAAO,KACP5Q,EAAQ,KAEZ,IAAK,IAAI8J,EAAI,EAAGA,EAAI+iG,EAAI9sG,OAAQ+J,IAC9B8G,EAAOi8F,EAAI/iG,GAEPwuJ,EAAUjiH,GACZA,EAAIutB,KAAKhzD,EAAM63C,IAEfkxG,EAAYtjH,GAAK,EAAMvsC,EAAI,EAAG2+C,GAC9BpS,EAAIutB,KAAKhzD,IAGXylC,EAAMzlC,EAGR,GAAI4iB,EAAM,CACR,IAAI0oC,GAAM,EAEVtrD,EAAKuyB,GAAG,UAAU,KAAQ+4B,GAAM,KAChCtrD,EAAKuyB,GAAG,SAAS36B,IAASxI,EAAQA,GAASwI,KAC3CoI,EAAKuyB,GAAG,SAAS,IAAM3P,EAAKxzB,IAAUk8D,EAAM,KAAOy5F,MAGrD,OAAO/kJ,EAEP,SAAS+oJ,EAAa/9I,EAAGg+I,EAAIC,EAAIpxG,GAC/B7sC,EAAEunB,GAAG,QAASslB,GACd7sC,EAAEunB,GAAG,SAEL,WACE,OAAIy2H,GAAMh+I,EAAEq6E,iBAAmBr6E,EAAEq6E,eAAe3nC,OAC5CurG,GAAMj+I,EAAEyyC,iBAAmBzyC,EAAEyyC,eAAeC,MADc7F,EAAQktG,QACtE,KAIJ,SAASltG,EAASjgD,GAChB,GAAKA,IAAOxI,EAAZ,CACAA,EAAQwI,EAER,IAAK,MAAMoT,KAAKixF,EACdjxF,EAAEqoB,QAAQz7B,KAKhB,SAASm6I,EAAUrkH,GACjB,QAASA,EAAO23D,kBAAoB33D,EAAO+vB,eAG7C,SAASiqG,EAAWh6H,GAClB,MAAsC,iBAAxBA,EAAOg5H,cAA6B3U,EAASrkH,GAW7D,SAAS64H,EAAmB93J,GAC1B,OALF,SAAuBA,GACrB,MAAuB,iBAATA,GAA8B,OAATA,GAA4C,iBAApBA,EAAKmB,WAIzDuuG,CAAa1vG,GAAQA,EAAKmB,WAAa,KAGhD,SAASgkC,KAET,SAASoyD,IACPn4F,KAAKwlC,QAAQ,IAAIvmC,MAAM,oBAGzBR,EAAOC,QAAU,CACfm0I,SAAAA,EACAwoB,gBA1FF,YAA6B90F,GAC3B,OAAO,IAAI/6C,SAAQ,CAACC,EAAS+c,IACpBqqG,KAAYtsE,GAAUx8D,IAC3B,GAAIA,EAAK,OAAOy+B,EAAOz+B,GACvB0hB,UAuFJy4H,SAAAA,EACA2V,UAAAA,EACAxxB,OAAAA,EACA7kF,SApOF,cAAuB6kF,EACrBpmI,YAAag9B,GACXmC,MAAMnC,GAENj/B,KAAK64J,cAAgB2B,KACrBx6J,KAAK4vD,eAAiB,IAAIm+E,EAAc/tI,KAAMi/B,GAE1CA,IACEA,EAAK0wG,SAAQ3vI,KAAK4vI,QAAU3wG,EAAK0wG,QACjC1wG,EAAKh8B,QAAOjD,KAAKwsC,OAASvN,EAAKh8B,OAC/Bg8B,EAAKse,QAAOv9C,KAAKs9C,OAASre,EAAKse,QAIvCqyF,QAASorB,EAAOjyH,GACdA,EAAG,MAGLyD,OAAQ5rC,EAAMmoC,GACZ/oC,KAAK4vD,eAAekpG,UAAUl4J,EAAMmoC,GAGtCuU,OAAQvU,GACNA,EAAG,MAGL0sC,uBAAwBr3D,GACtB,OAAyD,IA7qB3Bk9I,SA6qBtBl9I,EAAGy6I,cAGb51J,MAAOrC,GAEL,OADAZ,KAAK4vD,eAAe2pG,iBACbv5J,KAAK4vD,eAAe7qD,KAAKnE,GAGlC8M,IAAK9M,GAGH,OAFAZ,KAAK4vD,eAAe2pG,iBACpBv5J,KAAK4vD,eAAeliD,IAAI9M,GACjBZ,OA+LTy8F,SAAAA,EACAx7D,OAAAA,EACA8V,UAAAA,EAEAiuB,YA7GF,cAA0BjuB,kCCt1B1B,IAAI71C,EAAS,eAGTuvD,EAAavvD,EAAOuvD,YAAc,SAAUz0B,GAE9C,QADAA,EAAW,GAAKA,IACIA,EAAS6L,eAC3B,IAAK,MAAM,IAAK,OAAO,IAAK,QAAQ,IAAK,QAAQ,IAAK,SAAS,IAAK,SAAS,IAAK,OAAO,IAAK,QAAQ,IAAK,UAAU,IAAK,WAAW,IAAK,MACxI,OAAO,EACT,QACE,OAAO,IA4Cb,SAASk1B,EAAc/gC,GAErB,IAAIg2G,EACJ,OAFAhyI,KAAKg8B,SAXP,SAA2Bv7B,GACzB,IAAI86J,EA/BN,SAA4B96J,GAC1B,IAAKA,EAAK,MAAO,OAEjB,IADA,IAAI+6J,IAEF,OAAQ/6J,GACN,IAAK,OACL,IAAK,QACH,MAAO,OACT,IAAK,OACL,IAAK,QACL,IAAK,UACL,IAAK,WACH,MAAO,UACT,IAAK,SACL,IAAK,SACH,MAAO,SACT,IAAK,SACL,IAAK,QACL,IAAK,MACH,OAAOA,EACT,QACE,GAAI+6J,EAAS,OACb/6J,GAAO,GAAKA,GAAKonC,cACjB2zH,GAAU,GAQLC,CAAmBh7J,GAC9B,GAAoB,iBAAT86J,IAAsBr6J,EAAOuvD,aAAeA,IAAeA,EAAWhwD,IAAO,MAAM,IAAIxB,MAAM,qBAAuBwB,GAC/H,OAAO86J,GAAQ96J,EAQCi7J,CAAkB1/H,GAE1Bh8B,KAAKg8B,UACX,IAAK,UACHh8B,KAAK4vH,KAAO+rC,EACZ37J,KAAK0N,IAAMkuJ,EACX5pB,EAAK,EACL,MACF,IAAK,OACHhyI,KAAK67J,SAAWC,EAChB9pB,EAAK,EACL,MACF,IAAK,SACHhyI,KAAK4vH,KAAOmsC,EACZ/7J,KAAK0N,IAAMsuJ,EACXhqB,EAAK,EACL,MACF,QAGE,OAFAhyI,KAAKiD,MAAQg5J,OACbj8J,KAAK0N,IAAMwuJ,GAGfl8J,KAAKm8J,SAAW,EAChBn8J,KAAKo8J,UAAY,EACjBp8J,KAAKq8J,SAAWn7J,EAAOkpC,YAAY4nG,GAoCrC,SAASsqB,EAAch9H,GACrB,OAAIA,GAAQ,IAAa,EAAWA,GAAQ,GAAM,EAAa,EAAWA,GAAQ,GAAM,GAAa,EAAWA,GAAQ,GAAM,GAAa,EACpIA,GAAQ,GAAM,GAAQ,GAAK,EA2DpC,SAASw8H,EAAa9wJ,GACpB,IAAIwE,EAAIxP,KAAKo8J,UAAYp8J,KAAKm8J,SAC1BxrJ,EAtBN,SAA6BgC,EAAM3H,EAAKwE,GACtC,GAAwB,MAAV,IAATxE,EAAI,IAEP,OADA2H,EAAKwpJ,SAAW,EACT,IAET,GAAIxpJ,EAAKwpJ,SAAW,GAAKnxJ,EAAI1J,OAAS,EAAG,CACvC,GAAwB,MAAV,IAAT0J,EAAI,IAEP,OADA2H,EAAKwpJ,SAAW,EACT,IAET,GAAIxpJ,EAAKwpJ,SAAW,GAAKnxJ,EAAI1J,OAAS,GACZ,MAAV,IAAT0J,EAAI,IAEP,OADA2H,EAAKwpJ,SAAW,EACT,KASLI,CAAoBv8J,KAAMgL,GAClC,YAAU5C,IAANuI,EAAwBA,EACxB3Q,KAAKm8J,UAAYnxJ,EAAI1J,QACvB0J,EAAI9H,KAAKlD,KAAKq8J,SAAU7sJ,EAAG,EAAGxP,KAAKm8J,UAC5Bn8J,KAAKq8J,SAASpwJ,SAASjM,KAAKg8B,SAAU,EAAGh8B,KAAKo8J,aAEvDpxJ,EAAI9H,KAAKlD,KAAKq8J,SAAU7sJ,EAAG,EAAGxE,EAAI1J,aAClCtB,KAAKm8J,UAAYnxJ,EAAI1J,SA2BvB,SAASq6J,EAAU3wJ,EAAKK,GACtB,IAAKL,EAAI1J,OAAS+J,GAAK,GAAM,EAAG,CAC9B,IAAIsF,EAAI3F,EAAIiB,SAAS,UAAWZ,GAChC,GAAIsF,EAAG,CACL,IAAIH,EAAIG,EAAEtC,WAAWsC,EAAErP,OAAS,GAChC,GAAIkP,GAAK,OAAUA,GAAK,MAKtB,OAJAxQ,KAAKm8J,SAAW,EAChBn8J,KAAKo8J,UAAY,EACjBp8J,KAAKq8J,SAAS,GAAKrxJ,EAAIA,EAAI1J,OAAS,GACpCtB,KAAKq8J,SAAS,GAAKrxJ,EAAIA,EAAI1J,OAAS,GAC7BqP,EAAE/N,MAAM,GAAI,GAGvB,OAAO+N,EAKT,OAHA3Q,KAAKm8J,SAAW,EAChBn8J,KAAKo8J,UAAY,EACjBp8J,KAAKq8J,SAAS,GAAKrxJ,EAAIA,EAAI1J,OAAS,GAC7B0J,EAAIiB,SAAS,UAAWZ,EAAGL,EAAI1J,OAAS,GAKjD,SAASs6J,EAAS5wJ,GAChB,IAAI2F,EAAI3F,GAAOA,EAAI1J,OAAStB,KAAKiD,MAAM+H,GAAO,GAC9C,GAAIhL,KAAKm8J,SAAU,CACjB,IAAIzuJ,EAAM1N,KAAKo8J,UAAYp8J,KAAKm8J,SAChC,OAAOxrJ,EAAI3Q,KAAKq8J,SAASpwJ,SAAS,UAAW,EAAGyB,GAElD,OAAOiD,EAGT,SAASorJ,EAAW/wJ,EAAKK,GACvB,IAAI2S,GAAKhT,EAAI1J,OAAS+J,GAAK,EAC3B,OAAU,IAAN2S,EAAgBhT,EAAIiB,SAAS,SAAUZ,IAC3CrL,KAAKm8J,SAAW,EAAIn+I,EACpBhe,KAAKo8J,UAAY,EACP,IAANp+I,EACFhe,KAAKq8J,SAAS,GAAKrxJ,EAAIA,EAAI1J,OAAS,IAEpCtB,KAAKq8J,SAAS,GAAKrxJ,EAAIA,EAAI1J,OAAS,GACpCtB,KAAKq8J,SAAS,GAAKrxJ,EAAIA,EAAI1J,OAAS,IAE/B0J,EAAIiB,SAAS,SAAUZ,EAAGL,EAAI1J,OAAS0c,IAGhD,SAASg+I,EAAUhxJ,GACjB,IAAI2F,EAAI3F,GAAOA,EAAI1J,OAAStB,KAAKiD,MAAM+H,GAAO,GAC9C,OAAIhL,KAAKm8J,SAAiBxrJ,EAAI3Q,KAAKq8J,SAASpwJ,SAAS,SAAU,EAAG,EAAIjM,KAAKm8J,UACpExrJ,EAIT,SAASsrJ,EAAYjxJ,GACnB,OAAOA,EAAIiB,SAASjM,KAAKg8B,UAG3B,SAASkgI,EAAUlxJ,GACjB,OAAOA,GAAOA,EAAI1J,OAAStB,KAAKiD,MAAM+H,GAAO,GAzN/CtM,EAAQ,EAAgBq+D,EA6BxBA,EAAc98D,UAAUgD,MAAQ,SAAU+H,GACxC,GAAmB,IAAfA,EAAI1J,OAAc,MAAO,GAC7B,IAAIqP,EACAtF,EACJ,GAAIrL,KAAKm8J,SAAU,CAEjB,QAAU/zJ,KADVuI,EAAI3Q,KAAK67J,SAAS7wJ,IACG,MAAO,GAC5BK,EAAIrL,KAAKm8J,SACTn8J,KAAKm8J,SAAW,OAEhB9wJ,EAAI,EAEN,OAAIA,EAAIL,EAAI1J,OAAeqP,EAAIA,EAAI3Q,KAAK4vH,KAAK5kH,EAAKK,GAAKrL,KAAK4vH,KAAK5kH,EAAKK,GAC/DsF,GAAK,IAGdosD,EAAc98D,UAAUyN,IAwGxB,SAAiB1C,GACf,IAAI2F,EAAI3F,GAAOA,EAAI1J,OAAStB,KAAKiD,MAAM+H,GAAO,GAC9C,OAAIhL,KAAKm8J,SAAiBxrJ,EAAI,IACvBA,GAxGTosD,EAAc98D,UAAU2vH,KA0FxB,SAAkB5kH,EAAKK,GACrB,IAAIwG,EArEN,SAA6Bc,EAAM3H,EAAKK,GACtC,IAAIC,EAAIN,EAAI1J,OAAS,EACrB,GAAIgK,EAAID,EAAG,OAAO,EAClB,IAAI2mI,EAAKsqB,EAActxJ,EAAIM,IAC3B,OAAI0mI,GAAM,GACJA,EAAK,IAAGr/H,EAAKwpJ,SAAWnqB,EAAK,GAC1BA,KAEH1mI,EAAID,IAAa,IAAR2mI,EAAkB,GACjCA,EAAKsqB,EAActxJ,EAAIM,MACb,GACJ0mI,EAAK,IAAGr/H,EAAKwpJ,SAAWnqB,EAAK,GAC1BA,KAEH1mI,EAAID,IAAa,IAAR2mI,EAAkB,GACjCA,EAAKsqB,EAActxJ,EAAIM,MACb,GACJ0mI,EAAK,IACI,IAAPA,EAAUA,EAAK,EAAOr/H,EAAKwpJ,SAAWnqB,EAAK,GAE1CA,GAEF,EA+CKwqB,CAAoBx8J,KAAMgL,EAAKK,GAC3C,IAAKrL,KAAKm8J,SAAU,OAAOnxJ,EAAIiB,SAAS,OAAQZ,GAChDrL,KAAKo8J,UAAYvqJ,EACjB,IAAInE,EAAM1C,EAAI1J,QAAUuQ,EAAQ7R,KAAKm8J,UAErC,OADAnxJ,EAAI9H,KAAKlD,KAAKq8J,SAAU,EAAG3uJ,GACpB1C,EAAIiB,SAAS,OAAQZ,EAAGqC,IA7FjCqvD,EAAc98D,UAAU47J,SAAW,SAAU7wJ,GAC3C,GAAIhL,KAAKm8J,UAAYnxJ,EAAI1J,OAEvB,OADA0J,EAAI9H,KAAKlD,KAAKq8J,SAAUr8J,KAAKo8J,UAAYp8J,KAAKm8J,SAAU,EAAGn8J,KAAKm8J,UACzDn8J,KAAKq8J,SAASpwJ,SAASjM,KAAKg8B,SAAU,EAAGh8B,KAAKo8J,WAEvDpxJ,EAAI9H,KAAKlD,KAAKq8J,SAAUr8J,KAAKo8J,UAAYp8J,KAAKm8J,SAAU,EAAGnxJ,EAAI1J,QAC/DtB,KAAKm8J,UAAYnxJ,EAAI1J,wBChHvB,IAAI8yG,EAAS,EAAQ,KAErB11G,EAAQqC,OAASqzG,EAAOrzG,OACxBrC,EAAQiC,OAASyzG,EAAOzzG,wDCDpB87J,EAAY,CACZ,IAAM,IAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAC1C,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAAM,IAC1C,IAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1C,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,GAAM,GAC1C,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAC1C,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,IAC1C,IAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAAM,EAC1C,EAAM,EAAM,EAAM,GAAM,GAAM,GAAM,GAAM,GAC1C,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAAM,GAC1C,GAAM,GAAM,GAAM,IAAM,IAAM,IAAM,IAAM,KAQ9C/9J,EAAQqC,OAAS,SAAS27J,GAClBx7J,EAAOE,SAASs7J,KACnBA,EAAQ,IAAIx7J,EAAOw7J,IAUpB,IARA,IATkBl3E,EACdm3E,EAQAtxJ,EAAI,EACJC,EAAI,EACJsxJ,EAAa,EACbC,EAAQ,EACRC,EAAU,IAAI57J,EAA6B,GAb7BskF,EAaoBk3E,EAZlCC,EAAW7rJ,KAAK6gB,MAAM6zD,EAAKlkF,OAAS,GACjCkkF,EAAKlkF,OAAS,GAAM,EAAIq7J,EAAUA,EAAW,IAe9CtxJ,EAAIqxJ,EAAMp7J,QAAQ,CACpB,IAAI4lB,EAAUw1I,EAAMrxJ,GAEjBuxJ,EAAa,GAGZC,GAFAA,EAAQ31I,EAAW,KAAQ01I,KAC3BA,GAAcA,EAAa,GAAK,IACEvxJ,EAAI,EAAIqxJ,EAAMp7J,OAC5Co7J,EAAMrxJ,EAAI,GAAK,IAAO,EAAIuxJ,EAC9BvxJ,MAEAwxJ,EAAS31I,GAAY,GAAK01I,EAAa,GAAO,GAE5B,IADlBA,GAAcA,EAAa,GAAK,IACXvxJ,KAGzByxJ,EAAQxxJ,GA9CA,mCA8Ce+C,WAAWwuJ,GAClCvxJ,IAGJ,IAAID,EAAIC,EAAGD,EAAIyxJ,EAAQx7J,OAAQ+J,IAC3ByxJ,EAAQzxJ,GAAK,GAGjB,OAAOyxJ,GAGXp+J,EAAQiC,OAAS,SAASm8J,GACtB,IAEIC,EAFAH,EAAa,EACbI,EAAa,EAEbC,EAAW,EACX/7J,EAAOE,SAAS07J,KACnBA,EAAU,IAAI57J,EAAO47J,IAMtB,IAJA,IAAII,EAAU,IAAIh8J,EAAO4P,KAAKS,KAAsB,EAAjBurJ,EAAQx7J,OAAa,IAIhD+J,EAAI,EAAGA,EAAIyxJ,EAAQx7J,QACR,KAAfw7J,EAAQzxJ,GADuBA,IAAK,CAKpC,IAAI8xJ,EAAcL,EAAQzxJ,GAAK,GAE/B,KAAG8xJ,EAAcV,EAAUn7J,QAuB1B,MAAM,IAAIrC,MAAM,mDAtBb+9J,EAAaP,EAAUU,GAEpBP,GAAc,EAGK,IAFlBA,GAAcA,EAAa,GAAK,IAG5BG,GAAaC,EACbE,EAAQD,GAAYF,EACpBE,IACAF,EAAY,GAEZA,GAAa,IAAQC,GAAe,EAAIJ,GAI5CG,GAAa,IAAQC,KADrBJ,GAAcA,EAAa,GAAK,GAEhCM,EAAQD,GAAYF,EACpBE,IAEAF,EAAY,IAAQC,GAAe,EAAIJ,GAOnD,OAAOM,EAAQt6J,MAAM,EAAGq6J,oBC9H5B,IAAI/7J,EAAS,eAEbzC,EAAOC,QAAU,SAAUsM,GAE1B,GAAIA,aAAe2sB,WAAY,CAE9B,GAAuB,IAAnB3sB,EAAI4sB,YAAoB5sB,EAAIjJ,aAAeiJ,EAAIO,OAAOxJ,WACzD,OAAOiJ,EAAIO,OACL,GAAgC,mBAArBP,EAAIO,OAAO3I,MAE5B,OAAOoI,EAAIO,OAAO3I,MAAMoI,EAAI4sB,WAAY5sB,EAAI4sB,WAAa5sB,EAAIjJ,YAI/D,GAAIb,EAAOE,SAAS4J,GAAM,CAKzB,IAFA,IAAIoyJ,EAAY,IAAIzlI,WAAW3sB,EAAI1J,QAC/B8J,EAAMJ,EAAI1J,OACL+J,EAAI,EAAGA,EAAID,EAAKC,IACxB+xJ,EAAU/xJ,GAAKL,EAAIK,GAEpB,OAAO+xJ,EAAU7xJ,OAEjB,MAAM,IAAItM,MAAM,4DCvBlB,MAAMwgC,EAAQ,EAAQ,KAAR,CAAiB,qBACzB49H,EAAM,EAAQ,MACdzuH,EAAe,qBACfC,EAAW,EAAQ,MACnBoD,EAAU,EAAQ,MAClBqrH,EAAM,EAAQ,MAuNpB7+J,EAAOC,QArNP,cAAwBkwC,EACtB3sC,YAAag9B,GAGX,GAFAmC,SAEKnC,EAAKsC,OAAQ,MAAM,IAAItiC,MAAM,+BAClC,IAAKggC,EAAK2H,SAAU,MAAM,IAAI3nC,MAAM,iCACpC,IAAK4qB,EAAQylB,UAAYrQ,EAAKkK,KAAM,MAAM,IAAIlqC,MAAM,6BAEpDe,KAAKuhC,OAAgC,iBAAhBtC,EAAKsC,OACtBtC,EAAKsC,OACLtC,EAAKsC,OAAOt1B,SAAS,OACzBjM,KAAK4mC,SAAoC,iBAAlB3H,EAAK2H,SACxB3H,EAAK2H,SAASiB,cACd5I,EAAK2H,SAAS36B,SAAS,OAC3BjM,KAAK2vC,MAAQ1Q,EAAKkK,KAClBnpC,KAAKgwC,WAAa/Q,EAAKgR,UAEvBjwC,KAAKmjC,WAAY,EAEjBnjC,KAAKgxC,UAAY/R,EAAKoQ,UAAY,GAClCrvC,KAAKu9J,YAAct+H,EAAKqS,YAAc,IACtCtxC,KAAKw9J,aAAe,KACpBx9J,KAAKy9J,gBAAiB,EACtBz9J,KAAK09J,aAAc,EACnB19J,KAAK29J,cAAe,EAEpB39J,KAAK49J,WAAa7zJ,IAChB/J,KAAKylC,KAAK,UAAW17B,IAEvB/J,KAAK69J,SAAW9zJ,IACd/J,KAAKylC,KAAK,QAAS17B,IAErB/J,KAAK89J,WAAa,CAAC3qH,EAAMvM,KACnBA,EAAS36B,SAAS,SAAWjM,KAAK4mC,UACtC5mC,KAAKylC,KAAK,OAAQ,GAAG0N,EAAKyxG,QAAQzxG,EAAKhK,OAAQ,QAEjDnpC,KAAK+9J,eAAiB5qH,IACpBnzC,KAAKylC,KAAK,OAAQ0N,EAAM,YAE1BnzC,KAAKg+J,mBAAqB,KACxBh+J,KAAKylC,KAAK,oBAEZzlC,KAAKi+J,WAAa,CAAC9qH,EAAMvM,KACvB5mC,KAAKylC,KAAK,OAAQ0N,EAAM,QAG1B,MAAM+qH,EAAY,CAAC/0H,EAAMlK,KACvB,MAAM+I,EAAM,IAAIq1H,EAAIp+H,GAKpB,OAJA+I,EAAItD,GAAG,UAAW1kC,KAAK49J,YACvB51H,EAAItD,GAAG,QAAS1kC,KAAK69J,UACrB71H,EAAIm2H,OAAOh1H,GACXnpC,KAAK29J,cAAe,EACb31H,IAGY,IAAjB/I,EAAKgS,QACPjxC,KAAKixC,QAAU,KACNhS,EAAKgS,SAAmC,iBAAjBhS,EAAKgS,SACrCjxC,KAAKw9J,aAAeh4J,OAAO+iB,OAAO,GAAI0W,EAAKgS,SAC3CjxC,KAAKixC,QAAUjxC,KAAKo+J,kBAEpBp+J,KAAKixC,QAAUjxC,KAAKo+J,kBAGL,IAAbn/H,EAAK+I,KAAgC,mBAARq1H,EAC/Br9J,KAAKgoC,IAAM,KACF/I,EAAK+I,KAAmC,mBAArB/I,EAAK+I,IAAIq2H,QACrCr+J,KAAKgoC,IAAM/I,EAAK+I,IACP/I,EAAK+I,KAA2B,iBAAb/I,EAAK+I,IACjChoC,KAAKgoC,IAAMk2H,EAAUj/H,EAAKq/H,QAASr/H,EAAK+I,KAExChoC,KAAKgoC,IAAMk2H,EAAUj/H,EAAKq/H,SAGxBt+J,KAAKgoC,MACPhoC,KAAKgoC,IAAItD,GAAG,OAAQ1kC,KAAK89J,YACzB99J,KAAKu+J,iBAGU,IAAbt/H,EAAKu/H,KAAgC,mBAARlB,EAC/Bt9J,KAAKw+J,IAAM,KAEXx+J,KAAKw+J,IAAMx+J,KAAKy+J,aAIpBC,WAAYv1H,GACNA,IAASnpC,KAAK2vC,QAClB3vC,KAAK2vC,MAAQxG,EAETnpC,KAAKgoC,KAAKhoC,KAAKu+J,eAEfv+J,KAAKixC,UACPjxC,KAAKixC,QAAQC,OACblxC,KAAKixC,QAAQzL,SAAQ,KACnBxlC,KAAKixC,QAAUjxC,KAAKo+J,sBAK1BjtH,SAAUlS,GACJj/B,KAAKixC,SACPjxC,KAAKixC,QAAQE,SAASlS,GAI1BuG,QAASuD,GACP,GAAI/oC,KAAKmjC,UAAW,OACpBnjC,KAAKmjC,WAAY,EAEjBwJ,aAAa3sC,KAAK09J,aAElB,MAAMnsH,EAAQ,GAEVvxC,KAAKixC,UACPjxC,KAAKixC,QAAQC,OACblxC,KAAKixC,QAAQoC,eAAe,UAAWrzC,KAAK49J,YAC5C59J,KAAKixC,QAAQoC,eAAe,QAASrzC,KAAK69J,UAC1C79J,KAAKixC,QAAQoC,eAAe,OAAQrzC,KAAK+9J,gBACzC/9J,KAAKixC,QAAQoC,eAAe,SAAUrzC,KAAKg+J,oBAC3CzsH,EAAMxsC,MAAKgkC,IACT/oC,KAAKixC,QAAQzL,QAAQuD,OAIrB/oC,KAAKgoC,KACPhoC,KAAKgoC,IAAIqL,eAAe,OAAQrzC,KAAK89J,YAGnC99J,KAAK29J,eACP39J,KAAKgoC,IAAIqL,eAAe,UAAWrzC,KAAK49J,YACxC59J,KAAKgoC,IAAIqL,eAAe,QAASrzC,KAAK69J,UACtCtsH,EAAMxsC,MAAKgkC,IACT/oC,KAAKgoC,IAAIxC,QAAQuD,OAIjB/oC,KAAKw+J,MACPx+J,KAAKw+J,IAAInrH,eAAe,UAAWrzC,KAAK49J,YACxC59J,KAAKw+J,IAAInrH,eAAe,QAASrzC,KAAK69J,UACtC79J,KAAKw+J,IAAInrH,eAAe,OAAQrzC,KAAKi+J,YACrC1sH,EAAMxsC,MAAKgkC,IACT/oC,KAAKw+J,IAAIh5H,QAAQuD,OAIrB8F,EAAS0C,EAAOxI,GAGhB/oC,KAAKgoC,IAAM,KACXhoC,KAAKixC,QAAU,KACfjxC,KAAKw+J,IAAM,KACXx+J,KAAKgxC,UAAY,KAGnBotH,iBACE,MAAMn/H,EAAOz5B,OAAO+iB,OAAO,GAAIvoB,KAAKw9J,aAAc,CAChD52H,SAAU5mC,KAAK4mC,SACfyI,SAAUrvC,KAAKgxC,UACfzP,OAAQvhC,KAAKuhC,OACb4H,KAAMnpC,KAAK2vC,MACXM,UAAWjwC,KAAKgwC,aAGZiB,EAAU,IAAIgB,EAAQhT,GAO5B,OANAgS,EAAQvM,GAAG,UAAW1kC,KAAK49J,YAC3B3sH,EAAQvM,GAAG,QAAS1kC,KAAK69J,UACzB5sH,EAAQvM,GAAG,OAAQ1kC,KAAK+9J,gBACxB9sH,EAAQvM,GAAG,SAAU1kC,KAAKg+J,oBAC1B/sH,EAAQhM,YAAYjlC,KAAKu9J,aACzBtsH,EAAQpqC,QACDoqC,EAGTstH,eACMv+J,KAAKy9J,iBACTh+H,EAAM,gBAENz/B,KAAKy9J,gBAAiB,EACtB9wH,aAAa3sC,KAAK09J,aAElB19J,KAAKgoC,IAAIqH,SAASrvC,KAAK4mC,SAAU5mC,KAAK2vC,OAAO5lC,IAC3C/J,KAAKy9J,gBAAiB,EACtBh+H,EAAM,yBAEF11B,GAAK/J,KAAKylC,KAAK,UAAW17B,GAC9B/J,KAAKylC,KAAK,eAELzlC,KAAKmjC,YACRnjC,KAAK09J,YAAcv4H,YAAW,KAC5BnlC,KAAKu+J,iBACJv+J,KAAKu9J,YAAczsJ,KAAK6gB,MAAM7gB,KAAKw1B,SAAWtmC,KAAKu9J,YAAc,IAChEv9J,KAAK09J,YAAYr4H,OAAOrlC,KAAK09J,YAAYr4H,aAKnDo5H,aACE,MAAMx/H,EAAOz5B,OAAO+iB,OAAO,GAAI,CAC7Bqe,SAAU5mC,KAAK4mC,SACfrF,OAAQvhC,KAAKuhC,OACb4H,KAAMnpC,KAAK2vC,QAGP6uH,EAAM,IAAIlB,EAAIr+H,GAKpB,OAJAu/H,EAAI95H,GAAG,UAAW1kC,KAAK49J,YACvBY,EAAI95H,GAAG,QAAS1kC,KAAK69J,UACrBW,EAAI95H,GAAG,OAAQ1kC,KAAKi+J,YACpBO,EAAI33J,QACG23J,yCCxNX,MAAMG,EAAe,MAErB,MAAMC,EACJ38J,YAAaX,GACXtB,KAAKsB,OAASA,EACdtB,KAAK6+J,QAAUv9J,EACftB,KAAK8nH,QAAU,KAEf9nH,KAAK8+J,QAAUhuJ,KAAKS,KAAKjQ,EAASq9J,GAClC3+J,KAAK++J,WAAcz9J,EAASq9J,GAAiBA,EAC7C3+J,KAAKm3C,UAAY,EACjBn3C,KAAKujC,QAAU,KACfvjC,KAAKg/J,eAAiB,KACtBh/J,KAAKi/J,cAAgB,EACrBj/J,KAAKk/J,UAAW,EAGlBnkG,YAAa1vD,GACX,OAAOA,IAAMrL,KAAK8+J,QAAU,EAAI9+J,KAAK++J,WAAaJ,EAGpDQ,qBAAsB9zJ,GACpB,OAAOrL,KAAKsB,OAAU+J,EAAIszJ,EAG5BxlB,YAAa9tI,GACX,OAAOA,EAAIszJ,EAGbS,UACE,OAAKp/J,KAAKiqD,OACNjqD,KAAKg/J,eAAe19J,OAAetB,KAAKg/J,eAAejtI,MACvD/xB,KAAKi/J,cAAgBj/J,KAAK8+J,QAAgB9+J,KAAKi/J,iBAC3C,GAHkB,EAM5BI,mBACE,IAAKr/J,KAAKiqD,OAAQ,OAAQ,EAC1B,GAAIjqD,KAAKg/J,eAAe19J,QAAUtB,KAAKi/J,cAAgBj/J,KAAK8+J,QAAS,CACnE,IAAI/xJ,EAAM/M,KAAKi/J,cACf,KAAOj/J,KAAKg/J,eAAe19J,QACzByL,EAAM+D,KAAK/D,IAAIA,EAAK/M,KAAKg/J,eAAejtI,OAG1C,OADA/xB,KAAKi/J,cAAgBj/J,KAAK8+J,QACnB/xJ,EAET,OAAQ,EAGVi8B,OAAQ39B,GACDrL,KAAKiqD,QACVjqD,KAAKg/J,eAAej6J,KAAKsG,GAG3Bi0J,gBAAiBj0J,GACVrL,KAAKiqD,SACVjqD,KAAKi/J,cAAgB5zJ,GAGvBjM,IAAKiM,GACH,OAAKrL,KAAKiqD,OACHjqD,KAAKujC,QAAQl4B,GADK,KAI3BnM,IAAKmM,EAAGzK,EAAMmvB,GACZ,IAAK/vB,KAAKiqD,OAAQ,OAAO,EACzB,MAAM7+C,EAAMxK,EAAKU,OACXy7F,EAASjsF,KAAKS,KAAKnG,EAAMuzJ,GAC/B,IAAK,IAAIrzJ,EAAI,EAAGA,EAAIyxF,EAAQzxF,IAC1B,IAAKtL,KAAKujC,QAAQl4B,EAAIC,GAAI,CACxB,MAAMjK,EAASiK,EAAIqzJ,EACbY,EAAY3+J,EAAKgC,MAAMvB,EAAQA,EAASs9J,GAC9C3+J,KAAKm3C,YACLn3C,KAAKujC,QAAQl4B,EAAIC,GAAKi0J,EACtBv/J,KAAK6+J,SAAWU,EAAUj+J,OACrBtB,KAAK8nH,QAAQv/E,SAASxY,IACzB/vB,KAAK8nH,QAAQ/iH,KAAKgrB,GAIxB,OAAO/vB,KAAKm3C,YAAcn3C,KAAK8+J,QAGjC7/G,QACE,IAAKj/C,KAAKujC,SAAWvjC,KAAK8+J,UAAY9+J,KAAKm3C,UAAW,OAAO,KAC7D,MAAM5rC,EAASrK,EAAOqC,OAAOvD,KAAKujC,QAASvjC,KAAKsB,QAKhD,OAJAtB,KAAKujC,QAAU,KACfvjC,KAAKg/J,eAAiB,KACtBh/J,KAAK8nH,QAAU,KACf9nH,KAAKk/J,UAAW,EACT3zJ,EAGT0+C,OACE,OAAIjqD,KAAKk/J,WACLl/J,KAAKujC,UACTvjC,KAAKujC,QAAU,IAAI7hC,MAAM1B,KAAK8+J,SAC9B9+J,KAAKg/J,eAAiB,GACtBh/J,KAAK8nH,QAAU,KAHU,IAQ7BtiH,OAAO8nB,eAAesxI,EAAO,eAAgB,CAAEn9J,MAAOk9J,IAEtDlgK,EAAOC,QAAUkgK,uCCjGbtuD,EAAe,eAEnB7xG,EAAOC,QAAU,SAA6B61B,GAC5C,GAAI+7E,EAAa/7E,GAAM,CAErB,IAAIvpB,EAAM9J,EAAO2M,KAAK0mB,EAAIhpB,QAK1B,OAJIgpB,EAAIxyB,aAAewyB,EAAIhpB,OAAOxJ,aAEhCiJ,EAAMA,EAAIpI,MAAM2xB,EAAIqD,WAAYrD,EAAIqD,WAAarD,EAAIxyB,aAEhDiJ,EAGP,OAAO9J,EAAO2M,KAAK0mB,oBCtBvB,IAAIirI,EAAc,EAAQ,MAEtBC,EAAc3uJ,KAAKoB,IAAI,EAAG,IAE9BxT,EAAQ6+B,eAAiB,WACvB,OAAO,GAGT7+B,EAAQqC,OAAS,SAAU6E,EAAKoF,EAAK3J,GAC9B2J,IAAKA,EAAMw0J,EAAY,IACvBn+J,IAAQA,EAAS,GAEtB,IAAI+6F,EAAMtrF,KAAK6gB,MAAM/rB,EAAM65J,GACvBtvF,EAAMvqE,EAAMw2F,EAAMqjE,EAItB,OAFAz0J,EAAIq/B,cAAc+xD,EAAK/6F,GACvB2J,EAAIq/B,cAAc8lC,EAAK9uE,EAAS,GACzB2J,GAGTtM,EAAQiC,OAAS,SAAUqK,EAAK3J,GACzBA,IAAQA,EAAS,GAEtB,IAAI+6F,EAAMpxF,EAAImiC,aAAa9rC,GACvB8uE,EAAMnlE,EAAImiC,aAAa9rC,EAAS,GAEpC,OAAO+6F,EAAMqjE,EAActvF,GAG7BzxE,EAAQqC,OAAO2B,MAAQ,EACvBhE,EAAQiC,OAAO+B,MAAQ,YC9BvBjE,EAAOC,QAEP,SAAiB61B,EAAKlpB,GACpB,KAAIA,GAAKkpB,EAAIjzB,QAAU+J,EAAI,GAA3B,CACA,IAAI6zC,EAAO3qB,EAAIxC,MACf,GAAI1mB,EAAIkpB,EAAIjzB,OAAQ,CAClB,IAAIoL,EAAM6nB,EAAIlpB,GAEd,OADAkpB,EAAIlpB,GAAK6zC,EACFxyC,EAET,OAAOwyC,0BCVT,iBACE,SAAS21E,GAGsCn2H,GAC9CA,EAAQghK,SACoCjhK,GAC5CA,EAAOihK,SAHT,IAIIC,EAA8B,iBAAV,EAAA39I,GAAsB,EAAAA,EAE7C29I,EAAWxgG,SAAWwgG,GACtBA,EAAWtvJ,SAAWsvJ,GACtBA,EAAWhtJ,KAUZ,IAAIitJ,EAGJC,EAAS,WAGTrgK,EAAO,GAUPsgK,EAAgB,QAChBC,EAAgB,eAChBC,EAAkB,4BAGlBz2J,EAAS,CACR,SAAY,kDACZ,YAAa,iDACb,gBAAiB,iBAKlBooB,EAAQ7gB,KAAK6gB,MACbsuI,EAAqBp0J,OAAOC,aAa5B,SAASvK,EAAMyG,GACd,MAAMqsB,WAAW9qB,EAAOvB,IAWzB,SAASpG,EAAIyzB,EAAOpM,GAGnB,IAFA,IAAI3nB,EAAS+zB,EAAM/zB,OACf4E,EAAS,GACN5E,KACN4E,EAAO5E,GAAU2nB,EAAGoM,EAAM/zB,IAE3B,OAAO4E,EAaR,SAASg6J,EAAU3vJ,EAAQ0Y,GAC1B,IAAIwS,EAAQlrB,EAAOjD,MAAM,KACrBpH,EAAS,GAWb,OAVIu1B,EAAMn6B,OAAS,IAGlB4E,EAASu1B,EAAM,GAAK,IACpBlrB,EAASkrB,EAAM,IAMTv1B,EADOtE,GAFd2O,EAASA,EAAO3C,QAAQoyJ,EAAiB,MACrB1yJ,MAAM,KACA2b,GAAIpmB,KAAK,KAiBpC,SAASs9J,EAAW5vJ,GAMnB,IALA,IAGI9O,EACAquH,EAJAtpG,EAAS,GACT0+C,EAAU,EACV5jE,EAASiP,EAAOjP,OAGb4jE,EAAU5jE,IAChBG,EAAQ8O,EAAOlC,WAAW62D,OACb,OAAUzjE,GAAS,OAAUyjE,EAAU5jE,EAG3B,QAAX,OADbwuH,EAAQv/G,EAAOlC,WAAW62D,OAEzB1+C,EAAOzhB,OAAe,KAARtD,IAAkB,KAAe,KAARquH,GAAiB,QAIxDtpG,EAAOzhB,KAAKtD,GACZyjE,KAGD1+C,EAAOzhB,KAAKtD,GAGd,OAAO+kB,EAWR,SAAS45I,EAAW/qI,GACnB,OAAOzzB,EAAIyzB,GAAO,SAAS5zB,GAC1B,IAAI+kB,EAAS,GAOb,OANI/kB,EAAQ,QAEX+kB,GAAUy5I,GADVx+J,GAAS,SAC8B,GAAK,KAAQ,OACpDA,EAAQ,MAAiB,KAARA,GAElB+kB,EAAUy5I,EAAmBx+J,MAE3BoB,KAAK,IAoCT,SAASw9J,EAAaxD,EAAOrvG,GAG5B,OAAOqvG,EAAQ,GAAK,IAAMA,EAAQ,MAAgB,GAARrvG,IAAc,GAQzD,SAAS8yG,EAAM39I,EAAO49I,EAAWC,GAChC,IAAIxtJ,EAAI,EAGR,IAFA2P,EAAQ69I,EAAY7uI,EAAMhP,EA1LpB,KA0LoCA,GAAS,EACnDA,GAASgP,EAAMhP,EAAQ49I,GACO59I,EAAQ89I,IAA2BztJ,GAAKxT,EACrEmjB,EAAQgP,EAAMhP,EA3KAnjB,IA6Kf,OAAOmyB,EAAM3e,EAAI,GAAsB2P,GAASA,EAhM1C,KA0MP,SAAShiB,EAAOoF,GAEf,IAEIjD,EAIA49J,EACAp1J,EACA1B,EACA+2J,EACAnvJ,EACAwB,EACA6pJ,EACAtoJ,EAEAqsJ,EArEiB1sG,EAsDjB1tC,EAAS,GACTgL,EAAczrB,EAAMzE,OAEpB+J,EAAI,EACJ2S,EA7MM,IA8MN6iJ,EA/MS,GAoOb,KALAH,EAAQ36J,EAAM+sD,YA7NH,MA8NC,IACX4tG,EAAQ,GAGJp1J,EAAI,EAAGA,EAAIo1J,IAASp1J,EAEpBvF,EAAMsI,WAAW/C,IAAM,KAC1B/J,EAAM,aAEPilB,EAAOzhB,KAAKgB,EAAMsI,WAAW/C,IAM9B,IAAK1B,EAAQ82J,EAAQ,EAAIA,EAAQ,EAAI,EAAG92J,EAAQ4nB,GAAwC,CAOvF,IAAKmvI,EAAOt1J,EAAGmG,EAAI,EAAGwB,EAAIxT,EAErBoK,GAAS4nB,GACZjwB,EAAM,mBAGPs7J,GAxGmB3oG,EAwGEnuD,EAAMsI,WAAWzE,MAvGxB,GAAK,GACbsqD,EAAY,GAEhBA,EAAY,GAAK,GACbA,EAAY,GAEhBA,EAAY,GAAK,GACbA,EAAY,GAEb10D,IAgGQA,GAAQq9J,EAAQlrI,GAAOkuI,EAASx0J,GAAKmG,KACjDjQ,EAAM,YAGP8J,GAAKwxJ,EAAQrrJ,IAGTqrJ,GAFJtoJ,EAAIvB,GAAK6tJ,EAvQL,EAuQoB7tJ,GAAK6tJ,EAtQzB,MAsQ8C7tJ,EAAI6tJ,IAbH7tJ,GAAKxT,EAoBpDgS,EAAImgB,EAAMkuI,GADde,EAAaphK,EAAO+U,KAEnBhT,EAAM,YAGPiQ,GAAKovJ,EAKNC,EAAOP,EAAMj1J,EAAIs1J,EADjB79J,EAAM0jB,EAAOllB,OAAS,EACc,GAARq/J,GAIxBhvI,EAAMtmB,EAAIvI,GAAO+8J,EAAS7hJ,GAC7Bzc,EAAM,YAGPyc,GAAK2T,EAAMtmB,EAAIvI,GACfuI,GAAKvI,EAGL0jB,EAAOjY,OAAOlD,IAAK,EAAG2S,GAIvB,OAAOoiJ,EAAW55I,GAUnB,SAASzlB,EAAOgF,GACf,IAAIiY,EACA2E,EACAm+I,EACAC,EACAF,EACAv1J,EACAvM,EACAmV,EACAlB,EACAuB,EACAysJ,EAGAxvI,EAEAyvI,EACAL,EACAM,EANA16I,EAAS,GAoBb,IARAgL,GAHAzrB,EAAQo6J,EAAWp6J,IAGCzE,OAGpB0c,EAvUU,IAwUV2E,EAAQ,EACRk+I,EA1Ua,GA6URv1J,EAAI,EAAGA,EAAIkmB,IAAelmB,GAC9B01J,EAAej7J,EAAMuF,IACF,KAClBkb,EAAOzhB,KAAKk7J,EAAmBe,IAejC,IAXAF,EAAiBC,EAAcv6I,EAAOllB,OAMlCy/J,GACHv6I,EAAOzhB,KAzVG,KA6VJ+7J,EAAiBtvI,GAAa,CAIpC,IAAKzyB,EAAI8gK,EAAQv0J,EAAI,EAAGA,EAAIkmB,IAAelmB,GAC1C01J,EAAej7J,EAAMuF,KACD0S,GAAKgjJ,EAAejiK,IACvCA,EAAIiiK,GAcN,IAPIjiK,EAAIif,EAAI2T,GAAOkuI,EAASl9I,IAD5Bs+I,EAAwBH,EAAiB,KAExCv/J,EAAM,YAGPohB,IAAU5jB,EAAIif,GAAKijJ,EACnBjjJ,EAAIjf,EAECuM,EAAI,EAAGA,EAAIkmB,IAAelmB,EAO9B,IANA01J,EAAej7J,EAAMuF,IAEF0S,KAAO2E,EAAQk9I,GACjCt+J,EAAM,YAGHy/J,GAAgBhjJ,EAAG,CAEtB,IAAK9J,EAAIyO,EAAO3P,EAAIxT,IAEf0U,GADJK,EAAIvB,GAAK6tJ,EAlYP,EAkYsB7tJ,GAAK6tJ,EAjY3B,MAiYgD7tJ,EAAI6tJ,IADT7tJ,GAAKxT,EAKlD0hK,EAAUhtJ,EAAIK,EACdqsJ,EAAaphK,EAAO+U,EACpBiS,EAAOzhB,KACNk7J,EAAmBI,EAAa9rJ,EAAI2sJ,EAAUN,EAAY,KAE3D1sJ,EAAIyd,EAAMuvI,EAAUN,GAGrBp6I,EAAOzhB,KAAKk7J,EAAmBI,EAAansJ,EAAG,KAC/C2sJ,EAAOP,EAAM39I,EAAOs+I,EAAuBH,GAAkBC,GAC7Dp+I,EAAQ,IACNm+I,IAIFn+I,IACA3E,EAGH,OAAOwI,EAAO3jB,KAAK,IA4CpB+8J,EAAW,CAMV,QAAW,QAQX,KAAQ,CACP,OAAUO,EACV,OAAUC,GAEX,OAAUz/J,EACV,OAAUI,EACV,QA/BD,SAAiBgF,GAChB,OAAOm6J,EAAUn6J,GAAO,SAASwK,GAChC,OAAOwvJ,EAAc14J,KAAKkJ,GACvB,OAASxP,EAAOwP,GAChBA,MA4BJ,UAnDD,SAAmBxK,GAClB,OAAOm6J,EAAUn6J,GAAO,SAASwK,GAChC,OAAOuvJ,EAAcz4J,KAAKkJ,GACvB5P,EAAO4P,EAAO3N,MAAM,GAAGilC,eACvBt3B,YA4DH,KAFD,aACC,OAAOqvJ,GACP,8BAngBF,gCCsBD,IAAIA,EAAW,EAAQ,MACnBrsI,EAAO,EAAQ,MASnB,SAAS4tI,IACPnhK,KAAKmuC,SAAW,KAChBnuC,KAAKohK,QAAU,KACfphK,KAAKqkJ,KAAO,KACZrkJ,KAAK4kJ,KAAO,KACZ5kJ,KAAKmpC,KAAO,KACZnpC,KAAKokJ,SAAW,KAChBpkJ,KAAK0jD,KAAO,KACZ1jD,KAAKovB,OAAS,KACdpvB,KAAKqhK,MAAQ,KACbrhK,KAAKshK,SAAW,KAChBthK,KAAK+G,KAAO,KACZ/G,KAAKq2C,KAAO,KAnBd33C,EAAQ8/B,MAAQ+iI,EAChB7iK,EAAQ+sB,QA0ZR,SAAoBsE,EAAQ3jB,GAC1B,OAAOm1J,EAASxxI,GAAQ,GAAO,GAAMtE,QAAQrf,IA1Z/C1N,EAAQ8iK,cAiaR,SAA0BzxI,EAAQ3jB,GAChC,OAAK2jB,EACEwxI,EAASxxI,GAAQ,GAAO,GAAMyxI,cAAcp1J,GAD/BA,GAjatB1N,EAAQghE,OAsVR,SAAmBx7D,GAMjB,OADIqvB,EAAKyzF,SAAS9iH,KAAMA,EAAMq9J,EAASr9J,IACjCA,aAAei9J,EACdj9J,EAAIw7D,SADuByhG,EAAIlhK,UAAUy/D,OAAOn/D,KAAK2D,IA1V9DxF,EAAQyiK,IAAMA,EAqBd,IAAIM,EAAkB,oBAClBC,EAAc,WAGdC,EAAoB,qCAOpBC,EAAS,CAAC,IAAK,IAAK,IAAK,KAAM,IAAK,KAAKr+J,OAHhC,CAAC,IAAK,IAAK,IAAK,IAAK,IAAK,KAAM,KAAM,OAM/Cs+J,EAAa,CAAC,KAAMt+J,OAAOq+J,GAK3BE,EAAe,CAAC,IAAK,IAAK,IAAK,IAAK,KAAKv+J,OAAOs+J,GAChDE,EAAkB,CAAC,IAAK,IAAK,KAE7BC,EAAsB,yBACtBC,EAAoB,+BAEpBC,EAAiB,CACf,YAAc,EACd,eAAe,GAGjBC,EAAmB,CACjB,YAAc,EACd,eAAe,GAGjBC,EAAkB,CAChB,MAAQ,EACR,OAAS,EACT,KAAO,EACP,QAAU,EACV,MAAQ,EACR,SAAS,EACT,UAAU,EACV,QAAQ,EACR,WAAW,EACX,SAAS,GAEXne,EAAc,EAAQ,MAE1B,SAASsd,EAAS/sH,EAAK6tH,EAAkBC,GACvC,GAAI9tH,GAAOjhB,EAAKszF,SAASryE,IAAQA,aAAe2sH,EAAK,OAAO3sH,EAE5D,IAAIntB,EAAI,IAAI85I,EAEZ,OADA95I,EAAEmX,MAAMgW,EAAK6tH,EAAkBC,GACxBj7I,EAGT85I,EAAIlhK,UAAUu+B,MAAQ,SAASgW,EAAK6tH,EAAkBC,GACpD,IAAK/uI,EAAKyzF,SAASxyE,GACjB,MAAM,IAAI3pB,UAAU,gDAAkD2pB,GAMxE,IAAI+tH,EAAa/tH,EAAIpnB,QAAQ,KACzBo1I,GACqB,IAAhBD,GAAqBA,EAAa/tH,EAAIpnB,QAAQ,KAAQ,IAAM,IACjEq1I,EAASjuH,EAAIlnC,MAAMk1J,GAEvBC,EAAO,GAAKA,EAAO,GAAG70J,QADL,MACyB,KAG1C,IAAI80J,EAFJluH,EAAMiuH,EAAO5/J,KAAK2/J,GAQlB,GAFAE,EAAOA,EAAKptG,QAEPgtG,GAA+C,IAA1B9tH,EAAIlnC,MAAM,KAAKhM,OAAc,CAErD,IAAIqhK,EAAahB,EAAkB3iK,KAAK0jK,GACxC,GAAIC,EAeF,OAdA3iK,KAAK+G,KAAO27J,EACZ1iK,KAAKq2C,KAAOqsH,EACZ1iK,KAAKshK,SAAWqB,EAAW,GACvBA,EAAW,IACb3iK,KAAKovB,OAASuzI,EAAW,GAEvB3iK,KAAKqhK,MADHgB,EACWpe,EAAYzlH,MAAMx+B,KAAKovB,OAAO8E,OAAO,IAErCl0B,KAAKovB,OAAO8E,OAAO,IAEzBmuI,IACTriK,KAAKovB,OAAS,GACdpvB,KAAKqhK,MAAQ,IAERrhK,KAIX,IAAI40D,EAAQ6sG,EAAgBziK,KAAK0jK,GACjC,GAAI9tG,EAAO,CAET,IAAIguG,GADJhuG,EAAQA,EAAM,IACS/sB,cACvB7nC,KAAKmuC,SAAWy0H,EAChBF,EAAOA,EAAKxuI,OAAO0gC,EAAMtzD,QAO3B,GAAIghK,GAAqB1tG,GAAS8tG,EAAK76J,MAAM,wBAAyB,CACpE,IAAIu5J,EAAgC,OAAtBsB,EAAKxuI,OAAO,EAAG,IACzBktI,GAAaxsG,GAASutG,EAAiBvtG,KACzC8tG,EAAOA,EAAKxuI,OAAO,GACnBl0B,KAAKohK,SAAU,GAInB,IAAKe,EAAiBvtG,KACjBwsG,GAAYxsG,IAAUwtG,EAAgBxtG,IAAU,CAmBnD,IADA,IASIyvF,EAAMwe,EATNC,GAAW,EACNz3J,EAAI,EAAGA,EAAI02J,EAAgBzgK,OAAQ+J,KAE7B,KADT03J,EAAML,EAAKt1I,QAAQ20I,EAAgB12J,QACP,IAAby3J,GAAkBC,EAAMD,KACzCA,EAAUC,GAyBd,KARgB,KATdF,GAFe,IAAbC,EAEOJ,EAAK5vG,YAAY,KAIjB4vG,EAAK5vG,YAAY,IAAKgwG,MAM/Bze,EAAOqe,EAAK9/J,MAAM,EAAGigK,GACrBH,EAAOA,EAAK9/J,MAAMigK,EAAS,GAC3B7iK,KAAKqkJ,KAAOhlD,mBAAmBglD,IAIjCye,GAAW,EACFz3J,EAAI,EAAGA,EAAIy2J,EAAaxgK,OAAQ+J,IAAK,CAC5C,IAAI03J,GACS,KADTA,EAAML,EAAKt1I,QAAQ00I,EAAaz2J,QACJ,IAAby3J,GAAkBC,EAAMD,KACzCA,EAAUC,IAGG,IAAbD,IACFA,EAAUJ,EAAKphK,QAEjBtB,KAAK4kJ,KAAO8d,EAAK9/J,MAAM,EAAGkgK,GAC1BJ,EAAOA,EAAK9/J,MAAMkgK,GAGlB9iK,KAAKgjK,YAILhjK,KAAKokJ,SAAWpkJ,KAAKokJ,UAAY,GAIjC,IAAI6e,EAAoC,MAArBjjK,KAAKokJ,SAAS,IACe,MAA5CpkJ,KAAKokJ,SAASpkJ,KAAKokJ,SAAS9iJ,OAAS,GAGzC,IAAK2hK,EAEH,IADA,IAAIC,EAAYljK,KAAKokJ,SAAS92I,MAAM,MACpBmP,GAAPpR,EAAI,EAAO63J,EAAU5hK,QAAQ+J,EAAIoR,EAAGpR,IAAK,CAChD,IAAIq2F,EAAOwhE,EAAU73J,GACrB,GAAKq2F,IACAA,EAAK75F,MAAMm6J,GAAsB,CAEpC,IADA,IAAImB,EAAU,GACL73J,EAAI,EAAG0H,EAAI0uF,EAAKpgG,OAAQgK,EAAI0H,EAAG1H,IAClCo2F,EAAKrzF,WAAW/C,GAAK,IAIvB63J,GAAW,IAEXA,GAAWzhE,EAAKp2F,GAIpB,IAAK63J,EAAQt7J,MAAMm6J,GAAsB,CACvC,IAAIoB,EAAaF,EAAUtgK,MAAM,EAAGyI,GAChCg4J,EAAUH,EAAUtgK,MAAMyI,EAAI,GAC9BiL,EAAMorF,EAAK75F,MAAMo6J,GACjB3rJ,IACF8sJ,EAAWr+J,KAAKuR,EAAI,IACpB+sJ,EAAQj0J,QAAQkH,EAAI,KAElB+sJ,EAAQ/hK,SACVohK,EAAO,IAAMW,EAAQxgK,KAAK,KAAO6/J,GAEnC1iK,KAAKokJ,SAAWgf,EAAWvgK,KAAK,KAChC,QAMJ7C,KAAKokJ,SAAS9iJ,OAjND,IAkNftB,KAAKokJ,SAAW,GAGhBpkJ,KAAKokJ,SAAWpkJ,KAAKokJ,SAASv8G,cAG3Bo7H,IAKHjjK,KAAKokJ,SAAWwb,EAAS0D,QAAQtjK,KAAKokJ,WAGxC,IAAI50I,EAAIxP,KAAKmpC,KAAO,IAAMnpC,KAAKmpC,KAAO,GAClCvpB,EAAI5f,KAAKokJ,UAAY,GACzBpkJ,KAAK4kJ,KAAOhlI,EAAIpQ,EAChBxP,KAAKq2C,MAAQr2C,KAAK4kJ,KAIdqe,IACFjjK,KAAKokJ,SAAWpkJ,KAAKokJ,SAASlwH,OAAO,EAAGl0B,KAAKokJ,SAAS9iJ,OAAS,GAC/C,MAAZohK,EAAK,KACPA,EAAO,IAAMA,IAOnB,IAAKR,EAAeU,GAKlB,IAASv3J,EAAI,EAAGoR,EAAIolJ,EAAWvgK,OAAQ+J,EAAIoR,EAAGpR,IAAK,CACjD,IAAIk4J,EAAK1B,EAAWx2J,GACpB,IAA0B,IAAtBq3J,EAAKt1I,QAAQm2I,GAAjB,CAEA,IAAIC,EAAMjkE,mBAAmBgkE,GACzBC,IAAQD,IACVC,EAAMC,OAAOF,IAEfb,EAAOA,EAAKp1J,MAAMi2J,GAAI1gK,KAAK2gK,IAM/B,IAAI9/G,EAAOg/G,EAAKt1I,QAAQ,MACV,IAAVs2B,IAEF1jD,KAAK0jD,KAAOg/G,EAAKxuI,OAAOwvB,GACxBg/G,EAAOA,EAAK9/J,MAAM,EAAG8gD,IAEvB,IAAIggH,EAAKhB,EAAKt1I,QAAQ,KAoBtB,IAnBY,IAARs2I,GACF1jK,KAAKovB,OAASszI,EAAKxuI,OAAOwvI,GAC1B1jK,KAAKqhK,MAAQqB,EAAKxuI,OAAOwvI,EAAK,GAC1BrB,IACFriK,KAAKqhK,MAAQpd,EAAYzlH,MAAMx+B,KAAKqhK,QAEtCqB,EAAOA,EAAK9/J,MAAM,EAAG8gK,IACZrB,IAETriK,KAAKovB,OAAS,GACdpvB,KAAKqhK,MAAQ,IAEXqB,IAAM1iK,KAAKshK,SAAWoB,GACtBN,EAAgBQ,IAChB5iK,KAAKokJ,WAAapkJ,KAAKshK,WACzBthK,KAAKshK,SAAW,KAIdthK,KAAKshK,UAAYthK,KAAKovB,OAAQ,CAC5B5f,EAAIxP,KAAKshK,UAAY,GAAzB,IACInkJ,EAAInd,KAAKovB,QAAU,GACvBpvB,KAAK+G,KAAOyI,EAAI2N,EAKlB,OADAnd,KAAKq2C,KAAOr2C,KAAK0/D,SACV1/D,MAcTmhK,EAAIlhK,UAAUy/D,OAAS,WACrB,IAAI2kF,EAAOrkJ,KAAKqkJ,MAAQ,GACpBA,IAEFA,GADAA,EAAO9kD,mBAAmB8kD,IACdz2I,QAAQ,OAAQ,KAC5By2I,GAAQ,KAGV,IAAIl2G,EAAWnuC,KAAKmuC,UAAY,GAC5BmzH,EAAWthK,KAAKshK,UAAY,GAC5B59G,EAAO1jD,KAAK0jD,MAAQ,GACpBkhG,GAAO,EACPyc,EAAQ,GAERrhK,KAAK4kJ,KACPA,EAAOP,EAAOrkJ,KAAK4kJ,KACV5kJ,KAAKokJ,WACdQ,EAAOP,IAAwC,IAAhCrkJ,KAAKokJ,SAASh3H,QAAQ,KACjCptB,KAAKokJ,SACL,IAAMpkJ,KAAKokJ,SAAW,KACtBpkJ,KAAKmpC,OACPy7G,GAAQ,IAAM5kJ,KAAKmpC,OAInBnpC,KAAKqhK,OACL9tI,EAAKszF,SAAS7mH,KAAKqhK,QACnB77J,OAAOC,KAAKzF,KAAKqhK,OAAO//J,SAC1B+/J,EAAQpd,EAAYp7I,UAAU7I,KAAKqhK,QAGrC,IAAIjyI,EAASpvB,KAAKovB,QAAWiyI,GAAU,IAAMA,GAAW,GAsBxD,OApBIlzH,GAAoC,MAAxBA,EAASja,QAAQ,KAAYia,GAAY,KAIrDnuC,KAAKohK,WACHjzH,GAAYi0H,EAAgBj0H,MAAuB,IAATy2G,GAC9CA,EAAO,MAAQA,GAAQ,IACnB0c,GAAmC,MAAvBA,EAASqC,OAAO,KAAYrC,EAAW,IAAMA,IACnD1c,IACVA,EAAO,IAGLlhG,GAA2B,MAAnBA,EAAKigH,OAAO,KAAYjgH,EAAO,IAAMA,GAC7Ct0B,GAA+B,MAArBA,EAAOu0I,OAAO,KAAYv0I,EAAS,IAAMA,GAOhD+e,EAAWy2G,GALlB0c,EAAWA,EAAS1zJ,QAAQ,SAAS,SAAS/F,GAC5C,OAAO03F,mBAAmB13F,QAE5BunB,EAASA,EAAOxhB,QAAQ,IAAK,QAEgB81C,GAO/Cy9G,EAAIlhK,UAAUwrB,QAAU,SAASrf,GAC/B,OAAOpM,KAAKwhK,cAAcD,EAASn1J,GAAU,GAAO,IAAOszD,UAQ7DyhG,EAAIlhK,UAAUuhK,cAAgB,SAASp1J,GACrC,GAAImnB,EAAKyzF,SAAS56G,GAAW,CAC3B,IAAIw3J,EAAM,IAAIzC,EACdyC,EAAIplI,MAAMpyB,GAAU,GAAO,GAC3BA,EAAWw3J,EAKb,IAFA,IAAI19J,EAAS,IAAIi7J,EACb0C,EAAQr+J,OAAOC,KAAKzF,MACf8jK,EAAK,EAAGA,EAAKD,EAAMviK,OAAQwiK,IAAM,CACxC,IAAIC,EAAOF,EAAMC,GACjB59J,EAAO69J,GAAQ/jK,KAAK+jK,GAQtB,GAHA79J,EAAOw9C,KAAOt3C,EAASs3C,KAGD,KAAlBt3C,EAASiqC,KAEX,OADAnwC,EAAOmwC,KAAOnwC,EAAOw5D,SACdx5D,EAIT,GAAIkG,EAASg1J,UAAYh1J,EAAS+hC,SAAU,CAG1C,IADA,IAAI61H,EAAQx+J,OAAOC,KAAK2G,GACf63J,EAAK,EAAGA,EAAKD,EAAM1iK,OAAQ2iK,IAAM,CACxC,IAAIC,EAAOF,EAAMC,GACJ,aAATC,IACFh+J,EAAOg+J,GAAQ93J,EAAS83J,IAU5B,OANI9B,EAAgBl8J,EAAOioC,WACvBjoC,EAAOk+I,WAAal+I,EAAOo7J,WAC7Bp7J,EAAOa,KAAOb,EAAOo7J,SAAW,KAGlCp7J,EAAOmwC,KAAOnwC,EAAOw5D,SACdx5D,EAGT,GAAIkG,EAAS+hC,UAAY/hC,EAAS+hC,WAAajoC,EAAOioC,SAAU,CAS9D,IAAKi0H,EAAgBh2J,EAAS+hC,UAAW,CAEvC,IADA,IAAI1oC,EAAOD,OAAOC,KAAK2G,GACd2sC,EAAI,EAAGA,EAAItzC,EAAKnE,OAAQy3C,IAAK,CACpC,IAAI/lC,EAAIvN,EAAKszC,GACb7yC,EAAO8M,GAAK5G,EAAS4G,GAGvB,OADA9M,EAAOmwC,KAAOnwC,EAAOw5D,SACdx5D,EAIT,GADAA,EAAOioC,SAAW/hC,EAAS+hC,SACtB/hC,EAASw4I,MAASud,EAAiB/1J,EAAS+hC,UAS/CjoC,EAAOo7J,SAAWl1J,EAASk1J,aAT+B,CAE1D,IADA,IAAI6C,GAAW/3J,EAASk1J,UAAY,IAAIh0J,MAAM,KACvC62J,EAAQ7iK,UAAY8K,EAASw4I,KAAOuf,EAAQxjJ,WAC9CvU,EAASw4I,OAAMx4I,EAASw4I,KAAO,IAC/Bx4I,EAASg4I,WAAUh4I,EAASg4I,SAAW,IACzB,KAAf+f,EAAQ,IAAWA,EAAQ/0J,QAAQ,IACnC+0J,EAAQ7iK,OAAS,GAAG6iK,EAAQ/0J,QAAQ,IACxClJ,EAAOo7J,SAAW6C,EAAQthK,KAAK,KAWjC,GAPAqD,EAAOkpB,OAAShjB,EAASgjB,OACzBlpB,EAAOm7J,MAAQj1J,EAASi1J,MACxBn7J,EAAO0+I,KAAOx4I,EAASw4I,MAAQ,GAC/B1+I,EAAOm+I,KAAOj4I,EAASi4I,KACvBn+I,EAAOk+I,SAAWh4I,EAASg4I,UAAYh4I,EAASw4I,KAChD1+I,EAAOijC,KAAO/8B,EAAS+8B,KAEnBjjC,EAAOo7J,UAAYp7J,EAAOkpB,OAAQ,CACpC,IAAI5f,EAAItJ,EAAOo7J,UAAY,GACvBnkJ,EAAIjX,EAAOkpB,QAAU,GACzBlpB,EAAOa,KAAOyI,EAAI2N,EAIpB,OAFAjX,EAAOk7J,QAAUl7J,EAAOk7J,SAAWh1J,EAASg1J,QAC5Cl7J,EAAOmwC,KAAOnwC,EAAOw5D,SACdx5D,EAGT,IAAIk+J,EAAel+J,EAAOo7J,UAA0C,MAA9Bp7J,EAAOo7J,SAASqC,OAAO,GACzDU,EACIj4J,EAASw4I,MACTx4I,EAASk1J,UAA4C,MAAhCl1J,EAASk1J,SAASqC,OAAO,GAElDW,EAAcD,GAAYD,GACXl+J,EAAO0+I,MAAQx4I,EAASk1J,SACvCiD,EAAgBD,EAChBE,EAAUt+J,EAAOo7J,UAAYp7J,EAAOo7J,SAASh0J,MAAM,MAAQ,GAE3Dm3J,GADAN,EAAU/3J,EAASk1J,UAAYl1J,EAASk1J,SAASh0J,MAAM,MAAQ,GACnDpH,EAAOioC,WAAai0H,EAAgBl8J,EAAOioC,WA2B3D,GApBIs2H,IACFv+J,EAAOk+I,SAAW,GAClBl+I,EAAOijC,KAAO,KACVjjC,EAAO0+I,OACU,KAAf4f,EAAQ,GAAWA,EAAQ,GAAKt+J,EAAO0+I,KACtC4f,EAAQp1J,QAAQlJ,EAAO0+I,OAE9B1+I,EAAO0+I,KAAO,GACVx4I,EAAS+hC,WACX/hC,EAASg4I,SAAW,KACpBh4I,EAAS+8B,KAAO,KACZ/8B,EAASw4I,OACQ,KAAfuf,EAAQ,GAAWA,EAAQ,GAAK/3J,EAASw4I,KACxCuf,EAAQ/0J,QAAQhD,EAASw4I,OAEhCx4I,EAASw4I,KAAO,MAElB0f,EAAaA,IAA8B,KAAfH,EAAQ,IAA4B,KAAfK,EAAQ,KAGvDH,EAEFn+J,EAAO0+I,KAAQx4I,EAASw4I,MAA0B,KAAlBx4I,EAASw4I,KAC3Bx4I,EAASw4I,KAAO1+I,EAAO0+I,KACrC1+I,EAAOk+I,SAAYh4I,EAASg4I,UAAkC,KAAtBh4I,EAASg4I,SAC/Bh4I,EAASg4I,SAAWl+I,EAAOk+I,SAC7Cl+I,EAAOkpB,OAAShjB,EAASgjB,OACzBlpB,EAAOm7J,MAAQj1J,EAASi1J,MACxBmD,EAAUL,OAEL,GAAIA,EAAQ7iK,OAGZkjK,IAASA,EAAU,IACxBA,EAAQzyI,MACRyyI,EAAUA,EAAQjhK,OAAO4gK,GACzBj+J,EAAOkpB,OAAShjB,EAASgjB,OACzBlpB,EAAOm7J,MAAQj1J,EAASi1J,WACnB,IAAK9tI,EAAKmxI,kBAAkBt4J,EAASgjB,QAwB1C,OApBIq1I,IACFv+J,EAAOk+I,SAAWl+I,EAAO0+I,KAAO4f,EAAQ7jJ,SAIpCgkJ,KAAaz+J,EAAO0+I,MAAQ1+I,EAAO0+I,KAAKx3H,QAAQ,KAAO,IAC1ClnB,EAAO0+I,KAAKt3I,MAAM,QAEjCpH,EAAOm+I,KAAOsgB,EAAWhkJ,QACzBza,EAAO0+I,KAAO1+I,EAAOk+I,SAAWugB,EAAWhkJ,UAG/Cza,EAAOkpB,OAAShjB,EAASgjB,OACzBlpB,EAAOm7J,MAAQj1J,EAASi1J,MAEnB9tI,EAAKqxI,OAAO1+J,EAAOo7J,WAAc/tI,EAAKqxI,OAAO1+J,EAAOkpB,UACvDlpB,EAAOa,MAAQb,EAAOo7J,SAAWp7J,EAAOo7J,SAAW,KACpCp7J,EAAOkpB,OAASlpB,EAAOkpB,OAAS,KAEjDlpB,EAAOmwC,KAAOnwC,EAAOw5D,SACdx5D,EAGT,IAAKs+J,EAAQljK,OAWX,OARA4E,EAAOo7J,SAAW,KAEdp7J,EAAOkpB,OACTlpB,EAAOa,KAAO,IAAMb,EAAOkpB,OAE3BlpB,EAAOa,KAAO,KAEhBb,EAAOmwC,KAAOnwC,EAAOw5D,SACdx5D,EAcT,IARA,IAAIg5C,EAAOslH,EAAQ5hK,OAAO,GAAG,GACzBiiK,GACC3+J,EAAO0+I,MAAQx4I,EAASw4I,MAAQ4f,EAAQljK,OAAS,KACxC,MAAT49C,GAAyB,OAATA,IAA2B,KAATA,EAInC4lH,EAAK,EACAz5J,EAAIm5J,EAAQljK,OAAQ+J,GAAK,EAAGA,IAEtB,OADb6zC,EAAOslH,EAAQn5J,IAEbm5J,EAAQj2J,OAAOlD,EAAG,GACA,OAAT6zC,GACTslH,EAAQj2J,OAAOlD,EAAG,GAClBy5J,KACSA,IACTN,EAAQj2J,OAAOlD,EAAG,GAClBy5J,KAKJ,IAAKR,IAAeC,EAClB,KAAOO,IAAMA,EACXN,EAAQp1J,QAAQ,OAIhBk1J,GAA6B,KAAfE,EAAQ,IACpBA,EAAQ,IAA+B,MAAzBA,EAAQ,GAAGb,OAAO,IACpCa,EAAQp1J,QAAQ,IAGdy1J,GAAsD,MAAjCL,EAAQ3hK,KAAK,KAAKqxB,QAAQ,IACjDswI,EAAQz/J,KAAK,IAGf,IAUM4/J,EAVFzkC,EAA4B,KAAfskC,EAAQ,IACpBA,EAAQ,IAA+B,MAAzBA,EAAQ,GAAGb,OAAO,GAsCrC,OAnCIc,IACFv+J,EAAOk+I,SAAWl+I,EAAO0+I,KAAO1kB,EAAa,GACbskC,EAAQljK,OAASkjK,EAAQ7jJ,QAAU,IAI/DgkJ,KAAaz+J,EAAO0+I,MAAQ1+I,EAAO0+I,KAAKx3H,QAAQ,KAAO,IAC1ClnB,EAAO0+I,KAAKt3I,MAAM,QAEjCpH,EAAOm+I,KAAOsgB,EAAWhkJ,QACzBza,EAAO0+I,KAAO1+I,EAAOk+I,SAAWugB,EAAWhkJ,WAI/C2jJ,EAAaA,GAAep+J,EAAO0+I,MAAQ4f,EAAQljK,UAEhC4+H,GACjBskC,EAAQp1J,QAAQ,IAGbo1J,EAAQljK,OAIX4E,EAAOo7J,SAAWkD,EAAQ3hK,KAAK,MAH/BqD,EAAOo7J,SAAW,KAClBp7J,EAAOa,KAAO,MAMXwsB,EAAKqxI,OAAO1+J,EAAOo7J,WAAc/tI,EAAKqxI,OAAO1+J,EAAOkpB,UACvDlpB,EAAOa,MAAQb,EAAOo7J,SAAWp7J,EAAOo7J,SAAW,KACpCp7J,EAAOkpB,OAASlpB,EAAOkpB,OAAS,KAEjDlpB,EAAOm+I,KAAOj4I,EAASi4I,MAAQn+I,EAAOm+I,KACtCn+I,EAAOk7J,QAAUl7J,EAAOk7J,SAAWh1J,EAASg1J,QAC5Cl7J,EAAOmwC,KAAOnwC,EAAOw5D,SACdx5D,GAGTi7J,EAAIlhK,UAAU+iK,UAAY,WACxB,IAAIpe,EAAO5kJ,KAAK4kJ,KACZz7G,EAAOu4H,EAAY1iK,KAAK4lJ,GACxBz7G,IAEW,OADbA,EAAOA,EAAK,MAEVnpC,KAAKmpC,KAAOA,EAAKjV,OAAO,IAE1B0wH,EAAOA,EAAK1wH,OAAO,EAAG0wH,EAAKtjJ,OAAS6nC,EAAK7nC,SAEvCsjJ,IAAM5kJ,KAAKokJ,SAAWQ,2BCxtB5BnmJ,EAAOC,QAAU,CACfsoH,SAAU,SAASzhH,GACjB,MAAuB,iBAAV,GAEfshH,SAAU,SAASthH,GACjB,MAAuB,iBAAV,GAA8B,OAARA,GAErCq/J,OAAQ,SAASr/J,GACf,OAAe,OAARA,GAETm/J,kBAAmB,SAASn/J,GAC1B,OAAc,MAAPA,yCCZX,MAAM,aAAEqpC,GAAiB,EAAQ,MAC3B9Q,EAAU,EAAQ,MAClBkB,EAAW,gBACXS,EAAQ,EAAQ,KAAR,CAAiB,eACzBE,EAAO,EAAQ,MAIfolI,EAAe,MAErBtmK,EAAOC,QAAUsmK,IACf,MAAMC,UAAmBr2H,EACvB3sC,YAAa6wG,GACX1xE,QAEAphC,KAAKgzG,MAAQF,EAEb9yG,KAAKklK,WAAY,EACjBllK,KAAKmlK,mBAAoB,EACzBnlK,KAAKolK,cAAgB,KAErBplK,KAAKqlK,kBAAoB,KAKzBrlK,KAAKslK,UAAY,IAAItmI,EAAS,EAAG,CAAEE,KAnBnB,MAqBZh+B,EAAOE,SAAS4jK,IAClBhlK,KAAKulK,YAAYP,GAIrBh/H,YAAaY,EAAUrF,EAAQO,GAC7B9hC,KAAK8nC,UAAYlB,EAGnBX,oBAAqB0B,GACnB,OAAKA,EAAU5oC,GAAM4oC,EAAU5oC,EAAEymK,YAG5B79H,EAAU89H,cAGwB,iBAA5B99H,EAAU89H,eAtCD,IAuCI99H,EAAU89H,eAC9B99H,EAAU89H,eAAiB,EACtBzlK,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,qCAGxCe,KAAKolK,cAAgBz9H,EAAU89H,cAC/BzlK,KAAK0lK,WAAa50J,KAAKS,KAAKvR,KAAKolK,cAAgBL,GACjD/kK,KAAKqlK,kBAAsC,EAAlBrlK,KAAK0lK,gBAE9B1lK,KAAK2lK,kBAZI3lK,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,gCAH/Be,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,sCAkB1CinC,UAAWl7B,GACT,IAAIuxB,EACAqpI,EACJ,IACE,MAAMv8J,EAAM2B,EAAIiB,WACV45J,EAAex8J,EAAI+jB,QAAQ,MAAQ,EACzCmP,EAAOuB,EAAQn9B,OAAO0I,EAAIimB,UAAU,EAAGu2I,IACvCD,EAAU56J,EAAIpI,MAAMijK,GACpB,MAAO97J,GAEP,OAGF,OAAQwyB,EAAKupI,UACX,KAAK,EAGH9lK,KAAK2rC,WAAWpP,EAAKsE,OACrB,MACF,KAAK,EAGH7gC,KAAK+lK,QAAQxpI,EAAKsE,MAAO+kI,EAASrpI,EAAKypI,YACvC,MACF,KAAK,EAGHhmK,KAAKmsC,UAAU5P,EAAKsE,QAS1B8xH,QACM3yJ,KAAKmlK,oBAGTnlK,KAAKklK,WAAY,EACbllK,KAAKolK,eACPplK,KAAK2lK,kBAQT38H,SACEhpC,KAAKklK,WAAY,EAGnBK,YAAaP,GACX,GAAIhlK,KAAKmlK,kBAAmB,OAAO,EACnC1lI,EAAM,gBAGN,IACE,MAAM6M,EAAOxO,EAAQn9B,OAAOqkK,GAAU14H,KAClCA,IACF04H,EAAWlnI,EAAQ/8B,OAAOurC,IAE5B,MAAOviC,IAGT,QAAI/J,KAAK8nC,WAAa9nC,KAAK8nC,YAAcnI,EAAKoH,KAAKi+H,KAInDhlK,KAAKgpC,SAELhpC,KAAKglK,SAAWA,EAChBhlK,KAAKmlK,mBAAoB,EACzBnlK,KAAKolK,cAAgBplK,KAAKglK,SAAS1jK,OACnCtB,KAAKgzG,MAAM5wE,kBAAkBqjI,cAAgBzlK,KAAKolK,cAElDplK,KAAKylC,KAAK,WAAY3H,EAAQ/8B,OAAO,CACnCurC,KAAMxO,EAAQn9B,OAAOX,KAAKglK,aAGrB,IAGThyH,MAAOzW,EAAMqpI,GACX,IAAI56J,EAAM8yB,EAAQ/8B,OAAOw7B,GACrBr7B,EAAOE,SAASwkK,KAClB56J,EAAM9J,EAAOqC,OAAO,CAACyH,EAAK46J,KAE5B5lK,KAAKgzG,MAAMrzF,SAAS,cAAe3U,GAGrCi7J,SAAUplI,GACR7gC,KAAKgzC,MAAM,CAAE8yH,SAAU,EAAGjlI,MAAAA,IAG5BqlI,MAAOrlI,EAAO71B,EAAKsxG,GACjB,MAAM7yG,EAAM,CAAEq8J,SAAU,EAAGjlI,MAAAA,GACF,iBAAdy7E,IACT7yG,EAAIu8J,WAAa1pD,GAEnBt8G,KAAKgzC,MAAMvpC,EAAKuB,GAGlBm7J,QAAStlI,GACP7gC,KAAKgzC,MAAM,CAAE8yH,SAAU,EAAGjlI,MAAAA,IAG5B8K,WAAY9K,GACV,IAAK7gC,KAAKmlK,kBAER,YADAnlK,KAAKmmK,QAAQtlI,GAGf,MAAMh6B,EAAQg6B,EAAQkkI,EACtB,IAAIr3J,EAAM7G,EAAQk+J,EACdr3J,EAAM1N,KAAKolK,gBACb13J,EAAM1N,KAAKolK,eAEb,MAAMp6J,EAAMhL,KAAKglK,SAASpiK,MAAMiE,EAAO6G,GACvC1N,KAAKkmK,MAAMrlI,EAAO71B,EAAKhL,KAAKolK,eAG9BW,QAASllI,EAAO71B,EAAKsxG,GACftxG,EAAI1J,OAASyjK,IAAiB/kK,KAAKklK,YAGvCl6J,EAAI9H,KAAKlD,KAAKglK,SAAUnkI,EAAQkkI,GAChC/kK,KAAKslK,UAAUpmK,IAAI2hC,GACnB7gC,KAAKomK,cAGPj6H,UAAWtL,GACL7gC,KAAKqlK,kBAAoB,GAAKrlK,KAAKklK,WAGrCllK,KAAKimK,SAASplI,GACd7gC,KAAKqlK,mBAAqB,GAE1BrlK,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,gCAInC0mK,iBACE,GAAK3lK,KAAKklK,UAAV,CACAllK,KAAKglK,SAAW9jK,EAAO6B,MAAM/C,KAAKolK,eAClC,IAAK,IAAIvkI,EAAQ,EAAGA,EAAQ7gC,KAAK0lK,WAAY7kI,IAC3C7gC,KAAKimK,SAASplI,IAIlBulI,aACE,IAAIrxI,GAAO,EACX,IAAK,IAAI8L,EAAQ,EAAGA,EAAQ7gC,KAAK0lK,WAAY7kI,IAC3C,IAAK7gC,KAAKslK,UAAUlmK,IAAIyhC,GAAQ,CAC9B9L,GAAO,EACP,MAGCA,IAGW/0B,KAAKulK,YAAYvlK,KAAKglK,WAGpChlK,KAAKqmK,mBAITA,kBAEErmK,KAAKslK,UAAY,IAAItmI,EAAS,EAAG,CAAEE,KA7NnB,MA8NhBl/B,KAAKqlK,mBAAqBrlK,KAAK0lK,WAC3B1lK,KAAKqlK,kBAAoB,EAC3BrlK,KAAK2lK,iBAEL3lK,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,gCAQrC,OAFAgmK,EAAWhlK,UAAUH,KAAO,cAErBmlK,iCC1LT,SAASlvH,EAAQj2C,GAEf,IACE,IAAK,EAAAkiB,EAAOioD,aAAc,OAAO,EACjC,MAAOxrD,GACP,OAAO,EAET,IAAI9Y,EAAM,EAAAqc,EAAOioD,aAAanqE,GAC9B,OAAI,MAAQ6F,GACyB,SAA9BkG,OAAOlG,GAAKkiC,cA5DrBppC,EAAOC,QAoBP,SAAoBuqB,EAAIxf,GACtB,GAAIssC,EAAO,iBACT,OAAO9sB,EAGT,IAAIL,GAAS,EAeb,OAdA,WACE,IAAKA,EAAQ,CACX,GAAImtB,EAAO,oBACT,MAAM,IAAI92C,MAAMwK,GACPssC,EAAO,oBAChBhsB,EAAQoT,MAAM1zB,GAEdsgB,EAAQH,KAAKngB,GAEfmf,GAAS,EAEX,OAAOK,EAAGjkB,MAAMhF,KAAMiF,sBC1C1BxG,EAAOC,QAAU,SAAkB6G,GACjC,OAAOA,GAAsB,iBAARA,GACI,mBAAbA,EAAIrC,MACS,mBAAbqC,EAAIs/C,MACc,mBAAlBt/C,EAAIlD,wCCClB,IAAIikK,EAAoB,EAAQ,MAC5BC,EAAsB,EAAQ,MAC9BC,EAAkB,EAAQ,MAC1Bl2D,EAAe,EAAQ,MAE3B,SAAS56E,EAAYC,GACnB,OAAOA,EAAEp1B,KAAKypB,KAAK2L,GAGrB,IAAI8wI,EAAoC,oBAAXtuI,OACzBuuI,EAAoC,oBAAXn/I,OAEzBo/I,EAAiBjxI,EAAYlwB,OAAOvF,UAAUgM,UAE9C26J,EAAclxI,EAAYv2B,OAAOc,UAAUg4B,SAC3C4uI,EAAcnxI,EAAY7pB,OAAO5L,UAAUg4B,SAC3C6uI,EAAepxI,EAAYwC,QAAQj4B,UAAUg4B,SAEjD,GAAIwuI,EACF,IAAIM,EAAcrxI,EAAYyC,OAAOl4B,UAAUg4B,SAGjD,GAAIyuI,EACF,IAAIM,EAActxI,EAAYnO,OAAOtnB,UAAUg4B,SAGjD,SAASgvI,EAAoBxlK,EAAOylK,GAClC,GAAqB,iBAAVzlK,EACT,OAAO,EAET,IAEE,OADAylK,EAAiBzlK,IACV,EACP,MAAMiF,GACN,OAAO,GA8FX,SAASygK,EAAc1lK,GACrB,MAAiC,iBAA1BklK,EAAellK,GAkBxB,SAAS2lK,EAAc3lK,GACrB,MAAiC,iBAA1BklK,EAAellK,GAiBxB,SAAS4lK,EAAkB5lK,GACzB,MAAiC,qBAA1BklK,EAAellK,GAiBxB,SAAS6lK,EAAkB7lK,GACzB,MAAiC,qBAA1BklK,EAAellK,GAWxB,SAAS8lK,EAAsB9lK,GAC7B,MAAiC,yBAA1BklK,EAAellK,GAMxB,SAAS+lK,EAAc/lK,GACrB,MAA2B,oBAAhBu8B,cAIJupI,EAAsBE,QACzBF,EAAsB9lK,GACtBA,aAAiBu8B,aAIvB,SAAS0pI,EAAmBjmK,GAC1B,MAAiC,sBAA1BklK,EAAellK,GAOxB,SAASkmK,EAAWlmK,GAClB,MAAwB,oBAAbikF,WAIJgiF,EAAmBD,QACtBC,EAAmBjmK,GACnBA,aAAiBikF,UA9LvBhnF,EAAQ4nK,kBAAoBA,EAC5B5nK,EAAQ6nK,oBAAsBA,EAC9B7nK,EAAQ4xG,aAAeA,EAkBvB5xG,EAAQ0pB,UAdR,SAAmBriB,GAClB,MAEqB,oBAAZylB,SACPzlB,aAAiBylB,SAGP,OAAVzlB,GACiB,iBAAVA,GACe,mBAAfA,EAAMqlB,MACU,mBAAhBrlB,EAAMslB,OAgBhB3sB,EAAQq3B,kBAVR,SAA2Bt0B,GACzB,MAA2B,oBAAhBu8B,aAA+BA,YAAYC,OAC7CD,YAAYC,OAAOx8B,GAI1B6uG,EAAa7uG,IACbkmK,EAAWlmK,IASf/C,EAAQkpK,aAHR,SAAsBnmK,GACpB,MAAkC,eAA3B+kK,EAAgB/kK,IAOzB/C,EAAQmpK,oBAHR,SAA6BpmK,GAC3B,MAAkC,sBAA3B+kK,EAAgB/kK,IAOzB/C,EAAQopK,cAHR,SAAuBrmK,GACrB,MAAkC,gBAA3B+kK,EAAgB/kK,IAOzB/C,EAAQqpK,cAHR,SAAuBtmK,GACrB,MAAkC,gBAA3B+kK,EAAgB/kK,IAOzB/C,EAAQspK,YAHR,SAAqBvmK,GACnB,MAAkC,cAA3B+kK,EAAgB/kK,IAOzB/C,EAAQupK,aAHR,SAAsBxmK,GACpB,MAAkC,eAA3B+kK,EAAgB/kK,IAOzB/C,EAAQwpK,aAHR,SAAsBzmK,GACpB,MAAkC,eAA3B+kK,EAAgB/kK,IAOzB/C,EAAQg4B,eAHR,SAAwBj1B,GACtB,MAAkC,iBAA3B+kK,EAAgB/kK,IAOzB/C,EAAQi4B,eAHR,SAAwBl1B,GACtB,MAAkC,iBAA3B+kK,EAAgB/kK,IAOzB/C,EAAQypK,gBAHR,SAAyB1mK,GACvB,MAAkC,kBAA3B+kK,EAAgB/kK,IAOzB/C,EAAQ0pK,iBAHR,SAA0B3mK,GACxB,MAAkC,mBAA3B+kK,EAAgB/kK,IAOzB0lK,EAAcM,QACG,oBAARjpK,KACP2oK,EAAc,IAAI3oK,KAYpBE,EAAQu3B,MATR,SAAex0B,GACb,MAAmB,oBAARjD,MAIJ2oK,EAAcM,QACjBN,EAAc1lK,GACdA,aAAiBjD,MAOvB4oK,EAAcK,QACG,oBAARztI,KACPotI,EAAc,IAAIptI,KAWpBt7B,EAAQw3B,MATR,SAAez0B,GACb,MAAmB,oBAARu4B,MAIJotI,EAAcK,QACjBL,EAAc3lK,GACdA,aAAiBu4B,MAOvBqtI,EAAkBI,QACG,oBAAZpnE,SACPgnE,EAAkB,IAAIhnE,SAWxB3hG,EAAQ2pK,UATR,SAAmB5mK,GACjB,MAAuB,oBAAZ4+F,UAIJgnE,EAAkBI,QACrBJ,EAAkB5lK,GAClBA,aAAiB4+F,UAOvBinE,EAAkBG,QACG,oBAAZlnE,SACP+mE,EAAkB,IAAI/mE,SAKxB7hG,EAAQ4pK,UAHR,SAAmB7mK,GACjB,OAAO6lK,EAAkB7lK,IAO3B8lK,EAAsBE,QACG,oBAAhBzpI,aACPupI,EAAsB,IAAIvpI,aAW5Bt/B,EAAQ8oK,cAAgBA,EAKxBE,EAAmBD,QACM,oBAAhBzpI,aACa,oBAAb0nD,UACPgiF,EAAmB,IAAIhiF,SAAS,IAAI1nD,YAAY,GAAI,EAAG,IAWzDt/B,EAAQipK,WAAaA,EAGrB,IAAIY,EAAqD,oBAAtB72G,kBAAoCA,uBAAoBtpD,EAC3F,SAASogK,EAA4B/mK,GACnC,MAAiC,+BAA1BklK,EAAellK,GAExB,SAASgnK,EAAoBhnK,GAC3B,YAAqC,IAA1B8mK,SAIwC,IAAxCC,EAA4Bf,UACrCe,EAA4Bf,QAAUe,EAA4B,IAAID,IAGjEC,EAA4Bf,QAC/Be,EAA4B/mK,GAC5BA,aAAiB8mK,GA6BvB,SAASlyI,EAAe50B,GACtB,OAAOwlK,EAAoBxlK,EAAOmlK,GAIpC,SAAStwI,EAAe70B,GACtB,OAAOwlK,EAAoBxlK,EAAOolK,GAIpC,SAAStwI,EAAgB90B,GACvB,OAAOwlK,EAAoBxlK,EAAOqlK,GAIpC,SAAStwI,EAAe/0B,GACtB,OAAOglK,GAAmBQ,EAAoBxlK,EAAOslK,GAIvD,SAAStwI,EAAeh1B,GACtB,OAAOilK,GAAmBO,EAAoBxlK,EAAOulK,GAhDvDtoK,EAAQ+pK,oBAAsBA,EAK9B/pK,EAAQgqK,gBAHR,SAAyBjnK,GACvB,MAAiC,2BAA1BklK,EAAellK,IAOxB/C,EAAQiqK,cAHR,SAAuBlnK,GACrB,MAAiC,0BAA1BklK,EAAellK,IAOxB/C,EAAQkqK,cAHR,SAAuBnnK,GACrB,MAAiC,0BAA1BklK,EAAellK,IAOxB/C,EAAQmqK,kBAHR,SAA2BpnK,GACzB,MAAiC,uBAA1BklK,EAAellK,IAOxB/C,EAAQoqK,4BAHR,SAAqCrnK,GACnC,MAAiC,gCAA1BklK,EAAellK,IAOxB/C,EAAQ23B,eAAiBA,EAKzB33B,EAAQ43B,eAAiBA,EAKzB53B,EAAQ63B,gBAAkBA,EAK1B73B,EAAQ83B,eAAiBA,EAKzB93B,EAAQ+3B,eAAiBA,EAWzB/3B,EAAQ03B,iBATR,SAA0B30B,GACxB,OACE40B,EAAe50B,IACf60B,EAAe70B,IACf80B,EAAgB90B,IAChB+0B,EAAe/0B,IACfg1B,EAAeh1B,IAWnB/C,EAAQo3B,iBANR,SAA0Br0B,GACxB,MAA6B,oBAAfk2B,aACZ6vI,EAAc/lK,IACdgnK,EAAoBhnK,KAKxB,CAAC,UAAW,aAAc,2BAA2BuB,SAAQ,SAAS8B,GACpEU,OAAO8nB,eAAe5uB,EAASoG,EAAQ,CACrCyoB,YAAY,EACZ9rB,MAAO,WACL,MAAM,IAAIxC,MAAM6F,EAAS,+ECrT3BmtI,EAA4BzsI,OAAOysI,2BACrC,SAAmC/tI,GAGjC,IAFA,IAAIuB,EAAOD,OAAOC,KAAKvB,GACnB6kK,EAAc,GACT19J,EAAI,EAAGA,EAAI5F,EAAKnE,OAAQ+J,IAC/B09J,EAAYtjK,EAAK4F,IAAM7F,OAAO6tB,yBAAyBnvB,EAAKuB,EAAK4F,IAEnE,OAAO09J,GAGPC,EAAe,WACnBtqK,EAAQghE,OAAS,SAAS/pC,GACxB,IAAKqxF,EAASrxF,GAAI,CAEhB,IADA,IAAIszI,EAAU,GACL59J,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IACpC49J,EAAQlkK,KAAKuN,EAAQrN,UAAUoG,KAEjC,OAAO49J,EAAQpmK,KAAK,KAGlBwI,EAAI,EAmBR,IAnBA,IACIxH,EAAOoB,UACPmG,EAAMvH,EAAKvC,OACX+H,EAAMwC,OAAO8pB,GAAG/nB,QAAQo7J,GAAc,SAAS9sJ,GACjD,GAAU,OAANA,EAAY,MAAO,IACvB,GAAI7Q,GAAKD,EAAK,OAAO8Q,EACrB,OAAQA,GACN,IAAK,KAAM,OAAOrQ,OAAOhI,EAAKwH,MAC9B,IAAK,KAAM,OAAOlM,OAAO0E,EAAKwH,MAC9B,IAAK,KACH,IACE,OAAOzC,KAAKC,UAAUhF,EAAKwH,MAC3B,MAAOoT,GACP,MAAO,aAEX,QACE,OAAOvC,MAGJA,EAAIrY,EAAKwH,GAAIA,EAAID,EAAK8Q,EAAIrY,IAAOwH,GACpCu5J,EAAO1oJ,KAAO2qG,EAAS3qG,GACzB7S,GAAO,IAAM6S,EAEb7S,GAAO,IAAMiJ,EAAQ4J,GAGzB,OAAO7S,GAOT3K,EAAQwvI,UAAY,SAASjlH,EAAIxf,GAC/B,QAAuB,IAAZogB,IAAqD,IAA1BA,EAAQq/I,cAC5C,OAAOjgJ,EAIT,QAAuB,IAAZY,EACT,OAAO,WACL,OAAOnrB,EAAQwvI,UAAUjlH,EAAIxf,GAAKzE,MAAMhF,KAAMiF,YAIlD,IAAI2jB,GAAS,EAeb,OAdA,WACE,IAAKA,EAAQ,CACX,GAAIiB,EAAQs/I,iBACV,MAAM,IAAIlqK,MAAMwK,GACPogB,EAAQu/I,iBACjBr/I,EAAQoT,MAAM1zB,GAEdsgB,EAAQxoB,MAAMkI,GAEhBmf,GAAS,EAEX,OAAOK,EAAGjkB,MAAMhF,KAAMiF,aAO1B,IAAIokK,EAAS,GACTC,EAAgB,KAEpB,GAAIz/I,EAAQ0/C,IAAIggG,WAAY,CAC1B,IAAIC,EAAW3/I,EAAQ0/C,IAAIggG,WAC3BC,EAAWA,EAAS57J,QAAQ,qBAAsB,QAC/CA,QAAQ,MAAO,MACfA,QAAQ,KAAM,OACdJ,cACH87J,EAAgB,IAAI5xI,OAAO,IAAM8xI,EAAW,IAAK,KA2BnD,SAASl3J,EAAQpO,EAAK+6B,GAEpB,IAAIrb,EAAM,CACR6lJ,KAAM,GACNC,QAASC,GAkBX,OAfI1kK,UAAU3D,QAAU,IAAGsiB,EAAIuM,MAAQlrB,UAAU,IAC7CA,UAAU3D,QAAU,IAAGsiB,EAAIumD,OAASllE,UAAU,IAC9C2kK,EAAU3qI,GAEZrb,EAAI0M,WAAa2O,EACRA,GAETvgC,EAAQmrK,QAAQjmJ,EAAKqb,GAGnB6qI,EAAYlmJ,EAAI0M,cAAa1M,EAAI0M,YAAa,GAC9Cw5I,EAAYlmJ,EAAIuM,SAAQvM,EAAIuM,MAAQ,GACpC25I,EAAYlmJ,EAAIumD,UAASvmD,EAAIumD,QAAS,GACtC2/F,EAAYlmJ,EAAIsM,iBAAgBtM,EAAIsM,eAAgB,GACpDtM,EAAIumD,SAAQvmD,EAAI8lJ,QAAUK,GACvBC,EAAYpmJ,EAAK1f,EAAK0f,EAAIuM,OAoCnC,SAAS45I,EAAiB1gK,EAAK4gK,GAC7B,IAAIrgG,EAAQt3D,EAAQ43J,OAAOD,GAE3B,OAAIrgG,EACK,KAAYt3D,EAAQ63D,OAAOP,GAAO,GAAK,IAAMvgE,EAC7C,KAAYiJ,EAAQ63D,OAAOP,GAAO,GAAK,IAEvCvgE,EAKX,SAASsgK,EAAetgK,EAAK4gK,GAC3B,OAAO5gK,EAeT,SAAS2gK,EAAYpmJ,EAAKniB,EAAOwxB,GAG/B,GAAIrP,EAAIsM,eACJzuB,GACAqlH,EAAWrlH,EAAM6Q,UAEjB7Q,EAAM6Q,UAAY5T,EAAQ4T,WAExB7Q,EAAMQ,aAAeR,EAAMQ,YAAYhC,YAAcwB,GAAQ,CACjE,IAAIkS,EAAMlS,EAAM6Q,QAAQ2gB,EAAcrP,GAItC,OAHKojG,EAASrzG,KACZA,EAAMq2J,EAAYpmJ,EAAKjQ,EAAKsf,IAEvBtf,EAIT,IAAIpL,EA+FN,SAAyBqb,EAAKniB,GAC5B,GAAIqoK,EAAYroK,GACd,OAAOmiB,EAAI8lJ,QAAQ,YAAa,aAClC,GAAI1iD,EAASvlH,GAAQ,CACnB,IAAI0oK,EAAS,IAAOvhK,KAAKC,UAAUpH,GAAOmM,QAAQ,SAAU,IAClBA,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAAO,IACjE,OAAOgW,EAAI8lJ,QAAQS,EAAQ,UAE7B,OAAIC,EAAS3oK,GACJmiB,EAAI8lJ,QAAQ,GAAKjoK,EAAO,UAC7BmoK,EAAUnoK,GACLmiB,EAAI8lJ,QAAQ,GAAKjoK,EAAO,WAE7BmjK,EAAOnjK,GACFmiB,EAAI8lJ,QAAQ,OAAQ,aAD7B,EA7GgBW,CAAgBzmJ,EAAKniB,GACrC,GAAI8G,EACF,OAAOA,EAIT,IAAI9C,EAAOD,OAAOC,KAAKhE,GACnB6oK,EApCN,SAAqBj1I,GACnB,IAAIquB,EAAO,GAMX,OAJAruB,EAAMryB,SAAQ,SAAS2C,EAAK04B,GAC1BqlB,EAAK/9C,IAAO,KAGP+9C,EA6BW6mH,CAAY9kK,GAQ9B,GANIme,EAAI0M,aACN7qB,EAAOD,OAAOw5D,oBAAoBv9D,IAKhC8E,EAAQ9E,KACJgE,EAAK2nB,QAAQ,YAAc,GAAK3nB,EAAK2nB,QAAQ,gBAAkB,GACrE,OAAOo9I,EAAY/oK,GAIrB,GAAoB,IAAhBgE,EAAKnE,OAAc,CACrB,GAAIwlH,EAAWrlH,GAAQ,CACrB,IAAI3B,EAAO2B,EAAM3B,KAAO,KAAO2B,EAAM3B,KAAO,GAC5C,OAAO8jB,EAAI8lJ,QAAQ,YAAc5pK,EAAO,IAAK,WAE/C,GAAIuoB,EAAS5mB,GACX,OAAOmiB,EAAI8lJ,QAAQhyI,OAAOz3B,UAAUgM,SAAS1L,KAAKkB,GAAQ,UAE5D,GAAIu0B,EAAOv0B,GACT,OAAOmiB,EAAI8lJ,QAAQz8J,KAAKhN,UAAUgM,SAAS1L,KAAKkB,GAAQ,QAE1D,GAAI8E,EAAQ9E,GACV,OAAO+oK,EAAY/oK,GAIvB,IA2CI+kB,EA3CAhnB,EAAO,GAAI61B,GAAQ,EAAOo1I,EAAS,CAAC,IAAK,KA6B7C,OA1BI9oK,EAAQF,KACV4zB,GAAQ,EACRo1I,EAAS,CAAC,IAAK,MAIb3jD,EAAWrlH,KAEbjC,EAAO,cADCiC,EAAM3B,KAAO,KAAO2B,EAAM3B,KAAO,IACf,KAIxBuoB,EAAS5mB,KACXjC,EAAO,IAAMk4B,OAAOz3B,UAAUgM,SAAS1L,KAAKkB,IAI1Cu0B,EAAOv0B,KACTjC,EAAO,IAAMyN,KAAKhN,UAAUyqK,YAAYnqK,KAAKkB,IAI3C8E,EAAQ9E,KACVjC,EAAO,IAAMgrK,EAAY/oK,IAGP,IAAhBgE,EAAKnE,QAAkB+zB,GAAyB,GAAhB5zB,EAAMH,OAItC2xB,EAAe,EACb5K,EAAS5mB,GACJmiB,EAAI8lJ,QAAQhyI,OAAOz3B,UAAUgM,SAAS1L,KAAKkB,GAAQ,UAEnDmiB,EAAI8lJ,QAAQ,WAAY,YAInC9lJ,EAAI6lJ,KAAK1kK,KAAKtD,GAIZ+kB,EADE6O,EAsCN,SAAqBzR,EAAKniB,EAAOwxB,EAAcq3I,EAAa7kK,GAE1D,IADA,IAAI+gB,EAAS,GACJnb,EAAI,EAAGoR,EAAIhb,EAAMH,OAAQ+J,EAAIoR,IAAKpR,EACrC3K,EAAee,EAAOoK,OAAOR,IAC/Bmb,EAAOzhB,KAAK4lK,EAAe/mJ,EAAKniB,EAAOwxB,EAAcq3I,EACjDz+J,OAAOR,IAAI,IAEfmb,EAAOzhB,KAAK,IAShB,OANAU,EAAKzC,SAAQ,SAASqB,GACfA,EAAIwD,MAAM,UACb2e,EAAOzhB,KAAK4lK,EAAe/mJ,EAAKniB,EAAOwxB,EAAcq3I,EACjDjmK,GAAK,OAGNmiB,EArDIokJ,CAAYhnJ,EAAKniB,EAAOwxB,EAAcq3I,EAAa7kK,GAEnDA,EAAK7D,KAAI,SAASyC,GACzB,OAAOsmK,EAAe/mJ,EAAKniB,EAAOwxB,EAAcq3I,EAAajmK,EAAKgxB,MAItEzR,EAAI6lJ,KAAK13I,MA6GX,SAA8BvL,EAAQhnB,EAAMirK,GAQ1C,OANajkJ,EAAO4X,QAAO,SAASv0B,EAAMuoB,GAGxC,OADIA,EAAIhF,QAAQ,MACTvjB,EAAOuoB,EAAIxkB,QAAQ,kBAAmB,IAAItM,OAAS,IACzD,GAEU,GACJmpK,EAAO,IACG,KAATjrK,EAAc,GAAKA,EAAO,OAC3B,IACAgnB,EAAO3jB,KAAK,SACZ,IACA4nK,EAAO,GAGTA,EAAO,GAAKjrK,EAAO,IAAMgnB,EAAO3jB,KAAK,MAAQ,IAAM4nK,EAAO,GA5H1DI,CAAqBrkJ,EAAQhnB,EAAMirK,IAxBjCA,EAAO,GAAKjrK,EAAOirK,EAAO,GA+CrC,SAASD,EAAY/oK,GACnB,MAAO,IAAMxC,MAAMgB,UAAUgM,SAAS1L,KAAKkB,GAAS,IAwBtD,SAASkpK,EAAe/mJ,EAAKniB,EAAOwxB,EAAcq3I,EAAajmK,EAAKgxB,GAClE,IAAIv1B,EAAMuJ,EAAK+yD,EAsCf,IArCAA,EAAO52D,OAAO6tB,yBAAyB5xB,EAAO4C,IAAQ,CAAE5C,MAAOA,EAAM4C,KAC5DjF,IAELiK,EADE+yD,EAAKl9D,IACD0kB,EAAI8lJ,QAAQ,kBAAmB,WAE/B9lJ,EAAI8lJ,QAAQ,WAAY,WAG5BttG,EAAKl9D,MACPmK,EAAMua,EAAI8lJ,QAAQ,WAAY,YAG7BhpK,EAAe4pK,EAAajmK,KAC/BvE,EAAO,IAAMuE,EAAM,KAEhBgF,IACCua,EAAI6lJ,KAAKr8I,QAAQgvC,EAAK36D,OAAS,GAE/B4H,EADEu7J,EAAO3xI,GACH+2I,EAAYpmJ,EAAKw4C,EAAK36D,MAAO,MAE7BuoK,EAAYpmJ,EAAKw4C,EAAK36D,MAAOwxB,EAAe,IAE5C7F,QAAQ,OAAS,IAErB/jB,EADEgsB,EACIhsB,EAAIiE,MAAM,MAAM1L,KAAI,SAASkpK,GACjC,MAAO,KAAOA,KACbjoK,KAAK,MAAMqxB,OAAO,GAEf,KAAO7qB,EAAIiE,MAAM,MAAM1L,KAAI,SAASkpK,GACxC,MAAO,MAAQA,KACdjoK,KAAK,OAIZwG,EAAMua,EAAI8lJ,QAAQ,aAAc,YAGhCI,EAAYhqK,GAAO,CACrB,GAAIu1B,GAAShxB,EAAIwD,MAAM,SACrB,OAAOwB,GAETvJ,EAAO8I,KAAKC,UAAU,GAAKxE,IAClBwD,MAAM,iCACb/H,EAAOA,EAAKo0B,OAAO,EAAGp0B,EAAKwB,OAAS,GACpCxB,EAAO8jB,EAAI8lJ,QAAQ5pK,EAAM,UAEzBA,EAAOA,EAAK8N,QAAQ,KAAM,OACdA,QAAQ,OAAQ,KAChBA,QAAQ,WAAY,KAChC9N,EAAO8jB,EAAI8lJ,QAAQ5pK,EAAM,WAI7B,OAAOA,EAAO,KAAOuJ,EA6BvB,SAAS1H,EAAQ60I,GACf,OAAO90I,MAAMC,QAAQ60I,GAIvB,SAASozB,EAAUrkK,GACjB,MAAsB,kBAARA,EAIhB,SAASq/J,EAAOr/J,GACd,OAAe,OAARA,EAST,SAAS6kK,EAAS7kK,GAChB,MAAsB,iBAARA,EAIhB,SAASyhH,EAASzhH,GAChB,MAAsB,iBAARA,EAShB,SAASukK,EAAYvkK,GACnB,YAAe,IAARA,EAIT,SAAS8iB,EAAS5a,GAChB,OAAOo5G,EAASp5G,IAA8B,oBAAvBooB,EAAepoB,GAKxC,SAASo5G,EAASthH,GAChB,MAAsB,iBAARA,GAA4B,OAARA,EAIpC,SAASywB,EAAOsG,GACd,OAAOuqF,EAASvqF,IAA4B,kBAAtBzG,EAAeyG,GAKvC,SAAS/1B,EAAQG,GACf,OAAOmgH,EAASngH,KACW,mBAAtBmvB,EAAenvB,IAA2BA,aAAazH,OAK9D,SAAS6nH,EAAWvhH,GAClB,MAAsB,mBAARA,EAgBhB,SAASswB,EAAe/e,GACtB,OAAOtR,OAAOvF,UAAUgM,SAAS1L,KAAKuW,GAIxC,SAASspC,EAAIpiC,GACX,OAAOA,EAAI,GAAK,IAAMA,EAAE/R,SAAS,IAAM+R,EAAE/R,SAAS,IAvbpDvN,EAAQ8pI,SAAW,SAAStpI,GAE1B,GADAA,EAAMA,EAAIsO,eACL67J,EAAOnqK,GACV,GAAIoqK,EAAcjiK,KAAKnI,GAAM,CAC3B,IAAI6rK,EAAMlhJ,EAAQkhJ,IAClB1B,EAAOnqK,GAAO,WACZ,IAAIuK,EAAM/K,EAAQghE,OAAO16D,MAAMtG,EAASuG,WACxC8kB,EAAQxoB,MAAM,YAAarC,EAAK6rK,EAAKthK,SAGvC4/J,EAAOnqK,GAAO,aAGlB,OAAOmqK,EAAOnqK,IAoChBR,EAAQ4T,QAAUA,EAIlBA,EAAQ63D,OAAS,CACf,KAAS,CAAC,EAAG,IACb,OAAW,CAAC,EAAG,IACf,UAAc,CAAC,EAAG,IAClB,QAAY,CAAC,EAAG,IAChB,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,KAAS,CAAC,GAAI,IACd,KAAS,CAAC,GAAI,IACd,MAAU,CAAC,GAAI,IACf,QAAY,CAAC,GAAI,IACjB,IAAQ,CAAC,GAAI,IACb,OAAW,CAAC,GAAI,KAIlB73D,EAAQ43J,OAAS,CACf,QAAW,OACX,OAAU,SACV,QAAW,SACX,UAAa,OACb,KAAQ,OACR,OAAU,QACV,KAAQ,UAER,OAAU,OA+QZxrK,EAAQssK,MAAQ,EAAhB,MAKAtsK,EAAQiD,QAAUA,EAKlBjD,EAAQkrK,UAAYA,EAKpBlrK,EAAQkmK,OAASA,EAKjBlmK,EAAQgmK,kBAHR,SAA2Bn/J,GACzB,OAAc,MAAPA,GAOT7G,EAAQ0rK,SAAWA,EAKnB1rK,EAAQsoH,SAAWA,EAKnBtoH,EAAQusK,SAHR,SAAkB1lK,GAChB,MAAsB,iBAARA,GAOhB7G,EAAQorK,YAAcA,EAKtBprK,EAAQ2pB,SAAWA,EACnB3pB,EAAQssK,MAAM3iJ,SAAWA,EAKzB3pB,EAAQmoH,SAAWA,EAKnBnoH,EAAQs3B,OAASA,EACjBt3B,EAAQssK,MAAMh1I,OAASA,EAMvBt3B,EAAQ6H,QAAUA,EAClB7H,EAAQssK,MAAM70I,cAAgB5vB,EAK9B7H,EAAQooH,WAAaA,EAUrBpoH,EAAQwsK,YARR,SAAqB3lK,GACnB,OAAe,OAARA,GACe,kBAARA,GACQ,iBAARA,GACQ,iBAARA,GACQ,iBAARA,QACQ,IAARA,GAIhB7G,EAAQ0C,SAAW,EAAnB,KAYA,IAAI+pK,EAAS,CAAC,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MAAO,MACxD,MAAO,MAAO,OAG5B,SAAS3e,IACP,IAAIlwH,EAAI,IAAIrvB,KACRwB,EAAO,CAAC2xC,EAAI9jB,EAAE8uI,YACNhrH,EAAI9jB,EAAE+uI,cACNjrH,EAAI9jB,EAAEgvI,eAAezoK,KAAK,KACtC,MAAO,CAACy5B,EAAEivI,UAAWJ,EAAO7uI,EAAEkvI,YAAa/8J,GAAM5L,KAAK,KAqCxD,SAASnC,EAAewD,EAAKW,GAC3B,OAAOW,OAAOvF,UAAUS,eAAeH,KAAK2D,EAAKW,GAjCnDnG,EAAQmzB,IAAM,WACZ9H,EAAQ8H,IAAI,UAAW26H,IAAa9tJ,EAAQghE,OAAO16D,MAAMtG,EAASuG,aAiBpEvG,EAAQkB,SAAW,EAAnB,MAEAlB,EAAQmrK,QAAU,SAASvzH,EAAQ5/B,GAEjC,IAAKA,IAAQmwG,EAASnwG,GAAM,OAAO4/B,EAInC,IAFA,IAAI7wC,EAAOD,OAAOC,KAAKiR,GACnBrL,EAAI5F,EAAKnE,OACN+J,KACLirC,EAAO7wC,EAAK4F,IAAMqL,EAAIjR,EAAK4F,IAE7B,OAAOirC,GAOT,IAAIm1H,EAA6C,oBAAXlkJ,OAAyBA,OAAO,8BAA2Bnf,EA0DjG,SAASsjK,EAAsBv3I,EAAQ4U,GAKrC,IAAK5U,EAAQ,CACX,IAAIw3I,EAAY,IAAI1sK,MAAM,2CAC1B0sK,EAAUx3I,OAASA,EACnBA,EAASw3I,EAEX,OAAO5iI,EAAG5U,GAlEZz1B,EAAQktK,UAAY,SAAmBC,GACrC,GAAwB,mBAAbA,EACT,MAAM,IAAIhhJ,UAAU,oDAEtB,GAAI4gJ,GAA4BI,EAASJ,GAA2B,CAClE,IAAIxiJ,EACJ,GAAkB,mBADdA,EAAK4iJ,EAASJ,IAEhB,MAAM,IAAI5gJ,UAAU,iEAKtB,OAHArlB,OAAO8nB,eAAerE,EAAIwiJ,EAA0B,CAClDhqK,MAAOwnB,EAAIsE,YAAY,EAAOE,UAAU,EAAOD,cAAc,IAExDvE,EAGT,SAASA,IAQP,IAPA,IAAI4xI,EAAgBC,EAChB7tD,EAAU,IAAIzhF,SAAQ,SAAUC,EAAS+c,GAC3CqyH,EAAiBpvI,EACjBqvI,EAAgBtyH,KAGd3kC,EAAO,GACFwH,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IACpCxH,EAAKkB,KAAKE,UAAUoG,IAEtBxH,EAAKkB,MAAK,SAAUgF,EAAKtI,GACnBsI,EACF+wJ,EAAc/wJ,GAEd8wJ,EAAep5J,MAInB,IACEoqK,EAAS7mK,MAAMhF,KAAM6D,GACrB,MAAOkG,GACP+wJ,EAAc/wJ,GAGhB,OAAOkjG,EAQT,OALAznG,OAAOwpB,eAAe/F,EAAIzjB,OAAO0pB,eAAe28I,IAE5CJ,GAA0BjmK,OAAO8nB,eAAerE,EAAIwiJ,EAA0B,CAChFhqK,MAAOwnB,EAAIsE,YAAY,EAAOE,UAAU,EAAOD,cAAc,IAExDhoB,OAAO4wC,iBACZntB,EACAgpH,EAA0B45B,KAI9BntK,EAAQktK,UAAU54I,OAASy4I,EAiD3B/sK,EAAQotK,YAlCR,SAAqBD,GACnB,GAAwB,mBAAbA,EACT,MAAM,IAAIhhJ,UAAU,oDAMtB,SAASkhJ,IAEP,IADA,IAAIloK,EAAO,GACFwH,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IACpCxH,EAAKkB,KAAKE,UAAUoG,IAGtB,IAAI2gK,EAAUnoK,EAAKkuB,MACnB,GAAuB,mBAAZi6I,EACT,MAAM,IAAInhJ,UAAU,8CAEtB,IAAIlY,EAAO3S,KACP+oC,EAAK,WACP,OAAOijI,EAAQhnK,MAAM2N,EAAM1N,YAI7B4mK,EAAS7mK,MAAMhF,KAAM6D,GAClBunB,MAAK,SAASzX,GAAOkW,EAAQs/B,SAASpgB,EAAG/e,KAAK,KAAM,KAAMrW,OACrD,SAASs4J,GAAOpiJ,EAAQs/B,SAASuiH,EAAsB1hJ,KAAK,KAAMiiJ,EAAKljI,OAMjF,OAHAvjC,OAAOwpB,eAAe+8I,EAAevmK,OAAO0pB,eAAe28I,IAC3DrmK,OAAO4wC,iBAAiB21H,EACA95B,EAA0B45B,IAC3CE,wCCxsBT,MAAMG,EAAK,EAAQ,MACbt9H,EAAe,EAAQ,MACvBu9H,EAAM,EAAQ,MACdpzD,EAAM,EAAQ,MACdqzD,EAAmB,EAAQ,MAwbjC,MAAMC,EACJpqK,YAAak6G,EAASmwD,GACpBtsK,KAAKusK,SAAWpwD,EAChBn8G,KAAKwsK,WAAaF,GAAa,QAC/BtsK,KAAKysK,OAAS,EACdzsK,KAAKkuD,QAAU,EAEfluD,KAAKyB,MAAQzB,KAAKusK,SAAS,GAG7B/a,MACExxJ,KAAKkuD,UACDluD,KAAKkuD,SAAWluD,KAAKusK,SAASvsK,KAAKysK,QAAQzsK,KAAKwsK,cAClDxsK,KAAKysK,SACLzsK,KAAKkuD,QAAU,GAGjBluD,KAAKyB,MAAQzB,KAAKusK,SAASvsK,KAAKysK,SAcpChuK,EAAOC,QAjdP,cAAyBkwC,EACvB3sC,YAAa4iE,GACXzjC,QAEAphC,KAAK0sK,QAAU,GACf1sK,KAAK28F,MAAQ93B,EACb7kE,KAAKm9D,SAAW,KAChBn9D,KAAK2sK,UAAU,GAGjBA,UAAWtrK,GACLrB,KAAKm9D,UACPn9D,KAAKm9D,SAAS33B,UAGhB,IAAIonI,EAAS,EACb5sK,KAAKm9D,SAAWgvG,EAAIxrK,SACpB,MAAMksK,EAAa7sK,KAAK28F,MAAM24C,iBAAiB,CAC7CzuI,MAAOxF,IAETwrK,EAAW1nG,KAAKnlE,KAAKm9D,UAErB,MAAM2vG,EAAa3rD,IACI,SAAjBA,EAAQn5G,MACVhI,KAAKm9D,SAAS9pB,eAAe,MAAOy5H,GACpC9sK,KAAKm9D,SAASx8D,QAAOosK,IACnBF,EAAWrnI,UACX,IACExlC,KAAKgtK,aAAaD,GAClB,MAAOhjK,GACPA,EAAIG,QAAU,0BAA0BH,EAAIG,UAC5ClK,KAAKylC,KAAK,QAAS17B,QAGdo3G,EAAQ7/G,OApCG,MAqCpBsrK,GAAUzrD,EAAQ7/G,OAClBtB,KAAKm9D,SAASulD,WAEd1iH,KAAKm9D,SAAS9pB,eAAe,MAAOy5H,GACpCF,GAAUzrD,EAAQ7/G,OAClBurK,EAAWrnI,UACXxlC,KAAKm9D,SAAS33B,UACdxlC,KAAK2sK,UAAUtrK,EAASurK,KAG5B5sK,KAAKm9D,SAASz4B,GAAG,MAAOooI,GAI1BE,aAAcD,GACZ,MAAME,EAAQF,EAAKE,MACnBjtK,KAAK0sK,QAAU,GACf1sK,KAAKktK,WAAY,EACjBltK,KAAKmtK,WAAY,EACjB,IAAK,IAAI9hK,EAAI,EAAGA,EAAI4hK,EAAM3rK,OAAQ+J,IAAK,CACrC,MAAM+hK,EAAOH,EAAM5hK,GACbgiK,EAAOD,EAAKE,KAAKC,KAAKF,KACtBG,EAAYH,EAAKnxD,KAAKC,QAAQ,GAC9B6C,EAAcouD,EAAKE,KAAKvuD,KAAKC,YACnC,IAAIyuD,EACA/5B,EACJ,GAAoB,SAAhB10B,GAA6C,SAAnBwuD,EAAUxlK,KAAiB,CACvD,GAAIhI,KAAKktK,UACP,SAEFltK,KAAKktK,WAAY,EACjBO,EAAQ,OACJD,EAAUxwD,OACZywD,GAAS,IAAID,EAAUxwD,KAAKC,aAE9By2B,EAAO,sBAAsB+5B,SACxB,IAAoB,SAAhBzuD,GAA6C,SAAnBwuD,EAAUxlK,KAW7C,SAVA,GAAIhI,KAAKmtK,UACP,SAEFntK,KAAKmtK,WAAY,EACjBM,EAAQ,OACJD,EAAUjwD,MAAQiwD,EAAUjwD,KAAKN,YACnCwwD,GAAS,IAAID,EAAUjwD,KAAKN,aAE9By2B,EAAO,sBAAsB+5B,KAK/B,MAAMC,EAAU,GAChB,IAAIC,EAAS,EAGTC,EAAgB,EAChBzwH,EAAQ,EACR0wH,EAAgB,EAChBC,EAAqB,EAGrBC,EAAM,EACV,MAAMC,EAAoB,IAAI3B,EAAegB,EAAKlvD,KAAKhC,SACvD,IAAI8xD,EAA0B,KAC1BZ,EAAKjvD,OACP6vD,EAA0B,IAAI5B,EAAegB,EAAKjvD,KAAKjC,UAIzD,IAAI+xD,EAAkB,EAEtB,OAAa,CACX,IAAIC,EAAiBd,EAAK/uD,KAAKnC,QAAQ2xD,GAGvC,MAAMlvK,EAAOyuK,EAAKtvD,KAAK5B,QAAQwxD,GAGzBluG,EAAWuuG,EAAkBvsK,MAAMg+D,SACnC2uG,EAAqBH,EAA0BA,EAAwBxsK,MAAM48G,kBAAoB,EAGvG,IAAIt3E,GAAO,EACPsmI,EAAKrvD,OACPj3E,EAAOsmI,EAAKrvD,KAAK7B,QAAQ+xD,KAAqBP,EAAS,GAIzD,MAAMU,EAAmBhB,EAAKpvD,MAAQovD,EAAKnvD,KAY3C,GAXAwvD,EAAQ3oK,KAAK,CACXnG,KAAAA,EACA6gE,SAAAA,EACAsuG,IAAAA,EACAK,mBAAAA,EACArnI,KAAAA,EACA1lC,OAAQwsK,EAAgBQ,EAAiBlyD,QAAQh/D,KAInDwwH,IACIA,GAAUN,EAAKtvD,KAAK5B,QAAQ76G,OAC9B,MAMF,GAFAssK,IACAC,GAAiBjvK,EACbgvK,GAAiBO,EAAe3vD,gBAAiB,CAEnDovD,EAAgB,EAChBC,EAAgB,EAChB1wH,IAEA,MAAMmxH,EAAiBjB,EAAK/uD,KAAKnC,QAAQ2xD,EAAqB,GAC1DQ,GAAkBnxH,EAAQ,GAAKmxH,EAAe/vD,YAChDuvD,IAKJC,GAAOtuG,EACPuuG,EAAkBxc,MAClByc,GAA2BA,EAAwBzc,MAG/CzqH,GACFmnI,IAIJd,EAAKE,KAAK5xD,KAAKj8C,SAAW,EAC1B2tG,EAAKjyD,KAAK17C,SAAW,EAErB,MAAM6/C,EAAgC6uD,EAAe1vD,oBAE/C8vD,EAAY,CAChBvmK,KAAM,OACNqyG,KAAM0yD,EAAK1yD,KACX4yD,MAAO,CAAC,CACN9xD,KAAMiyD,EAAKjyD,KACXmyD,KAAM,CACJ5xD,KAAM0xD,EAAKE,KAAK5xD,KAChBqD,KAAMquD,EAAKE,KAAKvuD,KAChByvD,KAAMpB,EAAKE,KAAKkB,KAChBjB,KAAM,CACJ1xD,KAAMuxD,EAAKE,KAAKC,KAAK1xD,KACrBG,KAAMoxD,EAAKE,KAAKC,KAAKvxD,KACrByyD,KAAMrB,EAAKE,KAAKC,KAAKkB,KACrBpB,KAAM,CACJnxD,KAAMmxD,EAAKnxD,KACXiC,KAgRP,CACL73B,QAAS,EACTnxD,MAAO,EACPgnF,QAAS,IAlRGiC,KA+QP,CACL93B,QAAS,EACTnxD,MAAO,EACPgnF,QAAS,IAjRGmC,KA8QP,CACLh4B,QAAS,EACTnxD,MAAO,EACPgnF,QAAS,IAhRG4B,KA6QP,CACLz3B,QAAS,EACTnxD,MAAO,EACPgnF,QAAS,IA/QG8B,KA4QP,CACL33B,QAAS,EACTnxD,MAAO,EACPgnF,QAAS,IA9QG6B,KA2QP,CACL13B,QAAS,EACTnxD,MAAO,EACPgnF,QAAS,SAzQLuyD,KAAM,CACJvvD,KAAM,CACJC,iBAAkB2tD,EAAK1yD,KAAK56C,UAE9BkvG,MAAO,CAAC,CACNvzD,QAASgyD,EAAKjyD,KAAKC,QACnBkE,8BAAAA,EACAC,sBAAuB,EACvBC,kBAAmB,EACnBC,mBAAoB,MAK1Bz/G,KAAK0sK,QAAQ3nK,KAAK,CAChB6pK,iBAAkB,EAClBxzD,QAASgyD,EAAKjyD,KAAKC,QACnBZ,UAAW4yD,EAAKE,KAAK5xD,KAAKlB,UAC1BkzD,QAAAA,EACAmB,WAAY,KACZC,SAAU,KACV/B,KAAMwB,EACN76B,KAAAA,IAIJ,GAA4B,IAAxB1zI,KAAK0sK,QAAQprK,OAEf,YADAtB,KAAKylC,KAAK,QAAS,IAAIxmC,MAAM,uBAK/B8tK,EAAK1yD,KAAK56C,SAAW,EAErBz/D,KAAK+uK,MAAQ,CACX/mK,KAAM,OACNmyG,MAAO,OACPC,aAAc,EACdF,iBAAkB,CAChB,SAIJ,MAAM80D,EAAUj2D,EAAIh4G,OAAOf,KAAK+uK,OAC1BnuK,EAAOZ,KAAK0sK,QAAQ9qK,KAAIkF,IAC5B,MAAMmoK,EAAUl2D,EAAIh4G,OAAO+F,EAAMimK,MACjC,MAAO,CACLr5B,KAAM5sI,EAAM4sI,KACZzpF,KAAM/oD,EAAOqC,OAAO,CAACyrK,EAASC,QAIlCjvK,KAAKylC,KAAK,QAAS7kC,GAGrBsuK,KAAMzgK,GACJ,IAAKzO,KAAK0sK,QACR,MAAM,IAAIztK,MAAM,yCAGde,KAAKmvK,cACPnvK,KAAKmvK,YAAY3pI,UACjBxlC,KAAKmvK,YAAc,MAGrB,IAAInyE,GAAe,EAyCnB,GAxCAh9F,KAAK0sK,QAAQ9qK,KAAI,CAACkF,EAAOuE,KAGnBvE,EAAMsoK,WACRtoK,EAAMsoK,UAAU5pI,UAEd1+B,EAAMuoK,WACRvoK,EAAMuoK,SAAS7pI,UACf1+B,EAAMuoK,SAAW,MAEnB,MAAMD,EAAYtoK,EAAMsoK,UAAYjD,EAAIprK,SAClCuuK,EAAWtvK,KAAKuvK,kBAAkBlkK,EAAGoD,GAC3C,IAAK6gK,EACH,OAAOF,EAAU/rD,aAGE,IAAjBrmB,GAAsBsyE,EAAS/oC,OAAO,GAAG1/H,MAAQm2F,KACnDA,EAAcsyE,EAAS/oC,OAAO,GAAG1/H,OAGnC,MAAM2oK,EAAiBC,IACjBL,EAAUjsI,WACdisI,EAAUp1D,IAAIy1D,EAAKC,MAAM3lK,IACvB,GAAIA,EAAK,OAAO/J,KAAKylC,KAAK,QAAS17B,GAC/BqlK,EAAUjsI,WACOr8B,EAAMuoK,SAASzsK,MAAM6sK,EAAKlpC,QAClCphE,KAAKiqG,EAAUlsD,UAAUusD,EAAKnuK,QAAQyI,IACjD,GAAIA,EAAK,OAAO/J,KAAKylC,KAAK,QAAS17B,GACnC,GAAIqlK,EAAUjsI,UAAW,OACzB,MAAMwsI,EAAW3vK,KAAKuvK,kBAAkBlkK,GACxC,IAAKskK,EACH,OAAOP,EAAU/rD,WAEnBmsD,EAAcG,WAIpBH,EAAcF,MAGZtyE,GAAe,EAAG,CACpB,MAAM6vE,EAAa7sK,KAAKmvK,YAAcnvK,KAAK28F,MAAM24C,iBAAiB,CAChEzuI,MAAOm2F,IAGTh9F,KAAK0sK,QAAQ1pK,SAAQ8D,IACnBA,EAAMuoK,SAAW,IAAIjD,EAAiBpvE,EAAa,CAIjD+mB,cAAe,MAEjB8oD,EAAW1nG,KAAKr+D,EAAMuoK,aAI1B,OAAOrvK,KAAK0sK,QAAQ9qK,KAAIkF,GACfA,EAAMsoK,YAIjBQ,kBAAmBC,EAAUphK,GAC3B,MAAM3H,EAAQ9G,KAAK0sK,QAAQmD,GACrBC,EAAah/J,KAAK6gB,MAAM7qB,EAAM0zG,UAAY/rG,GAChD,IAAIk/J,EAASzB,EAAGplK,EAAM4mK,QAASoC,GAAY,CAACnC,EAAQp5J,IACtCo5J,EAAOI,IAAMJ,EAAOS,mBACnB75J,IASf,KAPgB,IAAZo5J,EACFA,EAAS,EACAA,EAAS,IAClBA,GAAUA,EAAS,IAIb7mK,EAAM4mK,QAAQC,GAAQ5mI,MAC5B4mI,IAEF,OAAOA,EAGT4B,kBAAmBzoK,EAAO2H,GAMxB,MAAMshK,EAAY/vK,KAAK0sK,QAAQ5lK,GAC/B,IAAIkpK,EAOJ,GALEA,OADW5nK,IAATqG,EACYzO,KAAK4vK,kBAAkB9oK,EAAO2H,GAE9BshK,EAAUlB,WAGtBmB,GAAeD,EAAUrC,QAAQpsK,OAAU,OAAO,KAEtD,MAAM2uK,EAAWF,EAAUrC,QAAQsC,GAAajC,IAEhD,IAAImC,EAAW,EACf,MAAM3pC,EAAS,GACf,IAAK,IAAIsoC,EAAamB,EAAanB,EAAakB,EAAUrC,QAAQpsK,OAAQutK,IAAc,CACtF,MAAMlB,EAASoC,EAAUrC,QAAQmB,GACjC,GAAIlB,EAAO5mI,MAAQ4mI,EAAOI,IAAMkC,GAoGR,EApGoBF,EAAUv1D,UACpD,MAGF01D,GAAYvC,EAAO/uK,KACnB,MAAMioI,EAAYN,EAAOjlI,OAAS,EAC9BulI,EAAY,GAAKN,EAAOM,GAAWn5H,MAAQigK,EAAOtsK,OAEpDklI,EAAOxhI,KAAK,CACV8B,MAAO8mK,EAAOtsK,OACdqM,IAAKigK,EAAOtsK,OAASssK,EAAO/uK,OAG9B2nI,EAAOM,GAAWn5H,KAAOigK,EAAO/uK,KAMpC,OAFAmxK,EAAUlB,WAAaA,EAEhB,CACLa,KAAM1vK,KAAKmwK,cAAcrpK,EAAOkpK,EAAanB,GAC7CtoC,OAAAA,EACAjlI,OAAQ4uK,GAIZC,cAAerpK,EAAOkpK,EAAaI,GACjC,MAAML,EAAY/vK,KAAK0sK,QAAQ5lK,GAEzBq1G,EAAU,GAChB,IAAIk0D,EAAc,EAClB,IAAK,IAAI/kK,EAAI0kK,EAAa1kK,EAAI8kK,EAAY9kK,IAAK,CAC7C,MAAMujK,EAAakB,EAAUrC,QAAQpiK,GACjCujK,EAAWT,mBAAqB,IAAKiC,EAAc,GACvDl0D,EAAQp3G,KAAK,CACXk7G,eAAgB4uD,EAAWpvG,SAC3B49C,WAAYwxD,EAAWjwK,KACvBshH,YAAa2uD,EAAW9nI,KAAO,SAAY,SAC3Co5E,4BAA6B0uD,EAAWT,qBAI5C,MAAMsB,EAAO,CACX1nK,KAAM,OACN03G,KAAM,CACJC,eAAgBowD,EAAUnB,oBAE5B0B,MAAO,CAAC,CACN1wD,KAAM,CACJzqF,MAAO,OACPimF,QAAS20D,EAAU30D,SAErByE,KAAM,CACJC,oBAAqBiwD,EAAUrC,QAAQsC,GAAajC,KAEtDhuD,KAAM,CACJ5qF,MAAO,KACP6qF,WAAY,EACZ7D,QAAAA,EACA71B,QAAS+pF,MAQf,OAFAX,EAAKY,MAAM,GAAGvwD,KAAKC,YAAcjH,EAAIx7E,eAAemyI,GAE7CA,kCCxbX,MAAMx6D,EAAsB,EAAQ,MAC9Bq7D,EAAO,EAAQ,MAEfC,EAAa,EAAQ,MAE3B,SAAS38B,EAAahvE,EAAM4rG,EAAWxxI,EAAO,IAC5C,KAAMj/B,gBAAgB6zI,GAEpB,OADA9pH,EAAQH,KAAK,uDACN,IAAIiqH,EAAYhvE,EAAM4rG,EAAWxxI,GAG1Cj/B,KAAK01G,cAAgB,KAErB11G,KAAKu1G,MAAQk7D,EACbzwK,KAAK0wK,aAAe,IAAIx7D,EAAoBu7D,GAC5CzwK,KAAK2wK,eAAgB,EACrB3wK,KAAK4wK,WAAa,KAClB5wK,KAAK28F,MAAQ93B,EACb7kE,KAAK0sK,QAAU,KAEY,SAAvB1sK,KAAKu1G,MAAMs7D,SACb7wK,KAAK8wK,eAGP9wK,KAAK69J,SAAW,KACd79J,KAAK01G,cAAgB11G,KAAK0wK,aAAah7D,cACvC11G,KAAKwlC,WAGPxlC,KAAK+wK,WAAa,KAChB/wK,KAAK2wK,eAAgB,EAChB3wK,KAAKgxK,OAEChxK,KAAK0sK,SACd1sK,KAAKixK,QAFLjxK,KAAK8wK,gBAMLL,EAAU57B,WAAY47B,EAAUI,QAAU,QAC9CJ,EAAU95H,iBAAiB,UAAW32C,KAAK+wK,YAC3CN,EAAU95H,iBAAiB,QAAS32C,KAAK69J,UAG3ChqB,EAAY5zI,UAAY,CACtB6wK,eACE9wK,KAAKgxK,OAAS,IAAIR,EAAWxwK,KAAK28F,OAClC38F,KAAKgxK,OAAOtsI,GAAG,SAAS9jC,IACtBZ,KAAK0sK,QAAU9rK,EAAKgB,KAAIsvK,IACtB,MAAMC,EAAcnxK,KAAK0wK,aAAa75D,kBAAkBq6D,EAAUx9B,MAClEy9B,EAAYzsI,GAAG,SAAS36B,IACtB/J,KAAK0wK,aAAanvK,MAAMwI,MAE1B,MAAMjD,EAAQ,CACZsqK,MAAO,KACPD,YAAAA,EACAE,aAAa,EACbC,cAAe,MAQjB,OANAH,EAAYluK,MAAMiuK,EAAUjnH,MAAMlgD,IAChCjD,EAAMuqK,aAAc,EAChBvqK,EAAMwqK,eACRxqK,EAAMwqK,cAAcvnK,MAGjBjD,MAGL9G,KAAK2wK,eAAwC,SAAvB3wK,KAAKu1G,MAAMs7D,UACnC7wK,KAAKixK,WAITjxK,KAAKgxK,OAAOtsI,GAAG,SAAS36B,IACtB/J,KAAK0wK,aAAanvK,MAAMwI,OAG5BknK,QACE,MAAMG,EAAQpxK,KAAKgxK,OAAO9B,KAAKlvK,KAAKu1G,MAAMmC,aAAc13G,KAAK0sK,SAE7D1sK,KAAK0sK,QAAQ1pK,SAAQ,CAAC8D,EAAOuE,KAC3B,MAAMkmK,EAAY,KACZzqK,EAAMsqK,QACRtqK,EAAMsqK,MAAM5rI,UACZ1+B,EAAMqqK,YAAcnxK,KAAK0wK,aAAa75D,kBAAkB/vG,EAAMqqK,aAC9DrqK,EAAMqqK,YAAYzsI,GAAG,SAAS36B,IAC5B/J,KAAK0wK,aAAanvK,MAAMwI,OAG5BjD,EAAMsqK,MAAQA,EAAM/lK,GACpBklK,EAAKzpK,EAAMsqK,MAAOtqK,EAAMqqK,cAErBrqK,EAAMuqK,YASTE,IARAzqK,EAAMwqK,cAAgBvnK,IAChBA,EACF/J,KAAK0wK,aAAanvK,MAAMwI,GAG1BwnK,SAOR/rI,UACMxlC,KAAKmjC,YAGTnjC,KAAKmjC,WAAY,EAEjBnjC,KAAKu1G,MAAM1+D,oBAAoB,UAAW72C,KAAK+wK,YAC/C/wK,KAAKu1G,MAAM1+D,oBAAoB,QAAS72C,KAAK69J,UAEzC79J,KAAK0sK,SACP1sK,KAAK0sK,QAAQ1pK,SAAQ8D,IACfA,EAAMsqK,OACRtqK,EAAMsqK,MAAM5rI,aAKlBxlC,KAAKu1G,MAAM39D,IAAM,MAIrBn5C,EAAOC,QAAUm1I,gDCzHjB,MAAMjlG,EAAe,EAAQ,MACvB7nC,EAAO,EAAQ,MACfxD,EAAS,EAAQ,MACjBiuK,EAAgB,EAAQ,MACxBC,EAAe,EAAQ,MACvBpU,EAAM,EAAQ,KACdqU,EAAY,EAAQ,MACpB7iI,EAAW,EAAQ,MACnBsvF,EAAe,EAAQ,MACvBrvF,EAAO,EAAQ,MACfC,EAAiB,EAAQ,MACzBrP,EAAc,EAAQ,MACtBC,EAAO,EAAQ,MACfC,EAAc,EAAQ,OACtB,cAAEgwH,GAAkB,EAAQ,KAC5B+hB,EAAW,EAAQ,MACnBC,EAAU,EAAQ,OAChBtrF,QAASurF,GAAY,EAAQ,MAE/BpyI,EAAQgyI,EAAa,cAQrBK,EAAcD,EACjBjkK,QAAQ,SAASmrC,IAAK,IAAIA,EAAI,KAAMn2C,OAAO,KAC3CA,MAAM,EAAG,GASNmvK,EAAiB,MAAMD,KAM7B,MAAME,UAAmBpjI,EACvB3sC,YAAag9B,EAAO,IAClBmC,QAE2B,iBAAhBnC,EAAKsC,OACdvhC,KAAKuhC,OAAStC,EAAKsC,OACVrgC,EAAOE,SAAS69B,EAAKsC,QAC9BvhC,KAAKuhC,OAAStC,EAAKsC,OAAOt1B,SAAS,OAEnCjM,KAAKuhC,OAASrgC,EAAO2M,KAAKkkK,EAAiBryI,EAAY,GAAGzzB,SAAS,WAAWA,SAAS,OAEzFjM,KAAKwhC,aAAetgC,EAAO2M,KAAK7N,KAAKuhC,OAAQ,OAElB,iBAAhBtC,EAAKgzI,OACdjyK,KAAKiyK,OAAShzI,EAAKgzI,OACV/wK,EAAOE,SAAS69B,EAAKgzI,QAC9BjyK,KAAKiyK,OAAShzI,EAAKgzI,OAAOhmK,SAAS,OAEnCjM,KAAKiyK,OAASvyI,EAAY,IAAIzzB,SAAS,OAEzCjM,KAAKkyK,aAAehxK,EAAO2M,KAAK7N,KAAKiyK,OAAQ,OAE7CjyK,KAAKqhC,SAAWrhC,KAAKuhC,OAAOt1B,SAAS,OAAOqjB,UAAU,EAAG,GAEzDtvB,KAAKmjC,WAAY,EACjBnjC,KAAKmyK,WAAY,EACjBnyK,KAAKoyK,YAAcnzI,EAAKmzI,aAAe,EACvCpyK,KAAKs+J,QAAUr/H,EAAKq/H,SAAW,EAC/Bt+J,KAAKixC,aAA2B7oC,IAAjB62B,EAAKgS,QAAwBhS,EAAKgS,QAAU,GAC3DjxC,KAAKw+J,KAAmB,IAAbv/H,EAAKu/H,IAChBx+J,KAAKqyK,SAAW,GAChBryK,KAAKsyK,SAAWnzK,OAAO8/B,EAAKqzI,WAAa,GACzCtyK,KAAKuyK,IAAMP,EAAWQ,cAA4B,IAAbvzI,EAAKszI,IAE1CvyK,KAAKyyK,eAAiB3hK,KAAKC,IAAmC,iBAAvBkuB,EAAKyzI,cAA8BzzI,EAAKyzI,eAAiB,GAAI,GACpG1yK,KAAK2yK,aAAe7hK,KAAKC,IAAiC,iBAArBkuB,EAAK2zI,YAA4B3zI,EAAK2zI,aAAe,GAAI,GAE9F5yK,KAAK6yK,cAAgB,KACrB7yK,KAAK8yK,wBAA0B,KAC/B9yK,KAAK+yK,gBAAkB,GAEH,IAAhB9zI,EAAK+zI,QACP,sBAGFhzK,KAAKshC,OACH,iDACAthC,KAAKuhC,OAAQvhC,KAAKiyK,OAAQjyK,KAAKoyK,aAGjCpyK,KAAKizK,eAAiB,CACpBC,KAAM,IAAItjB,EAAc,CAAEI,KAAMl/I,KAAKC,IAAI/Q,KAAKyyK,eAAgB,GAAI/nG,QAAS1qE,KAAKyyK,gBAAkB,IAClG3N,GAAI,IAAIlV,EAAc,CAAEI,KAAMl/I,KAAKC,IAAI/Q,KAAK2yK,aAAc,GAAIjoG,QAAS1qE,KAAK2yK,cAAgB,KAG1F3yK,KAAKixC,UACqB,iBAAjBjxC,KAAKixC,UAAsBjxC,KAAKixC,QAAU,IACjDy0B,WAAWytG,OAASnzK,KAAKixC,QAAQZ,OAAMrwC,KAAKixC,QAAQZ,KAAOq1B,WAAWytG,OAGpD,mBAAbxB,EACT3xK,KAAKozK,UAAY,IAAIzB,EAAS3xK,MAE9B+uC,GAAe,KACb/uC,KAAKqzK,kBAKTrzK,KAAKszK,eAAiB1zI,IACtB5/B,KAAKuzK,aAAe3zI,KAEH,IAAbX,EAAK+I,KAAgC,mBAARq1H,GAE/Br9J,KAAKgoC,IAAM,IAAIq1H,EAAI73J,OAAO+iB,OAAO,GAAI,CAAE0pJ,OAAQjyK,KAAKiyK,QAAUhzI,EAAK+I,MAEnEhoC,KAAKgoC,IAAIxD,KAAK,SAASz6B,IACrB/J,KAAKykH,SAAS16G,MAGhB/J,KAAKgoC,IAAIxD,KAAK,aAAa,KACzB,MAAMykH,EAAUjpJ,KAAKgoC,IAAIihH,UACrBA,IAASjpJ,KAAKs+J,QAAUrV,EAAQ9/G,SAItCnpC,KAAKgoC,IAAIizD,gBAAgB,GAEzBj7F,KAAKgoC,IAAIm2H,OAAOn+J,KAAKs+J,UAErBt+J,KAAKgoC,KAAM,EAIbhoC,KAAKwzK,gBAAmC,IAAlBv0I,EAAKw0I,SAE3B,MAAMC,EAAQ,KACR1zK,KAAKmjC,YACTnjC,KAAK0zK,OAAQ,EACb1zK,KAAKylC,KAAK,WAGa,mBAAdisI,GAA8C,MAAlBzyI,EAAK00I,UAC1CjC,EAAUzyI,EAAK00I,UAAW,CACxBxyD,QAAS,CACP,aAAc,cAAc0wD,+BAE7B,CAAC9nK,EAAK6pK,KACP,GAAI7pK,EAAK,OAAOggB,EAAQxoB,MAAM,6BAA6BwI,EAAIG,WAC/DlK,KAAKqtG,QAAUumE,EACfF,OAGF3kI,EAAe2kI,GAYnBG,WAAYvf,EAAYvrH,EAAK,UAC3B,KAAMurH,aAAsBwf,eAAgB,MAAM,IAAI70K,MAAM,+BAC5D,GAAyB,cAArBq1J,EAAW7wJ,MAAuB,MAAM,IAAIxE,MAAM,0BAGtDe,KAAK6yK,cAAgBve,EAErBx0F,UAAU+yG,cAAcl8H,iBAAiB,WAAW5F,IAClD,MAAM,KAAEnwC,GAASmwC,EACjB,IAAKnwC,EAAKoH,MAAuB,gBAAdpH,EAAKoH,OAA0BpH,EAAK4zC,IAAK,OAAO,KACnE,IAAK5N,KAAamtI,GAAYnzK,EAAK4zC,IAAI5xC,MAAMhC,EAAK4zC,IAAIpnB,QAAQxsB,EAAK0tJ,MAAQ,eAAiB,GAAK1tJ,EAAK0tJ,MAAMhtJ,QAAQgM,MAAM,KAE1H,GADAymK,EAAW30E,UAAU20E,EAASlxK,KAAK,OAC9B+jC,IAAamtI,EAAU,OAAO,KAEnC,MAAO5qI,GAAQ4H,EAAMijI,MAEfnvG,EAAO7kE,KAAKZ,IAAIwnC,IAAa5mC,KAAKZ,IAAIwnC,GAAU2O,MAAMnZ,MAAKyoC,GAAQA,EAAK99D,OAASgtK,IACvF,IAAKlvG,EAAM,OAAO,KAElB,MAAO9vB,EAAUlV,EAAQt9B,GAAOsiE,EAAKovG,OAAOrzK,GACtC6rI,EAAgB5sG,GAAUA,EAAOtY,OAAOklH,iBAExC1lE,EAAU,KACd59B,EAAK0xG,UAAY,KACbh7G,GAAQA,EAAO2F,UACfjjC,GAAKA,EAAIijC,UACbxlC,KAAK+yK,kBACA/yK,KAAK+yK,kBACR/tI,cAAchlC,KAAK8yK,yBACnB9yK,KAAK8yK,wBAA0B,OAInC3pI,EAAK0xG,UAAYxyF,MAAAA,IACf,GAAI5+C,EAAI7I,KAAM,CACZ,IAAIu8C,EACJ,IACEA,SAAesvF,EAAc/lH,QAAQjlB,MACrC,MAAOiF,IAGTyiC,EAAK2xG,YAAY39F,GACZA,GAAO4pB,IACP/mE,KAAK8yK,0BAAyB9yK,KAAK8yK,wBAA0B7tI,aAAY,IAAM0tH,MAAM,GAAG3yJ,KAAK6yK,cAAcqB,UAAUhgJ,OAAO,EAAGl0B,KAAK6yK,cAAcqB,UAAUphH,YAAY,KAAO,GAAGlwD,MAAMyN,OAAOwgC,SAASyF,OAAOh1C,iCAxCpM,WA0ChBylE,KAGJ/mE,KAAK+yK,kBACL5pI,EAAK2xG,YAAY/lG,MAEnBhM,EAAG/oC,KAAK6yK,eAGN/vI,oBAAmB,OAAO9iC,KAAKszK,iBAE/BzwI,kBAAiB,OAAO7iC,KAAKuzK,eAE7BY,eACF,MAAM9B,EAAWryK,KAAKqyK,SAASltK,QAAO0gE,GAAgC,IAArBA,EAAQsuG,WAGzD,OAFmB9B,EAASj0I,QAAO,CAACvsB,EAAOg0D,IAAYh0D,EAAQg0D,EAAQjjC,YAAY,IACpEyvI,EAASj0I,QAAO,CAACvsB,EAAOg0D,IAAYh0D,GAASg0D,EAAQvkE,QAAU,IAAI,IAAM,GAItF8yK,YAGF,OAFiBp0K,KAAKqyK,SAASj0I,QAAO,CAACvsB,EAAOg0D,IAAYh0D,EAAQg0D,EAAQljC,UAAU,IACnE3iC,KAAKqyK,SAASj0I,QAAO,CAACvsB,EAAOg0D,IAAYh0D,EAAQg0D,EAAQ1L,UAAU,IAAM,GAY5F/6D,IAAKg/H,GACH,GAAIA,aAAqBwzC,GACvB,GAAI5xK,KAAKqyK,SAAS9pI,SAAS61F,GAAY,OAAOA,MACzC,CACL,IAAI7qE,EACJ,IAAMA,EAAS4qE,EAAaC,GAAa,MAAOr0H,IAEhD,IAAKwpD,EAAQ,OAAO,KACpB,IAAKA,EAAO3sB,SAAU,MAAM,IAAI3nC,MAAM,8BAEtC,IAAK,MAAM4mE,KAAW7lE,KAAKqyK,SACzB,GAAIxsG,EAAQj/B,WAAa2sB,EAAO3sB,SAAU,OAAOi/B,EAGrD,OAAO,KASTnvD,IAAK0nH,EAAWn/F,EAAO,GAAIo1I,EAAY,UACrC,GAAIr0K,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,uBAChB,mBAATggC,KAAsBA,EAAMo1I,GAAa,CAAC,GAAIp1I,IAEzD,MAAMq1I,EAAa,KACjB,IAAIt0K,KAAKmjC,UACT,IAAK,MAAM5uB,KAAKvU,KAAKqyK,SACnB,GAAI99J,EAAEqyB,WAAai/B,EAAQj/B,UAAYryB,IAAMsxD,EAE3C,YADAA,EAAQ4+C,SAAS,IAAIxlH,MAAM,gCAAgC4mE,EAAQj/B,cAMnE2tI,EAAU,KACVv0K,KAAKmjC,YACTkxI,EAAUxuG,GACV7lE,KAAKylC,KAAK,UAAWogC,KASvB7lE,KAAKshC,OAAO,OACZrC,EAAOA,EAAOz5B,OAAO+iB,OAAO,GAAI0W,GAAQ,GAExC,MAAM4mC,EAAU,IAAI+rG,EAAQxzC,EAAWp+H,KAAMi/B,GAO7C,OANAj/B,KAAKqyK,SAASttK,KAAK8gE,GAEnBA,EAAQrhC,KAAK,YAAa8vI,GAC1BzuG,EAAQrhC,KAAK,QAAS+vI,GACtB1uG,EAAQrhC,KAAK,SAdb,SAASogF,IACP/+C,EAAQxyB,eAAe,YAAaihI,GACpCzuG,EAAQxyB,eAAe,QAASkhI,GAChC1uG,EAAQxyB,eAAe,QAASuxE,MAa3B/+C,EASTikC,KAAM/jG,EAAOk5B,EAAMu1I,GACjB,GAAIx0K,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,uBAChB,mBAATggC,KAAsBA,EAAMu1I,GAAU,CAAC,GAAIv1I,IAEtDj/B,KAAKshC,OAAO,SACZrC,EAAOA,EAAOz5B,OAAO+iB,OAAO,GAAI0W,GAAQ,IAGnCw1I,YAAa,EAElB,MAAMC,EAA8B,iBAAV3uK,EAGtB2uK,IAAYz1I,EAAKl4B,KAAOA,EAAK85H,QAAQ96H,IACpCk5B,EAAK+mC,YAAW/mC,EAAK+mC,UAAY,cAAc8rG,KAEpD,MAoBM6C,EAAU9uG,IACd7lE,KAAKshC,OAAO,WACU,mBAAXkzI,GAAuBA,EAAO3uG,GACzCA,EAAQpgC,KAAK,QACbzlC,KAAKylC,KAAK,OAAQogC,IAGdA,EAAU7lE,KAAK0W,IAAI,KAAMuoB,GA3Bb4mC,IAChB,MAAMt0B,EAAQ,CACZxI,IAEE,GAAI2rI,GAAcz1I,EAAK21I,eAAgB,OAAO7rI,IAC9C88B,EAAQwD,KAAK9C,EAASx9B,KAGtB/oC,KAAKgoC,KACPuJ,EAAMxsC,MAAKgkC,IACT88B,EAAQrhC,KAAK,cAAeuE,MAGhC8F,EAAS0C,GAAOxnC,IACd,IAAI/J,KAAKmjC,UACT,OAAIp5B,EAAY87D,EAAQ4+C,SAAS16G,QACjC4qK,EAAQ9uG,SAYZ,IAAIU,EAyCJ,MA2JyB,oBAAbxC,UAlMGh+D,aAkMwCg+D,SAlMhCh+D,EAAQrE,MAAMmM,KAAK9H,GAChCrE,MAAMC,QAAQoE,KAAQA,EAAQ,CAACA,IAEzC8oC,EAAS9oC,EAAMnE,KAAIC,GAAQknC,KACpB9J,EAAK21I,gBAoLhB,SAAqB1wK,GACnB,MAAsB,iBAARA,GAA2B,MAAPA,GAAmC,mBAAbA,EAAIihE,KArL5BZ,CAAW1iE,GACrC0B,EAAO1B,GAAM,CAACkI,EAAKiB,KACjB,GAAIjB,EAAK,OAAOg/B,EAAGh/B,GACnBiB,EAAIlL,KAAO+B,EAAK/B,KAChBipC,EAAG,KAAM/9B,MAGX+9B,EAAG,KAAMlnC,OAET,CAACkI,EAAKhE,KACR,IAAI/F,KAAKmjC,UACT,OAAIp5B,EAAY87D,EAAQ4+C,SAAS16G,QAEjCynK,EAAcrqG,WAAWphE,EAAOk5B,GAAM,CAACl1B,EAAKwrC,KAC1C,IAAIv1C,KAAKmjC,UAAT,CACA,GAAIp5B,EAAK,OAAO87D,EAAQ4+C,SAAS16G,GAEjCw8D,EAAUhxB,EAAM3zC,KAAIijE,GAAQA,EAAKC,YAEjC0sG,EAAczrK,EAAOk5B,GAAM,CAACl1B,EAAKo1H,KAC/B,GAAIn/H,KAAKmjC,UAAW,OACpB,GAAIp5B,EAAK,OAAO87D,EAAQ4+C,SAAS16G,GAEjC,MAAM8qK,EAAkB70K,KAAKZ,IAAI+/H,GAC7B01C,GACF9qJ,EAAQH,KAAK,sDACbi8C,EAAQ4+C,WACc,mBAAX+vD,GAAuBA,EAAOK,IAEzChvG,EAAQivG,aAAa31C,aAMtBt5D,EAQT3K,OAAQkjE,EAAWn/F,EAAM8J,GACvB,GAAoB,mBAAT9J,EAAqB,OAAOj/B,KAAKk7D,OAAOkjE,EAAW,KAAMn/F,GAIpE,GAFAj/B,KAAKshC,OAAO,WACIthC,KAAKZ,IAAIg/H,GACX,MAAM,IAAIn/H,MAAM,sBAAsBm/H,KACpDp+H,KAAK+0K,QAAQ32C,EAAWn/F,EAAM8J,GAGhCgsI,QAAS32C,EAAWn/F,EAAM8J,GACxB,GAAoB,mBAAT9J,EAAqB,OAAOj/B,KAAK+0K,QAAQ32C,EAAW,KAAMn/F,GAErE,MAAM4mC,EAAU7lE,KAAKZ,IAAIg/H,GACpBv4D,IACL7lE,KAAKqyK,SAAS9jK,OAAOvO,KAAKqyK,SAASjlJ,QAAQy4C,GAAU,GACrDA,EAAQrgC,QAAQvG,EAAM8J,GAClB/oC,KAAKgoC,KACPhoC,KAAKgoC,IAAIgtI,QAAQ95G,OAAO2K,EAAQj/B,WAIpCqiH,UACE,OAAKjpJ,KAAKmyK,UACHnyK,KAAKozK,UACRpzK,KAAKozK,UAAU6B,UAAUhsB,UACzB,CAAEA,QAAS,UAAWC,OAAQ,OAAQ//G,KAAM,GAHpB,KAU9B+rI,iBAAkBllB,GAEhB,OADAA,EAAO7wJ,OAAO6wJ,KACVv6H,MAAMu6H,KAAU7wH,SAAS6wH,IAASA,GAAQ,KAC9ChwJ,KAAKyyK,eAAiBziB,EAClBhwJ,KAAKyyK,eAAiB,EAAUzyK,KAAKizK,eAAeC,KAAKpjB,YAAW,IACxE9vJ,KAAKizK,eAAeC,KAAKpjB,YAAW,QACpC9vJ,KAAKizK,eAAeC,KAAKnjB,QAAQ/vJ,KAAKyyK,kBAOxC0C,eAAgBnlB,GAEd,OADAA,EAAO7wJ,OAAO6wJ,KACVv6H,MAAMu6H,KAAU7wH,SAAS6wH,IAASA,GAAQ,KAC9ChwJ,KAAK2yK,aAAe3iB,EAChBhwJ,KAAK2yK,aAAe,EAAU3yK,KAAKizK,eAAenO,GAAGhV,YAAW,IACpE9vJ,KAAKizK,eAAenO,GAAGhV,YAAW,QAClC9vJ,KAAKizK,eAAenO,GAAG/U,QAAQ/vJ,KAAK2yK,gBAOtCntI,QAASuD,GACP,GAAI/oC,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,4BACpCe,KAAKykH,SAAS,KAAM17E,GAGtB07E,SAAU16G,EAAKg/B,GACb/oC,KAAKshC,OAAO,kBACZthC,KAAKmjC,WAAY,EAEjB,MAAMoO,EAAQvxC,KAAKqyK,SAASzwK,KAAIikE,GAAW98B,IACzC88B,EAAQrgC,QAAQuD,MAGd/oC,KAAKozK,WACP7hI,EAAMxsC,MAAKgkC,IACT/oC,KAAKozK,UAAU5tI,QAAQuD,MAIvB/oC,KAAKgoC,KACPuJ,EAAMxsC,MAAKgkC,IACT/oC,KAAKgoC,IAAIxC,QAAQuD,MAIrB8F,EAAS0C,EAAOxI,GAEZh/B,GAAK/J,KAAKylC,KAAK,QAAS17B,GAE5B/J,KAAKqyK,SAAW,GAChBryK,KAAKozK,UAAY,KACjBpzK,KAAKgoC,IAAM,KAEXhoC,KAAKizK,eAAeC,KAAK1tI,UACzBxlC,KAAKizK,eAAenO,GAAGt/H,UAGzB6tI,eAIE,GAHArzK,KAAKshC,OAAO,aACZthC,KAAKmyK,WAAY,EAEbnyK,KAAKozK,UAAW,CAElB,MAAMnqB,EAAUjpJ,KAAKozK,UAAU6B,UAAUhsB,UACrCA,IAASjpJ,KAAKoyK,YAAcnpB,EAAQ9/G,MAG1CnpC,KAAKylC,KAAK,aAGZnE,SACE,MAAMz9B,EAAO,GAAGjB,MAAMrC,KAAK0E,WAC3BpB,EAAK,GAAK,IAAI7D,KAAKqhC,aAAax9B,EAAK,KACrC47B,KAAS57B,GAGXuxK,WAAYC,GACV,IAAK,MAAMxvG,KAAW7lE,KAAKqyK,SAIzB,GAHKxsG,EAAQwvG,eACXxvG,EAAQwvG,aAAe11I,EAAKoH,KAAK7lC,EAAO2M,KAAK,WAA0Bg4D,EAAQj/B,SAAU,SAEvFyuI,IAAiBxvG,EAAQwvG,aAC3B,OAAOxvG,EAIX,OAAO,MAIXmsG,EAAWxhI,eAAiB1B,EAAK0B,eACjCwhI,EAAWQ,YAAcb,EAASa,YAClCR,EAAWH,QAAUA,EAoBrBpzK,EAAOC,QAAUszK,kBCnjBjB,MAAMnyI,EAAS,EAAQ,MACjB4xI,EAAe,EAAQ,MACvBn6E,EAAM,EAAQ,MAEd73D,EAAQgyI,EAAa,0BAU3B,MAAM6D,UAAmBz1I,EAAO48D,SAC9Bx6F,YAAa4iE,EAAM5lC,GACjBmC,MAAMnC,GAENj/B,KAAKu1K,SAAW1wG,EAAK0wG,SAErB,MAAM1uK,EAASo4B,GAAQA,EAAKp4B,OAAU,EAChC6G,EAAOuxB,GAAQA,EAAKvxB,KAAOuxB,EAAKvxB,IAAMm3D,EAAKvjE,OAC7C29B,EAAKvxB,IACLm3D,EAAKvjE,OAAS,EAEZ8kE,EAAcvB,EAAK0wG,SAASnvG,YAElCpmE,KAAKw1K,aAAe3uK,EAAQg+D,EAAKxjE,QAAU+kE,EAAc,EACzDpmE,KAAKy1K,WAAa/nK,EAAMm3D,EAAKxjE,QAAU+kE,EAAc,EAErDpmE,KAAK01K,OAAS11K,KAAKw1K,YACnBx1K,KAAKkuD,QAAWrnD,EAAQg+D,EAAKxjE,OAAWrB,KAAKw1K,YAAcpvG,EAE3DpmE,KAAK0hH,SAAWh0G,EAAM7G,EAAQ,EAC9B7G,KAAK6iH,UAAW,EAChB7iH,KAAK21K,YAAa,EAClB31K,KAAK41K,gBAAkB9kK,KAAK/D,IAAK,QAAcq5D,EAAe,EAAG,GAEjEpmE,KAAKu1K,SAASM,OAAO71K,KAAKw1K,YAAax1K,KAAKy1K,WAAW,GAAM,KAC3Dz1K,KAAK81K,aAIPx+E,EAAIt3F,MAAO+J,IACT/J,KAAKwlC,QAAQz7B,MAIjBkgC,QACMjqC,KAAK6iH,WACT7iH,KAAK6iH,UAAW,EAChB7iH,KAAK81K,WAGPA,UACE,IAAK91K,KAAK6iH,UAA8B,IAAlB7iH,KAAK0hH,SAAgB,OAC3C,IAAK1hH,KAAKu1K,SAASzsI,SAAS1pC,IAAIY,KAAK01K,QACnC,OAAO11K,KAAKu1K,SAASQ,SAAS/1K,KAAK01K,OAAQ11K,KAAK01K,OAAS11K,KAAK41K,iBAGhE,GAAI51K,KAAK21K,WAAY,OAGrB,GAFA31K,KAAK21K,YAAa,EAEd31K,KAAKu1K,SAASpyI,UAAW,OAAOnjC,KAAKwlC,QAAQ,IAAIvmC,MAAM,oBAE3D,MAAMuQ,EAAIxP,KAAK01K,OAETM,EAAU,GAEZxmK,IAAMxP,KAAKu1K,SAASlvG,OAAO/kE,OAAS,IACtC00K,EAAQ10K,OAAStB,KAAKu1K,SAAS52C,iBAEjC3+H,KAAKu1K,SAASz6G,MAAM17D,IAAIoQ,EAAGwmK,GAAS,CAACjsK,EAAKwB,KAExC,GADAvL,KAAK21K,YAAa,GACd31K,KAAKmjC,UAAT,CAGA,GAFA1D,EAAM,+BAAgCjwB,EAAGjE,GAAUA,EAAOjK,OAAQyI,GAAOA,EAAIG,SAEzEH,EAAK,OAAO/J,KAAKwlC,QAAQz7B,GAEzB/J,KAAKkuD,UACP3iD,EAASA,EAAO3I,MAAM5C,KAAKkuD,SAC3BluD,KAAKkuD,QAAU,GAGbluD,KAAK0hH,SAAWn2G,EAAOjK,SACzBiK,EAASA,EAAO3I,MAAM,EAAG5C,KAAK0hH,WAEhC1hH,KAAK0hH,UAAYn2G,EAAOjK,OAExBm+B,EAAM,8BAA+Bl0B,EAAOjK,QAC5CtB,KAAK6iH,UAAW,EAChB7iH,KAAK+E,KAAKwG,GAEY,IAAlBvL,KAAK0hH,UAAgB1hH,KAAK+E,KAAK,UAErC/E,KAAK01K,QAAU,EAGjBjxD,SAAU16G,EAAKg/B,GACR/oC,KAAKu1K,SAASpyI,WACjBnjC,KAAKu1K,SAASU,SAASj2K,KAAKw1K,YAAax1K,KAAKy1K,WAAW,GAE3D1sI,EAAGh/B,IAIPtL,EAAOC,QAAU42K,kBC1GjB,MAAM1mI,EAAe,EAAQ,OACvB,YAAEo2B,GAAgB,EAAQ,MAC1Bj+D,EAAO,EAAQ,MACf+rI,EAAS,EAAQ,IACjBojC,EAAe,EAAQ,MACvBtiC,EAAkB,EAAQ,MAC1BuiC,EAAiB,EAAQ,MACzBpnI,EAAiB,EAAQ,MACzBqnI,EAAc,EAAQ,MACtB1iC,EAAO,EAAQ,MACfp8C,EAAM,EAAQ,MACdg+E,EAAa,EAAQ,MAkO3B72K,EAAOC,QAhOP,cAAmBkwC,EACjB3sC,YAAa4jE,EAAShB,GACpBzjC,QAEAphC,KAAKu1K,SAAW1vG,EAChB7lE,KAAK+wJ,YAAa,EAClB/wJ,KAAKq2K,aAAe,IAAIr8I,IAExBh6B,KAAKF,KAAO+kE,EAAK/kE,KACjBE,KAAK+G,KAAO89D,EAAK99D,KACjB/G,KAAKsB,OAASujE,EAAKvjE,OACnBtB,KAAKqB,OAASwjE,EAAKxjE,OAEnBrB,KAAK+0B,MAAO,EAEZ,MAAMluB,EAAQg+D,EAAKxjE,OACbqM,EAAM7G,EAAQg+D,EAAKvjE,OAAS,EAElCtB,KAAKw1K,YAAc3uK,EAAQ7G,KAAKu1K,SAASnvG,YAAc,EACvDpmE,KAAKy1K,UAAY/nK,EAAM1N,KAAKu1K,SAASnvG,YAAc,EAE/B,IAAhBpmE,KAAKsB,SACPtB,KAAK+0B,MAAO,EACZ/0B,KAAKylC,KAAK,SAGZzlC,KAAKs2K,eAAiBzwG,EAAQl0B,OAAOkhI,cAGnCjwI,iBACF,GAAI5iC,KAAK+wJ,aAAe/wJ,KAAKu1K,SAASzsI,SAAU,OAAO,EAEvD,MAAM,OAAEu9B,EAAM,SAAEv9B,EAAQ,YAAEs9B,EAAW,gBAAEu4D,GAAoB3+H,KAAKu1K,UACxDC,YAAa3uK,EAAO4uK,UAAW/nK,GAAQ1N,KAMzCu2K,EAAsBC,IAC1B,MAAMprK,EAAMorK,IAAenwG,EAAO/kE,OAAS,EAAIq9H,EAAkBv4D,EACjE,OAAIt9B,EAAS1pC,IAAIo3K,GAERprK,EAGAA,EAAMi7D,EAAOmwG,GAAY3X,SAIpC,IAAIj8H,EAAa,EACjB,IAAK,IAAIh5B,EAAQ/C,EAAO+C,GAAS8D,EAAK9D,GAAS,EAAG,CAChD,MAAM6sK,EAAkBF,EAAmB3sK,GAG3C,GAFAg5B,GAAc6zI,EAEV7sK,IAAU/C,EAAO,CAGnB,MAAM6vK,EAA4B12K,KAAKqB,OAAS+kE,EAChDxjC,GAAc9xB,KAAK/D,IAAI2pK,EAA2BD,GAGpD,GAAI7sK,IAAU8D,EAAK,CAGjB,MAAMipK,GAA0CjpK,IA7BnC24D,EAAO/kE,OAAS,EAAIq9H,EAAkBv4D,IA6BKpmE,KAAKqB,OAASrB,KAAKsB,QAAU8kE,EACrFxjC,GAAc9xB,KAAK/D,IAAI4pK,EAA0BF,IAIrD,OAAO7zI,EAGLuxI,eACF,OAAOn0K,KAAKsB,OAAStB,KAAK4iC,WAAa5iC,KAAKsB,OAAS,EAGvDu0K,OAAQe,GACc,IAAhB52K,KAAKsB,QACTtB,KAAKu1K,SAASM,OAAO71K,KAAKw1K,YAAax1K,KAAKy1K,UAAWmB,GAGzDX,WACsB,IAAhBj2K,KAAKsB,QACTtB,KAAKu1K,SAASU,SAASj2K,KAAKw1K,YAAax1K,KAAKy1K,WAAW,GAG3DngC,iBAAkBr2G,GAChB,GAAoB,IAAhBj/B,KAAKsB,OAAc,CACrB,MAAMu1K,EAAQ,IAAI7xG,EAIlB,OAHAj2B,GAAe,KACb8nI,EAAMnpK,SAEDmpK,EAGT,MAAMhK,EAAa,IAAIyI,EAAWt1K,KAAMi/B,GAOxC,OALAj/B,KAAKq2K,aAAa3/J,IAAIm2J,GACtBA,EAAWroI,KAAK,SAAS,KACvBxkC,KAAKq2K,aAAap9I,OAAO4zI,MAGpBA,EAGT3kC,UAAWn/F,GACTotI,EAAen2K,KAAKs1I,mBAAoBt1I,KAAKsB,OAAQynC,GAGvDiuH,QAASjuH,GACP,GAAsB,oBAAX14B,OAAwB,MAAM,IAAIpR,MAAM,uBACnDi3K,EAAal2K,KAAKs1I,mBAAoBt1I,KAAK82K,gBACxC1rJ,MACCmrB,GAAQxN,EAAG,KAAMwN,KACjBxsC,GAAOg/B,EAAGh/B,KAIhB2qI,WAAY3rG,GACV,GAAsB,oBAAX14B,OAAwB,MAAM,IAAIpR,MAAM,uBACnD20I,EAAgB5zI,KAAKs1I,mBAAoBt1I,KAAK82K,gBAC3C1rJ,MACCwqH,GAAW7sG,EAAG,KAAM6sG,KACpB7rI,GAAOg/B,EAAGh/B,KAIhBgtK,SAAU9sK,EAAMg1B,EAAM8J,GACpB,GAAsB,oBAAX14B,OAAwB,MAAM,IAAIpR,MAAM,uBACnD6zI,EAAOO,OAAOrzI,KAAMiK,EAAMg1B,EAAM8J,GAGlCiuI,SAAU/sK,EAAMg1B,EAAM8J,GACpB,GAAsB,oBAAX14B,OAAwB,MAAM,IAAIpR,MAAM,uBACnD6zI,EAAOA,OAAO9yI,KAAMiK,EAAMg1B,EAAM8J,GAGlCkrI,OAAQzlI,GACN,MAAMhsC,EAAM,CACVgrH,OAAQ,IACRrM,QAAS,CAEP,gBAAiB,QACjB,eAAgBuyB,EAAKh3G,QAAQ18B,KAAKF,MAClC,gBAAiB,iDACjBm3K,QAAS,KAEXl3K,KAAqB,SAAfyuC,EAAI1pC,OAAoB,GAAK,UAGb,aAApB0pC,EAAI0oI,cACN10K,EAAI2+G,QAAQ,gBAAkB,2BAC9B3+G,EAAI2+G,QAAQ,uBAAyB,aACrC3+G,EAAIzC,KAAO,YAKb,IAAIo+B,EAAQi4I,EAAYp2K,KAAKsB,OAAQktC,EAAI2yE,QAAQhjF,OAAS,IAEtDA,EAAMl8B,cAAgBP,OACxBc,EAAIgrH,OAAS,IAGbrvF,EAAQA,EAAM,GAEd37B,EAAI2+G,QAAQ,iBAAmB,SAAShjF,EAAMt3B,SAASs3B,EAAMzwB,OAAO1N,KAAKsB,SACzEkB,EAAI2+G,QAAQ,kBAAoB,IAAGhjF,EAAMzwB,IAAMywB,EAAMt3B,MAAQ,IAE7DrE,EAAI2+G,QAAQ,kBAAoBnhH,KAAKsB,OAGvC,MAAMu+B,EAAwB,QAAf2O,EAAI1pC,QAAoB9E,KAAKs1I,iBAAiBn3G,GAE7D,IAAIgnC,EAAO,KAaX,OAZItlC,GACF7/B,KAAKylC,KAAK,SAAU,CAAE5F,OAAAA,EAAQ2O,IAAAA,EAAKq2B,KAAM7kE,OAAQm3K,IAC/ChyG,EAAOgyG,EAGP7/E,EAAI6/E,GAAO,KACLA,GAAOA,EAAM3xI,UACjB3F,EAAO2F,gBAKN,CAAChjC,EAAK2iE,GAAQtlC,EAAQslC,GAAQtlC,GAGvCu3I,aAAcruI,EAAK,UACjB,GAAsB,oBAAX14B,OAAwB,MAAM,IAAIpR,MAAM,uBACnD,IAAKe,KAAKs2K,eAAgB,MAAM,IAAIr3K,MAAM,wBAC1C,GAAkC,cAA9Be,KAAKs2K,eAAe7yK,MAAuB,MAAM,IAAIxE,MAAM,0BAG/D8pC,EAAG,KADS,GADO/oC,KAAKs2K,eAAepC,UAAUhgJ,OAAO,EAAGl0B,KAAKs2K,eAAepC,UAAUphH,YAAY,KAAO,GAAGlwD,MAAMyN,OAAOwgC,SAASyF,OAAOh1C,qBACrGtB,KAAKu1K,SAAS3uI,YAAY04D,UAAUt/F,KAAK+G,SAIlFswK,SAAUptK,EAAM8+B,EAAK,UACnB,GAAsB,oBAAX14B,OAAwB,MAAM,IAAIpR,MAAM,uBACnD,IAAKe,KAAKs2K,eAAgB,MAAM,IAAIr3K,MAAM,wBAC1C,GAAkC,cAA9Be,KAAKs2K,eAAe7yK,MAAuB,MAAM,IAAIxE,MAAM,0BAC/D,MAAMq4K,EAAat3K,KAAKs2K,eAAepC,UAAUhgJ,OAAO,EAAGl0B,KAAKs2K,eAAepC,UAAUphH,YAAY,KAAO,GAAGlwD,MAAMyN,OAAOwgC,SAASyF,OAAOh1C,QAC5I2I,EAAK2tC,IAAM,GAAG0/H,eAAwBt3K,KAAKu1K,SAAS3uI,YAAY04D,UAAUt/F,KAAK+G,QAC/EgiC,EAAG,KAAM9+B,GAGX6sK,eACE,OAAOhkC,EAAOY,KAAK3sI,EAAKm6H,QAAQlhI,KAAKF,MAAM+nC,eAG7C48E,WACEzkH,KAAK+wJ,YAAa,EAClB/wJ,KAAKu1K,SAAW,KAEhB,IAAK,MAAM1I,KAAc7sK,KAAKq2K,aAC5BxJ,EAAWrnI,UAEbxlC,KAAKq2K,aAAax3K,yBCzOtB,MAAM+vC,EAAe,EAAQ,OACvB,UAAEmI,GAAc,EAAQ,MACxBxX,EAAc,EAAQ,MACtBkyI,EAAe,EAAQ,MACvBzwI,EAAO,EAAQ,MAMfvB,EAAQgyI,EAAa,mBAE3B,IAAIuB,GAAS,EAEbt0K,EAAQ64K,aAAe,KACrBvE,GAAS,GAQXt0K,EAAQ84K,iBAAmB,CAACC,EAAMC,EAAOzE,KACvC,MAAM9/H,EAAO,IAAIrE,EAAK2oI,EAAKnpK,GAAI,UAK/B,GAJA6kC,EAAKskI,KAAOA,EACZtkI,EAAKukI,MAAQA,EACbvkI,EAAK8/H,eAAiBA,EAElB9/H,EAAKskI,KAAKhlI,UACZU,EAAK8C,gBACA,CACL,MAAM8wB,EAAU,KACd5zB,EAAKskI,KAAKpkI,eAAe,UAAW4C,GACpC9C,EAAKskI,KAAKpkI,eAAe,QAAS2C,IAE9BC,EAAY,KAChB8wB,IACA5zB,EAAK8C,aAEDD,EAAUjsC,IACdg9D,IACA5zB,EAAK3N,QAAQz7B,IAEfopC,EAAKskI,KAAKjzI,KAAK,UAAWyR,GAC1B9C,EAAKskI,KAAKjzI,KAAK,QAASwR,GACxB7C,EAAKwkI,sBAGP,OAAOxkI,GAQTz0C,EAAQk5K,sBAAwB,CAACH,EAAMxE,IAC9B4E,EAAoBJ,EAAM,cAAexE,GAQlDv0K,EAAQo5K,sBAAwB,CAACL,EAAMxE,IAC9B4E,EAAoBJ,EAAM,cAAexE,GAOlDv0K,EAAQq5K,sBAAwB,CAACp5K,EAAM+4K,EAAOzE,IACrC+E,EAAoBr5K,EAAM+4K,EAAO,cAAezE,GAOzDv0K,EAAQu5K,sBAAwB,CAACt5K,EAAM+4K,EAAOzE,IACrC+E,EAAoBr5K,EAAM+4K,EAAO,cAAezE,GAGzD,MAAM4E,EAAsB,CAACJ,EAAMzvK,EAAMirK,KACvC,MAAMt0K,EAAO,GAAG84K,EAAKvxB,iBAAiBuxB,EAAKrxB,aACrCjzG,EAAO,IAAIrE,EAAKnwC,EAAMqJ,GAO5B,OANAmrC,EAAKskI,KAAOA,EACZtkI,EAAKx0C,KAAOA,EACZw0C,EAAK8/H,eAAiBA,EAEtB9/H,EAAK8C,YAEE9C,GAGH6kI,EAAsB,CAACr5K,EAAM+4K,EAAO1vK,EAAMirK,KAC9C,MAAM9/H,EAAO,IAAIrE,EAAKnwC,EAAMqJ,GAK5B,OAJAmrC,EAAKx0C,KAAOA,EACZw0C,EAAKukI,MAAQA,EACbvkI,EAAK8/H,eAAiBA,EAEf9/H,GAMTz0C,EAAQw5K,kBAAoB,CAACT,EAAMnpK,EAAIopK,EAAOzE,KAC5C,MAAM9/H,EAAO,IAAIrE,EAAKxgC,EAAI,WAO1B,OANA6kC,EAAKukI,MAAQA,EACbvkI,EAAKskI,KAAOA,EACZtkI,EAAK8/H,eAAiBA,EAEtB9/H,EAAK8C,YAEE9C,GAST,MAAMrE,UAAaF,EACjB3sC,YAAaqM,EAAItG,GACfo5B,QAEAphC,KAAKsO,GAAKA,EACVtO,KAAKgI,KAAOA,EAEZy3B,EAAM,iBAAkBz3B,EAAMsG,GAE9BtO,KAAKrB,KAAO,KACZqB,KAAKy3K,KAAO,KACZz3K,KAAK03K,MAAQ,KACb13K,KAAK8yG,KAAO,KAEZ9yG,KAAKyyC,WAAY,EACjBzyC,KAAKmjC,WAAY,EACjBnjC,KAAK2zC,QAAU,KACf3zC,KAAKkhC,QAAU,EAEflhC,KAAKm4K,SAAU,EACfn4K,KAAKo4K,SAAU,EACfp4K,KAAKq4K,SAAU,EACfr4K,KAAKs4K,SAAU,EACft4K,KAAKu4K,eAAgB,EAOvBtiI,YACE,GAAIj2C,KAAKmjC,UAAW,OACpBnjC,KAAKyyC,WAAY,EAEjBhT,EAAM,oBAAqBz/B,KAAKsO,IAEhCq+B,aAAa3sC,KAAKw4K,gBAElB,MAAMf,EAAOz3K,KAAKy3K,KAClBA,EAAKjzI,KAAK,OAAO,KACfxkC,KAAKwlC,aAEPiyI,EAAKjzI,KAAK,SAAS,KACjBxkC,KAAKwlC,aAEPiyI,EAAKjzI,KAAK,UAAU,KAClBxkC,KAAKwlC,aAEPiyI,EAAKjzI,KAAK,SAASz6B,IACjB/J,KAAKwlC,QAAQz7B,MAGf,MAAM+oG,EAAO9yG,KAAK8yG,KAAO,IAAI9xE,EAAKhhC,KAAKgI,KAAMhI,KAAKkhC,QAAS8xI,GAE3DlgE,EAAKtuE,KAAK,OAAO,KACfxkC,KAAKwlC,aAEPstE,EAAKtuE,KAAK,SAAS,KACjBxkC,KAAKwlC,aAEPstE,EAAKtuE,KAAK,UAAU,KAClBxkC,KAAKwlC,aAEPstE,EAAKtuE,KAAK,SAASz6B,IACjB/J,KAAKwlC,QAAQz7B,MAGf+oG,EAAKtuE,KAAK,OAAO,KACfxkC,KAAKy4K,WAEP3lE,EAAKtuE,KAAK,OAAO,KACfxkC,KAAK04K,WAEP5lE,EAAKtuE,KAAK,OAAO,KACfxkC,KAAK24K,WAEP7lE,EAAKtuE,KAAK,OAAO,KACfxkC,KAAK44K,WAEP9lE,EAAKtuE,KAAK,aAAa,CAACoC,EAAUrF,KAChCvhC,KAAKgmC,YAAYY,EAAUrF,MAE7BvhC,KAAK64K,wBAEL74K,KAAK84K,mBAED94K,KAAK03K,QACW,gBAAd13K,KAAKgI,KACHgrK,GAA2B,IAAjBhzK,KAAKkhC,UAAkBlhC,KAAKm4K,QAASn4K,KAAKomC,UAC9CpmC,KAAKu4K,eAAev4K,KAAK2nC,YACZ,gBAAd3nC,KAAKgI,MAA2BhI,KAAKu4K,eAAev4K,KAAK2nC,aAIxEvB,UACEpmC,KAAK8yG,KAAK1sE,UACVpmC,KAAKm4K,SAAU,EAGjBM,QACEz4K,KAAKwmC,UAGPA,UACExmC,KAAK8yG,KAAKtsE,UACVxmC,KAAKo4K,SAAU,EAGjBM,QACE14K,KAAK2mC,UAGPA,UACE3mC,KAAK8yG,KAAKnsE,QAAQ3mC,KAAK03K,MAAM9wI,UAC7B5mC,KAAKq4K,SAAU,EAGjBM,MAAOtD,GACDr1K,KAAK03K,QACH13K,KAAK03K,MAAMrC,eAAiBA,GAC9Br1K,KAAKwlC,QAAQ,IAAIvmC,MAAM,yDAEzBe,KAAKunC,WAITA,UACEvnC,KAAK8yG,KAAKvrE,QAAQvnC,KAAK03K,MAAM9wI,UAC7B5mC,KAAKs4K,SAAU,EAGjBM,QACO54K,KAAKu4K,eAAev4K,KAAK2nC,YAGhCoxI,aACE/4K,KAAKy3K,KAAK1rC,SACV/rI,KAAK8yG,KAAKi5B,SAGZ+sC,mBACE,MAAMnmK,EAAO3S,KACbA,KAAKy3K,KACFtyG,KAAKnlE,KAAKizK,eAAeC,KAAK3iB,YAC9BprF,KAAK,IAAIpuB,EAAU,CAClB75B,UAAWigC,EAAO1+B,EAAGqiB,GACnBnuB,EAAK8yB,KAAK,WAAY0X,EAAM77C,QACxBqR,EAAKwwB,WACTrC,EAAS,KAAMqc,OAGlBgoB,KAAKnlE,KAAK8yG,MACV3tC,KAAKnlE,KAAKizK,eAAenO,GAAGvU,YAC5BprF,KAAK,IAAIpuB,EAAU,CAClB75B,UAAWigC,EAAO1+B,EAAGqiB,GACnBnuB,EAAK8yB,KAAK,SAAU0X,EAAM77C,QACtBqR,EAAKwwB,WACTrC,EAAS,KAAMqc,OAGlBgoB,KAAKnlE,KAAKy3K,MAQfzxI,YAAaY,EAAUrF,GACrB,IAAKvhC,KAAK03K,MAAO,OACjB,GAAI13K,KAAKmjC,UAAW,OAEpB,GAAInjC,KAAK03K,MAAMv0I,UACb,OAAOnjC,KAAKwlC,QAAQ,IAAIvmC,MAAM,4BAEhC,GAAI2nC,IAAa5mC,KAAK03K,MAAM9wI,SAC1B,OAAO5mC,KAAKwlC,QAAQ,IAAIvmC,MAAM,kDAEhC,GAAIsiC,IAAWvhC,KAAK03K,MAAMn2I,OACxB,OAAOvhC,KAAKwlC,QAAQ,IAAIvmC,MAAM,qCAGhCwgC,EAAM,2BAA4Bz/B,KAAKsO,GAAIs4B,GAE3C+F,aAAa3sC,KAAKg5K,kBAElBh5K,KAAKkhC,QAAU,EAEf,IAAIviC,EAAOqB,KAAKrB,MACXA,GAAQqB,KAAKy3K,KAAKvxB,eAAiBlmJ,KAAKy3K,KAAKrxB,aAChDznJ,EAAO,GAAGqB,KAAKy3K,KAAKvxB,iBAAiBlmJ,KAAKy3K,KAAKrxB,cAEjDpmJ,KAAK03K,MAAMuB,QAAQj5K,KAAK8yG,KAAMn0G,GAGzBqB,KAAK03K,QAAS13K,KAAK03K,MAAMv0I,YAEzBnjC,KAAKu4K,eAAev4K,KAAK2nC,aAGhCA,YACE,MAAM1I,EAAO,CACX+I,KAAKhoC,KAAK03K,MAAMzxG,WAAoBjmE,KAAK03K,MAAM/lI,OAAO3J,IACtDC,MAAM,GAERjoC,KAAK8yG,KAAKnrE,UAAU3nC,KAAK03K,MAAM9wI,SAAU5mC,KAAK03K,MAAM/lI,OAAOpQ,OAAQtC,GACnEj/B,KAAKu4K,eAAgB,EAGvBZ,sBACEhrI,aAAa3sC,KAAKw4K,gBAQlBx4K,KAAKw4K,eAAiBrzI,YAAW,KAC/BnlC,KAAKwlC,QAAQ,IAAIvmC,MAAM,sBAPI,CAC3Bi6K,OA5UyB,KA6UzBC,YA/UsB,IAgVtBC,YA/UsB,KAoVAp5K,KAAKgI,OACzBhI,KAAKw4K,eAAenzI,OAAOrlC,KAAKw4K,eAAenzI,QAGrDwzI,wBACElsI,aAAa3sC,KAAKg5K,kBAClBh5K,KAAKg5K,iBAAmB7zI,YAAW,KACjCnlC,KAAKwlC,QAAQ,IAAIvmC,MAAM,wBAzVH,MA2VlBe,KAAKg5K,iBAAiB3zI,OAAOrlC,KAAKg5K,iBAAiB3zI,QAGzDG,QAASz7B,GACP,GAAI/J,KAAKmjC,UAAW,OACpBnjC,KAAKmjC,WAAY,EACjBnjC,KAAKyyC,WAAY,EAEjBhT,EAAM,4BAA6Bz/B,KAAKgI,KAAMhI,KAAKsO,GAAIvE,IAAQA,EAAIG,SAAWH,IAE9E4iC,aAAa3sC,KAAKw4K,gBAClB7rI,aAAa3sC,KAAKg5K,kBAElB,MAAMtB,EAAQ13K,KAAK03K,MACbD,EAAOz3K,KAAKy3K,KACZ3kE,EAAO9yG,KAAK8yG,KAElB9yG,KAAK03K,MAAQ,KACb13K,KAAKy3K,KAAO,KACZz3K,KAAK8yG,KAAO,KAER4kE,GAAS5kE,GACXvzE,EAAYm4I,EAAM2B,MAAO3B,EAAM2B,MAAMjsJ,QAAQ0lF,IAE3C2kE,IACFA,EAAK/yI,GAAG,SAAS,SACjB+yI,EAAKjyI,WAEHstE,GAAMA,EAAKttE,UACXkyI,GAAOA,EAAM4B,WAAWt5K,KAAKsO,eCtRrC7P,EAAOC,QAtGP,MACEuD,YAAa4jE,GACX7lE,KAAKu1K,SAAW1vG,EAChB7lE,KAAK0lK,WAAa7/F,EAAQQ,OAAO/kE,OACjCtB,KAAKu5K,QAAU,IAAI73K,MAAM1B,KAAK0lK,YAE9B1lK,KAAKi5K,QAAUnmE,IACb9yG,KAAKw5K,cACLx5K,KAAKy5K,UAAU3mE,IAEjB9yG,KAAK05K,YAAc9vK,IACjB5J,KAAKu5K,QAAQ3vK,IAAU,GAEzB5J,KAAK25K,gBAAkB,KACrB35K,KAAKw5K,eAGPx5K,KAAKu1K,SAAS8D,MAAMr2K,SAAQ8vG,IAC1B9yG,KAAKy5K,UAAU3mE,MAEjB9yG,KAAKu1K,SAAS7wI,GAAG,OAAQ1kC,KAAKi5K,SAC9Bj5K,KAAKw5K,cAUPI,eAAgBC,GACd,IAAIC,EAAa,GACb/sK,EAAMsjB,EAAAA,EAEV,IAAK,IAAIhlB,EAAI,EAAGA,EAAIrL,KAAK0lK,aAAcr6J,EAAG,CACxC,GAAIwuK,IAAoBA,EAAgBxuK,GAAI,SAE5C,MAAM0uK,EAAe/5K,KAAKu5K,QAAQluK,GAC9B0uK,IAAiBhtK,EACnB+sK,EAAW/0K,KAAKsG,GACP0uK,EAAehtK,IACxB+sK,EAAa,CAACzuK,GACd0B,EAAMgtK,GAIV,OAAID,EAAWx4K,OAENw4K,EAAWhpK,KAAKw1B,SAAWwzI,EAAWx4K,OAAS,IAE9C,EAIZkkC,UACExlC,KAAKu1K,SAASliI,eAAe,OAAQrzC,KAAKi5K,SAC1Cj5K,KAAKu1K,SAAS8D,MAAMr2K,SAAQ8vG,IAC1B9yG,KAAKg6K,mBAAmBlnE,MAE1B9yG,KAAKu1K,SAAW,KAChBv1K,KAAKu5K,QAAU,KAEfv5K,KAAKi5K,QAAU,KACfj5K,KAAK05K,YAAc,KACnB15K,KAAK25K,gBAAkB,KAGzBF,UAAW3mE,GACTA,EAAKmnE,SAAW,KACdj6K,KAAKg6K,mBAAmBlnE,GACxB,IAAK,IAAIznG,EAAI,EAAGA,EAAIrL,KAAK0lK,aAAcr6J,EACrCrL,KAAKu5K,QAAQluK,IAAMynG,EAAKjxE,WAAWziC,IAAIiM,IAI3CynG,EAAKpuE,GAAG,OAAQ1kC,KAAK05K,aACrB5mE,EAAKpuE,GAAG,WAAY1kC,KAAK25K,iBACzB7mE,EAAKtuE,KAAK,QAASsuE,EAAKmnE,UAM1BT,cACEx5K,KAAKu5K,QAAQ10H,KAAK,GAElB,IAAK,MAAMiuD,KAAQ9yG,KAAKu1K,SAAS8D,MAC/B,IAAK,IAAIhuK,EAAI,EAAGA,EAAIrL,KAAK0lK,aAAcr6J,EACrCrL,KAAKu5K,QAAQluK,IAAMynG,EAAKjxE,WAAWziC,IAAIiM,GAK7C2uK,mBAAoBlnE,GAClBA,EAAKz/D,eAAe,OAAQrzC,KAAK05K,aACjC5mE,EAAKz/D,eAAe,WAAYrzC,KAAK25K,iBACjC7mE,EAAKmnE,UAAUnnE,EAAKz/D,eAAe,QAASy/D,EAAKmnE,UACrDnnE,EAAKmnE,SAAW,qCCrGpB,MAAMrrI,EAAe,EAAQ,MACvBqvF,EAAK,EAAQ,MACbi8C,EAAM,EAAQ,MACdnqD,EAAK,EAAQ,MACbhpH,EAAO,EAAQ,MACfozK,EAAe,EAAQ,OACrB/uG,QAASpsC,GAAa,EAAQ,MAChCo7I,EAAkB,EAAQ,MAC1B79G,EAAwB,EAAQ,MAChCyD,EAAO,EAAQ,MACfyxG,EAAe,EAAQ,MACvB4I,EAAY,EAAQ,MACpBC,EAAe,EAAQ,MACvBl7K,EAAM,EAAQ,MACdm7K,EAAsB,EAAQ,MAC9B1nE,EAAa,EAAQ,MACrB2nE,EAAmB,EAAQ,MAC3B52G,EAAc,EAAQ,MACtB/0B,EAAW,EAAQ,MACnB4rI,EAAgB,EAAQ,MACxBt8C,EAAe,EAAQ,MACvBygC,EAAQ,EAAQ,MAChB2R,EAAO,EAAQ,MACfxhI,EAAiB,EAAQ,MACzB2rI,EAAgB,EAAQ,MACxB/6I,EAAO,EAAQ,MACfC,EAAc,EAAQ,MACtBqlI,EAAa,EAAQ,MACrB0V,EAAQ,EAAQ,MAEhBC,EAAO,EAAQ,MACf9rI,EAAO,EAAQ,KACf+rI,EAAY,EAAQ,KACpBC,EAAS,EAAQ,MACjBvI,EAAM,EAAQ,MACdwI,EAAU,EAAQ,MAElBt7I,EAAQgyI,EAAa,sBAGrBuJ,EAAgB,IAChBC,EAAkB,EAAIrc,EAAMD,aAS5Buc,EAAyBrxJ,EAAQylB,QAAU0wB,IAAO1+D,OAAS,EAE3D65K,EAAiB,CAAC,IAAM,IAAM,MAG9BC,EAAa,cADH,0CAGhB,IAAIC,EACJ,IACEA,EAAMt0K,EAAKlE,KAAKo7H,EAAGq9C,SAAS,SAAW,OAAQ,cAC/C,MAAOvxK,GACPsxK,EAAMt0K,EAAKlE,KAA0B,mBAAdktH,EAAGwrD,OAAwBxrD,EAAGwrD,SAAW,IAAK,cAo0DvE,SAASC,EAAwB1oE,EAAMrzC,GACrC,IAAIn+D,EAAS,EAAIwP,KAAKS,KAAKkuD,EAAWqzC,EAAKhwE,gBAAkB87H,EAAMD,cAGnE,GAAI7rD,EAAKzwE,sBAAuB,CAC9B,MAAMo5I,EAAO3oE,EAAKzwE,sBAAsBo5I,KACpB,iBAATA,GAAqBA,EAAO,IACrCn6K,EAASwP,KAAK/D,IAAIzL,EAAQm6K,IAI9B,OAAOn6K,EAcT,SAASykC,KAETtnC,EAAOC,QA51DP,cAAsBkwC,EACpB3sC,YAAam8H,EAAWzsF,EAAQ1S,GAC9BmC,QAEAphC,KAAKqhC,SAAW,mBAChBrhC,KAAK2xC,OAASA,EAEd3xC,KAAKqvC,SAAWpQ,EAAKoQ,SACrBrvC,KAAK4lE,QAAU3mC,EAAK2mC,QAEpB5lE,KAAK+G,KAAOk4B,EAAKl4B,MAAQs0K,EACzBr7K,KAAK07K,OAASz8I,EAAKy8I,SAAU,EAC7B17K,KAAKy0K,aAAex1I,EAAKw1I,WACzBz0K,KAAK27K,OAAS18I,EAAK67B,OAASw/G,EAC5Bt6K,KAAK47K,gBAAkB38I,EAAK21I,gBAAkB,KAC9C50K,KAAK67K,sBAA4CzzK,IAAzB62B,EAAK68I,gBAAgC78I,EAAK68I,gBAAkB,GACpF97K,KAAK+7K,uBAAyB98I,EAAK+8I,wBAAyB,EAC5Dh8K,KAAK4vC,iBAAmB3Q,EAAK4Q,gBAGD,kBAAjB5Q,EAAKgnC,UAAuBjmE,KAAKimE,QAAUhnC,EAAKgnC,SAE3DjmE,KAAKinD,SAAWhoB,EAAKgoB,UAAY,aAEjCjnD,KAAKi8K,YAAch9I,EAAKg9I,aAAe,EAEvCj8K,KAAKk8K,kBAAqC,IAAjBj9I,EAAKk9I,SAAsC,IAAjBl9I,EAAKk9I,QACpD,GACEl9I,EAAKk9I,SAAW,GACtBn8K,KAAKo8K,uBAAyB,KAC9Bp8K,KAAKq8K,uBAAyB,EAC9Br8K,KAAKs8K,mBAAqB,KAE1Bt8K,KAAK0zK,OAAQ,EACb1zK,KAAKmjC,WAAY,EACjBnjC,KAAK2pI,OAAS1qG,EAAK0qG,SAAU,EAC7B3pI,KAAK+0B,MAAO,EAEZ/0B,KAAKglK,SAAW,KAChBhlK,KAAK86D,MAAQ,KACb96D,KAAKu8K,UAAYt9I,EAAKs9I,UACtBv8K,KAAKu1C,MAAQ,GACbv1C,KAAKqmE,OAAS,GAEdrmE,KAAKw8K,eAAgB,EACrBx8K,KAAKy8K,YAAc,GACnBz8K,KAAK08K,UAAY,GAEjB18K,KAAKq5K,MAAQ,GAEbr5K,KAAKskH,OAAS,GACdtkH,KAAK28K,OAAS,GACd38K,KAAK48K,aAAe,EAGpB58K,KAAKm6D,SAAW,EAChBn6D,KAAK2iC,SAAW,EAChB3iC,KAAKszK,eAAiB1zI,IACtB5/B,KAAKuzK,aAAe3zI,IAGpB5/B,KAAK68K,SAAW,GAChB78K,KAAK88K,YAAc,GAInB98K,KAAK+8K,cAAgB99I,EAAK+9I,aAER,OAAd5+C,GAAoBp+H,KAAK80K,aAAa12C,GAE1Cp+H,KAAKshC,OAAO,eAGV27I,oBACF,OAAIj9K,KAAK+0B,KAAa,EACK,IAAvB/0B,KAAK8iC,cAA4BzS,EAAAA,GAC5BrwB,KAAKsB,OAAStB,KAAK4iC,YAAc5iC,KAAK8iC,cAAiB,IAG9DF,iBACF,IAAK5iC,KAAK8oC,SAAU,OAAO,EAC3B,IAAIlG,EAAa,EACjB,IAAK,IAAIh5B,EAAQ,EAAGwB,EAAMpL,KAAKqmE,OAAO/kE,OAAQsI,EAAQwB,IAAOxB,EAC3D,GAAI5J,KAAK8oC,SAAS1pC,IAAIwK,GACpBg5B,GAAeh5B,IAAUwB,EAAM,EAAKpL,KAAK2+H,gBAAkB3+H,KAAKomE,gBAC3D,CACL,MAAMvlC,EAAQ7gC,KAAKqmE,OAAOz8D,GAC1Bg5B,GAAe/B,EAAMv/B,OAASu/B,EAAMg+H,QAGxC,OAAOj8H,EAeLE,oBAAmB,OAAO9iC,KAAKszK,iBAE/BzwI,kBAAiB,OAAO7iC,KAAKuzK,eAE7BY,eAAc,OAAOn0K,KAAKsB,OAAStB,KAAK4iC,WAAa5iC,KAAKsB,OAAS,EAEnE8yK,YAAW,OAAOp0K,KAAK2iC,UAAY3iC,KAAKm6D,UAAYn6D,KAAKsB,QAEzD47K,eAAc,OAAOl9K,KAAKq5K,MAAM/3K,OAEhC67K,yBACF,GAAsB,oBAAX9sK,OAAwB,MAAM,IAAIpR,MAAM,yBACnD,OAAKe,KAAKo9K,YACHlpI,IAAI0hE,gBACT,IAAIp/D,KAAK,CAACx2C,KAAKo9K,aAAc,CAAEp1K,KAAM,8BAFT,KAM5Bq1K,iBACF,OAAOr9K,KAAKskH,OAAOhjH,QAAUtB,KAAK48K,aAAe58K,KAAKs9K,WAGpDA,gBACF,IAAIC,EAAW,EACf,IAAK,MAAMjvK,KAAMtO,KAAK28K,OAChB38K,KAAK28K,OAAOruK,GAAImkC,YAAW8qI,GAAY,GAE7C,OAAOA,EAGTzI,aAAc12C,GACZ,GAAIp+H,KAAKmjC,UAAW,OAEpB,IAAI87F,EACJ,IAAMA,EAAgBd,EAAaC,GAAa,MAAOr0H,IACnDk1H,GAEFj/H,KAAK4mC,SAAWq4F,EAAcr4F,SAC9B5mC,KAAKqhC,SAAW49F,EAAcr4F,SAAS36B,SAAS,OAAOqjB,UAAU,EAAG,GACpEyf,GAAe,KACT/uC,KAAKmjC,WACTnjC,KAAKw9K,iBAAiBv+C,OAKxBd,EAAaY,OAAOX,GAAW,CAACr0H,EAAKk1H,KACnC,IAAIj/H,KAAKmjC,UACT,OAAIp5B,EAAY/J,KAAKykH,SAAS16G,QAC9B/J,KAAKw9K,iBAAiBv+C,MAK5Bu+C,iBAAkBv+C,GAChB,IAAIj/H,KAAKmjC,UAAT,CAIA,GAFAnjC,KAAKy9K,sBAAsBx+C,IAEtBj/H,KAAK4mC,SACR,OAAO5mC,KAAKykH,SAAS,IAAIxlH,MAAM,yCAGjCe,KAAKs8K,mBAAqBr3I,aAAY,KACpCjlC,KAAK09K,aA3Lc,KA6LjB19K,KAAKs8K,mBAAmBj3I,OAAOrlC,KAAKs8K,mBAAmBj3I,QAK3DrlC,KAAKylC,KAAK,YAAazlC,KAAK4mC,UACxB5mC,KAAKmjC,YAETnjC,KAAKylC,KAAK,WAAYzlC,KAAK4mC,UACvB5mC,KAAKmjC,YAELnjC,KAAK2xC,OAAOwgI,UACdnyK,KAAKqzK,eAELrzK,KAAK2xC,OAAOnN,KAAK,aAAa,KAC5BxkC,KAAKqzK,qBAKXoK,sBAAuBx+C,GACrBj/H,KAAKqhC,SAAW49F,EAAcr4F,SAAS36B,SAAS,OAAOqjB,UAAU,EAAG,QAExC,IAAjBtvB,KAAKimE,UAEdg5D,EAAch5D,QAAUjmE,KAAKimE,SAG3BjmE,KAAKqvC,WAEP4vF,EAAc5vF,SAAW4vF,EAAc5vF,SAAS9rC,OAAOvD,KAAKqvC,WAG1DrvC,KAAK2xC,OAAOV,SAAW,EAAAjvB,EAAO2jD,sBAAwBs5D,EAAch5D,UAEtEg5D,EAAc5vF,SAAW4vF,EAAc5vF,SAAS9rC,OAAO,EAAAye,EAAO2jD,sBAG5D3lE,KAAK4lE,UAEPq5D,EAAcr5D,QAAUq5D,EAAcr5D,QAAQriE,OAAOvD,KAAK4lE,UAI5Dq5D,EAAc5vF,SAAW3tC,MAAMmM,KAAK,IAAImsB,IAAIilG,EAAc5vF,WAC1D4vF,EAAcr5D,QAAUlkE,MAAMmM,KAAK,IAAImsB,IAAIilG,EAAcr5D,UAEzDpgE,OAAO+iB,OAAOvoB,KAAMi/H,GAEpBj/H,KAAK29K,UAAYx/C,EAAakB,YAAYJ,GAC1Cj/H,KAAKo9K,YAAcj/C,EAAamB,cAAcL,GAGhDo0C,eACMrzK,KAAKmjC,YAELnjC,KAAKssC,KAGPtsC,KAAK49K,YAAY59K,OAEbA,KAAK0zG,IAAI1zG,KAAK69K,yBAClB79K,KAAK89K,oBAITA,kBACE,GAAI99K,KAAK+9K,WAAa/9K,KAAKmjC,UAAW,OAEtC,IAAI66I,EAAch+K,KAAK2xC,OAAOV,QAC1B+sI,IACFA,EAAcx4K,OAAO+iB,OAAO,GAAIvoB,KAAK2xC,OAAOV,QAAS,CACnDpB,gBAAiB,KACf,GAAI7vC,KAAKmjC,UAAW,OAEpB,MAAMlE,EAAO,CACX0D,SAAU3iC,KAAK2iC,SACfC,WAAY5iC,KAAK4iC,WACjB5xB,KAAMF,KAAKC,IAAI/Q,KAAKsB,OAAStB,KAAK4iC,WAAY,IAShD,OAPI5iC,KAAK2xC,OAAOV,QAAQpB,iBACtBrqC,OAAO+iB,OAAO0W,EAAMj/B,KAAK2xC,OAAOV,QAAQpB,mBAEtC7vC,KAAK4vC,kBAEPpqC,OAAO+iB,OAAO0W,EAAMj/B,KAAK4vC,oBAEpB3Q,MAMTj/B,KAAKi0G,eACPj0G,KAAKi0G,cAAcjxG,SAAQmwC,GAAQnzC,KAAKi+K,QAAQ9qI,KAIlDnzC,KAAK+9K,UAAY,IAAI1D,EAAU,CAC7BzzI,SAAU5mC,KAAK4mC,SACfyI,SAAUrvC,KAAKqvC,SACf9N,OAAQvhC,KAAK2xC,OAAOpQ,OACpByG,KAAMhoC,KAAKimE,SAAWjmE,KAAK2xC,OAAO3J,IAClCiJ,QAAS+sI,EACT70I,KAAMnpC,KAAK2xC,OAAOygI,YAClBniI,UAAWmrI,EACX5c,IAAKx+J,KAAK2xC,OAAO6sH,MAGnBx+J,KAAK+9K,UAAUr5I,GAAG,SAAU36B,IAC1B/J,KAAKykH,SAAS16G,MAGhB/J,KAAK+9K,UAAUr5I,GAAG,QAAQ,CAACyO,EAAMpjB,KAC/B/vB,KAAKshC,OAAO,4BAA6B6R,EAAMpjB,GAE3B,iBAATojB,GAAqBnzC,KAAK+0B,MACrC/0B,KAAKi+K,QAAQ9qI,MAGfnzC,KAAK+9K,UAAUr5I,GAAG,mBAAmB,KACnC1kC,KAAKylC,KAAK,mBACY,IAAlBzlC,KAAKk9K,UAAgBl9K,KAAKylC,KAAK,UAAW,cAGhDzlC,KAAK+9K,UAAUr5I,GAAG,eAAe,KAC/B1kC,KAAKylC,KAAK,eACY,IAAlBzlC,KAAKk9K,UAAgBl9K,KAAKylC,KAAK,UAAW,UAGhDzlC,KAAK+9K,UAAUr5I,GAAG,WAAY36B,IAC5B/J,KAAKylC,KAAK,UAAW17B,MAIzB8zK,yBAEE,MAAMlrK,EAAO3S,KAIPuxC,GAFO7vC,MAAMC,QAAQ3B,KAAK0zG,IAAM1zG,KAAK0zG,GAAK,CAAC1zG,KAAK0zG,KAEnC9xG,KAAI4yC,GAAOzL,KAK9B,SAA6ByL,EAAKzL,GAChC,GAA+B,IAA3ByL,EAAIpnB,QAAQ,YAAgD,IAA5BonB,EAAIpnB,QAAQ,YAE9C,OADAza,EAAK8yB,KAAK,UAAW,IAAIxmC,MAAM,+BAA+Bu1C,MACvDzL,EAAG,MAGZ,MAAM9J,EAAO,CACXuV,IAAAA,EACA1vC,OAAQ,MACRq8G,QAAS,CACP,aAAci6D,IAGlB,IAAI5sI,EACJ,IACEA,EAAMpvC,EAAImE,OAAO07B,GAQnB,SAAqBl1B,EAAKvH,EAAKqjE,GAC7B,GAAIlzD,EAAKwwB,UAAW,OAAO4F,EAAG,MAC9B,GAAIp2B,EAAKqyJ,SAAU,OAAOj8H,EAAG,MAE7B,GAAIh/B,EAEF,OADA4I,EAAK8yB,KAAK,UAAW,IAAIxmC,MAAM,6BAA6Bu1C,MACrDzL,EAAG,MAEZ,GAAuB,MAAnBvmC,EAAImiJ,WAEN,OADAhyI,EAAK8yB,KAAK,UAAW,IAAIxmC,MAAM,uBAAuBuD,EAAImiJ,6BAA6BnwG,MAChFzL,EAAG,MAGZ,IAAIk2F,EACJ,IACEA,EAAgBd,EAAat4D,GAC7B,MAAO97D,IAET,OAAKk1H,EAKDA,EAAcr4F,WAAaj0B,EAAKi0B,UAClCj0B,EAAK8yB,KAAK,UAAW,IAAIxmC,MAAM,4DAA4Du1C,MACpFzL,EAAG,QAGZp2B,EAAKirK,YAAY3+C,QACjBl2F,EAAG,QAVDp2B,EAAK8yB,KAAK,UAAW,IAAIxmC,MAAM,2CAA2Cu1C,MACnEzL,EAAG,UA3BZ,MAAOh/B,GAEP,OADA4I,EAAK8yB,KAAK,UAAW,IAAIxmC,MAAM,kCAAkCu1C,MAC1DzL,EAAG,MAGZp2B,EAAKmqK,YAAY/3K,KAAKypC,GAzBtB0vI,CAAmB1pI,EAAKzL,MAE1B8F,EAAS0C,GA8DXqsI,YAAa5Y,GACX,GAAIhlK,KAAKglK,UAAYhlK,KAAKmjC,UAAW,OAQrC,IAAI87F,EACJ,GARAj/H,KAAKshC,OAAO,gBAEZthC,KAAK88K,YAAY95K,SAAQwrC,IACvBA,EAAI2pD,WAENn4F,KAAK88K,YAAc,GAGf9X,GAAYA,EAASp+H,SAEvBq4F,EAAgB+lC,OAEhB,IACE/lC,EAAgBd,EAAa6mC,GAC7B,MAAOj7J,GACP,OAAO/J,KAAKykH,SAAS16G,GAIzB/J,KAAKy9K,sBAAsBx+C,GAC3Bj/H,KAAKglK,SAAWhlK,KAAKo9K,YAGjBp9K,KAAK2xC,OAAO6hI,gBACdxzK,KAAK4lE,QAAQ5iE,SAAQwxC,IACnBx0C,KAAKm+K,WAAW3pI,MAIpBx0C,KAAKo+K,WAAa,IAAIvD,EAAU76K,MAEhCA,KAAKu1C,MAAQv1C,KAAKu1C,MAAM3zC,KAAIijE,GAAQ,IAAI+1G,EAAK56K,KAAM6kE,KAEnD,IAAIw5G,EAAWr+K,KAAK47K,gBAiEpB,GAhEKyC,IACHA,EAAW,IAAIr+K,KAAK27K,OAAO37K,KAAKomE,YAAa,IACxCpmE,KAAKu8K,UACR12G,QAAS7lE,KACT+G,KAAM/G,KAAK+G,KACXwuC,MAAOv1C,KAAKu1C,MACZj0C,OAAQtB,KAAKsB,OACbxB,KAAME,KAAKF,KAAO,MAAQE,KAAK4mC,SAAShkC,MAAM,EAAG,GACjD84K,OAAQ17K,KAAK07K,UAKb17K,KAAK67K,iBAAmB,KAAOwC,aAAoB7D,KACrD6D,EAAW,IAAIjE,EAAgBiE,EAAU,CACvCttK,IAAK/Q,KAAK67K,oBAId77K,KAAK86D,MAAQ,IAAIy/G,EACf8D,GAIEr+K,KAAKs+K,GACPt+K,KAAKu1C,MAAMvyC,SAAQ,CAAC+1C,EAAG1tC,KACjBrL,KAAKs+K,GAAG/1I,SAASl9B,GACnBrL,KAAKu1C,MAAMlqC,GAAGwqK,SAEd71K,KAAKu1C,MAAMlqC,GAAG4qK,cAKS,IAAvBj2K,KAAKqmE,OAAO/kE,QACdtB,KAAK61K,OAAO,EAAG71K,KAAKqmE,OAAO/kE,OAAS,GAAG,GAI3CtB,KAAKu+K,QAAUv+K,KAAKqmE,OAEpBrmE,KAAKqmE,OAASrmE,KAAKqmE,OAAOzkE,KAAI,CAAC8hD,EAAMr4C,KACnC,MAAM+6D,EAAe/6D,IAAMrL,KAAKqmE,OAAO/kE,OAAS,EAC5CtB,KAAK2+H,gBACL3+H,KAAKomE,YACT,OAAO,IAAIw4F,EAAMx4F,MAGnBpmE,KAAKi/J,cAAgBj/J,KAAKqmE,OAAOzkE,KAAI,IAAM,KAE3C5B,KAAK8oC,SAAW,IAAI9J,EAASh/B,KAAKqmE,OAAO/kE,QAEzCtB,KAAKq5K,MAAMr2K,SAAQ8vG,IAGbA,EAAK0yD,aAAa1yD,EAAK0yD,YAAYD,YAAYvlK,KAAKglK,UAExDhlK,KAAKw+K,oBAAoB1rE,MAI3B9yG,KAAKylC,KAAK,aAGNzlC,KAAKmjC,UAET,GAAInjC,KAAKy0K,WAEPz0K,KAAKy+K,mBACLz+K,KAAK0+K,eACA,CACL,MAAMC,EAAoB50K,IACxB,GAAIA,EAAK,OAAO/J,KAAKykH,SAAS16G,GAC9B/J,KAAKshC,OAAO,kBACZthC,KAAK0+K,YAGP1+K,KAAKshC,OAAO,mCACRthC,KAAK+8K,eAAiB/8K,KAAK27K,SAAWrB,EAExCt6K,KAAK4+K,iBAAgB,CAAC70K,EAAKizK,KACzB,GAAIjzK,EAAK,OAAO/J,KAAKykH,SAAS16G,GAEZ/J,KAAKu1C,MAAM3zC,KAAI,CAAC6c,EAAG7U,IAAUozK,EAAapzK,KAAW5J,KAAK+8K,cAAcnzK,KAAQ8sG,OAAMx6F,GAAKA,KAG3Glc,KAAKy+K,mBACLz+K,KAAK0+K,YAEL1+K,KAAK6+K,cAAcF,MAIvB3+K,KAAK6+K,cAAcF,IAUzBC,gBAAiB71I,GACf,MAAMp1B,EAAM,GACZ8mK,EAAcz6K,KAAKu1C,MAAM3zC,KAAI,CAACijE,EAAMj7D,IAAUm/B,IAC5C,MAAMgrI,EAAW/zK,KAAK07K,OAAS30K,EAAKlE,KAAK7C,KAAKF,KAAO,MAAQE,KAAK4mC,SAAShkC,MAAM,EAAG,IAAMmE,EAAKlE,KAAK7C,KAAK+G,KAAM89D,EAAK99D,MACpHk3H,EAAGsuB,KAAKwnB,GAAU,CAAChqK,EAAKwiJ,KACtB,GAAIxiJ,GAAoB,WAAbA,EAAI4oB,KAAmB,OAAOoW,EAAGh/B,GAC5C4J,EAAI/J,GAAS2iJ,GAAQA,EAAKhyC,MAAM9iF,UAChCsR,EAAG,YAEHmyI,GAAwBnxK,IAC1B/J,KAAKshC,OAAO,8BACZyH,EAAGh/B,EAAK4J,MAIZkrK,cAAe91I,GACb0xI,EAAcz6K,KAAKqmE,OAAOzkE,KAAI,CAACi/B,EAAOj3B,IAAUm/B,IAC9C,GAAI/oC,KAAKmjC,UAAW,OAAO4F,EAAG,IAAI9pC,MAAM,yBAExC,MAAM+2K,EAAU,GAEZpsK,IAAU5J,KAAKqmE,OAAO/kE,OAAS,IACjC00K,EAAQ10K,OAAStB,KAAK2+H,iBAExB3+H,KAAK86D,MAAM17D,IAAIwK,EAAOosK,GAAS,CAACjsK,EAAKiB,IAC/BhL,KAAKmjC,UAAkB4F,EAAG,IAAI9pC,MAAM,yBAEpC8K,EAAYglC,GAAe,IAAMhG,EAAG,aACxCpJ,EAAK30B,GAAK04C,IACR,GAAI1jD,KAAKmjC,UAAW,OAAO4F,EAAG,IAAI9pC,MAAM,yBAEpCykD,IAAS1jD,KAAKu+K,QAAQ30K,IACxB5J,KAAKshC,OAAO,oBAAqB13B,GACjC5J,KAAK8+K,cAAcl1K,IAEnB5J,KAAKshC,OAAO,mBAAoB13B,GAElCm/B,EAAG,cAGLmyI,EAAwBnyI,GAG9Bg2I,YAAah2I,GACX,GAAI/oC,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,wBAC/B8pC,IAAIA,EAAKhD,GAEd/lC,KAAK6+K,eAAe90K,IAClB,GAAIA,EAEF,OADA/J,KAAKykH,SAAS16G,GACPg/B,EAAGh/B,GAGZ/J,KAAKomK,aACLr9H,EAAG,SAIP01I,mBACE,IAAK,IAAI70K,EAAQ,EAAGA,EAAQ5J,KAAKqmE,OAAO/kE,OAAQsI,IAC9C5J,KAAK8+K,cAAcl1K,GAIvBk1K,cAAel1K,GACb5J,KAAKqmE,OAAOz8D,GAAS,KACrB5J,KAAKi/J,cAAcr1J,GAAS,KAC5B5J,KAAK8oC,SAAS5pC,IAAI0K,GAAO,GAG3Bo1K,gBACE,IAAK,IAAIp1K,EAAQ,EAAGA,EAAQ5J,KAAKqmE,OAAO/kE,OAAQsI,IAC9C,IAAK5J,KAAK8oC,SAAS1pC,IAAIwK,GAAQ,OAAO,EAExC,OAAO,EAGTq1K,eACE,OAAQj/K,KAAKk/K,eAAe,GAG9BA,eAAgBC,GACd,IAAIztJ,EAAQ,EACZ,IAAK,IAAI9nB,EAAQ,EAAGA,EAAQ5J,KAAKqmE,OAAO/kE,OAAQsI,IAC9C,GAAI5J,KAAK8oC,SAAS1pC,IAAIwK,KACpB8nB,GAAS,EACLA,EAAQytJ,GAAW,OAAO,EAGlC,OAAO,EAMTT,WACM1+K,KAAKmjC,YACTnjC,KAAKshC,OAAO,YAGZthC,KAAK89K,kBAEL99K,KAAK0zK,OAAQ,EACb1zK,KAAKylC,KAAK,SAGVzlC,KAAKomK,aAGLpmK,KAAKo/K,qBAGP55I,QAASvG,EAAM8J,GACb,GAAoB,mBAAT9J,EAAqB,OAAOj/B,KAAKwlC,QAAQ,KAAMvG,GAE1Dj/B,KAAKykH,SAAS,KAAMxlF,EAAM8J,GAG5B07E,SAAU16G,EAAKk1B,EAAM8J,GACnB,GAAoB,mBAAT9J,EAAqB,OAAOj/B,KAAKykH,SAAS16G,EAAK,KAAMk1B,GAChE,GAAIj/B,KAAKmjC,UAAW,OACpBnjC,KAAKmjC,WAAY,EACjBnjC,KAAKshC,OAAO,WAEZthC,KAAK2xC,OAAOojI,QAAQ/0K,MAEpBglC,cAAchlC,KAAKs8K,oBAEnBt8K,KAAK88K,YAAY95K,SAAQwrC,IACvBA,EAAI2pD,WAGFn4F,KAAKo+K,YACPp+K,KAAKo+K,WAAW54I,UAGlB,IAAK,MAAMl3B,KAAMtO,KAAK28K,OACpB38K,KAAKs5K,WAAWhrK,GAGlBtO,KAAKu1C,MAAMvyC,SAAQ6hE,IACbA,aAAgB+1G,GAAM/1G,EAAK4/C,cAGjC,MAAMlzE,EAAQvxC,KAAK68K,SAASj7K,KAAIy9K,GAAUt2I,IACxCs2I,EAAO75I,QAAQuD,MASjB,GANI/oC,KAAK+9K,WACPxsI,EAAMxsC,MAAKgkC,IACT/oC,KAAK+9K,UAAUv4I,QAAQuD,MAIvB/oC,KAAK86D,MAAO,CACd,IAAIwkH,EAAet/K,KAAK+7K,uBACpB98I,QAA8B72B,IAAtB62B,EAAKqgJ,eACfA,EAAergJ,EAAKqgJ,cAEtB/tI,EAAMxsC,MAAKgkC,IACLu2I,EACFt/K,KAAK86D,MAAMt1B,QAAQuD,GAEnB/oC,KAAK86D,MAAMlT,MAAM7e,MAKvB8F,EAAS0C,EAAOxI,GAEZh/B,IAQkC,IAAhC/J,KAAK+6F,cAAc,SACrB/6F,KAAK2xC,OAAOlM,KAAK,QAAS17B,GAE1B/J,KAAKylC,KAAK,QAAS17B,IAIvB/J,KAAKylC,KAAK,SAEVzlC,KAAK2xC,OAAS,KACd3xC,KAAKu1C,MAAQ,GACbv1C,KAAK+9K,UAAY,KACjB/9K,KAAK86D,MAAQ,KACb96D,KAAKo+K,WAAa,KAClBp+K,KAAK28K,OAAS,KACd38K,KAAK68K,SAAW,KAChB78K,KAAK88K,YAAc,KAGrBmB,QAAS9qI,GACP,GAAInzC,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,wBACpC,IAAKe,KAAK4mC,SAAU,MAAM,IAAI3nC,MAAM,4DAEpC,IAAI2lJ,EAEJ,GAAI5kJ,KAAK2xC,OAAO07D,QAAS,CACvB,GAAoB,iBAATl6D,EAAmB,CAC5B,IAAI1X,EACJ,IACEA,EAAQ0+I,EAAahnI,GACrB,MAAOzsC,GAGP,OAFA1G,KAAKshC,OAAO,4BAA6B6R,GACzCnzC,KAAKylC,KAAK,cAAe0N,IAClB,EAETyxG,EAAOnpH,EAAM,OAC0B,iBAAvB0X,EAAK+yG,gBACrBtB,EAAOzxG,EAAK+yG,eAGd,GAAItB,GAAQ5kJ,KAAK2xC,OAAO07D,QAAQ7oG,SAASogJ,GAIvC,OAHA5kJ,KAAKshC,OAAO,4BAA6B6R,GACrB,iBAATA,GAAmBA,EAAK3N,UACnCxlC,KAAKylC,KAAK,cAAe0N,IAClB,EAMX,MAAMnrC,EAAQhI,KAAK2xC,OAAO4gI,KAAOvyK,KAAKu/K,QAAQ36B,GAAS,MAAQ,MACzD46B,IAAax/K,KAAKy/K,SAAStsI,EAAMnrC,GAOvC,OALIw3K,EACFx/K,KAAKylC,KAAK,OAAQ0N,GAElBnzC,KAAKylC,KAAK,cAAe0N,GAEpBqsI,EAGTC,SAAUtsI,EAAMnrC,GACd,GAAIhI,KAAKmjC,UAEP,MADoB,iBAATgQ,GAAmBA,EAAK3N,UAC5B,KAET,GAAoB,iBAAT2N,IAAsBnzC,KAAK0/K,WAAWvsI,GAE/C,OADAnzC,KAAKshC,OAAO,4BAA6B6R,GAClC,KAGT,MAAM7kC,EAAM6kC,GAAQA,EAAK7kC,IAAO6kC,EAChC,GAAInzC,KAAK28K,OAAOruK,GAGd,OAFAtO,KAAKshC,OAAO,gCAAiChzB,GACzB,iBAAT6kC,GAAmBA,EAAK3N,UAC5B,KAGT,GAAIxlC,KAAK2pI,OAGP,OAFA3pI,KAAKshC,OAAO,oCACQ,iBAAT6R,GAAmBA,EAAK3N,UAC5B,KAKT,IAAIm6I,EAmBJ,OArBA3/K,KAAKshC,OAAO,cAAehzB,GAKzBqxK,EAFkB,iBAATxsI,EAEU,QAATnrC,EACN8mC,EAAKmpI,sBAAsB9kI,EAAMnzC,KAAMA,KAAK2xC,OAAOshI,gBACnDnkI,EAAKipI,sBAAsB5kI,EAAMnzC,KAAMA,KAAK2xC,OAAOshI,gBAG7CnkI,EAAK0oI,iBAAiBrkI,EAAMnzC,KAAMA,KAAK2xC,OAAOshI,gBAG1DjzK,KAAK4/K,cAAcD,GAEC,iBAATxsI,IAETnzC,KAAKskH,OAAOv/G,KAAK46K,GACjB3/K,KAAK8iH,UAGA68D,EAGTxB,WAAY0B,GACV,GAAI7/K,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,wBAEpC,IAAIqP,EACAmpK,EACJ,GAAyB,iBAAdoI,EAAwB,CAGjC,GAFAvxK,EAAKuxK,GAEA,iBAAiBx4K,KAAKiH,GAGzB,OAFAtO,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,8BAA8BqP,WAC7DtO,KAAKylC,KAAK,cAAen3B,GAI3B,GAAItO,KAAK28K,OAAOruK,GAGd,OAFAtO,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,gCAAgCqP,WAC/DtO,KAAKylC,KAAK,cAAen3B,GAI3BmpK,EAAO,IAAIsD,EAAQzsK,EAAItO,UAClB,KAAI6/K,GAAyC,iBAArBA,EAAUC,OAWvC,YADA9/K,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,6EAN/B,GAHAw4K,EAAOoI,EACPvxK,EAAKmpK,EAAKqI,OAEN9/K,KAAK28K,OAAOruK,GAGd,OAFAtO,KAAKylC,KAAK,UAAW,IAAIxmC,MAAM,gCAAgCqP,WAC/DtO,KAAKylC,KAAK,cAAen3B,GAQ7BtO,KAAKshC,OAAO,kBAAmBhzB,GAE/B,MAAMqxK,EAAU7wI,EAAKopI,kBAAkBT,EAAMnpK,EAAItO,KAAMA,KAAK2xC,OAAOshI,gBAEnEjzK,KAAK4/K,cAAcD,GAEnB3/K,KAAKylC,KAAK,OAAQn3B,GAOpByxK,iBAAkB5sI,GAChB,OAAInzC,KAAKmjC,UAAkBgQ,EAAK3N,QAAQ,IAAIvmC,MAAM,yBAC9Ce,KAAK2pI,OAAex2F,EAAK3N,QAAQ,IAAIvmC,MAAM,uBAE/Ce,KAAKshC,OAAO,uBAAwB6R,EAAK7kC,SAEzCtO,KAAK4/K,cAAczsI,IAGrBysI,cAAeD,GACbA,EAAQj7I,GAAG,YAAY9B,IACjB5iC,KAAKmjC,YACTnjC,KAAKm6D,UAAYv3B,EACjB5iC,KAAKszK,eAAe1wI,GACpB5iC,KAAK2xC,OAAO2hI,eAAe1wI,GAC3B5iC,KAAKylC,KAAK,WAAY7C,GAClB5iC,KAAKmjC,WACTnjC,KAAK2xC,OAAOlM,KAAK,WAAY7C,OAG/B+8I,EAAQj7I,GAAG,UAAU/B,IACf3iC,KAAKmjC,YACTnjC,KAAK2iC,UAAYA,EACjB3iC,KAAKuzK,aAAa5wI,GAClB3iC,KAAK2xC,OAAO4hI,aAAa5wI,GACzB3iC,KAAKylC,KAAK,SAAU9C,GAChB3iC,KAAKmjC,WACTnjC,KAAK2xC,OAAOlM,KAAK,SAAU9C,OAG7B3iC,KAAK28K,OAAOgD,EAAQrxK,IAAMqxK,EAC1B3/K,KAAK48K,cAAgB,EAGvBtD,WAAYnmI,GACV,MAAM7kC,EAAM6kC,GAAQA,EAAK7kC,IAAO6kC,GAChCA,EAAOnzC,KAAK28K,OAAOruK,MAInBtO,KAAKshC,OAAO,gBAAiBhzB,UAEtBtO,KAAK28K,OAAOruK,GACnBtO,KAAK48K,cAAgB,EAErBzpI,EAAK3N,UAGLxlC,KAAK8iH,UAGP+yD,OAAQhvK,EAAO6G,EAAKkpK,EAAUoJ,GAC5B,GAAIhgL,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,wBAEpC,GAAI4H,EAAQ,GAAK6G,EAAM7G,GAAS7G,KAAKqmE,OAAO/kE,QAAUoM,EACpD,MAAM,IAAIzO,MAAM,qBAAqB4H,OAAW6G,KAElDkpK,EAAWz3K,OAAOy3K,IAAa,EAE/B52K,KAAKshC,OAAO,6BAA8Bz6B,EAAO6G,EAAKkpK,GAEtD52K,KAAKy8K,YAAY13K,KAAK,CACpB8I,KAAMhH,EACN4xF,GAAI/qF,EACJrM,OAAQ,EACRu1K,SAAAA,EACAoJ,OAAQA,GAAUj6I,IAGpB/lC,KAAKy8K,YAAYr/I,MAAK,CAACxqB,EAAGC,IAAMA,EAAE+jK,SAAWhkK,EAAEgkK,WAE/C52K,KAAKo/K,oBAGPnJ,SAAUpvK,EAAO6G,EAAKkpK,GACpB,GAAI52K,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,wBAEpC23K,EAAWz3K,OAAOy3K,IAAa,EAC/B52K,KAAKshC,OAAO,+BAAgCz6B,EAAO6G,EAAKkpK,GAExD,IAAK,IAAIvrK,EAAI,EAAGA,EAAIrL,KAAKy8K,YAAYn7K,SAAU+J,EAAG,CAChD,MAAM8R,EAAInd,KAAKy8K,YAAYpxK,GAC3B,GAAI8R,EAAEtP,OAAShH,GAASsW,EAAEs7E,KAAO/qF,GAAOyP,EAAEy5J,WAAaA,EAAU,CAC/D52K,KAAKy8K,YAAYluK,OAAOlD,EAAG,GAC3B,OAIJrL,KAAKo/K,oBAGPrJ,SAAUlvK,EAAO6G,GACf,GAAI1N,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,wBAEpCe,KAAKshC,OAAO,iBAAkBz6B,EAAO6G,GAErC,IAAK,IAAIrC,EAAIxE,EAAOwE,GAAKqC,IAAOrC,EAC9BrL,KAAK08K,UAAUrxK,IAAK,EAGtBrL,KAAKo/K,oBAGPnG,QAASnmE,EAAMn0G,GAKb,GAJAqB,KAAKshC,OAAO,mBAAoBwxE,EAAKzxE,SAAU1iC,GAAQ,WAEvDqB,KAAKq5K,MAAMt0K,KAAK+tG,GAEZn0G,EAAM,CAER,MAAM88B,EAAQ0+I,EAAax7K,GAC3Bm0G,EAAKozC,cAAgBzqH,EAAM,GAC3Bq3E,EAAKszC,WAAa3qH,EAAM,GAItBz7B,KAAK2xC,OAAO3J,KAAOhoC,KAAK2xC,OAAO3J,IAAImqI,WACrCr/D,EAAKpuE,GAAG,QAAQyE,IACd,IAAInpC,KAAKmjC,YAAanjC,KAAK2xC,OAAO3J,IAAI7E,UAAtC,CAGA,IAAK2vE,EAAKozC,cACR,OAAOlmJ,KAAKshC,OAAO,2CAErB,GAAa,IAAT6H,GAAcA,EAAO,MACvB,OAAOnpC,KAAKshC,OAAO,mCAGrBthC,KAAKshC,OAAO,qBAAsB6H,EAAMxqC,GACxCqB,KAAK2xC,OAAO3J,IAAIq2H,QAAQ,CAAEzZ,KAAM9xC,EAAKozC,cAAe/8G,KAAAA,QAIxD2pE,EAAKpuE,GAAG,WAAW,KACjB1kC,KAAKshC,OAAO,oBAAqB3iC,GAEjCm0G,EAAKttE,aAIW,YAAdstE,EAAK9qG,MACP8qG,EAAK3tE,WAx/BW,KAw/Be,GAIjC2tE,EAAKhuE,cAAa,GAGlBguE,EAAK3uG,IAAI8gK,EAAWjlK,KAAKglK,WAEzBlyD,EAAK0yD,YAAY9gI,GAAG,WAAW36B,IAC7B/J,KAAKshC,OAAO,0BAA2Bv3B,EAAIG,YAGxClK,KAAKglK,WACRlyD,EAAK0yD,YAAY9gI,GAAG,YAAYsgI,IAC9BhlK,KAAKshC,OAAO,gCACZthC,KAAK49K,YAAY5Y,MAEnBlyD,EAAK0yD,YAAY7S,SAIE,mBAAVgoB,GAAyB36K,KAAKimE,UACvC6sC,EAAK3uG,IAAIw2K,KAET7nE,EAAKmtE,OAAOv7I,GAAG,QAAQyO,IAEjBnzC,KAAK+0B,OACT/0B,KAAKshC,OAAO,iCAAkC6R,EAAMx0C,GACpDqB,KAAKi+K,QAAQ9qI,OAGf2/D,EAAKmtE,OAAOv7I,GAAG,WAAWyO,IAGxB,MAAM+sI,EAAUlgL,KAAK28K,OAAOxpI,GACxB+sI,IAAYA,EAAQztI,YACtBzyC,KAAKshC,OAAO,qCAAsC6R,EAAMx0C,GACxDqB,KAAKs5K,WAAWnmI,OAIpB2/D,EAAKtuE,KAAK,SAAS,KAEjBsuE,EAAKmtE,OAAOp2H,YAIhBipD,EAAK3uG,IAAI0uG,KAIT7yG,KAAKylC,KAAK,OAAQqtE,EAAMn0G,GAEpBqB,KAAKglK,UACPj2H,GAAe,KAGb/uC,KAAKw+K,oBAAoB1rE,MAK/B0rE,oBAAqB1rE,GACnB,IAAIqtE,EAAY,KAEhB,MAAMC,EAAiB,KACjBpgL,KAAKmjC,WAAa2vE,EAAK3vE,YAEvBnjC,KAAKq9K,WAAa,GAAKr9K,KAAKs9K,UAAYt9K,KAAKk9K,WAC/CpqE,EAAKpxE,aACLoxE,EAAKttE,WAEL26I,EAAYh7I,WAAWi7I,EAAgBpF,GACnCmF,EAAU96I,OAAO86I,EAAU96I,WAInC,IAAIh6B,EACJ,MAAMg1K,EAAmB,KACvB,GAAIvtE,EAAKjxE,WAAWt2B,OAAOjK,SAAWtB,KAAK8oC,SAASv9B,OAAOjK,OAA3D,CACA,IAAK+J,EAAI,EAAGA,EAAIrL,KAAKqmE,OAAO/kE,SAAU+J,EACpC,IAAKynG,EAAKjxE,WAAWziC,IAAIiM,GAAI,OAE/BynG,EAAKwtE,UAAW,EAChBxtE,EAAKzqE,UAGPyqE,EAAKpuE,GAAG,YAAY,KAClB27I,IACArgL,KAAKk9C,UACLl9C,KAAKugL,oBAAoBztE,MAG3BA,EAAKpuE,GAAG,QAAQ,KACd27I,IACArgL,KAAKk9C,UACLl9C,KAAKugL,oBAAoBztE,MAG3BA,EAAK0tE,YAAY97I,GAAG,YAAY,KAC9B27I,IACArgL,KAAKk9C,UACLl9C,KAAKugL,oBAAoBztE,MAI3BA,EAAKpuE,GAAG,YAAY,KAClBouE,EAAKwtE,UAAW,EAChBxtE,EAAKzqE,QACLroC,KAAKk9C,UACLl9C,KAAKugL,oBAAoBztE,MAI3BA,EAAKpuE,GAAG,aAAa,KACnBouE,EAAKwtE,UAAW,EAChBtgL,KAAKk9C,UACLl9C,KAAKugL,oBAAoBztE,MAI3BA,EAAKpuE,GAAG,gBAAiB96B,IACvB5J,KAAKk9C,aAGP41D,EAAKtuE,KAAK,cAAc,KACtBsuE,EAAKrqE,aAGPqqE,EAAKtuE,KAAK,SAAS,KACjBmI,aAAawzI,MAGfrtE,EAAKpuE,GAAG,SAAS,KACfiI,aAAawzI,GACbA,EAAYh7I,WAAWi7I,EAAgBpF,GACnCmF,EAAU96I,OAAO86I,EAAU96I,WAGjCytE,EAAKpuE,GAAG,WAAW,KACjBiI,aAAawzI,GACbngL,KAAKk9C,aAGP41D,EAAKpuE,GAAG,WAAW,CAAC96B,EAAOvI,EAAQC,EAAQynC,KACzC,GAAIznC,EA3oCe,OA6oCjB,OAAOwxG,EAAKttE,UAEVxlC,KAAKqmE,OAAOz8D,IAChB5J,KAAK86D,MAAM17D,IAAIwK,EAAO,CAAEvI,OAAAA,EAAQC,OAAAA,GAAUynC,MAIxC+pE,EAAKxwE,SAAWtiC,KAAKg/K,gBAAiBlsE,EAAKzpE,UACtCypE,EAAKxwE,SAAWtiC,KAAKi/K,eAAgBnsE,EAAKxpE,WAC9CwpE,EAAKhqE,SAAS9oC,KAAK8oC,UAGxB9oC,KAAKugL,oBAAoBztE,GAGrBA,EAAK/wE,eAAeiG,KAAOhoC,KAAK2xC,OAAO3J,KAAOhoC,KAAK2xC,OAAO3J,IAAImqI,WAChEr/D,EAAK3pE,KAAKnpC,KAAK2xC,OAAO3J,IAAIihH,UAAU9/G,MAGpB,YAAd2pE,EAAK9qG,OACPm4K,EAAYh7I,WAAWi7I,EAAgBpF,GACnCmF,EAAU96I,OAAO86I,EAAU96I,SAGjCytE,EAAKwtE,UAAW,EAChBD,IAMFjB,oBACOp/K,KAAK0zK,QAAS1zK,KAAKmjC,YAExB4L,GAAe,KACb/uC,KAAKygL,mBAEPzgL,KAAK0gL,kBACL1gL,KAAKk9C,WAMPujI,gBACE,IAAK,IAAIp1K,EAAI,EAAGA,EAAIrL,KAAKy8K,YAAYn7K,SAAU+J,EAAG,CAChD,MAAM8R,EAAInd,KAAKy8K,YAAYpxK,GACrBs1K,EAAYxjK,EAAE9b,OAGpB,KAAOrB,KAAK8oC,SAAS1pC,IAAI+d,EAAEtP,KAAOsP,EAAE9b,SAAW8b,EAAEtP,KAAOsP,EAAE9b,OAAS8b,EAAEs7E,IACnEt7E,EAAE9b,QAAU,EAGVs/K,IAAcxjK,EAAE9b,QAAQ8b,EAAE6iK,SAC1B7iK,EAAEs7E,KAAOt7E,EAAEtP,KAAOsP,EAAE9b,QACnBrB,KAAK8oC,SAAS1pC,IAAI+d,EAAEtP,KAAOsP,EAAE9b,UAElCrB,KAAKy8K,YAAYluK,OAAOlD,EAAG,GAC3BA,GAAK,EAEL8R,EAAE6iK,SACFhgL,KAAK0gL,mBAGF1gL,KAAKy8K,YAAYn7K,QAAQtB,KAAKylC,KAAK,QAM1Ci7I,kBACE,MAAM72K,EAAO7J,KAAKw8K,cAClBx8K,KAAKw8K,gBAAkBx8K,KAAKy8K,YAAYn7K,OAExCtB,KAAKq5K,MAAMr2K,SAAQ8vG,GAAQ9yG,KAAKugL,oBAAoBztE,KAEhDjpG,IAAS7J,KAAKw8K,gBACdx8K,KAAKw8K,cAAex8K,KAAKylC,KAAK,cAC7BzlC,KAAKylC,KAAK,iBAGjB86I,oBAAqBztE,GACnB,IAAIpqE,GAAa,EACjB,IAAK,IAAI9+B,EAAQ,EAAGA,EAAQ5J,KAAKqmE,OAAO/kE,SAAUsI,EAChD,GAAI5J,KAAKqmE,OAAOz8D,IAAUkpG,EAAKjxE,WAAWziC,IAAIwK,GAAQ,CACpD8+B,GAAa,EACb,MAIAA,EAAYoqE,EAAKpqE,aAChBoqE,EAAKnqE,eAMZuU,UACE,GAAIl9C,KAAKmjC,UAAW,OAGpB,MAAMu3H,EAAMggB,EAAc16K,KAAKq5K,OAC/B,IAAIvmE,EACJ,KAAQA,EAAO4nD,KACb16J,KAAK4gL,mBAAmB9tE,GAI5B8tE,mBAAoB9tE,GAClB,MAAMngG,EAAO3S,KAES,oBAAXqQ,QAAgE,mBAA/BA,OAAOwwK,oBACjDxwK,OAAOwwK,qBAAoB,KAAQluK,EAAKmuK,YAAYhuE,KAAS,CAAEn/D,QAAS,MAExEhhC,EAAKmuK,YAAYhuE,GAOrBguE,YAAahuE,GAEX,MAAMngG,EAAO3S,KAEP+gL,EAAyBvF,EAAuB1oE,EAtwC5B,IAuwC1B,GAAIA,EAAK9wE,SAAS1gC,QAAUy/K,EAAwB,OACpD,MAAMC,EAAyBxF,EAAuB1oE,EAvwC5B,GAywC1B,GAAIA,EAAKnxE,YACHmxE,EAAKxwE,SAAWwwE,EAAKtwE,mBAAmBlhC,OAAS,IAClDtB,KAAKk/K,eAAepsE,EAAKtwE,mBAAmBlhC,OAAS,IAU1D,WACE,GAAIwxG,EAAK9wE,SAAS1gC,QAAU0/K,EAAwB,OAAO,EAE3D,IAAK,MAAMngJ,KAASiyE,EAAKtwE,mBAAoB,CAC3C,GAAIswE,EAAKjxE,WAAWziC,IAAIyhC,KAAWluB,EAAKm2B,SAAS1pC,IAAIyhC,GACnD,KAAOluB,EAAKszJ,SAASnzD,EAAMjyE,GAAO,IAChCiyE,EAAK9wE,SAAS1gC,OAAS0/K,IAM3B,KAAIluE,EAAK9wE,SAAS1gC,OAAS0/K,GAE3B,OAAO,GAvBPC,OAHJ,CAQA,IAAKnuE,EAAKlwE,WAAY,OA6BtB,WACE,GAAIkwE,EAAK9wE,SAAS1gC,OAAQ,OAE1B,IAAI+J,EAAIsH,EAAK8pK,YAAYn7K,OACzB,KAAO+J,KAAK,CACV,MAAMqb,EAAO/T,EAAK8pK,YAAYpxK,GAC9B,IAAIw1B,EACJ,GAAsB,WAAlBluB,EAAKs0C,SAAuB,CAC9B,MAAMpgD,EAAQ6f,EAAK7Y,KAAO6Y,EAAKrlB,OACzBqM,EAAMgZ,EAAK+xE,GACXrtF,EAAMsC,EAAM7G,EAAQ,EACpBq6K,EAAQ,GACd,IAAIC,EAAQ,EACZ,MAAMh8K,EAASi8K,EAAmBv6K,EAAO6G,EAAKwzK,GAE9C,KAAOC,EAAQ/1K,IACby1B,EAAQluB,EAAKyrK,WAAWxE,eAAez0K,KACnC07B,EAAQ,KAFM,CAGlB,GAAIluB,EAAKszJ,SAASnzD,EAAMjyE,GAAO,GAAQ,OACvCqgJ,EAAMrgJ,IAAS,EACfsgJ,GAAS,QAGX,IAAKtgJ,EAAQna,EAAK+xE,GAAI53D,GAASna,EAAK7Y,KAAO6Y,EAAKrlB,SAAUw/B,EACxD,GAAKiyE,EAAKjxE,WAAWziC,IAAIyhC,IACrBluB,EAAKszJ,SAASnzD,EAAMjyE,GAAO,GAAQ,QAtDlBwgJ,GAE7BC,GAAc,IAAUA,GAAc,GAsBtC,SAASF,EAAoBv6K,EAAO6G,EAAKwzK,EAAOn3D,GAC9C,OAAO1+G,GAAKA,GAAKxE,GAASwE,GAAKqC,KAASrC,KAAK61K,IAAUpuE,EAAKjxE,WAAWziC,IAAIiM,MAAQ0+G,GAAQA,EAAK1+G,IAoElG,SAASk2K,EAAiBl2K,GACxB,IAAI6zC,EAAO7zC,EACX,IAAK,IAAIC,EAAID,EAAGC,EAAIqH,EAAK8pK,YAAYn7K,QAAUqR,EAAK8pK,YAAYnxK,GAAGsrK,SAAUtrK,IAC3E4zC,EAAO5zC,EAET,MAAMoB,EAAMiG,EAAK8pK,YAAYpxK,GAC7BsH,EAAK8pK,YAAYpxK,GAAKsH,EAAK8pK,YAAYv9H,GACvCvsC,EAAK8pK,YAAYv9H,GAAQxyC,EAG3B,SAAS40K,EAAeE,GACtB,GAAI1uE,EAAK9wE,SAAS1gC,QAAU0/K,EAAwB,OAAO,EAC3D,MAAMj3D,EA1CR,WACE,MAAM7pD,EAAQ4yC,EAAKhwE,iBAAmB,EACtC,GAAIo9B,EAAQ+6G,EAAiB,MAAO,KAAM,EAE1C,MAAMwG,EAAO3wK,KAAKC,IAAI,EAAG+hG,EAAK9wE,SAAS1gC,QAAUs9J,EAAMD,aAAez+F,EACtE,IAAIihH,EAAQ,GACR/kE,EAAM,EAEV,OAAOxyG,IACL,IAAKu3K,GAASxuK,EAAKm2B,SAAS1pC,IAAIwK,GAAQ,OAAO,EAE/C,IAAIi1J,EAAUlsJ,EAAK0zD,OAAOz8D,GAAOi1J,QAEjC,KAAOziD,EAAMzpG,EAAK0mK,MAAM/3K,OAAQ86G,IAAO,CACrC,MAAMslE,EAAY/uK,EAAK0mK,MAAMj9D,GACvBulE,EAAaD,EAAU5+I,gBAE7B,KAAI6+I,EAAa1G,MACb0G,GAAczhH,IACbwhH,EAAU7/I,WAAWziC,IAAIwK,OACzBi1J,GAAW8iB,EAAaF,GAAQ,GAGrC,OADAN,KACO,EAGT,OAAO,GAgBIS,GAEb,IAAK,IAAIv2K,EAAI,EAAGA,EAAIsH,EAAK8pK,YAAYn7K,OAAQ+J,IAAK,CAChD,MAAMqb,EAAO/T,EAAK8pK,YAAYpxK,GAE9B,IAAIw1B,EACJ,GAAsB,WAAlBluB,EAAKs0C,SAAuB,CAC9B,MAAMpgD,EAAQ6f,EAAK7Y,KAAO6Y,EAAKrlB,OACzBqM,EAAMgZ,EAAK+xE,GACXrtF,EAAMsC,EAAM7G,EAAQ,EACpBq6K,EAAQ,GACd,IAAIC,EAAQ,EACZ,MAAMh8K,EAASi8K,EAAmBv6K,EAAO6G,EAAKwzK,EAAOn3D,GAErD,KAAOo3D,EAAQ/1K,IACby1B,EAAQluB,EAAKyrK,WAAWxE,eAAez0K,KACnC07B,EAAQ,KAFM,CAIlB,KAAOluB,EAAKszJ,SAASnzD,EAAMjyE,EAAOluB,EAAK+pK,UAAU77I,IAAU2gJ,IACzD1uE,EAAK9wE,SAAS1gC,OAAS0/K,IAKzB,KAAIluE,EAAK9wE,SAAS1gC,OAAS0/K,GAO3B,OADIt6J,EAAKkwJ,UAAU2K,EAAgBl2K,IAC5B,EANL61K,EAAMrgJ,IAAS,EACfsgJ,UAQJ,IAAKtgJ,EAAQna,EAAK7Y,KAAO6Y,EAAKrlB,OAAQw/B,GAASna,EAAK+xE,GAAI53D,IACtD,GAAKiyE,EAAKjxE,WAAWziC,IAAIyhC,IAAWkpF,EAAKlpF,GAAzC,CAEA,KAAOluB,EAAKszJ,SAASnzD,EAAMjyE,EAAOluB,EAAK+pK,UAAU77I,IAAU2gJ,IACzD1uE,EAAK9wE,SAAS1gC,OAAS0/K,IAKzB,KAAIluE,EAAK9wE,SAAS1gC,OAAS0/K,GAG3B,OADIt6J,EAAKkwJ,UAAU2K,EAAgBl2K,IAC5B,GAKb,OAAO,GAQXqyK,WACE,IAAK19K,KAAK0zK,MAAO,OAGjB,MAAMmO,EACJ7hL,KAAKq5K,MACFz3K,KAAIkxG,IAAQ,CAAGA,KAAAA,EAAMxsE,OAAQx1B,KAAKw1B,aAClClJ,MAAK,CAAC0kJ,EAAMC,KACX,MAAMC,EAAQF,EAAKhvE,KACbmvE,EAAQF,EAAKjvE,KAGnB,OAAIkvE,EAAMl/I,kBAAoBm/I,EAAMn/I,gBAC3Bk/I,EAAMl/I,gBAAkBm/I,EAAMn/I,gBAInCk/I,EAAMn/I,gBAAkBo/I,EAAMp/I,cACzBm/I,EAAMn/I,cAAgBo/I,EAAMp/I,cAIjCm/I,EAAMvgJ,YAAcwgJ,EAAMxgJ,UACrBugJ,EAAMvgJ,WAAa,EAAI,EAIzBqgJ,EAAKx7I,OAASy7I,EAAKz7I,UAE3B1kC,KAAIsC,GAAOA,EAAI4uG,OAEhB9yG,KAAKq8K,wBAA0B,EAEjCr8K,KAAKo8K,uBAAyB,KAE9Bp8K,KAAKq8K,wBAA0B,EAGjC,IAAI6F,EAAwB,EAE5B,KAAOL,EAAUvgL,OAAS,GAAK4gL,EAAwBliL,KAAKk8K,iBAAmB,GAAG,CAChF,MAAMppE,EAAO+uE,EAAU9vJ,MAEnB+gF,EAAKwtE,UAAYxtE,IAAS9yG,KAAKo8K,yBAInCtpE,EAAKrqE,UAGDqqE,EAAKlxE,gBACPsgJ,KAKJ,GAAoC,OAAhCliL,KAAKo8K,wBAAmCp8K,KAAKk8K,iBAAmB,EAAG,CAErE,MAAM7oH,EAAYwuH,EAAU18K,QAAO2tG,GAAQA,EAAKlxE,iBAEhD,GAAIyxB,EAAU/xD,OAAS,EAAG,CAExB,MAAM6gL,EAAoB9uH,GAuXdv0B,EAvXkCu0B,EAAU/xD,OAwXvDwP,KAAKw1B,SAAWxH,EAAO,IAtXxBqjJ,EAAkB15I,UAElBzoC,KAAKo8K,uBAAyB+F,EAE9BniL,KAAKq8K,uBAt/CuB,GAu2DpC,IAAoBv9I,EA5WhB+iJ,EACG18K,QAAO2tG,GAAQA,IAAS9yG,KAAKo8K,yBAC7Bp5K,SAAQ8vG,GAAQA,EAAKzqE,UAO1B+5I,SAAUtvE,EAAMlpG,GACd,MAAMs2D,EAAQ4yC,EAAKhwE,gBACnB,GAAIo9B,EAAQ0+F,EAAMD,aAAc,OAAO,EACvC,IAAK3+J,KAAKi/J,cAAcr1J,GAAQ,OAAO,EAEvC,MAAM+G,EAAI3Q,KAAKi/J,cAAcr1J,GAC7B,IAAK+G,EACH,OAAO,EAGT,IACI0xK,EAEAh3K,EAHAi3K,EAAWjyJ,EAAAA,EAIf,IAAKhlB,EAAI,EAAGA,EAAIsF,EAAErP,OAAQ+J,IAAK,CAC7B,MAAMq2K,EAAY/wK,EAAEtF,GACpB,IAAKq2K,GAAaA,IAAc5uE,EAAM,SAEtC,MAAM6uE,EAAaD,EAAU5+I,gBACzB6+I,GAAc1G,GACd,EAAI0G,EAAazhH,GAASyhH,EAAaW,IAE3CD,EAAUX,EACVY,EAAWX,GAGb,IAAKU,EAAS,OAAO,EAErB,IAAKh3K,EAAI,EAAGA,EAAIsF,EAAErP,OAAQ+J,IACpBsF,EAAEtF,KAAOg3K,IAAS1xK,EAAEtF,GAAK,MAG/B,IAAKA,EAAI,EAAGA,EAAIg3K,EAAQrgJ,SAAS1gC,OAAQ+J,IAAK,CAC5C,MAAMmjC,EAAM6zI,EAAQrgJ,SAAS32B,GACzBmjC,EAAI3N,QAAUj3B,GAElB5J,KAAKqmE,OAAOz8D,GAAOo/B,OAAQwF,EAAIntC,OAASu9J,EAAMD,aAAgB,GAIhE,OADA3+J,KAAKylC,KAAK,UAAW48I,EAASvvE,EAAMlpG,IAC7B,EAMTq8J,SAAUnzD,EAAMlpG,EAAO43K,GACrB,MAAM7uK,EAAO3S,KACPuiL,EAAczvE,EAAK9wE,SAAS1gC,OAC5BkhL,EAA0B,YAAd1vE,EAAK9qG,KAEvB,GAAI2K,EAAKm2B,SAAS1pC,IAAIwK,GAAQ,OAAO,EAErC,MAAMo3K,EAAyBwB,EAC3B1xK,KAAK/D,IAsSb,SAAiC+lG,EAAMrzC,EAAU2G,GAC/C,OAAO,EAAIt1D,KAAKS,KAp2DY,EAo2DIuhG,EAAKhwE,gBAAkBsjC,GAtS/Cq8G,CAAuB3vE,EA9jDH,EA8jDgCngG,EAAKyzD,aACzDzzD,EAAKspK,aAEPT,EAAuB1oE,EAjkDD,GAmkD1B,GAAIyvE,GAAevB,EAAwB,OAAO,EAGlD,MAAMngJ,EAAQluB,EAAK0zD,OAAOz8D,GAC1B,IAAI84K,EAAcF,EAAY3hJ,EAAMw+H,mBAAqBx+H,EAAMu+H,UAK/D,IAHqB,IAAjBsjB,GAAsBlB,GAAW7uK,EAAKyvK,SAAStvE,EAAMlpG,KACvD84K,EAAcF,EAAY3hJ,EAAMw+H,mBAAqBx+H,EAAMu+H,YAExC,IAAjBsjB,EAAoB,OAAO,EAE/B,IAAI/xK,EAAIgC,EAAKssJ,cAAcr1J,GACtB+G,IAAGA,EAAIgC,EAAKssJ,cAAcr1J,GAAS,IACxC,IAAIyB,EAAIsF,EAAEyc,QAAQ,OACP,IAAP/hB,IAAUA,EAAIsF,EAAErP,QACpBqP,EAAEtF,GAAKynG,EAEP,MAAMqmC,EAAct4G,EAAMs4G,YAAYupC,GAChC3nH,EAAcynH,EAAY3hJ,EAAMs+H,qBAAqBujB,GAAe7hJ,EAAMk6B,YAAY2nH,GAgE5F,SAASC,IACP5zI,GAAe,KAAQp8B,EAAKuqC,aAG9B,OAlEA41D,EAAKxqE,QAAQ1+B,EAAOuvI,EAAap+E,GAAa,SAAS6nH,EAAS74K,EAAKozC,GACnE,GAAIxqC,EAAKwwB,UAAW,OAGpB,IAAKxwB,EAAK+gK,MAAO,OAAO/gK,EAAK6xB,KAAK,SAAS,KAAQo+I,EAAQ74K,EAAKozC,MAIhE,GAFIxsC,EAAEtF,KAAOynG,IAAMniG,EAAEtF,GAAK,MAEtBw1B,IAAUluB,EAAK0zD,OAAOz8D,GAAQ,OAAO+4K,IAEzC,GAAI54K,EAQF,OAPA4I,EAAK2uB,OACH,6DACA13B,EAAOuvI,EAAap+E,EAAa,GAAG+3C,EAAKozC,iBAAiBpzC,EAAKszC,aAC/Dr8I,EAAIG,SAENs4K,EAAY3hJ,EAAMy+H,gBAAgBojB,GAAe7hJ,EAAMmI,OAAO05I,QAC9DC,IASF,GALAhwK,EAAK2uB,OACH,+CACA13B,EAAOuvI,EAAap+E,EAAa,GAAG+3C,EAAKozC,iBAAiBpzC,EAAKszC,eAG5DvlH,EAAM3hC,IAAIwjL,EAAavlI,EAAO21D,GAAO,OAAO6vE,IAEjD,MAAM33K,EAAM61B,EAAMoe,QAIlBtf,EAAK30B,GAAK04C,IACJ/wC,EAAKwwB,YAELugB,IAAS/wC,EAAK4rK,QAAQ30K,IACxB+I,EAAK2uB,OAAO,oBAAqB13B,GAEjC+I,EAAKmoD,MAAMG,IAAIrxD,EAAOoB,GAAKjB,IACrBA,EACF4I,EAAK8xG,SAAS16G,IAGd4I,EAAK0zD,OAAOz8D,GAAS,KACrB+I,EAAKmsK,cAAcl1K,GACnB+I,EAAK0mK,MAAMr2K,SAAQ8vG,IACjBA,EAAKlqE,KAAKh/B,MAKV+I,EAAKyzJ,eAAiBzzJ,EAAKwwB,WAAWxwB,EAAKorK,UAAU5sI,WACzDwxI,UAGFhwK,EAAK0zD,OAAOz8D,GAAS,IAAIg1J,EAAM/9H,EAAMv/B,QACrCqR,EAAK8yB,KAAK,UAAW,IAAIxmC,MAAM,SAAS2K,0BACxC+4K,aASC,EAGTvc,aACE,GAAIpmK,KAAKmjC,UAAW,OAGpBnjC,KAAKu1C,MAAMvyC,SAAQ6hE,IACjB,IAAIA,EAAK9vC,KAAT,CACA,IAAK,IAAI1pB,EAAIw5D,EAAK2wG,YAAanqK,GAAKw5D,EAAK4wG,YAAapqK,EACpD,IAAKrL,KAAK8oC,SAAS1pC,IAAIiM,GAAI,OAE7Bw5D,EAAK9vC,MAAO,EACZ8vC,EAAKp/B,KAAK,QACVzlC,KAAKshC,OAAO,cAAcujC,EAAK/kE,YAKjC,IAAIi1B,GAAO,EAEX,IAAK,MAAM8tJ,KAAa7iL,KAAKy8K,YAAa,CACxC,IAAK,IAAI57I,EAAQgiJ,EAAUh1K,KAAMgzB,GAASgiJ,EAAUpqF,GAAI53D,IACtD,IAAK7gC,KAAK8oC,SAAS1pC,IAAIyhC,GAAQ,CAC7B9L,GAAO,EACP,MAGJ,IAAKA,EAAM,MAYb,OATK/0B,KAAK+0B,MAAQA,GAChB/0B,KAAK+0B,MAAO,EACZ/0B,KAAKshC,OAAO,iBAAiBthC,KAAK4mC,YAClC5mC,KAAKylC,KAAK,SAEVzlC,KAAK+0B,MAAO,EAEd/0B,KAAKygL,gBAEE1rJ,EAGTs0C,KAAM9C,EAASx9B,GACb,GAAI/oC,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,wBACpC,IAAKe,KAAK0zK,MAAO,OAAO1zK,KAAKwkC,KAAK,SAAS,KAAQxkC,KAAKqpE,KAAK9C,EAASx9B,MAEjErnC,MAAMC,QAAQ4kE,KAAUA,EAAU,CAACA,IACnCx9B,IAAIA,EAAKhD,GAEd,MAAMk/B,EAAW,IAAIrB,EAAY2C,GAC3B94C,EAAW,IAAI8uC,EAAsBv8D,KAAK86D,MAAO96D,KAAKomE,aAE5DmqG,EAAKtrG,EAAUx3C,GAAU1jB,IACvB,GAAIA,EAAK,OAAOg/B,EAAGh/B,GACnB/J,KAAKy+K,mBACLz+K,KAAKomK,aACLr9H,EAAG,SAIP+5I,aAAcC,GACZ,GAAsB,mBAAXjI,EAAuB,MAAM,IAAI77K,MAAM,uBAClD,GAAIe,KAAKmjC,UAAW,MAAM,IAAIlkC,MAAM,wBACpC,MAAMogL,EAAS,IAAIvE,EAAO96K,KAAM+iL,GAEhC,OADA/iL,KAAK68K,SAAS93K,KAAKs6K,GACZA,EAGTziH,QACM58D,KAAKmjC,YACTnjC,KAAKshC,OAAO,SACZthC,KAAK2pI,QAAS,GAGhB9sE,SACM78D,KAAKmjC,YACTnjC,KAAKshC,OAAO,UACZthC,KAAK2pI,QAAS,EACd3pI,KAAK8iH,UAGPxhF,SACE,MAAMz9B,EAAO,GAAGjB,MAAMrC,KAAK0E,WAC3BpB,EAAK,GAAK,IAAI7D,KAAK2xC,OAAS3xC,KAAK2xC,OAAOtQ,SAAW,iBAAiBrhC,KAAKqhC,aAAax9B,EAAK,KAC3F47B,KAAS57B,GASXi/G,SAEE,GADA9iH,KAAKshC,OAAO,iCAAkCthC,KAAKs9K,UAAWt9K,KAAK2xC,OAAO2gI,UAC/C,mBAAhB4H,EAAI8I,SAA0BhjL,KAAKmjC,WAAanjC,KAAK2pI,QAC5D3pI,KAAKs9K,WAAat9K,KAAK2xC,OAAO2gI,SAChC,OAEFtyK,KAAKshC,OAAO,iCAAkCthC,KAAKq9K,WAAYr9K,KAAKk9K,SAAUl9K,KAAK2xC,OAAO2gI,UAE1F,MAAMn/H,EAAOnzC,KAAKskH,OAAO3jG,QACzB,IAAKwyB,EAAM,OAEXnzC,KAAKshC,OAAO,2BAA4B6R,EAAKnrC,KAAMmrC,EAAKx0C,MAExD,MAAM88B,EAAQ0+I,EAAahnI,EAAKx0C,MAC1BsgC,EAAO,CACX2lH,KAAMnpH,EAAM,GACZ0N,KAAM1N,EAAM,IAGVz7B,KAAK2xC,OAAO4gI,KAAqB,gBAAdp/H,EAAKnrC,KAC1BmrC,EAAKskI,KAAOlF,EAAIyQ,QAAQ/jJ,EAAKkK,KAAMlK,EAAK2lH,MAExCzxG,EAAKskI,KAAOyC,EAAI8I,QAAQ/jJ,GAG1B,MAAMw4I,EAAOtkI,EAAKskI,KAElBA,EAAKjzI,KAAK,WAAW,KAAQ2O,EAAK8C,eAClCwhI,EAAKjzI,KAAK,SAASz6B,IAASopC,EAAK3N,QAAQz7B,MACzCopC,EAAKwkI,sBAGLF,EAAK/yI,GAAG,SAAS,KACf,GAAI1kC,KAAKmjC,UAAW,OAEpB,GAAIgQ,EAAKjS,SAAWi6I,EAAe75K,OAAQ,CACzC,GAAItB,KAAK2xC,OAAO4gI,IAAK,CACnB,MAAMoN,EAAU3/K,KAAKy/K,SAAStsI,EAAKx0C,KAAM,OACrCghL,IAASA,EAAQz+I,QAAU,QAE/BlhC,KAAKshC,OACH,oDACA6R,EAAKx0C,KAAMw8K,EAAe75K,QAG9B,OAGF,MAAM8jC,EAAK+1I,EAAehoI,EAAKjS,SAC/BlhC,KAAKshC,OACH,4DACA6R,EAAKx0C,KAAMymC,EAAI+N,EAAKjS,QAAU,GAGhC,MAAM+hJ,EAAmB99I,YAAW,KAClC,GAAInlC,KAAKmjC,UAAW,OACpB,MAAMyhH,EAAOu1B,EAAahnI,EAAKx0C,MAAM,GAC/BqJ,EAAQhI,KAAK2xC,OAAO4gI,KAAOvyK,KAAKu/K,QAAQ36B,GAAS,MAAQ,MACzD+6B,EAAU3/K,KAAKy/K,SAAStsI,EAAKx0C,KAAMqJ,GACrC23K,IAASA,EAAQz+I,QAAUiS,EAAKjS,QAAU,KAC7CkE,GACC69I,EAAiB59I,OAAO49I,EAAiB59I,WASjDq6I,WAAY/gL,GACV,IAAI88B,EACJ,IACEA,EAAQ0+I,EAAax7K,GACrB,MAAO+H,GACP,OAAO,EAET,MAAMk+I,EAAOnpH,EAAM,GACb0N,EAAO1N,EAAM,GACnB,OAAO0N,EAAO,GAAKA,EAAO,SACb,cAATy7G,GAAwBz7G,IAASnpC,KAAK2xC,OAAOygI,aAQnDmN,QAAS5gL,GAEP,MADoB,qHACD0I,KAAK1I,0CC/3D5B,MAAQysE,QAASpsC,GAAa,EAAQ,MAChCyyI,EAAe,EAAQ,MACvBryK,EAAM,EAAQ,MACdyzG,EAAa,EAAQ,MACrBlzE,EAAO,EAAQ,MACfqB,EAAO,EAAQ,MAEfvB,EAAQgyI,EAAa,sBACrBI,EAAU,gBAgNhBpzK,EAAOC,QAtMP,cAAsBsiC,EACpB/+B,YAAauyC,EAAKqxB,GAChBzkC,QAEAphC,KAAKw0C,IAAMA,EACXx0C,KAAK8/K,OAAStrI,EACdx0C,KAAKkjL,UAAYvjJ,EAAKoH,KAAKyN,GAC3Bx0C,KAAKu1K,SAAW1vG,EAEhB7lE,KAAKkF,QAGPA,QACElF,KAAK8kC,cAAa,GAElB9kC,KAAKmE,IAAI0uG,KAET7yG,KAAKwkC,KAAK,aAAa,CAACoC,EAAUrF,KAChC,GAAIvhC,KAAKmjC,UAAW,OACpBnjC,KAAK2nC,UAAUf,EAAU5mC,KAAKkjL,WAC9B,MAAMC,EAAYnjL,KAAKu1K,SAASlvG,OAAO/kE,OACjCwnC,EAAW,IAAI9J,EAASmkJ,GAC9B,IAAK,IAAI93K,EAAI,EAAGA,GAAK83K,EAAW93K,IAC9By9B,EAAS5pC,IAAImM,GAAG,GAElBrL,KAAK8oC,SAASA,MAGhB9oC,KAAKwkC,KAAK,cAAc,KACtB/E,EAAM,cACNz/B,KAAKyoC,aAGPzoC,KAAK0kC,GAAG,gBAAgB,KAAQjF,EAAM,mBACtCz/B,KAAK0kC,GAAG,SAAS,KAAQjF,EAAM,YAC/Bz/B,KAAK0kC,GAAG,WAAW,KAAQjF,EAAM,cACjCz/B,KAAK0kC,GAAG,YAAY,KAAQjF,EAAM,eAClCz/B,KAAKwgL,YAAY97I,GAAG,YAAY,KAAQjF,EAAM,eAE9Cz/B,KAAK0kC,GAAG,WAAW,CAAC8xI,EAAYn1K,EAAQC,EAAQw/B,KAC9CrB,EAAM,4CAA6C+2I,EAAYn1K,EAAQC,GACvEtB,KAAKojL,YAAY5M,EAAYn1K,EAAQC,GAAQ,CAACyI,EAAKnJ,KACjD,GAAImJ,EAAK,CAEP/J,KAAKwgL,YAAYttE,SAASsjE,GAG1B,MAAM6M,EAAel+I,YAAW,KAC1BnlC,KAAKmjC,WAETnjC,KAAK4oC,KAAK4tI,KAzDF,KA2DN6M,EAAah+I,OAAOg+I,EAAah+I,QAGvCvE,EAAS/2B,EAAKnJ,SAKpBwiL,YAAa5M,EAAYn1K,EAAQC,EAAQynC,GACvC,MACMu6I,EADc9M,EAAax2K,KAAKu1K,SAASnvG,YACd/kE,EAC3BkiL,EAAWD,EAAahiL,EAAS,EAKjCi0C,EAAQv1C,KAAKu1K,SAAShgI,MAC5B,IAAIvT,EACJ,GAAIuT,EAAMj0C,QAAU,EAClB0gC,EAAW,CAAC,CACVwS,IAAKx0C,KAAKw0C,IACV3tC,MAAOy8K,EACP51K,IAAK61K,QAEF,CACL,MAAMC,EAAiBjuI,EAAMpwC,QAAO0/D,GAAQA,EAAKxjE,QAAUkiL,GAAa1+G,EAAKxjE,OAASwjE,EAAKvjE,OAAUgiL,IACrG,GAAIE,EAAeliL,OAAS,EAC1B,OAAOynC,EAAG,IAAI9pC,MAAM,gEAGtB+iC,EAAWwhJ,EAAe5hL,KAAI6hL,IAC5B,MAAMC,EAAUD,EAAcpiL,OAASoiL,EAAcniL,OAAS,EAI9D,MAAO,CACLkzC,IAJUx0C,KAAKw0C,KACoB,MAAlCx0C,KAAKw0C,IAAIx0C,KAAKw0C,IAAIlzC,OAAS,GAAa,GAAK,KAC9CmiL,EAAc18K,KAGd48K,kBAAmB7yK,KAAKC,IAAI0yK,EAAcpiL,OAASiiL,EAAY,GAC/Dz8K,MAAOiK,KAAKC,IAAIuyK,EAAaG,EAAcpiL,OAAQ,GACnDqM,IAAKoD,KAAK/D,IAAI22K,EAASH,EAAWE,EAAcpiL,YAQtD,IAGIsS,EAHAiwK,EAAuB,EACvBC,GAAW,EAGX7hJ,EAAS1gC,OAAS,IACpBqS,EAAMzS,EAAO6B,MAAMzB,IAGrB0gC,EAASh/B,SAAQslC,IACf,MAAMkM,EAAMlM,EAAQkM,IACd3tC,EAAQyhC,EAAQzhC,MAChB6G,EAAM46B,EAAQ56B,IACpB+xB,EACE,sEACA+U,EAAKgiI,EAAYn1K,EAAQC,EAAQuF,EAAO6G,GAE1C,MAAMuxB,EAAO,CACXuV,IAAAA,EACA1vC,OAAQ,MACRq8G,QAAS,CACP,aAAc,cAAc0wD,4BAC5B1zI,MAAO,SAASt3B,KAAS6G,KAE3BimC,QAlIe,KAoIjB,SAASmwI,EAAYthL,EAAK5B,GACxB,GAAI4B,EAAImiJ,WAAa,KAAOniJ,EAAImiJ,YAAc,IAAK,CACjD,GAAIk/B,EAAU,OAEd,OADAA,GAAW,EACJ96I,EAAG,IAAI9pC,MAAM,+BAA+BuD,EAAImiJ,eAEzDllH,EAAM,wBAAyB7+B,EAAKU,QAEZ,IAApB0gC,EAAS1gC,OAEXynC,EAAG,KAAMnoC,IAITA,EAAKsC,KAAKyQ,EAAK20B,EAAQq7I,qBACjBC,IAAyB5hJ,EAAS1gC,QACtCynC,EAAG,KAAMp1B,IAIfvU,EAAImE,OAAO07B,GAAM,CAACl1B,EAAKvH,EAAK5B,KAC1B,IAAIijL,EACJ,OAAI95K,EAUoB,oBAAXsG,QAA0BmkC,EAAI0/D,WAAW,GAAG7jG,OAAOwgC,SAASyF,YACrEutI,GAAW,EACJ96I,EAAGh/B,IAGL3K,EAAIo9F,KAAKhoD,GAAK,CAACuvI,EAASvhL,KAC7B,IAAIqhL,EAAJ,CACA,GAAIE,EAEF,OADAF,GAAW,EACJ96I,EAAGg7I,GAEZ,GAAIvhL,EAAImiJ,WAAa,KAAOniJ,EAAImiJ,YAAc,IAE5C,OADAk/B,GAAW,EACJ96I,EAAG,IAAI9pC,MAAM,+BAA+BuD,EAAImiJ,eAEzD,GAAIniJ,EAAIgyC,MAAQA,EAEd,OADAqvI,GAAW,EACJ96I,EAAGh/B,GAGZk1B,EAAKuV,IAAMhyC,EAAIgyC,IACfp1C,EAAImE,OAAO07B,GAAM,CAACl1B,EAAKvH,EAAK5B,KAC1B,IAAIijL,EACJ,OAAI95K,GACF85K,GAAW,EACJ96I,EAAGh/B,SAEZ+5K,EAAWthL,EAAK5B,eAItBkjL,EAAWthL,EAAK5B,SAKtB4kC,UACEpE,MAAMoE,UACNxlC,KAAKu1K,SAAW,oCClNpB,IAAIvyK,EAAU,EAAQ,MAClB6sG,EAAuB,EAAQ,MAC/BZ,EAAY,EAAQ,MAEpBD,EAAYC,EAAU,6BACtBF,EAAiB,EAAQ,KAAR,GAEjB/sF,EAA0B,oBAAf0jD,WAA6B,EAAA1jD,EAAS0jD,WACjDoqC,EAAcD,IAEdE,EAASd,EAAU,0BACnBe,EAAY,GACZC,EAAO,EAAQ,KACf/gF,EAAiB1pB,OAAO0pB,eACxB6/E,GAAkBkB,GAAQ/gF,GAC7BlsB,EAAQ8sG,GAAa,SAAUI,GAC9B,GAA6B,mBAAlBluF,EAAEkuF,GAA4B,CACxC,IAAI37E,EAAM,IAAIvS,EAAEkuF,GAChB,GAAI3oF,OAAOw6E,eAAextE,EAAK,CAC9B,IAAIqgC,EAAQ1lC,EAAeqF,GACvB1G,EAAaoiF,EAAKr7C,EAAOrtC,OAAOw6E,aACpC,IAAKl0E,EAAY,CAChB,IAAIw+C,EAAan9C,EAAe0lC,GAChC/mC,EAAaoiF,EAAK5jC,EAAY9kD,OAAOw6E,aAEtCiO,EAAUE,GAAcriF,EAAWzuB,SAMvC,IAeIkxG,EAAe,EAAQ,MAE3B7xG,EAAOC,QAAU,SAAyB+C,GACzC,QAAK6uG,EAAa7uG,KACbstG,GAAoBxnF,OAAOw6E,eAAetgG,EAnB3B,SAA2BA,GAC/C,IAAIuiL,GAAY,EAWhB,OAVAhhL,EAAQgtG,GAAW,SAAUI,EAAQF,GACpC,IAAK8zE,EACJ,IACC,IAAIlkL,EAAOswG,EAAO7vG,KAAKkB,GACnB3B,IAASowG,IACZ8zE,EAAYlkL,GAEZ,MAAO4G,QAGJs9K,EAQA3zE,CAAe5uG,GAD0CsuG,EAAOf,EAAUvtG,GAAQ,GAAI,eC/C9FhD,EAAOC,QACP,SAAS8oH,EAAQv+F,EAAI8f,GACnB,GAAI9f,GAAM8f,EAAI,OAAOy+E,EAAOv+F,EAAPu+F,CAAWz+E,GAEhC,GAAkB,mBAAP9f,EACT,MAAM,IAAI4B,UAAU,yBAMtB,OAJArlB,OAAOC,KAAKwjB,GAAIjmB,SAAQ,SAAUgQ,GAChC8iG,EAAQ9iG,GAAKiW,EAAGjW,MAGX8iG,EAEP,SAASA,IAEP,IADA,IAAIjyG,EAAO,IAAInC,MAAMuD,UAAU3D,QACtB+J,EAAI,EAAGA,EAAIxH,EAAKvC,OAAQ+J,IAC/BxH,EAAKwH,GAAKpG,UAAUoG,GAEtB,IAAIsI,EAAMsV,EAAGjkB,MAAMhF,KAAM6D,GACrBklC,EAAKllC,EAAKA,EAAKvC,OAAO,GAM1B,MALmB,mBAARqS,GAAsBA,IAAQo1B,GACvCvjC,OAAOC,KAAKsjC,GAAI/lC,SAAQ,SAAUgQ,GAChCW,EAAIX,GAAK+1B,EAAG/1B,MAGTW,cC9BXlV,EAAOC,QAIP,WAGI,IAFA,IAAIivB,EAAS,GAEJtiB,EAAI,EAAGA,EAAIpG,UAAU3D,OAAQ+J,IAAK,CACvC,IAAI0kB,EAAS9qB,UAAUoG,GAEvB,IAAK,IAAIhH,KAAO0rB,EACRrvB,EAAeH,KAAKwvB,EAAQ1rB,KAC5BspB,EAAOtpB,GAAO0rB,EAAO1rB,IAKjC,OAAOspB,GAfX,IAAIjtB,EAAiB8E,OAAOvF,UAAUS,2ZCAtC,IAAIujL,EAAgB,CACnB,gBACA,iBACA,eACA,eACA,aACA,aACA,YACA,cACA,cACA,aACA,qBAGGjiK,EAA0B,oBAAf0jD,WAA6B,EAAA1jD,EAAS0jD,WAErDjnE,EAAOC,QAAU,WAEhB,IADA,IAAIoE,EAAM,GACDuI,EAAI,EAAGA,EAAI44K,EAAc3iL,OAAQ+J,IACN,mBAAxB2W,EAAEiiK,EAAc54K,MAC1BvI,EAAIA,EAAIxB,QAAU2iL,EAAc54K,IAGlC,OAAOvI,+BCvBR,IAEIi5D,EAFe,EAAQ,IAEfR,CAAa,qCAAqC,GAC9D,GAAIQ,EACH,IACCA,EAAM,GAAI,UACT,MAAOr1D,GAERq1D,EAAQ,KAIVt9D,EAAOC,QAAUq9D,+pkBCbbmoH,EAA2B,GAG/B,SAASC,EAAoB/sC,GAE5B,IAAIgtC,EAAeF,EAAyB9sC,GAC5C,QAAqBhvI,IAAjBg8K,EACH,OAAOA,EAAa1lL,QAGrB,IAAID,EAASylL,EAAyB9sC,GAAY,CACjD9oI,GAAI8oI,EACJitC,QAAQ,EACR3lL,QAAS,IAUV,OANA4lL,EAAoBltC,GAAU72I,KAAK9B,EAAOC,QAASD,EAAQA,EAAOC,QAASylL,GAG3E1lL,EAAO4lL,QAAS,EAGT5lL,EAAOC,QCvBfylL,EAAoBnmK,EAAKvf,IACxB,IAAI2xG,EAAS3xG,GAAUA,EAAO44I,WAC7B,IAAO54I,EAAiB,QACxB,IAAM,EAEP,OADA0lL,EAAoB7nJ,EAAE8zE,EAAQ,CAAEx9F,EAAGw9F,IAC5BA,GCLR+zE,EAAoB7nJ,EAAI,CAAC59B,EAAS6lL,KACjC,IAAI,IAAIlgL,KAAOkgL,EACXJ,EAAoBrtK,EAAEytK,EAAYlgL,KAAS8/K,EAAoBrtK,EAAEpY,EAAS2F,IAC5EmB,OAAO8nB,eAAe5uB,EAAS2F,EAAK,CAAEkpB,YAAY,EAAMnuB,IAAKmlL,EAAWlgL,MCJ3E8/K,EAAoBniK,EAAI,WACvB,GAA0B,iBAAf0jD,WAAyB,OAAOA,WAC3C,IACC,OAAO1lE,MAAQ,IAAIouB,SAAS,cAAb,GACd,MAAO1nB,GACR,GAAsB,iBAAX2J,OAAqB,OAAOA,QALjB,GCAxB8zK,EAAoBrtK,EAAI,CAAC5S,EAAKW,IAAUW,OAAOvF,UAAUS,eAAeH,KAAK2D,EAAKW,GCClFs/K,EAAoBxzK,EAAKjS,IACH,oBAAX6oB,QAA0BA,OAAOw6E,aAC1Cv8F,OAAO8nB,eAAe5uB,EAAS6oB,OAAOw6E,YAAa,CAAEtgG,MAAO,WAE7D+D,OAAO8nB,eAAe5uB,EAAS,aAAc,CAAE+C,OAAO,KCLvD0iL,EAAoBK,IAAO/lL,IAC1BA,EAAOgmL,MAAQ,GACVhmL,EAAOkF,WAAUlF,EAAOkF,SAAW,IACjClF,gICCR,MAAMimL,EAAY,IAAI1qJ,IAAI,CAAC,MAAO,QAC5B2qJ,EAAW,CAAC,YAAa,QAAS,QAAS,OAAQ,UAAW,UAAW,UAAW,SAAU,QAEpG,SAASC,EAAQznI,EAAO7uC,GACtB,MAAMg6F,EAAKnrD,EAAMg3B,SAAS/3C,MAAK5rB,GAAKA,EAAElC,KAAOA,IAC7C,OAAOg6F,EAAKA,EAAG1nG,UAAOwH,EAGxB,MAAMy8K,UAA2B,EAAA9tI,UAC/B90C,cACEm/B,QACAphC,KAAK8kL,eAAiB,IAAItmL,IAC1BwB,KAAK+kL,cAAgB,EACrB/kL,KAAKglL,wBAA0B,KAC/BhlL,KAAK0L,QAAU,IAAI,KAAkB,CACnCgmE,aAAc,CAAC,mBAAyB,YAAkB,gBAAsB,qBAElF1xE,KAAK0L,QAAQg5B,GAAG,OAAQ1kC,KAAKilL,mBAAmBj7J,KAAKhqB,OAGvDilL,mBAAmB9nI,GAWjB,GATIA,EAAM7uC,KAAO,qBACftO,KAAK+kL,cAAgB5nI,EAAMv8C,KAAO,KAIhCu8C,EAAM7uC,KAAO,gBACftO,KAAKglL,wBAA0B7nI,EAAMv8C,MAGnCu8C,EAAM7uC,KAAO,YAAkB,CACjC,IAAK,MAAM+tG,KAASl/D,EAAMg3B,SAAShvE,QAAOqL,GAAKA,EAAElC,KAAO,kBAAuB,CAE7E,GAA4C,KAAxCs2K,EAAQvoE,EAAO,gBAA+B,SAClD,MAAM6oE,EAAUN,EAAQvoE,EAAO,eAAsB,GAErD,GAAI6oE,EAAQhxE,WAAW,UAAW,CAChC,MAAMptG,EAAQ,CACZgJ,OAAQ80K,EAAQvoE,EAAO,kBACvBV,SAAUipE,EAAQvoE,EAAO,eACzBr0G,KAAMk9K,EAAQ51J,UAAU,GAAGuY,eAEvB/nC,EAAO8kL,EAAQvoE,EAAO,WAExBv8G,IACFgH,EAAMhH,KAAOA,GAGf,MAAMoO,EAAS02K,EAAQvoE,EAAO,mBAE1BnuG,IACFpH,EAAMoH,OAASA,EAAOjC,YAILowG,EAAMloC,SAAS/3C,MAAK5rB,GAAKA,EAAElC,KAAO,uBAA8BkC,EAAE2jE,SAAS/3C,MAAK+oJ,GAAMA,EAAG72K,KAAO,sBAA6B62K,EAAGhxG,SAAS/3C,MAAKgpJ,GAAOA,EAAI92K,KAAO,gCAGjLxH,EAAMu+K,aAAc,GAGtBrlL,KAAK8kL,eAAe5lL,IAAI4H,EAAMgJ,OAAQhJ,IAI1C9G,KAAKylC,KAAK,SAAU/jC,MAAMmM,KAAK7N,KAAK8kL,eAAe34K,WAGrD,GAAIgxC,EAAM7uC,KAAO,gBAAsB,CACrC,MAAMuxC,EAAQ1C,EAAMg3B,SAAS/3C,MAAK5rB,GAAKA,EAAElC,KAAO,aAEhD,GAAIuxC,GAAS7/C,KAAK8kL,eAAehmL,IAAI+gD,EAAM/4C,OAAQ,CACjD,MAAMw+K,EAAgBV,EAAQznI,EAAO,oBAC/Br2C,EAAQ9G,KAAK8kL,eAAe1lL,IAAIygD,EAAM/4C,OAEtCy+K,EAAW,CACf31D,MAFc9oH,EAAMu+K,aAAc,IAAAh2H,aAAYnuD,EAAO2M,KAAKgyC,EAAM6kC,UAAY7kC,EAAM6kC,SAEpEz4E,SAAS,QACvBwC,MAAOoxC,EAAMp+C,MAAQzB,KAAKglL,yBAA2BhlL,KAAK+kL,cAC1DtlH,SAAU6lH,EAAgBtlL,KAAK+kL,eAGjC,GAAIL,EAAU5lL,IAAIgI,EAAMkB,MAAO,CAE7B,MAAMmE,EAASo5K,EAAS31D,KAAKtiH,MAAM,KAEnC,IAAK,IAAIjC,EAAmB,QAAfvE,EAAMkB,KAAiB,EAAI,EAAGqD,EAAI,EAAGA,IAChDk6K,EAASZ,EAASt5K,IAAMc,EAAOd,GAGjCk6K,EAAS31D,KAAOzjH,EAAOvJ,MAAM,GAAGC,KAAK,KAGvC7C,KAAKylC,KAAK,WAAY8/I,EAAU1lI,EAAM/4C,QAKtCq2C,EAAM7uC,KAAO,mBACftO,KAAKylC,KAAK,OAAQ,CAChB6/B,SAAUs/G,EAAQznI,EAAO,eACzBqoI,SAAUZ,EAAQznI,EAAO,mBACzBv8C,KAAMgkL,EAAQznI,EAAO,kBAO7B,MAAMsoI,UAAuBZ,EAC3B5iL,cACEm/B,QACAphC,KAAK0L,QAAQg5B,GAAG,QAAQyY,IAClBA,EAAM7uC,KAAO,aAEkB,IAA7BtO,KAAK8kL,eAAelmL,MAAYoB,KAAK0N,SAK/C8+B,OAAO2Q,EAAO1+B,EAAGqiB,GACf9gC,KAAK0L,QAAQzI,MAAMk6C,GACnBrc,EAAS,KAAMqc,IAKnB,MAAMuoI,UAAuBb,EAC3B5iL,YAAY0jL,GACVvkJ,QAEIukJ,aAAwBd,IAC1Bc,EAAanhJ,KAAK,SAAS,IAAMmhJ,EAAaj4K,QAE9C1N,KAAK8kL,eAAiBa,EAAab,eACnC9kL,KAAK+kL,cAAgBY,EAAaZ,cAElC/kL,KAAK4lL,UAAW,GAKpBvuI,WAAW8F,EAAO1+B,EAAGqiB,GACnB,GAAI9gC,KAAK4lL,UAEP,IAAK,IAAIv6K,EAAI,EAAGA,EAAI8xC,EAAM77C,OAAS,GAAI+J,IAErC,GAAiB,KAAb8xC,EAAM9xC,IAAgC,KAAjB8xC,EAAM9xC,EAAI,IAAgC,MAAjB8xC,EAAM9xC,EAAI,IAAgC,MAAjB8xC,EAAM9xC,EAAI,IAIxD,MAAvB8xC,EAAM9xC,EAAI,GAFF,EAAIyF,KAAK6gB,MAAM7gB,KAAKw0E,KAAKnoC,EAAM9xC,EAAI,OAEd,CAE/BrL,KAAK4lL,UAAW,EAChB5lL,KAAK6lL,aAAa1oI,EAAMv6C,MAAMyI,IAC9B,YAKNrL,KAAK6lL,aAAa1oI,GAGpBrc,EAAS,KAAMqc,GAGjB0oI,aAAa1oI,GAEX,IACEn9C,KAAK0L,QAAQzI,MAAMk6C,GACnB,MAAOpzC,GACPggB,EAAQH,KAAK,qDC7KnB,SAASujF,EAAiB7kE,GACtB,OAAO,IAAI9c,SAAQ,CAACC,EAAS+c,KAEzBF,EAAQw9I,WAAax9I,EAAQy9I,UAAY,IAAMt6J,EAAQ6c,EAAQpiC,QAE/DoiC,EAAQ09I,QAAU19I,EAAQ0hB,QAAU,IAAMxhB,EAAOF,EAAQ/mC,UAGjE,SAAS0kL,EAAYC,EAAQ/3E,GACzB,MAAMg4E,ICJUrmH,UAAUsmH,eACtB,WAAW/+K,KAAKy4D,UAAU7vB,aACzB,iBAAiB5oC,KAAKy4D,UAAU7vB,YAEnBq9D,UAAU+4E,UAGrB,IAAI76J,SAAQ,SAAUC,GACzB,IAAI66J,EAAS,WAAc,OAAOh5E,UAAU+4E,YAAYE,QAAQ96J,IAChE+6J,EAAavhJ,YAAYqhJ,EAAQ,KACjCA,OACDC,SAAQ,WAAc,OAAOvhJ,cAAcwhJ,MANnCh7J,QAAQC,WDDKL,MAAK,KACzB,MAAMkd,EAAUglE,UAAUC,KAAK24E,GAE/B,OADA59I,EAAQm+I,gBAAkB,IAAMn+I,EAAQpiC,OAAO6kG,kBAAkBoD,GAC1DhB,EAAiB7kE,MCRhC,IAOQk+I,EDGJ,MAAO,CAACE,EAAQ5lJ,IAAaqlJ,EAAI/6J,MAAM0/E,GAAOhqE,EAASgqE,EAAGsB,YAAY+B,EAAWu4E,GAAQ16E,YAAYmC,MAEzG,IAAIw4E,EACJ,SAASC,IAIL,OAHKD,IACDA,EAAsBV,EAAY,eAAgB,WAE/CU,EAkBX,SAASznL,EAAImF,EAAK5C,EAAOolL,EAAcD,KACnC,OAAOC,EAAY,aAAc/rH,IAC7BA,EAAMG,IAAIx5D,EAAO4C,GACV8oG,EAAiBryC,EAAMsxC,gBAuDtC,SAAS06E,EAAIziL,EAAKwiL,EAAcD,KAC5B,OAAOC,EAAY,aAAc/rH,IAC7BA,EAAM7hC,OAAO50B,GACN8oG,EAAiBryC,EAAMsxC,gBEhGtC,MAAM26E,EAAWd,EAAY,kBAAmB,YFsKhD,SAAiBY,EAAcD,KAC3B,OAAOC,EAAY,YAAa/rH,IAG5B,GAAIA,EAAMksH,QAAUlsH,EAAMmsH,WACtB,OAAOz7J,QAAQ4iF,IAAI,CACfjB,EAAiBryC,EAAMmsH,cACvB95E,EAAiBryC,EAAMksH,YACxB57J,MAAK,EAAE3lB,EAAM0G,KAAY1G,EAAK7D,KAAI,CAACyC,EAAKgH,IAAM,CAAChH,EAAK8H,EAAOd,QAElE,MAAMshJ,EAAQ,GACd,OAAOk6B,EAAY,YAAa/rH,GAvDxC,SAAoBA,EAAOh6B,GAOvB,OANAg6B,EAAMosH,aAAanB,UAAY,WACtB/lL,KAAKkG,SAEV46B,EAAS9gC,KAAKkG,QACdlG,KAAKkG,OAAOqmG,aAETY,EAAiBryC,EAAMsxC,aAgDgB+6E,CAAWrsH,GAAQssH,GAAWz6B,EAAM5nJ,KAAK,CAACqiL,EAAO/iL,IAAK+iL,EAAO3lL,UAAS2pB,MAAK,IAAMuhI,UEhLnIxwC,CAAQ4qE,GAAU37J,MAAK+wF,IACrB,IAAK,MAAOr8G,EAAMunL,KAAYlrE,EAC5BkrE,EAAQC,YAAYxnL,EAAM,CAAEynL,WAAW,IACvCT,EAAIhnL,EAAMinL,MAGC,MAAMS,EACnBvlL,YAAa84D,EAAa97B,EAAO,IAG/B,GAFAj/B,KAAK+6D,YAAc57D,OAAO47D,IAErB/6D,KAAK+6D,YACR,MAAM,IAAI97D,MAAM,yCAelB,GAZAe,KAAKwqG,QAAS,EAEdxqG,KAAKF,KAAOm/B,EAAKn/B,MAAQ,UAEzBE,KAAKynL,eAAiBxoJ,EAAKooJ,SAAWvnH,UAAUoJ,QAAQw+G,eACxD1nL,KAAK2nL,kBAAoB3nL,KAAK4nL,6BAC9B5nL,KAAK6nL,iBAAqB5oJ,EAAKsW,OAAStW,EAAKooJ,SAAYrnL,KAAK8nL,uBAA0B9nL,KAAK2nL,kBAE7F3nL,KAAK83G,OAAS,GACd93G,KAAK+nL,SAAW,GAChB/nL,KAAKgoL,aAAe,GAEhB/oJ,EAAKsW,OAAStW,EAAKooJ,SA6CrB,GA5CArnL,KAAKu1C,MAAQtW,EAAKsW,MAAM3yC,MAAM,GAAGhB,KAAI,CAACijE,EAAMx5D,EAAGkqC,KAC7C,GAAiB,MAAbsvB,EAAK99D,KAAc,MAAM,IAAI9H,MAAM,mCACvC,GAAmB,MAAf4lE,EAAKvjE,OAAgB,MAAM,IAAIrC,MAAM,qCACzC,GAAmB,MAAf4lE,EAAKxjE,OACP,GAAU,IAANgK,EACFw5D,EAAKxjE,OAAS,MACT,CACL,MAAM4mL,EAAW1yI,EAAMlqC,EAAI,GAC3Bw5D,EAAKxjE,OAAS4mL,EAAS5mL,OAAS4mL,EAAS3mL,OAK1B,MAAfujE,EAAKqjH,SACPrjH,EAAKqjH,OAASloL,KAAKmoL,kBAAkB,CAAEphL,KAAM89D,EAAK99D,QAIpD,MAAMqhL,EAAYvjH,EAAKxjE,OACjBqiL,EAAU7+G,EAAKxjE,OAASwjE,EAAKvjE,OAE7Bi9G,EAAaztG,KAAK6gB,MAAMy2J,EAAYpoL,KAAK+6D,aACzCstH,EAAYv3K,KAAK6gB,OAAO+xJ,EAAU,GAAK1jL,KAAK+6D,aAElD,IAAK,IAAIvrD,EAAI+uG,EAAY/uG,GAAK64K,IAAa74K,EAAG,CAC5C,MAAM84K,EAAa94K,EAAIxP,KAAK+6D,YAGtBltD,EAAQu6K,EAAYE,EAAc,EAAIF,EAAYE,EAClD7vF,EAAMirF,EAHK4E,EAAatoL,KAAK+6D,YAGD/6D,KAAK+6D,YAAc2oH,EAAU4E,EACzDjnL,EAAU+mL,EAAYE,EAAc,EAAIA,EAAaF,EAEtDpoL,KAAK+nL,SAASv4K,KAAIxP,KAAK+nL,SAASv4K,GAAK,IAE1CxP,KAAK+nL,SAASv4K,GAAGzK,KAAK,CAAE8I,KAAAA,EAAM4qF,GAAAA,EAAIp3F,OAAAA,EAAQwjE,KAAAA,IAG5C,OAAOA,KAITx0D,OAAOsmC,iBAAiB,WAAY32C,KAAK+mE,SAEzC/mE,KAAKsB,OAAStB,KAAKu1C,MAAMnX,QAAO,CAACrC,EAAK8oC,IAAS9oC,EAAM8oC,EAAKvjE,QAAQ,GAC/C,MAAf29B,EAAK39B,QAAkB29B,EAAK39B,SAAWtB,KAAKsB,OAC9C,MAAM,IAAIrC,MAAM,sEAGlBe,KAAKsB,OAASnC,OAAO8/B,EAAK39B,SAAW+uB,EAAAA,EAGnCrwB,KAAKsB,SAAW+uB,EAAAA,IAClBrwB,KAAKyqG,gBAAkBzqG,KAAKsB,OAAStB,KAAK+6D,aAAe/6D,KAAK+6D,YAC9D/6D,KAAK0qG,eAAiB55F,KAAKS,KAAKvR,KAAKsB,OAAStB,KAAK+6D,aAAe,GAItE1S,4BACE,MAAMkgI,QAAmBvoL,KAAK2nL,kBAC9B,aAAaY,EAAWC,mBAAmB,SAAU,CAAEh6J,QAAQ,IAGjE65B,mCACE,MAAMg/H,QAAgBrnL,KAAKynL,eAC3B,aAAaJ,EAAQmB,mBAAmBxoL,KAAKF,KAAM,CAAE0uB,QAAQ,IAG/D65B,gBAAiBz+C,GACf,IAAIuzC,EAAQn9C,KAAK83G,OAAOluG,GAExB,IAAKuzC,EAAO,CACV,MAAMsrI,EAAW7+K,EAAMqC,WACjBs8K,QAAmBvoL,KAAK6nL,iBAE9B1qI,EAAQn9C,KAAK83G,OAAOluG,GAAS,CAAE8+K,kBAAmBH,EAAWI,cAAcF,EAAU,CAAEj6J,QAAQ,KAGjG,OAAO2uB,EAGTkL,wBAAyBppB,GACvB,MAAMwpJ,EAAWxpJ,EAAKl4B,KAAKnE,MAAMq8B,EAAKl4B,KAAK+rD,YAAY,KAAO,GAC9D,aAAc9yD,KAAK4oL,oBAAoB3pJ,IAAO0pJ,cAAcF,EAAU,CAAEj6J,QAAQ,IAIlF65B,0BAA2BppB,GACzB,MAAMs/B,EAAYt/B,EAAKl4B,KAAK+rD,YAAY,KACxC,IAAmB,IAAfyL,GAAkC,IAAdA,EAAiB,OAAOv+D,KAAK2nL,kBACrD,MAAM5gL,EAAOk4B,EAAKl4B,KAAOk4B,EAAKl4B,KAAKnE,MAAM,EAAG27D,GAC5C,IAAKv+D,KAAKgoL,aAAajhL,GAAO,CAC5B,MAAMvD,EAASxD,KAAK4oL,oBAAoB3pJ,GACxCj/B,KAAKgoL,aAAajhL,UAAevD,GAAQglL,mBAAmBzhL,EAAKnE,MAAMmE,EAAK+rD,YAAY,KAAO,GAAI,CAAEtkC,QAAQ,IAE/G,OAAOxuB,KAAKgoL,aAAajhL,GAG3Bk0D,IAAKrxD,EAAOoB,EAAK+9B,EAAK,UACpB,GAAI/oC,KAAKwqG,OAEP,YADAz7D,gBAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAIpC,MAAMisG,EAActhG,IAAU5J,KAAK0qG,eACnC,GAAIQ,GAAelgG,EAAI1J,SAAWtB,KAAKyqG,gBACrC17D,gBAAe,KACbhG,EAAG,IAAI9pC,MAAM,6BAA6Be,KAAKyqG,4BAInD,GAAKS,GAAelgG,EAAI1J,SAAWtB,KAAK+6D,aAwBxC,GAjBC,WACC,IACE,MAAM5d,QAAcn9C,KAAK6oL,UAAUj/K,GAC7Bk/K,QAAmB3rI,EAAMurI,kBACzB7oJ,QAAeipJ,EAAWC,eAAe,CAC7CC,kBAAkB,UAEdnpJ,EAAO58B,MAAM+H,SACb60B,EAAO+nB,QACb,MAAO79C,GAEP,YADAg/B,EAAGh/B,GAIA/J,KAAKu1C,OAAOxM,EAAG,OAdrB,GAiBG/oC,KAAKu1C,MAAO,CACd,MAAM0zI,EAAUjpL,KAAK+nL,SAASn+K,GACzBq/K,GACHl6I,gBAAe,IAAMhG,EAAG,IAAI9pC,MAAM,0CAEpC,MAAMiqL,EAAWD,EAAQrnL,KAAI+rB,GACpB,WACL,IACE,MAAM,KAAEk3C,GAASl3C,EACZk3C,EAAKhlC,SACRglC,EAAKhlC,cAAgBglC,EAAKqjH,QAAQa,eAAe,CAC/CC,kBAAkB,KAGtB,MAAMnpJ,QAAeglC,EAAKhlC,OAE1B,aADMA,EAAO58B,MAAM,CAAE+E,KAAM,QAAS4wB,SAAUjL,EAAOtsB,OAAQT,KAAMoK,EAAIpI,MAAM+qB,EAAO9f,KAAM8f,EAAO8qE,MAC1F,KACP,MAAO1uF,GACP,OAAOg/B,EAAGh/B,KAZP,KAgBTyhB,QAAQ4iF,IAAI86E,GAAU99J,MAAK,IAAM2d,EAAG,cA7CpCgG,gBAAe,KACbhG,EAAG,IAAI9pC,MAAM,wBAAwBe,KAAK+6D,mBAgDhD37D,IAAKwK,EAAOq1B,EAAM8J,EAAK,UACrB,GAAoB,mBAAT9J,EACT,OAAOj/B,KAAKZ,IAAIwK,EAAO,KAAMq1B,GAE/B,GAAIj/B,KAAKwqG,OAEP,YADAz7D,gBAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAIpC,MACM87D,EADcnxD,IAAU5J,KAAK0qG,eACD1qG,KAAKyqG,gBAAkBzqG,KAAK+6D,YAEzD97B,IAAMA,EAAO,IAElB,MAAMkqJ,EAAYlqJ,EAAK59B,QAAU,EAC3B+nL,EAAUnqJ,EAAK39B,OAAS6nL,EAAYlqJ,EAAK39B,OAASy5D,EAClD3vD,EAAM6zB,EAAK39B,QAAUy5D,EAAcouH,EAEzC,IAAKnpL,KAAKu1C,OAASv1C,KAAK83G,OAAOluG,GAC5B,WACC,IAAIoB,EACJ,IACE,MAAMmyC,QAAcn9C,KAAK6oL,UAAUj/K,GAC7Bk/K,QAAmB3rI,EAAMurI,kBAC/B,IAAI7jH,QAAaikH,EAAWO,UACV,IAAdF,GAAmB/9K,IAAQ2vD,IAC7B8J,EAAOA,EAAKjiE,MAAMumL,EAAW/9K,EAAM+9K,IAErCn+K,QAAY65D,EAAKk1E,cACjB,MAAOhwI,GAEP,YADAg/B,EAAGh/B,GAIL,GAAuB,IAAnBiB,EAAIjJ,WAAkB,CACxB,MAAMgI,EAAM,IAAI9K,MAAM,SAAS2K,oBAG/B,OAFAG,EAAIqhG,UAAW,OACfriE,EAAGh/B,GAILg/B,EAAG,KAAM,IAAIpR,WAAW3sB,KAtBzB,OAwBI,CACL,IAAIi+K,EAAUjpL,KAAK+nL,SAASn+K,GAY5B,GAXKq/K,GACHl6I,gBAAe,IAAMhG,EAAG,IAAI9pC,MAAM,0CAEhCggC,IACFgqJ,EAAUA,EAAQ9jL,QAAOwoB,GAChBA,EAAO8qE,GAAK0wF,GAAax7J,EAAO9f,KAAOu7K,IAEzB,IAAnBH,EAAQ3nL,QACVytC,gBAAe,IAAMhG,EAAG,IAAI9pC,MAAM,2CAGlCkqL,IAAcC,EAAS,OAAOr6I,gBAAe,IAAMhG,EAAG,KAAM,IAAIpR,WAAW,MAE/E,MAAMuxJ,EAAWD,EAAQrnL,KAAI+rB,GACpB,WACL,IAAI9f,EAAO8f,EAAO9f,KACd4qF,EAAK9qE,EAAO8qE,GACZp3F,EAASssB,EAAOtsB,OAEhB49B,IACEw5D,EAAK2wF,IAAS3wF,EAAK2wF,GACnBv7K,EAAOs7K,IACT9nL,GAAW8nL,EAAYt7K,EACvBA,EAAOs7K,IAGX,IACE,MAAMjB,QAAev6J,EAAOk3C,KAAKqjH,OAC3BrjH,SAAcqjH,EAAOmB,WAAWzmL,MAAMvB,EAAQA,EAASo3F,EAAK5qF,GAClE,aAAag3D,EAAKk1E,cAClB,MAAOhwI,GACP,OAAOA,IAjBJ,KAqBTyhB,QAAQ4iF,IAAI86E,GAAU99J,MAAKjf,IACH,IAAlBA,EAAO7K,OACTynC,EAAG,KAAM,IAAIpR,WAAWxrB,EAAO,KAE/B,IAAIqqC,KAAKrqC,GAAQ4tI,cAAc3uH,MAAKpgB,IAClC+9B,EAAG,KAAM,IAAIpR,WAAW3sB,WAOlCq9C,YAAatf,EAAK,SAAUi9G,GACtBhmJ,KAAKwqG,OACPz7D,gBAAe,IAAMhG,EAAG,IAAI9pC,MAAM,yBAIpCe,KAAKwqG,QAAS,EACdxqG,KAAK+nL,SAAW,GAChB/nL,KAAKgoL,aAAe,SACdhoL,KAAK+mE,QAAQi/E,GACnBj3G,gBAAe,KACbhG,EAAG,UAIPsf,cAAe29F,GAEb,GADAhmJ,KAAK83G,OAAS,GACV93G,KAAKu1C,MAAO,CACd,MAAM2zI,EAAW,GACjB,IAAK,MAAMrkH,KAAQ7kE,KAAKu1C,MAClBsvB,EAAKhlC,SACPqpJ,EAASnkL,iBAAkB8/D,EAAKhlC,QAAQ+nB,SACxCid,EAAKhlC,OAAS,MAGlB,IAAmB,IAAfmmH,EAAqB,CACvB,MAAMuiC,QAAmBvoL,KAAK2nL,kBAC9BzoL,EAAI,SAAUqpL,EAAYxB,SACpBwB,EAAWjB,YAAY,SAAU,CAAEC,WAAW,IACpDT,EAAI,SAAUC,SAEVv7J,QAAQ4iF,IAAI86E,IAItB7gI,cAAetf,EAAK,UAClB,GAAI/oC,KAAKwqG,OAEP,YADAz7D,gBAAe,IAAMhG,EAAG,IAAI9pC,MAAM,wBAGpC,MAAMooL,QAAgBrnL,KAAKynL,eAC3BvoL,EAAIc,KAAKF,KAAMunL,EAASN,GAaxB/mL,KAAK4nD,OAXeS,UAClB,UACQg/H,EAAQC,YAAYtnL,KAAKF,KAAM,CAAEynL,WAAW,IAClDT,EAAI9mL,KAAKF,KAAMinL,GACf,MAAOh9K,GAEP,YADAg/B,EAAGh/B,GAGLg/B,EAAG,SAGmB,sCC9U5B,MAAMugJ,IAAaj5K,OAAOk5K,OAEX,MAAMC,EACnBvnL,YAAa84D,EAAa97B,EAAO,IAE/B,GADAj/B,KAAK+6D,YAAc57D,OAAO47D,IACrB/6D,KAAK+6D,YAAa,MAAM,IAAI97D,MAAM,yCAEvCe,KAAKsB,OAASnC,OAAO8/B,EAAK39B,SAAW+uB,EAAAA,EAErCrwB,KAAKypL,cAAgB,KACrBzpL,KAAK0pL,WAAa,KAClB1pL,KAAK2pL,OAAS,GACd3pL,KAAK83G,OAAS,GAKd,MAAM8xE,EAAY,CAACC,EAAaC,KAC9B,MAAMC,EAAU9qJ,EAChB,GAAI6qJ,GAAgBA,EAAe9pL,KAAKsB,OAAQ,CAC9CtB,KAAK0pL,WAAa54K,KAAK6gB,MAAMm4J,EAAe9pL,KAAK+6D,aACjD,MAAMivH,EAAYhqL,KAAK0pL,WAAa1pL,KAAK+6D,YACzCgvH,EAAQzoL,OAAStB,KAAKsB,OAAS0oL,EAE/BhqL,KAAKypL,cAAgB,IAAI,EAAiBzpL,KAAK+6D,YAAagvH,GAC5D/pL,KAAK2pL,OAAO5kL,KAAK/E,KAAKypL,eACtBM,EAAQzoL,OAAS0oL,EAEnB,MAAMlvH,EAAQ,IAAI,EAAgB,IAAI+uH,EAAY7pL,KAAK+6D,YAAagvH,GAAU,CAAEh5K,IAAKkuB,EAAKluB,KAAO,KACjG/Q,KAAK2pL,OAAO5kL,KAAK+1D,GACb96D,KAAK0pL,YACP1pL,KAAK83G,OAAO93G,KAAK0pL,WAAa,GAAK5uH,EACnC96D,KAAK83G,OAAOjzD,KAAKiW,IAEjB96D,KAAKypL,cAAgB3uH,GAGzB96D,KAAKiqL,aAAenqH,UAAUoJ,QAAQghH,WAAW9+J,MAAK8+J,IAEpD,MAAM72H,EAAY62H,EAASC,MAAQD,EAASE,MAAQt5K,KAAKC,IAAI5R,OAAO8/B,EAAK8I,WAAa,EAAG,WAEpE,IAAjB9I,EAAKorJ,SAAoBh3H,GAAa,GACxCrzD,KAAKypL,cAAgB,IAAI,EAAiBzpL,KAAK+6D,YAAa97B,GAC5Dj/B,KAAK2pL,OAAO5kL,KAAK/E,KAAKypL,eACtBzpL,KAAK0pL,WAAa,GAEd,iBAAkB5pH,UAAUoJ,QAG9B0gH,EAAU,GAAsB3qJ,EAAY,SAAKo0B,GAKjDu2H,EAAU,IAAiBN,GAA+B,aAAnBY,EAASC,QAAyB92H,MAMjFj0D,IAAKwK,EAAOq1B,EAAM8J,GAChB/oC,KAAKiqL,aAAa7+J,MAAK,KAChBprB,KAAK83G,OAAOluG,GAGf5J,KAAK83G,OAAOluG,GAAOxK,IAAIwK,EAAOq1B,EAAM8J,GAFpC/oC,KAAKypL,cAAcrqL,IAAIwK,EAAQ5J,KAAK0pL,WAAYzqJ,EAAM8J,MAO5DkyB,IAAKrxD,EAAOoB,EAAK+9B,GACf/oC,KAAKiqL,aAAa7+J,MAAK,KAChBprB,KAAK83G,OAAOluG,GAGf5J,KAAK83G,OAAOluG,GAAOqxD,IAAIrxD,EAAOoB,EAAK+9B,GAFnC/oC,KAAKypL,cAAcxuH,IAAIrxD,EAAQ5J,KAAK0pL,WAAY1+K,EAAK+9B,MAO3D6e,MAAO7e,EAAK,UACV,MAAMmgJ,EAAW,GACjB,IAAK,MAAMpuH,KAAS96D,KAAK2pL,OACvBT,EAASnkL,KAAK,IAAIymB,SAAQC,GAAWqvC,EAAMlT,MAAMn8B,MAEnDD,QAAQ4iF,IAAI86E,GAAU99J,MAAKjf,IACzBA,EAASA,EAAOhH,QAAO1D,GAASA,IAChCsnC,EAAG58B,EAAO7K,OAAS,EAAI6K,EAASA,EAAO,OAI3Cq5B,QAASuD,EAAK,UACZ,MAAMmgJ,EAAW,GACjB,IAAK,MAAMpuH,KAAS96D,KAAK2pL,OACvBT,EAASnkL,KAAK,IAAIymB,SAAQC,GAAWqvC,EAAMt1B,QAAQ/Z,MAErDD,QAAQ4iF,IAAI86E,GAAU99J,MAAKjf,IACzBA,EAASA,EAAOhH,QAAO1D,GAASA,IAChCsnC,EAAG58B,EAAO7K,OAAS,EAAI6K,EAASA,EAAO,sBCjG9B,MAAMm+K,EACnBroL,YAAapB,EAAU,IACrB,GAAKwP,OAAO8sI,QAiHZ,GA5GAn9I,KAAKuqL,OAAS1pL,EAAQ0pL,OAGtBvqL,KAAKwqL,WAAa3pL,EAAQ2pL,YAAc,YAChB,UAApBxqL,KAAKwqL,YAA8C,WAApBxqL,KAAKwqL,aACL,oBAAtBC,kBACTzqL,KAAKwqL,WAAa,SACkB,oBAApBE,kBAChB1qL,KAAKwqL,WAAa,cAKtBxqL,KAAK2qL,UAAY9pL,EAAQ8pL,WAAa,OACtC3qL,KAAK4qL,iBAAmB/pL,EAAQ+pL,kBAAoB,KACpD5qL,KAAK6qL,gBAAkBhqL,EAAQgqL,iBAAmB,KAClD7qL,KAAK8qL,gBAAkBjqL,EAAQiqL,iBAAmB,KAClD9qL,KAAK+qL,gBAAkBlqL,EAAQkqL,iBAAmB,GAElD/qL,KAAKgrL,MAAQnqL,EAAQmqL,MACrBhrL,KAAKirL,aAAe,KACpBjrL,KAAKkrL,aAAerqL,EAAQ0zK,QAC5Bv0K,KAAKmrL,aAAetqL,EAAQm1C,QAC5Bh2C,KAAKy/B,QAAU5+B,EAAQ4+B,MACvBz/B,KAAKorL,eAAiB,EAEtBprL,KAAKqrL,WAAaxqL,EAAQwqL,YAAc,EAExCrrL,KAAKsrL,cAAgB,GAErBtrL,KAAKurL,YAA2C,MAA5B1qL,EAAQ0qL,aAAe,GAAY,KAAO,GAC9DvrL,KAAKwrL,aAAe,CAClBC,WAAY,KACZC,WAAW,EACXC,UAAW,EACXC,iBAAiB,EACjBC,sBAAuB,EACvBC,UAAW,KACXC,WAAY,MAGd/rL,KAAKgsL,gBAAkB,KACvBhsL,KAAKisL,cAAe,EACpBjsL,KAAKksL,QAAU,EACflsL,KAAKisL,cAAe,EAGfjsL,KAAKo7I,SACRp7I,KAAKo7I,OAAS,IAAI+B,OAAOt8I,EAAQk8I,WAAa,+BAC9C/8I,KAAKo7I,OAAOP,UAAY9pG,GAAS/wC,KAAKmsL,gBAAgBp7I,GACtD/wC,KAAKo7I,OAAOpxF,QAAUjZ,GAAS/wC,KAAKosL,YAAYr7I,IAGlD/wC,KAAKqsL,eACLrsL,KAAKssL,SAASzrL,EAAQmqL,OACtBhrL,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,cACR9Y,MAAO7U,KAAKuqL,OAAO11K,MACnB6nG,OAAQ18G,KAAKuqL,OAAO7tE,OACpBxoE,IAAKw1B,SAASx1B,IACdq4I,cAAe1rL,EAAQk8I,WAAa,8BACpCyvC,SAAS,EACThC,WAAYxqL,KAAKwqL,WACjBiC,OAAQ5rL,EAAQ4rL,OAChBC,WAAY7rL,EAAQ6rL,YAAc,KAClCC,aAAc9rL,EAAQ8rL,cAAgB,KACtCC,gBAAiB/rL,EAAQ+rL,kBAAmB,EAC5CC,MAAOhsL,EAAQgsL,OAAS,GACxBC,eAAgBjsL,EAAQisL,gBAAkB,GAC1CrtJ,MAAOz/B,KAAKy/B,MACZkrJ,UAAW3qL,KAAK2qL,UAChBoC,kBAAmBlsL,EAAQksL,mBAAqB,EAChDC,iBAAkBnsL,EAAQmsL,kBAAoB,EAC9CC,eAAgBjtL,KAAKurL,YAAc,EACnC2B,oBAAqBrsL,EAAQqsL,oBAEP,cAApBltL,KAAKwqL,YAA4BxqL,KAAKmtL,sBAC1CntL,KAAKotL,UAAW,EAGf,MACC,GAA+C,mBAApCC,UAAUptL,UAAUgC,YAC7B,IAGE,OAAO,IAAIorL,UAAU,IAAIptF,kBAAkB,CAAC,EAAG,EAAG,EAAG,IAAK,EAAG,GAC7D,MAAOv5F,GACP,EAAQmrB,IAAI,0EAIhB,MACMjO,EADS8lD,SAASstC,cAAc,UACnBs2E,WAAW,MAE9Bj9K,OAAOg9K,UAAY,KACjB,IACIzsL,EADAyK,EAAI,EAEJpG,UAAU,aAAcg7F,oBAAmBr/F,EAAOqE,UAAUoG,MAChE,MAAMwJ,EAAQ5P,UAAUoG,KAClBqxG,EAASz3G,UAAUoG,GAEnBkiL,EAAY3pK,EAAI4pK,gBAAgB34K,EAAO6nG,GAE7C,OADI97G,GAAM2sL,EAAU3sL,KAAK1B,IAAI0B,GACtB2sL,IAvBV,GA4BuB,cAApBvtL,KAAKwqL,WAA4B,CACnCxqL,KAAK4jB,IAAM5jB,KAAKuqL,OAAO+C,WAAW,MAClCttL,KAAKytL,aAAe/jH,SAASstC,cAAc,UAC3Ch3G,KAAK0tL,gBAAkB1tL,KAAKytL,aAAaH,WAAW,MAIpDttL,KAAKytL,aAAa54K,MAAQ,EAC1B7U,KAAKytL,aAAa/wE,OAAS,EAC3B,MAAMixE,EAAU,IAAI1tF,kBAAkB,CAAC,EAAG,IAAK,EAAG,IAC5C2tF,EAAY,IAAIP,UAAUM,EAAS,EAAG,GAC5C3tL,KAAK0tL,gBAAgBG,UAAU,EAAG,EAAG,EAAG,GACxC7tL,KAAK4jB,IAAIiqK,UAAU,EAAG,EAAG,EAAG,GAC5B,MAAMC,EAAS9tL,KAAK4jB,IAAImqK,aAAa,EAAG,EAAG,EAAG,GAAGntL,KACjDZ,KAAK0tL,gBAAgBM,aAAaJ,EAAW,EAAG,GAChD5tL,KAAK4jB,IAAIqqK,UAAUjuL,KAAKytL,aAAc,EAAG,GACzC,MAAMS,EAAUluL,KAAK4jB,IAAImqK,aAAa,EAAG,EAAG,EAAG,GAAGntL,KAClDZ,KAAKmuL,YAAcL,EAAO,KAAOI,EAAQ,GACrCluL,KAAKmuL,aAAa,EAAQt8J,IAAI,sFAlIlC7xB,KAAKosL,YAAY,wBAsIrBA,YAAa7qL,GAGX,GAFA,EAAQA,MAAM,iBAAkBA,GAC5BvB,KAAKmrL,cAAcnrL,KAAKmrL,aAAa5pL,IACpCvB,KAAKy/B,MAER,MADAz/B,KAAKwlC,UACC,IAAIvmC,MAAM,iBAAmBsC,GAIvC4rL,sBACE,MAAMiB,EAAgBpuL,KAAKuqL,OAAO8D,6BAClCruL,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,kBACR48J,OAAQ6D,GACP,CAACA,IAGN/B,eACMrsL,KAAKgrL,OACPhrL,KAAKuqL,OAAS7gH,SAASstC,cAAc,UACrCh3G,KAAKuqL,OAAO+D,UAAY,2BACxBtuL,KAAKuqL,OAAO3gH,MAAM2kH,QAAU,OAE5BvuL,KAAKirL,aAAevhH,SAASstC,cAAc,OAC3Ch3G,KAAKirL,aAAaqD,UAAY,kCAC9BtuL,KAAKirL,aAAaz3C,YAAYxzI,KAAKuqL,QAE/BvqL,KAAKgrL,MAAMwD,YACbxuL,KAAKgrL,MAAMyD,WAAWC,aAAa1uL,KAAKirL,aAAcjrL,KAAKgrL,MAAMwD,aAEjExuL,KAAKgrL,MAAMyD,WAAWj7C,YAAYxzI,KAAKirL,eAGpCjrL,KAAKuqL,QACRvqL,KAAKosL,YAAY,2EAKvBE,SAAUtB,GAER,GADAhrL,KAAKgrL,MAAQA,EACThrL,KAAKgrL,MAAO,CACd,IAAIvnL,EAAQzD,KAAKgrL,MAAMrhD,OACvB,MAAMglD,EAAaC,IACF,MAAXA,IAAiBnrL,EAAQmrL,GAC7B5uL,KAAK6uL,eAAe7uL,KAAKgrL,MAAMrhD,QAAUlmI,EAAOunL,EAAMtzE,YAAc13G,KAAKqrL,aAE3ErrL,KAAKgrL,MAAMr0I,iBAAiB,cAAc,IAAMg4I,MAAc,GAC9D3uL,KAAKgrL,MAAMr0I,iBAAiB,YAAY,IAAMg4I,MAAc,GAE5D3uL,KAAKgrL,MAAMr0I,iBAAiB,WAAW,IAAMg4I,GAAW,KAAO,GAC/D3uL,KAAKgrL,MAAMr0I,iBAAiB,SAAS,IAAMg4I,GAAW,KAAO,GAC7D3uL,KAAKgrL,MAAMr0I,iBAAiB,WAAW,IAAMg4I,GAAW,KAAO,GAE/D3uL,KAAKgrL,MAAMr0I,iBAAiB,WAAW,IAAMg4I,GAAW,KAAQ,GAEhE3uL,KAAKgrL,MAAMr0I,iBAAiB,UAAU,KACpCg4I,GAAW,GACP3uL,KAAKurL,YAAc,GACrBvrL,KAAK8uL,mBAAmB9uL,KAAKgrL,MAAMtzE,YAAc13G,KAAKqrL,YAAY,MAEnE,GAEHrrL,KAAKgrL,MAAMr0I,iBAAiB,aAAc32C,KAAK+vJ,QAAQ/lI,KAAKhqB,OAAO,GAGrC,oBAAnB+uL,iBACT/uL,KAAK4d,GAAK,IAAImxK,eAAe/uL,KAAKgvL,OAAOhlK,KAAKhqB,KAAM,EAAG,EAAG,EAAG,IAC7DA,KAAK4d,GAAGqxK,QAAQjvL,KAAKgrL,QAGnBhrL,KAAKgrL,MAAMkE,WAAa,EAC1BlvL,KAAKgvL,SAELhvL,KAAKgrL,MAAMr0I,iBAAiB,iBAAkB32C,KAAKgvL,OAAOhlK,KAAKhqB,KAAM,EAAG,EAAG,EAAG,IAAI,IAKxFmvL,mBACE,MAAMC,EAAapvL,KAAKgrL,MAAMkE,WAAalvL,KAAKgrL,MAAMqE,aAChD,YAAEC,EAAW,aAAEC,GAAiBvvL,KAAKgrL,MAE3C,IAAIn2K,EAAQy6K,EACR5yE,EAAS6yE,EAUb,OAZqBD,EAAcC,EAGhBH,EACjBv6K,EAAQ/D,KAAK6gB,MAAM49J,EAAeH,GAElC1yE,EAAS5rG,KAAK6gB,MAAM29J,EAAcF,GAM7B,CAAEv6K,MAAAA,EAAO6nG,OAAAA,EAAQxgG,GAHbozK,EAAcz6K,GAAS,EAGPsH,GAFhBozK,EAAe7yE,GAAU,GAKtCoyE,mBAAoBp3E,EAAa83E,GAC/B,IAAIC,EAAgB,GACpB,IAAK,MAAM5tL,KAAQ7B,KAAKsrL,eAClBzpL,EAAK6tL,YAAc,GAAK7tL,EAAK6tL,aAAeh4E,IAE9C+3E,EAAc1qL,KAAKlD,GAIvB,GAAI2tL,GAAaC,EAAcnuL,OAAS,GAGlCo2G,EAAc+3E,EAAc,GAAGhE,WACjC,GAAIgE,EAAc,GAAGhE,WAAa/zE,EAAc,GAC9C,EAAQprE,KAAK,kDACbmjJ,EAAgB,OACX,CACL,EAAQnjJ,KAAK,iDACb,IAAI1tC,EAAO,EAAG,MAAMgyB,EAA2B,GAAnB5wB,KAAKurL,YAC3BoE,EAAS,GACf,IAAK,MAAM9tL,KAAQ4tL,EAAe,CAEhC,GADA7wL,GAAQiD,EAAKjD,KACTA,GAAQgyB,EAAO,MACnB++J,EAAO5qL,KAAKlD,GAEd4tL,EAAgBE,EAKtB,MAAM99E,EAAU49E,EAAcnuL,OAAStB,KAAKsrL,cAE5C,OADAtrL,KAAKsrL,cAAgBmE,EACd59E,EAIT+9E,eAAgBhvL,GACd,GAAIA,EAAK+qL,YAAc3rL,KAAKwrL,aAAaG,UAEvC,YADA,EAAQlsJ,MAAM,sCAIZz/B,KAAKy/B,OACP,EAAQ6M,KAAK,2BACX1rC,EAAK6qL,WAAa,WAAa7qL,EAAK8uL,YACpC,cAAgB5+K,KAAKuN,MAAMzd,EAAKivL,WAAa,OAEjD7vL,KAAKwrL,aAAaI,iBAAkB,EAChC96K,KAAKgE,IAAIlU,EAAKkvL,iBAAmB9vL,KAAKwrL,aAAaK,sBAAwB,MAC7E7rL,KAAKwrL,aAAaK,sBAAwB,GAExCjrL,EAAK6qL,WAAa7qL,EAAKkvL,iBAAmB,KAE5C9vL,KAAKsrL,cAAcvmL,KAAK,CACtB0mL,WAAY7qL,EAAKkvL,iBACjBC,YAAanvL,EAAKkvL,iBAAmB,KACrCJ,YAAa9uL,EAAK6qL,WAClBuE,SAAUpvL,EAAKovL,SACfH,UAAW,EACXI,UAAW,EACXtjC,MAAO,GACPujC,UAAU,EACVtxL,KAAM,IAIV,MAAM+tJ,EAAQ,GACd,IAAI/tJ,EAAO,EACX,IAAK,MAAMiD,KAAQjB,EAAKuvL,SACtBxjC,EAAM5nJ,KAAK,IACNlD,EACHuuL,MAAO,IAAI/C,UAAU,IAAIptF,kBAAkBp+F,EAAK0J,QAAS1J,EAAK2P,EAAG3P,EAAK+d,KAExEhhB,GAAQiD,EAAK0J,OAAOxJ,WAGtB,IAAIsuL,GAAgB,EACpB,GAAKzvL,EAAK8uL,YAAc,GAAK9uL,EAAK8uL,YAAc9uL,EAAK6qL,WAAa,EAAMzrL,KAAK2qL,WAAc/pL,EAAKsvL,SAAU,CACxG,MAAMI,EAAY1vL,EAAK6qL,WAAa,EAAMzrL,KAAK2qL,UAC/C/pL,EAAK8uL,YAAcY,EACnB1vL,EAAKmvL,YAAcO,EACnBD,GAAgB,EAElBrwL,KAAKsrL,cAAcvmL,KAAK,IACnBnE,EACH+rJ,MAAOA,EACP/tJ,KAAMA,IAGRoB,KAAKsrL,cAAcluJ,MAAK,CAACxqB,EAAGC,IAAMD,EAAE64K,WAAa54K,EAAE44K,aAE/CzrL,KAAKwrL,aAAaK,sBAAwB,EAE5C7rL,KAAKuwL,kBAAkBvwL,KAAKwrL,aAAaK,sBAAsB,GACtDjrL,EAAK6qL,WAAa,EAC3B,EAAQn/I,KAAK,0CACJ1rC,EAAK8uL,aAAe,EAE7B1vL,KAAKuwL,kBAAkB3vL,EAAK8uL,YAAaW,GAEzC,EAAQ/jJ,KAAK,yCAIjBikJ,kBAAmB74E,EAAa84E,GAC9B,IAAKxwL,KAAKurL,aAAevrL,KAAKurL,aAAe,EAAG,OAChD,GAAIvrL,KAAKwrL,aAAaI,kBAAoB4E,EAAW,OAErD,QAA2B,IAAhB94E,EAA6B,CACtC,IAAK13G,KAAKgrL,MAAO,OACjBtzE,EAAc13G,KAAKgrL,MAAMtzE,YAAc13G,KAAKqrL,WAG9C,IAAIzsL,EAAO,EACX,IAAK,MAAMiD,KAAQ7B,KAAKsrL,cAAe,CACrC,GAAIzpL,EAAK6tL,YAAc,EAErB,YADA,EAAQpjJ,KAAK,yCAGf,GAAIorE,GAAe71G,EAAK4pL,YAAc/zE,EAAc71G,EAAK6tL,YAKvD,YAHA,EAAQjwJ,MAAM,+BAAiCi4E,EAC7C,+CACA71G,EAAK4pL,WAAa,WAAa5pL,EAAK6tL,YAAc,KAGtD9wL,GAAQiD,EAAKjD,KAGf,GAAIA,GAAQoB,KAAKurL,YAAa,CAC5B,MAAMkF,EAAe/4E,GAAe84E,EAAY,EAAI,MAC/CxwL,KAAKwrL,aAAaI,iBASjB5rL,KAAKisL,cAAc,EAAQ3/I,KAAK,mCACpCtsC,KAAKwrL,aAAaK,qBAAuB4E,IATzCzwL,KAAKwrL,aAAaI,iBAAkB,EACpC5rL,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,iBACR8iK,aAAcA,EACdD,UAAWA,EACX7E,UAAW3rL,KAAKwrL,aAAaG,cASrC+E,qBAAsB3/I,EAAO2mE,GAC3B,MAAMg0E,EAAY36I,EAAMg/I,YAAcr4E,EACtC,GAAI13G,KAAKwrL,aAAaC,aAAe16I,EAAM06I,YAAczrL,KAAKwrL,aAAaE,YAAcA,EAAW,OACpG1rL,KAAKwrL,aAAaC,WAAa16I,EAAM06I,WACrCzrL,KAAKwrL,aAAaE,UAAYA,EAE9B,MAAMiF,EAAiBC,YAAY9mL,MAMnC,GALIinC,EAAMi/I,SAASn7K,QAAU7U,KAAKuqL,OAAO11K,OAASk8B,EAAMi/I,SAAStzE,SAAW18G,KAAKuqL,OAAO7tE,SACtF18G,KAAKuqL,OAAO11K,MAAQk8B,EAAMi/I,SAASn7K,MACnC7U,KAAKuqL,OAAO7tE,OAAS3rE,EAAMi/I,SAAStzE,QAEtC18G,KAAK4jB,IAAIiqK,UAAU,EAAG,EAAG7tL,KAAKuqL,OAAO11K,MAAO7U,KAAKuqL,OAAO7tE,SACnDgvE,EACH,IAAK,MAAM0E,KAASr/I,EAAM47G,MACxB3sJ,KAAKytL,aAAa54K,MAAQu7K,EAAM5+K,EAChCxR,KAAKytL,aAAa/wE,OAAS0zE,EAAMxwK,EACjC5f,KAAK0tL,gBAAgBM,aAAaoC,EAAMA,MAAO,EAAG,GAClDpwL,KAAK4jB,IAAIqqK,UAAUjuL,KAAKytL,aAAc2C,EAAMl0K,EAAGk0K,EAAMj0K,GAGzD,GAAInc,KAAKy/B,MAAO,CACd,MAAMoxJ,EAAW//K,KAAKuN,MAAMuyK,YAAY9mL,MAAQ6mL,GAChD,EAAQ9+J,IAAI,WAAa/gB,KAAKuN,MAAM0yB,EAAM8+I,UAAY9+I,EAAMk/I,WAAa,eAAiBn/K,KAAKuN,MAAM0yB,EAAMk/I,WAAa,cAAgBY,EAAW,QAIvJC,gBAEE,GADAzgL,OAAO0gL,sBAAsB/wL,KAAK8wL,gBAC7B9wL,KAAKgrL,MAAO,OAEjB,MAAMtzE,EAAc13G,KAAKgrL,MAAMtzE,YAAc13G,KAAKqrL,WAClD,IAAI2F,GAAc,EAAOC,GAAa,EAAWf,GAAW,EAC5D,IAAK,MAAMruL,KAAQ7B,KAAKsrL,cACtB,IAAK2F,GAAcpvL,EAAK4pL,YAAc/zE,IAAgB71G,EAAK6tL,YAAc,GAAK7tL,EAAK6tL,YAAch4E,GAC/F13G,KAAK0wL,qBAAqB7uL,EAAM61G,GAChCu5E,GAAa,EACbD,EAAanvL,EAAK6tL,iBACb,GAAIsB,GAAc,EAAG,CAI1B,KAAInvL,EAAK4pL,WAAauF,EAAa,KAIjC,MAHAA,EAAanvL,EAAK6tL,YAClBQ,EAAWruL,EAAKquL,SAOjBe,EAKMjxL,KAAK8uL,mBAAmBp3E,IAAgBs5E,GAAc,GAC/DhxL,KAAKuwL,kBAAkBS,EAAYd,GAL/Bp/K,KAAKgE,IAAI9U,KAAKwrL,aAAaK,qBAAuBn0E,GAAe,MACnE13G,KAAK8uL,mBAAmBp3E,GACxB13G,KAAKuwL,kBAAkB74E,GAAa,IAO1Cw5E,sBAAuBC,GACrB,GAAInxL,KAAKurL,YAAc,EAAG,CACxB,MAAM6F,EAAW,GACjB,GAAID,GAAcnxL,KAAKwrL,aAAaO,YAAc/rL,KAAKwrL,aAAaM,UAAW,CAC7E,GAAI9rL,KAAKwrL,aAAaO,aAAe/rL,KAAKuqL,OAAO7tE,QAAU18G,KAAKwrL,aAAaM,YAAc9rL,KAAKuqL,OAAO11K,MAAO,OAC9G,IAAIw8K,EAAY,GAAQC,EAA+B,GAAnBtxL,KAAKurL,YACrCvrL,KAAKuqL,OAAO7tE,QAAU18G,KAAKwrL,aAAaO,YAAc,EAAM/rL,KAAK+qL,kBACnE/qL,KAAKuqL,OAAO7tE,QAAU18G,KAAKwrL,aAAaO,YAAc,EAAM/rL,KAAK+qL,kBACjE/qL,KAAKuqL,OAAO11K,OAAS7U,KAAKwrL,aAAaM,WAAa,EAAM9rL,KAAK+qL,kBAC/D/qL,KAAKuqL,OAAO11K,OAAS7U,KAAKwrL,aAAaM,WAAa,EAAM9rL,KAAK+qL,mBAC/D,EAAQtrJ,MAAM,kEACd4xJ,EAAY,GACZC,EAA+B,GAAnBtxL,KAAKurL,aAEnB,MAAMgG,EAAWvxL,KAAKgrL,MAAMtzE,YAAc13G,KAAKqrL,WAAagG,EAC5D,IAAIzyL,EAAO,EACX,IAAK,MAAMiD,KAAQ7B,KAAKsrL,cAAe,CACrC,GAAIzpL,EAAK6tL,YAAc,GAAK7tL,EAAK6tL,aAAe6B,EAAU,MAE1D,GADA3yL,GAAQiD,EAAKjD,KACTA,GAAQ0yL,EAAW,MACvBF,EAASrsL,KAAKlD,IAIlB,EAAQyqC,KAAK,6BACbtsC,KAAKsrL,cAAgB8F,EACrBpxL,KAAKwrL,aAAaC,WAAa,KAC/BzrL,KAAKwrL,aAAaG,YAClB3rL,KAAKwrL,aAAaI,iBAAkB,EACpC5rL,KAAKwrL,aAAaO,WAAa/rL,KAAKuqL,OAAO7tE,OAC3C18G,KAAKwrL,aAAaM,UAAY9rL,KAAKuqL,OAAO11K,MAE1CxE,OAAO0gL,sBAAsB/wL,KAAK8wL,eAClC9wL,KAAKuwL,uBAAkBnoL,GAAW,IAKtCopL,aAAc5wL,GACZ,MAAM+vL,EAAiBC,YAAY9mL,MACnC9J,KAAK4jB,IAAIiqK,UAAU,EAAG,EAAG7tL,KAAKuqL,OAAO11K,MAAO7U,KAAKuqL,OAAO7tE,QACxD,IAAK,MAAM0zE,KAASxvL,EAAKuvL,SAAU,CACjCnwL,KAAKytL,aAAa54K,MAAQu7K,EAAM5+K,EAChCxR,KAAKytL,aAAa/wE,OAAS0zE,EAAMxwK,EACjC,MAAM6xK,EAAc,IAAIxxF,kBAAkBmwF,EAAM7kL,QAChD,GAAIvL,KAAKmuL,YACP,IAAK,IAAI7iL,EAAI,EAAGA,EAAImmL,EAAYnwL,OAAQgK,GAAK,EAC3CmmL,EAAYnmL,GAAMmmL,EAAYnmL,IAAM,EAAKmmL,EAAYnmL,GAAK,EAG9D,MAAMiiL,EAAY,IAAIF,UAAUoE,EAAarB,EAAM5+K,EAAG4+K,EAAMxwK,GAC5D5f,KAAK0tL,gBAAgBM,aAAaT,EAAW,EAAG,GAChDvtL,KAAK4jB,IAAIqqK,UAAUjuL,KAAKytL,aAAc2C,EAAMl0K,EAAGk0K,EAAMj0K,GAEvD,GAAInc,KAAKy/B,MAAO,CACd,MAAMoxJ,EAAWD,YAAY9mL,MAAQ6mL,EAC/BV,EAAYrvL,EAAKqvL,eACE,IAAdA,EACT,EAAQp+J,IAAI,WAAa/gB,KAAKuN,MAAMzd,EAAKivL,UAAYI,GAAa,eAAiBn/K,KAAKuN,MAAM4xK,GAAa,cAAgBY,EAAW,cAAgB//K,KAAKuN,MAAMzd,EAAKivL,UAAYgB,GAAY,OAE9L,EAAQh/J,IAAI,CAAEvwB,OAAQV,EAAKuvL,SAAS7uL,OAAQy6B,IAAKn7B,EAAK8wL,WAAa9wL,EAAK+wL,WAAad,EAAUa,WAAY9wL,EAAK8wL,WAAYC,WAAY/wL,EAAK+wL,WAAYd,SAAAA,IAE3J7wL,KAAK4xL,YAAchB,YAAY9mL,OAInC+nL,iBAAkBjxL,GAChB,MAAM+vL,EAAiBC,YAAY9mL,MACnC9J,KAAK4jB,IAAIiqK,UAAU,EAAG,EAAG7tL,KAAKuqL,OAAO11K,MAAO7U,KAAKuqL,OAAO7tE,QACxD,IAAK,MAAM0zE,KAASxvL,EAAKkxL,QACvB9xL,KAAK4jB,IAAIqqK,UAAUmC,EAAM2B,OAAQ3B,EAAMl0K,EAAGk0K,EAAMj0K,GAElD,GAAInc,KAAKy/B,MAAO,CACd,MAAMoxJ,EAAWD,YAAY9mL,MAAQ6mL,EACrC,EAAQ9+J,IAAI,CAAEvwB,OAAQV,EAAKkxL,QAAQxwL,OAAQy6B,IAAKn7B,EAAK8wL,WAAa9wL,EAAK+wL,WAAad,EAAUa,WAAY9wL,EAAK8wL,WAAYC,WAAY/wL,EAAK+wL,WAAYd,SAAAA,IACxJ7wL,KAAK4xL,YAAchB,YAAY9mL,OAInCkoL,mBAAoBn9K,EAAO6nG,GA8BzB,OA7B8B,OAA1B18G,KAAK4qL,iBACHluE,EAAS18G,KAAK8qL,kBAChBj2K,EAAQA,EAAQ7U,KAAK8qL,gBAAkBpuE,EACvCA,EAAS18G,KAAK8qL,iBAEP9qL,KAAK4qL,iBAAmB,EAC7BluE,EAAS18G,KAAK4qL,kBAAoB5qL,KAAK6qL,iBACzCh2K,GAAS7U,KAAK4qL,iBACdluE,GAAU18G,KAAK4qL,kBACNluE,EAAS18G,KAAK6qL,iBACvBh2K,EAAQA,EAAQ7U,KAAK6qL,gBAAkBnuE,EACvCA,EAAS18G,KAAK6qL,iBACLnuE,GAAU18G,KAAK8qL,kBACxBj2K,EAAQA,EAAQ7U,KAAK8qL,gBAAkBpuE,EACvCA,EAAS18G,KAAK8qL,iBAEPpuE,GAAU18G,KAAK6qL,kBACpBnuE,EAAS18G,KAAK4qL,kBAAoB5qL,KAAK6qL,iBACzCh2K,EAAQA,EAAQ7U,KAAK6qL,gBAAkBnuE,EACvCA,EAAS18G,KAAK6qL,iBACLnuE,EAAS18G,KAAK4qL,kBAAoB5qL,KAAK8qL,iBAChDj2K,GAAS7U,KAAK4qL,iBACdluE,GAAU18G,KAAK4qL,mBAEf/1K,EAAQA,EAAQ7U,KAAK8qL,gBAAkBpuE,EACvCA,EAAS18G,KAAK8qL,kBAIX,CAAEj2K,MAAAA,EAAO6nG,OAAAA,GAGlBsyE,OAAQn6K,EAAQ,EAAG6nG,EAAS,EAAGtgB,EAAM,EAAGprF,EAAO,GAC7C,IAAIihL,EAAY,KAChB,KAAMp9K,IAAU6nG,IAAW18G,KAAKgrL,MAAO,CACrCiH,EAAYjyL,KAAKmvL,mBACjB,MAAM+C,EAAUlyL,KAAKgyL,mBAAmBC,EAAUp9K,OAASxE,OAAO8hL,kBAAoB,GAAIF,EAAUv1E,QAAUrsG,OAAO8hL,kBAAoB,IACzIt9K,EAAQq9K,EAAQr9K,MAChB6nG,EAASw1E,EAAQx1E,OACjB,MAAMr7G,EAASrB,KAAKirL,aAAamH,wBAAwBh2F,IAAMp8F,KAAKgrL,MAAMoH,wBAAwBh2F,IAClGA,EAAM61F,EAAU91K,EAAI9a,EACpB2P,EAAOihL,EAAU/1K,EAGflc,KAAKuqL,OAAO3gH,MAAMwyB,MAAQA,GAAOp8F,KAAKuqL,OAAO3gH,MAAM54D,OAASA,IAC7C,MAAbihL,IACFjyL,KAAKirL,aAAarhH,MAAMhxC,SAAW,WACnC54B,KAAKuqL,OAAO3gH,MAAM2kH,QAAU,QAC5BvuL,KAAKuqL,OAAO3gH,MAAMhxC,SAAW,WAC7B54B,KAAKuqL,OAAO3gH,MAAMwyB,IAAMA,EAAM,KAC9Bp8F,KAAKuqL,OAAO3gH,MAAM54D,KAAOA,EAAO,KAChChR,KAAKuqL,OAAO3gH,MAAMyoH,cAAgB,OAClCryL,KAAKuqL,OAAO3gH,MAAM/0D,MAAQo9K,EAAUp9K,MAAQ,KAC5C7U,KAAKuqL,OAAO3gH,MAAM8yC,OAASu1E,EAAUv1E,OAAS,MAE1C18G,KAAKuqL,OAAO11K,QAAUA,GAAS7U,KAAKuqL,OAAO7tE,SAAWA,IAElC,cAApB18G,KAAKwqL,YAA8BxqL,KAAKotL,WAC1CptL,KAAKirL,aAAa/vH,SAClBl7D,KAAKirL,kBAAe7iL,EACpBpI,KAAKqsL,gBAGHrsL,KAAKsyL,qBACP3lJ,aAAa3sC,KAAKsyL,qBAClBtyL,KAAKsyL,oBAAsBntJ,YAAW,KACpCnlC,KAAKsyL,yBAAsBlqL,EAC3BpI,KAAKuyL,QAAQ19K,EAAO6nG,EAAQtgB,EAAKprF,EAAMihL,KACtC,MAEHjyL,KAAKuyL,QAAQ19K,EAAO6nG,EAAQtgB,EAAKprF,EAAMihL,GACvCjyL,KAAKsyL,oBAAsBntJ,YAAW,KACpCnlC,KAAKsyL,yBAAsBlqL,IAC1B,OAMXmqL,QAAS19K,EAAQ,EAAG6nG,EAAS,EAAGtgB,EAAM,EAAGprF,EAAO,EAAGihL,GACzB,cAApBjyL,KAAKwqL,YAA8BxqL,KAAKirL,cAAgBjrL,KAAKotL,WAC/DptL,KAAKirL,aAAa/vH,SAClBl7D,KAAKirL,kBAAe7iL,EACpBpI,KAAKqsL,gBAEPrsL,KAAKuqL,OAAO11K,MAAQA,EACpB7U,KAAKuqL,OAAO7tE,OAASA,EAEJ,MAAbu1E,IACFjyL,KAAKirL,aAAarhH,MAAMhxC,SAAW,WACnC54B,KAAKuqL,OAAO3gH,MAAM2kH,QAAU,QAC5BvuL,KAAKuqL,OAAO3gH,MAAMhxC,SAAW,WAC7B54B,KAAKuqL,OAAO3gH,MAAMwyB,IAAMA,EAAM,KAC9Bp8F,KAAKuqL,OAAO3gH,MAAM54D,KAAOA,EAAO,KAChChR,KAAKuqL,OAAO3gH,MAAMyoH,cAAgB,OAClCryL,KAAKuqL,OAAO3gH,MAAM/0D,MAAQo9K,EAAUp9K,MAAQ,KAC5C7U,KAAKuqL,OAAO3gH,MAAM8yC,OAASu1E,EAAUv1E,OAAS,MAGxB,cAApB18G,KAAKwqL,YAA8BxqL,KAAKotL,UAC1CptL,KAAKmtL,sBAEPntL,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,SACR9Y,MAAO7U,KAAKuqL,OAAO11K,MACnB6nG,OAAQ18G,KAAKuqL,OAAO7tE,SAEtB18G,KAAKkxL,uBAAsB,GAG7B/E,gBAAiBp7I,GACV/wC,KAAKisL,eACRjsL,KAAKisL,cAAe,EAChBjsL,KAAKkrL,cACPlrL,KAAKkrL,gBAGT,MAAMtqL,EAAOmwC,EAAMnwC,KACnB,OAAQA,EAAK+sB,QACX,IAAK,SACH,EAAQkE,IAAIjxB,EAAK0H,SACjB,MAEF,IAAK,SACH,EAAQ/G,MAAMX,EAAK0H,SACnB,MAEF,IAAK,SACH,OAAQ1H,EAAK0wH,IACX,IAAK,eACCtxH,KAAKorL,eAAiBxqL,EAAK6N,OAC7BzO,KAAKorL,eAAiBxqL,EAAK6N,KAC3B4B,OAAO0gL,sBAAsB/wL,KAAKwxL,aAAaxnK,KAAKhqB,KAAMY,KAE5D,MAEF,IAAK,mBACCZ,KAAKorL,eAAiBxqL,EAAK6N,OAC7BzO,KAAKorL,eAAiBxqL,EAAK6N,KAC3B4B,OAAO0gL,sBAAsB/wL,KAAK6xL,iBAAiB7nK,KAAKhqB,KAAMY,KAEhE,MAEF,IAAK,iBACHZ,KAAK4vL,eAAehvL,GACpB,MAEF,QACE,MAAMA,EAAK+sB,OAEf,MAEF,IAAK,OACH3tB,KAAKksL,QAAUtrL,EAAK0N,GACpBtO,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,OACRrf,GAAItO,KAAKksL,UAEX,MAEF,IAAK,SACClsL,KAAKwyL,gBACPxyL,KAAKwyL,gBAAgBzhJ,GAErB,EAAQxvC,MAAM,uEAEhB,MAEF,IAAK,QACH,MAEF,QACE,EAAQswB,IAAIjxB,IAKlB6xL,eACEzyL,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,iBAIZ+kK,cAAe9xL,EAAMC,EAAU,IAC7Bb,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,SACRglK,SAAU/xL,EACV4rL,QAAS3rL,EAAQ2rL,UAIrBqC,eAAgBlkD,EAAUjzB,GACxB13G,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,QACRg9G,SAAUA,EACVjzB,YAAaA,IAIjBk7E,cAAep+I,GACbx0C,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,mBACR6mB,IAAKA,IAEPx0C,KAAKkxL,uBAAsB,GAG7B2B,SAAUvqL,GACRtI,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,YACRrlB,QAASA,IAEXtI,KAAKkxL,uBAAsB,GAG7B4B,YACE9yL,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,eAEV3tB,KAAKkxL,uBAAsB,GAG7BnhC,UACE/vJ,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,QACRqiI,KAAMhwJ,KAAKgrL,MAAM+H,eAIrBvtJ,UACExlC,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,YAGV3tB,KAAKo7I,OAAOC,YACZr7I,KAAKisL,cAAe,EAEhBjsL,KAAKgrL,OAAOhrL,KAAKgrL,MAAMyD,WAAWuE,YAAYhzL,KAAKirL,cAGzDgI,YAAaliJ,GACX/wC,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,eACRojB,MAAOA,IAIXmiJ,YACElzL,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,eAIZwlK,SAAUpiJ,EAAOnnC,GACf5J,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,YACRojB,MAAOA,EACPnnC,MAAOA,IAIXwpL,YAAaxpL,GACX5J,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,eACR/jB,MAAOA,IAIXypL,YAAazpH,GACX5pE,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,eACRi8C,MAAOA,IAIX0pH,YACEtzL,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,eAIZ4lK,SAAU3pH,EAAOhgE,GACf5J,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,YACRi8C,MAAOA,EACPhgE,MAAOA,IAIX4pL,YAAa5pL,GACX5J,KAAKo7I,OAAON,YAAY,CACtBntH,OAAQ,eACR/jB,MAAOA,KCnzBb,SAAS6pL,EAA4BC,EAAIjwL,EAAQiwL,EAAGznC,mBAClD,MAAiB,aAAVxoJ,GAAwB,IAAI+nB,SAAQC,IACzCioK,EAAG/8I,iBAAiB,2BAA2B,IAAgC,aAAzB+8I,EAAGznC,mBAAqCxgI,SASnF,MAAMqjB,EASnB7sC,YAAapB,EAAU,IACrB,IAAI,OAAE8yL,GAAS,EAAI,QAAE79I,GAAU,GAASj1C,GAEpC,MAAE+yL,EAAK,MAAEC,GAAU,IAAIC,eACvBr+I,EAAOhsC,GAAOoqL,EAAM/4C,YAAYlyI,KAAKC,UAAUY,IAEnD,MAAMiqL,EAAK,IAAI/1F,kBAAkB,CAC/BuwD,WAAYrtJ,GAASqtJ,YAAc,CAAC,CAClCzvB,KAAM,CACJ,+BACA,wCAKAs1D,EAAO,IAAI/gC,gBAGX39G,EAAS,CAAEA,OAAQ0+I,EAAK1+I,QAE9Bq+I,EAAG/8I,iBAAiB,4BAA4B,KAElB,iBAA1B+8I,EAAG1nC,oBACuB,WAA1B0nC,EAAG1nC,oBAEH+nC,EAAK57F,UAEN9iD,GAEH,MAAM2+I,EAAKN,EAAGlrC,kBAAkB,OAAQ,CAAE9C,YAAY,EAAMp3I,GAAI,IAEhEtO,KAAK0zL,GAAKA,EACV1zL,KAAKg0L,GAAKA,EACVh0L,KAAKq1C,OAAS0+I,EAAK1+I,OACnBr1C,KAAK2zL,OAASA,EACd3zL,KAAKi0L,cAAgBL,EAErB5zL,KAAK0zK,MAAQ,IAAIloJ,SAAQC,IACvBuoK,EAAGr9I,iBAAiB,QAAQ,KAG1Bb,GAAU,EACVL,EAAQhsC,GAAQuqL,EAAGv+I,KAAK7sC,KAAKC,UAAUY,IACvCmqL,EAAMhsI,QACNisI,EAAMjsI,QACN5nD,KAAK0zK,MAAQmgB,EAAQD,EAAQC,EAAMh5C,UAAY,KAC/CpvH,MACC,CAAE+Y,MAAM,KAAS6Q,OAGtBq+I,EAAG/8I,iBAAiB,gBAAgB,EAAG2yG,UAAAA,MACrCxzG,GAAWL,EAAK,CAAE6zG,UAAAA,MACjB,IAAKj0G,IAIR,IAAI6+I,GAAc,EAAWC,GAAc,EAkB3C9rI,eAAewyF,GAAW,KAAEj6I,IAC1B,MAAM,YAAEwzL,EAAW,UAAE9qC,GAA8B,iBAAT1oJ,EAAoBgI,KAAK41B,MAAM59B,GAAQA,EAEjF,GAAIwzL,EAAa,CACf,MAAMC,EAAsC,UAArBD,EAAYpsL,OAChCksL,GAAqC,WAAtBR,EAAG7lC,gBAGrB,GADAsmC,GAAen0L,KAAK2zL,QAAUU,EAC1BF,EACF,OAGF,GAAIE,QACI7oK,QAAQ4iF,IAAI,CAChBslF,EAAGloC,oBAAoB,CAAExjJ,KAAM,aAC/B0rL,EAAGjqC,qBAAqB2qC,UAG1B,IACwB,WAArBA,EAAYpsL,MAA2C,WAAtB0rL,EAAG7lC,sBAC7B6lC,EAAGjqC,qBAAqB2qC,GAChC,MAAOrqL,IAEc,UAArBqqL,EAAYpsL,aACR0rL,EAAGloC,0BAA0BkoC,EAAG7nC,gBAEjC/1G,SAAe29I,EAA2BC,EAAI,OACnDj+I,EAAK,CAAE2+I,YAAaV,EAAGnoC,yBAEhBjC,SACHoqC,EAAG9pC,gBAAgBN,GA9C7BoqC,EAAG/8I,iBAAiB,qBAAqB0R,UACvC6rI,GAAc,EACd,MAAMl/I,QAAc0+I,EAAGroC,cACvB,GAA0B,WAAtBqoC,EAAG7lC,eAGP,SAFM6lC,EAAGloC,oBAAoBx2G,GAC7Bk/I,GAAc,EACVp+I,EACFL,EAAK,CAAE2+I,YAAaV,EAAGnoC,uBAClB,OACCkoC,EAA2BC,GACjC,MAAMU,EAAcV,EAAGnoC,iBAAiB33I,SACxCwgL,EAAY/uC,IAAM+uC,EAAY/uC,IAAIz3I,QAAQ,6BAA8B,IACxE6nC,EAAK,CAAE2+I,YAAAA,OAER,IAAK/+I,IAoCRw+I,EAAMh5C,UAAYA,EAAU7wH,KAAKhqB,MACjCg0L,EAAGr9I,iBAAiB,UAAWkkG,EAAU7wH,KAAKhqB,MAAO,IAAKq1C,KAG9DhlC,OAAOy+B,KAAOA,gBC7Hd,MAAMilB,EAAQ,CAAC,KAAM,MAAO,MAAO,MAAO,OAuB3B,MAAMugI,UAAyB,KAC5CryL,YAAapB,EAAU,IACrBugC,MAAMvgC,EAAQ0zL,gBAEdv0L,KAAKu8K,UAAY17K,EAAQ07K,WAAa,GAEtC,MAAMjuB,EAAQz9G,SAASywH,SAASptI,OAAO,EAAG2c,SAASywH,SAASxuG,YAAY,KAAO,GACzEsoF,EAASvqG,SAASyF,OAASg4G,EAAQ,UAAYxuF,UAAU+yG,eAAeve,YAAY4f,WAAap0G,UAAU+yG,cAAcve,WACzHkgC,EAAep5C,IACnB,MAAMq5C,EAAar5C,GACO,cAAjBA,EAAO33I,OAAyBzD,KAAK6zK,WAAWz4B,GAEpDq5C,EAAWr5C,IACdA,EAAOzkG,iBAAiB,eAAe,EAAGhpB,OAAAA,KAAa8mK,EAAW9mK,MAuFtE,GApFIytH,EACFo5C,EAAap5C,GAEbt7E,UAAU+yG,cAAc6hB,SAAS,QAAS,CAAEpmC,MAAAA,IAASljI,MAAKupK,IACxDH,EAAaG,EAAIC,QAAUD,EAAIE,SAAWF,EAAIG,eAC7CzpK,OAAM3kB,IACP,GAAkB,gGAAdmF,OAAOnF,GAGT,MAAMA,EAFNmqC,SAASkkJ,YAMf1kL,OAAOsmC,iBAAiB,gBAAgB,KACtC32C,KAAKwlC,UACLxlC,KAAKg1L,kBAGPh1L,KAAKgrL,MAAQnqL,EAAQmqL,MACrBhrL,KAAK81I,SAAWj1I,EAAQi1I,UAAY,GAGhC91I,KAAK81I,SAASm/C,YAChBj1L,KAAK81I,SAASm/C,UAAUt+I,iBAAiB,SAASjwC,GAAK1G,KAAKi1L,UAAUvuL,EAAEinB,OAAOlsB,SAC/EzB,KAAKi1L,YACLj1L,KAAKk1L,eAAY9sL,EACb,gBAAiB+sL,iBAAiBl1L,WAAaD,KAAK81I,SAASs/C,aAC/Dp1L,KAAKgrL,MAAMr0I,iBAAiB,kBAAkB,KAC5C,GAAI32C,KAAKgrL,MAAMqK,YAAY/zL,OAAS,EAAG,CACrCtB,KAAK81I,SAASs/C,YAAYE,gBAAgB,YAC1C,IAAK,MAAMxuL,KAAS9G,KAAKgrL,MAAMqK,YAC7Br1L,KAAKu1L,mBAAmBzuL,EAAO,cAGjC9G,KAAK81I,SAASs/C,YAAYlgD,aAAa,WAAY,QAKvDl1I,KAAK81I,SAAS0/C,WAChBx1L,KAAK81I,SAAS0/C,SAAS7+I,iBAAiB,SAAS,IAAM32C,KAAKy1L,cAC5Dz1L,KAAK81I,SAAS0/C,SAAS7+I,iBAAiB,YAAY,IAAM32C,KAAK01L,sBAG7D11L,KAAK81I,SAAS6/C,cAChB31L,KAAK81I,SAAS6/C,YAAYh/I,iBAAiB,SAASjwC,GAAK1G,KAAK21L,YAAYjvL,EAAEinB,OAAOlsB,SACnFzB,KAAK81I,SAAS6/C,YAAYh/I,iBAAiB,WAAWjwC,GAAK1G,KAAK41L,WAAWlvL,EAAEinB,OAAOlsB,SACpFzB,KAAK81I,SAAS6/C,YAAYh/I,iBAAiB,YAAYjwC,GAAK1G,KAAK41L,WAAWlvL,EAAEinB,OAAOlsB,SACrFzB,KAAK81I,SAAS6/C,YAAYh/I,iBAAiB,aAAajwC,GAAK1G,KAAK61L,aAAanvL,EAAEinB,OAAOlsB,SACxFzB,KAAKgrL,MAAMr0I,iBAAiB,cAAcjwC,IACpC1G,KAAK81L,gBAA6C,YAA3BpsH,SAAS74B,SAAS6S,OAAuB1jD,KAAKgrL,MAAMrhD,QAAQ3pI,KAAK21L,YAAYjvL,EAAEinB,OAAO+pF,YAAchxG,EAAEinB,OAAO8xC,SAAW,QAErJz/D,KAAKgrL,MAAMr0I,iBAAiB,SAAS,IAAM32C,KAAK21L,YAAY,QAG9D31L,KAAKgrL,MAAMr0I,iBAAiB,kBAAkB,IAAM32C,KAAK+1L,kBAAkB/1L,KAAKg2L,eAChFh2L,KAAKi2L,aAAe,CAClBpJ,MAAO,GACP1rE,QAAS,GACT+0E,OAAQ,GACRhvK,aAAS9e,EACT+tL,cAAU/tL,EACVy3B,YAAQz3B,EACR0kC,YAAQ1kC,EACRmrD,YAAQnrD,EACRurC,aAASvrC,EACTguL,cAAe,+QAEJv1L,EAAQw1L,kBAAoB,yHAMzCr2L,KAAKs2L,WAAY,EACjBt2L,KAAKgrL,MAAMr0I,iBAAiB,cAAc,IAAM32C,KAAKu2L,oBAErDv2L,KAAKw2L,iBAAcpuL,EACfvH,EAAQ41L,UAAUz2L,KAAKgrL,MAAMr0I,iBAAiB,SAAS,IAAM32C,KAAK02L,aAEtE12L,KAAK22L,iBAAmB91L,EAAQ81L,iBAChC32L,KAAKg2L,iBAAc5tL,EACnBpI,KAAK42L,eAAYxuL,EAEbpI,KAAK81I,SAAS+gD,UAAW,CAC3B72L,KAAK82L,mBAAqBj2L,EAAQi2L,mBAClC,MAAMC,EAAcrtH,SAASstC,cAAc,UAC3C+/E,EAAYliL,MAAQhU,EAAQm2L,gBAAkB,IAC9Ch3L,KAAKi3L,cAAgB,CACnBC,WAAY,GACZ3M,OAAQwM,EACR37F,QAAS27F,EAAYzJ,WAAW,MAChCz7I,cAAUzpC,EACV4iL,WAAO5iL,GAETpI,KAAKgrL,MAAMr0I,iBAAiB,kBAAkB,IAAM32C,KAAKm3L,kBACzDn3L,KAAKgrL,MAAMr0I,iBAAiB,cAAc,IAAM32C,KAAKo3L,gBAAgBp3L,KAAKgrL,SAGxEnqL,EAAQw2L,sBACVr3L,KAAKs3L,WAAY,EACjB5tH,SAAS/yB,iBAAiB,oBAAoB,KACvC32C,KAAKgrL,MAAMn7H,QACmB,WAA7B6Z,SAAS6tH,iBACXv3L,KAAKs3L,UAAYt3L,KAAKgrL,MAAMrhD,OAC5B3pI,KAAKgrL,MAAMpuH,SAEN58D,KAAKs3L,WAAWt3L,KAAKy1L,iBAMlCz1L,KAAKw3L,YAASpvL,EAEdpI,KAAKs/K,aAAuC,MAAxBz+K,EAAQy+K,gBAAyBz+K,EAAQy+K,aAE7Dt/K,KAAK81L,oBAAiB1tL,EACtBpI,KAAKy3L,YAAc52L,EAAQ42L,aAAe,EAE1Cz3L,KAAK03L,cAAgB72L,EAAQ62L,cAC7B13L,KAAK23L,OAAS92L,EAAQ82L,OAClB33L,KAAK23L,SACP33L,KAAK23L,OAAOhhJ,iBAAiB,oBAAoB,IAAM32C,KAAK43L,qBAC5D53L,KAAK23L,OAAOhhJ,iBAAiB,aAAa,IAAMo6I,uBAAsB,IAAM/wL,KAAK63L,mBACjF73L,KAAK23L,OAAOhhJ,iBAAiB,aAAa,IAAMo6I,uBAAsB,IAAM/wL,KAAK63L,mBACjF73L,KAAK23L,OAAOhhJ,iBAAiB,YAAY,IAAMo6I,uBAAsB,IAAM/wL,KAAK63L,mBAChF73L,KAAK23L,OAAOhhJ,iBAAiB,cAAc,IAAMo6I,uBAAsB,IAAM/wL,KAAK83L,oBAElF93L,KAAK+3L,sBAAmB3vL,EACxBpI,KAAK23L,OAAOhhJ,iBAAiB,YAAYjwC,IACnC1G,KAAK+3L,kBACPrxL,EAAEsxL,iBACFrrJ,aAAa3sC,KAAK+3L,kBAClB/3L,KAAK+3L,sBAAmB3vL,EACxBpI,KAAK01L,oBAEL11L,KAAK+3L,iBAAmB5yJ,YAAW,KACjCnlC,KAAK+3L,sBAAmB3vL,IACvB,SAKTpI,KAAKi4L,mBAAgB7vL,EACrBpI,KAAKgrL,MAAMr0I,iBAAiB,WAAW,IAAM32C,KAAKk4L,kBAClDl4L,KAAKgrL,MAAMr0I,iBAAiB,WAAW,IAAM32C,KAAKk4L,kBAClDl4L,KAAKgrL,MAAMr0I,iBAAiB,cAAc,IAAM32C,KAAKk4L,kBACrDl4L,KAAKgrL,MAAMr0I,iBAAiB,WAAW,IAAM32C,KAAKm4L,kBAElD,MAAMC,EAAqBC,IACrBA,EACFr4L,KAAK81I,SAASwiD,WAAWhD,gBAAgB,YAEzCt1L,KAAK81I,SAASwiD,WAAWpjD,aAAa,WAAY,KAGlD,wBAAyB7kI,QAC3BrQ,KAAKu4L,oBAAsB,IAAIC,oBAAoB,CAAC,kBACpDx4L,KAAKu4L,oBAAoB5hJ,iBAAiB,uBAAuBjwC,GAAK1G,KAAKy4L,SAAS/xL,KACpF1G,KAAK04L,uBAAyB,KAC9B54H,UAAU64H,aAAaC,eAAiB54L,KAAKu4L,oBAC7Cv4L,KAAKu4L,oBAAoBM,kBAAkBztK,MAAKitK,IAC9CA,EAAKS,SAAWpyL,GAAK0xL,EAAmB1xL,EAAEinB,OAAOlsB,OACjD22L,EAAmBC,EAAK52L,WAG1BzB,KAAK81I,SAASwiD,WAAWpjD,aAAa,WAAY,IAGhD,4BAA6BxrE,UAC/B1pE,KAAK+4L,OAASl4L,EAAQk4L,OAClB/4L,KAAK81I,SAASkjD,cAAch5L,KAAK81I,SAASkjD,aAAa1D,gBAAgB,YACvEt1L,KAAK+4L,QAAQ/4L,KAAKgrL,MAAMr0I,iBAAiB,yBAAyB,KAAY32C,KAAKi2L,aAAaE,UAAUn2L,KAAKg5L,oBAEnHh5L,KAAKgrL,MAAM91C,aAAa,0BAA2B,IAC/Cl1I,KAAK81I,SAASkjD,cAAch5L,KAAK81I,SAASkjD,aAAa9jD,aAAa,WAAY,KAGtFl1I,KAAKi5L,SAAWp4L,EAAQo4L,UAAY,EAChC,iBAAkBn5H,YACpBA,UAAUo5H,aAAaC,iBAAiB,QAAQ,IAAMn5L,KAAKy1L,cAC3D31H,UAAUo5H,aAAaC,iBAAiB,SAAS,IAAMn5L,KAAKy1L,cAC5D31H,UAAUo5H,aAAaC,iBAAiB,gBAAgB,IAAMn5L,KAAKkvK,KAAKlvK,KAAKi5L,YAC7En5H,UAAUo5H,aAAaC,iBAAiB,eAAe,IAAMn5L,KAAKkvK,KAAKlvK,KAAKi5L,YAC5En5H,UAAUo5H,aAAaC,iBAAiB,aAAa,IAAMn5L,KAAK02L,aAC5D,qBAAsB52H,UAAUo5H,cAAcl5L,KAAKgrL,MAAMr0I,iBAAiB,cAAc,IAAM32C,KAAKo5L,yBAGzGp5L,KAAKq5L,mBAAqB,CAAC,OAAQ,OAAQ,OAAQ,QACnDr5L,KAAKs5L,gBAAkB,CAAC,OAAQ,OAAQ,OAAQ,OAAQ,MAAO,OAAQ,OAAQ,QAAS,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,QAAS,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,OAAQ,MAAO,OAAQ,QAAS,OAAQ,QACzPt5L,KAAKu5L,gBAAanxL,EAElBpI,KAAKw5L,gBACLx5L,KAAKy5L,gBAAkB7wL,KAAK41B,MAAMyrC,aAAaX,QAAQ,qBAAuB,GAE9E9jE,OAAO2G,OAAOnM,KAAKy5L,iBAAiBz2L,SAAQ02L,GAAa15L,KAAK25L,gBAAgB,IAAInjJ,KAAK,CAAC,IAAI7e,WAAW+hK,QAEvG15L,KAAK45L,iBAAmB/4L,EAAQ+4L,iBAEhC55L,KAAK65L,IAAM,OACP,8BAA+B1E,iBAAiBl1L,WAClDD,KAAKgrL,MAAMr0I,iBAAiB,cAAc,KACxC32C,KAAK65L,IAAM,IAAIruK,SAAQC,IACrB,IAAIquK,EAAW,KACXC,GAAY,EACZroK,EAAQ,EAEZ,MAAMsoK,EAAe,CAAClwL,EAAKk7J,KACzB,GAAItzI,EACF,GAAIooK,EAAU,CACZ,MACMG,GAAU,IADFj1B,EAASnmD,UAAYi7E,EAASj7E,YAAcmmD,EAASk1B,gBAAkBJ,EAASI,mBACpEC,QAAQ,GAE9Bn6L,KAAKg2L,YAAYl2L,KAAKqvB,SAAS,QAE/B1D,EADEwuK,EAAS,IAAMA,EAAS,GAClB,OACCA,EAAS,IAAMA,EAAS,GACzB,MACCA,EAAS,IAAMA,EAAS,GACzB,MAEAA,GAGVxuK,EAAQwuK,GAENF,GAAW/5L,KAAKgrL,MAAMpuH,aAE1Bk9H,EAAW90B,EACXhlK,KAAKgrL,MAAMoP,0BAA0BJ,QAGvCtoK,IACI1xB,KAAKgrL,MAAMrhD,SACbowD,GAAY,EACZ/5L,KAAKgrL,MAAMj2C,QAEb/0I,KAAKgrL,MAAMoP,0BAA0BJ,IAGzCh6L,KAAKgrL,MAAMoP,0BAA0BJ,SAK3C,IAAK,MAAOK,EAAcC,KAAa90L,OAAO22G,QAAQn8G,KAAK81I,UACzD,GAAI91I,KAAKq6L,GACP,GAAIC,EAASr4L,cAAgBP,MAC3B,IAAK,MAAM8wG,KAAW8nF,EACpB9nF,EAAQ77D,iBAAiB,SAASjwC,IAChC1G,KAAKq6L,GAAc3zL,EAAEinB,OAAOlsB,eAIhC64L,EAAS3jJ,iBAAiB,SAASjwC,IACjC1G,KAAKq6L,GAAc3zL,EAAEinB,OAAOlsB,UAKpCioE,SAAS/yB,iBAAiB,WAAW/jC,IAInC,GAHc,OAAVA,EAAEvO,KACJuO,EAAEolL,iBAEkB,YAAlBnnJ,SAAS6S,KACX,OAAQ9wC,EAAEvO,KACR,IAAK,IACHrE,KAAKy1L,YACL,MACF,IAAK,IACHz1L,KAAK02L,WACL,MACF,IAAK,IACH12L,KAAKu6L,aACL,MACF,IAAK,IACHv6L,KAAKg5L,eACL,MACF,IAAK,IACHh5L,KAAKw6L,gBACL,MACF,IAAK,IACHx6L,KAAKy6L,WACL,MACF,IAAK,IACHz6L,KAAK01L,mBACL,MACF,IAAK,IACH11L,KAAKkvK,KAAK,IACV,MACF,IAAK,YACHlvK,KAAKkvK,MAAMlvK,KAAKi5L,UAChB,MACF,IAAK,aACHj5L,KAAKkvK,KAAKlvK,KAAKi5L,UACf,MACF,IAAK,UACHj5L,KAAKi1L,UAAU91L,OAAOa,KAAK81I,SAASm/C,UAAUxzL,OAAS,GACvD,MACF,IAAK,YACHzB,KAAKi1L,UAAU91L,OAAOa,KAAK81I,SAASm/C,UAAUxzL,OAAS,GACvD,MACF,IAAK,SACHovC,SAAS6S,KAAO,YAO1B2E,iBAAkBwd,EAAS5mC,EAAO,IAahC,GAXAj/B,KAAKg1L,eACD/1J,EAAK4lC,KACP7kE,KAAKg2L,YAAc/2J,EAAK4lC,KACf7kE,KAAKu5L,WAAWj4L,OAAS,EAClCtB,KAAKg2L,YAAch2L,KAAKu5L,WAAWp0L,QAAOkjD,MAAAA,SAAoBroD,KAAK22L,iBAAiB,CAAElO,SAAU5jH,EAAK/kE,OAAQsrB,MAAKsvK,GAAcv7L,OAAOu7L,EAAUC,iBAAmBx7L,OAAO8/B,EAAK27J,SAAW,IAAQF,IAAcz7J,EAAK47J,UAAS,IAAM76L,KAAKu5L,WAAW,GAErPv5L,KAAKg2L,YAAch2L,KAAKu5L,WAAW,GAGrCv5L,KAAK86L,WAAc77J,EAAK47J,QAAqC,IAA3B76L,KAAKu5L,WAAWj4L,QAAiB29B,EAAK87J,YAAc97J,EAAK4lC,MAAU5lC,EAAK47J,MAAQ76L,KAAK22L,uBAAyB32L,KAAK22L,iBAAiB,CAAElO,SAAUzoL,KAAKg2L,YAAYl2L,KAAMgF,OAAQ,oBAAkBsD,EAE/NpI,KAAK86L,WAAY,CACfE,eAAeA,cAAcC,UAAU//H,OAAO,UAElD,MAAMggI,EAAc,CAACl7L,KAAK86L,WAAWH,cAAe36L,KAAK86L,WAAWK,cAAch2L,QAAOgY,GAAKA,IAAGta,KAAK,OAElG,iBAAkBi9D,YACpBA,UAAUo5H,aAAal0B,SAAW,IAAIo2B,cAAc,CAClD93D,MAAOtjI,KAAK86L,WAAWO,YAAcr7L,KAAK86L,WAAWh7L,MAAQ,mBAC7Dw7L,OAAQ,WAAaJ,EACrBK,MAAOv7L,KAAK86L,WAAWh7L,MAAQ,mBAC/B07L,QAAS,CAAC,CACR5jJ,IAAK53C,KAAK86L,WAAWW,kBAAoBz7L,KAAK86L,WAAWY,YAAc,GACvEh5D,MAAO,UACP16H,KAAM,iBAIRhI,KAAK86L,WAAWW,mBAAkBz7L,KAAKgrL,MAAM2Q,OAAS37L,KAAK86L,WAAWW,kBAE1Ez7L,KAAK47L,mBAAmB,aAAc,MAAQV,GAC9CxxH,SAAS45D,MAAQ,CAACtjI,KAAK86L,WAAWO,aAAYH,GAAc,MAAQA,EAAqBl7L,KAAK86L,WAAWh7L,MAAQ,oBAAoBqF,QAAOgY,GAAKA,IAAGta,KAAK,OAE3J,GAAI7C,KAAKg2L,YAAYl2L,KAAKqvB,SAAS,OAAQ,CACzC,IAAI0sK,EAAa,KACjB77L,KAAKg2L,YAAYtxJ,GAAG,UAAU,EAAG7E,OAAAA,MAC/Bg8J,EAAah8J,KAEf7/B,KAAK87L,WAAW97L,KAAKg2L,aAAa5qK,MAAK,KACrCprB,KAAKg2L,YAAYtxJ,GAAG,UAAU,EAAG7E,OAAAA,EAAQ2O,IAAAA,GAAOzF,KACtB,UAApByF,EAAI0oI,aAA4Bl3K,KAAKi2L,aAAa1iI,SACpDvzD,KAAKi2L,aAAap2J,OAAS,IAAI6lJ,EAAe1lL,KAAKi2L,aAAap2J,QAChE7/B,KAAK+7L,qBAAqB/7L,KAAKi2L,aAAap2J,QAAQ,GACpDA,EAAOslC,KAAKnlE,KAAKi2L,aAAap2J,QAC9BkJ,EAAG/oC,KAAKi2L,aAAap2J,YAGzBg8J,GAAYr2J,mBAGVs6B,UAAU+yG,cAAca,MAC1B1zK,KAAKg2L,YAAYjhK,KACnB/0B,KAAKg8L,eAELh8L,KAAKw3L,OAASx3L,KAAKg2L,YAAYtxJ,GAAG,QAAQ,IAAM1kC,KAAKg8L,iBAGvDh8L,KAAKg2L,YAAY3e,SAASr3K,KAAKgrL,OAC/BhrL,KAAKgrL,MAAM3hH,OACXrpE,KAAKi8L,YAEDj8L,KAAK81I,SAASomD,cAChBl8L,KAAKg2L,YAAY5e,cAAa,CAAC+kB,EAAM3nJ,KACnCx0C,KAAK81I,SAASomD,aAAa7lJ,KAAO7B,KAKxCwgJ,eACEh1L,KAAK04L,wBAAwBr9C,YACzB3xE,SAAS0yH,yBAAyB1yH,SAAS2yH,uBAC/Cr8L,KAAKi2L,aAAaE,UAAU3wJ,UAC5BxlC,KAAKi2L,aAAanpJ,QAAQtH,UAC1BxlC,KAAKi2L,aAAap2J,QAAQ2F,UAC1BxlC,KAAKi2L,aAAapJ,OAAO7pL,SAAQ6hE,GAAQ3wB,IAAI4iE,gBAAgBjyC,KACzD7kE,KAAK81I,SAASomD,eAAcl8L,KAAK81I,SAASomD,aAAa7lJ,KAAO,IAClEr2C,KAAKg2L,iBAAc5tL,EACnBpI,KAAKgrL,MAAM2Q,OAAS,GAEpB37L,KAAKgrL,MAAMpuH,QACX58D,KAAKgrL,MAAMpzI,IAAM,GACjB53C,KAAKgrL,MAAM3hH,OACXrpE,KAAKw3L,YAASpvL,EACdshE,SAAS45D,MAAQtjI,KAAK86L,YAAYh7L,MAAQ,mBAC1CE,KAAK21L,YAAY,GAEjBnwL,OAAO+iB,OAAOvoB,KAAKi2L,aAAc,CAC/BpJ,MAAO,GACP1rE,QAAS,GACT+0E,OAAQ,GACRhvK,aAAS9e,EACT+tL,cAAU/tL,EACVy3B,YAAQz3B,EACR0kC,YAAQ1kC,EACRmrD,YAAQnrD,EACRurC,aAASvrC,IAGPpI,KAAK81I,SAAS+gD,WAChBrxL,OAAO+iB,OAAOvoB,KAAKi3L,cAAe,CAChCC,WAAY,GACZrlJ,cAAUzpC,EACV4iL,WAAO5iL,IAGXpI,KAAKs2L,WAAY,EACjBt2L,KAAK47L,mBAAmB,aAAc,IAClC57L,KAAK81I,SAASwmD,gBAAgBt8L,KAAK81I,SAASwmD,eAAepnD,aAAa,WAAY,IACxFl1I,KAAK47L,mBAAmB,iBAAkB,IAC1C57L,KAAK47L,mBAAmB,cAAe,IACnC57L,KAAK81I,SAASymD,cAAcv8L,KAAK81I,SAASymD,aAAarnD,aAAa,WAAY,IAChF8lD,eAAeA,cAAcC,UAAUvkL,IAAI,UAC3C,iBAAkBopD,YAAWA,UAAUo5H,aAAal0B,cAAW58J,GACnEpI,KAAK65L,IAAM,OAGb+B,mBAAoB5zL,EAAM4nH,GACxB,GAAI5vH,KAAK81I,SAAS9tI,GAChB,GAAIhI,KAAK81I,SAAS9tI,GAAM/F,cAAgBP,MACtC,IAAK,MAAM8wG,KAAWxyG,KAAK81I,SAAS9tI,GAClCwqG,EAAQgqF,YAAc5sE,OAGxB5vH,KAAK81I,SAAS9tI,GAAMw0L,YAAc5sE,EAKxCvnE,kBACE,UACQroD,KAAKgrL,MAAMj2C,OACjB/0I,KAAK47L,mBAAmB,YAAa,SACrC,MAAO7xL,GACP/J,KAAK47L,mBAAmB,YAAa,eAIzCnG,YACMz1L,KAAKgrL,MAAMrhD,OACb3pI,KAAKi8L,aAELj8L,KAAK47L,mBAAmB,YAAa,cACrC57L,KAAKgrL,MAAMpuH,SAIfq4H,UAAW15E,GACT,MAAMx0D,OAAmB3+C,IAAXmzG,EAAuBp8G,OAAOa,KAAK81I,SAASm/C,UAAUxzL,OAAS85G,EAC7Ev7G,KAAK81I,SAASm/C,UAAUxzL,MAAQslD,EAChC/mD,KAAK81I,SAASm/C,UAAUrrH,MAAM6yH,YAAY,iBAAkB11I,EAAQ,KACpE/mD,KAAK47L,mBAAmB,aAAwB,IAAV70I,EAAc,aAAe,aACnE/mD,KAAKgrL,MAAMzvE,OAASx0D,EAAQ,IAG9BwzI,aAC4B,IAAtBv6L,KAAKgrL,MAAMzvE,OACbv7G,KAAKi1L,UAAUj1L,KAAKk1L,YAEpBl1L,KAAKk1L,UAAgC,IAApBl1L,KAAKgrL,MAAMzvE,OAC5Bv7G,KAAKi1L,UAAU,IAInBuF,gBACEx6L,KAAK03L,cAAcuD,UAAUyB,OAAO,cAGtChH,mBACEhsH,SAASizH,kBAAoBjzH,SAASkzH,iBAAmB58L,KAAK23L,OAAOkF,oBAGvEjF,mBACE53L,KAAK47L,mBAAmB,mBAAoBlyH,SAASizH,kBAAoB,kBAAoB,cAG/FJ,eACEv8L,KAAKylC,KAAK,WAAY,CAAE8P,MAAOv1C,KAAKu5L,aAGtC7C,WACE/pJ,aAAa3sC,KAAKw2L,aAClBx2L,KAAKw2L,YAAcrxJ,YAAW,KAC5B,GAAInlC,KAAKu5L,YAAYnsK,QAAQptB,KAAKg2L,aAAeh2L,KAAKu5L,YAAYj4L,OAAS,EAAG,CAC5E,MAAMw5L,EAAa96L,KAAK86L,WACxBA,EAAWH,eAAiB,EAC5B,MAAM90H,EAAU7lE,KAAKg2L,YAAYzgB,SACjCv1K,KAAK88L,WAAWj3H,EAAS,CAAEg1H,MAAOC,EAAYj2H,KAAM7kE,KAAKu5L,WAAWv5L,KAAKu5L,WAAWnsK,QAAQptB,KAAKg2L,aAAe,UAEhHh2L,KAAKylC,KAAK,OAAQ,CAAEo/B,KAAM7kE,KAAKg2L,YAAa+G,UAAW/8L,KAAK86L,eAE7D,KAGLkC,WACErwJ,aAAa3sC,KAAKw2L,aAClBx2L,KAAKw2L,YAAcrxJ,YAAW,KAC5B,GAAInlC,KAAKu5L,YAAYnsK,QAAQptB,KAAKg2L,aAAc,CAC9C,MAAM8E,EAAa96L,KAAK86L,WACxBA,EAAWH,eAAiB,EAC5B,MAAM90H,EAAU7lE,KAAKg2L,YAAYzgB,SACjCv1K,KAAK88L,WAAWj3H,EAAS,CAAEg1H,MAAOC,EAAYj2H,KAAM7kE,KAAKu5L,WAAWv5L,KAAKu5L,WAAWnsK,QAAQptB,KAAKg2L,aAAe,UAEhHh2L,KAAKylC,KAAK,OAAQ,CAAEo/B,KAAM7kE,KAAKg2L,YAAa+G,UAAW/8L,KAAK86L,eAE7D,KAGLxC,aACMt4L,KAAKgrL,MAAMx0E,aACTx2G,KAAK04L,uBACP14L,KAAK04L,wBAAwBr9C,YAE7Br7I,KAAKu4L,oBAAoB1xL,SAK/B4xL,SAAU1nJ,GACR,IAAIoC,EAAO,IAAIrE,EAAK,CAAE6kJ,QAAQ,IAE9B3zL,KAAK04L,uBAAyB3nJ,EAAMksJ,WACpCj9L,KAAK04L,uBAAuB/hJ,iBAAiB,aAAa,KACxD32C,KAAK04L,uBAAyB,KAC9B14L,KAAK47L,mBAAmB,aAAc,QACtC57L,KAAK23L,OAAOsD,UAAU//H,OAAO,OAC7B/nB,EAAO,QAGTA,EAAK8gJ,cAAcp5C,UAAY,EAAGj6I,KAAAA,MAChCZ,KAAK04L,uBAAuBjjJ,KAAK70C,IAGnCZ,KAAK04L,uBAAuB/hJ,iBAAiB,WAAW,EAAG/1C,KAAAA,MACzDuyC,EAAK8gJ,cAAcn5C,YAAYl6I,MAGjCuyC,EAAK6gJ,GAAGxpC,OAASniG,UAEf,SADMroD,KAAK65L,IACP1mJ,GAAQnzC,KAAK04L,uBAAwB,CACvC14L,KAAK47L,mBAAmB,aAAc,kBACtC57L,KAAK23L,OAAOsD,UAAUvkL,IAAI,OAC1B,MAAMw/K,EAAS,GACTgH,EAAcl9L,KAAKgrL,MAAMmS,gBAC/B,GAAIn9L,KAAK+4L,OAAQ,CACf,MAAM,OAAEl5J,EAAM,QAAE2F,SAAkBxlC,KAAKo9L,WAAWp9L,KAAKi2L,aAAaE,UACpED,EAAOnxL,KAAK86B,EAAOw9J,iBAAiB,GAAIH,EAAYI,iBAAiB,IACrEt9L,KAAK04L,uBAAuB/hJ,iBAAiB,YAAanR,QAE1D0wJ,EAAOnxL,KAAKm4L,EAAYG,iBAAiB,GAAIH,EAAYI,iBAAiB,IAE5E,IAAK,MAAMx2L,KAASovL,EAClB/iJ,EAAKugJ,GAAG5pC,SAAShjJ,EAAOo2L,GAE1Bl9L,KAAKgrL,MAAMj2C,SAKjB1sF,qBACE,GAAIroD,KAAKgrL,MAAMx0E,WACb,GAAIx2G,KAAK+4L,OAEP,SADM/4L,KAAK65L,IACN75L,KAAKi2L,aAAaE,SAGrB,GAAIzsH,SAAS0yH,0BAA4B1yH,SAAS0yH,wBAAwB9tL,GACxEo7D,SAAS2yH,2BACJ,CACL,MAAMkB,EAAc7zH,SAASstC,cAAc,UACrC,OAAEn3E,EAAM,QAAE2F,SAAkBxlC,KAAKo9L,YACvCG,EAAYC,UAAY39J,EACxB09J,EAAYE,iBAAmB,KAC7BF,EAAYxoD,OACZwoD,EAAYG,0BAA0BtyK,KACpCprB,KAAK23L,OAAOsD,UAAUvkL,IAAI,QAC1B2U,OAAM3kB,IACN,EAAQkjB,KAAK,+BAAiCljB,GAC9C8+B,IACA+3J,EAAYriI,SACZl7D,KAAK23L,OAAOsD,UAAU//H,OAAO,WAGjCqiI,EAAYI,wBAA0B,KACpCn4J,IACA+3J,EAAYriI,SACZl7D,KAAK23L,OAAOsD,UAAU//H,OAAO,aAtBjCl7D,KAAKgrL,QAAUthH,SAAS0yH,wBAA0Bp8L,KAAKgrL,MAAM0S,0BAA4Bh0H,SAAS2yH,4BA2BpGr8L,KAAKgrL,QAAUthH,SAAS0yH,wBAA0Bp8L,KAAKgrL,MAAM0S,0BAA4Bh0H,SAAS2yH,uBAKxGh0I,gBAAiBu1I,GACf,MAAMrT,EAAS7gH,SAASstC,cAAc,UAChC5b,EAAUmvF,EAAO+C,WAAW,KAAM,CAAE58F,OAAO,IAC3CmpG,QAAY75L,KAAK65L,IACvB,IAAIgE,EAAO,KACPr4J,EAAU,KAGd,GAFA+kJ,EAAO11K,MAAQ7U,KAAKgrL,MAAMkE,WAC1B3E,EAAO7tE,OAAS18G,KAAKgrL,MAAMqE,YACvB,8BAA+B8F,iBAAiBl1L,UAAW,CAC7D,MAAM69L,EAAcz1I,UAClB+yC,EAAQ6yF,UAAUjuL,KAAKgrL,MAAO,EAAG,GAC5B4S,GAAQxiG,EAAQ6yF,UAAUjuL,KAAKi2L,aAAaE,UAAU5L,OAAQ,EAAG,EAAGA,EAAO11K,MAAO01K,EAAO7tE,QAC9FmhF,EAAO79L,KAAKgrL,MAAMoP,0BAA0B0D,IAE9CD,EAAO79L,KAAKgrL,MAAMoP,0BAA0B0D,GAC5Ct4J,EAAU,KACRxlC,KAAKgrL,MAAM+S,yBAAyBF,GACpCtT,EAAOrvH,cAEJ,CAEL,MAAM4iI,EAAc,KAClB1iG,EAAQ6yF,UAAUjuL,KAAKgrL,MAAO,EAAG,GAC5B4S,GAAQxiG,EAAQ6yF,UAAUjuL,KAAKi2L,aAAaE,UAAU5L,OAAQ,EAAG,EAAGA,EAAO11K,MAAO01K,EAAO7tE,QAC9FmhF,EA7pBR,SAAyB/8J,EAAUk9J,GACjC,MAAMC,EAAYhxL,KAAKnD,MACvB,IAAIo0L,EAAiBnN,uBACrB,SAASz/B,IACHrkJ,KAAKnD,MAAQm0L,GAAaD,EAC5Bl9J,IAEAo9J,EAAiBnN,sBAAsBz/B,MAG3C,MAAO,CACLzyJ,MAAO,IAAMs/L,qBAAqBD,IAkpBvB1pC,CAAespC,EAAa,IAAMjE,IAE3CgE,EAAO9M,sBAAsB+M,GAC7Bt4J,EAAU,KAjpBhB,IAAwBmO,GAAAA,EAkpBFkqJ,IAhpBlBlqJ,EAAQ90C,QAipBJ0rL,EAAOrvH,UAGX,MAAO,CAAEr7B,OAAQ0qJ,EAAO4S,gBAAiB33J,QAAAA,GAG3C44J,KAAMpxL,EAAKqxL,GACT,GAAI5oK,MAAMzoB,IAAQA,EAAM,EACtB,OAAOqxL,EAAO,aAAe,QAE/B,MAAMC,EAAQxtL,KAAK6gB,MAAM3kB,EAAM,MAC/B,IAAIuxL,EAAUztL,KAAK6gB,MAAM3kB,EAAM,IAAe,GAARsxL,EAClCvtF,EAAUstF,GAAQrxL,EAAM,IAAImtL,QAAQ,GAAKrpL,KAAK6gB,MAAM3kB,EAAM,IAG9D,OAFIuxL,EAAU,KAAIA,EAAU,IAAMA,GAC9BxtF,EAAU,KAAIA,EAAU,IAAMA,GAC1ButF,EAAQ,GAAKD,EAAQC,EAAQ,IAAMC,EAAU,IAAMxtF,EAAUwtF,EAAU,IAAMxtF,EAGvFytF,YAAa54L,GACX,GAAI6vB,MAAM7vB,GAAM,MAAO,MACvB,GAAIA,EAAM,EAAG,OAAOA,EAAM,KAC1B,MAAM64L,EAAW3tL,KAAK/D,IAAI+D,KAAK6gB,MAAM7gB,KAAK+gB,IAAIjsB,GAAOkL,KAAK+gB,IAAI,MAAQkiC,EAAMzyD,OAAS,GACrF,OAAOnC,QAAQyG,EAAMkL,KAAKoB,IAAI,IAAMusL,IAAWtE,QAAQ,IAAMpmI,EAAM0qI,GAGrEjmJ,SAAUnvC,GACR,MACMiE,EAAQjE,EAAIiE,MAAM,KACxB,OAAOA,EAAM,GAAK,OAFJ,CAAC,IAAK,MAAO,MAAO,MAAO,MAAO,QAAS,KAAM,KAAM,KAAM,MAE1C8f,QAAQ9f,EAAM,IAAM,KAAO,GAG9D4hK,KAAMzgK,GACS,KAATA,GAAezO,KAAKgrL,MAAMtzE,YAAc,GAC1C13G,KAAKgrL,MAAMtzE,YAAc,GACP,KAATjpG,GAAgBzO,KAAKgrL,MAAMvrH,SAAWz/D,KAAKgrL,MAAMtzE,YAAe,GACzE13G,KAAKgrL,MAAMtzE,YAAc13G,KAAKgrL,MAAMvrH,SAEpCz/D,KAAKgrL,MAAMtzE,aAAejpG,EAE5BzO,KAAK21L,YAAY31L,KAAKgrL,MAAMtzE,YAAc13G,KAAKgrL,MAAMvrH,SAAW,KAGlEi/H,UACE1+L,KAAKkvK,KAAKlvK,KAAKi5L,UAGjB0F,SACE3+L,KAAKkvK,MAAMlvK,KAAKi5L,UAGlBnB,gBACE93L,KAAK23L,OAAOsD,UAAUvkL,IAAI,YAC1B1W,KAAK81L,oBAAiB1tL,EAGxByvL,eACM73L,KAAK81L,eACPnpJ,aAAa3sC,KAAK81L,gBAElB91L,KAAK23L,OAAOsD,UAAU//H,OAAO,YAE/Bl7D,KAAK81L,eAAiB3wJ,YAAW,IAAMnlC,KAAK83L,iBAAoC,IAAnB93L,KAAKy3L,aAGpES,gBACMl4L,KAAKi4L,gBACPtrJ,aAAa3sC,KAAKi4L,eAClBj4L,KAAKi4L,mBAAgB7vL,EACrBpI,KAAK23L,OAAOsD,UAAU//H,OAAO,cAIjCi9H,gBACEn4L,KAAKi4L,cAAgB9yJ,YAAW,KAC9BnlC,KAAK23L,OAAOsD,UAAUvkL,IAAI,aAC1B1W,KAAK63L,iBACJ,KAGLtB,mBACOv2L,KAAKs2L,WAAat2L,KAAKgrL,MAAMvrH,SAAW,IAAMz/D,KAAKgrL,MAAMtzE,cAC5D13G,KAAKs2L,WAAY,EACjBt2L,KAAKylC,KAAK,UAAW,CAAEo/B,KAAM7kE,KAAKg2L,YAAa+G,UAAW/8L,KAAK86L,cAInE1B,sBACMp5L,KAAKgrL,MAAMvrH,UACbK,UAAUo5H,aAAa0F,iBAAiB,CACtCn/H,SAAUz/D,KAAKgrL,MAAMvrH,UAAY,EACjCszH,aAAc/yL,KAAKgrL,MAAM+H,cAAgB,EACzCn6J,SAAU54B,KAAKgrL,MAAMtzE,aAAe,IAK1Cy/E,gBACE,MAAMz6E,EAAS18G,KAAKi3L,cAAc1M,OAAO11K,OAAS7U,KAAKgrL,MAAMkE,WAAalvL,KAAKgrL,MAAMqE,aACrFrvL,KAAKi3L,cAAcplJ,SAAW7xC,KAAKgrL,MAAMvrH,SAAW,IAAM,EAAI,EAAIz/D,KAAKgrL,MAAMvrH,SAAW,IACxFz/D,KAAKi3L,cAAc1M,OAAO7tE,OAASA,EACnC18G,KAAK81I,SAAS+gD,UAAUjtH,MAAM6yH,YAAY,SAAU//E,EAAS,MAG/D06E,gBAAiBpM,GACf,GAAIA,GAAOx0E,YAAc,EAAG,CAC1B,MAAM5sG,EAAQkH,KAAK6gB,MAAMq5J,EAAMtzE,YAAc13G,KAAKi3L,cAAcplJ,UAC3D7xC,KAAKi3L,cAAcC,WAAWttL,KACjC5J,KAAKi3L,cAAc77F,QAAQyjG,SAAS,EAAG,EAAG,IAAK7+L,KAAKi3L,cAAc1M,OAAO7tE,QACzE18G,KAAKi3L,cAAc77F,QAAQ6yF,UAAUjD,EAAO,EAAG,EAAG,IAAKhrL,KAAKi3L,cAAc1M,OAAO7tE,QACjF18G,KAAKi3L,cAAcC,WAAWttL,GAAS5J,KAAKi3L,cAAc1M,OAAOuU,UAAU,gBAKjFC,iBAAkBnnJ,GAChB,MAAM0B,EAAKs3I,YAAY9mL,MACjBkhL,EAAQthH,SAASstC,cAAc,SACrC,IAAIptG,EAAQ,EACZohL,EAAMna,QAAU,OAChBma,EAAMzvE,OAAS,EACfyvE,EAAM+H,aAAe,EACrB/H,EAAMr0I,iBAAiB,cAAc,IAAMqoJ,MAC3ChU,EAAMr0I,iBAAiB,WAAW,KAChC32C,KAAKo3L,gBAAgBp3L,KAAKi3L,cAAcjM,OACxCgU,OAEFh/L,KAAKi3L,cAAcjM,MAAQA,EAC3B,MAAMgU,EAAW,KACf,KAAOh/L,KAAKi3L,cAAcC,WAAWttL,IAAUA,GAASkH,KAAK6gB,MAAM3xB,KAAKi3L,cAAcjM,MAAMvrH,SAAWz/D,KAAKi3L,cAAcplJ,WACxHjoC,IAEE5J,KAAKi3L,cAAcjM,OAAOtzE,cAAgB13G,KAAKi3L,cAAcjM,OAAOvrH,SACtEz/D,KAAKi3L,cAAcjM,MAAMtzE,YAAc9tG,EAAQ5J,KAAKi3L,cAAcplJ,UAElE7xC,KAAKi3L,cAAcjM,OAAOsK,gBAAgB,OAC1Ct1L,KAAKi3L,cAAcjM,OAAO3hH,OAC1BrpE,KAAKi3L,cAAcjM,OAAO9vH,gBACnBl7D,KAAKi3L,cAAcjM,MAC1B,EAAQn5J,IAAI,8BAA+BjoB,EAAO5J,KAAKo+L,MAAMxN,YAAY9mL,MAAQwvC,GAAM,OAEzF1vC,KAEF5J,KAAKi3L,cAAcjM,MAAMpzI,IAAMA,EAC/B53C,KAAKi3L,cAAcjM,MAAMj2C,OACzB,EAAQljH,IAAI,8BAGd+jK,WAAYqJ,GACVj/L,KAAKgrL,MAAMtzE,YAAc13G,KAAKgrL,MAAMvrH,SAAWw/H,EAAkB,KAAO,EACxEj/L,KAAKi8L,YAGPpG,aAAcoJ,GACZj/L,KAAKgrL,MAAMpuH,QACX58D,KAAK21L,YAAYsJ,GAGnBtJ,YAAasJ,GACXA,EAAkBA,GAAmB,EACrC,MAAMvnF,EAAc13G,KAAKgrL,MAAMvrH,SAAWw/H,EAAkB,KAAO,EAC/Dj/L,KAAK81I,SAASopD,iBAAiBl/L,KAAK81I,SAASopD,gBAAgBt1H,MAAM6yH,YAAY,aAAcwC,EAAkB,KAC/Gj/L,KAAK81I,SAAS+gD,YAAW72L,KAAK81I,SAAS+gD,UAAUj/I,IAAM53C,KAAKi3L,cAAcC,WAAWpmL,KAAK6gB,MAAM+lF,EAAc13G,KAAKi3L,cAAcplJ,YAAc,KAC/I7xC,KAAK81I,SAAS6/C,cAChB31L,KAAK81I,SAAS6/C,YAAYwJ,QAAQC,QAAUp/L,KAAKo+L,KAAK1mF,GACtD13G,KAAK81I,SAAS6/C,YAAYl0L,MAAQw9L,GAEhCj/L,KAAK81I,SAASopD,kBAChBl/L,KAAK81I,SAASopD,gBAAgBC,QAAQC,QAAUp/L,KAAKo+L,KAAK1mF,GAC1D13G,KAAK81I,SAASopD,gBAAgBC,QAAQ9rI,UAAYrzD,KAAKo+L,KAAKp+L,KAAKgrL,MAAMvrH,SAAWi4C,IAItF8hF,gBACMx5L,KAAKg2L,aAAeh2L,KAAKg2L,YAAYzgB,WACnCv1K,KAAK23L,QAAQ33L,KAAK23L,OAAO/tH,MAAM6yH,YAAY,aAA0C,IAA5Bz8L,KAAKg2L,YAAY7hB,SAAiB,KAC3Fn0K,KAAK81I,SAAS3jG,QAAOnyC,KAAK81I,SAAS3jG,MAAMgtJ,QAAQ19L,MAAQzB,KAAKg2L,YAAYzgB,SAAS2H,UACnFl9K,KAAK81I,SAASupD,YAAWr/L,KAAK81I,SAASupD,UAAUF,QAAQ19L,MAAQzB,KAAKw+L,YAAYx+L,KAAKg2L,YAAYzgB,SAASzyI,eAAiB,MAC7H9iC,KAAK81I,SAASwpD,UAASt/L,KAAK81I,SAASwpD,QAAQH,QAAQ19L,MAAQzB,KAAKw+L,YAAYx+L,KAAKg2L,YAAYzgB,SAAS1yI,aAAe,OAE7HsC,YAAW,IAAM4rJ,uBAAsB,IAAM/wL,KAAKw5L,mBAAkB,KAGtEjE,mBAAoBzuL,EAAOkB,GAEzB,GAAc,aAATA,GAAuBhI,KAAK81I,SAASypD,gBAAkBv/L,KAAK81I,SAASwmD,gBAA6B,UAATt0L,GAAoBhI,KAAK81I,SAAS0pD,YAAc,CAC5I,MAAM/vB,EAAO/lG,SAAS+1H,yBAChB15L,EAAQ2jE,SAASstC,cAAc,SAC/BzpG,EAAQm8D,SAASstC,cAAc,SACrCjxG,EAAMjG,KAAO,GAAGkI,cAChBjC,EAAMiC,KAAO,QACbjC,EAAMuI,GAAc,aAATtG,EAAsB,GAAGA,KAAQlB,EAAQA,EAAMgJ,OAAS,cAAgB,GAAG9H,KAAQlB,EAAMwH,WACpGvI,EAAMtE,MAAiB,aAATuG,EAAsBlB,EAAQA,EAAMgJ,QAAU,EAAIhJ,EAAMwH,GACtEvI,EAAM4rD,QAAmB,aAAT3pD,EAAsBlB,GAAOgJ,SAAW9P,KAAKi2L,aAAa/uK,QAAUpgB,EAAM4jE,QAC1Fn9D,EAAMmyL,QAAmB,aAAT13L,EAAsB,GAAGA,KAAQlB,EAAQA,EAAMgJ,OAAS,cAAgB,GAAG9H,KAAQlB,EAAMwH,WACzGf,EAAMivL,YAAc11L,EACP,aAATkB,GACKlB,EAAM60G,WAAcn2G,OAAO2G,OAAOnM,KAAKi2L,aAAa90E,SAASr5G,MAAKoG,GAA8B,QAApBA,EAAOytG,UAA0C,OAApBztG,EAAOytG,WAA6B70G,EAAMkB,KAAd,SAAwBlB,EAAMhH,KAAO,MAAQgH,EAAMhH,KAAO,KAC/LgH,EAAM60G,WAAcn2G,OAAO2G,OAAOnM,KAAKgrL,MAAMqK,aAAavtL,MAAKhB,GAA4B,QAAnBA,EAAM60G,UAAyC,OAAnB70G,EAAM60G,WAA6B70G,EAAMyG,MAAd,SAAyBzG,EAAMyG,MAAQ,MAAQzG,EAAMyG,MAAQ,IACjM,MACJkiK,EAAKp8B,OAAOttI,GACZ0pK,EAAKp8B,OAAO9lI,GACC,aAATvF,GACFhI,KAAK81I,SAASypD,eAAelsD,OAAOo8B,GACpCzvK,KAAK81I,SAASwmD,eAAehH,gBAAgB,aAE7Ct1L,KAAK81I,SAAS0pD,YAAYnsD,OAAOo8B,IAKvC+vB,YAAalxL,GACX,QAAWlG,IAAPkG,EAAkB,CACpB,IAAK,MAAMxH,KAAS9G,KAAKgrL,MAAMqK,YAC7BvuL,EAAM4jE,QAAU5jE,EAAMwH,KAAOA,EAE/BtO,KAAKkvK,MAAM,KAIfqwB,eAAgBI,QACMv3L,IAAhBu3L,IACFA,EAAcxgM,OAAOwgM,GACrB3/L,KAAKi2L,aAAa/uK,QAAUy4K,EACvB3/L,KAAKi2L,aAAatiJ,UACrB3zC,KAAKi2L,aAAatiJ,QAAUxO,YAAW,KACrCnlC,KAAKi2L,aAAatiJ,aAAUvrC,EACxBpI,KAAKi2L,aAAaE,UACpBn2L,KAAKi2L,aAAaE,SAAStD,UAA0B,IAAjB8M,EAAqB3/L,KAAKi2L,aAAa90E,QAAQw+E,GAAazxL,OAAOtL,MAAM,GAAI,GAAKlB,MAAMmM,KAAK7N,KAAKi2L,aAAaC,OAAOyJ,IAAc98L,KAAK,MAAQ7C,KAAKi2L,aAAaG,iBAExM,OAKTwJ,aAAcra,EAAUsa,GACtB,IAAiB,IAAbA,EAAmB,CACrB,MAAM7wE,EAAUu2D,EAAS31D,KAAK/nH,MAAM,YAChCmnH,GACFA,EAAQhsH,SAAQ6E,IACV,MAAMR,KAAKQ,GACb09K,EAAS31D,KAAO21D,EAAS31D,KAAKhiH,QAAQ/F,EAAOA,EAAM+F,QAAQ,KAAM,OAAOA,QAAQ,IAAK,OAErF23K,EAAS31D,KAAO21D,EAAS31D,KAAKhiH,QAAQ/F,EAAOA,EAAM+F,QAAQ,IAAK,OAAOA,QAAQ,IAAK,UAK1F23K,EAAS31D,KAAKhiH,QAAQ,SAAU,KAAKA,QAAQ,QAAS,KAAKA,QAAQ,QAAS,KAAKA,QAAQ,UAAW,OAEtG,MAAO,cACN23K,EAASlqE,OAAS,GAAK,IACxBr7G,KAAKo+L,KAAK7Y,EAAS92K,KAAO,KAAM,GAAQ,IACxCzO,KAAKo+L,MAAM7Y,EAAS92K,KAAO82K,EAAS9lH,UAAY,KAAM,GAAQ,KAC7D8lH,EAAS37G,OAAS,WAAa,KAC/B27G,EAASzlL,MAAQ,IAAM,KACvBylL,EAASua,SAAW,KAAO,KAC3Bva,EAASwa,SAAW,KAAO,KAC3Bxa,EAASya,SAAW,KAAO,KAC3Bza,EAAS0a,QAAU,IAAM,IAC1B1a,EAAS31D,MAAQ,EAGnBswE,eAAgBr7H,EAAMs7H,GACpB,OAAO,IAAI30K,SAASC,IAClB,GAAIo5C,EAAK/kE,KAAKqvB,SAAS,QAAS,CAC9B,IAAI2d,EAAS,IAAI24I,EACjBzlL,KAAK+7L,qBAAqBjvJ,EAAQqzJ,GAClC,MAAMzyD,EAAS,KACb,EAAQ77G,IAAI,uBAAwB7xB,KAAKo+L,MAAMxN,YAAY9mL,MAAQwvC,GAAM,MACzEt5C,KAAKi2L,aAAa1iI,QAAS,EAC3BvzD,KAAKi2L,aAAap2J,QAAQ2F,UAC1BxlC,KAAKi2L,aAAanpJ,QAAQtH,UAC1BqnI,GAAYrnI,UACZxlC,KAAKi2L,aAAap2J,YAASz3B,EAC3BpI,KAAKi2L,aAAanpJ,YAAS1kC,EAC3BpI,KAAKu/L,eAAev/L,KAAKi2L,aAAa/uK,SACtC4lB,OAAS1kC,EACJpI,KAAKgrL,MAAMrhD,SACd3pI,KAAKgrL,MAAMpuH,QACX58D,KAAKi8L,aAEPxwK,KAEFqhB,EAAOtI,KAAK,UAAU0xJ,IACfA,EAAO50L,QAAQosI,OAEtB5gG,EAAOtI,KAAK,SAAUkpG,GACtB,MAAMp0F,EAAKs3I,YAAY9mL,MACvB,EAAQ+nB,IAAI,uBACZ,MAAMg7I,EAAahoG,EAAKywE,mBACxBt1I,KAAKi2L,aAAanpJ,OAAS+/H,EAAW1nG,KAAKr4B,QAE3CrhB,OAKNqwK,WAAYj3H,GACV,OAAO,IAAIr5C,SAAQC,IACjB,MAAMoU,EAAS7/B,KAAKi2L,aAAap2J,OAAS,IAAI4lJ,EAC9CzlL,KAAK+7L,qBAAqB/7L,KAAKi2L,aAAap2J,QAC5CA,EAAO2E,KAAK,UAAU0xJ,IACfA,EAAO50L,SACVtB,KAAKi2L,aAAa1iI,QAAS,EAC3B9nC,IACAzrB,KAAKi2L,aAAap2J,OAAO2F,UACzB46J,EAAiB56J,cAGrB3F,EAAO6E,GAAG,YAAY,KACpBjZ,IACA20K,EAAiB56J,aAEnB,MAAM46J,EAAmBv7H,EAAKywE,iBAAiB,CAAE5nI,IAAKm3D,EAAKvjE,OAAS,IACpE8+L,EAAiBj7H,KAAKtlC,MAI1Bk8J,qBAAsBjvJ,EAAQuzJ,GAC5BvzJ,EAAOtI,KAAK,UAAU0xJ,IACfA,EAAO50L,OAGV40L,EAAOlzL,SAAQ8D,IACR9G,KAAKi2L,aAAaC,OAAOpvL,EAAMgJ,UAEf,QAAfhJ,EAAMkB,OAAgBlB,EAAMoH,OAASlO,KAAKi2L,aAAaG,eACtDp2L,KAAKi2L,aAAa/uK,UACrBlnB,KAAKi2L,aAAa/uK,QAAUpgB,EAAMgJ,OAClC9P,KAAKu1L,wBAAmBntL,EAAW,aAErCpI,KAAKi2L,aAAaC,OAAOpvL,EAAMgJ,QAAU,IAAIkqB,IAC7Ch6B,KAAKi2L,aAAa90E,QAAQr6G,EAAMgJ,QAAUhJ,EAC1C9G,KAAKu1L,mBAAmBzuL,EAAO,gBAZnC9G,KAAKi2L,aAAa1iI,QAAS,KAiB/BzmB,EAAOpI,GAAG,YAAY,CAAC6gJ,EAAUoa,KAC1B3/L,KAAKi2L,aAAa1iI,SAChBvzD,KAAKi2L,aAAaE,UAAUn2L,KAAKsgM,uBACtCtgM,KAAKi2L,aAAaC,OAAOyJ,GAAajpL,IAAI1W,KAAK4/L,aAAara,EAA0D,QAAhDvlL,KAAKi2L,aAAa90E,QAAQw+E,GAAa33L,OACzGhI,KAAKi2L,aAAa/uK,UAAYy4K,GAAa3/L,KAAKu/L,eAAeI,OAGlEU,GACHvzJ,EAAOpI,GAAG,QAAQmgC,IACM,gCAAlBA,EAAK2gH,UAAgE,0BAAlB3gH,EAAK2gH,UAA0D,gCAAlB3gH,EAAK2gH,UACvGxlL,KAAKi2L,aAAapJ,MAAM9nL,KAAKmvC,IAAI0hE,gBAAgB,IAAIp/D,KAAK,CAACquB,EAAKjkE,MAAO,CAAEoH,KAAM68D,EAAK2gH,gBAM5Fn9H,6BACE,IAAKroD,KAAKi2L,aAAaE,SAAU,CAC/B,MAAMt1L,EAAU,CACdmqL,MAAOhrL,KAAKgrL,MACZL,gBAAiB3qL,KAAK65L,IACtBnN,WAAY1sL,KAAKi2L,aAAa90E,QAAQnhH,KAAKi2L,aAAa/uK,SAAShZ,OAAOtL,MAAM,GAAI,GAClF4nL,WAAY,YACZqC,MAAO7sL,KAAKi2L,aAAapJ,MACzBF,aAAc,wEACd5vC,UAAW,kCACXw3B,QAAS,KACFv0K,KAAKgrL,MAAMrhD,SACd3pI,KAAKgrL,MAAMpuH,QACX58D,KAAKi8L,eAINj8L,KAAKi2L,aAAaE,WACrBn2L,KAAKi2L,aAAaE,SAAW,IAAI7L,EAAiBzpL,GAClDb,KAAKu/L,eAAev/L,KAAKi2L,aAAa/uK,WAK5Cq5K,eAAgB17H,EAAM27H,EAAO1/J,GAC3B,MAAM4vE,EAAQ,2DACd7rC,EAAKqjE,WAAU,CAACi0D,EAAM5wL,KACpB,MAAMk1L,EAAYD,EAAQj1L,EAAOU,WAAa,GAC9C,GAAIu0L,EACF1/J,EAAS2/J,OACJ,CACL,MAAM7wE,EAAOrkH,EAAOU,WAAW2B,QAAQ,MAAO,IAC9C,IAAK,MAAMN,KAASsiH,EAAKtiH,MAAM,QAAS,CACtC,MAAMzF,EAAQyF,EAAMzF,MAAM6oG,GAC1B,GAAI7oG,EAAO,CACTA,EAAM,GAAKA,EAAM,GAAGA,MAAM,eAAe,GACzCA,EAAM,GAAKA,EAAM,GAAGA,MAAM,eAAe,GACjB,IAApBA,EAAM,GAAGvG,OACXuG,EAAM,GAAK,KAAOA,EAAM,GAEJ,MAAhBA,EAAM,GAAG,KACXA,EAAM,GAAKA,EAAM,GAAGynB,UAAU,IAGlCznB,EAAM,GAAG+F,QAAQ,IAAK,KACE,IAApB/F,EAAM,GAAGvG,OACXuG,EAAM,GAAK,KAAOA,EAAM,GAEJ,MAAhBA,EAAM,GAAG,KACXA,EAAM,GAAKA,EAAM,GAAGynB,UAAU,IAGlCznB,EAAM,GAAG+F,QAAQ,IAAK,KACtB,MAAMohH,EAAUnnH,EAAM,GAAGA,MAAM,YAC3BmnH,GACFA,EAAQhsH,SAAQ09L,IACV,MAAMr5L,KAAKq5L,GACb74L,EAAM,GAAKA,EAAM,GAAG+F,QAAQ8yL,EAASA,EAAQ9yL,QAAQ,KAAM,OAAOA,QAAQ,IAAK,OAE/E/F,EAAM,GAAKA,EAAM,GAAG+F,QAAQ8yL,EAASA,EAAQ9yL,QAAQ,IAAK,OAAOA,QAAQ,IAAK,UAIpF6yL,EAAU17L,KAAK,eAAiB8C,EAAM,GAAG+F,QAAQ,IAAK,KAAO,IAAM/F,EAAM,GAAG+F,QAAQ,IAAK,KAAO,oBAAsB/F,EAAM,KAGhIi5B,EAAS2/J,OAKf1K,kBAAmB4K,GACjB,MAAM55L,EAAO45L,EAAW55L,KAAKuG,MAAMqzL,EAAW7gM,MAAM,GAE9C8gM,EAAgBD,EAAWprB,SAAShgI,MAAMpwC,QAAO0/D,GAC9C7kE,KAAKq5L,mBAAmBvxL,MAAK+9B,GAAOg/B,EAAK/kE,KAAKqvB,SAAS0W,OAAqC,IAA3B7lC,KAAKu5L,WAAWj4L,QAAuD,IAAjCujE,EAAK99D,KAAKuG,MAAMvG,GAAMzF,UAEtI,GAAIs/L,EAAct/L,OAAQ,CACxBtB,KAAKu1L,wBAAmBntL,EAAW,YACnCpI,KAAKi2L,aAAa1iI,QAAS,EAC3BvzD,KAAKi2L,aAAa/uK,QAAU,EAC5B,IAAK,MAAOtd,EAAOi7D,KAAS+7H,EAAczkF,UAAW,CACnD,MAAMqkF,EAAQ37H,EAAK/kE,KAAKqvB,SAAS,SAAW01C,EAAK/kE,KAAKqvB,SAAS,QACzD0xK,EAAY,WACZ/gM,EAAO+kE,EAAK/kE,KAAK8N,QAAQ+yL,EAAW7gM,KAAM,MAAQ+kE,EAAK/kE,KACzD+kE,EAAK/kE,KAAK8N,QAAQ+yL,EAAW7gM,KAAK8N,QAAQizL,EAAW,IAAK,IAAIj+L,MAAM,GAAI,GAAGgL,QAAQ,UAAW,KAAK0nD,OACnGuP,EAAK/kE,KAAK8N,QAAQ+yL,EAAW7gM,KAAM,IAAI8C,MAAM,GAAI,GAAGgL,QAAQ,UAAW,KAAK0nD,OAC1EpnD,EAAS,CACbA,OAAQlO,KAAKi2L,aAAaG,cAC1Bz6E,SAAU77G,EACVgQ,OAAQlG,EACR5B,KAAM68D,EAAK/kE,KAAK+H,MAAMg5L,GAAW,IAEnC7gM,KAAKi2L,aAAa90E,QAAQp8G,KAAKmJ,GAC/BlO,KAAKi2L,aAAaC,OAAOtsL,GAAS,GAClC5J,KAAKu1L,mBAAmBrnL,EAAQ,YAChClO,KAAKugM,eAAe17H,EAAM27H,GAAOC,IAC3BD,EACFxgM,KAAKi2L,aAAa90E,QAAQv3G,GAAOsE,OAASuyL,EAE1CzgM,KAAKi2L,aAAaC,OAAOtsL,GAAS62L,EAEhCzgM,KAAKi2L,aAAa/uK,UAAYtd,GAAO5J,KAAKu/L,eAAev/L,KAAKi2L,aAAa/uK,YAEjFlnB,KAAKsgM,yBAKXtE,eACEh8L,KAAKylC,KAAK,gBAAiB,CAAEo/B,KAAM7kE,KAAKg2L,cACxCh2L,KAAKkgM,eAAelgM,KAAKg2L,aAAa,GAAM5qK,MAAK,KAC3CprB,KAAK82L,oBACP92L,KAAK++L,iBAAiB/+L,KAAKgrL,MAAMpzI,QAKvCkpJ,YAAapH,EAAWz6J,EAAO,IAC7B,MAAM8hK,EAAgB,CAACl7H,EAAS5mC,KAC9B4mC,EAAQnhC,GAAG,WAAW,KACpB1kC,KAAKylC,KAAK,WAAYogC,MAEpB7lE,KAAK45L,mBACP/zH,EAAQtwB,MAAMvyC,SAAQ6hE,GAAQA,EAAKoxG,aACnCpwG,EAAQowG,SAAS,EAAGpwG,EAAQQ,OAAO/kE,OAAS,GAAG,IAEjDtB,KAAKu5L,WAAa1zH,EAAQtwB,MAAMpwC,QAAO0/D,GAAQ7kE,KAAKs5L,gBAAgBxxL,MAAK+9B,GAAOg/B,EAAK/kE,KAAKqvB,SAAS0W,OACnG7lC,KAAKylC,KAAK,cAAe,CAAE8P,MAAOv1C,KAAKu5L,WAAY1zH,QAASA,IACxD7lE,KAAKu5L,WAAWj4L,OAAS,GAC3BukE,EAAQtwB,MAAMvyC,SAAQ6hE,GAAQA,EAAKoxG,aAEjCj2K,KAAKu5L,WACPv5L,KAAK88L,WAAWj3H,EAAS5mC,IAEzBj/B,KAAKylC,KAAK,UAAWogC,GACrB7lE,KAAKghM,oBAGTt3H,SAAS74B,SAAS6S,KAAO,UACzB1jD,KAAKg1L,eACLh1L,KAAKghM,kBACDtH,aAAqBl0L,OACvBu7L,EAAcrH,EAAWz6J,GAChBj/B,KAAKZ,IAAIs6L,GAClBqH,EAAc/gM,KAAKZ,IAAIs6L,GAAYz6J,GAEnCj/B,KAAK0W,IAAIgjL,EAAW,CAClB1d,sBAAuBh8K,KAAKs/K,aAC5B/C,UAAWv8K,KAAKu8K,UAChBT,gBAAiB,EACjBhhH,MAAO0uH,EACPn6I,SAAUrvC,KAAKixC,QAAQ5B,UAAY,CACjC,mCACA,2DACA,8CAEDw2B,IACDk7H,EAAcl7H,EAAS5mC,MAM7B+hK,kBAEEhhM,KAAKqyK,SAASltK,QAAO0gE,IAAY7lE,KAAKy5L,gBAAgB5zH,EAAQj/B,YAAW5jC,SAAQ6iE,GAAWA,EAAQrgC,YAItGm0J,gBAAiBD,GACf,MAAM7zH,EAAU7lE,KAAK0W,IAAIgjL,EAAW,CAClCnd,UAAWv8K,KAAKu8K,UAChBzhH,MAAO0uH,EACP1N,gBAAiB,EACjBzsI,SAAUrvC,KAAKixC,QAAQ5B,UAAY,CACjC,mCACA,2DACA,8CAGJw2B,EAAQnhC,GAAG,YAAY,KAChB1kC,KAAKy5L,gBAAgB5zH,EAAQj/B,YAChC5mC,KAAKy5L,gBAAgB5zH,EAAQj/B,UAAYllC,MAAMmM,KAAKg4D,EAAQu3G,aAC5DnzG,aAAad,QAAQ,kBAAmBvgE,KAAKC,UAAU7I,KAAKy5L,mBAE9Dz5L,KAAKylC,KAAK,kBAAmBogC,OCvsCnC,MAAM,EAA+Bo7H,gCCErC,cAAqB3yL,IACnB,MAAMiG,EAAIm1D,SAASw3H,eAAe5yL,GAClCiG,GAAKA,EAAE0mL,UAAUvkL,IAAI,SAGvB,cAAqBpI,IACnB,MAAMiG,EAAIm1D,SAASw3H,eAAe5yL,GAClCiG,GAAKA,EAAE0mL,UAAU//H,OAAO,SAGnB,MAAMimI,EAAe,IAAIC,gBAAgBvwJ,SAASwF,MACrD8qJ,EAAa/hM,IAAI,kBACnB6qE,aAAad,QAAQ,UAAWg4H,EAAa/hM,IAAI,iBACjDiR,OAAOwgC,SAAW,cAGb,MAAMwwJ,EACPhxL,OAAOk5K,QACuC,IAAxCzpH,UAAU7vB,UAAU7iB,QAAQ,OAAiB,OAAS,WAEzD,UAGF,SAASk0K,EAAWnkL,GACzB,MAAMmf,EAAIxrB,KAAK6gB,MAAMxU,EAAI,OACzBA,GAAS,KAAJmf,EAAW,GAChB,MAAM1c,EAAI9O,KAAK6gB,MAAMxU,EAAI,MACzBA,GAAS,KAAJyC,EACL,MAAM7gB,EAAI+R,KAAK6gB,MAAMxU,EAAI,IACzBA,GAAS,GAAJpe,EACL,MAAM2N,EAAM,GAIZ,OAHI4vB,GAAG5vB,EAAI3H,KAAKu3B,EAAI,MAChBA,GAAK1c,IAAGlT,EAAI3H,KAAK6a,EAAI,MACrB0c,GAAK1c,GAAK7gB,IAAG2N,EAAI3H,KAAKhG,EAAI,KACvB2N,EAAI7J,KAAK,KAGX,SAAS0+L,EAAYr9L,GAC1B,MAAMgC,EAAS,GAEf,IAAK,MAAM7B,KAAOH,EAChB,GAAIA,EAAIG,IAAQH,EAAIG,GAAKpC,cAAgBuD,OAAQ,CAC/C,MAAMg8L,EAAWD,EAAWr9L,EAAIG,IAEhC,IAAK,MAAMo9L,KAAeD,EACxBt7L,EAAOu7L,GAAeD,EAASC,QAGjCv7L,EAAO7B,GAAOH,EAAIG,GAGtB,OAAO6B,EAGF,MAAMw7L,GAAY,IAAIC,WAAYC,gBAAgB53K,KAAK,IAAI23K,WAE3D,SAASp+L,EAAQu0G,EAAQl5G,GAC9B,IAAKA,EAAM,CACTA,EAAO,EACP,IAAIyM,EAAIysG,EAAOx2G,QAAUw2G,EAAO/1G,YAAc,EAC9C,KAAOsJ,KAAKzM,GAAQk5G,EAAOzsG,GAAG/J,OAEhC,MAAMuR,EAAI,IAAI8kB,WAAW/4B,GACzB,IAAIyC,EAAS,EACb,IAAK,IAAIgK,EAAI,EAAGoR,EAAIq7F,EAAOx2G,OAAQ+J,EAAIoR,EAAGpR,IAAK,CAC7C,MAAM8xC,EAAQ26D,EAAOzsG,GACrBwH,EAAE3T,IAAIi+C,EAAO97C,GACbA,GAAU87C,EAAMp7C,YAAco7C,EAAM77C,OAGtC,OAAOuR,EAGF,MAAMgvL,EAAQttL,GAAK,IAAIiX,SAAQC,GAAW0Z,WAAW1Z,EAASlX,KAE9D,MAAMutL,EACX7/L,cACEjC,KAAKy4J,MAAQ,GACbz4J,KAAKmjC,WAAY,EACjBnjC,KAAK+hM,OAAS,KAGhBrrL,IAAKxS,GACH,IAAIlE,KAAKmjC,UAIT,IAAKnjC,KAAKy4J,MAAMn3J,QAAU4C,EAAI0F,MAAQ5J,KAAKy4J,MAAMz4J,KAAKy4J,MAAMn3J,OAAS,GAAGsI,OAAS1F,EAAI0F,MAAQ5J,KAAKy4J,MAAM,GAAG7uJ,MAAQ,GACjH5J,KAAKy4J,MAAM1zJ,KAAKb,GACU,IAAtBlE,KAAKy4J,MAAMn3J,QAActB,KAAKwkH,YAC7B,CAEL,IAAK,IAAIn5G,EAAI,EAAGA,EAAIrL,KAAKy4J,MAAMn3J,OAAQ+J,IACrC,GAAIrL,KAAKy4J,MAAMptJ,GAAGzB,MAAQ1F,EAAI0F,MAE5B,YADA5J,KAAKy4J,MAAMlqJ,OAAOlD,EAAG,EAAGnH,GAI5BlE,KAAKy4J,MAAM1zJ,KAAKb,GAChB,EAAQ0lB,KAAK,YAIjBy+B,cACE,MAAMnkD,EAAMlE,KAAKy4J,MAAM,SACjBv0J,EAAI+kB,KACVjpB,KAAK+0K,QAAQ7wK,IACRlE,KAAKmjC,WAAanjC,KAAKy4J,MAAMn3J,QAAQtB,KAAKwkH,QAGjDuwD,QAAS7wK,GACFlE,KAAKmjC,WAAWnjC,KAAKy4J,MAAMlqJ,OAAOvO,KAAKy4J,MAAMrrI,QAAQlpB,GAAM,GAGlEshC,UACExlC,KAAKmjC,WAAY,EACjBnjC,KAAKy4J,MAAQ,MCpHjB,SAAS,EAAiBnwH,GACtB,OAAO,IAAI9c,SAAQ,CAACC,EAAS+c,KAEzBF,EAAQw9I,WAAax9I,EAAQy9I,UAAY,IAAMt6J,EAAQ6c,EAAQpiC,QAE/DoiC,EAAQ09I,QAAU19I,EAAQ0hB,QAAU,IAAMxhB,EAAOF,EAAQ/mC,UAGjE,SAAS,EAAY2kL,EAAQ/3E,GACzB,MAAMg4E,ECLV,WAKI,GAJkBrmH,UAAUsmH,gBACxB,WAAW/+K,KAAKy4D,UAAU7vB,YACzB,iBAAiB5oC,KAAKy4D,UAAU7vB,aAEnBq9D,UAAU+4E,UACxB,OAAO76J,QAAQC,UACnB,IAAI+6J,EACJ,OAAO,IAAIh7J,SAASC,IAChB,MAAM66J,EAAS,IAAMh5E,UAAU+4E,YAAYE,QAAQ96J,GACnD+6J,EAAavhJ,YAAYqhJ,EAAQ,KACjCA,OACDC,SAAQ,IAAMvhJ,cAAcwhJ,KDPnB,GAAYp7J,MAAK,KACzB,MAAMkd,EAAUglE,UAAUC,KAAK24E,GAE/B,OADA59I,EAAQm+I,gBAAkB,IAAMn+I,EAAQpiC,OAAO6kG,kBAAkBoD,GAC1D,EAAiB7lE,MAE5B,MAAO,CAACo+I,EAAQ5lJ,IAAaqlJ,EAAI/6J,MAAM0/E,GAAOhqE,EAASgqE,EAAGsB,YAAY+B,EAAWu4E,GAAQ16E,YAAYmC,MAEzG,IAAI,EACJ,SAAS,IAIL,OAHK,IACD,EAAsB,EAAY,eAAgB,WAE/C,EErBJ,MAAM6zF,EAAmB,CAC9BzmF,OAAQ0mF,QAASC,QAASC,QAASC,QAASC,SAAUC,UAAWC,UAAWC,SAAUC,SAAUC,SAAUC,SAAUC,SAAUC,SAAUC,SAAUC,UAAWC,OAAQC,OAAQC,QAE/KC,OAAOxsJ,iBAAiB,SAoDxB,WACEszB,aAAab,WAAW,YACxBv4B,SAASkkJ,YArDXqO,YAAYzsJ,iBAAiB,QAAS0sJ,IACtC9nF,OAAO5kE,iBAAiB,QAAS0sJ,IACjCC,cAAc3sJ,iBAAiB,SAuC/B,WACM,4BAA6BmpB,WAC/BA,UAAUyjI,wBACR,SACA,GAAG1yJ,SAASwF,KAAKzoC,QAAQijC,SAAS6S,KAAM,mBACxC,WA3CC,MAAM8/I,EAAW56L,KAAK41B,MAAMyrC,aAAaX,QAAQ,cAAgB,GAExE,IAAIu9G,EA8BA4c,EAVJp7I,eAAeq7I,KACb,IAAK,MAAMlxF,KAAWwvF,EACpBwB,EAAShxF,EAAQlkG,IAAuB,aAAjBkkG,EAAQxqG,KAAsBwqG,EAAQ7gD,QAAU6gD,EAAQ/wG,MAEjFwoE,aAAad,QAAQ,WAAYvgE,KAAKC,UAAU26L,IAC5C,wBAAyBnzL,QACvBmzL,EAASG,UFIjB,SAAat/L,EAAK5C,EAAOolL,EAAc,KAC5BA,EAAY,aAAc/rH,IAC7BA,EAAMG,IAAIx5D,EAAO4C,GACV,EAAiBy2D,EAAMsxC,gBEPX,CAAI,kBAAmBo3F,EAASG,SAAU9c,GAKrE,SAASwc,KACP12J,aAAa82J,GACbA,EAAet+J,WAAWu+J,GAAc,KA/BtC,wBAAyBrzL,SAC3Bw2K,EAAc,EAAY,eAAgB,WAC1C2c,EAASG,SFgBX,SAAat/L,EAAKwiL,EAAc,KAC5B,OAAOA,EAAY,YAAa/rH,GAAU,EAAiBA,EAAM17D,IAAIiF,MEjBnD,CAAI,YAAawiL,GAAaz7J,MAAK88J,GACjDA,GACF0b,cAAcniM,MAAQ,WAAaymL,EAAOpoL,KACnCooL,GAEF,OAETyb,SAAS1I,UAAU//H,OAAO,UAC1ByoI,SAASE,QAAUx7I,UACjB,MAAM6/H,QAAe73K,OAAOyzL,4BACtB5b,EAAO6b,kBAAkB,CAAEljL,KAAM,cACvC2iL,EAASG,SAAWzb,EACpB0b,cAAcniM,MAAQ,WAAaymL,EAAOpoL,MAAQ,IAmCtDkkM,cAAcH,QAAU,KACtB55H,aAAab,WAAW,aACxBv4B,SAASkkJ,UAGX,IAAK,MAAMkP,KAAWz+L,OAAO22G,QAAQqnF,GAAW,CAC9C,MAAMU,EAAiBlC,EAAiB78L,QAAOuB,GAAKA,EAAE4H,KAAO21L,EAAQ,KAAI,GACrEC,IAAwC,aAAxBA,EAAel8L,KAAsBk8L,EAAevyI,QAAUsyI,EAAQ,GAAKC,EAAeziM,MAAQwiM,EAAQ,IAGhIP,KAEAV,OAAOmB,QAAU,IAAMnB,OAAOrxI,SAAWyyI,aAAaL,oBAAoB34K,MAAKi5K,IAA8BrB,OAAOrxI,QAAlB,WAAT0yI,oBClEzF,MAAMC,GAAa,CACjBC,KAAM,CAAC,OACPC,SAAU,CAAC,MAAO,MAAO,OAAQ,OAAQ,SACzCC,QAAS,CAAC,MAAO,MAAO,OAAQ,OAAQ,QAAS,OAAQ,SAMpD,SAASC,GAAelwJ,GAC7B,OAAOm+G,MAAMn+G,GAAKppB,MAAK5oB,IACrB,GAAIA,EAAIqmB,GACN,OAAOrmB,EAAIotH,OAAOxkG,MAAKu5K,GACdjD,EAAUiD,EAAQ,cAG7B,MAAM1lM,MAAMuD,EAAI2zJ,eACf9qI,OAAM9pB,IACP,oBAAyB,CACvB+G,QAAS,2BAA6B/G,EACtC+hI,MAAO,gBACPshE,UAAW,eACXC,SAAU,KAEZ,GAAQtjM,MAAMA,MAqEX,SAASujM,KACd,OAAIt/L,OAAO2G,OAAO44L,aAAalkM,SAASsE,QAAOtD,GAAQA,EAAKJ,QAAU+hM,EAASb,WAAU,GAChF,IAAIzuJ,IAAI1uC,OAAO2G,OAAO44L,aAAalkM,SAASsE,QAAOtD,GAAQA,EAAKJ,QAAU+hM,EAASb,WAAU,GAAGnG,YAAcgH,EAAShB,UAEvH,IAAItuJ,IAAIsvJ,EAASb,SAAWa,EAAShB,UC9FzC,SAASwC,KACd,MAAMC,EAAmB,CAACC,YAAaC,iBAAkBC,iBAAkBC,iBAAkBC,iBAAkBC,gBAAiBC,gBAC1HC,EAAsB,CAACC,aAAcC,aAAcC,aAAcC,aAAcC,YAAaC,YAC5FC,EAAqB,CAACC,WAAYC,YAAaC,WAAYC,aAAcC,aAAcC,aAAcC,YACrGC,EAAgB98H,SAASupE,cAAc,WACvCwzD,EAAoB,CACxBl6F,SAAUlkD,eAAgBq+I,GACnBA,GAAMC,EAAgBH,GAC3B,MAAMhkM,QAAYokM,GAAU,CAAE9hM,OAAQ,YAAa+hM,UAAW,UAAWv4L,GAAIw4L,GAAMJ,KAAMA,GAAQ,IAKjG,OADAK,EAAc,CAAElM,MAHEr4L,EAAI5B,KAAKomM,KAAKC,UAAUrlM,KAAIyJ,GAAKA,EAAEwvL,QAAO11L,QAAO01L,GACzC,cAAjBA,EAAMrtE,QAA0BqtE,EAAMqM,gBAAgB/yB,SAAW0mB,EAAMsM,mBAAmBvM,QAAU,IAE3EwM,QAASZ,EAAe1hM,OAAQ,WAAY4hM,KAAMA,GAAQ,IACrFlkM,EAAI5B,KAAKomM,KAAKK,SAASC,aAEhCC,SAAUl/I,iBACRs+I,EAAgBH,GAChB,MAAMgB,QAAcC,UAAqB/C,GAAcI,OAAc4C,iBAAiB,SAKtF,OAJAlB,EAAchK,YAAc,GAC5BgK,EAAcnzD,UAAUm0D,GACxBG,KAAK1M,UAAU//H,OAAO,WACtBysI,KAAKC,cAAWx/L,GACT,GAETy/L,SAAUx/I,eAAgBq+I,GACnBA,GAAMC,EAAgBH,GAC3B,MAAMhkM,QAAYokM,GAAU,CAAE9hM,OAAQ,YAAa+hM,UAAW,WAAYv4L,GAAIw4L,GAAMJ,KAAMA,GAAQ,IAGlG,OADAK,EAAc,CAAElM,MADEr4L,EAAI5B,KAAKomM,KAAKC,UACCrlM,KAAIyJ,GAAKA,EAAEwvL,QAAQuM,QAASZ,EAAe1hM,OAAQ,WAAY4hM,KAAMA,GAAQ,IACvGlkM,EAAI5B,KAAKomM,KAAKK,SAASC,aAEhCQ,SAAUz/I,iBAIR,OAHAs+I,EAAgBH,GAChBuB,IACAxB,WAAW9kM,MAAQ,sBACNglM,EAAkBr3K,UAEjC44K,QAAS3/I,iBAKP,OAJAs+I,EAAgBH,GAChBuB,IACA7B,YAAYzkM,MAAQ,UACpB8kM,WAAW9kM,MAAQ,sBACNglM,EAAkBr3K,UAEjCujB,OAAQ0V,iBAKN,OAJAs+I,EAAgBH,GAChBuB,IACA7B,YAAYzkM,MAAQ,SACpB8kM,WAAW9kM,MAAQ,sBACNglM,EAAkBr3K,UAEjC64K,SAAU5/I,eAAgBq+I,GACnBA,GAAMC,EAAgBH,GAC3B,MAAMhkM,QAAYokM,GAAU,CAAE9hM,OAAQ,iBAAkB4hM,KAAMA,GAAQ,IAGtE,OADAK,EAAc,CAAElM,MADEr4L,EAAI5B,KAAKomM,KAAKkB,gBACC/iM,QAAOk3G,GAAyC,OAAhCA,EAAMw+E,MAAMsN,kBAAoD,IAAxB9rF,EAAMw+E,MAAMuN,UAAoBhB,QAASZ,EAAe1hM,OAAQ,WAAY4hM,KAAMA,GAAQ,EAAGuB,UAAU,IACzLzlM,EAAI5B,KAAKomM,KAAKK,SAASC,aAEhCl4K,OAAQi5B,eAAgBq+I,GACtB,MAAMhhM,EAAM,CACVZ,OAAQ,SACR4hM,KAAMA,GAAQ,GAEVznK,EAAO,GACbz5B,OAAO+iB,OAAO0W,EAAMv5B,GACpB,IAAK,MAAM8sG,KAAWwzF,EAChBxzF,EAAQ/wG,QAAOw9B,EAAKuzE,EAAQ2sF,QAAQkJ,QAAU71F,EAAQ/wG,OAE5D,GAAI+D,OAAOC,KAAKC,GAAKpE,SAAWkE,OAAOC,KAAKw5B,GAAM39B,OAAQ,CACxD,MAAMkB,QAAYokM,GAAU3nK,GAG5B,OADA8nK,EAAc,CAAElM,MADEr4L,EAAI5B,KAAKomM,KAAKnM,MACEuM,QAASZ,EAAe1hM,OAAQ,SAAU4hM,KAAMA,GAAQ,IACnFlkM,EAAI5B,KAAKomM,KAAKK,SAASC,YAK9B,OAHAgB,YAAYrN,UAAU//H,OAAO,gBAC7BysI,KAAK1M,UAAU//H,OAAO,WACtBqtI,KACO,IAIPC,EAAuB,CAC3Bj8F,SAAU,WACRq6F,GAAU,CAAE9hM,OAAQ,YAAa+hM,UAAW,UAAWv4L,GAAIw4L,GAAM2B,QAAS,KAAMr9K,MAAK5oB,IAInFukM,EAAc,CAAElM,MAHEr4L,EAAI5B,KAAKomM,KAAKC,UAAU9hM,QAAO,EAAG01L,MAAAA,KAC1B,cAAjBA,EAAMrtE,QAA0BqtE,EAAMqM,gBAAgB/yB,SAAW0mB,EAAMsM,mBAAmBvM,QAAU,IAC1Gh4L,MAAM,EAAG,GAAGhB,KAAIyJ,GAAKA,EAAEwvL,QACQuM,QAAS1B,mBAG/C6B,SAAUl/I,iBACR,MAAMqgJ,QAAYhE,GAAcI,MAChC,GAAI4D,EAAK,CACP,MAAMC,EAAUD,EAAIz1D,cAAc,WAAWupD,YAC7C,GAAIoM,IAAgBD,EAAS,CACvBC,IACFjD,aAAanJ,YAAc,GAC3BmJ,aAAatyD,UAAUw1D,EAAoB,IACvCrF,EAASR,QACXrM,GAAiB,CAAElO,SAAUigB,EAAIz1D,cAAc,cAAcupD,YAAasM,WAAW,IAAQ19K,MAAK29K,IAC3E,IAAI3E,aAAa2E,EAAiBlO,MAAMv3D,MAAM0lE,cAAe,CAChFjpM,KAAM,WAAWgpM,EAAiBpO,mCAClCsO,KAAMF,EAAiBlO,MAAMqO,WAAWC,SAE7BtF,QAAUx7I,UACrBh4C,OAAO7M,OAAO4lM,QACdC,GAAUN,EAAiBO,YAAYC,oBAAsB3C,GAAU,CAAEt4L,GAAIy6L,EAAiBlO,MAAMvsL,GAAIxJ,OAAQ,oBAAqBlE,KAAK4oM,MAAMl7L,GAChJqjC,GAAOmvJ,YAAY4H,EAAIz1D,cAAc,aAAaupD,YAAa,CAAE3B,MAAOkO,EAAkBnO,QAASmO,EAAiBnO,eAK5HgO,EAAcD,EACd,MAAMnB,QAAcC,GAAciB,EAAIhB,iBAAiB,QAAS,GAChE/B,aAAanJ,YAAc,GAC3BmJ,aAAatyD,UAAUm0D,MAI7BK,SAAU,WACRjB,GAAU,CAAE9hM,OAAQ,YAAa+hM,UAAW,WAAYv4L,GAAIw4L,GAAM2B,QAAS,IAAKr9K,MAAK5oB,IACnFukM,EAAc,CAAElM,MAAOr4L,EAAI5B,KAAKomM,KAAKC,UAAUrlM,KAAIyJ,GAAKA,EAAEwvL,QAAQuM,QAASxB,mBAG/EkC,SAAU,WACRlB,GAAU,CAAE9hM,OAAQ,SAAUwJ,GAAIw4L,GAAM2B,QAAS,EAAGrrK,KAAM,kBAAmBhS,MAAK5oB,IAChFukM,EAAc,CAAElM,MAAOr4L,EAAI5B,KAAKomM,KAAKnM,MAAOuM,QAASvB,mBAGzDmC,QAAS,WACPpB,GAAU,CAAE9hM,OAAQ,SAAU2kM,MAAO,UAAWhB,QAAS,EAAGrrK,KAAM,kBAAmBhS,MAAK5oB,IACxFukM,EAAc,CAAElM,MAAOr4L,EAAI5B,KAAKomM,KAAKnM,MAAOuM,QAAStB,kBAGzDnzJ,OAAQ,WACNi0J,GAAU,CAAE9hM,OAAQ,SAAU2kM,MAAO,SAAUhB,QAAS,EAAGrrK,KAAM,kBAAmBhS,MAAK5oB,IACvFukM,EAAc,CAAElM,MAAOr4L,EAAI5B,KAAKomM,KAAKnM,MAAOuM,QAASrB,kBAIrD8C,EAAsB,SAAUj4K,GACpC,MAAM42K,EAAQ,GACd,KAAO52K,KACL42K,EAAMziM,KAAK2kM,GAAaC,WAAU,IAEpC,OAAOnC,GAET,IAAIoC,EACAC,EACAjB,EA6EAkB,EA5EAC,GAAY,EAEhB,SAASpD,EAAiBS,GACxBO,KAAK1M,UAAUvkL,IAAI,WACnB0wL,EAAQ5K,YAAc,GACtB4K,EAAQ/zD,UAAUw1D,EAAoB,KAExC,SAAS9B,EAAe9nK,GACJ,IAAdA,EAAKynK,MACPiB,KAAK1M,UAAU//H,OAAO,WAEpBj8B,EAAKn6B,SACPilM,GAAY,EACZpC,KAAKC,SAAW,WACV5nM,KAAKgqM,UAAYhqM,KAAKiqM,aAAejqM,KAAKkqM,aAAe,MAAQN,GAAeG,IAClFA,GAAY,EACZH,EAAczkK,YAAW,WAAcykK,OAAcxhM,IAAa,KAClEq+L,EAAkBxnK,EAAKn6B,QAAQm6B,EAAKynK,KAAO,GAAGt7K,MAAMk8K,IAAkByC,EAAYzC,QAInFroK,EAAKynK,MAAsB,IAAdznK,EAAKynK,OACrBznK,EAAKmoK,QAAQ5K,YAAc,IAE7B,MAAM9tL,EAAO,IAAIzB,KACXu6L,EAAQ,GACdvoK,EAAK47J,MAAM73L,SAAQ63L,IACjB,GAAI57J,EAAKgpK,SAAU,CACjB,GAAIpN,EAAMsP,mBAAqBN,GAAa,IAAI58L,MAAMyB,EAA+B,IAAxBmsL,EAAMsP,iBAAwBC,WAAaP,EAASO,UAAY,CAC3H,MAAMnpL,EAAMyoD,SAASstC,cAAc,OACnC6yF,EAAW,IAAI58L,MAAMyB,EAA+B,IAAxBmsL,EAAMsP,iBAClClpL,EAAIg6K,UAAUvkL,IAAI,UAAW,eAAgB,mBAAoB,OAAQ,SAAU,mBACnFuK,EAAIu7K,YAAcqN,EAASQ,mBAAmB,QAAS,CAAEC,QAAS,SAClE9C,EAAMziM,KAAKkc,GAEb45K,EAAQA,EAAMA,MAEhB2M,EAAMziM,KAAKwlM,GAAY,CAAE1P,MAAOA,EAAOoN,SAAUhpK,EAAKgpK,SAAUpE,QAAS,IAAM2G,GAAU3P,SAE3F57J,EAAKmoK,QAAQ/zD,UAAUm0D,GACvBuC,GAAY,EAGd,IAAK,MAAMloM,KAAQ4jM,EACjB+C,EAAqB3mM,EAAKs9L,QAAQsL,YAEpCxlK,YAAYujK,EAAqBjB,SAAU,KAC3C,IAAK,MAAM1lM,KAAQojM,EACjBpjM,EAAKgiM,QAAU,WACb8D,KAAKqC,UAAY,EACjBrC,KAAK1M,UAAUvkL,IAAI,YACnB4xL,YAAYrN,UAAUvkL,IAAI,gBAC1B+vL,EAAkB5kM,EAAKs9L,QAAQsL,aAGnC,SAASlC,IACPR,IACAO,YAAYrN,UAAU//H,OAAO,gBAC7BysI,KAAK1M,UAAU//H,OAAO,YACtB0tI,OAAcxgM,EACdu/L,KAAKC,cAAWx/L,EAChBu/L,KAAKqC,UAAY,EACjB,IAAK,MAAMnoM,KAAQ4jM,EACjB5jM,EAAK26L,YAAc,GACnB36L,EAAKwxI,UAAUw1D,EAAoB,IACnCL,EAAqB3mM,EAAKs9L,QAAQsL,YAEpC/gI,SAASupE,cAAc,WAAWupD,YAAc,GAIlD,SAASuL,IACP,IAAK,MAAMv1F,KAAWwzF,EACpBxzF,EAAQ/wG,MAAQ,GAJpBipM,QAAQ7G,QAAU0E,EAClBD,YAAYzE,QAAU0E,EAOtBoC,cAAcxG,QAAU,KACjB2F,EAKHn9J,aAAam9J,IAJbnC,KAAK1M,UAAUvkL,IAAI,YACnBiwL,EAAgBH,GAChBmB,KAAKqC,UAAY,GAInB1B,YAAYrN,UAAUvkL,IAAI,gBAC1BozL,EAAgB3kK,YAAW,KACzBshK,EAAkBr3K,SAClB06K,OAAgB1hM,IACf,MD7OD,gBAAiB+sL,iBAAiBl1L,WACtCqkM,GAAWjD,GAAat8L,KAAK,cAAe,cCgP9C,MAAM2kM,GAAekB,qBAAqBjB,WAAU,GAAMrhM,QACpDuiM,GAAWC,iBAAiBnB,WAAU,GAAMrhM,QAC5CyiM,GAAWC,iBAAiBrB,WAAU,GAAMrhM,QAC3C,SAASiiM,GAAatrK,GAC3B,GAAIA,EAAK47J,MAAO,CACd,MAAMoQ,EAAOF,GAASpB,WAAU,GAC1BuB,EAAQD,EAAKvD,iBAAiB,KAcpC,OAbAwD,EAAM,GAAGrH,QAAU5kK,EAAK4kK,QACxBqH,EAAM,GAAGthI,MAAQ,WAAW3qC,EAAK47J,MAAMqO,WAAWngI,OAAS,aAC3DmiI,EAAM,GAAGtzJ,IAAM3Y,EAAK47J,MAAMqO,WAAWiC,YAAc,GACnDD,EAAM,GAAG1O,YAAc,CAACv9J,EAAK47J,MAAMv3D,MAAM0lE,cAAe/pK,EAAK07J,eAAex1L,QAAOgY,GAAKA,IAAGta,KAAK,OAC5Fo8B,EAAKgpK,UAAYhpK,EAAK47J,MAAMsM,oBAAmB+D,EAAM,GAAG1O,YAAc,MAAQv9J,EAAK47J,MAAMsM,kBAAkBvM,QAAU,OAAS0G,EAAUriK,EAAK47J,MAAMsM,kBAAkBgD,kBACzKe,EAAM,GAAGE,UAAY,SAAW,CACR,OAAtBnsK,EAAK47J,MAAMn7H,OAAkB,UAAYzgC,EAAK47J,MAAMn7H,QAAQ73B,cAAcj6B,QAAQ,KAAM,KACxFqxB,EAAK47J,MAAMwQ,SAAWpsK,EAAK47J,MAAMwQ,SAAW,YAAcpsK,EAAK47J,MAAMp7H,SAAWxgC,EAAK47J,MAAMp7H,SAAW,gBAAar3D,EACnH62B,EAAK47J,MAAMrtE,QAAQ3lF,cAAcj6B,QAAQ,KAAM,KAC/C,CAACqxB,EAAK47J,MAAMyQ,QAAQzjK,cAAe5I,EAAK47J,MAAM0Q,YAAYpmM,QAAOgY,GAAKA,IAAGta,KAAK,MAC9EsC,QAAOgY,GAAKA,IAAGta,KAAK,iBAAmB,UACzCqoM,EAAM,IAAIE,UAAYnsK,EAAK47J,MAAMzG,YACjC8W,EAAM,IAAIE,UAAYnsK,EAAK47J,MAAM2Q,OAAO5pM,KAAIyC,GAAO,8EAA+EA,cAAgBxB,KAAK,IAChJooM,EACF,GAAIhsK,EAAKqqK,YAAa,CAC3B,MAAM2B,EAAOJ,GAASlB,WAAU,GAGhC,OAFAsB,EAAKh4D,cAAc,MAAMupD,YAAc,CAACv9J,EAAKqqK,YAAYC,YAAatqK,EAAKqqK,YAAYmC,gBAAgBtmM,QAAOgY,GAAKA,IAAGta,KAAK,OAC3HooM,EAAKS,kBAAkB7H,QAAU5kK,EAAK4kK,QAC/BoH,EAET,OAAOvB,GAAaC,WAAU,GAGhCthJ,eAAeo/I,GAAe96C,EAAO/7H,GACnC,MAAM42K,EAAQ,GAOd,aANoB7Q,GAAiB,CAAElO,SAAU,IAAI97B,GAAO/qJ,KAAIC,GAAQA,EAAKoxI,cAAc,SAASupD,cAAa55L,MAAM,EAAGguB,GAAQk4K,WAAW,KACvI9lM,SAAQ,CAAC+lM,EAAkBn/L,KAC/Bm/L,EAAiBlF,QAAU,IAAMlyJ,GAAOmvJ,YAAYn0C,EAAM/iJ,GAAOqpI,cAAc,QAAQupD,YAAa,CAAE3B,MAAOkO,EAAkBnO,QAASmO,EAAiBnO,UACzJ4M,EAAMziM,KAAKwlM,GAAYxB,OAEzB9+H,aAAad,QAAQ,YAAavgE,KAAKC,UAAUwgM,KAC1C7B,EAET,MAAMmE,GAAajiI,SAASstC,cAAc,QAC1C20F,GAAW1Q,UAAUvkL,IAAI,QAAS,aAAc,UAWhD,MAAMk1L,GAAa,CACjB,CAAEt0D,SAAU,UAAW/pI,MAAO,SAAU07L,KAAM,WAAYj2K,OAAQ,YAClE,CAAEskH,SAAU,SAAU/pI,MAAO,SAAU07L,KAAM,kBAC7C,CAAE3xD,SAAU,SAAU/pI,MAAO,SAAU07L,KAAM,MAAOj2K,OAAQ,YAC5D,CAAEskH,SAAU,WAAY/pI,MAAO,WAAY07L,KAAM,WAAYj2K,OAAQ,YACrE,CAAEskH,SAAU,WAAY/pI,MAAO,WAAY07L,KAAM,SACjD,CAAE3xD,SAAU,SAAU/pI,MAAO,SAAU07L,KAAM,WAC7C,CAAE3xD,SAAU,SAAU/pI,MAAO,SAAU07L,KAAM,WAC7C,CAAE3xD,SAAU,QAAS/pI,MAAO,SAAU07L,KAAM,YAC5C,CAAE3xD,SAAU,SAAU/pI,MAAO,SAAU07L,KAAM,UAC7C,CAAE3xD,SAAU,eAAgB/pI,MAAO,SAAU07L,KAAM,cAAej2K,OAAQ,YAC1E,CAAEskH,SAAU,UAAW/pI,MAAO,UAAW07L,KAAM,SAC/C,CAAE3xD,SAAU,SAAU/pI,MAAO,SAAU07L,KAAM,aAC7C,CAAE3xD,SAAU,SAAU/pI,MAAO,SAAU07L,KAAM,IAAKj2K,OAAQ,SAGtD64K,GAAaC,eAAenC,WAAU,GAAMrhM,QA6DlDyjM,aAAalI,QAAU,KACrBmI,aAAap0J,IAAM,IAGrBojJ,cAAc6I,QAAU,KAAYlyJ,GAAOmpJ,WAAP,OAA0B0P,GAAU74J,GAAOmpJ,WAAWD,QAE1F,MAAMoR,GAAYC,UAAUxE,iBAAiB,KACtC,SAAS8C,GAAWzkM,EAAO60L,GAChC,cAAmB,aACnB,MAAMC,EAAQ0G,EAAWx7L,GACzBkmM,GAAU,GAAGr0J,IAAMijJ,EAAMsQ,YAActQ,EAAMsO,OAC7C8C,GAAU,IAAIzP,YAAc3B,EAAMmO,cAClCiD,GAAU,IAAIzP,YAAc3B,EAAMsR,aAAe,IACjDF,GAAU,IAAIzP,YAA+B,OAAjB3B,EAAMn7H,OAAkBm7H,EAAMn7H,OAASm7H,EAAMn7H,QAAQ73B,cAC1D,IAAnBgzJ,EAAMwQ,WAAoBxQ,EAAMwQ,WAAaxQ,EAAMD,SACrDqR,GAAU,IAAIhR,UAAUvkL,IAAI,SAC5Bu1L,GAAU,IAAIhR,UAAUvkL,IAAI,SAC5Bu1L,GAAU,IAAIzP,YAAc3B,EAAMp7H,SAAW,SAE7CwsI,GAAU,IAAIhR,UAAU//H,OAAO,SAC/B+wI,GAAU,IAAIhR,UAAU//H,OAAO,SAC/B+wI,GAAU,IAAIzP,YAAc3B,EAAMwQ,UAEpCY,GAAU,IAAIzP,YAAc,GAC5ByP,GAAU,IAAI54D,UA9GhB,SAAsBm4D,EAAS,IAC7B,MAAMY,EAAS,GACf,IAAK,MAAM3C,KAAS+B,EAAQ,CAC1B,MAAMa,EAAQV,GAAWhC,WAAU,GACnC0C,EAAM7P,YAAciN,EACpB2C,EAAOrnM,KAAKsnM,GAEd,OAAOD,EAuGiBE,CAAYzR,EAAM2Q,SAEtC3Q,EAAMwQ,UAAYxQ,EAAMD,SAC1BqR,GAAU,IAAIhR,UAAU//H,OAAO,UAC/B+wI,GAAU,IAAIpI,QAAU,KAAQ0I,GAAWxmM,EAAO5G,OAAO8sM,GAAU,IAAIxqM,QAAU,GAAI,cAAmB,cACxGwqM,GAAU,IAAIxqM,MAAQm5L,GAAW9pL,KAAK/D,IAAI5N,OAAO07L,EAAM1mB,UAAY,GAAK,EAAG0mB,EAAMwQ,UACjFY,GAAU,IAAIzP,YAAc3B,EAAM1mB,UAAY0mB,EAAM1mB,WAAa0mB,EAAMwQ,SAAW,WAAa,OAE/FY,GAAU,IAAIpI,QAAU,KAAQ0I,GAAWxmM,EAAO5G,OAAO8sM,GAAU,IAAIxqM,QAAU,GAAG,GAAO,cAAmB,cAC9GwqM,GAAU,IAAIxqM,MAAQm5L,GAAW9pL,KAAK/D,IAAI5N,OAAO07L,EAAM1mB,UAAY,GAAK,EAAG0mB,EAAMwQ,WAEjFY,GAAU,IAAIhR,UAAUvkL,IAAI,UAE1BmkL,EAAM2R,YACRP,GAAU,GAAGriI,MAAQ,+IAA+IixH,EAAM2R,2BAE1KP,GAAU,GAAGriI,MAAQ,mJAGvBqiI,GAAU,IAAIpI,QAAU,KAAM4I,OApDT7mC,EAoDsB7/J,EAAM6/J,QAnDjDomC,aAAap0J,IAAM,GACnB,gBAAqB,gBAEd,YADCguH,EAAQ8mC,OAEZV,aAAap0J,IAAM,iCAAmCguH,EAAQt3J,KALpE,IAAuBs3J,GAsDrBqmC,GAAU,IAAIb,UAAYvQ,EAAMzG,YAEhC6X,GAAU,IAAIzP,YAAc,GAC5ByP,GAAU,IAAI54D,UA5GhB,SAAuBwnD,GACrB,MAAMjvK,EAAU,GAChB,IAAK,MAAM+gL,KAAUf,GACnB,GAAI/Q,EAAM8R,EAAOr1D,UAAW,CAC1B,MAAM3yI,EAAQknM,GAAWlC,WAAU,GAC7BuB,EAAQvmM,EAAM+iM,iBAAiB,KACrC,OAAQ7M,EAAM8R,EAAOr1D,UAAUr1I,aAC7B,KAAK4J,OACHq/L,EAAM,GAAG1O,YAAc3B,EAAM8R,EAAOr1D,UAAU1pI,QAAQ,KAAM,KAAKi6B,cACjE,MAEF,KAAK1oC,OACH+rM,EAAM,GAAG1O,YAAc3B,EAAM8R,EAAOr1D,UACpC,MAEF,KAAK51I,MACqB,UAApBirM,EAAOr1D,SACT4zD,EAAM,GAAG1O,YAAc3B,EAAM8R,EAAOr1D,UAAU,IAAMujD,EAAM8R,EAAOr1D,UAAU,GAAGx3I,KAE9EorM,EAAM,GAAG1O,YAAc3B,EAAM8R,EAAOr1D,UAAUz0I,KAAK,MAAM+K,QAAQ,KAAM,KAAKi6B,cAMlF,OAFAqjK,EAAM,GAAG1O,YAAcmQ,EAAO1D,KAC9BiC,EAAM,GAAG1O,YAAcmQ,EAAOp/L,MACtBo/L,EAAO35K,QACb,IAAK,OACHk4K,EAAM,GAAGjQ,UAAU//H,OAAO,iBAAkB,gBAC5CgwI,EAAM,GAAGjQ,UAAUvkL,IAAI,SAAU,qBAAsB,cAAe,eAAgB,oBACtF,MAEF,IAAK,WACqB,aAApBi2L,EAAOr1D,UAA2BujD,EAAM1mB,SAC1C+2B,EAAM,GAAGE,UAAY,cAAcvQ,EAAM1mB,sBAAsB0mB,EAAMwQ,eACxC,iBAApBsB,EAAOr1D,SAChB4zD,EAAM,GAAG1O,YAAc3B,EAAMsR,aAAe,IACf,WAApBQ,EAAOr1D,SAChB4zD,EAAM,GAAG1O,YAAc,CAAC3B,EAAMyQ,QAAQzjK,cAAegzJ,EAAM0Q,YAAYpmM,QAAOwwB,GAAKA,IAAG9yB,KAAK,KAC9D,YAApB8pM,EAAOr1D,SAChB4zD,EAAM,GAAG1O,YAAc,MAAM3B,EAAMD,YAAY0G,EAAUzG,EAAMsP,mBAE/De,EAAM,GAAG1O,YAAc3B,EAAM8R,EAAOr1D,UAI1C1rH,EAAQ7mB,KAAKJ,GAGjB,OAAOinB,EA4DiBghL,CAAa/R,IAGhC,IAAIiM,GA0BS,YAAhBzF,GACF,oBAAyB,CACvB/4L,QAAS,yGACTg7H,MAAO,cACPshE,UAAW,eACXC,SAAU,oBC7cdx8I,eAAewkJ,GAAe5tK,GAC5B,aAAa0zH,MAAM,6BAA8B1zH,GAAM7T,MAAKi9B,MAAAA,IAC1D,MAAMi8F,QAAa9hJ,EAAI8hJ,OACvB,IAAK9hJ,EAAIqmB,GACP,IAAK,MAAMtnB,KAAS+iJ,EAAK/6I,OACvB,oBAAyB,CACvBjB,QAAS,wCAAwC/G,EAAMisH,YAAYjsH,EAAM2I,UACzEo5H,MAAO,gBACPshE,UAAW,eACXC,SAAU,KAEZ,GAAQtjM,MAAMA,GAGlB,OAAO+iJ,KA+CJj8F,eAAeu+I,GAAW3nK,GAC/B,IAAIoiI,EACJ,MAAMyrC,EAAY,CAChB9kM,KAAM,QACNo1B,KAAM6B,EAAK7B,MAAQ,gBACnBspK,KAAMznK,EAAKynK,MAAQ,EACnB+B,QAASxpK,EAAKwpK,SAAW,GACzB5B,UAAW5nK,EAAK4nK,WAAa,qBAC7B1pJ,MAAOle,EAAKke,OAAS,EACrB4vJ,SAAU9tK,EAAK+tK,UAAY,GAC3BC,WAAazJ,EAASN,SAAWjkK,EAAKguK,WAAa,WAAc,KAE7DpsM,EAAU,CACdiE,OAAQ,OACRq8G,QAAS,CACP,eAAgB,mBAChB+rF,OAAQ,qBAGNC,EAAe,swBAqErB,OAFIluK,EAAKuuF,SAAQs/E,EAAUt/E,OAASvuF,EAAKuuF,QACrCvjD,aAAaX,QAAQ,aAAYzoE,EAAQsgH,QAAQisF,cAAgBnjI,aAAaX,QAAQ,YAClFrqC,EAAKn6B,QACX,IAAK,aACHgoM,EAAU19K,OAAS6P,EAAKn/B,KACxBuhK,EAAQ,kSAON8rC,mBAIF,MACA,IAAK,iBACLL,EAAUx+L,GAAK2wB,EAAK3wB,GACpB+yJ,EAAQ,mFAGR8rC,YAGA,MACA,IAAK,YACLL,EAAUx+L,GAAK2wB,EAAK3wB,GACpB+yJ,EAAQ,6MAON8rC,mBAIF,MACA,IAAK,SACL9rC,EAAQ,wFAUR,MACA,IAAK,YACLyrC,EAAUx+L,GAAK2wB,EAAK3wB,GACpB+yJ,EAAQ,qRAQJ8rC,4BAKJ,MACA,IAAK,iBACLL,EAAUx+L,GAAKw4L,GACfgG,EAAUO,QAAUpuK,EAAK3wB,GACzB+yJ,EAAQ,qIAQR,MACA,IAAK,iBAAkB,CACvB,MAAM3yJ,EAAO,IAAIzB,KACX8T,EAAOrS,EAAK07L,UAAY,EAAI17L,EAAK07L,SAAW,EAAI,EAAI17L,EAAK07L,SAC/D17L,EAAK4+L,QAAQ5+L,EAAK68J,UAAYxqJ,GAC9BrS,EAAK6+L,SAAS,EAAG,EAAG,EAAG,GACvBT,EAAUj/L,KAAOa,EAAK+oB,UAAY,IAClCq1K,EAAUr0G,IAAM/pF,EAAK+oB,UAAY,QAA2B,IAC5D4pI,EAAQ,4SAWJ8rC,4BAKJ,MACA,IAAK,SACLL,EAAUrD,MAAQxqK,EAAKwqK,MACvBqD,EAAU19K,OAAS6P,EAAK7P,OACxB09K,EAAUngM,KAAOsyB,EAAKtyB,KACtBmgM,EAAUxB,OAASrsK,EAAKqsK,OACxBwB,EAAUptI,OAASzgC,EAAKygC,OACxBotI,EAAUt/E,OAASvuF,EAAKuuF,OACxBs/E,EAAU1vK,KAAO6B,EAAK7B,MAAQ,eAC9BikI,EAAQ,keAON8rC,mBAWN,OALAtsM,EAAQd,KAAO6I,KAAKC,UAAU,CAC5Bw4J,MAAOA,EAAMzzJ,QAAQ,MAAO,IAC5Bk/L,UAAWA,UAGAD,GAAchsM,GCzR7B,MAAM,GAA+B2sM,wCCQrC,MAAMC,GAAY,wDACZC,GAAU,6BAmChB,SAASC,GAAYvd,EAAOpoL,GAC1B,GAAa,SAATA,EAAiB,CACnB,MAAMyuC,EAAS,IAAIC,WACnBD,EAAOomD,OAASn2F,IACd,oBAAyB,CACvB4B,QAAS,uEAAuE5B,EAAEinB,OAAOznB,cAG7FuwC,EAAOm3J,cAAcxd,EAAMhxL,IAAI,eAE/B,oBAAyB,CACvBkJ,QAAS,uEAAuE8nL,QAGpF,IAAIvvL,EACA2zC,EAAM,+CAA+C47I,IAC5C,SAATpoL,IACFnH,EAAU,CACRiE,OAAQ,OACR/E,KAAMqwL,GAER57I,EAAM,gCAERm+G,MAAMn+G,EAAK3zC,GAASuqB,MAAK5oB,GAAOA,EAAI8hJ,SAAQl5H,MAAKi9B,OAASniD,OAAAA,MACpDA,GAAUA,EAAO,GAAG2nM,YAAc,IAEpCrD,UADkB5D,GAAU,CAAE9hM,OAAQ,iBAAkBwJ,GAAIpI,EAAO,GAAG4nM,WACxDltM,KAAK4oM,MAAOtjM,EAAO,GAAG00L,SAEpC,oBAAyB,CACvBtyL,QAAS,mGACTg7H,MAAO,gBACPshE,UAAW,eACXC,SAAU,QAlElBx0L,OAAOsmC,iBAAiB,SAAS0R,MAAAA,IAC/B,MAAMxmD,EAAO6E,EAAEqnM,cAAcphD,MAAM,GACnC,GAAI9qJ,GAAuC,IAA/BA,EAAKmG,KAAKolB,QAAQ,SAAgB,CAC5C1mB,EAAEsxL,iBACF,MAAMgW,EAAW,IAAIC,SACrBD,EAAS36D,OAAO,QAASxxI,EAAKqsM,aAC9BP,GAAWK,EAAU,aACZnsM,GAAsB,eAAdA,EAAKmG,KACtBnG,EAAKssM,aAAYv+E,IACX69E,GAAUzuM,KAAK4wH,IACjBlpH,EAAEsxL,iBACFiO,WAAWxkM,MAAQ,GACnBkwC,GAAOmvJ,YAAYlxE,IACV89E,GAAQ1uM,KAAK4wH,KACtBlpH,EAAEsxL,iBACFiO,WAAWxkM,MAAQ,GACnBksM,GAAW/9E,OAGN/tH,GAAsB,cAAdA,EAAKmG,MACtBnG,EAAKssM,aAAYv+E,IACf,MAAMw+E,EAAM1M,EAAU9xE,EAAM,aAAa83E,iBAAiB,OAAO,GAC7D0G,IACF1nM,EAAEsxL,iBACFiO,WAAWxkM,MAAQ,GACnBksM,GAAWS,EAAIx2J,YAKnBupJ,EAAa/hM,IAAI,UACnBuuM,GAAWxM,EAAa/hM,IAAI,SAC5BiR,OAAOwgC,SAAW,cAuCb,MAAMw9J,GAAY,uBAElBhmJ,eAAekkJ,GAAY1R,EAAOD,EAAS0T,GAC5ChwK,SAASs8J,GAAW,KACtBA,EAAU,IAAIA,KAGhB,MAAMlgI,EAAQgP,SAASupE,cAAc,iBAC/BrhG,QJrDDyW,eAAwBwyI,EAAOD,EAAS0T,GAC7C,MAAM7+B,EAAO/lG,SAAS+1H,yBAChB8O,EAAS,IAAI,IAAIv0K,IAAIx0B,OAAO2G,OAAO0uL,EAAMv3D,OAAO//H,OAAOs3L,EAAM2T,UAAUrpM,QAAOrF,GAAgB,MAARA,MAAgB+C,KAAK,OAAO+K,QAAQ,KAAM,OAChI6gM,EAAyB,IAAnB5T,EAAMwQ,WAAqC,aAAjBxQ,EAAMrtE,QAAyBg2E,EAASV,SAAY,OAAOjI,EAAMwQ,iBAAiBxQ,EAAMwQ,kCAAkCzQ,SAAeA,YAAoB,KAAKA,SAAeA,QAAiB,GAClO8T,EAAOpK,GAAWjD,GAAax+L,KAAK,KACpC+4G,EAAU,GAAG4nF,EAAShB,YAAc,UACpCmM,GAAgC,IAAtBnL,EAASd,SAAoB,EAAI,EAC3CluJ,EAAM,IAAIN,IAAI,+CAA+Cy6J,yBAA+BJ,KAAUE,IAAK7yF,MAAY8yF,MAEvHxD,SAAexG,GAAclwJ,IAAMkzJ,iBAAiB,UAC1D,IAAKwD,EAAM5pM,OAAQ,OAAOmuK,EAC1B,MAAMtzD,EAAU,GAChB,IAAK,IAAIvyG,EAAQkH,KAAK6gB,MAAMu5K,EAAM5pM,OAAS,IAAKsI,KAAU,CACxD,MAAMgvB,EAAmB,GAARhvB,EACjBuyG,EAAQvyG,GAAS,CACf05H,MAAO4nE,EAAMtyK,GAAU4jK,YACvB94I,KAAMwnJ,EAAMtyK,EAAW,GAAG4jK,YAC1BoS,QAAS1D,EAAMtyK,EAAW,GAAG4jK,YAC7BqS,SAAU3D,EAAMtyK,EAAW,GAAG4jK,YAC9BsS,UAAW5D,EAAMtyK,EAAW,GAAG4jK,YAC/B59L,KAAMssM,EAAMtyK,EAAW,IAAI4jK,aAG/BrgF,EAAQ/+E,MAAK,CAACxqB,EAAGC,IAAMA,EAAE+7L,QAAUh8L,EAAEg8L,UACrC,MAAMG,EAAmBlU,GAAOmU,kBAAkB7pM,QAAOy1L,GAAWyT,GAAUrvM,KAAK47L,EAAQt3D,QAAUnkI,OAAOkvM,GAAUrvM,KAAK47L,EAAQt3D,OAAO,MAAQnkI,OAAOy7L,KAAU,GAC7JqU,EAAY,CAChB5T,WAAYR,GAAOv3D,MAAM0lE,cACzBrO,cAAex7L,OAAOy7L,GACtBO,aAAc4T,EAAmBV,GAAUrvM,KAAK+vM,EAAiBzrE,OAAO,QAAKl7H,EAC7EqzL,iBAAkBsT,GAAkBlY,UACpC6E,WAAYb,GAAOqO,WAAWC,OAC9BrpM,KAAM,OACN+6L,MAAOA,GA8BT,OA5BI2I,EAASf,WACP6L,EACF38J,GAAOgoJ,gBAAgBx9E,EAAQ,GAAGz4D,MAElC/R,GAAOmvJ,YAAY3kF,EAAQ,GAAGz4D,KAAM,CAAEm3I,MAAOoU,EAAWrU,QAASA,IAEnE,gBAAqB,YAEvBz+E,EAAQn5G,SAAQ,CAACq5G,EAAOzyG,KACtB,MAAMslM,EAAWxlI,SAASstC,cAAc,MACxCk4F,EAAS9D,WAAa,SACnBxhM,EAAQ,eACTyyG,EAAMinB,mBACNjnB,EAAMz9G,kBACNy9G,EAAMuyF,qBACNvyF,EAAMwyF,sBACNxyF,EAAMyyF,gDAERI,EAASrL,QAAU,KACbyK,EACF38J,GAAOgoJ,gBAAgBt9E,EAAM34D,MAE7B/R,GAAOmvJ,YAAYzkF,EAAM34D,KAAM,CAAEm3I,MAAOoU,EAAWrU,QAASA,IAE9D,cAAmB,YAErBnrB,EAAKj8B,YAAY07D,MAEZz/B,EITe0/B,CAAQtU,EAAOD,EAAS0T,GAEd,IAA5B18J,EAAQjuC,SAASrC,OACnB,oBAAyB,CACvBgH,QAAS,6BAA6BuyL,EAAMv3D,MAAM0lE,yBAAyB1qK,SAASs8J,yCACpFt3D,MAAO,gBACPshE,UAAW,eACXC,SAAU,MAGZnqI,EAAM0wI,UAAY,GAClB1wI,EAAM84E,YAAY5hG,GAClB,gBAAqB,YAMlByW,eAAesuI,GAAkB13J,GAqBtC,MAAMmwK,EAAgBnwK,EAAKwpJ,SAASxmL,cAAgBP,MAChDu9B,EAAKwpJ,SAAS7mL,KAAI9B,GAAQ,KAAcA,KACxC,CAAC,KAAcm/B,EAAKwpJ,WAClB4mB,QAAkB7jL,QAAQ4iF,IAAIghG,SAC9B5jL,QAAQ4iF,IAAI,IAAI,IAAIp0E,IAAIq1K,EAAUztM,KAAIsC,GAAOA,EAAIqlM,gBAAe3nM,KAAI0hI,GAtB1Ej7E,eAA6Bi7E,GAC3B,KAAMA,KAAS+lE,IAAY,CAEzB,MAAMvkM,EAAS,CAAEhF,KAAMwjI,EAAOx+H,OAAQ,aAAc2jM,QAAS,EAAGj7E,OAAQ,CAAC,YAAa,YAAapwF,KAAM,eAAgB6vK,UAAW,KACpI,IAAIzqM,QAAYokM,GAAU9hM,GAC1B,IAAKtC,EAAI5B,KAAKomM,KAAKnM,MAAM,GAAI,CAC3B,MAAMjxL,EAAQ9E,EAAOhF,KAAKsvB,OAAO,OACjCtqB,EAAOhF,OAAoB,IAAX8J,GAAgB9E,EAAOhF,KAAK8C,MAAM,EAAGgH,GAAS9E,EAAOhF,KAAK8C,MAAMgH,EAAQ,EAAG9E,EAAOhF,KAAKwB,SAAYwD,EAAOhF,MAAM8N,QAAQ,OAAQ,IAAIA,QAAQ,yBAA0B,IAAIA,QAAQ,IAAK,IACvM9I,EAAO0oH,OAAS,CAAC,YAAa,YAC9BhrH,QAAYokM,GAAU9hM,GAEpBtC,EAAI5B,KAAKomM,KAAKnM,MAAM,GACtBwO,GAAU/lE,GAAS9gI,EAAI5B,KAAKomM,KAAKnM,MAAM,GAAGvsL,GAE1C+6L,GAAU/lE,GAAS,MAQ0DgsE,CAAahsE,MAChG,MAAMisE,EAAQ,GACd,IAAK,IAAIC,EAAM,IAAI,IAAIx1K,IAAIq1K,EAAUztM,KAAIsC,GAAOmlM,GAAUnlM,EAAIqlM,iBAAiBiG,EAAIluM,OAAQkuM,EAAMA,EAAI5sM,MAAM,IACzG,UAAW,MAAMi4L,WAAgB+L,GAAU,CAAE9hM,OAAQ,YAAawJ,GAAIkhM,EAAI5sM,MAAM,EAAG,IAAK6lM,QAAS,MAAO7nM,KAAKomM,KAAKnM,MAChH0U,EAAM1U,EAAMvsL,IAAMusL,EAGtB,MAAM4U,EAAa,GACnB,IAAK,MAAMC,KAAYL,EAAW,CAChC,IAAIzU,EACAC,EAAQ0U,EAAMlG,GAAUqG,EAASnG,cACrClhJ,eAAesnJ,EAAe1wK,GAE5B,IAAI2wK,EAAOC,EAOPC,EAAWC,EASf,GAfI9wK,EAAK27J,QAAQ34L,cAAgBP,OAC/BkuM,EAAQzwM,OAAO8/B,EAAK27J,QAAQ,IAC5BiV,EAAQ1wM,OAAO8/B,EAAK27J,QAAQ37J,EAAK27J,QAAQt5L,OAAS,KAElDsuM,EAAQC,EAAQ1wM,OAAO8/B,EAAK27J,SAG1B37J,EAAK47J,MAAMwO,UAAU2G,MAAMloM,MAAKy8L,GAA8B,YAAtBA,EAAK0L,eAAoD,OAArB1L,EAAKx8L,KAAK23D,QAAmB,gBAAiBzgC,EAAK8wK,UAEjID,EAAY7wK,EAAK47J,MAAMwO,UAAU2G,MAAM7qM,QAAOo/L,GAA8B,YAAtBA,EAAK0L,eAAoD,OAArB1L,EAAKx8L,KAAK23D,QAAmB,cAAa,GAAG33D,KAC9Hk3B,EAAK47J,MAAMwO,UAAU2G,MAAMloM,MAAKy8L,GAA8B,WAAtBA,EAAK0L,eAAmD,OAArB1L,EAAKx8L,KAAK23D,QAAmB,gBAEjHowI,EAAY7wK,EAAK47J,MAAMwO,UAAU2G,MAAM7qM,QAAOo/L,GAA8B,WAAtBA,EAAK0L,eAAmD,OAArB1L,EAAKx8L,KAAK23D,QAAmB,cAAa,GAAG33D,KACtIgoM,GAAY,GAEVD,GAAWzE,UAAYwE,GAAS5wK,EAAK59B,OAASw5L,EAAMwQ,WAAaxQ,EAAMsM,mBAAmBvM,SAAWC,EAAMwQ,UAAW,CAExH,MAAM6E,QAAiBtJ,GAAU,CAAE9hM,OAAQ,iBAAkBwJ,GAAIwhM,EAAUxhM,WACrEqhM,EAAc,CAAE9U,MAAOqV,EAAStvM,KAAK4oM,MAAO5O,QAAS37J,EAAK27J,QAASv5L,OAAQ49B,EAAK59B,OAAS6uM,EAAStvM,KAAK4oM,MAAM6B,SAAU0E,UAAWA,SACnI,GAAID,GAAWzE,UAAYwE,GAAS5wK,EAAK59B,OAASw5L,EAAMwQ,YAAcxQ,EAAMsM,mBAAmBvM,SAAWC,EAAMwQ,WAAauE,GAAS3wK,EAAK59B,OAASw5L,EAAMwQ,UAAY,GAO3K,GAJEzQ,EADE37J,EAAK27J,QAAQ34L,cAAgBP,MACrB,GAAGguM,EAASjE,eAAe,IAAMxsK,EAAK59B,OAASw5L,EAAMwQ,eAAeqE,EAASjE,eAAeiE,EAASjE,eAAenqM,OAAS,IAAM29B,EAAK59B,OAASw5L,EAAMwQ,YAEvJpsK,EAAK27J,SAAW37J,EAAK59B,OAASw5L,EAAMwQ,UAE5CpsK,EAAK8wK,WAAaA,EAAW,CAC/B,MAAMG,QAAiBtJ,GAAU,CAAE9hM,OAAQ,iBAAkBwJ,GAAIwhM,EAAUxhM,KAC3EusL,EAAQqV,EAAStvM,KAAK4oM,YAGxB,GAAQ33K,IAAI,oBAAqBoN,EAAK47J,MAAOiV,GAC7C,oBAAyB,CACvBxnM,QAAS,sCAAsC22B,EAAK47J,MAAMv3D,MAAM0lE,mBAAmB6G,IACnFvsE,MAAO,gBACPshE,UAAW,kBACXC,SAAU,KAIVjK,EADE37J,EAAK27J,QAAQ34L,cAAgBP,MACrB,GAAGvC,OAAOuwM,EAASjE,eAAe,SAAStsM,OAAOuwM,EAASjE,eAAeiE,EAASjE,eAAenqM,OAAS,MAE3GnC,OAAO8/B,EAAK27J,UAML,UAAlBC,GAAOn7H,QAAuBm7H,EAAMwQ,UAAYxQ,EAAMsM,kBAAkBvM,UAAa8U,EAASjE,iBAC7FiE,EAASjE,eAAexpM,cAAgBP,MAEG,IAAzC48B,SAASoxK,EAASjE,eAAe,IAEnC7Q,EAAU,GAAG8U,EAASjE,eAAe,QAAQiE,EAASjE,eAAeiE,EAASjE,eAAenqM,OAAS,MAEjGu5L,GAAOwQ,UAAYxQ,GAAOsM,mBAAmBvM,UAAYt8J,SAASoxK,EAASjE,eAAeiE,EAASjE,eAAenqM,OAAS,KAAOu5L,EAAMwQ,UAAYxQ,EAAMsM,kBAAkBvM,eAEzK+U,EAAc,CAAE9U,MAAOA,EAAOD,QAAS8U,EAASjE,eAAgBpqM,OAAQ,IAG9Eu5L,EAAU,GAAGz7L,OAAOuwM,EAASjE,eAAe,SAAStsM,OAAOuwM,EAASjE,eAAeiE,EAASjE,eAAenqM,OAAS,OAIpHu5L,GAAOwQ,UAAYxQ,GAAOsM,mBAAmBvM,UAAYt8J,SAASoxK,EAASjE,iBAAmB5Q,EAAMwQ,UAAYxQ,EAAMsM,kBAAkBvM,eAErI+U,EAAc,CAAE9U,MAAOA,EAAOD,QAAS8U,EAASjE,eAAgBpqM,OAAQ,IAG9Eu5L,EAAUz7L,OAAOuwM,EAASjE,iBAIhC,MAAMsD,EAAmBlU,GAAOmU,kBAAkB7pM,QAAOy1L,GAAWyT,GAAUrvM,KAAK47L,EAAQt3D,QAAUnkI,OAAOkvM,GAAUrvM,KAAK47L,EAAQt3D,OAAO,MAAQnkI,OAAOuwM,EAASjE,kBAAiB,GACnLgE,EAAW1qM,KAAK,CACds2L,WAAYR,GAAOv3D,MAAM0lE,cACzBrO,cAAeC,EACfO,aAAc4T,GAAoBV,GAAUrvM,KAAK+vM,EAAiBzrE,OAAO,GACzEm4D,iBAAkBsT,GAAkBlY,UACpC6E,WAAYb,GAAOqO,WAAWC,OAC9BrpM,KAAM,OACNwpM,YAAaoG,EACb7U,MAAOA,IAGX,OAA6B,IAAtB4U,EAAWnuM,OAAemuM,EAAW,GAAKA,EAG5C,MAAMpG,GAAYzgM,KAAK41B,MAAMyrC,aAAaX,QAAQ,eAAiB,8DC1O1E,MAAM,GAA+B5D,WAAWyqI,KCAnC,GAAO,CAClBC,OAAQ,GACRC,SAAU,GACV/hD,MAAO,iDACPgiD,cAAe,CAAC,gGCMX,MAAMC,GAAQ,IAAI/kL,SAAQC,KAC/B,KAAA49C,MAAK,gBAAgB,KACnB,GAAA13B,OAAA,KAAYnsC,OAAO+iB,OAAO,GAAI,KAAO6C,MAAK,KACxC,MAAMi5H,EAAO,GAAAmsD,MAAA,kBAgBb,GAfAnsD,EAAKosD,WAAWtyC,QAAO16J,IACrB,IAAc,IAAVA,EAAgB,CAClB,IAAK4gJ,EAAKqsD,YAAYtxM,MAAMuxM,kBAAkBriD,MAAM/lH,SAAS,kDAO3D,OANA,oBAAyB,CACvBjgC,QAAS,kEACTg7H,MAAO,cACPshE,UAAW,eACXC,SAAU,KAELxgD,EAAKusD,UAEdnlL,EAAQ44H,EAAKqsD,YAAYtxM,MAAMuxM,kBAAkBE,cACjDC,QAAQ7V,UAAUvkL,IAAI,cAGrB2tI,EAAKosD,WAAWrxM,MAGd,CACL,IAAKilJ,EAAKqsD,YAAYtxM,MAAMuxM,kBAAkBriD,MAAM/lH,SAAS,kDAO3D,OANA,oBAAyB,CACvBjgC,QAAS,kEACTg7H,MAAO,cACPshE,UAAW,eACXC,SAAU,KAELxgD,EAAKusD,UAEdnlL,EAAQ44H,EAAKqsD,YAAYtxM,MAAMuxM,kBAAkBE,mBAZjDC,QAAQjN,QAAUx/C,EAAK0sD,OACvBD,QAAQ7V,UAAU//H,OAAO,mBAiB1B7S,eAAe2oJ,GAAelxM,GACnC,OAAO,IAAI0rB,SAAQC,IACjB8kL,GAAMnlL,MAAK,KACT,GAAAumB,OAAA,iBAAwB,CACtBs/J,SAAU,EACVC,OAAQ,YACRC,2BAA2B,EAC3BC,mBAAmB,EACnBC,QAAS,YACTn9L,EAAG,WAAWpU,OACbsrB,MAAK5oB,IACN,GAAQqvB,IAAIrvB,GACZipB,EAAQjpB,GAAK0D,QAAQqvC,OAAOj0C,QAAUkB,GAAK0D,QAAQqvC,MAAM,GAAGjnC,aAyBpE,MAAMysK,WAAgB,MACpB94K,YAAa4jE,GACXzkC,QAEAphC,KAAK8/K,OAASj6G,EAAQj/B,SAAW,UACjC5mC,KAAKkjL,UAAY,UAAUljL,KAAK8/K,QAChC9/K,KAAKu1K,SAAW1vG,EAChB7lE,KAAKsxM,YAAc,GAEnBtxM,KAAK6hM,MAAQ,KAEb7hM,KAAKy4J,MAAQ,IAAIqpC,EAEjB9hM,KAAKkF,QAGPA,QACElF,KAAK8kC,cAAa,GAElB9kC,KAAKwkC,KAAK,aAAa,CAACoC,EAAUrF,KAChC,GAAIvhC,KAAKmjC,UAAW,OACpBnjC,KAAK2nC,UAAUf,EAAU5mC,KAAKkjL,WAC9B,MAAMC,EAAYnjL,KAAKu1K,SAASlvG,OAAO/kE,OACjCwnC,EAAW,IAAI,WAASq6I,GAC9B,IAAK,IAAI93K,EAAI,EAAGA,GAAK83K,EAAW93K,IAC9By9B,EAAS5pC,IAAImM,GAAG,GAElBrL,KAAK8oC,SAASA,MAGhB9oC,KAAKwkC,KAAK,cAAc,KACtBxkC,KAAKyoC,aAGPzoC,KAAK0kC,GAAG,WAAW,CAAC8xI,EAAYn1K,EAAQC,EAAQw/B,KAC9C,MAAMwH,EAAU,IAAMtoC,KAAKy4J,MAAM/hJ,IAAI,CACnCuS,GAAIo/B,eAAkBroD,KAAKojL,YAAY5M,EAAYn1K,EAAQC,GAAQ,CAACyI,EAAKnJ,KACvE,GAAImJ,GAAOnJ,GAAMU,SAAWA,EAAQ,OAAOgnC,IAC3CxH,EAAS/2B,EAAKnJ,MAEhBgJ,MAAO4sK,IAETluI,OAIJ+f,kBAAmBmuH,EAAYn1K,EAAQC,EAAQynC,GAC7C,MACMu6I,EADc9M,EAAax2K,KAAKu1K,SAASnvG,YACd/kE,EAC3BkiL,EAAWD,EAAahiL,EAAS,EACjCi0C,EAAQv1C,KAAKu1K,SAAShgI,MAC5B,IAAIvT,EACJ,GAAIuT,EAAMj0C,QAAU,EAClB0gC,EAAW,CAAC,CACVwS,IAAK,6CAA6Ce,EAAM,GAAGg8J,iDAAiD,YAC5G1qM,MAAOy8K,EACP51K,IAAK61K,QAEF,CACL,MAAMC,EAAiBjuI,EAAMpwC,QAAO0/D,GAAQA,EAAKxjE,QAAUkiL,GAAa1+G,EAAKxjE,OAASwjE,EAAKvjE,OAAUgiL,IACrG,GAAIE,EAAeliL,OAAS,EAC1B,OAAOynC,EAAG,IAAI9pC,MAAM,gEAGtB+iC,EAAWwhJ,EAAe5hL,KAAIijE,IAC5B,MAAM6+G,EAAU7+G,EAAKxjE,OAASwjE,EAAKvjE,OAAS,EAE5C,MAAO,CACLkzC,IAFU,6CAA6CqwB,EAAK0sI,iDAAiD,YAG7G5tB,kBAAmB7yK,KAAKC,IAAI8zD,EAAKxjE,OAASiiL,EAAY,GACtDz8K,MAAOiK,KAAKC,IAAIuyK,EAAaz+G,EAAKxjE,OAAQ,GAC1CqM,IAAKoD,KAAK/D,IAAI22K,EAASH,EAAW1+G,EAAKxjE,YAI7C,IAGIsS,EAHAiwK,EAAuB,EACvBC,GAAW,EAGX7hJ,EAAS1gC,OAAS,IACpBqS,EAAM,GAAO5Q,MAAMzB,IAGrB,IAAI,IAAEkB,EAAG,OAAEi0C,EAAM,SAAE+6J,EAAQ,QAAEC,EAAO,KAAE1d,GAAS/zL,KAAKsxM,YACpD,UAAW,MAAMhpK,KAAWtG,EAAU,CACpC,MAAM,IAAEwS,EAAG,MAAE3tC,EAAK,IAAE6G,GAAQ46B,EAC5B,SAASw7I,EAAYthL,EAAK5B,GACxB,IAAK4B,GAAOA,EAAIgrH,OAAS,KAAOhrH,EAAIgrH,QAAU,IAAK,CACjD,GAAIq2D,EAAU,OAEd,OADAA,GAAW,EACJ96I,EAAG,IAAI9pC,MAAM,+BAA+BuD,GAAKgrH,WAElC,IAApBxrF,EAAS1gC,OACXynC,EAAG,KAAMnoC,IAETA,EAAKsC,KAAKyQ,EAAK20B,EAAQq7I,qBACjBC,IAAyB5hJ,EAAS1gC,QACtCynC,EAAG,KAAMp1B,IAIf,GAAI69L,IAAa3qM,EAAQ,GAAKktL,GAAM1+I,QAAQq8J,QAAS,CACnDrpJ,eAAiB/Z,EAAMmI,GACrB,IAAIghE,EAAW,GACXk6F,EAAgB,EAChB58K,GAAO,EACPn2B,EAAO,IAIX,UAHgBsd,IAAOtd,EAAOsd,IAGtB6Y,GAAM,CACZ,MAAM68K,QAAWn7J,EAAOnI,OAExB,GADAvZ,EAAO68K,EAAG78K,KACNA,EAEF,kBADMxxB,EAAOk0G,EAAUk6F,IAMvB,IAHAA,GAAiBC,EAAGnwM,MAAMM,WAC1B01G,EAAS1yG,KAAK6sM,EAAGnwM,OAEVkwM,GAAiB/yM,GAAM,CAC5B,MAAMiU,EAAItP,EAAOk0G,GACjBk6F,GAAiB/yM,QACXiU,EAAEjQ,MAAM,EAAGhE,GACjB64G,EAAW,CAAC5kG,EAAEjQ,MAAMhE,EAAMiU,EAAEvR,WAKhCyyL,GAAMA,EAAK57F,QACf47F,EAAO,IAAI/gC,sBACLhzJ,KAAK6hM,MACX,IACEr/L,QAAYmwJ,MAAMn+G,EAAK,CACrB2sE,QAAS,CACPhjF,MAAO,SAASt3B,KAChBk+I,cAAe,gBAAkBwrD,IAEnCl7J,OAAQ0+I,EAAK1+I,SAEf,MAAO3uC,GAGP,MAFA1G,KAAK6hM,MAAQA,EAAM,KACnB/d,IACMp9K,EAER1G,KAAK6hM,MAAQA,EAAM,KACnBprJ,EAASnI,EAAK9rC,EAAIzC,KAAKu2J,aACvBm7C,SAAiBh7J,EAAO/vB,QAAQjlB,MAElC+vM,EAAW9jM,EACX+jM,EAAQ/jM,EAAM7G,EAAQ,GACtBi9K,EAAWthL,SAAYi0C,EAAO/vB,QAAQjlB,OAAS,IAAIk2B,YAErD33B,KAAKsxM,YAAc,CAAE9uM,IAAAA,EAAKi0C,OAAAA,EAAQ+6J,SAAAA,EAAUC,QAAAA,EAAS1d,KAAAA,GAGvDvuJ,UACExlC,KAAKsxM,aAAavd,MAAM57F,QACxBn4F,KAAKy4J,MAAMjzH,UACXxlC,KAAKsxM,aAAavd,MAAM57F,QACxB/2D,MAAMoE,UACNxlC,KAAKu1K,SAAW,MC3OpB,MAAMs8B,GAAiB,GACvB,IAAK,MAAMhwM,KAAQ6nE,SAASooI,uBAAuB,QAC5CD,GAAehwM,EAAKs9L,QAAQr/L,MAG/B+xM,GAAehwM,EAAKs9L,QAAQr/L,MAAQ,CAAC+xM,GAAehwM,EAAKs9L,QAAQr/L,MAAO+B,GAFxEgwM,GAAehwM,EAAKs9L,QAAQr/L,MAAQ+B,EAKxCwO,OAAOsmC,iBAAiB,gBAAgB,KACtChF,GAAOnM,aAEF,MAAMmM,GAAS,IAAI2iJ,EAAiB,CACzCC,eAAgB,CACdjiB,SAAU,IACVI,cAAmC,QAApB8wB,EAASZ,SACxBhwB,YAAiC,QAApB4wB,EAASZ,SACtB3xJ,QAAS,CACP5B,SAAUm0J,EAAST,UAAUz1L,MAAM,OAErCgyK,cAAc,GAEhBxpC,SAAU+7D,GACV7mB,MACA2M,OACArY,cAAc,EACdoY,cAAeqa,YACfhZ,OAAQyK,EAASjB,UACjBtJ,SAAU95L,OAAOqkM,EAAStB,SAC1BzK,YAAat4L,OAAOqkM,EAASvB,SAC7B5K,oBAAqBmM,EAASnB,SAC9B5L,SAAU+M,EAASpB,QACnBxI,iBAAkB4J,EAASX,SAC3B/L,mBAAoB0M,EAASrB,QAC7B9L,iBAAkB7wL,OAAO2G,OAAO6lM,cAAcnxM,SAASsE,QAAOtD,GAAQA,EAAKJ,QAAU+hM,EAASlB,YAAW,GAAG9F,YAC5G7F,iBAAkBA,KAEpBhlJ,GAAOjN,GAAG,iBAAiB,EAAGmgC,KAAAA,MAC5B,oBAAyB,CACvBv8D,QAAS,4BAA4Bu8D,EAAK/kE,qDAC1CwjI,MAAO,oBACPshE,UAAW,gBACXC,SAAU,QAGdlzJ,GAAOjN,GAAG,WDUH2jB,eAAgCwd,SAC/B0qI,GACN,UAAW,MAAM1rI,KAAQgB,EAAQtwB,MAAO,CACtC,MAAMg8J,QAAiBP,GAAcnsI,EAAK/kE,MAC1C,IAAIyxM,EASF,OANA,oBAAyB,CACvBjpM,QAAS,mCAAmCu8D,EAAK/kE,8BACjDwjI,MAAO,gBACPshE,UAAW,kBACXC,SAAU,KAEL,KARPhgI,EAAK0sI,SAAWA,QAUZ1P,EAAM,KAEdh8H,EAAQs4G,WAAW,IAAIpD,GAAQl1G,OC1BjCl0B,GAAOjN,GAAG,WAAW,EAAGq4J,UAAAA,OAClBA,GAAWlC,OAAOwQ,UAAYtO,GAAWlC,OAAOsM,mBAAmBvM,UACjE4I,EAASP,SAAWlG,EAAUlC,MAAMwQ,UAAYtO,EAAUlC,MAAMsM,mBAAmBvM,QAAUmC,EAAUpC,gBNpCxG,SAAkBoC,GACnBA,EAAUlC,OAAS5wH,aAAaX,QAAQ,YAC1Cs9H,GAAU,CAAE9hM,OAAQ,iBAAkBwJ,GAAIyuL,EAAUlC,MAAMvsL,KAAM8c,MAAK5oB,IACnE,GAAKA,EAAI+G,QAAmC,MAAzB/G,EAAI+G,OAAO,GAAGikH,QAAmBhrH,EAAI5B,KAAKqxM,UAAU99B,UAAY4oB,EAAUpC,eAAwC,IAAvBoC,EAAUsO,SAAgB,CACtI,MAAMhqC,EAAQ,uOASRyrC,EAAY,CAChBh7K,OAAQ,EACRxjB,GAAIyuL,EAAUlC,MAAMvsL,GACpBk/G,OAAQ,UACRotE,QAASmC,EAAUpC,eAAiB,GAElCoC,EAAUpC,gBAAkBoC,EAAUlC,MAAMwQ,UAAmC,IAAvBtO,EAAUsO,WACpEyB,EAAUt/E,OAAS,YACe,cAA9BhrH,EAAI5B,KAAKqxM,UAAUzkF,SACrBs/E,EAAUh7K,OAAStvB,EAAI5B,KAAKqxM,UAAUngL,OAAS,IAenD+6K,GAZgB,CACd/nM,OAAQ,OACRq8G,QAAS,CACPisF,cAAe,UAAYnjI,aAAaX,QAAQ,WAChD,eAAgB,mBAChB4jI,OAAQ,oBAEVntM,KAAM6I,KAAKC,UAAU,CACnBw4J,MAAOA,EACPyrC,UAAWA,UMGjBoF,CAAQnV,MAYdprJ,GAAOjN,GAAG,YAAY,KACpBr0B,OAAOwgC,SAAS6S,KAAO,eAEzB/R,GAAOjN,GAAG,QAAQ,EAAGq4J,UAAAA,MACfA,EAAUlC,MACZ0R,GAAWxP,EAAUlC,MAAOv8J,SAASy+J,EAAUpC,eAAiB,GAEhE,oBAAyB,CACvBryL,QAAS,+DACTg7H,MAAO,gBACPshE,UAAW,eACXC,SAAU,QAIhBlzJ,GAAOjN,GAAG,QAAQ,EAAGq4J,UAAAA,MACfA,EAAUlC,MACZ0R,GAAWxP,EAAUlC,MAAOkC,EAAUpC,cAAgB,GAEtD,oBAAyB,CACvBryL,QAAS,+DACTg7H,MAAO,gBACPshE,UAAW,eACXC,SAAU,QAIhBlzJ,GAAOjN,GAAG,mBAAmBmhC,IAC3B8wH,GAAiB,CAAElO,SAAU5iH,EAAQ/lE,OAAQsrB,MAAK29K,IAChDA,EAAiBlF,QAAU,IAAMlyJ,GAAOmvJ,YAAYj7H,EAAS,CAAEg1H,MAAOkO,EAAkBnO,QAASmO,EAAiBnO,UAClH,MAAMsU,EAAW3E,GAAYxB,GAC7Br/H,SAASupE,cAAc,cAAcO,YAAY07D,SAGrDv9J,GAAOjN,GAAG,eAAe2jB,OAAS9S,MAAAA,EAAOswB,QAAAA,MACvC6D,SAASupE,cAAc,aAAaupD,YAAc,GAClD,MAAMgL,EAAQ,GACd,IAAK,MAAM3iI,KAAQtvB,EAAO,CACxB,MAAMwzJ,QAAyBpS,GAAiB,CAAElO,SAAU5jH,EAAK/kE,OACjEipM,EAAiBlF,QAAU,KACzBlyJ,GAAOmrJ,WAAWj3H,EAAS,CACzBg1H,MAAOkO,EACPnO,QAASmO,EAAiBO,YAAY1O,QACtC/1H,KAAMA,KAGV2iI,EAAMziM,KAAKwlM,GAAYxB,IAEzBr/H,SAASupE,cAAc,aAAaI,UAAUm0D,MAEhD71J,GAAOjN,GAAG,YAAYmhC,IACpB,oBAAyB,CACvBv9D,QAAS,yDAAyDu9D,EAAQj/B,mBAC1E08F,MAAO,gBACPshE,UAAW,eACXC,SAAU,QAGdlzJ,GAAOjN,GAAG,YAAYmhC,IACK,IAArBA,EAAQsuG,UACV,oBAAyB,CACvB7rK,QAAS,oDAAoDu9D,EAAQj/B,oDACrE08F,MAAO,gBACPshE,UAAW,eACXC,SAAU,QAIhBlzJ,GAAOmpJ,WAAa,CAAEh7L,KAAM,QAE5BuQ,OAAOshC,OAASA,GAEZwvJ,EAAa/hM,IAAI,SAASuyC,GAAOmvJ,YAAYK,EAAa/hM,IAAI,SAElE2vC,gBPmSO,WACDk7B,aAAaX,QAAQ,WACvBs9H,GAAU,CAAE9hM,OAAQ,WAAYsmB,MAAKllB,IACnCisM,MAAM7c,gBAAgB,QACtB6c,MAAMj9D,aAAa,aAAc,GAAGhvI,EAAOtF,KAAKwxM,OAAOtyM,yBACvDqyM,MAAM/G,UAAY,iFAENllM,EAAOtF,KAAKwxM,OAAOC,OAAOlJ,sCACjBjjM,EAAOtF,KAAKwxM,OAAOtyM,yFAGxCqyM,MAAMtO,QAAU,KACd55H,aAAab,WAAW,WACxBv4B,SAASkkJ,UAEX+R,GAAO5gM,EAAOtF,KAAKwxM,OAAO9jM,GAC1B02L,SAGFA,KACA2C,KAAK1M,UAAUvkL,IAAI","sources":["webpack://miru/./node_modules/addr-to-ip-port/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1.js","webpack://miru/./node_modules/asn1.js/lib/asn1/api.js","webpack://miru/./node_modules/asn1.js/lib/asn1/base/buffer.js","webpack://miru/./node_modules/asn1.js/lib/asn1/base/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1/base/node.js","webpack://miru/./node_modules/asn1.js/lib/asn1/base/reporter.js","webpack://miru/./node_modules/asn1.js/lib/asn1/constants/der.js","webpack://miru/./node_modules/asn1.js/lib/asn1/constants/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1/decoders/der.js","webpack://miru/./node_modules/asn1.js/lib/asn1/decoders/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1/decoders/pem.js","webpack://miru/./node_modules/asn1.js/lib/asn1/encoders/der.js","webpack://miru/./node_modules/asn1.js/lib/asn1/encoders/index.js","webpack://miru/./node_modules/asn1.js/lib/asn1/encoders/pem.js","webpack://miru/./node_modules/asn1.js/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/assert/build/assert.js","webpack://miru/./node_modules/assert/build/internal/assert/assertion_error.js","webpack://miru/./node_modules/assert/build/internal/errors.js","webpack://miru/./node_modules/assert/build/internal/util/comparisons.js","webpack://miru/./node_modules/base64-js/index.js","webpack://miru/./node_modules/bencode/lib/decode.js","webpack://miru/./node_modules/bencode/lib/encode.js","webpack://miru/./node_modules/bencode/lib/encoding-length.js","webpack://miru/./node_modules/bencode/lib/index.js","webpack://miru/./node_modules/bencode/lib/util.js","webpack://miru/./node_modules/bep53-range/index.js","webpack://miru/./node_modules/binary-search/index.js","webpack://miru/./node_modules/bitfield/lib/index.js","webpack://miru/./node_modules/bittorrent-protocol/index.js","webpack://miru/./node_modules/bittorrent-tracker/client.js","webpack://miru/./node_modules/bittorrent-tracker/lib/client/tracker.js","webpack://miru/./node_modules/bittorrent-tracker/lib/client/websocket-tracker.js","webpack://miru/./node_modules/bittorrent-tracker/lib/common.js","webpack://miru/./node_modules/blob-to-buffer/index.js","webpack://miru/./node_modules/block-stream2/index.js","webpack://miru/./node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/brorand/index.js","webpack://miru/./node_modules/browserify-aes/aes.js","webpack://miru/./node_modules/browserify-aes/authCipher.js","webpack://miru/./node_modules/browserify-aes/browser.js","webpack://miru/./node_modules/browserify-aes/decrypter.js","webpack://miru/./node_modules/browserify-aes/encrypter.js","webpack://miru/./node_modules/browserify-aes/ghash.js","webpack://miru/./node_modules/browserify-aes/incr32.js","webpack://miru/./node_modules/browserify-aes/modes/cbc.js","webpack://miru/./node_modules/browserify-aes/modes/cfb.js","webpack://miru/./node_modules/browserify-aes/modes/cfb1.js","webpack://miru/./node_modules/browserify-aes/modes/cfb8.js","webpack://miru/./node_modules/browserify-aes/modes/ctr.js","webpack://miru/./node_modules/browserify-aes/modes/ecb.js","webpack://miru/./node_modules/browserify-aes/modes/index.js","webpack://miru/./node_modules/browserify-aes/modes/ofb.js","webpack://miru/./node_modules/browserify-aes/streamCipher.js","webpack://miru/./node_modules/browserify-cipher/browser.js","webpack://miru/./node_modules/browserify-des/index.js","webpack://miru/./node_modules/browserify-des/modes.js","webpack://miru/./node_modules/browserify-rsa/index.js","webpack://miru/./node_modules/browserify-sign/algos.js","webpack://miru/./node_modules/browserify-sign/browser/index.js","webpack://miru/./node_modules/browserify-sign/browser/sign.js","webpack://miru/./node_modules/browserify-sign/browser/verify.js","webpack://miru/./node_modules/browserify-zlib/lib/binding.js","webpack://miru/./node_modules/browserify-zlib/lib/index.js","webpack://miru/./node_modules/buffer-alloc-unsafe/index.js","webpack://miru/./node_modules/buffer-alloc/index.js","webpack://miru/./node_modules/buffer-fill/index.js","webpack://miru/./node_modules/buffer-xor/index.js","webpack://miru/./node_modules/buffer/index.js","webpack://miru/./node_modules/builtin-status-codes/browser.js","webpack://miru/./node_modules/cache-chunk-store/index.js","webpack://miru/./node_modules/call-bind/callBound.js","webpack://miru/./node_modules/call-bind/index.js","webpack://miru/./node_modules/chunk-store-stream/write.js","webpack://miru/./node_modules/cipher-base/index.js","webpack://miru/./node_modules/clone/clone.js","webpack://miru/./node_modules/console-browserify/index.js","webpack://miru/./node_modules/cpus/browser.js","webpack://miru/./node_modules/create-ecdh/browser.js","webpack://miru/./node_modules/create-ecdh/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/create-hash/browser.js","webpack://miru/./node_modules/create-hash/md5.js","webpack://miru/./node_modules/create-hmac/browser.js","webpack://miru/./node_modules/create-hmac/legacy.js","webpack://miru/./node_modules/create-torrent/index.js","webpack://miru/./node_modules/crypto-browserify/index.js","webpack://miru/./node_modules/debug/src/browser.js","webpack://miru/./node_modules/debug/src/common.js","webpack://miru/./node_modules/define-properties/index.js","webpack://miru/./node_modules/des.js/lib/des.js","webpack://miru/./node_modules/des.js/lib/des/cbc.js","webpack://miru/./node_modules/des.js/lib/des/cipher.js","webpack://miru/./node_modules/des.js/lib/des/des.js","webpack://miru/./node_modules/des.js/lib/des/ede.js","webpack://miru/./node_modules/des.js/lib/des/utils.js","webpack://miru/./node_modules/diffie-hellman/browser.js","webpack://miru/./node_modules/diffie-hellman/lib/dh.js","webpack://miru/./node_modules/diffie-hellman/lib/generatePrime.js","webpack://miru/./node_modules/diffie-hellman/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/ebml-stream/lib/EbmlStreamDecoder.js","webpack://miru/./node_modules/ebml-stream/lib/EbmlStreamEncoder.js","webpack://miru/./node_modules/ebml-stream/lib/index.js","webpack://miru/./node_modules/ebml-stream/lib/models/EbmlTag.js","webpack://miru/./node_modules/ebml-stream/lib/models/EbmlTagFactory.js","webpack://miru/./node_modules/ebml-stream/lib/models/enums/BlockLacing.js","webpack://miru/./node_modules/ebml-stream/lib/models/enums/EbmlElementType.js","webpack://miru/./node_modules/ebml-stream/lib/models/enums/EbmlTagId.js","webpack://miru/./node_modules/ebml-stream/lib/models/enums/EbmlTagPosition.js","webpack://miru/./node_modules/ebml-stream/lib/models/tags/Block.js","webpack://miru/./node_modules/ebml-stream/lib/models/tags/EbmlDataTag.js","webpack://miru/./node_modules/ebml-stream/lib/models/tags/EbmlMasterTag.js","webpack://miru/./node_modules/ebml-stream/lib/models/tags/SimpleBlock.js","webpack://miru/./node_modules/ebml-stream/lib/tools.js","webpack://miru/./node_modules/elliptic/lib/elliptic.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/base.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/edwards.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/index.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/mont.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curve/short.js","webpack://miru/./node_modules/elliptic/lib/elliptic/curves.js","webpack://miru/./node_modules/elliptic/lib/elliptic/ec/index.js","webpack://miru/./node_modules/elliptic/lib/elliptic/ec/key.js","webpack://miru/./node_modules/elliptic/lib/elliptic/ec/signature.js","webpack://miru/./node_modules/elliptic/lib/elliptic/eddsa/index.js","webpack://miru/./node_modules/elliptic/lib/elliptic/eddsa/key.js","webpack://miru/./node_modules/elliptic/lib/elliptic/eddsa/signature.js","webpack://miru/./node_modules/elliptic/lib/elliptic/precomputed/secp256k1.js","webpack://miru/./node_modules/elliptic/lib/elliptic/utils.js","webpack://miru/./node_modules/elliptic/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/end-of-stream/index.js","webpack://miru/./node_modules/err-code/index.js","webpack://miru/./node_modules/es6-object-assign/index.js","webpack://miru/./node_modules/events/events.js","webpack://miru/./node_modules/evp_bytestokey/index.js","webpack://miru/./node_modules/fast-fifo/fixed-size.js","webpack://miru/./node_modules/fast-fifo/index.js","webpack://miru/./node_modules/filestream/read.js","webpack://miru/./node_modules/foreach/index.js","webpack://miru/./node_modules/function-bind/implementation.js","webpack://miru/./node_modules/function-bind/index.js","webpack://miru/./node_modules/get-browser-rtc/index.js","webpack://miru/./node_modules/get-intrinsic/index.js","webpack://miru/./node_modules/has-symbols/index.js","webpack://miru/./node_modules/has-symbols/shams.js","webpack://miru/./node_modules/has-tostringtag/shams.js","webpack://miru/./node_modules/has/src/index.js","webpack://miru/./node_modules/hash-base/index.js","webpack://miru/./node_modules/hash.js/lib/hash.js","webpack://miru/./node_modules/hash.js/lib/hash/common.js","webpack://miru/./node_modules/hash.js/lib/hash/hmac.js","webpack://miru/./node_modules/hash.js/lib/hash/ripemd.js","webpack://miru/./node_modules/hash.js/lib/hash/sha.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/1.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/224.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/256.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/384.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/512.js","webpack://miru/./node_modules/hash.js/lib/hash/sha/common.js","webpack://miru/./node_modules/hash.js/lib/hash/utils.js","webpack://miru/./node_modules/hmac-drbg/lib/hmac-drbg.js","webpack://miru/./node_modules/https-browserify/index.js","webpack://miru/./node_modules/idb-chunk-store/index.js","webpack://miru/./node_modules/idb/build/esm/wrap-idb-value.js","webpack://miru/./node_modules/idb/build/esm/index.js","webpack://miru/./node_modules/ieee754/index.js","webpack://miru/./node_modules/immediate-chunk-store/index.js","webpack://miru/./node_modules/inherits/inherits_browser.js","webpack://miru/./node_modules/is-arguments/index.js","webpack://miru/./node_modules/is-ascii/index.js","webpack://miru/./node_modules/is-generator-function/index.js","webpack://miru/./node_modules/is-nan/implementation.js","webpack://miru/./node_modules/is-nan/index.js","webpack://miru/./node_modules/is-nan/polyfill.js","webpack://miru/./node_modules/is-nan/shim.js","webpack://miru/./node_modules/is-typed-array/index.js","webpack://miru/./node_modules/is-typedarray/index.js","webpack://miru/./node_modules/junk/index.js","webpack://miru/./node_modules/limiter/index.js","webpack://miru/./node_modules/limiter/lib/clock.js","webpack://miru/./node_modules/limiter/lib/rateLimiter.js","webpack://miru/./node_modules/limiter/lib/tokenBucket.js","webpack://miru/./node_modules/lru/index.js","webpack://miru/./node_modules/lt_donthave/index.js","webpack://miru/./node_modules/magnet-uri/index.js","webpack://miru/./node_modules/md5.js/index.js","webpack://miru/./node_modules/mediasource/index.js","webpack://miru/./node_modules/memory-chunk-store/index.js","webpack://miru/./node_modules/miller-rabin/lib/mr.js","webpack://miru/./node_modules/miller-rabin/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/mime/Mime.js","webpack://miru/./node_modules/mime/index.js","webpack://miru/./node_modules/mime/types/other.js","webpack://miru/./node_modules/mime/types/standard.js","webpack://miru/./node_modules/minimalistic-assert/index.js","webpack://miru/./node_modules/minimalistic-crypto-utils/lib/utils.js","webpack://miru/./node_modules/mp4-box-encoding/boxes.js","webpack://miru/./node_modules/mp4-box-encoding/descriptor.js","webpack://miru/./node_modules/mp4-box-encoding/index.js","webpack://miru/./node_modules/mp4-stream/decode.js","webpack://miru/./node_modules/mp4-stream/encode.js","webpack://miru/./node_modules/mp4-stream/index.js","webpack://miru/./node_modules/ms/index.js","webpack://miru/./node_modules/multistream/index.js","webpack://miru/./node_modules/next-event/index.js","webpack://miru/./node_modules/object-is/implementation.js","webpack://miru/./node_modules/object-is/index.js","webpack://miru/./node_modules/object-is/polyfill.js","webpack://miru/./node_modules/object-is/shim.js","webpack://miru/./node_modules/object-keys/implementation.js","webpack://miru/./node_modules/object-keys/index.js","webpack://miru/./node_modules/object-keys/isArguments.js","webpack://miru/./node_modules/once/once.js","webpack://miru/./node_modules/pako/lib/utils/common.js","webpack://miru/./node_modules/pako/lib/zlib/adler32.js","webpack://miru/./node_modules/pako/lib/zlib/constants.js","webpack://miru/./node_modules/pako/lib/zlib/crc32.js","webpack://miru/./node_modules/pako/lib/zlib/deflate.js","webpack://miru/./node_modules/pako/lib/zlib/inffast.js","webpack://miru/./node_modules/pako/lib/zlib/inflate.js","webpack://miru/./node_modules/pako/lib/zlib/inftrees.js","webpack://miru/./node_modules/pako/lib/zlib/messages.js","webpack://miru/./node_modules/pako/lib/zlib/trees.js","webpack://miru/./node_modules/pako/lib/zlib/zstream.js","webpack://miru/./node_modules/parse-asn1/asn1.js","webpack://miru/./node_modules/parse-asn1/certificate.js","webpack://miru/./node_modules/parse-asn1/fixProc.js","webpack://miru/./node_modules/parse-asn1/index.js","webpack://miru/./node_modules/parse-torrent/index.js","webpack://miru/./node_modules/path-browserify/index.js","webpack://miru/./node_modules/pbkdf2/browser.js","webpack://miru/./node_modules/pbkdf2/lib/async.js","webpack://miru/./node_modules/pbkdf2/lib/default-encoding.js","webpack://miru/./node_modules/pbkdf2/lib/precondition.js","webpack://miru/./node_modules/pbkdf2/lib/sync-browser.js","webpack://miru/./node_modules/pbkdf2/lib/to-buffer.js","webpack://miru/./node_modules/piece-length/index.js","webpack://miru/./node_modules/process-fast/index.js","webpack://miru/./node_modules/public-encrypt/browser.js","webpack://miru/./node_modules/public-encrypt/mgf.js","webpack://miru/./node_modules/public-encrypt/node_modules/bn.js/lib/bn.js","webpack://miru/./node_modules/public-encrypt/privateDecrypt.js","webpack://miru/./node_modules/public-encrypt/publicEncrypt.js","webpack://miru/./node_modules/public-encrypt/withPublic.js","webpack://miru/./node_modules/public-encrypt/xor.js","webpack://miru/./node_modules/pump/index.js","webpack://miru/./node_modules/querystring/decode.js","webpack://miru/./node_modules/querystring/encode.js","webpack://miru/./node_modules/querystring/index.js","webpack://miru/./node_modules/queue-microtask/index.js","webpack://miru/./node_modules/queue-tick/queue-microtask.js","webpack://miru/./node_modules/random-iterate/index.js","webpack://miru/./node_modules/randombytes/browser.js","webpack://miru/./node_modules/randomfill/browser.js","webpack://miru/./node_modules/range-parser/index.js","webpack://miru/./node_modules/range-slice-stream/index.js","webpack://miru/./node_modules/rc4/rc4.js","webpack://miru/./node_modules/readable-stream/errors-browser.js","webpack://miru/./node_modules/readable-stream/lib/_stream_duplex.js","webpack://miru/./node_modules/readable-stream/lib/_stream_passthrough.js","webpack://miru/./node_modules/readable-stream/lib/_stream_readable.js","webpack://miru/./node_modules/readable-stream/lib/_stream_transform.js","webpack://miru/./node_modules/readable-stream/lib/_stream_writable.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/async_iterator.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/buffer_list.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/destroy.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/end-of-stream.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/from-browser.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/pipeline.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/state.js","webpack://miru/./node_modules/readable-stream/lib/internal/streams/stream-browser.js","webpack://miru/./node_modules/readable-stream/readable-browser.js","webpack://miru/./node_modules/render-media/index.js","webpack://miru/./node_modules/ripemd160/index.js","webpack://miru/./node_modules/run-parallel-limit/index.js","webpack://miru/./node_modules/run-parallel/index.js","webpack://miru/./node_modules/rusha/dist/rusha.js","webpack://miru/./node_modules/safe-buffer/index.js","webpack://miru/./node_modules/safer-buffer/safer.js","webpack://miru/./node_modules/sha.js/hash.js","webpack://miru/./node_modules/sha.js/index.js","webpack://miru/./node_modules/sha.js/sha.js","webpack://miru/./node_modules/sha.js/sha1.js","webpack://miru/./node_modules/sha.js/sha224.js","webpack://miru/./node_modules/sha.js/sha256.js","webpack://miru/./node_modules/sha.js/sha384.js","webpack://miru/./node_modules/sha.js/sha512.js","webpack://miru/./node_modules/simple-concat/index.js","webpack://miru/./node_modules/simple-get/index.js","webpack://miru/./node_modules/simple-peer/index.js","webpack://miru/./node_modules/simple-sha1/browser.js","webpack://miru/./node_modules/simple-sha1/rusha-worker-sha1.js","webpack://miru/./node_modules/simple-websocket/index.js","webpack://miru/./node_modules/speed-limiter/index.js","webpack://miru/./node_modules/speed-limiter/lib/throttle-group.js","webpack://miru/./node_modules/speed-limiter/lib/throttle.js","webpack://miru/./node_modules/speed-limiter/lib/utils.js","webpack://miru/./node_modules/speedometer/index.js","webpack://miru/./node_modules/stream-browserify/index.js","webpack://miru/./node_modules/stream-http/index.js","webpack://miru/./node_modules/stream-http/lib/capability.js","webpack://miru/./node_modules/stream-http/lib/request.js","webpack://miru/./node_modules/stream-http/lib/response.js","webpack://miru/./node_modules/stream-to-blob-url/index.js","webpack://miru/./node_modules/stream-to-blob/index.js","webpack://miru/./node_modules/stream-with-known-length-to-buffer/index.js","webpack://miru/./node_modules/streamx/index.js","webpack://miru/./node_modules/string_decoder/lib/string_decoder.js","webpack://miru/./node_modules/thirty-two/lib/thirty-two/index.js","webpack://miru/./node_modules/thirty-two/lib/thirty-two/thirty-two.js","webpack://miru/./node_modules/to-arraybuffer/index.js","webpack://miru/./node_modules/torrent-discovery/index.js","webpack://miru/./node_modules/torrent-piece/index.js","webpack://miru/./node_modules/typedarray-to-buffer/index.js","webpack://miru/./node_modules/uint64be/index.js","webpack://miru/./node_modules/unordered-array-remove/index.js","webpack://miru/./node_modules/url/node_modules/punycode/punycode.js","webpack://miru/./node_modules/url/url.js","webpack://miru/./node_modules/url/util.js","webpack://miru/./node_modules/ut_metadata/index.js","webpack://miru/./node_modules/util-deprecate/browser.js","webpack://miru/./node_modules/util/support/isBufferBrowser.js","webpack://miru/./node_modules/util/support/types.js","webpack://miru/./node_modules/util/util.js","webpack://miru/./node_modules/videostream/mp4-remuxer.js","webpack://miru/./node_modules/videostream/videostream.js","webpack://miru/./node_modules/webtorrent/index.js","webpack://miru/./node_modules/webtorrent/lib/file-stream.js","webpack://miru/./node_modules/webtorrent/lib/file.js","webpack://miru/./node_modules/webtorrent/lib/peer.js","webpack://miru/./node_modules/webtorrent/lib/rarity-map.js","webpack://miru/./node_modules/webtorrent/lib/torrent.js","webpack://miru/./node_modules/webtorrent/lib/webconn.js","webpack://miru/./node_modules/which-typed-array/index.js","webpack://miru/./node_modules/wrappy/wrappy.js","webpack://miru/./node_modules/xtend/immutable.js","webpack://miru/./node_modules/available-typed-arrays/index.js","webpack://miru/./node_modules/es-abstract/helpers/getOwnPropertyDescriptor.js","webpack://miru/webpack/bootstrap","webpack://miru/webpack/runtime/compat get default export","webpack://miru/webpack/runtime/define property getters","webpack://miru/webpack/runtime/global","webpack://miru/webpack/runtime/hasOwnProperty shorthand","webpack://miru/webpack/runtime/make namespace object","webpack://miru/webpack/runtime/node module decorator","webpack://miru/./node_modules/matroska-subtitles/dist/matroska-subtitles.module.js","webpack://miru/./node_modules/fsa-chunk-store/node_modules/idb-keyval/dist/index.js","webpack://miru/./node_modules/fsa-chunk-store/node_modules/safari-14-idb-fix/dist/index.js","webpack://miru/./node_modules/fsa-chunk-store/index.js","webpack://miru/./node_modules/hybrid-chunk-store/index.js","webpack://miru/./node_modules/webtorrent-player/lib/subtitles-octopus.js","webpack://miru/./node_modules/webtorrent-player/lib/peer.js","webpack://miru/./node_modules/webtorrent-player/index.js","webpack://miru/external var \"halfmoon\"","webpack://miru/./app/js/util.js","webpack://miru/./node_modules/idb-keyval/dist/esm/index.js","webpack://miru/./node_modules/safari-14-idb-fix/dist/esm/index.js","webpack://miru/./app/js/settings.js","webpack://miru/./app/js/rss.js","webpack://miru/./app/js/interface.js","webpack://miru/./app/js/anilist.js","webpack://miru/external var \"anitomyscript\"","webpack://miru/./app/js/anime.js","webpack://miru/external var \"globalThis.gapi\"","webpack://miru/./app/js/keys.js","webpack://miru/./app/js/webseed.js","webpack://miru/./app/js/main.js"],"sourcesContent":["const ADDR_RE = /^\\[?([^\\]]+)]?:(\\d+)$/ // ipv4/ipv6/hostname + port\n\nlet cache = new Map()\n\n// reset cache when it gets to 100,000 elements (~ 600KB of ipv4 addresses)\n// so it will not grow to consume all memory in long-running processes\nmodule.exports = function addrToIPPort (addr) {\n if (cache.size === 100000) cache.clear()\n if (!cache.has(addr)) {\n const m = ADDR_RE.exec(addr)\n if (!m) throw new Error(`invalid addr: ${addr}`)\n cache.set(addr, [ m[1], Number(m[2]) ])\n }\n return cache.get(addr)\n}\n","'use strict';\n\nconst asn1 = exports;\n\nasn1.bignum = require('bn.js');\n\nasn1.define = require('./asn1/api').define;\nasn1.base = require('./asn1/base');\nasn1.constants = require('./asn1/constants');\nasn1.decoders = require('./asn1/decoders');\nasn1.encoders = require('./asn1/encoders');\n","'use strict';\n\nconst encoders = require('./encoders');\nconst decoders = require('./decoders');\nconst inherits = require('inherits');\n\nconst api = exports;\n\napi.define = function define(name, body) {\n return new Entity(name, body);\n};\n\nfunction Entity(name, body) {\n this.name = name;\n this.body = body;\n\n this.decoders = {};\n this.encoders = {};\n}\n\nEntity.prototype._createNamed = function createNamed(Base) {\n const name = this.name;\n\n function Generated(entity) {\n this._initNamed(entity, name);\n }\n inherits(Generated, Base);\n Generated.prototype._initNamed = function _initNamed(entity, name) {\n Base.call(this, entity, name);\n };\n\n return new Generated(this);\n};\n\nEntity.prototype._getDecoder = function _getDecoder(enc) {\n enc = enc || 'der';\n // Lazily create decoder\n if (!this.decoders.hasOwnProperty(enc))\n this.decoders[enc] = this._createNamed(decoders[enc]);\n return this.decoders[enc];\n};\n\nEntity.prototype.decode = function decode(data, enc, options) {\n return this._getDecoder(enc).decode(data, options);\n};\n\nEntity.prototype._getEncoder = function _getEncoder(enc) {\n enc = enc || 'der';\n // Lazily create encoder\n if (!this.encoders.hasOwnProperty(enc))\n this.encoders[enc] = this._createNamed(encoders[enc]);\n return this.encoders[enc];\n};\n\nEntity.prototype.encode = function encode(data, enc, /* internal */ reporter) {\n return this._getEncoder(enc).encode(data, reporter);\n};\n","'use strict';\n\nconst inherits = require('inherits');\nconst Reporter = require('../base/reporter').Reporter;\nconst Buffer = require('safer-buffer').Buffer;\n\nfunction DecoderBuffer(base, options) {\n Reporter.call(this, options);\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}\ninherits(DecoderBuffer, Reporter);\nexports.DecoderBuffer = DecoderBuffer;\n\nDecoderBuffer.isDecoderBuffer = function isDecoderBuffer(data) {\n if (data instanceof DecoderBuffer) {\n return true;\n }\n\n // Or accept compatible API\n const isCompatible = typeof data === 'object' &&\n Buffer.isBuffer(data.base) &&\n data.constructor.name === 'DecoderBuffer' &&\n typeof data.offset === 'number' &&\n typeof data.length === 'number' &&\n typeof data.save === 'function' &&\n typeof data.restore === 'function' &&\n typeof data.isEmpty === 'function' &&\n typeof data.readUInt8 === 'function' &&\n typeof data.skip === 'function' &&\n typeof data.raw === 'function';\n\n return isCompatible;\n};\n\nDecoderBuffer.prototype.save = function save() {\n return { offset: this.offset, reporter: Reporter.prototype.save.call(this) };\n};\n\nDecoderBuffer.prototype.restore = function restore(save) {\n // Return skipped data\n const res = new DecoderBuffer(this.base);\n res.offset = save.offset;\n res.length = this.offset;\n\n this.offset = save.offset;\n Reporter.prototype.restore.call(this, save.reporter);\n\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)\n return this.base.readUInt8(this.offset++, true);\n else\n return this.error(fail || 'DecoderBuffer overrun');\n};\n\nDecoderBuffer.prototype.skip = function skip(bytes, fail) {\n if (!(this.offset + bytes <= this.length))\n return this.error(fail || 'DecoderBuffer overrun');\n\n const res = new DecoderBuffer(this.base);\n\n // Share reporter state\n res._reporterState = this._reporterState;\n\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 (!EncoderBuffer.isEncoderBuffer(item))\n 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))\n 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}\nexports.EncoderBuffer = EncoderBuffer;\n\nEncoderBuffer.isEncoderBuffer = function isEncoderBuffer(data) {\n if (data instanceof EncoderBuffer) {\n return true;\n }\n\n // Or accept compatible API\n const isCompatible = typeof data === 'object' &&\n data.constructor.name === 'EncoderBuffer' &&\n typeof data.length === 'number' &&\n typeof data.join === 'function';\n\n return isCompatible;\n};\n\nEncoderBuffer.prototype.join = function join(out, offset) {\n if (!out)\n out = Buffer.alloc(this.length);\n if (!offset)\n offset = 0;\n\n if (this.length === 0)\n 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')\n out[offset] = this.value;\n else if (typeof this.value === 'string')\n out.write(this.value, offset);\n else if (Buffer.isBuffer(this.value))\n this.value.copy(out, offset);\n offset += this.length;\n }\n\n return out;\n};\n","'use strict';\n\nconst base = exports;\n\nbase.Reporter = require('./reporter').Reporter;\nbase.DecoderBuffer = require('./buffer').DecoderBuffer;\nbase.EncoderBuffer = require('./buffer').EncoderBuffer;\nbase.Node = require('./node');\n","'use strict';\n\nconst Reporter = require('../base/reporter').Reporter;\nconst EncoderBuffer = require('../base/buffer').EncoderBuffer;\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst assert = require('minimalistic-assert');\n\n// Supported tags\nconst tags = [\n 'seq', 'seqof', 'set', 'setof', 'objid', 'bool',\n 'gentime', 'utctime', 'null_', 'enum', 'int', 'objDesc',\n 'bitstr', 'bmpstr', 'charstr', 'genstr', 'graphstr', 'ia5str', 'iso646str',\n 'numstr', 'octstr', 'printstr', 't61str', 'unistr', 'utf8str', 'videostr'\n];\n\n// Public methods list\nconst methods = [\n 'key', 'obj', 'use', 'optional', 'explicit', 'implicit', 'def', 'choice',\n 'any', 'contains'\n].concat(tags);\n\n// Overrided methods list\nconst overrided = [\n '_peekTag', '_decodeTag', '_use',\n '_decodeStr', '_decodeObjid', '_decodeTime',\n '_decodeNull', '_decodeInt', '_decodeBool', '_decodeList',\n\n '_encodeComposite', '_encodeStr', '_encodeObjid', '_encodeTime',\n '_encodeNull', '_encodeInt', '_encodeBool'\n];\n\nfunction Node(enc, parent, name) {\n const state = {};\n this._baseState = state;\n\n state.name = name;\n state.enc = enc;\n\n state.parent = parent || null;\n state.children = null;\n\n // State\n state.tag = null;\n state.args = null;\n state.reverseArgs = null;\n state.choice = null;\n state.optional = false;\n state.any = false;\n state.obj = false;\n state.use = null;\n state.useDecoder = null;\n state.key = null;\n state['default'] = null;\n state.explicit = null;\n state.implicit = null;\n state.contains = null;\n\n // Should create new instance on each method\n if (!state.parent) {\n state.children = [];\n this._wrap();\n }\n}\nmodule.exports = Node;\n\nconst stateProps = [\n 'enc', 'parent', 'children', 'tag', 'args', 'reverseArgs', 'choice',\n 'optional', 'any', 'obj', 'use', 'alteredUse', 'key', 'default', 'explicit',\n 'implicit', 'contains'\n];\n\nNode.prototype.clone = function clone() {\n const state = this._baseState;\n const cstate = {};\n stateProps.forEach(function(prop) {\n cstate[prop] = state[prop];\n });\n const res = new this.constructor(cstate.parent);\n res._baseState = cstate;\n return res;\n};\n\nNode.prototype._wrap = function wrap() {\n const state = this._baseState;\n methods.forEach(function(method) {\n this[method] = function _wrappedMethod() {\n const clone = new this.constructor(this);\n state.children.push(clone);\n return clone[method].apply(clone, arguments);\n };\n }, this);\n};\n\nNode.prototype._init = function init(body) {\n const state = this._baseState;\n\n assert(state.parent === null);\n body.call(this);\n\n // Filter children\n state.children = state.children.filter(function(child) {\n return child._baseState.parent === this;\n }, this);\n assert.equal(state.children.length, 1, 'Root node can have only one child');\n};\n\nNode.prototype._useArgs = function useArgs(args) {\n const state = this._baseState;\n\n // Filter children and args\n const children = args.filter(function(arg) {\n return arg instanceof this.constructor;\n }, this);\n args = args.filter(function(arg) {\n return !(arg instanceof this.constructor);\n }, this);\n\n if (children.length !== 0) {\n assert(state.children === null);\n state.children = children;\n\n // Replace parent to maintain backward link\n children.forEach(function(child) {\n child._baseState.parent = this;\n }, this);\n }\n if (args.length !== 0) {\n assert(state.args === null);\n state.args = args;\n state.reverseArgs = args.map(function(arg) {\n if (typeof arg !== 'object' || arg.constructor !== Object)\n return arg;\n\n const res = {};\n Object.keys(arg).forEach(function(key) {\n if (key == (key | 0))\n key |= 0;\n const value = arg[key];\n res[value] = key;\n });\n return res;\n });\n }\n};\n\n//\n// Overrided methods\n//\n\noverrided.forEach(function(method) {\n Node.prototype[method] = function _overrided() {\n const state = this._baseState;\n throw new Error(method + ' not implemented for encoding: ' + state.enc);\n };\n});\n\n//\n// Public methods\n//\n\ntags.forEach(function(tag) {\n Node.prototype[tag] = function _tagMethod() {\n const state = this._baseState;\n const args = Array.prototype.slice.call(arguments);\n\n assert(state.tag === null);\n state.tag = tag;\n\n this._useArgs(args);\n\n return this;\n };\n});\n\nNode.prototype.use = function use(item) {\n assert(item);\n const state = this._baseState;\n\n assert(state.use === null);\n state.use = item;\n\n return this;\n};\n\nNode.prototype.optional = function optional() {\n const state = this._baseState;\n\n state.optional = true;\n\n return this;\n};\n\nNode.prototype.def = function def(val) {\n const state = this._baseState;\n\n assert(state['default'] === null);\n state['default'] = val;\n state.optional = true;\n\n return this;\n};\n\nNode.prototype.explicit = function explicit(num) {\n const state = this._baseState;\n\n assert(state.explicit === null && state.implicit === null);\n state.explicit = num;\n\n return this;\n};\n\nNode.prototype.implicit = function implicit(num) {\n const state = this._baseState;\n\n assert(state.explicit === null && state.implicit === null);\n state.implicit = num;\n\n return this;\n};\n\nNode.prototype.obj = function obj() {\n const state = this._baseState;\n const args = Array.prototype.slice.call(arguments);\n\n state.obj = true;\n\n if (args.length !== 0)\n this._useArgs(args);\n\n return this;\n};\n\nNode.prototype.key = function key(newKey) {\n const state = this._baseState;\n\n assert(state.key === null);\n state.key = newKey;\n\n return this;\n};\n\nNode.prototype.any = function any() {\n const state = this._baseState;\n\n state.any = true;\n\n return this;\n};\n\nNode.prototype.choice = function choice(obj) {\n const state = this._baseState;\n\n assert(state.choice === null);\n state.choice = obj;\n this._useArgs(Object.keys(obj).map(function(key) {\n return obj[key];\n }));\n\n return this;\n};\n\nNode.prototype.contains = function contains(item) {\n const state = this._baseState;\n\n assert(state.use === null);\n state.contains = item;\n\n return this;\n};\n\n//\n// Decoding\n//\n\nNode.prototype._decode = function decode(input, options) {\n const state = this._baseState;\n\n // Decode root node\n if (state.parent === null)\n return input.wrapResult(state.children[0]._decode(input, options));\n\n let result = state['default'];\n let present = true;\n\n let prevKey = null;\n if (state.key !== null)\n prevKey = input.enterKey(state.key);\n\n // Check if tag is there\n if (state.optional) {\n let tag = null;\n if (state.explicit !== null)\n tag = state.explicit;\n else if (state.implicit !== null)\n tag = state.implicit;\n else if (state.tag !== null)\n tag = state.tag;\n\n if (tag === null && !state.any) {\n // Trial and Error\n const save = input.save();\n try {\n if (state.choice === null)\n this._decodeGeneric(state.tag, input, options);\n else\n this._decodeChoice(input, options);\n present = true;\n } catch (e) {\n present = false;\n }\n input.restore(save);\n } else {\n present = this._peekTag(input, tag, state.any);\n\n if (input.isError(present))\n return present;\n }\n }\n\n // Push object on stack\n let prevObj;\n if (state.obj && present)\n prevObj = input.enterObject();\n\n if (present) {\n // Unwrap explicit values\n if (state.explicit !== null) {\n const explicit = this._decodeTag(input, state.explicit);\n if (input.isError(explicit))\n return explicit;\n input = explicit;\n }\n\n const start = input.offset;\n\n // Unwrap implicit and normal values\n if (state.use === null && state.choice === null) {\n let save;\n if (state.any)\n save = input.save();\n const body = this._decodeTag(\n input,\n state.implicit !== null ? state.implicit : state.tag,\n state.any\n );\n if (input.isError(body))\n return body;\n\n if (state.any)\n result = input.raw(save);\n else\n input = body;\n }\n\n if (options && options.track && state.tag !== null)\n options.track(input.path(), start, input.length, 'tagged');\n\n if (options && options.track && state.tag !== null)\n options.track(input.path(), input.offset, input.length, 'content');\n\n // Select proper method for tag\n if (state.any) {\n // no-op\n } else if (state.choice === null) {\n result = this._decodeGeneric(state.tag, input, options);\n } else {\n result = this._decodeChoice(input, options);\n }\n\n if (input.isError(result))\n return result;\n\n // Decode children\n if (!state.any && state.choice === null && state.children !== null) {\n state.children.forEach(function decodeChildren(child) {\n // NOTE: We are ignoring errors here, to let parser continue with other\n // parts of encoded data\n child._decode(input, options);\n });\n }\n\n // Decode contained/encoded by schema, only in bit or octet strings\n if (state.contains && (state.tag === 'octstr' || state.tag === 'bitstr')) {\n const data = new DecoderBuffer(result);\n result = this._getUse(state.contains, input._reporterState.obj)\n ._decode(data, options);\n }\n }\n\n // Pop object\n if (state.obj && present)\n result = input.leaveObject(prevObj);\n\n // Set key\n if (state.key !== null && (result !== null || present === true))\n input.leaveKey(prevKey, state.key, result);\n else if (prevKey !== null)\n input.exitKey(prevKey);\n\n return result;\n};\n\nNode.prototype._decodeGeneric = function decodeGeneric(tag, input, options) {\n const state = this._baseState;\n\n if (tag === 'seq' || tag === 'set')\n return null;\n if (tag === 'seqof' || tag === 'setof')\n return this._decodeList(input, tag, state.args[0], options);\n else if (/str$/.test(tag))\n return this._decodeStr(input, tag, options);\n else if (tag === 'objid' && state.args)\n return this._decodeObjid(input, state.args[0], state.args[1], options);\n else if (tag === 'objid')\n return this._decodeObjid(input, null, null, options);\n else if (tag === 'gentime' || tag === 'utctime')\n return this._decodeTime(input, tag, options);\n else if (tag === 'null_')\n return this._decodeNull(input, options);\n else if (tag === 'bool')\n return this._decodeBool(input, options);\n else if (tag === 'objDesc')\n return this._decodeStr(input, tag, options);\n else if (tag === 'int' || tag === 'enum')\n return this._decodeInt(input, state.args && state.args[0], options);\n\n if (state.use !== null) {\n return this._getUse(state.use, input._reporterState.obj)\n ._decode(input, options);\n } else {\n return input.error('unknown tag: ' + tag);\n }\n};\n\nNode.prototype._getUse = function _getUse(entity, obj) {\n\n const state = this._baseState;\n // Create altered use decoder if implicit is set\n state.useDecoder = this._use(entity, obj);\n assert(state.useDecoder._baseState.parent === null);\n state.useDecoder = state.useDecoder._baseState.children[0];\n if (state.implicit !== state.useDecoder._baseState.implicit) {\n state.useDecoder = state.useDecoder.clone();\n state.useDecoder._baseState.implicit = state.implicit;\n }\n return state.useDecoder;\n};\n\nNode.prototype._decodeChoice = function decodeChoice(input, options) {\n const state = this._baseState;\n let result = null;\n let match = false;\n\n Object.keys(state.choice).some(function(key) {\n const save = input.save();\n const node = state.choice[key];\n try {\n const value = node._decode(input, options);\n if (input.isError(value))\n return false;\n\n result = { type: key, value: value };\n match = true;\n } catch (e) {\n input.restore(save);\n return false;\n }\n return true;\n }, this);\n\n if (!match)\n return input.error('Choice not matched');\n\n return result;\n};\n\n//\n// Encoding\n//\n\nNode.prototype._createEncoderBuffer = function createEncoderBuffer(data) {\n return new EncoderBuffer(data, this.reporter);\n};\n\nNode.prototype._encode = function encode(data, reporter, parent) {\n const state = this._baseState;\n if (state['default'] !== null && state['default'] === data)\n return;\n\n const result = this._encodeValue(data, reporter, parent);\n if (result === undefined)\n return;\n\n if (this._skipDefault(result, reporter, parent))\n return;\n\n return result;\n};\n\nNode.prototype._encodeValue = function encode(data, reporter, parent) {\n const state = this._baseState;\n\n // Decode root node\n if (state.parent === null)\n return state.children[0]._encode(data, reporter || new Reporter());\n\n let result = null;\n\n // Set reporter to share it with a child class\n this.reporter = reporter;\n\n // Check if data is there\n if (state.optional && data === undefined) {\n if (state['default'] !== null)\n data = state['default'];\n else\n return;\n }\n\n // Encode children first\n let content = null;\n let primitive = false;\n if (state.any) {\n // Anything that was given is translated to buffer\n result = this._createEncoderBuffer(data);\n } else if (state.choice) {\n result = this._encodeChoice(data, reporter);\n } else if (state.contains) {\n content = this._getUse(state.contains, parent)._encode(data, reporter);\n primitive = true;\n } else if (state.children) {\n content = state.children.map(function(child) {\n if (child._baseState.tag === 'null_')\n return child._encode(null, reporter, data);\n\n if (child._baseState.key === null)\n return reporter.error('Child should have a key');\n const prevKey = reporter.enterKey(child._baseState.key);\n\n if (typeof data !== 'object')\n return reporter.error('Child expected, but input is not object');\n\n const res = child._encode(data[child._baseState.key], reporter, data);\n reporter.leaveKey(prevKey);\n\n return res;\n }, this).filter(function(child) {\n return child;\n });\n content = this._createEncoderBuffer(content);\n } else {\n if (state.tag === 'seqof' || state.tag === 'setof') {\n // TODO(indutny): this should be thrown on DSL level\n if (!(state.args && state.args.length === 1))\n return reporter.error('Too many args for : ' + state.tag);\n\n if (!Array.isArray(data))\n return reporter.error('seqof/setof, but data is not Array');\n\n const child = this.clone();\n child._baseState.implicit = null;\n content = this._createEncoderBuffer(data.map(function(item) {\n const state = this._baseState;\n\n return this._getUse(state.args[0], data)._encode(item, reporter);\n }, child));\n } else if (state.use !== null) {\n result = this._getUse(state.use, parent)._encode(data, reporter);\n } else {\n content = this._encodePrimitive(state.tag, data);\n primitive = true;\n }\n }\n\n // Encode data itself\n if (!state.any && state.choice === null) {\n const tag = state.implicit !== null ? state.implicit : state.tag;\n const cls = state.implicit === null ? 'universal' : 'context';\n\n if (tag === null) {\n if (state.use === null)\n reporter.error('Tag could be omitted only for .use()');\n } else {\n if (state.use === null)\n result = this._encodeComposite(tag, primitive, cls, content);\n }\n }\n\n // Wrap in explicit\n if (state.explicit !== null)\n result = this._encodeComposite(state.explicit, false, 'context', result);\n\n return result;\n};\n\nNode.prototype._encodeChoice = function encodeChoice(data, reporter) {\n const state = this._baseState;\n\n const node = state.choice[data.type];\n if (!node) {\n assert(\n false,\n data.type + ' not found in ' +\n JSON.stringify(Object.keys(state.choice)));\n }\n return node._encode(data.value, reporter);\n};\n\nNode.prototype._encodePrimitive = function encodePrimitive(tag, data) {\n const state = this._baseState;\n\n if (/str$/.test(tag))\n return this._encodeStr(data, tag);\n else if (tag === 'objid' && state.args)\n return this._encodeObjid(data, state.reverseArgs[0], state.args[1]);\n else if (tag === 'objid')\n return this._encodeObjid(data, null, null);\n else if (tag === 'gentime' || tag === 'utctime')\n return this._encodeTime(data, tag);\n else if (tag === 'null_')\n return this._encodeNull();\n else if (tag === 'int' || tag === 'enum')\n return this._encodeInt(data, state.args && state.reverseArgs[0]);\n else if (tag === 'bool')\n return this._encodeBool(data);\n else if (tag === 'objDesc')\n return this._encodeStr(data, tag);\n else\n throw new Error('Unsupported tag: ' + tag);\n};\n\nNode.prototype._isNumstr = function isNumstr(str) {\n return /^[0-9 ]*$/.test(str);\n};\n\nNode.prototype._isPrintstr = function isPrintstr(str) {\n return /^[A-Za-z0-9 '()+,-./:=?]*$/.test(str);\n};\n","'use strict';\n\nconst inherits = require('inherits');\n\nfunction Reporter(options) {\n this._reporterState = {\n obj: null,\n path: [],\n options: options || {},\n errors: []\n };\n}\nexports.Reporter = Reporter;\n\nReporter.prototype.isError = function isError(obj) {\n return obj instanceof ReporterError;\n};\n\nReporter.prototype.save = function save() {\n const state = this._reporterState;\n\n return { obj: state.obj, pathLen: state.path.length };\n};\n\nReporter.prototype.restore = function restore(data) {\n const state = this._reporterState;\n\n state.obj = data.obj;\n state.path = state.path.slice(0, data.pathLen);\n};\n\nReporter.prototype.enterKey = function enterKey(key) {\n return this._reporterState.path.push(key);\n};\n\nReporter.prototype.exitKey = function exitKey(index) {\n const state = this._reporterState;\n\n state.path = state.path.slice(0, index - 1);\n};\n\nReporter.prototype.leaveKey = function leaveKey(index, key, value) {\n const state = this._reporterState;\n\n this.exitKey(index);\n if (state.obj !== null)\n state.obj[key] = value;\n};\n\nReporter.prototype.path = function path() {\n return this._reporterState.path.join('/');\n};\n\nReporter.prototype.enterObject = function enterObject() {\n const state = this._reporterState;\n\n const prev = state.obj;\n state.obj = {};\n return prev;\n};\n\nReporter.prototype.leaveObject = function leaveObject(prev) {\n const state = this._reporterState;\n\n const now = state.obj;\n state.obj = prev;\n return now;\n};\n\nReporter.prototype.error = function error(msg) {\n let err;\n const state = this._reporterState;\n\n const inherited = msg instanceof ReporterError;\n if (inherited) {\n err = msg;\n } else {\n err = new ReporterError(state.path.map(function(elem) {\n return '[' + JSON.stringify(elem) + ']';\n }).join(''), msg.message || msg, msg.stack);\n }\n\n if (!state.options.partial)\n throw err;\n\n if (!inherited)\n state.errors.push(err);\n\n return err;\n};\n\nReporter.prototype.wrapResult = function wrapResult(result) {\n const state = this._reporterState;\n if (!state.options.partial)\n return result;\n\n return {\n result: this.isError(result) ? null : result,\n errors: state.errors\n };\n};\n\nfunction ReporterError(path, msg) {\n this.path = path;\n this.rethrow(msg);\n}\ninherits(ReporterError, Error);\n\nReporterError.prototype.rethrow = function rethrow(msg) {\n this.message = msg + ' at: ' + (this.path || '(shallow)');\n if (Error.captureStackTrace)\n Error.captureStackTrace(this, ReporterError);\n\n if (!this.stack) {\n try {\n // IE only adds stack when thrown\n throw new Error(this.message);\n } catch (e) {\n this.stack = e.stack;\n }\n }\n return this;\n};\n","'use strict';\n\n// Helper\nfunction reverse(map) {\n const res = {};\n\n Object.keys(map).forEach(function(key) {\n // Convert key to integer if it is stringified\n if ((key | 0) == key)\n key = key | 0;\n\n const value = map[key];\n res[value] = key;\n });\n\n return res;\n}\n\nexports.tagClass = {\n 0: 'universal',\n 1: 'application',\n 2: 'context',\n 3: 'private'\n};\nexports.tagClassByName = reverse(exports.tagClass);\n\nexports.tag = {\n 0x00: 'end',\n 0x01: 'bool',\n 0x02: 'int',\n 0x03: 'bitstr',\n 0x04: 'octstr',\n 0x05: 'null_',\n 0x06: 'objid',\n 0x07: 'objDesc',\n 0x08: 'external',\n 0x09: 'real',\n 0x0a: 'enum',\n 0x0b: 'embed',\n 0x0c: 'utf8str',\n 0x0d: 'relativeOid',\n 0x10: 'seq',\n 0x11: 'set',\n 0x12: 'numstr',\n 0x13: 'printstr',\n 0x14: 't61str',\n 0x15: 'videostr',\n 0x16: 'ia5str',\n 0x17: 'utctime',\n 0x18: 'gentime',\n 0x19: 'graphstr',\n 0x1a: 'iso646str',\n 0x1b: 'genstr',\n 0x1c: 'unistr',\n 0x1d: 'charstr',\n 0x1e: 'bmpstr'\n};\nexports.tagByName = reverse(exports.tag);\n","'use strict';\n\nconst constants = exports;\n\n// Helper\nconstants._reverse = function reverse(map) {\n const res = {};\n\n Object.keys(map).forEach(function(key) {\n // Convert key to integer if it is stringified\n if ((key | 0) == key)\n key = key | 0;\n\n const value = map[key];\n res[value] = key;\n });\n\n return res;\n};\n\nconstants.der = require('./der');\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst bignum = require('bn.js');\nconst DecoderBuffer = require('../base/buffer').DecoderBuffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DERDecoder(entity) {\n this.enc = 'der';\n this.name = entity.name;\n this.entity = entity;\n\n // Construct base tree\n this.tree = new DERNode();\n this.tree._init(entity.body);\n}\nmodule.exports = DERDecoder;\n\nDERDecoder.prototype.decode = function decode(data, options) {\n if (!DecoderBuffer.isDecoderBuffer(data)) {\n data = new DecoderBuffer(data, options);\n }\n\n return this.tree._decode(data, options);\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._peekTag = function peekTag(buffer, tag, any) {\n if (buffer.isEmpty())\n return false;\n\n const state = buffer.save();\n const decodedTag = derDecodeTag(buffer, 'Failed to peek tag: \"' + tag + '\"');\n if (buffer.isError(decodedTag))\n return decodedTag;\n\n buffer.restore(state);\n\n return decodedTag.tag === tag || decodedTag.tagStr === tag ||\n (decodedTag.tagStr + 'of') === tag || any;\n};\n\nDERNode.prototype._decodeTag = function decodeTag(buffer, tag, any) {\n const decodedTag = derDecodeTag(buffer,\n 'Failed to decode tag of \"' + tag + '\"');\n if (buffer.isError(decodedTag))\n return decodedTag;\n\n let len = derDecodeLen(buffer,\n decodedTag.primitive,\n 'Failed to get length of \"' + tag + '\"');\n\n // Failure\n if (buffer.isError(len))\n return len;\n\n if (!any &&\n decodedTag.tag !== tag &&\n decodedTag.tagStr !== tag &&\n decodedTag.tagStr + 'of' !== tag) {\n return buffer.error('Failed to match tag: \"' + tag + '\"');\n }\n\n if (decodedTag.primitive || len !== null)\n return buffer.skip(len, 'Failed to match body of: \"' + tag + '\"');\n\n // Indefinite length... find END tag\n const state = buffer.save();\n const res = this._skipUntilEnd(\n buffer,\n 'Failed to skip indefinite length body: \"' + this.tag + '\"');\n if (buffer.isError(res))\n return res;\n\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 for (;;) {\n const tag = derDecodeTag(buffer, fail);\n if (buffer.isError(tag))\n return tag;\n const len = derDecodeLen(buffer, tag.primitive, fail);\n if (buffer.isError(len))\n return len;\n\n let res;\n if (tag.primitive || len !== null)\n res = buffer.skip(len);\n else\n res = this._skipUntilEnd(buffer, fail);\n\n // Failure\n if (buffer.isError(res))\n return res;\n\n if (tag.tagStr === 'end')\n break;\n }\n};\n\nDERNode.prototype._decodeList = function decodeList(buffer, tag, decoder,\n options) {\n const result = [];\n while (!buffer.isEmpty()) {\n const possibleEnd = this._peekTag(buffer, 'end');\n if (buffer.isError(possibleEnd))\n return possibleEnd;\n\n const res = decoder.decode(buffer, 'der', options);\n if (buffer.isError(res) && possibleEnd)\n break;\n result.push(res);\n }\n return result;\n};\n\nDERNode.prototype._decodeStr = function decodeStr(buffer, tag) {\n if (tag === 'bitstr') {\n const unused = buffer.readUInt8();\n if (buffer.isError(unused))\n return unused;\n return { unused: unused, data: buffer.raw() };\n } else if (tag === 'bmpstr') {\n const raw = buffer.raw();\n if (raw.length % 2 === 1)\n return buffer.error('Decoding of string type: bmpstr length mismatch');\n\n let str = '';\n for (let i = 0; i < raw.length / 2; i++) {\n str += String.fromCharCode(raw.readUInt16BE(i * 2));\n }\n return str;\n } else if (tag === 'numstr') {\n const numstr = buffer.raw().toString('ascii');\n if (!this._isNumstr(numstr)) {\n return buffer.error('Decoding of string type: ' +\n 'numstr unsupported characters');\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 const printstr = buffer.raw().toString('ascii');\n if (!this._isPrintstr(printstr)) {\n return buffer.error('Decoding of string type: ' +\n 'printstr unsupported characters');\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 let result;\n const identifiers = [];\n let ident = 0;\n let subident = 0;\n while (!buffer.isEmpty()) {\n subident = buffer.readUInt8();\n ident <<= 7;\n ident |= subident & 0x7f;\n if ((subident & 0x80) === 0) {\n identifiers.push(ident);\n ident = 0;\n }\n }\n if (subident & 0x80)\n identifiers.push(ident);\n\n const first = (identifiers[0] / 40) | 0;\n const second = identifiers[0] % 40;\n\n if (relative)\n result = identifiers;\n else\n result = [first, second].concat(identifiers.slice(1));\n\n if (values) {\n let tmp = values[result.join(' ')];\n if (tmp === undefined)\n tmp = values[result.join('.')];\n if (tmp !== undefined)\n result = tmp;\n }\n\n return result;\n};\n\nDERNode.prototype._decodeTime = function decodeTime(buffer, tag) {\n const str = buffer.raw().toString();\n\n let year;\n let mon;\n let day;\n let hour;\n let min;\n let sec;\n if (tag === 'gentime') {\n year = str.slice(0, 4) | 0;\n mon = str.slice(4, 6) | 0;\n day = str.slice(6, 8) | 0;\n hour = str.slice(8, 10) | 0;\n min = str.slice(10, 12) | 0;\n sec = str.slice(12, 14) | 0;\n } else if (tag === 'utctime') {\n year = str.slice(0, 2) | 0;\n mon = str.slice(2, 4) | 0;\n day = str.slice(4, 6) | 0;\n hour = str.slice(6, 8) | 0;\n min = str.slice(8, 10) | 0;\n sec = str.slice(10, 12) | 0;\n if (year < 70)\n year = 2000 + year;\n else\n 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() {\n return null;\n};\n\nDERNode.prototype._decodeBool = function decodeBool(buffer) {\n const res = buffer.readUInt8();\n if (buffer.isError(res))\n return res;\n else\n return res !== 0;\n};\n\nDERNode.prototype._decodeInt = function decodeInt(buffer, values) {\n // Bigint, return as it is (assume big endian)\n const raw = buffer.raw();\n let res = new bignum(raw);\n\n if (values)\n res = values[res.toString(10)] || res;\n\n return res;\n};\n\nDERNode.prototype._use = function use(entity, obj) {\n if (typeof entity === 'function')\n entity = entity(obj);\n return entity._getDecoder('der').tree;\n};\n\n// Utility methods\n\nfunction derDecodeTag(buf, fail) {\n let tag = buf.readUInt8(fail);\n if (buf.isError(tag))\n return tag;\n\n const cls = der.tagClass[tag >> 6];\n const primitive = (tag & 0x20) === 0;\n\n // Multi-octet tag - load\n if ((tag & 0x1f) === 0x1f) {\n let oct = tag;\n tag = 0;\n while ((oct & 0x80) === 0x80) {\n oct = buf.readUInt8(fail);\n if (buf.isError(oct))\n return oct;\n\n tag <<= 7;\n tag |= oct & 0x7f;\n }\n } else {\n tag &= 0x1f;\n }\n const tagStr = der.tag[tag];\n\n return {\n cls: cls,\n primitive: primitive,\n tag: tag,\n tagStr: tagStr\n };\n}\n\nfunction derDecodeLen(buf, primitive, fail) {\n let len = buf.readUInt8(fail);\n if (buf.isError(len))\n return len;\n\n // Indefinite form\n if (!primitive && len === 0x80)\n return null;\n\n // Definite form\n if ((len & 0x80) === 0) {\n // Short form\n return len;\n }\n\n // Long form\n const num = len & 0x7f;\n if (num > 4)\n return buf.error('length octect is too long');\n\n len = 0;\n for (let i = 0; i < num; i++) {\n len <<= 8;\n const j = buf.readUInt8(fail);\n if (buf.isError(j))\n return j;\n len |= j;\n }\n\n return len;\n}\n","'use strict';\n\nconst decoders = exports;\n\ndecoders.der = require('./der');\ndecoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\n\nconst DERDecoder = require('./der');\n\nfunction PEMDecoder(entity) {\n DERDecoder.call(this, entity);\n this.enc = 'pem';\n}\ninherits(PEMDecoder, DERDecoder);\nmodule.exports = PEMDecoder;\n\nPEMDecoder.prototype.decode = function decode(data, options) {\n const lines = data.toString().split(/[\\r\\n]+/g);\n\n const label = options.label.toUpperCase();\n\n const re = /^-----(BEGIN|END) ([^-]+)-----$/;\n let start = -1;\n let end = -1;\n for (let i = 0; i < lines.length; i++) {\n const match = lines[i].match(re);\n if (match === null)\n continue;\n\n if (match[2] !== label)\n continue;\n\n if (start === -1) {\n if (match[1] !== 'BEGIN')\n break;\n start = i;\n } else {\n if (match[1] !== 'END')\n break;\n end = i;\n break;\n }\n }\n if (start === -1 || end === -1)\n throw new Error('PEM section not found for: ' + label);\n\n const base64 = lines.slice(start + 1, end).join('');\n // Remove excessive symbols\n base64.replace(/[^a-z0-9+/=]+/gi, '');\n\n const input = Buffer.from(base64, 'base64');\n return DERDecoder.prototype.decode.call(this, input, options);\n};\n","'use strict';\n\nconst inherits = require('inherits');\nconst Buffer = require('safer-buffer').Buffer;\nconst Node = require('../base/node');\n\n// Import DER constants\nconst der = require('../constants/der');\n\nfunction DEREncoder(entity) {\n this.enc = 'der';\n this.name = entity.name;\n this.entity = entity;\n\n // Construct base tree\n this.tree = new DERNode();\n this.tree._init(entity.body);\n}\nmodule.exports = DEREncoder;\n\nDEREncoder.prototype.encode = function encode(data, reporter) {\n return this.tree._encode(data, reporter).join();\n};\n\n// Tree methods\n\nfunction DERNode(parent) {\n Node.call(this, 'der', parent);\n}\ninherits(DERNode, Node);\n\nDERNode.prototype._encodeComposite = function encodeComposite(tag,\n primitive,\n cls,\n content) {\n const encodedTag = encodeTag(tag, primitive, cls, this.reporter);\n\n // Short form\n if (content.length < 0x80) {\n const header = Buffer.alloc(2);\n header[0] = encodedTag;\n header[1] = content.length;\n return this._createEncoderBuffer([ header, content ]);\n }\n\n // Long form\n // Count octets required to store length\n let lenOctets = 1;\n for (let i = content.length; i >= 0x100; i >>= 8)\n lenOctets++;\n\n const header = Buffer.alloc(1 + 1 + lenOctets);\n header[0] = encodedTag;\n header[1] = 0x80 | lenOctets;\n\n for (let i = 1 + lenOctets, j = content.length; j > 0; i--, j >>= 8)\n header[i] = j & 0xff;\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 const buf = Buffer.alloc(str.length * 2);\n for (let i = 0; i < str.length; i++) {\n buf.writeUInt16BE(str.charCodeAt(i), i * 2);\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 ' +\n 'only digits and space');\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 ' +\n 'only latin upper and lower case letters, ' +\n 'digits, space, apostrophe, left and rigth ' +\n 'parenthesis, plus sign, comma, hyphen, ' +\n 'dot, slash, colon, equal sign, ' +\n 'question mark');\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 +\n ' unsupported');\n }\n};\n\nDERNode.prototype._encodeObjid = function encodeObjid(id, values, relative) {\n if (typeof id === 'string') {\n if (!values)\n return this.reporter.error('string objid given, but no values map found');\n if (!values.hasOwnProperty(id))\n return this.reporter.error('objid not found in values map');\n id = values[id].split(/[\\s.]+/g);\n for (let i = 0; i < id.length; i++)\n id[i] |= 0;\n } else if (Array.isArray(id)) {\n id = id.slice();\n for (let i = 0; i < id.length; i++)\n id[i] |= 0;\n }\n\n if (!Array.isArray(id)) {\n return this.reporter.error('objid() should be either array or string, ' +\n 'got: ' + JSON.stringify(id));\n }\n\n if (!relative) {\n if (id[1] >= 40)\n return this.reporter.error('Second objid identifier OOB');\n id.splice(0, 2, id[0] * 40 + id[1]);\n }\n\n // Count number of octets\n let size = 0;\n for (let i = 0; i < id.length; i++) {\n let ident = id[i];\n for (size++; ident >= 0x80; ident >>= 7)\n size++;\n }\n\n const objid = Buffer.alloc(size);\n let offset = objid.length - 1;\n for (let i = id.length - 1; i >= 0; i--) {\n let ident = id[i];\n objid[offset--] = ident & 0x7f;\n while ((ident >>= 7) > 0)\n objid[offset--] = 0x80 | (ident & 0x7f);\n }\n\n return this._createEncoderBuffer(objid);\n};\n\nfunction two(num) {\n if (num < 10)\n return '0' + num;\n else\n return num;\n}\n\nDERNode.prototype._encodeTime = function encodeTime(time, tag) {\n let str;\n const date = new Date(time);\n\n if (tag === 'gentime') {\n str = [\n two(date.getUTCFullYear()),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n 'Z'\n ].join('');\n } else if (tag === 'utctime') {\n str = [\n two(date.getUTCFullYear() % 100),\n two(date.getUTCMonth() + 1),\n two(date.getUTCDate()),\n two(date.getUTCHours()),\n two(date.getUTCMinutes()),\n two(date.getUTCSeconds()),\n 'Z'\n ].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)\n return this.reporter.error('String int or enum given, but no values map');\n if (!values.hasOwnProperty(num)) {\n return this.reporter.error('Values map doesn\\'t contain: ' +\n JSON.stringify(num));\n }\n num = values[num];\n }\n\n // Bignum, assume big endian\n if (typeof num !== 'number' && !Buffer.isBuffer(num)) {\n const numArray = num.toArray();\n if (!num.sign && numArray[0] & 0x80) {\n numArray.unshift(0);\n }\n num = Buffer.from(numArray);\n }\n\n if (Buffer.isBuffer(num)) {\n let size = num.length;\n if (num.length === 0)\n size++;\n\n const out = Buffer.alloc(size);\n num.copy(out);\n if (num.length === 0)\n out[0] = 0;\n return this._createEncoderBuffer(out);\n }\n\n if (num < 0x80)\n return this._createEncoderBuffer(num);\n\n if (num < 0x100)\n return this._createEncoderBuffer([0, num]);\n\n let size = 1;\n for (let i = num; i >= 0x100; i >>= 8)\n size++;\n\n const out = new Array(size);\n for (let i = out.length - 1; i >= 0; i--) {\n out[i] = num & 0xff;\n num >>= 8;\n }\n if(out[0] & 0x80) {\n out.unshift(0);\n }\n\n return this._createEncoderBuffer(Buffer.from(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')\n entity = entity(obj);\n return entity._getEncoder('der').tree;\n};\n\nDERNode.prototype._skipDefault = function skipDefault(dataBuffer, reporter, parent) {\n const state = this._baseState;\n let i;\n if (state['default'] === null)\n return false;\n\n const data = dataBuffer.join();\n if (state.defaultBuffer === undefined)\n state.defaultBuffer = this._encodeValue(state['default'], reporter, parent).join();\n\n if (data.length !== state.defaultBuffer.length)\n return false;\n\n for (i=0; i < data.length; i++)\n if (data[i] !== state.defaultBuffer[i])\n return false;\n\n return true;\n};\n\n// Utility methods\n\nfunction encodeTag(tag, primitive, cls, reporter) {\n let res;\n\n if (tag === 'seqof')\n tag = 'seq';\n else if (tag === 'setof')\n tag = 'set';\n\n if (der.tagByName.hasOwnProperty(tag))\n res = der.tagByName[tag];\n else if (typeof tag === 'number' && (tag | 0) === tag)\n res = tag;\n else\n return reporter.error('Unknown tag: ' + tag);\n\n if (res >= 0x1f)\n return reporter.error('Multi-octet tag encoding unsupported');\n\n if (!primitive)\n res |= 0x20;\n\n res |= (der.tagClassByName[cls || 'universal'] << 6);\n\n return res;\n}\n","'use strict';\n\nconst encoders = exports;\n\nencoders.der = require('./der');\nencoders.pem = require('./pem');\n","'use strict';\n\nconst inherits = require('inherits');\n\nconst DEREncoder = require('./der');\n\nfunction PEMEncoder(entity) {\n DEREncoder.call(this, entity);\n this.enc = 'pem';\n}\ninherits(PEMEncoder, DEREncoder);\nmodule.exports = PEMEncoder;\n\nPEMEncoder.prototype.encode = function encode(data, options) {\n const buf = DEREncoder.prototype.encode.call(this, data);\n\n const p = buf.toString('base64');\n const out = [ '-----BEGIN ' + options.label + '-----' ];\n for (let i = 0; i < p.length; i += 64)\n out.push(p.slice(i, i + 64));\n out.push('-----END ' + options.label + '-----');\n return out.join('\\n');\n};\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","// Currently in sync with Node.js lib/assert.js\n// https://github.com/nodejs/node/commit/2a51ae424a513ec9a6aa3466baa0cc1d55dd4f3b\n// Originally from narwhal.js (http://narwhaljs.org)\n// Copyright (c) 2009 Thomas Robinson <280north.com>\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\n// deal in the Software without restriction, including without limitation the\n// rights to use, copy, modify, merge, publish, distribute, sublicense, and/or\n// sell 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\n// all 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 BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN\n// ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION\n// WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n'use strict';\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nvar _require = require('./internal/errors'),\n _require$codes = _require.codes,\n ERR_AMBIGUOUS_ARGUMENT = _require$codes.ERR_AMBIGUOUS_ARGUMENT,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_INVALID_ARG_VALUE = _require$codes.ERR_INVALID_ARG_VALUE,\n ERR_INVALID_RETURN_VALUE = _require$codes.ERR_INVALID_RETURN_VALUE,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS;\n\nvar AssertionError = require('./internal/assert/assertion_error');\n\nvar _require2 = require('util/'),\n inspect = _require2.inspect;\n\nvar _require$types = require('util/').types,\n isPromise = _require$types.isPromise,\n isRegExp = _require$types.isRegExp;\n\nvar objectAssign = Object.assign ? Object.assign : require('es6-object-assign').assign;\nvar objectIs = Object.is ? Object.is : require('object-is');\nvar errorCache = new Map();\nvar isDeepEqual;\nvar isDeepStrictEqual;\nvar parseExpressionAt;\nvar findNodeAround;\nvar decoder;\n\nfunction lazyLoadComparison() {\n var comparison = require('./internal/util/comparisons');\n\n isDeepEqual = comparison.isDeepEqual;\n isDeepStrictEqual = comparison.isDeepStrictEqual;\n} // Escape control characters but not \\n and \\t to keep the line breaks and\n// indentation intact.\n// eslint-disable-next-line no-control-regex\n\n\nvar escapeSequencesRegExp = /[\\x00-\\x08\\x0b\\x0c\\x0e-\\x1f]/g;\nvar meta = [\"\\\\u0000\", \"\\\\u0001\", \"\\\\u0002\", \"\\\\u0003\", \"\\\\u0004\", \"\\\\u0005\", \"\\\\u0006\", \"\\\\u0007\", '\\\\b', '', '', \"\\\\u000b\", '\\\\f', '', \"\\\\u000e\", \"\\\\u000f\", \"\\\\u0010\", \"\\\\u0011\", \"\\\\u0012\", \"\\\\u0013\", \"\\\\u0014\", \"\\\\u0015\", \"\\\\u0016\", \"\\\\u0017\", \"\\\\u0018\", \"\\\\u0019\", \"\\\\u001a\", \"\\\\u001b\", \"\\\\u001c\", \"\\\\u001d\", \"\\\\u001e\", \"\\\\u001f\"];\n\nvar escapeFn = function escapeFn(str) {\n return meta[str.charCodeAt(0)];\n};\n\nvar warned = false; // The assert module provides functions that throw\n// AssertionError's when particular conditions are not met. The\n// assert module must conform to the following interface.\n\nvar assert = module.exports = ok;\nvar NO_EXCEPTION_SENTINEL = {}; // All of the following functions must throw an AssertionError\n// when a corresponding condition is not met, with a message that\n// may be undefined if not provided. All assertion methods provide\n// both the actual and expected values to the assertion error for\n// display purposes.\n\nfunction innerFail(obj) {\n if (obj.message instanceof Error) throw obj.message;\n throw new AssertionError(obj);\n}\n\nfunction fail(actual, expected, message, operator, stackStartFn) {\n var argsLen = arguments.length;\n var internalMessage;\n\n if (argsLen === 0) {\n internalMessage = 'Failed';\n } else if (argsLen === 1) {\n message = actual;\n actual = undefined;\n } else {\n if (warned === false) {\n warned = true;\n var warn = process.emitWarning ? process.emitWarning : console.warn.bind(console);\n warn('assert.fail() with more than one argument is deprecated. ' + 'Please use assert.strictEqual() instead or only pass a message.', 'DeprecationWarning', 'DEP0094');\n }\n\n if (argsLen === 2) operator = '!=';\n }\n\n if (message instanceof Error) throw message;\n var errArgs = {\n actual: actual,\n expected: expected,\n operator: operator === undefined ? 'fail' : operator,\n stackStartFn: stackStartFn || fail\n };\n\n if (message !== undefined) {\n errArgs.message = message;\n }\n\n var err = new AssertionError(errArgs);\n\n if (internalMessage) {\n err.message = internalMessage;\n err.generatedMessage = true;\n }\n\n throw err;\n}\n\nassert.fail = fail; // The AssertionError is defined in internal/error.\n\nassert.AssertionError = AssertionError;\n\nfunction innerOk(fn, argLen, value, message) {\n if (!value) {\n var generatedMessage = false;\n\n if (argLen === 0) {\n generatedMessage = true;\n message = 'No value argument passed to `assert.ok()`';\n } else if (message instanceof Error) {\n throw message;\n }\n\n var err = new AssertionError({\n actual: value,\n expected: true,\n message: message,\n operator: '==',\n stackStartFn: fn\n });\n err.generatedMessage = generatedMessage;\n throw err;\n }\n} // Pure assertion tests whether a value is truthy, as determined\n// by !!value.\n\n\nfunction ok() {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n innerOk.apply(void 0, [ok, args.length].concat(args));\n}\n\nassert.ok = ok; // The equality assertion tests shallow, coercive equality with ==.\n\n/* eslint-disable no-restricted-properties */\n\nassert.equal = function equal(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n } // eslint-disable-next-line eqeqeq\n\n\n if (actual != expected) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: '==',\n stackStartFn: equal\n });\n }\n}; // The non-equality assertion tests for whether two objects are not\n// equal with !=.\n\n\nassert.notEqual = function notEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n } // eslint-disable-next-line eqeqeq\n\n\n if (actual == expected) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: '!=',\n stackStartFn: notEqual\n });\n }\n}; // The equivalence assertion tests a deep equality relation.\n\n\nassert.deepEqual = function deepEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (!isDeepEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'deepEqual',\n stackStartFn: deepEqual\n });\n }\n}; // The non-equivalence assertion tests for any deep inequality.\n\n\nassert.notDeepEqual = function notDeepEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (isDeepEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notDeepEqual',\n stackStartFn: notDeepEqual\n });\n }\n};\n/* eslint-enable */\n\n\nassert.deepStrictEqual = function deepStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (!isDeepStrictEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'deepStrictEqual',\n stackStartFn: deepStrictEqual\n });\n }\n};\n\nassert.notDeepStrictEqual = notDeepStrictEqual;\n\nfunction notDeepStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n\n if (isDeepStrictEqual(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notDeepStrictEqual',\n stackStartFn: notDeepStrictEqual\n });\n }\n}\n\nassert.strictEqual = function strictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (!objectIs(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'strictEqual',\n stackStartFn: strictEqual\n });\n }\n};\n\nassert.notStrictEqual = function notStrictEqual(actual, expected, message) {\n if (arguments.length < 2) {\n throw new ERR_MISSING_ARGS('actual', 'expected');\n }\n\n if (objectIs(actual, expected)) {\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: 'notStrictEqual',\n stackStartFn: notStrictEqual\n });\n }\n};\n\nvar Comparison = function Comparison(obj, keys, actual) {\n var _this = this;\n\n _classCallCheck(this, Comparison);\n\n keys.forEach(function (key) {\n if (key in obj) {\n if (actual !== undefined && typeof actual[key] === 'string' && isRegExp(obj[key]) && obj[key].test(actual[key])) {\n _this[key] = actual[key];\n } else {\n _this[key] = obj[key];\n }\n }\n });\n};\n\nfunction compareExceptionKey(actual, expected, key, message, keys, fn) {\n if (!(key in actual) || !isDeepStrictEqual(actual[key], expected[key])) {\n if (!message) {\n // Create placeholder objects to create a nice output.\n var a = new Comparison(actual, keys);\n var b = new Comparison(expected, keys, actual);\n var err = new AssertionError({\n actual: a,\n expected: b,\n operator: 'deepStrictEqual',\n stackStartFn: fn\n });\n err.actual = actual;\n err.expected = expected;\n err.operator = fn.name;\n throw err;\n }\n\n innerFail({\n actual: actual,\n expected: expected,\n message: message,\n operator: fn.name,\n stackStartFn: fn\n });\n }\n}\n\nfunction expectedException(actual, expected, msg, fn) {\n if (typeof expected !== 'function') {\n if (isRegExp(expected)) return expected.test(actual); // assert.doesNotThrow does not accept objects.\n\n if (arguments.length === 2) {\n throw new ERR_INVALID_ARG_TYPE('expected', ['Function', 'RegExp'], expected);\n } // Handle primitives properly.\n\n\n if (_typeof(actual) !== 'object' || actual === null) {\n var err = new AssertionError({\n actual: actual,\n expected: expected,\n message: msg,\n operator: 'deepStrictEqual',\n stackStartFn: fn\n });\n err.operator = fn.name;\n throw err;\n }\n\n var keys = Object.keys(expected); // Special handle errors to make sure the name and the message are compared\n // as well.\n\n if (expected instanceof Error) {\n keys.push('name', 'message');\n } else if (keys.length === 0) {\n throw new ERR_INVALID_ARG_VALUE('error', expected, 'may not be an empty object');\n }\n\n if (isDeepEqual === undefined) lazyLoadComparison();\n keys.forEach(function (key) {\n if (typeof actual[key] === 'string' && isRegExp(expected[key]) && expected[key].test(actual[key])) {\n return;\n }\n\n compareExceptionKey(actual, expected, key, msg, keys, fn);\n });\n return true;\n } // Guard instanceof against arrow functions as they don't have a prototype.\n\n\n if (expected.prototype !== undefined && actual instanceof expected) {\n return true;\n }\n\n if (Error.isPrototypeOf(expected)) {\n return false;\n }\n\n return expected.call({}, actual) === true;\n}\n\nfunction getActual(fn) {\n if (typeof fn !== 'function') {\n throw new ERR_INVALID_ARG_TYPE('fn', 'Function', fn);\n }\n\n try {\n fn();\n } catch (e) {\n return e;\n }\n\n return NO_EXCEPTION_SENTINEL;\n}\n\nfunction checkIsPromise(obj) {\n // Accept native ES6 promises and promises that are implemented in a similar\n // way. Do not accept thenables that use a function as `obj` and that have no\n // `catch` handler.\n // TODO: thenables are checked up until they have the correct methods,\n // but according to documentation, the `then` method should receive\n // the `fulfill` and `reject` arguments as well or it may be never resolved.\n return isPromise(obj) || obj !== null && _typeof(obj) === 'object' && typeof obj.then === 'function' && typeof obj.catch === 'function';\n}\n\nfunction waitForActual(promiseFn) {\n return Promise.resolve().then(function () {\n var resultPromise;\n\n if (typeof promiseFn === 'function') {\n // Return a rejected promise if `promiseFn` throws synchronously.\n resultPromise = promiseFn(); // Fail in case no promise is returned.\n\n if (!checkIsPromise(resultPromise)) {\n throw new ERR_INVALID_RETURN_VALUE('instance of Promise', 'promiseFn', resultPromise);\n }\n } else if (checkIsPromise(promiseFn)) {\n resultPromise = promiseFn;\n } else {\n throw new ERR_INVALID_ARG_TYPE('promiseFn', ['Function', 'Promise'], promiseFn);\n }\n\n return Promise.resolve().then(function () {\n return resultPromise;\n }).then(function () {\n return NO_EXCEPTION_SENTINEL;\n }).catch(function (e) {\n return e;\n });\n });\n}\n\nfunction expectsError(stackStartFn, actual, error, message) {\n if (typeof error === 'string') {\n if (arguments.length === 4) {\n throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n }\n\n if (_typeof(actual) === 'object' && actual !== null) {\n if (actual.message === error) {\n throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error message \\\"\".concat(actual.message, \"\\\" is identical to the message.\"));\n }\n } else if (actual === error) {\n throw new ERR_AMBIGUOUS_ARGUMENT('error/message', \"The error \\\"\".concat(actual, \"\\\" is identical to the message.\"));\n }\n\n message = error;\n error = undefined;\n } else if (error != null && _typeof(error) !== 'object' && typeof error !== 'function') {\n throw new ERR_INVALID_ARG_TYPE('error', ['Object', 'Error', 'Function', 'RegExp'], error);\n }\n\n if (actual === NO_EXCEPTION_SENTINEL) {\n var details = '';\n\n if (error && error.name) {\n details += \" (\".concat(error.name, \")\");\n }\n\n details += message ? \": \".concat(message) : '.';\n var fnType = stackStartFn.name === 'rejects' ? 'rejection' : 'exception';\n innerFail({\n actual: undefined,\n expected: error,\n operator: stackStartFn.name,\n message: \"Missing expected \".concat(fnType).concat(details),\n stackStartFn: stackStartFn\n });\n }\n\n if (error && !expectedException(actual, error, message, stackStartFn)) {\n throw actual;\n }\n}\n\nfunction expectsNoError(stackStartFn, actual, error, message) {\n if (actual === NO_EXCEPTION_SENTINEL) return;\n\n if (typeof error === 'string') {\n message = error;\n error = undefined;\n }\n\n if (!error || expectedException(actual, error)) {\n var details = message ? \": \".concat(message) : '.';\n var fnType = stackStartFn.name === 'doesNotReject' ? 'rejection' : 'exception';\n innerFail({\n actual: actual,\n expected: error,\n operator: stackStartFn.name,\n message: \"Got unwanted \".concat(fnType).concat(details, \"\\n\") + \"Actual message: \\\"\".concat(actual && actual.message, \"\\\"\"),\n stackStartFn: stackStartFn\n });\n }\n\n throw actual;\n}\n\nassert.throws = function throws(promiseFn) {\n for (var _len2 = arguments.length, args = new Array(_len2 > 1 ? _len2 - 1 : 0), _key2 = 1; _key2 < _len2; _key2++) {\n args[_key2 - 1] = arguments[_key2];\n }\n\n expectsError.apply(void 0, [throws, getActual(promiseFn)].concat(args));\n};\n\nassert.rejects = function rejects(promiseFn) {\n for (var _len3 = arguments.length, args = new Array(_len3 > 1 ? _len3 - 1 : 0), _key3 = 1; _key3 < _len3; _key3++) {\n args[_key3 - 1] = arguments[_key3];\n }\n\n return waitForActual(promiseFn).then(function (result) {\n return expectsError.apply(void 0, [rejects, result].concat(args));\n });\n};\n\nassert.doesNotThrow = function doesNotThrow(fn) {\n for (var _len4 = arguments.length, args = new Array(_len4 > 1 ? _len4 - 1 : 0), _key4 = 1; _key4 < _len4; _key4++) {\n args[_key4 - 1] = arguments[_key4];\n }\n\n expectsNoError.apply(void 0, [doesNotThrow, getActual(fn)].concat(args));\n};\n\nassert.doesNotReject = function doesNotReject(fn) {\n for (var _len5 = arguments.length, args = new Array(_len5 > 1 ? _len5 - 1 : 0), _key5 = 1; _key5 < _len5; _key5++) {\n args[_key5 - 1] = arguments[_key5];\n }\n\n return waitForActual(fn).then(function (result) {\n return expectsNoError.apply(void 0, [doesNotReject, result].concat(args));\n });\n};\n\nassert.ifError = function ifError(err) {\n if (err !== null && err !== undefined) {\n var message = 'ifError got unwanted exception: ';\n\n if (_typeof(err) === 'object' && typeof err.message === 'string') {\n if (err.message.length === 0 && err.constructor) {\n message += err.constructor.name;\n } else {\n message += err.message;\n }\n } else {\n message += inspect(err);\n }\n\n var newErr = new AssertionError({\n actual: err,\n expected: null,\n operator: 'ifError',\n message: message,\n stackStartFn: ifError\n }); // Make sure we actually have a stack trace!\n\n var origStack = err.stack;\n\n if (typeof origStack === 'string') {\n // This will remove any duplicated frames from the error frames taken\n // from within `ifError` and add the original error frames to the newly\n // created ones.\n var tmp2 = origStack.split('\\n');\n tmp2.shift(); // Filter all frames existing in err.stack.\n\n var tmp1 = newErr.stack.split('\\n');\n\n for (var i = 0; i < tmp2.length; i++) {\n // Find the first occurrence of the frame.\n var pos = tmp1.indexOf(tmp2[i]);\n\n if (pos !== -1) {\n // Only keep new frames.\n tmp1 = tmp1.slice(0, pos);\n break;\n }\n }\n\n newErr.stack = \"\".concat(tmp1.join('\\n'), \"\\n\").concat(tmp2.join('\\n'));\n }\n\n throw newErr;\n }\n}; // Expose a strict only variant of assert\n\n\nfunction strict() {\n for (var _len6 = arguments.length, args = new Array(_len6), _key6 = 0; _key6 < _len6; _key6++) {\n args[_key6] = arguments[_key6];\n }\n\n innerOk.apply(void 0, [strict, args.length].concat(args));\n}\n\nassert.strict = objectAssign(strict, assert, {\n equal: assert.strictEqual,\n deepEqual: assert.deepStrictEqual,\n notEqual: assert.notStrictEqual,\n notDeepEqual: assert.notDeepStrictEqual\n});\nassert.strict.strict = assert.strict;","// Currently in sync with Node.js lib/internal/assert/assertion_error.js\n// https://github.com/nodejs/node/commit/0817840f775032169ddd70c85ac059f18ffcc81c\n'use strict';\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; var ownKeys = Object.keys(source); if (typeof Object.getOwnPropertySymbols === 'function') { ownKeys = ownKeys.concat(Object.getOwnPropertySymbols(source).filter(function (sym) { return Object.getOwnPropertyDescriptor(source, sym).enumerable; })); } ownKeys.forEach(function (key) { _defineProperty(target, key, source[key]); }); } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _wrapNativeSuper(Class) { var _cache = typeof Map === \"function\" ? new Map() : undefined; _wrapNativeSuper = function _wrapNativeSuper(Class) { if (Class === null || !_isNativeFunction(Class)) return Class; if (typeof Class !== \"function\") { throw new TypeError(\"Super expression must either be null or a function\"); } if (typeof _cache !== \"undefined\") { if (_cache.has(Class)) return _cache.get(Class); _cache.set(Class, Wrapper); } function Wrapper() { return _construct(Class, arguments, _getPrototypeOf(this).constructor); } Wrapper.prototype = Object.create(Class.prototype, { constructor: { value: Wrapper, enumerable: false, writable: true, configurable: true } }); return _setPrototypeOf(Wrapper, Class); }; return _wrapNativeSuper(Class); }\n\nfunction isNativeReflectConstruct() { if (typeof Reflect === \"undefined\" || !Reflect.construct) return false; if (Reflect.construct.sham) return false; if (typeof Proxy === \"function\") return true; try { Date.prototype.toString.call(Reflect.construct(Date, [], function () {})); return true; } catch (e) { return false; } }\n\nfunction _construct(Parent, args, Class) { if (isNativeReflectConstruct()) { _construct = Reflect.construct; } else { _construct = function _construct(Parent, args, Class) { var a = [null]; a.push.apply(a, args); var Constructor = Function.bind.apply(Parent, a); var instance = new Constructor(); if (Class) _setPrototypeOf(instance, Class.prototype); return instance; }; } return _construct.apply(null, arguments); }\n\nfunction _isNativeFunction(fn) { return Function.toString.call(fn).indexOf(\"[native code]\") !== -1; }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar _require = require('util/'),\n inspect = _require.inspect;\n\nvar _require2 = require('../errors'),\n ERR_INVALID_ARG_TYPE = _require2.codes.ERR_INVALID_ARG_TYPE; // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/repeat\n\n\nfunction repeat(str, count) {\n count = Math.floor(count);\n if (str.length == 0 || count == 0) return '';\n var maxCount = str.length * count;\n count = Math.floor(Math.log(count) / Math.log(2));\n\n while (count) {\n str += str;\n count--;\n }\n\n str += str.substring(0, maxCount - str.length);\n return str;\n}\n\nvar blue = '';\nvar green = '';\nvar red = '';\nvar white = '';\nvar kReadableOperator = {\n deepStrictEqual: 'Expected values to be strictly deep-equal:',\n strictEqual: 'Expected values to be strictly equal:',\n strictEqualObject: 'Expected \"actual\" to be reference-equal to \"expected\":',\n deepEqual: 'Expected values to be loosely deep-equal:',\n equal: 'Expected values to be loosely equal:',\n notDeepStrictEqual: 'Expected \"actual\" not to be strictly deep-equal to:',\n notStrictEqual: 'Expected \"actual\" to be strictly unequal to:',\n notStrictEqualObject: 'Expected \"actual\" not to be reference-equal to \"expected\":',\n notDeepEqual: 'Expected \"actual\" not to be loosely deep-equal to:',\n notEqual: 'Expected \"actual\" to be loosely unequal to:',\n notIdentical: 'Values identical but not reference-equal:'\n}; // Comparing short primitives should just show === / !== instead of using the\n// diff.\n\nvar kMaxShortLength = 10;\n\nfunction copyError(source) {\n var keys = Object.keys(source);\n var target = Object.create(Object.getPrototypeOf(source));\n keys.forEach(function (key) {\n target[key] = source[key];\n });\n Object.defineProperty(target, 'message', {\n value: source.message\n });\n return target;\n}\n\nfunction inspectValue(val) {\n // The util.inspect default values could be changed. This makes sure the\n // error messages contain the necessary information nevertheless.\n return inspect(val, {\n compact: false,\n customInspect: false,\n depth: 1000,\n maxArrayLength: Infinity,\n // Assert compares only enumerable properties (with a few exceptions).\n showHidden: false,\n // Having a long line as error is better than wrapping the line for\n // comparison for now.\n // TODO(BridgeAR): `breakLength` should be limited as soon as soon as we\n // have meta information about the inspected properties (i.e., know where\n // in what line the property starts and ends).\n breakLength: Infinity,\n // Assert does not detect proxies currently.\n showProxy: false,\n sorted: true,\n // Inspect getters as we also check them when comparing entries.\n getters: true\n });\n}\n\nfunction createErrDiff(actual, expected, operator) {\n var other = '';\n var res = '';\n var lastPos = 0;\n var end = '';\n var skipped = false;\n var actualInspected = inspectValue(actual);\n var actualLines = actualInspected.split('\\n');\n var expectedLines = inspectValue(expected).split('\\n');\n var i = 0;\n var indicator = ''; // In case both values are objects explicitly mark them as not reference equal\n // for the `strictEqual` operator.\n\n if (operator === 'strictEqual' && _typeof(actual) === 'object' && _typeof(expected) === 'object' && actual !== null && expected !== null) {\n operator = 'strictEqualObject';\n } // If \"actual\" and \"expected\" fit on a single line and they are not strictly\n // equal, check further special handling.\n\n\n if (actualLines.length === 1 && expectedLines.length === 1 && actualLines[0] !== expectedLines[0]) {\n var inputLength = actualLines[0].length + expectedLines[0].length; // If the character length of \"actual\" and \"expected\" together is less than\n // kMaxShortLength and if neither is an object and at least one of them is\n // not `zero`, use the strict equal comparison to visualize the output.\n\n if (inputLength <= kMaxShortLength) {\n if ((_typeof(actual) !== 'object' || actual === null) && (_typeof(expected) !== 'object' || expected === null) && (actual !== 0 || expected !== 0)) {\n // -0 === +0\n return \"\".concat(kReadableOperator[operator], \"\\n\\n\") + \"\".concat(actualLines[0], \" !== \").concat(expectedLines[0], \"\\n\");\n }\n } else if (operator !== 'strictEqualObject') {\n // If the stderr is a tty and the input length is lower than the current\n // columns per line, add a mismatch indicator below the output. If it is\n // not a tty, use a default value of 80 characters.\n var maxLength = process.stderr && process.stderr.isTTY ? process.stderr.columns : 80;\n\n if (inputLength < maxLength) {\n while (actualLines[0][i] === expectedLines[0][i]) {\n i++;\n } // Ignore the first characters.\n\n\n if (i > 2) {\n // Add position indicator for the first mismatch in case it is a\n // single line and the input length is less than the column length.\n indicator = \"\\n \".concat(repeat(' ', i), \"^\");\n i = 0;\n }\n }\n }\n } // Remove all ending lines that match (this optimizes the output for\n // readability by reducing the number of total changed lines).\n\n\n var a = actualLines[actualLines.length - 1];\n var b = expectedLines[expectedLines.length - 1];\n\n while (a === b) {\n if (i++ < 2) {\n end = \"\\n \".concat(a).concat(end);\n } else {\n other = a;\n }\n\n actualLines.pop();\n expectedLines.pop();\n if (actualLines.length === 0 || expectedLines.length === 0) break;\n a = actualLines[actualLines.length - 1];\n b = expectedLines[expectedLines.length - 1];\n }\n\n var maxLines = Math.max(actualLines.length, expectedLines.length); // Strict equal with identical objects that are not identical by reference.\n // E.g., assert.deepStrictEqual({ a: Symbol() }, { a: Symbol() })\n\n if (maxLines === 0) {\n // We have to get the result again. The lines were all removed before.\n var _actualLines = actualInspected.split('\\n'); // Only remove lines in case it makes sense to collapse those.\n // TODO: Accept env to always show the full error.\n\n\n if (_actualLines.length > 30) {\n _actualLines[26] = \"\".concat(blue, \"...\").concat(white);\n\n while (_actualLines.length > 27) {\n _actualLines.pop();\n }\n }\n\n return \"\".concat(kReadableOperator.notIdentical, \"\\n\\n\").concat(_actualLines.join('\\n'), \"\\n\");\n }\n\n if (i > 3) {\n end = \"\\n\".concat(blue, \"...\").concat(white).concat(end);\n skipped = true;\n }\n\n if (other !== '') {\n end = \"\\n \".concat(other).concat(end);\n other = '';\n }\n\n var printedLines = 0;\n var msg = kReadableOperator[operator] + \"\\n\".concat(green, \"+ actual\").concat(white, \" \").concat(red, \"- expected\").concat(white);\n var skippedMsg = \" \".concat(blue, \"...\").concat(white, \" Lines skipped\");\n\n for (i = 0; i < maxLines; i++) {\n // Only extra expected lines exist\n var cur = i - lastPos;\n\n if (actualLines.length < i + 1) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(expectedLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(expectedLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the expected line to the cache.\n\n other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLines[i]);\n printedLines++; // Only extra actual lines exist\n } else if (expectedLines.length < i + 1) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(actualLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(actualLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the actual line to the result.\n\n res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLines[i]);\n printedLines++; // Lines diverge\n } else {\n var expectedLine = expectedLines[i];\n var actualLine = actualLines[i]; // If the lines diverge, specifically check for lines that only diverge by\n // a trailing comma. In that case it is actually identical and we should\n // mark it as such.\n\n var divergingLines = actualLine !== expectedLine && (!endsWith(actualLine, ',') || actualLine.slice(0, -1) !== expectedLine); // If the expected line has a trailing comma but is otherwise identical,\n // add a comma at the end of the actual line. Otherwise the output could\n // look weird as in:\n //\n // [\n // 1 // No comma at the end!\n // + 2\n // ]\n //\n\n if (divergingLines && endsWith(expectedLine, ',') && expectedLine.slice(0, -1) === actualLine) {\n divergingLines = false;\n actualLine += ',';\n }\n\n if (divergingLines) {\n // If the last diverging line is more than one line above and the\n // current line is at least line three, add some of the former lines and\n // also add dots to indicate skipped entries.\n if (cur > 1 && i > 2) {\n if (cur > 4) {\n res += \"\\n\".concat(blue, \"...\").concat(white);\n skipped = true;\n } else if (cur > 3) {\n res += \"\\n \".concat(actualLines[i - 2]);\n printedLines++;\n }\n\n res += \"\\n \".concat(actualLines[i - 1]);\n printedLines++;\n } // Mark the current line as the last diverging one.\n\n\n lastPos = i; // Add the actual line to the result and cache the expected diverging\n // line so consecutive diverging lines show up as +++--- and not +-+-+-.\n\n res += \"\\n\".concat(green, \"+\").concat(white, \" \").concat(actualLine);\n other += \"\\n\".concat(red, \"-\").concat(white, \" \").concat(expectedLine);\n printedLines += 2; // Lines are identical\n } else {\n // Add all cached information to the result before adding other things\n // and reset the cache.\n res += other;\n other = ''; // If the last diverging line is exactly one line above or if it is the\n // very first line, add the line to the result.\n\n if (cur === 1 || i === 0) {\n res += \"\\n \".concat(actualLine);\n printedLines++;\n }\n }\n } // Inspected object to big (Show ~20 rows max)\n\n\n if (printedLines > 20 && i < maxLines - 2) {\n return \"\".concat(msg).concat(skippedMsg, \"\\n\").concat(res, \"\\n\").concat(blue, \"...\").concat(white).concat(other, \"\\n\") + \"\".concat(blue, \"...\").concat(white);\n }\n }\n\n return \"\".concat(msg).concat(skipped ? skippedMsg : '', \"\\n\").concat(res).concat(other).concat(end).concat(indicator);\n}\n\nvar AssertionError =\n/*#__PURE__*/\nfunction (_Error) {\n _inherits(AssertionError, _Error);\n\n function AssertionError(options) {\n var _this;\n\n _classCallCheck(this, AssertionError);\n\n if (_typeof(options) !== 'object' || options === null) {\n throw new ERR_INVALID_ARG_TYPE('options', 'Object', options);\n }\n\n var message = options.message,\n operator = options.operator,\n stackStartFn = options.stackStartFn;\n var actual = options.actual,\n expected = options.expected;\n var limit = Error.stackTraceLimit;\n Error.stackTraceLimit = 0;\n\n if (message != null) {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, String(message)));\n } else {\n if (process.stderr && process.stderr.isTTY) {\n // Reset on each call to make sure we handle dynamically set environment\n // variables correct.\n if (process.stderr && process.stderr.getColorDepth && process.stderr.getColorDepth() !== 1) {\n blue = \"\\x1B[34m\";\n green = \"\\x1B[32m\";\n white = \"\\x1B[39m\";\n red = \"\\x1B[31m\";\n } else {\n blue = '';\n green = '';\n white = '';\n red = '';\n }\n } // Prevent the error stack from being visible by duplicating the error\n // in a very close way to the original in case both sides are actually\n // instances of Error.\n\n\n if (_typeof(actual) === 'object' && actual !== null && _typeof(expected) === 'object' && expected !== null && 'stack' in actual && actual instanceof Error && 'stack' in expected && expected instanceof Error) {\n actual = copyError(actual);\n expected = copyError(expected);\n }\n\n if (operator === 'deepStrictEqual' || operator === 'strictEqual') {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, createErrDiff(actual, expected, operator)));\n } else if (operator === 'notDeepStrictEqual' || operator === 'notStrictEqual') {\n // In case the objects are equal but the operator requires unequal, show\n // the first object and say A equals B\n var base = kReadableOperator[operator];\n var res = inspectValue(actual).split('\\n'); // In case \"actual\" is an object, it should not be reference equal.\n\n if (operator === 'notStrictEqual' && _typeof(actual) === 'object' && actual !== null) {\n base = kReadableOperator.notStrictEqualObject;\n } // Only remove lines in case it makes sense to collapse those.\n // TODO: Accept env to always show the full error.\n\n\n if (res.length > 30) {\n res[26] = \"\".concat(blue, \"...\").concat(white);\n\n while (res.length > 27) {\n res.pop();\n }\n } // Only print a single input.\n\n\n if (res.length === 1) {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(base, \" \").concat(res[0])));\n } else {\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(base, \"\\n\\n\").concat(res.join('\\n'), \"\\n\")));\n }\n } else {\n var _res = inspectValue(actual);\n\n var other = '';\n var knownOperators = kReadableOperator[operator];\n\n if (operator === 'notDeepEqual' || operator === 'notEqual') {\n _res = \"\".concat(kReadableOperator[operator], \"\\n\\n\").concat(_res);\n\n if (_res.length > 1024) {\n _res = \"\".concat(_res.slice(0, 1021), \"...\");\n }\n } else {\n other = \"\".concat(inspectValue(expected));\n\n if (_res.length > 512) {\n _res = \"\".concat(_res.slice(0, 509), \"...\");\n }\n\n if (other.length > 512) {\n other = \"\".concat(other.slice(0, 509), \"...\");\n }\n\n if (operator === 'deepEqual' || operator === 'equal') {\n _res = \"\".concat(knownOperators, \"\\n\\n\").concat(_res, \"\\n\\nshould equal\\n\\n\");\n } else {\n other = \" \".concat(operator, \" \").concat(other);\n }\n }\n\n _this = _possibleConstructorReturn(this, _getPrototypeOf(AssertionError).call(this, \"\".concat(_res).concat(other)));\n }\n }\n\n Error.stackTraceLimit = limit;\n _this.generatedMessage = !message;\n Object.defineProperty(_assertThisInitialized(_this), 'name', {\n value: 'AssertionError [ERR_ASSERTION]',\n enumerable: false,\n writable: true,\n configurable: true\n });\n _this.code = 'ERR_ASSERTION';\n _this.actual = actual;\n _this.expected = expected;\n _this.operator = operator;\n\n if (Error.captureStackTrace) {\n // eslint-disable-next-line no-restricted-syntax\n Error.captureStackTrace(_assertThisInitialized(_this), stackStartFn);\n } // Create error message including the error code in the name.\n\n\n _this.stack; // Reset the name.\n\n _this.name = 'AssertionError';\n return _possibleConstructorReturn(_this);\n }\n\n _createClass(AssertionError, [{\n key: \"toString\",\n value: function toString() {\n return \"\".concat(this.name, \" [\").concat(this.code, \"]: \").concat(this.message);\n }\n }, {\n key: inspect.custom,\n value: function value(recurseTimes, ctx) {\n // This limits the `actual` and `expected` property default inspection to\n // the minimum depth. Otherwise those values would be too verbose compared\n // to the actual error message which contains a combined view of these two\n // input values.\n return inspect(this, _objectSpread({}, ctx, {\n customInspect: false,\n depth: 0\n }));\n }\n }]);\n\n return AssertionError;\n}(_wrapNativeSuper(Error));\n\nmodule.exports = AssertionError;","// Currently in sync with Node.js lib/internal/errors.js\n// https://github.com/nodejs/node/commit/3b044962c48fe313905877a96b5d0894a5404f6f\n\n/* eslint node-core/documented-errors: \"error\" */\n\n/* eslint node-core/alphabetize-errors: \"error\" */\n\n/* eslint node-core/prefer-util-format-errors: \"error\" */\n'use strict'; // The whole point behind this internal module is to allow Node.js to no\n// longer be forced to treat every error message change as a semver-major\n// change. The NodeError classes here all expose a `code` property whose\n// value statically and permanently identifies the error. While the error\n// message may change, the code should not.\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _possibleConstructorReturn(self, call) { if (call && (_typeof(call) === \"object\" || typeof call === \"function\")) { return call; } return _assertThisInitialized(self); }\n\nfunction _assertThisInitialized(self) { if (self === void 0) { throw new ReferenceError(\"this hasn't been initialised - super() hasn't been called\"); } return self; }\n\nfunction _getPrototypeOf(o) { _getPrototypeOf = Object.setPrototypeOf ? Object.getPrototypeOf : function _getPrototypeOf(o) { return o.__proto__ || Object.getPrototypeOf(o); }; return _getPrototypeOf(o); }\n\nfunction _inherits(subClass, superClass) { if (typeof superClass !== \"function\" && superClass !== null) { throw new TypeError(\"Super expression must either be null or a function\"); } subClass.prototype = Object.create(superClass && superClass.prototype, { constructor: { value: subClass, writable: true, configurable: true } }); if (superClass) _setPrototypeOf(subClass, superClass); }\n\nfunction _setPrototypeOf(o, p) { _setPrototypeOf = Object.setPrototypeOf || function _setPrototypeOf(o, p) { o.__proto__ = p; return o; }; return _setPrototypeOf(o, p); }\n\nvar codes = {}; // Lazy loaded\n\nvar assert;\nvar util;\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inherits(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n var _this;\n\n _classCallCheck(this, NodeError);\n\n _this = _possibleConstructorReturn(this, _getPrototypeOf(NodeError).call(this, getMessage(arg1, arg2, arg3)));\n _this.code = code;\n return _this;\n }\n\n return NodeError;\n }(Base);\n\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_AMBIGUOUS_ARGUMENT', 'The \"%s\" argument is ambiguous. %s', TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n if (assert === undefined) assert = require('../assert');\n assert(typeof name === 'string', \"'name' must be a string\"); // determiner: 'must be' or 'must not be'\n\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } // TODO(BridgeAR): Improve the output by showing `null` and similar.\n\n\n msg += \". Received type \".concat(_typeof(actual));\n return msg;\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_VALUE', function (name, value) {\n var reason = arguments.length > 2 && arguments[2] !== undefined ? arguments[2] : 'is invalid';\n if (util === undefined) util = require('util/');\n var inspected = util.inspect(value);\n\n if (inspected.length > 128) {\n inspected = \"\".concat(inspected.slice(0, 128), \"...\");\n }\n\n return \"The argument '\".concat(name, \"' \").concat(reason, \". Received \").concat(inspected);\n}, TypeError, RangeError);\ncreateErrorType('ERR_INVALID_RETURN_VALUE', function (input, name, value) {\n var type;\n\n if (value && value.constructor && value.constructor.name) {\n type = \"instance of \".concat(value.constructor.name);\n } else {\n type = \"type \".concat(_typeof(value));\n }\n\n return \"Expected \".concat(input, \" to be returned from the \\\"\").concat(name, \"\\\"\") + \" function but got \".concat(type, \".\");\n}, TypeError);\ncreateErrorType('ERR_MISSING_ARGS', function () {\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n if (assert === undefined) assert = require('../assert');\n assert(args.length > 0, 'At least one arg needs to be specified');\n var msg = 'The ';\n var len = args.length;\n args = args.map(function (a) {\n return \"\\\"\".concat(a, \"\\\"\");\n });\n\n switch (len) {\n case 1:\n msg += \"\".concat(args[0], \" argument\");\n break;\n\n case 2:\n msg += \"\".concat(args[0], \" and \").concat(args[1], \" arguments\");\n break;\n\n default:\n msg += args.slice(0, len - 1).join(', ');\n msg += \", and \".concat(args[len - 1], \" arguments\");\n break;\n }\n\n return \"\".concat(msg, \" must be specified\");\n}, TypeError);\nmodule.exports.codes = codes;","// Currently in sync with Node.js lib/internal/util/comparisons.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n'use strict';\n\nfunction _slicedToArray(arr, i) { return _arrayWithHoles(arr) || _iterableToArrayLimit(arr, i) || _nonIterableRest(); }\n\nfunction _nonIterableRest() { throw new TypeError(\"Invalid attempt to destructure non-iterable instance\"); }\n\nfunction _iterableToArrayLimit(arr, i) { var _arr = []; var _n = true; var _d = false; var _e = undefined; try { for (var _i = arr[Symbol.iterator](), _s; !(_n = (_s = _i.next()).done); _n = true) { _arr.push(_s.value); if (i && _arr.length === i) break; } } catch (err) { _d = true; _e = err; } finally { try { if (!_n && _i[\"return\"] != null) _i[\"return\"](); } finally { if (_d) throw _e; } } return _arr; }\n\nfunction _arrayWithHoles(arr) { if (Array.isArray(arr)) return arr; }\n\nfunction _typeof(obj) { if (typeof Symbol === \"function\" && typeof Symbol.iterator === \"symbol\") { _typeof = function _typeof(obj) { return typeof obj; }; } else { _typeof = function _typeof(obj) { return obj && typeof Symbol === \"function\" && obj.constructor === Symbol && obj !== Symbol.prototype ? \"symbol\" : typeof obj; }; } return _typeof(obj); }\n\nvar regexFlagsSupported = /a/g.flags !== undefined;\n\nvar arrayFromSet = function arrayFromSet(set) {\n var array = [];\n set.forEach(function (value) {\n return array.push(value);\n });\n return array;\n};\n\nvar arrayFromMap = function arrayFromMap(map) {\n var array = [];\n map.forEach(function (value, key) {\n return array.push([key, value]);\n });\n return array;\n};\n\nvar objectIs = Object.is ? Object.is : require('object-is');\nvar objectGetOwnPropertySymbols = Object.getOwnPropertySymbols ? Object.getOwnPropertySymbols : function () {\n return [];\n};\nvar numberIsNaN = Number.isNaN ? Number.isNaN : require('is-nan');\n\nfunction uncurryThis(f) {\n return f.call.bind(f);\n}\n\nvar hasOwnProperty = uncurryThis(Object.prototype.hasOwnProperty);\nvar propertyIsEnumerable = uncurryThis(Object.prototype.propertyIsEnumerable);\nvar objectToString = uncurryThis(Object.prototype.toString);\n\nvar _require$types = require('util/').types,\n isAnyArrayBuffer = _require$types.isAnyArrayBuffer,\n isArrayBufferView = _require$types.isArrayBufferView,\n isDate = _require$types.isDate,\n isMap = _require$types.isMap,\n isRegExp = _require$types.isRegExp,\n isSet = _require$types.isSet,\n isNativeError = _require$types.isNativeError,\n isBoxedPrimitive = _require$types.isBoxedPrimitive,\n isNumberObject = _require$types.isNumberObject,\n isStringObject = _require$types.isStringObject,\n isBooleanObject = _require$types.isBooleanObject,\n isBigIntObject = _require$types.isBigIntObject,\n isSymbolObject = _require$types.isSymbolObject,\n isFloat32Array = _require$types.isFloat32Array,\n isFloat64Array = _require$types.isFloat64Array;\n\nfunction isNonIndex(key) {\n if (key.length === 0 || key.length > 10) return true;\n\n for (var i = 0; i < key.length; i++) {\n var code = key.charCodeAt(i);\n if (code < 48 || code > 57) return true;\n } // The maximum size for an array is 2 ** 32 -1.\n\n\n return key.length === 10 && key >= Math.pow(2, 32);\n}\n\nfunction getOwnNonIndexProperties(value) {\n return Object.keys(value).filter(isNonIndex).concat(objectGetOwnPropertySymbols(value).filter(Object.prototype.propertyIsEnumerable.bind(value)));\n} // Taken from https://github.com/feross/buffer/blob/680e9e5e488f22aac27599a57dc844a6315928dd/index.js\n// original notice:\n\n/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh \n * @license MIT\n */\n\n\nfunction compare(a, b) {\n if (a === b) {\n return 0;\n }\n\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) {\n return -1;\n }\n\n if (y < x) {\n return 1;\n }\n\n return 0;\n}\n\nvar ONLY_ENUMERABLE = undefined;\nvar kStrict = true;\nvar kLoose = false;\nvar kNoIterator = 0;\nvar kIsArray = 1;\nvar kIsSet = 2;\nvar kIsMap = 3; // Check if they have the same source and flags\n\nfunction areSimilarRegExps(a, b) {\n return regexFlagsSupported ? a.source === b.source && a.flags === b.flags : RegExp.prototype.toString.call(a) === RegExp.prototype.toString.call(b);\n}\n\nfunction areSimilarFloatArrays(a, b) {\n if (a.byteLength !== b.byteLength) {\n return false;\n }\n\n for (var offset = 0; offset < a.byteLength; offset++) {\n if (a[offset] !== b[offset]) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction areSimilarTypedArrays(a, b) {\n if (a.byteLength !== b.byteLength) {\n return false;\n }\n\n return compare(new Uint8Array(a.buffer, a.byteOffset, a.byteLength), new Uint8Array(b.buffer, b.byteOffset, b.byteLength)) === 0;\n}\n\nfunction areEqualArrayBuffers(buf1, buf2) {\n return buf1.byteLength === buf2.byteLength && compare(new Uint8Array(buf1), new Uint8Array(buf2)) === 0;\n}\n\nfunction isEqualBoxedPrimitive(val1, val2) {\n if (isNumberObject(val1)) {\n return isNumberObject(val2) && objectIs(Number.prototype.valueOf.call(val1), Number.prototype.valueOf.call(val2));\n }\n\n if (isStringObject(val1)) {\n return isStringObject(val2) && String.prototype.valueOf.call(val1) === String.prototype.valueOf.call(val2);\n }\n\n if (isBooleanObject(val1)) {\n return isBooleanObject(val2) && Boolean.prototype.valueOf.call(val1) === Boolean.prototype.valueOf.call(val2);\n }\n\n if (isBigIntObject(val1)) {\n return isBigIntObject(val2) && BigInt.prototype.valueOf.call(val1) === BigInt.prototype.valueOf.call(val2);\n }\n\n return isSymbolObject(val2) && Symbol.prototype.valueOf.call(val1) === Symbol.prototype.valueOf.call(val2);\n} // Notes: Type tags are historical [[Class]] properties that can be set by\n// FunctionTemplate::SetClassName() in C++ or Symbol.toStringTag in JS\n// and retrieved using Object.prototype.toString.call(obj) in JS\n// See https://tc39.github.io/ecma262/#sec-object.prototype.tostring\n// for a list of tags pre-defined in the spec.\n// There are some unspecified tags in the wild too (e.g. typed array tags).\n// Since tags can be altered, they only serve fast failures\n//\n// Typed arrays and buffers are checked by comparing the content in their\n// underlying ArrayBuffer. This optimization requires that it's\n// reasonable to interpret their underlying memory in the same way,\n// which is checked by comparing their type tags.\n// (e.g. a Uint8Array and a Uint16Array with the same memory content\n// could still be different because they will be interpreted differently).\n//\n// For strict comparison, objects should have\n// a) The same built-in type tags\n// b) The same prototypes.\n\n\nfunction innerDeepEqual(val1, val2, strict, memos) {\n // All identical values are equivalent, as determined by ===.\n if (val1 === val2) {\n if (val1 !== 0) return true;\n return strict ? objectIs(val1, val2) : true;\n } // Check more closely if val1 and val2 are equal.\n\n\n if (strict) {\n if (_typeof(val1) !== 'object') {\n return typeof val1 === 'number' && numberIsNaN(val1) && numberIsNaN(val2);\n }\n\n if (_typeof(val2) !== 'object' || val1 === null || val2 === null) {\n return false;\n }\n\n if (Object.getPrototypeOf(val1) !== Object.getPrototypeOf(val2)) {\n return false;\n }\n } else {\n if (val1 === null || _typeof(val1) !== 'object') {\n if (val2 === null || _typeof(val2) !== 'object') {\n // eslint-disable-next-line eqeqeq\n return val1 == val2;\n }\n\n return false;\n }\n\n if (val2 === null || _typeof(val2) !== 'object') {\n return false;\n }\n }\n\n var val1Tag = objectToString(val1);\n var val2Tag = objectToString(val2);\n\n if (val1Tag !== val2Tag) {\n return false;\n }\n\n if (Array.isArray(val1)) {\n // Check for sparse arrays and general fast path\n if (val1.length !== val2.length) {\n return false;\n }\n\n var keys1 = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n var keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n\n if (keys1.length !== keys2.length) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsArray, keys1);\n } // [browserify] This triggers on certain types in IE (Map/Set) so we don't\n // wan't to early return out of the rest of the checks. However we can check\n // if the second value is one of these values and the first isn't.\n\n\n if (val1Tag === '[object Object]') {\n // return keyCheck(val1, val2, strict, memos, kNoIterator);\n if (!isMap(val1) && isMap(val2) || !isSet(val1) && isSet(val2)) {\n return false;\n }\n }\n\n if (isDate(val1)) {\n if (!isDate(val2) || Date.prototype.getTime.call(val1) !== Date.prototype.getTime.call(val2)) {\n return false;\n }\n } else if (isRegExp(val1)) {\n if (!isRegExp(val2) || !areSimilarRegExps(val1, val2)) {\n return false;\n }\n } else if (isNativeError(val1) || val1 instanceof Error) {\n // Do not compare the stack as it might differ even though the error itself\n // is otherwise identical.\n if (val1.message !== val2.message || val1.name !== val2.name) {\n return false;\n }\n } else if (isArrayBufferView(val1)) {\n if (!strict && (isFloat32Array(val1) || isFloat64Array(val1))) {\n if (!areSimilarFloatArrays(val1, val2)) {\n return false;\n }\n } else if (!areSimilarTypedArrays(val1, val2)) {\n return false;\n } // Buffer.compare returns true, so val1.length === val2.length. If they both\n // only contain numeric keys, we don't need to exam further than checking\n // the symbols.\n\n\n var _keys = getOwnNonIndexProperties(val1, ONLY_ENUMERABLE);\n\n var _keys2 = getOwnNonIndexProperties(val2, ONLY_ENUMERABLE);\n\n if (_keys.length !== _keys2.length) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kNoIterator, _keys);\n } else if (isSet(val1)) {\n if (!isSet(val2) || val1.size !== val2.size) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsSet);\n } else if (isMap(val1)) {\n if (!isMap(val2) || val1.size !== val2.size) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kIsMap);\n } else if (isAnyArrayBuffer(val1)) {\n if (!areEqualArrayBuffers(val1, val2)) {\n return false;\n }\n } else if (isBoxedPrimitive(val1) && !isEqualBoxedPrimitive(val1, val2)) {\n return false;\n }\n\n return keyCheck(val1, val2, strict, memos, kNoIterator);\n}\n\nfunction getEnumerables(val, keys) {\n return keys.filter(function (k) {\n return propertyIsEnumerable(val, k);\n });\n}\n\nfunction keyCheck(val1, val2, strict, memos, iterationType, aKeys) {\n // For all remaining Object pairs, including Array, objects and Maps,\n // equivalence is determined by having:\n // a) The same number of owned enumerable properties\n // b) The same set of keys/indexes (although not necessarily the same order)\n // c) Equivalent values for every corresponding key/index\n // d) For Sets and Maps, equal contents\n // Note: this accounts for both named and indexed properties on Arrays.\n if (arguments.length === 5) {\n aKeys = Object.keys(val1);\n var bKeys = Object.keys(val2); // The pair must have the same number of owned properties.\n\n if (aKeys.length !== bKeys.length) {\n return false;\n }\n } // Cheap key test\n\n\n var i = 0;\n\n for (; i < aKeys.length; i++) {\n if (!hasOwnProperty(val2, aKeys[i])) {\n return false;\n }\n }\n\n if (strict && arguments.length === 5) {\n var symbolKeysA = objectGetOwnPropertySymbols(val1);\n\n if (symbolKeysA.length !== 0) {\n var count = 0;\n\n for (i = 0; i < symbolKeysA.length; i++) {\n var key = symbolKeysA[i];\n\n if (propertyIsEnumerable(val1, key)) {\n if (!propertyIsEnumerable(val2, key)) {\n return false;\n }\n\n aKeys.push(key);\n count++;\n } else if (propertyIsEnumerable(val2, key)) {\n return false;\n }\n }\n\n var symbolKeysB = objectGetOwnPropertySymbols(val2);\n\n if (symbolKeysA.length !== symbolKeysB.length && getEnumerables(val2, symbolKeysB).length !== count) {\n return false;\n }\n } else {\n var _symbolKeysB = objectGetOwnPropertySymbols(val2);\n\n if (_symbolKeysB.length !== 0 && getEnumerables(val2, _symbolKeysB).length !== 0) {\n return false;\n }\n }\n }\n\n if (aKeys.length === 0 && (iterationType === kNoIterator || iterationType === kIsArray && val1.length === 0 || val1.size === 0)) {\n return true;\n } // Use memos to handle cycles.\n\n\n if (memos === undefined) {\n memos = {\n val1: new Map(),\n val2: new Map(),\n position: 0\n };\n } else {\n // We prevent up to two map.has(x) calls by directly retrieving the value\n // and checking for undefined. The map can only contain numbers, so it is\n // safe to check for undefined only.\n var val2MemoA = memos.val1.get(val1);\n\n if (val2MemoA !== undefined) {\n var val2MemoB = memos.val2.get(val2);\n\n if (val2MemoB !== undefined) {\n return val2MemoA === val2MemoB;\n }\n }\n\n memos.position++;\n }\n\n memos.val1.set(val1, memos.position);\n memos.val2.set(val2, memos.position);\n var areEq = objEquiv(val1, val2, strict, aKeys, memos, iterationType);\n memos.val1.delete(val1);\n memos.val2.delete(val2);\n return areEq;\n}\n\nfunction setHasEqualElement(set, val1, strict, memo) {\n // Go looking.\n var setValues = arrayFromSet(set);\n\n for (var i = 0; i < setValues.length; i++) {\n var val2 = setValues[i];\n\n if (innerDeepEqual(val1, val2, strict, memo)) {\n // Remove the matching element to make sure we do not check that again.\n set.delete(val2);\n return true;\n }\n }\n\n return false;\n} // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Equality_comparisons_and_sameness#Loose_equality_using\n// Sadly it is not possible to detect corresponding values properly in case the\n// type is a string, number, bigint or boolean. The reason is that those values\n// can match lots of different string values (e.g., 1n == '+00001').\n\n\nfunction findLooseMatchingPrimitives(prim) {\n switch (_typeof(prim)) {\n case 'undefined':\n return null;\n\n case 'object':\n // Only pass in null as object!\n return undefined;\n\n case 'symbol':\n return false;\n\n case 'string':\n prim = +prim;\n // Loose equal entries exist only if the string is possible to convert to\n // a regular number and not NaN.\n // Fall through\n\n case 'number':\n if (numberIsNaN(prim)) {\n return false;\n }\n\n }\n\n return true;\n}\n\nfunction setMightHaveLoosePrim(a, b, prim) {\n var altValue = findLooseMatchingPrimitives(prim);\n if (altValue != null) return altValue;\n return b.has(altValue) && !a.has(altValue);\n}\n\nfunction mapMightHaveLoosePrim(a, b, prim, item, memo) {\n var altValue = findLooseMatchingPrimitives(prim);\n\n if (altValue != null) {\n return altValue;\n }\n\n var curB = b.get(altValue);\n\n if (curB === undefined && !b.has(altValue) || !innerDeepEqual(item, curB, false, memo)) {\n return false;\n }\n\n return !a.has(altValue) && innerDeepEqual(item, curB, false, memo);\n}\n\nfunction setEquiv(a, b, strict, memo) {\n // This is a lazily initiated Set of entries which have to be compared\n // pairwise.\n var set = null;\n var aValues = arrayFromSet(a);\n\n for (var i = 0; i < aValues.length; i++) {\n var val = aValues[i]; // Note: Checking for the objects first improves the performance for object\n // heavy sets but it is a minor slow down for primitives. As they are fast\n // to check this improves the worst case scenario instead.\n\n if (_typeof(val) === 'object' && val !== null) {\n if (set === null) {\n set = new Set();\n } // If the specified value doesn't exist in the second set its an not null\n // object (or non strict only: a not matching primitive) we'll need to go\n // hunting for something thats deep-(strict-)equal to it. To make this\n // O(n log n) complexity we have to copy these values in a new set first.\n\n\n set.add(val);\n } else if (!b.has(val)) {\n if (strict) return false; // Fast path to detect missing string, symbol, undefined and null values.\n\n if (!setMightHaveLoosePrim(a, b, val)) {\n return false;\n }\n\n if (set === null) {\n set = new Set();\n }\n\n set.add(val);\n }\n }\n\n if (set !== null) {\n var bValues = arrayFromSet(b);\n\n for (var _i = 0; _i < bValues.length; _i++) {\n var _val = bValues[_i]; // We have to check if a primitive value is already\n // matching and only if it's not, go hunting for it.\n\n if (_typeof(_val) === 'object' && _val !== null) {\n if (!setHasEqualElement(set, _val, strict, memo)) return false;\n } else if (!strict && !a.has(_val) && !setHasEqualElement(set, _val, strict, memo)) {\n return false;\n }\n }\n\n return set.size === 0;\n }\n\n return true;\n}\n\nfunction mapHasEqualEntry(set, map, key1, item1, strict, memo) {\n // To be able to handle cases like:\n // Map([[{}, 'a'], [{}, 'b']]) vs Map([[{}, 'b'], [{}, 'a']])\n // ... we need to consider *all* matching keys, not just the first we find.\n var setValues = arrayFromSet(set);\n\n for (var i = 0; i < setValues.length; i++) {\n var key2 = setValues[i];\n\n if (innerDeepEqual(key1, key2, strict, memo) && innerDeepEqual(item1, map.get(key2), strict, memo)) {\n set.delete(key2);\n return true;\n }\n }\n\n return false;\n}\n\nfunction mapEquiv(a, b, strict, memo) {\n var set = null;\n var aEntries = arrayFromMap(a);\n\n for (var i = 0; i < aEntries.length; i++) {\n var _aEntries$i = _slicedToArray(aEntries[i], 2),\n key = _aEntries$i[0],\n item1 = _aEntries$i[1];\n\n if (_typeof(key) === 'object' && key !== null) {\n if (set === null) {\n set = new Set();\n }\n\n set.add(key);\n } else {\n // By directly retrieving the value we prevent another b.has(key) check in\n // almost all possible cases.\n var item2 = b.get(key);\n\n if (item2 === undefined && !b.has(key) || !innerDeepEqual(item1, item2, strict, memo)) {\n if (strict) return false; // Fast path to detect missing string, symbol, undefined and null\n // keys.\n\n if (!mapMightHaveLoosePrim(a, b, key, item1, memo)) return false;\n\n if (set === null) {\n set = new Set();\n }\n\n set.add(key);\n }\n }\n }\n\n if (set !== null) {\n var bEntries = arrayFromMap(b);\n\n for (var _i2 = 0; _i2 < bEntries.length; _i2++) {\n var _bEntries$_i = _slicedToArray(bEntries[_i2], 2),\n key = _bEntries$_i[0],\n item = _bEntries$_i[1];\n\n if (_typeof(key) === 'object' && key !== null) {\n if (!mapHasEqualEntry(set, a, key, item, strict, memo)) return false;\n } else if (!strict && (!a.has(key) || !innerDeepEqual(a.get(key), item, false, memo)) && !mapHasEqualEntry(set, a, key, item, false, memo)) {\n return false;\n }\n }\n\n return set.size === 0;\n }\n\n return true;\n}\n\nfunction objEquiv(a, b, strict, keys, memos, iterationType) {\n // Sets and maps don't have their entries accessible via normal object\n // properties.\n var i = 0;\n\n if (iterationType === kIsSet) {\n if (!setEquiv(a, b, strict, memos)) {\n return false;\n }\n } else if (iterationType === kIsMap) {\n if (!mapEquiv(a, b, strict, memos)) {\n return false;\n }\n } else if (iterationType === kIsArray) {\n for (; i < a.length; i++) {\n if (hasOwnProperty(a, i)) {\n if (!hasOwnProperty(b, i) || !innerDeepEqual(a[i], b[i], strict, memos)) {\n return false;\n }\n } else if (hasOwnProperty(b, i)) {\n return false;\n } else {\n // Array is sparse.\n var keysA = Object.keys(a);\n\n for (; i < keysA.length; i++) {\n var key = keysA[i];\n\n if (!hasOwnProperty(b, key) || !innerDeepEqual(a[key], b[key], strict, memos)) {\n return false;\n }\n }\n\n if (keysA.length !== Object.keys(b).length) {\n return false;\n }\n\n return true;\n }\n }\n } // The pair must have equivalent values for every corresponding key.\n // Possibly expensive deep test:\n\n\n for (i = 0; i < keys.length; i++) {\n var _key = keys[i];\n\n if (!innerDeepEqual(a[_key], b[_key], strict, memos)) {\n return false;\n }\n }\n\n return true;\n}\n\nfunction isDeepEqual(val1, val2) {\n return innerDeepEqual(val1, val2, kLoose);\n}\n\nfunction isDeepStrictEqual(val1, val2) {\n return innerDeepEqual(val1, val2, kStrict);\n}\n\nmodule.exports = {\n isDeepEqual: isDeepEqual,\n isDeepStrictEqual: isDeepStrictEqual\n};","'use strict'\n\nexports.byteLength = byteLength\nexports.toByteArray = toByteArray\nexports.fromByteArray = fromByteArray\n\nvar lookup = []\nvar revLookup = []\nvar Arr = typeof Uint8Array !== 'undefined' ? Uint8Array : Array\n\nvar code = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/'\nfor (var i = 0, len = code.length; i < len; ++i) {\n lookup[i] = code[i]\n revLookup[code.charCodeAt(i)] = i\n}\n\n// Support decoding URL-safe base64 strings, as Node.js does.\n// See: https://en.wikipedia.org/wiki/Base64#URL_applications\nrevLookup['-'.charCodeAt(0)] = 62\nrevLookup['_'.charCodeAt(0)] = 63\n\nfunction getLens (b64) {\n var len = b64.length\n\n if (len % 4 > 0) {\n throw new Error('Invalid string. Length must be a multiple of 4')\n }\n\n // Trim off extra bytes after placeholder bytes are found\n // See: https://github.com/beatgammit/base64-js/issues/42\n var validLen = b64.indexOf('=')\n if (validLen === -1) validLen = len\n\n var placeHoldersLen = validLen === len\n ? 0\n : 4 - (validLen % 4)\n\n return [validLen, placeHoldersLen]\n}\n\n// base64 is 4/3 + up to two characters of the original data\nfunction byteLength (b64) {\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction _byteLength (b64, validLen, placeHoldersLen) {\n return ((validLen + placeHoldersLen) * 3 / 4) - placeHoldersLen\n}\n\nfunction toByteArray (b64) {\n var tmp\n var lens = getLens(b64)\n var validLen = lens[0]\n var placeHoldersLen = lens[1]\n\n var arr = new Arr(_byteLength(b64, validLen, placeHoldersLen))\n\n var curByte = 0\n\n // if there are placeholders, only get up to the last complete 4 chars\n var len = placeHoldersLen > 0\n ? validLen - 4\n : validLen\n\n var i\n for (i = 0; i < len; i += 4) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 18) |\n (revLookup[b64.charCodeAt(i + 1)] << 12) |\n (revLookup[b64.charCodeAt(i + 2)] << 6) |\n revLookup[b64.charCodeAt(i + 3)]\n arr[curByte++] = (tmp >> 16) & 0xFF\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 2) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 2) |\n (revLookup[b64.charCodeAt(i + 1)] >> 4)\n arr[curByte++] = tmp & 0xFF\n }\n\n if (placeHoldersLen === 1) {\n tmp =\n (revLookup[b64.charCodeAt(i)] << 10) |\n (revLookup[b64.charCodeAt(i + 1)] << 4) |\n (revLookup[b64.charCodeAt(i + 2)] >> 2)\n arr[curByte++] = (tmp >> 8) & 0xFF\n arr[curByte++] = tmp & 0xFF\n }\n\n return arr\n}\n\nfunction tripletToBase64 (num) {\n return lookup[num >> 18 & 0x3F] +\n lookup[num >> 12 & 0x3F] +\n lookup[num >> 6 & 0x3F] +\n lookup[num & 0x3F]\n}\n\nfunction encodeChunk (uint8, start, end) {\n var tmp\n var output = []\n for (var i = start; i < end; i += 3) {\n tmp =\n ((uint8[i] << 16) & 0xFF0000) +\n ((uint8[i + 1] << 8) & 0xFF00) +\n (uint8[i + 2] & 0xFF)\n output.push(tripletToBase64(tmp))\n }\n return output.join('')\n}\n\nfunction fromByteArray (uint8) {\n var tmp\n var len = uint8.length\n var extraBytes = len % 3 // if we have 1 byte left, pad 2 bytes\n var parts = []\n var maxChunkLength = 16383 // must be multiple of 3\n\n // go through the array every three bytes, we'll deal with trailing stuff later\n for (var i = 0, len2 = len - extraBytes; i < len2; i += maxChunkLength) {\n parts.push(encodeChunk(uint8, i, (i + maxChunkLength) > len2 ? len2 : (i + maxChunkLength)))\n }\n\n // pad the end with zeros, but make sure to not forget the extra bytes\n if (extraBytes === 1) {\n tmp = uint8[len - 1]\n parts.push(\n lookup[tmp >> 2] +\n lookup[(tmp << 4) & 0x3F] +\n '=='\n )\n } else if (extraBytes === 2) {\n tmp = (uint8[len - 2] << 8) + uint8[len - 1]\n parts.push(\n lookup[tmp >> 10] +\n lookup[(tmp >> 4) & 0x3F] +\n lookup[(tmp << 2) & 0x3F] +\n '='\n )\n }\n\n return parts.join('')\n}\n","const INTEGER_START = 0x69 // 'i'\nconst STRING_DELIM = 0x3A // ':'\nconst DICTIONARY_START = 0x64 // 'd'\nconst LIST_START = 0x6C // 'l'\nconst END_OF_TYPE = 0x65 // 'e'\n\n/**\n * replaces parseInt(buffer.toString('ascii', start, end)).\n * For strings with less then ~30 charachters, this is actually a lot faster.\n *\n * @param {Buffer} data\n * @param {Number} start\n * @param {Number} end\n * @return {Number} calculated number\n */\nfunction getIntFromBuffer (buffer, start, end) {\n let sum = 0\n let sign = 1\n\n for (let i = start; i < end; i++) {\n const num = buffer[i]\n\n if (num < 58 && num >= 48) {\n sum = sum * 10 + (num - 48)\n continue\n }\n\n if (i === start && num === 43) { // +\n continue\n }\n\n if (i === start && num === 45) { // -\n sign = -1\n continue\n }\n\n if (num === 46) { // .\n // its a float. break here.\n break\n }\n\n throw new Error('not a number: buffer[' + i + '] = ' + num)\n }\n\n return sum * sign\n}\n\n/**\n * Decodes bencoded data.\n *\n * @param {Buffer} data\n * @param {Number} start (optional)\n * @param {Number} end (optional)\n * @param {String} encoding (optional)\n * @return {Object|Array|Buffer|String|Number}\n */\nfunction decode (data, start, end, encoding) {\n if (data == null || data.length === 0) {\n return null\n }\n\n if (typeof start !== 'number' && encoding == null) {\n encoding = start\n start = undefined\n }\n\n if (typeof end !== 'number' && encoding == null) {\n encoding = end\n end = undefined\n }\n\n decode.position = 0\n decode.encoding = encoding || null\n\n decode.data = !(Buffer.isBuffer(data))\n ? Buffer.from(data)\n : data.slice(start, end)\n\n decode.bytes = decode.data.length\n\n return decode.next()\n}\n\ndecode.bytes = 0\ndecode.position = 0\ndecode.data = null\ndecode.encoding = null\n\ndecode.next = function () {\n switch (decode.data[decode.position]) {\n case DICTIONARY_START:\n return decode.dictionary()\n case LIST_START:\n return decode.list()\n case INTEGER_START:\n return decode.integer()\n default:\n return decode.buffer()\n }\n}\n\ndecode.find = function (chr) {\n let i = decode.position\n const c = decode.data.length\n const d = decode.data\n\n while (i < c) {\n if (d[i] === chr) return i\n i++\n }\n\n throw new Error(\n 'Invalid data: Missing delimiter \"' +\n String.fromCharCode(chr) + '\" [0x' +\n chr.toString(16) + ']'\n )\n}\n\ndecode.dictionary = function () {\n decode.position++\n\n const dict = {}\n\n while (decode.data[decode.position] !== END_OF_TYPE) {\n dict[decode.buffer()] = decode.next()\n }\n\n decode.position++\n\n return dict\n}\n\ndecode.list = function () {\n decode.position++\n\n const lst = []\n\n while (decode.data[decode.position] !== END_OF_TYPE) {\n lst.push(decode.next())\n }\n\n decode.position++\n\n return lst\n}\n\ndecode.integer = function () {\n const end = decode.find(END_OF_TYPE)\n const number = getIntFromBuffer(decode.data, decode.position + 1, end)\n\n decode.position += end + 1 - decode.position\n\n return number\n}\n\ndecode.buffer = function () {\n let sep = decode.find(STRING_DELIM)\n const length = getIntFromBuffer(decode.data, decode.position, sep)\n const end = ++sep + length\n\n decode.position = end\n\n return decode.encoding\n ? decode.data.toString(decode.encoding, sep, end)\n : decode.data.slice(sep, end)\n}\n\nmodule.exports = decode\n","const { getType } = require('./util.js')\n\n/**\n * Encodes data in bencode.\n *\n * @param {Buffer|Array|String|Object|Number|Boolean} data\n * @return {Buffer}\n */\nfunction encode (data, buffer, offset) {\n const buffers = []\n let result = null\n\n encode._encode(buffers, data)\n result = Buffer.concat(buffers)\n encode.bytes = result.length\n\n if (Buffer.isBuffer(buffer)) {\n result.copy(buffer, offset)\n return buffer\n }\n\n return result\n}\n\nencode.bytes = -1\nencode._floatConversionDetected = false\n\nencode._encode = function (buffers, data) {\n if (data == null) { return }\n\n switch (getType(data)) {\n case 'buffer': encode.buffer(buffers, data); break\n case 'object': encode.dict(buffers, data); break\n case 'map': encode.dictMap(buffers, data); break\n case 'array': encode.list(buffers, data); break\n case 'set': encode.listSet(buffers, data); break\n case 'string': encode.string(buffers, data); break\n case 'number': encode.number(buffers, data); break\n case 'boolean': encode.number(buffers, data); break\n case 'arraybufferview': encode.buffer(buffers, Buffer.from(data.buffer, data.byteOffset, data.byteLength)); break\n case 'arraybuffer': encode.buffer(buffers, Buffer.from(data)); break\n }\n}\n\nconst buffE = Buffer.from('e')\nconst buffD = Buffer.from('d')\nconst buffL = Buffer.from('l')\n\nencode.buffer = function (buffers, data) {\n buffers.push(Buffer.from(data.length + ':'), data)\n}\n\nencode.string = function (buffers, data) {\n buffers.push(Buffer.from(Buffer.byteLength(data) + ':' + data))\n}\n\nencode.number = function (buffers, data) {\n const maxLo = 0x80000000\n const hi = (data / maxLo) << 0\n const lo = (data % maxLo) << 0\n const val = hi * maxLo + lo\n\n buffers.push(Buffer.from('i' + val + 'e'))\n\n if (val !== data && !encode._floatConversionDetected) {\n encode._floatConversionDetected = true\n console.warn(\n 'WARNING: Possible data corruption detected with value \"' + data + '\":',\n 'Bencoding only defines support for integers, value was converted to \"' + val + '\"'\n )\n console.trace()\n }\n}\n\nencode.dict = function (buffers, data) {\n buffers.push(buffD)\n\n let j = 0\n let k\n // fix for issue #13 - sorted dicts\n const keys = Object.keys(data).sort()\n const kl = keys.length\n\n for (; j < kl; j++) {\n k = keys[j]\n if (data[k] == null) continue\n encode.string(buffers, k)\n encode._encode(buffers, data[k])\n }\n\n buffers.push(buffE)\n}\n\nencode.dictMap = function (buffers, data) {\n buffers.push(buffD)\n\n const keys = Array.from(data.keys()).sort()\n\n for (const key of keys) {\n if (data.get(key) == null) continue\n Buffer.isBuffer(key)\n ? encode._encode(buffers, key)\n : encode.string(buffers, String(key))\n encode._encode(buffers, data.get(key))\n }\n\n buffers.push(buffE)\n}\n\nencode.list = function (buffers, data) {\n let i = 0\n const c = data.length\n buffers.push(buffL)\n\n for (; i < c; i++) {\n if (data[i] == null) continue\n encode._encode(buffers, data[i])\n }\n\n buffers.push(buffE)\n}\n\nencode.listSet = function (buffers, data) {\n buffers.push(buffL)\n\n for (const item of data) {\n if (item == null) continue\n encode._encode(buffers, item)\n }\n\n buffers.push(buffE)\n}\n\nmodule.exports = encode\n","const { digitCount, getType } = require('./util.js')\n\nfunction listLength (list) {\n let length = 1 + 1 // type marker + end-of-type marker\n\n for (const value of list) {\n length += encodingLength(value)\n }\n\n return length\n}\n\nfunction mapLength (map) {\n let length = 1 + 1 // type marker + end-of-type marker\n\n for (const [key, value] of map) {\n const keyLength = Buffer.byteLength(key)\n length += digitCount(keyLength) + 1 + keyLength\n length += encodingLength(value)\n }\n\n return length\n}\n\nfunction objectLength (value) {\n let length = 1 + 1 // type marker + end-of-type marker\n const keys = Object.keys(value)\n\n for (let i = 0; i < keys.length; i++) {\n const keyLength = Buffer.byteLength(keys[i])\n length += digitCount(keyLength) + 1 + keyLength\n length += encodingLength(value[keys[i]])\n }\n\n return length\n}\n\nfunction stringLength (value) {\n const length = Buffer.byteLength(value)\n return digitCount(length) + 1 + length\n}\n\nfunction arrayBufferLength (value) {\n const length = value.byteLength - value.byteOffset\n return digitCount(length) + 1 + length\n}\n\nfunction encodingLength (value) {\n const length = 0\n\n if (value == null) return length\n\n const type = getType(value)\n\n switch (type) {\n case 'buffer': return digitCount(value.length) + 1 + value.length\n case 'arraybufferview': return arrayBufferLength(value)\n case 'string': return stringLength(value)\n case 'array': case 'set': return listLength(value)\n case 'number': return 1 + digitCount(Math.floor(value)) + 1\n case 'bigint': return 1 + value.toString().length + 1\n case 'object': return objectLength(value)\n case 'map': return mapLength(value)\n default:\n throw new TypeError(`Unsupported value of type \"${type}\"`)\n }\n}\n\nmodule.exports = encodingLength\n","const bencode = module.exports\n\nbencode.encode = require('./encode.js')\nbencode.decode = require('./decode.js')\n\n/**\n * Determines the amount of bytes\n * needed to encode the given value\n * @param {Object|Array|Buffer|String|Number|Boolean} value\n * @return {Number} byteCount\n */\nbencode.byteLength = bencode.encodingLength = require('./encoding-length.js')\n","const util = module.exports\n\nutil.digitCount = function digitCount (value) {\n // Add a digit for negative numbers, as the sign will be prefixed\n const sign = value < 0 ? 1 : 0\n // Guard against negative numbers & zero going into log10(),\n // as that would return -Infinity\n value = Math.abs(Number(value || 1))\n return Math.floor(Math.log10(value)) + 1 + sign\n}\n\nutil.getType = function getType (value) {\n if (Buffer.isBuffer(value)) return 'buffer'\n if (ArrayBuffer.isView(value)) return 'arraybufferview'\n if (Array.isArray(value)) return 'array'\n if (value instanceof Number) return 'number'\n if (value instanceof Boolean) return 'boolean'\n if (value instanceof Set) return 'set'\n if (value instanceof Map) return 'map'\n if (value instanceof String) return 'string'\n if (value instanceof ArrayBuffer) return 'arraybuffer'\n return typeof value\n}\n","module.exports = parseRange\nmodule.exports.parse = parseRange\nmodule.exports.compose = composeRange\n\nfunction composeRange (range) {\n return range\n .reduce((acc, cur, idx, arr) => {\n if (idx === 0 || cur !== arr[idx - 1] + 1) acc.push([])\n acc[acc.length - 1].push(cur)\n return acc\n }, [])\n .map((cur) => {\n return cur.length > 1 ? `${cur[0]}-${cur[cur.length - 1]}` : `${cur[0]}`\n })\n}\n\nfunction parseRange (range) {\n const generateRange = (start, end = start) => Array.from({ length: end - start + 1 }, (cur, idx) => idx + start)\n\n return range\n .reduce((acc, cur, idx, arr) => {\n const r = cur.split('-').map(cur => parseInt(cur))\n return acc.concat(generateRange(...r))\n }, [])\n}\n","module.exports = function(haystack, needle, comparator, low, high) {\n var mid, cmp;\n\n if(low === undefined)\n low = 0;\n\n else {\n low = low|0;\n if(low < 0 || low >= haystack.length)\n throw new RangeError(\"invalid lower bound\");\n }\n\n if(high === undefined)\n high = haystack.length - 1;\n\n else {\n high = high|0;\n if(high < low || high >= haystack.length)\n throw new RangeError(\"invalid upper bound\");\n }\n\n while(low <= high) {\n // The naive `low + high >>> 1` could fail for array lengths > 2**31\n // because `>>>` converts its operands to int32. `low + (high - low >>> 1)`\n // works for array lengths <= 2**32-1 which is also Javascript's max array\n // length.\n mid = low + ((high - low) >>> 1);\n cmp = +comparator(haystack[mid], needle, mid, haystack);\n\n // Too low.\n if(cmp < 0.0)\n low = mid + 1;\n\n // Too high.\n else if(cmp > 0.0)\n high = mid - 1;\n\n // Key found.\n else\n return mid;\n }\n\n // Key not found.\n return ~low;\n}\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nfunction getByteSize(num) {\n var out = num >> 3;\n if (num % 8 !== 0)\n out++;\n return out;\n}\nvar BitField = /** @class */ (function () {\n /**\n *\n *\n * @param data Either a number representing the maximum number of supported bytes, or a Uint8Array.\n * @param opts Options for the bitfield.\n */\n function BitField(data, opts) {\n if (data === void 0) { data = 0; }\n var grow = opts === null || opts === void 0 ? void 0 : opts.grow;\n this.grow = (grow && isFinite(grow) && getByteSize(grow)) || grow || 0;\n this.buffer =\n typeof data === \"number\" ? new Uint8Array(getByteSize(data)) : data;\n }\n /**\n * Get a particular bit.\n *\n * @param i Bit index to retrieve.\n * @returns A boolean indicating whether the `i`th bit is set.\n */\n BitField.prototype.get = function (i) {\n var j = i >> 3;\n return j < this.buffer.length && !!(this.buffer[j] & (128 >> i % 8));\n };\n /**\n * Set a particular bit.\n *\n * Will grow the underlying array if the bit is out of bounds and the `grow` option is set.\n *\n * @param i Bit index to set.\n * @param value Value to set the bit to. Defaults to `true`.\n */\n BitField.prototype.set = function (i, value) {\n if (value === void 0) { value = true; }\n var j = i >> 3;\n if (value) {\n if (this.buffer.length < j + 1) {\n var length_1 = Math.max(j + 1, Math.min(2 * this.buffer.length, this.grow));\n if (length_1 <= this.grow) {\n var newBuffer = new Uint8Array(length_1);\n newBuffer.set(this.buffer);\n this.buffer = newBuffer;\n }\n }\n // Set\n this.buffer[j] |= 128 >> i % 8;\n }\n else if (j < this.buffer.length) {\n // Clear\n this.buffer[j] &= ~(128 >> i % 8);\n }\n };\n /**\n * Loop through the bits in the bitfield.\n *\n * @param fn Function to be called with the bit value and index.\n * @param start Index of the first bit to look at.\n * @param end Index of the first bit that should no longer be considered.\n */\n BitField.prototype.forEach = function (fn, start, end) {\n if (start === void 0) { start = 0; }\n if (end === void 0) { end = this.buffer.length * 8; }\n for (var i = start, j = i >> 3, y = 128 >> i % 8, byte = this.buffer[j]; i < end; i++) {\n fn(!!(byte & y), i);\n y = y === 1 ? ((byte = this.buffer[++j]), 128) : y >> 1;\n }\n };\n return BitField;\n}());\nexports.default = BitField;\n","/*! bittorrent-protocol. MIT License. WebTorrent LLC */\nconst arrayRemove = require('unordered-array-remove')\nconst bencode = require('bencode')\nconst BitField = require('bitfield').default\nconst crypto = require('crypto')\nconst debug = require('debug')('bittorrent-protocol')\nconst randombytes = require('randombytes')\nconst sha1 = require('simple-sha1')\nconst speedometer = require('speedometer')\nconst stream = require('readable-stream')\nconst RC4 = require('rc4')\n\nconst BITFIELD_GROW = 400000\nconst KEEP_ALIVE_TIMEOUT = 55000\nconst ALLOWED_FAST_SET_MAX_LENGTH = 100\n\nconst MESSAGE_PROTOCOL = Buffer.from('\\u0013BitTorrent protocol')\nconst MESSAGE_KEEP_ALIVE = Buffer.from([0x00, 0x00, 0x00, 0x00])\nconst MESSAGE_CHOKE = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x00])\nconst MESSAGE_UNCHOKE = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x01])\nconst MESSAGE_INTERESTED = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x02])\nconst MESSAGE_UNINTERESTED = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x03])\n\nconst MESSAGE_RESERVED = [0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00]\nconst MESSAGE_PORT = [0x00, 0x00, 0x00, 0x03, 0x09, 0x00, 0x00]\n\n// BEP6 Fast Extension\nconst MESSAGE_HAVE_ALL = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x0E])\nconst MESSAGE_HAVE_NONE = Buffer.from([0x00, 0x00, 0x00, 0x01, 0x0F])\n\nconst DH_PRIME = 'ffffffffffffffffc90fdaa22168c234c4c6628b80dc1cd129024e088a67cc74020bbea63b139b22514a08798e3404ddef9519b3cd3a431b302b0a6df25f14374fe1356d6d51c245e485b576625e7ec6f44c42e9a63a36210000000000090563'\nconst DH_GENERATOR = 2\nconst VC = Buffer.from([0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00])\nconst CRYPTO_PROVIDE = Buffer.from([0x00, 0x00, 0x01, 0x02])\nconst CRYPTO_SELECT = Buffer.from([0x00, 0x00, 0x00, 0x02]) // always try to choose RC4 encryption instead of plaintext\n\nfunction xor (a, b) {\n for (let len = a.length; len--;) a[len] ^= b[len]\n return a\n}\n\nclass Request {\n constructor (piece, offset, length, callback) {\n this.piece = piece\n this.offset = offset\n this.length = length\n this.callback = callback\n }\n}\n\nclass HaveAllBitField {\n constructor () {\n this.buffer = new Uint8Array() // dummy\n }\n\n get (index) {\n return true\n }\n\n set (index) {}\n}\n\nclass Wire extends stream.Duplex {\n constructor (type = null, retries = 0, peEnabled = false) {\n super()\n\n this._debugId = randombytes(4).toString('hex')\n this._debug('new wire')\n\n this.peerId = null // remote peer id (hex string)\n this.peerIdBuffer = null // remote peer id (buffer)\n this.type = type // connection type ('webrtc', 'tcpIncoming', 'tcpOutgoing', 'webSeed')\n\n this.amChoking = true // are we choking the peer?\n this.amInterested = false // are we interested in the peer?\n\n this.peerChoking = true // is the peer choking us?\n this.peerInterested = false // is the peer interested in us?\n\n // The largest torrent that I know of (the Geocities archive) is ~641 GB and has\n // ~41,000 pieces. Therefore, cap bitfield to 10x larger (400,000 bits) to support all\n // possible torrents but prevent malicious peers from growing bitfield to fill memory.\n this.peerPieces = new BitField(0, { grow: BITFIELD_GROW })\n\n this.extensions = {}\n this.peerExtensions = {}\n\n this.requests = [] // outgoing\n this.peerRequests = [] // incoming\n\n this.extendedMapping = {} // number -> string, ex: 1 -> 'ut_metadata'\n this.peerExtendedMapping = {} // string -> number, ex: 9 -> 'ut_metadata'\n\n // The extended handshake to send, minus the \"m\" field, which gets automatically\n // filled from `this.extendedMapping`\n this.extendedHandshake = {}\n\n this.peerExtendedHandshake = {} // remote peer's extended handshake\n\n // BEP6 Fast Estension\n this.hasFast = false // is fast extension enabled?\n this.allowedFastSet = [] // allowed fast set\n this.peerAllowedFastSet = [] // peer's allowed fast set\n\n this._ext = {} // string -> function, ex 'ut_metadata' -> ut_metadata()\n this._nextExt = 1\n\n this.uploaded = 0\n this.downloaded = 0\n this.uploadSpeed = speedometer()\n this.downloadSpeed = speedometer()\n\n this._keepAliveInterval = null\n this._timeout = null\n this._timeoutMs = 0\n this._timeoutExpiresAt = null\n\n this.destroyed = false // was the wire ended by calling `destroy`?\n this._finished = false\n\n this._parserSize = 0 // number of needed bytes to parse next message from remote peer\n this._parser = null // function to call once `this._parserSize` bytes are available\n\n this._buffer = [] // incomplete message data\n this._bufferSize = 0 // cached total length of buffers in `this._buffer`\n\n this._peEnabled = peEnabled\n if (peEnabled) {\n this._dh = crypto.createDiffieHellman(DH_PRIME, 'hex', DH_GENERATOR) // crypto object used to generate keys/secret\n this._myPubKey = this._dh.generateKeys('hex') // my DH public key\n } else {\n this._myPubKey = null\n }\n this._peerPubKey = null // peer's DH public key\n this._sharedSecret = null // shared DH secret\n this._peerCryptoProvide = [] // encryption methods provided by peer; we expect this to always contain 0x02\n this._cryptoHandshakeDone = false\n\n this._cryptoSyncPattern = null // the pattern to search for when resynchronizing after receiving pe1/pe2\n this._waitMaxBytes = null // the maximum number of bytes resynchronization must occur within\n this._encryptionMethod = null // 1 for plaintext, 2 for RC4\n this._encryptGenerator = null // RC4 keystream generator for encryption\n this._decryptGenerator = null // RC4 keystream generator for decryption\n this._setGenerators = false // a flag for whether setEncrypt() has successfully completed\n\n this.once('finish', () => this._onFinish())\n\n this.on('finish', this._onFinish)\n this._debug('type:', this.type)\n\n if (this.type === 'tcpIncoming' && this._peEnabled) {\n // If we are not the initiator, we should wait to see if the client begins\n // with PE/MSE handshake or the standard bittorrent handshake.\n this._determineHandshakeType()\n } else if (this.type === 'tcpOutgoing' && this._peEnabled && retries === 0) {\n this._parsePe2()\n } else {\n this._parseHandshake(null)\n }\n }\n\n /**\n * Set whether to send a \"keep-alive\" ping (sent every 55s)\n * @param {boolean} enable\n */\n setKeepAlive (enable) {\n this._debug('setKeepAlive %s', enable)\n clearInterval(this._keepAliveInterval)\n if (enable === false) return\n this._keepAliveInterval = setInterval(() => {\n this.keepAlive()\n }, KEEP_ALIVE_TIMEOUT)\n }\n\n /**\n * Set the amount of time to wait before considering a request to be \"timed out\"\n * @param {number} ms\n * @param {boolean=} unref (should the timer be unref'd? default: false)\n */\n setTimeout (ms, unref) {\n this._debug('setTimeout ms=%d unref=%s', ms, unref)\n this._timeoutMs = ms\n this._timeoutUnref = !!unref\n this._resetTimeout(true)\n }\n\n destroy () {\n if (this.destroyed) return\n this.destroyed = true\n this._debug('destroy')\n this.emit('close')\n this.end()\n return this\n }\n\n end (...args) {\n this._debug('end')\n this._onUninterested()\n this._onChoke()\n return super.end(...args)\n }\n\n /**\n * Use the specified protocol extension.\n * @param {function} Extension\n */\n use (Extension) {\n const name = Extension.prototype.name\n if (!name) {\n throw new Error('Extension class requires a \"name\" property on the prototype')\n }\n this._debug('use extension.name=%s', name)\n\n const ext = this._nextExt\n const handler = new Extension(this)\n\n function noop () {}\n\n if (typeof handler.onHandshake !== 'function') {\n handler.onHandshake = noop\n }\n if (typeof handler.onExtendedHandshake !== 'function') {\n handler.onExtendedHandshake = noop\n }\n if (typeof handler.onMessage !== 'function') {\n handler.onMessage = noop\n }\n\n this.extendedMapping[ext] = name\n this._ext[name] = handler\n this[name] = handler\n\n this._nextExt += 1\n }\n\n //\n // OUTGOING MESSAGES\n //\n\n /**\n * Message \"keep-alive\": \n */\n keepAlive () {\n this._debug('keep-alive')\n this._push(MESSAGE_KEEP_ALIVE)\n }\n\n sendPe1 () {\n if (this._peEnabled) {\n const padALen = Math.floor(Math.random() * 513)\n const padA = randombytes(padALen)\n this._push(Buffer.concat([Buffer.from(this._myPubKey, 'hex'), padA]))\n }\n }\n\n sendPe2 () {\n const padBLen = Math.floor(Math.random() * 513)\n const padB = randombytes(padBLen)\n this._push(Buffer.concat([Buffer.from(this._myPubKey, 'hex'), padB]))\n }\n\n sendPe3 (infoHash) {\n this.setEncrypt(this._sharedSecret, infoHash)\n\n const hash1Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req1') + this._sharedSecret, 'hex')), 'hex')\n\n const hash2Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req2') + infoHash, 'hex')), 'hex')\n const hash3Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req3') + this._sharedSecret, 'hex')), 'hex')\n const hashesXorBuffer = xor(hash2Buffer, hash3Buffer)\n\n const padCLen = randombytes(2).readUInt16BE(0) % 512\n const padCBuffer = randombytes(padCLen)\n\n let vcAndProvideBuffer = Buffer.alloc(8 + 4 + 2 + padCLen + 2)\n VC.copy(vcAndProvideBuffer)\n CRYPTO_PROVIDE.copy(vcAndProvideBuffer, 8)\n\n vcAndProvideBuffer.writeInt16BE(padCLen, 12) // pad C length\n padCBuffer.copy(vcAndProvideBuffer, 14)\n vcAndProvideBuffer.writeInt16BE(0, 14 + padCLen) // IA length\n vcAndProvideBuffer = this._encryptHandshake(vcAndProvideBuffer)\n\n this._push(Buffer.concat([hash1Buffer, hashesXorBuffer, vcAndProvideBuffer]))\n }\n\n sendPe4 (infoHash) {\n this.setEncrypt(this._sharedSecret, infoHash)\n\n const padDLen = randombytes(2).readUInt16BE(0) % 512\n const padDBuffer = randombytes(padDLen)\n let vcAndSelectBuffer = Buffer.alloc(8 + 4 + 2 + padDLen)\n VC.copy(vcAndSelectBuffer)\n CRYPTO_SELECT.copy(vcAndSelectBuffer, 8)\n vcAndSelectBuffer.writeInt16BE(padDLen, 12) // lenD?\n padDBuffer.copy(vcAndSelectBuffer, 14)\n vcAndSelectBuffer = this._encryptHandshake(vcAndSelectBuffer)\n this._push(vcAndSelectBuffer)\n this._cryptoHandshakeDone = true\n this._debug('completed crypto handshake')\n }\n\n /**\n * Message: \"handshake\" \n * @param {Buffer|string} infoHash (as Buffer or *hex* string)\n * @param {Buffer|string} peerId\n * @param {Object} extensions\n */\n handshake (infoHash, peerId, extensions) {\n let infoHashBuffer\n let peerIdBuffer\n if (typeof infoHash === 'string') {\n infoHash = infoHash.toLowerCase()\n infoHashBuffer = Buffer.from(infoHash, 'hex')\n } else {\n infoHashBuffer = infoHash\n infoHash = infoHashBuffer.toString('hex')\n }\n if (typeof peerId === 'string') {\n peerIdBuffer = Buffer.from(peerId, 'hex')\n } else {\n peerIdBuffer = peerId\n peerId = peerIdBuffer.toString('hex')\n }\n\n this._infoHash = infoHashBuffer\n\n if (infoHashBuffer.length !== 20 || peerIdBuffer.length !== 20) {\n throw new Error('infoHash and peerId MUST have length 20')\n }\n\n this._debug('handshake i=%s p=%s exts=%o', infoHash, peerId, extensions)\n\n const reserved = Buffer.from(MESSAGE_RESERVED)\n\n this.extensions = {\n extended: true,\n dht: !!(extensions && extensions.dht),\n fast: !!(extensions && extensions.fast)\n }\n\n reserved[5] |= 0x10 // enable extended message\n if (this.extensions.dht) reserved[7] |= 0x01\n if (this.extensions.fast) reserved[7] |= 0x04\n\n // BEP6 Fast Extension: The extension is enabled only if both ends of the connection set this bit.\n if (this.extensions.fast && this.peerExtensions.fast) {\n this._debug('fast extension is enabled')\n this.hasFast = true\n }\n\n this._push(Buffer.concat([MESSAGE_PROTOCOL, reserved, infoHashBuffer, peerIdBuffer]))\n this._handshakeSent = true\n\n if (this.peerExtensions.extended && !this._extendedHandshakeSent) {\n // Peer's handshake indicated support already\n // (incoming connection)\n this._sendExtendedHandshake()\n }\n }\n\n /* Peer supports BEP-0010, send extended handshake.\n *\n * This comes after the 'handshake' event to give the user a chance to populate\n * `this.extendedHandshake` and `this.extendedMapping` before the extended handshake\n * is sent to the remote peer.\n */\n _sendExtendedHandshake () {\n // Create extended message object from registered extensions\n const msg = Object.assign({}, this.extendedHandshake)\n msg.m = {}\n for (const ext in this.extendedMapping) {\n const name = this.extendedMapping[ext]\n msg.m[name] = Number(ext)\n }\n\n // Send extended handshake\n this.extended(0, bencode.encode(msg))\n this._extendedHandshakeSent = true\n }\n\n /**\n * Message \"choke\": \n */\n choke () {\n if (this.amChoking) return\n this.amChoking = true\n this._debug('choke')\n this._push(MESSAGE_CHOKE)\n\n if (this.hasFast) {\n // BEP6: If a peer sends a choke, it MUST reject all requests from the peer to whom the choke\n // was sent except it SHOULD NOT reject requests for pieces that are in the allowed fast set.\n while (this.peerRequests.length) {\n const request = this.peerRequests[0]\n if (!this.allowedFastSet.includes(request.piece)) {\n this.reject(request.piece, request.offset, request.length)\n }\n }\n } else {\n while (this.peerRequests.length) {\n this.peerRequests.pop()\n }\n }\n }\n\n /**\n * Message \"unchoke\": \n */\n unchoke () {\n if (!this.amChoking) return\n this.amChoking = false\n this._debug('unchoke')\n this._push(MESSAGE_UNCHOKE)\n }\n\n /**\n * Message \"interested\": \n */\n interested () {\n if (this.amInterested) return\n this.amInterested = true\n this._debug('interested')\n this._push(MESSAGE_INTERESTED)\n }\n\n /**\n * Message \"uninterested\": \n */\n uninterested () {\n if (!this.amInterested) return\n this.amInterested = false\n this._debug('uninterested')\n this._push(MESSAGE_UNINTERESTED)\n }\n\n /**\n * Message \"have\": \n * @param {number} index\n */\n have (index) {\n this._debug('have %d', index)\n this._message(4, [index], null)\n }\n\n /**\n * Message \"bitfield\": \n * @param {BitField|Buffer} bitfield\n */\n bitfield (bitfield) {\n this._debug('bitfield')\n if (!Buffer.isBuffer(bitfield)) bitfield = bitfield.buffer\n this._message(5, [], bitfield)\n }\n\n /**\n * Message \"request\": \n * @param {number} index\n * @param {number} offset\n * @param {number} length\n * @param {function} cb\n */\n request (index, offset, length, cb) {\n if (!cb) cb = () => {}\n if (this._finished) return cb(new Error('wire is closed'))\n\n if (this.peerChoking && !(this.hasFast && this.peerAllowedFastSet.includes(index))) {\n return cb(new Error('peer is choking'))\n }\n\n this._debug('request index=%d offset=%d length=%d', index, offset, length)\n\n this.requests.push(new Request(index, offset, length, cb))\n if (!this._timeout) {\n this._resetTimeout(true)\n }\n this._message(6, [index, offset, length], null)\n }\n\n /**\n * Message \"piece\": \n * @param {number} index\n * @param {number} offset\n * @param {Buffer} buffer\n */\n piece (index, offset, buffer) {\n this._debug('piece index=%d offset=%d', index, offset)\n this._message(7, [index, offset], buffer)\n this.uploaded += buffer.length\n this.uploadSpeed(buffer.length)\n this.emit('upload', buffer.length)\n }\n\n /**\n * Message \"cancel\": \n * @param {number} index\n * @param {number} offset\n * @param {number} length\n */\n cancel (index, offset, length) {\n this._debug('cancel index=%d offset=%d length=%d', index, offset, length)\n this._callback(\n this._pull(this.requests, index, offset, length),\n new Error('request was cancelled'),\n null\n )\n this._message(8, [index, offset, length], null)\n }\n\n /**\n * Message: \"port\" \n * @param {Number} port\n */\n port (port) {\n this._debug('port %d', port)\n const message = Buffer.from(MESSAGE_PORT)\n message.writeUInt16BE(port, 5)\n this._push(message)\n }\n\n /**\n * Message: \"suggest\" (BEP6)\n * @param {number} index\n */\n suggest (index) {\n if (!this.hasFast) throw Error('fast extension is disabled')\n this._debug('suggest %d', index)\n this._message(0x0D, [index], null)\n }\n\n /**\n * Message: \"have-all\" (BEP6)\n */\n haveAll () {\n if (!this.hasFast) throw Error('fast extension is disabled')\n this._debug('have-all')\n this._push(MESSAGE_HAVE_ALL)\n }\n\n /**\n * Message: \"have-none\" (BEP6)\n */\n haveNone () {\n if (!this.hasFast) throw Error('fast extension is disabled')\n this._debug('have-none')\n this._push(MESSAGE_HAVE_NONE)\n }\n\n /**\n * Message \"reject\": (BEP6)\n * @param {number} index\n * @param {number} offset\n * @param {number} length\n */\n reject (index, offset, length) {\n if (!this.hasFast) throw Error('fast extension is disabled')\n this._debug('reject index=%d offset=%d length=%d', index, offset, length)\n this._pull(this.peerRequests, index, offset, length)\n this._message(0x10, [index, offset, length], null)\n }\n\n /**\n * Message: \"allowed-fast\" (BEP6)\n * @param {number} index\n */\n allowedFast (index) {\n if (!this.hasFast) throw Error('fast extension is disabled')\n this._debug('allowed-fast %d', index)\n if (!this.allowedFastSet.includes(index)) this.allowedFastSet.push(index)\n this._message(0x11, [index], null)\n }\n\n /**\n * Message: \"extended\" \n * @param {number|string} ext\n * @param {Object} obj\n */\n extended (ext, obj) {\n this._debug('extended ext=%s', ext)\n if (typeof ext === 'string' && this.peerExtendedMapping[ext]) {\n ext = this.peerExtendedMapping[ext]\n }\n if (typeof ext === 'number') {\n const extId = Buffer.from([ext])\n const buf = Buffer.isBuffer(obj) ? obj : bencode.encode(obj)\n\n this._message(20, [], Buffer.concat([extId, buf]))\n } else {\n throw new Error(`Unrecognized extension: ${ext}`)\n }\n }\n\n /**\n * Sets the encryption method for this wire, as per PSE/ME specification\n *\n * @param {string} sharedSecret: A hex-encoded string, which is the shared secret agreed\n * upon from DH key exchange\n * @param {string} infoHash: A hex-encoded info hash\n * @returns boolean, true if encryption setting succeeds, false if it fails.\n */\n setEncrypt (sharedSecret, infoHash) {\n let encryptKey\n let decryptKey\n let encryptKeyBuf\n let encryptKeyIntArray\n let decryptKeyBuf\n let decryptKeyIntArray\n switch (this.type) {\n case 'tcpIncoming':\n encryptKey = sha1.sync(Buffer.from(this._utfToHex('keyB') + sharedSecret + infoHash, 'hex'))\n decryptKey = sha1.sync(Buffer.from(this._utfToHex('keyA') + sharedSecret + infoHash, 'hex'))\n encryptKeyBuf = Buffer.from(encryptKey, 'hex')\n encryptKeyIntArray = []\n for (const value of encryptKeyBuf.values()) {\n encryptKeyIntArray.push(value)\n }\n decryptKeyBuf = Buffer.from(decryptKey, 'hex')\n decryptKeyIntArray = []\n for (const value of decryptKeyBuf.values()) {\n decryptKeyIntArray.push(value)\n }\n this._encryptGenerator = new RC4(encryptKeyIntArray)\n this._decryptGenerator = new RC4(decryptKeyIntArray)\n break\n case 'tcpOutgoing':\n encryptKey = sha1.sync(Buffer.from(this._utfToHex('keyA') + sharedSecret + infoHash, 'hex'))\n decryptKey = sha1.sync(Buffer.from(this._utfToHex('keyB') + sharedSecret + infoHash, 'hex'))\n encryptKeyBuf = Buffer.from(encryptKey, 'hex')\n encryptKeyIntArray = []\n for (const value of encryptKeyBuf.values()) {\n encryptKeyIntArray.push(value)\n }\n decryptKeyBuf = Buffer.from(decryptKey, 'hex')\n decryptKeyIntArray = []\n for (const value of decryptKeyBuf.values()) {\n decryptKeyIntArray.push(value)\n }\n this._encryptGenerator = new RC4(encryptKeyIntArray)\n this._decryptGenerator = new RC4(decryptKeyIntArray)\n break\n default:\n return false\n }\n\n // Discard the first 1024 bytes, as per MSE/PE implementation\n for (let i = 0; i < 1024; i++) {\n this._encryptGenerator.randomByte()\n this._decryptGenerator.randomByte()\n }\n\n this._setGenerators = true\n return true\n }\n\n /**\n * Duplex stream method. Called whenever the remote peer stream wants data. No-op\n * since we'll just push data whenever we get it.\n */\n _read () {}\n\n /**\n * Send a message to the remote peer.\n */\n _message (id, numbers, data) {\n const dataLength = data ? data.length : 0\n const buffer = Buffer.allocUnsafe(5 + (4 * numbers.length))\n\n buffer.writeUInt32BE(buffer.length + dataLength - 4, 0)\n buffer[4] = id\n for (let i = 0; i < numbers.length; i++) {\n buffer.writeUInt32BE(numbers[i], 5 + (4 * i))\n }\n\n this._push(buffer)\n if (data) this._push(data)\n }\n\n _push (data) {\n if (this._finished) return\n if (this._encryptionMethod === 2 && this._cryptoHandshakeDone) {\n data = this._encrypt(data)\n }\n return this.push(data)\n }\n\n //\n // INCOMING MESSAGES\n //\n\n _onKeepAlive () {\n this._debug('got keep-alive')\n this.emit('keep-alive')\n }\n\n _onPe1 (pubKeyBuffer) {\n this._peerPubKey = pubKeyBuffer.toString('hex')\n this._sharedSecret = this._dh.computeSecret(this._peerPubKey, 'hex', 'hex')\n this.emit('pe1')\n }\n\n _onPe2 (pubKeyBuffer) {\n this._peerPubKey = pubKeyBuffer.toString('hex')\n this._sharedSecret = this._dh.computeSecret(this._peerPubKey, 'hex', 'hex')\n this.emit('pe2')\n }\n\n _onPe3 (hashesXorBuffer) {\n const hash3 = sha1.sync(Buffer.from(this._utfToHex('req3') + this._sharedSecret, 'hex'))\n const sKeyHash = xor(Buffer.from(hash3, 'hex'), hashesXorBuffer).toString('hex')\n this.emit('pe3', sKeyHash)\n }\n\n _onPe3Encrypted (vcBuffer, peerProvideBuffer) {\n if (!vcBuffer.equals(VC)) {\n this._debug('Error: verification constant did not match')\n this.destroy()\n return\n }\n\n for (const provideByte of peerProvideBuffer.values()) {\n if (provideByte !== 0) {\n this._peerCryptoProvide.push(provideByte)\n }\n }\n if (this._peerCryptoProvide.includes(2)) {\n this._encryptionMethod = 2\n } else {\n this._debug('Error: RC4 encryption method not provided by peer')\n this.destroy()\n }\n }\n\n _onPe4 (peerSelectBuffer) {\n this._encryptionMethod = peerSelectBuffer.readUInt8(3)\n if (!CRYPTO_PROVIDE.includes(this._encryptionMethod)) {\n this._debug('Error: peer selected invalid crypto method')\n this.destroy()\n }\n this._cryptoHandshakeDone = true\n this._debug('crypto handshake done')\n this.emit('pe4')\n }\n\n _onHandshake (infoHashBuffer, peerIdBuffer, extensions) {\n const infoHash = infoHashBuffer.toString('hex')\n const peerId = peerIdBuffer.toString('hex')\n\n this._debug('got handshake i=%s p=%s exts=%o', infoHash, peerId, extensions)\n\n this.peerId = peerId\n this.peerIdBuffer = peerIdBuffer\n this.peerExtensions = extensions\n\n // BEP6 Fast Extension: The extension is enabled only if both ends of the connection set this bit.\n if (this.extensions.fast && this.peerExtensions.fast) {\n this._debug('fast extension is enabled')\n this.hasFast = true\n }\n\n this.emit('handshake', infoHash, peerId, extensions)\n\n for (const name in this._ext) {\n this._ext[name].onHandshake(infoHash, peerId, extensions)\n }\n\n if (extensions.extended && this._handshakeSent &&\n !this._extendedHandshakeSent) {\n // outgoing connection\n this._sendExtendedHandshake()\n }\n }\n\n _onChoke () {\n this.peerChoking = true\n this._debug('got choke')\n this.emit('choke')\n if (!this.hasFast) {\n // BEP6 Fast Extension: Choke no longer implicitly rejects all pending requests\n while (this.requests.length) {\n this._callback(this.requests.pop(), new Error('peer is choking'), null)\n }\n }\n }\n\n _onUnchoke () {\n this.peerChoking = false\n this._debug('got unchoke')\n this.emit('unchoke')\n }\n\n _onInterested () {\n this.peerInterested = true\n this._debug('got interested')\n this.emit('interested')\n }\n\n _onUninterested () {\n this.peerInterested = false\n this._debug('got uninterested')\n this.emit('uninterested')\n }\n\n _onHave (index) {\n if (this.peerPieces.get(index)) return\n this._debug('got have %d', index)\n\n this.peerPieces.set(index, true)\n this.emit('have', index)\n }\n\n _onBitField (buffer) {\n this.peerPieces = new BitField(buffer)\n this._debug('got bitfield')\n this.emit('bitfield', this.peerPieces)\n }\n\n _onRequest (index, offset, length) {\n if (this.amChoking && !(this.hasFast && this.allowedFastSet.includes(index))) {\n // BEP6: If a peer receives a request from a peer its choking, the peer receiving\n // the request SHOULD send a reject unless the piece is in the allowed fast set.\n if (this.hasFast) this.reject(index, offset, length)\n return\n }\n this._debug('got request index=%d offset=%d length=%d', index, offset, length)\n\n const respond = (err, buffer) => {\n if (request !== this._pull(this.peerRequests, index, offset, length)) return\n if (err) {\n this._debug('error satisfying request index=%d offset=%d length=%d (%s)', index, offset, length, err.message)\n if (this.hasFast) this.reject(index, offset, length)\n return\n }\n this.piece(index, offset, buffer)\n }\n\n const request = new Request(index, offset, length, respond)\n this.peerRequests.push(request)\n this.emit('request', index, offset, length, respond)\n }\n\n _onPiece (index, offset, buffer) {\n this._debug('got piece index=%d offset=%d', index, offset)\n this._callback(this._pull(this.requests, index, offset, buffer.length), null, buffer)\n this.downloaded += buffer.length\n this.downloadSpeed(buffer.length)\n this.emit('download', buffer.length)\n this.emit('piece', index, offset, buffer)\n }\n\n _onCancel (index, offset, length) {\n this._debug('got cancel index=%d offset=%d length=%d', index, offset, length)\n this._pull(this.peerRequests, index, offset, length)\n this.emit('cancel', index, offset, length)\n }\n\n _onPort (port) {\n this._debug('got port %d', port)\n this.emit('port', port)\n }\n\n _onSuggest (index) {\n if (!this.hasFast) {\n // BEP6: the peer MUST close the connection\n this._debug('Error: got suggest whereas fast extension is disabled')\n this.destroy()\n return\n }\n this._debug('got suggest %d', index)\n this.emit('suggest', index)\n }\n\n _onHaveAll () {\n if (!this.hasFast) {\n // BEP6: the peer MUST close the connection\n this._debug('Error: got have-all whereas fast extension is disabled')\n this.destroy()\n return\n }\n this._debug('got have-all')\n this.peerPieces = new HaveAllBitField()\n this.emit('have-all')\n }\n\n _onHaveNone () {\n if (!this.hasFast) {\n // BEP6: the peer MUST close the connection\n this._debug('Error: got have-none whereas fast extension is disabled')\n this.destroy()\n return\n }\n this._debug('got have-none')\n this.emit('have-none')\n }\n\n _onReject (index, offset, length) {\n if (!this.hasFast) {\n // BEP6: the peer MUST close the connection\n this._debug('Error: got reject whereas fast extension is disabled')\n this.destroy()\n return\n }\n this._debug('got reject index=%d offset=%d length=%d', index, offset, length)\n this._callback(\n this._pull(this.requests, index, offset, length),\n new Error('request was rejected'),\n null\n )\n this.emit('reject', index, offset, length)\n }\n\n _onAllowedFast (index) {\n if (!this.hasFast) {\n // BEP6: the peer MUST close the connection\n this._debug('Error: got allowed-fast whereas fast extension is disabled')\n this.destroy()\n return\n }\n this._debug('got allowed-fast %d', index)\n if (!this.peerAllowedFastSet.includes(index)) this.peerAllowedFastSet.push(index)\n if (this.peerAllowedFastSet.length > ALLOWED_FAST_SET_MAX_LENGTH) this.peerAllowedFastSet.shift()\n this.emit('allowed-fast', index)\n }\n\n _onExtended (ext, buf) {\n if (ext === 0) {\n let info\n try {\n info = bencode.decode(buf)\n } catch (err) {\n this._debug('ignoring invalid extended handshake: %s', err.message || err)\n }\n\n if (!info) return\n this.peerExtendedHandshake = info\n\n if (typeof info.m === 'object') {\n for (const name in info.m) {\n this.peerExtendedMapping[name] = Number(info.m[name].toString())\n }\n }\n for (const name in this._ext) {\n if (this.peerExtendedMapping[name]) {\n this._ext[name].onExtendedHandshake(this.peerExtendedHandshake)\n }\n }\n this._debug('got extended handshake')\n this.emit('extended', 'handshake', this.peerExtendedHandshake)\n } else {\n if (this.extendedMapping[ext]) {\n ext = this.extendedMapping[ext] // friendly name for extension\n if (this._ext[ext]) {\n // there is an registered extension handler, so call it\n this._ext[ext].onMessage(buf)\n }\n }\n this._debug('got extended message ext=%s', ext)\n this.emit('extended', ext, buf)\n }\n }\n\n _onTimeout () {\n this._debug('request timed out')\n this._callback(this.requests.shift(), new Error('request has timed out'), null)\n this.emit('timeout')\n }\n\n /**\n * Duplex stream method. Called whenever the remote peer has data for us. Data that the\n * remote peer sends gets buffered (i.e. not actually processed) until the right number\n * of bytes have arrived, determined by the last call to `this._parse(number, callback)`.\n * Once enough bytes have arrived to process the message, the callback function\n * (i.e. `this._parser`) gets called with the full buffer of data.\n * @param {Buffer} data\n * @param {string} encoding\n * @param {function} cb\n */\n _write (data, encoding, cb) {\n if (this._encryptionMethod === 2 && this._cryptoHandshakeDone) {\n data = this._decrypt(data)\n }\n this._bufferSize += data.length\n this._buffer.push(data)\n if (this._buffer.length > 1) {\n this._buffer = [Buffer.concat(this._buffer, this._bufferSize)]\n }\n // now this._buffer is an array containing a single Buffer\n if (this._cryptoSyncPattern) {\n const index = this._buffer[0].indexOf(this._cryptoSyncPattern)\n if (index !== -1) {\n this._buffer[0] = this._buffer[0].slice(index + this._cryptoSyncPattern.length)\n this._bufferSize -= (index + this._cryptoSyncPattern.length)\n this._cryptoSyncPattern = null\n } else if (this._bufferSize + data.length > this._waitMaxBytes + this._cryptoSyncPattern.length) {\n this._debug('Error: could not resynchronize')\n this.destroy()\n return\n }\n }\n\n while (this._bufferSize >= this._parserSize && !this._cryptoSyncPattern) {\n if (this._parserSize === 0) {\n this._parser(Buffer.from([]))\n } else {\n const buffer = this._buffer[0]\n // console.log('buffer:', this._buffer)\n this._bufferSize -= this._parserSize\n this._buffer = this._bufferSize\n ? [buffer.slice(this._parserSize)]\n : []\n this._parser(buffer.slice(0, this._parserSize))\n }\n }\n\n cb(null) // Signal that we're ready for more data\n }\n\n _callback (request, err, buffer) {\n if (!request) return\n\n this._resetTimeout(!this.peerChoking && !this._finished)\n\n request.callback(err, buffer)\n }\n\n _resetTimeout (setAgain) {\n if (!setAgain || !this._timeoutMs || !this.requests.length) {\n clearTimeout(this._timeout)\n this._timeout = null\n this._timeoutExpiresAt = null\n return\n }\n\n const timeoutExpiresAt = Date.now() + this._timeoutMs\n\n if (this._timeout) {\n // If existing expiration is already within 5% of correct, it's close enough\n if (timeoutExpiresAt - this._timeoutExpiresAt < this._timeoutMs * 0.05) {\n return\n }\n clearTimeout(this._timeout)\n }\n\n this._timeoutExpiresAt = timeoutExpiresAt\n this._timeout = setTimeout(() => this._onTimeout(), this._timeoutMs)\n if (this._timeoutUnref && this._timeout.unref) this._timeout.unref()\n }\n\n /**\n * Takes a number of bytes that the local peer is waiting to receive from the remote peer\n * in order to parse a complete message, and a callback function to be called once enough\n * bytes have arrived.\n * @param {number} size\n * @param {function} parser\n */\n _parse (size, parser) {\n this._parserSize = size\n this._parser = parser\n }\n\n _parseUntil (pattern, maxBytes) {\n this._cryptoSyncPattern = pattern\n this._waitMaxBytes = maxBytes\n }\n\n /**\n * Handle the first 4 bytes of a message, to determine the length of bytes that must be\n * waited for in order to have the whole message.\n * @param {Buffer} buffer\n */\n _onMessageLength (buffer) {\n const length = buffer.readUInt32BE(0)\n if (length > 0) {\n this._parse(length, this._onMessage)\n } else {\n this._onKeepAlive()\n this._parse(4, this._onMessageLength)\n }\n }\n\n /**\n * Handle a message from the remote peer.\n * @param {Buffer} buffer\n */\n _onMessage (buffer) {\n this._parse(4, this._onMessageLength)\n switch (buffer[0]) {\n case 0:\n return this._onChoke()\n case 1:\n return this._onUnchoke()\n case 2:\n return this._onInterested()\n case 3:\n return this._onUninterested()\n case 4:\n return this._onHave(buffer.readUInt32BE(1))\n case 5:\n return this._onBitField(buffer.slice(1))\n case 6:\n return this._onRequest(\n buffer.readUInt32BE(1),\n buffer.readUInt32BE(5),\n buffer.readUInt32BE(9)\n )\n case 7:\n return this._onPiece(\n buffer.readUInt32BE(1),\n buffer.readUInt32BE(5),\n buffer.slice(9)\n )\n case 8:\n return this._onCancel(\n buffer.readUInt32BE(1),\n buffer.readUInt32BE(5),\n buffer.readUInt32BE(9)\n )\n case 9:\n return this._onPort(buffer.readUInt16BE(1))\n case 0x0D:\n return this._onSuggest(buffer.readUInt32BE(1))\n case 0x0E:\n return this._onHaveAll()\n case 0x0F:\n return this._onHaveNone()\n case 0x10:\n return this._onReject(\n buffer.readUInt32BE(1),\n buffer.readUInt32BE(5),\n buffer.readUInt32BE(9)\n )\n case 0x11:\n return this._onAllowedFast(buffer.readUInt32BE(1))\n case 20:\n return this._onExtended(buffer.readUInt8(1), buffer.slice(2))\n default:\n this._debug('got unknown message')\n return this.emit('unknownmessage', buffer)\n }\n }\n\n _determineHandshakeType () {\n this._parse(1, pstrLenBuffer => {\n const pstrlen = pstrLenBuffer.readUInt8(0)\n if (pstrlen === 19) {\n this._parse(pstrlen + 48, this._onHandshakeBuffer)\n } else {\n this._parsePe1(pstrLenBuffer)\n }\n })\n }\n\n _parsePe1 (pubKeyPrefix) {\n this._parse(95, pubKeySuffix => {\n this._onPe1(Buffer.concat([pubKeyPrefix, pubKeySuffix]))\n this._parsePe3()\n })\n }\n\n _parsePe2 () {\n this._parse(96, pubKey => {\n this._onPe2(pubKey)\n while (!this._setGenerators) {\n // Wait until generators have been set\n }\n this._parsePe4()\n })\n }\n\n // Handles the unencrypted portion of step 4\n _parsePe3 () {\n const hash1Buffer = Buffer.from(sha1.sync(Buffer.from(this._utfToHex('req1') + this._sharedSecret, 'hex')), 'hex')\n // synchronize on HASH('req1', S)\n this._parseUntil(hash1Buffer, 512)\n this._parse(20, buffer => {\n this._onPe3(buffer)\n while (!this._setGenerators) {\n // Wait until generators have been set\n }\n this._parsePe3Encrypted()\n })\n }\n\n _parsePe3Encrypted () {\n this._parse(14, buffer => {\n const vcBuffer = this._decryptHandshake(buffer.slice(0, 8))\n const peerProvideBuffer = this._decryptHandshake(buffer.slice(8, 12))\n const padCLen = this._decryptHandshake(buffer.slice(12, 14)).readUInt16BE(0)\n this._parse(padCLen, padCBuffer => {\n padCBuffer = this._decryptHandshake(padCBuffer)\n this._parse(2, iaLenBuf => {\n const iaLen = this._decryptHandshake(iaLenBuf).readUInt16BE(0)\n this._parse(iaLen, iaBuffer => {\n iaBuffer = this._decryptHandshake(iaBuffer)\n this._onPe3Encrypted(vcBuffer, peerProvideBuffer, padCBuffer, iaBuffer)\n const pstrlen = iaLen ? iaBuffer.readUInt8(0) : null\n const protocol = iaLen ? iaBuffer.slice(1, 20) : null\n if (pstrlen === 19 && protocol.toString() === 'BitTorrent protocol') {\n this._onHandshakeBuffer(iaBuffer.slice(1))\n } else {\n this._parseHandshake()\n }\n })\n })\n })\n })\n }\n\n _parsePe4 () {\n // synchronize on ENCRYPT(VC).\n // since we encrypt using bitwise xor, decryption and encryption are the same operation.\n // calling _decryptHandshake here advances the decrypt generator keystream forward 8 bytes\n const vcBufferEncrypted = this._decryptHandshake(VC)\n this._parseUntil(vcBufferEncrypted, 512)\n this._parse(6, buffer => {\n const peerSelectBuffer = this._decryptHandshake(buffer.slice(0, 4))\n const padDLen = this._decryptHandshake(buffer.slice(4, 6)).readUInt16BE(0)\n this._parse(padDLen, padDBuf => {\n this._decryptHandshake(padDBuf)\n this._onPe4(peerSelectBuffer)\n this._parseHandshake(null)\n })\n })\n }\n\n /**\n * Reads the handshake as specified by the bittorrent wire protocol.\n */\n _parseHandshake () {\n this._parse(1, buffer => {\n const pstrlen = buffer.readUInt8(0)\n if (pstrlen !== 19) {\n this._debug('Error: wire not speaking BitTorrent protocol (%s)', pstrlen.toString())\n this.end()\n return\n }\n this._parse(pstrlen + 48, this._onHandshakeBuffer)\n })\n }\n\n _onHandshakeBuffer (handshake) {\n const protocol = handshake.slice(0, 19)\n if (protocol.toString() !== 'BitTorrent protocol') {\n this._debug('Error: wire not speaking BitTorrent protocol (%s)', protocol.toString())\n this.end()\n return\n }\n handshake = handshake.slice(19)\n this._onHandshake(handshake.slice(8, 28), handshake.slice(28, 48), {\n dht: !!(handshake[7] & 0x01), // see bep_0005\n fast: !!(handshake[7] & 0x04), // see bep_0006\n extended: !!(handshake[5] & 0x10) // see bep_0010\n })\n this._parse(4, this._onMessageLength)\n }\n\n _onFinish () {\n this._finished = true\n\n this.push(null) // stream cannot be half open, so signal the end of it\n while (this.read()) {\n // body intentionally empty\n // consume and discard the rest of the stream data\n }\n\n clearInterval(this._keepAliveInterval)\n this._parse(Number.MAX_VALUE, () => {})\n while (this.peerRequests.length) {\n this.peerRequests.pop()\n }\n while (this.requests.length) {\n this._callback(this.requests.pop(), new Error('wire was closed'), null)\n }\n }\n\n _debug (...args) {\n args[0] = `[${this._debugId}] ${args[0]}`\n debug(...args)\n }\n\n _pull (requests, piece, offset, length) {\n for (let i = 0; i < requests.length; i++) {\n const req = requests[i]\n if (req.piece === piece && req.offset === offset && req.length === length) {\n arrayRemove(requests, i)\n return req\n }\n }\n return null\n }\n\n _encryptHandshake (buf) {\n const crypt = Buffer.from(buf)\n if (!this._encryptGenerator) {\n this._debug('Warning: Encrypting without any generator')\n return crypt\n }\n\n for (let i = 0; i < buf.length; i++) {\n const keystream = this._encryptGenerator.randomByte()\n crypt[i] = crypt[i] ^ keystream\n }\n\n return crypt\n }\n\n _encrypt (buf) {\n const crypt = Buffer.from(buf)\n\n if (!this._encryptGenerator || this._encryptionMethod !== 2) {\n return crypt\n }\n for (let i = 0; i < buf.length; i++) {\n const keystream = this._encryptGenerator.randomByte()\n crypt[i] = crypt[i] ^ keystream\n }\n\n return crypt\n }\n\n _decryptHandshake (buf) {\n const decrypt = Buffer.from(buf)\n\n if (!this._decryptGenerator) {\n this._debug('Warning: Decrypting without any generator')\n return decrypt\n }\n for (let i = 0; i < buf.length; i++) {\n const keystream = this._decryptGenerator.randomByte()\n decrypt[i] = decrypt[i] ^ keystream\n }\n\n return decrypt\n }\n\n _decrypt (buf) {\n const decrypt = Buffer.from(buf)\n\n if (!this._decryptGenerator || this._encryptionMethod !== 2) {\n return decrypt\n }\n for (let i = 0; i < buf.length; i++) {\n const keystream = this._decryptGenerator.randomByte()\n decrypt[i] = decrypt[i] ^ keystream\n }\n\n return decrypt\n }\n\n _utfToHex (str) {\n return Buffer.from(str, 'utf8').toString('hex')\n }\n}\n\nmodule.exports = Wire\n","const debug = require('debug')('bittorrent-tracker:client')\nconst EventEmitter = require('events')\nconst once = require('once')\nconst parallel = require('run-parallel')\nconst Peer = require('simple-peer')\nconst queueMicrotask = require('queue-microtask')\n\nconst common = require('./lib/common')\nconst HTTPTracker = require('./lib/client/http-tracker') // empty object in browser\nconst UDPTracker = require('./lib/client/udp-tracker') // empty object in browser\nconst WebSocketTracker = require('./lib/client/websocket-tracker')\n\n/**\n * BitTorrent tracker client.\n *\n * Find torrent peers, to help a torrent client participate in a torrent swarm.\n *\n * @param {Object} opts options object\n * @param {string|Buffer} opts.infoHash torrent info hash\n * @param {string|Buffer} opts.peerId peer id\n * @param {string|Array.} opts.announce announce\n * @param {number} opts.port torrent client listening port\n * @param {function} opts.getAnnounceOpts callback to provide data to tracker\n * @param {number} opts.rtcConfig RTCPeerConnection configuration object\n * @param {number} opts.userAgent User-Agent header for http requests\n * @param {number} opts.wrtc custom webrtc impl (useful in node.js)\n * @param {object} opts.proxyOpts proxy options (useful in node.js)\n */\nclass Client extends EventEmitter {\n constructor (opts = {}) {\n super()\n\n if (!opts.peerId) throw new Error('Option `peerId` is required')\n if (!opts.infoHash) throw new Error('Option `infoHash` is required')\n if (!opts.announce) throw new Error('Option `announce` is required')\n if (!process.browser && !opts.port) throw new Error('Option `port` is required')\n\n this.peerId = typeof opts.peerId === 'string'\n ? opts.peerId\n : opts.peerId.toString('hex')\n this._peerIdBuffer = Buffer.from(this.peerId, 'hex')\n this._peerIdBinary = this._peerIdBuffer.toString('binary')\n\n this.infoHash = typeof opts.infoHash === 'string'\n ? opts.infoHash.toLowerCase()\n : opts.infoHash.toString('hex')\n this._infoHashBuffer = Buffer.from(this.infoHash, 'hex')\n this._infoHashBinary = this._infoHashBuffer.toString('binary')\n\n debug('new client %s', this.infoHash)\n\n this.destroyed = false\n\n this._port = opts.port\n this._getAnnounceOpts = opts.getAnnounceOpts\n this._rtcConfig = opts.rtcConfig\n this._userAgent = opts.userAgent\n this._proxyOpts = opts.proxyOpts\n\n // Support lazy 'wrtc' module initialization\n // See: https://github.com/webtorrent/webtorrent-hybrid/issues/46\n this._wrtc = typeof opts.wrtc === 'function' ? opts.wrtc() : opts.wrtc\n\n let announce = typeof opts.announce === 'string'\n ? [opts.announce]\n : opts.announce == null ? [] : opts.announce\n\n // Remove trailing slash from trackers to catch duplicates\n announce = announce.map(announceUrl => {\n announceUrl = announceUrl.toString()\n if (announceUrl[announceUrl.length - 1] === '/') {\n announceUrl = announceUrl.substring(0, announceUrl.length - 1)\n }\n return announceUrl\n })\n // remove duplicates by converting to Set and back\n announce = Array.from(new Set(announce))\n\n const webrtcSupport = this._wrtc !== false && (!!this._wrtc || Peer.WEBRTC_SUPPORT)\n\n const nextTickWarn = err => {\n queueMicrotask(() => {\n this.emit('warning', err)\n })\n }\n\n this._trackers = announce\n .map(announceUrl => {\n let parsedUrl\n try {\n parsedUrl = common.parseUrl(announceUrl)\n } catch (err) {\n nextTickWarn(new Error(`Invalid tracker URL: ${announceUrl}`))\n return null\n }\n\n const port = parsedUrl.port\n if (port < 0 || port > 65535) {\n nextTickWarn(new Error(`Invalid tracker port: ${announceUrl}`))\n return null\n }\n\n const protocol = parsedUrl.protocol\n if ((protocol === 'http:' || protocol === 'https:') &&\n typeof HTTPTracker === 'function') {\n return new HTTPTracker(this, announceUrl)\n } else if (protocol === 'udp:' && typeof UDPTracker === 'function') {\n return new UDPTracker(this, announceUrl)\n } else if ((protocol === 'ws:' || protocol === 'wss:') && webrtcSupport) {\n // Skip ws:// trackers on https:// sites because they throw SecurityError\n if (protocol === 'ws:' && typeof window !== 'undefined' &&\n window.location.protocol === 'https:') {\n nextTickWarn(new Error(`Unsupported tracker protocol: ${announceUrl}`))\n return null\n }\n return new WebSocketTracker(this, announceUrl)\n } else {\n nextTickWarn(new Error(`Unsupported tracker protocol: ${announceUrl}`))\n return null\n }\n })\n .filter(Boolean)\n }\n\n /**\n * Send a `start` announce to the trackers.\n * @param {Object} opts\n * @param {number=} opts.uploaded\n * @param {number=} opts.downloaded\n * @param {number=} opts.left (if not set, calculated automatically)\n */\n start (opts) {\n opts = this._defaultAnnounceOpts(opts)\n opts.event = 'started'\n debug('send `start` %o', opts)\n this._announce(opts)\n\n // start announcing on intervals\n this._trackers.forEach(tracker => {\n tracker.setInterval()\n })\n }\n\n /**\n * Send a `stop` announce to the trackers.\n * @param {Object} opts\n * @param {number=} opts.uploaded\n * @param {number=} opts.downloaded\n * @param {number=} opts.numwant\n * @param {number=} opts.left (if not set, calculated automatically)\n */\n stop (opts) {\n opts = this._defaultAnnounceOpts(opts)\n opts.event = 'stopped'\n debug('send `stop` %o', opts)\n this._announce(opts)\n }\n\n /**\n * Send a `complete` announce to the trackers.\n * @param {Object} opts\n * @param {number=} opts.uploaded\n * @param {number=} opts.downloaded\n * @param {number=} opts.numwant\n * @param {number=} opts.left (if not set, calculated automatically)\n */\n complete (opts) {\n if (!opts) opts = {}\n opts = this._defaultAnnounceOpts(opts)\n opts.event = 'completed'\n debug('send `complete` %o', opts)\n this._announce(opts)\n }\n\n /**\n * Send a `update` announce to the trackers.\n * @param {Object} opts\n * @param {number=} opts.uploaded\n * @param {number=} opts.downloaded\n * @param {number=} opts.numwant\n * @param {number=} opts.left (if not set, calculated automatically)\n */\n update (opts) {\n opts = this._defaultAnnounceOpts(opts)\n if (opts.event) delete opts.event\n debug('send `update` %o', opts)\n this._announce(opts)\n }\n\n _announce (opts) {\n this._trackers.forEach(tracker => {\n // tracker should not modify `opts` object, it's passed to all trackers\n tracker.announce(opts)\n })\n }\n\n /**\n * Send a scrape request to the trackers.\n * @param {Object} opts\n */\n scrape (opts) {\n debug('send `scrape`')\n if (!opts) opts = {}\n this._trackers.forEach(tracker => {\n // tracker should not modify `opts` object, it's passed to all trackers\n tracker.scrape(opts)\n })\n }\n\n setInterval (intervalMs) {\n debug('setInterval %d', intervalMs)\n this._trackers.forEach(tracker => {\n tracker.setInterval(intervalMs)\n })\n }\n\n destroy (cb) {\n if (this.destroyed) return\n this.destroyed = true\n debug('destroy')\n\n const tasks = this._trackers.map(tracker => cb => {\n tracker.destroy(cb)\n })\n\n parallel(tasks, cb)\n\n this._trackers = []\n this._getAnnounceOpts = null\n }\n\n _defaultAnnounceOpts (opts = {}) {\n if (opts.numwant == null) opts.numwant = common.DEFAULT_ANNOUNCE_PEERS\n\n if (opts.uploaded == null) opts.uploaded = 0\n if (opts.downloaded == null) opts.downloaded = 0\n\n if (this._getAnnounceOpts) opts = Object.assign({}, opts, this._getAnnounceOpts())\n\n return opts\n }\n}\n\n/**\n * Simple convenience function to scrape a tracker for an info hash without needing to\n * create a Client, pass it a parsed torrent, etc. Support scraping a tracker for multiple\n * torrents at the same time.\n * @params {Object} opts\n * @param {string|Array.} opts.infoHash\n * @param {string} opts.announce\n * @param {function} cb\n */\nClient.scrape = (opts, cb) => {\n cb = once(cb)\n\n if (!opts.infoHash) throw new Error('Option `infoHash` is required')\n if (!opts.announce) throw new Error('Option `announce` is required')\n\n const clientOpts = Object.assign({}, opts, {\n infoHash: Array.isArray(opts.infoHash) ? opts.infoHash[0] : opts.infoHash,\n peerId: Buffer.from('01234567890123456789'), // dummy value\n port: 6881 // dummy value\n })\n\n const client = new Client(clientOpts)\n client.once('error', cb)\n client.once('warning', cb)\n\n let len = Array.isArray(opts.infoHash) ? opts.infoHash.length : 1\n const results = {}\n client.on('scrape', data => {\n len -= 1\n results[data.infoHash] = data\n if (len === 0) {\n client.destroy()\n const keys = Object.keys(results)\n if (keys.length === 1) {\n cb(null, results[keys[0]])\n } else {\n cb(null, results)\n }\n }\n })\n\n opts.infoHash = Array.isArray(opts.infoHash)\n ? opts.infoHash.map(infoHash => Buffer.from(infoHash, 'hex'))\n : Buffer.from(opts.infoHash, 'hex')\n client.scrape({ infoHash: opts.infoHash })\n return client\n}\n\nmodule.exports = Client\n","const EventEmitter = require('events')\n\nclass Tracker extends EventEmitter {\n constructor (client, announceUrl) {\n super()\n\n this.client = client\n this.announceUrl = announceUrl\n\n this.interval = null\n this.destroyed = false\n }\n\n setInterval (intervalMs) {\n if (intervalMs == null) intervalMs = this.DEFAULT_ANNOUNCE_INTERVAL\n\n clearInterval(this.interval)\n\n if (intervalMs) {\n this.interval = setInterval(() => {\n this.announce(this.client._defaultAnnounceOpts())\n }, intervalMs)\n if (this.interval.unref) this.interval.unref()\n }\n }\n}\n\nmodule.exports = Tracker\n","const clone = require('clone')\nconst debug = require('debug')('bittorrent-tracker:websocket-tracker')\nconst Peer = require('simple-peer')\nconst randombytes = require('randombytes')\nconst Socket = require('simple-websocket')\nconst Socks = require('socks')\n\nconst common = require('../common')\nconst Tracker = require('./tracker')\n\n// Use a socket pool, so tracker clients share WebSocket objects for the same server.\n// In practice, WebSockets are pretty slow to establish, so this gives a nice performance\n// boost, and saves browser resources.\nconst socketPool = {}\n\nconst RECONNECT_MINIMUM = 10 * 1000\nconst RECONNECT_MAXIMUM = 60 * 60 * 1000\nconst RECONNECT_VARIANCE = 5 * 60 * 1000\nconst OFFER_TIMEOUT = 50 * 1000\n\nclass WebSocketTracker extends Tracker {\n constructor (client, announceUrl) {\n super(client, announceUrl)\n debug('new websocket tracker %s', announceUrl)\n\n this.peers = {} // peers (offer id -> peer)\n this.socket = null\n\n this.reconnecting = false\n this.retries = 0\n this.reconnectTimer = null\n\n // Simple boolean flag to track whether the socket has received data from\n // the websocket server since the last time socket.send() was called.\n this.expectingResponse = false\n\n this._openSocket()\n }\n\n announce (opts) {\n if (this.destroyed || this.reconnecting) return\n if (!this.socket.connected) {\n this.socket.once('connect', () => {\n this.announce(opts)\n })\n return\n }\n\n const params = Object.assign({}, opts, {\n action: 'announce',\n info_hash: this.client._infoHashBinary,\n peer_id: this.client._peerIdBinary\n })\n if (this._trackerId) params.trackerid = this._trackerId\n\n if (opts.event === 'stopped' || opts.event === 'completed') {\n // Don't include offers with 'stopped' or 'completed' event\n this._send(params)\n } else {\n // Limit the number of offers that are generated, since it can be slow\n const numwant = Math.min(opts.numwant, 5)\n\n this._generateOffers(numwant, offers => {\n params.numwant = numwant\n params.offers = offers\n this._send(params)\n })\n }\n }\n\n scrape (opts) {\n if (this.destroyed || this.reconnecting) return\n if (!this.socket.connected) {\n this.socket.once('connect', () => {\n this.scrape(opts)\n })\n return\n }\n\n const infoHashes = (Array.isArray(opts.infoHash) && opts.infoHash.length > 0)\n ? opts.infoHash.map(infoHash => infoHash.toString('binary'))\n : (opts.infoHash && opts.infoHash.toString('binary')) || this.client._infoHashBinary\n const params = {\n action: 'scrape',\n info_hash: infoHashes\n }\n\n this._send(params)\n }\n\n destroy (cb = noop) {\n if (this.destroyed) return cb(null)\n\n this.destroyed = true\n\n clearInterval(this.interval)\n clearTimeout(this.reconnectTimer)\n\n // Destroy peers\n for (const peerId in this.peers) {\n const peer = this.peers[peerId]\n clearTimeout(peer.trackerTimeout)\n peer.destroy()\n }\n this.peers = null\n\n if (this.socket) {\n this.socket.removeListener('connect', this._onSocketConnectBound)\n this.socket.removeListener('data', this._onSocketDataBound)\n this.socket.removeListener('close', this._onSocketCloseBound)\n this.socket.removeListener('error', this._onSocketErrorBound)\n this.socket = null\n }\n\n this._onSocketConnectBound = null\n this._onSocketErrorBound = null\n this._onSocketDataBound = null\n this._onSocketCloseBound = null\n\n if (socketPool[this.announceUrl]) {\n socketPool[this.announceUrl].consumers -= 1\n }\n\n // Other instances are using the socket, so there's nothing left to do here\n if (socketPool[this.announceUrl].consumers > 0) return cb()\n\n let socket = socketPool[this.announceUrl]\n delete socketPool[this.announceUrl]\n socket.on('error', noop) // ignore all future errors\n socket.once('close', cb)\n\n let timeout\n\n // If there is no data response expected, destroy immediately.\n if (!this.expectingResponse) return destroyCleanup()\n\n // Otherwise, wait a short time for potential responses to come in from the\n // server, then force close the socket.\n timeout = setTimeout(destroyCleanup, common.DESTROY_TIMEOUT)\n\n // But, if a response comes from the server before the timeout fires, do cleanup\n // right away.\n socket.once('data', destroyCleanup)\n\n function destroyCleanup () {\n if (timeout) {\n clearTimeout(timeout)\n timeout = null\n }\n socket.removeListener('data', destroyCleanup)\n socket.destroy()\n socket = null\n }\n }\n\n _openSocket () {\n this.destroyed = false\n\n if (!this.peers) this.peers = {}\n\n this._onSocketConnectBound = () => {\n this._onSocketConnect()\n }\n this._onSocketErrorBound = err => {\n this._onSocketError(err)\n }\n this._onSocketDataBound = data => {\n this._onSocketData(data)\n }\n this._onSocketCloseBound = () => {\n this._onSocketClose()\n }\n\n this.socket = socketPool[this.announceUrl]\n if (this.socket) {\n socketPool[this.announceUrl].consumers += 1\n if (this.socket.connected) {\n this._onSocketConnectBound()\n }\n } else {\n const parsedUrl = new URL(this.announceUrl)\n let agent\n if (this.client._proxyOpts) {\n agent = parsedUrl.protocol === 'wss:' ? this.client._proxyOpts.httpsAgent : this.client._proxyOpts.httpAgent\n if (!agent && this.client._proxyOpts.socksProxy) {\n agent = new Socks.Agent(clone(this.client._proxyOpts.socksProxy), (parsedUrl.protocol === 'wss:'))\n }\n }\n this.socket = socketPool[this.announceUrl] = new Socket({ url: this.announceUrl, agent })\n this.socket.consumers = 1\n this.socket.once('connect', this._onSocketConnectBound)\n }\n\n this.socket.on('data', this._onSocketDataBound)\n this.socket.once('close', this._onSocketCloseBound)\n this.socket.once('error', this._onSocketErrorBound)\n }\n\n _onSocketConnect () {\n if (this.destroyed) return\n\n if (this.reconnecting) {\n this.reconnecting = false\n this.retries = 0\n this.announce(this.client._defaultAnnounceOpts())\n }\n }\n\n _onSocketData (data) {\n if (this.destroyed) return\n\n this.expectingResponse = false\n\n try {\n data = JSON.parse(data)\n } catch (err) {\n this.client.emit('warning', new Error('Invalid tracker response'))\n return\n }\n\n if (data.action === 'announce') {\n this._onAnnounceResponse(data)\n } else if (data.action === 'scrape') {\n this._onScrapeResponse(data)\n } else {\n this._onSocketError(new Error(`invalid action in WS response: ${data.action}`))\n }\n }\n\n _onAnnounceResponse (data) {\n if (data.info_hash !== this.client._infoHashBinary) {\n debug(\n 'ignoring websocket data from %s for %s (looking for %s: reused socket)',\n this.announceUrl, common.binaryToHex(data.info_hash), this.client.infoHash\n )\n return\n }\n\n if (data.peer_id && data.peer_id === this.client._peerIdBinary) {\n // ignore offers/answers from this client\n return\n }\n\n debug(\n 'received %s from %s for %s',\n JSON.stringify(data), this.announceUrl, this.client.infoHash\n )\n\n const failure = data['failure reason']\n if (failure) return this.client.emit('warning', new Error(failure))\n\n const warning = data['warning message']\n if (warning) this.client.emit('warning', new Error(warning))\n\n const interval = data.interval || data['min interval']\n if (interval) this.setInterval(interval * 1000)\n\n const trackerId = data['tracker id']\n if (trackerId) {\n // If absent, do not discard previous trackerId value\n this._trackerId = trackerId\n }\n\n if (data.complete != null) {\n const response = Object.assign({}, data, {\n announce: this.announceUrl,\n infoHash: common.binaryToHex(data.info_hash)\n })\n this.client.emit('update', response)\n }\n\n let peer\n if (data.offer && data.peer_id) {\n debug('creating peer (from remote offer)')\n peer = this._createPeer()\n peer.id = common.binaryToHex(data.peer_id)\n peer.once('signal', answer => {\n const params = {\n action: 'announce',\n info_hash: this.client._infoHashBinary,\n peer_id: this.client._peerIdBinary,\n to_peer_id: data.peer_id,\n answer,\n offer_id: data.offer_id\n }\n if (this._trackerId) params.trackerid = this._trackerId\n this._send(params)\n })\n this.client.emit('peer', peer)\n peer.signal(data.offer)\n }\n\n if (data.answer && data.peer_id) {\n const offerId = common.binaryToHex(data.offer_id)\n peer = this.peers[offerId]\n if (peer) {\n peer.id = common.binaryToHex(data.peer_id)\n this.client.emit('peer', peer)\n peer.signal(data.answer)\n\n clearTimeout(peer.trackerTimeout)\n peer.trackerTimeout = null\n delete this.peers[offerId]\n } else {\n debug(`got unexpected answer: ${JSON.stringify(data.answer)}`)\n }\n }\n }\n\n _onScrapeResponse (data) {\n data = data.files || {}\n\n const keys = Object.keys(data)\n if (keys.length === 0) {\n this.client.emit('warning', new Error('invalid scrape response'))\n return\n }\n\n keys.forEach(infoHash => {\n // TODO: optionally handle data.flags.min_request_interval\n // (separate from announce interval)\n const response = Object.assign(data[infoHash], {\n announce: this.announceUrl,\n infoHash: common.binaryToHex(infoHash)\n })\n this.client.emit('scrape', response)\n })\n }\n\n _onSocketClose () {\n if (this.destroyed) return\n this.destroy()\n this._startReconnectTimer()\n }\n\n _onSocketError (err) {\n if (this.destroyed) return\n this.destroy()\n // errors will often happen if a tracker is offline, so don't treat it as fatal\n this.client.emit('warning', err)\n this._startReconnectTimer()\n }\n\n _startReconnectTimer () {\n const ms = Math.floor(Math.random() * RECONNECT_VARIANCE) + Math.min(Math.pow(2, this.retries) * RECONNECT_MINIMUM, RECONNECT_MAXIMUM)\n\n this.reconnecting = true\n clearTimeout(this.reconnectTimer)\n this.reconnectTimer = setTimeout(() => {\n this.retries++\n this._openSocket()\n }, ms)\n if (this.reconnectTimer.unref) this.reconnectTimer.unref()\n\n debug('reconnecting socket in %s ms', ms)\n }\n\n _send (params) {\n if (this.destroyed) return\n this.expectingResponse = true\n const message = JSON.stringify(params)\n debug('send %s', message)\n this.socket.send(message)\n }\n\n _generateOffers (numwant, cb) {\n const self = this\n const offers = []\n debug('generating %s offers', numwant)\n\n for (let i = 0; i < numwant; ++i) {\n generateOffer()\n }\n checkDone()\n\n function generateOffer () {\n const offerId = randombytes(20).toString('hex')\n debug('creating peer (from _generateOffers)')\n const peer = self.peers[offerId] = self._createPeer({ initiator: true })\n peer.once('signal', offer => {\n offers.push({\n offer,\n offer_id: common.hexToBinary(offerId)\n })\n checkDone()\n })\n peer.trackerTimeout = setTimeout(() => {\n debug('tracker timeout: destroying peer')\n peer.trackerTimeout = null\n delete self.peers[offerId]\n peer.destroy()\n }, OFFER_TIMEOUT)\n if (peer.trackerTimeout.unref) peer.trackerTimeout.unref()\n }\n\n function checkDone () {\n if (offers.length === numwant) {\n debug('generated %s offers', numwant)\n cb(offers)\n }\n }\n }\n\n _createPeer (opts) {\n const self = this\n\n opts = Object.assign({\n trickle: false,\n config: self.client._rtcConfig,\n wrtc: self.client._wrtc\n }, opts)\n\n const peer = new Peer(opts)\n\n peer.once('error', onError)\n peer.once('connect', onConnect)\n\n return peer\n\n // Handle peer 'error' events that are fired *before* the peer is emitted in\n // a 'peer' event.\n function onError (err) {\n self.client.emit('warning', new Error(`Connection error: ${err.message}`))\n peer.destroy()\n }\n\n // Once the peer is emitted in a 'peer' event, then it's the consumer's\n // responsibility to listen for errors, so the listeners are removed here.\n function onConnect () {\n peer.removeListener('error', onError)\n peer.removeListener('connect', onConnect)\n }\n }\n}\n\nWebSocketTracker.prototype.DEFAULT_ANNOUNCE_INTERVAL = 30 * 1000 // 30 seconds\n// Normally this shouldn't be accessed but is occasionally useful\nWebSocketTracker._socketPool = socketPool\n\nfunction noop () {}\n\nmodule.exports = WebSocketTracker\n","/**\n * Functions/constants needed by both the client and server.\n */\n\nexports.DEFAULT_ANNOUNCE_PEERS = 50\nexports.MAX_ANNOUNCE_PEERS = 82\n\nexports.binaryToHex = str => {\n if (typeof str !== 'string') {\n str = String(str)\n }\n return Buffer.from(str, 'binary').toString('hex')\n}\n\nexports.hexToBinary = str => {\n if (typeof str !== 'string') {\n str = String(str)\n }\n return Buffer.from(str, 'hex').toString('binary')\n}\n\n// HACK: Fix for WHATWG URL object not parsing non-standard URL schemes like\n// 'udp:'. Just replace it with 'http:' since we only need a few properties.\n//\n// Note: Only affects Chrome and Firefox. Works fine in Node.js, Safari, and\n// Edge.\n//\n// Note: UDP trackers aren't used in the normal browser build, but they are\n// used in a Chrome App build (i.e. by Brave Browser).\n//\n// Bug reports:\n// - Chrome: https://bugs.chromium.org/p/chromium/issues/detail?id=734880\n// - Firefox: https://bugzilla.mozilla.org/show_bug.cgi?id=1374505\nexports.parseUrl = str => {\n const url = new URL(str.replace(/^udp:/, 'http:'))\n\n if (str.match(/^udp:/)) {\n Object.defineProperties(url, {\n href: { value: url.href.replace(/^http/, 'udp') },\n protocol: { value: url.protocol.replace(/^http/, 'udp') },\n origin: { value: url.origin.replace(/^http/, 'udp') }\n })\n }\n\n return url\n}\n\nconst config = require('./common-node')\nObject.assign(exports, config)\n","/*! blob-to-buffer. MIT License. Feross Aboukhadijeh */\n/* global Blob, FileReader */\n\nmodule.exports = function blobToBuffer (blob, cb) {\n if (typeof Blob === 'undefined' || !(blob instanceof Blob)) {\n throw new Error('first argument must be a Blob')\n }\n if (typeof cb !== 'function') {\n throw new Error('second argument must be a function')\n }\n\n const reader = new FileReader()\n\n function onLoadEnd (e) {\n reader.removeEventListener('loadend', onLoadEnd, false)\n if (e.error) cb(e.error)\n else cb(null, Buffer.from(reader.result))\n }\n\n reader.addEventListener('loadend', onLoadEnd, false)\n reader.readAsArrayBuffer(blob)\n}\n","const { Transform } = require('readable-stream')\n\nclass Block extends Transform {\n constructor (size, opts = {}) {\n super(opts)\n\n if (typeof size === 'object') {\n opts = size\n size = opts.size\n }\n\n this.size = size || 512\n\n const { nopad, zeroPadding = true } = opts\n\n if (nopad) this._zeroPadding = false\n else this._zeroPadding = !!zeroPadding\n\n this._buffered = []\n this._bufferedBytes = 0\n }\n\n _transform (buf, enc, next) {\n this._bufferedBytes += buf.length\n this._buffered.push(buf)\n\n while (this._bufferedBytes >= this.size) {\n this._bufferedBytes -= this.size\n\n // Assemble the buffers that will compose the final block\n const blockBufs = []\n let blockBufsBytes = 0\n while (blockBufsBytes < this.size) {\n const b = this._buffered.shift()\n\n if (blockBufsBytes + b.length <= this.size) {\n blockBufs.push(b)\n blockBufsBytes += b.length\n } else {\n // If the last buffer is larger than needed for the block, just\n // use the needed part\n const neededSize = this.size - blockBufsBytes\n blockBufs.push(b.slice(0, neededSize))\n blockBufsBytes += neededSize\n this._buffered.unshift(b.slice(neededSize))\n }\n }\n\n // Then concat just those buffers, leaving the rest untouched in _buffered\n this.push(Buffer.concat(blockBufs, this.size))\n }\n next()\n }\n\n _flush () {\n if (this._bufferedBytes && this._zeroPadding) {\n const zeroes = Buffer.alloc(this.size - this._bufferedBytes)\n this._buffered.push(zeroes)\n this.push(Buffer.concat(this._buffered))\n this._buffered = null\n } else if (this._bufferedBytes) {\n this.push(Buffer.concat(this._buffered))\n this._buffered = null\n }\n this.push(null)\n }\n}\n\nmodule.exports = Block\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [number & 0x3ffffff];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this._strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // '0' - '9'\n if (c >= 48 && c <= 57) {\n return c - 48;\n // 'A' - 'F'\n } else if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n } else {\n assert(false, 'Invalid character in ' + string);\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 b = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n b = c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n b = c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n b = c;\n }\n assert(c >= 0 && b < mul, 'Invalid character');\n r += b;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n function move (dest, src) {\n dest.words = src.words;\n dest.length = src.length;\n dest.negative = src.negative;\n dest.red = src.red;\n }\n\n BN.prototype._move = function _move (dest) {\n move(dest, this);\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype._strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n // Check Symbol.for because not everywhere where Symbol defined\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n try {\n BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n } catch (e) {\n BN.prototype.inspect = inspect;\n }\n } else {\n BN.prototype.inspect = inspect;\n }\n\n function inspect () {\n return (this.red ? '';\n }\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modrn(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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16, 2);\n };\n\n if (Buffer) {\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n return this.toArrayLike(Buffer, endian, length);\n };\n }\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n var allocate = function allocate (ArrayType, size) {\n if (ArrayType.allocUnsafe) {\n return ArrayType.allocUnsafe(size);\n }\n return new ArrayType(size);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n this._strip();\n\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\n var res = allocate(ArrayType, reqLength);\n var postfix = endian === 'le' ? 'LE' : 'BE';\n this['_toArrayLike' + postfix](res, byteLength);\n return res;\n };\n\n BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n var position = 0;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position++] = word & 0xff;\n if (position < res.length) {\n res[position++] = (word >> 8) & 0xff;\n }\n if (position < res.length) {\n res[position++] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position < res.length) {\n res[position++] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position < res.length) {\n res[position++] = carry;\n\n while (position < res.length) {\n res[position++] = 0;\n }\n }\n };\n\n BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n var position = res.length - 1;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position--] = word & 0xff;\n if (position >= 0) {\n res[position--] = (word >> 8) & 0xff;\n }\n if (position >= 0) {\n res[position--] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position >= 0) {\n res[position--] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position >= 0) {\n res[position--] = carry;\n\n while (position >= 0) {\n res[position--] = 0;\n }\n }\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] >>> wbit) & 0x01;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this._strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n // var fftm = new FFTM();\n // return fftm.mulp(self, num, out);\n return bigMulTo(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out._strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this._strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q._strip();\n }\n a._strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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.modrn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modrn = function modrn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return isNegNum ? -acc : acc;\n };\n\n // WARNING: DEPRECATED\n BN.prototype.modn = function modn (num) {\n return this.modrn(num);\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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 this._strip();\n return isNegNum ? this.ineg() : this;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this._strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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 a BN v4 instance\n r.strip();\n } else {\n // r is a 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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\n move(a, a.umod(this.m)._forceRed(this));\n return a;\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","var r;\n\nmodule.exports = function rand(len) {\n if (!r)\n r = new Rand(null);\n\n return r.generate(len);\n};\n\nfunction Rand(rand) {\n this.rand = rand;\n}\nmodule.exports.Rand = Rand;\n\nRand.prototype.generate = function generate(len) {\n return this._rand(len);\n};\n\n// Emulate crypto API using randy\nRand.prototype._rand = function _rand(n) {\n if (this.rand.getBytes)\n return this.rand.getBytes(n);\n\n var res = new Uint8Array(n);\n for (var i = 0; i < res.length; i++)\n res[i] = this.rand.getByte();\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 };\n\n // Safari's WebWorkers do not have `crypto`\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 if (typeof crypto.randomBytes !== 'function')\n throw new Error('Not supported');\n\n Rand.prototype._rand = function _rand(n) {\n return crypto.randomBytes(n);\n };\n } catch (e) {\n }\n}\n","// based on the aes implimentation in triple sec\n// https://github.com/keybase/triplesec\n// which is in turn based on the one from crypto-js\n// https://code.google.com/p/crypto-js/\n\nvar Buffer = require('safe-buffer').Buffer\n\nfunction asUInt32Array (buf) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n\n var len = (buf.length / 4) | 0\n var out = new Array(len)\n\n for (var i = 0; i < len; i++) {\n out[i] = buf.readUInt32BE(i * 4)\n }\n\n return out\n}\n\nfunction scrubVec (v) {\n for (var i = 0; i < v.length; v++) {\n v[i] = 0\n }\n}\n\nfunction cryptBlock (M, keySchedule, SUB_MIX, SBOX, nRounds) {\n var SUB_MIX0 = SUB_MIX[0]\n var SUB_MIX1 = SUB_MIX[1]\n var SUB_MIX2 = SUB_MIX[2]\n var SUB_MIX3 = SUB_MIX[3]\n\n var s0 = M[0] ^ keySchedule[0]\n var s1 = M[1] ^ keySchedule[1]\n var s2 = M[2] ^ keySchedule[2]\n var s3 = M[3] ^ keySchedule[3]\n var t0, t1, t2, t3\n var ksRow = 4\n\n for (var round = 1; round < nRounds; round++) {\n t0 = SUB_MIX0[s0 >>> 24] ^ SUB_MIX1[(s1 >>> 16) & 0xff] ^ SUB_MIX2[(s2 >>> 8) & 0xff] ^ SUB_MIX3[s3 & 0xff] ^ keySchedule[ksRow++]\n t1 = SUB_MIX0[s1 >>> 24] ^ SUB_MIX1[(s2 >>> 16) & 0xff] ^ SUB_MIX2[(s3 >>> 8) & 0xff] ^ SUB_MIX3[s0 & 0xff] ^ keySchedule[ksRow++]\n t2 = SUB_MIX0[s2 >>> 24] ^ SUB_MIX1[(s3 >>> 16) & 0xff] ^ SUB_MIX2[(s0 >>> 8) & 0xff] ^ SUB_MIX3[s1 & 0xff] ^ keySchedule[ksRow++]\n t3 = SUB_MIX0[s3 >>> 24] ^ SUB_MIX1[(s0 >>> 16) & 0xff] ^ SUB_MIX2[(s1 >>> 8) & 0xff] ^ SUB_MIX3[s2 & 0xff] ^ keySchedule[ksRow++]\n s0 = t0\n s1 = t1\n s2 = t2\n s3 = t3\n }\n\n t0 = ((SBOX[s0 >>> 24] << 24) | (SBOX[(s1 >>> 16) & 0xff] << 16) | (SBOX[(s2 >>> 8) & 0xff] << 8) | SBOX[s3 & 0xff]) ^ keySchedule[ksRow++]\n t1 = ((SBOX[s1 >>> 24] << 24) | (SBOX[(s2 >>> 16) & 0xff] << 16) | (SBOX[(s3 >>> 8) & 0xff] << 8) | SBOX[s0 & 0xff]) ^ keySchedule[ksRow++]\n t2 = ((SBOX[s2 >>> 24] << 24) | (SBOX[(s3 >>> 16) & 0xff] << 16) | (SBOX[(s0 >>> 8) & 0xff] << 8) | SBOX[s1 & 0xff]) ^ keySchedule[ksRow++]\n t3 = ((SBOX[s3 >>> 24] << 24) | (SBOX[(s0 >>> 16) & 0xff] << 16) | (SBOX[(s1 >>> 8) & 0xff] << 8) | SBOX[s2 & 0xff]) ^ keySchedule[ksRow++]\n t0 = t0 >>> 0\n t1 = t1 >>> 0\n t2 = t2 >>> 0\n t3 = t3 >>> 0\n\n return [t0, t1, t2, t3]\n}\n\n// AES constants\nvar RCON = [0x00, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36]\nvar G = (function () {\n // Compute double table\n var d = new Array(256)\n for (var j = 0; j < 256; j++) {\n if (j < 128) {\n d[j] = j << 1\n } else {\n d[j] = (j << 1) ^ 0x11b\n }\n }\n\n var SBOX = []\n var INV_SBOX = []\n var SUB_MIX = [[], [], [], []]\n var INV_SUB_MIX = [[], [], [], []]\n\n // Walk GF(2^8)\n var x = 0\n var xi = 0\n for (var i = 0; i < 256; ++i) {\n // Compute sbox\n var sx = xi ^ (xi << 1) ^ (xi << 2) ^ (xi << 3) ^ (xi << 4)\n sx = (sx >>> 8) ^ (sx & 0xff) ^ 0x63\n SBOX[x] = sx\n INV_SBOX[sx] = x\n\n // Compute multiplication\n var x2 = d[x]\n var x4 = d[x2]\n var x8 = d[x4]\n\n // Compute sub bytes, mix columns tables\n var t = (d[sx] * 0x101) ^ (sx * 0x1010100)\n SUB_MIX[0][x] = (t << 24) | (t >>> 8)\n SUB_MIX[1][x] = (t << 16) | (t >>> 16)\n SUB_MIX[2][x] = (t << 8) | (t >>> 24)\n SUB_MIX[3][x] = t\n\n // Compute inv sub bytes, inv mix columns tables\n t = (x8 * 0x1010101) ^ (x4 * 0x10001) ^ (x2 * 0x101) ^ (x * 0x1010100)\n INV_SUB_MIX[0][sx] = (t << 24) | (t >>> 8)\n INV_SUB_MIX[1][sx] = (t << 16) | (t >>> 16)\n INV_SUB_MIX[2][sx] = (t << 8) | (t >>> 24)\n INV_SUB_MIX[3][sx] = t\n\n if (x === 0) {\n x = xi = 1\n } else {\n x = x2 ^ d[d[d[x8 ^ x2]]]\n xi ^= d[d[xi]]\n }\n }\n\n return {\n SBOX: SBOX,\n INV_SBOX: INV_SBOX,\n SUB_MIX: SUB_MIX,\n INV_SUB_MIX: INV_SUB_MIX\n }\n})()\n\nfunction AES (key) {\n this._key = asUInt32Array(key)\n this._reset()\n}\n\nAES.blockSize = 4 * 4\nAES.keySize = 256 / 8\nAES.prototype.blockSize = AES.blockSize\nAES.prototype.keySize = AES.keySize\nAES.prototype._reset = function () {\n var keyWords = this._key\n var keySize = keyWords.length\n var nRounds = keySize + 6\n var ksRows = (nRounds + 1) * 4\n\n var keySchedule = []\n for (var k = 0; k < keySize; k++) {\n keySchedule[k] = keyWords[k]\n }\n\n for (k = keySize; k < ksRows; k++) {\n var t = keySchedule[k - 1]\n\n if (k % keySize === 0) {\n t = (t << 8) | (t >>> 24)\n t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 0xff] << 16) |\n (G.SBOX[(t >>> 8) & 0xff] << 8) |\n (G.SBOX[t & 0xff])\n\n t ^= RCON[(k / keySize) | 0] << 24\n } else if (keySize > 6 && k % keySize === 4) {\n t =\n (G.SBOX[t >>> 24] << 24) |\n (G.SBOX[(t >>> 16) & 0xff] << 16) |\n (G.SBOX[(t >>> 8) & 0xff] << 8) |\n (G.SBOX[t & 0xff])\n }\n\n keySchedule[k] = keySchedule[k - keySize] ^ t\n }\n\n var invKeySchedule = []\n for (var ik = 0; ik < ksRows; ik++) {\n var ksR = ksRows - ik\n var tt = keySchedule[ksR - (ik % 4 ? 0 : 4)]\n\n if (ik < 4 || ksR <= 4) {\n invKeySchedule[ik] = tt\n } else {\n invKeySchedule[ik] =\n G.INV_SUB_MIX[0][G.SBOX[tt >>> 24]] ^\n G.INV_SUB_MIX[1][G.SBOX[(tt >>> 16) & 0xff]] ^\n G.INV_SUB_MIX[2][G.SBOX[(tt >>> 8) & 0xff]] ^\n G.INV_SUB_MIX[3][G.SBOX[tt & 0xff]]\n }\n }\n\n this._nRounds = nRounds\n this._keySchedule = keySchedule\n this._invKeySchedule = invKeySchedule\n}\n\nAES.prototype.encryptBlockRaw = function (M) {\n M = asUInt32Array(M)\n return cryptBlock(M, this._keySchedule, G.SUB_MIX, G.SBOX, this._nRounds)\n}\n\nAES.prototype.encryptBlock = function (M) {\n var out = this.encryptBlockRaw(M)\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0], 0)\n buf.writeUInt32BE(out[1], 4)\n buf.writeUInt32BE(out[2], 8)\n buf.writeUInt32BE(out[3], 12)\n return buf\n}\n\nAES.prototype.decryptBlock = function (M) {\n M = asUInt32Array(M)\n\n // swap\n var m1 = M[1]\n M[1] = M[3]\n M[3] = m1\n\n var out = cryptBlock(M, this._invKeySchedule, G.INV_SUB_MIX, G.INV_SBOX, this._nRounds)\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0], 0)\n buf.writeUInt32BE(out[3], 4)\n buf.writeUInt32BE(out[2], 8)\n buf.writeUInt32BE(out[1], 12)\n return buf\n}\n\nAES.prototype.scrub = function () {\n scrubVec(this._keySchedule)\n scrubVec(this._invKeySchedule)\n scrubVec(this._key)\n}\n\nmodule.exports.AES = AES\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\nvar GHASH = require('./ghash')\nvar xor = require('buffer-xor')\nvar incr32 = require('./incr32')\n\nfunction xorTest (a, b) {\n var out = 0\n if (a.length !== b.length) out++\n\n var len = Math.min(a.length, b.length)\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 var ghash = new GHASH(ck)\n var len = iv.length\n var toPad = len % 16\n ghash.update(iv)\n if (toPad) {\n toPad = 16 - toPad\n ghash.update(Buffer.alloc(toPad, 0))\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}\nfunction StreamCipher (mode, key, iv, decrypt) {\n Transform.call(this)\n\n var h = Buffer.alloc(4, 0)\n\n this._cipher = new aes.AES(key)\n var ck = this._cipher.encryptBlock(h)\n this._ghash = new GHASH(ck)\n iv = calcIv(this, iv, ck)\n\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\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 if (rump < 16) {\n rump = Buffer.alloc(rump, 0)\n this._ghash.update(rump)\n }\n }\n\n this._called = true\n var out = this._mode.encrypt(this, chunk)\n if (this._decrypt) {\n this._ghash.update(chunk)\n } else {\n this._ghash.update(out)\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\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\n this._authTag = tag\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\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\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 this._alen += buf.length\n}\n\nmodule.exports = StreamCipher\n","var ciphers = require('./encrypter')\nvar deciphers = require('./decrypter')\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\n","var AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar MODES = require('./modes')\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Decipher (mode, key, iv) {\n Transform.call(this)\n\n this._cache = new Splitter()\n this._last = void 0\n this._cipher = new aes.AES(key)\n this._prev = Buffer.from(iv)\n this._mode = mode\n this._autopadding = true\n}\n\ninherits(Decipher, Transform)\n\nDecipher.prototype._update = function (data) {\n this._cache.add(data)\n var chunk\n var thing\n var out = []\n while ((chunk = this._cache.get(this._autopadding))) {\n thing = this._mode.decrypt(this, chunk)\n out.push(thing)\n }\n return Buffer.concat(out)\n}\n\nDecipher.prototype._final = function () {\n var chunk = this._cache.flush()\n if (this._autopadding) {\n return unpad(this._mode.decrypt(this, chunk))\n } else if (chunk) {\n throw new Error('data not multiple of block length')\n }\n}\n\nDecipher.prototype.setAutoPadding = function (setTo) {\n this._autopadding = !!setTo\n return this\n}\n\nfunction Splitter () {\n this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function (autoPadding) {\n var out\n if (autoPadding) {\n if (this.cache.length > 16) {\n out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n } else {\n if (this.cache.length >= 16) {\n out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n }\n\n return null\n}\n\nSplitter.prototype.flush = function () {\n if (this.cache.length) return this.cache\n}\n\nfunction unpad (last) {\n var padded = last[15]\n if (padded < 1 || padded > 16) {\n throw new Error('unable to decrypt data')\n }\n var i = -1\n while (++i < padded) {\n if (last[(i + (16 - padded))] !== padded) {\n throw new Error('unable to decrypt data')\n }\n }\n if (padded === 16) return\n\n return last.slice(0, 16 - padded)\n}\n\nfunction createDecipheriv (suite, password, iv) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n if (typeof iv === 'string') iv = Buffer.from(iv)\n if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n if (typeof password === 'string') password = Buffer.from(password)\n if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n if (config.type === 'stream') {\n return new StreamCipher(config.module, password, iv, true)\n } else if (config.type === 'auth') {\n return new AuthCipher(config.module, password, iv, true)\n }\n\n return new Decipher(config.module, password, iv)\n}\n\nfunction createDecipher (suite, password) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n var keys = ebtk(password, false, config.key, config.iv)\n return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createDecipher = createDecipher\nexports.createDecipheriv = createDecipheriv\n","var MODES = require('./modes')\nvar AuthCipher = require('./authCipher')\nvar Buffer = require('safe-buffer').Buffer\nvar StreamCipher = require('./streamCipher')\nvar Transform = require('cipher-base')\nvar aes = require('./aes')\nvar ebtk = require('evp_bytestokey')\nvar inherits = require('inherits')\n\nfunction Cipher (mode, key, iv) {\n Transform.call(this)\n\n this._cache = new Splitter()\n this._cipher = new aes.AES(key)\n this._prev = Buffer.from(iv)\n this._mode = mode\n this._autopadding = true\n}\n\ninherits(Cipher, Transform)\n\nCipher.prototype._update = function (data) {\n this._cache.add(data)\n var chunk\n var thing\n var out = []\n\n while ((chunk = this._cache.get())) {\n thing = this._mode.encrypt(this, chunk)\n out.push(thing)\n }\n\n return Buffer.concat(out)\n}\n\nvar PADDING = Buffer.alloc(16, 0x10)\n\nCipher.prototype._final = function () {\n var chunk = this._cache.flush()\n if (this._autopadding) {\n chunk = this._mode.encrypt(this, chunk)\n this._cipher.scrub()\n return chunk\n }\n\n if (!chunk.equals(PADDING)) {\n this._cipher.scrub()\n throw new Error('data not multiple of block length')\n }\n}\n\nCipher.prototype.setAutoPadding = function (setTo) {\n this._autopadding = !!setTo\n return this\n}\n\nfunction Splitter () {\n this.cache = Buffer.allocUnsafe(0)\n}\n\nSplitter.prototype.add = function (data) {\n this.cache = Buffer.concat([this.cache, data])\n}\n\nSplitter.prototype.get = function () {\n if (this.cache.length > 15) {\n var out = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n return out\n }\n return null\n}\n\nSplitter.prototype.flush = function () {\n var len = 16 - this.cache.length\n var padBuff = Buffer.allocUnsafe(len)\n\n var i = -1\n while (++i < len) {\n padBuff.writeUInt8(len, i)\n }\n\n return Buffer.concat([this.cache, padBuff])\n}\n\nfunction createCipheriv (suite, password, iv) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n if (typeof password === 'string') password = Buffer.from(password)\n if (password.length !== config.key / 8) throw new TypeError('invalid key length ' + password.length)\n\n if (typeof iv === 'string') iv = Buffer.from(iv)\n if (config.mode !== 'GCM' && iv.length !== config.iv) throw new TypeError('invalid iv length ' + iv.length)\n\n if (config.type === 'stream') {\n return new StreamCipher(config.module, password, iv)\n } else if (config.type === 'auth') {\n return new AuthCipher(config.module, password, iv)\n }\n\n return new Cipher(config.module, password, iv)\n}\n\nfunction createCipher (suite, password) {\n var config = MODES[suite.toLowerCase()]\n if (!config) throw new TypeError('invalid suite type')\n\n var keys = ebtk(password, false, config.key, config.iv)\n return createCipheriv(suite, keys.key, keys.iv)\n}\n\nexports.createCipheriv = createCipheriv\nexports.createCipher = createCipher\n","var Buffer = require('safe-buffer').Buffer\nvar ZEROES = Buffer.alloc(16, 0)\n\nfunction toArray (buf) {\n return [\n buf.readUInt32BE(0),\n buf.readUInt32BE(4),\n buf.readUInt32BE(8),\n buf.readUInt32BE(12)\n ]\n}\n\nfunction fromArray (out) {\n var buf = Buffer.allocUnsafe(16)\n buf.writeUInt32BE(out[0] >>> 0, 0)\n buf.writeUInt32BE(out[1] >>> 0, 4)\n buf.writeUInt32BE(out[2] >>> 0, 8)\n buf.writeUInt32BE(out[3] >>> 0, 12)\n return buf\n}\n\nfunction GHASH (key) {\n this.h = key\n this.state = Buffer.alloc(16, 0)\n this.cache = Buffer.allocUnsafe(0)\n}\n\n// from http://bitwiseshiftleft.github.io/sjcl/doc/symbols/src/core_gcm.js.html\n// by Juho Vähä-Herttua\nGHASH.prototype.ghash = function (block) {\n var i = -1\n while (++i < block.length) {\n this.state[i] ^= block[i]\n }\n this._multiply()\n}\n\nGHASH.prototype._multiply = function () {\n var Vi = toArray(this.h)\n var Zi = [0, 0, 0, 0]\n var j, xi, lsbVi\n var i = -1\n while (++i < 128) {\n xi = (this.state[~~(i / 8)] & (1 << (7 - (i % 8)))) !== 0\n if (xi) {\n // Z_i+1 = Z_i ^ V_i\n Zi[0] ^= Vi[0]\n Zi[1] ^= Vi[1]\n Zi[2] ^= Vi[2]\n Zi[3] ^= Vi[3]\n }\n\n // Store the value of LSB(V_i)\n lsbVi = (Vi[3] & 1) !== 0\n\n // V_i+1 = V_i >> 1\n for (j = 3; j > 0; j--) {\n Vi[j] = (Vi[j] >>> 1) | ((Vi[j - 1] & 1) << 31)\n }\n Vi[0] = Vi[0] >>> 1\n\n // If LSB(V_i) is 1, V_i+1 = (V_i >> 1) ^ R\n if (lsbVi) {\n Vi[0] = Vi[0] ^ (0xe1 << 24)\n }\n }\n this.state = fromArray(Zi)\n}\n\nGHASH.prototype.update = function (buf) {\n this.cache = Buffer.concat([this.cache, buf])\n var chunk\n while (this.cache.length >= 16) {\n chunk = this.cache.slice(0, 16)\n this.cache = this.cache.slice(16)\n this.ghash(chunk)\n }\n}\n\nGHASH.prototype.final = function (abl, bl) {\n if (this.cache.length) {\n this.ghash(Buffer.concat([this.cache, ZEROES], 16))\n }\n\n this.ghash(fromArray([0, abl, 0, bl]))\n return this.state\n}\n\nmodule.exports = GHASH\n","function incr32 (iv) {\n var len = iv.length\n var item\n while (len--) {\n item = iv.readUInt8(len)\n if (item === 255) {\n iv.writeUInt8(0, len)\n } else {\n item++\n iv.writeUInt8(item, len)\n break\n }\n }\n}\nmodule.exports = incr32\n","var xor = require('buffer-xor')\n\nexports.encrypt = function (self, block) {\n var data = xor(block, self._prev)\n\n self._prev = self._cipher.encryptBlock(data)\n return self._prev\n}\n\nexports.decrypt = function (self, block) {\n var pad = self._prev\n\n self._prev = block\n var out = self._cipher.decryptBlock(block)\n\n return xor(out, pad)\n}\n","var Buffer = require('safe-buffer').Buffer\nvar xor = require('buffer-xor')\n\nfunction encryptStart (self, data, decrypt) {\n var len = data.length\n var out = xor(data, self._cache)\n self._cache = self._cache.slice(len)\n self._prev = Buffer.concat([self._prev, decrypt ? data : out])\n return out\n}\n\nexports.encrypt = function (self, data, decrypt) {\n var out = Buffer.allocUnsafe(0)\n var len\n\n while (data.length) {\n if (self._cache.length === 0) {\n self._cache = self._cipher.encryptBlock(self._prev)\n self._prev = Buffer.allocUnsafe(0)\n }\n\n if (self._cache.length <= data.length) {\n len = self._cache.length\n out = Buffer.concat([out, encryptStart(self, data.slice(0, len), decrypt)])\n data = data.slice(len)\n } else {\n out = Buffer.concat([out, encryptStart(self, data, decrypt)])\n break\n }\n }\n\n return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n var pad\n var i = -1\n var len = 8\n var out = 0\n var bit, value\n while (++i < len) {\n pad = self._cipher.encryptBlock(self._prev)\n bit = (byteParam & (1 << (7 - i))) ? 0x80 : 0\n value = pad[0] ^ bit\n out += ((value & 0x80) >> (i % 8))\n self._prev = shiftIn(self._prev, decrypt ? bit : value)\n }\n return out\n}\n\nfunction shiftIn (buffer, value) {\n var len = buffer.length\n var i = -1\n var out = Buffer.allocUnsafe(buffer.length)\n buffer = Buffer.concat([buffer, Buffer.from([value])])\n\n while (++i < len) {\n out[i] = buffer[i] << 1 | buffer[i + 1] >> (7)\n }\n\n return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n var len = chunk.length\n var out = Buffer.allocUnsafe(len)\n var i = -1\n\n while (++i < len) {\n out[i] = encryptByte(self, chunk[i], decrypt)\n }\n\n return out\n}\n","var Buffer = require('safe-buffer').Buffer\n\nfunction encryptByte (self, byteParam, decrypt) {\n var pad = self._cipher.encryptBlock(self._prev)\n var out = pad[0] ^ byteParam\n\n self._prev = Buffer.concat([\n self._prev.slice(1),\n Buffer.from([decrypt ? byteParam : out])\n ])\n\n return out\n}\n\nexports.encrypt = function (self, chunk, decrypt) {\n var len = chunk.length\n var out = Buffer.allocUnsafe(len)\n var i = -1\n\n while (++i < len) {\n out[i] = encryptByte(self, chunk[i], decrypt)\n }\n\n return out\n}\n","var xor = require('buffer-xor')\nvar Buffer = require('safe-buffer').Buffer\nvar incr32 = require('../incr32')\n\nfunction getBlock (self) {\n var out = self._cipher.encryptBlockRaw(self._prev)\n incr32(self._prev)\n return out\n}\n\nvar blockSize = 16\nexports.encrypt = function (self, chunk) {\n var chunkNum = Math.ceil(chunk.length / blockSize)\n var start = self._cache.length\n self._cache = Buffer.concat([\n self._cache,\n 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 self._cache.writeUInt32BE(out[0], offset + 0)\n self._cache.writeUInt32BE(out[1], offset + 4)\n self._cache.writeUInt32BE(out[2], offset + 8)\n self._cache.writeUInt32BE(out[3], offset + 12)\n }\n var pad = self._cache.slice(0, chunk.length)\n self._cache = self._cache.slice(chunk.length)\n return xor(chunk, pad)\n}\n","exports.encrypt = function (self, block) {\n return self._cipher.encryptBlock(block)\n}\n\nexports.decrypt = function (self, block) {\n return self._cipher.decryptBlock(block)\n}\n","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\n","var xor = require('buffer-xor')\n\nfunction getBlock (self) {\n self._prev = self._cipher.encryptBlock(self._prev)\n return self._prev\n}\n\nexports.encrypt = function (self, chunk) {\n while (self._cache.length < chunk.length) {\n self._cache = Buffer.concat([self._cache, getBlock(self)])\n }\n\n var pad = self._cache.slice(0, chunk.length)\n self._cache = self._cache.slice(chunk.length)\n return xor(chunk, pad)\n}\n","var aes = require('./aes')\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('cipher-base')\nvar inherits = require('inherits')\n\nfunction StreamCipher (mode, key, iv, decrypt) {\n Transform.call(this)\n\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\n","var DES = require('browserify-des')\nvar aes = require('browserify-aes/browser')\nvar aesModes = require('browserify-aes/modes')\nvar desModes = require('browserify-des/modes')\nvar ebtk = require('evp_bytestokey')\n\nfunction createCipher (suite, password) {\n suite = suite.toLowerCase()\n\n var keyLen, ivLen\n if (aesModes[suite]) {\n keyLen = aesModes[suite].key\n ivLen = aesModes[suite].iv\n } else if (desModes[suite]) {\n keyLen = desModes[suite].key * 8\n ivLen = desModes[suite].iv\n } else {\n throw new TypeError('invalid suite type')\n }\n\n var keys = ebtk(password, false, keyLen, ivLen)\n return createCipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createDecipher (suite, password) {\n suite = suite.toLowerCase()\n\n var keyLen, ivLen\n if (aesModes[suite]) {\n keyLen = aesModes[suite].key\n ivLen = aesModes[suite].iv\n } else if (desModes[suite]) {\n keyLen = desModes[suite].key * 8\n ivLen = desModes[suite].iv\n } else {\n throw new TypeError('invalid suite type')\n }\n\n var keys = ebtk(password, false, keyLen, ivLen)\n return createDecipheriv(suite, keys.key, keys.iv)\n}\n\nfunction createCipheriv (suite, key, iv) {\n suite = suite.toLowerCase()\n if (aesModes[suite]) return aes.createCipheriv(suite, key, iv)\n if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite })\n\n throw new TypeError('invalid suite type')\n}\n\nfunction createDecipheriv (suite, key, iv) {\n suite = suite.toLowerCase()\n if (aesModes[suite]) return aes.createDecipheriv(suite, key, iv)\n if (desModes[suite]) return new DES({ key: key, iv: iv, mode: suite, decrypt: true })\n\n throw new TypeError('invalid suite type')\n}\n\nfunction getCiphers () {\n return Object.keys(desModes).concat(aes.getCiphers())\n}\n\nexports.createCipher = exports.Cipher = createCipher\nexports.createCipheriv = exports.Cipheriv = createCipheriv\nexports.createDecipher = exports.Decipher = createDecipher\nexports.createDecipheriv = exports.Decipheriv = createDecipheriv\nexports.listCiphers = exports.getCiphers = getCiphers\n","var CipherBase = require('cipher-base')\nvar des = require('des.js')\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar modes = {\n 'des-ede3-cbc': des.CBC.instantiate(des.EDE),\n 'des-ede3': des.EDE,\n 'des-ede-cbc': des.CBC.instantiate(des.EDE),\n 'des-ede': des.EDE,\n 'des-cbc': des.CBC.instantiate(des.DES),\n 'des-ecb': des.DES\n}\nmodes.des = modes['des-cbc']\nmodes.des3 = modes['des-ede3-cbc']\nmodule.exports = DES\ninherits(DES, CipherBase)\nfunction DES (opts) {\n CipherBase.call(this)\n var modeName = opts.mode.toLowerCase()\n var mode = modes[modeName]\n var type\n if (opts.decrypt) {\n type = 'decrypt'\n } else {\n type = 'encrypt'\n }\n var key = opts.key\n if (!Buffer.isBuffer(key)) {\n key = Buffer.from(key)\n }\n if (modeName === 'des-ede' || modeName === 'des-ede-cbc') {\n key = Buffer.concat([key, key.slice(0, 8)])\n }\n var iv = opts.iv\n if (!Buffer.isBuffer(iv)) {\n iv = Buffer.from(iv)\n }\n this._des = mode.create({\n key: key,\n iv: iv,\n type: type\n })\n}\nDES.prototype._update = function (data) {\n return Buffer.from(this._des.update(data))\n}\nDES.prototype._final = function () {\n return Buffer.from(this._des.final())\n}\n","exports['des-ecb'] = {\n key: 8,\n iv: 0\n}\nexports['des-cbc'] = exports.des = {\n key: 8,\n iv: 8\n}\nexports['des-ede3-cbc'] = exports.des3 = {\n key: 24,\n iv: 8\n}\nexports['des-ede3'] = {\n key: 24,\n iv: 0\n}\nexports['des-ede-cbc'] = {\n key: 16,\n iv: 8\n}\nexports['des-ede'] = {\n key: 16,\n iv: 0\n}\n","var BN = require('bn.js')\nvar randomBytes = require('randombytes')\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 { blinder: blinder, unblinder: r.invm(priv.modulus) }\n}\n\nfunction getr (priv) {\n var len = priv.modulus.byteLength()\n var r\n do {\n r = new BN(randomBytes(len))\n } while (r.cmp(priv.modulus) >= 0 || !r.umod(priv.prime1) || !r.umod(priv.prime2))\n return r\n}\n\nfunction crt (msg, priv) {\n var blinds = blind(priv)\n var len = priv.modulus.byteLength()\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).fromRed()\n var m2 = c2.redPow(priv.exponent2).fromRed()\n var h = m1.isub(m2).imul(qinv).umod(p).imul(q)\n return m2.iadd(h).imul(blinds.unblinder).umod(priv.modulus).toArrayLike(Buffer, 'be', len)\n}\ncrt.getr = getr\n\nmodule.exports = crt\n","module.exports = require('./browser/algorithms.json')\n","var Buffer = require('safe-buffer').Buffer\nvar createHash = require('create-hash')\nvar stream = require('readable-stream')\nvar inherits = require('inherits')\nvar sign = require('./sign')\nvar verify = require('./verify')\n\nvar algorithms = require('./algorithms.json')\nObject.keys(algorithms).forEach(function (key) {\n algorithms[key].id = Buffer.from(algorithms[key].id, 'hex')\n algorithms[key.toLowerCase()] = algorithms[key]\n})\n\nfunction Sign (algorithm) {\n stream.Writable.call(this)\n\n var data = algorithms[algorithm]\n if (!data) throw new Error('Unknown message digest')\n\n this._hashType = data.hash\n this._hash = createHash(data.hash)\n this._tag = data.id\n this._signType = data.sign\n}\ninherits(Sign, stream.Writable)\n\nSign.prototype._write = function _write (data, _, done) {\n this._hash.update(data)\n done()\n}\n\nSign.prototype.update = function update (data, enc) {\n if (typeof data === 'string') data = Buffer.from(data, enc)\n\n this._hash.update(data)\n return this\n}\n\nSign.prototype.sign = function signMethod (key, enc) {\n this.end()\n var hash = this._hash.digest()\n var sig = sign(hash, key, this._hashType, this._signType, this._tag)\n\n return enc ? sig.toString(enc) : sig\n}\n\nfunction Verify (algorithm) {\n stream.Writable.call(this)\n\n var data = algorithms[algorithm]\n if (!data) throw new Error('Unknown message digest')\n\n this._hash = createHash(data.hash)\n this._tag = data.id\n this._signType = data.sign\n}\ninherits(Verify, stream.Writable)\n\nVerify.prototype._write = function _write (data, _, done) {\n this._hash.update(data)\n done()\n}\n\nVerify.prototype.update = function update (data, enc) {\n if (typeof data === 'string') data = Buffer.from(data, enc)\n\n this._hash.update(data)\n return this\n}\n\nVerify.prototype.verify = function verifyMethod (key, sig, enc) {\n if (typeof sig === 'string') sig = Buffer.from(sig, enc)\n\n this.end()\n var hash = this._hash.digest()\n return verify(sig, hash, key, this._signType, this._tag)\n}\n\nfunction createSign (algorithm) {\n return new Sign(algorithm)\n}\n\nfunction createVerify (algorithm) {\n return new Verify(algorithm)\n}\n\nmodule.exports = {\n Sign: createSign,\n Verify: createVerify,\n createSign: createSign,\n createVerify: createVerify\n}\n","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer\nvar createHmac = require('create-hmac')\nvar crt = require('browserify-rsa')\nvar EC = require('elliptic').ec\nvar BN = require('bn.js')\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction sign (hash, key, hashType, signType, tag) {\n var priv = parseKeys(key)\n if (priv.curve) {\n // rsa keys can be interpreted as ecdsa ones in openssl\n if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n return ecSign(hash, priv)\n } else if (priv.type === 'dsa') {\n if (signType !== 'dsa') throw new Error('wrong private key type')\n return dsaSign(hash, priv, hashType)\n } else {\n if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong private key type')\n }\n hash = Buffer.concat([tag, hash])\n var len = priv.modulus.byteLength()\n var pad = [0, 1]\n while (hash.length + pad.length + 1 < len) pad.push(0xff)\n pad.push(0x00)\n var i = -1\n while (++i < hash.length) pad.push(hash[i])\n\n var out = crt(pad, priv)\n return out\n}\n\nfunction ecSign (hash, priv) {\n var curveId = curves[priv.curve.join('.')]\n if (!curveId) throw new Error('unknown curve ' + priv.curve.join('.'))\n\n var curve = new EC(curveId)\n var key = curve.keyFromPrivate(priv.privateKey)\n var out = key.sign(hash)\n\n return Buffer.from(out.toDER())\n}\n\nfunction dsaSign (hash, priv, algo) {\n var x = priv.params.priv_key\n var p = priv.params.p\n var q = priv.params.q\n var g = priv.params.g\n var r = new BN(0)\n var k\n var H = bits2int(hash, q).mod(q)\n var s = false\n var kv = getKey(x, q, hash, algo)\n while (s === false) {\n k = makeKey(q, kv, algo)\n r = makeR(g, k, p, q)\n s = k.invm(q).imul(H.add(x.mul(r))).mod(q)\n if (s.cmpn(0) === 0) {\n s = false\n r = new BN(0)\n }\n }\n return toDER(r, s)\n}\n\nfunction toDER (r, s) {\n r = r.toArray()\n s = s.toArray()\n\n // Pad values\n if (r[0] & 0x80) r = [0].concat(r)\n if (s[0] & 0x80) s = [0].concat(s)\n\n var total = r.length + s.length + 4\n var res = [0x30, total, 0x02, r.length]\n res = res.concat(r, [0x02, s.length], s)\n return Buffer.from(res)\n}\n\nfunction getKey (x, q, hash, algo) {\n x = Buffer.from(x.toArray())\n if (x.length < q.byteLength()) {\n var zeros = Buffer.alloc(q.byteLength() - x.length)\n x = Buffer.concat([zeros, x])\n }\n var hlen = hash.length\n var hbits = bits2octets(hash, q)\n var v = Buffer.alloc(hlen)\n v.fill(1)\n var k = Buffer.alloc(hlen)\n k = createHmac(algo, k).update(v).update(Buffer.from([0])).update(x).update(hbits).digest()\n v = createHmac(algo, k).update(v).digest()\n k = createHmac(algo, k).update(v).update(Buffer.from([1])).update(x).update(hbits).digest()\n v = createHmac(algo, k).update(v).digest()\n return { k: k, v: v }\n}\n\nfunction bits2int (obits, q) {\n var bits = new BN(obits)\n var shift = (obits.length << 3) - q.bitLength()\n if (shift > 0) bits.ishrn(shift)\n return bits\n}\n\nfunction bits2octets (bits, q) {\n bits = bits2int(bits, q)\n bits = bits.mod(q)\n var out = Buffer.from(bits.toArray())\n if (out.length < q.byteLength()) {\n var zeros = Buffer.alloc(q.byteLength() - out.length)\n out = Buffer.concat([zeros, out])\n }\n return out\n}\n\nfunction makeKey (q, kv, algo) {\n var t\n var k\n\n do {\n t = Buffer.alloc(0)\n\n while (t.length * 8 < q.bitLength()) {\n kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n t = Buffer.concat([t, kv.v])\n }\n\n k = bits2int(t, q)\n kv.k = createHmac(algo, kv.k).update(kv.v).update(Buffer.from([0])).digest()\n kv.v = createHmac(algo, kv.k).update(kv.v).digest()\n } while (k.cmp(q) !== -1)\n\n return k\n}\n\nfunction makeR (g, k, p, q) {\n return g.toRed(BN.mont(p)).redPow(k).fromRed().mod(q)\n}\n\nmodule.exports = sign\nmodule.exports.getKey = getKey\nmodule.exports.makeKey = makeKey\n","// much of this based on https://github.com/indutny/self-signed/blob/gh-pages/lib/rsa.js\nvar Buffer = require('safe-buffer').Buffer\nvar BN = require('bn.js')\nvar EC = require('elliptic').ec\nvar parseKeys = require('parse-asn1')\nvar curves = require('./curves.json')\n\nfunction verify (sig, hash, key, signType, tag) {\n var pub = parseKeys(key)\n if (pub.type === 'ec') {\n // rsa keys can be interpreted as ecdsa ones in openssl\n if (signType !== 'ecdsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n return ecVerify(sig, hash, pub)\n } else if (pub.type === 'dsa') {\n if (signType !== 'dsa') throw new Error('wrong public key type')\n return dsaVerify(sig, hash, pub)\n } else {\n if (signType !== 'rsa' && signType !== 'ecdsa/rsa') throw new Error('wrong public key type')\n }\n hash = Buffer.concat([tag, hash])\n var len = pub.modulus.byteLength()\n var pad = [1]\n var padNum = 0\n while (hash.length + pad.length + 2 < len) {\n pad.push(0xff)\n padNum++\n }\n pad.push(0x00)\n var i = -1\n while (++i < hash.length) {\n pad.push(hash[i])\n }\n pad = Buffer.from(pad)\n var red = BN.mont(pub.modulus)\n sig = new BN(sig).toRed(red)\n\n sig = sig.redPow(new BN(pub.publicExponent))\n sig = Buffer.from(sig.fromRed().toArray())\n var out = padNum < 8 ? 1 : 0\n len = Math.min(sig.length, pad.length)\n if (sig.length !== pad.length) out = 1\n\n i = -1\n while (++i < len) out |= sig[i] ^ pad[i]\n return out === 0\n}\n\nfunction ecVerify (sig, hash, pub) {\n var curveId = curves[pub.data.algorithm.curve.join('.')]\n if (!curveId) throw new Error('unknown curve ' + pub.data.algorithm.curve.join('.'))\n\n var curve = new EC(curveId)\n var pubkey = pub.data.subjectPrivateKey.data\n\n return curve.verify(hash, sig, pubkey)\n}\n\nfunction dsaVerify (sig, hash, pub) {\n var p = pub.data.p\n var q = pub.data.q\n var g = pub.data.g\n var y = pub.data.pub_key\n var unpacked = parseKeys.signature.decode(sig, 'der')\n var s = unpacked.s\n var r = unpacked.r\n checkValue(s, q)\n checkValue(r, q)\n var montp = BN.mont(p)\n var w = s.invm(q)\n var v = g.toRed(montp)\n .redPow(new BN(hash).mul(w).mod(q))\n .fromRed()\n .mul(y.toRed(montp).redPow(r.mul(w).mod(q)).fromRed())\n .mod(p)\n .mod(q)\n return v.cmp(r) === 0\n}\n\nfunction checkValue (b, q) {\n if (b.cmpn(0) <= 0) throw new Error('invalid sig')\n if (b.cmp(q) >= q) throw new Error('invalid sig')\n}\n\nmodule.exports = verify\n","'use strict';\n/* eslint camelcase: \"off\" */\n\nvar assert = require('assert');\n\nvar Zstream = require('pako/lib/zlib/zstream');\nvar zlib_deflate = require('pako/lib/zlib/deflate.js');\nvar zlib_inflate = require('pako/lib/zlib/inflate.js');\nvar constants = require('pako/lib/zlib/constants');\n\nfor (var key in constants) {\n exports[key] = constants[key];\n}\n\n// zlib modes\nexports.NONE = 0;\nexports.DEFLATE = 1;\nexports.INFLATE = 2;\nexports.GZIP = 3;\nexports.GUNZIP = 4;\nexports.DEFLATERAW = 5;\nexports.INFLATERAW = 6;\nexports.UNZIP = 7;\n\nvar GZIP_HEADER_ID1 = 0x1f;\nvar GZIP_HEADER_ID2 = 0x8b;\n\n/**\n * Emulate Node's zlib C++ layer for use by the JS layer in index.js\n */\nfunction Zlib(mode) {\n if (typeof mode !== 'number' || mode < exports.DEFLATE || mode > exports.UNZIP) {\n throw new TypeError('Bad argument');\n }\n\n this.dictionary = null;\n this.err = 0;\n this.flush = 0;\n this.init_done = false;\n this.level = 0;\n this.memLevel = 0;\n this.mode = mode;\n this.strategy = 0;\n this.windowBits = 0;\n this.write_in_progress = false;\n this.pending_close = false;\n this.gzip_id_bytes_read = 0;\n}\n\nZlib.prototype.close = function () {\n if (this.write_in_progress) {\n this.pending_close = true;\n return;\n }\n\n this.pending_close = false;\n\n assert(this.init_done, 'close before init');\n assert(this.mode <= exports.UNZIP);\n\n if (this.mode === exports.DEFLATE || this.mode === exports.GZIP || this.mode === exports.DEFLATERAW) {\n zlib_deflate.deflateEnd(this.strm);\n } else if (this.mode === exports.INFLATE || this.mode === exports.GUNZIP || this.mode === exports.INFLATERAW || this.mode === exports.UNZIP) {\n zlib_inflate.inflateEnd(this.strm);\n }\n\n this.mode = exports.NONE;\n\n this.dictionary = null;\n};\n\nZlib.prototype.write = function (flush, input, in_off, in_len, out, out_off, out_len) {\n return this._write(true, flush, input, in_off, in_len, out, out_off, out_len);\n};\n\nZlib.prototype.writeSync = function (flush, input, in_off, in_len, out, out_off, out_len) {\n return this._write(false, flush, input, in_off, in_len, out, out_off, out_len);\n};\n\nZlib.prototype._write = function (async, flush, input, in_off, in_len, out, out_off, out_len) {\n assert.equal(arguments.length, 8);\n\n assert(this.init_done, 'write before init');\n assert(this.mode !== exports.NONE, 'already finalized');\n assert.equal(false, this.write_in_progress, 'write already in progress');\n assert.equal(false, this.pending_close, 'close is pending');\n\n this.write_in_progress = true;\n\n assert.equal(false, flush === undefined, 'must provide flush value');\n\n this.write_in_progress = true;\n\n if (flush !== exports.Z_NO_FLUSH && flush !== exports.Z_PARTIAL_FLUSH && flush !== exports.Z_SYNC_FLUSH && flush !== exports.Z_FULL_FLUSH && flush !== exports.Z_FINISH && flush !== exports.Z_BLOCK) {\n throw new Error('Invalid flush value');\n }\n\n if (input == null) {\n input = Buffer.alloc(0);\n in_len = 0;\n in_off = 0;\n }\n\n this.strm.avail_in = in_len;\n this.strm.input = input;\n this.strm.next_in = in_off;\n this.strm.avail_out = out_len;\n this.strm.output = out;\n this.strm.next_out = out_off;\n this.flush = flush;\n\n if (!async) {\n // sync version\n this._process();\n\n if (this._checkError()) {\n return this._afterSync();\n }\n return;\n }\n\n // async version\n var self = this;\n process.nextTick(function () {\n self._process();\n self._after();\n });\n\n return this;\n};\n\nZlib.prototype._afterSync = function () {\n var avail_out = this.strm.avail_out;\n var avail_in = this.strm.avail_in;\n\n this.write_in_progress = false;\n\n return [avail_in, avail_out];\n};\n\nZlib.prototype._process = function () {\n var next_expected_header_byte = null;\n\n // If the avail_out is left at 0, then it means that it ran out\n // of room. If there was avail_out left over, then it means\n // that all of the input was consumed.\n switch (this.mode) {\n case exports.DEFLATE:\n case exports.GZIP:\n case exports.DEFLATERAW:\n this.err = zlib_deflate.deflate(this.strm, this.flush);\n break;\n case exports.UNZIP:\n if (this.strm.avail_in > 0) {\n next_expected_header_byte = this.strm.next_in;\n }\n\n switch (this.gzip_id_bytes_read) {\n case 0:\n if (next_expected_header_byte === null) {\n break;\n }\n\n if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID1) {\n this.gzip_id_bytes_read = 1;\n next_expected_header_byte++;\n\n if (this.strm.avail_in === 1) {\n // The only available byte was already read.\n break;\n }\n } else {\n this.mode = exports.INFLATE;\n break;\n }\n\n // fallthrough\n case 1:\n if (next_expected_header_byte === null) {\n break;\n }\n\n if (this.strm.input[next_expected_header_byte] === GZIP_HEADER_ID2) {\n this.gzip_id_bytes_read = 2;\n this.mode = exports.GUNZIP;\n } else {\n // There is no actual difference between INFLATE and INFLATERAW\n // (after initialization).\n this.mode = exports.INFLATE;\n }\n\n break;\n default:\n throw new Error('invalid number of gzip magic number bytes read');\n }\n\n // fallthrough\n case exports.INFLATE:\n case exports.GUNZIP:\n case exports.INFLATERAW:\n this.err = zlib_inflate.inflate(this.strm, this.flush\n\n // If data was encoded with dictionary\n );if (this.err === exports.Z_NEED_DICT && this.dictionary) {\n // Load it\n this.err = zlib_inflate.inflateSetDictionary(this.strm, this.dictionary);\n if (this.err === exports.Z_OK) {\n // And try to decode again\n this.err = zlib_inflate.inflate(this.strm, this.flush);\n } else if (this.err === exports.Z_DATA_ERROR) {\n // Both inflateSetDictionary() and inflate() return Z_DATA_ERROR.\n // Make it possible for After() to tell a bad dictionary from bad\n // input.\n this.err = exports.Z_NEED_DICT;\n }\n }\n while (this.strm.avail_in > 0 && this.mode === exports.GUNZIP && this.err === exports.Z_STREAM_END && this.strm.next_in[0] !== 0x00) {\n // Bytes remain in input buffer. Perhaps this is another compressed\n // member in the same archive, or just trailing garbage.\n // Trailing zero bytes are okay, though, since they are frequently\n // used for padding.\n\n this.reset();\n this.err = zlib_inflate.inflate(this.strm, this.flush);\n }\n break;\n default:\n throw new Error('Unknown mode ' + this.mode);\n }\n};\n\nZlib.prototype._checkError = function () {\n // Acceptable error states depend on the type of zlib stream.\n switch (this.err) {\n case exports.Z_OK:\n case exports.Z_BUF_ERROR:\n if (this.strm.avail_out !== 0 && this.flush === exports.Z_FINISH) {\n this._error('unexpected end of file');\n return false;\n }\n break;\n case exports.Z_STREAM_END:\n // normal statuses, not fatal\n break;\n case exports.Z_NEED_DICT:\n if (this.dictionary == null) {\n this._error('Missing dictionary');\n } else {\n this._error('Bad dictionary');\n }\n return false;\n default:\n // something else.\n this._error('Zlib error');\n return false;\n }\n\n return true;\n};\n\nZlib.prototype._after = function () {\n if (!this._checkError()) {\n return;\n }\n\n var avail_out = this.strm.avail_out;\n var avail_in = this.strm.avail_in;\n\n this.write_in_progress = false;\n\n // call the write() cb\n this.callback(avail_in, avail_out);\n\n if (this.pending_close) {\n this.close();\n }\n};\n\nZlib.prototype._error = function (message) {\n if (this.strm.msg) {\n message = this.strm.msg;\n }\n this.onerror(message, this.err\n\n // no hope of rescue.\n );this.write_in_progress = false;\n if (this.pending_close) {\n this.close();\n }\n};\n\nZlib.prototype.init = function (windowBits, level, memLevel, strategy, dictionary) {\n assert(arguments.length === 4 || arguments.length === 5, 'init(windowBits, level, memLevel, strategy, [dictionary])');\n\n assert(windowBits >= 8 && windowBits <= 15, 'invalid windowBits');\n assert(level >= -1 && level <= 9, 'invalid compression level');\n\n assert(memLevel >= 1 && memLevel <= 9, 'invalid memlevel');\n\n assert(strategy === exports.Z_FILTERED || strategy === exports.Z_HUFFMAN_ONLY || strategy === exports.Z_RLE || strategy === exports.Z_FIXED || strategy === exports.Z_DEFAULT_STRATEGY, 'invalid strategy');\n\n this._init(level, windowBits, memLevel, strategy, dictionary);\n this._setDictionary();\n};\n\nZlib.prototype.params = function () {\n throw new Error('deflateParams Not supported');\n};\n\nZlib.prototype.reset = function () {\n this._reset();\n this._setDictionary();\n};\n\nZlib.prototype._init = function (level, windowBits, memLevel, strategy, dictionary) {\n this.level = level;\n this.windowBits = windowBits;\n this.memLevel = memLevel;\n this.strategy = strategy;\n\n this.flush = exports.Z_NO_FLUSH;\n\n this.err = exports.Z_OK;\n\n if (this.mode === exports.GZIP || this.mode === exports.GUNZIP) {\n this.windowBits += 16;\n }\n\n if (this.mode === exports.UNZIP) {\n this.windowBits += 32;\n }\n\n if (this.mode === exports.DEFLATERAW || this.mode === exports.INFLATERAW) {\n this.windowBits = -1 * this.windowBits;\n }\n\n this.strm = new Zstream();\n\n switch (this.mode) {\n case exports.DEFLATE:\n case exports.GZIP:\n case exports.DEFLATERAW:\n this.err = zlib_deflate.deflateInit2(this.strm, this.level, exports.Z_DEFLATED, this.windowBits, this.memLevel, this.strategy);\n break;\n case exports.INFLATE:\n case exports.GUNZIP:\n case exports.INFLATERAW:\n case exports.UNZIP:\n this.err = zlib_inflate.inflateInit2(this.strm, this.windowBits);\n break;\n default:\n throw new Error('Unknown mode ' + this.mode);\n }\n\n if (this.err !== exports.Z_OK) {\n this._error('Init error');\n }\n\n this.dictionary = dictionary;\n\n this.write_in_progress = false;\n this.init_done = true;\n};\n\nZlib.prototype._setDictionary = function () {\n if (this.dictionary == null) {\n return;\n }\n\n this.err = exports.Z_OK;\n\n switch (this.mode) {\n case exports.DEFLATE:\n case exports.DEFLATERAW:\n this.err = zlib_deflate.deflateSetDictionary(this.strm, this.dictionary);\n break;\n default:\n break;\n }\n\n if (this.err !== exports.Z_OK) {\n this._error('Failed to set dictionary');\n }\n};\n\nZlib.prototype._reset = function () {\n this.err = exports.Z_OK;\n\n switch (this.mode) {\n case exports.DEFLATE:\n case exports.DEFLATERAW:\n case exports.GZIP:\n this.err = zlib_deflate.deflateReset(this.strm);\n break;\n case exports.INFLATE:\n case exports.INFLATERAW:\n case exports.GUNZIP:\n this.err = zlib_inflate.inflateReset(this.strm);\n break;\n default:\n break;\n }\n\n if (this.err !== exports.Z_OK) {\n this._error('Failed to reset stream');\n }\n};\n\nexports.Zlib = Zlib;","'use strict';\n\nvar Buffer = require('buffer').Buffer;\nvar Transform = require('stream').Transform;\nvar binding = require('./binding');\nvar util = require('util');\nvar assert = require('assert').ok;\nvar kMaxLength = require('buffer').kMaxLength;\nvar kRangeErrorMessage = 'Cannot create final Buffer. It would be larger ' + 'than 0x' + kMaxLength.toString(16) + ' bytes';\n\n// zlib doesn't provide these, so kludge them in following the same\n// const naming scheme zlib uses.\nbinding.Z_MIN_WINDOWBITS = 8;\nbinding.Z_MAX_WINDOWBITS = 15;\nbinding.Z_DEFAULT_WINDOWBITS = 15;\n\n// fewer than 64 bytes per chunk is stupid.\n// technically it could work with as few as 8, but even 64 bytes\n// is absurdly low. Usually a MB or more is best.\nbinding.Z_MIN_CHUNK = 64;\nbinding.Z_MAX_CHUNK = Infinity;\nbinding.Z_DEFAULT_CHUNK = 16 * 1024;\n\nbinding.Z_MIN_MEMLEVEL = 1;\nbinding.Z_MAX_MEMLEVEL = 9;\nbinding.Z_DEFAULT_MEMLEVEL = 8;\n\nbinding.Z_MIN_LEVEL = -1;\nbinding.Z_MAX_LEVEL = 9;\nbinding.Z_DEFAULT_LEVEL = binding.Z_DEFAULT_COMPRESSION;\n\n// expose all the zlib constants\nvar bkeys = Object.keys(binding);\nfor (var bk = 0; bk < bkeys.length; bk++) {\n var bkey = bkeys[bk];\n if (bkey.match(/^Z/)) {\n Object.defineProperty(exports, bkey, {\n enumerable: true, value: binding[bkey], writable: false\n });\n }\n}\n\n// translation table for return codes.\nvar codes = {\n Z_OK: binding.Z_OK,\n Z_STREAM_END: binding.Z_STREAM_END,\n Z_NEED_DICT: binding.Z_NEED_DICT,\n Z_ERRNO: binding.Z_ERRNO,\n Z_STREAM_ERROR: binding.Z_STREAM_ERROR,\n Z_DATA_ERROR: binding.Z_DATA_ERROR,\n Z_MEM_ERROR: binding.Z_MEM_ERROR,\n Z_BUF_ERROR: binding.Z_BUF_ERROR,\n Z_VERSION_ERROR: binding.Z_VERSION_ERROR\n};\n\nvar ckeys = Object.keys(codes);\nfor (var ck = 0; ck < ckeys.length; ck++) {\n var ckey = ckeys[ck];\n codes[codes[ckey]] = ckey;\n}\n\nObject.defineProperty(exports, 'codes', {\n enumerable: true, value: Object.freeze(codes), writable: false\n});\n\nexports.Deflate = Deflate;\nexports.Inflate = Inflate;\nexports.Gzip = Gzip;\nexports.Gunzip = Gunzip;\nexports.DeflateRaw = DeflateRaw;\nexports.InflateRaw = InflateRaw;\nexports.Unzip = Unzip;\n\nexports.createDeflate = function (o) {\n return new Deflate(o);\n};\n\nexports.createInflate = function (o) {\n return new Inflate(o);\n};\n\nexports.createDeflateRaw = function (o) {\n return new DeflateRaw(o);\n};\n\nexports.createInflateRaw = function (o) {\n return new InflateRaw(o);\n};\n\nexports.createGzip = function (o) {\n return new Gzip(o);\n};\n\nexports.createGunzip = function (o) {\n return new Gunzip(o);\n};\n\nexports.createUnzip = function (o) {\n return new Unzip(o);\n};\n\n// Convenience methods.\n// compress/decompress a string or buffer in one step.\nexports.deflate = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Deflate(opts), buffer, callback);\n};\n\nexports.deflateSync = function (buffer, opts) {\n return zlibBufferSync(new Deflate(opts), buffer);\n};\n\nexports.gzip = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Gzip(opts), buffer, callback);\n};\n\nexports.gzipSync = function (buffer, opts) {\n return zlibBufferSync(new Gzip(opts), buffer);\n};\n\nexports.deflateRaw = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new DeflateRaw(opts), buffer, callback);\n};\n\nexports.deflateRawSync = function (buffer, opts) {\n return zlibBufferSync(new DeflateRaw(opts), buffer);\n};\n\nexports.unzip = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Unzip(opts), buffer, callback);\n};\n\nexports.unzipSync = function (buffer, opts) {\n return zlibBufferSync(new Unzip(opts), buffer);\n};\n\nexports.inflate = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Inflate(opts), buffer, callback);\n};\n\nexports.inflateSync = function (buffer, opts) {\n return zlibBufferSync(new Inflate(opts), buffer);\n};\n\nexports.gunzip = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new Gunzip(opts), buffer, callback);\n};\n\nexports.gunzipSync = function (buffer, opts) {\n return zlibBufferSync(new Gunzip(opts), buffer);\n};\n\nexports.inflateRaw = function (buffer, opts, callback) {\n if (typeof opts === 'function') {\n callback = opts;\n opts = {};\n }\n return zlibBuffer(new InflateRaw(opts), buffer, callback);\n};\n\nexports.inflateRawSync = function (buffer, opts) {\n return zlibBufferSync(new InflateRaw(opts), buffer);\n};\n\nfunction zlibBuffer(engine, buffer, callback) {\n var buffers = [];\n var nread = 0;\n\n engine.on('error', onError);\n engine.on('end', onEnd);\n\n engine.end(buffer);\n flow();\n\n function flow() {\n var chunk;\n while (null !== (chunk = engine.read())) {\n buffers.push(chunk);\n nread += chunk.length;\n }\n engine.once('readable', flow);\n }\n\n function onError(err) {\n engine.removeListener('end', onEnd);\n engine.removeListener('readable', flow);\n callback(err);\n }\n\n function onEnd() {\n var buf;\n var err = null;\n\n if (nread >= kMaxLength) {\n err = new RangeError(kRangeErrorMessage);\n } else {\n buf = Buffer.concat(buffers, nread);\n }\n\n buffers = [];\n engine.close();\n callback(err, buf);\n }\n}\n\nfunction zlibBufferSync(engine, buffer) {\n if (typeof buffer === 'string') buffer = Buffer.from(buffer);\n\n if (!Buffer.isBuffer(buffer)) throw new TypeError('Not a string or buffer');\n\n var flushFlag = engine._finishFlushFlag;\n\n return engine._processChunk(buffer, flushFlag);\n}\n\n// generic zlib\n// minimal 2-byte header\nfunction Deflate(opts) {\n if (!(this instanceof Deflate)) return new Deflate(opts);\n Zlib.call(this, opts, binding.DEFLATE);\n}\n\nfunction Inflate(opts) {\n if (!(this instanceof Inflate)) return new Inflate(opts);\n Zlib.call(this, opts, binding.INFLATE);\n}\n\n// gzip - bigger header, same deflate compression\nfunction Gzip(opts) {\n if (!(this instanceof Gzip)) return new Gzip(opts);\n Zlib.call(this, opts, binding.GZIP);\n}\n\nfunction Gunzip(opts) {\n if (!(this instanceof Gunzip)) return new Gunzip(opts);\n Zlib.call(this, opts, binding.GUNZIP);\n}\n\n// raw - no header\nfunction DeflateRaw(opts) {\n if (!(this instanceof DeflateRaw)) return new DeflateRaw(opts);\n Zlib.call(this, opts, binding.DEFLATERAW);\n}\n\nfunction InflateRaw(opts) {\n if (!(this instanceof InflateRaw)) return new InflateRaw(opts);\n Zlib.call(this, opts, binding.INFLATERAW);\n}\n\n// auto-detect header.\nfunction Unzip(opts) {\n if (!(this instanceof Unzip)) return new Unzip(opts);\n Zlib.call(this, opts, binding.UNZIP);\n}\n\nfunction isValidFlushFlag(flag) {\n return flag === binding.Z_NO_FLUSH || flag === binding.Z_PARTIAL_FLUSH || flag === binding.Z_SYNC_FLUSH || flag === binding.Z_FULL_FLUSH || flag === binding.Z_FINISH || flag === binding.Z_BLOCK;\n}\n\n// the Zlib class they all inherit from\n// This thing manages the queue of requests, and returns\n// true or false if there is anything in the queue when\n// you call the .write() method.\n\nfunction Zlib(opts, mode) {\n var _this = this;\n\n this._opts = opts = opts || {};\n this._chunkSize = opts.chunkSize || exports.Z_DEFAULT_CHUNK;\n\n Transform.call(this, opts);\n\n if (opts.flush && !isValidFlushFlag(opts.flush)) {\n throw new Error('Invalid flush flag: ' + opts.flush);\n }\n if (opts.finishFlush && !isValidFlushFlag(opts.finishFlush)) {\n throw new Error('Invalid flush flag: ' + opts.finishFlush);\n }\n\n this._flushFlag = opts.flush || binding.Z_NO_FLUSH;\n this._finishFlushFlag = typeof opts.finishFlush !== 'undefined' ? opts.finishFlush : binding.Z_FINISH;\n\n if (opts.chunkSize) {\n if (opts.chunkSize < exports.Z_MIN_CHUNK || opts.chunkSize > exports.Z_MAX_CHUNK) {\n throw new Error('Invalid chunk size: ' + opts.chunkSize);\n }\n }\n\n if (opts.windowBits) {\n if (opts.windowBits < exports.Z_MIN_WINDOWBITS || opts.windowBits > exports.Z_MAX_WINDOWBITS) {\n throw new Error('Invalid windowBits: ' + opts.windowBits);\n }\n }\n\n if (opts.level) {\n if (opts.level < exports.Z_MIN_LEVEL || opts.level > exports.Z_MAX_LEVEL) {\n throw new Error('Invalid compression level: ' + opts.level);\n }\n }\n\n if (opts.memLevel) {\n if (opts.memLevel < exports.Z_MIN_MEMLEVEL || opts.memLevel > exports.Z_MAX_MEMLEVEL) {\n throw new Error('Invalid memLevel: ' + opts.memLevel);\n }\n }\n\n if (opts.strategy) {\n if (opts.strategy != exports.Z_FILTERED && opts.strategy != exports.Z_HUFFMAN_ONLY && opts.strategy != exports.Z_RLE && opts.strategy != exports.Z_FIXED && opts.strategy != exports.Z_DEFAULT_STRATEGY) {\n throw new Error('Invalid strategy: ' + opts.strategy);\n }\n }\n\n if (opts.dictionary) {\n if (!Buffer.isBuffer(opts.dictionary)) {\n throw new Error('Invalid dictionary: it should be a Buffer instance');\n }\n }\n\n this._handle = new binding.Zlib(mode);\n\n var self = this;\n this._hadError = false;\n this._handle.onerror = function (message, errno) {\n // there is no way to cleanly recover.\n // continuing only obscures problems.\n _close(self);\n self._hadError = true;\n\n var error = new Error(message);\n error.errno = errno;\n error.code = exports.codes[errno];\n self.emit('error', error);\n };\n\n var level = exports.Z_DEFAULT_COMPRESSION;\n if (typeof opts.level === 'number') level = opts.level;\n\n var strategy = exports.Z_DEFAULT_STRATEGY;\n if (typeof opts.strategy === 'number') strategy = opts.strategy;\n\n this._handle.init(opts.windowBits || exports.Z_DEFAULT_WINDOWBITS, level, opts.memLevel || exports.Z_DEFAULT_MEMLEVEL, strategy, opts.dictionary);\n\n this._buffer = Buffer.allocUnsafe(this._chunkSize);\n this._offset = 0;\n this._level = level;\n this._strategy = strategy;\n\n this.once('end', this.close);\n\n Object.defineProperty(this, '_closed', {\n get: function () {\n return !_this._handle;\n },\n configurable: true,\n enumerable: true\n });\n}\n\nutil.inherits(Zlib, Transform);\n\nZlib.prototype.params = function (level, strategy, callback) {\n if (level < exports.Z_MIN_LEVEL || level > exports.Z_MAX_LEVEL) {\n throw new RangeError('Invalid compression level: ' + level);\n }\n if (strategy != exports.Z_FILTERED && strategy != exports.Z_HUFFMAN_ONLY && strategy != exports.Z_RLE && strategy != exports.Z_FIXED && strategy != exports.Z_DEFAULT_STRATEGY) {\n throw new TypeError('Invalid strategy: ' + strategy);\n }\n\n if (this._level !== level || this._strategy !== strategy) {\n var self = this;\n this.flush(binding.Z_SYNC_FLUSH, function () {\n assert(self._handle, 'zlib binding closed');\n self._handle.params(level, strategy);\n if (!self._hadError) {\n self._level = level;\n self._strategy = strategy;\n if (callback) callback();\n }\n });\n } else {\n process.nextTick(callback);\n }\n};\n\nZlib.prototype.reset = function () {\n assert(this._handle, 'zlib binding closed');\n return this._handle.reset();\n};\n\n// This is the _flush function called by the transform class,\n// internally, when the last chunk has been written.\nZlib.prototype._flush = function (callback) {\n this._transform(Buffer.alloc(0), '', callback);\n};\n\nZlib.prototype.flush = function (kind, callback) {\n var _this2 = this;\n\n var ws = this._writableState;\n\n if (typeof kind === 'function' || kind === undefined && !callback) {\n callback = kind;\n kind = binding.Z_FULL_FLUSH;\n }\n\n if (ws.ended) {\n if (callback) process.nextTick(callback);\n } else if (ws.ending) {\n if (callback) this.once('end', callback);\n } else if (ws.needDrain) {\n if (callback) {\n this.once('drain', function () {\n return _this2.flush(kind, callback);\n });\n }\n } else {\n this._flushFlag = kind;\n this.write(Buffer.alloc(0), '', callback);\n }\n};\n\nZlib.prototype.close = function (callback) {\n _close(this, callback);\n process.nextTick(emitCloseNT, this);\n};\n\nfunction _close(engine, callback) {\n if (callback) process.nextTick(callback);\n\n // Caller may invoke .close after a zlib error (which will null _handle).\n if (!engine._handle) return;\n\n engine._handle.close();\n engine._handle = null;\n}\n\nfunction emitCloseNT(self) {\n self.emit('close');\n}\n\nZlib.prototype._transform = function (chunk, encoding, cb) {\n var flushFlag;\n var ws = this._writableState;\n var ending = ws.ending || ws.ended;\n var last = ending && (!chunk || ws.length === chunk.length);\n\n if (chunk !== null && !Buffer.isBuffer(chunk)) return cb(new Error('invalid input'));\n\n if (!this._handle) return cb(new Error('zlib binding closed'));\n\n // If it's the last chunk, or a final flush, we use the Z_FINISH flush flag\n // (or whatever flag was provided using opts.finishFlush).\n // If it's explicitly flushing at some other time, then we use\n // Z_FULL_FLUSH. Otherwise, use Z_NO_FLUSH for maximum compression\n // goodness.\n if (last) flushFlag = this._finishFlushFlag;else {\n flushFlag = this._flushFlag;\n // once we've flushed the last of the queue, stop flushing and\n // go back to the normal behavior.\n if (chunk.length >= ws.length) {\n this._flushFlag = this._opts.flush || binding.Z_NO_FLUSH;\n }\n }\n\n this._processChunk(chunk, flushFlag, cb);\n};\n\nZlib.prototype._processChunk = function (chunk, flushFlag, cb) {\n var availInBefore = chunk && chunk.length;\n var availOutBefore = this._chunkSize - this._offset;\n var inOff = 0;\n\n var self = this;\n\n var async = typeof cb === 'function';\n\n if (!async) {\n var buffers = [];\n var nread = 0;\n\n var error;\n this.on('error', function (er) {\n error = er;\n });\n\n assert(this._handle, 'zlib binding closed');\n do {\n var res = this._handle.writeSync(flushFlag, chunk, // in\n inOff, // in_off\n availInBefore, // in_len\n this._buffer, // out\n this._offset, //out_off\n availOutBefore); // out_len\n } while (!this._hadError && callback(res[0], res[1]));\n\n if (this._hadError) {\n throw error;\n }\n\n if (nread >= kMaxLength) {\n _close(this);\n throw new RangeError(kRangeErrorMessage);\n }\n\n var buf = Buffer.concat(buffers, nread);\n _close(this);\n\n return buf;\n }\n\n assert(this._handle, 'zlib binding closed');\n var req = this._handle.write(flushFlag, chunk, // in\n inOff, // in_off\n availInBefore, // in_len\n this._buffer, // out\n this._offset, //out_off\n availOutBefore); // out_len\n\n req.buffer = chunk;\n req.callback = callback;\n\n function callback(availInAfter, availOutAfter) {\n // When the callback is used in an async write, the callback's\n // context is the `req` object that was created. The req object\n // is === this._handle, and that's why it's important to null\n // out the values after they are done being used. `this._handle`\n // can stay in memory longer than the callback and buffer are needed.\n if (this) {\n this.buffer = null;\n this.callback = null;\n }\n\n if (self._hadError) return;\n\n var have = availOutBefore - availOutAfter;\n assert(have >= 0, 'have should not go down');\n\n if (have > 0) {\n var out = self._buffer.slice(self._offset, self._offset + have);\n self._offset += have;\n // serve some output to the consumer.\n if (async) {\n self.push(out);\n } else {\n buffers.push(out);\n nread += out.length;\n }\n }\n\n // exhausted the output buffer, or used all the input create a new one.\n if (availOutAfter === 0 || self._offset >= self._chunkSize) {\n availOutBefore = self._chunkSize;\n self._offset = 0;\n self._buffer = Buffer.allocUnsafe(self._chunkSize);\n }\n\n if (availOutAfter === 0) {\n // Not actually done. Need to reprocess.\n // Also, update the availInBefore to the availInAfter value,\n // so that if we have to hit it a third (fourth, etc.) time,\n // it'll have the correct byte counts.\n inOff += availInBefore - availInAfter;\n availInBefore = availInAfter;\n\n if (!async) return true;\n\n var newReq = self._handle.write(flushFlag, chunk, inOff, availInBefore, self._buffer, self._offset, self._chunkSize);\n newReq.callback = callback; // this same function\n newReq.buffer = chunk;\n return;\n }\n\n if (!async) return false;\n\n // finished with the chunk.\n cb();\n }\n};\n\nutil.inherits(Deflate, Zlib);\nutil.inherits(Inflate, Zlib);\nutil.inherits(Gzip, Zlib);\nutil.inherits(Gunzip, Zlib);\nutil.inherits(DeflateRaw, Zlib);\nutil.inherits(InflateRaw, Zlib);\nutil.inherits(Unzip, Zlib);","function allocUnsafe (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be a number')\n }\n\n if (size < 0) {\n throw new RangeError('\"size\" argument must not be negative')\n }\n\n if (Buffer.allocUnsafe) {\n return Buffer.allocUnsafe(size)\n } else {\n return new Buffer(size)\n }\n}\n\nmodule.exports = allocUnsafe\n","var bufferFill = require('buffer-fill')\nvar allocUnsafe = require('buffer-alloc-unsafe')\n\nmodule.exports = function alloc (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be a number')\n }\n\n if (size < 0) {\n throw new RangeError('\"size\" argument must not be negative')\n }\n\n if (Buffer.alloc) {\n return Buffer.alloc(size, fill, encoding)\n }\n\n var buffer = allocUnsafe(size)\n\n if (size === 0) {\n return buffer\n }\n\n if (fill === undefined) {\n return bufferFill(buffer, 0)\n }\n\n if (typeof encoding !== 'string') {\n encoding = undefined\n }\n\n return bufferFill(buffer, fill, encoding)\n}\n","/* Node.js 6.4.0 and up has full support */\nvar hasFullSupport = (function () {\n try {\n if (!Buffer.isEncoding('latin1')) {\n return false\n }\n\n var buf = Buffer.alloc ? Buffer.alloc(4) : new Buffer(4)\n\n buf.fill('ab', 'ucs2')\n\n return (buf.toString('hex') === '61006200')\n } catch (_) {\n return false\n }\n}())\n\nfunction isSingleByte (val) {\n return (val.length === 1 && val.charCodeAt(0) < 256)\n}\n\nfunction fillWithNumber (buffer, val, start, end) {\n if (start < 0 || end > buffer.length) {\n throw new RangeError('Out of range index')\n }\n\n start = start >>> 0\n end = end === undefined ? buffer.length : end >>> 0\n\n if (end > start) {\n buffer.fill(val, start, end)\n }\n\n return buffer\n}\n\nfunction fillWithBuffer (buffer, val, start, end) {\n if (start < 0 || end > buffer.length) {\n throw new RangeError('Out of range index')\n }\n\n if (end <= start) {\n return buffer\n }\n\n start = start >>> 0\n end = end === undefined ? buffer.length : end >>> 0\n\n var pos = start\n var len = val.length\n while (pos <= (end - len)) {\n val.copy(buffer, pos)\n pos += len\n }\n\n if (pos !== end) {\n val.copy(buffer, pos, 0, end - pos)\n }\n\n return buffer\n}\n\nfunction fill (buffer, val, start, end, encoding) {\n if (hasFullSupport) {\n return buffer.fill(val, start, end, encoding)\n }\n\n if (typeof val === 'number') {\n return fillWithNumber(buffer, val, start, end)\n }\n\n if (typeof val === 'string') {\n if (typeof start === 'string') {\n encoding = start\n start = 0\n end = buffer.length\n } else if (typeof end === 'string') {\n encoding = end\n end = buffer.length\n }\n\n if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n\n if (encoding === 'latin1') {\n encoding = 'binary'\n }\n\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n if (val === '') {\n return fillWithNumber(buffer, 0, start, end)\n }\n\n if (isSingleByte(val)) {\n return fillWithNumber(buffer, val.charCodeAt(0), start, end)\n }\n\n val = new Buffer(val, encoding)\n }\n\n if (Buffer.isBuffer(val)) {\n return fillWithBuffer(buffer, val, start, end)\n }\n\n // Other values (e.g. undefined, boolean, object) results in zero-fill\n return fillWithNumber(buffer, 0, start, end)\n}\n\nmodule.exports = fill\n","module.exports = function xor (a, b) {\n var length = Math.min(a.length, b.length)\n var buffer = new Buffer(length)\n\n for (var i = 0; i < length; ++i) {\n buffer[i] = a[i] ^ b[i]\n }\n\n return buffer\n}\n","/*!\n * The buffer module from node.js, for the browser.\n *\n * @author Feross Aboukhadijeh \n * @license MIT\n */\n/* eslint-disable no-proto */\n\n'use strict'\n\nconst base64 = require('base64-js')\nconst ieee754 = require('ieee754')\nconst customInspectSymbol =\n (typeof Symbol === 'function' && typeof Symbol['for'] === 'function') // eslint-disable-line dot-notation\n ? Symbol['for']('nodejs.util.inspect.custom') // eslint-disable-line dot-notation\n : null\n\nexports.Buffer = Buffer\nexports.SlowBuffer = SlowBuffer\nexports.INSPECT_MAX_BYTES = 50\n\nconst K_MAX_LENGTH = 0x7fffffff\nexports.kMaxLength = K_MAX_LENGTH\n\n/**\n * If `Buffer.TYPED_ARRAY_SUPPORT`:\n * === true Use Uint8Array implementation (fastest)\n * === false Print warning and recommend using `buffer` v4.x which has an Object\n * 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 * We report that the browser does not support typed arrays if the are not subclassable\n * using __proto__. Firefox 4-29 lacks support for adding new properties to `Uint8Array`\n * (See: https://bugzilla.mozilla.org/show_bug.cgi?id=695438). IE 10 lacks support\n * for __proto__ and has a buggy typed array implementation.\n */\nBuffer.TYPED_ARRAY_SUPPORT = typedArraySupport()\n\nif (!Buffer.TYPED_ARRAY_SUPPORT && typeof console !== 'undefined' &&\n typeof console.error === 'function') {\n console.error(\n 'This browser lacks typed array (Uint8Array) support which is required by ' +\n '`buffer` v5.x. Use `buffer` v4.x if you require old browser support.'\n )\n}\n\nfunction typedArraySupport () {\n // Can typed array instances can be augmented?\n try {\n const arr = new Uint8Array(1)\n const proto = { foo: function () { return 42 } }\n Object.setPrototypeOf(proto, Uint8Array.prototype)\n Object.setPrototypeOf(arr, proto)\n return arr.foo() === 42\n } catch (e) {\n return false\n }\n}\n\nObject.defineProperty(Buffer.prototype, 'parent', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.buffer\n }\n})\n\nObject.defineProperty(Buffer.prototype, 'offset', {\n enumerable: true,\n get: function () {\n if (!Buffer.isBuffer(this)) return undefined\n return this.byteOffset\n }\n})\n\nfunction createBuffer (length) {\n if (length > K_MAX_LENGTH) {\n throw new RangeError('The value \"' + length + '\" is invalid for option \"size\"')\n }\n // Return an augmented `Uint8Array` instance\n const buf = new Uint8Array(length)\n Object.setPrototypeOf(buf, Buffer.prototype)\n return buf\n}\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\nfunction Buffer (arg, encodingOrOffset, length) {\n // Common case.\n if (typeof arg === 'number') {\n if (typeof encodingOrOffset === 'string') {\n throw new TypeError(\n 'The \"string\" argument must be of type string. Received type number'\n )\n }\n return allocUnsafe(arg)\n }\n return from(arg, encodingOrOffset, length)\n}\n\nBuffer.poolSize = 8192 // not used by this implementation\n\nfunction from (value, encodingOrOffset, length) {\n if (typeof value === 'string') {\n return fromString(value, encodingOrOffset)\n }\n\n if (ArrayBuffer.isView(value)) {\n return fromArrayView(value)\n }\n\n if (value == null) {\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n }\n\n if (isInstance(value, ArrayBuffer) ||\n (value && isInstance(value.buffer, ArrayBuffer))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof SharedArrayBuffer !== 'undefined' &&\n (isInstance(value, SharedArrayBuffer) ||\n (value && isInstance(value.buffer, SharedArrayBuffer)))) {\n return fromArrayBuffer(value, encodingOrOffset, length)\n }\n\n if (typeof value === 'number') {\n throw new TypeError(\n 'The \"value\" argument must not be of type number. Received type number'\n )\n }\n\n const valueOf = value.valueOf && value.valueOf()\n if (valueOf != null && valueOf !== value) {\n return Buffer.from(valueOf, encodingOrOffset, length)\n }\n\n const b = fromObject(value)\n if (b) return b\n\n if (typeof Symbol !== 'undefined' && Symbol.toPrimitive != null &&\n typeof value[Symbol.toPrimitive] === 'function') {\n return Buffer.from(value[Symbol.toPrimitive]('string'), encodingOrOffset, length)\n }\n\n throw new TypeError(\n 'The first argument must be one of type string, Buffer, ArrayBuffer, Array, ' +\n 'or Array-like Object. Received type ' + (typeof value)\n )\n}\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 **/\nBuffer.from = function (value, encodingOrOffset, length) {\n return from(value, encodingOrOffset, length)\n}\n\n// Note: Change prototype *after* Buffer.from is defined to workaround Chrome bug:\n// https://github.com/feross/buffer/pull/148\nObject.setPrototypeOf(Buffer.prototype, Uint8Array.prototype)\nObject.setPrototypeOf(Buffer, Uint8Array)\n\nfunction assertSize (size) {\n if (typeof size !== 'number') {\n throw new TypeError('\"size\" argument must be of type number')\n } else if (size < 0) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n}\n\nfunction alloc (size, fill, encoding) {\n assertSize(size)\n if (size <= 0) {\n return createBuffer(size)\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 interpreted as a start offset.\n return typeof encoding === 'string'\n ? createBuffer(size).fill(fill, encoding)\n : createBuffer(size).fill(fill)\n }\n return createBuffer(size)\n}\n\n/**\n * Creates a new filled Buffer instance.\n * alloc(size[, fill[, encoding]])\n **/\nBuffer.alloc = function (size, fill, encoding) {\n return alloc(size, fill, encoding)\n}\n\nfunction allocUnsafe (size) {\n assertSize(size)\n return createBuffer(size < 0 ? 0 : checked(size) | 0)\n}\n\n/**\n * Equivalent to Buffer(num), by default creates a non-zero-filled Buffer instance.\n * */\nBuffer.allocUnsafe = function (size) {\n return allocUnsafe(size)\n}\n/**\n * Equivalent to SlowBuffer(num), by default creates a non-zero-filled Buffer instance.\n */\nBuffer.allocUnsafeSlow = function (size) {\n return allocUnsafe(size)\n}\n\nfunction fromString (string, encoding) {\n if (typeof encoding !== 'string' || encoding === '') {\n encoding = 'utf8'\n }\n\n if (!Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n\n const length = byteLength(string, encoding) | 0\n let buf = createBuffer(length)\n\n const actual = buf.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 buf = buf.slice(0, actual)\n }\n\n return buf\n}\n\nfunction fromArrayLike (array) {\n const length = array.length < 0 ? 0 : checked(array.length) | 0\n const buf = createBuffer(length)\n for (let i = 0; i < length; i += 1) {\n buf[i] = array[i] & 255\n }\n return buf\n}\n\nfunction fromArrayView (arrayView) {\n if (isInstance(arrayView, Uint8Array)) {\n const copy = new Uint8Array(arrayView)\n return fromArrayBuffer(copy.buffer, copy.byteOffset, copy.byteLength)\n }\n return fromArrayLike(arrayView)\n}\n\nfunction fromArrayBuffer (array, byteOffset, length) {\n if (byteOffset < 0 || array.byteLength < byteOffset) {\n throw new RangeError('\"offset\" is outside of buffer bounds')\n }\n\n if (array.byteLength < byteOffset + (length || 0)) {\n throw new RangeError('\"length\" is outside of buffer bounds')\n }\n\n let buf\n if (byteOffset === undefined && length === undefined) {\n buf = new Uint8Array(array)\n } else if (length === undefined) {\n buf = new Uint8Array(array, byteOffset)\n } else {\n buf = new Uint8Array(array, byteOffset, length)\n }\n\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(buf, Buffer.prototype)\n\n return buf\n}\n\nfunction fromObject (obj) {\n if (Buffer.isBuffer(obj)) {\n const len = checked(obj.length) | 0\n const buf = createBuffer(len)\n\n if (buf.length === 0) {\n return buf\n }\n\n obj.copy(buf, 0, 0, len)\n return buf\n }\n\n if (obj.length !== undefined) {\n if (typeof obj.length !== 'number' || numberIsNaN(obj.length)) {\n return createBuffer(0)\n }\n return fromArrayLike(obj)\n }\n\n if (obj.type === 'Buffer' && Array.isArray(obj.data)) {\n return fromArrayLike(obj.data)\n }\n}\n\nfunction checked (length) {\n // Note: cannot use `length < K_MAX_LENGTH` here because that fails when\n // length is NaN (which is otherwise coerced to zero.)\n if (length >= K_MAX_LENGTH) {\n throw new RangeError('Attempt to allocate Buffer larger than maximum ' +\n 'size: 0x' + K_MAX_LENGTH.toString(16) + ' bytes')\n }\n return length | 0\n}\n\nfunction SlowBuffer (length) {\n if (+length != length) { // eslint-disable-line eqeqeq\n length = 0\n }\n return Buffer.alloc(+length)\n}\n\nBuffer.isBuffer = function isBuffer (b) {\n return b != null && b._isBuffer === true &&\n b !== Buffer.prototype // so Buffer.isBuffer(Buffer.prototype) will be false\n}\n\nBuffer.compare = function compare (a, b) {\n if (isInstance(a, Uint8Array)) a = Buffer.from(a, a.offset, a.byteLength)\n if (isInstance(b, Uint8Array)) b = Buffer.from(b, b.offset, b.byteLength)\n if (!Buffer.isBuffer(a) || !Buffer.isBuffer(b)) {\n throw new TypeError(\n 'The \"buf1\", \"buf2\" arguments must be one of type Buffer or Uint8Array'\n )\n }\n\n if (a === b) return 0\n\n let x = a.length\n let y = b.length\n\n for (let 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 default:\n return false\n }\n}\n\nBuffer.concat = function concat (list, length) {\n if (!Array.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 let i\n if (length === undefined) {\n length = 0\n for (i = 0; i < list.length; ++i) {\n length += list[i].length\n }\n }\n\n const buffer = Buffer.allocUnsafe(length)\n let pos = 0\n for (i = 0; i < list.length; ++i) {\n let buf = list[i]\n if (isInstance(buf, Uint8Array)) {\n if (pos + buf.length > buffer.length) {\n if (!Buffer.isBuffer(buf)) buf = Buffer.from(buf)\n buf.copy(buffer, pos)\n } else {\n Uint8Array.prototype.set.call(\n buffer,\n buf,\n pos\n )\n }\n } else if (!Buffer.isBuffer(buf)) {\n throw new TypeError('\"list\" argument must be an Array of Buffers')\n } else {\n buf.copy(buffer, pos)\n }\n pos += buf.length\n }\n return buffer\n}\n\nfunction byteLength (string, encoding) {\n if (Buffer.isBuffer(string)) {\n return string.length\n }\n if (ArrayBuffer.isView(string) || isInstance(string, ArrayBuffer)) {\n return string.byteLength\n }\n if (typeof string !== 'string') {\n throw new TypeError(\n 'The \"string\" argument must be one of type string, Buffer, or ArrayBuffer. ' +\n 'Received type ' + typeof string\n )\n }\n\n const len = string.length\n const mustMatch = (arguments.length > 2 && arguments[2] === true)\n if (!mustMatch && len === 0) return 0\n\n // Use a for loop to avoid recursion\n let loweredCase = false\n for (;;) {\n switch (encoding) {\n case 'ascii':\n case 'latin1':\n case 'binary':\n return len\n case 'utf8':\n case 'utf-8':\n return utf8ToBytes(string).length\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return len * 2\n case 'hex':\n return len >>> 1\n case 'base64':\n return base64ToBytes(string).length\n default:\n if (loweredCase) {\n return mustMatch ? -1 : utf8ToBytes(string).length // assume utf8\n }\n encoding = ('' + encoding).toLowerCase()\n loweredCase = true\n }\n }\n}\nBuffer.byteLength = byteLength\n\nfunction slowToString (encoding, start, end) {\n let loweredCase = false\n\n // No need to verify that \"this.length <= MAX_UINT32\" since it's a read-only\n // property of a typed array.\n\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 if (start === undefined || start < 0) {\n start = 0\n }\n // Return early if start > this.length. Done here to prevent potential uint32\n // coercion fail below.\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 }\n\n // Force coercion to uint32. This will also coerce falsey/NaN values to 0.\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}\n\n// This property is used by `Buffer.isBuffer` (and the `is-buffer` npm package)\n// to detect a Buffer instance. It's not possible to use `instanceof Buffer`\n// reliably in a browserify context because there could be multiple different\n// copies of the 'buffer' package in use. This method works even for Buffer\n// instances that were created from another copy of the `buffer` package.\n// See: https://github.com/feross/buffer/issues/154\nBuffer.prototype._isBuffer = true\n\nfunction swap (b, n, m) {\n const i = b[n]\n b[n] = b[m]\n b[m] = i\n}\n\nBuffer.prototype.swap16 = function swap16 () {\n const len = this.length\n if (len % 2 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 16-bits')\n }\n for (let i = 0; i < len; i += 2) {\n swap(this, i, i + 1)\n }\n return this\n}\n\nBuffer.prototype.swap32 = function swap32 () {\n const len = this.length\n if (len % 4 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 32-bits')\n }\n for (let i = 0; i < len; i += 4) {\n swap(this, i, i + 3)\n swap(this, i + 1, i + 2)\n }\n return this\n}\n\nBuffer.prototype.swap64 = function swap64 () {\n const len = this.length\n if (len % 8 !== 0) {\n throw new RangeError('Buffer size must be a multiple of 64-bits')\n }\n for (let 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 return this\n}\n\nBuffer.prototype.toString = function toString () {\n const length = this.length\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.toLocaleString = Buffer.prototype.toString\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 let str = ''\n const max = exports.INSPECT_MAX_BYTES\n str = this.toString('hex', 0, max).replace(/(.{2})/g, '$1 ').trim()\n if (this.length > max) str += ' ... '\n return ''\n}\nif (customInspectSymbol) {\n Buffer.prototype[customInspectSymbol] = Buffer.prototype.inspect\n}\n\nBuffer.prototype.compare = function compare (target, start, end, thisStart, thisEnd) {\n if (isInstance(target, Uint8Array)) {\n target = Buffer.from(target, target.offset, target.byteLength)\n }\n if (!Buffer.isBuffer(target)) {\n throw new TypeError(\n 'The \"target\" argument must be one of type Buffer or Uint8Array. ' +\n 'Received type ' + (typeof target)\n )\n }\n\n if (start === undefined) {\n start = 0\n }\n if (end === undefined) {\n end = target ? target.length : 0\n }\n if (thisStart === undefined) {\n thisStart = 0\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 if (thisStart >= thisEnd) {\n return -1\n }\n if (start >= end) {\n return 1\n }\n\n start >>>= 0\n end >>>= 0\n thisStart >>>= 0\n thisEnd >>>= 0\n\n if (this === target) return 0\n\n let x = thisEnd - thisStart\n let y = end - start\n const len = Math.min(x, y)\n\n const thisCopy = this.slice(thisStart, thisEnd)\n const targetCopy = target.slice(start, end)\n\n for (let 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}\n\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\nfunction bidirectionalIndexOf (buffer, val, byteOffset, encoding, dir) {\n // Empty buffer means no match\n if (buffer.length === 0) return -1\n\n // Normalize byteOffset\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 byteOffset = +byteOffset // Coerce to Number.\n if (numberIsNaN(byteOffset)) {\n // byteOffset: it it's undefined, null, NaN, \"foo\", etc, search whole buffer\n byteOffset = dir ? 0 : (buffer.length - 1)\n }\n\n // Normalize byteOffset: negative offsets start from the end of the buffer\n if (byteOffset < 0) byteOffset = buffer.length + byteOffset\n if (byteOffset >= buffer.length) {\n if (dir) return -1\n else byteOffset = buffer.length - 1\n } else if (byteOffset < 0) {\n if (dir) byteOffset = 0\n else return -1\n }\n\n // Normalize val\n if (typeof val === 'string') {\n val = Buffer.from(val, encoding)\n }\n\n // Finally, search either indexOf (if dir is true) or lastIndexOf\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 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 if (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 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 let indexSize = 1\n let arrLength = arr.length\n let valLength = val.length\n\n if (encoding !== undefined) {\n encoding = String(encoding).toLowerCase()\n if (encoding === 'ucs2' || encoding === 'ucs-2' ||\n encoding === 'utf16le' || encoding === 'utf-16le') {\n if (arr.length < 2 || val.length < 2) {\n return -1\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 let i\n if (dir) {\n let foundIndex = -1\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 for (i = byteOffset; i >= 0; i--) {\n let found = true\n for (let j = 0; j < valLength; j++) {\n if (read(arr, i + j) !== read(val, j)) {\n found = false\n break\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 const remaining = buf.length - offset\n if (!length) {\n length = remaining\n } else {\n length = Number(length)\n if (length > remaining) {\n length = remaining\n }\n }\n\n const strLen = string.length\n\n if (length > strLen / 2) {\n length = strLen / 2\n }\n let i\n for (i = 0; i < length; ++i) {\n const parsed = parseInt(string.substr(i * 2, 2), 16)\n if (numberIsNaN(parsed)) return i\n buf[offset + i] = parsed\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 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\n // Buffer#write(string, encoding)\n } else if (length === undefined && typeof offset === 'string') {\n encoding = offset\n length = this.length\n offset = 0\n // Buffer#write(string, offset[, length][, encoding])\n } else if (isFinite(offset)) {\n offset = offset >>> 0\n if (isFinite(length)) {\n length = length >>> 0\n if (encoding === undefined) encoding = 'utf8'\n } else {\n encoding = length\n length = undefined\n }\n } else {\n throw new Error(\n 'Buffer.write(string, encoding, offset[, length]) is no longer supported'\n )\n }\n\n const 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\n let loweredCase = false\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 case 'latin1':\n case 'binary':\n return asciiWrite(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 const res = []\n\n let i = start\n while (i < end) {\n const firstByte = buf[i]\n let codePoint = null\n let bytesPerSequence = (firstByte > 0xEF)\n ? 4\n : (firstByte > 0xDF)\n ? 3\n : (firstByte > 0xBF)\n ? 2\n : 1\n\n if (i + bytesPerSequence <= end) {\n let secondByte, thirdByte, fourthByte, tempCodePoint\n\n switch (bytesPerSequence) {\n case 1:\n if (firstByte < 0x80) {\n codePoint = firstByte\n }\n break\n case 2:\n secondByte = buf[i + 1]\n if ((secondByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0x1F) << 0x6 | (secondByte & 0x3F)\n if (tempCodePoint > 0x7F) {\n codePoint = tempCodePoint\n }\n }\n break\n case 3:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n if ((secondByte & 0xC0) === 0x80 && (thirdByte & 0xC0) === 0x80) {\n tempCodePoint = (firstByte & 0xF) << 0xC | (secondByte & 0x3F) << 0x6 | (thirdByte & 0x3F)\n if (tempCodePoint > 0x7FF && (tempCodePoint < 0xD800 || tempCodePoint > 0xDFFF)) {\n codePoint = tempCodePoint\n }\n }\n break\n case 4:\n secondByte = buf[i + 1]\n thirdByte = buf[i + 2]\n fourthByte = buf[i + 3]\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 if (tempCodePoint > 0xFFFF && tempCodePoint < 0x110000) {\n codePoint = tempCodePoint\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}\n\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\nconst MAX_ARGUMENTS_LENGTH = 0x1000\n\nfunction decodeCodePointsArray (codePoints) {\n const len = codePoints.length\n if (len <= MAX_ARGUMENTS_LENGTH) {\n return String.fromCharCode.apply(String, codePoints) // avoid extra slice()\n }\n\n // Decode in chunks to avoid \"call stack size exceeded\".\n let res = ''\n let i = 0\n while (i < len) {\n res += String.fromCharCode.apply(\n String,\n codePoints.slice(i, i += MAX_ARGUMENTS_LENGTH)\n )\n }\n return res\n}\n\nfunction asciiSlice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i] & 0x7F)\n }\n return ret\n}\n\nfunction latin1Slice (buf, start, end) {\n let ret = ''\n end = Math.min(buf.length, end)\n\n for (let i = start; i < end; ++i) {\n ret += String.fromCharCode(buf[i])\n }\n return ret\n}\n\nfunction hexSlice (buf, start, end) {\n const len = buf.length\n\n if (!start || start < 0) start = 0\n if (!end || end < 0 || end > len) end = len\n\n let out = ''\n for (let i = start; i < end; ++i) {\n out += hexSliceLookupTable[buf[i]]\n }\n return out\n}\n\nfunction utf16leSlice (buf, start, end) {\n const bytes = buf.slice(start, end)\n let res = ''\n // If bytes.length is odd, the last 8 bits must be ignored (same as node.js)\n for (let i = 0; i < bytes.length - 1; i += 2) {\n res += String.fromCharCode(bytes[i] + (bytes[i + 1] * 256))\n }\n return res\n}\n\nBuffer.prototype.slice = function slice (start, end) {\n const 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\n const newBuf = this.subarray(start, end)\n // Return an augmented `Uint8Array` instance\n Object.setPrototypeOf(newBuf, Buffer.prototype)\n\n return newBuf\n}\n\n/*\n * Need to make sure that buffer isn't trying to write out of bounds.\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 =\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\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUintBE =\nBuffer.prototype.readUIntBE = function readUIntBE (offset, byteLength, noAssert) {\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n checkOffset(offset, byteLength, this.length)\n }\n\n let val = this[offset + --byteLength]\n let mul = 1\n while (byteLength > 0 && (mul *= 0x100)) {\n val += this[offset + --byteLength] * mul\n }\n\n return val\n}\n\nBuffer.prototype.readUint8 =\nBuffer.prototype.readUInt8 = function readUInt8 (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 1, this.length)\n return this[offset]\n}\n\nBuffer.prototype.readUint16LE =\nBuffer.prototype.readUInt16LE = function readUInt16LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return this[offset] | (this[offset + 1] << 8)\n}\n\nBuffer.prototype.readUint16BE =\nBuffer.prototype.readUInt16BE = function readUInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n return (this[offset] << 8) | this[offset + 1]\n}\n\nBuffer.prototype.readUint32LE =\nBuffer.prototype.readUInt32LE = function readUInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return ((this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16)) +\n (this[offset + 3] * 0x1000000)\n}\n\nBuffer.prototype.readUint32BE =\nBuffer.prototype.readUInt32BE = function readUInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] * 0x1000000) +\n ((this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n this[offset + 3])\n}\n\nBuffer.prototype.readBigUInt64LE = defineBigIntMethod(function readBigUInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const lo = first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24\n\n const hi = this[++offset] +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n last * 2 ** 24\n\n return BigInt(lo) + (BigInt(hi) << BigInt(32))\n})\n\nBuffer.prototype.readBigUInt64BE = defineBigIntMethod(function readBigUInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const hi = first * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n const lo = this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last\n\n return (BigInt(hi) << BigInt(32)) + BigInt(lo)\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\n let val = this[offset]\n let mul = 1\n let i = 0\n while (++i < byteLength && (mul *= 0x100)) {\n val += this[offset + i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\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\n let i = byteLength\n let mul = 1\n let val = this[offset + --i]\n while (i > 0 && (mul *= 0x100)) {\n val += this[offset + --i] * mul\n }\n mul *= 0x80\n\n if (val >= mul) val -= Math.pow(2, 8 * byteLength)\n\n return val\n}\n\nBuffer.prototype.readInt8 = function readInt8 (offset, noAssert) {\n offset = offset >>> 0\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 offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset] | (this[offset + 1] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt16BE = function readInt16BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 2, this.length)\n const val = this[offset + 1] | (this[offset] << 8)\n return (val & 0x8000) ? val | 0xFFFF0000 : val\n}\n\nBuffer.prototype.readInt32LE = function readInt32LE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset]) |\n (this[offset + 1] << 8) |\n (this[offset + 2] << 16) |\n (this[offset + 3] << 24)\n}\n\nBuffer.prototype.readInt32BE = function readInt32BE (offset, noAssert) {\n offset = offset >>> 0\n if (!noAssert) checkOffset(offset, 4, this.length)\n\n return (this[offset] << 24) |\n (this[offset + 1] << 16) |\n (this[offset + 2] << 8) |\n (this[offset + 3])\n}\n\nBuffer.prototype.readBigInt64LE = defineBigIntMethod(function readBigInt64LE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = this[offset + 4] +\n this[offset + 5] * 2 ** 8 +\n this[offset + 6] * 2 ** 16 +\n (last << 24) // Overflow\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(first +\n this[++offset] * 2 ** 8 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 24)\n})\n\nBuffer.prototype.readBigInt64BE = defineBigIntMethod(function readBigInt64BE (offset) {\n offset = offset >>> 0\n validateNumber(offset, 'offset')\n const first = this[offset]\n const last = this[offset + 7]\n if (first === undefined || last === undefined) {\n boundsError(offset, this.length - 8)\n }\n\n const val = (first << 24) + // Overflow\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n this[++offset]\n\n return (BigInt(val) << BigInt(32)) +\n BigInt(this[++offset] * 2 ** 24 +\n this[++offset] * 2 ** 16 +\n this[++offset] * 2 ** 8 +\n last)\n})\n\nBuffer.prototype.readFloatLE = function readFloatLE (offset, noAssert) {\n offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 offset = offset >>> 0\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 =\nBuffer.prototype.writeUIntLE = function writeUIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let mul = 1\n let i = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUintBE =\nBuffer.prototype.writeUIntBE = function writeUIntBE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n byteLength = byteLength >>> 0\n if (!noAssert) {\n const maxBytes = Math.pow(2, 8 * byteLength) - 1\n checkInt(this, value, offset, byteLength, maxBytes, 0)\n }\n\n let i = byteLength - 1\n let mul = 1\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n this[offset + i] = (value / mul) & 0xFF\n }\n\n return offset + byteLength\n}\n\nBuffer.prototype.writeUint8 =\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 this[offset] = (value & 0xff)\n return offset + 1\n}\n\nBuffer.prototype.writeUint16LE =\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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n return offset + 2\n}\n\nBuffer.prototype.writeUint16BE =\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 this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\n return offset + 2\n}\n\nBuffer.prototype.writeUint32LE =\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 this[offset + 3] = (value >>> 24)\n this[offset + 2] = (value >>> 16)\n this[offset + 1] = (value >>> 8)\n this[offset] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeUint32BE =\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 this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nfunction wrtBigUInt64LE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n lo = lo >> 8\n buf[offset++] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n hi = hi >> 8\n buf[offset++] = hi\n return offset\n}\n\nfunction wrtBigUInt64BE (buf, value, offset, min, max) {\n checkIntBI(value, min, max, buf, offset, 7)\n\n let lo = Number(value & BigInt(0xffffffff))\n buf[offset + 7] = lo\n lo = lo >> 8\n buf[offset + 6] = lo\n lo = lo >> 8\n buf[offset + 5] = lo\n lo = lo >> 8\n buf[offset + 4] = lo\n let hi = Number(value >> BigInt(32) & BigInt(0xffffffff))\n buf[offset + 3] = hi\n hi = hi >> 8\n buf[offset + 2] = hi\n hi = hi >> 8\n buf[offset + 1] = hi\n hi = hi >> 8\n buf[offset] = hi\n return offset + 8\n}\n\nBuffer.prototype.writeBigUInt64LE = defineBigIntMethod(function writeBigUInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeBigUInt64BE = defineBigIntMethod(function writeBigUInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, BigInt(0), BigInt('0xffffffffffffffff'))\n})\n\nBuffer.prototype.writeIntLE = function writeIntLE (value, offset, byteLength, noAssert) {\n value = +value\n offset = offset >>> 0\n if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = 0\n let mul = 1\n let sub = 0\n this[offset] = value & 0xFF\n while (++i < byteLength && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i - 1] !== 0) {\n sub = 1\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 if (!noAssert) {\n const limit = Math.pow(2, (8 * byteLength) - 1)\n\n checkInt(this, value, offset, byteLength, limit - 1, -limit)\n }\n\n let i = byteLength - 1\n let mul = 1\n let sub = 0\n this[offset + i] = value & 0xFF\n while (--i >= 0 && (mul *= 0x100)) {\n if (value < 0 && sub === 0 && this[offset + i + 1] !== 0) {\n sub = 1\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 (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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\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 this[offset] = (value >>> 8)\n this[offset + 1] = (value & 0xff)\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 this[offset] = (value & 0xff)\n this[offset + 1] = (value >>> 8)\n this[offset + 2] = (value >>> 16)\n this[offset + 3] = (value >>> 24)\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 this[offset] = (value >>> 24)\n this[offset + 1] = (value >>> 16)\n this[offset + 2] = (value >>> 8)\n this[offset + 3] = (value & 0xff)\n return offset + 4\n}\n\nBuffer.prototype.writeBigInt64LE = defineBigIntMethod(function writeBigInt64LE (value, offset = 0) {\n return wrtBigUInt64LE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\n})\n\nBuffer.prototype.writeBigInt64BE = defineBigIntMethod(function writeBigInt64BE (value, offset = 0) {\n return wrtBigUInt64BE(this, value, offset, -BigInt('0x8000000000000000'), BigInt('0x7fffffffffffffff'))\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 value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 4, 3.4028234663852886e+38, -3.4028234663852886e+38)\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 value = +value\n offset = offset >>> 0\n if (!noAssert) {\n checkIEEE754(buf, value, offset, 8, 1.7976931348623157E+308, -1.7976931348623157E+308)\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}\n\n// copy(targetBuffer, targetStart=0, sourceStart=0, sourceEnd=buffer.length)\nBuffer.prototype.copy = function copy (target, targetStart, start, end) {\n if (!Buffer.isBuffer(target)) throw new TypeError('argument should be a Buffer')\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\n\n // Copy 0 bytes; we're done\n if (end === start) return 0\n if (target.length === 0 || this.length === 0) return 0\n\n // Fatal error conditions\n if (targetStart < 0) {\n throw new RangeError('targetStart out of bounds')\n }\n if (start < 0 || start >= this.length) throw new RangeError('Index out of range')\n if (end < 0) throw new RangeError('sourceEnd out of bounds')\n\n // Are we oob?\n if (end > this.length) end = this.length\n if (target.length - targetStart < end - start) {\n end = target.length - targetStart + start\n }\n\n const len = end - start\n\n if (this === target && typeof Uint8Array.prototype.copyWithin === 'function') {\n // Use built-in when available, missing from IE11\n this.copyWithin(targetStart, start, end)\n } else {\n Uint8Array.prototype.set.call(\n target,\n this.subarray(start, end),\n targetStart\n )\n }\n\n return len\n}\n\n// Usage:\n// buffer.fill(number[, offset[, end]])\n// buffer.fill(buffer[, offset[, end]])\n// buffer.fill(string[, offset[, end]][, encoding])\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 if (encoding !== undefined && typeof encoding !== 'string') {\n throw new TypeError('encoding must be a string')\n }\n if (typeof encoding === 'string' && !Buffer.isEncoding(encoding)) {\n throw new TypeError('Unknown encoding: ' + encoding)\n }\n if (val.length === 1) {\n const code = val.charCodeAt(0)\n if ((encoding === 'utf8' && code < 128) ||\n encoding === 'latin1') {\n // Fast path: If `val` fits into a single byte, use that numeric value.\n val = code\n }\n }\n } else if (typeof val === 'number') {\n val = val & 255\n } else if (typeof val === 'boolean') {\n val = Number(val)\n }\n\n // Invalid ranges are not set to a default, so can range check early.\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\n if (!val) val = 0\n\n let i\n if (typeof val === 'number') {\n for (i = start; i < end; ++i) {\n this[i] = val\n }\n } else {\n const bytes = Buffer.isBuffer(val)\n ? val\n : Buffer.from(val, encoding)\n const len = bytes.length\n if (len === 0) {\n throw new TypeError('The value \"' + val +\n '\" is invalid for argument \"value\"')\n }\n for (i = 0; i < end - start; ++i) {\n this[i + start] = bytes[i % len]\n }\n }\n\n return this\n}\n\n// CUSTOM ERRORS\n// =============\n\n// Simplified versions from Node, changed for Buffer-only usage\nconst errors = {}\nfunction E (sym, getMessage, Base) {\n errors[sym] = class NodeError extends Base {\n constructor () {\n super()\n\n Object.defineProperty(this, 'message', {\n value: getMessage.apply(this, arguments),\n writable: true,\n configurable: true\n })\n\n // Add the error code to the name to include it in the stack trace.\n this.name = `${this.name} [${sym}]`\n // Access the stack to generate the error message including the error code\n // from the name.\n this.stack // eslint-disable-line no-unused-expressions\n // Reset the name to the actual name.\n delete this.name\n }\n\n get code () {\n return sym\n }\n\n set code (value) {\n Object.defineProperty(this, 'code', {\n configurable: true,\n enumerable: true,\n value,\n writable: true\n })\n }\n\n toString () {\n return `${this.name} [${sym}]: ${this.message}`\n }\n }\n}\n\nE('ERR_BUFFER_OUT_OF_BOUNDS',\n function (name) {\n if (name) {\n return `${name} is outside of buffer bounds`\n }\n\n return 'Attempt to access memory outside buffer bounds'\n }, RangeError)\nE('ERR_INVALID_ARG_TYPE',\n function (name, actual) {\n return `The \"${name}\" argument must be of type number. Received type ${typeof actual}`\n }, TypeError)\nE('ERR_OUT_OF_RANGE',\n function (str, range, input) {\n let msg = `The value of \"${str}\" is out of range.`\n let received = input\n if (Number.isInteger(input) && Math.abs(input) > 2 ** 32) {\n received = addNumericalSeparator(String(input))\n } else if (typeof input === 'bigint') {\n received = String(input)\n if (input > BigInt(2) ** BigInt(32) || input < -(BigInt(2) ** BigInt(32))) {\n received = addNumericalSeparator(received)\n }\n received += 'n'\n }\n msg += ` It must be ${range}. Received ${received}`\n return msg\n }, RangeError)\n\nfunction addNumericalSeparator (val) {\n let res = ''\n let i = val.length\n const start = val[0] === '-' ? 1 : 0\n for (; i >= start + 4; i -= 3) {\n res = `_${val.slice(i - 3, i)}${res}`\n }\n return `${val.slice(0, i)}${res}`\n}\n\n// CHECK FUNCTIONS\n// ===============\n\nfunction checkBounds (buf, offset, byteLength) {\n validateNumber(offset, 'offset')\n if (buf[offset] === undefined || buf[offset + byteLength] === undefined) {\n boundsError(offset, buf.length - (byteLength + 1))\n }\n}\n\nfunction checkIntBI (value, min, max, buf, offset, byteLength) {\n if (value > max || value < min) {\n const n = typeof min === 'bigint' ? 'n' : ''\n let range\n if (byteLength > 3) {\n if (min === 0 || min === BigInt(0)) {\n range = `>= 0${n} and < 2${n} ** ${(byteLength + 1) * 8}${n}`\n } else {\n range = `>= -(2${n} ** ${(byteLength + 1) * 8 - 1}${n}) and < 2 ** ` +\n `${(byteLength + 1) * 8 - 1}${n}`\n }\n } else {\n range = `>= ${min}${n} and <= ${max}${n}`\n }\n throw new errors.ERR_OUT_OF_RANGE('value', range, value)\n }\n checkBounds(buf, offset, byteLength)\n}\n\nfunction validateNumber (value, name) {\n if (typeof value !== 'number') {\n throw new errors.ERR_INVALID_ARG_TYPE(name, 'number', value)\n }\n}\n\nfunction boundsError (value, length, type) {\n if (Math.floor(value) !== value) {\n validateNumber(value, type)\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset', 'an integer', value)\n }\n\n if (length < 0) {\n throw new errors.ERR_BUFFER_OUT_OF_BOUNDS()\n }\n\n throw new errors.ERR_OUT_OF_RANGE(type || 'offset',\n `>= ${type ? 1 : 0} and <= ${length}`,\n value)\n}\n\n// HELPER FUNCTIONS\n// ================\n\nconst INVALID_BASE64_RE = /[^+/0-9A-Za-z-_]/g\n\nfunction base64clean (str) {\n // Node takes equal signs as end of the Base64 encoding\n str = str.split('=')[0]\n // Node strips out invalid characters like \\n and \\t from the string, base64-js does not\n str = str.trim().replace(INVALID_BASE64_RE, '')\n // Node converts strings with length < 2 to ''\n if (str.length < 2) return ''\n // Node allows for non-padded base64 strings (missing trailing ===), base64-js does not\n while (str.length % 4 !== 0) {\n str = str + '='\n }\n return str\n}\n\nfunction utf8ToBytes (string, units) {\n units = units || Infinity\n let codePoint\n const length = string.length\n let leadSurrogate = null\n const bytes = []\n\n for (let i = 0; i < length; ++i) {\n codePoint = string.charCodeAt(i)\n\n // is surrogate component\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 }\n\n // valid lead\n leadSurrogate = codePoint\n\n continue\n }\n\n // 2 leads in a row\n if (codePoint < 0xDC00) {\n if ((units -= 3) > -1) bytes.push(0xEF, 0xBF, 0xBD)\n leadSurrogate = codePoint\n continue\n }\n\n // valid surrogate pair\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\n\n // encode utf8\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(\n codePoint >> 0x6 | 0xC0,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x10000) {\n if ((units -= 3) < 0) break\n bytes.push(\n codePoint >> 0xC | 0xE0,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else if (codePoint < 0x110000) {\n if ((units -= 4) < 0) break\n bytes.push(\n codePoint >> 0x12 | 0xF0,\n codePoint >> 0xC & 0x3F | 0x80,\n codePoint >> 0x6 & 0x3F | 0x80,\n codePoint & 0x3F | 0x80\n )\n } else {\n throw new Error('Invalid code point')\n }\n }\n\n return bytes\n}\n\nfunction asciiToBytes (str) {\n const byteArray = []\n for (let 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 return byteArray\n}\n\nfunction utf16leToBytes (str, units) {\n let c, hi, lo\n const byteArray = []\n for (let i = 0; i < str.length; ++i) {\n if ((units -= 2) < 0) break\n\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 let i\n for (i = 0; i < length; ++i) {\n if ((i + offset >= dst.length) || (i >= src.length)) break\n dst[i + offset] = src[i]\n }\n return i\n}\n\n// ArrayBuffer or Uint8Array objects from other contexts (i.e. iframes) do not pass\n// the `instanceof` check but they should be treated as of that type.\n// See: https://github.com/feross/buffer/issues/166\nfunction isInstance (obj, type) {\n return obj instanceof type ||\n (obj != null && obj.constructor != null && obj.constructor.name != null &&\n obj.constructor.name === type.name)\n}\nfunction numberIsNaN (obj) {\n // For IE11 support\n return obj !== obj // eslint-disable-line no-self-compare\n}\n\n// Create lookup table for `toString('hex')`\n// See: https://github.com/feross/buffer/issues/219\nconst hexSliceLookupTable = (function () {\n const alphabet = '0123456789abcdef'\n const table = new Array(256)\n for (let i = 0; i < 16; ++i) {\n const i16 = i * 16\n for (let j = 0; j < 16; ++j) {\n table[i16 + j] = alphabet[i] + alphabet[j]\n }\n }\n return table\n})()\n\n// Return not function with Error if BigInt not supported\nfunction defineBigIntMethod (fn) {\n return typeof BigInt === 'undefined' ? BufferBigIntNotDefined : fn\n}\n\nfunction BufferBigIntNotDefined () {\n throw new Error('BigInt not supported')\n}\n","module.exports = {\n \"100\": \"Continue\",\n \"101\": \"Switching Protocols\",\n \"102\": \"Processing\",\n \"200\": \"OK\",\n \"201\": \"Created\",\n \"202\": \"Accepted\",\n \"203\": \"Non-Authoritative Information\",\n \"204\": \"No Content\",\n \"205\": \"Reset Content\",\n \"206\": \"Partial Content\",\n \"207\": \"Multi-Status\",\n \"208\": \"Already Reported\",\n \"226\": \"IM Used\",\n \"300\": \"Multiple Choices\",\n \"301\": \"Moved Permanently\",\n \"302\": \"Found\",\n \"303\": \"See Other\",\n \"304\": \"Not Modified\",\n \"305\": \"Use Proxy\",\n \"307\": \"Temporary Redirect\",\n \"308\": \"Permanent Redirect\",\n \"400\": \"Bad Request\",\n \"401\": \"Unauthorized\",\n \"402\": \"Payment Required\",\n \"403\": \"Forbidden\",\n \"404\": \"Not Found\",\n \"405\": \"Method Not Allowed\",\n \"406\": \"Not Acceptable\",\n \"407\": \"Proxy Authentication Required\",\n \"408\": \"Request Timeout\",\n \"409\": \"Conflict\",\n \"410\": \"Gone\",\n \"411\": \"Length Required\",\n \"412\": \"Precondition Failed\",\n \"413\": \"Payload Too Large\",\n \"414\": \"URI Too Long\",\n \"415\": \"Unsupported Media Type\",\n \"416\": \"Range Not Satisfiable\",\n \"417\": \"Expectation Failed\",\n \"418\": \"I'm a teapot\",\n \"421\": \"Misdirected Request\",\n \"422\": \"Unprocessable Entity\",\n \"423\": \"Locked\",\n \"424\": \"Failed Dependency\",\n \"425\": \"Unordered Collection\",\n \"426\": \"Upgrade Required\",\n \"428\": \"Precondition Required\",\n \"429\": \"Too Many Requests\",\n \"431\": \"Request Header Fields Too Large\",\n \"451\": \"Unavailable For Legal Reasons\",\n \"500\": \"Internal Server Error\",\n \"501\": \"Not Implemented\",\n \"502\": \"Bad Gateway\",\n \"503\": \"Service Unavailable\",\n \"504\": \"Gateway Timeout\",\n \"505\": \"HTTP Version Not Supported\",\n \"506\": \"Variant Also Negotiates\",\n \"507\": \"Insufficient Storage\",\n \"508\": \"Loop Detected\",\n \"509\": \"Bandwidth Limit Exceeded\",\n \"510\": \"Not Extended\",\n \"511\": \"Network Authentication Required\"\n}\n","/*! cache-chunk-store. MIT License. Feross Aboukhadijeh */\nconst LRU = require('lru')\nconst queueMicrotask = require('queue-microtask')\n\nclass CacheStore {\n constructor (store, opts) {\n this.store = store\n this.chunkLength = store.chunkLength\n this.inProgressGets = new Map() // Map from chunk index to info on callbacks waiting for that chunk\n\n if (!this.store || !this.store.get || !this.store.put) {\n throw new Error('First argument must be abstract-chunk-store compliant')\n }\n\n this.cache = new LRU(opts)\n }\n\n put (index, buf, cb = () => {}) {\n if (!this.cache) {\n return queueMicrotask(() => cb(new Error('CacheStore closed')))\n }\n\n this.cache.remove(index)\n this.store.put(index, buf, cb)\n }\n\n get (index, opts, cb = () => {}) {\n if (typeof opts === 'function') return this.get(index, null, opts)\n\n if (!this.cache) {\n return queueMicrotask(() => cb(new Error('CacheStore closed')))\n }\n\n if (!opts) opts = {}\n\n let buf = this.cache.get(index)\n if (buf) {\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n if (offset !== 0 || len !== buf.length) {\n buf = buf.slice(offset, len + offset)\n }\n return queueMicrotask(() => cb(null, buf))\n }\n\n // See if a get for this index has already started\n let waiters = this.inProgressGets.get(index)\n const getAlreadyStarted = !!waiters\n if (!waiters) {\n waiters = []\n this.inProgressGets.set(index, waiters)\n }\n\n waiters.push({\n opts,\n cb\n })\n\n if (!getAlreadyStarted) {\n this.store.get(index, (err, buf) => {\n if (!err && this.cache != null) this.cache.set(index, buf)\n\n const inProgressEntry = this.inProgressGets.get(index)\n this.inProgressGets.delete(index)\n\n for (const { opts, cb } of inProgressEntry) {\n if (err) {\n cb(err)\n } else {\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n let slicedBuf = buf\n if (offset !== 0 || len !== buf.length) {\n slicedBuf = buf.slice(offset, len + offset)\n }\n cb(null, slicedBuf)\n }\n }\n })\n }\n }\n\n close (cb = () => {}) {\n if (!this.cache) {\n return queueMicrotask(() => cb(new Error('CacheStore closed')))\n }\n\n this.cache = null\n this.store.close(cb)\n }\n\n destroy (cb = () => {}) {\n if (!this.cache) {\n return queueMicrotask(() => cb(new Error('CacheStore closed')))\n }\n\n this.cache = null\n this.store.destroy(cb)\n }\n}\n\nmodule.exports = CacheStore\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBind = require('./');\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n","'use strict';\n\nvar bind = require('function-bind');\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $apply = GetIntrinsic('%Function.prototype.apply%');\nvar $call = GetIntrinsic('%Function.prototype.call%');\nvar $reflectApply = GetIntrinsic('%Reflect.apply%', true) || bind.call($call, $apply);\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\nvar $defineProperty = GetIntrinsic('%Object.defineProperty%', true);\nvar $max = GetIntrinsic('%Math.max%');\n\nif ($defineProperty) {\n\ttry {\n\t\t$defineProperty({}, 'a', { value: 1 });\n\t} catch (e) {\n\t\t// IE 8 has a broken defineProperty\n\t\t$defineProperty = null;\n\t}\n}\n\nmodule.exports = function callBind(originalFunction) {\n\tvar func = $reflectApply(bind, $call, arguments);\n\tif ($gOPD && $defineProperty) {\n\t\tvar desc = $gOPD(func, 'length');\n\t\tif (desc.configurable) {\n\t\t\t// original length, plus the receiver, minus any additional arguments (after the receiver)\n\t\t\t$defineProperty(\n\t\t\t\tfunc,\n\t\t\t\t'length',\n\t\t\t\t{ value: 1 + $max(0, originalFunction.length - (arguments.length - 1)) }\n\t\t\t);\n\t\t}\n\t}\n\treturn func;\n};\n\nvar applyBind = function applyBind() {\n\treturn $reflectApply(bind, $apply, arguments);\n};\n\nif ($defineProperty) {\n\t$defineProperty(module.exports, 'apply', { value: applyBind });\n} else {\n\tmodule.exports.apply = applyBind;\n}\n","const BlockStream = require('block-stream2')\nconst stream = require('readable-stream')\n\nclass ChunkStoreWriteStream extends stream.Writable {\n constructor (store, chunkLength, opts = {}) {\n super(opts)\n\n if (!store || !store.put || !store.get) {\n throw new Error('First argument must be an abstract-chunk-store compliant store')\n }\n chunkLength = Number(chunkLength)\n if (!chunkLength) throw new Error('Second argument must be a chunk length')\n\n const zeroPadding = opts.zeroPadding === undefined ? false : opts.zeroPadding\n this._blockstream = new BlockStream(chunkLength, { ...opts, zeroPadding })\n this._outstandingPuts = 0\n this._storeMaxOutstandingPuts = opts.storeMaxOutstandingPuts || 16\n\n let index = 0\n const onData = chunk => {\n if (this.destroyed) return\n\n this._outstandingPuts += 1\n if (this._outstandingPuts >= this._storeMaxOutstandingPuts) {\n this._blockstream.pause()\n }\n store.put(index, chunk, (err) => {\n if (err) return this.destroy(err)\n this._outstandingPuts -= 1\n if (this._outstandingPuts < this._storeMaxOutstandingPuts) {\n this._blockstream.resume()\n }\n if (this._outstandingPuts === 0 && typeof this._finalCb === 'function') {\n this._finalCb(null)\n this._finalCb = null\n }\n })\n index += 1\n }\n\n this._blockstream\n .on('data', onData)\n .on('error', err => { this.destroy(err) })\n }\n\n _write (chunk, encoding, callback) {\n this._blockstream.write(chunk, encoding, callback)\n }\n\n _final (cb) {\n this._blockstream.end()\n this._blockstream.once('end', () => {\n if (this._outstandingPuts === 0) cb(null)\n else this._finalCb = cb\n })\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n\n if (err) this.emit('error', err)\n this.emit('close')\n }\n}\n\nmodule.exports = ChunkStoreWriteStream\n","var Buffer = require('safe-buffer').Buffer\nvar Transform = require('stream').Transform\nvar StringDecoder = require('string_decoder').StringDecoder\nvar inherits = require('inherits')\n\nfunction CipherBase (hashMode) {\n Transform.call(this)\n this.hashMode = typeof hashMode === 'string'\n if (this.hashMode) {\n this[hashMode] = this._finalOrDigest\n } else {\n this.final = this._finalOrDigest\n }\n if (this._final) {\n this.__final = this._final\n this._final = null\n }\n this._decoder = null\n this._encoding = null\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 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 () {}\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 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}\nCipherBase.prototype._flush = function (done) {\n var err\n try {\n this.push(this.__final())\n } catch (e) {\n err = e\n }\n\n done(err)\n}\nCipherBase.prototype._finalOrDigest = function (outputEnc) {\n var outData = this.__final() || Buffer.alloc(0)\n if (outputEnc) {\n outData = this._toString(outData, outputEnc, true)\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 if (fin) {\n out += this._decoder.end()\n }\n\n return out\n}\n\nmodule.exports = CipherBase\n","var clone = (function() {\n'use strict';\n\nfunction _instanceof(obj, type) {\n return type != null && obj instanceof type;\n}\n\nvar nativeMap;\ntry {\n nativeMap = Map;\n} catch(_) {\n // maybe a reference error because no `Map`. Give it a dummy value that no\n // value will ever be an instanceof.\n nativeMap = function() {};\n}\n\nvar nativeSet;\ntry {\n nativeSet = Set;\n} catch(_) {\n nativeSet = function() {};\n}\n\nvar nativePromise;\ntry {\n nativePromise = Promise;\n} catch(_) {\n nativePromise = function() {};\n}\n\n/**\n * Clones (copies) an Object using deep copying.\n *\n * This function supports circular references by default, but if you are certain\n * there are no circular references in your object, you can save some CPU time\n * by calling clone(obj, false).\n *\n * Caution: if `circular` is false and `parent` contains circular references,\n * your program may enter an infinite loop and crash.\n *\n * @param `parent` - the object to be cloned\n * @param `circular` - set to true if the object to be cloned may contain\n * circular references. (optional - true by default)\n * @param `depth` - set to a number if the object is only to be cloned to\n * a particular depth. (optional - defaults to Infinity)\n * @param `prototype` - sets the prototype to be used when cloning an object.\n * (optional - defaults to parent prototype).\n * @param `includeNonEnumerable` - set to true if the non-enumerable properties\n * should be cloned as well. Non-enumerable properties on the prototype\n * chain will be ignored. (optional - false by default)\n*/\nfunction clone(parent, circular, depth, prototype, includeNonEnumerable) {\n if (typeof circular === 'object') {\n depth = circular.depth;\n prototype = circular.prototype;\n includeNonEnumerable = circular.includeNonEnumerable;\n circular = circular.circular;\n }\n // maintain two arrays for circular references, where corresponding parents\n // and children have the same index\n var allParents = [];\n var allChildren = [];\n\n var useBuffer = typeof Buffer != 'undefined';\n\n if (typeof circular == 'undefined')\n circular = true;\n\n if (typeof depth == 'undefined')\n depth = Infinity;\n\n // recurse this function so we don't reset allParents and allChildren\n function _clone(parent, depth) {\n // cloning null always returns null\n if (parent === null)\n return null;\n\n if (depth === 0)\n return parent;\n\n var child;\n var proto;\n if (typeof parent != 'object') {\n return parent;\n }\n\n if (_instanceof(parent, nativeMap)) {\n child = new nativeMap();\n } else if (_instanceof(parent, nativeSet)) {\n child = new nativeSet();\n } else if (_instanceof(parent, nativePromise)) {\n child = new nativePromise(function (resolve, reject) {\n parent.then(function(value) {\n resolve(_clone(value, depth - 1));\n }, function(err) {\n reject(_clone(err, depth - 1));\n });\n });\n } else if (clone.__isArray(parent)) {\n child = [];\n } else if (clone.__isRegExp(parent)) {\n child = new RegExp(parent.source, __getRegExpFlags(parent));\n if (parent.lastIndex) child.lastIndex = parent.lastIndex;\n } else if (clone.__isDate(parent)) {\n child = new Date(parent.getTime());\n } else if (useBuffer && Buffer.isBuffer(parent)) {\n if (Buffer.allocUnsafe) {\n // Node.js >= 4.5.0\n child = Buffer.allocUnsafe(parent.length);\n } else {\n // Older Node.js versions\n child = new Buffer(parent.length);\n }\n parent.copy(child);\n return child;\n } else if (_instanceof(parent, Error)) {\n child = Object.create(parent);\n } else {\n if (typeof prototype == 'undefined') {\n proto = Object.getPrototypeOf(parent);\n child = Object.create(proto);\n }\n else {\n child = Object.create(prototype);\n proto = prototype;\n }\n }\n\n if (circular) {\n var index = allParents.indexOf(parent);\n\n if (index != -1) {\n return allChildren[index];\n }\n allParents.push(parent);\n allChildren.push(child);\n }\n\n if (_instanceof(parent, nativeMap)) {\n parent.forEach(function(value, key) {\n var keyChild = _clone(key, depth - 1);\n var valueChild = _clone(value, depth - 1);\n child.set(keyChild, valueChild);\n });\n }\n if (_instanceof(parent, nativeSet)) {\n parent.forEach(function(value) {\n var entryChild = _clone(value, depth - 1);\n child.add(entryChild);\n });\n }\n\n for (var i in parent) {\n var attrs;\n if (proto) {\n attrs = Object.getOwnPropertyDescriptor(proto, i);\n }\n\n if (attrs && attrs.set == null) {\n continue;\n }\n child[i] = _clone(parent[i], depth - 1);\n }\n\n if (Object.getOwnPropertySymbols) {\n var symbols = Object.getOwnPropertySymbols(parent);\n for (var i = 0; i < symbols.length; i++) {\n // Don't need to worry about cloning a symbol because it is a primitive,\n // like a number or string.\n var symbol = symbols[i];\n var descriptor = Object.getOwnPropertyDescriptor(parent, symbol);\n if (descriptor && !descriptor.enumerable && !includeNonEnumerable) {\n continue;\n }\n child[symbol] = _clone(parent[symbol], depth - 1);\n if (!descriptor.enumerable) {\n Object.defineProperty(child, symbol, {\n enumerable: false\n });\n }\n }\n }\n\n if (includeNonEnumerable) {\n var allPropertyNames = Object.getOwnPropertyNames(parent);\n for (var i = 0; i < allPropertyNames.length; i++) {\n var propertyName = allPropertyNames[i];\n var descriptor = Object.getOwnPropertyDescriptor(parent, propertyName);\n if (descriptor && descriptor.enumerable) {\n continue;\n }\n child[propertyName] = _clone(parent[propertyName], depth - 1);\n Object.defineProperty(child, propertyName, {\n enumerable: false\n });\n }\n }\n\n return child;\n }\n\n return _clone(parent, depth);\n}\n\n/**\n * Simple flat clone using prototype, accepts only objects, usefull for property\n * override on FLAT configuration object (no nested props).\n *\n * USE WITH CAUTION! This may not behave as you wish if you do not know how this\n * works.\n */\nclone.clonePrototype = function clonePrototype(parent) {\n if (parent === null)\n return null;\n\n var c = function () {};\n c.prototype = parent;\n return new c();\n};\n\n// private utility functions\n\nfunction __objToStr(o) {\n return Object.prototype.toString.call(o);\n}\nclone.__objToStr = __objToStr;\n\nfunction __isDate(o) {\n return typeof o === 'object' && __objToStr(o) === '[object Date]';\n}\nclone.__isDate = __isDate;\n\nfunction __isArray(o) {\n return typeof o === 'object' && __objToStr(o) === '[object Array]';\n}\nclone.__isArray = __isArray;\n\nfunction __isRegExp(o) {\n return typeof o === 'object' && __objToStr(o) === '[object RegExp]';\n}\nclone.__isRegExp = __isRegExp;\n\nfunction __getRegExpFlags(re) {\n var flags = '';\n if (re.global) flags += 'g';\n if (re.ignoreCase) flags += 'i';\n if (re.multiline) flags += 'm';\n return flags;\n}\nclone.__getRegExpFlags = __getRegExpFlags;\n\nreturn clone;\n})();\n\nif (typeof module === 'object' && module.exports) {\n module.exports = clone;\n}\n","/*global window, global*/\nvar util = require(\"util\")\nvar assert = require(\"assert\")\nfunction now() { return new Date().getTime() }\n\nvar slice = Array.prototype.slice\nvar console\nvar times = {}\n\nif (typeof global !== \"undefined\" && global.console) {\n console = global.console\n} else if (typeof window !== \"undefined\" && window.console) {\n console = window.console\n} else {\n console = {}\n}\n\nvar functions = [\n [log, \"log\"],\n [info, \"info\"],\n [warn, \"warn\"],\n [error, \"error\"],\n [time, \"time\"],\n [timeEnd, \"timeEnd\"],\n [trace, \"trace\"],\n [dir, \"dir\"],\n [consoleAssert, \"assert\"]\n]\n\nfor (var i = 0; i < functions.length; i++) {\n var tuple = functions[i]\n var f = tuple[0]\n var name = tuple[1]\n\n if (!console[name]) {\n console[name] = f\n }\n}\n\nmodule.exports = console\n\nfunction log() {}\n\nfunction info() {\n console.log.apply(console, arguments)\n}\n\nfunction warn() {\n console.log.apply(console, arguments)\n}\n\nfunction error() {\n console.warn.apply(console, arguments)\n}\n\nfunction time(label) {\n times[label] = now()\n}\n\nfunction timeEnd(label) {\n var time = times[label]\n if (!time) {\n throw new Error(\"No such label: \" + label)\n }\n\n delete times[label]\n var duration = now() - time\n console.log(label + \": \" + duration + \"ms\")\n}\n\nfunction trace() {\n var err = new Error()\n err.name = \"Trace\"\n err.message = util.format.apply(null, arguments)\n console.error(err.stack)\n}\n\nfunction dir(object) {\n console.log(util.inspect(object) + \"\\n\")\n}\n\nfunction consoleAssert(expression) {\n if (!expression) {\n var arr = slice.call(arguments, 1)\n assert.ok(false, util.format.apply(null, arr))\n }\n}\n","module.exports = function cpus () {\n var num = navigator.hardwareConcurrency || 1\n var cpus = []\n for (var i = 0; i < num; i++) {\n cpus.push({\n model: '',\n speed: 0,\n times: { user: 0, nice: 0, sys: 0, idle: 0, irq: 0 }\n })\n }\n return cpus\n}\n","var elliptic = require('elliptic')\nvar BN = require('bn.js')\n\nmodule.exports = function createECDH (curve) {\n return new ECDH(curve)\n}\n\nvar aliases = {\n secp256k1: {\n name: 'secp256k1',\n byteLength: 32\n },\n secp224r1: {\n name: 'p224',\n byteLength: 28\n },\n prime256v1: {\n name: 'p256',\n byteLength: 32\n },\n prime192v1: {\n name: 'p192',\n byteLength: 24\n },\n ed25519: {\n name: 'ed25519',\n byteLength: 32\n },\n secp384r1: {\n name: 'p384',\n byteLength: 48\n },\n secp521r1: {\n name: 'p521',\n byteLength: 66\n }\n}\n\naliases.p224 = aliases.secp224r1\naliases.p256 = aliases.secp256r1 = aliases.prime256v1\naliases.p192 = aliases.secp192r1 = aliases.prime192v1\naliases.p384 = aliases.secp384r1\naliases.p521 = aliases.secp521r1\n\nfunction ECDH (curve) {\n this.curveType = aliases[curve]\n if (!this.curveType) {\n this.curveType = {\n name: curve\n }\n }\n this.curve = new elliptic.ec(this.curveType.name) // eslint-disable-line new-cap\n this.keys = void 0\n}\n\nECDH.prototype.generateKeys = function (enc, format) {\n this.keys = this.curve.genKeyPair()\n return this.getPublicKey(enc, format)\n}\n\nECDH.prototype.computeSecret = function (other, inenc, enc) {\n inenc = inenc || 'utf8'\n if (!Buffer.isBuffer(other)) {\n other = new Buffer(other, inenc)\n }\n var otherPub = this.curve.keyFromPublic(other).getPublic()\n var out = otherPub.mul(this.keys.getPrivate()).getX()\n return formatReturnValue(out, enc, this.curveType.byteLength)\n}\n\nECDH.prototype.getPublicKey = function (enc, format) {\n var key = this.keys.getPublic(format === 'compressed', true)\n if (format === 'hybrid') {\n if (key[key.length - 1] % 2) {\n key[0] = 7\n } else {\n key[0] = 6\n }\n }\n return formatReturnValue(key, enc)\n}\n\nECDH.prototype.getPrivateKey = function (enc) {\n return formatReturnValue(this.keys.getPrivate(), enc)\n}\n\nECDH.prototype.setPublicKey = function (pub, enc) {\n enc = enc || 'utf8'\n if (!Buffer.isBuffer(pub)) {\n pub = new Buffer(pub, enc)\n }\n this.keys._importPublic(pub)\n return this\n}\n\nECDH.prototype.setPrivateKey = function (priv, enc) {\n enc = enc || 'utf8'\n if (!Buffer.isBuffer(priv)) {\n priv = new Buffer(priv, enc)\n }\n\n var _priv = new BN(priv)\n _priv = _priv.toString(16)\n this.keys = this.curve.genKeyPair()\n this.keys._importPrivate(_priv)\n return this\n}\n\nfunction formatReturnValue (bn, enc, len) {\n if (!Array.isArray(bn)) {\n bn = bn.toArray()\n }\n var buf = new Buffer(bn)\n if (len && buf.length < len) {\n var zeros = new Buffer(len - buf.length)\n zeros.fill(0)\n buf = Buffer.concat([zeros, buf])\n }\n if (!enc) {\n return buf\n } else {\n return buf.toString(enc)\n }\n}\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","'use strict'\nvar inherits = require('inherits')\nvar MD5 = require('md5.js')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Base = require('cipher-base')\n\nfunction Hash (hash) {\n Base.call(this, 'digest')\n\n this._hash = hash\n}\n\ninherits(Hash, Base)\n\nHash.prototype._update = function (data) {\n this._hash.update(data)\n}\n\nHash.prototype._final = function () {\n return this._hash.digest()\n}\n\nmodule.exports = function createHash (alg) {\n alg = alg.toLowerCase()\n if (alg === 'md5') return new MD5()\n if (alg === 'rmd160' || alg === 'ripemd160') return new RIPEMD160()\n\n return new Hash(sha(alg))\n}\n","var MD5 = require('md5.js')\n\nmodule.exports = function (buffer) {\n return new MD5().update(buffer).digest()\n}\n","'use strict'\nvar inherits = require('inherits')\nvar Legacy = require('./legacy')\nvar Base = require('cipher-base')\nvar Buffer = require('safe-buffer').Buffer\nvar md5 = require('create-hash/md5')\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 if (typeof key === 'string') {\n key = Buffer.from(key)\n }\n\n var blocksize = (alg === 'sha512' || alg === 'sha384') ? 128 : 64\n\n this._alg = alg\n this._key = key\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 this._hash = alg === 'rmd160' ? new RIPEMD160() : sha(alg)\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 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 if (alg === 'rmd160' || alg === 'ripemd160') {\n return new Hmac('rmd160', key)\n }\n if (alg === 'md5') {\n return new Legacy(md5, key)\n }\n return new Hmac(alg, key)\n}\n","'use strict'\nvar inherits = require('inherits')\nvar Buffer = require('safe-buffer').Buffer\n\nvar Base = require('cipher-base')\n\nvar ZEROS = Buffer.alloc(128)\nvar blocksize = 64\n\nfunction Hmac (alg, key) {\n Base.call(this, 'digest')\n if (typeof key === 'string') {\n key = Buffer.from(key)\n }\n\n this._alg = alg\n this._key = key\n\n if (key.length > blocksize) {\n key = alg(key)\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 = [ipad]\n}\n\ninherits(Hmac, Base)\n\nHmac.prototype._update = function (data) {\n this._hash.push(data)\n}\n\nHmac.prototype._final = function () {\n var h = this._alg(Buffer.concat(this._hash))\n return this._alg(Buffer.concat([this._opad, h]))\n}\nmodule.exports = Hmac\n","/*! create-torrent. MIT License. WebTorrent LLC */\nconst bencode = require('bencode')\nconst BlockStream = require('block-stream2')\nconst calcPieceLength = require('piece-length')\nconst corePath = require('path')\nconst FileReadStream = require('filestream/read')\nconst isFile = require('is-file')\nconst junk = require('junk')\nconst MultiStream = require('multistream')\nconst once = require('once')\nconst parallel = require('run-parallel')\nconst queueMicrotask = require('queue-microtask')\nconst sha1 = require('simple-sha1')\nconst stream = require('readable-stream')\n\nconst getFiles = require('./get-files') // browser exclude\n\nconst announceList = [\n ['udp://tracker.leechers-paradise.org:6969'],\n ['udp://tracker.coppersurfer.tk:6969'],\n ['udp://tracker.opentrackr.org:1337'],\n ['udp://explodie.org:6969'],\n ['udp://tracker.empire-js.us:1337'],\n ['wss://tracker.btorrent.xyz'],\n ['wss://tracker.openwebtorrent.com']\n]\n\n/**\n * Create a torrent.\n * @param {string|File|FileList|Buffer|Stream|Array.} input\n * @param {Object} opts\n * @param {string=} opts.name\n * @param {Date=} opts.creationDate\n * @param {string=} opts.comment\n * @param {string=} opts.createdBy\n * @param {boolean|number=} opts.private\n * @param {number=} opts.pieceLength\n * @param {Array.>=} opts.announceList\n * @param {Array.=} opts.urlList\n * @param {Object=} opts.info\n * @param {Function} opts.onProgress\n * @param {function} cb\n * @return {Buffer} buffer of .torrent file data\n */\nfunction createTorrent (input, opts, cb) {\n if (typeof opts === 'function') [opts, cb] = [cb, opts]\n opts = opts ? Object.assign({}, opts) : {}\n\n _parseInput(input, opts, (err, files, singleFileTorrent) => {\n if (err) return cb(err)\n opts.singleFileTorrent = singleFileTorrent\n onFiles(files, opts, cb)\n })\n}\n\nfunction parseInput (input, opts, cb) {\n if (typeof opts === 'function') [opts, cb] = [cb, opts]\n opts = opts ? Object.assign({}, opts) : {}\n _parseInput(input, opts, cb)\n}\n\n/**\n * Parse input file and return file information.\n */\nfunction _parseInput (input, opts, cb) {\n if (isFileList(input)) input = Array.from(input)\n if (!Array.isArray(input)) input = [input]\n\n if (input.length === 0) throw new Error('invalid input type')\n\n input.forEach(item => {\n if (item == null) throw new Error(`invalid input type: ${item}`)\n })\n\n // In Electron, use the true file path\n input = input.map(item => {\n if (isBlob(item) && typeof item.path === 'string' && typeof getFiles === 'function') return item.path\n return item\n })\n\n // If there's just one file, allow the name to be set by `opts.name`\n if (input.length === 1 && typeof input[0] !== 'string' && !input[0].name) input[0].name = opts.name\n\n let commonPrefix = null\n input.forEach((item, i) => {\n if (typeof item === 'string') {\n return\n }\n\n let path = item.fullPath || item.name\n if (!path) {\n path = `Unknown File ${i + 1}`\n item.unknownName = true\n }\n\n item.path = path.split('/')\n\n // Remove initial slash\n if (!item.path[0]) {\n item.path.shift()\n }\n\n if (item.path.length < 2) { // No real prefix\n commonPrefix = null\n } else if (i === 0 && input.length > 1) { // The first file has a prefix\n commonPrefix = item.path[0]\n } else if (item.path[0] !== commonPrefix) { // The prefix doesn't match\n commonPrefix = null\n }\n })\n\n const filterJunkFiles = opts.filterJunkFiles === undefined ? true : opts.filterJunkFiles\n if (filterJunkFiles) {\n // Remove junk files\n input = input.filter(item => {\n if (typeof item === 'string') {\n return true\n }\n return !isJunkPath(item.path)\n })\n }\n\n if (commonPrefix) {\n input.forEach(item => {\n const pathless = (Buffer.isBuffer(item) || isReadable(item)) && !item.path\n if (typeof item === 'string' || pathless) return\n item.path.shift()\n })\n }\n\n if (!opts.name && commonPrefix) {\n opts.name = commonPrefix\n }\n\n if (!opts.name) {\n // use first user-set file name\n input.some(item => {\n if (typeof item === 'string') {\n opts.name = corePath.basename(item)\n return true\n } else if (!item.unknownName) {\n opts.name = item.path[item.path.length - 1]\n return true\n }\n return false\n })\n }\n\n if (!opts.name) {\n opts.name = `Unnamed Torrent ${Date.now()}`\n }\n\n const numPaths = input.reduce((sum, item) => sum + Number(typeof item === 'string'), 0)\n\n let isSingleFileTorrent = (input.length === 1)\n\n if (input.length === 1 && typeof input[0] === 'string') {\n if (typeof getFiles !== 'function') {\n throw new Error('filesystem paths do not work in the browser')\n }\n // If there's a single path, verify it's a file before deciding this is a single\n // file torrent\n isFile(input[0], (err, pathIsFile) => {\n if (err) return cb(err)\n isSingleFileTorrent = pathIsFile\n processInput()\n })\n } else {\n queueMicrotask(processInput)\n }\n\n function processInput () {\n parallel(input.map(item => cb => {\n const file = {}\n\n if (isBlob(item)) {\n file.getStream = getBlobStream(item)\n file.length = item.size\n } else if (Buffer.isBuffer(item)) {\n file.getStream = getBufferStream(item)\n file.length = item.length\n } else if (isReadable(item)) {\n file.getStream = getStreamStream(item, file)\n file.length = 0\n } else if (typeof item === 'string') {\n if (typeof getFiles !== 'function') {\n throw new Error('filesystem paths do not work in the browser')\n }\n const keepRoot = numPaths > 1 || isSingleFileTorrent\n getFiles(item, keepRoot, cb)\n return // early return!\n } else {\n throw new Error('invalid input type')\n }\n file.path = item.path\n cb(null, file)\n }), (err, files) => {\n if (err) return cb(err)\n files = files.flat()\n cb(null, files, isSingleFileTorrent)\n })\n }\n}\n\nconst MAX_OUTSTANDING_HASHES = 5\n\nfunction getPieceList (files, pieceLength, estimatedTorrentLength, opts, cb) {\n cb = once(cb)\n const pieces = []\n let length = 0\n let hashedLength = 0\n\n const streams = files.map(file => file.getStream)\n\n let remainingHashes = 0\n let pieceNum = 0\n let ended = false\n\n const multistream = new MultiStream(streams)\n const blockstream = new BlockStream(pieceLength, { zeroPadding: false })\n\n multistream.on('error', onError)\n\n multistream\n .pipe(blockstream)\n .on('data', onData)\n .on('end', onEnd)\n .on('error', onError)\n\n function onData (chunk) {\n length += chunk.length\n\n const i = pieceNum\n sha1(chunk, hash => {\n pieces[i] = hash\n remainingHashes -= 1\n if (remainingHashes < MAX_OUTSTANDING_HASHES) {\n blockstream.resume()\n }\n hashedLength += chunk.length\n if (opts.onProgress) opts.onProgress(hashedLength, estimatedTorrentLength)\n maybeDone()\n })\n remainingHashes += 1\n if (remainingHashes >= MAX_OUTSTANDING_HASHES) {\n blockstream.pause()\n }\n pieceNum += 1\n }\n\n function onEnd () {\n ended = true\n maybeDone()\n }\n\n function onError (err) {\n cleanup()\n cb(err)\n }\n\n function cleanup () {\n multistream.removeListener('error', onError)\n blockstream.removeListener('data', onData)\n blockstream.removeListener('end', onEnd)\n blockstream.removeListener('error', onError)\n }\n\n function maybeDone () {\n if (ended && remainingHashes === 0) {\n cleanup()\n cb(null, Buffer.from(pieces.join(''), 'hex'), length)\n }\n }\n}\n\nfunction onFiles (files, opts, cb) {\n let announceList = opts.announceList\n\n if (!announceList) {\n if (typeof opts.announce === 'string') announceList = [[opts.announce]]\n else if (Array.isArray(opts.announce)) {\n announceList = opts.announce.map(u => [u])\n }\n }\n\n if (!announceList) announceList = []\n\n if (globalThis.WEBTORRENT_ANNOUNCE) {\n if (typeof globalThis.WEBTORRENT_ANNOUNCE === 'string') {\n announceList.push([[globalThis.WEBTORRENT_ANNOUNCE]])\n } else if (Array.isArray(globalThis.WEBTORRENT_ANNOUNCE)) {\n announceList = announceList.concat(globalThis.WEBTORRENT_ANNOUNCE.map(u => [u]))\n }\n }\n\n // When no trackers specified, use some reasonable defaults\n if (opts.announce === undefined && opts.announceList === undefined) {\n announceList = announceList.concat(module.exports.announceList)\n }\n\n if (typeof opts.urlList === 'string') opts.urlList = [opts.urlList]\n\n const torrent = {\n info: {\n name: opts.name\n },\n 'creation date': Math.ceil((Number(opts.creationDate) || Date.now()) / 1000),\n encoding: 'UTF-8'\n }\n\n if (announceList.length !== 0) {\n torrent.announce = announceList[0][0]\n torrent['announce-list'] = announceList\n }\n\n if (opts.comment !== undefined) torrent.comment = opts.comment\n\n if (opts.createdBy !== undefined) torrent['created by'] = opts.createdBy\n\n if (opts.private !== undefined) torrent.info.private = Number(opts.private)\n\n if (opts.info !== undefined) Object.assign(torrent.info, opts.info)\n\n // \"ssl-cert\" key is for SSL torrents, see:\n // - http://blog.libtorrent.org/2012/01/bittorrent-over-ssl/\n // - http://www.libtorrent.org/manual-ref.html#ssl-torrents\n // - http://www.libtorrent.org/reference-Create_Torrents.html\n if (opts.sslCert !== undefined) torrent.info['ssl-cert'] = opts.sslCert\n\n if (opts.urlList !== undefined) torrent['url-list'] = opts.urlList\n\n const estimatedTorrentLength = files.reduce(sumLength, 0)\n const pieceLength = opts.pieceLength || calcPieceLength(estimatedTorrentLength)\n torrent.info['piece length'] = pieceLength\n\n getPieceList(\n files,\n pieceLength,\n estimatedTorrentLength,\n opts,\n (err, pieces, torrentLength) => {\n if (err) return cb(err)\n torrent.info.pieces = pieces\n\n files.forEach(file => {\n delete file.getStream\n })\n\n if (opts.singleFileTorrent) {\n torrent.info.length = torrentLength\n } else {\n torrent.info.files = files\n }\n\n cb(null, bencode.encode(torrent))\n }\n )\n}\n\n/**\n * Determine if a a file is junk based on its path\n * (defined as hidden OR recognized by the `junk` package)\n *\n * @param {string} path\n * @return {boolean}\n */\nfunction isJunkPath (path) {\n const filename = path[path.length - 1]\n return filename[0] === '.' && junk.is(filename)\n}\n\n/**\n * Accumulator to sum file lengths\n * @param {number} sum\n * @param {Object} file\n * @return {number}\n */\nfunction sumLength (sum, file) {\n return sum + file.length\n}\n\n/**\n * Check if `obj` is a W3C `Blob` object (which `File` inherits from)\n * @param {*} obj\n * @return {boolean}\n */\nfunction isBlob (obj) {\n return typeof Blob !== 'undefined' && obj instanceof Blob\n}\n\n/**\n * Check if `obj` is a W3C `FileList` object\n * @param {*} obj\n * @return {boolean}\n */\nfunction isFileList (obj) {\n return typeof FileList !== 'undefined' && obj instanceof FileList\n}\n\n/**\n * Check if `obj` is a node Readable stream\n * @param {*} obj\n * @return {boolean}\n */\nfunction isReadable (obj) {\n return typeof obj === 'object' && obj != null && typeof obj.pipe === 'function'\n}\n\n/**\n * Convert a `File` to a lazy readable stream.\n * @param {File|Blob} file\n * @return {function}\n */\nfunction getBlobStream (file) {\n return () => new FileReadStream(file)\n}\n\n/**\n * Convert a `Buffer` to a lazy readable stream.\n * @param {Buffer} buffer\n * @return {function}\n */\nfunction getBufferStream (buffer) {\n return () => {\n const s = new stream.PassThrough()\n s.end(buffer)\n return s\n }\n}\n\n/**\n * Convert a readable stream to a lazy readable stream. Adds instrumentation to track\n * the number of bytes in the stream and set `file.length`.\n *\n * @param {Stream} readable\n * @param {Object} file\n * @return {function}\n */\nfunction getStreamStream (readable, file) {\n return () => {\n const counter = new stream.Transform()\n counter._transform = function (buf, enc, done) {\n file.length += buf.length\n this.push(buf)\n done()\n }\n readable.pipe(counter)\n return counter\n }\n}\n\nmodule.exports = createTorrent\nmodule.exports.parseInput = parseInput\nmodule.exports.announceList = announceList\nmodule.exports.isJunkPath = isJunkPath\n","'use strict'\n\nexports.randomBytes = exports.rng = exports.pseudoRandomBytes = exports.prng = require('randombytes')\nexports.createHash = exports.Hash = require('create-hash')\nexports.createHmac = exports.Hmac = require('create-hmac')\n\nvar algos = require('browserify-sign/algos')\nvar algoKeys = Object.keys(algos)\nvar hashes = ['sha1', 'sha224', 'sha256', 'sha384', 'sha512', 'md5', 'rmd160'].concat(algoKeys)\nexports.getHashes = function () {\n return hashes\n}\n\nvar p = require('pbkdf2')\nexports.pbkdf2 = p.pbkdf2\nexports.pbkdf2Sync = p.pbkdf2Sync\n\nvar aes = require('browserify-cipher')\n\nexports.Cipher = aes.Cipher\nexports.createCipher = aes.createCipher\nexports.Cipheriv = aes.Cipheriv\nexports.createCipheriv = aes.createCipheriv\nexports.Decipher = aes.Decipher\nexports.createDecipher = aes.createDecipher\nexports.Decipheriv = aes.Decipheriv\nexports.createDecipheriv = aes.createDecipheriv\nexports.getCiphers = aes.getCiphers\nexports.listCiphers = aes.listCiphers\n\nvar dh = require('diffie-hellman')\n\nexports.DiffieHellmanGroup = dh.DiffieHellmanGroup\nexports.createDiffieHellmanGroup = dh.createDiffieHellmanGroup\nexports.getDiffieHellman = dh.getDiffieHellman\nexports.createDiffieHellman = dh.createDiffieHellman\nexports.DiffieHellman = dh.DiffieHellman\n\nvar sign = require('browserify-sign')\n\nexports.createSign = sign.createSign\nexports.Sign = sign.Sign\nexports.createVerify = sign.createVerify\nexports.Verify = sign.Verify\n\nexports.createECDH = require('create-ecdh')\n\nvar publicEncrypt = require('public-encrypt')\n\nexports.publicEncrypt = publicEncrypt.publicEncrypt\nexports.privateEncrypt = publicEncrypt.privateEncrypt\nexports.publicDecrypt = publicEncrypt.publicDecrypt\nexports.privateDecrypt = publicEncrypt.privateDecrypt\n\n// the least I can do is make error messages for the rest of the node.js/crypto api.\n// ;[\n// 'createCredentials'\n// ].forEach(function (name) {\n// exports[name] = function () {\n// throw new Error([\n// 'sorry, ' + name + ' is not implemented yet',\n// 'we accept pull requests',\n// 'https://github.com/crypto-browserify/crypto-browserify'\n// ].join('\\n'))\n// }\n// })\n\nvar rf = require('randomfill')\n\nexports.randomFill = rf.randomFill\nexports.randomFillSync = rf.randomFillSync\n\nexports.createCredentials = function () {\n throw new Error([\n 'sorry, createCredentials is not implemented yet',\n 'we accept pull requests',\n 'https://github.com/crypto-browserify/crypto-browserify'\n ].join('\\n'))\n}\n\nexports.constants = {\n 'DH_CHECK_P_NOT_SAFE_PRIME': 2,\n 'DH_CHECK_P_NOT_PRIME': 1,\n 'DH_UNABLE_TO_CHECK_GENERATOR': 4,\n 'DH_NOT_SUITABLE_GENERATOR': 8,\n 'NPN_ENABLED': 1,\n 'ALPN_ENABLED': 1,\n 'RSA_PKCS1_PADDING': 1,\n 'RSA_SSLV23_PADDING': 2,\n 'RSA_NO_PADDING': 3,\n 'RSA_PKCS1_OAEP_PADDING': 4,\n 'RSA_X931_PADDING': 5,\n 'RSA_PKCS1_PSS_PADDING': 6,\n 'POINT_CONVERSION_COMPRESSED': 2,\n 'POINT_CONVERSION_UNCOMPRESSED': 4,\n 'POINT_CONVERSION_HYBRID': 6\n}\n","/* eslint-env browser */\n\n/**\n * This is the web browser implementation of `debug()`.\n */\n\nexports.formatArgs = formatArgs;\nexports.save = save;\nexports.load = load;\nexports.useColors = useColors;\nexports.storage = localstorage();\nexports.destroy = (() => {\n\tlet warned = false;\n\n\treturn () => {\n\t\tif (!warned) {\n\t\t\twarned = true;\n\t\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t\t}\n\t};\n})();\n\n/**\n * Colors.\n */\n\nexports.colors = [\n\t'#0000CC',\n\t'#0000FF',\n\t'#0033CC',\n\t'#0033FF',\n\t'#0066CC',\n\t'#0066FF',\n\t'#0099CC',\n\t'#0099FF',\n\t'#00CC00',\n\t'#00CC33',\n\t'#00CC66',\n\t'#00CC99',\n\t'#00CCCC',\n\t'#00CCFF',\n\t'#3300CC',\n\t'#3300FF',\n\t'#3333CC',\n\t'#3333FF',\n\t'#3366CC',\n\t'#3366FF',\n\t'#3399CC',\n\t'#3399FF',\n\t'#33CC00',\n\t'#33CC33',\n\t'#33CC66',\n\t'#33CC99',\n\t'#33CCCC',\n\t'#33CCFF',\n\t'#6600CC',\n\t'#6600FF',\n\t'#6633CC',\n\t'#6633FF',\n\t'#66CC00',\n\t'#66CC33',\n\t'#9900CC',\n\t'#9900FF',\n\t'#9933CC',\n\t'#9933FF',\n\t'#99CC00',\n\t'#99CC33',\n\t'#CC0000',\n\t'#CC0033',\n\t'#CC0066',\n\t'#CC0099',\n\t'#CC00CC',\n\t'#CC00FF',\n\t'#CC3300',\n\t'#CC3333',\n\t'#CC3366',\n\t'#CC3399',\n\t'#CC33CC',\n\t'#CC33FF',\n\t'#CC6600',\n\t'#CC6633',\n\t'#CC9900',\n\t'#CC9933',\n\t'#CCCC00',\n\t'#CCCC33',\n\t'#FF0000',\n\t'#FF0033',\n\t'#FF0066',\n\t'#FF0099',\n\t'#FF00CC',\n\t'#FF00FF',\n\t'#FF3300',\n\t'#FF3333',\n\t'#FF3366',\n\t'#FF3399',\n\t'#FF33CC',\n\t'#FF33FF',\n\t'#FF6600',\n\t'#FF6633',\n\t'#FF9900',\n\t'#FF9933',\n\t'#FFCC00',\n\t'#FFCC33'\n];\n\n/**\n * Currently only WebKit-based Web Inspectors, Firefox >= v31,\n * and the Firebug extension (any Firefox version) are known\n * to support \"%c\" CSS customizations.\n *\n * TODO: add a `localStorage` variable to explicitly enable/disable colors\n */\n\n// eslint-disable-next-line complexity\nfunction useColors() {\n\t// NB: In an Electron preload script, document will be defined but not fully\n\t// initialized. Since we know we're in Chrome, we'll just detect this case\n\t// explicitly\n\tif (typeof window !== 'undefined' && window.process && (window.process.type === 'renderer' || window.process.__nwjs)) {\n\t\treturn true;\n\t}\n\n\t// Internet Explorer and Edge do not support colors.\n\tif (typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\\/(\\d+)/)) {\n\t\treturn false;\n\t}\n\n\t// Is webkit? http://stackoverflow.com/a/16459606/376773\n\t// document is undefined in react-native: https://github.com/facebook/react-native/pull/1632\n\treturn (typeof document !== 'undefined' && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance) ||\n\t\t// Is firebug? http://stackoverflow.com/a/398120/376773\n\t\t(typeof window !== 'undefined' && window.console && (window.console.firebug || (window.console.exception && window.console.table))) ||\n\t\t// Is firefox >= v31?\n\t\t// https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/) && parseInt(RegExp.$1, 10) >= 31) ||\n\t\t// Double check webkit in userAgent just in case we are in a worker\n\t\t(typeof navigator !== 'undefined' && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\\/(\\d+)/));\n}\n\n/**\n * Colorize log arguments if enabled.\n *\n * @api public\n */\n\nfunction formatArgs(args) {\n\targs[0] = (this.useColors ? '%c' : '') +\n\t\tthis.namespace +\n\t\t(this.useColors ? ' %c' : ' ') +\n\t\targs[0] +\n\t\t(this.useColors ? '%c ' : ' ') +\n\t\t'+' + module.exports.humanize(this.diff);\n\n\tif (!this.useColors) {\n\t\treturn;\n\t}\n\n\tconst c = 'color: ' + this.color;\n\targs.splice(1, 0, c, 'color: inherit');\n\n\t// The final \"%c\" is somewhat tricky, because there could be other\n\t// arguments passed either before or after the %c, so we need to\n\t// figure out the correct index to insert the CSS into\n\tlet index = 0;\n\tlet lastC = 0;\n\targs[0].replace(/%[a-zA-Z%]/g, match => {\n\t\tif (match === '%%') {\n\t\t\treturn;\n\t\t}\n\t\tindex++;\n\t\tif (match === '%c') {\n\t\t\t// We only are interested in the *last* %c\n\t\t\t// (the user may have provided their own)\n\t\t\tlastC = index;\n\t\t}\n\t});\n\n\targs.splice(lastC, 0, c);\n}\n\n/**\n * Invokes `console.debug()` when available.\n * No-op when `console.debug` is not a \"function\".\n * If `console.debug` is not available, falls back\n * to `console.log`.\n *\n * @api public\n */\nexports.log = console.debug || console.log || (() => {});\n\n/**\n * Save `namespaces`.\n *\n * @param {String} namespaces\n * @api private\n */\nfunction save(namespaces) {\n\ttry {\n\t\tif (namespaces) {\n\t\t\texports.storage.setItem('debug', namespaces);\n\t\t} else {\n\t\t\texports.storage.removeItem('debug');\n\t\t}\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\n/**\n * Load `namespaces`.\n *\n * @return {String} returns the previously persisted debug modes\n * @api private\n */\nfunction load() {\n\tlet r;\n\ttry {\n\t\tr = exports.storage.getItem('debug');\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n\n\t// If debug isn't set in LS, and we're in Electron, try to load $DEBUG\n\tif (!r && typeof process !== 'undefined' && 'env' in process) {\n\t\tr = process.env.DEBUG;\n\t}\n\n\treturn r;\n}\n\n/**\n * Localstorage attempts to return the localstorage.\n *\n * This is necessary because safari throws\n * when a user disables cookies/localstorage\n * and you attempt to access it.\n *\n * @return {LocalStorage}\n * @api private\n */\n\nfunction localstorage() {\n\ttry {\n\t\t// TVMLKit (Apple TV JS Runtime) does not have a window object, just localStorage in the global context\n\t\t// The Browser also has localStorage in the global context.\n\t\treturn localStorage;\n\t} catch (error) {\n\t\t// Swallow\n\t\t// XXX (@Qix-) should we be logging these?\n\t}\n}\n\nmodule.exports = require('./common')(exports);\n\nconst {formatters} = module.exports;\n\n/**\n * Map %j to `JSON.stringify()`, since no Web Inspectors do that by default.\n */\n\nformatters.j = function (v) {\n\ttry {\n\t\treturn JSON.stringify(v);\n\t} catch (error) {\n\t\treturn '[UnexpectedJSONParseError]: ' + error.message;\n\t}\n};\n","\n/**\n * This is the common logic for both the Node.js and web browser\n * implementations of `debug()`.\n */\n\nfunction setup(env) {\n\tcreateDebug.debug = createDebug;\n\tcreateDebug.default = createDebug;\n\tcreateDebug.coerce = coerce;\n\tcreateDebug.disable = disable;\n\tcreateDebug.enable = enable;\n\tcreateDebug.enabled = enabled;\n\tcreateDebug.humanize = require('ms');\n\tcreateDebug.destroy = destroy;\n\n\tObject.keys(env).forEach(key => {\n\t\tcreateDebug[key] = env[key];\n\t});\n\n\t/**\n\t* The currently active debug mode names, and names to skip.\n\t*/\n\n\tcreateDebug.names = [];\n\tcreateDebug.skips = [];\n\n\t/**\n\t* Map of special \"%n\" handling functions, for the debug \"format\" argument.\n\t*\n\t* Valid key names are a single, lower or upper-case letter, i.e. \"n\" and \"N\".\n\t*/\n\tcreateDebug.formatters = {};\n\n\t/**\n\t* Selects a color for a debug namespace\n\t* @param {String} namespace The namespace string for the debug instance to be colored\n\t* @return {Number|String} An ANSI color code for the given namespace\n\t* @api private\n\t*/\n\tfunction selectColor(namespace) {\n\t\tlet hash = 0;\n\n\t\tfor (let i = 0; i < namespace.length; i++) {\n\t\t\thash = ((hash << 5) - hash) + namespace.charCodeAt(i);\n\t\t\thash |= 0; // Convert to 32bit integer\n\t\t}\n\n\t\treturn createDebug.colors[Math.abs(hash) % createDebug.colors.length];\n\t}\n\tcreateDebug.selectColor = selectColor;\n\n\t/**\n\t* Create a debugger with the given `namespace`.\n\t*\n\t* @param {String} namespace\n\t* @return {Function}\n\t* @api public\n\t*/\n\tfunction createDebug(namespace) {\n\t\tlet prevTime;\n\t\tlet enableOverride = null;\n\t\tlet namespacesCache;\n\t\tlet enabledCache;\n\n\t\tfunction debug(...args) {\n\t\t\t// Disabled?\n\t\t\tif (!debug.enabled) {\n\t\t\t\treturn;\n\t\t\t}\n\n\t\t\tconst self = debug;\n\n\t\t\t// Set `diff` timestamp\n\t\t\tconst curr = Number(new Date());\n\t\t\tconst ms = curr - (prevTime || curr);\n\t\t\tself.diff = ms;\n\t\t\tself.prev = prevTime;\n\t\t\tself.curr = curr;\n\t\t\tprevTime = curr;\n\n\t\t\targs[0] = createDebug.coerce(args[0]);\n\n\t\t\tif (typeof args[0] !== 'string') {\n\t\t\t\t// Anything else let's inspect with %O\n\t\t\t\targs.unshift('%O');\n\t\t\t}\n\n\t\t\t// Apply any `formatters` transformations\n\t\t\tlet index = 0;\n\t\t\targs[0] = args[0].replace(/%([a-zA-Z%])/g, (match, format) => {\n\t\t\t\t// If we encounter an escaped % then don't increase the array index\n\t\t\t\tif (match === '%%') {\n\t\t\t\t\treturn '%';\n\t\t\t\t}\n\t\t\t\tindex++;\n\t\t\t\tconst formatter = createDebug.formatters[format];\n\t\t\t\tif (typeof formatter === 'function') {\n\t\t\t\t\tconst val = args[index];\n\t\t\t\t\tmatch = formatter.call(self, val);\n\n\t\t\t\t\t// Now we need to remove `args[index]` since it's inlined in the `format`\n\t\t\t\t\targs.splice(index, 1);\n\t\t\t\t\tindex--;\n\t\t\t\t}\n\t\t\t\treturn match;\n\t\t\t});\n\n\t\t\t// Apply env-specific formatting (colors, etc.)\n\t\t\tcreateDebug.formatArgs.call(self, args);\n\n\t\t\tconst logFn = self.log || createDebug.log;\n\t\t\tlogFn.apply(self, args);\n\t\t}\n\n\t\tdebug.namespace = namespace;\n\t\tdebug.useColors = createDebug.useColors();\n\t\tdebug.color = createDebug.selectColor(namespace);\n\t\tdebug.extend = extend;\n\t\tdebug.destroy = createDebug.destroy; // XXX Temporary. Will be removed in the next major release.\n\n\t\tObject.defineProperty(debug, 'enabled', {\n\t\t\tenumerable: true,\n\t\t\tconfigurable: false,\n\t\t\tget: () => {\n\t\t\t\tif (enableOverride !== null) {\n\t\t\t\t\treturn enableOverride;\n\t\t\t\t}\n\t\t\t\tif (namespacesCache !== createDebug.namespaces) {\n\t\t\t\t\tnamespacesCache = createDebug.namespaces;\n\t\t\t\t\tenabledCache = createDebug.enabled(namespace);\n\t\t\t\t}\n\n\t\t\t\treturn enabledCache;\n\t\t\t},\n\t\t\tset: v => {\n\t\t\t\tenableOverride = v;\n\t\t\t}\n\t\t});\n\n\t\t// Env-specific initialization logic for debug instances\n\t\tif (typeof createDebug.init === 'function') {\n\t\t\tcreateDebug.init(debug);\n\t\t}\n\n\t\treturn debug;\n\t}\n\n\tfunction extend(namespace, delimiter) {\n\t\tconst newDebug = createDebug(this.namespace + (typeof delimiter === 'undefined' ? ':' : delimiter) + namespace);\n\t\tnewDebug.log = this.log;\n\t\treturn newDebug;\n\t}\n\n\t/**\n\t* Enables a debug mode by namespaces. This can include modes\n\t* separated by a colon and wildcards.\n\t*\n\t* @param {String} namespaces\n\t* @api public\n\t*/\n\tfunction enable(namespaces) {\n\t\tcreateDebug.save(namespaces);\n\t\tcreateDebug.namespaces = namespaces;\n\n\t\tcreateDebug.names = [];\n\t\tcreateDebug.skips = [];\n\n\t\tlet i;\n\t\tconst split = (typeof namespaces === 'string' ? namespaces : '').split(/[\\s,]+/);\n\t\tconst len = split.length;\n\n\t\tfor (i = 0; i < len; i++) {\n\t\t\tif (!split[i]) {\n\t\t\t\t// ignore empty strings\n\t\t\t\tcontinue;\n\t\t\t}\n\n\t\t\tnamespaces = split[i].replace(/\\*/g, '.*?');\n\n\t\t\tif (namespaces[0] === '-') {\n\t\t\t\tcreateDebug.skips.push(new RegExp('^' + namespaces.substr(1) + '$'));\n\t\t\t} else {\n\t\t\t\tcreateDebug.names.push(new RegExp('^' + namespaces + '$'));\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t* Disable debug output.\n\t*\n\t* @return {String} namespaces\n\t* @api public\n\t*/\n\tfunction disable() {\n\t\tconst namespaces = [\n\t\t\t...createDebug.names.map(toNamespace),\n\t\t\t...createDebug.skips.map(toNamespace).map(namespace => '-' + namespace)\n\t\t].join(',');\n\t\tcreateDebug.enable('');\n\t\treturn namespaces;\n\t}\n\n\t/**\n\t* Returns true if the given mode name is enabled, false otherwise.\n\t*\n\t* @param {String} name\n\t* @return {Boolean}\n\t* @api public\n\t*/\n\tfunction enabled(name) {\n\t\tif (name[name.length - 1] === '*') {\n\t\t\treturn true;\n\t\t}\n\n\t\tlet i;\n\t\tlet len;\n\n\t\tfor (i = 0, len = createDebug.skips.length; i < len; i++) {\n\t\t\tif (createDebug.skips[i].test(name)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (i = 0, len = createDebug.names.length; i < len; i++) {\n\t\t\tif (createDebug.names[i].test(name)) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t/**\n\t* Convert regexp to namespace\n\t*\n\t* @param {RegExp} regxep\n\t* @return {String} namespace\n\t* @api private\n\t*/\n\tfunction toNamespace(regexp) {\n\t\treturn regexp.toString()\n\t\t\t.substring(2, regexp.toString().length - 2)\n\t\t\t.replace(/\\.\\*\\?$/, '*');\n\t}\n\n\t/**\n\t* Coerce `val`.\n\t*\n\t* @param {Mixed} val\n\t* @return {Mixed}\n\t* @api private\n\t*/\n\tfunction coerce(val) {\n\t\tif (val instanceof Error) {\n\t\t\treturn val.stack || val.message;\n\t\t}\n\t\treturn val;\n\t}\n\n\t/**\n\t* XXX DO NOT USE. This is a temporary stub function.\n\t* XXX It WILL be removed in the next major release.\n\t*/\n\tfunction destroy() {\n\t\tconsole.warn('Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.');\n\t}\n\n\tcreateDebug.enable(createDebug.load());\n\n\treturn createDebug;\n}\n\nmodule.exports = setup;\n","'use strict';\n\nvar keys = require('object-keys');\nvar hasSymbols = typeof Symbol === 'function' && typeof Symbol('foo') === 'symbol';\n\nvar toStr = Object.prototype.toString;\nvar concat = Array.prototype.concat;\nvar origDefineProperty = Object.defineProperty;\n\nvar isFunction = function (fn) {\n\treturn typeof fn === 'function' && toStr.call(fn) === '[object Function]';\n};\n\nvar arePropertyDescriptorsSupported = function () {\n\tvar obj = {};\n\ttry {\n\t\torigDefineProperty(obj, 'x', { enumerable: false, value: obj });\n\t\t// eslint-disable-next-line no-unused-vars, no-restricted-syntax\n\t\tfor (var _ in obj) { // jscs:ignore disallowUnusedVariables\n\t\t\treturn false;\n\t\t}\n\t\treturn obj.x === obj;\n\t} catch (e) { /* this is IE 8. */\n\t\treturn false;\n\t}\n};\nvar supportsDescriptors = origDefineProperty && arePropertyDescriptorsSupported();\n\nvar defineProperty = function (object, name, value, predicate) {\n\tif (name in object && (!isFunction(predicate) || !predicate())) {\n\t\treturn;\n\t}\n\tif (supportsDescriptors) {\n\t\torigDefineProperty(object, name, {\n\t\t\tconfigurable: true,\n\t\t\tenumerable: false,\n\t\t\tvalue: value,\n\t\t\twritable: true\n\t\t});\n\t} else {\n\t\tobject[name] = value;\n\t}\n};\n\nvar defineProperties = function (object, map) {\n\tvar predicates = arguments.length > 2 ? arguments[2] : {};\n\tvar props = keys(map);\n\tif (hasSymbols) {\n\t\tprops = concat.call(props, Object.getOwnPropertySymbols(map));\n\t}\n\tfor (var i = 0; i < props.length; i += 1) {\n\t\tdefineProperty(object, props[i], map[props[i]], predicates[props[i]]);\n\t}\n};\n\ndefineProperties.supportsDescriptors = !!supportsDescriptors;\n\nmodule.exports = defineProperties;\n","'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');\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar proto = {};\n\nfunction CBCState(iv) {\n assert.equal(iv.length, 8, 'Invalid IV length');\n\n this.iv = new Array(8);\n for (var i = 0; i < this.iv.length; i++)\n this.iv[i] = iv[i];\n}\n\nfunction instantiate(Base) {\n function CBC(options) {\n Base.call(this, options);\n this._cbcInit();\n }\n inherits(CBC, Base);\n\n var keys = Object.keys(proto);\n for (var i = 0; i < keys.length; i++) {\n var key = keys[i];\n CBC.prototype[key] = proto[key];\n }\n\n CBC.create = function create(options) {\n return new CBC(options);\n };\n\n return CBC;\n}\n\nexports.instantiate = instantiate;\n\nproto._cbcInit = function _cbcInit() {\n var state = new CBCState(this.options.iv);\n this._cbcState = state;\n};\n\nproto._update = function _update(inp, inOff, out, outOff) {\n var state = this._cbcState;\n var superProto = this.constructor.super_.prototype;\n\n var iv = state.iv;\n if (this.type === 'encrypt') {\n for (var i = 0; i < this.blockSize; i++)\n iv[i] ^= inp[inOff + i];\n\n superProto._update.call(this, iv, 0, out, outOff);\n\n for (var i = 0; i < this.blockSize; i++)\n iv[i] = out[outOff + i];\n } else {\n superProto._update.call(this, inp, inOff, out, outOff);\n\n for (var i = 0; i < this.blockSize; i++)\n out[outOff + i] ^= iv[i];\n\n for (var i = 0; i < this.blockSize; i++)\n iv[i] = inp[inOff + i];\n }\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\n\nfunction Cipher(options) {\n this.options = options;\n\n this.type = this.options.type;\n this.blockSize = 8;\n this._init();\n\n this.buffer = new Array(this.blockSize);\n this.bufferOff = 0;\n}\nmodule.exports = Cipher;\n\nCipher.prototype._init = function _init() {\n // Might be overrided\n};\n\nCipher.prototype.update = function update(data) {\n if (data.length === 0)\n return [];\n\n if (this.type === 'decrypt')\n return this._updateDecrypt(data);\n else\n return this._updateEncrypt(data);\n};\n\nCipher.prototype._buffer = function _buffer(data, off) {\n // Append data to buffer\n var min = Math.min(this.buffer.length - this.bufferOff, data.length - off);\n for (var i = 0; i < min; i++)\n this.buffer[this.bufferOff + i] = data[off + i];\n this.bufferOff += min;\n\n // Shift next\n return min;\n};\n\nCipher.prototype._flushBuffer = function _flushBuffer(out, off) {\n this._update(this.buffer, 0, out, off);\n this.bufferOff = 0;\n return this.blockSize;\n};\n\nCipher.prototype._updateEncrypt = function _updateEncrypt(data) {\n var inputOff = 0;\n var outputOff = 0;\n\n var count = ((this.bufferOff + data.length) / this.blockSize) | 0;\n var out = new Array(count * this.blockSize);\n\n if (this.bufferOff !== 0) {\n inputOff += this._buffer(data, inputOff);\n\n if (this.bufferOff === this.buffer.length)\n outputOff += this._flushBuffer(out, outputOff);\n }\n\n // Write blocks\n var max = data.length - ((data.length - inputOff) % this.blockSize);\n for (; inputOff < max; inputOff += this.blockSize) {\n this._update(data, inputOff, out, outputOff);\n outputOff += this.blockSize;\n }\n\n // Queue rest\n for (; inputOff < data.length; inputOff++, this.bufferOff++)\n this.buffer[this.bufferOff] = data[inputOff];\n\n return out;\n};\n\nCipher.prototype._updateDecrypt = function _updateDecrypt(data) {\n var inputOff = 0;\n var outputOff = 0;\n\n var count = Math.ceil((this.bufferOff + data.length) / this.blockSize) - 1;\n var out = new Array(count * this.blockSize);\n\n // TODO(indutny): optimize it, this is far from optimal\n for (; count > 0; count--) {\n inputOff += this._buffer(data, inputOff);\n outputOff += this._flushBuffer(out, outputOff);\n }\n\n // Buffer rest of the input\n inputOff += this._buffer(data, inputOff);\n\n return out;\n};\n\nCipher.prototype.final = function final(buffer) {\n var first;\n if (buffer)\n first = this.update(buffer);\n\n var last;\n if (this.type === 'encrypt')\n last = this._finalEncrypt();\n else\n last = this._finalDecrypt();\n\n if (first)\n return first.concat(last);\n else\n return last;\n};\n\nCipher.prototype._pad = function _pad(buffer, off) {\n if (off === 0)\n return false;\n\n while (off < buffer.length)\n buffer[off++] = 0;\n\n return true;\n};\n\nCipher.prototype._finalEncrypt = function _finalEncrypt() {\n if (!this._pad(this.buffer, this.bufferOff))\n return [];\n\n var out = new Array(this.blockSize);\n this._update(this.buffer, 0, out, 0);\n return out;\n};\n\nCipher.prototype._unpad = function _unpad(buffer) {\n return buffer;\n};\n\nCipher.prototype._finalDecrypt = function _finalDecrypt() {\n assert.equal(this.bufferOff, this.blockSize, 'Not enough data to decrypt');\n var out = new Array(this.blockSize);\n this._flushBuffer(out, 0);\n\n return this._unpad(out);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar utils = require('./utils');\nvar Cipher = require('./cipher');\n\nfunction DESState() {\n this.tmp = new Array(2);\n this.keys = null;\n}\n\nfunction DES(options) {\n Cipher.call(this, options);\n\n var state = new DESState();\n this._desState = state;\n\n this.deriveKeys(state, options.key);\n}\ninherits(DES, Cipher);\nmodule.exports = DES;\n\nDES.create = function create(options) {\n return new DES(options);\n};\n\nvar shiftTable = [\n 1, 1, 2, 2, 2, 2, 2, 2,\n 1, 2, 2, 2, 2, 2, 2, 1\n];\n\nDES.prototype.deriveKeys = function deriveKeys(state, key) {\n state.keys = new Array(16 * 2);\n\n assert.equal(key.length, this.blockSize, 'Invalid key length');\n\n var kL = utils.readUInt32BE(key, 0);\n var kR = utils.readUInt32BE(key, 4);\n\n utils.pc1(kL, kR, state.tmp, 0);\n kL = state.tmp[0];\n kR = state.tmp[1];\n for (var i = 0; i < state.keys.length; i += 2) {\n var shift = shiftTable[i >>> 1];\n kL = utils.r28shl(kL, shift);\n kR = utils.r28shl(kR, shift);\n utils.pc2(kL, kR, state.keys, i);\n }\n};\n\nDES.prototype._update = function _update(inp, inOff, out, outOff) {\n var state = this._desState;\n\n var l = utils.readUInt32BE(inp, inOff);\n var r = utils.readUInt32BE(inp, inOff + 4);\n\n // Initial Permutation\n utils.ip(l, r, state.tmp, 0);\n l = state.tmp[0];\n r = state.tmp[1];\n\n if (this.type === 'encrypt')\n this._encrypt(state, l, r, state.tmp, 0);\n else\n this._decrypt(state, l, r, state.tmp, 0);\n\n l = state.tmp[0];\n r = state.tmp[1];\n\n utils.writeUInt32BE(out, l, outOff);\n utils.writeUInt32BE(out, r, outOff + 4);\n};\n\nDES.prototype._pad = function _pad(buffer, off) {\n var value = buffer.length - off;\n for (var i = off; i < buffer.length; i++)\n buffer[i] = value;\n\n return true;\n};\n\nDES.prototype._unpad = function _unpad(buffer) {\n var pad = buffer[buffer.length - 1];\n for (var i = buffer.length - pad; i < buffer.length; i++)\n assert.equal(buffer[i], pad);\n\n return buffer.slice(0, buffer.length - pad);\n};\n\nDES.prototype._encrypt = function _encrypt(state, lStart, rStart, out, off) {\n var l = lStart;\n var r = rStart;\n\n // Apply f() x16 times\n for (var i = 0; i < state.keys.length; i += 2) {\n var keyL = state.keys[i];\n var keyR = state.keys[i + 1];\n\n // f(r, k)\n utils.expand(r, state.tmp, 0);\n\n keyL ^= state.tmp[0];\n keyR ^= state.tmp[1];\n var s = utils.substitute(keyL, keyR);\n var f = utils.permute(s);\n\n var t = r;\n r = (l ^ f) >>> 0;\n l = t;\n }\n\n // Reverse Initial Permutation\n utils.rip(r, l, out, off);\n};\n\nDES.prototype._decrypt = function _decrypt(state, lStart, rStart, out, off) {\n var l = rStart;\n var r = lStart;\n\n // Apply f() x16 times\n for (var i = state.keys.length - 2; i >= 0; i -= 2) {\n var keyL = state.keys[i];\n var keyR = state.keys[i + 1];\n\n // f(r, k)\n utils.expand(l, state.tmp, 0);\n\n keyL ^= state.tmp[0];\n keyR ^= state.tmp[1];\n var s = utils.substitute(keyL, keyR);\n var f = utils.permute(s);\n\n var t = l;\n l = (r ^ f) >>> 0;\n r = t;\n }\n\n // Reverse Initial Permutation\n utils.rip(l, r, out, off);\n};\n","'use strict';\n\nvar assert = require('minimalistic-assert');\nvar inherits = require('inherits');\n\nvar Cipher = require('./cipher');\nvar DES = require('./des');\n\nfunction EDEState(type, key) {\n assert.equal(key.length, 24, 'Invalid key length');\n\n var k1 = key.slice(0, 8);\n var k2 = key.slice(8, 16);\n var k3 = key.slice(16, 24);\n\n if (type === 'encrypt') {\n this.ciphers = [\n DES.create({ type: 'encrypt', key: k1 }),\n DES.create({ type: 'decrypt', key: k2 }),\n DES.create({ type: 'encrypt', key: k3 })\n ];\n } else {\n this.ciphers = [\n DES.create({ type: 'decrypt', key: k3 }),\n DES.create({ type: 'encrypt', key: k2 }),\n DES.create({ type: 'decrypt', key: k1 })\n ];\n }\n}\n\nfunction EDE(options) {\n Cipher.call(this, options);\n\n var state = new EDEState(this.type, this.options.key);\n this._edeState = state;\n}\ninherits(EDE, Cipher);\n\nmodule.exports = EDE;\n\nEDE.create = function create(options) {\n return new EDE(options);\n};\n\nEDE.prototype._update = function _update(inp, inOff, out, outOff) {\n var state = this._edeState;\n\n state.ciphers[0]._update(inp, inOff, out, outOff);\n state.ciphers[1]._update(out, outOff, out, outOff);\n state.ciphers[2]._update(out, outOff, out, outOff);\n};\n\nEDE.prototype._pad = DES.prototype._pad;\nEDE.prototype._unpad = DES.prototype._unpad;\n","'use strict';\n\nexports.readUInt32BE = function readUInt32BE(bytes, off) {\n var res = (bytes[0 + off] << 24) |\n (bytes[1 + off] << 16) |\n (bytes[2 + off] << 8) |\n bytes[3 + off];\n return res >>> 0;\n};\n\nexports.writeUInt32BE = function writeUInt32BE(bytes, value, off) {\n bytes[0 + off] = value >>> 24;\n bytes[1 + off] = (value >>> 16) & 0xff;\n bytes[2 + off] = (value >>> 8) & 0xff;\n bytes[3 + off] = value & 0xff;\n};\n\nexports.ip = function ip(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >>> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inL >>> (j + i)) & 1;\n }\n }\n\n for (var i = 6; i >= 0; i -= 2) {\n for (var j = 1; j <= 25; j += 8) {\n outR <<= 1;\n outR |= (inR >>> (j + i)) & 1;\n }\n for (var j = 1; j <= 25; j += 8) {\n outR <<= 1;\n outR |= (inL >>> (j + i)) & 1;\n }\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.rip = function rip(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n for (var i = 0; i < 4; i++) {\n for (var j = 24; j >= 0; j -= 8) {\n outL <<= 1;\n outL |= (inR >>> (j + i)) & 1;\n outL <<= 1;\n outL |= (inL >>> (j + i)) & 1;\n }\n }\n for (var i = 4; i < 8; i++) {\n for (var j = 24; j >= 0; j -= 8) {\n outR <<= 1;\n outR |= (inR >>> (j + i)) & 1;\n outR <<= 1;\n outR |= (inL >>> (j + i)) & 1;\n }\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.pc1 = function pc1(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n // 7, 15, 23, 31, 39, 47, 55, 63\n // 6, 14, 22, 30, 39, 47, 55, 63\n // 5, 13, 21, 29, 39, 47, 55, 63\n // 4, 12, 20, 28\n for (var i = 7; i >= 5; i--) {\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inL >> (j + i)) & 1;\n }\n }\n for (var j = 0; j <= 24; j += 8) {\n outL <<= 1;\n outL |= (inR >> (j + i)) & 1;\n }\n\n // 1, 9, 17, 25, 33, 41, 49, 57\n // 2, 10, 18, 26, 34, 42, 50, 58\n // 3, 11, 19, 27, 35, 43, 51, 59\n // 36, 44, 52, 60\n for (var i = 1; i <= 3; i++) {\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inR >> (j + i)) & 1;\n }\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inL >> (j + i)) & 1;\n }\n }\n for (var j = 0; j <= 24; j += 8) {\n outR <<= 1;\n outR |= (inL >> (j + i)) & 1;\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.r28shl = function r28shl(num, shift) {\n return ((num << shift) & 0xfffffff) | (num >>> (28 - shift));\n};\n\nvar pc2table = [\n // inL => outL\n 14, 11, 17, 4, 27, 23, 25, 0,\n 13, 22, 7, 18, 5, 9, 16, 24,\n 2, 20, 12, 21, 1, 8, 15, 26,\n\n // inR => outR\n 15, 4, 25, 19, 9, 1, 26, 16,\n 5, 11, 23, 8, 12, 7, 17, 0,\n 22, 3, 10, 14, 6, 20, 27, 24\n];\n\nexports.pc2 = function pc2(inL, inR, out, off) {\n var outL = 0;\n var outR = 0;\n\n var len = pc2table.length >>> 1;\n for (var i = 0; i < len; i++) {\n outL <<= 1;\n outL |= (inL >>> pc2table[i]) & 0x1;\n }\n for (var i = len; i < pc2table.length; i++) {\n outR <<= 1;\n outR |= (inR >>> pc2table[i]) & 0x1;\n }\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nexports.expand = function expand(r, out, off) {\n var outL = 0;\n var outR = 0;\n\n outL = ((r & 1) << 5) | (r >>> 27);\n for (var i = 23; i >= 15; i -= 4) {\n outL <<= 6;\n outL |= (r >>> i) & 0x3f;\n }\n for (var i = 11; i >= 3; i -= 4) {\n outR |= (r >>> i) & 0x3f;\n outR <<= 6;\n }\n outR |= ((r & 0x1f) << 1) | (r >>> 31);\n\n out[off + 0] = outL >>> 0;\n out[off + 1] = outR >>> 0;\n};\n\nvar sTable = [\n 14, 0, 4, 15, 13, 7, 1, 4, 2, 14, 15, 2, 11, 13, 8, 1,\n 3, 10, 10, 6, 6, 12, 12, 11, 5, 9, 9, 5, 0, 3, 7, 8,\n 4, 15, 1, 12, 14, 8, 8, 2, 13, 4, 6, 9, 2, 1, 11, 7,\n 15, 5, 12, 11, 9, 3, 7, 14, 3, 10, 10, 0, 5, 6, 0, 13,\n\n 15, 3, 1, 13, 8, 4, 14, 7, 6, 15, 11, 2, 3, 8, 4, 14,\n 9, 12, 7, 0, 2, 1, 13, 10, 12, 6, 0, 9, 5, 11, 10, 5,\n 0, 13, 14, 8, 7, 10, 11, 1, 10, 3, 4, 15, 13, 4, 1, 2,\n 5, 11, 8, 6, 12, 7, 6, 12, 9, 0, 3, 5, 2, 14, 15, 9,\n\n 10, 13, 0, 7, 9, 0, 14, 9, 6, 3, 3, 4, 15, 6, 5, 10,\n 1, 2, 13, 8, 12, 5, 7, 14, 11, 12, 4, 11, 2, 15, 8, 1,\n 13, 1, 6, 10, 4, 13, 9, 0, 8, 6, 15, 9, 3, 8, 0, 7,\n 11, 4, 1, 15, 2, 14, 12, 3, 5, 11, 10, 5, 14, 2, 7, 12,\n\n 7, 13, 13, 8, 14, 11, 3, 5, 0, 6, 6, 15, 9, 0, 10, 3,\n 1, 4, 2, 7, 8, 2, 5, 12, 11, 1, 12, 10, 4, 14, 15, 9,\n 10, 3, 6, 15, 9, 0, 0, 6, 12, 10, 11, 1, 7, 13, 13, 8,\n 15, 9, 1, 4, 3, 5, 14, 11, 5, 12, 2, 7, 8, 2, 4, 14,\n\n 2, 14, 12, 11, 4, 2, 1, 12, 7, 4, 10, 7, 11, 13, 6, 1,\n 8, 5, 5, 0, 3, 15, 15, 10, 13, 3, 0, 9, 14, 8, 9, 6,\n 4, 11, 2, 8, 1, 12, 11, 7, 10, 1, 13, 14, 7, 2, 8, 13,\n 15, 6, 9, 15, 12, 0, 5, 9, 6, 10, 3, 4, 0, 5, 14, 3,\n\n 12, 10, 1, 15, 10, 4, 15, 2, 9, 7, 2, 12, 6, 9, 8, 5,\n 0, 6, 13, 1, 3, 13, 4, 14, 14, 0, 7, 11, 5, 3, 11, 8,\n 9, 4, 14, 3, 15, 2, 5, 12, 2, 9, 8, 5, 12, 15, 3, 10,\n 7, 11, 0, 14, 4, 1, 10, 7, 1, 6, 13, 0, 11, 8, 6, 13,\n\n 4, 13, 11, 0, 2, 11, 14, 7, 15, 4, 0, 9, 8, 1, 13, 10,\n 3, 14, 12, 3, 9, 5, 7, 12, 5, 2, 10, 15, 6, 8, 1, 6,\n 1, 6, 4, 11, 11, 13, 13, 8, 12, 1, 3, 4, 7, 10, 14, 7,\n 10, 9, 15, 5, 6, 0, 8, 15, 0, 14, 5, 2, 9, 3, 2, 12,\n\n 13, 1, 2, 15, 8, 13, 4, 8, 6, 10, 15, 3, 11, 7, 1, 4,\n 10, 12, 9, 5, 3, 6, 14, 11, 5, 0, 0, 14, 12, 9, 7, 2,\n 7, 2, 11, 1, 4, 14, 1, 7, 9, 4, 12, 10, 14, 8, 2, 13,\n 0, 15, 6, 12, 10, 9, 13, 0, 15, 3, 3, 5, 5, 6, 8, 11\n];\n\nexports.substitute = function substitute(inL, inR) {\n var out = 0;\n for (var i = 0; i < 4; i++) {\n var b = (inL >>> (18 - i * 6)) & 0x3f;\n var sb = sTable[i * 0x40 + b];\n\n out <<= 4;\n out |= sb;\n }\n for (var i = 0; i < 4; i++) {\n var b = (inR >>> (18 - i * 6)) & 0x3f;\n var sb = sTable[4 * 0x40 + i * 0x40 + b];\n\n out <<= 4;\n out |= sb;\n }\n return out >>> 0;\n};\n\nvar permuteTable = [\n 16, 25, 12, 11, 3, 20, 4, 15, 31, 17, 9, 6, 27, 14, 1, 22,\n 30, 24, 8, 18, 0, 5, 29, 23, 13, 19, 2, 26, 10, 21, 28, 7\n];\n\nexports.permute = function permute(num) {\n var out = 0;\n for (var i = 0; i < permuteTable.length; i++) {\n out <<= 1;\n out |= (num >>> permuteTable[i]) & 0x1;\n }\n return out >>> 0;\n};\n\nexports.padSplit = function padSplit(num, size, group) {\n var str = num.toString(2);\n while (str.length < size)\n str = '0' + str;\n\n var out = [];\n for (var i = 0; i < size; i += group)\n out.push(str.slice(i, i + group));\n return out.join(' ');\n};\n","var generatePrime = require('./lib/generatePrime')\nvar primes = require('./lib/primes.json')\n\nvar DH = require('./lib/dh')\n\nfunction getDiffieHellman (mod) {\n var prime = new Buffer(primes[mod].prime, 'hex')\n var gen = new Buffer(primes[mod].gen, 'hex')\n\n return new DH(prime, gen)\n}\n\nvar ENCODINGS = {\n 'binary': true, 'hex': true, 'base64': true\n}\n\nfunction createDiffieHellman (prime, enc, generator, genc) {\n if (Buffer.isBuffer(enc) || ENCODINGS[enc] === undefined) {\n return createDiffieHellman(prime, 'binary', enc, generator)\n }\n\n enc = enc || 'binary'\n genc = genc || 'binary'\n generator = generator || new Buffer([2])\n\n if (!Buffer.isBuffer(generator)) {\n generator = new Buffer(generator, genc)\n }\n\n if (typeof prime === 'number') {\n return new DH(generatePrime(prime, generator), generator, true)\n }\n\n if (!Buffer.isBuffer(prime)) {\n prime = new Buffer(prime, enc)\n }\n\n return new DH(prime, generator, true)\n}\n\nexports.DiffieHellmanGroup = exports.createDiffieHellmanGroup = exports.getDiffieHellman = getDiffieHellman\nexports.createDiffieHellman = exports.DiffieHellman = createDiffieHellman\n","var BN = require('bn.js');\nvar MillerRabin = require('miller-rabin');\nvar millerRabin = new MillerRabin();\nvar TWENTYFOUR = new BN(24);\nvar ELEVEN = new BN(11);\nvar TEN = new BN(10);\nvar THREE = new BN(3);\nvar SEVEN = new BN(7);\nvar primes = require('./generatePrime');\nvar randomBytes = require('randombytes');\nmodule.exports = DH;\n\nfunction setPublicKey(pub, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(pub)) {\n pub = new Buffer(pub, enc);\n }\n this._pub = new BN(pub);\n return this;\n}\n\nfunction setPrivateKey(priv, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(priv)) {\n priv = new Buffer(priv, enc);\n }\n this._priv = new BN(priv);\n return this;\n}\n\nvar primeCache = {};\nfunction checkPrime(prime, generator) {\n var gen = generator.toString('hex');\n var hex = [gen, prime.toString(16)].join('_');\n if (hex in primeCache) {\n return primeCache[hex];\n }\n var error = 0;\n\n if (prime.isEven() ||\n !primes.simpleSieve ||\n !primes.fermatTest(prime) ||\n !millerRabin.test(prime)) {\n //not a prime so +1\n error += 1;\n\n if (gen === '02' || gen === '05') {\n // we'd be able to check the generator\n // it would fail so +8\n error += 8;\n } else {\n //we wouldn't be able to test the generator\n // so +4\n error += 4;\n }\n primeCache[hex] = error;\n return error;\n }\n if (!millerRabin.test(prime.shrn(1))) {\n //not a safe prime\n error += 2;\n }\n var rem;\n switch (gen) {\n case '02':\n if (prime.mod(TWENTYFOUR).cmp(ELEVEN)) {\n // unsuidable generator\n error += 8;\n }\n break;\n case '05':\n rem = prime.mod(TEN);\n if (rem.cmp(THREE) && rem.cmp(SEVEN)) {\n // prime mod 10 needs to equal 3 or 7\n error += 8;\n }\n break;\n default:\n error += 4;\n }\n primeCache[hex] = error;\n return error;\n}\n\nfunction DH(prime, generator, malleable) {\n this.setGenerator(generator);\n this.__prime = new BN(prime);\n this._prime = BN.mont(this.__prime);\n this._primeLen = prime.length;\n this._pub = undefined;\n this._priv = undefined;\n this._primeCode = undefined;\n if (malleable) {\n this.setPublicKey = setPublicKey;\n this.setPrivateKey = setPrivateKey;\n } else {\n this._primeCode = 8;\n }\n}\nObject.defineProperty(DH.prototype, 'verifyError', {\n enumerable: true,\n get: function () {\n if (typeof this._primeCode !== 'number') {\n this._primeCode = checkPrime(this.__prime, this.__gen);\n }\n return this._primeCode;\n }\n});\nDH.prototype.generateKeys = function () {\n if (!this._priv) {\n this._priv = new BN(randomBytes(this._primeLen));\n }\n this._pub = this._gen.toRed(this._prime).redPow(this._priv).fromRed();\n return this.getPublicKey();\n};\n\nDH.prototype.computeSecret = function (other) {\n other = new BN(other);\n other = other.toRed(this._prime);\n var secret = other.redPow(this._priv).fromRed();\n var out = new Buffer(secret.toArray());\n var prime = this.getPrime();\n if (out.length < prime.length) {\n var front = new Buffer(prime.length - out.length);\n front.fill(0);\n out = Buffer.concat([front, out]);\n }\n return out;\n};\n\nDH.prototype.getPublicKey = function getPublicKey(enc) {\n return formatReturnValue(this._pub, enc);\n};\n\nDH.prototype.getPrivateKey = function getPrivateKey(enc) {\n return formatReturnValue(this._priv, enc);\n};\n\nDH.prototype.getPrime = function (enc) {\n return formatReturnValue(this.__prime, enc);\n};\n\nDH.prototype.getGenerator = function (enc) {\n return formatReturnValue(this._gen, enc);\n};\n\nDH.prototype.setGenerator = function (gen, enc) {\n enc = enc || 'utf8';\n if (!Buffer.isBuffer(gen)) {\n gen = new Buffer(gen, enc);\n }\n this.__gen = gen;\n this._gen = new BN(gen);\n return this;\n};\n\nfunction formatReturnValue(bn, enc) {\n var buf = new Buffer(bn.toArray());\n if (!enc) {\n return buf;\n } else {\n return buf.toString(enc);\n }\n}\n","var randomBytes = require('randombytes');\nmodule.exports = findPrime;\nfindPrime.simpleSieve = simpleSieve;\nfindPrime.fermatTest = fermatTest;\nvar BN = require('bn.js');\nvar TWENTYFOUR = new BN(24);\nvar MillerRabin = require('miller-rabin');\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)\n return primes;\n\n var limit = 0x100000;\n var res = [];\n res[0] = 2;\n for (var i = 1, k = 3; k < limit; k += 2) {\n var sqrt = Math.ceil(Math.sqrt(k));\n for (var j = 0; j < i && res[j] <= sqrt; j++)\n if (k % res[j] === 0)\n break;\n\n if (i !== j && res[j] <= sqrt)\n continue;\n\n res[i++] = k;\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 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 gen = new BN(gen);\n\n var num, n2;\n\n while (true) {\n num = new BN(randomBytes(Math.ceil(bits / 8)));\n while (num.bitLength() > bits) {\n num.ishrn(1);\n }\n if (num.isEven()) {\n num.iadd(ONE);\n }\n if (!num.testn(1)) {\n num.iadd(TWO);\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 n2 = num.shrn(1);\n if (simpleSieve(n2) && simpleSieve(num) &&\n fermatTest(n2) && fermatTest(num) &&\n millerRabin.test(n2) && millerRabin.test(num)) {\n return num;\n }\n }\n\n}\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst stream_1 = require(\"stream\");\nconst tools_1 = require(\"./tools\");\nconst EbmlElementType_1 = require(\"./models/enums/EbmlElementType\");\nconst EbmlTagPosition_1 = require(\"./models/enums/EbmlTagPosition\");\nconst EbmlTagFactory_1 = require(\"./models/EbmlTagFactory\");\nclass EbmlStreamDecoderOptions {\n constructor() {\n this.bufferTagIds = [];\n }\n}\nexports.EbmlStreamDecoderOptions = EbmlStreamDecoderOptions;\nclass EbmlStreamDecoder extends stream_1.Transform {\n constructor(options = {}) {\n super(Object.assign({}, options, { readableObjectMode: true }));\n this._currentBufferOffset = 0;\n this._tagStack = [];\n this._buffer = Buffer.alloc(0);\n this._bufferTagIds = [];\n this._bufferTagIds = options.bufferTagIds || [];\n }\n get buffer() {\n return this._buffer;\n }\n _transform(chunk, enc, done) {\n this._buffer = Buffer.concat([this._buffer, Buffer.from(chunk)]);\n while (this.parseTags())\n ;\n done();\n }\n parseTags() {\n const currentTag = this.readTagHeader(this._buffer);\n if (!currentTag) {\n return false;\n }\n if (currentTag.type === EbmlElementType_1.EbmlElementType.Master && !this._bufferTagIds.some(i => i === currentTag.id)) {\n this._tagStack.push(currentTag);\n this.emitTag(currentTag, EbmlTagPosition_1.EbmlTagPosition.Start);\n this.advanceBuffer(currentTag.tagHeaderLength);\n return true;\n }\n else {\n if (this._buffer.length < currentTag.tagHeaderLength + currentTag.size) {\n return false;\n }\n const data = this._buffer.slice(currentTag.tagHeaderLength, currentTag.tagHeaderLength + currentTag.size);\n this.emitTag(currentTag, EbmlTagPosition_1.EbmlTagPosition.Content, data);\n this.advanceBuffer(currentTag.tagHeaderLength + currentTag.size);\n while (this._tagStack.length > 0) {\n const nextTag = this._tagStack[this._tagStack.length - 1];\n if (this._currentBufferOffset < (nextTag.absoluteStart + nextTag.tagHeaderLength + nextTag.size)) {\n break;\n }\n this.emitTag(nextTag, EbmlTagPosition_1.EbmlTagPosition.End);\n this._tagStack.pop();\n }\n }\n return true;\n }\n advanceBuffer(length) {\n this._currentBufferOffset += length;\n this._buffer = this._buffer.slice(length);\n }\n readTagHeader(buffer, offset = 0) {\n if (buffer.length == 0) {\n return null;\n }\n const tag = tools_1.Tools.readVint(buffer, offset);\n if (tag == null) {\n return null;\n }\n const size = tools_1.Tools.readVint(buffer, offset + tag.length);\n if (size == null) {\n return null;\n }\n const tagIdHex = tools_1.Tools.readHexString(buffer, offset, offset + tag.length);\n const tagId = Number.parseInt(tagIdHex, 16);\n let tagObject = EbmlTagFactory_1.EbmlTagFactory.create(tagId);\n tagObject.size = size.value;\n return Object.assign(tagObject, {\n absoluteStart: this._currentBufferOffset + offset,\n tagHeaderLength: tag.length + size.length\n });\n }\n emitTag(tag, position, data) {\n let emittedTag = EbmlTagFactory_1.EbmlTagFactory.create(tag.id);\n emittedTag.size = tag.size;\n emittedTag.position = position;\n if (position === EbmlTagPosition_1.EbmlTagPosition.Content) {\n emittedTag.parseContent(data);\n }\n this.push(emittedTag);\n }\n}\nexports.EbmlStreamDecoder = EbmlStreamDecoder;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst stream_1 = require(\"stream\");\nconst EbmlTagPosition_1 = require(\"./models/enums/EbmlTagPosition\");\nconst EbmlTagId_1 = require(\"./models/enums/EbmlTagId\");\nclass EbmlStreamEncoder extends stream_1.Transform {\n constructor(options = {}) {\n super(Object.assign({}, options, { writableObjectMode: true }));\n this.dataBuffer = Buffer.alloc(0);\n this.mCorked = false;\n this.openTags = [];\n }\n _transform(chunk, enc, done) {\n if (chunk) {\n if (!chunk.id) {\n throw new Error(`No id found for ${JSON.stringify(chunk)}`);\n }\n switch (chunk.position) {\n case EbmlTagPosition_1.EbmlTagPosition.Start:\n this.startTag(chunk);\n break;\n case EbmlTagPosition_1.EbmlTagPosition.Content:\n this.writeTag(chunk);\n break;\n case EbmlTagPosition_1.EbmlTagPosition.End:\n this.endTag(chunk);\n break;\n default:\n break;\n }\n }\n done();\n }\n bufferAndFlush(buffer) {\n this.dataBuffer = Buffer.concat([this.dataBuffer, buffer]);\n this._flush(() => { });\n }\n _flush(callback) {\n let chunk = null;\n if (this.dataBuffer.length > 0 && !this.mCorked) {\n chunk = Buffer.from(this.dataBuffer);\n this.dataBuffer = Buffer.alloc(0);\n this.push(chunk);\n }\n callback();\n }\n _bufferAndFlush(buffer) {\n this.bufferAndFlush(buffer);\n }\n flush() {\n this._flush(() => { });\n }\n get buffer() {\n return this.dataBuffer;\n }\n set buffer(val) {\n this.dataBuffer = val;\n }\n get stack() {\n return this.openTags;\n }\n cork() {\n this.mCorked = true;\n }\n uncork() {\n this.mCorked = false;\n this._flush(() => { });\n }\n writeTag(tag) {\n if (this.openTags.length > 0) {\n this.openTags[this.openTags.length - 1].Children.push(tag);\n }\n else {\n this.bufferAndFlush(tag.encode());\n }\n }\n startTag(tag) {\n if (this.openTags.length > 0) {\n this.openTags[this.openTags.length - 1].Children.push(tag);\n }\n this.openTags.push(tag);\n }\n endTag(tag) {\n const inMemoryTag = this.openTags.pop();\n if (tag.id !== inMemoryTag.id) {\n throw `Logic error - closing tag \"${EbmlTagId_1.EbmlTagId[tag.id]}\" is not expected tag \"${EbmlTagId_1.EbmlTagId[inMemoryTag.id]}\"`;\n }\n if (this.openTags.length < 1) {\n this.bufferAndFlush(inMemoryTag.encode());\n }\n }\n}\nexports.EbmlStreamEncoder = EbmlStreamEncoder;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar tools_1 = require(\"./tools\");\nexports.Tools = tools_1.Tools;\nvar EbmlStreamDecoder_1 = require(\"./EbmlStreamDecoder\");\nexports.EbmlStreamDecoder = EbmlStreamDecoder_1.EbmlStreamDecoder;\nvar EbmlStreamEncoder_1 = require(\"./EbmlStreamEncoder\");\nexports.EbmlStreamEncoder = EbmlStreamEncoder_1.EbmlStreamEncoder;\nvar Block_1 = require(\"./models/tags/Block\");\nexports.Block = Block_1.Block;\nvar BlockLacing_1 = require(\"./models/enums/BlockLacing\");\nexports.BlockLacing = BlockLacing_1.BlockLacing;\nvar EbmlDataTag_1 = require(\"./models/tags/EbmlDataTag\");\nexports.EbmlDataTag = EbmlDataTag_1.EbmlDataTag;\nvar EbmlElementType_1 = require(\"./models/enums/EbmlElementType\");\nexports.EbmlElementType = EbmlElementType_1.EbmlElementType;\nvar EbmlMasterTag_1 = require(\"./models/tags/EbmlMasterTag\");\nexports.EbmlMasterTag = EbmlMasterTag_1.EbmlMasterTag;\nvar EbmlTag_1 = require(\"./models/EbmlTag\");\nexports.EbmlTag = EbmlTag_1.EbmlTag;\nvar EbmlTagFactory_1 = require(\"./models/EbmlTagFactory\");\nexports.EbmlTagFactory = EbmlTagFactory_1.EbmlTagFactory;\nvar EbmlTagId_1 = require(\"./models/enums/EbmlTagId\");\nexports.EbmlTagId = EbmlTagId_1.EbmlTagId;\nvar EbmlTagPosition_1 = require(\"./models/enums/EbmlTagPosition\");\nexports.EbmlTagPosition = EbmlTagPosition_1.EbmlTagPosition;\nvar SimpleBlock_1 = require(\"./models/tags/SimpleBlock\");\nexports.SimpleBlock = SimpleBlock_1.SimpleBlock;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlTagId_1 = require(\"./enums/EbmlTagId\");\nconst tools_1 = require(\"../tools\");\nclass EbmlTag {\n constructor(id, type, position) {\n this.id = id;\n this.type = type;\n this.position = position;\n }\n getTagDeclaration() {\n let tagHex = this.id.toString(16);\n if (tagHex.length % 2 !== 0) {\n tagHex = `0${tagHex}`;\n }\n return Buffer.from(tagHex, 'hex');\n }\n encode() {\n let vintSize = null;\n let content = this.encodeContent();\n if (this.size === -1) {\n vintSize = Buffer.from('01ffffffffffffff', 'hex');\n }\n else {\n let specialLength = undefined;\n if ([\n EbmlTagId_1.EbmlTagId.Segment,\n EbmlTagId_1.EbmlTagId.Cluster\n ].some(i => i === this.id)) {\n specialLength = 8;\n }\n vintSize = tools_1.Tools.writeVint(content.length, specialLength);\n }\n return Buffer.concat([\n this.getTagDeclaration(),\n vintSize,\n content\n ]);\n }\n}\nexports.EbmlTag = EbmlTag;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlTagId_1 = require(\"./enums/EbmlTagId\");\nconst EbmlMasterTag_1 = require(\"./tags/EbmlMasterTag\");\nconst EbmlDataTag_1 = require(\"./tags/EbmlDataTag\");\nconst Block_1 = require(\"./tags/Block\");\nconst SimpleBlock_1 = require(\"./tags/SimpleBlock\");\nconst EbmlElementType_1 = require(\"./enums/EbmlElementType\");\nclass EbmlTagFactory {\n static create(id, type) {\n if (EbmlTagId_1.EbmlTagId[id] !== undefined) {\n let foundType;\n switch (id) {\n case EbmlTagId_1.EbmlTagId.Block:\n return new Block_1.Block();\n case EbmlTagId_1.EbmlTagId.SimpleBlock:\n return new SimpleBlock_1.SimpleBlock();\n case EbmlTagId_1.EbmlTagId.ChapterDisplay:\n case EbmlTagId_1.EbmlTagId.ContentCompression:\n case EbmlTagId_1.EbmlTagId.ContentEncryption:\n case EbmlTagId_1.EbmlTagId.SilentTracks:\n case EbmlTagId_1.EbmlTagId.ContentEncoding:\n case EbmlTagId_1.EbmlTagId.TrackTranslate:\n case EbmlTagId_1.EbmlTagId.ChapProcessCommand:\n case EbmlTagId_1.EbmlTagId.ChapterTranslate:\n case EbmlTagId_1.EbmlTagId.ChapProcess:\n case EbmlTagId_1.EbmlTagId.Tag:\n case EbmlTagId_1.EbmlTagId.Segment:\n case EbmlTagId_1.EbmlTagId.SimpleTag:\n case EbmlTagId_1.EbmlTagId.Targets:\n case EbmlTagId_1.EbmlTagId.Tags:\n case EbmlTagId_1.EbmlTagId.ChapterTrack:\n case EbmlTagId_1.EbmlTagId.ChapterAtom:\n case EbmlTagId_1.EbmlTagId.EditionEntry:\n case EbmlTagId_1.EbmlTagId.Chapters:\n case EbmlTagId_1.EbmlTagId.AttachedFile:\n case EbmlTagId_1.EbmlTagId.Attachments:\n case EbmlTagId_1.EbmlTagId.CueReference:\n case EbmlTagId_1.EbmlTagId.CueTrackPositions:\n case EbmlTagId_1.EbmlTagId.CuePoint:\n case EbmlTagId_1.EbmlTagId.Cues:\n case EbmlTagId_1.EbmlTagId.ContentEncAESSettings:\n case EbmlTagId_1.EbmlTagId.ContentEncodings:\n case EbmlTagId_1.EbmlTagId.TrackJoinBlocks:\n case EbmlTagId_1.EbmlTagId.TrackPlane:\n case EbmlTagId_1.EbmlTagId.TrackCombinePlanes:\n case EbmlTagId_1.EbmlTagId.TrackOperation:\n case EbmlTagId_1.EbmlTagId.Audio:\n case EbmlTagId_1.EbmlTagId.Video:\n case EbmlTagId_1.EbmlTagId.TrackEntry:\n case EbmlTagId_1.EbmlTagId.Tracks:\n case EbmlTagId_1.EbmlTagId.ReferenceFrame:\n case EbmlTagId_1.EbmlTagId.TimeSlice:\n case EbmlTagId_1.EbmlTagId.Slices:\n case EbmlTagId_1.EbmlTagId.BlockMore:\n case EbmlTagId_1.EbmlTagId.BlockAdditions:\n case EbmlTagId_1.EbmlTagId.BlockGroup:\n case EbmlTagId_1.EbmlTagId.Cluster:\n case EbmlTagId_1.EbmlTagId.Info:\n case EbmlTagId_1.EbmlTagId.Seek:\n case EbmlTagId_1.EbmlTagId.SeekHead:\n case EbmlTagId_1.EbmlTagId.SignatureElementList:\n case EbmlTagId_1.EbmlTagId.SignatureElements:\n case EbmlTagId_1.EbmlTagId.SignatureSlot:\n case EbmlTagId_1.EbmlTagId.EBML:\n foundType = EbmlElementType_1.EbmlElementType.Master;\n break;\n case EbmlTagId_1.EbmlTagId.TrackType:\n case EbmlTagId_1.EbmlTagId.FlagDefault:\n case EbmlTagId_1.EbmlTagId.ChapterTrackNumber:\n case EbmlTagId_1.EbmlTagId.ChapterTimeStart:\n case EbmlTagId_1.EbmlTagId.ChapterTimeEnd:\n case EbmlTagId_1.EbmlTagId.CueRefTime:\n case EbmlTagId_1.EbmlTagId.CueRefCluster:\n case EbmlTagId_1.EbmlTagId.ChapterFlagHidden:\n case EbmlTagId_1.EbmlTagId.ContentCompAlgo:\n case EbmlTagId_1.EbmlTagId.DocTypeReadVersion:\n case EbmlTagId_1.EbmlTagId.EBMLVersion:\n case EbmlTagId_1.EbmlTagId.DocTypeVersion:\n case EbmlTagId_1.EbmlTagId.TagDefault:\n case EbmlTagId_1.EbmlTagId.ChapterFlagEnabled:\n case EbmlTagId_1.EbmlTagId.FileUsedStartTime:\n case EbmlTagId_1.EbmlTagId.FileUsedEndTime:\n case EbmlTagId_1.EbmlTagId.ContentEncodingOrder:\n case EbmlTagId_1.EbmlTagId.ContentEncodingScope:\n case EbmlTagId_1.EbmlTagId.ContentEncodingType:\n case EbmlTagId_1.EbmlTagId.CueBlockNumber:\n case EbmlTagId_1.EbmlTagId.BitDepth:\n case EbmlTagId_1.EbmlTagId.ChapProcessTime:\n case EbmlTagId_1.EbmlTagId.ChapProcessCodecID:\n case EbmlTagId_1.EbmlTagId.AttachmentLink:\n case EbmlTagId_1.EbmlTagId.TagAttachmentUID:\n case EbmlTagId_1.EbmlTagId.TagChapterUID:\n case EbmlTagId_1.EbmlTagId.TagEditionUID:\n case EbmlTagId_1.EbmlTagId.TagTrackUID:\n case EbmlTagId_1.EbmlTagId.TargetTypeValue:\n case EbmlTagId_1.EbmlTagId.ChapterPhysicalEquiv:\n case EbmlTagId_1.EbmlTagId.ChapterSegmentEditionUID:\n case EbmlTagId_1.EbmlTagId.ChapterUID:\n case EbmlTagId_1.EbmlTagId.EditionFlagOrdered:\n case EbmlTagId_1.EbmlTagId.EditionFlagDefault:\n case EbmlTagId_1.EbmlTagId.EditionFlagHidden:\n case EbmlTagId_1.EbmlTagId.EditionUID:\n case EbmlTagId_1.EbmlTagId.FileUID:\n case EbmlTagId_1.EbmlTagId.CueRefCodecState:\n case EbmlTagId_1.EbmlTagId.CueRefNumber:\n case EbmlTagId_1.EbmlTagId.CueCodecState:\n case EbmlTagId_1.EbmlTagId.CueDuration:\n case EbmlTagId_1.EbmlTagId.CueRelativePosition:\n case EbmlTagId_1.EbmlTagId.CueClusterPosition:\n case EbmlTagId_1.EbmlTagId.CueTrack:\n case EbmlTagId_1.EbmlTagId.CueTime:\n case EbmlTagId_1.EbmlTagId.AESSettingsCipherMode:\n case EbmlTagId_1.EbmlTagId.ContentSigHashAlgo:\n case EbmlTagId_1.EbmlTagId.ContentSigAlgo:\n case EbmlTagId_1.EbmlTagId.ContentEncAlgo:\n case EbmlTagId_1.EbmlTagId.TrickMasterTrackUID:\n case EbmlTagId_1.EbmlTagId.TrickTrackFlag:\n case EbmlTagId_1.EbmlTagId.TrickTrackUID:\n case EbmlTagId_1.EbmlTagId.TrackJoinUID:\n case EbmlTagId_1.EbmlTagId.TrackPlaneType:\n case EbmlTagId_1.EbmlTagId.TrackPlaneUID:\n case EbmlTagId_1.EbmlTagId.Channels:\n case EbmlTagId_1.EbmlTagId.AspectRatioType:\n case EbmlTagId_1.EbmlTagId.DisplayUnit:\n case EbmlTagId_1.EbmlTagId.DisplayHeight:\n case EbmlTagId_1.EbmlTagId.DisplayWidth:\n case EbmlTagId_1.EbmlTagId.PixelCropRight:\n case EbmlTagId_1.EbmlTagId.PixelCropLeft:\n case EbmlTagId_1.EbmlTagId.PixelCropTop:\n case EbmlTagId_1.EbmlTagId.PixelCropBottom:\n case EbmlTagId_1.EbmlTagId.PixelHeight:\n case EbmlTagId_1.EbmlTagId.PixelWidth:\n case EbmlTagId_1.EbmlTagId.OldStereoMode:\n case EbmlTagId_1.EbmlTagId.AlphaMode:\n case EbmlTagId_1.EbmlTagId.StereoMode:\n case EbmlTagId_1.EbmlTagId.FlagInterlaced:\n case EbmlTagId_1.EbmlTagId.TrackTranslateCodec:\n case EbmlTagId_1.EbmlTagId.TrackTranslateEditionUID:\n case EbmlTagId_1.EbmlTagId.SeekPreRoll:\n case EbmlTagId_1.EbmlTagId.CodecDelay:\n case EbmlTagId_1.EbmlTagId.TrackOverlay:\n case EbmlTagId_1.EbmlTagId.CodecDecodeAll:\n case EbmlTagId_1.EbmlTagId.MaxBlockAdditionID:\n case EbmlTagId_1.EbmlTagId.DefaultDecodedFieldDuration:\n case EbmlTagId_1.EbmlTagId.DefaultDuration:\n case EbmlTagId_1.EbmlTagId.MaxCache:\n case EbmlTagId_1.EbmlTagId.MinCache:\n case EbmlTagId_1.EbmlTagId.FlagLacing:\n case EbmlTagId_1.EbmlTagId.FlagForced:\n case EbmlTagId_1.EbmlTagId.FlagEnabled:\n case EbmlTagId_1.EbmlTagId.TrackUID:\n case EbmlTagId_1.EbmlTagId.TrackNumber:\n case EbmlTagId_1.EbmlTagId.ReferenceTimeCode:\n case EbmlTagId_1.EbmlTagId.ReferenceOffset:\n case EbmlTagId_1.EbmlTagId.SliceDuration:\n case EbmlTagId_1.EbmlTagId.Delay:\n case EbmlTagId_1.EbmlTagId.BlockAdditionID:\n case EbmlTagId_1.EbmlTagId.FrameNumber:\n case EbmlTagId_1.EbmlTagId.LaceNumber:\n case EbmlTagId_1.EbmlTagId.ReferencePriority:\n case EbmlTagId_1.EbmlTagId.BlockDuration:\n case EbmlTagId_1.EbmlTagId.BlockAddID:\n case EbmlTagId_1.EbmlTagId.PrevSize:\n case EbmlTagId_1.EbmlTagId.Position:\n case EbmlTagId_1.EbmlTagId.SilentTrackNumber:\n case EbmlTagId_1.EbmlTagId.Timecode:\n case EbmlTagId_1.EbmlTagId.TimecodeScaleDenominator:\n case EbmlTagId_1.EbmlTagId.TimecodeScale:\n case EbmlTagId_1.EbmlTagId.ChapterTranslateCodec:\n case EbmlTagId_1.EbmlTagId.ChapterTranslateEditionUID:\n case EbmlTagId_1.EbmlTagId.SeekPosition:\n case EbmlTagId_1.EbmlTagId.SignatureHash:\n case EbmlTagId_1.EbmlTagId.SignatureAlgo:\n case EbmlTagId_1.EbmlTagId.EBMLMaxSizeLength:\n case EbmlTagId_1.EbmlTagId.EBMLMaxIDLength:\n case EbmlTagId_1.EbmlTagId.EBMLReadVersion:\n foundType = EbmlElementType_1.EbmlElementType.UnsignedInt;\n break;\n case EbmlTagId_1.EbmlTagId.TrackOffset:\n case EbmlTagId_1.EbmlTagId.DiscardPadding:\n case EbmlTagId_1.EbmlTagId.ReferenceVirtual:\n case EbmlTagId_1.EbmlTagId.ReferenceBlock:\n foundType = EbmlElementType_1.EbmlElementType.Integer;\n break;\n case EbmlTagId_1.EbmlTagId.CodecID:\n case EbmlTagId_1.EbmlTagId.DocType:\n case EbmlTagId_1.EbmlTagId.FileMimeType:\n case EbmlTagId_1.EbmlTagId.TagLanguage:\n case EbmlTagId_1.EbmlTagId.TargetType:\n case EbmlTagId_1.EbmlTagId.ChapCountry:\n case EbmlTagId_1.EbmlTagId.ChapLanguage:\n case EbmlTagId_1.EbmlTagId.CodecDownloadURL:\n case EbmlTagId_1.EbmlTagId.CodecInfoURL:\n case EbmlTagId_1.EbmlTagId.Language:\n foundType = EbmlElementType_1.EbmlElementType.String;\n break;\n case EbmlTagId_1.EbmlTagId.ChapString:\n case EbmlTagId_1.EbmlTagId.TagString:\n case EbmlTagId_1.EbmlTagId.ChapterStringUID:\n case EbmlTagId_1.EbmlTagId.WritingApp:\n case EbmlTagId_1.EbmlTagId.SegmentFilename:\n case EbmlTagId_1.EbmlTagId.CodecName:\n case EbmlTagId_1.EbmlTagId.TagName:\n case EbmlTagId_1.EbmlTagId.FileName:\n case EbmlTagId_1.EbmlTagId.FileDescription:\n case EbmlTagId_1.EbmlTagId.CodecSettings:\n case EbmlTagId_1.EbmlTagId.Name:\n case EbmlTagId_1.EbmlTagId.MuxingApp:\n case EbmlTagId_1.EbmlTagId.Title:\n case EbmlTagId_1.EbmlTagId.NextFilename:\n case EbmlTagId_1.EbmlTagId.PrevFilename:\n foundType = EbmlElementType_1.EbmlElementType.UTF8;\n break;\n case EbmlTagId_1.EbmlTagId.ContentCompSettings:\n case EbmlTagId_1.EbmlTagId.SegmentFamily:\n case EbmlTagId_1.EbmlTagId.TagBinary:\n case EbmlTagId_1.EbmlTagId.FileReferral:\n case EbmlTagId_1.EbmlTagId.SignedElement:\n case EbmlTagId_1.EbmlTagId.ChapProcessData:\n case EbmlTagId_1.EbmlTagId.ChapProcessPrivate:\n case EbmlTagId_1.EbmlTagId.ChapterSegmentUID:\n case EbmlTagId_1.EbmlTagId.FileData:\n case EbmlTagId_1.EbmlTagId.ContentSigKeyID:\n case EbmlTagId_1.EbmlTagId.ContentSignature:\n case EbmlTagId_1.EbmlTagId.ContentEncKeyID:\n case EbmlTagId_1.EbmlTagId.TrickMasterTrackSegmentUID:\n case EbmlTagId_1.EbmlTagId.TrickTrackSegmentUID:\n case EbmlTagId_1.EbmlTagId.ChannelPositions:\n case EbmlTagId_1.EbmlTagId.ColourSpace:\n case EbmlTagId_1.EbmlTagId.TrackTranslateTrackID:\n case EbmlTagId_1.EbmlTagId.CodecPrivate:\n case EbmlTagId_1.EbmlTagId.EncryptedBlock:\n case EbmlTagId_1.EbmlTagId.CodecState:\n case EbmlTagId_1.EbmlTagId.BlockAdditional:\n case EbmlTagId_1.EbmlTagId.BlockVirtual:\n case EbmlTagId_1.EbmlTagId.ChapterTranslateID:\n case EbmlTagId_1.EbmlTagId.NextUID:\n case EbmlTagId_1.EbmlTagId.PrevUID:\n case EbmlTagId_1.EbmlTagId.SegmentUID:\n case EbmlTagId_1.EbmlTagId.SeekID:\n case EbmlTagId_1.EbmlTagId.Signature:\n case EbmlTagId_1.EbmlTagId.SignaturePublicKey:\n case EbmlTagId_1.EbmlTagId.CRC32:\n case EbmlTagId_1.EbmlTagId.Void:\n foundType = EbmlElementType_1.EbmlElementType.Binary;\n break;\n case EbmlTagId_1.EbmlTagId.Duration:\n case EbmlTagId_1.EbmlTagId.OutputSamplingFrequency:\n case EbmlTagId_1.EbmlTagId.SamplingFrequency:\n case EbmlTagId_1.EbmlTagId.FrameRate:\n case EbmlTagId_1.EbmlTagId.GammaValue:\n case EbmlTagId_1.EbmlTagId.TrackTimecodeScale:\n foundType = EbmlElementType_1.EbmlElementType.Float;\n break;\n case EbmlTagId_1.EbmlTagId.DateUTC:\n foundType = EbmlElementType_1.EbmlElementType.Date;\n break;\n }\n if (type === undefined) {\n type = foundType;\n }\n else {\n if (type !== foundType) {\n throw new Error(`Trying to create tag of well-known type \"${EbmlTagId_1.EbmlTagId[id]}\" using content type \"${type}\" (which is incorrect). Either pass the correct type or ignore the type parameter to EbmlTag.create()`);\n }\n }\n }\n switch (type) {\n case EbmlElementType_1.EbmlElementType.Master:\n return new EbmlMasterTag_1.EbmlMasterTag(id);\n case EbmlElementType_1.EbmlElementType.UTF8:\n case EbmlElementType_1.EbmlElementType.Binary:\n case EbmlElementType_1.EbmlElementType.Date:\n case EbmlElementType_1.EbmlElementType.Float:\n case EbmlElementType_1.EbmlElementType.Integer:\n case EbmlElementType_1.EbmlElementType.String:\n case EbmlElementType_1.EbmlElementType.UnsignedInt:\n default:\n return new EbmlDataTag_1.EbmlDataTag(id, type);\n }\n }\n}\nexports.EbmlTagFactory = EbmlTagFactory;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar BlockLacing;\n(function (BlockLacing) {\n BlockLacing[BlockLacing[\"None\"] = 0] = \"None\";\n BlockLacing[BlockLacing[\"Xiph\"] = 1] = \"Xiph\";\n BlockLacing[BlockLacing[\"EBML\"] = 2] = \"EBML\";\n BlockLacing[BlockLacing[\"FixedSize\"] = 3] = \"FixedSize\";\n})(BlockLacing = exports.BlockLacing || (exports.BlockLacing = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar EbmlElementType;\n(function (EbmlElementType) {\n EbmlElementType[\"Master\"] = \"m\";\n EbmlElementType[\"UnsignedInt\"] = \"u\";\n EbmlElementType[\"Integer\"] = \"i\";\n EbmlElementType[\"String\"] = \"s\";\n EbmlElementType[\"UTF8\"] = \"8\";\n EbmlElementType[\"Binary\"] = \"b\";\n EbmlElementType[\"Float\"] = \"f\";\n EbmlElementType[\"Date\"] = \"d\";\n})(EbmlElementType = exports.EbmlElementType || (exports.EbmlElementType = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar EbmlTagId;\n(function (EbmlTagId) {\n EbmlTagId[EbmlTagId[\"ChapterDisplay\"] = 128] = \"ChapterDisplay\";\n EbmlTagId[EbmlTagId[\"TrackType\"] = 131] = \"TrackType\";\n EbmlTagId[EbmlTagId[\"ChapString\"] = 133] = \"ChapString\";\n EbmlTagId[EbmlTagId[\"CodecID\"] = 134] = \"CodecID\";\n EbmlTagId[EbmlTagId[\"FlagDefault\"] = 136] = \"FlagDefault\";\n EbmlTagId[EbmlTagId[\"ChapterTrackNumber\"] = 137] = \"ChapterTrackNumber\";\n EbmlTagId[EbmlTagId[\"ChapterTimeStart\"] = 145] = \"ChapterTimeStart\";\n EbmlTagId[EbmlTagId[\"ChapterTimeEnd\"] = 146] = \"ChapterTimeEnd\";\n EbmlTagId[EbmlTagId[\"CueRefTime\"] = 150] = \"CueRefTime\";\n EbmlTagId[EbmlTagId[\"CueRefCluster\"] = 151] = \"CueRefCluster\";\n EbmlTagId[EbmlTagId[\"ChapterFlagHidden\"] = 152] = \"ChapterFlagHidden\";\n EbmlTagId[EbmlTagId[\"ContentCompAlgo\"] = 16980] = \"ContentCompAlgo\";\n EbmlTagId[EbmlTagId[\"ContentCompSettings\"] = 16981] = \"ContentCompSettings\";\n EbmlTagId[EbmlTagId[\"DocType\"] = 17026] = \"DocType\";\n EbmlTagId[EbmlTagId[\"DocTypeReadVersion\"] = 17029] = \"DocTypeReadVersion\";\n EbmlTagId[EbmlTagId[\"EBMLVersion\"] = 17030] = \"EBMLVersion\";\n EbmlTagId[EbmlTagId[\"DocTypeVersion\"] = 17031] = \"DocTypeVersion\";\n EbmlTagId[EbmlTagId[\"SegmentFamily\"] = 17476] = \"SegmentFamily\";\n EbmlTagId[EbmlTagId[\"DateUTC\"] = 17505] = \"DateUTC\";\n EbmlTagId[EbmlTagId[\"TagDefault\"] = 17540] = \"TagDefault\";\n EbmlTagId[EbmlTagId[\"TagBinary\"] = 17541] = \"TagBinary\";\n EbmlTagId[EbmlTagId[\"TagString\"] = 17543] = \"TagString\";\n EbmlTagId[EbmlTagId[\"Duration\"] = 17545] = \"Duration\";\n EbmlTagId[EbmlTagId[\"ChapterFlagEnabled\"] = 17816] = \"ChapterFlagEnabled\";\n EbmlTagId[EbmlTagId[\"FileMimeType\"] = 18016] = \"FileMimeType\";\n EbmlTagId[EbmlTagId[\"FileUsedStartTime\"] = 18017] = \"FileUsedStartTime\";\n EbmlTagId[EbmlTagId[\"FileUsedEndTime\"] = 18018] = \"FileUsedEndTime\";\n EbmlTagId[EbmlTagId[\"FileReferral\"] = 18037] = \"FileReferral\";\n EbmlTagId[EbmlTagId[\"ContentEncodingOrder\"] = 20529] = \"ContentEncodingOrder\";\n EbmlTagId[EbmlTagId[\"ContentEncodingScope\"] = 20530] = \"ContentEncodingScope\";\n EbmlTagId[EbmlTagId[\"ContentEncodingType\"] = 20531] = \"ContentEncodingType\";\n EbmlTagId[EbmlTagId[\"ContentCompression\"] = 20532] = \"ContentCompression\";\n EbmlTagId[EbmlTagId[\"ContentEncryption\"] = 20533] = \"ContentEncryption\";\n EbmlTagId[EbmlTagId[\"CueBlockNumber\"] = 21368] = \"CueBlockNumber\";\n EbmlTagId[EbmlTagId[\"ChapterStringUID\"] = 22100] = \"ChapterStringUID\";\n EbmlTagId[EbmlTagId[\"WritingApp\"] = 22337] = \"WritingApp\";\n EbmlTagId[EbmlTagId[\"SilentTracks\"] = 22612] = \"SilentTracks\";\n EbmlTagId[EbmlTagId[\"ContentEncoding\"] = 25152] = \"ContentEncoding\";\n EbmlTagId[EbmlTagId[\"BitDepth\"] = 25188] = \"BitDepth\";\n EbmlTagId[EbmlTagId[\"SignedElement\"] = 25906] = \"SignedElement\";\n EbmlTagId[EbmlTagId[\"TrackTranslate\"] = 26148] = \"TrackTranslate\";\n EbmlTagId[EbmlTagId[\"ChapProcessCommand\"] = 26897] = \"ChapProcessCommand\";\n EbmlTagId[EbmlTagId[\"ChapProcessTime\"] = 26914] = \"ChapProcessTime\";\n EbmlTagId[EbmlTagId[\"ChapterTranslate\"] = 26916] = \"ChapterTranslate\";\n EbmlTagId[EbmlTagId[\"ChapProcessData\"] = 26931] = \"ChapProcessData\";\n EbmlTagId[EbmlTagId[\"ChapProcess\"] = 26948] = \"ChapProcess\";\n EbmlTagId[EbmlTagId[\"ChapProcessCodecID\"] = 26965] = \"ChapProcessCodecID\";\n EbmlTagId[EbmlTagId[\"Tag\"] = 29555] = \"Tag\";\n EbmlTagId[EbmlTagId[\"SegmentFilename\"] = 29572] = \"SegmentFilename\";\n EbmlTagId[EbmlTagId[\"AttachmentLink\"] = 29766] = \"AttachmentLink\";\n EbmlTagId[EbmlTagId[\"CodecName\"] = 2459272] = \"CodecName\";\n EbmlTagId[EbmlTagId[\"Segment\"] = 408125543] = \"Segment\";\n EbmlTagId[EbmlTagId[\"TagLanguage\"] = 17530] = \"TagLanguage\";\n EbmlTagId[EbmlTagId[\"TagName\"] = 17827] = \"TagName\";\n EbmlTagId[EbmlTagId[\"SimpleTag\"] = 26568] = \"SimpleTag\";\n EbmlTagId[EbmlTagId[\"TagAttachmentUID\"] = 25542] = \"TagAttachmentUID\";\n EbmlTagId[EbmlTagId[\"TagChapterUID\"] = 25540] = \"TagChapterUID\";\n EbmlTagId[EbmlTagId[\"TagEditionUID\"] = 25545] = \"TagEditionUID\";\n EbmlTagId[EbmlTagId[\"TagTrackUID\"] = 25541] = \"TagTrackUID\";\n EbmlTagId[EbmlTagId[\"TargetType\"] = 25546] = \"TargetType\";\n EbmlTagId[EbmlTagId[\"TargetTypeValue\"] = 26826] = \"TargetTypeValue\";\n EbmlTagId[EbmlTagId[\"Targets\"] = 25536] = \"Targets\";\n EbmlTagId[EbmlTagId[\"Tags\"] = 307544935] = \"Tags\";\n EbmlTagId[EbmlTagId[\"ChapProcessPrivate\"] = 17677] = \"ChapProcessPrivate\";\n EbmlTagId[EbmlTagId[\"ChapCountry\"] = 17278] = \"ChapCountry\";\n EbmlTagId[EbmlTagId[\"ChapLanguage\"] = 17276] = \"ChapLanguage\";\n EbmlTagId[EbmlTagId[\"ChapterTrack\"] = 143] = \"ChapterTrack\";\n EbmlTagId[EbmlTagId[\"ChapterPhysicalEquiv\"] = 25539] = \"ChapterPhysicalEquiv\";\n EbmlTagId[EbmlTagId[\"ChapterSegmentEditionUID\"] = 28348] = \"ChapterSegmentEditionUID\";\n EbmlTagId[EbmlTagId[\"ChapterSegmentUID\"] = 28263] = \"ChapterSegmentUID\";\n EbmlTagId[EbmlTagId[\"ChapterUID\"] = 29636] = \"ChapterUID\";\n EbmlTagId[EbmlTagId[\"ChapterAtom\"] = 182] = \"ChapterAtom\";\n EbmlTagId[EbmlTagId[\"EditionFlagOrdered\"] = 17885] = \"EditionFlagOrdered\";\n EbmlTagId[EbmlTagId[\"EditionFlagDefault\"] = 17883] = \"EditionFlagDefault\";\n EbmlTagId[EbmlTagId[\"EditionFlagHidden\"] = 17853] = \"EditionFlagHidden\";\n EbmlTagId[EbmlTagId[\"EditionUID\"] = 17852] = \"EditionUID\";\n EbmlTagId[EbmlTagId[\"EditionEntry\"] = 17849] = \"EditionEntry\";\n EbmlTagId[EbmlTagId[\"Chapters\"] = 272869232] = \"Chapters\";\n EbmlTagId[EbmlTagId[\"FileUID\"] = 18094] = \"FileUID\";\n EbmlTagId[EbmlTagId[\"FileData\"] = 18012] = \"FileData\";\n EbmlTagId[EbmlTagId[\"FileName\"] = 18030] = \"FileName\";\n EbmlTagId[EbmlTagId[\"FileDescription\"] = 18046] = \"FileDescription\";\n EbmlTagId[EbmlTagId[\"AttachedFile\"] = 24999] = \"AttachedFile\";\n EbmlTagId[EbmlTagId[\"Attachments\"] = 423732329] = \"Attachments\";\n EbmlTagId[EbmlTagId[\"CueRefCodecState\"] = 235] = \"CueRefCodecState\";\n EbmlTagId[EbmlTagId[\"CueRefNumber\"] = 21343] = \"CueRefNumber\";\n EbmlTagId[EbmlTagId[\"CueReference\"] = 219] = \"CueReference\";\n EbmlTagId[EbmlTagId[\"CueCodecState\"] = 234] = \"CueCodecState\";\n EbmlTagId[EbmlTagId[\"CueDuration\"] = 178] = \"CueDuration\";\n EbmlTagId[EbmlTagId[\"CueRelativePosition\"] = 240] = \"CueRelativePosition\";\n EbmlTagId[EbmlTagId[\"CueClusterPosition\"] = 241] = \"CueClusterPosition\";\n EbmlTagId[EbmlTagId[\"CueTrack\"] = 247] = \"CueTrack\";\n EbmlTagId[EbmlTagId[\"CueTrackPositions\"] = 183] = \"CueTrackPositions\";\n EbmlTagId[EbmlTagId[\"CueTime\"] = 179] = \"CueTime\";\n EbmlTagId[EbmlTagId[\"CuePoint\"] = 187] = \"CuePoint\";\n EbmlTagId[EbmlTagId[\"Cues\"] = 475249515] = \"Cues\";\n EbmlTagId[EbmlTagId[\"AESSettingsCipherMode\"] = 18408] = \"AESSettingsCipherMode\";\n EbmlTagId[EbmlTagId[\"ContentEncAESSettings\"] = 18407] = \"ContentEncAESSettings\";\n EbmlTagId[EbmlTagId[\"ContentSigHashAlgo\"] = 18406] = \"ContentSigHashAlgo\";\n EbmlTagId[EbmlTagId[\"ContentSigAlgo\"] = 18405] = \"ContentSigAlgo\";\n EbmlTagId[EbmlTagId[\"ContentSigKeyID\"] = 18404] = \"ContentSigKeyID\";\n EbmlTagId[EbmlTagId[\"ContentSignature\"] = 18403] = \"ContentSignature\";\n EbmlTagId[EbmlTagId[\"ContentEncKeyID\"] = 18402] = \"ContentEncKeyID\";\n EbmlTagId[EbmlTagId[\"ContentEncAlgo\"] = 18401] = \"ContentEncAlgo\";\n EbmlTagId[EbmlTagId[\"ContentEncodings\"] = 28032] = \"ContentEncodings\";\n EbmlTagId[EbmlTagId[\"TrickMasterTrackSegmentUID\"] = 196] = \"TrickMasterTrackSegmentUID\";\n EbmlTagId[EbmlTagId[\"TrickMasterTrackUID\"] = 199] = \"TrickMasterTrackUID\";\n EbmlTagId[EbmlTagId[\"TrickTrackFlag\"] = 198] = \"TrickTrackFlag\";\n EbmlTagId[EbmlTagId[\"TrickTrackSegmentUID\"] = 193] = \"TrickTrackSegmentUID\";\n EbmlTagId[EbmlTagId[\"TrickTrackUID\"] = 192] = \"TrickTrackUID\";\n EbmlTagId[EbmlTagId[\"TrackJoinUID\"] = 237] = \"TrackJoinUID\";\n EbmlTagId[EbmlTagId[\"TrackJoinBlocks\"] = 233] = \"TrackJoinBlocks\";\n EbmlTagId[EbmlTagId[\"TrackPlaneType\"] = 230] = \"TrackPlaneType\";\n EbmlTagId[EbmlTagId[\"TrackPlaneUID\"] = 229] = \"TrackPlaneUID\";\n EbmlTagId[EbmlTagId[\"TrackPlane\"] = 228] = \"TrackPlane\";\n EbmlTagId[EbmlTagId[\"TrackCombinePlanes\"] = 227] = \"TrackCombinePlanes\";\n EbmlTagId[EbmlTagId[\"TrackOperation\"] = 226] = \"TrackOperation\";\n EbmlTagId[EbmlTagId[\"ChannelPositions\"] = 32123] = \"ChannelPositions\";\n EbmlTagId[EbmlTagId[\"Channels\"] = 159] = \"Channels\";\n EbmlTagId[EbmlTagId[\"OutputSamplingFrequency\"] = 30901] = \"OutputSamplingFrequency\";\n EbmlTagId[EbmlTagId[\"SamplingFrequency\"] = 181] = \"SamplingFrequency\";\n EbmlTagId[EbmlTagId[\"Audio\"] = 225] = \"Audio\";\n EbmlTagId[EbmlTagId[\"FrameRate\"] = 2327523] = \"FrameRate\";\n EbmlTagId[EbmlTagId[\"GammaValue\"] = 3126563] = \"GammaValue\";\n EbmlTagId[EbmlTagId[\"ColourSpace\"] = 3061028] = \"ColourSpace\";\n EbmlTagId[EbmlTagId[\"AspectRatioType\"] = 21683] = \"AspectRatioType\";\n EbmlTagId[EbmlTagId[\"DisplayUnit\"] = 21682] = \"DisplayUnit\";\n EbmlTagId[EbmlTagId[\"DisplayHeight\"] = 21690] = \"DisplayHeight\";\n EbmlTagId[EbmlTagId[\"DisplayWidth\"] = 21680] = \"DisplayWidth\";\n EbmlTagId[EbmlTagId[\"PixelCropRight\"] = 21725] = \"PixelCropRight\";\n EbmlTagId[EbmlTagId[\"PixelCropLeft\"] = 21708] = \"PixelCropLeft\";\n EbmlTagId[EbmlTagId[\"PixelCropTop\"] = 21691] = \"PixelCropTop\";\n EbmlTagId[EbmlTagId[\"PixelCropBottom\"] = 21674] = \"PixelCropBottom\";\n EbmlTagId[EbmlTagId[\"PixelHeight\"] = 186] = \"PixelHeight\";\n EbmlTagId[EbmlTagId[\"PixelWidth\"] = 176] = \"PixelWidth\";\n EbmlTagId[EbmlTagId[\"OldStereoMode\"] = 21433] = \"OldStereoMode\";\n EbmlTagId[EbmlTagId[\"AlphaMode\"] = 21440] = \"AlphaMode\";\n EbmlTagId[EbmlTagId[\"StereoMode\"] = 21432] = \"StereoMode\";\n EbmlTagId[EbmlTagId[\"FlagInterlaced\"] = 154] = \"FlagInterlaced\";\n EbmlTagId[EbmlTagId[\"Video\"] = 224] = \"Video\";\n EbmlTagId[EbmlTagId[\"TrackTranslateTrackID\"] = 26277] = \"TrackTranslateTrackID\";\n EbmlTagId[EbmlTagId[\"TrackTranslateCodec\"] = 26303] = \"TrackTranslateCodec\";\n EbmlTagId[EbmlTagId[\"TrackTranslateEditionUID\"] = 26364] = \"TrackTranslateEditionUID\";\n EbmlTagId[EbmlTagId[\"SeekPreRoll\"] = 22203] = \"SeekPreRoll\";\n EbmlTagId[EbmlTagId[\"CodecDelay\"] = 22186] = \"CodecDelay\";\n EbmlTagId[EbmlTagId[\"TrackOverlay\"] = 28587] = \"TrackOverlay\";\n EbmlTagId[EbmlTagId[\"CodecDecodeAll\"] = 170] = \"CodecDecodeAll\";\n EbmlTagId[EbmlTagId[\"CodecDownloadURL\"] = 2536000] = \"CodecDownloadURL\";\n EbmlTagId[EbmlTagId[\"CodecInfoURL\"] = 3883072] = \"CodecInfoURL\";\n EbmlTagId[EbmlTagId[\"CodecSettings\"] = 3839639] = \"CodecSettings\";\n EbmlTagId[EbmlTagId[\"CodecPrivate\"] = 25506] = \"CodecPrivate\";\n EbmlTagId[EbmlTagId[\"Language\"] = 2274716] = \"Language\";\n EbmlTagId[EbmlTagId[\"Name\"] = 21358] = \"Name\";\n EbmlTagId[EbmlTagId[\"MaxBlockAdditionID\"] = 21998] = \"MaxBlockAdditionID\";\n EbmlTagId[EbmlTagId[\"TrackOffset\"] = 21375] = \"TrackOffset\";\n EbmlTagId[EbmlTagId[\"TrackTimecodeScale\"] = 2306383] = \"TrackTimecodeScale\";\n EbmlTagId[EbmlTagId[\"DefaultDecodedFieldDuration\"] = 2313850] = \"DefaultDecodedFieldDuration\";\n EbmlTagId[EbmlTagId[\"DefaultDuration\"] = 2352003] = \"DefaultDuration\";\n EbmlTagId[EbmlTagId[\"MaxCache\"] = 28152] = \"MaxCache\";\n EbmlTagId[EbmlTagId[\"MinCache\"] = 28135] = \"MinCache\";\n EbmlTagId[EbmlTagId[\"FlagLacing\"] = 156] = \"FlagLacing\";\n EbmlTagId[EbmlTagId[\"FlagForced\"] = 21930] = \"FlagForced\";\n EbmlTagId[EbmlTagId[\"FlagEnabled\"] = 185] = \"FlagEnabled\";\n EbmlTagId[EbmlTagId[\"TrackUID\"] = 29637] = \"TrackUID\";\n EbmlTagId[EbmlTagId[\"TrackNumber\"] = 215] = \"TrackNumber\";\n EbmlTagId[EbmlTagId[\"TrackEntry\"] = 174] = \"TrackEntry\";\n EbmlTagId[EbmlTagId[\"Tracks\"] = 374648427] = \"Tracks\";\n EbmlTagId[EbmlTagId[\"EncryptedBlock\"] = 175] = \"EncryptedBlock\";\n EbmlTagId[EbmlTagId[\"ReferenceTimeCode\"] = 202] = \"ReferenceTimeCode\";\n EbmlTagId[EbmlTagId[\"ReferenceOffset\"] = 201] = \"ReferenceOffset\";\n EbmlTagId[EbmlTagId[\"ReferenceFrame\"] = 200] = \"ReferenceFrame\";\n EbmlTagId[EbmlTagId[\"SliceDuration\"] = 207] = \"SliceDuration\";\n EbmlTagId[EbmlTagId[\"Delay\"] = 206] = \"Delay\";\n EbmlTagId[EbmlTagId[\"BlockAdditionID\"] = 203] = \"BlockAdditionID\";\n EbmlTagId[EbmlTagId[\"FrameNumber\"] = 205] = \"FrameNumber\";\n EbmlTagId[EbmlTagId[\"LaceNumber\"] = 204] = \"LaceNumber\";\n EbmlTagId[EbmlTagId[\"TimeSlice\"] = 232] = \"TimeSlice\";\n EbmlTagId[EbmlTagId[\"Slices\"] = 142] = \"Slices\";\n EbmlTagId[EbmlTagId[\"DiscardPadding\"] = 30114] = \"DiscardPadding\";\n EbmlTagId[EbmlTagId[\"CodecState\"] = 164] = \"CodecState\";\n EbmlTagId[EbmlTagId[\"ReferenceVirtual\"] = 253] = \"ReferenceVirtual\";\n EbmlTagId[EbmlTagId[\"ReferenceBlock\"] = 251] = \"ReferenceBlock\";\n EbmlTagId[EbmlTagId[\"ReferencePriority\"] = 250] = \"ReferencePriority\";\n EbmlTagId[EbmlTagId[\"BlockDuration\"] = 155] = \"BlockDuration\";\n EbmlTagId[EbmlTagId[\"BlockAdditional\"] = 165] = \"BlockAdditional\";\n EbmlTagId[EbmlTagId[\"BlockAddID\"] = 238] = \"BlockAddID\";\n EbmlTagId[EbmlTagId[\"BlockMore\"] = 166] = \"BlockMore\";\n EbmlTagId[EbmlTagId[\"BlockAdditions\"] = 30113] = \"BlockAdditions\";\n EbmlTagId[EbmlTagId[\"BlockVirtual\"] = 162] = \"BlockVirtual\";\n EbmlTagId[EbmlTagId[\"Block\"] = 161] = \"Block\";\n EbmlTagId[EbmlTagId[\"BlockGroup\"] = 160] = \"BlockGroup\";\n EbmlTagId[EbmlTagId[\"SimpleBlock\"] = 163] = \"SimpleBlock\";\n EbmlTagId[EbmlTagId[\"PrevSize\"] = 171] = \"PrevSize\";\n EbmlTagId[EbmlTagId[\"Position\"] = 167] = \"Position\";\n EbmlTagId[EbmlTagId[\"SilentTrackNumber\"] = 22743] = \"SilentTrackNumber\";\n EbmlTagId[EbmlTagId[\"Timecode\"] = 231] = \"Timecode\";\n EbmlTagId[EbmlTagId[\"Cluster\"] = 524531317] = \"Cluster\";\n EbmlTagId[EbmlTagId[\"MuxingApp\"] = 19840] = \"MuxingApp\";\n EbmlTagId[EbmlTagId[\"Title\"] = 31657] = \"Title\";\n EbmlTagId[EbmlTagId[\"TimecodeScaleDenominator\"] = 2807730] = \"TimecodeScaleDenominator\";\n EbmlTagId[EbmlTagId[\"TimecodeScale\"] = 2807729] = \"TimecodeScale\";\n EbmlTagId[EbmlTagId[\"ChapterTranslateID\"] = 27045] = \"ChapterTranslateID\";\n EbmlTagId[EbmlTagId[\"ChapterTranslateCodec\"] = 27071] = \"ChapterTranslateCodec\";\n EbmlTagId[EbmlTagId[\"ChapterTranslateEditionUID\"] = 27132] = \"ChapterTranslateEditionUID\";\n EbmlTagId[EbmlTagId[\"NextFilename\"] = 4096955] = \"NextFilename\";\n EbmlTagId[EbmlTagId[\"NextUID\"] = 4110627] = \"NextUID\";\n EbmlTagId[EbmlTagId[\"PrevFilename\"] = 3965867] = \"PrevFilename\";\n EbmlTagId[EbmlTagId[\"PrevUID\"] = 3979555] = \"PrevUID\";\n EbmlTagId[EbmlTagId[\"SegmentUID\"] = 29604] = \"SegmentUID\";\n EbmlTagId[EbmlTagId[\"Info\"] = 357149030] = \"Info\";\n EbmlTagId[EbmlTagId[\"SeekPosition\"] = 21420] = \"SeekPosition\";\n EbmlTagId[EbmlTagId[\"SeekID\"] = 21419] = \"SeekID\";\n EbmlTagId[EbmlTagId[\"Seek\"] = 19899] = \"Seek\";\n EbmlTagId[EbmlTagId[\"SeekHead\"] = 290298740] = \"SeekHead\";\n EbmlTagId[EbmlTagId[\"SignatureElementList\"] = 32379] = \"SignatureElementList\";\n EbmlTagId[EbmlTagId[\"SignatureElements\"] = 32347] = \"SignatureElements\";\n EbmlTagId[EbmlTagId[\"Signature\"] = 32437] = \"Signature\";\n EbmlTagId[EbmlTagId[\"SignaturePublicKey\"] = 32421] = \"SignaturePublicKey\";\n EbmlTagId[EbmlTagId[\"SignatureHash\"] = 32410] = \"SignatureHash\";\n EbmlTagId[EbmlTagId[\"SignatureAlgo\"] = 32394] = \"SignatureAlgo\";\n EbmlTagId[EbmlTagId[\"SignatureSlot\"] = 458458727] = \"SignatureSlot\";\n EbmlTagId[EbmlTagId[\"CRC32\"] = 191] = \"CRC32\";\n EbmlTagId[EbmlTagId[\"Void\"] = 236] = \"Void\";\n EbmlTagId[EbmlTagId[\"EBMLMaxSizeLength\"] = 17139] = \"EBMLMaxSizeLength\";\n EbmlTagId[EbmlTagId[\"EBMLMaxIDLength\"] = 17138] = \"EBMLMaxIDLength\";\n EbmlTagId[EbmlTagId[\"EBMLReadVersion\"] = 17143] = \"EBMLReadVersion\";\n EbmlTagId[EbmlTagId[\"EBML\"] = 440786851] = \"EBML\";\n})(EbmlTagId = exports.EbmlTagId || (exports.EbmlTagId = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nvar EbmlTagPosition;\n(function (EbmlTagPosition) {\n EbmlTagPosition[EbmlTagPosition[\"Start\"] = 0] = \"Start\";\n EbmlTagPosition[EbmlTagPosition[\"Content\"] = 1] = \"Content\";\n EbmlTagPosition[EbmlTagPosition[\"End\"] = 2] = \"End\";\n})(EbmlTagPosition = exports.EbmlTagPosition || (exports.EbmlTagPosition = {}));\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlDataTag_1 = require(\"./EbmlDataTag\");\nconst BlockLacing_1 = require(\"../enums/BlockLacing\");\nconst tools_1 = require(\"../../tools\");\nconst EbmlTagId_1 = require(\"../enums/EbmlTagId\");\nconst EbmlElementType_1 = require(\"../enums/EbmlElementType\");\nclass Block extends EbmlDataTag_1.EbmlDataTag {\n constructor(subTypeId) {\n super(subTypeId || EbmlTagId_1.EbmlTagId.Block, EbmlElementType_1.EbmlElementType.Binary);\n }\n writeTrackBuffer() {\n return tools_1.Tools.writeVint(this.track);\n }\n writeValueBuffer() {\n let value = Buffer.alloc(2);\n value.writeInt16BE(this.value, 0);\n return value;\n }\n writeFlagsBuffer() {\n let flags = 0x00;\n if (this.invisible) {\n flags |= 0x10;\n }\n switch (this.lacing) {\n case BlockLacing_1.BlockLacing.None:\n break;\n case BlockLacing_1.BlockLacing.Xiph:\n flags |= 0x04;\n break;\n case BlockLacing_1.BlockLacing.EBML:\n flags |= 0x08;\n break;\n case BlockLacing_1.BlockLacing.FixedSize:\n flags |= 0x0c;\n break;\n }\n return Buffer.of(flags);\n }\n encodeContent() {\n return Buffer.concat([\n this.writeTrackBuffer(),\n this.writeValueBuffer(),\n this.writeFlagsBuffer(),\n this.payload\n ]);\n }\n parseContent(data) {\n const track = tools_1.Tools.readVint(data);\n this.track = track.value;\n this.value = tools_1.Tools.readSigned(data.subarray(track.length, track.length + 2));\n let flags = data[track.length + 2];\n this.invisible = Boolean(flags & 0x10);\n switch (flags & 0x0c) {\n case 0x00:\n this.lacing = BlockLacing_1.BlockLacing.None;\n break;\n case 0x04:\n this.lacing = BlockLacing_1.BlockLacing.Xiph;\n break;\n case 0x08:\n this.lacing = BlockLacing_1.BlockLacing.EBML;\n break;\n case 0x0c:\n this.lacing = BlockLacing_1.BlockLacing.FixedSize;\n break;\n }\n this.payload = data.slice(track.length + 3);\n }\n}\nexports.Block = Block;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlTag_1 = require(\"../EbmlTag\");\nconst EbmlElementType_1 = require(\"../enums/EbmlElementType\");\nconst tools_1 = require(\"../../tools\");\nconst EbmlTagPosition_1 = require(\"../enums/EbmlTagPosition\");\nclass EbmlDataTag extends EbmlTag_1.EbmlTag {\n constructor(id, type) {\n super(id, type, EbmlTagPosition_1.EbmlTagPosition.Content);\n }\n parseContent(data) {\n switch (this.type) {\n case EbmlElementType_1.EbmlElementType.UnsignedInt:\n this.data = tools_1.Tools.readUnsigned(data);\n break;\n case EbmlElementType_1.EbmlElementType.Float:\n this.data = tools_1.Tools.readFloat(data);\n break;\n case EbmlElementType_1.EbmlElementType.Integer:\n this.data = tools_1.Tools.readSigned(data);\n break;\n case EbmlElementType_1.EbmlElementType.String:\n this.data = String.fromCharCode(...data);\n break;\n case EbmlElementType_1.EbmlElementType.UTF8:\n this.data = tools_1.Tools.readUtf8(data);\n break;\n default:\n this.data = data;\n break;\n }\n }\n encodeContent() {\n switch (this.type) {\n case EbmlElementType_1.EbmlElementType.UnsignedInt:\n return tools_1.Tools.writeUnsigned(this.data);\n case EbmlElementType_1.EbmlElementType.Float:\n return tools_1.Tools.writeFloat(this.data);\n case EbmlElementType_1.EbmlElementType.Integer:\n return tools_1.Tools.writeSigned(this.data);\n case EbmlElementType_1.EbmlElementType.String:\n return Buffer.from(this.data, \"ascii\");\n case EbmlElementType_1.EbmlElementType.UTF8:\n return Buffer.from(this.data, \"utf8\");\n case EbmlElementType_1.EbmlElementType.Binary:\n default:\n return this.data;\n }\n }\n}\nexports.EbmlDataTag = EbmlDataTag;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst EbmlTag_1 = require(\"../EbmlTag\");\nconst EbmlElementType_1 = require(\"../enums/EbmlElementType\");\nconst EbmlTagPosition_1 = require(\"../enums/EbmlTagPosition\");\nconst tools_1 = require(\"../../tools\");\nconst EbmlTagFactory_1 = require(\"../EbmlTagFactory\");\nclass EbmlMasterTag extends EbmlTag_1.EbmlTag {\n constructor(id, position = EbmlTagPosition_1.EbmlTagPosition.Content) {\n super(id, EbmlElementType_1.EbmlElementType.Master, position);\n this._children = [];\n }\n get Children() {\n return this._children;\n }\n set Children(value) {\n this._children = value;\n }\n encodeContent() {\n return Buffer.concat(this._children.map(child => child.encode()));\n }\n parseContent(content) {\n while (content.length > 0) {\n const tag = tools_1.Tools.readVint(content);\n const size = tools_1.Tools.readVint(content, tag.length);\n const tagIdHex = tools_1.Tools.readHexString(content, 0, tag.length);\n const tagId = Number.parseInt(tagIdHex, 16);\n let tagObject = EbmlTagFactory_1.EbmlTagFactory.create(tagId);\n tagObject.size = size.value;\n let totalTagLength = tag.length + size.length + size.value;\n tagObject.parseContent(content.slice(tag.length + size.length, totalTagLength));\n this._children.push(tagObject);\n content = content.slice(totalTagLength);\n }\n }\n}\nexports.EbmlMasterTag = EbmlMasterTag;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nconst tools_1 = require(\"../../tools\");\nconst Block_1 = require(\"./Block\");\nconst EbmlTagId_1 = require(\"../enums/EbmlTagId\");\nclass SimpleBlock extends Block_1.Block {\n constructor() {\n super(EbmlTagId_1.EbmlTagId.SimpleBlock);\n }\n encodeContent() {\n let flags = this.writeFlagsBuffer();\n if (this.keyframe) {\n flags[0] |= 0x80;\n }\n if (this.discardable) {\n flags[0] |= 0x01;\n }\n return Buffer.concat([\n this.writeTrackBuffer(),\n this.writeValueBuffer(),\n flags,\n this.payload\n ]);\n }\n parseContent(data) {\n super.parseContent(data);\n const track = tools_1.Tools.readVint(data);\n let flags = data[track.length + 2];\n this.keyframe = Boolean(flags & 0x80);\n this.discardable = Boolean(flags & 0x01);\n }\n}\nexports.SimpleBlock = SimpleBlock;\n","\"use strict\";\nObject.defineProperty(exports, \"__esModule\", { value: true });\nclass Tools {\n static readVint(buffer, start = 0) {\n const length = 8 - Math.floor(Math.log2(buffer[start]));\n if (length > 8) {\n const number = Tools.readHexString(buffer, start, start + length);\n throw new Error(`Unrepresentable length: ${length} ${number}`);\n }\n if (isNaN(length) || start + length > buffer.length) {\n return null;\n }\n if (length === 8 && buffer[start + 1] >= 0x20 && buffer.subarray(start + 2, start + 8).some(i => i > 0x00)) {\n return {\n length: 8,\n value: -1\n };\n }\n let value = buffer[start] & ((1 << (8 - length)) - 1);\n for (let i = 1; i < length; i += 1) {\n value *= Math.pow(2, 8);\n value += buffer[start + i];\n }\n if (value === (Math.pow(2, (length * 7)) - 1)) {\n value = -1;\n }\n return {\n length,\n value,\n };\n }\n static writeVint(value, desiredLength) {\n if (value < 0 || value > (Math.pow(2, 53))) {\n throw new Error(`Unrepresentable value: ${value}`);\n }\n let length = desiredLength;\n if (!length) {\n for (length = 1; length <= 8; length += 1) {\n if (value < Math.pow(2, (7 * length)) - 1) {\n break;\n }\n }\n }\n const buffer = Buffer.alloc(length);\n let val = value;\n for (let i = 1; i <= length; i += 1) {\n const b = val & 0xff;\n buffer[length - i] = b;\n val -= b;\n val /= Math.pow(2, 8);\n }\n buffer[0] |= 1 << (8 - length);\n return buffer;\n }\n static padStart(val) {\n if (val.length == 0) {\n return '00';\n }\n if (val.length == 1) {\n return '0' + val;\n }\n return val;\n }\n static readHexString(buff, start = 0, end = buff.byteLength) {\n return Array.from(buff.subarray(start, end))\n .map(q => Number(q).toString(16))\n .reduce((acc, current) => `${acc}${this.padStart(current)}`, '');\n }\n static readUtf8(buff) {\n try {\n return Buffer.from(buff).toString('utf8');\n }\n catch (exception) {\n return null;\n }\n }\n static readUnsigned(buff) {\n const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength);\n switch (buff.byteLength) {\n case 1:\n return b.getUint8(0);\n case 2:\n return b.getUint16(0);\n case 4:\n return b.getUint32(0);\n default:\n break;\n }\n if (buff.byteLength <= 6) {\n return buff.reduce((acc, current) => acc * 256 + current, 0);\n }\n var hex = Tools.readHexString(buff, 0, buff.byteLength);\n var num = parseInt(hex, 16);\n if (num <= Math.pow(256, 6)) {\n return num;\n }\n return hex;\n }\n static writeUnsigned(num) {\n if (typeof num === 'string') {\n return Buffer.from(num, 'hex');\n }\n else {\n var buf = Buffer.alloc(6);\n buf.fill(0);\n buf.writeUIntBE(num, 0, 6);\n let firstValueIndex = buf.findIndex(b => b !== 0);\n if (firstValueIndex === -1) {\n firstValueIndex = buf.length - 1;\n }\n let ret = buf.slice(firstValueIndex);\n return ret;\n }\n }\n static readSigned(buff) {\n const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength);\n switch (buff.byteLength) {\n case 1:\n return b.getInt8(0);\n case 2:\n return b.getInt16(0);\n case 4:\n return b.getInt32(0);\n default:\n return NaN;\n }\n }\n static writeSigned(num) {\n var buf = Buffer.alloc(8);\n buf.writeInt32BE(num, 0);\n return buf;\n }\n static readFloat(buff) {\n const b = new DataView(buff.buffer, buff.byteOffset, buff.byteLength);\n switch (buff.byteLength) {\n case 4:\n return b.getFloat32(0);\n case 8:\n return b.getFloat64(0);\n default:\n return NaN;\n }\n }\n static writeFloat(num) {\n let buf = Buffer.alloc(8);\n let written = buf.writeFloatBE(num, 0);\n if (written <= 4) {\n buf = buf.slice(0, 4);\n }\n return buf;\n }\n}\nexports.Tools = Tools;\n","'use strict';\n\nvar elliptic = exports;\n\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');\n\n// Protocols\nelliptic.ec = require('./elliptic/ec');\nelliptic.eddsa = require('./elliptic/eddsa');\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar getNAF = utils.getNAF;\nvar getJSF = utils.getJSF;\nvar assert = utils.assert;\n\nfunction BaseCurve(type, conf) {\n this.type = type;\n this.p = new BN(conf.p, 16);\n\n // Use Montgomery, when there is no fast reduction for the prime\n this.red = conf.prime ? BN.red(conf.prime) : BN.mont(this.p);\n\n // Useful for many curves\n this.zero = new BN(0).toRed(this.red);\n this.one = new BN(1).toRed(this.red);\n this.two = new BN(2).toRed(this.red);\n\n // Curve configuration, optional\n this.n = conf.n && new BN(conf.n, 16);\n this.g = conf.g && this.pointFromJSON(conf.g, conf.gRed);\n\n // Temporary arrays\n this._wnafT1 = new Array(4);\n this._wnafT2 = new Array(4);\n this._wnafT3 = new Array(4);\n this._wnafT4 = new Array(4);\n\n this._bitLength = this.n ? this.n.bitLength() : 0;\n\n // Generalized Greg Maxwell's trick\n var adjustCount = this.n && this.p.div(this.n);\n if (!adjustCount || adjustCount.cmpn(100) > 0) {\n this.redN = null;\n } else {\n this._maxwellTrick = true;\n this.redN = this.n.toRed(this.red);\n }\n}\nmodule.exports = BaseCurve;\n\nBaseCurve.prototype.point = function point() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype.validate = function validate() {\n throw new Error('Not implemented');\n};\n\nBaseCurve.prototype._fixedNafMul = function _fixedNafMul(p, k) {\n assert(p.precomputed);\n var doubles = p._getDoubles();\n\n var naf = getNAF(k, 1, this._bitLength);\n var I = (1 << (doubles.step + 1)) - (doubles.step % 2 === 0 ? 2 : 1);\n I /= 3;\n\n // Translate into more windowed form\n var repr = [];\n var j;\n var nafW;\n for (j = 0; j < naf.length; j += doubles.step) {\n nafW = 0;\n for (var l = j + doubles.step - 1; l >= j; l--)\n nafW = (nafW << 1) + naf[l];\n repr.push(nafW);\n }\n\n var a = this.jpoint(null, null, null);\n var b = this.jpoint(null, null, null);\n for (var i = I; i > 0; i--) {\n for (j = 0; j < repr.length; j++) {\n nafW = repr[j];\n if (nafW === i)\n b = b.mixedAdd(doubles.points[j]);\n else if (nafW === -i)\n b = b.mixedAdd(doubles.points[j].neg());\n }\n a = a.add(b);\n }\n return a.toP();\n};\n\nBaseCurve.prototype._wnafMul = function _wnafMul(p, k) {\n var w = 4;\n\n // Precompute window\n var nafPoints = p._getNAFPoints(w);\n w = nafPoints.wnd;\n var wnd = nafPoints.points;\n\n // Get NAF form\n var naf = getNAF(k, w, this._bitLength);\n\n // Add `this`*(N+1) for every w-NAF index\n var acc = this.jpoint(null, null, null);\n for (var i = naf.length - 1; i >= 0; i--) {\n // Count zeroes\n for (var l = 0; i >= 0 && naf[i] === 0; i--)\n l++;\n if (i >= 0)\n l++;\n acc = acc.dblp(l);\n\n if (i < 0)\n break;\n var z = naf[i];\n assert(z !== 0);\n if (p.type === 'affine') {\n // J +- P\n if (z > 0)\n acc = acc.mixedAdd(wnd[(z - 1) >> 1]);\n else\n acc = acc.mixedAdd(wnd[(-z - 1) >> 1].neg());\n } else {\n // J +- J\n if (z > 0)\n acc = acc.add(wnd[(z - 1) >> 1]);\n else\n acc = acc.add(wnd[(-z - 1) >> 1].neg());\n }\n }\n return p.type === 'affine' ? acc.toP() : acc;\n};\n\nBaseCurve.prototype._wnafMulAdd = function _wnafMulAdd(defW,\n points,\n coeffs,\n len,\n jacobianResult) {\n var wndWidth = this._wnafT1;\n var wnd = this._wnafT2;\n var naf = this._wnafT3;\n\n // Fill all arrays\n var max = 0;\n var i;\n var j;\n var p;\n for (i = 0; i < len; i++) {\n p = points[i];\n var nafPoints = p._getNAFPoints(defW);\n wndWidth[i] = nafPoints.wnd;\n wnd[i] = nafPoints.points;\n }\n\n // Comb small window NAFs\n for (i = len - 1; i >= 1; i -= 2) {\n var a = i - 1;\n var b = i;\n if (wndWidth[a] !== 1 || wndWidth[b] !== 1) {\n naf[a] = getNAF(coeffs[a], wndWidth[a], this._bitLength);\n naf[b] = getNAF(coeffs[b], wndWidth[b], this._bitLength);\n max = Math.max(naf[a].length, max);\n max = Math.max(naf[b].length, max);\n continue;\n }\n\n var comb = [\n points[a], /* 1 */\n null, /* 3 */\n null, /* 5 */\n points[b], /* 7 */\n ];\n\n // Try to avoid Projective points, if possible\n if (points[a].y.cmp(points[b].y) === 0) {\n comb[1] = points[a].add(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n } else if (points[a].y.cmp(points[b].y.redNeg()) === 0) {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].add(points[b].neg());\n } else {\n comb[1] = points[a].toJ().mixedAdd(points[b]);\n comb[2] = points[a].toJ().mixedAdd(points[b].neg());\n }\n\n var index = [\n -3, /* -1 -1 */\n -1, /* -1 0 */\n -5, /* -1 1 */\n -7, /* 0 -1 */\n 0, /* 0 0 */\n 7, /* 0 1 */\n 5, /* 1 -1 */\n 1, /* 1 0 */\n 3, /* 1 1 */\n ];\n\n var jsf = getJSF(coeffs[a], coeffs[b]);\n max = Math.max(jsf[0].length, max);\n naf[a] = new Array(max);\n naf[b] = new Array(max);\n for (j = 0; j < max; j++) {\n var ja = jsf[0][j] | 0;\n var jb = jsf[1][j] | 0;\n\n naf[a][j] = index[(ja + 1) * 3 + (jb + 1)];\n naf[b][j] = 0;\n wnd[a] = comb;\n }\n }\n\n var acc = this.jpoint(null, null, null);\n var tmp = this._wnafT4;\n for (i = max; i >= 0; i--) {\n var k = 0;\n\n while (i >= 0) {\n var zero = true;\n for (j = 0; j < len; j++) {\n tmp[j] = naf[j][i] | 0;\n if (tmp[j] !== 0)\n zero = false;\n }\n if (!zero)\n break;\n k++;\n i--;\n }\n if (i >= 0)\n k++;\n acc = acc.dblp(k);\n if (i < 0)\n break;\n\n for (j = 0; j < len; j++) {\n var z = tmp[j];\n p;\n if (z === 0)\n continue;\n else if (z > 0)\n p = wnd[j][(z - 1) >> 1];\n else if (z < 0)\n p = wnd[j][(-z - 1) >> 1].neg();\n\n if (p.type === 'affine')\n acc = acc.mixedAdd(p);\n else\n acc = acc.add(p);\n }\n }\n // Zeroify references\n for (i = 0; i < len; i++)\n wnd[i] = null;\n\n if (jacobianResult)\n return acc;\n else\n return acc.toP();\n};\n\nfunction BasePoint(curve, type) {\n this.curve = curve;\n this.type = type;\n this.precomputed = null;\n}\nBaseCurve.BasePoint = BasePoint;\n\nBasePoint.prototype.eq = function eq(/*other*/) {\n throw new Error('Not implemented');\n};\n\nBasePoint.prototype.validate = function validate() {\n return this.curve.validate(this);\n};\n\nBaseCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n bytes = utils.toArray(bytes, enc);\n\n var len = this.p.byteLength();\n\n // uncompressed, hybrid-odd, hybrid-even\n if ((bytes[0] === 0x04 || bytes[0] === 0x06 || bytes[0] === 0x07) &&\n bytes.length - 1 === 2 * len) {\n if (bytes[0] === 0x06)\n assert(bytes[bytes.length - 1] % 2 === 0);\n else if (bytes[0] === 0x07)\n assert(bytes[bytes.length - 1] % 2 === 1);\n\n var res = this.point(bytes.slice(1, 1 + len),\n bytes.slice(1 + len, 1 + 2 * len));\n\n return res;\n } else if ((bytes[0] === 0x02 || bytes[0] === 0x03) &&\n bytes.length - 1 === len) {\n return this.pointFromX(bytes.slice(1, 1 + len), bytes[0] === 0x03);\n }\n throw new Error('Unknown point format');\n};\n\nBasePoint.prototype.encodeCompressed = function encodeCompressed(enc) {\n return this.encode(enc, true);\n};\n\nBasePoint.prototype._encode = function _encode(compact) {\n var len = this.curve.p.byteLength();\n var x = this.getX().toArray('be', len);\n\n if (compact)\n return [ this.getY().isEven() ? 0x02 : 0x03 ].concat(x);\n\n return [ 0x04 ].concat(x, this.getY().toArray('be', len));\n};\n\nBasePoint.prototype.encode = function encode(enc, compact) {\n return utils.encode(this._encode(compact), enc);\n};\n\nBasePoint.prototype.precompute = function precompute(power) {\n if (this.precomputed)\n return this;\n\n var precomputed = {\n doubles: null,\n naf: null,\n beta: null,\n };\n precomputed.naf = this._getNAFPoints(8);\n precomputed.doubles = this._getDoubles(4, power);\n precomputed.beta = this._getBeta();\n this.precomputed = precomputed;\n\n return this;\n};\n\nBasePoint.prototype._hasDoubles = function _hasDoubles(k) {\n if (!this.precomputed)\n return false;\n\n var doubles = this.precomputed.doubles;\n if (!doubles)\n return false;\n\n return doubles.points.length >= Math.ceil((k.bitLength() + 1) / doubles.step);\n};\n\nBasePoint.prototype._getDoubles = function _getDoubles(step, power) {\n if (this.precomputed && this.precomputed.doubles)\n return this.precomputed.doubles;\n\n var doubles = [ this ];\n var acc = this;\n for (var i = 0; i < power; i += step) {\n for (var j = 0; j < step; j++)\n acc = acc.dbl();\n doubles.push(acc);\n }\n return {\n step: step,\n points: doubles,\n };\n};\n\nBasePoint.prototype._getNAFPoints = function _getNAFPoints(wnd) {\n if (this.precomputed && this.precomputed.naf)\n return this.precomputed.naf;\n\n var res = [ this ];\n var max = (1 << wnd) - 1;\n var dbl = max === 1 ? null : this.dbl();\n for (var i = 1; i < max; i++)\n res[i] = res[i - 1].add(dbl);\n return {\n wnd: wnd,\n points: res,\n };\n};\n\nBasePoint.prototype._getBeta = function _getBeta() {\n return null;\n};\n\nBasePoint.prototype.dblp = function dblp(k) {\n var r = this;\n for (var i = 0; i < k; i++)\n r = r.dbl();\n return r;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction EdwardsCurve(conf) {\n // NOTE: Important as we are creating point in Base.call()\n this.twisted = (conf.a | 0) !== 1;\n this.mOneA = this.twisted && (conf.a | 0) === -1;\n this.extended = this.mOneA;\n\n Base.call(this, 'edwards', conf);\n\n this.a = new BN(conf.a, 16).umod(this.red.m);\n this.a = this.a.toRed(this.red);\n this.c = new BN(conf.c, 16).toRed(this.red);\n this.c2 = this.c.redSqr();\n this.d = new BN(conf.d, 16).toRed(this.red);\n this.dd = this.d.redAdd(this.d);\n\n assert(!this.twisted || this.c.fromRed().cmpn(1) === 0);\n this.oneC = (conf.c | 0) === 1;\n}\ninherits(EdwardsCurve, Base);\nmodule.exports = EdwardsCurve;\n\nEdwardsCurve.prototype._mulA = function _mulA(num) {\n if (this.mOneA)\n return num.redNeg();\n else\n return this.a.redMul(num);\n};\n\nEdwardsCurve.prototype._mulC = function _mulC(num) {\n if (this.oneC)\n return num;\n else\n return this.c.redMul(num);\n};\n\n// Just for compatibility with Short curve\nEdwardsCurve.prototype.jpoint = function jpoint(x, y, z, t) {\n return this.point(x, y, z, t);\n};\n\nEdwardsCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var x2 = x.redSqr();\n var rhs = this.c2.redSub(this.a.redMul(x2));\n var lhs = this.one.redSub(this.c2.redMul(this.d).redMul(x2));\n\n var y2 = rhs.redMul(lhs.redInvm());\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.pointFromY = function pointFromY(y, odd) {\n y = new BN(y, 16);\n if (!y.red)\n y = y.toRed(this.red);\n\n // x^2 = (y^2 - c^2) / (c^2 d y^2 - a)\n var y2 = y.redSqr();\n var lhs = y2.redSub(this.c2);\n var rhs = y2.redMul(this.d).redMul(this.c2).redSub(this.a);\n var x2 = lhs.redMul(rhs.redInvm());\n\n if (x2.cmp(this.zero) === 0) {\n if (odd)\n throw new Error('invalid point');\n else\n return this.point(this.zero, y);\n }\n\n var x = x2.redSqrt();\n if (x.redSqr().redSub(x2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n if (x.fromRed().isOdd() !== odd)\n x = x.redNeg();\n\n return this.point(x, y);\n};\n\nEdwardsCurve.prototype.validate = function validate(point) {\n if (point.isInfinity())\n return true;\n\n // Curve: A * X^2 + Y^2 = C^2 * (1 + D * X^2 * Y^2)\n point.normalize();\n\n var x2 = point.x.redSqr();\n var y2 = point.y.redSqr();\n var lhs = x2.redMul(this.a).redAdd(y2);\n var rhs = this.c2.redMul(this.one.redAdd(this.d.redMul(x2).redMul(y2)));\n\n return lhs.cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, y, z, t) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && y === null && z === null) {\n this.x = this.curve.zero;\n this.y = this.curve.one;\n this.z = this.curve.one;\n this.t = this.curve.zero;\n this.zOne = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = z ? new BN(z, 16) : this.curve.one;\n this.t = t && new BN(t, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n if (this.t && !this.t.red)\n this.t = this.t.toRed(this.curve.red);\n this.zOne = this.z === this.curve.one;\n\n // Use extended coordinates\n if (this.curve.extended && !this.t) {\n this.t = this.x.redMul(this.y);\n if (!this.zOne)\n this.t = this.t.redMul(this.z.redInvm());\n }\n }\n}\ninherits(Point, Base.BasePoint);\n\nEdwardsCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nEdwardsCurve.prototype.point = function point(x, y, z, t) {\n return new Point(this, x, y, z, t);\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1], obj[2]);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.x.cmpn(0) === 0 &&\n (this.y.cmp(this.z) === 0 ||\n (this.zOne && this.y.cmp(this.curve.c) === 0));\n};\n\nPoint.prototype._extDbl = function _extDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #doubling-dbl-2008-hwcd\n // 4M + 4S\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = 2 * Z1^2\n var c = this.z.redSqr();\n c = c.redIAdd(c);\n // D = a * A\n var d = this.curve._mulA(a);\n // E = (X1 + Y1)^2 - A - B\n var e = this.x.redAdd(this.y).redSqr().redISub(a).redISub(b);\n // G = D + B\n var g = d.redAdd(b);\n // F = G - C\n var f = g.redSub(c);\n // H = D - B\n var h = d.redSub(b);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projDbl = function _projDbl() {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #doubling-dbl-2008-bbjlp\n // #doubling-dbl-2007-bl\n // and others\n // Generally 3M + 4S or 2M + 4S\n\n // B = (X1 + Y1)^2\n var b = this.x.redAdd(this.y).redSqr();\n // C = X1^2\n var c = this.x.redSqr();\n // D = Y1^2\n var d = this.y.redSqr();\n\n var nx;\n var ny;\n var nz;\n var e;\n var h;\n var j;\n if (this.curve.twisted) {\n // E = a * C\n e = this.curve._mulA(c);\n // F = E + D\n var f = e.redAdd(d);\n if (this.zOne) {\n // X3 = (B - C - D) * (F - 2)\n nx = b.redSub(c).redSub(d).redMul(f.redSub(this.curve.two));\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F^2 - 2 * F\n nz = f.redSqr().redSub(f).redSub(f);\n } else {\n // H = Z1^2\n h = this.z.redSqr();\n // J = F - 2 * H\n j = f.redSub(h).redISub(h);\n // X3 = (B-C-D)*J\n nx = b.redSub(c).redISub(d).redMul(j);\n // Y3 = F * (E - D)\n ny = f.redMul(e.redSub(d));\n // Z3 = F * J\n nz = f.redMul(j);\n }\n } else {\n // E = C + D\n e = c.redAdd(d);\n // H = (c * Z1)^2\n h = this.curve._mulC(this.z).redSqr();\n // J = E - 2 * H\n j = e.redSub(h).redSub(h);\n // X3 = c * (B - E) * J\n nx = this.curve._mulC(b.redISub(e)).redMul(j);\n // Y3 = c * E * (C - D)\n ny = this.curve._mulC(e).redMul(c.redISub(d));\n // Z3 = E * J\n nz = e.redMul(j);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n // Double in extended coordinates\n if (this.curve.extended)\n return this._extDbl();\n else\n return this._projDbl();\n};\n\nPoint.prototype._extAdd = function _extAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-extended-1.html\n // #addition-add-2008-hwcd-3\n // 8M\n\n // A = (Y1 - X1) * (Y2 - X2)\n var a = this.y.redSub(this.x).redMul(p.y.redSub(p.x));\n // B = (Y1 + X1) * (Y2 + X2)\n var b = this.y.redAdd(this.x).redMul(p.y.redAdd(p.x));\n // C = T1 * k * T2\n var c = this.t.redMul(this.curve.dd).redMul(p.t);\n // D = Z1 * 2 * Z2\n var d = this.z.redMul(p.z.redAdd(p.z));\n // E = B - A\n var e = b.redSub(a);\n // F = D - C\n var f = d.redSub(c);\n // G = D + C\n var g = d.redAdd(c);\n // H = B + A\n var h = b.redAdd(a);\n // X3 = E * F\n var nx = e.redMul(f);\n // Y3 = G * H\n var ny = g.redMul(h);\n // T3 = E * H\n var nt = e.redMul(h);\n // Z3 = F * G\n var nz = f.redMul(g);\n return this.curve.point(nx, ny, nz, nt);\n};\n\nPoint.prototype._projAdd = function _projAdd(p) {\n // hyperelliptic.org/EFD/g1p/auto-twisted-projective.html\n // #addition-add-2008-bbjlp\n // #addition-add-2007-bl\n // 10M + 1S\n\n // A = Z1 * Z2\n var a = this.z.redMul(p.z);\n // B = A^2\n var b = a.redSqr();\n // C = X1 * X2\n var c = this.x.redMul(p.x);\n // D = Y1 * Y2\n var d = this.y.redMul(p.y);\n // E = d * C * D\n var e = this.curve.d.redMul(c).redMul(d);\n // F = B - E\n var f = b.redSub(e);\n // G = B + E\n var g = b.redAdd(e);\n // X3 = A * F * ((X1 + Y1) * (X2 + Y2) - C - D)\n var tmp = this.x.redAdd(this.y).redMul(p.x.redAdd(p.y)).redISub(c).redISub(d);\n var nx = a.redMul(f).redMul(tmp);\n var ny;\n var nz;\n if (this.curve.twisted) {\n // Y3 = A * G * (D - a * C)\n ny = a.redMul(g).redMul(d.redSub(this.curve._mulA(c)));\n // Z3 = F * G\n nz = f.redMul(g);\n } else {\n // Y3 = A * G * (D - C)\n ny = a.redMul(g).redMul(d.redSub(c));\n // Z3 = c * F * G\n nz = this.curve._mulC(f).redMul(g);\n }\n return this.curve.point(nx, ny, nz);\n};\n\nPoint.prototype.add = function add(p) {\n if (this.isInfinity())\n return p;\n if (p.isInfinity())\n return this;\n\n if (this.curve.extended)\n return this._extAdd(p);\n else\n return this._projAdd(p);\n};\n\nPoint.prototype.mul = function mul(k) {\n if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, false);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p, k2) {\n return this.curve._wnafMulAdd(1, [ this, p ], [ k1, k2 ], 2, true);\n};\n\nPoint.prototype.normalize = function normalize() {\n if (this.zOne)\n return this;\n\n // Normalize coordinates\n var zi = this.z.redInvm();\n this.x = this.x.redMul(zi);\n this.y = this.y.redMul(zi);\n if (this.t)\n this.t = this.t.redMul(zi);\n this.z = this.curve.one;\n this.zOne = true;\n return this;\n};\n\nPoint.prototype.neg = function neg() {\n return this.curve.point(this.x.redNeg(),\n this.y,\n this.z,\n this.t && this.t.redNeg());\n};\n\nPoint.prototype.getX = function getX() {\n this.normalize();\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n this.normalize();\n return this.y.fromRed();\n};\n\nPoint.prototype.eq = function eq(other) {\n return this === other ||\n this.getX().cmp(other.getX()) === 0 &&\n this.getY().cmp(other.getY()) === 0;\n};\n\nPoint.prototype.eqXToP = function eqXToP(x) {\n var rx = x.toRed(this.curve.red).redMul(this.z);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(this.z);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\n// Compatibility with BaseCurve\nPoint.prototype.toP = Point.prototype.normalize;\nPoint.prototype.mixedAdd = Point.prototype.add;\n","'use strict';\n\nvar curve = exports;\n\ncurve.base = require('./base');\ncurve.short = require('./short');\ncurve.mont = require('./mont');\ncurve.edwards = require('./edwards');\n","'use strict';\n\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar utils = require('../utils');\n\nfunction MontCurve(conf) {\n Base.call(this, 'mont', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.i4 = new BN(4).toRed(this.red).redInvm();\n this.two = new BN(2).toRed(this.red);\n this.a24 = this.i4.redMul(this.a.redAdd(this.two));\n}\ninherits(MontCurve, Base);\nmodule.exports = MontCurve;\n\nMontCurve.prototype.validate = function validate(point) {\n var x = point.normalize().x;\n var x2 = x.redSqr();\n var rhs = x2.redMul(x).redAdd(x2.redMul(this.a)).redAdd(x);\n var y = rhs.redSqrt();\n\n return y.redSqr().cmp(rhs) === 0;\n};\n\nfunction Point(curve, x, z) {\n Base.BasePoint.call(this, curve, 'projective');\n if (x === null && z === null) {\n this.x = this.curve.one;\n this.z = this.curve.zero;\n } else {\n this.x = new BN(x, 16);\n this.z = new BN(z, 16);\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n }\n}\ninherits(Point, Base.BasePoint);\n\nMontCurve.prototype.decodePoint = function decodePoint(bytes, enc) {\n return this.point(utils.toArray(bytes, enc), 1);\n};\n\nMontCurve.prototype.point = function point(x, z) {\n return new Point(this, x, z);\n};\n\nMontCurve.prototype.pointFromJSON = function pointFromJSON(obj) {\n return Point.fromJSON(this, obj);\n};\n\nPoint.prototype.precompute = function precompute() {\n // No-op\n};\n\nPoint.prototype._encode = function _encode() {\n return this.getX().toArray('be', this.curve.p.byteLength());\n};\n\nPoint.fromJSON = function fromJSON(curve, obj) {\n return new Point(curve, obj[0], obj[1] || curve.one);\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n\nPoint.prototype.dbl = function dbl() {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#doubling-dbl-1987-m-3\n // 2M + 2S + 4A\n\n // A = X1 + Z1\n var a = this.x.redAdd(this.z);\n // AA = A^2\n var aa = a.redSqr();\n // B = X1 - Z1\n var b = this.x.redSub(this.z);\n // BB = B^2\n var bb = b.redSqr();\n // C = AA - BB\n var c = aa.redSub(bb);\n // X3 = AA * BB\n var nx = aa.redMul(bb);\n // Z3 = C * (BB + A24 * C)\n var nz = c.redMul(bb.redAdd(this.curve.a24.redMul(c)));\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.add = function add() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.diffAdd = function diffAdd(p, diff) {\n // http://hyperelliptic.org/EFD/g1p/auto-montgom-xz.html#diffadd-dadd-1987-m-3\n // 4M + 2S + 6A\n\n // A = X2 + Z2\n var a = this.x.redAdd(this.z);\n // B = X2 - Z2\n var b = this.x.redSub(this.z);\n // C = X3 + Z3\n var c = p.x.redAdd(p.z);\n // D = X3 - Z3\n var d = p.x.redSub(p.z);\n // DA = D * A\n var da = d.redMul(a);\n // CB = C * B\n var cb = c.redMul(b);\n // X5 = Z1 * (DA + CB)^2\n var nx = diff.z.redMul(da.redAdd(cb).redSqr());\n // Z5 = X1 * (DA - CB)^2\n var nz = diff.x.redMul(da.redISub(cb).redSqr());\n return this.curve.point(nx, nz);\n};\n\nPoint.prototype.mul = function mul(k) {\n var t = k.clone();\n var a = this; // (N / 2) * Q + Q\n var b = this.curve.point(null, null); // (N / 2) * Q\n var c = this; // Q\n\n for (var bits = []; t.cmpn(0) !== 0; t.iushrn(1))\n bits.push(t.andln(1));\n\n for (var i = bits.length - 1; i >= 0; i--) {\n if (bits[i] === 0) {\n // N * Q + Q = ((N / 2) * Q + Q)) + (N / 2) * Q\n a = a.diffAdd(b, c);\n // N * Q = 2 * ((N / 2) * Q + Q))\n b = b.dbl();\n } else {\n // N * Q = ((N / 2) * Q + Q) + ((N / 2) * Q)\n b = a.diffAdd(b, c);\n // N * Q + Q = 2 * ((N / 2) * Q + Q)\n a = a.dbl();\n }\n }\n return b;\n};\n\nPoint.prototype.mulAdd = function mulAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.jumlAdd = function jumlAdd() {\n throw new Error('Not supported on Montgomery curve');\n};\n\nPoint.prototype.eq = function eq(other) {\n return this.getX().cmp(other.getX()) === 0;\n};\n\nPoint.prototype.normalize = function normalize() {\n this.x = this.x.redMul(this.z.redInvm());\n this.z = this.curve.one;\n return this;\n};\n\nPoint.prototype.getX = function getX() {\n // Normalize coordinates\n this.normalize();\n\n return this.x.fromRed();\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar BN = require('bn.js');\nvar inherits = require('inherits');\nvar Base = require('./base');\n\nvar assert = utils.assert;\n\nfunction ShortCurve(conf) {\n Base.call(this, 'short', conf);\n\n this.a = new BN(conf.a, 16).toRed(this.red);\n this.b = new BN(conf.b, 16).toRed(this.red);\n this.tinv = this.two.redInvm();\n\n this.zeroA = this.a.fromRed().cmpn(0) === 0;\n this.threeA = this.a.fromRed().sub(this.p).cmpn(-3) === 0;\n\n // If the curve is endomorphic, precalculate beta and lambda\n this.endo = this._getEndomorphism(conf);\n this._endoWnafT1 = new Array(4);\n this._endoWnafT2 = new Array(4);\n}\ninherits(ShortCurve, Base);\nmodule.exports = ShortCurve;\n\nShortCurve.prototype._getEndomorphism = function _getEndomorphism(conf) {\n // No efficient endomorphism\n if (!this.zeroA || !this.g || !this.n || this.p.modn(3) !== 1)\n return;\n\n // Compute beta and lambda, that lambda * P = (beta * Px; Py)\n var beta;\n var lambda;\n if (conf.beta) {\n beta = new BN(conf.beta, 16).toRed(this.red);\n } else {\n var betas = this._getEndoRoots(this.p);\n // Choose the smallest beta\n beta = betas[0].cmp(betas[1]) < 0 ? betas[0] : betas[1];\n beta = beta.toRed(this.red);\n }\n if (conf.lambda) {\n lambda = new BN(conf.lambda, 16);\n } else {\n // Choose the lambda that is matching selected beta\n var lambdas = this._getEndoRoots(this.n);\n if (this.g.mul(lambdas[0]).x.cmp(this.g.x.redMul(beta)) === 0) {\n lambda = lambdas[0];\n } else {\n lambda = lambdas[1];\n assert(this.g.mul(lambda).x.cmp(this.g.x.redMul(beta)) === 0);\n }\n }\n\n // Get basis vectors, used for balanced length-two representation\n var basis;\n if (conf.basis) {\n basis = conf.basis.map(function(vec) {\n return {\n a: new BN(vec.a, 16),\n b: new BN(vec.b, 16),\n };\n });\n } else {\n basis = this._getEndoBasis(lambda);\n }\n\n return {\n beta: beta,\n lambda: lambda,\n basis: basis,\n };\n};\n\nShortCurve.prototype._getEndoRoots = function _getEndoRoots(num) {\n // Find roots of for x^2 + x + 1 in F\n // Root = (-1 +- Sqrt(-3)) / 2\n //\n var red = num === this.p ? this.red : BN.mont(num);\n var tinv = new BN(2).toRed(red).redInvm();\n var ntinv = tinv.redNeg();\n\n var s = new BN(3).toRed(red).redNeg().redSqrt().redMul(tinv);\n\n var l1 = ntinv.redAdd(s).fromRed();\n var l2 = ntinv.redSub(s).fromRed();\n return [ l1, l2 ];\n};\n\nShortCurve.prototype._getEndoBasis = function _getEndoBasis(lambda) {\n // aprxSqrt >= sqrt(this.n)\n var aprxSqrt = this.n.ushrn(Math.floor(this.n.bitLength() / 2));\n\n // 3.74\n // Run EGCD, until r(L + 1) < aprxSqrt\n var u = lambda;\n var v = this.n.clone();\n var x1 = new BN(1);\n var y1 = new BN(0);\n var x2 = new BN(0);\n var y2 = new BN(1);\n\n // NOTE: all vectors are roots of: a + b * lambda = 0 (mod n)\n var a0;\n var b0;\n // First vector\n var a1;\n var b1;\n // Second vector\n var a2;\n var b2;\n\n var prevR;\n var i = 0;\n var r;\n var x;\n while (u.cmpn(0) !== 0) {\n var q = v.div(u);\n r = v.sub(q.mul(u));\n x = x2.sub(q.mul(x1));\n var y = y2.sub(q.mul(y1));\n\n if (!a1 && r.cmp(aprxSqrt) < 0) {\n a0 = prevR.neg();\n b0 = x1;\n a1 = r.neg();\n b1 = x;\n } else if (a1 && ++i === 2) {\n break;\n }\n prevR = r;\n\n v = u;\n u = r;\n x2 = x1;\n x1 = x;\n y2 = y1;\n y1 = y;\n }\n a2 = r.neg();\n b2 = x;\n\n var len1 = a1.sqr().add(b1.sqr());\n var len2 = a2.sqr().add(b2.sqr());\n if (len2.cmp(len1) >= 0) {\n a2 = a0;\n b2 = b0;\n }\n\n // Normalize signs\n if (a1.negative) {\n a1 = a1.neg();\n b1 = b1.neg();\n }\n if (a2.negative) {\n a2 = a2.neg();\n b2 = b2.neg();\n }\n\n return [\n { a: a1, b: b1 },\n { a: a2, b: b2 },\n ];\n};\n\nShortCurve.prototype._endoSplit = function _endoSplit(k) {\n var basis = this.endo.basis;\n var v1 = basis[0];\n var v2 = basis[1];\n\n var c1 = v2.b.mul(k).divRound(this.n);\n var c2 = v1.b.neg().mul(k).divRound(this.n);\n\n var p1 = c1.mul(v1.a);\n var p2 = c2.mul(v2.a);\n var q1 = c1.mul(v1.b);\n var q2 = c2.mul(v2.b);\n\n // Calculate answer\n var k1 = k.sub(p1).sub(p2);\n var k2 = q1.add(q2).neg();\n return { k1: k1, k2: k2 };\n};\n\nShortCurve.prototype.pointFromX = function pointFromX(x, odd) {\n x = new BN(x, 16);\n if (!x.red)\n x = x.toRed(this.red);\n\n var y2 = x.redSqr().redMul(x).redIAdd(x.redMul(this.a)).redIAdd(this.b);\n var y = y2.redSqrt();\n if (y.redSqr().redSub(y2).cmp(this.zero) !== 0)\n throw new Error('invalid point');\n\n // XXX Is there any way to tell if the number is odd without converting it\n // to non-red form?\n var isOdd = y.fromRed().isOdd();\n if (odd && !isOdd || !odd && isOdd)\n y = y.redNeg();\n\n return this.point(x, y);\n};\n\nShortCurve.prototype.validate = function validate(point) {\n if (point.inf)\n return true;\n\n var x = point.x;\n var y = point.y;\n\n var ax = this.a.redMul(x);\n var rhs = x.redSqr().redMul(x).redIAdd(ax).redIAdd(this.b);\n return y.redSqr().redISub(rhs).cmpn(0) === 0;\n};\n\nShortCurve.prototype._endoWnafMulAdd =\n function _endoWnafMulAdd(points, coeffs, jacobianResult) {\n var npoints = this._endoWnafT1;\n var ncoeffs = this._endoWnafT2;\n for (var i = 0; i < points.length; i++) {\n var split = this._endoSplit(coeffs[i]);\n var p = points[i];\n var beta = p._getBeta();\n\n if (split.k1.negative) {\n split.k1.ineg();\n p = p.neg(true);\n }\n if (split.k2.negative) {\n split.k2.ineg();\n beta = beta.neg(true);\n }\n\n npoints[i * 2] = p;\n npoints[i * 2 + 1] = beta;\n ncoeffs[i * 2] = split.k1;\n ncoeffs[i * 2 + 1] = split.k2;\n }\n var res = this._wnafMulAdd(1, npoints, ncoeffs, i * 2, jacobianResult);\n\n // Clean-up references to points and coefficients\n for (var j = 0; j < i * 2; j++) {\n npoints[j] = null;\n ncoeffs[j] = null;\n }\n return res;\n };\n\nfunction Point(curve, x, y, isRed) {\n Base.BasePoint.call(this, curve, 'affine');\n if (x === null && y === null) {\n this.x = null;\n this.y = null;\n this.inf = true;\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n // Force redgomery representation when loading from JSON\n if (isRed) {\n this.x.forceRed(this.curve.red);\n this.y.forceRed(this.curve.red);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n this.inf = false;\n }\n}\ninherits(Point, Base.BasePoint);\n\nShortCurve.prototype.point = function point(x, y, isRed) {\n return new Point(this, x, y, isRed);\n};\n\nShortCurve.prototype.pointFromJSON = function pointFromJSON(obj, red) {\n return Point.fromJSON(this, obj, red);\n};\n\nPoint.prototype._getBeta = function _getBeta() {\n if (!this.curve.endo)\n return;\n\n var pre = this.precomputed;\n if (pre && pre.beta)\n return pre.beta;\n\n var beta = this.curve.point(this.x.redMul(this.curve.endo.beta), this.y);\n if (pre) {\n var curve = this.curve;\n var endoMul = function(p) {\n return curve.point(p.x.redMul(curve.endo.beta), p.y);\n };\n pre.beta = beta;\n beta.precomputed = {\n beta: null,\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(endoMul),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(endoMul),\n },\n };\n }\n return beta;\n};\n\nPoint.prototype.toJSON = function toJSON() {\n if (!this.precomputed)\n return [ this.x, this.y ];\n\n return [ this.x, this.y, this.precomputed && {\n doubles: this.precomputed.doubles && {\n step: this.precomputed.doubles.step,\n points: this.precomputed.doubles.points.slice(1),\n },\n naf: this.precomputed.naf && {\n wnd: this.precomputed.naf.wnd,\n points: this.precomputed.naf.points.slice(1),\n },\n } ];\n};\n\nPoint.fromJSON = function fromJSON(curve, obj, red) {\n if (typeof obj === 'string')\n obj = JSON.parse(obj);\n var res = curve.point(obj[0], obj[1], red);\n if (!obj[2])\n return res;\n\n function obj2point(obj) {\n return curve.point(obj[0], obj[1], red);\n }\n\n var pre = obj[2];\n res.precomputed = {\n beta: null,\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: [ res ].concat(pre.doubles.points.map(obj2point)),\n },\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: [ res ].concat(pre.naf.points.map(obj2point)),\n },\n };\n return res;\n};\n\nPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nPoint.prototype.isInfinity = function isInfinity() {\n return this.inf;\n};\n\nPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.inf)\n return p;\n\n // P + O = P\n if (p.inf)\n return this;\n\n // P + P = 2P\n if (this.eq(p))\n return this.dbl();\n\n // P + (-P) = O\n if (this.neg().eq(p))\n return this.curve.point(null, null);\n\n // P + Q = O\n if (this.x.cmp(p.x) === 0)\n return this.curve.point(null, null);\n\n var c = this.y.redSub(p.y);\n if (c.cmpn(0) !== 0)\n c = c.redMul(this.x.redSub(p.x).redInvm());\n var nx = c.redSqr().redISub(this.x).redISub(p.x);\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.dbl = function dbl() {\n if (this.inf)\n return this;\n\n // 2P = O\n var ys1 = this.y.redAdd(this.y);\n if (ys1.cmpn(0) === 0)\n return this.curve.point(null, null);\n\n var a = this.curve.a;\n\n var x2 = this.x.redSqr();\n var dyinv = ys1.redInvm();\n var c = x2.redAdd(x2).redIAdd(x2).redIAdd(a).redMul(dyinv);\n\n var nx = c.redSqr().redISub(this.x.redAdd(this.x));\n var ny = c.redMul(this.x.redSub(nx)).redISub(this.y);\n return this.curve.point(nx, ny);\n};\n\nPoint.prototype.getX = function getX() {\n return this.x.fromRed();\n};\n\nPoint.prototype.getY = function getY() {\n return this.y.fromRed();\n};\n\nPoint.prototype.mul = function mul(k) {\n k = new BN(k, 16);\n if (this.isInfinity())\n return this;\n else if (this._hasDoubles(k))\n return this.curve._fixedNafMul(this, k);\n else if (this.curve.endo)\n return this.curve._endoWnafMulAdd([ this ], [ k ]);\n else\n return this.curve._wnafMul(this, k);\n};\n\nPoint.prototype.mulAdd = function mulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2);\n};\n\nPoint.prototype.jmulAdd = function jmulAdd(k1, p2, k2) {\n var points = [ this, p2 ];\n var coeffs = [ k1, k2 ];\n if (this.curve.endo)\n return this.curve._endoWnafMulAdd(points, coeffs, true);\n else\n return this.curve._wnafMulAdd(1, points, coeffs, 2, true);\n};\n\nPoint.prototype.eq = function eq(p) {\n return this === p ||\n this.inf === p.inf &&\n (this.inf || this.x.cmp(p.x) === 0 && this.y.cmp(p.y) === 0);\n};\n\nPoint.prototype.neg = function neg(_precompute) {\n if (this.inf)\n return this;\n\n var res = this.curve.point(this.x, this.y.redNeg());\n if (_precompute && this.precomputed) {\n var pre = this.precomputed;\n var negate = function(p) {\n return p.neg();\n };\n res.precomputed = {\n naf: pre.naf && {\n wnd: pre.naf.wnd,\n points: pre.naf.points.map(negate),\n },\n doubles: pre.doubles && {\n step: pre.doubles.step,\n points: pre.doubles.points.map(negate),\n },\n };\n }\n return res;\n};\n\nPoint.prototype.toJ = function toJ() {\n if (this.inf)\n return this.curve.jpoint(null, null, null);\n\n var res = this.curve.jpoint(this.x, this.y, this.curve.one);\n return res;\n};\n\nfunction JPoint(curve, x, y, z) {\n Base.BasePoint.call(this, curve, 'jacobian');\n if (x === null && y === null && z === null) {\n this.x = this.curve.one;\n this.y = this.curve.one;\n this.z = new BN(0);\n } else {\n this.x = new BN(x, 16);\n this.y = new BN(y, 16);\n this.z = new BN(z, 16);\n }\n if (!this.x.red)\n this.x = this.x.toRed(this.curve.red);\n if (!this.y.red)\n this.y = this.y.toRed(this.curve.red);\n if (!this.z.red)\n this.z = this.z.toRed(this.curve.red);\n\n this.zOne = this.z === this.curve.one;\n}\ninherits(JPoint, Base.BasePoint);\n\nShortCurve.prototype.jpoint = function jpoint(x, y, z) {\n return new JPoint(this, x, y, z);\n};\n\nJPoint.prototype.toP = function toP() {\n if (this.isInfinity())\n return this.curve.point(null, null);\n\n var zinv = this.z.redInvm();\n var zinv2 = zinv.redSqr();\n var ax = this.x.redMul(zinv2);\n var ay = this.y.redMul(zinv2).redMul(zinv);\n\n return this.curve.point(ax, ay);\n};\n\nJPoint.prototype.neg = function neg() {\n return this.curve.jpoint(this.x, this.y.redNeg(), this.z);\n};\n\nJPoint.prototype.add = function add(p) {\n // O + P = P\n if (this.isInfinity())\n return p;\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 12M + 4S + 7A\n var pz2 = p.z.redSqr();\n var z2 = this.z.redSqr();\n var u1 = this.x.redMul(pz2);\n var u2 = p.x.redMul(z2);\n var s1 = this.y.redMul(pz2.redMul(p.z));\n var s2 = p.y.redMul(z2.redMul(this.z));\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(p.z).redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mixedAdd = function mixedAdd(p) {\n // O + P = P\n if (this.isInfinity())\n return p.toJ();\n\n // P + O = P\n if (p.isInfinity())\n return this;\n\n // 8M + 3S + 7A\n var z2 = this.z.redSqr();\n var u1 = this.x;\n var u2 = p.x.redMul(z2);\n var s1 = this.y;\n var s2 = p.y.redMul(z2).redMul(this.z);\n\n var h = u1.redSub(u2);\n var r = s1.redSub(s2);\n if (h.cmpn(0) === 0) {\n if (r.cmpn(0) !== 0)\n return this.curve.jpoint(null, null, null);\n else\n return this.dbl();\n }\n\n var h2 = h.redSqr();\n var h3 = h2.redMul(h);\n var v = u1.redMul(h2);\n\n var nx = r.redSqr().redIAdd(h3).redISub(v).redISub(v);\n var ny = r.redMul(v.redISub(nx)).redISub(s1.redMul(h3));\n var nz = this.z.redMul(h);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.dblp = function dblp(pow) {\n if (pow === 0)\n return this;\n if (this.isInfinity())\n return this;\n if (!pow)\n return this.dbl();\n\n var i;\n if (this.curve.zeroA || this.curve.threeA) {\n var r = this;\n for (i = 0; i < pow; i++)\n r = r.dbl();\n return r;\n }\n\n // 1M + 2S + 1A + N * (4S + 5M + 8A)\n // N = 1 => 6M + 6S + 9A\n var a = this.curve.a;\n var tinv = this.curve.tinv;\n\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n // Reuse results\n var jyd = jy.redAdd(jy);\n for (i = 0; i < pow; i++) {\n var jx2 = jx.redSqr();\n var jyd2 = jyd.redSqr();\n var jyd4 = jyd2.redSqr();\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var t1 = jx.redMul(jyd2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n var dny = c.redMul(t2);\n dny = dny.redIAdd(dny).redISub(jyd4);\n var nz = jyd.redMul(jz);\n if (i + 1 < pow)\n jz4 = jz4.redMul(jyd4);\n\n jx = nx;\n jz = nz;\n jyd = dny;\n }\n\n return this.curve.jpoint(jx, jyd.redMul(tinv), jz);\n};\n\nJPoint.prototype.dbl = function dbl() {\n if (this.isInfinity())\n return this;\n\n if (this.curve.zeroA)\n return this._zeroDbl();\n else if (this.curve.threeA)\n return this._threeDbl();\n else\n return this._dbl();\n};\n\nJPoint.prototype._zeroDbl = function _zeroDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 14A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // T = M ^ 2 - 2*S\n var t = m.redSqr().redISub(s).redISub(s);\n\n // 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2*Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html\n // #doubling-dbl-2009-l\n // 2M + 5S + 13A\n\n // A = X1^2\n var a = this.x.redSqr();\n // B = Y1^2\n var b = this.y.redSqr();\n // C = B^2\n var c = b.redSqr();\n // D = 2 * ((X1 + B)^2 - A - C)\n var d = this.x.redAdd(b).redSqr().redISub(a).redISub(c);\n d = d.redIAdd(d);\n // E = 3 * A\n var e = a.redAdd(a).redIAdd(a);\n // F = E^2\n var f = e.redSqr();\n\n // 8 * C\n var c8 = c.redIAdd(c);\n c8 = c8.redIAdd(c8);\n c8 = c8.redIAdd(c8);\n\n // X3 = F - 2 * D\n nx = f.redISub(d).redISub(d);\n // Y3 = E * (D - X3) - 8 * C\n ny = e.redMul(d.redISub(nx)).redISub(c8);\n // Z3 = 2 * Y1 * Z1\n nz = this.y.redMul(this.z);\n nz = nz.redIAdd(nz);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._threeDbl = function _threeDbl() {\n var nx;\n var ny;\n var nz;\n // Z = 1\n if (this.zOne) {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html\n // #doubling-mdbl-2007-bl\n // 1M + 5S + 15A\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // S = 2 * ((X1 + YY)^2 - XX - YYYY)\n var s = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n s = s.redIAdd(s);\n // M = 3 * XX + a\n var m = xx.redAdd(xx).redIAdd(xx).redIAdd(this.curve.a);\n // T = M^2 - 2 * S\n var t = m.redSqr().redISub(s).redISub(s);\n // X3 = T\n nx = t;\n // Y3 = M * (S - T) - 8 * YYYY\n var yyyy8 = yyyy.redIAdd(yyyy);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n yyyy8 = yyyy8.redIAdd(yyyy8);\n ny = m.redMul(s.redISub(t)).redISub(yyyy8);\n // Z3 = 2 * Y1\n nz = this.y.redAdd(this.y);\n } else {\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-3.html#doubling-dbl-2001-b\n // 3M + 5S\n\n // delta = Z1^2\n var delta = this.z.redSqr();\n // gamma = Y1^2\n var gamma = this.y.redSqr();\n // beta = X1 * gamma\n var beta = this.x.redMul(gamma);\n // alpha = 3 * (X1 - delta) * (X1 + delta)\n var alpha = this.x.redSub(delta).redMul(this.x.redAdd(delta));\n alpha = alpha.redAdd(alpha).redIAdd(alpha);\n // X3 = alpha^2 - 8 * beta\n var beta4 = beta.redIAdd(beta);\n beta4 = beta4.redIAdd(beta4);\n var beta8 = beta4.redAdd(beta4);\n nx = alpha.redSqr().redISub(beta8);\n // Z3 = (Y1 + Z1)^2 - gamma - delta\n nz = this.y.redAdd(this.z).redSqr().redISub(gamma).redISub(delta);\n // Y3 = alpha * (4 * beta - X3) - 8 * gamma^2\n var ggamma8 = gamma.redSqr();\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ggamma8 = ggamma8.redIAdd(ggamma8);\n ny = alpha.redMul(beta4.redISub(nx)).redISub(ggamma8);\n }\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype._dbl = function _dbl() {\n var a = this.curve.a;\n\n // 4M + 6S + 10A\n var jx = this.x;\n var jy = this.y;\n var jz = this.z;\n var jz4 = jz.redSqr().redSqr();\n\n var jx2 = jx.redSqr();\n var jy2 = jy.redSqr();\n\n var c = jx2.redAdd(jx2).redIAdd(jx2).redIAdd(a.redMul(jz4));\n\n var jxd4 = jx.redAdd(jx);\n jxd4 = jxd4.redIAdd(jxd4);\n var t1 = jxd4.redMul(jy2);\n var nx = c.redSqr().redISub(t1.redAdd(t1));\n var t2 = t1.redISub(nx);\n\n var jyd8 = jy2.redSqr();\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n jyd8 = jyd8.redIAdd(jyd8);\n var ny = c.redMul(t2).redISub(jyd8);\n var nz = jy.redAdd(jy).redMul(jz);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.trpl = function trpl() {\n if (!this.curve.zeroA)\n return this.dbl().add(this);\n\n // hyperelliptic.org/EFD/g1p/auto-shortw-jacobian-0.html#tripling-tpl-2007-bl\n // 5M + 10S + ...\n\n // XX = X1^2\n var xx = this.x.redSqr();\n // YY = Y1^2\n var yy = this.y.redSqr();\n // ZZ = Z1^2\n var zz = this.z.redSqr();\n // YYYY = YY^2\n var yyyy = yy.redSqr();\n // M = 3 * XX + a * ZZ2; a = 0\n var m = xx.redAdd(xx).redIAdd(xx);\n // MM = M^2\n var mm = m.redSqr();\n // E = 6 * ((X1 + YY)^2 - XX - YYYY) - MM\n var e = this.x.redAdd(yy).redSqr().redISub(xx).redISub(yyyy);\n e = e.redIAdd(e);\n e = e.redAdd(e).redIAdd(e);\n e = e.redISub(mm);\n // EE = E^2\n var ee = e.redSqr();\n // T = 16*YYYY\n var t = yyyy.redIAdd(yyyy);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n t = t.redIAdd(t);\n // U = (M + E)^2 - MM - EE - T\n var u = m.redIAdd(e).redSqr().redISub(mm).redISub(ee).redISub(t);\n // X3 = 4 * (X1 * EE - 4 * YY * U)\n var yyu4 = yy.redMul(u);\n yyu4 = yyu4.redIAdd(yyu4);\n yyu4 = yyu4.redIAdd(yyu4);\n var nx = this.x.redMul(ee).redISub(yyu4);\n nx = nx.redIAdd(nx);\n nx = nx.redIAdd(nx);\n // Y3 = 8 * Y1 * (U * (T - U) - E * EE)\n var ny = this.y.redMul(u.redMul(t.redISub(u)).redISub(e.redMul(ee)));\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n ny = ny.redIAdd(ny);\n // Z3 = (Z1 + E)^2 - ZZ - EE\n var nz = this.z.redAdd(e).redSqr().redISub(zz).redISub(ee);\n\n return this.curve.jpoint(nx, ny, nz);\n};\n\nJPoint.prototype.mul = function mul(k, kbase) {\n k = new BN(k, kbase);\n\n return this.curve._wnafMul(this, k);\n};\n\nJPoint.prototype.eq = function eq(p) {\n if (p.type === 'affine')\n return this.eq(p.toJ());\n\n if (this === p)\n return true;\n\n // x1 * z2^2 == x2 * z1^2\n var z2 = this.z.redSqr();\n var pz2 = p.z.redSqr();\n if (this.x.redMul(pz2).redISub(p.x.redMul(z2)).cmpn(0) !== 0)\n return false;\n\n // y1 * z2^3 == y2 * z1^3\n var z3 = z2.redMul(this.z);\n var pz3 = pz2.redMul(p.z);\n return this.y.redMul(pz3).redISub(p.y.redMul(z3)).cmpn(0) === 0;\n};\n\nJPoint.prototype.eqXToP = function eqXToP(x) {\n var zs = this.z.redSqr();\n var rx = x.toRed(this.curve.red).redMul(zs);\n if (this.x.cmp(rx) === 0)\n return true;\n\n var xc = x.clone();\n var t = this.curve.redN.redMul(zs);\n for (;;) {\n xc.iadd(this.curve.n);\n if (xc.cmp(this.curve.p) >= 0)\n return false;\n\n rx.redIAdd(t);\n if (this.x.cmp(rx) === 0)\n return true;\n }\n};\n\nJPoint.prototype.inspect = function inspect() {\n if (this.isInfinity())\n return '';\n return '';\n};\n\nJPoint.prototype.isInfinity = function isInfinity() {\n // XXX This code assumes that zero is always zero in red\n return this.z.cmpn(0) === 0;\n};\n","'use strict';\n\nvar curves = exports;\n\nvar hash = require('hash.js');\nvar curve = require('./curve');\nvar utils = require('./utils');\n\nvar assert = utils.assert;\n\nfunction PresetCurve(options) {\n if (options.type === 'short')\n this.curve = new curve.short(options);\n else if (options.type === 'edwards')\n this.curve = new curve.edwards(options);\n else\n this.curve = new curve.mont(options);\n this.g = this.curve.g;\n this.n = this.curve.n;\n this.hash = options.hash;\n\n assert(this.g.validate(), 'Invalid curve');\n assert(this.g.mul(this.n).isInfinity(), 'Invalid curve, G*N != O');\n}\ncurves.PresetCurve = PresetCurve;\n\nfunction defineCurve(name, options) {\n Object.defineProperty(curves, name, {\n configurable: true,\n enumerable: true,\n get: function() {\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: [\n '188da80e b03090f6 7cbf20eb 43a18800 f4ff0afd 82ff1012',\n '07192b95 ffc8da78 631011ed 6b24cdd5 73f977a1 1e794811',\n ],\n});\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: [\n 'b70e0cbd 6bb4bf7f 321390b9 4a03c1d3 56c21122 343280d6 115c1d21',\n 'bd376388 b5f723fb 4c22dfe6 cd4375a0 5a074764 44d58199 85007e34',\n ],\n});\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: [\n '6b17d1f2 e12c4247 f8bce6e5 63a440f2 77037d81 2deb33a0 f4a13945 d898c296',\n '4fe342e2 fe1a7f9b 8ee7eb4a 7c0f9e16 2bce3357 6b315ece cbb64068 37bf51f5',\n ],\n});\n\ndefineCurve('p384', {\n type: 'short',\n prime: null,\n p: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 ffffffff',\n a: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'fffffffe ffffffff 00000000 00000000 fffffffc',\n b: 'b3312fa7 e23ee7e4 988e056b e3f82d19 181d9c6e fe814112 0314088f ' +\n '5013875a c656398d 8a2ed19d 2a85c8ed d3ec2aef',\n n: 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff c7634d81 ' +\n 'f4372ddf 581a0db2 48b0a77a ecec196a ccc52973',\n hash: hash.sha384,\n gRed: false,\n g: [\n 'aa87ca22 be8b0537 8eb1c71e f320ad74 6e1d3b62 8ba79b98 59f741e0 82542a38 ' +\n '5502f25d bf55296c 3a545e38 72760ab7',\n '3617de4a 96262c6f 5d9e98bf 9292dc29 f8f41dbd 289a147c e9da3113 b5f0b8c0 ' +\n '0a60b1ce 1d7e819d 7a431d7c 90ea0e5f',\n ],\n});\n\ndefineCurve('p521', {\n type: 'short',\n prime: null,\n p: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff',\n a: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff ffffffff ffffffff fffffffc',\n b: '00000051 953eb961 8e1c9a1f 929a21a0 b68540ee a2da725b ' +\n '99b315f3 b8b48991 8ef109e1 56193951 ec7e937b 1652c0bd ' +\n '3bb1bf07 3573df88 3d2c34f1 ef451fd4 6b503f00',\n n: '000001ff ffffffff ffffffff ffffffff ffffffff ffffffff ' +\n 'ffffffff ffffffff fffffffa 51868783 bf2f966b 7fcc0148 ' +\n 'f709a5d0 3bb5c9b8 899c47ae bb6fb71e 91386409',\n hash: hash.sha512,\n gRed: false,\n g: [\n '000000c6 858e06b7 0404e9cd 9e3ecb66 2395b442 9c648139 ' +\n '053fb521 f828af60 6b4d3dba a14b5e77 efe75928 fe1dc127 ' +\n 'a2ffa8de 3348b3c1 856a429b f97e7e31 c2e5bd66',\n '00000118 39296a78 9a3bc004 5c8a5fb4 2c7d1bd9 98f54449 ' +\n '579b4468 17afbd17 273e662c 97ee7299 5ef42640 c550b901 ' +\n '3fad0761 353c7086 a272c240 88be9476 9fd16650',\n ],\n});\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: [\n '9',\n ],\n});\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: [\n '216936d3cd6e53fec0a4e231fdd6dc5c692cc7609525a7b2c9562d608f25d51a',\n\n // 4/5\n '6666666666666666666666666666666666666666666666666666666666666658',\n ],\n});\n\nvar pre;\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\n // Precomputed endomorphism\n beta: '7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee',\n lambda: '5363ad4cc05c30e0a5261c028812645a122e22ea20816678df02967c1b23bd72',\n basis: [\n {\n a: '3086d221a7d46bcde86c90e49284eb15',\n b: '-e4437ed6010e88286f547fa90abfe4c3',\n },\n {\n a: '114ca50f7a8e2f3f657c1108d9d44cfd8',\n b: '3086d221a7d46bcde86c90e49284eb15',\n },\n ],\n\n gRed: false,\n g: [\n '79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798',\n '483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8',\n pre,\n ],\n});\n","'use strict';\n\nvar BN = require('bn.js');\nvar HmacDRBG = require('hmac-drbg');\nvar utils = require('../utils');\nvar curves = require('../curves');\nvar rand = require('brorand');\nvar assert = utils.assert;\n\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EC(options) {\n if (!(this instanceof EC))\n return new EC(options);\n\n // Shortcut `elliptic.ec(curve-name)`\n if (typeof options === 'string') {\n assert(Object.prototype.hasOwnProperty.call(curves, options),\n 'Unknown curve ' + options);\n\n options = curves[options];\n }\n\n // Shortcut for `elliptic.ec(elliptic.curves.curveName)`\n if (options instanceof curves.PresetCurve)\n options = { curve: options };\n\n this.curve = options.curve.curve;\n this.n = this.curve.n;\n this.nh = this.n.ushrn(1);\n this.g = this.curve.g;\n\n // Point on curve\n this.g = options.curve.g;\n this.g.precompute(options.curve.n.bitLength() + 1);\n\n // Hash for function for DRBG\n this.hash = options.hash || options.curve.hash;\n}\nmodule.exports = EC;\n\nEC.prototype.keyPair = function keyPair(options) {\n return new KeyPair(this, options);\n};\n\nEC.prototype.keyFromPrivate = function keyFromPrivate(priv, enc) {\n return KeyPair.fromPrivate(this, priv, enc);\n};\n\nEC.prototype.keyFromPublic = function keyFromPublic(pub, enc) {\n return KeyPair.fromPublic(this, pub, enc);\n};\n\nEC.prototype.genKeyPair = function genKeyPair(options) {\n if (!options)\n options = {};\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n entropy: options.entropy || rand(this.hash.hmacStrength),\n entropyEnc: options.entropy && options.entropyEnc || 'utf8',\n nonce: this.n.toArray(),\n });\n\n var bytes = this.n.byteLength();\n var ns2 = this.n.sub(new BN(2));\n for (;;) {\n var priv = new BN(drbg.generate(bytes));\n if (priv.cmp(ns2) > 0)\n continue;\n\n priv.iaddn(1);\n return this.keyFromPrivate(priv);\n }\n};\n\nEC.prototype._truncateToN = function _truncateToN(msg, truncOnly) {\n var delta = msg.byteLength() * 8 - this.n.bitLength();\n if (delta > 0)\n msg = msg.ushrn(delta);\n if (!truncOnly && msg.cmp(this.n) >= 0)\n return msg.sub(this.n);\n else\n return msg;\n};\n\nEC.prototype.sign = function sign(msg, key, enc, options) {\n if (typeof enc === 'object') {\n options = enc;\n enc = null;\n }\n if (!options)\n options = {};\n\n key = this.keyFromPrivate(key, enc);\n msg = this._truncateToN(new BN(msg, 16));\n\n // Zero-extend key to provide enough entropy\n var bytes = this.n.byteLength();\n var bkey = key.getPrivate().toArray('be', bytes);\n\n // Zero-extend nonce to have the same byte size as N\n var nonce = msg.toArray('be', bytes);\n\n // Instantiate Hmac_DRBG\n var drbg = new HmacDRBG({\n hash: this.hash,\n entropy: bkey,\n nonce: nonce,\n pers: options.pers,\n persEnc: options.persEnc || 'utf8',\n });\n\n // Number of bytes to generate\n var ns1 = this.n.sub(new BN(1));\n\n for (var iter = 0; ; iter++) {\n var k = options.k ?\n options.k(iter) :\n new BN(drbg.generate(this.n.byteLength()));\n k = this._truncateToN(k, true);\n if (k.cmpn(1) <= 0 || k.cmp(ns1) >= 0)\n continue;\n\n var kp = this.g.mul(k);\n if (kp.isInfinity())\n continue;\n\n var kpX = kp.getX();\n var r = kpX.umod(this.n);\n if (r.cmpn(0) === 0)\n continue;\n\n var s = k.invm(this.n).mul(r.mul(key.getPrivate()).iadd(msg));\n s = s.umod(this.n);\n if (s.cmpn(0) === 0)\n continue;\n\n var recoveryParam = (kp.getY().isOdd() ? 1 : 0) |\n (kpX.cmp(r) !== 0 ? 2 : 0);\n\n // Use complement of `s`, if it is > `n / 2`\n if (options.canonical && s.cmp(this.nh) > 0) {\n s = this.n.sub(s);\n recoveryParam ^= 1;\n }\n\n return new Signature({ r: r, s: s, recoveryParam: recoveryParam });\n }\n};\n\nEC.prototype.verify = function verify(msg, signature, key, enc) {\n msg = this._truncateToN(new BN(msg, 16));\n key = this.keyFromPublic(key, enc);\n signature = new Signature(signature, 'hex');\n\n // Perform primitive values validation\n var r = signature.r;\n var s = signature.s;\n if (r.cmpn(1) < 0 || r.cmp(this.n) >= 0)\n return false;\n if (s.cmpn(1) < 0 || s.cmp(this.n) >= 0)\n return false;\n\n // Validate signature\n var sinv = s.invm(this.n);\n var u1 = sinv.mul(msg).umod(this.n);\n var u2 = sinv.mul(r).umod(this.n);\n var p;\n\n if (!this.curve._maxwellTrick) {\n p = this.g.mulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n return p.getX().umod(this.n).cmp(r) === 0;\n }\n\n // NOTE: Greg Maxwell's trick, inspired by:\n // https://git.io/vad3K\n\n p = this.g.jmulAdd(u1, key.getPublic(), u2);\n if (p.isInfinity())\n return false;\n\n // Compare `p.x` of Jacobian point with `r`,\n // this will do `p.x == r * p.z^2` instead of multiplying `p.x` by the\n // inverse of `p.z^2`\n return p.eqXToP(r);\n};\n\nEC.prototype.recoverPubKey = function(msg, signature, j, enc) {\n assert((3 & j) === j, 'The recovery param is more than two bits');\n signature = new Signature(signature, enc);\n\n var n = this.n;\n var e = new BN(msg);\n var r = signature.r;\n var s = signature.s;\n\n // A set LSB signifies that the y-coordinate is odd\n var isYOdd = j & 1;\n var isSecondKey = j >> 1;\n if (r.cmp(this.curve.p.umod(this.curve.n)) >= 0 && isSecondKey)\n throw new Error('Unable to find sencond key candinate');\n\n // 1.1. Let x = r + jn.\n if (isSecondKey)\n r = this.curve.pointFromX(r.add(this.curve.n), isYOdd);\n else\n r = this.curve.pointFromX(r, isYOdd);\n\n var rInv = signature.r.invm(n);\n var s1 = n.sub(e).mul(rInv).umod(n);\n var s2 = s.mul(rInv).umod(n);\n\n // 1.6.1 Compute Q = r^-1 (sR - eG)\n // Q = r^-1 (sR + -eG)\n return this.g.mulAdd(s1, r, s2);\n};\n\nEC.prototype.getKeyRecoveryParam = function(e, signature, Q, enc) {\n signature = new Signature(signature, enc);\n if (signature.recoveryParam !== null)\n return signature.recoveryParam;\n\n for (var i = 0; i < 4; i++) {\n var Qprime;\n try {\n Qprime = this.recoverPubKey(e, signature, i);\n } catch (e) {\n continue;\n }\n\n if (Qprime.eq(Q))\n return i;\n }\n throw new Error('Unable to find valid recovery factor');\n};\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction KeyPair(ec, options) {\n this.ec = ec;\n this.priv = null;\n this.pub = null;\n\n // KeyPair(ec, { priv: ..., pub: ... })\n if (options.priv)\n this._importPrivate(options.priv, options.privEnc);\n if (options.pub)\n this._importPublic(options.pub, options.pubEnc);\n}\nmodule.exports = KeyPair;\n\nKeyPair.fromPublic = function fromPublic(ec, pub, enc) {\n if (pub instanceof KeyPair)\n return pub;\n\n return new KeyPair(ec, {\n pub: pub,\n pubEnc: enc,\n });\n};\n\nKeyPair.fromPrivate = function fromPrivate(ec, priv, enc) {\n if (priv instanceof KeyPair)\n return priv;\n\n return new KeyPair(ec, {\n priv: priv,\n privEnc: enc,\n });\n};\n\nKeyPair.prototype.validate = function validate() {\n var pub = this.getPublic();\n\n if (pub.isInfinity())\n return { result: false, reason: 'Invalid public key' };\n if (!pub.validate())\n return { result: false, reason: 'Public key is not a point' };\n if (!pub.mul(this.ec.curve.n).isInfinity())\n return { result: false, reason: 'Public key * N != O' };\n\n return { result: true, reason: null };\n};\n\nKeyPair.prototype.getPublic = function getPublic(compact, enc) {\n // compact is optional argument\n if (typeof compact === 'string') {\n enc = compact;\n compact = null;\n }\n\n if (!this.pub)\n this.pub = this.ec.g.mul(this.priv);\n\n if (!enc)\n return this.pub;\n\n return this.pub.encode(enc, compact);\n};\n\nKeyPair.prototype.getPrivate = function getPrivate(enc) {\n if (enc === 'hex')\n return this.priv.toString(16, 2);\n else\n return this.priv;\n};\n\nKeyPair.prototype._importPrivate = function _importPrivate(key, enc) {\n this.priv = new BN(key, enc || 16);\n\n // Ensure that the priv won't be bigger than n, otherwise we may fail\n // in fixed multiplication method\n this.priv = this.priv.umod(this.ec.curve.n);\n};\n\nKeyPair.prototype._importPublic = function _importPublic(key, enc) {\n if (key.x || key.y) {\n // Montgomery points only have an `x` coordinate.\n // Weierstrass/Edwards points on the other hand have both `x` and\n // `y` coordinates.\n if (this.ec.curve.type === 'mont') {\n assert(key.x, 'Need x coordinate');\n } else if (this.ec.curve.type === 'short' ||\n this.ec.curve.type === 'edwards') {\n assert(key.x && key.y, 'Need both x and y coordinate');\n }\n this.pub = this.ec.curve.point(key.x, key.y);\n return;\n }\n this.pub = this.ec.curve.decodePoint(key, enc);\n};\n\n// ECDH\nKeyPair.prototype.derive = function derive(pub) {\n if(!pub.validate()) {\n assert(pub.validate(), 'public point not validated');\n }\n return pub.mul(this.priv).getX();\n};\n\n// ECDSA\nKeyPair.prototype.sign = function sign(msg, enc, options) {\n return this.ec.sign(msg, this, enc, options);\n};\n\nKeyPair.prototype.verify = function verify(msg, signature) {\n return this.ec.verify(msg, signature, this);\n};\n\nKeyPair.prototype.inspect = function inspect() {\n return '';\n};\n","'use strict';\n\nvar BN = require('bn.js');\n\nvar utils = require('../utils');\nvar assert = utils.assert;\n\nfunction Signature(options, enc) {\n if (options instanceof Signature)\n return options;\n\n if (this._importDER(options, enc))\n return;\n\n assert(options.r && options.s, 'Signature without r or s');\n this.r = new BN(options.r, 16);\n this.s = new BN(options.s, 16);\n if (options.recoveryParam === undefined)\n this.recoveryParam = null;\n else\n this.recoveryParam = options.recoveryParam;\n}\nmodule.exports = Signature;\n\nfunction Position() {\n this.place = 0;\n}\n\nfunction getLength(buf, p) {\n var initial = buf[p.place++];\n if (!(initial & 0x80)) {\n return initial;\n }\n var octetLen = initial & 0xf;\n\n // Indefinite length or overflow\n if (octetLen === 0 || octetLen > 4) {\n return false;\n }\n\n var val = 0;\n for (var i = 0, off = p.place; i < octetLen; i++, off++) {\n val <<= 8;\n val |= buf[off];\n val >>>= 0;\n }\n\n // Leading zeroes\n if (val <= 0x7f) {\n return false;\n }\n\n p.place = off;\n return val;\n}\n\nfunction rmPadding(buf) {\n var i = 0;\n var len = buf.length - 1;\n while (!buf[i] && !(buf[i + 1] & 0x80) && i < len) {\n i++;\n }\n if (i === 0) {\n return buf;\n }\n return buf.slice(i);\n}\n\nSignature.prototype._importDER = function _importDER(data, enc) {\n data = utils.toArray(data, enc);\n var p = new Position();\n if (data[p.place++] !== 0x30) {\n return false;\n }\n var len = getLength(data, p);\n if (len === false) {\n return false;\n }\n if ((len + p.place) !== data.length) {\n return false;\n }\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var rlen = getLength(data, p);\n if (rlen === false) {\n return false;\n }\n var r = data.slice(p.place, rlen + p.place);\n p.place += rlen;\n if (data[p.place++] !== 0x02) {\n return false;\n }\n var slen = getLength(data, p);\n if (slen === false) {\n return false;\n }\n if (data.length !== slen + p.place) {\n return false;\n }\n var s = data.slice(p.place, slen + p.place);\n if (r[0] === 0) {\n if (r[1] & 0x80) {\n r = r.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n if (s[0] === 0) {\n if (s[1] & 0x80) {\n s = s.slice(1);\n } else {\n // Leading zeroes\n return false;\n }\n }\n\n this.r = new BN(r);\n this.s = new BN(s);\n this.recoveryParam = null;\n\n return true;\n};\n\nfunction constructLength(arr, len) {\n if (len < 0x80) {\n arr.push(len);\n return;\n }\n var octets = 1 + (Math.log(len) / Math.LN2 >>> 3);\n arr.push(octets | 0x80);\n while (--octets) {\n arr.push((len >>> (octets << 3)) & 0xff);\n }\n arr.push(len);\n}\n\nSignature.prototype.toDER = function toDER(enc) {\n var r = this.r.toArray();\n var s = this.s.toArray();\n\n // Pad values\n if (r[0] & 0x80)\n r = [ 0 ].concat(r);\n // Pad values\n if (s[0] & 0x80)\n s = [ 0 ].concat(s);\n\n r = rmPadding(r);\n s = rmPadding(s);\n\n while (!s[0] && !(s[1] & 0x80)) {\n s = s.slice(1);\n }\n var arr = [ 0x02 ];\n constructLength(arr, r.length);\n arr = arr.concat(r);\n arr.push(0x02);\n constructLength(arr, s.length);\n var backHalf = arr.concat(s);\n var res = [ 0x30 ];\n constructLength(res, backHalf.length);\n res = res.concat(backHalf);\n return utils.encode(res, enc);\n};\n","'use strict';\n\nvar hash = require('hash.js');\nvar curves = require('../curves');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar KeyPair = require('./key');\nvar Signature = require('./signature');\n\nfunction EDDSA(curve) {\n assert(curve === 'ed25519', 'only tested with ed25519 so far');\n\n if (!(this instanceof EDDSA))\n return new EDDSA(curve);\n\n curve = curves[curve].curve;\n this.curve = curve;\n this.g = curve.g;\n this.g.precompute(curve.n.bitLength() + 1);\n\n this.pointClass = curve.point().constructor;\n this.encodingLength = Math.ceil(curve.n.bitLength() / 8);\n this.hash = hash.sha512;\n}\n\nmodule.exports = EDDSA;\n\n/**\n* @param {Array|String} message - message bytes\n* @param {Array|String|KeyPair} secret - secret bytes or a keypair\n* @returns {Signature} - signature\n*/\nEDDSA.prototype.sign = function sign(message, secret) {\n message = parseBytes(message);\n var key = this.keyFromSecret(secret);\n var r = this.hashInt(key.messagePrefix(), message);\n var R = this.g.mul(r);\n var Rencoded = this.encodePoint(R);\n var s_ = this.hashInt(Rencoded, key.pubBytes(), message)\n .mul(key.priv());\n var S = r.add(s_).umod(this.curve.n);\n return this.makeSignature({ R: R, S: S, Rencoded: Rencoded });\n};\n\n/**\n* @param {Array} message - message bytes\n* @param {Array|String|Signature} sig - sig bytes\n* @param {Array|String|Point|KeyPair} pub - public key\n* @returns {Boolean} - true if public key matches sig of message\n*/\nEDDSA.prototype.verify = function verify(message, sig, pub) {\n message = parseBytes(message);\n sig = this.makeSignature(sig);\n var key = this.keyFromPublic(pub);\n var h = this.hashInt(sig.Rencoded(), key.pubBytes(), message);\n var SG = this.g.mul(sig.S());\n var RplusAh = sig.R().add(key.pub().mul(h));\n return RplusAh.eq(SG);\n};\n\nEDDSA.prototype.hashInt = function hashInt() {\n var hash = this.hash();\n for (var i = 0; i < arguments.length; i++)\n hash.update(arguments[i]);\n return utils.intFromLE(hash.digest()).umod(this.curve.n);\n};\n\nEDDSA.prototype.keyFromPublic = function keyFromPublic(pub) {\n return KeyPair.fromPublic(this, pub);\n};\n\nEDDSA.prototype.keyFromSecret = function keyFromSecret(secret) {\n return KeyPair.fromSecret(this, secret);\n};\n\nEDDSA.prototype.makeSignature = function makeSignature(sig) {\n if (sig instanceof Signature)\n return sig;\n return new Signature(this, sig);\n};\n\n/**\n* * https://tools.ietf.org/html/draft-josefsson-eddsa-ed25519-03#section-5.2\n*\n* EDDSA defines methods for encoding and decoding points and integers. These are\n* helper convenience methods, that pass along to utility functions implied\n* parameters.\n*\n*/\nEDDSA.prototype.encodePoint = function encodePoint(point) {\n var enc = point.getY().toArray('le', this.encodingLength);\n enc[this.encodingLength - 1] |= point.getX().isOdd() ? 0x80 : 0;\n return enc;\n};\n\nEDDSA.prototype.decodePoint = function decodePoint(bytes) {\n bytes = utils.parseBytes(bytes);\n\n var lastIx = bytes.length - 1;\n var normed = bytes.slice(0, lastIx).concat(bytes[lastIx] & ~0x80);\n var xIsOdd = (bytes[lastIx] & 0x80) !== 0;\n\n var y = utils.intFromLE(normed);\n return this.curve.pointFromY(y, xIsOdd);\n};\n\nEDDSA.prototype.encodeInt = function encodeInt(num) {\n return num.toArray('le', this.encodingLength);\n};\n\nEDDSA.prototype.decodeInt = function decodeInt(bytes) {\n return utils.intFromLE(bytes);\n};\n\nEDDSA.prototype.isPoint = function isPoint(val) {\n return val instanceof this.pointClass;\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar parseBytes = utils.parseBytes;\nvar cachedProperty = utils.cachedProperty;\n\n/**\n* @param {EDDSA} eddsa - instance\n* @param {Object} params - public/private key parameters\n*\n* @param {Array} [params.secret] - secret seed bytes\n* @param {Point} [params.pub] - public key point (aka `A` in eddsa terms)\n* @param {Array} [params.pub] - public key point encoded as bytes\n*\n*/\nfunction KeyPair(eddsa, params) {\n this.eddsa = eddsa;\n this._secret = parseBytes(params.secret);\n if (eddsa.isPoint(params.pub))\n this._pub = params.pub;\n else\n this._pubBytes = parseBytes(params.pub);\n}\n\nKeyPair.fromPublic = function fromPublic(eddsa, pub) {\n if (pub instanceof KeyPair)\n return pub;\n return new KeyPair(eddsa, { pub: pub });\n};\n\nKeyPair.fromSecret = function fromSecret(eddsa, secret) {\n if (secret instanceof KeyPair)\n return secret;\n return new KeyPair(eddsa, { secret: secret });\n};\n\nKeyPair.prototype.secret = function secret() {\n return this._secret;\n};\n\ncachedProperty(KeyPair, 'pubBytes', function pubBytes() {\n return this.eddsa.encodePoint(this.pub());\n});\n\ncachedProperty(KeyPair, 'pub', function pub() {\n if (this._pubBytes)\n return this.eddsa.decodePoint(this._pubBytes);\n return this.eddsa.g.mul(this.priv());\n});\n\ncachedProperty(KeyPair, 'privBytes', function privBytes() {\n var eddsa = this.eddsa;\n var hash = this.hash();\n var lastIx = eddsa.encodingLength - 1;\n\n var a = hash.slice(0, eddsa.encodingLength);\n a[0] &= 248;\n a[lastIx] &= 127;\n a[lastIx] |= 64;\n\n return a;\n});\n\ncachedProperty(KeyPair, 'priv', function priv() {\n return this.eddsa.decodeInt(this.privBytes());\n});\n\ncachedProperty(KeyPair, 'hash', function hash() {\n return this.eddsa.hash().update(this.secret()).digest();\n});\n\ncachedProperty(KeyPair, 'messagePrefix', function messagePrefix() {\n return this.hash().slice(this.eddsa.encodingLength);\n});\n\nKeyPair.prototype.sign = function sign(message) {\n assert(this._secret, 'KeyPair can only verify');\n return this.eddsa.sign(message, this);\n};\n\nKeyPair.prototype.verify = function verify(message, sig) {\n return this.eddsa.verify(message, sig, this);\n};\n\nKeyPair.prototype.getSecret = function getSecret(enc) {\n assert(this._secret, 'KeyPair is public only');\n return utils.encode(this.secret(), enc);\n};\n\nKeyPair.prototype.getPublic = function getPublic(enc) {\n return utils.encode(this.pubBytes(), enc);\n};\n\nmodule.exports = KeyPair;\n","'use strict';\n\nvar BN = require('bn.js');\nvar utils = require('../utils');\nvar assert = utils.assert;\nvar cachedProperty = utils.cachedProperty;\nvar parseBytes = utils.parseBytes;\n\n/**\n* @param {EDDSA} eddsa - eddsa instance\n* @param {Array|Object} sig -\n* @param {Array|Point} [sig.R] - R point as Point or bytes\n* @param {Array|bn} [sig.S] - S scalar as bn or bytes\n* @param {Array} [sig.Rencoded] - R point encoded\n* @param {Array} [sig.Sencoded] - S scalar encoded\n*/\nfunction Signature(eddsa, sig) {\n this.eddsa = eddsa;\n\n if (typeof sig !== 'object')\n sig = parseBytes(sig);\n\n if (Array.isArray(sig)) {\n sig = {\n R: sig.slice(0, eddsa.encodingLength),\n S: sig.slice(eddsa.encodingLength),\n };\n }\n\n assert(sig.R && sig.S, 'Signature without R or S');\n\n if (eddsa.isPoint(sig.R))\n this._R = sig.R;\n if (sig.S instanceof BN)\n this._S = sig.S;\n\n this._Rencoded = Array.isArray(sig.R) ? sig.R : sig.Rencoded;\n this._Sencoded = Array.isArray(sig.S) ? sig.S : sig.Sencoded;\n}\n\ncachedProperty(Signature, 'S', function S() {\n return this.eddsa.decodeInt(this.Sencoded());\n});\n\ncachedProperty(Signature, 'R', function R() {\n return this.eddsa.decodePoint(this.Rencoded());\n});\n\ncachedProperty(Signature, 'Rencoded', function Rencoded() {\n return this.eddsa.encodePoint(this.R());\n});\n\ncachedProperty(Signature, 'Sencoded', function Sencoded() {\n return this.eddsa.encodeInt(this.S());\n});\n\nSignature.prototype.toBytes = function toBytes() {\n return this.Rencoded().concat(this.Sencoded());\n};\n\nSignature.prototype.toHex = function toHex() {\n return utils.encode(this.toBytes(), 'hex').toUpperCase();\n};\n\nmodule.exports = Signature;\n","module.exports = {\n doubles: {\n step: 4,\n points: [\n [\n 'e60fce93b59e9ec53011aabc21c23e97b2a31369b87a5ae9c44ee89e2a6dec0a',\n 'f7e3507399e595929db99f34f57937101296891e44d23f0be1f32cce69616821',\n ],\n [\n '8282263212c609d9ea2a6e3e172de238d8c39cabd5ac1ca10646e23fd5f51508',\n '11f8a8098557dfe45e8256e830b60ace62d613ac2f7b17bed31b6eaff6e26caf',\n ],\n [\n '175e159f728b865a72f99cc6c6fc846de0b93833fd2222ed73fce5b551e5b739',\n 'd3506e0d9e3c79eba4ef97a51ff71f5eacb5955add24345c6efa6ffee9fed695',\n ],\n [\n '363d90d447b00c9c99ceac05b6262ee053441c7e55552ffe526bad8f83ff4640',\n '4e273adfc732221953b445397f3363145b9a89008199ecb62003c7f3bee9de9',\n ],\n [\n '8b4b5f165df3c2be8c6244b5b745638843e4a781a15bcd1b69f79a55dffdf80c',\n '4aad0a6f68d308b4b3fbd7813ab0da04f9e336546162ee56b3eff0c65fd4fd36',\n ],\n [\n '723cbaa6e5db996d6bf771c00bd548c7b700dbffa6c0e77bcb6115925232fcda',\n '96e867b5595cc498a921137488824d6e2660a0653779494801dc069d9eb39f5f',\n ],\n [\n 'eebfa4d493bebf98ba5feec812c2d3b50947961237a919839a533eca0e7dd7fa',\n '5d9a8ca3970ef0f269ee7edaf178089d9ae4cdc3a711f712ddfd4fdae1de8999',\n ],\n [\n '100f44da696e71672791d0a09b7bde459f1215a29b3c03bfefd7835b39a48db0',\n 'cdd9e13192a00b772ec8f3300c090666b7ff4a18ff5195ac0fbd5cd62bc65a09',\n ],\n [\n 'e1031be262c7ed1b1dc9227a4a04c017a77f8d4464f3b3852c8acde6e534fd2d',\n '9d7061928940405e6bb6a4176597535af292dd419e1ced79a44f18f29456a00d',\n ],\n [\n 'feea6cae46d55b530ac2839f143bd7ec5cf8b266a41d6af52d5e688d9094696d',\n 'e57c6b6c97dce1bab06e4e12bf3ecd5c981c8957cc41442d3155debf18090088',\n ],\n [\n 'da67a91d91049cdcb367be4be6ffca3cfeed657d808583de33fa978bc1ec6cb1',\n '9bacaa35481642bc41f463f7ec9780e5dec7adc508f740a17e9ea8e27a68be1d',\n ],\n [\n '53904faa0b334cdda6e000935ef22151ec08d0f7bb11069f57545ccc1a37b7c0',\n '5bc087d0bc80106d88c9eccac20d3c1c13999981e14434699dcb096b022771c8',\n ],\n [\n '8e7bcd0bd35983a7719cca7764ca906779b53a043a9b8bcaeff959f43ad86047',\n '10b7770b2a3da4b3940310420ca9514579e88e2e47fd68b3ea10047e8460372a',\n ],\n [\n '385eed34c1cdff21e6d0818689b81bde71a7f4f18397e6690a841e1599c43862',\n '283bebc3e8ea23f56701de19e9ebf4576b304eec2086dc8cc0458fe5542e5453',\n ],\n [\n '6f9d9b803ecf191637c73a4413dfa180fddf84a5947fbc9c606ed86c3fac3a7',\n '7c80c68e603059ba69b8e2a30e45c4d47ea4dd2f5c281002d86890603a842160',\n ],\n [\n '3322d401243c4e2582a2147c104d6ecbf774d163db0f5e5313b7e0e742d0e6bd',\n '56e70797e9664ef5bfb019bc4ddaf9b72805f63ea2873af624f3a2e96c28b2a0',\n ],\n [\n '85672c7d2de0b7da2bd1770d89665868741b3f9af7643397721d74d28134ab83',\n '7c481b9b5b43b2eb6374049bfa62c2e5e77f17fcc5298f44c8e3094f790313a6',\n ],\n [\n '948bf809b1988a46b06c9f1919413b10f9226c60f668832ffd959af60c82a0a',\n '53a562856dcb6646dc6b74c5d1c3418c6d4dff08c97cd2bed4cb7f88d8c8e589',\n ],\n [\n '6260ce7f461801c34f067ce0f02873a8f1b0e44dfc69752accecd819f38fd8e8',\n 'bc2da82b6fa5b571a7f09049776a1ef7ecd292238051c198c1a84e95b2b4ae17',\n ],\n [\n 'e5037de0afc1d8d43d8348414bbf4103043ec8f575bfdc432953cc8d2037fa2d',\n '4571534baa94d3b5f9f98d09fb990bddbd5f5b03ec481f10e0e5dc841d755bda',\n ],\n [\n 'e06372b0f4a207adf5ea905e8f1771b4e7e8dbd1c6a6c5b725866a0ae4fce725',\n '7a908974bce18cfe12a27bb2ad5a488cd7484a7787104870b27034f94eee31dd',\n ],\n [\n '213c7a715cd5d45358d0bbf9dc0ce02204b10bdde2a3f58540ad6908d0559754',\n '4b6dad0b5ae462507013ad06245ba190bb4850f5f36a7eeddff2c27534b458f2',\n ],\n [\n '4e7c272a7af4b34e8dbb9352a5419a87e2838c70adc62cddf0cc3a3b08fbd53c',\n '17749c766c9d0b18e16fd09f6def681b530b9614bff7dd33e0b3941817dcaae6',\n ],\n [\n 'fea74e3dbe778b1b10f238ad61686aa5c76e3db2be43057632427e2840fb27b6',\n '6e0568db9b0b13297cf674deccb6af93126b596b973f7b77701d3db7f23cb96f',\n ],\n [\n '76e64113f677cf0e10a2570d599968d31544e179b760432952c02a4417bdde39',\n 'c90ddf8dee4e95cf577066d70681f0d35e2a33d2b56d2032b4b1752d1901ac01',\n ],\n [\n 'c738c56b03b2abe1e8281baa743f8f9a8f7cc643df26cbee3ab150242bcbb891',\n '893fb578951ad2537f718f2eacbfbbbb82314eef7880cfe917e735d9699a84c3',\n ],\n [\n 'd895626548b65b81e264c7637c972877d1d72e5f3a925014372e9f6588f6c14b',\n 'febfaa38f2bc7eae728ec60818c340eb03428d632bb067e179363ed75d7d991f',\n ],\n [\n 'b8da94032a957518eb0f6433571e8761ceffc73693e84edd49150a564f676e03',\n '2804dfa44805a1e4d7c99cc9762808b092cc584d95ff3b511488e4e74efdf6e7',\n ],\n [\n 'e80fea14441fb33a7d8adab9475d7fab2019effb5156a792f1a11778e3c0df5d',\n 'eed1de7f638e00771e89768ca3ca94472d155e80af322ea9fcb4291b6ac9ec78',\n ],\n [\n 'a301697bdfcd704313ba48e51d567543f2a182031efd6915ddc07bbcc4e16070',\n '7370f91cfb67e4f5081809fa25d40f9b1735dbf7c0a11a130c0d1a041e177ea1',\n ],\n [\n '90ad85b389d6b936463f9d0512678de208cc330b11307fffab7ac63e3fb04ed4',\n 'e507a3620a38261affdcbd9427222b839aefabe1582894d991d4d48cb6ef150',\n ],\n [\n '8f68b9d2f63b5f339239c1ad981f162ee88c5678723ea3351b7b444c9ec4c0da',\n '662a9f2dba063986de1d90c2b6be215dbbea2cfe95510bfdf23cbf79501fff82',\n ],\n [\n 'e4f3fb0176af85d65ff99ff9198c36091f48e86503681e3e6686fd5053231e11',\n '1e63633ad0ef4f1c1661a6d0ea02b7286cc7e74ec951d1c9822c38576feb73bc',\n ],\n [\n '8c00fa9b18ebf331eb961537a45a4266c7034f2f0d4e1d0716fb6eae20eae29e',\n 'efa47267fea521a1a9dc343a3736c974c2fadafa81e36c54e7d2a4c66702414b',\n ],\n [\n 'e7a26ce69dd4829f3e10cec0a9e98ed3143d084f308b92c0997fddfc60cb3e41',\n '2a758e300fa7984b471b006a1aafbb18d0a6b2c0420e83e20e8a9421cf2cfd51',\n ],\n [\n 'b6459e0ee3662ec8d23540c223bcbdc571cbcb967d79424f3cf29eb3de6b80ef',\n '67c876d06f3e06de1dadf16e5661db3c4b3ae6d48e35b2ff30bf0b61a71ba45',\n ],\n [\n 'd68a80c8280bb840793234aa118f06231d6f1fc67e73c5a5deda0f5b496943e8',\n 'db8ba9fff4b586d00c4b1f9177b0e28b5b0e7b8f7845295a294c84266b133120',\n ],\n [\n '324aed7df65c804252dc0270907a30b09612aeb973449cea4095980fc28d3d5d',\n '648a365774b61f2ff130c0c35aec1f4f19213b0c7e332843967224af96ab7c84',\n ],\n [\n '4df9c14919cde61f6d51dfdbe5fee5dceec4143ba8d1ca888e8bd373fd054c96',\n '35ec51092d8728050974c23a1d85d4b5d506cdc288490192ebac06cad10d5d',\n ],\n [\n '9c3919a84a474870faed8a9c1cc66021523489054d7f0308cbfc99c8ac1f98cd',\n 'ddb84f0f4a4ddd57584f044bf260e641905326f76c64c8e6be7e5e03d4fc599d',\n ],\n [\n '6057170b1dd12fdf8de05f281d8e06bb91e1493a8b91d4cc5a21382120a959e5',\n '9a1af0b26a6a4807add9a2daf71df262465152bc3ee24c65e899be932385a2a8',\n ],\n [\n 'a576df8e23a08411421439a4518da31880cef0fba7d4df12b1a6973eecb94266',\n '40a6bf20e76640b2c92b97afe58cd82c432e10a7f514d9f3ee8be11ae1b28ec8',\n ],\n [\n '7778a78c28dec3e30a05fe9629de8c38bb30d1f5cf9a3a208f763889be58ad71',\n '34626d9ab5a5b22ff7098e12f2ff580087b38411ff24ac563b513fc1fd9f43ac',\n ],\n [\n '928955ee637a84463729fd30e7afd2ed5f96274e5ad7e5cb09eda9c06d903ac',\n 'c25621003d3f42a827b78a13093a95eeac3d26efa8a8d83fc5180e935bcd091f',\n ],\n [\n '85d0fef3ec6db109399064f3a0e3b2855645b4a907ad354527aae75163d82751',\n '1f03648413a38c0be29d496e582cf5663e8751e96877331582c237a24eb1f962',\n ],\n [\n 'ff2b0dce97eece97c1c9b6041798b85dfdfb6d8882da20308f5404824526087e',\n '493d13fef524ba188af4c4dc54d07936c7b7ed6fb90e2ceb2c951e01f0c29907',\n ],\n [\n '827fbbe4b1e880ea9ed2b2e6301b212b57f1ee148cd6dd28780e5e2cf856e241',\n 'c60f9c923c727b0b71bef2c67d1d12687ff7a63186903166d605b68baec293ec',\n ],\n [\n 'eaa649f21f51bdbae7be4ae34ce6e5217a58fdce7f47f9aa7f3b58fa2120e2b3',\n 'be3279ed5bbbb03ac69a80f89879aa5a01a6b965f13f7e59d47a5305ba5ad93d',\n ],\n [\n 'e4a42d43c5cf169d9391df6decf42ee541b6d8f0c9a137401e23632dda34d24f',\n '4d9f92e716d1c73526fc99ccfb8ad34ce886eedfa8d8e4f13a7f7131deba9414',\n ],\n [\n '1ec80fef360cbdd954160fadab352b6b92b53576a88fea4947173b9d4300bf19',\n 'aeefe93756b5340d2f3a4958a7abbf5e0146e77f6295a07b671cdc1cc107cefd',\n ],\n [\n '146a778c04670c2f91b00af4680dfa8bce3490717d58ba889ddb5928366642be',\n 'b318e0ec3354028add669827f9d4b2870aaa971d2f7e5ed1d0b297483d83efd0',\n ],\n [\n 'fa50c0f61d22e5f07e3acebb1aa07b128d0012209a28b9776d76a8793180eef9',\n '6b84c6922397eba9b72cd2872281a68a5e683293a57a213b38cd8d7d3f4f2811',\n ],\n [\n 'da1d61d0ca721a11b1a5bf6b7d88e8421a288ab5d5bba5220e53d32b5f067ec2',\n '8157f55a7c99306c79c0766161c91e2966a73899d279b48a655fba0f1ad836f1',\n ],\n [\n 'a8e282ff0c9706907215ff98e8fd416615311de0446f1e062a73b0610d064e13',\n '7f97355b8db81c09abfb7f3c5b2515888b679a3e50dd6bd6cef7c73111f4cc0c',\n ],\n [\n '174a53b9c9a285872d39e56e6913cab15d59b1fa512508c022f382de8319497c',\n 'ccc9dc37abfc9c1657b4155f2c47f9e6646b3a1d8cb9854383da13ac079afa73',\n ],\n [\n '959396981943785c3d3e57edf5018cdbe039e730e4918b3d884fdff09475b7ba',\n '2e7e552888c331dd8ba0386a4b9cd6849c653f64c8709385e9b8abf87524f2fd',\n ],\n [\n 'd2a63a50ae401e56d645a1153b109a8fcca0a43d561fba2dbb51340c9d82b151',\n 'e82d86fb6443fcb7565aee58b2948220a70f750af484ca52d4142174dcf89405',\n ],\n [\n '64587e2335471eb890ee7896d7cfdc866bacbdbd3839317b3436f9b45617e073',\n 'd99fcdd5bf6902e2ae96dd6447c299a185b90a39133aeab358299e5e9faf6589',\n ],\n [\n '8481bde0e4e4d885b3a546d3e549de042f0aa6cea250e7fd358d6c86dd45e458',\n '38ee7b8cba5404dd84a25bf39cecb2ca900a79c42b262e556d64b1b59779057e',\n ],\n [\n '13464a57a78102aa62b6979ae817f4637ffcfed3c4b1ce30bcd6303f6caf666b',\n '69be159004614580ef7e433453ccb0ca48f300a81d0942e13f495a907f6ecc27',\n ],\n [\n 'bc4a9df5b713fe2e9aef430bcc1dc97a0cd9ccede2f28588cada3a0d2d83f366',\n 'd3a81ca6e785c06383937adf4b798caa6e8a9fbfa547b16d758d666581f33c1',\n ],\n [\n '8c28a97bf8298bc0d23d8c749452a32e694b65e30a9472a3954ab30fe5324caa',\n '40a30463a3305193378fedf31f7cc0eb7ae784f0451cb9459e71dc73cbef9482',\n ],\n [\n '8ea9666139527a8c1dd94ce4f071fd23c8b350c5a4bb33748c4ba111faccae0',\n '620efabbc8ee2782e24e7c0cfb95c5d735b783be9cf0f8e955af34a30e62b945',\n ],\n [\n 'dd3625faef5ba06074669716bbd3788d89bdde815959968092f76cc4eb9a9787',\n '7a188fa3520e30d461da2501045731ca941461982883395937f68d00c644a573',\n ],\n [\n 'f710d79d9eb962297e4f6232b40e8f7feb2bc63814614d692c12de752408221e',\n 'ea98e67232d3b3295d3b535532115ccac8612c721851617526ae47a9c77bfc82',\n ],\n ],\n },\n naf: {\n wnd: 7,\n points: [\n [\n 'f9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9',\n '388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672',\n ],\n [\n '2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4',\n 'd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6',\n ],\n [\n '5cbdf0646e5db4eaa398f365f2ea7a0e3d419b7e0330e39ce92bddedcac4f9bc',\n '6aebca40ba255960a3178d6d861a54dba813d0b813fde7b5a5082628087264da',\n ],\n [\n 'acd484e2f0c7f65309ad178a9f559abde09796974c57e714c35f110dfc27ccbe',\n 'cc338921b0a7d9fd64380971763b61e9add888a4375f8e0f05cc262ac64f9c37',\n ],\n [\n '774ae7f858a9411e5ef4246b70c65aac5649980be5c17891bbec17895da008cb',\n 'd984a032eb6b5e190243dd56d7b7b365372db1e2dff9d6a8301d74c9c953c61b',\n ],\n [\n 'f28773c2d975288bc7d1d205c3748651b075fbc6610e58cddeeddf8f19405aa8',\n 'ab0902e8d880a89758212eb65cdaf473a1a06da521fa91f29b5cb52db03ed81',\n ],\n [\n 'd7924d4f7d43ea965a465ae3095ff41131e5946f3c85f79e44adbcf8e27e080e',\n '581e2872a86c72a683842ec228cc6defea40af2bd896d3a5c504dc9ff6a26b58',\n ],\n [\n 'defdea4cdb677750a420fee807eacf21eb9898ae79b9768766e4faa04a2d4a34',\n '4211ab0694635168e997b0ead2a93daeced1f4a04a95c0f6cfb199f69e56eb77',\n ],\n [\n '2b4ea0a797a443d293ef5cff444f4979f06acfebd7e86d277475656138385b6c',\n '85e89bc037945d93b343083b5a1c86131a01f60c50269763b570c854e5c09b7a',\n ],\n [\n '352bbf4a4cdd12564f93fa332ce333301d9ad40271f8107181340aef25be59d5',\n '321eb4075348f534d59c18259dda3e1f4a1b3b2e71b1039c67bd3d8bcf81998c',\n ],\n [\n '2fa2104d6b38d11b0230010559879124e42ab8dfeff5ff29dc9cdadd4ecacc3f',\n '2de1068295dd865b64569335bd5dd80181d70ecfc882648423ba76b532b7d67',\n ],\n [\n '9248279b09b4d68dab21a9b066edda83263c3d84e09572e269ca0cd7f5453714',\n '73016f7bf234aade5d1aa71bdea2b1ff3fc0de2a887912ffe54a32ce97cb3402',\n ],\n [\n 'daed4f2be3a8bf278e70132fb0beb7522f570e144bf615c07e996d443dee8729',\n 'a69dce4a7d6c98e8d4a1aca87ef8d7003f83c230f3afa726ab40e52290be1c55',\n ],\n [\n 'c44d12c7065d812e8acf28d7cbb19f9011ecd9e9fdf281b0e6a3b5e87d22e7db',\n '2119a460ce326cdc76c45926c982fdac0e106e861edf61c5a039063f0e0e6482',\n ],\n [\n '6a245bf6dc698504c89a20cfded60853152b695336c28063b61c65cbd269e6b4',\n 'e022cf42c2bd4a708b3f5126f16a24ad8b33ba48d0423b6efd5e6348100d8a82',\n ],\n [\n '1697ffa6fd9de627c077e3d2fe541084ce13300b0bec1146f95ae57f0d0bd6a5',\n 'b9c398f186806f5d27561506e4557433a2cf15009e498ae7adee9d63d01b2396',\n ],\n [\n '605bdb019981718b986d0f07e834cb0d9deb8360ffb7f61df982345ef27a7479',\n '2972d2de4f8d20681a78d93ec96fe23c26bfae84fb14db43b01e1e9056b8c49',\n ],\n [\n '62d14dab4150bf497402fdc45a215e10dcb01c354959b10cfe31c7e9d87ff33d',\n '80fc06bd8cc5b01098088a1950eed0db01aa132967ab472235f5642483b25eaf',\n ],\n [\n '80c60ad0040f27dade5b4b06c408e56b2c50e9f56b9b8b425e555c2f86308b6f',\n '1c38303f1cc5c30f26e66bad7fe72f70a65eed4cbe7024eb1aa01f56430bd57a',\n ],\n [\n '7a9375ad6167ad54aa74c6348cc54d344cc5dc9487d847049d5eabb0fa03c8fb',\n 'd0e3fa9eca8726909559e0d79269046bdc59ea10c70ce2b02d499ec224dc7f7',\n ],\n [\n 'd528ecd9b696b54c907a9ed045447a79bb408ec39b68df504bb51f459bc3ffc9',\n 'eecf41253136e5f99966f21881fd656ebc4345405c520dbc063465b521409933',\n ],\n [\n '49370a4b5f43412ea25f514e8ecdad05266115e4a7ecb1387231808f8b45963',\n '758f3f41afd6ed428b3081b0512fd62a54c3f3afbb5b6764b653052a12949c9a',\n ],\n [\n '77f230936ee88cbbd73df930d64702ef881d811e0e1498e2f1c13eb1fc345d74',\n '958ef42a7886b6400a08266e9ba1b37896c95330d97077cbbe8eb3c7671c60d6',\n ],\n [\n 'f2dac991cc4ce4b9ea44887e5c7c0bce58c80074ab9d4dbaeb28531b7739f530',\n 'e0dedc9b3b2f8dad4da1f32dec2531df9eb5fbeb0598e4fd1a117dba703a3c37',\n ],\n [\n '463b3d9f662621fb1b4be8fbbe2520125a216cdfc9dae3debcba4850c690d45b',\n '5ed430d78c296c3543114306dd8622d7c622e27c970a1de31cb377b01af7307e',\n ],\n [\n 'f16f804244e46e2a09232d4aff3b59976b98fac14328a2d1a32496b49998f247',\n 'cedabd9b82203f7e13d206fcdf4e33d92a6c53c26e5cce26d6579962c4e31df6',\n ],\n [\n 'caf754272dc84563b0352b7a14311af55d245315ace27c65369e15f7151d41d1',\n 'cb474660ef35f5f2a41b643fa5e460575f4fa9b7962232a5c32f908318a04476',\n ],\n [\n '2600ca4b282cb986f85d0f1709979d8b44a09c07cb86d7c124497bc86f082120',\n '4119b88753c15bd6a693b03fcddbb45d5ac6be74ab5f0ef44b0be9475a7e4b40',\n ],\n [\n '7635ca72d7e8432c338ec53cd12220bc01c48685e24f7dc8c602a7746998e435',\n '91b649609489d613d1d5e590f78e6d74ecfc061d57048bad9e76f302c5b9c61',\n ],\n [\n '754e3239f325570cdbbf4a87deee8a66b7f2b33479d468fbc1a50743bf56cc18',\n '673fb86e5bda30fb3cd0ed304ea49a023ee33d0197a695d0c5d98093c536683',\n ],\n [\n 'e3e6bd1071a1e96aff57859c82d570f0330800661d1c952f9fe2694691d9b9e8',\n '59c9e0bba394e76f40c0aa58379a3cb6a5a2283993e90c4167002af4920e37f5',\n ],\n [\n '186b483d056a033826ae73d88f732985c4ccb1f32ba35f4b4cc47fdcf04aa6eb',\n '3b952d32c67cf77e2e17446e204180ab21fb8090895138b4a4a797f86e80888b',\n ],\n [\n 'df9d70a6b9876ce544c98561f4be4f725442e6d2b737d9c91a8321724ce0963f',\n '55eb2dafd84d6ccd5f862b785dc39d4ab157222720ef9da217b8c45cf2ba2417',\n ],\n [\n '5edd5cc23c51e87a497ca815d5dce0f8ab52554f849ed8995de64c5f34ce7143',\n 'efae9c8dbc14130661e8cec030c89ad0c13c66c0d17a2905cdc706ab7399a868',\n ],\n [\n '290798c2b6476830da12fe02287e9e777aa3fba1c355b17a722d362f84614fba',\n 'e38da76dcd440621988d00bcf79af25d5b29c094db2a23146d003afd41943e7a',\n ],\n [\n 'af3c423a95d9f5b3054754efa150ac39cd29552fe360257362dfdecef4053b45',\n 'f98a3fd831eb2b749a93b0e6f35cfb40c8cd5aa667a15581bc2feded498fd9c6',\n ],\n [\n '766dbb24d134e745cccaa28c99bf274906bb66b26dcf98df8d2fed50d884249a',\n '744b1152eacbe5e38dcc887980da38b897584a65fa06cedd2c924f97cbac5996',\n ],\n [\n '59dbf46f8c94759ba21277c33784f41645f7b44f6c596a58ce92e666191abe3e',\n 'c534ad44175fbc300f4ea6ce648309a042ce739a7919798cd85e216c4a307f6e',\n ],\n [\n 'f13ada95103c4537305e691e74e9a4a8dd647e711a95e73cb62dc6018cfd87b8',\n 'e13817b44ee14de663bf4bc808341f326949e21a6a75c2570778419bdaf5733d',\n ],\n [\n '7754b4fa0e8aced06d4167a2c59cca4cda1869c06ebadfb6488550015a88522c',\n '30e93e864e669d82224b967c3020b8fa8d1e4e350b6cbcc537a48b57841163a2',\n ],\n [\n '948dcadf5990e048aa3874d46abef9d701858f95de8041d2a6828c99e2262519',\n 'e491a42537f6e597d5d28a3224b1bc25df9154efbd2ef1d2cbba2cae5347d57e',\n ],\n [\n '7962414450c76c1689c7b48f8202ec37fb224cf5ac0bfa1570328a8a3d7c77ab',\n '100b610ec4ffb4760d5c1fc133ef6f6b12507a051f04ac5760afa5b29db83437',\n ],\n [\n '3514087834964b54b15b160644d915485a16977225b8847bb0dd085137ec47ca',\n 'ef0afbb2056205448e1652c48e8127fc6039e77c15c2378b7e7d15a0de293311',\n ],\n [\n 'd3cc30ad6b483e4bc79ce2c9dd8bc54993e947eb8df787b442943d3f7b527eaf',\n '8b378a22d827278d89c5e9be8f9508ae3c2ad46290358630afb34db04eede0a4',\n ],\n [\n '1624d84780732860ce1c78fcbfefe08b2b29823db913f6493975ba0ff4847610',\n '68651cf9b6da903e0914448c6cd9d4ca896878f5282be4c8cc06e2a404078575',\n ],\n [\n '733ce80da955a8a26902c95633e62a985192474b5af207da6df7b4fd5fc61cd4',\n 'f5435a2bd2badf7d485a4d8b8db9fcce3e1ef8e0201e4578c54673bc1dc5ea1d',\n ],\n [\n '15d9441254945064cf1a1c33bbd3b49f8966c5092171e699ef258dfab81c045c',\n 'd56eb30b69463e7234f5137b73b84177434800bacebfc685fc37bbe9efe4070d',\n ],\n [\n 'a1d0fcf2ec9de675b612136e5ce70d271c21417c9d2b8aaaac138599d0717940',\n 'edd77f50bcb5a3cab2e90737309667f2641462a54070f3d519212d39c197a629',\n ],\n [\n 'e22fbe15c0af8ccc5780c0735f84dbe9a790badee8245c06c7ca37331cb36980',\n 'a855babad5cd60c88b430a69f53a1a7a38289154964799be43d06d77d31da06',\n ],\n [\n '311091dd9860e8e20ee13473c1155f5f69635e394704eaa74009452246cfa9b3',\n '66db656f87d1f04fffd1f04788c06830871ec5a64feee685bd80f0b1286d8374',\n ],\n [\n '34c1fd04d301be89b31c0442d3e6ac24883928b45a9340781867d4232ec2dbdf',\n '9414685e97b1b5954bd46f730174136d57f1ceeb487443dc5321857ba73abee',\n ],\n [\n 'f219ea5d6b54701c1c14de5b557eb42a8d13f3abbcd08affcc2a5e6b049b8d63',\n '4cb95957e83d40b0f73af4544cccf6b1f4b08d3c07b27fb8d8c2962a400766d1',\n ],\n [\n 'd7b8740f74a8fbaab1f683db8f45de26543a5490bca627087236912469a0b448',\n 'fa77968128d9c92ee1010f337ad4717eff15db5ed3c049b3411e0315eaa4593b',\n ],\n [\n '32d31c222f8f6f0ef86f7c98d3a3335ead5bcd32abdd94289fe4d3091aa824bf',\n '5f3032f5892156e39ccd3d7915b9e1da2e6dac9e6f26e961118d14b8462e1661',\n ],\n [\n '7461f371914ab32671045a155d9831ea8793d77cd59592c4340f86cbc18347b5',\n '8ec0ba238b96bec0cbdddcae0aa442542eee1ff50c986ea6b39847b3cc092ff6',\n ],\n [\n 'ee079adb1df1860074356a25aa38206a6d716b2c3e67453d287698bad7b2b2d6',\n '8dc2412aafe3be5c4c5f37e0ecc5f9f6a446989af04c4e25ebaac479ec1c8c1e',\n ],\n [\n '16ec93e447ec83f0467b18302ee620f7e65de331874c9dc72bfd8616ba9da6b5',\n '5e4631150e62fb40d0e8c2a7ca5804a39d58186a50e497139626778e25b0674d',\n ],\n [\n 'eaa5f980c245f6f038978290afa70b6bd8855897f98b6aa485b96065d537bd99',\n 'f65f5d3e292c2e0819a528391c994624d784869d7e6ea67fb18041024edc07dc',\n ],\n [\n '78c9407544ac132692ee1910a02439958ae04877151342ea96c4b6b35a49f51',\n 'f3e0319169eb9b85d5404795539a5e68fa1fbd583c064d2462b675f194a3ddb4',\n ],\n [\n '494f4be219a1a77016dcd838431aea0001cdc8ae7a6fc688726578d9702857a5',\n '42242a969283a5f339ba7f075e36ba2af925ce30d767ed6e55f4b031880d562c',\n ],\n [\n 'a598a8030da6d86c6bc7f2f5144ea549d28211ea58faa70ebf4c1e665c1fe9b5',\n '204b5d6f84822c307e4b4a7140737aec23fc63b65b35f86a10026dbd2d864e6b',\n ],\n [\n 'c41916365abb2b5d09192f5f2dbeafec208f020f12570a184dbadc3e58595997',\n '4f14351d0087efa49d245b328984989d5caf9450f34bfc0ed16e96b58fa9913',\n ],\n [\n '841d6063a586fa475a724604da03bc5b92a2e0d2e0a36acfe4c73a5514742881',\n '73867f59c0659e81904f9a1c7543698e62562d6744c169ce7a36de01a8d6154',\n ],\n [\n '5e95bb399a6971d376026947f89bde2f282b33810928be4ded112ac4d70e20d5',\n '39f23f366809085beebfc71181313775a99c9aed7d8ba38b161384c746012865',\n ],\n [\n '36e4641a53948fd476c39f8a99fd974e5ec07564b5315d8bf99471bca0ef2f66',\n 'd2424b1b1abe4eb8164227b085c9aa9456ea13493fd563e06fd51cf5694c78fc',\n ],\n [\n '336581ea7bfbbb290c191a2f507a41cf5643842170e914faeab27c2c579f726',\n 'ead12168595fe1be99252129b6e56b3391f7ab1410cd1e0ef3dcdcabd2fda224',\n ],\n [\n '8ab89816dadfd6b6a1f2634fcf00ec8403781025ed6890c4849742706bd43ede',\n '6fdcef09f2f6d0a044e654aef624136f503d459c3e89845858a47a9129cdd24e',\n ],\n [\n '1e33f1a746c9c5778133344d9299fcaa20b0938e8acff2544bb40284b8c5fb94',\n '60660257dd11b3aa9c8ed618d24edff2306d320f1d03010e33a7d2057f3b3b6',\n ],\n [\n '85b7c1dcb3cec1b7ee7f30ded79dd20a0ed1f4cc18cbcfcfa410361fd8f08f31',\n '3d98a9cdd026dd43f39048f25a8847f4fcafad1895d7a633c6fed3c35e999511',\n ],\n [\n '29df9fbd8d9e46509275f4b125d6d45d7fbe9a3b878a7af872a2800661ac5f51',\n 'b4c4fe99c775a606e2d8862179139ffda61dc861c019e55cd2876eb2a27d84b',\n ],\n [\n 'a0b1cae06b0a847a3fea6e671aaf8adfdfe58ca2f768105c8082b2e449fce252',\n 'ae434102edde0958ec4b19d917a6a28e6b72da1834aff0e650f049503a296cf2',\n ],\n [\n '4e8ceafb9b3e9a136dc7ff67e840295b499dfb3b2133e4ba113f2e4c0e121e5',\n 'cf2174118c8b6d7a4b48f6d534ce5c79422c086a63460502b827ce62a326683c',\n ],\n [\n 'd24a44e047e19b6f5afb81c7ca2f69080a5076689a010919f42725c2b789a33b',\n '6fb8d5591b466f8fc63db50f1c0f1c69013f996887b8244d2cdec417afea8fa3',\n ],\n [\n 'ea01606a7a6c9cdd249fdfcfacb99584001edd28abbab77b5104e98e8e3b35d4',\n '322af4908c7312b0cfbfe369f7a7b3cdb7d4494bc2823700cfd652188a3ea98d',\n ],\n [\n 'af8addbf2b661c8a6c6328655eb96651252007d8c5ea31be4ad196de8ce2131f',\n '6749e67c029b85f52a034eafd096836b2520818680e26ac8f3dfbcdb71749700',\n ],\n [\n 'e3ae1974566ca06cc516d47e0fb165a674a3dabcfca15e722f0e3450f45889',\n '2aeabe7e4531510116217f07bf4d07300de97e4874f81f533420a72eeb0bd6a4',\n ],\n [\n '591ee355313d99721cf6993ffed1e3e301993ff3ed258802075ea8ced397e246',\n 'b0ea558a113c30bea60fc4775460c7901ff0b053d25ca2bdeee98f1a4be5d196',\n ],\n [\n '11396d55fda54c49f19aa97318d8da61fa8584e47b084945077cf03255b52984',\n '998c74a8cd45ac01289d5833a7beb4744ff536b01b257be4c5767bea93ea57a4',\n ],\n [\n '3c5d2a1ba39c5a1790000738c9e0c40b8dcdfd5468754b6405540157e017aa7a',\n 'b2284279995a34e2f9d4de7396fc18b80f9b8b9fdd270f6661f79ca4c81bd257',\n ],\n [\n 'cc8704b8a60a0defa3a99a7299f2e9c3fbc395afb04ac078425ef8a1793cc030',\n 'bdd46039feed17881d1e0862db347f8cf395b74fc4bcdc4e940b74e3ac1f1b13',\n ],\n [\n 'c533e4f7ea8555aacd9777ac5cad29b97dd4defccc53ee7ea204119b2889b197',\n '6f0a256bc5efdf429a2fb6242f1a43a2d9b925bb4a4b3a26bb8e0f45eb596096',\n ],\n [\n 'c14f8f2ccb27d6f109f6d08d03cc96a69ba8c34eec07bbcf566d48e33da6593',\n 'c359d6923bb398f7fd4473e16fe1c28475b740dd098075e6c0e8649113dc3a38',\n ],\n [\n 'a6cbc3046bc6a450bac24789fa17115a4c9739ed75f8f21ce441f72e0b90e6ef',\n '21ae7f4680e889bb130619e2c0f95a360ceb573c70603139862afd617fa9b9f',\n ],\n [\n '347d6d9a02c48927ebfb86c1359b1caf130a3c0267d11ce6344b39f99d43cc38',\n '60ea7f61a353524d1c987f6ecec92f086d565ab687870cb12689ff1e31c74448',\n ],\n [\n 'da6545d2181db8d983f7dcb375ef5866d47c67b1bf31c8cf855ef7437b72656a',\n '49b96715ab6878a79e78f07ce5680c5d6673051b4935bd897fea824b77dc208a',\n ],\n [\n 'c40747cc9d012cb1a13b8148309c6de7ec25d6945d657146b9d5994b8feb1111',\n '5ca560753be2a12fc6de6caf2cb489565db936156b9514e1bb5e83037e0fa2d4',\n ],\n [\n '4e42c8ec82c99798ccf3a610be870e78338c7f713348bd34c8203ef4037f3502',\n '7571d74ee5e0fb92a7a8b33a07783341a5492144cc54bcc40a94473693606437',\n ],\n [\n '3775ab7089bc6af823aba2e1af70b236d251cadb0c86743287522a1b3b0dedea',\n 'be52d107bcfa09d8bcb9736a828cfa7fac8db17bf7a76a2c42ad961409018cf7',\n ],\n [\n 'cee31cbf7e34ec379d94fb814d3d775ad954595d1314ba8846959e3e82f74e26',\n '8fd64a14c06b589c26b947ae2bcf6bfa0149ef0be14ed4d80f448a01c43b1c6d',\n ],\n [\n 'b4f9eaea09b6917619f6ea6a4eb5464efddb58fd45b1ebefcdc1a01d08b47986',\n '39e5c9925b5a54b07433a4f18c61726f8bb131c012ca542eb24a8ac07200682a',\n ],\n [\n 'd4263dfc3d2df923a0179a48966d30ce84e2515afc3dccc1b77907792ebcc60e',\n '62dfaf07a0f78feb30e30d6295853ce189e127760ad6cf7fae164e122a208d54',\n ],\n [\n '48457524820fa65a4f8d35eb6930857c0032acc0a4a2de422233eeda897612c4',\n '25a748ab367979d98733c38a1fa1c2e7dc6cc07db2d60a9ae7a76aaa49bd0f77',\n ],\n [\n 'dfeeef1881101f2cb11644f3a2afdfc2045e19919152923f367a1767c11cceda',\n 'ecfb7056cf1de042f9420bab396793c0c390bde74b4bbdff16a83ae09a9a7517',\n ],\n [\n '6d7ef6b17543f8373c573f44e1f389835d89bcbc6062ced36c82df83b8fae859',\n 'cd450ec335438986dfefa10c57fea9bcc521a0959b2d80bbf74b190dca712d10',\n ],\n [\n 'e75605d59102a5a2684500d3b991f2e3f3c88b93225547035af25af66e04541f',\n 'f5c54754a8f71ee540b9b48728473e314f729ac5308b06938360990e2bfad125',\n ],\n [\n 'eb98660f4c4dfaa06a2be453d5020bc99a0c2e60abe388457dd43fefb1ed620c',\n '6cb9a8876d9cb8520609af3add26cd20a0a7cd8a9411131ce85f44100099223e',\n ],\n [\n '13e87b027d8514d35939f2e6892b19922154596941888336dc3563e3b8dba942',\n 'fef5a3c68059a6dec5d624114bf1e91aac2b9da568d6abeb2570d55646b8adf1',\n ],\n [\n 'ee163026e9fd6fe017c38f06a5be6fc125424b371ce2708e7bf4491691e5764a',\n '1acb250f255dd61c43d94ccc670d0f58f49ae3fa15b96623e5430da0ad6c62b2',\n ],\n [\n 'b268f5ef9ad51e4d78de3a750c2dc89b1e626d43505867999932e5db33af3d80',\n '5f310d4b3c99b9ebb19f77d41c1dee018cf0d34fd4191614003e945a1216e423',\n ],\n [\n 'ff07f3118a9df035e9fad85eb6c7bfe42b02f01ca99ceea3bf7ffdba93c4750d',\n '438136d603e858a3a5c440c38eccbaddc1d2942114e2eddd4740d098ced1f0d8',\n ],\n [\n '8d8b9855c7c052a34146fd20ffb658bea4b9f69e0d825ebec16e8c3ce2b526a1',\n 'cdb559eedc2d79f926baf44fb84ea4d44bcf50fee51d7ceb30e2e7f463036758',\n ],\n [\n '52db0b5384dfbf05bfa9d472d7ae26dfe4b851ceca91b1eba54263180da32b63',\n 'c3b997d050ee5d423ebaf66a6db9f57b3180c902875679de924b69d84a7b375',\n ],\n [\n 'e62f9490d3d51da6395efd24e80919cc7d0f29c3f3fa48c6fff543becbd43352',\n '6d89ad7ba4876b0b22c2ca280c682862f342c8591f1daf5170e07bfd9ccafa7d',\n ],\n [\n '7f30ea2476b399b4957509c88f77d0191afa2ff5cb7b14fd6d8e7d65aaab1193',\n 'ca5ef7d4b231c94c3b15389a5f6311e9daff7bb67b103e9880ef4bff637acaec',\n ],\n [\n '5098ff1e1d9f14fb46a210fada6c903fef0fb7b4a1dd1d9ac60a0361800b7a00',\n '9731141d81fc8f8084d37c6e7542006b3ee1b40d60dfe5362a5b132fd17ddc0',\n ],\n [\n '32b78c7de9ee512a72895be6b9cbefa6e2f3c4ccce445c96b9f2c81e2778ad58',\n 'ee1849f513df71e32efc3896ee28260c73bb80547ae2275ba497237794c8753c',\n ],\n [\n 'e2cb74fddc8e9fbcd076eef2a7c72b0ce37d50f08269dfc074b581550547a4f7',\n 'd3aa2ed71c9dd2247a62df062736eb0baddea9e36122d2be8641abcb005cc4a4',\n ],\n [\n '8438447566d4d7bedadc299496ab357426009a35f235cb141be0d99cd10ae3a8',\n 'c4e1020916980a4da5d01ac5e6ad330734ef0d7906631c4f2390426b2edd791f',\n ],\n [\n '4162d488b89402039b584c6fc6c308870587d9c46f660b878ab65c82c711d67e',\n '67163e903236289f776f22c25fb8a3afc1732f2b84b4e95dbda47ae5a0852649',\n ],\n [\n '3fad3fa84caf0f34f0f89bfd2dcf54fc175d767aec3e50684f3ba4a4bf5f683d',\n 'cd1bc7cb6cc407bb2f0ca647c718a730cf71872e7d0d2a53fa20efcdfe61826',\n ],\n [\n '674f2600a3007a00568c1a7ce05d0816c1fb84bf1370798f1c69532faeb1a86b',\n '299d21f9413f33b3edf43b257004580b70db57da0b182259e09eecc69e0d38a5',\n ],\n [\n 'd32f4da54ade74abb81b815ad1fb3b263d82d6c692714bcff87d29bd5ee9f08f',\n 'f9429e738b8e53b968e99016c059707782e14f4535359d582fc416910b3eea87',\n ],\n [\n '30e4e670435385556e593657135845d36fbb6931f72b08cb1ed954f1e3ce3ff6',\n '462f9bce619898638499350113bbc9b10a878d35da70740dc695a559eb88db7b',\n ],\n [\n 'be2062003c51cc3004682904330e4dee7f3dcd10b01e580bf1971b04d4cad297',\n '62188bc49d61e5428573d48a74e1c655b1c61090905682a0d5558ed72dccb9bc',\n ],\n [\n '93144423ace3451ed29e0fb9ac2af211cb6e84a601df5993c419859fff5df04a',\n '7c10dfb164c3425f5c71a3f9d7992038f1065224f72bb9d1d902a6d13037b47c',\n ],\n [\n 'b015f8044f5fcbdcf21ca26d6c34fb8197829205c7b7d2a7cb66418c157b112c',\n 'ab8c1e086d04e813744a655b2df8d5f83b3cdc6faa3088c1d3aea1454e3a1d5f',\n ],\n [\n 'd5e9e1da649d97d89e4868117a465a3a4f8a18de57a140d36b3f2af341a21b52',\n '4cb04437f391ed73111a13cc1d4dd0db1693465c2240480d8955e8592f27447a',\n ],\n [\n 'd3ae41047dd7ca065dbf8ed77b992439983005cd72e16d6f996a5316d36966bb',\n 'bd1aeb21ad22ebb22a10f0303417c6d964f8cdd7df0aca614b10dc14d125ac46',\n ],\n [\n '463e2763d885f958fc66cdd22800f0a487197d0a82e377b49f80af87c897b065',\n 'bfefacdb0e5d0fd7df3a311a94de062b26b80c61fbc97508b79992671ef7ca7f',\n ],\n [\n '7985fdfd127c0567c6f53ec1bb63ec3158e597c40bfe747c83cddfc910641917',\n '603c12daf3d9862ef2b25fe1de289aed24ed291e0ec6708703a5bd567f32ed03',\n ],\n [\n '74a1ad6b5f76e39db2dd249410eac7f99e74c59cb83d2d0ed5ff1543da7703e9',\n 'cc6157ef18c9c63cd6193d83631bbea0093e0968942e8c33d5737fd790e0db08',\n ],\n [\n '30682a50703375f602d416664ba19b7fc9bab42c72747463a71d0896b22f6da3',\n '553e04f6b018b4fa6c8f39e7f311d3176290d0e0f19ca73f17714d9977a22ff8',\n ],\n [\n '9e2158f0d7c0d5f26c3791efefa79597654e7a2b2464f52b1ee6c1347769ef57',\n '712fcdd1b9053f09003a3481fa7762e9ffd7c8ef35a38509e2fbf2629008373',\n ],\n [\n '176e26989a43c9cfeba4029c202538c28172e566e3c4fce7322857f3be327d66',\n 'ed8cc9d04b29eb877d270b4878dc43c19aefd31f4eee09ee7b47834c1fa4b1c3',\n ],\n [\n '75d46efea3771e6e68abb89a13ad747ecf1892393dfc4f1b7004788c50374da8',\n '9852390a99507679fd0b86fd2b39a868d7efc22151346e1a3ca4726586a6bed8',\n ],\n [\n '809a20c67d64900ffb698c4c825f6d5f2310fb0451c869345b7319f645605721',\n '9e994980d9917e22b76b061927fa04143d096ccc54963e6a5ebfa5f3f8e286c1',\n ],\n [\n '1b38903a43f7f114ed4500b4eac7083fdefece1cf29c63528d563446f972c180',\n '4036edc931a60ae889353f77fd53de4a2708b26b6f5da72ad3394119daf408f9',\n ],\n ],\n },\n};\n","'use strict';\n\nvar utils = exports;\nvar BN = require('bn.js');\nvar minAssert = require('minimalistic-assert');\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;\n\n// Represent num in a w-NAF form\nfunction getNAF(num, w, bits) {\n var naf = new Array(Math.max(num.bitLength(), bits) + 1);\n naf.fill(0);\n\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 if (k.isOdd()) {\n if (mod > (ws >> 1) - 1)\n z = (ws >> 1) - mod;\n else\n 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}\nutils.getNAF = getNAF;\n\n// Represent k1, k2 in a Joint Sparse Form\nfunction getJSF(k1, k2) {\n var jsf = [\n [],\n [],\n ];\n\n k1 = k1.clone();\n k2 = k2.clone();\n var d1 = 0;\n var d2 = 0;\n var m8;\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)\n m14 = -1;\n if (m24 === 3)\n m24 = -1;\n var u1;\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)\n u1 = -m14;\n else\n u1 = m14;\n }\n jsf[0].push(u1);\n\n var u2;\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)\n u2 = -m24;\n else\n u2 = m24;\n }\n jsf[1].push(u2);\n\n // Second phase\n if (2 * d1 === u1 + 1)\n d1 = 1 - d1;\n if (2 * d2 === u2 + 1)\n d2 = 1 - d2;\n k1.iushrn(1);\n k2.iushrn(1);\n }\n\n return jsf;\n}\nutils.getJSF = getJSF;\n\nfunction cachedProperty(obj, name, computer) {\n var key = '_' + name;\n obj.prototype[name] = function cachedProperty() {\n return this[key] !== undefined ? this[key] :\n this[key] = computer.call(this);\n };\n}\nutils.cachedProperty = cachedProperty;\n\nfunction parseBytes(bytes) {\n return typeof bytes === 'string' ? utils.toArray(bytes, 'hex') :\n bytes;\n}\nutils.parseBytes = parseBytes;\n\nfunction intFromLE(bytes) {\n return new BN(bytes, 'hex', 'le');\n}\nutils.intFromLE = intFromLE;\n\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","var once = require('once');\n\nvar noop = function() {};\n\nvar isRequest = function(stream) {\n\treturn stream.setHeader && typeof stream.abort === 'function';\n};\n\nvar isChildProcess = function(stream) {\n\treturn stream.stdio && Array.isArray(stream.stdio) && stream.stdio.length === 3\n};\n\nvar eos = function(stream, opts, callback) {\n\tif (typeof opts === 'function') return eos(stream, null, opts);\n\tif (!opts) opts = {};\n\n\tcallback = once(callback || noop);\n\n\tvar ws = stream._writableState;\n\tvar rs = stream._readableState;\n\tvar readable = opts.readable || (opts.readable !== false && stream.readable);\n\tvar writable = opts.writable || (opts.writable !== false && stream.writable);\n\tvar cancelled = false;\n\n\tvar onlegacyfinish = function() {\n\t\tif (!stream.writable) onfinish();\n\t};\n\n\tvar onfinish = function() {\n\t\twritable = false;\n\t\tif (!readable) callback.call(stream);\n\t};\n\n\tvar onend = function() {\n\t\treadable = false;\n\t\tif (!writable) callback.call(stream);\n\t};\n\n\tvar onexit = function(exitCode) {\n\t\tcallback.call(stream, exitCode ? new Error('exited with error code: ' + exitCode) : null);\n\t};\n\n\tvar onerror = function(err) {\n\t\tcallback.call(stream, err);\n\t};\n\n\tvar onclose = function() {\n\t\tprocess.nextTick(onclosenexttick);\n\t};\n\n\tvar onclosenexttick = function() {\n\t\tif (cancelled) return;\n\t\tif (readable && !(rs && (rs.ended && !rs.destroyed))) return callback.call(stream, new Error('premature close'));\n\t\tif (writable && !(ws && (ws.ended && !ws.destroyed))) return callback.call(stream, new Error('premature close'));\n\t};\n\n\tvar onrequest = function() {\n\t\tstream.req.on('finish', onfinish);\n\t};\n\n\tif (isRequest(stream)) {\n\t\tstream.on('complete', onfinish);\n\t\tstream.on('abort', onclose);\n\t\tif (stream.req) onrequest();\n\t\telse stream.on('request', onrequest);\n\t} else if (writable && !ws) { // legacy streams\n\t\tstream.on('end', onlegacyfinish);\n\t\tstream.on('close', onlegacyfinish);\n\t}\n\n\tif (isChildProcess(stream)) stream.on('exit', onexit);\n\n\tstream.on('end', onend);\n\tstream.on('finish', onfinish);\n\tif (opts.error !== false) stream.on('error', onerror);\n\tstream.on('close', onclose);\n\n\treturn function() {\n\t\tcancelled = true;\n\t\tstream.removeListener('complete', onfinish);\n\t\tstream.removeListener('abort', onclose);\n\t\tstream.removeListener('request', onrequest);\n\t\tif (stream.req) stream.req.removeListener('finish', onfinish);\n\t\tstream.removeListener('end', onlegacyfinish);\n\t\tstream.removeListener('close', onlegacyfinish);\n\t\tstream.removeListener('finish', onfinish);\n\t\tstream.removeListener('exit', onexit);\n\t\tstream.removeListener('end', onend);\n\t\tstream.removeListener('error', onerror);\n\t\tstream.removeListener('close', onclose);\n\t};\n};\n\nmodule.exports = eos;\n","'use strict';\n\n/**\n * @typedef {{ [key: string]: any }} Extensions\n * @typedef {Error} Err\n * @property {string} message\n */\n\n/**\n *\n * @param {Error} obj\n * @param {Extensions} props\n * @returns {Error & Extensions}\n */\nfunction assign(obj, props) {\n for (const key in props) {\n Object.defineProperty(obj, key, {\n value: props[key],\n enumerable: true,\n configurable: true,\n });\n }\n\n return obj;\n}\n\n/**\n *\n * @param {any} err - An Error\n * @param {string|Extensions} code - A string code or props to set on the error\n * @param {Extensions} [props] - Props to set on the error\n * @returns {Error & Extensions}\n */\nfunction createError(err, code, props) {\n if (!err || typeof err === 'string') {\n throw new TypeError('Please pass an Error to err-code');\n }\n\n if (!props) {\n props = {};\n }\n\n if (typeof code === 'object') {\n props = code;\n code = '';\n }\n\n if (code) {\n props.code = code;\n }\n\n try {\n return assign(err, props);\n } catch (_) {\n props.message = err.message;\n props.stack = err.stack;\n\n const ErrClass = function () {};\n\n ErrClass.prototype = Object.create(Object.getPrototypeOf(err));\n\n // @ts-ignore\n const output = assign(new ErrClass(), props);\n\n return output;\n }\n}\n\nmodule.exports = createError;\n","/**\n * Code refactored from Mozilla Developer Network:\n * https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Object/assign\n */\n\n'use strict';\n\nfunction assign(target, firstSource) {\n if (target === undefined || target === null) {\n throw new TypeError('Cannot convert first argument to object');\n }\n\n var to = Object(target);\n for (var i = 1; i < arguments.length; i++) {\n var nextSource = arguments[i];\n if (nextSource === undefined || nextSource === null) {\n continue;\n }\n\n var keysArray = Object.keys(Object(nextSource));\n for (var nextIndex = 0, len = keysArray.length; nextIndex < len; nextIndex++) {\n var nextKey = keysArray[nextIndex];\n var desc = Object.getOwnPropertyDescriptor(nextSource, nextKey);\n if (desc !== undefined && desc.enumerable) {\n to[nextKey] = nextSource[nextKey];\n }\n }\n }\n return to;\n}\n\nfunction polyfill() {\n if (!Object.assign) {\n Object.defineProperty(Object, 'assign', {\n enumerable: false,\n configurable: true,\n writable: true,\n value: assign\n });\n }\n}\n\nmodule.exports = {\n assign: assign,\n polyfill: polyfill\n};\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\n'use strict';\n\nvar R = typeof Reflect === 'object' ? Reflect : null\nvar ReflectApply = R && typeof R.apply === 'function'\n ? R.apply\n : function ReflectApply(target, receiver, args) {\n return Function.prototype.apply.call(target, receiver, args);\n }\n\nvar ReflectOwnKeys\nif (R && typeof R.ownKeys === 'function') {\n ReflectOwnKeys = R.ownKeys\n} else if (Object.getOwnPropertySymbols) {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target)\n .concat(Object.getOwnPropertySymbols(target));\n };\n} else {\n ReflectOwnKeys = function ReflectOwnKeys(target) {\n return Object.getOwnPropertyNames(target);\n };\n}\n\nfunction ProcessEmitWarning(warning) {\n if (console && console.warn) console.warn(warning);\n}\n\nvar NumberIsNaN = Number.isNaN || function NumberIsNaN(value) {\n return value !== value;\n}\n\nfunction EventEmitter() {\n EventEmitter.init.call(this);\n}\nmodule.exports = EventEmitter;\nmodule.exports.once = once;\n\n// Backwards-compat with node 0.10.x\nEventEmitter.EventEmitter = EventEmitter;\n\nEventEmitter.prototype._events = undefined;\nEventEmitter.prototype._eventsCount = 0;\nEventEmitter.prototype._maxListeners = undefined;\n\n// By default EventEmitters will print a warning if more than 10 listeners are\n// added to it. This is a useful default which helps finding memory leaks.\nvar defaultMaxListeners = 10;\n\nfunction checkListener(listener) {\n if (typeof listener !== 'function') {\n throw new TypeError('The \"listener\" argument must be of type Function. Received type ' + typeof listener);\n }\n}\n\nObject.defineProperty(EventEmitter, 'defaultMaxListeners', {\n enumerable: true,\n get: function() {\n return defaultMaxListeners;\n },\n set: function(arg) {\n if (typeof arg !== 'number' || arg < 0 || NumberIsNaN(arg)) {\n throw new RangeError('The value of \"defaultMaxListeners\" is out of range. It must be a non-negative number. Received ' + arg + '.');\n }\n defaultMaxListeners = arg;\n }\n});\n\nEventEmitter.init = function() {\n\n if (this._events === undefined ||\n this._events === Object.getPrototypeOf(this)._events) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n }\n\n this._maxListeners = this._maxListeners || undefined;\n};\n\n// Obviously not all Emitters should be limited to 10. This function allows\n// that to be increased. Set to zero for unlimited.\nEventEmitter.prototype.setMaxListeners = function setMaxListeners(n) {\n if (typeof n !== 'number' || n < 0 || NumberIsNaN(n)) {\n throw new RangeError('The value of \"n\" is out of range. It must be a non-negative number. Received ' + n + '.');\n }\n this._maxListeners = n;\n return this;\n};\n\nfunction _getMaxListeners(that) {\n if (that._maxListeners === undefined)\n return EventEmitter.defaultMaxListeners;\n return that._maxListeners;\n}\n\nEventEmitter.prototype.getMaxListeners = function getMaxListeners() {\n return _getMaxListeners(this);\n};\n\nEventEmitter.prototype.emit = function emit(type) {\n var args = [];\n for (var i = 1; i < arguments.length; i++) args.push(arguments[i]);\n var doError = (type === 'error');\n\n var events = this._events;\n if (events !== undefined)\n doError = (doError && events.error === undefined);\n else if (!doError)\n return false;\n\n // If there is no 'error' event listener then throw.\n if (doError) {\n var er;\n if (args.length > 0)\n er = args[0];\n if (er instanceof Error) {\n // Note: The comments on the `throw` lines are intentional, they show\n // up in Node's output if this results in an unhandled exception.\n throw er; // Unhandled 'error' event\n }\n // At least give some kind of context to the user\n var err = new Error('Unhandled error.' + (er ? ' (' + er.message + ')' : ''));\n err.context = er;\n throw err; // Unhandled 'error' event\n }\n\n var handler = events[type];\n\n if (handler === undefined)\n return false;\n\n if (typeof handler === 'function') {\n ReflectApply(handler, this, args);\n } else {\n var len = handler.length;\n var listeners = arrayClone(handler, len);\n for (var i = 0; i < len; ++i)\n ReflectApply(listeners[i], this, args);\n }\n\n return true;\n};\n\nfunction _addListener(target, type, listener, prepend) {\n var m;\n var events;\n var existing;\n\n checkListener(listener);\n\n events = target._events;\n if (events === undefined) {\n events = target._events = Object.create(null);\n target._eventsCount = 0;\n } else {\n // To avoid recursion in the case that type === \"newListener\"! Before\n // adding it to the listeners, first emit \"newListener\".\n if (events.newListener !== undefined) {\n target.emit('newListener', type,\n listener.listener ? listener.listener : listener);\n\n // Re-assign `events` because a newListener handler could have caused the\n // this._events to be assigned to a new object\n events = target._events;\n }\n existing = events[type];\n }\n\n if (existing === undefined) {\n // Optimize the case of one listener. Don't need the extra array object.\n existing = events[type] = listener;\n ++target._eventsCount;\n } else {\n if (typeof existing === 'function') {\n // Adding the second element, need to change to array.\n existing = events[type] =\n prepend ? [listener, existing] : [existing, listener];\n // If we've already got an array, just append.\n } else if (prepend) {\n existing.unshift(listener);\n } else {\n existing.push(listener);\n }\n\n // Check for listener leak\n m = _getMaxListeners(target);\n if (m > 0 && existing.length > m && !existing.warned) {\n existing.warned = true;\n // No error code for this since it is a Warning\n // eslint-disable-next-line no-restricted-syntax\n var w = new Error('Possible EventEmitter memory leak detected. ' +\n existing.length + ' ' + String(type) + ' listeners ' +\n 'added. Use emitter.setMaxListeners() to ' +\n 'increase limit');\n w.name = 'MaxListenersExceededWarning';\n w.emitter = target;\n w.type = type;\n w.count = existing.length;\n ProcessEmitWarning(w);\n }\n }\n\n return target;\n}\n\nEventEmitter.prototype.addListener = function addListener(type, listener) {\n return _addListener(this, type, listener, false);\n};\n\nEventEmitter.prototype.on = EventEmitter.prototype.addListener;\n\nEventEmitter.prototype.prependListener =\n function prependListener(type, listener) {\n return _addListener(this, type, listener, true);\n };\n\nfunction onceWrapper() {\n if (!this.fired) {\n this.target.removeListener(this.type, this.wrapFn);\n this.fired = true;\n if (arguments.length === 0)\n return this.listener.call(this.target);\n return this.listener.apply(this.target, arguments);\n }\n}\n\nfunction _onceWrap(target, type, listener) {\n var state = { fired: false, wrapFn: undefined, target: target, type: type, listener: listener };\n var wrapped = onceWrapper.bind(state);\n wrapped.listener = listener;\n state.wrapFn = wrapped;\n return wrapped;\n}\n\nEventEmitter.prototype.once = function once(type, listener) {\n checkListener(listener);\n this.on(type, _onceWrap(this, type, listener));\n return this;\n};\n\nEventEmitter.prototype.prependOnceListener =\n function prependOnceListener(type, listener) {\n checkListener(listener);\n this.prependListener(type, _onceWrap(this, type, listener));\n return this;\n };\n\n// Emits a 'removeListener' event if and only if the listener was removed.\nEventEmitter.prototype.removeListener =\n function removeListener(type, listener) {\n var list, events, position, i, originalListener;\n\n checkListener(listener);\n\n events = this._events;\n if (events === undefined)\n return this;\n\n list = events[type];\n if (list === undefined)\n return this;\n\n if (list === listener || list.listener === listener) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else {\n delete events[type];\n if (events.removeListener)\n this.emit('removeListener', type, list.listener || listener);\n }\n } else if (typeof list !== 'function') {\n position = -1;\n\n for (i = list.length - 1; i >= 0; i--) {\n if (list[i] === listener || list[i].listener === listener) {\n originalListener = list[i].listener;\n position = i;\n break;\n }\n }\n\n if (position < 0)\n return this;\n\n if (position === 0)\n list.shift();\n else {\n spliceOne(list, position);\n }\n\n if (list.length === 1)\n events[type] = list[0];\n\n if (events.removeListener !== undefined)\n this.emit('removeListener', type, originalListener || listener);\n }\n\n return this;\n };\n\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\n\nEventEmitter.prototype.removeAllListeners =\n function removeAllListeners(type) {\n var listeners, events, i;\n\n events = this._events;\n if (events === undefined)\n return this;\n\n // not listening for removeListener, no need to emit\n if (events.removeListener === undefined) {\n if (arguments.length === 0) {\n this._events = Object.create(null);\n this._eventsCount = 0;\n } else if (events[type] !== undefined) {\n if (--this._eventsCount === 0)\n this._events = Object.create(null);\n else\n delete events[type];\n }\n return this;\n }\n\n // emit removeListener for all listeners on all events\n if (arguments.length === 0) {\n var keys = Object.keys(events);\n var key;\n for (i = 0; i < keys.length; ++i) {\n key = keys[i];\n if (key === 'removeListener') continue;\n this.removeAllListeners(key);\n }\n this.removeAllListeners('removeListener');\n this._events = Object.create(null);\n this._eventsCount = 0;\n return this;\n }\n\n listeners = events[type];\n\n if (typeof listeners === 'function') {\n this.removeListener(type, listeners);\n } else if (listeners !== undefined) {\n // LIFO order\n for (i = listeners.length - 1; i >= 0; i--) {\n this.removeListener(type, listeners[i]);\n }\n }\n\n return this;\n };\n\nfunction _listeners(target, type, unwrap) {\n var events = target._events;\n\n if (events === undefined)\n return [];\n\n var evlistener = events[type];\n if (evlistener === undefined)\n return [];\n\n if (typeof evlistener === 'function')\n return unwrap ? [evlistener.listener || evlistener] : [evlistener];\n\n return unwrap ?\n unwrapListeners(evlistener) : arrayClone(evlistener, evlistener.length);\n}\n\nEventEmitter.prototype.listeners = function listeners(type) {\n return _listeners(this, type, true);\n};\n\nEventEmitter.prototype.rawListeners = function rawListeners(type) {\n return _listeners(this, type, false);\n};\n\nEventEmitter.listenerCount = function(emitter, type) {\n if (typeof emitter.listenerCount === 'function') {\n return emitter.listenerCount(type);\n } else {\n return listenerCount.call(emitter, type);\n }\n};\n\nEventEmitter.prototype.listenerCount = listenerCount;\nfunction listenerCount(type) {\n var events = this._events;\n\n if (events !== undefined) {\n var evlistener = events[type];\n\n if (typeof evlistener === 'function') {\n return 1;\n } else if (evlistener !== undefined) {\n return evlistener.length;\n }\n }\n\n return 0;\n}\n\nEventEmitter.prototype.eventNames = function eventNames() {\n return this._eventsCount > 0 ? ReflectOwnKeys(this._events) : [];\n};\n\nfunction arrayClone(arr, n) {\n var copy = new Array(n);\n for (var i = 0; i < n; ++i)\n copy[i] = arr[i];\n return copy;\n}\n\nfunction spliceOne(list, index) {\n for (; index + 1 < list.length; index++)\n list[index] = list[index + 1];\n list.pop();\n}\n\nfunction unwrapListeners(arr) {\n var ret = new Array(arr.length);\n for (var i = 0; i < ret.length; ++i) {\n ret[i] = arr[i].listener || arr[i];\n }\n return ret;\n}\n\nfunction once(emitter, name) {\n return new Promise(function (resolve, reject) {\n function errorListener(err) {\n emitter.removeListener(name, resolver);\n reject(err);\n }\n\n function resolver() {\n if (typeof emitter.removeListener === 'function') {\n emitter.removeListener('error', errorListener);\n }\n resolve([].slice.call(arguments));\n };\n\n eventTargetAgnosticAddListener(emitter, name, resolver, { once: true });\n if (name !== 'error') {\n addErrorHandlerIfEventEmitter(emitter, errorListener, { once: true });\n }\n });\n}\n\nfunction addErrorHandlerIfEventEmitter(emitter, handler, flags) {\n if (typeof emitter.on === 'function') {\n eventTargetAgnosticAddListener(emitter, 'error', handler, flags);\n }\n}\n\nfunction eventTargetAgnosticAddListener(emitter, name, listener, flags) {\n if (typeof emitter.on === 'function') {\n if (flags.once) {\n emitter.once(name, listener);\n } else {\n emitter.on(name, listener);\n }\n } else if (typeof emitter.addEventListener === 'function') {\n // EventTarget does not have `error` event semantics like Node\n // EventEmitters, we do not listen for `error` events here.\n emitter.addEventListener(name, function wrapListener(arg) {\n // IE does not have builtin `{ once: true }` support so we\n // have to do it manually.\n if (flags.once) {\n emitter.removeEventListener(name, wrapListener);\n }\n listener(arg);\n });\n } else {\n throw new TypeError('The \"emitter\" argument must be of type EventEmitter. Received type ' + typeof emitter);\n }\n}\n","var Buffer = require('safe-buffer').Buffer\nvar MD5 = require('md5.js')\n\n/* eslint-disable camelcase */\nfunction EVP_BytesToKey (password, salt, keyBits, ivLen) {\n if (!Buffer.isBuffer(password)) password = Buffer.from(password, 'binary')\n if (salt) {\n if (!Buffer.isBuffer(salt)) salt = Buffer.from(salt, 'binary')\n if (salt.length !== 8) throw new RangeError('salt should be Buffer with 8 byte length')\n }\n\n var keyLen = keyBits / 8\n var key = Buffer.alloc(keyLen)\n var iv = Buffer.alloc(ivLen || 0)\n var tmp = Buffer.alloc(0)\n\n while (keyLen > 0 || ivLen > 0) {\n var hash = new MD5()\n hash.update(tmp)\n hash.update(password)\n if (salt) hash.update(salt)\n tmp = hash.digest()\n\n var used = 0\n\n if (keyLen > 0) {\n var keyStart = key.length - keyLen\n used = Math.min(keyLen, tmp.length)\n tmp.copy(key, keyStart, 0, used)\n keyLen -= used\n }\n\n if (used < tmp.length && ivLen > 0) {\n var ivStart = iv.length - ivLen\n var length = Math.min(ivLen, tmp.length - used)\n tmp.copy(iv, ivStart, used, used + length)\n ivLen -= length\n }\n }\n\n tmp.fill(0)\n return { key: key, iv: iv }\n}\n\nmodule.exports = EVP_BytesToKey\n","module.exports = class FixedFIFO {\n constructor (hwm) {\n if (!(hwm > 0) || ((hwm - 1) & hwm) !== 0) throw new Error('Max size for a FixedFIFO should be a power of two')\n this.buffer = new Array(hwm)\n this.mask = hwm - 1\n this.top = 0\n this.btm = 0\n this.next = null\n }\n\n push (data) {\n if (this.buffer[this.top] !== undefined) return false\n this.buffer[this.top] = data\n this.top = (this.top + 1) & this.mask\n return true\n }\n\n shift () {\n const last = this.buffer[this.btm]\n if (last === undefined) return undefined\n this.buffer[this.btm] = undefined\n this.btm = (this.btm + 1) & this.mask\n return last\n }\n\n peek () {\n return this.buffer[this.btm]\n }\n\n isEmpty () {\n return this.buffer[this.btm] === undefined\n }\n}\n","const FixedFIFO = require('./fixed-size')\n\nmodule.exports = class FastFIFO {\n constructor (hwm) {\n this.hwm = hwm || 16\n this.head = new FixedFIFO(this.hwm)\n this.tail = this.head\n }\n\n push (val) {\n if (!this.head.push(val)) {\n const prev = this.head\n this.head = prev.next = new FixedFIFO(2 * this.head.buffer.length)\n this.head.push(val)\n }\n }\n\n shift () {\n const val = this.tail.shift()\n if (val === undefined && this.tail.next) {\n const next = this.tail.next\n this.tail.next = null\n this.tail = next\n return this.tail.shift()\n }\n return val\n }\n\n peek () {\n return this.tail.peek()\n }\n\n isEmpty () {\n return this.head.isEmpty()\n }\n}\n","/* global FileReader */\n\nconst { Readable } = require('readable-stream')\nconst toBuffer = require('typedarray-to-buffer')\n\nclass FileReadStream extends Readable {\n constructor (file, opts = {}) {\n super(opts)\n\n // save the read offset\n this._offset = 0\n this._ready = false\n this._file = file\n this._size = file.size\n this._chunkSize = opts.chunkSize || Math.max(this._size / 1000, 200 * 1024)\n\n // create the reader\n const reader = new FileReader()\n\n reader.onload = () => {\n // get the data chunk\n this.push(toBuffer(reader.result))\n }\n reader.onerror = () => {\n this.emit('error', reader.error)\n }\n\n this.reader = reader\n\n // generate the header blocks that we will send as part of the initial payload\n this._generateHeaderBlocks(file, opts, (err, blocks) => {\n // if we encountered an error, emit it\n if (err) {\n return this.emit('error', err)\n }\n\n // push the header blocks out to the stream\n if (Array.isArray(blocks)) {\n blocks.forEach(block => this.push(block))\n }\n\n this._ready = true\n this.emit('_ready')\n })\n }\n\n _generateHeaderBlocks (file, opts, callback) {\n callback(null, [])\n }\n\n _read () {\n if (!this._ready) {\n this.once('_ready', this._read.bind(this))\n return\n }\n\n const startOffset = this._offset\n let endOffset = this._offset + this._chunkSize\n if (endOffset > this._size) endOffset = this._size\n\n if (startOffset === this._size) {\n this.destroy()\n this.push(null)\n return\n }\n\n this.reader.readAsArrayBuffer(this._file.slice(startOffset, endOffset))\n\n // update the stream offset\n this._offset = endOffset\n }\n\n destroy () {\n this._file = null\n if (this.reader) {\n this.reader.onload = null\n this.reader.onerror = null\n try { this.reader.abort() } catch (e) {};\n }\n this.reader = null\n }\n}\n\nmodule.exports = FileReadStream\n","\nvar hasOwn = Object.prototype.hasOwnProperty;\nvar toString = Object.prototype.toString;\n\nmodule.exports = function forEach (obj, fn, ctx) {\n if (toString.call(fn) !== '[object Function]') {\n throw new TypeError('iterator must be a function');\n }\n var l = obj.length;\n if (l === +l) {\n for (var i = 0; i < l; i++) {\n fn.call(ctx, obj[i], i, obj);\n }\n } else {\n for (var k in obj) {\n if (hasOwn.call(obj, k)) {\n fn.call(ctx, obj[k], k, obj);\n }\n }\n }\n};\n\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n var target = this;\n if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n throw new TypeError(ERROR_MESSAGE + target);\n }\n var args = slice.call(arguments, 1);\n\n var bound;\n var binder = function () {\n if (this instanceof bound) {\n var result = target.apply(\n this,\n args.concat(slice.call(arguments))\n );\n if (Object(result) === result) {\n return result;\n }\n return this;\n } else {\n return target.apply(\n that,\n args.concat(slice.call(arguments))\n );\n }\n };\n\n var boundLength = Math.max(0, target.length - args.length);\n var boundArgs = [];\n for (var i = 0; i < boundLength; i++) {\n boundArgs.push('$' + i);\n }\n\n bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n if (target.prototype) {\n var Empty = function Empty() {};\n Empty.prototype = target.prototype;\n bound.prototype = new Empty();\n Empty.prototype = null;\n }\n\n return bound;\n};\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = Function.prototype.bind || implementation;\n","// originally pulled out of simple-peer\n\nmodule.exports = function getBrowserRTC () {\n if (typeof globalThis === 'undefined') return null\n var wrtc = {\n RTCPeerConnection: globalThis.RTCPeerConnection || globalThis.mozRTCPeerConnection ||\n globalThis.webkitRTCPeerConnection,\n RTCSessionDescription: globalThis.RTCSessionDescription ||\n globalThis.mozRTCSessionDescription || globalThis.webkitRTCSessionDescription,\n RTCIceCandidate: globalThis.RTCIceCandidate || globalThis.mozRTCIceCandidate ||\n globalThis.webkitRTCIceCandidate\n }\n if (!wrtc.RTCPeerConnection) return null\n return wrtc\n}\n","'use strict';\n\nvar undefined;\n\nvar $SyntaxError = SyntaxError;\nvar $Function = Function;\nvar $TypeError = TypeError;\n\n// eslint-disable-next-line consistent-return\nvar getEvalledConstructor = function (expressionSyntax) {\n\ttry {\n\t\treturn $Function('\"use strict\"; return (' + expressionSyntax + ').constructor;')();\n\t} catch (e) {}\n};\n\nvar $gOPD = Object.getOwnPropertyDescriptor;\nif ($gOPD) {\n\ttry {\n\t\t$gOPD({}, '');\n\t} catch (e) {\n\t\t$gOPD = null; // this is IE 8, which has a broken gOPD\n\t}\n}\n\nvar throwTypeError = function () {\n\tthrow new $TypeError();\n};\nvar ThrowTypeError = $gOPD\n\t? (function () {\n\t\ttry {\n\t\t\t// eslint-disable-next-line no-unused-expressions, no-caller, no-restricted-properties\n\t\t\targuments.callee; // IE 8 does not throw here\n\t\t\treturn throwTypeError;\n\t\t} catch (calleeThrows) {\n\t\t\ttry {\n\t\t\t\t// IE 8 throws on Object.getOwnPropertyDescriptor(arguments, '')\n\t\t\t\treturn $gOPD(arguments, 'callee').get;\n\t\t\t} catch (gOPDthrows) {\n\t\t\t\treturn throwTypeError;\n\t\t\t}\n\t\t}\n\t}())\n\t: throwTypeError;\n\nvar hasSymbols = require('has-symbols')();\n\nvar getProto = Object.getPrototypeOf || function (x) { return x.__proto__; }; // eslint-disable-line no-proto\n\nvar needsEval = {};\n\nvar TypedArray = typeof Uint8Array === 'undefined' ? undefined : getProto(Uint8Array);\n\nvar INTRINSICS = {\n\t'%AggregateError%': typeof AggregateError === 'undefined' ? undefined : AggregateError,\n\t'%Array%': Array,\n\t'%ArrayBuffer%': typeof ArrayBuffer === 'undefined' ? undefined : ArrayBuffer,\n\t'%ArrayIteratorPrototype%': hasSymbols ? getProto([][Symbol.iterator]()) : undefined,\n\t'%AsyncFromSyncIteratorPrototype%': undefined,\n\t'%AsyncFunction%': needsEval,\n\t'%AsyncGenerator%': needsEval,\n\t'%AsyncGeneratorFunction%': needsEval,\n\t'%AsyncIteratorPrototype%': needsEval,\n\t'%Atomics%': typeof Atomics === 'undefined' ? undefined : Atomics,\n\t'%BigInt%': typeof BigInt === 'undefined' ? undefined : BigInt,\n\t'%Boolean%': Boolean,\n\t'%DataView%': typeof DataView === 'undefined' ? undefined : DataView,\n\t'%Date%': Date,\n\t'%decodeURI%': decodeURI,\n\t'%decodeURIComponent%': decodeURIComponent,\n\t'%encodeURI%': encodeURI,\n\t'%encodeURIComponent%': encodeURIComponent,\n\t'%Error%': Error,\n\t'%eval%': eval, // eslint-disable-line no-eval\n\t'%EvalError%': EvalError,\n\t'%Float32Array%': typeof Float32Array === 'undefined' ? undefined : Float32Array,\n\t'%Float64Array%': typeof Float64Array === 'undefined' ? undefined : Float64Array,\n\t'%FinalizationRegistry%': typeof FinalizationRegistry === 'undefined' ? undefined : FinalizationRegistry,\n\t'%Function%': $Function,\n\t'%GeneratorFunction%': needsEval,\n\t'%Int8Array%': typeof Int8Array === 'undefined' ? undefined : Int8Array,\n\t'%Int16Array%': typeof Int16Array === 'undefined' ? undefined : Int16Array,\n\t'%Int32Array%': typeof Int32Array === 'undefined' ? undefined : Int32Array,\n\t'%isFinite%': isFinite,\n\t'%isNaN%': isNaN,\n\t'%IteratorPrototype%': hasSymbols ? getProto(getProto([][Symbol.iterator]())) : undefined,\n\t'%JSON%': typeof JSON === 'object' ? JSON : undefined,\n\t'%Map%': typeof Map === 'undefined' ? undefined : Map,\n\t'%MapIteratorPrototype%': typeof Map === 'undefined' || !hasSymbols ? undefined : getProto(new Map()[Symbol.iterator]()),\n\t'%Math%': Math,\n\t'%Number%': Number,\n\t'%Object%': Object,\n\t'%parseFloat%': parseFloat,\n\t'%parseInt%': parseInt,\n\t'%Promise%': typeof Promise === 'undefined' ? undefined : Promise,\n\t'%Proxy%': typeof Proxy === 'undefined' ? undefined : Proxy,\n\t'%RangeError%': RangeError,\n\t'%ReferenceError%': ReferenceError,\n\t'%Reflect%': typeof Reflect === 'undefined' ? undefined : Reflect,\n\t'%RegExp%': RegExp,\n\t'%Set%': typeof Set === 'undefined' ? undefined : Set,\n\t'%SetIteratorPrototype%': typeof Set === 'undefined' || !hasSymbols ? undefined : getProto(new Set()[Symbol.iterator]()),\n\t'%SharedArrayBuffer%': typeof SharedArrayBuffer === 'undefined' ? undefined : SharedArrayBuffer,\n\t'%String%': String,\n\t'%StringIteratorPrototype%': hasSymbols ? getProto(''[Symbol.iterator]()) : undefined,\n\t'%Symbol%': hasSymbols ? Symbol : undefined,\n\t'%SyntaxError%': $SyntaxError,\n\t'%ThrowTypeError%': ThrowTypeError,\n\t'%TypedArray%': TypedArray,\n\t'%TypeError%': $TypeError,\n\t'%Uint8Array%': typeof Uint8Array === 'undefined' ? undefined : Uint8Array,\n\t'%Uint8ClampedArray%': typeof Uint8ClampedArray === 'undefined' ? undefined : Uint8ClampedArray,\n\t'%Uint16Array%': typeof Uint16Array === 'undefined' ? undefined : Uint16Array,\n\t'%Uint32Array%': typeof Uint32Array === 'undefined' ? undefined : Uint32Array,\n\t'%URIError%': URIError,\n\t'%WeakMap%': typeof WeakMap === 'undefined' ? undefined : WeakMap,\n\t'%WeakRef%': typeof WeakRef === 'undefined' ? undefined : WeakRef,\n\t'%WeakSet%': typeof WeakSet === 'undefined' ? undefined : WeakSet\n};\n\nvar doEval = function doEval(name) {\n\tvar value;\n\tif (name === '%AsyncFunction%') {\n\t\tvalue = getEvalledConstructor('async function () {}');\n\t} else if (name === '%GeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('function* () {}');\n\t} else if (name === '%AsyncGeneratorFunction%') {\n\t\tvalue = getEvalledConstructor('async function* () {}');\n\t} else if (name === '%AsyncGenerator%') {\n\t\tvar fn = doEval('%AsyncGeneratorFunction%');\n\t\tif (fn) {\n\t\t\tvalue = fn.prototype;\n\t\t}\n\t} else if (name === '%AsyncIteratorPrototype%') {\n\t\tvar gen = doEval('%AsyncGenerator%');\n\t\tif (gen) {\n\t\t\tvalue = getProto(gen.prototype);\n\t\t}\n\t}\n\n\tINTRINSICS[name] = value;\n\n\treturn value;\n};\n\nvar LEGACY_ALIASES = {\n\t'%ArrayBufferPrototype%': ['ArrayBuffer', 'prototype'],\n\t'%ArrayPrototype%': ['Array', 'prototype'],\n\t'%ArrayProto_entries%': ['Array', 'prototype', 'entries'],\n\t'%ArrayProto_forEach%': ['Array', 'prototype', 'forEach'],\n\t'%ArrayProto_keys%': ['Array', 'prototype', 'keys'],\n\t'%ArrayProto_values%': ['Array', 'prototype', 'values'],\n\t'%AsyncFunctionPrototype%': ['AsyncFunction', 'prototype'],\n\t'%AsyncGenerator%': ['AsyncGeneratorFunction', 'prototype'],\n\t'%AsyncGeneratorPrototype%': ['AsyncGeneratorFunction', 'prototype', 'prototype'],\n\t'%BooleanPrototype%': ['Boolean', 'prototype'],\n\t'%DataViewPrototype%': ['DataView', 'prototype'],\n\t'%DatePrototype%': ['Date', 'prototype'],\n\t'%ErrorPrototype%': ['Error', 'prototype'],\n\t'%EvalErrorPrototype%': ['EvalError', 'prototype'],\n\t'%Float32ArrayPrototype%': ['Float32Array', 'prototype'],\n\t'%Float64ArrayPrototype%': ['Float64Array', 'prototype'],\n\t'%FunctionPrototype%': ['Function', 'prototype'],\n\t'%Generator%': ['GeneratorFunction', 'prototype'],\n\t'%GeneratorPrototype%': ['GeneratorFunction', 'prototype', 'prototype'],\n\t'%Int8ArrayPrototype%': ['Int8Array', 'prototype'],\n\t'%Int16ArrayPrototype%': ['Int16Array', 'prototype'],\n\t'%Int32ArrayPrototype%': ['Int32Array', 'prototype'],\n\t'%JSONParse%': ['JSON', 'parse'],\n\t'%JSONStringify%': ['JSON', 'stringify'],\n\t'%MapPrototype%': ['Map', 'prototype'],\n\t'%NumberPrototype%': ['Number', 'prototype'],\n\t'%ObjectPrototype%': ['Object', 'prototype'],\n\t'%ObjProto_toString%': ['Object', 'prototype', 'toString'],\n\t'%ObjProto_valueOf%': ['Object', 'prototype', 'valueOf'],\n\t'%PromisePrototype%': ['Promise', 'prototype'],\n\t'%PromiseProto_then%': ['Promise', 'prototype', 'then'],\n\t'%Promise_all%': ['Promise', 'all'],\n\t'%Promise_reject%': ['Promise', 'reject'],\n\t'%Promise_resolve%': ['Promise', 'resolve'],\n\t'%RangeErrorPrototype%': ['RangeError', 'prototype'],\n\t'%ReferenceErrorPrototype%': ['ReferenceError', 'prototype'],\n\t'%RegExpPrototype%': ['RegExp', 'prototype'],\n\t'%SetPrototype%': ['Set', 'prototype'],\n\t'%SharedArrayBufferPrototype%': ['SharedArrayBuffer', 'prototype'],\n\t'%StringPrototype%': ['String', 'prototype'],\n\t'%SymbolPrototype%': ['Symbol', 'prototype'],\n\t'%SyntaxErrorPrototype%': ['SyntaxError', 'prototype'],\n\t'%TypedArrayPrototype%': ['TypedArray', 'prototype'],\n\t'%TypeErrorPrototype%': ['TypeError', 'prototype'],\n\t'%Uint8ArrayPrototype%': ['Uint8Array', 'prototype'],\n\t'%Uint8ClampedArrayPrototype%': ['Uint8ClampedArray', 'prototype'],\n\t'%Uint16ArrayPrototype%': ['Uint16Array', 'prototype'],\n\t'%Uint32ArrayPrototype%': ['Uint32Array', 'prototype'],\n\t'%URIErrorPrototype%': ['URIError', 'prototype'],\n\t'%WeakMapPrototype%': ['WeakMap', 'prototype'],\n\t'%WeakSetPrototype%': ['WeakSet', 'prototype']\n};\n\nvar bind = require('function-bind');\nvar hasOwn = require('has');\nvar $concat = bind.call(Function.call, Array.prototype.concat);\nvar $spliceApply = bind.call(Function.apply, Array.prototype.splice);\nvar $replace = bind.call(Function.call, String.prototype.replace);\nvar $strSlice = bind.call(Function.call, String.prototype.slice);\n\n/* adapted from https://github.com/lodash/lodash/blob/4.17.15/dist/lodash.js#L6735-L6744 */\nvar rePropName = /[^%.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|%$))/g;\nvar reEscapeChar = /\\\\(\\\\)?/g; /** Used to match backslashes in property paths. */\nvar stringToPath = function stringToPath(string) {\n\tvar first = $strSlice(string, 0, 1);\n\tvar last = $strSlice(string, -1);\n\tif (first === '%' && last !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected closing `%`');\n\t} else if (last === '%' && first !== '%') {\n\t\tthrow new $SyntaxError('invalid intrinsic syntax, expected opening `%`');\n\t}\n\tvar result = [];\n\t$replace(string, rePropName, function (match, number, quote, subString) {\n\t\tresult[result.length] = quote ? $replace(subString, reEscapeChar, '$1') : number || match;\n\t});\n\treturn result;\n};\n/* end adaptation */\n\nvar getBaseIntrinsic = function getBaseIntrinsic(name, allowMissing) {\n\tvar intrinsicName = name;\n\tvar alias;\n\tif (hasOwn(LEGACY_ALIASES, intrinsicName)) {\n\t\talias = LEGACY_ALIASES[intrinsicName];\n\t\tintrinsicName = '%' + alias[0] + '%';\n\t}\n\n\tif (hasOwn(INTRINSICS, intrinsicName)) {\n\t\tvar value = INTRINSICS[intrinsicName];\n\t\tif (value === needsEval) {\n\t\t\tvalue = doEval(intrinsicName);\n\t\t}\n\t\tif (typeof value === 'undefined' && !allowMissing) {\n\t\t\tthrow new $TypeError('intrinsic ' + name + ' exists, but is not available. Please file an issue!');\n\t\t}\n\n\t\treturn {\n\t\t\talias: alias,\n\t\t\tname: intrinsicName,\n\t\t\tvalue: value\n\t\t};\n\t}\n\n\tthrow new $SyntaxError('intrinsic ' + name + ' does not exist!');\n};\n\nmodule.exports = function GetIntrinsic(name, allowMissing) {\n\tif (typeof name !== 'string' || name.length === 0) {\n\t\tthrow new $TypeError('intrinsic name must be a non-empty string');\n\t}\n\tif (arguments.length > 1 && typeof allowMissing !== 'boolean') {\n\t\tthrow new $TypeError('\"allowMissing\" argument must be a boolean');\n\t}\n\n\tvar parts = stringToPath(name);\n\tvar intrinsicBaseName = parts.length > 0 ? parts[0] : '';\n\n\tvar intrinsic = getBaseIntrinsic('%' + intrinsicBaseName + '%', allowMissing);\n\tvar intrinsicRealName = intrinsic.name;\n\tvar value = intrinsic.value;\n\tvar skipFurtherCaching = false;\n\n\tvar alias = intrinsic.alias;\n\tif (alias) {\n\t\tintrinsicBaseName = alias[0];\n\t\t$spliceApply(parts, $concat([0, 1], alias));\n\t}\n\n\tfor (var i = 1, isOwn = true; i < parts.length; i += 1) {\n\t\tvar part = parts[i];\n\t\tvar first = $strSlice(part, 0, 1);\n\t\tvar last = $strSlice(part, -1);\n\t\tif (\n\t\t\t(\n\t\t\t\t(first === '\"' || first === \"'\" || first === '`')\n\t\t\t\t|| (last === '\"' || last === \"'\" || last === '`')\n\t\t\t)\n\t\t\t&& first !== last\n\t\t) {\n\t\t\tthrow new $SyntaxError('property names with quotes must have matching quotes');\n\t\t}\n\t\tif (part === 'constructor' || !isOwn) {\n\t\t\tskipFurtherCaching = true;\n\t\t}\n\n\t\tintrinsicBaseName += '.' + part;\n\t\tintrinsicRealName = '%' + intrinsicBaseName + '%';\n\n\t\tif (hasOwn(INTRINSICS, intrinsicRealName)) {\n\t\t\tvalue = INTRINSICS[intrinsicRealName];\n\t\t} else if (value != null) {\n\t\t\tif (!(part in value)) {\n\t\t\t\tif (!allowMissing) {\n\t\t\t\t\tthrow new $TypeError('base intrinsic for ' + name + ' exists, but the property is not available.');\n\t\t\t\t}\n\t\t\t\treturn void undefined;\n\t\t\t}\n\t\t\tif ($gOPD && (i + 1) >= parts.length) {\n\t\t\t\tvar desc = $gOPD(value, part);\n\t\t\t\tisOwn = !!desc;\n\n\t\t\t\t// By convention, when a data property is converted to an accessor\n\t\t\t\t// property to emulate a data property that does not suffer from\n\t\t\t\t// the override mistake, that accessor's getter is marked with\n\t\t\t\t// an `originalValue` property. Here, when we detect this, we\n\t\t\t\t// uphold the illusion by pretending to see that original data\n\t\t\t\t// property, i.e., returning the value rather than the getter\n\t\t\t\t// itself.\n\t\t\t\tif (isOwn && 'get' in desc && !('originalValue' in desc.get)) {\n\t\t\t\t\tvalue = desc.get;\n\t\t\t\t} else {\n\t\t\t\t\tvalue = value[part];\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\tisOwn = hasOwn(value, part);\n\t\t\t\tvalue = value[part];\n\t\t\t}\n\n\t\t\tif (isOwn && !skipFurtherCaching) {\n\t\t\t\tINTRINSICS[intrinsicRealName] = value;\n\t\t\t}\n\t\t}\n\t}\n\treturn value;\n};\n","'use strict';\n\nvar origSymbol = typeof Symbol !== 'undefined' && Symbol;\nvar hasSymbolSham = require('./shams');\n\nmodule.exports = function hasNativeSymbols() {\n\tif (typeof origSymbol !== 'function') { return false; }\n\tif (typeof Symbol !== 'function') { return false; }\n\tif (typeof origSymbol('foo') !== 'symbol') { return false; }\n\tif (typeof Symbol('bar') !== 'symbol') { return false; }\n\n\treturn hasSymbolSham();\n};\n","'use strict';\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\nvar hasSymbols = require('has-symbols/shams');\n\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\n};\n","'use strict';\n\nvar bind = require('function-bind');\n\nmodule.exports = bind.call(Function.call, Object.prototype.hasOwnProperty);\n","'use strict'\nvar Buffer = require('safe-buffer').Buffer\nvar Transform = require('readable-stream').Transform\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\n this._block = Buffer.allocUnsafe(blockSize)\n this._blockSize = blockSize\n this._blockOffset = 0\n this._length = [0, 0, 0, 0]\n\n this._finalized = false\n}\n\ninherits(HashBase, Transform)\n\nHashBase.prototype._transform = function (chunk, encoding, callback) {\n var error = null\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 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)\n\n // consume data\n var block = this._block\n var offset = 0\n while (this._blockOffset + data.length - offset >= this._blockSize) {\n for (var i = this._blockOffset; i < this._blockSize;) block[i++] = data[offset++]\n this._update()\n this._blockOffset = 0\n }\n while (offset < data.length) block[this._blockOffset++] = data[offset++]\n\n // update length\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 if (encoding !== undefined) digest = digest.toString(encoding)\n\n // reset state\n this._block.fill(0)\n this._blockOffset = 0\n for (var i = 0; i < 4; ++i) this._length[i] = 0\n\n return digest\n}\n\nHashBase.prototype._digest = function () {\n throw new Error('_digest is not implemented')\n}\n\nmodule.exports = HashBase\n","var hash = exports;\n\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');\n\n// Proxy hash functions to the main object\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;\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction BlockHash() {\n this.pending = null;\n this.pendingTotal = 0;\n this.blockSize = this.constructor.blockSize;\n this.outSize = this.constructor.outSize;\n this.hmacStrength = this.constructor.hmacStrength;\n this.padLength = this.constructor.padLength / 8;\n this.endian = 'big';\n\n this._delta8 = this.blockSize / 8;\n this._delta32 = this.blockSize / 32;\n}\nexports.BlockHash = BlockHash;\n\nBlockHash.prototype.update = function update(msg, enc) {\n // Convert message to array, pad it, and join into 32bit blocks\n msg = utils.toArray(msg, enc);\n if (!this.pending)\n this.pending = msg;\n else\n this.pending = this.pending.concat(msg);\n this.pendingTotal += msg.length;\n\n // Enough data, try updating\n if (this.pending.length >= this._delta8) {\n msg = this.pending;\n\n // Process pending data in blocks\n var r = msg.length % this._delta8;\n this.pending = msg.slice(msg.length - r, msg.length);\n if (this.pending.length === 0)\n this.pending = null;\n\n msg = utils.join32(msg, 0, msg.length - r, this.endian);\n for (var i = 0; i < msg.length; i += this._delta32)\n this._update(msg, i, i + this._delta32);\n }\n\n return this;\n};\n\nBlockHash.prototype.digest = function digest(enc) {\n this.update(this._pad());\n assert(this.pending === null);\n\n return this._digest(enc);\n};\n\nBlockHash.prototype._pad = function pad() {\n var len = this.pendingTotal;\n var bytes = this._delta8;\n var k = bytes - ((len + this.padLength) % bytes);\n var res = new Array(k + this.padLength);\n res[0] = 0x80;\n for (var i = 1; i < k; i++)\n res[i] = 0;\n\n // Append length\n len <<= 3;\n if (this.endian === 'big') {\n for (var t = 8; t < this.padLength; t++)\n res[i++] = 0;\n\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = len & 0xff;\n } else {\n res[i++] = len & 0xff;\n res[i++] = (len >>> 8) & 0xff;\n res[i++] = (len >>> 16) & 0xff;\n res[i++] = (len >>> 24) & 0xff;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n res[i++] = 0;\n\n for (t = 8; t < this.padLength; t++)\n res[i++] = 0;\n }\n\n return res;\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar assert = require('minimalistic-assert');\n\nfunction Hmac(hash, key, enc) {\n if (!(this instanceof Hmac))\n return new Hmac(hash, key, enc);\n this.Hash = hash;\n this.blockSize = hash.blockSize / 8;\n this.outSize = hash.outSize / 8;\n this.inner = null;\n this.outer = null;\n\n this._init(utils.toArray(key, enc));\n}\nmodule.exports = Hmac;\n\nHmac.prototype._init = function init(key) {\n // Shorten key, if needed\n if (key.length > this.blockSize)\n key = new this.Hash().update(key).digest();\n assert(key.length <= this.blockSize);\n\n // Add padding to key\n for (var i = key.length; i < this.blockSize; i++)\n key.push(0);\n\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x36;\n this.inner = new this.Hash().update(key);\n\n // 0x36 ^ 0x5c = 0x6a\n for (i = 0; i < key.length; i++)\n key[i] ^= 0x6a;\n this.outer = new this.Hash().update(key);\n};\n\nHmac.prototype.update = function update(msg, enc) {\n this.inner.update(msg, enc);\n return this;\n};\n\nHmac.prototype.digest = function digest(enc) {\n this.outer.update(this.inner.digest());\n return this.outer.digest(enc);\n};\n","'use strict';\n\nvar utils = require('./utils');\nvar common = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_3 = utils.sum32_3;\nvar sum32_4 = utils.sum32_4;\nvar BlockHash = common.BlockHash;\n\nfunction RIPEMD160() {\n if (!(this instanceof RIPEMD160))\n return new RIPEMD160();\n\n BlockHash.call(this);\n\n this.h = [ 0x67452301, 0xefcdab89, 0x98badcfe, 0x10325476, 0xc3d2e1f0 ];\n this.endian = 'little';\n}\nutils.inherits(RIPEMD160, BlockHash);\nexports.ripemd160 = RIPEMD160;\n\nRIPEMD160.blockSize = 512;\nRIPEMD160.outSize = 160;\nRIPEMD160.hmacStrength = 192;\nRIPEMD160.padLength = 64;\n\nRIPEMD160.prototype._update = function update(msg, start) {\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 Ah = A;\n var Bh = B;\n var Ch = C;\n var Dh = D;\n var Eh = E;\n for (var j = 0; j < 80; j++) {\n var T = sum32(\n rotl32(\n sum32_4(A, f(j, B, C, D), msg[r[j] + start], K(j)),\n s[j]),\n E);\n A = E;\n E = D;\n D = rotl32(C, 10);\n C = B;\n B = T;\n T = sum32(\n rotl32(\n sum32_4(Ah, f(79 - j, Bh, Ch, Dh), msg[rh[j] + start], Kh(j)),\n sh[j]),\n Eh);\n Ah = Eh;\n Eh = Dh;\n Dh = rotl32(Ch, 10);\n Ch = Bh;\n Bh = T;\n }\n T = sum32_3(this.h[1], C, Dh);\n this.h[1] = sum32_3(this.h[2], D, Eh);\n this.h[2] = sum32_3(this.h[3], E, Ah);\n this.h[3] = sum32_3(this.h[4], A, Bh);\n this.h[4] = sum32_3(this.h[0], B, Ch);\n this.h[0] = T;\n};\n\nRIPEMD160.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'little');\n else\n return utils.split32(this.h, 'little');\n};\n\nfunction f(j, x, y, z) {\n if (j <= 15)\n return x ^ y ^ z;\n else if (j <= 31)\n return (x & y) | ((~x) & z);\n else if (j <= 47)\n return (x | (~y)) ^ z;\n else if (j <= 63)\n return (x & z) | (y & (~z));\n else\n return x ^ (y | (~z));\n}\n\nfunction K(j) {\n if (j <= 15)\n return 0x00000000;\n else if (j <= 31)\n return 0x5a827999;\n else if (j <= 47)\n return 0x6ed9eba1;\n else if (j <= 63)\n return 0x8f1bbcdc;\n else\n return 0xa953fd4e;\n}\n\nfunction Kh(j) {\n if (j <= 15)\n return 0x50a28be6;\n else if (j <= 31)\n return 0x5c4dd124;\n else if (j <= 47)\n return 0x6d703ef3;\n else if (j <= 63)\n return 0x7a6d76e9;\n else\n return 0x00000000;\n}\n\nvar r = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n];\n\nvar rh = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n];\n\nvar s = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n];\n\nvar sh = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n];\n","'use strict';\n\nexports.sha1 = require('./sha/1');\nexports.sha224 = require('./sha/224');\nexports.sha256 = require('./sha/256');\nexports.sha384 = require('./sha/384');\nexports.sha512 = require('./sha/512');\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\n\nvar rotl32 = utils.rotl32;\nvar sum32 = utils.sum32;\nvar sum32_5 = utils.sum32_5;\nvar ft_1 = shaCommon.ft_1;\nvar BlockHash = common.BlockHash;\n\nvar sha1_K = [\n 0x5A827999, 0x6ED9EBA1,\n 0x8F1BBCDC, 0xCA62C1D6\n];\n\nfunction SHA1() {\n if (!(this instanceof SHA1))\n return new SHA1();\n\n BlockHash.call(this);\n this.h = [\n 0x67452301, 0xefcdab89, 0x98badcfe,\n 0x10325476, 0xc3d2e1f0 ];\n this.W = new Array(80);\n}\n\nutils.inherits(SHA1, BlockHash);\nmodule.exports = SHA1;\n\nSHA1.blockSize = 512;\nSHA1.outSize = 160;\nSHA1.hmacStrength = 80;\nSHA1.padLength = 64;\n\nSHA1.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 for(; i < W.length; i++)\n W[i] = rotl32(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16], 1);\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\n for (i = 0; i < W.length; i++) {\n var s = ~~(i / 20);\n var t = sum32_5(rotl32(a, 5), ft_1(s, b, c, d), e, W[i], sha1_K[s]);\n e = d;\n d = c;\n c = rotl32(b, 30);\n b = a;\n a = t;\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};\n\nSHA1.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar SHA256 = require('./256');\n\nfunction SHA224() {\n if (!(this instanceof SHA224))\n return new SHA224();\n\n SHA256.call(this);\n this.h = [\n 0xc1059ed8, 0x367cd507, 0x3070dd17, 0xf70e5939,\n 0xffc00b31, 0x68581511, 0x64f98fa7, 0xbefa4fa4 ];\n}\nutils.inherits(SHA224, SHA256);\nmodule.exports = SHA224;\n\nSHA224.blockSize = 512;\nSHA224.outSize = 224;\nSHA224.hmacStrength = 192;\nSHA224.padLength = 64;\n\nSHA224.prototype._digest = function digest(enc) {\n // Just truncate output\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 7), 'big');\n else\n return utils.split32(this.h.slice(0, 7), 'big');\n};\n\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\nvar shaCommon = require('./common');\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;\n\nvar BlockHash = common.BlockHash;\n\nvar sha256_K = [\n 0x428a2f98, 0x71374491, 0xb5c0fbcf, 0xe9b5dba5,\n 0x3956c25b, 0x59f111f1, 0x923f82a4, 0xab1c5ed5,\n 0xd807aa98, 0x12835b01, 0x243185be, 0x550c7dc3,\n 0x72be5d74, 0x80deb1fe, 0x9bdc06a7, 0xc19bf174,\n 0xe49b69c1, 0xefbe4786, 0x0fc19dc6, 0x240ca1cc,\n 0x2de92c6f, 0x4a7484aa, 0x5cb0a9dc, 0x76f988da,\n 0x983e5152, 0xa831c66d, 0xb00327c8, 0xbf597fc7,\n 0xc6e00bf3, 0xd5a79147, 0x06ca6351, 0x14292967,\n 0x27b70a85, 0x2e1b2138, 0x4d2c6dfc, 0x53380d13,\n 0x650a7354, 0x766a0abb, 0x81c2c92e, 0x92722c85,\n 0xa2bfe8a1, 0xa81a664b, 0xc24b8b70, 0xc76c51a3,\n 0xd192e819, 0xd6990624, 0xf40e3585, 0x106aa070,\n 0x19a4c116, 0x1e376c08, 0x2748774c, 0x34b0bcb5,\n 0x391c0cb3, 0x4ed8aa4a, 0x5b9cca4f, 0x682e6ff3,\n 0x748f82ee, 0x78a5636f, 0x84c87814, 0x8cc70208,\n 0x90befffa, 0xa4506ceb, 0xbef9a3f7, 0xc67178f2\n];\n\nfunction SHA256() {\n if (!(this instanceof SHA256))\n return new SHA256();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xbb67ae85, 0x3c6ef372, 0xa54ff53a,\n 0x510e527f, 0x9b05688c, 0x1f83d9ab, 0x5be0cd19\n ];\n this.k = sha256_K;\n this.W = new Array(64);\n}\nutils.inherits(SHA256, BlockHash);\nmodule.exports = SHA256;\n\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 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 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\n assert(this.k.length === W.length);\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')\n return utils.toHex32(this.h, 'big');\n else\n return utils.split32(this.h, 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\n\nvar SHA512 = require('./512');\n\nfunction SHA384() {\n if (!(this instanceof SHA384))\n return new SHA384();\n\n SHA512.call(this);\n this.h = [\n 0xcbbb9d5d, 0xc1059ed8,\n 0x629a292a, 0x367cd507,\n 0x9159015a, 0x3070dd17,\n 0x152fecd8, 0xf70e5939,\n 0x67332667, 0xffc00b31,\n 0x8eb44a87, 0x68581511,\n 0xdb0c2e0d, 0x64f98fa7,\n 0x47b5481d, 0xbefa4fa4 ];\n}\nutils.inherits(SHA384, SHA512);\nmodule.exports = SHA384;\n\nSHA384.blockSize = 1024;\nSHA384.outSize = 384;\nSHA384.hmacStrength = 192;\nSHA384.padLength = 128;\n\nSHA384.prototype._digest = function digest(enc) {\n if (enc === 'hex')\n return utils.toHex32(this.h.slice(0, 12), 'big');\n else\n return utils.split32(this.h.slice(0, 12), 'big');\n};\n","'use strict';\n\nvar utils = require('../utils');\nvar common = require('../common');\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;\n\nvar BlockHash = common.BlockHash;\n\nvar sha512_K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n];\n\nfunction SHA512() {\n if (!(this instanceof SHA512))\n return new SHA512();\n\n BlockHash.call(this);\n this.h = [\n 0x6a09e667, 0xf3bcc908,\n 0xbb67ae85, 0x84caa73b,\n 0x3c6ef372, 0xfe94f82b,\n 0xa54ff53a, 0x5f1d36f1,\n 0x510e527f, 0xade682d1,\n 0x9b05688c, 0x2b3e6c1f,\n 0x1f83d9ab, 0xfb41bd6b,\n 0x5be0cd19, 0x137e2179 ];\n this.k = sha512_K;\n this.W = new Array(160);\n}\nutils.inherits(SHA512, BlockHash);\nmodule.exports = SHA512;\n\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;\n\n // 32 x 32bit words\n for (var i = 0; i < 32; i++)\n W[i] = msg[start + i];\n for (; i < W.length; i += 2) {\n var c0_hi = g1_512_hi(W[i - 4], W[i - 3]); // i - 2\n var c0_lo = g1_512_lo(W[i - 4], W[i - 3]);\n var c1_hi = W[i - 14]; // i - 7\n var c1_lo = W[i - 13];\n var c2_hi = g0_512_hi(W[i - 30], W[i - 29]); // i - 15\n var c2_lo = g0_512_lo(W[i - 30], W[i - 29]);\n var c3_hi = W[i - 32]; // i - 16\n var c3_lo = W[i - 31];\n\n W[i] = sum64_4_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo);\n W[i + 1] = sum64_4_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n 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\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\n assert(this.k.length === W.length);\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\n var T1_hi = sum64_5_hi(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n var T1_lo = sum64_5_lo(\n c0_hi, c0_lo,\n c1_hi, c1_lo,\n c2_hi, c2_lo,\n c3_hi, c3_lo,\n c4_hi, c4_lo);\n\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\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\n hh = gh;\n hl = gl;\n\n gh = fh;\n gl = fl;\n\n fh = eh;\n fl = el;\n\n eh = sum64_hi(dh, dl, T1_hi, T1_lo);\n el = sum64_lo(dl, dl, T1_hi, T1_lo);\n\n dh = ch;\n dl = cl;\n\n ch = bh;\n cl = bl;\n\n bh = ah;\n bl = al;\n\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')\n return utils.toHex32(this.h, 'big');\n else\n 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)\n 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)\n 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)\n 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)\n 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 var c2_hi = rotr64_hi(xl, xh, 7); // 39\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n 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 var c2_lo = rotr64_lo(xl, xh, 7); // 39\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n 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)\n 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)\n 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\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n 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\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n 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 var c2_hi = shr64_hi(xh, xl, 6);\n\n var r = c0_hi ^ c1_hi ^ c2_hi;\n if (r < 0)\n 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 var c2_lo = shr64_lo(xh, xl, 6);\n\n var r = c0_lo ^ c1_lo ^ c2_lo;\n if (r < 0)\n r += 0x100000000;\n return r;\n}\n","'use strict';\n\nvar utils = require('../utils');\nvar rotr32 = utils.rotr32;\n\nfunction ft_1(s, x, y, z) {\n if (s === 0)\n return ch32(x, y, z);\n if (s === 1 || s === 3)\n return p32(x, y, z);\n if (s === 2)\n return maj32(x, y, z);\n}\nexports.ft_1 = ft_1;\n\nfunction ch32(x, y, z) {\n return (x & y) ^ ((~x) & z);\n}\nexports.ch32 = ch32;\n\nfunction maj32(x, y, z) {\n return (x & y) ^ (x & z) ^ (y & z);\n}\nexports.maj32 = maj32;\n\nfunction p32(x, y, z) {\n return x ^ y ^ z;\n}\nexports.p32 = p32;\n\nfunction s0_256(x) {\n return rotr32(x, 2) ^ rotr32(x, 13) ^ rotr32(x, 22);\n}\nexports.s0_256 = s0_256;\n\nfunction s1_256(x) {\n return rotr32(x, 6) ^ rotr32(x, 11) ^ rotr32(x, 25);\n}\nexports.s1_256 = s1_256;\n\nfunction g0_256(x) {\n return rotr32(x, 7) ^ rotr32(x, 18) ^ (x >>> 3);\n}\nexports.g0_256 = g0_256;\n\nfunction g1_256(x) {\n return rotr32(x, 17) ^ rotr32(x, 19) ^ (x >>> 10);\n}\nexports.g1_256 = g1_256;\n","'use strict';\n\nvar assert = require('minimalistic-assert');\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 if (i < 0 || i + 1 >= msg.length) {\n return false;\n }\n return (msg.charCodeAt(i + 1) & 0xFC00) === 0xDC00;\n}\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\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 for (var i = 0; i < msg.length; i++) {\n var c = msg.charCodeAt(i);\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)\n msg = '0' + msg;\n for (i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\n }\n } else {\n for (i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n }\n return res;\n}\nexports.toArray = toArray;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nexports.toHex = toHex;\n\nfunction htonl(w) {\n var res = (w >>> 24) |\n ((w >>> 8) & 0xff00) |\n ((w << 8) & 0xff0000) |\n ((w & 0xff) << 24);\n return res >>> 0;\n}\nexports.htonl = htonl;\n\nfunction toHex32(msg, endian) {\n var res = '';\n for (var i = 0; i < msg.length; i++) {\n var w = msg[i];\n if (endian === 'little')\n w = htonl(w);\n res += zero8(w.toString(16));\n }\n return res;\n}\nexports.toHex32 = toHex32;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nexports.zero2 = zero2;\n\nfunction zero8(word) {\n if (word.length === 7)\n return '0' + word;\n else if (word.length === 6)\n return '00' + word;\n else if (word.length === 5)\n return '000' + word;\n else if (word.length === 4)\n return '0000' + word;\n else if (word.length === 3)\n return '00000' + word;\n else if (word.length === 2)\n return '000000' + word;\n else if (word.length === 1)\n return '0000000' + word;\n else\n return word;\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 for (var i = 0, k = start; i < res.length; i++, k += 4) {\n var w;\n if (endian === 'big')\n w = (msg[k] << 24) | (msg[k + 1] << 16) | (msg[k + 2] << 8) | msg[k + 3];\n else\n w = (msg[k + 3] << 24) | (msg[k + 2] << 16) | (msg[k + 1] << 8) | msg[k];\n res[i] = w >>> 0;\n }\n return res;\n}\nexports.join32 = join32;\n\nfunction split32(msg, endian) {\n var res = new Array(msg.length * 4);\n for (var i = 0, k = 0; i < msg.length; i++, k += 4) {\n var m = msg[i];\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 return res;\n}\nexports.split32 = split32;\n\nfunction rotr32(w, b) {\n return (w >>> b) | (w << (32 - b));\n}\nexports.rotr32 = rotr32;\n\nfunction rotl32(w, b) {\n return (w << b) | (w >>> (32 - b));\n}\nexports.rotl32 = rotl32;\n\nfunction sum32(a, b) {\n return (a + b) >>> 0;\n}\nexports.sum32 = sum32;\n\nfunction sum32_3(a, b, c) {\n return (a + b + c) >>> 0;\n}\nexports.sum32_3 = sum32_3;\n\nfunction sum32_4(a, b, c, d) {\n return (a + b + c + d) >>> 0;\n}\nexports.sum32_4 = sum32_4;\n\nfunction sum32_5(a, b, c, d, e) {\n return (a + b + c + d + e) >>> 0;\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\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}\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}\nexports.sum64_hi = sum64_hi;\n\nfunction sum64_lo(ah, al, bh, bl) {\n var lo = al + bl;\n return lo >>> 0;\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\n var hi = ah + bh + ch + dh + carry;\n return hi >>> 0;\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}\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\n var hi = ah + bh + ch + dh + eh + carry;\n return hi >>> 0;\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\n return lo >>> 0;\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}\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}\nexports.rotr64_lo = rotr64_lo;\n\nfunction shr64_hi(ah, al, num) {\n return ah >>> num;\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}\nexports.shr64_lo = shr64_lo;\n","'use strict';\n\nvar hash = require('hash.js');\nvar utils = require('minimalistic-crypto-utils');\nvar assert = require('minimalistic-assert');\n\nfunction HmacDRBG(options) {\n if (!(this instanceof HmacDRBG))\n return new HmacDRBG(options);\n this.hash = options.hash;\n this.predResist = !!options.predResist;\n\n this.outLen = this.hash.outSize;\n this.minEntropy = options.minEntropy || this.hash.hmacStrength;\n\n this._reseed = null;\n this.reseedInterval = null;\n this.K = null;\n this.V = null;\n\n var entropy = utils.toArray(options.entropy, options.entropyEnc || 'hex');\n var nonce = utils.toArray(options.nonce, options.nonceEnc || 'hex');\n var pers = utils.toArray(options.pers, options.persEnc || 'hex');\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n this._init(entropy, nonce, pers);\n}\nmodule.exports = HmacDRBG;\n\nHmacDRBG.prototype._init = function init(entropy, nonce, pers) {\n var seed = entropy.concat(nonce).concat(pers);\n\n this.K = new Array(this.outLen / 8);\n this.V = new Array(this.outLen / 8);\n for (var i = 0; i < this.V.length; i++) {\n this.K[i] = 0x00;\n this.V[i] = 0x01;\n }\n\n this._update(seed);\n this._reseed = 1;\n this.reseedInterval = 0x1000000000000; // 2^48\n};\n\nHmacDRBG.prototype._hmac = function hmac() {\n return new hash.hmac(this.hash, this.K);\n};\n\nHmacDRBG.prototype._update = function update(seed) {\n var kmac = this._hmac()\n .update(this.V)\n .update([ 0x00 ]);\n if (seed)\n kmac = kmac.update(seed);\n this.K = kmac.digest();\n this.V = this._hmac().update(this.V).digest();\n if (!seed)\n return;\n\n this.K = this._hmac()\n .update(this.V)\n .update([ 0x01 ])\n .update(seed)\n .digest();\n this.V = this._hmac().update(this.V).digest();\n};\n\nHmacDRBG.prototype.reseed = function reseed(entropy, entropyEnc, add, addEnc) {\n // Optional entropy enc\n if (typeof entropyEnc !== 'string') {\n addEnc = add;\n add = entropyEnc;\n entropyEnc = null;\n }\n\n entropy = utils.toArray(entropy, entropyEnc);\n add = utils.toArray(add, addEnc);\n\n assert(entropy.length >= (this.minEntropy / 8),\n 'Not enough entropy. Minimum is: ' + this.minEntropy + ' bits');\n\n this._update(entropy.concat(add || []));\n this._reseed = 1;\n};\n\nHmacDRBG.prototype.generate = function generate(len, enc, add, addEnc) {\n if (this._reseed > this.reseedInterval)\n throw new Error('Reseed is required');\n\n // Optional encoding\n if (typeof enc !== 'string') {\n addEnc = add;\n add = enc;\n enc = null;\n }\n\n // Optional additional data\n if (add) {\n add = utils.toArray(add, addEnc || 'hex');\n this._update(add);\n }\n\n var temp = [];\n while (temp.length < len) {\n this.V = this._hmac().update(this.V).digest();\n temp = temp.concat(this.V);\n }\n\n var res = temp.slice(0, len);\n this._update(add);\n this._reseed++;\n return utils.encode(res, enc);\n};\n","var http = require('http')\nvar url = require('url')\n\nvar https = module.exports\n\nfor (var key in http) {\n if (http.hasOwnProperty(key)) https[key] = http[key]\n}\n\nhttps.request = function (params, cb) {\n params = validateParams(params)\n return http.request.call(this, params, cb)\n}\n\nhttps.get = function (params, cb) {\n params = validateParams(params)\n return http.get.call(this, params, cb)\n}\n\nfunction validateParams (params) {\n if (typeof params === 'string') {\n params = url.parse(params)\n }\n if (!params.protocol) {\n params.protocol = 'https:'\n }\n if (params.protocol !== 'https:') {\n throw new Error('Protocol \"' + params.protocol + '\" not supported. Expected \"https:\"')\n }\n return params\n}\n","'use strict'\nconst idb = require('idb')\n\nconst EventEmitter = require('events').EventEmitter\nconst queueMicrotask = require('queue-microtask')\n\nclass Storage extends EventEmitter {\n constructor (chunkLength, opts) {\n if (!opts) opts = {}\n super()\n\n this.chunkLength = Number(chunkLength)\n if (!this.chunkLength) throw new Error('First argument must be a chunk length')\n\n this.closed = false\n this.destroyed = false\n this.length = Number(opts.length) || Infinity\n this.name = opts.name || 'idb-chunk-store'\n\n if (this.length !== Infinity) {\n this.lastChunkLength = (this.length % this.chunkLength) || this.chunkLength\n this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1\n }\n\n this.dbPromise = idb.openDB(this.name, undefined, {\n upgrade: (db) => {\n db.createObjectStore('chunks')\n },\n blocking: () => {\n // Fires if the database is deleted from outside this Storage object\n this.close()\n },\n terminated: () => {\n this.closed = true\n this.emit('error', new Error('Database unexpectedly closed'))\n }\n })\n }\n\n put (index, buf, cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n\n const isLastChunk = (index === this.lastChunkIndex)\n if (isLastChunk && buf.length !== this.lastChunkLength) {\n return queueMicrotask(() => cb(new Error('Last chunk length must be ' + this.lastChunkLength)))\n }\n if (!isLastChunk && buf.length !== this.chunkLength) {\n return queueMicrotask(() => cb(new Error('Chunk length must be ' + this.chunkLength)))\n }\n\n // Zero-copy coerce Buffer to Uint8Array\n buf = new Uint8Array(buf.buffer, buf.byteOffset, buf.byteLength)\n\n // If the backing buffer is larger, copy out only the relevant slice\n // so extra data doesn't get saved to indexeddb\n if (buf.byteOffset !== 0 || buf.byteLength !== buf.buffer.byteLength) {\n buf = buf.slice()\n }\n\n ;(async () => {\n try {\n const db = await this.dbPromise\n await db.put('chunks', buf, index)\n } catch (err) {\n cb(err)\n return\n }\n\n cb(null)\n })()\n }\n\n get (index, opts, cb = () => {}) {\n if (typeof opts === 'function') return this.get(index, {}, opts)\n if (!opts) opts = {}\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n\n ;(async () => {\n let rawResult\n try {\n const db = await this.dbPromise\n rawResult = await db.get('chunks', index)\n } catch (err) {\n cb(err)\n return\n }\n\n // rawResult should be undefined if the chunk is not found,\n // but some old browsers occasionally return null\n if (rawResult == null) {\n const err = new Error('Chunk not found')\n err.notFound = true\n cb(err)\n return\n }\n\n let buf = Buffer.from(rawResult.buffer, rawResult.byteOffset, rawResult.byteLength)\n\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n\n if (offset !== 0 || len !== buf.length) {\n buf = buf.slice(offset, len + offset)\n }\n\n cb(null, buf)\n })()\n }\n\n close (cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n this.closed = true\n\n ;(async () => {\n try {\n const db = await this.dbPromise\n db.close()\n } catch (err) {\n cb(err)\n return\n }\n\n cb(null)\n })()\n }\n\n destroy (cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n if (this.destroyed) return queueMicrotask(() => cb(new Error('Storage is destroyed')))\n this.destroyed = true\n\n this.close(async (err) => {\n if (err) {\n cb(err)\n return\n }\n\n try {\n await idb.deleteDB(this.name)\n } catch (err) {\n cb(err)\n return\n }\n\n cb(null)\n })\n }\n}\nmodule.exports = Storage\n","const instanceOfAny = (object, constructors) => constructors.some((c) => object instanceof c);\n\nlet idbProxyableTypes;\nlet cursorAdvanceMethods;\n// This is a function to prevent it throwing up in node environments.\nfunction getIdbProxyableTypes() {\n return (idbProxyableTypes ||\n (idbProxyableTypes = [\n IDBDatabase,\n IDBObjectStore,\n IDBIndex,\n IDBCursor,\n IDBTransaction,\n ]));\n}\n// This is a function to prevent it throwing up in node environments.\nfunction getCursorAdvanceMethods() {\n return (cursorAdvanceMethods ||\n (cursorAdvanceMethods = [\n IDBCursor.prototype.advance,\n IDBCursor.prototype.continue,\n IDBCursor.prototype.continuePrimaryKey,\n ]));\n}\nconst cursorRequestMap = new WeakMap();\nconst transactionDoneMap = new WeakMap();\nconst transactionStoreNamesMap = new WeakMap();\nconst transformCache = new WeakMap();\nconst reverseTransformCache = new WeakMap();\nfunction promisifyRequest(request) {\n const promise = new Promise((resolve, reject) => {\n const unlisten = () => {\n request.removeEventListener('success', success);\n request.removeEventListener('error', error);\n };\n const success = () => {\n resolve(wrap(request.result));\n unlisten();\n };\n const error = () => {\n reject(request.error);\n unlisten();\n };\n request.addEventListener('success', success);\n request.addEventListener('error', error);\n });\n promise\n .then((value) => {\n // Since cursoring reuses the IDBRequest (*sigh*), we cache it for later retrieval\n // (see wrapFunction).\n if (value instanceof IDBCursor) {\n cursorRequestMap.set(value, request);\n }\n // Catching to avoid \"Uncaught Promise exceptions\"\n })\n .catch(() => { });\n // This mapping exists in reverseTransformCache but doesn't doesn't exist in transformCache. This\n // is because we create many promises from a single IDBRequest.\n reverseTransformCache.set(promise, request);\n return promise;\n}\nfunction cacheDonePromiseForTransaction(tx) {\n // Early bail if we've already created a done promise for this transaction.\n if (transactionDoneMap.has(tx))\n return;\n const done = new Promise((resolve, reject) => {\n const unlisten = () => {\n tx.removeEventListener('complete', complete);\n tx.removeEventListener('error', error);\n tx.removeEventListener('abort', error);\n };\n const complete = () => {\n resolve();\n unlisten();\n };\n const error = () => {\n reject(tx.error || new DOMException('AbortError', 'AbortError'));\n unlisten();\n };\n tx.addEventListener('complete', complete);\n tx.addEventListener('error', error);\n tx.addEventListener('abort', error);\n });\n // Cache it for later retrieval.\n transactionDoneMap.set(tx, done);\n}\nlet idbProxyTraps = {\n get(target, prop, receiver) {\n if (target instanceof IDBTransaction) {\n // Special handling for transaction.done.\n if (prop === 'done')\n return transactionDoneMap.get(target);\n // Polyfill for objectStoreNames because of Edge.\n if (prop === 'objectStoreNames') {\n return target.objectStoreNames || transactionStoreNamesMap.get(target);\n }\n // Make tx.store return the only store in the transaction, or undefined if there are many.\n if (prop === 'store') {\n return receiver.objectStoreNames[1]\n ? undefined\n : receiver.objectStore(receiver.objectStoreNames[0]);\n }\n }\n // Else transform whatever we get back.\n return wrap(target[prop]);\n },\n set(target, prop, value) {\n target[prop] = value;\n return true;\n },\n has(target, prop) {\n if (target instanceof IDBTransaction &&\n (prop === 'done' || prop === 'store')) {\n return true;\n }\n return prop in target;\n },\n};\nfunction replaceTraps(callback) {\n idbProxyTraps = callback(idbProxyTraps);\n}\nfunction wrapFunction(func) {\n // Due to expected object equality (which is enforced by the caching in `wrap`), we\n // only create one new func per func.\n // Edge doesn't support objectStoreNames (booo), so we polyfill it here.\n if (func === IDBDatabase.prototype.transaction &&\n !('objectStoreNames' in IDBTransaction.prototype)) {\n return function (storeNames, ...args) {\n const tx = func.call(unwrap(this), storeNames, ...args);\n transactionStoreNamesMap.set(tx, storeNames.sort ? storeNames.sort() : [storeNames]);\n return wrap(tx);\n };\n }\n // Cursor methods are special, as the behaviour is a little more different to standard IDB. In\n // IDB, you advance the cursor and wait for a new 'success' on the IDBRequest that gave you the\n // cursor. It's kinda like a promise that can resolve with many values. That doesn't make sense\n // with real promises, so each advance methods returns a new promise for the cursor object, or\n // undefined if the end of the cursor has been reached.\n if (getCursorAdvanceMethods().includes(func)) {\n return function (...args) {\n // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use\n // the original object.\n func.apply(unwrap(this), args);\n return wrap(cursorRequestMap.get(this));\n };\n }\n return function (...args) {\n // Calling the original function with the proxy as 'this' causes ILLEGAL INVOCATION, so we use\n // the original object.\n return wrap(func.apply(unwrap(this), args));\n };\n}\nfunction transformCachableValue(value) {\n if (typeof value === 'function')\n return wrapFunction(value);\n // This doesn't return, it just creates a 'done' promise for the transaction,\n // which is later returned for transaction.done (see idbObjectHandler).\n if (value instanceof IDBTransaction)\n cacheDonePromiseForTransaction(value);\n if (instanceOfAny(value, getIdbProxyableTypes()))\n return new Proxy(value, idbProxyTraps);\n // Return the same value back if we're not going to transform it.\n return value;\n}\nfunction wrap(value) {\n // We sometimes generate multiple promises from a single IDBRequest (eg when cursoring), because\n // IDB is weird and a single IDBRequest can yield many responses, so these can't be cached.\n if (value instanceof IDBRequest)\n return promisifyRequest(value);\n // If we've already transformed this value before, reuse the transformed value.\n // This is faster, but it also provides object equality.\n if (transformCache.has(value))\n return transformCache.get(value);\n const newValue = transformCachableValue(value);\n // Not all types are transformed.\n // These may be primitive types, so they can't be WeakMap keys.\n if (newValue !== value) {\n transformCache.set(value, newValue);\n reverseTransformCache.set(newValue, value);\n }\n return newValue;\n}\nconst unwrap = (value) => reverseTransformCache.get(value);\n\nexport { reverseTransformCache as a, instanceOfAny as i, replaceTraps as r, unwrap as u, wrap as w };\n","import { w as wrap, r as replaceTraps } from './wrap-idb-value.js';\nexport { u as unwrap, w as wrap } from './wrap-idb-value.js';\n\n/**\n * Open a database.\n *\n * @param name Name of the database.\n * @param version Schema version.\n * @param callbacks Additional callbacks.\n */\nfunction openDB(name, version, { blocked, upgrade, blocking, terminated } = {}) {\n const request = indexedDB.open(name, version);\n const openPromise = wrap(request);\n if (upgrade) {\n request.addEventListener('upgradeneeded', (event) => {\n upgrade(wrap(request.result), event.oldVersion, event.newVersion, wrap(request.transaction));\n });\n }\n if (blocked)\n request.addEventListener('blocked', () => blocked());\n openPromise\n .then((db) => {\n if (terminated)\n db.addEventListener('close', () => terminated());\n if (blocking)\n db.addEventListener('versionchange', () => blocking());\n })\n .catch(() => { });\n return openPromise;\n}\n/**\n * Delete a database.\n *\n * @param name Name of the database.\n */\nfunction deleteDB(name, { blocked } = {}) {\n const request = indexedDB.deleteDatabase(name);\n if (blocked)\n request.addEventListener('blocked', () => blocked());\n return wrap(request).then(() => undefined);\n}\n\nconst readMethods = ['get', 'getKey', 'getAll', 'getAllKeys', 'count'];\nconst writeMethods = ['put', 'add', 'delete', 'clear'];\nconst cachedMethods = new Map();\nfunction getMethod(target, prop) {\n if (!(target instanceof IDBDatabase &&\n !(prop in target) &&\n typeof prop === 'string')) {\n return;\n }\n if (cachedMethods.get(prop))\n return cachedMethods.get(prop);\n const targetFuncName = prop.replace(/FromIndex$/, '');\n const useIndex = prop !== targetFuncName;\n const isWrite = writeMethods.includes(targetFuncName);\n if (\n // Bail if the target doesn't exist on the target. Eg, getAll isn't in Edge.\n !(targetFuncName in (useIndex ? IDBIndex : IDBObjectStore).prototype) ||\n !(isWrite || readMethods.includes(targetFuncName))) {\n return;\n }\n const method = async function (storeName, ...args) {\n // isWrite ? 'readwrite' : undefined gzipps better, but fails in Edge :(\n const tx = this.transaction(storeName, isWrite ? 'readwrite' : 'readonly');\n let target = tx.store;\n if (useIndex)\n target = target.index(args.shift());\n // Must reject if op rejects.\n // If it's a write operation, must reject if tx.done rejects.\n // Must reject with op rejection first.\n // Must resolve with op value.\n // Must handle both promises (no unhandled rejections)\n return (await Promise.all([\n target[targetFuncName](...args),\n isWrite && tx.done,\n ]))[0];\n };\n cachedMethods.set(prop, method);\n return method;\n}\nreplaceTraps((oldTraps) => ({\n ...oldTraps,\n get: (target, prop, receiver) => getMethod(target, prop) || oldTraps.get(target, prop, receiver),\n has: (target, prop) => !!getMethod(target, prop) || oldTraps.has(target, prop),\n}));\n\nexport { deleteDB, openDB };\n","/*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh */\nexports.read = function (buffer, offset, isLE, mLen, nBytes) {\n var e, m\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var nBits = -7\n var i = isLE ? (nBytes - 1) : 0\n var d = isLE ? -1 : 1\n var s = buffer[offset + i]\n\n i += d\n\n e = s & ((1 << (-nBits)) - 1)\n s >>= (-nBits)\n nBits += eLen\n for (; nBits > 0; e = (e * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n m = e & ((1 << (-nBits)) - 1)\n e >>= (-nBits)\n nBits += mLen\n for (; nBits > 0; m = (m * 256) + buffer[offset + i], i += d, nBits -= 8) {}\n\n if (e === 0) {\n e = 1 - eBias\n } else if (e === eMax) {\n return m ? NaN : ((s ? -1 : 1) * Infinity)\n } else {\n m = m + Math.pow(2, mLen)\n e = e - eBias\n }\n return (s ? -1 : 1) * m * Math.pow(2, e - mLen)\n}\n\nexports.write = function (buffer, value, offset, isLE, mLen, nBytes) {\n var e, m, c\n var eLen = (nBytes * 8) - mLen - 1\n var eMax = (1 << eLen) - 1\n var eBias = eMax >> 1\n var rt = (mLen === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0)\n var i = isLE ? 0 : (nBytes - 1)\n var d = isLE ? 1 : -1\n var s = value < 0 || (value === 0 && 1 / value < 0) ? 1 : 0\n\n value = Math.abs(value)\n\n if (isNaN(value) || value === Infinity) {\n m = isNaN(value) ? 1 : 0\n e = eMax\n } else {\n e = Math.floor(Math.log(value) / Math.LN2)\n if (value * (c = Math.pow(2, -e)) < 1) {\n e--\n c *= 2\n }\n if (e + eBias >= 1) {\n value += rt / c\n } else {\n value += rt * Math.pow(2, 1 - eBias)\n }\n if (value * c >= 2) {\n e++\n c /= 2\n }\n\n if (e + eBias >= eMax) {\n m = 0\n e = eMax\n } else if (e + eBias >= 1) {\n m = ((value * c) - 1) * Math.pow(2, mLen)\n e = e + eBias\n } else {\n m = value * Math.pow(2, eBias - 1) * Math.pow(2, mLen)\n e = 0\n }\n }\n\n for (; mLen >= 8; buffer[offset + i] = m & 0xff, i += d, m /= 256, mLen -= 8) {}\n\n e = (e << mLen) | m\n eLen += mLen\n for (; eLen > 0; buffer[offset + i] = e & 0xff, i += d, e /= 256, eLen -= 8) {}\n\n buffer[offset + i - d] |= s * 128\n}\n","/*! immediate-chunk-store. MIT License. Feross Aboukhadijeh */\n// TODO: remove when window.queueMicrotask() is well supported\nconst queueMicrotask = require('queue-microtask')\n\nclass ImmediateStore {\n constructor (store) {\n this.store = store\n this.chunkLength = store.chunkLength\n\n if (!this.store || !this.store.get || !this.store.put) {\n throw new Error('First argument must be abstract-chunk-store compliant')\n }\n\n this.mem = []\n }\n\n put (index, buf, cb = () => {}) {\n this.mem[index] = buf\n this.store.put(index, buf, err => {\n this.mem[index] = null\n cb(err)\n })\n }\n\n get (index, opts, cb = () => {}) {\n if (typeof opts === 'function') return this.get(index, null, opts)\n\n let buf = this.mem[index]\n\n // if the chunk isn't in the immediate memory cache\n if (!buf) {\n return this.store.get(index, opts, cb)\n }\n\n if (!opts) opts = {}\n\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n\n if (offset !== 0 || len !== buf.length) {\n buf = buf.slice(offset, len + offset)\n }\n queueMicrotask(() => cb(null, buf))\n }\n\n close (cb = () => {}) {\n this.store.close(cb)\n }\n\n destroy (cb = () => {}) {\n this.store.destroy(cb)\n }\n}\n\nmodule.exports = ImmediateStore\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 var TempCtor = function () {}\n TempCtor.prototype = superCtor.prototype\n ctor.prototype = new TempCtor()\n ctor.prototype.constructor = ctor\n }\n }\n}\n","'use strict';\n\nvar hasToStringTag = require('has-tostringtag/shams')();\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\n\nvar isStandardArguments = function isArguments(value) {\n\tif (hasToStringTag && value && typeof value === 'object' && Symbol.toStringTag in value) {\n\t\treturn false;\n\t}\n\treturn $toString(value) === '[object Arguments]';\n};\n\nvar isLegacyArguments = function isArguments(value) {\n\tif (isStandardArguments(value)) {\n\t\treturn true;\n\t}\n\treturn value !== null &&\n\t\ttypeof value === 'object' &&\n\t\ttypeof value.length === 'number' &&\n\t\tvalue.length >= 0 &&\n\t\t$toString(value) !== '[object Array]' &&\n\t\t$toString(value.callee) === '[object Function]';\n};\n\nvar supportsStandardArguments = (function () {\n\treturn isStandardArguments(arguments);\n}());\n\nisStandardArguments.isLegacyArguments = isLegacyArguments; // for tests\n\nmodule.exports = supportsStandardArguments ? isStandardArguments : isLegacyArguments;\n","/* (c) 2016 Ari Porad (@ariporad) . License: ariporad.mit-license.org */\n\n// Partially from http://stackoverflow.com/a/94049/1928484, and from another SO answer, which told me that the highest\n// char code that's ascii is 127, but I can't find the link for. Sorry.\n\nvar MAX_ASCII_CHAR_CODE = 127;\n\nmodule.exports = function isAscii(str) {\n for (var i = 0, strLen = str.length; i < strLen; ++i) {\n if (str.charCodeAt(i) > MAX_ASCII_CHAR_CODE) return false;\n }\n return true;\n};\n","'use strict';\n\nvar toStr = Object.prototype.toString;\nvar fnToStr = Function.prototype.toString;\nvar isFnRegex = /^\\s*(?:function)?\\*/;\nvar hasToStringTag = require('has-tostringtag/shams')();\nvar getProto = Object.getPrototypeOf;\nvar getGeneratorFunc = function () { // eslint-disable-line consistent-return\n\tif (!hasToStringTag) {\n\t\treturn false;\n\t}\n\ttry {\n\t\treturn Function('return function*() {}')();\n\t} catch (e) {\n\t}\n};\nvar GeneratorFunction;\n\nmodule.exports = function isGeneratorFunction(fn) {\n\tif (typeof fn !== 'function') {\n\t\treturn false;\n\t}\n\tif (isFnRegex.test(fnToStr.call(fn))) {\n\t\treturn true;\n\t}\n\tif (!hasToStringTag) {\n\t\tvar str = toStr.call(fn);\n\t\treturn str === '[object GeneratorFunction]';\n\t}\n\tif (!getProto) {\n\t\treturn false;\n\t}\n\tif (typeof GeneratorFunction === 'undefined') {\n\t\tvar generatorFunc = getGeneratorFunc();\n\t\tGeneratorFunction = generatorFunc ? getProto(generatorFunc) : false;\n\t}\n\treturn getProto(fn) === GeneratorFunction;\n};\n","'use strict';\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function isNaN(value) {\n\treturn value !== value;\n};\n","'use strict';\n\nvar callBind = require('call-bind');\nvar define = require('define-properties');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Number);\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\tif (Number.isNaN && Number.isNaN(NaN) && !Number.isNaN('a')) {\n\t\treturn Number.isNaN;\n\t}\n\treturn implementation;\n};\n","'use strict';\n\nvar define = require('define-properties');\nvar getPolyfill = require('./polyfill');\n\n/* http://www.ecma-international.org/ecma-262/6.0/#sec-number.isnan */\n\nmodule.exports = function shimNumberIsNaN() {\n\tvar polyfill = getPolyfill();\n\tdefine(Number, { isNaN: polyfill }, {\n\t\tisNaN: function testIsNaN() {\n\t\t\treturn Number.isNaN !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","'use strict';\n\nvar forEach = require('foreach');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = require('has-tostringtag/shams')();\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $indexOf = callBound('Array.prototype.indexOf', true) || function indexOf(array, value) {\n\tfor (var i = 0; i < array.length; i += 1) {\n\t\tif (array[i] === value) {\n\t\t\treturn i;\n\t\t}\n\t}\n\treturn -1;\n};\nvar $slice = callBound('String.prototype.slice');\nvar toStrTags = {};\nvar gOPD = require('es-abstract/helpers/getOwnPropertyDescriptor');\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tvar arr = new g[typedArray]();\n\t\tif (Symbol.toStringTag in arr) {\n\t\t\tvar proto = getPrototypeOf(arr);\n\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\tif (!descriptor) {\n\t\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t}\n\t\t\ttoStrTags[typedArray] = descriptor.get;\n\t\t}\n\t});\n}\n\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\tvar anyTrue = false;\n\tforEach(toStrTags, function (getter, typedArray) {\n\t\tif (!anyTrue) {\n\t\t\ttry {\n\t\t\t\tanyTrue = getter.call(value) === typedArray;\n\t\t\t} catch (e) { /**/ }\n\t\t}\n\t});\n\treturn anyTrue;\n};\n\nmodule.exports = function isTypedArray(value) {\n\tif (!value || typeof value !== 'object') { return false; }\n\tif (!hasToStringTag || !(Symbol.toStringTag in value)) {\n\t\tvar tag = $slice($toString(value), 8, -1);\n\t\treturn $indexOf(typedArrays, tag) > -1;\n\t}\n\tif (!gOPD) { return false; }\n\treturn tryTypedArrays(value);\n};\n","module.exports = isTypedArray\nisTypedArray.strict = isStrictTypedArray\nisTypedArray.loose = isLooseTypedArray\n\nvar toString = Object.prototype.toString\nvar names = {\n '[object Int8Array]': true\n , '[object Int16Array]': true\n , '[object Int32Array]': true\n , '[object Uint8Array]': true\n , '[object Uint8ClampedArray]': true\n , '[object Uint16Array]': true\n , '[object Uint32Array]': true\n , '[object Float32Array]': true\n , '[object Float64Array]': true\n}\n\nfunction isTypedArray(arr) {\n return (\n isStrictTypedArray(arr)\n || isLooseTypedArray(arr)\n )\n}\n\nfunction isStrictTypedArray(arr) {\n return (\n arr instanceof Int8Array\n || arr instanceof Int16Array\n || arr instanceof Int32Array\n || arr instanceof Uint8Array\n || arr instanceof Uint8ClampedArray\n || arr instanceof Uint16Array\n || arr instanceof Uint32Array\n || arr instanceof Float32Array\n || arr instanceof Float64Array\n )\n}\n\nfunction isLooseTypedArray(arr) {\n return names[toString.call(arr)]\n}\n","'use strict';\n\nconst blacklist = [\n\t// # All\n\t'^npm-debug\\\\.log$', // Error log for npm\n\t'^\\\\..*\\\\.swp$', // Swap file for vim state\n\n\t// # macOS\n\t'^\\\\.DS_Store$', // Stores custom folder attributes\n\t'^\\\\.AppleDouble$', // Stores additional file resources\n\t'^\\\\.LSOverride$', // Contains the absolute path to the app to be used\n\t'^Icon\\\\r$', // Custom Finder icon: http://superuser.com/questions/298785/icon-file-on-os-x-desktop\n\t'^\\\\._.*', // Thumbnail\n\t'^\\\\.Spotlight-V100(?:$|\\\\/)', // Directory that might appear on external disk\n\t'\\\\.Trashes', // File that might appear on external disk\n\t'^__MACOSX$', // Resource fork\n\n\t// # Linux\n\t'~$', // Backup file\n\n\t// # Windows\n\t'^Thumbs\\\\.db$', // Image file cache\n\t'^ehthumbs\\\\.db$', // Folder config file\n\t'^Desktop\\\\.ini$', // Stores custom folder attributes\n\t'@eaDir$' // Synology Diskstation \"hidden\" folder where the server stores thumbnails\n];\n\nexports.re = () => {\n\tthrow new Error('`junk.re` was renamed to `junk.regex`');\n};\n\nexports.regex = new RegExp(blacklist.join('|'));\n\nexports.is = filename => exports.regex.test(filename);\n\nexports.not = filename => !exports.is(filename);\n\n// TODO: Remove this for the next major release\nexports.default = module.exports;\n","\r\nexports.RateLimiter = require('./lib/rateLimiter');\r\nexports.TokenBucket = require('./lib/tokenBucket');\r\n","var getMilliseconds = function() {\r\n if (typeof process !== 'undefined' && process.hrtime) {\r\n var hrtime = process.hrtime();\r\n var seconds = hrtime[0];\r\n var nanoseconds = hrtime[1];\r\n\r\n return seconds * 1e3 + Math.floor(nanoseconds / 1e6);\r\n }\r\n\r\n return new Date().getTime();\r\n}\r\n\r\nmodule.exports = getMilliseconds;\r\n","var TokenBucket = require('./tokenBucket');\r\nvar getMilliseconds = require('./clock');\r\n\r\n/**\r\n * A generic rate limiter. Underneath the hood, this uses a token bucket plus\r\n * an additional check to limit how many tokens we can remove each interval.\r\n * @author John Hurliman \r\n *\r\n * @param {Number} tokensPerInterval Maximum number of tokens that can be\r\n * removed at any given moment and over the course of one interval.\r\n * @param {String|Number} interval The interval length in milliseconds, or as\r\n * one of the following strings: 'second', 'minute', 'hour', day'.\r\n * @param {Boolean} fireImmediately Optional. Whether or not the callback\r\n * will fire immediately when rate limiting is in effect (default is false).\r\n */\r\nvar RateLimiter = function(tokensPerInterval, interval, fireImmediately) {\r\n this.tokenBucket = new TokenBucket(tokensPerInterval, tokensPerInterval,\r\n interval, null);\r\n\r\n // Fill the token bucket to start\r\n this.tokenBucket.content = tokensPerInterval;\r\n\r\n this.curIntervalStart = getMilliseconds();\r\n this.tokensThisInterval = 0;\r\n this.fireImmediately = fireImmediately;\r\n};\r\n\r\nRateLimiter.prototype = {\r\n tokenBucket: null,\r\n curIntervalStart: 0,\r\n tokensThisInterval: 0,\r\n fireImmediately: false,\r\n\r\n /**\r\n * Remove the requested number of tokens and fire the given callback. If the\r\n * rate limiter contains enough tokens and we haven't spent too many tokens\r\n * in this interval already, this will happen immediately. Otherwise, the\r\n * removal and callback will happen when enough tokens become available.\r\n * @param {Number} count The number of tokens to remove.\r\n * @param {Function} callback(err, remainingTokens)\r\n * @returns {Boolean} True if the callback was fired immediately, otherwise\r\n * false.\r\n */\r\n removeTokens: function(count, callback) {\r\n // Make sure the request isn't for more than we can handle\r\n if (count > this.tokenBucket.bucketSize) {\r\n process.nextTick(callback.bind(null, 'Requested tokens ' + count +\r\n ' exceeds maximum tokens per interval ' + this.tokenBucket.bucketSize,\r\n null));\r\n return false;\r\n }\r\n\r\n var self = this;\r\n var now = getMilliseconds();\r\n\r\n // Advance the current interval and reset the current interval token count\r\n // if needed\r\n if (now < this.curIntervalStart\r\n || now - this.curIntervalStart >= this.tokenBucket.interval) {\r\n this.curIntervalStart = now;\r\n this.tokensThisInterval = 0;\r\n }\r\n\r\n // If we don't have enough tokens left in this interval, wait until the\r\n // next interval\r\n if (count > this.tokenBucket.tokensPerInterval - this.tokensThisInterval) {\r\n if (this.fireImmediately) {\r\n process.nextTick(callback.bind(null, null, -1));\r\n } else {\r\n var waitInterval = Math.ceil(\r\n this.curIntervalStart + this.tokenBucket.interval - now);\r\n\r\n setTimeout(function() {\r\n self.tokenBucket.removeTokens(count, afterTokensRemoved);\r\n }, waitInterval);\r\n }\r\n return false;\r\n }\r\n\r\n // Remove the requested number of tokens from the token bucket\r\n return this.tokenBucket.removeTokens(count, afterTokensRemoved);\r\n\r\n function afterTokensRemoved(err, tokensRemaining) {\r\n if (err) return callback(err, null);\r\n\r\n self.tokensThisInterval += count;\r\n callback(null, tokensRemaining);\r\n }\r\n },\r\n\r\n /**\r\n * Attempt to remove the requested number of tokens and return immediately.\r\n * If the bucket (and any parent buckets) contains enough tokens and we\r\n * haven't spent too many tokens in this interval already, this will return\r\n * true. Otherwise, false is returned.\r\n * @param {Number} count The number of tokens to remove.\r\n * @param {Boolean} True if the tokens were successfully removed, otherwise\r\n * false.\r\n */\r\n tryRemoveTokens: function(count) {\r\n // Make sure the request isn't for more than we can handle\r\n if (count > this.tokenBucket.bucketSize)\r\n return false;\r\n\r\n var now = getMilliseconds();\r\n\r\n // Advance the current interval and reset the current interval token count\r\n // if needed\r\n if (now < this.curIntervalStart\r\n || now - this.curIntervalStart >= this.tokenBucket.interval) {\r\n this.curIntervalStart = now;\r\n this.tokensThisInterval = 0;\r\n }\r\n\r\n // If we don't have enough tokens left in this interval, return false\r\n if (count > this.tokenBucket.tokensPerInterval - this.tokensThisInterval)\r\n return false;\r\n\r\n // Try to remove the requested number of tokens from the token bucket\r\n var removed = this.tokenBucket.tryRemoveTokens(count);\r\n if (removed) {\r\n this.tokensThisInterval += count;\r\n }\r\n return removed;\r\n },\r\n\r\n /**\r\n * Returns the number of tokens remaining in the TokenBucket.\r\n * @returns {Number} The number of tokens remaining.\r\n */\r\n getTokensRemaining: function () {\r\n this.tokenBucket.drip();\r\n return this.tokenBucket.content;\r\n }\r\n};\r\n\r\nmodule.exports = RateLimiter;\r\n","\r\n/**\r\n * A hierarchical token bucket for rate limiting. See\r\n * http://en.wikipedia.org/wiki/Token_bucket for more information.\r\n * @author John Hurliman \r\n *\r\n * @param {Number} bucketSize Maximum number of tokens to hold in the bucket.\r\n * Also known as the burst rate.\r\n * @param {Number} tokensPerInterval Number of tokens to drip into the bucket\r\n * over the course of one interval.\r\n * @param {String|Number} interval The interval length in milliseconds, or as\r\n * one of the following strings: 'second', 'minute', 'hour', day'.\r\n * @param {TokenBucket} parentBucket Optional. A token bucket that will act as\r\n * the parent of this bucket.\r\n */\r\nvar TokenBucket = function(bucketSize, tokensPerInterval, interval, parentBucket) {\r\n this.bucketSize = bucketSize;\r\n this.tokensPerInterval = tokensPerInterval;\r\n\r\n if (typeof interval === 'string') {\r\n switch (interval) {\r\n case 'sec': case 'second':\r\n this.interval = 1000; break;\r\n case 'min': case 'minute':\r\n this.interval = 1000 * 60; break;\r\n case 'hr': case 'hour':\r\n this.interval = 1000 * 60 * 60; break;\r\n case 'day':\r\n this.interval = 1000 * 60 * 60 * 24; break;\r\n default:\r\n throw new Error('Invaid interval ' + interval);\r\n }\r\n } else {\r\n this.interval = interval;\r\n }\r\n\r\n this.parentBucket = parentBucket;\r\n this.content = 0;\r\n this.lastDrip = +new Date();\r\n};\r\n\r\nTokenBucket.prototype = {\r\n bucketSize: 1,\r\n tokensPerInterval: 1,\r\n interval: 1000,\r\n parentBucket: null,\r\n content: 0,\r\n lastDrip: 0,\r\n\r\n /**\r\n * Remove the requested number of tokens and fire the given callback. If the\r\n * bucket (and any parent buckets) contains enough tokens this will happen\r\n * immediately. Otherwise, the removal and callback will happen when enough\r\n * tokens become available.\r\n * @param {Number} count The number of tokens to remove.\r\n * @param {Function} callback(err, remainingTokens)\r\n * @returns {Boolean} True if the callback was fired immediately, otherwise\r\n * false.\r\n */\r\n removeTokens: function(count, callback) {\r\n var self = this;\r\n\r\n // Is this an infinite size bucket?\r\n if (!this.bucketSize) {\r\n process.nextTick(callback.bind(null, null, count, Number.POSITIVE_INFINITY));\r\n return true;\r\n }\r\n\r\n // Make sure the bucket can hold the requested number of tokens\r\n if (count > this.bucketSize) {\r\n process.nextTick(callback.bind(null, 'Requested tokens ' + count + ' exceeds bucket size ' +\r\n this.bucketSize, null));\r\n return false;\r\n }\r\n\r\n // Drip new tokens into this bucket\r\n this.drip();\r\n\r\n // If we don't have enough tokens in this bucket, come back later\r\n if (count > this.content)\r\n return comeBackLater();\r\n\r\n if (this.parentBucket) {\r\n // Remove the requested from the parent bucket first\r\n return this.parentBucket.removeTokens(count, function(err, remainingTokens) {\r\n if (err) return callback(err, null);\r\n\r\n // Check that we still have enough tokens in this bucket\r\n if (count > self.content)\r\n return comeBackLater();\r\n\r\n // Tokens were removed from the parent bucket, now remove them from\r\n // this bucket and fire the callback. Note that we look at the current\r\n // bucket and parent bucket's remaining tokens and return the smaller\r\n // of the two values\r\n self.content -= count;\r\n callback(null, Math.min(remainingTokens, self.content));\r\n });\r\n } else {\r\n // Remove the requested tokens from this bucket and fire the callback\r\n this.content -= count;\r\n process.nextTick(callback.bind(null, null, this.content));\r\n return true;\r\n }\r\n\r\n function comeBackLater() {\r\n // How long do we need to wait to make up the difference in tokens?\r\n var waitInterval = Math.ceil(\r\n (count - self.content) * (self.interval / self.tokensPerInterval));\r\n setTimeout(function() { self.removeTokens(count, callback); }, waitInterval);\r\n return false;\r\n }\r\n },\r\n\r\n /**\r\n * Attempt to remove the requested number of tokens and return immediately.\r\n * If the bucket (and any parent buckets) contains enough tokens this will\r\n * return true, otherwise false is returned.\r\n * @param {Number} count The number of tokens to remove.\r\n * @param {Boolean} True if the tokens were successfully removed, otherwise\r\n * false.\r\n */\r\n tryRemoveTokens: function(count) {\r\n // Is this an infinite size bucket?\r\n if (!this.bucketSize)\r\n return true;\r\n\r\n // Make sure the bucket can hold the requested number of tokens\r\n if (count > this.bucketSize)\r\n return false;\r\n\r\n // Drip new tokens into this bucket\r\n this.drip();\r\n\r\n // If we don't have enough tokens in this bucket, return false\r\n if (count > this.content)\r\n return false;\r\n\r\n // Try to remove the requested tokens from the parent bucket\r\n if (this.parentBucket && !this.parentBucket.tryRemoveTokens(count))\r\n return false;\r\n\r\n // Remove the requested tokens from this bucket and return\r\n this.content -= count;\r\n return true;\r\n },\r\n\r\n /**\r\n * Add any new tokens to the bucket since the last drip.\r\n * @returns {Boolean} True if new tokens were added, otherwise false.\r\n */\r\n drip: function() {\r\n if (!this.tokensPerInterval) {\r\n this.content = this.bucketSize;\r\n return;\r\n }\r\n\r\n var now = +new Date();\r\n var deltaMS = Math.max(now - this.lastDrip, 0);\r\n this.lastDrip = now;\r\n\r\n var dripAmount = deltaMS * (this.tokensPerInterval / this.interval);\r\n this.content = Math.min(this.content + dripAmount, this.bucketSize);\r\n }\r\n};\r\n\r\nmodule.exports = TokenBucket;\r\n","var events = require('events')\nvar inherits = require('inherits')\n\nmodule.exports = LRU\n\nfunction LRU (opts) {\n if (!(this instanceof LRU)) return new LRU(opts)\n if (typeof opts === 'number') opts = {max: opts}\n if (!opts) opts = {}\n events.EventEmitter.call(this)\n this.cache = {}\n this.head = this.tail = null\n this.length = 0\n this.max = opts.max || 1000\n this.maxAge = opts.maxAge || 0\n}\n\ninherits(LRU, events.EventEmitter)\n\nObject.defineProperty(LRU.prototype, 'keys', {\n get: function () { return Object.keys(this.cache) }\n})\n\nLRU.prototype.clear = function () {\n this.cache = {}\n this.head = this.tail = null\n this.length = 0\n}\n\nLRU.prototype.remove = function (key) {\n if (typeof key !== 'string') key = '' + key\n if (!this.cache.hasOwnProperty(key)) return\n\n var element = this.cache[key]\n delete this.cache[key]\n this._unlink(key, element.prev, element.next)\n return element.value\n}\n\nLRU.prototype._unlink = function (key, prev, next) {\n this.length--\n\n if (this.length === 0) {\n this.head = this.tail = null\n } else {\n if (this.head === key) {\n this.head = prev\n this.cache[this.head].next = null\n } else if (this.tail === key) {\n this.tail = next\n this.cache[this.tail].prev = null\n } else {\n this.cache[prev].next = next\n this.cache[next].prev = prev\n }\n }\n}\n\nLRU.prototype.peek = function (key) {\n if (!this.cache.hasOwnProperty(key)) return\n\n var element = this.cache[key]\n\n if (!this._checkAge(key, element)) return\n return element.value\n}\n\nLRU.prototype.set = function (key, value) {\n if (typeof key !== 'string') key = '' + key\n\n var element\n\n if (this.cache.hasOwnProperty(key)) {\n element = this.cache[key]\n element.value = value\n if (this.maxAge) element.modified = Date.now()\n\n // If it's already the head, there's nothing more to do:\n if (key === this.head) return value\n this._unlink(key, element.prev, element.next)\n } else {\n element = {value: value, modified: 0, next: null, prev: null}\n if (this.maxAge) element.modified = Date.now()\n this.cache[key] = element\n\n // Eviction is only possible if the key didn't already exist:\n if (this.length === this.max) this.evict()\n }\n\n this.length++\n element.next = null\n element.prev = this.head\n\n if (this.head) this.cache[this.head].next = key\n this.head = key\n\n if (!this.tail) this.tail = key\n return value\n}\n\nLRU.prototype._checkAge = function (key, element) {\n if (this.maxAge && (Date.now() - element.modified) > this.maxAge) {\n this.remove(key)\n this.emit('evict', {key: key, value: element.value})\n return false\n }\n return true\n}\n\nLRU.prototype.get = function (key) {\n if (typeof key !== 'string') key = '' + key\n if (!this.cache.hasOwnProperty(key)) return\n\n var element = this.cache[key]\n\n if (!this._checkAge(key, element)) return\n\n if (this.head !== key) {\n if (key === this.tail) {\n this.tail = element.next\n this.cache[this.tail].prev = null\n } else {\n // Set prev.next -> element.next:\n this.cache[element.prev].next = element.next\n }\n\n // Set element.next.prev -> element.prev:\n this.cache[element.next].prev = element.prev\n\n // Element is the new head\n this.cache[this.head].next = key\n element.prev = this.head\n element.next = null\n this.head = key\n }\n\n return element.value\n}\n\nLRU.prototype.evict = function () {\n if (!this.tail) return\n var key = this.tail\n var value = this.remove(this.tail)\n this.emit('evict', {key: key, value: value})\n}\n","/*! lt_donthave. MIT License. WebTorrent LLC */\nconst arrayRemove = require('unordered-array-remove')\nconst { EventEmitter } = require('events')\nconst debug = require('debug')('lt_donthave')\n\nmodule.exports = () => {\n class ltDontHave extends EventEmitter {\n constructor (wire) {\n super()\n\n this._peerSupports = false\n this._wire = wire\n }\n\n onExtendedHandshake () {\n this._peerSupports = true\n }\n\n onMessage (buf) {\n let index\n try {\n index = buf.readUInt32BE()\n } catch (err) {\n // drop invalid messages\n return\n }\n\n if (!this._wire.peerPieces.get(index)) return\n debug('got donthave %d', index)\n this._wire.peerPieces.set(index, false)\n\n this.emit('donthave', index)\n this._failRequests(index)\n }\n\n donthave (index) {\n if (!this._peerSupports) return\n\n debug('donthave %d', index)\n const buf = Buffer.alloc(4)\n buf.writeUInt32BE(index)\n\n this._wire.extended('lt_donthave', buf)\n }\n\n _failRequests (index) {\n const requests = this._wire.requests\n for (let i = 0; i < requests.length; i++) {\n const req = requests[i]\n if (req.piece === index) {\n arrayRemove(requests, i)\n i -= 1 // Check the new value at the same slot\n this._wire._callback(req, new Error('peer sent donthave'), null)\n }\n }\n }\n }\n\n // Name of the bittorrent-protocol extension\n ltDontHave.prototype.name = 'lt_donthave'\n\n return ltDontHave\n}\n","/*! magnet-uri. MIT License. WebTorrent LLC */\nmodule.exports = magnetURIDecode\nmodule.exports.decode = magnetURIDecode\nmodule.exports.encode = magnetURIEncode\n\nconst base32 = require('thirty-two')\nconst bep53Range = require('bep53-range')\n\n/**\n * Parse a magnet URI and return an object of keys/values\n *\n * @param {string} uri\n * @return {Object} parsed uri\n */\nfunction magnetURIDecode (uri) {\n const result = {}\n\n // Support 'magnet:' and 'stream-magnet:' uris\n const data = uri.split('magnet:?')[1]\n\n const params = (data && data.length >= 0)\n ? data.split('&')\n : []\n\n params.forEach(param => {\n const keyval = param.split('=')\n\n // This keyval is invalid, skip it\n if (keyval.length !== 2) return\n\n const key = keyval[0]\n let val = keyval[1]\n\n // Clean up torrent name\n if (key === 'dn') val = decodeURIComponent(val).replace(/\\+/g, ' ')\n\n // Address tracker (tr), exact source (xs), and acceptable source (as) are encoded\n // URIs, so decode them\n if (key === 'tr' || key === 'xs' || key === 'as' || key === 'ws') {\n val = decodeURIComponent(val)\n }\n\n // Return keywords as an array\n if (key === 'kt') val = decodeURIComponent(val).split('+')\n\n // Cast file index (ix) to a number\n if (key === 'ix') val = Number(val)\n\n // bep53\n if (key === 'so') val = bep53Range.parse(decodeURIComponent(val).split(','))\n\n // If there are repeated parameters, return an array of values\n if (result[key]) {\n if (!Array.isArray(result[key])) {\n result[key] = [result[key]]\n }\n\n result[key].push(val)\n } else {\n result[key] = val\n }\n })\n\n // Convenience properties for parity with `parse-torrent-file` module\n let m\n if (result.xt) {\n const xts = Array.isArray(result.xt) ? result.xt : [result.xt]\n xts.forEach(xt => {\n if ((m = xt.match(/^urn:btih:(.{40})/))) {\n result.infoHash = m[1].toLowerCase()\n } else if ((m = xt.match(/^urn:btih:(.{32})/))) {\n const decodedStr = base32.decode(m[1])\n result.infoHash = Buffer.from(decodedStr, 'binary').toString('hex')\n } else if ((m = xt.match(/^urn:btmh:1220(.{64})/))) {\n result.infoHashV2 = m[1].toLowerCase()\n }\n })\n }\n\n if (result.xs) {\n const xss = Array.isArray(result.xs) ? result.xs : [result.xs]\n xss.forEach(xs => {\n if ((m = xs.match(/^urn:btpk:(.{64})/))) {\n result.publicKey = m[1].toLowerCase()\n }\n })\n }\n\n if (result.infoHash) result.infoHashBuffer = Buffer.from(result.infoHash, 'hex')\n if (result.infoHashV2) result.infoHashV2Buffer = Buffer.from(result.infoHashV2, 'hex')\n if (result.publicKey) result.publicKeyBuffer = Buffer.from(result.publicKey, 'hex')\n\n if (result.dn) result.name = result.dn\n if (result.kt) result.keywords = result.kt\n\n result.announce = []\n if (typeof result.tr === 'string' || Array.isArray(result.tr)) {\n result.announce = result.announce.concat(result.tr)\n }\n\n result.urlList = []\n if (typeof result.as === 'string' || Array.isArray(result.as)) {\n result.urlList = result.urlList.concat(result.as)\n }\n if (typeof result.ws === 'string' || Array.isArray(result.ws)) {\n result.urlList = result.urlList.concat(result.ws)\n }\n\n result.peerAddresses = []\n if (typeof result['x.pe'] === 'string' || Array.isArray(result['x.pe'])) {\n result.peerAddresses = result.peerAddresses.concat(result['x.pe'])\n }\n\n // remove duplicates by converting to Set and back\n result.announce = Array.from(new Set(result.announce))\n result.urlList = Array.from(new Set(result.urlList))\n result.peerAddresses = Array.from(new Set(result.peerAddresses))\n\n return result\n}\n\nfunction magnetURIEncode (obj) {\n obj = Object.assign({}, obj) // clone obj, so we can mutate it\n\n // support using convenience names, in addition to spec names\n // (example: `infoHash` for `xt`, `name` for `dn`)\n\n // Deduplicate xt by using a set\n let xts = new Set()\n if (obj.xt && typeof obj.xt === 'string') xts.add(obj.xt)\n if (obj.xt && Array.isArray(obj.xt)) xts = new Set(obj.xt)\n if (obj.infoHashBuffer) xts.add(`urn:btih:${obj.infoHashBuffer.toString('hex')}`)\n if (obj.infoHash) xts.add(`urn:btih:${obj.infoHash}`)\n if (obj.infoHashV2Buffer) xts.add(obj.xt = `urn:btmh:1220${obj.infoHashV2Buffer.toString('hex')}`)\n if (obj.infoHashV2) xts.add(`urn:btmh:1220${obj.infoHashV2}`)\n const xtsDeduped = Array.from(xts)\n if (xtsDeduped.length === 1) obj.xt = xtsDeduped[0]\n if (xtsDeduped.length > 1) obj.xt = xtsDeduped\n\n if (obj.publicKeyBuffer) obj.xs = `urn:btpk:${obj.publicKeyBuffer.toString('hex')}`\n if (obj.publicKey) obj.xs = `urn:btpk:${obj.publicKey}`\n if (obj.name) obj.dn = obj.name\n if (obj.keywords) obj.kt = obj.keywords\n if (obj.announce) obj.tr = obj.announce\n if (obj.urlList) {\n obj.ws = obj.urlList\n delete obj.as\n }\n if (obj.peerAddresses) obj['x.pe'] = obj.peerAddresses\n\n let result = 'magnet:?'\n Object.keys(obj)\n .filter(key => key.length === 2 || key === 'x.pe')\n .forEach((key, i) => {\n const values = Array.isArray(obj[key]) ? obj[key] : [obj[key]]\n values.forEach((val, j) => {\n if ((i > 0 || j > 0) && ((key !== 'kt' && key !== 'so') || j === 0)) result += '&'\n\n if (key === 'dn') val = encodeURIComponent(val).replace(/%20/g, '+')\n if (key === 'tr' || key === 'as' || key === 'ws') {\n val = encodeURIComponent(val)\n }\n // Don't URI encode BEP46 keys\n if (key === 'xs' && !val.startsWith('urn:btpk:')) {\n val = encodeURIComponent(val)\n }\n if (key === 'kt') val = encodeURIComponent(val)\n if (key === 'so') return\n\n if (key === 'kt' && j > 0) result += `+${val}`\n else result += `${key}=${val}`\n })\n if (key === 'so') result += `${key}=${bep53Range.compose(values)}`\n })\n\n return result\n}\n","'use strict'\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\nvar Buffer = require('safe-buffer').Buffer\n\nvar ARRAY16 = new Array(16)\n\nfunction MD5 () {\n HashBase.call(this, 64)\n\n // state\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n}\n\ninherits(MD5, HashBase)\n\nMD5.prototype._update = function () {\n var M = ARRAY16\n for (var i = 0; i < 16; ++i) M[i] = this._block.readInt32LE(i * 4)\n\n var a = this._a\n var b = this._b\n var c = this._c\n var d = this._d\n\n a = fnF(a, b, c, d, M[0], 0xd76aa478, 7)\n d = fnF(d, a, b, c, M[1], 0xe8c7b756, 12)\n c = fnF(c, d, a, b, M[2], 0x242070db, 17)\n b = fnF(b, c, d, a, M[3], 0xc1bdceee, 22)\n a = fnF(a, b, c, d, M[4], 0xf57c0faf, 7)\n d = fnF(d, a, b, c, M[5], 0x4787c62a, 12)\n c = fnF(c, d, a, b, M[6], 0xa8304613, 17)\n b = fnF(b, c, d, a, M[7], 0xfd469501, 22)\n a = fnF(a, b, c, d, M[8], 0x698098d8, 7)\n d = fnF(d, a, b, c, M[9], 0x8b44f7af, 12)\n c = fnF(c, d, a, b, M[10], 0xffff5bb1, 17)\n b = fnF(b, c, d, a, M[11], 0x895cd7be, 22)\n a = fnF(a, b, c, d, M[12], 0x6b901122, 7)\n d = fnF(d, a, b, c, M[13], 0xfd987193, 12)\n c = fnF(c, d, a, b, M[14], 0xa679438e, 17)\n b = fnF(b, c, d, a, M[15], 0x49b40821, 22)\n\n a = fnG(a, b, c, d, M[1], 0xf61e2562, 5)\n d = fnG(d, a, b, c, M[6], 0xc040b340, 9)\n c = fnG(c, d, a, b, M[11], 0x265e5a51, 14)\n b = fnG(b, c, d, a, M[0], 0xe9b6c7aa, 20)\n a = fnG(a, b, c, d, M[5], 0xd62f105d, 5)\n d = fnG(d, a, b, c, M[10], 0x02441453, 9)\n c = fnG(c, d, a, b, M[15], 0xd8a1e681, 14)\n b = fnG(b, c, d, a, M[4], 0xe7d3fbc8, 20)\n a = fnG(a, b, c, d, M[9], 0x21e1cde6, 5)\n d = fnG(d, a, b, c, M[14], 0xc33707d6, 9)\n c = fnG(c, d, a, b, M[3], 0xf4d50d87, 14)\n b = fnG(b, c, d, a, M[8], 0x455a14ed, 20)\n a = fnG(a, b, c, d, M[13], 0xa9e3e905, 5)\n d = fnG(d, a, b, c, M[2], 0xfcefa3f8, 9)\n c = fnG(c, d, a, b, M[7], 0x676f02d9, 14)\n b = fnG(b, c, d, a, M[12], 0x8d2a4c8a, 20)\n\n a = fnH(a, b, c, d, M[5], 0xfffa3942, 4)\n d = fnH(d, a, b, c, M[8], 0x8771f681, 11)\n c = fnH(c, d, a, b, M[11], 0x6d9d6122, 16)\n b = fnH(b, c, d, a, M[14], 0xfde5380c, 23)\n a = fnH(a, b, c, d, M[1], 0xa4beea44, 4)\n d = fnH(d, a, b, c, M[4], 0x4bdecfa9, 11)\n c = fnH(c, d, a, b, M[7], 0xf6bb4b60, 16)\n b = fnH(b, c, d, a, M[10], 0xbebfbc70, 23)\n a = fnH(a, b, c, d, M[13], 0x289b7ec6, 4)\n d = fnH(d, a, b, c, M[0], 0xeaa127fa, 11)\n c = fnH(c, d, a, b, M[3], 0xd4ef3085, 16)\n b = fnH(b, c, d, a, M[6], 0x04881d05, 23)\n a = fnH(a, b, c, d, M[9], 0xd9d4d039, 4)\n d = fnH(d, a, b, c, M[12], 0xe6db99e5, 11)\n c = fnH(c, d, a, b, M[15], 0x1fa27cf8, 16)\n b = fnH(b, c, d, a, M[2], 0xc4ac5665, 23)\n\n a = fnI(a, b, c, d, M[0], 0xf4292244, 6)\n d = fnI(d, a, b, c, M[7], 0x432aff97, 10)\n c = fnI(c, d, a, b, M[14], 0xab9423a7, 15)\n b = fnI(b, c, d, a, M[5], 0xfc93a039, 21)\n a = fnI(a, b, c, d, M[12], 0x655b59c3, 6)\n d = fnI(d, a, b, c, M[3], 0x8f0ccc92, 10)\n c = fnI(c, d, a, b, M[10], 0xffeff47d, 15)\n b = fnI(b, c, d, a, M[1], 0x85845dd1, 21)\n a = fnI(a, b, c, d, M[8], 0x6fa87e4f, 6)\n d = fnI(d, a, b, c, M[15], 0xfe2ce6e0, 10)\n c = fnI(c, d, a, b, M[6], 0xa3014314, 15)\n b = fnI(b, c, d, a, M[13], 0x4e0811a1, 21)\n a = fnI(a, b, c, d, M[4], 0xf7537e82, 6)\n d = fnI(d, a, b, c, M[11], 0xbd3af235, 10)\n c = fnI(c, d, a, b, M[2], 0x2ad7d2bb, 15)\n b = fnI(b, c, d, a, M[9], 0xeb86d391, 21)\n\n this._a = (this._a + a) | 0\n this._b = (this._b + b) | 0\n this._c = (this._c + c) | 0\n this._d = (this._d + d) | 0\n}\n\nMD5.prototype._digest = function () {\n // create padding and handle blocks\n this._block[this._blockOffset++] = 0x80\n if (this._blockOffset > 56) {\n this._block.fill(0, this._blockOffset, 64)\n this._update()\n this._blockOffset = 0\n }\n\n this._block.fill(0, this._blockOffset, 56)\n this._block.writeUInt32LE(this._length[0], 56)\n this._block.writeUInt32LE(this._length[1], 60)\n this._update()\n\n // produce result\n var buffer = Buffer.allocUnsafe(16)\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 return buffer\n}\n\nfunction rotl (x, n) {\n return (x << n) | (x >>> (32 - n))\n}\n\nfunction fnF (a, b, c, d, m, k, s) {\n return (rotl((a + ((b & c) | ((~b) & d)) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnG (a, b, c, d, m, k, s) {\n return (rotl((a + ((b & d) | (c & (~d))) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnH (a, b, c, d, m, k, s) {\n return (rotl((a + (b ^ c ^ d) + m + k) | 0, s) + b) | 0\n}\n\nfunction fnI (a, b, c, d, m, k, s) {\n return (rotl((a + ((c ^ (b | (~d)))) + m + k) | 0, s) + b) | 0\n}\n\nmodule.exports = MD5\n","/*! mediasource. MIT License. Feross Aboukhadijeh */\nmodule.exports = MediaElementWrapper\n\nvar inherits = require('inherits')\nvar stream = require('readable-stream')\nvar toArrayBuffer = require('to-arraybuffer')\n\nvar MediaSource = typeof window !== 'undefined' && window.MediaSource\n\nvar DEFAULT_BUFFER_DURATION = 60 // seconds\n\nfunction MediaElementWrapper (elem, opts) {\n var self = this\n if (!(self instanceof MediaElementWrapper)) return new MediaElementWrapper(elem, opts)\n\n if (!MediaSource) throw new Error('web browser lacks MediaSource support')\n\n if (!opts) opts = {}\n self._debug = opts.debug\n self._bufferDuration = opts.bufferDuration || DEFAULT_BUFFER_DURATION\n self._elem = elem\n self._mediaSource = new MediaSource()\n self._streams = []\n self.detailedError = null\n\n self._errorHandler = function () {\n self._elem.removeEventListener('error', self._errorHandler)\n var streams = self._streams.slice()\n streams.forEach(function (stream) {\n stream.destroy(self._elem.error)\n })\n }\n self._elem.addEventListener('error', self._errorHandler)\n\n self._elem.src = window.URL.createObjectURL(self._mediaSource)\n}\n\n/*\n * `obj` can be a previous value returned by this function\n * or a string\n */\nMediaElementWrapper.prototype.createWriteStream = function (obj) {\n var self = this\n\n return new MediaSourceStream(self, obj)\n}\n\n/*\n * Use to trigger an error on the underlying media element\n */\nMediaElementWrapper.prototype.error = function (err) {\n var self = this\n\n // be careful not to overwrite any existing detailedError values\n if (!self.detailedError) {\n self.detailedError = err\n }\n self._dumpDebugData()\n try {\n self._mediaSource.endOfStream('decode')\n } catch (err) {}\n\n try {\n // Attempt to clean up object URL\n window.URL.revokeObjectURL(self._elem.src)\n } catch (err) {}\n}\n\n/*\n * When self._debug is set, dump all data to files\n */\nMediaElementWrapper.prototype._dumpDebugData = function () {\n var self = this\n\n if (self._debug) {\n self._debug = false // prevent multiple dumps on multiple errors\n self._streams.forEach(function (stream, i) {\n downloadBuffers(stream._debugBuffers, 'mediasource-stream-' + i)\n })\n }\n}\n\ninherits(MediaSourceStream, stream.Writable)\n\nfunction MediaSourceStream (wrapper, obj) {\n var self = this\n stream.Writable.call(self)\n\n self._wrapper = wrapper\n self._elem = wrapper._elem\n self._mediaSource = wrapper._mediaSource\n self._allStreams = wrapper._streams\n self._allStreams.push(self)\n self._bufferDuration = wrapper._bufferDuration\n self._sourceBuffer = null\n self._debugBuffers = []\n\n self._openHandler = function () {\n self._onSourceOpen()\n }\n self._flowHandler = function () {\n self._flow()\n }\n self._errorHandler = function (err) {\n if (!self.destroyed) {\n self.emit('error', err)\n }\n }\n\n if (typeof obj === 'string') {\n self._type = obj\n // Need to create a new sourceBuffer\n if (self._mediaSource.readyState === 'open') {\n self._createSourceBuffer()\n } else {\n self._mediaSource.addEventListener('sourceopen', self._openHandler)\n }\n } else if (obj._sourceBuffer === null) {\n obj.destroy()\n self._type = obj._type // The old stream was created but hasn't finished initializing\n self._mediaSource.addEventListener('sourceopen', self._openHandler)\n } else if (obj._sourceBuffer) {\n obj.destroy()\n self._type = obj._type\n self._sourceBuffer = obj._sourceBuffer // Copy over the old sourceBuffer\n self._debugBuffers = obj._debugBuffers // Copy over previous debug data\n self._sourceBuffer.addEventListener('updateend', self._flowHandler)\n self._sourceBuffer.addEventListener('error', self._errorHandler)\n } else {\n throw new Error('The argument to MediaElementWrapper.createWriteStream must be a string or a previous stream returned from that function')\n }\n\n self._elem.addEventListener('timeupdate', self._flowHandler)\n\n self.on('error', function (err) {\n self._wrapper.error(err)\n })\n\n self.on('finish', function () {\n if (self.destroyed) return\n self._finished = true\n if (self._allStreams.every(function (other) { return other._finished })) {\n self._wrapper._dumpDebugData()\n try {\n self._mediaSource.endOfStream()\n } catch (err) {}\n }\n })\n}\n\nMediaSourceStream.prototype._onSourceOpen = function () {\n var self = this\n if (self.destroyed) return\n\n self._mediaSource.removeEventListener('sourceopen', self._openHandler)\n self._createSourceBuffer()\n}\n\nMediaSourceStream.prototype.destroy = function (err) {\n var self = this\n if (self.destroyed) return\n self.destroyed = true\n\n // Remove from allStreams\n self._allStreams.splice(self._allStreams.indexOf(self), 1)\n\n self._mediaSource.removeEventListener('sourceopen', self._openHandler)\n self._elem.removeEventListener('timeupdate', self._flowHandler)\n if (self._sourceBuffer) {\n self._sourceBuffer.removeEventListener('updateend', self._flowHandler)\n self._sourceBuffer.removeEventListener('error', self._errorHandler)\n if (self._mediaSource.readyState === 'open') {\n self._sourceBuffer.abort()\n }\n }\n\n if (err) self.emit('error', err)\n self.emit('close')\n}\n\nMediaSourceStream.prototype._createSourceBuffer = function () {\n var self = this\n if (self.destroyed) return\n\n if (MediaSource.isTypeSupported(self._type)) {\n self._sourceBuffer = self._mediaSource.addSourceBuffer(self._type)\n self._sourceBuffer.addEventListener('updateend', self._flowHandler)\n self._sourceBuffer.addEventListener('error', self._errorHandler)\n if (self._cb) {\n var cb = self._cb\n self._cb = null\n cb()\n }\n } else {\n self.destroy(new Error('The provided type is not supported'))\n }\n}\n\nMediaSourceStream.prototype._write = function (chunk, encoding, cb) {\n var self = this\n if (self.destroyed) return\n if (!self._sourceBuffer) {\n self._cb = function (err) {\n if (err) return cb(err)\n self._write(chunk, encoding, cb)\n }\n return\n }\n\n if (self._sourceBuffer.updating) {\n return cb(new Error('Cannot append buffer while source buffer updating'))\n }\n\n var arr = toArrayBuffer(chunk)\n if (self._wrapper._debug) {\n self._debugBuffers.push(arr)\n }\n\n try {\n self._sourceBuffer.appendBuffer(arr)\n } catch (err) {\n // appendBuffer can throw for a number of reasons, most notably when the data\n // being appended is invalid or if appendBuffer is called after another error\n // already occurred on the media element. In Chrome, there may be useful debugging\n // info in chrome://media-internals\n self.destroy(err)\n return\n }\n self._cb = cb\n}\n\nMediaSourceStream.prototype._flow = function () {\n var self = this\n\n if (self.destroyed || !self._sourceBuffer || self._sourceBuffer.updating) {\n return\n }\n\n if (self._mediaSource.readyState === 'open') {\n // check buffer size\n if (self._getBufferDuration() > self._bufferDuration) {\n return\n }\n }\n\n if (self._cb) {\n var cb = self._cb\n self._cb = null\n cb()\n }\n}\n\n// TODO: if zero actually works in all browsers, remove the logic associated with this below\nvar EPSILON = 0\n\nMediaSourceStream.prototype._getBufferDuration = function () {\n var self = this\n\n var buffered = self._sourceBuffer.buffered\n var currentTime = self._elem.currentTime\n var bufferEnd = -1 // end of the buffer\n // This is a little over complex because some browsers seem to separate the\n // buffered region into multiple sections with slight gaps.\n for (var i = 0; i < buffered.length; i++) {\n var start = buffered.start(i)\n var end = buffered.end(i) + EPSILON\n\n if (start > currentTime) {\n // Reached past the joined buffer\n break\n } else if (bufferEnd >= 0 || currentTime <= end) {\n // Found the start/continuation of the joined buffer\n bufferEnd = end\n }\n }\n\n var bufferedTime = bufferEnd - currentTime\n if (bufferedTime < 0) {\n bufferedTime = 0\n }\n\n return bufferedTime\n}\n\nfunction downloadBuffers (bufs, name) {\n var a = document.createElement('a')\n a.href = window.URL.createObjectURL(new window.Blob(bufs))\n a.download = name\n a.click()\n}\n","module.exports = Storage\n\nconst queueMicrotask = require('queue-microtask')\n\nfunction Storage (chunkLength, opts) {\n if (!(this instanceof Storage)) return new Storage(chunkLength, opts)\n if (!opts) opts = {}\n\n this.chunkLength = Number(chunkLength)\n if (!this.chunkLength) throw new Error('First argument must be a chunk length')\n\n this.chunks = []\n this.closed = false\n this.length = Number(opts.length) || Infinity\n\n if (this.length !== Infinity) {\n this.lastChunkLength = (this.length % this.chunkLength) || this.chunkLength\n this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1\n }\n}\n\nStorage.prototype.put = function (index, buf, cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n\n const isLastChunk = (index === this.lastChunkIndex)\n if (isLastChunk && buf.length !== this.lastChunkLength) {\n return queueMicrotask(() => cb(new Error('Last chunk length must be ' + this.lastChunkLength)))\n }\n if (!isLastChunk && buf.length !== this.chunkLength) {\n return queueMicrotask(() => cb(new Error('Chunk length must be ' + this.chunkLength)))\n }\n this.chunks[index] = buf\n queueMicrotask(() => cb(null))\n}\n\nStorage.prototype.get = function (index, opts, cb = () => {}) {\n if (typeof opts === 'function') return this.get(index, null, opts)\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n\n let buf = this.chunks[index]\n\n if (!buf) {\n const err = new Error('Chunk not found')\n err.notFound = true\n return queueMicrotask(() => cb(err))\n }\n\n if (!opts) opts = {}\n\n const offset = opts.offset || 0\n const len = opts.length || (buf.length - offset)\n\n if (offset !== 0 || len !== buf.length) {\n buf = buf.slice(offset, len + offset)\n }\n\n queueMicrotask(() => cb(null, buf))\n}\n\nStorage.prototype.close = Storage.prototype.destroy = function (cb = () => {}) {\n if (this.closed) return queueMicrotask(() => cb(new Error('Storage is closed')))\n this.closed = true\n this.chunks = null\n queueMicrotask(() => cb(null))\n}\n","var bn = require('bn.js');\nvar brorand = require('brorand');\n\nfunction MillerRabin(rand) {\n this.rand = rand || new brorand.Rand();\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);\n\n // 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 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\n if (!k)\n k = Math.max(1, (len / 48) | 0);\n\n // Find d and s, (n - 1) = (2 ^ s) * d;\n var n1 = n.subn(1);\n for (var s = 0; !n1.testn(s); s++) {}\n var d = n.shrn(s);\n\n var rn1 = n1.toRed(red);\n\n var prime = true;\n for (; k > 0; k--) {\n var a = this._randrange(new bn(2), n1);\n if (cb)\n cb(a);\n\n var x = a.toRed(red).redPow(d);\n if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n continue;\n\n for (var i = 1; i < s; i++) {\n x = x.redSqr();\n\n if (x.cmp(rone) === 0)\n return false;\n if (x.cmp(rn1) === 0)\n break;\n }\n\n if (i === s)\n 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\n if (!k)\n k = Math.max(1, (len / 48) | 0);\n\n // Find d and s, (n - 1) = (2 ^ s) * d;\n var n1 = n.subn(1);\n for (var s = 0; !n1.testn(s); s++) {}\n var d = n.shrn(s);\n\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)\n return g;\n\n var x = a.toRed(red).redPow(d);\n if (x.cmp(rone) === 0 || x.cmp(rn1) === 0)\n continue;\n\n for (var i = 1; i < s; i++) {\n x = x.redSqr();\n\n if (x.cmp(rone) === 0)\n return x.fromRed().subn(1).gcd(n);\n if (x.cmp(rn1) === 0)\n 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};\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","'use strict';\n\n/**\n * @param typeMap [Object] Map of MIME type -> Array[extensions]\n * @param ...\n */\nfunction Mime() {\n this._types = Object.create(null);\n this._extensions = Object.create(null);\n\n for (let i = 0; i < arguments.length; i++) {\n this.define(arguments[i]);\n }\n\n this.define = this.define.bind(this);\n this.getType = this.getType.bind(this);\n this.getExtension = this.getExtension.bind(this);\n}\n\n/**\n * Define mimetype -> extension mappings. Each key is a mime-type that maps\n * to an array of extensions associated with the type. The first extension is\n * used as the default extension for the type.\n *\n * e.g. mime.define({'audio/ogg', ['oga', 'ogg', 'spx']});\n *\n * If a type declares an extension that has already been defined, an error will\n * be thrown. To suppress this error and force the extension to be associated\n * with the new type, pass `force`=true. Alternatively, you may prefix the\n * extension with \"*\" to map the type to extension, without mapping the\n * extension to the type.\n *\n * e.g. mime.define({'audio/wav', ['wav']}, {'audio/x-wav', ['*wav']});\n *\n *\n * @param map (Object) type definitions\n * @param force (Boolean) if true, force overriding of existing definitions\n */\nMime.prototype.define = function(typeMap, force) {\n for (let type in typeMap) {\n let extensions = typeMap[type].map(function(t) {\n return t.toLowerCase();\n });\n type = type.toLowerCase();\n\n for (let i = 0; i < extensions.length; i++) {\n const ext = extensions[i];\n\n // '*' prefix = not the preferred type for this extension. So fixup the\n // extension, and skip it.\n if (ext[0] === '*') {\n continue;\n }\n\n if (!force && (ext in this._types)) {\n throw new Error(\n 'Attempt to change mapping for \"' + ext +\n '\" extension from \"' + this._types[ext] + '\" to \"' + type +\n '\". Pass `force=true` to allow this, otherwise remove \"' + ext +\n '\" from the list of extensions for \"' + type + '\".'\n );\n }\n\n this._types[ext] = type;\n }\n\n // Use first extension as default\n if (force || !this._extensions[type]) {\n const ext = extensions[0];\n this._extensions[type] = (ext[0] !== '*') ? ext : ext.substr(1);\n }\n }\n};\n\n/**\n * Lookup a mime type based on extension\n */\nMime.prototype.getType = function(path) {\n path = String(path);\n let last = path.replace(/^.*[/\\\\]/, '').toLowerCase();\n let ext = last.replace(/^.*\\./, '').toLowerCase();\n\n let hasPath = last.length < path.length;\n let hasDot = ext.length < last.length - 1;\n\n return (hasDot || !hasPath) && this._types[ext] || null;\n};\n\n/**\n * Return file extension associated with a mime type\n */\nMime.prototype.getExtension = function(type) {\n type = /^\\s*([^;\\s]*)/.test(type) && RegExp.$1;\n return type && this._extensions[type.toLowerCase()] || null;\n};\n\nmodule.exports = Mime;\n","'use strict';\n\nlet Mime = require('./Mime');\nmodule.exports = new Mime(require('./types/standard'), require('./types/other'));\n","module.exports = {\"application/prs.cww\":[\"cww\"],\"application/vnd.1000minds.decision-model+xml\":[\"1km\"],\"application/vnd.3gpp.pic-bw-large\":[\"plb\"],\"application/vnd.3gpp.pic-bw-small\":[\"psb\"],\"application/vnd.3gpp.pic-bw-var\":[\"pvb\"],\"application/vnd.3gpp2.tcap\":[\"tcap\"],\"application/vnd.3m.post-it-notes\":[\"pwn\"],\"application/vnd.accpac.simply.aso\":[\"aso\"],\"application/vnd.accpac.simply.imp\":[\"imp\"],\"application/vnd.acucobol\":[\"acu\"],\"application/vnd.acucorp\":[\"atc\",\"acutc\"],\"application/vnd.adobe.air-application-installer-package+zip\":[\"air\"],\"application/vnd.adobe.formscentral.fcdt\":[\"fcdt\"],\"application/vnd.adobe.fxp\":[\"fxp\",\"fxpl\"],\"application/vnd.adobe.xdp+xml\":[\"xdp\"],\"application/vnd.adobe.xfdf\":[\"xfdf\"],\"application/vnd.ahead.space\":[\"ahead\"],\"application/vnd.airzip.filesecure.azf\":[\"azf\"],\"application/vnd.airzip.filesecure.azs\":[\"azs\"],\"application/vnd.amazon.ebook\":[\"azw\"],\"application/vnd.americandynamics.acc\":[\"acc\"],\"application/vnd.amiga.ami\":[\"ami\"],\"application/vnd.android.package-archive\":[\"apk\"],\"application/vnd.anser-web-certificate-issue-initiation\":[\"cii\"],\"application/vnd.anser-web-funds-transfer-initiation\":[\"fti\"],\"application/vnd.antix.game-component\":[\"atx\"],\"application/vnd.apple.installer+xml\":[\"mpkg\"],\"application/vnd.apple.keynote\":[\"key\"],\"application/vnd.apple.mpegurl\":[\"m3u8\"],\"application/vnd.apple.numbers\":[\"numbers\"],\"application/vnd.apple.pages\":[\"pages\"],\"application/vnd.apple.pkpass\":[\"pkpass\"],\"application/vnd.aristanetworks.swi\":[\"swi\"],\"application/vnd.astraea-software.iota\":[\"iota\"],\"application/vnd.audiograph\":[\"aep\"],\"application/vnd.balsamiq.bmml+xml\":[\"bmml\"],\"application/vnd.blueice.multipass\":[\"mpm\"],\"application/vnd.bmi\":[\"bmi\"],\"application/vnd.businessobjects\":[\"rep\"],\"application/vnd.chemdraw+xml\":[\"cdxml\"],\"application/vnd.chipnuts.karaoke-mmd\":[\"mmd\"],\"application/vnd.cinderella\":[\"cdy\"],\"application/vnd.citationstyles.style+xml\":[\"csl\"],\"application/vnd.claymore\":[\"cla\"],\"application/vnd.cloanto.rp9\":[\"rp9\"],\"application/vnd.clonk.c4group\":[\"c4g\",\"c4d\",\"c4f\",\"c4p\",\"c4u\"],\"application/vnd.cluetrust.cartomobile-config\":[\"c11amc\"],\"application/vnd.cluetrust.cartomobile-config-pkg\":[\"c11amz\"],\"application/vnd.commonspace\":[\"csp\"],\"application/vnd.contact.cmsg\":[\"cdbcmsg\"],\"application/vnd.cosmocaller\":[\"cmc\"],\"application/vnd.crick.clicker\":[\"clkx\"],\"application/vnd.crick.clicker.keyboard\":[\"clkk\"],\"application/vnd.crick.clicker.palette\":[\"clkp\"],\"application/vnd.crick.clicker.template\":[\"clkt\"],\"application/vnd.crick.clicker.wordbank\":[\"clkw\"],\"application/vnd.criticaltools.wbs+xml\":[\"wbs\"],\"application/vnd.ctc-posml\":[\"pml\"],\"application/vnd.cups-ppd\":[\"ppd\"],\"application/vnd.curl.car\":[\"car\"],\"application/vnd.curl.pcurl\":[\"pcurl\"],\"application/vnd.dart\":[\"dart\"],\"application/vnd.data-vision.rdz\":[\"rdz\"],\"application/vnd.dbf\":[\"dbf\"],\"application/vnd.dece.data\":[\"uvf\",\"uvvf\",\"uvd\",\"uvvd\"],\"application/vnd.dece.ttml+xml\":[\"uvt\",\"uvvt\"],\"application/vnd.dece.unspecified\":[\"uvx\",\"uvvx\"],\"application/vnd.dece.zip\":[\"uvz\",\"uvvz\"],\"application/vnd.denovo.fcselayout-link\":[\"fe_launch\"],\"application/vnd.dna\":[\"dna\"],\"application/vnd.dolby.mlp\":[\"mlp\"],\"application/vnd.dpgraph\":[\"dpg\"],\"application/vnd.dreamfactory\":[\"dfac\"],\"application/vnd.ds-keypoint\":[\"kpxx\"],\"application/vnd.dvb.ait\":[\"ait\"],\"application/vnd.dvb.service\":[\"svc\"],\"application/vnd.dynageo\":[\"geo\"],\"application/vnd.ecowin.chart\":[\"mag\"],\"application/vnd.enliven\":[\"nml\"],\"application/vnd.epson.esf\":[\"esf\"],\"application/vnd.epson.msf\":[\"msf\"],\"application/vnd.epson.quickanime\":[\"qam\"],\"application/vnd.epson.salt\":[\"slt\"],\"application/vnd.epson.ssf\":[\"ssf\"],\"application/vnd.eszigno3+xml\":[\"es3\",\"et3\"],\"application/vnd.ezpix-album\":[\"ez2\"],\"application/vnd.ezpix-package\":[\"ez3\"],\"application/vnd.fdf\":[\"fdf\"],\"application/vnd.fdsn.mseed\":[\"mseed\"],\"application/vnd.fdsn.seed\":[\"seed\",\"dataless\"],\"application/vnd.flographit\":[\"gph\"],\"application/vnd.fluxtime.clip\":[\"ftc\"],\"application/vnd.framemaker\":[\"fm\",\"frame\",\"maker\",\"book\"],\"application/vnd.frogans.fnc\":[\"fnc\"],\"application/vnd.frogans.ltf\":[\"ltf\"],\"application/vnd.fsc.weblaunch\":[\"fsc\"],\"application/vnd.fujitsu.oasys\":[\"oas\"],\"application/vnd.fujitsu.oasys2\":[\"oa2\"],\"application/vnd.fujitsu.oasys3\":[\"oa3\"],\"application/vnd.fujitsu.oasysgp\":[\"fg5\"],\"application/vnd.fujitsu.oasysprs\":[\"bh2\"],\"application/vnd.fujixerox.ddd\":[\"ddd\"],\"application/vnd.fujixerox.docuworks\":[\"xdw\"],\"application/vnd.fujixerox.docuworks.binder\":[\"xbd\"],\"application/vnd.fuzzysheet\":[\"fzs\"],\"application/vnd.genomatix.tuxedo\":[\"txd\"],\"application/vnd.geogebra.file\":[\"ggb\"],\"application/vnd.geogebra.tool\":[\"ggt\"],\"application/vnd.geometry-explorer\":[\"gex\",\"gre\"],\"application/vnd.geonext\":[\"gxt\"],\"application/vnd.geoplan\":[\"g2w\"],\"application/vnd.geospace\":[\"g3w\"],\"application/vnd.gmx\":[\"gmx\"],\"application/vnd.google-apps.document\":[\"gdoc\"],\"application/vnd.google-apps.presentation\":[\"gslides\"],\"application/vnd.google-apps.spreadsheet\":[\"gsheet\"],\"application/vnd.google-earth.kml+xml\":[\"kml\"],\"application/vnd.google-earth.kmz\":[\"kmz\"],\"application/vnd.grafeq\":[\"gqf\",\"gqs\"],\"application/vnd.groove-account\":[\"gac\"],\"application/vnd.groove-help\":[\"ghf\"],\"application/vnd.groove-identity-message\":[\"gim\"],\"application/vnd.groove-injector\":[\"grv\"],\"application/vnd.groove-tool-message\":[\"gtm\"],\"application/vnd.groove-tool-template\":[\"tpl\"],\"application/vnd.groove-vcard\":[\"vcg\"],\"application/vnd.hal+xml\":[\"hal\"],\"application/vnd.handheld-entertainment+xml\":[\"zmm\"],\"application/vnd.hbci\":[\"hbci\"],\"application/vnd.hhe.lesson-player\":[\"les\"],\"application/vnd.hp-hpgl\":[\"hpgl\"],\"application/vnd.hp-hpid\":[\"hpid\"],\"application/vnd.hp-hps\":[\"hps\"],\"application/vnd.hp-jlyt\":[\"jlt\"],\"application/vnd.hp-pcl\":[\"pcl\"],\"application/vnd.hp-pclxl\":[\"pclxl\"],\"application/vnd.hydrostatix.sof-data\":[\"sfd-hdstx\"],\"application/vnd.ibm.minipay\":[\"mpy\"],\"application/vnd.ibm.modcap\":[\"afp\",\"listafp\",\"list3820\"],\"application/vnd.ibm.rights-management\":[\"irm\"],\"application/vnd.ibm.secure-container\":[\"sc\"],\"application/vnd.iccprofile\":[\"icc\",\"icm\"],\"application/vnd.igloader\":[\"igl\"],\"application/vnd.immervision-ivp\":[\"ivp\"],\"application/vnd.immervision-ivu\":[\"ivu\"],\"application/vnd.insors.igm\":[\"igm\"],\"application/vnd.intercon.formnet\":[\"xpw\",\"xpx\"],\"application/vnd.intergeo\":[\"i2g\"],\"application/vnd.intu.qbo\":[\"qbo\"],\"application/vnd.intu.qfx\":[\"qfx\"],\"application/vnd.ipunplugged.rcprofile\":[\"rcprofile\"],\"application/vnd.irepository.package+xml\":[\"irp\"],\"application/vnd.is-xpr\":[\"xpr\"],\"application/vnd.isac.fcs\":[\"fcs\"],\"application/vnd.jam\":[\"jam\"],\"application/vnd.jcp.javame.midlet-rms\":[\"rms\"],\"application/vnd.jisp\":[\"jisp\"],\"application/vnd.joost.joda-archive\":[\"joda\"],\"application/vnd.kahootz\":[\"ktz\",\"ktr\"],\"application/vnd.kde.karbon\":[\"karbon\"],\"application/vnd.kde.kchart\":[\"chrt\"],\"application/vnd.kde.kformula\":[\"kfo\"],\"application/vnd.kde.kivio\":[\"flw\"],\"application/vnd.kde.kontour\":[\"kon\"],\"application/vnd.kde.kpresenter\":[\"kpr\",\"kpt\"],\"application/vnd.kde.kspread\":[\"ksp\"],\"application/vnd.kde.kword\":[\"kwd\",\"kwt\"],\"application/vnd.kenameaapp\":[\"htke\"],\"application/vnd.kidspiration\":[\"kia\"],\"application/vnd.kinar\":[\"kne\",\"knp\"],\"application/vnd.koan\":[\"skp\",\"skd\",\"skt\",\"skm\"],\"application/vnd.kodak-descriptor\":[\"sse\"],\"application/vnd.las.las+xml\":[\"lasxml\"],\"application/vnd.llamagraphics.life-balance.desktop\":[\"lbd\"],\"application/vnd.llamagraphics.life-balance.exchange+xml\":[\"lbe\"],\"application/vnd.lotus-1-2-3\":[\"123\"],\"application/vnd.lotus-approach\":[\"apr\"],\"application/vnd.lotus-freelance\":[\"pre\"],\"application/vnd.lotus-notes\":[\"nsf\"],\"application/vnd.lotus-organizer\":[\"org\"],\"application/vnd.lotus-screencam\":[\"scm\"],\"application/vnd.lotus-wordpro\":[\"lwp\"],\"application/vnd.macports.portpkg\":[\"portpkg\"],\"application/vnd.mapbox-vector-tile\":[\"mvt\"],\"application/vnd.mcd\":[\"mcd\"],\"application/vnd.medcalcdata\":[\"mc1\"],\"application/vnd.mediastation.cdkey\":[\"cdkey\"],\"application/vnd.mfer\":[\"mwf\"],\"application/vnd.mfmp\":[\"mfm\"],\"application/vnd.micrografx.flo\":[\"flo\"],\"application/vnd.micrografx.igx\":[\"igx\"],\"application/vnd.mif\":[\"mif\"],\"application/vnd.mobius.daf\":[\"daf\"],\"application/vnd.mobius.dis\":[\"dis\"],\"application/vnd.mobius.mbk\":[\"mbk\"],\"application/vnd.mobius.mqy\":[\"mqy\"],\"application/vnd.mobius.msl\":[\"msl\"],\"application/vnd.mobius.plc\":[\"plc\"],\"application/vnd.mobius.txf\":[\"txf\"],\"application/vnd.mophun.application\":[\"mpn\"],\"application/vnd.mophun.certificate\":[\"mpc\"],\"application/vnd.mozilla.xul+xml\":[\"xul\"],\"application/vnd.ms-artgalry\":[\"cil\"],\"application/vnd.ms-cab-compressed\":[\"cab\"],\"application/vnd.ms-excel\":[\"xls\",\"xlm\",\"xla\",\"xlc\",\"xlt\",\"xlw\"],\"application/vnd.ms-excel.addin.macroenabled.12\":[\"xlam\"],\"application/vnd.ms-excel.sheet.binary.macroenabled.12\":[\"xlsb\"],\"application/vnd.ms-excel.sheet.macroenabled.12\":[\"xlsm\"],\"application/vnd.ms-excel.template.macroenabled.12\":[\"xltm\"],\"application/vnd.ms-fontobject\":[\"eot\"],\"application/vnd.ms-htmlhelp\":[\"chm\"],\"application/vnd.ms-ims\":[\"ims\"],\"application/vnd.ms-lrm\":[\"lrm\"],\"application/vnd.ms-officetheme\":[\"thmx\"],\"application/vnd.ms-outlook\":[\"msg\"],\"application/vnd.ms-pki.seccat\":[\"cat\"],\"application/vnd.ms-pki.stl\":[\"*stl\"],\"application/vnd.ms-powerpoint\":[\"ppt\",\"pps\",\"pot\"],\"application/vnd.ms-powerpoint.addin.macroenabled.12\":[\"ppam\"],\"application/vnd.ms-powerpoint.presentation.macroenabled.12\":[\"pptm\"],\"application/vnd.ms-powerpoint.slide.macroenabled.12\":[\"sldm\"],\"application/vnd.ms-powerpoint.slideshow.macroenabled.12\":[\"ppsm\"],\"application/vnd.ms-powerpoint.template.macroenabled.12\":[\"potm\"],\"application/vnd.ms-project\":[\"mpp\",\"mpt\"],\"application/vnd.ms-word.document.macroenabled.12\":[\"docm\"],\"application/vnd.ms-word.template.macroenabled.12\":[\"dotm\"],\"application/vnd.ms-works\":[\"wps\",\"wks\",\"wcm\",\"wdb\"],\"application/vnd.ms-wpl\":[\"wpl\"],\"application/vnd.ms-xpsdocument\":[\"xps\"],\"application/vnd.mseq\":[\"mseq\"],\"application/vnd.musician\":[\"mus\"],\"application/vnd.muvee.style\":[\"msty\"],\"application/vnd.mynfc\":[\"taglet\"],\"application/vnd.neurolanguage.nlu\":[\"nlu\"],\"application/vnd.nitf\":[\"ntf\",\"nitf\"],\"application/vnd.noblenet-directory\":[\"nnd\"],\"application/vnd.noblenet-sealer\":[\"nns\"],\"application/vnd.noblenet-web\":[\"nnw\"],\"application/vnd.nokia.n-gage.ac+xml\":[\"*ac\"],\"application/vnd.nokia.n-gage.data\":[\"ngdat\"],\"application/vnd.nokia.n-gage.symbian.install\":[\"n-gage\"],\"application/vnd.nokia.radio-preset\":[\"rpst\"],\"application/vnd.nokia.radio-presets\":[\"rpss\"],\"application/vnd.novadigm.edm\":[\"edm\"],\"application/vnd.novadigm.edx\":[\"edx\"],\"application/vnd.novadigm.ext\":[\"ext\"],\"application/vnd.oasis.opendocument.chart\":[\"odc\"],\"application/vnd.oasis.opendocument.chart-template\":[\"otc\"],\"application/vnd.oasis.opendocument.database\":[\"odb\"],\"application/vnd.oasis.opendocument.formula\":[\"odf\"],\"application/vnd.oasis.opendocument.formula-template\":[\"odft\"],\"application/vnd.oasis.opendocument.graphics\":[\"odg\"],\"application/vnd.oasis.opendocument.graphics-template\":[\"otg\"],\"application/vnd.oasis.opendocument.image\":[\"odi\"],\"application/vnd.oasis.opendocument.image-template\":[\"oti\"],\"application/vnd.oasis.opendocument.presentation\":[\"odp\"],\"application/vnd.oasis.opendocument.presentation-template\":[\"otp\"],\"application/vnd.oasis.opendocument.spreadsheet\":[\"ods\"],\"application/vnd.oasis.opendocument.spreadsheet-template\":[\"ots\"],\"application/vnd.oasis.opendocument.text\":[\"odt\"],\"application/vnd.oasis.opendocument.text-master\":[\"odm\"],\"application/vnd.oasis.opendocument.text-template\":[\"ott\"],\"application/vnd.oasis.opendocument.text-web\":[\"oth\"],\"application/vnd.olpc-sugar\":[\"xo\"],\"application/vnd.oma.dd2+xml\":[\"dd2\"],\"application/vnd.openblox.game+xml\":[\"obgx\"],\"application/vnd.openofficeorg.extension\":[\"oxt\"],\"application/vnd.openstreetmap.data+xml\":[\"osm\"],\"application/vnd.openxmlformats-officedocument.presentationml.presentation\":[\"pptx\"],\"application/vnd.openxmlformats-officedocument.presentationml.slide\":[\"sldx\"],\"application/vnd.openxmlformats-officedocument.presentationml.slideshow\":[\"ppsx\"],\"application/vnd.openxmlformats-officedocument.presentationml.template\":[\"potx\"],\"application/vnd.openxmlformats-officedocument.spreadsheetml.sheet\":[\"xlsx\"],\"application/vnd.openxmlformats-officedocument.spreadsheetml.template\":[\"xltx\"],\"application/vnd.openxmlformats-officedocument.wordprocessingml.document\":[\"docx\"],\"application/vnd.openxmlformats-officedocument.wordprocessingml.template\":[\"dotx\"],\"application/vnd.osgeo.mapguide.package\":[\"mgp\"],\"application/vnd.osgi.dp\":[\"dp\"],\"application/vnd.osgi.subsystem\":[\"esa\"],\"application/vnd.palm\":[\"pdb\",\"pqa\",\"oprc\"],\"application/vnd.pawaafile\":[\"paw\"],\"application/vnd.pg.format\":[\"str\"],\"application/vnd.pg.osasli\":[\"ei6\"],\"application/vnd.picsel\":[\"efif\"],\"application/vnd.pmi.widget\":[\"wg\"],\"application/vnd.pocketlearn\":[\"plf\"],\"application/vnd.powerbuilder6\":[\"pbd\"],\"application/vnd.previewsystems.box\":[\"box\"],\"application/vnd.proteus.magazine\":[\"mgz\"],\"application/vnd.publishare-delta-tree\":[\"qps\"],\"application/vnd.pvi.ptid1\":[\"ptid\"],\"application/vnd.quark.quarkxpress\":[\"qxd\",\"qxt\",\"qwd\",\"qwt\",\"qxl\",\"qxb\"],\"application/vnd.rar\":[\"rar\"],\"application/vnd.realvnc.bed\":[\"bed\"],\"application/vnd.recordare.musicxml\":[\"mxl\"],\"application/vnd.recordare.musicxml+xml\":[\"musicxml\"],\"application/vnd.rig.cryptonote\":[\"cryptonote\"],\"application/vnd.rim.cod\":[\"cod\"],\"application/vnd.rn-realmedia\":[\"rm\"],\"application/vnd.rn-realmedia-vbr\":[\"rmvb\"],\"application/vnd.route66.link66+xml\":[\"link66\"],\"application/vnd.sailingtracker.track\":[\"st\"],\"application/vnd.seemail\":[\"see\"],\"application/vnd.sema\":[\"sema\"],\"application/vnd.semd\":[\"semd\"],\"application/vnd.semf\":[\"semf\"],\"application/vnd.shana.informed.formdata\":[\"ifm\"],\"application/vnd.shana.informed.formtemplate\":[\"itp\"],\"application/vnd.shana.informed.interchange\":[\"iif\"],\"application/vnd.shana.informed.package\":[\"ipk\"],\"application/vnd.simtech-mindmapper\":[\"twd\",\"twds\"],\"application/vnd.smaf\":[\"mmf\"],\"application/vnd.smart.teacher\":[\"teacher\"],\"application/vnd.software602.filler.form+xml\":[\"fo\"],\"application/vnd.solent.sdkm+xml\":[\"sdkm\",\"sdkd\"],\"application/vnd.spotfire.dxp\":[\"dxp\"],\"application/vnd.spotfire.sfs\":[\"sfs\"],\"application/vnd.stardivision.calc\":[\"sdc\"],\"application/vnd.stardivision.draw\":[\"sda\"],\"application/vnd.stardivision.impress\":[\"sdd\"],\"application/vnd.stardivision.math\":[\"smf\"],\"application/vnd.stardivision.writer\":[\"sdw\",\"vor\"],\"application/vnd.stardivision.writer-global\":[\"sgl\"],\"application/vnd.stepmania.package\":[\"smzip\"],\"application/vnd.stepmania.stepchart\":[\"sm\"],\"application/vnd.sun.wadl+xml\":[\"wadl\"],\"application/vnd.sun.xml.calc\":[\"sxc\"],\"application/vnd.sun.xml.calc.template\":[\"stc\"],\"application/vnd.sun.xml.draw\":[\"sxd\"],\"application/vnd.sun.xml.draw.template\":[\"std\"],\"application/vnd.sun.xml.impress\":[\"sxi\"],\"application/vnd.sun.xml.impress.template\":[\"sti\"],\"application/vnd.sun.xml.math\":[\"sxm\"],\"application/vnd.sun.xml.writer\":[\"sxw\"],\"application/vnd.sun.xml.writer.global\":[\"sxg\"],\"application/vnd.sun.xml.writer.template\":[\"stw\"],\"application/vnd.sus-calendar\":[\"sus\",\"susp\"],\"application/vnd.svd\":[\"svd\"],\"application/vnd.symbian.install\":[\"sis\",\"sisx\"],\"application/vnd.syncml+xml\":[\"xsm\"],\"application/vnd.syncml.dm+wbxml\":[\"bdm\"],\"application/vnd.syncml.dm+xml\":[\"xdm\"],\"application/vnd.syncml.dmddf+xml\":[\"ddf\"],\"application/vnd.tao.intent-module-archive\":[\"tao\"],\"application/vnd.tcpdump.pcap\":[\"pcap\",\"cap\",\"dmp\"],\"application/vnd.tmobile-livetv\":[\"tmo\"],\"application/vnd.trid.tpt\":[\"tpt\"],\"application/vnd.triscape.mxs\":[\"mxs\"],\"application/vnd.trueapp\":[\"tra\"],\"application/vnd.ufdl\":[\"ufd\",\"ufdl\"],\"application/vnd.uiq.theme\":[\"utz\"],\"application/vnd.umajin\":[\"umj\"],\"application/vnd.unity\":[\"unityweb\"],\"application/vnd.uoml+xml\":[\"uoml\"],\"application/vnd.vcx\":[\"vcx\"],\"application/vnd.visio\":[\"vsd\",\"vst\",\"vss\",\"vsw\"],\"application/vnd.visionary\":[\"vis\"],\"application/vnd.vsf\":[\"vsf\"],\"application/vnd.wap.wbxml\":[\"wbxml\"],\"application/vnd.wap.wmlc\":[\"wmlc\"],\"application/vnd.wap.wmlscriptc\":[\"wmlsc\"],\"application/vnd.webturbo\":[\"wtb\"],\"application/vnd.wolfram.player\":[\"nbp\"],\"application/vnd.wordperfect\":[\"wpd\"],\"application/vnd.wqd\":[\"wqd\"],\"application/vnd.wt.stf\":[\"stf\"],\"application/vnd.xara\":[\"xar\"],\"application/vnd.xfdl\":[\"xfdl\"],\"application/vnd.yamaha.hv-dic\":[\"hvd\"],\"application/vnd.yamaha.hv-script\":[\"hvs\"],\"application/vnd.yamaha.hv-voice\":[\"hvp\"],\"application/vnd.yamaha.openscoreformat\":[\"osf\"],\"application/vnd.yamaha.openscoreformat.osfpvg+xml\":[\"osfpvg\"],\"application/vnd.yamaha.smaf-audio\":[\"saf\"],\"application/vnd.yamaha.smaf-phrase\":[\"spf\"],\"application/vnd.yellowriver-custom-menu\":[\"cmp\"],\"application/vnd.zul\":[\"zir\",\"zirz\"],\"application/vnd.zzazz.deck+xml\":[\"zaz\"],\"application/x-7z-compressed\":[\"7z\"],\"application/x-abiword\":[\"abw\"],\"application/x-ace-compressed\":[\"ace\"],\"application/x-apple-diskimage\":[\"*dmg\"],\"application/x-arj\":[\"arj\"],\"application/x-authorware-bin\":[\"aab\",\"x32\",\"u32\",\"vox\"],\"application/x-authorware-map\":[\"aam\"],\"application/x-authorware-seg\":[\"aas\"],\"application/x-bcpio\":[\"bcpio\"],\"application/x-bdoc\":[\"*bdoc\"],\"application/x-bittorrent\":[\"torrent\"],\"application/x-blorb\":[\"blb\",\"blorb\"],\"application/x-bzip\":[\"bz\"],\"application/x-bzip2\":[\"bz2\",\"boz\"],\"application/x-cbr\":[\"cbr\",\"cba\",\"cbt\",\"cbz\",\"cb7\"],\"application/x-cdlink\":[\"vcd\"],\"application/x-cfs-compressed\":[\"cfs\"],\"application/x-chat\":[\"chat\"],\"application/x-chess-pgn\":[\"pgn\"],\"application/x-chrome-extension\":[\"crx\"],\"application/x-cocoa\":[\"cco\"],\"application/x-conference\":[\"nsc\"],\"application/x-cpio\":[\"cpio\"],\"application/x-csh\":[\"csh\"],\"application/x-debian-package\":[\"*deb\",\"udeb\"],\"application/x-dgc-compressed\":[\"dgc\"],\"application/x-director\":[\"dir\",\"dcr\",\"dxr\",\"cst\",\"cct\",\"cxt\",\"w3d\",\"fgd\",\"swa\"],\"application/x-doom\":[\"wad\"],\"application/x-dtbncx+xml\":[\"ncx\"],\"application/x-dtbook+xml\":[\"dtb\"],\"application/x-dtbresource+xml\":[\"res\"],\"application/x-dvi\":[\"dvi\"],\"application/x-envoy\":[\"evy\"],\"application/x-eva\":[\"eva\"],\"application/x-font-bdf\":[\"bdf\"],\"application/x-font-ghostscript\":[\"gsf\"],\"application/x-font-linux-psf\":[\"psf\"],\"application/x-font-pcf\":[\"pcf\"],\"application/x-font-snf\":[\"snf\"],\"application/x-font-type1\":[\"pfa\",\"pfb\",\"pfm\",\"afm\"],\"application/x-freearc\":[\"arc\"],\"application/x-futuresplash\":[\"spl\"],\"application/x-gca-compressed\":[\"gca\"],\"application/x-glulx\":[\"ulx\"],\"application/x-gnumeric\":[\"gnumeric\"],\"application/x-gramps-xml\":[\"gramps\"],\"application/x-gtar\":[\"gtar\"],\"application/x-hdf\":[\"hdf\"],\"application/x-httpd-php\":[\"php\"],\"application/x-install-instructions\":[\"install\"],\"application/x-iso9660-image\":[\"*iso\"],\"application/x-iwork-keynote-sffkey\":[\"*key\"],\"application/x-iwork-numbers-sffnumbers\":[\"*numbers\"],\"application/x-iwork-pages-sffpages\":[\"*pages\"],\"application/x-java-archive-diff\":[\"jardiff\"],\"application/x-java-jnlp-file\":[\"jnlp\"],\"application/x-keepass2\":[\"kdbx\"],\"application/x-latex\":[\"latex\"],\"application/x-lua-bytecode\":[\"luac\"],\"application/x-lzh-compressed\":[\"lzh\",\"lha\"],\"application/x-makeself\":[\"run\"],\"application/x-mie\":[\"mie\"],\"application/x-mobipocket-ebook\":[\"prc\",\"mobi\"],\"application/x-ms-application\":[\"application\"],\"application/x-ms-shortcut\":[\"lnk\"],\"application/x-ms-wmd\":[\"wmd\"],\"application/x-ms-wmz\":[\"wmz\"],\"application/x-ms-xbap\":[\"xbap\"],\"application/x-msaccess\":[\"mdb\"],\"application/x-msbinder\":[\"obd\"],\"application/x-mscardfile\":[\"crd\"],\"application/x-msclip\":[\"clp\"],\"application/x-msdos-program\":[\"*exe\"],\"application/x-msdownload\":[\"*exe\",\"*dll\",\"com\",\"bat\",\"*msi\"],\"application/x-msmediaview\":[\"mvb\",\"m13\",\"m14\"],\"application/x-msmetafile\":[\"*wmf\",\"*wmz\",\"*emf\",\"emz\"],\"application/x-msmoney\":[\"mny\"],\"application/x-mspublisher\":[\"pub\"],\"application/x-msschedule\":[\"scd\"],\"application/x-msterminal\":[\"trm\"],\"application/x-mswrite\":[\"wri\"],\"application/x-netcdf\":[\"nc\",\"cdf\"],\"application/x-ns-proxy-autoconfig\":[\"pac\"],\"application/x-nzb\":[\"nzb\"],\"application/x-perl\":[\"pl\",\"pm\"],\"application/x-pilot\":[\"*prc\",\"*pdb\"],\"application/x-pkcs12\":[\"p12\",\"pfx\"],\"application/x-pkcs7-certificates\":[\"p7b\",\"spc\"],\"application/x-pkcs7-certreqresp\":[\"p7r\"],\"application/x-rar-compressed\":[\"*rar\"],\"application/x-redhat-package-manager\":[\"rpm\"],\"application/x-research-info-systems\":[\"ris\"],\"application/x-sea\":[\"sea\"],\"application/x-sh\":[\"sh\"],\"application/x-shar\":[\"shar\"],\"application/x-shockwave-flash\":[\"swf\"],\"application/x-silverlight-app\":[\"xap\"],\"application/x-sql\":[\"sql\"],\"application/x-stuffit\":[\"sit\"],\"application/x-stuffitx\":[\"sitx\"],\"application/x-subrip\":[\"srt\"],\"application/x-sv4cpio\":[\"sv4cpio\"],\"application/x-sv4crc\":[\"sv4crc\"],\"application/x-t3vm-image\":[\"t3\"],\"application/x-tads\":[\"gam\"],\"application/x-tar\":[\"tar\"],\"application/x-tcl\":[\"tcl\",\"tk\"],\"application/x-tex\":[\"tex\"],\"application/x-tex-tfm\":[\"tfm\"],\"application/x-texinfo\":[\"texinfo\",\"texi\"],\"application/x-tgif\":[\"*obj\"],\"application/x-ustar\":[\"ustar\"],\"application/x-virtualbox-hdd\":[\"hdd\"],\"application/x-virtualbox-ova\":[\"ova\"],\"application/x-virtualbox-ovf\":[\"ovf\"],\"application/x-virtualbox-vbox\":[\"vbox\"],\"application/x-virtualbox-vbox-extpack\":[\"vbox-extpack\"],\"application/x-virtualbox-vdi\":[\"vdi\"],\"application/x-virtualbox-vhd\":[\"vhd\"],\"application/x-virtualbox-vmdk\":[\"vmdk\"],\"application/x-wais-source\":[\"src\"],\"application/x-web-app-manifest+json\":[\"webapp\"],\"application/x-x509-ca-cert\":[\"der\",\"crt\",\"pem\"],\"application/x-xfig\":[\"fig\"],\"application/x-xliff+xml\":[\"*xlf\"],\"application/x-xpinstall\":[\"xpi\"],\"application/x-xz\":[\"xz\"],\"application/x-zmachine\":[\"z1\",\"z2\",\"z3\",\"z4\",\"z5\",\"z6\",\"z7\",\"z8\"],\"audio/vnd.dece.audio\":[\"uva\",\"uvva\"],\"audio/vnd.digital-winds\":[\"eol\"],\"audio/vnd.dra\":[\"dra\"],\"audio/vnd.dts\":[\"dts\"],\"audio/vnd.dts.hd\":[\"dtshd\"],\"audio/vnd.lucent.voice\":[\"lvp\"],\"audio/vnd.ms-playready.media.pya\":[\"pya\"],\"audio/vnd.nuera.ecelp4800\":[\"ecelp4800\"],\"audio/vnd.nuera.ecelp7470\":[\"ecelp7470\"],\"audio/vnd.nuera.ecelp9600\":[\"ecelp9600\"],\"audio/vnd.rip\":[\"rip\"],\"audio/x-aac\":[\"aac\"],\"audio/x-aiff\":[\"aif\",\"aiff\",\"aifc\"],\"audio/x-caf\":[\"caf\"],\"audio/x-flac\":[\"flac\"],\"audio/x-m4a\":[\"*m4a\"],\"audio/x-matroska\":[\"mka\"],\"audio/x-mpegurl\":[\"m3u\"],\"audio/x-ms-wax\":[\"wax\"],\"audio/x-ms-wma\":[\"wma\"],\"audio/x-pn-realaudio\":[\"ram\",\"ra\"],\"audio/x-pn-realaudio-plugin\":[\"rmp\"],\"audio/x-realaudio\":[\"*ra\"],\"audio/x-wav\":[\"*wav\"],\"chemical/x-cdx\":[\"cdx\"],\"chemical/x-cif\":[\"cif\"],\"chemical/x-cmdf\":[\"cmdf\"],\"chemical/x-cml\":[\"cml\"],\"chemical/x-csml\":[\"csml\"],\"chemical/x-xyz\":[\"xyz\"],\"image/prs.btif\":[\"btif\"],\"image/prs.pti\":[\"pti\"],\"image/vnd.adobe.photoshop\":[\"psd\"],\"image/vnd.airzip.accelerator.azv\":[\"azv\"],\"image/vnd.dece.graphic\":[\"uvi\",\"uvvi\",\"uvg\",\"uvvg\"],\"image/vnd.djvu\":[\"djvu\",\"djv\"],\"image/vnd.dvb.subtitle\":[\"*sub\"],\"image/vnd.dwg\":[\"dwg\"],\"image/vnd.dxf\":[\"dxf\"],\"image/vnd.fastbidsheet\":[\"fbs\"],\"image/vnd.fpx\":[\"fpx\"],\"image/vnd.fst\":[\"fst\"],\"image/vnd.fujixerox.edmics-mmr\":[\"mmr\"],\"image/vnd.fujixerox.edmics-rlc\":[\"rlc\"],\"image/vnd.microsoft.icon\":[\"ico\"],\"image/vnd.ms-dds\":[\"dds\"],\"image/vnd.ms-modi\":[\"mdi\"],\"image/vnd.ms-photo\":[\"wdp\"],\"image/vnd.net-fpx\":[\"npx\"],\"image/vnd.pco.b16\":[\"b16\"],\"image/vnd.tencent.tap\":[\"tap\"],\"image/vnd.valve.source.texture\":[\"vtf\"],\"image/vnd.wap.wbmp\":[\"wbmp\"],\"image/vnd.xiff\":[\"xif\"],\"image/vnd.zbrush.pcx\":[\"pcx\"],\"image/x-3ds\":[\"3ds\"],\"image/x-cmu-raster\":[\"ras\"],\"image/x-cmx\":[\"cmx\"],\"image/x-freehand\":[\"fh\",\"fhc\",\"fh4\",\"fh5\",\"fh7\"],\"image/x-icon\":[\"*ico\"],\"image/x-jng\":[\"jng\"],\"image/x-mrsid-image\":[\"sid\"],\"image/x-ms-bmp\":[\"*bmp\"],\"image/x-pcx\":[\"*pcx\"],\"image/x-pict\":[\"pic\",\"pct\"],\"image/x-portable-anymap\":[\"pnm\"],\"image/x-portable-bitmap\":[\"pbm\"],\"image/x-portable-graymap\":[\"pgm\"],\"image/x-portable-pixmap\":[\"ppm\"],\"image/x-rgb\":[\"rgb\"],\"image/x-tga\":[\"tga\"],\"image/x-xbitmap\":[\"xbm\"],\"image/x-xpixmap\":[\"xpm\"],\"image/x-xwindowdump\":[\"xwd\"],\"message/vnd.wfa.wsc\":[\"wsc\"],\"model/vnd.collada+xml\":[\"dae\"],\"model/vnd.dwf\":[\"dwf\"],\"model/vnd.gdl\":[\"gdl\"],\"model/vnd.gtw\":[\"gtw\"],\"model/vnd.mts\":[\"mts\"],\"model/vnd.opengex\":[\"ogex\"],\"model/vnd.parasolid.transmit.binary\":[\"x_b\"],\"model/vnd.parasolid.transmit.text\":[\"x_t\"],\"model/vnd.sap.vds\":[\"vds\"],\"model/vnd.usdz+zip\":[\"usdz\"],\"model/vnd.valve.source.compiled-map\":[\"bsp\"],\"model/vnd.vtu\":[\"vtu\"],\"text/prs.lines.tag\":[\"dsc\"],\"text/vnd.curl\":[\"curl\"],\"text/vnd.curl.dcurl\":[\"dcurl\"],\"text/vnd.curl.mcurl\":[\"mcurl\"],\"text/vnd.curl.scurl\":[\"scurl\"],\"text/vnd.dvb.subtitle\":[\"sub\"],\"text/vnd.fly\":[\"fly\"],\"text/vnd.fmi.flexstor\":[\"flx\"],\"text/vnd.graphviz\":[\"gv\"],\"text/vnd.in3d.3dml\":[\"3dml\"],\"text/vnd.in3d.spot\":[\"spot\"],\"text/vnd.sun.j2me.app-descriptor\":[\"jad\"],\"text/vnd.wap.wml\":[\"wml\"],\"text/vnd.wap.wmlscript\":[\"wmls\"],\"text/x-asm\":[\"s\",\"asm\"],\"text/x-c\":[\"c\",\"cc\",\"cxx\",\"cpp\",\"h\",\"hh\",\"dic\"],\"text/x-component\":[\"htc\"],\"text/x-fortran\":[\"f\",\"for\",\"f77\",\"f90\"],\"text/x-handlebars-template\":[\"hbs\"],\"text/x-java-source\":[\"java\"],\"text/x-lua\":[\"lua\"],\"text/x-markdown\":[\"mkd\"],\"text/x-nfo\":[\"nfo\"],\"text/x-opml\":[\"opml\"],\"text/x-org\":[\"*org\"],\"text/x-pascal\":[\"p\",\"pas\"],\"text/x-processing\":[\"pde\"],\"text/x-sass\":[\"sass\"],\"text/x-scss\":[\"scss\"],\"text/x-setext\":[\"etx\"],\"text/x-sfv\":[\"sfv\"],\"text/x-suse-ymp\":[\"ymp\"],\"text/x-uuencode\":[\"uu\"],\"text/x-vcalendar\":[\"vcs\"],\"text/x-vcard\":[\"vcf\"],\"video/vnd.dece.hd\":[\"uvh\",\"uvvh\"],\"video/vnd.dece.mobile\":[\"uvm\",\"uvvm\"],\"video/vnd.dece.pd\":[\"uvp\",\"uvvp\"],\"video/vnd.dece.sd\":[\"uvs\",\"uvvs\"],\"video/vnd.dece.video\":[\"uvv\",\"uvvv\"],\"video/vnd.dvb.file\":[\"dvb\"],\"video/vnd.fvt\":[\"fvt\"],\"video/vnd.mpegurl\":[\"mxu\",\"m4u\"],\"video/vnd.ms-playready.media.pyv\":[\"pyv\"],\"video/vnd.uvvu.mp4\":[\"uvu\",\"uvvu\"],\"video/vnd.vivo\":[\"viv\"],\"video/x-f4v\":[\"f4v\"],\"video/x-fli\":[\"fli\"],\"video/x-flv\":[\"flv\"],\"video/x-m4v\":[\"m4v\"],\"video/x-matroska\":[\"mkv\",\"mk3d\",\"mks\"],\"video/x-mng\":[\"mng\"],\"video/x-ms-asf\":[\"asf\",\"asx\"],\"video/x-ms-vob\":[\"vob\"],\"video/x-ms-wm\":[\"wm\"],\"video/x-ms-wmv\":[\"wmv\"],\"video/x-ms-wmx\":[\"wmx\"],\"video/x-ms-wvx\":[\"wvx\"],\"video/x-msvideo\":[\"avi\"],\"video/x-sgi-movie\":[\"movie\"],\"video/x-smv\":[\"smv\"],\"x-conference/x-cooltalk\":[\"ice\"]};","module.exports = {\"application/andrew-inset\":[\"ez\"],\"application/applixware\":[\"aw\"],\"application/atom+xml\":[\"atom\"],\"application/atomcat+xml\":[\"atomcat\"],\"application/atomdeleted+xml\":[\"atomdeleted\"],\"application/atomsvc+xml\":[\"atomsvc\"],\"application/atsc-dwd+xml\":[\"dwd\"],\"application/atsc-held+xml\":[\"held\"],\"application/atsc-rsat+xml\":[\"rsat\"],\"application/bdoc\":[\"bdoc\"],\"application/calendar+xml\":[\"xcs\"],\"application/ccxml+xml\":[\"ccxml\"],\"application/cdfx+xml\":[\"cdfx\"],\"application/cdmi-capability\":[\"cdmia\"],\"application/cdmi-container\":[\"cdmic\"],\"application/cdmi-domain\":[\"cdmid\"],\"application/cdmi-object\":[\"cdmio\"],\"application/cdmi-queue\":[\"cdmiq\"],\"application/cu-seeme\":[\"cu\"],\"application/dash+xml\":[\"mpd\"],\"application/davmount+xml\":[\"davmount\"],\"application/docbook+xml\":[\"dbk\"],\"application/dssc+der\":[\"dssc\"],\"application/dssc+xml\":[\"xdssc\"],\"application/ecmascript\":[\"es\",\"ecma\"],\"application/emma+xml\":[\"emma\"],\"application/emotionml+xml\":[\"emotionml\"],\"application/epub+zip\":[\"epub\"],\"application/exi\":[\"exi\"],\"application/express\":[\"exp\"],\"application/fdt+xml\":[\"fdt\"],\"application/font-tdpfr\":[\"pfr\"],\"application/geo+json\":[\"geojson\"],\"application/gml+xml\":[\"gml\"],\"application/gpx+xml\":[\"gpx\"],\"application/gxf\":[\"gxf\"],\"application/gzip\":[\"gz\"],\"application/hjson\":[\"hjson\"],\"application/hyperstudio\":[\"stk\"],\"application/inkml+xml\":[\"ink\",\"inkml\"],\"application/ipfix\":[\"ipfix\"],\"application/its+xml\":[\"its\"],\"application/java-archive\":[\"jar\",\"war\",\"ear\"],\"application/java-serialized-object\":[\"ser\"],\"application/java-vm\":[\"class\"],\"application/javascript\":[\"js\",\"mjs\"],\"application/json\":[\"json\",\"map\"],\"application/json5\":[\"json5\"],\"application/jsonml+json\":[\"jsonml\"],\"application/ld+json\":[\"jsonld\"],\"application/lgr+xml\":[\"lgr\"],\"application/lost+xml\":[\"lostxml\"],\"application/mac-binhex40\":[\"hqx\"],\"application/mac-compactpro\":[\"cpt\"],\"application/mads+xml\":[\"mads\"],\"application/manifest+json\":[\"webmanifest\"],\"application/marc\":[\"mrc\"],\"application/marcxml+xml\":[\"mrcx\"],\"application/mathematica\":[\"ma\",\"nb\",\"mb\"],\"application/mathml+xml\":[\"mathml\"],\"application/mbox\":[\"mbox\"],\"application/mediaservercontrol+xml\":[\"mscml\"],\"application/metalink+xml\":[\"metalink\"],\"application/metalink4+xml\":[\"meta4\"],\"application/mets+xml\":[\"mets\"],\"application/mmt-aei+xml\":[\"maei\"],\"application/mmt-usd+xml\":[\"musd\"],\"application/mods+xml\":[\"mods\"],\"application/mp21\":[\"m21\",\"mp21\"],\"application/mp4\":[\"mp4s\",\"m4p\"],\"application/msword\":[\"doc\",\"dot\"],\"application/mxf\":[\"mxf\"],\"application/n-quads\":[\"nq\"],\"application/n-triples\":[\"nt\"],\"application/node\":[\"cjs\"],\"application/octet-stream\":[\"bin\",\"dms\",\"lrf\",\"mar\",\"so\",\"dist\",\"distz\",\"pkg\",\"bpk\",\"dump\",\"elc\",\"deploy\",\"exe\",\"dll\",\"deb\",\"dmg\",\"iso\",\"img\",\"msi\",\"msp\",\"msm\",\"buffer\"],\"application/oda\":[\"oda\"],\"application/oebps-package+xml\":[\"opf\"],\"application/ogg\":[\"ogx\"],\"application/omdoc+xml\":[\"omdoc\"],\"application/onenote\":[\"onetoc\",\"onetoc2\",\"onetmp\",\"onepkg\"],\"application/oxps\":[\"oxps\"],\"application/p2p-overlay+xml\":[\"relo\"],\"application/patch-ops-error+xml\":[\"xer\"],\"application/pdf\":[\"pdf\"],\"application/pgp-encrypted\":[\"pgp\"],\"application/pgp-signature\":[\"asc\",\"sig\"],\"application/pics-rules\":[\"prf\"],\"application/pkcs10\":[\"p10\"],\"application/pkcs7-mime\":[\"p7m\",\"p7c\"],\"application/pkcs7-signature\":[\"p7s\"],\"application/pkcs8\":[\"p8\"],\"application/pkix-attr-cert\":[\"ac\"],\"application/pkix-cert\":[\"cer\"],\"application/pkix-crl\":[\"crl\"],\"application/pkix-pkipath\":[\"pkipath\"],\"application/pkixcmp\":[\"pki\"],\"application/pls+xml\":[\"pls\"],\"application/postscript\":[\"ai\",\"eps\",\"ps\"],\"application/provenance+xml\":[\"provx\"],\"application/pskc+xml\":[\"pskcxml\"],\"application/raml+yaml\":[\"raml\"],\"application/rdf+xml\":[\"rdf\",\"owl\"],\"application/reginfo+xml\":[\"rif\"],\"application/relax-ng-compact-syntax\":[\"rnc\"],\"application/resource-lists+xml\":[\"rl\"],\"application/resource-lists-diff+xml\":[\"rld\"],\"application/rls-services+xml\":[\"rs\"],\"application/route-apd+xml\":[\"rapd\"],\"application/route-s-tsid+xml\":[\"sls\"],\"application/route-usd+xml\":[\"rusd\"],\"application/rpki-ghostbusters\":[\"gbr\"],\"application/rpki-manifest\":[\"mft\"],\"application/rpki-roa\":[\"roa\"],\"application/rsd+xml\":[\"rsd\"],\"application/rss+xml\":[\"rss\"],\"application/rtf\":[\"rtf\"],\"application/sbml+xml\":[\"sbml\"],\"application/scvp-cv-request\":[\"scq\"],\"application/scvp-cv-response\":[\"scs\"],\"application/scvp-vp-request\":[\"spq\"],\"application/scvp-vp-response\":[\"spp\"],\"application/sdp\":[\"sdp\"],\"application/senml+xml\":[\"senmlx\"],\"application/sensml+xml\":[\"sensmlx\"],\"application/set-payment-initiation\":[\"setpay\"],\"application/set-registration-initiation\":[\"setreg\"],\"application/shf+xml\":[\"shf\"],\"application/sieve\":[\"siv\",\"sieve\"],\"application/smil+xml\":[\"smi\",\"smil\"],\"application/sparql-query\":[\"rq\"],\"application/sparql-results+xml\":[\"srx\"],\"application/srgs\":[\"gram\"],\"application/srgs+xml\":[\"grxml\"],\"application/sru+xml\":[\"sru\"],\"application/ssdl+xml\":[\"ssdl\"],\"application/ssml+xml\":[\"ssml\"],\"application/swid+xml\":[\"swidtag\"],\"application/tei+xml\":[\"tei\",\"teicorpus\"],\"application/thraud+xml\":[\"tfi\"],\"application/timestamped-data\":[\"tsd\"],\"application/toml\":[\"toml\"],\"application/trig\":[\"trig\"],\"application/ttml+xml\":[\"ttml\"],\"application/ubjson\":[\"ubj\"],\"application/urc-ressheet+xml\":[\"rsheet\"],\"application/urc-targetdesc+xml\":[\"td\"],\"application/voicexml+xml\":[\"vxml\"],\"application/wasm\":[\"wasm\"],\"application/widget\":[\"wgt\"],\"application/winhlp\":[\"hlp\"],\"application/wsdl+xml\":[\"wsdl\"],\"application/wspolicy+xml\":[\"wspolicy\"],\"application/xaml+xml\":[\"xaml\"],\"application/xcap-att+xml\":[\"xav\"],\"application/xcap-caps+xml\":[\"xca\"],\"application/xcap-diff+xml\":[\"xdf\"],\"application/xcap-el+xml\":[\"xel\"],\"application/xcap-ns+xml\":[\"xns\"],\"application/xenc+xml\":[\"xenc\"],\"application/xhtml+xml\":[\"xhtml\",\"xht\"],\"application/xliff+xml\":[\"xlf\"],\"application/xml\":[\"xml\",\"xsl\",\"xsd\",\"rng\"],\"application/xml-dtd\":[\"dtd\"],\"application/xop+xml\":[\"xop\"],\"application/xproc+xml\":[\"xpl\"],\"application/xslt+xml\":[\"*xsl\",\"xslt\"],\"application/xspf+xml\":[\"xspf\"],\"application/xv+xml\":[\"mxml\",\"xhvml\",\"xvml\",\"xvm\"],\"application/yang\":[\"yang\"],\"application/yin+xml\":[\"yin\"],\"application/zip\":[\"zip\"],\"audio/3gpp\":[\"*3gpp\"],\"audio/adpcm\":[\"adp\"],\"audio/amr\":[\"amr\"],\"audio/basic\":[\"au\",\"snd\"],\"audio/midi\":[\"mid\",\"midi\",\"kar\",\"rmi\"],\"audio/mobile-xmf\":[\"mxmf\"],\"audio/mp3\":[\"*mp3\"],\"audio/mp4\":[\"m4a\",\"mp4a\"],\"audio/mpeg\":[\"mpga\",\"mp2\",\"mp2a\",\"mp3\",\"m2a\",\"m3a\"],\"audio/ogg\":[\"oga\",\"ogg\",\"spx\",\"opus\"],\"audio/s3m\":[\"s3m\"],\"audio/silk\":[\"sil\"],\"audio/wav\":[\"wav\"],\"audio/wave\":[\"*wav\"],\"audio/webm\":[\"weba\"],\"audio/xm\":[\"xm\"],\"font/collection\":[\"ttc\"],\"font/otf\":[\"otf\"],\"font/ttf\":[\"ttf\"],\"font/woff\":[\"woff\"],\"font/woff2\":[\"woff2\"],\"image/aces\":[\"exr\"],\"image/apng\":[\"apng\"],\"image/avif\":[\"avif\"],\"image/bmp\":[\"bmp\"],\"image/cgm\":[\"cgm\"],\"image/dicom-rle\":[\"drle\"],\"image/emf\":[\"emf\"],\"image/fits\":[\"fits\"],\"image/g3fax\":[\"g3\"],\"image/gif\":[\"gif\"],\"image/heic\":[\"heic\"],\"image/heic-sequence\":[\"heics\"],\"image/heif\":[\"heif\"],\"image/heif-sequence\":[\"heifs\"],\"image/hej2k\":[\"hej2\"],\"image/hsj2\":[\"hsj2\"],\"image/ief\":[\"ief\"],\"image/jls\":[\"jls\"],\"image/jp2\":[\"jp2\",\"jpg2\"],\"image/jpeg\":[\"jpeg\",\"jpg\",\"jpe\"],\"image/jph\":[\"jph\"],\"image/jphc\":[\"jhc\"],\"image/jpm\":[\"jpm\"],\"image/jpx\":[\"jpx\",\"jpf\"],\"image/jxr\":[\"jxr\"],\"image/jxra\":[\"jxra\"],\"image/jxrs\":[\"jxrs\"],\"image/jxs\":[\"jxs\"],\"image/jxsc\":[\"jxsc\"],\"image/jxsi\":[\"jxsi\"],\"image/jxss\":[\"jxss\"],\"image/ktx\":[\"ktx\"],\"image/ktx2\":[\"ktx2\"],\"image/png\":[\"png\"],\"image/sgi\":[\"sgi\"],\"image/svg+xml\":[\"svg\",\"svgz\"],\"image/t38\":[\"t38\"],\"image/tiff\":[\"tif\",\"tiff\"],\"image/tiff-fx\":[\"tfx\"],\"image/webp\":[\"webp\"],\"image/wmf\":[\"wmf\"],\"message/disposition-notification\":[\"disposition-notification\"],\"message/global\":[\"u8msg\"],\"message/global-delivery-status\":[\"u8dsn\"],\"message/global-disposition-notification\":[\"u8mdn\"],\"message/global-headers\":[\"u8hdr\"],\"message/rfc822\":[\"eml\",\"mime\"],\"model/3mf\":[\"3mf\"],\"model/gltf+json\":[\"gltf\"],\"model/gltf-binary\":[\"glb\"],\"model/iges\":[\"igs\",\"iges\"],\"model/mesh\":[\"msh\",\"mesh\",\"silo\"],\"model/mtl\":[\"mtl\"],\"model/obj\":[\"obj\"],\"model/step+xml\":[\"stpx\"],\"model/step+zip\":[\"stpz\"],\"model/step-xml+zip\":[\"stpxz\"],\"model/stl\":[\"stl\"],\"model/vrml\":[\"wrl\",\"vrml\"],\"model/x3d+binary\":[\"*x3db\",\"x3dbz\"],\"model/x3d+fastinfoset\":[\"x3db\"],\"model/x3d+vrml\":[\"*x3dv\",\"x3dvz\"],\"model/x3d+xml\":[\"x3d\",\"x3dz\"],\"model/x3d-vrml\":[\"x3dv\"],\"text/cache-manifest\":[\"appcache\",\"manifest\"],\"text/calendar\":[\"ics\",\"ifb\"],\"text/coffeescript\":[\"coffee\",\"litcoffee\"],\"text/css\":[\"css\"],\"text/csv\":[\"csv\"],\"text/html\":[\"html\",\"htm\",\"shtml\"],\"text/jade\":[\"jade\"],\"text/jsx\":[\"jsx\"],\"text/less\":[\"less\"],\"text/markdown\":[\"markdown\",\"md\"],\"text/mathml\":[\"mml\"],\"text/mdx\":[\"mdx\"],\"text/n3\":[\"n3\"],\"text/plain\":[\"txt\",\"text\",\"conf\",\"def\",\"list\",\"log\",\"in\",\"ini\"],\"text/richtext\":[\"rtx\"],\"text/rtf\":[\"*rtf\"],\"text/sgml\":[\"sgml\",\"sgm\"],\"text/shex\":[\"shex\"],\"text/slim\":[\"slim\",\"slm\"],\"text/spdx\":[\"spdx\"],\"text/stylus\":[\"stylus\",\"styl\"],\"text/tab-separated-values\":[\"tsv\"],\"text/troff\":[\"t\",\"tr\",\"roff\",\"man\",\"me\",\"ms\"],\"text/turtle\":[\"ttl\"],\"text/uri-list\":[\"uri\",\"uris\",\"urls\"],\"text/vcard\":[\"vcard\"],\"text/vtt\":[\"vtt\"],\"text/xml\":[\"*xml\"],\"text/yaml\":[\"yaml\",\"yml\"],\"video/3gpp\":[\"3gp\",\"3gpp\"],\"video/3gpp2\":[\"3g2\"],\"video/h261\":[\"h261\"],\"video/h263\":[\"h263\"],\"video/h264\":[\"h264\"],\"video/iso.segment\":[\"m4s\"],\"video/jpeg\":[\"jpgv\"],\"video/jpm\":[\"*jpm\",\"jpgm\"],\"video/mj2\":[\"mj2\",\"mjp2\"],\"video/mp2t\":[\"ts\"],\"video/mp4\":[\"mp4\",\"mp4v\",\"mpg4\"],\"video/mpeg\":[\"mpeg\",\"mpg\",\"mpe\",\"m1v\",\"m2v\"],\"video/ogg\":[\"ogv\"],\"video/quicktime\":[\"qt\",\"mov\"],\"video/webm\":[\"webm\"]};","module.exports = assert;\n\nfunction assert(val, msg) {\n if (!val)\n throw new Error(msg || 'Assertion failed');\n}\n\nassert.equal = function assertEqual(l, r, msg) {\n if (l != r)\n throw new Error(msg || ('Assertion failed: ' + l + ' != ' + r));\n};\n","'use strict';\n\nvar utils = exports;\n\nfunction toArray(msg, enc) {\n if (Array.isArray(msg))\n return msg.slice();\n if (!msg)\n return [];\n var res = [];\n if (typeof msg !== 'string') {\n for (var i = 0; i < msg.length; i++)\n res[i] = msg[i] | 0;\n return res;\n }\n if (enc === 'hex') {\n msg = msg.replace(/[^a-z0-9]+/ig, '');\n if (msg.length % 2 !== 0)\n msg = '0' + msg;\n for (var i = 0; i < msg.length; i += 2)\n res.push(parseInt(msg[i] + msg[i + 1], 16));\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)\n res.push(hi, lo);\n else\n res.push(lo);\n }\n }\n return res;\n}\nutils.toArray = toArray;\n\nfunction zero2(word) {\n if (word.length === 1)\n return '0' + word;\n else\n return word;\n}\nutils.zero2 = zero2;\n\nfunction toHex(msg) {\n var res = '';\n for (var i = 0; i < msg.length; i++)\n res += zero2(msg[i].toString(16));\n return res;\n}\nutils.toHex = toHex;\n\nutils.encode = function encode(arr, enc) {\n if (enc === 'hex')\n return toHex(arr);\n else\n return arr;\n};\n","// This is an intentionally recursive require. I don't like it either.\nvar Box = require('./index')\nvar Descriptor = require('./descriptor')\nvar uint64be = require('uint64be')\n\nvar TIME_OFFSET = 2082844800000\n\n/*\nTODO:\ntest these\nadd new box versions\n*/\n\n// These have 'version' and 'flags' fields in the headers\nexports.fullBoxes = {}\nvar fullBoxes = [\n 'mvhd',\n 'tkhd',\n 'mdhd',\n 'vmhd',\n 'smhd',\n 'stsd',\n 'esds',\n 'stsz',\n 'stco',\n 'co64',\n 'stss',\n 'stts',\n 'ctts',\n 'stsc',\n 'dref',\n 'elst',\n 'hdlr',\n 'mehd',\n 'trex',\n 'mfhd',\n 'tfhd',\n 'tfdt',\n 'trun'\n]\nfullBoxes.forEach(function (type) {\n exports.fullBoxes[type] = true\n})\n\nexports.ftyp = {}\nexports.ftyp.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.ftyp.encodingLength(box))\n var brands = box.compatibleBrands || []\n buf.write(box.brand, 0, 4, 'ascii')\n buf.writeUInt32BE(box.brandVersion, 4)\n for (var i = 0; i < brands.length; i++) buf.write(brands[i], 8 + (i * 4), 4, 'ascii')\n exports.ftyp.encode.bytes = 8 + brands.length * 4\n return buf\n}\nexports.ftyp.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var brand = buf.toString('ascii', 0, 4)\n var version = buf.readUInt32BE(4)\n var compatibleBrands = []\n for (var i = 8; i < buf.length; i += 4) compatibleBrands.push(buf.toString('ascii', i, i + 4))\n return {\n brand: brand,\n brandVersion: version,\n compatibleBrands: compatibleBrands\n }\n}\nexports.ftyp.encodingLength = function (box) {\n return 8 + (box.compatibleBrands || []).length * 4\n}\n\nexports.mvhd = {}\nexports.mvhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(96)\n writeDate(box.ctime || new Date(), buf, 0)\n writeDate(box.mtime || new Date(), buf, 4)\n buf.writeUInt32BE(box.timeScale || 0, 8)\n buf.writeUInt32BE(box.duration || 0, 12)\n writeFixed32(box.preferredRate || 0, buf, 16)\n writeFixed16(box.preferredVolume || 0, buf, 20)\n writeReserved(buf, 22, 32)\n writeMatrix(box.matrix, buf, 32)\n buf.writeUInt32BE(box.previewTime || 0, 68)\n buf.writeUInt32BE(box.previewDuration || 0, 72)\n buf.writeUInt32BE(box.posterTime || 0, 76)\n buf.writeUInt32BE(box.selectionTime || 0, 80)\n buf.writeUInt32BE(box.selectionDuration || 0, 84)\n buf.writeUInt32BE(box.currentTime || 0, 88)\n buf.writeUInt32BE(box.nextTrackId || 0, 92)\n exports.mvhd.encode.bytes = 96\n return buf\n}\nexports.mvhd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n ctime: readDate(buf, 0),\n mtime: readDate(buf, 4),\n timeScale: buf.readUInt32BE(8),\n duration: buf.readUInt32BE(12),\n preferredRate: readFixed32(buf, 16),\n preferredVolume: readFixed16(buf, 20),\n matrix: readMatrix(buf.slice(32, 68)),\n previewTime: buf.readUInt32BE(68),\n previewDuration: buf.readUInt32BE(72),\n posterTime: buf.readUInt32BE(76),\n selectionTime: buf.readUInt32BE(80),\n selectionDuration: buf.readUInt32BE(84),\n currentTime: buf.readUInt32BE(88),\n nextTrackId: buf.readUInt32BE(92)\n }\n}\nexports.mvhd.encodingLength = function (box) {\n return 96\n}\n\nexports.tkhd = {}\nexports.tkhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(80)\n writeDate(box.ctime || new Date(), buf, 0)\n writeDate(box.mtime || new Date(), buf, 4)\n buf.writeUInt32BE(box.trackId || 0, 8)\n writeReserved(buf, 12, 16)\n buf.writeUInt32BE(box.duration || 0, 16)\n writeReserved(buf, 20, 28)\n buf.writeUInt16BE(box.layer || 0, 28)\n buf.writeUInt16BE(box.alternateGroup || 0, 30)\n buf.writeUInt16BE(box.volume || 0, 32)\n writeMatrix(box.matrix, buf, 36)\n buf.writeUInt32BE(box.trackWidth || 0, 72)\n buf.writeUInt32BE(box.trackHeight || 0, 76)\n exports.tkhd.encode.bytes = 80\n return buf\n}\nexports.tkhd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n ctime: readDate(buf, 0),\n mtime: readDate(buf, 4),\n trackId: buf.readUInt32BE(8),\n duration: buf.readUInt32BE(16),\n layer: buf.readUInt16BE(28),\n alternateGroup: buf.readUInt16BE(30),\n volume: buf.readUInt16BE(32),\n matrix: readMatrix(buf.slice(36, 72)),\n trackWidth: buf.readUInt32BE(72),\n trackHeight: buf.readUInt32BE(76)\n }\n}\nexports.tkhd.encodingLength = function (box) {\n return 80\n}\n\nexports.mdhd = {}\nexports.mdhd.encode = function (box, buf, offset) {\n if (box.version === 1) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(32)\n writeDate64(box.ctime || new Date(), buf, 0)\n writeDate64(box.mtime || new Date(), buf, 8)\n buf.writeUInt32BE(box.timeScale || 0, 16)\n // Node only supports integer <= 48bit. Waiting for BigInt!\n buf.writeUIntBE(box.duration || 0, 20, 6)\n buf.writeUInt16BE(box.language || 0, 28)\n buf.writeUInt16BE(box.quality || 0, 30)\n exports.mdhd.encode.bytes = 32\n return buf\n }\n\n buf = buf ? buf.slice(offset) : Buffer.alloc(20)\n writeDate(box.ctime || new Date(), buf, 0)\n writeDate(box.mtime || new Date(), buf, 4)\n buf.writeUInt32BE(box.timeScale || 0, 8)\n buf.writeUInt32BE(box.duration || 0, 12)\n buf.writeUInt16BE(box.language || 0, 16)\n buf.writeUInt16BE(box.quality || 0, 18)\n exports.mdhd.encode.bytes = 20\n return buf\n}\n\nexports.mdhd.decode = function (buf, offset, end) {\n buf = buf.slice(offset)\n\n var version1 = (end - offset) !== 20\n\n // In version 1 creation time and modification time are unsigned long\n if (version1) {\n return {\n ctime: readDate64(buf, 0),\n mtime: readDate64(buf, 8),\n timeScale: buf.readUInt32BE(16),\n // Node only supports integer <= 48bit. Waiting for BigInt!\n duration: buf.readUIntBE(20, 6),\n language: buf.readUInt16BE(28),\n quality: buf.readUInt16BE(30)\n }\n }\n\n return {\n ctime: readDate(buf, 0),\n mtime: readDate(buf, 4),\n timeScale: buf.readUInt32BE(8),\n duration: buf.readUInt32BE(12),\n language: buf.readUInt16BE(16),\n quality: buf.readUInt16BE(18)\n }\n}\nexports.mdhd.encodingLength = function (box) {\n if (box.version === 1) return 32\n\n return 20\n}\n\nexports.vmhd = {}\nexports.vmhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(8)\n buf.writeUInt16BE(box.graphicsMode || 0, 0)\n var opcolor = box.opcolor || [0, 0, 0]\n buf.writeUInt16BE(opcolor[0], 2)\n buf.writeUInt16BE(opcolor[1], 4)\n buf.writeUInt16BE(opcolor[2], 6)\n exports.vmhd.encode.bytes = 8\n return buf\n}\nexports.vmhd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n graphicsMode: buf.readUInt16BE(0),\n opcolor: [buf.readUInt16BE(2), buf.readUInt16BE(4), buf.readUInt16BE(6)]\n }\n}\nexports.vmhd.encodingLength = function (box) {\n return 8\n}\n\nexports.smhd = {}\nexports.smhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n buf.writeUInt16BE(box.balance || 0, 0)\n writeReserved(buf, 2, 4)\n exports.smhd.encode.bytes = 4\n return buf\n}\nexports.smhd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n balance: buf.readUInt16BE(0)\n }\n}\nexports.smhd.encodingLength = function (box) {\n return 4\n}\n\nexports.stsd = {}\nexports.stsd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsd.encodingLength(box))\n var entries = box.entries || []\n\n buf.writeUInt32BE(entries.length, 0)\n\n var ptr = 4\n for (var i = 0; i < entries.length; i++) {\n var entry = entries[i]\n Box.encode(entry, buf, ptr)\n ptr += Box.encode.bytes\n }\n\n exports.stsd.encode.bytes = ptr\n return buf\n}\nexports.stsd.decode = function (buf, offset, end) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n var ptr = 4\n\n for (var i = 0; i < num; i++) {\n var entry = Box.decode(buf, ptr, end)\n entries[i] = entry\n ptr += entry.length\n }\n\n return {\n entries: entries\n }\n}\nexports.stsd.encodingLength = function (box) {\n var totalSize = 4\n if (!box.entries) return totalSize\n for (var i = 0; i < box.entries.length; i++) {\n totalSize += Box.encodingLength(box.entries[i])\n }\n return totalSize\n}\n\nexports.avc1 = exports.VisualSampleEntry = {}\nexports.VisualSampleEntry.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.VisualSampleEntry.encodingLength(box))\n\n writeReserved(buf, 0, 6)\n buf.writeUInt16BE(box.dataReferenceIndex || 0, 6)\n writeReserved(buf, 8, 24)\n buf.writeUInt16BE(box.width || 0, 24)\n buf.writeUInt16BE(box.height || 0, 26)\n buf.writeUInt32BE(box.hResolution || 0x480000, 28)\n buf.writeUInt32BE(box.vResolution || 0x480000, 32)\n writeReserved(buf, 36, 40)\n buf.writeUInt16BE(box.frameCount || 1, 40)\n var compressorName = box.compressorName || ''\n var nameLen = Math.min(compressorName.length, 31)\n buf.writeUInt8(nameLen, 42)\n buf.write(compressorName, 43, nameLen, 'utf8')\n buf.writeUInt16BE(box.depth || 0x18, 74)\n buf.writeInt16BE(-1, 76)\n\n var ptr = 78\n var children = box.children || []\n children.forEach(function (child) {\n Box.encode(child, buf, ptr)\n ptr += Box.encode.bytes\n })\n exports.VisualSampleEntry.encode.bytes = ptr\n}\nexports.VisualSampleEntry.decode = function (buf, offset, end) {\n buf = buf.slice(offset)\n var length = end - offset\n var nameLen = Math.min(buf.readUInt8(42), 31)\n var box = {\n dataReferenceIndex: buf.readUInt16BE(6),\n width: buf.readUInt16BE(24),\n height: buf.readUInt16BE(26),\n hResolution: buf.readUInt32BE(28),\n vResolution: buf.readUInt32BE(32),\n frameCount: buf.readUInt16BE(40),\n compressorName: buf.toString('utf8', 43, 43 + nameLen),\n depth: buf.readUInt16BE(74),\n children: []\n }\n\n var ptr = 78\n while (length - ptr >= 8) {\n var child = Box.decode(buf, ptr, length)\n box.children.push(child)\n box[child.type] = child\n ptr += child.length\n }\n\n return box\n}\nexports.VisualSampleEntry.encodingLength = function (box) {\n var len = 78\n var children = box.children || []\n children.forEach(function (child) {\n len += Box.encodingLength(child)\n })\n return len\n}\n\nexports.avcC = {}\nexports.avcC.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(box.buffer.length)\n\n box.buffer.copy(buf)\n exports.avcC.encode.bytes = box.buffer.length\n}\nexports.avcC.decode = function (buf, offset, end) {\n buf = buf.slice(offset, end)\n\n return {\n mimeCodec: buf.toString('hex', 1, 4),\n buffer: Buffer.from(buf)\n }\n}\nexports.avcC.encodingLength = function (box) {\n return box.buffer.length\n}\n\nexports.mp4a = exports.AudioSampleEntry = {}\nexports.AudioSampleEntry.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.AudioSampleEntry.encodingLength(box))\n\n writeReserved(buf, 0, 6)\n buf.writeUInt16BE(box.dataReferenceIndex || 0, 6)\n writeReserved(buf, 8, 16)\n buf.writeUInt16BE(box.channelCount || 2, 16)\n buf.writeUInt16BE(box.sampleSize || 16, 18)\n writeReserved(buf, 20, 24)\n buf.writeUInt32BE(box.sampleRate || 0, 24)\n\n var ptr = 28\n var children = box.children || []\n children.forEach(function (child) {\n Box.encode(child, buf, ptr)\n ptr += Box.encode.bytes\n })\n exports.AudioSampleEntry.encode.bytes = ptr\n}\nexports.AudioSampleEntry.decode = function (buf, offset, end) {\n buf = buf.slice(offset, end)\n var length = end - offset\n var box = {\n dataReferenceIndex: buf.readUInt16BE(6),\n channelCount: buf.readUInt16BE(16),\n sampleSize: buf.readUInt16BE(18),\n sampleRate: buf.readUInt32BE(24),\n children: []\n }\n\n var ptr = 28\n while (length - ptr >= 8) {\n var child = Box.decode(buf, ptr, length)\n box.children.push(child)\n box[child.type] = child\n ptr += child.length\n }\n\n return box\n}\nexports.AudioSampleEntry.encodingLength = function (box) {\n var len = 28\n var children = box.children || []\n children.forEach(function (child) {\n len += Box.encodingLength(child)\n })\n return len\n}\n\nexports.esds = {}\nexports.esds.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(box.buffer.length)\n\n box.buffer.copy(buf, 0)\n exports.esds.encode.bytes = box.buffer.length\n}\nexports.esds.decode = function (buf, offset, end) {\n buf = buf.slice(offset, end)\n\n var desc = Descriptor.Descriptor.decode(buf, 0, buf.length)\n var esd = (desc.tagName === 'ESDescriptor') ? desc : {}\n var dcd = esd.DecoderConfigDescriptor || {}\n var oti = dcd.oti || 0\n var dsi = dcd.DecoderSpecificInfo\n var audioConfig = dsi ? (dsi.buffer.readUInt8(0) & 0xf8) >> 3 : 0\n\n var mimeCodec = null\n if (oti) {\n mimeCodec = oti.toString(16)\n if (audioConfig) {\n mimeCodec += '.' + audioConfig\n }\n }\n\n return {\n mimeCodec: mimeCodec,\n buffer: Buffer.from(buf.slice(0))\n }\n}\nexports.esds.encodingLength = function (box) {\n return box.buffer.length\n}\n\n// TODO: integrate the two versions in a saner way\nexports.stsz = {}\nexports.stsz.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsz.encodingLength(box))\n\n buf.writeUInt32BE(0, 0)\n buf.writeUInt32BE(entries.length, 4)\n\n for (var i = 0; i < entries.length; i++) {\n buf.writeUInt32BE(entries[i], i * 4 + 8)\n }\n\n exports.stsz.encode.bytes = 8 + entries.length * 4\n return buf\n}\nexports.stsz.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var size = buf.readUInt32BE(0)\n var num = buf.readUInt32BE(4)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n if (size === 0) {\n entries[i] = buf.readUInt32BE(i * 4 + 8)\n } else {\n entries[i] = size\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.stsz.encodingLength = function (box) {\n return 8 + box.entries.length * 4\n}\n\nexports.stss =\nexports.stco = {}\nexports.stco.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stco.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n buf.writeUInt32BE(entries[i], i * 4 + 4)\n }\n\n exports.stco.encode.bytes = 4 + entries.length * 4\n return buf\n}\nexports.stco.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n entries[i] = buf.readUInt32BE(i * 4 + 4)\n }\n\n return {\n entries: entries\n }\n}\nexports.stco.encodingLength = function (box) {\n return 4 + box.entries.length * 4\n}\n\nexports.co64 = {}\nexports.co64.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.co64.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n uint64be.encode(entries[i], buf, i * 8 + 4)\n }\n\n exports.co64.encode.bytes = 4 + entries.length * 8\n return buf\n}\nexports.co64.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n entries[i] = uint64be.decode(buf, i * 8 + 4)\n }\n\n return {\n entries: entries\n }\n}\nexports.co64.encodingLength = function (box) {\n return 4 + box.entries.length * 8\n}\n\nexports.stts = {}\nexports.stts.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stts.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n var ptr = i * 8 + 4\n buf.writeUInt32BE(entries[i].count || 0, ptr)\n buf.writeUInt32BE(entries[i].duration || 0, ptr + 4)\n }\n\n exports.stts.encode.bytes = 4 + box.entries.length * 8\n return buf\n}\nexports.stts.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n var ptr = i * 8 + 4\n entries[i] = {\n count: buf.readUInt32BE(ptr),\n duration: buf.readUInt32BE(ptr + 4)\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.stts.encodingLength = function (box) {\n return 4 + box.entries.length * 8\n}\n\nexports.ctts = {}\nexports.ctts.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.ctts.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n var ptr = i * 8 + 4\n buf.writeUInt32BE(entries[i].count || 0, ptr)\n buf.writeUInt32BE(entries[i].compositionOffset || 0, ptr + 4)\n }\n\n exports.ctts.encode.bytes = 4 + entries.length * 8\n return buf\n}\nexports.ctts.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n var ptr = i * 8 + 4\n entries[i] = {\n count: buf.readUInt32BE(ptr),\n compositionOffset: buf.readInt32BE(ptr + 4)\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.ctts.encodingLength = function (box) {\n return 4 + box.entries.length * 8\n}\n\nexports.stsc = {}\nexports.stsc.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.stsc.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n var ptr = i * 12 + 4\n buf.writeUInt32BE(entries[i].firstChunk || 0, ptr)\n buf.writeUInt32BE(entries[i].samplesPerChunk || 0, ptr + 4)\n buf.writeUInt32BE(entries[i].sampleDescriptionId || 0, ptr + 8)\n }\n\n exports.stsc.encode.bytes = 4 + entries.length * 12\n return buf\n}\nexports.stsc.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n var ptr = i * 12 + 4\n entries[i] = {\n firstChunk: buf.readUInt32BE(ptr),\n samplesPerChunk: buf.readUInt32BE(ptr + 4),\n sampleDescriptionId: buf.readUInt32BE(ptr + 8)\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.stsc.encodingLength = function (box) {\n return 4 + box.entries.length * 12\n}\n\nexports.dref = {}\nexports.dref.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.dref.encodingLength(box))\n var entries = box.entries || []\n\n buf.writeUInt32BE(entries.length, 0)\n\n var ptr = 4\n for (var i = 0; i < entries.length; i++) {\n var entry = entries[i]\n var size = (entry.buf ? entry.buf.length : 0) + 4 + 4\n\n buf.writeUInt32BE(size, ptr)\n ptr += 4\n\n buf.write(entry.type, ptr, 4, 'ascii')\n ptr += 4\n\n if (entry.buf) {\n entry.buf.copy(buf, ptr)\n ptr += entry.buf.length\n }\n }\n\n exports.dref.encode.bytes = ptr\n return buf\n}\nexports.dref.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n var ptr = 4\n\n for (var i = 0; i < num; i++) {\n var size = buf.readUInt32BE(ptr)\n var type = buf.toString('ascii', ptr + 4, ptr + 8)\n var tmp = buf.slice(ptr + 8, ptr + size)\n ptr += size\n\n entries[i] = {\n type: type,\n buf: tmp\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.dref.encodingLength = function (box) {\n var totalSize = 4\n if (!box.entries) return totalSize\n for (var i = 0; i < box.entries.length; i++) {\n var buf = box.entries[i].buf\n totalSize += (buf ? buf.length : 0) + 4 + 4\n }\n return totalSize\n}\n\nexports.elst = {}\nexports.elst.encode = function (box, buf, offset) {\n var entries = box.entries || []\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.elst.encodingLength(box))\n\n buf.writeUInt32BE(entries.length, 0)\n\n for (var i = 0; i < entries.length; i++) {\n var ptr = i * 12 + 4\n buf.writeUInt32BE(entries[i].trackDuration || 0, ptr)\n buf.writeUInt32BE(entries[i].mediaTime || 0, ptr + 4)\n writeFixed32(entries[i].mediaRate || 0, buf, ptr + 8)\n }\n\n exports.elst.encode.bytes = 4 + entries.length * 12\n return buf\n}\nexports.elst.decode = function (buf, offset) {\n buf = buf.slice(offset)\n var num = buf.readUInt32BE(0)\n var entries = new Array(num)\n\n for (var i = 0; i < num; i++) {\n var ptr = i * 12 + 4\n entries[i] = {\n trackDuration: buf.readUInt32BE(ptr),\n mediaTime: buf.readInt32BE(ptr + 4),\n mediaRate: readFixed32(buf, ptr + 8)\n }\n }\n\n return {\n entries: entries\n }\n}\nexports.elst.encodingLength = function (box) {\n return 4 + box.entries.length * 12\n}\n\nexports.hdlr = {}\nexports.hdlr.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(exports.hdlr.encodingLength(box))\n\n var len = 21 + (box.name || '').length\n buf.fill(0, 0, len)\n\n buf.write(box.handlerType || '', 4, 4, 'ascii')\n writeString(box.name || '', buf, 20)\n\n exports.hdlr.encode.bytes = len\n return buf\n}\nexports.hdlr.decode = function (buf, offset, end) {\n buf = buf.slice(offset)\n return {\n handlerType: buf.toString('ascii', 4, 8),\n name: readString(buf, 20, end)\n }\n}\nexports.hdlr.encodingLength = function (box) {\n return 21 + (box.name || '').length\n}\n\nexports.mehd = {}\nexports.mehd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n\n buf.writeUInt32BE(box.fragmentDuration || 0, 0)\n exports.mehd.encode.bytes = 4\n return buf\n}\nexports.mehd.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n fragmentDuration: buf.readUInt32BE(0)\n }\n}\nexports.mehd.encodingLength = function (box) {\n return 4\n}\n\nexports.trex = {}\nexports.trex.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(20)\n\n buf.writeUInt32BE(box.trackId || 0, 0)\n buf.writeUInt32BE(box.defaultSampleDescriptionIndex || 0, 4)\n buf.writeUInt32BE(box.defaultSampleDuration || 0, 8)\n buf.writeUInt32BE(box.defaultSampleSize || 0, 12)\n buf.writeUInt32BE(box.defaultSampleFlags || 0, 16)\n exports.trex.encode.bytes = 20\n return buf\n}\nexports.trex.decode = function (buf, offset) {\n buf = buf.slice(offset)\n return {\n trackId: buf.readUInt32BE(0),\n defaultSampleDescriptionIndex: buf.readUInt32BE(4),\n defaultSampleDuration: buf.readUInt32BE(8),\n defaultSampleSize: buf.readUInt32BE(12),\n defaultSampleFlags: buf.readUInt32BE(16)\n }\n}\nexports.trex.encodingLength = function (box) {\n return 20\n}\n\nexports.mfhd = {}\nexports.mfhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n\n buf.writeUInt32BE(box.sequenceNumber || 0, 0)\n exports.mfhd.encode.bytes = 4\n return buf\n}\nexports.mfhd.decode = function (buf, offset) {\n return {\n sequenceNumber: buf.readUInt32BE(0)\n }\n}\nexports.mfhd.encodingLength = function (box) {\n return 4\n}\n\nexports.tfhd = {}\nexports.tfhd.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n buf.writeUInt32BE(box.trackId, 0)\n exports.tfhd.encode.bytes = 4\n return buf\n}\nexports.tfhd.decode = function (buf, offset) {\n // TODO: this\n}\nexports.tfhd.encodingLength = function (box) {\n // TODO: this is wrong!\n return 4\n}\n\nexports.tfdt = {}\nexports.tfdt.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(4)\n\n buf.writeUInt32BE(box.baseMediaDecodeTime || 0, 0)\n exports.tfdt.encode.bytes = 4\n return buf\n}\nexports.tfdt.decode = function (buf, offset) {\n // TODO: this\n}\nexports.tfdt.encodingLength = function (box) {\n return 4\n}\n\nexports.trun = {}\nexports.trun.encode = function (box, buf, offset) {\n buf = buf ? buf.slice(offset) : Buffer.alloc(8 + box.entries.length * 16)\n\n // TODO: this is wrong\n buf.writeUInt32BE(box.entries.length, 0)\n buf.writeInt32BE(box.dataOffset, 4)\n var ptr = 8\n for (var i = 0; i < box.entries.length; i++) {\n var entry = box.entries[i]\n buf.writeUInt32BE(entry.sampleDuration, ptr)\n ptr += 4\n\n buf.writeUInt32BE(entry.sampleSize, ptr)\n ptr += 4\n\n buf.writeUInt32BE(entry.sampleFlags, ptr)\n ptr += 4\n\n if ((box.version || 0) === 0) {\n buf.writeUInt32BE(entry.sampleCompositionTimeOffset, ptr)\n } else {\n buf.writeInt32BE(entry.sampleCompositionTimeOffset, ptr)\n }\n ptr += 4\n }\n exports.trun.encode.bytes = ptr\n}\nexports.trun.decode = function (buf, offset) {\n // TODO: this\n}\nexports.trun.encodingLength = function (box) {\n // TODO: this is wrong\n return 8 + box.entries.length * 16\n}\n\nexports.mdat = {}\nexports.mdat.encode = function (box, buf, offset) {\n if (box.buffer) {\n box.buffer.copy(buf, offset)\n exports.mdat.encode.bytes = box.buffer.length\n } else {\n exports.mdat.encode.bytes = exports.mdat.encodingLength(box)\n }\n}\nexports.mdat.decode = function (buf, start, end) {\n return {\n buffer: Buffer.from(buf.slice(start, end))\n }\n}\nexports.mdat.encodingLength = function (box) {\n return box.buffer ? box.buffer.length : box.contentLength\n}\n\nfunction writeReserved (buf, offset, end) {\n for (var i = offset; i < end; i++) buf[i] = 0\n}\n\nfunction writeDate (date, buf, offset) {\n buf.writeUInt32BE(Math.floor((date.getTime() + TIME_OFFSET) / 1000), offset)\n}\n\nfunction writeDate64 (date, buf, offset) {\n // Node only supports integer <= 48bit. Waiting for BigInt!\n buf.writeUIntBE(Math.floor((date.getTime() + TIME_OFFSET) / 1000), offset, 6)\n}\n\n// TODO: think something is wrong here\nfunction writeFixed32 (num, buf, offset) {\n buf.writeUInt16BE(Math.floor(num) % (256 * 256), offset)\n buf.writeUInt16BE(Math.floor(num * 256 * 256) % (256 * 256), offset + 2)\n}\n\nfunction writeFixed16 (num, buf, offset) {\n buf[offset] = Math.floor(num) % 256\n buf[offset + 1] = Math.floor(num * 256) % 256\n}\n\nfunction writeMatrix (list, buf, offset) {\n if (!list) list = [0, 0, 0, 0, 0, 0, 0, 0, 0]\n for (var i = 0; i < list.length; i++) {\n writeFixed32(list[i], buf, offset + i * 4)\n }\n}\n\nfunction writeString (str, buf, offset) {\n var strBuffer = Buffer.from(str, 'utf8')\n strBuffer.copy(buf, offset)\n buf[offset + strBuffer.length] = 0\n}\n\nfunction readMatrix (buf) {\n var list = new Array(buf.length / 4)\n for (var i = 0; i < list.length; i++) list[i] = readFixed32(buf, i * 4)\n return list\n}\n\nfunction readDate64 (buf, offset) {\n // Node only supports integer <= 48bit. Waiting for BigInt!\n return new Date(buf.readUIntBE(offset, 6) * 1000 - TIME_OFFSET)\n}\n\nfunction readDate (buf, offset) {\n return new Date(buf.readUInt32BE(offset) * 1000 - TIME_OFFSET)\n}\n\nfunction readFixed32 (buf, offset) {\n return buf.readUInt16BE(offset) + buf.readUInt16BE(offset + 2) / (256 * 256)\n}\n\nfunction readFixed16 (buf, offset) {\n return buf[offset] + buf[offset + 1] / 256\n}\n\nfunction readString (buf, offset, length) {\n var i\n for (i = 0; i < length; i++) {\n if (buf[offset + i] === 0) {\n break\n }\n }\n return buf.toString('utf8', offset, offset + i)\n}\n","var tagToName = {\n 0x03: 'ESDescriptor',\n 0x04: 'DecoderConfigDescriptor',\n 0x05: 'DecoderSpecificInfo',\n 0x06: 'SLConfigDescriptor'\n}\n\nexports.Descriptor = {}\nexports.Descriptor.decode = function (buf, start, end) {\n var tag = buf.readUInt8(start)\n var ptr = start + 1\n var lenByte\n var len = 0\n do {\n lenByte = buf.readUInt8(ptr++)\n len = (len << 7) | (lenByte & 0x7f)\n } while (lenByte & 0x80)\n\n var obj\n var tagName = tagToName[tag] // May be undefined; that's ok\n if (exports[tagName]) {\n obj = exports[tagName].decode(buf, ptr, end)\n } else {\n obj = {\n buffer: Buffer.from(buf.slice(ptr, ptr + len))\n }\n }\n\n obj.tag = tag\n obj.tagName = tagName\n obj.length = (ptr - start) + len\n obj.contentsLen = len\n return obj\n}\n\nexports.DescriptorArray = {}\nexports.DescriptorArray.decode = function (buf, start, end) {\n var ptr = start\n var obj = {}\n while (ptr + 2 <= end) {\n var descriptor = exports.Descriptor.decode(buf, ptr, end)\n ptr += descriptor.length\n var tagName = tagToName[descriptor.tag] || ('Descriptor' + descriptor.tag)\n obj[tagName] = descriptor\n }\n return obj\n}\n\nexports.ESDescriptor = {}\nexports.ESDescriptor.decode = function (buf, start, end) {\n var flags = buf.readUInt8(start + 2)\n var ptr = start + 3\n if (flags & 0x80) {\n ptr += 2\n }\n if (flags & 0x40) {\n var len = buf.readUInt8(ptr)\n ptr += len + 1\n }\n if (flags & 0x20) {\n ptr += 2\n }\n return exports.DescriptorArray.decode(buf, ptr, end)\n}\n\nexports.DecoderConfigDescriptor = {}\nexports.DecoderConfigDescriptor.decode = function (buf, start, end) {\n var oti = buf.readUInt8(start)\n var obj = exports.DescriptorArray.decode(buf, start + 13, end)\n obj.oti = oti\n return obj\n}\n","// var assert = require('assert')\nvar uint64be = require('uint64be')\n\nvar boxes = require('./boxes')\n\nvar UINT32_MAX = 4294967295\n\nvar Box = exports\n\n/*\n * Lists the proper order for boxes inside containers.\n * Five-character names ending in 's' indicate arrays instead of single elements.\n */\nvar containers = exports.containers = {\n 'moov': ['mvhd', 'meta', 'traks', 'mvex'],\n 'trak': ['tkhd', 'tref', 'trgr', 'edts', 'meta', 'mdia', 'udta'],\n 'edts': ['elst'],\n 'mdia': ['mdhd', 'hdlr', 'elng', 'minf'],\n 'minf': ['vmhd', 'smhd', 'hmhd', 'sthd', 'nmhd', 'dinf', 'stbl'],\n 'dinf': ['dref'],\n 'stbl': ['stsd', 'stts', 'ctts', 'cslg', 'stsc', 'stsz', 'stz2', 'stco', 'co64', 'stss', 'stsh', 'padb', 'stdp', 'sdtp', 'sbgps', 'sgpds', 'subss', 'saizs', 'saios'],\n 'mvex': ['mehd', 'trexs', 'leva'],\n 'moof': ['mfhd', 'meta', 'trafs'],\n 'traf': ['tfhd', 'tfdt', 'trun', 'sbgps', 'sgpds', 'subss', 'saizs', 'saios', 'meta']\n}\n\nBox.encode = function (obj, buffer, offset) {\n Box.encodingLength(obj) // sets every level appropriately\n offset = offset || 0\n buffer = buffer || Buffer.alloc(obj.length)\n return Box._encode(obj, buffer, offset)\n}\n\nBox._encode = function (obj, buffer, offset) {\n var type = obj.type\n var len = obj.length\n if (len > UINT32_MAX) {\n len = 1\n }\n buffer.writeUInt32BE(len, offset)\n buffer.write(obj.type, offset + 4, 4, 'ascii')\n var ptr = offset + 8\n if (len === 1) {\n uint64be.encode(obj.length, buffer, ptr)\n ptr += 8\n }\n if (boxes.fullBoxes[type]) {\n buffer.writeUInt32BE(obj.flags || 0, ptr)\n buffer.writeUInt8(obj.version || 0, ptr)\n ptr += 4\n }\n\n if (containers[type]) {\n var contents = containers[type]\n contents.forEach(function (childType) {\n if (childType.length === 5) {\n var entry = obj[childType] || []\n childType = childType.substr(0, 4)\n entry.forEach(function (child) {\n Box._encode(child, buffer, ptr)\n ptr += Box.encode.bytes\n })\n } else if (obj[childType]) {\n Box._encode(obj[childType], buffer, ptr)\n ptr += Box.encode.bytes\n }\n })\n if (obj.otherBoxes) {\n obj.otherBoxes.forEach(function (child) {\n Box._encode(child, buffer, ptr)\n ptr += Box.encode.bytes\n })\n }\n } else if (boxes[type]) {\n var encode = boxes[type].encode\n encode(obj, buffer, ptr)\n ptr += encode.bytes\n } else if (obj.buffer) {\n var buf = obj.buffer\n buf.copy(buffer, ptr)\n ptr += obj.buffer.length\n } else {\n throw new Error('Either `type` must be set to a known type (not\\'' + type + '\\') or `buffer` must be set')\n }\n\n Box.encode.bytes = ptr - offset\n // assert.equal(ptr - offset, obj.length, 'Error encoding \\'' + type + '\\': wrote ' + ptr - offset + ' bytes, expecting ' + obj.length)\n return buffer\n}\n\n/*\n * Returns an object with `type` and `size` fields,\n * or if there isn't enough data, returns the total\n * number of bytes needed to read the headers\n */\nBox.readHeaders = function (buffer, start, end) {\n start = start || 0\n end = end || buffer.length\n if (end - start < 8) {\n return 8\n }\n\n var len = buffer.readUInt32BE(start)\n var type = buffer.toString('ascii', start + 4, start + 8)\n var ptr = start + 8\n\n if (len === 1) {\n if (end - start < 16) {\n return 16\n }\n\n len = uint64be.decode(buffer, ptr)\n ptr += 8\n }\n\n var version\n var flags\n if (boxes.fullBoxes[type]) {\n version = buffer.readUInt8(ptr)\n flags = buffer.readUInt32BE(ptr) & 0xffffff\n ptr += 4\n }\n\n return {\n length: len,\n headersLen: ptr - start,\n contentLen: len - (ptr - start),\n type: type,\n version: version,\n flags: flags\n }\n}\n\nBox.decode = function (buffer, start, end) {\n start = start || 0\n end = end || buffer.length\n var headers = Box.readHeaders(buffer, start, end)\n if (!headers || headers.length > end - start) {\n throw new Error('Data too short')\n }\n\n return Box.decodeWithoutHeaders(headers, buffer, start + headers.headersLen, start + headers.length)\n}\n\nBox.decodeWithoutHeaders = function (headers, buffer, start, end) {\n start = start || 0\n end = end || buffer.length\n var type = headers.type\n var obj = {}\n if (containers[type]) {\n obj.otherBoxes = []\n var contents = containers[type]\n var ptr = start\n while (end - ptr >= 8) {\n var child = Box.decode(buffer, ptr, end)\n ptr += child.length\n if (contents.indexOf(child.type) >= 0) {\n obj[child.type] = child\n } else if (contents.indexOf(child.type + 's') >= 0) {\n var childType = child.type + 's'\n var entry = obj[childType] = obj[childType] || []\n entry.push(child)\n } else {\n obj.otherBoxes.push(child)\n }\n }\n } else if (boxes[type]) {\n var decode = boxes[type].decode\n obj = decode(buffer, start, end)\n } else {\n obj.buffer = Buffer.from(buffer.slice(start, end))\n }\n\n obj.length = headers.length\n obj.contentLen = headers.contentLen\n obj.type = headers.type\n obj.version = headers.version\n obj.flags = headers.flags\n return obj\n}\n\nBox.encodingLength = function (obj) {\n var type = obj.type\n\n var len = 8\n if (boxes.fullBoxes[type]) {\n len += 4\n }\n\n if (containers[type]) {\n var contents = containers[type]\n contents.forEach(function (childType) {\n if (childType.length === 5) {\n var entry = obj[childType] || []\n childType = childType.substr(0, 4)\n entry.forEach(function (child) {\n child.type = childType\n len += Box.encodingLength(child)\n })\n } else if (obj[childType]) {\n var child = obj[childType]\n child.type = childType\n len += Box.encodingLength(child)\n }\n })\n if (obj.otherBoxes) {\n obj.otherBoxes.forEach(function (child) {\n len += Box.encodingLength(child)\n })\n }\n } else if (boxes[type]) {\n len += boxes[type].encodingLength(obj)\n } else if (obj.buffer) {\n len += obj.buffer.length\n } else {\n throw new Error('Either `type` must be set to a known type (not\\'' + type + '\\') or `buffer` must be set')\n }\n\n if (len > UINT32_MAX) {\n len += 8\n }\n\n obj.length = len\n return len\n}\n","var stream = require('readable-stream')\nvar nextEvent = require('next-event')\nvar Box = require('mp4-box-encoding')\n\nvar EMPTY = Buffer.alloc(0)\n\nclass Decoder extends stream.Writable {\n constructor (opts) {\n super(opts)\n\n this.destroyed = false\n\n this._pending = 0\n this._missing = 0\n this._ignoreEmpty = false\n this._buf = null\n this._str = null\n this._cb = null\n this._ondrain = null\n this._writeBuffer = null\n this._writeCb = null\n\n this._ondrain = null\n this._kick()\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n if (err) this.emit('error', err)\n this.emit('close')\n }\n\n _write (data, enc, next) {\n if (this.destroyed) return\n var drained = !this._str || !this._str._writableState.needDrain\n\n while (data.length && !this.destroyed) {\n if (!this._missing && !this._ignoreEmpty) {\n this._writeBuffer = data\n this._writeCb = next\n return\n }\n\n var consumed = data.length < this._missing ? data.length : this._missing\n if (this._buf) data.copy(this._buf, this._buf.length - this._missing)\n else if (this._str) drained = this._str.write(consumed === data.length ? data : data.slice(0, consumed))\n\n this._missing -= consumed\n\n if (!this._missing) {\n var buf = this._buf\n var cb = this._cb\n var stream = this._str\n\n this._buf = this._cb = this._str = this._ondrain = null\n drained = true\n\n this._ignoreEmpty = false\n if (stream) stream.end()\n if (cb) cb(buf)\n }\n\n data = consumed === data.length ? EMPTY : data.slice(consumed)\n }\n\n if (this._pending && !this._missing) {\n this._writeBuffer = data\n this._writeCb = next\n return\n }\n\n if (drained) next()\n else this._ondrain(next)\n }\n\n _buffer (size, cb) {\n this._missing = size\n this._buf = Buffer.alloc(size)\n this._cb = cb\n }\n\n _stream (size, cb) {\n this._missing = size\n this._str = new MediaData(this)\n this._ondrain = nextEvent(this._str, 'drain')\n this._pending++\n this._str.on('end', () => {\n this._pending--\n this._kick()\n })\n this._cb = cb\n return this._str\n }\n\n _readBox () {\n const bufferHeaders = (len, buf) => {\n this._buffer(len, additionalBuf => {\n if (buf) {\n buf = Buffer.concat([buf, additionalBuf])\n } else {\n buf = additionalBuf\n }\n var headers = Box.readHeaders(buf)\n if (typeof headers === 'number') {\n bufferHeaders(headers - buf.length, buf)\n } else {\n this._pending++\n this._headers = headers\n this.emit('box', headers)\n }\n })\n }\n\n bufferHeaders(8)\n }\n\n stream () {\n if (!this._headers) throw new Error('this function can only be called once after \\'box\\' is emitted')\n var headers = this._headers\n this._headers = null\n\n return this._stream(headers.contentLen, () => {\n this._pending--\n this._kick()\n })\n }\n\n decode (cb) {\n if (!this._headers) throw new Error('this function can only be called once after \\'box\\' is emitted')\n var headers = this._headers\n this._headers = null\n\n this._buffer(headers.contentLen, buf => {\n var box = Box.decodeWithoutHeaders(headers, buf)\n cb(box)\n this._pending--\n this._kick()\n })\n }\n\n ignore () {\n if (!this._headers) throw new Error('this function can only be called once after \\'box\\' is emitted')\n var headers = this._headers\n this._headers = null\n\n this._missing = headers.contentLen\n if (this._missing === 0) {\n this._ignoreEmpty = true\n }\n this._cb = () => {\n this._pending--\n this._kick()\n }\n }\n\n _kick () {\n if (this._pending) return\n if (!this._buf && !this._str) this._readBox()\n if (this._writeBuffer) {\n var next = this._writeCb\n var buffer = this._writeBuffer\n this._writeBuffer = null\n this._writeCb = null\n this._write(buffer, null, next)\n }\n }\n}\n\nclass MediaData extends stream.PassThrough {\n constructor (parent) {\n super()\n this._parent = parent\n this.destroyed = false\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n this._parent.destroy(err)\n if (err) this.emit('error', err)\n this.emit('close')\n }\n}\n\nmodule.exports = Decoder\n","var stream = require('readable-stream')\nvar Box = require('mp4-box-encoding')\nvar queueMicrotask = require('queue-microtask')\n\nfunction noop () {}\n\nclass Encoder extends stream.Readable {\n constructor (opts) {\n super(opts)\n\n this.destroyed = false\n\n this._finalized = false\n this._reading = false\n this._stream = null\n this._drain = null\n this._want = false\n\n this._onreadable = () => {\n if (!this._want) return\n this._want = false\n this._read()\n }\n\n this._onend = () => {\n this._stream = null\n }\n }\n\n mdat (size, cb) {\n this.mediaData(size, cb)\n }\n\n mediaData (size, cb) {\n var stream = new MediaData(this)\n this.box({ type: 'mdat', contentLength: size, encodeBufferLen: 8, stream: stream }, cb)\n return stream\n }\n\n box (box, cb) {\n if (!cb) cb = noop\n if (this.destroyed) return cb(new Error('Encoder is destroyed'))\n\n var buf\n if (box.encodeBufferLen) {\n buf = Buffer.alloc(box.encodeBufferLen)\n }\n if (box.stream) {\n box.buffer = null\n buf = Box.encode(box, buf)\n this.push(buf)\n this._stream = box.stream\n this._stream.on('readable', this._onreadable)\n this._stream.on('end', this._onend)\n this._stream.on('end', cb)\n this._forward()\n } else {\n buf = Box.encode(box, buf)\n var drained = this.push(buf)\n if (drained) return queueMicrotask(cb)\n this._drain = cb\n }\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n if (this._stream && this._stream.destroy) this._stream.destroy()\n this._stream = null\n if (this._drain) {\n var cb = this._drain\n this._drain = null\n cb(err)\n }\n if (err) this.emit('error', err)\n this.emit('close')\n }\n\n finalize () {\n this._finalized = true\n if (!this._stream && !this._drain) {\n this.push(null)\n }\n }\n\n _forward () {\n if (!this._stream) return\n\n while (!this.destroyed) {\n var buf = this._stream.read()\n\n if (!buf) {\n this._want = !!this._stream\n return\n }\n\n if (!this.push(buf)) return\n }\n }\n\n _read () {\n if (this._reading || this.destroyed) return\n this._reading = true\n\n if (this._stream) this._forward()\n if (this._drain) {\n var drain = this._drain\n this._drain = null\n drain()\n }\n\n this._reading = false\n if (this._finalized) {\n this.push(null)\n }\n }\n}\n\nclass MediaData extends stream.PassThrough {\n constructor (parent) {\n super()\n this._parent = parent\n this.destroyed = false\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n this._parent.destroy(err)\n if (err) this.emit('error', err)\n this.emit('close')\n }\n}\n\nmodule.exports = Encoder\n","const Decoder = require('./decode')\nconst Encoder = require('./encode')\n\nexports.decode = opts => new Decoder(opts)\nexports.encode = opts => new Encoder(opts)\n","/**\n * Helpers.\n */\n\nvar s = 1000;\nvar m = s * 60;\nvar h = m * 60;\nvar d = h * 24;\nvar w = d * 7;\nvar y = d * 365.25;\n\n/**\n * Parse or format the given `val`.\n *\n * Options:\n *\n * - `long` verbose formatting [false]\n *\n * @param {String|Number} val\n * @param {Object} [options]\n * @throws {Error} throw an error if val is not a non-empty string or a number\n * @return {String|Number}\n * @api public\n */\n\nmodule.exports = function(val, options) {\n options = options || {};\n var type = typeof val;\n if (type === 'string' && val.length > 0) {\n return parse(val);\n } else if (type === 'number' && isFinite(val)) {\n return options.long ? fmtLong(val) : fmtShort(val);\n }\n throw new Error(\n 'val is not a non-empty string or a valid number. val=' +\n JSON.stringify(val)\n );\n};\n\n/**\n * Parse the given `str` and return milliseconds.\n *\n * @param {String} str\n * @return {Number}\n * @api private\n */\n\nfunction parse(str) {\n str = String(str);\n if (str.length > 100) {\n return;\n }\n var match = /^(-?(?:\\d+)?\\.?\\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(\n str\n );\n if (!match) {\n return;\n }\n var n = parseFloat(match[1]);\n var type = (match[2] || 'ms').toLowerCase();\n switch (type) {\n case 'years':\n case 'year':\n case 'yrs':\n case 'yr':\n case 'y':\n return n * y;\n case 'weeks':\n case 'week':\n case 'w':\n return n * w;\n case 'days':\n case 'day':\n case 'd':\n return n * d;\n case 'hours':\n case 'hour':\n case 'hrs':\n case 'hr':\n case 'h':\n return n * h;\n case 'minutes':\n case 'minute':\n case 'mins':\n case 'min':\n case 'm':\n return n * m;\n case 'seconds':\n case 'second':\n case 'secs':\n case 'sec':\n case 's':\n return n * s;\n case 'milliseconds':\n case 'millisecond':\n case 'msecs':\n case 'msec':\n case 'ms':\n return n;\n default:\n return undefined;\n }\n}\n\n/**\n * Short format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtShort(ms) {\n var msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return Math.round(ms / d) + 'd';\n }\n if (msAbs >= h) {\n return Math.round(ms / h) + 'h';\n }\n if (msAbs >= m) {\n return Math.round(ms / m) + 'm';\n }\n if (msAbs >= s) {\n return Math.round(ms / s) + 's';\n }\n return ms + 'ms';\n}\n\n/**\n * Long format for `ms`.\n *\n * @param {Number} ms\n * @return {String}\n * @api private\n */\n\nfunction fmtLong(ms) {\n var msAbs = Math.abs(ms);\n if (msAbs >= d) {\n return plural(ms, msAbs, d, 'day');\n }\n if (msAbs >= h) {\n return plural(ms, msAbs, h, 'hour');\n }\n if (msAbs >= m) {\n return plural(ms, msAbs, m, 'minute');\n }\n if (msAbs >= s) {\n return plural(ms, msAbs, s, 'second');\n }\n return ms + ' ms';\n}\n\n/**\n * Pluralization helper.\n */\n\nfunction plural(ms, msAbs, n, name) {\n var isPlural = msAbs >= n * 1.5;\n return Math.round(ms / n) + ' ' + name + (isPlural ? 's' : '');\n}\n","/*! multistream. MIT License. Feross Aboukhadijeh */\nconst stream = require('readable-stream')\nconst once = require('once')\n\nfunction toStreams2Obj (s) {\n return toStreams2(s, { objectMode: true, highWaterMark: 16 })\n}\n\nfunction toStreams2Buf (s) {\n return toStreams2(s)\n}\n\nfunction toStreams2 (s, opts) {\n if (!s || typeof s === 'function' || s._readableState) return s\n\n const wrap = new stream.Readable(opts).wrap(s)\n if (s.destroy) {\n wrap.destroy = s.destroy.bind(s)\n }\n return wrap\n}\n\nclass MultiStream extends stream.Readable {\n constructor (streams, opts) {\n super({ ...opts, autoDestroy: true })\n\n this._drained = false\n this._forwarding = false\n this._current = null\n this._toStreams2 = (opts && opts.objectMode) ? toStreams2Obj : toStreams2Buf\n\n if (typeof streams === 'function') {\n this._queue = streams\n } else {\n this._queue = streams.map(this._toStreams2)\n this._queue.forEach(stream => {\n if (typeof stream !== 'function') this._attachErrorListener(stream)\n })\n }\n\n this._next()\n }\n\n _read () {\n this._drained = true\n this._forward()\n }\n\n _forward () {\n if (this._forwarding || !this._drained || !this._current) return\n this._forwarding = true\n\n let chunk\n while (this._drained && (chunk = this._current.read()) !== null) {\n this._drained = this.push(chunk)\n }\n\n this._forwarding = false\n }\n\n _destroy (err, cb) {\n let streams = []\n if (this._current) streams.push(this._current)\n if (typeof this._queue !== 'function') streams = streams.concat(this._queue)\n\n if (streams.length === 0) {\n cb(err)\n } else {\n let counter = streams.length\n let er = err\n streams.forEach(stream => {\n destroy(stream, err, err => {\n er = er || err\n if (--counter === 0) {\n cb(er)\n }\n })\n })\n }\n }\n\n _next () {\n this._current = null\n\n if (typeof this._queue === 'function') {\n this._queue((err, stream) => {\n if (err) return this.destroy(err)\n stream = this._toStreams2(stream)\n this._attachErrorListener(stream)\n this._gotNextStream(stream)\n })\n } else {\n let stream = this._queue.shift()\n if (typeof stream === 'function') {\n stream = this._toStreams2(stream())\n this._attachErrorListener(stream)\n }\n this._gotNextStream(stream)\n }\n }\n\n _gotNextStream (stream) {\n if (!stream) {\n this.push(null)\n return\n }\n\n this._current = stream\n this._forward()\n\n const onReadable = () => {\n this._forward()\n }\n\n const onClose = () => {\n if (!stream._readableState.ended && !stream.destroyed) {\n const err = new Error('ERR_STREAM_PREMATURE_CLOSE')\n err.code = 'ERR_STREAM_PREMATURE_CLOSE'\n this.destroy(err)\n }\n }\n\n const onEnd = () => {\n this._current = null\n stream.removeListener('readable', onReadable)\n stream.removeListener('end', onEnd)\n stream.removeListener('close', onClose)\n stream.destroy()\n this._next()\n }\n\n stream.on('readable', onReadable)\n stream.once('end', onEnd)\n stream.once('close', onClose)\n }\n\n _attachErrorListener (stream) {\n if (!stream) return\n\n const onError = (err) => {\n stream.removeListener('error', onError)\n this.destroy(err)\n }\n\n stream.once('error', onError)\n }\n}\n\nMultiStream.obj = streams => (\n new MultiStream(streams, { objectMode: true, highWaterMark: 16 })\n)\n\nmodule.exports = MultiStream\n\n// Normalize stream destroy w/ callback.\nfunction destroy (stream, err, cb) {\n if (!stream.destroy || stream.destroyed) {\n cb(err)\n } else {\n const callback = once(er => cb(er || err))\n stream\n .on('error', callback)\n .on('close', () => callback())\n .destroy(err, callback)\n }\n}\n","module.exports = nextEvent\n\nfunction nextEvent (emitter, name) {\n var next = null\n emitter.on(name, function (data) {\n if (!next) return\n var fn = next\n next = null\n fn(data)\n })\n\n return function (once) {\n next = once\n }\n}\n","'use strict';\n\nvar numberIsNaN = function (value) {\n\treturn value !== value;\n};\n\nmodule.exports = function is(a, b) {\n\tif (a === 0 && b === 0) {\n\t\treturn 1 / a === 1 / b;\n\t}\n\tif (a === b) {\n\t\treturn true;\n\t}\n\tif (numberIsNaN(a) && numberIsNaN(b)) {\n\t\treturn true;\n\t}\n\treturn false;\n};\n\n","'use strict';\n\nvar define = require('define-properties');\nvar callBind = require('call-bind');\n\nvar implementation = require('./implementation');\nvar getPolyfill = require('./polyfill');\nvar shim = require('./shim');\n\nvar polyfill = callBind(getPolyfill(), Object);\n\ndefine(polyfill, {\n\tgetPolyfill: getPolyfill,\n\timplementation: implementation,\n\tshim: shim\n});\n\nmodule.exports = polyfill;\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\treturn typeof Object.is === 'function' ? Object.is : implementation;\n};\n","'use strict';\n\nvar getPolyfill = require('./polyfill');\nvar define = require('define-properties');\n\nmodule.exports = function shimObjectIs() {\n\tvar polyfill = getPolyfill();\n\tdefine(Object, { is: polyfill }, {\n\t\tis: function testObjectIs() {\n\t\t\treturn Object.is !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","'use strict';\n\nvar keysShim;\nif (!Object.keys) {\n\t// modified from https://github.com/es-shims/es5-shim\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar toStr = Object.prototype.toString;\n\tvar isArgs = require('./isArguments'); // eslint-disable-line global-require\n\tvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\tvar hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString');\n\tvar hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype');\n\tvar dontEnums = [\n\t\t'toString',\n\t\t'toLocaleString',\n\t\t'valueOf',\n\t\t'hasOwnProperty',\n\t\t'isPrototypeOf',\n\t\t'propertyIsEnumerable',\n\t\t'constructor'\n\t];\n\tvar equalsConstructorPrototype = function (o) {\n\t\tvar ctor = o.constructor;\n\t\treturn ctor && ctor.prototype === o;\n\t};\n\tvar excludedKeys = {\n\t\t$applicationCache: true,\n\t\t$console: true,\n\t\t$external: true,\n\t\t$frame: true,\n\t\t$frameElement: true,\n\t\t$frames: true,\n\t\t$innerHeight: true,\n\t\t$innerWidth: true,\n\t\t$onmozfullscreenchange: true,\n\t\t$onmozfullscreenerror: true,\n\t\t$outerHeight: true,\n\t\t$outerWidth: true,\n\t\t$pageXOffset: true,\n\t\t$pageYOffset: true,\n\t\t$parent: true,\n\t\t$scrollLeft: true,\n\t\t$scrollTop: true,\n\t\t$scrollX: true,\n\t\t$scrollY: true,\n\t\t$self: true,\n\t\t$webkitIndexedDB: true,\n\t\t$webkitStorageInfo: true,\n\t\t$window: true\n\t};\n\tvar hasAutomationEqualityBug = (function () {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined') { return false; }\n\t\tfor (var k in window) {\n\t\t\ttry {\n\t\t\t\tif (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tequalsConstructorPrototype(window[k]);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (e) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}());\n\tvar equalsConstructorPrototypeIfNotBuggy = function (o) {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined' || !hasAutomationEqualityBug) {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t}\n\t\ttry {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tkeysShim = function keys(object) {\n\t\tvar isObject = object !== null && typeof object === 'object';\n\t\tvar isFunction = toStr.call(object) === '[object Function]';\n\t\tvar isArguments = isArgs(object);\n\t\tvar isString = isObject && toStr.call(object) === '[object String]';\n\t\tvar theKeys = [];\n\n\t\tif (!isObject && !isFunction && !isArguments) {\n\t\t\tthrow new TypeError('Object.keys called on a non-object');\n\t\t}\n\n\t\tvar skipProto = hasProtoEnumBug && isFunction;\n\t\tif (isString && object.length > 0 && !has.call(object, 0)) {\n\t\t\tfor (var i = 0; i < object.length; ++i) {\n\t\t\t\ttheKeys.push(String(i));\n\t\t\t}\n\t\t}\n\n\t\tif (isArguments && object.length > 0) {\n\t\t\tfor (var j = 0; j < object.length; ++j) {\n\t\t\t\ttheKeys.push(String(j));\n\t\t\t}\n\t\t} else {\n\t\t\tfor (var name in object) {\n\t\t\t\tif (!(skipProto && name === 'prototype') && has.call(object, name)) {\n\t\t\t\t\ttheKeys.push(String(name));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (hasDontEnumBug) {\n\t\t\tvar skipConstructor = equalsConstructorPrototypeIfNotBuggy(object);\n\n\t\t\tfor (var k = 0; k < dontEnums.length; ++k) {\n\t\t\t\tif (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) {\n\t\t\t\t\ttheKeys.push(dontEnums[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn theKeys;\n\t};\n}\nmodule.exports = keysShim;\n","'use strict';\n\nvar slice = Array.prototype.slice;\nvar isArgs = require('./isArguments');\n\nvar origKeys = Object.keys;\nvar keysShim = origKeys ? function keys(o) { return origKeys(o); } : require('./implementation');\n\nvar originalKeys = Object.keys;\n\nkeysShim.shim = function shimObjectKeys() {\n\tif (Object.keys) {\n\t\tvar keysWorksWithArguments = (function () {\n\t\t\t// Safari 5.0 bug\n\t\t\tvar args = Object.keys(arguments);\n\t\t\treturn args && args.length === arguments.length;\n\t\t}(1, 2));\n\t\tif (!keysWorksWithArguments) {\n\t\t\tObject.keys = function keys(object) { // eslint-disable-line func-name-matching\n\t\t\t\tif (isArgs(object)) {\n\t\t\t\t\treturn originalKeys(slice.call(object));\n\t\t\t\t}\n\t\t\t\treturn originalKeys(object);\n\t\t\t};\n\t\t}\n\t} else {\n\t\tObject.keys = keysShim;\n\t}\n\treturn Object.keys || keysShim;\n};\n\nmodule.exports = keysShim;\n","'use strict';\n\nvar toStr = Object.prototype.toString;\n\nmodule.exports = function isArguments(value) {\n\tvar str = toStr.call(value);\n\tvar isArgs = str === '[object Arguments]';\n\tif (!isArgs) {\n\t\tisArgs = str !== '[object Array]' &&\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\ttypeof value.length === 'number' &&\n\t\t\tvalue.length >= 0 &&\n\t\t\ttoStr.call(value.callee) === '[object Function]';\n\t}\n\treturn isArgs;\n};\n","var wrappy = require('wrappy')\nmodule.exports = wrappy(once)\nmodule.exports.strict = wrappy(onceStrict)\n\nonce.proto = once(function () {\n Object.defineProperty(Function.prototype, 'once', {\n value: function () {\n return once(this)\n },\n configurable: true\n })\n\n Object.defineProperty(Function.prototype, 'onceStrict', {\n value: function () {\n return onceStrict(this)\n },\n configurable: true\n })\n})\n\nfunction once (fn) {\n var f = function () {\n if (f.called) return f.value\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n f.called = false\n return f\n}\n\nfunction onceStrict (fn) {\n var f = function () {\n if (f.called)\n throw new Error(f.onceError)\n f.called = true\n return f.value = fn.apply(this, arguments)\n }\n var name = fn.name || 'Function wrapped with `once`'\n f.onceError = name + \" shouldn't be called more than once\"\n f.called = false\n return f\n}\n","'use strict';\n\n\nvar TYPED_OK = (typeof Uint8Array !== 'undefined') &&\n (typeof Uint16Array !== 'undefined') &&\n (typeof Int32Array !== 'undefined');\n\nfunction _has(obj, key) {\n return Object.prototype.hasOwnProperty.call(obj, key);\n}\n\nexports.assign = function (obj /*from1, from2, from3, ...*/) {\n var sources = Array.prototype.slice.call(arguments, 1);\n while (sources.length) {\n var source = sources.shift();\n if (!source) { continue; }\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 (_has(source, p)) {\n obj[p] = source[p];\n }\n }\n }\n\n return obj;\n};\n\n\n// reduce buffer size, avoiding mem copy\nexports.shrinkBuf = function (buf, size) {\n if (buf.length === size) { return buf; }\n if (buf.subarray) { return buf.subarray(0, size); }\n buf.length = size;\n return buf;\n};\n\n\nvar fnTyped = {\n arraySet: function (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 }\n // Fallback to ordinary array\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 (chunks) {\n var i, l, len, pos, chunk, result;\n\n // calculate data length\n len = 0;\n for (i = 0, l = chunks.length; i < l; i++) {\n len += chunks[i].length;\n }\n\n // join chunks\n result = new Uint8Array(len);\n pos = 0;\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\nvar fnUntyped = {\n arraySet: function (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 (chunks) {\n return [].concat.apply([], chunks);\n }\n};\n\n\n// Enable/Disable typed arrays use, for testing\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);\n","'use strict';\n\n// Note: adler32 takes 12% for level 0 and 2% for level 6.\n// It isn't worth it to make additional optimizations as in original.\n// Small size is preferable.\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\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\n\nmodule.exports = adler32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n\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\n\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\n //Z_NULL: null // Use -1 or null inline, depending on var type\n};\n","'use strict';\n\n// 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\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// Use ordinary array, since untyped makes no boost here\nfunction makeTable() {\n var c, table = [];\n\n for (var n = 0; n < 256; n++) {\n c = n;\n for (var k = 0; k < 8; k++) {\n c = ((c & 1) ? (0xEDB88320 ^ (c >>> 1)) : (c >>> 1));\n }\n table[n] = c;\n }\n\n return table;\n}\n\n// Create table on load. Just 255 signed longs. Not a problem.\nvar crcTable = makeTable();\n\n\nfunction crc32(crc, buf, len, pos) {\n var t = crcTable,\n end = pos + len;\n\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\n\nmodule.exports = crc32;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar trees = require('./trees');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar msg = require('./messages');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n/* Allowed flush values; see deflate() and inflate() below for details */\nvar Z_NO_FLUSH = 0;\nvar Z_PARTIAL_FLUSH = 1;\n//var Z_SYNC_FLUSH = 2;\nvar Z_FULL_FLUSH = 3;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\n//var Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\n//var Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\n//var Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n\n/* compression levels */\n//var Z_NO_COMPRESSION = 0;\n//var Z_BEST_SPEED = 1;\n//var Z_BEST_COMPRESSION = 9;\nvar Z_DEFAULT_COMPRESSION = -1;\n\n\nvar Z_FILTERED = 1;\nvar Z_HUFFMAN_ONLY = 2;\nvar Z_RLE = 3;\nvar Z_FIXED = 4;\nvar Z_DEFAULT_STRATEGY = 0;\n\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\nvar Z_UNKNOWN = 2;\n\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n/*============================================================================*/\n\n\nvar MAX_MEM_LEVEL = 9;\n/* Maximum value for memLevel in deflateInit2 */\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_MEM_LEVEL = 8;\n\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\nvar D_CODES = 30;\n/* number of distance codes */\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\nvar MIN_LOOKAHEAD = (MAX_MATCH + MIN_MATCH + 1);\n\nvar PRESET_DICT = 0x20;\n\nvar INIT_STATE = 42;\nvar EXTRA_STATE = 69;\nvar NAME_STATE = 73;\nvar COMMENT_STATE = 91;\nvar HCRC_STATE = 103;\nvar BUSY_STATE = 113;\nvar FINISH_STATE = 666;\n\nvar BS_NEED_MORE = 1; /* block not completed, need more input or more output */\nvar BS_BLOCK_DONE = 2; /* block flush performed */\nvar BS_FINISH_STARTED = 3; /* finish started, need only more output at next deflate */\nvar BS_FINISH_DONE = 4; /* finish done, accept no more input or output */\n\nvar OS_CODE = 0x03; // Unix :) . Don't detect, use this default.\n\nfunction err(strm, errorCode) {\n strm.msg = msg[errorCode];\n return errorCode;\n}\n\nfunction rank(f) {\n return ((f) << 1) - ((f) > 4 ? 9 : 0);\n}\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { 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 */\nfunction flush_pending(strm) {\n var s = strm.state;\n\n //_tr_flush_bits(s);\n var len = s.pending;\n if (len > strm.avail_out) {\n len = strm.avail_out;\n }\n if (len === 0) { return; }\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 if (s.pending === 0) {\n s.pending_out = 0;\n }\n}\n\n\nfunction 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 s.block_start = s.strstart;\n flush_pending(s.strm);\n}\n\n\nfunction put_byte(s, b) {\n s.pending_buf[s.pending++] = b;\n}\n\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 */\nfunction 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\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 */\nfunction read_buf(strm, buf, start, size) {\n var len = strm.avail_in;\n\n if (len > size) { len = size; }\n if (len === 0) { return 0; }\n\n strm.avail_in -= len;\n\n // zmemcpy(buf, strm->next_in, len);\n utils.arraySet(buf, strm.input, strm.next_in, len, start);\n if (strm.state.wrap === 1) {\n strm.adler = adler32(strm.adler, buf, len, start);\n }\n\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\n return len;\n}\n\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 */\nfunction longest_match(s, cur_match) {\n var chain_length = s.max_chain_length; /* max hash chain length */\n var scan = s.strstart; /* current string */\n var match; /* matched string */\n var len; /* length of current match */\n var best_len = s.prev_length; /* best match length so far */\n var nice_match = s.nice_match; /* stop if match long enough */\n var limit = (s.strstart > (s.w_size - MIN_LOOKAHEAD)) ?\n s.strstart - (s.w_size - MIN_LOOKAHEAD) : 0/*NIL*/;\n\n var _win = s.window; // shortcut\n\n var wmask = s.w_mask;\n var prev = s.prev;\n\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\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 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 if (nice_match > s.lookahead) { nice_match = s.lookahead; }\n\n // Assert((ulg)s->strstart <= s->window_size-MIN_LOOKAHEAD, \"need lookahead\");\n\n do {\n // Assert(cur_match < s->strstart, \"no future\");\n match = cur_match;\n\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 ||\n _win[match + best_len - 1] !== scan_end1 ||\n _win[match] !== _win[scan] ||\n _win[++match] !== _win[scan + 1]) {\n continue;\n }\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 scan += 2;\n match++;\n // 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 do {\n /*jshint noempty:false*/\n } while (_win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n _win[++scan] === _win[++match] && _win[++scan] === _win[++match] &&\n scan < strend);\n\n // Assert(scan <= s->window+(unsigned)(s->window_size-1), \"wild scan\");\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 if (len >= nice_match) {\n break;\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 return s.lookahead;\n}\n\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 */\nfunction fill_window(s) {\n var _w_size = s.w_size;\n var p, n, m, more, str;\n\n //Assert(s->lookahead < MIN_LOOKAHEAD, \"already enough lookahead\");\n\n do {\n more = s.window_size - s.lookahead - s.strstart;\n\n // JS ints have 32 bit, block below not needed\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\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 if (s.strstart >= _w_size + (_w_size - MIN_LOOKAHEAD)) {\n\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 s.block_start -= _w_size;\n\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 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 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 if (s.strm.avail_in === 0) {\n break;\n }\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 = read_buf(s.strm, s.window, s.strstart + s.lookahead, more);\n s.lookahead += n;\n\n /* Initialize the hash value now that we have some input: */\n if (s.lookahead + s.insert >= MIN_MATCH) {\n str = s.strstart - s.insert;\n s.ins_h = s.window[str];\n\n /* UPDATE_HASH(s, s->ins_h, s->window[str + 1]); */\n s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[str + 1]) & s.hash_mask;\n//#if MIN_MATCH != 3\n// Call update_hash() MIN_MATCH-3 more times\n//#endif\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\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 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\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 */\nfunction 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\n /* Copy as much as possible from input to output: */\n for (;;) {\n /* Fill the window as much as possible: */\n if (s.lookahead <= 1) {\n\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\n fill_window(s);\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 s.strstart += s.lookahead;\n s.lookahead = 0;\n\n /* Emit a stored block if pending_buf will be full: */\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 flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\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 if (s.strstart - s.block_start >= (s.w_size - MIN_LOOKAHEAD)) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\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 if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\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 if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_NEED_MORE;\n}\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 */\nfunction deflate_fast(s, flush) {\n var hash_head; /* head of the hash chain */\n var bflush; /* 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 if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) {\n break; /* flush the current block */\n }\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 hash_head = 0/*NIL*/;\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\n /* Find the longest match, discarding those <= prev_length.\n * At this point we have always match_length < MIN_MATCH\n */\n if (hash_head !== 0/*NIL*/ && ((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 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\n s.lookahead -= s.match_length;\n\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 if (s.match_length <= s.max_lazy_match/*max_insert_length*/ && s.lookahead >= MIN_MATCH) {\n s.match_length--; /* string at strstart already in table */\n do {\n s.strstart++;\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 /* strstart never exceeds WSIZE-MAX_MATCH, so there are\n * always MIN_MATCH bytes ahead.\n */\n } while (--s.match_length !== 0);\n s.strstart++;\n } else\n {\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 s.ins_h = ((s.ins_h << s.hash_shift) ^ s.window[s.strstart + 1]) & s.hash_mask;\n\n//#if MIN_MATCH != 3\n// Call UPDATE_HASH() MIN_MATCH-3 more times\n//#endif\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 /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = ((s.strstart < (MIN_MATCH - 1)) ? s.strstart : MIN_MATCH - 1);\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\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 */\nfunction deflate_slow(s, flush) {\n var hash_head; /* head of hash chain */\n var bflush; /* set if current block must be flushed */\n\n var max_insert;\n\n /* Process the input block. */\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 if (s.lookahead < MIN_LOOKAHEAD && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* 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 hash_head = 0/*NIL*/;\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\n /* Find the longest match, discarding those <= prev_length.\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/*NIL*/ && s.prev_length < s.max_lazy_match &&\n s.strstart - hash_head <= (s.w_size - MIN_LOOKAHEAD)/*MAX_DIST(s)*/) {\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 &&\n (s.strategy === Z_FILTERED || (s.match_length === MIN_MATCH && s.strstart - s.match_start > 4096/*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 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\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 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 s.lookahead -= s.prev_length - 1;\n s.prev_length -= 2;\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 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 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 /*** _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 s.strstart++;\n s.lookahead--;\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 }\n //Assert (flush != Z_NO_FLUSH, \"no flush?\");\n if (s.match_available) {\n //Tracevv((stderr,\"%c\", s->window[s->strstart-1]));\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 s.match_available = 0;\n }\n s.insert = s.strstart < MIN_MATCH - 1 ? s.strstart : MIN_MATCH - 1;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n\n return BS_BLOCK_DONE;\n}\n\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 */\nfunction deflate_rle(s, flush) {\n var bflush; /* set if current block must be flushed */\n var prev; /* byte at distance one to match */\n var scan, strend; /* 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 if (s.lookahead <= MAX_MATCH && flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n if (s.lookahead === 0) { break; } /* flush the current block */\n }\n\n /* See how many times the previous byte repeats */\n s.match_length = 0;\n if (s.lookahead >= MIN_MATCH && s.strstart > 0) {\n scan = s.strstart - 1;\n prev = _win[scan];\n if (prev === _win[++scan] && prev === _win[++scan] && prev === _win[++scan]) {\n strend = s.strstart + MAX_MATCH;\n do {\n /*jshint noempty:false*/\n } while (prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n prev === _win[++scan] && prev === _win[++scan] &&\n scan < strend);\n s.match_length = MAX_MATCH - (strend - scan);\n if (s.match_length > s.lookahead) {\n s.match_length = s.lookahead;\n }\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 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\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 /*** _tr_tally_lit(s, s.window[s.strstart], bflush); ***/\n bflush = trees._tr_tally(s, 0, s.window[s.strstart]);\n\n s.lookahead--;\n s.strstart++;\n }\n if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\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 */\nfunction deflate_huff(s, flush) {\n var bflush; /* 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 if (s.lookahead === 0) {\n if (flush === Z_NO_FLUSH) {\n return BS_NEED_MORE;\n }\n break; /* flush the current block */\n }\n }\n\n /* Output a literal byte */\n s.match_length = 0;\n //Tracevv((stderr,\"%c\", s->window[s->strstart]));\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 if (bflush) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n }\n s.insert = 0;\n if (flush === Z_FINISH) {\n /*** FLUSH_BLOCK(s, 1); ***/\n flush_block_only(s, true);\n if (s.strm.avail_out === 0) {\n return BS_FINISH_STARTED;\n }\n /***/\n return BS_FINISH_DONE;\n }\n if (s.last_lit) {\n /*** FLUSH_BLOCK(s, 0); ***/\n flush_block_only(s, false);\n if (s.strm.avail_out === 0) {\n return BS_NEED_MORE;\n }\n /***/\n }\n return BS_BLOCK_DONE;\n}\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 */\nfunction 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\nvar configuration_table;\n\nconfiguration_table = [\n /* good lazy nice chain */\n new Config(0, 0, 0, 0, deflate_stored), /* 0 store only */\n new Config(4, 4, 8, 4, deflate_fast), /* 1 max speed, no lazy matches */\n new Config(4, 5, 16, 8, deflate_fast), /* 2 */\n new Config(4, 6, 32, 32, deflate_fast), /* 3 */\n\n new Config(4, 4, 16, 16, deflate_slow), /* 4 lazy matches */\n new Config(8, 16, 32, 32, deflate_slow), /* 5 */\n new Config(8, 16, 128, 128, deflate_slow), /* 6 */\n new Config(8, 32, 128, 256, deflate_slow), /* 7 */\n new Config(32, 128, 258, 1024, deflate_slow), /* 8 */\n new Config(32, 258, 258, 4096, deflate_slow) /* 9 max compression */\n];\n\n\n/* ===========================================================================\n * Initialize the \"longest match\" routines for a new zlib stream\n */\nfunction lm_init(s) {\n s.window_size = 2 * s.w_size;\n\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n\n /* Set the default configuration parameters:\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\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\nfunction DeflateState() {\n this.strm = null; /* pointer back to this zlib stream */\n this.status = 0; /* as the name implies */\n this.pending_buf = null; /* output still pending */\n this.pending_buf_size = 0; /* size of pending_buf */\n this.pending_out = 0; /* next pending byte to output to the stream */\n this.pending = 0; /* nb of bytes in the pending buffer */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.gzhead = null; /* gzip header information to write */\n this.gzindex = 0; /* where in extra, name, or comment */\n this.method = Z_DEFLATED; /* can only be DEFLATED */\n this.last_flush = -1; /* value of flush param for previous deflate call */\n\n this.w_size = 0; /* LZ77 window size (32K by default) */\n this.w_bits = 0; /* log2(w_size) (8..16) */\n this.w_mask = 0; /* 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; /* Heads of the hash chains or NIL. */\n\n this.ins_h = 0; /* hash index of string to be inserted */\n this.hash_size = 0; /* number of elements in hash table */\n this.hash_bits = 0; /* log2(hash_size) */\n this.hash_mask = 0; /* 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; /* length of best match */\n this.prev_match = 0; /* previous match */\n this.match_available = 0; /* set if previous match exists */\n this.strstart = 0; /* start of string to insert */\n this.match_start = 0; /* start of matching string */\n this.lookahead = 0; /* 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 /* 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; /* compression level (1..9) */\n this.strategy = 0; /* 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; /* 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\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\n // Use flat array of DOUBLE size, with interleaved fata,\n // because JS does not support effective\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\n this.l_desc = null; /* desc. for literal tree */\n this.d_desc = null; /* desc. for distance tree */\n this.bl_desc = null; /* desc. for bit length tree */\n\n //ush bl_count[MAX_BITS+1];\n this.bl_count = new utils.Buf16(MAX_BITS + 1);\n /* number of codes at each bit length for an optimal tree */\n\n //int heap[2*L_CODES+1]; /* heap used to build the Huffman trees */\n this.heap = new utils.Buf16(2 * L_CODES + 1); /* heap used to build the Huffman trees */\n zero(this.heap);\n\n this.heap_len = 0; /* number of elements in the heap */\n this.heap_max = 0; /* element of largest frequency */\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 zero(this.depth);\n /* Depth of each subtree used as tie breaker for trees of equal frequency\n */\n\n this.l_buf = 0; /* 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; /* 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; /* bit length of current block with optimal trees */\n this.static_len = 0; /* bit length of current block with static trees */\n this.matches = 0; /* number of string matches in current block */\n this.insert = 0; /* bytes at end of window left to insert */\n\n\n this.bi_buf = 0;\n /* Output buffer. bits are inserted starting at the bottom (least\n * significant bits).\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\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 /* 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\nfunction 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\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 s.status = (s.wrap ? INIT_STATE : BUSY_STATE);\n strm.adler = (s.wrap === 2) ?\n 0 // crc32(0, Z_NULL, 0)\n :\n 1; // adler32(0, Z_NULL, 0)\n s.last_flush = Z_NO_FLUSH;\n trees._tr_init(s);\n return Z_OK;\n}\n\n\nfunction deflateReset(strm) {\n var ret = deflateResetKeep(strm);\n if (ret === Z_OK) {\n lm_init(strm.state);\n }\n return ret;\n}\n\n\nfunction deflateSetHeader(strm, head) {\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n if (strm.state.wrap !== 2) { return Z_STREAM_ERROR; }\n strm.state.gzhead = head;\n return Z_OK;\n}\n\n\nfunction deflateInit2(strm, level, method, windowBits, memLevel, strategy) {\n if (!strm) { // === Z_NULL\n return Z_STREAM_ERROR;\n }\n var wrap = 1;\n\n if (level === Z_DEFAULT_COMPRESSION) {\n level = 6;\n }\n\n if (windowBits < 0) { /* suppress zlib wrapper */\n wrap = 0;\n windowBits = -windowBits;\n }\n\n else if (windowBits > 15) {\n wrap = 2; /* write gzip wrapper instead */\n windowBits -= 16;\n }\n\n\n if (memLevel < 1 || memLevel > MAX_MEM_LEVEL || method !== Z_DEFLATED ||\n windowBits < 8 || windowBits > 15 || level < 0 || level > 9 ||\n strategy < 0 || strategy > Z_FIXED) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n\n if (windowBits === 8) {\n windowBits = 9;\n }\n /* until 256-byte window bug fixed */\n\n var s = new DeflateState();\n\n strm.state = s;\n s.strm = strm;\n\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\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\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);\n\n // 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); /* 16K elements by default */\n\n s.pending_buf_size = s.lit_bufsize * 4;\n\n //overlay = (ushf *) ZALLOC(strm, s->lit_bufsize, sizeof(ush)+2);\n //s->pending_buf = (uchf *) overlay;\n s.pending_buf = new utils.Buf8(s.pending_buf_size);\n\n // It is offset from `s.pending_buf` (size is `s.lit_bufsize * 2`)\n //s->d_buf = overlay + s->lit_bufsize/sizeof(ush);\n s.d_buf = 1 * s.lit_bufsize;\n\n //s->l_buf = s->pending_buf + (1+sizeof(ush))*s->lit_bufsize;\n s.l_buf = (1 + 2) * s.lit_bufsize;\n\n s.level = level;\n s.strategy = strategy;\n s.method = method;\n\n return deflateReset(strm);\n}\n\nfunction deflateInit(strm, level) {\n return deflateInit2(strm, level, Z_DEFLATED, MAX_WBITS, DEF_MEM_LEVEL, Z_DEFAULT_STRATEGY);\n}\n\n\nfunction deflate(strm, flush) {\n var old_flush, s;\n var beg, val; // for gzip header write only\n\n if (!strm || !strm.state ||\n 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 ||\n (!strm.input && strm.avail_in !== 0) ||\n (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; /* just in case */\n old_flush = s.last_flush;\n s.last_flush = flush;\n\n /* Write the header */\n if (s.status === INIT_STATE) {\n\n if (s.wrap === 2) { // GZIP header\n strm.adler = 0; //crc32(0L, Z_NULL, 0);\n put_byte(s, 31);\n put_byte(s, 139);\n put_byte(s, 8);\n if (!s.gzhead) { // 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 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, OS_CODE);\n s.status = BUSY_STATE;\n }\n else {\n put_byte(s, (s.gzhead.text ? 1 : 0) +\n (s.gzhead.hcrc ? 2 : 0) +\n (!s.gzhead.extra ? 0 : 4) +\n (!s.gzhead.name ? 0 : 8) +\n (!s.gzhead.comment ? 0 : 16)\n );\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 :\n (s.strategy >= Z_HUFFMAN_ONLY || s.level < 2 ?\n 4 : 0));\n put_byte(s, s.gzhead.os & 0xff);\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 if (s.gzhead.hcrc) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending, 0);\n }\n s.gzindex = 0;\n s.status = EXTRA_STATE;\n }\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 header |= (level_flags << 6);\n if (s.strstart !== 0) { header |= PRESET_DICT; }\n header += 31 - (header % 31);\n\n s.status = BUSY_STATE;\n putShortMSB(s, header);\n\n /* Save the adler32 of the preset dictionary: */\n if (s.strstart !== 0) {\n putShortMSB(s, strm.adler >>> 16);\n putShortMSB(s, strm.adler & 0xffff);\n }\n strm.adler = 1; // adler32(0L, Z_NULL, 0);\n }\n }\n\n//#ifdef GZIP\n if (s.status === EXTRA_STATE) {\n if (s.gzhead.extra/* != Z_NULL*/) {\n beg = s.pending; /* 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 flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n break;\n }\n }\n put_byte(s, s.gzhead.extra[s.gzindex] & 0xff);\n s.gzindex++;\n }\n if (s.gzhead.hcrc && s.pending > beg) {\n strm.adler = crc32(strm.adler, s.pending_buf, s.pending - beg, beg);\n }\n if (s.gzindex === s.gzhead.extra.length) {\n s.gzindex = 0;\n s.status = NAME_STATE;\n }\n }\n else {\n s.status = NAME_STATE;\n }\n }\n if (s.status === NAME_STATE) {\n if (s.gzhead.name/* != Z_NULL*/) {\n beg = s.pending; /* 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 flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.name.length) {\n val = s.gzhead.name.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\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 if (val === 0) {\n s.gzindex = 0;\n s.status = COMMENT_STATE;\n }\n }\n else {\n s.status = COMMENT_STATE;\n }\n }\n if (s.status === COMMENT_STATE) {\n if (s.gzhead.comment/* != Z_NULL*/) {\n beg = s.pending; /* 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 flush_pending(strm);\n beg = s.pending;\n if (s.pending === s.pending_buf_size) {\n val = 1;\n break;\n }\n }\n // JS specific: little magic to add zero terminator to end of string\n if (s.gzindex < s.gzhead.comment.length) {\n val = s.gzhead.comment.charCodeAt(s.gzindex++) & 0xff;\n } else {\n val = 0;\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 if (val === 0) {\n s.status = HCRC_STATE;\n }\n }\n else {\n s.status = HCRC_STATE;\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 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 s.status = BUSY_STATE;\n }\n }\n else {\n s.status = BUSY_STATE;\n }\n }\n//#endif\n\n /* Flush as much pending output as possible */\n if (s.pending !== 0) {\n flush_pending(strm);\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\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 } else if (strm.avail_in === 0 && rank(flush) <= rank(old_flush) &&\n flush !== Z_FINISH) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* User must not provide more input after the first FINISH: */\n if (s.status === FINISH_STATE && strm.avail_in !== 0) {\n return err(strm, Z_BUF_ERROR);\n }\n\n /* Start a new block or continue the current one.\n */\n if (strm.avail_in !== 0 || s.lookahead !== 0 ||\n (flush !== Z_NO_FLUSH && s.status !== FINISH_STATE)) {\n var bstate = (s.strategy === Z_HUFFMAN_ONLY) ? deflate_huff(s, flush) :\n (s.strategy === Z_RLE ? deflate_rle(s, flush) :\n 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 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 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 if (bstate === BS_BLOCK_DONE) {\n if (flush === Z_PARTIAL_FLUSH) {\n trees._tr_align(s);\n }\n else if (flush !== Z_BLOCK) { /* FULL_FLUSH or SYNC_FLUSH */\n\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 if (flush === Z_FULL_FLUSH) {\n /*** CLEAR_HASH(s); ***/ /* 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 flush_pending(strm);\n if (strm.avail_out === 0) {\n s.last_flush = -1; /* avoid BUF_ERROR at next call, see above */\n return Z_OK;\n }\n }\n }\n //Assert(strm->avail_out > 0, \"bug2\");\n //if (strm.avail_out <= 0) { throw new Error(\"bug2\");}\n\n if (flush !== Z_FINISH) { return Z_OK; }\n if (s.wrap <= 0) { return Z_STREAM_END; }\n\n /* Write the trailer */\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 }\n else\n {\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 if (s.wrap > 0) { s.wrap = -s.wrap; }\n /* write the trailer only once! */\n return s.pending !== 0 ? Z_OK : Z_STREAM_END;\n}\n\nfunction deflateEnd(strm) {\n var status;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n status = strm.state.status;\n if (status !== INIT_STATE &&\n status !== EXTRA_STATE &&\n status !== NAME_STATE &&\n status !== COMMENT_STATE &&\n status !== HCRC_STATE &&\n status !== BUSY_STATE &&\n status !== FINISH_STATE\n ) {\n return err(strm, Z_STREAM_ERROR);\n }\n\n strm.state = null;\n\n return status === BUSY_STATE ? err(strm, Z_DATA_ERROR) : Z_OK;\n}\n\n\n/* =========================================================================\n * Initializes the compression dictionary from the given byte\n * sequence without producing any compressed output.\n */\nfunction deflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var s;\n var str, n;\n var wrap;\n var avail;\n var next;\n var input;\n var tmpDict;\n\n if (!strm/*== Z_NULL*/ || !strm.state/*== Z_NULL*/) {\n return Z_STREAM_ERROR;\n }\n\n s = strm.state;\n wrap = s.wrap;\n\n if (wrap === 2 || (wrap === 1 && s.status !== INIT_STATE) || s.lookahead) {\n return Z_STREAM_ERROR;\n }\n\n /* when using zlib wrappers, compute Adler-32 for provided dictionary */\n if (wrap === 1) {\n /* adler32(strm->adler, dictionary, dictLength); */\n strm.adler = adler32(strm.adler, dictionary, dictLength, 0);\n }\n\n s.wrap = 0; /* avoid computing Adler-32 in read_buf */\n\n /* if dictionary would fill window, just replace the history */\n if (dictLength >= s.w_size) {\n if (wrap === 0) { /* already empty otherwise */\n /*** CLEAR_HASH(s); ***/\n zero(s.head); // Fill with NIL (= 0);\n s.strstart = 0;\n s.block_start = 0;\n s.insert = 0;\n }\n /* use the tail */\n // dictionary = dictionary.slice(dictLength - s.w_size);\n tmpDict = new utils.Buf8(s.w_size);\n utils.arraySet(tmpDict, dictionary, dictLength - s.w_size, s.w_size, 0);\n dictionary = tmpDict;\n dictLength = s.w_size;\n }\n /* insert dictionary into window and hash */\n avail = strm.avail_in;\n next = strm.next_in;\n input = strm.input;\n strm.avail_in = dictLength;\n strm.next_in = 0;\n strm.input = dictionary;\n fill_window(s);\n while (s.lookahead >= MIN_MATCH) {\n str = s.strstart;\n n = s.lookahead - (MIN_MATCH - 1);\n do {\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\n s.prev[str & s.w_mask] = s.head[s.ins_h];\n\n s.head[s.ins_h] = str;\n str++;\n } while (--n);\n s.strstart = str;\n s.lookahead = MIN_MATCH - 1;\n fill_window(s);\n }\n s.strstart += s.lookahead;\n s.block_start = s.strstart;\n s.insert = s.lookahead;\n s.lookahead = 0;\n s.match_length = s.prev_length = MIN_MATCH - 1;\n s.match_available = 0;\n strm.next_in = next;\n strm.input = input;\n strm.avail_in = avail;\n s.wrap = wrap;\n return Z_OK;\n}\n\n\nexports.deflateInit = deflateInit;\nexports.deflateInit2 = deflateInit2;\nexports.deflateReset = deflateReset;\nexports.deflateResetKeep = deflateResetKeep;\nexports.deflateSetHeader = deflateSetHeader;\nexports.deflate = deflate;\nexports.deflateEnd = deflateEnd;\nexports.deflateSetDictionary = deflateSetDictionary;\nexports.deflateInfo = 'pako deflate (from Nodeca project)';\n\n/* Not implemented\nexports.deflateBound = deflateBound;\nexports.deflateCopy = deflateCopy;\nexports.deflateParams = deflateParams;\nexports.deflatePending = deflatePending;\nexports.deflatePrime = deflatePrime;\nexports.deflateTune = deflateTune;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n// See state defs from inflate.js\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar TYPE = 12; /* 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 */\nmodule.exports = function inflate_fast(strm, start) {\n var state;\n var _in; /* local strm.input */\n var last; /* have enough input while in < last */\n var _out; /* local strm.output */\n var beg; /* inflate()'s initial strm.output */\n var end; /* while out < end, enough space available */\n//#ifdef INFLATE_STRICT\n var dmax; /* maximum distance from zlib header */\n//#endif\n var wsize; /* window size or zero if not using window */\n var whave; /* valid bytes in the window */\n var wnext; /* window write index */\n // Use `s_window` instead `window`, avoid conflict with instrumentation tools\n var s_window; /* allocated sliding window, if wsize != 0 */\n var hold; /* local strm.hold */\n var bits; /* local strm.bits */\n var lcode; /* local strm.lencode */\n var dcode; /* local strm.distcode */\n var lmask; /* mask for first level of length codes */\n var dmask; /* mask for first level of distance codes */\n var here; /* retrieved table entry */\n var op; /* code bits, operation, extra bits, or */\n /* window position, window bytes to copy */\n var len; /* match length, unused bytes */\n var dist; /* match distance */\n var from; /* where to copy match from */\n var from_source;\n\n\n var input, output; // JS specific, because we have no pointers\n\n /* copy state to local variables */\n state = strm.state;\n //here = state.here;\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);\n//#ifdef INFLATE_STRICT\n dmax = state.dmax;\n//#endif\n wsize = state.wsize;\n whave = state.whave;\n wnext = state.wnext;\n s_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\n\n /* decode literals and length/distances until end-of-block or not enough\n input data or output space */\n\n top:\n 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:\n for (;;) { // Goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n if (op === 0) { /* 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/*here.val*/;\n }\n else if (op & 16) { /* length base */\n len = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (op) {\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n len += hold & ((1 << op) - 1);\n hold >>>= op;\n bits -= op;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", len));\n if (bits < 15) {\n hold += input[_in++] << bits;\n bits += 8;\n hold += input[_in++] << bits;\n bits += 8;\n }\n here = dcode[hold & dmask];\n\n dodist:\n for (;;) { // goto emulation\n op = here >>> 24/*here.bits*/;\n hold >>>= op;\n bits -= op;\n op = (here >>> 16) & 0xff/*here.op*/;\n\n if (op & 16) { /* distance base */\n dist = here & 0xffff/*here.val*/;\n op &= 15; /* number of extra bits */\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n if (bits < op) {\n hold += input[_in++] << bits;\n bits += 8;\n }\n }\n dist += hold & ((1 << op) - 1);\n//#ifdef INFLATE_STRICT\n if (dist > dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n//#endif\n hold >>>= op;\n bits -= op;\n //Tracevv((stderr, \"inflate: distance %u\\n\", dist));\n op = _out - beg; /* max distance in output */\n if (dist > op) { /* see if copy from window */\n op = dist - op; /* distance back in window */\n if (op > whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break top;\n }\n\n// (!) This block is disabled in zlib defaults,\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 from = 0; // window index\n from_source = s_window;\n if (wnext === 0) { /* very common case */\n from += wsize - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n else if (wnext < op) { /* wrap around window */\n from += wsize + wnext - op;\n op -= wnext;\n if (op < len) { /* some from end of window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = 0;\n if (wnext < len) { /* some from start of window */\n op = wnext;\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\n }\n }\n }\n else { /* contiguous in window */\n from += wnext - op;\n if (op < len) { /* some from window */\n len -= op;\n do {\n output[_out++] = s_window[from++];\n } while (--op);\n from = _out - dist; /* rest from output */\n from_source = output;\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 if (len) {\n output[_out++] = from_source[from++];\n if (len > 1) {\n output[_out++] = from_source[from++];\n }\n }\n }\n else {\n from = _out - dist; /* copy direct from output */\n do { /* 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 if (len) {\n output[_out++] = output[from++];\n if (len > 1) {\n output[_out++] = output[from++];\n }\n }\n }\n }\n else if ((op & 64) === 0) { /* 2nd level distance code */\n here = dcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dodist;\n }\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 }\n else if ((op & 64) === 0) { /* 2nd level length code */\n here = lcode[(here & 0xffff)/*here.val*/ + (hold & ((1 << op) - 1))];\n continue dolen;\n }\n else if (op & 32) { /* end-of-block */\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.mode = TYPE;\n break top;\n }\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\n /* return unused bytes (on entry, bits < 8, so in won't go too far back) */\n len = bits >> 3;\n _in -= len;\n bits -= len << 3;\n hold &= (1 << bits) - 1;\n\n /* update state and return */\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","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\nvar adler32 = require('./adler32');\nvar crc32 = require('./crc32');\nvar inflate_fast = require('./inffast');\nvar inflate_table = require('./inftrees');\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\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;\nvar Z_FINISH = 4;\nvar Z_BLOCK = 5;\nvar Z_TREES = 6;\n\n\n/* Return codes for the compression/decompression functions. Negative values\n * are errors, positive values are used for special but normal events.\n */\nvar Z_OK = 0;\nvar Z_STREAM_END = 1;\nvar Z_NEED_DICT = 2;\n//var Z_ERRNO = -1;\nvar Z_STREAM_ERROR = -2;\nvar Z_DATA_ERROR = -3;\nvar Z_MEM_ERROR = -4;\nvar Z_BUF_ERROR = -5;\n//var Z_VERSION_ERROR = -6;\n\n/* The deflate compression method */\nvar Z_DEFLATED = 8;\n\n\n/* STATES ====================================================================*/\n/* ===========================================================================*/\n\n\nvar HEAD = 1; /* i: waiting for magic header */\nvar FLAGS = 2; /* i: waiting for method and flags (gzip) */\nvar TIME = 3; /* i: waiting for modification time (gzip) */\nvar OS = 4; /* i: waiting for extra flags and operating system (gzip) */\nvar EXLEN = 5; /* i: waiting for extra length (gzip) */\nvar EXTRA = 6; /* i: waiting for extra bytes (gzip) */\nvar NAME = 7; /* i: waiting for end of file name (gzip) */\nvar COMMENT = 8; /* i: waiting for end of comment (gzip) */\nvar HCRC = 9; /* i: waiting for header crc (gzip) */\nvar DICTID = 10; /* i: waiting for dictionary check value */\nvar DICT = 11; /* waiting for inflateSetDictionary() call */\nvar TYPE = 12; /* i: waiting for type bits, including last-flag bit */\nvar TYPEDO = 13; /* i: same, but skip check to exit inflate on new block */\nvar STORED = 14; /* i: waiting for stored size (length and complement) */\nvar COPY_ = 15; /* i/o: same as COPY below, but only first time in */\nvar COPY = 16; /* i/o: waiting for input or output to copy stored block */\nvar TABLE = 17; /* i: waiting for dynamic block table lengths */\nvar LENLENS = 18; /* i: waiting for code length code lengths */\nvar CODELENS = 19; /* i: waiting for length/lit and distance code lengths */\nvar LEN_ = 20; /* i: same as LEN below, but only first time in */\nvar LEN = 21; /* i: waiting for length/lit/eob code */\nvar LENEXT = 22; /* i: waiting for length extra bits */\nvar DIST = 23; /* i: waiting for distance code */\nvar DISTEXT = 24; /* i: waiting for distance extra bits */\nvar MATCH = 25; /* o: waiting for output space to copy string */\nvar LIT = 26; /* o: waiting for output space to write literal */\nvar CHECK = 27; /* i: waiting for 32-bit check value */\nvar LENGTH = 28; /* i: waiting for 32-bit length (gzip) */\nvar DONE = 29; /* finished check, done -- remain here until reset */\nvar BAD = 30; /* got a data error -- remain here until reset */\nvar MEM = 31; /* got an inflate() memory error -- remain here until reset */\nvar SYNC = 32; /* looking for synchronization bytes to restart inflate() */\n\n/* ===========================================================================*/\n\n\n\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar MAX_WBITS = 15;\n/* 32K LZ77 window */\nvar DEF_WBITS = MAX_WBITS;\n\n\nfunction zswap32(q) {\n return (((q >>> 24) & 0xff) +\n ((q >>> 8) & 0xff00) +\n ((q & 0xff00) << 8) +\n ((q & 0xff) << 24));\n}\n\n\nfunction InflateState() {\n this.mode = 0; /* current inflate mode */\n this.last = false; /* true if processing last block */\n this.wrap = 0; /* bit 0 true for zlib, bit 1 true for gzip */\n this.havedict = false; /* true if dictionary provided */\n this.flags = 0; /* gzip header method and flags (0 if zlib) */\n this.dmax = 0; /* zlib header max distance (INFLATE_STRICT) */\n this.check = 0; /* protected copy of check value */\n this.total = 0; /* protected copy of output count */\n // TODO: may be {}\n this.head = null; /* where to save gzip header information */\n\n /* sliding window */\n this.wbits = 0; /* log base 2 of requested window size */\n this.wsize = 0; /* window size or zero if not using window */\n this.whave = 0; /* valid bytes in the window */\n this.wnext = 0; /* window write index */\n this.window = null; /* allocated sliding window, if needed */\n\n /* bit accumulator */\n this.hold = 0; /* input bit accumulator */\n this.bits = 0; /* number of bits in \"in\" */\n\n /* for string and stored block copying */\n this.length = 0; /* literal or length of data to copy */\n this.offset = 0; /* distance back to copy string from */\n\n /* for table and code decoding */\n this.extra = 0; /* extra bits needed */\n\n /* fixed and dynamic code tables */\n this.lencode = null; /* starting table for length/literal codes */\n this.distcode = null; /* starting table for distance codes */\n this.lenbits = 0; /* index bits for lencode */\n this.distbits = 0; /* index bits for distcode */\n\n /* dynamic table building */\n this.ncode = 0; /* number of code length code lengths */\n this.nlen = 0; /* number of length code lengths */\n this.ndist = 0; /* number of distance code lengths */\n this.have = 0; /* number of code lengths in lens[] */\n this.next = null; /* next available space in codes[] */\n\n this.lens = new utils.Buf16(320); /* temporary storage for code lengths */\n this.work = new utils.Buf16(288); /* 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 this.lendyn = null; /* dynamic table for length/literal codes (JS specific) */\n this.distdyn = null; /* dynamic table for distance codes (JS specific) */\n this.sane = 0; /* if false, allow invalid distance too far */\n this.back = 0; /* bits back of last unprocessed length/lit */\n this.was = 0; /* initial length of match */\n}\n\nfunction inflateResetKeep(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n strm.total_in = strm.total_out = state.total = 0;\n strm.msg = ''; /*Z_NULL*/\n if (state.wrap) { /* to support ill-conceived Java test suite */\n strm.adler = state.wrap & 1;\n }\n state.mode = HEAD;\n state.last = 0;\n state.havedict = 0;\n state.dmax = 32768;\n state.head = null/*Z_NULL*/;\n state.hold = 0;\n state.bits = 0;\n //state.lencode = state.distcode = state.next = state.codes;\n state.lencode = state.lendyn = new utils.Buf32(ENOUGH_LENS);\n state.distcode = state.distdyn = new utils.Buf32(ENOUGH_DISTS);\n\n state.sane = 1;\n state.back = -1;\n //Tracev((stderr, \"inflate: reset\\n\"));\n return Z_OK;\n}\n\nfunction inflateReset(strm) {\n var state;\n\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n state.wsize = 0;\n state.whave = 0;\n state.wnext = 0;\n return inflateResetKeep(strm);\n\n}\n\nfunction inflateReset2(strm, windowBits) {\n var wrap;\n var state;\n\n /* get the state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n /* extract wrap request from windowBits parameter */\n if (windowBits < 0) {\n wrap = 0;\n windowBits = -windowBits;\n }\n else {\n wrap = (windowBits >> 4) + 1;\n if (windowBits < 48) {\n windowBits &= 15;\n }\n }\n\n /* set number of window bits, free window if different */\n if (windowBits && (windowBits < 8 || windowBits > 15)) {\n return Z_STREAM_ERROR;\n }\n if (state.window !== null && state.wbits !== windowBits) {\n state.window = null;\n }\n\n /* update state and reset the rest of it */\n state.wrap = wrap;\n state.wbits = windowBits;\n return inflateReset(strm);\n}\n\nfunction inflateInit2(strm, windowBits) {\n var ret;\n var state;\n\n if (!strm) { return Z_STREAM_ERROR; }\n //strm.msg = Z_NULL; /* in case we return an error */\n\n state = new InflateState();\n\n //if (state === Z_NULL) return Z_MEM_ERROR;\n //Tracev((stderr, \"inflate: allocated\\n\"));\n strm.state = state;\n state.window = null/*Z_NULL*/;\n ret = inflateReset2(strm, windowBits);\n if (ret !== Z_OK) {\n strm.state = null/*Z_NULL*/;\n }\n return ret;\n}\n\nfunction inflateInit(strm) {\n return inflateInit2(strm, DEF_WBITS);\n}\n\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 */\nvar virgin = true;\n\nvar lenfix, distfix; // We have no pointers in JS, so keep tables separate\n\nfunction fixedtables(state) {\n /* build fixed huffman tables if first call (may not be thread safe) */\n if (virgin) {\n var sym;\n\n lenfix = new utils.Buf32(512);\n distfix = new utils.Buf32(32);\n\n /* literal/length table */\n sym = 0;\n while (sym < 144) { state.lens[sym++] = 8; }\n while (sym < 256) { state.lens[sym++] = 9; }\n while (sym < 280) { state.lens[sym++] = 7; }\n while (sym < 288) { state.lens[sym++] = 8; }\n\n inflate_table(LENS, state.lens, 0, 288, lenfix, 0, state.work, { bits: 9 });\n\n /* distance table */\n sym = 0;\n while (sym < 32) { state.lens[sym++] = 5; }\n\n inflate_table(DISTS, state.lens, 0, 32, distfix, 0, state.work, { bits: 5 });\n\n /* do this just once */\n virgin = false;\n }\n\n state.lencode = lenfix;\n state.lenbits = 9;\n state.distcode = distfix;\n state.distbits = 5;\n}\n\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 */\nfunction updatewindow(strm, src, end, copy) {\n var dist;\n var state = strm.state;\n\n /* if it hasn't been done already, allocate space for the window */\n if (state.window === null) {\n state.wsize = 1 << state.wbits;\n state.wnext = 0;\n state.whave = 0;\n\n state.window = new utils.Buf8(state.wsize);\n }\n\n /* copy state->wsize or less output bytes into the circular window */\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 }\n else {\n dist = state.wsize - state.wnext;\n if (dist > copy) {\n dist = copy;\n }\n //zmemcpy(state->window + state->wnext, end - copy, dist);\n utils.arraySet(state.window, src, end - copy, dist, state.wnext);\n copy -= dist;\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 }\n else {\n state.wnext += dist;\n if (state.wnext === state.wsize) { state.wnext = 0; }\n if (state.whave < state.wsize) { state.whave += dist; }\n }\n }\n return 0;\n}\n\nfunction inflate(strm, flush) {\n var state;\n var input, output; // input/output buffers\n var next; /* next input INDEX */\n var put; /* next output INDEX */\n var have, left; /* available input and output */\n var hold; /* bit buffer */\n var bits; /* bits in bit buffer */\n var _in, _out; /* save starting available input and output */\n var copy; /* number of stored or match bytes to copy */\n var from; /* where to copy match bytes from */\n var from_source;\n var here = 0; /* current decoding table entry */\n var here_bits, here_op, here_val; // paked \"here\" denormalized (JS specific)\n //var last; /* parent table entry */\n var last_bits, last_op, last_val; // paked \"last\" denormalized (JS specific)\n var len; /* length to copy for repeats, bits to drop */\n var ret; /* return code */\n var hbuf = new utils.Buf8(4); /* buffer for gzip header crc calculation */\n var opts;\n\n var n; // temporary var for NEED_BITS\n\n var order = /* 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\n if (!strm || !strm.state || !strm.output ||\n (!strm.input && strm.avail_in !== 0)) {\n return Z_STREAM_ERROR;\n }\n\n state = strm.state;\n if (state.mode === TYPE) { state.mode = TYPEDO; } /* skip check */\n\n\n //--- LOAD() ---\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\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 }\n //=== NEEDBITS(16);\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((state.wrap & 2) && hold === 0x8b1f) { /* gzip header */\n state.check = 0/*crc32(0L, Z_NULL, 0)*/;\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 //===//\n\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = FLAGS;\n break;\n }\n state.flags = 0; /* expect zlib header */\n if (state.head) {\n state.head.done = false;\n }\n if (!(state.wrap & 1) || /* check if zlib header allowed */\n (((hold & 0xff)/*BITS(8)*/ << 8) + (hold >> 8)) % 31) {\n strm.msg = 'incorrect header check';\n state.mode = BAD;\n break;\n }\n if ((hold & 0x0f)/*BITS(4)*/ !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n len = (hold & 0x0f)/*BITS(4)*/ + 8;\n if (state.wbits === 0) {\n state.wbits = len;\n }\n else if (len > state.wbits) {\n strm.msg = 'invalid window size';\n state.mode = BAD;\n break;\n }\n state.dmax = 1 << len;\n //Tracev((stderr, \"inflate: zlib header ok\\n\"));\n strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = hold & 0x200 ? DICTID : TYPE;\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n break;\n case FLAGS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.flags = hold;\n if ((state.flags & 0xff) !== Z_DEFLATED) {\n strm.msg = 'unknown compression method';\n state.mode = BAD;\n break;\n }\n if (state.flags & 0xe000) {\n strm.msg = 'unknown header flags set';\n state.mode = BAD;\n break;\n }\n if (state.head) {\n state.head.text = ((hold >> 8) & 1);\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 //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = TIME;\n /* falls through */\n case TIME:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.time = hold;\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 //===\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = OS;\n /* falls through */\n case OS:\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (state.head) {\n state.head.xflags = (hold & 0xff);\n state.head.os = (hold >> 8);\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 //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = EXLEN;\n /* falls through */\n case EXLEN:\n if (state.flags & 0x0400) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length = hold;\n if (state.head) {\n state.head.extra_len = hold;\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 //===//\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n }\n else if (state.head) {\n state.head.extra = null/*Z_NULL*/;\n }\n state.mode = EXTRA;\n /* falls through */\n case EXTRA:\n if (state.flags & 0x0400) {\n copy = state.length;\n if (copy > have) { copy = have; }\n if (copy) {\n if (state.head) {\n len = state.head.extra_len - state.length;\n if (!state.head.extra) {\n // Use untyped array for more convenient processing later\n state.head.extra = new Array(state.head.extra_len);\n }\n utils.arraySet(\n state.head.extra,\n input,\n next,\n // 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\n );\n //zmemcpy(state.head.extra + len, next,\n // len + copy > state.head.extra_max ?\n // state.head.extra_max - len : copy);\n }\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n state.length -= copy;\n }\n if (state.length) { break inf_leave; }\n }\n state.length = 0;\n state.mode = NAME;\n /* falls through */\n case NAME:\n if (state.flags & 0x0800) {\n if (have === 0) { break inf_leave; }\n copy = 0;\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 if (state.head && len &&\n (state.length < 65536 /*state.head.name_max*/)) {\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 have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.name = null;\n }\n state.length = 0;\n state.mode = COMMENT;\n /* falls through */\n case COMMENT:\n if (state.flags & 0x1000) {\n if (have === 0) { break inf_leave; }\n copy = 0;\n do {\n len = input[next + copy++];\n /* use constant limit because in js we should not preallocate memory */\n if (state.head && len &&\n (state.length < 65536 /*state.head.comm_max*/)) {\n state.head.comment += String.fromCharCode(len);\n }\n } while (len && copy < have);\n if (state.flags & 0x0200) {\n state.check = crc32(state.check, input, copy, next);\n }\n have -= copy;\n next += copy;\n if (len) { break inf_leave; }\n }\n else if (state.head) {\n state.head.comment = null;\n }\n state.mode = HCRC;\n /* falls through */\n case HCRC:\n if (state.flags & 0x0200) {\n //=== NEEDBITS(16); */\n while (bits < 16) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.check & 0xffff)) {\n strm.msg = 'header crc mismatch';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\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 strm.adler = state.check = 0;\n state.mode = TYPE;\n break;\n case DICTID:\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n strm.adler = state.check = zswap32(hold);\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = DICT;\n /* falls through */\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 strm.adler = state.check = 1/*adler32(0L, Z_NULL, 0)*/;\n state.mode = TYPE;\n /* falls through */\n case TYPE:\n if (flush === Z_BLOCK || flush === Z_TREES) { break inf_leave; }\n /* falls through */\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 }\n //=== NEEDBITS(3); */\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.last = (hold & 0x01)/*BITS(1)*/;\n //--- DROPBITS(1) ---//\n hold >>>= 1;\n bits -= 1;\n //---//\n\n switch ((hold & 0x03)/*BITS(2)*/) {\n case 0: /* stored block */\n //Tracev((stderr, \"inflate: stored block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = STORED;\n break;\n case 1: /* fixed block */\n fixedtables(state);\n //Tracev((stderr, \"inflate: fixed codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = LEN_; /* decode codes */\n if (flush === Z_TREES) {\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break inf_leave;\n }\n break;\n case 2: /* dynamic block */\n //Tracev((stderr, \"inflate: dynamic codes block%s\\n\",\n // state.last ? \" (last)\" : \"\"));\n state.mode = TABLE;\n break;\n case 3:\n strm.msg = 'invalid block type';\n state.mode = BAD;\n }\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n break;\n case STORED:\n //--- BYTEBITS() ---// /* go to byte boundary */\n hold >>>= bits & 7;\n bits -= bits & 7;\n //---//\n //=== NEEDBITS(32); */\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if ((hold & 0xffff) !== ((hold >>> 16) ^ 0xffff)) {\n strm.msg = 'invalid stored block lengths';\n state.mode = BAD;\n break;\n }\n state.length = hold & 0xffff;\n //Tracev((stderr, \"inflate: stored length %u\\n\",\n // state.length));\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n state.mode = COPY_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case COPY_:\n state.mode = COPY;\n /* falls through */\n case COPY:\n copy = state.length;\n if (copy) {\n if (copy > have) { copy = have; }\n if (copy > left) { copy = left; }\n if (copy === 0) { break inf_leave; }\n //--- zmemcpy(put, next, copy); ---\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 }\n //Tracev((stderr, \"inflate: stored end\\n\"));\n state.mode = TYPE;\n break;\n case TABLE:\n //=== NEEDBITS(14); */\n while (bits < 14) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.nlen = (hold & 0x1f)/*BITS(5)*/ + 257;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ndist = (hold & 0x1f)/*BITS(5)*/ + 1;\n //--- DROPBITS(5) ---//\n hold >>>= 5;\n bits -= 5;\n //---//\n state.ncode = (hold & 0x0f)/*BITS(4)*/ + 4;\n //--- DROPBITS(4) ---//\n hold >>>= 4;\n bits -= 4;\n //---//\n//#ifndef PKZIP_BUG_WORKAROUND\n if (state.nlen > 286 || state.ndist > 30) {\n strm.msg = 'too many length or distance symbols';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracev((stderr, \"inflate: table sizes ok\\n\"));\n state.have = 0;\n state.mode = LENLENS;\n /* falls through */\n case LENLENS:\n while (state.have < state.ncode) {\n //=== NEEDBITS(3);\n while (bits < 3) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.lens[order[state.have++]] = (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n while (state.have < 19) {\n state.lens[order[state.have++]] = 0;\n }\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 state.lencode = state.lendyn;\n state.lenbits = 7;\n\n opts = { bits: state.lenbits };\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 }\n //Tracev((stderr, \"inflate: code lengths ok\\n\"));\n state.have = 0;\n state.mode = CODELENS;\n /* falls through */\n case CODELENS:\n while (state.have < state.nlen + state.ndist) {\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)];/*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\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 }\n else {\n if (here_val === 16) {\n //=== NEEDBITS(here.bits + 2);\n n = here_bits + 2;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\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 len = state.lens[state.have - 1];\n copy = 3 + (hold & 0x03);//BITS(2);\n //--- DROPBITS(2) ---//\n hold >>>= 2;\n bits -= 2;\n //---//\n }\n else if (here_val === 17) {\n //=== NEEDBITS(here.bits + 3);\n n = here_bits + 3;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 3 + (hold & 0x07);//BITS(3);\n //--- DROPBITS(3) ---//\n hold >>>= 3;\n bits -= 3;\n //---//\n }\n else {\n //=== NEEDBITS(here.bits + 7);\n n = here_bits + 7;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n len = 0;\n copy = 11 + (hold & 0x7f);//BITS(7);\n //--- DROPBITS(7) ---//\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 while (copy--) {\n state.lens[state.have++] = len;\n }\n }\n }\n\n /* handle error breaks in while */\n if (state.mode === BAD) { break; }\n\n /* check for end-of-block code (better have one) */\n if (state.lens[256] === 0) {\n strm.msg = 'invalid code -- missing end-of-block';\n state.mode = BAD;\n break;\n }\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 state.lenbits = 9;\n\n opts = { bits: state.lenbits };\n ret = inflate_table(LENS, state.lens, 0, state.nlen, state.lencode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.lenbits = opts.bits;\n // 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;\n //state.distcode.copy(state.codes);\n // Switch to use dynamic table\n state.distcode = state.distdyn;\n opts = { bits: state.distbits };\n ret = inflate_table(DISTS, state.lens, state.nlen, state.ndist, state.distcode, 0, state.work, opts);\n // We have separate tables & no pointers. 2 commented lines below not needed.\n // state.next_index = opts.table_index;\n state.distbits = opts.bits;\n // state.distcode = state.next;\n\n if (ret) {\n strm.msg = 'invalid distances set';\n state.mode = BAD;\n break;\n }\n //Tracev((stderr, 'inflate: codes ok\\n'));\n state.mode = LEN_;\n if (flush === Z_TREES) { break inf_leave; }\n /* falls through */\n case LEN_:\n state.mode = LEN;\n /* falls through */\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);\n //--- LOAD() ---\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\n if (state.mode === TYPE) {\n state.back = -1;\n }\n break;\n }\n state.back = 0;\n for (;;) {\n here = state.lencode[hold & ((1 << state.lenbits) - 1)]; /*BITS(state.lenbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if (here_bits <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\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 for (;;) {\n here = state.lencode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> 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) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n state.length = here_val;\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 if (here_op & 32) {\n //Tracevv((stderr, \"inflate: end of block\\n\"));\n state.back = -1;\n state.mode = TYPE;\n break;\n }\n if (here_op & 64) {\n strm.msg = 'invalid literal/length code';\n state.mode = BAD;\n break;\n }\n state.extra = here_op & 15;\n state.mode = LENEXT;\n /* falls through */\n case LENEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.length += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n //Tracevv((stderr, \"inflate: length %u\\n\", state.length));\n state.was = state.length;\n state.mode = DIST;\n /* falls through */\n case DIST:\n for (;;) {\n here = state.distcode[hold & ((1 << state.distbits) - 1)];/*BITS(state.distbits)*/\n here_bits = here >>> 24;\n here_op = (here >>> 16) & 0xff;\n here_val = here & 0xffff;\n\n if ((here_bits) <= bits) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\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 for (;;) {\n here = state.distcode[last_val +\n ((hold & ((1 << (last_bits + last_op)) - 1))/*BITS(last.bits + last.op)*/ >> 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) { break; }\n //--- PULLBYTE() ---//\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n //---//\n }\n //--- DROPBITS(last.bits) ---//\n hold >>>= last_bits;\n bits -= last_bits;\n //---//\n state.back += last_bits;\n }\n //--- DROPBITS(here.bits) ---//\n hold >>>= here_bits;\n bits -= here_bits;\n //---//\n state.back += here_bits;\n if (here_op & 64) {\n strm.msg = 'invalid distance code';\n state.mode = BAD;\n break;\n }\n state.offset = here_val;\n state.extra = (here_op) & 15;\n state.mode = DISTEXT;\n /* falls through */\n case DISTEXT:\n if (state.extra) {\n //=== NEEDBITS(state.extra);\n n = state.extra;\n while (bits < n) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n state.offset += hold & ((1 << state.extra) - 1)/*BITS(state.extra)*/;\n //--- DROPBITS(state.extra) ---//\n hold >>>= state.extra;\n bits -= state.extra;\n //---//\n state.back += state.extra;\n }\n//#ifdef INFLATE_STRICT\n if (state.offset > state.dmax) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n//#endif\n //Tracevv((stderr, \"inflate: distance %u\\n\", state.offset));\n state.mode = MATCH;\n /* falls through */\n case MATCH:\n if (left === 0) { break inf_leave; }\n copy = _out - left;\n if (state.offset > copy) { /* copy from window */\n copy = state.offset - copy;\n if (copy > state.whave) {\n if (state.sane) {\n strm.msg = 'invalid distance too far back';\n state.mode = BAD;\n break;\n }\n// (!) This block is disabled in zlib defaults,\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 if (copy > state.wnext) {\n copy -= state.wnext;\n from = state.wsize - copy;\n }\n else {\n from = state.wnext - copy;\n }\n if (copy > state.length) { copy = state.length; }\n from_source = state.window;\n }\n else { /* copy from output */\n from_source = output;\n from = put - state.offset;\n copy = state.length;\n }\n if (copy > left) { copy = left; }\n left -= copy;\n state.length -= copy;\n do {\n output[put++] = from_source[from++];\n } while (--copy);\n if (state.length === 0) { state.mode = LEN; }\n break;\n case LIT:\n if (left === 0) { break inf_leave; }\n output[put++] = state.length;\n left--;\n state.mode = LEN;\n break;\n case CHECK:\n if (state.wrap) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n // Use '|' instead of '+' to make sure that result is signed\n hold |= input[next++] << bits;\n bits += 8;\n }\n //===//\n _out -= left;\n strm.total_out += _out;\n state.total += _out;\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;\n // NB: crc32 stored as signed 32-bit int, zswap32 returns signed too\n if ((state.flags ? hold : zswap32(hold)) !== state.check) {\n strm.msg = 'incorrect data check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: check matches trailer\\n\"));\n }\n state.mode = LENGTH;\n /* falls through */\n case LENGTH:\n if (state.wrap && state.flags) {\n //=== NEEDBITS(32);\n while (bits < 32) {\n if (have === 0) { break inf_leave; }\n have--;\n hold += input[next++] << bits;\n bits += 8;\n }\n //===//\n if (hold !== (state.total & 0xffffffff)) {\n strm.msg = 'incorrect length check';\n state.mode = BAD;\n break;\n }\n //=== INITBITS();\n hold = 0;\n bits = 0;\n //===//\n //Tracev((stderr, \"inflate: length matches trailer\\n\"));\n }\n state.mode = DONE;\n /* falls through */\n case DONE:\n ret = Z_STREAM_END;\n break inf_leave;\n case BAD:\n ret = Z_DATA_ERROR;\n break inf_leave;\n case MEM:\n return Z_MEM_ERROR;\n case SYNC:\n /* falls through */\n default:\n return Z_STREAM_ERROR;\n }\n }\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\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\n if (state.wsize || (_out !== strm.avail_out && state.mode < BAD &&\n (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 _in -= strm.avail_in;\n _out -= strm.avail_out;\n strm.total_in += _in;\n strm.total_out += _out;\n state.total += _out;\n if (state.wrap && _out) {\n strm.adler = state.check = /*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 strm.data_type = state.bits + (state.last ? 64 : 0) +\n (state.mode === TYPE ? 128 : 0) +\n (state.mode === LEN_ || state.mode === COPY_ ? 256 : 0);\n if (((_in === 0 && _out === 0) || flush === Z_FINISH) && ret === Z_OK) {\n ret = Z_BUF_ERROR;\n }\n return ret;\n}\n\nfunction inflateEnd(strm) {\n\n if (!strm || !strm.state /*|| strm->zfree == (free_func)0*/) {\n return Z_STREAM_ERROR;\n }\n\n var state = strm.state;\n if (state.window) {\n state.window = null;\n }\n strm.state = null;\n return Z_OK;\n}\n\nfunction inflateGetHeader(strm, head) {\n var state;\n\n /* check state */\n if (!strm || !strm.state) { return Z_STREAM_ERROR; }\n state = strm.state;\n if ((state.wrap & 2) === 0) { return Z_STREAM_ERROR; }\n\n /* save header structure */\n state.head = head;\n head.done = false;\n return Z_OK;\n}\n\nfunction inflateSetDictionary(strm, dictionary) {\n var dictLength = dictionary.length;\n\n var state;\n var dictid;\n var ret;\n\n /* check state */\n if (!strm /* == Z_NULL */ || !strm.state /* == Z_NULL */) { return Z_STREAM_ERROR; }\n state = strm.state;\n\n if (state.wrap !== 0 && state.mode !== DICT) {\n return Z_STREAM_ERROR;\n }\n\n /* check for correct dictionary identifier */\n if (state.mode === DICT) {\n dictid = 1; /* adler32(0, null, 0)*/\n /* dictid = adler32(dictid, dictionary, dictLength); */\n dictid = adler32(dictid, dictionary, dictLength, 0);\n if (dictid !== state.check) {\n return Z_DATA_ERROR;\n }\n }\n /* copy dictionary to window using updatewindow(), which will amend the\n existing dictionary if appropriate */\n ret = updatewindow(strm, dictionary, dictLength, dictLength);\n if (ret) {\n state.mode = MEM;\n return Z_MEM_ERROR;\n }\n state.havedict = 1;\n // Tracev((stderr, \"inflate: dictionary set\\n\"));\n return Z_OK;\n}\n\nexports.inflateReset = inflateReset;\nexports.inflateReset2 = inflateReset2;\nexports.inflateResetKeep = inflateResetKeep;\nexports.inflateInit = inflateInit;\nexports.inflateInit2 = inflateInit2;\nexports.inflate = inflate;\nexports.inflateEnd = inflateEnd;\nexports.inflateGetHeader = inflateGetHeader;\nexports.inflateSetDictionary = inflateSetDictionary;\nexports.inflateInfo = 'pako inflate (from Nodeca project)';\n\n/* Not implemented\nexports.inflateCopy = inflateCopy;\nexports.inflateGetDictionary = inflateGetDictionary;\nexports.inflateMark = inflateMark;\nexports.inflatePrime = inflatePrime;\nexports.inflateSync = inflateSync;\nexports.inflateSyncPoint = inflateSyncPoint;\nexports.inflateUndermine = inflateUndermine;\n*/\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nvar utils = require('../utils/common');\n\nvar MAXBITS = 15;\nvar ENOUGH_LENS = 852;\nvar ENOUGH_DISTS = 592;\n//var ENOUGH = (ENOUGH_LENS+ENOUGH_DISTS);\n\nvar CODES = 0;\nvar LENS = 1;\nvar DISTS = 2;\n\nvar lbase = [ /* Length codes 257..285 base */\n 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 15, 17, 19, 23, 27, 31,\n 35, 43, 51, 59, 67, 83, 99, 115, 131, 163, 195, 227, 258, 0, 0\n];\n\nvar lext = [ /* Length codes 257..285 extra */\n 16, 16, 16, 16, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 18, 18,\n 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 16, 72, 78\n];\n\nvar dbase = [ /* Distance codes 0..29 base */\n 1, 2, 3, 4, 5, 7, 9, 13, 17, 25, 33, 49, 65, 97, 129, 193,\n 257, 385, 513, 769, 1025, 1537, 2049, 3073, 4097, 6145,\n 8193, 12289, 16385, 24577, 0, 0\n];\n\nvar dext = [ /* Distance codes 0..29 extra */\n 16, 16, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22,\n 23, 23, 24, 24, 25, 25, 26, 26, 27, 27,\n 28, 28, 29, 29, 64, 64\n];\n\nmodule.exports = function inflate_table(type, lens, lens_index, codes, table, table_index, work, opts)\n{\n var bits = opts.bits;\n //here = opts.here; /* table entry for duplication */\n\n var len = 0; /* a code's length in bits */\n var sym = 0; /* index of code symbols */\n var min = 0, max = 0; /* minimum and maximum code lengths */\n var root = 0; /* number of index bits for root table */\n var curr = 0; /* number of index bits for current table */\n var drop = 0; /* code bits to drop for sub-table */\n var left = 0; /* number of prefix codes available */\n var used = 0; /* code entries in table used */\n var huff = 0; /* Huffman code */\n var incr; /* for incrementing code, index */\n var fill; /* index for replicating entries */\n var low; /* low bits for current root entry */\n var mask; /* mask for low root bits */\n var next; /* next available space in table */\n var base = null; /* base value table to use */\n var base_index = 0;\n// var shoextra; /* extra bits table to use */\n var end; /* use base and extra for symbol > end */\n var count = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* number of codes of each length */\n var offs = new utils.Buf16(MAXBITS + 1); //[MAXBITS+1]; /* offsets in table for each length */\n var extra = null;\n var extra_index = 0;\n\n var here_bits, here_op, here_val;\n\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\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\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\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 for (len = 0; len <= MAXBITS; len++) {\n count[len] = 0;\n }\n for (sym = 0; sym < codes; sym++) {\n count[lens[lens_index + sym]]++;\n }\n\n /* bound code lengths, force root to be within code lengths */\n root = bits;\n for (max = MAXBITS; max >= 1; max--) {\n if (count[max] !== 0) { break; }\n }\n if (root > max) {\n root = max;\n }\n if (max === 0) { /* 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;\n\n\n //table.op[opts.table_index] = 64;\n //table.bits[opts.table_index] = 1;\n //table.val[opts.table_index++] = 0;\n table[table_index++] = (1 << 24) | (64 << 16) | 0;\n\n opts.bits = 1;\n return 0; /* no symbols, but wait for decoding to report error */\n }\n for (min = 1; min < max; min++) {\n if (count[min] !== 0) { break; }\n }\n if (root < min) {\n root = min;\n }\n\n /* check for an over-subscribed or incomplete set of lengths */\n left = 1;\n for (len = 1; len <= MAXBITS; len++) {\n left <<= 1;\n left -= count[len];\n if (left < 0) {\n return -1;\n } /* over-subscribed */\n }\n if (left > 0 && (type === CODES || max !== 1)) {\n return -1; /* incomplete set */\n }\n\n /* generate offsets into symbol table for each length for sorting */\n offs[1] = 0;\n for (len = 1; len < MAXBITS; len++) {\n offs[len + 1] = offs[len] + count[len];\n }\n\n /* sort symbols by length, by symbol order within each length */\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 /*\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\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\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\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\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 if (type === CODES) {\n base = extra = work; /* dummy value--not used */\n end = 19;\n\n } else if (type === LENS) {\n base = lbase;\n base_index -= 257;\n extra = lext;\n extra_index -= 257;\n end = 256;\n\n } else { /* DISTS */\n base = dbase;\n extra = dext;\n end = -1;\n }\n\n /* initialize opts for loop */\n huff = 0; /* starting code */\n sym = 0; /* starting code symbol */\n len = min; /* starting code length */\n next = table_index; /* current table to fill in */\n curr = root; /* current table index bits */\n drop = 0; /* current bits to drop from code for index */\n low = -1; /* trigger new sub-table when len > root */\n used = 1 << root; /* use root table entries */\n mask = used - 1; /* mask for comparing low */\n\n /* check available table space */\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* process all codes and make table entries */\n for (;;) {\n /* create table entry */\n here_bits = len - drop;\n if (work[sym] < end) {\n here_op = 0;\n here_val = work[sym];\n }\n else if (work[sym] > end) {\n here_op = extra[extra_index + work[sym]];\n here_val = base[base_index + work[sym]];\n }\n else {\n here_op = 32 + 64; /* end of block */\n here_val = 0;\n }\n\n /* replicate for those indices with low len bits equal to huff */\n incr = 1 << (len - drop);\n fill = 1 << curr;\n min = fill; /* save offset to next table */\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\n /* backwards increment the len-bit code huff */\n incr = 1 << (len - 1);\n while (huff & incr) {\n incr >>= 1;\n }\n if (incr !== 0) {\n huff &= incr - 1;\n huff += incr;\n } else {\n huff = 0;\n }\n\n /* go to next symbol, update count, len */\n sym++;\n if (--count[len] === 0) {\n if (len === max) { break; }\n len = lens[lens_index + work[sym]];\n }\n\n /* create new sub-table if needed */\n if (len > root && (huff & mask) !== low) {\n /* if first time, transition to sub-tables */\n if (drop === 0) {\n drop = root;\n }\n\n /* increment past last table */\n next += min; /* here min is 1 << curr */\n\n /* determine length of next table */\n curr = len - drop;\n left = 1 << curr;\n while (curr + drop < max) {\n left -= count[curr + drop];\n if (left <= 0) { break; }\n curr++;\n left <<= 1;\n }\n\n /* check for enough space */\n used += 1 << curr;\n if ((type === LENS && used > ENOUGH_LENS) ||\n (type === DISTS && used > ENOUGH_DISTS)) {\n return 1;\n }\n\n /* point entry in root table to sub-table */\n low = huff & mask;\n /*table.op[low] = curr;\n table.bits[low] = root;\n table.val[low] = next - opts.table_index;*/\n table[low] = (root << 24) | (curr << 16) | (next - table_index) |0;\n }\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 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\n /* set return parameters */\n //opts.table_index += used;\n opts.bits = root;\n return 0;\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nmodule.exports = {\n 2: 'need dictionary', /* Z_NEED_DICT 2 */\n 1: 'stream end', /* Z_STREAM_END 1 */\n 0: '', /* Z_OK 0 */\n '-1': 'file error', /* Z_ERRNO (-1) */\n '-2': 'stream error', /* Z_STREAM_ERROR (-2) */\n '-3': 'data error', /* Z_DATA_ERROR (-3) */\n '-4': 'insufficient memory', /* Z_MEM_ERROR (-4) */\n '-5': 'buffer error', /* Z_BUF_ERROR (-5) */\n '-6': 'incompatible version' /* Z_VERSION_ERROR (-6) */\n};\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\n/* eslint-disable space-unary-ops */\n\nvar utils = require('../utils/common');\n\n/* Public constants ==========================================================*/\n/* ===========================================================================*/\n\n\n//var Z_FILTERED = 1;\n//var Z_HUFFMAN_ONLY = 2;\n//var Z_RLE = 3;\nvar Z_FIXED = 4;\n//var Z_DEFAULT_STRATEGY = 0;\n\n/* Possible values of the data_type field (though see inflate()) */\nvar Z_BINARY = 0;\nvar Z_TEXT = 1;\n//var Z_ASCII = 1; // = Z_TEXT\nvar Z_UNKNOWN = 2;\n\n/*============================================================================*/\n\n\nfunction zero(buf) { var len = buf.length; while (--len >= 0) { buf[len] = 0; } }\n\n// From zutil.h\n\nvar STORED_BLOCK = 0;\nvar STATIC_TREES = 1;\nvar DYN_TREES = 2;\n/* The three kinds of block type */\n\nvar MIN_MATCH = 3;\nvar MAX_MATCH = 258;\n/* The minimum and maximum match lengths */\n\n// From deflate.h\n/* ===========================================================================\n * Internal compression state.\n */\n\nvar LENGTH_CODES = 29;\n/* number of length codes, not counting the special END_BLOCK code */\n\nvar LITERALS = 256;\n/* number of literal bytes 0..255 */\n\nvar L_CODES = LITERALS + 1 + LENGTH_CODES;\n/* number of Literal or Length codes, including the END_BLOCK code */\n\nvar D_CODES = 30;\n/* number of distance codes */\n\nvar BL_CODES = 19;\n/* number of codes used to transfer the bit lengths */\n\nvar HEAP_SIZE = 2 * L_CODES + 1;\n/* maximum heap size */\n\nvar MAX_BITS = 15;\n/* All codes must not exceed MAX_BITS bits */\n\nvar Buf_size = 16;\n/* size of bit buffer in bi_buf */\n\n\n/* ===========================================================================\n * Constants\n */\n\nvar MAX_BL_BITS = 7;\n/* Bit length codes must not exceed MAX_BL_BITS bits */\n\nvar END_BLOCK = 256;\n/* end of block literal code */\n\nvar REP_3_6 = 16;\n/* repeat previous bit length 3-6 times (2 bits of repeat count) */\n\nvar REPZ_3_10 = 17;\n/* repeat a zero length 3-10 times (3 bits of repeat count) */\n\nvar REPZ_11_138 = 18;\n/* repeat a zero length 11-138 times (7 bits of repeat count) */\n\n/* eslint-disable comma-spacing,array-bracket-spacing */\nvar extra_lbits = /* 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\nvar extra_dbits = /* 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\nvar extra_blbits = /* 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\nvar bl_order =\n [16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15];\n/* eslint-enable comma-spacing,array-bracket-spacing */\n\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\n// We pre-fill arrays with 0 to avoid uninitialized gaps\n\nvar DIST_CODE_LEN = 512; /* see definition of array dist_code below */\n\n// !!!! Use flat array instead of structure, Freq = i*2, Len = i*2+1\nvar static_ltree = new Array((L_CODES + 2) * 2);\nzero(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\nvar static_dtree = new Array(D_CODES * 2);\nzero(static_dtree);\n/* The static distance tree. (Actually a trivial tree since all codes use\n * 5 bits.)\n */\n\nvar _dist_code = new Array(DIST_CODE_LEN);\nzero(_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\nvar _length_code = new Array(MAX_MATCH - MIN_MATCH + 1);\nzero(_length_code);\n/* length code for each normalized match length (0 == MIN_MATCH) */\n\nvar base_length = new Array(LENGTH_CODES);\nzero(base_length);\n/* First normalized length for each code (0 = MIN_MATCH) */\n\nvar base_dist = new Array(D_CODES);\nzero(base_dist);\n/* First normalized distance for each code (0 = distance of 1) */\n\n\nfunction StaticTreeDesc(static_tree, extra_bits, extra_base, elems, max_length) {\n\n this.static_tree = static_tree; /* static tree or NULL */\n this.extra_bits = extra_bits; /* extra bits for each code or NULL */\n this.extra_base = extra_base; /* base index for extra_bits */\n this.elems = elems; /* max number of elements in the tree */\n this.max_length = max_length; /* max bit length for the codes */\n\n // show if `static_tree` has data or dummy - needed for monomorphic objects\n this.has_stree = static_tree && static_tree.length;\n}\n\n\nvar static_l_desc;\nvar static_d_desc;\nvar static_bl_desc;\n\n\nfunction TreeDesc(dyn_tree, stat_desc) {\n this.dyn_tree = dyn_tree; /* the dynamic tree */\n this.max_code = 0; /* largest code with non zero frequency */\n this.stat_desc = stat_desc; /* the corresponding static tree */\n}\n\n\n\nfunction d_code(dist) {\n return dist < 256 ? _dist_code[dist] : _dist_code[256 + (dist >>> 7)];\n}\n\n\n/* ===========================================================================\n * Output a short LSB first on the stream.\n * IN assertion: there is enough room in pendingBuf.\n */\nfunction 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\n/* ===========================================================================\n * Send a value on a given number of bits.\n * IN assertion: length <= 16 and value fits in length bits.\n */\nfunction 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\nfunction send_code(s, c, tree) {\n send_bits(s, tree[c * 2]/*.Code*/, tree[c * 2 + 1]/*.Len*/);\n}\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 */\nfunction bi_reverse(code, len) {\n var res = 0;\n do {\n res |= code & 1;\n code >>>= 1;\n res <<= 1;\n } while (--len > 0);\n return res >>> 1;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer, keeping at most 7 bits in it.\n */\nfunction 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\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\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 */\nfunction gen_bitlen(s, desc)\n// 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; /* heap index */\n var n, m; /* iterate over the tree elements */\n var bits; /* bit length */\n var xbits; /* extra bits */\n var f; /* frequency */\n var overflow = 0; /* 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\n /* In a first pass, compute the optimal bit lengths (which may\n * overflow in the case of the bit length tree).\n */\n tree[s.heap[s.heap_max] * 2 + 1]/*.Len*/ = 0; /* 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]/*.Dad*/ * 2 + 1]/*.Len*/ + 1;\n if (bits > max_length) {\n bits = max_length;\n overflow++;\n }\n tree[n * 2 + 1]/*.Len*/ = bits;\n /* We overwrite tree[n].Dad which is no longer needed */\n\n if (n > max_code) { continue; } /* not a leaf node */\n\n s.bl_count[bits]++;\n xbits = 0;\n if (n >= base) {\n xbits = extra[n - base];\n }\n f = tree[n * 2]/*.Freq*/;\n s.opt_len += f * (bits + xbits);\n if (has_stree) {\n s.static_len += f * (stree[n * 2 + 1]/*.Len*/ + xbits);\n }\n }\n if (overflow === 0) { return; }\n\n // Trace((stderr,\"\\nbit length overflow\\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 do {\n bits = max_length - 1;\n while (s.bl_count[bits] === 0) { bits--; }\n s.bl_count[bits]--; /* move one leaf down the tree */\n s.bl_count[bits + 1] += 2; /* move one overflow item as its brother */\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 overflow -= 2;\n } while (overflow > 0);\n\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 for (bits = max_length; bits !== 0; bits--) {\n n = s.bl_count[bits];\n while (n !== 0) {\n m = s.heap[--h];\n if (m > max_code) { continue; }\n if (tree[m * 2 + 1]/*.Len*/ !== bits) {\n // Trace((stderr,\"code %d bits %d->%d\\n\", m, tree[m].Len, bits));\n s.opt_len += (bits - tree[m * 2 + 1]/*.Len*/) * tree[m * 2]/*.Freq*/;\n tree[m * 2 + 1]/*.Len*/ = bits;\n }\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 */\nfunction gen_codes(tree, max_code, bl_count)\n// 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); /* next code value for each bit length */\n var code = 0; /* running code value */\n var bits; /* bit index */\n var n; /* code index */\n\n /* The distribution counts are first used to generate the code values\n * without bit reversal.\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 length = 0;\n for (code = 0; code < LENGTH_CODES - 1; code++) {\n base_length[code] = length;\n for (n = 0; n < (1 << extra_lbits[code]); n++) {\n _length_code[length++] = code;\n }\n }\n //Assert (length == 256, \"tr_static_init: length != 256\");\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 _length_code[length - 1] = code;\n\n /* Initialize the mapping dist (0..32K) -> dist code (0..29) */\n dist = 0;\n for (code = 0; code < 16; code++) {\n base_dist[code] = dist;\n for (n = 0; n < (1 << extra_dbits[code]); n++) {\n _dist_code[dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: dist != 256\");\n dist >>= 7; /* from now on, all distances are divided by 128 */\n for (; code < D_CODES; code++) {\n base_dist[code] = dist << 7;\n for (n = 0; n < (1 << (extra_dbits[code] - 7)); n++) {\n _dist_code[256 + dist++] = code;\n }\n }\n //Assert (dist == 256, \"tr_static_init: 256+dist != 512\");\n\n /* Construct the codes of the static literal tree */\n for (bits = 0; bits <= MAX_BITS; bits++) {\n bl_count[bits] = 0;\n }\n\n n = 0;\n while (n <= 143) {\n static_ltree[n * 2 + 1]/*.Len*/ = 8;\n n++;\n bl_count[8]++;\n }\n while (n <= 255) {\n static_ltree[n * 2 + 1]/*.Len*/ = 9;\n n++;\n bl_count[9]++;\n }\n while (n <= 279) {\n static_ltree[n * 2 + 1]/*.Len*/ = 7;\n n++;\n bl_count[7]++;\n }\n while (n <= 287) {\n static_ltree[n * 2 + 1]/*.Len*/ = 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 gen_codes(static_ltree, L_CODES + 1, bl_count);\n\n /* The static distance tree is trivial: */\n for (n = 0; n < D_CODES; n++) {\n static_dtree[n * 2 + 1]/*.Len*/ = 5;\n static_dtree[n * 2]/*.Code*/ = bi_reverse(n, 5);\n }\n\n // Now data ready and we can init static trees\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);\n\n //static_init_done = true;\n}\n\n\n/* ===========================================================================\n * Initialize a new block.\n */\nfunction init_block(s) {\n var n; /* iterates over tree elements */\n\n /* Initialize the trees. */\n for (n = 0; n < L_CODES; n++) { s.dyn_ltree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < D_CODES; n++) { s.dyn_dtree[n * 2]/*.Freq*/ = 0; }\n for (n = 0; n < BL_CODES; n++) { s.bl_tree[n * 2]/*.Freq*/ = 0; }\n\n s.dyn_ltree[END_BLOCK * 2]/*.Freq*/ = 1;\n s.opt_len = s.static_len = 0;\n s.last_lit = s.matches = 0;\n}\n\n\n/* ===========================================================================\n * Flush the bit buffer and align the output on a byte boundary\n */\nfunction bi_windup(s)\n{\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 s.bi_buf = 0;\n s.bi_valid = 0;\n}\n\n/* ===========================================================================\n * Copy a stored block, storing first the length and its\n * one's complement if requested.\n */\nfunction copy_block(s, buf, len, header)\n//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); /* align on byte boundary */\n\n if (header) {\n put_short(s, len);\n put_short(s, ~len);\n }\n// while (len--) {\n// put_byte(s, *buf++);\n// }\n utils.arraySet(s.pending_buf, s.window, buf, len, s.pending);\n s.pending += len;\n}\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 */\nfunction smaller(tree, n, m, depth) {\n var _n2 = n * 2;\n var _m2 = m * 2;\n return (tree[_n2]/*.Freq*/ < tree[_m2]/*.Freq*/ ||\n (tree[_n2]/*.Freq*/ === tree[_m2]/*.Freq*/ && depth[n] <= depth[m]));\n}\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 */\nfunction pqdownheap(s, tree, k)\n// 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; /* left son of k */\n while (j <= s.heap_len) {\n /* Set j to the smallest of the two sons: */\n if (j < s.heap_len &&\n smaller(tree, s.heap[j + 1], s.heap[j], s.depth)) {\n j++;\n }\n /* Exit if v is smaller than both sons */\n if (smaller(tree, v, s.heap[j], s.depth)) { break; }\n\n /* Exchange v with the smallest son */\n s.heap[k] = s.heap[j];\n k = j;\n\n /* And continue down the tree, setting j to the left son of k */\n j <<= 1;\n }\n s.heap[k] = v;\n}\n\n\n// inlined manually\n// var SMALLEST = 1;\n\n/* ===========================================================================\n * Send the block data compressed using the given Huffman trees\n */\nfunction compress_block(s, ltree, dtree)\n// deflate_state *s;\n// const ct_data *ltree; /* literal tree */\n// const ct_data *dtree; /* distance tree */\n{\n var dist; /* distance of matched string */\n var lc; /* match length or unmatched char (if dist == 0) */\n var lx = 0; /* running index in l_buf */\n var code; /* the code to send */\n var extra; /* 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); /* 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); /* send the length code */\n extra = extra_lbits[code];\n if (extra !== 0) {\n lc -= base_length[code];\n send_bits(s, lc, extra); /* send the extra length bits */\n }\n dist--; /* dist is now the match distance - 1 */\n code = d_code(dist);\n //Assert (code < D_CODES, \"bad d_code\");\n\n send_code(s, code, dtree); /* send the distance code */\n extra = extra_dbits[code];\n if (extra !== 0) {\n dist -= base_dist[code];\n send_bits(s, dist, extra); /* send the extra distance bits */\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\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 */\nfunction build_tree(s, desc)\n// 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; /* iterate over heap elements */\n var max_code = -1; /* largest code with non zero frequency */\n var node; /* 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 s.heap_len = 0;\n s.heap_max = HEAP_SIZE;\n\n for (n = 0; n < elems; n++) {\n if (tree[n * 2]/*.Freq*/ !== 0) {\n s.heap[++s.heap_len] = max_code = n;\n s.depth[n] = 0;\n\n } else {\n tree[n * 2 + 1]/*.Len*/ = 0;\n }\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 while (s.heap_len < 2) {\n node = s.heap[++s.heap_len] = (max_code < 2 ? ++max_code : 0);\n tree[node * 2]/*.Freq*/ = 1;\n s.depth[node] = 0;\n s.opt_len--;\n\n if (has_stree) {\n s.static_len -= stree[node * 2 + 1]/*.Len*/;\n }\n /* node is 0 or 1 so it does not have extra bits */\n }\n desc.max_code = max_code;\n\n /* The elements heap[heap_len/2+1 .. heap_len] are leaves of the tree,\n * establish sub-heaps of increasing lengths:\n */\n for (n = (s.heap_len >> 1/*int /2*/); n >= 1; n--) { pqdownheap(s, tree, n); }\n\n /* Construct the Huffman tree by repeatedly combining the least two\n * frequent nodes.\n */\n node = elems; /* next internal node of the tree */\n do {\n //pqremove(s, tree, n); /* n = node of least frequency */\n /*** pqremove ***/\n n = s.heap[1/*SMALLEST*/];\n s.heap[1/*SMALLEST*/] = s.heap[s.heap_len--];\n pqdownheap(s, tree, 1/*SMALLEST*/);\n /***/\n\n m = s.heap[1/*SMALLEST*/]; /* m = node of next least frequency */\n\n s.heap[--s.heap_max] = n; /* keep the nodes sorted by frequency */\n s.heap[--s.heap_max] = m;\n\n /* Create a new node father of n and m */\n tree[node * 2]/*.Freq*/ = tree[n * 2]/*.Freq*/ + tree[m * 2]/*.Freq*/;\n s.depth[node] = (s.depth[n] >= s.depth[m] ? s.depth[n] : s.depth[m]) + 1;\n tree[n * 2 + 1]/*.Dad*/ = tree[m * 2 + 1]/*.Dad*/ = node;\n\n /* and insert the new node in the heap */\n s.heap[1/*SMALLEST*/] = node++;\n pqdownheap(s, tree, 1/*SMALLEST*/);\n\n } while (s.heap_len >= 2);\n\n s.heap[--s.heap_max] = s.heap[1/*SMALLEST*/];\n\n /* At this point, the fields freq and dad are set. We can now\n * generate the bit lengths.\n */\n gen_bitlen(s, desc);\n\n /* The field len is now set, we can generate the bit codes */\n gen_codes(tree, max_code, s.bl_count);\n}\n\n\n/* ===========================================================================\n * Scan a literal or distance tree to determine the frequencies of the codes\n * in the bit length tree.\n */\nfunction scan_tree(s, tree, max_code)\n// 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; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n }\n tree[(max_code + 1) * 2 + 1]/*.Len*/ = 0xffff; /* guard */\n\n for (n = 0; n <= max_code; n++) {\n curlen = nextlen;\n nextlen = tree[(n + 1) * 2 + 1]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n s.bl_tree[curlen * 2]/*.Freq*/ += count;\n\n } else if (curlen !== 0) {\n\n if (curlen !== prevlen) { s.bl_tree[curlen * 2]/*.Freq*/++; }\n s.bl_tree[REP_3_6 * 2]/*.Freq*/++;\n\n } else if (count <= 10) {\n s.bl_tree[REPZ_3_10 * 2]/*.Freq*/++;\n\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\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\n}\n\n\n/* ===========================================================================\n * Send a literal or distance tree in compressed form, using the codes in\n * bl_tree.\n */\nfunction send_tree(s, tree, max_code)\n// 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; /* iterates over all tree elements */\n var prevlen = -1; /* last emitted length */\n var curlen; /* length of current code */\n\n var nextlen = tree[0 * 2 + 1]/*.Len*/; /* length of next code */\n\n var count = 0; /* repeat count of the current code */\n var max_count = 7; /* max repeat count */\n var min_count = 4; /* min repeat count */\n\n /* tree[max_code+1].Len = -1; */ /* guard already set */\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]/*.Len*/;\n\n if (++count < max_count && curlen === nextlen) {\n continue;\n\n } else if (count < min_count) {\n do { send_code(s, curlen, s.bl_tree); } while (--count !== 0);\n\n } else if (curlen !== 0) {\n if (curlen !== prevlen) {\n send_code(s, curlen, s.bl_tree);\n count--;\n }\n //Assert(count >= 3 && count <= 6, \" 3_6?\");\n send_code(s, REP_3_6, s.bl_tree);\n send_bits(s, count - 3, 2);\n\n } else if (count <= 10) {\n send_code(s, REPZ_3_10, s.bl_tree);\n send_bits(s, count - 3, 3);\n\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 if (nextlen === 0) {\n max_count = 138;\n min_count = 3;\n\n } else if (curlen === nextlen) {\n max_count = 6;\n min_count = 3;\n\n } else {\n max_count = 7;\n min_count = 4;\n }\n }\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 */\nfunction build_bl_tree(s) {\n var max_blindex; /* index of last bit length code of non zero freq */\n\n /* Determine the bit length frequencies for literal and distance trees */\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\n /* Build the bit length tree: */\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 for (max_blindex = BL_CODES - 1; max_blindex >= 3; max_blindex--) {\n if (s.bl_tree[bl_order[max_blindex] * 2 + 1]/*.Len*/ !== 0) {\n break;\n }\n }\n /* Update opt_len to include the bit length tree and counts */\n s.opt_len += 3 * (max_blindex + 1) + 5 + 5 + 4;\n //Tracev((stderr, \"\\ndyn trees: dyn %ld, stat %ld\",\n // s->opt_len, s->static_len));\n\n return max_blindex;\n}\n\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 */\nfunction send_all_trees(s, lcodes, dcodes, blcodes)\n// deflate_state *s;\n// int lcodes, dcodes, blcodes; /* number of codes for each tree */\n{\n var rank; /* index in bl_order */\n\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 send_bits(s, lcodes - 257, 5); /* not +255 as stated in appnote.txt */\n send_bits(s, dcodes - 1, 5);\n send_bits(s, blcodes - 4, 4); /* not -3 as stated in appnote.txt */\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]/*.Len*/, 3);\n }\n //Tracev((stderr, \"\\nbl tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_ltree, lcodes - 1); /* literal tree */\n //Tracev((stderr, \"\\nlit tree: sent %ld\", s->bits_sent));\n\n send_tree(s, s.dyn_dtree, dcodes - 1); /* distance tree */\n //Tracev((stderr, \"\\ndist tree: sent %ld\", s->bits_sent));\n}\n\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 */\nfunction 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\n /* Check for non-textual (\"black-listed\") bytes. */\n for (n = 0; n <= 31; n++, black_mask >>>= 1) {\n if ((black_mask & 1) && (s.dyn_ltree[n * 2]/*.Freq*/ !== 0)) {\n return Z_BINARY;\n }\n }\n\n /* Check for textual (\"white-listed\") bytes. */\n if (s.dyn_ltree[9 * 2]/*.Freq*/ !== 0 || s.dyn_ltree[10 * 2]/*.Freq*/ !== 0 ||\n s.dyn_ltree[13 * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\n for (n = 32; n < LITERALS; n++) {\n if (s.dyn_ltree[n * 2]/*.Freq*/ !== 0) {\n return Z_TEXT;\n }\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 return Z_BINARY;\n}\n\n\nvar static_init_done = false;\n\n/* ===========================================================================\n * Initialize the tree data structures for a new zlib stream.\n */\nfunction _tr_init(s)\n{\n\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\n s.bi_buf = 0;\n s.bi_valid = 0;\n\n /* Initialize the first block of the first file: */\n init_block(s);\n}\n\n\n/* ===========================================================================\n * Send a stored block\n */\nfunction _tr_stored_block(s, buf, stored_len, last)\n//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); /* send block type */\n copy_block(s, buf, stored_len, true); /* with header */\n}\n\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 */\nfunction _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\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 */\nfunction _tr_flush_block(s, buf, stored_len, last)\n//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; /* opt_len and static_len in bytes */\n var max_blindex = 0; /* index of last bit length code of non zero freq */\n\n /* Build the Huffman trees unless a stored block is forced */\n if (s.level > 0) {\n\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\n /* Construct the literal and distance trees */\n build_tree(s, s.l_desc);\n // Tracev((stderr, \"\\nlit data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\n\n build_tree(s, s.d_desc);\n // Tracev((stderr, \"\\ndist data: dyn %ld, stat %ld\", s->opt_len,\n // s->static_len));\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 max_blindex = build_bl_tree(s);\n\n /* Determine the best encoding. Compute the block lengths in bytes. */\n opt_lenb = (s.opt_len + 3 + 7) >>> 3;\n static_lenb = (s.static_len + 3 + 7) >>> 3;\n\n // 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) { opt_lenb = static_lenb; }\n\n } else {\n // Assert(buf != (char*)0, \"lost buf\");\n opt_lenb = static_lenb = stored_len + 5; /* 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\n } else if (s.strategy === Z_FIXED || static_lenb === opt_lenb) {\n\n send_bits(s, (STATIC_TREES << 1) + (last ? 1 : 0), 3);\n compress_block(s, static_ltree, static_dtree);\n\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 }\n // Assert (s->compressed_len == s->bits_sent, \"bad compressed size\");\n /* The above check is made mod 2^32, for files larger than 512 MB\n * and uLong implemented on 32 bits.\n */\n init_block(s);\n\n if (last) {\n bi_windup(s);\n }\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 */\nfunction _tr_tally(s, dist, lc)\n// 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\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\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 dist--; /* 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 }\n\n// (!) This block is disabled in zlib defaults,\n// don't enable it for binary compatibility\n\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 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\nexports._tr_init = _tr_init;\nexports._tr_stored_block = _tr_stored_block;\nexports._tr_flush_block = _tr_flush_block;\nexports._tr_tally = _tr_tally;\nexports._tr_align = _tr_align;\n","'use strict';\n\n// (C) 1995-2013 Jean-loup Gailly and Mark Adler\n// (C) 2014-2017 Vitaly Puzrin and Andrey Tupitsin\n//\n// This software is provided 'as-is', without any express or implied\n// warranty. In no event will the authors be held liable for any damages\n// arising from the use of this software.\n//\n// Permission is granted to anyone to use this software for any purpose,\n// including commercial applications, and to alter it and redistribute it\n// freely, subject to the following restrictions:\n//\n// 1. The origin of this software must not be misrepresented; you must not\n// claim that you wrote the original software. If you use this software\n// in a product, an acknowledgment in the product documentation would be\n// appreciated but is not required.\n// 2. Altered source versions must be plainly marked as such, and must not be\n// misrepresented as being the original software.\n// 3. This notice may not be removed or altered from any source distribution.\n\nfunction ZStream() {\n /* next input byte */\n this.input = null; // JS specific, because we have no pointers\n this.next_in = 0;\n /* number of bytes available at input */\n this.avail_in = 0;\n /* total number of input bytes read so far */\n this.total_in = 0;\n /* next output byte should be put there */\n this.output = null; // JS specific, because we have no pointers\n this.next_out = 0;\n /* remaining free space at output */\n this.avail_out = 0;\n /* total number of bytes output so far */\n this.total_out = 0;\n /* last error message, NULL if no error */\n this.msg = ''/*Z_NULL*/;\n /* not visible by applications */\n this.state = null;\n /* best guess about the data type: binary or text */\n this.data_type = 2/*Z_UNKNOWN*/;\n /* adler32 value of the uncompressed data */\n this.adler = 0;\n}\n\nmodule.exports = ZStream;\n","// from https://github.com/indutny/self-signed/blob/gh-pages/lib/asn1.js\n// Fedor, you are amazing.\n'use strict'\n\nvar asn1 = require('asn1.js')\n\nexports.certificate = require('./certificate')\n\nvar RSAPrivateKey = asn1.define('RSAPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('modulus').int(),\n this.key('publicExponent').int(),\n this.key('privateExponent').int(),\n this.key('prime1').int(),\n this.key('prime2').int(),\n this.key('exponent1').int(),\n this.key('exponent2').int(),\n this.key('coefficient').int()\n )\n})\nexports.RSAPrivateKey = RSAPrivateKey\n\nvar RSAPublicKey = asn1.define('RSAPublicKey', function () {\n this.seq().obj(\n this.key('modulus').int(),\n this.key('publicExponent').int()\n )\n})\nexports.RSAPublicKey = RSAPublicKey\n\nvar PublicKey = asn1.define('SubjectPublicKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPublicKey').bitstr()\n )\n})\nexports.PublicKey = PublicKey\n\nvar AlgorithmIdentifier = asn1.define('AlgorithmIdentifier', function () {\n this.seq().obj(\n this.key('algorithm').objid(),\n this.key('none').null_().optional(),\n this.key('curve').objid().optional(),\n this.key('params').seq().obj(\n this.key('p').int(),\n this.key('q').int(),\n this.key('g').int()\n ).optional()\n )\n})\n\nvar PrivateKeyInfo = asn1.define('PrivateKeyInfo', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPrivateKey').octstr()\n )\n})\nexports.PrivateKey = PrivateKeyInfo\nvar EncryptedPrivateKeyInfo = asn1.define('EncryptedPrivateKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').seq().obj(\n this.key('id').objid(),\n this.key('decrypt').seq().obj(\n this.key('kde').seq().obj(\n this.key('id').objid(),\n this.key('kdeparams').seq().obj(\n this.key('salt').octstr(),\n this.key('iters').int()\n )\n ),\n this.key('cipher').seq().obj(\n this.key('algo').objid(),\n this.key('iv').octstr()\n )\n )\n ),\n this.key('subjectPrivateKey').octstr()\n )\n})\n\nexports.EncryptedPrivateKey = EncryptedPrivateKeyInfo\n\nvar DSAPrivateKey = asn1.define('DSAPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('p').int(),\n this.key('q').int(),\n this.key('g').int(),\n this.key('pub_key').int(),\n this.key('priv_key').int()\n )\n})\nexports.DSAPrivateKey = DSAPrivateKey\n\nexports.DSAparam = asn1.define('DSAparam', function () {\n this.int()\n})\n\nvar ECPrivateKey = asn1.define('ECPrivateKey', function () {\n this.seq().obj(\n this.key('version').int(),\n this.key('privateKey').octstr(),\n this.key('parameters').optional().explicit(0).use(ECParameters),\n this.key('publicKey').optional().explicit(1).bitstr()\n )\n})\nexports.ECPrivateKey = ECPrivateKey\n\nvar ECParameters = asn1.define('ECParameters', function () {\n this.choice({\n namedCurve: this.objid()\n })\n})\n\nexports.signature = asn1.define('signature', function () {\n this.seq().obj(\n this.key('r').int(),\n this.key('s').int()\n )\n})\n","// from https://github.com/Rantanen/node-dtls/blob/25a7dc861bda38cfeac93a723500eea4f0ac2e86/Certificate.js\n// thanks to @Rantanen\n\n'use strict'\n\nvar asn = require('asn1.js')\n\nvar Time = asn.define('Time', function () {\n this.choice({\n utcTime: this.utctime(),\n generalTime: this.gentime()\n })\n})\n\nvar AttributeTypeValue = asn.define('AttributeTypeValue', function () {\n this.seq().obj(\n this.key('type').objid(),\n this.key('value').any()\n )\n})\n\nvar AlgorithmIdentifier = asn.define('AlgorithmIdentifier', function () {\n this.seq().obj(\n this.key('algorithm').objid(),\n this.key('parameters').optional(),\n this.key('curve').objid().optional()\n )\n})\n\nvar SubjectPublicKeyInfo = asn.define('SubjectPublicKeyInfo', function () {\n this.seq().obj(\n this.key('algorithm').use(AlgorithmIdentifier),\n this.key('subjectPublicKey').bitstr()\n )\n})\n\nvar RelativeDistinguishedName = asn.define('RelativeDistinguishedName', function () {\n this.setof(AttributeTypeValue)\n})\n\nvar RDNSequence = asn.define('RDNSequence', function () {\n this.seqof(RelativeDistinguishedName)\n})\n\nvar Name = asn.define('Name', function () {\n this.choice({\n rdnSequence: this.use(RDNSequence)\n })\n})\n\nvar Validity = asn.define('Validity', function () {\n this.seq().obj(\n this.key('notBefore').use(Time),\n this.key('notAfter').use(Time)\n )\n})\n\nvar Extension = asn.define('Extension', function () {\n this.seq().obj(\n this.key('extnID').objid(),\n this.key('critical').bool().def(false),\n this.key('extnValue').octstr()\n )\n})\n\nvar TBSCertificate = asn.define('TBSCertificate', function () {\n this.seq().obj(\n this.key('version').explicit(0).int().optional(),\n this.key('serialNumber').int(),\n this.key('signature').use(AlgorithmIdentifier),\n this.key('issuer').use(Name),\n this.key('validity').use(Validity),\n this.key('subject').use(Name),\n this.key('subjectPublicKeyInfo').use(SubjectPublicKeyInfo),\n this.key('issuerUniqueID').implicit(1).bitstr().optional(),\n this.key('subjectUniqueID').implicit(2).bitstr().optional(),\n this.key('extensions').explicit(3).seqof(Extension).optional()\n )\n})\n\nvar X509Certificate = asn.define('X509Certificate', function () {\n this.seq().obj(\n this.key('tbsCertificate').use(TBSCertificate),\n this.key('signatureAlgorithm').use(AlgorithmIdentifier),\n this.key('signatureValue').bitstr()\n )\n})\n\nmodule.exports = X509Certificate\n","// adapted from https://github.com/apatil/pemstrip\nvar findProc = /Proc-Type: 4,ENCRYPTED[\\n\\r]+DEK-Info: AES-((?:128)|(?:192)|(?:256))-CBC,([0-9A-H]+)[\\n\\r]+([0-9A-z\\n\\r+/=]+)[\\n\\r]+/m\nvar startRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----/m\nvar fullRegex = /^-----BEGIN ((?:.*? KEY)|CERTIFICATE)-----([0-9A-z\\n\\r+/=]+)-----END \\1-----$/m\nvar evp = require('evp_bytestokey')\nvar ciphers = require('browserify-aes')\nvar Buffer = require('safe-buffer').Buffer\nmodule.exports = function (okey, password) {\n var key = okey.toString()\n var match = key.match(findProc)\n var decrypted\n if (!match) {\n var match2 = key.match(fullRegex)\n decrypted = Buffer.from(match2[2].replace(/[\\r\\n]/g, ''), 'base64')\n } else {\n var suite = 'aes' + match[1]\n var iv = Buffer.from(match[2], 'hex')\n var cipherText = Buffer.from(match[3].replace(/[\\r\\n]/g, ''), 'base64')\n var cipherKey = evp(password, iv.slice(0, 8), parseInt(match[1], 10)).key\n var out = []\n var cipher = ciphers.createDecipheriv(suite, cipherKey, iv)\n out.push(cipher.update(cipherText))\n out.push(cipher.final())\n decrypted = Buffer.concat(out)\n }\n var tag = key.match(startRegex)[1]\n return {\n tag: tag,\n data: decrypted\n }\n}\n","var asn1 = require('./asn1')\nvar aesid = require('./aesid.json')\nvar fixProc = require('./fixProc')\nvar ciphers = require('browserify-aes')\nvar compat = require('pbkdf2')\nvar Buffer = require('safe-buffer').Buffer\nmodule.exports = parseKeys\n\nfunction parseKeys (buffer) {\n var password\n if (typeof buffer === 'object' && !Buffer.isBuffer(buffer)) {\n password = buffer.passphrase\n buffer = buffer.key\n }\n if (typeof buffer === 'string') {\n buffer = Buffer.from(buffer)\n }\n\n var stripped = fixProc(buffer, password)\n\n var type = stripped.tag\n var data = stripped.data\n var subtype, ndata\n switch (type) {\n case 'CERTIFICATE':\n ndata = asn1.certificate.decode(data, 'der').tbsCertificate.subjectPublicKeyInfo\n // falls through\n case 'PUBLIC KEY':\n if (!ndata) {\n ndata = asn1.PublicKey.decode(data, 'der')\n }\n subtype = ndata.algorithm.algorithm.join('.')\n switch (subtype) {\n case '1.2.840.113549.1.1.1':\n return asn1.RSAPublicKey.decode(ndata.subjectPublicKey.data, 'der')\n case '1.2.840.10045.2.1':\n ndata.subjectPrivateKey = ndata.subjectPublicKey\n return {\n type: 'ec',\n data: ndata\n }\n case '1.2.840.10040.4.1':\n ndata.algorithm.params.pub_key = asn1.DSAparam.decode(ndata.subjectPublicKey.data, 'der')\n return {\n type: 'dsa',\n data: ndata.algorithm.params\n }\n default: throw new Error('unknown key id ' + subtype)\n }\n // throw new Error('unknown key type ' + type)\n case 'ENCRYPTED PRIVATE KEY':\n data = asn1.EncryptedPrivateKey.decode(data, 'der')\n data = decrypt(data, password)\n // falls through\n case 'PRIVATE KEY':\n ndata = asn1.PrivateKey.decode(data, 'der')\n subtype = ndata.algorithm.algorithm.join('.')\n switch (subtype) {\n case '1.2.840.113549.1.1.1':\n return asn1.RSAPrivateKey.decode(ndata.subjectPrivateKey, 'der')\n case '1.2.840.10045.2.1':\n return {\n curve: ndata.algorithm.curve,\n privateKey: asn1.ECPrivateKey.decode(ndata.subjectPrivateKey, 'der').privateKey\n }\n case '1.2.840.10040.4.1':\n ndata.algorithm.params.priv_key = asn1.DSAparam.decode(ndata.subjectPrivateKey, 'der')\n return {\n type: 'dsa',\n params: ndata.algorithm.params\n }\n default: throw new Error('unknown key id ' + subtype)\n }\n // throw new Error('unknown key type ' + type)\n case 'RSA PUBLIC KEY':\n return asn1.RSAPublicKey.decode(data, 'der')\n case 'RSA PRIVATE KEY':\n return asn1.RSAPrivateKey.decode(data, 'der')\n case 'DSA PRIVATE KEY':\n return {\n type: 'dsa',\n params: asn1.DSAPrivateKey.decode(data, 'der')\n }\n case 'EC PRIVATE KEY':\n data = asn1.ECPrivateKey.decode(data, 'der')\n return {\n curve: data.parameters.value,\n privateKey: data.privateKey\n }\n default: throw new Error('unknown key type ' + type)\n }\n}\nparseKeys.signature = asn1.signature\nfunction decrypt (data, password) {\n var salt = data.algorithm.decrypt.kde.kdeparams.salt\n var iters = parseInt(data.algorithm.decrypt.kde.kdeparams.iters.toString(), 10)\n var algo = aesid[data.algorithm.decrypt.cipher.algo.join('.')]\n var iv = data.algorithm.decrypt.cipher.iv\n var cipherText = data.subjectPrivateKey\n var keylen = parseInt(algo.split('-')[1], 10) / 8\n var key = compat.pbkdf2Sync(password, salt, iters, keylen, 'sha1')\n var cipher = ciphers.createDecipheriv(algo, key, iv)\n var out = []\n out.push(cipher.update(cipherText))\n out.push(cipher.final())\n return Buffer.concat(out)\n}\n","/*! parse-torrent. MIT License. WebTorrent LLC */\n/* global Blob */\n\nconst bencode = require('bencode')\nconst blobToBuffer = require('blob-to-buffer')\nconst fs = require('fs') // browser exclude\nconst get = require('simple-get')\nconst magnet = require('magnet-uri')\nconst path = require('path')\nconst sha1 = require('simple-sha1')\nconst queueMicrotask = require('queue-microtask')\n\nmodule.exports = parseTorrent\nmodule.exports.remote = parseTorrentRemote\n\nmodule.exports.toMagnetURI = magnet.encode\nmodule.exports.toTorrentFile = encodeTorrentFile\n\n/**\n * Parse a torrent identifier (magnet uri, .torrent file, info hash)\n * @param {string|Buffer|Object} torrentId\n * @return {Object}\n */\nfunction parseTorrent (torrentId) {\n if (typeof torrentId === 'string' && /^(stream-)?magnet:/.test(torrentId)) {\n // if magnet uri (string)\n const torrentObj = magnet(torrentId)\n\n // infoHash won't be defined if a non-bittorrent magnet is passed\n if (!torrentObj.infoHash) {\n throw new Error('Invalid torrent identifier')\n }\n\n return torrentObj\n } else if (typeof torrentId === 'string' && (/^[a-f0-9]{40}$/i.test(torrentId) || /^[a-z2-7]{32}$/i.test(torrentId))) {\n // if info hash (hex/base-32 string)\n return magnet(`magnet:?xt=urn:btih:${torrentId}`)\n } else if (Buffer.isBuffer(torrentId) && torrentId.length === 20) {\n // if info hash (buffer)\n return magnet(`magnet:?xt=urn:btih:${torrentId.toString('hex')}`)\n } else if (Buffer.isBuffer(torrentId)) {\n // if .torrent file (buffer)\n return decodeTorrentFile(torrentId) // might throw\n } else if (torrentId && torrentId.infoHash) {\n // if parsed torrent (from `parse-torrent` or `magnet-uri`)\n torrentId.infoHash = torrentId.infoHash.toLowerCase()\n\n if (!torrentId.announce) torrentId.announce = []\n\n if (typeof torrentId.announce === 'string') {\n torrentId.announce = [torrentId.announce]\n }\n\n if (!torrentId.urlList) torrentId.urlList = []\n\n return torrentId\n } else {\n throw new Error('Invalid torrent identifier')\n }\n}\n\nfunction parseTorrentRemote (torrentId, opts, cb) {\n if (typeof opts === 'function') return parseTorrentRemote(torrentId, {}, opts)\n if (typeof cb !== 'function') throw new Error('second argument must be a Function')\n\n let parsedTorrent\n try {\n parsedTorrent = parseTorrent(torrentId)\n } catch (err) {\n // If torrent fails to parse, it could be a Blob, http/https URL or\n // filesystem path, so don't consider it an error yet.\n }\n\n if (parsedTorrent && parsedTorrent.infoHash) {\n queueMicrotask(() => {\n cb(null, parsedTorrent)\n })\n } else if (isBlob(torrentId)) {\n blobToBuffer(torrentId, (err, torrentBuf) => {\n if (err) return cb(new Error(`Error converting Blob: ${err.message}`))\n parseOrThrow(torrentBuf)\n })\n } else if (typeof get === 'function' && /^https?:/.test(torrentId)) {\n // http, or https url to torrent file\n opts = Object.assign({\n url: torrentId,\n timeout: 30 * 1000,\n headers: { 'user-agent': 'WebTorrent (https://webtorrent.io)' }\n }, opts)\n get.concat(opts, (err, res, torrentBuf) => {\n if (err) return cb(new Error(`Error downloading torrent: ${err.message}`))\n parseOrThrow(torrentBuf)\n })\n } else if (typeof fs.readFile === 'function' && typeof torrentId === 'string') {\n // assume it's a filesystem path\n fs.readFile(torrentId, (err, torrentBuf) => {\n if (err) return cb(new Error('Invalid torrent identifier'))\n parseOrThrow(torrentBuf)\n })\n } else {\n queueMicrotask(() => {\n cb(new Error('Invalid torrent identifier'))\n })\n }\n\n function parseOrThrow (torrentBuf) {\n try {\n parsedTorrent = parseTorrent(torrentBuf)\n } catch (err) {\n return cb(err)\n }\n if (parsedTorrent && parsedTorrent.infoHash) cb(null, parsedTorrent)\n else cb(new Error('Invalid torrent identifier'))\n }\n}\n\n/**\n * Parse a torrent. Throws an exception if the torrent is missing required fields.\n * @param {Buffer|Object} torrent\n * @return {Object} parsed torrent\n */\nfunction decodeTorrentFile (torrent) {\n if (Buffer.isBuffer(torrent)) {\n torrent = bencode.decode(torrent)\n }\n\n // sanity check\n ensure(torrent.info, 'info')\n ensure(torrent.info['name.utf-8'] || torrent.info.name, 'info.name')\n ensure(torrent.info['piece length'], 'info[\\'piece length\\']')\n ensure(torrent.info.pieces, 'info.pieces')\n\n if (torrent.info.files) {\n torrent.info.files.forEach(file => {\n ensure(typeof file.length === 'number', 'info.files[0].length')\n ensure(file['path.utf-8'] || file.path, 'info.files[0].path')\n })\n } else {\n ensure(typeof torrent.info.length === 'number', 'info.length')\n }\n\n const result = {\n info: torrent.info,\n infoBuffer: bencode.encode(torrent.info),\n name: (torrent.info['name.utf-8'] || torrent.info.name).toString(),\n announce: []\n }\n\n result.infoHash = sha1.sync(result.infoBuffer)\n result.infoHashBuffer = Buffer.from(result.infoHash, 'hex')\n\n if (torrent.info.private !== undefined) result.private = !!torrent.info.private\n\n if (torrent['creation date']) result.created = new Date(torrent['creation date'] * 1000)\n if (torrent['created by']) result.createdBy = torrent['created by'].toString()\n\n if (Buffer.isBuffer(torrent.comment)) result.comment = torrent.comment.toString()\n\n // announce and announce-list will be missing if metadata fetched via ut_metadata\n if (Array.isArray(torrent['announce-list']) && torrent['announce-list'].length > 0) {\n torrent['announce-list'].forEach(urls => {\n urls.forEach(url => {\n result.announce.push(url.toString())\n })\n })\n } else if (torrent.announce) {\n result.announce.push(torrent.announce.toString())\n }\n\n // handle url-list (BEP19 / web seeding)\n if (Buffer.isBuffer(torrent['url-list'])) {\n // some clients set url-list to empty string\n torrent['url-list'] = torrent['url-list'].length > 0\n ? [torrent['url-list']]\n : []\n }\n result.urlList = (torrent['url-list'] || []).map(url => url.toString())\n\n // remove duplicates by converting to Set and back\n result.announce = Array.from(new Set(result.announce))\n result.urlList = Array.from(new Set(result.urlList))\n\n const files = torrent.info.files || [torrent.info]\n result.files = files.map((file, i) => {\n const parts = [].concat(result.name, file['path.utf-8'] || file.path || []).map(p => p.toString())\n return {\n path: path.join.apply(null, [path.sep].concat(parts)).slice(1),\n name: parts[parts.length - 1],\n length: file.length,\n offset: files.slice(0, i).reduce(sumLength, 0)\n }\n })\n\n result.length = files.reduce(sumLength, 0)\n\n const lastFile = result.files[result.files.length - 1]\n\n result.pieceLength = torrent.info['piece length']\n result.lastPieceLength = ((lastFile.offset + lastFile.length) % result.pieceLength) || result.pieceLength\n result.pieces = splitPieces(torrent.info.pieces)\n\n return result\n}\n\n/**\n * Convert a parsed torrent object back into a .torrent file buffer.\n * @param {Object} parsed parsed torrent\n * @return {Buffer}\n */\nfunction encodeTorrentFile (parsed) {\n const torrent = {\n info: parsed.info\n }\n\n torrent['announce-list'] = (parsed.announce || []).map(url => {\n if (!torrent.announce) torrent.announce = url\n url = Buffer.from(url, 'utf8')\n return [url]\n })\n\n torrent['url-list'] = parsed.urlList || []\n\n if (parsed.private !== undefined) {\n torrent.private = Number(parsed.private)\n }\n\n if (parsed.created) {\n torrent['creation date'] = (parsed.created.getTime() / 1000) | 0\n }\n\n if (parsed.createdBy) {\n torrent['created by'] = parsed.createdBy\n }\n\n if (parsed.comment) {\n torrent.comment = parsed.comment\n }\n\n return bencode.encode(torrent)\n}\n\n/**\n * Check if `obj` is a W3C `Blob` or `File` object\n * @param {*} obj\n * @return {boolean}\n */\nfunction isBlob (obj) {\n return typeof Blob !== 'undefined' && obj instanceof Blob\n}\n\nfunction sumLength (sum, file) {\n return sum + file.length\n}\n\nfunction splitPieces (buf) {\n const pieces = []\n for (let i = 0; i < buf.length; i += 20) {\n pieces.push(buf.slice(i, i + 20).toString('hex'))\n }\n return pieces\n}\n\nfunction ensure (bool, fieldName) {\n if (!bool) throw new Error(`Torrent is missing required field: ${fieldName}`)\n}\n\n// Workaround Browserify v13 bug\n// https://github.com/substack/node-browserify/issues/1483\n;(() => { Buffer.alloc(0) })()\n","// 'path' module extracted from Node.js v8.11.1 (only the posix part)\n// transplited with Babel\n\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\n'use strict';\n\nfunction assertPath(path) {\n if (typeof path !== 'string') {\n throw new TypeError('Path must be a string. Received ' + JSON.stringify(path));\n }\n}\n\n// Resolves . and .. elements in a path with directory names\nfunction normalizeStringPosix(path, allowAboveRoot) {\n var res = '';\n var lastSegmentLength = 0;\n var lastSlash = -1;\n var dots = 0;\n var code;\n for (var i = 0; i <= path.length; ++i) {\n if (i < path.length)\n code = path.charCodeAt(i);\n else if (code === 47 /*/*/)\n break;\n else\n code = 47 /*/*/;\n if (code === 47 /*/*/) {\n if (lastSlash === i - 1 || dots === 1) {\n // NOOP\n } else if (lastSlash !== i - 1 && dots === 2) {\n if (res.length < 2 || lastSegmentLength !== 2 || res.charCodeAt(res.length - 1) !== 46 /*.*/ || res.charCodeAt(res.length - 2) !== 46 /*.*/) {\n if (res.length > 2) {\n var lastSlashIndex = res.lastIndexOf('/');\n if (lastSlashIndex !== res.length - 1) {\n if (lastSlashIndex === -1) {\n res = '';\n lastSegmentLength = 0;\n } else {\n res = res.slice(0, lastSlashIndex);\n lastSegmentLength = res.length - 1 - res.lastIndexOf('/');\n }\n lastSlash = i;\n dots = 0;\n continue;\n }\n } else if (res.length === 2 || res.length === 1) {\n res = '';\n lastSegmentLength = 0;\n lastSlash = i;\n dots = 0;\n continue;\n }\n }\n if (allowAboveRoot) {\n if (res.length > 0)\n res += '/..';\n else\n res = '..';\n lastSegmentLength = 2;\n }\n } else {\n if (res.length > 0)\n res += '/' + path.slice(lastSlash + 1, i);\n else\n res = path.slice(lastSlash + 1, i);\n lastSegmentLength = i - lastSlash - 1;\n }\n lastSlash = i;\n dots = 0;\n } else if (code === 46 /*.*/ && dots !== -1) {\n ++dots;\n } else {\n dots = -1;\n }\n }\n return res;\n}\n\nfunction _format(sep, pathObject) {\n var dir = pathObject.dir || pathObject.root;\n var base = pathObject.base || (pathObject.name || '') + (pathObject.ext || '');\n if (!dir) {\n return base;\n }\n if (dir === pathObject.root) {\n return dir + base;\n }\n return dir + sep + base;\n}\n\nvar posix = {\n // path.resolve([from ...], to)\n resolve: function resolve() {\n var resolvedPath = '';\n var resolvedAbsolute = false;\n var cwd;\n\n for (var i = arguments.length - 1; i >= -1 && !resolvedAbsolute; i--) {\n var path;\n if (i >= 0)\n path = arguments[i];\n else {\n if (cwd === undefined)\n cwd = process.cwd();\n path = cwd;\n }\n\n assertPath(path);\n\n // Skip empty entries\n if (path.length === 0) {\n continue;\n }\n\n resolvedPath = path + '/' + resolvedPath;\n resolvedAbsolute = path.charCodeAt(0) === 47 /*/*/;\n }\n\n // At this point the path should be resolved to a full absolute path, but\n // handle relative paths to be safe (might happen when process.cwd() fails)\n\n // Normalize the path\n resolvedPath = normalizeStringPosix(resolvedPath, !resolvedAbsolute);\n\n if (resolvedAbsolute) {\n if (resolvedPath.length > 0)\n return '/' + resolvedPath;\n else\n return '/';\n } else if (resolvedPath.length > 0) {\n return resolvedPath;\n } else {\n return '.';\n }\n },\n\n normalize: function normalize(path) {\n assertPath(path);\n\n if (path.length === 0) return '.';\n\n var isAbsolute = path.charCodeAt(0) === 47 /*/*/;\n var trailingSeparator = path.charCodeAt(path.length - 1) === 47 /*/*/;\n\n // Normalize the path\n path = normalizeStringPosix(path, !isAbsolute);\n\n if (path.length === 0 && !isAbsolute) path = '.';\n if (path.length > 0 && trailingSeparator) path += '/';\n\n if (isAbsolute) return '/' + path;\n return path;\n },\n\n isAbsolute: function isAbsolute(path) {\n assertPath(path);\n return path.length > 0 && path.charCodeAt(0) === 47 /*/*/;\n },\n\n join: function join() {\n if (arguments.length === 0)\n return '.';\n var joined;\n for (var i = 0; i < arguments.length; ++i) {\n var arg = arguments[i];\n assertPath(arg);\n if (arg.length > 0) {\n if (joined === undefined)\n joined = arg;\n else\n joined += '/' + arg;\n }\n }\n if (joined === undefined)\n return '.';\n return posix.normalize(joined);\n },\n\n relative: function relative(from, to) {\n assertPath(from);\n assertPath(to);\n\n if (from === to) return '';\n\n from = posix.resolve(from);\n to = posix.resolve(to);\n\n if (from === to) return '';\n\n // Trim any leading backslashes\n var fromStart = 1;\n for (; fromStart < from.length; ++fromStart) {\n if (from.charCodeAt(fromStart) !== 47 /*/*/)\n break;\n }\n var fromEnd = from.length;\n var fromLen = fromEnd - fromStart;\n\n // Trim any leading backslashes\n var toStart = 1;\n for (; toStart < to.length; ++toStart) {\n if (to.charCodeAt(toStart) !== 47 /*/*/)\n break;\n }\n var toEnd = to.length;\n var toLen = toEnd - toStart;\n\n // Compare paths to find the longest common path from root\n var length = fromLen < toLen ? fromLen : toLen;\n var lastCommonSep = -1;\n var i = 0;\n for (; i <= length; ++i) {\n if (i === length) {\n if (toLen > length) {\n if (to.charCodeAt(toStart + i) === 47 /*/*/) {\n // We get here if `from` is the exact base path for `to`.\n // For example: from='/foo/bar'; to='/foo/bar/baz'\n return to.slice(toStart + i + 1);\n } else if (i === 0) {\n // We get here if `from` is the root\n // For example: from='/'; to='/foo'\n return to.slice(toStart + i);\n }\n } else if (fromLen > length) {\n if (from.charCodeAt(fromStart + i) === 47 /*/*/) {\n // We get here if `to` is the exact base path for `from`.\n // For example: from='/foo/bar/baz'; to='/foo/bar'\n lastCommonSep = i;\n } else if (i === 0) {\n // We get here if `to` is the root.\n // For example: from='/foo'; to='/'\n lastCommonSep = 0;\n }\n }\n break;\n }\n var fromCode = from.charCodeAt(fromStart + i);\n var toCode = to.charCodeAt(toStart + i);\n if (fromCode !== toCode)\n break;\n else if (fromCode === 47 /*/*/)\n lastCommonSep = i;\n }\n\n var out = '';\n // Generate the relative path based on the path difference between `to`\n // and `from`\n for (i = fromStart + lastCommonSep + 1; i <= fromEnd; ++i) {\n if (i === fromEnd || from.charCodeAt(i) === 47 /*/*/) {\n if (out.length === 0)\n out += '..';\n else\n out += '/..';\n }\n }\n\n // Lastly, append the rest of the destination (`to`) path that comes after\n // the common path parts\n if (out.length > 0)\n return out + to.slice(toStart + lastCommonSep);\n else {\n toStart += lastCommonSep;\n if (to.charCodeAt(toStart) === 47 /*/*/)\n ++toStart;\n return to.slice(toStart);\n }\n },\n\n _makeLong: function _makeLong(path) {\n return path;\n },\n\n dirname: function dirname(path) {\n assertPath(path);\n if (path.length === 0) return '.';\n var code = path.charCodeAt(0);\n var hasRoot = code === 47 /*/*/;\n var end = -1;\n var matchedSlash = true;\n for (var i = path.length - 1; i >= 1; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n if (!matchedSlash) {\n end = i;\n break;\n }\n } else {\n // We saw the first non-path separator\n matchedSlash = false;\n }\n }\n\n if (end === -1) return hasRoot ? '/' : '.';\n if (hasRoot && end === 1) return '//';\n return path.slice(0, end);\n },\n\n basename: function basename(path, ext) {\n if (ext !== undefined && typeof ext !== 'string') throw new TypeError('\"ext\" argument must be a string');\n assertPath(path);\n\n var start = 0;\n var end = -1;\n var matchedSlash = true;\n var i;\n\n if (ext !== undefined && ext.length > 0 && ext.length <= path.length) {\n if (ext.length === path.length && ext === path) return '';\n var extIdx = ext.length - 1;\n var firstNonSlashEnd = -1;\n for (i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else {\n if (firstNonSlashEnd === -1) {\n // We saw the first non-path separator, remember this index in case\n // we need it if the extension ends up not matching\n matchedSlash = false;\n firstNonSlashEnd = i + 1;\n }\n if (extIdx >= 0) {\n // Try to match the explicit extension\n if (code === ext.charCodeAt(extIdx)) {\n if (--extIdx === -1) {\n // We matched the extension, so mark this as the end of our path\n // component\n end = i;\n }\n } else {\n // Extension does not match, so our result is the entire path\n // component\n extIdx = -1;\n end = firstNonSlashEnd;\n }\n }\n }\n }\n\n if (start === end) end = firstNonSlashEnd;else if (end === -1) end = path.length;\n return path.slice(start, end);\n } else {\n for (i = path.length - 1; i >= 0; --i) {\n if (path.charCodeAt(i) === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n start = i + 1;\n break;\n }\n } else if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // path component\n matchedSlash = false;\n end = i + 1;\n }\n }\n\n if (end === -1) return '';\n return path.slice(start, end);\n }\n },\n\n extname: function extname(path) {\n assertPath(path);\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n for (var i = path.length - 1; i >= 0; --i) {\n var code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1)\n startDot = i;\n else if (preDotState !== 1)\n preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n return '';\n }\n return path.slice(startDot, end);\n },\n\n format: function format(pathObject) {\n if (pathObject === null || typeof pathObject !== 'object') {\n throw new TypeError('The \"pathObject\" argument must be of type Object. Received type ' + typeof pathObject);\n }\n return _format('/', pathObject);\n },\n\n parse: function parse(path) {\n assertPath(path);\n\n var ret = { root: '', dir: '', base: '', ext: '', name: '' };\n if (path.length === 0) return ret;\n var code = path.charCodeAt(0);\n var isAbsolute = code === 47 /*/*/;\n var start;\n if (isAbsolute) {\n ret.root = '/';\n start = 1;\n } else {\n start = 0;\n }\n var startDot = -1;\n var startPart = 0;\n var end = -1;\n var matchedSlash = true;\n var i = path.length - 1;\n\n // Track the state of characters (if any) we see before our first dot and\n // after any path separator we find\n var preDotState = 0;\n\n // Get non-dir info\n for (; i >= start; --i) {\n code = path.charCodeAt(i);\n if (code === 47 /*/*/) {\n // If we reached a path separator that was not part of a set of path\n // separators at the end of the string, stop now\n if (!matchedSlash) {\n startPart = i + 1;\n break;\n }\n continue;\n }\n if (end === -1) {\n // We saw the first non-path separator, mark this as the end of our\n // extension\n matchedSlash = false;\n end = i + 1;\n }\n if (code === 46 /*.*/) {\n // If this is our first dot, mark it as the start of our extension\n if (startDot === -1) startDot = i;else if (preDotState !== 1) preDotState = 1;\n } else if (startDot !== -1) {\n // We saw a non-dot and non-path separator before our dot, so we should\n // have a good chance at having a non-empty extension\n preDotState = -1;\n }\n }\n\n if (startDot === -1 || end === -1 ||\n // We saw a non-dot character immediately before the dot\n preDotState === 0 ||\n // The (right-most) trimmed path component is exactly '..'\n preDotState === 1 && startDot === end - 1 && startDot === startPart + 1) {\n if (end !== -1) {\n if (startPart === 0 && isAbsolute) ret.base = ret.name = path.slice(1, end);else ret.base = ret.name = path.slice(startPart, end);\n }\n } else {\n if (startPart === 0 && isAbsolute) {\n ret.name = path.slice(1, startDot);\n ret.base = path.slice(1, end);\n } else {\n ret.name = path.slice(startPart, startDot);\n ret.base = path.slice(startPart, end);\n }\n ret.ext = path.slice(startDot, end);\n }\n\n if (startPart > 0) ret.dir = path.slice(0, startPart - 1);else if (isAbsolute) ret.dir = '/';\n\n return ret;\n },\n\n sep: '/',\n delimiter: ':',\n win32: null,\n posix: null\n};\n\nposix.posix = posix;\n\nmodule.exports = posix;\n","exports.pbkdf2 = require('./lib/async')\nexports.pbkdf2Sync = require('./lib/sync')\n","var Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar sync = require('./sync')\nvar toBuffer = require('./to-buffer')\n\nvar ZERO_BUF\nvar subtle = global.crypto && global.crypto.subtle\nvar toBrowser = {\n sha: 'SHA-1',\n 'sha-1': 'SHA-1',\n sha1: 'SHA-1',\n sha256: 'SHA-256',\n 'sha-256': 'SHA-256',\n sha384: 'SHA-384',\n 'sha-384': 'SHA-384',\n 'sha-512': 'SHA-512',\n sha512: 'SHA-512'\n}\nvar checks = []\nfunction checkNative (algo) {\n if (global.process && !global.process.browser) {\n return Promise.resolve(false)\n }\n if (!subtle || !subtle.importKey || !subtle.deriveBits) {\n return Promise.resolve(false)\n }\n if (checks[algo] !== undefined) {\n return checks[algo]\n }\n ZERO_BUF = ZERO_BUF || Buffer.alloc(8)\n var prom = browserPbkdf2(ZERO_BUF, ZERO_BUF, 10, 128, algo)\n .then(function () {\n return true\n }).catch(function () {\n return false\n })\n checks[algo] = prom\n return prom\n}\nvar nextTick\nfunction getNextTick () {\n if (nextTick) {\n return nextTick\n }\n if (global.process && global.process.nextTick) {\n nextTick = global.process.nextTick\n } else if (global.queueMicrotask) {\n nextTick = global.queueMicrotask\n } else if (global.setImmediate) {\n nextTick = global.setImmediate\n } else {\n nextTick = global.setTimeout\n }\n return nextTick\n}\nfunction browserPbkdf2 (password, salt, iterations, length, algo) {\n return subtle.importKey(\n 'raw', password, { name: 'PBKDF2' }, false, ['deriveBits']\n ).then(function (key) {\n return subtle.deriveBits({\n name: 'PBKDF2',\n salt: salt,\n iterations: iterations,\n hash: {\n name: algo\n }\n }, key, length << 3)\n }).then(function (res) {\n return Buffer.from(res)\n })\n}\n\nfunction resolvePromise (promise, callback) {\n promise.then(function (out) {\n getNextTick()(function () {\n callback(null, out)\n })\n }, function (e) {\n getNextTick()(function () {\n callback(e)\n })\n })\n}\nmodule.exports = function (password, salt, iterations, keylen, digest, callback) {\n if (typeof digest === 'function') {\n callback = digest\n digest = undefined\n }\n\n digest = digest || 'sha1'\n var algo = toBrowser[digest.toLowerCase()]\n\n if (!algo || typeof global.Promise !== 'function') {\n getNextTick()(function () {\n var out\n try {\n out = sync(password, salt, iterations, keylen, digest)\n } catch (e) {\n return callback(e)\n }\n callback(null, out)\n })\n return\n }\n\n checkParameters(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n if (typeof callback !== 'function') throw new Error('No callback provided to pbkdf2')\n\n resolvePromise(checkNative(algo).then(function (resp) {\n if (resp) return browserPbkdf2(password, salt, iterations, keylen, algo)\n\n return sync(password, salt, iterations, keylen, digest)\n }), callback)\n}\n","var defaultEncoding\n/* istanbul ignore next */\nif (global.process && global.process.browser) {\n defaultEncoding = 'utf-8'\n} else if (global.process && global.process.version) {\n var pVersionMajor = parseInt(process.version.split('.')[0].slice(1), 10)\n\n defaultEncoding = pVersionMajor >= 6 ? 'utf-8' : 'binary'\n} else {\n defaultEncoding = 'utf-8'\n}\nmodule.exports = defaultEncoding\n","var MAX_ALLOC = Math.pow(2, 30) - 1 // default in iojs\n\nmodule.exports = function (iterations, keylen) {\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) { /* eslint no-self-compare: 0 */\n throw new TypeError('Bad key length')\n }\n}\n","var md5 = require('create-hash/md5')\nvar RIPEMD160 = require('ripemd160')\nvar sha = require('sha.js')\nvar Buffer = require('safe-buffer').Buffer\n\nvar checkParameters = require('./precondition')\nvar defaultEncoding = require('./default-encoding')\nvar toBuffer = require('./to-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 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 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(iterations, keylen)\n password = toBuffer(password, defaultEncoding, 'Password')\n salt = toBuffer(salt, defaultEncoding, 'Salt')\n\n digest = digest || 'sha1'\n\n var hmac = new Hmac(digest, password, salt.length)\n\n var DK = Buffer.allocUnsafe(keylen)\n var block1 = Buffer.allocUnsafe(salt.length + 4)\n salt.copy(block1, 0, 0, salt.length)\n\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\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 for (var k = 0; k < hLen; k++) T[k] ^= U[k]\n }\n\n T.copy(DK, destPos)\n destPos += hLen\n }\n\n return DK\n}\n\nmodule.exports = pbkdf2\n","var Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function (thing, encoding, name) {\n if (Buffer.isBuffer(thing)) {\n return thing\n } else if (typeof thing === 'string') {\n return Buffer.from(thing, encoding)\n } else if (ArrayBuffer.isView(thing)) {\n return Buffer.from(thing.buffer)\n } else {\n throw new TypeError(name + ' must be a string, a Buffer, a typed array or a DataView')\n }\n}\n","module.exports = length\n\nfunction length (bytes) {\n return Math.max(16384, 1 << Math.log2(bytes < 1024 ? 1 : bytes / 1024) + 0.5 | 0)\n}\n","const process = module.exports = {}\n\nprocess.title = 'browser'\nprocess.browser = true\nprocess.env = {}\nprocess.argv = []\nprocess.version = ''\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.nextTick = (func, ...args) => window.queueMicrotask(() => func(...args))\n\nprocess.listeners = (name) => []\n\nprocess.cwd = () => '/'\nprocess.umask = () => 0\nprocess.binding = (name) => { throw new Error('process.binding is not supported') }\nprocess.chdir = (dir) => { throw new Error('process.chdir is not supported') }\n","exports.publicEncrypt = require('./publicEncrypt')\nexports.privateDecrypt = require('./privateDecrypt')\n\nexports.privateEncrypt = function privateEncrypt (key, buf) {\n return exports.publicEncrypt(key, buf, true)\n}\n\nexports.publicDecrypt = function publicDecrypt (key, buf) {\n return exports.privateDecrypt(key, buf, true)\n}\n","var createHash = require('create-hash')\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 while (t.length < len) {\n c = i2ops(i++)\n t = Buffer.concat([t, createHash('sha1').update(seed).update(c).digest()])\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}\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\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;\n\n // Reduction context\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 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\n var Buffer;\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\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n 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 assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\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 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 if (number < 0x4000000) {\n this.words = [ number & 0x3ffffff ];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\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 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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\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 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 if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this.strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // 'A' - 'F'\n if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n // '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 if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\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 for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\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 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 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 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 for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n r += c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n r += c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n r += c;\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;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\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 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 for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\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 return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype.strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\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 return this;\n };\n\n BN.prototype.inspect = function inspect () {\n return (this.red ? '';\n };\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\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 = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\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 if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\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 if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\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 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 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\n this.strip();\n var littleEndian = endian === 'le';\n var res = new ArrayType(reqLength);\n\n var b, i;\n var q = this.clone();\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\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\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 if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\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\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\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\n w[bit] = (num.words[off] & (1 << wbit)) >>> wbit;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\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 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 return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\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 };\n\n // Or `num` with `this` in-place\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 };\n\n // Or `num` with `this`\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 };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\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\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 };\n\n // And `num` with `this`\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 };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\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\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 };\n\n // Xor `num` with `this`\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 };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this.strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\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 };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\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();\n\n // 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 }\n\n // a.length > b.length\n var a, b;\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 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 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 if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // 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 };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\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\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\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();\n\n // -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 }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\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 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 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 }\n\n // Copy rest of the words\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 };\n\n // Subtract `num` from `this`\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;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\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 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 out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out.strip();\n }\n\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 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\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\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\n var carry = 0;\n var hncarry = 0;\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 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\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\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\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 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 };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\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 for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\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\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\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\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 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\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\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 for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\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 for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\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 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\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\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\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\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out.strip();\n };\n\n // Multiply `this` by `num`\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 };\n\n // Multiply employing FFT\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 };\n\n // In-place Multiplication\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);\n\n // Carry\n var carry = 0;\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;\n // NOTE: lo is 27bit maximum\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 };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\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\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\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 };\n\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 BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\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\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\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 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 }\n\n // Push carried bits as a mask\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 };\n\n // Shift-left\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 };\n\n // Shift-right\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 };\n\n // Test if n bit is set\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\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\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 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 };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\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 }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\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\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 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 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();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\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 this.negative = 1;\n\n return this.strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\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 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 if (diff.negative === 0) {\n a = diff;\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 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q.strip();\n }\n a.strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\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 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 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 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 if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\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 };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\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 };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || r2 === 1 && cmp === 0) return dm.div;\n\n // Round up\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\n var acc = 0;\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 };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n assert(num <= 0x3ffffff);\n\n var carry = 0;\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\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 }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\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 if (i > 0) {\n x.iushrn(i);\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 if (j > 0) {\n y.iushrn(j);\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 };\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 BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\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\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 if (i > 0) {\n a.iushrn(i);\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 if (j > 0) {\n b.iushrn(j);\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 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\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\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 while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\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 };\n\n // Invert number in the field F(num)\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 };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\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;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\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 if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\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\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this.strip();\n\n var res;\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\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\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\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\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\n var res = 0;\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\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\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\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\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 this.red._verify2(this, num);\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 this.red._verify2(this, num);\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 this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\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 this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\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\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 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(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\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 prev >>>= 22;\n input.words[i - 10] = prev;\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;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\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 }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\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\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\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 primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\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,\n '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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\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 if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\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\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\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 while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\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 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\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\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 if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\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\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\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\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\n //\n // Montgomery method engine\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\n this.shift = this.m.bitLength();\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\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 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\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 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);\n","var parseKeys = require('parse-asn1')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar crt = require('browserify-rsa')\nvar createHash = require('create-hash')\nvar withPublic = require('./withPublic')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function privateDecrypt (privateKey, enc, reverse) {\n var padding\n if (privateKey.padding) {\n padding = privateKey.padding\n } else if (reverse) {\n padding = 1\n } else {\n padding = 4\n }\n\n var key = parseKeys(privateKey)\n var k = key.modulus.byteLength()\n if (enc.length > k || new BN(enc).cmp(key.modulus) >= 0) {\n throw new Error('decryption error')\n }\n var msg\n if (reverse) {\n msg = withPublic(new BN(enc), key)\n } else {\n msg = crt(enc, key)\n }\n var zBuffer = Buffer.alloc(k - msg.length)\n msg = Buffer.concat([zBuffer, msg], k)\n if (padding === 4) {\n return oaep(key, msg)\n } else if (padding === 1) {\n return pkcs1(key, msg, reverse)\n } else if (padding === 3) {\n return msg\n } else {\n throw new Error('unknown padding')\n }\n}\n\nfunction oaep (key, msg) {\n var k = key.modulus.byteLength()\n var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n var hLen = iHash.length\n if (msg[0] !== 0) {\n throw new Error('decryption error')\n }\n var maskedSeed = msg.slice(1, hLen + 1)\n var maskedDb = msg.slice(hLen + 1)\n var seed = xor(maskedSeed, mgf(maskedDb, hLen))\n var db = xor(maskedDb, mgf(seed, k - hLen - 1))\n if (compare(iHash, db.slice(0, hLen))) {\n throw new Error('decryption error')\n }\n var i = hLen\n while (db[i] === 0) {\n i++\n }\n if (db[i++] !== 1) {\n throw new Error('decryption error')\n }\n return db.slice(i)\n}\n\nfunction pkcs1 (key, msg, reverse) {\n var p1 = msg.slice(0, 2)\n var i = 2\n var status = 0\n while (msg[i++] !== 0) {\n if (i >= msg.length) {\n status++\n break\n }\n }\n var ps = msg.slice(2, i - 1)\n\n if ((p1.toString('hex') !== '0002' && !reverse) || (p1.toString('hex') !== '0001' && reverse)) {\n status++\n }\n if (ps.length < 8) {\n status++\n }\n if (status) {\n throw new Error('decryption error')\n }\n return msg.slice(i)\n}\nfunction compare (a, b) {\n a = Buffer.from(a)\n b = Buffer.from(b)\n var dif = 0\n var len = a.length\n if (a.length !== b.length) {\n dif++\n len = Math.min(a.length, b.length)\n }\n var i = -1\n while (++i < len) {\n dif += (a[i] ^ b[i])\n }\n return dif\n}\n","var parseKeys = require('parse-asn1')\nvar randomBytes = require('randombytes')\nvar createHash = require('create-hash')\nvar mgf = require('./mgf')\nvar xor = require('./xor')\nvar BN = require('bn.js')\nvar withPublic = require('./withPublic')\nvar crt = require('browserify-rsa')\nvar Buffer = require('safe-buffer').Buffer\n\nmodule.exports = function publicEncrypt (publicKey, msg, reverse) {\n var padding\n if (publicKey.padding) {\n padding = publicKey.padding\n } else if (reverse) {\n padding = 1\n } else {\n padding = 4\n }\n var key = parseKeys(publicKey)\n var paddedMsg\n if (padding === 4) {\n paddedMsg = oaep(key, msg)\n } else if (padding === 1) {\n paddedMsg = pkcs1(key, msg, reverse)\n } else if (padding === 3) {\n paddedMsg = new BN(msg)\n if (paddedMsg.cmp(key.modulus) >= 0) {\n throw new Error('data too long for modulus')\n }\n } else {\n throw new Error('unknown padding')\n }\n if (reverse) {\n return crt(paddedMsg, key)\n } else {\n return withPublic(paddedMsg, key)\n }\n}\n\nfunction oaep (key, msg) {\n var k = key.modulus.byteLength()\n var mLen = msg.length\n var iHash = createHash('sha1').update(Buffer.alloc(0)).digest()\n var hLen = iHash.length\n var hLen2 = 2 * hLen\n if (mLen > k - hLen2 - 2) {\n throw new Error('message too long')\n }\n var ps = Buffer.alloc(k - mLen - hLen2 - 2)\n var dblen = k - hLen - 1\n var seed = randomBytes(hLen)\n var maskedDb = xor(Buffer.concat([iHash, ps, Buffer.alloc(1, 1), msg], dblen), mgf(seed, dblen))\n var maskedSeed = xor(seed, mgf(maskedDb, hLen))\n return new BN(Buffer.concat([Buffer.alloc(1), maskedSeed, maskedDb], k))\n}\nfunction pkcs1 (key, msg, reverse) {\n var mLen = msg.length\n var k = key.modulus.byteLength()\n if (mLen > k - 11) {\n throw new Error('message too long')\n }\n var ps\n if (reverse) {\n ps = Buffer.alloc(k - mLen - 3, 0xff)\n } else {\n ps = nonZero(k - mLen - 3)\n }\n return new BN(Buffer.concat([Buffer.from([0, reverse ? 1 : 2]), ps, Buffer.alloc(1), msg], k))\n}\nfunction nonZero (len) {\n var out = Buffer.allocUnsafe(len)\n var i = 0\n var cache = randomBytes(len * 2)\n var cur = 0\n var num\n while (i < len) {\n if (cur === cache.length) {\n cache = randomBytes(len * 2)\n cur = 0\n }\n num = cache[cur++]\n if (num) {\n out[i++] = num\n }\n }\n return out\n}\n","var BN = require('bn.js')\nvar Buffer = require('safe-buffer').Buffer\n\nfunction withPublic (paddedMsg, key) {\n return Buffer.from(paddedMsg\n .toRed(BN.mont(key.modulus))\n .redPow(new BN(key.publicExponent))\n .fromRed()\n .toArray())\n}\n\nmodule.exports = withPublic\n","module.exports = function xor (a, b) {\n var len = a.length\n var i = -1\n while (++i < len) {\n a[i] ^= b[i]\n }\n return a\n}\n","var once = require('once')\nvar eos = require('end-of-stream')\nvar fs = require('fs') // we only need fs to get the ReadStream and WriteStream prototypes\n\nvar noop = function () {}\nvar ancient = /^v?\\.0/.test(process.version)\n\nvar isFn = function (fn) {\n return typeof fn === 'function'\n}\n\nvar isFS = function (stream) {\n if (!ancient) return false // newer node version do not need to care about fs is a special way\n if (!fs) return false // browser\n return (stream instanceof (fs.ReadStream || noop) || stream instanceof (fs.WriteStream || noop)) && isFn(stream.close)\n}\n\nvar isRequest = function (stream) {\n return stream.setHeader && isFn(stream.abort)\n}\n\nvar destroyer = function (stream, reading, writing, callback) {\n callback = once(callback)\n\n var closed = false\n stream.on('close', function () {\n closed = true\n })\n\n eos(stream, {readable: reading, writable: writing}, function (err) {\n if (err) return callback(err)\n closed = true\n callback()\n })\n\n var destroyed = false\n return function (err) {\n if (closed) return\n if (destroyed) return\n destroyed = true\n\n if (isFS(stream)) return stream.close(noop) // use close for fs streams to avoid fd leaks\n if (isRequest(stream)) return stream.abort() // request.destroy just do .end - .abort is what we want\n\n if (isFn(stream.destroy)) return stream.destroy()\n\n callback(err || new Error('stream was destroyed'))\n }\n}\n\nvar call = function (fn) {\n fn()\n}\n\nvar pipe = function (from, to) {\n return from.pipe(to)\n}\n\nvar pump = function () {\n var streams = Array.prototype.slice.call(arguments)\n var callback = isFn(streams[streams.length - 1] || noop) && streams.pop() || noop\n\n if (Array.isArray(streams[0])) streams = streams[0]\n if (streams.length < 2) throw new Error('pump requires two streams per minimum')\n\n var error\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1\n var writing = i > 0\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err\n if (err) destroys.forEach(call)\n if (reading) return\n destroys.forEach(call)\n callback(error)\n })\n })\n\n return streams.reduce(pipe)\n}\n\nmodule.exports = pump\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\n'use strict';\n\n// If obj.hasOwnProperty has been overridden, then calling\n// obj.hasOwnProperty(prop) will break.\n// See: https://github.com/joyent/node/issues/1707\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nmodule.exports = function(qs, sep, eq, options) {\n sep = sep || '&';\n eq = eq || '=';\n var obj = {};\n\n if (typeof qs !== 'string' || qs.length === 0) {\n return obj;\n }\n\n var regexp = /\\+/g;\n qs = qs.split(sep);\n\n var maxKeys = 1000;\n if (options && typeof options.maxKeys === 'number') {\n maxKeys = options.maxKeys;\n }\n\n var len = qs.length;\n // maxKeys <= 0 means that we should not limit keys count\n if (maxKeys > 0 && len > maxKeys) {\n len = maxKeys;\n }\n\n for (var i = 0; i < len; ++i) {\n var x = qs[i].replace(regexp, '%20'),\n idx = x.indexOf(eq),\n kstr, vstr, k, v;\n\n if (idx >= 0) {\n kstr = x.substr(0, idx);\n vstr = x.substr(idx + 1);\n } else {\n kstr = x;\n vstr = '';\n }\n\n k = decodeURIComponent(kstr);\n v = decodeURIComponent(vstr);\n\n if (!hasOwnProperty(obj, k)) {\n obj[k] = v;\n } else if (Array.isArray(obj[k])) {\n obj[k].push(v);\n } else {\n obj[k] = [obj[k], v];\n }\n }\n\n return obj;\n};\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\n'use strict';\n\nvar stringifyPrimitive = function(v) {\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 isFinite(v) ? v : '';\n\n default:\n return '';\n }\n};\n\nmodule.exports = function(obj, sep, eq, name) {\n sep = sep || '&';\n eq = eq || '=';\n if (obj === null) {\n obj = undefined;\n }\n\n if (typeof obj === 'object') {\n return Object.keys(obj).map(function(k) {\n var ks = encodeURIComponent(stringifyPrimitive(k)) + eq;\n if (Array.isArray(obj[k])) {\n return obj[k].map(function(v) {\n return ks + encodeURIComponent(stringifyPrimitive(v));\n }).join(sep);\n } else {\n return ks + encodeURIComponent(stringifyPrimitive(obj[k]));\n }\n }).join(sep);\n\n }\n\n if (!name) return '';\n return encodeURIComponent(stringifyPrimitive(name)) + eq +\n encodeURIComponent(stringifyPrimitive(obj));\n};\n","'use strict';\n\nexports.decode = exports.parse = require('./decode');\nexports.encode = exports.stringify = require('./encode');\n","/*! queue-microtask. MIT License. Feross Aboukhadijeh */\nlet promise\n\nmodule.exports = typeof queueMicrotask === 'function'\n ? queueMicrotask.bind(typeof window !== 'undefined' ? window : global)\n // reuse resolved promise, and allocate it lazily\n : cb => (promise || (promise = Promise.resolve()))\n .then(cb)\n .catch(err => setTimeout(() => { throw err }, 0))\n","module.exports = typeof queueMicrotask === 'function' ? queueMicrotask : (fn) => Promise.resolve().then(fn)\n","var iterate = function (list) {\n var offset = 0\n return function () {\n if (offset === list.length) return null\n\n var len = list.length - offset\n var i = (Math.random() * len) | 0\n var el = list[offset + i]\n\n var tmp = list[offset]\n list[offset] = el\n list[offset + i] = tmp\n offset++\n\n return el\n }\n}\n\nmodule.exports = iterate\n","'use strict'\n\n// limit of Crypto.getRandomValues()\n// https://developer.mozilla.org/en-US/docs/Web/API/Crypto/getRandomValues\nvar MAX_BYTES = 65536\n\n// Node supports requesting up to this number of bytes\n// https://github.com/nodejs/node/blob/master/lib/internal/crypto/random.js#L48\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\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\n var bytes = Buffer.allocUnsafe(size)\n\n if (size > 0) { // getRandomValues fails on IE if size == 0\n if (size > MAX_BYTES) { // 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}\n","'use strict'\n\nfunction oldBrowser () {\n throw new Error('secure random number generation not supported by this browser\\nuse chrome, FireFox or Internet Explorer 11')\n}\nvar safeBuffer = require('safe-buffer')\nvar randombytes = require('randombytes')\nvar Buffer = safeBuffer.Buffer\nvar kBufferMaxLength = safeBuffer.kMaxLength\nvar crypto = global.crypto || global.msCrypto\nvar kMaxUint32 = Math.pow(2, 32) - 1\nfunction assertOffset (offset, length) {\n if (typeof offset !== 'number' || offset !== offset) { // eslint-disable-line no-self-compare\n throw new TypeError('offset must be a number')\n }\n\n if (offset > kMaxUint32 || offset < 0) {\n throw new TypeError('offset must be a uint32')\n }\n\n if (offset > kBufferMaxLength || offset > length) {\n throw new RangeError('offset out of range')\n }\n}\n\nfunction assertSize (size, offset, length) {\n if (typeof size !== 'number' || size !== size) { // eslint-disable-line no-self-compare\n throw new TypeError('size must be a number')\n }\n\n if (size > kMaxUint32 || size < 0) {\n throw new TypeError('size must be a uint32')\n }\n\n if (size + offset > length || size > kBufferMaxLength) {\n throw new RangeError('buffer too small')\n }\n}\nif ((crypto && crypto.getRandomValues) || !process.browser) {\n exports.randomFill = randomFill\n exports.randomFillSync = randomFillSync\n} else {\n exports.randomFill = oldBrowser\n exports.randomFillSync = oldBrowser\n}\nfunction randomFill (buf, offset, size, cb) {\n if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n }\n\n if (typeof offset === 'function') {\n cb = offset\n offset = 0\n size = buf.length\n } else if (typeof size === 'function') {\n cb = size\n size = buf.length - offset\n } else if (typeof cb !== 'function') {\n throw new TypeError('\"cb\" argument must be a function')\n }\n assertOffset(offset, buf.length)\n assertSize(size, offset, buf.length)\n return actualFill(buf, offset, size, cb)\n}\n\nfunction actualFill (buf, offset, size, cb) {\n if (process.browser) {\n var ourBuf = buf.buffer\n var uint = new Uint8Array(ourBuf, offset, size)\n crypto.getRandomValues(uint)\n if (cb) {\n process.nextTick(function () {\n cb(null, buf)\n })\n return\n }\n return buf\n }\n if (cb) {\n randombytes(size, function (err, bytes) {\n if (err) {\n return cb(err)\n }\n bytes.copy(buf, offset)\n cb(null, buf)\n })\n return\n }\n var bytes = randombytes(size)\n bytes.copy(buf, offset)\n return buf\n}\nfunction randomFillSync (buf, offset, size) {\n if (typeof offset === 'undefined') {\n offset = 0\n }\n if (!Buffer.isBuffer(buf) && !(buf instanceof global.Uint8Array)) {\n throw new TypeError('\"buf\" argument must be a Buffer or Uint8Array')\n }\n\n assertOffset(offset, buf.length)\n\n if (size === undefined) size = buf.length - offset\n\n assertSize(size, offset, buf.length)\n\n return actualFill(buf, offset, size)\n}\n","/*!\n * range-parser\n * Copyright(c) 2012-2014 TJ Holowaychuk\n * Copyright(c) 2015-2016 Douglas Christopher Wilson\n * MIT Licensed\n */\n\n'use strict'\n\n/**\n * Module exports.\n * @public\n */\n\nmodule.exports = rangeParser\n\n/**\n * Parse \"Range\" header `str` relative to the given file `size`.\n *\n * @param {Number} size\n * @param {String} str\n * @param {Object} [options]\n * @return {Array}\n * @public\n */\n\nfunction rangeParser (size, str, options) {\n if (typeof str !== 'string') {\n throw new TypeError('argument str must be a string')\n }\n\n var index = str.indexOf('=')\n\n if (index === -1) {\n return -2\n }\n\n // split the range string\n var arr = str.slice(index + 1).split(',')\n var ranges = []\n\n // add ranges type\n ranges.type = str.slice(0, index)\n\n // parse all ranges\n for (var i = 0; i < arr.length; i++) {\n var range = arr[i].split('-')\n var start = parseInt(range[0], 10)\n var end = parseInt(range[1], 10)\n\n // -nnn\n if (isNaN(start)) {\n start = size - end\n end = size - 1\n // nnn-\n } else if (isNaN(end)) {\n end = size - 1\n }\n\n // limit last-byte-pos to current length\n if (end > size - 1) {\n end = size - 1\n }\n\n // invalid or unsatisifiable\n if (isNaN(start) || isNaN(end) || start > end || start < 0) {\n continue\n }\n\n // add range\n ranges.push({\n start: start,\n end: end\n })\n }\n\n if (ranges.length < 1) {\n // unsatisifiable\n return -1\n }\n\n return options && options.combine\n ? combineRanges(ranges)\n : ranges\n}\n\n/**\n * Combine overlapping & adjacent ranges.\n * @private\n */\n\nfunction combineRanges (ranges) {\n var ordered = ranges.map(mapWithIndex).sort(sortByRangeStart)\n\n for (var j = 0, i = 1; i < ordered.length; i++) {\n var range = ordered[i]\n var current = ordered[j]\n\n if (range.start > current.end + 1) {\n // next range\n ordered[++j] = range\n } else if (range.end > current.end) {\n // extend range\n current.end = range.end\n current.index = Math.min(current.index, range.index)\n }\n }\n\n // trim ordered array\n ordered.length = j + 1\n\n // generate combined range\n var combined = ordered.sort(sortByRangeIndex).map(mapWithoutIndex)\n\n // copy ranges type\n combined.type = ranges.type\n\n return combined\n}\n\n/**\n * Map function to add index value to ranges.\n * @private\n */\n\nfunction mapWithIndex (range, index) {\n return {\n start: range.start,\n end: range.end,\n index: index\n }\n}\n\n/**\n * Map function to remove index value from ranges.\n * @private\n */\n\nfunction mapWithoutIndex (range) {\n return {\n start: range.start,\n end: range.end\n }\n}\n\n/**\n * Sort function to sort ranges by index.\n * @private\n */\n\nfunction sortByRangeIndex (a, b) {\n return a.index - b.index\n}\n\n/**\n * Sort function to sort ranges by start position.\n * @private\n */\n\nfunction sortByRangeStart (a, b) {\n return a.start - b.start\n}\n","/*\nInstance of writable stream.\n\ncall .get(length) or .discard(length) to get a stream (relative to the last end)\n\nemits 'stalled' once everything is written\n\n*/\nconst { Writable, PassThrough } = require('readable-stream')\n\nclass RangeSliceStream extends Writable {\n constructor (offset, opts = {}) {\n super(opts)\n\n this.destroyed = false\n this._queue = []\n this._position = offset || 0\n this._cb = null\n this._buffer = null\n this._out = null\n }\n\n _write (chunk, encoding, cb) {\n let drained = true\n\n while (true) {\n if (this.destroyed) {\n return\n }\n\n // Wait for more queue entries\n if (this._queue.length === 0) {\n this._buffer = chunk\n this._cb = cb\n return\n }\n\n this._buffer = null\n var currRange = this._queue[0]\n // Relative to the start of chunk, what data do we need?\n const writeStart = Math.max(currRange.start - this._position, 0)\n const writeEnd = currRange.end - this._position\n\n // Check if we need to throw it all away\n if (writeStart >= chunk.length) {\n this._position += chunk.length\n return cb(null)\n }\n\n // Check if we need to use it all\n let toWrite\n if (writeEnd > chunk.length) {\n this._position += chunk.length\n if (writeStart === 0) {\n toWrite = chunk\n } else {\n toWrite = chunk.slice(writeStart)\n }\n drained = currRange.stream.write(toWrite) && drained\n break\n }\n\n this._position += writeEnd\n\n toWrite = (writeStart === 0 && writeEnd === chunk.length)\n ? chunk\n : chunk.slice(writeStart, writeEnd)\n\n drained = currRange.stream.write(toWrite) && drained\n if (currRange.last) {\n currRange.stream.end()\n }\n chunk = chunk.slice(writeEnd)\n this._queue.shift()\n }\n\n if (drained) {\n cb(null)\n } else {\n currRange.stream.once('drain', cb.bind(null, null))\n }\n }\n\n slice (ranges) {\n if (this.destroyed) return null\n\n if (!Array.isArray(ranges)) ranges = [ranges]\n\n const str = new PassThrough()\n\n ranges.forEach((range, i) => {\n this._queue.push({\n start: range.start,\n end: range.end,\n stream: str,\n last: i === ranges.length - 1\n })\n })\n\n if (this._buffer) {\n this._write(this._buffer, null, this._cb)\n }\n\n return str\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n\n if (err) this.emit('error', err)\n }\n}\n\nmodule.exports = RangeSliceStream\n","\"use strict\";\n\n// Based on RC4 algorithm, as described in\n// http://en.wikipedia.org/wiki/RC4\n\nfunction isInteger(n) {\n return parseInt(n, 10) === n;\n}\n\nfunction createRC4(N) {\n function identityPermutation() {\n var s = new Array(N);\n for (var i = 0; i < N; i++) {\n s[i] = i;\n }\n return s;\n }\n\n // :: string | array integer -> array integer\n function seed(key) {\n if (key === undefined) {\n key = new Array(N);\n for (var k = 0; k < N; k++) {\n key[k] = Math.floor(Math.random() * N);\n }\n } else if (typeof key === \"string\") {\n // to string\n key = \"\" + key;\n key = key.split(\"\").map(function (c) { return c.charCodeAt(0) % N; });\n } else if (Array.isArray(key)) {\n if (!key.every(function (v) {\n return typeof v === \"number\" && v === (v | 0);\n })) {\n throw new TypeError(\"invalid seed key specified: not array of integers\");\n }\n } else {\n throw new TypeError(\"invalid seed key specified\");\n }\n\n var keylen = key.length;\n\n // resed state\n var s = identityPermutation();\n\n var j = 0;\n for (var i = 0; i < N; i++) {\n j = (j + s[i] + key[i % keylen]) % N;\n var tmp = s[i];\n s[i] = s[j];\n s[j] = tmp;\n }\n\n return s;\n }\n\n /* eslint-disable no-shadow */\n function RC4(key) {\n this.s = seed(key);\n this.i = 0;\n this.j = 0;\n }\n /* eslint-enable no-shadow */\n\n RC4.prototype.randomNative = function () {\n this.i = (this.i + 1) % N;\n this.j = (this.j + this.s[this.i]) % N;\n\n var tmp = this.s[this.i];\n this.s[this.i] = this.s[this.j];\n this.s[this.j] = tmp;\n\n var k = this.s[(this.s[this.i] + this.s[this.j]) % N];\n\n return k;\n };\n\n RC4.prototype.randomUInt32 = function () {\n var a = this.randomByte();\n var b = this.randomByte();\n var c = this.randomByte();\n var d = this.randomByte();\n\n return ((a * 256 + b) * 256 + c) * 256 + d;\n };\n\n RC4.prototype.randomFloat = function () {\n return this.randomUInt32() / 0x100000000;\n };\n\n RC4.prototype.random = function () {\n var a;\n var b;\n\n if (arguments.length === 1) {\n a = 0;\n b = arguments[0];\n } else if (arguments.length === 2) {\n a = arguments[0];\n b = arguments[1];\n } else {\n throw new TypeError(\"random takes one or two integer arguments\");\n }\n\n if (!isInteger(a) || !isInteger(b)) {\n throw new TypeError(\"random takes one or two integer arguments\");\n }\n\n return a + this.randomUInt32() % (b - a + 1);\n };\n\n RC4.prototype.currentState = function () {\n return {\n i: this.i,\n j: this.j,\n s: this.s.slice(), // copy\n };\n };\n\n RC4.prototype.setState = function (state) {\n var s = state.s;\n var i = state.i;\n var j = state.j;\n\n /* eslint-disable yoda */\n if (!(i === (i | 0) && 0 <= i && i < N)) {\n throw new Error(\"state.i should be integer [0, \" + (N - 1) + \"]\");\n }\n\n if (!(j === (j | 0) && 0 <= j && j < N)) {\n throw new Error(\"state.j should be integer [0, \" + (N - 1) + \"]\");\n }\n /* eslint-enable yoda */\n\n // check length\n if (!Array.isArray(s) || s.length !== N) {\n throw new Error(\"state should be array of length \" + N);\n }\n\n // check that all params are there\n for (var k = 0; k < N; k++) {\n if (s.indexOf(k) === -1) {\n throw new Error(\"state should be permutation of 0..\" + (N - 1) + \": \" + k + \" is missing\");\n }\n }\n\n this.i = i;\n this.j = j;\n this.s = s.slice(); // assign copy\n };\n\n return RC4;\n}\n\nvar RC4 = createRC4(256);\nRC4.prototype.randomByte = RC4.prototype.randomNative;\n\nvar RC4small = createRC4(16);\nRC4small.prototype.randomByte = function () {\n var a = this.randomNative();\n var b = this.randomNative();\n\n return a * 16 + b;\n};\n\nvar ordA = \"a\".charCodeAt(0);\nvar ord0 = \"0\".charCodeAt(0);\n\nfunction toHex(n) {\n return n < 10 ? String.fromCharCode(ord0 + n) : String.fromCharCode(ordA + n - 10);\n}\n\nfunction fromHex(c) {\n return parseInt(c, 16);\n}\n\nRC4small.prototype.currentStateString = function () {\n var state = this.currentState();\n\n var i = toHex(state.i);\n var j = toHex(state.j);\n\n var res = i + j + state.s.map(toHex).join(\"\");\n return res;\n};\n\nRC4small.prototype.setStateString = function (stateString) {\n if (!stateString.match(/^[0-9a-f]{18}$/)) {\n throw new TypeError(\"RC4small stateString should be 18 hex character string\");\n }\n\n var i = fromHex(stateString[0]);\n var j = fromHex(stateString[1]);\n var s = stateString.split(\"\").slice(2).map(fromHex);\n\n this.setState({\n i: i,\n j: j,\n s: s,\n });\n};\n\nRC4.RC4small = RC4small;\n\nmodule.exports = RC4;\n","'use strict';\n\nfunction _inheritsLoose(subClass, superClass) { subClass.prototype = Object.create(superClass.prototype); subClass.prototype.constructor = subClass; subClass.__proto__ = superClass; }\n\nvar codes = {};\n\nfunction createErrorType(code, message, Base) {\n if (!Base) {\n Base = Error;\n }\n\n function getMessage(arg1, arg2, arg3) {\n if (typeof message === 'string') {\n return message;\n } else {\n return message(arg1, arg2, arg3);\n }\n }\n\n var NodeError =\n /*#__PURE__*/\n function (_Base) {\n _inheritsLoose(NodeError, _Base);\n\n function NodeError(arg1, arg2, arg3) {\n return _Base.call(this, getMessage(arg1, arg2, arg3)) || this;\n }\n\n return NodeError;\n }(Base);\n\n NodeError.prototype.name = Base.name;\n NodeError.prototype.code = code;\n codes[code] = NodeError;\n} // https://github.com/nodejs/node/blob/v10.8.0/lib/internal/errors.js\n\n\nfunction oneOf(expected, thing) {\n if (Array.isArray(expected)) {\n var len = expected.length;\n expected = expected.map(function (i) {\n return String(i);\n });\n\n if (len > 2) {\n return \"one of \".concat(thing, \" \").concat(expected.slice(0, len - 1).join(', '), \", or \") + expected[len - 1];\n } else if (len === 2) {\n return \"one of \".concat(thing, \" \").concat(expected[0], \" or \").concat(expected[1]);\n } else {\n return \"of \".concat(thing, \" \").concat(expected[0]);\n }\n } else {\n return \"of \".concat(thing, \" \").concat(String(expected));\n }\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/startsWith\n\n\nfunction startsWith(str, search, pos) {\n return str.substr(!pos || pos < 0 ? 0 : +pos, search.length) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/endsWith\n\n\nfunction endsWith(str, search, this_len) {\n if (this_len === undefined || this_len > str.length) {\n this_len = str.length;\n }\n\n return str.substring(this_len - search.length, this_len) === search;\n} // https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/String/includes\n\n\nfunction includes(str, search, start) {\n if (typeof start !== 'number') {\n start = 0;\n }\n\n if (start + search.length > str.length) {\n return false;\n } else {\n return str.indexOf(search, start) !== -1;\n }\n}\n\ncreateErrorType('ERR_INVALID_OPT_VALUE', function (name, value) {\n return 'The value \"' + value + '\" is invalid for option \"' + name + '\"';\n}, TypeError);\ncreateErrorType('ERR_INVALID_ARG_TYPE', function (name, expected, actual) {\n // determiner: 'must be' or 'must not be'\n var determiner;\n\n if (typeof expected === 'string' && startsWith(expected, 'not ')) {\n determiner = 'must not be';\n expected = expected.replace(/^not /, '');\n } else {\n determiner = 'must be';\n }\n\n var msg;\n\n if (endsWith(name, ' argument')) {\n // For cases like 'first argument'\n msg = \"The \".concat(name, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n } else {\n var type = includes(name, '.') ? 'property' : 'argument';\n msg = \"The \\\"\".concat(name, \"\\\" \").concat(type, \" \").concat(determiner, \" \").concat(oneOf(expected, 'type'));\n }\n\n msg += \". Received type \".concat(typeof actual);\n return msg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_PUSH_AFTER_EOF', 'stream.push() after EOF');\ncreateErrorType('ERR_METHOD_NOT_IMPLEMENTED', function (name) {\n return 'The ' + name + ' method is not implemented';\n});\ncreateErrorType('ERR_STREAM_PREMATURE_CLOSE', 'Premature close');\ncreateErrorType('ERR_STREAM_DESTROYED', function (name) {\n return 'Cannot call ' + name + ' after a stream was destroyed';\n});\ncreateErrorType('ERR_MULTIPLE_CALLBACK', 'Callback called multiple times');\ncreateErrorType('ERR_STREAM_CANNOT_PIPE', 'Cannot pipe, not readable');\ncreateErrorType('ERR_STREAM_WRITE_AFTER_END', 'write after end');\ncreateErrorType('ERR_STREAM_NULL_VALUES', 'May not write null values to stream', TypeError);\ncreateErrorType('ERR_UNKNOWN_ENCODING', function (arg) {\n return 'Unknown encoding: ' + arg;\n}, TypeError);\ncreateErrorType('ERR_STREAM_UNSHIFT_AFTER_END_EVENT', 'stream.unshift() after end event');\nmodule.exports.codes = codes;\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 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 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\nvar Readable = require('./_stream_readable');\n\nvar Writable = require('./_stream_writable');\n\nrequire('inherits')(Duplex, Readable);\n\n{\n // Allow the keys array to be GC'ed.\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 this.allowHalfOpen = true;\n\n if (options) {\n if (options.readable === false) this.readable = false;\n if (options.writable === false) this.writable = false;\n\n if (options.allowHalfOpen === false) {\n this.allowHalfOpen = false;\n this.once('end', onend);\n }\n }\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});\nObject.defineProperty(Duplex.prototype, 'writableBuffer', {\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 && this._writableState.getBuffer();\n }\n});\nObject.defineProperty(Duplex.prototype, 'writableLength', {\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.length;\n }\n}); // the no-half-open enforcer\n\nfunction onend() {\n // If the writable side ended, then we're ok.\n if (this._writableState.ended) return; // no more data can be written.\n // But allow more writes to happen in this tick.\n\n process.nextTick(onEndNT, this);\n}\n\nfunction onEndNT(self) {\n self.end();\n}\n\nObject.defineProperty(Duplex.prototype, 'destroyed', {\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 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});","// 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 passthrough stream.\n// basically just the most minimal sort of Transform stream.\n// Every written chunk gets output as-is.\n'use strict';\n\nmodule.exports = PassThrough;\n\nvar Transform = require('./_stream_transform');\n\nrequire('inherits')(PassThrough, Transform);\n\nfunction PassThrough(options) {\n if (!(this instanceof PassThrough)) return new PassThrough(options);\n Transform.call(this, options);\n}\n\nPassThrough.prototype._transform = function (chunk, encoding, cb) {\n cb(null, chunk);\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\nmodule.exports = Readable;\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\nvar Buffer = require('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 debugUtil = require('util');\n\nvar debug;\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/buffer_list');\n\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\n\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_STREAM_PUSH_AFTER_EOF = _require$codes.ERR_STREAM_PUSH_AFTER_EOF,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_STREAM_UNSHIFT_AFTER_END_EVENT = _require$codes.ERR_STREAM_UNSHIFT_AFTER_END_EVENT; // Lazy loaded to improve the startup performance.\n\n\nvar StringDecoder;\nvar createReadableStreamAsyncIterator;\nvar from;\n\nrequire('inherits')(Readable, Stream);\n\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\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 (Array.isArray(emitter._events[event])) emitter._events[event].unshift(fn);else emitter._events[event] = [fn, emitter._events[event]];\n}\n\nfunction ReadableState(options, stream, isDuplex) {\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 if (typeof isDuplex !== 'boolean') 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 this.highWaterMark = getHighWaterMark(this, options, 'readableHighWaterMark', isDuplex); // 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;\n this.paused = true; // Should close be emitted on destroy. Defaults to true.\n\n this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'end' (and potentially 'finish')\n\n this.autoDestroy = !!options.autoDestroy; // 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); // Checking for a Stream.Duplex instance is faster here instead of inside\n // the ReadableState constructor, at least with V8 6.5\n\n var isDuplex = this instanceof Duplex;\n this._readableState = new ReadableState(options, this, isDuplex); // 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 // 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 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 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 debug('readableAddChunk', chunk);\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 errorOrDestroy(stream, 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) errorOrDestroy(stream, new ERR_STREAM_UNSHIFT_AFTER_END_EVENT());else addChunk(stream, state, chunk, true);\n } else if (state.ended) {\n errorOrDestroy(stream, new ERR_STREAM_PUSH_AFTER_EOF());\n } else if (state.destroyed) {\n return false;\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 maybeReadMore(stream, state);\n }\n } // We can push more data if we are below the highWaterMark.\n // Also, if we have no data yet, we can stand some more bytes.\n // This is to work around cases where hwm=0, such as the repl.\n\n\n return !state.ended && (state.length < state.highWaterMark || state.length === 0);\n}\n\nfunction addChunk(stream, state, chunk, addToFront) {\n if (state.flowing && state.length === 0 && !state.sync) {\n state.awaitDrain = 0;\n stream.emit('data', chunk);\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 ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer', 'Uint8Array'], chunk);\n }\n\n return er;\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 var decoder = new StringDecoder(enc);\n this._readableState.decoder = decoder; // If setEncoding(null), decoder.encoding equals utf8\n\n this._readableState.encoding = this._readableState.decoder.encoding; // Iterate over current buffer to convert already stored Buffers:\n\n var p = this._readableState.buffer.head;\n var content = '';\n\n while (p !== null) {\n content += decoder.write(p.data);\n p = p.next;\n }\n\n this._readableState.buffer.clear();\n\n if (content !== '') this._readableState.buffer.push(content);\n this._readableState.length = content.length;\n return this;\n}; // Don't raise the hwm > 1GB\n\n\nvar MAX_HWM = 0x40000000;\n\nfunction computeNewHighWaterMark(n) {\n if (n >= MAX_HWM) {\n // TODO(ronag): Throw ERR_VALUE_OUT_OF_RANGE.\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.highWaterMark !== 0 ? state.length >= state.highWaterMark : state.length > 0) || 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 = state.length <= state.highWaterMark;\n n = 0;\n } else {\n state.length -= n;\n state.awaitDrain = 0;\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 debug('onEofChunk');\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;\n\n if (state.sync) {\n // if we are sync, wait until next tick to emit the data.\n // Otherwise we risk emitting data in the flow()\n // the readable code triggers during a read() call\n emitReadable(stream);\n } else {\n // emit 'readable' now to make sure it gets picked up.\n state.needReadable = false;\n\n if (!state.emittedReadable) {\n state.emittedReadable = true;\n emitReadable_(stream);\n }\n }\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 debug('emitReadable', state.needReadable, state.emittedReadable);\n state.needReadable = false;\n\n if (!state.emittedReadable) {\n debug('emitReadable', state.flowing);\n state.emittedReadable = true;\n process.nextTick(emitReadable_, stream);\n }\n}\n\nfunction emitReadable_(stream) {\n var state = stream._readableState;\n debug('emitReadable_', state.destroyed, state.length, state.ended);\n\n if (!state.destroyed && (state.length || state.ended)) {\n stream.emit('readable');\n state.emittedReadable = false;\n } // The stream needs another readable event if\n // 1. It is not flowing, as the flow mechanism will take\n // care of it.\n // 2. It is not ended.\n // 3. It is below the highWaterMark, so we can schedule\n // another readable later.\n\n\n state.needReadable = !state.flowing && !state.ended && state.length <= state.highWaterMark;\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 process.nextTick(maybeReadMore_, stream, state);\n }\n}\n\nfunction maybeReadMore_(stream, state) {\n // Attempt to read more data if we should.\n //\n // The conditions for reading more data are (one of):\n // - Not enough data buffered (state.length < state.highWaterMark). The loop\n // is responsible for filling the buffer with enough data if such data\n // is available. If highWaterMark is 0 and we are not in the flowing mode\n // we should _not_ attempt to buffer any extra data. We'll get more data\n // when the stream consumer calls read() instead.\n // - No data in the buffer, and the stream is in flowing mode. In this mode\n // the loop below is responsible for ensuring read() is called. Failing to\n // call read here would abort the flow and there's no other mechanism for\n // continuing the flow if the stream consumer has just subscribed to the\n // 'data' event.\n //\n // In addition to the above conditions to keep reading data, the following\n // conditions prevent the data from being read:\n // - The stream has ended (state.ended).\n // - There is already a pending 'read' operation (state.reading). This is a\n // case where the the stream has called the implementation defined _read()\n // method, but they are processing the call asynchronously and have _not_\n // called push() with new data. In this case we skip performing more\n // read()s. The execution ends in this method again after the _read() ends\n // up calling push() with more data.\n while (!state.reading && !state.ended && (state.length < state.highWaterMark || state.flowing && state.length === 0)) {\n var len = state.length;\n debug('maybeReadMore read 0');\n stream.read(0);\n if (len === state.length) // didn't get any data, stop spinning.\n break;\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 errorOrDestroy(this, new ERR_METHOD_NOT_IMPLEMENTED('_read()'));\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) process.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 }\n\n src.on('data', ondata);\n\n function ondata(chunk) {\n debug('ondata');\n var ret = dest.write(chunk);\n debug('dest.write', ret);\n\n if (ret === false) {\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', state.awaitDrain);\n state.awaitDrain++;\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) errorOrDestroy(dest, 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 pipeOnDrainFunctionResult() {\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, {\n hasUnpiped: false\n });\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 var state = this._readableState;\n\n if (ev === 'data') {\n // update readableListening so that resume() may be a no-op\n // a few lines down. This is needed to support once('readable').\n state.readableListening = this.listenerCount('readable') > 0; // Try start flowing on next tick if stream isn't explicitly paused\n\n if (state.flowing !== false) this.resume();\n } else if (ev === 'readable') {\n if (!state.endEmitted && !state.readableListening) {\n state.readableListening = state.needReadable = true;\n state.flowing = false;\n state.emittedReadable = false;\n debug('on readable', state.length, state.reading);\n\n if (state.length) {\n emitReadable(this);\n } else if (!state.reading) {\n process.nextTick(nReadingNextTick, this);\n }\n }\n }\n\n return res;\n};\n\nReadable.prototype.addListener = Readable.prototype.on;\n\nReadable.prototype.removeListener = function (ev, fn) {\n var res = Stream.prototype.removeListener.call(this, ev, fn);\n\n if (ev === 'readable') {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n\n return res;\n};\n\nReadable.prototype.removeAllListeners = function (ev) {\n var res = Stream.prototype.removeAllListeners.apply(this, arguments);\n\n if (ev === 'readable' || ev === undefined) {\n // We need to check if there is someone still listening to\n // readable and reset the state. However this needs to happen\n // after readable has been emitted but before I/O (nextTick) to\n // support once('readable', fn) cycles. This means that calling\n // resume within the same tick will have no\n // effect.\n process.nextTick(updateReadableListening, this);\n }\n\n return res;\n};\n\nfunction updateReadableListening(self) {\n var state = self._readableState;\n state.readableListening = self.listenerCount('readable') > 0;\n\n if (state.resumeScheduled && !state.paused) {\n // flowing needs to be set to true now, otherwise\n // the upcoming resume will not flow.\n state.flowing = true; // crude way to check if we should resume\n } else if (self.listenerCount('data') > 0) {\n self.resume();\n }\n}\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'); // we flow only if there is no one listening\n // for readable, but we still have to call\n // resume()\n\n state.flowing = !state.readableListening;\n resume(this, state);\n }\n\n state.paused = false;\n return this;\n};\n\nfunction resume(stream, state) {\n if (!state.resumeScheduled) {\n state.resumeScheduled = true;\n process.nextTick(resume_, stream, state);\n }\n}\n\nfunction resume_(stream, state) {\n debug('resume', state.reading);\n\n if (!state.reading) {\n stream.read(0);\n }\n\n state.resumeScheduled = false;\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 (this._readableState.flowing !== false) {\n debug('pause');\n this._readableState.flowing = false;\n this.emit('pause');\n }\n\n this._readableState.paused = true;\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 ;\n }\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 methodWrap(method) {\n return function methodWrapReturnFunction() {\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\nif (typeof Symbol === 'function') {\n Readable.prototype[Symbol.asyncIterator] = function () {\n if (createReadableStreamAsyncIterator === undefined) {\n createReadableStreamAsyncIterator = require('./internal/streams/async_iterator');\n }\n\n return createReadableStreamAsyncIterator(this);\n };\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});\nObject.defineProperty(Readable.prototype, 'readableBuffer', {\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 && this._readableState.buffer;\n }\n});\nObject.defineProperty(Readable.prototype, 'readableFlowing', {\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.flowing;\n },\n set: function set(state) {\n if (this._readableState) {\n this._readableState.flowing = state;\n }\n }\n}); // exposed for testing purposes only.\n\nReadable._fromList = fromList;\nObject.defineProperty(Readable.prototype, 'readableLength', {\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.length;\n }\n}); // 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.first();else ret = state.buffer.concat(state.length);\n state.buffer.clear();\n } else {\n // read part of list\n ret = state.buffer.consume(n, state.decoder);\n }\n return ret;\n}\n\nfunction endReadable(stream) {\n var state = stream._readableState;\n debug('endReadable', state.endEmitted);\n\n if (!state.endEmitted) {\n state.ended = true;\n process.nextTick(endReadableNT, state, stream);\n }\n}\n\nfunction endReadableNT(state, stream) {\n debug('endReadableNT', state.endEmitted, state.length); // Check that we didn't get one last unshift.\n\n if (!state.endEmitted && state.length === 0) {\n state.endEmitted = true;\n stream.readable = false;\n stream.emit('end');\n\n if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the writable side is ready for autoDestroy as well\n var wState = stream._writableState;\n\n if (!wState || wState.autoDestroy && wState.finished) {\n stream.destroy();\n }\n }\n }\n}\n\nif (typeof Symbol === 'function') {\n Readable.from = function (iterable, opts) {\n if (from === undefined) {\n from = require('./internal/streams/from');\n }\n\n return from(Readable, iterable, opts);\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}","// 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 _require$codes = require('../errors').codes,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_TRANSFORM_ALREADY_TRANSFORMING = _require$codes.ERR_TRANSFORM_ALREADY_TRANSFORMING,\n ERR_TRANSFORM_WITH_LENGTH_0 = _require$codes.ERR_TRANSFORM_WITH_LENGTH_0;\n\nvar Duplex = require('./_stream_duplex');\n\nrequire('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 === null) {\n return this.emit('error', new ERR_MULTIPLE_CALLBACK());\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' && !this._readableState.destroyed) {\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 cb(new ERR_METHOD_NOT_IMPLEMENTED('_transform()'));\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.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 Duplex.prototype._destroy.call(this, err, function (err2) {\n cb(err2);\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); // TODO(BridgeAR): Write a test for these two error cases\n // 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 ERR_TRANSFORM_WITH_LENGTH_0();\n if (stream._transformState.transforming) throw new ERR_TRANSFORM_ALREADY_TRANSFORMING();\n return stream.push(null);\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 bit simpler than readable streams.\n// Implement an async ._write(chunk, encoding, cb), and it'll handle all\n// the drain event emission and buffering.\n'use strict';\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 Duplex;\n/**/\n\nWritable.WritableState = WritableState;\n/**/\n\nvar internalUtil = {\n deprecate: require('util-deprecate')\n};\n/**/\n\n/**/\n\nvar Stream = require('./internal/streams/stream');\n/**/\n\n\nvar Buffer = require('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\nvar destroyImpl = require('./internal/streams/destroy');\n\nvar _require = require('./internal/streams/state'),\n getHighWaterMark = _require.getHighWaterMark;\n\nvar _require$codes = require('../errors').codes,\n ERR_INVALID_ARG_TYPE = _require$codes.ERR_INVALID_ARG_TYPE,\n ERR_METHOD_NOT_IMPLEMENTED = _require$codes.ERR_METHOD_NOT_IMPLEMENTED,\n ERR_MULTIPLE_CALLBACK = _require$codes.ERR_MULTIPLE_CALLBACK,\n ERR_STREAM_CANNOT_PIPE = _require$codes.ERR_STREAM_CANNOT_PIPE,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED,\n ERR_STREAM_NULL_VALUES = _require$codes.ERR_STREAM_NULL_VALUES,\n ERR_STREAM_WRITE_AFTER_END = _require$codes.ERR_STREAM_WRITE_AFTER_END,\n ERR_UNKNOWN_ENCODING = _require$codes.ERR_UNKNOWN_ENCODING;\n\nvar errorOrDestroy = destroyImpl.errorOrDestroy;\n\nrequire('inherits')(Writable, Stream);\n\nfunction nop() {}\n\nfunction WritableState(options, stream, isDuplex) {\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 // e.g. options.readableObjectMode vs. options.writableObjectMode, etc.\n\n if (typeof isDuplex !== 'boolean') 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 this.highWaterMark = getHighWaterMark(this, options, 'writableHighWaterMark', isDuplex); // 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; // Should close be emitted on destroy. Defaults to true.\n\n this.emitClose = options.emitClose !== false; // Should .destroy() be called after 'finish' (and potentially 'end')\n\n this.autoDestroy = !!options.autoDestroy; // 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 writableStateBufferGetter() {\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 // Checking for a Stream.Duplex instance is faster here instead of inside\n // the WritableState constructor, at least with V8 6.5\n\n var isDuplex = this instanceof Duplex;\n if (!isDuplex && !realHasInstance.call(Writable, this)) return new Writable(options);\n this._writableState = new WritableState(options, this, isDuplex); // 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 errorOrDestroy(this, new ERR_STREAM_CANNOT_PIPE());\n};\n\nfunction writeAfterEnd(stream, cb) {\n var er = new ERR_STREAM_WRITE_AFTER_END(); // TODO: defer error events consistently everywhere, not just the cb\n\n errorOrDestroy(stream, er);\n process.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 er;\n\n if (chunk === null) {\n er = new ERR_STREAM_NULL_VALUES();\n } else if (typeof chunk !== 'string' && !state.objectMode) {\n er = new ERR_INVALID_ARG_TYPE('chunk', ['string', 'Buffer'], chunk);\n }\n\n if (er) {\n errorOrDestroy(stream, er);\n process.nextTick(cb, er);\n return false;\n }\n\n return true;\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.ending) 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 this._writableState.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.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 ERR_UNKNOWN_ENCODING(encoding);\n this._writableState.defaultEncoding = encoding;\n return this;\n};\n\nObject.defineProperty(Writable.prototype, 'writableBuffer', {\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 && this._writableState.getBuffer();\n }\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 (state.destroyed) state.onwrite(new ERR_STREAM_DESTROYED('write'));else 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 process.nextTick(cb, er); // this can emit finish, and it will always happen\n // after error\n\n process.nextTick(finishMaybe, stream, state);\n stream._writableState.errorEmitted = true;\n errorOrDestroy(stream, 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 errorOrDestroy(stream, 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 if (typeof cb !== 'function') throw new ERR_MULTIPLE_CALLBACK();\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) || stream.destroyed;\n\n if (!finished && !state.corked && !state.bufferProcessing && state.bufferedRequest) {\n clearBuffer(stream, state);\n }\n\n if (sync) {\n process.nextTick(afterWrite, stream, state, finished, cb);\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 ERR_METHOD_NOT_IMPLEMENTED('_write()'));\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) endWritable(this, state, cb);\n return this;\n};\n\nObject.defineProperty(Writable.prototype, 'writableLength', {\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.length;\n }\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 errorOrDestroy(stream, 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' && !state.destroyed) {\n state.pendingcb++;\n state.finalCalled = true;\n process.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 if (state.autoDestroy) {\n // In case of duplex streams we need a way to detect\n // if the readable side is ready for autoDestroy as well\n var rState = stream._readableState;\n\n if (!rState || rState.autoDestroy && rState.endEmitted) {\n stream.destroy();\n }\n }\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) process.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 } // reuse the free corkReq.\n\n\n state.corkedRequestsFree.next = corkReq;\n}\n\nObject.defineProperty(Writable.prototype, 'destroyed', {\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 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 cb(err);\n};","'use strict';\n\nvar _Object$setPrototypeO;\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nvar finished = require('./end-of-stream');\n\nvar kLastResolve = Symbol('lastResolve');\nvar kLastReject = Symbol('lastReject');\nvar kError = Symbol('error');\nvar kEnded = Symbol('ended');\nvar kLastPromise = Symbol('lastPromise');\nvar kHandlePromise = Symbol('handlePromise');\nvar kStream = Symbol('stream');\n\nfunction createIterResult(value, done) {\n return {\n value: value,\n done: done\n };\n}\n\nfunction readAndResolve(iter) {\n var resolve = iter[kLastResolve];\n\n if (resolve !== null) {\n var data = iter[kStream].read(); // we defer if data is null\n // we can be expecting either 'end' or\n // 'error'\n\n if (data !== null) {\n iter[kLastPromise] = null;\n iter[kLastResolve] = null;\n iter[kLastReject] = null;\n resolve(createIterResult(data, false));\n }\n }\n}\n\nfunction onReadable(iter) {\n // we wait for the next tick, because it might\n // emit an error with process.nextTick\n process.nextTick(readAndResolve, iter);\n}\n\nfunction wrapForNext(lastPromise, iter) {\n return function (resolve, reject) {\n lastPromise.then(function () {\n if (iter[kEnded]) {\n resolve(createIterResult(undefined, true));\n return;\n }\n\n iter[kHandlePromise](resolve, reject);\n }, reject);\n };\n}\n\nvar AsyncIteratorPrototype = Object.getPrototypeOf(function () {});\nvar ReadableStreamAsyncIteratorPrototype = Object.setPrototypeOf((_Object$setPrototypeO = {\n get stream() {\n return this[kStream];\n },\n\n next: function next() {\n var _this = this;\n\n // if we have detected an error in the meanwhile\n // reject straight away\n var error = this[kError];\n\n if (error !== null) {\n return Promise.reject(error);\n }\n\n if (this[kEnded]) {\n return Promise.resolve(createIterResult(undefined, true));\n }\n\n if (this[kStream].destroyed) {\n // We need to defer via nextTick because if .destroy(err) is\n // called, the error will be emitted via nextTick, and\n // we cannot guarantee that there is no error lingering around\n // waiting to be emitted.\n return new Promise(function (resolve, reject) {\n process.nextTick(function () {\n if (_this[kError]) {\n reject(_this[kError]);\n } else {\n resolve(createIterResult(undefined, true));\n }\n });\n });\n } // if we have multiple next() calls\n // we will wait for the previous Promise to finish\n // this logic is optimized to support for await loops,\n // where next() is only called once at a time\n\n\n var lastPromise = this[kLastPromise];\n var promise;\n\n if (lastPromise) {\n promise = new Promise(wrapForNext(lastPromise, this));\n } else {\n // fast path needed to support multiple this.push()\n // without triggering the next() queue\n var data = this[kStream].read();\n\n if (data !== null) {\n return Promise.resolve(createIterResult(data, false));\n }\n\n promise = new Promise(this[kHandlePromise]);\n }\n\n this[kLastPromise] = promise;\n return promise;\n }\n}, _defineProperty(_Object$setPrototypeO, Symbol.asyncIterator, function () {\n return this;\n}), _defineProperty(_Object$setPrototypeO, \"return\", function _return() {\n var _this2 = this;\n\n // destroy(err, cb) is a private API\n // we can guarantee we have that here, because we control the\n // Readable class this is attached to\n return new Promise(function (resolve, reject) {\n _this2[kStream].destroy(null, function (err) {\n if (err) {\n reject(err);\n return;\n }\n\n resolve(createIterResult(undefined, true));\n });\n });\n}), _Object$setPrototypeO), AsyncIteratorPrototype);\n\nvar createReadableStreamAsyncIterator = function createReadableStreamAsyncIterator(stream) {\n var _Object$create;\n\n var iterator = Object.create(ReadableStreamAsyncIteratorPrototype, (_Object$create = {}, _defineProperty(_Object$create, kStream, {\n value: stream,\n writable: true\n }), _defineProperty(_Object$create, kLastResolve, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kLastReject, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kError, {\n value: null,\n writable: true\n }), _defineProperty(_Object$create, kEnded, {\n value: stream._readableState.endEmitted,\n writable: true\n }), _defineProperty(_Object$create, kHandlePromise, {\n value: function value(resolve, reject) {\n var data = iterator[kStream].read();\n\n if (data) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(data, false));\n } else {\n iterator[kLastResolve] = resolve;\n iterator[kLastReject] = reject;\n }\n },\n writable: true\n }), _Object$create));\n iterator[kLastPromise] = null;\n finished(stream, function (err) {\n if (err && err.code !== 'ERR_STREAM_PREMATURE_CLOSE') {\n var reject = iterator[kLastReject]; // reject if we are waiting for data in the Promise\n // returned by next() and store the error\n\n if (reject !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n reject(err);\n }\n\n iterator[kError] = err;\n return;\n }\n\n var resolve = iterator[kLastResolve];\n\n if (resolve !== null) {\n iterator[kLastPromise] = null;\n iterator[kLastResolve] = null;\n iterator[kLastReject] = null;\n resolve(createIterResult(undefined, true));\n }\n\n iterator[kEnded] = true;\n });\n stream.on('readable', onReadable.bind(null, iterator));\n return iterator;\n};\n\nmodule.exports = createReadableStreamAsyncIterator;","'use strict';\n\nfunction ownKeys(object, enumerableOnly) { var keys = Object.keys(object); if (Object.getOwnPropertySymbols) { var symbols = Object.getOwnPropertySymbols(object); if (enumerableOnly) symbols = symbols.filter(function (sym) { return Object.getOwnPropertyDescriptor(object, sym).enumerable; }); keys.push.apply(keys, symbols); } return keys; }\n\nfunction _objectSpread(target) { for (var i = 1; i < arguments.length; i++) { var source = arguments[i] != null ? arguments[i] : {}; if (i % 2) { ownKeys(Object(source), true).forEach(function (key) { _defineProperty(target, key, source[key]); }); } else if (Object.getOwnPropertyDescriptors) { Object.defineProperties(target, Object.getOwnPropertyDescriptors(source)); } else { ownKeys(Object(source)).forEach(function (key) { Object.defineProperty(target, key, Object.getOwnPropertyDescriptor(source, key)); }); } } return target; }\n\nfunction _defineProperty(obj, key, value) { if (key in obj) { Object.defineProperty(obj, key, { value: value, enumerable: true, configurable: true, writable: true }); } else { obj[key] = value; } return obj; }\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\nfunction _defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } }\n\nfunction _createClass(Constructor, protoProps, staticProps) { if (protoProps) _defineProperties(Constructor.prototype, protoProps); if (staticProps) _defineProperties(Constructor, staticProps); return Constructor; }\n\nvar _require = require('buffer'),\n Buffer = _require.Buffer;\n\nvar _require2 = require('util'),\n inspect = _require2.inspect;\n\nvar custom = inspect && inspect.custom || 'inspect';\n\nfunction copyBuffer(src, target, offset) {\n Buffer.prototype.copy.call(src, target, offset);\n}\n\nmodule.exports =\n/*#__PURE__*/\nfunction () {\n function BufferList() {\n _classCallCheck(this, BufferList);\n\n this.head = null;\n this.tail = null;\n this.length = 0;\n }\n\n _createClass(BufferList, [{\n key: \"push\",\n value: function push(v) {\n var entry = {\n data: v,\n next: null\n };\n if (this.length > 0) this.tail.next = entry;else this.head = entry;\n this.tail = entry;\n ++this.length;\n }\n }, {\n key: \"unshift\",\n value: function unshift(v) {\n var entry = {\n data: v,\n next: this.head\n };\n if (this.length === 0) this.tail = entry;\n this.head = entry;\n ++this.length;\n }\n }, {\n key: \"shift\",\n value: function shift() {\n if (this.length === 0) return;\n var ret = this.head.data;\n if (this.length === 1) this.head = this.tail = null;else this.head = this.head.next;\n --this.length;\n return ret;\n }\n }, {\n key: \"clear\",\n value: function clear() {\n this.head = this.tail = null;\n this.length = 0;\n }\n }, {\n key: \"join\",\n value: function join(s) {\n if (this.length === 0) return '';\n var p = this.head;\n var ret = '' + p.data;\n\n while (p = p.next) {\n ret += s + p.data;\n }\n\n return ret;\n }\n }, {\n key: \"concat\",\n value: function concat(n) {\n if (this.length === 0) return Buffer.alloc(0);\n var ret = Buffer.allocUnsafe(n >>> 0);\n var p = this.head;\n var i = 0;\n\n while (p) {\n copyBuffer(p.data, ret, i);\n i += p.data.length;\n p = p.next;\n }\n\n return ret;\n } // Consumes a specified amount of bytes or characters from the buffered data.\n\n }, {\n key: \"consume\",\n value: function consume(n, hasStrings) {\n var ret;\n\n if (n < this.head.data.length) {\n // `slice` is the same for buffers and strings.\n ret = this.head.data.slice(0, n);\n this.head.data = this.head.data.slice(n);\n } else if (n === this.head.data.length) {\n // First chunk is a perfect match.\n ret = this.shift();\n } else {\n // Result spans more than one buffer.\n ret = hasStrings ? this._getString(n) : this._getBuffer(n);\n }\n\n return ret;\n }\n }, {\n key: \"first\",\n value: function first() {\n return this.head.data;\n } // Consumes a specified amount of characters from the buffered data.\n\n }, {\n key: \"_getString\",\n value: function _getString(n) {\n var p = this.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) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = str.slice(nb);\n }\n\n break;\n }\n\n ++c;\n }\n\n this.length -= c;\n return ret;\n } // Consumes a specified amount of bytes from the buffered data.\n\n }, {\n key: \"_getBuffer\",\n value: function _getBuffer(n) {\n var ret = Buffer.allocUnsafe(n);\n var p = this.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) this.head = p.next;else this.head = this.tail = null;\n } else {\n this.head = p;\n p.data = buf.slice(nb);\n }\n\n break;\n }\n\n ++c;\n }\n\n this.length -= c;\n return ret;\n } // Make sure the linked list only shows the minimal necessary information.\n\n }, {\n key: custom,\n value: function value(_, options) {\n return inspect(this, _objectSpread({}, options, {\n // Only inspect one level.\n depth: 0,\n // It should not recurse.\n customInspect: false\n }));\n }\n }]);\n\n return BufferList;\n}();","'use strict'; // undocumented cb() API, needed for core, not for public API\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) {\n if (!this._writableState) {\n process.nextTick(emitErrorNT, this, err);\n } else if (!this._writableState.errorEmitted) {\n this._writableState.errorEmitted = true;\n process.nextTick(emitErrorNT, this, err);\n }\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 if (!_this._writableState) {\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else if (!_this._writableState.errorEmitted) {\n _this._writableState.errorEmitted = true;\n process.nextTick(emitErrorAndCloseNT, _this, err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n } else if (cb) {\n process.nextTick(emitCloseNT, _this);\n cb(err);\n } else {\n process.nextTick(emitCloseNT, _this);\n }\n });\n\n return this;\n}\n\nfunction emitErrorAndCloseNT(self, err) {\n emitErrorNT(self, err);\n emitCloseNT(self);\n}\n\nfunction emitCloseNT(self) {\n if (self._writableState && !self._writableState.emitClose) return;\n if (self._readableState && !self._readableState.emitClose) return;\n self.emit('close');\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.finalCalled = false;\n this._writableState.prefinished = 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\nfunction errorOrDestroy(stream, err) {\n // We have tests that rely on errors being emitted\n // in the same tick, so changing this is semver major.\n // For now when you opt-in to autoDestroy we allow\n // the error to be emitted nextTick. In a future\n // semver major update we should change the default to this.\n var rState = stream._readableState;\n var wState = stream._writableState;\n if (rState && rState.autoDestroy || wState && wState.autoDestroy) stream.destroy(err);else stream.emit('error', err);\n}\n\nmodule.exports = {\n destroy: destroy,\n undestroy: undestroy,\n errorOrDestroy: errorOrDestroy\n};","// Ported from https://github.com/mafintosh/end-of-stream with\n// permission from the author, Mathias Buus (@mafintosh).\n'use strict';\n\nvar ERR_STREAM_PREMATURE_CLOSE = require('../../../errors').codes.ERR_STREAM_PREMATURE_CLOSE;\n\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n\n for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n args[_key] = arguments[_key];\n }\n\n callback.apply(this, args);\n };\n}\n\nfunction noop() {}\n\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\n\nfunction eos(stream, opts, callback) {\n if (typeof opts === 'function') return eos(stream, null, opts);\n if (!opts) opts = {};\n callback = once(callback || noop);\n var readable = opts.readable || opts.readable !== false && stream.readable;\n var writable = opts.writable || opts.writable !== false && stream.writable;\n\n var onlegacyfinish = function onlegacyfinish() {\n if (!stream.writable) onfinish();\n };\n\n var writableEnded = stream._writableState && stream._writableState.finished;\n\n var onfinish = function onfinish() {\n writable = false;\n writableEnded = true;\n if (!readable) callback.call(stream);\n };\n\n var readableEnded = stream._readableState && stream._readableState.endEmitted;\n\n var onend = function onend() {\n readable = false;\n readableEnded = true;\n if (!writable) callback.call(stream);\n };\n\n var onerror = function onerror(err) {\n callback.call(stream, err);\n };\n\n var onclose = function onclose() {\n var err;\n\n if (readable && !readableEnded) {\n if (!stream._readableState || !stream._readableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n\n if (writable && !writableEnded) {\n if (!stream._writableState || !stream._writableState.ended) err = new ERR_STREAM_PREMATURE_CLOSE();\n return callback.call(stream, err);\n }\n };\n\n var onrequest = function onrequest() {\n stream.req.on('finish', onfinish);\n };\n\n if (isRequest(stream)) {\n stream.on('complete', onfinish);\n stream.on('abort', onclose);\n if (stream.req) onrequest();else stream.on('request', onrequest);\n } else if (writable && !stream._writableState) {\n // legacy streams\n stream.on('end', onlegacyfinish);\n stream.on('close', onlegacyfinish);\n }\n\n stream.on('end', onend);\n stream.on('finish', onfinish);\n if (opts.error !== false) stream.on('error', onerror);\n stream.on('close', onclose);\n return function () {\n stream.removeListener('complete', onfinish);\n stream.removeListener('abort', onclose);\n stream.removeListener('request', onrequest);\n if (stream.req) stream.req.removeListener('finish', onfinish);\n stream.removeListener('end', onlegacyfinish);\n stream.removeListener('close', onlegacyfinish);\n stream.removeListener('finish', onfinish);\n stream.removeListener('end', onend);\n stream.removeListener('error', onerror);\n stream.removeListener('close', onclose);\n };\n}\n\nmodule.exports = eos;","module.exports = function () {\n throw new Error('Readable.from is not available in the browser')\n};\n","// Ported from https://github.com/mafintosh/pump with\n// permission from the author, Mathias Buus (@mafintosh).\n'use strict';\n\nvar eos;\n\nfunction once(callback) {\n var called = false;\n return function () {\n if (called) return;\n called = true;\n callback.apply(void 0, arguments);\n };\n}\n\nvar _require$codes = require('../../../errors').codes,\n ERR_MISSING_ARGS = _require$codes.ERR_MISSING_ARGS,\n ERR_STREAM_DESTROYED = _require$codes.ERR_STREAM_DESTROYED;\n\nfunction noop(err) {\n // Rethrow the error if it exists to avoid swallowing it\n if (err) throw err;\n}\n\nfunction isRequest(stream) {\n return stream.setHeader && typeof stream.abort === 'function';\n}\n\nfunction destroyer(stream, reading, writing, callback) {\n callback = once(callback);\n var closed = false;\n stream.on('close', function () {\n closed = true;\n });\n if (eos === undefined) eos = require('./end-of-stream');\n eos(stream, {\n readable: reading,\n writable: writing\n }, function (err) {\n if (err) return callback(err);\n closed = true;\n callback();\n });\n var destroyed = false;\n return function (err) {\n if (closed) return;\n if (destroyed) return;\n destroyed = true; // request.destroy just do .end - .abort is what we want\n\n if (isRequest(stream)) return stream.abort();\n if (typeof stream.destroy === 'function') return stream.destroy();\n callback(err || new ERR_STREAM_DESTROYED('pipe'));\n };\n}\n\nfunction call(fn) {\n fn();\n}\n\nfunction pipe(from, to) {\n return from.pipe(to);\n}\n\nfunction popCallback(streams) {\n if (!streams.length) return noop;\n if (typeof streams[streams.length - 1] !== 'function') return noop;\n return streams.pop();\n}\n\nfunction pipeline() {\n for (var _len = arguments.length, streams = new Array(_len), _key = 0; _key < _len; _key++) {\n streams[_key] = arguments[_key];\n }\n\n var callback = popCallback(streams);\n if (Array.isArray(streams[0])) streams = streams[0];\n\n if (streams.length < 2) {\n throw new ERR_MISSING_ARGS('streams');\n }\n\n var error;\n var destroys = streams.map(function (stream, i) {\n var reading = i < streams.length - 1;\n var writing = i > 0;\n return destroyer(stream, reading, writing, function (err) {\n if (!error) error = err;\n if (err) destroys.forEach(call);\n if (reading) return;\n destroys.forEach(call);\n callback(error);\n });\n });\n return streams.reduce(pipe);\n}\n\nmodule.exports = pipeline;","'use strict';\n\nvar ERR_INVALID_OPT_VALUE = require('../../../errors').codes.ERR_INVALID_OPT_VALUE;\n\nfunction highWaterMarkFrom(options, isDuplex, duplexKey) {\n return options.highWaterMark != null ? options.highWaterMark : isDuplex ? options[duplexKey] : null;\n}\n\nfunction getHighWaterMark(state, options, duplexKey, isDuplex) {\n var hwm = highWaterMarkFrom(options, isDuplex, duplexKey);\n\n if (hwm != null) {\n if (!(isFinite(hwm) && Math.floor(hwm) === hwm) || hwm < 0) {\n var name = isDuplex ? duplexKey : 'highWaterMark';\n throw new ERR_INVALID_OPT_VALUE(name, hwm);\n }\n\n return Math.floor(hwm);\n } // Default value\n\n\n return state.objectMode ? 16 : 16 * 1024;\n}\n\nmodule.exports = {\n getHighWaterMark: getHighWaterMark\n};","module.exports = require('events').EventEmitter;\n","exports = module.exports = require('./lib/_stream_readable.js');\nexports.Stream = exports;\nexports.Readable = exports;\nexports.Writable = require('./lib/_stream_writable.js');\nexports.Duplex = require('./lib/_stream_duplex.js');\nexports.Transform = require('./lib/_stream_transform.js');\nexports.PassThrough = require('./lib/_stream_passthrough.js');\nexports.finished = require('./lib/internal/streams/end-of-stream.js');\nexports.pipeline = require('./lib/internal/streams/pipeline.js');\n","/*! render-media. MIT License. Feross Aboukhadijeh */\nexports.render = render\nexports.append = append\nexports.mime = require('./lib/mime.json')\n\nconst debug = require('debug')('render-media')\nconst isAscii = require('is-ascii')\nconst MediaElementWrapper = require('mediasource')\nconst path = require('path')\nconst streamToBlobURL = require('stream-to-blob-url')\nconst VideoStream = require('videostream')\n\n// Note: Everything listed in VIDEOSTREAM_EXTS should also appear in either\n// MEDIASOURCE_VIDEO_EXTS or MEDIASOURCE_AUDIO_EXTS.\nconst VIDEOSTREAM_EXTS = [\n '.m4a',\n '.m4b',\n '.m4p',\n '.m4v',\n '.mp4'\n]\n\nconst MEDIASOURCE_VIDEO_EXTS = [\n '.m4v',\n '.mkv',\n '.mp4',\n '.webm'\n]\n\nconst MEDIASOURCE_AUDIO_EXTS = [\n '.m4a',\n '.m4b',\n '.m4p',\n '.mp3'\n]\n\nconst MEDIASOURCE_EXTS = [].concat(\n MEDIASOURCE_VIDEO_EXTS,\n MEDIASOURCE_AUDIO_EXTS\n)\n\nconst VIDEO_EXTS = [\n '.mov',\n '.ogv'\n]\n\nconst AUDIO_EXTS = [\n '.aac',\n '.oga',\n '.ogg',\n '.wav',\n '.flac'\n]\n\nconst IMAGE_EXTS = [\n '.bmp',\n '.gif',\n '.jpeg',\n '.jpg',\n '.png',\n '.svg'\n]\n\nconst IFRAME_EXTS = [\n '.css',\n '.html',\n '.js',\n '.md',\n '.pdf',\n '.srt',\n '.txt'\n]\n\n// Maximum file length for which the Blob URL strategy will be attempted\n// See: https://github.com/feross/render-media/issues/18\nconst MAX_BLOB_LENGTH = 200 * 1000 * 1000 // 200 MB\n\nconst MediaSource = typeof window !== 'undefined' && window.MediaSource\n\nfunction render (file, elem, opts, cb) {\n if (typeof opts === 'function') {\n cb = opts\n opts = {}\n }\n if (!opts) opts = {}\n if (!cb) cb = () => {}\n\n validateFile(file)\n parseOpts(opts)\n\n if (typeof elem === 'string') elem = document.querySelector(elem)\n\n renderMedia(file, tagName => {\n if (elem.nodeName !== tagName.toUpperCase()) {\n const extname = path.extname(file.name).toLowerCase()\n\n throw new Error(\n `Cannot render \"${extname}\" inside a \"${elem.nodeName.toLowerCase()}\" element, expected \"${tagName}\"`\n )\n }\n\n if (tagName === 'video' || tagName === 'audio') setMediaOpts(elem, opts)\n\n return elem\n }, opts, cb)\n}\n\nfunction append (file, rootElem, opts, cb) {\n if (typeof opts === 'function') {\n cb = opts\n opts = {}\n }\n if (!opts) opts = {}\n if (!cb) cb = () => {}\n\n validateFile(file)\n parseOpts(opts)\n\n if (typeof rootElem === 'string') rootElem = document.querySelector(rootElem)\n\n if (rootElem && (rootElem.nodeName === 'VIDEO' || rootElem.nodeName === 'AUDIO')) {\n throw new Error(\n 'Invalid video/audio node argument. Argument must be root element that ' +\n 'video/audio tag will be appended to.'\n )\n }\n\n renderMedia(file, getElem, opts, done)\n\n function getElem (tagName) {\n if (tagName === 'video' || tagName === 'audio') return createMedia(tagName)\n else return createElem(tagName)\n }\n\n function createMedia (tagName) {\n const elem = createElem(tagName)\n setMediaOpts(elem, opts)\n rootElem.appendChild(elem)\n return elem\n }\n\n function createElem (tagName) {\n const elem = document.createElement(tagName)\n rootElem.appendChild(elem)\n return elem\n }\n\n function done (err, elem) {\n if (err && elem) elem.remove()\n cb(err, elem)\n }\n}\n\nfunction renderMedia (file, getElem, opts, cb) {\n const extname = path.extname(file.name).toLowerCase()\n let currentTime = 0\n let elem\n\n if (MEDIASOURCE_EXTS.includes(extname)) {\n renderMediaSource()\n } else if (VIDEO_EXTS.includes(extname)) {\n renderMediaElement('video')\n } else if (AUDIO_EXTS.includes(extname)) {\n renderMediaElement('audio')\n } else if (IMAGE_EXTS.includes(extname)) {\n renderImage()\n } else if (IFRAME_EXTS.includes(extname)) {\n renderIframe()\n } else {\n tryRenderIframe()\n }\n\n function renderMediaSource () {\n const tagName = MEDIASOURCE_VIDEO_EXTS.includes(extname) ? 'video' : 'audio'\n\n if (MediaSource) {\n if (VIDEOSTREAM_EXTS.includes(extname)) {\n useVideostream()\n } else {\n useMediaSource()\n }\n } else {\n useBlobURL()\n }\n\n function useVideostream () {\n debug(`Use \\`videostream\\` package for ${file.name}`)\n prepareElem()\n elem.addEventListener('error', fallbackToMediaSource)\n elem.addEventListener('loadstart', onLoadStart)\n elem.addEventListener('loadedmetadata', onLoadedMetadata)\n new VideoStream(file, elem) /* eslint-disable-line no-new */\n }\n\n function useMediaSource () {\n debug(`Use MediaSource API for ${file.name}`)\n prepareElem()\n elem.addEventListener('error', fallbackToBlobURL)\n elem.addEventListener('loadstart', onLoadStart)\n elem.addEventListener('loadedmetadata', onLoadedMetadata)\n\n const wrapper = new MediaElementWrapper(elem)\n const writable = wrapper.createWriteStream(getCodec(file.name))\n file.createReadStream().pipe(writable)\n\n if (currentTime) elem.currentTime = currentTime\n }\n\n function useBlobURL () {\n debug(`Use Blob URL for ${file.name}`)\n prepareElem()\n elem.addEventListener('error', fatalError)\n elem.addEventListener('loadstart', onLoadStart)\n elem.addEventListener('loadedmetadata', onLoadedMetadata)\n getBlobURL(file, (err, url) => {\n if (err) return fatalError(err)\n elem.src = url\n if (currentTime) elem.currentTime = currentTime\n })\n }\n\n function fallbackToMediaSource (err) {\n debug('videostream error: fallback to MediaSource API: %o', err.message || err)\n elem.removeEventListener('error', fallbackToMediaSource)\n elem.removeEventListener('loadedmetadata', onLoadedMetadata)\n\n useMediaSource()\n }\n\n function fallbackToBlobURL (err) {\n debug('MediaSource API error: fallback to Blob URL: %o', err.message || err)\n if (!checkBlobLength()) return\n\n elem.removeEventListener('error', fallbackToBlobURL)\n elem.removeEventListener('loadedmetadata', onLoadedMetadata)\n\n useBlobURL()\n }\n\n function prepareElem () {\n if (!elem) {\n elem = getElem(tagName)\n\n elem.addEventListener('progress', () => {\n currentTime = elem.currentTime\n })\n }\n }\n }\n\n function checkBlobLength () {\n if (typeof file.length === 'number' && file.length > opts.maxBlobLength) {\n debug(\n 'File length too large for Blob URL approach: %d (max: %d)',\n file.length, opts.maxBlobLength\n )\n fatalError(new Error(\n `File length too large for Blob URL approach: ${file.length} (max: ${opts.maxBlobLength})`\n ))\n return false\n }\n return true\n }\n\n function renderMediaElement (type) {\n if (!checkBlobLength()) return\n\n elem = getElem(type)\n getBlobURL(file, (err, url) => {\n if (err) return fatalError(err)\n elem.addEventListener('error', fatalError)\n elem.addEventListener('loadstart', onLoadStart)\n elem.addEventListener('loadedmetadata', onLoadedMetadata)\n elem.src = url\n })\n }\n\n function onLoadStart () {\n elem.removeEventListener('loadstart', onLoadStart)\n if (opts.autoplay) {\n const playPromise = elem.play()\n if (typeof playPromise !== 'undefined') playPromise.catch(fatalError)\n }\n }\n\n function onLoadedMetadata () {\n elem.removeEventListener('loadedmetadata', onLoadedMetadata)\n cb(null, elem)\n }\n\n function renderImage () {\n elem = getElem('img')\n getBlobURL(file, (err, url) => {\n if (err) return fatalError(err)\n elem.src = url\n elem.alt = file.name\n cb(null, elem)\n })\n }\n\n function renderIframe () {\n getBlobURL(file, (err, url) => {\n if (err) return fatalError(err)\n\n if (extname !== '.pdf') {\n // Render iframe\n elem = getElem('iframe')\n elem.sandbox = 'allow-forms allow-scripts'\n elem.src = url\n } else {\n // Render .pdf\n elem = getElem('object')\n // Firefox-only: `typemustmatch` keeps the embedded file from running unless\n // its content type matches the specified `type` attribute\n elem.setAttribute('typemustmatch', true)\n elem.setAttribute('type', 'application/pdf')\n elem.setAttribute('data', url)\n }\n cb(null, elem)\n })\n }\n\n function tryRenderIframe () {\n debug('Unknown file extension \"%s\" - will attempt to render into iframe', extname)\n\n let str = ''\n file.createReadStream({ start: 0, end: 1000 })\n .setEncoding('utf8')\n .on('data', chunk => {\n str += chunk\n })\n .on('end', done)\n .on('error', cb)\n\n function done () {\n if (isAscii(str)) {\n debug('File extension \"%s\" appears ascii, so will render.', extname)\n renderIframe()\n } else {\n debug('File extension \"%s\" appears non-ascii, will not render.', extname)\n cb(new Error(`Unsupported file type \"${extname}\": Cannot append to DOM`))\n }\n }\n }\n\n function fatalError (err) {\n err.message = `Error rendering file \"${file.name}\": ${err.message}`\n debug(err.message)\n cb(err)\n }\n}\n\nfunction getBlobURL (file, cb) {\n const extname = path.extname(file.name).toLowerCase()\n streamToBlobURL(file.createReadStream(), exports.mime[extname])\n .then(\n blobUrl => cb(null, blobUrl),\n err => cb(err)\n )\n}\n\nfunction validateFile (file) {\n if (file == null) {\n throw new Error('file cannot be null or undefined')\n }\n if (typeof file.name !== 'string') {\n throw new Error('missing or invalid file.name property')\n }\n if (typeof file.createReadStream !== 'function') {\n throw new Error('missing or invalid file.createReadStream property')\n }\n}\n\nfunction getCodec (name) {\n const extname = path.extname(name).toLowerCase()\n return {\n '.m4a': 'audio/mp4; codecs=\"mp4a.40.5\"',\n '.m4b': 'audio/mp4; codecs=\"mp4a.40.5\"',\n '.m4p': 'audio/mp4; codecs=\"mp4a.40.5\"',\n '.m4v': 'video/mp4; codecs=\"avc1.640029, mp4a.40.5\"',\n '.mkv': 'video/webm; codecs=\"avc1.640029, mp4a.40.5\"',\n '.mp3': 'audio/mpeg',\n '.mp4': 'video/mp4; codecs=\"avc1.640029, mp4a.40.5\"',\n '.webm': 'video/webm; codecs=\"vorbis, vp8\"'\n }[extname]\n}\n\nfunction parseOpts (opts) {\n if (opts.autoplay == null) opts.autoplay = false\n if (opts.muted == null) opts.muted = false\n if (opts.controls == null) opts.controls = true\n if (opts.maxBlobLength == null) opts.maxBlobLength = MAX_BLOB_LENGTH\n}\n\nfunction setMediaOpts (elem, opts) {\n elem.autoplay = !!opts.autoplay\n elem.muted = !!opts.muted\n elem.controls = !!opts.controls\n}\n","'use strict'\nvar Buffer = require('buffer').Buffer\nvar inherits = require('inherits')\nvar HashBase = require('hash-base')\n\nvar ARRAY16 = new Array(16)\n\nvar zl = [\n 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,\n 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,\n 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,\n 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,\n 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13\n]\n\nvar zr = [\n 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,\n 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,\n 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,\n 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,\n 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11\n]\n\nvar sl = [\n 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,\n 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,\n 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,\n 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,\n 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6\n]\n\nvar sr = [\n 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,\n 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,\n 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,\n 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,\n 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11\n]\n\nvar hl = [0x00000000, 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc, 0xa953fd4e]\nvar hr = [0x50a28be6, 0x5c4dd124, 0x6d703ef3, 0x7a6d76e9, 0x00000000]\n\nfunction RIPEMD160 () {\n HashBase.call(this, 64)\n\n // state\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 for (var j = 0; j < 16; ++j) words[j] = this._block.readInt32LE(j * 4)\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\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\n\n // computation\n for (var i = 0; i < 80; i += 1) {\n var tl\n var tr\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 { // 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\n ar = er\n er = dr\n dr = rotl(cr, 10)\n cr = br\n br = tr\n }\n\n // update state\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 if (this._blockOffset > 56) {\n this._block.fill(0, this._blockOffset, 64)\n this._update()\n this._blockOffset = 0\n }\n\n this._block.fill(0, this._blockOffset, 56)\n this._block.writeUInt32LE(this._length[0], 56)\n this._block.writeUInt32LE(this._length[1], 60)\n this._update()\n\n // produce result\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\n","/*! run-parallel-limit. MIT License. Feross Aboukhadijeh */\nmodule.exports = runParallelLimit\n\nconst queueMicrotask = require('queue-microtask')\n\nfunction runParallelLimit (tasks, limit, cb) {\n if (typeof limit !== 'number') throw new Error('second argument must be a Number')\n let results, len, pending, keys, isErrored\n let isSync = true\n let next\n\n if (Array.isArray(tasks)) {\n results = []\n pending = len = tasks.length\n } else {\n keys = Object.keys(tasks)\n results = {}\n pending = len = keys.length\n }\n\n function done (err) {\n function end () {\n if (cb) cb(err, results)\n cb = null\n }\n if (isSync) queueMicrotask(end)\n else end()\n }\n\n function each (i, err, result) {\n results[i] = result\n if (err) isErrored = true\n if (--pending === 0 || err) {\n done(err)\n } else if (!isErrored && next < len) {\n let key\n if (keys) {\n key = keys[next]\n next += 1\n tasks[key](function (err, result) { each(key, err, result) })\n } else {\n key = next\n next += 1\n tasks[key](function (err, result) { each(key, err, result) })\n }\n }\n }\n\n next = limit\n if (!pending) {\n // empty\n done(null)\n } else if (keys) {\n // object\n keys.some(function (key, i) {\n tasks[key](function (err, result) { each(key, err, result) })\n if (i === limit - 1) return true // early return\n return false\n })\n } else {\n // array\n tasks.some(function (task, i) {\n task(function (err, result) { each(i, err, result) })\n if (i === limit - 1) return true // early return\n return false\n })\n }\n\n isSync = false\n}\n","/*! run-parallel. MIT License. Feross Aboukhadijeh */\nmodule.exports = runParallel\n\nconst queueMicrotask = require('queue-microtask')\n\nfunction runParallel (tasks, cb) {\n let results, pending, keys\n let isSync = true\n\n if (Array.isArray(tasks)) {\n results = []\n pending = tasks.length\n } else {\n keys = Object.keys(tasks)\n results = {}\n pending = keys.length\n }\n\n function done (err) {\n function end () {\n if (cb) cb(err, results)\n cb = null\n }\n if (isSync) queueMicrotask(end)\n else end()\n }\n\n function each (i, err, result) {\n results[i] = result\n if (--pending === 0 || err) {\n done(err)\n }\n }\n\n if (!pending) {\n // empty\n done(null)\n } else if (keys) {\n // object\n keys.forEach(function (key) {\n tasks[key](function (err, result) { each(key, err, result) })\n })\n } else {\n // array\n tasks.forEach(function (task, i) {\n task(function (err, result) { each(i, err, result) })\n })\n }\n\n isSync = false\n}\n","(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Rusha\"] = factory();\n\telse\n\t\troot[\"Rusha\"] = factory();\n})(typeof self !== 'undefined' ? self : this, function() {\nreturn /******/ (function(modules) { // webpackBootstrap\n/******/ \t// The module cache\n/******/ \tvar installedModules = {};\n/******/\n/******/ \t// The require function\n/******/ \tfunction __webpack_require__(moduleId) {\n/******/\n/******/ \t\t// Check if module is in cache\n/******/ \t\tif(installedModules[moduleId]) {\n/******/ \t\t\treturn installedModules[moduleId].exports;\n/******/ \t\t}\n/******/ \t\t// Create a new module (and put it into the cache)\n/******/ \t\tvar module = installedModules[moduleId] = {\n/******/ \t\t\ti: moduleId,\n/******/ \t\t\tl: false,\n/******/ \t\t\texports: {}\n/******/ \t\t};\n/******/\n/******/ \t\t// Execute the module function\n/******/ \t\tmodules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n/******/\n/******/ \t\t// Flag the module as loaded\n/******/ \t\tmodule.l = true;\n/******/\n/******/ \t\t// Return the exports of the module\n/******/ \t\treturn module.exports;\n/******/ \t}\n/******/\n/******/\n/******/ \t// expose the modules object (__webpack_modules__)\n/******/ \t__webpack_require__.m = modules;\n/******/\n/******/ \t// expose the module cache\n/******/ \t__webpack_require__.c = installedModules;\n/******/\n/******/ \t// define getter function for harmony exports\n/******/ \t__webpack_require__.d = function(exports, name, getter) {\n/******/ \t\tif(!__webpack_require__.o(exports, name)) {\n/******/ \t\t\tObject.defineProperty(exports, name, {\n/******/ \t\t\t\tconfigurable: false,\n/******/ \t\t\t\tenumerable: true,\n/******/ \t\t\t\tget: getter\n/******/ \t\t\t});\n/******/ \t\t}\n/******/ \t};\n/******/\n/******/ \t// getDefaultExport function for compatibility with non-harmony modules\n/******/ \t__webpack_require__.n = function(module) {\n/******/ \t\tvar getter = module && module.__esModule ?\n/******/ \t\t\tfunction getDefault() { return module['default']; } :\n/******/ \t\t\tfunction getModuleExports() { return module; };\n/******/ \t\t__webpack_require__.d(getter, 'a', getter);\n/******/ \t\treturn getter;\n/******/ \t};\n/******/\n/******/ \t// Object.prototype.hasOwnProperty.call\n/******/ \t__webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n/******/\n/******/ \t// __webpack_public_path__\n/******/ \t__webpack_require__.p = \"\";\n/******/\n/******/ \t// Load entry module and return exports\n/******/ \treturn __webpack_require__(__webpack_require__.s = 3);\n/******/ })\n/************************************************************************/\n/******/ ([\n/* 0 */\n/***/ (function(module, exports, __webpack_require__) {\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\n/* eslint-env commonjs, browser */\n\nvar RushaCore = __webpack_require__(5);\n\nvar _require = __webpack_require__(1),\n toHex = _require.toHex,\n ceilHeapSize = _require.ceilHeapSize;\n\nvar conv = __webpack_require__(6);\n\n// Calculate the length of buffer that the sha1 routine uses\n// including the padding.\nvar padlen = function (len) {\n for (len += 9; len % 64 > 0; len += 1) {}\n return len;\n};\n\nvar padZeroes = function (bin, len) {\n var h8 = new Uint8Array(bin.buffer);\n var om = len % 4,\n align = len - om;\n switch (om) {\n case 0:\n h8[align + 3] = 0;\n case 1:\n h8[align + 2] = 0;\n case 2:\n h8[align + 1] = 0;\n case 3:\n h8[align + 0] = 0;\n }\n for (var i = (len >> 2) + 1; i < bin.length; i++) {\n bin[i] = 0;\n }\n};\n\nvar padData = function (bin, chunkLen, msgLen) {\n bin[chunkLen >> 2] |= 0x80 << 24 - (chunkLen % 4 << 3);\n // To support msgLen >= 2 GiB, use a float division when computing the\n // high 32-bits of the big-endian message length in bits.\n bin[((chunkLen >> 2) + 2 & ~0x0f) + 14] = msgLen / (1 << 29) | 0;\n bin[((chunkLen >> 2) + 2 & ~0x0f) + 15] = msgLen << 3;\n};\n\nvar getRawDigest = function (heap, padMaxChunkLen) {\n var io = new Int32Array(heap, padMaxChunkLen + 320, 5);\n var out = new Int32Array(5);\n var arr = new DataView(out.buffer);\n arr.setInt32(0, io[0], false);\n arr.setInt32(4, io[1], false);\n arr.setInt32(8, io[2], false);\n arr.setInt32(12, io[3], false);\n arr.setInt32(16, io[4], false);\n return out;\n};\n\nvar Rusha = function () {\n function Rusha(chunkSize) {\n _classCallCheck(this, Rusha);\n\n chunkSize = chunkSize || 64 * 1024;\n if (chunkSize % 64 > 0) {\n throw new Error('Chunk size must be a multiple of 128 bit');\n }\n this._offset = 0;\n this._maxChunkLen = chunkSize;\n this._padMaxChunkLen = padlen(chunkSize);\n // The size of the heap is the sum of:\n // 1. The padded input message size\n // 2. The extended space the algorithm needs (320 byte)\n // 3. The 160 bit state the algoritm uses\n this._heap = new ArrayBuffer(ceilHeapSize(this._padMaxChunkLen + 320 + 20));\n this._h32 = new Int32Array(this._heap);\n this._h8 = new Int8Array(this._heap);\n this._core = new RushaCore({ Int32Array: Int32Array }, {}, this._heap);\n }\n\n Rusha.prototype._initState = function _initState(heap, padMsgLen) {\n this._offset = 0;\n var io = new Int32Array(heap, padMsgLen + 320, 5);\n io[0] = 1732584193;\n io[1] = -271733879;\n io[2] = -1732584194;\n io[3] = 271733878;\n io[4] = -1009589776;\n };\n\n Rusha.prototype._padChunk = function _padChunk(chunkLen, msgLen) {\n var padChunkLen = padlen(chunkLen);\n var view = new Int32Array(this._heap, 0, padChunkLen >> 2);\n padZeroes(view, chunkLen);\n padData(view, chunkLen, msgLen);\n return padChunkLen;\n };\n\n Rusha.prototype._write = function _write(data, chunkOffset, chunkLen, off) {\n conv(data, this._h8, this._h32, chunkOffset, chunkLen, off || 0);\n };\n\n Rusha.prototype._coreCall = function _coreCall(data, chunkOffset, chunkLen, msgLen, finalize) {\n var padChunkLen = chunkLen;\n this._write(data, chunkOffset, chunkLen);\n if (finalize) {\n padChunkLen = this._padChunk(chunkLen, msgLen);\n }\n this._core.hash(padChunkLen, this._padMaxChunkLen);\n };\n\n Rusha.prototype.rawDigest = function rawDigest(str) {\n var msgLen = str.byteLength || str.length || str.size || 0;\n this._initState(this._heap, this._padMaxChunkLen);\n var chunkOffset = 0,\n chunkLen = this._maxChunkLen;\n for (chunkOffset = 0; msgLen > chunkOffset + chunkLen; chunkOffset += chunkLen) {\n this._coreCall(str, chunkOffset, chunkLen, msgLen, false);\n }\n this._coreCall(str, chunkOffset, msgLen - chunkOffset, msgLen, true);\n return getRawDigest(this._heap, this._padMaxChunkLen);\n };\n\n Rusha.prototype.digest = function digest(str) {\n return toHex(this.rawDigest(str).buffer);\n };\n\n Rusha.prototype.digestFromString = function digestFromString(str) {\n return this.digest(str);\n };\n\n Rusha.prototype.digestFromBuffer = function digestFromBuffer(str) {\n return this.digest(str);\n };\n\n Rusha.prototype.digestFromArrayBuffer = function digestFromArrayBuffer(str) {\n return this.digest(str);\n };\n\n Rusha.prototype.resetState = function resetState() {\n this._initState(this._heap, this._padMaxChunkLen);\n return this;\n };\n\n Rusha.prototype.append = function append(chunk) {\n var chunkOffset = 0;\n var chunkLen = chunk.byteLength || chunk.length || chunk.size || 0;\n var turnOffset = this._offset % this._maxChunkLen;\n var inputLen = void 0;\n\n this._offset += chunkLen;\n while (chunkOffset < chunkLen) {\n inputLen = Math.min(chunkLen - chunkOffset, this._maxChunkLen - turnOffset);\n this._write(chunk, chunkOffset, inputLen, turnOffset);\n turnOffset += inputLen;\n chunkOffset += inputLen;\n if (turnOffset === this._maxChunkLen) {\n this._core.hash(this._maxChunkLen, this._padMaxChunkLen);\n turnOffset = 0;\n }\n }\n return this;\n };\n\n Rusha.prototype.getState = function getState() {\n var turnOffset = this._offset % this._maxChunkLen;\n var heap = void 0;\n if (!turnOffset) {\n var io = new Int32Array(this._heap, this._padMaxChunkLen + 320, 5);\n heap = io.buffer.slice(io.byteOffset, io.byteOffset + io.byteLength);\n } else {\n heap = this._heap.slice(0);\n }\n return {\n offset: this._offset,\n heap: heap\n };\n };\n\n Rusha.prototype.setState = function setState(state) {\n this._offset = state.offset;\n if (state.heap.byteLength === 20) {\n var io = new Int32Array(this._heap, this._padMaxChunkLen + 320, 5);\n io.set(new Int32Array(state.heap));\n } else {\n this._h32.set(new Int32Array(state.heap));\n }\n return this;\n };\n\n Rusha.prototype.rawEnd = function rawEnd() {\n var msgLen = this._offset;\n var chunkLen = msgLen % this._maxChunkLen;\n var padChunkLen = this._padChunk(chunkLen, msgLen);\n this._core.hash(padChunkLen, this._padMaxChunkLen);\n var result = getRawDigest(this._heap, this._padMaxChunkLen);\n this._initState(this._heap, this._padMaxChunkLen);\n return result;\n };\n\n Rusha.prototype.end = function end() {\n return toHex(this.rawEnd().buffer);\n };\n\n return Rusha;\n}();\n\nmodule.exports = Rusha;\nmodule.exports._core = RushaCore;\n\n/***/ }),\n/* 1 */\n/***/ (function(module, exports) {\n\n/* eslint-env commonjs, browser */\n\n//\n// toHex\n//\n\nvar precomputedHex = new Array(256);\nfor (var i = 0; i < 256; i++) {\n precomputedHex[i] = (i < 0x10 ? '0' : '') + i.toString(16);\n}\n\nmodule.exports.toHex = function (arrayBuffer) {\n var binarray = new Uint8Array(arrayBuffer);\n var res = new Array(arrayBuffer.byteLength);\n for (var _i = 0; _i < res.length; _i++) {\n res[_i] = precomputedHex[binarray[_i]];\n }\n return res.join('');\n};\n\n//\n// ceilHeapSize\n//\n\nmodule.exports.ceilHeapSize = function (v) {\n // The asm.js spec says:\n // The heap object's byteLength must be either\n // 2^n for n in [12, 24) or 2^24 * n for n ≥ 1.\n // Also, byteLengths smaller than 2^16 are deprecated.\n var p = 0;\n // If v is smaller than 2^16, the smallest possible solution\n // is 2^16.\n if (v <= 65536) return 65536;\n // If v < 2^24, we round up to 2^n,\n // otherwise we round up to 2^24 * n.\n if (v < 16777216) {\n for (p = 1; p < v; p = p << 1) {}\n } else {\n for (p = 16777216; p < v; p += 16777216) {}\n }\n return p;\n};\n\n//\n// isDedicatedWorkerScope\n//\n\nmodule.exports.isDedicatedWorkerScope = function (self) {\n var isRunningInWorker = 'WorkerGlobalScope' in self && self instanceof self.WorkerGlobalScope;\n var isRunningInSharedWorker = 'SharedWorkerGlobalScope' in self && self instanceof self.SharedWorkerGlobalScope;\n var isRunningInServiceWorker = 'ServiceWorkerGlobalScope' in self && self instanceof self.ServiceWorkerGlobalScope;\n\n // Detects whether we run inside a dedicated worker or not.\n //\n // We can't just check for `DedicatedWorkerGlobalScope`, since IE11\n // has a bug where it only supports `WorkerGlobalScope`.\n //\n // Therefore, we consider us as running inside a dedicated worker\n // when we are running inside a worker, but not in a shared or service worker.\n //\n // When new types of workers are introduced, we will need to adjust this code.\n return isRunningInWorker && !isRunningInSharedWorker && !isRunningInServiceWorker;\n};\n\n/***/ }),\n/* 2 */\n/***/ (function(module, exports, __webpack_require__) {\n\n/* eslint-env commonjs, worker */\n\nmodule.exports = function () {\n var Rusha = __webpack_require__(0);\n\n var hashData = function (hasher, data, cb) {\n try {\n return cb(null, hasher.digest(data));\n } catch (e) {\n return cb(e);\n }\n };\n\n var hashFile = function (hasher, readTotal, blockSize, file, cb) {\n var reader = new self.FileReader();\n reader.onloadend = function onloadend() {\n if (reader.error) {\n return cb(reader.error);\n }\n var buffer = reader.result;\n readTotal += reader.result.byteLength;\n try {\n hasher.append(buffer);\n } catch (e) {\n cb(e);\n return;\n }\n if (readTotal < file.size) {\n hashFile(hasher, readTotal, blockSize, file, cb);\n } else {\n cb(null, hasher.end());\n }\n };\n reader.readAsArrayBuffer(file.slice(readTotal, readTotal + blockSize));\n };\n\n var workerBehaviourEnabled = true;\n\n self.onmessage = function (event) {\n if (!workerBehaviourEnabled) {\n return;\n }\n\n var data = event.data.data,\n file = event.data.file,\n id = event.data.id;\n if (typeof id === 'undefined') return;\n if (!file && !data) return;\n var blockSize = event.data.blockSize || 4 * 1024 * 1024;\n var hasher = new Rusha(blockSize);\n hasher.resetState();\n var done = function (err, hash) {\n if (!err) {\n self.postMessage({ id: id, hash: hash });\n } else {\n self.postMessage({ id: id, error: err.name });\n }\n };\n if (data) hashData(hasher, data, done);\n if (file) hashFile(hasher, 0, blockSize, file, done);\n };\n\n return function () {\n workerBehaviourEnabled = false;\n };\n};\n\n/***/ }),\n/* 3 */\n/***/ (function(module, exports, __webpack_require__) {\n\n/* eslint-env commonjs, browser */\n\nvar work = __webpack_require__(4);\nvar Rusha = __webpack_require__(0);\nvar createHash = __webpack_require__(7);\nvar runWorker = __webpack_require__(2);\n\nvar _require = __webpack_require__(1),\n isDedicatedWorkerScope = _require.isDedicatedWorkerScope;\n\nvar isRunningInDedicatedWorker = typeof self !== 'undefined' && isDedicatedWorkerScope(self);\n\nRusha.disableWorkerBehaviour = isRunningInDedicatedWorker ? runWorker() : function () {};\n\nRusha.createWorker = function () {\n var worker = work(/*require.resolve*/(2));\n var terminate = worker.terminate;\n worker.terminate = function () {\n URL.revokeObjectURL(worker.objectURL);\n terminate.call(worker);\n };\n return worker;\n};\n\nRusha.createHash = createHash;\n\nmodule.exports = Rusha;\n\n/***/ }),\n/* 4 */\n/***/ (function(module, exports, __webpack_require__) {\n\nfunction webpackBootstrapFunc (modules) {\n/******/ // The module cache\n/******/ var installedModules = {};\n\n/******/ // The require function\n/******/ function __webpack_require__(moduleId) {\n\n/******/ // Check if module is in cache\n/******/ if(installedModules[moduleId])\n/******/ return installedModules[moduleId].exports;\n\n/******/ // Create a new module (and put it into the cache)\n/******/ var module = installedModules[moduleId] = {\n/******/ i: moduleId,\n/******/ l: false,\n/******/ exports: {}\n/******/ };\n\n/******/ // Execute the module function\n/******/ modules[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n/******/ // Flag the module as loaded\n/******/ module.l = true;\n\n/******/ // Return the exports of the module\n/******/ return module.exports;\n/******/ }\n\n/******/ // expose the modules object (__webpack_modules__)\n/******/ __webpack_require__.m = modules;\n\n/******/ // expose the module cache\n/******/ __webpack_require__.c = installedModules;\n\n/******/ // identity function for calling harmony imports with the correct context\n/******/ __webpack_require__.i = function(value) { return value; };\n\n/******/ // define getter function for harmony exports\n/******/ __webpack_require__.d = function(exports, name, getter) {\n/******/ if(!__webpack_require__.o(exports, name)) {\n/******/ Object.defineProperty(exports, name, {\n/******/ configurable: false,\n/******/ enumerable: true,\n/******/ get: getter\n/******/ });\n/******/ }\n/******/ };\n\n/******/ // define __esModule on exports\n/******/ __webpack_require__.r = function(exports) {\n/******/ Object.defineProperty(exports, '__esModule', { value: true });\n/******/ };\n\n/******/ // getDefaultExport function for compatibility with non-harmony modules\n/******/ __webpack_require__.n = function(module) {\n/******/ var getter = module && module.__esModule ?\n/******/ function getDefault() { return module['default']; } :\n/******/ function getModuleExports() { return module; };\n/******/ __webpack_require__.d(getter, 'a', getter);\n/******/ return getter;\n/******/ };\n\n/******/ // Object.prototype.hasOwnProperty.call\n/******/ __webpack_require__.o = function(object, property) { return Object.prototype.hasOwnProperty.call(object, property); };\n\n/******/ // __webpack_public_path__\n/******/ __webpack_require__.p = \"/\";\n\n/******/ // on error function for async loading\n/******/ __webpack_require__.oe = function(err) { console.error(err); throw err; };\n\n var f = __webpack_require__(__webpack_require__.s = ENTRY_MODULE)\n return f.default || f // try to call default if defined to also support babel esmodule exports\n}\n\nvar moduleNameReqExp = '[\\\\.|\\\\-|\\\\+|\\\\w|\\/|@]+'\nvar dependencyRegExp = '\\\\((\\/\\\\*.*?\\\\*\\/)?\\s?.*?(' + moduleNameReqExp + ').*?\\\\)' // additional chars when output.pathinfo is true\n\n// http://stackoverflow.com/a/2593661/130442\nfunction quoteRegExp (str) {\n return (str + '').replace(/[.?*+^$[\\]\\\\(){}|-]/g, '\\\\$&')\n}\n\nfunction getModuleDependencies (sources, module, queueName) {\n var retval = {}\n retval[queueName] = []\n\n var fnString = module.toString()\n var wrapperSignature = fnString.match(/^function\\s?\\(\\w+,\\s*\\w+,\\s*(\\w+)\\)/)\n if (!wrapperSignature) return retval\n var webpackRequireName = wrapperSignature[1]\n\n // main bundle deps\n var re = new RegExp('(\\\\\\\\n|\\\\W)' + quoteRegExp(webpackRequireName) + dependencyRegExp, 'g')\n var match\n while ((match = re.exec(fnString))) {\n if (match[3] === 'dll-reference') continue\n retval[queueName].push(match[3])\n }\n\n // dll deps\n re = new RegExp('\\\\(' + quoteRegExp(webpackRequireName) + '\\\\(\"(dll-reference\\\\s(' + moduleNameReqExp + '))\"\\\\)\\\\)' + dependencyRegExp, 'g')\n while ((match = re.exec(fnString))) {\n if (!sources[match[2]]) {\n retval[queueName].push(match[1])\n sources[match[2]] = __webpack_require__(match[1]).m\n }\n retval[match[2]] = retval[match[2]] || []\n retval[match[2]].push(match[4])\n }\n\n return retval\n}\n\nfunction hasValuesInQueues (queues) {\n var keys = Object.keys(queues)\n return keys.reduce(function (hasValues, key) {\n return hasValues || queues[key].length > 0\n }, false)\n}\n\nfunction getRequiredModules (sources, moduleId) {\n var modulesQueue = {\n main: [moduleId]\n }\n var requiredModules = {\n main: []\n }\n var seenModules = {\n main: {}\n }\n\n while (hasValuesInQueues(modulesQueue)) {\n var queues = Object.keys(modulesQueue)\n for (var i = 0; i < queues.length; i++) {\n var queueName = queues[i]\n var queue = modulesQueue[queueName]\n var moduleToCheck = queue.pop()\n seenModules[queueName] = seenModules[queueName] || {}\n if (seenModules[queueName][moduleToCheck] || !sources[queueName][moduleToCheck]) continue\n seenModules[queueName][moduleToCheck] = true\n requiredModules[queueName] = requiredModules[queueName] || []\n requiredModules[queueName].push(moduleToCheck)\n var newModules = getModuleDependencies(sources, sources[queueName][moduleToCheck], queueName)\n var newModulesKeys = Object.keys(newModules)\n for (var j = 0; j < newModulesKeys.length; j++) {\n modulesQueue[newModulesKeys[j]] = modulesQueue[newModulesKeys[j]] || []\n modulesQueue[newModulesKeys[j]] = modulesQueue[newModulesKeys[j]].concat(newModules[newModulesKeys[j]])\n }\n }\n }\n\n return requiredModules\n}\n\nmodule.exports = function (moduleId, options) {\n options = options || {}\n var sources = {\n main: __webpack_require__.m\n }\n\n var requiredModules = options.all ? { main: Object.keys(sources) } : getRequiredModules(sources, moduleId)\n\n var src = ''\n\n Object.keys(requiredModules).filter(function (m) { return m !== 'main' }).forEach(function (module) {\n var entryModule = 0\n while (requiredModules[module][entryModule]) {\n entryModule++\n }\n requiredModules[module].push(entryModule)\n sources[module][entryModule] = '(function(module, exports, __webpack_require__) { module.exports = __webpack_require__; })'\n src = src + 'var ' + module + ' = (' + webpackBootstrapFunc.toString().replace('ENTRY_MODULE', JSON.stringify(entryModule)) + ')({' + requiredModules[module].map(function (id) { return '' + JSON.stringify(id) + ': ' + sources[module][id].toString() }).join(',') + '});\\n'\n })\n\n src = src + '(' + webpackBootstrapFunc.toString().replace('ENTRY_MODULE', JSON.stringify(moduleId)) + ')({' + requiredModules.main.map(function (id) { return '' + JSON.stringify(id) + ': ' + sources.main[id].toString() }).join(',') + '})(self);'\n\n var blob = new window.Blob([src], { type: 'text/javascript' })\n if (options.bare) { return blob }\n\n var URL = window.URL || window.webkitURL || window.mozURL || window.msURL\n\n var workerUrl = URL.createObjectURL(blob)\n var worker = new window.Worker(workerUrl)\n worker.objectURL = workerUrl\n\n return worker\n}\n\n\n/***/ }),\n/* 5 */\n/***/ (function(module, exports) {\n\n// The low-level RushCore module provides the heart of Rusha,\n// a high-speed sha1 implementation working on an Int32Array heap.\n// At first glance, the implementation seems complicated, however\n// with the SHA1 spec at hand, it is obvious this almost a textbook\n// implementation that has a few functions hand-inlined and a few loops\n// hand-unrolled.\nmodule.exports = function RushaCore(stdlib$840, foreign$841, heap$842) {\n 'use asm';\n var H$843 = new stdlib$840.Int32Array(heap$842);\n function hash$844(k$845, x$846) {\n // k in bytes\n k$845 = k$845 | 0;\n x$846 = x$846 | 0;\n var i$847 = 0, j$848 = 0, y0$849 = 0, z0$850 = 0, y1$851 = 0, z1$852 = 0, y2$853 = 0, z2$854 = 0, y3$855 = 0, z3$856 = 0, y4$857 = 0, z4$858 = 0, t0$859 = 0, t1$860 = 0;\n y0$849 = H$843[x$846 + 320 >> 2] | 0;\n y1$851 = H$843[x$846 + 324 >> 2] | 0;\n y2$853 = H$843[x$846 + 328 >> 2] | 0;\n y3$855 = H$843[x$846 + 332 >> 2] | 0;\n y4$857 = H$843[x$846 + 336 >> 2] | 0;\n for (i$847 = 0; (i$847 | 0) < (k$845 | 0); i$847 = i$847 + 64 | 0) {\n z0$850 = y0$849;\n z1$852 = y1$851;\n z2$854 = y2$853;\n z3$856 = y3$855;\n z4$858 = y4$857;\n for (j$848 = 0; (j$848 | 0) < 64; j$848 = j$848 + 4 | 0) {\n t1$860 = H$843[i$847 + j$848 >> 2] | 0;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | ~y1$851 & y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1518500249 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[k$845 + j$848 >> 2] = t1$860;\n }\n for (j$848 = k$845 + 64 | 0; (j$848 | 0) < (k$845 + 80 | 0); j$848 = j$848 + 4 | 0) {\n t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | ~y1$851 & y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1518500249 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[j$848 >> 2] = t1$860;\n }\n for (j$848 = k$845 + 80 | 0; (j$848 | 0) < (k$845 + 160 | 0); j$848 = j$848 + 4 | 0) {\n t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 ^ y2$853 ^ y3$855) | 0) + ((t1$860 + y4$857 | 0) + 1859775393 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[j$848 >> 2] = t1$860;\n }\n for (j$848 = k$845 + 160 | 0; (j$848 | 0) < (k$845 + 240 | 0); j$848 = j$848 + 4 | 0) {\n t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 & y2$853 | y1$851 & y3$855 | y2$853 & y3$855) | 0) + ((t1$860 + y4$857 | 0) - 1894007588 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[j$848 >> 2] = t1$860;\n }\n for (j$848 = k$845 + 240 | 0; (j$848 | 0) < (k$845 + 320 | 0); j$848 = j$848 + 4 | 0) {\n t1$860 = (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) << 1 | (H$843[j$848 - 12 >> 2] ^ H$843[j$848 - 32 >> 2] ^ H$843[j$848 - 56 >> 2] ^ H$843[j$848 - 64 >> 2]) >>> 31;\n t0$859 = ((y0$849 << 5 | y0$849 >>> 27) + (y1$851 ^ y2$853 ^ y3$855) | 0) + ((t1$860 + y4$857 | 0) - 899497514 | 0) | 0;\n y4$857 = y3$855;\n y3$855 = y2$853;\n y2$853 = y1$851 << 30 | y1$851 >>> 2;\n y1$851 = y0$849;\n y0$849 = t0$859;\n H$843[j$848 >> 2] = t1$860;\n }\n y0$849 = y0$849 + z0$850 | 0;\n y1$851 = y1$851 + z1$852 | 0;\n y2$853 = y2$853 + z2$854 | 0;\n y3$855 = y3$855 + z3$856 | 0;\n y4$857 = y4$857 + z4$858 | 0;\n }\n H$843[x$846 + 320 >> 2] = y0$849;\n H$843[x$846 + 324 >> 2] = y1$851;\n H$843[x$846 + 328 >> 2] = y2$853;\n H$843[x$846 + 332 >> 2] = y3$855;\n H$843[x$846 + 336 >> 2] = y4$857;\n }\n return { hash: hash$844 };\n};\n\n/***/ }),\n/* 6 */\n/***/ (function(module, exports) {\n\nvar _this = this;\n\n/* eslint-env commonjs, browser */\n\nvar reader = void 0;\nif (typeof self !== 'undefined' && typeof self.FileReaderSync !== 'undefined') {\n reader = new self.FileReaderSync();\n}\n\n// Convert a binary string and write it to the heap.\n// A binary string is expected to only contain char codes < 256.\nvar convStr = function (str, H8, H32, start, len, off) {\n var i = void 0,\n om = off % 4,\n lm = (len + om) % 4,\n j = len - lm;\n switch (om) {\n case 0:\n H8[off] = str.charCodeAt(start + 3);\n case 1:\n H8[off + 1 - (om << 1) | 0] = str.charCodeAt(start + 2);\n case 2:\n H8[off + 2 - (om << 1) | 0] = str.charCodeAt(start + 1);\n case 3:\n H8[off + 3 - (om << 1) | 0] = str.charCodeAt(start);\n }\n if (len < lm + (4 - om)) {\n return;\n }\n for (i = 4 - om; i < j; i = i + 4 | 0) {\n H32[off + i >> 2] = str.charCodeAt(start + i) << 24 | str.charCodeAt(start + i + 1) << 16 | str.charCodeAt(start + i + 2) << 8 | str.charCodeAt(start + i + 3);\n }\n switch (lm) {\n case 3:\n H8[off + j + 1 | 0] = str.charCodeAt(start + j + 2);\n case 2:\n H8[off + j + 2 | 0] = str.charCodeAt(start + j + 1);\n case 1:\n H8[off + j + 3 | 0] = str.charCodeAt(start + j);\n }\n};\n\n// Convert a buffer or array and write it to the heap.\n// The buffer or array is expected to only contain elements < 256.\nvar convBuf = function (buf, H8, H32, start, len, off) {\n var i = void 0,\n om = off % 4,\n lm = (len + om) % 4,\n j = len - lm;\n switch (om) {\n case 0:\n H8[off] = buf[start + 3];\n case 1:\n H8[off + 1 - (om << 1) | 0] = buf[start + 2];\n case 2:\n H8[off + 2 - (om << 1) | 0] = buf[start + 1];\n case 3:\n H8[off + 3 - (om << 1) | 0] = buf[start];\n }\n if (len < lm + (4 - om)) {\n return;\n }\n for (i = 4 - om; i < j; i = i + 4 | 0) {\n H32[off + i >> 2 | 0] = buf[start + i] << 24 | buf[start + i + 1] << 16 | buf[start + i + 2] << 8 | buf[start + i + 3];\n }\n switch (lm) {\n case 3:\n H8[off + j + 1 | 0] = buf[start + j + 2];\n case 2:\n H8[off + j + 2 | 0] = buf[start + j + 1];\n case 1:\n H8[off + j + 3 | 0] = buf[start + j];\n }\n};\n\nvar convBlob = function (blob, H8, H32, start, len, off) {\n var i = void 0,\n om = off % 4,\n lm = (len + om) % 4,\n j = len - lm;\n var buf = new Uint8Array(reader.readAsArrayBuffer(blob.slice(start, start + len)));\n switch (om) {\n case 0:\n H8[off] = buf[3];\n case 1:\n H8[off + 1 - (om << 1) | 0] = buf[2];\n case 2:\n H8[off + 2 - (om << 1) | 0] = buf[1];\n case 3:\n H8[off + 3 - (om << 1) | 0] = buf[0];\n }\n if (len < lm + (4 - om)) {\n return;\n }\n for (i = 4 - om; i < j; i = i + 4 | 0) {\n H32[off + i >> 2 | 0] = buf[i] << 24 | buf[i + 1] << 16 | buf[i + 2] << 8 | buf[i + 3];\n }\n switch (lm) {\n case 3:\n H8[off + j + 1 | 0] = buf[j + 2];\n case 2:\n H8[off + j + 2 | 0] = buf[j + 1];\n case 1:\n H8[off + j + 3 | 0] = buf[j];\n }\n};\n\nmodule.exports = function (data, H8, H32, start, len, off) {\n if (typeof data === 'string') {\n return convStr(data, H8, H32, start, len, off);\n }\n if (data instanceof Array) {\n return convBuf(data, H8, H32, start, len, off);\n }\n // Safely doing a Buffer check using \"this\" to avoid Buffer polyfill to be included in the dist\n if (_this && _this.Buffer && _this.Buffer.isBuffer(data)) {\n return convBuf(data, H8, H32, start, len, off);\n }\n if (data instanceof ArrayBuffer) {\n return convBuf(new Uint8Array(data), H8, H32, start, len, off);\n }\n if (data.buffer instanceof ArrayBuffer) {\n return convBuf(new Uint8Array(data.buffer, data.byteOffset, data.byteLength), H8, H32, start, len, off);\n }\n if (data instanceof Blob) {\n return convBlob(data, H8, H32, start, len, off);\n }\n throw new Error('Unsupported data type.');\n};\n\n/***/ }),\n/* 7 */\n/***/ (function(module, exports, __webpack_require__) {\n\nvar _createClass = function () { function defineProperties(target, props) { for (var i = 0; i < props.length; i++) { var descriptor = props[i]; descriptor.enumerable = descriptor.enumerable || false; descriptor.configurable = true; if (\"value\" in descriptor) descriptor.writable = true; Object.defineProperty(target, descriptor.key, descriptor); } } return function (Constructor, protoProps, staticProps) { if (protoProps) defineProperties(Constructor.prototype, protoProps); if (staticProps) defineProperties(Constructor, staticProps); return Constructor; }; }();\n\nfunction _classCallCheck(instance, Constructor) { if (!(instance instanceof Constructor)) { throw new TypeError(\"Cannot call a class as a function\"); } }\n\n/* eslint-env commonjs, browser */\n\nvar Rusha = __webpack_require__(0);\n\nvar _require = __webpack_require__(1),\n toHex = _require.toHex;\n\nvar Hash = function () {\n function Hash() {\n _classCallCheck(this, Hash);\n\n this._rusha = new Rusha();\n this._rusha.resetState();\n }\n\n Hash.prototype.update = function update(data) {\n this._rusha.append(data);\n return this;\n };\n\n Hash.prototype.digest = function digest(encoding) {\n var digest = this._rusha.rawEnd().buffer;\n if (!encoding) {\n return digest;\n }\n if (encoding === 'hex') {\n return toHex(digest);\n }\n throw new Error('unsupported digest encoding');\n };\n\n _createClass(Hash, [{\n key: 'state',\n get: function () {\n return this._rusha.getState();\n },\n set: function (state) {\n this._rusha.setState(state);\n }\n }]);\n\n return Hash;\n}();\n\nmodule.exports = function () {\n return new Hash();\n};\n\n/***/ })\n/******/ ]);\n});","/*! safe-buffer. MIT License. Feross Aboukhadijeh */\n/* eslint-disable node/no-deprecated-api */\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\n// alternative to using Object.keys for old browsers\nfunction copyProps (src, dst) {\n for (var key in src) {\n dst[key] = src[key]\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}\n\nSafeBuffer.prototype = Object.create(Buffer.prototype)\n\n// Copy static methods from Buffer\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 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 var buf = Buffer(size)\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 return buf\n}\n\nSafeBuffer.allocUnsafe = function (size) {\n if (typeof size !== 'number') {\n throw new TypeError('Argument must be a number')\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 return buffer.SlowBuffer(size)\n}\n","/* eslint-disable node/no-deprecated-api */\n\n'use strict'\n\nvar buffer = require('buffer')\nvar Buffer = buffer.Buffer\n\nvar safer = {}\n\nvar key\n\nfor (key in buffer) {\n if (!buffer.hasOwnProperty(key)) continue\n if (key === 'SlowBuffer' || key === 'Buffer') continue\n safer[key] = buffer[key]\n}\n\nvar Safer = safer.Buffer = {}\nfor (key in Buffer) {\n if (!Buffer.hasOwnProperty(key)) continue\n if (key === 'allocUnsafe' || key === 'allocUnsafeSlow') continue\n Safer[key] = Buffer[key]\n}\n\nsafer.Buffer.prototype = Buffer.prototype\n\nif (!Safer.from || Safer.from === Uint8Array.from) {\n Safer.from = function (value, encodingOrOffset, length) {\n if (typeof value === 'number') {\n throw new TypeError('The \"value\" argument must not be of type number. Received type ' + typeof value)\n }\n if (value && typeof value.length === 'undefined') {\n throw new TypeError('The first argument must be one of type string, Buffer, ArrayBuffer, Array, or Array-like Object. Received type ' + typeof value)\n }\n return Buffer(value, encodingOrOffset, length)\n }\n}\n\nif (!Safer.alloc) {\n Safer.alloc = function (size, fill, encoding) {\n if (typeof size !== 'number') {\n throw new TypeError('The \"size\" argument must be of type number. Received type ' + typeof size)\n }\n if (size < 0 || size >= 2 * (1 << 30)) {\n throw new RangeError('The value \"' + size + '\" is invalid for option \"size\"')\n }\n var buf = Buffer(size)\n if (!fill || fill.length === 0) {\n buf.fill(0)\n } else if (typeof encoding === 'string') {\n buf.fill(fill, encoding)\n } else {\n buf.fill(fill)\n }\n return buf\n }\n}\n\nif (!safer.kStringMaxLength) {\n try {\n safer.kStringMaxLength = process.binding('buffer').kStringMaxLength\n } catch (e) {\n // we can't determine kStringMaxLength in environments where process.binding\n // is unsupported, so let's not set it\n }\n}\n\nif (!safer.constants) {\n safer.constants = {\n MAX_LENGTH: safer.kMaxLength\n }\n if (safer.kStringMaxLength) {\n safer.constants.MAX_STRING_LENGTH = safer.kStringMaxLength\n }\n}\n\nmodule.exports = safer\n","var Buffer = require('safe-buffer').Buffer\n\n// prototype class for hash functions\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\n this._block[rem] = 0x80\n\n // 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 this._block.fill(0, rem + 1)\n\n if (rem >= this._finalSize) {\n this._update(this._block)\n this._block.fill(0)\n }\n\n var bits = this._len * 8\n\n // uint32\n if (bits <= 0xffffffff) {\n this._block.writeUInt32BE(bits, this._blockSize - 4)\n\n // uint64\n } else {\n var lowBits = (bits & 0xffffffff) >>> 0\n var highBits = (bits - lowBits) / 0x100000000\n\n this._block.writeUInt32BE(highBits, this._blockSize - 8)\n this._block.writeUInt32BE(lowBits, this._blockSize - 4)\n }\n\n this._update(this._block)\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\n","var exports = module.exports = function SHA (algorithm) {\n algorithm = algorithm.toLowerCase()\n\n var Algorithm = exports[algorithm]\n if (!Algorithm) throw new Error(algorithm + ' is not supported (we accept pull requests)')\n\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')\n","/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-0, as defined\n * in FIPS PUB 180-1\n * This source code is derived from sha1.js of the same repository.\n * The difference between SHA-0 and SHA-1 is just a bitwise rotate left\n * operation was added.\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n]\n\nvar W = new Array(80)\n\nfunction Sha () {\n this.init()\n this._w = W\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha, Hash)\n\nSha.prototype.init = function () {\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n this._e = 0xc3d2e1f0\n\n return this\n}\n\nfunction rotl5 (num) {\n return (num << 5) | (num >>> 27)\n}\n\nfunction rotl30 (num) {\n return (num << 30) | (num >>> 2)\n}\n\nfunction ft (s, b, c, d) {\n if (s === 0) return (b & c) | ((~b) & d)\n if (s === 2) return (b & c) | (b & d) | (c & d)\n return b ^ c ^ d\n}\n\nSha.prototype._update = function (M) {\n var W = this._w\n\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\n for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n for (; i < 80; ++i) W[i] = W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16]\n\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20)\n var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0\n\n e = d\n d = c\n c = rotl30(b)\n b = a\n a = t\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}\n\nSha.prototype._hash = function () {\n var H = Buffer.allocUnsafe(20)\n\n H.writeInt32BE(this._a | 0, 0)\n H.writeInt32BE(this._b | 0, 4)\n H.writeInt32BE(this._c | 0, 8)\n H.writeInt32BE(this._d | 0, 12)\n H.writeInt32BE(this._e | 0, 16)\n\n return H\n}\n\nmodule.exports = Sha\n","/*\n * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\n * in FIPS PUB 180-1\n * Version 2.1a Copyright Paul Johnston 2000 - 2002.\n * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\n * Distributed under the BSD License\n * See http://pajhome.org.uk/crypt/md5 for details.\n */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x5a827999, 0x6ed9eba1, 0x8f1bbcdc | 0, 0xca62c1d6 | 0\n]\n\nvar W = new Array(80)\n\nfunction Sha1 () {\n this.init()\n this._w = W\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha1, Hash)\n\nSha1.prototype.init = function () {\n this._a = 0x67452301\n this._b = 0xefcdab89\n this._c = 0x98badcfe\n this._d = 0x10325476\n this._e = 0xc3d2e1f0\n\n return this\n}\n\nfunction rotl1 (num) {\n return (num << 1) | (num >>> 31)\n}\n\nfunction rotl5 (num) {\n return (num << 5) | (num >>> 27)\n}\n\nfunction rotl30 (num) {\n return (num << 30) | (num >>> 2)\n}\n\nfunction ft (s, b, c, d) {\n if (s === 0) return (b & c) | ((~b) & d)\n if (s === 2) return (b & c) | (b & d) | (c & d)\n return b ^ c ^ d\n}\n\nSha1.prototype._update = function (M) {\n var W = this._w\n\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\n for (var i = 0; i < 16; ++i) W[i] = M.readInt32BE(i * 4)\n for (; i < 80; ++i) W[i] = rotl1(W[i - 3] ^ W[i - 8] ^ W[i - 14] ^ W[i - 16])\n\n for (var j = 0; j < 80; ++j) {\n var s = ~~(j / 20)\n var t = (rotl5(a) + ft(s, b, c, d) + e + W[j] + K[s]) | 0\n\n e = d\n d = c\n c = rotl30(b)\n b = a\n a = t\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}\n\nSha1.prototype._hash = function () {\n var H = Buffer.allocUnsafe(20)\n\n H.writeInt32BE(this._a | 0, 0)\n H.writeInt32BE(this._b | 0, 4)\n H.writeInt32BE(this._c | 0, 8)\n H.writeInt32BE(this._d | 0, 12)\n H.writeInt32BE(this._e | 0, 16)\n\n return H\n}\n\nmodule.exports = Sha1\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 */\n\nvar inherits = require('inherits')\nvar Sha256 = require('./sha256')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar W = new Array(64)\n\nfunction Sha224 () {\n this.init()\n\n this._w = W // new Array(64)\n\n Hash.call(this, 64, 56)\n}\n\ninherits(Sha224, Sha256)\n\nSha224.prototype.init = function () {\n this._a = 0xc1059ed8\n this._b = 0x367cd507\n this._c = 0x3070dd17\n this._d = 0xf70e5939\n this._e = 0xffc00b31\n this._f = 0x68581511\n this._g = 0x64f98fa7\n this._h = 0xbefa4fa4\n\n return this\n}\n\nSha224.prototype._hash = function () {\n var H = Buffer.allocUnsafe(28)\n\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\n return H\n}\n\nmodule.exports = Sha224\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 */\n\nvar inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,\n 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,\n 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,\n 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,\n 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,\n 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,\n 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,\n 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,\n 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,\n 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,\n 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,\n 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,\n 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,\n 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,\n 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,\n 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2\n]\n\nvar W = new Array(64)\n\nfunction Sha256 () {\n this.init()\n\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\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\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) W[i] = M.readInt32BE(i * 4)\n for (; i < 64; ++i) W[i] = (gamma1(W[i - 2]) + W[i - 7] + gamma0(W[i - 15]) + W[i - 16]) | 0\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\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\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\n return H\n}\n\nmodule.exports = Sha256\n","var inherits = require('inherits')\nvar SHA512 = require('./sha512')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar W = new Array(160)\n\nfunction Sha384 () {\n this.init()\n this._w = W\n\n Hash.call(this, 128, 112)\n}\n\ninherits(Sha384, SHA512)\n\nSha384.prototype.init = function () {\n this._ah = 0xcbbb9d5d\n this._bh = 0x629a292a\n this._ch = 0x9159015a\n this._dh = 0x152fecd8\n this._eh = 0x67332667\n this._fh = 0x8eb44a87\n this._gh = 0xdb0c2e0d\n this._hh = 0x47b5481d\n\n this._al = 0xc1059ed8\n this._bl = 0x367cd507\n this._cl = 0x3070dd17\n this._dl = 0xf70e5939\n this._el = 0xffc00b31\n this._fl = 0x68581511\n this._gl = 0x64f98fa7\n this._hl = 0xbefa4fa4\n\n return this\n}\n\nSha384.prototype._hash = function () {\n var H = Buffer.allocUnsafe(48)\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\n return H\n}\n\nmodule.exports = Sha384\n","var inherits = require('inherits')\nvar Hash = require('./hash')\nvar Buffer = require('safe-buffer').Buffer\n\nvar K = [\n 0x428a2f98, 0xd728ae22, 0x71374491, 0x23ef65cd,\n 0xb5c0fbcf, 0xec4d3b2f, 0xe9b5dba5, 0x8189dbbc,\n 0x3956c25b, 0xf348b538, 0x59f111f1, 0xb605d019,\n 0x923f82a4, 0xaf194f9b, 0xab1c5ed5, 0xda6d8118,\n 0xd807aa98, 0xa3030242, 0x12835b01, 0x45706fbe,\n 0x243185be, 0x4ee4b28c, 0x550c7dc3, 0xd5ffb4e2,\n 0x72be5d74, 0xf27b896f, 0x80deb1fe, 0x3b1696b1,\n 0x9bdc06a7, 0x25c71235, 0xc19bf174, 0xcf692694,\n 0xe49b69c1, 0x9ef14ad2, 0xefbe4786, 0x384f25e3,\n 0x0fc19dc6, 0x8b8cd5b5, 0x240ca1cc, 0x77ac9c65,\n 0x2de92c6f, 0x592b0275, 0x4a7484aa, 0x6ea6e483,\n 0x5cb0a9dc, 0xbd41fbd4, 0x76f988da, 0x831153b5,\n 0x983e5152, 0xee66dfab, 0xa831c66d, 0x2db43210,\n 0xb00327c8, 0x98fb213f, 0xbf597fc7, 0xbeef0ee4,\n 0xc6e00bf3, 0x3da88fc2, 0xd5a79147, 0x930aa725,\n 0x06ca6351, 0xe003826f, 0x14292967, 0x0a0e6e70,\n 0x27b70a85, 0x46d22ffc, 0x2e1b2138, 0x5c26c926,\n 0x4d2c6dfc, 0x5ac42aed, 0x53380d13, 0x9d95b3df,\n 0x650a7354, 0x8baf63de, 0x766a0abb, 0x3c77b2a8,\n 0x81c2c92e, 0x47edaee6, 0x92722c85, 0x1482353b,\n 0xa2bfe8a1, 0x4cf10364, 0xa81a664b, 0xbc423001,\n 0xc24b8b70, 0xd0f89791, 0xc76c51a3, 0x0654be30,\n 0xd192e819, 0xd6ef5218, 0xd6990624, 0x5565a910,\n 0xf40e3585, 0x5771202a, 0x106aa070, 0x32bbd1b8,\n 0x19a4c116, 0xb8d2d0c8, 0x1e376c08, 0x5141ab53,\n 0x2748774c, 0xdf8eeb99, 0x34b0bcb5, 0xe19b48a8,\n 0x391c0cb3, 0xc5c95a63, 0x4ed8aa4a, 0xe3418acb,\n 0x5b9cca4f, 0x7763e373, 0x682e6ff3, 0xd6b2b8a3,\n 0x748f82ee, 0x5defb2fc, 0x78a5636f, 0x43172f60,\n 0x84c87814, 0xa1f0ab72, 0x8cc70208, 0x1a6439ec,\n 0x90befffa, 0x23631e28, 0xa4506ceb, 0xde82bde9,\n 0xbef9a3f7, 0xb2c67915, 0xc67178f2, 0xe372532b,\n 0xca273ece, 0xea26619c, 0xd186b8c7, 0x21c0c207,\n 0xeada7dd6, 0xcde0eb1e, 0xf57d4f7f, 0xee6ed178,\n 0x06f067aa, 0x72176fba, 0x0a637dc5, 0xa2c898a6,\n 0x113f9804, 0xbef90dae, 0x1b710b35, 0x131c471b,\n 0x28db77f5, 0x23047d84, 0x32caab7b, 0x40c72493,\n 0x3c9ebe0a, 0x15c9bebc, 0x431d67c4, 0x9c100d4c,\n 0x4cc5d4be, 0xcb3e42b6, 0x597f299c, 0xfc657e2a,\n 0x5fcb6fab, 0x3ad6faec, 0x6c44198c, 0x4a475817\n]\n\nvar W = new Array(160)\n\nfunction Sha512 () {\n this.init()\n this._w = W\n\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\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\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\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\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 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\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)\n\n // W[i] = gamma0 + W[i - 7] + gamma1 + W[i - 16]\n var Wi7h = W[i - 7 * 2]\n var Wi7l = W[i - 7 * 2 + 1]\n\n var Wi16h = W[i - 16 * 2]\n var Wi16l = W[i - 16 * 2 + 1]\n\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\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\n var majh = maj(ah, bh, ch)\n var majl = maj(al, bl, cl)\n\n var sigma0h = sigma0(ah, al)\n var sigma0l = sigma0(al, ah)\n var sigma1h = sigma1(eh, el)\n var sigma1l = sigma1(el, eh)\n\n // t1 = h + sigma1 + ch + K[j] + W[j]\n var Kih = K[j]\n var Kil = K[j + 1]\n\n var chh = Ch(eh, fh, gh)\n var chl = Ch(el, fl, gl)\n\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\n\n // t2 = sigma0 + maj\n var t2l = (sigma0l + majl) | 0\n var t2h = (sigma0h + majh + getCarry(t2l, sigma0l)) | 0\n\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\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\n return H\n}\n\nmodule.exports = Sha512\n","/*! simple-concat. MIT License. Feross Aboukhadijeh */\nmodule.exports = function (stream, cb) {\n var chunks = []\n stream.on('data', function (chunk) {\n chunks.push(chunk)\n })\n stream.once('end', function () {\n if (cb) cb(null, Buffer.concat(chunks))\n cb = null\n })\n stream.once('error', function (err) {\n if (cb) cb(err)\n cb = null\n })\n}\n","/*! simple-get. MIT License. Feross Aboukhadijeh */\nmodule.exports = simpleGet\n\nconst concat = require('simple-concat')\nconst decompressResponse = require('decompress-response') // excluded from browser build\nconst http = require('http')\nconst https = require('https')\nconst once = require('once')\nconst querystring = require('querystring')\nconst url = require('url')\n\nconst isStream = o => o !== null && typeof o === 'object' && typeof o.pipe === 'function'\n\nfunction simpleGet (opts, cb) {\n opts = Object.assign({ maxRedirects: 10 }, typeof opts === 'string' ? { url: opts } : opts)\n cb = once(cb)\n\n if (opts.url) {\n const { hostname, port, protocol, auth, path } = url.parse(opts.url) // eslint-disable-line node/no-deprecated-api\n delete opts.url\n if (!hostname && !port && !protocol && !auth) opts.path = path // Relative redirect\n else Object.assign(opts, { hostname, port, protocol, auth, path }) // Absolute redirect\n }\n\n const headers = { 'accept-encoding': 'gzip, deflate' }\n if (opts.headers) Object.keys(opts.headers).forEach(k => (headers[k.toLowerCase()] = opts.headers[k]))\n opts.headers = headers\n\n let body\n if (opts.body) {\n body = opts.json && !isStream(opts.body) ? JSON.stringify(opts.body) : opts.body\n } else if (opts.form) {\n body = typeof opts.form === 'string' ? opts.form : querystring.stringify(opts.form)\n opts.headers['content-type'] = 'application/x-www-form-urlencoded'\n }\n\n if (body) {\n if (!opts.method) opts.method = 'POST'\n if (!isStream(body)) opts.headers['content-length'] = Buffer.byteLength(body)\n if (opts.json && !opts.form) opts.headers['content-type'] = 'application/json'\n }\n delete opts.body; delete opts.form\n\n if (opts.json) opts.headers.accept = 'application/json'\n if (opts.method) opts.method = opts.method.toUpperCase()\n\n const originalHost = opts.hostname // hostname before potential redirect\n const protocol = opts.protocol === 'https:' ? https : http // Support http/https urls\n const req = protocol.request(opts, res => {\n if (opts.followRedirects !== false && res.statusCode >= 300 && res.statusCode < 400 && res.headers.location) {\n opts.url = res.headers.location // Follow 3xx redirects\n delete opts.headers.host // Discard `host` header on redirect (see #32)\n res.resume() // Discard response\n\n const redirectHost = url.parse(opts.url).hostname // eslint-disable-line node/no-deprecated-api\n // If redirected host is different than original host, drop headers to prevent cookie leak (#73)\n if (redirectHost !== null && redirectHost !== originalHost) {\n delete opts.headers.cookie\n delete opts.headers.authorization\n }\n\n if (opts.method === 'POST' && [301, 302].includes(res.statusCode)) {\n opts.method = 'GET' // On 301/302 redirect, change POST to GET (see #35)\n delete opts.headers['content-length']; delete opts.headers['content-type']\n }\n\n if (opts.maxRedirects-- === 0) return cb(new Error('too many redirects'))\n else return simpleGet(opts, cb)\n }\n\n const tryUnzip = typeof decompressResponse === 'function' && opts.method !== 'HEAD'\n cb(null, tryUnzip ? decompressResponse(res) : res)\n })\n req.on('timeout', () => {\n req.abort()\n cb(new Error('Request timed out'))\n })\n req.on('error', cb)\n\n if (isStream(body)) body.on('error', cb).pipe(req)\n else req.end(body)\n\n return req\n}\n\nsimpleGet.concat = (opts, cb) => {\n return simpleGet(opts, (err, res) => {\n if (err) return cb(err)\n concat(res, (err, data) => {\n if (err) return cb(err)\n if (opts.json) {\n try {\n data = JSON.parse(data.toString())\n } catch (err) {\n return cb(err, res, data)\n }\n }\n cb(null, res, data)\n })\n })\n}\n\n;['get', 'post', 'put', 'patch', 'head', 'delete'].forEach(method => {\n simpleGet[method] = (opts, cb) => {\n if (typeof opts === 'string') opts = { url: opts }\n return simpleGet(Object.assign({ method: method.toUpperCase() }, opts), cb)\n }\n})\n","/*! simple-peer. MIT License. Feross Aboukhadijeh */\nconst debug = require('debug')('simple-peer')\nconst getBrowserRTC = require('get-browser-rtc')\nconst randombytes = require('randombytes')\nconst stream = require('readable-stream')\nconst queueMicrotask = require('queue-microtask') // TODO: remove when Node 10 is not supported\nconst errCode = require('err-code')\nconst { Buffer } = require('buffer')\n\nconst MAX_BUFFERED_AMOUNT = 64 * 1024\nconst ICECOMPLETE_TIMEOUT = 5 * 1000\nconst CHANNEL_CLOSING_TIMEOUT = 5 * 1000\n\n// HACK: Filter trickle lines when trickle is disabled #354\nfunction filterTrickle (sdp) {\n return sdp.replace(/a=ice-options:trickle\\s\\n/g, '')\n}\n\nfunction warn (message) {\n console.warn(message)\n}\n\n/**\n * WebRTC peer connection. Same API as node core `net.Socket`, plus a few extra methods.\n * Duplex stream.\n * @param {Object} opts\n */\nclass Peer extends stream.Duplex {\n constructor (opts) {\n opts = Object.assign({\n allowHalfOpen: false\n }, opts)\n\n super(opts)\n\n this._id = randombytes(4).toString('hex').slice(0, 7)\n this._debug('new peer %o', opts)\n\n this.channelName = opts.initiator\n ? opts.channelName || randombytes(20).toString('hex')\n : null\n\n this.initiator = opts.initiator || false\n this.channelConfig = opts.channelConfig || Peer.channelConfig\n this.channelNegotiated = this.channelConfig.negotiated\n this.config = Object.assign({}, Peer.config, opts.config)\n this.offerOptions = opts.offerOptions || {}\n this.answerOptions = opts.answerOptions || {}\n this.sdpTransform = opts.sdpTransform || (sdp => sdp)\n this.streams = opts.streams || (opts.stream ? [opts.stream] : []) // support old \"stream\" option\n this.trickle = opts.trickle !== undefined ? opts.trickle : true\n this.allowHalfTrickle = opts.allowHalfTrickle !== undefined ? opts.allowHalfTrickle : false\n this.iceCompleteTimeout = opts.iceCompleteTimeout || ICECOMPLETE_TIMEOUT\n\n this.destroyed = false\n this.destroying = false\n this._connected = false\n\n this.remoteAddress = undefined\n this.remoteFamily = undefined\n this.remotePort = undefined\n this.localAddress = undefined\n this.localFamily = undefined\n this.localPort = undefined\n\n this._wrtc = (opts.wrtc && typeof opts.wrtc === 'object')\n ? opts.wrtc\n : getBrowserRTC()\n\n if (!this._wrtc) {\n if (typeof window === 'undefined') {\n throw errCode(new Error('No WebRTC support: Specify `opts.wrtc` option in this environment'), 'ERR_WEBRTC_SUPPORT')\n } else {\n throw errCode(new Error('No WebRTC support: Not a supported browser'), 'ERR_WEBRTC_SUPPORT')\n }\n }\n\n this._pcReady = false\n this._channelReady = false\n this._iceComplete = false // ice candidate trickle done (got null candidate)\n this._iceCompleteTimer = null // send an offer/answer anyway after some timeout\n this._channel = null\n this._pendingCandidates = []\n\n this._isNegotiating = false // is this peer waiting for negotiation to complete?\n this._firstNegotiation = true\n this._batchedNegotiation = false // batch synchronous negotiations\n this._queuedNegotiation = false // is there a queued negotiation request?\n this._sendersAwaitingStable = []\n this._senderMap = new Map()\n this._closingInterval = null\n\n this._remoteTracks = []\n this._remoteStreams = []\n\n this._chunk = null\n this._cb = null\n this._interval = null\n\n try {\n this._pc = new (this._wrtc.RTCPeerConnection)(this.config)\n } catch (err) {\n this.destroy(errCode(err, 'ERR_PC_CONSTRUCTOR'))\n return\n }\n\n // We prefer feature detection whenever possible, but sometimes that's not\n // possible for certain implementations.\n this._isReactNativeWebrtc = typeof this._pc._peerConnectionId === 'number'\n\n this._pc.oniceconnectionstatechange = () => {\n this._onIceStateChange()\n }\n this._pc.onicegatheringstatechange = () => {\n this._onIceStateChange()\n }\n this._pc.onconnectionstatechange = () => {\n this._onConnectionStateChange()\n }\n this._pc.onsignalingstatechange = () => {\n this._onSignalingStateChange()\n }\n this._pc.onicecandidate = event => {\n this._onIceCandidate(event)\n }\n\n // HACK: Fix for odd Firefox behavior, see: https://github.com/feross/simple-peer/pull/783\n if (typeof this._pc.peerIdentity === 'object') {\n this._pc.peerIdentity.catch(err => {\n this.destroy(errCode(err, 'ERR_PC_PEER_IDENTITY'))\n })\n }\n\n // Other spec events, unused by this implementation:\n // - onconnectionstatechange\n // - onicecandidateerror\n // - onfingerprintfailure\n // - onnegotiationneeded\n\n if (this.initiator || this.channelNegotiated) {\n this._setupData({\n channel: this._pc.createDataChannel(this.channelName, this.channelConfig)\n })\n } else {\n this._pc.ondatachannel = event => {\n this._setupData(event)\n }\n }\n\n if (this.streams) {\n this.streams.forEach(stream => {\n this.addStream(stream)\n })\n }\n this._pc.ontrack = event => {\n this._onTrack(event)\n }\n\n this._debug('initial negotiation')\n this._needsNegotiation()\n\n this._onFinishBound = () => {\n this._onFinish()\n }\n this.once('finish', this._onFinishBound)\n }\n\n get bufferSize () {\n return (this._channel && this._channel.bufferedAmount) || 0\n }\n\n // HACK: it's possible channel.readyState is \"closing\" before peer.destroy() fires\n // https://bugs.chromium.org/p/chromium/issues/detail?id=882743\n get connected () {\n return (this._connected && this._channel.readyState === 'open')\n }\n\n address () {\n return { port: this.localPort, family: this.localFamily, address: this.localAddress }\n }\n\n signal (data) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot signal after peer is destroyed'), 'ERR_DESTROYED')\n if (typeof data === 'string') {\n try {\n data = JSON.parse(data)\n } catch (err) {\n data = {}\n }\n }\n this._debug('signal()')\n\n if (data.renegotiate && this.initiator) {\n this._debug('got request to renegotiate')\n this._needsNegotiation()\n }\n if (data.transceiverRequest && this.initiator) {\n this._debug('got request for transceiver')\n this.addTransceiver(data.transceiverRequest.kind, data.transceiverRequest.init)\n }\n if (data.candidate) {\n if (this._pc.remoteDescription && this._pc.remoteDescription.type) {\n this._addIceCandidate(data.candidate)\n } else {\n this._pendingCandidates.push(data.candidate)\n }\n }\n if (data.sdp) {\n this._pc.setRemoteDescription(new (this._wrtc.RTCSessionDescription)(data))\n .then(() => {\n if (this.destroyed) return\n\n this._pendingCandidates.forEach(candidate => {\n this._addIceCandidate(candidate)\n })\n this._pendingCandidates = []\n\n if (this._pc.remoteDescription.type === 'offer') this._createAnswer()\n })\n .catch(err => {\n this.destroy(errCode(err, 'ERR_SET_REMOTE_DESCRIPTION'))\n })\n }\n if (!data.sdp && !data.candidate && !data.renegotiate && !data.transceiverRequest) {\n this.destroy(errCode(new Error('signal() called with invalid signal data'), 'ERR_SIGNALING'))\n }\n }\n\n _addIceCandidate (candidate) {\n const iceCandidateObj = new this._wrtc.RTCIceCandidate(candidate)\n this._pc.addIceCandidate(iceCandidateObj)\n .catch(err => {\n if (!iceCandidateObj.address || iceCandidateObj.address.endsWith('.local')) {\n warn('Ignoring unsupported ICE candidate.')\n } else {\n this.destroy(errCode(err, 'ERR_ADD_ICE_CANDIDATE'))\n }\n })\n }\n\n /**\n * Send text/binary data to the remote peer.\n * @param {ArrayBufferView|ArrayBuffer|Buffer|string|Blob} chunk\n */\n send (chunk) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot send after peer is destroyed'), 'ERR_DESTROYED')\n this._channel.send(chunk)\n }\n\n /**\n * Add a Transceiver to the connection.\n * @param {String} kind\n * @param {Object} init\n */\n addTransceiver (kind, init) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot addTransceiver after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('addTransceiver()')\n\n if (this.initiator) {\n try {\n this._pc.addTransceiver(kind, init)\n this._needsNegotiation()\n } catch (err) {\n this.destroy(errCode(err, 'ERR_ADD_TRANSCEIVER'))\n }\n } else {\n this.emit('signal', { // request initiator to renegotiate\n type: 'transceiverRequest',\n transceiverRequest: { kind, init }\n })\n }\n }\n\n /**\n * Add a MediaStream to the connection.\n * @param {MediaStream} stream\n */\n addStream (stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot addStream after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('addStream()')\n\n stream.getTracks().forEach(track => {\n this.addTrack(track, stream)\n })\n }\n\n /**\n * Add a MediaStreamTrack to the connection.\n * @param {MediaStreamTrack} track\n * @param {MediaStream} stream\n */\n addTrack (track, stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot addTrack after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('addTrack()')\n\n const submap = this._senderMap.get(track) || new Map() // nested Maps map [track, stream] to sender\n let sender = submap.get(stream)\n if (!sender) {\n sender = this._pc.addTrack(track, stream)\n submap.set(stream, sender)\n this._senderMap.set(track, submap)\n this._needsNegotiation()\n } else if (sender.removed) {\n throw errCode(new Error('Track has been removed. You should enable/disable tracks that you want to re-add.'), 'ERR_SENDER_REMOVED')\n } else {\n throw errCode(new Error('Track has already been added to that stream.'), 'ERR_SENDER_ALREADY_ADDED')\n }\n }\n\n /**\n * Replace a MediaStreamTrack by another in the connection.\n * @param {MediaStreamTrack} oldTrack\n * @param {MediaStreamTrack} newTrack\n * @param {MediaStream} stream\n */\n replaceTrack (oldTrack, newTrack, stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot replaceTrack after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('replaceTrack()')\n\n const submap = this._senderMap.get(oldTrack)\n const sender = submap ? submap.get(stream) : null\n if (!sender) {\n throw errCode(new Error('Cannot replace track that was never added.'), 'ERR_TRACK_NOT_ADDED')\n }\n if (newTrack) this._senderMap.set(newTrack, submap)\n\n if (sender.replaceTrack != null) {\n sender.replaceTrack(newTrack)\n } else {\n this.destroy(errCode(new Error('replaceTrack is not supported in this browser'), 'ERR_UNSUPPORTED_REPLACETRACK'))\n }\n }\n\n /**\n * Remove a MediaStreamTrack from the connection.\n * @param {MediaStreamTrack} track\n * @param {MediaStream} stream\n */\n removeTrack (track, stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot removeTrack after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('removeSender()')\n\n const submap = this._senderMap.get(track)\n const sender = submap ? submap.get(stream) : null\n if (!sender) {\n throw errCode(new Error('Cannot remove track that was never added.'), 'ERR_TRACK_NOT_ADDED')\n }\n try {\n sender.removed = true\n this._pc.removeTrack(sender)\n } catch (err) {\n if (err.name === 'NS_ERROR_UNEXPECTED') {\n this._sendersAwaitingStable.push(sender) // HACK: Firefox must wait until (signalingState === stable) https://bugzilla.mozilla.org/show_bug.cgi?id=1133874\n } else {\n this.destroy(errCode(err, 'ERR_REMOVE_TRACK'))\n }\n }\n this._needsNegotiation()\n }\n\n /**\n * Remove a MediaStream from the connection.\n * @param {MediaStream} stream\n */\n removeStream (stream) {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot removeStream after peer is destroyed'), 'ERR_DESTROYED')\n this._debug('removeSenders()')\n\n stream.getTracks().forEach(track => {\n this.removeTrack(track, stream)\n })\n }\n\n _needsNegotiation () {\n this._debug('_needsNegotiation')\n if (this._batchedNegotiation) return // batch synchronous renegotiations\n this._batchedNegotiation = true\n queueMicrotask(() => {\n this._batchedNegotiation = false\n if (this.initiator || !this._firstNegotiation) {\n this._debug('starting batched negotiation')\n this.negotiate()\n } else {\n this._debug('non-initiator initial negotiation request discarded')\n }\n this._firstNegotiation = false\n })\n }\n\n negotiate () {\n if (this.destroying) return\n if (this.destroyed) throw errCode(new Error('cannot negotiate after peer is destroyed'), 'ERR_DESTROYED')\n\n if (this.initiator) {\n if (this._isNegotiating) {\n this._queuedNegotiation = true\n this._debug('already negotiating, queueing')\n } else {\n this._debug('start negotiation')\n setTimeout(() => { // HACK: Chrome crashes if we immediately call createOffer\n this._createOffer()\n }, 0)\n }\n } else {\n if (this._isNegotiating) {\n this._queuedNegotiation = true\n this._debug('already negotiating, queueing')\n } else {\n this._debug('requesting negotiation from initiator')\n this.emit('signal', { // request initiator to renegotiate\n type: 'renegotiate',\n renegotiate: true\n })\n }\n }\n this._isNegotiating = true\n }\n\n // TODO: Delete this method once readable-stream is updated to contain a default\n // implementation of destroy() that automatically calls _destroy()\n // See: https://github.com/nodejs/readable-stream/issues/283\n destroy (err) {\n this._destroy(err, () => {})\n }\n\n _destroy (err, cb) {\n if (this.destroyed || this.destroying) return\n this.destroying = true\n\n this._debug('destroying (error: %s)', err && (err.message || err))\n\n queueMicrotask(() => { // allow events concurrent with the call to _destroy() to fire (see #692)\n this.destroyed = true\n this.destroying = false\n\n this._debug('destroy (error: %s)', err && (err.message || err))\n\n this.readable = this.writable = false\n\n if (!this._readableState.ended) this.push(null)\n if (!this._writableState.finished) this.end()\n\n this._connected = false\n this._pcReady = false\n this._channelReady = false\n this._remoteTracks = null\n this._remoteStreams = null\n this._senderMap = null\n\n clearInterval(this._closingInterval)\n this._closingInterval = null\n\n clearInterval(this._interval)\n this._interval = null\n this._chunk = null\n this._cb = null\n\n if (this._onFinishBound) this.removeListener('finish', this._onFinishBound)\n this._onFinishBound = null\n\n if (this._channel) {\n try {\n this._channel.close()\n } catch (err) {}\n\n // allow events concurrent with destruction to be handled\n this._channel.onmessage = null\n this._channel.onopen = null\n this._channel.onclose = null\n this._channel.onerror = null\n }\n if (this._pc) {\n try {\n this._pc.close()\n } catch (err) {}\n\n // allow events concurrent with destruction to be handled\n this._pc.oniceconnectionstatechange = null\n this._pc.onicegatheringstatechange = null\n this._pc.onsignalingstatechange = null\n this._pc.onicecandidate = null\n this._pc.ontrack = null\n this._pc.ondatachannel = null\n }\n this._pc = null\n this._channel = null\n\n if (err) this.emit('error', err)\n this.emit('close')\n cb()\n })\n }\n\n _setupData (event) {\n if (!event.channel) {\n // In some situations `pc.createDataChannel()` returns `undefined` (in wrtc),\n // which is invalid behavior. Handle it gracefully.\n // See: https://github.com/feross/simple-peer/issues/163\n return this.destroy(errCode(new Error('Data channel event is missing `channel` property'), 'ERR_DATA_CHANNEL'))\n }\n\n this._channel = event.channel\n this._channel.binaryType = 'arraybuffer'\n\n if (typeof this._channel.bufferedAmountLowThreshold === 'number') {\n this._channel.bufferedAmountLowThreshold = MAX_BUFFERED_AMOUNT\n }\n\n this.channelName = this._channel.label\n\n this._channel.onmessage = event => {\n this._onChannelMessage(event)\n }\n this._channel.onbufferedamountlow = () => {\n this._onChannelBufferedAmountLow()\n }\n this._channel.onopen = () => {\n this._onChannelOpen()\n }\n this._channel.onclose = () => {\n this._onChannelClose()\n }\n this._channel.onerror = event => {\n const err = event.error instanceof Error\n ? event.error\n : new Error(`Datachannel error: ${event.message} ${event.filename}:${event.lineno}:${event.colno}`)\n this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n }\n\n // HACK: Chrome will sometimes get stuck in readyState \"closing\", let's check for this condition\n // https://bugs.chromium.org/p/chromium/issues/detail?id=882743\n let isClosing = false\n this._closingInterval = setInterval(() => { // No \"onclosing\" event\n if (this._channel && this._channel.readyState === 'closing') {\n if (isClosing) this._onChannelClose() // closing timed out: equivalent to onclose firing\n isClosing = true\n } else {\n isClosing = false\n }\n }, CHANNEL_CLOSING_TIMEOUT)\n }\n\n _read () {}\n\n _write (chunk, encoding, cb) {\n if (this.destroyed) return cb(errCode(new Error('cannot write after peer is destroyed'), 'ERR_DATA_CHANNEL'))\n\n if (this._connected) {\n try {\n this.send(chunk)\n } catch (err) {\n return this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n }\n if (this._channel.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n this._debug('start backpressure: bufferedAmount %d', this._channel.bufferedAmount)\n this._cb = cb\n } else {\n cb(null)\n }\n } else {\n this._debug('write before connect')\n this._chunk = chunk\n this._cb = cb\n }\n }\n\n // When stream finishes writing, close socket. Half open connections are not\n // supported.\n _onFinish () {\n if (this.destroyed) return\n\n // Wait a bit before destroying so the socket flushes.\n // TODO: is there a more reliable way to accomplish this?\n const destroySoon = () => {\n setTimeout(() => this.destroy(), 1000)\n }\n\n if (this._connected) {\n destroySoon()\n } else {\n this.once('connect', destroySoon)\n }\n }\n\n _startIceCompleteTimeout () {\n if (this.destroyed) return\n if (this._iceCompleteTimer) return\n this._debug('started iceComplete timeout')\n this._iceCompleteTimer = setTimeout(() => {\n if (!this._iceComplete) {\n this._iceComplete = true\n this._debug('iceComplete timeout completed')\n this.emit('iceTimeout')\n this.emit('_iceComplete')\n }\n }, this.iceCompleteTimeout)\n }\n\n _createOffer () {\n if (this.destroyed) return\n\n this._pc.createOffer(this.offerOptions)\n .then(offer => {\n if (this.destroyed) return\n if (!this.trickle && !this.allowHalfTrickle) offer.sdp = filterTrickle(offer.sdp)\n offer.sdp = this.sdpTransform(offer.sdp)\n\n const sendOffer = () => {\n if (this.destroyed) return\n const signal = this._pc.localDescription || offer\n this._debug('signal')\n this.emit('signal', {\n type: signal.type,\n sdp: signal.sdp\n })\n }\n\n const onSuccess = () => {\n this._debug('createOffer success')\n if (this.destroyed) return\n if (this.trickle || this._iceComplete) sendOffer()\n else this.once('_iceComplete', sendOffer) // wait for candidates\n }\n\n const onError = err => {\n this.destroy(errCode(err, 'ERR_SET_LOCAL_DESCRIPTION'))\n }\n\n this._pc.setLocalDescription(offer)\n .then(onSuccess)\n .catch(onError)\n })\n .catch(err => {\n this.destroy(errCode(err, 'ERR_CREATE_OFFER'))\n })\n }\n\n _requestMissingTransceivers () {\n if (this._pc.getTransceivers) {\n this._pc.getTransceivers().forEach(transceiver => {\n if (!transceiver.mid && transceiver.sender.track && !transceiver.requested) {\n transceiver.requested = true // HACK: Safari returns negotiated transceivers with a null mid\n this.addTransceiver(transceiver.sender.track.kind)\n }\n })\n }\n }\n\n _createAnswer () {\n if (this.destroyed) return\n\n this._pc.createAnswer(this.answerOptions)\n .then(answer => {\n if (this.destroyed) return\n if (!this.trickle && !this.allowHalfTrickle) answer.sdp = filterTrickle(answer.sdp)\n answer.sdp = this.sdpTransform(answer.sdp)\n\n const sendAnswer = () => {\n if (this.destroyed) return\n const signal = this._pc.localDescription || answer\n this._debug('signal')\n this.emit('signal', {\n type: signal.type,\n sdp: signal.sdp\n })\n if (!this.initiator) this._requestMissingTransceivers()\n }\n\n const onSuccess = () => {\n if (this.destroyed) return\n if (this.trickle || this._iceComplete) sendAnswer()\n else this.once('_iceComplete', sendAnswer)\n }\n\n const onError = err => {\n this.destroy(errCode(err, 'ERR_SET_LOCAL_DESCRIPTION'))\n }\n\n this._pc.setLocalDescription(answer)\n .then(onSuccess)\n .catch(onError)\n })\n .catch(err => {\n this.destroy(errCode(err, 'ERR_CREATE_ANSWER'))\n })\n }\n\n _onConnectionStateChange () {\n if (this.destroyed) return\n if (this._pc.connectionState === 'failed') {\n this.destroy(errCode(new Error('Connection failed.'), 'ERR_CONNECTION_FAILURE'))\n }\n }\n\n _onIceStateChange () {\n if (this.destroyed) return\n const iceConnectionState = this._pc.iceConnectionState\n const iceGatheringState = this._pc.iceGatheringState\n\n this._debug(\n 'iceStateChange (connection: %s) (gathering: %s)',\n iceConnectionState,\n iceGatheringState\n )\n this.emit('iceStateChange', iceConnectionState, iceGatheringState)\n\n if (iceConnectionState === 'connected' || iceConnectionState === 'completed') {\n this._pcReady = true\n this._maybeReady()\n }\n if (iceConnectionState === 'failed') {\n this.destroy(errCode(new Error('Ice connection failed.'), 'ERR_ICE_CONNECTION_FAILURE'))\n }\n if (iceConnectionState === 'closed') {\n this.destroy(errCode(new Error('Ice connection closed.'), 'ERR_ICE_CONNECTION_CLOSED'))\n }\n }\n\n getStats (cb) {\n // statreports can come with a value array instead of properties\n const flattenValues = report => {\n if (Object.prototype.toString.call(report.values) === '[object Array]') {\n report.values.forEach(value => {\n Object.assign(report, value)\n })\n }\n return report\n }\n\n // Promise-based getStats() (standard)\n if (this._pc.getStats.length === 0 || this._isReactNativeWebrtc) {\n this._pc.getStats()\n .then(res => {\n const reports = []\n res.forEach(report => {\n reports.push(flattenValues(report))\n })\n cb(null, reports)\n }, err => cb(err))\n\n // Single-parameter callback-based getStats() (non-standard)\n } else if (this._pc.getStats.length > 0) {\n this._pc.getStats(res => {\n // If we destroy connection in `connect` callback this code might happen to run when actual connection is already closed\n if (this.destroyed) return\n\n const reports = []\n res.result().forEach(result => {\n const report = {}\n result.names().forEach(name => {\n report[name] = result.stat(name)\n })\n report.id = result.id\n report.type = result.type\n report.timestamp = result.timestamp\n reports.push(flattenValues(report))\n })\n cb(null, reports)\n }, err => cb(err))\n\n // Unknown browser, skip getStats() since it's anyone's guess which style of\n // getStats() they implement.\n } else {\n cb(null, [])\n }\n }\n\n _maybeReady () {\n this._debug('maybeReady pc %s channel %s', this._pcReady, this._channelReady)\n if (this._connected || this._connecting || !this._pcReady || !this._channelReady) return\n\n this._connecting = true\n\n // HACK: We can't rely on order here, for details see https://github.com/js-platform/node-webrtc/issues/339\n const findCandidatePair = () => {\n if (this.destroyed) return\n\n this.getStats((err, items) => {\n if (this.destroyed) return\n\n // Treat getStats error as non-fatal. It's not essential.\n if (err) items = []\n\n const remoteCandidates = {}\n const localCandidates = {}\n const candidatePairs = {}\n let foundSelectedCandidatePair = false\n\n items.forEach(item => {\n // TODO: Once all browsers support the hyphenated stats report types, remove\n // the non-hypenated ones\n if (item.type === 'remotecandidate' || item.type === 'remote-candidate') {\n remoteCandidates[item.id] = item\n }\n if (item.type === 'localcandidate' || item.type === 'local-candidate') {\n localCandidates[item.id] = item\n }\n if (item.type === 'candidatepair' || item.type === 'candidate-pair') {\n candidatePairs[item.id] = item\n }\n })\n\n const setSelectedCandidatePair = selectedCandidatePair => {\n foundSelectedCandidatePair = true\n\n let local = localCandidates[selectedCandidatePair.localCandidateId]\n\n if (local && (local.ip || local.address)) {\n // Spec\n this.localAddress = local.ip || local.address\n this.localPort = Number(local.port)\n } else if (local && local.ipAddress) {\n // Firefox\n this.localAddress = local.ipAddress\n this.localPort = Number(local.portNumber)\n } else if (typeof selectedCandidatePair.googLocalAddress === 'string') {\n // TODO: remove this once Chrome 58 is released\n local = selectedCandidatePair.googLocalAddress.split(':')\n this.localAddress = local[0]\n this.localPort = Number(local[1])\n }\n if (this.localAddress) {\n this.localFamily = this.localAddress.includes(':') ? 'IPv6' : 'IPv4'\n }\n\n let remote = remoteCandidates[selectedCandidatePair.remoteCandidateId]\n\n if (remote && (remote.ip || remote.address)) {\n // Spec\n this.remoteAddress = remote.ip || remote.address\n this.remotePort = Number(remote.port)\n } else if (remote && remote.ipAddress) {\n // Firefox\n this.remoteAddress = remote.ipAddress\n this.remotePort = Number(remote.portNumber)\n } else if (typeof selectedCandidatePair.googRemoteAddress === 'string') {\n // TODO: remove this once Chrome 58 is released\n remote = selectedCandidatePair.googRemoteAddress.split(':')\n this.remoteAddress = remote[0]\n this.remotePort = Number(remote[1])\n }\n if (this.remoteAddress) {\n this.remoteFamily = this.remoteAddress.includes(':') ? 'IPv6' : 'IPv4'\n }\n\n this._debug(\n 'connect local: %s:%s remote: %s:%s',\n this.localAddress,\n this.localPort,\n this.remoteAddress,\n this.remotePort\n )\n }\n\n items.forEach(item => {\n // Spec-compliant\n if (item.type === 'transport' && item.selectedCandidatePairId) {\n setSelectedCandidatePair(candidatePairs[item.selectedCandidatePairId])\n }\n\n // Old implementations\n if (\n (item.type === 'googCandidatePair' && item.googActiveConnection === 'true') ||\n ((item.type === 'candidatepair' || item.type === 'candidate-pair') && item.selected)\n ) {\n setSelectedCandidatePair(item)\n }\n })\n\n // Ignore candidate pair selection in browsers like Safari 11 that do not have any local or remote candidates\n // But wait until at least 1 candidate pair is available\n if (!foundSelectedCandidatePair && (!Object.keys(candidatePairs).length || Object.keys(localCandidates).length)) {\n setTimeout(findCandidatePair, 100)\n return\n } else {\n this._connecting = false\n this._connected = true\n }\n\n if (this._chunk) {\n try {\n this.send(this._chunk)\n } catch (err) {\n return this.destroy(errCode(err, 'ERR_DATA_CHANNEL'))\n }\n this._chunk = null\n this._debug('sent chunk from \"write before connect\"')\n\n const cb = this._cb\n this._cb = null\n cb(null)\n }\n\n // If `bufferedAmountLowThreshold` and 'onbufferedamountlow' are unsupported,\n // fallback to using setInterval to implement backpressure.\n if (typeof this._channel.bufferedAmountLowThreshold !== 'number') {\n this._interval = setInterval(() => this._onInterval(), 150)\n if (this._interval.unref) this._interval.unref()\n }\n\n this._debug('connect')\n this.emit('connect')\n })\n }\n findCandidatePair()\n }\n\n _onInterval () {\n if (!this._cb || !this._channel || this._channel.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n return\n }\n this._onChannelBufferedAmountLow()\n }\n\n _onSignalingStateChange () {\n if (this.destroyed) return\n\n if (this._pc.signalingState === 'stable') {\n this._isNegotiating = false\n\n // HACK: Firefox doesn't yet support removing tracks when signalingState !== 'stable'\n this._debug('flushing sender queue', this._sendersAwaitingStable)\n this._sendersAwaitingStable.forEach(sender => {\n this._pc.removeTrack(sender)\n this._queuedNegotiation = true\n })\n this._sendersAwaitingStable = []\n\n if (this._queuedNegotiation) {\n this._debug('flushing negotiation queue')\n this._queuedNegotiation = false\n this._needsNegotiation() // negotiate again\n } else {\n this._debug('negotiated')\n this.emit('negotiated')\n }\n }\n\n this._debug('signalingStateChange %s', this._pc.signalingState)\n this.emit('signalingStateChange', this._pc.signalingState)\n }\n\n _onIceCandidate (event) {\n if (this.destroyed) return\n if (event.candidate && this.trickle) {\n this.emit('signal', {\n type: 'candidate',\n candidate: {\n candidate: event.candidate.candidate,\n sdpMLineIndex: event.candidate.sdpMLineIndex,\n sdpMid: event.candidate.sdpMid\n }\n })\n } else if (!event.candidate && !this._iceComplete) {\n this._iceComplete = true\n this.emit('_iceComplete')\n }\n // as soon as we've received one valid candidate start timeout\n if (event.candidate) {\n this._startIceCompleteTimeout()\n }\n }\n\n _onChannelMessage (event) {\n if (this.destroyed) return\n let data = event.data\n if (data instanceof ArrayBuffer) data = Buffer.from(data)\n this.push(data)\n }\n\n _onChannelBufferedAmountLow () {\n if (this.destroyed || !this._cb) return\n this._debug('ending backpressure: bufferedAmount %d', this._channel.bufferedAmount)\n const cb = this._cb\n this._cb = null\n cb(null)\n }\n\n _onChannelOpen () {\n if (this._connected || this.destroyed) return\n this._debug('on channel open')\n this._channelReady = true\n this._maybeReady()\n }\n\n _onChannelClose () {\n if (this.destroyed) return\n this._debug('on channel close')\n this.destroy()\n }\n\n _onTrack (event) {\n if (this.destroyed) return\n\n event.streams.forEach(eventStream => {\n this._debug('on track')\n this.emit('track', event.track, eventStream)\n\n this._remoteTracks.push({\n track: event.track,\n stream: eventStream\n })\n\n if (this._remoteStreams.some(remoteStream => {\n return remoteStream.id === eventStream.id\n })) return // Only fire one 'stream' event, even though there may be multiple tracks per stream\n\n this._remoteStreams.push(eventStream)\n queueMicrotask(() => {\n this._debug('on stream')\n this.emit('stream', eventStream) // ensure all tracks have been added\n })\n })\n }\n\n _debug () {\n const args = [].slice.call(arguments)\n args[0] = '[' + this._id + '] ' + args[0]\n debug.apply(null, args)\n }\n}\n\nPeer.WEBRTC_SUPPORT = !!getBrowserRTC()\n\n/**\n * Expose peer and data channel config for overriding all Peer\n * instances. Otherwise, just set opts.config or opts.channelConfig\n * when constructing a Peer.\n */\nPeer.config = {\n iceServers: [\n {\n urls: [\n 'stun:stun.l.google.com:19302',\n 'stun:global.stun.twilio.com:3478'\n ]\n }\n ],\n sdpSemantics: 'unified-plan'\n}\n\nPeer.channelConfig = {}\n\nmodule.exports = Peer\n","/* global self */\n\nconst Rusha = require('rusha')\nconst rushaWorkerSha1 = require('./rusha-worker-sha1')\n\nconst rusha = new Rusha()\nconst scope = typeof window !== 'undefined' ? window : self\nconst crypto = scope.crypto || scope.msCrypto || {}\nlet subtle = crypto.subtle || crypto.webkitSubtle\n\nfunction sha1sync (buf) {\n return rusha.digest(buf)\n}\n\n// Browsers throw if they lack support for an algorithm.\n// Promise will be rejected on non-secure origins. (http://goo.gl/lq4gCo)\ntry {\n subtle.digest({ name: 'sha-1' }, new Uint8Array()).catch(function () {\n subtle = false\n })\n} catch (err) { subtle = false }\n\nfunction sha1 (buf, cb) {\n if (!subtle) {\n if (typeof window !== 'undefined') {\n rushaWorkerSha1(buf, function onRushaWorkerSha1 (err, hash) {\n if (err) {\n // On error, fallback to synchronous method which cannot fail\n cb(sha1sync(buf))\n return\n }\n\n cb(hash)\n })\n } else {\n queueMicrotask(() => cb(sha1sync(buf)))\n }\n return\n }\n\n if (typeof buf === 'string') {\n buf = uint8array(buf)\n }\n\n subtle.digest({ name: 'sha-1' }, buf)\n .then(function succeed (result) {\n cb(hex(new Uint8Array(result)))\n },\n function fail () {\n // On error, fallback to synchronous method which cannot fail\n cb(sha1sync(buf))\n })\n}\n\nfunction uint8array (s) {\n const l = s.length\n const array = new Uint8Array(l)\n for (let i = 0; i < l; i++) {\n array[i] = s.charCodeAt(i)\n }\n return array\n}\n\nfunction hex (buf) {\n const l = buf.length\n const chars = []\n for (let i = 0; i < l; i++) {\n const bite = buf[i]\n chars.push((bite >>> 4).toString(16))\n chars.push((bite & 0x0f).toString(16))\n }\n return chars.join('')\n}\n\nmodule.exports = sha1\nmodule.exports.sync = sha1sync\n","const Rusha = require('rusha')\n\nlet worker\nlet nextTaskId\nlet cbs\n\nfunction init () {\n worker = Rusha.createWorker()\n nextTaskId = 1\n cbs = {} // taskId -> cb\n\n worker.onmessage = function onRushaMessage (e) {\n const taskId = e.data.id\n const cb = cbs[taskId]\n delete cbs[taskId]\n\n if (e.data.error != null) {\n cb(new Error('Rusha worker error: ' + e.data.error))\n } else {\n cb(null, e.data.hash)\n }\n }\n}\n\nfunction sha1 (buf, cb) {\n if (!worker) init()\n\n cbs[nextTaskId] = cb\n worker.postMessage({ id: nextTaskId, data: buf })\n nextTaskId += 1\n}\n\nmodule.exports = sha1\n","/*! simple-websocket. MIT License. Feross Aboukhadijeh */\n/* global WebSocket */\n\nconst debug = require('debug')('simple-websocket')\nconst randombytes = require('randombytes')\nconst stream = require('readable-stream')\nconst queueMicrotask = require('queue-microtask') // TODO: remove when Node 10 is not supported\nconst ws = require('ws') // websockets in node - will be empty object in browser\n\nconst _WebSocket = typeof ws !== 'function' ? WebSocket : ws\n\nconst MAX_BUFFERED_AMOUNT = 64 * 1024\n\n/**\n * WebSocket. Same API as node core `net.Socket`. Duplex stream.\n * @param {Object} opts\n * @param {string=} opts.url websocket server url\n * @param {string=} opts.socket raw websocket instance to wrap\n */\nclass Socket extends stream.Duplex {\n constructor (opts = {}) {\n // Support simple usage: `new Socket(url)`\n if (typeof opts === 'string') {\n opts = { url: opts }\n }\n\n opts = Object.assign({\n allowHalfOpen: false\n }, opts)\n\n super(opts)\n\n if (opts.url == null && opts.socket == null) {\n throw new Error('Missing required `url` or `socket` option')\n }\n if (opts.url != null && opts.socket != null) {\n throw new Error('Must specify either `url` or `socket` option, not both')\n }\n\n this._id = randombytes(4).toString('hex').slice(0, 7)\n this._debug('new websocket: %o', opts)\n\n this.connected = false\n this.destroyed = false\n\n this._chunk = null\n this._cb = null\n this._interval = null\n\n if (opts.socket) {\n this.url = opts.socket.url\n this._ws = opts.socket\n this.connected = opts.socket.readyState === _WebSocket.OPEN\n } else {\n this.url = opts.url\n try {\n if (typeof ws === 'function') {\n // `ws` package accepts options\n this._ws = new _WebSocket(opts.url, null, {\n ...opts,\n encoding: undefined // encoding option breaks ws internals\n })\n } else {\n this._ws = new _WebSocket(opts.url)\n }\n } catch (err) {\n queueMicrotask(() => this.destroy(err))\n return\n }\n }\n\n this._ws.binaryType = 'arraybuffer'\n\n if (opts.socket && this.connected) {\n queueMicrotask(() => this._handleOpen())\n } else {\n this._ws.onopen = () => this._handleOpen()\n }\n\n this._ws.onmessage = event => this._handleMessage(event)\n this._ws.onclose = () => this._handleClose()\n this._ws.onerror = err => this._handleError(err)\n\n this._handleFinishBound = () => this._handleFinish()\n this.once('finish', this._handleFinishBound)\n }\n\n /**\n * Send text/binary data to the WebSocket server.\n * @param {TypedArrayView|ArrayBuffer|Buffer|string|Blob|Object} chunk\n */\n send (chunk) {\n this._ws.send(chunk)\n }\n\n // TODO: Delete this method once readable-stream is updated to contain a default\n // implementation of destroy() that automatically calls _destroy()\n // See: https://github.com/nodejs/readable-stream/issues/283\n destroy (err) {\n this._destroy(err, () => {})\n }\n\n _destroy (err, cb) {\n if (this.destroyed) return\n\n this._debug('destroy (error: %s)', err && (err.message || err))\n\n this.readable = this.writable = false\n if (!this._readableState.ended) this.push(null)\n if (!this._writableState.finished) this.end()\n\n this.connected = false\n this.destroyed = true\n\n clearInterval(this._interval)\n this._interval = null\n this._chunk = null\n this._cb = null\n\n if (this._handleFinishBound) {\n this.removeListener('finish', this._handleFinishBound)\n }\n this._handleFinishBound = null\n\n if (this._ws) {\n const ws = this._ws\n const onClose = () => {\n ws.onclose = null\n }\n if (ws.readyState === _WebSocket.CLOSED) {\n onClose()\n } else {\n try {\n ws.onclose = onClose\n ws.close()\n } catch (err) {\n onClose()\n }\n }\n\n ws.onopen = null\n ws.onmessage = null\n ws.onerror = () => {}\n }\n this._ws = null\n\n if (err) this.emit('error', err)\n this.emit('close')\n cb()\n }\n\n _read () {}\n\n _write (chunk, encoding, cb) {\n if (this.destroyed) return cb(new Error('cannot write after socket is destroyed'))\n\n if (this.connected) {\n try {\n this.send(chunk)\n } catch (err) {\n return this.destroy(err)\n }\n if (typeof ws !== 'function' && this._ws.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n this._debug('start backpressure: bufferedAmount %d', this._ws.bufferedAmount)\n this._cb = cb\n } else {\n cb(null)\n }\n } else {\n this._debug('write before connect')\n this._chunk = chunk\n this._cb = cb\n }\n }\n\n _handleOpen () {\n if (this.connected || this.destroyed) return\n this.connected = true\n\n if (this._chunk) {\n try {\n this.send(this._chunk)\n } catch (err) {\n return this.destroy(err)\n }\n this._chunk = null\n this._debug('sent chunk from \"write before connect\"')\n\n const cb = this._cb\n this._cb = null\n cb(null)\n }\n\n // Backpressure is not implemented in Node.js. The `ws` module has a buggy\n // `bufferedAmount` property. See: https://github.com/websockets/ws/issues/492\n if (typeof ws !== 'function') {\n this._interval = setInterval(() => this._onInterval(), 150)\n if (this._interval.unref) this._interval.unref()\n }\n\n this._debug('connect')\n this.emit('connect')\n }\n\n _handleMessage (event) {\n if (this.destroyed) return\n let data = event.data\n if (data instanceof ArrayBuffer) data = Buffer.from(data)\n this.push(data)\n }\n\n _handleClose () {\n if (this.destroyed) return\n this._debug('on close')\n this.destroy()\n }\n\n _handleError (_) {\n this.destroy(new Error(`Error connecting to ${this.url}`))\n }\n\n // When stream finishes writing, close socket. Half open connections are not\n // supported.\n _handleFinish () {\n if (this.destroyed) return\n\n // Wait a bit before destroying so the socket flushes.\n // TODO: is there a more reliable way to accomplish this?\n const destroySoon = () => {\n setTimeout(() => this.destroy(), 1000)\n }\n\n if (this.connected) {\n destroySoon()\n } else {\n this.once('connect', destroySoon)\n }\n }\n\n _onInterval () {\n if (!this._cb || !this._ws || this._ws.bufferedAmount > MAX_BUFFERED_AMOUNT) {\n return\n }\n this._debug('ending backpressure: bufferedAmount %d', this._ws.bufferedAmount)\n const cb = this._cb\n this._cb = null\n cb(null)\n }\n\n _debug () {\n const args = [].slice.call(arguments)\n args[0] = '[' + this._id + '] ' + args[0]\n debug.apply(null, args)\n }\n}\n\nSocket.WEBSOCKET_SUPPORT = !!_WebSocket\n\nmodule.exports = Socket\n","const Throttle = require('./lib/throttle')\nconst ThrottleGroup = require('./lib/throttle-group')\n\nmodule.exports = {\n Throttle,\n ThrottleGroup\n}\n","const { TokenBucket } = require('limiter')\nconst Throttle = require('./throttle')\n\nclass ThrottleGroup {\n constructor (opts = {}) {\n if (typeof opts !== 'object') throw new Error('Options must be an object')\n\n this.throttles = []\n this.setEnabled(opts.enabled)\n this.setRate(opts.rate, opts.chunksize)\n }\n\n getEnabled () {\n return this._enabled\n }\n\n getRate () {\n // Note: bucketSize === tokensPerInterval\n return this.bucket.tokensPerInterval\n }\n\n getChunksize () {\n return this.chunksize\n }\n\n setEnabled (val = true) {\n if (typeof val !== 'boolean') throw new Error('Enabled must be a boolean')\n\n this._enabled = val\n for (const throttle of this.throttles) {\n throttle.setEnabled(val)\n }\n }\n\n setRate (rate, chunksize = null) {\n // Note: rate = 0, means we should stop processing chunks\n if (!Number.isInteger(rate) || rate < 0) throw new Error('Rate must be an integer bigger than zero')\n rate = parseInt(rate)\n\n if (chunksize && (typeof chunksize !== 'number' || chunksize <= 0)) throw new Error('Chunksize must be bigger than zero')\n chunksize = chunksize || Math.max(parseInt(rate / 10), 1)\n chunksize = parseInt(chunksize)\n if (rate > 0 && chunksize > rate) throw new Error('Chunk size must be smaller than rate')\n\n if (!this.bucket) this.bucket = new TokenBucket(rate, rate, 'second', null)\n\n this.bucket.bucketSize = rate\n this.bucket.tokensPerInterval = rate\n this.chunksize = chunksize\n }\n\n setChunksize (chunksize) {\n if (!Number.isInteger(chunksize) || chunksize <= 0) throw new Error('Chunk size must be an integer bigger than zero')\n const rate = this.getRate()\n chunksize = parseInt(chunksize)\n if (rate > 0 && chunksize > rate) throw new Error('Chunk size must be smaller than rate')\n this.chunksize = chunksize\n }\n\n throttle (opts = {}) {\n if (typeof opts !== 'object') throw new Error('Options must be an object')\n\n const newThrottle = new Throttle({\n ...opts,\n group: this\n })\n\n return newThrottle\n }\n\n destroy () {\n for (const throttle of this.throttles) {\n throttle.destroy()\n }\n\n this.throttles = []\n }\n\n _addThrottle (throttle) {\n if (!(throttle instanceof Throttle)) throw new Error('Throttle must be an instance of Throttle')\n\n this.throttles.push(throttle)\n }\n\n _removeThrottle (throttle) {\n const index = this.throttles.indexOf(throttle)\n if (index > -1) this.throttles.splice(index, 1)\n }\n}\n\nmodule.exports = ThrottleGroup\n","const { EventEmitter } = require('events')\nconst { Transform } = require('streamx')\nconst { wait } = require('./utils')\n\nclass Throttle extends Transform {\n constructor (opts = {}) {\n super()\n\n if (typeof opts !== 'object') throw new Error('Options must be an object')\n\n const params = Object.assign({}, opts)\n\n if (params.group && !(params.group instanceof ThrottleGroup)) throw new Error('Group must be an instanece of ThrottleGroup')\n else if (!params.group) params.group = new ThrottleGroup(params)\n\n this._setEnabled(params.enabled || params.group.enabled)\n this._group = params.group\n this._emitter = new EventEmitter()\n this._destroyed = false\n\n this._group._addThrottle(this)\n }\n\n getEnabled () {\n return this._enabled\n }\n\n getGroup () {\n return this._group\n }\n\n _setEnabled (val = true) {\n if (typeof val !== 'boolean') throw new Error('Enabled must be a boolean')\n this._enabled = val\n }\n\n setEnabled (val) {\n this._setEnabled(val)\n if (this._enabled) this._emitter.emit('enabled')\n else this._emitter.emit('disabled')\n }\n\n _transform (chunk, done) {\n this._processChunk(chunk, done)\n }\n\n /* async _waitForPositiveRate () {\n // Stop pushing chunks if rate is zero\n while (this._group.getRate() === 0 && !this._destroyed && this._areBothEnabled()) {\n await wait(1 * 1000) // wait 1 second\n }\n } */\n\n async _waitForTokens (amount) {\n // Wait for enabled, destroyed or tokens\n return new Promise((resolve, reject) => {\n let done = false\n const self = this\n function isDone (err) {\n self._emitter.removeListener('disabled', isDone)\n self._emitter.removeListener('destroyed', isDone)\n\n if (done) return\n done = true\n if (err) return reject(err)\n resolve()\n }\n this._emitter.once('disabled', isDone)\n this._emitter.once('destroyed', isDone)\n // TODO: next version remove lisener in \"isDone\"\n this._group.bucket.removeTokens(amount, isDone)\n })\n }\n\n _areBothEnabled () {\n return this._enabled && this._group.getEnabled()\n }\n\n /* async _throttleChunk (size) {\n // Stop pushing chunks if rate is zero\n await this._waitForPositiveRate()\n if (this._destroyed) return\n if (!this._areBothEnabled()) return\n\n // Get tokens from bucket\n await this._waitForTokens(size)\n } */\n\n async _processChunk (chunk, done) {\n if (!this._areBothEnabled()) return done(null, chunk)\n\n let pos = 0\n let chunksize = this._group.getChunksize()\n let slice = chunk.slice(pos, pos + chunksize)\n while (slice.length > 0) {\n // Check here again because we might be in the middle of a big chunk\n // with a lot of small slices\n if (this._areBothEnabled()) {\n try {\n // WAIT FOR POSITIVE RATE\n // Stop pushing chunks if rate is zero\n while (this._group.getRate() === 0 && !this._destroyed && this._areBothEnabled()) {\n await wait(1000) // wait 1 second\n if (this._destroyed) return\n }\n\n // WAIT FOR TOKENS\n if (this._areBothEnabled() && !this._group.bucket.tryRemoveTokens(slice.length)) {\n await this._waitForTokens(slice.length)\n if (this._destroyed) return\n }\n } catch (err) {\n return done(err)\n }\n }\n\n this.push(slice)\n pos += chunksize\n\n // Calculate params for next slice\n chunksize = (this._areBothEnabled())\n ? this._group.getChunksize() // Chunksize might have changed\n : chunk.length - pos // Get the rest of the chunk\n slice = chunk.slice(pos, pos + chunksize)\n }\n\n return done()\n }\n\n destroy (...args) {\n this._group._removeThrottle(this)\n\n this._destroyed = true\n this._emitter.emit('destroyed')\n\n super.destroy(...args)\n }\n}\n\nmodule.exports = Throttle\n\n// Fix circular dependency\nconst ThrottleGroup = require('./throttle-group')\n","function wait (time) {\n return new Promise((resolve) => setTimeout(resolve, time))\n}\n\nmodule.exports = {\n wait\n}\n","var tick = 1\nvar maxTick = 65535\nvar resolution = 4\nvar timer\nvar inc = function () {\n tick = (tick + 1) & maxTick\n}\n\n\nmodule.exports = function (seconds) {\n if (!timer) {\n timer = setInterval(inc, (1000 / resolution) | 0)\n if (timer.unref) timer.unref()\n }\n\n var size = resolution * (seconds || 5)\n var buffer = [0]\n var pointer = 1\n var last = (tick - 1) & maxTick\n\n return function (delta) {\n var dist = (tick - last) & maxTick\n if (dist > size) dist = size\n last = tick\n\n while (dist--) {\n if (pointer === size) pointer = 0\n buffer[pointer] = buffer[pointer === 0 ? size - 1 : pointer - 1]\n pointer++\n }\n\n if (delta) buffer[pointer - 1] += delta\n\n var top = buffer[pointer - 1]\n var btm = buffer.length < size ? 0 : buffer[pointer === size ? 0 : pointer]\n\n return buffer.length < resolution ? top : (top - btm) * resolution / buffer.length\n }\n}\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\nmodule.exports = Stream;\n\nvar EE = require('events').EventEmitter;\nvar inherits = require('inherits');\n\ninherits(Stream, EE);\nStream.Readable = require('readable-stream/lib/_stream_readable.js');\nStream.Writable = require('readable-stream/lib/_stream_writable.js');\nStream.Duplex = require('readable-stream/lib/_stream_duplex.js');\nStream.Transform = require('readable-stream/lib/_stream_transform.js');\nStream.PassThrough = require('readable-stream/lib/_stream_passthrough.js');\nStream.finished = require('readable-stream/lib/internal/streams/end-of-stream.js')\nStream.pipeline = require('readable-stream/lib/internal/streams/pipeline.js')\n\n// Backwards-compat with node 0.4.x\nStream.Stream = Stream;\n\n\n\n// old-style streams. Note that the pipe method (the only relevant\n// part of this class) is overridden in the Readable class.\n\nfunction Stream() {\n EE.call(this);\n}\n\nStream.prototype.pipe = function(dest, options) {\n var source = this;\n\n function ondata(chunk) {\n if (dest.writable) {\n if (false === dest.write(chunk) && source.pause) {\n source.pause();\n }\n }\n }\n\n source.on('data', ondata);\n\n function ondrain() {\n if (source.readable && source.resume) {\n source.resume();\n }\n }\n\n dest.on('drain', ondrain);\n\n // If the 'end' option is not supplied, dest.end() will be called when\n // source gets the 'end' or 'close' events. Only dest.end() once.\n if (!dest._isStdio && (!options || options.end !== false)) {\n source.on('end', onend);\n source.on('close', onclose);\n }\n\n var didOnEnd = false;\n function onend() {\n if (didOnEnd) return;\n didOnEnd = true;\n\n dest.end();\n }\n\n\n function onclose() {\n if (didOnEnd) return;\n didOnEnd = true;\n\n if (typeof dest.destroy === 'function') dest.destroy();\n }\n\n // don't leave dangling pipes when there are errors.\n function onerror(er) {\n cleanup();\n if (EE.listenerCount(this, 'error') === 0) {\n throw er; // Unhandled stream error in pipe.\n }\n }\n\n source.on('error', onerror);\n dest.on('error', onerror);\n\n // remove all the event listeners that were added.\n function cleanup() {\n source.removeListener('data', ondata);\n dest.removeListener('drain', ondrain);\n\n source.removeListener('end', onend);\n source.removeListener('close', onclose);\n\n source.removeListener('error', onerror);\n dest.removeListener('error', onerror);\n\n source.removeListener('end', cleanup);\n source.removeListener('close', cleanup);\n\n dest.removeListener('close', cleanup);\n }\n\n source.on('end', cleanup);\n source.on('close', cleanup);\n\n dest.on('close', cleanup);\n\n dest.emit('pipe', source);\n\n // Allow for unix-like usage: A.pipe(B).pipe(C)\n return dest;\n};\n","var ClientRequest = require('./lib/request')\nvar response = require('./lib/response')\nvar extend = require('xtend')\nvar statusCodes = require('builtin-status-codes')\nvar url = require('url')\n\nvar http = exports\n\nhttp.request = function (opts, cb) {\n\tif (typeof opts === 'string')\n\t\topts = url.parse(opts)\n\telse\n\t\topts = extend(opts)\n\n\t// Normally, the page is loaded from http or https, so not specifying a protocol\n\t// will result in a (valid) protocol-relative url. However, this won't work if\n\t// the protocol is something else, like 'file:'\n\tvar defaultProtocol = global.location.protocol.search(/^https?:$/) === -1 ? 'http:' : ''\n\n\tvar protocol = opts.protocol || defaultProtocol\n\tvar host = opts.hostname || opts.host\n\tvar port = opts.port\n\tvar path = opts.path || '/'\n\n\t// Necessary for IPv6 addresses\n\tif (host && host.indexOf(':') !== -1)\n\t\thost = '[' + host + ']'\n\n\t// This may be a relative url. The browser should always be able to interpret it correctly.\n\topts.url = (host ? (protocol + '//' + host) : '') + (port ? ':' + port : '') + path\n\topts.method = (opts.method || 'GET').toUpperCase()\n\topts.headers = opts.headers || {}\n\n\t// Also valid opts.auth, opts.mode\n\n\tvar req = new ClientRequest(opts)\n\tif (cb)\n\t\treq.on('response', cb)\n\treturn req\n}\n\nhttp.get = function get (opts, cb) {\n\tvar req = http.request(opts, cb)\n\treq.end()\n\treturn req\n}\n\nhttp.ClientRequest = ClientRequest\nhttp.IncomingMessage = response.IncomingMessage\n\nhttp.Agent = function () {}\nhttp.Agent.defaultMaxSockets = 4\n\nhttp.globalAgent = new http.Agent()\n\nhttp.STATUS_CODES = statusCodes\n\nhttp.METHODS = [\n\t'CHECKOUT',\n\t'CONNECT',\n\t'COPY',\n\t'DELETE',\n\t'GET',\n\t'HEAD',\n\t'LOCK',\n\t'M-SEARCH',\n\t'MERGE',\n\t'MKACTIVITY',\n\t'MKCOL',\n\t'MOVE',\n\t'NOTIFY',\n\t'OPTIONS',\n\t'PATCH',\n\t'POST',\n\t'PROPFIND',\n\t'PROPPATCH',\n\t'PURGE',\n\t'PUT',\n\t'REPORT',\n\t'SEARCH',\n\t'SUBSCRIBE',\n\t'TRACE',\n\t'UNLOCK',\n\t'UNSUBSCRIBE'\n]","exports.fetch = isFunction(global.fetch) && isFunction(global.ReadableStream)\n\nexports.writableStream = isFunction(global.WritableStream)\n\nexports.abortController = isFunction(global.AbortController)\n\n// The xhr request to example.com may violate some restrictive CSP configurations,\n// so if we're running in a browser that supports `fetch`, avoid calling getXHR()\n// and assume support for certain features below.\nvar xhr\nfunction getXHR () {\n\t// Cache the xhr value\n\tif (xhr !== undefined) return xhr\n\n\tif (global.XMLHttpRequest) {\n\t\txhr = new global.XMLHttpRequest()\n\t\t// If XDomainRequest is available (ie only, where xhr might not work\n\t\t// cross domain), use the page location. Otherwise use example.com\n\t\t// Note: this doesn't actually make an http request.\n\t\ttry {\n\t\t\txhr.open('GET', global.XDomainRequest ? '/' : 'https://example.com')\n\t\t} catch(e) {\n\t\t\txhr = null\n\t\t}\n\t} else {\n\t\t// Service workers don't have XHR\n\t\txhr = null\n\t}\n\treturn xhr\n}\n\nfunction checkTypeSupport (type) {\n\tvar xhr = getXHR()\n\tif (!xhr) return false\n\ttry {\n\t\txhr.responseType = type\n\t\treturn xhr.responseType === type\n\t} catch (e) {}\n\treturn false\n}\n\n// If fetch is supported, then arraybuffer will be supported too. Skip calling\n// checkTypeSupport(), since that calls getXHR().\nexports.arraybuffer = exports.fetch || checkTypeSupport('arraybuffer')\n\n// These next two tests unavoidably show warnings in Chrome. Since fetch will always\n// be used if it's available, just return false for these to avoid the warnings.\nexports.msstream = !exports.fetch && checkTypeSupport('ms-stream')\nexports.mozchunkedarraybuffer = !exports.fetch && checkTypeSupport('moz-chunked-arraybuffer')\n\n// If fetch is supported, then overrideMimeType will be supported too. Skip calling\n// getXHR().\nexports.overrideMimeType = exports.fetch || (getXHR() ? isFunction(getXHR().overrideMimeType) : false)\n\nfunction isFunction (value) {\n\treturn typeof value === 'function'\n}\n\nxhr = null // Help gc\n","var capability = require('./capability')\nvar inherits = require('inherits')\nvar response = require('./response')\nvar stream = require('readable-stream')\n\nvar IncomingMessage = response.IncomingMessage\nvar rStates = response.readyStates\n\nfunction decideMode (preferBinary, useFetch) {\n\tif (capability.fetch && useFetch) {\n\t\treturn 'fetch'\n\t} else if (capability.mozchunkedarraybuffer) {\n\t\treturn 'moz-chunked-arraybuffer'\n\t} else if (capability.msstream) {\n\t\treturn 'ms-stream'\n\t} else if (capability.arraybuffer && preferBinary) {\n\t\treturn 'arraybuffer'\n\t} else {\n\t\treturn 'text'\n\t}\n}\n\nvar ClientRequest = module.exports = function (opts) {\n\tvar self = this\n\tstream.Writable.call(self)\n\n\tself._opts = opts\n\tself._body = []\n\tself._headers = {}\n\tif (opts.auth)\n\t\tself.setHeader('Authorization', 'Basic ' + Buffer.from(opts.auth).toString('base64'))\n\tObject.keys(opts.headers).forEach(function (name) {\n\t\tself.setHeader(name, opts.headers[name])\n\t})\n\n\tvar preferBinary\n\tvar useFetch = true\n\tif (opts.mode === 'disable-fetch' || ('requestTimeout' in opts && !capability.abortController)) {\n\t\t// If the use of XHR should be preferred. Not typically needed.\n\t\tuseFetch = false\n\t\tpreferBinary = true\n\t} else if (opts.mode === 'prefer-streaming') {\n\t\t// If streaming is a high priority but binary compatibility and\n\t\t// the accuracy of the 'content-type' header aren't\n\t\tpreferBinary = false\n\t} else if (opts.mode === 'allow-wrong-content-type') {\n\t\t// If streaming is more important than preserving the 'content-type' header\n\t\tpreferBinary = !capability.overrideMimeType\n\t} else if (!opts.mode || opts.mode === 'default' || opts.mode === 'prefer-fast') {\n\t\t// Use binary if text streaming may corrupt data or the content-type header, or for speed\n\t\tpreferBinary = true\n\t} else {\n\t\tthrow new Error('Invalid value for opts.mode')\n\t}\n\tself._mode = decideMode(preferBinary, useFetch)\n\tself._fetchTimer = null\n\tself._socketTimeout = null\n\tself._socketTimer = null\n\n\tself.on('finish', function () {\n\t\tself._onFinish()\n\t})\n}\n\ninherits(ClientRequest, stream.Writable)\n\nClientRequest.prototype.setHeader = function (name, value) {\n\tvar self = this\n\tvar lowerName = name.toLowerCase()\n\t// This check is not necessary, but it prevents warnings from browsers about setting unsafe\n\t// headers. To be honest I'm not entirely sure hiding these warnings is a good thing, but\n\t// http-browserify did it, so I will too.\n\tif (unsafeHeaders.indexOf(lowerName) !== -1)\n\t\treturn\n\n\tself._headers[lowerName] = {\n\t\tname: name,\n\t\tvalue: value\n\t}\n}\n\nClientRequest.prototype.getHeader = function (name) {\n\tvar header = this._headers[name.toLowerCase()]\n\tif (header)\n\t\treturn header.value\n\treturn null\n}\n\nClientRequest.prototype.removeHeader = function (name) {\n\tvar self = this\n\tdelete self._headers[name.toLowerCase()]\n}\n\nClientRequest.prototype._onFinish = function () {\n\tvar self = this\n\n\tif (self._destroyed)\n\t\treturn\n\tvar opts = self._opts\n\n\tif ('timeout' in opts && opts.timeout !== 0) {\n\t\tself.setTimeout(opts.timeout)\n\t}\n\n\tvar headersObj = self._headers\n\tvar body = null\n\tif (opts.method !== 'GET' && opts.method !== 'HEAD') {\n body = new Blob(self._body, {\n type: (headersObj['content-type'] || {}).value || ''\n });\n }\n\n\t// create flattened list of headers\n\tvar headersList = []\n\tObject.keys(headersObj).forEach(function (keyName) {\n\t\tvar name = headersObj[keyName].name\n\t\tvar value = headersObj[keyName].value\n\t\tif (Array.isArray(value)) {\n\t\t\tvalue.forEach(function (v) {\n\t\t\t\theadersList.push([name, v])\n\t\t\t})\n\t\t} else {\n\t\t\theadersList.push([name, value])\n\t\t}\n\t})\n\n\tif (self._mode === 'fetch') {\n\t\tvar signal = null\n\t\tif (capability.abortController) {\n\t\t\tvar controller = new AbortController()\n\t\t\tsignal = controller.signal\n\t\t\tself._fetchAbortController = controller\n\n\t\t\tif ('requestTimeout' in opts && opts.requestTimeout !== 0) {\n\t\t\t\tself._fetchTimer = global.setTimeout(function () {\n\t\t\t\t\tself.emit('requestTimeout')\n\t\t\t\t\tif (self._fetchAbortController)\n\t\t\t\t\t\tself._fetchAbortController.abort()\n\t\t\t\t}, opts.requestTimeout)\n\t\t\t}\n\t\t}\n\n\t\tglobal.fetch(self._opts.url, {\n\t\t\tmethod: self._opts.method,\n\t\t\theaders: headersList,\n\t\t\tbody: body || undefined,\n\t\t\tmode: 'cors',\n\t\t\tcredentials: opts.withCredentials ? 'include' : 'same-origin',\n\t\t\tsignal: signal\n\t\t}).then(function (response) {\n\t\t\tself._fetchResponse = response\n\t\t\tself._resetTimers(false)\n\t\t\tself._connect()\n\t\t}, function (reason) {\n\t\t\tself._resetTimers(true)\n\t\t\tif (!self._destroyed)\n\t\t\t\tself.emit('error', reason)\n\t\t})\n\t} else {\n\t\tvar xhr = self._xhr = new global.XMLHttpRequest()\n\t\ttry {\n\t\t\txhr.open(self._opts.method, self._opts.url, true)\n\t\t} catch (err) {\n\t\t\tprocess.nextTick(function () {\n\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t\treturn\n\t\t}\n\n\t\t// Can't set responseType on really old browsers\n\t\tif ('responseType' in xhr)\n\t\t\txhr.responseType = self._mode\n\n\t\tif ('withCredentials' in xhr)\n\t\t\txhr.withCredentials = !!opts.withCredentials\n\n\t\tif (self._mode === 'text' && 'overrideMimeType' in xhr)\n\t\t\txhr.overrideMimeType('text/plain; charset=x-user-defined')\n\n\t\tif ('requestTimeout' in opts) {\n\t\t\txhr.timeout = opts.requestTimeout\n\t\t\txhr.ontimeout = function () {\n\t\t\t\tself.emit('requestTimeout')\n\t\t\t}\n\t\t}\n\n\t\theadersList.forEach(function (header) {\n\t\t\txhr.setRequestHeader(header[0], header[1])\n\t\t})\n\n\t\tself._response = null\n\t\txhr.onreadystatechange = function () {\n\t\t\tswitch (xhr.readyState) {\n\t\t\t\tcase rStates.LOADING:\n\t\t\t\tcase rStates.DONE:\n\t\t\t\t\tself._onXHRProgress()\n\t\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\t// Necessary for streaming in Firefox, since xhr.response is ONLY defined\n\t\t// in onprogress, not in onreadystatechange with xhr.readyState = 3\n\t\tif (self._mode === 'moz-chunked-arraybuffer') {\n\t\t\txhr.onprogress = function () {\n\t\t\t\tself._onXHRProgress()\n\t\t\t}\n\t\t}\n\n\t\txhr.onerror = function () {\n\t\t\tif (self._destroyed)\n\t\t\t\treturn\n\t\t\tself._resetTimers(true)\n\t\t\tself.emit('error', new Error('XHR error'))\n\t\t}\n\n\t\ttry {\n\t\t\txhr.send(body)\n\t\t} catch (err) {\n\t\t\tprocess.nextTick(function () {\n\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t\treturn\n\t\t}\n\t}\n}\n\n/**\n * Checks if xhr.status is readable and non-zero, indicating no error.\n * Even though the spec says it should be available in readyState 3,\n * accessing it throws an exception in IE8\n */\nfunction statusValid (xhr) {\n\ttry {\n\t\tvar status = xhr.status\n\t\treturn (status !== null && status !== 0)\n\t} catch (e) {\n\t\treturn false\n\t}\n}\n\nClientRequest.prototype._onXHRProgress = function () {\n\tvar self = this\n\n\tself._resetTimers(false)\n\n\tif (!statusValid(self._xhr) || self._destroyed)\n\t\treturn\n\n\tif (!self._response)\n\t\tself._connect()\n\n\tself._response._onXHRProgress(self._resetTimers.bind(self))\n}\n\nClientRequest.prototype._connect = function () {\n\tvar self = this\n\n\tif (self._destroyed)\n\t\treturn\n\n\tself._response = new IncomingMessage(self._xhr, self._fetchResponse, self._mode, self._resetTimers.bind(self))\n\tself._response.on('error', function(err) {\n\t\tself.emit('error', err)\n\t})\n\n\tself.emit('response', self._response)\n}\n\nClientRequest.prototype._write = function (chunk, encoding, cb) {\n\tvar self = this\n\n\tself._body.push(chunk)\n\tcb()\n}\n\nClientRequest.prototype._resetTimers = function (done) {\n\tvar self = this\n\n\tglobal.clearTimeout(self._socketTimer)\n\tself._socketTimer = null\n\n\tif (done) {\n\t\tglobal.clearTimeout(self._fetchTimer)\n\t\tself._fetchTimer = null\n\t} else if (self._socketTimeout) {\n\t\tself._socketTimer = global.setTimeout(function () {\n\t\t\tself.emit('timeout')\n\t\t}, self._socketTimeout)\n\t}\n}\n\nClientRequest.prototype.abort = ClientRequest.prototype.destroy = function (err) {\n\tvar self = this\n\tself._destroyed = true\n\tself._resetTimers(true)\n\tif (self._response)\n\t\tself._response._destroyed = true\n\tif (self._xhr)\n\t\tself._xhr.abort()\n\telse if (self._fetchAbortController)\n\t\tself._fetchAbortController.abort()\n\n\tif (err)\n\t\tself.emit('error', err)\n}\n\nClientRequest.prototype.end = function (data, encoding, cb) {\n\tvar self = this\n\tif (typeof data === 'function') {\n\t\tcb = data\n\t\tdata = undefined\n\t}\n\n\tstream.Writable.prototype.end.call(self, data, encoding, cb)\n}\n\nClientRequest.prototype.setTimeout = function (timeout, cb) {\n\tvar self = this\n\n\tif (cb)\n\t\tself.once('timeout', cb)\n\n\tself._socketTimeout = timeout\n\tself._resetTimers(false)\n}\n\nClientRequest.prototype.flushHeaders = function () {}\nClientRequest.prototype.setNoDelay = function () {}\nClientRequest.prototype.setSocketKeepAlive = function () {}\n\n// Taken from http://www.w3.org/TR/XMLHttpRequest/#the-setrequestheader%28%29-method\nvar unsafeHeaders = [\n\t'accept-charset',\n\t'accept-encoding',\n\t'access-control-request-headers',\n\t'access-control-request-method',\n\t'connection',\n\t'content-length',\n\t'cookie',\n\t'cookie2',\n\t'date',\n\t'dnt',\n\t'expect',\n\t'host',\n\t'keep-alive',\n\t'origin',\n\t'referer',\n\t'te',\n\t'trailer',\n\t'transfer-encoding',\n\t'upgrade',\n\t'via'\n]\n","var capability = require('./capability')\nvar inherits = require('inherits')\nvar stream = require('readable-stream')\n\nvar rStates = exports.readyStates = {\n\tUNSENT: 0,\n\tOPENED: 1,\n\tHEADERS_RECEIVED: 2,\n\tLOADING: 3,\n\tDONE: 4\n}\n\nvar IncomingMessage = exports.IncomingMessage = function (xhr, response, mode, resetTimers) {\n\tvar self = this\n\tstream.Readable.call(self)\n\n\tself._mode = mode\n\tself.headers = {}\n\tself.rawHeaders = []\n\tself.trailers = {}\n\tself.rawTrailers = []\n\n\t// Fake the 'close' event, but only once 'end' fires\n\tself.on('end', function () {\n\t\t// The nextTick is necessary to prevent the 'request' module from causing an infinite loop\n\t\tprocess.nextTick(function () {\n\t\t\tself.emit('close')\n\t\t})\n\t})\n\n\tif (mode === 'fetch') {\n\t\tself._fetchResponse = response\n\n\t\tself.url = response.url\n\t\tself.statusCode = response.status\n\t\tself.statusMessage = response.statusText\n\t\t\n\t\tresponse.headers.forEach(function (header, key){\n\t\t\tself.headers[key.toLowerCase()] = header\n\t\t\tself.rawHeaders.push(key, header)\n\t\t})\n\n\t\tif (capability.writableStream) {\n\t\t\tvar writable = new WritableStream({\n\t\t\t\twrite: function (chunk) {\n\t\t\t\t\tresetTimers(false)\n\t\t\t\t\treturn new Promise(function (resolve, reject) {\n\t\t\t\t\t\tif (self._destroyed) {\n\t\t\t\t\t\t\treject()\n\t\t\t\t\t\t} else if(self.push(Buffer.from(chunk))) {\n\t\t\t\t\t\t\tresolve()\n\t\t\t\t\t\t} else {\n\t\t\t\t\t\t\tself._resumeFetch = resolve\n\t\t\t\t\t\t}\n\t\t\t\t\t})\n\t\t\t\t},\n\t\t\t\tclose: function () {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.push(null)\n\t\t\t\t},\n\t\t\t\tabort: function (err) {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.emit('error', err)\n\t\t\t\t}\n\t\t\t})\n\n\t\t\ttry {\n\t\t\t\tresponse.body.pipeTo(writable).catch(function (err) {\n\t\t\t\t\tresetTimers(true)\n\t\t\t\t\tif (!self._destroyed)\n\t\t\t\t\t\tself.emit('error', err)\n\t\t\t\t})\n\t\t\t\treturn\n\t\t\t} catch (e) {} // pipeTo method isn't defined. Can't find a better way to feature test this\n\t\t}\n\t\t// fallback for when writableStream or pipeTo aren't available\n\t\tvar reader = response.body.getReader()\n\t\tfunction read () {\n\t\t\treader.read().then(function (result) {\n\t\t\t\tif (self._destroyed)\n\t\t\t\t\treturn\n\t\t\t\tresetTimers(result.done)\n\t\t\t\tif (result.done) {\n\t\t\t\t\tself.push(null)\n\t\t\t\t\treturn\n\t\t\t\t}\n\t\t\t\tself.push(Buffer.from(result.value))\n\t\t\t\tread()\n\t\t\t}).catch(function (err) {\n\t\t\t\tresetTimers(true)\n\t\t\t\tif (!self._destroyed)\n\t\t\t\t\tself.emit('error', err)\n\t\t\t})\n\t\t}\n\t\tread()\n\t} else {\n\t\tself._xhr = xhr\n\t\tself._pos = 0\n\n\t\tself.url = xhr.responseURL\n\t\tself.statusCode = xhr.status\n\t\tself.statusMessage = xhr.statusText\n\t\tvar headers = xhr.getAllResponseHeaders().split(/\\r?\\n/)\n\t\theaders.forEach(function (header) {\n\t\t\tvar matches = header.match(/^([^:]+):\\s*(.*)/)\n\t\t\tif (matches) {\n\t\t\t\tvar key = matches[1].toLowerCase()\n\t\t\t\tif (key === 'set-cookie') {\n\t\t\t\t\tif (self.headers[key] === undefined) {\n\t\t\t\t\t\tself.headers[key] = []\n\t\t\t\t\t}\n\t\t\t\t\tself.headers[key].push(matches[2])\n\t\t\t\t} else if (self.headers[key] !== undefined) {\n\t\t\t\t\tself.headers[key] += ', ' + matches[2]\n\t\t\t\t} else {\n\t\t\t\t\tself.headers[key] = matches[2]\n\t\t\t\t}\n\t\t\t\tself.rawHeaders.push(matches[1], matches[2])\n\t\t\t}\n\t\t})\n\n\t\tself._charset = 'x-user-defined'\n\t\tif (!capability.overrideMimeType) {\n\t\t\tvar mimeType = self.rawHeaders['mime-type']\n\t\t\tif (mimeType) {\n\t\t\t\tvar charsetMatch = mimeType.match(/;\\s*charset=([^;])(;|$)/)\n\t\t\t\tif (charsetMatch) {\n\t\t\t\t\tself._charset = charsetMatch[1].toLowerCase()\n\t\t\t\t}\n\t\t\t}\n\t\t\tif (!self._charset)\n\t\t\t\tself._charset = 'utf-8' // best guess\n\t\t}\n\t}\n}\n\ninherits(IncomingMessage, stream.Readable)\n\nIncomingMessage.prototype._read = function () {\n\tvar self = this\n\n\tvar resolve = self._resumeFetch\n\tif (resolve) {\n\t\tself._resumeFetch = null\n\t\tresolve()\n\t}\n}\n\nIncomingMessage.prototype._onXHRProgress = function (resetTimers) {\n\tvar self = this\n\n\tvar xhr = self._xhr\n\n\tvar response = null\n\tswitch (self._mode) {\n\t\tcase 'text':\n\t\t\tresponse = xhr.responseText\n\t\t\tif (response.length > self._pos) {\n\t\t\t\tvar newData = response.substr(self._pos)\n\t\t\t\tif (self._charset === 'x-user-defined') {\n\t\t\t\t\tvar buffer = Buffer.alloc(newData.length)\n\t\t\t\t\tfor (var i = 0; i < newData.length; i++)\n\t\t\t\t\t\tbuffer[i] = newData.charCodeAt(i) & 0xff\n\n\t\t\t\t\tself.push(buffer)\n\t\t\t\t} else {\n\t\t\t\t\tself.push(newData, self._charset)\n\t\t\t\t}\n\t\t\t\tself._pos = response.length\n\t\t\t}\n\t\t\tbreak\n\t\tcase 'arraybuffer':\n\t\t\tif (xhr.readyState !== rStates.DONE || !xhr.response)\n\t\t\t\tbreak\n\t\t\tresponse = xhr.response\n\t\t\tself.push(Buffer.from(new Uint8Array(response)))\n\t\t\tbreak\n\t\tcase 'moz-chunked-arraybuffer': // take whole\n\t\t\tresponse = xhr.response\n\t\t\tif (xhr.readyState !== rStates.LOADING || !response)\n\t\t\t\tbreak\n\t\t\tself.push(Buffer.from(new Uint8Array(response)))\n\t\t\tbreak\n\t\tcase 'ms-stream':\n\t\t\tresponse = xhr.response\n\t\t\tif (xhr.readyState !== rStates.LOADING)\n\t\t\t\tbreak\n\t\t\tvar reader = new global.MSStreamReader()\n\t\t\treader.onprogress = function () {\n\t\t\t\tif (reader.result.byteLength > self._pos) {\n\t\t\t\t\tself.push(Buffer.from(new Uint8Array(reader.result.slice(self._pos))))\n\t\t\t\t\tself._pos = reader.result.byteLength\n\t\t\t\t}\n\t\t\t}\n\t\t\treader.onload = function () {\n\t\t\t\tresetTimers(true)\n\t\t\t\tself.push(null)\n\t\t\t}\n\t\t\t// reader.onerror = ??? // TODO: this\n\t\t\treader.readAsArrayBuffer(response)\n\t\t\tbreak\n\t}\n\n\t// The ms-stream case handles end separately in reader.onload()\n\tif (self._xhr.readyState === rStates.DONE && self._mode !== 'ms-stream') {\n\t\tresetTimers(true)\n\t\tself.push(null)\n\t}\n}\n","/*! stream-to-blob-url. MIT License. Feross Aboukhadijeh */\nmodule.exports = getBlobURL\n\nconst getBlob = require('stream-to-blob')\n\nasync function getBlobURL (stream, mimeType) {\n const blob = await getBlob(stream, mimeType)\n const url = URL.createObjectURL(blob)\n return url\n}\n","/*! stream-to-blob. MIT License. Feross Aboukhadijeh */\n/* global Blob */\n\nmodule.exports = streamToBlob\n\nfunction streamToBlob (stream, mimeType) {\n if (mimeType != null && typeof mimeType !== 'string') {\n throw new Error('Invalid mimetype, expected string.')\n }\n return new Promise((resolve, reject) => {\n const chunks = []\n stream\n .on('data', chunk => chunks.push(chunk))\n .once('end', () => {\n const blob = mimeType != null\n ? new Blob(chunks, { type: mimeType })\n : new Blob(chunks)\n resolve(blob)\n })\n .once('error', reject)\n })\n}\n","/*! stream-with-known-length-to-buffer. MIT License. Feross Aboukhadijeh */\nvar once = require('once')\n\nmodule.exports = function getBuffer (stream, length, cb) {\n cb = once(cb)\n var buf = Buffer.alloc(length)\n var offset = 0\n stream\n .on('data', function (chunk) {\n chunk.copy(buf, offset)\n offset += chunk.length\n })\n .on('end', function () { cb(null, buf) })\n .on('error', cb)\n}\n","const { EventEmitter } = require('events')\nconst STREAM_DESTROYED = new Error('Stream was destroyed')\nconst PREMATURE_CLOSE = new Error('Premature close')\n\nconst queueTick = require('queue-tick')\nconst FIFO = require('fast-fifo')\n\n/* eslint-disable no-multi-spaces */\n\nconst MAX = ((1 << 25) - 1)\n\n// Shared state\nconst OPENING = 0b001\nconst DESTROYING = 0b010\nconst DESTROYED = 0b100\n\nconst NOT_OPENING = MAX ^ OPENING\n\n// Read state\nconst READ_ACTIVE = 0b0000000000001 << 3\nconst READ_PRIMARY = 0b0000000000010 << 3\nconst READ_SYNC = 0b0000000000100 << 3\nconst READ_QUEUED = 0b0000000001000 << 3\nconst READ_RESUMED = 0b0000000010000 << 3\nconst READ_PIPE_DRAINED = 0b0000000100000 << 3\nconst READ_ENDING = 0b0000001000000 << 3\nconst READ_EMIT_DATA = 0b0000010000000 << 3\nconst READ_EMIT_READABLE = 0b0000100000000 << 3\nconst READ_EMITTED_READABLE = 0b0001000000000 << 3\nconst READ_DONE = 0b0010000000000 << 3\nconst READ_NEXT_TICK = 0b0100000000001 << 3 // also active\nconst READ_NEEDS_PUSH = 0b1000000000000 << 3\n\nconst READ_NOT_ACTIVE = MAX ^ READ_ACTIVE\nconst READ_NON_PRIMARY = MAX ^ READ_PRIMARY\nconst READ_NON_PRIMARY_AND_PUSHED = MAX ^ (READ_PRIMARY | READ_NEEDS_PUSH)\nconst READ_NOT_SYNC = MAX ^ READ_SYNC\nconst READ_PUSHED = MAX ^ READ_NEEDS_PUSH\nconst READ_PAUSED = MAX ^ READ_RESUMED\nconst READ_NOT_QUEUED = MAX ^ (READ_QUEUED | READ_EMITTED_READABLE)\nconst READ_NOT_ENDING = MAX ^ READ_ENDING\nconst READ_PIPE_NOT_DRAINED = MAX ^ (READ_RESUMED | READ_PIPE_DRAINED)\nconst READ_NOT_NEXT_TICK = MAX ^ READ_NEXT_TICK\n\n// Write state\nconst WRITE_ACTIVE = 0b000000001 << 16\nconst WRITE_PRIMARY = 0b000000010 << 16\nconst WRITE_SYNC = 0b000000100 << 16\nconst WRITE_QUEUED = 0b000001000 << 16\nconst WRITE_UNDRAINED = 0b000010000 << 16\nconst WRITE_DONE = 0b000100000 << 16\nconst WRITE_EMIT_DRAIN = 0b001000000 << 16\nconst WRITE_NEXT_TICK = 0b010000001 << 16 // also active\nconst WRITE_FINISHING = 0b100000000 << 16\n\nconst WRITE_NOT_ACTIVE = MAX ^ WRITE_ACTIVE\nconst WRITE_NOT_SYNC = MAX ^ WRITE_SYNC\nconst WRITE_NON_PRIMARY = MAX ^ WRITE_PRIMARY\nconst WRITE_NOT_FINISHING = MAX ^ WRITE_FINISHING\nconst WRITE_DRAINED = MAX ^ WRITE_UNDRAINED\nconst WRITE_NOT_QUEUED = MAX ^ WRITE_QUEUED\nconst WRITE_NOT_NEXT_TICK = MAX ^ WRITE_NEXT_TICK\n\n// Combined shared state\nconst ACTIVE = READ_ACTIVE | WRITE_ACTIVE\nconst NOT_ACTIVE = MAX ^ ACTIVE\nconst DONE = READ_DONE | WRITE_DONE\nconst DESTROY_STATUS = DESTROYING | DESTROYED\nconst OPEN_STATUS = DESTROY_STATUS | OPENING\nconst AUTO_DESTROY = DESTROY_STATUS | DONE\nconst NON_PRIMARY = WRITE_NON_PRIMARY & READ_NON_PRIMARY\nconst TICKING = (WRITE_NEXT_TICK | READ_NEXT_TICK) & NOT_ACTIVE\nconst ACTIVE_OR_TICKING = ACTIVE | TICKING\nconst IS_OPENING = OPEN_STATUS | TICKING\n\n// Combined read state\nconst READ_PRIMARY_STATUS = OPEN_STATUS | READ_ENDING | READ_DONE\nconst READ_STATUS = OPEN_STATUS | READ_DONE | READ_QUEUED\nconst READ_FLOWING = READ_RESUMED | READ_PIPE_DRAINED\nconst READ_ACTIVE_AND_SYNC = READ_ACTIVE | READ_SYNC\nconst READ_ACTIVE_AND_SYNC_AND_NEEDS_PUSH = READ_ACTIVE | READ_SYNC | READ_NEEDS_PUSH\nconst READ_PRIMARY_AND_ACTIVE = READ_PRIMARY | READ_ACTIVE\nconst READ_ENDING_STATUS = OPEN_STATUS | READ_ENDING | READ_QUEUED\nconst READ_EMIT_READABLE_AND_QUEUED = READ_EMIT_READABLE | READ_QUEUED\nconst READ_READABLE_STATUS = OPEN_STATUS | READ_EMIT_READABLE | READ_QUEUED | READ_EMITTED_READABLE\nconst SHOULD_NOT_READ = OPEN_STATUS | READ_ACTIVE | READ_ENDING | READ_DONE | READ_NEEDS_PUSH\nconst READ_BACKPRESSURE_STATUS = DESTROY_STATUS | READ_ENDING | READ_DONE\n\n// Combined write state\nconst WRITE_PRIMARY_STATUS = OPEN_STATUS | WRITE_FINISHING | WRITE_DONE\nconst WRITE_QUEUED_AND_UNDRAINED = WRITE_QUEUED | WRITE_UNDRAINED\nconst WRITE_QUEUED_AND_ACTIVE = WRITE_QUEUED | WRITE_ACTIVE\nconst WRITE_DRAIN_STATUS = WRITE_QUEUED | WRITE_UNDRAINED | OPEN_STATUS | WRITE_ACTIVE\nconst WRITE_STATUS = OPEN_STATUS | WRITE_ACTIVE | WRITE_QUEUED\nconst WRITE_PRIMARY_AND_ACTIVE = WRITE_PRIMARY | WRITE_ACTIVE\nconst WRITE_ACTIVE_AND_SYNC = WRITE_ACTIVE | WRITE_SYNC\nconst WRITE_FINISHING_STATUS = OPEN_STATUS | WRITE_FINISHING | WRITE_QUEUED_AND_ACTIVE | WRITE_DONE\nconst WRITE_BACKPRESSURE_STATUS = WRITE_UNDRAINED | DESTROY_STATUS | WRITE_FINISHING | WRITE_DONE\n\nconst asyncIterator = Symbol.asyncIterator || Symbol('asyncIterator')\n\nclass WritableState {\n constructor (stream, { highWaterMark = 16384, map = null, mapWritable, byteLength, byteLengthWritable } = {}) {\n this.stream = stream\n this.queue = new FIFO()\n this.highWaterMark = highWaterMark\n this.buffered = 0\n this.error = null\n this.pipeline = null\n this.byteLength = byteLengthWritable || byteLength || defaultByteLength\n this.map = mapWritable || map\n this.afterWrite = afterWrite.bind(this)\n this.afterUpdateNextTick = updateWriteNT.bind(this)\n }\n\n get ended () {\n return (this.stream._duplexState & WRITE_DONE) !== 0\n }\n\n push (data) {\n if (this.map !== null) data = this.map(data)\n\n this.buffered += this.byteLength(data)\n this.queue.push(data)\n\n if (this.buffered < this.highWaterMark) {\n this.stream._duplexState |= WRITE_QUEUED\n return true\n }\n\n this.stream._duplexState |= WRITE_QUEUED_AND_UNDRAINED\n return false\n }\n\n shift () {\n const data = this.queue.shift()\n const stream = this.stream\n\n this.buffered -= this.byteLength(data)\n if (this.buffered === 0) stream._duplexState &= WRITE_NOT_QUEUED\n\n return data\n }\n\n end (data) {\n if (typeof data === 'function') this.stream.once('finish', data)\n else if (data !== undefined && data !== null) this.push(data)\n this.stream._duplexState = (this.stream._duplexState | WRITE_FINISHING) & WRITE_NON_PRIMARY\n }\n\n autoBatch (data, cb) {\n const buffer = []\n const stream = this.stream\n\n buffer.push(data)\n while ((stream._duplexState & WRITE_STATUS) === WRITE_QUEUED_AND_ACTIVE) {\n buffer.push(stream._writableState.shift())\n }\n\n if ((stream._duplexState & OPEN_STATUS) !== 0) return cb(null)\n stream._writev(buffer, cb)\n }\n\n update () {\n const stream = this.stream\n\n while ((stream._duplexState & WRITE_STATUS) === WRITE_QUEUED) {\n const data = this.shift()\n stream._duplexState |= WRITE_ACTIVE_AND_SYNC\n stream._write(data, this.afterWrite)\n stream._duplexState &= WRITE_NOT_SYNC\n }\n\n if ((stream._duplexState & WRITE_PRIMARY_AND_ACTIVE) === 0) this.updateNonPrimary()\n }\n\n updateNonPrimary () {\n const stream = this.stream\n\n if ((stream._duplexState & WRITE_FINISHING_STATUS) === WRITE_FINISHING) {\n stream._duplexState = (stream._duplexState | WRITE_ACTIVE) & WRITE_NOT_FINISHING\n stream._final(afterFinal.bind(this))\n return\n }\n\n if ((stream._duplexState & DESTROY_STATUS) === DESTROYING) {\n if ((stream._duplexState & ACTIVE_OR_TICKING) === 0) {\n stream._duplexState |= ACTIVE\n stream._destroy(afterDestroy.bind(this))\n }\n return\n }\n\n if ((stream._duplexState & IS_OPENING) === OPENING) {\n stream._duplexState = (stream._duplexState | ACTIVE) & NOT_OPENING\n stream._open(afterOpen.bind(this))\n }\n }\n\n updateNextTick () {\n if ((this.stream._duplexState & WRITE_NEXT_TICK) !== 0) return\n this.stream._duplexState |= WRITE_NEXT_TICK\n queueTick(this.afterUpdateNextTick)\n }\n}\n\nclass ReadableState {\n constructor (stream, { highWaterMark = 16384, map = null, mapReadable, byteLength, byteLengthReadable } = {}) {\n this.stream = stream\n this.queue = new FIFO()\n this.highWaterMark = highWaterMark\n this.buffered = 0\n this.error = null\n this.pipeline = null\n this.byteLength = byteLengthReadable || byteLength || defaultByteLength\n this.map = mapReadable || map\n this.pipeTo = null\n this.afterRead = afterRead.bind(this)\n this.afterUpdateNextTick = updateReadNT.bind(this)\n }\n\n get ended () {\n return (this.stream._duplexState & READ_DONE) !== 0\n }\n\n pipe (pipeTo, cb) {\n if (this.pipeTo !== null) throw new Error('Can only pipe to one destination')\n\n this.stream._duplexState |= READ_PIPE_DRAINED\n this.pipeTo = pipeTo\n this.pipeline = new Pipeline(this.stream, pipeTo, cb || null)\n\n if (cb) this.stream.on('error', noop) // We already error handle this so supress crashes\n\n if (isStreamx(pipeTo)) {\n pipeTo._writableState.pipeline = this.pipeline\n if (cb) pipeTo.on('error', noop) // We already error handle this so supress crashes\n pipeTo.on('finish', this.pipeline.finished.bind(this.pipeline)) // TODO: just call finished from pipeTo itself\n } else {\n const onerror = this.pipeline.done.bind(this.pipeline, pipeTo)\n const onclose = this.pipeline.done.bind(this.pipeline, pipeTo, null) // onclose has a weird bool arg\n pipeTo.on('error', onerror)\n pipeTo.on('close', onclose)\n pipeTo.on('finish', this.pipeline.finished.bind(this.pipeline))\n }\n\n pipeTo.on('drain', afterDrain.bind(this))\n this.stream.emit('piping', pipeTo)\n pipeTo.emit('pipe', this.stream)\n }\n\n push (data) {\n const stream = this.stream\n\n if (data === null) {\n this.highWaterMark = 0\n stream._duplexState = (stream._duplexState | READ_ENDING) & READ_NON_PRIMARY_AND_PUSHED\n return false\n }\n\n if (this.map !== null) data = this.map(data)\n this.buffered += this.byteLength(data)\n this.queue.push(data)\n\n stream._duplexState = (stream._duplexState | READ_QUEUED) & READ_PUSHED\n\n return this.buffered < this.highWaterMark\n }\n\n shift () {\n const data = this.queue.shift()\n\n this.buffered -= this.byteLength(data)\n if (this.buffered === 0) this.stream._duplexState &= READ_NOT_QUEUED\n return data\n }\n\n unshift (data) {\n let tail\n const pending = []\n\n while ((tail = this.queue.shift()) !== undefined) {\n pending.push(tail)\n }\n\n this.push(data)\n\n for (let i = 0; i < pending.length; i++) {\n this.queue.push(pending[i])\n }\n }\n\n read () {\n const stream = this.stream\n\n if ((stream._duplexState & READ_STATUS) === READ_QUEUED) {\n const data = this.shift()\n if (this.pipeTo !== null && this.pipeTo.write(data) === false) stream._duplexState &= READ_PIPE_NOT_DRAINED\n if ((stream._duplexState & READ_EMIT_DATA) !== 0) stream.emit('data', data)\n return data\n }\n\n return null\n }\n\n drain () {\n const stream = this.stream\n\n while ((stream._duplexState & READ_STATUS) === READ_QUEUED && (stream._duplexState & READ_FLOWING) !== 0) {\n const data = this.shift()\n if (this.pipeTo !== null && this.pipeTo.write(data) === false) stream._duplexState &= READ_PIPE_NOT_DRAINED\n if ((stream._duplexState & READ_EMIT_DATA) !== 0) stream.emit('data', data)\n }\n }\n\n update () {\n const stream = this.stream\n\n this.drain()\n\n while (this.buffered < this.highWaterMark && (stream._duplexState & SHOULD_NOT_READ) === 0) {\n stream._duplexState |= READ_ACTIVE_AND_SYNC_AND_NEEDS_PUSH\n stream._read(this.afterRead)\n stream._duplexState &= READ_NOT_SYNC\n if ((stream._duplexState & READ_ACTIVE) === 0) this.drain()\n }\n\n if ((stream._duplexState & READ_READABLE_STATUS) === READ_EMIT_READABLE_AND_QUEUED) {\n stream._duplexState |= READ_EMITTED_READABLE\n stream.emit('readable')\n }\n\n if ((stream._duplexState & READ_PRIMARY_AND_ACTIVE) === 0) this.updateNonPrimary()\n }\n\n updateNonPrimary () {\n const stream = this.stream\n\n if ((stream._duplexState & READ_ENDING_STATUS) === READ_ENDING) {\n stream._duplexState = (stream._duplexState | READ_DONE) & READ_NOT_ENDING\n stream.emit('end')\n if ((stream._duplexState & AUTO_DESTROY) === DONE) stream._duplexState |= DESTROYING\n if (this.pipeTo !== null) this.pipeTo.end()\n }\n\n if ((stream._duplexState & DESTROY_STATUS) === DESTROYING) {\n if ((stream._duplexState & ACTIVE_OR_TICKING) === 0) {\n stream._duplexState |= ACTIVE\n stream._destroy(afterDestroy.bind(this))\n }\n return\n }\n\n if ((stream._duplexState & IS_OPENING) === OPENING) {\n stream._duplexState = (stream._duplexState | ACTIVE) & NOT_OPENING\n stream._open(afterOpen.bind(this))\n }\n }\n\n updateNextTick () {\n if ((this.stream._duplexState & READ_NEXT_TICK) !== 0) return\n this.stream._duplexState |= READ_NEXT_TICK\n queueTick(this.afterUpdateNextTick)\n }\n}\n\nclass TransformState {\n constructor (stream) {\n this.data = null\n this.afterTransform = afterTransform.bind(stream)\n this.afterFinal = null\n }\n}\n\nclass Pipeline {\n constructor (src, dst, cb) {\n this.from = src\n this.to = dst\n this.afterPipe = cb\n this.error = null\n this.pipeToFinished = false\n }\n\n finished () {\n this.pipeToFinished = true\n }\n\n done (stream, err) {\n if (err) this.error = err\n\n if (stream === this.to) {\n this.to = null\n\n if (this.from !== null) {\n if ((this.from._duplexState & READ_DONE) === 0 || !this.pipeToFinished) {\n this.from.destroy(this.error || new Error('Writable stream closed prematurely'))\n }\n return\n }\n }\n\n if (stream === this.from) {\n this.from = null\n\n if (this.to !== null) {\n if ((stream._duplexState & READ_DONE) === 0) {\n this.to.destroy(this.error || new Error('Readable stream closed before ending'))\n }\n return\n }\n }\n\n if (this.afterPipe !== null) this.afterPipe(this.error)\n this.to = this.from = this.afterPipe = null\n }\n}\n\nfunction afterDrain () {\n this.stream._duplexState |= READ_PIPE_DRAINED\n if ((this.stream._duplexState & READ_ACTIVE_AND_SYNC) === 0) this.updateNextTick()\n else this.drain()\n}\n\nfunction afterFinal (err) {\n const stream = this.stream\n if (err) stream.destroy(err)\n if ((stream._duplexState & DESTROY_STATUS) === 0) {\n stream._duplexState |= WRITE_DONE\n stream.emit('finish')\n }\n if ((stream._duplexState & AUTO_DESTROY) === DONE) {\n stream._duplexState |= DESTROYING\n }\n\n stream._duplexState &= WRITE_NOT_ACTIVE\n this.update()\n}\n\nfunction afterDestroy (err) {\n const stream = this.stream\n\n if (!err && this.error !== STREAM_DESTROYED) err = this.error\n if (err) stream.emit('error', err)\n stream._duplexState |= DESTROYED\n stream.emit('close')\n\n const rs = stream._readableState\n const ws = stream._writableState\n\n if (rs !== null && rs.pipeline !== null) rs.pipeline.done(stream, err)\n if (ws !== null && ws.pipeline !== null) ws.pipeline.done(stream, err)\n}\n\nfunction afterWrite (err) {\n const stream = this.stream\n\n if (err) stream.destroy(err)\n stream._duplexState &= WRITE_NOT_ACTIVE\n\n if ((stream._duplexState & WRITE_DRAIN_STATUS) === WRITE_UNDRAINED) {\n stream._duplexState &= WRITE_DRAINED\n if ((stream._duplexState & WRITE_EMIT_DRAIN) === WRITE_EMIT_DRAIN) {\n stream.emit('drain')\n }\n }\n\n if ((stream._duplexState & WRITE_SYNC) === 0) this.update()\n}\n\nfunction afterRead (err) {\n if (err) this.stream.destroy(err)\n this.stream._duplexState &= READ_NOT_ACTIVE\n if ((this.stream._duplexState & READ_SYNC) === 0) this.update()\n}\n\nfunction updateReadNT () {\n this.stream._duplexState &= READ_NOT_NEXT_TICK\n this.update()\n}\n\nfunction updateWriteNT () {\n this.stream._duplexState &= WRITE_NOT_NEXT_TICK\n this.update()\n}\n\nfunction afterOpen (err) {\n const stream = this.stream\n\n if (err) stream.destroy(err)\n\n if ((stream._duplexState & DESTROYING) === 0) {\n if ((stream._duplexState & READ_PRIMARY_STATUS) === 0) stream._duplexState |= READ_PRIMARY\n if ((stream._duplexState & WRITE_PRIMARY_STATUS) === 0) stream._duplexState |= WRITE_PRIMARY\n stream.emit('open')\n }\n\n stream._duplexState &= NOT_ACTIVE\n\n if (stream._writableState !== null) {\n stream._writableState.update()\n }\n\n if (stream._readableState !== null) {\n stream._readableState.update()\n }\n}\n\nfunction afterTransform (err, data) {\n if (data !== undefined && data !== null) this.push(data)\n this._writableState.afterWrite(err)\n}\n\nclass Stream extends EventEmitter {\n constructor (opts) {\n super()\n\n this._duplexState = 0\n this._readableState = null\n this._writableState = null\n\n if (opts) {\n if (opts.open) this._open = opts.open\n if (opts.destroy) this._destroy = opts.destroy\n if (opts.predestroy) this._predestroy = opts.predestroy\n if (opts.signal) {\n opts.signal.addEventListener('abort', abort.bind(this))\n }\n }\n }\n\n _open (cb) {\n cb(null)\n }\n\n _destroy (cb) {\n cb(null)\n }\n\n _predestroy () {\n // does nothing\n }\n\n get readable () {\n return this._readableState !== null ? true : undefined\n }\n\n get writable () {\n return this._writableState !== null ? true : undefined\n }\n\n get destroyed () {\n return (this._duplexState & DESTROYED) !== 0\n }\n\n get destroying () {\n return (this._duplexState & DESTROY_STATUS) !== 0\n }\n\n destroy (err) {\n if ((this._duplexState & DESTROY_STATUS) === 0) {\n if (!err) err = STREAM_DESTROYED\n this._duplexState = (this._duplexState | DESTROYING) & NON_PRIMARY\n if (this._readableState !== null) {\n this._readableState.error = err\n this._readableState.updateNextTick()\n }\n if (this._writableState !== null) {\n this._writableState.error = err\n this._writableState.updateNextTick()\n }\n this._predestroy()\n }\n }\n\n on (name, fn) {\n if (this._readableState !== null) {\n if (name === 'data') {\n this._duplexState |= (READ_EMIT_DATA | READ_RESUMED)\n this._readableState.updateNextTick()\n }\n if (name === 'readable') {\n this._duplexState |= READ_EMIT_READABLE\n this._readableState.updateNextTick()\n }\n }\n\n if (this._writableState !== null) {\n if (name === 'drain') {\n this._duplexState |= WRITE_EMIT_DRAIN\n this._writableState.updateNextTick()\n }\n }\n\n return super.on(name, fn)\n }\n}\n\nclass Readable extends Stream {\n constructor (opts) {\n super(opts)\n\n this._duplexState |= OPENING | WRITE_DONE\n this._readableState = new ReadableState(this, opts)\n\n if (opts) {\n if (opts.read) this._read = opts.read\n if (opts.eagerOpen) this.resume().pause()\n }\n }\n\n _read (cb) {\n cb(null)\n }\n\n pipe (dest, cb) {\n this._readableState.pipe(dest, cb)\n this._readableState.updateNextTick()\n return dest\n }\n\n read () {\n this._readableState.updateNextTick()\n return this._readableState.read()\n }\n\n push (data) {\n this._readableState.updateNextTick()\n return this._readableState.push(data)\n }\n\n unshift (data) {\n this._readableState.updateNextTick()\n return this._readableState.unshift(data)\n }\n\n resume () {\n this._duplexState |= READ_RESUMED\n this._readableState.updateNextTick()\n return this\n }\n\n pause () {\n this._duplexState &= READ_PAUSED\n return this\n }\n\n static _fromAsyncIterator (ite, opts) {\n let destroy\n\n const rs = new Readable({\n ...opts,\n read (cb) {\n ite.next().then(push).then(cb.bind(null, null)).catch(cb)\n },\n predestroy () {\n destroy = ite.return()\n },\n destroy (cb) {\n if (!destroy) return cb(null)\n destroy.then(cb.bind(null, null)).catch(cb)\n }\n })\n\n return rs\n\n function push (data) {\n if (data.done) rs.push(null)\n else rs.push(data.value)\n }\n }\n\n static from (data, opts) {\n if (isReadStreamx(data)) return data\n if (data[asyncIterator]) return this._fromAsyncIterator(data[asyncIterator](), opts)\n if (!Array.isArray(data)) data = data === undefined ? [] : [data]\n\n let i = 0\n return new Readable({\n ...opts,\n read (cb) {\n this.push(i === data.length ? null : data[i++])\n cb(null)\n }\n })\n }\n\n static isBackpressured (rs) {\n return (rs._duplexState & READ_BACKPRESSURE_STATUS) !== 0 || rs._readableState.buffered >= rs._readableState.highWaterMark\n }\n\n static isPaused (rs) {\n return (rs._duplexState & READ_RESUMED) === 0\n }\n\n [asyncIterator] () {\n const stream = this\n\n let error = null\n let promiseResolve = null\n let promiseReject = null\n\n this.on('error', (err) => { error = err })\n this.on('readable', onreadable)\n this.on('close', onclose)\n\n return {\n [asyncIterator] () {\n return this\n },\n next () {\n return new Promise(function (resolve, reject) {\n promiseResolve = resolve\n promiseReject = reject\n const data = stream.read()\n if (data !== null) ondata(data)\n else if ((stream._duplexState & DESTROYED) !== 0) ondata(null)\n })\n },\n return () {\n return destroy(null)\n },\n throw (err) {\n return destroy(err)\n }\n }\n\n function onreadable () {\n if (promiseResolve !== null) ondata(stream.read())\n }\n\n function onclose () {\n if (promiseResolve !== null) ondata(null)\n }\n\n function ondata (data) {\n if (promiseReject === null) return\n if (error) promiseReject(error)\n else if (data === null && (stream._duplexState & READ_DONE) === 0) promiseReject(STREAM_DESTROYED)\n else promiseResolve({ value: data, done: data === null })\n promiseReject = promiseResolve = null\n }\n\n function destroy (err) {\n stream.destroy(err)\n return new Promise((resolve, reject) => {\n if (stream._duplexState & DESTROYED) return resolve({ value: undefined, done: true })\n stream.once('close', function () {\n if (err) reject(err)\n else resolve({ value: undefined, done: true })\n })\n })\n }\n }\n}\n\nclass Writable extends Stream {\n constructor (opts) {\n super(opts)\n\n this._duplexState |= OPENING | READ_DONE\n this._writableState = new WritableState(this, opts)\n\n if (opts) {\n if (opts.writev) this._writev = opts.writev\n if (opts.write) this._write = opts.write\n if (opts.final) this._final = opts.final\n }\n }\n\n _writev (batch, cb) {\n cb(null)\n }\n\n _write (data, cb) {\n this._writableState.autoBatch(data, cb)\n }\n\n _final (cb) {\n cb(null)\n }\n\n static isBackpressured (ws) {\n return (ws._duplexState & WRITE_BACKPRESSURE_STATUS) !== 0\n }\n\n write (data) {\n this._writableState.updateNextTick()\n return this._writableState.push(data)\n }\n\n end (data) {\n this._writableState.updateNextTick()\n this._writableState.end(data)\n return this\n }\n}\n\nclass Duplex extends Readable { // and Writable\n constructor (opts) {\n super(opts)\n\n this._duplexState = OPENING\n this._writableState = new WritableState(this, opts)\n\n if (opts) {\n if (opts.writev) this._writev = opts.writev\n if (opts.write) this._write = opts.write\n if (opts.final) this._final = opts.final\n }\n }\n\n _writev (batch, cb) {\n cb(null)\n }\n\n _write (data, cb) {\n this._writableState.autoBatch(data, cb)\n }\n\n _final (cb) {\n cb(null)\n }\n\n write (data) {\n this._writableState.updateNextTick()\n return this._writableState.push(data)\n }\n\n end (data) {\n this._writableState.updateNextTick()\n this._writableState.end(data)\n return this\n }\n}\n\nclass Transform extends Duplex {\n constructor (opts) {\n super(opts)\n this._transformState = new TransformState(this)\n\n if (opts) {\n if (opts.transform) this._transform = opts.transform\n if (opts.flush) this._flush = opts.flush\n }\n }\n\n _write (data, cb) {\n if (this._readableState.buffered >= this._readableState.highWaterMark) {\n this._transformState.data = data\n } else {\n this._transform(data, this._transformState.afterTransform)\n }\n }\n\n _read (cb) {\n if (this._transformState.data !== null) {\n const data = this._transformState.data\n this._transformState.data = null\n cb(null)\n this._transform(data, this._transformState.afterTransform)\n } else {\n cb(null)\n }\n }\n\n _transform (data, cb) {\n cb(null, data)\n }\n\n _flush (cb) {\n cb(null)\n }\n\n _final (cb) {\n this._transformState.afterFinal = cb\n this._flush(transformAfterFlush.bind(this))\n }\n}\n\nclass PassThrough extends Transform {}\n\nfunction transformAfterFlush (err, data) {\n const cb = this._transformState.afterFinal\n if (err) return cb(err)\n if (data !== null && data !== undefined) this.push(data)\n this.push(null)\n cb(null)\n}\n\nfunction pipelinePromise (...streams) {\n return new Promise((resolve, reject) => {\n return pipeline(...streams, (err) => {\n if (err) return reject(err)\n resolve()\n })\n })\n}\n\nfunction pipeline (stream, ...streams) {\n const all = Array.isArray(stream) ? [...stream, ...streams] : [stream, ...streams]\n const done = (all.length && typeof all[all.length - 1] === 'function') ? all.pop() : null\n\n if (all.length < 2) throw new Error('Pipeline requires at least 2 streams')\n\n let src = all[0]\n let dest = null\n let error = null\n\n for (let i = 1; i < all.length; i++) {\n dest = all[i]\n\n if (isStreamx(src)) {\n src.pipe(dest, onerror)\n } else {\n errorHandle(src, true, i > 1, onerror)\n src.pipe(dest)\n }\n\n src = dest\n }\n\n if (done) {\n let fin = false\n\n dest.on('finish', () => { fin = true })\n dest.on('error', err => { error = error || err })\n dest.on('close', () => done(error || (fin ? null : PREMATURE_CLOSE)))\n }\n\n return dest\n\n function errorHandle (s, rd, wr, onerror) {\n s.on('error', onerror)\n s.on('close', onclose)\n\n function onclose () {\n if (rd && s._readableState && !s._readableState.ended) return onerror(PREMATURE_CLOSE)\n if (wr && s._writableState && !s._writableState.ended) return onerror(PREMATURE_CLOSE)\n }\n }\n\n function onerror (err) {\n if (!err || error) return\n error = err\n\n for (const s of all) {\n s.destroy(err)\n }\n }\n}\n\nfunction isStream (stream) {\n return !!stream._readableState || !!stream._writableState\n}\n\nfunction isStreamx (stream) {\n return typeof stream._duplexState === 'number' && isStream(stream)\n}\n\nfunction isReadStreamx (stream) {\n return isStreamx(stream) && stream.readable\n}\n\nfunction isTypedArray (data) {\n return typeof data === 'object' && data !== null && typeof data.byteLength === 'number'\n}\n\nfunction defaultByteLength (data) {\n return isTypedArray(data) ? data.byteLength : 1024\n}\n\nfunction noop () {}\n\nfunction abort () {\n this.destroy(new Error('Stream aborted.'))\n}\n\nmodule.exports = {\n pipeline,\n pipelinePromise,\n isStream,\n isStreamx,\n Stream,\n Writable,\n Readable,\n Duplex,\n Transform,\n // Export PassThrough for compatibility with Node.js core's stream module\n PassThrough\n}\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\n'use strict';\n\n/**/\n\nvar Buffer = require('safe-buffer').Buffer;\n/**/\n\nvar isEncoding = Buffer.isEncoding || function (encoding) {\n encoding = '' + encoding;\n switch (encoding && encoding.toLowerCase()) {\n case 'hex':case 'utf8':case 'utf-8':case 'ascii':case 'binary':case 'base64':case 'ucs2':case 'ucs-2':case 'utf16le':case 'utf-16le':case 'raw':\n return true;\n default:\n return false;\n }\n};\n\nfunction _normalizeEncoding(enc) {\n if (!enc) return 'utf8';\n var retried;\n while (true) {\n switch (enc) {\n case 'utf8':\n case 'utf-8':\n return 'utf8';\n case 'ucs2':\n case 'ucs-2':\n case 'utf16le':\n case 'utf-16le':\n return 'utf16le';\n case 'latin1':\n case 'binary':\n return 'latin1';\n case 'base64':\n case 'ascii':\n case 'hex':\n return enc;\n default:\n if (retried) return; // undefined\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\nfunction normalizeEncoding(enc) {\n var nenc = _normalizeEncoding(enc);\n if (typeof nenc !== 'string' && (Buffer.isEncoding === isEncoding || !isEncoding(enc))) throw new Error('Unknown encoding: ' + enc);\n return nenc || enc;\n}\n\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.\nexports.StringDecoder = StringDecoder;\nfunction StringDecoder(encoding) {\n this.encoding = normalizeEncoding(encoding);\n var nb;\n switch (this.encoding) {\n case 'utf16le':\n this.text = utf16Text;\n this.end = utf16End;\n nb = 4;\n break;\n case 'utf8':\n this.fillLast = utf8FillLast;\n nb = 4;\n break;\n case 'base64':\n this.text = base64Text;\n this.end = base64End;\n nb = 3;\n break;\n default:\n this.write = simpleWrite;\n this.end = simpleEnd;\n return;\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 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 if (i < buf.length) return r ? r + this.text(buf, i) : this.text(buf, i);\n return r || '';\n};\n\nStringDecoder.prototype.end = utf8End;\n\n// Returns only complete characters in a Buffer\nStringDecoder.prototype.text = utf8Text;\n\n// Attempts to complete a partial non-UTF-8 character using bytes from a Buffer\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 buf.copy(this.lastChar, this.lastTotal - this.lastNeed, 0, buf.length);\n this.lastNeed -= buf.length;\n};\n\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.\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}\n\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.\nfunction utf8CheckIncomplete(self, buf, i) {\n var j = buf.length - 1;\n if (j < i) return 0;\n var nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 1;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) self.lastNeed = nb - 2;\n return nb;\n }\n if (--j < i || nb === -2) return 0;\n nb = utf8CheckByte(buf[j]);\n if (nb >= 0) {\n if (nb > 0) {\n if (nb === 2) nb = 0;else self.lastNeed = nb - 3;\n }\n return nb;\n }\n return 0;\n}\n\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.\nfunction utf8CheckExtraBytes(self, buf, p) {\n if ((buf[0] & 0xC0) !== 0x80) {\n self.lastNeed = 0;\n return '\\ufffd';\n }\n if (self.lastNeed > 1 && buf.length > 1) {\n if ((buf[1] & 0xC0) !== 0x80) {\n self.lastNeed = 1;\n return '\\ufffd';\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}\n\n// Attempts to complete a multi-byte UTF-8 character using bytes from a Buffer.\nfunction utf8FillLast(buf) {\n var p = this.lastTotal - this.lastNeed;\n var r = utf8CheckExtraBytes(this, buf, p);\n if (r !== undefined) return r;\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 buf.copy(this.lastChar, p, 0, buf.length);\n this.lastNeed -= buf.length;\n}\n\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.\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}\n\n// For UTF-8, a replacement character is added when ending on a partial\n// character.\nfunction utf8End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) return r + '\\ufffd';\n return r;\n}\n\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.\nfunction utf16Text(buf, i) {\n if ((buf.length - i) % 2 === 0) {\n var r = buf.toString('utf16le', i);\n if (r) {\n var c = r.charCodeAt(r.length - 1);\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 return r;\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}\n\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.\nfunction utf16End(buf) {\n var r = buf && buf.length ? this.write(buf) : '';\n if (this.lastNeed) {\n var end = this.lastTotal - this.lastNeed;\n return r + this.lastChar.toString('utf16le', 0, end);\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 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 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}\n\n// Pass bytes on through for single-byte encodings (e.g. ascii, latin1, hex)\nfunction simpleWrite(buf) {\n return buf.toString(this.encoding);\n}\n\nfunction simpleEnd(buf) {\n return buf && buf.length ? this.write(buf) : '';\n}","/* \nCopyright (c) 2011, Chris Umbel\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in \nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN \nTHE SOFTWARE.\n*/\n\nvar base32 = require('./thirty-two');\n\nexports.encode = base32.encode;\nexports.decode = base32.decode;\n","/*\nCopyright (c) 2011, Chris Umbel\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n'use strict';\n\nvar charTable = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567\";\nvar byteTable = [\n 0xff, 0xff, 0x1a, 0x1b, 0x1c, 0x1d, 0x1e, 0x1f,\n 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,\n 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e,\n 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,\n 0x17, 0x18, 0x19, 0xff, 0xff, 0xff, 0xff, 0xff,\n 0xff, 0x00, 0x01, 0x02, 0x03, 0x04, 0x05, 0x06,\n 0x07, 0x08, 0x09, 0x0a, 0x0b, 0x0c, 0x0d, 0x0e,\n 0x0f, 0x10, 0x11, 0x12, 0x13, 0x14, 0x15, 0x16,\n 0x17, 0x18, 0x19, 0xff, 0xff, 0xff, 0xff, 0xff\n];\n\nfunction quintetCount(buff) {\n var quintets = Math.floor(buff.length / 5);\n return buff.length % 5 === 0 ? quintets: quintets + 1;\n}\n\nexports.encode = function(plain) {\n if(!Buffer.isBuffer(plain)){\n \tplain = new Buffer(plain);\n }\n var i = 0;\n var j = 0;\n var shiftIndex = 0;\n var digit = 0;\n var encoded = new Buffer(quintetCount(plain) * 8);\n\n /* byte by byte isn't as pretty as quintet by quintet but tests a bit\n faster. will have to revisit. */\n while(i < plain.length) {\n var current = plain[i];\n\n if(shiftIndex > 3) {\n digit = current & (0xff >> shiftIndex);\n shiftIndex = (shiftIndex + 5) % 8;\n digit = (digit << shiftIndex) | ((i + 1 < plain.length) ?\n plain[i + 1] : 0) >> (8 - shiftIndex);\n i++;\n } else {\n digit = (current >> (8 - (shiftIndex + 5))) & 0x1f;\n shiftIndex = (shiftIndex + 5) % 8;\n if(shiftIndex === 0) i++;\n }\n\n encoded[j] = charTable.charCodeAt(digit);\n j++;\n }\n\n for(i = j; i < encoded.length; i++) {\n encoded[i] = 0x3d; //'='.charCodeAt(0)\n }\n\n return encoded;\n};\n\nexports.decode = function(encoded) {\n var shiftIndex = 0;\n var plainDigit = 0;\n var plainChar;\n var plainPos = 0;\n if(!Buffer.isBuffer(encoded)){\n \tencoded = new Buffer(encoded);\n }\n var decoded = new Buffer(Math.ceil(encoded.length * 5 / 8));\n\n /* byte by byte isn't as pretty as octet by octet but tests a bit\n faster. will have to revisit. */\n for(var i = 0; i < encoded.length; i++) {\n \tif(encoded[i] === 0x3d){ //'='\n \t\tbreak;\n \t}\n\n var encodedByte = encoded[i] - 0x30;\n\n if(encodedByte < byteTable.length) {\n plainDigit = byteTable[encodedByte];\n\n if(shiftIndex <= 3) {\n shiftIndex = (shiftIndex + 5) % 8;\n\n if(shiftIndex === 0) {\n plainChar |= plainDigit;\n decoded[plainPos] = plainChar;\n plainPos++;\n plainChar = 0;\n } else {\n plainChar |= 0xff & (plainDigit << (8 - shiftIndex));\n }\n } else {\n shiftIndex = (shiftIndex + 5) % 8;\n plainChar |= 0xff & (plainDigit >>> shiftIndex);\n decoded[plainPos] = plainChar;\n plainPos++;\n\n plainChar = 0xff & (plainDigit << (8 - shiftIndex));\n }\n } else {\n \tthrow new Error('Invalid input - it is not base32 encoded string');\n }\n }\n\n return decoded.slice(0, plainPos);\n};\n","var Buffer = require('buffer').Buffer\n\nmodule.exports = function (buf) {\n\t// If the buffer is backed by a Uint8Array, a faster version will work\n\tif (buf instanceof Uint8Array) {\n\t\t// If the buffer isn't a subarray, return the underlying ArrayBuffer\n\t\tif (buf.byteOffset === 0 && buf.byteLength === buf.buffer.byteLength) {\n\t\t\treturn buf.buffer\n\t\t} else if (typeof buf.buffer.slice === 'function') {\n\t\t\t// Otherwise we need to get a proper copy\n\t\t\treturn buf.buffer.slice(buf.byteOffset, buf.byteOffset + buf.byteLength)\n\t\t}\n\t}\n\n\tif (Buffer.isBuffer(buf)) {\n\t\t// This is the slow version that will work with any Buffer\n\t\t// implementation (even in old browsers)\n\t\tvar arrayCopy = new Uint8Array(buf.length)\n\t\tvar len = buf.length\n\t\tfor (var i = 0; i < len; i++) {\n\t\t\tarrayCopy[i] = buf[i]\n\t\t}\n\t\treturn arrayCopy.buffer\n\t} else {\n\t\tthrow new Error('Argument must be a Buffer')\n\t}\n}\n","/*! torrent-discovery. MIT License. WebTorrent LLC */\nconst debug = require('debug')('torrent-discovery')\nconst DHT = require('bittorrent-dht/client') // empty object in browser\nconst EventEmitter = require('events').EventEmitter\nconst parallel = require('run-parallel')\nconst Tracker = require('bittorrent-tracker/client')\nconst LSD = require('bittorrent-lsd')\n\nclass Discovery extends EventEmitter {\n constructor (opts) {\n super()\n\n if (!opts.peerId) throw new Error('Option `peerId` is required')\n if (!opts.infoHash) throw new Error('Option `infoHash` is required')\n if (!process.browser && !opts.port) throw new Error('Option `port` is required')\n\n this.peerId = typeof opts.peerId === 'string'\n ? opts.peerId\n : opts.peerId.toString('hex')\n this.infoHash = typeof opts.infoHash === 'string'\n ? opts.infoHash.toLowerCase()\n : opts.infoHash.toString('hex')\n this._port = opts.port // torrent port\n this._userAgent = opts.userAgent // User-Agent header for http requests\n\n this.destroyed = false\n\n this._announce = opts.announce || []\n this._intervalMs = opts.intervalMs || (15 * 60 * 1000)\n this._trackerOpts = null\n this._dhtAnnouncing = false\n this._dhtTimeout = false\n this._internalDHT = false // is the DHT created internally?\n\n this._onWarning = err => {\n this.emit('warning', err)\n }\n this._onError = err => {\n this.emit('error', err)\n }\n this._onDHTPeer = (peer, infoHash) => {\n if (infoHash.toString('hex') !== this.infoHash) return\n this.emit('peer', `${peer.host}:${peer.port}`, 'dht')\n }\n this._onTrackerPeer = peer => {\n this.emit('peer', peer, 'tracker')\n }\n this._onTrackerAnnounce = () => {\n this.emit('trackerAnnounce')\n }\n this._onLSDPeer = (peer, infoHash) => {\n this.emit('peer', peer, 'lsd')\n }\n\n const createDHT = (port, opts) => {\n const dht = new DHT(opts)\n dht.on('warning', this._onWarning)\n dht.on('error', this._onError)\n dht.listen(port)\n this._internalDHT = true\n return dht\n }\n\n if (opts.tracker === false) {\n this.tracker = null\n } else if (opts.tracker && typeof opts.tracker === 'object') {\n this._trackerOpts = Object.assign({}, opts.tracker)\n this.tracker = this._createTracker()\n } else {\n this.tracker = this._createTracker()\n }\n\n if (opts.dht === false || typeof DHT !== 'function') {\n this.dht = null\n } else if (opts.dht && typeof opts.dht.addNode === 'function') {\n this.dht = opts.dht\n } else if (opts.dht && typeof opts.dht === 'object') {\n this.dht = createDHT(opts.dhtPort, opts.dht)\n } else {\n this.dht = createDHT(opts.dhtPort)\n }\n\n if (this.dht) {\n this.dht.on('peer', this._onDHTPeer)\n this._dhtAnnounce()\n }\n\n if (opts.lsd === false || typeof LSD !== 'function') {\n this.lsd = null\n } else {\n this.lsd = this._createLSD()\n }\n }\n\n updatePort (port) {\n if (port === this._port) return\n this._port = port\n\n if (this.dht) this._dhtAnnounce()\n\n if (this.tracker) {\n this.tracker.stop()\n this.tracker.destroy(() => {\n this.tracker = this._createTracker()\n })\n }\n }\n\n complete (opts) {\n if (this.tracker) {\n this.tracker.complete(opts)\n }\n }\n\n destroy (cb) {\n if (this.destroyed) return\n this.destroyed = true\n\n clearTimeout(this._dhtTimeout)\n\n const tasks = []\n\n if (this.tracker) {\n this.tracker.stop()\n this.tracker.removeListener('warning', this._onWarning)\n this.tracker.removeListener('error', this._onError)\n this.tracker.removeListener('peer', this._onTrackerPeer)\n this.tracker.removeListener('update', this._onTrackerAnnounce)\n tasks.push(cb => {\n this.tracker.destroy(cb)\n })\n }\n\n if (this.dht) {\n this.dht.removeListener('peer', this._onDHTPeer)\n }\n\n if (this._internalDHT) {\n this.dht.removeListener('warning', this._onWarning)\n this.dht.removeListener('error', this._onError)\n tasks.push(cb => {\n this.dht.destroy(cb)\n })\n }\n\n if (this.lsd) {\n this.lsd.removeListener('warning', this._onWarning)\n this.lsd.removeListener('error', this._onError)\n this.lsd.removeListener('peer', this._onLSDPeer)\n tasks.push(cb => {\n this.lsd.destroy(cb)\n })\n }\n\n parallel(tasks, cb)\n\n // cleanup\n this.dht = null\n this.tracker = null\n this.lsd = null\n this._announce = null\n }\n\n _createTracker () {\n const opts = Object.assign({}, this._trackerOpts, {\n infoHash: this.infoHash,\n announce: this._announce,\n peerId: this.peerId,\n port: this._port,\n userAgent: this._userAgent\n })\n\n const tracker = new Tracker(opts)\n tracker.on('warning', this._onWarning)\n tracker.on('error', this._onError)\n tracker.on('peer', this._onTrackerPeer)\n tracker.on('update', this._onTrackerAnnounce)\n tracker.setInterval(this._intervalMs)\n tracker.start()\n return tracker\n }\n\n _dhtAnnounce () {\n if (this._dhtAnnouncing) return\n debug('dht announce')\n\n this._dhtAnnouncing = true\n clearTimeout(this._dhtTimeout)\n\n this.dht.announce(this.infoHash, this._port, err => {\n this._dhtAnnouncing = false\n debug('dht announce complete')\n\n if (err) this.emit('warning', err)\n this.emit('dhtAnnounce')\n\n if (!this.destroyed) {\n this._dhtTimeout = setTimeout(() => {\n this._dhtAnnounce()\n }, this._intervalMs + Math.floor(Math.random() * this._intervalMs / 5))\n if (this._dhtTimeout.unref) this._dhtTimeout.unref()\n }\n })\n }\n\n _createLSD () {\n const opts = Object.assign({}, {\n infoHash: this.infoHash,\n peerId: this.peerId,\n port: this._port\n })\n\n const lsd = new LSD(opts)\n lsd.on('warning', this._onWarning)\n lsd.on('error', this._onError)\n lsd.on('peer', this._onLSDPeer)\n lsd.start()\n return lsd\n }\n}\n\nmodule.exports = Discovery\n","/*! torrent-piece. MIT License. WebTorrent LLC */\nconst BLOCK_LENGTH = 1 << 14\n\nclass Piece {\n constructor (length) {\n this.length = length\n this.missing = length\n this.sources = null\n\n this._chunks = Math.ceil(length / BLOCK_LENGTH)\n this._remainder = (length % BLOCK_LENGTH) || BLOCK_LENGTH\n this._buffered = 0\n this._buffer = null\n this._cancellations = null\n this._reservations = 0\n this._flushed = false\n }\n\n chunkLength (i) {\n return i === this._chunks - 1 ? this._remainder : BLOCK_LENGTH\n }\n\n chunkLengthRemaining (i) {\n return this.length - (i * BLOCK_LENGTH)\n }\n\n chunkOffset (i) {\n return i * BLOCK_LENGTH\n }\n\n reserve () {\n if (!this.init()) return -1\n if (this._cancellations.length) return this._cancellations.pop()\n if (this._reservations < this._chunks) return this._reservations++\n return -1\n }\n\n reserveRemaining () {\n if (!this.init()) return -1\n if (this._cancellations.length || this._reservations < this._chunks) {\n let min = this._reservations\n while (this._cancellations.length) {\n min = Math.min(min, this._cancellations.pop())\n }\n this._reservations = this._chunks\n return min\n }\n return -1\n }\n\n cancel (i) {\n if (!this.init()) return\n this._cancellations.push(i)\n }\n\n cancelRemaining (i) {\n if (!this.init()) return\n this._reservations = i\n }\n\n get (i) {\n if (!this.init()) return null\n return this._buffer[i]\n }\n\n set (i, data, source) {\n if (!this.init()) return false\n const len = data.length\n const blocks = Math.ceil(len / BLOCK_LENGTH)\n for (let j = 0; j < blocks; j++) {\n if (!this._buffer[i + j]) {\n const offset = j * BLOCK_LENGTH\n const splitData = data.slice(offset, offset + BLOCK_LENGTH)\n this._buffered++\n this._buffer[i + j] = splitData\n this.missing -= splitData.length\n if (!this.sources.includes(source)) {\n this.sources.push(source)\n }\n }\n }\n return this._buffered === this._chunks\n }\n\n flush () {\n if (!this._buffer || this._chunks !== this._buffered) return null\n const buffer = Buffer.concat(this._buffer, this.length)\n this._buffer = null\n this._cancellations = null\n this.sources = null\n this._flushed = true\n return buffer\n }\n\n init () {\n if (this._flushed) return false\n if (this._buffer) return true\n this._buffer = new Array(this._chunks)\n this._cancellations = []\n this.sources = []\n return true\n }\n}\n\nObject.defineProperty(Piece, 'BLOCK_LENGTH', { value: BLOCK_LENGTH })\n\nmodule.exports = Piece\n","/**\n * Convert a typed array to a Buffer without a copy\n *\n * Author: Feross Aboukhadijeh \n * License: MIT\n *\n * `npm install typedarray-to-buffer`\n */\n\nvar isTypedArray = require('is-typedarray').strict\n\nmodule.exports = function typedarrayToBuffer (arr) {\n if (isTypedArray(arr)) {\n // To avoid a copy, use the typed array's underlying ArrayBuffer to back new Buffer\n var buf = Buffer.from(arr.buffer)\n if (arr.byteLength !== arr.buffer.byteLength) {\n // Respect the \"view\", i.e. byteOffset and byteLength, without doing a copy\n buf = buf.slice(arr.byteOffset, arr.byteOffset + arr.byteLength)\n }\n return buf\n } else {\n // Pass through all other types to `Buffer.from`\n return Buffer.from(arr)\n }\n}\n","var bufferAlloc = require('buffer-alloc')\n\nvar UINT_32_MAX = Math.pow(2, 32)\n\nexports.encodingLength = function () {\n return 8\n}\n\nexports.encode = function (num, buf, offset) {\n if (!buf) buf = bufferAlloc(8)\n if (!offset) offset = 0\n\n var top = Math.floor(num / UINT_32_MAX)\n var rem = num - top * UINT_32_MAX\n\n buf.writeUInt32BE(top, offset)\n buf.writeUInt32BE(rem, offset + 4)\n return buf\n}\n\nexports.decode = function (buf, offset) {\n if (!offset) offset = 0\n\n var top = buf.readUInt32BE(offset)\n var rem = buf.readUInt32BE(offset + 4)\n\n return top * UINT_32_MAX + rem\n}\n\nexports.encode.bytes = 8\nexports.decode.bytes = 8\n","module.exports = remove\n\nfunction remove (arr, i) {\n if (i >= arr.length || i < 0) return\n var last = arr.pop()\n if (i < arr.length) {\n var tmp = arr[i]\n arr[i] = last\n return tmp\n }\n return last\n}\n","/*! https://mths.be/punycode v1.3.2 by @mathias */\n;(function(root) {\n\n\t/** Detect free variables */\n\tvar freeExports = typeof exports == 'object' && exports &&\n\t\t!exports.nodeType && exports;\n\tvar freeModule = typeof module == 'object' && module &&\n\t\t!module.nodeType && module;\n\tvar freeGlobal = typeof global == 'object' && global;\n\tif (\n\t\tfreeGlobal.global === freeGlobal ||\n\t\tfreeGlobal.window === freeGlobal ||\n\t\tfreeGlobal.self === freeGlobal\n\t) {\n\t\troot = freeGlobal;\n\t}\n\n\t/**\n\t * The `punycode` object.\n\t * @name punycode\n\t * @type Object\n\t */\n\tvar punycode,\n\n\t/** Highest positive signed 32-bit float value */\n\tmaxInt = 2147483647, // aka. 0x7FFFFFFF or 2^31-1\n\n\t/** Bootstring parameters */\n\tbase = 36,\n\ttMin = 1,\n\ttMax = 26,\n\tskew = 38,\n\tdamp = 700,\n\tinitialBias = 72,\n\tinitialN = 128, // 0x80\n\tdelimiter = '-', // '\\x2D'\n\n\t/** Regular expressions */\n\tregexPunycode = /^xn--/,\n\tregexNonASCII = /[^\\x20-\\x7E]/, // unprintable ASCII chars + non-ASCII chars\n\tregexSeparators = /[\\x2E\\u3002\\uFF0E\\uFF61]/g, // RFC 3490 separators\n\n\t/** Error messages */\n\terrors = {\n\t\t'overflow': 'Overflow: input needs wider integers to process',\n\t\t'not-basic': 'Illegal input >= 0x80 (not a basic code point)',\n\t\t'invalid-input': 'Invalid input'\n\t},\n\n\t/** Convenience shortcuts */\n\tbaseMinusTMin = base - tMin,\n\tfloor = Math.floor,\n\tstringFromCharCode = String.fromCharCode,\n\n\t/** Temporary variable */\n\tkey;\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/**\n\t * A generic error utility function.\n\t * @private\n\t * @param {String} type The error type.\n\t * @returns {Error} Throws a `RangeError` with the applicable error message.\n\t */\n\tfunction error(type) {\n\t\tthrow RangeError(errors[type]);\n\t}\n\n\t/**\n\t * A generic `Array#map` utility function.\n\t * @private\n\t * @param {Array} array The array to iterate over.\n\t * @param {Function} callback The function that gets called for every array\n\t * item.\n\t * @returns {Array} A new array of values returned by the callback function.\n\t */\n\tfunction map(array, fn) {\n\t\tvar length = array.length;\n\t\tvar result = [];\n\t\twhile (length--) {\n\t\t\tresult[length] = fn(array[length]);\n\t\t}\n\t\treturn result;\n\t}\n\n\t/**\n\t * A simple `Array#map`-like wrapper to work with domain name strings or email\n\t * addresses.\n\t * @private\n\t * @param {String} domain The domain name or email address.\n\t * @param {Function} callback The function that gets called for every\n\t * character.\n\t * @returns {Array} A new string of characters returned by the callback\n\t * function.\n\t */\n\tfunction mapDomain(string, fn) {\n\t\tvar parts = string.split('@');\n\t\tvar result = '';\n\t\tif (parts.length > 1) {\n\t\t\t// In email addresses, only the domain name should be punycoded. Leave\n\t\t\t// the local part (i.e. everything up to `@`) intact.\n\t\t\tresult = parts[0] + '@';\n\t\t\tstring = parts[1];\n\t\t}\n\t\t// Avoid `split(regex)` for IE8 compatibility. See #17.\n\t\tstring = string.replace(regexSeparators, '\\x2E');\n\t\tvar labels = string.split('.');\n\t\tvar encoded = map(labels, fn).join('.');\n\t\treturn result + encoded;\n\t}\n\n\t/**\n\t * Creates an array containing the numeric code points of each Unicode\n\t * character in the string. While JavaScript uses UCS-2 internally,\n\t * this function will convert a pair of surrogate halves (each of which\n\t * UCS-2 exposes as separate characters) into a single code point,\n\t * matching UTF-16.\n\t * @see `punycode.ucs2.encode`\n\t * @see \n\t * @memberOf punycode.ucs2\n\t * @name decode\n\t * @param {String} string The Unicode input string (UCS-2).\n\t * @returns {Array} The new array of code points.\n\t */\n\tfunction ucs2decode(string) {\n\t\tvar output = [],\n\t\t counter = 0,\n\t\t length = string.length,\n\t\t value,\n\t\t extra;\n\t\twhile (counter < length) {\n\t\t\tvalue = string.charCodeAt(counter++);\n\t\t\tif (value >= 0xD800 && value <= 0xDBFF && counter < length) {\n\t\t\t\t// high surrogate, and there is a next character\n\t\t\t\textra = string.charCodeAt(counter++);\n\t\t\t\tif ((extra & 0xFC00) == 0xDC00) { // low surrogate\n\t\t\t\t\toutput.push(((value & 0x3FF) << 10) + (extra & 0x3FF) + 0x10000);\n\t\t\t\t} else {\n\t\t\t\t\t// unmatched surrogate; only append this code unit, in case the next\n\t\t\t\t\t// code unit is the high surrogate of a surrogate pair\n\t\t\t\t\toutput.push(value);\n\t\t\t\t\tcounter--;\n\t\t\t\t}\n\t\t\t} else {\n\t\t\t\toutput.push(value);\n\t\t\t}\n\t\t}\n\t\treturn output;\n\t}\n\n\t/**\n\t * Creates a string based on an array of numeric code points.\n\t * @see `punycode.ucs2.decode`\n\t * @memberOf punycode.ucs2\n\t * @name encode\n\t * @param {Array} codePoints The array of numeric code points.\n\t * @returns {String} The new Unicode string (UCS-2).\n\t */\n\tfunction ucs2encode(array) {\n\t\treturn map(array, function(value) {\n\t\t\tvar output = '';\n\t\t\tif (value > 0xFFFF) {\n\t\t\t\tvalue -= 0x10000;\n\t\t\t\toutput += stringFromCharCode(value >>> 10 & 0x3FF | 0xD800);\n\t\t\t\tvalue = 0xDC00 | value & 0x3FF;\n\t\t\t}\n\t\t\toutput += stringFromCharCode(value);\n\t\t\treturn output;\n\t\t}).join('');\n\t}\n\n\t/**\n\t * Converts a basic code point into a digit/integer.\n\t * @see `digitToBasic()`\n\t * @private\n\t * @param {Number} codePoint The basic numeric code point value.\n\t * @returns {Number} The numeric value of a basic code point (for use in\n\t * representing integers) in the range `0` to `base - 1`, or `base` if\n\t * the code point does not represent a value.\n\t */\n\tfunction basicToDigit(codePoint) {\n\t\tif (codePoint - 48 < 10) {\n\t\t\treturn codePoint - 22;\n\t\t}\n\t\tif (codePoint - 65 < 26) {\n\t\t\treturn codePoint - 65;\n\t\t}\n\t\tif (codePoint - 97 < 26) {\n\t\t\treturn codePoint - 97;\n\t\t}\n\t\treturn base;\n\t}\n\n\t/**\n\t * Converts a digit/integer into a basic code point.\n\t * @see `basicToDigit()`\n\t * @private\n\t * @param {Number} digit The numeric value of a basic code point.\n\t * @returns {Number} The basic code point whose value (when used for\n\t * representing integers) is `digit`, which needs to be in the range\n\t * `0` to `base - 1`. If `flag` is non-zero, the uppercase form is\n\t * used; else, the lowercase form is used. The behavior is undefined\n\t * if `flag` is non-zero and `digit` has no uppercase form.\n\t */\n\tfunction digitToBasic(digit, flag) {\n\t\t// 0..25 map to ASCII a..z or A..Z\n\t\t// 26..35 map to ASCII 0..9\n\t\treturn digit + 22 + 75 * (digit < 26) - ((flag != 0) << 5);\n\t}\n\n\t/**\n\t * Bias adaptation function as per section 3.4 of RFC 3492.\n\t * http://tools.ietf.org/html/rfc3492#section-3.4\n\t * @private\n\t */\n\tfunction adapt(delta, numPoints, firstTime) {\n\t\tvar k = 0;\n\t\tdelta = firstTime ? floor(delta / damp) : delta >> 1;\n\t\tdelta += floor(delta / numPoints);\n\t\tfor (/* no initialization */; delta > baseMinusTMin * tMax >> 1; k += base) {\n\t\t\tdelta = floor(delta / baseMinusTMin);\n\t\t}\n\t\treturn floor(k + (baseMinusTMin + 1) * delta / (delta + skew));\n\t}\n\n\t/**\n\t * Converts a Punycode string of ASCII-only symbols to a string of Unicode\n\t * symbols.\n\t * @memberOf punycode\n\t * @param {String} input The Punycode string of ASCII-only symbols.\n\t * @returns {String} The resulting string of Unicode symbols.\n\t */\n\tfunction decode(input) {\n\t\t// Don't use UCS-2\n\t\tvar output = [],\n\t\t inputLength = input.length,\n\t\t out,\n\t\t i = 0,\n\t\t n = initialN,\n\t\t bias = initialBias,\n\t\t basic,\n\t\t j,\n\t\t index,\n\t\t oldi,\n\t\t w,\n\t\t k,\n\t\t digit,\n\t\t t,\n\t\t /** Cached calculation results */\n\t\t baseMinusT;\n\n\t\t// Handle the basic code points: let `basic` be the number of input code\n\t\t// points before the last delimiter, or `0` if there is none, then copy\n\t\t// the first basic code points to the output.\n\n\t\tbasic = input.lastIndexOf(delimiter);\n\t\tif (basic < 0) {\n\t\t\tbasic = 0;\n\t\t}\n\n\t\tfor (j = 0; j < basic; ++j) {\n\t\t\t// if it's not a basic code point\n\t\t\tif (input.charCodeAt(j) >= 0x80) {\n\t\t\t\terror('not-basic');\n\t\t\t}\n\t\t\toutput.push(input.charCodeAt(j));\n\t\t}\n\n\t\t// Main decoding loop: start just after the last delimiter if any basic code\n\t\t// points were copied; start at the beginning otherwise.\n\n\t\tfor (index = basic > 0 ? basic + 1 : 0; index < inputLength; /* no final expression */) {\n\n\t\t\t// `index` is the index of the next character to be consumed.\n\t\t\t// Decode a generalized variable-length integer into `delta`,\n\t\t\t// which gets added to `i`. The overflow checking is easier\n\t\t\t// if we increase `i` as we go, then subtract off its starting\n\t\t\t// value at the end to obtain `delta`.\n\t\t\tfor (oldi = i, w = 1, k = base; /* no condition */; k += base) {\n\n\t\t\t\tif (index >= inputLength) {\n\t\t\t\t\terror('invalid-input');\n\t\t\t\t}\n\n\t\t\t\tdigit = basicToDigit(input.charCodeAt(index++));\n\n\t\t\t\tif (digit >= base || digit > floor((maxInt - i) / w)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\ti += digit * w;\n\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\n\t\t\t\tif (digit < t) {\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\n\t\t\t\tbaseMinusT = base - t;\n\t\t\t\tif (w > floor(maxInt / baseMinusT)) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tw *= baseMinusT;\n\n\t\t\t}\n\n\t\t\tout = output.length + 1;\n\t\t\tbias = adapt(i - oldi, out, oldi == 0);\n\n\t\t\t// `i` was supposed to wrap around from `out` to `0`,\n\t\t\t// incrementing `n` each time, so we'll fix that now:\n\t\t\tif (floor(i / out) > maxInt - n) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tn += floor(i / out);\n\t\t\ti %= out;\n\n\t\t\t// Insert `n` at position `i` of the output\n\t\t\toutput.splice(i++, 0, n);\n\n\t\t}\n\n\t\treturn ucs2encode(output);\n\t}\n\n\t/**\n\t * Converts a string of Unicode symbols (e.g. a domain name label) to a\n\t * Punycode string of ASCII-only symbols.\n\t * @memberOf punycode\n\t * @param {String} input The string of Unicode symbols.\n\t * @returns {String} The resulting Punycode string of ASCII-only symbols.\n\t */\n\tfunction encode(input) {\n\t\tvar n,\n\t\t delta,\n\t\t handledCPCount,\n\t\t basicLength,\n\t\t bias,\n\t\t j,\n\t\t m,\n\t\t q,\n\t\t k,\n\t\t t,\n\t\t currentValue,\n\t\t output = [],\n\t\t /** `inputLength` will hold the number of code points in `input`. */\n\t\t inputLength,\n\t\t /** Cached calculation results */\n\t\t handledCPCountPlusOne,\n\t\t baseMinusT,\n\t\t qMinusT;\n\n\t\t// Convert the input in UCS-2 to Unicode\n\t\tinput = ucs2decode(input);\n\n\t\t// Cache the length\n\t\tinputLength = input.length;\n\n\t\t// Initialize the state\n\t\tn = initialN;\n\t\tdelta = 0;\n\t\tbias = initialBias;\n\n\t\t// Handle the basic code points\n\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\tcurrentValue = input[j];\n\t\t\tif (currentValue < 0x80) {\n\t\t\t\toutput.push(stringFromCharCode(currentValue));\n\t\t\t}\n\t\t}\n\n\t\thandledCPCount = basicLength = output.length;\n\n\t\t// `handledCPCount` is the number of code points that have been handled;\n\t\t// `basicLength` is the number of basic code points.\n\n\t\t// Finish the basic string - if it is not empty - with a delimiter\n\t\tif (basicLength) {\n\t\t\toutput.push(delimiter);\n\t\t}\n\n\t\t// Main encoding loop:\n\t\twhile (handledCPCount < inputLength) {\n\n\t\t\t// All non-basic code points < n have been handled already. Find the next\n\t\t\t// larger one:\n\t\t\tfor (m = maxInt, j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\t\t\t\tif (currentValue >= n && currentValue < m) {\n\t\t\t\t\tm = currentValue;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t// Increase `delta` enough to advance the decoder's state to ,\n\t\t\t// but guard against overflow\n\t\t\thandledCPCountPlusOne = handledCPCount + 1;\n\t\t\tif (m - n > floor((maxInt - delta) / handledCPCountPlusOne)) {\n\t\t\t\terror('overflow');\n\t\t\t}\n\n\t\t\tdelta += (m - n) * handledCPCountPlusOne;\n\t\t\tn = m;\n\n\t\t\tfor (j = 0; j < inputLength; ++j) {\n\t\t\t\tcurrentValue = input[j];\n\n\t\t\t\tif (currentValue < n && ++delta > maxInt) {\n\t\t\t\t\terror('overflow');\n\t\t\t\t}\n\n\t\t\t\tif (currentValue == n) {\n\t\t\t\t\t// Represent delta as a generalized variable-length integer\n\t\t\t\t\tfor (q = delta, k = base; /* no condition */; k += base) {\n\t\t\t\t\t\tt = k <= bias ? tMin : (k >= bias + tMax ? tMax : k - bias);\n\t\t\t\t\t\tif (q < t) {\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t\tqMinusT = q - t;\n\t\t\t\t\t\tbaseMinusT = base - t;\n\t\t\t\t\t\toutput.push(\n\t\t\t\t\t\t\tstringFromCharCode(digitToBasic(t + qMinusT % baseMinusT, 0))\n\t\t\t\t\t\t);\n\t\t\t\t\t\tq = floor(qMinusT / baseMinusT);\n\t\t\t\t\t}\n\n\t\t\t\t\toutput.push(stringFromCharCode(digitToBasic(q, 0)));\n\t\t\t\t\tbias = adapt(delta, handledCPCountPlusOne, handledCPCount == basicLength);\n\t\t\t\t\tdelta = 0;\n\t\t\t\t\t++handledCPCount;\n\t\t\t\t}\n\t\t\t}\n\n\t\t\t++delta;\n\t\t\t++n;\n\n\t\t}\n\t\treturn output.join('');\n\t}\n\n\t/**\n\t * Converts a Punycode string representing a domain name or an email address\n\t * to Unicode. Only the Punycoded parts of the input will be converted, i.e.\n\t * it doesn't matter if you call it on a string that has already been\n\t * converted to Unicode.\n\t * @memberOf punycode\n\t * @param {String} input The Punycoded domain name or email address to\n\t * convert to Unicode.\n\t * @returns {String} The Unicode representation of the given Punycode\n\t * string.\n\t */\n\tfunction toUnicode(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexPunycode.test(string)\n\t\t\t\t? decode(string.slice(4).toLowerCase())\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/**\n\t * Converts a Unicode string representing a domain name or an email address to\n\t * Punycode. Only the non-ASCII parts of the domain name will be converted,\n\t * i.e. it doesn't matter if you call it with a domain that's already in\n\t * ASCII.\n\t * @memberOf punycode\n\t * @param {String} input The domain name or email address to convert, as a\n\t * Unicode string.\n\t * @returns {String} The Punycode representation of the given domain name or\n\t * email address.\n\t */\n\tfunction toASCII(input) {\n\t\treturn mapDomain(input, function(string) {\n\t\t\treturn regexNonASCII.test(string)\n\t\t\t\t? 'xn--' + encode(string)\n\t\t\t\t: string;\n\t\t});\n\t}\n\n\t/*--------------------------------------------------------------------------*/\n\n\t/** Define the public API */\n\tpunycode = {\n\t\t/**\n\t\t * A string representing the current Punycode.js version number.\n\t\t * @memberOf punycode\n\t\t * @type String\n\t\t */\n\t\t'version': '1.3.2',\n\t\t/**\n\t\t * An object of methods to convert from JavaScript's internal character\n\t\t * representation (UCS-2) to Unicode code points, and back.\n\t\t * @see \n\t\t * @memberOf punycode\n\t\t * @type Object\n\t\t */\n\t\t'ucs2': {\n\t\t\t'decode': ucs2decode,\n\t\t\t'encode': ucs2encode\n\t\t},\n\t\t'decode': decode,\n\t\t'encode': encode,\n\t\t'toASCII': toASCII,\n\t\t'toUnicode': toUnicode\n\t};\n\n\t/** Expose `punycode` */\n\t// Some AMD build optimizers, like r.js, check for specific condition patterns\n\t// like the following:\n\tif (\n\t\ttypeof define == 'function' &&\n\t\ttypeof define.amd == 'object' &&\n\t\tdefine.amd\n\t) {\n\t\tdefine('punycode', function() {\n\t\t\treturn punycode;\n\t\t});\n\t} else if (freeExports && freeModule) {\n\t\tif (module.exports == freeExports) { // in Node.js or RingoJS v0.8.0+\n\t\t\tfreeModule.exports = punycode;\n\t\t} else { // in Narwhal or RingoJS v0.7.0-\n\t\t\tfor (key in punycode) {\n\t\t\t\tpunycode.hasOwnProperty(key) && (freeExports[key] = punycode[key]);\n\t\t\t}\n\t\t}\n\t} else { // in Rhino or a web browser\n\t\troot.punycode = punycode;\n\t}\n\n}(this));\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\n'use strict';\n\nvar punycode = require('punycode');\nvar util = require('./util');\n\nexports.parse = urlParse;\nexports.resolve = urlResolve;\nexports.resolveObject = urlResolveObject;\nexports.format = urlFormat;\n\nexports.Url = Url;\n\nfunction Url() {\n this.protocol = null;\n this.slashes = null;\n this.auth = null;\n this.host = null;\n this.port = null;\n this.hostname = null;\n this.hash = null;\n this.search = null;\n this.query = null;\n this.pathname = null;\n this.path = null;\n this.href = null;\n}\n\n// Reference: RFC 3986, RFC 1808, RFC 2396\n\n// define these here so at least they only have to be\n// compiled once on the first module load.\nvar protocolPattern = /^([a-z0-9.+-]+:)/i,\n portPattern = /:[0-9]*$/,\n\n // Special case for a simple path URL\n simplePathPattern = /^(\\/\\/?(?!\\/)[^\\?\\s]*)(\\?[^\\s]*)?$/,\n\n // RFC 2396: characters reserved for delimiting URLs.\n // We actually just auto-escape these.\n delims = ['<', '>', '\"', '`', ' ', '\\r', '\\n', '\\t'],\n\n // RFC 2396: characters not allowed for various reasons.\n unwise = ['{', '}', '|', '\\\\', '^', '`'].concat(delims),\n\n // Allowed by RFCs, but cause of XSS attacks. Always escape these.\n autoEscape = ['\\''].concat(unwise),\n // Characters that are never ever allowed in a hostname.\n // Note that any invalid chars are also handled, but these\n // are the ones that are *expected* to be seen, so we fast-path\n // them.\n nonHostChars = ['%', '/', '?', ';', '#'].concat(autoEscape),\n hostEndingChars = ['/', '?', '#'],\n hostnameMaxLen = 255,\n hostnamePartPattern = /^[+a-z0-9A-Z_-]{0,63}$/,\n hostnamePartStart = /^([+a-z0-9A-Z_-]{0,63})(.*)$/,\n // protocols that can allow \"unsafe\" and \"unwise\" chars.\n unsafeProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that never have a hostname.\n hostlessProtocol = {\n 'javascript': true,\n 'javascript:': true\n },\n // protocols that always contain a // bit.\n slashedProtocol = {\n 'http': true,\n 'https': true,\n 'ftp': true,\n 'gopher': true,\n 'file': true,\n 'http:': true,\n 'https:': true,\n 'ftp:': true,\n 'gopher:': true,\n 'file:': true\n },\n querystring = require('querystring');\n\nfunction urlParse(url, parseQueryString, slashesDenoteHost) {\n if (url && util.isObject(url) && url instanceof Url) return url;\n\n var u = new Url;\n u.parse(url, parseQueryString, slashesDenoteHost);\n return u;\n}\n\nUrl.prototype.parse = function(url, parseQueryString, slashesDenoteHost) {\n if (!util.isString(url)) {\n throw new TypeError(\"Parameter 'url' must be a string, not \" + typeof url);\n }\n\n // Copy chrome, IE, opera backslash-handling behavior.\n // Back slashes before the query string get converted to forward slashes\n // See: https://code.google.com/p/chromium/issues/detail?id=25916\n var queryIndex = url.indexOf('?'),\n splitter =\n (queryIndex !== -1 && queryIndex < url.indexOf('#')) ? '?' : '#',\n uSplit = url.split(splitter),\n slashRegex = /\\\\/g;\n uSplit[0] = uSplit[0].replace(slashRegex, '/');\n url = uSplit.join(splitter);\n\n var rest = url;\n\n // trim before proceeding.\n // This is to support parse stuff like \" http://foo.com \\n\"\n rest = rest.trim();\n\n if (!slashesDenoteHost && url.split('#').length === 1) {\n // Try fast path regexp\n var simplePath = simplePathPattern.exec(rest);\n if (simplePath) {\n this.path = rest;\n this.href = rest;\n this.pathname = simplePath[1];\n if (simplePath[2]) {\n this.search = simplePath[2];\n if (parseQueryString) {\n this.query = querystring.parse(this.search.substr(1));\n } else {\n this.query = this.search.substr(1);\n }\n } else if (parseQueryString) {\n this.search = '';\n this.query = {};\n }\n return this;\n }\n }\n\n var proto = protocolPattern.exec(rest);\n if (proto) {\n proto = proto[0];\n var lowerProto = proto.toLowerCase();\n this.protocol = lowerProto;\n rest = rest.substr(proto.length);\n }\n\n // figure out if it's got a host\n // user@server is *always* interpreted as a hostname, and url\n // resolution will treat //foo/bar as host=foo,path=bar because that's\n // how the browser resolves relative URLs.\n if (slashesDenoteHost || proto || rest.match(/^\\/\\/[^@\\/]+@[^@\\/]+/)) {\n var slashes = rest.substr(0, 2) === '//';\n if (slashes && !(proto && hostlessProtocol[proto])) {\n rest = rest.substr(2);\n this.slashes = true;\n }\n }\n\n if (!hostlessProtocol[proto] &&\n (slashes || (proto && !slashedProtocol[proto]))) {\n\n // there's a hostname.\n // the first instance of /, ?, ;, or # ends the host.\n //\n // If there is an @ in the hostname, then non-host chars *are* allowed\n // to the left of the last @ sign, unless some host-ending character\n // comes *before* the @-sign.\n // URLs are obnoxious.\n //\n // ex:\n // http://a@b@c/ => user:a@b host:c\n // http://a@b?@c => user:a host:c path:/?@c\n\n // v0.12 TODO(isaacs): This is not quite how Chrome does things.\n // Review our test case against browsers more comprehensively.\n\n // find the first instance of any hostEndingChars\n var hostEnd = -1;\n for (var i = 0; i < hostEndingChars.length; i++) {\n var hec = rest.indexOf(hostEndingChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n\n // at this point, either we have an explicit point where the\n // auth portion cannot go past, or the last @ char is the decider.\n var auth, atSign;\n if (hostEnd === -1) {\n // atSign can be anywhere.\n atSign = rest.lastIndexOf('@');\n } else {\n // atSign must be in auth portion.\n // http://a@b/c@d => host:b auth:a path:/c@d\n atSign = rest.lastIndexOf('@', hostEnd);\n }\n\n // Now we have a portion which is definitely the auth.\n // Pull that off.\n if (atSign !== -1) {\n auth = rest.slice(0, atSign);\n rest = rest.slice(atSign + 1);\n this.auth = decodeURIComponent(auth);\n }\n\n // the host is the remaining to the left of the first non-host char\n hostEnd = -1;\n for (var i = 0; i < nonHostChars.length; i++) {\n var hec = rest.indexOf(nonHostChars[i]);\n if (hec !== -1 && (hostEnd === -1 || hec < hostEnd))\n hostEnd = hec;\n }\n // if we still have not hit it, then the entire thing is a host.\n if (hostEnd === -1)\n hostEnd = rest.length;\n\n this.host = rest.slice(0, hostEnd);\n rest = rest.slice(hostEnd);\n\n // pull out port.\n this.parseHost();\n\n // we've indicated that there is a hostname,\n // so even if it's empty, it has to be present.\n this.hostname = this.hostname || '';\n\n // if hostname begins with [ and ends with ]\n // assume that it's an IPv6 address.\n var ipv6Hostname = this.hostname[0] === '[' &&\n this.hostname[this.hostname.length - 1] === ']';\n\n // validate a little.\n if (!ipv6Hostname) {\n var hostparts = this.hostname.split(/\\./);\n for (var i = 0, l = hostparts.length; i < l; i++) {\n var part = hostparts[i];\n if (!part) continue;\n if (!part.match(hostnamePartPattern)) {\n var newpart = '';\n for (var j = 0, k = part.length; j < k; j++) {\n if (part.charCodeAt(j) > 127) {\n // we replace non-ASCII char with a temporary placeholder\n // we need this to make sure size of hostname is not\n // broken by replacing non-ASCII by nothing\n newpart += 'x';\n } else {\n newpart += part[j];\n }\n }\n // we test again with ASCII char only\n if (!newpart.match(hostnamePartPattern)) {\n var validParts = hostparts.slice(0, i);\n var notHost = hostparts.slice(i + 1);\n var bit = part.match(hostnamePartStart);\n if (bit) {\n validParts.push(bit[1]);\n notHost.unshift(bit[2]);\n }\n if (notHost.length) {\n rest = '/' + notHost.join('.') + rest;\n }\n this.hostname = validParts.join('.');\n break;\n }\n }\n }\n }\n\n if (this.hostname.length > hostnameMaxLen) {\n this.hostname = '';\n } else {\n // hostnames are always lower case.\n this.hostname = this.hostname.toLowerCase();\n }\n\n if (!ipv6Hostname) {\n // IDNA Support: Returns a punycoded representation of \"domain\".\n // It only converts parts of the domain name that\n // have non-ASCII characters, i.e. it doesn't matter if\n // you call it with a domain that already is ASCII-only.\n this.hostname = punycode.toASCII(this.hostname);\n }\n\n var p = this.port ? ':' + this.port : '';\n var h = this.hostname || '';\n this.host = h + p;\n this.href += this.host;\n\n // strip [ and ] from the hostname\n // the host field still retains them, though\n if (ipv6Hostname) {\n this.hostname = this.hostname.substr(1, this.hostname.length - 2);\n if (rest[0] !== '/') {\n rest = '/' + rest;\n }\n }\n }\n\n // now rest is set to the post-host stuff.\n // chop off any delim chars.\n if (!unsafeProtocol[lowerProto]) {\n\n // First, make 100% sure that any \"autoEscape\" chars get\n // escaped, even if encodeURIComponent doesn't think they\n // need to be.\n for (var i = 0, l = autoEscape.length; i < l; i++) {\n var ae = autoEscape[i];\n if (rest.indexOf(ae) === -1)\n continue;\n var esc = encodeURIComponent(ae);\n if (esc === ae) {\n esc = escape(ae);\n }\n rest = rest.split(ae).join(esc);\n }\n }\n\n\n // chop off from the tail first.\n var hash = rest.indexOf('#');\n if (hash !== -1) {\n // got a fragment string.\n this.hash = rest.substr(hash);\n rest = rest.slice(0, hash);\n }\n var qm = rest.indexOf('?');\n if (qm !== -1) {\n this.search = rest.substr(qm);\n this.query = rest.substr(qm + 1);\n if (parseQueryString) {\n this.query = querystring.parse(this.query);\n }\n rest = rest.slice(0, qm);\n } else if (parseQueryString) {\n // no query string, but parseQueryString still requested\n this.search = '';\n this.query = {};\n }\n if (rest) this.pathname = rest;\n if (slashedProtocol[lowerProto] &&\n this.hostname && !this.pathname) {\n this.pathname = '/';\n }\n\n //to support http.request\n if (this.pathname || this.search) {\n var p = this.pathname || '';\n var s = this.search || '';\n this.path = p + s;\n }\n\n // finally, reconstruct the href based on what has been validated.\n this.href = this.format();\n return this;\n};\n\n// format a parsed object into a url string\nfunction urlFormat(obj) {\n // ensure it's an object, and not a string url.\n // If it's an obj, this is a no-op.\n // this way, you can call url_format() on strings\n // to clean up potentially wonky urls.\n if (util.isString(obj)) obj = urlParse(obj);\n if (!(obj instanceof Url)) return Url.prototype.format.call(obj);\n return obj.format();\n}\n\nUrl.prototype.format = function() {\n var auth = this.auth || '';\n if (auth) {\n auth = encodeURIComponent(auth);\n auth = auth.replace(/%3A/i, ':');\n auth += '@';\n }\n\n var protocol = this.protocol || '',\n pathname = this.pathname || '',\n hash = this.hash || '',\n host = false,\n query = '';\n\n if (this.host) {\n host = auth + this.host;\n } else if (this.hostname) {\n host = auth + (this.hostname.indexOf(':') === -1 ?\n this.hostname :\n '[' + this.hostname + ']');\n if (this.port) {\n host += ':' + this.port;\n }\n }\n\n if (this.query &&\n util.isObject(this.query) &&\n Object.keys(this.query).length) {\n query = querystring.stringify(this.query);\n }\n\n var search = this.search || (query && ('?' + query)) || '';\n\n if (protocol && protocol.substr(-1) !== ':') protocol += ':';\n\n // only the slashedProtocols get the //. Not mailto:, xmpp:, etc.\n // unless they had them to begin with.\n if (this.slashes ||\n (!protocol || slashedProtocol[protocol]) && host !== false) {\n host = '//' + (host || '');\n if (pathname && pathname.charAt(0) !== '/') pathname = '/' + pathname;\n } else if (!host) {\n host = '';\n }\n\n if (hash && hash.charAt(0) !== '#') hash = '#' + hash;\n if (search && search.charAt(0) !== '?') search = '?' + search;\n\n pathname = pathname.replace(/[?#]/g, function(match) {\n return encodeURIComponent(match);\n });\n search = search.replace('#', '%23');\n\n return protocol + host + pathname + search + hash;\n};\n\nfunction urlResolve(source, relative) {\n return urlParse(source, false, true).resolve(relative);\n}\n\nUrl.prototype.resolve = function(relative) {\n return this.resolveObject(urlParse(relative, false, true)).format();\n};\n\nfunction urlResolveObject(source, relative) {\n if (!source) return relative;\n return urlParse(source, false, true).resolveObject(relative);\n}\n\nUrl.prototype.resolveObject = function(relative) {\n if (util.isString(relative)) {\n var rel = new Url();\n rel.parse(relative, false, true);\n relative = rel;\n }\n\n var result = new Url();\n var tkeys = Object.keys(this);\n for (var tk = 0; tk < tkeys.length; tk++) {\n var tkey = tkeys[tk];\n result[tkey] = this[tkey];\n }\n\n // hash is always overridden, no matter what.\n // even href=\"\" will remove it.\n result.hash = relative.hash;\n\n // if the relative url is empty, then there's nothing left to do here.\n if (relative.href === '') {\n result.href = result.format();\n return result;\n }\n\n // hrefs like //foo/bar always cut to the protocol.\n if (relative.slashes && !relative.protocol) {\n // take everything except the protocol from relative\n var rkeys = Object.keys(relative);\n for (var rk = 0; rk < rkeys.length; rk++) {\n var rkey = rkeys[rk];\n if (rkey !== 'protocol')\n result[rkey] = relative[rkey];\n }\n\n //urlParse appends trailing / to urls like http://www.example.com\n if (slashedProtocol[result.protocol] &&\n result.hostname && !result.pathname) {\n result.path = result.pathname = '/';\n }\n\n result.href = result.format();\n return result;\n }\n\n if (relative.protocol && relative.protocol !== result.protocol) {\n // if it's a known url protocol, then changing\n // the protocol does weird things\n // first, if it's not file:, then we MUST have a host,\n // and if there was a path\n // to begin with, then we MUST have a path.\n // if it is file:, then the host is dropped,\n // because that's known to be hostless.\n // anything else is assumed to be absolute.\n if (!slashedProtocol[relative.protocol]) {\n var keys = Object.keys(relative);\n for (var v = 0; v < keys.length; v++) {\n var k = keys[v];\n result[k] = relative[k];\n }\n result.href = result.format();\n return result;\n }\n\n result.protocol = relative.protocol;\n if (!relative.host && !hostlessProtocol[relative.protocol]) {\n var relPath = (relative.pathname || '').split('/');\n while (relPath.length && !(relative.host = relPath.shift()));\n if (!relative.host) relative.host = '';\n if (!relative.hostname) relative.hostname = '';\n if (relPath[0] !== '') relPath.unshift('');\n if (relPath.length < 2) relPath.unshift('');\n result.pathname = relPath.join('/');\n } else {\n result.pathname = relative.pathname;\n }\n result.search = relative.search;\n result.query = relative.query;\n result.host = relative.host || '';\n result.auth = relative.auth;\n result.hostname = relative.hostname || relative.host;\n result.port = relative.port;\n // to support http.request\n if (result.pathname || result.search) {\n var p = result.pathname || '';\n var s = result.search || '';\n result.path = p + s;\n }\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n }\n\n var isSourceAbs = (result.pathname && result.pathname.charAt(0) === '/'),\n isRelAbs = (\n relative.host ||\n relative.pathname && relative.pathname.charAt(0) === '/'\n ),\n mustEndAbs = (isRelAbs || isSourceAbs ||\n (result.host && relative.pathname)),\n removeAllDots = mustEndAbs,\n srcPath = result.pathname && result.pathname.split('/') || [],\n relPath = relative.pathname && relative.pathname.split('/') || [],\n psychotic = result.protocol && !slashedProtocol[result.protocol];\n\n // if the url is a non-slashed url, then relative\n // links like ../.. should be able\n // to crawl up to the hostname, as well. This is strange.\n // result.protocol has already been set by now.\n // Later on, put the first path part into the host field.\n if (psychotic) {\n result.hostname = '';\n result.port = null;\n if (result.host) {\n if (srcPath[0] === '') srcPath[0] = result.host;\n else srcPath.unshift(result.host);\n }\n result.host = '';\n if (relative.protocol) {\n relative.hostname = null;\n relative.port = null;\n if (relative.host) {\n if (relPath[0] === '') relPath[0] = relative.host;\n else relPath.unshift(relative.host);\n }\n relative.host = null;\n }\n mustEndAbs = mustEndAbs && (relPath[0] === '' || srcPath[0] === '');\n }\n\n if (isRelAbs) {\n // it's absolute.\n result.host = (relative.host || relative.host === '') ?\n relative.host : result.host;\n result.hostname = (relative.hostname || relative.hostname === '') ?\n relative.hostname : result.hostname;\n result.search = relative.search;\n result.query = relative.query;\n srcPath = relPath;\n // fall through to the dot-handling below.\n } else if (relPath.length) {\n // it's relative\n // throw away the existing file, and take the new path instead.\n if (!srcPath) srcPath = [];\n srcPath.pop();\n srcPath = srcPath.concat(relPath);\n result.search = relative.search;\n result.query = relative.query;\n } else if (!util.isNullOrUndefined(relative.search)) {\n // just pull out the search.\n // like href='?foo'.\n // Put this after the other two cases because it simplifies the booleans\n if (psychotic) {\n result.hostname = result.host = srcPath.shift();\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n result.search = relative.search;\n result.query = relative.query;\n //to support http.request\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.href = result.format();\n return result;\n }\n\n if (!srcPath.length) {\n // no path at all. easy.\n // we've already handled the other stuff above.\n result.pathname = null;\n //to support http.request\n if (result.search) {\n result.path = '/' + result.search;\n } else {\n result.path = null;\n }\n result.href = result.format();\n return result;\n }\n\n // if a url ENDs in . or .., then it must get a trailing slash.\n // however, if it ends in anything else non-slashy,\n // then it must NOT get a trailing slash.\n var last = srcPath.slice(-1)[0];\n var hasTrailingSlash = (\n (result.host || relative.host || srcPath.length > 1) &&\n (last === '.' || last === '..') || last === '');\n\n // strip single dots, resolve double dots to parent dir\n // if the path tries to go above the root, `up` ends up > 0\n var up = 0;\n for (var i = srcPath.length; i >= 0; i--) {\n last = srcPath[i];\n if (last === '.') {\n srcPath.splice(i, 1);\n } else if (last === '..') {\n srcPath.splice(i, 1);\n up++;\n } else if (up) {\n srcPath.splice(i, 1);\n up--;\n }\n }\n\n // if the path is allowed to go above the root, restore leading ..s\n if (!mustEndAbs && !removeAllDots) {\n for (; up--; up) {\n srcPath.unshift('..');\n }\n }\n\n if (mustEndAbs && srcPath[0] !== '' &&\n (!srcPath[0] || srcPath[0].charAt(0) !== '/')) {\n srcPath.unshift('');\n }\n\n if (hasTrailingSlash && (srcPath.join('/').substr(-1) !== '/')) {\n srcPath.push('');\n }\n\n var isAbsolute = srcPath[0] === '' ||\n (srcPath[0] && srcPath[0].charAt(0) === '/');\n\n // put the host back\n if (psychotic) {\n result.hostname = result.host = isAbsolute ? '' :\n srcPath.length ? srcPath.shift() : '';\n //occationaly the auth can get stuck only in host\n //this especially happens in cases like\n //url.resolveObject('mailto:local1@domain1', 'local2@domain2')\n var authInHost = result.host && result.host.indexOf('@') > 0 ?\n result.host.split('@') : false;\n if (authInHost) {\n result.auth = authInHost.shift();\n result.host = result.hostname = authInHost.shift();\n }\n }\n\n mustEndAbs = mustEndAbs || (result.host && srcPath.length);\n\n if (mustEndAbs && !isAbsolute) {\n srcPath.unshift('');\n }\n\n if (!srcPath.length) {\n result.pathname = null;\n result.path = null;\n } else {\n result.pathname = srcPath.join('/');\n }\n\n //to support request.http\n if (!util.isNull(result.pathname) || !util.isNull(result.search)) {\n result.path = (result.pathname ? result.pathname : '') +\n (result.search ? result.search : '');\n }\n result.auth = relative.auth || result.auth;\n result.slashes = result.slashes || relative.slashes;\n result.href = result.format();\n return result;\n};\n\nUrl.prototype.parseHost = function() {\n var host = this.host;\n var port = portPattern.exec(host);\n if (port) {\n port = port[0];\n if (port !== ':') {\n this.port = port.substr(1);\n }\n host = host.substr(0, host.length - port.length);\n }\n if (host) this.hostname = host;\n};\n","'use strict';\n\nmodule.exports = {\n isString: function(arg) {\n return typeof(arg) === 'string';\n },\n isObject: function(arg) {\n return typeof(arg) === 'object' && arg !== null;\n },\n isNull: function(arg) {\n return arg === null;\n },\n isNullOrUndefined: function(arg) {\n return arg == null;\n }\n};\n","/*! ut_metadata. MIT License. WebTorrent LLC */\nconst { EventEmitter } = require('events')\nconst bencode = require('bencode')\nconst BitField = require('bitfield').default\nconst debug = require('debug')('ut_metadata')\nconst sha1 = require('simple-sha1')\n\nconst MAX_METADATA_SIZE = 1E7 // 10 MB\nconst BITFIELD_GROW = 1E3\nconst PIECE_LENGTH = 1 << 14 // 16 KiB\n\nmodule.exports = metadata => {\n class utMetadata extends EventEmitter {\n constructor (wire) {\n super()\n\n this._wire = wire\n\n this._fetching = false\n this._metadataComplete = false\n this._metadataSize = null\n // how many reject messages to tolerate before quitting\n this._remainingRejects = null\n\n // The largest torrent file that I know of is ~1-2MB, which is ~100\n // pieces. Therefore, cap the bitfield to 10x that (1000 pieces) so a\n // malicious peer can't make it grow to fill all memory.\n this._bitfield = new BitField(0, { grow: BITFIELD_GROW })\n\n if (Buffer.isBuffer(metadata)) {\n this.setMetadata(metadata)\n }\n }\n\n onHandshake (infoHash, peerId, extensions) {\n this._infoHash = infoHash\n }\n\n onExtendedHandshake (handshake) {\n if (!handshake.m || !handshake.m.ut_metadata) {\n return this.emit('warning', new Error('Peer does not support ut_metadata'))\n }\n if (!handshake.metadata_size) {\n return this.emit('warning', new Error('Peer does not have metadata'))\n }\n if (typeof handshake.metadata_size !== 'number' ||\n MAX_METADATA_SIZE < handshake.metadata_size ||\n handshake.metadata_size <= 0) {\n return this.emit('warning', new Error('Peer gave invalid metadata size'))\n }\n\n this._metadataSize = handshake.metadata_size\n this._numPieces = Math.ceil(this._metadataSize / PIECE_LENGTH)\n this._remainingRejects = this._numPieces * 2\n\n this._requestPieces()\n }\n\n onMessage (buf) {\n let dict\n let trailer\n try {\n const str = buf.toString()\n const trailerIndex = str.indexOf('ee') + 2\n dict = bencode.decode(str.substring(0, trailerIndex))\n trailer = buf.slice(trailerIndex)\n } catch (err) {\n // drop invalid messages\n return\n }\n\n switch (dict.msg_type) {\n case 0:\n // ut_metadata request (from peer)\n // example: { 'msg_type': 0, 'piece': 0 }\n this._onRequest(dict.piece)\n break\n case 1:\n // ut_metadata data (in response to our request)\n // example: { 'msg_type': 1, 'piece': 0, 'total_size': 3425 }\n this._onData(dict.piece, trailer, dict.total_size)\n break\n case 2:\n // ut_metadata reject (peer doesn't have piece we requested)\n // { 'msg_type': 2, 'piece': 0 }\n this._onReject(dict.piece)\n break\n }\n }\n\n /**\n * Ask the peer to send metadata.\n * @public\n */\n fetch () {\n if (this._metadataComplete) {\n return\n }\n this._fetching = true\n if (this._metadataSize) {\n this._requestPieces()\n }\n }\n\n /**\n * Stop asking the peer to send metadata.\n * @public\n */\n cancel () {\n this._fetching = false\n }\n\n setMetadata (metadata) {\n if (this._metadataComplete) return true\n debug('set metadata')\n\n // if full torrent dictionary was passed in, pull out just `info` key\n try {\n const info = bencode.decode(metadata).info\n if (info) {\n metadata = bencode.encode(info)\n }\n } catch (err) {}\n\n // check hash\n if (this._infoHash && this._infoHash !== sha1.sync(metadata)) {\n return false\n }\n\n this.cancel()\n\n this.metadata = metadata\n this._metadataComplete = true\n this._metadataSize = this.metadata.length\n this._wire.extendedHandshake.metadata_size = this._metadataSize\n\n this.emit('metadata', bencode.encode({\n info: bencode.decode(this.metadata)\n }))\n\n return true\n }\n\n _send (dict, trailer) {\n let buf = bencode.encode(dict)\n if (Buffer.isBuffer(trailer)) {\n buf = Buffer.concat([buf, trailer])\n }\n this._wire.extended('ut_metadata', buf)\n }\n\n _request (piece) {\n this._send({ msg_type: 0, piece })\n }\n\n _data (piece, buf, totalSize) {\n const msg = { msg_type: 1, piece }\n if (typeof totalSize === 'number') {\n msg.total_size = totalSize\n }\n this._send(msg, buf)\n }\n\n _reject (piece) {\n this._send({ msg_type: 2, piece })\n }\n\n _onRequest (piece) {\n if (!this._metadataComplete) {\n this._reject(piece)\n return\n }\n const start = piece * PIECE_LENGTH\n let end = start + PIECE_LENGTH\n if (end > this._metadataSize) {\n end = this._metadataSize\n }\n const buf = this.metadata.slice(start, end)\n this._data(piece, buf, this._metadataSize)\n }\n\n _onData (piece, buf, totalSize) {\n if (buf.length > PIECE_LENGTH || !this._fetching) {\n return\n }\n buf.copy(this.metadata, piece * PIECE_LENGTH)\n this._bitfield.set(piece)\n this._checkDone()\n }\n\n _onReject (piece) {\n if (this._remainingRejects > 0 && this._fetching) {\n // If we haven't been rejected too much,\n // then try to request the piece again\n this._request(piece)\n this._remainingRejects -= 1\n } else {\n this.emit('warning', new Error('Peer sent \"reject\" too much'))\n }\n }\n\n _requestPieces () {\n if (!this._fetching) return\n this.metadata = Buffer.alloc(this._metadataSize)\n for (let piece = 0; piece < this._numPieces; piece++) {\n this._request(piece)\n }\n }\n\n _checkDone () {\n let done = true\n for (let piece = 0; piece < this._numPieces; piece++) {\n if (!this._bitfield.get(piece)) {\n done = false\n break\n }\n }\n if (!done) return\n\n // attempt to set metadata -- may fail sha1 check\n const success = this.setMetadata(this.metadata)\n\n if (!success) {\n this._failedMetadata()\n }\n }\n\n _failedMetadata () {\n // reset bitfield & try again\n this._bitfield = new BitField(0, { grow: BITFIELD_GROW })\n this._remainingRejects -= this._numPieces\n if (this._remainingRejects > 0) {\n this._requestPieces()\n } else {\n this.emit('warning', new Error('Peer sent invalid metadata'))\n }\n }\n }\n\n // Name of the bittorrent-protocol extension\n utMetadata.prototype.name = 'ut_metadata'\n\n return utMetadata\n}\n","\n/**\n * Module exports.\n */\n\nmodule.exports = deprecate;\n\n/**\n * Mark that a method should not be used.\n * Returns a modified function which warns once by default.\n *\n * If `localStorage.noDeprecation = true` is set, then it is a no-op.\n *\n * If `localStorage.throwDeprecation = true` is set, then deprecated functions\n * will throw an Error when invoked.\n *\n * If `localStorage.traceDeprecation = true` is set, then deprecated functions\n * will invoke `console.trace()` instead of `console.error()`.\n *\n * @param {Function} fn - the function to deprecate\n * @param {String} msg - the string to print to the console when `fn` is invoked\n * @returns {Function} a new \"deprecated\" version of `fn`\n * @api public\n */\n\nfunction deprecate (fn, msg) {\n if (config('noDeprecation')) {\n return fn;\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (config('throwDeprecation')) {\n throw new Error(msg);\n } else if (config('traceDeprecation')) {\n console.trace(msg);\n } else {\n console.warn(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n}\n\n/**\n * Checks `localStorage` for boolean values for the given `name`.\n *\n * @param {String} name\n * @returns {Boolean}\n * @api private\n */\n\nfunction config (name) {\n // accessing global.localStorage can trigger a DOMException in sandboxed iframes\n try {\n if (!global.localStorage) return false;\n } catch (_) {\n return false;\n }\n var val = global.localStorage[name];\n if (null == val) return false;\n return String(val).toLowerCase() === 'true';\n}\n","module.exports = function isBuffer(arg) {\n return arg && typeof arg === 'object'\n && typeof arg.copy === 'function'\n && typeof arg.fill === 'function'\n && typeof arg.readUInt8 === 'function';\n}","// Currently in sync with Node.js lib/internal/util/types.js\n// https://github.com/nodejs/node/commit/112cc7c27551254aa2b17098fb774867f05ed0d9\n\n'use strict';\n\nvar isArgumentsObject = require('is-arguments');\nvar isGeneratorFunction = require('is-generator-function');\nvar whichTypedArray = require('which-typed-array');\nvar isTypedArray = require('is-typed-array');\n\nfunction uncurryThis(f) {\n return f.call.bind(f);\n}\n\nvar BigIntSupported = typeof BigInt !== 'undefined';\nvar SymbolSupported = typeof Symbol !== 'undefined';\n\nvar ObjectToString = uncurryThis(Object.prototype.toString);\n\nvar numberValue = uncurryThis(Number.prototype.valueOf);\nvar stringValue = uncurryThis(String.prototype.valueOf);\nvar booleanValue = uncurryThis(Boolean.prototype.valueOf);\n\nif (BigIntSupported) {\n var bigIntValue = uncurryThis(BigInt.prototype.valueOf);\n}\n\nif (SymbolSupported) {\n var symbolValue = uncurryThis(Symbol.prototype.valueOf);\n}\n\nfunction checkBoxedPrimitive(value, prototypeValueOf) {\n if (typeof value !== 'object') {\n return false;\n }\n try {\n prototypeValueOf(value);\n return true;\n } catch(e) {\n return false;\n }\n}\n\nexports.isArgumentsObject = isArgumentsObject;\nexports.isGeneratorFunction = isGeneratorFunction;\nexports.isTypedArray = isTypedArray;\n\n// Taken from here and modified for better browser support\n// https://github.com/sindresorhus/p-is-promise/blob/cda35a513bda03f977ad5cde3a079d237e82d7ef/index.js\nfunction isPromise(input) {\n\treturn (\n\t\t(\n\t\t\ttypeof Promise !== 'undefined' &&\n\t\t\tinput instanceof Promise\n\t\t) ||\n\t\t(\n\t\t\tinput !== null &&\n\t\t\ttypeof input === 'object' &&\n\t\t\ttypeof input.then === 'function' &&\n\t\t\ttypeof input.catch === 'function'\n\t\t)\n\t);\n}\nexports.isPromise = isPromise;\n\nfunction isArrayBufferView(value) {\n if (typeof ArrayBuffer !== 'undefined' && ArrayBuffer.isView) {\n return ArrayBuffer.isView(value);\n }\n\n return (\n isTypedArray(value) ||\n isDataView(value)\n );\n}\nexports.isArrayBufferView = isArrayBufferView;\n\n\nfunction isUint8Array(value) {\n return whichTypedArray(value) === 'Uint8Array';\n}\nexports.isUint8Array = isUint8Array;\n\nfunction isUint8ClampedArray(value) {\n return whichTypedArray(value) === 'Uint8ClampedArray';\n}\nexports.isUint8ClampedArray = isUint8ClampedArray;\n\nfunction isUint16Array(value) {\n return whichTypedArray(value) === 'Uint16Array';\n}\nexports.isUint16Array = isUint16Array;\n\nfunction isUint32Array(value) {\n return whichTypedArray(value) === 'Uint32Array';\n}\nexports.isUint32Array = isUint32Array;\n\nfunction isInt8Array(value) {\n return whichTypedArray(value) === 'Int8Array';\n}\nexports.isInt8Array = isInt8Array;\n\nfunction isInt16Array(value) {\n return whichTypedArray(value) === 'Int16Array';\n}\nexports.isInt16Array = isInt16Array;\n\nfunction isInt32Array(value) {\n return whichTypedArray(value) === 'Int32Array';\n}\nexports.isInt32Array = isInt32Array;\n\nfunction isFloat32Array(value) {\n return whichTypedArray(value) === 'Float32Array';\n}\nexports.isFloat32Array = isFloat32Array;\n\nfunction isFloat64Array(value) {\n return whichTypedArray(value) === 'Float64Array';\n}\nexports.isFloat64Array = isFloat64Array;\n\nfunction isBigInt64Array(value) {\n return whichTypedArray(value) === 'BigInt64Array';\n}\nexports.isBigInt64Array = isBigInt64Array;\n\nfunction isBigUint64Array(value) {\n return whichTypedArray(value) === 'BigUint64Array';\n}\nexports.isBigUint64Array = isBigUint64Array;\n\nfunction isMapToString(value) {\n return ObjectToString(value) === '[object Map]';\n}\nisMapToString.working = (\n typeof Map !== 'undefined' &&\n isMapToString(new Map())\n);\n\nfunction isMap(value) {\n if (typeof Map === 'undefined') {\n return false;\n }\n\n return isMapToString.working\n ? isMapToString(value)\n : value instanceof Map;\n}\nexports.isMap = isMap;\n\nfunction isSetToString(value) {\n return ObjectToString(value) === '[object Set]';\n}\nisSetToString.working = (\n typeof Set !== 'undefined' &&\n isSetToString(new Set())\n);\nfunction isSet(value) {\n if (typeof Set === 'undefined') {\n return false;\n }\n\n return isSetToString.working\n ? isSetToString(value)\n : value instanceof Set;\n}\nexports.isSet = isSet;\n\nfunction isWeakMapToString(value) {\n return ObjectToString(value) === '[object WeakMap]';\n}\nisWeakMapToString.working = (\n typeof WeakMap !== 'undefined' &&\n isWeakMapToString(new WeakMap())\n);\nfunction isWeakMap(value) {\n if (typeof WeakMap === 'undefined') {\n return false;\n }\n\n return isWeakMapToString.working\n ? isWeakMapToString(value)\n : value instanceof WeakMap;\n}\nexports.isWeakMap = isWeakMap;\n\nfunction isWeakSetToString(value) {\n return ObjectToString(value) === '[object WeakSet]';\n}\nisWeakSetToString.working = (\n typeof WeakSet !== 'undefined' &&\n isWeakSetToString(new WeakSet())\n);\nfunction isWeakSet(value) {\n return isWeakSetToString(value);\n}\nexports.isWeakSet = isWeakSet;\n\nfunction isArrayBufferToString(value) {\n return ObjectToString(value) === '[object ArrayBuffer]';\n}\nisArrayBufferToString.working = (\n typeof ArrayBuffer !== 'undefined' &&\n isArrayBufferToString(new ArrayBuffer())\n);\nfunction isArrayBuffer(value) {\n if (typeof ArrayBuffer === 'undefined') {\n return false;\n }\n\n return isArrayBufferToString.working\n ? isArrayBufferToString(value)\n : value instanceof ArrayBuffer;\n}\nexports.isArrayBuffer = isArrayBuffer;\n\nfunction isDataViewToString(value) {\n return ObjectToString(value) === '[object DataView]';\n}\nisDataViewToString.working = (\n typeof ArrayBuffer !== 'undefined' &&\n typeof DataView !== 'undefined' &&\n isDataViewToString(new DataView(new ArrayBuffer(1), 0, 1))\n);\nfunction isDataView(value) {\n if (typeof DataView === 'undefined') {\n return false;\n }\n\n return isDataViewToString.working\n ? isDataViewToString(value)\n : value instanceof DataView;\n}\nexports.isDataView = isDataView;\n\n// Store a copy of SharedArrayBuffer in case it's deleted elsewhere\nvar SharedArrayBufferCopy = typeof SharedArrayBuffer !== 'undefined' ? SharedArrayBuffer : undefined;\nfunction isSharedArrayBufferToString(value) {\n return ObjectToString(value) === '[object SharedArrayBuffer]';\n}\nfunction isSharedArrayBuffer(value) {\n if (typeof SharedArrayBufferCopy === 'undefined') {\n return false;\n }\n\n if (typeof isSharedArrayBufferToString.working === 'undefined') {\n isSharedArrayBufferToString.working = isSharedArrayBufferToString(new SharedArrayBufferCopy());\n }\n\n return isSharedArrayBufferToString.working\n ? isSharedArrayBufferToString(value)\n : value instanceof SharedArrayBufferCopy;\n}\nexports.isSharedArrayBuffer = isSharedArrayBuffer;\n\nfunction isAsyncFunction(value) {\n return ObjectToString(value) === '[object AsyncFunction]';\n}\nexports.isAsyncFunction = isAsyncFunction;\n\nfunction isMapIterator(value) {\n return ObjectToString(value) === '[object Map Iterator]';\n}\nexports.isMapIterator = isMapIterator;\n\nfunction isSetIterator(value) {\n return ObjectToString(value) === '[object Set Iterator]';\n}\nexports.isSetIterator = isSetIterator;\n\nfunction isGeneratorObject(value) {\n return ObjectToString(value) === '[object Generator]';\n}\nexports.isGeneratorObject = isGeneratorObject;\n\nfunction isWebAssemblyCompiledModule(value) {\n return ObjectToString(value) === '[object WebAssembly.Module]';\n}\nexports.isWebAssemblyCompiledModule = isWebAssemblyCompiledModule;\n\nfunction isNumberObject(value) {\n return checkBoxedPrimitive(value, numberValue);\n}\nexports.isNumberObject = isNumberObject;\n\nfunction isStringObject(value) {\n return checkBoxedPrimitive(value, stringValue);\n}\nexports.isStringObject = isStringObject;\n\nfunction isBooleanObject(value) {\n return checkBoxedPrimitive(value, booleanValue);\n}\nexports.isBooleanObject = isBooleanObject;\n\nfunction isBigIntObject(value) {\n return BigIntSupported && checkBoxedPrimitive(value, bigIntValue);\n}\nexports.isBigIntObject = isBigIntObject;\n\nfunction isSymbolObject(value) {\n return SymbolSupported && checkBoxedPrimitive(value, symbolValue);\n}\nexports.isSymbolObject = isSymbolObject;\n\nfunction isBoxedPrimitive(value) {\n return (\n isNumberObject(value) ||\n isStringObject(value) ||\n isBooleanObject(value) ||\n isBigIntObject(value) ||\n isSymbolObject(value)\n );\n}\nexports.isBoxedPrimitive = isBoxedPrimitive;\n\nfunction isAnyArrayBuffer(value) {\n return typeof Uint8Array !== 'undefined' && (\n isArrayBuffer(value) ||\n isSharedArrayBuffer(value)\n );\n}\nexports.isAnyArrayBuffer = isAnyArrayBuffer;\n\n['isProxy', 'isExternal', 'isModuleNamespaceObject'].forEach(function(method) {\n Object.defineProperty(exports, method, {\n enumerable: false,\n value: function() {\n throw new Error(method + ' is not supported in userland');\n }\n });\n});\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\nvar getOwnPropertyDescriptors = Object.getOwnPropertyDescriptors ||\n function getOwnPropertyDescriptors(obj) {\n var keys = Object.keys(obj);\n var descriptors = {};\n for (var i = 0; i < keys.length; i++) {\n descriptors[keys[i]] = Object.getOwnPropertyDescriptor(obj, keys[i]);\n }\n return descriptors;\n };\n\nvar formatRegExp = /%[sdj%]/g;\nexports.format = function(f) {\n if (!isString(f)) {\n var objects = [];\n for (var i = 0; i < arguments.length; i++) {\n objects.push(inspect(arguments[i]));\n }\n return objects.join(' ');\n }\n\n var i = 1;\n var args = arguments;\n var len = args.length;\n var str = String(f).replace(formatRegExp, function(x) {\n if (x === '%%') return '%';\n if (i >= len) return x;\n switch (x) {\n case '%s': return String(args[i++]);\n case '%d': return Number(args[i++]);\n case '%j':\n try {\n return JSON.stringify(args[i++]);\n } catch (_) {\n return '[Circular]';\n }\n default:\n return x;\n }\n });\n for (var x = args[i]; i < len; x = args[++i]) {\n if (isNull(x) || !isObject(x)) {\n str += ' ' + x;\n } else {\n str += ' ' + inspect(x);\n }\n }\n return str;\n};\n\n\n// Mark that a method should not be used.\n// Returns a modified function which warns once by default.\n// If --no-deprecation is set, then it is a no-op.\nexports.deprecate = function(fn, msg) {\n if (typeof process !== 'undefined' && process.noDeprecation === true) {\n return fn;\n }\n\n // Allow for deprecating things in the process of starting up.\n if (typeof process === 'undefined') {\n return function() {\n return exports.deprecate(fn, msg).apply(this, arguments);\n };\n }\n\n var warned = false;\n function deprecated() {\n if (!warned) {\n if (process.throwDeprecation) {\n throw new Error(msg);\n } else if (process.traceDeprecation) {\n console.trace(msg);\n } else {\n console.error(msg);\n }\n warned = true;\n }\n return fn.apply(this, arguments);\n }\n\n return deprecated;\n};\n\n\nvar debugs = {};\nvar debugEnvRegex = /^$/;\n\nif (process.env.NODE_DEBUG) {\n var debugEnv = process.env.NODE_DEBUG;\n debugEnv = debugEnv.replace(/[|\\\\{}()[\\]^$+?.]/g, '\\\\$&')\n .replace(/\\*/g, '.*')\n .replace(/,/g, '$|^')\n .toUpperCase();\n debugEnvRegex = new RegExp('^' + debugEnv + '$', 'i');\n}\nexports.debuglog = function(set) {\n set = set.toUpperCase();\n if (!debugs[set]) {\n if (debugEnvRegex.test(set)) {\n var pid = process.pid;\n debugs[set] = function() {\n var msg = exports.format.apply(exports, arguments);\n console.error('%s %d: %s', set, pid, msg);\n };\n } else {\n debugs[set] = function() {};\n }\n }\n return debugs[set];\n};\n\n\n/**\n * Echos the value of a value. Trys to print the value out\n * in the best way possible given the different types.\n *\n * @param {Object} obj The object to print out.\n * @param {Object} opts Optional options object that alters the output.\n */\n/* legacy: obj, showHidden, depth, colors*/\nfunction inspect(obj, opts) {\n // default options\n var ctx = {\n seen: [],\n stylize: stylizeNoColor\n };\n // legacy...\n if (arguments.length >= 3) ctx.depth = arguments[2];\n if (arguments.length >= 4) ctx.colors = arguments[3];\n if (isBoolean(opts)) {\n // legacy...\n ctx.showHidden = opts;\n } else if (opts) {\n // got an \"options\" object\n exports._extend(ctx, opts);\n }\n // set default options\n if (isUndefined(ctx.showHidden)) ctx.showHidden = false;\n if (isUndefined(ctx.depth)) ctx.depth = 2;\n if (isUndefined(ctx.colors)) ctx.colors = false;\n if (isUndefined(ctx.customInspect)) ctx.customInspect = true;\n if (ctx.colors) ctx.stylize = stylizeWithColor;\n return formatValue(ctx, obj, ctx.depth);\n}\nexports.inspect = inspect;\n\n\n// http://en.wikipedia.org/wiki/ANSI_escape_code#graphics\ninspect.colors = {\n 'bold' : [1, 22],\n 'italic' : [3, 23],\n 'underline' : [4, 24],\n 'inverse' : [7, 27],\n 'white' : [37, 39],\n 'grey' : [90, 39],\n 'black' : [30, 39],\n 'blue' : [34, 39],\n 'cyan' : [36, 39],\n 'green' : [32, 39],\n 'magenta' : [35, 39],\n 'red' : [31, 39],\n 'yellow' : [33, 39]\n};\n\n// Don't use 'blue' not visible on cmd.exe\ninspect.styles = {\n 'special': 'cyan',\n 'number': 'yellow',\n 'boolean': 'yellow',\n 'undefined': 'grey',\n 'null': 'bold',\n 'string': 'green',\n 'date': 'magenta',\n // \"name\": intentionally not styling\n 'regexp': 'red'\n};\n\n\nfunction stylizeWithColor(str, styleType) {\n var style = inspect.styles[styleType];\n\n if (style) {\n return '\\u001b[' + inspect.colors[style][0] + 'm' + str +\n '\\u001b[' + inspect.colors[style][1] + 'm';\n } else {\n return str;\n }\n}\n\n\nfunction stylizeNoColor(str, styleType) {\n return str;\n}\n\n\nfunction arrayToHash(array) {\n var hash = {};\n\n array.forEach(function(val, idx) {\n hash[val] = true;\n });\n\n return hash;\n}\n\n\nfunction formatValue(ctx, value, recurseTimes) {\n // Provide a hook for user-specified inspect functions.\n // Check that value is an object with an inspect function on it\n if (ctx.customInspect &&\n value &&\n isFunction(value.inspect) &&\n // Filter out the util module, it's inspect function is special\n value.inspect !== exports.inspect &&\n // Also filter out any prototype objects using the circular check.\n !(value.constructor && value.constructor.prototype === value)) {\n var ret = value.inspect(recurseTimes, ctx);\n if (!isString(ret)) {\n ret = formatValue(ctx, ret, recurseTimes);\n }\n return ret;\n }\n\n // Primitive types cannot have properties\n var primitive = formatPrimitive(ctx, value);\n if (primitive) {\n return primitive;\n }\n\n // Look up the keys of the object.\n var keys = Object.keys(value);\n var visibleKeys = arrayToHash(keys);\n\n if (ctx.showHidden) {\n keys = Object.getOwnPropertyNames(value);\n }\n\n // IE doesn't make error fields non-enumerable\n // http://msdn.microsoft.com/en-us/library/ie/dww52sbt(v=vs.94).aspx\n if (isError(value)\n && (keys.indexOf('message') >= 0 || keys.indexOf('description') >= 0)) {\n return formatError(value);\n }\n\n // Some type of object without properties can be shortcutted.\n if (keys.length === 0) {\n if (isFunction(value)) {\n var name = value.name ? ': ' + value.name : '';\n return ctx.stylize('[Function' + name + ']', 'special');\n }\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n }\n if (isDate(value)) {\n return ctx.stylize(Date.prototype.toString.call(value), 'date');\n }\n if (isError(value)) {\n return formatError(value);\n }\n }\n\n var base = '', array = false, braces = ['{', '}'];\n\n // Make Array say that they are Array\n if (isArray(value)) {\n array = true;\n braces = ['[', ']'];\n }\n\n // Make functions say that they are functions\n if (isFunction(value)) {\n var n = value.name ? ': ' + value.name : '';\n base = ' [Function' + n + ']';\n }\n\n // Make RegExps say that they are RegExps\n if (isRegExp(value)) {\n base = ' ' + RegExp.prototype.toString.call(value);\n }\n\n // Make dates with properties first say the date\n if (isDate(value)) {\n base = ' ' + Date.prototype.toUTCString.call(value);\n }\n\n // Make error with message first say the error\n if (isError(value)) {\n base = ' ' + formatError(value);\n }\n\n if (keys.length === 0 && (!array || value.length == 0)) {\n return braces[0] + base + braces[1];\n }\n\n if (recurseTimes < 0) {\n if (isRegExp(value)) {\n return ctx.stylize(RegExp.prototype.toString.call(value), 'regexp');\n } else {\n return ctx.stylize('[Object]', 'special');\n }\n }\n\n ctx.seen.push(value);\n\n var output;\n if (array) {\n output = formatArray(ctx, value, recurseTimes, visibleKeys, keys);\n } else {\n output = keys.map(function(key) {\n return formatProperty(ctx, value, recurseTimes, visibleKeys, key, array);\n });\n }\n\n ctx.seen.pop();\n\n return reduceToSingleString(output, base, braces);\n}\n\n\nfunction formatPrimitive(ctx, value) {\n if (isUndefined(value))\n return ctx.stylize('undefined', 'undefined');\n if (isString(value)) {\n var simple = '\\'' + JSON.stringify(value).replace(/^\"|\"$/g, '')\n .replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"') + '\\'';\n return ctx.stylize(simple, 'string');\n }\n if (isNumber(value))\n return ctx.stylize('' + value, 'number');\n if (isBoolean(value))\n return ctx.stylize('' + value, 'boolean');\n // For some reason typeof null is \"object\", so special case here.\n if (isNull(value))\n return ctx.stylize('null', 'null');\n}\n\n\nfunction formatError(value) {\n return '[' + Error.prototype.toString.call(value) + ']';\n}\n\n\nfunction formatArray(ctx, value, recurseTimes, visibleKeys, keys) {\n var output = [];\n for (var i = 0, l = value.length; i < l; ++i) {\n if (hasOwnProperty(value, String(i))) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n String(i), true));\n } else {\n output.push('');\n }\n }\n keys.forEach(function(key) {\n if (!key.match(/^\\d+$/)) {\n output.push(formatProperty(ctx, value, recurseTimes, visibleKeys,\n key, true));\n }\n });\n return output;\n}\n\n\nfunction formatProperty(ctx, value, recurseTimes, visibleKeys, key, array) {\n var name, str, desc;\n desc = Object.getOwnPropertyDescriptor(value, key) || { value: value[key] };\n if (desc.get) {\n if (desc.set) {\n str = ctx.stylize('[Getter/Setter]', 'special');\n } else {\n str = ctx.stylize('[Getter]', 'special');\n }\n } else {\n if (desc.set) {\n str = ctx.stylize('[Setter]', 'special');\n }\n }\n if (!hasOwnProperty(visibleKeys, key)) {\n name = '[' + key + ']';\n }\n if (!str) {\n if (ctx.seen.indexOf(desc.value) < 0) {\n if (isNull(recurseTimes)) {\n str = formatValue(ctx, desc.value, null);\n } else {\n str = formatValue(ctx, desc.value, recurseTimes - 1);\n }\n if (str.indexOf('\\n') > -1) {\n if (array) {\n str = str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n').substr(2);\n } else {\n str = '\\n' + str.split('\\n').map(function(line) {\n return ' ' + line;\n }).join('\\n');\n }\n }\n } else {\n str = ctx.stylize('[Circular]', 'special');\n }\n }\n if (isUndefined(name)) {\n if (array && key.match(/^\\d+$/)) {\n return str;\n }\n name = JSON.stringify('' + key);\n if (name.match(/^\"([a-zA-Z_][a-zA-Z_0-9]*)\"$/)) {\n name = name.substr(1, name.length - 2);\n name = ctx.stylize(name, 'name');\n } else {\n name = name.replace(/'/g, \"\\\\'\")\n .replace(/\\\\\"/g, '\"')\n .replace(/(^\"|\"$)/g, \"'\");\n name = ctx.stylize(name, 'string');\n }\n }\n\n return name + ': ' + str;\n}\n\n\nfunction reduceToSingleString(output, base, braces) {\n var numLinesEst = 0;\n var length = output.reduce(function(prev, cur) {\n numLinesEst++;\n if (cur.indexOf('\\n') >= 0) numLinesEst++;\n return prev + cur.replace(/\\u001b\\[\\d\\d?m/g, '').length + 1;\n }, 0);\n\n if (length > 60) {\n return braces[0] +\n (base === '' ? '' : base + '\\n ') +\n ' ' +\n output.join(',\\n ') +\n ' ' +\n braces[1];\n }\n\n return braces[0] + base + ' ' + output.join(', ') + ' ' + braces[1];\n}\n\n\n// NOTE: These type checking functions intentionally don't use `instanceof`\n// because it is fragile and can be easily faked with `Object.create()`.\nexports.types = require('./support/types');\n\nfunction isArray(ar) {\n return Array.isArray(ar);\n}\nexports.isArray = isArray;\n\nfunction isBoolean(arg) {\n return typeof arg === 'boolean';\n}\nexports.isBoolean = isBoolean;\n\nfunction isNull(arg) {\n return arg === null;\n}\nexports.isNull = isNull;\n\nfunction isNullOrUndefined(arg) {\n return arg == null;\n}\nexports.isNullOrUndefined = isNullOrUndefined;\n\nfunction isNumber(arg) {\n return typeof arg === 'number';\n}\nexports.isNumber = isNumber;\n\nfunction isString(arg) {\n return typeof arg === 'string';\n}\nexports.isString = isString;\n\nfunction isSymbol(arg) {\n return typeof arg === 'symbol';\n}\nexports.isSymbol = isSymbol;\n\nfunction isUndefined(arg) {\n return arg === void 0;\n}\nexports.isUndefined = isUndefined;\n\nfunction isRegExp(re) {\n return isObject(re) && objectToString(re) === '[object RegExp]';\n}\nexports.isRegExp = isRegExp;\nexports.types.isRegExp = isRegExp;\n\nfunction isObject(arg) {\n return typeof arg === 'object' && arg !== null;\n}\nexports.isObject = isObject;\n\nfunction isDate(d) {\n return isObject(d) && objectToString(d) === '[object Date]';\n}\nexports.isDate = isDate;\nexports.types.isDate = isDate;\n\nfunction isError(e) {\n return isObject(e) &&\n (objectToString(e) === '[object Error]' || e instanceof Error);\n}\nexports.isError = isError;\nexports.types.isNativeError = isError;\n\nfunction isFunction(arg) {\n return typeof arg === 'function';\n}\nexports.isFunction = isFunction;\n\nfunction isPrimitive(arg) {\n return arg === null ||\n typeof arg === 'boolean' ||\n typeof arg === 'number' ||\n typeof arg === 'string' ||\n typeof arg === 'symbol' || // ES6 symbol\n typeof arg === 'undefined';\n}\nexports.isPrimitive = isPrimitive;\n\nexports.isBuffer = require('./support/isBuffer');\n\nfunction objectToString(o) {\n return Object.prototype.toString.call(o);\n}\n\n\nfunction pad(n) {\n return n < 10 ? '0' + n.toString(10) : n.toString(10);\n}\n\n\nvar months = ['Jan', 'Feb', 'Mar', 'Apr', 'May', 'Jun', 'Jul', 'Aug', 'Sep',\n 'Oct', 'Nov', 'Dec'];\n\n// 26 Feb 16:19:34\nfunction timestamp() {\n var d = new Date();\n var time = [pad(d.getHours()),\n pad(d.getMinutes()),\n pad(d.getSeconds())].join(':');\n return [d.getDate(), months[d.getMonth()], time].join(' ');\n}\n\n\n// log is just a thin wrapper to console.log that prepends a timestamp\nexports.log = function() {\n console.log('%s - %s', timestamp(), exports.format.apply(exports, arguments));\n};\n\n\n/**\n * Inherit the prototype methods from one constructor into another.\n *\n * The Function.prototype.inherits from lang.js rewritten as a standalone\n * function (not on Function.prototype). NOTE: If this file is to be loaded\n * during bootstrapping this function needs to be rewritten using some native\n * functions as prototype setup using normal JavaScript does not work as\n * expected during bootstrapping (see mirror.js in r114903).\n *\n * @param {function} ctor Constructor function which needs to inherit the\n * prototype.\n * @param {function} superCtor Constructor function to inherit prototype from.\n */\nexports.inherits = require('inherits');\n\nexports._extend = function(origin, add) {\n // Don't do anything if add isn't an object\n if (!add || !isObject(add)) return origin;\n\n var keys = Object.keys(add);\n var i = keys.length;\n while (i--) {\n origin[keys[i]] = add[keys[i]];\n }\n return origin;\n};\n\nfunction hasOwnProperty(obj, prop) {\n return Object.prototype.hasOwnProperty.call(obj, prop);\n}\n\nvar kCustomPromisifiedSymbol = typeof Symbol !== 'undefined' ? Symbol('util.promisify.custom') : undefined;\n\nexports.promisify = function promisify(original) {\n if (typeof original !== 'function')\n throw new TypeError('The \"original\" argument must be of type Function');\n\n if (kCustomPromisifiedSymbol && original[kCustomPromisifiedSymbol]) {\n var fn = original[kCustomPromisifiedSymbol];\n if (typeof fn !== 'function') {\n throw new TypeError('The \"util.promisify.custom\" argument must be of type Function');\n }\n Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n value: fn, enumerable: false, writable: false, configurable: true\n });\n return fn;\n }\n\n function fn() {\n var promiseResolve, promiseReject;\n var promise = new Promise(function (resolve, reject) {\n promiseResolve = resolve;\n promiseReject = reject;\n });\n\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args.push(arguments[i]);\n }\n args.push(function (err, value) {\n if (err) {\n promiseReject(err);\n } else {\n promiseResolve(value);\n }\n });\n\n try {\n original.apply(this, args);\n } catch (err) {\n promiseReject(err);\n }\n\n return promise;\n }\n\n Object.setPrototypeOf(fn, Object.getPrototypeOf(original));\n\n if (kCustomPromisifiedSymbol) Object.defineProperty(fn, kCustomPromisifiedSymbol, {\n value: fn, enumerable: false, writable: false, configurable: true\n });\n return Object.defineProperties(\n fn,\n getOwnPropertyDescriptors(original)\n );\n}\n\nexports.promisify.custom = kCustomPromisifiedSymbol\n\nfunction callbackifyOnRejected(reason, cb) {\n // `!reason` guard inspired by bluebird (Ref: https://goo.gl/t5IS6M).\n // Because `null` is a special error value in callbacks which means \"no error\n // occurred\", we error-wrap so the callback consumer can distinguish between\n // \"the promise rejected with null\" or \"the promise fulfilled with undefined\".\n if (!reason) {\n var newReason = new Error('Promise was rejected with a falsy value');\n newReason.reason = reason;\n reason = newReason;\n }\n return cb(reason);\n}\n\nfunction callbackify(original) {\n if (typeof original !== 'function') {\n throw new TypeError('The \"original\" argument must be of type Function');\n }\n\n // We DO NOT return the promise as it gives the user a false sense that\n // the promise is actually somehow related to the callback's execution\n // and that the callback throwing will reject the promise.\n function callbackified() {\n var args = [];\n for (var i = 0; i < arguments.length; i++) {\n args.push(arguments[i]);\n }\n\n var maybeCb = args.pop();\n if (typeof maybeCb !== 'function') {\n throw new TypeError('The last argument must be of type Function');\n }\n var self = this;\n var cb = function() {\n return maybeCb.apply(self, arguments);\n };\n // In true node style we process the callback on `nextTick` with all the\n // implications (stack, `uncaughtException`, `async_hooks`)\n original.apply(this, args)\n .then(function(ret) { process.nextTick(cb.bind(null, null, ret)) },\n function(rej) { process.nextTick(callbackifyOnRejected.bind(null, rej, cb)) });\n }\n\n Object.setPrototypeOf(callbackified, Object.getPrototypeOf(original));\n Object.defineProperties(callbackified,\n getOwnPropertyDescriptors(original));\n return callbackified;\n}\nexports.callbackify = callbackify;\n","const bs = require('binary-search')\nconst EventEmitter = require('events')\nconst mp4 = require('mp4-stream')\nconst Box = require('mp4-box-encoding')\nconst RangeSliceStream = require('range-slice-stream')\n\n// if we want to ignore more than this many bytes, request a new stream.\n// if we want to ignore fewer, just skip them.\nconst FIND_MOOV_SEEK_SIZE = 4096\n\nclass MP4Remuxer extends EventEmitter {\n constructor (file) {\n super()\n\n this._tracks = []\n this._file = file\n this._decoder = null\n this._findMoov(0)\n }\n\n _findMoov (offset) {\n if (this._decoder) {\n this._decoder.destroy()\n }\n\n let toSkip = 0\n this._decoder = mp4.decode()\n const fileStream = this._file.createReadStream({\n start: offset\n })\n fileStream.pipe(this._decoder)\n\n const boxHandler = headers => {\n if (headers.type === 'moov') {\n this._decoder.removeListener('box', boxHandler)\n this._decoder.decode(moov => {\n fileStream.destroy()\n try {\n this._processMoov(moov)\n } catch (err) {\n err.message = `Cannot parse mp4 file: ${err.message}`\n this.emit('error', err)\n }\n })\n } else if (headers.length < FIND_MOOV_SEEK_SIZE) {\n toSkip += headers.length\n this._decoder.ignore()\n } else {\n this._decoder.removeListener('box', boxHandler)\n toSkip += headers.length\n fileStream.destroy()\n this._decoder.destroy()\n this._findMoov(offset + toSkip)\n }\n }\n this._decoder.on('box', boxHandler)\n\n }\n\n _processMoov (moov) {\n const traks = moov.traks\n this._tracks = []\n this._hasVideo = false\n this._hasAudio = false\n for (let i = 0; i < traks.length; i++) {\n const trak = traks[i]\n const stbl = trak.mdia.minf.stbl\n const stsdEntry = stbl.stsd.entries[0]\n const handlerType = trak.mdia.hdlr.handlerType\n let codec\n let mime\n if (handlerType === 'vide' && stsdEntry.type === 'avc1') {\n if (this._hasVideo) {\n continue\n }\n this._hasVideo = true\n codec = 'avc1'\n if (stsdEntry.avcC) {\n codec += `.${stsdEntry.avcC.mimeCodec}`\n }\n mime = `video/mp4; codecs=\"${codec}\"`\n } else if (handlerType === 'soun' && stsdEntry.type === 'mp4a') {\n if (this._hasAudio) {\n continue\n }\n this._hasAudio = true\n codec = 'mp4a'\n if (stsdEntry.esds && stsdEntry.esds.mimeCodec) {\n codec += `.${stsdEntry.esds.mimeCodec}`\n }\n mime = `audio/mp4; codecs=\"${codec}\"`\n } else {\n continue\n }\n\n const samples = []\n let sample = 0\n\n // Chunk/position data\n let sampleInChunk = 0\n let chunk = 0\n let offsetInChunk = 0\n let sampleToChunkIndex = 0\n\n // Time data\n let dts = 0\n const decodingTimeEntry = new RunLengthIndex(stbl.stts.entries)\n let presentationOffsetEntry = null\n if (stbl.ctts) {\n presentationOffsetEntry = new RunLengthIndex(stbl.ctts.entries)\n }\n\n // Sync table index\n let syncSampleIndex = 0\n\n while (true) {\n var currChunkEntry = stbl.stsc.entries[sampleToChunkIndex]\n\n // Compute size\n const size = stbl.stsz.entries[sample]\n\n // Compute time data\n const duration = decodingTimeEntry.value.duration\n const presentationOffset = presentationOffsetEntry ? presentationOffsetEntry.value.compositionOffset : 0\n\n // Compute sync\n let sync = true\n if (stbl.stss) {\n sync = stbl.stss.entries[syncSampleIndex] === sample + 1\n }\n\n // Create new sample entry\n const chunkOffsetTable = stbl.stco || stbl.co64\n samples.push({\n size,\n duration,\n dts,\n presentationOffset,\n sync,\n offset: offsetInChunk + chunkOffsetTable.entries[chunk]\n })\n\n // Go to next sample\n sample++\n if (sample >= stbl.stsz.entries.length) {\n break\n }\n\n // Move position/chunk\n sampleInChunk++\n offsetInChunk += size\n if (sampleInChunk >= currChunkEntry.samplesPerChunk) {\n // Move to new chunk\n sampleInChunk = 0\n offsetInChunk = 0\n chunk++\n // Move sample to chunk box index\n const nextChunkEntry = stbl.stsc.entries[sampleToChunkIndex + 1]\n if (nextChunkEntry && chunk + 1 >= nextChunkEntry.firstChunk) {\n sampleToChunkIndex++\n }\n }\n\n // Move time forward\n dts += duration\n decodingTimeEntry.inc()\n presentationOffsetEntry && presentationOffsetEntry.inc()\n\n // Move sync table index\n if (sync) {\n syncSampleIndex++\n }\n }\n\n trak.mdia.mdhd.duration = 0\n trak.tkhd.duration = 0\n\n const defaultSampleDescriptionIndex = currChunkEntry.sampleDescriptionId\n\n const trackMoov = {\n type: 'moov',\n mvhd: moov.mvhd,\n traks: [{\n tkhd: trak.tkhd,\n mdia: {\n mdhd: trak.mdia.mdhd,\n hdlr: trak.mdia.hdlr,\n elng: trak.mdia.elng,\n minf: {\n vmhd: trak.mdia.minf.vmhd,\n smhd: trak.mdia.minf.smhd,\n dinf: trak.mdia.minf.dinf,\n stbl: {\n stsd: stbl.stsd,\n stts: empty(),\n ctts: empty(),\n stsc: empty(),\n stsz: empty(),\n stco: empty(),\n stss: empty()\n }\n }\n }\n }],\n mvex: {\n mehd: {\n fragmentDuration: moov.mvhd.duration\n },\n trexs: [{\n trackId: trak.tkhd.trackId,\n defaultSampleDescriptionIndex,\n defaultSampleDuration: 0,\n defaultSampleSize: 0,\n defaultSampleFlags: 0\n }]\n }\n }\n\n this._tracks.push({\n fragmentSequence: 1,\n trackId: trak.tkhd.trackId,\n timeScale: trak.mdia.mdhd.timeScale,\n samples,\n currSample: null,\n currTime: null,\n moov: trackMoov,\n mime\n })\n }\n\n if (this._tracks.length === 0) {\n this.emit('error', new Error('no playable tracks'))\n return\n }\n\n // Must be set last since this is used above\n moov.mvhd.duration = 0\n\n this._ftyp = {\n type: 'ftyp',\n brand: 'iso5',\n brandVersion: 0,\n compatibleBrands: [\n 'iso5'\n ]\n }\n\n const ftypBuf = Box.encode(this._ftyp)\n const data = this._tracks.map(track => {\n const moovBuf = Box.encode(track.moov)\n return {\n mime: track.mime,\n init: Buffer.concat([ftypBuf, moovBuf])\n }\n })\n\n this.emit('ready', data)\n }\n\n seek (time) {\n if (!this._tracks) {\n throw new Error('Not ready yet; wait for \\'ready\\' event')\n }\n\n if (this._fileStream) {\n this._fileStream.destroy()\n this._fileStream = null\n }\n\n let startOffset = -1\n this._tracks.map((track, i) => {\n // find the keyframe before the time\n // stream from there\n if (track.outStream) {\n track.outStream.destroy()\n }\n if (track.inStream) {\n track.inStream.destroy()\n track.inStream = null\n }\n const outStream = track.outStream = mp4.encode()\n const fragment = this._generateFragment(i, time)\n if (!fragment) {\n return outStream.finalize()\n }\n\n if (startOffset === -1 || fragment.ranges[0].start < startOffset) {\n startOffset = fragment.ranges[0].start\n }\n\n const writeFragment = (frag) => {\n if (outStream.destroyed) return\n outStream.box(frag.moof, err => {\n if (err) return this.emit('error', err)\n if (outStream.destroyed) return\n const slicedStream = track.inStream.slice(frag.ranges)\n slicedStream.pipe(outStream.mediaData(frag.length, err => {\n if (err) return this.emit('error', err)\n if (outStream.destroyed) return\n const nextFrag = this._generateFragment(i)\n if (!nextFrag) {\n return outStream.finalize()\n }\n writeFragment(nextFrag)\n }))\n })\n }\n writeFragment(fragment)\n })\n\n if (startOffset >= 0) {\n const fileStream = this._fileStream = this._file.createReadStream({\n start: startOffset\n })\n\n this._tracks.forEach(track => {\n track.inStream = new RangeSliceStream(startOffset, {\n // Allow up to a 10MB offset between audio and video,\n // which should be fine for any reasonable interleaving\n // interval and bitrate\n highWaterMark: 10000000\n })\n fileStream.pipe(track.inStream)\n })\n }\n\n return this._tracks.map(track => {\n return track.outStream\n })\n }\n\n _findSampleBefore (trackInd, time) {\n const track = this._tracks[trackInd]\n const scaledTime = Math.floor(track.timeScale * time)\n let sample = bs(track.samples, scaledTime, (sample, t) => {\n const pts = sample.dts + sample.presentationOffset// - track.editShift\n return pts - t\n })\n if (sample === -1) {\n sample = 0\n } else if (sample < 0) {\n sample = -sample - 2\n }\n // sample is now the last sample with dts <= time\n // Find the preceeding sync sample\n while (!track.samples[sample].sync) {\n sample--\n }\n return sample\n }\n\n _generateFragment (track, time) {\n /*\n 1. Find correct sample\n 2. Process backward until sync sample found\n 3. Process forward until next sync sample after MIN_FRAGMENT_DURATION found\n */\n const currTrack = this._tracks[track]\n let firstSample\n if (time !== undefined) {\n firstSample = this._findSampleBefore(track, time)\n } else {\n firstSample = currTrack.currSample\n }\n\n if (firstSample >= currTrack.samples.length) { return null }\n\n const startDts = currTrack.samples[firstSample].dts\n\n let totalLen = 0\n const ranges = []\n for (var currSample = firstSample; currSample < currTrack.samples.length; currSample++) {\n const sample = currTrack.samples[currSample]\n if (sample.sync && sample.dts - startDts >= currTrack.timeScale * MIN_FRAGMENT_DURATION) {\n break // This is a reasonable place to end the fragment\n }\n\n totalLen += sample.size\n const currRange = ranges.length - 1\n if (currRange < 0 || ranges[currRange].end !== sample.offset) {\n // Push a new range\n ranges.push({\n start: sample.offset,\n end: sample.offset + sample.size\n })\n } else {\n ranges[currRange].end += sample.size\n }\n }\n\n currTrack.currSample = currSample\n\n return {\n moof: this._generateMoof(track, firstSample, currSample),\n ranges,\n length: totalLen\n }\n }\n\n _generateMoof (track, firstSample, lastSample) {\n const currTrack = this._tracks[track]\n\n const entries = []\n let trunVersion = 0\n for (let j = firstSample; j < lastSample; j++) {\n const currSample = currTrack.samples[j]\n if (currSample.presentationOffset < 0) { trunVersion = 1 }\n entries.push({\n sampleDuration: currSample.duration,\n sampleSize: currSample.size,\n sampleFlags: currSample.sync ? 0x2000000 : 0x1010000,\n sampleCompositionTimeOffset: currSample.presentationOffset\n })\n }\n\n const moof = {\n type: 'moof',\n mfhd: {\n sequenceNumber: currTrack.fragmentSequence++\n },\n trafs: [{\n tfhd: {\n flags: 0x20000, // default-base-is-moof\n trackId: currTrack.trackId\n },\n tfdt: {\n baseMediaDecodeTime: currTrack.samples[firstSample].dts\n },\n trun: {\n flags: 0xf01,\n dataOffset: 8, // The moof size has to be added to this later as well\n entries,\n version: trunVersion\n }\n }]\n }\n\n // Update the offset\n moof.trafs[0].trun.dataOffset += Box.encodingLength(moof)\n\n return moof\n }\n}\n\nclass RunLengthIndex {\n constructor (entries, countName) {\n this._entries = entries\n this._countName = countName || 'count'\n this._index = 0\n this._offset = 0\n\n this.value = this._entries[0]\n }\n\n inc () {\n this._offset++\n if (this._offset >= this._entries[this._index][this._countName]) {\n this._index++\n this._offset = 0\n }\n\n this.value = this._entries[this._index]\n }\n}\n\nfunction empty () {\n return {\n version: 0,\n flags: 0,\n entries: []\n }\n}\n\nconst MIN_FRAGMENT_DURATION = 1 // second\n\nmodule.exports = MP4Remuxer\n","const MediaElementWrapper = require('mediasource')\nconst pump = require('pump')\n\nconst MP4Remuxer = require('./mp4-remuxer')\n\nfunction VideoStream (file, mediaElem, opts = {}) {\n if (!(this instanceof VideoStream)) {\n console.warn(\"Don't invoke VideoStream without the 'new' keyword.\")\n return new VideoStream(file, mediaElem, opts)\n }\n\n this.detailedError = null\n\n this._elem = mediaElem\n this._elemWrapper = new MediaElementWrapper(mediaElem)\n this._waitingFired = false\n this._trackMeta = null\n this._file = file\n this._tracks = null\n\n if (this._elem.preload !== 'none') {\n this._createMuxer()\n }\n\n this._onError = () => {\n this.detailedError = this._elemWrapper.detailedError\n this.destroy() // don't pass err though so the user doesn't need to listen for errors\n }\n\n this._onWaiting = () => {\n this._waitingFired = true\n if (!this._muxer) {\n this._createMuxer()\n } else if (this._tracks) {\n this._pump()\n }\n }\n\n if (mediaElem.autoplay) { mediaElem.preload = 'auto' }\n mediaElem.addEventListener('waiting', this._onWaiting)\n mediaElem.addEventListener('error', this._onError)\n}\n\nVideoStream.prototype = {\n _createMuxer () {\n this._muxer = new MP4Remuxer(this._file)\n this._muxer.on('ready', data => {\n this._tracks = data.map(trackData => {\n const mediaSource = this._elemWrapper.createWriteStream(trackData.mime)\n mediaSource.on('error', err => {\n this._elemWrapper.error(err)\n })\n const track = {\n muxed: null,\n mediaSource,\n initFlushed: false,\n onInitFlushed: null\n }\n mediaSource.write(trackData.init, err => {\n track.initFlushed = true\n if (track.onInitFlushed) {\n track.onInitFlushed(err)\n }\n })\n return track\n })\n\n if (this._waitingFired || this._elem.preload === 'auto') {\n this._pump()\n }\n })\n\n this._muxer.on('error', err => {\n this._elemWrapper.error(err)\n })\n },\n _pump () {\n const muxed = this._muxer.seek(this._elem.currentTime, !this._tracks)\n\n this._tracks.forEach((track, i) => {\n const pumpTrack = () => {\n if (track.muxed) {\n track.muxed.destroy()\n track.mediaSource = this._elemWrapper.createWriteStream(track.mediaSource)\n track.mediaSource.on('error', err => {\n this._elemWrapper.error(err)\n })\n }\n track.muxed = muxed[i]\n pump(track.muxed, track.mediaSource)\n }\n if (!track.initFlushed) {\n track.onInitFlushed = err => {\n if (err) {\n this._elemWrapper.error(err)\n return\n }\n pumpTrack()\n }\n } else {\n pumpTrack()\n }\n })\n },\n destroy () {\n if (this.destroyed) {\n return\n }\n this.destroyed = true\n\n this._elem.removeEventListener('waiting', this._onWaiting)\n this._elem.removeEventListener('error', this._onError)\n\n if (this._tracks) {\n this._tracks.forEach(track => {\n if (track.muxed) {\n track.muxed.destroy()\n }\n })\n }\n\n this._elem.src = ''\n }\n}\n\nmodule.exports = VideoStream\n","/*! webtorrent. MIT License. WebTorrent LLC */\n/* global FileList, ServiceWorker */\n/* eslint-env browser */\n\nconst EventEmitter = require('events')\nconst path = require('path')\nconst concat = require('simple-concat')\nconst createTorrent = require('create-torrent')\nconst debugFactory = require('debug')\nconst DHT = require('bittorrent-dht/client') // browser exclude\nconst loadIPSet = require('load-ip-set') // browser exclude\nconst parallel = require('run-parallel')\nconst parseTorrent = require('parse-torrent')\nconst Peer = require('simple-peer')\nconst queueMicrotask = require('queue-microtask')\nconst randombytes = require('randombytes')\nconst sha1 = require('simple-sha1')\nconst speedometer = require('speedometer')\nconst { ThrottleGroup } = require('speed-limiter')\nconst ConnPool = require('./lib/conn-pool.js') // browser exclude\nconst Torrent = require('./lib/torrent.js')\nconst { version: VERSION } = require('./package.json')\n\nconst debug = debugFactory('webtorrent')\n\n/**\n * Version number in Azureus-style. Generated from major and minor semver version.\n * For example:\n * '0.16.1' -> '0016'\n * '1.2.5' -> '0102'\n */\nconst VERSION_STR = VERSION\n .replace(/\\d*./g, v => `0${v % 100}`.slice(-2))\n .slice(0, 4)\n\n/**\n * Version prefix string (used in peer ID). WebTorrent uses the Azureus-style\n * encoding: '-', two characters for client id ('WW'), four ascii digits for version\n * number, '-', followed by random numbers.\n * For example:\n * '-WW0102-'...\n */\nconst VERSION_PREFIX = `-WW${VERSION_STR}-`\n\n/**\n * WebTorrent Client\n * @param {Object=} opts\n */\nclass WebTorrent extends EventEmitter {\n constructor (opts = {}) {\n super()\n\n if (typeof opts.peerId === 'string') {\n this.peerId = opts.peerId\n } else if (Buffer.isBuffer(opts.peerId)) {\n this.peerId = opts.peerId.toString('hex')\n } else {\n this.peerId = Buffer.from(VERSION_PREFIX + randombytes(9).toString('base64')).toString('hex')\n }\n this.peerIdBuffer = Buffer.from(this.peerId, 'hex')\n\n if (typeof opts.nodeId === 'string') {\n this.nodeId = opts.nodeId\n } else if (Buffer.isBuffer(opts.nodeId)) {\n this.nodeId = opts.nodeId.toString('hex')\n } else {\n this.nodeId = randombytes(20).toString('hex')\n }\n this.nodeIdBuffer = Buffer.from(this.nodeId, 'hex')\n\n this._debugId = this.peerId.toString('hex').substring(0, 7)\n\n this.destroyed = false\n this.listening = false\n this.torrentPort = opts.torrentPort || 0\n this.dhtPort = opts.dhtPort || 0\n this.tracker = opts.tracker !== undefined ? opts.tracker : {}\n this.lsd = opts.lsd !== false\n this.torrents = []\n this.maxConns = Number(opts.maxConns) || 55\n this.utp = WebTorrent.UTP_SUPPORT && opts.utp !== false\n\n this._downloadLimit = Math.max((typeof opts.downloadLimit === 'number') ? opts.downloadLimit : -1, -1)\n this._uploadLimit = Math.max((typeof opts.uploadLimit === 'number') ? opts.uploadLimit : -1, -1)\n\n this.serviceWorker = null\n this.workerKeepAliveInterval = null\n this.workerPortCount = 0\n\n if (opts.secure === true) {\n require('./lib/peer').enableSecure()\n }\n\n this._debug(\n 'new webtorrent (peerId %s, nodeId %s, port %s)',\n this.peerId, this.nodeId, this.torrentPort\n )\n\n this.throttleGroups = {\n down: new ThrottleGroup({ rate: Math.max(this._downloadLimit, 0), enabled: this._downloadLimit >= 0 }),\n up: new ThrottleGroup({ rate: Math.max(this._uploadLimit, 0), enabled: this._uploadLimit >= 0 })\n }\n\n if (this.tracker) {\n if (typeof this.tracker !== 'object') this.tracker = {}\n if (globalThis.WRTC && !this.tracker.wrtc) this.tracker.wrtc = globalThis.WRTC\n }\n\n if (typeof ConnPool === 'function') {\n this._connPool = new ConnPool(this)\n } else {\n queueMicrotask(() => {\n this._onListening()\n })\n }\n\n // stats\n this._downloadSpeed = speedometer()\n this._uploadSpeed = speedometer()\n\n if (opts.dht !== false && typeof DHT === 'function' /* browser exclude */) {\n // use a single DHT instance for all torrents, so the routing table can be reused\n this.dht = new DHT(Object.assign({}, { nodeId: this.nodeId }, opts.dht))\n\n this.dht.once('error', err => {\n this._destroy(err)\n })\n\n this.dht.once('listening', () => {\n const address = this.dht.address()\n if (address) this.dhtPort = address.port\n })\n\n // Ignore warning when there are > 10 torrents in the client\n this.dht.setMaxListeners(0)\n\n this.dht.listen(this.dhtPort)\n } else {\n this.dht = false\n }\n\n // Enable or disable BEP19 (Web Seeds). Enabled by default:\n this.enableWebSeeds = opts.webSeeds !== false\n\n const ready = () => {\n if (this.destroyed) return\n this.ready = true\n this.emit('ready')\n }\n\n if (typeof loadIPSet === 'function' && opts.blocklist != null) {\n loadIPSet(opts.blocklist, {\n headers: {\n 'user-agent': `WebTorrent/${VERSION} (https://webtorrent.io)`\n }\n }, (err, ipSet) => {\n if (err) return console.error(`Failed to load blocklist: ${err.message}`)\n this.blocked = ipSet\n ready()\n })\n } else {\n queueMicrotask(ready)\n }\n }\n\n /**\n * Accepts an existing service worker registration [navigator.serviceWorker.controller]\n * which must be activated, \"creates\" a file server for streamed file rendering to use.\n *\n * @param {ServiceWorker} controller\n * @param {function=} cb\n * @return {null}\n */\n loadWorker (controller, cb = () => {}) {\n if (!(controller instanceof ServiceWorker)) throw new Error('Invalid worker registration')\n if (controller.state !== 'activated') throw new Error('Worker isn\\'t activated')\n const keepAliveTime = 20000\n\n this.serviceWorker = controller\n\n navigator.serviceWorker.addEventListener('message', event => {\n const { data } = event\n if (!data.type || !data.type === 'webtorrent' || !data.url) return null\n let [infoHash, ...filePath] = data.url.slice(data.url.indexOf(data.scope + 'webtorrent/') + 11 + data.scope.length).split('/')\n filePath = decodeURI(filePath.join('/'))\n if (!infoHash || !filePath) return null\n\n const [port] = event.ports\n\n const file = this.get(infoHash) && this.get(infoHash).files.find(file => file.path === filePath)\n if (!file) return null\n\n const [response, stream, raw] = file._serve(data)\n const asyncIterator = stream && stream[Symbol.asyncIterator]()\n\n const cleanup = () => {\n port.onmessage = null\n if (stream) stream.destroy()\n if (raw) raw.destroy()\n this.workerPortCount--\n if (!this.workerPortCount) {\n clearInterval(this.workerKeepAliveInterval)\n this.workerKeepAliveInterval = null\n }\n }\n\n port.onmessage = async msg => {\n if (msg.data) {\n let chunk\n try {\n chunk = (await asyncIterator.next()).value\n } catch (e) {\n // chunk is yet to be downloaded or it somehow failed, should this be logged?\n }\n port.postMessage(chunk)\n if (!chunk) cleanup()\n if (!this.workerKeepAliveInterval) this.workerKeepAliveInterval = setInterval(() => fetch(`${this.serviceWorker.scriptURL.substr(0, this.serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length)}webtorrent/keepalive/`), keepAliveTime)\n } else {\n cleanup()\n }\n }\n this.workerPortCount++\n port.postMessage(response)\n })\n cb(this.serviceWorker)\n }\n\n get downloadSpeed () { return this._downloadSpeed() }\n\n get uploadSpeed () { return this._uploadSpeed() }\n\n get progress () {\n const torrents = this.torrents.filter(torrent => torrent.progress !== 1)\n const downloaded = torrents.reduce((total, torrent) => total + torrent.downloaded, 0)\n const length = torrents.reduce((total, torrent) => total + (torrent.length || 0), 0) || 1\n return downloaded / length\n }\n\n get ratio () {\n const uploaded = this.torrents.reduce((total, torrent) => total + torrent.uploaded, 0)\n const received = this.torrents.reduce((total, torrent) => total + torrent.received, 0) || 1\n return uploaded / received\n }\n\n /**\n * Returns the torrent with the given `torrentId`. Convenience method. Easier than\n * searching through the `client.torrents` array. Returns `null` if no matching torrent\n * found.\n *\n * @param {string|Buffer|Object|Torrent} torrentId\n * @return {Torrent|null}\n */\n get (torrentId) {\n if (torrentId instanceof Torrent) {\n if (this.torrents.includes(torrentId)) return torrentId\n } else {\n let parsed\n try { parsed = parseTorrent(torrentId) } catch (err) {}\n\n if (!parsed) return null\n if (!parsed.infoHash) throw new Error('Invalid torrent identifier')\n\n for (const torrent of this.torrents) {\n if (torrent.infoHash === parsed.infoHash) return torrent\n }\n }\n return null\n }\n\n /**\n * Start downloading a new torrent. Aliased as `client.download`.\n * @param {string|Buffer|Object} torrentId\n * @param {Object} opts torrent-specific options\n * @param {function=} ontorrent called when the torrent is ready (has metadata)\n */\n add (torrentId, opts = {}, ontorrent = () => {}) {\n if (this.destroyed) throw new Error('client is destroyed')\n if (typeof opts === 'function') [opts, ontorrent] = [{}, opts]\n\n const onInfoHash = () => {\n if (this.destroyed) return\n for (const t of this.torrents) {\n if (t.infoHash === torrent.infoHash && t !== torrent) {\n torrent._destroy(new Error(`Cannot add duplicate torrent ${torrent.infoHash}`))\n return\n }\n }\n }\n\n const onReady = () => {\n if (this.destroyed) return\n ontorrent(torrent)\n this.emit('torrent', torrent)\n }\n\n function onClose () {\n torrent.removeListener('_infoHash', onInfoHash)\n torrent.removeListener('ready', onReady)\n torrent.removeListener('close', onClose)\n }\n\n this._debug('add')\n opts = opts ? Object.assign({}, opts) : {}\n\n const torrent = new Torrent(torrentId, this, opts)\n this.torrents.push(torrent)\n\n torrent.once('_infoHash', onInfoHash)\n torrent.once('ready', onReady)\n torrent.once('close', onClose)\n\n return torrent\n }\n\n /**\n * Start seeding a new file/folder.\n * @param {string|File|FileList|Buffer|Array.} input\n * @param {Object=} opts\n * @param {function=} onseed called when torrent is seeding\n */\n seed (input, opts, onseed) {\n if (this.destroyed) throw new Error('client is destroyed')\n if (typeof opts === 'function') [opts, onseed] = [{}, opts]\n\n this._debug('seed')\n opts = opts ? Object.assign({}, opts) : {}\n\n // no need to verify the hashes we create\n opts.skipVerify = true\n\n const isFilePath = typeof input === 'string'\n\n // When seeding from fs path, initialize store from that path to avoid a copy\n if (isFilePath) opts.path = path.dirname(input)\n if (!opts.createdBy) opts.createdBy = `WebTorrent/${VERSION_STR}`\n\n const onTorrent = torrent => {\n const tasks = [\n cb => {\n // when a filesystem path is specified or the store is preloaded, files are already in the FS store\n if (isFilePath || opts.preloadedStore) return cb()\n torrent.load(streams, cb)\n }\n ]\n if (this.dht) {\n tasks.push(cb => {\n torrent.once('dhtAnnounce', cb)\n })\n }\n parallel(tasks, err => {\n if (this.destroyed) return\n if (err) return torrent._destroy(err)\n _onseed(torrent)\n })\n }\n\n const _onseed = torrent => {\n this._debug('on seed')\n if (typeof onseed === 'function') onseed(torrent)\n torrent.emit('seed')\n this.emit('seed', torrent)\n }\n\n const torrent = this.add(null, opts, onTorrent)\n let streams\n\n if (isFileList(input)) input = Array.from(input)\n else if (!Array.isArray(input)) input = [input]\n\n parallel(input.map(item => cb => {\n if (!opts.preloadedStore && isReadable(item)) {\n concat(item, (err, buf) => {\n if (err) return cb(err)\n buf.name = item.name\n cb(null, buf)\n })\n } else {\n cb(null, item)\n }\n }), (err, input) => {\n if (this.destroyed) return\n if (err) return torrent._destroy(err)\n\n createTorrent.parseInput(input, opts, (err, files) => {\n if (this.destroyed) return\n if (err) return torrent._destroy(err)\n\n streams = files.map(file => file.getStream)\n\n createTorrent(input, opts, (err, torrentBuf) => {\n if (this.destroyed) return\n if (err) return torrent._destroy(err)\n\n const existingTorrent = this.get(torrentBuf)\n if (existingTorrent) {\n console.warn('A torrent with the same id is already being seeded')\n torrent._destroy()\n if (typeof onseed === 'function') onseed(existingTorrent)\n } else {\n torrent._onTorrentId(torrentBuf)\n }\n })\n })\n })\n\n return torrent\n }\n\n /**\n * Remove a torrent from the client.\n * @param {string|Buffer|Torrent} torrentId\n * @param {function} cb\n */\n remove (torrentId, opts, cb) {\n if (typeof opts === 'function') return this.remove(torrentId, null, opts)\n\n this._debug('remove')\n const torrent = this.get(torrentId)\n if (!torrent) throw new Error(`No torrent with id ${torrentId}`)\n this._remove(torrentId, opts, cb)\n }\n\n _remove (torrentId, opts, cb) {\n if (typeof opts === 'function') return this._remove(torrentId, null, opts)\n\n const torrent = this.get(torrentId)\n if (!torrent) return\n this.torrents.splice(this.torrents.indexOf(torrent), 1)\n torrent.destroy(opts, cb)\n if (this.dht) {\n this.dht._tables.remove(torrent.infoHash)\n }\n }\n\n address () {\n if (!this.listening) return null\n return this._connPool\n ? this._connPool.tcpServer.address()\n : { address: '0.0.0.0', family: 'IPv4', port: 0 }\n }\n\n /**\n * Set global download throttle rate.\n * @param {Number} rate (must be bigger or equal than zero, or -1 to disable throttling)\n */\n throttleDownload (rate) {\n rate = Number(rate)\n if (isNaN(rate) || !isFinite(rate) || rate < -1) return false\n this._downloadLimit = rate\n if (this._downloadLimit < 0) return this.throttleGroups.down.setEnabled(false)\n this.throttleGroups.down.setEnabled(true)\n this.throttleGroups.down.setRate(this._downloadLimit)\n }\n\n /**\n * Set global upload throttle rate\n * @param {Number} rate (must be bigger or equal than zero, or -1 to disable throttling)\n */\n throttleUpload (rate) {\n rate = Number(rate)\n if (isNaN(rate) || !isFinite(rate) || rate < -1) return false\n this._uploadLimit = rate\n if (this._uploadLimit < 0) return this.throttleGroups.up.setEnabled(false)\n this.throttleGroups.up.setEnabled(true)\n this.throttleGroups.up.setRate(this._uploadLimit)\n }\n\n /**\n * Destroy the client, including all torrents and connections to peers.\n * @param {function} cb\n */\n destroy (cb) {\n if (this.destroyed) throw new Error('client already destroyed')\n this._destroy(null, cb)\n }\n\n _destroy (err, cb) {\n this._debug('client destroy')\n this.destroyed = true\n\n const tasks = this.torrents.map(torrent => cb => {\n torrent.destroy(cb)\n })\n\n if (this._connPool) {\n tasks.push(cb => {\n this._connPool.destroy(cb)\n })\n }\n\n if (this.dht) {\n tasks.push(cb => {\n this.dht.destroy(cb)\n })\n }\n\n parallel(tasks, cb)\n\n if (err) this.emit('error', err)\n\n this.torrents = []\n this._connPool = null\n this.dht = null\n\n this.throttleGroups.down.destroy()\n this.throttleGroups.up.destroy()\n }\n\n _onListening () {\n this._debug('listening')\n this.listening = true\n\n if (this._connPool) {\n // Sometimes server.address() returns `null` in Docker.\n const address = this._connPool.tcpServer.address()\n if (address) this.torrentPort = address.port\n }\n\n this.emit('listening')\n }\n\n _debug () {\n const args = [].slice.call(arguments)\n args[0] = `[${this._debugId}] ${args[0]}`\n debug(...args)\n }\n\n _getByHash (infoHashHash) {\n for (const torrent of this.torrents) {\n if (!torrent.infoHashHash) {\n torrent.infoHashHash = sha1.sync(Buffer.from('72657132' /* 'req2' */ + torrent.infoHash, 'hex'))\n }\n if (infoHashHash === torrent.infoHashHash) {\n return torrent\n }\n }\n\n return null\n }\n}\n\nWebTorrent.WEBRTC_SUPPORT = Peer.WEBRTC_SUPPORT\nWebTorrent.UTP_SUPPORT = ConnPool.UTP_SUPPORT\nWebTorrent.VERSION = VERSION\n\n/**\n * Check if `obj` is a node Readable stream\n * @param {*} obj\n * @return {boolean}\n */\nfunction isReadable (obj) {\n return typeof obj === 'object' && obj != null && typeof obj.pipe === 'function'\n}\n\n/**\n * Check if `obj` is a W3C `FileList` object\n * @param {*} obj\n * @return {boolean}\n */\nfunction isFileList (obj) {\n return typeof FileList !== 'undefined' && obj instanceof FileList\n}\n\nmodule.exports = WebTorrent\n","const stream = require('stream')\nconst debugFactory = require('debug')\nconst eos = require('end-of-stream')\n\nconst debug = debugFactory('webtorrent:file-stream')\n\n/**\n * Readable stream of a torrent file\n *\n * @param {File} file\n * @param {Object} opts\n * @param {number} opts.start stream slice of file, starting from this byte (inclusive)\n * @param {number} opts.end stream slice of file, ending with this byte (inclusive)\n */\nclass FileStream extends stream.Readable {\n constructor (file, opts) {\n super(opts)\n\n this._torrent = file._torrent\n\n const start = (opts && opts.start) || 0\n const end = (opts && opts.end && opts.end < file.length)\n ? opts.end\n : file.length - 1\n\n const pieceLength = file._torrent.pieceLength\n\n this._startPiece = (start + file.offset) / pieceLength | 0\n this._endPiece = (end + file.offset) / pieceLength | 0\n\n this._piece = this._startPiece\n this._offset = (start + file.offset) - (this._startPiece * pieceLength)\n\n this._missing = end - start + 1\n this._reading = false\n this._notifying = false\n this._criticalLength = Math.min((1024 * 1024 / pieceLength) | 0, 2)\n\n this._torrent.select(this._startPiece, this._endPiece, true, () => {\n this._notify()\n })\n\n // Ensure that cleanup happens even if destroy() is never called (readable-stream v3 currently doesn't call it automaticallly)\n eos(this, (err) => {\n this.destroy(err)\n })\n }\n\n _read () {\n if (this._reading) return\n this._reading = true\n this._notify()\n }\n\n _notify () {\n if (!this._reading || this._missing === 0) return\n if (!this._torrent.bitfield.get(this._piece)) {\n return this._torrent.critical(this._piece, this._piece + this._criticalLength)\n }\n\n if (this._notifying) return\n this._notifying = true\n\n if (this._torrent.destroyed) return this.destroy(new Error('Torrent removed'))\n\n const p = this._piece\n\n const getOpts = {}\n // Specify length for the last piece in case it is zero-padded\n if (p === this._torrent.pieces.length - 1) {\n getOpts.length = this._torrent.lastPieceLength\n }\n this._torrent.store.get(p, getOpts, (err, buffer) => {\n this._notifying = false\n if (this.destroyed) return\n debug('read %s (length %s) (err %s)', p, buffer && buffer.length, err && err.message)\n\n if (err) return this.destroy(err)\n\n if (this._offset) {\n buffer = buffer.slice(this._offset)\n this._offset = 0\n }\n\n if (this._missing < buffer.length) {\n buffer = buffer.slice(0, this._missing)\n }\n this._missing -= buffer.length\n\n debug('pushing buffer of length %s', buffer.length)\n this._reading = false\n this.push(buffer)\n\n if (this._missing === 0) this.push(null)\n })\n this._piece += 1\n }\n\n _destroy (err, cb) {\n if (!this._torrent.destroyed) {\n this._torrent.deselect(this._startPiece, this._endPiece, true)\n }\n cb(err)\n }\n}\n\nmodule.exports = FileStream\n","const EventEmitter = require('events')\nconst { PassThrough } = require('stream')\nconst path = require('path')\nconst render = require('render-media')\nconst streamToBlob = require('stream-to-blob')\nconst streamToBlobURL = require('stream-to-blob-url')\nconst streamToBuffer = require('stream-with-known-length-to-buffer')\nconst queueMicrotask = require('queue-microtask')\nconst rangeParser = require('range-parser')\nconst mime = require('mime')\nconst eos = require('end-of-stream')\nconst FileStream = require('./file-stream.js')\n\nclass File extends EventEmitter {\n constructor (torrent, file) {\n super()\n\n this._torrent = torrent\n this._destroyed = false\n this._fileStreams = new Set()\n\n this.name = file.name\n this.path = file.path\n this.length = file.length\n this.offset = file.offset\n\n this.done = false\n\n const start = file.offset\n const end = start + file.length - 1\n\n this._startPiece = start / this._torrent.pieceLength | 0\n this._endPiece = end / this._torrent.pieceLength | 0\n\n if (this.length === 0) {\n this.done = true\n this.emit('done')\n }\n\n this._serviceWorker = torrent.client.serviceWorker\n }\n\n get downloaded () {\n if (this._destroyed || !this._torrent.bitfield) return 0\n\n const { pieces, bitfield, pieceLength, lastPieceLength } = this._torrent\n const { _startPiece: start, _endPiece: end } = this\n\n const getPieceLength = (pieceIndex) => (\n pieceIndex === pieces.length - 1 ? lastPieceLength : pieceLength\n )\n\n const getPieceDownloaded = (pieceIndex) => {\n const len = pieceIndex === pieces.length - 1 ? lastPieceLength : pieceLength\n if (bitfield.get(pieceIndex)) {\n // verified data\n return len\n } else {\n // \"in progress\" data\n return len - pieces[pieceIndex].missing\n }\n }\n\n let downloaded = 0\n for (let index = start; index <= end; index += 1) {\n const pieceDownloaded = getPieceDownloaded(index)\n downloaded += pieceDownloaded\n\n if (index === start) {\n // First piece may have an offset, e.g. irrelevant bytes from the end of\n // the previous file\n const irrelevantFirstPieceBytes = this.offset % pieceLength\n downloaded -= Math.min(irrelevantFirstPieceBytes, pieceDownloaded)\n }\n\n if (index === end) {\n // Last piece may have an offset, e.g. irrelevant bytes from the start\n // of the next file\n const irrelevantLastPieceBytes = getPieceLength(end) - (this.offset + this.length) % pieceLength\n downloaded -= Math.min(irrelevantLastPieceBytes, pieceDownloaded)\n }\n }\n\n return downloaded\n }\n\n get progress () {\n return this.length ? this.downloaded / this.length : 0\n }\n\n select (priority) {\n if (this.length === 0) return\n this._torrent.select(this._startPiece, this._endPiece, priority)\n }\n\n deselect () {\n if (this.length === 0) return\n this._torrent.deselect(this._startPiece, this._endPiece, false)\n }\n\n createReadStream (opts) {\n if (this.length === 0) {\n const empty = new PassThrough()\n queueMicrotask(() => {\n empty.end()\n })\n return empty\n }\n\n const fileStream = new FileStream(this, opts)\n\n this._fileStreams.add(fileStream)\n fileStream.once('close', () => {\n this._fileStreams.delete(fileStream)\n })\n\n return fileStream\n }\n\n getBuffer (cb) {\n streamToBuffer(this.createReadStream(), this.length, cb)\n }\n\n getBlob (cb) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n streamToBlob(this.createReadStream(), this._getMimeType())\n .then(\n blob => cb(null, blob),\n err => cb(err)\n )\n }\n\n getBlobURL (cb) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n streamToBlobURL(this.createReadStream(), this._getMimeType())\n .then(\n blobUrl => cb(null, blobUrl),\n err => cb(err)\n )\n }\n\n appendTo (elem, opts, cb) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n render.append(this, elem, opts, cb)\n }\n\n renderTo (elem, opts, cb) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n render.render(this, elem, opts, cb)\n }\n\n _serve (req) {\n const res = {\n status: 200,\n headers: {\n // Support range-requests\n 'Accept-Ranges': 'bytes',\n 'Content-Type': mime.getType(this.name),\n 'Cache-Control': 'no-cache, no-store, must-revalidate, max-age=0',\n Expires: '0'\n },\n body: req.method === 'HEAD' ? '' : 'STREAM'\n }\n // force the browser to download the file if if it's opened in a new tab\n if (req.destination === 'document') {\n res.headers['Content-Type'] = 'application/octet-stream'\n res.headers['Content-Disposition'] = 'attachment'\n res.body = 'DOWNLOAD'\n }\n\n // `rangeParser` returns an array of ranges, or an error code (number) if\n // there was an error parsing the range.\n let range = rangeParser(this.length, req.headers.range || '')\n\n if (range.constructor === Array) {\n res.status = 206 // indicates that range-request was understood\n\n // no support for multi-range request, just use the first range\n range = range[0]\n\n res.headers['Content-Range'] = `bytes ${range.start}-${range.end}/${this.length}`\n res.headers['Content-Length'] = `${range.end - range.start + 1}`\n } else {\n res.headers['Content-Length'] = this.length\n }\n\n const stream = req.method === 'GET' && this.createReadStream(range)\n\n let pipe = null\n if (stream) {\n this.emit('stream', { stream, req, file: this }, piped => {\n pipe = piped\n\n // piped stream might not close the original filestream on close/error, this is agressive but necessary\n eos(piped, () => {\n if (piped) piped.destroy()\n stream.destroy()\n })\n })\n }\n\n return [res, pipe || stream, pipe && stream]\n }\n\n getStreamURL (cb = () => {}) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n if (!this._serviceWorker) throw new Error('No worker registered')\n if (this._serviceWorker.state !== 'activated') throw new Error('Worker isn\\'t activated')\n const workerPath = this._serviceWorker.scriptURL.substr(0, this._serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length)\n const url = `${workerPath}webtorrent/${this._torrent.infoHash}/${encodeURI(this.path)}`\n cb(null, url)\n }\n\n streamTo (elem, cb = () => {}) {\n if (typeof window === 'undefined') throw new Error('browser-only method')\n if (!this._serviceWorker) throw new Error('No worker registered')\n if (this._serviceWorker.state !== 'activated') throw new Error('Worker isn\\'t activated')\n const workerPath = this._serviceWorker.scriptURL.substr(0, this._serviceWorker.scriptURL.lastIndexOf('/') + 1).slice(window.location.origin.length)\n elem.src = `${workerPath}webtorrent/${this._torrent.infoHash}/${encodeURI(this.path)}`\n cb(null, elem)\n }\n\n _getMimeType () {\n return render.mime[path.extname(this.name).toLowerCase()]\n }\n\n _destroy () {\n this._destroyed = true\n this._torrent = null\n\n for (const fileStream of this._fileStreams) {\n fileStream.destroy()\n }\n this._fileStreams.clear()\n }\n}\n\nmodule.exports = File\n","const EventEmitter = require('events')\nconst { Transform } = require('stream')\nconst arrayRemove = require('unordered-array-remove')\nconst debugFactory = require('debug')\nconst Wire = require('bittorrent-protocol')\n\nconst CONNECT_TIMEOUT_TCP = 5000\nconst CONNECT_TIMEOUT_UTP = 5000\nconst CONNECT_TIMEOUT_WEBRTC = 25000\nconst HANDSHAKE_TIMEOUT = 25000\nconst debug = debugFactory('webtorrent:peer')\n\nlet secure = false\n\nexports.enableSecure = () => {\n secure = true\n}\n\n/**\n * WebRTC peer connections start out connected, because WebRTC peers require an\n * \"introduction\" (i.e. WebRTC signaling), and there's no equivalent to an IP address\n * that lets you refer to a WebRTC endpoint.\n */\nexports.createWebRTCPeer = (conn, swarm, throttleGroups) => {\n const peer = new Peer(conn.id, 'webrtc')\n peer.conn = conn\n peer.swarm = swarm\n peer.throttleGroups = throttleGroups\n\n if (peer.conn.connected) {\n peer.onConnect()\n } else {\n const cleanup = () => {\n peer.conn.removeListener('connect', onConnect)\n peer.conn.removeListener('error', onError)\n }\n const onConnect = () => {\n cleanup()\n peer.onConnect()\n }\n const onError = err => {\n cleanup()\n peer.destroy(err)\n }\n peer.conn.once('connect', onConnect)\n peer.conn.once('error', onError)\n peer.startConnectTimeout()\n }\n\n return peer\n}\n\n/**\n * Incoming TCP peers start out connected, because the remote peer connected to the\n * listening port of the TCP server. Until the remote peer sends a handshake, we don't\n * know what swarm the connection is intended for.\n */\nexports.createTCPIncomingPeer = (conn, throttleGroups) => {\n return _createIncomingPeer(conn, 'tcpIncoming', throttleGroups)\n}\n\n/**\n * Incoming uTP peers start out connected, because the remote peer connected to the\n * listening port of the uTP server. Until the remote peer sends a handshake, we don't\n * know what swarm the connection is intended for.\n */\nexports.createUTPIncomingPeer = (conn, throttleGroups) => {\n return _createIncomingPeer(conn, 'utpIncoming', throttleGroups)\n}\n\n/**\n * Outgoing TCP peers start out with just an IP address. At some point (when there is an\n * available connection), the client can attempt to connect to the address.\n */\nexports.createTCPOutgoingPeer = (addr, swarm, throttleGroups) => {\n return _createOutgoingPeer(addr, swarm, 'tcpOutgoing', throttleGroups)\n}\n\n/**\n * Outgoing uTP peers start out with just an IP address. At some point (when there is an\n * available connection), the client can attempt to connect to the address.\n */\nexports.createUTPOutgoingPeer = (addr, swarm, throttleGroups) => {\n return _createOutgoingPeer(addr, swarm, 'utpOutgoing', throttleGroups)\n}\n\nconst _createIncomingPeer = (conn, type, throttleGroups) => {\n const addr = `${conn.remoteAddress}:${conn.remotePort}`\n const peer = new Peer(addr, type)\n peer.conn = conn\n peer.addr = addr\n peer.throttleGroups = throttleGroups\n\n peer.onConnect()\n\n return peer\n}\n\nconst _createOutgoingPeer = (addr, swarm, type, throttleGroups) => {\n const peer = new Peer(addr, type)\n peer.addr = addr\n peer.swarm = swarm\n peer.throttleGroups = throttleGroups\n\n return peer\n}\n\n/**\n * Peer that represents a Web Seed (BEP17 / BEP19).\n */\nexports.createWebSeedPeer = (conn, id, swarm, throttleGroups) => {\n const peer = new Peer(id, 'webSeed')\n peer.swarm = swarm\n peer.conn = conn\n peer.throttleGroups = throttleGroups\n\n peer.onConnect()\n\n return peer\n}\n\n/**\n * Peer. Represents a peer in the torrent swarm.\n *\n * @param {string} id \"ip:port\" string, peer id (for WebRTC peers), or url (for Web Seeds)\n * @param {string} type the type of the peer\n */\nclass Peer extends EventEmitter {\n constructor (id, type) {\n super()\n\n this.id = id\n this.type = type\n\n debug('new %s Peer %s', type, id)\n\n this.addr = null\n this.conn = null\n this.swarm = null\n this.wire = null\n\n this.connected = false\n this.destroyed = false\n this.timeout = null // handshake timeout\n this.retries = 0 // outgoing TCP connection retry count\n\n this.sentPe1 = false\n this.sentPe2 = false\n this.sentPe3 = false\n this.sentPe4 = false\n this.sentHandshake = false\n }\n\n /**\n * Called once the peer is connected (i.e. fired 'connect' event)\n * @param {Socket} conn\n */\n onConnect () {\n if (this.destroyed) return\n this.connected = true\n\n debug('Peer %s connected', this.id)\n\n clearTimeout(this.connectTimeout)\n\n const conn = this.conn\n conn.once('end', () => {\n this.destroy()\n })\n conn.once('close', () => {\n this.destroy()\n })\n conn.once('finish', () => {\n this.destroy()\n })\n conn.once('error', err => {\n this.destroy(err)\n })\n\n const wire = this.wire = new Wire(this.type, this.retries, secure)\n\n wire.once('end', () => {\n this.destroy()\n })\n wire.once('close', () => {\n this.destroy()\n })\n wire.once('finish', () => {\n this.destroy()\n })\n wire.once('error', err => {\n this.destroy(err)\n })\n\n wire.once('pe1', () => {\n this.onPe1()\n })\n wire.once('pe2', () => {\n this.onPe2()\n })\n wire.once('pe3', () => {\n this.onPe3()\n })\n wire.once('pe4', () => {\n this.onPe4()\n })\n wire.once('handshake', (infoHash, peerId) => {\n this.onHandshake(infoHash, peerId)\n })\n this.startHandshakeTimeout()\n\n this.setThrottlePipes()\n\n if (this.swarm) {\n if (this.type === 'tcpOutgoing') {\n if (secure && this.retries === 0 && !this.sentPe1) this.sendPe1()\n else if (!this.sentHandshake) this.handshake()\n } else if (this.type !== 'tcpIncoming' && !this.sentHandshake) this.handshake()\n }\n }\n\n sendPe1 () {\n this.wire.sendPe1()\n this.sentPe1 = true\n }\n\n onPe1 () {\n this.sendPe2()\n }\n\n sendPe2 () {\n this.wire.sendPe2()\n this.sentPe2 = true\n }\n\n onPe2 () {\n this.sendPe3()\n }\n\n sendPe3 () {\n this.wire.sendPe3(this.swarm.infoHash)\n this.sentPe3 = true\n }\n\n onPe3 (infoHashHash) {\n if (this.swarm) {\n if (this.swarm.infoHashHash !== infoHashHash) {\n this.destroy(new Error('unexpected crypto handshake info hash for this swarm'))\n }\n this.sendPe4()\n }\n }\n\n sendPe4 () {\n this.wire.sendPe4(this.swarm.infoHash)\n this.sentPe4 = true\n }\n\n onPe4 () {\n if (!this.sentHandshake) this.handshake()\n }\n\n clearPipes () {\n this.conn.unpipe()\n this.wire.unpipe()\n }\n\n setThrottlePipes () {\n const self = this\n this.conn\n .pipe(this.throttleGroups.down.throttle())\n .pipe(new Transform({\n transform (chunk, _, callback) {\n self.emit('download', chunk.length)\n if (self.destroyed) return\n callback(null, chunk)\n }\n }))\n .pipe(this.wire)\n .pipe(this.throttleGroups.up.throttle())\n .pipe(new Transform({\n transform (chunk, _, callback) {\n self.emit('upload', chunk.length)\n if (self.destroyed) return\n callback(null, chunk)\n }\n }))\n .pipe(this.conn)\n }\n\n /**\n * Called when handshake is received from remote peer.\n * @param {string} infoHash\n * @param {string} peerId\n */\n onHandshake (infoHash, peerId) {\n if (!this.swarm) return // `this.swarm` not set yet, so do nothing\n if (this.destroyed) return\n\n if (this.swarm.destroyed) {\n return this.destroy(new Error('swarm already destroyed'))\n }\n if (infoHash !== this.swarm.infoHash) {\n return this.destroy(new Error('unexpected handshake info hash for this swarm'))\n }\n if (peerId === this.swarm.peerId) {\n return this.destroy(new Error('refusing to connect to ourselves'))\n }\n\n debug('Peer %s got handshake %s', this.id, infoHash)\n\n clearTimeout(this.handshakeTimeout)\n\n this.retries = 0\n\n let addr = this.addr\n if (!addr && this.conn.remoteAddress && this.conn.remotePort) {\n addr = `${this.conn.remoteAddress}:${this.conn.remotePort}`\n }\n this.swarm._onWire(this.wire, addr)\n\n // swarm could be destroyed in user's 'wire' event handler\n if (!this.swarm || this.swarm.destroyed) return\n\n if (!this.sentHandshake) this.handshake()\n }\n\n handshake () {\n const opts = {\n dht: this.swarm.private ? false : !!this.swarm.client.dht,\n fast: true\n }\n this.wire.handshake(this.swarm.infoHash, this.swarm.client.peerId, opts)\n this.sentHandshake = true\n }\n\n startConnectTimeout () {\n clearTimeout(this.connectTimeout)\n\n const connectTimeoutValues = {\n webrtc: CONNECT_TIMEOUT_WEBRTC,\n tcpOutgoing: CONNECT_TIMEOUT_TCP,\n utpOutgoing: CONNECT_TIMEOUT_UTP\n }\n\n this.connectTimeout = setTimeout(() => {\n this.destroy(new Error('connect timeout'))\n }, connectTimeoutValues[this.type])\n if (this.connectTimeout.unref) this.connectTimeout.unref()\n }\n\n startHandshakeTimeout () {\n clearTimeout(this.handshakeTimeout)\n this.handshakeTimeout = setTimeout(() => {\n this.destroy(new Error('handshake timeout'))\n }, HANDSHAKE_TIMEOUT)\n if (this.handshakeTimeout.unref) this.handshakeTimeout.unref()\n }\n\n destroy (err) {\n if (this.destroyed) return\n this.destroyed = true\n this.connected = false\n\n debug('destroy %s %s (error: %s)', this.type, this.id, err && (err.message || err))\n\n clearTimeout(this.connectTimeout)\n clearTimeout(this.handshakeTimeout)\n\n const swarm = this.swarm\n const conn = this.conn\n const wire = this.wire\n\n this.swarm = null\n this.conn = null\n this.wire = null\n\n if (swarm && wire) {\n arrayRemove(swarm.wires, swarm.wires.indexOf(wire))\n }\n if (conn) {\n conn.on('error', () => {})\n conn.destroy()\n }\n if (wire) wire.destroy()\n if (swarm) swarm.removePeer(this.id)\n }\n}\n","\n/**\n * Mapping of torrent pieces to their respective availability in the torrent swarm. Used\n * by the torrent manager for implementing the rarest piece first selection strategy.\n */\nclass RarityMap {\n constructor (torrent) {\n this._torrent = torrent\n this._numPieces = torrent.pieces.length\n this._pieces = new Array(this._numPieces)\n\n this._onWire = wire => {\n this.recalculate()\n this._initWire(wire)\n }\n this._onWireHave = index => {\n this._pieces[index] += 1\n }\n this._onWireBitfield = () => {\n this.recalculate()\n }\n\n this._torrent.wires.forEach(wire => {\n this._initWire(wire)\n })\n this._torrent.on('wire', this._onWire)\n this.recalculate()\n }\n\n /**\n * Get the index of the rarest piece. Optionally, pass a filter function to exclude\n * certain pieces (for instance, those that we already have).\n *\n * @param {function} pieceFilterFunc\n * @return {number} index of rarest piece, or -1\n */\n getRarestPiece (pieceFilterFunc) {\n let candidates = []\n let min = Infinity\n\n for (let i = 0; i < this._numPieces; ++i) {\n if (pieceFilterFunc && !pieceFilterFunc(i)) continue\n\n const availability = this._pieces[i]\n if (availability === min) {\n candidates.push(i)\n } else if (availability < min) {\n candidates = [i]\n min = availability\n }\n }\n\n if (candidates.length) {\n // if there are multiple pieces with the same availability, choose one randomly\n return candidates[Math.random() * candidates.length | 0]\n } else {\n return -1\n }\n }\n\n destroy () {\n this._torrent.removeListener('wire', this._onWire)\n this._torrent.wires.forEach(wire => {\n this._cleanupWireEvents(wire)\n })\n this._torrent = null\n this._pieces = null\n\n this._onWire = null\n this._onWireHave = null\n this._onWireBitfield = null\n }\n\n _initWire (wire) {\n wire._onClose = () => {\n this._cleanupWireEvents(wire)\n for (let i = 0; i < this._numPieces; ++i) {\n this._pieces[i] -= wire.peerPieces.get(i)\n }\n }\n\n wire.on('have', this._onWireHave)\n wire.on('bitfield', this._onWireBitfield)\n wire.once('close', wire._onClose)\n }\n\n /**\n * Recalculates piece availability across all peers in the torrent.\n */\n recalculate () {\n this._pieces.fill(0)\n\n for (const wire of this._torrent.wires) {\n for (let i = 0; i < this._numPieces; ++i) {\n this._pieces[i] += wire.peerPieces.get(i)\n }\n }\n }\n\n _cleanupWireEvents (wire) {\n wire.removeListener('have', this._onWireHave)\n wire.removeListener('bitfield', this._onWireBitfield)\n if (wire._onClose) wire.removeListener('close', wire._onClose)\n wire._onClose = null\n }\n}\n\nmodule.exports = RarityMap\n","/* global Blob */\n\nconst EventEmitter = require('events')\nconst fs = require('fs')\nconst net = require('net') // browser exclude\nconst os = require('os') // browser exclude\nconst path = require('path')\nconst addrToIPPort = require('addr-to-ip-port')\nconst { default: BitField } = require('bitfield')\nconst CacheChunkStore = require('cache-chunk-store')\nconst ChunkStoreWriteStream = require('chunk-store-stream/write')\nconst cpus = require('cpus')\nconst debugFactory = require('debug')\nconst Discovery = require('torrent-discovery')\nconst FSChunkStore = require('fs-chunk-store') // browser: `memory-chunk-store`\nconst get = require('simple-get')\nconst ImmediateChunkStore = require('immediate-chunk-store')\nconst ltDontHave = require('lt_donthave')\nconst MemoryChunkStore = require('memory-chunk-store')\nconst MultiStream = require('multistream')\nconst parallel = require('run-parallel')\nconst parallelLimit = require('run-parallel-limit')\nconst parseTorrent = require('parse-torrent')\nconst Piece = require('torrent-piece')\nconst pump = require('pump')\nconst queueMicrotask = require('queue-microtask')\nconst randomIterate = require('random-iterate')\nconst sha1 = require('simple-sha1')\nconst speedometer = require('speedometer')\nconst utMetadata = require('ut_metadata')\nconst utPex = require('ut_pex') // browser exclude\n\nconst File = require('./file.js')\nconst Peer = require('./peer.js')\nconst RarityMap = require('./rarity-map.js')\nconst Server = require('./server.js') // browser exclude\nconst utp = require('./utp.js') // browser exclude\nconst WebConn = require('./webconn.js')\n\nconst debug = debugFactory('webtorrent:torrent')\nconst MAX_BLOCK_LENGTH = 128 * 1024\nconst PIECE_TIMEOUT = 30000\nconst CHOKE_TIMEOUT = 5000\nconst SPEED_THRESHOLD = 3 * Piece.BLOCK_LENGTH\n\nconst PIPELINE_MIN_DURATION = 0.5\nconst PIPELINE_MAX_DURATION = 1\n\nconst RECHOKE_INTERVAL = 10000 // 10 seconds\nconst RECHOKE_OPTIMISTIC_DURATION = 2 // 30 seconds\n\n// IndexedDB chunk stores used in the browser benefit from high concurrency\nconst FILESYSTEM_CONCURRENCY = process.browser ? cpus().length : 2\n\nconst RECONNECT_WAIT = [1000, 5000, 15000]\n\nconst VERSION = require('../package.json').version\nconst USER_AGENT = `WebTorrent/${VERSION} (https://webtorrent.io)`\n\nlet TMP\ntry {\n TMP = path.join(fs.statSync('/tmp') && '/tmp', 'webtorrent')\n} catch (err) {\n TMP = path.join(typeof os.tmpdir === 'function' ? os.tmpdir() : '/', 'webtorrent')\n}\n\nclass Torrent extends EventEmitter {\n constructor (torrentId, client, opts) {\n super()\n\n this._debugId = 'unknown infohash'\n this.client = client\n\n this.announce = opts.announce\n this.urlList = opts.urlList\n\n this.path = opts.path || TMP\n this.addUID = opts.addUID || false\n this.skipVerify = !!opts.skipVerify\n this._store = opts.store || FSChunkStore\n this._preloadedStore = opts.preloadedStore || null\n this._storeCacheSlots = opts.storeCacheSlots !== undefined ? opts.storeCacheSlots : 20\n this._destroyStoreOnDestroy = opts.destroyStoreOnDestroy || false\n this._getAnnounceOpts = opts.getAnnounceOpts\n\n // if defined, `opts.private` overrides default privacy of torrent\n if (typeof opts.private === 'boolean') this.private = opts.private\n\n this.strategy = opts.strategy || 'sequential'\n\n this.maxWebConns = opts.maxWebConns || 4\n\n this._rechokeNumSlots = (opts.uploads === false || opts.uploads === 0)\n ? 0\n : (+opts.uploads || 10)\n this._rechokeOptimisticWire = null\n this._rechokeOptimisticTime = 0\n this._rechokeIntervalId = null\n\n this.ready = false\n this.destroyed = false\n this.paused = opts.paused || false\n this.done = false\n\n this.metadata = null\n this.store = null\n this.storeOpts = opts.storeOpts\n this.files = []\n this.pieces = []\n\n this._amInterested = false\n this._selections = []\n this._critical = []\n\n this.wires = [] // open wires (added *after* handshake)\n\n this._queue = [] // queue of outgoing tcp peers to connect to\n this._peers = {} // connected peers (addr/peerId -> Peer)\n this._peersLength = 0 // number of elements in `this._peers` (cache, for perf)\n\n // stats\n this.received = 0\n this.uploaded = 0\n this._downloadSpeed = speedometer()\n this._uploadSpeed = speedometer()\n\n // for cleanup\n this._servers = []\n this._xsRequests = []\n\n // TODO: remove this and expose a hook instead\n // optimization: don't recheck every file if it hasn't changed\n this._fileModtimes = opts.fileModtimes\n\n if (torrentId !== null) this._onTorrentId(torrentId)\n\n this._debug('new torrent')\n }\n\n get timeRemaining () {\n if (this.done) return 0\n if (this.downloadSpeed === 0) return Infinity\n return ((this.length - this.downloaded) / this.downloadSpeed) * 1000\n }\n\n get downloaded () {\n if (!this.bitfield) return 0\n let downloaded = 0\n for (let index = 0, len = this.pieces.length; index < len; ++index) {\n if (this.bitfield.get(index)) { // verified data\n downloaded += (index === len - 1) ? this.lastPieceLength : this.pieceLength\n } else { // \"in progress\" data\n const piece = this.pieces[index]\n downloaded += (piece.length - piece.missing)\n }\n }\n return downloaded\n }\n\n // TODO: re-enable this. The number of missing pieces. Used to implement 'end game' mode.\n // Object.defineProperty(Storage.prototype, 'numMissing', {\n // get: function () {\n // var self = this\n // var numMissing = self.pieces.length\n // for (var index = 0, len = self.pieces.length; index < len; index++) {\n // numMissing -= self.bitfield.get(index)\n // }\n // return numMissing\n // }\n // })\n\n get downloadSpeed () { return this._downloadSpeed() }\n\n get uploadSpeed () { return this._uploadSpeed() }\n\n get progress () { return this.length ? this.downloaded / this.length : 0 }\n\n get ratio () { return this.uploaded / (this.received || this.length) }\n\n get numPeers () { return this.wires.length }\n\n get torrentFileBlobURL () {\n if (typeof window === 'undefined') throw new Error('browser-only property')\n if (!this.torrentFile) return null\n return URL.createObjectURL(\n new Blob([this.torrentFile], { type: 'application/x-bittorrent' })\n )\n }\n\n get _numQueued () {\n return this._queue.length + (this._peersLength - this._numConns)\n }\n\n get _numConns () {\n let numConns = 0\n for (const id in this._peers) {\n if (this._peers[id].connected) numConns += 1\n }\n return numConns\n }\n\n _onTorrentId (torrentId) {\n if (this.destroyed) return\n\n let parsedTorrent\n try { parsedTorrent = parseTorrent(torrentId) } catch (err) {}\n if (parsedTorrent) {\n // Attempt to set infoHash property synchronously\n this.infoHash = parsedTorrent.infoHash\n this._debugId = parsedTorrent.infoHash.toString('hex').substring(0, 7)\n queueMicrotask(() => {\n if (this.destroyed) return\n this._onParsedTorrent(parsedTorrent)\n })\n } else {\n // If torrentId failed to parse, it could be in a form that requires an async\n // operation, i.e. http/https link, filesystem path, or Blob.\n parseTorrent.remote(torrentId, (err, parsedTorrent) => {\n if (this.destroyed) return\n if (err) return this._destroy(err)\n this._onParsedTorrent(parsedTorrent)\n })\n }\n }\n\n _onParsedTorrent (parsedTorrent) {\n if (this.destroyed) return\n\n this._processParsedTorrent(parsedTorrent)\n\n if (!this.infoHash) {\n return this._destroy(new Error('Malformed torrent data: No info hash'))\n }\n\n this._rechokeIntervalId = setInterval(() => {\n this._rechoke()\n }, RECHOKE_INTERVAL)\n if (this._rechokeIntervalId.unref) this._rechokeIntervalId.unref()\n\n // Private 'infoHash' event allows client.add to check for duplicate torrents and\n // destroy them before the normal 'infoHash' event is emitted. Prevents user\n // applications from needing to deal with duplicate 'infoHash' events.\n this.emit('_infoHash', this.infoHash)\n if (this.destroyed) return\n\n this.emit('infoHash', this.infoHash)\n if (this.destroyed) return // user might destroy torrent in event handler\n\n if (this.client.listening) {\n this._onListening()\n } else {\n this.client.once('listening', () => {\n this._onListening()\n })\n }\n }\n\n _processParsedTorrent (parsedTorrent) {\n this._debugId = parsedTorrent.infoHash.toString('hex').substring(0, 7)\n\n if (typeof this.private !== 'undefined') {\n // `private` option overrides default, only if it's defined\n parsedTorrent.private = this.private\n }\n\n if (this.announce) {\n // Allow specifying trackers via `opts` parameter\n parsedTorrent.announce = parsedTorrent.announce.concat(this.announce)\n }\n\n if (this.client.tracker && global.WEBTORRENT_ANNOUNCE && !parsedTorrent.private) {\n // So `webtorrent-hybrid` can force specific trackers to be used\n parsedTorrent.announce = parsedTorrent.announce.concat(global.WEBTORRENT_ANNOUNCE)\n }\n\n if (this.urlList) {\n // Allow specifying web seeds via `opts` parameter\n parsedTorrent.urlList = parsedTorrent.urlList.concat(this.urlList)\n }\n\n // remove duplicates by converting to Set and back\n parsedTorrent.announce = Array.from(new Set(parsedTorrent.announce))\n parsedTorrent.urlList = Array.from(new Set(parsedTorrent.urlList))\n\n Object.assign(this, parsedTorrent)\n\n this.magnetURI = parseTorrent.toMagnetURI(parsedTorrent)\n this.torrentFile = parseTorrent.toTorrentFile(parsedTorrent)\n }\n\n _onListening () {\n if (this.destroyed) return\n\n if (this.info) {\n // if full metadata was included in initial torrent id, use it immediately. Otherwise,\n // wait for torrent-discovery to find peers and ut_metadata to get the metadata.\n this._onMetadata(this)\n } else {\n if (this.xs) this._getMetadataFromServer()\n this._startDiscovery()\n }\n }\n\n _startDiscovery () {\n if (this.discovery || this.destroyed) return\n\n let trackerOpts = this.client.tracker\n if (trackerOpts) {\n trackerOpts = Object.assign({}, this.client.tracker, {\n getAnnounceOpts: () => {\n if (this.destroyed) return\n\n const opts = {\n uploaded: this.uploaded,\n downloaded: this.downloaded,\n left: Math.max(this.length - this.downloaded, 0)\n }\n if (this.client.tracker.getAnnounceOpts) {\n Object.assign(opts, this.client.tracker.getAnnounceOpts())\n }\n if (this._getAnnounceOpts) {\n // TODO: consider deprecating this, as it's redundant with the former case\n Object.assign(opts, this._getAnnounceOpts())\n }\n return opts\n }\n })\n }\n\n // add BEP09 peer-address\n if (this.peerAddresses) {\n this.peerAddresses.forEach(peer => this.addPeer(peer))\n }\n\n // begin discovering peers via DHT and trackers\n this.discovery = new Discovery({\n infoHash: this.infoHash,\n announce: this.announce,\n peerId: this.client.peerId,\n dht: !this.private && this.client.dht,\n tracker: trackerOpts,\n port: this.client.torrentPort,\n userAgent: USER_AGENT,\n lsd: this.client.lsd\n })\n\n this.discovery.on('error', (err) => {\n this._destroy(err)\n })\n\n this.discovery.on('peer', (peer, source) => {\n this._debug('peer %s discovered via %s', peer, source)\n // Don't create new outgoing TCP connections when torrent is done\n if (typeof peer === 'string' && this.done) return\n this.addPeer(peer)\n })\n\n this.discovery.on('trackerAnnounce', () => {\n this.emit('trackerAnnounce')\n if (this.numPeers === 0) this.emit('noPeers', 'tracker')\n })\n\n this.discovery.on('dhtAnnounce', () => {\n this.emit('dhtAnnounce')\n if (this.numPeers === 0) this.emit('noPeers', 'dht')\n })\n\n this.discovery.on('warning', (err) => {\n this.emit('warning', err)\n })\n }\n\n _getMetadataFromServer () {\n // to allow function hoisting\n const self = this\n\n const urls = Array.isArray(this.xs) ? this.xs : [this.xs]\n\n const tasks = urls.map(url => cb => {\n getMetadataFromURL(url, cb)\n })\n parallel(tasks)\n\n function getMetadataFromURL (url, cb) {\n if (url.indexOf('http://') !== 0 && url.indexOf('https://') !== 0) {\n self.emit('warning', new Error(`skipping non-http xs param: ${url}`))\n return cb(null)\n }\n\n const opts = {\n url,\n method: 'GET',\n headers: {\n 'user-agent': USER_AGENT\n }\n }\n let req\n try {\n req = get.concat(opts, onResponse)\n } catch (err) {\n self.emit('warning', new Error(`skipping invalid url xs param: ${url}`))\n return cb(null)\n }\n\n self._xsRequests.push(req)\n\n function onResponse (err, res, torrent) {\n if (self.destroyed) return cb(null)\n if (self.metadata) return cb(null)\n\n if (err) {\n self.emit('warning', new Error(`http error from xs param: ${url}`))\n return cb(null)\n }\n if (res.statusCode !== 200) {\n self.emit('warning', new Error(`non-200 status code ${res.statusCode} from xs param: ${url}`))\n return cb(null)\n }\n\n let parsedTorrent\n try {\n parsedTorrent = parseTorrent(torrent)\n } catch (err) {}\n\n if (!parsedTorrent) {\n self.emit('warning', new Error(`got invalid torrent file from xs param: ${url}`))\n return cb(null)\n }\n\n if (parsedTorrent.infoHash !== self.infoHash) {\n self.emit('warning', new Error(`got torrent file with incorrect info hash from xs param: ${url}`))\n return cb(null)\n }\n\n self._onMetadata(parsedTorrent)\n cb(null)\n }\n }\n }\n\n /**\n * Called when the full torrent metadata is received.\n */\n _onMetadata (metadata) {\n if (this.metadata || this.destroyed) return\n this._debug('got metadata')\n\n this._xsRequests.forEach(req => {\n req.abort()\n })\n this._xsRequests = []\n\n let parsedTorrent\n if (metadata && metadata.infoHash) {\n // `metadata` is a parsed torrent (from parse-torrent module)\n parsedTorrent = metadata\n } else {\n try {\n parsedTorrent = parseTorrent(metadata)\n } catch (err) {\n return this._destroy(err)\n }\n }\n\n this._processParsedTorrent(parsedTorrent)\n this.metadata = this.torrentFile\n\n // add web seed urls (BEP19)\n if (this.client.enableWebSeeds) {\n this.urlList.forEach(url => {\n this.addWebSeed(url)\n })\n }\n\n this._rarityMap = new RarityMap(this)\n\n this.files = this.files.map(file => new File(this, file))\n\n let rawStore = this._preloadedStore\n if (!rawStore) {\n rawStore = new this._store(this.pieceLength, {\n ...this.storeOpts,\n torrent: this,\n path: this.path,\n files: this.files,\n length: this.length,\n name: this.name + ' - ' + this.infoHash.slice(0, 8),\n addUID: this.addUID\n })\n }\n\n // don't use the cache if the store is already in memory\n if (this._storeCacheSlots > 0 && !(rawStore instanceof MemoryChunkStore)) {\n rawStore = new CacheChunkStore(rawStore, {\n max: this._storeCacheSlots\n })\n }\n\n this.store = new ImmediateChunkStore(\n rawStore\n )\n\n // Select only specified files (BEP53) http://www.bittorrent.org/beps/bep_0053.html\n if (this.so) {\n this.files.forEach((v, i) => {\n if (this.so.includes(i)) {\n this.files[i].select()\n } else {\n this.files[i].deselect()\n }\n })\n } else {\n // start off selecting the entire torrent with low priority\n if (this.pieces.length !== 0) {\n this.select(0, this.pieces.length - 1, false)\n }\n }\n\n this._hashes = this.pieces\n\n this.pieces = this.pieces.map((hash, i) => {\n const pieceLength = (i === this.pieces.length - 1)\n ? this.lastPieceLength\n : this.pieceLength\n return new Piece(pieceLength)\n })\n\n this._reservations = this.pieces.map(() => [])\n\n this.bitfield = new BitField(this.pieces.length)\n\n this.wires.forEach(wire => {\n // If we didn't have the metadata at the time ut_metadata was initialized for this\n // wire, we still want to make it available to the peer in case they request it.\n if (wire.ut_metadata) wire.ut_metadata.setMetadata(this.metadata)\n\n this._onWireWithMetadata(wire)\n })\n\n // Emit 'metadata' before 'ready' and 'done'\n this.emit('metadata')\n\n // User might destroy torrent in response to 'metadata' event\n if (this.destroyed) return\n\n if (this.skipVerify) {\n // Skip verifying exisitng data and just assume it's correct\n this._markAllVerified()\n this._onStore()\n } else {\n const onPiecesVerified = (err) => {\n if (err) return this._destroy(err)\n this._debug('done verifying')\n this._onStore()\n }\n\n this._debug('verifying existing torrent data')\n if (this._fileModtimes && this._store === FSChunkStore) {\n // don't verify if the files haven't been modified since we last checked\n this.getFileModtimes((err, fileModtimes) => {\n if (err) return this._destroy(err)\n\n const unchanged = this.files.map((_, index) => fileModtimes[index] === this._fileModtimes[index]).every(x => x)\n\n if (unchanged) {\n this._markAllVerified()\n this._onStore()\n } else {\n this._verifyPieces(onPiecesVerified)\n }\n })\n } else {\n this._verifyPieces(onPiecesVerified)\n }\n }\n }\n\n /*\n * TODO: remove this\n * Gets the last modified time of every file on disk for this torrent.\n * Only valid in Node, not in the browser.\n */\n getFileModtimes (cb) {\n const ret = []\n parallelLimit(this.files.map((file, index) => cb => {\n const filePath = this.addUID ? path.join(this.name + ' - ' + this.infoHash.slice(0, 8)) : path.join(this.path, file.path)\n fs.stat(filePath, (err, stat) => {\n if (err && err.code !== 'ENOENT') return cb(err)\n ret[index] = stat && stat.mtime.getTime()\n cb(null)\n })\n }), FILESYSTEM_CONCURRENCY, err => {\n this._debug('done getting file modtimes')\n cb(err, ret)\n })\n }\n\n _verifyPieces (cb) {\n parallelLimit(this.pieces.map((piece, index) => cb => {\n if (this.destroyed) return cb(new Error('torrent is destroyed'))\n\n const getOpts = {}\n // Specify length for the last piece in case it is zero-padded\n if (index === this.pieces.length - 1) {\n getOpts.length = this.lastPieceLength\n }\n this.store.get(index, getOpts, (err, buf) => {\n if (this.destroyed) return cb(new Error('torrent is destroyed'))\n\n if (err) return queueMicrotask(() => cb(null)) // ignore error\n sha1(buf, hash => {\n if (this.destroyed) return cb(new Error('torrent is destroyed'))\n\n if (hash === this._hashes[index]) {\n this._debug('piece verified %s', index)\n this._markVerified(index)\n } else {\n this._debug('piece invalid %s', index)\n }\n cb(null)\n })\n })\n }), FILESYSTEM_CONCURRENCY, cb)\n }\n\n rescanFiles (cb) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n if (!cb) cb = noop\n\n this._verifyPieces((err) => {\n if (err) {\n this._destroy(err)\n return cb(err)\n }\n\n this._checkDone()\n cb(null)\n })\n }\n\n _markAllVerified () {\n for (let index = 0; index < this.pieces.length; index++) {\n this._markVerified(index)\n }\n }\n\n _markVerified (index) {\n this.pieces[index] = null\n this._reservations[index] = null\n this.bitfield.set(index, true)\n }\n\n _hasAllPieces () {\n for (let index = 0; index < this.pieces.length; index++) {\n if (!this.bitfield.get(index)) return false\n }\n return true\n }\n\n _hasNoPieces () {\n return !this._hasMorePieces(0)\n }\n\n _hasMorePieces (threshold) {\n let count = 0\n for (let index = 0; index < this.pieces.length; index++) {\n if (this.bitfield.get(index)) {\n count += 1\n if (count > threshold) return true\n }\n }\n return false\n }\n\n /**\n * Called when the metadata, listening server, and underlying chunk store is initialized.\n */\n _onStore () {\n if (this.destroyed) return\n this._debug('on store')\n\n // Start discovery before emitting 'ready'\n this._startDiscovery()\n\n this.ready = true\n this.emit('ready')\n\n // Files may start out done if the file was already in the store\n this._checkDone()\n\n // In case any selections were made before torrent was ready\n this._updateSelections()\n }\n\n destroy (opts, cb) {\n if (typeof opts === 'function') return this.destroy(null, opts)\n\n this._destroy(null, opts, cb)\n }\n\n _destroy (err, opts, cb) {\n if (typeof opts === 'function') return this._destroy(err, null, opts)\n if (this.destroyed) return\n this.destroyed = true\n this._debug('destroy')\n\n this.client._remove(this)\n\n clearInterval(this._rechokeIntervalId)\n\n this._xsRequests.forEach(req => {\n req.abort()\n })\n\n if (this._rarityMap) {\n this._rarityMap.destroy()\n }\n\n for (const id in this._peers) {\n this.removePeer(id)\n }\n\n this.files.forEach(file => {\n if (file instanceof File) file._destroy()\n })\n\n const tasks = this._servers.map(server => cb => {\n server.destroy(cb)\n })\n\n if (this.discovery) {\n tasks.push(cb => {\n this.discovery.destroy(cb)\n })\n }\n\n if (this.store) {\n let destroyStore = this._destroyStoreOnDestroy\n if (opts && opts.destroyStore !== undefined) {\n destroyStore = opts.destroyStore\n }\n tasks.push(cb => {\n if (destroyStore) {\n this.store.destroy(cb)\n } else {\n this.store.close(cb)\n }\n })\n }\n\n parallel(tasks, cb)\n\n if (err) {\n // Torrent errors are emitted at `torrent.on('error')`. If there are no 'error'\n // event handlers on the torrent instance, then the error will be emitted at\n // `client.on('error')`. This prevents throwing an uncaught exception\n // (unhandled 'error' event), but it makes it impossible to distinguish client\n // errors versus torrent errors. Torrent errors are not fatal, and the client\n // is still usable afterwards. Therefore, always listen for errors in both\n // places (`client.on('error')` and `torrent.on('error')`).\n if (this.listenerCount('error') === 0) {\n this.client.emit('error', err)\n } else {\n this.emit('error', err)\n }\n }\n\n this.emit('close')\n\n this.client = null\n this.files = []\n this.discovery = null\n this.store = null\n this._rarityMap = null\n this._peers = null\n this._servers = null\n this._xsRequests = null\n }\n\n addPeer (peer) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n if (!this.infoHash) throw new Error('addPeer() must not be called before the `infoHash` event')\n\n let host\n\n if (this.client.blocked) {\n if (typeof peer === 'string') {\n let parts\n try {\n parts = addrToIPPort(peer)\n } catch (e) {\n this._debug('ignoring peer: invalid %s', peer)\n this.emit('invalidPeer', peer)\n return false\n }\n host = parts[0]\n } else if (typeof peer.remoteAddress === 'string') {\n host = peer.remoteAddress\n }\n\n if (host && this.client.blocked.contains(host)) {\n this._debug('ignoring peer: blocked %s', peer)\n if (typeof peer !== 'string') peer.destroy()\n this.emit('blockedPeer', peer)\n return false\n }\n }\n\n // if the utp connection fails to connect, then it is replaced with a tcp connection to the same ip:port\n\n const type = (this.client.utp && this._isIPv4(host)) ? 'utp' : 'tcp'\n const wasAdded = !!this._addPeer(peer, type)\n\n if (wasAdded) {\n this.emit('peer', peer)\n } else {\n this.emit('invalidPeer', peer)\n }\n return wasAdded\n }\n\n _addPeer (peer, type) {\n if (this.destroyed) {\n if (typeof peer !== 'string') peer.destroy()\n return null\n }\n if (typeof peer === 'string' && !this._validAddr(peer)) {\n this._debug('ignoring peer: invalid %s', peer)\n return null\n }\n\n const id = (peer && peer.id) || peer\n if (this._peers[id]) {\n this._debug('ignoring peer: duplicate (%s)', id)\n if (typeof peer !== 'string') peer.destroy()\n return null\n }\n\n if (this.paused) {\n this._debug('ignoring peer: torrent is paused')\n if (typeof peer !== 'string') peer.destroy()\n return null\n }\n\n this._debug('add peer %s', id)\n\n let newPeer\n if (typeof peer === 'string') {\n // `peer` is an addr (\"ip:port\" string)\n newPeer = type === 'utp'\n ? Peer.createUTPOutgoingPeer(peer, this, this.client.throttleGroups)\n : Peer.createTCPOutgoingPeer(peer, this, this.client.throttleGroups)\n } else {\n // `peer` is a WebRTC connection (simple-peer)\n newPeer = Peer.createWebRTCPeer(peer, this, this.client.throttleGroups)\n }\n\n this._registerPeer(newPeer)\n\n if (typeof peer === 'string') {\n // `peer` is an addr (\"ip:port\" string)\n this._queue.push(newPeer)\n this._drain()\n }\n\n return newPeer\n }\n\n addWebSeed (urlOrConn) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n\n let id\n let conn\n if (typeof urlOrConn === 'string') {\n id = urlOrConn\n\n if (!/^https?:\\/\\/.+/.test(id)) {\n this.emit('warning', new Error(`ignoring invalid web seed: ${id}`))\n this.emit('invalidPeer', id)\n return\n }\n\n if (this._peers[id]) {\n this.emit('warning', new Error(`ignoring duplicate web seed: ${id}`))\n this.emit('invalidPeer', id)\n return\n }\n\n conn = new WebConn(id, this)\n } else if (urlOrConn && typeof urlOrConn.connId === 'string') {\n conn = urlOrConn\n id = conn.connId\n\n if (this._peers[id]) {\n this.emit('warning', new Error(`ignoring duplicate web seed: ${id}`))\n this.emit('invalidPeer', id)\n return\n }\n } else {\n this.emit('warning', new Error('addWebSeed must be passed a string or connection object with id property'))\n return\n }\n\n this._debug('add web seed %s', id)\n\n const newPeer = Peer.createWebSeedPeer(conn, id, this, this.client.throttleGroups)\n\n this._registerPeer(newPeer)\n\n this.emit('peer', id)\n }\n\n /**\n * Called whenever a new incoming TCP peer connects to this torrent swarm. Called with a\n * peer that has already sent a handshake.\n */\n _addIncomingPeer (peer) {\n if (this.destroyed) return peer.destroy(new Error('torrent is destroyed'))\n if (this.paused) return peer.destroy(new Error('torrent is paused'))\n\n this._debug('add incoming peer %s', peer.id)\n\n this._registerPeer(peer)\n }\n\n _registerPeer (newPeer) {\n newPeer.on('download', downloaded => {\n if (this.destroyed) return\n this.received += downloaded\n this._downloadSpeed(downloaded)\n this.client._downloadSpeed(downloaded)\n this.emit('download', downloaded)\n if (this.destroyed) return\n this.client.emit('download', downloaded)\n })\n\n newPeer.on('upload', uploaded => {\n if (this.destroyed) return\n this.uploaded += uploaded\n this._uploadSpeed(uploaded)\n this.client._uploadSpeed(uploaded)\n this.emit('upload', uploaded)\n if (this.destroyed) return\n this.client.emit('upload', uploaded)\n })\n\n this._peers[newPeer.id] = newPeer\n this._peersLength += 1\n }\n\n removePeer (peer) {\n const id = (peer && peer.id) || peer\n peer = this._peers[id]\n\n if (!peer) return\n\n this._debug('removePeer %s', id)\n\n delete this._peers[id]\n this._peersLength -= 1\n\n peer.destroy()\n\n // If torrent swarm was at capacity before, try to open a new connection now\n this._drain()\n }\n\n select (start, end, priority, notify) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n\n if (start < 0 || end < start || this.pieces.length <= end) {\n throw new Error(`invalid selection ${start} : ${end}`)\n }\n priority = Number(priority) || 0\n\n this._debug('select %s-%s (priority %s)', start, end, priority)\n\n this._selections.push({\n from: start,\n to: end,\n offset: 0,\n priority,\n notify: notify || noop\n })\n\n this._selections.sort((a, b) => b.priority - a.priority)\n\n this._updateSelections()\n }\n\n deselect (start, end, priority) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n\n priority = Number(priority) || 0\n this._debug('deselect %s-%s (priority %s)', start, end, priority)\n\n for (let i = 0; i < this._selections.length; ++i) {\n const s = this._selections[i]\n if (s.from === start && s.to === end && s.priority === priority) {\n this._selections.splice(i, 1)\n break\n }\n }\n\n this._updateSelections()\n }\n\n critical (start, end) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n\n this._debug('critical %s-%s', start, end)\n\n for (let i = start; i <= end; ++i) {\n this._critical[i] = true\n }\n\n this._updateSelections()\n }\n\n _onWire (wire, addr) {\n this._debug('got wire %s (%s)', wire._debugId, addr || 'Unknown')\n\n this.wires.push(wire)\n\n if (addr) {\n // Sometimes RTCPeerConnection.getStats() doesn't return an ip:port for peers\n const parts = addrToIPPort(addr)\n wire.remoteAddress = parts[0]\n wire.remotePort = parts[1]\n }\n\n // When peer sends PORT message, add that DHT node to routing table\n if (this.client.dht && this.client.dht.listening) {\n wire.on('port', port => {\n if (this.destroyed || this.client.dht.destroyed) {\n return\n }\n if (!wire.remoteAddress) {\n return this._debug('ignoring PORT from peer with no address')\n }\n if (port === 0 || port > 65536) {\n return this._debug('ignoring invalid PORT from peer')\n }\n\n this._debug('port: %s (from %s)', port, addr)\n this.client.dht.addNode({ host: wire.remoteAddress, port })\n })\n }\n\n wire.on('timeout', () => {\n this._debug('wire timeout (%s)', addr)\n // TODO: this might be destroying wires too eagerly\n wire.destroy()\n })\n\n // Timeout for piece requests to this peer\n if (wire.type !== 'webSeed') { // webseeds always send 'unhave' on http timeout\n wire.setTimeout(PIECE_TIMEOUT, true)\n }\n\n // Send KEEP-ALIVE (every 60s) so peers will not disconnect the wire\n wire.setKeepAlive(true)\n\n // use ut_metadata extension\n wire.use(utMetadata(this.metadata))\n\n wire.ut_metadata.on('warning', err => {\n this._debug('ut_metadata warning: %s', err.message)\n })\n\n if (!this.metadata) {\n wire.ut_metadata.on('metadata', metadata => {\n this._debug('got metadata via ut_metadata')\n this._onMetadata(metadata)\n })\n wire.ut_metadata.fetch()\n }\n\n // use ut_pex extension if the torrent is not flagged as private\n if (typeof utPex === 'function' && !this.private) {\n wire.use(utPex())\n\n wire.ut_pex.on('peer', peer => {\n // Only add potential new peers when we're not seeding\n if (this.done) return\n this._debug('ut_pex: got peer: %s (from %s)', peer, addr)\n this.addPeer(peer)\n })\n\n wire.ut_pex.on('dropped', peer => {\n // the remote peer believes a given peer has been dropped from the torrent swarm.\n // if we're not currently connected to it, then remove it from the queue.\n const peerObj = this._peers[peer]\n if (peerObj && !peerObj.connected) {\n this._debug('ut_pex: dropped peer: %s (from %s)', peer, addr)\n this.removePeer(peer)\n }\n })\n\n wire.once('close', () => {\n // Stop sending updates to remote peer\n wire.ut_pex.reset()\n })\n }\n\n wire.use(ltDontHave())\n\n // Hook to allow user-defined `bittorrent-protocol` extensions\n // More info: https://github.com/webtorrent/bittorrent-protocol#extension-api\n this.emit('wire', wire, addr)\n\n if (this.metadata) {\n queueMicrotask(() => {\n // This allows wire.handshake() to be called (by Peer.onHandshake) before any\n // messages get sent on the wire\n this._onWireWithMetadata(wire)\n })\n }\n }\n\n _onWireWithMetadata (wire) {\n let timeoutId = null\n\n const onChokeTimeout = () => {\n if (this.destroyed || wire.destroyed) return\n\n if (this._numQueued > 2 * (this._numConns - this.numPeers) &&\n wire.amInterested) {\n wire.destroy()\n } else {\n timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT)\n if (timeoutId.unref) timeoutId.unref()\n }\n }\n\n let i\n const updateSeedStatus = () => {\n if (wire.peerPieces.buffer.length !== this.bitfield.buffer.length) return\n for (i = 0; i < this.pieces.length; ++i) {\n if (!wire.peerPieces.get(i)) return\n }\n wire.isSeeder = true\n wire.choke() // always choke seeders\n }\n\n wire.on('bitfield', () => {\n updateSeedStatus()\n this._update()\n this._updateWireInterest(wire)\n })\n\n wire.on('have', () => {\n updateSeedStatus()\n this._update()\n this._updateWireInterest(wire)\n })\n\n wire.lt_donthave.on('donthave', () => {\n updateSeedStatus()\n this._update()\n this._updateWireInterest(wire)\n })\n\n // fast extension (BEP6)\n wire.on('have-all', () => {\n wire.isSeeder = true\n wire.choke() // always choke seeders\n this._update()\n this._updateWireInterest(wire)\n })\n\n // fast extension (BEP6)\n wire.on('have-none', () => {\n wire.isSeeder = false\n this._update()\n this._updateWireInterest(wire)\n })\n\n // fast extension (BEP6)\n wire.on('allowed-fast', (index) => {\n this._update()\n })\n\n wire.once('interested', () => {\n wire.unchoke()\n })\n\n wire.once('close', () => {\n clearTimeout(timeoutId)\n })\n\n wire.on('choke', () => {\n clearTimeout(timeoutId)\n timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT)\n if (timeoutId.unref) timeoutId.unref()\n })\n\n wire.on('unchoke', () => {\n clearTimeout(timeoutId)\n this._update()\n })\n\n wire.on('request', (index, offset, length, cb) => {\n if (length > MAX_BLOCK_LENGTH) {\n // Per spec, disconnect from peers that request >128KB\n return wire.destroy()\n }\n if (this.pieces[index]) return\n this.store.get(index, { offset, length }, cb)\n })\n\n // always send bitfield or equivalent fast extension message (required)\n if (wire.hasFast && this._hasAllPieces()) wire.haveAll()\n else if (wire.hasFast && this._hasNoPieces()) wire.haveNone()\n else wire.bitfield(this.bitfield)\n\n // initialize interest in case bitfield message was already received before above handler was registered\n this._updateWireInterest(wire)\n\n // Send PORT message to peers that support DHT\n if (wire.peerExtensions.dht && this.client.dht && this.client.dht.listening) {\n wire.port(this.client.dht.address().port)\n }\n\n if (wire.type !== 'webSeed') { // do not choke on webseeds\n timeoutId = setTimeout(onChokeTimeout, CHOKE_TIMEOUT)\n if (timeoutId.unref) timeoutId.unref()\n }\n\n wire.isSeeder = false\n updateSeedStatus()\n }\n\n /**\n * Called on selection changes.\n */\n _updateSelections () {\n if (!this.ready || this.destroyed) return\n\n queueMicrotask(() => {\n this._gcSelections()\n })\n this._updateInterest()\n this._update()\n }\n\n /**\n * Garbage collect selections with respect to the store's current state.\n */\n _gcSelections () {\n for (let i = 0; i < this._selections.length; ++i) {\n const s = this._selections[i]\n const oldOffset = s.offset\n\n // check for newly downloaded pieces in selection\n while (this.bitfield.get(s.from + s.offset) && s.from + s.offset < s.to) {\n s.offset += 1\n }\n\n if (oldOffset !== s.offset) s.notify()\n if (s.to !== s.from + s.offset) continue\n if (!this.bitfield.get(s.from + s.offset)) continue\n\n this._selections.splice(i, 1) // remove fully downloaded selection\n i -= 1 // decrement i to offset splice\n\n s.notify()\n this._updateInterest()\n }\n\n if (!this._selections.length) this.emit('idle')\n }\n\n /**\n * Update interested status for all peers.\n */\n _updateInterest () {\n const prev = this._amInterested\n this._amInterested = !!this._selections.length\n\n this.wires.forEach(wire => this._updateWireInterest(wire))\n\n if (prev === this._amInterested) return\n if (this._amInterested) this.emit('interested')\n else this.emit('uninterested')\n }\n\n _updateWireInterest (wire) {\n let interested = false\n for (let index = 0; index < this.pieces.length; ++index) {\n if (this.pieces[index] && wire.peerPieces.get(index)) {\n interested = true\n break\n }\n }\n\n if (interested) wire.interested()\n else wire.uninterested()\n }\n\n /**\n * Heartbeat to update all peers and their requests.\n */\n _update () {\n if (this.destroyed) return\n\n // update wires in random order for better request distribution\n const ite = randomIterate(this.wires)\n let wire\n while ((wire = ite())) {\n this._updateWireWrapper(wire)\n }\n }\n\n _updateWireWrapper (wire) {\n const self = this\n\n if (typeof window !== 'undefined' && typeof window.requestIdleCallback === 'function') {\n window.requestIdleCallback(() => { self._updateWire(wire) }, { timeout: 250 })\n } else {\n self._updateWire(wire)\n }\n }\n\n /**\n * Attempts to update a peer's requests\n */\n _updateWire (wire) {\n // to allow function hoisting\n const self = this\n\n const minOutstandingRequests = getBlockPipelineLength(wire, PIPELINE_MIN_DURATION)\n if (wire.requests.length >= minOutstandingRequests) return\n const maxOutstandingRequests = getBlockPipelineLength(wire, PIPELINE_MAX_DURATION)\n\n if (wire.peerChoking) {\n if (wire.hasFast && wire.peerAllowedFastSet.length > 0 &&\n !this._hasMorePieces(wire.peerAllowedFastSet.length - 1)) {\n requestAllowedFastSet()\n }\n return\n }\n\n if (!wire.downloaded) return validateWire()\n\n trySelectWire(false) || trySelectWire(true)\n\n function requestAllowedFastSet () {\n if (wire.requests.length >= maxOutstandingRequests) return false\n\n for (const piece of wire.peerAllowedFastSet) {\n if (wire.peerPieces.get(piece) && !self.bitfield.get(piece)) {\n while (self._request(wire, piece, false) &&\n wire.requests.length < maxOutstandingRequests) {\n // body intentionally empty\n // request all non-reserved blocks in this piece\n }\n }\n\n if (wire.requests.length < maxOutstandingRequests) continue\n\n return true\n }\n\n return false\n }\n\n function genPieceFilterFunc (start, end, tried, rank) {\n return i => i >= start && i <= end && !(i in tried) && wire.peerPieces.get(i) && (!rank || rank(i))\n }\n\n // TODO: Do we need both validateWire and trySelectWire?\n function validateWire () {\n if (wire.requests.length) return\n\n let i = self._selections.length\n while (i--) {\n const next = self._selections[i]\n let piece\n if (self.strategy === 'rarest') {\n const start = next.from + next.offset\n const end = next.to\n const len = end - start + 1\n const tried = {}\n let tries = 0\n const filter = genPieceFilterFunc(start, end, tried)\n\n while (tries < len) {\n piece = self._rarityMap.getRarestPiece(filter)\n if (piece < 0) break\n if (self._request(wire, piece, false)) return\n tried[piece] = true\n tries += 1\n }\n } else {\n for (piece = next.to; piece >= next.from + next.offset; --piece) {\n if (!wire.peerPieces.get(piece)) continue\n if (self._request(wire, piece, false)) return\n }\n }\n }\n\n // TODO: wire failed to validate as useful; should we close it?\n // probably not, since 'have' and 'bitfield' messages might be coming\n }\n\n function speedRanker () {\n const speed = wire.downloadSpeed() || 1\n if (speed > SPEED_THRESHOLD) return () => true\n\n const secs = Math.max(1, wire.requests.length) * Piece.BLOCK_LENGTH / speed\n let tries = 10\n let ptr = 0\n\n return index => {\n if (!tries || self.bitfield.get(index)) return true\n\n let missing = self.pieces[index].missing\n\n for (; ptr < self.wires.length; ptr++) {\n const otherWire = self.wires[ptr]\n const otherSpeed = otherWire.downloadSpeed()\n\n if (otherSpeed < SPEED_THRESHOLD) continue\n if (otherSpeed <= speed) continue\n if (!otherWire.peerPieces.get(index)) continue\n if ((missing -= otherSpeed * secs) > 0) continue\n\n tries--\n return false\n }\n\n return true\n }\n }\n\n function shufflePriority (i) {\n let last = i\n for (let j = i; j < self._selections.length && self._selections[j].priority; j++) {\n last = j\n }\n const tmp = self._selections[i]\n self._selections[i] = self._selections[last]\n self._selections[last] = tmp\n }\n\n function trySelectWire (hotswap) {\n if (wire.requests.length >= maxOutstandingRequests) return true\n const rank = speedRanker()\n\n for (let i = 0; i < self._selections.length; i++) {\n const next = self._selections[i]\n\n let piece\n if (self.strategy === 'rarest') {\n const start = next.from + next.offset\n const end = next.to\n const len = end - start + 1\n const tried = {}\n let tries = 0\n const filter = genPieceFilterFunc(start, end, tried, rank)\n\n while (tries < len) {\n piece = self._rarityMap.getRarestPiece(filter)\n if (piece < 0) break\n\n while (self._request(wire, piece, self._critical[piece] || hotswap) &&\n wire.requests.length < maxOutstandingRequests) {\n // body intentionally empty\n // request all non-reserved blocks in this piece\n }\n\n if (wire.requests.length < maxOutstandingRequests) {\n tried[piece] = true\n tries++\n continue\n }\n\n if (next.priority) shufflePriority(i)\n return true\n }\n } else {\n for (piece = next.from + next.offset; piece <= next.to; piece++) {\n if (!wire.peerPieces.get(piece) || !rank(piece)) continue\n\n while (self._request(wire, piece, self._critical[piece] || hotswap) &&\n wire.requests.length < maxOutstandingRequests) {\n // body intentionally empty\n // request all non-reserved blocks in piece\n }\n\n if (wire.requests.length < maxOutstandingRequests) continue\n\n if (next.priority) shufflePriority(i)\n return true\n }\n }\n }\n\n return false\n }\n }\n\n /**\n * Called periodically to update the choked status of all peers, handling optimistic\n * unchoking as described in BEP3.\n */\n _rechoke () {\n if (!this.ready) return\n\n // wires in increasing order of quality (pop() gives next best peer)\n const wireStack =\n this.wires\n .map(wire => ({ wire, random: Math.random() })) // insert a random seed for randomizing the sort\n .sort((objA, objB) => {\n const wireA = objA.wire\n const wireB = objB.wire\n\n // prefer peers that send us data faster\n if (wireA.downloadSpeed() !== wireB.downloadSpeed()) {\n return wireA.downloadSpeed() - wireB.downloadSpeed()\n }\n\n // then prefer peers that can download data from us faster\n if (wireA.uploadSpeed() !== wireB.uploadSpeed()) {\n return wireA.uploadSpeed() - wireB.uploadSpeed()\n }\n\n // then prefer already unchoked peers (to minimize fibrillation)\n if (wireA.amChoking !== wireB.amChoking) {\n return wireA.amChoking ? -1 : 1 // choking < unchoked\n }\n\n // otherwise random order\n return objA.random - objB.random\n })\n .map(obj => obj.wire) // return array of wires (remove random seed)\n\n if (this._rechokeOptimisticTime <= 0) {\n // clear old optimistic peer, so it can be rechoked normally and then replaced\n this._rechokeOptimisticWire = null\n } else {\n this._rechokeOptimisticTime -= 1\n }\n\n let numInterestedUnchoked = 0\n // leave one rechoke slot open for optimistic unchoking\n while (wireStack.length > 0 && numInterestedUnchoked < this._rechokeNumSlots - 1) {\n const wire = wireStack.pop() // next best quality peer\n\n if (wire.isSeeder || wire === this._rechokeOptimisticWire) {\n continue\n }\n\n wire.unchoke()\n\n // only stop unchoking once we fill the slots with interested peers that will actually download\n if (wire.peerInterested) {\n numInterestedUnchoked++\n }\n }\n\n // fill optimistic unchoke slot if empty\n if (this._rechokeOptimisticWire === null && this._rechokeNumSlots > 0) {\n // don't optimistically unchoke uninterested peers\n const remaining = wireStack.filter(wire => wire.peerInterested)\n\n if (remaining.length > 0) {\n // select random remaining (not yet unchoked) peer\n const newOptimisticPeer = remaining[randomInt(remaining.length)]\n\n newOptimisticPeer.unchoke()\n\n this._rechokeOptimisticWire = newOptimisticPeer\n\n this._rechokeOptimisticTime = RECHOKE_OPTIMISTIC_DURATION\n }\n }\n\n // choke the rest\n wireStack\n .filter(wire => wire !== this._rechokeOptimisticWire) // except the optimistically unchoked peer\n .forEach(wire => wire.choke())\n }\n\n /**\n * Attempts to cancel a slow block request from another wire such that the\n * given wire may effectively swap out the request for one of its own.\n */\n _hotswap (wire, index) {\n const speed = wire.downloadSpeed()\n if (speed < Piece.BLOCK_LENGTH) return false\n if (!this._reservations[index]) return false\n\n const r = this._reservations[index]\n if (!r) {\n return false\n }\n\n let minSpeed = Infinity\n let minWire\n\n let i\n for (i = 0; i < r.length; i++) {\n const otherWire = r[i]\n if (!otherWire || otherWire === wire) continue\n\n const otherSpeed = otherWire.downloadSpeed()\n if (otherSpeed >= SPEED_THRESHOLD) continue\n if (2 * otherSpeed > speed || otherSpeed > minSpeed) continue\n\n minWire = otherWire\n minSpeed = otherSpeed\n }\n\n if (!minWire) return false\n\n for (i = 0; i < r.length; i++) {\n if (r[i] === minWire) r[i] = null\n }\n\n for (i = 0; i < minWire.requests.length; i++) {\n const req = minWire.requests[i]\n if (req.piece !== index) continue\n\n this.pieces[index].cancel((req.offset / Piece.BLOCK_LENGTH) | 0)\n }\n\n this.emit('hotswap', minWire, wire, index)\n return true\n }\n\n /**\n * Attempts to request a block from the given wire.\n */\n _request (wire, index, hotswap) {\n const self = this\n const numRequests = wire.requests.length\n const isWebSeed = wire.type === 'webSeed'\n\n if (self.bitfield.get(index)) return false\n\n const maxOutstandingRequests = isWebSeed\n ? Math.min(\n getPiecePipelineLength(wire, PIPELINE_MAX_DURATION, self.pieceLength),\n self.maxWebConns\n )\n : getBlockPipelineLength(wire, PIPELINE_MAX_DURATION)\n\n if (numRequests >= maxOutstandingRequests) return false\n // var endGame = (wire.requests.length === 0 && self.store.numMissing < 30)\n\n const piece = self.pieces[index]\n let reservation = isWebSeed ? piece.reserveRemaining() : piece.reserve()\n\n if (reservation === -1 && hotswap && self._hotswap(wire, index)) {\n reservation = isWebSeed ? piece.reserveRemaining() : piece.reserve()\n }\n if (reservation === -1) return false\n\n let r = self._reservations[index]\n if (!r) r = self._reservations[index] = []\n let i = r.indexOf(null)\n if (i === -1) i = r.length\n r[i] = wire\n\n const chunkOffset = piece.chunkOffset(reservation)\n const chunkLength = isWebSeed ? piece.chunkLengthRemaining(reservation) : piece.chunkLength(reservation)\n\n wire.request(index, chunkOffset, chunkLength, function onChunk (err, chunk) {\n if (self.destroyed) return\n\n // TODO: what is this for?\n if (!self.ready) return self.once('ready', () => { onChunk(err, chunk) })\n\n if (r[i] === wire) r[i] = null\n\n if (piece !== self.pieces[index]) return onUpdateTick()\n\n if (err) {\n self._debug(\n 'error getting piece %s (offset: %s length: %s) from %s: %s',\n index, chunkOffset, chunkLength, `${wire.remoteAddress}:${wire.remotePort}`,\n err.message\n )\n isWebSeed ? piece.cancelRemaining(reservation) : piece.cancel(reservation)\n onUpdateTick()\n return\n }\n\n self._debug(\n 'got piece %s (offset: %s length: %s) from %s',\n index, chunkOffset, chunkLength, `${wire.remoteAddress}:${wire.remotePort}`\n )\n\n if (!piece.set(reservation, chunk, wire)) return onUpdateTick()\n\n const buf = piece.flush()\n\n // TODO: might need to set self.pieces[index] = null here since sha1 is async\n\n sha1(buf, hash => {\n if (self.destroyed) return\n\n if (hash === self._hashes[index]) {\n self._debug('piece verified %s', index)\n\n self.store.put(index, buf, err => {\n if (err) {\n self._destroy(err)\n return\n } else {\n self.pieces[index] = null\n self._markVerified(index)\n self.wires.forEach(wire => {\n wire.have(index)\n })\n }\n // We also check `self.destroyed` since `torrent.destroy()` could have been\n // called in the `torrent.on('done')` handler, triggered by `_checkDone()`.\n if (self._checkDone() && !self.destroyed) self.discovery.complete()\n onUpdateTick()\n })\n } else {\n self.pieces[index] = new Piece(piece.length)\n self.emit('warning', new Error(`Piece ${index} failed verification`))\n onUpdateTick()\n }\n })\n })\n\n function onUpdateTick () {\n queueMicrotask(() => { self._update() })\n }\n\n return true\n }\n\n _checkDone () {\n if (this.destroyed) return\n\n // are any new files done?\n this.files.forEach(file => {\n if (file.done) return\n for (let i = file._startPiece; i <= file._endPiece; ++i) {\n if (!this.bitfield.get(i)) return\n }\n file.done = true\n file.emit('done')\n this._debug(`file done: ${file.name}`)\n })\n\n // is the torrent done? (if all current selections are satisfied, or there are\n // no selections, then torrent is done)\n let done = true\n\n for (const selection of this._selections) {\n for (let piece = selection.from; piece <= selection.to; piece++) {\n if (!this.bitfield.get(piece)) {\n done = false\n break\n }\n }\n if (!done) break\n }\n\n if (!this.done && done) {\n this.done = true\n this._debug(`torrent done: ${this.infoHash}`)\n this.emit('done')\n } else {\n this.done = false\n }\n this._gcSelections()\n\n return done\n }\n\n load (streams, cb) {\n if (this.destroyed) throw new Error('torrent is destroyed')\n if (!this.ready) return this.once('ready', () => { this.load(streams, cb) })\n\n if (!Array.isArray(streams)) streams = [streams]\n if (!cb) cb = noop\n\n const readable = new MultiStream(streams)\n const writable = new ChunkStoreWriteStream(this.store, this.pieceLength)\n\n pump(readable, writable, err => {\n if (err) return cb(err)\n this._markAllVerified()\n this._checkDone()\n cb(null)\n })\n }\n\n createServer (requestListener) {\n if (typeof Server !== 'function') throw new Error('node.js-only method')\n if (this.destroyed) throw new Error('torrent is destroyed')\n const server = new Server(this, requestListener)\n this._servers.push(server)\n return server\n }\n\n pause () {\n if (this.destroyed) return\n this._debug('pause')\n this.paused = true\n }\n\n resume () {\n if (this.destroyed) return\n this._debug('resume')\n this.paused = false\n this._drain()\n }\n\n _debug () {\n const args = [].slice.call(arguments)\n args[0] = `[${this.client ? this.client._debugId : 'No Client'}] [${this._debugId}] ${args[0]}`\n debug(...args)\n }\n\n /**\n * Pop a peer off the FIFO queue and connect to it. When _drain() gets called,\n * the queue will usually have only one peer in it, except when there are too\n * many peers (over `this.maxConns`) in which case they will just sit in the\n * queue until another connection closes.\n */\n _drain () {\n this._debug('_drain numConns %s maxConns %s', this._numConns, this.client.maxConns)\n if (typeof net.connect !== 'function' || this.destroyed || this.paused ||\n this._numConns >= this.client.maxConns) {\n return\n }\n this._debug('drain (%s queued, %s/%s peers)', this._numQueued, this.numPeers, this.client.maxConns)\n\n const peer = this._queue.shift()\n if (!peer) return // queue could be empty\n\n this._debug('%s connect attempt to %s', peer.type, peer.addr)\n\n const parts = addrToIPPort(peer.addr)\n const opts = {\n host: parts[0],\n port: parts[1]\n }\n\n if (this.client.utp && peer.type === 'utpOutgoing') {\n peer.conn = utp.connect(opts.port, opts.host)\n } else {\n peer.conn = net.connect(opts)\n }\n\n const conn = peer.conn\n\n conn.once('connect', () => { peer.onConnect() })\n conn.once('error', err => { peer.destroy(err) })\n peer.startConnectTimeout()\n\n // When connection closes, attempt reconnect after timeout (with exponential backoff)\n conn.on('close', () => {\n if (this.destroyed) return\n\n if (peer.retries >= RECONNECT_WAIT.length) {\n if (this.client.utp) {\n const newPeer = this._addPeer(peer.addr, 'tcp')\n if (newPeer) newPeer.retries = 0\n } else {\n this._debug(\n 'conn %s closed: will not re-add (max %s attempts)',\n peer.addr, RECONNECT_WAIT.length\n )\n }\n return\n }\n\n const ms = RECONNECT_WAIT[peer.retries]\n this._debug(\n 'conn %s closed: will re-add to queue in %sms (attempt %s)',\n peer.addr, ms, peer.retries + 1\n )\n\n const reconnectTimeout = setTimeout(() => {\n if (this.destroyed) return\n const host = addrToIPPort(peer.addr)[0]\n const type = (this.client.utp && this._isIPv4(host)) ? 'utp' : 'tcp'\n const newPeer = this._addPeer(peer.addr, type)\n if (newPeer) newPeer.retries = peer.retries + 1\n }, ms)\n if (reconnectTimeout.unref) reconnectTimeout.unref()\n })\n }\n\n /**\n * Returns `true` if string is valid IPv4/6 address.\n * @param {string} addr\n * @return {boolean}\n */\n _validAddr (addr) {\n let parts\n try {\n parts = addrToIPPort(addr)\n } catch (e) {\n return false\n }\n const host = parts[0]\n const port = parts[1]\n return port > 0 && port < 65535 &&\n !(host === '127.0.0.1' && port === this.client.torrentPort)\n }\n\n /**\n * Return `true` if string is a valid IPv4 address.\n * @param {string} addr\n * @return {boolean}\n */\n _isIPv4 (addr) {\n const IPv4Pattern = /^((?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])[.]){3}(?:[0-9]|[1-9][0-9]|1[0-9][0-9]|2[0-4][0-9]|25[0-5])$/\n return IPv4Pattern.test(addr)\n }\n}\n\nfunction getBlockPipelineLength (wire, duration) {\n let length = 2 + Math.ceil(duration * wire.downloadSpeed() / Piece.BLOCK_LENGTH)\n\n // Honor reqq (maximum number of outstanding request messages) if specified by peer\n if (wire.peerExtendedHandshake) {\n const reqq = wire.peerExtendedHandshake.reqq\n if (typeof reqq === 'number' && reqq > 0) {\n length = Math.min(length, reqq)\n }\n }\n\n return length\n}\n\nfunction getPiecePipelineLength (wire, duration, pieceLength) {\n return 1 + Math.ceil(duration * wire.downloadSpeed() / pieceLength)\n}\n\n/**\n * Returns a random integer in [0,high)\n */\nfunction randomInt (high) {\n return Math.random() * high | 0\n}\n\nfunction noop () {}\n\nmodule.exports = Torrent\n","const { default: BitField } = require('bitfield')\nconst debugFactory = require('debug')\nconst get = require('simple-get')\nconst ltDontHave = require('lt_donthave')\nconst sha1 = require('simple-sha1')\nconst Wire = require('bittorrent-protocol')\n\nconst debug = debugFactory('webtorrent:webconn')\nconst VERSION = require('../package.json').version\n\nconst SOCKET_TIMEOUT = 60000\nconst RETRY_DELAY = 10000\n\n/**\n * Converts requests for torrent blocks into http range requests.\n * @param {string} url web seed url\n * @param {Object} torrent\n */\nclass WebConn extends Wire {\n constructor (url, torrent) {\n super()\n\n this.url = url\n this.connId = url // Unique id to deduplicate web seeds\n this.webPeerId = sha1.sync(url) // Used as the peerId for this fake remote peer\n this._torrent = torrent\n\n this._init()\n }\n\n _init () {\n this.setKeepAlive(true)\n\n this.use(ltDontHave())\n\n this.once('handshake', (infoHash, peerId) => {\n if (this.destroyed) return\n this.handshake(infoHash, this.webPeerId)\n const numPieces = this._torrent.pieces.length\n const bitfield = new BitField(numPieces)\n for (let i = 0; i <= numPieces; i++) {\n bitfield.set(i, true)\n }\n this.bitfield(bitfield)\n })\n\n this.once('interested', () => {\n debug('interested')\n this.unchoke()\n })\n\n this.on('uninterested', () => { debug('uninterested') })\n this.on('choke', () => { debug('choke') })\n this.on('unchoke', () => { debug('unchoke') })\n this.on('bitfield', () => { debug('bitfield') })\n this.lt_donthave.on('donthave', () => { debug('donthave') })\n\n this.on('request', (pieceIndex, offset, length, callback) => {\n debug('request pieceIndex=%d offset=%d length=%d', pieceIndex, offset, length)\n this.httpRequest(pieceIndex, offset, length, (err, data) => {\n if (err) {\n // Cancel all in progress requests for this piece\n this.lt_donthave.donthave(pieceIndex)\n\n // Wait a little while before saying the webseed has the failed piece again\n const retryTimeout = setTimeout(() => {\n if (this.destroyed) return\n\n this.have(pieceIndex)\n }, RETRY_DELAY)\n if (retryTimeout.unref) retryTimeout.unref()\n }\n\n callback(err, data)\n })\n })\n }\n\n httpRequest (pieceIndex, offset, length, cb) {\n const pieceOffset = pieceIndex * this._torrent.pieceLength\n const rangeStart = pieceOffset + offset /* offset within whole torrent */\n const rangeEnd = rangeStart + length - 1\n\n // Web seed URL format:\n // For single-file torrents, make HTTP range requests directly to the web seed URL\n // For multi-file torrents, add the torrent folder and file name to the URL\n const files = this._torrent.files\n let requests\n if (files.length <= 1) {\n requests = [{\n url: this.url,\n start: rangeStart,\n end: rangeEnd\n }]\n } else {\n const requestedFiles = files.filter(file => file.offset <= rangeEnd && (file.offset + file.length) > rangeStart)\n if (requestedFiles.length < 1) {\n return cb(new Error('Could not find file corresponding to web seed range request'))\n }\n\n requests = requestedFiles.map(requestedFile => {\n const fileEnd = requestedFile.offset + requestedFile.length - 1\n const url = this.url +\n (this.url[this.url.length - 1] === '/' ? '' : '/') +\n requestedFile.path\n return {\n url,\n fileOffsetInRange: Math.max(requestedFile.offset - rangeStart, 0),\n start: Math.max(rangeStart - requestedFile.offset, 0),\n end: Math.min(fileEnd, rangeEnd - requestedFile.offset)\n }\n })\n }\n\n // Now make all the HTTP requests we need in order to load this piece\n // Usually that's one requests, but sometimes it will be multiple\n // Send requests in parallel and wait for them all to come back\n let numRequestsSucceeded = 0\n let hasError = false\n\n let ret\n if (requests.length > 1) {\n ret = Buffer.alloc(length)\n }\n\n requests.forEach(request => {\n const url = request.url\n const start = request.start\n const end = request.end\n debug(\n 'Requesting url=%s pieceIndex=%d offset=%d length=%d start=%d end=%d',\n url, pieceIndex, offset, length, start, end\n )\n const opts = {\n url,\n method: 'GET',\n headers: {\n 'user-agent': `WebTorrent/${VERSION} (https://webtorrent.io)`,\n range: `bytes=${start}-${end}`\n },\n timeout: SOCKET_TIMEOUT\n }\n function onResponse (res, data) {\n if (res.statusCode < 200 || res.statusCode >= 300) {\n if (hasError) return\n hasError = true\n return cb(new Error(`Unexpected HTTP status code ${res.statusCode}`))\n }\n debug('Got data of length %d', data.length)\n\n if (requests.length === 1) {\n // Common case: fetch piece in a single HTTP request, return directly\n cb(null, data)\n } else {\n // Rare case: reconstruct multiple HTTP requests across 2+ files into one\n // piece buffer\n data.copy(ret, request.fileOffsetInRange)\n if (++numRequestsSucceeded === requests.length) {\n cb(null, ret)\n }\n }\n }\n get.concat(opts, (err, res, data) => {\n if (hasError) return\n if (err) {\n // Browsers allow HTTP redirects for simple cross-origin\n // requests but not for requests that require preflight.\n // Use a simple request to unravel any redirects and get the\n // final URL. Retry the original request with the new URL if\n // it's different.\n //\n // This test is imperfect but it's simple and good for common\n // cases. It catches all cross-origin cases but matches a few\n // same-origin cases too.\n if (typeof window === 'undefined' || url.startsWith(`${window.location.origin}/`)) {\n hasError = true\n return cb(err)\n }\n\n return get.head(url, (errHead, res) => {\n if (hasError) return\n if (errHead) {\n hasError = true\n return cb(errHead)\n }\n if (res.statusCode < 200 || res.statusCode >= 300) {\n hasError = true\n return cb(new Error(`Unexpected HTTP status code ${res.statusCode}`))\n }\n if (res.url === url) {\n hasError = true\n return cb(err)\n }\n\n opts.url = res.url\n get.concat(opts, (err, res, data) => {\n if (hasError) return\n if (err) {\n hasError = true\n return cb(err)\n }\n onResponse(res, data)\n })\n })\n }\n onResponse(res, data)\n })\n })\n }\n\n destroy () {\n super.destroy()\n this._torrent = null\n }\n}\n\nmodule.exports = WebConn\n","'use strict';\n\nvar forEach = require('foreach');\nvar availableTypedArrays = require('available-typed-arrays');\nvar callBound = require('call-bind/callBound');\n\nvar $toString = callBound('Object.prototype.toString');\nvar hasToStringTag = require('has-tostringtag/shams')();\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\nvar typedArrays = availableTypedArrays();\n\nvar $slice = callBound('String.prototype.slice');\nvar toStrTags = {};\nvar gOPD = require('es-abstract/helpers/getOwnPropertyDescriptor');\nvar getPrototypeOf = Object.getPrototypeOf; // require('getprototypeof');\nif (hasToStringTag && gOPD && getPrototypeOf) {\n\tforEach(typedArrays, function (typedArray) {\n\t\tif (typeof g[typedArray] === 'function') {\n\t\t\tvar arr = new g[typedArray]();\n\t\t\tif (Symbol.toStringTag in arr) {\n\t\t\t\tvar proto = getPrototypeOf(arr);\n\t\t\t\tvar descriptor = gOPD(proto, Symbol.toStringTag);\n\t\t\t\tif (!descriptor) {\n\t\t\t\t\tvar superProto = getPrototypeOf(proto);\n\t\t\t\t\tdescriptor = gOPD(superProto, Symbol.toStringTag);\n\t\t\t\t}\n\t\t\t\ttoStrTags[typedArray] = descriptor.get;\n\t\t\t}\n\t\t}\n\t});\n}\n\nvar tryTypedArrays = function tryAllTypedArrays(value) {\n\tvar foundName = false;\n\tforEach(toStrTags, function (getter, typedArray) {\n\t\tif (!foundName) {\n\t\t\ttry {\n\t\t\t\tvar name = getter.call(value);\n\t\t\t\tif (name === typedArray) {\n\t\t\t\t\tfoundName = name;\n\t\t\t\t}\n\t\t\t} catch (e) {}\n\t\t}\n\t});\n\treturn foundName;\n};\n\nvar isTypedArray = require('is-typed-array');\n\nmodule.exports = function whichTypedArray(value) {\n\tif (!isTypedArray(value)) { return false; }\n\tif (!hasToStringTag || !(Symbol.toStringTag in value)) { return $slice($toString(value), 8, -1); }\n\treturn tryTypedArrays(value);\n};\n","// Returns a wrapper function that returns a wrapped callback\n// The wrapper function should do some stuff, and return a\n// presumably different callback function.\n// This makes sure that own properties are retained, so that\n// decorations and such are not lost along the way.\nmodule.exports = wrappy\nfunction wrappy (fn, cb) {\n if (fn && cb) return wrappy(fn)(cb)\n\n if (typeof fn !== 'function')\n throw new TypeError('need wrapper function')\n\n Object.keys(fn).forEach(function (k) {\n wrapper[k] = fn[k]\n })\n\n return wrapper\n\n function wrapper() {\n var args = new Array(arguments.length)\n for (var i = 0; i < args.length; i++) {\n args[i] = arguments[i]\n }\n var ret = fn.apply(this, args)\n var cb = args[args.length-1]\n if (typeof ret === 'function' && ret !== cb) {\n Object.keys(cb).forEach(function (k) {\n ret[k] = cb[k]\n })\n }\n return ret\n }\n}\n","module.exports = extend\n\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n\nfunction extend() {\n var target = {}\n\n for (var i = 0; i < arguments.length; i++) {\n var source = arguments[i]\n\n for (var key in source) {\n if (hasOwnProperty.call(source, key)) {\n target[key] = source[key]\n }\n }\n }\n\n return target\n}\n","'use strict';\n\nvar possibleNames = [\n\t'BigInt64Array',\n\t'BigUint64Array',\n\t'Float32Array',\n\t'Float64Array',\n\t'Int16Array',\n\t'Int32Array',\n\t'Int8Array',\n\t'Uint16Array',\n\t'Uint32Array',\n\t'Uint8Array',\n\t'Uint8ClampedArray'\n];\n\nvar g = typeof globalThis === 'undefined' ? global : globalThis;\n\nmodule.exports = function availableTypedArrays() {\n\tvar out = [];\n\tfor (var i = 0; i < possibleNames.length; i++) {\n\t\tif (typeof g[possibleNames[i]] === 'function') {\n\t\t\tout[out.length] = possibleNames[i];\n\t\t}\n\t}\n\treturn out;\n};\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar $gOPD = GetIntrinsic('%Object.getOwnPropertyDescriptor%', true);\nif ($gOPD) {\n\ttry {\n\t\t$gOPD([], 'length');\n\t} catch (e) {\n\t\t// IE 8 has a broken gOPD\n\t\t$gOPD = null;\n\t}\n}\n\nmodule.exports = $gOPD;\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","import { EbmlStreamDecoder, EbmlTagId } from 'ebml-stream';\nimport { Transform } from 'readable-stream';\nimport { inflateSync } from 'zlib';\n\nconst SSA_TYPES = new Set(['ssa', 'ass']);\nconst SSA_KEYS = ['readOrder', 'layer', 'style', 'name', 'marginL', 'marginR', 'marginV', 'effect', 'text'];\n\nfunction getData(chunk, id) {\n const el = chunk.Children.find(c => c.id === id);\n return el ? el.data : undefined;\n}\n\nclass SubtitleParserBase extends Transform {\n constructor() {\n super();\n this.subtitleTracks = new Map();\n this.timecodeScale = 1;\n this._currentClusterTimecode = null;\n this.decoder = new EbmlStreamDecoder({\n bufferTagIds: [EbmlTagId.TimecodeScale, EbmlTagId.Tracks, EbmlTagId.BlockGroup, EbmlTagId.AttachedFile]\n });\n this.decoder.on('data', this.parseEbmlSubtitles.bind(this));\n }\n\n parseEbmlSubtitles(chunk) {\n // Segment Information\n if (chunk.id === EbmlTagId.TimecodeScale) {\n this.timecodeScale = chunk.data / 1000000;\n } // Assumption: This is a Cluster `Timecode`\n\n\n if (chunk.id === EbmlTagId.Timecode) {\n this._currentClusterTimecode = chunk.data;\n }\n\n if (chunk.id === EbmlTagId.Tracks) {\n for (const entry of chunk.Children.filter(c => c.id === EbmlTagId.TrackEntry)) {\n // Skip non subtitle tracks\n if (getData(entry, EbmlTagId.TrackType) !== 0x11) continue;\n const codecID = getData(entry, EbmlTagId.CodecID) || '';\n\n if (codecID.startsWith('S_TEXT')) {\n const track = {\n number: getData(entry, EbmlTagId.TrackNumber),\n language: getData(entry, EbmlTagId.Language),\n type: codecID.substring(7).toLowerCase()\n };\n const name = getData(entry, EbmlTagId.Name);\n\n if (name) {\n track.name = name;\n }\n\n const header = getData(entry, EbmlTagId.CodecPrivate);\n\n if (header) {\n track.header = header.toString();\n } // TODO: Assume zlib deflate compression\n\n\n const compressed = entry.Children.find(c => c.id === EbmlTagId.ContentEncodings && c.Children.find(cc => cc.id === EbmlTagId.ContentEncoding && cc.Children.find(ccc => ccc.id === EbmlTagId.ContentCompression)));\n\n if (compressed) {\n track._compressed = true;\n }\n\n this.subtitleTracks.set(track.number, track);\n }\n }\n\n this.emit('tracks', Array.from(this.subtitleTracks.values()));\n }\n\n if (chunk.id === EbmlTagId.BlockGroup) {\n const block = chunk.Children.find(c => c.id === EbmlTagId.Block);\n\n if (block && this.subtitleTracks.has(block.track)) {\n const blockDuration = getData(chunk, EbmlTagId.BlockDuration);\n const track = this.subtitleTracks.get(block.track);\n const payload = track._compressed ? inflateSync(Buffer.from(block.payload)) : block.payload;\n const subtitle = {\n text: payload.toString('utf8'),\n time: (block.value + this._currentClusterTimecode) * this.timecodeScale,\n duration: blockDuration * this.timecodeScale\n };\n\n if (SSA_TYPES.has(track.type)) {\n // extract SSA/ASS keys\n const values = subtitle.text.split(','); // ignore read-order, and skip layer if ssa\n\n for (let i = track.type === 'ssa' ? 2 : 1; i < 8; i++) {\n subtitle[SSA_KEYS[i]] = values[i];\n }\n\n subtitle.text = values.slice(8).join(',');\n }\n\n this.emit('subtitle', subtitle, block.track);\n }\n } // Parse attached files, mainly to allow extracting subtitle font files.\n\n\n if (chunk.id === EbmlTagId.AttachedFile) {\n this.emit('file', {\n filename: getData(chunk, EbmlTagId.FileName),\n mimetype: getData(chunk, EbmlTagId.FileMimeType),\n data: getData(chunk, EbmlTagId.FileData)\n });\n }\n }\n\n}\n\nclass SubtitleParser extends SubtitleParserBase {\n constructor() {\n super();\n this.decoder.on('data', chunk => {\n if (chunk.id === EbmlTagId.Tracks) {\n // stop decoding if no subtitle tracks are present\n if (this.subtitleTracks.size === 0) this.end();\n }\n });\n }\n\n _write(chunk, _, callback) {\n this.decoder.write(chunk);\n callback(null, chunk);\n }\n\n}\n\nclass SubtitleStream extends SubtitleParserBase {\n constructor(prevInstance) {\n super();\n\n if (prevInstance instanceof SubtitleParserBase) {\n prevInstance.once('drain', () => prevInstance.end()); // copy previous metadata\n\n this.subtitleTracks = prevInstance.subtitleTracks;\n this.timecodeScale = prevInstance.timecodeScale; // may not be at ebml tag offset\n\n this.unstable = true;\n }\n } // passthrough stream: data is intercepted but not transformed\n\n\n _transform(chunk, _, callback) {\n if (this.unstable) {\n // the ebml decoder expects to see a tag, so we won't use it until we find a cluster\n for (let i = 0; i < chunk.length - 12; i++) {\n // cluster id\n if (chunk[i] === 0x1f && chunk[i + 1] === 0x43 && chunk[i + 2] === 0xb6 && chunk[i + 3] === 0x75) {\n // length of cluster size tag\n const len = 8 - Math.floor(Math.log2(chunk[i + 4])); // first tag in cluster is cluster timecode\n\n if (chunk[i + 4 + len] === 0xe7) {\n // okay this is probably a cluster\n this.unstable = false;\n this.decoderWrite(chunk.slice(i));\n break;\n }\n }\n }\n } else {\n this.decoderWrite(chunk);\n }\n\n callback(null, chunk);\n }\n\n decoderWrite(chunk) {\n // passthrough stream should allow chained streams to continue on error\n try {\n this.decoder.write(chunk);\n } catch (err) {\n console.warn('[matroska-subtitles] EBML stream decoding error');\n }\n }\n\n}\n\nexport { SubtitleParser, SubtitleStream };\n//# sourceMappingURL=matroska-subtitles.module.js.map\n","import safariFix from 'safari-14-idb-fix';\n\nfunction promisifyRequest(request) {\n return new Promise((resolve, reject) => {\n // @ts-ignore - file size hacks\n request.oncomplete = request.onsuccess = () => resolve(request.result);\n // @ts-ignore - file size hacks\n request.onabort = request.onerror = () => reject(request.error);\n });\n}\nfunction createStore(dbName, storeName) {\n const dbp = safariFix().then(() => {\n const request = indexedDB.open(dbName);\n request.onupgradeneeded = () => request.result.createObjectStore(storeName);\n return promisifyRequest(request);\n });\n return (txMode, callback) => dbp.then((db) => callback(db.transaction(storeName, txMode).objectStore(storeName)));\n}\nlet defaultGetStoreFunc;\nfunction defaultGetStore() {\n if (!defaultGetStoreFunc) {\n defaultGetStoreFunc = createStore('keyval-store', 'keyval');\n }\n return defaultGetStoreFunc;\n}\n/**\n * Get a value by its key.\n *\n * @param key\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction get(key, customStore = defaultGetStore()) {\n return customStore('readonly', (store) => promisifyRequest(store.get(key)));\n}\n/**\n * Set a value with a key.\n *\n * @param key\n * @param value\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction set(key, value, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.put(value, key);\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Set multiple values at once. This is faster than calling set() multiple times.\n * It's also atomic – if one of the pairs can't be added, none will be added.\n *\n * @param entries Array of entries, where each entry is an array of `[key, value]`.\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction setMany(entries, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n entries.forEach((entry) => store.put(entry[1], entry[0]));\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Get multiple values by their keys\n *\n * @param keys\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction getMany(keys, customStore = defaultGetStore()) {\n return customStore('readonly', (store) => Promise.all(keys.map((key) => promisifyRequest(store.get(key)))));\n}\n/**\n * Update a value. This lets you see the old value and update it as an atomic operation.\n *\n * @param key\n * @param updater A callback that takes the old value and returns a new value.\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction update(key, updater, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => \n // Need to create the promise manually.\n // If I try to chain promises, the transaction closes in browsers\n // that use a promise polyfill (IE10/11).\n new Promise((resolve, reject) => {\n store.get(key).onsuccess = function () {\n try {\n store.put(updater(this.result), key);\n resolve(promisifyRequest(store.transaction));\n }\n catch (err) {\n reject(err);\n }\n };\n }));\n}\n/**\n * Delete a particular key from the store.\n *\n * @param key\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction del(key, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.delete(key);\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Delete multiple keys at once.\n *\n * @param keys List of keys to delete.\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction delMany(keys, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n keys.forEach((key) => store.delete(key));\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Clear all values in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction clear(customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.clear();\n return promisifyRequest(store.transaction);\n });\n}\nfunction eachCursor(store, callback) {\n store.openCursor().onsuccess = function () {\n if (!this.result)\n return;\n callback(this.result);\n this.result.continue();\n };\n return promisifyRequest(store.transaction);\n}\n/**\n * Get all keys in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction keys(customStore = defaultGetStore()) {\n return customStore('readonly', (store) => {\n // Fast path for modern browsers\n if (store.getAllKeys) {\n return promisifyRequest(store.getAllKeys());\n }\n const items = [];\n return eachCursor(store, (cursor) => items.push(cursor.key)).then(() => items);\n });\n}\n/**\n * Get all values in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction values(customStore = defaultGetStore()) {\n return customStore('readonly', (store) => {\n // Fast path for modern browsers\n if (store.getAll) {\n return promisifyRequest(store.getAll());\n }\n const items = [];\n return eachCursor(store, (cursor) => items.push(cursor.value)).then(() => items);\n });\n}\n/**\n * Get all entries in the store. Each entry is an array of `[key, value]`.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction entries(customStore = defaultGetStore()) {\n return customStore('readonly', (store) => {\n // Fast path for modern browsers\n // (although, hopefully we'll get a simpler path some day)\n if (store.getAll && store.getAllKeys) {\n return Promise.all([\n promisifyRequest(store.getAllKeys()),\n promisifyRequest(store.getAll()),\n ]).then(([keys, values]) => keys.map((key, i) => [key, values[i]]));\n }\n const items = [];\n return customStore('readonly', (store) => eachCursor(store, (cursor) => items.push([cursor.key, cursor.value])).then(() => items));\n });\n}\n\nexport { clear, createStore, del, delMany, entries, get, getMany, keys, promisifyRequest, set, setMany, update, values };\n","/**\n * Work around Safari 14 IndexedDB open bug.\n *\n * Safari has a horrible bug where IDB requests can hang while the browser is starting up. https://bugs.webkit.org/show_bug.cgi?id=226547\n * The only solution is to keep nudging it until it's awake.\n */\nfunction idbReady() {\n var isSafari = !navigator.userAgentData &&\n /Safari\\//.test(navigator.userAgent) &&\n !/Chrom(e|ium)\\//.test(navigator.userAgent);\n // No point putting other browsers or older versions of Safari through this mess.\n if (!isSafari || !indexedDB.databases)\n return Promise.resolve();\n var intervalId;\n return new Promise(function (resolve) {\n var tryIdb = function () { return indexedDB.databases().finally(resolve); };\n intervalId = setInterval(tryIdb, 100);\n tryIdb();\n }).finally(function () { return clearInterval(intervalId); });\n}\n\nexport default idbReady;\n","/* eslint-env browser */\nimport { del, set, createStore, entries } from 'idb-keyval'\n\n// this is utterly fucking retarded, but FSA can't delete files fast enough on page close?\n// so just delete the files on next load\n// note: for this to have any effect, the store needs to be destroyed before unload event!\nconst idbStore = createStore('fsa-chunk-store', 'handles')\nentries(idbStore).then(entries => {\n for (const [name, rootDir] of entries) {\n rootDir.removeEntry(name, { recursive: true })\n del(name, idbStore)\n }\n})\nexport default class FSAChunkStore {\n constructor (chunkLength, opts = {}) {\n this.chunkLength = Number(chunkLength)\n\n if (!this.chunkLength) {\n throw new Error('First argument must be a chunk length')\n }\n\n this.closed = false\n\n this.name = opts.name || 'default'\n\n this.rootDirPromise = opts.rootDir || navigator.storage.getDirectory()\n this.storageDirPromise = this._getStorageDirectoryHandle()\n this.chunksDirPromise = ((opts.files && opts.rootDir) && this._getChunksDirHandle()) || this.storageDirPromise\n\n this.chunks = [] // individual chunks, required for reads :/\n this.chunkMap = [] // full files\n this.directoryMap = {}\n\n if (opts.files && opts.rootDir) {\n this.files = opts.files.slice(0).map((file, i, files) => {\n if (file.path == null) throw new Error('File is missing `path` property')\n if (file.length == null) throw new Error('File is missing `length` property')\n if (file.offset == null) {\n if (i === 0) {\n file.offset = 0\n } else {\n const prevFile = files[i - 1]\n file.offset = prevFile.offset + prevFile.length\n }\n }\n\n // file handles\n if (file.handle == null) {\n file.handle = this._createFileHandle({ path: file.path })\n }\n\n // file chunkMap\n const fileStart = file.offset\n const fileEnd = file.offset + file.length\n\n const firstChunk = Math.floor(fileStart / this.chunkLength)\n const lastChunk = Math.floor((fileEnd - 1) / this.chunkLength)\n\n for (let p = firstChunk; p <= lastChunk; ++p) {\n const chunkStart = p * this.chunkLength\n const chunkEnd = chunkStart + this.chunkLength\n\n const from = (fileStart < chunkStart) ? 0 : fileStart - chunkStart\n const to = (fileEnd > chunkEnd) ? this.chunkLength : fileEnd - chunkStart\n const offset = (fileStart > chunkStart) ? 0 : chunkStart - fileStart\n\n if (!this.chunkMap[p]) this.chunkMap[p] = []\n\n this.chunkMap[p].push({ from, to, offset, file })\n }\n\n return file\n })\n\n // close streams is page is frozen/unloaded, they will re-open if the user returns via BFC\n window.addEventListener('pagehide', this.cleanup)\n\n this.length = this.files.reduce((sum, file) => sum + file.length, 0)\n if (opts.length != null && opts.length !== this.length) {\n throw new Error('total `files` length is not equal to explicit `length` option')\n }\n } else {\n this.length = Number(opts.length) || Infinity\n }\n\n if (this.length !== Infinity) {\n this.lastChunkLength = this.length % this.chunkLength || this.chunkLength\n this.lastChunkIndex = Math.ceil(this.length / this.chunkLength) - 1\n }\n }\n\n async _getChunksDirHandle () {\n const storageDir = await this.storageDirPromise\n return await storageDir.getDirectoryHandle('chunks', { create: true })\n }\n\n async _getStorageDirectoryHandle () {\n const rootDir = await this.rootDirPromise\n return await rootDir.getDirectoryHandle(this.name, { create: true })\n }\n\n async _getChunk (index) {\n let chunk = this.chunks[index]\n\n if (!chunk) {\n const fileName = index.toString()\n const storageDir = await this.chunksDirPromise\n\n chunk = this.chunks[index] = { fileHandlePromise: storageDir.getFileHandle(fileName, { create: true }) }\n }\n\n return chunk\n }\n\n async _createFileHandle (opts) {\n const fileName = opts.path.slice(opts.path.lastIndexOf('/') + 1)\n return (await this._getDirectoryHandle(opts)).getFileHandle(fileName, { create: true })\n }\n\n // recursive, equiv of cd and mkdirp\n async _getDirectoryHandle (opts) {\n const lastIndex = opts.path.lastIndexOf('/')\n if (lastIndex === -1 || lastIndex === 0) return this.storageDirPromise\n const path = opts.path = opts.path.slice(0, lastIndex)\n if (!this.directoryMap[path]) {\n const parent = this._getDirectoryHandle(opts)\n this.directoryMap[path] = (await parent).getDirectoryHandle(path.slice(path.lastIndexOf('/') + 1), { create: true })\n }\n return this.directoryMap[path]\n }\n\n put (index, buf, cb = () => {}) {\n if (this.closed) {\n queueMicrotask(() => cb(new Error('Storage is closed')))\n return\n }\n\n const isLastChunk = index === this.lastChunkIndex\n if (isLastChunk && buf.length !== this.lastChunkLength) {\n queueMicrotask(() => {\n cb(new Error(`Last chunk length must be ${this.lastChunkLength}`))\n })\n return\n }\n if (!isLastChunk && buf.length !== this.chunkLength) {\n queueMicrotask(() => {\n cb(new Error(`Chunk length must be ${this.chunkLength}`))\n })\n return\n }\n\n ;(async () => {\n try {\n const chunk = await this._getChunk(index)\n const fileHandle = await chunk.fileHandlePromise\n const stream = await fileHandle.createWritable({\n keepExistingData: false\n })\n await stream.write(buf)\n await stream.close()\n } catch (err) {\n cb(err)\n return\n }\n\n if (!this.files) cb(null)\n })()\n\n if (this.files) {\n const targets = this.chunkMap[index]\n if (!targets) {\n queueMicrotask(() => cb(new Error('No files matching the request range')))\n }\n const promises = targets.map(target => {\n return (async () => {\n try {\n const { file } = target\n if (!file.stream) {\n file.stream = (await file.handle).createWritable({\n keepExistingData: true\n })\n }\n const stream = await file.stream\n await stream.write({ type: 'write', position: target.offset, data: buf.slice(target.from, target.to) })\n return null\n } catch (err) {\n return cb(err)\n }\n })()\n })\n Promise.all(promises).then(() => cb(null))\n }\n }\n\n get (index, opts, cb = () => {}) {\n if (typeof opts === 'function') {\n return this.get(index, null, opts)\n }\n if (this.closed) {\n queueMicrotask(() => cb(new Error('Storage is closed')))\n return\n }\n\n const isLastChunk = index === this.lastChunkIndex\n const chunkLength = isLastChunk ? this.lastChunkLength : this.chunkLength\n\n if (!opts) opts = {}\n\n const rangeFrom = opts.offset || 0\n const rangeTo = opts.length ? rangeFrom + opts.length : chunkLength\n const len = opts.length || chunkLength - rangeFrom\n\n if (!this.files || this.chunks[index]) {\n ;(async () => {\n let buf\n try {\n const chunk = await this._getChunk(index)\n const fileHandle = await chunk.fileHandlePromise\n let file = await fileHandle.getFile()\n if (rangeFrom !== 0 || len !== chunkLength) {\n file = file.slice(rangeFrom, len + rangeFrom)\n }\n buf = await file.arrayBuffer()\n } catch (err) {\n cb(err)\n return\n }\n\n if (buf.byteLength === 0) {\n const err = new Error(`Index ${index} does not exist`)\n err.notFound = true\n cb(err)\n return\n }\n\n cb(null, new Uint8Array(buf))\n })()\n } else {\n let targets = this.chunkMap[index]\n if (!targets) {\n queueMicrotask(() => cb(new Error('No files matching the request range')))\n }\n if (opts) {\n targets = targets.filter(target => {\n return target.to > rangeFrom && target.from < rangeTo\n })\n if (targets.length === 0) {\n queueMicrotask(() => cb(new Error('No files matching the request range')))\n }\n }\n if (rangeFrom === rangeTo) return queueMicrotask(() => cb(null, new Uint8Array(0)))\n\n const promises = targets.map(target => {\n return (async () => {\n let from = target.from\n let to = target.to\n let offset = target.offset\n\n if (opts) {\n if (to > rangeTo) to = rangeTo\n if (from < rangeFrom) {\n offset += (rangeFrom - from)\n from = rangeFrom\n }\n }\n try {\n const handle = await target.file.handle\n const file = (await handle.getFile()).slice(offset, offset + to - from)\n return await file.arrayBuffer()\n } catch (err) {\n return err\n }\n })()\n })\n Promise.all(promises).then(values => {\n if (values.length === 1) {\n cb(null, new Uint8Array(values[0]))\n } else {\n new Blob(values).arrayBuffer().then(buf => {\n cb(null, new Uint8Array(buf))\n })\n }\n })\n }\n }\n\n async close (cb = () => {}, destroying) {\n if (this.closed) {\n queueMicrotask(() => cb(new Error('Storage is closed')))\n return\n }\n\n this.closed = true\n this.chunkMap = []\n this.directoryMap = {}\n await this.cleanup(destroying)\n queueMicrotask(() => {\n cb(null)\n })\n }\n\n async cleanup (destroying) {\n this.chunks = []\n if (this.files) {\n const promises = []\n for (const file of this.files) {\n if (file.stream) {\n promises.push(await (await file.stream).close())\n file.stream = null\n }\n }\n if (destroying !== true) {\n const storageDir = await this.storageDirPromise\n set('chunks', storageDir, idbStore) // conflicting. oh well.\n await storageDir.removeEntry('chunks', { recursive: true })\n del('chunks', idbStore)\n }\n await Promise.all(promises)\n }\n }\n\n async destroy (cb = () => {}) {\n if (this.closed) {\n queueMicrotask(() => cb(new Error('Storage is closed')))\n return\n }\n const rootDir = await this.rootDirPromise\n set(this.name, rootDir, idbStore)\n\n const handleClose = async () => {\n try {\n await rootDir.removeEntry(this.name, { recursive: true })\n del(this.name, idbStore)\n } catch (err) {\n cb(err)\n return\n }\n cb(null)\n }\n\n this.close(handleClose, true)\n }\n}\n","/* eslint-env browser */\nimport FSAccessChunkStore from 'fsa-chunk-store'\nimport IDBChunkStore from 'idb-chunk-store'\nimport MemoryChunkStore from 'memory-chunk-store'\nimport CacheChunkStore from 'cache-chunk-store'\n\nconst isChrome = !!window.chrome\n\nexport default class HybridChunkStore {\n constructor (chunkLength, opts = {}) {\n this.chunkLength = Number(chunkLength)\n if (!this.chunkLength) throw new Error('First argument must be a chunk length')\n\n this.length = Number(opts.length) || Infinity\n\n this.fallbackStore = null\n this.chunkCount = null\n this.stores = []\n this.chunks = []\n\n // this is kinda stupid, first it makes the fallback store, then the main store\n // creates a store limited by targetLength, then uses memory as fallback/overflow\n // if targetlength is falsy then it will assume infinite storage\n const _mapStore = (TargetStore, targetLength) => {\n const newOpts = opts\n if (targetLength && targetLength < this.length) {\n this.chunkCount = Math.floor(targetLength / this.chunkLength)\n const newLength = this.chunkCount * this.chunkLength\n newOpts.length = this.length - newLength\n // ideally this should be blob store, some1 make one pls\n this.fallbackStore = new MemoryChunkStore(this.chunkLength, newOpts)\n this.stores.push(this.fallbackStore)\n newOpts.length = newLength\n }\n const store = new CacheChunkStore(new TargetStore(this.chunkLength, newOpts), { max: opts.max || 20 })\n this.stores.push(store)\n if (this.chunkCount) {\n this.chunks[this.chunkCount - 1] = store\n this.chunks.fill(store)\n } else {\n this.fallbackStore = store\n }\n }\n this.registration = navigator.storage.estimate().then(estimate => {\n // use less than available\n const remaining = estimate.quota - estimate.usage - Math.max(Number(opts.reserved) || 0, 16777216)\n // if user only wants to use memory, or there is no space, force memory only\n if (opts.onlyMem === true || remaining <= 0) {\n this.fallbackStore = new MemoryChunkStore(this.chunkLength, opts)\n this.stores.push(this.fallbackStore)\n this.chunkCount = 0\n } else {\n if ('getDirectory' in navigator.storage) {\n // lets hope the user isn't stupid enough to specify a directory with barely any storage, forgive me tech support people\n // can't detect avaliable quota in custom folders\n _mapStore(FSAccessChunkStore, !(opts.rootDir) && remaining)\n } else {\n // WAH. https://i.kym-cdn.com/entries/icons/original/000/027/528/519.png\n // some OS versions and some chromium browsers report quota as 2^31 when it has more than that available\n // this means we can't estimate how much space they have... oh well\n _mapStore(IDBChunkStore, !(isChrome && estimate.quota === 2147483648) && remaining)\n }\n }\n })\n }\n\n get (index, opts, cb) {\n this.registration.then(() => {\n if (!this.chunks[index]) {\n this.fallbackStore.get(index - this.chunkCount, opts, cb)\n } else {\n this.chunks[index].get(index, opts, cb)\n }\n })\n }\n\n put (index, buf, cb) {\n this.registration.then(() => {\n if (!this.chunks[index]) {\n this.fallbackStore.put(index - this.chunkCount, buf, cb)\n } else {\n this.chunks[index].put(index, buf, cb)\n }\n })\n }\n\n close (cb = () => {}) {\n const promises = []\n for (const store of this.stores) {\n promises.push(new Promise(resolve => store.close(resolve)))\n }\n Promise.all(promises).then(values => {\n values = values.filter(value => value)\n cb(values.length > 1 ? values : values[0])\n })\n }\n\n destroy (cb = () => {}) {\n const promises = []\n for (const store of this.stores) {\n promises.push(new Promise(resolve => store.destroy(resolve)))\n }\n Promise.all(promises).then(values => {\n values = values.filter(value => value)\n cb(values.length > 1 ? values : values[0])\n })\n }\n}\n","/*\r\n author: Daodor, libass\r\n license: MIT\r\n\r\n re-written by: ThaUnknown_\r\n license: GPL3\r\n*/\r\nexport default class SubtitlesOctopus {\r\n constructor (options = {}) {\r\n if (!window.Worker) {\r\n this.workerError('worker not supported')\r\n return\r\n }\r\n // opts\r\n this.canvas = options.canvas // HTML canvas element (optional if video specified)\r\n\r\n // choose best render mode based on browser support\r\n this.renderMode = options.renderMode || 'offscreen'\r\n if (this.renderMode !== 'blend' && this.renderMode !== 'normal') {\r\n if (typeof createImageBitmap === 'undefined') {\r\n this.renderMode = 'normal'\r\n } else if (typeof OffscreenCanvas !== 'undefined') {\r\n this.renderMode = 'offscreen'\r\n }\r\n }\r\n\r\n // play with those when you need some speed, e.g. for slow devices\r\n this.targetFps = options.targetFps || 23.976\r\n this.prescaleTradeoff = options.prescaleTradeoff || null // render subtitles less than viewport when less than 1.0 to improve speed, render to more than 1.0 to improve quality; set to null to disable scaling\r\n this.softHeightLimit = options.softHeightLimit || 1080 // don't apply prescaleTradeoff < 1 when viewport height is less that this limit\r\n this.hardHeightLimit = options.hardHeightLimit || 2160 // don't ever go above this limit\r\n this.resizeVariation = options.resizeVariation || 0.2 // by how many a size can vary before it would cause clearance of prerendered buffer\r\n\r\n this.video = options.video // HTML video element (optional if canvas specified)\r\n this.canvasParent = null // (internal) HTML canvas parent element\r\n this.onReadyEvent = options.onReady // Function called when SubtitlesOctopus is ready (optional)\r\n this.onErrorEvent = options.onError // Function called in case of critical error meaning sub wouldn't be shown and you should use alternative method (for instance it occurs if browser doesn't support web workers).\r\n this.debug = !!options.debug // When debug enabled, some performance info printed in console.\r\n this.lastRenderTime = 0 // (internal) Last time we got some frame from worker\r\n\r\n this.timeOffset = options.timeOffset || 0 // Time offset would be applied to currentTime from video (option)\r\n\r\n this.renderedItems = [] // used to store items rendered ahead when renderAhead > 0\r\n // how many MiB to render ahead and store; 0 to disable (approximate)\r\n this.renderAhead = (options.renderAhead || 0) * 1024 * 1024 * 0.9 // try to eat less than requested\r\n this.oneshotState = {\r\n eventStart: null,\r\n eventOver: false,\r\n iteration: 0,\r\n renderRequested: false,\r\n requestNextTimestamp: -1,\r\n prevWidth: null,\r\n prevHeight: null\r\n }\r\n\r\n this.renderFrameData = null\r\n this.workerActive = false\r\n this.frameId = 0\r\n this.workerActive = false\r\n\r\n // init worker\r\n if (!this.worker) {\r\n this.worker = new Worker(options.workerUrl || 'subtitles-octopus-worker.js')\r\n this.worker.onmessage = event => this.onWorkerMessage(event)\r\n this.worker.onerror = event => this.workerError(event)\r\n }\r\n\r\n this.createCanvas()\r\n this.setVideo(options.video)\r\n this.worker.postMessage({\r\n target: 'worker-init',\r\n width: this.canvas.width,\r\n height: this.canvas.height,\r\n URL: document.URL,\r\n currentScript: options.workerUrl || 'subtitles-octopus-worker.js', // Link to WebAssembly worker\r\n preMain: true,\r\n renderMode: this.renderMode,\r\n subUrl: options.subUrl, // Link to sub file (optional if subContent specified)\r\n subContent: options.subContent || null, // Sub content (optional if subUrl specified)\r\n fallbackFont: options.fallbackFont || null, // Override fallback font, for example, with a CJK one. Default fallback font is Liberation Sans\r\n lazyFontLoading: options.lazyFontLoading || false, // Load fonts in a lazy way. Requires Access-Control-Expose-Headers for Accept-Ranges, Content-Length, and Content-Encoding. If Content-Encoding is compressed, file will be fully fetched instead of just a HEAD request.\r\n fonts: options.fonts || [], // Array with links to fonts used in sub (optional)\r\n availableFonts: options.availableFonts || [], // Object with all available fonts (optional). Key is font name in lower case, value is link: {\"arial\": \"/font1.ttf\"}\r\n debug: this.debug,\r\n targetFps: this.targetFps,\r\n libassMemoryLimit: options.libassMemoryLimit || 0, // set libass bitmap cache memory limit in MiB (approximate)\r\n libassGlyphLimit: options.libassGlyphLimit || 0, // set libass glyph cache memory limit in MiB (approximate)\r\n renderOnDemand: this.renderAhead > 0,\r\n dropAllAnimations: !!options.dropAllAnimations\r\n })\r\n if (this.renderMode === 'offscreen') this.pushOffscreenCanvas()\r\n this.initDone = true\r\n\r\n // test ImageData constructor\r\n ;(() => {\r\n if (typeof ImageData.prototype.constructor === 'function') {\r\n try {\r\n // try actually calling ImageData, as on some browsers it's reported\r\n // as existing but calling it errors out as \"TypeError: Illegal constructor\"\r\n return new ImageData(new Uint8ClampedArray([0, 0, 0, 0]), 1, 1)\r\n } catch (e) {\r\n console.log('detected that ImageData is not constructable despite browser saying so')\r\n }\r\n }\r\n\r\n const canvas = document.createElement('canvas')\r\n const ctx = canvas.getContext('2d')\r\n\r\n window.ImageData = () => {\r\n let i = 0\r\n let data\r\n if (arguments[0] instanceof Uint8ClampedArray) data = arguments[i++]\r\n const width = arguments[i++]\r\n const height = arguments[i]\r\n\r\n const imageData = ctx.createImageData(width, height)\r\n if (data) imageData.data.set(data)\r\n return imageData\r\n }\r\n })()\r\n\r\n // test alpha bug\r\n if (this.renderMode !== 'offscreen') {\r\n this.ctx = this.canvas.getContext('2d')\r\n this.bufferCanvas = document.createElement('canvas')\r\n this.bufferCanvasCtx = this.bufferCanvas.getContext('2d')\r\n\r\n // test for alpha bug, where e.g. WebKit can render a transparent pixel\r\n // (with alpha == 0) as non-black which then leads to visual artifacts\r\n this.bufferCanvas.width = 1\r\n this.bufferCanvas.height = 1\r\n const testBuf = new Uint8ClampedArray([0, 255, 0, 0])\r\n const testImage = new ImageData(testBuf, 1, 1)\r\n this.bufferCanvasCtx.clearRect(0, 0, 1, 1)\r\n this.ctx.clearRect(0, 0, 1, 1)\r\n const prePut = this.ctx.getImageData(0, 0, 1, 1).data\r\n this.bufferCanvasCtx.putImageData(testImage, 0, 0)\r\n this.ctx.drawImage(this.bufferCanvas, 0, 0)\r\n const postPut = this.ctx.getImageData(0, 0, 1, 1).data\r\n this.hasAlphaBug = prePut[1] !== postPut[1]\r\n if (this.hasAlphaBug) console.log('Detected a browser having issue with transparent pixels, applying workaround')\r\n }\r\n }\r\n\r\n workerError (error) {\r\n console.error('Worker error: ', error)\r\n if (this.onErrorEvent) this.onErrorEvent(error)\r\n if (!this.debug) {\r\n this.destroy()\r\n throw new Error('Worker error: ' + error)\r\n }\r\n }\r\n\r\n pushOffscreenCanvas () {\r\n const canvasControl = this.canvas.transferControlToOffscreen()\r\n this.worker.postMessage({\r\n target: 'offscreenCanvas',\r\n canvas: canvasControl\r\n }, [canvasControl])\r\n }\r\n\r\n createCanvas () {\r\n if (this.video) {\r\n this.canvas = document.createElement('canvas')\r\n this.canvas.className = 'subtitles-octopus-canvas'\r\n this.canvas.style.display = 'none'\r\n\r\n this.canvasParent = document.createElement('div')\r\n this.canvasParent.className = 'subtitles-octopus-canvas-parent'\r\n this.canvasParent.appendChild(this.canvas)\r\n\r\n if (this.video.nextSibling) {\r\n this.video.parentNode.insertBefore(this.canvasParent, this.video.nextSibling)\r\n } else {\r\n this.video.parentNode.appendChild(this.canvasParent)\r\n }\r\n } else {\r\n if (!this.canvas) {\r\n this.workerError('Don\\'t know where to render: you should give video or canvas in options.')\r\n }\r\n }\r\n }\r\n\r\n setVideo (video) {\r\n this.video = video\r\n if (this.video) {\r\n let state = this.video.paused\r\n const timeupdate = playing => {\r\n if (playing != null) state = playing\r\n this.setCurrentTime(this.video.paused || state, video.currentTime + this.timeOffset)\r\n }\r\n this.video.addEventListener('timeupdate', () => timeupdate(), false)\r\n this.video.addEventListener('progress', () => timeupdate(), false)\r\n\r\n this.video.addEventListener('waiting', () => timeupdate(true), false)\r\n this.video.addEventListener('pause', () => timeupdate(true), false)\r\n this.video.addEventListener('seeking', () => timeupdate(true), false)\r\n\r\n this.video.addEventListener('playing', () => timeupdate(false), false)\r\n\r\n this.video.addEventListener('seeked', () => {\r\n timeupdate(false)\r\n if (this.renderAhead > 0) {\r\n this._cleanPastRendered(this.video.currentTime + this.timeOffset, true)\r\n }\r\n }, false)\r\n\r\n this.video.addEventListener('ratechange', this.setRate.bind(this), false)\r\n\r\n // Support Element Resize Observer\r\n if (typeof ResizeObserver !== 'undefined') {\r\n this.ro = new ResizeObserver(this.resize.bind(this, 0, 0, 0, 0))\r\n this.ro.observe(this.video)\r\n }\r\n\r\n if (this.video.videoWidth > 0) {\r\n this.resize()\r\n } else {\r\n this.video.addEventListener('loadedmetadata', this.resize.bind(this, 0, 0, 0, 0), false)\r\n }\r\n }\r\n }\r\n\r\n getVideoPosition () {\r\n const videoRatio = this.video.videoWidth / this.video.videoHeight\r\n const { offsetWidth, offsetHeight } = this.video\r\n const elementRatio = offsetWidth / offsetHeight\r\n let width = offsetWidth\r\n let height = offsetHeight\r\n if (elementRatio > videoRatio) {\r\n width = Math.floor(offsetHeight * videoRatio)\r\n } else {\r\n height = Math.floor(offsetWidth / videoRatio)\r\n }\r\n\r\n const x = (offsetWidth - width) / 2\r\n const y = (offsetHeight - height) / 2\r\n\r\n return { width, height, x, y }\r\n }\r\n\r\n _cleanPastRendered (currentTime, seekClean) {\r\n let retainedItems = []\r\n for (const item of this.renderedItems) {\r\n if (item.emptyFinish < 0 || item.emptyFinish >= currentTime) {\r\n // item is not yet finished, retain it\r\n retainedItems.push(item)\r\n }\r\n }\r\n\r\n if (seekClean && retainedItems.length > 0) {\r\n // items are ordered by event start time when we push to this.renderedItems,\r\n // so first item is the earliest\r\n if (currentTime < retainedItems[0].eventStart) {\r\n if (retainedItems[0].eventStart - currentTime > 60) {\r\n console.info('seeked back too far, cleaning prerender buffer')\r\n retainedItems = []\r\n } else {\r\n console.info('seeked backwards, need to free up some buffer')\r\n let size = 0; const limit = this.renderAhead * 0.3 /* try to take no more than 1/3 of buffer */\r\n const retain = []\r\n for (const item of retainedItems) {\r\n size += item.size\r\n if (size >= limit) break\r\n retain.push(item)\r\n }\r\n retainedItems = retain\r\n }\r\n }\r\n }\r\n\r\n const removed = retainedItems.length < this.renderedItems\r\n this.renderedItems = retainedItems\r\n return removed\r\n }\r\n\r\n // Oneshot stuff\r\n processOneshot (data) {\r\n if (data.iteration !== this.oneshotState.iteration) {\r\n console.debug('received stale prerender, ignoring')\r\n return\r\n }\r\n\r\n if (this.debug) {\r\n console.info('oneshot received (start=' +\r\n data.eventStart + ', empty=' + data.emptyFinish +\r\n '), render: ' + Math.round(data.spentTime) + ' ms')\r\n }\r\n this.oneshotState.renderRequested = false\r\n if (Math.abs(data.lastRenderedTime - this.oneshotState.requestNextTimestamp) < 0.01) {\r\n this.oneshotState.requestNextTimestamp = -1\r\n }\r\n if (data.eventStart - data.lastRenderedTime > 0.01) {\r\n // generate bogus empty element, so all timeline is covered anyway\r\n this.renderedItems.push({\r\n eventStart: data.lastRenderedTime,\r\n eventFinish: data.lastRenderedTime - 0.001,\r\n emptyFinish: data.eventStart,\r\n viewport: data.viewport,\r\n spentTime: 0,\r\n blendTime: 0,\r\n items: [],\r\n animated: false,\r\n size: 0\r\n })\r\n }\r\n\r\n const items = []\r\n let size = 0\r\n for (const item of data.canvases) {\r\n items.push({\r\n ...item,\r\n image: new ImageData(new Uint8ClampedArray(item.buffer), item.w, item.h)\r\n })\r\n size += item.buffer.byteLength\r\n }\r\n\r\n let eventSplitted = false\r\n if ((data.emptyFinish > 0 && data.emptyFinish - data.eventStart < 1.0 / this.targetFps) || data.animated) {\r\n const newFinish = data.eventStart + 1.0 / this.targetFps\r\n data.emptyFinish = newFinish\r\n data.eventFinish = newFinish\r\n eventSplitted = true\r\n }\r\n this.renderedItems.push({\r\n ...data,\r\n items: items,\r\n size: size\r\n })\r\n\r\n this.renderedItems.sort((a, b) => a.eventStart - b.eventStart)\r\n\r\n if (this.oneshotState.requestNextTimestamp >= 0) {\r\n // requesting an out of order event render\r\n this.tryRequestOneshot(this.oneshotState.requestNextTimestamp, true)\r\n } else if (data.eventStart < 0) {\r\n console.info('oneshot received \"end of frames\" event')\r\n } else if (data.emptyFinish >= 0) {\r\n // there's some more event to render, try requesting next event\r\n this.tryRequestOneshot(data.emptyFinish, eventSplitted)\r\n } else {\r\n console.info('there are no more events to prerender')\r\n }\r\n }\r\n\r\n tryRequestOneshot (currentTime, renderNow) {\r\n if (!this.renderAhead || this.renderAhead <= 0) return\r\n if (this.oneshotState.renderRequested && !renderNow) return\r\n\r\n if (typeof currentTime === 'undefined') {\r\n if (!this.video) return\r\n currentTime = this.video.currentTime + this.timeOffset\r\n }\r\n\r\n let size = 0\r\n for (const item of this.renderedItems) {\r\n if (item.emptyFinish < 0) {\r\n console.info('oneshot already reached end-of-events')\r\n return\r\n }\r\n if (currentTime >= item.eventStart && currentTime < item.emptyFinish) {\r\n // an event for requested time already exists\r\n console.debug('not requesting a render for ' + currentTime +\r\n ' as event already covering it exists (start=' +\r\n item.eventStart + ', empty=' + item.emptyFinish + ')')\r\n return\r\n }\r\n size += item.size\r\n }\r\n\r\n if (size <= this.renderAhead) {\r\n const lastRendered = currentTime - (renderNow ? 0 : 0.001)\r\n if (!this.oneshotState.renderRequested) {\r\n this.oneshotState.renderRequested = true\r\n this.worker.postMessage({\r\n target: 'oneshot-render',\r\n lastRendered: lastRendered,\r\n renderNow: renderNow,\r\n iteration: this.oneshotState.iteration\r\n })\r\n } else {\r\n if (this.workerActive) console.info('worker busy, requesting to seek')\r\n this.oneshotState.requestNextTimestamp = lastRendered\r\n }\r\n }\r\n }\r\n\r\n _renderSubtitleEvent (event, currentTime) {\r\n const eventOver = event.eventFinish < currentTime\r\n if (this.oneshotState.eventStart === event.eventStart && this.oneshotState.eventOver === eventOver) return\r\n this.oneshotState.eventStart = event.eventStart\r\n this.oneshotState.eventOver = eventOver\r\n\r\n const beforeDrawTime = performance.now()\r\n if (event.viewport.width !== this.canvas.width || event.viewport.height !== this.canvas.height) {\r\n this.canvas.width = event.viewport.width\r\n this.canvas.height = event.viewport.height\r\n }\r\n this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height)\r\n if (!eventOver) {\r\n for (const image of event.items) {\r\n this.bufferCanvas.width = image.w\r\n this.bufferCanvas.height = image.h\r\n this.bufferCanvasCtx.putImageData(image.image, 0, 0)\r\n this.ctx.drawImage(this.bufferCanvas, image.x, image.y)\r\n }\r\n }\r\n if (this.debug) {\r\n const drawTime = Math.round(performance.now() - beforeDrawTime)\r\n console.log('render: ' + Math.round(event.spentTime - event.blendTime) + ' ms, blend: ' + Math.round(event.blendTime) + ' ms, draw: ' + drawTime + ' ms')\r\n }\r\n }\r\n\r\n oneshotRender () {\r\n window.requestAnimationFrame(this.oneshotRender)\r\n if (!this.video) return\r\n\r\n const currentTime = this.video.currentTime + this.timeOffset\r\n let finishTime = -1; let eventShown = false; let animated = false\r\n for (const item of this.renderedItems) {\r\n if (!eventShown && item.eventStart <= currentTime && (item.emptyFinish < 0 || item.emptyFinish > currentTime)) {\r\n this._renderSubtitleEvent(item, currentTime)\r\n eventShown = true\r\n finishTime = item.emptyFinish\r\n } else if (finishTime >= 0) {\r\n // we've already found a known event, now find\r\n // the farthest point of consequent events\r\n // NOTE: this.renderedItems may have gaps due to seeking\r\n if (item.eventStart - finishTime < 0.01) {\r\n finishTime = item.emptyFinish\r\n animated = item.animated\r\n } else {\r\n break\r\n }\r\n }\r\n }\r\n\r\n if (!eventShown) {\r\n if (Math.abs(this.oneshotState.requestNextTimestamp - currentTime) > 0.01) {\r\n this._cleanPastRendered(currentTime)\r\n this.tryRequestOneshot(currentTime, true)\r\n }\r\n } else if (this._cleanPastRendered(currentTime) && finishTime >= 0) {\r\n this.tryRequestOneshot(finishTime, animated)\r\n }\r\n }\r\n\r\n resetRenderAheadCache (isResizing) {\r\n if (this.renderAhead > 0) {\r\n const newCache = []\r\n if (isResizing && this.oneshotState.prevHeight && this.oneshotState.prevWidth) {\r\n if (this.oneshotState.prevHeight === this.canvas.height && this.oneshotState.prevWidth === this.canvas.width) return\r\n let timeLimit = 10; let sizeLimit = this.renderAhead * 0.3\r\n if (this.canvas.height >= this.oneshotState.prevHeight * (1.0 - this.resizeVariation) &&\r\n this.canvas.height <= this.oneshotState.prevHeight * (1.0 + this.resizeVariation) &&\r\n this.canvas.width >= this.oneshotState.prevWidth * (1.0 - this.resizeVariation) &&\r\n this.canvas.width <= this.oneshotState.prevWidth * (1.0 + this.resizeVariation)) {\r\n console.debug('viewport changes are small, leaving more of prerendered buffer')\r\n timeLimit = 30\r\n sizeLimit = this.renderAhead * 0.5\r\n }\r\n const stopTime = this.video.currentTime + this.timeOffset + timeLimit\r\n let size = 0\r\n for (const item of this.renderedItems) {\r\n if (item.emptyFinish < 0 || item.emptyFinish >= stopTime) break\r\n size += item.size\r\n if (size >= sizeLimit) break\r\n newCache.push(item)\r\n }\r\n }\r\n\r\n console.info('resetting prerender cache')\r\n this.renderedItems = newCache\r\n this.oneshotState.eventStart = null\r\n this.oneshotState.iteration++\r\n this.oneshotState.renderRequested = false\r\n this.oneshotState.prevHeight = this.canvas.height\r\n this.oneshotState.prevWidth = this.canvas.width\r\n\r\n window.requestAnimationFrame(this.oneshotRender)\r\n this.tryRequestOneshot(undefined, true)\r\n }\r\n }\r\n\r\n // Rendering\r\n renderFrames (data) {\r\n const beforeDrawTime = performance.now()\r\n this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height)\r\n for (const image of data.canvases) {\r\n this.bufferCanvas.width = image.w\r\n this.bufferCanvas.height = image.h\r\n const imageBuffer = new Uint8ClampedArray(image.buffer)\r\n if (this.hasAlphaBug) {\r\n for (let j = 3; j < imageBuffer.length; j += 4) {\r\n imageBuffer[j] = (imageBuffer[j] >= 1) ? imageBuffer[j] : 1\r\n }\r\n }\r\n const imageData = new ImageData(imageBuffer, image.w, image.h)\r\n this.bufferCanvasCtx.putImageData(imageData, 0, 0)\r\n this.ctx.drawImage(this.bufferCanvas, image.x, image.y)\r\n }\r\n if (this.debug) {\r\n const drawTime = performance.now() - beforeDrawTime\r\n const blendTime = data.blendTime\r\n if (typeof blendTime !== 'undefined') {\r\n console.log('render: ' + Math.round(data.spentTime - blendTime) + ' ms, blend: ' + Math.round(blendTime) + ' ms, draw: ' + drawTime + ' ms; TOTAL=' + Math.round(data.spentTime + drawTime) + ' ms')\r\n } else {\r\n console.log({ length: data.canvases.length, sum: data.libassTime + data.decodeTime + drawTime, libassTime: data.libassTime, decodeTime: data.decodeTime, drawTime })\r\n }\r\n this.renderStart = performance.now()\r\n }\r\n }\r\n\r\n renderFastFrames (data) {\r\n const beforeDrawTime = performance.now()\r\n this.ctx.clearRect(0, 0, this.canvas.width, this.canvas.height)\r\n for (const image of data.bitmaps) {\r\n this.ctx.drawImage(image.bitmap, image.x, image.y)\r\n }\r\n if (this.debug) {\r\n const drawTime = performance.now() - beforeDrawTime\r\n console.log({ length: data.bitmaps.length, sum: data.libassTime + data.decodeTime + drawTime, libassTime: data.libassTime, decodeTime: data.decodeTime, drawTime })\r\n this.renderStart = performance.now()\r\n }\r\n }\r\n\r\n _computeCanvasSize (width, height) {\r\n if (this.prescaleTradeoff === null) {\r\n if (height > this.hardHeightLimit) {\r\n width = width * this.hardHeightLimit / height\r\n height = this.hardHeightLimit\r\n }\r\n } else if (this.prescaleTradeoff > 1) {\r\n if (height * this.prescaleTradeoff <= this.softHeightLimit) {\r\n width *= this.prescaleTradeoff\r\n height *= this.prescaleTradeoff\r\n } else if (height < this.softHeightLimit) {\r\n width = width * this.softHeightLimit / height\r\n height = this.softHeightLimit\r\n } else if (height >= this.hardHeightLimit) {\r\n width = width * this.hardHeightLimit / height\r\n height = this.hardHeightLimit\r\n }\r\n } else if (height >= this.softHeightLimit) {\r\n if (height * this.prescaleTradeoff <= this.softHeightLimit) {\r\n width = width * this.softHeightLimit / height\r\n height = this.softHeightLimit\r\n } else if (height * this.prescaleTradeoff <= this.hardHeightLimit) {\r\n width *= this.prescaleTradeoff\r\n height *= this.prescaleTradeoff\r\n } else {\r\n width = width * this.hardHeightLimit / height\r\n height = this.hardHeightLimit\r\n }\r\n }\r\n\r\n return { width, height }\r\n }\r\n\r\n resize (width = 0, height = 0, top = 0, left = 0) {\r\n let videoSize = null\r\n if ((!width || !height) && this.video) {\r\n videoSize = this.getVideoPosition()\r\n const newsize = this._computeCanvasSize(videoSize.width * (window.devicePixelRatio || 1), videoSize.height * (window.devicePixelRatio || 1))\r\n width = newsize.width\r\n height = newsize.height\r\n const offset = this.canvasParent.getBoundingClientRect().top - this.video.getBoundingClientRect().top\r\n top = videoSize.y - offset\r\n left = videoSize.x\r\n }\r\n\r\n if (this.canvas.style.top !== top || this.canvas.style.left !== left) {\r\n if (videoSize != null) {\r\n this.canvasParent.style.position = 'relative'\r\n this.canvas.style.display = 'block'\r\n this.canvas.style.position = 'absolute'\r\n this.canvas.style.top = top + 'px'\r\n this.canvas.style.left = left + 'px'\r\n this.canvas.style.pointerEvents = 'none'\r\n this.canvas.style.width = videoSize.width + 'px'\r\n this.canvas.style.height = videoSize.height + 'px'\r\n }\r\n if (!(this.canvas.width === width && this.canvas.height === height)) {\r\n // only re-paint if dimensions actually changed\r\n if (this.renderMode === 'offscreen' && this.initDone) {\r\n this.canvasParent.remove()\r\n this.canvasParent = undefined\r\n this.createCanvas()\r\n }\r\n // dont spam re-paints like crazy when re-sizing with animations, but still update instantly without them\r\n if (this.resizeTimeoutBuffer) {\r\n clearTimeout(this.resizeTimeoutBuffer)\r\n this.resizeTimeoutBuffer = setTimeout(() => {\r\n this.resizeTimeoutBuffer = undefined\r\n this.rePaint(width, height, top, left, videoSize)\r\n }, 50)\r\n } else {\r\n this.rePaint(width, height, top, left, videoSize)\r\n this.resizeTimeoutBuffer = setTimeout(() => {\r\n this.resizeTimeoutBuffer = undefined\r\n }, 50)\r\n }\r\n }\r\n }\r\n }\r\n\r\n rePaint (width = 0, height = 0, top = 0, left = 0, videoSize) {\r\n if (this.renderMode === 'offscreen' && this.canvasParent && this.initDone) {\r\n this.canvasParent.remove()\r\n this.canvasParent = undefined\r\n this.createCanvas()\r\n }\r\n this.canvas.width = width\r\n this.canvas.height = height\r\n\r\n if (videoSize != null) {\r\n this.canvasParent.style.position = 'relative'\r\n this.canvas.style.display = 'block'\r\n this.canvas.style.position = 'absolute'\r\n this.canvas.style.top = top + 'px'\r\n this.canvas.style.left = left + 'px'\r\n this.canvas.style.pointerEvents = 'none'\r\n this.canvas.style.width = videoSize.width + 'px'\r\n this.canvas.style.height = videoSize.height + 'px'\r\n }\r\n\r\n if (this.renderMode === 'offscreen' && this.initDone) {\r\n this.pushOffscreenCanvas()\r\n }\r\n this.worker.postMessage({\r\n target: 'canvas',\r\n width: this.canvas.width,\r\n height: this.canvas.height\r\n })\r\n this.resetRenderAheadCache(true)\r\n }\r\n\r\n onWorkerMessage (event) {\r\n if (!this.workerActive) {\r\n this.workerActive = true\r\n if (this.onReadyEvent) {\r\n this.onReadyEvent()\r\n }\r\n }\r\n const data = event.data\r\n switch (data.target) {\r\n case 'stdout': {\r\n console.log(data.content)\r\n break\r\n }\r\n case 'stderr': {\r\n console.error(data.content)\r\n break\r\n }\r\n case 'canvas': {\r\n switch (data.op) {\r\n case 'renderCanvas': {\r\n if (this.lastRenderTime < data.time) {\r\n this.lastRenderTime = data.time\r\n window.requestAnimationFrame(this.renderFrames.bind(this, data))\r\n }\r\n break\r\n }\r\n case 'renderFastCanvas': {\r\n if (this.lastRenderTime < data.time) {\r\n this.lastRenderTime = data.time\r\n window.requestAnimationFrame(this.renderFastFrames.bind(this, data))\r\n }\r\n break\r\n }\r\n case 'oneshot-result': {\r\n this.processOneshot(data)\r\n break\r\n }\r\n default:\r\n throw data.target\r\n }\r\n break\r\n }\r\n case 'tick': {\r\n this.frameId = data.id\r\n this.worker.postMessage({\r\n target: 'tock',\r\n id: this.frameId\r\n })\r\n break\r\n }\r\n case 'custom': {\r\n if (this.onCustomMessage) {\r\n this.onCustomMessage(event)\r\n } else {\r\n console.error('Custom message received but client onCustomMessage not implemented.')\r\n }\r\n break\r\n }\r\n case 'ready': {\r\n break\r\n }\r\n default:\r\n console.log(data)\r\n break\r\n }\r\n }\r\n\r\n runBenchmark () {\r\n this.worker.postMessage({\r\n target: 'runBenchmark'\r\n })\r\n }\r\n\r\n customMessage (data, options = {}) {\r\n this.worker.postMessage({\r\n target: 'custom',\r\n userData: data,\r\n preMain: options.preMain\r\n })\r\n }\r\n\r\n setCurrentTime (isPaused, currentTime) {\r\n this.worker.postMessage({\r\n target: 'video',\r\n isPaused: isPaused,\r\n currentTime: currentTime\r\n })\r\n }\r\n\r\n setTrackByUrl (url) {\r\n this.worker.postMessage({\r\n target: 'set-track-by-url',\r\n url: url\r\n })\r\n this.resetRenderAheadCache(false)\r\n }\r\n\r\n setTrack (content) {\r\n this.worker.postMessage({\r\n target: 'set-track',\r\n content: content\r\n })\r\n this.resetRenderAheadCache(false)\r\n }\r\n\r\n freeTrack () {\r\n this.worker.postMessage({\r\n target: 'free-track'\r\n })\r\n this.resetRenderAheadCache(false)\r\n }\r\n\r\n setRate () {\r\n this.worker.postMessage({\r\n target: 'video',\r\n rate: this.video.playbackRate\r\n })\r\n }\r\n\r\n destroy () {\r\n this.worker.postMessage({\r\n target: 'destroy'\r\n })\r\n\r\n this.worker.terminate()\r\n this.workerActive = false\r\n // Remove the canvas element to remove residual subtitles rendered on player\r\n if (this.video) this.video.parentNode.removeChild(this.canvasParent)\r\n }\r\n\r\n createEvent (event) {\r\n this.worker.postMessage({\r\n target: 'create-event',\r\n event: event\r\n })\r\n }\r\n\r\n getEvents () {\r\n this.worker.postMessage({\r\n target: 'get-events'\r\n })\r\n }\r\n\r\n setEvent (event, index) {\r\n this.worker.postMessage({\r\n target: 'set-event',\r\n event: event,\r\n index: index\r\n })\r\n }\r\n\r\n removeEvent (index) {\r\n this.worker.postMessage({\r\n target: 'remove-event',\r\n index: index\r\n })\r\n }\r\n\r\n createStyle (style) {\r\n this.worker.postMessage({\r\n target: 'create-style',\r\n style: style\r\n })\r\n }\r\n\r\n getStyles () {\r\n this.worker.postMessage({\r\n target: 'get-styles'\r\n })\r\n }\r\n\r\n setStyle (style, index) {\r\n this.worker.postMessage({\r\n target: 'set-style',\r\n style: style,\r\n index: index\r\n })\r\n }\r\n\r\n removeStyle (index) {\r\n this.worker.postMessage({\r\n target: 'remove-style',\r\n index: index\r\n })\r\n }\r\n}\r\n","function waitToCompleteIceGathering (pc, state = pc.iceGatheringState) {\n return state !== 'complete' && new Promise(resolve => {\n pc.addEventListener('icegatheringstatechange', () => (pc.iceGatheringState === 'complete') && resolve())\n })\n}\n\n/**\n * @typedef {AddEventListenerOptions} Test~options\n * @property {AbortSignal} signal - funkis?\n */\n\nexport default class Peer {\n /**\n * @param {{\n * polite: boolean,\n * trickle: boolean,\n * iceServers: RTCIceServer[]\n * signal: AbortSignal\n * }} [options]\n */\n constructor (options = {}) {\n let { polite = true, trickle = true } = options\n\n let { port1, port2 } = new MessageChannel()\n let send = msg => port2.postMessage(JSON.stringify(msg))\n\n const pc = new RTCPeerConnection({\n iceServers: options?.iceServers || [{\n urls: [\n 'stun:stun.l.google.com:19302',\n 'stun:global.stun.twilio.com:3478'\n ]\n }]\n })\n\n const ctrl = new AbortController()\n\n /** @type {any} dummy alias for AbortSignal to make TS happy */\n const signal = { signal: ctrl.signal }\n\n pc.addEventListener('iceconnectionstatechange', () => {\n if (\n pc.iceConnectionState === 'disconnected' ||\n pc.iceConnectionState === 'failed'\n ) {\n ctrl.abort()\n }\n }, signal)\n\n const dc = pc.createDataChannel('both', { negotiated: true, id: 0 })\n\n this.pc = pc\n this.dc = dc\n this.signal = ctrl.signal\n this.polite = polite\n this.signalingPort = port1\n\n this.ready = new Promise(resolve => {\n dc.addEventListener('open', () => {\n // At this point we start to trickle over datachannel instead\n // we also close the message channel as we do not need it anymore\n trickle = true\n send = (msg) => dc.send(JSON.stringify(msg))\n port1.close()\n port2.close()\n this.ready = port2 = port1 = port2.onmessage = null\n resolve()\n }, { once: true, ...signal })\n })\n\n pc.addEventListener('icecandidate', ({ candidate }) => {\n trickle && send({ candidate })\n }, { ...signal })\n\n // The rest is the polite peer negotiation logic, copied from this blog\n\n let makingOffer = false; let ignoreOffer = false\n\n pc.addEventListener('negotiationneeded', async () => {\n makingOffer = true\n const offer = await pc.createOffer()\n if (pc.signalingState !== 'stable') return\n await pc.setLocalDescription(offer)\n makingOffer = false\n if (trickle) {\n send({ description: pc.localDescription })\n } else {\n await waitToCompleteIceGathering(pc)\n const description = pc.localDescription.toJSON()\n description.sdp = description.sdp.replace(/a=ice-options:trickle\\s\\n/g, '')\n send({ description })\n }\n }, { ...signal })\n\n async function onmessage ({ data }) {\n const { description, candidate } = typeof data === 'string' ? JSON.parse(data) : data\n\n if (description) {\n const offerCollision = description.type === 'offer' &&\n (makingOffer || pc.signalingState !== 'stable')\n\n ignoreOffer = !this.polite && offerCollision\n if (ignoreOffer) {\n return\n }\n\n if (offerCollision) {\n await Promise.all([\n pc.setLocalDescription({ type: 'rollback' }),\n pc.setRemoteDescription(description)\n ])\n } else {\n try {\n (description.type === 'answer' && pc.signalingState === 'stable') ||\n await pc.setRemoteDescription(description)\n } catch (err) { }\n }\n if (description.type === 'offer') {\n await pc.setLocalDescription(await pc.createAnswer())\n // Edge didn't set the state to 'new' after calling the above :[\n if (!trickle) await waitToCompleteIceGathering(pc, 'new')\n send({ description: pc.localDescription })\n }\n } else if (candidate) {\n await pc.addIceCandidate(candidate)\n }\n }\n\n port2.onmessage = onmessage.bind(this)\n dc.addEventListener('message', onmessage.bind(this), { ...signal })\n }\n}\nwindow.Peer = Peer\n","/* global MediaMetadata, navNowPlaying */\r\nimport WebTorrent from 'webtorrent'\r\nimport { SubtitleParser, SubtitleStream } from 'matroska-subtitles'\r\nimport HybridChunkStore from 'hybrid-chunk-store'\r\nimport SubtitlesOctopus from './lib/subtitles-octopus.js'\r\nimport Peer from './lib/peer.js'\r\n\r\nconst units = [' B', ' KB', ' MB', ' GB', ' TB']\r\n\r\nfunction requestTimeout (callback, delay) {\r\n const startedAt = Date.now()\r\n let animationFrame = requestAnimationFrame(tick)\r\n function tick () {\r\n if (Date.now() - startedAt >= delay) {\r\n callback()\r\n } else {\r\n animationFrame = requestAnimationFrame(tick)\r\n }\r\n }\r\n return {\r\n clear: () => cancelAnimationFrame(animationFrame)\r\n }\r\n}\r\n\r\nfunction cancelTimeout (timeout) {\r\n if (timeout) {\r\n timeout.clear()\r\n }\r\n}\r\n\r\nexport default class WebTorrentPlayer extends WebTorrent {\r\n constructor (options = {}) {\r\n super(options.WebTorrentOpts)\r\n\r\n this.storeOpts = options.storeOpts || {}\r\n\r\n const scope = location.pathname.substr(0, location.pathname.lastIndexOf('/') + 1)\r\n const worker = location.origin + scope + 'sw.js' === navigator.serviceWorker?.controller?.scriptURL && navigator.serviceWorker.controller\r\n const handleWorker = worker => {\r\n const checkState = worker => {\r\n return worker.state === 'activated' && this.loadWorker(worker)\r\n }\r\n if (!checkState(worker)) {\r\n worker.addEventListener('statechange', ({ target }) => checkState(target))\r\n }\r\n }\r\n if (worker) {\r\n handleWorker(worker)\r\n } else {\r\n navigator.serviceWorker.register('sw.js', { scope }).then(reg => {\r\n handleWorker(reg.active || reg.waiting || reg.installing)\r\n }).catch(e => {\r\n if (String(e) === 'InvalidStateError: Failed to register a ServiceWorker: The document is in an invalid state.') {\r\n location.reload() // weird workaround for a weird bug\r\n } else {\r\n throw e\r\n }\r\n })\r\n }\r\n window.addEventListener('beforeunload', () => {\r\n this.destroy()\r\n this.cleanupVideo()\r\n })\r\n\r\n this.video = options.video\r\n this.controls = options.controls || {} // object of controls\r\n // playPause, playNext, playLast, openPlaylist, toggleMute, setVolume, setProgress, selectCaptions, selectAudio, toggleTheatre, toggleFullscreen, togglePopout, forward, rewind\r\n\r\n if (this.controls.setVolume) {\r\n this.controls.setVolume.addEventListener('input', e => this.setVolume(e.target.value))\r\n this.setVolume()\r\n this.oldVolume = undefined\r\n if ('audioTracks' in HTMLVideoElement.prototype && this.controls.audioButton) {\r\n this.video.addEventListener('loadedmetadata', () => {\r\n if (this.video.audioTracks.length > 1) {\r\n this.controls.audioButton.removeAttribute('disabled')\r\n for (const track of this.video.audioTracks) {\r\n this.createRadioElement(track, 'audio')\r\n }\r\n } else {\r\n this.controls.audioButton.setAttribute('disabled', '')\r\n }\r\n })\r\n }\r\n }\r\n if (this.controls.ppToggle) {\r\n this.controls.ppToggle.addEventListener('click', () => this.playPause())\r\n this.controls.ppToggle.addEventListener('dblclick', () => this.toggleFullscreen())\r\n }\r\n\r\n if (this.controls.setProgress) {\r\n this.controls.setProgress.addEventListener('input', e => this.setProgress(e.target.value))\r\n this.controls.setProgress.addEventListener('mouseup', e => this.dragBarEnd(e.target.value))\r\n this.controls.setProgress.addEventListener('touchend', e => this.dragBarEnd(e.target.value))\r\n this.controls.setProgress.addEventListener('mousedown', e => this.dragBarStart(e.target.value))\r\n this.video.addEventListener('timeupdate', e => {\r\n if (this.immerseTimeout && document.location.hash === '#player' && !this.video.paused) this.setProgress(e.target.currentTime / e.target.duration * 100)\r\n })\r\n this.video.addEventListener('ended', () => this.setProgress(100))\r\n }\r\n\r\n this.video.addEventListener('loadedmetadata', () => this.findSubtitleFiles(this.currentFile))\r\n this.subtitleData = {\r\n fonts: [],\r\n headers: [],\r\n tracks: [],\r\n current: undefined,\r\n renderer: undefined,\r\n stream: undefined,\r\n parser: undefined,\r\n parsed: undefined,\r\n timeout: undefined,\r\n defaultHeader: `[V4+ Styles]\r\nFormat: Name, Fontname, Fontsize, PrimaryColour, SecondaryColour, OutlineColour, BackColour, Bold, Italic, Underline, StrikeOut, ScaleX, ScaleY, Spacing, Angle, BorderStyle, Outline, Shadow, Alignment, MarginL, MarginR, MarginV, Encoding\r\nStyle: Default,${options.defaultSSAStyles || 'Roboto Medium,26,&H00FFFFFF,&H000000FF,&H00020713,&H00000000,0,0,0,0,100,100,0,0,1,1.3,0,2,20,20,23,1'}\r\n[Events]\r\n\r\n`\r\n }\r\n\r\n this.completed = false\r\n this.video.addEventListener('timeupdate', () => this.checkCompletion())\r\n\r\n this.nextTimeout = undefined\r\n if (options.autoNext) this.video.addEventListener('ended', () => this.playNext())\r\n\r\n this.resolveFileMedia = options.resolveFileMedia\r\n this.currentFile = undefined\r\n this.videoFile = undefined\r\n\r\n if (this.controls.thumbnail) {\r\n this.generateThumbnails = options.generateThumbnails\r\n const thumbCanvas = document.createElement('canvas')\r\n thumbCanvas.width = options.thumbnailWidth || 150\r\n this.thumbnailData = {\r\n thumbnails: [],\r\n canvas: thumbCanvas,\r\n context: thumbCanvas.getContext('2d'),\r\n interval: undefined,\r\n video: undefined\r\n }\r\n this.video.addEventListener('loadedmetadata', () => this.initThumbnail())\r\n this.video.addEventListener('timeupdate', () => this.createThumbnail(this.video))\r\n }\r\n\r\n if (options.visibilityLossPause) {\r\n this.wasPaused = true\r\n document.addEventListener('visibilitychange', () => {\r\n if (!this.video.ended) {\r\n if (document.visibilityState === 'hidden') {\r\n this.wasPaused = this.video.paused\r\n this.video.pause()\r\n } else {\r\n if (!this.wasPaused) this.playPause()\r\n }\r\n }\r\n })\r\n }\r\n\r\n this.onDone = undefined\r\n\r\n this.destroyStore = options.destroyStore != null ? !!options.destroyStore : true\r\n\r\n this.immerseTimeout = undefined\r\n this.immerseTime = options.immerseTime || 5\r\n\r\n this.playerWrapper = options.playerWrapper\r\n this.player = options.player\r\n if (this.player) {\r\n this.player.addEventListener('fullscreenchange', () => this.updateFullscreen())\r\n this.player.addEventListener('mousemove', () => requestAnimationFrame(() => this.resetImmerse()))\r\n this.player.addEventListener('touchmove', () => requestAnimationFrame(() => this.resetImmerse()))\r\n this.player.addEventListener('keypress', () => requestAnimationFrame(() => this.resetImmerse()))\r\n this.player.addEventListener('mouseleave', () => requestAnimationFrame(() => this.immersePlayer()))\r\n\r\n this.doubleTapTimeout = undefined\r\n this.player.addEventListener('touchend', e => {\r\n if (this.doubleTapTimeout) {\r\n e.preventDefault()\r\n clearTimeout(this.doubleTapTimeout)\r\n this.doubleTapTimeout = undefined\r\n this.toggleFullscreen()\r\n } else {\r\n this.doubleTapTimeout = setTimeout(() => {\r\n this.doubleTapTimeout = undefined\r\n }, 200)\r\n }\r\n })\r\n }\r\n\r\n this.bufferTimeout = undefined\r\n this.video.addEventListener('playing', () => this.hideBuffering())\r\n this.video.addEventListener('canplay', () => this.hideBuffering())\r\n this.video.addEventListener('loadeddata', () => this.hideBuffering())\r\n this.video.addEventListener('waiting', () => this.showBuffering())\r\n\r\n const handleAvailability = aval => {\r\n if (aval) {\r\n this.controls.toggleCast.removeAttribute('disabled')\r\n } else {\r\n this.controls.toggleCast.setAttribute('disabled', '')\r\n }\r\n }\r\n if ('PresentationRequest' in window) {\r\n this.presentationRequest = new PresentationRequest(['lib/cast.html'])\r\n this.presentationRequest.addEventListener('connectionavailable', e => this.initCast(e))\r\n this.presentationConnection = null\r\n navigator.presentation.defaultRequest = this.presentationRequest\r\n this.presentationRequest.getAvailability().then(aval => {\r\n aval.onchange = e => handleAvailability(e.target.value)\r\n handleAvailability(aval.value)\r\n })\r\n } else {\r\n this.controls.toggleCast.setAttribute('disabled', '')\r\n }\r\n\r\n if ('pictureInPictureEnabled' in document) {\r\n this.burnIn = options.burnIn\r\n if (this.controls.togglePopout) this.controls.togglePopout.removeAttribute('disabled')\r\n if (this.burnIn) this.video.addEventListener('enterpictureinpicture', () => { if (this.subtitleData.renderer) this.togglePopout() })\r\n } else {\r\n this.video.setAttribute('disablePictureInPicture', '')\r\n if (this.controls.togglePopout) this.controls.togglePopout.setAttribute('disabled', '')\r\n }\r\n\r\n this.seekTime = options.seekTime || 5\r\n if ('mediaSession' in navigator) {\r\n navigator.mediaSession.setActionHandler('play', () => this.playPause())\r\n navigator.mediaSession.setActionHandler('pause', () => this.playPause())\r\n navigator.mediaSession.setActionHandler('seekbackward', () => this.seek(this.seekTime))\r\n navigator.mediaSession.setActionHandler('seekforward', () => this.seek(this.seekTime))\r\n navigator.mediaSession.setActionHandler('nexttrack', () => this.playNext())\r\n if ('setPositionState' in navigator.mediaSession) this.video.addEventListener('timeupdate', () => this.updatePositionState())\r\n }\r\n\r\n this.subtitleExtensions = ['.srt', '.vtt', '.ass', '.ssa']\r\n this.videoExtensions = ['.3g2', '.3gp', '.asf', '.avi', '.dv', '.flv', '.gxf', '.m2ts', '.m4a', '.m4b', '.m4p', '.m4r', '.m4v', '.mkv', '.mov', '.mp4', '.mpd', '.mpeg', '.mpg', '.mxf', '.nut', '.ogm', '.ogv', '.swf', '.ts', '.vob', '.webm', '.wmv', '.wtv']\r\n this.videoFiles = undefined\r\n\r\n this.updateDisplay()\r\n this.offlineTorrents = JSON.parse(localStorage.getItem('offlineTorrents')) || {}\r\n // adds all offline store torrents to the client\r\n Object.values(this.offlineTorrents).forEach(torrentID => this.offlineDownload(new Blob([new Uint8Array(torrentID)])))\r\n\r\n this.streamedDownload = options.streamedDownload\r\n\r\n this.fps = 23.976\r\n if ('requestVideoFrameCallback' in HTMLVideoElement.prototype) {\r\n this.video.addEventListener('loadeddata', () => {\r\n this.fps = new Promise(resolve => {\r\n let lastmeta = null\r\n let waspaused = false\r\n let count = 0\r\n\r\n const handleFrames = (now, metadata) => {\r\n if (count) { // resolve on 2nd frame, 1st frame might be a cut-off\r\n if (lastmeta) {\r\n const msbf = (metadata.mediaTime - lastmeta.mediaTime) / (metadata.presentedFrames - lastmeta.presentedFrames)\r\n const rawFPS = (1 / msbf).toFixed(3)\r\n // this is accurate for mp4, mkv is a few ms off\r\n if (this.currentFile.name.endsWith('.mkv')) {\r\n if (rawFPS < 25 && rawFPS > 22) {\r\n resolve(23.976)\r\n } else if (rawFPS < 31 && rawFPS > 28) {\r\n resolve(29.97)\r\n } else if (rawFPS < 62 && rawFPS > 58) {\r\n resolve(59.94)\r\n } else {\r\n resolve(rawFPS) // smth went VERY wrong\r\n }\r\n } else {\r\n resolve(rawFPS)\r\n }\r\n if (waspaused) this.video.pause()\r\n } else {\r\n lastmeta = metadata\r\n this.video.requestVideoFrameCallback(handleFrames)\r\n }\r\n } else {\r\n count++\r\n if (this.video.paused) {\r\n waspaused = true\r\n this.video.play()\r\n }\r\n this.video.requestVideoFrameCallback(handleFrames)\r\n }\r\n }\r\n this.video.requestVideoFrameCallback(handleFrames)\r\n })\r\n })\r\n }\r\n\r\n for (const [functionName, elements] of Object.entries(this.controls)) {\r\n if (this[functionName]) {\r\n if (elements.constructor === Array) {\r\n for (const element of elements) {\r\n element.addEventListener('click', e => {\r\n this[functionName](e.target.value)\r\n })\r\n }\r\n } else {\r\n elements.addEventListener('click', e => {\r\n this[functionName](e.target.value)\r\n })\r\n }\r\n }\r\n }\r\n document.addEventListener('keydown', a => {\r\n if (a.key === 'F5') {\r\n a.preventDefault()\r\n }\r\n if (location.hash === '#player') {\r\n switch (a.key) {\r\n case ' ':\r\n this.playPause()\r\n break\r\n case 'n':\r\n this.playNext()\r\n break\r\n case 'm':\r\n this.toggleMute()\r\n break\r\n case 'p':\r\n this.togglePopout()\r\n break\r\n case 't':\r\n this.toggleTheatre()\r\n break\r\n case 'c':\r\n this.captions()\r\n break\r\n case 'f':\r\n this.toggleFullscreen()\r\n break\r\n case 's':\r\n this.seek(85)\r\n break\r\n case 'ArrowLeft':\r\n this.seek(-this.seekTime)\r\n break\r\n case 'ArrowRight':\r\n this.seek(this.seekTime)\r\n break\r\n case 'ArrowUp':\r\n this.setVolume(Number(this.controls.setVolume.value) + 5)\r\n break\r\n case 'ArrowDown':\r\n this.setVolume(Number(this.controls.setVolume.value) - 5)\r\n break\r\n case 'Escape':\r\n location.hash = '#home'\r\n break\r\n }\r\n }\r\n })\r\n }\r\n\r\n async buildVideo (torrent, opts = {}) { // sets video source and creates a bunch of other media stuff\r\n // play wanted episode from opts, or the 1st episode, or 1st file [batches: plays wanted episode, single: plays the only episode, manually added: plays first or only file]\r\n this.cleanupVideo()\r\n if (opts.file) {\r\n this.currentFile = opts.file\r\n } else if (this.videoFiles.length > 1) {\r\n this.currentFile = this.videoFiles.filter(async file => await this.resolveFileMedia({ fileName: file.name }).then(FileMedia => (Number(FileMedia.episodeNumber) === Number(opts.episode || 1)) || (FileMedia === opts.media)))[0] || this.videoFiles[0]\r\n } else {\r\n this.currentFile = this.videoFiles[0]\r\n }\r\n // opts.media: mediaTitle, episodeNumber, episodeTitle, episodeThumbnail, mediaCover, name\r\n this.nowPlaying = (opts.media && (this.videoFiles.length === 1 || (opts.forceMedia && opts.file))) ? opts.media : this.resolveFileMedia ? await this.resolveFileMedia({ fileName: this.currentFile.name, method: 'SearchName' }) : undefined\r\n\r\n if (this.nowPlaying) {\r\n if (navNowPlaying) navNowPlaying.classList.remove('d-none')\r\n\r\n const episodeInfo = [this.nowPlaying.episodeNumber, this.nowPlaying.episodeTitle].filter(s => s).join(' - ')\r\n\r\n if ('mediaSession' in navigator) {\r\n navigator.mediaSession.metadata = new MediaMetadata({\r\n title: this.nowPlaying.mediaTitle || this.nowPlaying.name || 'WebTorrentPlayer',\r\n artist: 'Episode ' + episodeInfo,\r\n album: this.nowPlaying.name || 'WebTorrentPlayer',\r\n artwork: [{\r\n src: this.nowPlaying.episodeThumbnail || this.nowPlaying.mediaCover || '',\r\n sizes: '256x256',\r\n type: 'image/jpg'\r\n }]\r\n })\r\n }\r\n if (this.nowPlaying.episodeThumbnail) this.video.poster = this.nowPlaying.episodeThumbnail\r\n\r\n this.changeControlsIcon('nowPlaying', 'EP ' + episodeInfo)\r\n document.title = [this.nowPlaying.mediaTitle, episodeInfo ? 'EP ' + episodeInfo : false, this.nowPlaying.name || 'WebTorrentPlayer'].filter(s => s).join(' - ')\r\n }\r\n if (this.currentFile.name.endsWith('mkv')) {\r\n let initStream = null\r\n this.currentFile.on('stream', ({ stream }) => {\r\n initStream = stream\r\n })\r\n this.initParser(this.currentFile).then(() => {\r\n this.currentFile.on('stream', ({ stream, req }, cb) => {\r\n if (req.destination === 'video' && !this.subtitleData.parsed) {\r\n this.subtitleData.stream = new SubtitleStream(this.subtitleData.stream)\r\n this.handleSubtitleParser(this.subtitleData.stream, true)\r\n stream.pipe(this.subtitleData.stream)\r\n cb(this.subtitleData.stream)\r\n }\r\n })\r\n initStream?.destroy()\r\n })\r\n }\r\n await navigator.serviceWorker.ready\r\n if (this.currentFile.done) {\r\n this.postDownload()\r\n } else {\r\n this.onDone = this.currentFile.on('done', () => this.postDownload())\r\n }\r\n\r\n this.currentFile.streamTo(this.video)\r\n this.video.load()\r\n this.playVideo()\r\n\r\n if (this.controls.downloadFile) {\r\n this.currentFile.getStreamURL((_err, url) => {\r\n this.controls.downloadFile.href = url\r\n })\r\n }\r\n }\r\n\r\n cleanupVideo () { // cleans up objects, attemps to clear as much video caching as possible\r\n this.presentationConnection?.terminate()\r\n if (document.pictureInPictureElement) document.exitPictureInPicture()\r\n this.subtitleData.renderer?.destroy()\r\n this.subtitleData.parser?.destroy()\r\n this.subtitleData.stream?.destroy()\r\n this.subtitleData.fonts?.forEach(file => URL.revokeObjectURL(file)) // ideally this should clean up after its been downloaded by the sw renderer, but oh well\r\n if (this.controls.downloadFile) this.controls.downloadFile.href = ''\r\n this.currentFile = undefined\r\n this.video.poster = ''\r\n // some attemt at cache clearing\r\n this.video.pause()\r\n this.video.src = ''\r\n this.video.load()\r\n this.onDone = undefined\r\n document.title = this.nowPlaying?.name || 'WebTorrentPlayer'\r\n this.setProgress(0)\r\n // look for file and delete its store, idk how to do this\r\n Object.assign(this.subtitleData, {\r\n fonts: [],\r\n headers: [],\r\n tracks: [],\r\n current: undefined,\r\n renderer: undefined,\r\n stream: undefined,\r\n parser: undefined,\r\n parsed: undefined,\r\n timeout: undefined\r\n })\r\n\r\n if (this.controls.thumbnail) {\r\n Object.assign(this.thumbnailData, {\r\n thumbnails: [],\r\n interval: undefined,\r\n video: undefined\r\n })\r\n }\r\n this.completed = false\r\n this.changeControlsIcon('nowPlaying', '')\r\n if (this.controls.captionsButton) this.controls.captionsButton.setAttribute('disabled', '')\r\n this.changeControlsIcon('selectCaptions', '')\r\n this.changeControlsIcon('selectAudio', '')\r\n if (this.controls.openPlaylist) this.controls.openPlaylist.setAttribute('disabled', '')\r\n if (navNowPlaying) navNowPlaying.classList.add('d-none')\r\n if ('mediaSession' in navigator) navigator.mediaSession.metadata = undefined\r\n this.fps = 23.976\r\n }\r\n\r\n changeControlsIcon (type, text) {\r\n if (this.controls[type]) {\r\n if (this.controls[type].constructor === Array) {\r\n for (const element of this.controls[type]) {\r\n element.textContent = text\r\n }\r\n } else {\r\n this.controls[type].textContent = text\r\n }\r\n }\r\n }\r\n\r\n async playVideo () {\r\n try {\r\n await this.video.play()\r\n this.changeControlsIcon('playPause', 'pause')\r\n } catch (err) {\r\n this.changeControlsIcon('playPause', 'play_arrow')\r\n }\r\n }\r\n\r\n playPause () {\r\n if (this.video.paused) {\r\n this.playVideo()\r\n } else {\r\n this.changeControlsIcon('playPause', 'play_arrow')\r\n this.video.pause()\r\n }\r\n }\r\n\r\n setVolume (volume) {\r\n const level = volume === undefined ? Number(this.controls.setVolume.value) : volume\r\n this.controls.setVolume.value = level\r\n this.controls.setVolume.style.setProperty('--volume-level', level + '%')\r\n this.changeControlsIcon('toggleMute', level === 0 ? 'volume_off' : 'volume_up')\r\n this.video.volume = level / 100\r\n }\r\n\r\n toggleMute () {\r\n if (this.video.volume === 0) {\r\n this.setVolume(this.oldVolume)\r\n } else {\r\n this.oldVolume = this.video.volume * 100\r\n this.setVolume(0)\r\n }\r\n }\r\n\r\n toggleTheatre () {\r\n this.playerWrapper.classList.toggle('nav-hidden')\r\n }\r\n\r\n toggleFullscreen () {\r\n document.fullscreenElement ? document.exitFullscreen() : this.player.requestFullscreen()\r\n }\r\n\r\n updateFullscreen () {\r\n this.changeControlsIcon('toggleFullscreen', document.fullscreenElement ? 'fullscreen_exit' : 'fullscreen')\r\n }\r\n\r\n openPlaylist () {\r\n this.emit('playlist', { files: this.videoFiles })\r\n }\r\n\r\n playNext () {\r\n clearTimeout(this.nextTimeout)\r\n this.nextTimeout = setTimeout(() => {\r\n if (this.videoFiles?.indexOf(this.currentFile) < this.videoFiles?.length - 1) {\r\n const nowPlaying = this.nowPlaying\r\n nowPlaying.episodeNumber += 1\r\n const torrent = this.currentFile._torrent\r\n this.buildVideo(torrent, { media: nowPlaying, file: this.videoFiles[this.videoFiles.indexOf(this.currentFile) + 1] })\r\n } else {\r\n this.emit('next', { file: this.currentFile, filemedia: this.nowPlaying })\r\n }\r\n }, 200)\r\n }\r\n\r\n playLast () {\r\n clearTimeout(this.nextTimeout)\r\n this.nextTimeout = setTimeout(() => {\r\n if (this.videoFiles?.indexOf(this.currentFile)) {\r\n const nowPlaying = this.nowPlaying\r\n nowPlaying.episodeNumber -= 1\r\n const torrent = this.currentFile._torrent\r\n this.buildVideo(torrent, { media: nowPlaying, file: this.videoFiles[this.videoFiles.indexOf(this.currentFile) - 1] })\r\n } else {\r\n this.emit('prev', { file: this.currentFile, filemedia: this.nowPlaying })\r\n }\r\n }, 200)\r\n }\r\n\r\n toggleCast () {\r\n if (this.video.readyState) {\r\n if (this.presentationConnection) {\r\n this.presentationConnection?.terminate()\r\n } else {\r\n this.presentationRequest.start()\r\n }\r\n }\r\n }\r\n\r\n initCast (event) {\r\n let peer = new Peer({ polite: true })\r\n\r\n this.presentationConnection = event.connection\r\n this.presentationConnection.addEventListener('terminate', () => {\r\n this.presentationConnection = null\r\n this.changeControlsIcon('toggleCast', 'cast')\r\n this.player.classList.remove('pip')\r\n peer = null\r\n })\r\n\r\n peer.signalingPort.onmessage = ({ data }) => {\r\n this.presentationConnection.send(data)\r\n }\r\n\r\n this.presentationConnection.addEventListener('message', ({ data }) => {\r\n peer.signalingPort.postMessage(data)\r\n })\r\n\r\n peer.dc.onopen = async () => {\r\n await this.fps\r\n if (peer && this.presentationConnection) {\r\n this.changeControlsIcon('toggleCast', 'cast_connected')\r\n this.player.classList.add('pip')\r\n const tracks = []\r\n const videostream = this.video.captureStream()\r\n if (this.burnIn) {\r\n const { stream, destroy } = await this.getBurnIn(!this.subtitleData.renderer)\r\n tracks.push(stream.getVideoTracks()[0], videostream.getAudioTracks()[0])\r\n this.presentationConnection.addEventListener('terminate', destroy)\r\n } else {\r\n tracks.push(videostream.getVideoTracks()[0], videostream.getAudioTracks()[0])\r\n }\r\n for (const track of tracks) {\r\n peer.pc.addTrack(track, videostream)\r\n }\r\n this.video.play() // video pauses for some reason\r\n }\r\n }\r\n }\r\n\r\n async togglePopout () {\r\n if (this.video.readyState) {\r\n if (this.burnIn) {\r\n await this.fps\r\n if (!this.subtitleData.renderer) {\r\n this.video !== document.pictureInPictureElement ? this.video.requestPictureInPicture() : document.exitPictureInPicture()\r\n } else {\r\n if (document.pictureInPictureElement && !document.pictureInPictureElement.id) { // only exit if pip is the custom one, else overwrite existing pip with custom\r\n document.exitPictureInPicture()\r\n } else {\r\n const canvasVideo = document.createElement('video')\r\n const { stream, destroy } = await this.getBurnIn()\r\n canvasVideo.srcObject = stream\r\n canvasVideo.onloadedmetadata = () => {\r\n canvasVideo.play()\r\n canvasVideo.requestPictureInPicture().then(\r\n this.player.classList.add('pip')\r\n ).catch(e => {\r\n console.warn('Failed To Burn In Subtitles ' + e)\r\n destroy()\r\n canvasVideo.remove()\r\n this.player.classList.remove('pip')\r\n })\r\n }\r\n canvasVideo.onleavepictureinpicture = () => {\r\n destroy()\r\n canvasVideo.remove()\r\n this.player.classList.remove('pip')\r\n }\r\n }\r\n }\r\n } else {\r\n this.video !== document.pictureInPictureElement ? this.video.requestPictureInPicture() : document.exitPictureInPicture()\r\n }\r\n }\r\n }\r\n\r\n async getBurnIn (noSubs) {\r\n const canvas = document.createElement('canvas')\r\n const context = canvas.getContext('2d', { alpha: false })\r\n const fps = await this.fps\r\n let loop = null\r\n let destroy = null\r\n canvas.width = this.video.videoWidth\r\n canvas.height = this.video.videoHeight\r\n if ('requestVideoFrameCallback' in HTMLVideoElement.prototype) {\r\n const renderFrame = async () => {\r\n context.drawImage(this.video, 0, 0)\r\n if (!noSubs) context.drawImage(this.subtitleData.renderer?.canvas, 0, 0, canvas.width, canvas.height)\r\n loop = this.video.requestVideoFrameCallback(renderFrame)\r\n }\r\n loop = this.video.requestVideoFrameCallback(renderFrame)\r\n destroy = () => {\r\n this.video.cancelVideoFrameCallback(loop)\r\n canvas.remove()\r\n }\r\n } else {\r\n // for the firefox idiots\r\n const renderFrame = () => {\r\n context.drawImage(this.video, 0, 0)\r\n if (!noSubs) context.drawImage(this.subtitleData.renderer?.canvas, 0, 0, canvas.width, canvas.height)\r\n loop = requestTimeout(renderFrame, 500 / fps)\r\n }\r\n loop = requestAnimationFrame(renderFrame)\r\n destroy = () => {\r\n cancelTimeout(loop)\r\n canvas.remove()\r\n }\r\n }\r\n return { stream: canvas.captureStream(), destroy }\r\n }\r\n\r\n toTS (sec, full) {\r\n if (isNaN(sec) || sec < 0) {\r\n return full ? '0:00:00.00' : '00:00'\r\n }\r\n const hours = Math.floor(sec / 3600)\r\n let minutes = Math.floor(sec / 60) - (hours * 60)\r\n let seconds = full ? (sec % 60).toFixed(2) : Math.floor(sec % 60)\r\n if (minutes < 10) minutes = '0' + minutes\r\n if (seconds < 10) seconds = '0' + seconds\r\n return (hours > 0 || full) ? hours + ':' + minutes + ':' + seconds : minutes + ':' + seconds\r\n }\r\n\r\n prettyBytes (num) {\r\n if (isNaN(num)) return '0 B'\r\n if (num < 1) return num + ' B'\r\n const exponent = Math.min(Math.floor(Math.log(num) / Math.log(1000)), units.length - 1)\r\n return Number((num / Math.pow(1000, exponent)).toFixed(2)) + units[exponent]\r\n }\r\n\r\n getBytes (str) {\r\n const units = ['B', 'KiB', 'MiB', 'GiB', 'TiB', 'Bytes', 'KB', 'MB', 'GB', 'TB']\r\n const split = str.split(' ')\r\n return split[0] * 1024 ** (units.indexOf(split[1] || 'B') % 5) // this is so lazy\r\n }\r\n\r\n seek (time) {\r\n if (time === 85 && this.video.currentTime < 10) {\r\n this.video.currentTime = 90\r\n } else if (time === 85 && (this.video.duration - this.video.currentTime) < 90) {\r\n this.video.currentTime = this.video.duration\r\n } else {\r\n this.video.currentTime += time\r\n }\r\n this.setProgress(this.video.currentTime / this.video.duration * 100)\r\n }\r\n\r\n forward () {\r\n this.seek(this.seekTime)\r\n }\r\n\r\n rewind () {\r\n this.seek(-this.seekTime)\r\n }\r\n\r\n immersePlayer () {\r\n this.player.classList.add('immersed')\r\n this.immerseTimeout = undefined\r\n }\r\n\r\n resetImmerse () {\r\n if (this.immerseTimeout) {\r\n clearTimeout(this.immerseTimeout)\r\n } else {\r\n this.player.classList.remove('immersed')\r\n }\r\n this.immerseTimeout = setTimeout(() => this.immersePlayer(), this.immerseTime * 1000)\r\n }\r\n\r\n hideBuffering () {\r\n if (this.bufferTimeout) {\r\n clearTimeout(this.bufferTimeout)\r\n this.bufferTimeout = undefined\r\n this.player.classList.remove('buffering')\r\n }\r\n }\r\n\r\n showBuffering () {\r\n this.bufferTimeout = setTimeout(() => {\r\n this.player.classList.add('buffering')\r\n this.resetImmerse()\r\n }, 150)\r\n }\r\n\r\n checkCompletion () {\r\n if (!this.completed && this.video.duration - 180 < this.video.currentTime) {\r\n this.completed = true\r\n this.emit('watched', { file: this.currentFile, filemedia: this.nowPlaying })\r\n }\r\n }\r\n\r\n updatePositionState () {\r\n if (this.video.duration) {\r\n navigator.mediaSession.setPositionState({\r\n duration: this.video.duration || 0,\r\n playbackRate: this.video.playbackRate || 0,\r\n position: this.video.currentTime || 0\r\n })\r\n }\r\n }\r\n\r\n initThumbnail () {\r\n const height = this.thumbnailData.canvas.width / (this.video.videoWidth / this.video.videoHeight)\r\n this.thumbnailData.interval = this.video.duration / 300 < 5 ? 5 : this.video.duration / 300\r\n this.thumbnailData.canvas.height = height\r\n this.controls.thumbnail.style.setProperty('height', height + 'px')\r\n }\r\n\r\n createThumbnail (video) {\r\n if (video?.readyState >= 2) {\r\n const index = Math.floor(video.currentTime / this.thumbnailData.interval)\r\n if (!this.thumbnailData.thumbnails[index]) {\r\n this.thumbnailData.context.fillRect(0, 0, 150, this.thumbnailData.canvas.height)\r\n this.thumbnailData.context.drawImage(video, 0, 0, 150, this.thumbnailData.canvas.height)\r\n this.thumbnailData.thumbnails[index] = this.thumbnailData.canvas.toDataURL('image/jpeg')\r\n }\r\n }\r\n }\r\n\r\n finishThumbnails (src) {\r\n const t0 = performance.now()\r\n const video = document.createElement('video')\r\n let index = 0\r\n video.preload = 'none'\r\n video.volume = 0\r\n video.playbackRate = 0\r\n video.addEventListener('loadeddata', () => loadTime())\r\n video.addEventListener('canplay', () => {\r\n this.createThumbnail(this.thumbnailData.video)\r\n loadTime()\r\n })\r\n this.thumbnailData.video = video\r\n const loadTime = () => {\r\n while (this.thumbnailData.thumbnails[index] && index <= Math.floor(this.thumbnailData.video.duration / this.thumbnailData.interval)) { // only create thumbnails that are missing\r\n index++\r\n }\r\n if (this.thumbnailData.video?.currentTime !== this.thumbnailData.video?.duration) {\r\n this.thumbnailData.video.currentTime = index * this.thumbnailData.interval\r\n } else {\r\n this.thumbnailData.video?.removeAttribute('src')\r\n this.thumbnailData.video?.load()\r\n this.thumbnailData.video?.remove()\r\n delete this.thumbnailData.video\r\n console.log('Thumbnail creating finished', index, this.toTS((performance.now() - t0) / 1000))\r\n }\r\n index++\r\n }\r\n this.thumbnailData.video.src = src\r\n this.thumbnailData.video.play()\r\n console.log('Thumbnail creating started')\r\n }\r\n\r\n dragBarEnd (progressPercent) {\r\n this.video.currentTime = this.video.duration * progressPercent / 100 || 0\r\n this.playVideo()\r\n }\r\n\r\n dragBarStart (progressPercent) {\r\n this.video.pause()\r\n this.setProgress(progressPercent)\r\n }\r\n\r\n setProgress (progressPercent) {\r\n progressPercent = progressPercent || 0\r\n const currentTime = this.video.duration * progressPercent / 100 || 0\r\n if (this.controls.progressWrapper) this.controls.progressWrapper.style.setProperty('--progress', progressPercent + '%')\r\n if (this.controls.thumbnail) this.controls.thumbnail.src = this.thumbnailData.thumbnails[Math.floor(currentTime / this.thumbnailData.interval)] || ' '\r\n if (this.controls.setProgress) {\r\n this.controls.setProgress.dataset.elapsed = this.toTS(currentTime)\r\n this.controls.setProgress.value = progressPercent\r\n }\r\n if (this.controls.progressWrapper) {\r\n this.controls.progressWrapper.dataset.elapsed = this.toTS(currentTime)\r\n this.controls.progressWrapper.dataset.remaining = this.toTS(this.video.duration - currentTime)\r\n }\r\n }\r\n\r\n updateDisplay () {\r\n if (this.currentFile && this.currentFile._torrent) {\r\n if (this.player) this.player.style.setProperty('--download', this.currentFile.progress * 100 + '%')\r\n if (this.controls.peers) this.controls.peers.dataset.value = this.currentFile._torrent.numPeers\r\n if (this.controls.downSpeed) this.controls.downSpeed.dataset.value = this.prettyBytes(this.currentFile._torrent.downloadSpeed) + '/s'\r\n if (this.controls.upSpeed) this.controls.upSpeed.dataset.value = this.prettyBytes(this.currentFile._torrent.uploadSpeed) + '/s'\r\n }\r\n setTimeout(() => requestAnimationFrame(() => this.updateDisplay()), 200)\r\n }\r\n\r\n createRadioElement (track, type) {\r\n // type: captions audio\r\n if ((type === 'captions' && this.controls.selectCaptions && this.controls.captionsButton) || (type === 'audio' && this.controls.selectAudio)) {\r\n const frag = document.createDocumentFragment()\r\n const input = document.createElement('input')\r\n const label = document.createElement('label')\r\n input.name = `${type}-radio-set`\r\n input.type = 'radio'\r\n input.id = type === 'captions' ? `${type}-${track ? track.number : 'off'}-radio` : `${type}-${track.id}-radio`\r\n input.value = type === 'captions' ? track ? track.number : -1 : track.id\r\n input.checked = type === 'captions' ? track?.number === this.subtitleData.current : track.enabled\r\n label.htmlFor = type === 'captions' ? `${type}-${track ? track.number : 'off'}-radio` : `${type}-${track.id}-radio`\r\n label.textContent = track\r\n ? type === 'captions'\r\n ? (track.language || (!Object.values(this.subtitleData.headers).some(header => header.language === 'eng' || header.language === 'en') ? 'eng' : track.type)) + (track.name ? ' - ' + track.name : '')\r\n : (track.language || (!Object.values(this.video.audioTracks).some(track => track.language === 'eng' || track.language === 'en') ? 'eng' : track.label)) + (track.label ? ' - ' + track.label : '')\r\n : 'OFF' // TODO: clean this up, TLDR assume english track if track lang is undefined || 'und' and there isnt an existing eng track already\r\n frag.append(input)\r\n frag.append(label)\r\n if (type === 'captions') {\r\n this.controls.selectCaptions.append(frag)\r\n this.controls.captionsButton.removeAttribute('disabled')\r\n } else {\r\n this.controls.selectAudio.append(frag)\r\n }\r\n }\r\n }\r\n\r\n selectAudio (id) {\r\n if (id !== undefined) {\r\n for (const track of this.video.audioTracks) {\r\n track.enabled = track.id === id\r\n }\r\n this.seek(-0.5) // stupid fix because video freezes up when chaging tracks\r\n }\r\n }\r\n\r\n selectCaptions (trackNumber) {\r\n if (trackNumber !== undefined) {\r\n trackNumber = Number(trackNumber)\r\n this.subtitleData.current = trackNumber\r\n if (!this.subtitleData.timeout) {\r\n this.subtitleData.timeout = setTimeout(() => {\r\n this.subtitleData.timeout = undefined\r\n if (this.subtitleData.renderer) {\r\n this.subtitleData.renderer.setTrack(trackNumber !== -1 ? this.subtitleData.headers[trackNumber].header.slice(0, -1) + Array.from(this.subtitleData.tracks[trackNumber]).join('\\n') : this.subtitleData.defaultHeader)\r\n }\r\n }, 1000)\r\n }\r\n }\r\n }\r\n\r\n constructSub (subtitle, isNotAss) {\r\n if (isNotAss === true) { // converts VTT or other to SSA\r\n const matches = subtitle.text.match(/<[^>]+>/g) // create array of all tags\r\n if (matches) {\r\n matches.forEach(match => {\r\n if (/<\\//.test(match)) { // check if its a closing tag\r\n subtitle.text = subtitle.text.replace(match, match.replace('', '0}'))\r\n } else {\r\n subtitle.text = subtitle.text.replace(match, match.replace('<', '{\\\\').replace('>', '1}'))\r\n }\r\n })\r\n }\r\n // replace all html special tags with normal ones\r\n subtitle.text.replace(/&/g, '&').replace(/</g, '<').replace(/>/g, '>').replace(/ /g, '\\\\h')\r\n }\r\n return 'Dialogue: ' +\r\n (subtitle.layer || 0) + ',' +\r\n this.toTS(subtitle.time / 1000, true) + ',' +\r\n this.toTS((subtitle.time + subtitle.duration) / 1000, true) + ',' +\r\n (subtitle.style || 'Default') + ',' +\r\n (subtitle.name || '') + ',' +\r\n (subtitle.marginL || '0') + ',' +\r\n (subtitle.marginR || '0') + ',' +\r\n (subtitle.marginV || '0') + ',' +\r\n (subtitle.effect || '') + ',' +\r\n subtitle.text || ''\r\n }\r\n\r\n parseSubtitles (file, skipFiles) { // parse subtitles fully after a download is finished\r\n return new Promise((resolve) => {\r\n if (file.name.endsWith('.mkv')) {\r\n let parser = new SubtitleParser()\r\n this.handleSubtitleParser(parser, skipFiles)\r\n const finish = () => {\r\n console.log('Sub parsing finished', this.toTS((performance.now() - t0) / 1000))\r\n this.subtitleData.parsed = true\r\n this.subtitleData.stream?.destroy()\r\n this.subtitleData.parser?.destroy()\r\n fileStream?.destroy()\r\n this.subtitleData.stream = undefined\r\n this.subtitleData.parser = undefined\r\n this.selectCaptions(this.subtitleData.current)\r\n parser = undefined\r\n if (!this.video.paused) {\r\n this.video.pause()\r\n this.playVideo()\r\n }\r\n resolve()\r\n }\r\n parser.once('tracks', tracks => {\r\n if (!tracks.length) finish()\r\n })\r\n parser.once('finish', finish)\r\n const t0 = performance.now()\r\n console.log('Sub parsing started')\r\n const fileStream = file.createReadStream()\r\n this.subtitleData.parser = fileStream.pipe(parser)\r\n } else {\r\n resolve()\r\n }\r\n })\r\n }\r\n\r\n initParser (file) {\r\n return new Promise(resolve => {\r\n const stream = this.subtitleData.stream = new SubtitleParser()\r\n this.handleSubtitleParser(this.subtitleData.stream)\r\n stream.once('tracks', tracks => {\r\n if (!tracks.length) {\r\n this.subtitleData.parsed = true\r\n resolve()\r\n this.subtitleData.stream.destroy()\r\n fileStreamStream.destroy()\r\n }\r\n })\r\n stream.on('subtitle', () => {\r\n resolve()\r\n fileStreamStream.destroy()\r\n })\r\n const fileStreamStream = file.createReadStream({ end: file.length / 2 })\r\n fileStreamStream.pipe(stream)\r\n })\r\n }\r\n\r\n handleSubtitleParser (parser, skipFile) {\r\n parser.once('tracks', tracks => {\r\n if (!tracks.length) {\r\n this.subtitleData.parsed = true\r\n } else {\r\n tracks.forEach(track => {\r\n if (!this.subtitleData.tracks[track.number]) {\r\n // overwrite webvtt or other header with custom one\r\n if (track.type !== 'ass') track.header = this.subtitleData.defaultHeader\r\n if (!this.subtitleData.current) {\r\n this.subtitleData.current = track.number\r\n this.createRadioElement(undefined, 'captions')\r\n }\r\n this.subtitleData.tracks[track.number] = new Set()\r\n this.subtitleData.headers[track.number] = track\r\n this.createRadioElement(track, 'captions')\r\n }\r\n })\r\n }\r\n })\r\n parser.on('subtitle', (subtitle, trackNumber) => {\r\n if (!this.subtitleData.parsed) {\r\n if (!this.subtitleData.renderer) this.initSubtitleRenderer()\r\n this.subtitleData.tracks[trackNumber].add(this.constructSub(subtitle, this.subtitleData.headers[trackNumber].type !== 'ass'))\r\n if (this.subtitleData.current === trackNumber) this.selectCaptions(trackNumber)\r\n }\r\n })\r\n if (!skipFile) {\r\n parser.on('file', file => {\r\n if (file.mimetype === 'application/x-truetype-font' || file.mimetype === 'application/font-woff' || file.mimetype === 'application/vnd.ms-opentype') {\r\n this.subtitleData.fonts.push(URL.createObjectURL(new Blob([file.data], { type: file.mimetype })))\r\n }\r\n })\r\n }\r\n }\r\n\r\n async initSubtitleRenderer () {\r\n if (!this.subtitleData.renderer) {\r\n const options = {\r\n video: this.video,\r\n targetFps: await this.fps,\r\n subContent: this.subtitleData.headers[this.subtitleData.current].header.slice(0, -1),\r\n renderMode: 'offscreen',\r\n fonts: this.subtitleData.fonts,\r\n fallbackFont: 'https://fonts.gstatic.com/s/roboto/v20/KFOlCnqEu92Fr1MmEU9fBBc4.woff2',\r\n workerUrl: 'lib/subtitles-octopus-worker.js',\r\n onReady: () => { // weird hack for laggy subtitles, this is some issue in SO\r\n if (!this.video.paused) {\r\n this.video.pause()\r\n this.playVideo()\r\n }\r\n }\r\n }\r\n if (!this.subtitleData.renderer) {\r\n this.subtitleData.renderer = new SubtitlesOctopus(options)\r\n this.selectCaptions(this.subtitleData.current)\r\n }\r\n }\r\n }\r\n\r\n convertSubFile (file, isAss, callback) {\r\n const regex = /(?:\\d+\\n)?(\\S{9,12})\\s?-->\\s?(\\S{9,12})(.*)\\n([\\s\\S]*)$/i\r\n file.getBuffer((_err, buffer) => {\r\n const subtitles = isAss ? buffer.toString() : []\r\n if (isAss) {\r\n callback(subtitles)\r\n } else {\r\n const text = buffer.toString().replace(/\\r/g, '')\r\n for (const split of text.split('\\n\\n')) {\r\n const match = split.match(regex)\r\n if (match) {\r\n match[1] = match[1].match(/.*[.,]\\d{2}/)[0]\r\n match[2] = match[2].match(/.*[.,]\\d{2}/)[0]\r\n if (match[1].length === 9) {\r\n match[1] = '0:' + match[1]\r\n } else {\r\n if (match[1][0] === '0') {\r\n match[1] = match[1].substring(1)\r\n }\r\n }\r\n match[1].replace(',', '.')\r\n if (match[2].length === 9) {\r\n match[2] = '0:' + match[2]\r\n } else {\r\n if (match[2][0] === '0') {\r\n match[2] = match[2].substring(1)\r\n }\r\n }\r\n match[2].replace(',', '.')\r\n const matches = match[4].match(/<[^>]+>/g) // create array of all tags\r\n if (matches) {\r\n matches.forEach(matched => {\r\n if (/<\\//.test(matched)) { // check if its a closing tag\r\n match[4] = match[4].replace(matched, matched.replace('', '0}'))\r\n } else {\r\n match[4] = match[4].replace(matched, matched.replace('<', '{\\\\').replace('>', '1}'))\r\n }\r\n })\r\n }\r\n subtitles.push('Dialogue: 0,' + match[1].replace(',', '.') + ',' + match[2].replace(',', '.') + ',Default,,0,0,0,,' + match[4])\r\n }\r\n }\r\n callback(subtitles)\r\n }\r\n })\r\n }\r\n\r\n findSubtitleFiles (targetFile) {\r\n const path = targetFile.path.split(targetFile.name)[0]\r\n // array of subtitle files that match video name, or all subtitle files when only 1 vid file\r\n const subtitleFiles = targetFile._torrent.files.filter(file => {\r\n return this.subtitleExtensions.some(ext => file.name.endsWith(ext)) && (this.videoFiles.length === 1 ? true : file.path.split(path).length === 2)\r\n })\r\n if (subtitleFiles.length) {\r\n this.createRadioElement(undefined, 'captions')\r\n this.subtitleData.parsed = true\r\n this.subtitleData.current = 0\r\n for (const [index, file] of subtitleFiles.entries()) {\r\n const isAss = file.name.endsWith('.ass') || file.name.endsWith('.ssa')\r\n const extension = /\\.(\\w+)$/\r\n const name = file.name.replace(targetFile.name, '') === file.name\r\n ? file.name.replace(targetFile.name.replace(extension, ''), '').slice(0, -4).replace(/[,._-]/g, ' ').trim()\r\n : file.name.replace(targetFile.name, '').slice(0, -4).replace(/[,._-]/g, ' ').trim()\r\n const header = {\r\n header: this.subtitleData.defaultHeader,\r\n language: name,\r\n number: index,\r\n type: file.name.match(extension)[1]\r\n }\r\n this.subtitleData.headers.push(header)\r\n this.subtitleData.tracks[index] = []\r\n this.createRadioElement(header, 'captions')\r\n this.convertSubFile(file, isAss, subtitles => {\r\n if (isAss) {\r\n this.subtitleData.headers[index].header = subtitles\r\n } else {\r\n this.subtitleData.tracks[index] = subtitles\r\n }\r\n if (this.subtitleData.current === index) this.selectCaptions(this.subtitleData.current)\r\n })\r\n this.initSubtitleRenderer()\r\n }\r\n }\r\n }\r\n\r\n postDownload () {\r\n this.emit('download-done', { file: this.currentFile })\r\n this.parseSubtitles(this.currentFile, true).then(() => {\r\n if (this.generateThumbnails) {\r\n this.finishThumbnails(this.video.src)\r\n }\r\n })\r\n }\r\n\r\n playTorrent (torrentID, opts = {}) { // TODO: clean this up\r\n const handleTorrent = (torrent, opts) => {\r\n torrent.on('noPeers', () => {\r\n this.emit('no-peers', torrent)\r\n })\r\n if (this.streamedDownload) {\r\n torrent.files.forEach(file => file.deselect())\r\n torrent.deselect(0, torrent.pieces.length - 1, false)\r\n }\r\n this.videoFiles = torrent.files.filter(file => this.videoExtensions.some(ext => file.name.endsWith(ext)))\r\n this.emit('video-files', { files: this.videoFiles, torrent: torrent })\r\n if (this.videoFiles.length > 1) {\r\n torrent.files.forEach(file => file.deselect())\r\n }\r\n if (this.videoFiles) {\r\n this.buildVideo(torrent, opts)\r\n } else {\r\n this.emit('no-file', torrent)\r\n this.cleanupTorrents()\r\n }\r\n }\r\n document.location.hash = '#player'\r\n this.cleanupVideo()\r\n this.cleanupTorrents()\r\n if (torrentID instanceof Object) {\r\n handleTorrent(torrentID, opts)\r\n } else if (this.get(torrentID)) {\r\n handleTorrent(this.get(torrentID), opts)\r\n } else {\r\n this.add(torrentID, {\r\n destroyStoreOnDestroy: this.destroyStore,\r\n storeOpts: this.storeOpts,\r\n storeCacheSlots: 0,\r\n store: HybridChunkStore,\r\n announce: this.tracker.announce || [\r\n 'wss://tracker.openwebtorrent.com',\r\n 'wss://spacetradersapi-chatbox.herokuapp.com:443/announce',\r\n 'wss://peertube.cpy.re:443/tracker/socket'\r\n ]\r\n }, torrent => {\r\n handleTorrent(torrent, opts)\r\n })\r\n }\r\n }\r\n\r\n // cleanup torrent and store\r\n cleanupTorrents () {\r\n // creates an array of all non-offline store torrents and removes them\r\n this.torrents.filter(torrent => !this.offlineTorrents[torrent.infoHash]).forEach(torrent => torrent.destroy())\r\n }\r\n\r\n // add torrent for offline download\r\n offlineDownload (torrentID) {\r\n const torrent = this.add(torrentID, {\r\n storeOpts: this.storeOpts,\r\n store: HybridChunkStore,\r\n storeCacheSlots: 0,\r\n announce: this.tracker.announce || [\r\n 'wss://tracker.openwebtorrent.com',\r\n 'wss://spacetradersapi-chatbox.herokuapp.com:443/announce',\r\n 'wss://peertube.cpy.re:443/tracker/socket'\r\n ]\r\n })\r\n torrent.on('metadata', () => {\r\n if (!this.offlineTorrents[torrent.infoHash]) {\r\n this.offlineTorrents[torrent.infoHash] = Array.from(torrent.torrentFile)\r\n localStorage.setItem('offlineTorrents', JSON.stringify(this.offlineTorrents))\r\n }\r\n this.emit('offline-torrent', torrent)\r\n })\r\n }\r\n}\r\n","const __WEBPACK_NAMESPACE_OBJECT__ = halfmoon;","import halfmoon from 'halfmoon'\r\n\r\nhalfmoon.showModal = id => {\r\n const t = document.getElementById(id)\r\n t && t.classList.add('show')\r\n}\r\n\r\nhalfmoon.hideModal = id => {\r\n const t = document.getElementById(id)\r\n t && t.classList.remove('show')\r\n}\r\n\r\nexport const searchParams = new URLSearchParams(location.href)\r\nif (searchParams.get('access_token')) {\r\n localStorage.setItem('ALtoken', searchParams.get('access_token'))\r\n window.location = '/app/#home'\r\n}\r\n\r\nexport const userBrowser = (() => {\r\n if (window.chrome) {\r\n return (navigator.userAgent.indexOf('Edg') !== -1) ? 'edge' : 'chromium'\r\n }\r\n return 'firefox'\r\n})()\r\n\r\nexport function countdown (s) {\r\n const d = Math.floor(s / (3600 * 24))\r\n s -= d * 3600 * 24\r\n const h = Math.floor(s / 3600)\r\n s -= h * 3600\r\n const m = Math.floor(s / 60)\r\n s -= m * 60\r\n const tmp = []\r\n if (d) tmp.push(d + 'd')\r\n if (d || h) tmp.push(h + 'h')\r\n if (d || h || m) tmp.push(m + 'm')\r\n return tmp.join(' ')\r\n}\r\n\r\nexport function flattenObj (obj) {\r\n const result = {}\r\n\r\n for (const key in obj) {\r\n if (obj[key] && obj[key].constructor === Object) {\r\n const childObj = flattenObj(obj[key])\r\n\r\n for (const childObjKey in childObj) {\r\n result[childObjKey] = childObj[childObjKey]\r\n }\r\n } else {\r\n result[key] = obj[key]\r\n }\r\n }\r\n return result\r\n}\r\n\r\nexport const DOMPARSER = new DOMParser().parseFromString.bind(new DOMParser())\r\n\r\nexport function concat (chunks, size) {\r\n if (!size) {\r\n size = 0\r\n let i = chunks.length || chunks.byteLength || 0\r\n while (i--) size += chunks[i].length\r\n }\r\n const b = new Uint8Array(size)\r\n let offset = 0\r\n for (let i = 0, l = chunks.length; i < l; i++) {\r\n const chunk = chunks[i]\r\n b.set(chunk, offset)\r\n offset += chunk.byteLength || chunk.length\r\n }\r\n\r\n return b\r\n}\r\n\r\nexport const sleep = t => new Promise(resolve => setTimeout(resolve, t))\r\n\r\nexport class Queue {\r\n constructor () {\r\n this.queue = []\r\n this.destroyed = false\r\n this.lastfn = null\r\n }\r\n\r\n add (obj) { // index, fn\r\n if (this.destroyed) return\r\n // most common case, requests are in order\r\n // also push to the end of queue if there's an outstanding high range request [for example EOF metadata]\r\n // this impacts backwards seeking performance a bit, but is needed for metadata\r\n if (!this.queue.length || obj.index > this.queue[this.queue.length - 1].index || obj.index < this.queue[0].index - 10) {\r\n this.queue.push(obj)\r\n if (this.queue.length === 1) this._next()\r\n } else {\r\n // otherwise if one request failed its likely the oldest, or older one, so iterate backwards [forwards since queue is reversed]\r\n for (let i = 0; i < this.queue.length; i++) {\r\n if (this.queue[i].index > obj.index) {\r\n this.queue.splice(i, 0, obj)\r\n return\r\n }\r\n }\r\n this.queue.push(obj)\r\n console.warn('got bad')\r\n }\r\n }\r\n\r\n async _next () {\r\n const obj = this.queue[0]\r\n await obj.fn()\r\n this._remove(obj)\r\n if (!this.destroyed && this.queue.length) this._next()\r\n }\r\n\r\n _remove (obj) {\r\n if (!this.destroyed) this.queue.splice(this.queue.indexOf(obj), 1)\r\n }\r\n\r\n destroy () {\r\n this.destroyed = true\r\n this.queue = null\r\n }\r\n}\r\n","import safariFix from 'safari-14-idb-fix';\n\nfunction promisifyRequest(request) {\n return new Promise((resolve, reject) => {\n // @ts-ignore - file size hacks\n request.oncomplete = request.onsuccess = () => resolve(request.result);\n // @ts-ignore - file size hacks\n request.onabort = request.onerror = () => reject(request.error);\n });\n}\nfunction createStore(dbName, storeName) {\n const dbp = safariFix().then(() => {\n const request = indexedDB.open(dbName);\n request.onupgradeneeded = () => request.result.createObjectStore(storeName);\n return promisifyRequest(request);\n });\n return (txMode, callback) => dbp.then((db) => callback(db.transaction(storeName, txMode).objectStore(storeName)));\n}\nlet defaultGetStoreFunc;\nfunction defaultGetStore() {\n if (!defaultGetStoreFunc) {\n defaultGetStoreFunc = createStore('keyval-store', 'keyval');\n }\n return defaultGetStoreFunc;\n}\n/**\n * Get a value by its key.\n *\n * @param key\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction get(key, customStore = defaultGetStore()) {\n return customStore('readonly', (store) => promisifyRequest(store.get(key)));\n}\n/**\n * Set a value with a key.\n *\n * @param key\n * @param value\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction set(key, value, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.put(value, key);\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Set multiple values at once. This is faster than calling set() multiple times.\n * It's also atomic – if one of the pairs can't be added, none will be added.\n *\n * @param entries Array of entries, where each entry is an array of `[key, value]`.\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction setMany(entries, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n entries.forEach((entry) => store.put(entry[1], entry[0]));\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Get multiple values by their keys\n *\n * @param keys\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction getMany(keys, customStore = defaultGetStore()) {\n return customStore('readonly', (store) => Promise.all(keys.map((key) => promisifyRequest(store.get(key)))));\n}\n/**\n * Update a value. This lets you see the old value and update it as an atomic operation.\n *\n * @param key\n * @param updater A callback that takes the old value and returns a new value.\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction update(key, updater, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => \n // Need to create the promise manually.\n // If I try to chain promises, the transaction closes in browsers\n // that use a promise polyfill (IE10/11).\n new Promise((resolve, reject) => {\n store.get(key).onsuccess = function () {\n try {\n store.put(updater(this.result), key);\n resolve(promisifyRequest(store.transaction));\n }\n catch (err) {\n reject(err);\n }\n };\n }));\n}\n/**\n * Delete a particular key from the store.\n *\n * @param key\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction del(key, customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.delete(key);\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Clear all values in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction clear(customStore = defaultGetStore()) {\n return customStore('readwrite', (store) => {\n store.clear();\n return promisifyRequest(store.transaction);\n });\n}\nfunction eachCursor(customStore, callback) {\n return customStore('readonly', (store) => {\n // This would be store.getAllKeys(), but it isn't supported by Edge or Safari.\n // And openKeyCursor isn't supported by Safari.\n store.openCursor().onsuccess = function () {\n if (!this.result)\n return;\n callback(this.result);\n this.result.continue();\n };\n return promisifyRequest(store.transaction);\n });\n}\n/**\n * Get all keys in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction keys(customStore = defaultGetStore()) {\n const items = [];\n return eachCursor(customStore, (cursor) => items.push(cursor.key)).then(() => items);\n}\n/**\n * Get all values in the store.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction values(customStore = defaultGetStore()) {\n const items = [];\n return eachCursor(customStore, (cursor) => items.push(cursor.value)).then(() => items);\n}\n/**\n * Get all entries in the store. Each entry is an array of `[key, value]`.\n *\n * @param customStore Method to get a custom store. Use with caution (see the docs).\n */\nfunction entries(customStore = defaultGetStore()) {\n const items = [];\n return eachCursor(customStore, (cursor) => items.push([cursor.key, cursor.value])).then(() => items);\n}\n\nexport { clear, createStore, del, entries, get, getMany, keys, promisifyRequest, set, setMany, update, values };\n","/**\n * https://bugs.webkit.org/show_bug.cgi?id=226547\n * Safari has a horrible bug where IDB requests can hang while the browser is starting up.\n * The only solution is to keep nudging it until it's awake.\n * This probably creates garbage, but garbage is better than totally failing.\n */\nfunction idbReady() {\n const isSafari = !navigator.userAgentData &&\n /Safari\\//.test(navigator.userAgent) &&\n !/Chrom(e|ium)\\//.test(navigator.userAgent);\n // No point putting other browsers or older versions of Safari through this mess.\n if (!isSafari || !indexedDB.databases)\n return Promise.resolve();\n let intervalId;\n return new Promise((resolve) => {\n const tryIdb = () => indexedDB.databases().finally(resolve);\n intervalId = setInterval(tryIdb, 100);\n tryIdb();\n }).finally(() => clearInterval(intervalId));\n}\n\nexport default idbReady;\n","/* global volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent5, torrent5label, torrent7, torrent8, torrent9, torrent10, other1, other2, other3, setRes, settingsTab, regProtButton, clearRelCache */\r\nimport { get, set, createStore } from 'idb-keyval'\r\nexport const settingsElements = [\r\n volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent7, torrent8, torrent9, torrent10, other1, other2, other3\r\n]\r\nsetRes.addEventListener('click', restoreDefaults)\r\nsettingsTab.addEventListener('click', applySettingsTimeout)\r\nvolume.addEventListener('click', applySettingsTimeout)\r\nregProtButton.addEventListener('click', registerProtocol)\r\nexport const settings = JSON.parse(localStorage.getItem('settings')) || {}\r\n\r\nlet customStore\r\n\r\nif ('showDirectoryPicker' in window) {\r\n customStore = createStore('handle-store', 'handles')\r\n settings.torrent5 = get('directory', customStore).then(handle => {\r\n if (handle) {\r\n torrent5label.value = 'Folder: ' + handle.name\r\n return handle\r\n }\r\n return null\r\n })\r\n torrent5.classList.remove('d-none')\r\n torrent5.onclick = async () => {\r\n const handle = await window.showDirectoryPicker()\r\n await handle.requestPermission({ mode: 'readwrite' })\r\n settings.torrent5 = handle\r\n torrent5label.value = 'Folder: ' + handle.name || 'none'\r\n }\r\n}\r\n\r\nasync function saveSettings () {\r\n for (const element of settingsElements) {\r\n settings[element.id] = element.type === 'checkbox' ? element.checked : element.value\r\n }\r\n localStorage.setItem('settings', JSON.stringify(settings))\r\n if ('showDirectoryPicker' in window) {\r\n if (settings.torrent5) set('directory', await settings.torrent5, customStore)\r\n }\r\n}\r\n\r\nlet applyTimeout\r\nfunction applySettingsTimeout () {\r\n clearTimeout(applyTimeout)\r\n applyTimeout = setTimeout(saveSettings, 500)\r\n}\r\n\r\nfunction registerProtocol () {\r\n if ('registerProtocolHandler' in navigator) {\r\n navigator.registerProtocolHandler(\r\n 'magnet',\r\n `${location.href.replace(location.hash, '')}#home&file=%s`,\r\n 'Miru'\r\n )\r\n }\r\n}\r\n\r\nfunction restoreDefaults () {\r\n localStorage.removeItem('settings')\r\n location.reload()\r\n}\r\n\r\nclearRelCache.onclick = () => {\r\n localStorage.removeItem('relations')\r\n location.reload()\r\n}\r\n\r\nfor (const setting of Object.entries(settings)) {\r\n const settingElement = settingsElements.filter(e => e.id === setting[0])[0]\r\n if (settingElement) settingElement.type === 'checkbox' ? settingElement.checked = setting[1] : settingElement.value = setting[1]\r\n}\r\n\r\nsaveSettings()\r\n\r\nother1.oninput = () => other1.checked && Notification.requestPermission().then(perm => { perm === 'denied' ? other1.checked = false : other1.checked = true })\r\n","/* global torrent4list */\r\n\r\nimport { settings } from './settings.js'\r\nimport { userBrowser, DOMPARSER } from './util.js'\r\nimport { client } from './main.js'\r\nimport halfmoon from 'halfmoon'\r\nimport { episodeRx } from './anime.js'\r\n\r\nconst exclusions = {\r\n edge: ['DTS'],\r\n chromium: ['DTS', 'AC3', 'HEVC', 'x265', 'H.265'],\r\n firefox: ['DTS', 'AC3', 'HEVC', 'x265', 'H.265', '.3gp', '.mkv']\r\n}\r\nif (!('audioTracks' in HTMLVideoElement.prototype)) {\r\n exclusions[userBrowser].push('mutli audio', 'dual audio')\r\n}\r\n\r\nexport function getRSSContent (url) {\r\n return fetch(url).then(res => {\r\n if (res.ok) {\r\n return res.text().then(xmlTxt => {\r\n return DOMPARSER(xmlTxt, 'text/xml')\r\n })\r\n }\r\n throw Error(res.statusText)\r\n }).catch(error => {\r\n halfmoon.initStickyAlert({\r\n content: 'Failed fetching RSS!
' + error,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n console.error(error)\r\n })\r\n}\r\n\r\nexport async function nyaaRss (media, episode, isOffline) {\r\n const frag = document.createDocumentFragment()\r\n const titles = [...new Set(Object.values(media.title).concat(media.synonyms).filter(name => name != null))].join(')|(').replace(/&/g, '%26')\r\n const ep = (media.episodes !== 1 && ((media.status === 'FINISHED' && settings.torrent9) ? `\"01-${media.episodes}\"|\"01~${media.episodes}\"|\"Batch\"|\"Complete\"|\"+${episode}+\"|\"+${episode}v\"|\"S01\"` : `\"+${episode}+\"|\"+${episode}v\"`)) || ''\r\n const excl = exclusions[userBrowser].join('|')\r\n const quality = `${settings.torrent1}` || '\"1080p\"'\r\n const trusted = settings.torrent3 === true ? 2 : 0\r\n const url = new URL(`https://meowinjapanese.cf/?page=rss&c=1_2&f=${trusted}&s=seeders&o=desc&q=(${titles})${ep}${quality}-(${excl})`)\r\n\r\n const nodes = (await getRSSContent(url)).querySelectorAll('item *')\r\n if (!nodes.length) return frag\r\n const entries = []\r\n for (let index = Math.floor(nodes.length / 15); index--;) {\r\n const position = index * 15\r\n entries[index] = {\r\n title: nodes[position].textContent,\r\n hash: nodes[position + 1].textContent,\r\n seeders: nodes[position + 4].textContent,\r\n leechers: nodes[position + 5].textContent,\r\n downloads: nodes[position + 6].textContent,\r\n size: nodes[position + 10].textContent\r\n }\r\n }\r\n entries.sort((a, b) => b.seeders - a.seeders)\r\n const streamingEpisode = media?.streamingEpisodes.filter(episode => episodeRx.exec(episode.title) && Number(episodeRx.exec(episode.title)[1]) === Number(episode))[0]\r\n const fileMedia = {\r\n mediaTitle: media?.title.userPreferred,\r\n episodeNumber: Number(episode),\r\n episodeTitle: streamingEpisode ? episodeRx.exec(streamingEpisode.title)[2] : undefined,\r\n episodeThumbnail: streamingEpisode?.thumbnail,\r\n mediaCover: media?.coverImage.medium,\r\n name: 'Miru',\r\n media: media\r\n }\r\n if (settings.torrent2) {\r\n if (isOffline) {\r\n client.offlineDownload(entries[0].hash)\r\n } else {\r\n client.playTorrent(entries[0].hash, { media: fileMedia, episode: episode })\r\n }\r\n halfmoon.toggleModal('tsearch')\r\n }\r\n entries.forEach((entry, index) => {\r\n const template = document.createElement('tr')\r\n template.innerHTML += `\r\n${(index + 1)}\r\n${entry.title}\r\n${entry.size}\r\n${entry.seeders}\r\n${entry.leechers}\r\n${entry.downloads}\r\nPlay`\r\n template.onclick = () => {\r\n if (isOffline) {\r\n client.offlineDownload(entry.hash)\r\n } else {\r\n client.playTorrent(entry.hash, { media: fileMedia, episode: episode })\r\n }\r\n halfmoon.hideModal('tsearch')\r\n }\r\n frag.appendChild(template)\r\n })\r\n return frag\r\n}\r\n\r\nexport function getRSSurl () {\r\n if (Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0]) {\r\n return new URL(Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0].textContent + settings.torrent1)\r\n } else {\r\n return new URL(settings.torrent4 + settings.torrent1) // add custom RSS\r\n }\r\n}\r\n","/* global navHome, searchClear, searchWrapper, skeletonCardTemplate, bareCardTemplate, fullCardTemplate, home, searchText, searchGenre, searchYear, searchSeason, searchFormat, searchStatus, searchSort, navSchedule, homeContinueMore, homeReleasesMore, homePlanningMore, homeTrendingMore, homeRomanceMore, homeActionMore, homeContinue, homeReleases, homePlanning, homeTrending, homeRomance, homeAction */\r\n\r\n// THIS IS WHY YOU FUCKING USE FRAMEWORKS\r\n\r\nimport { alRequest } from './anilist.js'\r\nimport { resolveFileMedia, relations, nyaaSearch } from './anime.js'\r\nimport { getRSSurl, getRSSContent } from './rss.js'\r\nimport { settings } from './settings.js'\r\nimport { client } from './main.js'\r\nimport { countdown, flattenObj, userBrowser } from './util.js'\r\nimport halfmoon from 'halfmoon'\r\nexport function loadHomePage () {\r\n const homeLoadElements = [navSchedule, homeContinueMore, homeReleasesMore, homePlanningMore, homeTrendingMore, homeRomanceMore, homeActionMore]\r\n const homePreviewElements = [homeContinue, homeReleases, homePlanning, homeTrending, homeRomance, homeAction]\r\n const homeSearchElements = [searchText, searchGenre, searchYear, searchSeason, searchFormat, searchStatus, searchSort]\r\n const browseGallery = document.querySelector('.browse')\r\n const homeLoadFunctions = {\r\n continue: async function (page) {\r\n if (!page) gallerySkeleton(browseGallery)\r\n const res = await alRequest({ method: 'UserLists', status_in: 'CURRENT', id: alID, page: page || 1 })\r\n const mediaList = res.data.Page.mediaList.map(i => i.media).filter(media => {\r\n return media.status !== 'RELEASING' || media.mediaListEntry?.progress < media.nextAiringEpisode?.episode - 1\r\n })\r\n galleryAppend({ media: mediaList, gallery: browseGallery, method: 'continue', page: page || 1 })\r\n return res.data.Page.pageInfo.hasNextPage\r\n },\r\n releases: async function () {\r\n gallerySkeleton(browseGallery)\r\n const cards = await releasesCards((await getRSSContent(getRSSurl())).querySelectorAll('item'))\r\n browseGallery.textContent = ''\r\n browseGallery.append(...cards)\r\n home.classList.remove('loading')\r\n home.onscroll = undefined\r\n return false\r\n },\r\n planning: async function (page) {\r\n if (!page) gallerySkeleton(browseGallery)\r\n const res = await alRequest({ method: 'UserLists', status_in: 'PLANNING', id: alID, page: page || 1 })\r\n const mediaList = res.data.Page.mediaList\r\n galleryAppend({ media: mediaList.map(i => i.media), gallery: browseGallery, method: 'planning', page: page || 1 })\r\n return res.data.Page.pageInfo.hasNextPage\r\n },\r\n trending: async function () {\r\n gallerySkeleton(browseGallery)\r\n clearSearch()\r\n searchSort.value = 'TRENDING_DESC'\r\n return await homeLoadFunctions.search()\r\n },\r\n romance: async function () {\r\n gallerySkeleton(browseGallery)\r\n clearSearch()\r\n searchGenre.value = 'romance'\r\n searchSort.value = 'TRENDING_DESC'\r\n return await homeLoadFunctions.search()\r\n },\r\n action: async function () {\r\n gallerySkeleton(browseGallery)\r\n clearSearch()\r\n searchGenre.value = 'action'\r\n searchSort.value = 'TRENDING_DESC'\r\n return await homeLoadFunctions.search()\r\n },\r\n schedule: async function (page) {\r\n if (!page) gallerySkeleton(browseGallery)\r\n const res = await alRequest({ method: 'AiringSchedule', page: page || 1 })\r\n const mediaList = res.data.Page.airingSchedules\r\n galleryAppend({ media: mediaList.filter(entry => entry.media.countryOfOrigin !== 'CN' && entry.media.isAdult === false), gallery: browseGallery, method: 'schedule', page: page || 1, schedule: true })\r\n return res.data.Page.pageInfo.hasNextPage\r\n },\r\n search: async function (page) {\r\n const def = {\r\n method: 'Search',\r\n page: page || 1\r\n }\r\n const opts = {}\r\n Object.assign(opts, def)\r\n for (const element of homeSearchElements) {\r\n if (element.value) opts[element.dataset.option] = element.value\r\n }\r\n if (Object.keys(def).length !== Object.keys(opts).length) {\r\n const res = await alRequest(opts)\r\n const mediaList = res.data.Page.media\r\n galleryAppend({ media: mediaList, gallery: browseGallery, method: 'search', page: page || 1 })\r\n return res.data.Page.pageInfo.hasNextPage\r\n } else {\r\n searchClear.classList.remove('text-primary')\r\n home.classList.remove('loading')\r\n reloadHome()\r\n return false\r\n }\r\n }\r\n }\r\n const homePreviewFunctions = {\r\n continue: function () {\r\n alRequest({ method: 'UserLists', status_in: 'CURRENT', id: alID, perPage: 50 }).then(res => {\r\n const mediaList = res.data.Page.mediaList.filter(({ media }) => {\r\n return media.status !== 'RELEASING' || media.mediaListEntry?.progress < media.nextAiringEpisode?.episode - 1\r\n }).slice(0, 5).map(i => i.media)\r\n galleryAppend({ media: mediaList, gallery: homeContinue })\r\n })\r\n },\r\n releases: async function () { // this could be cleaner, but oh well\r\n const doc = await getRSSContent(getRSSurl())\r\n if (doc) {\r\n const pubDate = doc.querySelector('pubDate').textContent\r\n if (lastRSSDate !== pubDate) {\r\n if (lastRSSDate) {\r\n homeReleases.textContent = ''\r\n homeReleases.append(...gallerySkeletonFrag(5))\r\n if (settings.other1) {\r\n resolveFileMedia({ fileName: doc.querySelector('item title').textContent, isRelease: true }).then(mediaInformation => {\r\n const notification = new Notification(mediaInformation.media.title.userPreferred, {\r\n body: `Episode ${mediaInformation.episodeNumber} was just released!`,\r\n icon: mediaInformation.media.coverImage.medium\r\n })\r\n notification.onclick = async () => {\r\n window.parent.focus()\r\n relations[mediaInformation.parseObject.anime_title] = (await alRequest({ id: mediaInformation.media.id, method: 'SearchIDSingle' })).data.Media.id\r\n client.playTorrent(doc.querySelector('item link').textContent, { media: mediaInformation, episode: mediaInformation.episode })\r\n }\r\n })\r\n }\r\n }\r\n lastRSSDate = pubDate\r\n const cards = await releasesCards(doc.querySelectorAll('item'), 5)\r\n homeReleases.textContent = ''\r\n homeReleases.append(...cards)\r\n }\r\n }\r\n },\r\n planning: function () {\r\n alRequest({ method: 'UserLists', status_in: 'PLANNING', id: alID, perPage: 5 }).then(res => {\r\n galleryAppend({ media: res.data.Page.mediaList.map(i => i.media), gallery: homePlanning })\r\n })\r\n },\r\n trending: function () {\r\n alRequest({ method: 'Search', id: alID, perPage: 5, sort: 'TRENDING_DESC' }).then(res => {\r\n galleryAppend({ media: res.data.Page.media, gallery: homeTrending })\r\n })\r\n },\r\n romance: function () {\r\n alRequest({ method: 'Search', genre: 'Romance', perPage: 5, sort: 'TRENDING_DESC' }).then(res => {\r\n galleryAppend({ media: res.data.Page.media, gallery: homeRomance })\r\n })\r\n },\r\n action: function () {\r\n alRequest({ method: 'Search', genre: 'Action', perPage: 5, sort: 'TRENDING_DESC' }).then(res => {\r\n galleryAppend({ media: res.data.Page.media, gallery: homeAction })\r\n })\r\n }\r\n }\r\n const gallerySkeletonFrag = function (limit) {\r\n const cards = []\r\n while (limit--) {\r\n cards.push(skeletonCard.cloneNode(true))\r\n }\r\n return cards\r\n }\r\n let loadTimeout\r\n let lastDate\r\n let lastRSSDate\r\n let canScroll = true\r\n\r\n function gallerySkeleton (gallery) {\r\n home.classList.add('loading')\r\n gallery.textContent = ''\r\n gallery.append(...gallerySkeletonFrag(10))\r\n }\r\n function galleryAppend (opts) {\r\n if (opts.page === 1) {\r\n home.classList.remove('loading')\r\n }\r\n if (opts.method) {\r\n canScroll = false\r\n home.onscroll = function () {\r\n if (this.scrollTop + this.clientHeight > this.scrollHeight - 800 && !loadTimeout && canScroll) {\r\n canScroll = false\r\n loadTimeout = setTimeout(function () { loadTimeout = undefined }, 1000)\r\n homeLoadFunctions[opts.method](opts.page + 1).then((hasNextPage) => { canScroll = hasNextPage })\r\n }\r\n }\r\n }\r\n if (!opts.page || opts.page === 1) {\r\n opts.gallery.textContent = ''\r\n }\r\n const date = new Date()\r\n const cards = []\r\n opts.media.forEach(media => {\r\n if (opts.schedule) {\r\n if (media.timeUntilAiring && (!lastDate || (new Date(+date + media.timeUntilAiring * 1000).getDay() !== lastDate.getDay()))) {\r\n const div = document.createElement('div')\r\n lastDate = new Date(+date + media.timeUntilAiring * 1000)\r\n div.classList.add('day-row', 'font-size-24', 'font-weight-bold', 'h-50', 'd-flex', 'align-items-end')\r\n div.textContent = lastDate.toLocaleDateString('en-US', { weekday: 'long' })\r\n cards.push(div)\r\n }\r\n media = media.media\r\n }\r\n cards.push(cardCreator({ media: media, schedule: opts.schedule, onclick: () => viewMedia(media) }))\r\n })\r\n opts.gallery.append(...cards)\r\n canScroll = true\r\n }\r\n\r\n for (const item of homePreviewElements) {\r\n homePreviewFunctions[item.dataset.function]()\r\n }\r\n setInterval(homePreviewFunctions.releases, 30000)\r\n for (const item of homeLoadElements) {\r\n item.onclick = function () {\r\n home.scrollTop = 0\r\n home.classList.add('browsing')\r\n searchClear.classList.add('text-primary')\r\n homeLoadFunctions[item.dataset.function]()\r\n }\r\n }\r\n function reloadHome () {\r\n clearSearch()\r\n searchClear.classList.remove('text-primary')\r\n home.classList.remove('browsing')\r\n lastRSSDate = undefined\r\n home.onscroll = undefined\r\n home.scrollTop = 0\r\n for (const item of homePreviewElements) {\r\n item.textContent = ''\r\n item.append(...gallerySkeletonFrag(5))\r\n homePreviewFunctions[item.dataset.function]()\r\n }\r\n document.querySelector('.browse').textContent = ''\r\n }\r\n navHome.onclick = reloadHome\r\n searchClear.onclick = reloadHome\r\n function clearSearch () {\r\n for (const element of homeSearchElements) {\r\n element.value = ''\r\n }\r\n }\r\n let searchTimeout\r\n searchWrapper.oninput = () => {\r\n if (!searchTimeout) {\r\n home.classList.add('browsing')\r\n gallerySkeleton(browseGallery)\r\n home.scrollTop = 0\r\n } else {\r\n clearTimeout(searchTimeout)\r\n }\r\n searchClear.classList.add('text-primary')\r\n searchTimeout = setTimeout(() => {\r\n homeLoadFunctions.search()\r\n searchTimeout = undefined\r\n }, 500)\r\n }\r\n}\r\n\r\nconst skeletonCard = skeletonCardTemplate.cloneNode(true).content\r\nconst bareCard = bareCardTemplate.cloneNode(true).content\r\nconst fullCard = fullCardTemplate.cloneNode(true).content\r\nexport function cardCreator (opts) {\r\n if (opts.media) {\r\n const card = fullCard.cloneNode(true)\r\n const nodes = card.querySelectorAll('*')\r\n nodes[0].onclick = opts.onclick\r\n nodes[0].style = `--color:${opts.media.coverImage.color || '#1890ff'};`\r\n nodes[3].src = opts.media.coverImage.extraLarge || ''\r\n nodes[6].textContent = [opts.media.title.userPreferred, opts.episodeNumber].filter(s => s).join(' - ')\r\n if (opts.schedule && opts.media.nextAiringEpisode) nodes[7].textContent = 'EP ' + opts.media.nextAiringEpisode.episode + ' in ' + countdown(opts.media.nextAiringEpisode.timeUntilAiring)\r\n nodes[8].innerHTML = '' + [\r\n opts.media.format === 'TV' ? 'TV Show' : opts.media.format?.toLowerCase().replace(/_/g, ' '),\r\n opts.media.episodes ? opts.media.episodes + ' Episodes' : opts.media.duration ? opts.media.duration + ' Minutes' : undefined,\r\n opts.media.status?.toLowerCase().replace(/_/g, ' '),\r\n [opts.media.season?.toLowerCase(), opts.media.seasonYear].filter(s => s).join(' ')\r\n ].filter(s => s).join('') + ''\r\n nodes[13].innerHTML = opts.media.description\r\n nodes[14].innerHTML = opts.media.genres.map(key => (`${key} `)).join('')\r\n return card\r\n } else if (opts.parseObject) {\r\n const card = bareCard.cloneNode(true)\r\n card.querySelector('h5').textContent = [opts.parseObject.anime_title, opts.parseObject.episode_number].filter(s => s).join(' - ')\r\n card.firstElementChild.onclick = opts.onclick\r\n return card\r\n }\r\n return skeletonCard.cloneNode(true)\r\n}\r\n\r\nasync function releasesCards (items, limit) {\r\n const cards = []\r\n const media = await resolveFileMedia({ fileName: [...items].map(item => item.querySelector('title').textContent).slice(0, limit), isRelease: true })\r\n media.forEach((mediaInformation, index) => {\r\n mediaInformation.onclick = () => client.playTorrent(items[index].querySelector('link').textContent, { media: mediaInformation, episode: mediaInformation.episode })\r\n cards.push(cardCreator(mediaInformation))\r\n })\r\n localStorage.setItem('relations', JSON.stringify(relations))\r\n return cards\r\n}\r\nconst genreBadge = document.createElement('span')\r\ngenreBadge.classList.add('badge', 'badge-pill', 'shadow')\r\n\r\nfunction genreBadges (genres = []) {\r\n const badges = []\r\n for (const genre of genres) {\r\n const badge = genreBadge.cloneNode(true)\r\n badge.textContent = genre\r\n badges.push(badge)\r\n }\r\n return badges\r\n}\r\nconst detailsMap = [\r\n { property: 'episode', label: 'Airing', icon: 'schedule', custom: 'property' },\r\n { property: 'genres', label: 'Genres', icon: 'theater_comedy' },\r\n { property: 'season', label: 'Season', icon: 'spa', custom: 'property' },\r\n { property: 'episodes', label: 'Episodes', icon: 'theaters', custom: 'property' },\r\n { property: 'duration', label: 'Duration', icon: 'timer' },\r\n { property: 'format', label: 'Format', icon: 'monitor' },\r\n { property: 'status', label: 'Status', icon: 'live_tv' },\r\n { property: 'nodes', label: 'Studio', icon: 'business' },\r\n { property: 'source', label: 'Source', icon: 'source' },\r\n { property: 'averageScore', label: 'Rating', icon: 'trending_up', custom: 'property' },\r\n { property: 'english', label: 'English', icon: 'title' },\r\n { property: 'romaji', label: 'Romaji', icon: 'translate' },\r\n { property: 'native', label: 'Native', icon: '語', custom: 'icon' }\r\n]\r\n/* global detailTemplate */\r\nconst detailTemp = detailTemplate.cloneNode(true).content\r\nfunction mediaDetails (media) {\r\n const details = []\r\n for (const detail of detailsMap) {\r\n if (media[detail.property]) {\r\n const clone = detailTemp.cloneNode(true)\r\n const nodes = clone.querySelectorAll('*')\r\n switch (media[detail.property].constructor) {\r\n case String: {\r\n nodes[4].textContent = media[detail.property].replace(/_/g, ' ').toLowerCase()\r\n break\r\n }\r\n case Number: {\r\n nodes[4].textContent = media[detail.property]\r\n break\r\n }\r\n case Array: {\r\n if (detail.property === 'nodes') {\r\n nodes[4].textContent = media[detail.property][0] && media[detail.property][0].name\r\n } else {\r\n nodes[4].textContent = media[detail.property].join(', ').replace(/_/g, ' ').toLowerCase()\r\n }\r\n }\r\n }\r\n nodes[1].textContent = detail.icon\r\n nodes[3].textContent = detail.label\r\n switch (detail.custom) {\r\n case 'icon': {\r\n nodes[1].classList.remove('material-icons', 'font-size-24')\r\n nodes[1].classList.add('d-flex', 'align-items-center', 'text-nowrap', 'font-size-12', 'font-weight-bold')\r\n break\r\n }\r\n case 'property': {\r\n if (detail.property === 'episodes' && media.progress) {\r\n nodes[4].innerHTML = `Watched ${media.progress} of ${media.episodes}`\r\n } else if (detail.property === 'averageScore') {\r\n nodes[4].textContent = media.averageScore + '%'\r\n } else if (detail.property === 'season') {\r\n nodes[4].textContent = [media.season?.toLowerCase(), media.seasonYear].filter(f => f).join(' ')\r\n } else if (detail.property === 'episode') {\r\n nodes[4].textContent = `Ep ${media.episode}: ${countdown(media.timeUntilAiring)}`\r\n } else {\r\n nodes[4].textContent = media[detail.property]\r\n }\r\n }\r\n }\r\n details.push(clone)\r\n }\r\n }\r\n return details\r\n}\r\n\r\nfunction trailerPopup (trailer) {\r\n trailerVideo.src = ''\r\n halfmoon.toggleModal('trailer')\r\n switch (trailer.site) { // should support the other possible sites too, but i cant find any examples\r\n case 'youtube':\r\n trailerVideo.src = 'https://www.youtube.com/embed/' + trailer.id\r\n break\r\n }\r\n}\r\ntrailerClose.onclick = () => {\r\n trailerVideo.src = ''\r\n}\r\n\r\nnavNowPlaying.onclick = () => { if (client.nowPlaying?.media) viewMedia(client.nowPlaying.media) }\r\n/* global trailerVideo, viewAnime, trailerClose, navNowPlaying */\r\nconst viewNodes = viewAnime.querySelectorAll('*')\r\nexport function viewMedia (input, episode) {\r\n halfmoon.showModal('viewAnime')\r\n const media = flattenObj(input)\r\n viewNodes[9].src = media.extraLarge || media.medium\r\n viewNodes[13].textContent = media.userPreferred\r\n viewNodes[17].textContent = media.averageScore + '%'\r\n viewNodes[20].textContent = media.format === 'TV' ? media.format : media.format?.toLowerCase()\r\n if (media.episodes === 1 || (!media.episodes && !media.episode)) {\r\n viewNodes[14].classList.add('movie')\r\n viewNodes[31].classList.add('movie')\r\n viewNodes[28].textContent = media.duration + ' min'\r\n } else {\r\n viewNodes[31].classList.remove('movie')\r\n viewNodes[14].classList.remove('movie')\r\n viewNodes[24].textContent = media.episodes\r\n }\r\n viewNodes[29].textContent = ''\r\n viewNodes[29].append(...genreBadges(media.genres))\r\n\r\n if (media.episodes || media.episode) {\r\n viewNodes[31].classList.remove('hidden')\r\n viewNodes[33].onclick = () => { nyaaSearch(input, Number(viewNodes[44].value) || 1); halfmoon.hideModal('viewAnime') }\r\n viewNodes[44].value = episode || Math.min(Number(media.progress) + 1 || 1, media.episodes)\r\n viewNodes[35].textContent = media.progress && media.progress !== media.episodes ? 'Continue' : 'Play'\r\n\r\n viewNodes[46].onclick = () => { nyaaSearch(input, Number(viewNodes[56].value) || 1, true); halfmoon.hideModal('viewAnime') }\r\n viewNodes[56].value = episode || Math.min(Number(media.progress) + 1 || 1, media.episodes)\r\n } else {\r\n viewNodes[31].classList.add('hidden')\r\n }\r\n if (media.bannerImage) {\r\n viewNodes[4].style = `background-image: linear-gradient(0deg, rgba(17,20,23,1) 0%, rgba(17,20,23,0.80) 25%, rgba(17,20,23,0.40) 50%, rgba(37,40,44,0) 100%), url('${media.bannerImage}') !important`\r\n } else {\r\n viewNodes[4].style = 'background-image: linear-gradient(0deg, rgba(17,20,23,1) 0%, rgba(17,20,23,0.80) 25%, rgba(17,20,23,0.40) 50%, rgba(37,40,44,0) 100%) !important'\r\n }\r\n\r\n viewNodes[57].onclick = () => trailerPopup(input.trailer)\r\n\r\n viewNodes[63].innerHTML = media.description\r\n\r\n viewNodes[66].textContent = ''\r\n viewNodes[66].append(...mediaDetails(media))\r\n}\r\n\r\nexport let alID // login icon\r\n/* global oauth */\r\nexport function initMenu () {\r\n if (localStorage.getItem('ALtoken')) {\r\n alRequest({ method: 'Viewer' }).then(result => {\r\n oauth.removeAttribute('href')\r\n oauth.setAttribute('data-title', `${result.data.Viewer.name}\\nClick To Logout`)\r\n oauth.innerHTML = `\r\n \r\n \r\n ${result.data.Viewer.name}\r\n logout\r\n `\r\n oauth.onclick = () => {\r\n localStorage.removeItem('ALtoken')\r\n location.reload()\r\n }\r\n alID = result.data.Viewer.id\r\n loadHomePage()\r\n })\r\n } else {\r\n loadHomePage()\r\n home.classList.add('noauth')\r\n }\r\n}\r\n\r\nif (userBrowser === 'firefox') {\r\n halfmoon.initStickyAlert({\r\n content: 'Your browser will likely not support many video formats, containers and features. Please use Chromium!',\r\n title: 'Bad Browser',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n}\r\n","import { alID } from './interface.js'\r\nimport { settings } from './settings.js'\r\nimport halfmoon from 'halfmoon'\r\n\r\nasync function handleRequest (opts) {\r\n return await fetch('https://graphql.anilist.co', opts).then(async res => {\r\n const json = await res.json()\r\n if (!res.ok) {\r\n for (const error of json.errors) {\r\n halfmoon.initStickyAlert({\r\n content: `Failed making request to anilist!
${error.status} - ${error.message}`,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n console.error(error)\r\n }\r\n }\r\n return json\r\n })\r\n}\r\n\r\nexport function alEntry (filemedia) {\r\n if (filemedia.media && localStorage.getItem('ALtoken')) {\r\n alRequest({ method: 'SearchIDStatus', id: filemedia.media.id }).then(res => {\r\n if ((res.errors && res.errors[0].status === 404) || res.data.MediaList.progress <= filemedia.episodeNumber || filemedia.episodes === 1) {\r\n const query = `\r\nmutation ($id: Int, $status: MediaListStatus, $episode: Int, $repeat: Int) {\r\n SaveMediaListEntry (mediaId: $id, status: $status, progress: $episode, repeat: $repeat) {\r\n id,\r\n status,\r\n progress,\r\n repeat\r\n }\r\n}`\r\n const variables = {\r\n repeat: 0,\r\n id: filemedia.media.id,\r\n status: 'CURRENT',\r\n episode: filemedia.episodeNumber || 1\r\n }\r\n if (filemedia.episodeNumber === filemedia.media.episodes || filemedia.episodes === 1) {\r\n variables.status = 'COMPLETED'\r\n if (res.data.MediaList.status === 'COMPLETED') {\r\n variables.repeat = res.data.MediaList.repeat + 1\r\n }\r\n }\r\n const options = {\r\n method: 'POST',\r\n headers: {\r\n Authorization: 'Bearer ' + localStorage.getItem('ALtoken'),\r\n 'Content-Type': 'application/json',\r\n Accept: 'application/json'\r\n },\r\n body: JSON.stringify({\r\n query: query,\r\n variables: variables\r\n })\r\n }\r\n handleRequest(options)\r\n }\r\n })\r\n }\r\n}\r\n\r\nexport async function alRequest (opts) {\r\n let query\r\n const variables = {\r\n type: 'ANIME',\r\n sort: opts.sort || 'TRENDING_DESC',\r\n page: opts.page || 1,\r\n perPage: opts.perPage || 30,\r\n status_in: opts.status_in || '[CURRENT,PLANNING]',\r\n chunk: opts.chunk || 1,\r\n perchunk: opts.perChunk || 30,\r\n startDate: (!settings.other3 && (opts.startDate || 20210328)) || 10000000\r\n }\r\n const options = {\r\n method: 'POST',\r\n headers: {\r\n 'Content-Type': 'application/json',\r\n Accept: 'application/json'\r\n }\r\n }\r\n const queryObjects = `\r\nid,\r\ntitle {\r\n romaji,\r\n english,\r\n native,\r\n userPreferred\r\n},\r\ndescription(\r\n asHtml: true\r\n),\r\nseason,\r\nseasonYear,\r\nformat,\r\nstatus,\r\nepisodes,\r\nduration,\r\naverageScore,\r\ngenres,\r\ncoverImage {\r\n extraLarge,\r\n medium,\r\n color\r\n},\r\ncountryOfOrigin,\r\nisAdult,\r\nbannerImage,\r\nsynonyms,\r\nnextAiringEpisode {\r\n timeUntilAiring,\r\n episode\r\n},\r\ntrailer {\r\n id,\r\n site\r\n},\r\nstreamingEpisodes {\r\n title,\r\n thumbnail\r\n},\r\nmediaListEntry {\r\n progress\r\n},\r\nsource,\r\nstudios(isMain: true) {\r\n nodes {\r\n name\r\n }\r\n},\r\nrelations {\r\n edges {\r\n relationType(version:2)\r\n node {\r\n id,\r\n title {\r\n userPreferred\r\n },\r\n coverImage {\r\n medium\r\n },\r\n type,\r\n status,\r\n format,\r\n episodes\r\n }\r\n }\r\n}`\r\n if (opts.status) variables.status = opts.status\r\n if (localStorage.getItem('ALtoken')) options.headers.Authorization = localStorage.getItem('ALtoken')\r\n switch (opts.method) {\r\n case 'SearchName': {\r\n variables.search = opts.name\r\n query = ` \r\nquery ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: [MediaStatus]) {\r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n media(type: $type, search: $search, sort: $sort, status_in: $status) {\r\n ${queryObjects}\r\n }\r\n }\r\n}`\r\n break\r\n } case 'SearchIDSingle': {\r\n variables.id = opts.id\r\n query = ` \r\nquery ($id: Int, $type: MediaType) { \r\n Media (id: $id, type: $type) {\r\n ${queryObjects}\r\n }\r\n}`\r\n break\r\n } case 'SearchIDS': {\r\n variables.id = opts.id\r\n query = ` \r\nquery ($id: [Int], $type: MediaType, $page: Int, $perPage: Int) { \r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n media (id_in: $id, type: $type) {\r\n ${queryObjects}\r\n }\r\n }\r\n}`\r\n break\r\n } case 'Viewer': {\r\n query = ` \r\nquery {\r\n Viewer {\r\n avatar {\r\n medium\r\n },\r\n name,\r\n id\r\n }\r\n}`\r\n break\r\n } case 'UserLists': {\r\n variables.id = opts.id\r\n query = ` \r\nquery ($page: Int, $perPage: Int, $id: Int, $type: MediaType, $status_in: [MediaListStatus]){\r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n mediaList (userId: $id, type: $type, status_in: $status_in) {\r\n media {\r\n ${queryObjects}\r\n }\r\n }\r\n }\r\n}`\r\n break\r\n } case 'SearchIDStatus': {\r\n variables.id = alID\r\n variables.mediaId = opts.id\r\n query = ` \r\nquery ($id: Int, $mediaId: Int){\r\n MediaList(userId: $id, mediaId: $mediaId) {\r\n status,\r\n progress,\r\n repeat\r\n }\r\n}`\r\n break\r\n } case 'AiringSchedule': {\r\n const date = new Date()\r\n const diff = date.getDay() >= 1 ? date.getDay() - 1 : 6 - date.getDay()\r\n date.setDate(date.getDate() - diff)\r\n date.setHours(0, 0, 0, 0)\r\n variables.from = date.getTime() / 1000\r\n variables.to = (date.getTime() + 7 * 24 * 60 * 60 * 1000) / 1000\r\n query = ` \r\nquery ($page: Int, $perPage: Int, $from: Int, $to: Int) {\r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n airingSchedules(airingAt_greater: $from, airingAt_lesser: $to) {\r\n episode,\r\n timeUntilAiring,\r\n airingAt,\r\n media{\r\n ${queryObjects}\r\n }\r\n }\r\n }\r\n}`\r\n break\r\n } case 'Search': {\r\n variables.genre = opts.genre\r\n variables.search = opts.search\r\n variables.year = opts.year\r\n variables.season = opts.season\r\n variables.format = opts.format\r\n variables.status = opts.status\r\n variables.sort = opts.sort || 'SEARCH_MATCH'\r\n query = ` \r\nquery ($page: Int, $perPage: Int, $sort: [MediaSort], $type: MediaType, $search: String, $status: MediaStatus, $season: MediaSeason, $year: Int, $genre: String, $format: MediaFormat, $startDate: FuzzyDateInt) {\r\n Page (page: $page, perPage: $perPage) {\r\n pageInfo {\r\n hasNextPage\r\n },\r\n media(type: $type, search: $search, sort: $sort, status: $status, season: $season, seasonYear: $year, genre: $genre, format: $format, startDate_greater: $startDate) {\r\n ${queryObjects}\r\n }\r\n }\r\n}`\r\n }\r\n }\r\n options.body = JSON.stringify({\r\n query: query.replace(/\\s/g, ''),\r\n variables: variables\r\n })\r\n\r\n return await handleRequest(options)\r\n}\r\n","const __WEBPACK_NAMESPACE_OBJECT__ = anitomyscript;","/* global searchText */\r\nimport { client } from './main.js'\r\nimport { searchParams, DOMPARSER } from './util.js'\r\nimport { alRequest } from './anilist.js'\r\nimport { nyaaRss } from './rss.js'\r\nimport { viewMedia } from './interface.js'\r\nimport halfmoon from 'halfmoon'\r\nimport anitomyscript from 'anitomyscript'\r\nconst torrentRx = /(^magnet:){1}|(^[A-F\\d]{8,40}$){1}|(.*\\.torrent$){1}/i\r\nconst imageRx = /\\.(jpeg|jpg|gif|png|webp)/i\r\nwindow.addEventListener('paste', async e => { // WAIT image lookup on paste, or add torrent on paste\r\n const item = e.clipboardData.items[0]\r\n if (item && item.type.indexOf('image') === 0) {\r\n e.preventDefault()\r\n const formData = new FormData()\r\n formData.append('image', item.getAsFile())\r\n traceAnime(formData, 'file')\r\n } else if (item && item.type === 'text/plain') {\r\n item.getAsString(text => {\r\n if (torrentRx.exec(text)) {\r\n e.preventDefault()\r\n searchText.value = ''\r\n client.playTorrent(text)\r\n } else if (imageRx.exec(text)) {\r\n e.preventDefault()\r\n searchText.value = ''\r\n traceAnime(text)\r\n }\r\n })\r\n } else if (item && item.type === 'text/html') {\r\n item.getAsString(text => {\r\n const img = DOMPARSER(text, 'text/html').querySelectorAll('img')[0]\r\n if (img) {\r\n e.preventDefault()\r\n searchText.value = ''\r\n traceAnime(img.src)\r\n }\r\n })\r\n }\r\n})\r\nif (searchParams.get('link')) {\r\n traceAnime(searchParams.get('link'))\r\n window.location = '/app/#home'\r\n}\r\nfunction traceAnime (image, type) { // WAIT lookup logic\r\n if (type === 'file') {\r\n const reader = new FileReader()\r\n reader.onload = e => {\r\n halfmoon.initStickyAlert({\r\n content: `Looking up anime for image.
`\r\n })\r\n }\r\n reader.readAsDataURL(image.get('image'))\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: `Looking up anime for image.
`\r\n })\r\n }\r\n let options\r\n let url = `https://api.trace.moe/search?cutBorders&url=${image}`\r\n if (type === 'file') {\r\n options = {\r\n method: 'POST',\r\n body: image\r\n }\r\n url = 'https://api.trace.moe/search'\r\n }\r\n fetch(url, options).then(res => res.json()).then(async ({ result }) => {\r\n if (result && result[0].similarity >= 0.85) {\r\n const res = await alRequest({ method: 'SearchIDSingle', id: result[0].anilist })\r\n viewMedia(res.data.Media, result[0].episode)\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: 'Couldn\\'t find anime for specified image! Try to remove black bars, or use a more detailed image.',\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n }\r\n })\r\n}\r\nexport const episodeRx = /Episode (\\d+) - (.*)/\r\n\r\nexport async function nyaaSearch (media, episode, isOffline) {\r\n if (parseInt(episode) < 10) {\r\n episode = `0${episode}`\r\n }\r\n\r\n const table = document.querySelector('tbody.results')\r\n const results = await nyaaRss(media, episode, isOffline)\r\n\r\n if (results.children.length === 0) {\r\n halfmoon.initStickyAlert({\r\n content: `Couldn't find torrent for ${media.title.userPreferred} Episode ${parseInt(episode)}! Try specifying a torrent manually.`,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n } else {\r\n table.innerHTML = ''\r\n table.appendChild(results)\r\n halfmoon.toggleModal('tsearch')\r\n }\r\n}\r\n\r\n// resolve anime name based on file name and store it\r\n\r\nexport async function resolveFileMedia (opts) {\r\n // opts.fileName opts.isRelease\r\n\r\n async function resolveTitle (title) {\r\n if (!(title in relations)) {\r\n // resolve name and shit\r\n const method = { name: title, method: 'SearchName', perPage: 1, status: ['RELEASING', 'FINISHED'], sort: 'SEARCH_MATCH', startDate: 10000000 }\r\n let res = await alRequest(method)\r\n if (!res.data.Page.media[0]) {\r\n const index = method.name.search(/S\\d/)\r\n method.name = ((index !== -1 && method.name.slice(0, index) + method.name.slice(index + 1, method.name.length)) || method.name).replace('(TV)', '').replace(/ (19[5-9]\\d|20[0-6]\\d)/, '').replace('-', '')\r\n method.status = ['RELEASING', 'FINISHED']\r\n res = await alRequest(method)\r\n }\r\n if (res.data.Page.media[0]) {\r\n relations[title] = res.data.Page.media[0].id\r\n } else {\r\n relations[title] = null\r\n }\r\n }\r\n }\r\n const parsePromises = opts.fileName.constructor === Array\r\n ? opts.fileName.map(name => anitomyscript(name))\r\n : [anitomyscript(opts.fileName)]\r\n const parseObjs = await Promise.all(parsePromises)\r\n await Promise.all([...new Set(parseObjs.map(obj => obj.anime_title))].map(title => resolveTitle(title)))\r\n const assoc = {}\r\n for (let ids = [...new Set(parseObjs.map(obj => relations[obj.anime_title]))]; ids.length; ids = ids.slice(50)) {\r\n for await (const media of (await alRequest({ method: 'SearchIDS', id: ids.slice(0, 50), perPage: 50 })).data.Page.media) {\r\n assoc[media.id] = media\r\n }\r\n }\r\n const fileMedias = []\r\n for (const praseObj of parseObjs) {\r\n let episode\r\n let media = assoc[relations[praseObj.anime_title]]\r\n async function resolveSeason (opts) {\r\n // opts.media, opts.episode, opts.increment, opts.offset\r\n let epMin, epMax\r\n if (opts.episode.constructor === Array) { // support batch episode ranges\r\n epMin = Number(opts.episode[0])\r\n epMax = Number(opts.episode[opts.episode.length - 1])\r\n } else {\r\n epMin = epMax = Number(opts.episode)\r\n }\r\n let tempMedia, increment\r\n if (opts.media.relations.edges.some(edge => edge.relationType === 'PREQUEL' && (edge.node.format === 'TV' || 'TV_SHORT')) && !opts.increment) {\r\n // media has prequel and we dont want to move up in the tree\r\n tempMedia = opts.media.relations.edges.filter(edge => edge.relationType === 'PREQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))[0].node\r\n } else if (opts.media.relations.edges.some(edge => edge.relationType === 'SEQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))) {\r\n // media doesnt have prequel, or we want to move up in the tree\r\n tempMedia = opts.media.relations.edges.filter(edge => edge.relationType === 'SEQUEL' && (edge.node.format === 'TV' || 'TV_SHORT'))[0].node\r\n increment = true\r\n }\r\n if (tempMedia?.episodes && epMax - (opts.offset + media.episodes) > (media.nextAiringEpisode?.episode || media.episodes)) {\r\n // episode is still out of bounds\r\n const nextEdge = await alRequest({ method: 'SearchIDSingle', id: tempMedia.id })\r\n await resolveSeason({ media: nextEdge.data.Media, episode: opts.episode, offset: opts.offset + nextEdge.data.Media.episodes, increment: increment })\r\n } else if (tempMedia?.episodes && epMax - (opts.offset + media.episodes) <= (media.nextAiringEpisode?.episode || media.episodes) && epMin - (opts.offset + media.episodes) > 0) {\r\n // episode is in range, seems good! overwriting media to count up \"seasons\"\r\n if (opts.episode.constructor === Array) {\r\n episode = `${praseObj.episode_number[0] - (opts.offset + media.episodes)} ~ ${praseObj.episode_number[praseObj.episode_number.length - 1] - (opts.offset + media.episodes)}`\r\n } else {\r\n episode = opts.episode - (opts.offset + media.episodes)\r\n }\r\n if (opts.increment || increment) {\r\n const nextEdge = await alRequest({ method: 'SearchIDSingle', id: tempMedia.id })\r\n media = nextEdge.data.Media\r\n }\r\n } else {\r\n console.log('error in parsing!', opts.media, tempMedia)\r\n halfmoon.initStickyAlert({\r\n content: `Failed resolving anime episode!
${opts.media.title.userPreferred} - ${epMax}`,\r\n title: 'Parsing Error',\r\n alertType: 'alert-secondary',\r\n fillType: ''\r\n })\r\n // something failed, most likely couldnt find an edge or processing failed, force episode number even if its invalid/out of bounds, better than nothing\r\n if (opts.episode.constructor === Array) {\r\n episode = `${Number(praseObj.episode_number[0])} ~ ${Number(praseObj.episode_number[praseObj.episode_number.length - 1])}`\r\n } else {\r\n episode = Number(opts.episode)\r\n }\r\n }\r\n }\r\n\r\n // resolve episode, if movie, dont.\r\n if ((media?.format !== 'MOVIE' || (media.episodes || media.nextAiringEpisode.episode)) && praseObj.episode_number) {\r\n if (praseObj.episode_number.constructor === Array) {\r\n // is an episode range\r\n if (parseInt(praseObj.episode_number[0]) === 1) {\r\n // if it starts with #1 and overflows then it includes more than 1 season in a batch, cant fix this cleanly, name is parsed per file basis so this shouldnt be an issue\r\n episode = `${praseObj.episode_number[0]} ~ ${praseObj.episode_number[praseObj.episode_number.length - 1]}`\r\n } else {\r\n if ((media?.episodes || media?.nextAiringEpisode?.episode) && parseInt(praseObj.episode_number[praseObj.episode_number.length - 1]) > (media.episodes || media.nextAiringEpisode.episode)) {\r\n // if highest value is bigger than episode count or latest streamed episode +1 for safety, parseint to math.floor a number like 12.5 - specials - in 1 go\r\n await resolveSeason({ media: media, episode: praseObj.episode_number, offset: 0 })\r\n } else {\r\n // cant find ep count or range seems fine\r\n episode = `${Number(praseObj.episode_number[0])} ~ ${Number(praseObj.episode_number[praseObj.episode_number.length - 1])}`\r\n }\r\n }\r\n } else {\r\n if ((media?.episodes || media?.nextAiringEpisode?.episode) && parseInt(praseObj.episode_number) > (media.episodes || media.nextAiringEpisode.episode)) {\r\n // value bigger than episode count\r\n await resolveSeason({ media: media, episode: praseObj.episode_number, offset: 0 })\r\n } else {\r\n // cant find ep count or episode seems fine\r\n episode = Number(praseObj.episode_number)\r\n }\r\n }\r\n }\r\n const streamingEpisode = media?.streamingEpisodes.filter(episode => episodeRx.exec(episode.title) && Number(episodeRx.exec(episode.title)[1]) === Number(praseObj.episode_number))[0]\r\n fileMedias.push({\r\n mediaTitle: media?.title.userPreferred,\r\n episodeNumber: episode,\r\n episodeTitle: streamingEpisode && episodeRx.exec(streamingEpisode.title)[2],\r\n episodeThumbnail: streamingEpisode?.thumbnail,\r\n mediaCover: media?.coverImage.medium,\r\n name: 'Miru',\r\n parseObject: praseObj,\r\n media: media\r\n })\r\n }\r\n return fileMedias.length === 1 ? fileMedias[0] : fileMedias\r\n}\r\n\r\nexport const relations = JSON.parse(localStorage.getItem('relations')) || {}\r\n","const __WEBPACK_NAMESPACE_OBJECT__ = globalThis.gapi;","export const keys = {\r\n apiKey: '',\r\n clientId: '',\r\n scope: 'https://www.googleapis.com/auth/drive.readonly',\r\n discoveryDocs: ['https://www.googleapis.com/discovery/v1/apis/drive/v3/rest']\r\n}\r\n","/* global gsignin */\r\nimport BitField from 'bitfield'\r\nimport sha1 from 'simple-sha1'\r\nimport Wire from 'bittorrent-protocol'\r\nimport { load, client, auth2 } from 'gapi'\r\nimport { keys } from './keys.js'\r\nimport { concat, sleep, Queue } from './util.js'\r\nimport halfmoon from 'halfmoon'\r\n\r\n// i'll fucking give you 'thenable', shitass callbacks\r\nexport const token = new Promise(resolve => {\r\n load('client:auth2', () => {\r\n client.init(Object.assign({}, keys)).then(() => {\r\n const auth = auth2.getAuthInstance()\r\n auth.isSignedIn.listen(state => {\r\n if (state === true) {\r\n if (!auth.currentUser.get().getAuthResponse().scope.includes('https://www.googleapis.com/auth/drive.readonly')) {\r\n halfmoon.initStickyAlert({\r\n content: 'You didn\\'t grant permission for Google Drive access, try again!',\r\n title: 'Login Error',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n return auth.signOut()\r\n }\r\n resolve(auth.currentUser.get().getAuthResponse().access_token)\r\n gsignin.classList.add('d-none')\r\n }\r\n })\r\n if (!auth.isSignedIn.get()) {\r\n gsignin.onclick = auth.signIn\r\n gsignin.classList.remove('d-none')\r\n } else {\r\n if (!auth.currentUser.get().getAuthResponse().scope.includes('https://www.googleapis.com/auth/drive.readonly')) {\r\n halfmoon.initStickyAlert({\r\n content: 'You didn\\'t grant permission for Google Drive access, try again!',\r\n title: 'Login Error',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n return auth.signOut()\r\n }\r\n resolve(auth.currentUser.get().getAuthResponse().access_token)\r\n }\r\n })\r\n })\r\n})\r\n\r\nexport async function getFileNameID (name) {\r\n return new Promise(resolve => {\r\n token.then(() => {\r\n client.drive.files.list({\r\n pageSize: 1,\r\n fields: 'files(id)',\r\n includeItemsFromAllDrives: true,\r\n supportsAllDrives: true,\r\n corpora: 'allDrives',\r\n q: `name = '${name}'`\r\n }).then(res => {\r\n console.log(res)\r\n resolve(res?.result?.files?.length && res?.result?.files[0].id)\r\n })\r\n })\r\n })\r\n}\r\nexport async function GDHandleTorrent (torrent) {\r\n await token\r\n for await (const file of torrent.files) {\r\n const gDriveID = await getFileNameID(file.name)\r\n if (gDriveID) {\r\n file.gDriveID = gDriveID\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: `Couldn't find a GDrive file for ${file.name}! Can't create webseed!`,\r\n title: 'GDrive Error!',\r\n alertType: 'alert-secondary',\r\n fillType: ''\r\n })\r\n return null // if a single entry doesnt exist, I can't create a reliable webseed\r\n }\r\n await sleep(1000)\r\n }\r\n torrent.addWebSeed(new WebConn(torrent))\r\n}\r\n\r\nclass WebConn extends Wire {\r\n constructor (torrent) {\r\n super()\r\n\r\n this.connId = torrent.infoHash + ' gdrive' // Unique id to deduplicate web seeds\r\n this.webPeerId = sha1.sync(this.connId)\r\n this._torrent = torrent\r\n this.lastRequest = {}\r\n\r\n this.sleep = null\r\n\r\n this.queue = new Queue()\r\n\r\n this._init()\r\n }\r\n\r\n _init () {\r\n this.setKeepAlive(true)\r\n\r\n this.once('handshake', (infoHash, peerId) => {\r\n if (this.destroyed) return\r\n this.handshake(infoHash, this.webPeerId)\r\n const numPieces = this._torrent.pieces.length\r\n const bitfield = new BitField(numPieces)\r\n for (let i = 0; i <= numPieces; i++) {\r\n bitfield.set(i, true)\r\n }\r\n this.bitfield(bitfield)\r\n })\r\n\r\n this.once('interested', () => {\r\n this.unchoke()\r\n })\r\n\r\n this.on('request', (pieceIndex, offset, length, callback) => {\r\n const request = () => this.queue.add({\r\n fn: async () => await this.httpRequest(pieceIndex, offset, length, (err, data) => {\r\n if (err || data?.length !== length) return request()\r\n callback(err, data)\r\n }),\r\n index: pieceIndex\r\n })\r\n request()\r\n })\r\n }\r\n\r\n async httpRequest (pieceIndex, offset, length, cb) {\r\n const pieceOffset = pieceIndex * this._torrent.pieceLength\r\n const rangeStart = pieceOffset + offset\r\n const rangeEnd = rangeStart + length - 1\r\n const files = this._torrent.files\r\n let requests\r\n if (files.length <= 1) {\r\n requests = [{\r\n url: `https://www.googleapis.com/drive/v3/files/${files[0].gDriveID}?supportsAllDrives=true&alt=media&key=${keys.apiKey}`,\r\n start: rangeStart,\r\n end: rangeEnd\r\n }]\r\n } else {\r\n const requestedFiles = files.filter(file => file.offset <= rangeEnd && (file.offset + file.length) > rangeStart)\r\n if (requestedFiles.length < 1) {\r\n return cb(new Error('Could not find file corresponding to web seed range request'))\r\n }\r\n\r\n requests = requestedFiles.map(file => {\r\n const fileEnd = file.offset + file.length - 1\r\n const url = `https://www.googleapis.com/drive/v3/files/${file.gDriveID}?supportsAllDrives=true&alt=media&key=${keys.apiKey}`\r\n return {\r\n url,\r\n fileOffsetInRange: Math.max(file.offset - rangeStart, 0),\r\n start: Math.max(rangeStart - file.offset, 0),\r\n end: Math.min(fileEnd, rangeEnd - file.offset)\r\n }\r\n })\r\n }\r\n let numRequestsSucceeded = 0\r\n let hasError = false\r\n\r\n let ret\r\n if (requests.length > 1) {\r\n ret = Buffer.alloc(length)\r\n }\r\n\r\n let { res, reader, endRange, setSize, ctrl } = this.lastRequest\r\n for await (const request of requests) {\r\n const { url, start, end } = request\r\n function onResponse (res, data) {\r\n if (!res || res.status < 200 || res.status >= 300) {\r\n if (hasError) return\r\n hasError = true\r\n return cb(new Error(`Unexpected HTTP status code ${res?.status}`))\r\n }\r\n if (requests.length === 1) {\r\n cb(null, data)\r\n } else {\r\n data.copy(ret, request.fileOffsetInRange)\r\n if (++numRequestsSucceeded === requests.length) {\r\n cb(null, ret)\r\n }\r\n }\r\n }\r\n if (endRange !== start - 1 || ctrl?.signal?.aborted) {\r\n async function * read (reader) { // <3 Endless\r\n let buffered = []\r\n let bufferedBytes = 0\r\n let done = false\r\n let size = 512\r\n const setSize = x => { size = x }\r\n yield setSize\r\n\r\n while (!done) {\r\n const it = await reader.read()\r\n done = it.done\r\n if (done) {\r\n yield concat(buffered, bufferedBytes)\r\n return\r\n } else {\r\n bufferedBytes += it.value.byteLength\r\n buffered.push(it.value)\r\n\r\n while (bufferedBytes >= size) {\r\n const b = concat(buffered)\r\n bufferedBytes -= size\r\n yield b.slice(0, size)\r\n buffered = [b.slice(size, b.length)]\r\n }\r\n }\r\n }\r\n }\r\n if (ctrl) ctrl.abort()\r\n ctrl = new AbortController()\r\n await this.sleep\r\n try {\r\n res = await fetch(url, {\r\n headers: {\r\n range: `bytes=${start}-`,\r\n authorization: 'Bearer ' + await token\r\n },\r\n signal: ctrl.signal\r\n })\r\n } catch (e) {\r\n this.sleep = sleep(500)\r\n onResponse()\r\n throw e\r\n }\r\n this.sleep = sleep(500)\r\n reader = read(res.body.getReader(), 1)\r\n setSize = (await reader.next()).value // lazy, but 1st yield is callback x)\r\n }\r\n endRange = end\r\n setSize(end - start + 1)\r\n onResponse(res, (await reader.next()).value || new Uint8Array())\r\n }\r\n this.lastRequest = { res, reader, endRange, setSize, ctrl }\r\n }\r\n\r\n destroy () {\r\n this.lastRequest?.ctrl?.abort()\r\n this.queue.destroy()\r\n this.lastRequest?.ctrl?.abort()\r\n super.destroy()\r\n this._torrent = null\r\n }\r\n}\r\n","/* globals video, player, pageWrapper, subtitle1list */\r\n\r\nimport WebTorrentPlayer from 'webtorrent-player'\r\nimport { searchParams } from './util.js'\r\nimport { resolveFileMedia, nyaaSearch } from './anime.js'\r\nimport { alEntry } from './anilist.js'\r\nimport { settings } from './settings.js'\r\nimport { cardCreator, initMenu } from './interface.js'\r\nimport halfmoon from 'halfmoon'\r\nimport { GDHandleTorrent } from './webseed.js'\r\n\r\nconst playerControls = {}\r\nfor (const item of document.getElementsByClassName('ctrl')) {\r\n if (!playerControls[item.dataset.name]) {\r\n playerControls[item.dataset.name] = item\r\n } else {\r\n playerControls[item.dataset.name] = [playerControls[item.dataset.name], item]\r\n }\r\n}\r\nwindow.addEventListener('beforeunload', () => {\r\n client.destroy()\r\n})\r\nexport const client = new WebTorrentPlayer({\r\n WebTorrentOpts: {\r\n maxConns: 127,\r\n downloadLimit: settings.torrent7 * 1048576,\r\n uploadLimit: settings.torrent7 * 1572864,\r\n tracker: {\r\n announce: settings.torrent10.split('\\n')\r\n },\r\n destroyStore: true\r\n },\r\n controls: playerControls,\r\n video: video,\r\n player: player,\r\n destroyStore: true,\r\n playerWrapper: pageWrapper,\r\n burnIn: settings.subtitle3,\r\n seekTime: Number(settings.player3),\r\n immerseTime: Number(settings.player2),\r\n visibilityLossPause: settings.player10,\r\n autoNext: settings.player6,\r\n streamedDownload: settings.torrent8,\r\n generateThumbnails: settings.player5,\r\n defaultSSAStyles: Object.values(subtitle1list.options).filter(item => item.value === settings.subtitle1)[0].textContent,\r\n resolveFileMedia: resolveFileMedia\r\n})\r\nclient.on('download-done', ({ file }) => {\r\n halfmoon.initStickyAlert({\r\n content: `${file.name} has finished downloading. Now seeding.`,\r\n title: 'Download Complete',\r\n alertType: 'alert-success',\r\n fillType: ''\r\n })\r\n})\r\nclient.on('torrent', GDHandleTorrent)\r\nclient.on('watched', ({ filemedia }) => {\r\n if (filemedia?.media?.episodes || filemedia?.media?.nextAiringEpisode?.episode) {\r\n if (settings.other2 && (filemedia.media.episodes || filemedia.media.nextAiringEpisode?.episode > filemedia.episodeNumber)) {\r\n alEntry(filemedia)\r\n }\r\n // halfmoon.initStickyAlert({\r\n // content: `Do You Want To Mark
${filemedia.mediaTitle}
Episode ${filemedia.episodeNumber} As Completed?
\r\n // \r\n // `,\r\n // title: 'Episode Complete',\r\n // timeShown: 180000\r\n // })\r\n // }\r\n }\r\n})\r\nclient.on('playlist', () => {\r\n window.location.hash = '#playlist'\r\n})\r\nclient.on('next', ({ filemedia }) => {\r\n if (filemedia.media) {\r\n nyaaSearch(filemedia.media, parseInt(filemedia.episodeNumber) + 1)\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: 'Couldn\\'t find anime name! Try specifying a torrent manually.',\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n }\r\n})\r\nclient.on('prev', ({ filemedia }) => {\r\n if (filemedia.media) {\r\n nyaaSearch(filemedia.media, filemedia.episodeNumber - 1)\r\n } else {\r\n halfmoon.initStickyAlert({\r\n content: 'Couldn\\'t find anime name! Try specifying a torrent manually.',\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n }\r\n})\r\nclient.on('offline-torrent', torrent => {\r\n resolveFileMedia({ fileName: torrent.name }).then(mediaInformation => {\r\n mediaInformation.onclick = () => client.playTorrent(torrent, { media: mediaInformation, episode: mediaInformation.episode })\r\n const template = cardCreator(mediaInformation)\r\n document.querySelector('.downloads').appendChild(template)\r\n })\r\n})\r\nclient.on('video-files', async ({ files, torrent }) => {\r\n document.querySelector('.playlist').textContent = ''\r\n const cards = []\r\n for (const file of files) {\r\n const mediaInformation = await resolveFileMedia({ fileName: file.name })\r\n mediaInformation.onclick = () => {\r\n client.buildVideo(torrent, {\r\n media: mediaInformation,\r\n episode: mediaInformation.parseObject.episode,\r\n file: file\r\n })\r\n }\r\n cards.push(cardCreator(mediaInformation))\r\n }\r\n document.querySelector('.playlist').append(...cards)\r\n})\r\nclient.on('no-files', torrent => {\r\n halfmoon.initStickyAlert({\r\n content: `Couldn't find video file for ${torrent.infoHash}!`,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n})\r\nclient.on('no peers', torrent => {\r\n if (torrent.progress !== 1) {\r\n halfmoon.initStickyAlert({\r\n content: `Couldn't find peers for ${torrent.infoHash}! Try a torrent with more seeders.`,\r\n title: 'Search Failed',\r\n alertType: 'alert-danger',\r\n fillType: ''\r\n })\r\n }\r\n})\r\nclient.nowPlaying = { name: 'Miru' }\r\n\r\nwindow.client = client\r\n\r\nif (searchParams.get('file')) client.playTorrent(searchParams.get('file'))\r\n\r\nqueueMicrotask(initMenu)\r\n"],"names":["ADDR_RE","cache","Map","module","exports","addr","size","clear","has","m","exec","Error","set","Number","get","asn1","bignum","define","base","constants","decoders","encoders","inherits","Entity","name","body","this","prototype","_createNamed","Base","Generated","entity","_initNamed","call","_getDecoder","enc","hasOwnProperty","decode","data","options","_getEncoder","encode","reporter","Reporter","Buffer","DecoderBuffer","isBuffer","offset","length","error","EncoderBuffer","value","Array","isArray","map","item","isEncoderBuffer","byteLength","isDecoderBuffer","constructor","save","restore","isEmpty","readUInt8","skip","raw","res","fail","bytes","_reporterState","slice","join","out","alloc","forEach","write","copy","Node","assert","tags","methods","concat","parent","state","_baseState","children","tag","args","reverseArgs","choice","optional","any","obj","use","useDecoder","key","explicit","implicit","contains","_wrap","stateProps","clone","cstate","prop","method","push","apply","arguments","_init","filter","child","equal","_useArgs","arg","Object","keys","def","val","num","newKey","_decode","input","wrapResult","prevObj","result","present","prevKey","enterKey","_peekTag","isError","_decodeGeneric","_decodeChoice","e","enterObject","_decodeTag","start","track","path","_getUse","leaveObject","exitKey","leaveKey","_decodeList","test","_decodeStr","_decodeObjid","_decodeTime","_decodeNull","_decodeBool","_decodeInt","_use","match","some","node","type","_createEncoderBuffer","_encode","_encodeValue","undefined","_skipDefault","content","primitive","_encodeChoice","_encodePrimitive","cls","_encodeComposite","JSON","stringify","_encodeStr","_encodeObjid","_encodeTime","_encodeNull","_encodeInt","_encodeBool","_isNumstr","str","_isPrintstr","errors","ReporterError","msg","rethrow","pathLen","index","prev","now","err","inherited","elem","message","stack","partial","captureStackTrace","reverse","tagClass","tagClassByName","tagByName","_reverse","der","DERDecoder","tree","DERNode","derDecodeTag","buf","oct","tagStr","derDecodeLen","len","i","j","buffer","decodedTag","_skipUntilEnd","decoder","possibleEnd","unused","String","fromCharCode","readUInt16BE","numstr","toString","printstr","values","relative","identifiers","ident","subident","first","second","tmp","year","mon","day","hour","min","sec","Date","UTC","pem","PEMDecoder","lines","split","label","toUpperCase","re","end","base64","replace","from","DEREncoder","two","encodedTag","encodeTag","header","lenOctets","writeUInt16BE","charCodeAt","id","splice","objid","time","date","getUTCFullYear","getUTCMonth","getUTCDate","getUTCHours","getUTCMinutes","getUTCSeconds","numArray","toArray","sign","unshift","dataBuffer","defaultBuffer","PEMEncoder","p","ctor","superCtor","super_","TempCtor","BN","number","endian","isBN","negative","words","red","wordSize","window","parseHex4Bits","string","c","parseHexByte","lowerBound","r","parseBase","mul","Math","max","left","right","cmp","_initNumber","_initArray","_parseHex","_parseBase","ceil","w","off","strip","limbLen","limbPow","total","mod","word","imuln","_iaddn","pow","dest","_expand","_normSign","inspect","zeros","groupSizes","groupBases","smallMulTo","self","a","b","lo","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","isZero","modn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","reqLength","littleEndian","q","andln","iushrn","clz32","_countBits","t","_zeroBits","bitLength","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","add","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","jumboMulTo","FFTM","mulp","x","y","mulTo","hncarry","bigMulTo","makeRBT","N","l","revBin","rb","permute","rbt","rws","iws","rtws","itws","transform","s","rtwdf","cos","PI","itwdf","sin","rtwdf_","itwdf_","ie","ro","io","rx","guessLen13b","n","odd","conjugate","normalize13b","ws","round","convert13b","stub","ph","_","rwst","iwst","nrws","nrwst","niwst","rmws","mulf","muln","sqr","isqr","toBitArray","iushln","bits","carryMask","newCarry","ishln","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","shift","_wordDiv","mode","bhi","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","acc","egcd","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","gte","ltn","lt","lten","lte","eqn","eq","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","_strip","output","outLen","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u","_typeof","Symbol","iterator","isDeepEqual","isDeepStrictEqual","_require$codes","codes","ERR_AMBIGUOUS_ARGUMENT","ERR_INVALID_ARG_TYPE","ERR_INVALID_ARG_VALUE","ERR_INVALID_RETURN_VALUE","ERR_MISSING_ARGS","AssertionError","_require$types","isPromise","isRegExp","objectAssign","assign","objectIs","is","lazyLoadComparison","comparison","warned","ok","NO_EXCEPTION_SENTINEL","innerFail","innerOk","fn","argLen","generatedMessage","actual","expected","operator","stackStartFn","_len","_key","internalMessage","argsLen","warn","process","emitWarning","console","bind","errArgs","notEqual","deepEqual","notDeepEqual","deepStrictEqual","notDeepStrictEqual","strictEqual","notStrictEqual","Comparison","_this","instance","Constructor","TypeError","_classCallCheck","compareExceptionKey","expectedException","isPrototypeOf","getActual","checkIsPromise","then","catch","waitForActual","promiseFn","Promise","resolve","resultPromise","expectsError","details","fnType","expectsNoError","strict","_len6","_key6","throws","_len2","_key2","rejects","_len3","_key3","doesNotThrow","_len4","_key4","doesNotReject","_len5","_key5","ifError","newErr","origStack","tmp2","tmp1","pos","indexOf","_defineProperty","defineProperty","enumerable","configurable","writable","_defineProperties","target","props","descriptor","_possibleConstructorReturn","_assertThisInitialized","ReferenceError","_wrapNativeSuper","Class","_cache","Function","Wrapper","_construct","_getPrototypeOf","create","_setPrototypeOf","isNativeReflectConstruct","Reflect","construct","sham","Proxy","Parent","setPrototypeOf","__proto__","getPrototypeOf","endsWith","search","this_len","substring","blue","green","white","kReadableOperator","strictEqualObject","notStrictEqualObject","notIdentical","copyError","source","inspectValue","compact","customInspect","depth","maxArrayLength","Infinity","showHidden","breakLength","showProxy","sorted","getters","_Error","limit","stackTraceLimit","stderr","isTTY","getColorDepth","other","lastPos","skipped","actualInspected","actualLines","expectedLines","indicator","inputLength","columns","count","floor","maxCount","log","repeat","pop","maxLines","_actualLines","printedLines","skippedMsg","cur","expectedLine","actualLine","divergingLines","createErrDiff","_res","knownOperators","code","protoProps","subClass","superClass","_inherits","custom","recurseTimes","ownKeys","getOwnPropertySymbols","sym","getOwnPropertyDescriptor","_objectSpread","util","createErrorType","NodeError","_Base","arg1","arg2","arg3","getMessage","oneOf","thing","determiner","substr","reason","inspected","RangeError","_slicedToArray","arr","_arrayWithHoles","_arr","_n","_d","_e","_s","_i","done","_iterableToArrayLimit","_nonIterableRest","regexFlagsSupported","flags","arrayFromSet","array","arrayFromMap","objectGetOwnPropertySymbols","numberIsNaN","isNaN","uncurryThis","f","propertyIsEnumerable","objectToString","isAnyArrayBuffer","isArrayBufferView","isDate","isMap","isSet","isNativeError","isBoxedPrimitive","isNumberObject","isStringObject","isBooleanObject","isBigIntObject","isSymbolObject","isFloat32Array","isFloat64Array","isNonIndex","getOwnNonIndexProperties","compare","innerDeepEqual","val1","val2","memos","buf1","buf2","val1Tag","keys1","keys2","keyCheck","getTime","RegExp","Uint8Array","byteOffset","areSimilarTypedArrays","areSimilarFloatArrays","_keys","_keys2","valueOf","Boolean","BigInt","isEqualBoxedPrimitive","getEnumerables","iterationType","aKeys","bKeys","symbolKeysA","symbolKeysB","_symbolKeysB","position","val2MemoA","val2MemoB","areEq","objEquiv","delete","setHasEqualElement","memo","setValues","findLooseMatchingPrimitives","prim","setMightHaveLoosePrim","altValue","mapMightHaveLoosePrim","curB","mapHasEqualEntry","key1","item1","key2","aValues","Set","bValues","_val","setEquiv","aEntries","_aEntries$i","item2","bEntries","_i2","_bEntries$_i","mapEquiv","keysA","b64","lens","getLens","validLen","placeHoldersLen","toByteArray","Arr","_byteLength","curByte","revLookup","fromByteArray","uint8","extraBytes","parts","maxChunkLength","len2","encodeChunk","lookup","getIntFromBuffer","sum","encoding","dictionary","list","integer","find","chr","d","dict","lst","sep","getType","buffers","_floatConversionDetected","dictMap","listSet","buffE","buffD","buffL","maxLo","trace","sort","kl","digitCount","encodingLength","arrayBufferLength","stringLength","listLength","keyLength","objectLength","mapLength","bencode","log10","ArrayBuffer","isView","parseRange","range","reduce","idx","parseInt","generateRange","parse","compose","haystack","needle","comparator","low","high","getByteSize","BitField","opts","grow","isFinite","length_1","newBuffer","byte","arrayRemove","crypto","debug","randombytes","sha1","speedometer","stream","RC4","MESSAGE_PROTOCOL","MESSAGE_KEEP_ALIVE","MESSAGE_CHOKE","MESSAGE_UNCHOKE","MESSAGE_INTERESTED","MESSAGE_UNINTERESTED","MESSAGE_RESERVED","MESSAGE_PORT","MESSAGE_HAVE_ALL","MESSAGE_HAVE_NONE","VC","CRYPTO_PROVIDE","CRYPTO_SELECT","Request","piece","callback","HaveAllBitField","Wire","Duplex","retries","peEnabled","super","_debugId","_debug","peerId","peerIdBuffer","amChoking","amInterested","peerChoking","peerInterested","peerPieces","extensions","peerExtensions","requests","peerRequests","extendedMapping","peerExtendedMapping","extendedHandshake","peerExtendedHandshake","hasFast","allowedFastSet","peerAllowedFastSet","_ext","_nextExt","uploaded","downloaded","uploadSpeed","downloadSpeed","_keepAliveInterval","_timeout","_timeoutMs","_timeoutExpiresAt","destroyed","_finished","_parserSize","_parser","_buffer","_bufferSize","_peEnabled","_dh","createDiffieHellman","_myPubKey","generateKeys","_peerPubKey","_sharedSecret","_peerCryptoProvide","_cryptoHandshakeDone","_cryptoSyncPattern","_waitMaxBytes","_encryptionMethod","_encryptGenerator","_decryptGenerator","_setGenerators","once","_onFinish","on","_determineHandshakeType","_parsePe2","_parseHandshake","setKeepAlive","enable","clearInterval","setInterval","keepAlive","setTimeout","ms","unref","_timeoutUnref","_resetTimeout","destroy","emit","_onUninterested","_onChoke","Extension","ext","handler","noop","onHandshake","onExtendedHandshake","onMessage","_push","sendPe1","padALen","random","padA","sendPe2","padBLen","padB","sendPe3","infoHash","setEncrypt","hash1Buffer","sync","_utfToHex","hashesXorBuffer","padCLen","padCBuffer","vcAndProvideBuffer","writeInt16BE","_encryptHandshake","sendPe4","padDLen","padDBuffer","vcAndSelectBuffer","handshake","infoHashBuffer","toLowerCase","_infoHash","reserved","dht","fast","_handshakeSent","_extendedHandshakeSent","_sendExtendedHandshake","choke","request","includes","reject","unchoke","interested","uninterested","have","_message","bitfield","cb","cancel","_callback","_pull","port","suggest","haveAll","haveNone","allowedFast","extId","sharedSecret","encryptKey","decryptKey","encryptKeyBuf","encryptKeyIntArray","decryptKeyBuf","decryptKeyIntArray","randomByte","_read","numbers","dataLength","allocUnsafe","writeUInt32BE","_encrypt","_onKeepAlive","_onPe1","pubKeyBuffer","computeSecret","_onPe2","_onPe3","hash3","sKeyHash","_onPe3Encrypted","vcBuffer","peerProvideBuffer","equals","provideByte","_onPe4","peerSelectBuffer","_onHandshake","_onUnchoke","_onInterested","_onHave","_onBitField","_onRequest","respond","_onPiece","_onCancel","_onPort","_onSuggest","_onHaveAll","_onHaveNone","_onReject","_onAllowedFast","_onExtended","info","_onTimeout","_write","_decrypt","setAgain","clearTimeout","timeoutExpiresAt","_parse","parser","_parseUntil","pattern","maxBytes","_onMessageLength","readUInt32BE","_onMessage","pstrLenBuffer","pstrlen","_onHandshakeBuffer","_parsePe1","pubKeyPrefix","pubKeySuffix","_parsePe3","pubKey","_parsePe4","_parsePe3Encrypted","_decryptHandshake","iaLenBuf","iaLen","iaBuffer","protocol","vcBufferEncrypted","padDBuf","read","MAX_VALUE","req","crypt","keystream","decrypt","EventEmitter","parallel","Peer","queueMicrotask","common","HTTPTracker","UDPTracker","WebSocketTracker","Client","announce","browser","_peerIdBuffer","_peerIdBinary","_infoHashBuffer","_infoHashBinary","_port","_getAnnounceOpts","getAnnounceOpts","_rtcConfig","rtcConfig","_userAgent","userAgent","_proxyOpts","proxyOpts","_wrtc","wrtc","announceUrl","webrtcSupport","WEBRTC_SUPPORT","nextTickWarn","_trackers","parsedUrl","parseUrl","location","_defaultAnnounceOpts","event","_announce","tracker","stop","complete","update","scrape","intervalMs","tasks","numwant","DEFAULT_ANNOUNCE_PEERS","clientOpts","client","results","interval","DEFAULT_ANNOUNCE_INTERVAL","Socket","Socks","Tracker","socketPool","peers","socket","reconnecting","reconnectTimer","expectingResponse","_openSocket","connected","params","action","info_hash","peer_id","_trackerId","trackerid","_send","_generateOffers","offers","peer","trackerTimeout","removeListener","_onSocketConnectBound","_onSocketDataBound","_onSocketCloseBound","_onSocketErrorBound","consumers","timeout","destroyCleanup","DESTROY_TIMEOUT","_onSocketConnect","_onSocketError","_onSocketData","_onSocketClose","URL","agent","httpsAgent","httpAgent","socksProxy","Agent","url","_onAnnounceResponse","_onScrapeResponse","binaryToHex","failure","warning","trackerId","response","offer","_createPeer","answer","to_peer_id","offer_id","signal","offerId","files","_startReconnectTimer","send","generateOffer","initiator","hexToBinary","checkDone","trickle","config","onError","onConnect","_socketPool","MAX_ANNOUNCE_PEERS","defineProperties","href","origin","blob","Blob","reader","FileReader","addEventListener","onLoadEnd","removeEventListener","readAsArrayBuffer","Transform","nopad","zeroPadding","_zeroPadding","_buffered","_bufferedBytes","_transform","blockBufs","blockBufsBytes","neededSize","_flush","zeroes","move","src","_move","for","modrn","allocate","_toArrayLikeLE","_toArrayLikeBE","isNegNum","Rand","rand","generate","_rand","getBytes","getByte","getRandomValues","msCrypto","randomBytes","asUInt32Array","scrubVec","v","cryptBlock","M","keySchedule","SUB_MIX","SBOX","nRounds","t0","t1","t2","t3","SUB_MIX0","SUB_MIX1","SUB_MIX2","SUB_MIX3","s0","s1","s2","s3","ksRow","RCON","G","INV_SBOX","INV_SUB_MIX","xi","sx","x4","x8","AES","_reset","blockSize","keySize","keyWords","ksRows","invKeySchedule","ik","ksR","tt","_nRounds","_keySchedule","_invKeySchedule","encryptBlockRaw","encryptBlock","decryptBlock","m1","scrub","aes","GHASH","incr32","StreamCipher","iv","_cipher","ck","_ghash","_finID","ghash","toPad","ivBits","tail","writeUIntBE","calcIv","_prev","_secCache","_alen","_mode","_authTag","_called","_update","chunk","rump","encrypt","_final","final","xorTest","getAuthTag","setAuthTag","setAAD","ciphers","deciphers","modes","createCipher","Cipher","createCipheriv","Cipheriv","createDecipher","Decipher","createDecipheriv","Decipheriv","listCiphers","getCiphers","AuthCipher","MODES","ebtk","Splitter","_last","_autopadding","suite","password","flush","last","padded","unpad","setAutoPadding","setTo","autoPadding","PADDING","padBuff","writeUInt8","ZEROES","fromArray","block","_multiply","lsbVi","Vi","Zi","abl","bl","pad","encryptStart","encryptByte","byteParam","shiftIn","getBlock","chunkNum","modeModules","ECB","CBC","CFB","CFB8","CFB1","OFB","CTR","GCM","DES","aesModes","desModes","keyLen","ivLen","CipherBase","des","instantiate","EDE","modeName","_des","des3","getr","priv","modulus","prime1","prime2","crt","blinds","blinder","publicExponent","unblinder","blind","blinded","c1","c2","qinv","coefficient","exponent1","m2","exponent2","createHash","verify","algorithms","Sign","algorithm","Writable","_hashType","hash","_hash","_tag","_signType","Verify","createSign","createVerify","digest","sig","createHmac","EC","parseKeys","curves","getKey","algo","hlen","hbits","bits2int","bits2octets","fill","obits","makeKey","kv","makeR","hashType","signType","curve","curveId","keyFromPrivate","privateKey","toDER","ecSign","priv_key","H","dsaSign","checkValue","pub","pubkey","subjectPrivateKey","ecVerify","pub_key","unpacked","signature","montp","dsaVerify","padNum","Zstream","zlib_deflate","zlib_inflate","Zlib","DEFLATE","UNZIP","init_done","level","memLevel","strategy","windowBits","write_in_progress","pending_close","gzip_id_bytes_read","NONE","INFLATE","GZIP","GUNZIP","DEFLATERAW","INFLATERAW","close","deflateEnd","strm","inflateEnd","in_off","in_len","out_off","out_len","writeSync","async","Z_NO_FLUSH","Z_PARTIAL_FLUSH","Z_SYNC_FLUSH","Z_FULL_FLUSH","Z_FINISH","Z_BLOCK","avail_in","next_in","avail_out","next_out","_process","_checkError","_afterSync","nextTick","_after","next_expected_header_byte","deflate","inflate","Z_NEED_DICT","inflateSetDictionary","Z_OK","Z_DATA_ERROR","Z_STREAM_END","reset","Z_BUF_ERROR","_error","onerror","init","Z_FILTERED","Z_HUFFMAN_ONLY","Z_RLE","Z_FIXED","Z_DEFAULT_STRATEGY","_setDictionary","deflateInit2","Z_DEFLATED","inflateInit2","deflateSetDictionary","deflateReset","inflateReset","binding","kMaxLength","kRangeErrorMessage","Z_MIN_WINDOWBITS","Z_MAX_WINDOWBITS","Z_DEFAULT_WINDOWBITS","Z_MIN_CHUNK","Z_MAX_CHUNK","Z_DEFAULT_CHUNK","Z_MIN_MEMLEVEL","Z_MAX_MEMLEVEL","Z_DEFAULT_MEMLEVEL","Z_MIN_LEVEL","Z_MAX_LEVEL","Z_DEFAULT_LEVEL","Z_DEFAULT_COMPRESSION","bkeys","bk","bkey","Z_ERRNO","Z_STREAM_ERROR","Z_MEM_ERROR","Z_VERSION_ERROR","ckeys","ckey","zlibBuffer","engine","nread","flow","onEnd","zlibBufferSync","flushFlag","_finishFlushFlag","_processChunk","Deflate","Inflate","Gzip","Gunzip","DeflateRaw","InflateRaw","Unzip","isValidFlushFlag","flag","_opts","_chunkSize","chunkSize","finishFlush","_flushFlag","_handle","_hadError","errno","_close","_offset","_level","_strategy","emitCloseNT","freeze","createDeflate","createInflate","createDeflateRaw","createInflateRaw","createGzip","createGunzip","createUnzip","deflateSync","gzip","gzipSync","deflateRaw","deflateRawSync","unzip","unzipSync","inflateSync","gunzip","gunzipSync","inflateRaw","inflateRawSync","kind","_this2","_writableState","ended","ending","needDrain","availInBefore","availOutBefore","inOff","er","availInAfter","availOutAfter","newReq","bufferFill","hasFullSupport","isEncoding","fillWithNumber","isSingleByte","fillWithBuffer","ieee754","customInspectSymbol","SlowBuffer","INSPECT_MAX_BYTES","K_MAX_LENGTH","createBuffer","encodingOrOffset","fromString","arrayView","isInstance","fromArrayBuffer","fromArrayLike","fromArrayView","SharedArrayBuffer","checked","fromObject","toPrimitive","assertSize","mustMatch","loweredCase","utf8ToBytes","base64ToBytes","slowToString","hexSlice","utf8Slice","asciiSlice","latin1Slice","base64Slice","utf16leSlice","swap","bidirectionalIndexOf","dir","arrayIndexOf","lastIndexOf","indexSize","arrLength","valLength","foundIndex","found","hexWrite","remaining","strLen","parsed","utf8Write","blitBuffer","asciiWrite","byteArray","asciiToBytes","base64Write","ucs2Write","units","utf16leToBytes","firstByte","codePoint","bytesPerSequence","secondByte","thirdByte","fourthByte","tempCodePoint","codePoints","MAX_ARGUMENTS_LENGTH","decodeCodePointsArray","TYPED_ARRAY_SUPPORT","proto","foo","typedArraySupport","poolSize","allocUnsafeSlow","_isBuffer","swap16","swap32","swap64","toLocaleString","trim","thisStart","thisEnd","thisCopy","targetCopy","hexSliceLookupTable","checkOffset","checkInt","wrtBigUInt64LE","checkIntBI","wrtBigUInt64BE","checkIEEE754","writeFloat","noAssert","writeDouble","newBuf","subarray","readUintLE","readUIntLE","readUintBE","readUIntBE","readUint8","readUint16LE","readUInt16LE","readUint16BE","readUint32LE","readUInt32LE","readUint32BE","readBigUInt64LE","defineBigIntMethod","validateNumber","boundsError","readBigUInt64BE","readIntLE","readIntBE","readInt8","readInt16LE","readInt16BE","readInt32LE","readInt32BE","readBigInt64LE","readBigInt64BE","readFloatLE","readFloatBE","readDoubleLE","readDoubleBE","writeUintLE","writeUIntLE","writeUintBE","writeUint8","writeUint16LE","writeUInt16LE","writeUint16BE","writeUint32LE","writeUInt32LE","writeUint32BE","writeBigUInt64LE","writeBigUInt64BE","writeIntLE","writeIntBE","writeInt8","writeInt16LE","writeInt32LE","writeInt32BE","writeBigInt64LE","writeBigInt64BE","writeFloatLE","writeFloatBE","writeDoubleLE","writeDoubleBE","targetStart","copyWithin","E","addNumericalSeparator","ERR_OUT_OF_RANGE","checkBounds","ERR_BUFFER_OUT_OF_BOUNDS","received","isInteger","INVALID_BASE64_RE","leadSurrogate","base64clean","dst","alphabet","table","i16","BufferBigIntNotDefined","LRU","store","chunkLength","inProgressGets","put","remove","waiters","getAlreadyStarted","inProgressEntry","slicedBuf","GetIntrinsic","callBind","$indexOf","allowMissing","intrinsic","$apply","$call","$reflectApply","$gOPD","$defineProperty","$max","originalFunction","func","desc","applyBind","BlockStream","ChunkStoreWriteStream","_blockstream","_outstandingPuts","_storeMaxOutstandingPuts","storeMaxOutstandingPuts","pause","resume","_finalCb","StringDecoder","hashMode","_finalOrDigest","__final","_decoder","_encoding","inputEnc","outputEnc","outData","_toString","fin","_instanceof","nativeMap","nativeSet","nativePromise","circular","includeNonEnumerable","allParents","allChildren","useBuffer","_clone","__isArray","__isRegExp","__getRegExpFlags","lastIndex","__isDate","keyChild","valueChild","entryChild","attrs","symbols","symbol","allPropertyNames","getOwnPropertyNames","propertyName","__objToStr","global","ignoreCase","multiline","clonePrototype","times","functions","duration","format","object","expression","tuple","navigator","hardwareConcurrency","cpus","model","speed","user","nice","sys","idle","irq","elliptic","ECDH","aliases","secp256k1","secp224r1","prime256v1","prime192v1","ed25519","secp384r1","secp521r1","curveType","ec","formatReturnValue","bn","p256","secp256r1","secp192r1","p384","p521","genKeyPair","getPublicKey","inenc","keyFromPublic","getPublic","getPrivate","getX","getPrivateKey","setPublicKey","_importPublic","setPrivateKey","_priv","_importPrivate","MD5","RIPEMD160","sha","Hash","alg","Legacy","md5","ZEROS","Hmac","blocksize","_alg","ipad","_ipad","opad","_opad","calcPieceLength","corePath","FileReadStream","isFile","junk","MultiStream","getFiles","_parseInput","FileList","isBlob","commonPrefix","fullPath","unknownName","filterJunkFiles","isJunkPath","pathless","isReadable","basename","numPaths","isSingleFileTorrent","pathIsFile","processInput","file","getStream","getBlobStream","PassThrough","readable","counter","pipe","getStreamStream","flat","filename","sumLength","singleFileTorrent","announceList","globalThis","WEBTORRENT_ANNOUNCE","urlList","torrent","creationDate","comment","createdBy","private","sslCert","estimatedTorrentLength","pieceLength","pieces","hashedLength","streams","remainingHashes","pieceNum","multistream","blockstream","onData","onProgress","maybeDone","cleanup","getPieceList","torrentLength","onFiles","parseInput","rng","pseudoRandomBytes","prng","algos","algoKeys","hashes","getHashes","pbkdf2","pbkdf2Sync","dh","DiffieHellmanGroup","createDiffieHellmanGroup","getDiffieHellman","DiffieHellman","createECDH","publicEncrypt","privateEncrypt","publicDecrypt","privateDecrypt","rf","randomFill","randomFillSync","createCredentials","formatArgs","useColors","namespace","humanize","color","lastC","namespaces","storage","setItem","removeItem","load","getItem","env","DEBUG","__nwjs","document","documentElement","style","WebkitAppearance","firebug","exception","$1","localStorage","localstorage","colors","formatters","createDebug","prevTime","namespacesCache","enabledCache","enableOverride","enabled","curr","coerce","formatter","selectColor","extend","delimiter","newDebug","toNamespace","regexp","default","disable","names","skips","hasSymbols","toStr","origDefineProperty","supportsDescriptors","arePropertyDescriptorsSupported","predicate","predicates","utils","CBCState","_cbcInit","_cbcState","inp","outOff","superProto","bufferOff","_updateDecrypt","_updateEncrypt","_flushBuffer","inputOff","outputOff","_finalEncrypt","_finalDecrypt","_pad","_unpad","DESState","_desState","deriveKeys","shiftTable","kL","kR","pc1","r28shl","pc2","ip","lStart","rStart","keyL","keyR","expand","substitute","rip","EDEState","k1","k2","k3","_edeState","inL","inR","outL","outR","pc2table","sTable","permuteTable","padSplit","group","generatePrime","DH","ENCODINGS","gen","generator","genc","millerRabin","TWENTYFOUR","ELEVEN","TEN","THREE","SEVEN","_pub","primeCache","malleable","setGenerator","__prime","_primeLen","_primeCode","hex","rem","simpleSieve","fermatTest","checkPrime","__gen","_gen","secret","getPrime","front","getGenerator","findPrime","ONE","TWO","FIVE","FOUR","_getPrimes","n2","stream_1","tools_1","EbmlElementType_1","EbmlTagPosition_1","EbmlTagFactory_1","EbmlStreamDecoderOptions","bufferTagIds","EbmlStreamDecoder","readableObjectMode","_currentBufferOffset","_tagStack","_bufferTagIds","parseTags","currentTag","readTagHeader","EbmlElementType","Master","emitTag","EbmlTagPosition","Start","advanceBuffer","tagHeaderLength","Content","nextTag","absoluteStart","End","Tools","readVint","tagIdHex","readHexString","tagId","tagObject","EbmlTagFactory","emittedTag","parseContent","EbmlTagId_1","EbmlStreamEncoder","writableObjectMode","mCorked","openTags","startTag","writeTag","endTag","bufferAndFlush","_bufferAndFlush","cork","uncork","Children","inMemoryTag","EbmlTagId","EbmlStreamDecoder_1","Block","BlockLacing","EbmlDataTag","EbmlMasterTag","EbmlTag","SimpleBlock","getTagDeclaration","tagHex","vintSize","encodeContent","specialLength","Segment","Cluster","writeVint","EbmlMasterTag_1","EbmlDataTag_1","Block_1","SimpleBlock_1","static","foundType","ChapterDisplay","ContentCompression","ContentEncryption","SilentTracks","ContentEncoding","TrackTranslate","ChapProcessCommand","ChapterTranslate","ChapProcess","Tag","SimpleTag","Targets","Tags","ChapterTrack","ChapterAtom","EditionEntry","Chapters","AttachedFile","Attachments","CueReference","CueTrackPositions","CuePoint","Cues","ContentEncAESSettings","ContentEncodings","TrackJoinBlocks","TrackPlane","TrackCombinePlanes","TrackOperation","Audio","Video","TrackEntry","Tracks","ReferenceFrame","TimeSlice","Slices","BlockMore","BlockAdditions","BlockGroup","Info","Seek","SeekHead","SignatureElementList","SignatureElements","SignatureSlot","EBML","TrackType","FlagDefault","ChapterTrackNumber","ChapterTimeStart","ChapterTimeEnd","CueRefTime","CueRefCluster","ChapterFlagHidden","ContentCompAlgo","DocTypeReadVersion","EBMLVersion","DocTypeVersion","TagDefault","ChapterFlagEnabled","FileUsedStartTime","FileUsedEndTime","ContentEncodingOrder","ContentEncodingScope","ContentEncodingType","CueBlockNumber","BitDepth","ChapProcessTime","ChapProcessCodecID","AttachmentLink","TagAttachmentUID","TagChapterUID","TagEditionUID","TagTrackUID","TargetTypeValue","ChapterPhysicalEquiv","ChapterSegmentEditionUID","ChapterUID","EditionFlagOrdered","EditionFlagDefault","EditionFlagHidden","EditionUID","FileUID","CueRefCodecState","CueRefNumber","CueCodecState","CueDuration","CueRelativePosition","CueClusterPosition","CueTrack","CueTime","AESSettingsCipherMode","ContentSigHashAlgo","ContentSigAlgo","ContentEncAlgo","TrickMasterTrackUID","TrickTrackFlag","TrickTrackUID","TrackJoinUID","TrackPlaneType","TrackPlaneUID","Channels","AspectRatioType","DisplayUnit","DisplayHeight","DisplayWidth","PixelCropRight","PixelCropLeft","PixelCropTop","PixelCropBottom","PixelHeight","PixelWidth","OldStereoMode","AlphaMode","StereoMode","FlagInterlaced","TrackTranslateCodec","TrackTranslateEditionUID","SeekPreRoll","CodecDelay","TrackOverlay","CodecDecodeAll","MaxBlockAdditionID","DefaultDecodedFieldDuration","DefaultDuration","MaxCache","MinCache","FlagLacing","FlagForced","FlagEnabled","TrackUID","TrackNumber","ReferenceTimeCode","ReferenceOffset","SliceDuration","Delay","BlockAdditionID","FrameNumber","LaceNumber","ReferencePriority","BlockDuration","BlockAddID","PrevSize","Position","SilentTrackNumber","Timecode","TimecodeScaleDenominator","TimecodeScale","ChapterTranslateCodec","ChapterTranslateEditionUID","SeekPosition","SignatureHash","SignatureAlgo","EBMLMaxSizeLength","EBMLMaxIDLength","EBMLReadVersion","UnsignedInt","TrackOffset","DiscardPadding","ReferenceVirtual","ReferenceBlock","Integer","CodecID","DocType","FileMimeType","TagLanguage","TargetType","ChapCountry","ChapLanguage","CodecDownloadURL","CodecInfoURL","Language","ChapString","TagString","ChapterStringUID","WritingApp","SegmentFilename","CodecName","TagName","FileName","FileDescription","CodecSettings","Name","MuxingApp","Title","NextFilename","PrevFilename","UTF8","ContentCompSettings","SegmentFamily","TagBinary","FileReferral","SignedElement","ChapProcessData","ChapProcessPrivate","ChapterSegmentUID","FileData","ContentSigKeyID","ContentSignature","ContentEncKeyID","TrickMasterTrackSegmentUID","TrickTrackSegmentUID","ChannelPositions","ColourSpace","TrackTranslateTrackID","CodecPrivate","EncryptedBlock","CodecState","BlockAdditional","BlockVirtual","ChapterTranslateID","NextUID","PrevUID","SegmentUID","SeekID","Signature","SignaturePublicKey","CRC32","Void","Binary","Duration","OutputSamplingFrequency","SamplingFrequency","FrameRate","GammaValue","TrackTimecodeScale","Float","DateUTC","BlockLacing_1","subTypeId","writeTrackBuffer","writeValueBuffer","writeFlagsBuffer","invisible","lacing","None","Xiph","FixedSize","of","payload","readSigned","EbmlTag_1","readUnsigned","readFloat","readUtf8","writeUnsigned","writeSigned","_children","totalTagLength","keyframe","discardable","log2","desiredLength","buff","padStart","DataView","getUint8","getUint16","getUint32","firstValueIndex","findIndex","getInt8","getInt16","getInt32","NaN","getFloat32","getFloat64","version","eddsa","getNAF","getJSF","BaseCurve","conf","zero","pointFromJSON","gRed","_wnafT1","_wnafT2","_wnafT3","_wnafT4","_bitLength","adjustCount","redN","_maxwellTrick","BasePoint","precomputed","point","validate","_fixedNafMul","doubles","_getDoubles","naf","I","step","nafW","repr","jpoint","mixedAdd","points","toP","_wnafMul","nafPoints","_getNAFPoints","dblp","_wnafMulAdd","defW","coeffs","jacobianResult","wndWidth","comb","toJ","jsf","ja","jb","decodePoint","pointFromX","encodeCompressed","getY","precompute","power","beta","_getBeta","_hasDoubles","dbl","EdwardsCurve","twisted","mOneA","dd","oneC","Point","zOne","_mulA","_mulC","rhs","lhs","y2","pointFromY","isInfinity","normalize","fromJSON","_extDbl","nx","ny","nt","nz","_projDbl","_extAdd","_projAdd","mulAdd","jmulAdd","zi","eqXToP","xc","short","edwards","MontCurve","i4","a24","aa","bb","diffAdd","da","jumlAdd","ShortCurve","tinv","zeroA","threeA","endo","_getEndomorphism","_endoWnafT1","_endoWnafT2","isRed","inf","JPoint","lambda","betas","_getEndoRoots","lambdas","basis","vec","_getEndoBasis","ntinv","prevR","aprxSqrt","y1","len1","_endoSplit","v1","v2","p1","p2","q1","q2","ax","_endoWnafMulAdd","npoints","ncoeffs","pre","endoMul","obj2point","ys1","dyinv","_precompute","negate","zinv","zinv2","ay","pz2","z2","u1","u2","h2","h3","jx","jy","jz","jz4","jyd","jx2","jyd2","jyd4","dny","_zeroDbl","_threeDbl","_dbl","xx","yy","yyyy","yyyy8","c8","gamma","alpha","beta4","beta8","ggamma8","jy2","jxd4","jyd8","trpl","zz","mm","ee","yyu4","kbase","z3","pz3","zs","PresetCurve","defineCurve","sha256","sha384","sha512","HmacDRBG","KeyPair","nh","keyPair","fromPrivate","fromPublic","drbg","pers","persEnc","entropy","hmacStrength","entropyEnc","nonce","ns2","_truncateToN","truncOnly","ns1","iter","kp","kpX","recoveryParam","canonical","sinv","recoverPubKey","isYOdd","isSecondKey","rInv","getKeyRecoveryParam","Q","Qprime","privEnc","pubEnc","derive","_importDER","place","getLength","initial","octetLen","rmPadding","constructLength","octets","LN2","slen","backHalf","parseBytes","EDDSA","pointClass","keyFromSecret","hashInt","messagePrefix","R","Rencoded","encodePoint","s_","pubBytes","S","makeSignature","SG","intFromLE","fromSecret","lastIx","normed","xIsOdd","encodeInt","decodeInt","isPoint","cachedProperty","_secret","_pubBytes","privBytes","getSecret","_R","_S","_Rencoded","_Sencoded","Sencoded","toBytes","toHex","minAssert","minUtils","zero2","m8","d1","d2","m14","m24","computer","eos","rs","_readableState","cancelled","onlegacyfinish","onfinish","onend","onexit","exitCode","onclose","onclosenexttick","onrequest","setHeader","abort","isRequest","stdio","isChildProcess","ErrClass","firstSource","to","nextSource","keysArray","nextIndex","nextKey","polyfill","ReflectOwnKeys","ReflectApply","receiver","NumberIsNaN","emitter","errorListener","resolver","eventTargetAgnosticAddListener","addErrorHandlerIfEventEmitter","_events","_eventsCount","_maxListeners","defaultMaxListeners","checkListener","listener","_getMaxListeners","that","_addListener","prepend","events","existing","newListener","onceWrapper","fired","wrapFn","_onceWrap","wrapped","_listeners","unwrap","evlistener","unwrapListeners","arrayClone","listenerCount","wrapListener","setMaxListeners","getMaxListeners","doError","context","listeners","addListener","prependListener","prependOnceListener","originalListener","spliceOne","removeAllListeners","rawListeners","eventNames","salt","keyBits","used","keyStart","ivStart","hwm","top","btm","peek","FixedFIFO","head","Readable","_ready","_file","_size","onload","_generateHeaderBlocks","blocks","startOffset","endOffset","hasOwn","ERROR_MESSAGE","funcType","bound","binder","boundLength","boundArgs","Empty","implementation","RTCPeerConnection","mozRTCPeerConnection","webkitRTCPeerConnection","RTCSessionDescription","mozRTCSessionDescription","webkitRTCSessionDescription","RTCIceCandidate","mozRTCIceCandidate","webkitRTCIceCandidate","$SyntaxError","SyntaxError","$Function","$TypeError","getEvalledConstructor","expressionSyntax","throwTypeError","ThrowTypeError","calleeThrows","gOPDthrows","getProto","needsEval","TypedArray","INTRINSICS","AggregateError","Atomics","decodeURI","decodeURIComponent","encodeURI","encodeURIComponent","eval","EvalError","Float32Array","Float64Array","FinalizationRegistry","Int8Array","Int16Array","Int32Array","parseFloat","Uint8ClampedArray","Uint16Array","Uint32Array","URIError","WeakMap","WeakRef","WeakSet","doEval","LEGACY_ALIASES","$concat","$spliceApply","$replace","$strSlice","rePropName","reEscapeChar","stringToPath","quote","subString","getBaseIntrinsic","alias","intrinsicName","intrinsicBaseName","intrinsicRealName","skipFurtherCaching","isOwn","part","origSymbol","hasSymbolSham","symObj","syms","toStringTag","HashBase","_block","_blockSize","_blockOffset","_length","_finalized","prefix","throwIfNotStringOrBuffer","_digest","ripemd","hmac","sha224","ripemd160","BlockHash","pending","pendingTotal","outSize","padLength","_delta8","_delta32","join32","inner","outer","rotl32","sum32","sum32_3","sum32_4","K","Kh","Ah","Bh","Ch","Dh","Eh","T","rh","sh","toHex32","split32","shaCommon","sum32_5","ft_1","sha1_K","SHA1","W","SHA256","SHA224","ch32","maj32","s0_256","s1_256","g0_256","g1_256","sha256_K","T1","T2","SHA512","SHA384","rotr64_hi","rotr64_lo","shr64_hi","shr64_lo","sum64","sum64_hi","sum64_lo","sum64_4_hi","sum64_4_lo","sum64_5_hi","sum64_5_lo","sha512_K","ch64_hi","xh","xl","yh","yl","zh","ch64_lo","zl","maj64_hi","maj64_lo","s0_512_hi","s0_512_lo","s1_512_lo","g0_512_hi","g0_512_lo","g1_512_lo","_prepareBlock","c0_hi","c0_lo","c1_hi","c1_lo","c2_hi","c2_lo","c3_hi","c3_lo","ah","al","bh","ch","cl","dl","eh","el","fh","fl","gh","gl","hh","hl","c4_hi","c4_lo","T1_hi","T1_lo","T2_hi","T2_lo","rotr32","p32","isSurrogatePair","htonl","zero8","predResist","minEntropy","_reseed","reseedInterval","V","nonceEnc","seed","_hmac","kmac","reseed","addEnc","temp","http","https","validateParams","idb","closed","lastChunkLength","lastChunkIndex","dbPromise","openDB","upgrade","db","createObjectStore","blocking","terminated","isLastChunk","rawResult","notFound","deleteDB","idbProxyableTypes","cursorAdvanceMethods","cursorRequestMap","transactionDoneMap","transactionStoreNamesMap","transformCache","reverseTransformCache","idbProxyTraps","IDBTransaction","objectStoreNames","objectStore","wrap","transformCachableValue","IDBDatabase","transaction","IDBCursor","advance","continue","continuePrimaryKey","storeNames","tx","unlisten","DOMException","cacheDonePromiseForTransaction","IDBObjectStore","IDBIndex","IDBRequest","promise","success","promisifyRequest","newValue","blocked","indexedDB","open","openPromise","oldVersion","newVersion","deleteDatabase","readMethods","writeMethods","cachedMethods","getMethod","targetFuncName","useIndex","isWrite","storeName","all","oldTraps","isLE","mLen","nBytes","eLen","eMax","eBias","nBits","rt","mem","hasToStringTag","$toString","callBound","isStandardArguments","isLegacyArguments","callee","supportsStandardArguments","GeneratorFunction","fnToStr","isFnRegex","generatorFunc","getGeneratorFunc","getPolyfill","shim","availableTypedArrays","typedArrays","$slice","toStrTags","gOPD","typedArray","anyTrue","getter","tryTypedArrays","isTypedArray","isStrictTypedArray","loose","isLooseTypedArray","regex","not","RateLimiter","TokenBucket","hrtime","seconds","nanoseconds","getMilliseconds","tokensPerInterval","fireImmediately","tokenBucket","curIntervalStart","tokensThisInterval","removeTokens","bucketSize","waitInterval","afterTokensRemoved","tokensRemaining","tryRemoveTokens","removed","getTokensRemaining","drip","parentBucket","lastDrip","comeBackLater","remainingTokens","POSITIVE_INFINITY","deltaMS","dripAmount","maxAge","element","_unlink","_checkAge","modified","evict","ltDontHave","wire","_peerSupports","_wire","_failRequests","donthave","magnetURIDecode","xts","xt","infoHashV2Buffer","infoHashV2","xtsDeduped","publicKeyBuffer","xs","publicKey","dn","keywords","kt","tr","as","peerAddresses","startsWith","bep53Range","base32","uri","param","keyval","decodedStr","ARRAY16","_a","_b","_c","rotl","fnF","fnG","fnH","fnI","MediaElementWrapper","toArrayBuffer","MediaSource","_bufferDuration","bufferDuration","_elem","_mediaSource","_streams","detailedError","_errorHandler","createObjectURL","MediaSourceStream","wrapper","_wrapper","_allStreams","_sourceBuffer","_debugBuffers","_openHandler","_onSourceOpen","_flowHandler","_flow","_type","readyState","_createSourceBuffer","every","_dumpDebugData","endOfStream","createWriteStream","revokeObjectURL","bufs","createElement","download","click","isTypeSupported","addSourceBuffer","_cb","updating","appendBuffer","_getBufferDuration","buffered","currentTime","bufferEnd","bufferedTime","Storage","chunks","brorand","MillerRabin","_randbelow","min_bytes","_randrange","rone","n1","rn1","getDivisor","Mime","_types","_extensions","getExtension","typeMap","force","hasPath","Box","Descriptor","uint64be","TIME_OFFSET","writeReserved","writeDate","writeDate64","writeFixed32","writeMatrix","readMatrix","readFixed32","readDate64","readDate","readFixed16","readString","fullBoxes","ftyp","box","brands","compatibleBrands","brand","brandVersion","mvhd","ctime","mtime","timeScale","preferredRate","writeFixed16","preferredVolume","matrix","previewTime","previewDuration","posterTime","selectionTime","selectionDuration","nextTrackId","tkhd","trackId","layer","alternateGroup","volume","trackWidth","trackHeight","mdhd","language","quality","vmhd","graphicsMode","opcolor","smhd","balance","stsd","entries","ptr","entry","totalSize","avc1","VisualSampleEntry","dataReferenceIndex","height","hResolution","vResolution","frameCount","compressorName","nameLen","avcC","mimeCodec","mp4a","AudioSampleEntry","channelCount","sampleSize","sampleRate","esds","dcd","tagName","DecoderConfigDescriptor","oti","dsi","DecoderSpecificInfo","audioConfig","stsz","stss","stco","co64","stts","ctts","compositionOffset","stsc","firstChunk","samplesPerChunk","sampleDescriptionId","dref","elst","trackDuration","mediaTime","mediaRate","hdlr","handlerType","strBuffer","writeString","mehd","fragmentDuration","trex","defaultSampleDescriptionIndex","defaultSampleDuration","defaultSampleSize","defaultSampleFlags","mfhd","sequenceNumber","tfhd","tfdt","baseMediaDecodeTime","trun","dataOffset","sampleDuration","sampleFlags","sampleCompositionTimeOffset","mdat","contentLength","tagToName","lenByte","contentsLen","DescriptorArray","ESDescriptor","boxes","UINT32_MAX","containers","childType","otherBoxes","readHeaders","headersLen","contentLen","headers","decodeWithoutHeaders","contents","nextEvent","EMPTY","Decoder","_pending","_missing","_ignoreEmpty","_buf","_str","_ondrain","_writeBuffer","_writeCb","_kick","drained","consumed","_stream","MediaData","_readBox","bufferHeaders","additionalBuf","_headers","ignore","_parent","Encoder","_reading","_drain","_want","_onreadable","_onend","mediaData","encodeBufferLen","_forward","finalize","drain","plural","msAbs","isPlural","long","fmtShort","toStreams2Obj","toStreams2","objectMode","highWaterMark","toStreams2Buf","autoDestroy","_drained","_forwarding","_current","_toStreams2","_queue","_attachErrorListener","_next","_destroy","_gotNextStream","onReadable","onClose","keysShim","isArgs","isEnumerable","hasDontEnumBug","hasProtoEnumBug","dontEnums","equalsConstructorPrototype","excludedKeys","$applicationCache","$console","$external","$frame","$frameElement","$frames","$innerHeight","$innerWidth","$onmozfullscreenchange","$onmozfullscreenerror","$outerHeight","$outerWidth","$pageXOffset","$pageYOffset","$parent","$scrollLeft","$scrollTop","$scrollX","$scrollY","$self","$webkitIndexedDB","$webkitStorageInfo","$window","hasAutomationEqualityBug","isObject","isFunction","isArguments","isString","theKeys","skipProto","skipConstructor","equalsConstructorPrototypeIfNotBuggy","origKeys","originalKeys","keysWorksWithArguments","wrappy","called","onceStrict","onceError","TYPED_OK","_has","sources","shrinkBuf","fnTyped","arraySet","src_offs","dest_offs","flattenChunks","fnUntyped","setTyped","Buf8","Buf16","Buf32","adler","Z_TREES","Z_NO_COMPRESSION","Z_BEST_SPEED","Z_BEST_COMPRESSION","Z_BINARY","Z_TEXT","Z_UNKNOWN","crcTable","makeTable","crc","configuration_table","trees","adler32","crc32","MAX_MATCH","MIN_LOOKAHEAD","HCRC_STATE","BUSY_STATE","FINISH_STATE","errorCode","rank","flush_pending","pending_buf","pending_out","total_out","flush_block_only","_tr_flush_block","block_start","strstart","put_byte","putShortMSB","longest_match","cur_match","chain_length","max_chain_length","scan","best_len","prev_length","nice_match","w_size","_win","wmask","w_mask","strend","scan_end1","scan_end","good_match","lookahead","match_start","fill_window","more","_w_size","window_size","hash_size","total_in","insert","ins_h","hash_shift","hash_mask","deflate_fast","hash_head","bflush","match_length","_tr_tally","max_lazy_match","MIN_MATCH","last_lit","deflate_slow","max_insert","prev_match","match_available","Config","good_length","max_lazy","nice_length","max_chain","DeflateState","status","pending_buf_size","gzhead","gzindex","last_flush","w_bits","hash_bits","dyn_ltree","HEAP_SIZE","dyn_dtree","bl_tree","l_desc","d_desc","bl_desc","bl_count","MAX_BITS","heap","heap_len","heap_max","l_buf","lit_bufsize","d_buf","opt_len","static_len","matches","bi_buf","bi_valid","deflateResetKeep","data_type","_tr_init","max_block_size","max_start","deflateInit","deflateSetHeader","old_flush","beg","text","hcrc","extra","os","bstate","deflate_huff","deflate_rle","_tr_align","_tr_stored_block","avail","tmpDict","dictLength","deflateInfo","_in","_out","dmax","wsize","whave","wnext","s_window","hold","lcode","dcode","lmask","dmask","here","op","dist","from_source","lencode","distcode","lenbits","distbits","dolen","dodist","sane","inflate_fast","inflate_table","TYPE","BAD","zswap32","InflateState","havedict","check","wbits","ncode","nlen","ndist","work","lendyn","distdyn","back","was","inflateResetKeep","inflateReset2","lenfix","distfix","virgin","fixedtables","updatewindow","inflateInit","here_bits","here_op","here_val","last_bits","last_op","last_val","hbuf","order","inf_leave","xflags","extra_len","inflateGetHeader","inflateInfo","lbase","lext","dbase","dext","lens_index","table_index","incr","root","drop","huff","base_index","MAXBITS","offs","extra_index","extra_lbits","extra_dbits","extra_blbits","bl_order","static_ltree","static_dtree","D_CODES","_dist_code","_length_code","base_length","static_l_desc","static_d_desc","static_bl_desc","base_dist","StaticTreeDesc","static_tree","extra_bits","extra_base","elems","max_length","has_stree","TreeDesc","dyn_tree","stat_desc","max_code","d_code","put_short","send_bits","send_code","bi_reverse","gen_codes","next_code","init_block","LITERALS","END_BLOCK","bi_windup","smaller","_n2","_m2","pqdownheap","compress_block","ltree","dtree","lc","lx","build_tree","stree","xbits","overflow","gen_bitlen","scan_tree","curlen","prevlen","nextlen","max_count","min_count","REP_3_6","REPZ_3_10","REPZ_11_138","send_tree","static_init_done","stored_len","copy_block","LENGTH_CODES","L_CODES","tr_static_init","opt_lenb","static_lenb","max_blindex","black_mask","detect_data_type","BL_CODES","build_bl_tree","lcodes","dcodes","blcodes","send_all_trees","STATIC_TREES","bi_flush","certificate","RSAPrivateKey","seq","int","RSAPublicKey","PublicKey","AlgorithmIdentifier","bitstr","null_","PrivateKeyInfo","octstr","PrivateKey","EncryptedPrivateKeyInfo","EncryptedPrivateKey","DSAPrivateKey","DSAparam","ECPrivateKey","ECParameters","namedCurve","asn","Time","utcTime","utctime","generalTime","gentime","AttributeTypeValue","SubjectPublicKeyInfo","RelativeDistinguishedName","setof","RDNSequence","seqof","rdnSequence","Validity","bool","TBSCertificate","X509Certificate","findProc","startRegex","fullRegex","evp","okey","decrypted","cipherText","cipherKey","cipher","match2","aesid","fixProc","compat","passphrase","subtype","ndata","stripped","tbsCertificate","subjectPublicKeyInfo","subjectPublicKey","kde","kdeparams","iters","keylen","parameters","blobToBuffer","fs","magnet","parseTorrent","torrentId","torrentObj","ensure","infoBuffer","created","urls","lastFile","lastPieceLength","splitPieces","decodeTorrentFile","fieldName","remote","parseTorrentRemote","parsedTorrent","parseOrThrow","torrentBuf","readFile","toMagnetURI","toTorrentFile","assertPath","normalizeStringPosix","allowAboveRoot","lastSegmentLength","lastSlash","dots","lastSlashIndex","posix","cwd","resolvedPath","resolvedAbsolute","isAbsolute","trailingSeparator","joined","fromStart","fromEnd","fromLen","toStart","toLen","lastCommonSep","fromCode","_makeLong","dirname","hasRoot","matchedSlash","extIdx","firstNonSlashEnd","extname","startDot","startPart","preDotState","pathObject","_format","win32","ZERO_BUF","checkParameters","defaultEncoding","subtle","toBrowser","checks","getNextTick","setImmediate","browserPbkdf2","iterations","importKey","deriveBits","resolvePromise","prom","checkNative","resp","MAX_ALLOC","sizes","rmd160","saltLen","getDigest","ipad1","ipad2","run","DK","block1","destPos","hLen","U","title","argv","versions","umask","chdir","i2ops","mgf","withPublic","zBuffer","iHash","maskedSeed","maskedDb","dif","oaep","ps","pkcs1","paddedMsg","hLen2","dblen","nonZero","ancient","isFn","destroyer","reading","writing","ReadStream","WriteStream","isFS","destroys","qs","maxKeys","kstr","vstr","stringifyPrimitive","ks","MAX_BYTES","generated","oldBrowser","safeBuffer","kBufferMaxLength","kMaxUint32","assertOffset","actualFill","ourBuf","uint","mapWithIndex","mapWithoutIndex","sortByRangeIndex","sortByRangeStart","ranges","combine","ordered","combined","combineRanges","_position","currRange","writeStart","writeEnd","toWrite","createRC4","identityPermutation","randomNative","randomUInt32","randomFloat","currentState","setState","RC4small","ordA","ord0","fromHex","currentStateString","setStateString","stateString","objectKeys","allowHalfOpen","onEndNT","getBuffer","ReadableState","EElistenerCount","Stream","OurUint8Array","debugUtil","debuglog","createReadableStreamAsyncIterator","BufferList","destroyImpl","getHighWaterMark","ERR_STREAM_PUSH_AFTER_EOF","ERR_METHOD_NOT_IMPLEMENTED","ERR_STREAM_UNSHIFT_AFTER_END_EVENT","errorOrDestroy","kProxyEvents","isDuplex","pipes","pipesCount","flowing","endEmitted","needReadable","emittedReadable","readableListening","resumeScheduled","paused","emitClose","awaitDrain","readingMore","readableAddChunk","addToFront","skipChunkCheck","emitReadable","emitReadable_","onEofChunk","chunkInvalid","_uint8ArrayToBuffer","addChunk","maybeReadMore","_undestroy","undestroy","isPaused","setEncoding","MAX_HWM","howMuchToRead","computeNewHighWaterMark","maybeReadMore_","updateReadableListening","nReadingNextTick","resume_","fromList","consume","endReadable","endReadableNT","wState","finished","nOrig","doRead","pipeOpts","endFn","stdout","unpipe","onunpipe","unpipeInfo","hasUnpiped","ondrain","ondata","cleanedUp","pipeOnDrain","dests","ev","asyncIterator","_fromList","iterable","ERR_MULTIPLE_CALLBACK","ERR_TRANSFORM_ALREADY_TRANSFORMING","ERR_TRANSFORM_WITH_LENGTH_0","afterTransform","ts","_transformState","transforming","writecb","writechunk","needTransform","writeencoding","prefinish","err2","CorkedRequest","finish","corkReq","pendingcb","onCorkedFinish","corkedRequestsFree","WritableState","realHasInstance","internalUtil","deprecate","ERR_STREAM_CANNOT_PIPE","ERR_STREAM_DESTROYED","ERR_STREAM_NULL_VALUES","ERR_STREAM_WRITE_AFTER_END","ERR_UNKNOWN_ENCODING","nop","finalCalled","noDecode","decodeStrings","corked","bufferProcessing","onwrite","writelen","onwriteStateUpdate","finishMaybe","errorEmitted","onwriteError","needFinish","bufferedRequest","clearBuffer","afterWrite","lastBufferedRequest","prefinished","bufferedRequestCount","writev","_writev","doWrite","onwriteDrain","holder","allBuffers","isBuf","callFinal","need","rState","hasInstance","writeAfterEnd","validChunk","newChunk","decodeChunk","writeOrBuffer","setDefaultEncoding","endWritable","_Object$setPrototypeO","kLastResolve","kLastReject","kError","kEnded","kLastPromise","kHandlePromise","kStream","createIterResult","readAndResolve","AsyncIteratorPrototype","ReadableStreamAsyncIteratorPrototype","lastPromise","wrapForNext","_Object$create","enumerableOnly","hasStrings","_getString","_getBuffer","nb","getOwnPropertyDescriptors","emitErrorAndCloseNT","emitErrorNT","readableDestroyed","writableDestroyed","ERR_STREAM_PREMATURE_CLOSE","writableEnded","readableEnded","popCallback","ERR_INVALID_OPT_VALUE","duplexKey","highWaterMarkFrom","pipeline","render","validateFile","parseOpts","querySelector","renderMedia","nodeName","setMediaOpts","append","rootElem","createElem","appendChild","createMedia","mime","isAscii","streamToBlobURL","VideoStream","VIDEOSTREAM_EXTS","MEDIASOURCE_VIDEO_EXTS","MEDIASOURCE_EXTS","VIDEO_EXTS","AUDIO_EXTS","IMAGE_EXTS","IFRAME_EXTS","getElem","checkBlobLength","maxBlobLength","fatalError","renderMediaElement","getBlobURL","onLoadStart","onLoadedMetadata","autoplay","playPromise","play","renderIframe","sandbox","setAttribute","useMediaSource","prepareElem","fallbackToBlobURL","createReadStream","useBlobURL","fallbackToMediaSource","renderMediaSource","alt","tryRenderIframe","blobUrl","muted","controls","zr","sl","sr","hr","fn1","fn2","fn3","fn4","fn5","ar","br","cr","dr","tl","isErrored","isSync","each","task","factory","modules","installedModules","moduleId","__esModule","property","RushaCore","_require","ceilHeapSize","conv","padlen","getRawDigest","padMaxChunkLen","setInt32","Rusha","_maxChunkLen","_padMaxChunkLen","_heap","_h32","_h8","_core","_initState","padMsgLen","_padChunk","chunkLen","msgLen","padChunkLen","view","bin","h8","om","align","padZeroes","padData","chunkOffset","_coreCall","rawDigest","digestFromString","digestFromBuffer","digestFromArrayBuffer","resetState","turnOffset","inputLen","getState","rawEnd","precomputedHex","arrayBuffer","binarray","isDedicatedWorkerScope","isRunningInWorker","WorkerGlobalScope","isRunningInSharedWorker","SharedWorkerGlobalScope","isRunningInServiceWorker","ServiceWorkerGlobalScope","hashFile","hasher","readTotal","onloadend","workerBehaviourEnabled","onmessage","postMessage","hashData","runWorker","isRunningInDedicatedWorker","disableWorkerBehaviour","createWorker","worker","terminate","objectURL","webpackBootstrapFunc","oe","ENTRY_MODULE","dependencyRegExp","quoteRegExp","getModuleDependencies","queueName","retval","fnString","wrapperSignature","webpackRequireName","hasValuesInQueues","queues","hasValues","main","requiredModules","modulesQueue","seenModules","moduleToCheck","newModules","newModulesKeys","getRequiredModules","entryModule","bare","workerUrl","webkitURL","mozURL","msURL","Worker","stdlib$840","foreign$841","heap$842","H$843","hash$844","k$845","x$846","i$847","j$848","y0$849","z0$850","y1$851","z1$852","y2$853","z2$854","y3$855","z3$856","y4$857","z4$858","t0$859","t1$860","FileReaderSync","convBuf","H8","H32","lm","convStr","convBlob","_createClass","staticProps","_rusha","copyProps","SafeBuffer","safer","Safer","kStringMaxLength","MAX_LENGTH","MAX_STRING_LENGTH","finalSize","_finalSize","accum","assigned","remainder","lowBits","highBits","Algorithm","Sha","_w","rotl30","ft","Sha1","rotl5","Sha256","Sha224","_f","_g","_h","maj","sigma0","sigma1","gamma0","Sha384","_ah","_bh","_ch","_eh","_fh","_gh","_hh","_al","_bl","_cl","_dl","_el","_fl","_gl","_hl","writeInt64BE","Sha512","Gamma0","Gamma0l","Gamma1","Gamma1l","getCarry","gamma0l","gamma1","gamma1l","Wi7h","Wi7l","Wi16h","Wi16l","Wil","Wih","majh","majl","sigma0h","sigma0l","sigma1h","sigma1l","Kih","Kil","chh","chl","t1l","t1h","t2l","t2h","simpleGet","decompressResponse","querystring","isStream","maxRedirects","hostname","auth","json","form","accept","originalHost","followRedirects","statusCode","host","redirectHost","cookie","authorization","tryUnzip","getBrowserRTC","errCode","MAX_BUFFERED_AMOUNT","filterTrickle","sdp","_id","channelName","channelConfig","channelNegotiated","negotiated","offerOptions","answerOptions","sdpTransform","allowHalfTrickle","iceCompleteTimeout","destroying","_connected","remoteAddress","remoteFamily","remotePort","localAddress","localFamily","localPort","_pcReady","_channelReady","_iceComplete","_iceCompleteTimer","_channel","_pendingCandidates","_isNegotiating","_firstNegotiation","_batchedNegotiation","_queuedNegotiation","_sendersAwaitingStable","_senderMap","_closingInterval","_remoteTracks","_remoteStreams","_chunk","_interval","_pc","_isReactNativeWebrtc","_peerConnectionId","oniceconnectionstatechange","_onIceStateChange","onicegatheringstatechange","onconnectionstatechange","_onConnectionStateChange","onsignalingstatechange","_onSignalingStateChange","onicecandidate","_onIceCandidate","peerIdentity","_setupData","channel","createDataChannel","ondatachannel","addStream","ontrack","_onTrack","_needsNegotiation","_onFinishBound","bufferSize","bufferedAmount","address","family","renegotiate","transceiverRequest","addTransceiver","candidate","remoteDescription","_addIceCandidate","setRemoteDescription","_createAnswer","iceCandidateObj","addIceCandidate","getTracks","addTrack","submap","sender","replaceTrack","oldTrack","newTrack","removeTrack","removeStream","negotiate","_createOffer","onopen","binaryType","bufferedAmountLowThreshold","_onChannelMessage","onbufferedamountlow","_onChannelBufferedAmountLow","_onChannelOpen","_onChannelClose","lineno","colno","isClosing","destroySoon","_startIceCompleteTimeout","createOffer","sendOffer","localDescription","setLocalDescription","_requestMissingTransceivers","getTransceivers","transceiver","requested","createAnswer","sendAnswer","connectionState","iceConnectionState","iceGatheringState","_maybeReady","getStats","flattenValues","report","reports","stat","timestamp","_connecting","findCandidatePair","items","remoteCandidates","localCandidates","candidatePairs","foundSelectedCandidatePair","setSelectedCandidatePair","selectedCandidatePair","local","localCandidateId","ipAddress","portNumber","googLocalAddress","remoteCandidateId","googRemoteAddress","selectedCandidatePairId","googActiveConnection","selected","_onInterval","signalingState","sdpMLineIndex","sdpMid","eventStream","remoteStream","iceServers","sdpSemantics","rushaWorkerSha1","rusha","scope","webkitSubtle","sha1sync","uint8array","chars","bite","nextTaskId","cbs","taskId","_WebSocket","WebSocket","_ws","OPEN","_handleOpen","_handleMessage","_handleClose","_handleError","_handleFinishBound","_handleFinish","CLOSED","WEBSOCKET_SUPPORT","Throttle","ThrottleGroup","throttles","setEnabled","setRate","rate","chunksize","getEnabled","_enabled","getRate","bucket","getChunksize","throttle","setChunksize","_addThrottle","_removeThrottle","wait","_setEnabled","_group","_emitter","_destroyed","getGroup","amount","isDone","_areBothEnabled","_waitForTokens","timer","tick","maxTick","inc","pointer","EE","_isStdio","didOnEnd","ClientRequest","statusCodes","defaultProtocol","IncomingMessage","defaultMaxSockets","globalAgent","STATUS_CODES","METHODS","xhr","getXHR","XMLHttpRequest","XDomainRequest","checkTypeSupport","responseType","fetch","ReadableStream","writableStream","WritableStream","abortController","AbortController","arraybuffer","msstream","mozchunkedarraybuffer","overrideMimeType","capability","rStates","readyStates","preferBinary","_body","useFetch","decideMode","_fetchTimer","_socketTimeout","_socketTimer","lowerName","unsafeHeaders","getHeader","removeHeader","headersObj","headersList","keyName","controller","_fetchAbortController","requestTimeout","credentials","withCredentials","_fetchResponse","_resetTimers","_connect","_xhr","ontimeout","setRequestHeader","_response","onreadystatechange","LOADING","DONE","_onXHRProgress","onprogress","statusValid","flushHeaders","setNoDelay","setSocketKeepAlive","UNSENT","OPENED","HEADERS_RECEIVED","resetTimers","rawHeaders","trailers","rawTrailers","statusMessage","statusText","_resumeFetch","pipeTo","getReader","_pos","responseURL","getAllResponseHeaders","_charset","mimeType","charsetMatch","responseText","newData","MSStreamReader","getBlob","STREAM_DESTROYED","PREMATURE_CLOSE","queueTick","FIFO","MAX","NOT_OPENING","READ_DONE","READ_PIPE_NOT_DRAINED","WRITE_QUEUED","WRITE_DONE","WRITE_EMIT_DRAIN","WRITE_NEXT_TICK","WRITE_FINISHING","WRITE_NOT_ACTIVE","ACTIVE","READ_ACTIVE","AUTO_DESTROY","DESTROYING","ACTIVE_OR_TICKING","IS_OPENING","OPEN_STATUS","WRITE_STATUS","mapWritable","byteLengthWritable","queue","defaultByteLength","afterUpdateNextTick","updateWriteNT","_duplexState","autoBatch","DESTROY_STATUS","WRITE_ACTIVE","WRITE_PRIMARY","updateNonPrimary","afterFinal","_open","afterOpen","afterDestroy","updateNextTick","mapReadable","byteLengthReadable","afterRead","updateReadNT","Pipeline","isStreamx","afterDrain","READ_RESUMED","READ_EMIT_READABLE","READ_PRIMARY","TransformState","afterPipe","pipeToFinished","predestroy","_predestroy","WRITE_NON_PRIMARY","OPENING","eagerOpen","ite","return","_fromAsyncIterator","promiseResolve","promiseReject","throw","batch","transformAfterFlush","errorHandle","rd","wr","pipelinePromise","WRITE_UNDRAINED","nenc","retried","_normalizeEncoding","normalizeEncoding","utf16Text","utf16End","fillLast","utf8FillLast","base64Text","base64End","simpleWrite","simpleEnd","lastNeed","lastTotal","lastChar","utf8CheckByte","utf8CheckExtraBytes","utf8CheckIncomplete","byteTable","plain","quintets","shiftIndex","digit","encoded","plainChar","plainDigit","plainPos","decoded","encodedByte","arrayCopy","DHT","LSD","_intervalMs","_trackerOpts","_dhtAnnouncing","_dhtTimeout","_internalDHT","_onWarning","_onError","_onDHTPeer","_onTrackerPeer","_onTrackerAnnounce","_onLSDPeer","createDHT","listen","_createTracker","addNode","dhtPort","_dhtAnnounce","lsd","_createLSD","updatePort","BLOCK_LENGTH","Piece","missing","_chunks","_remainder","_cancellations","_reservations","_flushed","chunkLengthRemaining","reserve","reserveRemaining","cancelRemaining","splitData","bufferAlloc","UINT_32_MAX","nodeType","freeGlobal","punycode","maxInt","regexPunycode","regexNonASCII","regexSeparators","stringFromCharCode","mapDomain","ucs2decode","ucs2encode","digitToBasic","adapt","numPoints","firstTime","baseMinusTMin","basic","oldi","baseMinusT","bias","handledCPCount","basicLength","currentValue","handledCPCountPlusOne","qMinusT","Url","slashes","query","pathname","urlParse","resolveObject","protocolPattern","portPattern","simplePathPattern","unwise","autoEscape","nonHostChars","hostEndingChars","hostnamePartPattern","hostnamePartStart","unsafeProtocol","hostlessProtocol","slashedProtocol","parseQueryString","slashesDenoteHost","queryIndex","splitter","uSplit","rest","simplePath","lowerProto","atSign","hostEnd","hec","parseHost","ipv6Hostname","hostparts","newpart","validParts","notHost","toASCII","ae","esc","escape","qm","charAt","rel","tkeys","tk","tkey","rkeys","rk","rkey","relPath","isSourceAbs","isRelAbs","mustEndAbs","removeAllDots","srcPath","psychotic","isNullOrUndefined","authInHost","isNull","hasTrailingSlash","up","PIECE_LENGTH","metadata","utMetadata","_fetching","_metadataComplete","_metadataSize","_remainingRejects","_bitfield","setMetadata","ut_metadata","metadata_size","_numPieces","_requestPieces","trailer","trailerIndex","msg_type","_onData","total_size","_request","_data","_reject","_checkDone","_failedMetadata","isArgumentsObject","isGeneratorFunction","whichTypedArray","BigIntSupported","SymbolSupported","ObjectToString","numberValue","stringValue","booleanValue","bigIntValue","symbolValue","checkBoxedPrimitive","prototypeValueOf","isMapToString","isSetToString","isWeakMapToString","isWeakSetToString","isArrayBufferToString","isArrayBuffer","working","isDataViewToString","isDataView","isUint8Array","isUint8ClampedArray","isUint16Array","isUint32Array","isInt8Array","isInt16Array","isInt32Array","isBigInt64Array","isBigUint64Array","isWeakMap","isWeakSet","SharedArrayBufferCopy","isSharedArrayBufferToString","isSharedArrayBuffer","isAsyncFunction","isMapIterator","isSetIterator","isGeneratorObject","isWebAssemblyCompiledModule","descriptors","formatRegExp","objects","noDeprecation","throwDeprecation","traceDeprecation","debugs","debugEnvRegex","NODE_DEBUG","debugEnv","seen","stylize","stylizeNoColor","isBoolean","_extend","isUndefined","stylizeWithColor","formatValue","styleType","styles","simple","isNumber","formatPrimitive","visibleKeys","arrayToHash","formatError","braces","toUTCString","formatProperty","formatArray","reduceToSingleString","line","pid","types","isSymbol","isPrimitive","months","getHours","getMinutes","getSeconds","getDate","getMonth","kCustomPromisifiedSymbol","callbackifyOnRejected","newReason","promisify","original","callbackify","callbackified","maybeCb","rej","bs","mp4","RangeSliceStream","RunLengthIndex","countName","_entries","_countName","_index","_tracks","_findMoov","toSkip","fileStream","boxHandler","moov","_processMoov","traks","_hasVideo","_hasAudio","trak","stbl","mdia","minf","stsdEntry","codec","samples","sample","sampleInChunk","offsetInChunk","sampleToChunkIndex","dts","decodingTimeEntry","presentationOffsetEntry","syncSampleIndex","currChunkEntry","presentationOffset","chunkOffsetTable","nextChunkEntry","trackMoov","elng","dinf","mvex","trexs","fragmentSequence","currSample","currTime","_ftyp","ftypBuf","moovBuf","seek","_fileStream","outStream","inStream","fragment","_generateFragment","writeFragment","frag","moof","nextFrag","_findSampleBefore","trackInd","scaledTime","currTrack","firstSample","startDts","totalLen","_generateMoof","lastSample","trunVersion","trafs","pump","MP4Remuxer","mediaElem","_elemWrapper","_waitingFired","_trackMeta","preload","_createMuxer","_onWaiting","_muxer","_pump","trackData","mediaSource","muxed","initFlushed","onInitFlushed","pumpTrack","createTorrent","debugFactory","loadIPSet","ConnPool","Torrent","VERSION","VERSION_STR","VERSION_PREFIX","WebTorrent","nodeId","nodeIdBuffer","listening","torrentPort","torrents","maxConns","utp","UTP_SUPPORT","_downloadLimit","downloadLimit","_uploadLimit","uploadLimit","serviceWorker","workerKeepAliveInterval","workerPortCount","secure","throttleGroups","down","WRTC","_connPool","_onListening","_downloadSpeed","_uploadSpeed","enableWebSeeds","webSeeds","ready","blocklist","ipSet","loadWorker","ServiceWorker","filePath","ports","_serve","scriptURL","progress","ratio","ontorrent","onInfoHash","onReady","onseed","skipVerify","isFilePath","_onseed","preloadedStore","existingTorrent","_onTorrentId","_remove","_tables","tcpServer","throttleDownload","throttleUpload","_getByHash","infoHashHash","FileStream","_torrent","_startPiece","_endPiece","_piece","_notifying","_criticalLength","select","_notify","critical","getOpts","deselect","streamToBlob","streamToBuffer","rangeParser","_fileStreams","_serviceWorker","getPieceDownloaded","pieceIndex","pieceDownloaded","irrelevantFirstPieceBytes","irrelevantLastPieceBytes","priority","empty","_getMimeType","appendTo","renderTo","Expires","destination","piped","getStreamURL","streamTo","workerPath","enableSecure","createWebRTCPeer","conn","swarm","startConnectTimeout","createTCPIncomingPeer","_createIncomingPeer","createUTPIncomingPeer","createTCPOutgoingPeer","_createOutgoingPeer","createUTPOutgoingPeer","createWebSeedPeer","sentPe1","sentPe2","sentPe3","sentPe4","sentHandshake","connectTimeout","onPe1","onPe2","onPe3","onPe4","startHandshakeTimeout","setThrottlePipes","clearPipes","handshakeTimeout","_onWire","webrtc","tcpOutgoing","utpOutgoing","wires","removePeer","_pieces","recalculate","_initWire","_onWireHave","_onWireBitfield","getRarestPiece","pieceFilterFunc","candidates","availability","_cleanupWireEvents","_onClose","net","addrToIPPort","CacheChunkStore","Discovery","FSChunkStore","ImmediateChunkStore","MemoryChunkStore","parallelLimit","randomIterate","utPex","File","RarityMap","Server","WebConn","CHOKE_TIMEOUT","SPEED_THRESHOLD","FILESYSTEM_CONCURRENCY","RECONNECT_WAIT","USER_AGENT","TMP","statSync","tmpdir","getBlockPipelineLength","reqq","addUID","_store","_preloadedStore","_storeCacheSlots","storeCacheSlots","_destroyStoreOnDestroy","destroyStoreOnDestroy","maxWebConns","_rechokeNumSlots","uploads","_rechokeOptimisticWire","_rechokeOptimisticTime","_rechokeIntervalId","storeOpts","_amInterested","_selections","_critical","_peers","_peersLength","_servers","_xsRequests","_fileModtimes","fileModtimes","timeRemaining","numPeers","torrentFileBlobURL","torrentFile","_numQueued","_numConns","numConns","_onParsedTorrent","_processParsedTorrent","_rechoke","magnetURI","_onMetadata","_getMetadataFromServer","_startDiscovery","discovery","trackerOpts","addPeer","getMetadataFromURL","addWebSeed","_rarityMap","rawStore","so","_hashes","_onWireWithMetadata","_markAllVerified","_onStore","onPiecesVerified","getFileModtimes","_verifyPieces","_markVerified","rescanFiles","_hasAllPieces","_hasNoPieces","_hasMorePieces","threshold","_updateSelections","server","destroyStore","_isIPv4","wasAdded","_addPeer","_validAddr","newPeer","_registerPeer","urlOrConn","connId","_addIncomingPeer","notify","ut_pex","peerObj","timeoutId","onChokeTimeout","updateSeedStatus","isSeeder","_updateWireInterest","lt_donthave","_gcSelections","_updateInterest","oldOffset","_updateWireWrapper","requestIdleCallback","_updateWire","minOutstandingRequests","maxOutstandingRequests","requestAllowedFastSet","tried","tries","genPieceFilterFunc","validateWire","trySelectWire","shufflePriority","hotswap","secs","otherWire","otherSpeed","speedRanker","wireStack","objA","objB","wireA","wireB","numInterestedUnchoked","newOptimisticPeer","_hotswap","minWire","minSpeed","numRequests","isWebSeed","getPiecePipelineLength","reservation","onUpdateTick","onChunk","selection","createServer","requestListener","connect","reconnectTimeout","webPeerId","numPieces","httpRequest","retryTimeout","rangeStart","rangeEnd","requestedFiles","requestedFile","fileEnd","fileOffsetInRange","numRequestsSucceeded","hasError","onResponse","errHead","foundName","possibleNames","__webpack_module_cache__","__webpack_require__","cachedModule","loaded","__webpack_modules__","definition","nmd","paths","SSA_TYPES","SSA_KEYS","getData","SubtitleParserBase","subtitleTracks","timecodeScale","_currentClusterTimecode","parseEbmlSubtitles","codecID","cc","ccc","_compressed","blockDuration","subtitle","mimetype","SubtitleParser","SubtitleStream","prevInstance","unstable","decoderWrite","oncomplete","onsuccess","onabort","createStore","dbName","dbp","userAgentData","databases","tryIdb","finally","intervalId","onupgradeneeded","txMode","defaultGetStoreFunc","defaultGetStore","customStore","del","idbStore","getAll","getAllKeys","openCursor","eachCursor","cursor","rootDir","removeEntry","recursive","FSAChunkStore","rootDirPromise","getDirectory","storageDirPromise","_getStorageDirectoryHandle","chunksDirPromise","_getChunksDirHandle","chunkMap","directoryMap","prevFile","handle","_createFileHandle","fileStart","lastChunk","chunkStart","storageDir","getDirectoryHandle","fileName","fileHandlePromise","getFileHandle","_getDirectoryHandle","_getChunk","fileHandle","createWritable","keepExistingData","targets","promises","rangeFrom","rangeTo","getFile","isChrome","chrome","HybridChunkStore","fallbackStore","chunkCount","stores","_mapStore","TargetStore","targetLength","newOpts","newLength","registration","estimate","quota","usage","onlyMem","SubtitlesOctopus","canvas","renderMode","createImageBitmap","OffscreenCanvas","targetFps","prescaleTradeoff","softHeightLimit","hardHeightLimit","resizeVariation","video","canvasParent","onReadyEvent","onErrorEvent","lastRenderTime","timeOffset","renderedItems","renderAhead","oneshotState","eventStart","eventOver","iteration","renderRequested","requestNextTimestamp","prevWidth","prevHeight","renderFrameData","workerActive","frameId","onWorkerMessage","workerError","createCanvas","setVideo","currentScript","preMain","subUrl","subContent","fallbackFont","lazyFontLoading","fonts","availableFonts","libassMemoryLimit","libassGlyphLimit","renderOnDemand","dropAllAnimations","pushOffscreenCanvas","initDone","ImageData","getContext","imageData","createImageData","bufferCanvas","bufferCanvasCtx","testBuf","testImage","clearRect","prePut","getImageData","putImageData","drawImage","postPut","hasAlphaBug","canvasControl","transferControlToOffscreen","className","display","nextSibling","parentNode","insertBefore","timeupdate","playing","setCurrentTime","_cleanPastRendered","ResizeObserver","resize","observe","videoWidth","getVideoPosition","videoRatio","videoHeight","offsetWidth","offsetHeight","seekClean","retainedItems","emptyFinish","retain","processOneshot","spentTime","lastRenderedTime","eventFinish","viewport","blendTime","animated","canvases","image","eventSplitted","newFinish","tryRequestOneshot","renderNow","lastRendered","_renderSubtitleEvent","beforeDrawTime","performance","drawTime","oneshotRender","requestAnimationFrame","finishTime","eventShown","resetRenderAheadCache","isResizing","newCache","timeLimit","sizeLimit","stopTime","renderFrames","imageBuffer","libassTime","decodeTime","renderStart","renderFastFrames","bitmaps","bitmap","_computeCanvasSize","videoSize","newsize","devicePixelRatio","getBoundingClientRect","pointerEvents","resizeTimeoutBuffer","rePaint","onCustomMessage","runBenchmark","customMessage","userData","setTrackByUrl","setTrack","freeTrack","playbackRate","removeChild","createEvent","getEvents","setEvent","removeEvent","createStyle","getStyles","setStyle","removeStyle","waitToCompleteIceGathering","pc","polite","port1","port2","MessageChannel","ctrl","dc","signalingPort","makingOffer","ignoreOffer","description","offerCollision","WebTorrentPlayer","WebTorrentOpts","handleWorker","checkState","register","reg","active","waiting","installing","reload","cleanupVideo","setVolume","oldVolume","HTMLVideoElement","audioButton","audioTracks","removeAttribute","createRadioElement","ppToggle","playPause","toggleFullscreen","setProgress","dragBarEnd","dragBarStart","immerseTimeout","findSubtitleFiles","currentFile","subtitleData","tracks","renderer","defaultHeader","defaultSSAStyles","completed","checkCompletion","nextTimeout","autoNext","playNext","resolveFileMedia","videoFile","thumbnail","generateThumbnails","thumbCanvas","thumbnailWidth","thumbnailData","thumbnails","initThumbnail","createThumbnail","visibilityLossPause","wasPaused","visibilityState","onDone","immerseTime","playerWrapper","player","updateFullscreen","resetImmerse","immersePlayer","doubleTapTimeout","preventDefault","bufferTimeout","hideBuffering","showBuffering","handleAvailability","aval","toggleCast","presentationRequest","PresentationRequest","initCast","presentationConnection","presentation","defaultRequest","getAvailability","onchange","burnIn","togglePopout","seekTime","mediaSession","setActionHandler","updatePositionState","subtitleExtensions","videoExtensions","videoFiles","updateDisplay","offlineTorrents","torrentID","offlineDownload","streamedDownload","fps","lastmeta","waspaused","handleFrames","rawFPS","presentedFrames","toFixed","requestVideoFrameCallback","functionName","elements","toggleMute","toggleTheatre","captions","FileMedia","episodeNumber","episode","media","nowPlaying","forceMedia","navNowPlaying","classList","episodeInfo","episodeTitle","MediaMetadata","mediaTitle","artist","album","artwork","episodeThumbnail","mediaCover","poster","changeControlsIcon","initStream","initParser","handleSubtitleParser","postDownload","playVideo","downloadFile","_err","pictureInPictureElement","exitPictureInPicture","captionsButton","openPlaylist","textContent","setProperty","toggle","fullscreenElement","exitFullscreen","requestFullscreen","buildVideo","filemedia","playLast","connection","videostream","captureStream","getBurnIn","getVideoTracks","getAudioTracks","canvasVideo","srcObject","onloadedmetadata","requestPictureInPicture","onleavepictureinpicture","noSubs","loop","renderFrame","cancelVideoFrameCallback","delay","startedAt","animationFrame","cancelAnimationFrame","toTS","full","hours","minutes","prettyBytes","exponent","forward","rewind","setPositionState","fillRect","toDataURL","finishThumbnails","loadTime","progressPercent","progressWrapper","dataset","elapsed","downSpeed","upSpeed","selectCaptions","selectAudio","createDocumentFragment","htmlFor","trackNumber","constructSub","isNotAss","marginL","marginR","marginV","effect","parseSubtitles","skipFiles","fileStreamStream","skipFile","initSubtitleRenderer","convertSubFile","isAss","subtitles","matched","targetFile","subtitleFiles","extension","playTorrent","handleTorrent","cleanupTorrents","halfmoon","getElementById","searchParams","URLSearchParams","userBrowser","countdown","flattenObj","childObj","childObjKey","DOMPARSER","DOMParser","parseFromString","sleep","Queue","lastfn","settingsElements","player2","player3","player5","player6","player10","subtitle1","subtitle3","torrent1","torrent2","torrent3","torrent4","torrent7","torrent8","torrent9","torrent10","other1","other2","other3","setRes","settingsTab","applySettingsTimeout","regProtButton","registerProtocolHandler","settings","applyTimeout","saveSettings","torrent5","torrent5label","onclick","showDirectoryPicker","requestPermission","clearRelCache","setting","settingElement","oninput","Notification","perm","exclusions","edge","chromium","firefox","getRSSContent","xmlTxt","alertType","fillType","getRSSurl","torrent4list","loadHomePage","homeLoadElements","navSchedule","homeContinueMore","homeReleasesMore","homePlanningMore","homeTrendingMore","homeRomanceMore","homeActionMore","homePreviewElements","homeContinue","homeReleases","homePlanning","homeTrending","homeRomance","homeAction","homeSearchElements","searchText","searchGenre","searchYear","searchSeason","searchFormat","searchStatus","searchSort","browseGallery","homeLoadFunctions","page","gallerySkeleton","alRequest","status_in","alID","galleryAppend","Page","mediaList","mediaListEntry","nextAiringEpisode","gallery","pageInfo","hasNextPage","releases","cards","releasesCards","querySelectorAll","home","onscroll","planning","trending","clearSearch","romance","schedule","airingSchedules","countryOfOrigin","isAdult","option","searchClear","reloadHome","homePreviewFunctions","perPage","doc","pubDate","lastRSSDate","gallerySkeletonFrag","isRelease","mediaInformation","userPreferred","icon","coverImage","medium","focus","relations","parseObject","anime_title","Media","genre","skeletonCard","cloneNode","loadTimeout","lastDate","searchTimeout","canScroll","scrollTop","clientHeight","scrollHeight","timeUntilAiring","getDay","toLocaleDateString","weekday","cardCreator","viewMedia","function","navHome","searchWrapper","skeletonCardTemplate","bareCard","bareCardTemplate","fullCard","fullCardTemplate","card","nodes","extraLarge","innerHTML","episodes","season","seasonYear","genres","episode_number","firstElementChild","genreBadge","detailsMap","detailTemp","detailTemplate","trailerClose","trailerVideo","viewNodes","viewAnime","averageScore","badges","badge","genreBadges","nyaaSearch","bannerImage","trailerPopup","site","detail","mediaDetails","handleRequest","variables","perchunk","perChunk","startDate","Accept","queryObjects","Authorization","mediaId","setDate","setHours","anitomyscript","torrentRx","imageRx","traceAnime","readAsDataURL","similarity","anilist","clipboardData","formData","FormData","getAsFile","getAsString","img","episodeRx","isOffline","titles","synonyms","ep","excl","trusted","seeders","leechers","downloads","streamingEpisode","streamingEpisodes","fileMedia","template","nyaaRss","parsePromises","parseObjs","resolveTitle","assoc","ids","fileMedias","praseObj","resolveSeason","epMin","epMax","tempMedia","increment","edges","relationType","nextEdge","gapi","apiKey","clientId","discoveryDocs","token","auth2","isSignedIn","currentUser","getAuthResponse","signOut","access_token","gsignin","signIn","getFileNameID","pageSize","fields","includeItemsFromAllDrives","supportsAllDrives","corpora","lastRequest","gDriveID","endRange","setSize","aborted","bufferedBytes","it","playerControls","getElementsByClassName","pageWrapper","subtitle1list","MediaList","alEntry","oauth","Viewer","avatar"],"sourceRoot":""} \ No newline at end of file diff --git a/app/js/interface.js b/app/js/interface.js index c1171b5..951e48a 100644 --- a/app/js/interface.js +++ b/app/js/interface.js @@ -7,7 +7,7 @@ import { resolveFileMedia, relations, nyaaSearch } from './anime.js' import { getRSSurl, getRSSContent } from './rss.js' import { settings } from './settings.js' import { client } from './main.js' -import { countdown, flattenObj } from './util.js' +import { countdown, flattenObj, userBrowser } from './util.js' import halfmoon from 'halfmoon' export function loadHomePage () { const homeLoadElements = [navSchedule, homeContinueMore, homeReleasesMore, homePlanningMore, homeTrendingMore, homeRomanceMore, homeActionMore] @@ -19,7 +19,7 @@ export function loadHomePage () { if (!page) gallerySkeleton(browseGallery) const res = await alRequest({ method: 'UserLists', status_in: 'CURRENT', id: alID, page: page || 1 }) const mediaList = res.data.Page.mediaList.map(i => i.media).filter(media => { - return !(media.status === 'RELEASING' && media.mediaListEntry?.progress === media.nextAiringEpisode?.episode - 1) + return media.status !== 'RELEASING' || media.mediaListEntry?.progress < media.nextAiringEpisode?.episode - 1 }) galleryAppend({ media: mediaList, gallery: browseGallery, method: 'continue', page: page || 1 }) return res.data.Page.pageInfo.hasNextPage @@ -94,7 +94,7 @@ export function loadHomePage () { continue: function () { alRequest({ method: 'UserLists', status_in: 'CURRENT', id: alID, perPage: 50 }).then(res => { const mediaList = res.data.Page.mediaList.filter(({ media }) => { - return !(media.status === 'RELEASING' && media.mediaListEntry?.progress === media.nextAiringEpisode?.episode - 1) + return media.status !== 'RELEASING' || media.mediaListEntry?.progress < media.nextAiringEpisode?.episode - 1 }).slice(0, 5).map(i => i.media) galleryAppend({ media: mediaList, gallery: homeContinue }) }) @@ -305,6 +305,7 @@ function genreBadges (genres = []) { return badges } const detailsMap = [ + { property: 'episode', label: 'Airing', icon: 'schedule', custom: 'property' }, { property: 'genres', label: 'Genres', icon: 'theater_comedy' }, { property: 'season', label: 'Season', icon: 'spa', custom: 'property' }, { property: 'episodes', label: 'Episodes', icon: 'theaters', custom: 'property' }, @@ -316,7 +317,7 @@ const detailsMap = [ { property: 'averageScore', label: 'Rating', icon: 'trending_up', custom: 'property' }, { property: 'english', label: 'English', icon: 'title' }, { property: 'romaji', label: 'Romaji', icon: 'translate' }, - { property: 'native', label: 'Native', icon: '日本', custom: 'icon' } + { property: 'native', label: 'Native', icon: '語', custom: 'icon' } ] /* global detailTemplate */ const detailTemp = detailTemplate.cloneNode(true).content @@ -358,6 +359,8 @@ function mediaDetails (media) { nodes[4].textContent = media.averageScore + '%' } else if (detail.property === 'season') { nodes[4].textContent = [media.season?.toLowerCase(), media.seasonYear].filter(f => f).join(' ') + } else if (detail.property === 'episode') { + nodes[4].textContent = `Ep ${media.episode}: ${countdown(media.timeUntilAiring)}` } else { nodes[4].textContent = media[detail.property] } @@ -425,8 +428,8 @@ export function viewMedia (input, episode) { viewNodes[63].innerHTML = media.description - viewNodes[68].textContent = '' - viewNodes[68].append(...mediaDetails(media)) + viewNodes[66].textContent = '' + viewNodes[66].append(...mediaDetails(media)) } export let alID // login icon @@ -454,3 +457,12 @@ export function initMenu () { home.classList.add('noauth') } } + +if (userBrowser === 'firefox') { + halfmoon.initStickyAlert({ + content: 'Your browser will likely not support many video formats, containers and features. Please use Chromium!', + title: 'Bad Browser', + alertType: 'alert-danger', + fillType: '' + }) +} diff --git a/app/js/keys.js b/app/js/keys.js new file mode 100644 index 0000000..f95b362 --- /dev/null +++ b/app/js/keys.js @@ -0,0 +1,6 @@ +export const keys = { + apiKey: '', + clientId: '', + scope: 'https://www.googleapis.com/auth/drive.readonly', + discoveryDocs: ['https://www.googleapis.com/discovery/v1/apis/drive/v3/rest'] +} diff --git a/app/js/main.js b/app/js/main.js index be4ded4..665427e 100644 --- a/app/js/main.js +++ b/app/js/main.js @@ -7,6 +7,7 @@ import { alEntry } from './anilist.js' import { settings } from './settings.js' import { cardCreator, initMenu } from './interface.js' import halfmoon from 'halfmoon' +import { GDHandleTorrent } from './webseed.js' const playerControls = {} for (const item of document.getElementsByClassName('ctrl')) { @@ -16,6 +17,9 @@ for (const item of document.getElementsByClassName('ctrl')) { playerControls[item.dataset.name] = [playerControls[item.dataset.name], item] } } +window.addEventListener('beforeunload', () => { + client.destroy() +}) export const client = new WebTorrentPlayer({ WebTorrentOpts: { maxConns: 127, @@ -23,7 +27,8 @@ export const client = new WebTorrentPlayer({ uploadLimit: settings.torrent7 * 1572864, tracker: { announce: settings.torrent10.split('\n') - } + }, + destroyStore: true }, controls: playerControls, video: video, @@ -48,6 +53,7 @@ client.on('download-done', ({ file }) => { fillType: '' }) }) +client.on('torrent', GDHandleTorrent) client.on('watched', ({ filemedia }) => { if (filemedia?.media?.episodes || filemedia?.media?.nextAiringEpisode?.episode) { if (settings.other2 && (filemedia.media.episodes || filemedia.media.nextAiringEpisode?.episode > filemedia.episodeNumber)) { @@ -135,8 +141,6 @@ client.nowPlaying = { name: 'Miru' } window.client = client -window.onbeforeunload = () => { return '' } - if (searchParams.get('file')) client.playTorrent(searchParams.get('file')) queueMicrotask(initMenu) diff --git a/app/js/rss.js b/app/js/rss.js index ab78e55..f8e98fc 100644 --- a/app/js/rss.js +++ b/app/js/rss.js @@ -39,7 +39,7 @@ export async function nyaaRss (media, episode, isOffline) { const titles = [...new Set(Object.values(media.title).concat(media.synonyms).filter(name => name != null))].join(')|(').replace(/&/g, '%26') const ep = (media.episodes !== 1 && ((media.status === 'FINISHED' && settings.torrent9) ? `"01-${media.episodes}"|"01~${media.episodes}"|"Batch"|"Complete"|"+${episode}+"|"+${episode}v"|"S01"` : `"+${episode}+"|"+${episode}v"`)) || '' const excl = exclusions[userBrowser].join('|') - const quality = `"${settings.torrent1}"` || '"1080p"' + const quality = `${settings.torrent1}` || '"1080p"' const trusted = settings.torrent3 === true ? 2 : 0 const url = new URL(`https://meowinjapanese.cf/?page=rss&c=1_2&f=${trusted}&s=seeders&o=desc&q=(${titles})${ep}${quality}-(${excl})`) @@ -101,8 +101,8 @@ export async function nyaaRss (media, episode, isOffline) { export function getRSSurl () { if (Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0]) { - return settings.torrent4 === 'Erai-raws' ? new URL(Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0].innerHTML + settings.torrent1 + '-magnet') : new URL(Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0].innerHTML + settings.torrent1) + return new URL(Object.values(torrent4list.options).filter(item => item.value === settings.torrent4)[0].textContent + settings.torrent1) } else { - return settings.torrent4 + settings.torrent1 // add custom RSS + return new URL(settings.torrent4 + settings.torrent1) // add custom RSS } } diff --git a/app/js/settings.js b/app/js/settings.js index 632c2b6..579c975 100644 --- a/app/js/settings.js +++ b/app/js/settings.js @@ -1,7 +1,7 @@ -/* global volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent5, torrent5label, torrent7, torrent8, torrent9, torrent10, other1, other2, setRes, settingsTab, regProtButton, clearRelCache */ +/* global volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent5, torrent5label, torrent7, torrent8, torrent9, torrent10, other1, other2, other3, setRes, settingsTab, regProtButton, clearRelCache */ import { get, set, createStore } from 'idb-keyval' export const settingsElements = [ - volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent7, torrent8, torrent9, torrent10, other1, other2 + volume, player2, player3, player5, player6, player10, subtitle1, subtitle3, torrent1, torrent2, torrent3, torrent4, torrent7, torrent8, torrent9, torrent10, other1, other2, other3 ] setRes.addEventListener('click', restoreDefaults) settingsTab.addEventListener('click', applySettingsTimeout) @@ -39,10 +39,6 @@ async function saveSettings () { } } -if (Object.keys(settings).length !== settingsElements.length + 1) { - saveSettings() -} - let applyTimeout function applySettingsTimeout () { clearTimeout(applyTimeout) @@ -74,4 +70,6 @@ for (const setting of Object.entries(settings)) { if (settingElement) settingElement.type === 'checkbox' ? settingElement.checked = setting[1] : settingElement.value = setting[1] } +saveSettings() + other1.oninput = () => other1.checked && Notification.requestPermission().then(perm => { perm === 'denied' ? other1.checked = false : other1.checked = true }) diff --git a/app/js/util.js b/app/js/util.js index c09e127..3cff58c 100644 --- a/app/js/util.js +++ b/app/js/util.js @@ -1,23 +1,28 @@ import halfmoon from 'halfmoon' + halfmoon.showModal = id => { const t = document.getElementById(id) t && t.classList.add('show') } + halfmoon.hideModal = id => { const t = document.getElementById(id) t && t.classList.remove('show') } + export const searchParams = new URLSearchParams(location.href) if (searchParams.get('access_token')) { localStorage.setItem('ALtoken', searchParams.get('access_token')) window.location = '/app/#home' } + export const userBrowser = (() => { if (window.chrome) { return (navigator.userAgent.indexOf('Edg') !== -1) ? 'edge' : 'chromium' } return 'firefox' })() + export function countdown (s) { const d = Math.floor(s / (3600 * 24)) s -= d * 3600 * 24 @@ -50,3 +55,67 @@ export function flattenObj (obj) { } export const DOMPARSER = new DOMParser().parseFromString.bind(new DOMParser()) + +export function concat (chunks, size) { + if (!size) { + size = 0 + let i = chunks.length || chunks.byteLength || 0 + while (i--) size += chunks[i].length + } + const b = new Uint8Array(size) + let offset = 0 + for (let i = 0, l = chunks.length; i < l; i++) { + const chunk = chunks[i] + b.set(chunk, offset) + offset += chunk.byteLength || chunk.length + } + + return b +} + +export const sleep = t => new Promise(resolve => setTimeout(resolve, t)) + +export class Queue { + constructor () { + this.queue = [] + this.destroyed = false + this.lastfn = null + } + + add (obj) { // index, fn + if (this.destroyed) return + // most common case, requests are in order + // also push to the end of queue if there's an outstanding high range request [for example EOF metadata] + // this impacts backwards seeking performance a bit, but is needed for metadata + if (!this.queue.length || obj.index > this.queue[this.queue.length - 1].index || obj.index < this.queue[0].index - 10) { + this.queue.push(obj) + if (this.queue.length === 1) this._next() + } else { + // otherwise if one request failed its likely the oldest, or older one, so iterate backwards [forwards since queue is reversed] + for (let i = 0; i < this.queue.length; i++) { + if (this.queue[i].index > obj.index) { + this.queue.splice(i, 0, obj) + return + } + } + this.queue.push(obj) + console.warn('got bad') + } + } + + async _next () { + const obj = this.queue[0] + await obj.fn() + this._remove(obj) + if (!this.destroyed && this.queue.length) this._next() + } + + _remove (obj) { + if (!this.destroyed) this.queue.splice(this.queue.indexOf(obj), 1) + } + + destroy () { + this.destroyed = true + this.queue = null + } +} diff --git a/app/js/webseed.js b/app/js/webseed.js new file mode 100644 index 0000000..68cd720 --- /dev/null +++ b/app/js/webseed.js @@ -0,0 +1,249 @@ +/* global gsignin */ +import BitField from 'bitfield' +import sha1 from 'simple-sha1' +import Wire from 'bittorrent-protocol' +import { load, client, auth2 } from 'gapi' +import { keys } from './keys.js' +import { concat, sleep, Queue } from './util.js' +import halfmoon from 'halfmoon' + +// i'll fucking give you 'thenable', shitass callbacks +export const token = new Promise(resolve => { + load('client:auth2', () => { + client.init(Object.assign({}, keys)).then(() => { + const auth = auth2.getAuthInstance() + auth.isSignedIn.listen(state => { + if (state === true) { + if (!auth.currentUser.get().getAuthResponse().scope.includes('https://www.googleapis.com/auth/drive.readonly')) { + halfmoon.initStickyAlert({ + content: 'You didn\'t grant permission for Google Drive access, try again!', + title: 'Login Error', + alertType: 'alert-danger', + fillType: '' + }) + return auth.signOut() + } + resolve(auth.currentUser.get().getAuthResponse().access_token) + gsignin.classList.add('d-none') + } + }) + if (!auth.isSignedIn.get()) { + gsignin.onclick = auth.signIn + gsignin.classList.remove('d-none') + } else { + if (!auth.currentUser.get().getAuthResponse().scope.includes('https://www.googleapis.com/auth/drive.readonly')) { + halfmoon.initStickyAlert({ + content: 'You didn\'t grant permission for Google Drive access, try again!', + title: 'Login Error', + alertType: 'alert-danger', + fillType: '' + }) + return auth.signOut() + } + resolve(auth.currentUser.get().getAuthResponse().access_token) + } + }) + }) +}) + +export async function getFileNameID (name) { + return new Promise(resolve => { + token.then(() => { + client.drive.files.list({ + pageSize: 1, + fields: 'files(id)', + includeItemsFromAllDrives: true, + supportsAllDrives: true, + corpora: 'allDrives', + q: `name = '${name}'` + }).then(res => { + console.log(res) + resolve(res?.result?.files?.length && res?.result?.files[0].id) + }) + }) + }) +} +export async function GDHandleTorrent (torrent) { + await token + for await (const file of torrent.files) { + const gDriveID = await getFileNameID(file.name) + if (gDriveID) { + file.gDriveID = gDriveID + } else { + halfmoon.initStickyAlert({ + content: `Couldn't find a GDrive file for ${file.name}! Can't create webseed!`, + title: 'GDrive Error!', + alertType: 'alert-secondary', + fillType: '' + }) + return null // if a single entry doesnt exist, I can't create a reliable webseed + } + await sleep(1000) + } + torrent.addWebSeed(new WebConn(torrent)) +} + +class WebConn extends Wire { + constructor (torrent) { + super() + + this.connId = torrent.infoHash + ' gdrive' // Unique id to deduplicate web seeds + this.webPeerId = sha1.sync(this.connId) + this._torrent = torrent + this.lastRequest = {} + + this.sleep = null + + this.queue = new Queue() + + this._init() + } + + _init () { + this.setKeepAlive(true) + + this.once('handshake', (infoHash, peerId) => { + if (this.destroyed) return + this.handshake(infoHash, this.webPeerId) + const numPieces = this._torrent.pieces.length + const bitfield = new BitField(numPieces) + for (let i = 0; i <= numPieces; i++) { + bitfield.set(i, true) + } + this.bitfield(bitfield) + }) + + this.once('interested', () => { + this.unchoke() + }) + + this.on('request', (pieceIndex, offset, length, callback) => { + const request = () => this.queue.add({ + fn: async () => await this.httpRequest(pieceIndex, offset, length, (err, data) => { + if (err || data?.length !== length) return request() + callback(err, data) + }), + index: pieceIndex + }) + request() + }) + } + + async httpRequest (pieceIndex, offset, length, cb) { + const pieceOffset = pieceIndex * this._torrent.pieceLength + const rangeStart = pieceOffset + offset + const rangeEnd = rangeStart + length - 1 + const files = this._torrent.files + let requests + if (files.length <= 1) { + requests = [{ + url: `https://www.googleapis.com/drive/v3/files/${files[0].gDriveID}?supportsAllDrives=true&alt=media&key=${keys.apiKey}`, + start: rangeStart, + end: rangeEnd + }] + } else { + const requestedFiles = files.filter(file => file.offset <= rangeEnd && (file.offset + file.length) > rangeStart) + if (requestedFiles.length < 1) { + return cb(new Error('Could not find file corresponding to web seed range request')) + } + + requests = requestedFiles.map(file => { + const fileEnd = file.offset + file.length - 1 + const url = `https://www.googleapis.com/drive/v3/files/${file.gDriveID}?supportsAllDrives=true&alt=media&key=${keys.apiKey}` + return { + url, + fileOffsetInRange: Math.max(file.offset - rangeStart, 0), + start: Math.max(rangeStart - file.offset, 0), + end: Math.min(fileEnd, rangeEnd - file.offset) + } + }) + } + let numRequestsSucceeded = 0 + let hasError = false + + let ret + if (requests.length > 1) { + ret = Buffer.alloc(length) + } + + let { res, reader, endRange, setSize, ctrl } = this.lastRequest + for await (const request of requests) { + const { url, start, end } = request + function onResponse (res, data) { + if (!res || res.status < 200 || res.status >= 300) { + if (hasError) return + hasError = true + return cb(new Error(`Unexpected HTTP status code ${res?.status}`)) + } + if (requests.length === 1) { + cb(null, data) + } else { + data.copy(ret, request.fileOffsetInRange) + if (++numRequestsSucceeded === requests.length) { + cb(null, ret) + } + } + } + if (endRange !== start - 1 || ctrl?.signal?.aborted) { + async function * read (reader) { // <3 Endless + let buffered = [] + let bufferedBytes = 0 + let done = false + let size = 512 + const setSize = x => { size = x } + yield setSize + + while (!done) { + const it = await reader.read() + done = it.done + if (done) { + yield concat(buffered, bufferedBytes) + return + } else { + bufferedBytes += it.value.byteLength + buffered.push(it.value) + + while (bufferedBytes >= size) { + const b = concat(buffered) + bufferedBytes -= size + yield b.slice(0, size) + buffered = [b.slice(size, b.length)] + } + } + } + } + if (ctrl) ctrl.abort() + ctrl = new AbortController() + await this.sleep + try { + res = await fetch(url, { + headers: { + range: `bytes=${start}-`, + authorization: 'Bearer ' + await token + }, + signal: ctrl.signal + }) + } catch (e) { + this.sleep = sleep(500) + onResponse() + throw e + } + this.sleep = sleep(500) + reader = read(res.body.getReader(), 1) + setSize = (await reader.next()).value // lazy, but 1st yield is callback x) + } + endRange = end + setSize(end - start + 1) + onResponse(res, (await reader.next()).value || new Uint8Array()) + } + this.lastRequest = { res, reader, endRange, setSize, ctrl } + } + + destroy () { + this.lastRequest?.ctrl?.abort() + this.queue.destroy() + this.lastRequest?.ctrl?.abort() + super.destroy() + this._torrent = null + } +} diff --git a/app/lib/cast.html b/app/lib/cast.html index 046086e..895a0a5 100644 --- a/app/lib/cast.html +++ b/app/lib/cast.html @@ -26,7 +26,7 @@ function addConnection (connection) { peer = new window.Peer({ polite: false }) peer.pc.ontrack = evt => { - evt.receiver.playoutDelayHint = 3 + evt.receiver.playoutDelayHint = 0.5 if (!video.srcObject) { video.srcObject = evt.streams[0] video.volume = 1 diff --git a/index.html b/index.html index 8c2b5c0..ad527db 100644 --- a/index.html +++ b/index.html @@ -15,7 +15,7 @@ - + diff --git a/site.webmanifest b/site.webmanifest index 41b5c08..61fb74b 100644 --- a/site.webmanifest +++ b/site.webmanifest @@ -7,7 +7,6 @@ "entertainment" ], "lang": "en-US", - "orientation": "landscape", "background_color": "#191c20", "theme_color": "#191c20", "scope": "/app/", @@ -28,14 +27,14 @@ } }, "intent_filters": { - "scope_url_scheme": "http", - "scope_url_host": "localhost", + "scope_url_scheme": "https", + "scope_url_host": "miru.pages.dev", "scope_url_path": "/app/" }, "capture_links": "existing-client-navigate", "url_handlers": [ { - "origin": "https://localhost:5500" + "origin": "https://miru.pages.dev" } ], "protocol_handlers": [ diff --git a/webpack.config.js b/webpack.config.js index 0cd14bc..b868473 100644 --- a/webpack.config.js +++ b/webpack.config.js @@ -6,14 +6,14 @@ module.exports = { externals: { halfmoon: 'halfmoon', anitomyscript: 'anitomyscript', - gapi: 'commonjs gapi' + gapi: 'globalThis.gapi' }, output: { filename: 'bundle.js', path: path.resolve(__dirname, 'app/js'), sourceMapFilename: 'bundle.js.map' }, - mode: 'development', + mode: 'production', devtool: 'source-map', plugins: [ new webpack.ProvidePlugin({